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" 27c2832898SQu Wenruo #include "subpage.h" 287ae9bd18SNaohiro Aota #include "zoned.h" 2926c2c454SJosef Bacik #include "inode-item.h" 30*f1e5c618SJosef Bacik #include "space-info.h" 315d4f98a2SYan Zheng 325d4f98a2SYan Zheng /* 330c891389SQu Wenruo * Relocation overview 340c891389SQu Wenruo * 350c891389SQu Wenruo * [What does relocation do] 360c891389SQu Wenruo * 370c891389SQu Wenruo * The objective of relocation is to relocate all extents of the target block 380c891389SQu Wenruo * group to other block groups. 390c891389SQu Wenruo * This is utilized by resize (shrink only), profile converting, compacting 400c891389SQu Wenruo * space, or balance routine to spread chunks over devices. 410c891389SQu Wenruo * 420c891389SQu Wenruo * Before | After 430c891389SQu Wenruo * ------------------------------------------------------------------ 440c891389SQu Wenruo * BG A: 10 data extents | BG A: deleted 450c891389SQu Wenruo * BG B: 2 data extents | BG B: 10 data extents (2 old + 8 relocated) 460c891389SQu Wenruo * BG C: 1 extents | BG C: 3 data extents (1 old + 2 relocated) 470c891389SQu Wenruo * 480c891389SQu Wenruo * [How does relocation work] 490c891389SQu Wenruo * 500c891389SQu Wenruo * 1. Mark the target block group read-only 510c891389SQu Wenruo * New extents won't be allocated from the target block group. 520c891389SQu Wenruo * 530c891389SQu Wenruo * 2.1 Record each extent in the target block group 540c891389SQu Wenruo * To build a proper map of extents to be relocated. 550c891389SQu Wenruo * 560c891389SQu Wenruo * 2.2 Build data reloc tree and reloc trees 570c891389SQu Wenruo * Data reloc tree will contain an inode, recording all newly relocated 580c891389SQu Wenruo * data extents. 590c891389SQu Wenruo * There will be only one data reloc tree for one data block group. 600c891389SQu Wenruo * 610c891389SQu Wenruo * Reloc tree will be a special snapshot of its source tree, containing 620c891389SQu Wenruo * relocated tree blocks. 630c891389SQu Wenruo * Each tree referring to a tree block in target block group will get its 640c891389SQu Wenruo * reloc tree built. 650c891389SQu Wenruo * 660c891389SQu Wenruo * 2.3 Swap source tree with its corresponding reloc tree 670c891389SQu Wenruo * Each involved tree only refers to new extents after swap. 680c891389SQu Wenruo * 690c891389SQu Wenruo * 3. Cleanup reloc trees and data reloc tree. 700c891389SQu Wenruo * As old extents in the target block group are still referenced by reloc 710c891389SQu Wenruo * trees, we need to clean them up before really freeing the target block 720c891389SQu Wenruo * group. 730c891389SQu Wenruo * 740c891389SQu Wenruo * The main complexity is in steps 2.2 and 2.3. 750c891389SQu Wenruo * 760c891389SQu Wenruo * The entry point of relocation is relocate_block_group() function. 770c891389SQu Wenruo */ 780c891389SQu Wenruo 790647bf56SWang Shilong #define RELOCATION_RESERVED_NODES 256 802a979612SQu Wenruo /* 815d4f98a2SYan Zheng * map address of tree root to tree 825d4f98a2SYan Zheng */ 835d4f98a2SYan Zheng struct mapping_node { 84e9a28dc5SQu Wenruo struct { 855d4f98a2SYan Zheng struct rb_node rb_node; 865d4f98a2SYan Zheng u64 bytenr; 87e9a28dc5SQu Wenruo }; /* Use rb_simle_node for search/insert */ 885d4f98a2SYan Zheng void *data; 895d4f98a2SYan Zheng }; 905d4f98a2SYan Zheng 915d4f98a2SYan Zheng struct mapping_tree { 925d4f98a2SYan Zheng struct rb_root rb_root; 935d4f98a2SYan Zheng spinlock_t lock; 945d4f98a2SYan Zheng }; 955d4f98a2SYan Zheng 965d4f98a2SYan Zheng /* 975d4f98a2SYan Zheng * present a tree block to process 985d4f98a2SYan Zheng */ 995d4f98a2SYan Zheng struct tree_block { 100e9a28dc5SQu Wenruo struct { 1015d4f98a2SYan Zheng struct rb_node rb_node; 1025d4f98a2SYan Zheng u64 bytenr; 103e9a28dc5SQu Wenruo }; /* Use rb_simple_node for search/insert */ 104f7ba2d37SJosef Bacik u64 owner; 1055d4f98a2SYan Zheng struct btrfs_key key; 1065d4f98a2SYan Zheng unsigned int level:8; 1075d4f98a2SYan Zheng unsigned int key_ready:1; 1085d4f98a2SYan Zheng }; 1095d4f98a2SYan Zheng 1100257bb82SYan, Zheng #define MAX_EXTENTS 128 1110257bb82SYan, Zheng 1120257bb82SYan, Zheng struct file_extent_cluster { 1130257bb82SYan, Zheng u64 start; 1140257bb82SYan, Zheng u64 end; 1150257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 1160257bb82SYan, Zheng unsigned int nr; 1170257bb82SYan, Zheng }; 1180257bb82SYan, Zheng 1195d4f98a2SYan Zheng struct reloc_control { 1205d4f98a2SYan Zheng /* block group to relocate */ 12132da5386SDavid Sterba struct btrfs_block_group *block_group; 1225d4f98a2SYan Zheng /* extent tree */ 1235d4f98a2SYan Zheng struct btrfs_root *extent_root; 1245d4f98a2SYan Zheng /* inode for moving data */ 1255d4f98a2SYan Zheng struct inode *data_inode; 1263fd0a558SYan, Zheng 1273fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 1283fd0a558SYan, Zheng 129a26195a5SQu Wenruo struct btrfs_backref_cache backref_cache; 1303fd0a558SYan, Zheng 1313fd0a558SYan, Zheng struct file_extent_cluster cluster; 1325d4f98a2SYan Zheng /* tree blocks have been processed */ 1335d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 1345d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 1355d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 1365d4f98a2SYan Zheng /* list of reloc trees */ 1375d4f98a2SYan Zheng struct list_head reloc_roots; 138d2311e69SQu Wenruo /* list of subvolume trees that get relocated */ 139d2311e69SQu Wenruo struct list_head dirty_subvol_roots; 1403fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 1413fd0a558SYan, Zheng u64 merging_rsv_size; 1423fd0a558SYan, Zheng /* size of relocated tree nodes */ 1433fd0a558SYan, Zheng u64 nodes_relocated; 1440647bf56SWang Shilong /* reserved size for block group relocation*/ 1450647bf56SWang Shilong u64 reserved_bytes; 1463fd0a558SYan, Zheng 1475d4f98a2SYan Zheng u64 search_start; 1485d4f98a2SYan Zheng u64 extents_found; 1493fd0a558SYan, Zheng 1503fd0a558SYan, Zheng unsigned int stage:8; 1513fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 1523fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 1535d4f98a2SYan Zheng unsigned int found_file_extent:1; 1545d4f98a2SYan Zheng }; 1555d4f98a2SYan Zheng 1565d4f98a2SYan Zheng /* stages of data relocation */ 1575d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 1585d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 1595d4f98a2SYan Zheng 1609569cc20SQu Wenruo static void mark_block_processed(struct reloc_control *rc, 161a26195a5SQu Wenruo struct btrfs_backref_node *node) 1629569cc20SQu Wenruo { 1639569cc20SQu Wenruo u32 blocksize; 1649569cc20SQu Wenruo 1659569cc20SQu Wenruo if (node->level == 0 || 1669569cc20SQu Wenruo in_range(node->bytenr, rc->block_group->start, 1679569cc20SQu Wenruo rc->block_group->length)) { 1689569cc20SQu Wenruo blocksize = rc->extent_root->fs_info->nodesize; 1699569cc20SQu Wenruo set_extent_bits(&rc->processed_blocks, node->bytenr, 1709569cc20SQu Wenruo node->bytenr + blocksize - 1, EXTENT_DIRTY); 1719569cc20SQu Wenruo } 1729569cc20SQu Wenruo node->processed = 1; 1739569cc20SQu Wenruo } 1749569cc20SQu Wenruo 1755d4f98a2SYan Zheng 1765d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 1775d4f98a2SYan Zheng { 1786bef4d31SEric Paris tree->rb_root = RB_ROOT; 1795d4f98a2SYan Zheng spin_lock_init(&tree->lock); 1805d4f98a2SYan Zheng } 1815d4f98a2SYan Zheng 1825d4f98a2SYan Zheng /* 1835d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 1845d4f98a2SYan Zheng */ 185a26195a5SQu Wenruo static struct btrfs_backref_node *walk_up_backref( 186a26195a5SQu Wenruo struct btrfs_backref_node *node, 187a26195a5SQu Wenruo struct btrfs_backref_edge *edges[], int *index) 1885d4f98a2SYan Zheng { 189a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 1905d4f98a2SYan Zheng int idx = *index; 1915d4f98a2SYan Zheng 1925d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 1935d4f98a2SYan Zheng edge = list_entry(node->upper.next, 194a26195a5SQu Wenruo struct btrfs_backref_edge, list[LOWER]); 1955d4f98a2SYan Zheng edges[idx++] = edge; 1965d4f98a2SYan Zheng node = edge->node[UPPER]; 1975d4f98a2SYan Zheng } 1983fd0a558SYan, Zheng BUG_ON(node->detached); 1995d4f98a2SYan Zheng *index = idx; 2005d4f98a2SYan Zheng return node; 2015d4f98a2SYan Zheng } 2025d4f98a2SYan Zheng 2035d4f98a2SYan Zheng /* 2045d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 2055d4f98a2SYan Zheng */ 206a26195a5SQu Wenruo static struct btrfs_backref_node *walk_down_backref( 207a26195a5SQu Wenruo struct btrfs_backref_edge *edges[], int *index) 2085d4f98a2SYan Zheng { 209a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 210a26195a5SQu Wenruo struct btrfs_backref_node *lower; 2115d4f98a2SYan Zheng int idx = *index; 2125d4f98a2SYan Zheng 2135d4f98a2SYan Zheng while (idx > 0) { 2145d4f98a2SYan Zheng edge = edges[idx - 1]; 2155d4f98a2SYan Zheng lower = edge->node[LOWER]; 2165d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 2175d4f98a2SYan Zheng idx--; 2185d4f98a2SYan Zheng continue; 2195d4f98a2SYan Zheng } 2205d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 221a26195a5SQu Wenruo struct btrfs_backref_edge, list[LOWER]); 2225d4f98a2SYan Zheng edges[idx - 1] = edge; 2235d4f98a2SYan Zheng *index = idx; 2245d4f98a2SYan Zheng return edge->node[UPPER]; 2255d4f98a2SYan Zheng } 2265d4f98a2SYan Zheng *index = 0; 2275d4f98a2SYan Zheng return NULL; 2285d4f98a2SYan Zheng } 2295d4f98a2SYan Zheng 230a26195a5SQu Wenruo static void update_backref_node(struct btrfs_backref_cache *cache, 231a26195a5SQu Wenruo struct btrfs_backref_node *node, u64 bytenr) 2323fd0a558SYan, Zheng { 2333fd0a558SYan, Zheng struct rb_node *rb_node; 2343fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 2353fd0a558SYan, Zheng node->bytenr = bytenr; 236e9a28dc5SQu Wenruo rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node); 23743c04fb1SJeff Mahoney if (rb_node) 238982c92cbSQu Wenruo btrfs_backref_panic(cache->fs_info, bytenr, -EEXIST); 2393fd0a558SYan, Zheng } 2403fd0a558SYan, Zheng 2413fd0a558SYan, Zheng /* 2423fd0a558SYan, Zheng * update backref cache after a transaction commit 2433fd0a558SYan, Zheng */ 2443fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 245a26195a5SQu Wenruo struct btrfs_backref_cache *cache) 2463fd0a558SYan, Zheng { 247a26195a5SQu Wenruo struct btrfs_backref_node *node; 2483fd0a558SYan, Zheng int level = 0; 2493fd0a558SYan, Zheng 2503fd0a558SYan, Zheng if (cache->last_trans == 0) { 2513fd0a558SYan, Zheng cache->last_trans = trans->transid; 2523fd0a558SYan, Zheng return 0; 2533fd0a558SYan, Zheng } 2543fd0a558SYan, Zheng 2553fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 2563fd0a558SYan, Zheng return 0; 2573fd0a558SYan, Zheng 2583fd0a558SYan, Zheng /* 2593fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 2603fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 2613fd0a558SYan, Zheng * so the detached nodes are no longer useful. 2623fd0a558SYan, Zheng */ 2633fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2643fd0a558SYan, Zheng node = list_entry(cache->detached.next, 265a26195a5SQu Wenruo struct btrfs_backref_node, list); 266023acb07SQu Wenruo btrfs_backref_cleanup_node(cache, node); 2673fd0a558SYan, Zheng } 2683fd0a558SYan, Zheng 2693fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 2703fd0a558SYan, Zheng node = list_entry(cache->changed.next, 271a26195a5SQu Wenruo struct btrfs_backref_node, list); 2723fd0a558SYan, Zheng list_del_init(&node->list); 2733fd0a558SYan, Zheng BUG_ON(node->pending); 2743fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 2753fd0a558SYan, Zheng } 2763fd0a558SYan, Zheng 2773fd0a558SYan, Zheng /* 2783fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 2793fd0a558SYan, Zheng * errors during processing the pending nodes. 2803fd0a558SYan, Zheng */ 2813fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 2823fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 2833fd0a558SYan, Zheng BUG_ON(!node->pending); 2843fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 2853fd0a558SYan, Zheng continue; 2863fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 2873fd0a558SYan, Zheng } 2883fd0a558SYan, Zheng } 2893fd0a558SYan, Zheng 2903fd0a558SYan, Zheng cache->last_trans = 0; 2913fd0a558SYan, Zheng return 1; 2923fd0a558SYan, Zheng } 2933fd0a558SYan, Zheng 2946282675eSQu Wenruo static bool reloc_root_is_dead(struct btrfs_root *root) 2956282675eSQu Wenruo { 2966282675eSQu Wenruo /* 2976282675eSQu Wenruo * Pair with set_bit/clear_bit in clean_dirty_subvols and 2986282675eSQu Wenruo * btrfs_update_reloc_root. We need to see the updated bit before 2996282675eSQu Wenruo * trying to access reloc_root 3006282675eSQu Wenruo */ 3016282675eSQu Wenruo smp_rmb(); 3026282675eSQu Wenruo if (test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state)) 3036282675eSQu Wenruo return true; 3046282675eSQu Wenruo return false; 3056282675eSQu Wenruo } 3066282675eSQu Wenruo 3076282675eSQu Wenruo /* 3086282675eSQu Wenruo * Check if this subvolume tree has valid reloc tree. 3096282675eSQu Wenruo * 3106282675eSQu Wenruo * Reloc tree after swap is considered dead, thus not considered as valid. 3116282675eSQu Wenruo * This is enough for most callers, as they don't distinguish dead reloc root 31255465730SQu Wenruo * from no reloc root. But btrfs_should_ignore_reloc_root() below is a 31355465730SQu Wenruo * special case. 3146282675eSQu Wenruo */ 3156282675eSQu Wenruo static bool have_reloc_root(struct btrfs_root *root) 3166282675eSQu Wenruo { 3176282675eSQu Wenruo if (reloc_root_is_dead(root)) 3186282675eSQu Wenruo return false; 3196282675eSQu Wenruo if (!root->reloc_root) 3206282675eSQu Wenruo return false; 3216282675eSQu Wenruo return true; 3226282675eSQu Wenruo } 323f2a97a9dSDavid Sterba 32455465730SQu Wenruo int btrfs_should_ignore_reloc_root(struct btrfs_root *root) 3253fd0a558SYan, Zheng { 3263fd0a558SYan, Zheng struct btrfs_root *reloc_root; 3273fd0a558SYan, Zheng 32892a7cc42SQu Wenruo if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) 3293fd0a558SYan, Zheng return 0; 3303fd0a558SYan, Zheng 3316282675eSQu Wenruo /* This root has been merged with its reloc tree, we can ignore it */ 3326282675eSQu Wenruo if (reloc_root_is_dead(root)) 3336282675eSQu Wenruo return 1; 3346282675eSQu Wenruo 3353fd0a558SYan, Zheng reloc_root = root->reloc_root; 3363fd0a558SYan, Zheng if (!reloc_root) 3373fd0a558SYan, Zheng return 0; 3383fd0a558SYan, Zheng 3394d4225fcSJosef Bacik if (btrfs_header_generation(reloc_root->commit_root) == 3404d4225fcSJosef Bacik root->fs_info->running_transaction->transid) 3413fd0a558SYan, Zheng return 0; 3423fd0a558SYan, Zheng /* 3433fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 3443fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 3453fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 3463fd0a558SYan, Zheng * relocation. 3473fd0a558SYan, Zheng */ 3483fd0a558SYan, Zheng return 1; 3493fd0a558SYan, Zheng } 35055465730SQu Wenruo 3515d4f98a2SYan Zheng /* 3525d4f98a2SYan Zheng * find reloc tree by address of tree root 3535d4f98a2SYan Zheng */ 3542433bea5SQu Wenruo struct btrfs_root *find_reloc_root(struct btrfs_fs_info *fs_info, u64 bytenr) 3555d4f98a2SYan Zheng { 3562433bea5SQu Wenruo struct reloc_control *rc = fs_info->reloc_ctl; 3575d4f98a2SYan Zheng struct rb_node *rb_node; 3585d4f98a2SYan Zheng struct mapping_node *node; 3595d4f98a2SYan Zheng struct btrfs_root *root = NULL; 3605d4f98a2SYan Zheng 3612433bea5SQu Wenruo ASSERT(rc); 3625d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 363e9a28dc5SQu Wenruo rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, bytenr); 3645d4f98a2SYan Zheng if (rb_node) { 3655d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 3660d031dc4SYu Zhe root = node->data; 3675d4f98a2SYan Zheng } 3685d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 36900246528SJosef Bacik return btrfs_grab_root(root); 3705d4f98a2SYan Zheng } 3715d4f98a2SYan Zheng 3725d4f98a2SYan Zheng /* 37329db137bSQu Wenruo * For useless nodes, do two major clean ups: 37429db137bSQu Wenruo * 37529db137bSQu Wenruo * - Cleanup the children edges and nodes 37629db137bSQu Wenruo * If child node is also orphan (no parent) during cleanup, then the child 37729db137bSQu Wenruo * node will also be cleaned up. 37829db137bSQu Wenruo * 37929db137bSQu Wenruo * - Freeing up leaves (level 0), keeps nodes detached 38029db137bSQu Wenruo * For nodes, the node is still cached as "detached" 38129db137bSQu Wenruo * 38229db137bSQu Wenruo * Return false if @node is not in the @useless_nodes list. 38329db137bSQu Wenruo * Return true if @node is in the @useless_nodes list. 38429db137bSQu Wenruo */ 38529db137bSQu Wenruo static bool handle_useless_nodes(struct reloc_control *rc, 386a26195a5SQu Wenruo struct btrfs_backref_node *node) 38729db137bSQu Wenruo { 388a26195a5SQu Wenruo struct btrfs_backref_cache *cache = &rc->backref_cache; 38929db137bSQu Wenruo struct list_head *useless_node = &cache->useless_node; 39029db137bSQu Wenruo bool ret = false; 39129db137bSQu Wenruo 39229db137bSQu Wenruo while (!list_empty(useless_node)) { 393a26195a5SQu Wenruo struct btrfs_backref_node *cur; 39429db137bSQu Wenruo 395a26195a5SQu Wenruo cur = list_first_entry(useless_node, struct btrfs_backref_node, 39629db137bSQu Wenruo list); 39729db137bSQu Wenruo list_del_init(&cur->list); 39829db137bSQu Wenruo 39929db137bSQu Wenruo /* Only tree root nodes can be added to @useless_nodes */ 40029db137bSQu Wenruo ASSERT(list_empty(&cur->upper)); 40129db137bSQu Wenruo 40229db137bSQu Wenruo if (cur == node) 40329db137bSQu Wenruo ret = true; 40429db137bSQu Wenruo 40529db137bSQu Wenruo /* The node is the lowest node */ 40629db137bSQu Wenruo if (cur->lowest) { 40729db137bSQu Wenruo list_del_init(&cur->lower); 40829db137bSQu Wenruo cur->lowest = 0; 40929db137bSQu Wenruo } 41029db137bSQu Wenruo 41129db137bSQu Wenruo /* Cleanup the lower edges */ 41229db137bSQu Wenruo while (!list_empty(&cur->lower)) { 413a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 414a26195a5SQu Wenruo struct btrfs_backref_node *lower; 41529db137bSQu Wenruo 41629db137bSQu Wenruo edge = list_entry(cur->lower.next, 417a26195a5SQu Wenruo struct btrfs_backref_edge, list[UPPER]); 41829db137bSQu Wenruo list_del(&edge->list[UPPER]); 41929db137bSQu Wenruo list_del(&edge->list[LOWER]); 42029db137bSQu Wenruo lower = edge->node[LOWER]; 421741188d3SQu Wenruo btrfs_backref_free_edge(cache, edge); 42229db137bSQu Wenruo 42329db137bSQu Wenruo /* Child node is also orphan, queue for cleanup */ 42429db137bSQu Wenruo if (list_empty(&lower->upper)) 42529db137bSQu Wenruo list_add(&lower->list, useless_node); 42629db137bSQu Wenruo } 42729db137bSQu Wenruo /* Mark this block processed for relocation */ 42829db137bSQu Wenruo mark_block_processed(rc, cur); 42929db137bSQu Wenruo 43029db137bSQu Wenruo /* 43129db137bSQu Wenruo * Backref nodes for tree leaves are deleted from the cache. 43229db137bSQu Wenruo * Backref nodes for upper level tree blocks are left in the 43329db137bSQu Wenruo * cache to avoid unnecessary backref lookup. 43429db137bSQu Wenruo */ 43529db137bSQu Wenruo if (cur->level > 0) { 43629db137bSQu Wenruo list_add(&cur->list, &cache->detached); 43729db137bSQu Wenruo cur->detached = 1; 43829db137bSQu Wenruo } else { 43929db137bSQu Wenruo rb_erase(&cur->rb_node, &cache->rb_root); 440741188d3SQu Wenruo btrfs_backref_free_node(cache, cur); 44129db137bSQu Wenruo } 44229db137bSQu Wenruo } 44329db137bSQu Wenruo return ret; 44429db137bSQu Wenruo } 44529db137bSQu Wenruo 44629db137bSQu Wenruo /* 447e7d571c7SQu Wenruo * Build backref tree for a given tree block. Root of the backref tree 448e7d571c7SQu Wenruo * corresponds the tree block, leaves of the backref tree correspond roots of 449e7d571c7SQu Wenruo * b-trees that reference the tree block. 450e7d571c7SQu Wenruo * 451e7d571c7SQu Wenruo * The basic idea of this function is check backrefs of a given block to find 452e7d571c7SQu Wenruo * upper level blocks that reference the block, and then check backrefs of 453e7d571c7SQu Wenruo * these upper level blocks recursively. The recursion stops when tree root is 454e7d571c7SQu Wenruo * reached or backrefs for the block is cached. 455e7d571c7SQu Wenruo * 456e7d571c7SQu Wenruo * NOTE: if we find that backrefs for a block are cached, we know backrefs for 457e7d571c7SQu Wenruo * all upper level blocks that directly/indirectly reference the block are also 458e7d571c7SQu Wenruo * cached. 459e7d571c7SQu Wenruo */ 460a26195a5SQu Wenruo static noinline_for_stack struct btrfs_backref_node *build_backref_tree( 461e7d571c7SQu Wenruo struct reloc_control *rc, struct btrfs_key *node_key, 462e7d571c7SQu Wenruo int level, u64 bytenr) 463e7d571c7SQu Wenruo { 464e7d571c7SQu Wenruo struct btrfs_backref_iter *iter; 465a26195a5SQu Wenruo struct btrfs_backref_cache *cache = &rc->backref_cache; 466e7d571c7SQu Wenruo /* For searching parent of TREE_BLOCK_REF */ 467e7d571c7SQu Wenruo struct btrfs_path *path; 468a26195a5SQu Wenruo struct btrfs_backref_node *cur; 469a26195a5SQu Wenruo struct btrfs_backref_node *node = NULL; 470a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 471e7d571c7SQu Wenruo int ret; 472e7d571c7SQu Wenruo int err = 0; 473e7d571c7SQu Wenruo 474e7d571c7SQu Wenruo iter = btrfs_backref_iter_alloc(rc->extent_root->fs_info, GFP_NOFS); 475e7d571c7SQu Wenruo if (!iter) 476e7d571c7SQu Wenruo return ERR_PTR(-ENOMEM); 477e7d571c7SQu Wenruo path = btrfs_alloc_path(); 478e7d571c7SQu Wenruo if (!path) { 479e7d571c7SQu Wenruo err = -ENOMEM; 480e7d571c7SQu Wenruo goto out; 481e7d571c7SQu Wenruo } 482e7d571c7SQu Wenruo 483b1818dabSQu Wenruo node = btrfs_backref_alloc_node(cache, bytenr, level); 484e7d571c7SQu Wenruo if (!node) { 485e7d571c7SQu Wenruo err = -ENOMEM; 486e7d571c7SQu Wenruo goto out; 487e7d571c7SQu Wenruo } 488e7d571c7SQu Wenruo 489e7d571c7SQu Wenruo node->lowest = 1; 490e7d571c7SQu Wenruo cur = node; 491e7d571c7SQu Wenruo 492e7d571c7SQu Wenruo /* Breadth-first search to build backref cache */ 493e7d571c7SQu Wenruo do { 4941b60d2ecSQu Wenruo ret = btrfs_backref_add_tree_node(cache, path, iter, node_key, 4951b60d2ecSQu Wenruo cur); 496e7d571c7SQu Wenruo if (ret < 0) { 497e7d571c7SQu Wenruo err = ret; 498e7d571c7SQu Wenruo goto out; 499e7d571c7SQu Wenruo } 500e7d571c7SQu Wenruo edge = list_first_entry_or_null(&cache->pending_edge, 501a26195a5SQu Wenruo struct btrfs_backref_edge, list[UPPER]); 502e7d571c7SQu Wenruo /* 503e7d571c7SQu Wenruo * The pending list isn't empty, take the first block to 504e7d571c7SQu Wenruo * process 505e7d571c7SQu Wenruo */ 506e7d571c7SQu Wenruo if (edge) { 5075d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 5085d4f98a2SYan Zheng cur = edge->node[UPPER]; 5095d4f98a2SYan Zheng } 510e7d571c7SQu Wenruo } while (edge); 5115d4f98a2SYan Zheng 5121f872924SQu Wenruo /* Finish the upper linkage of newly added edges/nodes */ 513fc997ed0SQu Wenruo ret = btrfs_backref_finish_upper_links(cache, node); 5141f872924SQu Wenruo if (ret < 0) { 5151f872924SQu Wenruo err = ret; 51675bfb9afSJosef Bacik goto out; 51775bfb9afSJosef Bacik } 51875bfb9afSJosef Bacik 51929db137bSQu Wenruo if (handle_useless_nodes(rc, node)) 5203fd0a558SYan, Zheng node = NULL; 5215d4f98a2SYan Zheng out: 52271f572a9SQu Wenruo btrfs_backref_iter_free(iter); 52371f572a9SQu Wenruo btrfs_free_path(path); 5245d4f98a2SYan Zheng if (err) { 5251b23ea18SQu Wenruo btrfs_backref_error_cleanup(cache, node); 5265d4f98a2SYan Zheng return ERR_PTR(err); 5275d4f98a2SYan Zheng } 52875bfb9afSJosef Bacik ASSERT(!node || !node->detached); 52984780289SQu Wenruo ASSERT(list_empty(&cache->useless_node) && 53084780289SQu Wenruo list_empty(&cache->pending_edge)); 5315d4f98a2SYan Zheng return node; 5325d4f98a2SYan Zheng } 5335d4f98a2SYan Zheng 5345d4f98a2SYan Zheng /* 5353fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 5363fd0a558SYan, Zheng * the backref node is created by cloning backref node that 5373fd0a558SYan, Zheng * corresponds to root of source tree 5383fd0a558SYan, Zheng */ 5393fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 5403fd0a558SYan, Zheng struct reloc_control *rc, 5413fd0a558SYan, Zheng struct btrfs_root *src, 5423fd0a558SYan, Zheng struct btrfs_root *dest) 5433fd0a558SYan, Zheng { 5443fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 545a26195a5SQu Wenruo struct btrfs_backref_cache *cache = &rc->backref_cache; 546a26195a5SQu Wenruo struct btrfs_backref_node *node = NULL; 547a26195a5SQu Wenruo struct btrfs_backref_node *new_node; 548a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 549a26195a5SQu Wenruo struct btrfs_backref_edge *new_edge; 5503fd0a558SYan, Zheng struct rb_node *rb_node; 5513fd0a558SYan, Zheng 5523fd0a558SYan, Zheng if (cache->last_trans > 0) 5533fd0a558SYan, Zheng update_backref_cache(trans, cache); 5543fd0a558SYan, Zheng 555e9a28dc5SQu Wenruo rb_node = rb_simple_search(&cache->rb_root, src->commit_root->start); 5563fd0a558SYan, Zheng if (rb_node) { 557a26195a5SQu Wenruo node = rb_entry(rb_node, struct btrfs_backref_node, rb_node); 5583fd0a558SYan, Zheng if (node->detached) 5593fd0a558SYan, Zheng node = NULL; 5603fd0a558SYan, Zheng else 5613fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 5623fd0a558SYan, Zheng } 5633fd0a558SYan, Zheng 5643fd0a558SYan, Zheng if (!node) { 565e9a28dc5SQu Wenruo rb_node = rb_simple_search(&cache->rb_root, 5663fd0a558SYan, Zheng reloc_root->commit_root->start); 5673fd0a558SYan, Zheng if (rb_node) { 568a26195a5SQu Wenruo node = rb_entry(rb_node, struct btrfs_backref_node, 5693fd0a558SYan, Zheng rb_node); 5703fd0a558SYan, Zheng BUG_ON(node->detached); 5713fd0a558SYan, Zheng } 5723fd0a558SYan, Zheng } 5733fd0a558SYan, Zheng 5743fd0a558SYan, Zheng if (!node) 5753fd0a558SYan, Zheng return 0; 5763fd0a558SYan, Zheng 577b1818dabSQu Wenruo new_node = btrfs_backref_alloc_node(cache, dest->node->start, 578b1818dabSQu Wenruo node->level); 5793fd0a558SYan, Zheng if (!new_node) 5803fd0a558SYan, Zheng return -ENOMEM; 5813fd0a558SYan, Zheng 5823fd0a558SYan, Zheng new_node->lowest = node->lowest; 5836848ad64SYan, Zheng new_node->checked = 1; 58400246528SJosef Bacik new_node->root = btrfs_grab_root(dest); 5850b530bc5SJosef Bacik ASSERT(new_node->root); 5863fd0a558SYan, Zheng 5873fd0a558SYan, Zheng if (!node->lowest) { 5883fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 58947254d07SQu Wenruo new_edge = btrfs_backref_alloc_edge(cache); 5903fd0a558SYan, Zheng if (!new_edge) 5913fd0a558SYan, Zheng goto fail; 5923fd0a558SYan, Zheng 593f39911e5SQu Wenruo btrfs_backref_link_edge(new_edge, edge->node[LOWER], 594f39911e5SQu Wenruo new_node, LINK_UPPER); 5953fd0a558SYan, Zheng } 59676b9e23dSMiao Xie } else { 59776b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 5983fd0a558SYan, Zheng } 5993fd0a558SYan, Zheng 600e9a28dc5SQu Wenruo rb_node = rb_simple_insert(&cache->rb_root, new_node->bytenr, 6013fd0a558SYan, Zheng &new_node->rb_node); 60243c04fb1SJeff Mahoney if (rb_node) 603982c92cbSQu Wenruo btrfs_backref_panic(trans->fs_info, new_node->bytenr, -EEXIST); 6043fd0a558SYan, Zheng 6053fd0a558SYan, Zheng if (!new_node->lowest) { 6063fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 6073fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 6083fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 6093fd0a558SYan, Zheng } 6103fd0a558SYan, Zheng } 6113fd0a558SYan, Zheng return 0; 6123fd0a558SYan, Zheng fail: 6133fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 6143fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 615a26195a5SQu Wenruo struct btrfs_backref_edge, list[UPPER]); 6163fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 617741188d3SQu Wenruo btrfs_backref_free_edge(cache, new_edge); 6183fd0a558SYan, Zheng } 619741188d3SQu Wenruo btrfs_backref_free_node(cache, new_node); 6203fd0a558SYan, Zheng return -ENOMEM; 6213fd0a558SYan, Zheng } 6223fd0a558SYan, Zheng 6233fd0a558SYan, Zheng /* 6245d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 6255d4f98a2SYan Zheng */ 626ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 6275d4f98a2SYan Zheng { 6280b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 6295d4f98a2SYan Zheng struct rb_node *rb_node; 6305d4f98a2SYan Zheng struct mapping_node *node; 6310b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 6325d4f98a2SYan Zheng 6335d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 634ffd7b339SJeff Mahoney if (!node) 635ffd7b339SJeff Mahoney return -ENOMEM; 6365d4f98a2SYan Zheng 637ea287ab1SJosef Bacik node->bytenr = root->commit_root->start; 6385d4f98a2SYan Zheng node->data = root; 6395d4f98a2SYan Zheng 6405d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 641e9a28dc5SQu Wenruo rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, 6425d4f98a2SYan Zheng node->bytenr, &node->rb_node); 6435d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 644ffd7b339SJeff Mahoney if (rb_node) { 64557a304cfSJosef Bacik btrfs_err(fs_info, 6465d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 6475d163e0eSJeff Mahoney node->bytenr); 64857a304cfSJosef Bacik return -EEXIST; 649ffd7b339SJeff Mahoney } 6505d4f98a2SYan Zheng 6515d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 6525d4f98a2SYan Zheng return 0; 6535d4f98a2SYan Zheng } 6545d4f98a2SYan Zheng 6555d4f98a2SYan Zheng /* 656c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 6575d4f98a2SYan Zheng * mapping 6585d4f98a2SYan Zheng */ 659c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 6605d4f98a2SYan Zheng { 6610b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 6625d4f98a2SYan Zheng struct rb_node *rb_node; 6635d4f98a2SYan Zheng struct mapping_node *node = NULL; 6640b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 665f44deb74SJosef Bacik bool put_ref = false; 6665d4f98a2SYan Zheng 66765c6e82bSQu Wenruo if (rc && root->node) { 6685d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 669e9a28dc5SQu Wenruo rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, 670ea287ab1SJosef Bacik root->commit_root->start); 671c974c464SWang Shilong if (rb_node) { 672c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 673c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 674ea287ab1SJosef Bacik RB_CLEAR_NODE(&node->rb_node); 675c974c464SWang Shilong } 676c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 677c78a10aeSJosef Bacik ASSERT(!node || (struct btrfs_root *)node->data == root); 678389305b2SQu Wenruo } 679c974c464SWang Shilong 680f44deb74SJosef Bacik /* 681f44deb74SJosef Bacik * We only put the reloc root here if it's on the list. There's a lot 682f44deb74SJosef Bacik * of places where the pattern is to splice the rc->reloc_roots, process 683f44deb74SJosef Bacik * the reloc roots, and then add the reloc root back onto 684f44deb74SJosef Bacik * rc->reloc_roots. If we call __del_reloc_root while it's off of the 685f44deb74SJosef Bacik * list we don't want the reference being dropped, because the guy 686f44deb74SJosef Bacik * messing with the list is in charge of the reference. 687f44deb74SJosef Bacik */ 6880b246afaSJeff Mahoney spin_lock(&fs_info->trans_lock); 689f44deb74SJosef Bacik if (!list_empty(&root->root_list)) { 690f44deb74SJosef Bacik put_ref = true; 691c974c464SWang Shilong list_del_init(&root->root_list); 692f44deb74SJosef Bacik } 6930b246afaSJeff Mahoney spin_unlock(&fs_info->trans_lock); 694f44deb74SJosef Bacik if (put_ref) 695f44deb74SJosef Bacik btrfs_put_root(root); 696c974c464SWang Shilong kfree(node); 697c974c464SWang Shilong } 698c974c464SWang Shilong 699c974c464SWang Shilong /* 700c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 701c974c464SWang Shilong * mapping 702c974c464SWang Shilong */ 703ea287ab1SJosef Bacik static int __update_reloc_root(struct btrfs_root *root) 704c974c464SWang Shilong { 7050b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 706c974c464SWang Shilong struct rb_node *rb_node; 707c974c464SWang Shilong struct mapping_node *node = NULL; 7080b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 709c974c464SWang Shilong 710c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 711e9a28dc5SQu Wenruo rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, 712ea287ab1SJosef Bacik root->commit_root->start); 7135d4f98a2SYan Zheng if (rb_node) { 7145d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 7155d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 7165d4f98a2SYan Zheng } 7175d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 7185d4f98a2SYan Zheng 7198f71f3e0SLiu Bo if (!node) 7208f71f3e0SLiu Bo return 0; 7215d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 7225d4f98a2SYan Zheng 7235d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 724ea287ab1SJosef Bacik node->bytenr = root->node->start; 725e9a28dc5SQu Wenruo rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, 7265d4f98a2SYan Zheng node->bytenr, &node->rb_node); 7275d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 72843c04fb1SJeff Mahoney if (rb_node) 729982c92cbSQu Wenruo btrfs_backref_panic(fs_info, node->bytenr, -EEXIST); 7305d4f98a2SYan Zheng return 0; 7315d4f98a2SYan Zheng } 7325d4f98a2SYan Zheng 7333fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 7343fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 7355d4f98a2SYan Zheng { 7360b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 7375d4f98a2SYan Zheng struct btrfs_root *reloc_root; 7385d4f98a2SYan Zheng struct extent_buffer *eb; 7395d4f98a2SYan Zheng struct btrfs_root_item *root_item; 7405d4f98a2SYan Zheng struct btrfs_key root_key; 74184c50ba5SJosef Bacik int ret = 0; 74284c50ba5SJosef Bacik bool must_abort = false; 7435d4f98a2SYan Zheng 7445d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 74584c50ba5SJosef Bacik if (!root_item) 74684c50ba5SJosef Bacik return ERR_PTR(-ENOMEM); 7475d4f98a2SYan Zheng 7485d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 7495d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 7503fd0a558SYan, Zheng root_key.offset = objectid; 7515d4f98a2SYan Zheng 7523fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 753054570a1SFilipe Manana u64 commit_root_gen; 754054570a1SFilipe Manana 7553fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 7565d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 7575d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 75884c50ba5SJosef Bacik if (ret) 75984c50ba5SJosef Bacik goto fail; 76084c50ba5SJosef Bacik 761054570a1SFilipe Manana /* 762054570a1SFilipe Manana * Set the last_snapshot field to the generation of the commit 763054570a1SFilipe Manana * root - like this ctree.c:btrfs_block_can_be_shared() behaves 764054570a1SFilipe Manana * correctly (returns true) when the relocation root is created 765054570a1SFilipe Manana * either inside the critical section of a transaction commit 766054570a1SFilipe Manana * (through transaction.c:qgroup_account_snapshot()) and when 767054570a1SFilipe Manana * it's created before the transaction commit is started. 768054570a1SFilipe Manana */ 769054570a1SFilipe Manana commit_root_gen = btrfs_header_generation(root->commit_root); 770054570a1SFilipe Manana btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); 7713fd0a558SYan, Zheng } else { 7723fd0a558SYan, Zheng /* 7733fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 7743fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 7753fd0a558SYan, Zheng * modified after it was created have RELOC flag 7763fd0a558SYan, Zheng * set in their headers. so it's OK to not update 7773fd0a558SYan, Zheng * the 'last_snapshot'. 7783fd0a558SYan, Zheng */ 7793fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 7803fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 78184c50ba5SJosef Bacik if (ret) 78284c50ba5SJosef Bacik goto fail; 7833fd0a558SYan, Zheng } 7843fd0a558SYan, Zheng 78584c50ba5SJosef Bacik /* 78684c50ba5SJosef Bacik * We have changed references at this point, we must abort the 78784c50ba5SJosef Bacik * transaction if anything fails. 78884c50ba5SJosef Bacik */ 78984c50ba5SJosef Bacik must_abort = true; 79084c50ba5SJosef Bacik 7915d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 7925d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 7935d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 7945d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 7953fd0a558SYan, Zheng 7963fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 7973fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 7983fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 7993fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 800c8422684SDavid Sterba btrfs_set_root_drop_level(root_item, 0); 8013fd0a558SYan, Zheng } 8025d4f98a2SYan Zheng 8035d4f98a2SYan Zheng btrfs_tree_unlock(eb); 8045d4f98a2SYan Zheng free_extent_buffer(eb); 8055d4f98a2SYan Zheng 8060b246afaSJeff Mahoney ret = btrfs_insert_root(trans, fs_info->tree_root, 8075d4f98a2SYan Zheng &root_key, root_item); 80884c50ba5SJosef Bacik if (ret) 80984c50ba5SJosef Bacik goto fail; 81084c50ba5SJosef Bacik 8115d4f98a2SYan Zheng kfree(root_item); 8125d4f98a2SYan Zheng 8133dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(fs_info->tree_root, &root_key); 81484c50ba5SJosef Bacik if (IS_ERR(reloc_root)) { 81584c50ba5SJosef Bacik ret = PTR_ERR(reloc_root); 81684c50ba5SJosef Bacik goto abort; 81784c50ba5SJosef Bacik } 81892a7cc42SQu Wenruo set_bit(BTRFS_ROOT_SHAREABLE, &reloc_root->state); 8195d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 8203fd0a558SYan, Zheng return reloc_root; 82184c50ba5SJosef Bacik fail: 82284c50ba5SJosef Bacik kfree(root_item); 82384c50ba5SJosef Bacik abort: 82484c50ba5SJosef Bacik if (must_abort) 82584c50ba5SJosef Bacik btrfs_abort_transaction(trans, ret); 82684c50ba5SJosef Bacik return ERR_PTR(ret); 8273fd0a558SYan, Zheng } 8283fd0a558SYan, Zheng 8293fd0a558SYan, Zheng /* 8303fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 8313fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 832f44deb74SJosef Bacik * 833f44deb74SJosef Bacik * The reloc_root comes out of here with two references, one for 834f44deb74SJosef Bacik * root->reloc_root, and another for being on the rc->reloc_roots list. 8353fd0a558SYan, Zheng */ 8363fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 8373fd0a558SYan, Zheng struct btrfs_root *root) 8383fd0a558SYan, Zheng { 8390b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 8403fd0a558SYan, Zheng struct btrfs_root *reloc_root; 8410b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 84220dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 8433fd0a558SYan, Zheng int clear_rsv = 0; 844ffd7b339SJeff Mahoney int ret; 8453fd0a558SYan, Zheng 846aec7db3bSJosef Bacik if (!rc) 8472abc726aSJosef Bacik return 0; 8482abc726aSJosef Bacik 8491fac4a54SQu Wenruo /* 8501fac4a54SQu Wenruo * The subvolume has reloc tree but the swap is finished, no need to 8511fac4a54SQu Wenruo * create/update the dead reloc tree 8521fac4a54SQu Wenruo */ 8536282675eSQu Wenruo if (reloc_root_is_dead(root)) 8541fac4a54SQu Wenruo return 0; 8551fac4a54SQu Wenruo 856aec7db3bSJosef Bacik /* 857aec7db3bSJosef Bacik * This is subtle but important. We do not do 858aec7db3bSJosef Bacik * record_root_in_transaction for reloc roots, instead we record their 859aec7db3bSJosef Bacik * corresponding fs root, and then here we update the last trans for the 860aec7db3bSJosef Bacik * reloc root. This means that we have to do this for the entire life 861aec7db3bSJosef Bacik * of the reloc root, regardless of which stage of the relocation we are 862aec7db3bSJosef Bacik * in. 863aec7db3bSJosef Bacik */ 8643fd0a558SYan, Zheng if (root->reloc_root) { 8653fd0a558SYan, Zheng reloc_root = root->reloc_root; 8663fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 8673fd0a558SYan, Zheng return 0; 8683fd0a558SYan, Zheng } 8693fd0a558SYan, Zheng 870aec7db3bSJosef Bacik /* 871aec7db3bSJosef Bacik * We are merging reloc roots, we do not need new reloc trees. Also 872aec7db3bSJosef Bacik * reloc trees never need their own reloc tree. 873aec7db3bSJosef Bacik */ 874aec7db3bSJosef Bacik if (!rc->create_reloc_tree || 875aec7db3bSJosef Bacik root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 876aec7db3bSJosef Bacik return 0; 877aec7db3bSJosef Bacik 87820dd2cbfSMiao Xie if (!trans->reloc_reserved) { 87920dd2cbfSMiao Xie rsv = trans->block_rsv; 8803fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 8813fd0a558SYan, Zheng clear_rsv = 1; 8823fd0a558SYan, Zheng } 8833fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 8843fd0a558SYan, Zheng if (clear_rsv) 88520dd2cbfSMiao Xie trans->block_rsv = rsv; 88600bb36a0SJosef Bacik if (IS_ERR(reloc_root)) 88700bb36a0SJosef Bacik return PTR_ERR(reloc_root); 8885d4f98a2SYan Zheng 889ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 89057a304cfSJosef Bacik ASSERT(ret != -EEXIST); 89100bb36a0SJosef Bacik if (ret) { 89200bb36a0SJosef Bacik /* Pairs with create_reloc_root */ 89300bb36a0SJosef Bacik btrfs_put_root(reloc_root); 89400bb36a0SJosef Bacik return ret; 89500bb36a0SJosef Bacik } 896f44deb74SJosef Bacik root->reloc_root = btrfs_grab_root(reloc_root); 8975d4f98a2SYan Zheng return 0; 8985d4f98a2SYan Zheng } 8995d4f98a2SYan Zheng 9005d4f98a2SYan Zheng /* 9015d4f98a2SYan Zheng * update root item of reloc tree 9025d4f98a2SYan Zheng */ 9035d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 9045d4f98a2SYan Zheng struct btrfs_root *root) 9055d4f98a2SYan Zheng { 9060b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 9075d4f98a2SYan Zheng struct btrfs_root *reloc_root; 9085d4f98a2SYan Zheng struct btrfs_root_item *root_item; 9095d4f98a2SYan Zheng int ret; 9105d4f98a2SYan Zheng 9116282675eSQu Wenruo if (!have_reloc_root(root)) 912592fbcd5SJosef Bacik return 0; 9135d4f98a2SYan Zheng 9145d4f98a2SYan Zheng reloc_root = root->reloc_root; 9155d4f98a2SYan Zheng root_item = &reloc_root->root_item; 9165d4f98a2SYan Zheng 917f44deb74SJosef Bacik /* 918f44deb74SJosef Bacik * We are probably ok here, but __del_reloc_root() will drop its ref of 919f44deb74SJosef Bacik * the root. We have the ref for root->reloc_root, but just in case 920f44deb74SJosef Bacik * hold it while we update the reloc root. 921f44deb74SJosef Bacik */ 922f44deb74SJosef Bacik btrfs_grab_root(reloc_root); 923f44deb74SJosef Bacik 924d2311e69SQu Wenruo /* root->reloc_root will stay until current relocation finished */ 9250b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 9263fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 927d2311e69SQu Wenruo set_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 9286282675eSQu Wenruo /* 9296282675eSQu Wenruo * Mark the tree as dead before we change reloc_root so 9306282675eSQu Wenruo * have_reloc_root will not touch it from now on. 9316282675eSQu Wenruo */ 9326282675eSQu Wenruo smp_wmb(); 933c974c464SWang Shilong __del_reloc_root(reloc_root); 9345d4f98a2SYan Zheng } 9355d4f98a2SYan Zheng 9365d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 937ea287ab1SJosef Bacik __update_reloc_root(reloc_root); 9385d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 9395d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 9405d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 9415d4f98a2SYan Zheng } 9425d4f98a2SYan Zheng 9430b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 9445d4f98a2SYan Zheng &reloc_root->root_key, root_item); 945f44deb74SJosef Bacik btrfs_put_root(reloc_root); 946592fbcd5SJosef Bacik return ret; 9475d4f98a2SYan Zheng } 9485d4f98a2SYan Zheng 9495d4f98a2SYan Zheng /* 9505d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 9515d4f98a2SYan Zheng * in a subvolume 9525d4f98a2SYan Zheng */ 9535d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 9545d4f98a2SYan Zheng { 9555d4f98a2SYan Zheng struct rb_node *node; 9565d4f98a2SYan Zheng struct rb_node *prev; 9575d4f98a2SYan Zheng struct btrfs_inode *entry; 9585d4f98a2SYan Zheng struct inode *inode; 9595d4f98a2SYan Zheng 9605d4f98a2SYan Zheng spin_lock(&root->inode_lock); 9615d4f98a2SYan Zheng again: 9625d4f98a2SYan Zheng node = root->inode_tree.rb_node; 9635d4f98a2SYan Zheng prev = NULL; 9645d4f98a2SYan Zheng while (node) { 9655d4f98a2SYan Zheng prev = node; 9665d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 9675d4f98a2SYan Zheng 9684a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 9695d4f98a2SYan Zheng node = node->rb_left; 9704a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 9715d4f98a2SYan Zheng node = node->rb_right; 9725d4f98a2SYan Zheng else 9735d4f98a2SYan Zheng break; 9745d4f98a2SYan Zheng } 9755d4f98a2SYan Zheng if (!node) { 9765d4f98a2SYan Zheng while (prev) { 9775d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 9784a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 9795d4f98a2SYan Zheng node = prev; 9805d4f98a2SYan Zheng break; 9815d4f98a2SYan Zheng } 9825d4f98a2SYan Zheng prev = rb_next(prev); 9835d4f98a2SYan Zheng } 9845d4f98a2SYan Zheng } 9855d4f98a2SYan Zheng while (node) { 9865d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 9875d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 9885d4f98a2SYan Zheng if (inode) { 9895d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 9905d4f98a2SYan Zheng return inode; 9915d4f98a2SYan Zheng } 9925d4f98a2SYan Zheng 9934a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 9945d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 9955d4f98a2SYan Zheng goto again; 9965d4f98a2SYan Zheng 9975d4f98a2SYan Zheng node = rb_next(node); 9985d4f98a2SYan Zheng } 9995d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 10005d4f98a2SYan Zheng return NULL; 10015d4f98a2SYan Zheng } 10025d4f98a2SYan Zheng 10035d4f98a2SYan Zheng /* 10045d4f98a2SYan Zheng * get new location of data 10055d4f98a2SYan Zheng */ 10065d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 10075d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 10085d4f98a2SYan Zheng { 10095d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 10105d4f98a2SYan Zheng struct btrfs_path *path; 10115d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 10125d4f98a2SYan Zheng struct extent_buffer *leaf; 10135d4f98a2SYan Zheng int ret; 10145d4f98a2SYan Zheng 10155d4f98a2SYan Zheng path = btrfs_alloc_path(); 10165d4f98a2SYan Zheng if (!path) 10175d4f98a2SYan Zheng return -ENOMEM; 10185d4f98a2SYan Zheng 10195d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 1020f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 1021f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 10225d4f98a2SYan Zheng if (ret < 0) 10235d4f98a2SYan Zheng goto out; 10245d4f98a2SYan Zheng if (ret > 0) { 10255d4f98a2SYan Zheng ret = -ENOENT; 10265d4f98a2SYan Zheng goto out; 10275d4f98a2SYan Zheng } 10285d4f98a2SYan Zheng 10295d4f98a2SYan Zheng leaf = path->nodes[0]; 10305d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 10315d4f98a2SYan Zheng struct btrfs_file_extent_item); 10325d4f98a2SYan Zheng 10335d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 10345d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 10355d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 10365d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 10375d4f98a2SYan Zheng 10385d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 103983d4cfd4SJosef Bacik ret = -EINVAL; 10405d4f98a2SYan Zheng goto out; 10415d4f98a2SYan Zheng } 10425d4f98a2SYan Zheng 10435d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 10445d4f98a2SYan Zheng ret = 0; 10455d4f98a2SYan Zheng out: 10465d4f98a2SYan Zheng btrfs_free_path(path); 10475d4f98a2SYan Zheng return ret; 10485d4f98a2SYan Zheng } 10495d4f98a2SYan Zheng 10505d4f98a2SYan Zheng /* 10515d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 10525d4f98a2SYan Zheng * the new locations. 10535d4f98a2SYan Zheng */ 10543fd0a558SYan, Zheng static noinline_for_stack 10553fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 10565d4f98a2SYan Zheng struct reloc_control *rc, 10575d4f98a2SYan Zheng struct btrfs_root *root, 10583fd0a558SYan, Zheng struct extent_buffer *leaf) 10595d4f98a2SYan Zheng { 10600b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 10615d4f98a2SYan Zheng struct btrfs_key key; 10625d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 10635d4f98a2SYan Zheng struct inode *inode = NULL; 10645d4f98a2SYan Zheng u64 parent; 10655d4f98a2SYan Zheng u64 bytenr; 10663fd0a558SYan, Zheng u64 new_bytenr = 0; 10675d4f98a2SYan Zheng u64 num_bytes; 10685d4f98a2SYan Zheng u64 end; 10695d4f98a2SYan Zheng u32 nritems; 10705d4f98a2SYan Zheng u32 i; 107183d4cfd4SJosef Bacik int ret = 0; 10725d4f98a2SYan Zheng int first = 1; 10735d4f98a2SYan Zheng int dirty = 0; 10745d4f98a2SYan Zheng 10755d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 10765d4f98a2SYan Zheng return 0; 10775d4f98a2SYan Zheng 10785d4f98a2SYan Zheng /* reloc trees always use full backref */ 10795d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 10805d4f98a2SYan Zheng parent = leaf->start; 10815d4f98a2SYan Zheng else 10825d4f98a2SYan Zheng parent = 0; 10835d4f98a2SYan Zheng 10845d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 10855d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 108682fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 108782fa113fSQu Wenruo 10885d4f98a2SYan Zheng cond_resched(); 10895d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 10905d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 10915d4f98a2SYan Zheng continue; 10925d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 10935d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 10945d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 10955d4f98a2SYan Zheng continue; 10965d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 10975d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 10985d4f98a2SYan Zheng if (bytenr == 0) 10995d4f98a2SYan Zheng continue; 11009569cc20SQu Wenruo if (!in_range(bytenr, rc->block_group->start, 11019569cc20SQu Wenruo rc->block_group->length)) 11025d4f98a2SYan Zheng continue; 11035d4f98a2SYan Zheng 11045d4f98a2SYan Zheng /* 1105fb12489bSMatthew Wilcox (Oracle) * if we are modifying block in fs tree, wait for read_folio 11065d4f98a2SYan Zheng * to complete and drop the extent cache 11075d4f98a2SYan Zheng */ 11085d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 11095d4f98a2SYan Zheng if (first) { 11105d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 11115d4f98a2SYan Zheng first = 0; 11124a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 11133fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 11145d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 11155d4f98a2SYan Zheng } 11164a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 11179c5c9604SJosef Bacik struct extent_state *cached_state = NULL; 11189c5c9604SJosef Bacik 11195d4f98a2SYan Zheng end = key.offset + 11205d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 11215d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 11220b246afaSJeff Mahoney fs_info->sectorsize)); 11230b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 11245d4f98a2SYan Zheng end--; 11255d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 11269c5c9604SJosef Bacik key.offset, end, 11279c5c9604SJosef Bacik &cached_state); 11285d4f98a2SYan Zheng if (!ret) 11295d4f98a2SYan Zheng continue; 11305d4f98a2SYan Zheng 11314c0c8cfcSFilipe Manana btrfs_drop_extent_map_range(BTRFS_I(inode), 11324c0c8cfcSFilipe Manana key.offset, end, true); 11335d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 11349c5c9604SJosef Bacik key.offset, end, &cached_state); 11355d4f98a2SYan Zheng } 11365d4f98a2SYan Zheng } 11375d4f98a2SYan Zheng 11385d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 11395d4f98a2SYan Zheng bytenr, num_bytes); 114083d4cfd4SJosef Bacik if (ret) { 114183d4cfd4SJosef Bacik /* 114283d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 114383d4cfd4SJosef Bacik * in the file extent yet. 114483d4cfd4SJosef Bacik */ 114583d4cfd4SJosef Bacik break; 11463fd0a558SYan, Zheng } 11475d4f98a2SYan Zheng 11485d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 11495d4f98a2SYan Zheng dirty = 1; 11505d4f98a2SYan Zheng 11515d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 115282fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 115382fa113fSQu Wenruo num_bytes, parent); 115482fa113fSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1155f42c5da6SNikolay Borisov key.objectid, key.offset, 1156f42c5da6SNikolay Borisov root->root_key.objectid, false); 115782fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 115883d4cfd4SJosef Bacik if (ret) { 115966642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 116083d4cfd4SJosef Bacik break; 116183d4cfd4SJosef Bacik } 11625d4f98a2SYan Zheng 1163ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, bytenr, 1164ffd4bb2aSQu Wenruo num_bytes, parent); 1165ffd4bb2aSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1166f42c5da6SNikolay Borisov key.objectid, key.offset, 1167f42c5da6SNikolay Borisov root->root_key.objectid, false); 1168ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 116983d4cfd4SJosef Bacik if (ret) { 117066642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 117183d4cfd4SJosef Bacik break; 117283d4cfd4SJosef Bacik } 11735d4f98a2SYan Zheng } 11745d4f98a2SYan Zheng if (dirty) 11755d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 11763fd0a558SYan, Zheng if (inode) 11773fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 117883d4cfd4SJosef Bacik return ret; 11795d4f98a2SYan Zheng } 11805d4f98a2SYan Zheng 11815d4f98a2SYan Zheng static noinline_for_stack 11825d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 11835d4f98a2SYan Zheng struct btrfs_path *path, int level) 11845d4f98a2SYan Zheng { 11855d4f98a2SYan Zheng struct btrfs_disk_key key1; 11865d4f98a2SYan Zheng struct btrfs_disk_key key2; 11875d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 11885d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 11895d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 11905d4f98a2SYan Zheng } 11915d4f98a2SYan Zheng 11925d4f98a2SYan Zheng /* 11935d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 11945d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 11955d4f98a2SYan Zheng * reloc tree was create can be replaced. 11965d4f98a2SYan Zheng * 11975d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 11985d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 11995d4f98a2SYan Zheng * errors, a negative error number is returned. 12005d4f98a2SYan Zheng */ 12013fd0a558SYan, Zheng static noinline_for_stack 12023d0174f7SQu Wenruo int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, 12035d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 12045d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 12055d4f98a2SYan Zheng int lowest_level, int max_level) 12065d4f98a2SYan Zheng { 12070b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 12085d4f98a2SYan Zheng struct extent_buffer *eb; 12095d4f98a2SYan Zheng struct extent_buffer *parent; 121082fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 12115d4f98a2SYan Zheng struct btrfs_key key; 12125d4f98a2SYan Zheng u64 old_bytenr; 12135d4f98a2SYan Zheng u64 new_bytenr; 12145d4f98a2SYan Zheng u64 old_ptr_gen; 12155d4f98a2SYan Zheng u64 new_ptr_gen; 12165d4f98a2SYan Zheng u64 last_snapshot; 12175d4f98a2SYan Zheng u32 blocksize; 12183fd0a558SYan, Zheng int cow = 0; 12195d4f98a2SYan Zheng int level; 12205d4f98a2SYan Zheng int ret; 12215d4f98a2SYan Zheng int slot; 12225d4f98a2SYan Zheng 12237a9213a9SJosef Bacik ASSERT(src->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 12247a9213a9SJosef Bacik ASSERT(dest->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 12255d4f98a2SYan Zheng 12265d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 12273fd0a558SYan, Zheng again: 12285d4f98a2SYan Zheng slot = path->slots[lowest_level]; 12295d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 12305d4f98a2SYan Zheng 12315d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 12325d4f98a2SYan Zheng level = btrfs_header_level(eb); 12335d4f98a2SYan Zheng 12345d4f98a2SYan Zheng if (level < lowest_level) { 12355d4f98a2SYan Zheng btrfs_tree_unlock(eb); 12365d4f98a2SYan Zheng free_extent_buffer(eb); 12375d4f98a2SYan Zheng return 0; 12385d4f98a2SYan Zheng } 12395d4f98a2SYan Zheng 12403fd0a558SYan, Zheng if (cow) { 12419631e4ccSJosef Bacik ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb, 12429631e4ccSJosef Bacik BTRFS_NESTING_COW); 124345b87c5dSJosef Bacik if (ret) { 124445b87c5dSJosef Bacik btrfs_tree_unlock(eb); 124545b87c5dSJosef Bacik free_extent_buffer(eb); 124645b87c5dSJosef Bacik return ret; 124745b87c5dSJosef Bacik } 12483fd0a558SYan, Zheng } 12495d4f98a2SYan Zheng 12505d4f98a2SYan Zheng if (next_key) { 12515d4f98a2SYan Zheng next_key->objectid = (u64)-1; 12525d4f98a2SYan Zheng next_key->type = (u8)-1; 12535d4f98a2SYan Zheng next_key->offset = (u64)-1; 12545d4f98a2SYan Zheng } 12555d4f98a2SYan Zheng 12565d4f98a2SYan Zheng parent = eb; 12575d4f98a2SYan Zheng while (1) { 12585d4f98a2SYan Zheng level = btrfs_header_level(parent); 12597a9213a9SJosef Bacik ASSERT(level >= lowest_level); 12605d4f98a2SYan Zheng 1261e3b83361SQu Wenruo ret = btrfs_bin_search(parent, &key, &slot); 1262cbca7d59SFilipe Manana if (ret < 0) 1263cbca7d59SFilipe Manana break; 12645d4f98a2SYan Zheng if (ret && slot > 0) 12655d4f98a2SYan Zheng slot--; 12665d4f98a2SYan Zheng 12675d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 12685d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 12695d4f98a2SYan Zheng 12705d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 12710b246afaSJeff Mahoney blocksize = fs_info->nodesize; 12725d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 12735d4f98a2SYan Zheng 12745d4f98a2SYan Zheng if (level <= max_level) { 12755d4f98a2SYan Zheng eb = path->nodes[level]; 12765d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 12775d4f98a2SYan Zheng path->slots[level]); 12785d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 12795d4f98a2SYan Zheng path->slots[level]); 12805d4f98a2SYan Zheng } else { 12815d4f98a2SYan Zheng new_bytenr = 0; 12825d4f98a2SYan Zheng new_ptr_gen = 0; 12835d4f98a2SYan Zheng } 12845d4f98a2SYan Zheng 1285fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 12865d4f98a2SYan Zheng ret = level; 12875d4f98a2SYan Zheng break; 12885d4f98a2SYan Zheng } 12895d4f98a2SYan Zheng 12905d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 12915d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 12923fd0a558SYan, Zheng if (level <= lowest_level) { 12935d4f98a2SYan Zheng ret = 0; 12945d4f98a2SYan Zheng break; 12955d4f98a2SYan Zheng } 12965d4f98a2SYan Zheng 12976b3426beSJosef Bacik eb = btrfs_read_node_slot(parent, slot); 129864c043deSLiu Bo if (IS_ERR(eb)) { 129964c043deSLiu Bo ret = PTR_ERR(eb); 1300264813acSLiu Bo break; 1301416bc658SJosef Bacik } 13025d4f98a2SYan Zheng btrfs_tree_lock(eb); 13033fd0a558SYan, Zheng if (cow) { 13045d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 13059631e4ccSJosef Bacik slot, &eb, 13069631e4ccSJosef Bacik BTRFS_NESTING_COW); 130745b87c5dSJosef Bacik if (ret) { 130845b87c5dSJosef Bacik btrfs_tree_unlock(eb); 130945b87c5dSJosef Bacik free_extent_buffer(eb); 131045b87c5dSJosef Bacik break; 131145b87c5dSJosef Bacik } 13125d4f98a2SYan Zheng } 13135d4f98a2SYan Zheng 13145d4f98a2SYan Zheng btrfs_tree_unlock(parent); 13155d4f98a2SYan Zheng free_extent_buffer(parent); 13165d4f98a2SYan Zheng 13175d4f98a2SYan Zheng parent = eb; 13185d4f98a2SYan Zheng continue; 13195d4f98a2SYan Zheng } 13205d4f98a2SYan Zheng 13213fd0a558SYan, Zheng if (!cow) { 13223fd0a558SYan, Zheng btrfs_tree_unlock(parent); 13233fd0a558SYan, Zheng free_extent_buffer(parent); 13243fd0a558SYan, Zheng cow = 1; 13253fd0a558SYan, Zheng goto again; 13263fd0a558SYan, Zheng } 13273fd0a558SYan, Zheng 13285d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 13295d4f98a2SYan Zheng path->slots[level]); 1330b3b4aa74SDavid Sterba btrfs_release_path(path); 13315d4f98a2SYan Zheng 13325d4f98a2SYan Zheng path->lowest_level = level; 1333b40130b2SJosef Bacik set_bit(BTRFS_ROOT_RESET_LOCKDEP_CLASS, &src->state); 13345d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 1335b40130b2SJosef Bacik clear_bit(BTRFS_ROOT_RESET_LOCKDEP_CLASS, &src->state); 13365d4f98a2SYan Zheng path->lowest_level = 0; 13370e9873e2SJosef Bacik if (ret) { 13380e9873e2SJosef Bacik if (ret > 0) 13390e9873e2SJosef Bacik ret = -ENOENT; 13400e9873e2SJosef Bacik break; 13410e9873e2SJosef Bacik } 13425d4f98a2SYan Zheng 13435d4f98a2SYan Zheng /* 1344824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 1345824d8dffSQu Wenruo * 1346824d8dffSQu Wenruo * We must trace both trees. 1347824d8dffSQu Wenruo * 1) Tree reloc subtree 1348824d8dffSQu Wenruo * If not traced, we will leak data numbers 1349824d8dffSQu Wenruo * 2) Fs subtree 1350824d8dffSQu Wenruo * If not traced, we will double count old data 1351f616f5cdSQu Wenruo * 1352f616f5cdSQu Wenruo * We don't scan the subtree right now, but only record 1353f616f5cdSQu Wenruo * the swapped tree blocks. 1354f616f5cdSQu Wenruo * The real subtree rescan is delayed until we have new 1355f616f5cdSQu Wenruo * CoW on the subtree root node before transaction commit. 1356824d8dffSQu Wenruo */ 1357370a11b8SQu Wenruo ret = btrfs_qgroup_add_swapped_blocks(trans, dest, 1358370a11b8SQu Wenruo rc->block_group, parent, slot, 1359370a11b8SQu Wenruo path->nodes[level], path->slots[level], 1360370a11b8SQu Wenruo last_snapshot); 1361370a11b8SQu Wenruo if (ret < 0) 1362370a11b8SQu Wenruo break; 1363824d8dffSQu Wenruo /* 13645d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 13655d4f98a2SYan Zheng */ 13665d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 13675d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 13685d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 13695d4f98a2SYan Zheng 13705d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 13715d4f98a2SYan Zheng path->slots[level], old_bytenr); 13725d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 13735d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 13745d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 13755d4f98a2SYan Zheng 137682fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, old_bytenr, 137782fa113fSQu Wenruo blocksize, path->nodes[level]->start); 1378f42c5da6SNikolay Borisov btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid, 1379f42c5da6SNikolay Borisov 0, true); 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 } 138582fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 138682fa113fSQu Wenruo blocksize, 0); 1387f42c5da6SNikolay Borisov btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid, 0, 1388f42c5da6SNikolay Borisov true); 138982fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 1390253e258cSJosef Bacik if (ret) { 1391253e258cSJosef Bacik btrfs_abort_transaction(trans, ret); 1392253e258cSJosef Bacik break; 1393253e258cSJosef Bacik } 13945d4f98a2SYan Zheng 1395ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, new_bytenr, 1396ffd4bb2aSQu Wenruo blocksize, path->nodes[level]->start); 1397f42c5da6SNikolay Borisov btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid, 1398f42c5da6SNikolay Borisov 0, true); 1399ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 1400253e258cSJosef Bacik if (ret) { 1401253e258cSJosef Bacik btrfs_abort_transaction(trans, ret); 1402253e258cSJosef Bacik break; 1403253e258cSJosef Bacik } 14045d4f98a2SYan Zheng 1405ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, old_bytenr, 1406ffd4bb2aSQu Wenruo blocksize, 0); 1407f42c5da6SNikolay Borisov btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid, 1408f42c5da6SNikolay Borisov 0, true); 1409ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 1410253e258cSJosef Bacik if (ret) { 1411253e258cSJosef Bacik btrfs_abort_transaction(trans, ret); 1412253e258cSJosef Bacik break; 1413253e258cSJosef Bacik } 14145d4f98a2SYan Zheng 14155d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 14165d4f98a2SYan Zheng 14175d4f98a2SYan Zheng ret = level; 14185d4f98a2SYan Zheng break; 14195d4f98a2SYan Zheng } 14205d4f98a2SYan Zheng btrfs_tree_unlock(parent); 14215d4f98a2SYan Zheng free_extent_buffer(parent); 14225d4f98a2SYan Zheng return ret; 14235d4f98a2SYan Zheng } 14245d4f98a2SYan Zheng 14255d4f98a2SYan Zheng /* 14265d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 14275d4f98a2SYan Zheng */ 14285d4f98a2SYan Zheng static noinline_for_stack 14295d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 14305d4f98a2SYan Zheng int *level) 14315d4f98a2SYan Zheng { 14325d4f98a2SYan Zheng struct extent_buffer *eb; 14335d4f98a2SYan Zheng int i; 14345d4f98a2SYan Zheng u64 last_snapshot; 14355d4f98a2SYan Zheng u32 nritems; 14365d4f98a2SYan Zheng 14375d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 14385d4f98a2SYan Zheng 14395d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 14405d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 14415d4f98a2SYan Zheng path->nodes[i] = NULL; 14425d4f98a2SYan Zheng } 14435d4f98a2SYan Zheng 14445d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 14455d4f98a2SYan Zheng eb = path->nodes[i]; 14465d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 14475d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 14485d4f98a2SYan Zheng path->slots[i]++; 14495d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 14505d4f98a2SYan Zheng last_snapshot) 14515d4f98a2SYan Zheng continue; 14525d4f98a2SYan Zheng 14535d4f98a2SYan Zheng *level = i; 14545d4f98a2SYan Zheng return 0; 14555d4f98a2SYan Zheng } 14565d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 14575d4f98a2SYan Zheng path->nodes[i] = NULL; 14585d4f98a2SYan Zheng } 14595d4f98a2SYan Zheng return 1; 14605d4f98a2SYan Zheng } 14615d4f98a2SYan Zheng 14625d4f98a2SYan Zheng /* 14635d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 14645d4f98a2SYan Zheng */ 14655d4f98a2SYan Zheng static noinline_for_stack 14665d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 14675d4f98a2SYan Zheng int *level) 14685d4f98a2SYan Zheng { 14695d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 14705d4f98a2SYan Zheng int i; 14715d4f98a2SYan Zheng u64 ptr_gen = 0; 14725d4f98a2SYan Zheng u64 last_snapshot; 14735d4f98a2SYan Zheng u32 nritems; 14745d4f98a2SYan Zheng 14755d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 14765d4f98a2SYan Zheng 14775d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 14785d4f98a2SYan Zheng eb = path->nodes[i]; 14795d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 14805d4f98a2SYan Zheng while (path->slots[i] < nritems) { 14815d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 14825d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 14835d4f98a2SYan Zheng break; 14845d4f98a2SYan Zheng path->slots[i]++; 14855d4f98a2SYan Zheng } 14865d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 14875d4f98a2SYan Zheng if (i == *level) 14885d4f98a2SYan Zheng break; 14895d4f98a2SYan Zheng *level = i + 1; 14905d4f98a2SYan Zheng return 0; 14915d4f98a2SYan Zheng } 14925d4f98a2SYan Zheng if (i == 1) { 14935d4f98a2SYan Zheng *level = i; 14945d4f98a2SYan Zheng return 0; 14955d4f98a2SYan Zheng } 14965d4f98a2SYan Zheng 14978ef385bbSJosef Bacik eb = btrfs_read_node_slot(eb, path->slots[i]); 14988ef385bbSJosef Bacik if (IS_ERR(eb)) 149964c043deSLiu Bo return PTR_ERR(eb); 15005d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 15015d4f98a2SYan Zheng path->nodes[i - 1] = eb; 15025d4f98a2SYan Zheng path->slots[i - 1] = 0; 15035d4f98a2SYan Zheng } 15045d4f98a2SYan Zheng return 1; 15055d4f98a2SYan Zheng } 15065d4f98a2SYan Zheng 15075d4f98a2SYan Zheng /* 15085d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 15095d4f98a2SYan Zheng * [min_key, max_key) 15105d4f98a2SYan Zheng */ 15115d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 15125d4f98a2SYan Zheng struct btrfs_key *min_key, 15135d4f98a2SYan Zheng struct btrfs_key *max_key) 15145d4f98a2SYan Zheng { 15150b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 15165d4f98a2SYan Zheng struct inode *inode = NULL; 15175d4f98a2SYan Zheng u64 objectid; 15185d4f98a2SYan Zheng u64 start, end; 151933345d01SLi Zefan u64 ino; 15205d4f98a2SYan Zheng 15215d4f98a2SYan Zheng objectid = min_key->objectid; 15225d4f98a2SYan Zheng while (1) { 15239c5c9604SJosef Bacik struct extent_state *cached_state = NULL; 15249c5c9604SJosef Bacik 15255d4f98a2SYan Zheng cond_resched(); 15265d4f98a2SYan Zheng iput(inode); 15275d4f98a2SYan Zheng 15285d4f98a2SYan Zheng if (objectid > max_key->objectid) 15295d4f98a2SYan Zheng break; 15305d4f98a2SYan Zheng 15315d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 15325d4f98a2SYan Zheng if (!inode) 15335d4f98a2SYan Zheng break; 15344a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 15355d4f98a2SYan Zheng 153633345d01SLi Zefan if (ino > max_key->objectid) { 15375d4f98a2SYan Zheng iput(inode); 15385d4f98a2SYan Zheng break; 15395d4f98a2SYan Zheng } 15405d4f98a2SYan Zheng 154133345d01SLi Zefan objectid = ino + 1; 15425d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 15435d4f98a2SYan Zheng continue; 15445d4f98a2SYan Zheng 154533345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 15465d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 15475d4f98a2SYan Zheng continue; 15485d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 15495d4f98a2SYan Zheng start = 0; 15505d4f98a2SYan Zheng else { 15515d4f98a2SYan Zheng start = min_key->offset; 15520b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 15535d4f98a2SYan Zheng } 15545d4f98a2SYan Zheng } else { 15555d4f98a2SYan Zheng start = 0; 15565d4f98a2SYan Zheng } 15575d4f98a2SYan Zheng 155833345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 15595d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 15605d4f98a2SYan Zheng continue; 15615d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 15625d4f98a2SYan Zheng end = (u64)-1; 15635d4f98a2SYan Zheng } else { 15645d4f98a2SYan Zheng if (max_key->offset == 0) 15655d4f98a2SYan Zheng continue; 15665d4f98a2SYan Zheng end = max_key->offset; 15670b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 15685d4f98a2SYan Zheng end--; 15695d4f98a2SYan Zheng } 15705d4f98a2SYan Zheng } else { 15715d4f98a2SYan Zheng end = (u64)-1; 15725d4f98a2SYan Zheng } 15735d4f98a2SYan Zheng 1574fb12489bSMatthew Wilcox (Oracle) /* the lock_extent waits for read_folio to complete */ 15759c5c9604SJosef Bacik lock_extent(&BTRFS_I(inode)->io_tree, start, end, &cached_state); 15764c0c8cfcSFilipe Manana btrfs_drop_extent_map_range(BTRFS_I(inode), start, end, true); 15779c5c9604SJosef Bacik unlock_extent(&BTRFS_I(inode)->io_tree, start, end, &cached_state); 15785d4f98a2SYan Zheng } 15795d4f98a2SYan Zheng return 0; 15805d4f98a2SYan Zheng } 15815d4f98a2SYan Zheng 15825d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 15835d4f98a2SYan Zheng struct btrfs_key *key) 15845d4f98a2SYan Zheng 15855d4f98a2SYan Zheng { 15865d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 15875d4f98a2SYan Zheng if (!path->nodes[level]) 15885d4f98a2SYan Zheng break; 15895d4f98a2SYan Zheng if (path->slots[level] + 1 < 15905d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 15915d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 15925d4f98a2SYan Zheng path->slots[level] + 1); 15935d4f98a2SYan Zheng return 0; 15945d4f98a2SYan Zheng } 15955d4f98a2SYan Zheng level++; 15965d4f98a2SYan Zheng } 15975d4f98a2SYan Zheng return 1; 15985d4f98a2SYan Zheng } 15995d4f98a2SYan Zheng 16005d4f98a2SYan Zheng /* 1601d2311e69SQu Wenruo * Insert current subvolume into reloc_control::dirty_subvol_roots 1602d2311e69SQu Wenruo */ 1603ac54da6cSJosef Bacik static int insert_dirty_subvol(struct btrfs_trans_handle *trans, 1604d2311e69SQu Wenruo struct reloc_control *rc, 1605d2311e69SQu Wenruo struct btrfs_root *root) 1606d2311e69SQu Wenruo { 1607d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 1608d2311e69SQu Wenruo struct btrfs_root_item *reloc_root_item; 16097934133fSJosef Bacik int ret; 1610d2311e69SQu Wenruo 1611d2311e69SQu Wenruo /* @root must be a subvolume tree root with a valid reloc tree */ 1612d2311e69SQu Wenruo ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 1613d2311e69SQu Wenruo ASSERT(reloc_root); 1614d2311e69SQu Wenruo 1615d2311e69SQu Wenruo reloc_root_item = &reloc_root->root_item; 1616d2311e69SQu Wenruo memset(&reloc_root_item->drop_progress, 0, 1617d2311e69SQu Wenruo sizeof(reloc_root_item->drop_progress)); 1618c8422684SDavid Sterba btrfs_set_root_drop_level(reloc_root_item, 0); 1619d2311e69SQu Wenruo btrfs_set_root_refs(reloc_root_item, 0); 16207934133fSJosef Bacik ret = btrfs_update_reloc_root(trans, root); 16217934133fSJosef Bacik if (ret) 16227934133fSJosef Bacik return ret; 1623d2311e69SQu Wenruo 1624d2311e69SQu Wenruo if (list_empty(&root->reloc_dirty_list)) { 162500246528SJosef Bacik btrfs_grab_root(root); 1626d2311e69SQu Wenruo list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); 1627d2311e69SQu Wenruo } 1628ac54da6cSJosef Bacik 1629ac54da6cSJosef Bacik return 0; 1630d2311e69SQu Wenruo } 1631d2311e69SQu Wenruo 1632d2311e69SQu Wenruo static int clean_dirty_subvols(struct reloc_control *rc) 1633d2311e69SQu Wenruo { 1634d2311e69SQu Wenruo struct btrfs_root *root; 1635d2311e69SQu Wenruo struct btrfs_root *next; 1636d2311e69SQu Wenruo int ret = 0; 163730d40577SQu Wenruo int ret2; 1638d2311e69SQu Wenruo 1639d2311e69SQu Wenruo list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, 1640d2311e69SQu Wenruo reloc_dirty_list) { 164130d40577SQu Wenruo if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 164230d40577SQu Wenruo /* Merged subvolume, cleanup its reloc root */ 1643d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 1644d2311e69SQu Wenruo 1645d2311e69SQu Wenruo list_del_init(&root->reloc_dirty_list); 1646d2311e69SQu Wenruo root->reloc_root = NULL; 16476282675eSQu Wenruo /* 16486282675eSQu Wenruo * Need barrier to ensure clear_bit() only happens after 16496282675eSQu Wenruo * root->reloc_root = NULL. Pairs with have_reloc_root. 16506282675eSQu Wenruo */ 16516282675eSQu Wenruo smp_wmb(); 16521fac4a54SQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 1653f28de8d8SJosef Bacik if (reloc_root) { 1654f44deb74SJosef Bacik /* 1655f44deb74SJosef Bacik * btrfs_drop_snapshot drops our ref we hold for 1656f44deb74SJosef Bacik * ->reloc_root. If it fails however we must 1657f44deb74SJosef Bacik * drop the ref ourselves. 1658f44deb74SJosef Bacik */ 1659f28de8d8SJosef Bacik ret2 = btrfs_drop_snapshot(reloc_root, 0, 1); 1660f44deb74SJosef Bacik if (ret2 < 0) { 1661f44deb74SJosef Bacik btrfs_put_root(reloc_root); 1662f44deb74SJosef Bacik if (!ret) 1663f28de8d8SJosef Bacik ret = ret2; 1664f28de8d8SJosef Bacik } 1665f44deb74SJosef Bacik } 166600246528SJosef Bacik btrfs_put_root(root); 166730d40577SQu Wenruo } else { 166830d40577SQu Wenruo /* Orphan reloc tree, just clean it up */ 16690078a9f9SNikolay Borisov ret2 = btrfs_drop_snapshot(root, 0, 1); 1670f44deb74SJosef Bacik if (ret2 < 0) { 1671f44deb74SJosef Bacik btrfs_put_root(root); 1672f44deb74SJosef Bacik if (!ret) 167330d40577SQu Wenruo ret = ret2; 167430d40577SQu Wenruo } 1675d2311e69SQu Wenruo } 1676f44deb74SJosef Bacik } 1677d2311e69SQu Wenruo return ret; 1678d2311e69SQu Wenruo } 1679d2311e69SQu Wenruo 1680d2311e69SQu Wenruo /* 16815d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 16825d4f98a2SYan Zheng * fs tree. 16835d4f98a2SYan Zheng */ 16845d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 16855d4f98a2SYan Zheng struct btrfs_root *root) 16865d4f98a2SYan Zheng { 16870b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 16885d4f98a2SYan Zheng struct btrfs_key key; 16895d4f98a2SYan Zheng struct btrfs_key next_key; 16909e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 16915d4f98a2SYan Zheng struct btrfs_root *reloc_root; 16925d4f98a2SYan Zheng struct btrfs_root_item *root_item; 16935d4f98a2SYan Zheng struct btrfs_path *path; 16943fd0a558SYan, Zheng struct extent_buffer *leaf; 1695fca3a45dSJosef Bacik int reserve_level; 16965d4f98a2SYan Zheng int level; 16975d4f98a2SYan Zheng int max_level; 16985d4f98a2SYan Zheng int replaced = 0; 1699c6a592f2SNikolay Borisov int ret = 0; 17003fd0a558SYan, Zheng u32 min_reserved; 17015d4f98a2SYan Zheng 17025d4f98a2SYan Zheng path = btrfs_alloc_path(); 17035d4f98a2SYan Zheng if (!path) 17045d4f98a2SYan Zheng return -ENOMEM; 1705e4058b54SDavid Sterba path->reada = READA_FORWARD; 17065d4f98a2SYan Zheng 17075d4f98a2SYan Zheng reloc_root = root->reloc_root; 17085d4f98a2SYan Zheng root_item = &reloc_root->root_item; 17095d4f98a2SYan Zheng 17105d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 17115d4f98a2SYan Zheng level = btrfs_root_level(root_item); 171267439dadSDavid Sterba atomic_inc(&reloc_root->node->refs); 17135d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 17145d4f98a2SYan Zheng path->slots[level] = 0; 17155d4f98a2SYan Zheng } else { 17165d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 17175d4f98a2SYan Zheng 1718c8422684SDavid Sterba level = btrfs_root_drop_level(root_item); 17195d4f98a2SYan Zheng BUG_ON(level == 0); 17205d4f98a2SYan Zheng path->lowest_level = level; 17215d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 172233c66f43SYan Zheng path->lowest_level = 0; 17235d4f98a2SYan Zheng if (ret < 0) { 17245d4f98a2SYan Zheng btrfs_free_path(path); 17255d4f98a2SYan Zheng return ret; 17265d4f98a2SYan Zheng } 17275d4f98a2SYan Zheng 17285d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 17295d4f98a2SYan Zheng path->slots[level]); 17305d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 17315d4f98a2SYan Zheng 17325d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 17335d4f98a2SYan Zheng } 17345d4f98a2SYan Zheng 173544d354abSQu Wenruo /* 173644d354abSQu Wenruo * In merge_reloc_root(), we modify the upper level pointer to swap the 173744d354abSQu Wenruo * tree blocks between reloc tree and subvolume tree. Thus for tree 173844d354abSQu Wenruo * block COW, we COW at most from level 1 to root level for each tree. 173944d354abSQu Wenruo * 174044d354abSQu Wenruo * Thus the needed metadata size is at most root_level * nodesize, 174144d354abSQu Wenruo * and * 2 since we have two trees to COW. 174244d354abSQu Wenruo */ 1743fca3a45dSJosef Bacik reserve_level = max_t(int, 1, btrfs_root_level(root_item)); 1744fca3a45dSJosef Bacik min_reserved = fs_info->nodesize * reserve_level * 2; 17455d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 17465d4f98a2SYan Zheng 17475d4f98a2SYan Zheng while (1) { 17489270501cSJosef Bacik ret = btrfs_block_rsv_refill(fs_info, rc->block_rsv, 17499270501cSJosef Bacik min_reserved, 175044d354abSQu Wenruo BTRFS_RESERVE_FLUSH_LIMIT); 1751c6a592f2SNikolay Borisov if (ret) 17529e6a0c52SJosef Bacik goto out; 17539e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 17549e6a0c52SJosef Bacik if (IS_ERR(trans)) { 1755c6a592f2SNikolay Borisov ret = PTR_ERR(trans); 17569e6a0c52SJosef Bacik trans = NULL; 17579e6a0c52SJosef Bacik goto out; 17589e6a0c52SJosef Bacik } 17592abc726aSJosef Bacik 17602abc726aSJosef Bacik /* 17612abc726aSJosef Bacik * At this point we no longer have a reloc_control, so we can't 17622abc726aSJosef Bacik * depend on btrfs_init_reloc_root to update our last_trans. 17632abc726aSJosef Bacik * 17642abc726aSJosef Bacik * But that's ok, we started the trans handle on our 17652abc726aSJosef Bacik * corresponding fs_root, which means it's been added to the 17662abc726aSJosef Bacik * dirty list. At commit time we'll still call 17672abc726aSJosef Bacik * btrfs_update_reloc_root() and update our root item 17682abc726aSJosef Bacik * appropriately. 17692abc726aSJosef Bacik */ 17702abc726aSJosef Bacik reloc_root->last_trans = trans->transid; 17719e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 17723fd0a558SYan, Zheng 17733fd0a558SYan, Zheng replaced = 0; 17745d4f98a2SYan Zheng max_level = level; 17755d4f98a2SYan Zheng 17765d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 1777c6a592f2SNikolay Borisov if (ret < 0) 17785d4f98a2SYan Zheng goto out; 17795d4f98a2SYan Zheng if (ret > 0) 17805d4f98a2SYan Zheng break; 17815d4f98a2SYan Zheng 17825d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 17835d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 17845d4f98a2SYan Zheng ret = 0; 17855d4f98a2SYan Zheng } else { 17863d0174f7SQu Wenruo ret = replace_path(trans, rc, root, reloc_root, path, 17873fd0a558SYan, Zheng &next_key, level, max_level); 17885d4f98a2SYan Zheng } 1789c6a592f2SNikolay Borisov if (ret < 0) 17905d4f98a2SYan Zheng goto out; 17915d4f98a2SYan Zheng if (ret > 0) { 17925d4f98a2SYan Zheng level = ret; 17935d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 17945d4f98a2SYan Zheng path->slots[level]); 17955d4f98a2SYan Zheng replaced = 1; 17965d4f98a2SYan Zheng } 17975d4f98a2SYan Zheng 17985d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 17995d4f98a2SYan Zheng if (ret > 0) 18005d4f98a2SYan Zheng break; 18015d4f98a2SYan Zheng 18025d4f98a2SYan Zheng BUG_ON(level == 0); 18035d4f98a2SYan Zheng /* 18045d4f98a2SYan Zheng * save the merging progress in the drop_progress. 18055d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 18065d4f98a2SYan Zheng */ 18075d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 18085d4f98a2SYan Zheng path->slots[level]); 1809c8422684SDavid Sterba btrfs_set_root_drop_level(root_item, level); 18105d4f98a2SYan Zheng 18113a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 18129e6a0c52SJosef Bacik trans = NULL; 18135d4f98a2SYan Zheng 18142ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 18155d4f98a2SYan Zheng 18165d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 18175d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 18185d4f98a2SYan Zheng } 18195d4f98a2SYan Zheng 18205d4f98a2SYan Zheng /* 18215d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 18225d4f98a2SYan Zheng * relocated and the block is tree root. 18235d4f98a2SYan Zheng */ 18245d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 18259631e4ccSJosef Bacik ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf, 18269631e4ccSJosef Bacik BTRFS_NESTING_COW); 18275d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 18285d4f98a2SYan Zheng free_extent_buffer(leaf); 18295d4f98a2SYan Zheng out: 18305d4f98a2SYan Zheng btrfs_free_path(path); 18315d4f98a2SYan Zheng 1832ac54da6cSJosef Bacik if (ret == 0) { 1833ac54da6cSJosef Bacik ret = insert_dirty_subvol(trans, rc, root); 1834ac54da6cSJosef Bacik if (ret) 1835ac54da6cSJosef Bacik btrfs_abort_transaction(trans, ret); 1836ac54da6cSJosef Bacik } 18375d4f98a2SYan Zheng 18389e6a0c52SJosef Bacik if (trans) 18393a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 18405d4f98a2SYan Zheng 18412ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 18425d4f98a2SYan Zheng 18435d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 18445d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 18455d4f98a2SYan Zheng 1846c6a592f2SNikolay Borisov return ret; 18475d4f98a2SYan Zheng } 18485d4f98a2SYan Zheng 18493fd0a558SYan, Zheng static noinline_for_stack 18503fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 18515d4f98a2SYan Zheng { 18523fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 18530b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 18543fd0a558SYan, Zheng struct btrfs_root *reloc_root; 18555d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 18563fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 18573fd0a558SYan, Zheng u64 num_bytes = 0; 18583fd0a558SYan, Zheng int ret; 18593fd0a558SYan, Zheng 18600b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 18610b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 18623fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 18630b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 18647585717fSChris Mason 18653fd0a558SYan, Zheng again: 18663fd0a558SYan, Zheng if (!err) { 18673fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 18689270501cSJosef Bacik ret = btrfs_block_rsv_add(fs_info, rc->block_rsv, num_bytes, 186908e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 18703fd0a558SYan, Zheng if (ret) 18713fd0a558SYan, Zheng err = ret; 18723fd0a558SYan, Zheng } 18733fd0a558SYan, Zheng 18747a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 18753612b495STsutomu Itoh if (IS_ERR(trans)) { 18763612b495STsutomu Itoh if (!err) 18772ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 187863f018beSNikolay Borisov num_bytes, NULL); 18793612b495STsutomu Itoh return PTR_ERR(trans); 18803612b495STsutomu Itoh } 18813fd0a558SYan, Zheng 18823fd0a558SYan, Zheng if (!err) { 18833fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 18843a45bb20SJeff Mahoney btrfs_end_transaction(trans); 18852ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 188663f018beSNikolay Borisov num_bytes, NULL); 18873fd0a558SYan, Zheng goto again; 18883fd0a558SYan, Zheng } 18893fd0a558SYan, Zheng } 18903fd0a558SYan, Zheng 18913fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 18923fd0a558SYan, Zheng 18933fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 18943fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 18953fd0a558SYan, Zheng struct btrfs_root, root_list); 18963fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 18973fd0a558SYan, Zheng 1898a820feb5SDavid Sterba root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, 1899a820feb5SDavid Sterba false); 1900e0b085b0SJosef Bacik if (IS_ERR(root)) { 1901e0b085b0SJosef Bacik /* 1902e0b085b0SJosef Bacik * Even if we have an error we need this reloc root 1903e0b085b0SJosef Bacik * back on our list so we can clean up properly. 1904e0b085b0SJosef Bacik */ 1905e0b085b0SJosef Bacik list_add(&reloc_root->root_list, &reloc_roots); 1906e0b085b0SJosef Bacik btrfs_abort_transaction(trans, (int)PTR_ERR(root)); 1907e0b085b0SJosef Bacik if (!err) 1908e0b085b0SJosef Bacik err = PTR_ERR(root); 1909e0b085b0SJosef Bacik break; 1910e0b085b0SJosef Bacik } 1911e0b085b0SJosef Bacik ASSERT(root->reloc_root == reloc_root); 19123fd0a558SYan, Zheng 19133fd0a558SYan, Zheng /* 19143fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 19153fd0a558SYan, Zheng * knows it should resumes merging 19163fd0a558SYan, Zheng */ 19173fd0a558SYan, Zheng if (!err) 19183fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 1919bbae13f8SJosef Bacik ret = btrfs_update_reloc_root(trans, root); 19203fd0a558SYan, Zheng 1921bbae13f8SJosef Bacik /* 1922bbae13f8SJosef Bacik * Even if we have an error we need this reloc root back on our 1923bbae13f8SJosef Bacik * list so we can clean up properly. 1924bbae13f8SJosef Bacik */ 19253fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 192600246528SJosef Bacik btrfs_put_root(root); 1927bbae13f8SJosef Bacik 1928bbae13f8SJosef Bacik if (ret) { 1929bbae13f8SJosef Bacik btrfs_abort_transaction(trans, ret); 1930bbae13f8SJosef Bacik if (!err) 1931bbae13f8SJosef Bacik err = ret; 1932bbae13f8SJosef Bacik break; 1933bbae13f8SJosef Bacik } 19343fd0a558SYan, Zheng } 19353fd0a558SYan, Zheng 19363fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 19373fd0a558SYan, Zheng 19383fd0a558SYan, Zheng if (!err) 1939fb686c68SJosef Bacik err = btrfs_commit_transaction(trans); 19403fd0a558SYan, Zheng else 19413a45bb20SJeff Mahoney btrfs_end_transaction(trans); 19423fd0a558SYan, Zheng return err; 19433fd0a558SYan, Zheng } 19443fd0a558SYan, Zheng 19453fd0a558SYan, Zheng static noinline_for_stack 1946aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 1947aca1bba6SLiu Bo { 1948a7571232SNikolay Borisov struct btrfs_root *reloc_root, *tmp; 1949aca1bba6SLiu Bo 1950a7571232SNikolay Borisov list_for_each_entry_safe(reloc_root, tmp, list, root_list) 1951bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 1952aca1bba6SLiu Bo } 1953aca1bba6SLiu Bo 1954aca1bba6SLiu Bo static noinline_for_stack 195594404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 19563fd0a558SYan, Zheng { 19570b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 19585d4f98a2SYan Zheng struct btrfs_root *root; 19595d4f98a2SYan Zheng struct btrfs_root *reloc_root; 19603fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 19613fd0a558SYan, Zheng int found = 0; 1962aca1bba6SLiu Bo int ret = 0; 19633fd0a558SYan, Zheng again: 19643fd0a558SYan, Zheng root = rc->extent_root; 19657585717fSChris Mason 19667585717fSChris Mason /* 19677585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 19687585717fSChris Mason * we have to make sure nobody is in the middle of 19697585717fSChris Mason * adding their roots to the list while we are 19707585717fSChris Mason * doing this splice 19717585717fSChris Mason */ 19720b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 19733fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 19740b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 19755d4f98a2SYan Zheng 19763fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 19773fd0a558SYan, Zheng found = 1; 19783fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 19793fd0a558SYan, Zheng struct btrfs_root, root_list); 19805d4f98a2SYan Zheng 1981a820feb5SDavid Sterba root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, 1982a820feb5SDavid Sterba false); 19835d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 198424213fa4SJosef Bacik if (IS_ERR(root)) { 198524213fa4SJosef Bacik /* 198624213fa4SJosef Bacik * For recovery we read the fs roots on mount, 198724213fa4SJosef Bacik * and if we didn't find the root then we marked 198824213fa4SJosef Bacik * the reloc root as a garbage root. For normal 198924213fa4SJosef Bacik * relocation obviously the root should exist in 199024213fa4SJosef Bacik * memory. However there's no reason we can't 199124213fa4SJosef Bacik * handle the error properly here just in case. 199224213fa4SJosef Bacik */ 199324213fa4SJosef Bacik ASSERT(0); 199424213fa4SJosef Bacik ret = PTR_ERR(root); 199524213fa4SJosef Bacik goto out; 199624213fa4SJosef Bacik } 199724213fa4SJosef Bacik if (root->reloc_root != reloc_root) { 199824213fa4SJosef Bacik /* 199924213fa4SJosef Bacik * This is actually impossible without something 200024213fa4SJosef Bacik * going really wrong (like weird race condition 200124213fa4SJosef Bacik * or cosmic rays). 200224213fa4SJosef Bacik */ 200324213fa4SJosef Bacik ASSERT(0); 200424213fa4SJosef Bacik ret = -EINVAL; 200524213fa4SJosef Bacik goto out; 200624213fa4SJosef Bacik } 20073fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 200800246528SJosef Bacik btrfs_put_root(root); 2009b37b39cdSJosef Bacik if (ret) { 201025e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 201125e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 201225e293c2SWang Shilong &reloc_roots); 2013aca1bba6SLiu Bo goto out; 2014b37b39cdSJosef Bacik } 20153fd0a558SYan, Zheng } else { 201651415b6cSQu Wenruo if (!IS_ERR(root)) { 201751415b6cSQu Wenruo if (root->reloc_root == reloc_root) { 201851415b6cSQu Wenruo root->reloc_root = NULL; 201951415b6cSQu Wenruo btrfs_put_root(reloc_root); 202051415b6cSQu Wenruo } 20211dae7e0eSQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, 20221dae7e0eSQu Wenruo &root->state); 202351415b6cSQu Wenruo btrfs_put_root(root); 202451415b6cSQu Wenruo } 202551415b6cSQu Wenruo 20263fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 202730d40577SQu Wenruo /* Don't forget to queue this reloc root for cleanup */ 202830d40577SQu Wenruo list_add_tail(&reloc_root->reloc_dirty_list, 202930d40577SQu Wenruo &rc->dirty_subvol_roots); 20303fd0a558SYan, Zheng } 20315d4f98a2SYan Zheng } 20325d4f98a2SYan Zheng 20333fd0a558SYan, Zheng if (found) { 20343fd0a558SYan, Zheng found = 0; 20353fd0a558SYan, Zheng goto again; 20365d4f98a2SYan Zheng } 2037aca1bba6SLiu Bo out: 2038aca1bba6SLiu Bo if (ret) { 20390b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2040aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2041467bb1d2SWang Shilong 2042467bb1d2SWang Shilong /* new reloc root may be added */ 20430b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2044467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 20450b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2046467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2047aca1bba6SLiu Bo } 2048aca1bba6SLiu Bo 20497b7b7431SJosef Bacik /* 20507b7b7431SJosef Bacik * We used to have 20517b7b7431SJosef Bacik * 20527b7b7431SJosef Bacik * BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 20537b7b7431SJosef Bacik * 20547b7b7431SJosef Bacik * here, but it's wrong. If we fail to start the transaction in 20557b7b7431SJosef Bacik * prepare_to_merge() we will have only 0 ref reloc roots, none of which 20567b7b7431SJosef Bacik * have actually been removed from the reloc_root_tree rb tree. This is 20577b7b7431SJosef Bacik * fine because we're bailing here, and we hold a reference on the root 20587b7b7431SJosef Bacik * for the list that holds it, so these roots will be cleaned up when we 20597b7b7431SJosef Bacik * do the reloc_dirty_list afterwards. Meanwhile the root->reloc_root 20607b7b7431SJosef Bacik * will be cleaned up on unmount. 20617b7b7431SJosef Bacik * 20627b7b7431SJosef Bacik * The remaining nodes will be cleaned up by free_reloc_control. 20637b7b7431SJosef Bacik */ 20645d4f98a2SYan Zheng } 20655d4f98a2SYan Zheng 20665d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 20675d4f98a2SYan Zheng { 20685d4f98a2SYan Zheng struct tree_block *block; 20695d4f98a2SYan Zheng struct rb_node *rb_node; 20705d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 20715d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 20725d4f98a2SYan Zheng rb_erase(rb_node, blocks); 20735d4f98a2SYan Zheng kfree(block); 20745d4f98a2SYan Zheng } 20755d4f98a2SYan Zheng } 20765d4f98a2SYan Zheng 20775d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 20785d4f98a2SYan Zheng struct btrfs_root *reloc_root) 20795d4f98a2SYan Zheng { 20800b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 20815d4f98a2SYan Zheng struct btrfs_root *root; 2082442b1ac5SJosef Bacik int ret; 20835d4f98a2SYan Zheng 20845d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 20855d4f98a2SYan Zheng return 0; 20865d4f98a2SYan Zheng 2087a820feb5SDavid Sterba root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, false); 2088404bccbcSJosef Bacik 2089404bccbcSJosef Bacik /* 2090404bccbcSJosef Bacik * This should succeed, since we can't have a reloc root without having 2091404bccbcSJosef Bacik * already looked up the actual root and created the reloc root for this 2092404bccbcSJosef Bacik * root. 2093404bccbcSJosef Bacik * 2094404bccbcSJosef Bacik * However if there's some sort of corruption where we have a ref to a 2095404bccbcSJosef Bacik * reloc root without a corresponding root this could return ENOENT. 2096404bccbcSJosef Bacik */ 2097404bccbcSJosef Bacik if (IS_ERR(root)) { 2098404bccbcSJosef Bacik ASSERT(0); 2099404bccbcSJosef Bacik return PTR_ERR(root); 2100404bccbcSJosef Bacik } 2101404bccbcSJosef Bacik if (root->reloc_root != reloc_root) { 2102404bccbcSJosef Bacik ASSERT(0); 2103404bccbcSJosef Bacik btrfs_err(fs_info, 2104404bccbcSJosef Bacik "root %llu has two reloc roots associated with it", 2105404bccbcSJosef Bacik reloc_root->root_key.offset); 2106404bccbcSJosef Bacik btrfs_put_root(root); 2107404bccbcSJosef Bacik return -EUCLEAN; 2108404bccbcSJosef Bacik } 2109442b1ac5SJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 211000246528SJosef Bacik btrfs_put_root(root); 21115d4f98a2SYan Zheng 2112442b1ac5SJosef Bacik return ret; 21135d4f98a2SYan Zheng } 21145d4f98a2SYan Zheng 21153fd0a558SYan, Zheng static noinline_for_stack 21163fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 21173fd0a558SYan, Zheng struct reloc_control *rc, 2118a26195a5SQu Wenruo struct btrfs_backref_node *node, 2119a26195a5SQu Wenruo struct btrfs_backref_edge *edges[]) 21205d4f98a2SYan Zheng { 2121a26195a5SQu Wenruo struct btrfs_backref_node *next; 21225d4f98a2SYan Zheng struct btrfs_root *root; 21233fd0a558SYan, Zheng int index = 0; 212492de551bSJosef Bacik int ret; 21253fd0a558SYan, Zheng 21265d4f98a2SYan Zheng next = node; 21275d4f98a2SYan Zheng while (1) { 21285d4f98a2SYan Zheng cond_resched(); 21295d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 21305d4f98a2SYan Zheng root = next->root; 21318ee66afeSJosef Bacik 21328ee66afeSJosef Bacik /* 21338ee66afeSJosef Bacik * If there is no root, then our references for this block are 21348ee66afeSJosef Bacik * incomplete, as we should be able to walk all the way up to a 21358ee66afeSJosef Bacik * block that is owned by a root. 21368ee66afeSJosef Bacik * 21378ee66afeSJosef Bacik * This path is only for SHAREABLE roots, so if we come upon a 21388ee66afeSJosef Bacik * non-SHAREABLE root then we have backrefs that resolve 21398ee66afeSJosef Bacik * improperly. 21408ee66afeSJosef Bacik * 21418ee66afeSJosef Bacik * Both of these cases indicate file system corruption, or a bug 21428ee66afeSJosef Bacik * in the backref walking code. 21438ee66afeSJosef Bacik */ 21448ee66afeSJosef Bacik if (!root) { 21458ee66afeSJosef Bacik ASSERT(0); 21468ee66afeSJosef Bacik btrfs_err(trans->fs_info, 21478ee66afeSJosef Bacik "bytenr %llu doesn't have a backref path ending in a root", 21488ee66afeSJosef Bacik node->bytenr); 21498ee66afeSJosef Bacik return ERR_PTR(-EUCLEAN); 21508ee66afeSJosef Bacik } 21518ee66afeSJosef Bacik if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) { 21528ee66afeSJosef Bacik ASSERT(0); 21538ee66afeSJosef Bacik btrfs_err(trans->fs_info, 21548ee66afeSJosef Bacik "bytenr %llu has multiple refs with one ending in a non-shareable root", 21558ee66afeSJosef Bacik node->bytenr); 21568ee66afeSJosef Bacik return ERR_PTR(-EUCLEAN); 21578ee66afeSJosef Bacik } 21585d4f98a2SYan Zheng 21595d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 216092de551bSJosef Bacik ret = record_reloc_root_in_trans(trans, root); 216192de551bSJosef Bacik if (ret) 216292de551bSJosef Bacik return ERR_PTR(ret); 21635d4f98a2SYan Zheng break; 21645d4f98a2SYan Zheng } 21655d4f98a2SYan Zheng 216692de551bSJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 216792de551bSJosef Bacik if (ret) 216892de551bSJosef Bacik return ERR_PTR(ret); 21693fd0a558SYan, Zheng root = root->reloc_root; 21703fd0a558SYan, Zheng 217139200e59SJosef Bacik /* 217239200e59SJosef Bacik * We could have raced with another thread which failed, so 217339200e59SJosef Bacik * root->reloc_root may not be set, return ENOENT in this case. 217439200e59SJosef Bacik */ 217539200e59SJosef Bacik if (!root) 217639200e59SJosef Bacik return ERR_PTR(-ENOENT); 217739200e59SJosef Bacik 21783fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 21798ee66afeSJosef Bacik /* 21808ee66afeSJosef Bacik * We just created the reloc root, so we shouldn't have 21818ee66afeSJosef Bacik * ->new_bytenr set and this shouldn't be in the changed 21828ee66afeSJosef Bacik * list. If it is then we have multiple roots pointing 21838ee66afeSJosef Bacik * at the same bytenr which indicates corruption, or 21848ee66afeSJosef Bacik * we've made a mistake in the backref walking code. 21858ee66afeSJosef Bacik */ 21868ee66afeSJosef Bacik ASSERT(next->new_bytenr == 0); 21878ee66afeSJosef Bacik ASSERT(list_empty(&next->list)); 21888ee66afeSJosef Bacik if (next->new_bytenr || !list_empty(&next->list)) { 21898ee66afeSJosef Bacik btrfs_err(trans->fs_info, 21908ee66afeSJosef Bacik "bytenr %llu possibly has multiple roots pointing at the same bytenr %llu", 21918ee66afeSJosef Bacik node->bytenr, next->bytenr); 21928ee66afeSJosef Bacik return ERR_PTR(-EUCLEAN); 21938ee66afeSJosef Bacik } 21948ee66afeSJosef Bacik 21953fd0a558SYan, Zheng next->new_bytenr = root->node->start; 219600246528SJosef Bacik btrfs_put_root(next->root); 219700246528SJosef Bacik next->root = btrfs_grab_root(root); 21980b530bc5SJosef Bacik ASSERT(next->root); 21993fd0a558SYan, Zheng list_add_tail(&next->list, 22003fd0a558SYan, Zheng &rc->backref_cache.changed); 22019569cc20SQu Wenruo mark_block_processed(rc, next); 22025d4f98a2SYan Zheng break; 22035d4f98a2SYan Zheng } 22045d4f98a2SYan Zheng 22053fd0a558SYan, Zheng WARN_ON(1); 22065d4f98a2SYan Zheng root = NULL; 22075d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 22085d4f98a2SYan Zheng if (!next || next->level <= node->level) 22095d4f98a2SYan Zheng break; 22105d4f98a2SYan Zheng } 2211cbdc2ebcSJosef Bacik if (!root) { 2212cbdc2ebcSJosef Bacik /* 2213cbdc2ebcSJosef Bacik * This can happen if there's fs corruption or if there's a bug 2214cbdc2ebcSJosef Bacik * in the backref lookup code. 2215cbdc2ebcSJosef Bacik */ 2216cbdc2ebcSJosef Bacik ASSERT(0); 2217cbdc2ebcSJosef Bacik return ERR_PTR(-ENOENT); 2218cbdc2ebcSJosef Bacik } 22195d4f98a2SYan Zheng 22203fd0a558SYan, Zheng next = node; 22213fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 22223fd0a558SYan, Zheng while (1) { 22233fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 22243fd0a558SYan, Zheng if (--index < 0) 22253fd0a558SYan, Zheng break; 22263fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 22273fd0a558SYan, Zheng } 22285d4f98a2SYan Zheng return root; 22295d4f98a2SYan Zheng } 22305d4f98a2SYan Zheng 22313fd0a558SYan, Zheng /* 223292a7cc42SQu Wenruo * Select a tree root for relocation. 223392a7cc42SQu Wenruo * 223492a7cc42SQu Wenruo * Return NULL if the block is not shareable. We should use do_relocation() in 223592a7cc42SQu Wenruo * this case. 223692a7cc42SQu Wenruo * 223792a7cc42SQu Wenruo * Return a tree root pointer if the block is shareable. 223892a7cc42SQu Wenruo * Return -ENOENT if the block is root of reloc tree. 22393fd0a558SYan, Zheng */ 22405d4f98a2SYan Zheng static noinline_for_stack 2241a26195a5SQu Wenruo struct btrfs_root *select_one_root(struct btrfs_backref_node *node) 22425d4f98a2SYan Zheng { 2243a26195a5SQu Wenruo struct btrfs_backref_node *next; 22443fd0a558SYan, Zheng struct btrfs_root *root; 22453fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 2246a26195a5SQu Wenruo struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 22473fd0a558SYan, Zheng int index = 0; 22483fd0a558SYan, Zheng 22493fd0a558SYan, Zheng next = node; 22503fd0a558SYan, Zheng while (1) { 22513fd0a558SYan, Zheng cond_resched(); 22523fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 22533fd0a558SYan, Zheng root = next->root; 22548717cf44SJosef Bacik 22558717cf44SJosef Bacik /* 22568717cf44SJosef Bacik * This can occur if we have incomplete extent refs leading all 22578717cf44SJosef Bacik * the way up a particular path, in this case return -EUCLEAN. 22588717cf44SJosef Bacik */ 22598717cf44SJosef Bacik if (!root) 22608717cf44SJosef Bacik return ERR_PTR(-EUCLEAN); 22613fd0a558SYan, Zheng 226292a7cc42SQu Wenruo /* No other choice for non-shareable tree */ 226392a7cc42SQu Wenruo if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) 22643fd0a558SYan, Zheng return root; 22653fd0a558SYan, Zheng 22663fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 22673fd0a558SYan, Zheng fs_root = root; 22683fd0a558SYan, Zheng 22693fd0a558SYan, Zheng if (next != node) 22703fd0a558SYan, Zheng return NULL; 22713fd0a558SYan, Zheng 22723fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 22733fd0a558SYan, Zheng if (!next || next->level <= node->level) 22743fd0a558SYan, Zheng break; 22753fd0a558SYan, Zheng } 22763fd0a558SYan, Zheng 22773fd0a558SYan, Zheng if (!fs_root) 22783fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 22793fd0a558SYan, Zheng return fs_root; 22805d4f98a2SYan Zheng } 22815d4f98a2SYan Zheng 22825d4f98a2SYan Zheng static noinline_for_stack 22833fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 2284a26195a5SQu Wenruo struct btrfs_backref_node *node, int reserve) 22855d4f98a2SYan Zheng { 22860b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 2287a26195a5SQu Wenruo struct btrfs_backref_node *next = node; 2288a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 2289a26195a5SQu Wenruo struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 22903fd0a558SYan, Zheng u64 num_bytes = 0; 22913fd0a558SYan, Zheng int index = 0; 22925d4f98a2SYan Zheng 22933fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 22943fd0a558SYan, Zheng 22953fd0a558SYan, Zheng while (next) { 22963fd0a558SYan, Zheng cond_resched(); 22975d4f98a2SYan Zheng while (1) { 22983fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 22995d4f98a2SYan Zheng break; 23005d4f98a2SYan Zheng 23010b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 23023fd0a558SYan, Zheng 23033fd0a558SYan, Zheng if (list_empty(&next->upper)) 23043fd0a558SYan, Zheng break; 23053fd0a558SYan, Zheng 23063fd0a558SYan, Zheng edge = list_entry(next->upper.next, 2307a26195a5SQu Wenruo struct btrfs_backref_edge, list[LOWER]); 23083fd0a558SYan, Zheng edges[index++] = edge; 23093fd0a558SYan, Zheng next = edge->node[UPPER]; 23105d4f98a2SYan Zheng } 23113fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 23123fd0a558SYan, Zheng } 23133fd0a558SYan, Zheng return num_bytes; 23143fd0a558SYan, Zheng } 23153fd0a558SYan, Zheng 23163fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 23173fd0a558SYan, Zheng struct reloc_control *rc, 2318a26195a5SQu Wenruo struct btrfs_backref_node *node) 23193fd0a558SYan, Zheng { 23203fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2321da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 23223fd0a558SYan, Zheng u64 num_bytes; 23233fd0a558SYan, Zheng int ret; 23240647bf56SWang Shilong u64 tmp; 23253fd0a558SYan, Zheng 23263fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 23273fd0a558SYan, Zheng 23283fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 23290647bf56SWang Shilong rc->reserved_bytes += num_bytes; 23308ca17f0fSJosef Bacik 23318ca17f0fSJosef Bacik /* 23328ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 23338ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 23348ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 23358ca17f0fSJosef Bacik */ 23369270501cSJosef Bacik ret = btrfs_block_rsv_refill(fs_info, rc->block_rsv, num_bytes, 23378ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 23383fd0a558SYan, Zheng if (ret) { 2339da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 23400647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 23410647bf56SWang Shilong tmp <<= 1; 23420647bf56SWang Shilong /* 23430647bf56SWang Shilong * only one thread can access block_rsv at this point, 23440647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 23450647bf56SWang Shilong * we expand more reservation size here to allow enough 234652042d8eSAndrea Gelmini * space for relocation and we will return earlier in 23470647bf56SWang Shilong * enospc case. 23480647bf56SWang Shilong */ 2349da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 23500647bf56SWang Shilong RELOCATION_RESERVED_NODES; 23518ca17f0fSJosef Bacik return -EAGAIN; 23523fd0a558SYan, Zheng } 23533fd0a558SYan, Zheng 23543fd0a558SYan, Zheng return 0; 23553fd0a558SYan, Zheng } 23563fd0a558SYan, Zheng 23575d4f98a2SYan Zheng /* 23585d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 23595d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 23605d4f98a2SYan Zheng * 23615d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 23625d4f98a2SYan Zheng * in that case this function just updates pointers. 23635d4f98a2SYan Zheng */ 23645d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 23653fd0a558SYan, Zheng struct reloc_control *rc, 2366a26195a5SQu Wenruo struct btrfs_backref_node *node, 23675d4f98a2SYan Zheng struct btrfs_key *key, 23685d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 23695d4f98a2SYan Zheng { 2370a26195a5SQu Wenruo struct btrfs_backref_node *upper; 2371a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 2372a26195a5SQu Wenruo struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 23735d4f98a2SYan Zheng struct btrfs_root *root; 23745d4f98a2SYan Zheng struct extent_buffer *eb; 23755d4f98a2SYan Zheng u32 blocksize; 23765d4f98a2SYan Zheng u64 bytenr; 23775d4f98a2SYan Zheng int slot; 23788df01fddSNikolay Borisov int ret = 0; 23795d4f98a2SYan Zheng 2380ffe30dd8SJosef Bacik /* 2381ffe30dd8SJosef Bacik * If we are lowest then this is the first time we're processing this 2382ffe30dd8SJosef Bacik * block, and thus shouldn't have an eb associated with it yet. 2383ffe30dd8SJosef Bacik */ 2384ffe30dd8SJosef Bacik ASSERT(!lowest || !node->eb); 23855d4f98a2SYan Zheng 23865d4f98a2SYan Zheng path->lowest_level = node->level + 1; 23873fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 23885d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 238982fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 2390581c1760SQu Wenruo 23915d4f98a2SYan Zheng cond_resched(); 23925d4f98a2SYan Zheng 23935d4f98a2SYan Zheng upper = edge->node[UPPER]; 2394dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 2395cbdc2ebcSJosef Bacik if (IS_ERR(root)) { 2396cbdc2ebcSJosef Bacik ret = PTR_ERR(root); 2397cbdc2ebcSJosef Bacik goto next; 2398cbdc2ebcSJosef Bacik } 23995d4f98a2SYan Zheng 24003fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 24013fd0a558SYan, Zheng if (!lowest) { 2402e3b83361SQu Wenruo ret = btrfs_bin_search(upper->eb, key, &slot); 24038df01fddSNikolay Borisov if (ret < 0) 2404cbca7d59SFilipe Manana goto next; 24053fd0a558SYan, Zheng BUG_ON(ret); 24063fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 24073fd0a558SYan, Zheng if (node->eb->start == bytenr) 24083fd0a558SYan, Zheng goto next; 24093fd0a558SYan, Zheng } 2410b0fe7078SQu Wenruo btrfs_backref_drop_node_buffer(upper); 24113fd0a558SYan, Zheng } 24125d4f98a2SYan Zheng 24135d4f98a2SYan Zheng if (!upper->eb) { 24145d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 24153561b9dbSLiu Bo if (ret) { 24168df01fddSNikolay Borisov if (ret > 0) 24178df01fddSNikolay Borisov ret = -ENOENT; 24183561b9dbSLiu Bo 24193561b9dbSLiu Bo btrfs_release_path(path); 24205d4f98a2SYan Zheng break; 24215d4f98a2SYan Zheng } 24225d4f98a2SYan Zheng 24233fd0a558SYan, Zheng if (!upper->eb) { 24243fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 24253fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 24263fd0a558SYan, Zheng } else { 24273fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 24283fd0a558SYan, Zheng } 24293fd0a558SYan, Zheng 24303fd0a558SYan, Zheng upper->locked = 1; 24313fd0a558SYan, Zheng path->locks[upper->level] = 0; 24323fd0a558SYan, Zheng 24335d4f98a2SYan Zheng slot = path->slots[upper->level]; 2434b3b4aa74SDavid Sterba btrfs_release_path(path); 24355d4f98a2SYan Zheng } else { 2436e3b83361SQu Wenruo ret = btrfs_bin_search(upper->eb, key, &slot); 24378df01fddSNikolay Borisov if (ret < 0) 2438cbca7d59SFilipe Manana goto next; 24395d4f98a2SYan Zheng BUG_ON(ret); 24405d4f98a2SYan Zheng } 24415d4f98a2SYan Zheng 24425d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 24433fd0a558SYan, Zheng if (lowest) { 24444547f4d8SLiu Bo if (bytenr != node->bytenr) { 24454547f4d8SLiu Bo btrfs_err(root->fs_info, 24464547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 24474547f4d8SLiu Bo bytenr, node->bytenr, slot, 24484547f4d8SLiu Bo upper->eb->start); 24498df01fddSNikolay Borisov ret = -EIO; 24504547f4d8SLiu Bo goto next; 24514547f4d8SLiu Bo } 24525d4f98a2SYan Zheng } else { 24533fd0a558SYan, Zheng if (node->eb->start == bytenr) 24543fd0a558SYan, Zheng goto next; 24555d4f98a2SYan Zheng } 24565d4f98a2SYan Zheng 2457da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 2458c9752536SJosef Bacik eb = btrfs_read_node_slot(upper->eb, slot); 245964c043deSLiu Bo if (IS_ERR(eb)) { 24608df01fddSNikolay Borisov ret = PTR_ERR(eb); 246164c043deSLiu Bo goto next; 246297d9a8a4STsutomu Itoh } 24635d4f98a2SYan Zheng btrfs_tree_lock(eb); 24645d4f98a2SYan Zheng 24655d4f98a2SYan Zheng if (!node->eb) { 24665d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 24679631e4ccSJosef Bacik slot, &eb, BTRFS_NESTING_COW); 24683fd0a558SYan, Zheng btrfs_tree_unlock(eb); 24693fd0a558SYan, Zheng free_extent_buffer(eb); 24708df01fddSNikolay Borisov if (ret < 0) 24713fd0a558SYan, Zheng goto next; 2472ffe30dd8SJosef Bacik /* 2473ffe30dd8SJosef Bacik * We've just COWed this block, it should have updated 2474ffe30dd8SJosef Bacik * the correct backref node entry. 2475ffe30dd8SJosef Bacik */ 2476ffe30dd8SJosef Bacik ASSERT(node->eb == eb); 24775d4f98a2SYan Zheng } else { 24785d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 24795d4f98a2SYan Zheng node->eb->start); 24805d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 24815d4f98a2SYan Zheng trans->transid); 24825d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 24835d4f98a2SYan Zheng 248482fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, 24855d4f98a2SYan Zheng node->eb->start, blocksize, 248682fa113fSQu Wenruo upper->eb->start); 248782fa113fSQu Wenruo btrfs_init_tree_ref(&ref, node->level, 2488f42c5da6SNikolay Borisov btrfs_header_owner(upper->eb), 2489f42c5da6SNikolay Borisov root->root_key.objectid, false); 249082fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 2491eb6b7fb4SJosef Bacik if (!ret) 2492eb6b7fb4SJosef Bacik ret = btrfs_drop_subtree(trans, root, eb, 2493eb6b7fb4SJosef Bacik upper->eb); 2494eb6b7fb4SJosef Bacik if (ret) 2495eb6b7fb4SJosef Bacik btrfs_abort_transaction(trans, ret); 24965d4f98a2SYan Zheng } 24973fd0a558SYan, Zheng next: 24983fd0a558SYan, Zheng if (!upper->pending) 2499b0fe7078SQu Wenruo btrfs_backref_drop_node_buffer(upper); 25003fd0a558SYan, Zheng else 2501b0fe7078SQu Wenruo btrfs_backref_unlock_node_buffer(upper); 25028df01fddSNikolay Borisov if (ret) 25033fd0a558SYan, Zheng break; 25045d4f98a2SYan Zheng } 25053fd0a558SYan, Zheng 25068df01fddSNikolay Borisov if (!ret && node->pending) { 2507b0fe7078SQu Wenruo btrfs_backref_drop_node_buffer(node); 25083fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 25093fd0a558SYan, Zheng node->pending = 0; 25105d4f98a2SYan Zheng } 25113fd0a558SYan, Zheng 25125d4f98a2SYan Zheng path->lowest_level = 0; 2513ffe30dd8SJosef Bacik 2514ffe30dd8SJosef Bacik /* 2515ffe30dd8SJosef Bacik * We should have allocated all of our space in the block rsv and thus 2516ffe30dd8SJosef Bacik * shouldn't ENOSPC. 2517ffe30dd8SJosef Bacik */ 2518ffe30dd8SJosef Bacik ASSERT(ret != -ENOSPC); 25198df01fddSNikolay Borisov return ret; 25205d4f98a2SYan Zheng } 25215d4f98a2SYan Zheng 25225d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 25233fd0a558SYan, Zheng struct reloc_control *rc, 2524a26195a5SQu Wenruo struct btrfs_backref_node *node, 25255d4f98a2SYan Zheng struct btrfs_path *path) 25265d4f98a2SYan Zheng { 25275d4f98a2SYan Zheng struct btrfs_key key; 25285d4f98a2SYan Zheng 25295d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 25303fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 25315d4f98a2SYan Zheng } 25325d4f98a2SYan Zheng 25335d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 25343fd0a558SYan, Zheng struct reloc_control *rc, 25353fd0a558SYan, Zheng struct btrfs_path *path, int err) 25365d4f98a2SYan Zheng { 25373fd0a558SYan, Zheng LIST_HEAD(list); 2538a26195a5SQu Wenruo struct btrfs_backref_cache *cache = &rc->backref_cache; 2539a26195a5SQu Wenruo struct btrfs_backref_node *node; 25405d4f98a2SYan Zheng int level; 25415d4f98a2SYan Zheng int ret; 25425d4f98a2SYan Zheng 25435d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 25445d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 25455d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 2546a26195a5SQu Wenruo struct btrfs_backref_node, list); 25473fd0a558SYan, Zheng list_move_tail(&node->list, &list); 25483fd0a558SYan, Zheng BUG_ON(!node->pending); 25495d4f98a2SYan Zheng 25503fd0a558SYan, Zheng if (!err) { 25513fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 25525d4f98a2SYan Zheng if (ret < 0) 25535d4f98a2SYan Zheng err = ret; 25545d4f98a2SYan Zheng } 25555d4f98a2SYan Zheng } 25563fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 25573fd0a558SYan, Zheng } 25585d4f98a2SYan Zheng return err; 25595d4f98a2SYan Zheng } 25605d4f98a2SYan Zheng 25615d4f98a2SYan Zheng /* 25625d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 25635d4f98a2SYan Zheng * as processed. 25645d4f98a2SYan Zheng */ 25655d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 2566a26195a5SQu Wenruo struct btrfs_backref_node *node) 25675d4f98a2SYan Zheng { 2568a26195a5SQu Wenruo struct btrfs_backref_node *next = node; 2569a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 2570a26195a5SQu Wenruo struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25715d4f98a2SYan Zheng int index = 0; 25725d4f98a2SYan Zheng 25735d4f98a2SYan Zheng while (next) { 25745d4f98a2SYan Zheng cond_resched(); 25755d4f98a2SYan Zheng while (1) { 25765d4f98a2SYan Zheng if (next->processed) 25775d4f98a2SYan Zheng break; 25785d4f98a2SYan Zheng 25799569cc20SQu Wenruo mark_block_processed(rc, next); 25805d4f98a2SYan Zheng 25815d4f98a2SYan Zheng if (list_empty(&next->upper)) 25825d4f98a2SYan Zheng break; 25835d4f98a2SYan Zheng 25845d4f98a2SYan Zheng edge = list_entry(next->upper.next, 2585a26195a5SQu Wenruo struct btrfs_backref_edge, list[LOWER]); 25865d4f98a2SYan Zheng edges[index++] = edge; 25875d4f98a2SYan Zheng next = edge->node[UPPER]; 25885d4f98a2SYan Zheng } 25895d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 25905d4f98a2SYan Zheng } 25915d4f98a2SYan Zheng } 25925d4f98a2SYan Zheng 25937476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 25945d4f98a2SYan Zheng { 2595da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 25967476dfdaSDavid Sterba 25975d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 25989655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 25995d4f98a2SYan Zheng return 1; 26005d4f98a2SYan Zheng return 0; 26015d4f98a2SYan Zheng } 26025d4f98a2SYan Zheng 26032ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 26045d4f98a2SYan Zheng struct tree_block *block) 26055d4f98a2SYan Zheng { 26065d4f98a2SYan Zheng struct extent_buffer *eb; 26075d4f98a2SYan Zheng 2608f7ba2d37SJosef Bacik eb = read_tree_block(fs_info, block->bytenr, block->owner, 2609f7ba2d37SJosef Bacik block->key.offset, block->level, NULL); 26104eb150d6SQu Wenruo if (IS_ERR(eb)) 261164c043deSLiu Bo return PTR_ERR(eb); 26124eb150d6SQu Wenruo if (!extent_buffer_uptodate(eb)) { 2613416bc658SJosef Bacik free_extent_buffer(eb); 2614416bc658SJosef Bacik return -EIO; 2615416bc658SJosef Bacik } 26165d4f98a2SYan Zheng if (block->level == 0) 26175d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 26185d4f98a2SYan Zheng else 26195d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 26205d4f98a2SYan Zheng free_extent_buffer(eb); 26215d4f98a2SYan Zheng block->key_ready = 1; 26225d4f98a2SYan Zheng return 0; 26235d4f98a2SYan Zheng } 26245d4f98a2SYan Zheng 26255d4f98a2SYan Zheng /* 26265d4f98a2SYan Zheng * helper function to relocate a tree block 26275d4f98a2SYan Zheng */ 26285d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 26295d4f98a2SYan Zheng struct reloc_control *rc, 2630a26195a5SQu Wenruo struct btrfs_backref_node *node, 26315d4f98a2SYan Zheng struct btrfs_key *key, 26325d4f98a2SYan Zheng struct btrfs_path *path) 26335d4f98a2SYan Zheng { 26345d4f98a2SYan Zheng struct btrfs_root *root; 26353fd0a558SYan, Zheng int ret = 0; 26365d4f98a2SYan Zheng 26373fd0a558SYan, Zheng if (!node) 26385d4f98a2SYan Zheng return 0; 26393fd0a558SYan, Zheng 26405f6b2e5cSJosef Bacik /* 26415f6b2e5cSJosef Bacik * If we fail here we want to drop our backref_node because we are going 26425f6b2e5cSJosef Bacik * to start over and regenerate the tree for it. 26435f6b2e5cSJosef Bacik */ 26445f6b2e5cSJosef Bacik ret = reserve_metadata_space(trans, rc, node); 26455f6b2e5cSJosef Bacik if (ret) 26465f6b2e5cSJosef Bacik goto out; 26475f6b2e5cSJosef Bacik 26483fd0a558SYan, Zheng BUG_ON(node->processed); 2649147d256eSZhaolei root = select_one_root(node); 26508717cf44SJosef Bacik if (IS_ERR(root)) { 26518717cf44SJosef Bacik ret = PTR_ERR(root); 26528717cf44SJosef Bacik 26538717cf44SJosef Bacik /* See explanation in select_one_root for the -EUCLEAN case. */ 26548717cf44SJosef Bacik ASSERT(ret == -ENOENT); 26558717cf44SJosef Bacik if (ret == -ENOENT) { 26568717cf44SJosef Bacik ret = 0; 26573fd0a558SYan, Zheng update_processed_blocks(rc, node); 26588717cf44SJosef Bacik } 26593fd0a558SYan, Zheng goto out; 26605d4f98a2SYan Zheng } 26615d4f98a2SYan Zheng 26623fd0a558SYan, Zheng if (root) { 266392a7cc42SQu Wenruo if (test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) { 26641c7bfa15SJosef Bacik /* 26651c7bfa15SJosef Bacik * This block was the root block of a root, and this is 26661c7bfa15SJosef Bacik * the first time we're processing the block and thus it 26671c7bfa15SJosef Bacik * should not have had the ->new_bytenr modified and 26681c7bfa15SJosef Bacik * should have not been included on the changed list. 26691c7bfa15SJosef Bacik * 26701c7bfa15SJosef Bacik * However in the case of corruption we could have 26711c7bfa15SJosef Bacik * multiple refs pointing to the same block improperly, 26721c7bfa15SJosef Bacik * and thus we would trip over these checks. ASSERT() 26731c7bfa15SJosef Bacik * for the developer case, because it could indicate a 26741c7bfa15SJosef Bacik * bug in the backref code, however error out for a 26751c7bfa15SJosef Bacik * normal user in the case of corruption. 26761c7bfa15SJosef Bacik */ 26771c7bfa15SJosef Bacik ASSERT(node->new_bytenr == 0); 26781c7bfa15SJosef Bacik ASSERT(list_empty(&node->list)); 26791c7bfa15SJosef Bacik if (node->new_bytenr || !list_empty(&node->list)) { 26801c7bfa15SJosef Bacik btrfs_err(root->fs_info, 26811c7bfa15SJosef Bacik "bytenr %llu has improper references to it", 26821c7bfa15SJosef Bacik node->bytenr); 26831c7bfa15SJosef Bacik ret = -EUCLEAN; 26841c7bfa15SJosef Bacik goto out; 26851c7bfa15SJosef Bacik } 2686d18c7bd9SJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 2687d18c7bd9SJosef Bacik if (ret) 2688d18c7bd9SJosef Bacik goto out; 268939200e59SJosef Bacik /* 269039200e59SJosef Bacik * Another thread could have failed, need to check if we 269139200e59SJosef Bacik * have reloc_root actually set. 269239200e59SJosef Bacik */ 269339200e59SJosef Bacik if (!root->reloc_root) { 269439200e59SJosef Bacik ret = -ENOENT; 269539200e59SJosef Bacik goto out; 269639200e59SJosef Bacik } 26973fd0a558SYan, Zheng root = root->reloc_root; 26983fd0a558SYan, Zheng node->new_bytenr = root->node->start; 269900246528SJosef Bacik btrfs_put_root(node->root); 270000246528SJosef Bacik node->root = btrfs_grab_root(root); 27010b530bc5SJosef Bacik ASSERT(node->root); 27023fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 27033fd0a558SYan, Zheng } else { 27045d4f98a2SYan Zheng path->lowest_level = node->level; 27052bb2e00eSFilipe Manana if (root == root->fs_info->chunk_root) 27062bb2e00eSFilipe Manana btrfs_reserve_chunk_metadata(trans, false); 27075d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 2708b3b4aa74SDavid Sterba btrfs_release_path(path); 27092bb2e00eSFilipe Manana if (root == root->fs_info->chunk_root) 27102bb2e00eSFilipe Manana btrfs_trans_release_chunk_metadata(trans); 27113fd0a558SYan, Zheng if (ret > 0) 27125d4f98a2SYan Zheng ret = 0; 27133fd0a558SYan, Zheng } 27143fd0a558SYan, Zheng if (!ret) 27153fd0a558SYan, Zheng update_processed_blocks(rc, node); 27163fd0a558SYan, Zheng } else { 27173fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 27183fd0a558SYan, Zheng } 27195d4f98a2SYan Zheng out: 27200647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 2721023acb07SQu Wenruo btrfs_backref_cleanup_node(&rc->backref_cache, node); 27225d4f98a2SYan Zheng return ret; 27235d4f98a2SYan Zheng } 27245d4f98a2SYan Zheng 27255d4f98a2SYan Zheng /* 27265d4f98a2SYan Zheng * relocate a list of blocks 27275d4f98a2SYan Zheng */ 27285d4f98a2SYan Zheng static noinline_for_stack 27295d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 27305d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 27315d4f98a2SYan Zheng { 27322ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 2733a26195a5SQu Wenruo struct btrfs_backref_node *node; 27345d4f98a2SYan Zheng struct btrfs_path *path; 27355d4f98a2SYan Zheng struct tree_block *block; 273698ff7b94SQu Wenruo struct tree_block *next; 27375d4f98a2SYan Zheng int ret; 27385d4f98a2SYan Zheng int err = 0; 27395d4f98a2SYan Zheng 27405d4f98a2SYan Zheng path = btrfs_alloc_path(); 2741e1a12670SLiu Bo if (!path) { 2742e1a12670SLiu Bo err = -ENOMEM; 274334c2b290SDavid Sterba goto out_free_blocks; 2744e1a12670SLiu Bo } 27455d4f98a2SYan Zheng 274698ff7b94SQu Wenruo /* Kick in readahead for tree blocks with missing keys */ 274798ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 27485d4f98a2SYan Zheng if (!block->key_ready) 2749f7ba2d37SJosef Bacik btrfs_readahead_tree_block(fs_info, block->bytenr, 2750f7ba2d37SJosef Bacik block->owner, 0, 27513fbaf258SJosef Bacik block->level); 27525d4f98a2SYan Zheng } 27535d4f98a2SYan Zheng 275498ff7b94SQu Wenruo /* Get first keys */ 275598ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 275634c2b290SDavid Sterba if (!block->key_ready) { 27572ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 275834c2b290SDavid Sterba if (err) 275934c2b290SDavid Sterba goto out_free_path; 276034c2b290SDavid Sterba } 27615d4f98a2SYan Zheng } 27625d4f98a2SYan Zheng 276398ff7b94SQu Wenruo /* Do tree relocation */ 276498ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 27653fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 27665d4f98a2SYan Zheng block->level, block->bytenr); 27675d4f98a2SYan Zheng if (IS_ERR(node)) { 27685d4f98a2SYan Zheng err = PTR_ERR(node); 27695d4f98a2SYan Zheng goto out; 27705d4f98a2SYan Zheng } 27715d4f98a2SYan Zheng 27725d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 27735d4f98a2SYan Zheng path); 27745d4f98a2SYan Zheng if (ret < 0) { 27755d4f98a2SYan Zheng err = ret; 277650dbbb71SJosef Bacik break; 27775d4f98a2SYan Zheng } 27785d4f98a2SYan Zheng } 27795d4f98a2SYan Zheng out: 27803fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 27815d4f98a2SYan Zheng 278234c2b290SDavid Sterba out_free_path: 27835d4f98a2SYan Zheng btrfs_free_path(path); 278434c2b290SDavid Sterba out_free_blocks: 2785e1a12670SLiu Bo free_block_list(blocks); 27865d4f98a2SYan Zheng return err; 27875d4f98a2SYan Zheng } 27885d4f98a2SYan Zheng 2789056d9becSNikolay Borisov static noinline_for_stack int prealloc_file_extent_cluster( 2790056d9becSNikolay Borisov struct btrfs_inode *inode, 2791efa56464SYan, Zheng struct file_extent_cluster *cluster) 2792efa56464SYan, Zheng { 2793efa56464SYan, Zheng u64 alloc_hint = 0; 2794efa56464SYan, Zheng u64 start; 2795efa56464SYan, Zheng u64 end; 2796056d9becSNikolay Borisov u64 offset = inode->index_cnt; 2797efa56464SYan, Zheng u64 num_bytes; 27984e9d0d01SNikolay Borisov int nr; 2799efa56464SYan, Zheng int ret = 0; 28009d9ea1e6SQu Wenruo u64 i_size = i_size_read(&inode->vfs_inode); 2801dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 2802dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 2803214e61d0SNikolay Borisov u64 cur_offset = prealloc_start; 2804efa56464SYan, Zheng 28059d9ea1e6SQu Wenruo /* 28069d9ea1e6SQu Wenruo * For subpage case, previous i_size may not be aligned to PAGE_SIZE. 28079d9ea1e6SQu Wenruo * This means the range [i_size, PAGE_END + 1) is filled with zeros by 28089d9ea1e6SQu Wenruo * btrfs_do_readpage() call of previously relocated file cluster. 28099d9ea1e6SQu Wenruo * 28109d9ea1e6SQu Wenruo * If the current cluster starts in the above range, btrfs_do_readpage() 28119d9ea1e6SQu Wenruo * will skip the read, and relocate_one_page() will later writeback 28129d9ea1e6SQu Wenruo * the padding zeros as new data, causing data corruption. 28139d9ea1e6SQu Wenruo * 28149d9ea1e6SQu Wenruo * Here we have to manually invalidate the range (i_size, PAGE_END + 1). 28159d9ea1e6SQu Wenruo */ 28169d9ea1e6SQu Wenruo if (!IS_ALIGNED(i_size, PAGE_SIZE)) { 28179d9ea1e6SQu Wenruo struct address_space *mapping = inode->vfs_inode.i_mapping; 28189d9ea1e6SQu Wenruo struct btrfs_fs_info *fs_info = inode->root->fs_info; 28199d9ea1e6SQu Wenruo const u32 sectorsize = fs_info->sectorsize; 28209d9ea1e6SQu Wenruo struct page *page; 28219d9ea1e6SQu Wenruo 28229d9ea1e6SQu Wenruo ASSERT(sectorsize < PAGE_SIZE); 28239d9ea1e6SQu Wenruo ASSERT(IS_ALIGNED(i_size, sectorsize)); 28249d9ea1e6SQu Wenruo 28259d9ea1e6SQu Wenruo /* 28269d9ea1e6SQu Wenruo * Subpage can't handle page with DIRTY but without UPTODATE 28279d9ea1e6SQu Wenruo * bit as it can lead to the following deadlock: 28289d9ea1e6SQu Wenruo * 2829fb12489bSMatthew Wilcox (Oracle) * btrfs_read_folio() 28309d9ea1e6SQu Wenruo * | Page already *locked* 28319d9ea1e6SQu Wenruo * |- btrfs_lock_and_flush_ordered_range() 28329d9ea1e6SQu Wenruo * |- btrfs_start_ordered_extent() 28339d9ea1e6SQu Wenruo * |- extent_write_cache_pages() 28349d9ea1e6SQu Wenruo * |- lock_page() 28359d9ea1e6SQu Wenruo * We try to lock the page we already hold. 28369d9ea1e6SQu Wenruo * 28379d9ea1e6SQu Wenruo * Here we just writeback the whole data reloc inode, so that 28389d9ea1e6SQu Wenruo * we will be ensured to have no dirty range in the page, and 28399d9ea1e6SQu Wenruo * are safe to clear the uptodate bits. 28409d9ea1e6SQu Wenruo * 28419d9ea1e6SQu Wenruo * This shouldn't cause too much overhead, as we need to write 28429d9ea1e6SQu Wenruo * the data back anyway. 28439d9ea1e6SQu Wenruo */ 28449d9ea1e6SQu Wenruo ret = filemap_write_and_wait(mapping); 28459d9ea1e6SQu Wenruo if (ret < 0) 28469d9ea1e6SQu Wenruo return ret; 28479d9ea1e6SQu Wenruo 28489d9ea1e6SQu Wenruo clear_extent_bits(&inode->io_tree, i_size, 28499d9ea1e6SQu Wenruo round_up(i_size, PAGE_SIZE) - 1, 28509d9ea1e6SQu Wenruo EXTENT_UPTODATE); 28519d9ea1e6SQu Wenruo page = find_lock_page(mapping, i_size >> PAGE_SHIFT); 28529d9ea1e6SQu Wenruo /* 28539d9ea1e6SQu Wenruo * If page is freed we don't need to do anything then, as we 28549d9ea1e6SQu Wenruo * will re-read the whole page anyway. 28559d9ea1e6SQu Wenruo */ 28569d9ea1e6SQu Wenruo if (page) { 28579d9ea1e6SQu Wenruo btrfs_subpage_clear_uptodate(fs_info, page, i_size, 28589d9ea1e6SQu Wenruo round_up(i_size, PAGE_SIZE) - i_size); 28599d9ea1e6SQu Wenruo unlock_page(page); 28609d9ea1e6SQu Wenruo put_page(page); 28619d9ea1e6SQu Wenruo } 28629d9ea1e6SQu Wenruo } 28639d9ea1e6SQu Wenruo 2864efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 2865056d9becSNikolay Borisov ret = btrfs_alloc_data_chunk_ondemand(inode, 2866dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 2867efa56464SYan, Zheng if (ret) 2868214e61d0SNikolay Borisov return ret; 2869efa56464SYan, Zheng 287064708539SJosef Bacik btrfs_inode_lock(&inode->vfs_inode, 0); 28714e9d0d01SNikolay Borisov for (nr = 0; nr < cluster->nr; nr++) { 28729c5c9604SJosef Bacik struct extent_state *cached_state = NULL; 28739c5c9604SJosef Bacik 2874efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 2875efa56464SYan, Zheng if (nr + 1 < cluster->nr) 2876efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 2877efa56464SYan, Zheng else 2878efa56464SYan, Zheng end = cluster->end - offset; 2879efa56464SYan, Zheng 28809c5c9604SJosef Bacik lock_extent(&inode->io_tree, start, end, &cached_state); 2881efa56464SYan, Zheng num_bytes = end + 1 - start; 2882056d9becSNikolay Borisov ret = btrfs_prealloc_file_range(&inode->vfs_inode, 0, start, 2883efa56464SYan, Zheng num_bytes, num_bytes, 2884efa56464SYan, Zheng end + 1, &alloc_hint); 288518513091SWang Xiaoguang cur_offset = end + 1; 28869c5c9604SJosef Bacik unlock_extent(&inode->io_tree, start, end, &cached_state); 2887efa56464SYan, Zheng if (ret) 2888efa56464SYan, Zheng break; 2889efa56464SYan, Zheng } 289064708539SJosef Bacik btrfs_inode_unlock(&inode->vfs_inode, 0); 2891214e61d0SNikolay Borisov 289218513091SWang Xiaoguang if (cur_offset < prealloc_end) 2893056d9becSNikolay Borisov btrfs_free_reserved_data_space_noquota(inode->root->fs_info, 2894a89ef455SFilipe Manana prealloc_end + 1 - cur_offset); 2895efa56464SYan, Zheng return ret; 2896efa56464SYan, Zheng } 2897efa56464SYan, Zheng 28984b01c44fSJohannes Thumshirn static noinline_for_stack int setup_relocation_extent_mapping(struct inode *inode, 28994b01c44fSJohannes Thumshirn u64 start, u64 end, u64 block_start) 29005d4f98a2SYan Zheng { 29015d4f98a2SYan Zheng struct extent_map *em; 29029c5c9604SJosef Bacik struct extent_state *cached_state = NULL; 29030257bb82SYan, Zheng int ret = 0; 29045d4f98a2SYan Zheng 2905172ddd60SDavid Sterba em = alloc_extent_map(); 29060257bb82SYan, Zheng if (!em) 29070257bb82SYan, Zheng return -ENOMEM; 29080257bb82SYan, Zheng 29095d4f98a2SYan Zheng em->start = start; 29100257bb82SYan, Zheng em->len = end + 1 - start; 29110257bb82SYan, Zheng em->block_len = em->len; 29120257bb82SYan, Zheng em->block_start = block_start; 29135d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 29145d4f98a2SYan Zheng 29159c5c9604SJosef Bacik lock_extent(&BTRFS_I(inode)->io_tree, start, end, &cached_state); 2916a1ba4c08SFilipe Manana ret = btrfs_replace_extent_map_range(BTRFS_I(inode), em, false); 29179c5c9604SJosef Bacik unlock_extent(&BTRFS_I(inode)->io_tree, start, end, &cached_state); 2918a1ba4c08SFilipe Manana free_extent_map(em); 2919a1ba4c08SFilipe Manana 29200257bb82SYan, Zheng return ret; 29210257bb82SYan, Zheng } 29225d4f98a2SYan Zheng 2923726a3421SQu Wenruo /* 2924907d2710SDavid Sterba * Allow error injection to test balance/relocation cancellation 2925726a3421SQu Wenruo */ 29261fec12a5SJosef Bacik noinline int btrfs_should_cancel_balance(struct btrfs_fs_info *fs_info) 2927726a3421SQu Wenruo { 29285cb502f4SQu Wenruo return atomic_read(&fs_info->balance_cancel_req) || 2929907d2710SDavid Sterba atomic_read(&fs_info->reloc_cancel_req) || 29305cb502f4SQu Wenruo fatal_signal_pending(current); 2931726a3421SQu Wenruo } 2932726a3421SQu Wenruo ALLOW_ERROR_INJECTION(btrfs_should_cancel_balance, TRUE); 2933726a3421SQu Wenruo 2934c2832898SQu Wenruo static u64 get_cluster_boundary_end(struct file_extent_cluster *cluster, 2935c2832898SQu Wenruo int cluster_nr) 2936c2832898SQu Wenruo { 2937c2832898SQu Wenruo /* Last extent, use cluster end directly */ 2938c2832898SQu Wenruo if (cluster_nr >= cluster->nr - 1) 2939c2832898SQu Wenruo return cluster->end; 2940c2832898SQu Wenruo 2941c2832898SQu Wenruo /* Use next boundary start*/ 2942c2832898SQu Wenruo return cluster->boundary[cluster_nr + 1] - 1; 2943c2832898SQu Wenruo } 2944c2832898SQu Wenruo 2945f47960f4SQu Wenruo static int relocate_one_page(struct inode *inode, struct file_ra_state *ra, 2946f47960f4SQu Wenruo struct file_extent_cluster *cluster, 2947f47960f4SQu Wenruo int *cluster_nr, unsigned long page_index) 2948f47960f4SQu Wenruo { 2949f47960f4SQu Wenruo struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 2950f47960f4SQu Wenruo u64 offset = BTRFS_I(inode)->index_cnt; 2951f47960f4SQu Wenruo const unsigned long last_index = (cluster->end - offset) >> PAGE_SHIFT; 2952f47960f4SQu Wenruo gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 2953f47960f4SQu Wenruo struct page *page; 2954f47960f4SQu Wenruo u64 page_start; 2955f47960f4SQu Wenruo u64 page_end; 2956c2832898SQu Wenruo u64 cur; 2957f47960f4SQu Wenruo int ret; 2958f47960f4SQu Wenruo 2959f47960f4SQu Wenruo ASSERT(page_index <= last_index); 2960f47960f4SQu Wenruo page = find_lock_page(inode->i_mapping, page_index); 2961f47960f4SQu Wenruo if (!page) { 2962f47960f4SQu Wenruo page_cache_sync_readahead(inode->i_mapping, ra, NULL, 2963f47960f4SQu Wenruo page_index, last_index + 1 - page_index); 2964f47960f4SQu Wenruo page = find_or_create_page(inode->i_mapping, page_index, mask); 2965c2832898SQu Wenruo if (!page) 2966c2832898SQu Wenruo return -ENOMEM; 2967f47960f4SQu Wenruo } 2968f47960f4SQu Wenruo ret = set_page_extent_mapped(page); 2969f47960f4SQu Wenruo if (ret < 0) 2970f47960f4SQu Wenruo goto release_page; 2971f47960f4SQu Wenruo 2972f47960f4SQu Wenruo if (PageReadahead(page)) 29732ebdd1dfSMatthew Wilcox (Oracle) page_cache_async_readahead(inode->i_mapping, ra, NULL, 29742ebdd1dfSMatthew Wilcox (Oracle) page_folio(page), page_index, 29752ebdd1dfSMatthew Wilcox (Oracle) last_index + 1 - page_index); 2976f47960f4SQu Wenruo 2977f47960f4SQu Wenruo if (!PageUptodate(page)) { 2978fb12489bSMatthew Wilcox (Oracle) btrfs_read_folio(NULL, page_folio(page)); 2979f47960f4SQu Wenruo lock_page(page); 2980f47960f4SQu Wenruo if (!PageUptodate(page)) { 2981f47960f4SQu Wenruo ret = -EIO; 2982f47960f4SQu Wenruo goto release_page; 2983f47960f4SQu Wenruo } 2984f47960f4SQu Wenruo } 2985f47960f4SQu Wenruo 2986f47960f4SQu Wenruo page_start = page_offset(page); 2987f47960f4SQu Wenruo page_end = page_start + PAGE_SIZE - 1; 2988f47960f4SQu Wenruo 2989c2832898SQu Wenruo /* 2990c2832898SQu Wenruo * Start from the cluster, as for subpage case, the cluster can start 2991c2832898SQu Wenruo * inside the page. 2992c2832898SQu Wenruo */ 2993c2832898SQu Wenruo cur = max(page_start, cluster->boundary[*cluster_nr] - offset); 2994c2832898SQu Wenruo while (cur <= page_end) { 29959c5c9604SJosef Bacik struct extent_state *cached_state = NULL; 2996c2832898SQu Wenruo u64 extent_start = cluster->boundary[*cluster_nr] - offset; 2997c2832898SQu Wenruo u64 extent_end = get_cluster_boundary_end(cluster, 2998c2832898SQu Wenruo *cluster_nr) - offset; 2999c2832898SQu Wenruo u64 clamped_start = max(page_start, extent_start); 3000c2832898SQu Wenruo u64 clamped_end = min(page_end, extent_end); 3001c2832898SQu Wenruo u32 clamped_len = clamped_end + 1 - clamped_start; 3002f47960f4SQu Wenruo 3003c2832898SQu Wenruo /* Reserve metadata for this range */ 3004c2832898SQu Wenruo ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 3005d4135134SFilipe Manana clamped_len, clamped_len, 3006d4135134SFilipe Manana false); 3007c2832898SQu Wenruo if (ret) 3008f47960f4SQu Wenruo goto release_page; 3009f47960f4SQu Wenruo 3010c2832898SQu Wenruo /* Mark the range delalloc and dirty for later writeback */ 30119c5c9604SJosef Bacik lock_extent(&BTRFS_I(inode)->io_tree, clamped_start, clamped_end, 30129c5c9604SJosef Bacik &cached_state); 3013c2832898SQu Wenruo ret = btrfs_set_extent_delalloc(BTRFS_I(inode), clamped_start, 30149c5c9604SJosef Bacik clamped_end, 0, &cached_state); 3015c2832898SQu Wenruo if (ret) { 30169c5c9604SJosef Bacik clear_extent_bit(&BTRFS_I(inode)->io_tree, 3017c2832898SQu Wenruo clamped_start, clamped_end, 30189c5c9604SJosef Bacik EXTENT_LOCKED | EXTENT_BOUNDARY, 30199c5c9604SJosef Bacik &cached_state); 3020c2832898SQu Wenruo btrfs_delalloc_release_metadata(BTRFS_I(inode), 3021c2832898SQu Wenruo clamped_len, true); 3022c2832898SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), 3023c2832898SQu Wenruo clamped_len); 3024c2832898SQu Wenruo goto release_page; 3025f47960f4SQu Wenruo } 3026c2832898SQu Wenruo btrfs_page_set_dirty(fs_info, page, clamped_start, clamped_len); 3027f47960f4SQu Wenruo 3028c2832898SQu Wenruo /* 3029c2832898SQu Wenruo * Set the boundary if it's inside the page. 3030c2832898SQu Wenruo * Data relocation requires the destination extents to have the 3031c2832898SQu Wenruo * same size as the source. 3032c2832898SQu Wenruo * EXTENT_BOUNDARY bit prevents current extent from being merged 3033c2832898SQu Wenruo * with previous extent. 3034c2832898SQu Wenruo */ 3035c2832898SQu Wenruo if (in_range(cluster->boundary[*cluster_nr] - offset, 3036c2832898SQu Wenruo page_start, PAGE_SIZE)) { 3037c2832898SQu Wenruo u64 boundary_start = cluster->boundary[*cluster_nr] - 3038c2832898SQu Wenruo offset; 3039c2832898SQu Wenruo u64 boundary_end = boundary_start + 3040c2832898SQu Wenruo fs_info->sectorsize - 1; 3041c2832898SQu Wenruo 3042c2832898SQu Wenruo set_extent_bits(&BTRFS_I(inode)->io_tree, 3043c2832898SQu Wenruo boundary_start, boundary_end, 3044c2832898SQu Wenruo EXTENT_BOUNDARY); 3045c2832898SQu Wenruo } 30469c5c9604SJosef Bacik unlock_extent(&BTRFS_I(inode)->io_tree, clamped_start, clamped_end, 30479c5c9604SJosef Bacik &cached_state); 3048c2832898SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), clamped_len); 3049c2832898SQu Wenruo cur += clamped_len; 3050c2832898SQu Wenruo 3051c2832898SQu Wenruo /* Crossed extent end, go to next extent */ 3052c2832898SQu Wenruo if (cur >= extent_end) { 3053c2832898SQu Wenruo (*cluster_nr)++; 3054c2832898SQu Wenruo /* Just finished the last extent of the cluster, exit. */ 3055c2832898SQu Wenruo if (*cluster_nr >= cluster->nr) 3056c2832898SQu Wenruo break; 3057c2832898SQu Wenruo } 3058c2832898SQu Wenruo } 3059f47960f4SQu Wenruo unlock_page(page); 3060f47960f4SQu Wenruo put_page(page); 3061f47960f4SQu Wenruo 3062f47960f4SQu Wenruo balance_dirty_pages_ratelimited(inode->i_mapping); 3063f47960f4SQu Wenruo btrfs_throttle(fs_info); 3064f47960f4SQu Wenruo if (btrfs_should_cancel_balance(fs_info)) 3065f47960f4SQu Wenruo ret = -ECANCELED; 3066f47960f4SQu Wenruo return ret; 3067f47960f4SQu Wenruo 3068f47960f4SQu Wenruo release_page: 3069f47960f4SQu Wenruo unlock_page(page); 3070f47960f4SQu Wenruo put_page(page); 3071f47960f4SQu Wenruo return ret; 3072f47960f4SQu Wenruo } 3073f47960f4SQu Wenruo 30740257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 30750257bb82SYan, Zheng struct file_extent_cluster *cluster) 30760257bb82SYan, Zheng { 30770257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 30780257bb82SYan, Zheng unsigned long index; 30790257bb82SYan, Zheng unsigned long last_index; 30800257bb82SYan, Zheng struct file_ra_state *ra; 3081f47960f4SQu Wenruo int cluster_nr = 0; 30820257bb82SYan, Zheng int ret = 0; 30830257bb82SYan, Zheng 30840257bb82SYan, Zheng if (!cluster->nr) 30850257bb82SYan, Zheng return 0; 30860257bb82SYan, Zheng 30870257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 30880257bb82SYan, Zheng if (!ra) 30890257bb82SYan, Zheng return -ENOMEM; 30900257bb82SYan, Zheng 3091056d9becSNikolay Borisov ret = prealloc_file_extent_cluster(BTRFS_I(inode), cluster); 30920257bb82SYan, Zheng if (ret) 3093efa56464SYan, Zheng goto out; 30940257bb82SYan, Zheng 30950257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 30960257bb82SYan, Zheng 30974b01c44fSJohannes Thumshirn ret = setup_relocation_extent_mapping(inode, cluster->start - offset, 3098efa56464SYan, Zheng cluster->end - offset, cluster->start); 3099efa56464SYan, Zheng if (ret) 3100efa56464SYan, Zheng goto out; 3101efa56464SYan, Zheng 310209cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 3103f47960f4SQu Wenruo for (index = (cluster->start - offset) >> PAGE_SHIFT; 3104f47960f4SQu Wenruo index <= last_index && !ret; index++) 3105f47960f4SQu Wenruo ret = relocate_one_page(inode, ra, cluster, &cluster_nr, index); 3106f47960f4SQu Wenruo if (ret == 0) 3107f47960f4SQu Wenruo WARN_ON(cluster_nr != cluster->nr); 3108efa56464SYan, Zheng out: 31090257bb82SYan, Zheng kfree(ra); 31100257bb82SYan, Zheng return ret; 31110257bb82SYan, Zheng } 31120257bb82SYan, Zheng 31130257bb82SYan, Zheng static noinline_for_stack 31140257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 31150257bb82SYan, Zheng struct file_extent_cluster *cluster) 31160257bb82SYan, Zheng { 31170257bb82SYan, Zheng int ret; 31180257bb82SYan, Zheng 31190257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 31200257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 31210257bb82SYan, Zheng if (ret) 31220257bb82SYan, Zheng return ret; 31230257bb82SYan, Zheng cluster->nr = 0; 31240257bb82SYan, Zheng } 31250257bb82SYan, Zheng 31260257bb82SYan, Zheng if (!cluster->nr) 31270257bb82SYan, Zheng cluster->start = extent_key->objectid; 31280257bb82SYan, Zheng else 31290257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 31300257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 31310257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 31320257bb82SYan, Zheng cluster->nr++; 31330257bb82SYan, Zheng 31340257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 31350257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 31360257bb82SYan, Zheng if (ret) 31370257bb82SYan, Zheng return ret; 31380257bb82SYan, Zheng cluster->nr = 0; 31390257bb82SYan, Zheng } 31400257bb82SYan, Zheng return 0; 31415d4f98a2SYan Zheng } 31425d4f98a2SYan Zheng 31435d4f98a2SYan Zheng /* 31445d4f98a2SYan Zheng * helper to add a tree block to the list. 31455d4f98a2SYan Zheng * the major work is getting the generation and level of the block 31465d4f98a2SYan Zheng */ 31475d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 31485d4f98a2SYan Zheng struct btrfs_key *extent_key, 31495d4f98a2SYan Zheng struct btrfs_path *path, 31505d4f98a2SYan Zheng struct rb_root *blocks) 31515d4f98a2SYan Zheng { 31525d4f98a2SYan Zheng struct extent_buffer *eb; 31535d4f98a2SYan Zheng struct btrfs_extent_item *ei; 31545d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 31555d4f98a2SYan Zheng struct tree_block *block; 31565d4f98a2SYan Zheng struct rb_node *rb_node; 31575d4f98a2SYan Zheng u32 item_size; 31585d4f98a2SYan Zheng int level = -1; 31597fdf4b60SWang Shilong u64 generation; 3160f7ba2d37SJosef Bacik u64 owner = 0; 31615d4f98a2SYan Zheng 31625d4f98a2SYan Zheng eb = path->nodes[0]; 31633212fa14SJosef Bacik item_size = btrfs_item_size(eb, path->slots[0]); 31645d4f98a2SYan Zheng 31653173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 31663173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 3167f7ba2d37SJosef Bacik unsigned long ptr = 0, end; 3168f7ba2d37SJosef Bacik 31695d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 31705d4f98a2SYan Zheng struct btrfs_extent_item); 3171f7ba2d37SJosef Bacik end = (unsigned long)ei + item_size; 31723173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 31735d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 31745d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 3175f7ba2d37SJosef Bacik ptr = (unsigned long)(bi + 1); 31765d4f98a2SYan Zheng } else { 31773173a18fSJosef Bacik level = (int)extent_key->offset; 3178f7ba2d37SJosef Bacik ptr = (unsigned long)(ei + 1); 31793173a18fSJosef Bacik } 31803173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 3181f7ba2d37SJosef Bacik 3182f7ba2d37SJosef Bacik /* 3183f7ba2d37SJosef Bacik * We're reading random blocks without knowing their owner ahead 3184f7ba2d37SJosef Bacik * of time. This is ok most of the time, as all reloc roots and 3185f7ba2d37SJosef Bacik * fs roots have the same lock type. However normal trees do 3186f7ba2d37SJosef Bacik * not, and the only way to know ahead of time is to read the 3187f7ba2d37SJosef Bacik * inline ref offset. We know it's an fs root if 3188f7ba2d37SJosef Bacik * 3189f7ba2d37SJosef Bacik * 1. There's more than one ref. 3190f7ba2d37SJosef Bacik * 2. There's a SHARED_DATA_REF_KEY set. 3191f7ba2d37SJosef Bacik * 3. FULL_BACKREF is set on the flags. 3192f7ba2d37SJosef Bacik * 3193f7ba2d37SJosef Bacik * Otherwise it's safe to assume that the ref offset == the 3194f7ba2d37SJosef Bacik * owner of this block, so we can use that when calling 3195f7ba2d37SJosef Bacik * read_tree_block. 3196f7ba2d37SJosef Bacik */ 3197f7ba2d37SJosef Bacik if (btrfs_extent_refs(eb, ei) == 1 && 3198f7ba2d37SJosef Bacik !(btrfs_extent_flags(eb, ei) & 3199f7ba2d37SJosef Bacik BTRFS_BLOCK_FLAG_FULL_BACKREF) && 3200f7ba2d37SJosef Bacik ptr < end) { 3201f7ba2d37SJosef Bacik struct btrfs_extent_inline_ref *iref; 3202f7ba2d37SJosef Bacik int type; 3203f7ba2d37SJosef Bacik 3204f7ba2d37SJosef Bacik iref = (struct btrfs_extent_inline_ref *)ptr; 3205f7ba2d37SJosef Bacik type = btrfs_get_extent_inline_ref_type(eb, iref, 3206f7ba2d37SJosef Bacik BTRFS_REF_TYPE_BLOCK); 3207f7ba2d37SJosef Bacik if (type == BTRFS_REF_TYPE_INVALID) 3208f7ba2d37SJosef Bacik return -EINVAL; 3209f7ba2d37SJosef Bacik if (type == BTRFS_TREE_BLOCK_REF_KEY) 3210f7ba2d37SJosef Bacik owner = btrfs_extent_inline_ref_offset(eb, iref); 3211f7ba2d37SJosef Bacik } 32126d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3213ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3214ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3215ba3c2b19SNikolay Borisov return -EINVAL; 32163173a18fSJosef Bacik } else { 32175d4f98a2SYan Zheng BUG(); 32185d4f98a2SYan Zheng } 32195d4f98a2SYan Zheng 3220b3b4aa74SDavid Sterba btrfs_release_path(path); 32215d4f98a2SYan Zheng 32225d4f98a2SYan Zheng BUG_ON(level == -1); 32235d4f98a2SYan Zheng 32245d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 32255d4f98a2SYan Zheng if (!block) 32265d4f98a2SYan Zheng return -ENOMEM; 32275d4f98a2SYan Zheng 32285d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3229da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 32305d4f98a2SYan Zheng block->key.offset = generation; 32315d4f98a2SYan Zheng block->level = level; 32325d4f98a2SYan Zheng block->key_ready = 0; 3233f7ba2d37SJosef Bacik block->owner = owner; 32345d4f98a2SYan Zheng 3235e9a28dc5SQu Wenruo rb_node = rb_simple_insert(blocks, block->bytenr, &block->rb_node); 323643c04fb1SJeff Mahoney if (rb_node) 3237982c92cbSQu Wenruo btrfs_backref_panic(rc->extent_root->fs_info, block->bytenr, 3238982c92cbSQu Wenruo -EEXIST); 32395d4f98a2SYan Zheng 32405d4f98a2SYan Zheng return 0; 32415d4f98a2SYan Zheng } 32425d4f98a2SYan Zheng 32435d4f98a2SYan Zheng /* 32445d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 32455d4f98a2SYan Zheng */ 32465d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 32475d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 32485d4f98a2SYan Zheng struct rb_root *blocks) 32495d4f98a2SYan Zheng { 32500b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 32515d4f98a2SYan Zheng struct btrfs_path *path; 32525d4f98a2SYan Zheng struct btrfs_key key; 32535d4f98a2SYan Zheng int ret; 32540b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 32555d4f98a2SYan Zheng 32567476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 32575d4f98a2SYan Zheng return 0; 32585d4f98a2SYan Zheng 3259e9a28dc5SQu Wenruo if (rb_simple_search(blocks, bytenr)) 32605d4f98a2SYan Zheng return 0; 32615d4f98a2SYan Zheng 32625d4f98a2SYan Zheng path = btrfs_alloc_path(); 32635d4f98a2SYan Zheng if (!path) 32645d4f98a2SYan Zheng return -ENOMEM; 3265aee68ee5SJosef Bacik again: 32665d4f98a2SYan Zheng key.objectid = bytenr; 3267aee68ee5SJosef Bacik if (skinny) { 3268aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3269aee68ee5SJosef Bacik key.offset = (u64)-1; 3270aee68ee5SJosef Bacik } else { 32715d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 32725d4f98a2SYan Zheng key.offset = blocksize; 3273aee68ee5SJosef Bacik } 32745d4f98a2SYan Zheng 32755d4f98a2SYan Zheng path->search_commit_root = 1; 32765d4f98a2SYan Zheng path->skip_locking = 1; 32775d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 32785d4f98a2SYan Zheng if (ret < 0) 32795d4f98a2SYan Zheng goto out; 32805d4f98a2SYan Zheng 3281aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3282aee68ee5SJosef Bacik if (path->slots[0]) { 3283aee68ee5SJosef Bacik path->slots[0]--; 3284aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3285aee68ee5SJosef Bacik path->slots[0]); 32863173a18fSJosef Bacik if (key.objectid == bytenr && 3287aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3288aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3289aee68ee5SJosef Bacik key.offset == blocksize))) 32903173a18fSJosef Bacik ret = 0; 32913173a18fSJosef Bacik } 3292aee68ee5SJosef Bacik 3293aee68ee5SJosef Bacik if (ret) { 3294aee68ee5SJosef Bacik skinny = false; 3295aee68ee5SJosef Bacik btrfs_release_path(path); 3296aee68ee5SJosef Bacik goto again; 3297aee68ee5SJosef Bacik } 3298aee68ee5SJosef Bacik } 3299cdccee99SLiu Bo if (ret) { 3300cdccee99SLiu Bo ASSERT(ret == 1); 3301cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3302cdccee99SLiu Bo btrfs_err(fs_info, 3303cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3304cdccee99SLiu Bo bytenr); 3305cdccee99SLiu Bo WARN_ON(1); 3306cdccee99SLiu Bo ret = -EINVAL; 3307cdccee99SLiu Bo goto out; 3308cdccee99SLiu Bo } 33093173a18fSJosef Bacik 33105d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 33115d4f98a2SYan Zheng out: 33125d4f98a2SYan Zheng btrfs_free_path(path); 33135d4f98a2SYan Zheng return ret; 33145d4f98a2SYan Zheng } 33155d4f98a2SYan Zheng 33160af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 331732da5386SDavid Sterba struct btrfs_block_group *block_group, 33181bbc621eSChris Mason struct inode *inode, 33191bbc621eSChris Mason u64 ino) 33200af3d00bSJosef Bacik { 33210af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 33220af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 33230af3d00bSJosef Bacik int ret = 0; 33240af3d00bSJosef Bacik 33250af3d00bSJosef Bacik if (inode) 33260af3d00bSJosef Bacik goto truncate; 33270af3d00bSJosef Bacik 33280202e83fSDavid Sterba inode = btrfs_iget(fs_info->sb, ino, root); 33292e19f1f9SAl Viro if (IS_ERR(inode)) 33300af3d00bSJosef Bacik return -ENOENT; 33310af3d00bSJosef Bacik 33320af3d00bSJosef Bacik truncate: 33332ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 33347b61cd92SMiao Xie &fs_info->global_block_rsv); 33357b61cd92SMiao Xie if (ret) 33367b61cd92SMiao Xie goto out; 33377b61cd92SMiao Xie 33387a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 33390af3d00bSJosef Bacik if (IS_ERR(trans)) { 33403612b495STsutomu Itoh ret = PTR_ERR(trans); 33410af3d00bSJosef Bacik goto out; 33420af3d00bSJosef Bacik } 33430af3d00bSJosef Bacik 334477ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 33450af3d00bSJosef Bacik 33463a45bb20SJeff Mahoney btrfs_end_transaction(trans); 33472ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 33480af3d00bSJosef Bacik out: 33490af3d00bSJosef Bacik iput(inode); 33500af3d00bSJosef Bacik return ret; 33510af3d00bSJosef Bacik } 33520af3d00bSJosef Bacik 33535d4f98a2SYan Zheng /* 335419b546d7SQu Wenruo * Locate the free space cache EXTENT_DATA in root tree leaf and delete the 335519b546d7SQu Wenruo * cache inode, to avoid free space cache data extent blocking data relocation. 33565d4f98a2SYan Zheng */ 335719b546d7SQu Wenruo static int delete_v1_space_cache(struct extent_buffer *leaf, 335819b546d7SQu Wenruo struct btrfs_block_group *block_group, 335919b546d7SQu Wenruo u64 data_bytenr) 33605d4f98a2SYan Zheng { 336119b546d7SQu Wenruo u64 space_cache_ino; 336219b546d7SQu Wenruo struct btrfs_file_extent_item *ei; 33635d4f98a2SYan Zheng struct btrfs_key key; 336419b546d7SQu Wenruo bool found = false; 336519b546d7SQu Wenruo int i; 33665d4f98a2SYan Zheng int ret; 33675d4f98a2SYan Zheng 336819b546d7SQu Wenruo if (btrfs_header_owner(leaf) != BTRFS_ROOT_TREE_OBJECTID) 336919b546d7SQu Wenruo return 0; 33705d4f98a2SYan Zheng 337119b546d7SQu Wenruo for (i = 0; i < btrfs_header_nritems(leaf); i++) { 337250e31ef4SQu Wenruo u8 type; 337350e31ef4SQu Wenruo 337419b546d7SQu Wenruo btrfs_item_key_to_cpu(leaf, &key, i); 337519b546d7SQu Wenruo if (key.type != BTRFS_EXTENT_DATA_KEY) 337619b546d7SQu Wenruo continue; 337719b546d7SQu Wenruo ei = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 337850e31ef4SQu Wenruo type = btrfs_file_extent_type(leaf, ei); 337950e31ef4SQu Wenruo 338050e31ef4SQu Wenruo if ((type == BTRFS_FILE_EXTENT_REG || 338150e31ef4SQu Wenruo type == BTRFS_FILE_EXTENT_PREALLOC) && 338219b546d7SQu Wenruo btrfs_file_extent_disk_bytenr(leaf, ei) == data_bytenr) { 338319b546d7SQu Wenruo found = true; 338419b546d7SQu Wenruo space_cache_ino = key.objectid; 338519b546d7SQu Wenruo break; 338619b546d7SQu Wenruo } 338719b546d7SQu Wenruo } 338819b546d7SQu Wenruo if (!found) 338919b546d7SQu Wenruo return -ENOENT; 339019b546d7SQu Wenruo ret = delete_block_group_cache(leaf->fs_info, block_group, NULL, 339119b546d7SQu Wenruo space_cache_ino); 33920af3d00bSJosef Bacik return ret; 33935d4f98a2SYan Zheng } 33945d4f98a2SYan Zheng 33955d4f98a2SYan Zheng /* 33962c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 33975d4f98a2SYan Zheng */ 33985d4f98a2SYan Zheng static noinline_for_stack 33995d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 34005d4f98a2SYan Zheng struct btrfs_key *extent_key, 34015d4f98a2SYan Zheng struct btrfs_path *path, 34025d4f98a2SYan Zheng struct rb_root *blocks) 34035d4f98a2SYan Zheng { 340419b546d7SQu Wenruo struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 340519b546d7SQu Wenruo struct ulist *leaves = NULL; 340619b546d7SQu Wenruo struct ulist_iterator leaf_uiter; 340719b546d7SQu Wenruo struct ulist_node *ref_node = NULL; 340819b546d7SQu Wenruo const u32 blocksize = fs_info->nodesize; 3409647f63bdSFilipe David Borba Manana int ret = 0; 34105d4f98a2SYan Zheng 3411b3b4aa74SDavid Sterba btrfs_release_path(path); 341219b546d7SQu Wenruo ret = btrfs_find_all_leafs(NULL, fs_info, extent_key->objectid, 341319b546d7SQu Wenruo 0, &leaves, NULL, true); 341419b546d7SQu Wenruo if (ret < 0) 341519b546d7SQu Wenruo return ret; 341619b546d7SQu Wenruo 341719b546d7SQu Wenruo ULIST_ITER_INIT(&leaf_uiter); 341819b546d7SQu Wenruo while ((ref_node = ulist_next(leaves, &leaf_uiter))) { 341919b546d7SQu Wenruo struct extent_buffer *eb; 342019b546d7SQu Wenruo 34211b7ec85eSJosef Bacik eb = read_tree_block(fs_info, ref_node->val, 0, 0, 0, NULL); 342219b546d7SQu Wenruo if (IS_ERR(eb)) { 342319b546d7SQu Wenruo ret = PTR_ERR(eb); 342419b546d7SQu Wenruo break; 342519b546d7SQu Wenruo } 342619b546d7SQu Wenruo ret = delete_v1_space_cache(eb, rc->block_group, 342719b546d7SQu Wenruo extent_key->objectid); 342819b546d7SQu Wenruo free_extent_buffer(eb); 342919b546d7SQu Wenruo if (ret < 0) 343019b546d7SQu Wenruo break; 343119b546d7SQu Wenruo ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); 343219b546d7SQu Wenruo if (ret < 0) 343319b546d7SQu Wenruo break; 343419b546d7SQu Wenruo } 343519b546d7SQu Wenruo if (ret < 0) 34365d4f98a2SYan Zheng free_block_list(blocks); 343719b546d7SQu Wenruo ulist_free(leaves); 343819b546d7SQu Wenruo return ret; 34395d4f98a2SYan Zheng } 34405d4f98a2SYan Zheng 34415d4f98a2SYan Zheng /* 34422c016dc2SLiu Bo * helper to find next unprocessed extent 34435d4f98a2SYan Zheng */ 34445d4f98a2SYan Zheng static noinline_for_stack 3445147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 34463fd0a558SYan, Zheng struct btrfs_key *extent_key) 34475d4f98a2SYan Zheng { 34480b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 34495d4f98a2SYan Zheng struct btrfs_key key; 34505d4f98a2SYan Zheng struct extent_buffer *leaf; 34515d4f98a2SYan Zheng u64 start, end, last; 34525d4f98a2SYan Zheng int ret; 34535d4f98a2SYan Zheng 3454b3470b5dSDavid Sterba last = rc->block_group->start + rc->block_group->length; 34555d4f98a2SYan Zheng while (1) { 34565d4f98a2SYan Zheng cond_resched(); 34575d4f98a2SYan Zheng if (rc->search_start >= last) { 34585d4f98a2SYan Zheng ret = 1; 34595d4f98a2SYan Zheng break; 34605d4f98a2SYan Zheng } 34615d4f98a2SYan Zheng 34625d4f98a2SYan Zheng key.objectid = rc->search_start; 34635d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 34645d4f98a2SYan Zheng key.offset = 0; 34655d4f98a2SYan Zheng 34665d4f98a2SYan Zheng path->search_commit_root = 1; 34675d4f98a2SYan Zheng path->skip_locking = 1; 34685d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 34695d4f98a2SYan Zheng 0, 0); 34705d4f98a2SYan Zheng if (ret < 0) 34715d4f98a2SYan Zheng break; 34725d4f98a2SYan Zheng next: 34735d4f98a2SYan Zheng leaf = path->nodes[0]; 34745d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 34755d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 34765d4f98a2SYan Zheng if (ret != 0) 34775d4f98a2SYan Zheng break; 34785d4f98a2SYan Zheng leaf = path->nodes[0]; 34795d4f98a2SYan Zheng } 34805d4f98a2SYan Zheng 34815d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 34825d4f98a2SYan Zheng if (key.objectid >= last) { 34835d4f98a2SYan Zheng ret = 1; 34845d4f98a2SYan Zheng break; 34855d4f98a2SYan Zheng } 34865d4f98a2SYan Zheng 34873173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 34883173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 34893173a18fSJosef Bacik path->slots[0]++; 34903173a18fSJosef Bacik goto next; 34913173a18fSJosef Bacik } 34923173a18fSJosef Bacik 34933173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 34945d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 34955d4f98a2SYan Zheng path->slots[0]++; 34965d4f98a2SYan Zheng goto next; 34975d4f98a2SYan Zheng } 34985d4f98a2SYan Zheng 34993173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 35000b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 35013173a18fSJosef Bacik rc->search_start) { 35023173a18fSJosef Bacik path->slots[0]++; 35033173a18fSJosef Bacik goto next; 35043173a18fSJosef Bacik } 35053173a18fSJosef Bacik 35065d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 35075d4f98a2SYan Zheng key.objectid, &start, &end, 3508e6138876SJosef Bacik EXTENT_DIRTY, NULL); 35095d4f98a2SYan Zheng 35105d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3511b3b4aa74SDavid Sterba btrfs_release_path(path); 35125d4f98a2SYan Zheng rc->search_start = end + 1; 35135d4f98a2SYan Zheng } else { 35143173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 35155d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 35163173a18fSJosef Bacik else 35173173a18fSJosef Bacik rc->search_start = key.objectid + 35180b246afaSJeff Mahoney fs_info->nodesize; 35193fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 35205d4f98a2SYan Zheng return 0; 35215d4f98a2SYan Zheng } 35225d4f98a2SYan Zheng } 3523b3b4aa74SDavid Sterba btrfs_release_path(path); 35245d4f98a2SYan Zheng return ret; 35255d4f98a2SYan Zheng } 35265d4f98a2SYan Zheng 35275d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 35285d4f98a2SYan Zheng { 35295d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 35307585717fSChris Mason 35317585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 35325d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 35337585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 35345d4f98a2SYan Zheng } 35355d4f98a2SYan Zheng 35365d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 35375d4f98a2SYan Zheng { 35385d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 35397585717fSChris Mason 35407585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 35415d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 35427585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 35435d4f98a2SYan Zheng } 35445d4f98a2SYan Zheng 35453fd0a558SYan, Zheng static noinline_for_stack 35463fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 35473fd0a558SYan, Zheng { 35483fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3549ac2fabacSJosef Bacik int ret; 35503fd0a558SYan, Zheng 35512ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 355266d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 35533fd0a558SYan, Zheng if (!rc->block_rsv) 35543fd0a558SYan, Zheng return -ENOMEM; 35553fd0a558SYan, Zheng 35563fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 3557b3470b5dSDavid Sterba rc->search_start = rc->block_group->start; 35583fd0a558SYan, Zheng rc->extents_found = 0; 35593fd0a558SYan, Zheng rc->nodes_relocated = 0; 35603fd0a558SYan, Zheng rc->merging_rsv_size = 0; 35610647bf56SWang Shilong rc->reserved_bytes = 0; 3562da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 35630647bf56SWang Shilong RELOCATION_RESERVED_NODES; 35649270501cSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root->fs_info, 3565ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3566ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3567ac2fabacSJosef Bacik if (ret) 3568ac2fabacSJosef Bacik return ret; 35693fd0a558SYan, Zheng 35703fd0a558SYan, Zheng rc->create_reloc_tree = 1; 35713fd0a558SYan, Zheng set_reloc_control(rc); 35723fd0a558SYan, Zheng 35737a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 357428818947SLiu Bo if (IS_ERR(trans)) { 357528818947SLiu Bo unset_reloc_control(rc); 357628818947SLiu Bo /* 357728818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 357828818947SLiu Bo * cleanup. And callers are responsible to free the above 357928818947SLiu Bo * block rsv. 358028818947SLiu Bo */ 358128818947SLiu Bo return PTR_ERR(trans); 358228818947SLiu Bo } 358385f02d6cSZixuan Fu 358485f02d6cSZixuan Fu ret = btrfs_commit_transaction(trans); 358585f02d6cSZixuan Fu if (ret) 358685f02d6cSZixuan Fu unset_reloc_control(rc); 358785f02d6cSZixuan Fu 358885f02d6cSZixuan Fu return ret; 35893fd0a558SYan, Zheng } 359076dda93cSYan, Zheng 35915d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 35925d4f98a2SYan Zheng { 35932ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 35945d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 35955d4f98a2SYan Zheng struct btrfs_key key; 35965d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 35975d4f98a2SYan Zheng struct btrfs_path *path; 35985d4f98a2SYan Zheng struct btrfs_extent_item *ei; 35995d4f98a2SYan Zheng u64 flags; 36005d4f98a2SYan Zheng int ret; 36015d4f98a2SYan Zheng int err = 0; 3602c87f08caSChris Mason int progress = 0; 36035d4f98a2SYan Zheng 36045d4f98a2SYan Zheng path = btrfs_alloc_path(); 36053fd0a558SYan, Zheng if (!path) 36065d4f98a2SYan Zheng return -ENOMEM; 3607e4058b54SDavid Sterba path->reada = READA_FORWARD; 36083fd0a558SYan, Zheng 36093fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 36103fd0a558SYan, Zheng if (ret) { 36113fd0a558SYan, Zheng err = ret; 36123fd0a558SYan, Zheng goto out_free; 36132423fdfbSJiri Slaby } 36145d4f98a2SYan Zheng 36155d4f98a2SYan Zheng while (1) { 36160647bf56SWang Shilong rc->reserved_bytes = 0; 36179270501cSJosef Bacik ret = btrfs_block_rsv_refill(fs_info, rc->block_rsv, 36189270501cSJosef Bacik rc->block_rsv->size, 36190647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 36200647bf56SWang Shilong if (ret) { 36210647bf56SWang Shilong err = ret; 36220647bf56SWang Shilong break; 36230647bf56SWang Shilong } 3624c87f08caSChris Mason progress++; 3625a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 36260f788c58SLiu Bo if (IS_ERR(trans)) { 36270f788c58SLiu Bo err = PTR_ERR(trans); 36280f788c58SLiu Bo trans = NULL; 36290f788c58SLiu Bo break; 36300f788c58SLiu Bo } 3631c87f08caSChris Mason restart: 36323fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 36333a45bb20SJeff Mahoney btrfs_end_transaction(trans); 363442a657f5SPan Bian trans = NULL; 36353fd0a558SYan, Zheng continue; 36363fd0a558SYan, Zheng } 36373fd0a558SYan, Zheng 3638147d256eSZhaolei ret = find_next_extent(rc, path, &key); 36395d4f98a2SYan Zheng if (ret < 0) 36405d4f98a2SYan Zheng err = ret; 36415d4f98a2SYan Zheng if (ret != 0) 36425d4f98a2SYan Zheng break; 36435d4f98a2SYan Zheng 36445d4f98a2SYan Zheng rc->extents_found++; 36455d4f98a2SYan Zheng 36465d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 36475d4f98a2SYan Zheng struct btrfs_extent_item); 36485d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 36495d4f98a2SYan Zheng 36505d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 36515d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 36525d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 36535d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 36545d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 36555d4f98a2SYan Zheng } else { 3656b3b4aa74SDavid Sterba btrfs_release_path(path); 36575d4f98a2SYan Zheng ret = 0; 36585d4f98a2SYan Zheng } 36595d4f98a2SYan Zheng if (ret < 0) { 36603fd0a558SYan, Zheng err = ret; 36615d4f98a2SYan Zheng break; 36625d4f98a2SYan Zheng } 36635d4f98a2SYan Zheng 36645d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 36655d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 36665d4f98a2SYan Zheng if (ret < 0) { 36673fd0a558SYan, Zheng if (ret != -EAGAIN) { 36685d4f98a2SYan Zheng err = ret; 36695d4f98a2SYan Zheng break; 36705d4f98a2SYan Zheng } 36713fd0a558SYan, Zheng rc->extents_found--; 36723fd0a558SYan, Zheng rc->search_start = key.objectid; 36733fd0a558SYan, Zheng } 36745d4f98a2SYan Zheng } 36755d4f98a2SYan Zheng 36763a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 36772ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 36783fd0a558SYan, Zheng trans = NULL; 36795d4f98a2SYan Zheng 36805d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 36815d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 36825d4f98a2SYan Zheng rc->found_file_extent = 1; 36830257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 36843fd0a558SYan, Zheng &key, &rc->cluster); 36855d4f98a2SYan Zheng if (ret < 0) { 36865d4f98a2SYan Zheng err = ret; 36875d4f98a2SYan Zheng break; 36885d4f98a2SYan Zheng } 36895d4f98a2SYan Zheng } 3690f31ea088SQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 3691f31ea088SQu Wenruo err = -ECANCELED; 3692f31ea088SQu Wenruo break; 3693f31ea088SQu Wenruo } 36945d4f98a2SYan Zheng } 3695c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 369643a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 36979689457bSShilong Wang if (ret == 1) { 3698c87f08caSChris Mason err = 0; 3699c87f08caSChris Mason progress = 0; 3700c87f08caSChris Mason goto restart; 3701c87f08caSChris Mason } 3702c87f08caSChris Mason } 37033fd0a558SYan, Zheng 3704b3b4aa74SDavid Sterba btrfs_release_path(path); 370591166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 37065d4f98a2SYan Zheng 37075d4f98a2SYan Zheng if (trans) { 37083a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 37092ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 37105d4f98a2SYan Zheng } 37115d4f98a2SYan Zheng 37120257bb82SYan, Zheng if (!err) { 37133fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 37143fd0a558SYan, Zheng &rc->cluster); 37150257bb82SYan, Zheng if (ret < 0) 37160257bb82SYan, Zheng err = ret; 37170257bb82SYan, Zheng } 37180257bb82SYan, Zheng 37193fd0a558SYan, Zheng rc->create_reloc_tree = 0; 37203fd0a558SYan, Zheng set_reloc_control(rc); 37210257bb82SYan, Zheng 372213fe1bdbSQu Wenruo btrfs_backref_release_cache(&rc->backref_cache); 372363f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 37245d4f98a2SYan Zheng 37257f913c7cSQu Wenruo /* 37267f913c7cSQu Wenruo * Even in the case when the relocation is cancelled, we should all go 37277f913c7cSQu Wenruo * through prepare_to_merge() and merge_reloc_roots(). 37287f913c7cSQu Wenruo * 37297f913c7cSQu Wenruo * For error (including cancelled balance), prepare_to_merge() will 37307f913c7cSQu Wenruo * mark all reloc trees orphan, then queue them for cleanup in 37317f913c7cSQu Wenruo * merge_reloc_roots() 37327f913c7cSQu Wenruo */ 37333fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 37345d4f98a2SYan Zheng 37355d4f98a2SYan Zheng merge_reloc_roots(rc); 37365d4f98a2SYan Zheng 37373fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 37385d4f98a2SYan Zheng unset_reloc_control(rc); 373963f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 37405d4f98a2SYan Zheng 37415d4f98a2SYan Zheng /* get rid of pinned extents */ 37427a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 374362b99540SQu Wenruo if (IS_ERR(trans)) { 37443612b495STsutomu Itoh err = PTR_ERR(trans); 374562b99540SQu Wenruo goto out_free; 374662b99540SQu Wenruo } 3747fb686c68SJosef Bacik ret = btrfs_commit_transaction(trans); 3748fb686c68SJosef Bacik if (ret && !err) 3749fb686c68SJosef Bacik err = ret; 37506217b0faSJosef Bacik out_free: 3751d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 3752d2311e69SQu Wenruo if (ret < 0 && !err) 3753d2311e69SQu Wenruo err = ret; 37542ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 37553fd0a558SYan, Zheng btrfs_free_path(path); 37565d4f98a2SYan Zheng return err; 37575d4f98a2SYan Zheng } 37585d4f98a2SYan Zheng 37595d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 37600257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 37615d4f98a2SYan Zheng { 37625d4f98a2SYan Zheng struct btrfs_path *path; 37635d4f98a2SYan Zheng struct btrfs_inode_item *item; 37645d4f98a2SYan Zheng struct extent_buffer *leaf; 37655d4f98a2SYan Zheng int ret; 37665d4f98a2SYan Zheng 37675d4f98a2SYan Zheng path = btrfs_alloc_path(); 37685d4f98a2SYan Zheng if (!path) 37695d4f98a2SYan Zheng return -ENOMEM; 37705d4f98a2SYan Zheng 37715d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 37725d4f98a2SYan Zheng if (ret) 37735d4f98a2SYan Zheng goto out; 37745d4f98a2SYan Zheng 37755d4f98a2SYan Zheng leaf = path->nodes[0]; 37765d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 3777b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 37785d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 37790257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 37805d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 3781960a3166SJohannes Thumshirn btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 3782960a3166SJohannes Thumshirn BTRFS_INODE_PREALLOC); 37835d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 37845d4f98a2SYan Zheng out: 37855d4f98a2SYan Zheng btrfs_free_path(path); 37865d4f98a2SYan Zheng return ret; 37875d4f98a2SYan Zheng } 37885d4f98a2SYan Zheng 3789790c1b8cSJosef Bacik static void delete_orphan_inode(struct btrfs_trans_handle *trans, 3790790c1b8cSJosef Bacik struct btrfs_root *root, u64 objectid) 3791790c1b8cSJosef Bacik { 3792790c1b8cSJosef Bacik struct btrfs_path *path; 3793790c1b8cSJosef Bacik struct btrfs_key key; 3794790c1b8cSJosef Bacik int ret = 0; 3795790c1b8cSJosef Bacik 3796790c1b8cSJosef Bacik path = btrfs_alloc_path(); 3797790c1b8cSJosef Bacik if (!path) { 3798790c1b8cSJosef Bacik ret = -ENOMEM; 3799790c1b8cSJosef Bacik goto out; 3800790c1b8cSJosef Bacik } 3801790c1b8cSJosef Bacik 3802790c1b8cSJosef Bacik key.objectid = objectid; 3803790c1b8cSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 3804790c1b8cSJosef Bacik key.offset = 0; 3805790c1b8cSJosef Bacik ret = btrfs_search_slot(trans, root, &key, path, -1, 1); 3806790c1b8cSJosef Bacik if (ret) { 3807790c1b8cSJosef Bacik if (ret > 0) 3808790c1b8cSJosef Bacik ret = -ENOENT; 3809790c1b8cSJosef Bacik goto out; 3810790c1b8cSJosef Bacik } 3811790c1b8cSJosef Bacik ret = btrfs_del_item(trans, root, path); 3812790c1b8cSJosef Bacik out: 3813790c1b8cSJosef Bacik if (ret) 3814790c1b8cSJosef Bacik btrfs_abort_transaction(trans, ret); 3815790c1b8cSJosef Bacik btrfs_free_path(path); 3816790c1b8cSJosef Bacik } 3817790c1b8cSJosef Bacik 38185d4f98a2SYan Zheng /* 38195d4f98a2SYan Zheng * helper to create inode for data relocation. 38205d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 38215d4f98a2SYan Zheng */ 38223fd0a558SYan, Zheng static noinline_for_stack 38233fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 382432da5386SDavid Sterba struct btrfs_block_group *group) 38255d4f98a2SYan Zheng { 38265d4f98a2SYan Zheng struct inode *inode = NULL; 38275d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 38285d4f98a2SYan Zheng struct btrfs_root *root; 38294624900dSZhaolei u64 objectid; 38305d4f98a2SYan Zheng int err = 0; 38315d4f98a2SYan Zheng 3832aeb935a4SQu Wenruo root = btrfs_grab_root(fs_info->data_reloc_root); 3833a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 383476deacf0SJosef Bacik if (IS_ERR(trans)) { 383500246528SJosef Bacik btrfs_put_root(root); 38363fd0a558SYan, Zheng return ERR_CAST(trans); 383776deacf0SJosef Bacik } 38385d4f98a2SYan Zheng 3839543068a2SNikolay Borisov err = btrfs_get_free_objectid(root, &objectid); 38405d4f98a2SYan Zheng if (err) 38415d4f98a2SYan Zheng goto out; 38425d4f98a2SYan Zheng 38430257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 3844790c1b8cSJosef Bacik if (err) 3845790c1b8cSJosef Bacik goto out; 38465d4f98a2SYan Zheng 38470202e83fSDavid Sterba inode = btrfs_iget(fs_info->sb, objectid, root); 3848790c1b8cSJosef Bacik if (IS_ERR(inode)) { 3849790c1b8cSJosef Bacik delete_orphan_inode(trans, root, objectid); 3850790c1b8cSJosef Bacik err = PTR_ERR(inode); 3851790c1b8cSJosef Bacik inode = NULL; 3852790c1b8cSJosef Bacik goto out; 3853790c1b8cSJosef Bacik } 3854b3470b5dSDavid Sterba BTRFS_I(inode)->index_cnt = group->start; 38555d4f98a2SYan Zheng 385673f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 38575d4f98a2SYan Zheng out: 385800246528SJosef Bacik btrfs_put_root(root); 38593a45bb20SJeff Mahoney btrfs_end_transaction(trans); 38602ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 38615d4f98a2SYan Zheng if (err) { 38625d4f98a2SYan Zheng iput(inode); 38635d4f98a2SYan Zheng inode = ERR_PTR(err); 38645d4f98a2SYan Zheng } 38655d4f98a2SYan Zheng return inode; 38665d4f98a2SYan Zheng } 38675d4f98a2SYan Zheng 3868907d2710SDavid Sterba /* 3869907d2710SDavid Sterba * Mark start of chunk relocation that is cancellable. Check if the cancellation 3870907d2710SDavid Sterba * has been requested meanwhile and don't start in that case. 3871907d2710SDavid Sterba * 3872907d2710SDavid Sterba * Return: 3873907d2710SDavid Sterba * 0 success 3874907d2710SDavid Sterba * -EINPROGRESS operation is already in progress, that's probably a bug 3875907d2710SDavid Sterba * -ECANCELED cancellation request was set before the operation started 3876907d2710SDavid Sterba */ 3877907d2710SDavid Sterba static int reloc_chunk_start(struct btrfs_fs_info *fs_info) 3878907d2710SDavid Sterba { 3879907d2710SDavid Sterba if (test_and_set_bit(BTRFS_FS_RELOC_RUNNING, &fs_info->flags)) { 3880907d2710SDavid Sterba /* This should not happen */ 3881907d2710SDavid Sterba btrfs_err(fs_info, "reloc already running, cannot start"); 3882907d2710SDavid Sterba return -EINPROGRESS; 3883907d2710SDavid Sterba } 3884907d2710SDavid Sterba 3885907d2710SDavid Sterba if (atomic_read(&fs_info->reloc_cancel_req) > 0) { 3886907d2710SDavid Sterba btrfs_info(fs_info, "chunk relocation canceled on start"); 3887907d2710SDavid Sterba /* 3888907d2710SDavid Sterba * On cancel, clear all requests but let the caller mark 3889907d2710SDavid Sterba * the end after cleanup operations. 3890907d2710SDavid Sterba */ 3891907d2710SDavid Sterba atomic_set(&fs_info->reloc_cancel_req, 0); 3892907d2710SDavid Sterba return -ECANCELED; 3893907d2710SDavid Sterba } 3894907d2710SDavid Sterba return 0; 3895907d2710SDavid Sterba } 3896907d2710SDavid Sterba 3897907d2710SDavid Sterba /* 3898907d2710SDavid Sterba * Mark end of chunk relocation that is cancellable and wake any waiters. 3899907d2710SDavid Sterba */ 3900907d2710SDavid Sterba static void reloc_chunk_end(struct btrfs_fs_info *fs_info) 3901907d2710SDavid Sterba { 3902907d2710SDavid Sterba /* Requested after start, clear bit first so any waiters can continue */ 3903907d2710SDavid Sterba if (atomic_read(&fs_info->reloc_cancel_req) > 0) 3904907d2710SDavid Sterba btrfs_info(fs_info, "chunk relocation canceled during operation"); 3905907d2710SDavid Sterba clear_and_wake_up_bit(BTRFS_FS_RELOC_RUNNING, &fs_info->flags); 3906907d2710SDavid Sterba atomic_set(&fs_info->reloc_cancel_req, 0); 3907907d2710SDavid Sterba } 3908907d2710SDavid Sterba 3909c258d6e3SQu Wenruo static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 39103fd0a558SYan, Zheng { 39113fd0a558SYan, Zheng struct reloc_control *rc; 39123fd0a558SYan, Zheng 39133fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 39143fd0a558SYan, Zheng if (!rc) 39153fd0a558SYan, Zheng return NULL; 39163fd0a558SYan, Zheng 39173fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 3918d2311e69SQu Wenruo INIT_LIST_HEAD(&rc->dirty_subvol_roots); 3919584fb121SQu Wenruo btrfs_backref_init_cache(fs_info, &rc->backref_cache, 1); 39203fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 392143eb5f29SQu Wenruo extent_io_tree_init(fs_info, &rc->processed_blocks, 392243eb5f29SQu Wenruo IO_TREE_RELOC_BLOCKS, NULL); 39233fd0a558SYan, Zheng return rc; 39243fd0a558SYan, Zheng } 39253fd0a558SYan, Zheng 39261a0afa0eSJosef Bacik static void free_reloc_control(struct reloc_control *rc) 39271a0afa0eSJosef Bacik { 39281a0afa0eSJosef Bacik struct mapping_node *node, *tmp; 39291a0afa0eSJosef Bacik 39301a0afa0eSJosef Bacik free_reloc_roots(&rc->reloc_roots); 39311a0afa0eSJosef Bacik rbtree_postorder_for_each_entry_safe(node, tmp, 39321a0afa0eSJosef Bacik &rc->reloc_root_tree.rb_root, rb_node) 39331a0afa0eSJosef Bacik kfree(node); 39341a0afa0eSJosef Bacik 39351a0afa0eSJosef Bacik kfree(rc); 39361a0afa0eSJosef Bacik } 39371a0afa0eSJosef Bacik 39385d4f98a2SYan Zheng /* 3939ebce0e01SAdam Borowski * Print the block group being relocated 3940ebce0e01SAdam Borowski */ 3941ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 394232da5386SDavid Sterba struct btrfs_block_group *block_group) 3943ebce0e01SAdam Borowski { 3944f89e09cfSAnand Jain char buf[128] = {'\0'}; 3945ebce0e01SAdam Borowski 3946f89e09cfSAnand Jain btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); 3947ebce0e01SAdam Borowski 3948ebce0e01SAdam Borowski btrfs_info(fs_info, 3949ebce0e01SAdam Borowski "relocating block group %llu flags %s", 3950b3470b5dSDavid Sterba block_group->start, buf); 3951ebce0e01SAdam Borowski } 3952ebce0e01SAdam Borowski 3953430640e3SQu Wenruo static const char *stage_to_string(int stage) 3954430640e3SQu Wenruo { 3955430640e3SQu Wenruo if (stage == MOVE_DATA_EXTENTS) 3956430640e3SQu Wenruo return "move data extents"; 3957430640e3SQu Wenruo if (stage == UPDATE_DATA_PTRS) 3958430640e3SQu Wenruo return "update data pointers"; 3959430640e3SQu Wenruo return "unknown"; 3960430640e3SQu Wenruo } 3961430640e3SQu Wenruo 3962ebce0e01SAdam Borowski /* 39635d4f98a2SYan Zheng * function to relocate all extents in a block group. 39645d4f98a2SYan Zheng */ 39656bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 39665d4f98a2SYan Zheng { 396732da5386SDavid Sterba struct btrfs_block_group *bg; 396829cbcf40SJosef Bacik struct btrfs_root *extent_root = btrfs_extent_root(fs_info, group_start); 39695d4f98a2SYan Zheng struct reloc_control *rc; 39700af3d00bSJosef Bacik struct inode *inode; 39710af3d00bSJosef Bacik struct btrfs_path *path; 39725d4f98a2SYan Zheng int ret; 3973f0486c68SYan, Zheng int rw = 0; 39745d4f98a2SYan Zheng int err = 0; 39755d4f98a2SYan Zheng 3976b4be6aefSJosef Bacik /* 3977b4be6aefSJosef Bacik * This only gets set if we had a half-deleted snapshot on mount. We 3978b4be6aefSJosef Bacik * cannot allow relocation to start while we're still trying to clean up 3979b4be6aefSJosef Bacik * these pending deletions. 3980b4be6aefSJosef Bacik */ 3981b4be6aefSJosef Bacik ret = wait_on_bit(&fs_info->flags, BTRFS_FS_UNFINISHED_DROPS, TASK_INTERRUPTIBLE); 3982b4be6aefSJosef Bacik if (ret) 3983b4be6aefSJosef Bacik return ret; 3984b4be6aefSJosef Bacik 3985b4be6aefSJosef Bacik /* We may have been woken up by close_ctree, so bail if we're closing. */ 3986b4be6aefSJosef Bacik if (btrfs_fs_closing(fs_info)) 3987b4be6aefSJosef Bacik return -EINTR; 3988b4be6aefSJosef Bacik 3989eede2bf3SOmar Sandoval bg = btrfs_lookup_block_group(fs_info, group_start); 3990eede2bf3SOmar Sandoval if (!bg) 3991eede2bf3SOmar Sandoval return -ENOENT; 3992eede2bf3SOmar Sandoval 39930320b353SNaohiro Aota /* 39940320b353SNaohiro Aota * Relocation of a data block group creates ordered extents. Without 39950320b353SNaohiro Aota * sb_start_write(), we can freeze the filesystem while unfinished 39960320b353SNaohiro Aota * ordered extents are left. Such ordered extents can cause a deadlock 39970320b353SNaohiro Aota * e.g. when syncfs() is waiting for their completion but they can't 39980320b353SNaohiro Aota * finish because they block when joining a transaction, due to the 39990320b353SNaohiro Aota * fact that the freeze locks are being held in write mode. 40000320b353SNaohiro Aota */ 40010320b353SNaohiro Aota if (bg->flags & BTRFS_BLOCK_GROUP_DATA) 40020320b353SNaohiro Aota ASSERT(sb_write_started(fs_info->sb)); 40030320b353SNaohiro Aota 4004eede2bf3SOmar Sandoval if (btrfs_pinned_by_swapfile(fs_info, bg)) { 4005eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 4006eede2bf3SOmar Sandoval return -ETXTBSY; 4007eede2bf3SOmar Sandoval } 4008eede2bf3SOmar Sandoval 4009c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 4010eede2bf3SOmar Sandoval if (!rc) { 4011eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 40125d4f98a2SYan Zheng return -ENOMEM; 4013eede2bf3SOmar Sandoval } 40145d4f98a2SYan Zheng 4015907d2710SDavid Sterba ret = reloc_chunk_start(fs_info); 4016907d2710SDavid Sterba if (ret < 0) { 4017907d2710SDavid Sterba err = ret; 4018907d2710SDavid Sterba goto out_put_bg; 4019907d2710SDavid Sterba } 4020907d2710SDavid Sterba 4021f0486c68SYan, Zheng rc->extent_root = extent_root; 4022eede2bf3SOmar Sandoval rc->block_group = bg; 40235d4f98a2SYan Zheng 4024b12de528SQu Wenruo ret = btrfs_inc_block_group_ro(rc->block_group, true); 4025f0486c68SYan, Zheng if (ret) { 4026f0486c68SYan, Zheng err = ret; 4027f0486c68SYan, Zheng goto out; 4028f0486c68SYan, Zheng } 4029f0486c68SYan, Zheng rw = 1; 4030f0486c68SYan, Zheng 40310af3d00bSJosef Bacik path = btrfs_alloc_path(); 40320af3d00bSJosef Bacik if (!path) { 40330af3d00bSJosef Bacik err = -ENOMEM; 40340af3d00bSJosef Bacik goto out; 40350af3d00bSJosef Bacik } 40360af3d00bSJosef Bacik 40377949f339SDavid Sterba inode = lookup_free_space_inode(rc->block_group, path); 40380af3d00bSJosef Bacik btrfs_free_path(path); 40390af3d00bSJosef Bacik 40400af3d00bSJosef Bacik if (!IS_ERR(inode)) 40411bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 40420af3d00bSJosef Bacik else 40430af3d00bSJosef Bacik ret = PTR_ERR(inode); 40440af3d00bSJosef Bacik 40450af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 40460af3d00bSJosef Bacik err = ret; 40470af3d00bSJosef Bacik goto out; 40480af3d00bSJosef Bacik } 40490af3d00bSJosef Bacik 40505d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 40515d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 40525d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 40535d4f98a2SYan Zheng rc->data_inode = NULL; 40545d4f98a2SYan Zheng goto out; 40555d4f98a2SYan Zheng } 40565d4f98a2SYan Zheng 40570b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 40585d4f98a2SYan Zheng 40599cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4060f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 40616374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 4062b3470b5dSDavid Sterba rc->block_group->start, 4063b3470b5dSDavid Sterba rc->block_group->length); 40645d4f98a2SYan Zheng 40657ae9bd18SNaohiro Aota ret = btrfs_zone_finish(rc->block_group); 40667ae9bd18SNaohiro Aota WARN_ON(ret && ret != -EAGAIN); 40677ae9bd18SNaohiro Aota 40685d4f98a2SYan Zheng while (1) { 4069430640e3SQu Wenruo int finishes_stage; 4070430640e3SQu Wenruo 407176dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 40725d4f98a2SYan Zheng ret = relocate_block_group(rc); 407376dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 4074ff612ba7SJosef Bacik if (ret < 0) 40755d4f98a2SYan Zheng err = ret; 4076ff612ba7SJosef Bacik 4077430640e3SQu Wenruo finishes_stage = rc->stage; 4078ff612ba7SJosef Bacik /* 4079ff612ba7SJosef Bacik * We may have gotten ENOSPC after we already dirtied some 4080ff612ba7SJosef Bacik * extents. If writeout happens while we're relocating a 4081ff612ba7SJosef Bacik * different block group we could end up hitting the 4082ff612ba7SJosef Bacik * BUG_ON(rc->stage == UPDATE_DATA_PTRS) in 4083ff612ba7SJosef Bacik * btrfs_reloc_cow_block. Make sure we write everything out 4084ff612ba7SJosef Bacik * properly so we don't trip over this problem, and then break 4085ff612ba7SJosef Bacik * out of the loop if we hit an error. 4086ff612ba7SJosef Bacik */ 4087ff612ba7SJosef Bacik if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 4088ff612ba7SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 4089ff612ba7SJosef Bacik (u64)-1); 4090ff612ba7SJosef Bacik if (ret) 4091ff612ba7SJosef Bacik err = ret; 4092ff612ba7SJosef Bacik invalidate_mapping_pages(rc->data_inode->i_mapping, 4093ff612ba7SJosef Bacik 0, -1); 4094ff612ba7SJosef Bacik rc->stage = UPDATE_DATA_PTRS; 40955d4f98a2SYan Zheng } 40965d4f98a2SYan Zheng 4097ff612ba7SJosef Bacik if (err < 0) 4098ff612ba7SJosef Bacik goto out; 4099ff612ba7SJosef Bacik 41005d4f98a2SYan Zheng if (rc->extents_found == 0) 41015d4f98a2SYan Zheng break; 41025d4f98a2SYan Zheng 4103430640e3SQu Wenruo btrfs_info(fs_info, "found %llu extents, stage: %s", 4104430640e3SQu Wenruo rc->extents_found, stage_to_string(finishes_stage)); 41055d4f98a2SYan Zheng } 41065d4f98a2SYan Zheng 41075d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 41085d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 4109bf38be65SDavid Sterba WARN_ON(rc->block_group->used > 0); 41105d4f98a2SYan Zheng out: 4111f0486c68SYan, Zheng if (err && rw) 41122ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 41135d4f98a2SYan Zheng iput(rc->data_inode); 4114907d2710SDavid Sterba out_put_bg: 4115907d2710SDavid Sterba btrfs_put_block_group(bg); 4116907d2710SDavid Sterba reloc_chunk_end(fs_info); 41171a0afa0eSJosef Bacik free_reloc_control(rc); 41185d4f98a2SYan Zheng return err; 41195d4f98a2SYan Zheng } 41205d4f98a2SYan Zheng 412176dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 412276dda93cSYan, Zheng { 41230b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 412476dda93cSYan, Zheng struct btrfs_trans_handle *trans; 412579787eaaSJeff Mahoney int ret, err; 412676dda93cSYan, Zheng 41270b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 412879787eaaSJeff Mahoney if (IS_ERR(trans)) 412979787eaaSJeff Mahoney return PTR_ERR(trans); 413076dda93cSYan, Zheng 413176dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 413276dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 4133c8422684SDavid Sterba btrfs_set_root_drop_level(&root->root_item, 0); 413476dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 41350b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 413676dda93cSYan, Zheng &root->root_key, &root->root_item); 413776dda93cSYan, Zheng 41383a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 413979787eaaSJeff Mahoney if (err) 414079787eaaSJeff Mahoney return err; 414179787eaaSJeff Mahoney return ret; 414276dda93cSYan, Zheng } 414376dda93cSYan, Zheng 41445d4f98a2SYan Zheng /* 41455d4f98a2SYan Zheng * recover relocation interrupted by system crash. 41465d4f98a2SYan Zheng * 41475d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 41485d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 41495d4f98a2SYan Zheng */ 41507eefae6bSJosef Bacik int btrfs_recover_relocation(struct btrfs_fs_info *fs_info) 41515d4f98a2SYan Zheng { 41525d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 41535d4f98a2SYan Zheng struct btrfs_key key; 41545d4f98a2SYan Zheng struct btrfs_root *fs_root; 41555d4f98a2SYan Zheng struct btrfs_root *reloc_root; 41565d4f98a2SYan Zheng struct btrfs_path *path; 41575d4f98a2SYan Zheng struct extent_buffer *leaf; 41585d4f98a2SYan Zheng struct reloc_control *rc = NULL; 41595d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 41605d4f98a2SYan Zheng int ret; 41615d4f98a2SYan Zheng int err = 0; 41625d4f98a2SYan Zheng 41635d4f98a2SYan Zheng path = btrfs_alloc_path(); 41645d4f98a2SYan Zheng if (!path) 41655d4f98a2SYan Zheng return -ENOMEM; 4166e4058b54SDavid Sterba path->reada = READA_BACK; 41675d4f98a2SYan Zheng 41685d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 41695d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 41705d4f98a2SYan Zheng key.offset = (u64)-1; 41715d4f98a2SYan Zheng 41725d4f98a2SYan Zheng while (1) { 41730b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 41745d4f98a2SYan Zheng path, 0, 0); 41755d4f98a2SYan Zheng if (ret < 0) { 41765d4f98a2SYan Zheng err = ret; 41775d4f98a2SYan Zheng goto out; 41785d4f98a2SYan Zheng } 41795d4f98a2SYan Zheng if (ret > 0) { 41805d4f98a2SYan Zheng if (path->slots[0] == 0) 41815d4f98a2SYan Zheng break; 41825d4f98a2SYan Zheng path->slots[0]--; 41835d4f98a2SYan Zheng } 41845d4f98a2SYan Zheng leaf = path->nodes[0]; 41855d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4186b3b4aa74SDavid Sterba btrfs_release_path(path); 41875d4f98a2SYan Zheng 41885d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 41895d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 41905d4f98a2SYan Zheng break; 41915d4f98a2SYan Zheng 41927eefae6bSJosef Bacik reloc_root = btrfs_read_tree_root(fs_info->tree_root, &key); 41935d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 41945d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 41955d4f98a2SYan Zheng goto out; 41965d4f98a2SYan Zheng } 41975d4f98a2SYan Zheng 419892a7cc42SQu Wenruo set_bit(BTRFS_ROOT_SHAREABLE, &reloc_root->state); 41995d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 42005d4f98a2SYan Zheng 42015d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 4202a820feb5SDavid Sterba fs_root = btrfs_get_fs_root(fs_info, 4203a820feb5SDavid Sterba reloc_root->root_key.offset, false); 42045d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 420576dda93cSYan, Zheng ret = PTR_ERR(fs_root); 420676dda93cSYan, Zheng if (ret != -ENOENT) { 420776dda93cSYan, Zheng err = ret; 42085d4f98a2SYan Zheng goto out; 42095d4f98a2SYan Zheng } 421079787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 421179787eaaSJeff Mahoney if (ret < 0) { 421279787eaaSJeff Mahoney err = ret; 421379787eaaSJeff Mahoney goto out; 421479787eaaSJeff Mahoney } 4215932fd26dSJosef Bacik } else { 421600246528SJosef Bacik btrfs_put_root(fs_root); 421776dda93cSYan, Zheng } 42185d4f98a2SYan Zheng } 42195d4f98a2SYan Zheng 42205d4f98a2SYan Zheng if (key.offset == 0) 42215d4f98a2SYan Zheng break; 42225d4f98a2SYan Zheng 42235d4f98a2SYan Zheng key.offset--; 42245d4f98a2SYan Zheng } 4225b3b4aa74SDavid Sterba btrfs_release_path(path); 42265d4f98a2SYan Zheng 42275d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 42285d4f98a2SYan Zheng goto out; 42295d4f98a2SYan Zheng 4230c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 42315d4f98a2SYan Zheng if (!rc) { 42325d4f98a2SYan Zheng err = -ENOMEM; 42335d4f98a2SYan Zheng goto out; 42345d4f98a2SYan Zheng } 42355d4f98a2SYan Zheng 4236907d2710SDavid Sterba ret = reloc_chunk_start(fs_info); 4237907d2710SDavid Sterba if (ret < 0) { 4238907d2710SDavid Sterba err = ret; 4239907d2710SDavid Sterba goto out_end; 4240907d2710SDavid Sterba } 4241907d2710SDavid Sterba 424229cbcf40SJosef Bacik rc->extent_root = btrfs_extent_root(fs_info, 0); 42435d4f98a2SYan Zheng 42445d4f98a2SYan Zheng set_reloc_control(rc); 42455d4f98a2SYan Zheng 42467a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 42473612b495STsutomu Itoh if (IS_ERR(trans)) { 42483612b495STsutomu Itoh err = PTR_ERR(trans); 4249fb2d83eeSJosef Bacik goto out_unset; 42503612b495STsutomu Itoh } 42513fd0a558SYan, Zheng 42523fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 42533fd0a558SYan, Zheng 42545d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 42555d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 42565d4f98a2SYan Zheng struct btrfs_root, root_list); 42575d4f98a2SYan Zheng list_del(&reloc_root->root_list); 42585d4f98a2SYan Zheng 42595d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 42605d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 42615d4f98a2SYan Zheng &rc->reloc_roots); 42625d4f98a2SYan Zheng continue; 42635d4f98a2SYan Zheng } 42645d4f98a2SYan Zheng 4265a820feb5SDavid Sterba fs_root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, 4266a820feb5SDavid Sterba false); 426779787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 426879787eaaSJeff Mahoney err = PTR_ERR(fs_root); 4269ca1aa281SJosef Bacik list_add_tail(&reloc_root->root_list, &reloc_roots); 42701402d17dSXiyu Yang btrfs_end_transaction(trans); 4271fb2d83eeSJosef Bacik goto out_unset; 427279787eaaSJeff Mahoney } 42735d4f98a2SYan Zheng 4274ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 427557a304cfSJosef Bacik ASSERT(err != -EEXIST); 42763c925863SJosef Bacik if (err) { 42773c925863SJosef Bacik list_add_tail(&reloc_root->root_list, &reloc_roots); 42783c925863SJosef Bacik btrfs_put_root(fs_root); 42793c925863SJosef Bacik btrfs_end_transaction(trans); 42803c925863SJosef Bacik goto out_unset; 42813c925863SJosef Bacik } 4282f44deb74SJosef Bacik fs_root->reloc_root = btrfs_grab_root(reloc_root); 428300246528SJosef Bacik btrfs_put_root(fs_root); 42845d4f98a2SYan Zheng } 42855d4f98a2SYan Zheng 42863a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 428779787eaaSJeff Mahoney if (err) 4288fb2d83eeSJosef Bacik goto out_unset; 42895d4f98a2SYan Zheng 42905d4f98a2SYan Zheng merge_reloc_roots(rc); 42915d4f98a2SYan Zheng 42925d4f98a2SYan Zheng unset_reloc_control(rc); 42935d4f98a2SYan Zheng 42947a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 429562b99540SQu Wenruo if (IS_ERR(trans)) { 42963612b495STsutomu Itoh err = PTR_ERR(trans); 42976217b0faSJosef Bacik goto out_clean; 429862b99540SQu Wenruo } 42993a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 43006217b0faSJosef Bacik out_clean: 4301d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4302d2311e69SQu Wenruo if (ret < 0 && !err) 4303d2311e69SQu Wenruo err = ret; 4304fb2d83eeSJosef Bacik out_unset: 4305fb2d83eeSJosef Bacik unset_reloc_control(rc); 4306907d2710SDavid Sterba out_end: 4307907d2710SDavid Sterba reloc_chunk_end(fs_info); 43081a0afa0eSJosef Bacik free_reloc_control(rc); 43093612b495STsutomu Itoh out: 4310aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4311aca1bba6SLiu Bo 43125d4f98a2SYan Zheng btrfs_free_path(path); 43135d4f98a2SYan Zheng 43145d4f98a2SYan Zheng if (err == 0) { 43155d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 4316aeb935a4SQu Wenruo fs_root = btrfs_grab_root(fs_info->data_reloc_root); 4317aeb935a4SQu Wenruo ASSERT(fs_root); 431866b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 431900246528SJosef Bacik btrfs_put_root(fs_root); 4320932fd26dSJosef Bacik } 43215d4f98a2SYan Zheng return err; 43225d4f98a2SYan Zheng } 43235d4f98a2SYan Zheng 43245d4f98a2SYan Zheng /* 43255d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 43265d4f98a2SYan Zheng * 43275d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 43285d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 43295d4f98a2SYan Zheng */ 43307bfa9535SNikolay Borisov int btrfs_reloc_clone_csums(struct btrfs_inode *inode, u64 file_pos, u64 len) 43315d4f98a2SYan Zheng { 43327bfa9535SNikolay Borisov struct btrfs_fs_info *fs_info = inode->root->fs_info; 4333fc28b25eSJosef Bacik struct btrfs_root *csum_root; 43345d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 43355d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 43365d4f98a2SYan Zheng int ret; 43375d4f98a2SYan Zheng u64 disk_bytenr; 43384577b014SJosef Bacik u64 new_bytenr; 43395d4f98a2SYan Zheng LIST_HEAD(list); 43405d4f98a2SYan Zheng 43417bfa9535SNikolay Borisov ordered = btrfs_lookup_ordered_extent(inode, file_pos); 4342bffe633eSOmar Sandoval BUG_ON(ordered->file_offset != file_pos || ordered->num_bytes != len); 43435d4f98a2SYan Zheng 43447bfa9535SNikolay Borisov disk_bytenr = file_pos + inode->index_cnt; 4345fc28b25eSJosef Bacik csum_root = btrfs_csum_root(fs_info, disk_bytenr); 4346fc28b25eSJosef Bacik ret = btrfs_lookup_csums_range(csum_root, disk_bytenr, 434726ce9114SJosef Bacik disk_bytenr + len - 1, &list, 0, false); 434879787eaaSJeff Mahoney if (ret) 434979787eaaSJeff Mahoney goto out; 43505d4f98a2SYan Zheng 43515d4f98a2SYan Zheng while (!list_empty(&list)) { 43525d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 43535d4f98a2SYan Zheng list_del_init(&sums->list); 43545d4f98a2SYan Zheng 43554577b014SJosef Bacik /* 43564577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 43574577b014SJosef Bacik * We need to do this because we will read in entire prealloc 43584577b014SJosef Bacik * extents but we may have written to say the middle of the 43594577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 43604577b014SJosef Bacik * the right disk offset. 43614577b014SJosef Bacik * 43624577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 43634577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 43644577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 43654577b014SJosef Bacik * disk length. 43664577b014SJosef Bacik */ 4367bffe633eSOmar Sandoval new_bytenr = ordered->disk_bytenr + sums->bytenr - disk_bytenr; 43684577b014SJosef Bacik sums->bytenr = new_bytenr; 43695d4f98a2SYan Zheng 4370f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 43715d4f98a2SYan Zheng } 437279787eaaSJeff Mahoney out: 43735d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4374411fc6bcSAndi Kleen return ret; 43755d4f98a2SYan Zheng } 43763fd0a558SYan, Zheng 437783d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 43783fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 43793fd0a558SYan, Zheng struct extent_buffer *cow) 43803fd0a558SYan, Zheng { 43810b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 43823fd0a558SYan, Zheng struct reloc_control *rc; 4383a26195a5SQu Wenruo struct btrfs_backref_node *node; 43843fd0a558SYan, Zheng int first_cow = 0; 43853fd0a558SYan, Zheng int level; 438683d4cfd4SJosef Bacik int ret = 0; 43873fd0a558SYan, Zheng 43880b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 43893fd0a558SYan, Zheng if (!rc) 439083d4cfd4SJosef Bacik return 0; 43913fd0a558SYan, Zheng 439237f00a6dSJohannes Thumshirn BUG_ON(rc->stage == UPDATE_DATA_PTRS && btrfs_is_data_reloc_root(root)); 43933fd0a558SYan, Zheng 43943fd0a558SYan, Zheng level = btrfs_header_level(buf); 43953fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 43963fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 43973fd0a558SYan, Zheng first_cow = 1; 43983fd0a558SYan, Zheng 43993fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 44003fd0a558SYan, Zheng rc->create_reloc_tree) { 44013fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 44023fd0a558SYan, Zheng 44033fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 44043fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 44053fd0a558SYan, Zheng node->new_bytenr != buf->start); 44063fd0a558SYan, Zheng 4407b0fe7078SQu Wenruo btrfs_backref_drop_node_buffer(node); 440867439dadSDavid Sterba atomic_inc(&cow->refs); 44093fd0a558SYan, Zheng node->eb = cow; 44103fd0a558SYan, Zheng node->new_bytenr = cow->start; 44113fd0a558SYan, Zheng 44123fd0a558SYan, Zheng if (!node->pending) { 44133fd0a558SYan, Zheng list_move_tail(&node->list, 44143fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 44153fd0a558SYan, Zheng node->pending = 1; 44163fd0a558SYan, Zheng } 44173fd0a558SYan, Zheng 44183fd0a558SYan, Zheng if (first_cow) 44199569cc20SQu Wenruo mark_block_processed(rc, node); 44203fd0a558SYan, Zheng 44213fd0a558SYan, Zheng if (first_cow && level > 0) 44223fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 44233fd0a558SYan, Zheng } 44243fd0a558SYan, Zheng 442583d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 44263fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 442783d4cfd4SJosef Bacik return ret; 44283fd0a558SYan, Zheng } 44293fd0a558SYan, Zheng 44303fd0a558SYan, Zheng /* 44313fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 443201327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 44333fd0a558SYan, Zheng */ 4434147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 44353fd0a558SYan, Zheng u64 *bytes_to_reserve) 44363fd0a558SYan, Zheng { 443710995c04SQu Wenruo struct btrfs_root *root = pending->root; 443810995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 44393fd0a558SYan, Zheng 44406282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 44413fd0a558SYan, Zheng return; 44423fd0a558SYan, Zheng 44433fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 44443fd0a558SYan, Zheng return; 44453fd0a558SYan, Zheng 44463fd0a558SYan, Zheng root = root->reloc_root; 44473fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 44483fd0a558SYan, Zheng /* 44493fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 44503fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 44513fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 44523fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 44533fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 44543fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 44553fd0a558SYan, Zheng * tree may use more space than it frees. so we need 44563fd0a558SYan, Zheng * reserve extra space. 44573fd0a558SYan, Zheng */ 44583fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 44593fd0a558SYan, Zheng } 44603fd0a558SYan, Zheng 44613fd0a558SYan, Zheng /* 44623fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 44633fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 4464f44deb74SJosef Bacik * 4465f44deb74SJosef Bacik * This is similar to btrfs_init_reloc_root(), we come out of here with two 4466f44deb74SJosef Bacik * references held on the reloc_root, one for root->reloc_root and one for 4467f44deb74SJosef Bacik * rc->reloc_roots. 44683fd0a558SYan, Zheng */ 446949b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 44703fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 44713fd0a558SYan, Zheng { 44723fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 44733fd0a558SYan, Zheng struct btrfs_root *reloc_root; 44743fd0a558SYan, Zheng struct btrfs_root *new_root; 447510995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 44763fd0a558SYan, Zheng int ret; 44773fd0a558SYan, Zheng 44786282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 447949b25e05SJeff Mahoney return 0; 44803fd0a558SYan, Zheng 44813fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 44823fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 44833fd0a558SYan, Zheng 44843fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 44853fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 44863fd0a558SYan, Zheng rc->block_rsv, 44873a584174SLu Fengqi rc->nodes_relocated, true); 448849b25e05SJeff Mahoney if (ret) 448949b25e05SJeff Mahoney return ret; 44903fd0a558SYan, Zheng } 44913fd0a558SYan, Zheng 44923fd0a558SYan, Zheng new_root = pending->snap; 44933fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 44943fd0a558SYan, Zheng new_root->root_key.objectid); 449549b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 449649b25e05SJeff Mahoney return PTR_ERR(reloc_root); 44973fd0a558SYan, Zheng 4498ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 449957a304cfSJosef Bacik ASSERT(ret != -EEXIST); 45003c925863SJosef Bacik if (ret) { 45013c925863SJosef Bacik /* Pairs with create_reloc_root */ 45023c925863SJosef Bacik btrfs_put_root(reloc_root); 45033c925863SJosef Bacik return ret; 45043c925863SJosef Bacik } 4505f44deb74SJosef Bacik new_root->reloc_root = btrfs_grab_root(reloc_root); 45063fd0a558SYan, Zheng 450749b25e05SJeff Mahoney if (rc->create_reloc_tree) 45083fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 450949b25e05SJeff Mahoney return ret; 45103fd0a558SYan, Zheng } 4511