1c1d7c514SDavid Sterba // SPDX-License-Identifier: GPL-2.0 25d4f98a2SYan Zheng /* 35d4f98a2SYan Zheng * Copyright (C) 2009 Oracle. All rights reserved. 45d4f98a2SYan Zheng */ 55d4f98a2SYan Zheng 65d4f98a2SYan Zheng #include <linux/sched.h> 75d4f98a2SYan Zheng #include <linux/pagemap.h> 85d4f98a2SYan Zheng #include <linux/writeback.h> 95d4f98a2SYan Zheng #include <linux/blkdev.h> 105d4f98a2SYan Zheng #include <linux/rbtree.h> 115a0e3ad6STejun Heo #include <linux/slab.h> 12726a3421SQu Wenruo #include <linux/error-injection.h> 135d4f98a2SYan Zheng #include "ctree.h" 145d4f98a2SYan Zheng #include "disk-io.h" 155d4f98a2SYan Zheng #include "transaction.h" 165d4f98a2SYan Zheng #include "volumes.h" 175d4f98a2SYan Zheng #include "locking.h" 185d4f98a2SYan Zheng #include "btrfs_inode.h" 195d4f98a2SYan Zheng #include "async-thread.h" 200af3d00bSJosef Bacik #include "free-space-cache.h" 2162b99540SQu Wenruo #include "qgroup.h" 22cdccee99SLiu Bo #include "print-tree.h" 2386736342SJosef Bacik #include "delalloc-space.h" 24aac0023cSJosef Bacik #include "block-group.h" 2519b546d7SQu Wenruo #include "backref.h" 26e9a28dc5SQu Wenruo #include "misc.h" 275d4f98a2SYan Zheng 285d4f98a2SYan Zheng /* 290c891389SQu Wenruo * Relocation overview 300c891389SQu Wenruo * 310c891389SQu Wenruo * [What does relocation do] 320c891389SQu Wenruo * 330c891389SQu Wenruo * The objective of relocation is to relocate all extents of the target block 340c891389SQu Wenruo * group to other block groups. 350c891389SQu Wenruo * This is utilized by resize (shrink only), profile converting, compacting 360c891389SQu Wenruo * space, or balance routine to spread chunks over devices. 370c891389SQu Wenruo * 380c891389SQu Wenruo * Before | After 390c891389SQu Wenruo * ------------------------------------------------------------------ 400c891389SQu Wenruo * BG A: 10 data extents | BG A: deleted 410c891389SQu Wenruo * BG B: 2 data extents | BG B: 10 data extents (2 old + 8 relocated) 420c891389SQu Wenruo * BG C: 1 extents | BG C: 3 data extents (1 old + 2 relocated) 430c891389SQu Wenruo * 440c891389SQu Wenruo * [How does relocation work] 450c891389SQu Wenruo * 460c891389SQu Wenruo * 1. Mark the target block group read-only 470c891389SQu Wenruo * New extents won't be allocated from the target block group. 480c891389SQu Wenruo * 490c891389SQu Wenruo * 2.1 Record each extent in the target block group 500c891389SQu Wenruo * To build a proper map of extents to be relocated. 510c891389SQu Wenruo * 520c891389SQu Wenruo * 2.2 Build data reloc tree and reloc trees 530c891389SQu Wenruo * Data reloc tree will contain an inode, recording all newly relocated 540c891389SQu Wenruo * data extents. 550c891389SQu Wenruo * There will be only one data reloc tree for one data block group. 560c891389SQu Wenruo * 570c891389SQu Wenruo * Reloc tree will be a special snapshot of its source tree, containing 580c891389SQu Wenruo * relocated tree blocks. 590c891389SQu Wenruo * Each tree referring to a tree block in target block group will get its 600c891389SQu Wenruo * reloc tree built. 610c891389SQu Wenruo * 620c891389SQu Wenruo * 2.3 Swap source tree with its corresponding reloc tree 630c891389SQu Wenruo * Each involved tree only refers to new extents after swap. 640c891389SQu Wenruo * 650c891389SQu Wenruo * 3. Cleanup reloc trees and data reloc tree. 660c891389SQu Wenruo * As old extents in the target block group are still referenced by reloc 670c891389SQu Wenruo * trees, we need to clean them up before really freeing the target block 680c891389SQu Wenruo * group. 690c891389SQu Wenruo * 700c891389SQu Wenruo * The main complexity is in steps 2.2 and 2.3. 710c891389SQu Wenruo * 720c891389SQu Wenruo * The entry point of relocation is relocate_block_group() function. 730c891389SQu Wenruo */ 740c891389SQu Wenruo 750647bf56SWang Shilong #define RELOCATION_RESERVED_NODES 256 762a979612SQu Wenruo /* 775d4f98a2SYan Zheng * map address of tree root to tree 785d4f98a2SYan Zheng */ 795d4f98a2SYan Zheng struct mapping_node { 80e9a28dc5SQu Wenruo struct { 815d4f98a2SYan Zheng struct rb_node rb_node; 825d4f98a2SYan Zheng u64 bytenr; 83e9a28dc5SQu Wenruo }; /* Use rb_simle_node for search/insert */ 845d4f98a2SYan Zheng void *data; 855d4f98a2SYan Zheng }; 865d4f98a2SYan Zheng 875d4f98a2SYan Zheng struct mapping_tree { 885d4f98a2SYan Zheng struct rb_root rb_root; 895d4f98a2SYan Zheng spinlock_t lock; 905d4f98a2SYan Zheng }; 915d4f98a2SYan Zheng 925d4f98a2SYan Zheng /* 935d4f98a2SYan Zheng * present a tree block to process 945d4f98a2SYan Zheng */ 955d4f98a2SYan Zheng struct tree_block { 96e9a28dc5SQu Wenruo struct { 975d4f98a2SYan Zheng struct rb_node rb_node; 985d4f98a2SYan Zheng u64 bytenr; 99e9a28dc5SQu Wenruo }; /* Use rb_simple_node for search/insert */ 100f7ba2d37SJosef Bacik u64 owner; 1015d4f98a2SYan Zheng struct btrfs_key key; 1025d4f98a2SYan Zheng unsigned int level:8; 1035d4f98a2SYan Zheng unsigned int key_ready:1; 1045d4f98a2SYan Zheng }; 1055d4f98a2SYan Zheng 1060257bb82SYan, Zheng #define MAX_EXTENTS 128 1070257bb82SYan, Zheng 1080257bb82SYan, Zheng struct file_extent_cluster { 1090257bb82SYan, Zheng u64 start; 1100257bb82SYan, Zheng u64 end; 1110257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 1120257bb82SYan, Zheng unsigned int nr; 1130257bb82SYan, Zheng }; 1140257bb82SYan, Zheng 1155d4f98a2SYan Zheng struct reloc_control { 1165d4f98a2SYan Zheng /* block group to relocate */ 11732da5386SDavid Sterba struct btrfs_block_group *block_group; 1185d4f98a2SYan Zheng /* extent tree */ 1195d4f98a2SYan Zheng struct btrfs_root *extent_root; 1205d4f98a2SYan Zheng /* inode for moving data */ 1215d4f98a2SYan Zheng struct inode *data_inode; 1223fd0a558SYan, Zheng 1233fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 1243fd0a558SYan, Zheng 125a26195a5SQu Wenruo struct btrfs_backref_cache backref_cache; 1263fd0a558SYan, Zheng 1273fd0a558SYan, Zheng struct file_extent_cluster cluster; 1285d4f98a2SYan Zheng /* tree blocks have been processed */ 1295d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 1305d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 1315d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 1325d4f98a2SYan Zheng /* list of reloc trees */ 1335d4f98a2SYan Zheng struct list_head reloc_roots; 134d2311e69SQu Wenruo /* list of subvolume trees that get relocated */ 135d2311e69SQu Wenruo struct list_head dirty_subvol_roots; 1363fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 1373fd0a558SYan, Zheng u64 merging_rsv_size; 1383fd0a558SYan, Zheng /* size of relocated tree nodes */ 1393fd0a558SYan, Zheng u64 nodes_relocated; 1400647bf56SWang Shilong /* reserved size for block group relocation*/ 1410647bf56SWang Shilong u64 reserved_bytes; 1423fd0a558SYan, Zheng 1435d4f98a2SYan Zheng u64 search_start; 1445d4f98a2SYan Zheng u64 extents_found; 1453fd0a558SYan, Zheng 1463fd0a558SYan, Zheng unsigned int stage:8; 1473fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 1483fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 1495d4f98a2SYan Zheng unsigned int found_file_extent:1; 1505d4f98a2SYan Zheng }; 1515d4f98a2SYan Zheng 1525d4f98a2SYan Zheng /* stages of data relocation */ 1535d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 1545d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 1555d4f98a2SYan Zheng 1569569cc20SQu Wenruo static void mark_block_processed(struct reloc_control *rc, 157a26195a5SQu Wenruo struct btrfs_backref_node *node) 1589569cc20SQu Wenruo { 1599569cc20SQu Wenruo u32 blocksize; 1609569cc20SQu Wenruo 1619569cc20SQu Wenruo if (node->level == 0 || 1629569cc20SQu Wenruo in_range(node->bytenr, rc->block_group->start, 1639569cc20SQu Wenruo rc->block_group->length)) { 1649569cc20SQu Wenruo blocksize = rc->extent_root->fs_info->nodesize; 1659569cc20SQu Wenruo set_extent_bits(&rc->processed_blocks, node->bytenr, 1669569cc20SQu Wenruo node->bytenr + blocksize - 1, EXTENT_DIRTY); 1679569cc20SQu Wenruo } 1689569cc20SQu Wenruo node->processed = 1; 1699569cc20SQu Wenruo } 1709569cc20SQu Wenruo 1715d4f98a2SYan Zheng 1725d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 1735d4f98a2SYan Zheng { 1746bef4d31SEric Paris tree->rb_root = RB_ROOT; 1755d4f98a2SYan Zheng spin_lock_init(&tree->lock); 1765d4f98a2SYan Zheng } 1775d4f98a2SYan Zheng 1785d4f98a2SYan Zheng /* 1795d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 1805d4f98a2SYan Zheng */ 181a26195a5SQu Wenruo static struct btrfs_backref_node *walk_up_backref( 182a26195a5SQu Wenruo struct btrfs_backref_node *node, 183a26195a5SQu Wenruo struct btrfs_backref_edge *edges[], int *index) 1845d4f98a2SYan Zheng { 185a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 1865d4f98a2SYan Zheng int idx = *index; 1875d4f98a2SYan Zheng 1885d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 1895d4f98a2SYan Zheng edge = list_entry(node->upper.next, 190a26195a5SQu Wenruo struct btrfs_backref_edge, list[LOWER]); 1915d4f98a2SYan Zheng edges[idx++] = edge; 1925d4f98a2SYan Zheng node = edge->node[UPPER]; 1935d4f98a2SYan Zheng } 1943fd0a558SYan, Zheng BUG_ON(node->detached); 1955d4f98a2SYan Zheng *index = idx; 1965d4f98a2SYan Zheng return node; 1975d4f98a2SYan Zheng } 1985d4f98a2SYan Zheng 1995d4f98a2SYan Zheng /* 2005d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 2015d4f98a2SYan Zheng */ 202a26195a5SQu Wenruo static struct btrfs_backref_node *walk_down_backref( 203a26195a5SQu Wenruo struct btrfs_backref_edge *edges[], int *index) 2045d4f98a2SYan Zheng { 205a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 206a26195a5SQu Wenruo struct btrfs_backref_node *lower; 2075d4f98a2SYan Zheng int idx = *index; 2085d4f98a2SYan Zheng 2095d4f98a2SYan Zheng while (idx > 0) { 2105d4f98a2SYan Zheng edge = edges[idx - 1]; 2115d4f98a2SYan Zheng lower = edge->node[LOWER]; 2125d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 2135d4f98a2SYan Zheng idx--; 2145d4f98a2SYan Zheng continue; 2155d4f98a2SYan Zheng } 2165d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 217a26195a5SQu Wenruo struct btrfs_backref_edge, list[LOWER]); 2185d4f98a2SYan Zheng edges[idx - 1] = edge; 2195d4f98a2SYan Zheng *index = idx; 2205d4f98a2SYan Zheng return edge->node[UPPER]; 2215d4f98a2SYan Zheng } 2225d4f98a2SYan Zheng *index = 0; 2235d4f98a2SYan Zheng return NULL; 2245d4f98a2SYan Zheng } 2255d4f98a2SYan Zheng 226a26195a5SQu Wenruo static void update_backref_node(struct btrfs_backref_cache *cache, 227a26195a5SQu Wenruo struct btrfs_backref_node *node, u64 bytenr) 2283fd0a558SYan, Zheng { 2293fd0a558SYan, Zheng struct rb_node *rb_node; 2303fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 2313fd0a558SYan, Zheng node->bytenr = bytenr; 232e9a28dc5SQu Wenruo rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node); 23343c04fb1SJeff Mahoney if (rb_node) 234982c92cbSQu Wenruo btrfs_backref_panic(cache->fs_info, bytenr, -EEXIST); 2353fd0a558SYan, Zheng } 2363fd0a558SYan, Zheng 2373fd0a558SYan, Zheng /* 2383fd0a558SYan, Zheng * update backref cache after a transaction commit 2393fd0a558SYan, Zheng */ 2403fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 241a26195a5SQu Wenruo struct btrfs_backref_cache *cache) 2423fd0a558SYan, Zheng { 243a26195a5SQu Wenruo struct btrfs_backref_node *node; 2443fd0a558SYan, Zheng int level = 0; 2453fd0a558SYan, Zheng 2463fd0a558SYan, Zheng if (cache->last_trans == 0) { 2473fd0a558SYan, Zheng cache->last_trans = trans->transid; 2483fd0a558SYan, Zheng return 0; 2493fd0a558SYan, Zheng } 2503fd0a558SYan, Zheng 2513fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 2523fd0a558SYan, Zheng return 0; 2533fd0a558SYan, Zheng 2543fd0a558SYan, Zheng /* 2553fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 2563fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 2573fd0a558SYan, Zheng * so the detached nodes are no longer useful. 2583fd0a558SYan, Zheng */ 2593fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2603fd0a558SYan, Zheng node = list_entry(cache->detached.next, 261a26195a5SQu Wenruo struct btrfs_backref_node, list); 262023acb07SQu Wenruo btrfs_backref_cleanup_node(cache, node); 2633fd0a558SYan, Zheng } 2643fd0a558SYan, Zheng 2653fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 2663fd0a558SYan, Zheng node = list_entry(cache->changed.next, 267a26195a5SQu Wenruo struct btrfs_backref_node, list); 2683fd0a558SYan, Zheng list_del_init(&node->list); 2693fd0a558SYan, Zheng BUG_ON(node->pending); 2703fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 2713fd0a558SYan, Zheng } 2723fd0a558SYan, Zheng 2733fd0a558SYan, Zheng /* 2743fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 2753fd0a558SYan, Zheng * errors during processing the pending nodes. 2763fd0a558SYan, Zheng */ 2773fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 2783fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 2793fd0a558SYan, Zheng BUG_ON(!node->pending); 2803fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 2813fd0a558SYan, Zheng continue; 2823fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 2833fd0a558SYan, Zheng } 2843fd0a558SYan, Zheng } 2853fd0a558SYan, Zheng 2863fd0a558SYan, Zheng cache->last_trans = 0; 2873fd0a558SYan, Zheng return 1; 2883fd0a558SYan, Zheng } 2893fd0a558SYan, Zheng 2906282675eSQu Wenruo static bool reloc_root_is_dead(struct btrfs_root *root) 2916282675eSQu Wenruo { 2926282675eSQu Wenruo /* 2936282675eSQu Wenruo * Pair with set_bit/clear_bit in clean_dirty_subvols and 2946282675eSQu Wenruo * btrfs_update_reloc_root. We need to see the updated bit before 2956282675eSQu Wenruo * trying to access reloc_root 2966282675eSQu Wenruo */ 2976282675eSQu Wenruo smp_rmb(); 2986282675eSQu Wenruo if (test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state)) 2996282675eSQu Wenruo return true; 3006282675eSQu Wenruo return false; 3016282675eSQu Wenruo } 3026282675eSQu Wenruo 3036282675eSQu Wenruo /* 3046282675eSQu Wenruo * Check if this subvolume tree has valid reloc tree. 3056282675eSQu Wenruo * 3066282675eSQu Wenruo * Reloc tree after swap is considered dead, thus not considered as valid. 3076282675eSQu Wenruo * This is enough for most callers, as they don't distinguish dead reloc root 30855465730SQu Wenruo * from no reloc root. But btrfs_should_ignore_reloc_root() below is a 30955465730SQu Wenruo * special case. 3106282675eSQu Wenruo */ 3116282675eSQu Wenruo static bool have_reloc_root(struct btrfs_root *root) 3126282675eSQu Wenruo { 3136282675eSQu Wenruo if (reloc_root_is_dead(root)) 3146282675eSQu Wenruo return false; 3156282675eSQu Wenruo if (!root->reloc_root) 3166282675eSQu Wenruo return false; 3176282675eSQu Wenruo return true; 3186282675eSQu Wenruo } 319f2a97a9dSDavid Sterba 32055465730SQu Wenruo int btrfs_should_ignore_reloc_root(struct btrfs_root *root) 3213fd0a558SYan, Zheng { 3223fd0a558SYan, Zheng struct btrfs_root *reloc_root; 3233fd0a558SYan, Zheng 32492a7cc42SQu Wenruo if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) 3253fd0a558SYan, Zheng return 0; 3263fd0a558SYan, Zheng 3276282675eSQu Wenruo /* This root has been merged with its reloc tree, we can ignore it */ 3286282675eSQu Wenruo if (reloc_root_is_dead(root)) 3296282675eSQu Wenruo return 1; 3306282675eSQu Wenruo 3313fd0a558SYan, Zheng reloc_root = root->reloc_root; 3323fd0a558SYan, Zheng if (!reloc_root) 3333fd0a558SYan, Zheng return 0; 3343fd0a558SYan, Zheng 3354d4225fcSJosef Bacik if (btrfs_header_generation(reloc_root->commit_root) == 3364d4225fcSJosef Bacik root->fs_info->running_transaction->transid) 3373fd0a558SYan, Zheng return 0; 3383fd0a558SYan, Zheng /* 3393fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 3403fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 3413fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 3423fd0a558SYan, Zheng * relocation. 3433fd0a558SYan, Zheng */ 3443fd0a558SYan, Zheng return 1; 3453fd0a558SYan, Zheng } 34655465730SQu Wenruo 3475d4f98a2SYan Zheng /* 3485d4f98a2SYan Zheng * find reloc tree by address of tree root 3495d4f98a2SYan Zheng */ 3502433bea5SQu Wenruo struct btrfs_root *find_reloc_root(struct btrfs_fs_info *fs_info, u64 bytenr) 3515d4f98a2SYan Zheng { 3522433bea5SQu Wenruo struct reloc_control *rc = fs_info->reloc_ctl; 3535d4f98a2SYan Zheng struct rb_node *rb_node; 3545d4f98a2SYan Zheng struct mapping_node *node; 3555d4f98a2SYan Zheng struct btrfs_root *root = NULL; 3565d4f98a2SYan Zheng 3572433bea5SQu Wenruo ASSERT(rc); 3585d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 359e9a28dc5SQu Wenruo rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, bytenr); 3605d4f98a2SYan Zheng if (rb_node) { 3615d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 3625d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 3635d4f98a2SYan Zheng } 3645d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 36500246528SJosef Bacik return btrfs_grab_root(root); 3665d4f98a2SYan Zheng } 3675d4f98a2SYan Zheng 3685d4f98a2SYan Zheng /* 36929db137bSQu Wenruo * For useless nodes, do two major clean ups: 37029db137bSQu Wenruo * 37129db137bSQu Wenruo * - Cleanup the children edges and nodes 37229db137bSQu Wenruo * If child node is also orphan (no parent) during cleanup, then the child 37329db137bSQu Wenruo * node will also be cleaned up. 37429db137bSQu Wenruo * 37529db137bSQu Wenruo * - Freeing up leaves (level 0), keeps nodes detached 37629db137bSQu Wenruo * For nodes, the node is still cached as "detached" 37729db137bSQu Wenruo * 37829db137bSQu Wenruo * Return false if @node is not in the @useless_nodes list. 37929db137bSQu Wenruo * Return true if @node is in the @useless_nodes list. 38029db137bSQu Wenruo */ 38129db137bSQu Wenruo static bool handle_useless_nodes(struct reloc_control *rc, 382a26195a5SQu Wenruo struct btrfs_backref_node *node) 38329db137bSQu Wenruo { 384a26195a5SQu Wenruo struct btrfs_backref_cache *cache = &rc->backref_cache; 38529db137bSQu Wenruo struct list_head *useless_node = &cache->useless_node; 38629db137bSQu Wenruo bool ret = false; 38729db137bSQu Wenruo 38829db137bSQu Wenruo while (!list_empty(useless_node)) { 389a26195a5SQu Wenruo struct btrfs_backref_node *cur; 39029db137bSQu Wenruo 391a26195a5SQu Wenruo cur = list_first_entry(useless_node, struct btrfs_backref_node, 39229db137bSQu Wenruo list); 39329db137bSQu Wenruo list_del_init(&cur->list); 39429db137bSQu Wenruo 39529db137bSQu Wenruo /* Only tree root nodes can be added to @useless_nodes */ 39629db137bSQu Wenruo ASSERT(list_empty(&cur->upper)); 39729db137bSQu Wenruo 39829db137bSQu Wenruo if (cur == node) 39929db137bSQu Wenruo ret = true; 40029db137bSQu Wenruo 40129db137bSQu Wenruo /* The node is the lowest node */ 40229db137bSQu Wenruo if (cur->lowest) { 40329db137bSQu Wenruo list_del_init(&cur->lower); 40429db137bSQu Wenruo cur->lowest = 0; 40529db137bSQu Wenruo } 40629db137bSQu Wenruo 40729db137bSQu Wenruo /* Cleanup the lower edges */ 40829db137bSQu Wenruo while (!list_empty(&cur->lower)) { 409a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 410a26195a5SQu Wenruo struct btrfs_backref_node *lower; 41129db137bSQu Wenruo 41229db137bSQu Wenruo edge = list_entry(cur->lower.next, 413a26195a5SQu Wenruo struct btrfs_backref_edge, list[UPPER]); 41429db137bSQu Wenruo list_del(&edge->list[UPPER]); 41529db137bSQu Wenruo list_del(&edge->list[LOWER]); 41629db137bSQu Wenruo lower = edge->node[LOWER]; 417741188d3SQu Wenruo btrfs_backref_free_edge(cache, edge); 41829db137bSQu Wenruo 41929db137bSQu Wenruo /* Child node is also orphan, queue for cleanup */ 42029db137bSQu Wenruo if (list_empty(&lower->upper)) 42129db137bSQu Wenruo list_add(&lower->list, useless_node); 42229db137bSQu Wenruo } 42329db137bSQu Wenruo /* Mark this block processed for relocation */ 42429db137bSQu Wenruo mark_block_processed(rc, cur); 42529db137bSQu Wenruo 42629db137bSQu Wenruo /* 42729db137bSQu Wenruo * Backref nodes for tree leaves are deleted from the cache. 42829db137bSQu Wenruo * Backref nodes for upper level tree blocks are left in the 42929db137bSQu Wenruo * cache to avoid unnecessary backref lookup. 43029db137bSQu Wenruo */ 43129db137bSQu Wenruo if (cur->level > 0) { 43229db137bSQu Wenruo list_add(&cur->list, &cache->detached); 43329db137bSQu Wenruo cur->detached = 1; 43429db137bSQu Wenruo } else { 43529db137bSQu Wenruo rb_erase(&cur->rb_node, &cache->rb_root); 436741188d3SQu Wenruo btrfs_backref_free_node(cache, cur); 43729db137bSQu Wenruo } 43829db137bSQu Wenruo } 43929db137bSQu Wenruo return ret; 44029db137bSQu Wenruo } 44129db137bSQu Wenruo 44229db137bSQu Wenruo /* 443e7d571c7SQu Wenruo * Build backref tree for a given tree block. Root of the backref tree 444e7d571c7SQu Wenruo * corresponds the tree block, leaves of the backref tree correspond roots of 445e7d571c7SQu Wenruo * b-trees that reference the tree block. 446e7d571c7SQu Wenruo * 447e7d571c7SQu Wenruo * The basic idea of this function is check backrefs of a given block to find 448e7d571c7SQu Wenruo * upper level blocks that reference the block, and then check backrefs of 449e7d571c7SQu Wenruo * these upper level blocks recursively. The recursion stops when tree root is 450e7d571c7SQu Wenruo * reached or backrefs for the block is cached. 451e7d571c7SQu Wenruo * 452e7d571c7SQu Wenruo * NOTE: if we find that backrefs for a block are cached, we know backrefs for 453e7d571c7SQu Wenruo * all upper level blocks that directly/indirectly reference the block are also 454e7d571c7SQu Wenruo * cached. 455e7d571c7SQu Wenruo */ 456a26195a5SQu Wenruo static noinline_for_stack struct btrfs_backref_node *build_backref_tree( 457e7d571c7SQu Wenruo struct reloc_control *rc, struct btrfs_key *node_key, 458e7d571c7SQu Wenruo int level, u64 bytenr) 459e7d571c7SQu Wenruo { 460e7d571c7SQu Wenruo struct btrfs_backref_iter *iter; 461a26195a5SQu Wenruo struct btrfs_backref_cache *cache = &rc->backref_cache; 462e7d571c7SQu Wenruo /* For searching parent of TREE_BLOCK_REF */ 463e7d571c7SQu Wenruo struct btrfs_path *path; 464a26195a5SQu Wenruo struct btrfs_backref_node *cur; 465a26195a5SQu Wenruo struct btrfs_backref_node *node = NULL; 466a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 467e7d571c7SQu Wenruo int ret; 468e7d571c7SQu Wenruo int err = 0; 469e7d571c7SQu Wenruo 470e7d571c7SQu Wenruo iter = btrfs_backref_iter_alloc(rc->extent_root->fs_info, GFP_NOFS); 471e7d571c7SQu Wenruo if (!iter) 472e7d571c7SQu Wenruo return ERR_PTR(-ENOMEM); 473e7d571c7SQu Wenruo path = btrfs_alloc_path(); 474e7d571c7SQu Wenruo if (!path) { 475e7d571c7SQu Wenruo err = -ENOMEM; 476e7d571c7SQu Wenruo goto out; 477e7d571c7SQu Wenruo } 478e7d571c7SQu Wenruo 479b1818dabSQu Wenruo node = btrfs_backref_alloc_node(cache, bytenr, level); 480e7d571c7SQu Wenruo if (!node) { 481e7d571c7SQu Wenruo err = -ENOMEM; 482e7d571c7SQu Wenruo goto out; 483e7d571c7SQu Wenruo } 484e7d571c7SQu Wenruo 485e7d571c7SQu Wenruo node->lowest = 1; 486e7d571c7SQu Wenruo cur = node; 487e7d571c7SQu Wenruo 488e7d571c7SQu Wenruo /* Breadth-first search to build backref cache */ 489e7d571c7SQu Wenruo do { 4901b60d2ecSQu Wenruo ret = btrfs_backref_add_tree_node(cache, path, iter, node_key, 4911b60d2ecSQu Wenruo cur); 492e7d571c7SQu Wenruo if (ret < 0) { 493e7d571c7SQu Wenruo err = ret; 494e7d571c7SQu Wenruo goto out; 495e7d571c7SQu Wenruo } 496e7d571c7SQu Wenruo edge = list_first_entry_or_null(&cache->pending_edge, 497a26195a5SQu Wenruo struct btrfs_backref_edge, list[UPPER]); 498e7d571c7SQu Wenruo /* 499e7d571c7SQu Wenruo * The pending list isn't empty, take the first block to 500e7d571c7SQu Wenruo * process 501e7d571c7SQu Wenruo */ 502e7d571c7SQu Wenruo if (edge) { 5035d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 5045d4f98a2SYan Zheng cur = edge->node[UPPER]; 5055d4f98a2SYan Zheng } 506e7d571c7SQu Wenruo } while (edge); 5075d4f98a2SYan Zheng 5081f872924SQu Wenruo /* Finish the upper linkage of newly added edges/nodes */ 509fc997ed0SQu Wenruo ret = btrfs_backref_finish_upper_links(cache, node); 5101f872924SQu Wenruo if (ret < 0) { 5111f872924SQu Wenruo err = ret; 51275bfb9afSJosef Bacik goto out; 51375bfb9afSJosef Bacik } 51475bfb9afSJosef Bacik 51529db137bSQu Wenruo if (handle_useless_nodes(rc, node)) 5163fd0a558SYan, Zheng node = NULL; 5175d4f98a2SYan Zheng out: 51871f572a9SQu Wenruo btrfs_backref_iter_free(iter); 51971f572a9SQu Wenruo btrfs_free_path(path); 5205d4f98a2SYan Zheng if (err) { 5211b23ea18SQu Wenruo btrfs_backref_error_cleanup(cache, node); 5225d4f98a2SYan Zheng return ERR_PTR(err); 5235d4f98a2SYan Zheng } 52475bfb9afSJosef Bacik ASSERT(!node || !node->detached); 52584780289SQu Wenruo ASSERT(list_empty(&cache->useless_node) && 52684780289SQu Wenruo list_empty(&cache->pending_edge)); 5275d4f98a2SYan Zheng return node; 5285d4f98a2SYan Zheng } 5295d4f98a2SYan Zheng 5305d4f98a2SYan Zheng /* 5313fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 5323fd0a558SYan, Zheng * the backref node is created by cloning backref node that 5333fd0a558SYan, Zheng * corresponds to root of source tree 5343fd0a558SYan, Zheng */ 5353fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 5363fd0a558SYan, Zheng struct reloc_control *rc, 5373fd0a558SYan, Zheng struct btrfs_root *src, 5383fd0a558SYan, Zheng struct btrfs_root *dest) 5393fd0a558SYan, Zheng { 5403fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 541a26195a5SQu Wenruo struct btrfs_backref_cache *cache = &rc->backref_cache; 542a26195a5SQu Wenruo struct btrfs_backref_node *node = NULL; 543a26195a5SQu Wenruo struct btrfs_backref_node *new_node; 544a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 545a26195a5SQu Wenruo struct btrfs_backref_edge *new_edge; 5463fd0a558SYan, Zheng struct rb_node *rb_node; 5473fd0a558SYan, Zheng 5483fd0a558SYan, Zheng if (cache->last_trans > 0) 5493fd0a558SYan, Zheng update_backref_cache(trans, cache); 5503fd0a558SYan, Zheng 551e9a28dc5SQu Wenruo rb_node = rb_simple_search(&cache->rb_root, src->commit_root->start); 5523fd0a558SYan, Zheng if (rb_node) { 553a26195a5SQu Wenruo node = rb_entry(rb_node, struct btrfs_backref_node, rb_node); 5543fd0a558SYan, Zheng if (node->detached) 5553fd0a558SYan, Zheng node = NULL; 5563fd0a558SYan, Zheng else 5573fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 5583fd0a558SYan, Zheng } 5593fd0a558SYan, Zheng 5603fd0a558SYan, Zheng if (!node) { 561e9a28dc5SQu Wenruo rb_node = rb_simple_search(&cache->rb_root, 5623fd0a558SYan, Zheng reloc_root->commit_root->start); 5633fd0a558SYan, Zheng if (rb_node) { 564a26195a5SQu Wenruo node = rb_entry(rb_node, struct btrfs_backref_node, 5653fd0a558SYan, Zheng rb_node); 5663fd0a558SYan, Zheng BUG_ON(node->detached); 5673fd0a558SYan, Zheng } 5683fd0a558SYan, Zheng } 5693fd0a558SYan, Zheng 5703fd0a558SYan, Zheng if (!node) 5713fd0a558SYan, Zheng return 0; 5723fd0a558SYan, Zheng 573b1818dabSQu Wenruo new_node = btrfs_backref_alloc_node(cache, dest->node->start, 574b1818dabSQu Wenruo node->level); 5753fd0a558SYan, Zheng if (!new_node) 5763fd0a558SYan, Zheng return -ENOMEM; 5773fd0a558SYan, Zheng 5783fd0a558SYan, Zheng new_node->lowest = node->lowest; 5796848ad64SYan, Zheng new_node->checked = 1; 58000246528SJosef Bacik new_node->root = btrfs_grab_root(dest); 5810b530bc5SJosef Bacik ASSERT(new_node->root); 5823fd0a558SYan, Zheng 5833fd0a558SYan, Zheng if (!node->lowest) { 5843fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 58547254d07SQu Wenruo new_edge = btrfs_backref_alloc_edge(cache); 5863fd0a558SYan, Zheng if (!new_edge) 5873fd0a558SYan, Zheng goto fail; 5883fd0a558SYan, Zheng 589f39911e5SQu Wenruo btrfs_backref_link_edge(new_edge, edge->node[LOWER], 590f39911e5SQu Wenruo new_node, LINK_UPPER); 5913fd0a558SYan, Zheng } 59276b9e23dSMiao Xie } else { 59376b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 5943fd0a558SYan, Zheng } 5953fd0a558SYan, Zheng 596e9a28dc5SQu Wenruo rb_node = rb_simple_insert(&cache->rb_root, new_node->bytenr, 5973fd0a558SYan, Zheng &new_node->rb_node); 59843c04fb1SJeff Mahoney if (rb_node) 599982c92cbSQu Wenruo btrfs_backref_panic(trans->fs_info, new_node->bytenr, -EEXIST); 6003fd0a558SYan, Zheng 6013fd0a558SYan, Zheng if (!new_node->lowest) { 6023fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 6033fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 6043fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 6053fd0a558SYan, Zheng } 6063fd0a558SYan, Zheng } 6073fd0a558SYan, Zheng return 0; 6083fd0a558SYan, Zheng fail: 6093fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 6103fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 611a26195a5SQu Wenruo struct btrfs_backref_edge, list[UPPER]); 6123fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 613741188d3SQu Wenruo btrfs_backref_free_edge(cache, new_edge); 6143fd0a558SYan, Zheng } 615741188d3SQu Wenruo btrfs_backref_free_node(cache, new_node); 6163fd0a558SYan, Zheng return -ENOMEM; 6173fd0a558SYan, Zheng } 6183fd0a558SYan, Zheng 6193fd0a558SYan, Zheng /* 6205d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 6215d4f98a2SYan Zheng */ 622ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 6235d4f98a2SYan Zheng { 6240b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 6255d4f98a2SYan Zheng struct rb_node *rb_node; 6265d4f98a2SYan Zheng struct mapping_node *node; 6270b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 6285d4f98a2SYan Zheng 6295d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 630ffd7b339SJeff Mahoney if (!node) 631ffd7b339SJeff Mahoney return -ENOMEM; 6325d4f98a2SYan Zheng 633ea287ab1SJosef Bacik node->bytenr = root->commit_root->start; 6345d4f98a2SYan Zheng node->data = root; 6355d4f98a2SYan Zheng 6365d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 637e9a28dc5SQu Wenruo rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, 6385d4f98a2SYan Zheng node->bytenr, &node->rb_node); 6395d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 640ffd7b339SJeff Mahoney if (rb_node) { 64157a304cfSJosef Bacik btrfs_err(fs_info, 6425d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 6435d163e0eSJeff Mahoney node->bytenr); 64457a304cfSJosef Bacik return -EEXIST; 645ffd7b339SJeff Mahoney } 6465d4f98a2SYan Zheng 6475d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 6485d4f98a2SYan Zheng return 0; 6495d4f98a2SYan Zheng } 6505d4f98a2SYan Zheng 6515d4f98a2SYan Zheng /* 652c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 6535d4f98a2SYan Zheng * mapping 6545d4f98a2SYan Zheng */ 655c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 6565d4f98a2SYan Zheng { 6570b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 6585d4f98a2SYan Zheng struct rb_node *rb_node; 6595d4f98a2SYan Zheng struct mapping_node *node = NULL; 6600b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 661f44deb74SJosef Bacik bool put_ref = false; 6625d4f98a2SYan Zheng 66365c6e82bSQu Wenruo if (rc && root->node) { 6645d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 665e9a28dc5SQu Wenruo rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, 666ea287ab1SJosef Bacik root->commit_root->start); 667c974c464SWang Shilong if (rb_node) { 668c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 669c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 670ea287ab1SJosef Bacik RB_CLEAR_NODE(&node->rb_node); 671c974c464SWang Shilong } 672c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 673c78a10aeSJosef Bacik ASSERT(!node || (struct btrfs_root *)node->data == root); 674389305b2SQu Wenruo } 675c974c464SWang Shilong 676f44deb74SJosef Bacik /* 677f44deb74SJosef Bacik * We only put the reloc root here if it's on the list. There's a lot 678f44deb74SJosef Bacik * of places where the pattern is to splice the rc->reloc_roots, process 679f44deb74SJosef Bacik * the reloc roots, and then add the reloc root back onto 680f44deb74SJosef Bacik * rc->reloc_roots. If we call __del_reloc_root while it's off of the 681f44deb74SJosef Bacik * list we don't want the reference being dropped, because the guy 682f44deb74SJosef Bacik * messing with the list is in charge of the reference. 683f44deb74SJosef Bacik */ 6840b246afaSJeff Mahoney spin_lock(&fs_info->trans_lock); 685f44deb74SJosef Bacik if (!list_empty(&root->root_list)) { 686f44deb74SJosef Bacik put_ref = true; 687c974c464SWang Shilong list_del_init(&root->root_list); 688f44deb74SJosef Bacik } 6890b246afaSJeff Mahoney spin_unlock(&fs_info->trans_lock); 690f44deb74SJosef Bacik if (put_ref) 691f44deb74SJosef Bacik btrfs_put_root(root); 692c974c464SWang Shilong kfree(node); 693c974c464SWang Shilong } 694c974c464SWang Shilong 695c974c464SWang Shilong /* 696c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 697c974c464SWang Shilong * mapping 698c974c464SWang Shilong */ 699ea287ab1SJosef Bacik static int __update_reloc_root(struct btrfs_root *root) 700c974c464SWang Shilong { 7010b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 702c974c464SWang Shilong struct rb_node *rb_node; 703c974c464SWang Shilong struct mapping_node *node = NULL; 7040b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 705c974c464SWang Shilong 706c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 707e9a28dc5SQu Wenruo rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, 708ea287ab1SJosef Bacik root->commit_root->start); 7095d4f98a2SYan Zheng if (rb_node) { 7105d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 7115d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 7125d4f98a2SYan Zheng } 7135d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 7145d4f98a2SYan Zheng 7158f71f3e0SLiu Bo if (!node) 7168f71f3e0SLiu Bo return 0; 7175d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 7185d4f98a2SYan Zheng 7195d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 720ea287ab1SJosef Bacik node->bytenr = root->node->start; 721e9a28dc5SQu Wenruo rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, 7225d4f98a2SYan Zheng node->bytenr, &node->rb_node); 7235d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 72443c04fb1SJeff Mahoney if (rb_node) 725982c92cbSQu Wenruo btrfs_backref_panic(fs_info, node->bytenr, -EEXIST); 7265d4f98a2SYan Zheng return 0; 7275d4f98a2SYan Zheng } 7285d4f98a2SYan Zheng 7293fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 7303fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 7315d4f98a2SYan Zheng { 7320b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 7335d4f98a2SYan Zheng struct btrfs_root *reloc_root; 7345d4f98a2SYan Zheng struct extent_buffer *eb; 7355d4f98a2SYan Zheng struct btrfs_root_item *root_item; 7365d4f98a2SYan Zheng struct btrfs_key root_key; 73784c50ba5SJosef Bacik int ret = 0; 73884c50ba5SJosef Bacik bool must_abort = false; 7395d4f98a2SYan Zheng 7405d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 74184c50ba5SJosef Bacik if (!root_item) 74284c50ba5SJosef Bacik return ERR_PTR(-ENOMEM); 7435d4f98a2SYan Zheng 7445d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 7455d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 7463fd0a558SYan, Zheng root_key.offset = objectid; 7475d4f98a2SYan Zheng 7483fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 749054570a1SFilipe Manana u64 commit_root_gen; 750054570a1SFilipe Manana 7513fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 7525d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 7535d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 75484c50ba5SJosef Bacik if (ret) 75584c50ba5SJosef Bacik goto fail; 75684c50ba5SJosef Bacik 757054570a1SFilipe Manana /* 758054570a1SFilipe Manana * Set the last_snapshot field to the generation of the commit 759054570a1SFilipe Manana * root - like this ctree.c:btrfs_block_can_be_shared() behaves 760054570a1SFilipe Manana * correctly (returns true) when the relocation root is created 761054570a1SFilipe Manana * either inside the critical section of a transaction commit 762054570a1SFilipe Manana * (through transaction.c:qgroup_account_snapshot()) and when 763054570a1SFilipe Manana * it's created before the transaction commit is started. 764054570a1SFilipe Manana */ 765054570a1SFilipe Manana commit_root_gen = btrfs_header_generation(root->commit_root); 766054570a1SFilipe Manana btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); 7673fd0a558SYan, Zheng } else { 7683fd0a558SYan, Zheng /* 7693fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 7703fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 7713fd0a558SYan, Zheng * modified after it was created have RELOC flag 7723fd0a558SYan, Zheng * set in their headers. so it's OK to not update 7733fd0a558SYan, Zheng * the 'last_snapshot'. 7743fd0a558SYan, Zheng */ 7753fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 7763fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 77784c50ba5SJosef Bacik if (ret) 77884c50ba5SJosef Bacik goto fail; 7793fd0a558SYan, Zheng } 7803fd0a558SYan, Zheng 78184c50ba5SJosef Bacik /* 78284c50ba5SJosef Bacik * We have changed references at this point, we must abort the 78384c50ba5SJosef Bacik * transaction if anything fails. 78484c50ba5SJosef Bacik */ 78584c50ba5SJosef Bacik must_abort = true; 78684c50ba5SJosef Bacik 7875d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 7885d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 7895d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 7905d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 7913fd0a558SYan, Zheng 7923fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 7933fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 7943fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 7953fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 796c8422684SDavid Sterba btrfs_set_root_drop_level(root_item, 0); 7973fd0a558SYan, Zheng } 7985d4f98a2SYan Zheng 7995d4f98a2SYan Zheng btrfs_tree_unlock(eb); 8005d4f98a2SYan Zheng free_extent_buffer(eb); 8015d4f98a2SYan Zheng 8020b246afaSJeff Mahoney ret = btrfs_insert_root(trans, fs_info->tree_root, 8035d4f98a2SYan Zheng &root_key, root_item); 80484c50ba5SJosef Bacik if (ret) 80584c50ba5SJosef Bacik goto fail; 80684c50ba5SJosef Bacik 8075d4f98a2SYan Zheng kfree(root_item); 8085d4f98a2SYan Zheng 8093dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(fs_info->tree_root, &root_key); 81084c50ba5SJosef Bacik if (IS_ERR(reloc_root)) { 81184c50ba5SJosef Bacik ret = PTR_ERR(reloc_root); 81284c50ba5SJosef Bacik goto abort; 81384c50ba5SJosef Bacik } 81492a7cc42SQu Wenruo set_bit(BTRFS_ROOT_SHAREABLE, &reloc_root->state); 8155d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 8163fd0a558SYan, Zheng return reloc_root; 81784c50ba5SJosef Bacik fail: 81884c50ba5SJosef Bacik kfree(root_item); 81984c50ba5SJosef Bacik abort: 82084c50ba5SJosef Bacik if (must_abort) 82184c50ba5SJosef Bacik btrfs_abort_transaction(trans, ret); 82284c50ba5SJosef Bacik return ERR_PTR(ret); 8233fd0a558SYan, Zheng } 8243fd0a558SYan, Zheng 8253fd0a558SYan, Zheng /* 8263fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 8273fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 828f44deb74SJosef Bacik * 829f44deb74SJosef Bacik * The reloc_root comes out of here with two references, one for 830f44deb74SJosef Bacik * root->reloc_root, and another for being on the rc->reloc_roots list. 8313fd0a558SYan, Zheng */ 8323fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 8333fd0a558SYan, Zheng struct btrfs_root *root) 8343fd0a558SYan, Zheng { 8350b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 8363fd0a558SYan, Zheng struct btrfs_root *reloc_root; 8370b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 83820dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 8393fd0a558SYan, Zheng int clear_rsv = 0; 840ffd7b339SJeff Mahoney int ret; 8413fd0a558SYan, Zheng 842aec7db3bSJosef Bacik if (!rc) 8432abc726aSJosef Bacik return 0; 8442abc726aSJosef Bacik 8451fac4a54SQu Wenruo /* 8461fac4a54SQu Wenruo * The subvolume has reloc tree but the swap is finished, no need to 8471fac4a54SQu Wenruo * create/update the dead reloc tree 8481fac4a54SQu Wenruo */ 8496282675eSQu Wenruo if (reloc_root_is_dead(root)) 8501fac4a54SQu Wenruo return 0; 8511fac4a54SQu Wenruo 852aec7db3bSJosef Bacik /* 853aec7db3bSJosef Bacik * This is subtle but important. We do not do 854aec7db3bSJosef Bacik * record_root_in_transaction for reloc roots, instead we record their 855aec7db3bSJosef Bacik * corresponding fs root, and then here we update the last trans for the 856aec7db3bSJosef Bacik * reloc root. This means that we have to do this for the entire life 857aec7db3bSJosef Bacik * of the reloc root, regardless of which stage of the relocation we are 858aec7db3bSJosef Bacik * in. 859aec7db3bSJosef Bacik */ 8603fd0a558SYan, Zheng if (root->reloc_root) { 8613fd0a558SYan, Zheng reloc_root = root->reloc_root; 8623fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 8633fd0a558SYan, Zheng return 0; 8643fd0a558SYan, Zheng } 8653fd0a558SYan, Zheng 866aec7db3bSJosef Bacik /* 867aec7db3bSJosef Bacik * We are merging reloc roots, we do not need new reloc trees. Also 868aec7db3bSJosef Bacik * reloc trees never need their own reloc tree. 869aec7db3bSJosef Bacik */ 870aec7db3bSJosef Bacik if (!rc->create_reloc_tree || 871aec7db3bSJosef Bacik root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 872aec7db3bSJosef Bacik return 0; 873aec7db3bSJosef Bacik 87420dd2cbfSMiao Xie if (!trans->reloc_reserved) { 87520dd2cbfSMiao Xie rsv = trans->block_rsv; 8763fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 8773fd0a558SYan, Zheng clear_rsv = 1; 8783fd0a558SYan, Zheng } 8793fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 8803fd0a558SYan, Zheng if (clear_rsv) 88120dd2cbfSMiao Xie trans->block_rsv = rsv; 88200bb36a0SJosef Bacik if (IS_ERR(reloc_root)) 88300bb36a0SJosef Bacik return PTR_ERR(reloc_root); 8845d4f98a2SYan Zheng 885ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 88657a304cfSJosef Bacik ASSERT(ret != -EEXIST); 88700bb36a0SJosef Bacik if (ret) { 88800bb36a0SJosef Bacik /* Pairs with create_reloc_root */ 88900bb36a0SJosef Bacik btrfs_put_root(reloc_root); 89000bb36a0SJosef Bacik return ret; 89100bb36a0SJosef Bacik } 892f44deb74SJosef Bacik root->reloc_root = btrfs_grab_root(reloc_root); 8935d4f98a2SYan Zheng return 0; 8945d4f98a2SYan Zheng } 8955d4f98a2SYan Zheng 8965d4f98a2SYan Zheng /* 8975d4f98a2SYan Zheng * update root item of reloc tree 8985d4f98a2SYan Zheng */ 8995d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 9005d4f98a2SYan Zheng struct btrfs_root *root) 9015d4f98a2SYan Zheng { 9020b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 9035d4f98a2SYan Zheng struct btrfs_root *reloc_root; 9045d4f98a2SYan Zheng struct btrfs_root_item *root_item; 9055d4f98a2SYan Zheng int ret; 9065d4f98a2SYan Zheng 9076282675eSQu Wenruo if (!have_reloc_root(root)) 908592fbcd5SJosef Bacik return 0; 9095d4f98a2SYan Zheng 9105d4f98a2SYan Zheng reloc_root = root->reloc_root; 9115d4f98a2SYan Zheng root_item = &reloc_root->root_item; 9125d4f98a2SYan Zheng 913f44deb74SJosef Bacik /* 914f44deb74SJosef Bacik * We are probably ok here, but __del_reloc_root() will drop its ref of 915f44deb74SJosef Bacik * the root. We have the ref for root->reloc_root, but just in case 916f44deb74SJosef Bacik * hold it while we update the reloc root. 917f44deb74SJosef Bacik */ 918f44deb74SJosef Bacik btrfs_grab_root(reloc_root); 919f44deb74SJosef Bacik 920d2311e69SQu Wenruo /* root->reloc_root will stay until current relocation finished */ 9210b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 9223fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 923d2311e69SQu Wenruo set_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 9246282675eSQu Wenruo /* 9256282675eSQu Wenruo * Mark the tree as dead before we change reloc_root so 9266282675eSQu Wenruo * have_reloc_root will not touch it from now on. 9276282675eSQu Wenruo */ 9286282675eSQu Wenruo smp_wmb(); 929c974c464SWang Shilong __del_reloc_root(reloc_root); 9305d4f98a2SYan Zheng } 9315d4f98a2SYan Zheng 9325d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 933ea287ab1SJosef Bacik __update_reloc_root(reloc_root); 9345d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 9355d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 9365d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 9375d4f98a2SYan Zheng } 9385d4f98a2SYan Zheng 9390b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 9405d4f98a2SYan Zheng &reloc_root->root_key, root_item); 941f44deb74SJosef Bacik btrfs_put_root(reloc_root); 942592fbcd5SJosef Bacik return ret; 9435d4f98a2SYan Zheng } 9445d4f98a2SYan Zheng 9455d4f98a2SYan Zheng /* 9465d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 9475d4f98a2SYan Zheng * in a subvolume 9485d4f98a2SYan Zheng */ 9495d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 9505d4f98a2SYan Zheng { 9515d4f98a2SYan Zheng struct rb_node *node; 9525d4f98a2SYan Zheng struct rb_node *prev; 9535d4f98a2SYan Zheng struct btrfs_inode *entry; 9545d4f98a2SYan Zheng struct inode *inode; 9555d4f98a2SYan Zheng 9565d4f98a2SYan Zheng spin_lock(&root->inode_lock); 9575d4f98a2SYan Zheng again: 9585d4f98a2SYan Zheng node = root->inode_tree.rb_node; 9595d4f98a2SYan Zheng prev = NULL; 9605d4f98a2SYan Zheng while (node) { 9615d4f98a2SYan Zheng prev = node; 9625d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 9635d4f98a2SYan Zheng 9644a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 9655d4f98a2SYan Zheng node = node->rb_left; 9664a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 9675d4f98a2SYan Zheng node = node->rb_right; 9685d4f98a2SYan Zheng else 9695d4f98a2SYan Zheng break; 9705d4f98a2SYan Zheng } 9715d4f98a2SYan Zheng if (!node) { 9725d4f98a2SYan Zheng while (prev) { 9735d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 9744a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 9755d4f98a2SYan Zheng node = prev; 9765d4f98a2SYan Zheng break; 9775d4f98a2SYan Zheng } 9785d4f98a2SYan Zheng prev = rb_next(prev); 9795d4f98a2SYan Zheng } 9805d4f98a2SYan Zheng } 9815d4f98a2SYan Zheng while (node) { 9825d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 9835d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 9845d4f98a2SYan Zheng if (inode) { 9855d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 9865d4f98a2SYan Zheng return inode; 9875d4f98a2SYan Zheng } 9885d4f98a2SYan Zheng 9894a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 9905d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 9915d4f98a2SYan Zheng goto again; 9925d4f98a2SYan Zheng 9935d4f98a2SYan Zheng node = rb_next(node); 9945d4f98a2SYan Zheng } 9955d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 9965d4f98a2SYan Zheng return NULL; 9975d4f98a2SYan Zheng } 9985d4f98a2SYan Zheng 9995d4f98a2SYan Zheng /* 10005d4f98a2SYan Zheng * get new location of data 10015d4f98a2SYan Zheng */ 10025d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 10035d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 10045d4f98a2SYan Zheng { 10055d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 10065d4f98a2SYan Zheng struct btrfs_path *path; 10075d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 10085d4f98a2SYan Zheng struct extent_buffer *leaf; 10095d4f98a2SYan Zheng int ret; 10105d4f98a2SYan Zheng 10115d4f98a2SYan Zheng path = btrfs_alloc_path(); 10125d4f98a2SYan Zheng if (!path) 10135d4f98a2SYan Zheng return -ENOMEM; 10145d4f98a2SYan Zheng 10155d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 1016f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 1017f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 10185d4f98a2SYan Zheng if (ret < 0) 10195d4f98a2SYan Zheng goto out; 10205d4f98a2SYan Zheng if (ret > 0) { 10215d4f98a2SYan Zheng ret = -ENOENT; 10225d4f98a2SYan Zheng goto out; 10235d4f98a2SYan Zheng } 10245d4f98a2SYan Zheng 10255d4f98a2SYan Zheng leaf = path->nodes[0]; 10265d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 10275d4f98a2SYan Zheng struct btrfs_file_extent_item); 10285d4f98a2SYan Zheng 10295d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 10305d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 10315d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 10325d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 10335d4f98a2SYan Zheng 10345d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 103583d4cfd4SJosef Bacik ret = -EINVAL; 10365d4f98a2SYan Zheng goto out; 10375d4f98a2SYan Zheng } 10385d4f98a2SYan Zheng 10395d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 10405d4f98a2SYan Zheng ret = 0; 10415d4f98a2SYan Zheng out: 10425d4f98a2SYan Zheng btrfs_free_path(path); 10435d4f98a2SYan Zheng return ret; 10445d4f98a2SYan Zheng } 10455d4f98a2SYan Zheng 10465d4f98a2SYan Zheng /* 10475d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 10485d4f98a2SYan Zheng * the new locations. 10495d4f98a2SYan Zheng */ 10503fd0a558SYan, Zheng static noinline_for_stack 10513fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 10525d4f98a2SYan Zheng struct reloc_control *rc, 10535d4f98a2SYan Zheng struct btrfs_root *root, 10543fd0a558SYan, Zheng struct extent_buffer *leaf) 10555d4f98a2SYan Zheng { 10560b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 10575d4f98a2SYan Zheng struct btrfs_key key; 10585d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 10595d4f98a2SYan Zheng struct inode *inode = NULL; 10605d4f98a2SYan Zheng u64 parent; 10615d4f98a2SYan Zheng u64 bytenr; 10623fd0a558SYan, Zheng u64 new_bytenr = 0; 10635d4f98a2SYan Zheng u64 num_bytes; 10645d4f98a2SYan Zheng u64 end; 10655d4f98a2SYan Zheng u32 nritems; 10665d4f98a2SYan Zheng u32 i; 106783d4cfd4SJosef Bacik int ret = 0; 10685d4f98a2SYan Zheng int first = 1; 10695d4f98a2SYan Zheng int dirty = 0; 10705d4f98a2SYan Zheng 10715d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 10725d4f98a2SYan Zheng return 0; 10735d4f98a2SYan Zheng 10745d4f98a2SYan Zheng /* reloc trees always use full backref */ 10755d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 10765d4f98a2SYan Zheng parent = leaf->start; 10775d4f98a2SYan Zheng else 10785d4f98a2SYan Zheng parent = 0; 10795d4f98a2SYan Zheng 10805d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 10815d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 108282fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 108382fa113fSQu Wenruo 10845d4f98a2SYan Zheng cond_resched(); 10855d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 10865d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 10875d4f98a2SYan Zheng continue; 10885d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 10895d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 10905d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 10915d4f98a2SYan Zheng continue; 10925d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 10935d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 10945d4f98a2SYan Zheng if (bytenr == 0) 10955d4f98a2SYan Zheng continue; 10969569cc20SQu Wenruo if (!in_range(bytenr, rc->block_group->start, 10979569cc20SQu Wenruo rc->block_group->length)) 10985d4f98a2SYan Zheng continue; 10995d4f98a2SYan Zheng 11005d4f98a2SYan Zheng /* 11015d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 11025d4f98a2SYan Zheng * to complete and drop the extent cache 11035d4f98a2SYan Zheng */ 11045d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 11055d4f98a2SYan Zheng if (first) { 11065d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 11075d4f98a2SYan Zheng first = 0; 11084a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 11093fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 11105d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 11115d4f98a2SYan Zheng } 11124a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 11135d4f98a2SYan Zheng end = key.offset + 11145d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 11155d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 11160b246afaSJeff Mahoney fs_info->sectorsize)); 11170b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 11185d4f98a2SYan Zheng end--; 11195d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1120d0082371SJeff Mahoney key.offset, end); 11215d4f98a2SYan Zheng if (!ret) 11225d4f98a2SYan Zheng continue; 11235d4f98a2SYan Zheng 1124dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1125dcdbc059SNikolay Borisov key.offset, end, 1); 11265d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1127d0082371SJeff Mahoney key.offset, end); 11285d4f98a2SYan Zheng } 11295d4f98a2SYan Zheng } 11305d4f98a2SYan Zheng 11315d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 11325d4f98a2SYan Zheng bytenr, num_bytes); 113383d4cfd4SJosef Bacik if (ret) { 113483d4cfd4SJosef Bacik /* 113583d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 113683d4cfd4SJosef Bacik * in the file extent yet. 113783d4cfd4SJosef Bacik */ 113883d4cfd4SJosef Bacik break; 11393fd0a558SYan, Zheng } 11405d4f98a2SYan Zheng 11415d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 11425d4f98a2SYan Zheng dirty = 1; 11435d4f98a2SYan Zheng 11445d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 114582fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 114682fa113fSQu Wenruo num_bytes, parent); 114782fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 114882fa113fSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1149b06c4bf5SFilipe Manana key.objectid, key.offset); 115082fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 115183d4cfd4SJosef Bacik if (ret) { 115266642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 115383d4cfd4SJosef Bacik break; 115483d4cfd4SJosef Bacik } 11555d4f98a2SYan Zheng 1156ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, bytenr, 1157ffd4bb2aSQu Wenruo num_bytes, parent); 1158ffd4bb2aSQu Wenruo ref.real_root = root->root_key.objectid; 1159ffd4bb2aSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1160b06c4bf5SFilipe Manana key.objectid, key.offset); 1161ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 116283d4cfd4SJosef Bacik if (ret) { 116366642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 116483d4cfd4SJosef Bacik break; 116583d4cfd4SJosef Bacik } 11665d4f98a2SYan Zheng } 11675d4f98a2SYan Zheng if (dirty) 11685d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 11693fd0a558SYan, Zheng if (inode) 11703fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 117183d4cfd4SJosef Bacik return ret; 11725d4f98a2SYan Zheng } 11735d4f98a2SYan Zheng 11745d4f98a2SYan Zheng static noinline_for_stack 11755d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 11765d4f98a2SYan Zheng struct btrfs_path *path, int level) 11775d4f98a2SYan Zheng { 11785d4f98a2SYan Zheng struct btrfs_disk_key key1; 11795d4f98a2SYan Zheng struct btrfs_disk_key key2; 11805d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 11815d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 11825d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 11835d4f98a2SYan Zheng } 11845d4f98a2SYan Zheng 11855d4f98a2SYan Zheng /* 11865d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 11875d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 11885d4f98a2SYan Zheng * reloc tree was create can be replaced. 11895d4f98a2SYan Zheng * 11905d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 11915d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 11925d4f98a2SYan Zheng * errors, a negative error number is returned. 11935d4f98a2SYan Zheng */ 11943fd0a558SYan, Zheng static noinline_for_stack 11953d0174f7SQu Wenruo int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, 11965d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 11975d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 11985d4f98a2SYan Zheng int lowest_level, int max_level) 11995d4f98a2SYan Zheng { 12000b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 12015d4f98a2SYan Zheng struct extent_buffer *eb; 12025d4f98a2SYan Zheng struct extent_buffer *parent; 120382fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 12045d4f98a2SYan Zheng struct btrfs_key key; 12055d4f98a2SYan Zheng u64 old_bytenr; 12065d4f98a2SYan Zheng u64 new_bytenr; 12075d4f98a2SYan Zheng u64 old_ptr_gen; 12085d4f98a2SYan Zheng u64 new_ptr_gen; 12095d4f98a2SYan Zheng u64 last_snapshot; 12105d4f98a2SYan Zheng u32 blocksize; 12113fd0a558SYan, Zheng int cow = 0; 12125d4f98a2SYan Zheng int level; 12135d4f98a2SYan Zheng int ret; 12145d4f98a2SYan Zheng int slot; 12155d4f98a2SYan Zheng 12167a9213a9SJosef Bacik ASSERT(src->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 12177a9213a9SJosef Bacik ASSERT(dest->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 12185d4f98a2SYan Zheng 12195d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 12203fd0a558SYan, Zheng again: 12215d4f98a2SYan Zheng slot = path->slots[lowest_level]; 12225d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 12235d4f98a2SYan Zheng 12245d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 12255d4f98a2SYan Zheng level = btrfs_header_level(eb); 12265d4f98a2SYan Zheng 12275d4f98a2SYan Zheng if (level < lowest_level) { 12285d4f98a2SYan Zheng btrfs_tree_unlock(eb); 12295d4f98a2SYan Zheng free_extent_buffer(eb); 12305d4f98a2SYan Zheng return 0; 12315d4f98a2SYan Zheng } 12325d4f98a2SYan Zheng 12333fd0a558SYan, Zheng if (cow) { 12349631e4ccSJosef Bacik ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb, 12359631e4ccSJosef Bacik BTRFS_NESTING_COW); 123645b87c5dSJosef Bacik if (ret) { 123745b87c5dSJosef Bacik btrfs_tree_unlock(eb); 123845b87c5dSJosef Bacik free_extent_buffer(eb); 123945b87c5dSJosef Bacik return ret; 124045b87c5dSJosef Bacik } 12413fd0a558SYan, Zheng } 12425d4f98a2SYan Zheng 12435d4f98a2SYan Zheng if (next_key) { 12445d4f98a2SYan Zheng next_key->objectid = (u64)-1; 12455d4f98a2SYan Zheng next_key->type = (u8)-1; 12465d4f98a2SYan Zheng next_key->offset = (u64)-1; 12475d4f98a2SYan Zheng } 12485d4f98a2SYan Zheng 12495d4f98a2SYan Zheng parent = eb; 12505d4f98a2SYan Zheng while (1) { 12515d4f98a2SYan Zheng level = btrfs_header_level(parent); 12527a9213a9SJosef Bacik ASSERT(level >= lowest_level); 12535d4f98a2SYan Zheng 1254e3b83361SQu Wenruo ret = btrfs_bin_search(parent, &key, &slot); 1255cbca7d59SFilipe Manana if (ret < 0) 1256cbca7d59SFilipe Manana break; 12575d4f98a2SYan Zheng if (ret && slot > 0) 12585d4f98a2SYan Zheng slot--; 12595d4f98a2SYan Zheng 12605d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 12615d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 12625d4f98a2SYan Zheng 12635d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 12640b246afaSJeff Mahoney blocksize = fs_info->nodesize; 12655d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 12665d4f98a2SYan Zheng 12675d4f98a2SYan Zheng if (level <= max_level) { 12685d4f98a2SYan Zheng eb = path->nodes[level]; 12695d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 12705d4f98a2SYan Zheng path->slots[level]); 12715d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 12725d4f98a2SYan Zheng path->slots[level]); 12735d4f98a2SYan Zheng } else { 12745d4f98a2SYan Zheng new_bytenr = 0; 12755d4f98a2SYan Zheng new_ptr_gen = 0; 12765d4f98a2SYan Zheng } 12775d4f98a2SYan Zheng 1278fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 12795d4f98a2SYan Zheng ret = level; 12805d4f98a2SYan Zheng break; 12815d4f98a2SYan Zheng } 12825d4f98a2SYan Zheng 12835d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 12845d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 12853fd0a558SYan, Zheng if (level <= lowest_level) { 12865d4f98a2SYan Zheng ret = 0; 12875d4f98a2SYan Zheng break; 12885d4f98a2SYan Zheng } 12895d4f98a2SYan Zheng 12906b3426beSJosef Bacik eb = btrfs_read_node_slot(parent, slot); 129164c043deSLiu Bo if (IS_ERR(eb)) { 129264c043deSLiu Bo ret = PTR_ERR(eb); 1293264813acSLiu Bo break; 1294416bc658SJosef Bacik } 12955d4f98a2SYan Zheng btrfs_tree_lock(eb); 12963fd0a558SYan, Zheng if (cow) { 12975d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 12989631e4ccSJosef Bacik slot, &eb, 12999631e4ccSJosef Bacik BTRFS_NESTING_COW); 130045b87c5dSJosef Bacik if (ret) { 130145b87c5dSJosef Bacik btrfs_tree_unlock(eb); 130245b87c5dSJosef Bacik free_extent_buffer(eb); 130345b87c5dSJosef Bacik break; 130445b87c5dSJosef Bacik } 13055d4f98a2SYan Zheng } 13065d4f98a2SYan Zheng 13075d4f98a2SYan Zheng btrfs_tree_unlock(parent); 13085d4f98a2SYan Zheng free_extent_buffer(parent); 13095d4f98a2SYan Zheng 13105d4f98a2SYan Zheng parent = eb; 13115d4f98a2SYan Zheng continue; 13125d4f98a2SYan Zheng } 13135d4f98a2SYan Zheng 13143fd0a558SYan, Zheng if (!cow) { 13153fd0a558SYan, Zheng btrfs_tree_unlock(parent); 13163fd0a558SYan, Zheng free_extent_buffer(parent); 13173fd0a558SYan, Zheng cow = 1; 13183fd0a558SYan, Zheng goto again; 13193fd0a558SYan, Zheng } 13203fd0a558SYan, Zheng 13215d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 13225d4f98a2SYan Zheng path->slots[level]); 1323b3b4aa74SDavid Sterba btrfs_release_path(path); 13245d4f98a2SYan Zheng 13255d4f98a2SYan Zheng path->lowest_level = level; 13265d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 13275d4f98a2SYan Zheng path->lowest_level = 0; 13280e9873e2SJosef Bacik if (ret) { 13290e9873e2SJosef Bacik if (ret > 0) 13300e9873e2SJosef Bacik ret = -ENOENT; 13310e9873e2SJosef Bacik break; 13320e9873e2SJosef Bacik } 13335d4f98a2SYan Zheng 13345d4f98a2SYan Zheng /* 1335824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 1336824d8dffSQu Wenruo * 1337824d8dffSQu Wenruo * We must trace both trees. 1338824d8dffSQu Wenruo * 1) Tree reloc subtree 1339824d8dffSQu Wenruo * If not traced, we will leak data numbers 1340824d8dffSQu Wenruo * 2) Fs subtree 1341824d8dffSQu Wenruo * If not traced, we will double count old data 1342f616f5cdSQu Wenruo * 1343f616f5cdSQu Wenruo * We don't scan the subtree right now, but only record 1344f616f5cdSQu Wenruo * the swapped tree blocks. 1345f616f5cdSQu Wenruo * The real subtree rescan is delayed until we have new 1346f616f5cdSQu Wenruo * CoW on the subtree root node before transaction commit. 1347824d8dffSQu Wenruo */ 1348370a11b8SQu Wenruo ret = btrfs_qgroup_add_swapped_blocks(trans, dest, 1349370a11b8SQu Wenruo rc->block_group, parent, slot, 1350370a11b8SQu Wenruo path->nodes[level], path->slots[level], 1351370a11b8SQu Wenruo last_snapshot); 1352370a11b8SQu Wenruo if (ret < 0) 1353370a11b8SQu Wenruo break; 1354824d8dffSQu Wenruo /* 13555d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 13565d4f98a2SYan Zheng */ 13575d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 13585d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 13595d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 13605d4f98a2SYan Zheng 13615d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 13625d4f98a2SYan Zheng path->slots[level], old_bytenr); 13635d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 13645d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 13655d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 13665d4f98a2SYan Zheng 136782fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, old_bytenr, 136882fa113fSQu Wenruo blocksize, path->nodes[level]->start); 136982fa113fSQu Wenruo ref.skip_qgroup = true; 137082fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 137182fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 1372253e258cSJosef Bacik if (ret) { 1373253e258cSJosef Bacik btrfs_abort_transaction(trans, ret); 1374253e258cSJosef Bacik break; 1375253e258cSJosef Bacik } 137682fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 137782fa113fSQu Wenruo blocksize, 0); 137882fa113fSQu Wenruo ref.skip_qgroup = true; 137982fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 138082fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 1381253e258cSJosef Bacik if (ret) { 1382253e258cSJosef Bacik btrfs_abort_transaction(trans, ret); 1383253e258cSJosef Bacik break; 1384253e258cSJosef Bacik } 13855d4f98a2SYan Zheng 1386ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, new_bytenr, 1387ffd4bb2aSQu Wenruo blocksize, path->nodes[level]->start); 1388ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 1389ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 1390ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 1391253e258cSJosef Bacik if (ret) { 1392253e258cSJosef Bacik btrfs_abort_transaction(trans, ret); 1393253e258cSJosef Bacik break; 1394253e258cSJosef Bacik } 13955d4f98a2SYan Zheng 1396ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, old_bytenr, 1397ffd4bb2aSQu Wenruo blocksize, 0); 1398ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 1399ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 1400ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 1401253e258cSJosef Bacik if (ret) { 1402253e258cSJosef Bacik btrfs_abort_transaction(trans, ret); 1403253e258cSJosef Bacik break; 1404253e258cSJosef Bacik } 14055d4f98a2SYan Zheng 14065d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 14075d4f98a2SYan Zheng 14085d4f98a2SYan Zheng ret = level; 14095d4f98a2SYan Zheng break; 14105d4f98a2SYan Zheng } 14115d4f98a2SYan Zheng btrfs_tree_unlock(parent); 14125d4f98a2SYan Zheng free_extent_buffer(parent); 14135d4f98a2SYan Zheng return ret; 14145d4f98a2SYan Zheng } 14155d4f98a2SYan Zheng 14165d4f98a2SYan Zheng /* 14175d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 14185d4f98a2SYan Zheng */ 14195d4f98a2SYan Zheng static noinline_for_stack 14205d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 14215d4f98a2SYan Zheng int *level) 14225d4f98a2SYan Zheng { 14235d4f98a2SYan Zheng struct extent_buffer *eb; 14245d4f98a2SYan Zheng int i; 14255d4f98a2SYan Zheng u64 last_snapshot; 14265d4f98a2SYan Zheng u32 nritems; 14275d4f98a2SYan Zheng 14285d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 14295d4f98a2SYan Zheng 14305d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 14315d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 14325d4f98a2SYan Zheng path->nodes[i] = NULL; 14335d4f98a2SYan Zheng } 14345d4f98a2SYan Zheng 14355d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 14365d4f98a2SYan Zheng eb = path->nodes[i]; 14375d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 14385d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 14395d4f98a2SYan Zheng path->slots[i]++; 14405d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 14415d4f98a2SYan Zheng last_snapshot) 14425d4f98a2SYan Zheng continue; 14435d4f98a2SYan Zheng 14445d4f98a2SYan Zheng *level = i; 14455d4f98a2SYan Zheng return 0; 14465d4f98a2SYan Zheng } 14475d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 14485d4f98a2SYan Zheng path->nodes[i] = NULL; 14495d4f98a2SYan Zheng } 14505d4f98a2SYan Zheng return 1; 14515d4f98a2SYan Zheng } 14525d4f98a2SYan Zheng 14535d4f98a2SYan Zheng /* 14545d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 14555d4f98a2SYan Zheng */ 14565d4f98a2SYan Zheng static noinline_for_stack 14575d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 14585d4f98a2SYan Zheng int *level) 14595d4f98a2SYan Zheng { 14605d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 14615d4f98a2SYan Zheng int i; 14625d4f98a2SYan Zheng u64 ptr_gen = 0; 14635d4f98a2SYan Zheng u64 last_snapshot; 14645d4f98a2SYan Zheng u32 nritems; 14655d4f98a2SYan Zheng 14665d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 14675d4f98a2SYan Zheng 14685d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 14695d4f98a2SYan Zheng eb = path->nodes[i]; 14705d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 14715d4f98a2SYan Zheng while (path->slots[i] < nritems) { 14725d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 14735d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 14745d4f98a2SYan Zheng break; 14755d4f98a2SYan Zheng path->slots[i]++; 14765d4f98a2SYan Zheng } 14775d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 14785d4f98a2SYan Zheng if (i == *level) 14795d4f98a2SYan Zheng break; 14805d4f98a2SYan Zheng *level = i + 1; 14815d4f98a2SYan Zheng return 0; 14825d4f98a2SYan Zheng } 14835d4f98a2SYan Zheng if (i == 1) { 14845d4f98a2SYan Zheng *level = i; 14855d4f98a2SYan Zheng return 0; 14865d4f98a2SYan Zheng } 14875d4f98a2SYan Zheng 14888ef385bbSJosef Bacik eb = btrfs_read_node_slot(eb, path->slots[i]); 14898ef385bbSJosef Bacik if (IS_ERR(eb)) 149064c043deSLiu Bo return PTR_ERR(eb); 14915d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 14925d4f98a2SYan Zheng path->nodes[i - 1] = eb; 14935d4f98a2SYan Zheng path->slots[i - 1] = 0; 14945d4f98a2SYan Zheng } 14955d4f98a2SYan Zheng return 1; 14965d4f98a2SYan Zheng } 14975d4f98a2SYan Zheng 14985d4f98a2SYan Zheng /* 14995d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 15005d4f98a2SYan Zheng * [min_key, max_key) 15015d4f98a2SYan Zheng */ 15025d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 15035d4f98a2SYan Zheng struct btrfs_key *min_key, 15045d4f98a2SYan Zheng struct btrfs_key *max_key) 15055d4f98a2SYan Zheng { 15060b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 15075d4f98a2SYan Zheng struct inode *inode = NULL; 15085d4f98a2SYan Zheng u64 objectid; 15095d4f98a2SYan Zheng u64 start, end; 151033345d01SLi Zefan u64 ino; 15115d4f98a2SYan Zheng 15125d4f98a2SYan Zheng objectid = min_key->objectid; 15135d4f98a2SYan Zheng while (1) { 15145d4f98a2SYan Zheng cond_resched(); 15155d4f98a2SYan Zheng iput(inode); 15165d4f98a2SYan Zheng 15175d4f98a2SYan Zheng if (objectid > max_key->objectid) 15185d4f98a2SYan Zheng break; 15195d4f98a2SYan Zheng 15205d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 15215d4f98a2SYan Zheng if (!inode) 15225d4f98a2SYan Zheng break; 15234a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 15245d4f98a2SYan Zheng 152533345d01SLi Zefan if (ino > max_key->objectid) { 15265d4f98a2SYan Zheng iput(inode); 15275d4f98a2SYan Zheng break; 15285d4f98a2SYan Zheng } 15295d4f98a2SYan Zheng 153033345d01SLi Zefan objectid = ino + 1; 15315d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 15325d4f98a2SYan Zheng continue; 15335d4f98a2SYan Zheng 153433345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 15355d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 15365d4f98a2SYan Zheng continue; 15375d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 15385d4f98a2SYan Zheng start = 0; 15395d4f98a2SYan Zheng else { 15405d4f98a2SYan Zheng start = min_key->offset; 15410b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 15425d4f98a2SYan Zheng } 15435d4f98a2SYan Zheng } else { 15445d4f98a2SYan Zheng start = 0; 15455d4f98a2SYan Zheng } 15465d4f98a2SYan Zheng 154733345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 15485d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 15495d4f98a2SYan Zheng continue; 15505d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 15515d4f98a2SYan Zheng end = (u64)-1; 15525d4f98a2SYan Zheng } else { 15535d4f98a2SYan Zheng if (max_key->offset == 0) 15545d4f98a2SYan Zheng continue; 15555d4f98a2SYan Zheng end = max_key->offset; 15560b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 15575d4f98a2SYan Zheng end--; 15585d4f98a2SYan Zheng } 15595d4f98a2SYan Zheng } else { 15605d4f98a2SYan Zheng end = (u64)-1; 15615d4f98a2SYan Zheng } 15625d4f98a2SYan Zheng 15635d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 1564d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 1565dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 1566d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 15675d4f98a2SYan Zheng } 15685d4f98a2SYan Zheng return 0; 15695d4f98a2SYan Zheng } 15705d4f98a2SYan Zheng 15715d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 15725d4f98a2SYan Zheng struct btrfs_key *key) 15735d4f98a2SYan Zheng 15745d4f98a2SYan Zheng { 15755d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 15765d4f98a2SYan Zheng if (!path->nodes[level]) 15775d4f98a2SYan Zheng break; 15785d4f98a2SYan Zheng if (path->slots[level] + 1 < 15795d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 15805d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 15815d4f98a2SYan Zheng path->slots[level] + 1); 15825d4f98a2SYan Zheng return 0; 15835d4f98a2SYan Zheng } 15845d4f98a2SYan Zheng level++; 15855d4f98a2SYan Zheng } 15865d4f98a2SYan Zheng return 1; 15875d4f98a2SYan Zheng } 15885d4f98a2SYan Zheng 15895d4f98a2SYan Zheng /* 1590d2311e69SQu Wenruo * Insert current subvolume into reloc_control::dirty_subvol_roots 1591d2311e69SQu Wenruo */ 1592ac54da6cSJosef Bacik static int insert_dirty_subvol(struct btrfs_trans_handle *trans, 1593d2311e69SQu Wenruo struct reloc_control *rc, 1594d2311e69SQu Wenruo struct btrfs_root *root) 1595d2311e69SQu Wenruo { 1596d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 1597d2311e69SQu Wenruo struct btrfs_root_item *reloc_root_item; 15987934133fSJosef Bacik int ret; 1599d2311e69SQu Wenruo 1600d2311e69SQu Wenruo /* @root must be a subvolume tree root with a valid reloc tree */ 1601d2311e69SQu Wenruo ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 1602d2311e69SQu Wenruo ASSERT(reloc_root); 1603d2311e69SQu Wenruo 1604d2311e69SQu Wenruo reloc_root_item = &reloc_root->root_item; 1605d2311e69SQu Wenruo memset(&reloc_root_item->drop_progress, 0, 1606d2311e69SQu Wenruo sizeof(reloc_root_item->drop_progress)); 1607c8422684SDavid Sterba btrfs_set_root_drop_level(reloc_root_item, 0); 1608d2311e69SQu Wenruo btrfs_set_root_refs(reloc_root_item, 0); 16097934133fSJosef Bacik ret = btrfs_update_reloc_root(trans, root); 16107934133fSJosef Bacik if (ret) 16117934133fSJosef Bacik return ret; 1612d2311e69SQu Wenruo 1613d2311e69SQu Wenruo if (list_empty(&root->reloc_dirty_list)) { 161400246528SJosef Bacik btrfs_grab_root(root); 1615d2311e69SQu Wenruo list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); 1616d2311e69SQu Wenruo } 1617ac54da6cSJosef Bacik 1618ac54da6cSJosef Bacik return 0; 1619d2311e69SQu Wenruo } 1620d2311e69SQu Wenruo 1621d2311e69SQu Wenruo static int clean_dirty_subvols(struct reloc_control *rc) 1622d2311e69SQu Wenruo { 1623d2311e69SQu Wenruo struct btrfs_root *root; 1624d2311e69SQu Wenruo struct btrfs_root *next; 1625d2311e69SQu Wenruo int ret = 0; 162630d40577SQu Wenruo int ret2; 1627d2311e69SQu Wenruo 1628d2311e69SQu Wenruo list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, 1629d2311e69SQu Wenruo reloc_dirty_list) { 163030d40577SQu Wenruo if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 163130d40577SQu Wenruo /* Merged subvolume, cleanup its reloc root */ 1632d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 1633d2311e69SQu Wenruo 1634d2311e69SQu Wenruo list_del_init(&root->reloc_dirty_list); 1635d2311e69SQu Wenruo root->reloc_root = NULL; 16366282675eSQu Wenruo /* 16376282675eSQu Wenruo * Need barrier to ensure clear_bit() only happens after 16386282675eSQu Wenruo * root->reloc_root = NULL. Pairs with have_reloc_root. 16396282675eSQu Wenruo */ 16406282675eSQu Wenruo smp_wmb(); 16411fac4a54SQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 1642f28de8d8SJosef Bacik if (reloc_root) { 1643f44deb74SJosef Bacik /* 1644f44deb74SJosef Bacik * btrfs_drop_snapshot drops our ref we hold for 1645f44deb74SJosef Bacik * ->reloc_root. If it fails however we must 1646f44deb74SJosef Bacik * drop the ref ourselves. 1647f44deb74SJosef Bacik */ 1648f28de8d8SJosef Bacik ret2 = btrfs_drop_snapshot(reloc_root, 0, 1); 1649f44deb74SJosef Bacik if (ret2 < 0) { 1650f44deb74SJosef Bacik btrfs_put_root(reloc_root); 1651f44deb74SJosef Bacik if (!ret) 1652f28de8d8SJosef Bacik ret = ret2; 1653f28de8d8SJosef Bacik } 1654f44deb74SJosef Bacik } 165500246528SJosef Bacik btrfs_put_root(root); 165630d40577SQu Wenruo } else { 165730d40577SQu Wenruo /* Orphan reloc tree, just clean it up */ 16580078a9f9SNikolay Borisov ret2 = btrfs_drop_snapshot(root, 0, 1); 1659f44deb74SJosef Bacik if (ret2 < 0) { 1660f44deb74SJosef Bacik btrfs_put_root(root); 1661f44deb74SJosef Bacik if (!ret) 166230d40577SQu Wenruo ret = ret2; 166330d40577SQu Wenruo } 1664d2311e69SQu Wenruo } 1665f44deb74SJosef Bacik } 1666d2311e69SQu Wenruo return ret; 1667d2311e69SQu Wenruo } 1668d2311e69SQu Wenruo 1669d2311e69SQu Wenruo /* 16705d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 16715d4f98a2SYan Zheng * fs tree. 16725d4f98a2SYan Zheng */ 16735d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 16745d4f98a2SYan Zheng struct btrfs_root *root) 16755d4f98a2SYan Zheng { 16760b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 16775d4f98a2SYan Zheng struct btrfs_key key; 16785d4f98a2SYan Zheng struct btrfs_key next_key; 16799e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 16805d4f98a2SYan Zheng struct btrfs_root *reloc_root; 16815d4f98a2SYan Zheng struct btrfs_root_item *root_item; 16825d4f98a2SYan Zheng struct btrfs_path *path; 16833fd0a558SYan, Zheng struct extent_buffer *leaf; 1684fca3a45dSJosef Bacik int reserve_level; 16855d4f98a2SYan Zheng int level; 16865d4f98a2SYan Zheng int max_level; 16875d4f98a2SYan Zheng int replaced = 0; 1688c6a592f2SNikolay Borisov int ret = 0; 16893fd0a558SYan, Zheng u32 min_reserved; 16905d4f98a2SYan Zheng 16915d4f98a2SYan Zheng path = btrfs_alloc_path(); 16925d4f98a2SYan Zheng if (!path) 16935d4f98a2SYan Zheng return -ENOMEM; 1694e4058b54SDavid Sterba path->reada = READA_FORWARD; 16955d4f98a2SYan Zheng 16965d4f98a2SYan Zheng reloc_root = root->reloc_root; 16975d4f98a2SYan Zheng root_item = &reloc_root->root_item; 16985d4f98a2SYan Zheng 16995d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 17005d4f98a2SYan Zheng level = btrfs_root_level(root_item); 170167439dadSDavid Sterba atomic_inc(&reloc_root->node->refs); 17025d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 17035d4f98a2SYan Zheng path->slots[level] = 0; 17045d4f98a2SYan Zheng } else { 17055d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 17065d4f98a2SYan Zheng 1707c8422684SDavid Sterba level = btrfs_root_drop_level(root_item); 17085d4f98a2SYan Zheng BUG_ON(level == 0); 17095d4f98a2SYan Zheng path->lowest_level = level; 17105d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 171133c66f43SYan Zheng path->lowest_level = 0; 17125d4f98a2SYan Zheng if (ret < 0) { 17135d4f98a2SYan Zheng btrfs_free_path(path); 17145d4f98a2SYan Zheng return ret; 17155d4f98a2SYan Zheng } 17165d4f98a2SYan Zheng 17175d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 17185d4f98a2SYan Zheng path->slots[level]); 17195d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 17205d4f98a2SYan Zheng 17215d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 17225d4f98a2SYan Zheng } 17235d4f98a2SYan Zheng 172444d354abSQu Wenruo /* 172544d354abSQu Wenruo * In merge_reloc_root(), we modify the upper level pointer to swap the 172644d354abSQu Wenruo * tree blocks between reloc tree and subvolume tree. Thus for tree 172744d354abSQu Wenruo * block COW, we COW at most from level 1 to root level for each tree. 172844d354abSQu Wenruo * 172944d354abSQu Wenruo * Thus the needed metadata size is at most root_level * nodesize, 173044d354abSQu Wenruo * and * 2 since we have two trees to COW. 173144d354abSQu Wenruo */ 1732fca3a45dSJosef Bacik reserve_level = max_t(int, 1, btrfs_root_level(root_item)); 1733fca3a45dSJosef Bacik min_reserved = fs_info->nodesize * reserve_level * 2; 17345d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 17355d4f98a2SYan Zheng 17365d4f98a2SYan Zheng while (1) { 173708e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 173844d354abSQu Wenruo BTRFS_RESERVE_FLUSH_LIMIT); 1739c6a592f2SNikolay Borisov if (ret) 17409e6a0c52SJosef Bacik goto out; 17419e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 17429e6a0c52SJosef Bacik if (IS_ERR(trans)) { 1743c6a592f2SNikolay Borisov ret = PTR_ERR(trans); 17449e6a0c52SJosef Bacik trans = NULL; 17459e6a0c52SJosef Bacik goto out; 17469e6a0c52SJosef Bacik } 17472abc726aSJosef Bacik 17482abc726aSJosef Bacik /* 17492abc726aSJosef Bacik * At this point we no longer have a reloc_control, so we can't 17502abc726aSJosef Bacik * depend on btrfs_init_reloc_root to update our last_trans. 17512abc726aSJosef Bacik * 17522abc726aSJosef Bacik * But that's ok, we started the trans handle on our 17532abc726aSJosef Bacik * corresponding fs_root, which means it's been added to the 17542abc726aSJosef Bacik * dirty list. At commit time we'll still call 17552abc726aSJosef Bacik * btrfs_update_reloc_root() and update our root item 17562abc726aSJosef Bacik * appropriately. 17572abc726aSJosef Bacik */ 17582abc726aSJosef Bacik reloc_root->last_trans = trans->transid; 17599e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 17603fd0a558SYan, Zheng 17613fd0a558SYan, Zheng replaced = 0; 17625d4f98a2SYan Zheng max_level = level; 17635d4f98a2SYan Zheng 17645d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 1765c6a592f2SNikolay Borisov if (ret < 0) 17665d4f98a2SYan Zheng goto out; 17675d4f98a2SYan Zheng if (ret > 0) 17685d4f98a2SYan Zheng break; 17695d4f98a2SYan Zheng 17705d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 17715d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 17725d4f98a2SYan Zheng ret = 0; 17735d4f98a2SYan Zheng } else { 17743d0174f7SQu Wenruo ret = replace_path(trans, rc, root, reloc_root, path, 17753fd0a558SYan, Zheng &next_key, level, max_level); 17765d4f98a2SYan Zheng } 1777c6a592f2SNikolay Borisov if (ret < 0) 17785d4f98a2SYan Zheng goto out; 17795d4f98a2SYan Zheng if (ret > 0) { 17805d4f98a2SYan Zheng level = ret; 17815d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 17825d4f98a2SYan Zheng path->slots[level]); 17835d4f98a2SYan Zheng replaced = 1; 17845d4f98a2SYan Zheng } 17855d4f98a2SYan Zheng 17865d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 17875d4f98a2SYan Zheng if (ret > 0) 17885d4f98a2SYan Zheng break; 17895d4f98a2SYan Zheng 17905d4f98a2SYan Zheng BUG_ON(level == 0); 17915d4f98a2SYan Zheng /* 17925d4f98a2SYan Zheng * save the merging progress in the drop_progress. 17935d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 17945d4f98a2SYan Zheng */ 17955d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 17965d4f98a2SYan Zheng path->slots[level]); 1797c8422684SDavid Sterba btrfs_set_root_drop_level(root_item, level); 17985d4f98a2SYan Zheng 17993a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 18009e6a0c52SJosef Bacik trans = NULL; 18015d4f98a2SYan Zheng 18022ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 18035d4f98a2SYan Zheng 18045d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 18055d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 18065d4f98a2SYan Zheng } 18075d4f98a2SYan Zheng 18085d4f98a2SYan Zheng /* 18095d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 18105d4f98a2SYan Zheng * relocated and the block is tree root. 18115d4f98a2SYan Zheng */ 18125d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 18139631e4ccSJosef Bacik ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf, 18149631e4ccSJosef Bacik BTRFS_NESTING_COW); 18155d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 18165d4f98a2SYan Zheng free_extent_buffer(leaf); 18175d4f98a2SYan Zheng out: 18185d4f98a2SYan Zheng btrfs_free_path(path); 18195d4f98a2SYan Zheng 1820ac54da6cSJosef Bacik if (ret == 0) { 1821ac54da6cSJosef Bacik ret = insert_dirty_subvol(trans, rc, root); 1822ac54da6cSJosef Bacik if (ret) 1823ac54da6cSJosef Bacik btrfs_abort_transaction(trans, ret); 1824ac54da6cSJosef Bacik } 18255d4f98a2SYan Zheng 18269e6a0c52SJosef Bacik if (trans) 18273a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 18285d4f98a2SYan Zheng 18292ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 18305d4f98a2SYan Zheng 18315d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 18325d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 18335d4f98a2SYan Zheng 1834c6a592f2SNikolay Borisov return ret; 18355d4f98a2SYan Zheng } 18365d4f98a2SYan Zheng 18373fd0a558SYan, Zheng static noinline_for_stack 18383fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 18395d4f98a2SYan Zheng { 18403fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 18410b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 18423fd0a558SYan, Zheng struct btrfs_root *reloc_root; 18435d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 18443fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 18453fd0a558SYan, Zheng u64 num_bytes = 0; 18463fd0a558SYan, Zheng int ret; 18473fd0a558SYan, Zheng 18480b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 18490b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 18503fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 18510b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 18527585717fSChris Mason 18533fd0a558SYan, Zheng again: 18543fd0a558SYan, Zheng if (!err) { 18553fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 185608e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 185708e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 18583fd0a558SYan, Zheng if (ret) 18593fd0a558SYan, Zheng err = ret; 18603fd0a558SYan, Zheng } 18613fd0a558SYan, Zheng 18627a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 18633612b495STsutomu Itoh if (IS_ERR(trans)) { 18643612b495STsutomu Itoh if (!err) 18652ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 186663f018beSNikolay Borisov num_bytes, NULL); 18673612b495STsutomu Itoh return PTR_ERR(trans); 18683612b495STsutomu Itoh } 18693fd0a558SYan, Zheng 18703fd0a558SYan, Zheng if (!err) { 18713fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 18723a45bb20SJeff Mahoney btrfs_end_transaction(trans); 18732ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 187463f018beSNikolay Borisov num_bytes, NULL); 18753fd0a558SYan, Zheng goto again; 18763fd0a558SYan, Zheng } 18773fd0a558SYan, Zheng } 18783fd0a558SYan, Zheng 18793fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 18803fd0a558SYan, Zheng 18813fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 18823fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 18833fd0a558SYan, Zheng struct btrfs_root, root_list); 18843fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 18853fd0a558SYan, Zheng 1886a820feb5SDavid Sterba root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, 1887a820feb5SDavid Sterba false); 1888e0b085b0SJosef Bacik if (IS_ERR(root)) { 1889e0b085b0SJosef Bacik /* 1890e0b085b0SJosef Bacik * Even if we have an error we need this reloc root 1891e0b085b0SJosef Bacik * back on our list so we can clean up properly. 1892e0b085b0SJosef Bacik */ 1893e0b085b0SJosef Bacik list_add(&reloc_root->root_list, &reloc_roots); 1894e0b085b0SJosef Bacik btrfs_abort_transaction(trans, (int)PTR_ERR(root)); 1895e0b085b0SJosef Bacik if (!err) 1896e0b085b0SJosef Bacik err = PTR_ERR(root); 1897e0b085b0SJosef Bacik break; 1898e0b085b0SJosef Bacik } 1899e0b085b0SJosef Bacik ASSERT(root->reloc_root == reloc_root); 19003fd0a558SYan, Zheng 19013fd0a558SYan, Zheng /* 19023fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 19033fd0a558SYan, Zheng * knows it should resumes merging 19043fd0a558SYan, Zheng */ 19053fd0a558SYan, Zheng if (!err) 19063fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 1907bbae13f8SJosef Bacik ret = btrfs_update_reloc_root(trans, root); 19083fd0a558SYan, Zheng 1909bbae13f8SJosef Bacik /* 1910bbae13f8SJosef Bacik * Even if we have an error we need this reloc root back on our 1911bbae13f8SJosef Bacik * list so we can clean up properly. 1912bbae13f8SJosef Bacik */ 19133fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 191400246528SJosef Bacik btrfs_put_root(root); 1915bbae13f8SJosef Bacik 1916bbae13f8SJosef Bacik if (ret) { 1917bbae13f8SJosef Bacik btrfs_abort_transaction(trans, ret); 1918bbae13f8SJosef Bacik if (!err) 1919bbae13f8SJosef Bacik err = ret; 1920bbae13f8SJosef Bacik break; 1921bbae13f8SJosef Bacik } 19223fd0a558SYan, Zheng } 19233fd0a558SYan, Zheng 19243fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 19253fd0a558SYan, Zheng 19263fd0a558SYan, Zheng if (!err) 1927fb686c68SJosef Bacik err = btrfs_commit_transaction(trans); 19283fd0a558SYan, Zheng else 19293a45bb20SJeff Mahoney btrfs_end_transaction(trans); 19303fd0a558SYan, Zheng return err; 19313fd0a558SYan, Zheng } 19323fd0a558SYan, Zheng 19333fd0a558SYan, Zheng static noinline_for_stack 1934aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 1935aca1bba6SLiu Bo { 1936a7571232SNikolay Borisov struct btrfs_root *reloc_root, *tmp; 1937aca1bba6SLiu Bo 1938a7571232SNikolay Borisov list_for_each_entry_safe(reloc_root, tmp, list, root_list) 1939bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 1940aca1bba6SLiu Bo } 1941aca1bba6SLiu Bo 1942aca1bba6SLiu Bo static noinline_for_stack 194394404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 19443fd0a558SYan, Zheng { 19450b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 19465d4f98a2SYan Zheng struct btrfs_root *root; 19475d4f98a2SYan Zheng struct btrfs_root *reloc_root; 19483fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 19493fd0a558SYan, Zheng int found = 0; 1950aca1bba6SLiu Bo int ret = 0; 19513fd0a558SYan, Zheng again: 19523fd0a558SYan, Zheng root = rc->extent_root; 19537585717fSChris Mason 19547585717fSChris Mason /* 19557585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 19567585717fSChris Mason * we have to make sure nobody is in the middle of 19577585717fSChris Mason * adding their roots to the list while we are 19587585717fSChris Mason * doing this splice 19597585717fSChris Mason */ 19600b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 19613fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 19620b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 19635d4f98a2SYan Zheng 19643fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 19653fd0a558SYan, Zheng found = 1; 19663fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 19673fd0a558SYan, Zheng struct btrfs_root, root_list); 19685d4f98a2SYan Zheng 1969a820feb5SDavid Sterba root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, 1970a820feb5SDavid Sterba false); 19715d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 197224213fa4SJosef Bacik if (IS_ERR(root)) { 197324213fa4SJosef Bacik /* 197424213fa4SJosef Bacik * For recovery we read the fs roots on mount, 197524213fa4SJosef Bacik * and if we didn't find the root then we marked 197624213fa4SJosef Bacik * the reloc root as a garbage root. For normal 197724213fa4SJosef Bacik * relocation obviously the root should exist in 197824213fa4SJosef Bacik * memory. However there's no reason we can't 197924213fa4SJosef Bacik * handle the error properly here just in case. 198024213fa4SJosef Bacik */ 198124213fa4SJosef Bacik ASSERT(0); 198224213fa4SJosef Bacik ret = PTR_ERR(root); 198324213fa4SJosef Bacik goto out; 198424213fa4SJosef Bacik } 198524213fa4SJosef Bacik if (root->reloc_root != reloc_root) { 198624213fa4SJosef Bacik /* 198724213fa4SJosef Bacik * This is actually impossible without something 198824213fa4SJosef Bacik * going really wrong (like weird race condition 198924213fa4SJosef Bacik * or cosmic rays). 199024213fa4SJosef Bacik */ 199124213fa4SJosef Bacik ASSERT(0); 199224213fa4SJosef Bacik ret = -EINVAL; 199324213fa4SJosef Bacik goto out; 199424213fa4SJosef Bacik } 19953fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 199600246528SJosef Bacik btrfs_put_root(root); 1997b37b39cdSJosef Bacik if (ret) { 199825e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 199925e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 200025e293c2SWang Shilong &reloc_roots); 2001aca1bba6SLiu Bo goto out; 2002b37b39cdSJosef Bacik } 20033fd0a558SYan, Zheng } else { 200451415b6cSQu Wenruo if (!IS_ERR(root)) { 200551415b6cSQu Wenruo if (root->reloc_root == reloc_root) { 200651415b6cSQu Wenruo root->reloc_root = NULL; 200751415b6cSQu Wenruo btrfs_put_root(reloc_root); 200851415b6cSQu Wenruo } 20091dae7e0eSQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, 20101dae7e0eSQu Wenruo &root->state); 201151415b6cSQu Wenruo btrfs_put_root(root); 201251415b6cSQu Wenruo } 201351415b6cSQu Wenruo 20143fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 201530d40577SQu Wenruo /* Don't forget to queue this reloc root for cleanup */ 201630d40577SQu Wenruo list_add_tail(&reloc_root->reloc_dirty_list, 201730d40577SQu Wenruo &rc->dirty_subvol_roots); 20183fd0a558SYan, Zheng } 20195d4f98a2SYan Zheng } 20205d4f98a2SYan Zheng 20213fd0a558SYan, Zheng if (found) { 20223fd0a558SYan, Zheng found = 0; 20233fd0a558SYan, Zheng goto again; 20245d4f98a2SYan Zheng } 2025aca1bba6SLiu Bo out: 2026aca1bba6SLiu Bo if (ret) { 20270b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2028aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2029467bb1d2SWang Shilong 2030467bb1d2SWang Shilong /* new reloc root may be added */ 20310b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2032467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 20330b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2034467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2035aca1bba6SLiu Bo } 2036aca1bba6SLiu Bo 20377b7b7431SJosef Bacik /* 20387b7b7431SJosef Bacik * We used to have 20397b7b7431SJosef Bacik * 20407b7b7431SJosef Bacik * BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 20417b7b7431SJosef Bacik * 20427b7b7431SJosef Bacik * here, but it's wrong. If we fail to start the transaction in 20437b7b7431SJosef Bacik * prepare_to_merge() we will have only 0 ref reloc roots, none of which 20447b7b7431SJosef Bacik * have actually been removed from the reloc_root_tree rb tree. This is 20457b7b7431SJosef Bacik * fine because we're bailing here, and we hold a reference on the root 20467b7b7431SJosef Bacik * for the list that holds it, so these roots will be cleaned up when we 20477b7b7431SJosef Bacik * do the reloc_dirty_list afterwards. Meanwhile the root->reloc_root 20487b7b7431SJosef Bacik * will be cleaned up on unmount. 20497b7b7431SJosef Bacik * 20507b7b7431SJosef Bacik * The remaining nodes will be cleaned up by free_reloc_control. 20517b7b7431SJosef Bacik */ 20525d4f98a2SYan Zheng } 20535d4f98a2SYan Zheng 20545d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 20555d4f98a2SYan Zheng { 20565d4f98a2SYan Zheng struct tree_block *block; 20575d4f98a2SYan Zheng struct rb_node *rb_node; 20585d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 20595d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 20605d4f98a2SYan Zheng rb_erase(rb_node, blocks); 20615d4f98a2SYan Zheng kfree(block); 20625d4f98a2SYan Zheng } 20635d4f98a2SYan Zheng } 20645d4f98a2SYan Zheng 20655d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 20665d4f98a2SYan Zheng struct btrfs_root *reloc_root) 20675d4f98a2SYan Zheng { 20680b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 20695d4f98a2SYan Zheng struct btrfs_root *root; 2070442b1ac5SJosef Bacik int ret; 20715d4f98a2SYan Zheng 20725d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 20735d4f98a2SYan Zheng return 0; 20745d4f98a2SYan Zheng 2075a820feb5SDavid Sterba root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, false); 2076404bccbcSJosef Bacik 2077404bccbcSJosef Bacik /* 2078404bccbcSJosef Bacik * This should succeed, since we can't have a reloc root without having 2079404bccbcSJosef Bacik * already looked up the actual root and created the reloc root for this 2080404bccbcSJosef Bacik * root. 2081404bccbcSJosef Bacik * 2082404bccbcSJosef Bacik * However if there's some sort of corruption where we have a ref to a 2083404bccbcSJosef Bacik * reloc root without a corresponding root this could return ENOENT. 2084404bccbcSJosef Bacik */ 2085404bccbcSJosef Bacik if (IS_ERR(root)) { 2086404bccbcSJosef Bacik ASSERT(0); 2087404bccbcSJosef Bacik return PTR_ERR(root); 2088404bccbcSJosef Bacik } 2089404bccbcSJosef Bacik if (root->reloc_root != reloc_root) { 2090404bccbcSJosef Bacik ASSERT(0); 2091404bccbcSJosef Bacik btrfs_err(fs_info, 2092404bccbcSJosef Bacik "root %llu has two reloc roots associated with it", 2093404bccbcSJosef Bacik reloc_root->root_key.offset); 2094404bccbcSJosef Bacik btrfs_put_root(root); 2095404bccbcSJosef Bacik return -EUCLEAN; 2096404bccbcSJosef Bacik } 2097442b1ac5SJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 209800246528SJosef Bacik btrfs_put_root(root); 20995d4f98a2SYan Zheng 2100442b1ac5SJosef Bacik return ret; 21015d4f98a2SYan Zheng } 21025d4f98a2SYan Zheng 21033fd0a558SYan, Zheng static noinline_for_stack 21043fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 21053fd0a558SYan, Zheng struct reloc_control *rc, 2106a26195a5SQu Wenruo struct btrfs_backref_node *node, 2107a26195a5SQu Wenruo struct btrfs_backref_edge *edges[]) 21085d4f98a2SYan Zheng { 2109a26195a5SQu Wenruo struct btrfs_backref_node *next; 21105d4f98a2SYan Zheng struct btrfs_root *root; 21113fd0a558SYan, Zheng int index = 0; 211292de551bSJosef Bacik int ret; 21133fd0a558SYan, Zheng 21145d4f98a2SYan Zheng next = node; 21155d4f98a2SYan Zheng while (1) { 21165d4f98a2SYan Zheng cond_resched(); 21175d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 21185d4f98a2SYan Zheng root = next->root; 21198ee66afeSJosef Bacik 21208ee66afeSJosef Bacik /* 21218ee66afeSJosef Bacik * If there is no root, then our references for this block are 21228ee66afeSJosef Bacik * incomplete, as we should be able to walk all the way up to a 21238ee66afeSJosef Bacik * block that is owned by a root. 21248ee66afeSJosef Bacik * 21258ee66afeSJosef Bacik * This path is only for SHAREABLE roots, so if we come upon a 21268ee66afeSJosef Bacik * non-SHAREABLE root then we have backrefs that resolve 21278ee66afeSJosef Bacik * improperly. 21288ee66afeSJosef Bacik * 21298ee66afeSJosef Bacik * Both of these cases indicate file system corruption, or a bug 21308ee66afeSJosef Bacik * in the backref walking code. 21318ee66afeSJosef Bacik */ 21328ee66afeSJosef Bacik if (!root) { 21338ee66afeSJosef Bacik ASSERT(0); 21348ee66afeSJosef Bacik btrfs_err(trans->fs_info, 21358ee66afeSJosef Bacik "bytenr %llu doesn't have a backref path ending in a root", 21368ee66afeSJosef Bacik node->bytenr); 21378ee66afeSJosef Bacik return ERR_PTR(-EUCLEAN); 21388ee66afeSJosef Bacik } 21398ee66afeSJosef Bacik if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) { 21408ee66afeSJosef Bacik ASSERT(0); 21418ee66afeSJosef Bacik btrfs_err(trans->fs_info, 21428ee66afeSJosef Bacik "bytenr %llu has multiple refs with one ending in a non-shareable root", 21438ee66afeSJosef Bacik node->bytenr); 21448ee66afeSJosef Bacik return ERR_PTR(-EUCLEAN); 21458ee66afeSJosef Bacik } 21465d4f98a2SYan Zheng 21475d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 214892de551bSJosef Bacik ret = record_reloc_root_in_trans(trans, root); 214992de551bSJosef Bacik if (ret) 215092de551bSJosef Bacik return ERR_PTR(ret); 21515d4f98a2SYan Zheng break; 21525d4f98a2SYan Zheng } 21535d4f98a2SYan Zheng 215492de551bSJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 215592de551bSJosef Bacik if (ret) 215692de551bSJosef Bacik return ERR_PTR(ret); 21573fd0a558SYan, Zheng root = root->reloc_root; 21583fd0a558SYan, Zheng 215939200e59SJosef Bacik /* 216039200e59SJosef Bacik * We could have raced with another thread which failed, so 216139200e59SJosef Bacik * root->reloc_root may not be set, return ENOENT in this case. 216239200e59SJosef Bacik */ 216339200e59SJosef Bacik if (!root) 216439200e59SJosef Bacik return ERR_PTR(-ENOENT); 216539200e59SJosef Bacik 21663fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 21678ee66afeSJosef Bacik /* 21688ee66afeSJosef Bacik * We just created the reloc root, so we shouldn't have 21698ee66afeSJosef Bacik * ->new_bytenr set and this shouldn't be in the changed 21708ee66afeSJosef Bacik * list. If it is then we have multiple roots pointing 21718ee66afeSJosef Bacik * at the same bytenr which indicates corruption, or 21728ee66afeSJosef Bacik * we've made a mistake in the backref walking code. 21738ee66afeSJosef Bacik */ 21748ee66afeSJosef Bacik ASSERT(next->new_bytenr == 0); 21758ee66afeSJosef Bacik ASSERT(list_empty(&next->list)); 21768ee66afeSJosef Bacik if (next->new_bytenr || !list_empty(&next->list)) { 21778ee66afeSJosef Bacik btrfs_err(trans->fs_info, 21788ee66afeSJosef Bacik "bytenr %llu possibly has multiple roots pointing at the same bytenr %llu", 21798ee66afeSJosef Bacik node->bytenr, next->bytenr); 21808ee66afeSJosef Bacik return ERR_PTR(-EUCLEAN); 21818ee66afeSJosef Bacik } 21828ee66afeSJosef Bacik 21833fd0a558SYan, Zheng next->new_bytenr = root->node->start; 218400246528SJosef Bacik btrfs_put_root(next->root); 218500246528SJosef Bacik next->root = btrfs_grab_root(root); 21860b530bc5SJosef Bacik ASSERT(next->root); 21873fd0a558SYan, Zheng list_add_tail(&next->list, 21883fd0a558SYan, Zheng &rc->backref_cache.changed); 21899569cc20SQu Wenruo mark_block_processed(rc, next); 21905d4f98a2SYan Zheng break; 21915d4f98a2SYan Zheng } 21925d4f98a2SYan Zheng 21933fd0a558SYan, Zheng WARN_ON(1); 21945d4f98a2SYan Zheng root = NULL; 21955d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 21965d4f98a2SYan Zheng if (!next || next->level <= node->level) 21975d4f98a2SYan Zheng break; 21985d4f98a2SYan Zheng } 2199cbdc2ebcSJosef Bacik if (!root) { 2200cbdc2ebcSJosef Bacik /* 2201cbdc2ebcSJosef Bacik * This can happen if there's fs corruption or if there's a bug 2202cbdc2ebcSJosef Bacik * in the backref lookup code. 2203cbdc2ebcSJosef Bacik */ 2204cbdc2ebcSJosef Bacik ASSERT(0); 2205cbdc2ebcSJosef Bacik return ERR_PTR(-ENOENT); 2206cbdc2ebcSJosef Bacik } 22075d4f98a2SYan Zheng 22083fd0a558SYan, Zheng next = node; 22093fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 22103fd0a558SYan, Zheng while (1) { 22113fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 22123fd0a558SYan, Zheng if (--index < 0) 22133fd0a558SYan, Zheng break; 22143fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 22153fd0a558SYan, Zheng } 22165d4f98a2SYan Zheng return root; 22175d4f98a2SYan Zheng } 22185d4f98a2SYan Zheng 22193fd0a558SYan, Zheng /* 222092a7cc42SQu Wenruo * Select a tree root for relocation. 222192a7cc42SQu Wenruo * 222292a7cc42SQu Wenruo * Return NULL if the block is not shareable. We should use do_relocation() in 222392a7cc42SQu Wenruo * this case. 222492a7cc42SQu Wenruo * 222592a7cc42SQu Wenruo * Return a tree root pointer if the block is shareable. 222692a7cc42SQu Wenruo * Return -ENOENT if the block is root of reloc tree. 22273fd0a558SYan, Zheng */ 22285d4f98a2SYan Zheng static noinline_for_stack 2229a26195a5SQu Wenruo struct btrfs_root *select_one_root(struct btrfs_backref_node *node) 22305d4f98a2SYan Zheng { 2231a26195a5SQu Wenruo struct btrfs_backref_node *next; 22323fd0a558SYan, Zheng struct btrfs_root *root; 22333fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 2234a26195a5SQu Wenruo struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 22353fd0a558SYan, Zheng int index = 0; 22363fd0a558SYan, Zheng 22373fd0a558SYan, Zheng next = node; 22383fd0a558SYan, Zheng while (1) { 22393fd0a558SYan, Zheng cond_resched(); 22403fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 22413fd0a558SYan, Zheng root = next->root; 22428717cf44SJosef Bacik 22438717cf44SJosef Bacik /* 22448717cf44SJosef Bacik * This can occur if we have incomplete extent refs leading all 22458717cf44SJosef Bacik * the way up a particular path, in this case return -EUCLEAN. 22468717cf44SJosef Bacik */ 22478717cf44SJosef Bacik if (!root) 22488717cf44SJosef Bacik return ERR_PTR(-EUCLEAN); 22493fd0a558SYan, Zheng 225092a7cc42SQu Wenruo /* No other choice for non-shareable tree */ 225192a7cc42SQu Wenruo if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) 22523fd0a558SYan, Zheng return root; 22533fd0a558SYan, Zheng 22543fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 22553fd0a558SYan, Zheng fs_root = root; 22563fd0a558SYan, Zheng 22573fd0a558SYan, Zheng if (next != node) 22583fd0a558SYan, Zheng return NULL; 22593fd0a558SYan, Zheng 22603fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 22613fd0a558SYan, Zheng if (!next || next->level <= node->level) 22623fd0a558SYan, Zheng break; 22633fd0a558SYan, Zheng } 22643fd0a558SYan, Zheng 22653fd0a558SYan, Zheng if (!fs_root) 22663fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 22673fd0a558SYan, Zheng return fs_root; 22685d4f98a2SYan Zheng } 22695d4f98a2SYan Zheng 22705d4f98a2SYan Zheng static noinline_for_stack 22713fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 2272a26195a5SQu Wenruo struct btrfs_backref_node *node, int reserve) 22735d4f98a2SYan Zheng { 22740b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 2275a26195a5SQu Wenruo struct btrfs_backref_node *next = node; 2276a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 2277a26195a5SQu Wenruo struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 22783fd0a558SYan, Zheng u64 num_bytes = 0; 22793fd0a558SYan, Zheng int index = 0; 22805d4f98a2SYan Zheng 22813fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 22823fd0a558SYan, Zheng 22833fd0a558SYan, Zheng while (next) { 22843fd0a558SYan, Zheng cond_resched(); 22855d4f98a2SYan Zheng while (1) { 22863fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 22875d4f98a2SYan Zheng break; 22885d4f98a2SYan Zheng 22890b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 22903fd0a558SYan, Zheng 22913fd0a558SYan, Zheng if (list_empty(&next->upper)) 22923fd0a558SYan, Zheng break; 22933fd0a558SYan, Zheng 22943fd0a558SYan, Zheng edge = list_entry(next->upper.next, 2295a26195a5SQu Wenruo struct btrfs_backref_edge, list[LOWER]); 22963fd0a558SYan, Zheng edges[index++] = edge; 22973fd0a558SYan, Zheng next = edge->node[UPPER]; 22985d4f98a2SYan Zheng } 22993fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 23003fd0a558SYan, Zheng } 23013fd0a558SYan, Zheng return num_bytes; 23023fd0a558SYan, Zheng } 23033fd0a558SYan, Zheng 23043fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 23053fd0a558SYan, Zheng struct reloc_control *rc, 2306a26195a5SQu Wenruo struct btrfs_backref_node *node) 23073fd0a558SYan, Zheng { 23083fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2309da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 23103fd0a558SYan, Zheng u64 num_bytes; 23113fd0a558SYan, Zheng int ret; 23120647bf56SWang Shilong u64 tmp; 23133fd0a558SYan, Zheng 23143fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 23153fd0a558SYan, Zheng 23163fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 23170647bf56SWang Shilong rc->reserved_bytes += num_bytes; 23188ca17f0fSJosef Bacik 23198ca17f0fSJosef Bacik /* 23208ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 23218ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 23228ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 23238ca17f0fSJosef Bacik */ 23240647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 23258ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 23263fd0a558SYan, Zheng if (ret) { 2327da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 23280647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 23290647bf56SWang Shilong tmp <<= 1; 23300647bf56SWang Shilong /* 23310647bf56SWang Shilong * only one thread can access block_rsv at this point, 23320647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 23330647bf56SWang Shilong * we expand more reservation size here to allow enough 233452042d8eSAndrea Gelmini * space for relocation and we will return earlier in 23350647bf56SWang Shilong * enospc case. 23360647bf56SWang Shilong */ 2337da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 23380647bf56SWang Shilong RELOCATION_RESERVED_NODES; 23398ca17f0fSJosef Bacik return -EAGAIN; 23403fd0a558SYan, Zheng } 23413fd0a558SYan, Zheng 23423fd0a558SYan, Zheng return 0; 23433fd0a558SYan, Zheng } 23443fd0a558SYan, Zheng 23455d4f98a2SYan Zheng /* 23465d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 23475d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 23485d4f98a2SYan Zheng * 23495d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 23505d4f98a2SYan Zheng * in that case this function just updates pointers. 23515d4f98a2SYan Zheng */ 23525d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 23533fd0a558SYan, Zheng struct reloc_control *rc, 2354a26195a5SQu Wenruo struct btrfs_backref_node *node, 23555d4f98a2SYan Zheng struct btrfs_key *key, 23565d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 23575d4f98a2SYan Zheng { 2358a26195a5SQu Wenruo struct btrfs_backref_node *upper; 2359a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 2360a26195a5SQu Wenruo struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 23615d4f98a2SYan Zheng struct btrfs_root *root; 23625d4f98a2SYan Zheng struct extent_buffer *eb; 23635d4f98a2SYan Zheng u32 blocksize; 23645d4f98a2SYan Zheng u64 bytenr; 23655d4f98a2SYan Zheng int slot; 23668df01fddSNikolay Borisov int ret = 0; 23675d4f98a2SYan Zheng 2368ffe30dd8SJosef Bacik /* 2369ffe30dd8SJosef Bacik * If we are lowest then this is the first time we're processing this 2370ffe30dd8SJosef Bacik * block, and thus shouldn't have an eb associated with it yet. 2371ffe30dd8SJosef Bacik */ 2372ffe30dd8SJosef Bacik ASSERT(!lowest || !node->eb); 23735d4f98a2SYan Zheng 23745d4f98a2SYan Zheng path->lowest_level = node->level + 1; 23753fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 23765d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 237782fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 2378581c1760SQu Wenruo 23795d4f98a2SYan Zheng cond_resched(); 23805d4f98a2SYan Zheng 23815d4f98a2SYan Zheng upper = edge->node[UPPER]; 2382dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 2383cbdc2ebcSJosef Bacik if (IS_ERR(root)) { 2384cbdc2ebcSJosef Bacik ret = PTR_ERR(root); 2385cbdc2ebcSJosef Bacik goto next; 2386cbdc2ebcSJosef Bacik } 23875d4f98a2SYan Zheng 23883fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 23893fd0a558SYan, Zheng if (!lowest) { 2390e3b83361SQu Wenruo ret = btrfs_bin_search(upper->eb, key, &slot); 23918df01fddSNikolay Borisov if (ret < 0) 2392cbca7d59SFilipe Manana goto next; 23933fd0a558SYan, Zheng BUG_ON(ret); 23943fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 23953fd0a558SYan, Zheng if (node->eb->start == bytenr) 23963fd0a558SYan, Zheng goto next; 23973fd0a558SYan, Zheng } 2398b0fe7078SQu Wenruo btrfs_backref_drop_node_buffer(upper); 23993fd0a558SYan, Zheng } 24005d4f98a2SYan Zheng 24015d4f98a2SYan Zheng if (!upper->eb) { 24025d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 24033561b9dbSLiu Bo if (ret) { 24048df01fddSNikolay Borisov if (ret > 0) 24058df01fddSNikolay Borisov ret = -ENOENT; 24063561b9dbSLiu Bo 24073561b9dbSLiu Bo btrfs_release_path(path); 24085d4f98a2SYan Zheng break; 24095d4f98a2SYan Zheng } 24105d4f98a2SYan Zheng 24113fd0a558SYan, Zheng if (!upper->eb) { 24123fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 24133fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 24143fd0a558SYan, Zheng } else { 24153fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 24163fd0a558SYan, Zheng } 24173fd0a558SYan, Zheng 24183fd0a558SYan, Zheng upper->locked = 1; 24193fd0a558SYan, Zheng path->locks[upper->level] = 0; 24203fd0a558SYan, Zheng 24215d4f98a2SYan Zheng slot = path->slots[upper->level]; 2422b3b4aa74SDavid Sterba btrfs_release_path(path); 24235d4f98a2SYan Zheng } else { 2424e3b83361SQu Wenruo ret = btrfs_bin_search(upper->eb, key, &slot); 24258df01fddSNikolay Borisov if (ret < 0) 2426cbca7d59SFilipe Manana goto next; 24275d4f98a2SYan Zheng BUG_ON(ret); 24285d4f98a2SYan Zheng } 24295d4f98a2SYan Zheng 24305d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 24313fd0a558SYan, Zheng if (lowest) { 24324547f4d8SLiu Bo if (bytenr != node->bytenr) { 24334547f4d8SLiu Bo btrfs_err(root->fs_info, 24344547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 24354547f4d8SLiu Bo bytenr, node->bytenr, slot, 24364547f4d8SLiu Bo upper->eb->start); 24378df01fddSNikolay Borisov ret = -EIO; 24384547f4d8SLiu Bo goto next; 24394547f4d8SLiu Bo } 24405d4f98a2SYan Zheng } else { 24413fd0a558SYan, Zheng if (node->eb->start == bytenr) 24423fd0a558SYan, Zheng goto next; 24435d4f98a2SYan Zheng } 24445d4f98a2SYan Zheng 2445da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 2446c9752536SJosef Bacik eb = btrfs_read_node_slot(upper->eb, slot); 244764c043deSLiu Bo if (IS_ERR(eb)) { 24488df01fddSNikolay Borisov ret = PTR_ERR(eb); 244964c043deSLiu Bo goto next; 245097d9a8a4STsutomu Itoh } 24515d4f98a2SYan Zheng btrfs_tree_lock(eb); 24525d4f98a2SYan Zheng 24535d4f98a2SYan Zheng if (!node->eb) { 24545d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 24559631e4ccSJosef Bacik slot, &eb, BTRFS_NESTING_COW); 24563fd0a558SYan, Zheng btrfs_tree_unlock(eb); 24573fd0a558SYan, Zheng free_extent_buffer(eb); 24588df01fddSNikolay Borisov if (ret < 0) 24593fd0a558SYan, Zheng goto next; 2460ffe30dd8SJosef Bacik /* 2461ffe30dd8SJosef Bacik * We've just COWed this block, it should have updated 2462ffe30dd8SJosef Bacik * the correct backref node entry. 2463ffe30dd8SJosef Bacik */ 2464ffe30dd8SJosef Bacik ASSERT(node->eb == eb); 24655d4f98a2SYan Zheng } else { 24665d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 24675d4f98a2SYan Zheng node->eb->start); 24685d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 24695d4f98a2SYan Zheng trans->transid); 24705d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 24715d4f98a2SYan Zheng 247282fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, 24735d4f98a2SYan Zheng node->eb->start, blocksize, 247482fa113fSQu Wenruo upper->eb->start); 247582fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 247682fa113fSQu Wenruo btrfs_init_tree_ref(&ref, node->level, 247782fa113fSQu Wenruo btrfs_header_owner(upper->eb)); 247882fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 2479eb6b7fb4SJosef Bacik if (!ret) 2480eb6b7fb4SJosef Bacik ret = btrfs_drop_subtree(trans, root, eb, 2481eb6b7fb4SJosef Bacik upper->eb); 2482eb6b7fb4SJosef Bacik if (ret) 2483eb6b7fb4SJosef Bacik btrfs_abort_transaction(trans, ret); 24845d4f98a2SYan Zheng } 24853fd0a558SYan, Zheng next: 24863fd0a558SYan, Zheng if (!upper->pending) 2487b0fe7078SQu Wenruo btrfs_backref_drop_node_buffer(upper); 24883fd0a558SYan, Zheng else 2489b0fe7078SQu Wenruo btrfs_backref_unlock_node_buffer(upper); 24908df01fddSNikolay Borisov if (ret) 24913fd0a558SYan, Zheng break; 24925d4f98a2SYan Zheng } 24933fd0a558SYan, Zheng 24948df01fddSNikolay Borisov if (!ret && node->pending) { 2495b0fe7078SQu Wenruo btrfs_backref_drop_node_buffer(node); 24963fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 24973fd0a558SYan, Zheng node->pending = 0; 24985d4f98a2SYan Zheng } 24993fd0a558SYan, Zheng 25005d4f98a2SYan Zheng path->lowest_level = 0; 2501ffe30dd8SJosef Bacik 2502ffe30dd8SJosef Bacik /* 2503ffe30dd8SJosef Bacik * We should have allocated all of our space in the block rsv and thus 2504ffe30dd8SJosef Bacik * shouldn't ENOSPC. 2505ffe30dd8SJosef Bacik */ 2506ffe30dd8SJosef Bacik ASSERT(ret != -ENOSPC); 25078df01fddSNikolay Borisov return ret; 25085d4f98a2SYan Zheng } 25095d4f98a2SYan Zheng 25105d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 25113fd0a558SYan, Zheng struct reloc_control *rc, 2512a26195a5SQu Wenruo struct btrfs_backref_node *node, 25135d4f98a2SYan Zheng struct btrfs_path *path) 25145d4f98a2SYan Zheng { 25155d4f98a2SYan Zheng struct btrfs_key key; 25165d4f98a2SYan Zheng 25175d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 25183fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 25195d4f98a2SYan Zheng } 25205d4f98a2SYan Zheng 25215d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 25223fd0a558SYan, Zheng struct reloc_control *rc, 25233fd0a558SYan, Zheng struct btrfs_path *path, int err) 25245d4f98a2SYan Zheng { 25253fd0a558SYan, Zheng LIST_HEAD(list); 2526a26195a5SQu Wenruo struct btrfs_backref_cache *cache = &rc->backref_cache; 2527a26195a5SQu Wenruo struct btrfs_backref_node *node; 25285d4f98a2SYan Zheng int level; 25295d4f98a2SYan Zheng int ret; 25305d4f98a2SYan Zheng 25315d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 25325d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 25335d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 2534a26195a5SQu Wenruo struct btrfs_backref_node, list); 25353fd0a558SYan, Zheng list_move_tail(&node->list, &list); 25363fd0a558SYan, Zheng BUG_ON(!node->pending); 25375d4f98a2SYan Zheng 25383fd0a558SYan, Zheng if (!err) { 25393fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 25405d4f98a2SYan Zheng if (ret < 0) 25415d4f98a2SYan Zheng err = ret; 25425d4f98a2SYan Zheng } 25435d4f98a2SYan Zheng } 25443fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 25453fd0a558SYan, Zheng } 25465d4f98a2SYan Zheng return err; 25475d4f98a2SYan Zheng } 25485d4f98a2SYan Zheng 25495d4f98a2SYan Zheng /* 25505d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 25515d4f98a2SYan Zheng * as processed. 25525d4f98a2SYan Zheng */ 25535d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 2554a26195a5SQu Wenruo struct btrfs_backref_node *node) 25555d4f98a2SYan Zheng { 2556a26195a5SQu Wenruo struct btrfs_backref_node *next = node; 2557a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 2558a26195a5SQu Wenruo struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25595d4f98a2SYan Zheng int index = 0; 25605d4f98a2SYan Zheng 25615d4f98a2SYan Zheng while (next) { 25625d4f98a2SYan Zheng cond_resched(); 25635d4f98a2SYan Zheng while (1) { 25645d4f98a2SYan Zheng if (next->processed) 25655d4f98a2SYan Zheng break; 25665d4f98a2SYan Zheng 25679569cc20SQu Wenruo mark_block_processed(rc, next); 25685d4f98a2SYan Zheng 25695d4f98a2SYan Zheng if (list_empty(&next->upper)) 25705d4f98a2SYan Zheng break; 25715d4f98a2SYan Zheng 25725d4f98a2SYan Zheng edge = list_entry(next->upper.next, 2573a26195a5SQu Wenruo struct btrfs_backref_edge, list[LOWER]); 25745d4f98a2SYan Zheng edges[index++] = edge; 25755d4f98a2SYan Zheng next = edge->node[UPPER]; 25765d4f98a2SYan Zheng } 25775d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 25785d4f98a2SYan Zheng } 25795d4f98a2SYan Zheng } 25805d4f98a2SYan Zheng 25817476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 25825d4f98a2SYan Zheng { 2583da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 25847476dfdaSDavid Sterba 25855d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 25869655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 25875d4f98a2SYan Zheng return 1; 25885d4f98a2SYan Zheng return 0; 25895d4f98a2SYan Zheng } 25905d4f98a2SYan Zheng 25912ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 25925d4f98a2SYan Zheng struct tree_block *block) 25935d4f98a2SYan Zheng { 25945d4f98a2SYan Zheng struct extent_buffer *eb; 25955d4f98a2SYan Zheng 2596f7ba2d37SJosef Bacik eb = read_tree_block(fs_info, block->bytenr, block->owner, 2597f7ba2d37SJosef Bacik block->key.offset, block->level, NULL); 259864c043deSLiu Bo if (IS_ERR(eb)) { 259964c043deSLiu Bo return PTR_ERR(eb); 260064c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2601416bc658SJosef Bacik free_extent_buffer(eb); 2602416bc658SJosef Bacik return -EIO; 2603416bc658SJosef Bacik } 26045d4f98a2SYan Zheng if (block->level == 0) 26055d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 26065d4f98a2SYan Zheng else 26075d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 26085d4f98a2SYan Zheng free_extent_buffer(eb); 26095d4f98a2SYan Zheng block->key_ready = 1; 26105d4f98a2SYan Zheng return 0; 26115d4f98a2SYan Zheng } 26125d4f98a2SYan Zheng 26135d4f98a2SYan Zheng /* 26145d4f98a2SYan Zheng * helper function to relocate a tree block 26155d4f98a2SYan Zheng */ 26165d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 26175d4f98a2SYan Zheng struct reloc_control *rc, 2618a26195a5SQu Wenruo struct btrfs_backref_node *node, 26195d4f98a2SYan Zheng struct btrfs_key *key, 26205d4f98a2SYan Zheng struct btrfs_path *path) 26215d4f98a2SYan Zheng { 26225d4f98a2SYan Zheng struct btrfs_root *root; 26233fd0a558SYan, Zheng int ret = 0; 26245d4f98a2SYan Zheng 26253fd0a558SYan, Zheng if (!node) 26265d4f98a2SYan Zheng return 0; 26273fd0a558SYan, Zheng 26285f6b2e5cSJosef Bacik /* 26295f6b2e5cSJosef Bacik * If we fail here we want to drop our backref_node because we are going 26305f6b2e5cSJosef Bacik * to start over and regenerate the tree for it. 26315f6b2e5cSJosef Bacik */ 26325f6b2e5cSJosef Bacik ret = reserve_metadata_space(trans, rc, node); 26335f6b2e5cSJosef Bacik if (ret) 26345f6b2e5cSJosef Bacik goto out; 26355f6b2e5cSJosef Bacik 26363fd0a558SYan, Zheng BUG_ON(node->processed); 2637147d256eSZhaolei root = select_one_root(node); 26388717cf44SJosef Bacik if (IS_ERR(root)) { 26398717cf44SJosef Bacik ret = PTR_ERR(root); 26408717cf44SJosef Bacik 26418717cf44SJosef Bacik /* See explanation in select_one_root for the -EUCLEAN case. */ 26428717cf44SJosef Bacik ASSERT(ret == -ENOENT); 26438717cf44SJosef Bacik if (ret == -ENOENT) { 26448717cf44SJosef Bacik ret = 0; 26453fd0a558SYan, Zheng update_processed_blocks(rc, node); 26468717cf44SJosef Bacik } 26473fd0a558SYan, Zheng goto out; 26485d4f98a2SYan Zheng } 26495d4f98a2SYan Zheng 26503fd0a558SYan, Zheng if (root) { 265192a7cc42SQu Wenruo if (test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) { 26521c7bfa15SJosef Bacik /* 26531c7bfa15SJosef Bacik * This block was the root block of a root, and this is 26541c7bfa15SJosef Bacik * the first time we're processing the block and thus it 26551c7bfa15SJosef Bacik * should not have had the ->new_bytenr modified and 26561c7bfa15SJosef Bacik * should have not been included on the changed list. 26571c7bfa15SJosef Bacik * 26581c7bfa15SJosef Bacik * However in the case of corruption we could have 26591c7bfa15SJosef Bacik * multiple refs pointing to the same block improperly, 26601c7bfa15SJosef Bacik * and thus we would trip over these checks. ASSERT() 26611c7bfa15SJosef Bacik * for the developer case, because it could indicate a 26621c7bfa15SJosef Bacik * bug in the backref code, however error out for a 26631c7bfa15SJosef Bacik * normal user in the case of corruption. 26641c7bfa15SJosef Bacik */ 26651c7bfa15SJosef Bacik ASSERT(node->new_bytenr == 0); 26661c7bfa15SJosef Bacik ASSERT(list_empty(&node->list)); 26671c7bfa15SJosef Bacik if (node->new_bytenr || !list_empty(&node->list)) { 26681c7bfa15SJosef Bacik btrfs_err(root->fs_info, 26691c7bfa15SJosef Bacik "bytenr %llu has improper references to it", 26701c7bfa15SJosef Bacik node->bytenr); 26711c7bfa15SJosef Bacik ret = -EUCLEAN; 26721c7bfa15SJosef Bacik goto out; 26731c7bfa15SJosef Bacik } 2674d18c7bd9SJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 2675d18c7bd9SJosef Bacik if (ret) 2676d18c7bd9SJosef Bacik goto out; 267739200e59SJosef Bacik /* 267839200e59SJosef Bacik * Another thread could have failed, need to check if we 267939200e59SJosef Bacik * have reloc_root actually set. 268039200e59SJosef Bacik */ 268139200e59SJosef Bacik if (!root->reloc_root) { 268239200e59SJosef Bacik ret = -ENOENT; 268339200e59SJosef Bacik goto out; 268439200e59SJosef Bacik } 26853fd0a558SYan, Zheng root = root->reloc_root; 26863fd0a558SYan, Zheng node->new_bytenr = root->node->start; 268700246528SJosef Bacik btrfs_put_root(node->root); 268800246528SJosef Bacik node->root = btrfs_grab_root(root); 26890b530bc5SJosef Bacik ASSERT(node->root); 26903fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 26913fd0a558SYan, Zheng } else { 26925d4f98a2SYan Zheng path->lowest_level = node->level; 26935d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 2694b3b4aa74SDavid Sterba btrfs_release_path(path); 26953fd0a558SYan, Zheng if (ret > 0) 26965d4f98a2SYan Zheng ret = 0; 26973fd0a558SYan, Zheng } 26983fd0a558SYan, Zheng if (!ret) 26993fd0a558SYan, Zheng update_processed_blocks(rc, node); 27003fd0a558SYan, Zheng } else { 27013fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 27023fd0a558SYan, Zheng } 27035d4f98a2SYan Zheng out: 27040647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 2705023acb07SQu Wenruo btrfs_backref_cleanup_node(&rc->backref_cache, node); 27065d4f98a2SYan Zheng return ret; 27075d4f98a2SYan Zheng } 27085d4f98a2SYan Zheng 27095d4f98a2SYan Zheng /* 27105d4f98a2SYan Zheng * relocate a list of blocks 27115d4f98a2SYan Zheng */ 27125d4f98a2SYan Zheng static noinline_for_stack 27135d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 27145d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 27155d4f98a2SYan Zheng { 27162ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 2717a26195a5SQu Wenruo struct btrfs_backref_node *node; 27185d4f98a2SYan Zheng struct btrfs_path *path; 27195d4f98a2SYan Zheng struct tree_block *block; 272098ff7b94SQu Wenruo struct tree_block *next; 27215d4f98a2SYan Zheng int ret; 27225d4f98a2SYan Zheng int err = 0; 27235d4f98a2SYan Zheng 27245d4f98a2SYan Zheng path = btrfs_alloc_path(); 2725e1a12670SLiu Bo if (!path) { 2726e1a12670SLiu Bo err = -ENOMEM; 272734c2b290SDavid Sterba goto out_free_blocks; 2728e1a12670SLiu Bo } 27295d4f98a2SYan Zheng 273098ff7b94SQu Wenruo /* Kick in readahead for tree blocks with missing keys */ 273198ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 27325d4f98a2SYan Zheng if (!block->key_ready) 2733f7ba2d37SJosef Bacik btrfs_readahead_tree_block(fs_info, block->bytenr, 2734f7ba2d37SJosef Bacik block->owner, 0, 27353fbaf258SJosef Bacik block->level); 27365d4f98a2SYan Zheng } 27375d4f98a2SYan Zheng 273898ff7b94SQu Wenruo /* Get first keys */ 273998ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 274034c2b290SDavid Sterba if (!block->key_ready) { 27412ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 274234c2b290SDavid Sterba if (err) 274334c2b290SDavid Sterba goto out_free_path; 274434c2b290SDavid Sterba } 27455d4f98a2SYan Zheng } 27465d4f98a2SYan Zheng 274798ff7b94SQu Wenruo /* Do tree relocation */ 274898ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 27493fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 27505d4f98a2SYan Zheng block->level, block->bytenr); 27515d4f98a2SYan Zheng if (IS_ERR(node)) { 27525d4f98a2SYan Zheng err = PTR_ERR(node); 27535d4f98a2SYan Zheng goto out; 27545d4f98a2SYan Zheng } 27555d4f98a2SYan Zheng 27565d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 27575d4f98a2SYan Zheng path); 27585d4f98a2SYan Zheng if (ret < 0) { 27595d4f98a2SYan Zheng err = ret; 276050dbbb71SJosef Bacik break; 27615d4f98a2SYan Zheng } 27625d4f98a2SYan Zheng } 27635d4f98a2SYan Zheng out: 27643fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 27655d4f98a2SYan Zheng 276634c2b290SDavid Sterba out_free_path: 27675d4f98a2SYan Zheng btrfs_free_path(path); 276834c2b290SDavid Sterba out_free_blocks: 2769e1a12670SLiu Bo free_block_list(blocks); 27705d4f98a2SYan Zheng return err; 27715d4f98a2SYan Zheng } 27725d4f98a2SYan Zheng 2773056d9becSNikolay Borisov static noinline_for_stack int prealloc_file_extent_cluster( 2774056d9becSNikolay Borisov struct btrfs_inode *inode, 2775efa56464SYan, Zheng struct file_extent_cluster *cluster) 2776efa56464SYan, Zheng { 2777efa56464SYan, Zheng u64 alloc_hint = 0; 2778efa56464SYan, Zheng u64 start; 2779efa56464SYan, Zheng u64 end; 2780056d9becSNikolay Borisov u64 offset = inode->index_cnt; 2781efa56464SYan, Zheng u64 num_bytes; 27824e9d0d01SNikolay Borisov int nr; 2783efa56464SYan, Zheng int ret = 0; 2784dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 2785dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 2786214e61d0SNikolay Borisov u64 cur_offset = prealloc_start; 2787efa56464SYan, Zheng 2788efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 2789056d9becSNikolay Borisov ret = btrfs_alloc_data_chunk_ondemand(inode, 2790dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 2791efa56464SYan, Zheng if (ret) 2792214e61d0SNikolay Borisov return ret; 2793efa56464SYan, Zheng 279432430c61SNaohiro Aota /* 279532430c61SNaohiro Aota * On a zoned filesystem, we cannot preallocate the file region. 279632430c61SNaohiro Aota * Instead, we dirty and fiemap_write the region. 279732430c61SNaohiro Aota */ 279832430c61SNaohiro Aota if (btrfs_is_zoned(inode->root->fs_info)) { 279932430c61SNaohiro Aota struct btrfs_root *root = inode->root; 280032430c61SNaohiro Aota struct btrfs_trans_handle *trans; 280132430c61SNaohiro Aota 280232430c61SNaohiro Aota end = cluster->end - offset + 1; 280332430c61SNaohiro Aota trans = btrfs_start_transaction(root, 1); 280432430c61SNaohiro Aota if (IS_ERR(trans)) 280532430c61SNaohiro Aota return PTR_ERR(trans); 280632430c61SNaohiro Aota 280732430c61SNaohiro Aota inode->vfs_inode.i_ctime = current_time(&inode->vfs_inode); 280832430c61SNaohiro Aota i_size_write(&inode->vfs_inode, end); 280932430c61SNaohiro Aota ret = btrfs_update_inode(trans, root, inode); 281032430c61SNaohiro Aota if (ret) { 281132430c61SNaohiro Aota btrfs_abort_transaction(trans, ret); 281232430c61SNaohiro Aota btrfs_end_transaction(trans); 281332430c61SNaohiro Aota return ret; 281432430c61SNaohiro Aota } 281532430c61SNaohiro Aota 281632430c61SNaohiro Aota return btrfs_end_transaction(trans); 281732430c61SNaohiro Aota } 281832430c61SNaohiro Aota 281964708539SJosef Bacik btrfs_inode_lock(&inode->vfs_inode, 0); 28204e9d0d01SNikolay Borisov for (nr = 0; nr < cluster->nr; nr++) { 2821efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 2822efa56464SYan, Zheng if (nr + 1 < cluster->nr) 2823efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 2824efa56464SYan, Zheng else 2825efa56464SYan, Zheng end = cluster->end - offset; 2826efa56464SYan, Zheng 2827056d9becSNikolay Borisov lock_extent(&inode->io_tree, start, end); 2828efa56464SYan, Zheng num_bytes = end + 1 - start; 2829056d9becSNikolay Borisov ret = btrfs_prealloc_file_range(&inode->vfs_inode, 0, start, 2830efa56464SYan, Zheng num_bytes, num_bytes, 2831efa56464SYan, Zheng end + 1, &alloc_hint); 283218513091SWang Xiaoguang cur_offset = end + 1; 2833056d9becSNikolay Borisov unlock_extent(&inode->io_tree, start, end); 2834efa56464SYan, Zheng if (ret) 2835efa56464SYan, Zheng break; 2836efa56464SYan, Zheng } 283764708539SJosef Bacik btrfs_inode_unlock(&inode->vfs_inode, 0); 2838214e61d0SNikolay Borisov 283918513091SWang Xiaoguang if (cur_offset < prealloc_end) 2840056d9becSNikolay Borisov btrfs_free_reserved_data_space_noquota(inode->root->fs_info, 2841a89ef455SFilipe Manana prealloc_end + 1 - cur_offset); 2842efa56464SYan, Zheng return ret; 2843efa56464SYan, Zheng } 2844efa56464SYan, Zheng 2845efa56464SYan, Zheng static noinline_for_stack 28460257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 28470257bb82SYan, Zheng u64 block_start) 28485d4f98a2SYan Zheng { 28495d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 28505d4f98a2SYan Zheng struct extent_map *em; 28510257bb82SYan, Zheng int ret = 0; 28525d4f98a2SYan Zheng 2853172ddd60SDavid Sterba em = alloc_extent_map(); 28540257bb82SYan, Zheng if (!em) 28550257bb82SYan, Zheng return -ENOMEM; 28560257bb82SYan, Zheng 28575d4f98a2SYan Zheng em->start = start; 28580257bb82SYan, Zheng em->len = end + 1 - start; 28590257bb82SYan, Zheng em->block_len = em->len; 28600257bb82SYan, Zheng em->block_start = block_start; 28615d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 28625d4f98a2SYan Zheng 2863d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 28645d4f98a2SYan Zheng while (1) { 2865890871beSChris Mason write_lock(&em_tree->lock); 286609a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 2867890871beSChris Mason write_unlock(&em_tree->lock); 28685d4f98a2SYan Zheng if (ret != -EEXIST) { 28695d4f98a2SYan Zheng free_extent_map(em); 28705d4f98a2SYan Zheng break; 28715d4f98a2SYan Zheng } 2872dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 28735d4f98a2SYan Zheng } 2874d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 28750257bb82SYan, Zheng return ret; 28760257bb82SYan, Zheng } 28775d4f98a2SYan Zheng 2878726a3421SQu Wenruo /* 2879*907d2710SDavid Sterba * Allow error injection to test balance/relocation cancellation 2880726a3421SQu Wenruo */ 28811fec12a5SJosef Bacik noinline int btrfs_should_cancel_balance(struct btrfs_fs_info *fs_info) 2882726a3421SQu Wenruo { 28835cb502f4SQu Wenruo return atomic_read(&fs_info->balance_cancel_req) || 2884*907d2710SDavid Sterba atomic_read(&fs_info->reloc_cancel_req) || 28855cb502f4SQu Wenruo fatal_signal_pending(current); 2886726a3421SQu Wenruo } 2887726a3421SQu Wenruo ALLOW_ERROR_INJECTION(btrfs_should_cancel_balance, TRUE); 2888726a3421SQu Wenruo 28890257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 28900257bb82SYan, Zheng struct file_extent_cluster *cluster) 28910257bb82SYan, Zheng { 28922ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 28930257bb82SYan, Zheng u64 page_start; 28940257bb82SYan, Zheng u64 page_end; 28950257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 28960257bb82SYan, Zheng unsigned long index; 28970257bb82SYan, Zheng unsigned long last_index; 28980257bb82SYan, Zheng struct page *page; 28990257bb82SYan, Zheng struct file_ra_state *ra; 29003b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 29010257bb82SYan, Zheng int nr = 0; 29020257bb82SYan, Zheng int ret = 0; 29030257bb82SYan, Zheng 29040257bb82SYan, Zheng if (!cluster->nr) 29050257bb82SYan, Zheng return 0; 29060257bb82SYan, Zheng 29070257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 29080257bb82SYan, Zheng if (!ra) 29090257bb82SYan, Zheng return -ENOMEM; 29100257bb82SYan, Zheng 2911056d9becSNikolay Borisov ret = prealloc_file_extent_cluster(BTRFS_I(inode), cluster); 29120257bb82SYan, Zheng if (ret) 2913efa56464SYan, Zheng goto out; 29140257bb82SYan, Zheng 29150257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 29160257bb82SYan, Zheng 2917efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 2918efa56464SYan, Zheng cluster->end - offset, cluster->start); 2919efa56464SYan, Zheng if (ret) 2920efa56464SYan, Zheng goto out; 2921efa56464SYan, Zheng 292209cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 292309cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 29240257bb82SYan, Zheng while (index <= last_index) { 29259f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 29269f3db423SNikolay Borisov PAGE_SIZE); 2927efa56464SYan, Zheng if (ret) 2928efa56464SYan, Zheng goto out; 2929efa56464SYan, Zheng 29300257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 29310257bb82SYan, Zheng if (!page) { 29320257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 29330257bb82SYan, Zheng ra, NULL, index, 29340257bb82SYan, Zheng last_index + 1 - index); 2935a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 29363b16a4e3SJosef Bacik mask); 29370257bb82SYan, Zheng if (!page) { 2938691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 293943b18595SQu Wenruo PAGE_SIZE, true); 294044db1216SFilipe Manana btrfs_delalloc_release_extents(BTRFS_I(inode), 29418702ba93SQu Wenruo PAGE_SIZE); 29420257bb82SYan, Zheng ret = -ENOMEM; 2943efa56464SYan, Zheng goto out; 29440257bb82SYan, Zheng } 29450257bb82SYan, Zheng } 294632443de3SQu Wenruo ret = set_page_extent_mapped(page); 294732443de3SQu Wenruo if (ret < 0) { 294832443de3SQu Wenruo btrfs_delalloc_release_metadata(BTRFS_I(inode), 294932443de3SQu Wenruo PAGE_SIZE, true); 295032443de3SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); 295132443de3SQu Wenruo unlock_page(page); 295232443de3SQu Wenruo put_page(page); 295332443de3SQu Wenruo goto out; 295432443de3SQu Wenruo } 29550257bb82SYan, Zheng 29560257bb82SYan, Zheng if (PageReadahead(page)) { 29570257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 29580257bb82SYan, Zheng ra, NULL, page, index, 29590257bb82SYan, Zheng last_index + 1 - index); 29600257bb82SYan, Zheng } 29610257bb82SYan, Zheng 29620257bb82SYan, Zheng if (!PageUptodate(page)) { 29630257bb82SYan, Zheng btrfs_readpage(NULL, page); 29640257bb82SYan, Zheng lock_page(page); 29650257bb82SYan, Zheng if (!PageUptodate(page)) { 29660257bb82SYan, Zheng unlock_page(page); 296709cbfeafSKirill A. Shutemov put_page(page); 2968691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 296943b18595SQu Wenruo PAGE_SIZE, true); 29708b62f87bSJosef Bacik btrfs_delalloc_release_extents(BTRFS_I(inode), 29718702ba93SQu Wenruo PAGE_SIZE); 29720257bb82SYan, Zheng ret = -EIO; 2973efa56464SYan, Zheng goto out; 29740257bb82SYan, Zheng } 29750257bb82SYan, Zheng } 29760257bb82SYan, Zheng 29774eee4fa4SMiao Xie page_start = page_offset(page); 297809cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 29790257bb82SYan, Zheng 2980d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 29810257bb82SYan, Zheng 29820257bb82SYan, Zheng if (nr < cluster->nr && 29830257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 29840257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 29850257bb82SYan, Zheng page_start, page_end, 2986ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 29870257bb82SYan, Zheng nr++; 29880257bb82SYan, Zheng } 29890257bb82SYan, Zheng 2990c2566f22SNikolay Borisov ret = btrfs_set_extent_delalloc(BTRFS_I(inode), page_start, 2991c2566f22SNikolay Borisov page_end, 0, NULL); 2992765f3cebSNikolay Borisov if (ret) { 2993765f3cebSNikolay Borisov unlock_page(page); 2994765f3cebSNikolay Borisov put_page(page); 2995765f3cebSNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 299643b18595SQu Wenruo PAGE_SIZE, true); 2997765f3cebSNikolay Borisov btrfs_delalloc_release_extents(BTRFS_I(inode), 29988702ba93SQu Wenruo PAGE_SIZE); 2999765f3cebSNikolay Borisov 3000765f3cebSNikolay Borisov clear_extent_bits(&BTRFS_I(inode)->io_tree, 3001765f3cebSNikolay Borisov page_start, page_end, 3002765f3cebSNikolay Borisov EXTENT_LOCKED | EXTENT_BOUNDARY); 3003765f3cebSNikolay Borisov goto out; 3004765f3cebSNikolay Borisov 3005765f3cebSNikolay Borisov } 30060257bb82SYan, Zheng set_page_dirty(page); 30070257bb82SYan, Zheng 30080257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3009d0082371SJeff Mahoney page_start, page_end); 30100257bb82SYan, Zheng unlock_page(page); 301109cbfeafSKirill A. Shutemov put_page(page); 30120257bb82SYan, Zheng 30130257bb82SYan, Zheng index++; 30148702ba93SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); 3015efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 30162ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 30177f913c7cSQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 30187f913c7cSQu Wenruo ret = -ECANCELED; 30197f913c7cSQu Wenruo goto out; 30207f913c7cSQu Wenruo } 30210257bb82SYan, Zheng } 30220257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 302332430c61SNaohiro Aota if (btrfs_is_zoned(fs_info) && !ret) 302432430c61SNaohiro Aota ret = btrfs_wait_ordered_range(inode, 0, (u64)-1); 3025efa56464SYan, Zheng out: 30260257bb82SYan, Zheng kfree(ra); 30270257bb82SYan, Zheng return ret; 30280257bb82SYan, Zheng } 30290257bb82SYan, Zheng 30300257bb82SYan, Zheng static noinline_for_stack 30310257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 30320257bb82SYan, Zheng struct file_extent_cluster *cluster) 30330257bb82SYan, Zheng { 30340257bb82SYan, Zheng int ret; 30350257bb82SYan, Zheng 30360257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 30370257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 30380257bb82SYan, Zheng if (ret) 30390257bb82SYan, Zheng return ret; 30400257bb82SYan, Zheng cluster->nr = 0; 30410257bb82SYan, Zheng } 30420257bb82SYan, Zheng 30430257bb82SYan, Zheng if (!cluster->nr) 30440257bb82SYan, Zheng cluster->start = extent_key->objectid; 30450257bb82SYan, Zheng else 30460257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 30470257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 30480257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 30490257bb82SYan, Zheng cluster->nr++; 30500257bb82SYan, Zheng 30510257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 30520257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 30530257bb82SYan, Zheng if (ret) 30540257bb82SYan, Zheng return ret; 30550257bb82SYan, Zheng cluster->nr = 0; 30560257bb82SYan, Zheng } 30570257bb82SYan, Zheng return 0; 30585d4f98a2SYan Zheng } 30595d4f98a2SYan Zheng 30605d4f98a2SYan Zheng /* 30615d4f98a2SYan Zheng * helper to add a tree block to the list. 30625d4f98a2SYan Zheng * the major work is getting the generation and level of the block 30635d4f98a2SYan Zheng */ 30645d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 30655d4f98a2SYan Zheng struct btrfs_key *extent_key, 30665d4f98a2SYan Zheng struct btrfs_path *path, 30675d4f98a2SYan Zheng struct rb_root *blocks) 30685d4f98a2SYan Zheng { 30695d4f98a2SYan Zheng struct extent_buffer *eb; 30705d4f98a2SYan Zheng struct btrfs_extent_item *ei; 30715d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 30725d4f98a2SYan Zheng struct tree_block *block; 30735d4f98a2SYan Zheng struct rb_node *rb_node; 30745d4f98a2SYan Zheng u32 item_size; 30755d4f98a2SYan Zheng int level = -1; 30767fdf4b60SWang Shilong u64 generation; 3077f7ba2d37SJosef Bacik u64 owner = 0; 30785d4f98a2SYan Zheng 30795d4f98a2SYan Zheng eb = path->nodes[0]; 30805d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 30815d4f98a2SYan Zheng 30823173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 30833173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 3084f7ba2d37SJosef Bacik unsigned long ptr = 0, end; 3085f7ba2d37SJosef Bacik 30865d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 30875d4f98a2SYan Zheng struct btrfs_extent_item); 3088f7ba2d37SJosef Bacik end = (unsigned long)ei + item_size; 30893173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 30905d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 30915d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 3092f7ba2d37SJosef Bacik ptr = (unsigned long)(bi + 1); 30935d4f98a2SYan Zheng } else { 30943173a18fSJosef Bacik level = (int)extent_key->offset; 3095f7ba2d37SJosef Bacik ptr = (unsigned long)(ei + 1); 30963173a18fSJosef Bacik } 30973173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 3098f7ba2d37SJosef Bacik 3099f7ba2d37SJosef Bacik /* 3100f7ba2d37SJosef Bacik * We're reading random blocks without knowing their owner ahead 3101f7ba2d37SJosef Bacik * of time. This is ok most of the time, as all reloc roots and 3102f7ba2d37SJosef Bacik * fs roots have the same lock type. However normal trees do 3103f7ba2d37SJosef Bacik * not, and the only way to know ahead of time is to read the 3104f7ba2d37SJosef Bacik * inline ref offset. We know it's an fs root if 3105f7ba2d37SJosef Bacik * 3106f7ba2d37SJosef Bacik * 1. There's more than one ref. 3107f7ba2d37SJosef Bacik * 2. There's a SHARED_DATA_REF_KEY set. 3108f7ba2d37SJosef Bacik * 3. FULL_BACKREF is set on the flags. 3109f7ba2d37SJosef Bacik * 3110f7ba2d37SJosef Bacik * Otherwise it's safe to assume that the ref offset == the 3111f7ba2d37SJosef Bacik * owner of this block, so we can use that when calling 3112f7ba2d37SJosef Bacik * read_tree_block. 3113f7ba2d37SJosef Bacik */ 3114f7ba2d37SJosef Bacik if (btrfs_extent_refs(eb, ei) == 1 && 3115f7ba2d37SJosef Bacik !(btrfs_extent_flags(eb, ei) & 3116f7ba2d37SJosef Bacik BTRFS_BLOCK_FLAG_FULL_BACKREF) && 3117f7ba2d37SJosef Bacik ptr < end) { 3118f7ba2d37SJosef Bacik struct btrfs_extent_inline_ref *iref; 3119f7ba2d37SJosef Bacik int type; 3120f7ba2d37SJosef Bacik 3121f7ba2d37SJosef Bacik iref = (struct btrfs_extent_inline_ref *)ptr; 3122f7ba2d37SJosef Bacik type = btrfs_get_extent_inline_ref_type(eb, iref, 3123f7ba2d37SJosef Bacik BTRFS_REF_TYPE_BLOCK); 3124f7ba2d37SJosef Bacik if (type == BTRFS_REF_TYPE_INVALID) 3125f7ba2d37SJosef Bacik return -EINVAL; 3126f7ba2d37SJosef Bacik if (type == BTRFS_TREE_BLOCK_REF_KEY) 3127f7ba2d37SJosef Bacik owner = btrfs_extent_inline_ref_offset(eb, iref); 3128f7ba2d37SJosef Bacik } 31296d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3130ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3131ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3132ba3c2b19SNikolay Borisov return -EINVAL; 31333173a18fSJosef Bacik } else { 31345d4f98a2SYan Zheng BUG(); 31355d4f98a2SYan Zheng } 31365d4f98a2SYan Zheng 3137b3b4aa74SDavid Sterba btrfs_release_path(path); 31385d4f98a2SYan Zheng 31395d4f98a2SYan Zheng BUG_ON(level == -1); 31405d4f98a2SYan Zheng 31415d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 31425d4f98a2SYan Zheng if (!block) 31435d4f98a2SYan Zheng return -ENOMEM; 31445d4f98a2SYan Zheng 31455d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3146da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 31475d4f98a2SYan Zheng block->key.offset = generation; 31485d4f98a2SYan Zheng block->level = level; 31495d4f98a2SYan Zheng block->key_ready = 0; 3150f7ba2d37SJosef Bacik block->owner = owner; 31515d4f98a2SYan Zheng 3152e9a28dc5SQu Wenruo rb_node = rb_simple_insert(blocks, block->bytenr, &block->rb_node); 315343c04fb1SJeff Mahoney if (rb_node) 3154982c92cbSQu Wenruo btrfs_backref_panic(rc->extent_root->fs_info, block->bytenr, 3155982c92cbSQu Wenruo -EEXIST); 31565d4f98a2SYan Zheng 31575d4f98a2SYan Zheng return 0; 31585d4f98a2SYan Zheng } 31595d4f98a2SYan Zheng 31605d4f98a2SYan Zheng /* 31615d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 31625d4f98a2SYan Zheng */ 31635d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 31645d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 31655d4f98a2SYan Zheng struct rb_root *blocks) 31665d4f98a2SYan Zheng { 31670b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 31685d4f98a2SYan Zheng struct btrfs_path *path; 31695d4f98a2SYan Zheng struct btrfs_key key; 31705d4f98a2SYan Zheng int ret; 31710b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 31725d4f98a2SYan Zheng 31737476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 31745d4f98a2SYan Zheng return 0; 31755d4f98a2SYan Zheng 3176e9a28dc5SQu Wenruo if (rb_simple_search(blocks, bytenr)) 31775d4f98a2SYan Zheng return 0; 31785d4f98a2SYan Zheng 31795d4f98a2SYan Zheng path = btrfs_alloc_path(); 31805d4f98a2SYan Zheng if (!path) 31815d4f98a2SYan Zheng return -ENOMEM; 3182aee68ee5SJosef Bacik again: 31835d4f98a2SYan Zheng key.objectid = bytenr; 3184aee68ee5SJosef Bacik if (skinny) { 3185aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3186aee68ee5SJosef Bacik key.offset = (u64)-1; 3187aee68ee5SJosef Bacik } else { 31885d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 31895d4f98a2SYan Zheng key.offset = blocksize; 3190aee68ee5SJosef Bacik } 31915d4f98a2SYan Zheng 31925d4f98a2SYan Zheng path->search_commit_root = 1; 31935d4f98a2SYan Zheng path->skip_locking = 1; 31945d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 31955d4f98a2SYan Zheng if (ret < 0) 31965d4f98a2SYan Zheng goto out; 31975d4f98a2SYan Zheng 3198aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3199aee68ee5SJosef Bacik if (path->slots[0]) { 3200aee68ee5SJosef Bacik path->slots[0]--; 3201aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3202aee68ee5SJosef Bacik path->slots[0]); 32033173a18fSJosef Bacik if (key.objectid == bytenr && 3204aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3205aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3206aee68ee5SJosef Bacik key.offset == blocksize))) 32073173a18fSJosef Bacik ret = 0; 32083173a18fSJosef Bacik } 3209aee68ee5SJosef Bacik 3210aee68ee5SJosef Bacik if (ret) { 3211aee68ee5SJosef Bacik skinny = false; 3212aee68ee5SJosef Bacik btrfs_release_path(path); 3213aee68ee5SJosef Bacik goto again; 3214aee68ee5SJosef Bacik } 3215aee68ee5SJosef Bacik } 3216cdccee99SLiu Bo if (ret) { 3217cdccee99SLiu Bo ASSERT(ret == 1); 3218cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3219cdccee99SLiu Bo btrfs_err(fs_info, 3220cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3221cdccee99SLiu Bo bytenr); 3222cdccee99SLiu Bo WARN_ON(1); 3223cdccee99SLiu Bo ret = -EINVAL; 3224cdccee99SLiu Bo goto out; 3225cdccee99SLiu Bo } 32263173a18fSJosef Bacik 32275d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 32285d4f98a2SYan Zheng out: 32295d4f98a2SYan Zheng btrfs_free_path(path); 32305d4f98a2SYan Zheng return ret; 32315d4f98a2SYan Zheng } 32325d4f98a2SYan Zheng 32330af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 323432da5386SDavid Sterba struct btrfs_block_group *block_group, 32351bbc621eSChris Mason struct inode *inode, 32361bbc621eSChris Mason u64 ino) 32370af3d00bSJosef Bacik { 32380af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 32390af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 32400af3d00bSJosef Bacik int ret = 0; 32410af3d00bSJosef Bacik 32420af3d00bSJosef Bacik if (inode) 32430af3d00bSJosef Bacik goto truncate; 32440af3d00bSJosef Bacik 32450202e83fSDavid Sterba inode = btrfs_iget(fs_info->sb, ino, root); 32462e19f1f9SAl Viro if (IS_ERR(inode)) 32470af3d00bSJosef Bacik return -ENOENT; 32480af3d00bSJosef Bacik 32490af3d00bSJosef Bacik truncate: 32502ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 32517b61cd92SMiao Xie &fs_info->global_block_rsv); 32527b61cd92SMiao Xie if (ret) 32537b61cd92SMiao Xie goto out; 32547b61cd92SMiao Xie 32557a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 32560af3d00bSJosef Bacik if (IS_ERR(trans)) { 32573612b495STsutomu Itoh ret = PTR_ERR(trans); 32580af3d00bSJosef Bacik goto out; 32590af3d00bSJosef Bacik } 32600af3d00bSJosef Bacik 326177ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 32620af3d00bSJosef Bacik 32633a45bb20SJeff Mahoney btrfs_end_transaction(trans); 32642ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 32650af3d00bSJosef Bacik out: 32660af3d00bSJosef Bacik iput(inode); 32670af3d00bSJosef Bacik return ret; 32680af3d00bSJosef Bacik } 32690af3d00bSJosef Bacik 32705d4f98a2SYan Zheng /* 327119b546d7SQu Wenruo * Locate the free space cache EXTENT_DATA in root tree leaf and delete the 327219b546d7SQu Wenruo * cache inode, to avoid free space cache data extent blocking data relocation. 32735d4f98a2SYan Zheng */ 327419b546d7SQu Wenruo static int delete_v1_space_cache(struct extent_buffer *leaf, 327519b546d7SQu Wenruo struct btrfs_block_group *block_group, 327619b546d7SQu Wenruo u64 data_bytenr) 32775d4f98a2SYan Zheng { 327819b546d7SQu Wenruo u64 space_cache_ino; 327919b546d7SQu Wenruo struct btrfs_file_extent_item *ei; 32805d4f98a2SYan Zheng struct btrfs_key key; 328119b546d7SQu Wenruo bool found = false; 328219b546d7SQu Wenruo int i; 32835d4f98a2SYan Zheng int ret; 32845d4f98a2SYan Zheng 328519b546d7SQu Wenruo if (btrfs_header_owner(leaf) != BTRFS_ROOT_TREE_OBJECTID) 328619b546d7SQu Wenruo return 0; 32875d4f98a2SYan Zheng 328819b546d7SQu Wenruo for (i = 0; i < btrfs_header_nritems(leaf); i++) { 328950e31ef4SQu Wenruo u8 type; 329050e31ef4SQu Wenruo 329119b546d7SQu Wenruo btrfs_item_key_to_cpu(leaf, &key, i); 329219b546d7SQu Wenruo if (key.type != BTRFS_EXTENT_DATA_KEY) 329319b546d7SQu Wenruo continue; 329419b546d7SQu Wenruo ei = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 329550e31ef4SQu Wenruo type = btrfs_file_extent_type(leaf, ei); 329650e31ef4SQu Wenruo 329750e31ef4SQu Wenruo if ((type == BTRFS_FILE_EXTENT_REG || 329850e31ef4SQu Wenruo type == BTRFS_FILE_EXTENT_PREALLOC) && 329919b546d7SQu Wenruo btrfs_file_extent_disk_bytenr(leaf, ei) == data_bytenr) { 330019b546d7SQu Wenruo found = true; 330119b546d7SQu Wenruo space_cache_ino = key.objectid; 330219b546d7SQu Wenruo break; 330319b546d7SQu Wenruo } 330419b546d7SQu Wenruo } 330519b546d7SQu Wenruo if (!found) 330619b546d7SQu Wenruo return -ENOENT; 330719b546d7SQu Wenruo ret = delete_block_group_cache(leaf->fs_info, block_group, NULL, 330819b546d7SQu Wenruo space_cache_ino); 33090af3d00bSJosef Bacik return ret; 33105d4f98a2SYan Zheng } 33115d4f98a2SYan Zheng 33125d4f98a2SYan Zheng /* 33132c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 33145d4f98a2SYan Zheng */ 33155d4f98a2SYan Zheng static noinline_for_stack 33165d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 33175d4f98a2SYan Zheng struct btrfs_key *extent_key, 33185d4f98a2SYan Zheng struct btrfs_path *path, 33195d4f98a2SYan Zheng struct rb_root *blocks) 33205d4f98a2SYan Zheng { 332119b546d7SQu Wenruo struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 332219b546d7SQu Wenruo struct ulist *leaves = NULL; 332319b546d7SQu Wenruo struct ulist_iterator leaf_uiter; 332419b546d7SQu Wenruo struct ulist_node *ref_node = NULL; 332519b546d7SQu Wenruo const u32 blocksize = fs_info->nodesize; 3326647f63bdSFilipe David Borba Manana int ret = 0; 33275d4f98a2SYan Zheng 3328b3b4aa74SDavid Sterba btrfs_release_path(path); 332919b546d7SQu Wenruo ret = btrfs_find_all_leafs(NULL, fs_info, extent_key->objectid, 333019b546d7SQu Wenruo 0, &leaves, NULL, true); 333119b546d7SQu Wenruo if (ret < 0) 333219b546d7SQu Wenruo return ret; 333319b546d7SQu Wenruo 333419b546d7SQu Wenruo ULIST_ITER_INIT(&leaf_uiter); 333519b546d7SQu Wenruo while ((ref_node = ulist_next(leaves, &leaf_uiter))) { 333619b546d7SQu Wenruo struct extent_buffer *eb; 333719b546d7SQu Wenruo 33381b7ec85eSJosef Bacik eb = read_tree_block(fs_info, ref_node->val, 0, 0, 0, NULL); 333919b546d7SQu Wenruo if (IS_ERR(eb)) { 334019b546d7SQu Wenruo ret = PTR_ERR(eb); 334119b546d7SQu Wenruo break; 334219b546d7SQu Wenruo } 334319b546d7SQu Wenruo ret = delete_v1_space_cache(eb, rc->block_group, 334419b546d7SQu Wenruo extent_key->objectid); 334519b546d7SQu Wenruo free_extent_buffer(eb); 334619b546d7SQu Wenruo if (ret < 0) 334719b546d7SQu Wenruo break; 334819b546d7SQu Wenruo ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); 334919b546d7SQu Wenruo if (ret < 0) 335019b546d7SQu Wenruo break; 335119b546d7SQu Wenruo } 335219b546d7SQu Wenruo if (ret < 0) 33535d4f98a2SYan Zheng free_block_list(blocks); 335419b546d7SQu Wenruo ulist_free(leaves); 335519b546d7SQu Wenruo return ret; 33565d4f98a2SYan Zheng } 33575d4f98a2SYan Zheng 33585d4f98a2SYan Zheng /* 33592c016dc2SLiu Bo * helper to find next unprocessed extent 33605d4f98a2SYan Zheng */ 33615d4f98a2SYan Zheng static noinline_for_stack 3362147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 33633fd0a558SYan, Zheng struct btrfs_key *extent_key) 33645d4f98a2SYan Zheng { 33650b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 33665d4f98a2SYan Zheng struct btrfs_key key; 33675d4f98a2SYan Zheng struct extent_buffer *leaf; 33685d4f98a2SYan Zheng u64 start, end, last; 33695d4f98a2SYan Zheng int ret; 33705d4f98a2SYan Zheng 3371b3470b5dSDavid Sterba last = rc->block_group->start + rc->block_group->length; 33725d4f98a2SYan Zheng while (1) { 33735d4f98a2SYan Zheng cond_resched(); 33745d4f98a2SYan Zheng if (rc->search_start >= last) { 33755d4f98a2SYan Zheng ret = 1; 33765d4f98a2SYan Zheng break; 33775d4f98a2SYan Zheng } 33785d4f98a2SYan Zheng 33795d4f98a2SYan Zheng key.objectid = rc->search_start; 33805d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 33815d4f98a2SYan Zheng key.offset = 0; 33825d4f98a2SYan Zheng 33835d4f98a2SYan Zheng path->search_commit_root = 1; 33845d4f98a2SYan Zheng path->skip_locking = 1; 33855d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 33865d4f98a2SYan Zheng 0, 0); 33875d4f98a2SYan Zheng if (ret < 0) 33885d4f98a2SYan Zheng break; 33895d4f98a2SYan Zheng next: 33905d4f98a2SYan Zheng leaf = path->nodes[0]; 33915d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 33925d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 33935d4f98a2SYan Zheng if (ret != 0) 33945d4f98a2SYan Zheng break; 33955d4f98a2SYan Zheng leaf = path->nodes[0]; 33965d4f98a2SYan Zheng } 33975d4f98a2SYan Zheng 33985d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 33995d4f98a2SYan Zheng if (key.objectid >= last) { 34005d4f98a2SYan Zheng ret = 1; 34015d4f98a2SYan Zheng break; 34025d4f98a2SYan Zheng } 34035d4f98a2SYan Zheng 34043173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 34053173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 34063173a18fSJosef Bacik path->slots[0]++; 34073173a18fSJosef Bacik goto next; 34083173a18fSJosef Bacik } 34093173a18fSJosef Bacik 34103173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 34115d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 34125d4f98a2SYan Zheng path->slots[0]++; 34135d4f98a2SYan Zheng goto next; 34145d4f98a2SYan Zheng } 34155d4f98a2SYan Zheng 34163173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 34170b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 34183173a18fSJosef Bacik rc->search_start) { 34193173a18fSJosef Bacik path->slots[0]++; 34203173a18fSJosef Bacik goto next; 34213173a18fSJosef Bacik } 34223173a18fSJosef Bacik 34235d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 34245d4f98a2SYan Zheng key.objectid, &start, &end, 3425e6138876SJosef Bacik EXTENT_DIRTY, NULL); 34265d4f98a2SYan Zheng 34275d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3428b3b4aa74SDavid Sterba btrfs_release_path(path); 34295d4f98a2SYan Zheng rc->search_start = end + 1; 34305d4f98a2SYan Zheng } else { 34313173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 34325d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 34333173a18fSJosef Bacik else 34343173a18fSJosef Bacik rc->search_start = key.objectid + 34350b246afaSJeff Mahoney fs_info->nodesize; 34363fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 34375d4f98a2SYan Zheng return 0; 34385d4f98a2SYan Zheng } 34395d4f98a2SYan Zheng } 3440b3b4aa74SDavid Sterba btrfs_release_path(path); 34415d4f98a2SYan Zheng return ret; 34425d4f98a2SYan Zheng } 34435d4f98a2SYan Zheng 34445d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 34455d4f98a2SYan Zheng { 34465d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 34477585717fSChris Mason 34487585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 34495d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 34507585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 34515d4f98a2SYan Zheng } 34525d4f98a2SYan Zheng 34535d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 34545d4f98a2SYan Zheng { 34555d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 34567585717fSChris Mason 34577585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 34585d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 34597585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 34605d4f98a2SYan Zheng } 34615d4f98a2SYan Zheng 34623fd0a558SYan, Zheng static noinline_for_stack 34633fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 34643fd0a558SYan, Zheng { 34653fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3466ac2fabacSJosef Bacik int ret; 34673fd0a558SYan, Zheng 34682ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 346966d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 34703fd0a558SYan, Zheng if (!rc->block_rsv) 34713fd0a558SYan, Zheng return -ENOMEM; 34723fd0a558SYan, Zheng 34733fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 3474b3470b5dSDavid Sterba rc->search_start = rc->block_group->start; 34753fd0a558SYan, Zheng rc->extents_found = 0; 34763fd0a558SYan, Zheng rc->nodes_relocated = 0; 34773fd0a558SYan, Zheng rc->merging_rsv_size = 0; 34780647bf56SWang Shilong rc->reserved_bytes = 0; 3479da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 34800647bf56SWang Shilong RELOCATION_RESERVED_NODES; 3481ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 3482ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3483ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3484ac2fabacSJosef Bacik if (ret) 3485ac2fabacSJosef Bacik return ret; 34863fd0a558SYan, Zheng 34873fd0a558SYan, Zheng rc->create_reloc_tree = 1; 34883fd0a558SYan, Zheng set_reloc_control(rc); 34893fd0a558SYan, Zheng 34907a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 349128818947SLiu Bo if (IS_ERR(trans)) { 349228818947SLiu Bo unset_reloc_control(rc); 349328818947SLiu Bo /* 349428818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 349528818947SLiu Bo * cleanup. And callers are responsible to free the above 349628818947SLiu Bo * block rsv. 349728818947SLiu Bo */ 349828818947SLiu Bo return PTR_ERR(trans); 349928818947SLiu Bo } 3500fb686c68SJosef Bacik return btrfs_commit_transaction(trans); 35013fd0a558SYan, Zheng } 350276dda93cSYan, Zheng 35035d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 35045d4f98a2SYan Zheng { 35052ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 35065d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 35075d4f98a2SYan Zheng struct btrfs_key key; 35085d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 35095d4f98a2SYan Zheng struct btrfs_path *path; 35105d4f98a2SYan Zheng struct btrfs_extent_item *ei; 35115d4f98a2SYan Zheng u64 flags; 35125d4f98a2SYan Zheng int ret; 35135d4f98a2SYan Zheng int err = 0; 3514c87f08caSChris Mason int progress = 0; 35155d4f98a2SYan Zheng 35165d4f98a2SYan Zheng path = btrfs_alloc_path(); 35173fd0a558SYan, Zheng if (!path) 35185d4f98a2SYan Zheng return -ENOMEM; 3519e4058b54SDavid Sterba path->reada = READA_FORWARD; 35203fd0a558SYan, Zheng 35213fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 35223fd0a558SYan, Zheng if (ret) { 35233fd0a558SYan, Zheng err = ret; 35243fd0a558SYan, Zheng goto out_free; 35252423fdfbSJiri Slaby } 35265d4f98a2SYan Zheng 35275d4f98a2SYan Zheng while (1) { 35280647bf56SWang Shilong rc->reserved_bytes = 0; 35290647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 35300647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 35310647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 35320647bf56SWang Shilong if (ret) { 35330647bf56SWang Shilong err = ret; 35340647bf56SWang Shilong break; 35350647bf56SWang Shilong } 3536c87f08caSChris Mason progress++; 3537a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 35380f788c58SLiu Bo if (IS_ERR(trans)) { 35390f788c58SLiu Bo err = PTR_ERR(trans); 35400f788c58SLiu Bo trans = NULL; 35410f788c58SLiu Bo break; 35420f788c58SLiu Bo } 3543c87f08caSChris Mason restart: 35443fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 35453a45bb20SJeff Mahoney btrfs_end_transaction(trans); 354642a657f5SPan Bian trans = NULL; 35473fd0a558SYan, Zheng continue; 35483fd0a558SYan, Zheng } 35493fd0a558SYan, Zheng 3550147d256eSZhaolei ret = find_next_extent(rc, path, &key); 35515d4f98a2SYan Zheng if (ret < 0) 35525d4f98a2SYan Zheng err = ret; 35535d4f98a2SYan Zheng if (ret != 0) 35545d4f98a2SYan Zheng break; 35555d4f98a2SYan Zheng 35565d4f98a2SYan Zheng rc->extents_found++; 35575d4f98a2SYan Zheng 35585d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 35595d4f98a2SYan Zheng struct btrfs_extent_item); 35605d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 35615d4f98a2SYan Zheng 35625d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 35635d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 35645d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 35655d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 35665d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 35675d4f98a2SYan Zheng } else { 3568b3b4aa74SDavid Sterba btrfs_release_path(path); 35695d4f98a2SYan Zheng ret = 0; 35705d4f98a2SYan Zheng } 35715d4f98a2SYan Zheng if (ret < 0) { 35723fd0a558SYan, Zheng err = ret; 35735d4f98a2SYan Zheng break; 35745d4f98a2SYan Zheng } 35755d4f98a2SYan Zheng 35765d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 35775d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 35785d4f98a2SYan Zheng if (ret < 0) { 35793fd0a558SYan, Zheng if (ret != -EAGAIN) { 35805d4f98a2SYan Zheng err = ret; 35815d4f98a2SYan Zheng break; 35825d4f98a2SYan Zheng } 35833fd0a558SYan, Zheng rc->extents_found--; 35843fd0a558SYan, Zheng rc->search_start = key.objectid; 35853fd0a558SYan, Zheng } 35865d4f98a2SYan Zheng } 35875d4f98a2SYan Zheng 35883a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 35892ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 35903fd0a558SYan, Zheng trans = NULL; 35915d4f98a2SYan Zheng 35925d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 35935d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 35945d4f98a2SYan Zheng rc->found_file_extent = 1; 35950257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 35963fd0a558SYan, Zheng &key, &rc->cluster); 35975d4f98a2SYan Zheng if (ret < 0) { 35985d4f98a2SYan Zheng err = ret; 35995d4f98a2SYan Zheng break; 36005d4f98a2SYan Zheng } 36015d4f98a2SYan Zheng } 3602f31ea088SQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 3603f31ea088SQu Wenruo err = -ECANCELED; 3604f31ea088SQu Wenruo break; 3605f31ea088SQu Wenruo } 36065d4f98a2SYan Zheng } 3607c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 360843a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 36099689457bSShilong Wang if (ret == 1) { 3610c87f08caSChris Mason err = 0; 3611c87f08caSChris Mason progress = 0; 3612c87f08caSChris Mason goto restart; 3613c87f08caSChris Mason } 3614c87f08caSChris Mason } 36153fd0a558SYan, Zheng 3616b3b4aa74SDavid Sterba btrfs_release_path(path); 361791166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 36185d4f98a2SYan Zheng 36195d4f98a2SYan Zheng if (trans) { 36203a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 36212ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 36225d4f98a2SYan Zheng } 36235d4f98a2SYan Zheng 36240257bb82SYan, Zheng if (!err) { 36253fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 36263fd0a558SYan, Zheng &rc->cluster); 36270257bb82SYan, Zheng if (ret < 0) 36280257bb82SYan, Zheng err = ret; 36290257bb82SYan, Zheng } 36300257bb82SYan, Zheng 36313fd0a558SYan, Zheng rc->create_reloc_tree = 0; 36323fd0a558SYan, Zheng set_reloc_control(rc); 36330257bb82SYan, Zheng 363413fe1bdbSQu Wenruo btrfs_backref_release_cache(&rc->backref_cache); 363563f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 36365d4f98a2SYan Zheng 36377f913c7cSQu Wenruo /* 36387f913c7cSQu Wenruo * Even in the case when the relocation is cancelled, we should all go 36397f913c7cSQu Wenruo * through prepare_to_merge() and merge_reloc_roots(). 36407f913c7cSQu Wenruo * 36417f913c7cSQu Wenruo * For error (including cancelled balance), prepare_to_merge() will 36427f913c7cSQu Wenruo * mark all reloc trees orphan, then queue them for cleanup in 36437f913c7cSQu Wenruo * merge_reloc_roots() 36447f913c7cSQu Wenruo */ 36453fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 36465d4f98a2SYan Zheng 36475d4f98a2SYan Zheng merge_reloc_roots(rc); 36485d4f98a2SYan Zheng 36493fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 36505d4f98a2SYan Zheng unset_reloc_control(rc); 365163f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 36525d4f98a2SYan Zheng 36535d4f98a2SYan Zheng /* get rid of pinned extents */ 36547a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 365562b99540SQu Wenruo if (IS_ERR(trans)) { 36563612b495STsutomu Itoh err = PTR_ERR(trans); 365762b99540SQu Wenruo goto out_free; 365862b99540SQu Wenruo } 3659fb686c68SJosef Bacik ret = btrfs_commit_transaction(trans); 3660fb686c68SJosef Bacik if (ret && !err) 3661fb686c68SJosef Bacik err = ret; 36626217b0faSJosef Bacik out_free: 3663d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 3664d2311e69SQu Wenruo if (ret < 0 && !err) 3665d2311e69SQu Wenruo err = ret; 36662ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 36673fd0a558SYan, Zheng btrfs_free_path(path); 36685d4f98a2SYan Zheng return err; 36695d4f98a2SYan Zheng } 36705d4f98a2SYan Zheng 36715d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 36720257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 36735d4f98a2SYan Zheng { 36745d4f98a2SYan Zheng struct btrfs_path *path; 36755d4f98a2SYan Zheng struct btrfs_inode_item *item; 36765d4f98a2SYan Zheng struct extent_buffer *leaf; 367732430c61SNaohiro Aota u64 flags = BTRFS_INODE_NOCOMPRESS | BTRFS_INODE_PREALLOC; 36785d4f98a2SYan Zheng int ret; 36795d4f98a2SYan Zheng 368032430c61SNaohiro Aota if (btrfs_is_zoned(trans->fs_info)) 368132430c61SNaohiro Aota flags &= ~BTRFS_INODE_PREALLOC; 368232430c61SNaohiro Aota 36835d4f98a2SYan Zheng path = btrfs_alloc_path(); 36845d4f98a2SYan Zheng if (!path) 36855d4f98a2SYan Zheng return -ENOMEM; 36865d4f98a2SYan Zheng 36875d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 36885d4f98a2SYan Zheng if (ret) 36895d4f98a2SYan Zheng goto out; 36905d4f98a2SYan Zheng 36915d4f98a2SYan Zheng leaf = path->nodes[0]; 36925d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 3693b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 36945d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 36950257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 36965d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 369732430c61SNaohiro Aota btrfs_set_inode_flags(leaf, item, flags); 36985d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 36995d4f98a2SYan Zheng out: 37005d4f98a2SYan Zheng btrfs_free_path(path); 37015d4f98a2SYan Zheng return ret; 37025d4f98a2SYan Zheng } 37035d4f98a2SYan Zheng 3704790c1b8cSJosef Bacik static void delete_orphan_inode(struct btrfs_trans_handle *trans, 3705790c1b8cSJosef Bacik struct btrfs_root *root, u64 objectid) 3706790c1b8cSJosef Bacik { 3707790c1b8cSJosef Bacik struct btrfs_path *path; 3708790c1b8cSJosef Bacik struct btrfs_key key; 3709790c1b8cSJosef Bacik int ret = 0; 3710790c1b8cSJosef Bacik 3711790c1b8cSJosef Bacik path = btrfs_alloc_path(); 3712790c1b8cSJosef Bacik if (!path) { 3713790c1b8cSJosef Bacik ret = -ENOMEM; 3714790c1b8cSJosef Bacik goto out; 3715790c1b8cSJosef Bacik } 3716790c1b8cSJosef Bacik 3717790c1b8cSJosef Bacik key.objectid = objectid; 3718790c1b8cSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 3719790c1b8cSJosef Bacik key.offset = 0; 3720790c1b8cSJosef Bacik ret = btrfs_search_slot(trans, root, &key, path, -1, 1); 3721790c1b8cSJosef Bacik if (ret) { 3722790c1b8cSJosef Bacik if (ret > 0) 3723790c1b8cSJosef Bacik ret = -ENOENT; 3724790c1b8cSJosef Bacik goto out; 3725790c1b8cSJosef Bacik } 3726790c1b8cSJosef Bacik ret = btrfs_del_item(trans, root, path); 3727790c1b8cSJosef Bacik out: 3728790c1b8cSJosef Bacik if (ret) 3729790c1b8cSJosef Bacik btrfs_abort_transaction(trans, ret); 3730790c1b8cSJosef Bacik btrfs_free_path(path); 3731790c1b8cSJosef Bacik } 3732790c1b8cSJosef Bacik 37335d4f98a2SYan Zheng /* 37345d4f98a2SYan Zheng * helper to create inode for data relocation. 37355d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 37365d4f98a2SYan Zheng */ 37373fd0a558SYan, Zheng static noinline_for_stack 37383fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 373932da5386SDavid Sterba struct btrfs_block_group *group) 37405d4f98a2SYan Zheng { 37415d4f98a2SYan Zheng struct inode *inode = NULL; 37425d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 37435d4f98a2SYan Zheng struct btrfs_root *root; 37444624900dSZhaolei u64 objectid; 37455d4f98a2SYan Zheng int err = 0; 37465d4f98a2SYan Zheng 3747aeb935a4SQu Wenruo root = btrfs_grab_root(fs_info->data_reloc_root); 3748a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 374976deacf0SJosef Bacik if (IS_ERR(trans)) { 375000246528SJosef Bacik btrfs_put_root(root); 37513fd0a558SYan, Zheng return ERR_CAST(trans); 375276deacf0SJosef Bacik } 37535d4f98a2SYan Zheng 3754543068a2SNikolay Borisov err = btrfs_get_free_objectid(root, &objectid); 37555d4f98a2SYan Zheng if (err) 37565d4f98a2SYan Zheng goto out; 37575d4f98a2SYan Zheng 37580257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 3759790c1b8cSJosef Bacik if (err) 3760790c1b8cSJosef Bacik goto out; 37615d4f98a2SYan Zheng 37620202e83fSDavid Sterba inode = btrfs_iget(fs_info->sb, objectid, root); 3763790c1b8cSJosef Bacik if (IS_ERR(inode)) { 3764790c1b8cSJosef Bacik delete_orphan_inode(trans, root, objectid); 3765790c1b8cSJosef Bacik err = PTR_ERR(inode); 3766790c1b8cSJosef Bacik inode = NULL; 3767790c1b8cSJosef Bacik goto out; 3768790c1b8cSJosef Bacik } 3769b3470b5dSDavid Sterba BTRFS_I(inode)->index_cnt = group->start; 37705d4f98a2SYan Zheng 377173f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 37725d4f98a2SYan Zheng out: 377300246528SJosef Bacik btrfs_put_root(root); 37743a45bb20SJeff Mahoney btrfs_end_transaction(trans); 37752ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 37765d4f98a2SYan Zheng if (err) { 37775d4f98a2SYan Zheng if (inode) 37785d4f98a2SYan Zheng iput(inode); 37795d4f98a2SYan Zheng inode = ERR_PTR(err); 37805d4f98a2SYan Zheng } 37815d4f98a2SYan Zheng return inode; 37825d4f98a2SYan Zheng } 37835d4f98a2SYan Zheng 3784*907d2710SDavid Sterba /* 3785*907d2710SDavid Sterba * Mark start of chunk relocation that is cancellable. Check if the cancellation 3786*907d2710SDavid Sterba * has been requested meanwhile and don't start in that case. 3787*907d2710SDavid Sterba * 3788*907d2710SDavid Sterba * Return: 3789*907d2710SDavid Sterba * 0 success 3790*907d2710SDavid Sterba * -EINPROGRESS operation is already in progress, that's probably a bug 3791*907d2710SDavid Sterba * -ECANCELED cancellation request was set before the operation started 3792*907d2710SDavid Sterba */ 3793*907d2710SDavid Sterba static int reloc_chunk_start(struct btrfs_fs_info *fs_info) 3794*907d2710SDavid Sterba { 3795*907d2710SDavid Sterba if (test_and_set_bit(BTRFS_FS_RELOC_RUNNING, &fs_info->flags)) { 3796*907d2710SDavid Sterba /* This should not happen */ 3797*907d2710SDavid Sterba btrfs_err(fs_info, "reloc already running, cannot start"); 3798*907d2710SDavid Sterba return -EINPROGRESS; 3799*907d2710SDavid Sterba } 3800*907d2710SDavid Sterba 3801*907d2710SDavid Sterba if (atomic_read(&fs_info->reloc_cancel_req) > 0) { 3802*907d2710SDavid Sterba btrfs_info(fs_info, "chunk relocation canceled on start"); 3803*907d2710SDavid Sterba /* 3804*907d2710SDavid Sterba * On cancel, clear all requests but let the caller mark 3805*907d2710SDavid Sterba * the end after cleanup operations. 3806*907d2710SDavid Sterba */ 3807*907d2710SDavid Sterba atomic_set(&fs_info->reloc_cancel_req, 0); 3808*907d2710SDavid Sterba return -ECANCELED; 3809*907d2710SDavid Sterba } 3810*907d2710SDavid Sterba return 0; 3811*907d2710SDavid Sterba } 3812*907d2710SDavid Sterba 3813*907d2710SDavid Sterba /* 3814*907d2710SDavid Sterba * Mark end of chunk relocation that is cancellable and wake any waiters. 3815*907d2710SDavid Sterba */ 3816*907d2710SDavid Sterba static void reloc_chunk_end(struct btrfs_fs_info *fs_info) 3817*907d2710SDavid Sterba { 3818*907d2710SDavid Sterba /* Requested after start, clear bit first so any waiters can continue */ 3819*907d2710SDavid Sterba if (atomic_read(&fs_info->reloc_cancel_req) > 0) 3820*907d2710SDavid Sterba btrfs_info(fs_info, "chunk relocation canceled during operation"); 3821*907d2710SDavid Sterba clear_and_wake_up_bit(BTRFS_FS_RELOC_RUNNING, &fs_info->flags); 3822*907d2710SDavid Sterba atomic_set(&fs_info->reloc_cancel_req, 0); 3823*907d2710SDavid Sterba } 3824*907d2710SDavid Sterba 3825c258d6e3SQu Wenruo static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 38263fd0a558SYan, Zheng { 38273fd0a558SYan, Zheng struct reloc_control *rc; 38283fd0a558SYan, Zheng 38293fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 38303fd0a558SYan, Zheng if (!rc) 38313fd0a558SYan, Zheng return NULL; 38323fd0a558SYan, Zheng 38333fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 3834d2311e69SQu Wenruo INIT_LIST_HEAD(&rc->dirty_subvol_roots); 3835584fb121SQu Wenruo btrfs_backref_init_cache(fs_info, &rc->backref_cache, 1); 38363fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 383743eb5f29SQu Wenruo extent_io_tree_init(fs_info, &rc->processed_blocks, 383843eb5f29SQu Wenruo IO_TREE_RELOC_BLOCKS, NULL); 38393fd0a558SYan, Zheng return rc; 38403fd0a558SYan, Zheng } 38413fd0a558SYan, Zheng 38421a0afa0eSJosef Bacik static void free_reloc_control(struct reloc_control *rc) 38431a0afa0eSJosef Bacik { 38441a0afa0eSJosef Bacik struct mapping_node *node, *tmp; 38451a0afa0eSJosef Bacik 38461a0afa0eSJosef Bacik free_reloc_roots(&rc->reloc_roots); 38471a0afa0eSJosef Bacik rbtree_postorder_for_each_entry_safe(node, tmp, 38481a0afa0eSJosef Bacik &rc->reloc_root_tree.rb_root, rb_node) 38491a0afa0eSJosef Bacik kfree(node); 38501a0afa0eSJosef Bacik 38511a0afa0eSJosef Bacik kfree(rc); 38521a0afa0eSJosef Bacik } 38531a0afa0eSJosef Bacik 38545d4f98a2SYan Zheng /* 3855ebce0e01SAdam Borowski * Print the block group being relocated 3856ebce0e01SAdam Borowski */ 3857ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 385832da5386SDavid Sterba struct btrfs_block_group *block_group) 3859ebce0e01SAdam Borowski { 3860f89e09cfSAnand Jain char buf[128] = {'\0'}; 3861ebce0e01SAdam Borowski 3862f89e09cfSAnand Jain btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); 3863ebce0e01SAdam Borowski 3864ebce0e01SAdam Borowski btrfs_info(fs_info, 3865ebce0e01SAdam Borowski "relocating block group %llu flags %s", 3866b3470b5dSDavid Sterba block_group->start, buf); 3867ebce0e01SAdam Borowski } 3868ebce0e01SAdam Borowski 3869430640e3SQu Wenruo static const char *stage_to_string(int stage) 3870430640e3SQu Wenruo { 3871430640e3SQu Wenruo if (stage == MOVE_DATA_EXTENTS) 3872430640e3SQu Wenruo return "move data extents"; 3873430640e3SQu Wenruo if (stage == UPDATE_DATA_PTRS) 3874430640e3SQu Wenruo return "update data pointers"; 3875430640e3SQu Wenruo return "unknown"; 3876430640e3SQu Wenruo } 3877430640e3SQu Wenruo 3878ebce0e01SAdam Borowski /* 38795d4f98a2SYan Zheng * function to relocate all extents in a block group. 38805d4f98a2SYan Zheng */ 38816bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 38825d4f98a2SYan Zheng { 388332da5386SDavid Sterba struct btrfs_block_group *bg; 38846bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 38855d4f98a2SYan Zheng struct reloc_control *rc; 38860af3d00bSJosef Bacik struct inode *inode; 38870af3d00bSJosef Bacik struct btrfs_path *path; 38885d4f98a2SYan Zheng int ret; 3889f0486c68SYan, Zheng int rw = 0; 38905d4f98a2SYan Zheng int err = 0; 38915d4f98a2SYan Zheng 3892eede2bf3SOmar Sandoval bg = btrfs_lookup_block_group(fs_info, group_start); 3893eede2bf3SOmar Sandoval if (!bg) 3894eede2bf3SOmar Sandoval return -ENOENT; 3895eede2bf3SOmar Sandoval 3896eede2bf3SOmar Sandoval if (btrfs_pinned_by_swapfile(fs_info, bg)) { 3897eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 3898eede2bf3SOmar Sandoval return -ETXTBSY; 3899eede2bf3SOmar Sandoval } 3900eede2bf3SOmar Sandoval 3901c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 3902eede2bf3SOmar Sandoval if (!rc) { 3903eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 39045d4f98a2SYan Zheng return -ENOMEM; 3905eede2bf3SOmar Sandoval } 39065d4f98a2SYan Zheng 3907*907d2710SDavid Sterba ret = reloc_chunk_start(fs_info); 3908*907d2710SDavid Sterba if (ret < 0) { 3909*907d2710SDavid Sterba err = ret; 3910*907d2710SDavid Sterba goto out_put_bg; 3911*907d2710SDavid Sterba } 3912*907d2710SDavid Sterba 3913f0486c68SYan, Zheng rc->extent_root = extent_root; 3914eede2bf3SOmar Sandoval rc->block_group = bg; 39155d4f98a2SYan Zheng 3916b12de528SQu Wenruo ret = btrfs_inc_block_group_ro(rc->block_group, true); 3917f0486c68SYan, Zheng if (ret) { 3918f0486c68SYan, Zheng err = ret; 3919f0486c68SYan, Zheng goto out; 3920f0486c68SYan, Zheng } 3921f0486c68SYan, Zheng rw = 1; 3922f0486c68SYan, Zheng 39230af3d00bSJosef Bacik path = btrfs_alloc_path(); 39240af3d00bSJosef Bacik if (!path) { 39250af3d00bSJosef Bacik err = -ENOMEM; 39260af3d00bSJosef Bacik goto out; 39270af3d00bSJosef Bacik } 39280af3d00bSJosef Bacik 39297949f339SDavid Sterba inode = lookup_free_space_inode(rc->block_group, path); 39300af3d00bSJosef Bacik btrfs_free_path(path); 39310af3d00bSJosef Bacik 39320af3d00bSJosef Bacik if (!IS_ERR(inode)) 39331bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 39340af3d00bSJosef Bacik else 39350af3d00bSJosef Bacik ret = PTR_ERR(inode); 39360af3d00bSJosef Bacik 39370af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 39380af3d00bSJosef Bacik err = ret; 39390af3d00bSJosef Bacik goto out; 39400af3d00bSJosef Bacik } 39410af3d00bSJosef Bacik 39425d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 39435d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 39445d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 39455d4f98a2SYan Zheng rc->data_inode = NULL; 39465d4f98a2SYan Zheng goto out; 39475d4f98a2SYan Zheng } 39485d4f98a2SYan Zheng 39490b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 39505d4f98a2SYan Zheng 39519cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 3952f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 39536374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 3954b3470b5dSDavid Sterba rc->block_group->start, 3955b3470b5dSDavid Sterba rc->block_group->length); 39565d4f98a2SYan Zheng 39575d4f98a2SYan Zheng while (1) { 3958430640e3SQu Wenruo int finishes_stage; 3959430640e3SQu Wenruo 396076dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 39615d4f98a2SYan Zheng ret = relocate_block_group(rc); 396276dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 3963ff612ba7SJosef Bacik if (ret < 0) 39645d4f98a2SYan Zheng err = ret; 3965ff612ba7SJosef Bacik 3966430640e3SQu Wenruo finishes_stage = rc->stage; 3967ff612ba7SJosef Bacik /* 3968ff612ba7SJosef Bacik * We may have gotten ENOSPC after we already dirtied some 3969ff612ba7SJosef Bacik * extents. If writeout happens while we're relocating a 3970ff612ba7SJosef Bacik * different block group we could end up hitting the 3971ff612ba7SJosef Bacik * BUG_ON(rc->stage == UPDATE_DATA_PTRS) in 3972ff612ba7SJosef Bacik * btrfs_reloc_cow_block. Make sure we write everything out 3973ff612ba7SJosef Bacik * properly so we don't trip over this problem, and then break 3974ff612ba7SJosef Bacik * out of the loop if we hit an error. 3975ff612ba7SJosef Bacik */ 3976ff612ba7SJosef Bacik if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 3977ff612ba7SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 3978ff612ba7SJosef Bacik (u64)-1); 3979ff612ba7SJosef Bacik if (ret) 3980ff612ba7SJosef Bacik err = ret; 3981ff612ba7SJosef Bacik invalidate_mapping_pages(rc->data_inode->i_mapping, 3982ff612ba7SJosef Bacik 0, -1); 3983ff612ba7SJosef Bacik rc->stage = UPDATE_DATA_PTRS; 39845d4f98a2SYan Zheng } 39855d4f98a2SYan Zheng 3986ff612ba7SJosef Bacik if (err < 0) 3987ff612ba7SJosef Bacik goto out; 3988ff612ba7SJosef Bacik 39895d4f98a2SYan Zheng if (rc->extents_found == 0) 39905d4f98a2SYan Zheng break; 39915d4f98a2SYan Zheng 3992430640e3SQu Wenruo btrfs_info(fs_info, "found %llu extents, stage: %s", 3993430640e3SQu Wenruo rc->extents_found, stage_to_string(finishes_stage)); 39945d4f98a2SYan Zheng } 39955d4f98a2SYan Zheng 39965d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 39975d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 3998bf38be65SDavid Sterba WARN_ON(rc->block_group->used > 0); 39995d4f98a2SYan Zheng out: 4000f0486c68SYan, Zheng if (err && rw) 40012ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 40025d4f98a2SYan Zheng iput(rc->data_inode); 4003*907d2710SDavid Sterba out_put_bg: 4004*907d2710SDavid Sterba btrfs_put_block_group(bg); 4005*907d2710SDavid Sterba reloc_chunk_end(fs_info); 40061a0afa0eSJosef Bacik free_reloc_control(rc); 40075d4f98a2SYan Zheng return err; 40085d4f98a2SYan Zheng } 40095d4f98a2SYan Zheng 401076dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 401176dda93cSYan, Zheng { 40120b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 401376dda93cSYan, Zheng struct btrfs_trans_handle *trans; 401479787eaaSJeff Mahoney int ret, err; 401576dda93cSYan, Zheng 40160b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 401779787eaaSJeff Mahoney if (IS_ERR(trans)) 401879787eaaSJeff Mahoney return PTR_ERR(trans); 401976dda93cSYan, Zheng 402076dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 402176dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 4022c8422684SDavid Sterba btrfs_set_root_drop_level(&root->root_item, 0); 402376dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 40240b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 402576dda93cSYan, Zheng &root->root_key, &root->root_item); 402676dda93cSYan, Zheng 40273a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 402879787eaaSJeff Mahoney if (err) 402979787eaaSJeff Mahoney return err; 403079787eaaSJeff Mahoney return ret; 403176dda93cSYan, Zheng } 403276dda93cSYan, Zheng 40335d4f98a2SYan Zheng /* 40345d4f98a2SYan Zheng * recover relocation interrupted by system crash. 40355d4f98a2SYan Zheng * 40365d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 40375d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 40385d4f98a2SYan Zheng */ 40395d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 40405d4f98a2SYan Zheng { 40410b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 40425d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 40435d4f98a2SYan Zheng struct btrfs_key key; 40445d4f98a2SYan Zheng struct btrfs_root *fs_root; 40455d4f98a2SYan Zheng struct btrfs_root *reloc_root; 40465d4f98a2SYan Zheng struct btrfs_path *path; 40475d4f98a2SYan Zheng struct extent_buffer *leaf; 40485d4f98a2SYan Zheng struct reloc_control *rc = NULL; 40495d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 40505d4f98a2SYan Zheng int ret; 40515d4f98a2SYan Zheng int err = 0; 40525d4f98a2SYan Zheng 40535d4f98a2SYan Zheng path = btrfs_alloc_path(); 40545d4f98a2SYan Zheng if (!path) 40555d4f98a2SYan Zheng return -ENOMEM; 4056e4058b54SDavid Sterba path->reada = READA_BACK; 40575d4f98a2SYan Zheng 40585d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 40595d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 40605d4f98a2SYan Zheng key.offset = (u64)-1; 40615d4f98a2SYan Zheng 40625d4f98a2SYan Zheng while (1) { 40630b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 40645d4f98a2SYan Zheng path, 0, 0); 40655d4f98a2SYan Zheng if (ret < 0) { 40665d4f98a2SYan Zheng err = ret; 40675d4f98a2SYan Zheng goto out; 40685d4f98a2SYan Zheng } 40695d4f98a2SYan Zheng if (ret > 0) { 40705d4f98a2SYan Zheng if (path->slots[0] == 0) 40715d4f98a2SYan Zheng break; 40725d4f98a2SYan Zheng path->slots[0]--; 40735d4f98a2SYan Zheng } 40745d4f98a2SYan Zheng leaf = path->nodes[0]; 40755d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4076b3b4aa74SDavid Sterba btrfs_release_path(path); 40775d4f98a2SYan Zheng 40785d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 40795d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 40805d4f98a2SYan Zheng break; 40815d4f98a2SYan Zheng 40823dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(root, &key); 40835d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 40845d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 40855d4f98a2SYan Zheng goto out; 40865d4f98a2SYan Zheng } 40875d4f98a2SYan Zheng 408892a7cc42SQu Wenruo set_bit(BTRFS_ROOT_SHAREABLE, &reloc_root->state); 40895d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 40905d4f98a2SYan Zheng 40915d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 4092a820feb5SDavid Sterba fs_root = btrfs_get_fs_root(fs_info, 4093a820feb5SDavid Sterba reloc_root->root_key.offset, false); 40945d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 409576dda93cSYan, Zheng ret = PTR_ERR(fs_root); 409676dda93cSYan, Zheng if (ret != -ENOENT) { 409776dda93cSYan, Zheng err = ret; 40985d4f98a2SYan Zheng goto out; 40995d4f98a2SYan Zheng } 410079787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 410179787eaaSJeff Mahoney if (ret < 0) { 410279787eaaSJeff Mahoney err = ret; 410379787eaaSJeff Mahoney goto out; 410479787eaaSJeff Mahoney } 4105932fd26dSJosef Bacik } else { 410600246528SJosef Bacik btrfs_put_root(fs_root); 410776dda93cSYan, Zheng } 41085d4f98a2SYan Zheng } 41095d4f98a2SYan Zheng 41105d4f98a2SYan Zheng if (key.offset == 0) 41115d4f98a2SYan Zheng break; 41125d4f98a2SYan Zheng 41135d4f98a2SYan Zheng key.offset--; 41145d4f98a2SYan Zheng } 4115b3b4aa74SDavid Sterba btrfs_release_path(path); 41165d4f98a2SYan Zheng 41175d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 41185d4f98a2SYan Zheng goto out; 41195d4f98a2SYan Zheng 4120c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 41215d4f98a2SYan Zheng if (!rc) { 41225d4f98a2SYan Zheng err = -ENOMEM; 41235d4f98a2SYan Zheng goto out; 41245d4f98a2SYan Zheng } 41255d4f98a2SYan Zheng 4126*907d2710SDavid Sterba ret = reloc_chunk_start(fs_info); 4127*907d2710SDavid Sterba if (ret < 0) { 4128*907d2710SDavid Sterba err = ret; 4129*907d2710SDavid Sterba goto out_end; 4130*907d2710SDavid Sterba } 4131*907d2710SDavid Sterba 41320b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 41335d4f98a2SYan Zheng 41345d4f98a2SYan Zheng set_reloc_control(rc); 41355d4f98a2SYan Zheng 41367a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 41373612b495STsutomu Itoh if (IS_ERR(trans)) { 41383612b495STsutomu Itoh err = PTR_ERR(trans); 4139fb2d83eeSJosef Bacik goto out_unset; 41403612b495STsutomu Itoh } 41413fd0a558SYan, Zheng 41423fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 41433fd0a558SYan, Zheng 41445d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 41455d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 41465d4f98a2SYan Zheng struct btrfs_root, root_list); 41475d4f98a2SYan Zheng list_del(&reloc_root->root_list); 41485d4f98a2SYan Zheng 41495d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 41505d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 41515d4f98a2SYan Zheng &rc->reloc_roots); 41525d4f98a2SYan Zheng continue; 41535d4f98a2SYan Zheng } 41545d4f98a2SYan Zheng 4155a820feb5SDavid Sterba fs_root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, 4156a820feb5SDavid Sterba false); 415779787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 415879787eaaSJeff Mahoney err = PTR_ERR(fs_root); 4159ca1aa281SJosef Bacik list_add_tail(&reloc_root->root_list, &reloc_roots); 41601402d17dSXiyu Yang btrfs_end_transaction(trans); 4161fb2d83eeSJosef Bacik goto out_unset; 416279787eaaSJeff Mahoney } 41635d4f98a2SYan Zheng 4164ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 416557a304cfSJosef Bacik ASSERT(err != -EEXIST); 41663c925863SJosef Bacik if (err) { 41673c925863SJosef Bacik list_add_tail(&reloc_root->root_list, &reloc_roots); 41683c925863SJosef Bacik btrfs_put_root(fs_root); 41693c925863SJosef Bacik btrfs_end_transaction(trans); 41703c925863SJosef Bacik goto out_unset; 41713c925863SJosef Bacik } 4172f44deb74SJosef Bacik fs_root->reloc_root = btrfs_grab_root(reloc_root); 417300246528SJosef Bacik btrfs_put_root(fs_root); 41745d4f98a2SYan Zheng } 41755d4f98a2SYan Zheng 41763a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 417779787eaaSJeff Mahoney if (err) 4178fb2d83eeSJosef Bacik goto out_unset; 41795d4f98a2SYan Zheng 41805d4f98a2SYan Zheng merge_reloc_roots(rc); 41815d4f98a2SYan Zheng 41825d4f98a2SYan Zheng unset_reloc_control(rc); 41835d4f98a2SYan Zheng 41847a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 418562b99540SQu Wenruo if (IS_ERR(trans)) { 41863612b495STsutomu Itoh err = PTR_ERR(trans); 41876217b0faSJosef Bacik goto out_clean; 418862b99540SQu Wenruo } 41893a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 41906217b0faSJosef Bacik out_clean: 4191d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4192d2311e69SQu Wenruo if (ret < 0 && !err) 4193d2311e69SQu Wenruo err = ret; 4194fb2d83eeSJosef Bacik out_unset: 4195fb2d83eeSJosef Bacik unset_reloc_control(rc); 4196*907d2710SDavid Sterba out_end: 4197*907d2710SDavid Sterba reloc_chunk_end(fs_info); 41981a0afa0eSJosef Bacik free_reloc_control(rc); 41993612b495STsutomu Itoh out: 4200aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4201aca1bba6SLiu Bo 42025d4f98a2SYan Zheng btrfs_free_path(path); 42035d4f98a2SYan Zheng 42045d4f98a2SYan Zheng if (err == 0) { 42055d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 4206aeb935a4SQu Wenruo fs_root = btrfs_grab_root(fs_info->data_reloc_root); 4207aeb935a4SQu Wenruo ASSERT(fs_root); 420866b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 420900246528SJosef Bacik btrfs_put_root(fs_root); 4210932fd26dSJosef Bacik } 42115d4f98a2SYan Zheng return err; 42125d4f98a2SYan Zheng } 42135d4f98a2SYan Zheng 42145d4f98a2SYan Zheng /* 42155d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 42165d4f98a2SYan Zheng * 42175d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 42185d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 42195d4f98a2SYan Zheng */ 42207bfa9535SNikolay Borisov int btrfs_reloc_clone_csums(struct btrfs_inode *inode, u64 file_pos, u64 len) 42215d4f98a2SYan Zheng { 42227bfa9535SNikolay Borisov struct btrfs_fs_info *fs_info = inode->root->fs_info; 42235d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 42245d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 42255d4f98a2SYan Zheng int ret; 42265d4f98a2SYan Zheng u64 disk_bytenr; 42274577b014SJosef Bacik u64 new_bytenr; 42285d4f98a2SYan Zheng LIST_HEAD(list); 42295d4f98a2SYan Zheng 42307bfa9535SNikolay Borisov ordered = btrfs_lookup_ordered_extent(inode, file_pos); 4231bffe633eSOmar Sandoval BUG_ON(ordered->file_offset != file_pos || ordered->num_bytes != len); 42325d4f98a2SYan Zheng 42337bfa9535SNikolay Borisov disk_bytenr = file_pos + inode->index_cnt; 42340b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4235a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 423679787eaaSJeff Mahoney if (ret) 423779787eaaSJeff Mahoney goto out; 42385d4f98a2SYan Zheng 42395d4f98a2SYan Zheng while (!list_empty(&list)) { 42405d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 42415d4f98a2SYan Zheng list_del_init(&sums->list); 42425d4f98a2SYan Zheng 42434577b014SJosef Bacik /* 42444577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 42454577b014SJosef Bacik * We need to do this because we will read in entire prealloc 42464577b014SJosef Bacik * extents but we may have written to say the middle of the 42474577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 42484577b014SJosef Bacik * the right disk offset. 42494577b014SJosef Bacik * 42504577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 42514577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 42524577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 42534577b014SJosef Bacik * disk length. 42544577b014SJosef Bacik */ 4255bffe633eSOmar Sandoval new_bytenr = ordered->disk_bytenr + sums->bytenr - disk_bytenr; 42564577b014SJosef Bacik sums->bytenr = new_bytenr; 42575d4f98a2SYan Zheng 4258f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 42595d4f98a2SYan Zheng } 426079787eaaSJeff Mahoney out: 42615d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4262411fc6bcSAndi Kleen return ret; 42635d4f98a2SYan Zheng } 42643fd0a558SYan, Zheng 426583d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 42663fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 42673fd0a558SYan, Zheng struct extent_buffer *cow) 42683fd0a558SYan, Zheng { 42690b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 42703fd0a558SYan, Zheng struct reloc_control *rc; 4271a26195a5SQu Wenruo struct btrfs_backref_node *node; 42723fd0a558SYan, Zheng int first_cow = 0; 42733fd0a558SYan, Zheng int level; 427483d4cfd4SJosef Bacik int ret = 0; 42753fd0a558SYan, Zheng 42760b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 42773fd0a558SYan, Zheng if (!rc) 427883d4cfd4SJosef Bacik return 0; 42793fd0a558SYan, Zheng 42803fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 42813fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 42823fd0a558SYan, Zheng 42833fd0a558SYan, Zheng level = btrfs_header_level(buf); 42843fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 42853fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 42863fd0a558SYan, Zheng first_cow = 1; 42873fd0a558SYan, Zheng 42883fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 42893fd0a558SYan, Zheng rc->create_reloc_tree) { 42903fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 42913fd0a558SYan, Zheng 42923fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 42933fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 42943fd0a558SYan, Zheng node->new_bytenr != buf->start); 42953fd0a558SYan, Zheng 4296b0fe7078SQu Wenruo btrfs_backref_drop_node_buffer(node); 429767439dadSDavid Sterba atomic_inc(&cow->refs); 42983fd0a558SYan, Zheng node->eb = cow; 42993fd0a558SYan, Zheng node->new_bytenr = cow->start; 43003fd0a558SYan, Zheng 43013fd0a558SYan, Zheng if (!node->pending) { 43023fd0a558SYan, Zheng list_move_tail(&node->list, 43033fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 43043fd0a558SYan, Zheng node->pending = 1; 43053fd0a558SYan, Zheng } 43063fd0a558SYan, Zheng 43073fd0a558SYan, Zheng if (first_cow) 43089569cc20SQu Wenruo mark_block_processed(rc, node); 43093fd0a558SYan, Zheng 43103fd0a558SYan, Zheng if (first_cow && level > 0) 43113fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 43123fd0a558SYan, Zheng } 43133fd0a558SYan, Zheng 431483d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 43153fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 431683d4cfd4SJosef Bacik return ret; 43173fd0a558SYan, Zheng } 43183fd0a558SYan, Zheng 43193fd0a558SYan, Zheng /* 43203fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 432101327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 43223fd0a558SYan, Zheng */ 4323147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 43243fd0a558SYan, Zheng u64 *bytes_to_reserve) 43253fd0a558SYan, Zheng { 432610995c04SQu Wenruo struct btrfs_root *root = pending->root; 432710995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 43283fd0a558SYan, Zheng 43296282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 43303fd0a558SYan, Zheng return; 43313fd0a558SYan, Zheng 43323fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 43333fd0a558SYan, Zheng return; 43343fd0a558SYan, Zheng 43353fd0a558SYan, Zheng root = root->reloc_root; 43363fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 43373fd0a558SYan, Zheng /* 43383fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 43393fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 43403fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 43413fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 43423fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 43433fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 43443fd0a558SYan, Zheng * tree may use more space than it frees. so we need 43453fd0a558SYan, Zheng * reserve extra space. 43463fd0a558SYan, Zheng */ 43473fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 43483fd0a558SYan, Zheng } 43493fd0a558SYan, Zheng 43503fd0a558SYan, Zheng /* 43513fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 43523fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 4353f44deb74SJosef Bacik * 4354f44deb74SJosef Bacik * This is similar to btrfs_init_reloc_root(), we come out of here with two 4355f44deb74SJosef Bacik * references held on the reloc_root, one for root->reloc_root and one for 4356f44deb74SJosef Bacik * rc->reloc_roots. 43573fd0a558SYan, Zheng */ 435849b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 43593fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 43603fd0a558SYan, Zheng { 43613fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 43623fd0a558SYan, Zheng struct btrfs_root *reloc_root; 43633fd0a558SYan, Zheng struct btrfs_root *new_root; 436410995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 43653fd0a558SYan, Zheng int ret; 43663fd0a558SYan, Zheng 43676282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 436849b25e05SJeff Mahoney return 0; 43693fd0a558SYan, Zheng 43703fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 43713fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 43723fd0a558SYan, Zheng 43733fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 43743fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 43753fd0a558SYan, Zheng rc->block_rsv, 43763a584174SLu Fengqi rc->nodes_relocated, true); 437749b25e05SJeff Mahoney if (ret) 437849b25e05SJeff Mahoney return ret; 43793fd0a558SYan, Zheng } 43803fd0a558SYan, Zheng 43813fd0a558SYan, Zheng new_root = pending->snap; 43823fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 43833fd0a558SYan, Zheng new_root->root_key.objectid); 438449b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 438549b25e05SJeff Mahoney return PTR_ERR(reloc_root); 43863fd0a558SYan, Zheng 4387ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 438857a304cfSJosef Bacik ASSERT(ret != -EEXIST); 43893c925863SJosef Bacik if (ret) { 43903c925863SJosef Bacik /* Pairs with create_reloc_root */ 43913c925863SJosef Bacik btrfs_put_root(reloc_root); 43923c925863SJosef Bacik return ret; 43933c925863SJosef Bacik } 4394f44deb74SJosef Bacik new_root->reloc_root = btrfs_grab_root(reloc_root); 43953fd0a558SYan, Zheng 439649b25e05SJeff Mahoney if (rc->create_reloc_tree) 43973fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 439849b25e05SJeff Mahoney return ret; 43993fd0a558SYan, Zheng } 4400