1c1d7c514SDavid Sterba // SPDX-License-Identifier: GPL-2.0 25d4f98a2SYan Zheng /* 35d4f98a2SYan Zheng * Copyright (C) 2009 Oracle. All rights reserved. 45d4f98a2SYan Zheng */ 55d4f98a2SYan Zheng 65d4f98a2SYan Zheng #include <linux/sched.h> 75d4f98a2SYan Zheng #include <linux/pagemap.h> 85d4f98a2SYan Zheng #include <linux/writeback.h> 95d4f98a2SYan Zheng #include <linux/blkdev.h> 105d4f98a2SYan Zheng #include <linux/rbtree.h> 115a0e3ad6STejun Heo #include <linux/slab.h> 12726a3421SQu Wenruo #include <linux/error-injection.h> 135d4f98a2SYan Zheng #include "ctree.h" 145d4f98a2SYan Zheng #include "disk-io.h" 155d4f98a2SYan Zheng #include "transaction.h" 165d4f98a2SYan Zheng #include "volumes.h" 175d4f98a2SYan Zheng #include "locking.h" 185d4f98a2SYan Zheng #include "btrfs_inode.h" 195d4f98a2SYan Zheng #include "async-thread.h" 200af3d00bSJosef Bacik #include "free-space-cache.h" 2162b99540SQu Wenruo #include "qgroup.h" 22cdccee99SLiu Bo #include "print-tree.h" 2386736342SJosef Bacik #include "delalloc-space.h" 24aac0023cSJosef Bacik #include "block-group.h" 2519b546d7SQu Wenruo #include "backref.h" 26e9a28dc5SQu Wenruo #include "misc.h" 275d4f98a2SYan Zheng 285d4f98a2SYan Zheng /* 290c891389SQu Wenruo * Relocation overview 300c891389SQu Wenruo * 310c891389SQu Wenruo * [What does relocation do] 320c891389SQu Wenruo * 330c891389SQu Wenruo * The objective of relocation is to relocate all extents of the target block 340c891389SQu Wenruo * group to other block groups. 350c891389SQu Wenruo * This is utilized by resize (shrink only), profile converting, compacting 360c891389SQu Wenruo * space, or balance routine to spread chunks over devices. 370c891389SQu Wenruo * 380c891389SQu Wenruo * Before | After 390c891389SQu Wenruo * ------------------------------------------------------------------ 400c891389SQu Wenruo * BG A: 10 data extents | BG A: deleted 410c891389SQu Wenruo * BG B: 2 data extents | BG B: 10 data extents (2 old + 8 relocated) 420c891389SQu Wenruo * BG C: 1 extents | BG C: 3 data extents (1 old + 2 relocated) 430c891389SQu Wenruo * 440c891389SQu Wenruo * [How does relocation work] 450c891389SQu Wenruo * 460c891389SQu Wenruo * 1. Mark the target block group read-only 470c891389SQu Wenruo * New extents won't be allocated from the target block group. 480c891389SQu Wenruo * 490c891389SQu Wenruo * 2.1 Record each extent in the target block group 500c891389SQu Wenruo * To build a proper map of extents to be relocated. 510c891389SQu Wenruo * 520c891389SQu Wenruo * 2.2 Build data reloc tree and reloc trees 530c891389SQu Wenruo * Data reloc tree will contain an inode, recording all newly relocated 540c891389SQu Wenruo * data extents. 550c891389SQu Wenruo * There will be only one data reloc tree for one data block group. 560c891389SQu Wenruo * 570c891389SQu Wenruo * Reloc tree will be a special snapshot of its source tree, containing 580c891389SQu Wenruo * relocated tree blocks. 590c891389SQu Wenruo * Each tree referring to a tree block in target block group will get its 600c891389SQu Wenruo * reloc tree built. 610c891389SQu Wenruo * 620c891389SQu Wenruo * 2.3 Swap source tree with its corresponding reloc tree 630c891389SQu Wenruo * Each involved tree only refers to new extents after swap. 640c891389SQu Wenruo * 650c891389SQu Wenruo * 3. Cleanup reloc trees and data reloc tree. 660c891389SQu Wenruo * As old extents in the target block group are still referenced by reloc 670c891389SQu Wenruo * trees, we need to clean them up before really freeing the target block 680c891389SQu Wenruo * group. 690c891389SQu Wenruo * 700c891389SQu Wenruo * The main complexity is in steps 2.2 and 2.3. 710c891389SQu Wenruo * 720c891389SQu Wenruo * The entry point of relocation is relocate_block_group() function. 730c891389SQu Wenruo */ 740c891389SQu Wenruo 750647bf56SWang Shilong #define RELOCATION_RESERVED_NODES 256 762a979612SQu Wenruo /* 775d4f98a2SYan Zheng * map address of tree root to tree 785d4f98a2SYan Zheng */ 795d4f98a2SYan Zheng struct mapping_node { 80e9a28dc5SQu Wenruo struct { 815d4f98a2SYan Zheng struct rb_node rb_node; 825d4f98a2SYan Zheng u64 bytenr; 83e9a28dc5SQu Wenruo }; /* Use rb_simle_node for search/insert */ 845d4f98a2SYan Zheng void *data; 855d4f98a2SYan Zheng }; 865d4f98a2SYan Zheng 875d4f98a2SYan Zheng struct mapping_tree { 885d4f98a2SYan Zheng struct rb_root rb_root; 895d4f98a2SYan Zheng spinlock_t lock; 905d4f98a2SYan Zheng }; 915d4f98a2SYan Zheng 925d4f98a2SYan Zheng /* 935d4f98a2SYan Zheng * present a tree block to process 945d4f98a2SYan Zheng */ 955d4f98a2SYan Zheng struct tree_block { 96e9a28dc5SQu Wenruo struct { 975d4f98a2SYan Zheng struct rb_node rb_node; 985d4f98a2SYan Zheng u64 bytenr; 99e9a28dc5SQu Wenruo }; /* Use rb_simple_node for search/insert */ 100f7ba2d37SJosef Bacik u64 owner; 1015d4f98a2SYan Zheng struct btrfs_key key; 1025d4f98a2SYan Zheng unsigned int level:8; 1035d4f98a2SYan Zheng unsigned int key_ready:1; 1045d4f98a2SYan Zheng }; 1055d4f98a2SYan Zheng 1060257bb82SYan, Zheng #define MAX_EXTENTS 128 1070257bb82SYan, Zheng 1080257bb82SYan, Zheng struct file_extent_cluster { 1090257bb82SYan, Zheng u64 start; 1100257bb82SYan, Zheng u64 end; 1110257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 1120257bb82SYan, Zheng unsigned int nr; 1130257bb82SYan, Zheng }; 1140257bb82SYan, Zheng 1155d4f98a2SYan Zheng struct reloc_control { 1165d4f98a2SYan Zheng /* block group to relocate */ 11732da5386SDavid Sterba struct btrfs_block_group *block_group; 1185d4f98a2SYan Zheng /* extent tree */ 1195d4f98a2SYan Zheng struct btrfs_root *extent_root; 1205d4f98a2SYan Zheng /* inode for moving data */ 1215d4f98a2SYan Zheng struct inode *data_inode; 1223fd0a558SYan, Zheng 1233fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 1243fd0a558SYan, Zheng 125a26195a5SQu Wenruo struct btrfs_backref_cache backref_cache; 1263fd0a558SYan, Zheng 1273fd0a558SYan, Zheng struct file_extent_cluster cluster; 1285d4f98a2SYan Zheng /* tree blocks have been processed */ 1295d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 1305d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 1315d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 1325d4f98a2SYan Zheng /* list of reloc trees */ 1335d4f98a2SYan Zheng struct list_head reloc_roots; 134d2311e69SQu Wenruo /* list of subvolume trees that get relocated */ 135d2311e69SQu Wenruo struct list_head dirty_subvol_roots; 1363fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 1373fd0a558SYan, Zheng u64 merging_rsv_size; 1383fd0a558SYan, Zheng /* size of relocated tree nodes */ 1393fd0a558SYan, Zheng u64 nodes_relocated; 1400647bf56SWang Shilong /* reserved size for block group relocation*/ 1410647bf56SWang Shilong u64 reserved_bytes; 1423fd0a558SYan, Zheng 1435d4f98a2SYan Zheng u64 search_start; 1445d4f98a2SYan Zheng u64 extents_found; 1453fd0a558SYan, Zheng 1463fd0a558SYan, Zheng unsigned int stage:8; 1473fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 1483fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 1495d4f98a2SYan Zheng unsigned int found_file_extent:1; 1505d4f98a2SYan Zheng }; 1515d4f98a2SYan Zheng 1525d4f98a2SYan Zheng /* stages of data relocation */ 1535d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 1545d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 1555d4f98a2SYan Zheng 1569569cc20SQu Wenruo static void mark_block_processed(struct reloc_control *rc, 157a26195a5SQu Wenruo struct btrfs_backref_node *node) 1589569cc20SQu Wenruo { 1599569cc20SQu Wenruo u32 blocksize; 1609569cc20SQu Wenruo 1619569cc20SQu Wenruo if (node->level == 0 || 1629569cc20SQu Wenruo in_range(node->bytenr, rc->block_group->start, 1639569cc20SQu Wenruo rc->block_group->length)) { 1649569cc20SQu Wenruo blocksize = rc->extent_root->fs_info->nodesize; 1659569cc20SQu Wenruo set_extent_bits(&rc->processed_blocks, node->bytenr, 1669569cc20SQu Wenruo node->bytenr + blocksize - 1, EXTENT_DIRTY); 1679569cc20SQu Wenruo } 1689569cc20SQu Wenruo node->processed = 1; 1699569cc20SQu Wenruo } 1709569cc20SQu Wenruo 1715d4f98a2SYan Zheng 1725d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 1735d4f98a2SYan Zheng { 1746bef4d31SEric Paris tree->rb_root = RB_ROOT; 1755d4f98a2SYan Zheng spin_lock_init(&tree->lock); 1765d4f98a2SYan Zheng } 1775d4f98a2SYan Zheng 1785d4f98a2SYan Zheng /* 1795d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 1805d4f98a2SYan Zheng */ 181a26195a5SQu Wenruo static struct btrfs_backref_node *walk_up_backref( 182a26195a5SQu Wenruo struct btrfs_backref_node *node, 183a26195a5SQu Wenruo struct btrfs_backref_edge *edges[], int *index) 1845d4f98a2SYan Zheng { 185a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 1865d4f98a2SYan Zheng int idx = *index; 1875d4f98a2SYan Zheng 1885d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 1895d4f98a2SYan Zheng edge = list_entry(node->upper.next, 190a26195a5SQu Wenruo struct btrfs_backref_edge, list[LOWER]); 1915d4f98a2SYan Zheng edges[idx++] = edge; 1925d4f98a2SYan Zheng node = edge->node[UPPER]; 1935d4f98a2SYan Zheng } 1943fd0a558SYan, Zheng BUG_ON(node->detached); 1955d4f98a2SYan Zheng *index = idx; 1965d4f98a2SYan Zheng return node; 1975d4f98a2SYan Zheng } 1985d4f98a2SYan Zheng 1995d4f98a2SYan Zheng /* 2005d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 2015d4f98a2SYan Zheng */ 202a26195a5SQu Wenruo static struct btrfs_backref_node *walk_down_backref( 203a26195a5SQu Wenruo struct btrfs_backref_edge *edges[], int *index) 2045d4f98a2SYan Zheng { 205a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 206a26195a5SQu Wenruo struct btrfs_backref_node *lower; 2075d4f98a2SYan Zheng int idx = *index; 2085d4f98a2SYan Zheng 2095d4f98a2SYan Zheng while (idx > 0) { 2105d4f98a2SYan Zheng edge = edges[idx - 1]; 2115d4f98a2SYan Zheng lower = edge->node[LOWER]; 2125d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 2135d4f98a2SYan Zheng idx--; 2145d4f98a2SYan Zheng continue; 2155d4f98a2SYan Zheng } 2165d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 217a26195a5SQu Wenruo struct btrfs_backref_edge, list[LOWER]); 2185d4f98a2SYan Zheng edges[idx - 1] = edge; 2195d4f98a2SYan Zheng *index = idx; 2205d4f98a2SYan Zheng return edge->node[UPPER]; 2215d4f98a2SYan Zheng } 2225d4f98a2SYan Zheng *index = 0; 2235d4f98a2SYan Zheng return NULL; 2245d4f98a2SYan Zheng } 2255d4f98a2SYan Zheng 226a26195a5SQu Wenruo static void update_backref_node(struct btrfs_backref_cache *cache, 227a26195a5SQu Wenruo struct btrfs_backref_node *node, u64 bytenr) 2283fd0a558SYan, Zheng { 2293fd0a558SYan, Zheng struct rb_node *rb_node; 2303fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 2313fd0a558SYan, Zheng node->bytenr = bytenr; 232e9a28dc5SQu Wenruo rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node); 23343c04fb1SJeff Mahoney if (rb_node) 234982c92cbSQu Wenruo btrfs_backref_panic(cache->fs_info, bytenr, -EEXIST); 2353fd0a558SYan, Zheng } 2363fd0a558SYan, Zheng 2373fd0a558SYan, Zheng /* 2383fd0a558SYan, Zheng * update backref cache after a transaction commit 2393fd0a558SYan, Zheng */ 2403fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 241a26195a5SQu Wenruo struct btrfs_backref_cache *cache) 2423fd0a558SYan, Zheng { 243a26195a5SQu Wenruo struct btrfs_backref_node *node; 2443fd0a558SYan, Zheng int level = 0; 2453fd0a558SYan, Zheng 2463fd0a558SYan, Zheng if (cache->last_trans == 0) { 2473fd0a558SYan, Zheng cache->last_trans = trans->transid; 2483fd0a558SYan, Zheng return 0; 2493fd0a558SYan, Zheng } 2503fd0a558SYan, Zheng 2513fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 2523fd0a558SYan, Zheng return 0; 2533fd0a558SYan, Zheng 2543fd0a558SYan, Zheng /* 2553fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 2563fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 2573fd0a558SYan, Zheng * so the detached nodes are no longer useful. 2583fd0a558SYan, Zheng */ 2593fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2603fd0a558SYan, Zheng node = list_entry(cache->detached.next, 261a26195a5SQu Wenruo struct btrfs_backref_node, list); 262023acb07SQu Wenruo btrfs_backref_cleanup_node(cache, node); 2633fd0a558SYan, Zheng } 2643fd0a558SYan, Zheng 2653fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 2663fd0a558SYan, Zheng node = list_entry(cache->changed.next, 267a26195a5SQu Wenruo struct btrfs_backref_node, list); 2683fd0a558SYan, Zheng list_del_init(&node->list); 2693fd0a558SYan, Zheng BUG_ON(node->pending); 2703fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 2713fd0a558SYan, Zheng } 2723fd0a558SYan, Zheng 2733fd0a558SYan, Zheng /* 2743fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 2753fd0a558SYan, Zheng * errors during processing the pending nodes. 2763fd0a558SYan, Zheng */ 2773fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 2783fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 2793fd0a558SYan, Zheng BUG_ON(!node->pending); 2803fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 2813fd0a558SYan, Zheng continue; 2823fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 2833fd0a558SYan, Zheng } 2843fd0a558SYan, Zheng } 2853fd0a558SYan, Zheng 2863fd0a558SYan, Zheng cache->last_trans = 0; 2873fd0a558SYan, Zheng return 1; 2883fd0a558SYan, Zheng } 2893fd0a558SYan, Zheng 2906282675eSQu Wenruo static bool reloc_root_is_dead(struct btrfs_root *root) 2916282675eSQu Wenruo { 2926282675eSQu Wenruo /* 2936282675eSQu Wenruo * Pair with set_bit/clear_bit in clean_dirty_subvols and 2946282675eSQu Wenruo * btrfs_update_reloc_root. We need to see the updated bit before 2956282675eSQu Wenruo * trying to access reloc_root 2966282675eSQu Wenruo */ 2976282675eSQu Wenruo smp_rmb(); 2986282675eSQu Wenruo if (test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state)) 2996282675eSQu Wenruo return true; 3006282675eSQu Wenruo return false; 3016282675eSQu Wenruo } 3026282675eSQu Wenruo 3036282675eSQu Wenruo /* 3046282675eSQu Wenruo * Check if this subvolume tree has valid reloc tree. 3056282675eSQu Wenruo * 3066282675eSQu Wenruo * Reloc tree after swap is considered dead, thus not considered as valid. 3076282675eSQu Wenruo * This is enough for most callers, as they don't distinguish dead reloc root 30855465730SQu Wenruo * from no reloc root. But btrfs_should_ignore_reloc_root() below is a 30955465730SQu Wenruo * special case. 3106282675eSQu Wenruo */ 3116282675eSQu Wenruo static bool have_reloc_root(struct btrfs_root *root) 3126282675eSQu Wenruo { 3136282675eSQu Wenruo if (reloc_root_is_dead(root)) 3146282675eSQu Wenruo return false; 3156282675eSQu Wenruo if (!root->reloc_root) 3166282675eSQu Wenruo return false; 3176282675eSQu Wenruo return true; 3186282675eSQu Wenruo } 319f2a97a9dSDavid Sterba 32055465730SQu Wenruo int btrfs_should_ignore_reloc_root(struct btrfs_root *root) 3213fd0a558SYan, Zheng { 3223fd0a558SYan, Zheng struct btrfs_root *reloc_root; 3233fd0a558SYan, Zheng 32492a7cc42SQu Wenruo if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) 3253fd0a558SYan, Zheng return 0; 3263fd0a558SYan, Zheng 3276282675eSQu Wenruo /* This root has been merged with its reloc tree, we can ignore it */ 3286282675eSQu Wenruo if (reloc_root_is_dead(root)) 3296282675eSQu Wenruo return 1; 3306282675eSQu Wenruo 3313fd0a558SYan, Zheng reloc_root = root->reloc_root; 3323fd0a558SYan, Zheng if (!reloc_root) 3333fd0a558SYan, Zheng return 0; 3343fd0a558SYan, Zheng 3354d4225fcSJosef Bacik if (btrfs_header_generation(reloc_root->commit_root) == 3364d4225fcSJosef Bacik root->fs_info->running_transaction->transid) 3373fd0a558SYan, Zheng return 0; 3383fd0a558SYan, Zheng /* 3393fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 3403fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 3413fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 3423fd0a558SYan, Zheng * relocation. 3433fd0a558SYan, Zheng */ 3443fd0a558SYan, Zheng return 1; 3453fd0a558SYan, Zheng } 34655465730SQu Wenruo 3475d4f98a2SYan Zheng /* 3485d4f98a2SYan Zheng * find reloc tree by address of tree root 3495d4f98a2SYan Zheng */ 3502433bea5SQu Wenruo struct btrfs_root *find_reloc_root(struct btrfs_fs_info *fs_info, u64 bytenr) 3515d4f98a2SYan Zheng { 3522433bea5SQu Wenruo struct reloc_control *rc = fs_info->reloc_ctl; 3535d4f98a2SYan Zheng struct rb_node *rb_node; 3545d4f98a2SYan Zheng struct mapping_node *node; 3555d4f98a2SYan Zheng struct btrfs_root *root = NULL; 3565d4f98a2SYan Zheng 3572433bea5SQu Wenruo ASSERT(rc); 3585d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 359e9a28dc5SQu Wenruo rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, bytenr); 3605d4f98a2SYan Zheng if (rb_node) { 3615d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 3625d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 3635d4f98a2SYan Zheng } 3645d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 36500246528SJosef Bacik return btrfs_grab_root(root); 3665d4f98a2SYan Zheng } 3675d4f98a2SYan Zheng 3685d4f98a2SYan Zheng /* 36929db137bSQu Wenruo * For useless nodes, do two major clean ups: 37029db137bSQu Wenruo * 37129db137bSQu Wenruo * - Cleanup the children edges and nodes 37229db137bSQu Wenruo * If child node is also orphan (no parent) during cleanup, then the child 37329db137bSQu Wenruo * node will also be cleaned up. 37429db137bSQu Wenruo * 37529db137bSQu Wenruo * - Freeing up leaves (level 0), keeps nodes detached 37629db137bSQu Wenruo * For nodes, the node is still cached as "detached" 37729db137bSQu Wenruo * 37829db137bSQu Wenruo * Return false if @node is not in the @useless_nodes list. 37929db137bSQu Wenruo * Return true if @node is in the @useless_nodes list. 38029db137bSQu Wenruo */ 38129db137bSQu Wenruo static bool handle_useless_nodes(struct reloc_control *rc, 382a26195a5SQu Wenruo struct btrfs_backref_node *node) 38329db137bSQu Wenruo { 384a26195a5SQu Wenruo struct btrfs_backref_cache *cache = &rc->backref_cache; 38529db137bSQu Wenruo struct list_head *useless_node = &cache->useless_node; 38629db137bSQu Wenruo bool ret = false; 38729db137bSQu Wenruo 38829db137bSQu Wenruo while (!list_empty(useless_node)) { 389a26195a5SQu Wenruo struct btrfs_backref_node *cur; 39029db137bSQu Wenruo 391a26195a5SQu Wenruo cur = list_first_entry(useless_node, struct btrfs_backref_node, 39229db137bSQu Wenruo list); 39329db137bSQu Wenruo list_del_init(&cur->list); 39429db137bSQu Wenruo 39529db137bSQu Wenruo /* Only tree root nodes can be added to @useless_nodes */ 39629db137bSQu Wenruo ASSERT(list_empty(&cur->upper)); 39729db137bSQu Wenruo 39829db137bSQu Wenruo if (cur == node) 39929db137bSQu Wenruo ret = true; 40029db137bSQu Wenruo 40129db137bSQu Wenruo /* The node is the lowest node */ 40229db137bSQu Wenruo if (cur->lowest) { 40329db137bSQu Wenruo list_del_init(&cur->lower); 40429db137bSQu Wenruo cur->lowest = 0; 40529db137bSQu Wenruo } 40629db137bSQu Wenruo 40729db137bSQu Wenruo /* Cleanup the lower edges */ 40829db137bSQu Wenruo while (!list_empty(&cur->lower)) { 409a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 410a26195a5SQu Wenruo struct btrfs_backref_node *lower; 41129db137bSQu Wenruo 41229db137bSQu Wenruo edge = list_entry(cur->lower.next, 413a26195a5SQu Wenruo struct btrfs_backref_edge, list[UPPER]); 41429db137bSQu Wenruo list_del(&edge->list[UPPER]); 41529db137bSQu Wenruo list_del(&edge->list[LOWER]); 41629db137bSQu Wenruo lower = edge->node[LOWER]; 417741188d3SQu Wenruo btrfs_backref_free_edge(cache, edge); 41829db137bSQu Wenruo 41929db137bSQu Wenruo /* Child node is also orphan, queue for cleanup */ 42029db137bSQu Wenruo if (list_empty(&lower->upper)) 42129db137bSQu Wenruo list_add(&lower->list, useless_node); 42229db137bSQu Wenruo } 42329db137bSQu Wenruo /* Mark this block processed for relocation */ 42429db137bSQu Wenruo mark_block_processed(rc, cur); 42529db137bSQu Wenruo 42629db137bSQu Wenruo /* 42729db137bSQu Wenruo * Backref nodes for tree leaves are deleted from the cache. 42829db137bSQu Wenruo * Backref nodes for upper level tree blocks are left in the 42929db137bSQu Wenruo * cache to avoid unnecessary backref lookup. 43029db137bSQu Wenruo */ 43129db137bSQu Wenruo if (cur->level > 0) { 43229db137bSQu Wenruo list_add(&cur->list, &cache->detached); 43329db137bSQu Wenruo cur->detached = 1; 43429db137bSQu Wenruo } else { 43529db137bSQu Wenruo rb_erase(&cur->rb_node, &cache->rb_root); 436741188d3SQu Wenruo btrfs_backref_free_node(cache, cur); 43729db137bSQu Wenruo } 43829db137bSQu Wenruo } 43929db137bSQu Wenruo return ret; 44029db137bSQu Wenruo } 44129db137bSQu Wenruo 44229db137bSQu Wenruo /* 443e7d571c7SQu Wenruo * Build backref tree for a given tree block. Root of the backref tree 444e7d571c7SQu Wenruo * corresponds the tree block, leaves of the backref tree correspond roots of 445e7d571c7SQu Wenruo * b-trees that reference the tree block. 446e7d571c7SQu Wenruo * 447e7d571c7SQu Wenruo * The basic idea of this function is check backrefs of a given block to find 448e7d571c7SQu Wenruo * upper level blocks that reference the block, and then check backrefs of 449e7d571c7SQu Wenruo * these upper level blocks recursively. The recursion stops when tree root is 450e7d571c7SQu Wenruo * reached or backrefs for the block is cached. 451e7d571c7SQu Wenruo * 452e7d571c7SQu Wenruo * NOTE: if we find that backrefs for a block are cached, we know backrefs for 453e7d571c7SQu Wenruo * all upper level blocks that directly/indirectly reference the block are also 454e7d571c7SQu Wenruo * cached. 455e7d571c7SQu Wenruo */ 456a26195a5SQu Wenruo static noinline_for_stack struct btrfs_backref_node *build_backref_tree( 457e7d571c7SQu Wenruo struct reloc_control *rc, struct btrfs_key *node_key, 458e7d571c7SQu Wenruo int level, u64 bytenr) 459e7d571c7SQu Wenruo { 460e7d571c7SQu Wenruo struct btrfs_backref_iter *iter; 461a26195a5SQu Wenruo struct btrfs_backref_cache *cache = &rc->backref_cache; 462e7d571c7SQu Wenruo /* For searching parent of TREE_BLOCK_REF */ 463e7d571c7SQu Wenruo struct btrfs_path *path; 464a26195a5SQu Wenruo struct btrfs_backref_node *cur; 465a26195a5SQu Wenruo struct btrfs_backref_node *node = NULL; 466a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 467e7d571c7SQu Wenruo int ret; 468e7d571c7SQu Wenruo int err = 0; 469e7d571c7SQu Wenruo 470e7d571c7SQu Wenruo iter = btrfs_backref_iter_alloc(rc->extent_root->fs_info, GFP_NOFS); 471e7d571c7SQu Wenruo if (!iter) 472e7d571c7SQu Wenruo return ERR_PTR(-ENOMEM); 473e7d571c7SQu Wenruo path = btrfs_alloc_path(); 474e7d571c7SQu Wenruo if (!path) { 475e7d571c7SQu Wenruo err = -ENOMEM; 476e7d571c7SQu Wenruo goto out; 477e7d571c7SQu Wenruo } 478e7d571c7SQu Wenruo 479b1818dabSQu Wenruo node = btrfs_backref_alloc_node(cache, bytenr, level); 480e7d571c7SQu Wenruo if (!node) { 481e7d571c7SQu Wenruo err = -ENOMEM; 482e7d571c7SQu Wenruo goto out; 483e7d571c7SQu Wenruo } 484e7d571c7SQu Wenruo 485e7d571c7SQu Wenruo node->lowest = 1; 486e7d571c7SQu Wenruo cur = node; 487e7d571c7SQu Wenruo 488e7d571c7SQu Wenruo /* Breadth-first search to build backref cache */ 489e7d571c7SQu Wenruo do { 4901b60d2ecSQu Wenruo ret = btrfs_backref_add_tree_node(cache, path, iter, node_key, 4911b60d2ecSQu Wenruo cur); 492e7d571c7SQu Wenruo if (ret < 0) { 493e7d571c7SQu Wenruo err = ret; 494e7d571c7SQu Wenruo goto out; 495e7d571c7SQu Wenruo } 496e7d571c7SQu Wenruo edge = list_first_entry_or_null(&cache->pending_edge, 497a26195a5SQu Wenruo struct btrfs_backref_edge, list[UPPER]); 498e7d571c7SQu Wenruo /* 499e7d571c7SQu Wenruo * The pending list isn't empty, take the first block to 500e7d571c7SQu Wenruo * process 501e7d571c7SQu Wenruo */ 502e7d571c7SQu Wenruo if (edge) { 5035d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 5045d4f98a2SYan Zheng cur = edge->node[UPPER]; 5055d4f98a2SYan Zheng } 506e7d571c7SQu Wenruo } while (edge); 5075d4f98a2SYan Zheng 5081f872924SQu Wenruo /* Finish the upper linkage of newly added edges/nodes */ 509fc997ed0SQu Wenruo ret = btrfs_backref_finish_upper_links(cache, node); 5101f872924SQu Wenruo if (ret < 0) { 5111f872924SQu Wenruo err = ret; 51275bfb9afSJosef Bacik goto out; 51375bfb9afSJosef Bacik } 51475bfb9afSJosef Bacik 51529db137bSQu Wenruo if (handle_useless_nodes(rc, node)) 5163fd0a558SYan, Zheng node = NULL; 5175d4f98a2SYan Zheng out: 51871f572a9SQu Wenruo btrfs_backref_iter_free(iter); 51971f572a9SQu Wenruo btrfs_free_path(path); 5205d4f98a2SYan Zheng if (err) { 5211b23ea18SQu Wenruo btrfs_backref_error_cleanup(cache, node); 5225d4f98a2SYan Zheng return ERR_PTR(err); 5235d4f98a2SYan Zheng } 52475bfb9afSJosef Bacik ASSERT(!node || !node->detached); 52584780289SQu Wenruo ASSERT(list_empty(&cache->useless_node) && 52684780289SQu Wenruo list_empty(&cache->pending_edge)); 5275d4f98a2SYan Zheng return node; 5285d4f98a2SYan Zheng } 5295d4f98a2SYan Zheng 5305d4f98a2SYan Zheng /* 5313fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 5323fd0a558SYan, Zheng * the backref node is created by cloning backref node that 5333fd0a558SYan, Zheng * corresponds to root of source tree 5343fd0a558SYan, Zheng */ 5353fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 5363fd0a558SYan, Zheng struct reloc_control *rc, 5373fd0a558SYan, Zheng struct btrfs_root *src, 5383fd0a558SYan, Zheng struct btrfs_root *dest) 5393fd0a558SYan, Zheng { 5403fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 541a26195a5SQu Wenruo struct btrfs_backref_cache *cache = &rc->backref_cache; 542a26195a5SQu Wenruo struct btrfs_backref_node *node = NULL; 543a26195a5SQu Wenruo struct btrfs_backref_node *new_node; 544a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 545a26195a5SQu Wenruo struct btrfs_backref_edge *new_edge; 5463fd0a558SYan, Zheng struct rb_node *rb_node; 5473fd0a558SYan, Zheng 5483fd0a558SYan, Zheng if (cache->last_trans > 0) 5493fd0a558SYan, Zheng update_backref_cache(trans, cache); 5503fd0a558SYan, Zheng 551e9a28dc5SQu Wenruo rb_node = rb_simple_search(&cache->rb_root, src->commit_root->start); 5523fd0a558SYan, Zheng if (rb_node) { 553a26195a5SQu Wenruo node = rb_entry(rb_node, struct btrfs_backref_node, rb_node); 5543fd0a558SYan, Zheng if (node->detached) 5553fd0a558SYan, Zheng node = NULL; 5563fd0a558SYan, Zheng else 5573fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 5583fd0a558SYan, Zheng } 5593fd0a558SYan, Zheng 5603fd0a558SYan, Zheng if (!node) { 561e9a28dc5SQu Wenruo rb_node = rb_simple_search(&cache->rb_root, 5623fd0a558SYan, Zheng reloc_root->commit_root->start); 5633fd0a558SYan, Zheng if (rb_node) { 564a26195a5SQu Wenruo node = rb_entry(rb_node, struct btrfs_backref_node, 5653fd0a558SYan, Zheng rb_node); 5663fd0a558SYan, Zheng BUG_ON(node->detached); 5673fd0a558SYan, Zheng } 5683fd0a558SYan, Zheng } 5693fd0a558SYan, Zheng 5703fd0a558SYan, Zheng if (!node) 5713fd0a558SYan, Zheng return 0; 5723fd0a558SYan, Zheng 573b1818dabSQu Wenruo new_node = btrfs_backref_alloc_node(cache, dest->node->start, 574b1818dabSQu Wenruo node->level); 5753fd0a558SYan, Zheng if (!new_node) 5763fd0a558SYan, Zheng return -ENOMEM; 5773fd0a558SYan, Zheng 5783fd0a558SYan, Zheng new_node->lowest = node->lowest; 5796848ad64SYan, Zheng new_node->checked = 1; 58000246528SJosef Bacik new_node->root = btrfs_grab_root(dest); 5810b530bc5SJosef Bacik ASSERT(new_node->root); 5823fd0a558SYan, Zheng 5833fd0a558SYan, Zheng if (!node->lowest) { 5843fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 58547254d07SQu Wenruo new_edge = btrfs_backref_alloc_edge(cache); 5863fd0a558SYan, Zheng if (!new_edge) 5873fd0a558SYan, Zheng goto fail; 5883fd0a558SYan, Zheng 589f39911e5SQu Wenruo btrfs_backref_link_edge(new_edge, edge->node[LOWER], 590f39911e5SQu Wenruo new_node, LINK_UPPER); 5913fd0a558SYan, Zheng } 59276b9e23dSMiao Xie } else { 59376b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 5943fd0a558SYan, Zheng } 5953fd0a558SYan, Zheng 596e9a28dc5SQu Wenruo rb_node = rb_simple_insert(&cache->rb_root, new_node->bytenr, 5973fd0a558SYan, Zheng &new_node->rb_node); 59843c04fb1SJeff Mahoney if (rb_node) 599982c92cbSQu Wenruo btrfs_backref_panic(trans->fs_info, new_node->bytenr, -EEXIST); 6003fd0a558SYan, Zheng 6013fd0a558SYan, Zheng if (!new_node->lowest) { 6023fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 6033fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 6043fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 6053fd0a558SYan, Zheng } 6063fd0a558SYan, Zheng } 6073fd0a558SYan, Zheng return 0; 6083fd0a558SYan, Zheng fail: 6093fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 6103fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 611a26195a5SQu Wenruo struct btrfs_backref_edge, list[UPPER]); 6123fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 613741188d3SQu Wenruo btrfs_backref_free_edge(cache, new_edge); 6143fd0a558SYan, Zheng } 615741188d3SQu Wenruo btrfs_backref_free_node(cache, new_node); 6163fd0a558SYan, Zheng return -ENOMEM; 6173fd0a558SYan, Zheng } 6183fd0a558SYan, Zheng 6193fd0a558SYan, Zheng /* 6205d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 6215d4f98a2SYan Zheng */ 622ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 6235d4f98a2SYan Zheng { 6240b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 6255d4f98a2SYan Zheng struct rb_node *rb_node; 6265d4f98a2SYan Zheng struct mapping_node *node; 6270b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 6285d4f98a2SYan Zheng 6295d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 630ffd7b339SJeff Mahoney if (!node) 631ffd7b339SJeff Mahoney return -ENOMEM; 6325d4f98a2SYan Zheng 633ea287ab1SJosef Bacik node->bytenr = root->commit_root->start; 6345d4f98a2SYan Zheng node->data = root; 6355d4f98a2SYan Zheng 6365d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 637e9a28dc5SQu Wenruo rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, 6385d4f98a2SYan Zheng node->bytenr, &node->rb_node); 6395d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 640ffd7b339SJeff Mahoney if (rb_node) { 6410b246afaSJeff Mahoney btrfs_panic(fs_info, -EEXIST, 6425d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 6435d163e0eSJeff Mahoney node->bytenr); 644ffd7b339SJeff Mahoney } 6455d4f98a2SYan Zheng 6465d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 6475d4f98a2SYan Zheng return 0; 6485d4f98a2SYan Zheng } 6495d4f98a2SYan Zheng 6505d4f98a2SYan Zheng /* 651c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 6525d4f98a2SYan Zheng * mapping 6535d4f98a2SYan Zheng */ 654c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 6555d4f98a2SYan Zheng { 6560b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 6575d4f98a2SYan Zheng struct rb_node *rb_node; 6585d4f98a2SYan Zheng struct mapping_node *node = NULL; 6590b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 660f44deb74SJosef Bacik bool put_ref = false; 6615d4f98a2SYan Zheng 66265c6e82bSQu Wenruo if (rc && root->node) { 6635d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 664e9a28dc5SQu Wenruo rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, 665ea287ab1SJosef Bacik root->commit_root->start); 666c974c464SWang Shilong if (rb_node) { 667c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 668c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 669ea287ab1SJosef Bacik RB_CLEAR_NODE(&node->rb_node); 670c974c464SWang Shilong } 671c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 672c78a10aeSJosef Bacik ASSERT(!node || (struct btrfs_root *)node->data == root); 673389305b2SQu Wenruo } 674c974c464SWang Shilong 675f44deb74SJosef Bacik /* 676f44deb74SJosef Bacik * We only put the reloc root here if it's on the list. There's a lot 677f44deb74SJosef Bacik * of places where the pattern is to splice the rc->reloc_roots, process 678f44deb74SJosef Bacik * the reloc roots, and then add the reloc root back onto 679f44deb74SJosef Bacik * rc->reloc_roots. If we call __del_reloc_root while it's off of the 680f44deb74SJosef Bacik * list we don't want the reference being dropped, because the guy 681f44deb74SJosef Bacik * messing with the list is in charge of the reference. 682f44deb74SJosef Bacik */ 6830b246afaSJeff Mahoney spin_lock(&fs_info->trans_lock); 684f44deb74SJosef Bacik if (!list_empty(&root->root_list)) { 685f44deb74SJosef Bacik put_ref = true; 686c974c464SWang Shilong list_del_init(&root->root_list); 687f44deb74SJosef Bacik } 6880b246afaSJeff Mahoney spin_unlock(&fs_info->trans_lock); 689f44deb74SJosef Bacik if (put_ref) 690f44deb74SJosef Bacik btrfs_put_root(root); 691c974c464SWang Shilong kfree(node); 692c974c464SWang Shilong } 693c974c464SWang Shilong 694c974c464SWang Shilong /* 695c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 696c974c464SWang Shilong * mapping 697c974c464SWang Shilong */ 698ea287ab1SJosef Bacik static int __update_reloc_root(struct btrfs_root *root) 699c974c464SWang Shilong { 7000b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 701c974c464SWang Shilong struct rb_node *rb_node; 702c974c464SWang Shilong struct mapping_node *node = NULL; 7030b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 704c974c464SWang Shilong 705c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 706e9a28dc5SQu Wenruo rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, 707ea287ab1SJosef Bacik root->commit_root->start); 7085d4f98a2SYan Zheng if (rb_node) { 7095d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 7105d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 7115d4f98a2SYan Zheng } 7125d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 7135d4f98a2SYan Zheng 7148f71f3e0SLiu Bo if (!node) 7158f71f3e0SLiu Bo return 0; 7165d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 7175d4f98a2SYan Zheng 7185d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 719ea287ab1SJosef Bacik node->bytenr = root->node->start; 720e9a28dc5SQu Wenruo rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, 7215d4f98a2SYan Zheng node->bytenr, &node->rb_node); 7225d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 72343c04fb1SJeff Mahoney if (rb_node) 724982c92cbSQu Wenruo btrfs_backref_panic(fs_info, node->bytenr, -EEXIST); 7255d4f98a2SYan Zheng return 0; 7265d4f98a2SYan Zheng } 7275d4f98a2SYan Zheng 7283fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 7293fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 7305d4f98a2SYan Zheng { 7310b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 7325d4f98a2SYan Zheng struct btrfs_root *reloc_root; 7335d4f98a2SYan Zheng struct extent_buffer *eb; 7345d4f98a2SYan Zheng struct btrfs_root_item *root_item; 7355d4f98a2SYan Zheng struct btrfs_key root_key; 7365d4f98a2SYan Zheng int ret; 7375d4f98a2SYan Zheng 7385d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 7395d4f98a2SYan Zheng BUG_ON(!root_item); 7405d4f98a2SYan Zheng 7415d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 7425d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 7433fd0a558SYan, Zheng root_key.offset = objectid; 7445d4f98a2SYan Zheng 7453fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 746054570a1SFilipe Manana u64 commit_root_gen; 747054570a1SFilipe Manana 7483fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 7495d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 7505d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 7515d4f98a2SYan Zheng BUG_ON(ret); 752054570a1SFilipe Manana /* 753054570a1SFilipe Manana * Set the last_snapshot field to the generation of the commit 754054570a1SFilipe Manana * root - like this ctree.c:btrfs_block_can_be_shared() behaves 755054570a1SFilipe Manana * correctly (returns true) when the relocation root is created 756054570a1SFilipe Manana * either inside the critical section of a transaction commit 757054570a1SFilipe Manana * (through transaction.c:qgroup_account_snapshot()) and when 758054570a1SFilipe Manana * it's created before the transaction commit is started. 759054570a1SFilipe Manana */ 760054570a1SFilipe Manana commit_root_gen = btrfs_header_generation(root->commit_root); 761054570a1SFilipe Manana btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); 7623fd0a558SYan, Zheng } else { 7633fd0a558SYan, Zheng /* 7643fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 7653fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 7663fd0a558SYan, Zheng * modified after it was created have RELOC flag 7673fd0a558SYan, Zheng * set in their headers. so it's OK to not update 7683fd0a558SYan, Zheng * the 'last_snapshot'. 7693fd0a558SYan, Zheng */ 7703fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 7713fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 7723fd0a558SYan, Zheng BUG_ON(ret); 7733fd0a558SYan, Zheng } 7743fd0a558SYan, Zheng 7755d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 7765d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 7775d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 7785d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 7793fd0a558SYan, Zheng 7803fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 7813fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 7823fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 7833fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 784c8422684SDavid Sterba btrfs_set_root_drop_level(root_item, 0); 7853fd0a558SYan, Zheng } 7865d4f98a2SYan Zheng 7875d4f98a2SYan Zheng btrfs_tree_unlock(eb); 7885d4f98a2SYan Zheng free_extent_buffer(eb); 7895d4f98a2SYan Zheng 7900b246afaSJeff Mahoney ret = btrfs_insert_root(trans, fs_info->tree_root, 7915d4f98a2SYan Zheng &root_key, root_item); 7925d4f98a2SYan Zheng BUG_ON(ret); 7935d4f98a2SYan Zheng kfree(root_item); 7945d4f98a2SYan Zheng 7953dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(fs_info->tree_root, &root_key); 7965d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 79792a7cc42SQu Wenruo set_bit(BTRFS_ROOT_SHAREABLE, &reloc_root->state); 7985d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 7993fd0a558SYan, Zheng return reloc_root; 8003fd0a558SYan, Zheng } 8013fd0a558SYan, Zheng 8023fd0a558SYan, Zheng /* 8033fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 8043fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 805f44deb74SJosef Bacik * 806f44deb74SJosef Bacik * The reloc_root comes out of here with two references, one for 807f44deb74SJosef Bacik * root->reloc_root, and another for being on the rc->reloc_roots list. 8083fd0a558SYan, Zheng */ 8093fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 8103fd0a558SYan, Zheng struct btrfs_root *root) 8113fd0a558SYan, Zheng { 8120b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 8133fd0a558SYan, Zheng struct btrfs_root *reloc_root; 8140b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 81520dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 8163fd0a558SYan, Zheng int clear_rsv = 0; 817ffd7b339SJeff Mahoney int ret; 8183fd0a558SYan, Zheng 819aec7db3bSJosef Bacik if (!rc) 8202abc726aSJosef Bacik return 0; 8212abc726aSJosef Bacik 8221fac4a54SQu Wenruo /* 8231fac4a54SQu Wenruo * The subvolume has reloc tree but the swap is finished, no need to 8241fac4a54SQu Wenruo * create/update the dead reloc tree 8251fac4a54SQu Wenruo */ 8266282675eSQu Wenruo if (reloc_root_is_dead(root)) 8271fac4a54SQu Wenruo return 0; 8281fac4a54SQu Wenruo 829aec7db3bSJosef Bacik /* 830aec7db3bSJosef Bacik * This is subtle but important. We do not do 831aec7db3bSJosef Bacik * record_root_in_transaction for reloc roots, instead we record their 832aec7db3bSJosef Bacik * corresponding fs root, and then here we update the last trans for the 833aec7db3bSJosef Bacik * reloc root. This means that we have to do this for the entire life 834aec7db3bSJosef Bacik * of the reloc root, regardless of which stage of the relocation we are 835aec7db3bSJosef Bacik * in. 836aec7db3bSJosef Bacik */ 8373fd0a558SYan, Zheng if (root->reloc_root) { 8383fd0a558SYan, Zheng reloc_root = root->reloc_root; 8393fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 8403fd0a558SYan, Zheng return 0; 8413fd0a558SYan, Zheng } 8423fd0a558SYan, Zheng 843aec7db3bSJosef Bacik /* 844aec7db3bSJosef Bacik * We are merging reloc roots, we do not need new reloc trees. Also 845aec7db3bSJosef Bacik * reloc trees never need their own reloc tree. 846aec7db3bSJosef Bacik */ 847aec7db3bSJosef Bacik if (!rc->create_reloc_tree || 848aec7db3bSJosef Bacik root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 849aec7db3bSJosef Bacik return 0; 850aec7db3bSJosef Bacik 85120dd2cbfSMiao Xie if (!trans->reloc_reserved) { 85220dd2cbfSMiao Xie rsv = trans->block_rsv; 8533fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 8543fd0a558SYan, Zheng clear_rsv = 1; 8553fd0a558SYan, Zheng } 8563fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 8573fd0a558SYan, Zheng if (clear_rsv) 85820dd2cbfSMiao Xie trans->block_rsv = rsv; 8595d4f98a2SYan Zheng 860ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 861ffd7b339SJeff Mahoney BUG_ON(ret < 0); 862f44deb74SJosef Bacik root->reloc_root = btrfs_grab_root(reloc_root); 8635d4f98a2SYan Zheng return 0; 8645d4f98a2SYan Zheng } 8655d4f98a2SYan Zheng 8665d4f98a2SYan Zheng /* 8675d4f98a2SYan Zheng * update root item of reloc tree 8685d4f98a2SYan Zheng */ 8695d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 8705d4f98a2SYan Zheng struct btrfs_root *root) 8715d4f98a2SYan Zheng { 8720b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 8735d4f98a2SYan Zheng struct btrfs_root *reloc_root; 8745d4f98a2SYan Zheng struct btrfs_root_item *root_item; 8755d4f98a2SYan Zheng int ret; 8765d4f98a2SYan Zheng 8776282675eSQu Wenruo if (!have_reloc_root(root)) 8787585717fSChris Mason goto out; 8795d4f98a2SYan Zheng 8805d4f98a2SYan Zheng reloc_root = root->reloc_root; 8815d4f98a2SYan Zheng root_item = &reloc_root->root_item; 8825d4f98a2SYan Zheng 883f44deb74SJosef Bacik /* 884f44deb74SJosef Bacik * We are probably ok here, but __del_reloc_root() will drop its ref of 885f44deb74SJosef Bacik * the root. We have the ref for root->reloc_root, but just in case 886f44deb74SJosef Bacik * hold it while we update the reloc root. 887f44deb74SJosef Bacik */ 888f44deb74SJosef Bacik btrfs_grab_root(reloc_root); 889f44deb74SJosef Bacik 890d2311e69SQu Wenruo /* root->reloc_root will stay until current relocation finished */ 8910b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 8923fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 893d2311e69SQu Wenruo set_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 8946282675eSQu Wenruo /* 8956282675eSQu Wenruo * Mark the tree as dead before we change reloc_root so 8966282675eSQu Wenruo * have_reloc_root will not touch it from now on. 8976282675eSQu Wenruo */ 8986282675eSQu Wenruo smp_wmb(); 899c974c464SWang Shilong __del_reloc_root(reloc_root); 9005d4f98a2SYan Zheng } 9015d4f98a2SYan Zheng 9025d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 903ea287ab1SJosef Bacik __update_reloc_root(reloc_root); 9045d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 9055d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 9065d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 9075d4f98a2SYan Zheng } 9085d4f98a2SYan Zheng 9090b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 9105d4f98a2SYan Zheng &reloc_root->root_key, root_item); 9115d4f98a2SYan Zheng BUG_ON(ret); 912f44deb74SJosef Bacik btrfs_put_root(reloc_root); 9137585717fSChris Mason out: 9145d4f98a2SYan Zheng return 0; 9155d4f98a2SYan Zheng } 9165d4f98a2SYan Zheng 9175d4f98a2SYan Zheng /* 9185d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 9195d4f98a2SYan Zheng * in a subvolume 9205d4f98a2SYan Zheng */ 9215d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 9225d4f98a2SYan Zheng { 9235d4f98a2SYan Zheng struct rb_node *node; 9245d4f98a2SYan Zheng struct rb_node *prev; 9255d4f98a2SYan Zheng struct btrfs_inode *entry; 9265d4f98a2SYan Zheng struct inode *inode; 9275d4f98a2SYan Zheng 9285d4f98a2SYan Zheng spin_lock(&root->inode_lock); 9295d4f98a2SYan Zheng again: 9305d4f98a2SYan Zheng node = root->inode_tree.rb_node; 9315d4f98a2SYan Zheng prev = NULL; 9325d4f98a2SYan Zheng while (node) { 9335d4f98a2SYan Zheng prev = node; 9345d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 9355d4f98a2SYan Zheng 9364a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 9375d4f98a2SYan Zheng node = node->rb_left; 9384a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 9395d4f98a2SYan Zheng node = node->rb_right; 9405d4f98a2SYan Zheng else 9415d4f98a2SYan Zheng break; 9425d4f98a2SYan Zheng } 9435d4f98a2SYan Zheng if (!node) { 9445d4f98a2SYan Zheng while (prev) { 9455d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 9464a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 9475d4f98a2SYan Zheng node = prev; 9485d4f98a2SYan Zheng break; 9495d4f98a2SYan Zheng } 9505d4f98a2SYan Zheng prev = rb_next(prev); 9515d4f98a2SYan Zheng } 9525d4f98a2SYan Zheng } 9535d4f98a2SYan Zheng while (node) { 9545d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 9555d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 9565d4f98a2SYan Zheng if (inode) { 9575d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 9585d4f98a2SYan Zheng return inode; 9595d4f98a2SYan Zheng } 9605d4f98a2SYan Zheng 9614a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 9625d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 9635d4f98a2SYan Zheng goto again; 9645d4f98a2SYan Zheng 9655d4f98a2SYan Zheng node = rb_next(node); 9665d4f98a2SYan Zheng } 9675d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 9685d4f98a2SYan Zheng return NULL; 9695d4f98a2SYan Zheng } 9705d4f98a2SYan Zheng 9715d4f98a2SYan Zheng /* 9725d4f98a2SYan Zheng * get new location of data 9735d4f98a2SYan Zheng */ 9745d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 9755d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 9765d4f98a2SYan Zheng { 9775d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 9785d4f98a2SYan Zheng struct btrfs_path *path; 9795d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 9805d4f98a2SYan Zheng struct extent_buffer *leaf; 9815d4f98a2SYan Zheng int ret; 9825d4f98a2SYan Zheng 9835d4f98a2SYan Zheng path = btrfs_alloc_path(); 9845d4f98a2SYan Zheng if (!path) 9855d4f98a2SYan Zheng return -ENOMEM; 9865d4f98a2SYan Zheng 9875d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 988f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 989f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 9905d4f98a2SYan Zheng if (ret < 0) 9915d4f98a2SYan Zheng goto out; 9925d4f98a2SYan Zheng if (ret > 0) { 9935d4f98a2SYan Zheng ret = -ENOENT; 9945d4f98a2SYan Zheng goto out; 9955d4f98a2SYan Zheng } 9965d4f98a2SYan Zheng 9975d4f98a2SYan Zheng leaf = path->nodes[0]; 9985d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 9995d4f98a2SYan Zheng struct btrfs_file_extent_item); 10005d4f98a2SYan Zheng 10015d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 10025d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 10035d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 10045d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 10055d4f98a2SYan Zheng 10065d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 100783d4cfd4SJosef Bacik ret = -EINVAL; 10085d4f98a2SYan Zheng goto out; 10095d4f98a2SYan Zheng } 10105d4f98a2SYan Zheng 10115d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 10125d4f98a2SYan Zheng ret = 0; 10135d4f98a2SYan Zheng out: 10145d4f98a2SYan Zheng btrfs_free_path(path); 10155d4f98a2SYan Zheng return ret; 10165d4f98a2SYan Zheng } 10175d4f98a2SYan Zheng 10185d4f98a2SYan Zheng /* 10195d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 10205d4f98a2SYan Zheng * the new locations. 10215d4f98a2SYan Zheng */ 10223fd0a558SYan, Zheng static noinline_for_stack 10233fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 10245d4f98a2SYan Zheng struct reloc_control *rc, 10255d4f98a2SYan Zheng struct btrfs_root *root, 10263fd0a558SYan, Zheng struct extent_buffer *leaf) 10275d4f98a2SYan Zheng { 10280b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 10295d4f98a2SYan Zheng struct btrfs_key key; 10305d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 10315d4f98a2SYan Zheng struct inode *inode = NULL; 10325d4f98a2SYan Zheng u64 parent; 10335d4f98a2SYan Zheng u64 bytenr; 10343fd0a558SYan, Zheng u64 new_bytenr = 0; 10355d4f98a2SYan Zheng u64 num_bytes; 10365d4f98a2SYan Zheng u64 end; 10375d4f98a2SYan Zheng u32 nritems; 10385d4f98a2SYan Zheng u32 i; 103983d4cfd4SJosef Bacik int ret = 0; 10405d4f98a2SYan Zheng int first = 1; 10415d4f98a2SYan Zheng int dirty = 0; 10425d4f98a2SYan Zheng 10435d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 10445d4f98a2SYan Zheng return 0; 10455d4f98a2SYan Zheng 10465d4f98a2SYan Zheng /* reloc trees always use full backref */ 10475d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 10485d4f98a2SYan Zheng parent = leaf->start; 10495d4f98a2SYan Zheng else 10505d4f98a2SYan Zheng parent = 0; 10515d4f98a2SYan Zheng 10525d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 10535d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 105482fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 105582fa113fSQu Wenruo 10565d4f98a2SYan Zheng cond_resched(); 10575d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 10585d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 10595d4f98a2SYan Zheng continue; 10605d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 10615d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 10625d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 10635d4f98a2SYan Zheng continue; 10645d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 10655d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 10665d4f98a2SYan Zheng if (bytenr == 0) 10675d4f98a2SYan Zheng continue; 10689569cc20SQu Wenruo if (!in_range(bytenr, rc->block_group->start, 10699569cc20SQu Wenruo rc->block_group->length)) 10705d4f98a2SYan Zheng continue; 10715d4f98a2SYan Zheng 10725d4f98a2SYan Zheng /* 10735d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 10745d4f98a2SYan Zheng * to complete and drop the extent cache 10755d4f98a2SYan Zheng */ 10765d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 10775d4f98a2SYan Zheng if (first) { 10785d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 10795d4f98a2SYan Zheng first = 0; 10804a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 10813fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 10825d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 10835d4f98a2SYan Zheng } 10844a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 10855d4f98a2SYan Zheng end = key.offset + 10865d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 10875d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 10880b246afaSJeff Mahoney fs_info->sectorsize)); 10890b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 10905d4f98a2SYan Zheng end--; 10915d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1092d0082371SJeff Mahoney key.offset, end); 10935d4f98a2SYan Zheng if (!ret) 10945d4f98a2SYan Zheng continue; 10955d4f98a2SYan Zheng 1096dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1097dcdbc059SNikolay Borisov key.offset, end, 1); 10985d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1099d0082371SJeff Mahoney key.offset, end); 11005d4f98a2SYan Zheng } 11015d4f98a2SYan Zheng } 11025d4f98a2SYan Zheng 11035d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 11045d4f98a2SYan Zheng bytenr, num_bytes); 110583d4cfd4SJosef Bacik if (ret) { 110683d4cfd4SJosef Bacik /* 110783d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 110883d4cfd4SJosef Bacik * in the file extent yet. 110983d4cfd4SJosef Bacik */ 111083d4cfd4SJosef Bacik break; 11113fd0a558SYan, Zheng } 11125d4f98a2SYan Zheng 11135d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 11145d4f98a2SYan Zheng dirty = 1; 11155d4f98a2SYan Zheng 11165d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 111782fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 111882fa113fSQu Wenruo num_bytes, parent); 111982fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 112082fa113fSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1121b06c4bf5SFilipe Manana key.objectid, key.offset); 112282fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 112383d4cfd4SJosef Bacik if (ret) { 112466642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 112583d4cfd4SJosef Bacik break; 112683d4cfd4SJosef Bacik } 11275d4f98a2SYan Zheng 1128ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, bytenr, 1129ffd4bb2aSQu Wenruo num_bytes, parent); 1130ffd4bb2aSQu Wenruo ref.real_root = root->root_key.objectid; 1131ffd4bb2aSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1132b06c4bf5SFilipe Manana key.objectid, key.offset); 1133ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 113483d4cfd4SJosef Bacik if (ret) { 113566642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 113683d4cfd4SJosef Bacik break; 113783d4cfd4SJosef Bacik } 11385d4f98a2SYan Zheng } 11395d4f98a2SYan Zheng if (dirty) 11405d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 11413fd0a558SYan, Zheng if (inode) 11423fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 114383d4cfd4SJosef Bacik return ret; 11445d4f98a2SYan Zheng } 11455d4f98a2SYan Zheng 11465d4f98a2SYan Zheng static noinline_for_stack 11475d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 11485d4f98a2SYan Zheng struct btrfs_path *path, int level) 11495d4f98a2SYan Zheng { 11505d4f98a2SYan Zheng struct btrfs_disk_key key1; 11515d4f98a2SYan Zheng struct btrfs_disk_key key2; 11525d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 11535d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 11545d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 11555d4f98a2SYan Zheng } 11565d4f98a2SYan Zheng 11575d4f98a2SYan Zheng /* 11585d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 11595d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 11605d4f98a2SYan Zheng * reloc tree was create can be replaced. 11615d4f98a2SYan Zheng * 11625d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 11635d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 11645d4f98a2SYan Zheng * errors, a negative error number is returned. 11655d4f98a2SYan Zheng */ 11663fd0a558SYan, Zheng static noinline_for_stack 11673d0174f7SQu Wenruo int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, 11685d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 11695d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 11705d4f98a2SYan Zheng int lowest_level, int max_level) 11715d4f98a2SYan Zheng { 11720b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 11735d4f98a2SYan Zheng struct extent_buffer *eb; 11745d4f98a2SYan Zheng struct extent_buffer *parent; 117582fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 11765d4f98a2SYan Zheng struct btrfs_key key; 11775d4f98a2SYan Zheng u64 old_bytenr; 11785d4f98a2SYan Zheng u64 new_bytenr; 11795d4f98a2SYan Zheng u64 old_ptr_gen; 11805d4f98a2SYan Zheng u64 new_ptr_gen; 11815d4f98a2SYan Zheng u64 last_snapshot; 11825d4f98a2SYan Zheng u32 blocksize; 11833fd0a558SYan, Zheng int cow = 0; 11845d4f98a2SYan Zheng int level; 11855d4f98a2SYan Zheng int ret; 11865d4f98a2SYan Zheng int slot; 11875d4f98a2SYan Zheng 11885d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 11895d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 11905d4f98a2SYan Zheng 11915d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 11923fd0a558SYan, Zheng again: 11935d4f98a2SYan Zheng slot = path->slots[lowest_level]; 11945d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 11955d4f98a2SYan Zheng 11965d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 11975d4f98a2SYan Zheng level = btrfs_header_level(eb); 11985d4f98a2SYan Zheng 11995d4f98a2SYan Zheng if (level < lowest_level) { 12005d4f98a2SYan Zheng btrfs_tree_unlock(eb); 12015d4f98a2SYan Zheng free_extent_buffer(eb); 12025d4f98a2SYan Zheng return 0; 12035d4f98a2SYan Zheng } 12045d4f98a2SYan Zheng 12053fd0a558SYan, Zheng if (cow) { 12069631e4ccSJosef Bacik ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb, 12079631e4ccSJosef Bacik BTRFS_NESTING_COW); 12085d4f98a2SYan Zheng BUG_ON(ret); 12093fd0a558SYan, Zheng } 12105d4f98a2SYan Zheng 12115d4f98a2SYan Zheng if (next_key) { 12125d4f98a2SYan Zheng next_key->objectid = (u64)-1; 12135d4f98a2SYan Zheng next_key->type = (u8)-1; 12145d4f98a2SYan Zheng next_key->offset = (u64)-1; 12155d4f98a2SYan Zheng } 12165d4f98a2SYan Zheng 12175d4f98a2SYan Zheng parent = eb; 12185d4f98a2SYan Zheng while (1) { 12195d4f98a2SYan Zheng level = btrfs_header_level(parent); 12205d4f98a2SYan Zheng BUG_ON(level < lowest_level); 12215d4f98a2SYan Zheng 1222e3b83361SQu Wenruo ret = btrfs_bin_search(parent, &key, &slot); 1223cbca7d59SFilipe Manana if (ret < 0) 1224cbca7d59SFilipe Manana break; 12255d4f98a2SYan Zheng if (ret && slot > 0) 12265d4f98a2SYan Zheng slot--; 12275d4f98a2SYan Zheng 12285d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 12295d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 12305d4f98a2SYan Zheng 12315d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 12320b246afaSJeff Mahoney blocksize = fs_info->nodesize; 12335d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 12345d4f98a2SYan Zheng 12355d4f98a2SYan Zheng if (level <= max_level) { 12365d4f98a2SYan Zheng eb = path->nodes[level]; 12375d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 12385d4f98a2SYan Zheng path->slots[level]); 12395d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 12405d4f98a2SYan Zheng path->slots[level]); 12415d4f98a2SYan Zheng } else { 12425d4f98a2SYan Zheng new_bytenr = 0; 12435d4f98a2SYan Zheng new_ptr_gen = 0; 12445d4f98a2SYan Zheng } 12455d4f98a2SYan Zheng 1246fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 12475d4f98a2SYan Zheng ret = level; 12485d4f98a2SYan Zheng break; 12495d4f98a2SYan Zheng } 12505d4f98a2SYan Zheng 12515d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 12525d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 12533fd0a558SYan, Zheng if (level <= lowest_level) { 12545d4f98a2SYan Zheng ret = 0; 12555d4f98a2SYan Zheng break; 12565d4f98a2SYan Zheng } 12575d4f98a2SYan Zheng 12586b3426beSJosef Bacik eb = btrfs_read_node_slot(parent, slot); 125964c043deSLiu Bo if (IS_ERR(eb)) { 126064c043deSLiu Bo ret = PTR_ERR(eb); 1261264813acSLiu Bo break; 1262416bc658SJosef Bacik } 12635d4f98a2SYan Zheng btrfs_tree_lock(eb); 12643fd0a558SYan, Zheng if (cow) { 12655d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 12669631e4ccSJosef Bacik slot, &eb, 12679631e4ccSJosef Bacik BTRFS_NESTING_COW); 12685d4f98a2SYan Zheng BUG_ON(ret); 12695d4f98a2SYan Zheng } 12705d4f98a2SYan Zheng 12715d4f98a2SYan Zheng btrfs_tree_unlock(parent); 12725d4f98a2SYan Zheng free_extent_buffer(parent); 12735d4f98a2SYan Zheng 12745d4f98a2SYan Zheng parent = eb; 12755d4f98a2SYan Zheng continue; 12765d4f98a2SYan Zheng } 12775d4f98a2SYan Zheng 12783fd0a558SYan, Zheng if (!cow) { 12793fd0a558SYan, Zheng btrfs_tree_unlock(parent); 12803fd0a558SYan, Zheng free_extent_buffer(parent); 12813fd0a558SYan, Zheng cow = 1; 12823fd0a558SYan, Zheng goto again; 12833fd0a558SYan, Zheng } 12843fd0a558SYan, Zheng 12855d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 12865d4f98a2SYan Zheng path->slots[level]); 1287b3b4aa74SDavid Sterba btrfs_release_path(path); 12885d4f98a2SYan Zheng 12895d4f98a2SYan Zheng path->lowest_level = level; 12905d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 12915d4f98a2SYan Zheng path->lowest_level = 0; 12925d4f98a2SYan Zheng BUG_ON(ret); 12935d4f98a2SYan Zheng 12945d4f98a2SYan Zheng /* 1295824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 1296824d8dffSQu Wenruo * 1297824d8dffSQu Wenruo * We must trace both trees. 1298824d8dffSQu Wenruo * 1) Tree reloc subtree 1299824d8dffSQu Wenruo * If not traced, we will leak data numbers 1300824d8dffSQu Wenruo * 2) Fs subtree 1301824d8dffSQu Wenruo * If not traced, we will double count old data 1302f616f5cdSQu Wenruo * 1303f616f5cdSQu Wenruo * We don't scan the subtree right now, but only record 1304f616f5cdSQu Wenruo * the swapped tree blocks. 1305f616f5cdSQu Wenruo * The real subtree rescan is delayed until we have new 1306f616f5cdSQu Wenruo * CoW on the subtree root node before transaction commit. 1307824d8dffSQu Wenruo */ 1308370a11b8SQu Wenruo ret = btrfs_qgroup_add_swapped_blocks(trans, dest, 1309370a11b8SQu Wenruo rc->block_group, parent, slot, 1310370a11b8SQu Wenruo path->nodes[level], path->slots[level], 1311370a11b8SQu Wenruo last_snapshot); 1312370a11b8SQu Wenruo if (ret < 0) 1313370a11b8SQu Wenruo break; 1314824d8dffSQu Wenruo /* 13155d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 13165d4f98a2SYan Zheng */ 13175d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 13185d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 13195d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 13205d4f98a2SYan Zheng 13215d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 13225d4f98a2SYan Zheng path->slots[level], old_bytenr); 13235d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 13245d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 13255d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 13265d4f98a2SYan Zheng 132782fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, old_bytenr, 132882fa113fSQu Wenruo blocksize, path->nodes[level]->start); 132982fa113fSQu Wenruo ref.skip_qgroup = true; 133082fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 133182fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 13325d4f98a2SYan Zheng BUG_ON(ret); 133382fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 133482fa113fSQu Wenruo blocksize, 0); 133582fa113fSQu Wenruo ref.skip_qgroup = true; 133682fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 133782fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 13385d4f98a2SYan Zheng BUG_ON(ret); 13395d4f98a2SYan Zheng 1340ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, new_bytenr, 1341ffd4bb2aSQu Wenruo blocksize, path->nodes[level]->start); 1342ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 1343ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 1344ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 13455d4f98a2SYan Zheng BUG_ON(ret); 13465d4f98a2SYan Zheng 1347ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, old_bytenr, 1348ffd4bb2aSQu Wenruo blocksize, 0); 1349ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 1350ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 1351ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 13525d4f98a2SYan Zheng BUG_ON(ret); 13535d4f98a2SYan Zheng 13545d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 13555d4f98a2SYan Zheng 13565d4f98a2SYan Zheng ret = level; 13575d4f98a2SYan Zheng break; 13585d4f98a2SYan Zheng } 13595d4f98a2SYan Zheng btrfs_tree_unlock(parent); 13605d4f98a2SYan Zheng free_extent_buffer(parent); 13615d4f98a2SYan Zheng return ret; 13625d4f98a2SYan Zheng } 13635d4f98a2SYan Zheng 13645d4f98a2SYan Zheng /* 13655d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 13665d4f98a2SYan Zheng */ 13675d4f98a2SYan Zheng static noinline_for_stack 13685d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 13695d4f98a2SYan Zheng int *level) 13705d4f98a2SYan Zheng { 13715d4f98a2SYan Zheng struct extent_buffer *eb; 13725d4f98a2SYan Zheng int i; 13735d4f98a2SYan Zheng u64 last_snapshot; 13745d4f98a2SYan Zheng u32 nritems; 13755d4f98a2SYan Zheng 13765d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 13775d4f98a2SYan Zheng 13785d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 13795d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 13805d4f98a2SYan Zheng path->nodes[i] = NULL; 13815d4f98a2SYan Zheng } 13825d4f98a2SYan Zheng 13835d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 13845d4f98a2SYan Zheng eb = path->nodes[i]; 13855d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 13865d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 13875d4f98a2SYan Zheng path->slots[i]++; 13885d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 13895d4f98a2SYan Zheng last_snapshot) 13905d4f98a2SYan Zheng continue; 13915d4f98a2SYan Zheng 13925d4f98a2SYan Zheng *level = i; 13935d4f98a2SYan Zheng return 0; 13945d4f98a2SYan Zheng } 13955d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 13965d4f98a2SYan Zheng path->nodes[i] = NULL; 13975d4f98a2SYan Zheng } 13985d4f98a2SYan Zheng return 1; 13995d4f98a2SYan Zheng } 14005d4f98a2SYan Zheng 14015d4f98a2SYan Zheng /* 14025d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 14035d4f98a2SYan Zheng */ 14045d4f98a2SYan Zheng static noinline_for_stack 14055d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 14065d4f98a2SYan Zheng int *level) 14075d4f98a2SYan Zheng { 14085d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 14095d4f98a2SYan Zheng int i; 14105d4f98a2SYan Zheng u64 ptr_gen = 0; 14115d4f98a2SYan Zheng u64 last_snapshot; 14125d4f98a2SYan Zheng u32 nritems; 14135d4f98a2SYan Zheng 14145d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 14155d4f98a2SYan Zheng 14165d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 14175d4f98a2SYan Zheng eb = path->nodes[i]; 14185d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 14195d4f98a2SYan Zheng while (path->slots[i] < nritems) { 14205d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 14215d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 14225d4f98a2SYan Zheng break; 14235d4f98a2SYan Zheng path->slots[i]++; 14245d4f98a2SYan Zheng } 14255d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 14265d4f98a2SYan Zheng if (i == *level) 14275d4f98a2SYan Zheng break; 14285d4f98a2SYan Zheng *level = i + 1; 14295d4f98a2SYan Zheng return 0; 14305d4f98a2SYan Zheng } 14315d4f98a2SYan Zheng if (i == 1) { 14325d4f98a2SYan Zheng *level = i; 14335d4f98a2SYan Zheng return 0; 14345d4f98a2SYan Zheng } 14355d4f98a2SYan Zheng 14368ef385bbSJosef Bacik eb = btrfs_read_node_slot(eb, path->slots[i]); 14378ef385bbSJosef Bacik if (IS_ERR(eb)) 143864c043deSLiu Bo return PTR_ERR(eb); 14395d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 14405d4f98a2SYan Zheng path->nodes[i - 1] = eb; 14415d4f98a2SYan Zheng path->slots[i - 1] = 0; 14425d4f98a2SYan Zheng } 14435d4f98a2SYan Zheng return 1; 14445d4f98a2SYan Zheng } 14455d4f98a2SYan Zheng 14465d4f98a2SYan Zheng /* 14475d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 14485d4f98a2SYan Zheng * [min_key, max_key) 14495d4f98a2SYan Zheng */ 14505d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 14515d4f98a2SYan Zheng struct btrfs_key *min_key, 14525d4f98a2SYan Zheng struct btrfs_key *max_key) 14535d4f98a2SYan Zheng { 14540b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14555d4f98a2SYan Zheng struct inode *inode = NULL; 14565d4f98a2SYan Zheng u64 objectid; 14575d4f98a2SYan Zheng u64 start, end; 145833345d01SLi Zefan u64 ino; 14595d4f98a2SYan Zheng 14605d4f98a2SYan Zheng objectid = min_key->objectid; 14615d4f98a2SYan Zheng while (1) { 14625d4f98a2SYan Zheng cond_resched(); 14635d4f98a2SYan Zheng iput(inode); 14645d4f98a2SYan Zheng 14655d4f98a2SYan Zheng if (objectid > max_key->objectid) 14665d4f98a2SYan Zheng break; 14675d4f98a2SYan Zheng 14685d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 14695d4f98a2SYan Zheng if (!inode) 14705d4f98a2SYan Zheng break; 14714a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 14725d4f98a2SYan Zheng 147333345d01SLi Zefan if (ino > max_key->objectid) { 14745d4f98a2SYan Zheng iput(inode); 14755d4f98a2SYan Zheng break; 14765d4f98a2SYan Zheng } 14775d4f98a2SYan Zheng 147833345d01SLi Zefan objectid = ino + 1; 14795d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 14805d4f98a2SYan Zheng continue; 14815d4f98a2SYan Zheng 148233345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 14835d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 14845d4f98a2SYan Zheng continue; 14855d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 14865d4f98a2SYan Zheng start = 0; 14875d4f98a2SYan Zheng else { 14885d4f98a2SYan Zheng start = min_key->offset; 14890b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 14905d4f98a2SYan Zheng } 14915d4f98a2SYan Zheng } else { 14925d4f98a2SYan Zheng start = 0; 14935d4f98a2SYan Zheng } 14945d4f98a2SYan Zheng 149533345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 14965d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 14975d4f98a2SYan Zheng continue; 14985d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 14995d4f98a2SYan Zheng end = (u64)-1; 15005d4f98a2SYan Zheng } else { 15015d4f98a2SYan Zheng if (max_key->offset == 0) 15025d4f98a2SYan Zheng continue; 15035d4f98a2SYan Zheng end = max_key->offset; 15040b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 15055d4f98a2SYan Zheng end--; 15065d4f98a2SYan Zheng } 15075d4f98a2SYan Zheng } else { 15085d4f98a2SYan Zheng end = (u64)-1; 15095d4f98a2SYan Zheng } 15105d4f98a2SYan Zheng 15115d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 1512d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 1513dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 1514d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 15155d4f98a2SYan Zheng } 15165d4f98a2SYan Zheng return 0; 15175d4f98a2SYan Zheng } 15185d4f98a2SYan Zheng 15195d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 15205d4f98a2SYan Zheng struct btrfs_key *key) 15215d4f98a2SYan Zheng 15225d4f98a2SYan Zheng { 15235d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 15245d4f98a2SYan Zheng if (!path->nodes[level]) 15255d4f98a2SYan Zheng break; 15265d4f98a2SYan Zheng if (path->slots[level] + 1 < 15275d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 15285d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 15295d4f98a2SYan Zheng path->slots[level] + 1); 15305d4f98a2SYan Zheng return 0; 15315d4f98a2SYan Zheng } 15325d4f98a2SYan Zheng level++; 15335d4f98a2SYan Zheng } 15345d4f98a2SYan Zheng return 1; 15355d4f98a2SYan Zheng } 15365d4f98a2SYan Zheng 15375d4f98a2SYan Zheng /* 1538d2311e69SQu Wenruo * Insert current subvolume into reloc_control::dirty_subvol_roots 1539d2311e69SQu Wenruo */ 1540d2311e69SQu Wenruo static void insert_dirty_subvol(struct btrfs_trans_handle *trans, 1541d2311e69SQu Wenruo struct reloc_control *rc, 1542d2311e69SQu Wenruo struct btrfs_root *root) 1543d2311e69SQu Wenruo { 1544d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 1545d2311e69SQu Wenruo struct btrfs_root_item *reloc_root_item; 1546d2311e69SQu Wenruo 1547d2311e69SQu Wenruo /* @root must be a subvolume tree root with a valid reloc tree */ 1548d2311e69SQu Wenruo ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 1549d2311e69SQu Wenruo ASSERT(reloc_root); 1550d2311e69SQu Wenruo 1551d2311e69SQu Wenruo reloc_root_item = &reloc_root->root_item; 1552d2311e69SQu Wenruo memset(&reloc_root_item->drop_progress, 0, 1553d2311e69SQu Wenruo sizeof(reloc_root_item->drop_progress)); 1554c8422684SDavid Sterba btrfs_set_root_drop_level(reloc_root_item, 0); 1555d2311e69SQu Wenruo btrfs_set_root_refs(reloc_root_item, 0); 1556d2311e69SQu Wenruo btrfs_update_reloc_root(trans, root); 1557d2311e69SQu Wenruo 1558d2311e69SQu Wenruo if (list_empty(&root->reloc_dirty_list)) { 155900246528SJosef Bacik btrfs_grab_root(root); 1560d2311e69SQu Wenruo list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); 1561d2311e69SQu Wenruo } 1562d2311e69SQu Wenruo } 1563d2311e69SQu Wenruo 1564d2311e69SQu Wenruo static int clean_dirty_subvols(struct reloc_control *rc) 1565d2311e69SQu Wenruo { 1566d2311e69SQu Wenruo struct btrfs_root *root; 1567d2311e69SQu Wenruo struct btrfs_root *next; 1568d2311e69SQu Wenruo int ret = 0; 156930d40577SQu Wenruo int ret2; 1570d2311e69SQu Wenruo 1571d2311e69SQu Wenruo list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, 1572d2311e69SQu Wenruo reloc_dirty_list) { 157330d40577SQu Wenruo if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 157430d40577SQu Wenruo /* Merged subvolume, cleanup its reloc root */ 1575d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 1576d2311e69SQu Wenruo 1577d2311e69SQu Wenruo list_del_init(&root->reloc_dirty_list); 1578d2311e69SQu Wenruo root->reloc_root = NULL; 15796282675eSQu Wenruo /* 15806282675eSQu Wenruo * Need barrier to ensure clear_bit() only happens after 15816282675eSQu Wenruo * root->reloc_root = NULL. Pairs with have_reloc_root. 15826282675eSQu Wenruo */ 15836282675eSQu Wenruo smp_wmb(); 15841fac4a54SQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 1585f28de8d8SJosef Bacik if (reloc_root) { 1586f44deb74SJosef Bacik /* 1587f44deb74SJosef Bacik * btrfs_drop_snapshot drops our ref we hold for 1588f44deb74SJosef Bacik * ->reloc_root. If it fails however we must 1589f44deb74SJosef Bacik * drop the ref ourselves. 1590f44deb74SJosef Bacik */ 1591f28de8d8SJosef Bacik ret2 = btrfs_drop_snapshot(reloc_root, 0, 1); 1592f44deb74SJosef Bacik if (ret2 < 0) { 1593f44deb74SJosef Bacik btrfs_put_root(reloc_root); 1594f44deb74SJosef Bacik if (!ret) 1595f28de8d8SJosef Bacik ret = ret2; 1596f28de8d8SJosef Bacik } 1597f44deb74SJosef Bacik } 159800246528SJosef Bacik btrfs_put_root(root); 159930d40577SQu Wenruo } else { 160030d40577SQu Wenruo /* Orphan reloc tree, just clean it up */ 16010078a9f9SNikolay Borisov ret2 = btrfs_drop_snapshot(root, 0, 1); 1602f44deb74SJosef Bacik if (ret2 < 0) { 1603f44deb74SJosef Bacik btrfs_put_root(root); 1604f44deb74SJosef Bacik if (!ret) 160530d40577SQu Wenruo ret = ret2; 160630d40577SQu Wenruo } 1607d2311e69SQu Wenruo } 1608f44deb74SJosef Bacik } 1609d2311e69SQu Wenruo return ret; 1610d2311e69SQu Wenruo } 1611d2311e69SQu Wenruo 1612d2311e69SQu Wenruo /* 16135d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 16145d4f98a2SYan Zheng * fs tree. 16155d4f98a2SYan Zheng */ 16165d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 16175d4f98a2SYan Zheng struct btrfs_root *root) 16185d4f98a2SYan Zheng { 16190b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 16205d4f98a2SYan Zheng struct btrfs_key key; 16215d4f98a2SYan Zheng struct btrfs_key next_key; 16229e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 16235d4f98a2SYan Zheng struct btrfs_root *reloc_root; 16245d4f98a2SYan Zheng struct btrfs_root_item *root_item; 16255d4f98a2SYan Zheng struct btrfs_path *path; 16263fd0a558SYan, Zheng struct extent_buffer *leaf; 1627fca3a45dSJosef Bacik int reserve_level; 16285d4f98a2SYan Zheng int level; 16295d4f98a2SYan Zheng int max_level; 16305d4f98a2SYan Zheng int replaced = 0; 1631c6a592f2SNikolay Borisov int ret = 0; 16323fd0a558SYan, Zheng u32 min_reserved; 16335d4f98a2SYan Zheng 16345d4f98a2SYan Zheng path = btrfs_alloc_path(); 16355d4f98a2SYan Zheng if (!path) 16365d4f98a2SYan Zheng return -ENOMEM; 1637e4058b54SDavid Sterba path->reada = READA_FORWARD; 16385d4f98a2SYan Zheng 16395d4f98a2SYan Zheng reloc_root = root->reloc_root; 16405d4f98a2SYan Zheng root_item = &reloc_root->root_item; 16415d4f98a2SYan Zheng 16425d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 16435d4f98a2SYan Zheng level = btrfs_root_level(root_item); 164467439dadSDavid Sterba atomic_inc(&reloc_root->node->refs); 16455d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 16465d4f98a2SYan Zheng path->slots[level] = 0; 16475d4f98a2SYan Zheng } else { 16485d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 16495d4f98a2SYan Zheng 1650c8422684SDavid Sterba level = btrfs_root_drop_level(root_item); 16515d4f98a2SYan Zheng BUG_ON(level == 0); 16525d4f98a2SYan Zheng path->lowest_level = level; 16535d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 165433c66f43SYan Zheng path->lowest_level = 0; 16555d4f98a2SYan Zheng if (ret < 0) { 16565d4f98a2SYan Zheng btrfs_free_path(path); 16575d4f98a2SYan Zheng return ret; 16585d4f98a2SYan Zheng } 16595d4f98a2SYan Zheng 16605d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 16615d4f98a2SYan Zheng path->slots[level]); 16625d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 16635d4f98a2SYan Zheng 16645d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 16655d4f98a2SYan Zheng } 16665d4f98a2SYan Zheng 166744d354abSQu Wenruo /* 166844d354abSQu Wenruo * In merge_reloc_root(), we modify the upper level pointer to swap the 166944d354abSQu Wenruo * tree blocks between reloc tree and subvolume tree. Thus for tree 167044d354abSQu Wenruo * block COW, we COW at most from level 1 to root level for each tree. 167144d354abSQu Wenruo * 167244d354abSQu Wenruo * Thus the needed metadata size is at most root_level * nodesize, 167344d354abSQu Wenruo * and * 2 since we have two trees to COW. 167444d354abSQu Wenruo */ 1675fca3a45dSJosef Bacik reserve_level = max_t(int, 1, btrfs_root_level(root_item)); 1676fca3a45dSJosef Bacik min_reserved = fs_info->nodesize * reserve_level * 2; 16775d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 16785d4f98a2SYan Zheng 16795d4f98a2SYan Zheng while (1) { 168008e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 168144d354abSQu Wenruo BTRFS_RESERVE_FLUSH_LIMIT); 1682c6a592f2SNikolay Borisov if (ret) 16839e6a0c52SJosef Bacik goto out; 16849e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 16859e6a0c52SJosef Bacik if (IS_ERR(trans)) { 1686c6a592f2SNikolay Borisov ret = PTR_ERR(trans); 16879e6a0c52SJosef Bacik trans = NULL; 16889e6a0c52SJosef Bacik goto out; 16899e6a0c52SJosef Bacik } 16902abc726aSJosef Bacik 16912abc726aSJosef Bacik /* 16922abc726aSJosef Bacik * At this point we no longer have a reloc_control, so we can't 16932abc726aSJosef Bacik * depend on btrfs_init_reloc_root to update our last_trans. 16942abc726aSJosef Bacik * 16952abc726aSJosef Bacik * But that's ok, we started the trans handle on our 16962abc726aSJosef Bacik * corresponding fs_root, which means it's been added to the 16972abc726aSJosef Bacik * dirty list. At commit time we'll still call 16982abc726aSJosef Bacik * btrfs_update_reloc_root() and update our root item 16992abc726aSJosef Bacik * appropriately. 17002abc726aSJosef Bacik */ 17012abc726aSJosef Bacik reloc_root->last_trans = trans->transid; 17029e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 17033fd0a558SYan, Zheng 17043fd0a558SYan, Zheng replaced = 0; 17055d4f98a2SYan Zheng max_level = level; 17065d4f98a2SYan Zheng 17075d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 1708c6a592f2SNikolay Borisov if (ret < 0) 17095d4f98a2SYan Zheng goto out; 17105d4f98a2SYan Zheng if (ret > 0) 17115d4f98a2SYan Zheng break; 17125d4f98a2SYan Zheng 17135d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 17145d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 17155d4f98a2SYan Zheng ret = 0; 17165d4f98a2SYan Zheng } else { 17173d0174f7SQu Wenruo ret = replace_path(trans, rc, root, reloc_root, path, 17183fd0a558SYan, Zheng &next_key, level, max_level); 17195d4f98a2SYan Zheng } 1720c6a592f2SNikolay Borisov if (ret < 0) 17215d4f98a2SYan Zheng goto out; 17225d4f98a2SYan Zheng if (ret > 0) { 17235d4f98a2SYan Zheng level = ret; 17245d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 17255d4f98a2SYan Zheng path->slots[level]); 17265d4f98a2SYan Zheng replaced = 1; 17275d4f98a2SYan Zheng } 17285d4f98a2SYan Zheng 17295d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 17305d4f98a2SYan Zheng if (ret > 0) 17315d4f98a2SYan Zheng break; 17325d4f98a2SYan Zheng 17335d4f98a2SYan Zheng BUG_ON(level == 0); 17345d4f98a2SYan Zheng /* 17355d4f98a2SYan Zheng * save the merging progress in the drop_progress. 17365d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 17375d4f98a2SYan Zheng */ 17385d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 17395d4f98a2SYan Zheng path->slots[level]); 1740c8422684SDavid Sterba btrfs_set_root_drop_level(root_item, level); 17415d4f98a2SYan Zheng 17423a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 17439e6a0c52SJosef Bacik trans = NULL; 17445d4f98a2SYan Zheng 17452ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 17465d4f98a2SYan Zheng 17475d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 17485d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 17495d4f98a2SYan Zheng } 17505d4f98a2SYan Zheng 17515d4f98a2SYan Zheng /* 17525d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 17535d4f98a2SYan Zheng * relocated and the block is tree root. 17545d4f98a2SYan Zheng */ 17555d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 17569631e4ccSJosef Bacik ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf, 17579631e4ccSJosef Bacik BTRFS_NESTING_COW); 17585d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 17595d4f98a2SYan Zheng free_extent_buffer(leaf); 17605d4f98a2SYan Zheng out: 17615d4f98a2SYan Zheng btrfs_free_path(path); 17625d4f98a2SYan Zheng 1763c6a592f2SNikolay Borisov if (ret == 0) 1764d2311e69SQu Wenruo insert_dirty_subvol(trans, rc, root); 17655d4f98a2SYan Zheng 17669e6a0c52SJosef Bacik if (trans) 17673a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 17685d4f98a2SYan Zheng 17692ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 17705d4f98a2SYan Zheng 17715d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 17725d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 17735d4f98a2SYan Zheng 1774c6a592f2SNikolay Borisov return ret; 17755d4f98a2SYan Zheng } 17765d4f98a2SYan Zheng 17773fd0a558SYan, Zheng static noinline_for_stack 17783fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 17795d4f98a2SYan Zheng { 17803fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 17810b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 17823fd0a558SYan, Zheng struct btrfs_root *reloc_root; 17835d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 17843fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 17853fd0a558SYan, Zheng u64 num_bytes = 0; 17863fd0a558SYan, Zheng int ret; 17873fd0a558SYan, Zheng 17880b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 17890b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 17903fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 17910b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 17927585717fSChris Mason 17933fd0a558SYan, Zheng again: 17943fd0a558SYan, Zheng if (!err) { 17953fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 179608e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 179708e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 17983fd0a558SYan, Zheng if (ret) 17993fd0a558SYan, Zheng err = ret; 18003fd0a558SYan, Zheng } 18013fd0a558SYan, Zheng 18027a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 18033612b495STsutomu Itoh if (IS_ERR(trans)) { 18043612b495STsutomu Itoh if (!err) 18052ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 180663f018beSNikolay Borisov num_bytes, NULL); 18073612b495STsutomu Itoh return PTR_ERR(trans); 18083612b495STsutomu Itoh } 18093fd0a558SYan, Zheng 18103fd0a558SYan, Zheng if (!err) { 18113fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 18123a45bb20SJeff Mahoney btrfs_end_transaction(trans); 18132ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 181463f018beSNikolay Borisov num_bytes, NULL); 18153fd0a558SYan, Zheng goto again; 18163fd0a558SYan, Zheng } 18173fd0a558SYan, Zheng } 18183fd0a558SYan, Zheng 18193fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 18203fd0a558SYan, Zheng 18213fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 18223fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 18233fd0a558SYan, Zheng struct btrfs_root, root_list); 18243fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 18253fd0a558SYan, Zheng 1826a820feb5SDavid Sterba root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, 1827a820feb5SDavid Sterba false); 18283fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 18293fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 18303fd0a558SYan, Zheng 18313fd0a558SYan, Zheng /* 18323fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 18333fd0a558SYan, Zheng * knows it should resumes merging 18343fd0a558SYan, Zheng */ 18353fd0a558SYan, Zheng if (!err) 18363fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 18373fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 18383fd0a558SYan, Zheng 18393fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 184000246528SJosef Bacik btrfs_put_root(root); 18413fd0a558SYan, Zheng } 18423fd0a558SYan, Zheng 18433fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 18443fd0a558SYan, Zheng 18453fd0a558SYan, Zheng if (!err) 18463a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 18473fd0a558SYan, Zheng else 18483a45bb20SJeff Mahoney btrfs_end_transaction(trans); 18493fd0a558SYan, Zheng return err; 18503fd0a558SYan, Zheng } 18513fd0a558SYan, Zheng 18523fd0a558SYan, Zheng static noinline_for_stack 1853aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 1854aca1bba6SLiu Bo { 1855a7571232SNikolay Borisov struct btrfs_root *reloc_root, *tmp; 1856aca1bba6SLiu Bo 1857a7571232SNikolay Borisov list_for_each_entry_safe(reloc_root, tmp, list, root_list) 1858bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 1859aca1bba6SLiu Bo } 1860aca1bba6SLiu Bo 1861aca1bba6SLiu Bo static noinline_for_stack 186294404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 18633fd0a558SYan, Zheng { 18640b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 18655d4f98a2SYan Zheng struct btrfs_root *root; 18665d4f98a2SYan Zheng struct btrfs_root *reloc_root; 18673fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 18683fd0a558SYan, Zheng int found = 0; 1869aca1bba6SLiu Bo int ret = 0; 18703fd0a558SYan, Zheng again: 18713fd0a558SYan, Zheng root = rc->extent_root; 18727585717fSChris Mason 18737585717fSChris Mason /* 18747585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 18757585717fSChris Mason * we have to make sure nobody is in the middle of 18767585717fSChris Mason * adding their roots to the list while we are 18777585717fSChris Mason * doing this splice 18787585717fSChris Mason */ 18790b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 18803fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 18810b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 18825d4f98a2SYan Zheng 18833fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 18843fd0a558SYan, Zheng found = 1; 18853fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 18863fd0a558SYan, Zheng struct btrfs_root, root_list); 18875d4f98a2SYan Zheng 1888a820feb5SDavid Sterba root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, 1889a820feb5SDavid Sterba false); 18905d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 18915d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 18925d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 18933fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 189400246528SJosef Bacik btrfs_put_root(root); 1895b37b39cdSJosef Bacik if (ret) { 189625e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 189725e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 189825e293c2SWang Shilong &reloc_roots); 1899aca1bba6SLiu Bo goto out; 1900b37b39cdSJosef Bacik } 19013fd0a558SYan, Zheng } else { 190251415b6cSQu Wenruo if (!IS_ERR(root)) { 190351415b6cSQu Wenruo if (root->reloc_root == reloc_root) { 190451415b6cSQu Wenruo root->reloc_root = NULL; 190551415b6cSQu Wenruo btrfs_put_root(reloc_root); 190651415b6cSQu Wenruo } 19071dae7e0eSQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, 19081dae7e0eSQu Wenruo &root->state); 190951415b6cSQu Wenruo btrfs_put_root(root); 191051415b6cSQu Wenruo } 191151415b6cSQu Wenruo 19123fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 191330d40577SQu Wenruo /* Don't forget to queue this reloc root for cleanup */ 191430d40577SQu Wenruo list_add_tail(&reloc_root->reloc_dirty_list, 191530d40577SQu Wenruo &rc->dirty_subvol_roots); 19163fd0a558SYan, Zheng } 19175d4f98a2SYan Zheng } 19185d4f98a2SYan Zheng 19193fd0a558SYan, Zheng if (found) { 19203fd0a558SYan, Zheng found = 0; 19213fd0a558SYan, Zheng goto again; 19225d4f98a2SYan Zheng } 1923aca1bba6SLiu Bo out: 1924aca1bba6SLiu Bo if (ret) { 19250b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 1926aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 1927467bb1d2SWang Shilong 1928467bb1d2SWang Shilong /* new reloc root may be added */ 19290b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 1930467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 19310b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 1932467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 1933aca1bba6SLiu Bo } 1934aca1bba6SLiu Bo 19357b7b7431SJosef Bacik /* 19367b7b7431SJosef Bacik * We used to have 19377b7b7431SJosef Bacik * 19387b7b7431SJosef Bacik * BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 19397b7b7431SJosef Bacik * 19407b7b7431SJosef Bacik * here, but it's wrong. If we fail to start the transaction in 19417b7b7431SJosef Bacik * prepare_to_merge() we will have only 0 ref reloc roots, none of which 19427b7b7431SJosef Bacik * have actually been removed from the reloc_root_tree rb tree. This is 19437b7b7431SJosef Bacik * fine because we're bailing here, and we hold a reference on the root 19447b7b7431SJosef Bacik * for the list that holds it, so these roots will be cleaned up when we 19457b7b7431SJosef Bacik * do the reloc_dirty_list afterwards. Meanwhile the root->reloc_root 19467b7b7431SJosef Bacik * will be cleaned up on unmount. 19477b7b7431SJosef Bacik * 19487b7b7431SJosef Bacik * The remaining nodes will be cleaned up by free_reloc_control. 19497b7b7431SJosef Bacik */ 19505d4f98a2SYan Zheng } 19515d4f98a2SYan Zheng 19525d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 19535d4f98a2SYan Zheng { 19545d4f98a2SYan Zheng struct tree_block *block; 19555d4f98a2SYan Zheng struct rb_node *rb_node; 19565d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 19575d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 19585d4f98a2SYan Zheng rb_erase(rb_node, blocks); 19595d4f98a2SYan Zheng kfree(block); 19605d4f98a2SYan Zheng } 19615d4f98a2SYan Zheng } 19625d4f98a2SYan Zheng 19635d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 19645d4f98a2SYan Zheng struct btrfs_root *reloc_root) 19655d4f98a2SYan Zheng { 19660b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 19675d4f98a2SYan Zheng struct btrfs_root *root; 1968442b1ac5SJosef Bacik int ret; 19695d4f98a2SYan Zheng 19705d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 19715d4f98a2SYan Zheng return 0; 19725d4f98a2SYan Zheng 1973a820feb5SDavid Sterba root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, false); 1974*404bccbcSJosef Bacik 1975*404bccbcSJosef Bacik /* 1976*404bccbcSJosef Bacik * This should succeed, since we can't have a reloc root without having 1977*404bccbcSJosef Bacik * already looked up the actual root and created the reloc root for this 1978*404bccbcSJosef Bacik * root. 1979*404bccbcSJosef Bacik * 1980*404bccbcSJosef Bacik * However if there's some sort of corruption where we have a ref to a 1981*404bccbcSJosef Bacik * reloc root without a corresponding root this could return ENOENT. 1982*404bccbcSJosef Bacik */ 1983*404bccbcSJosef Bacik if (IS_ERR(root)) { 1984*404bccbcSJosef Bacik ASSERT(0); 1985*404bccbcSJosef Bacik return PTR_ERR(root); 1986*404bccbcSJosef Bacik } 1987*404bccbcSJosef Bacik if (root->reloc_root != reloc_root) { 1988*404bccbcSJosef Bacik ASSERT(0); 1989*404bccbcSJosef Bacik btrfs_err(fs_info, 1990*404bccbcSJosef Bacik "root %llu has two reloc roots associated with it", 1991*404bccbcSJosef Bacik reloc_root->root_key.offset); 1992*404bccbcSJosef Bacik btrfs_put_root(root); 1993*404bccbcSJosef Bacik return -EUCLEAN; 1994*404bccbcSJosef Bacik } 1995442b1ac5SJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 199600246528SJosef Bacik btrfs_put_root(root); 19975d4f98a2SYan Zheng 1998442b1ac5SJosef Bacik return ret; 19995d4f98a2SYan Zheng } 20005d4f98a2SYan Zheng 20013fd0a558SYan, Zheng static noinline_for_stack 20023fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 20033fd0a558SYan, Zheng struct reloc_control *rc, 2004a26195a5SQu Wenruo struct btrfs_backref_node *node, 2005a26195a5SQu Wenruo struct btrfs_backref_edge *edges[]) 20065d4f98a2SYan Zheng { 2007a26195a5SQu Wenruo struct btrfs_backref_node *next; 20085d4f98a2SYan Zheng struct btrfs_root *root; 20093fd0a558SYan, Zheng int index = 0; 201092de551bSJosef Bacik int ret; 20113fd0a558SYan, Zheng 20125d4f98a2SYan Zheng next = node; 20135d4f98a2SYan Zheng while (1) { 20145d4f98a2SYan Zheng cond_resched(); 20155d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 20165d4f98a2SYan Zheng root = next->root; 20178ee66afeSJosef Bacik 20188ee66afeSJosef Bacik /* 20198ee66afeSJosef Bacik * If there is no root, then our references for this block are 20208ee66afeSJosef Bacik * incomplete, as we should be able to walk all the way up to a 20218ee66afeSJosef Bacik * block that is owned by a root. 20228ee66afeSJosef Bacik * 20238ee66afeSJosef Bacik * This path is only for SHAREABLE roots, so if we come upon a 20248ee66afeSJosef Bacik * non-SHAREABLE root then we have backrefs that resolve 20258ee66afeSJosef Bacik * improperly. 20268ee66afeSJosef Bacik * 20278ee66afeSJosef Bacik * Both of these cases indicate file system corruption, or a bug 20288ee66afeSJosef Bacik * in the backref walking code. 20298ee66afeSJosef Bacik */ 20308ee66afeSJosef Bacik if (!root) { 20318ee66afeSJosef Bacik ASSERT(0); 20328ee66afeSJosef Bacik btrfs_err(trans->fs_info, 20338ee66afeSJosef Bacik "bytenr %llu doesn't have a backref path ending in a root", 20348ee66afeSJosef Bacik node->bytenr); 20358ee66afeSJosef Bacik return ERR_PTR(-EUCLEAN); 20368ee66afeSJosef Bacik } 20378ee66afeSJosef Bacik if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) { 20388ee66afeSJosef Bacik ASSERT(0); 20398ee66afeSJosef Bacik btrfs_err(trans->fs_info, 20408ee66afeSJosef Bacik "bytenr %llu has multiple refs with one ending in a non-shareable root", 20418ee66afeSJosef Bacik node->bytenr); 20428ee66afeSJosef Bacik return ERR_PTR(-EUCLEAN); 20438ee66afeSJosef Bacik } 20445d4f98a2SYan Zheng 20455d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 204692de551bSJosef Bacik ret = record_reloc_root_in_trans(trans, root); 204792de551bSJosef Bacik if (ret) 204892de551bSJosef Bacik return ERR_PTR(ret); 20495d4f98a2SYan Zheng break; 20505d4f98a2SYan Zheng } 20515d4f98a2SYan Zheng 205292de551bSJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 205392de551bSJosef Bacik if (ret) 205492de551bSJosef Bacik return ERR_PTR(ret); 20553fd0a558SYan, Zheng root = root->reloc_root; 20563fd0a558SYan, Zheng 20573fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 20588ee66afeSJosef Bacik /* 20598ee66afeSJosef Bacik * We just created the reloc root, so we shouldn't have 20608ee66afeSJosef Bacik * ->new_bytenr set and this shouldn't be in the changed 20618ee66afeSJosef Bacik * list. If it is then we have multiple roots pointing 20628ee66afeSJosef Bacik * at the same bytenr which indicates corruption, or 20638ee66afeSJosef Bacik * we've made a mistake in the backref walking code. 20648ee66afeSJosef Bacik */ 20658ee66afeSJosef Bacik ASSERT(next->new_bytenr == 0); 20668ee66afeSJosef Bacik ASSERT(list_empty(&next->list)); 20678ee66afeSJosef Bacik if (next->new_bytenr || !list_empty(&next->list)) { 20688ee66afeSJosef Bacik btrfs_err(trans->fs_info, 20698ee66afeSJosef Bacik "bytenr %llu possibly has multiple roots pointing at the same bytenr %llu", 20708ee66afeSJosef Bacik node->bytenr, next->bytenr); 20718ee66afeSJosef Bacik return ERR_PTR(-EUCLEAN); 20728ee66afeSJosef Bacik } 20738ee66afeSJosef Bacik 20743fd0a558SYan, Zheng next->new_bytenr = root->node->start; 207500246528SJosef Bacik btrfs_put_root(next->root); 207600246528SJosef Bacik next->root = btrfs_grab_root(root); 20770b530bc5SJosef Bacik ASSERT(next->root); 20783fd0a558SYan, Zheng list_add_tail(&next->list, 20793fd0a558SYan, Zheng &rc->backref_cache.changed); 20809569cc20SQu Wenruo mark_block_processed(rc, next); 20815d4f98a2SYan Zheng break; 20825d4f98a2SYan Zheng } 20835d4f98a2SYan Zheng 20843fd0a558SYan, Zheng WARN_ON(1); 20855d4f98a2SYan Zheng root = NULL; 20865d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 20875d4f98a2SYan Zheng if (!next || next->level <= node->level) 20885d4f98a2SYan Zheng break; 20895d4f98a2SYan Zheng } 2090cbdc2ebcSJosef Bacik if (!root) { 2091cbdc2ebcSJosef Bacik /* 2092cbdc2ebcSJosef Bacik * This can happen if there's fs corruption or if there's a bug 2093cbdc2ebcSJosef Bacik * in the backref lookup code. 2094cbdc2ebcSJosef Bacik */ 2095cbdc2ebcSJosef Bacik ASSERT(0); 2096cbdc2ebcSJosef Bacik return ERR_PTR(-ENOENT); 2097cbdc2ebcSJosef Bacik } 20985d4f98a2SYan Zheng 20993fd0a558SYan, Zheng next = node; 21003fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 21013fd0a558SYan, Zheng while (1) { 21023fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 21033fd0a558SYan, Zheng if (--index < 0) 21043fd0a558SYan, Zheng break; 21053fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 21063fd0a558SYan, Zheng } 21075d4f98a2SYan Zheng return root; 21085d4f98a2SYan Zheng } 21095d4f98a2SYan Zheng 21103fd0a558SYan, Zheng /* 211192a7cc42SQu Wenruo * Select a tree root for relocation. 211292a7cc42SQu Wenruo * 211392a7cc42SQu Wenruo * Return NULL if the block is not shareable. We should use do_relocation() in 211492a7cc42SQu Wenruo * this case. 211592a7cc42SQu Wenruo * 211692a7cc42SQu Wenruo * Return a tree root pointer if the block is shareable. 211792a7cc42SQu Wenruo * Return -ENOENT if the block is root of reloc tree. 21183fd0a558SYan, Zheng */ 21195d4f98a2SYan Zheng static noinline_for_stack 2120a26195a5SQu Wenruo struct btrfs_root *select_one_root(struct btrfs_backref_node *node) 21215d4f98a2SYan Zheng { 2122a26195a5SQu Wenruo struct btrfs_backref_node *next; 21233fd0a558SYan, Zheng struct btrfs_root *root; 21243fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 2125a26195a5SQu Wenruo struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 21263fd0a558SYan, Zheng int index = 0; 21273fd0a558SYan, Zheng 21283fd0a558SYan, Zheng next = node; 21293fd0a558SYan, Zheng while (1) { 21303fd0a558SYan, Zheng cond_resched(); 21313fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 21323fd0a558SYan, Zheng root = next->root; 21333fd0a558SYan, Zheng BUG_ON(!root); 21343fd0a558SYan, Zheng 213592a7cc42SQu Wenruo /* No other choice for non-shareable tree */ 213692a7cc42SQu Wenruo if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) 21373fd0a558SYan, Zheng return root; 21383fd0a558SYan, Zheng 21393fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 21403fd0a558SYan, Zheng fs_root = root; 21413fd0a558SYan, Zheng 21423fd0a558SYan, Zheng if (next != node) 21433fd0a558SYan, Zheng return NULL; 21443fd0a558SYan, Zheng 21453fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 21463fd0a558SYan, Zheng if (!next || next->level <= node->level) 21473fd0a558SYan, Zheng break; 21483fd0a558SYan, Zheng } 21493fd0a558SYan, Zheng 21503fd0a558SYan, Zheng if (!fs_root) 21513fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 21523fd0a558SYan, Zheng return fs_root; 21535d4f98a2SYan Zheng } 21545d4f98a2SYan Zheng 21555d4f98a2SYan Zheng static noinline_for_stack 21563fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 2157a26195a5SQu Wenruo struct btrfs_backref_node *node, int reserve) 21585d4f98a2SYan Zheng { 21590b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 2160a26195a5SQu Wenruo struct btrfs_backref_node *next = node; 2161a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 2162a26195a5SQu Wenruo struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 21633fd0a558SYan, Zheng u64 num_bytes = 0; 21643fd0a558SYan, Zheng int index = 0; 21655d4f98a2SYan Zheng 21663fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 21673fd0a558SYan, Zheng 21683fd0a558SYan, Zheng while (next) { 21693fd0a558SYan, Zheng cond_resched(); 21705d4f98a2SYan Zheng while (1) { 21713fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 21725d4f98a2SYan Zheng break; 21735d4f98a2SYan Zheng 21740b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 21753fd0a558SYan, Zheng 21763fd0a558SYan, Zheng if (list_empty(&next->upper)) 21773fd0a558SYan, Zheng break; 21783fd0a558SYan, Zheng 21793fd0a558SYan, Zheng edge = list_entry(next->upper.next, 2180a26195a5SQu Wenruo struct btrfs_backref_edge, list[LOWER]); 21813fd0a558SYan, Zheng edges[index++] = edge; 21823fd0a558SYan, Zheng next = edge->node[UPPER]; 21835d4f98a2SYan Zheng } 21843fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 21853fd0a558SYan, Zheng } 21863fd0a558SYan, Zheng return num_bytes; 21873fd0a558SYan, Zheng } 21883fd0a558SYan, Zheng 21893fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 21903fd0a558SYan, Zheng struct reloc_control *rc, 2191a26195a5SQu Wenruo struct btrfs_backref_node *node) 21923fd0a558SYan, Zheng { 21933fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2194da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 21953fd0a558SYan, Zheng u64 num_bytes; 21963fd0a558SYan, Zheng int ret; 21970647bf56SWang Shilong u64 tmp; 21983fd0a558SYan, Zheng 21993fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 22003fd0a558SYan, Zheng 22013fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 22020647bf56SWang Shilong rc->reserved_bytes += num_bytes; 22038ca17f0fSJosef Bacik 22048ca17f0fSJosef Bacik /* 22058ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 22068ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 22078ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 22088ca17f0fSJosef Bacik */ 22090647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 22108ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 22113fd0a558SYan, Zheng if (ret) { 2212da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 22130647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 22140647bf56SWang Shilong tmp <<= 1; 22150647bf56SWang Shilong /* 22160647bf56SWang Shilong * only one thread can access block_rsv at this point, 22170647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 22180647bf56SWang Shilong * we expand more reservation size here to allow enough 221952042d8eSAndrea Gelmini * space for relocation and we will return earlier in 22200647bf56SWang Shilong * enospc case. 22210647bf56SWang Shilong */ 2222da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 22230647bf56SWang Shilong RELOCATION_RESERVED_NODES; 22248ca17f0fSJosef Bacik return -EAGAIN; 22253fd0a558SYan, Zheng } 22263fd0a558SYan, Zheng 22273fd0a558SYan, Zheng return 0; 22283fd0a558SYan, Zheng } 22293fd0a558SYan, Zheng 22305d4f98a2SYan Zheng /* 22315d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 22325d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 22335d4f98a2SYan Zheng * 22345d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 22355d4f98a2SYan Zheng * in that case this function just updates pointers. 22365d4f98a2SYan Zheng */ 22375d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 22383fd0a558SYan, Zheng struct reloc_control *rc, 2239a26195a5SQu Wenruo struct btrfs_backref_node *node, 22405d4f98a2SYan Zheng struct btrfs_key *key, 22415d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 22425d4f98a2SYan Zheng { 2243a26195a5SQu Wenruo struct btrfs_backref_node *upper; 2244a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 2245a26195a5SQu Wenruo struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 22465d4f98a2SYan Zheng struct btrfs_root *root; 22475d4f98a2SYan Zheng struct extent_buffer *eb; 22485d4f98a2SYan Zheng u32 blocksize; 22495d4f98a2SYan Zheng u64 bytenr; 22505d4f98a2SYan Zheng int slot; 22518df01fddSNikolay Borisov int ret = 0; 22525d4f98a2SYan Zheng 2253ffe30dd8SJosef Bacik /* 2254ffe30dd8SJosef Bacik * If we are lowest then this is the first time we're processing this 2255ffe30dd8SJosef Bacik * block, and thus shouldn't have an eb associated with it yet. 2256ffe30dd8SJosef Bacik */ 2257ffe30dd8SJosef Bacik ASSERT(!lowest || !node->eb); 22585d4f98a2SYan Zheng 22595d4f98a2SYan Zheng path->lowest_level = node->level + 1; 22603fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 22615d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 226282fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 2263581c1760SQu Wenruo 22645d4f98a2SYan Zheng cond_resched(); 22655d4f98a2SYan Zheng 22665d4f98a2SYan Zheng upper = edge->node[UPPER]; 2267dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 2268cbdc2ebcSJosef Bacik if (IS_ERR(root)) { 2269cbdc2ebcSJosef Bacik ret = PTR_ERR(root); 2270cbdc2ebcSJosef Bacik goto next; 2271cbdc2ebcSJosef Bacik } 22725d4f98a2SYan Zheng 22733fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 22743fd0a558SYan, Zheng if (!lowest) { 2275e3b83361SQu Wenruo ret = btrfs_bin_search(upper->eb, key, &slot); 22768df01fddSNikolay Borisov if (ret < 0) 2277cbca7d59SFilipe Manana goto next; 22783fd0a558SYan, Zheng BUG_ON(ret); 22793fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 22803fd0a558SYan, Zheng if (node->eb->start == bytenr) 22813fd0a558SYan, Zheng goto next; 22823fd0a558SYan, Zheng } 2283b0fe7078SQu Wenruo btrfs_backref_drop_node_buffer(upper); 22843fd0a558SYan, Zheng } 22855d4f98a2SYan Zheng 22865d4f98a2SYan Zheng if (!upper->eb) { 22875d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 22883561b9dbSLiu Bo if (ret) { 22898df01fddSNikolay Borisov if (ret > 0) 22908df01fddSNikolay Borisov ret = -ENOENT; 22913561b9dbSLiu Bo 22923561b9dbSLiu Bo btrfs_release_path(path); 22935d4f98a2SYan Zheng break; 22945d4f98a2SYan Zheng } 22955d4f98a2SYan Zheng 22963fd0a558SYan, Zheng if (!upper->eb) { 22973fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 22983fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 22993fd0a558SYan, Zheng } else { 23003fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 23013fd0a558SYan, Zheng } 23023fd0a558SYan, Zheng 23033fd0a558SYan, Zheng upper->locked = 1; 23043fd0a558SYan, Zheng path->locks[upper->level] = 0; 23053fd0a558SYan, Zheng 23065d4f98a2SYan Zheng slot = path->slots[upper->level]; 2307b3b4aa74SDavid Sterba btrfs_release_path(path); 23085d4f98a2SYan Zheng } else { 2309e3b83361SQu Wenruo ret = btrfs_bin_search(upper->eb, key, &slot); 23108df01fddSNikolay Borisov if (ret < 0) 2311cbca7d59SFilipe Manana goto next; 23125d4f98a2SYan Zheng BUG_ON(ret); 23135d4f98a2SYan Zheng } 23145d4f98a2SYan Zheng 23155d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 23163fd0a558SYan, Zheng if (lowest) { 23174547f4d8SLiu Bo if (bytenr != node->bytenr) { 23184547f4d8SLiu Bo btrfs_err(root->fs_info, 23194547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 23204547f4d8SLiu Bo bytenr, node->bytenr, slot, 23214547f4d8SLiu Bo upper->eb->start); 23228df01fddSNikolay Borisov ret = -EIO; 23234547f4d8SLiu Bo goto next; 23244547f4d8SLiu Bo } 23255d4f98a2SYan Zheng } else { 23263fd0a558SYan, Zheng if (node->eb->start == bytenr) 23273fd0a558SYan, Zheng goto next; 23285d4f98a2SYan Zheng } 23295d4f98a2SYan Zheng 2330da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 2331c9752536SJosef Bacik eb = btrfs_read_node_slot(upper->eb, slot); 233264c043deSLiu Bo if (IS_ERR(eb)) { 23338df01fddSNikolay Borisov ret = PTR_ERR(eb); 233464c043deSLiu Bo goto next; 233597d9a8a4STsutomu Itoh } 23365d4f98a2SYan Zheng btrfs_tree_lock(eb); 23375d4f98a2SYan Zheng 23385d4f98a2SYan Zheng if (!node->eb) { 23395d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 23409631e4ccSJosef Bacik slot, &eb, BTRFS_NESTING_COW); 23413fd0a558SYan, Zheng btrfs_tree_unlock(eb); 23423fd0a558SYan, Zheng free_extent_buffer(eb); 23438df01fddSNikolay Borisov if (ret < 0) 23443fd0a558SYan, Zheng goto next; 2345ffe30dd8SJosef Bacik /* 2346ffe30dd8SJosef Bacik * We've just COWed this block, it should have updated 2347ffe30dd8SJosef Bacik * the correct backref node entry. 2348ffe30dd8SJosef Bacik */ 2349ffe30dd8SJosef Bacik ASSERT(node->eb == eb); 23505d4f98a2SYan Zheng } else { 23515d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 23525d4f98a2SYan Zheng node->eb->start); 23535d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 23545d4f98a2SYan Zheng trans->transid); 23555d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 23565d4f98a2SYan Zheng 235782fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, 23585d4f98a2SYan Zheng node->eb->start, blocksize, 235982fa113fSQu Wenruo upper->eb->start); 236082fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 236182fa113fSQu Wenruo btrfs_init_tree_ref(&ref, node->level, 236282fa113fSQu Wenruo btrfs_header_owner(upper->eb)); 236382fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 23645d4f98a2SYan Zheng BUG_ON(ret); 23655d4f98a2SYan Zheng 23665d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 23675d4f98a2SYan Zheng BUG_ON(ret); 23685d4f98a2SYan Zheng } 23693fd0a558SYan, Zheng next: 23703fd0a558SYan, Zheng if (!upper->pending) 2371b0fe7078SQu Wenruo btrfs_backref_drop_node_buffer(upper); 23723fd0a558SYan, Zheng else 2373b0fe7078SQu Wenruo btrfs_backref_unlock_node_buffer(upper); 23748df01fddSNikolay Borisov if (ret) 23753fd0a558SYan, Zheng break; 23765d4f98a2SYan Zheng } 23773fd0a558SYan, Zheng 23788df01fddSNikolay Borisov if (!ret && node->pending) { 2379b0fe7078SQu Wenruo btrfs_backref_drop_node_buffer(node); 23803fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 23813fd0a558SYan, Zheng node->pending = 0; 23825d4f98a2SYan Zheng } 23833fd0a558SYan, Zheng 23845d4f98a2SYan Zheng path->lowest_level = 0; 2385ffe30dd8SJosef Bacik 2386ffe30dd8SJosef Bacik /* 2387ffe30dd8SJosef Bacik * We should have allocated all of our space in the block rsv and thus 2388ffe30dd8SJosef Bacik * shouldn't ENOSPC. 2389ffe30dd8SJosef Bacik */ 2390ffe30dd8SJosef Bacik ASSERT(ret != -ENOSPC); 23918df01fddSNikolay Borisov return ret; 23925d4f98a2SYan Zheng } 23935d4f98a2SYan Zheng 23945d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 23953fd0a558SYan, Zheng struct reloc_control *rc, 2396a26195a5SQu Wenruo struct btrfs_backref_node *node, 23975d4f98a2SYan Zheng struct btrfs_path *path) 23985d4f98a2SYan Zheng { 23995d4f98a2SYan Zheng struct btrfs_key key; 24005d4f98a2SYan Zheng 24015d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 24023fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 24035d4f98a2SYan Zheng } 24045d4f98a2SYan Zheng 24055d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 24063fd0a558SYan, Zheng struct reloc_control *rc, 24073fd0a558SYan, Zheng struct btrfs_path *path, int err) 24085d4f98a2SYan Zheng { 24093fd0a558SYan, Zheng LIST_HEAD(list); 2410a26195a5SQu Wenruo struct btrfs_backref_cache *cache = &rc->backref_cache; 2411a26195a5SQu Wenruo struct btrfs_backref_node *node; 24125d4f98a2SYan Zheng int level; 24135d4f98a2SYan Zheng int ret; 24145d4f98a2SYan Zheng 24155d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 24165d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 24175d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 2418a26195a5SQu Wenruo struct btrfs_backref_node, list); 24193fd0a558SYan, Zheng list_move_tail(&node->list, &list); 24203fd0a558SYan, Zheng BUG_ON(!node->pending); 24215d4f98a2SYan Zheng 24223fd0a558SYan, Zheng if (!err) { 24233fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 24245d4f98a2SYan Zheng if (ret < 0) 24255d4f98a2SYan Zheng err = ret; 24265d4f98a2SYan Zheng } 24275d4f98a2SYan Zheng } 24283fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 24293fd0a558SYan, Zheng } 24305d4f98a2SYan Zheng return err; 24315d4f98a2SYan Zheng } 24325d4f98a2SYan Zheng 24335d4f98a2SYan Zheng /* 24345d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 24355d4f98a2SYan Zheng * as processed. 24365d4f98a2SYan Zheng */ 24375d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 2438a26195a5SQu Wenruo struct btrfs_backref_node *node) 24395d4f98a2SYan Zheng { 2440a26195a5SQu Wenruo struct btrfs_backref_node *next = node; 2441a26195a5SQu Wenruo struct btrfs_backref_edge *edge; 2442a26195a5SQu Wenruo struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 24435d4f98a2SYan Zheng int index = 0; 24445d4f98a2SYan Zheng 24455d4f98a2SYan Zheng while (next) { 24465d4f98a2SYan Zheng cond_resched(); 24475d4f98a2SYan Zheng while (1) { 24485d4f98a2SYan Zheng if (next->processed) 24495d4f98a2SYan Zheng break; 24505d4f98a2SYan Zheng 24519569cc20SQu Wenruo mark_block_processed(rc, next); 24525d4f98a2SYan Zheng 24535d4f98a2SYan Zheng if (list_empty(&next->upper)) 24545d4f98a2SYan Zheng break; 24555d4f98a2SYan Zheng 24565d4f98a2SYan Zheng edge = list_entry(next->upper.next, 2457a26195a5SQu Wenruo struct btrfs_backref_edge, list[LOWER]); 24585d4f98a2SYan Zheng edges[index++] = edge; 24595d4f98a2SYan Zheng next = edge->node[UPPER]; 24605d4f98a2SYan Zheng } 24615d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 24625d4f98a2SYan Zheng } 24635d4f98a2SYan Zheng } 24645d4f98a2SYan Zheng 24657476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 24665d4f98a2SYan Zheng { 2467da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 24687476dfdaSDavid Sterba 24695d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 24709655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 24715d4f98a2SYan Zheng return 1; 24725d4f98a2SYan Zheng return 0; 24735d4f98a2SYan Zheng } 24745d4f98a2SYan Zheng 24752ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 24765d4f98a2SYan Zheng struct tree_block *block) 24775d4f98a2SYan Zheng { 24785d4f98a2SYan Zheng struct extent_buffer *eb; 24795d4f98a2SYan Zheng 2480f7ba2d37SJosef Bacik eb = read_tree_block(fs_info, block->bytenr, block->owner, 2481f7ba2d37SJosef Bacik block->key.offset, block->level, NULL); 248264c043deSLiu Bo if (IS_ERR(eb)) { 248364c043deSLiu Bo return PTR_ERR(eb); 248464c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2485416bc658SJosef Bacik free_extent_buffer(eb); 2486416bc658SJosef Bacik return -EIO; 2487416bc658SJosef Bacik } 24885d4f98a2SYan Zheng if (block->level == 0) 24895d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 24905d4f98a2SYan Zheng else 24915d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 24925d4f98a2SYan Zheng free_extent_buffer(eb); 24935d4f98a2SYan Zheng block->key_ready = 1; 24945d4f98a2SYan Zheng return 0; 24955d4f98a2SYan Zheng } 24965d4f98a2SYan Zheng 24975d4f98a2SYan Zheng /* 24985d4f98a2SYan Zheng * helper function to relocate a tree block 24995d4f98a2SYan Zheng */ 25005d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 25015d4f98a2SYan Zheng struct reloc_control *rc, 2502a26195a5SQu Wenruo struct btrfs_backref_node *node, 25035d4f98a2SYan Zheng struct btrfs_key *key, 25045d4f98a2SYan Zheng struct btrfs_path *path) 25055d4f98a2SYan Zheng { 25065d4f98a2SYan Zheng struct btrfs_root *root; 25073fd0a558SYan, Zheng int ret = 0; 25085d4f98a2SYan Zheng 25093fd0a558SYan, Zheng if (!node) 25105d4f98a2SYan Zheng return 0; 25113fd0a558SYan, Zheng 25125f6b2e5cSJosef Bacik /* 25135f6b2e5cSJosef Bacik * If we fail here we want to drop our backref_node because we are going 25145f6b2e5cSJosef Bacik * to start over and regenerate the tree for it. 25155f6b2e5cSJosef Bacik */ 25165f6b2e5cSJosef Bacik ret = reserve_metadata_space(trans, rc, node); 25175f6b2e5cSJosef Bacik if (ret) 25185f6b2e5cSJosef Bacik goto out; 25195f6b2e5cSJosef Bacik 25203fd0a558SYan, Zheng BUG_ON(node->processed); 2521147d256eSZhaolei root = select_one_root(node); 25223fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 25233fd0a558SYan, Zheng update_processed_blocks(rc, node); 25243fd0a558SYan, Zheng goto out; 25255d4f98a2SYan Zheng } 25265d4f98a2SYan Zheng 25273fd0a558SYan, Zheng if (root) { 252892a7cc42SQu Wenruo if (test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) { 25291c7bfa15SJosef Bacik /* 25301c7bfa15SJosef Bacik * This block was the root block of a root, and this is 25311c7bfa15SJosef Bacik * the first time we're processing the block and thus it 25321c7bfa15SJosef Bacik * should not have had the ->new_bytenr modified and 25331c7bfa15SJosef Bacik * should have not been included on the changed list. 25341c7bfa15SJosef Bacik * 25351c7bfa15SJosef Bacik * However in the case of corruption we could have 25361c7bfa15SJosef Bacik * multiple refs pointing to the same block improperly, 25371c7bfa15SJosef Bacik * and thus we would trip over these checks. ASSERT() 25381c7bfa15SJosef Bacik * for the developer case, because it could indicate a 25391c7bfa15SJosef Bacik * bug in the backref code, however error out for a 25401c7bfa15SJosef Bacik * normal user in the case of corruption. 25411c7bfa15SJosef Bacik */ 25421c7bfa15SJosef Bacik ASSERT(node->new_bytenr == 0); 25431c7bfa15SJosef Bacik ASSERT(list_empty(&node->list)); 25441c7bfa15SJosef Bacik if (node->new_bytenr || !list_empty(&node->list)) { 25451c7bfa15SJosef Bacik btrfs_err(root->fs_info, 25461c7bfa15SJosef Bacik "bytenr %llu has improper references to it", 25471c7bfa15SJosef Bacik node->bytenr); 25481c7bfa15SJosef Bacik ret = -EUCLEAN; 25491c7bfa15SJosef Bacik goto out; 25501c7bfa15SJosef Bacik } 25513fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 25523fd0a558SYan, Zheng root = root->reloc_root; 25533fd0a558SYan, Zheng node->new_bytenr = root->node->start; 255400246528SJosef Bacik btrfs_put_root(node->root); 255500246528SJosef Bacik node->root = btrfs_grab_root(root); 25560b530bc5SJosef Bacik ASSERT(node->root); 25573fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 25583fd0a558SYan, Zheng } else { 25595d4f98a2SYan Zheng path->lowest_level = node->level; 25605d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 2561b3b4aa74SDavid Sterba btrfs_release_path(path); 25623fd0a558SYan, Zheng if (ret > 0) 25635d4f98a2SYan Zheng ret = 0; 25643fd0a558SYan, Zheng } 25653fd0a558SYan, Zheng if (!ret) 25663fd0a558SYan, Zheng update_processed_blocks(rc, node); 25673fd0a558SYan, Zheng } else { 25683fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 25693fd0a558SYan, Zheng } 25705d4f98a2SYan Zheng out: 25710647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 2572023acb07SQu Wenruo btrfs_backref_cleanup_node(&rc->backref_cache, node); 25735d4f98a2SYan Zheng return ret; 25745d4f98a2SYan Zheng } 25755d4f98a2SYan Zheng 25765d4f98a2SYan Zheng /* 25775d4f98a2SYan Zheng * relocate a list of blocks 25785d4f98a2SYan Zheng */ 25795d4f98a2SYan Zheng static noinline_for_stack 25805d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 25815d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 25825d4f98a2SYan Zheng { 25832ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 2584a26195a5SQu Wenruo struct btrfs_backref_node *node; 25855d4f98a2SYan Zheng struct btrfs_path *path; 25865d4f98a2SYan Zheng struct tree_block *block; 258798ff7b94SQu Wenruo struct tree_block *next; 25885d4f98a2SYan Zheng int ret; 25895d4f98a2SYan Zheng int err = 0; 25905d4f98a2SYan Zheng 25915d4f98a2SYan Zheng path = btrfs_alloc_path(); 2592e1a12670SLiu Bo if (!path) { 2593e1a12670SLiu Bo err = -ENOMEM; 259434c2b290SDavid Sterba goto out_free_blocks; 2595e1a12670SLiu Bo } 25965d4f98a2SYan Zheng 259798ff7b94SQu Wenruo /* Kick in readahead for tree blocks with missing keys */ 259898ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 25995d4f98a2SYan Zheng if (!block->key_ready) 2600f7ba2d37SJosef Bacik btrfs_readahead_tree_block(fs_info, block->bytenr, 2601f7ba2d37SJosef Bacik block->owner, 0, 26023fbaf258SJosef Bacik block->level); 26035d4f98a2SYan Zheng } 26045d4f98a2SYan Zheng 260598ff7b94SQu Wenruo /* Get first keys */ 260698ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 260734c2b290SDavid Sterba if (!block->key_ready) { 26082ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 260934c2b290SDavid Sterba if (err) 261034c2b290SDavid Sterba goto out_free_path; 261134c2b290SDavid Sterba } 26125d4f98a2SYan Zheng } 26135d4f98a2SYan Zheng 261498ff7b94SQu Wenruo /* Do tree relocation */ 261598ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 26163fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 26175d4f98a2SYan Zheng block->level, block->bytenr); 26185d4f98a2SYan Zheng if (IS_ERR(node)) { 26195d4f98a2SYan Zheng err = PTR_ERR(node); 26205d4f98a2SYan Zheng goto out; 26215d4f98a2SYan Zheng } 26225d4f98a2SYan Zheng 26235d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 26245d4f98a2SYan Zheng path); 26255d4f98a2SYan Zheng if (ret < 0) { 26265d4f98a2SYan Zheng err = ret; 262750dbbb71SJosef Bacik break; 26285d4f98a2SYan Zheng } 26295d4f98a2SYan Zheng } 26305d4f98a2SYan Zheng out: 26313fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 26325d4f98a2SYan Zheng 263334c2b290SDavid Sterba out_free_path: 26345d4f98a2SYan Zheng btrfs_free_path(path); 263534c2b290SDavid Sterba out_free_blocks: 2636e1a12670SLiu Bo free_block_list(blocks); 26375d4f98a2SYan Zheng return err; 26385d4f98a2SYan Zheng } 26395d4f98a2SYan Zheng 2640056d9becSNikolay Borisov static noinline_for_stack int prealloc_file_extent_cluster( 2641056d9becSNikolay Borisov struct btrfs_inode *inode, 2642efa56464SYan, Zheng struct file_extent_cluster *cluster) 2643efa56464SYan, Zheng { 2644efa56464SYan, Zheng u64 alloc_hint = 0; 2645efa56464SYan, Zheng u64 start; 2646efa56464SYan, Zheng u64 end; 2647056d9becSNikolay Borisov u64 offset = inode->index_cnt; 2648efa56464SYan, Zheng u64 num_bytes; 26494e9d0d01SNikolay Borisov int nr; 2650efa56464SYan, Zheng int ret = 0; 2651dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 2652dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 2653214e61d0SNikolay Borisov u64 cur_offset = prealloc_start; 2654efa56464SYan, Zheng 2655efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 2656056d9becSNikolay Borisov ret = btrfs_alloc_data_chunk_ondemand(inode, 2657dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 2658efa56464SYan, Zheng if (ret) 2659214e61d0SNikolay Borisov return ret; 2660efa56464SYan, Zheng 266132430c61SNaohiro Aota /* 266232430c61SNaohiro Aota * On a zoned filesystem, we cannot preallocate the file region. 266332430c61SNaohiro Aota * Instead, we dirty and fiemap_write the region. 266432430c61SNaohiro Aota */ 266532430c61SNaohiro Aota if (btrfs_is_zoned(inode->root->fs_info)) { 266632430c61SNaohiro Aota struct btrfs_root *root = inode->root; 266732430c61SNaohiro Aota struct btrfs_trans_handle *trans; 266832430c61SNaohiro Aota 266932430c61SNaohiro Aota end = cluster->end - offset + 1; 267032430c61SNaohiro Aota trans = btrfs_start_transaction(root, 1); 267132430c61SNaohiro Aota if (IS_ERR(trans)) 267232430c61SNaohiro Aota return PTR_ERR(trans); 267332430c61SNaohiro Aota 267432430c61SNaohiro Aota inode->vfs_inode.i_ctime = current_time(&inode->vfs_inode); 267532430c61SNaohiro Aota i_size_write(&inode->vfs_inode, end); 267632430c61SNaohiro Aota ret = btrfs_update_inode(trans, root, inode); 267732430c61SNaohiro Aota if (ret) { 267832430c61SNaohiro Aota btrfs_abort_transaction(trans, ret); 267932430c61SNaohiro Aota btrfs_end_transaction(trans); 268032430c61SNaohiro Aota return ret; 268132430c61SNaohiro Aota } 268232430c61SNaohiro Aota 268332430c61SNaohiro Aota return btrfs_end_transaction(trans); 268432430c61SNaohiro Aota } 268532430c61SNaohiro Aota 268664708539SJosef Bacik btrfs_inode_lock(&inode->vfs_inode, 0); 26874e9d0d01SNikolay Borisov for (nr = 0; nr < cluster->nr; nr++) { 2688efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 2689efa56464SYan, Zheng if (nr + 1 < cluster->nr) 2690efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 2691efa56464SYan, Zheng else 2692efa56464SYan, Zheng end = cluster->end - offset; 2693efa56464SYan, Zheng 2694056d9becSNikolay Borisov lock_extent(&inode->io_tree, start, end); 2695efa56464SYan, Zheng num_bytes = end + 1 - start; 2696056d9becSNikolay Borisov ret = btrfs_prealloc_file_range(&inode->vfs_inode, 0, start, 2697efa56464SYan, Zheng num_bytes, num_bytes, 2698efa56464SYan, Zheng end + 1, &alloc_hint); 269918513091SWang Xiaoguang cur_offset = end + 1; 2700056d9becSNikolay Borisov unlock_extent(&inode->io_tree, start, end); 2701efa56464SYan, Zheng if (ret) 2702efa56464SYan, Zheng break; 2703efa56464SYan, Zheng } 270464708539SJosef Bacik btrfs_inode_unlock(&inode->vfs_inode, 0); 2705214e61d0SNikolay Borisov 270618513091SWang Xiaoguang if (cur_offset < prealloc_end) 2707056d9becSNikolay Borisov btrfs_free_reserved_data_space_noquota(inode->root->fs_info, 2708a89ef455SFilipe Manana prealloc_end + 1 - cur_offset); 2709efa56464SYan, Zheng return ret; 2710efa56464SYan, Zheng } 2711efa56464SYan, Zheng 2712efa56464SYan, Zheng static noinline_for_stack 27130257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 27140257bb82SYan, Zheng u64 block_start) 27155d4f98a2SYan Zheng { 27165d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 27175d4f98a2SYan Zheng struct extent_map *em; 27180257bb82SYan, Zheng int ret = 0; 27195d4f98a2SYan Zheng 2720172ddd60SDavid Sterba em = alloc_extent_map(); 27210257bb82SYan, Zheng if (!em) 27220257bb82SYan, Zheng return -ENOMEM; 27230257bb82SYan, Zheng 27245d4f98a2SYan Zheng em->start = start; 27250257bb82SYan, Zheng em->len = end + 1 - start; 27260257bb82SYan, Zheng em->block_len = em->len; 27270257bb82SYan, Zheng em->block_start = block_start; 27285d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 27295d4f98a2SYan Zheng 2730d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 27315d4f98a2SYan Zheng while (1) { 2732890871beSChris Mason write_lock(&em_tree->lock); 273309a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 2734890871beSChris Mason write_unlock(&em_tree->lock); 27355d4f98a2SYan Zheng if (ret != -EEXIST) { 27365d4f98a2SYan Zheng free_extent_map(em); 27375d4f98a2SYan Zheng break; 27385d4f98a2SYan Zheng } 2739dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 27405d4f98a2SYan Zheng } 2741d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 27420257bb82SYan, Zheng return ret; 27430257bb82SYan, Zheng } 27445d4f98a2SYan Zheng 2745726a3421SQu Wenruo /* 2746726a3421SQu Wenruo * Allow error injection to test balance cancellation 2747726a3421SQu Wenruo */ 27481fec12a5SJosef Bacik noinline int btrfs_should_cancel_balance(struct btrfs_fs_info *fs_info) 2749726a3421SQu Wenruo { 27505cb502f4SQu Wenruo return atomic_read(&fs_info->balance_cancel_req) || 27515cb502f4SQu Wenruo fatal_signal_pending(current); 2752726a3421SQu Wenruo } 2753726a3421SQu Wenruo ALLOW_ERROR_INJECTION(btrfs_should_cancel_balance, TRUE); 2754726a3421SQu Wenruo 27550257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 27560257bb82SYan, Zheng struct file_extent_cluster *cluster) 27570257bb82SYan, Zheng { 27582ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 27590257bb82SYan, Zheng u64 page_start; 27600257bb82SYan, Zheng u64 page_end; 27610257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 27620257bb82SYan, Zheng unsigned long index; 27630257bb82SYan, Zheng unsigned long last_index; 27640257bb82SYan, Zheng struct page *page; 27650257bb82SYan, Zheng struct file_ra_state *ra; 27663b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 27670257bb82SYan, Zheng int nr = 0; 27680257bb82SYan, Zheng int ret = 0; 27690257bb82SYan, Zheng 27700257bb82SYan, Zheng if (!cluster->nr) 27710257bb82SYan, Zheng return 0; 27720257bb82SYan, Zheng 27730257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 27740257bb82SYan, Zheng if (!ra) 27750257bb82SYan, Zheng return -ENOMEM; 27760257bb82SYan, Zheng 2777056d9becSNikolay Borisov ret = prealloc_file_extent_cluster(BTRFS_I(inode), cluster); 27780257bb82SYan, Zheng if (ret) 2779efa56464SYan, Zheng goto out; 27800257bb82SYan, Zheng 27810257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 27820257bb82SYan, Zheng 2783efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 2784efa56464SYan, Zheng cluster->end - offset, cluster->start); 2785efa56464SYan, Zheng if (ret) 2786efa56464SYan, Zheng goto out; 2787efa56464SYan, Zheng 278809cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 278909cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 27900257bb82SYan, Zheng while (index <= last_index) { 27919f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 27929f3db423SNikolay Borisov PAGE_SIZE); 2793efa56464SYan, Zheng if (ret) 2794efa56464SYan, Zheng goto out; 2795efa56464SYan, Zheng 27960257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 27970257bb82SYan, Zheng if (!page) { 27980257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 27990257bb82SYan, Zheng ra, NULL, index, 28000257bb82SYan, Zheng last_index + 1 - index); 2801a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 28023b16a4e3SJosef Bacik mask); 28030257bb82SYan, Zheng if (!page) { 2804691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 280543b18595SQu Wenruo PAGE_SIZE, true); 280644db1216SFilipe Manana btrfs_delalloc_release_extents(BTRFS_I(inode), 28078702ba93SQu Wenruo PAGE_SIZE); 28080257bb82SYan, Zheng ret = -ENOMEM; 2809efa56464SYan, Zheng goto out; 28100257bb82SYan, Zheng } 28110257bb82SYan, Zheng } 281232443de3SQu Wenruo ret = set_page_extent_mapped(page); 281332443de3SQu Wenruo if (ret < 0) { 281432443de3SQu Wenruo btrfs_delalloc_release_metadata(BTRFS_I(inode), 281532443de3SQu Wenruo PAGE_SIZE, true); 281632443de3SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); 281732443de3SQu Wenruo unlock_page(page); 281832443de3SQu Wenruo put_page(page); 281932443de3SQu Wenruo goto out; 282032443de3SQu Wenruo } 28210257bb82SYan, Zheng 28220257bb82SYan, Zheng if (PageReadahead(page)) { 28230257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 28240257bb82SYan, Zheng ra, NULL, page, index, 28250257bb82SYan, Zheng last_index + 1 - index); 28260257bb82SYan, Zheng } 28270257bb82SYan, Zheng 28280257bb82SYan, Zheng if (!PageUptodate(page)) { 28290257bb82SYan, Zheng btrfs_readpage(NULL, page); 28300257bb82SYan, Zheng lock_page(page); 28310257bb82SYan, Zheng if (!PageUptodate(page)) { 28320257bb82SYan, Zheng unlock_page(page); 283309cbfeafSKirill A. Shutemov put_page(page); 2834691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 283543b18595SQu Wenruo PAGE_SIZE, true); 28368b62f87bSJosef Bacik btrfs_delalloc_release_extents(BTRFS_I(inode), 28378702ba93SQu Wenruo PAGE_SIZE); 28380257bb82SYan, Zheng ret = -EIO; 2839efa56464SYan, Zheng goto out; 28400257bb82SYan, Zheng } 28410257bb82SYan, Zheng } 28420257bb82SYan, Zheng 28434eee4fa4SMiao Xie page_start = page_offset(page); 284409cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 28450257bb82SYan, Zheng 2846d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 28470257bb82SYan, Zheng 28480257bb82SYan, Zheng if (nr < cluster->nr && 28490257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 28500257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 28510257bb82SYan, Zheng page_start, page_end, 2852ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 28530257bb82SYan, Zheng nr++; 28540257bb82SYan, Zheng } 28550257bb82SYan, Zheng 2856c2566f22SNikolay Borisov ret = btrfs_set_extent_delalloc(BTRFS_I(inode), page_start, 2857c2566f22SNikolay Borisov page_end, 0, NULL); 2858765f3cebSNikolay Borisov if (ret) { 2859765f3cebSNikolay Borisov unlock_page(page); 2860765f3cebSNikolay Borisov put_page(page); 2861765f3cebSNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 286243b18595SQu Wenruo PAGE_SIZE, true); 2863765f3cebSNikolay Borisov btrfs_delalloc_release_extents(BTRFS_I(inode), 28648702ba93SQu Wenruo PAGE_SIZE); 2865765f3cebSNikolay Borisov 2866765f3cebSNikolay Borisov clear_extent_bits(&BTRFS_I(inode)->io_tree, 2867765f3cebSNikolay Borisov page_start, page_end, 2868765f3cebSNikolay Borisov EXTENT_LOCKED | EXTENT_BOUNDARY); 2869765f3cebSNikolay Borisov goto out; 2870765f3cebSNikolay Borisov 2871765f3cebSNikolay Borisov } 28720257bb82SYan, Zheng set_page_dirty(page); 28730257bb82SYan, Zheng 28740257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 2875d0082371SJeff Mahoney page_start, page_end); 28760257bb82SYan, Zheng unlock_page(page); 287709cbfeafSKirill A. Shutemov put_page(page); 28780257bb82SYan, Zheng 28790257bb82SYan, Zheng index++; 28808702ba93SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); 2881efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 28822ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 28837f913c7cSQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 28847f913c7cSQu Wenruo ret = -ECANCELED; 28857f913c7cSQu Wenruo goto out; 28867f913c7cSQu Wenruo } 28870257bb82SYan, Zheng } 28880257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 288932430c61SNaohiro Aota if (btrfs_is_zoned(fs_info) && !ret) 289032430c61SNaohiro Aota ret = btrfs_wait_ordered_range(inode, 0, (u64)-1); 2891efa56464SYan, Zheng out: 28920257bb82SYan, Zheng kfree(ra); 28930257bb82SYan, Zheng return ret; 28940257bb82SYan, Zheng } 28950257bb82SYan, Zheng 28960257bb82SYan, Zheng static noinline_for_stack 28970257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 28980257bb82SYan, Zheng struct file_extent_cluster *cluster) 28990257bb82SYan, Zheng { 29000257bb82SYan, Zheng int ret; 29010257bb82SYan, Zheng 29020257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 29030257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 29040257bb82SYan, Zheng if (ret) 29050257bb82SYan, Zheng return ret; 29060257bb82SYan, Zheng cluster->nr = 0; 29070257bb82SYan, Zheng } 29080257bb82SYan, Zheng 29090257bb82SYan, Zheng if (!cluster->nr) 29100257bb82SYan, Zheng cluster->start = extent_key->objectid; 29110257bb82SYan, Zheng else 29120257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 29130257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 29140257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 29150257bb82SYan, Zheng cluster->nr++; 29160257bb82SYan, Zheng 29170257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 29180257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 29190257bb82SYan, Zheng if (ret) 29200257bb82SYan, Zheng return ret; 29210257bb82SYan, Zheng cluster->nr = 0; 29220257bb82SYan, Zheng } 29230257bb82SYan, Zheng return 0; 29245d4f98a2SYan Zheng } 29255d4f98a2SYan Zheng 29265d4f98a2SYan Zheng /* 29275d4f98a2SYan Zheng * helper to add a tree block to the list. 29285d4f98a2SYan Zheng * the major work is getting the generation and level of the block 29295d4f98a2SYan Zheng */ 29305d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 29315d4f98a2SYan Zheng struct btrfs_key *extent_key, 29325d4f98a2SYan Zheng struct btrfs_path *path, 29335d4f98a2SYan Zheng struct rb_root *blocks) 29345d4f98a2SYan Zheng { 29355d4f98a2SYan Zheng struct extent_buffer *eb; 29365d4f98a2SYan Zheng struct btrfs_extent_item *ei; 29375d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 29385d4f98a2SYan Zheng struct tree_block *block; 29395d4f98a2SYan Zheng struct rb_node *rb_node; 29405d4f98a2SYan Zheng u32 item_size; 29415d4f98a2SYan Zheng int level = -1; 29427fdf4b60SWang Shilong u64 generation; 2943f7ba2d37SJosef Bacik u64 owner = 0; 29445d4f98a2SYan Zheng 29455d4f98a2SYan Zheng eb = path->nodes[0]; 29465d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 29475d4f98a2SYan Zheng 29483173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 29493173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 2950f7ba2d37SJosef Bacik unsigned long ptr = 0, end; 2951f7ba2d37SJosef Bacik 29525d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 29535d4f98a2SYan Zheng struct btrfs_extent_item); 2954f7ba2d37SJosef Bacik end = (unsigned long)ei + item_size; 29553173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 29565d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 29575d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 2958f7ba2d37SJosef Bacik ptr = (unsigned long)(bi + 1); 29595d4f98a2SYan Zheng } else { 29603173a18fSJosef Bacik level = (int)extent_key->offset; 2961f7ba2d37SJosef Bacik ptr = (unsigned long)(ei + 1); 29623173a18fSJosef Bacik } 29633173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 2964f7ba2d37SJosef Bacik 2965f7ba2d37SJosef Bacik /* 2966f7ba2d37SJosef Bacik * We're reading random blocks without knowing their owner ahead 2967f7ba2d37SJosef Bacik * of time. This is ok most of the time, as all reloc roots and 2968f7ba2d37SJosef Bacik * fs roots have the same lock type. However normal trees do 2969f7ba2d37SJosef Bacik * not, and the only way to know ahead of time is to read the 2970f7ba2d37SJosef Bacik * inline ref offset. We know it's an fs root if 2971f7ba2d37SJosef Bacik * 2972f7ba2d37SJosef Bacik * 1. There's more than one ref. 2973f7ba2d37SJosef Bacik * 2. There's a SHARED_DATA_REF_KEY set. 2974f7ba2d37SJosef Bacik * 3. FULL_BACKREF is set on the flags. 2975f7ba2d37SJosef Bacik * 2976f7ba2d37SJosef Bacik * Otherwise it's safe to assume that the ref offset == the 2977f7ba2d37SJosef Bacik * owner of this block, so we can use that when calling 2978f7ba2d37SJosef Bacik * read_tree_block. 2979f7ba2d37SJosef Bacik */ 2980f7ba2d37SJosef Bacik if (btrfs_extent_refs(eb, ei) == 1 && 2981f7ba2d37SJosef Bacik !(btrfs_extent_flags(eb, ei) & 2982f7ba2d37SJosef Bacik BTRFS_BLOCK_FLAG_FULL_BACKREF) && 2983f7ba2d37SJosef Bacik ptr < end) { 2984f7ba2d37SJosef Bacik struct btrfs_extent_inline_ref *iref; 2985f7ba2d37SJosef Bacik int type; 2986f7ba2d37SJosef Bacik 2987f7ba2d37SJosef Bacik iref = (struct btrfs_extent_inline_ref *)ptr; 2988f7ba2d37SJosef Bacik type = btrfs_get_extent_inline_ref_type(eb, iref, 2989f7ba2d37SJosef Bacik BTRFS_REF_TYPE_BLOCK); 2990f7ba2d37SJosef Bacik if (type == BTRFS_REF_TYPE_INVALID) 2991f7ba2d37SJosef Bacik return -EINVAL; 2992f7ba2d37SJosef Bacik if (type == BTRFS_TREE_BLOCK_REF_KEY) 2993f7ba2d37SJosef Bacik owner = btrfs_extent_inline_ref_offset(eb, iref); 2994f7ba2d37SJosef Bacik } 29956d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 2996ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 2997ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 2998ba3c2b19SNikolay Borisov return -EINVAL; 29993173a18fSJosef Bacik } else { 30005d4f98a2SYan Zheng BUG(); 30015d4f98a2SYan Zheng } 30025d4f98a2SYan Zheng 3003b3b4aa74SDavid Sterba btrfs_release_path(path); 30045d4f98a2SYan Zheng 30055d4f98a2SYan Zheng BUG_ON(level == -1); 30065d4f98a2SYan Zheng 30075d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 30085d4f98a2SYan Zheng if (!block) 30095d4f98a2SYan Zheng return -ENOMEM; 30105d4f98a2SYan Zheng 30115d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3012da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 30135d4f98a2SYan Zheng block->key.offset = generation; 30145d4f98a2SYan Zheng block->level = level; 30155d4f98a2SYan Zheng block->key_ready = 0; 3016f7ba2d37SJosef Bacik block->owner = owner; 30175d4f98a2SYan Zheng 3018e9a28dc5SQu Wenruo rb_node = rb_simple_insert(blocks, block->bytenr, &block->rb_node); 301943c04fb1SJeff Mahoney if (rb_node) 3020982c92cbSQu Wenruo btrfs_backref_panic(rc->extent_root->fs_info, block->bytenr, 3021982c92cbSQu Wenruo -EEXIST); 30225d4f98a2SYan Zheng 30235d4f98a2SYan Zheng return 0; 30245d4f98a2SYan Zheng } 30255d4f98a2SYan Zheng 30265d4f98a2SYan Zheng /* 30275d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 30285d4f98a2SYan Zheng */ 30295d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 30305d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 30315d4f98a2SYan Zheng struct rb_root *blocks) 30325d4f98a2SYan Zheng { 30330b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 30345d4f98a2SYan Zheng struct btrfs_path *path; 30355d4f98a2SYan Zheng struct btrfs_key key; 30365d4f98a2SYan Zheng int ret; 30370b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 30385d4f98a2SYan Zheng 30397476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 30405d4f98a2SYan Zheng return 0; 30415d4f98a2SYan Zheng 3042e9a28dc5SQu Wenruo if (rb_simple_search(blocks, bytenr)) 30435d4f98a2SYan Zheng return 0; 30445d4f98a2SYan Zheng 30455d4f98a2SYan Zheng path = btrfs_alloc_path(); 30465d4f98a2SYan Zheng if (!path) 30475d4f98a2SYan Zheng return -ENOMEM; 3048aee68ee5SJosef Bacik again: 30495d4f98a2SYan Zheng key.objectid = bytenr; 3050aee68ee5SJosef Bacik if (skinny) { 3051aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3052aee68ee5SJosef Bacik key.offset = (u64)-1; 3053aee68ee5SJosef Bacik } else { 30545d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 30555d4f98a2SYan Zheng key.offset = blocksize; 3056aee68ee5SJosef Bacik } 30575d4f98a2SYan Zheng 30585d4f98a2SYan Zheng path->search_commit_root = 1; 30595d4f98a2SYan Zheng path->skip_locking = 1; 30605d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 30615d4f98a2SYan Zheng if (ret < 0) 30625d4f98a2SYan Zheng goto out; 30635d4f98a2SYan Zheng 3064aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3065aee68ee5SJosef Bacik if (path->slots[0]) { 3066aee68ee5SJosef Bacik path->slots[0]--; 3067aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3068aee68ee5SJosef Bacik path->slots[0]); 30693173a18fSJosef Bacik if (key.objectid == bytenr && 3070aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3071aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3072aee68ee5SJosef Bacik key.offset == blocksize))) 30733173a18fSJosef Bacik ret = 0; 30743173a18fSJosef Bacik } 3075aee68ee5SJosef Bacik 3076aee68ee5SJosef Bacik if (ret) { 3077aee68ee5SJosef Bacik skinny = false; 3078aee68ee5SJosef Bacik btrfs_release_path(path); 3079aee68ee5SJosef Bacik goto again; 3080aee68ee5SJosef Bacik } 3081aee68ee5SJosef Bacik } 3082cdccee99SLiu Bo if (ret) { 3083cdccee99SLiu Bo ASSERT(ret == 1); 3084cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3085cdccee99SLiu Bo btrfs_err(fs_info, 3086cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3087cdccee99SLiu Bo bytenr); 3088cdccee99SLiu Bo WARN_ON(1); 3089cdccee99SLiu Bo ret = -EINVAL; 3090cdccee99SLiu Bo goto out; 3091cdccee99SLiu Bo } 30923173a18fSJosef Bacik 30935d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 30945d4f98a2SYan Zheng out: 30955d4f98a2SYan Zheng btrfs_free_path(path); 30965d4f98a2SYan Zheng return ret; 30975d4f98a2SYan Zheng } 30985d4f98a2SYan Zheng 30990af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 310032da5386SDavid Sterba struct btrfs_block_group *block_group, 31011bbc621eSChris Mason struct inode *inode, 31021bbc621eSChris Mason u64 ino) 31030af3d00bSJosef Bacik { 31040af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 31050af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 31060af3d00bSJosef Bacik int ret = 0; 31070af3d00bSJosef Bacik 31080af3d00bSJosef Bacik if (inode) 31090af3d00bSJosef Bacik goto truncate; 31100af3d00bSJosef Bacik 31110202e83fSDavid Sterba inode = btrfs_iget(fs_info->sb, ino, root); 31122e19f1f9SAl Viro if (IS_ERR(inode)) 31130af3d00bSJosef Bacik return -ENOENT; 31140af3d00bSJosef Bacik 31150af3d00bSJosef Bacik truncate: 31162ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 31177b61cd92SMiao Xie &fs_info->global_block_rsv); 31187b61cd92SMiao Xie if (ret) 31197b61cd92SMiao Xie goto out; 31207b61cd92SMiao Xie 31217a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 31220af3d00bSJosef Bacik if (IS_ERR(trans)) { 31233612b495STsutomu Itoh ret = PTR_ERR(trans); 31240af3d00bSJosef Bacik goto out; 31250af3d00bSJosef Bacik } 31260af3d00bSJosef Bacik 312777ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 31280af3d00bSJosef Bacik 31293a45bb20SJeff Mahoney btrfs_end_transaction(trans); 31302ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 31310af3d00bSJosef Bacik out: 31320af3d00bSJosef Bacik iput(inode); 31330af3d00bSJosef Bacik return ret; 31340af3d00bSJosef Bacik } 31350af3d00bSJosef Bacik 31365d4f98a2SYan Zheng /* 313719b546d7SQu Wenruo * Locate the free space cache EXTENT_DATA in root tree leaf and delete the 313819b546d7SQu Wenruo * cache inode, to avoid free space cache data extent blocking data relocation. 31395d4f98a2SYan Zheng */ 314019b546d7SQu Wenruo static int delete_v1_space_cache(struct extent_buffer *leaf, 314119b546d7SQu Wenruo struct btrfs_block_group *block_group, 314219b546d7SQu Wenruo u64 data_bytenr) 31435d4f98a2SYan Zheng { 314419b546d7SQu Wenruo u64 space_cache_ino; 314519b546d7SQu Wenruo struct btrfs_file_extent_item *ei; 31465d4f98a2SYan Zheng struct btrfs_key key; 314719b546d7SQu Wenruo bool found = false; 314819b546d7SQu Wenruo int i; 31495d4f98a2SYan Zheng int ret; 31505d4f98a2SYan Zheng 315119b546d7SQu Wenruo if (btrfs_header_owner(leaf) != BTRFS_ROOT_TREE_OBJECTID) 315219b546d7SQu Wenruo return 0; 31535d4f98a2SYan Zheng 315419b546d7SQu Wenruo for (i = 0; i < btrfs_header_nritems(leaf); i++) { 315550e31ef4SQu Wenruo u8 type; 315650e31ef4SQu Wenruo 315719b546d7SQu Wenruo btrfs_item_key_to_cpu(leaf, &key, i); 315819b546d7SQu Wenruo if (key.type != BTRFS_EXTENT_DATA_KEY) 315919b546d7SQu Wenruo continue; 316019b546d7SQu Wenruo ei = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 316150e31ef4SQu Wenruo type = btrfs_file_extent_type(leaf, ei); 316250e31ef4SQu Wenruo 316350e31ef4SQu Wenruo if ((type == BTRFS_FILE_EXTENT_REG || 316450e31ef4SQu Wenruo type == BTRFS_FILE_EXTENT_PREALLOC) && 316519b546d7SQu Wenruo btrfs_file_extent_disk_bytenr(leaf, ei) == data_bytenr) { 316619b546d7SQu Wenruo found = true; 316719b546d7SQu Wenruo space_cache_ino = key.objectid; 316819b546d7SQu Wenruo break; 316919b546d7SQu Wenruo } 317019b546d7SQu Wenruo } 317119b546d7SQu Wenruo if (!found) 317219b546d7SQu Wenruo return -ENOENT; 317319b546d7SQu Wenruo ret = delete_block_group_cache(leaf->fs_info, block_group, NULL, 317419b546d7SQu Wenruo space_cache_ino); 31750af3d00bSJosef Bacik return ret; 31765d4f98a2SYan Zheng } 31775d4f98a2SYan Zheng 31785d4f98a2SYan Zheng /* 31792c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 31805d4f98a2SYan Zheng */ 31815d4f98a2SYan Zheng static noinline_for_stack 31825d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 31835d4f98a2SYan Zheng struct btrfs_key *extent_key, 31845d4f98a2SYan Zheng struct btrfs_path *path, 31855d4f98a2SYan Zheng struct rb_root *blocks) 31865d4f98a2SYan Zheng { 318719b546d7SQu Wenruo struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 318819b546d7SQu Wenruo struct ulist *leaves = NULL; 318919b546d7SQu Wenruo struct ulist_iterator leaf_uiter; 319019b546d7SQu Wenruo struct ulist_node *ref_node = NULL; 319119b546d7SQu Wenruo const u32 blocksize = fs_info->nodesize; 3192647f63bdSFilipe David Borba Manana int ret = 0; 31935d4f98a2SYan Zheng 3194b3b4aa74SDavid Sterba btrfs_release_path(path); 319519b546d7SQu Wenruo ret = btrfs_find_all_leafs(NULL, fs_info, extent_key->objectid, 319619b546d7SQu Wenruo 0, &leaves, NULL, true); 319719b546d7SQu Wenruo if (ret < 0) 319819b546d7SQu Wenruo return ret; 319919b546d7SQu Wenruo 320019b546d7SQu Wenruo ULIST_ITER_INIT(&leaf_uiter); 320119b546d7SQu Wenruo while ((ref_node = ulist_next(leaves, &leaf_uiter))) { 320219b546d7SQu Wenruo struct extent_buffer *eb; 320319b546d7SQu Wenruo 32041b7ec85eSJosef Bacik eb = read_tree_block(fs_info, ref_node->val, 0, 0, 0, NULL); 320519b546d7SQu Wenruo if (IS_ERR(eb)) { 320619b546d7SQu Wenruo ret = PTR_ERR(eb); 320719b546d7SQu Wenruo break; 320819b546d7SQu Wenruo } 320919b546d7SQu Wenruo ret = delete_v1_space_cache(eb, rc->block_group, 321019b546d7SQu Wenruo extent_key->objectid); 321119b546d7SQu Wenruo free_extent_buffer(eb); 321219b546d7SQu Wenruo if (ret < 0) 321319b546d7SQu Wenruo break; 321419b546d7SQu Wenruo ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); 321519b546d7SQu Wenruo if (ret < 0) 321619b546d7SQu Wenruo break; 321719b546d7SQu Wenruo } 321819b546d7SQu Wenruo if (ret < 0) 32195d4f98a2SYan Zheng free_block_list(blocks); 322019b546d7SQu Wenruo ulist_free(leaves); 322119b546d7SQu Wenruo return ret; 32225d4f98a2SYan Zheng } 32235d4f98a2SYan Zheng 32245d4f98a2SYan Zheng /* 32252c016dc2SLiu Bo * helper to find next unprocessed extent 32265d4f98a2SYan Zheng */ 32275d4f98a2SYan Zheng static noinline_for_stack 3228147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 32293fd0a558SYan, Zheng struct btrfs_key *extent_key) 32305d4f98a2SYan Zheng { 32310b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 32325d4f98a2SYan Zheng struct btrfs_key key; 32335d4f98a2SYan Zheng struct extent_buffer *leaf; 32345d4f98a2SYan Zheng u64 start, end, last; 32355d4f98a2SYan Zheng int ret; 32365d4f98a2SYan Zheng 3237b3470b5dSDavid Sterba last = rc->block_group->start + rc->block_group->length; 32385d4f98a2SYan Zheng while (1) { 32395d4f98a2SYan Zheng cond_resched(); 32405d4f98a2SYan Zheng if (rc->search_start >= last) { 32415d4f98a2SYan Zheng ret = 1; 32425d4f98a2SYan Zheng break; 32435d4f98a2SYan Zheng } 32445d4f98a2SYan Zheng 32455d4f98a2SYan Zheng key.objectid = rc->search_start; 32465d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 32475d4f98a2SYan Zheng key.offset = 0; 32485d4f98a2SYan Zheng 32495d4f98a2SYan Zheng path->search_commit_root = 1; 32505d4f98a2SYan Zheng path->skip_locking = 1; 32515d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 32525d4f98a2SYan Zheng 0, 0); 32535d4f98a2SYan Zheng if (ret < 0) 32545d4f98a2SYan Zheng break; 32555d4f98a2SYan Zheng next: 32565d4f98a2SYan Zheng leaf = path->nodes[0]; 32575d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 32585d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 32595d4f98a2SYan Zheng if (ret != 0) 32605d4f98a2SYan Zheng break; 32615d4f98a2SYan Zheng leaf = path->nodes[0]; 32625d4f98a2SYan Zheng } 32635d4f98a2SYan Zheng 32645d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 32655d4f98a2SYan Zheng if (key.objectid >= last) { 32665d4f98a2SYan Zheng ret = 1; 32675d4f98a2SYan Zheng break; 32685d4f98a2SYan Zheng } 32695d4f98a2SYan Zheng 32703173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 32713173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 32723173a18fSJosef Bacik path->slots[0]++; 32733173a18fSJosef Bacik goto next; 32743173a18fSJosef Bacik } 32753173a18fSJosef Bacik 32763173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 32775d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 32785d4f98a2SYan Zheng path->slots[0]++; 32795d4f98a2SYan Zheng goto next; 32805d4f98a2SYan Zheng } 32815d4f98a2SYan Zheng 32823173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 32830b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 32843173a18fSJosef Bacik rc->search_start) { 32853173a18fSJosef Bacik path->slots[0]++; 32863173a18fSJosef Bacik goto next; 32873173a18fSJosef Bacik } 32883173a18fSJosef Bacik 32895d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 32905d4f98a2SYan Zheng key.objectid, &start, &end, 3291e6138876SJosef Bacik EXTENT_DIRTY, NULL); 32925d4f98a2SYan Zheng 32935d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3294b3b4aa74SDavid Sterba btrfs_release_path(path); 32955d4f98a2SYan Zheng rc->search_start = end + 1; 32965d4f98a2SYan Zheng } else { 32973173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 32985d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 32993173a18fSJosef Bacik else 33003173a18fSJosef Bacik rc->search_start = key.objectid + 33010b246afaSJeff Mahoney fs_info->nodesize; 33023fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 33035d4f98a2SYan Zheng return 0; 33045d4f98a2SYan Zheng } 33055d4f98a2SYan Zheng } 3306b3b4aa74SDavid Sterba btrfs_release_path(path); 33075d4f98a2SYan Zheng return ret; 33085d4f98a2SYan Zheng } 33095d4f98a2SYan Zheng 33105d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 33115d4f98a2SYan Zheng { 33125d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 33137585717fSChris Mason 33147585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 33155d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 33167585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 33175d4f98a2SYan Zheng } 33185d4f98a2SYan Zheng 33195d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 33205d4f98a2SYan Zheng { 33215d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 33227585717fSChris Mason 33237585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 33245d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 33257585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 33265d4f98a2SYan Zheng } 33275d4f98a2SYan Zheng 33285d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 33295d4f98a2SYan Zheng { 33305d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 33315d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 33325d4f98a2SYan Zheng return 1; 33335d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 33345d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 33355d4f98a2SYan Zheng return 1; 33365d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 33375d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 33385d4f98a2SYan Zheng return 1; 33395d4f98a2SYan Zheng return 0; 33405d4f98a2SYan Zheng } 33415d4f98a2SYan Zheng 33423fd0a558SYan, Zheng static noinline_for_stack 33433fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 33443fd0a558SYan, Zheng { 33453fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3346ac2fabacSJosef Bacik int ret; 33473fd0a558SYan, Zheng 33482ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 334966d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 33503fd0a558SYan, Zheng if (!rc->block_rsv) 33513fd0a558SYan, Zheng return -ENOMEM; 33523fd0a558SYan, Zheng 33533fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 3354b3470b5dSDavid Sterba rc->search_start = rc->block_group->start; 33553fd0a558SYan, Zheng rc->extents_found = 0; 33563fd0a558SYan, Zheng rc->nodes_relocated = 0; 33573fd0a558SYan, Zheng rc->merging_rsv_size = 0; 33580647bf56SWang Shilong rc->reserved_bytes = 0; 3359da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 33600647bf56SWang Shilong RELOCATION_RESERVED_NODES; 3361ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 3362ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3363ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3364ac2fabacSJosef Bacik if (ret) 3365ac2fabacSJosef Bacik return ret; 33663fd0a558SYan, Zheng 33673fd0a558SYan, Zheng rc->create_reloc_tree = 1; 33683fd0a558SYan, Zheng set_reloc_control(rc); 33693fd0a558SYan, Zheng 33707a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 337128818947SLiu Bo if (IS_ERR(trans)) { 337228818947SLiu Bo unset_reloc_control(rc); 337328818947SLiu Bo /* 337428818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 337528818947SLiu Bo * cleanup. And callers are responsible to free the above 337628818947SLiu Bo * block rsv. 337728818947SLiu Bo */ 337828818947SLiu Bo return PTR_ERR(trans); 337928818947SLiu Bo } 33803a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 33813fd0a558SYan, Zheng return 0; 33823fd0a558SYan, Zheng } 338376dda93cSYan, Zheng 33845d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 33855d4f98a2SYan Zheng { 33862ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 33875d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 33885d4f98a2SYan Zheng struct btrfs_key key; 33895d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 33905d4f98a2SYan Zheng struct btrfs_path *path; 33915d4f98a2SYan Zheng struct btrfs_extent_item *ei; 33925d4f98a2SYan Zheng u64 flags; 33935d4f98a2SYan Zheng u32 item_size; 33945d4f98a2SYan Zheng int ret; 33955d4f98a2SYan Zheng int err = 0; 3396c87f08caSChris Mason int progress = 0; 33975d4f98a2SYan Zheng 33985d4f98a2SYan Zheng path = btrfs_alloc_path(); 33993fd0a558SYan, Zheng if (!path) 34005d4f98a2SYan Zheng return -ENOMEM; 3401e4058b54SDavid Sterba path->reada = READA_FORWARD; 34023fd0a558SYan, Zheng 34033fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 34043fd0a558SYan, Zheng if (ret) { 34053fd0a558SYan, Zheng err = ret; 34063fd0a558SYan, Zheng goto out_free; 34072423fdfbSJiri Slaby } 34085d4f98a2SYan Zheng 34095d4f98a2SYan Zheng while (1) { 34100647bf56SWang Shilong rc->reserved_bytes = 0; 34110647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 34120647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 34130647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 34140647bf56SWang Shilong if (ret) { 34150647bf56SWang Shilong err = ret; 34160647bf56SWang Shilong break; 34170647bf56SWang Shilong } 3418c87f08caSChris Mason progress++; 3419a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 34200f788c58SLiu Bo if (IS_ERR(trans)) { 34210f788c58SLiu Bo err = PTR_ERR(trans); 34220f788c58SLiu Bo trans = NULL; 34230f788c58SLiu Bo break; 34240f788c58SLiu Bo } 3425c87f08caSChris Mason restart: 34263fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 34273a45bb20SJeff Mahoney btrfs_end_transaction(trans); 342842a657f5SPan Bian trans = NULL; 34293fd0a558SYan, Zheng continue; 34303fd0a558SYan, Zheng } 34313fd0a558SYan, Zheng 3432147d256eSZhaolei ret = find_next_extent(rc, path, &key); 34335d4f98a2SYan Zheng if (ret < 0) 34345d4f98a2SYan Zheng err = ret; 34355d4f98a2SYan Zheng if (ret != 0) 34365d4f98a2SYan Zheng break; 34375d4f98a2SYan Zheng 34385d4f98a2SYan Zheng rc->extents_found++; 34395d4f98a2SYan Zheng 34405d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 34415d4f98a2SYan Zheng struct btrfs_extent_item); 34423fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 34435d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 34445d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 34455d4f98a2SYan Zheng ret = check_extent_flags(flags); 34465d4f98a2SYan Zheng BUG_ON(ret); 34476d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3448ba3c2b19SNikolay Borisov err = -EINVAL; 3449ba3c2b19SNikolay Borisov btrfs_print_v0_err(trans->fs_info); 3450ba3c2b19SNikolay Borisov btrfs_abort_transaction(trans, err); 3451ba3c2b19SNikolay Borisov break; 34525d4f98a2SYan Zheng } else { 34535d4f98a2SYan Zheng BUG(); 34545d4f98a2SYan Zheng } 34555d4f98a2SYan Zheng 34565d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 34575d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 34585d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 34595d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 34605d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 34615d4f98a2SYan Zheng } else { 3462b3b4aa74SDavid Sterba btrfs_release_path(path); 34635d4f98a2SYan Zheng ret = 0; 34645d4f98a2SYan Zheng } 34655d4f98a2SYan Zheng if (ret < 0) { 34663fd0a558SYan, Zheng err = ret; 34675d4f98a2SYan Zheng break; 34685d4f98a2SYan Zheng } 34695d4f98a2SYan Zheng 34705d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 34715d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 34725d4f98a2SYan Zheng if (ret < 0) { 34733fd0a558SYan, Zheng if (ret != -EAGAIN) { 34745d4f98a2SYan Zheng err = ret; 34755d4f98a2SYan Zheng break; 34765d4f98a2SYan Zheng } 34773fd0a558SYan, Zheng rc->extents_found--; 34783fd0a558SYan, Zheng rc->search_start = key.objectid; 34793fd0a558SYan, Zheng } 34805d4f98a2SYan Zheng } 34815d4f98a2SYan Zheng 34823a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 34832ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 34843fd0a558SYan, Zheng trans = NULL; 34855d4f98a2SYan Zheng 34865d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 34875d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 34885d4f98a2SYan Zheng rc->found_file_extent = 1; 34890257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 34903fd0a558SYan, Zheng &key, &rc->cluster); 34915d4f98a2SYan Zheng if (ret < 0) { 34925d4f98a2SYan Zheng err = ret; 34935d4f98a2SYan Zheng break; 34945d4f98a2SYan Zheng } 34955d4f98a2SYan Zheng } 3496f31ea088SQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 3497f31ea088SQu Wenruo err = -ECANCELED; 3498f31ea088SQu Wenruo break; 3499f31ea088SQu Wenruo } 35005d4f98a2SYan Zheng } 3501c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 350243a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 35039689457bSShilong Wang if (ret == 1) { 3504c87f08caSChris Mason err = 0; 3505c87f08caSChris Mason progress = 0; 3506c87f08caSChris Mason goto restart; 3507c87f08caSChris Mason } 3508c87f08caSChris Mason } 35093fd0a558SYan, Zheng 3510b3b4aa74SDavid Sterba btrfs_release_path(path); 351191166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 35125d4f98a2SYan Zheng 35135d4f98a2SYan Zheng if (trans) { 35143a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 35152ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 35165d4f98a2SYan Zheng } 35175d4f98a2SYan Zheng 35180257bb82SYan, Zheng if (!err) { 35193fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 35203fd0a558SYan, Zheng &rc->cluster); 35210257bb82SYan, Zheng if (ret < 0) 35220257bb82SYan, Zheng err = ret; 35230257bb82SYan, Zheng } 35240257bb82SYan, Zheng 35253fd0a558SYan, Zheng rc->create_reloc_tree = 0; 35263fd0a558SYan, Zheng set_reloc_control(rc); 35270257bb82SYan, Zheng 352813fe1bdbSQu Wenruo btrfs_backref_release_cache(&rc->backref_cache); 352963f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 35305d4f98a2SYan Zheng 35317f913c7cSQu Wenruo /* 35327f913c7cSQu Wenruo * Even in the case when the relocation is cancelled, we should all go 35337f913c7cSQu Wenruo * through prepare_to_merge() and merge_reloc_roots(). 35347f913c7cSQu Wenruo * 35357f913c7cSQu Wenruo * For error (including cancelled balance), prepare_to_merge() will 35367f913c7cSQu Wenruo * mark all reloc trees orphan, then queue them for cleanup in 35377f913c7cSQu Wenruo * merge_reloc_roots() 35387f913c7cSQu Wenruo */ 35393fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 35405d4f98a2SYan Zheng 35415d4f98a2SYan Zheng merge_reloc_roots(rc); 35425d4f98a2SYan Zheng 35433fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 35445d4f98a2SYan Zheng unset_reloc_control(rc); 354563f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 35465d4f98a2SYan Zheng 35475d4f98a2SYan Zheng /* get rid of pinned extents */ 35487a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 354962b99540SQu Wenruo if (IS_ERR(trans)) { 35503612b495STsutomu Itoh err = PTR_ERR(trans); 355162b99540SQu Wenruo goto out_free; 355262b99540SQu Wenruo } 35533a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 35546217b0faSJosef Bacik out_free: 3555d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 3556d2311e69SQu Wenruo if (ret < 0 && !err) 3557d2311e69SQu Wenruo err = ret; 35582ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 35593fd0a558SYan, Zheng btrfs_free_path(path); 35605d4f98a2SYan Zheng return err; 35615d4f98a2SYan Zheng } 35625d4f98a2SYan Zheng 35635d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 35640257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 35655d4f98a2SYan Zheng { 35665d4f98a2SYan Zheng struct btrfs_path *path; 35675d4f98a2SYan Zheng struct btrfs_inode_item *item; 35685d4f98a2SYan Zheng struct extent_buffer *leaf; 356932430c61SNaohiro Aota u64 flags = BTRFS_INODE_NOCOMPRESS | BTRFS_INODE_PREALLOC; 35705d4f98a2SYan Zheng int ret; 35715d4f98a2SYan Zheng 357232430c61SNaohiro Aota if (btrfs_is_zoned(trans->fs_info)) 357332430c61SNaohiro Aota flags &= ~BTRFS_INODE_PREALLOC; 357432430c61SNaohiro Aota 35755d4f98a2SYan Zheng path = btrfs_alloc_path(); 35765d4f98a2SYan Zheng if (!path) 35775d4f98a2SYan Zheng return -ENOMEM; 35785d4f98a2SYan Zheng 35795d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 35805d4f98a2SYan Zheng if (ret) 35815d4f98a2SYan Zheng goto out; 35825d4f98a2SYan Zheng 35835d4f98a2SYan Zheng leaf = path->nodes[0]; 35845d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 3585b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 35865d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 35870257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 35885d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 358932430c61SNaohiro Aota btrfs_set_inode_flags(leaf, item, flags); 35905d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 35915d4f98a2SYan Zheng out: 35925d4f98a2SYan Zheng btrfs_free_path(path); 35935d4f98a2SYan Zheng return ret; 35945d4f98a2SYan Zheng } 35955d4f98a2SYan Zheng 35965d4f98a2SYan Zheng /* 35975d4f98a2SYan Zheng * helper to create inode for data relocation. 35985d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 35995d4f98a2SYan Zheng */ 36003fd0a558SYan, Zheng static noinline_for_stack 36013fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 360232da5386SDavid Sterba struct btrfs_block_group *group) 36035d4f98a2SYan Zheng { 36045d4f98a2SYan Zheng struct inode *inode = NULL; 36055d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 36065d4f98a2SYan Zheng struct btrfs_root *root; 36074624900dSZhaolei u64 objectid; 36085d4f98a2SYan Zheng int err = 0; 36095d4f98a2SYan Zheng 3610aeb935a4SQu Wenruo root = btrfs_grab_root(fs_info->data_reloc_root); 3611a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 361276deacf0SJosef Bacik if (IS_ERR(trans)) { 361300246528SJosef Bacik btrfs_put_root(root); 36143fd0a558SYan, Zheng return ERR_CAST(trans); 361576deacf0SJosef Bacik } 36165d4f98a2SYan Zheng 3617543068a2SNikolay Borisov err = btrfs_get_free_objectid(root, &objectid); 36185d4f98a2SYan Zheng if (err) 36195d4f98a2SYan Zheng goto out; 36205d4f98a2SYan Zheng 36210257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 36225d4f98a2SYan Zheng BUG_ON(err); 36235d4f98a2SYan Zheng 36240202e83fSDavid Sterba inode = btrfs_iget(fs_info->sb, objectid, root); 36252e19f1f9SAl Viro BUG_ON(IS_ERR(inode)); 3626b3470b5dSDavid Sterba BTRFS_I(inode)->index_cnt = group->start; 36275d4f98a2SYan Zheng 362873f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 36295d4f98a2SYan Zheng out: 363000246528SJosef Bacik btrfs_put_root(root); 36313a45bb20SJeff Mahoney btrfs_end_transaction(trans); 36322ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 36335d4f98a2SYan Zheng if (err) { 36345d4f98a2SYan Zheng if (inode) 36355d4f98a2SYan Zheng iput(inode); 36365d4f98a2SYan Zheng inode = ERR_PTR(err); 36375d4f98a2SYan Zheng } 36385d4f98a2SYan Zheng return inode; 36395d4f98a2SYan Zheng } 36405d4f98a2SYan Zheng 3641c258d6e3SQu Wenruo static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 36423fd0a558SYan, Zheng { 36433fd0a558SYan, Zheng struct reloc_control *rc; 36443fd0a558SYan, Zheng 36453fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 36463fd0a558SYan, Zheng if (!rc) 36473fd0a558SYan, Zheng return NULL; 36483fd0a558SYan, Zheng 36493fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 3650d2311e69SQu Wenruo INIT_LIST_HEAD(&rc->dirty_subvol_roots); 3651584fb121SQu Wenruo btrfs_backref_init_cache(fs_info, &rc->backref_cache, 1); 36523fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 365343eb5f29SQu Wenruo extent_io_tree_init(fs_info, &rc->processed_blocks, 365443eb5f29SQu Wenruo IO_TREE_RELOC_BLOCKS, NULL); 36553fd0a558SYan, Zheng return rc; 36563fd0a558SYan, Zheng } 36573fd0a558SYan, Zheng 36581a0afa0eSJosef Bacik static void free_reloc_control(struct reloc_control *rc) 36591a0afa0eSJosef Bacik { 36601a0afa0eSJosef Bacik struct mapping_node *node, *tmp; 36611a0afa0eSJosef Bacik 36621a0afa0eSJosef Bacik free_reloc_roots(&rc->reloc_roots); 36631a0afa0eSJosef Bacik rbtree_postorder_for_each_entry_safe(node, tmp, 36641a0afa0eSJosef Bacik &rc->reloc_root_tree.rb_root, rb_node) 36651a0afa0eSJosef Bacik kfree(node); 36661a0afa0eSJosef Bacik 36671a0afa0eSJosef Bacik kfree(rc); 36681a0afa0eSJosef Bacik } 36691a0afa0eSJosef Bacik 36705d4f98a2SYan Zheng /* 3671ebce0e01SAdam Borowski * Print the block group being relocated 3672ebce0e01SAdam Borowski */ 3673ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 367432da5386SDavid Sterba struct btrfs_block_group *block_group) 3675ebce0e01SAdam Borowski { 3676f89e09cfSAnand Jain char buf[128] = {'\0'}; 3677ebce0e01SAdam Borowski 3678f89e09cfSAnand Jain btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); 3679ebce0e01SAdam Borowski 3680ebce0e01SAdam Borowski btrfs_info(fs_info, 3681ebce0e01SAdam Borowski "relocating block group %llu flags %s", 3682b3470b5dSDavid Sterba block_group->start, buf); 3683ebce0e01SAdam Borowski } 3684ebce0e01SAdam Borowski 3685430640e3SQu Wenruo static const char *stage_to_string(int stage) 3686430640e3SQu Wenruo { 3687430640e3SQu Wenruo if (stage == MOVE_DATA_EXTENTS) 3688430640e3SQu Wenruo return "move data extents"; 3689430640e3SQu Wenruo if (stage == UPDATE_DATA_PTRS) 3690430640e3SQu Wenruo return "update data pointers"; 3691430640e3SQu Wenruo return "unknown"; 3692430640e3SQu Wenruo } 3693430640e3SQu Wenruo 3694ebce0e01SAdam Borowski /* 36955d4f98a2SYan Zheng * function to relocate all extents in a block group. 36965d4f98a2SYan Zheng */ 36976bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 36985d4f98a2SYan Zheng { 369932da5386SDavid Sterba struct btrfs_block_group *bg; 37006bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 37015d4f98a2SYan Zheng struct reloc_control *rc; 37020af3d00bSJosef Bacik struct inode *inode; 37030af3d00bSJosef Bacik struct btrfs_path *path; 37045d4f98a2SYan Zheng int ret; 3705f0486c68SYan, Zheng int rw = 0; 37065d4f98a2SYan Zheng int err = 0; 37075d4f98a2SYan Zheng 3708eede2bf3SOmar Sandoval bg = btrfs_lookup_block_group(fs_info, group_start); 3709eede2bf3SOmar Sandoval if (!bg) 3710eede2bf3SOmar Sandoval return -ENOENT; 3711eede2bf3SOmar Sandoval 3712eede2bf3SOmar Sandoval if (btrfs_pinned_by_swapfile(fs_info, bg)) { 3713eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 3714eede2bf3SOmar Sandoval return -ETXTBSY; 3715eede2bf3SOmar Sandoval } 3716eede2bf3SOmar Sandoval 3717c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 3718eede2bf3SOmar Sandoval if (!rc) { 3719eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 37205d4f98a2SYan Zheng return -ENOMEM; 3721eede2bf3SOmar Sandoval } 37225d4f98a2SYan Zheng 3723f0486c68SYan, Zheng rc->extent_root = extent_root; 3724eede2bf3SOmar Sandoval rc->block_group = bg; 37255d4f98a2SYan Zheng 3726b12de528SQu Wenruo ret = btrfs_inc_block_group_ro(rc->block_group, true); 3727f0486c68SYan, Zheng if (ret) { 3728f0486c68SYan, Zheng err = ret; 3729f0486c68SYan, Zheng goto out; 3730f0486c68SYan, Zheng } 3731f0486c68SYan, Zheng rw = 1; 3732f0486c68SYan, Zheng 37330af3d00bSJosef Bacik path = btrfs_alloc_path(); 37340af3d00bSJosef Bacik if (!path) { 37350af3d00bSJosef Bacik err = -ENOMEM; 37360af3d00bSJosef Bacik goto out; 37370af3d00bSJosef Bacik } 37380af3d00bSJosef Bacik 37397949f339SDavid Sterba inode = lookup_free_space_inode(rc->block_group, path); 37400af3d00bSJosef Bacik btrfs_free_path(path); 37410af3d00bSJosef Bacik 37420af3d00bSJosef Bacik if (!IS_ERR(inode)) 37431bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 37440af3d00bSJosef Bacik else 37450af3d00bSJosef Bacik ret = PTR_ERR(inode); 37460af3d00bSJosef Bacik 37470af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 37480af3d00bSJosef Bacik err = ret; 37490af3d00bSJosef Bacik goto out; 37500af3d00bSJosef Bacik } 37510af3d00bSJosef Bacik 37525d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 37535d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 37545d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 37555d4f98a2SYan Zheng rc->data_inode = NULL; 37565d4f98a2SYan Zheng goto out; 37575d4f98a2SYan Zheng } 37585d4f98a2SYan Zheng 37590b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 37605d4f98a2SYan Zheng 37619cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 3762f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 37636374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 3764b3470b5dSDavid Sterba rc->block_group->start, 3765b3470b5dSDavid Sterba rc->block_group->length); 37665d4f98a2SYan Zheng 37675d4f98a2SYan Zheng while (1) { 3768430640e3SQu Wenruo int finishes_stage; 3769430640e3SQu Wenruo 377076dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 37715d4f98a2SYan Zheng ret = relocate_block_group(rc); 377276dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 3773ff612ba7SJosef Bacik if (ret < 0) 37745d4f98a2SYan Zheng err = ret; 3775ff612ba7SJosef Bacik 3776430640e3SQu Wenruo finishes_stage = rc->stage; 3777ff612ba7SJosef Bacik /* 3778ff612ba7SJosef Bacik * We may have gotten ENOSPC after we already dirtied some 3779ff612ba7SJosef Bacik * extents. If writeout happens while we're relocating a 3780ff612ba7SJosef Bacik * different block group we could end up hitting the 3781ff612ba7SJosef Bacik * BUG_ON(rc->stage == UPDATE_DATA_PTRS) in 3782ff612ba7SJosef Bacik * btrfs_reloc_cow_block. Make sure we write everything out 3783ff612ba7SJosef Bacik * properly so we don't trip over this problem, and then break 3784ff612ba7SJosef Bacik * out of the loop if we hit an error. 3785ff612ba7SJosef Bacik */ 3786ff612ba7SJosef Bacik if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 3787ff612ba7SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 3788ff612ba7SJosef Bacik (u64)-1); 3789ff612ba7SJosef Bacik if (ret) 3790ff612ba7SJosef Bacik err = ret; 3791ff612ba7SJosef Bacik invalidate_mapping_pages(rc->data_inode->i_mapping, 3792ff612ba7SJosef Bacik 0, -1); 3793ff612ba7SJosef Bacik rc->stage = UPDATE_DATA_PTRS; 37945d4f98a2SYan Zheng } 37955d4f98a2SYan Zheng 3796ff612ba7SJosef Bacik if (err < 0) 3797ff612ba7SJosef Bacik goto out; 3798ff612ba7SJosef Bacik 37995d4f98a2SYan Zheng if (rc->extents_found == 0) 38005d4f98a2SYan Zheng break; 38015d4f98a2SYan Zheng 3802430640e3SQu Wenruo btrfs_info(fs_info, "found %llu extents, stage: %s", 3803430640e3SQu Wenruo rc->extents_found, stage_to_string(finishes_stage)); 38045d4f98a2SYan Zheng } 38055d4f98a2SYan Zheng 38065d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 38075d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 3808bf38be65SDavid Sterba WARN_ON(rc->block_group->used > 0); 38095d4f98a2SYan Zheng out: 3810f0486c68SYan, Zheng if (err && rw) 38112ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 38125d4f98a2SYan Zheng iput(rc->data_inode); 38135d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 38141a0afa0eSJosef Bacik free_reloc_control(rc); 38155d4f98a2SYan Zheng return err; 38165d4f98a2SYan Zheng } 38175d4f98a2SYan Zheng 381876dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 381976dda93cSYan, Zheng { 38200b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 382176dda93cSYan, Zheng struct btrfs_trans_handle *trans; 382279787eaaSJeff Mahoney int ret, err; 382376dda93cSYan, Zheng 38240b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 382579787eaaSJeff Mahoney if (IS_ERR(trans)) 382679787eaaSJeff Mahoney return PTR_ERR(trans); 382776dda93cSYan, Zheng 382876dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 382976dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 3830c8422684SDavid Sterba btrfs_set_root_drop_level(&root->root_item, 0); 383176dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 38320b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 383376dda93cSYan, Zheng &root->root_key, &root->root_item); 383476dda93cSYan, Zheng 38353a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 383679787eaaSJeff Mahoney if (err) 383779787eaaSJeff Mahoney return err; 383879787eaaSJeff Mahoney return ret; 383976dda93cSYan, Zheng } 384076dda93cSYan, Zheng 38415d4f98a2SYan Zheng /* 38425d4f98a2SYan Zheng * recover relocation interrupted by system crash. 38435d4f98a2SYan Zheng * 38445d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 38455d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 38465d4f98a2SYan Zheng */ 38475d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 38485d4f98a2SYan Zheng { 38490b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 38505d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 38515d4f98a2SYan Zheng struct btrfs_key key; 38525d4f98a2SYan Zheng struct btrfs_root *fs_root; 38535d4f98a2SYan Zheng struct btrfs_root *reloc_root; 38545d4f98a2SYan Zheng struct btrfs_path *path; 38555d4f98a2SYan Zheng struct extent_buffer *leaf; 38565d4f98a2SYan Zheng struct reloc_control *rc = NULL; 38575d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 38585d4f98a2SYan Zheng int ret; 38595d4f98a2SYan Zheng int err = 0; 38605d4f98a2SYan Zheng 38615d4f98a2SYan Zheng path = btrfs_alloc_path(); 38625d4f98a2SYan Zheng if (!path) 38635d4f98a2SYan Zheng return -ENOMEM; 3864e4058b54SDavid Sterba path->reada = READA_BACK; 38655d4f98a2SYan Zheng 38665d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 38675d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 38685d4f98a2SYan Zheng key.offset = (u64)-1; 38695d4f98a2SYan Zheng 38705d4f98a2SYan Zheng while (1) { 38710b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 38725d4f98a2SYan Zheng path, 0, 0); 38735d4f98a2SYan Zheng if (ret < 0) { 38745d4f98a2SYan Zheng err = ret; 38755d4f98a2SYan Zheng goto out; 38765d4f98a2SYan Zheng } 38775d4f98a2SYan Zheng if (ret > 0) { 38785d4f98a2SYan Zheng if (path->slots[0] == 0) 38795d4f98a2SYan Zheng break; 38805d4f98a2SYan Zheng path->slots[0]--; 38815d4f98a2SYan Zheng } 38825d4f98a2SYan Zheng leaf = path->nodes[0]; 38835d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 3884b3b4aa74SDavid Sterba btrfs_release_path(path); 38855d4f98a2SYan Zheng 38865d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 38875d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 38885d4f98a2SYan Zheng break; 38895d4f98a2SYan Zheng 38903dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(root, &key); 38915d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 38925d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 38935d4f98a2SYan Zheng goto out; 38945d4f98a2SYan Zheng } 38955d4f98a2SYan Zheng 389692a7cc42SQu Wenruo set_bit(BTRFS_ROOT_SHAREABLE, &reloc_root->state); 38975d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 38985d4f98a2SYan Zheng 38995d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 3900a820feb5SDavid Sterba fs_root = btrfs_get_fs_root(fs_info, 3901a820feb5SDavid Sterba reloc_root->root_key.offset, false); 39025d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 390376dda93cSYan, Zheng ret = PTR_ERR(fs_root); 390476dda93cSYan, Zheng if (ret != -ENOENT) { 390576dda93cSYan, Zheng err = ret; 39065d4f98a2SYan Zheng goto out; 39075d4f98a2SYan Zheng } 390879787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 390979787eaaSJeff Mahoney if (ret < 0) { 391079787eaaSJeff Mahoney err = ret; 391179787eaaSJeff Mahoney goto out; 391279787eaaSJeff Mahoney } 3913932fd26dSJosef Bacik } else { 391400246528SJosef Bacik btrfs_put_root(fs_root); 391576dda93cSYan, Zheng } 39165d4f98a2SYan Zheng } 39175d4f98a2SYan Zheng 39185d4f98a2SYan Zheng if (key.offset == 0) 39195d4f98a2SYan Zheng break; 39205d4f98a2SYan Zheng 39215d4f98a2SYan Zheng key.offset--; 39225d4f98a2SYan Zheng } 3923b3b4aa74SDavid Sterba btrfs_release_path(path); 39245d4f98a2SYan Zheng 39255d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 39265d4f98a2SYan Zheng goto out; 39275d4f98a2SYan Zheng 3928c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 39295d4f98a2SYan Zheng if (!rc) { 39305d4f98a2SYan Zheng err = -ENOMEM; 39315d4f98a2SYan Zheng goto out; 39325d4f98a2SYan Zheng } 39335d4f98a2SYan Zheng 39340b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 39355d4f98a2SYan Zheng 39365d4f98a2SYan Zheng set_reloc_control(rc); 39375d4f98a2SYan Zheng 39387a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 39393612b495STsutomu Itoh if (IS_ERR(trans)) { 39403612b495STsutomu Itoh err = PTR_ERR(trans); 3941fb2d83eeSJosef Bacik goto out_unset; 39423612b495STsutomu Itoh } 39433fd0a558SYan, Zheng 39443fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 39453fd0a558SYan, Zheng 39465d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 39475d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 39485d4f98a2SYan Zheng struct btrfs_root, root_list); 39495d4f98a2SYan Zheng list_del(&reloc_root->root_list); 39505d4f98a2SYan Zheng 39515d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 39525d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 39535d4f98a2SYan Zheng &rc->reloc_roots); 39545d4f98a2SYan Zheng continue; 39555d4f98a2SYan Zheng } 39565d4f98a2SYan Zheng 3957a820feb5SDavid Sterba fs_root = btrfs_get_fs_root(fs_info, reloc_root->root_key.offset, 3958a820feb5SDavid Sterba false); 395979787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 396079787eaaSJeff Mahoney err = PTR_ERR(fs_root); 3961ca1aa281SJosef Bacik list_add_tail(&reloc_root->root_list, &reloc_roots); 39621402d17dSXiyu Yang btrfs_end_transaction(trans); 3963fb2d83eeSJosef Bacik goto out_unset; 396479787eaaSJeff Mahoney } 39655d4f98a2SYan Zheng 3966ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 396779787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 3968f44deb74SJosef Bacik fs_root->reloc_root = btrfs_grab_root(reloc_root); 396900246528SJosef Bacik btrfs_put_root(fs_root); 39705d4f98a2SYan Zheng } 39715d4f98a2SYan Zheng 39723a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 397379787eaaSJeff Mahoney if (err) 3974fb2d83eeSJosef Bacik goto out_unset; 39755d4f98a2SYan Zheng 39765d4f98a2SYan Zheng merge_reloc_roots(rc); 39775d4f98a2SYan Zheng 39785d4f98a2SYan Zheng unset_reloc_control(rc); 39795d4f98a2SYan Zheng 39807a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 398162b99540SQu Wenruo if (IS_ERR(trans)) { 39823612b495STsutomu Itoh err = PTR_ERR(trans); 39836217b0faSJosef Bacik goto out_clean; 398462b99540SQu Wenruo } 39853a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 39866217b0faSJosef Bacik out_clean: 3987d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 3988d2311e69SQu Wenruo if (ret < 0 && !err) 3989d2311e69SQu Wenruo err = ret; 3990fb2d83eeSJosef Bacik out_unset: 3991fb2d83eeSJosef Bacik unset_reloc_control(rc); 39921a0afa0eSJosef Bacik free_reloc_control(rc); 39933612b495STsutomu Itoh out: 3994aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 3995aca1bba6SLiu Bo 39965d4f98a2SYan Zheng btrfs_free_path(path); 39975d4f98a2SYan Zheng 39985d4f98a2SYan Zheng if (err == 0) { 39995d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 4000aeb935a4SQu Wenruo fs_root = btrfs_grab_root(fs_info->data_reloc_root); 4001aeb935a4SQu Wenruo ASSERT(fs_root); 400266b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 400300246528SJosef Bacik btrfs_put_root(fs_root); 4004932fd26dSJosef Bacik } 40055d4f98a2SYan Zheng return err; 40065d4f98a2SYan Zheng } 40075d4f98a2SYan Zheng 40085d4f98a2SYan Zheng /* 40095d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 40105d4f98a2SYan Zheng * 40115d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 40125d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 40135d4f98a2SYan Zheng */ 40147bfa9535SNikolay Borisov int btrfs_reloc_clone_csums(struct btrfs_inode *inode, u64 file_pos, u64 len) 40155d4f98a2SYan Zheng { 40167bfa9535SNikolay Borisov struct btrfs_fs_info *fs_info = inode->root->fs_info; 40175d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 40185d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 40195d4f98a2SYan Zheng int ret; 40205d4f98a2SYan Zheng u64 disk_bytenr; 40214577b014SJosef Bacik u64 new_bytenr; 40225d4f98a2SYan Zheng LIST_HEAD(list); 40235d4f98a2SYan Zheng 40247bfa9535SNikolay Borisov ordered = btrfs_lookup_ordered_extent(inode, file_pos); 4025bffe633eSOmar Sandoval BUG_ON(ordered->file_offset != file_pos || ordered->num_bytes != len); 40265d4f98a2SYan Zheng 40277bfa9535SNikolay Borisov disk_bytenr = file_pos + inode->index_cnt; 40280b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4029a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 403079787eaaSJeff Mahoney if (ret) 403179787eaaSJeff Mahoney goto out; 40325d4f98a2SYan Zheng 40335d4f98a2SYan Zheng while (!list_empty(&list)) { 40345d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 40355d4f98a2SYan Zheng list_del_init(&sums->list); 40365d4f98a2SYan Zheng 40374577b014SJosef Bacik /* 40384577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 40394577b014SJosef Bacik * We need to do this because we will read in entire prealloc 40404577b014SJosef Bacik * extents but we may have written to say the middle of the 40414577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 40424577b014SJosef Bacik * the right disk offset. 40434577b014SJosef Bacik * 40444577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 40454577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 40464577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 40474577b014SJosef Bacik * disk length. 40484577b014SJosef Bacik */ 4049bffe633eSOmar Sandoval new_bytenr = ordered->disk_bytenr + sums->bytenr - disk_bytenr; 40504577b014SJosef Bacik sums->bytenr = new_bytenr; 40515d4f98a2SYan Zheng 4052f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 40535d4f98a2SYan Zheng } 405479787eaaSJeff Mahoney out: 40555d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4056411fc6bcSAndi Kleen return ret; 40575d4f98a2SYan Zheng } 40583fd0a558SYan, Zheng 405983d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 40603fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 40613fd0a558SYan, Zheng struct extent_buffer *cow) 40623fd0a558SYan, Zheng { 40630b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 40643fd0a558SYan, Zheng struct reloc_control *rc; 4065a26195a5SQu Wenruo struct btrfs_backref_node *node; 40663fd0a558SYan, Zheng int first_cow = 0; 40673fd0a558SYan, Zheng int level; 406883d4cfd4SJosef Bacik int ret = 0; 40693fd0a558SYan, Zheng 40700b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 40713fd0a558SYan, Zheng if (!rc) 407283d4cfd4SJosef Bacik return 0; 40733fd0a558SYan, Zheng 40743fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 40753fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 40763fd0a558SYan, Zheng 40773fd0a558SYan, Zheng level = btrfs_header_level(buf); 40783fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 40793fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 40803fd0a558SYan, Zheng first_cow = 1; 40813fd0a558SYan, Zheng 40823fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 40833fd0a558SYan, Zheng rc->create_reloc_tree) { 40843fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 40853fd0a558SYan, Zheng 40863fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 40873fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 40883fd0a558SYan, Zheng node->new_bytenr != buf->start); 40893fd0a558SYan, Zheng 4090b0fe7078SQu Wenruo btrfs_backref_drop_node_buffer(node); 409167439dadSDavid Sterba atomic_inc(&cow->refs); 40923fd0a558SYan, Zheng node->eb = cow; 40933fd0a558SYan, Zheng node->new_bytenr = cow->start; 40943fd0a558SYan, Zheng 40953fd0a558SYan, Zheng if (!node->pending) { 40963fd0a558SYan, Zheng list_move_tail(&node->list, 40973fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 40983fd0a558SYan, Zheng node->pending = 1; 40993fd0a558SYan, Zheng } 41003fd0a558SYan, Zheng 41013fd0a558SYan, Zheng if (first_cow) 41029569cc20SQu Wenruo mark_block_processed(rc, node); 41033fd0a558SYan, Zheng 41043fd0a558SYan, Zheng if (first_cow && level > 0) 41053fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 41063fd0a558SYan, Zheng } 41073fd0a558SYan, Zheng 410883d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 41093fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 411083d4cfd4SJosef Bacik return ret; 41113fd0a558SYan, Zheng } 41123fd0a558SYan, Zheng 41133fd0a558SYan, Zheng /* 41143fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 411501327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 41163fd0a558SYan, Zheng */ 4117147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 41183fd0a558SYan, Zheng u64 *bytes_to_reserve) 41193fd0a558SYan, Zheng { 412010995c04SQu Wenruo struct btrfs_root *root = pending->root; 412110995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 41223fd0a558SYan, Zheng 41236282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 41243fd0a558SYan, Zheng return; 41253fd0a558SYan, Zheng 41263fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 41273fd0a558SYan, Zheng return; 41283fd0a558SYan, Zheng 41293fd0a558SYan, Zheng root = root->reloc_root; 41303fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 41313fd0a558SYan, Zheng /* 41323fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 41333fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 41343fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 41353fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 41363fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 41373fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 41383fd0a558SYan, Zheng * tree may use more space than it frees. so we need 41393fd0a558SYan, Zheng * reserve extra space. 41403fd0a558SYan, Zheng */ 41413fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 41423fd0a558SYan, Zheng } 41433fd0a558SYan, Zheng 41443fd0a558SYan, Zheng /* 41453fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 41463fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 4147f44deb74SJosef Bacik * 4148f44deb74SJosef Bacik * This is similar to btrfs_init_reloc_root(), we come out of here with two 4149f44deb74SJosef Bacik * references held on the reloc_root, one for root->reloc_root and one for 4150f44deb74SJosef Bacik * rc->reloc_roots. 41513fd0a558SYan, Zheng */ 415249b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 41533fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 41543fd0a558SYan, Zheng { 41553fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 41563fd0a558SYan, Zheng struct btrfs_root *reloc_root; 41573fd0a558SYan, Zheng struct btrfs_root *new_root; 415810995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 41593fd0a558SYan, Zheng int ret; 41603fd0a558SYan, Zheng 41616282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 416249b25e05SJeff Mahoney return 0; 41633fd0a558SYan, Zheng 41643fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 41653fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 41663fd0a558SYan, Zheng 41673fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 41683fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 41693fd0a558SYan, Zheng rc->block_rsv, 41703a584174SLu Fengqi rc->nodes_relocated, true); 417149b25e05SJeff Mahoney if (ret) 417249b25e05SJeff Mahoney return ret; 41733fd0a558SYan, Zheng } 41743fd0a558SYan, Zheng 41753fd0a558SYan, Zheng new_root = pending->snap; 41763fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 41773fd0a558SYan, Zheng new_root->root_key.objectid); 417849b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 417949b25e05SJeff Mahoney return PTR_ERR(reloc_root); 41803fd0a558SYan, Zheng 4181ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4182ffd7b339SJeff Mahoney BUG_ON(ret < 0); 4183f44deb74SJosef Bacik new_root->reloc_root = btrfs_grab_root(reloc_root); 41843fd0a558SYan, Zheng 418549b25e05SJeff Mahoney if (rc->create_reloc_tree) 41863fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 418749b25e05SJeff Mahoney return ret; 41883fd0a558SYan, Zheng } 4189