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" 21581bb050SLi Zefan #include "inode-map.h" 2262b99540SQu Wenruo #include "qgroup.h" 23cdccee99SLiu Bo #include "print-tree.h" 2486736342SJosef Bacik #include "delalloc-space.h" 25aac0023cSJosef Bacik #include "block-group.h" 2619b546d7SQu Wenruo #include "backref.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 750c891389SQu Wenruo /* 765d4f98a2SYan Zheng * backref_node, mapping_node and tree_block start with this 775d4f98a2SYan Zheng */ 785d4f98a2SYan Zheng struct tree_entry { 795d4f98a2SYan Zheng struct rb_node rb_node; 805d4f98a2SYan Zheng u64 bytenr; 815d4f98a2SYan Zheng }; 825d4f98a2SYan Zheng 835d4f98a2SYan Zheng /* 845d4f98a2SYan Zheng * present a tree block in the backref cache 855d4f98a2SYan Zheng */ 865d4f98a2SYan Zheng struct backref_node { 875d4f98a2SYan Zheng struct rb_node rb_node; 885d4f98a2SYan Zheng u64 bytenr; 893fd0a558SYan, Zheng 903fd0a558SYan, Zheng u64 new_bytenr; 913fd0a558SYan, Zheng /* objectid of tree block owner, can be not uptodate */ 925d4f98a2SYan Zheng u64 owner; 933fd0a558SYan, Zheng /* link to pending, changed or detached list */ 943fd0a558SYan, Zheng struct list_head list; 955d4f98a2SYan Zheng /* list of upper level blocks reference this block */ 965d4f98a2SYan Zheng struct list_head upper; 975d4f98a2SYan Zheng /* list of child blocks in the cache */ 985d4f98a2SYan Zheng struct list_head lower; 995d4f98a2SYan Zheng /* NULL if this node is not tree root */ 1005d4f98a2SYan Zheng struct btrfs_root *root; 1015d4f98a2SYan Zheng /* extent buffer got by COW the block */ 1025d4f98a2SYan Zheng struct extent_buffer *eb; 1035d4f98a2SYan Zheng /* level of tree block */ 1045d4f98a2SYan Zheng unsigned int level:8; 1053fd0a558SYan, Zheng /* is the block in non-reference counted tree */ 1063fd0a558SYan, Zheng unsigned int cowonly:1; 1073fd0a558SYan, Zheng /* 1 if no child node in the cache */ 1085d4f98a2SYan Zheng unsigned int lowest:1; 1095d4f98a2SYan Zheng /* is the extent buffer locked */ 1105d4f98a2SYan Zheng unsigned int locked:1; 1115d4f98a2SYan Zheng /* has the block been processed */ 1125d4f98a2SYan Zheng unsigned int processed:1; 1135d4f98a2SYan Zheng /* have backrefs of this block been checked */ 1145d4f98a2SYan Zheng unsigned int checked:1; 1153fd0a558SYan, Zheng /* 1163fd0a558SYan, Zheng * 1 if corresponding block has been cowed but some upper 1173fd0a558SYan, Zheng * level block pointers may not point to the new location 1183fd0a558SYan, Zheng */ 1193fd0a558SYan, Zheng unsigned int pending:1; 1203fd0a558SYan, Zheng /* 1213fd0a558SYan, Zheng * 1 if the backref node isn't connected to any other 1223fd0a558SYan, Zheng * backref node. 1233fd0a558SYan, Zheng */ 1243fd0a558SYan, Zheng unsigned int detached:1; 1255d4f98a2SYan Zheng }; 1265d4f98a2SYan Zheng 1275d4f98a2SYan Zheng /* 1285d4f98a2SYan Zheng * present a block pointer in the backref cache 1295d4f98a2SYan Zheng */ 1305d4f98a2SYan Zheng struct backref_edge { 1315d4f98a2SYan Zheng struct list_head list[2]; 1325d4f98a2SYan Zheng struct backref_node *node[2]; 1335d4f98a2SYan Zheng }; 1345d4f98a2SYan Zheng 1355d4f98a2SYan Zheng #define LOWER 0 1365d4f98a2SYan Zheng #define UPPER 1 1370647bf56SWang Shilong #define RELOCATION_RESERVED_NODES 256 1385d4f98a2SYan Zheng 1395d4f98a2SYan Zheng struct backref_cache { 1405d4f98a2SYan Zheng /* red black tree of all backref nodes in the cache */ 1415d4f98a2SYan Zheng struct rb_root rb_root; 1423fd0a558SYan, Zheng /* for passing backref nodes to btrfs_reloc_cow_block */ 1433fd0a558SYan, Zheng struct backref_node *path[BTRFS_MAX_LEVEL]; 1443fd0a558SYan, Zheng /* 1453fd0a558SYan, Zheng * list of blocks that have been cowed but some block 1463fd0a558SYan, Zheng * pointers in upper level blocks may not reflect the 1473fd0a558SYan, Zheng * new location 1483fd0a558SYan, Zheng */ 1495d4f98a2SYan Zheng struct list_head pending[BTRFS_MAX_LEVEL]; 1503fd0a558SYan, Zheng /* list of backref nodes with no child node */ 1513fd0a558SYan, Zheng struct list_head leaves; 1523fd0a558SYan, Zheng /* list of blocks that have been cowed in current transaction */ 1533fd0a558SYan, Zheng struct list_head changed; 1543fd0a558SYan, Zheng /* list of detached backref node. */ 1553fd0a558SYan, Zheng struct list_head detached; 1563fd0a558SYan, Zheng 1573fd0a558SYan, Zheng u64 last_trans; 1583fd0a558SYan, Zheng 1593fd0a558SYan, Zheng int nr_nodes; 1603fd0a558SYan, Zheng int nr_edges; 16184780289SQu Wenruo 16284780289SQu Wenruo /* The list of unchecked backref edges during backref cache build */ 16384780289SQu Wenruo struct list_head pending_edge; 16484780289SQu Wenruo 16584780289SQu Wenruo /* The list of useless backref nodes during backref cache build */ 16684780289SQu Wenruo struct list_head useless_node; 16733a0f1f7SQu Wenruo 16833a0f1f7SQu Wenruo struct btrfs_fs_info *fs_info; 1695d4f98a2SYan Zheng }; 1705d4f98a2SYan Zheng 1715d4f98a2SYan Zheng /* 1725d4f98a2SYan Zheng * map address of tree root to tree 1735d4f98a2SYan Zheng */ 1745d4f98a2SYan Zheng struct mapping_node { 1755d4f98a2SYan Zheng struct rb_node rb_node; 1765d4f98a2SYan Zheng u64 bytenr; 1775d4f98a2SYan Zheng void *data; 1785d4f98a2SYan Zheng }; 1795d4f98a2SYan Zheng 1805d4f98a2SYan Zheng struct mapping_tree { 1815d4f98a2SYan Zheng struct rb_root rb_root; 1825d4f98a2SYan Zheng spinlock_t lock; 1835d4f98a2SYan Zheng }; 1845d4f98a2SYan Zheng 1855d4f98a2SYan Zheng /* 1865d4f98a2SYan Zheng * present a tree block to process 1875d4f98a2SYan Zheng */ 1885d4f98a2SYan Zheng struct tree_block { 1895d4f98a2SYan Zheng struct rb_node rb_node; 1905d4f98a2SYan Zheng u64 bytenr; 1915d4f98a2SYan Zheng struct btrfs_key key; 1925d4f98a2SYan Zheng unsigned int level:8; 1935d4f98a2SYan Zheng unsigned int key_ready:1; 1945d4f98a2SYan Zheng }; 1955d4f98a2SYan Zheng 1960257bb82SYan, Zheng #define MAX_EXTENTS 128 1970257bb82SYan, Zheng 1980257bb82SYan, Zheng struct file_extent_cluster { 1990257bb82SYan, Zheng u64 start; 2000257bb82SYan, Zheng u64 end; 2010257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 2020257bb82SYan, Zheng unsigned int nr; 2030257bb82SYan, Zheng }; 2040257bb82SYan, Zheng 2055d4f98a2SYan Zheng struct reloc_control { 2065d4f98a2SYan Zheng /* block group to relocate */ 20732da5386SDavid Sterba struct btrfs_block_group *block_group; 2085d4f98a2SYan Zheng /* extent tree */ 2095d4f98a2SYan Zheng struct btrfs_root *extent_root; 2105d4f98a2SYan Zheng /* inode for moving data */ 2115d4f98a2SYan Zheng struct inode *data_inode; 2123fd0a558SYan, Zheng 2133fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 2143fd0a558SYan, Zheng 2153fd0a558SYan, Zheng struct backref_cache backref_cache; 2163fd0a558SYan, Zheng 2173fd0a558SYan, Zheng struct file_extent_cluster cluster; 2185d4f98a2SYan Zheng /* tree blocks have been processed */ 2195d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 2205d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 2215d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 2225d4f98a2SYan Zheng /* list of reloc trees */ 2235d4f98a2SYan Zheng struct list_head reloc_roots; 224d2311e69SQu Wenruo /* list of subvolume trees that get relocated */ 225d2311e69SQu Wenruo struct list_head dirty_subvol_roots; 2263fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 2273fd0a558SYan, Zheng u64 merging_rsv_size; 2283fd0a558SYan, Zheng /* size of relocated tree nodes */ 2293fd0a558SYan, Zheng u64 nodes_relocated; 2300647bf56SWang Shilong /* reserved size for block group relocation*/ 2310647bf56SWang Shilong u64 reserved_bytes; 2323fd0a558SYan, Zheng 2335d4f98a2SYan Zheng u64 search_start; 2345d4f98a2SYan Zheng u64 extents_found; 2353fd0a558SYan, Zheng 2363fd0a558SYan, Zheng unsigned int stage:8; 2373fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 2383fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 2395d4f98a2SYan Zheng unsigned int found_file_extent:1; 2405d4f98a2SYan Zheng }; 2415d4f98a2SYan Zheng 2425d4f98a2SYan Zheng /* stages of data relocation */ 2435d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 2445d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 2455d4f98a2SYan Zheng 2463fd0a558SYan, Zheng static void remove_backref_node(struct backref_cache *cache, 2473fd0a558SYan, Zheng struct backref_node *node); 2489569cc20SQu Wenruo 2499569cc20SQu Wenruo static void mark_block_processed(struct reloc_control *rc, 2509569cc20SQu Wenruo struct backref_node *node) 2519569cc20SQu Wenruo { 2529569cc20SQu Wenruo u32 blocksize; 2539569cc20SQu Wenruo 2549569cc20SQu Wenruo if (node->level == 0 || 2559569cc20SQu Wenruo in_range(node->bytenr, rc->block_group->start, 2569569cc20SQu Wenruo rc->block_group->length)) { 2579569cc20SQu Wenruo blocksize = rc->extent_root->fs_info->nodesize; 2589569cc20SQu Wenruo set_extent_bits(&rc->processed_blocks, node->bytenr, 2599569cc20SQu Wenruo node->bytenr + blocksize - 1, EXTENT_DIRTY); 2609569cc20SQu Wenruo } 2619569cc20SQu Wenruo node->processed = 1; 2629569cc20SQu Wenruo } 2639569cc20SQu Wenruo 2645d4f98a2SYan Zheng 2655d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 2665d4f98a2SYan Zheng { 2676bef4d31SEric Paris tree->rb_root = RB_ROOT; 2685d4f98a2SYan Zheng spin_lock_init(&tree->lock); 2695d4f98a2SYan Zheng } 2705d4f98a2SYan Zheng 27133a0f1f7SQu Wenruo static void backref_cache_init(struct btrfs_fs_info *fs_info, 27233a0f1f7SQu Wenruo struct backref_cache *cache) 2735d4f98a2SYan Zheng { 2745d4f98a2SYan Zheng int i; 2756bef4d31SEric Paris cache->rb_root = RB_ROOT; 2765d4f98a2SYan Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2775d4f98a2SYan Zheng INIT_LIST_HEAD(&cache->pending[i]); 2783fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->changed); 2793fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->detached); 2803fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->leaves); 28184780289SQu Wenruo INIT_LIST_HEAD(&cache->pending_edge); 28284780289SQu Wenruo INIT_LIST_HEAD(&cache->useless_node); 28333a0f1f7SQu Wenruo cache->fs_info = fs_info; 2845d4f98a2SYan Zheng } 2855d4f98a2SYan Zheng 2863fd0a558SYan, Zheng static void backref_cache_cleanup(struct backref_cache *cache) 2875d4f98a2SYan Zheng { 2883fd0a558SYan, Zheng struct backref_node *node; 2893fd0a558SYan, Zheng int i; 2903fd0a558SYan, Zheng 2913fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2923fd0a558SYan, Zheng node = list_entry(cache->detached.next, 2933fd0a558SYan, Zheng struct backref_node, list); 2943fd0a558SYan, Zheng remove_backref_node(cache, node); 2953fd0a558SYan, Zheng } 2963fd0a558SYan, Zheng 2973fd0a558SYan, Zheng while (!list_empty(&cache->leaves)) { 2983fd0a558SYan, Zheng node = list_entry(cache->leaves.next, 2993fd0a558SYan, Zheng struct backref_node, lower); 3003fd0a558SYan, Zheng remove_backref_node(cache, node); 3013fd0a558SYan, Zheng } 3023fd0a558SYan, Zheng 3033fd0a558SYan, Zheng cache->last_trans = 0; 3043fd0a558SYan, Zheng 3053fd0a558SYan, Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 306f4907095SLiu Bo ASSERT(list_empty(&cache->pending[i])); 30784780289SQu Wenruo ASSERT(list_empty(&cache->pending_edge)); 30884780289SQu Wenruo ASSERT(list_empty(&cache->useless_node)); 309f4907095SLiu Bo ASSERT(list_empty(&cache->changed)); 310f4907095SLiu Bo ASSERT(list_empty(&cache->detached)); 311f4907095SLiu Bo ASSERT(RB_EMPTY_ROOT(&cache->rb_root)); 312f4907095SLiu Bo ASSERT(!cache->nr_nodes); 313f4907095SLiu Bo ASSERT(!cache->nr_edges); 3143fd0a558SYan, Zheng } 3153fd0a558SYan, Zheng 3163fd0a558SYan, Zheng static struct backref_node *alloc_backref_node(struct backref_cache *cache) 3173fd0a558SYan, Zheng { 3183fd0a558SYan, Zheng struct backref_node *node; 3193fd0a558SYan, Zheng 3203fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 3213fd0a558SYan, Zheng if (node) { 3223fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 3235d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 3245d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 3255d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 3263fd0a558SYan, Zheng cache->nr_nodes++; 3273fd0a558SYan, Zheng } 3283fd0a558SYan, Zheng return node; 3293fd0a558SYan, Zheng } 3303fd0a558SYan, Zheng 3313fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 3323fd0a558SYan, Zheng struct backref_node *node) 3333fd0a558SYan, Zheng { 3343fd0a558SYan, Zheng if (node) { 3353fd0a558SYan, Zheng cache->nr_nodes--; 33600246528SJosef Bacik btrfs_put_root(node->root); 3373fd0a558SYan, Zheng kfree(node); 3383fd0a558SYan, Zheng } 3393fd0a558SYan, Zheng } 3403fd0a558SYan, Zheng 3413fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 3423fd0a558SYan, Zheng { 3433fd0a558SYan, Zheng struct backref_edge *edge; 3443fd0a558SYan, Zheng 3453fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 3463fd0a558SYan, Zheng if (edge) 3473fd0a558SYan, Zheng cache->nr_edges++; 3483fd0a558SYan, Zheng return edge; 3493fd0a558SYan, Zheng } 3503fd0a558SYan, Zheng 3513fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 3523fd0a558SYan, Zheng struct backref_edge *edge) 3533fd0a558SYan, Zheng { 3543fd0a558SYan, Zheng if (edge) { 3553fd0a558SYan, Zheng cache->nr_edges--; 3563fd0a558SYan, Zheng kfree(edge); 3573fd0a558SYan, Zheng } 3585d4f98a2SYan Zheng } 3595d4f98a2SYan Zheng 3605d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 3615d4f98a2SYan Zheng struct rb_node *node) 3625d4f98a2SYan Zheng { 3635d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 3645d4f98a2SYan Zheng struct rb_node *parent = NULL; 3655d4f98a2SYan Zheng struct tree_entry *entry; 3665d4f98a2SYan Zheng 3675d4f98a2SYan Zheng while (*p) { 3685d4f98a2SYan Zheng parent = *p; 3695d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 3705d4f98a2SYan Zheng 3715d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3725d4f98a2SYan Zheng p = &(*p)->rb_left; 3735d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3745d4f98a2SYan Zheng p = &(*p)->rb_right; 3755d4f98a2SYan Zheng else 3765d4f98a2SYan Zheng return parent; 3775d4f98a2SYan Zheng } 3785d4f98a2SYan Zheng 3795d4f98a2SYan Zheng rb_link_node(node, parent, p); 3805d4f98a2SYan Zheng rb_insert_color(node, root); 3815d4f98a2SYan Zheng return NULL; 3825d4f98a2SYan Zheng } 3835d4f98a2SYan Zheng 3845d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 3855d4f98a2SYan Zheng { 3865d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 3875d4f98a2SYan Zheng struct tree_entry *entry; 3885d4f98a2SYan Zheng 3895d4f98a2SYan Zheng while (n) { 3905d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 3915d4f98a2SYan Zheng 3925d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3935d4f98a2SYan Zheng n = n->rb_left; 3945d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3955d4f98a2SYan Zheng n = n->rb_right; 3965d4f98a2SYan Zheng else 3975d4f98a2SYan Zheng return n; 3985d4f98a2SYan Zheng } 3995d4f98a2SYan Zheng return NULL; 4005d4f98a2SYan Zheng } 4015d4f98a2SYan Zheng 40248a3b636SEric Sandeen static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) 40343c04fb1SJeff Mahoney { 40443c04fb1SJeff Mahoney 40543c04fb1SJeff Mahoney struct btrfs_fs_info *fs_info = NULL; 40643c04fb1SJeff Mahoney struct backref_node *bnode = rb_entry(rb_node, struct backref_node, 40743c04fb1SJeff Mahoney rb_node); 40843c04fb1SJeff Mahoney if (bnode->root) 40943c04fb1SJeff Mahoney fs_info = bnode->root->fs_info; 4105d163e0eSJeff Mahoney btrfs_panic(fs_info, errno, 4115d163e0eSJeff Mahoney "Inconsistency in backref cache found at offset %llu", 4125d163e0eSJeff Mahoney bytenr); 41343c04fb1SJeff Mahoney } 41443c04fb1SJeff Mahoney 4155d4f98a2SYan Zheng /* 4165d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 4175d4f98a2SYan Zheng */ 4185d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 4195d4f98a2SYan Zheng struct backref_edge *edges[], 4205d4f98a2SYan Zheng int *index) 4215d4f98a2SYan Zheng { 4225d4f98a2SYan Zheng struct backref_edge *edge; 4235d4f98a2SYan Zheng int idx = *index; 4245d4f98a2SYan Zheng 4255d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4265d4f98a2SYan Zheng edge = list_entry(node->upper.next, 4275d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 4285d4f98a2SYan Zheng edges[idx++] = edge; 4295d4f98a2SYan Zheng node = edge->node[UPPER]; 4305d4f98a2SYan Zheng } 4313fd0a558SYan, Zheng BUG_ON(node->detached); 4325d4f98a2SYan Zheng *index = idx; 4335d4f98a2SYan Zheng return node; 4345d4f98a2SYan Zheng } 4355d4f98a2SYan Zheng 4365d4f98a2SYan Zheng /* 4375d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 4385d4f98a2SYan Zheng */ 4395d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 4405d4f98a2SYan Zheng int *index) 4415d4f98a2SYan Zheng { 4425d4f98a2SYan Zheng struct backref_edge *edge; 4435d4f98a2SYan Zheng struct backref_node *lower; 4445d4f98a2SYan Zheng int idx = *index; 4455d4f98a2SYan Zheng 4465d4f98a2SYan Zheng while (idx > 0) { 4475d4f98a2SYan Zheng edge = edges[idx - 1]; 4485d4f98a2SYan Zheng lower = edge->node[LOWER]; 4495d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 4505d4f98a2SYan Zheng idx--; 4515d4f98a2SYan Zheng continue; 4525d4f98a2SYan Zheng } 4535d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 4545d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 4555d4f98a2SYan Zheng edges[idx - 1] = edge; 4565d4f98a2SYan Zheng *index = idx; 4575d4f98a2SYan Zheng return edge->node[UPPER]; 4585d4f98a2SYan Zheng } 4595d4f98a2SYan Zheng *index = 0; 4605d4f98a2SYan Zheng return NULL; 4615d4f98a2SYan Zheng } 4625d4f98a2SYan Zheng 4633fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 4645d4f98a2SYan Zheng { 4655d4f98a2SYan Zheng if (node->locked) { 4665d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 4675d4f98a2SYan Zheng node->locked = 0; 4685d4f98a2SYan Zheng } 4693fd0a558SYan, Zheng } 4703fd0a558SYan, Zheng 4713fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 4723fd0a558SYan, Zheng { 4733fd0a558SYan, Zheng if (node->eb) { 4743fd0a558SYan, Zheng unlock_node_buffer(node); 4755d4f98a2SYan Zheng free_extent_buffer(node->eb); 4765d4f98a2SYan Zheng node->eb = NULL; 4775d4f98a2SYan Zheng } 4785d4f98a2SYan Zheng } 4795d4f98a2SYan Zheng 4805d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 4815d4f98a2SYan Zheng struct backref_node *node) 4825d4f98a2SYan Zheng { 4835d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 4845d4f98a2SYan Zheng 4855d4f98a2SYan Zheng drop_node_buffer(node); 4863fd0a558SYan, Zheng list_del(&node->list); 4875d4f98a2SYan Zheng list_del(&node->lower); 4883fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 4895d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 4903fd0a558SYan, Zheng free_backref_node(tree, node); 4915d4f98a2SYan Zheng } 4925d4f98a2SYan Zheng 4935d4f98a2SYan Zheng /* 4945d4f98a2SYan Zheng * remove a backref node from the backref cache 4955d4f98a2SYan Zheng */ 4965d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 4975d4f98a2SYan Zheng struct backref_node *node) 4985d4f98a2SYan Zheng { 4995d4f98a2SYan Zheng struct backref_node *upper; 5005d4f98a2SYan Zheng struct backref_edge *edge; 5015d4f98a2SYan Zheng 5025d4f98a2SYan Zheng if (!node) 5035d4f98a2SYan Zheng return; 5045d4f98a2SYan Zheng 5053fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 5065d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 5075d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 5085d4f98a2SYan Zheng list[LOWER]); 5095d4f98a2SYan Zheng upper = edge->node[UPPER]; 5105d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 5115d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 5123fd0a558SYan, Zheng free_backref_edge(cache, edge); 5133fd0a558SYan, Zheng 5143fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 5153fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 5163fd0a558SYan, Zheng drop_backref_node(cache, node); 5173fd0a558SYan, Zheng node = upper; 5183fd0a558SYan, Zheng node->lowest = 1; 5193fd0a558SYan, Zheng continue; 5203fd0a558SYan, Zheng } 5215d4f98a2SYan Zheng /* 5223fd0a558SYan, Zheng * add the node to leaf node list if no other 5235d4f98a2SYan Zheng * child block cached. 5245d4f98a2SYan Zheng */ 5255d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 5263fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 5275d4f98a2SYan Zheng upper->lowest = 1; 5285d4f98a2SYan Zheng } 5295d4f98a2SYan Zheng } 5303fd0a558SYan, Zheng 5315d4f98a2SYan Zheng drop_backref_node(cache, node); 5325d4f98a2SYan Zheng } 5335d4f98a2SYan Zheng 5343fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 5353fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 5363fd0a558SYan, Zheng { 5373fd0a558SYan, Zheng struct rb_node *rb_node; 5383fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 5393fd0a558SYan, Zheng node->bytenr = bytenr; 5403fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 54143c04fb1SJeff Mahoney if (rb_node) 54243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, bytenr); 5433fd0a558SYan, Zheng } 5443fd0a558SYan, Zheng 5453fd0a558SYan, Zheng /* 5463fd0a558SYan, Zheng * update backref cache after a transaction commit 5473fd0a558SYan, Zheng */ 5483fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 5493fd0a558SYan, Zheng struct backref_cache *cache) 5503fd0a558SYan, Zheng { 5513fd0a558SYan, Zheng struct backref_node *node; 5523fd0a558SYan, Zheng int level = 0; 5533fd0a558SYan, Zheng 5543fd0a558SYan, Zheng if (cache->last_trans == 0) { 5553fd0a558SYan, Zheng cache->last_trans = trans->transid; 5563fd0a558SYan, Zheng return 0; 5573fd0a558SYan, Zheng } 5583fd0a558SYan, Zheng 5593fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 5603fd0a558SYan, Zheng return 0; 5613fd0a558SYan, Zheng 5623fd0a558SYan, Zheng /* 5633fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 5643fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 5653fd0a558SYan, Zheng * so the detached nodes are no longer useful. 5663fd0a558SYan, Zheng */ 5673fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 5683fd0a558SYan, Zheng node = list_entry(cache->detached.next, 5693fd0a558SYan, Zheng struct backref_node, list); 5703fd0a558SYan, Zheng remove_backref_node(cache, node); 5713fd0a558SYan, Zheng } 5723fd0a558SYan, Zheng 5733fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 5743fd0a558SYan, Zheng node = list_entry(cache->changed.next, 5753fd0a558SYan, Zheng struct backref_node, list); 5763fd0a558SYan, Zheng list_del_init(&node->list); 5773fd0a558SYan, Zheng BUG_ON(node->pending); 5783fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5793fd0a558SYan, Zheng } 5803fd0a558SYan, Zheng 5813fd0a558SYan, Zheng /* 5823fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 5833fd0a558SYan, Zheng * errors during processing the pending nodes. 5843fd0a558SYan, Zheng */ 5853fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 5863fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 5873fd0a558SYan, Zheng BUG_ON(!node->pending); 5883fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 5893fd0a558SYan, Zheng continue; 5903fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5913fd0a558SYan, Zheng } 5923fd0a558SYan, Zheng } 5933fd0a558SYan, Zheng 5943fd0a558SYan, Zheng cache->last_trans = 0; 5953fd0a558SYan, Zheng return 1; 5963fd0a558SYan, Zheng } 5973fd0a558SYan, Zheng 5986282675eSQu Wenruo static bool reloc_root_is_dead(struct btrfs_root *root) 5996282675eSQu Wenruo { 6006282675eSQu Wenruo /* 6016282675eSQu Wenruo * Pair with set_bit/clear_bit in clean_dirty_subvols and 6026282675eSQu Wenruo * btrfs_update_reloc_root. We need to see the updated bit before 6036282675eSQu Wenruo * trying to access reloc_root 6046282675eSQu Wenruo */ 6056282675eSQu Wenruo smp_rmb(); 6066282675eSQu Wenruo if (test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state)) 6076282675eSQu Wenruo return true; 6086282675eSQu Wenruo return false; 6096282675eSQu Wenruo } 6106282675eSQu Wenruo 6116282675eSQu Wenruo /* 6126282675eSQu Wenruo * Check if this subvolume tree has valid reloc tree. 6136282675eSQu Wenruo * 6146282675eSQu Wenruo * Reloc tree after swap is considered dead, thus not considered as valid. 6156282675eSQu Wenruo * This is enough for most callers, as they don't distinguish dead reloc root 6166282675eSQu Wenruo * from no reloc root. But should_ignore_root() below is a special case. 6176282675eSQu Wenruo */ 6186282675eSQu Wenruo static bool have_reloc_root(struct btrfs_root *root) 6196282675eSQu Wenruo { 6206282675eSQu Wenruo if (reloc_root_is_dead(root)) 6216282675eSQu Wenruo return false; 6226282675eSQu Wenruo if (!root->reloc_root) 6236282675eSQu Wenruo return false; 6246282675eSQu Wenruo return true; 6256282675eSQu Wenruo } 626f2a97a9dSDavid Sterba 6273fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 6283fd0a558SYan, Zheng { 6293fd0a558SYan, Zheng struct btrfs_root *reloc_root; 6303fd0a558SYan, Zheng 63127cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 6323fd0a558SYan, Zheng return 0; 6333fd0a558SYan, Zheng 6346282675eSQu Wenruo /* This root has been merged with its reloc tree, we can ignore it */ 6356282675eSQu Wenruo if (reloc_root_is_dead(root)) 6366282675eSQu Wenruo return 1; 6376282675eSQu Wenruo 6383fd0a558SYan, Zheng reloc_root = root->reloc_root; 6393fd0a558SYan, Zheng if (!reloc_root) 6403fd0a558SYan, Zheng return 0; 6413fd0a558SYan, Zheng 6424d4225fcSJosef Bacik if (btrfs_header_generation(reloc_root->commit_root) == 6434d4225fcSJosef Bacik root->fs_info->running_transaction->transid) 6443fd0a558SYan, Zheng return 0; 6453fd0a558SYan, Zheng /* 6463fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 6473fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 6483fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 6493fd0a558SYan, Zheng * relocation. 6503fd0a558SYan, Zheng */ 6513fd0a558SYan, Zheng return 1; 6523fd0a558SYan, Zheng } 6535d4f98a2SYan Zheng /* 6545d4f98a2SYan Zheng * find reloc tree by address of tree root 6555d4f98a2SYan Zheng */ 6565d4f98a2SYan Zheng static struct btrfs_root *find_reloc_root(struct reloc_control *rc, 6575d4f98a2SYan Zheng u64 bytenr) 6585d4f98a2SYan Zheng { 6595d4f98a2SYan Zheng struct rb_node *rb_node; 6605d4f98a2SYan Zheng struct mapping_node *node; 6615d4f98a2SYan Zheng struct btrfs_root *root = NULL; 6625d4f98a2SYan Zheng 6635d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 6645d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 6655d4f98a2SYan Zheng if (rb_node) { 6665d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 6675d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 6685d4f98a2SYan Zheng } 6695d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 67000246528SJosef Bacik return btrfs_grab_root(root); 6715d4f98a2SYan Zheng } 6725d4f98a2SYan Zheng 6735d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 6745d4f98a2SYan Zheng u64 root_objectid) 6755d4f98a2SYan Zheng { 6765d4f98a2SYan Zheng struct btrfs_key key; 6775d4f98a2SYan Zheng 6785d4f98a2SYan Zheng key.objectid = root_objectid; 6795d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 6805d4f98a2SYan Zheng key.offset = (u64)-1; 6815d4f98a2SYan Zheng 682bc44d7c4SJosef Bacik return btrfs_get_fs_root(fs_info, &key, false); 6835d4f98a2SYan Zheng } 6845d4f98a2SYan Zheng 6855d4f98a2SYan Zheng /* 6865d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 6875d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 6885d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 6895d4f98a2SYan Zheng * 6905d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 69101327610SNicholas D Steeves * to find upper level blocks that reference the block, and then check 69201327610SNicholas D Steeves * backrefs of these upper level blocks recursively. the recursion stop 6935d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 6945d4f98a2SYan Zheng * 6955d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 6965d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 6975d4f98a2SYan Zheng * block are also cached. 6985d4f98a2SYan Zheng */ 6993fd0a558SYan, Zheng static noinline_for_stack 7003fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 7015d4f98a2SYan Zheng struct btrfs_key *node_key, 7025d4f98a2SYan Zheng int level, u64 bytenr) 7035d4f98a2SYan Zheng { 70471f572a9SQu Wenruo struct btrfs_backref_iter *iter; 7053fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 70671f572a9SQu Wenruo /* For searching parent of TREE_BLOCK_REF */ 70771f572a9SQu Wenruo struct btrfs_path *path; 7085d4f98a2SYan Zheng struct btrfs_root *root; 7095d4f98a2SYan Zheng struct backref_node *cur; 7105d4f98a2SYan Zheng struct backref_node *upper; 7115d4f98a2SYan Zheng struct backref_node *lower; 7125d4f98a2SYan Zheng struct backref_node *node = NULL; 7135d4f98a2SYan Zheng struct backref_node *exist = NULL; 7145d4f98a2SYan Zheng struct backref_edge *edge; 7155d4f98a2SYan Zheng struct rb_node *rb_node; 7163fd0a558SYan, Zheng int cowonly; 7175d4f98a2SYan Zheng int ret; 7185d4f98a2SYan Zheng int err = 0; 719b6c60c80SJosef Bacik bool need_check = true; 7205d4f98a2SYan Zheng 72171f572a9SQu Wenruo iter = btrfs_backref_iter_alloc(rc->extent_root->fs_info, GFP_NOFS); 72271f572a9SQu Wenruo if (!iter) 72371f572a9SQu Wenruo return ERR_PTR(-ENOMEM); 72471f572a9SQu Wenruo path = btrfs_alloc_path(); 72571f572a9SQu Wenruo if (!path) { 7265d4f98a2SYan Zheng err = -ENOMEM; 7275d4f98a2SYan Zheng goto out; 7285d4f98a2SYan Zheng } 7295d4f98a2SYan Zheng 7303fd0a558SYan, Zheng node = alloc_backref_node(cache); 7315d4f98a2SYan Zheng if (!node) { 7325d4f98a2SYan Zheng err = -ENOMEM; 7335d4f98a2SYan Zheng goto out; 7345d4f98a2SYan Zheng } 7355d4f98a2SYan Zheng 7365d4f98a2SYan Zheng node->bytenr = bytenr; 7375d4f98a2SYan Zheng node->level = level; 7385d4f98a2SYan Zheng node->lowest = 1; 7395d4f98a2SYan Zheng cur = node; 7405d4f98a2SYan Zheng again: 74171f572a9SQu Wenruo ret = btrfs_backref_iter_start(iter, cur->bytenr); 7425d4f98a2SYan Zheng if (ret < 0) { 7435d4f98a2SYan Zheng err = ret; 7445d4f98a2SYan Zheng goto out; 7455d4f98a2SYan Zheng } 7465d4f98a2SYan Zheng 74771f572a9SQu Wenruo /* 74871f572a9SQu Wenruo * We skip the first btrfs_tree_block_info, as we don't use the key 74971f572a9SQu Wenruo * stored in it, but fetch it from the tree block 75071f572a9SQu Wenruo */ 75171f572a9SQu Wenruo if (btrfs_backref_has_tree_block_info(iter)) { 75271f572a9SQu Wenruo ret = btrfs_backref_iter_next(iter); 75371f572a9SQu Wenruo if (ret < 0) { 75471f572a9SQu Wenruo err = ret; 75571f572a9SQu Wenruo goto out; 75671f572a9SQu Wenruo } 75771f572a9SQu Wenruo /* No extra backref? This means the tree block is corrupted */ 75871f572a9SQu Wenruo if (ret > 0) { 75971f572a9SQu Wenruo err = -EUCLEAN; 76071f572a9SQu Wenruo goto out; 76171f572a9SQu Wenruo } 76271f572a9SQu Wenruo } 7635d4f98a2SYan Zheng WARN_ON(cur->checked); 7645d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 7655d4f98a2SYan Zheng /* 76670f23fd6SJustin P. Mattock * the backref was added previously when processing 7675d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 7685d4f98a2SYan Zheng */ 76975bfb9afSJosef Bacik ASSERT(list_is_singular(&cur->upper)); 7705d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 7715d4f98a2SYan Zheng list[LOWER]); 77275bfb9afSJosef Bacik ASSERT(list_empty(&edge->list[UPPER])); 7735d4f98a2SYan Zheng exist = edge->node[UPPER]; 7745d4f98a2SYan Zheng /* 7755d4f98a2SYan Zheng * add the upper level block to pending list if we need 7765d4f98a2SYan Zheng * check its backrefs 7775d4f98a2SYan Zheng */ 7785d4f98a2SYan Zheng if (!exist->checked) 77984780289SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 7805d4f98a2SYan Zheng } else { 7815d4f98a2SYan Zheng exist = NULL; 7825d4f98a2SYan Zheng } 7835d4f98a2SYan Zheng 78471f572a9SQu Wenruo for (; ret == 0; ret = btrfs_backref_iter_next(iter)) { 78571f572a9SQu Wenruo struct extent_buffer *eb; 78671f572a9SQu Wenruo struct btrfs_key key; 7873de28d57SLiu Bo int type; 78871f572a9SQu Wenruo 78971f572a9SQu Wenruo cond_resched(); 79071f572a9SQu Wenruo eb = btrfs_backref_get_eb(iter); 79171f572a9SQu Wenruo 79271f572a9SQu Wenruo key.objectid = iter->bytenr; 79371f572a9SQu Wenruo if (btrfs_backref_iter_is_inline_ref(iter)) { 79471f572a9SQu Wenruo struct btrfs_extent_inline_ref *iref; 79571f572a9SQu Wenruo 79671f572a9SQu Wenruo /* update key for inline back ref */ 79771f572a9SQu Wenruo iref = (struct btrfs_extent_inline_ref *) 79871f572a9SQu Wenruo ((unsigned long)iter->cur_ptr); 7993de28d57SLiu Bo type = btrfs_get_extent_inline_ref_type(eb, iref, 8003de28d57SLiu Bo BTRFS_REF_TYPE_BLOCK); 8013de28d57SLiu Bo if (type == BTRFS_REF_TYPE_INVALID) { 802af431dcbSSu Yue err = -EUCLEAN; 8033de28d57SLiu Bo goto out; 8043de28d57SLiu Bo } 8053de28d57SLiu Bo key.type = type; 8065d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 80771f572a9SQu Wenruo } else { 80871f572a9SQu Wenruo key.type = iter->cur_key.type; 80971f572a9SQu Wenruo key.offset = iter->cur_key.offset; 8105d4f98a2SYan Zheng } 8115d4f98a2SYan Zheng 812fa6ac715SQu Wenruo /* 813fa6ac715SQu Wenruo * Parent node found and matches current inline ref, no need to 814fa6ac715SQu Wenruo * rebuild this node for this inline ref. 815fa6ac715SQu Wenruo */ 8165d4f98a2SYan Zheng if (exist && 8175d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 8185d4f98a2SYan Zheng exist->owner == key.offset) || 8195d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 8205d4f98a2SYan Zheng exist->bytenr == key.offset))) { 8215d4f98a2SYan Zheng exist = NULL; 82271f572a9SQu Wenruo continue; 8235d4f98a2SYan Zheng } 8245d4f98a2SYan Zheng 825fa6ac715SQu Wenruo /* SHARED_BLOCK_REF means key.offset is the parent bytenr */ 8265d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 8275d4f98a2SYan Zheng if (key.objectid == key.offset) { 8285d4f98a2SYan Zheng /* 829fa6ac715SQu Wenruo * Only root blocks of reloc trees use backref 830fa6ac715SQu Wenruo * pointing to itself. 8315d4f98a2SYan Zheng */ 8325d4f98a2SYan Zheng root = find_reloc_root(rc, cur->bytenr); 83375bfb9afSJosef Bacik ASSERT(root); 8345d4f98a2SYan Zheng cur->root = root; 8355d4f98a2SYan Zheng break; 8365d4f98a2SYan Zheng } 8375d4f98a2SYan Zheng 8383fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 8395d4f98a2SYan Zheng if (!edge) { 8405d4f98a2SYan Zheng err = -ENOMEM; 8415d4f98a2SYan Zheng goto out; 8425d4f98a2SYan Zheng } 8435d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, key.offset); 8445d4f98a2SYan Zheng if (!rb_node) { 8453fd0a558SYan, Zheng upper = alloc_backref_node(cache); 8465d4f98a2SYan Zheng if (!upper) { 8473fd0a558SYan, Zheng free_backref_edge(cache, edge); 8485d4f98a2SYan Zheng err = -ENOMEM; 8495d4f98a2SYan Zheng goto out; 8505d4f98a2SYan Zheng } 8515d4f98a2SYan Zheng upper->bytenr = key.offset; 8525d4f98a2SYan Zheng upper->level = cur->level + 1; 8535d4f98a2SYan Zheng /* 8545d4f98a2SYan Zheng * backrefs for the upper level block isn't 8555d4f98a2SYan Zheng * cached, add the block to pending list 8565d4f98a2SYan Zheng */ 85784780289SQu Wenruo list_add_tail(&edge->list[UPPER], 85884780289SQu Wenruo &cache->pending_edge); 8595d4f98a2SYan Zheng } else { 8605d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 8615d4f98a2SYan Zheng rb_node); 86275bfb9afSJosef Bacik ASSERT(upper->checked); 8635d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 8645d4f98a2SYan Zheng } 8653fd0a558SYan, Zheng list_add_tail(&edge->list[LOWER], &cur->upper); 8665d4f98a2SYan Zheng edge->node[LOWER] = cur; 8673fd0a558SYan, Zheng edge->node[UPPER] = upper; 8685d4f98a2SYan Zheng 86971f572a9SQu Wenruo continue; 8706d8ff4e4SDavid Sterba } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) { 871ba3c2b19SNikolay Borisov err = -EINVAL; 872ba3c2b19SNikolay Borisov btrfs_print_v0_err(rc->extent_root->fs_info); 873ba3c2b19SNikolay Borisov btrfs_handle_fs_error(rc->extent_root->fs_info, err, 874ba3c2b19SNikolay Borisov NULL); 875ba3c2b19SNikolay Borisov goto out; 8765d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 87771f572a9SQu Wenruo continue; 8785d4f98a2SYan Zheng } 8795d4f98a2SYan Zheng 880fa6ac715SQu Wenruo /* 881fa6ac715SQu Wenruo * key.type == BTRFS_TREE_BLOCK_REF_KEY, inline ref offset 882fa6ac715SQu Wenruo * means the root objectid. We need to search the tree to get 883fa6ac715SQu Wenruo * its parent bytenr. 884fa6ac715SQu Wenruo */ 8855d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, key.offset); 8865d4f98a2SYan Zheng if (IS_ERR(root)) { 8875d4f98a2SYan Zheng err = PTR_ERR(root); 8885d4f98a2SYan Zheng goto out; 8895d4f98a2SYan Zheng } 8905d4f98a2SYan Zheng 89127cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 8923fd0a558SYan, Zheng cur->cowonly = 1; 8933fd0a558SYan, Zheng 8945d4f98a2SYan Zheng if (btrfs_root_level(&root->root_item) == cur->level) { 8955d4f98a2SYan Zheng /* tree root */ 89675bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 8975d4f98a2SYan Zheng cur->bytenr); 8980b530bc5SJosef Bacik if (should_ignore_root(root)) { 89900246528SJosef Bacik btrfs_put_root(root); 90084780289SQu Wenruo list_add(&cur->list, &cache->useless_node); 9010b530bc5SJosef Bacik } else { 9025d4f98a2SYan Zheng cur->root = root; 9030b530bc5SJosef Bacik } 9045d4f98a2SYan Zheng break; 9055d4f98a2SYan Zheng } 9065d4f98a2SYan Zheng 9075d4f98a2SYan Zheng level = cur->level + 1; 9085d4f98a2SYan Zheng 909fa6ac715SQu Wenruo /* Search the tree to find parent blocks referring the block. */ 91071f572a9SQu Wenruo path->search_commit_root = 1; 91171f572a9SQu Wenruo path->skip_locking = 1; 91271f572a9SQu Wenruo path->lowest_level = level; 91371f572a9SQu Wenruo ret = btrfs_search_slot(NULL, root, node_key, path, 0, 0); 91471f572a9SQu Wenruo path->lowest_level = 0; 9155d4f98a2SYan Zheng if (ret < 0) { 91600246528SJosef Bacik btrfs_put_root(root); 9175d4f98a2SYan Zheng err = ret; 9185d4f98a2SYan Zheng goto out; 9195d4f98a2SYan Zheng } 92071f572a9SQu Wenruo if (ret > 0 && path->slots[level] > 0) 92171f572a9SQu Wenruo path->slots[level]--; 9225d4f98a2SYan Zheng 92371f572a9SQu Wenruo eb = path->nodes[level]; 92471f572a9SQu Wenruo if (btrfs_node_blockptr(eb, path->slots[level]) != 9253561b9dbSLiu Bo cur->bytenr) { 9263561b9dbSLiu Bo btrfs_err(root->fs_info, 9273561b9dbSLiu Bo "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)", 9284fd786e6SMisono Tomohiro cur->bytenr, level - 1, 9294fd786e6SMisono Tomohiro root->root_key.objectid, 9303561b9dbSLiu Bo node_key->objectid, node_key->type, 9313561b9dbSLiu Bo node_key->offset); 93200246528SJosef Bacik btrfs_put_root(root); 9333561b9dbSLiu Bo err = -ENOENT; 9343561b9dbSLiu Bo goto out; 9353561b9dbSLiu Bo } 9365d4f98a2SYan Zheng lower = cur; 937b6c60c80SJosef Bacik need_check = true; 938fa6ac715SQu Wenruo 939fa6ac715SQu Wenruo /* Add all nodes and edges in the path */ 9405d4f98a2SYan Zheng for (; level < BTRFS_MAX_LEVEL; level++) { 94171f572a9SQu Wenruo if (!path->nodes[level]) { 94275bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 9435d4f98a2SYan Zheng lower->bytenr); 9440b530bc5SJosef Bacik if (should_ignore_root(root)) { 94500246528SJosef Bacik btrfs_put_root(root); 94684780289SQu Wenruo list_add(&lower->list, 94784780289SQu Wenruo &cache->useless_node); 9480b530bc5SJosef Bacik } else { 9495d4f98a2SYan Zheng lower->root = root; 9500b530bc5SJosef Bacik } 9515d4f98a2SYan Zheng break; 9525d4f98a2SYan Zheng } 9535d4f98a2SYan Zheng 9543fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 9555d4f98a2SYan Zheng if (!edge) { 95600246528SJosef Bacik btrfs_put_root(root); 9575d4f98a2SYan Zheng err = -ENOMEM; 9585d4f98a2SYan Zheng goto out; 9595d4f98a2SYan Zheng } 9605d4f98a2SYan Zheng 96171f572a9SQu Wenruo eb = path->nodes[level]; 9625d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, eb->start); 9635d4f98a2SYan Zheng if (!rb_node) { 9643fd0a558SYan, Zheng upper = alloc_backref_node(cache); 9655d4f98a2SYan Zheng if (!upper) { 96600246528SJosef Bacik btrfs_put_root(root); 9673fd0a558SYan, Zheng free_backref_edge(cache, edge); 9685d4f98a2SYan Zheng err = -ENOMEM; 9695d4f98a2SYan Zheng goto out; 9705d4f98a2SYan Zheng } 9715d4f98a2SYan Zheng upper->bytenr = eb->start; 9725d4f98a2SYan Zheng upper->owner = btrfs_header_owner(eb); 9735d4f98a2SYan Zheng upper->level = lower->level + 1; 97427cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, 97527cdeb70SMiao Xie &root->state)) 9763fd0a558SYan, Zheng upper->cowonly = 1; 9775d4f98a2SYan Zheng 9785d4f98a2SYan Zheng /* 9795d4f98a2SYan Zheng * if we know the block isn't shared 9805d4f98a2SYan Zheng * we can void checking its backrefs. 9815d4f98a2SYan Zheng */ 9825d4f98a2SYan Zheng if (btrfs_block_can_be_shared(root, eb)) 9835d4f98a2SYan Zheng upper->checked = 0; 9845d4f98a2SYan Zheng else 9855d4f98a2SYan Zheng upper->checked = 1; 9865d4f98a2SYan Zheng 9875d4f98a2SYan Zheng /* 9885d4f98a2SYan Zheng * add the block to pending list if we 989b6c60c80SJosef Bacik * need check its backrefs, we only do this once 990b6c60c80SJosef Bacik * while walking up a tree as we will catch 991b6c60c80SJosef Bacik * anything else later on. 9925d4f98a2SYan Zheng */ 993b6c60c80SJosef Bacik if (!upper->checked && need_check) { 994b6c60c80SJosef Bacik need_check = false; 9955d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], 99684780289SQu Wenruo &cache->pending_edge); 997bbe90514SJosef Bacik } else { 998bbe90514SJosef Bacik if (upper->checked) 999bbe90514SJosef Bacik need_check = true; 10005d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 1001bbe90514SJosef Bacik } 10025d4f98a2SYan Zheng } else { 10035d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 10045d4f98a2SYan Zheng rb_node); 100575bfb9afSJosef Bacik ASSERT(upper->checked); 10065d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 10073fd0a558SYan, Zheng if (!upper->owner) 10083fd0a558SYan, Zheng upper->owner = btrfs_header_owner(eb); 10095d4f98a2SYan Zheng } 10105d4f98a2SYan Zheng list_add_tail(&edge->list[LOWER], &lower->upper); 10115d4f98a2SYan Zheng edge->node[LOWER] = lower; 10123fd0a558SYan, Zheng edge->node[UPPER] = upper; 10135d4f98a2SYan Zheng 10140b530bc5SJosef Bacik if (rb_node) { 101500246528SJosef Bacik btrfs_put_root(root); 10165d4f98a2SYan Zheng break; 10170b530bc5SJosef Bacik } 10185d4f98a2SYan Zheng lower = upper; 10195d4f98a2SYan Zheng upper = NULL; 10205d4f98a2SYan Zheng } 102171f572a9SQu Wenruo btrfs_release_path(path); 10225d4f98a2SYan Zheng } 102371f572a9SQu Wenruo if (ret < 0) { 102471f572a9SQu Wenruo err = ret; 102571f572a9SQu Wenruo goto out; 10265d4f98a2SYan Zheng } 102771f572a9SQu Wenruo ret = 0; 102871f572a9SQu Wenruo btrfs_backref_iter_release(iter); 10295d4f98a2SYan Zheng 10305d4f98a2SYan Zheng cur->checked = 1; 10315d4f98a2SYan Zheng WARN_ON(exist); 10325d4f98a2SYan Zheng 10335d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 103484780289SQu Wenruo if (!list_empty(&cache->pending_edge)) { 103584780289SQu Wenruo edge = list_first_entry(&cache->pending_edge, 103684780289SQu Wenruo struct backref_edge, list[UPPER]); 10375d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10385d4f98a2SYan Zheng cur = edge->node[UPPER]; 10395d4f98a2SYan Zheng goto again; 10405d4f98a2SYan Zheng } 10415d4f98a2SYan Zheng 10425d4f98a2SYan Zheng /* 10435d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 10445d4f98a2SYan Zheng * into the cache. 10455d4f98a2SYan Zheng */ 104675bfb9afSJosef Bacik ASSERT(node->checked); 10473fd0a558SYan, Zheng cowonly = node->cowonly; 10483fd0a558SYan, Zheng if (!cowonly) { 10493fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 10503fd0a558SYan, Zheng &node->rb_node); 105143c04fb1SJeff Mahoney if (rb_node) 105243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 10533fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 10543fd0a558SYan, Zheng } 10555d4f98a2SYan Zheng 10565d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 105784780289SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 10585d4f98a2SYan Zheng 105984780289SQu Wenruo while (!list_empty(&cache->pending_edge)) { 106084780289SQu Wenruo edge = list_first_entry(&cache->pending_edge, 106184780289SQu Wenruo struct backref_edge, list[UPPER]); 10625d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10635d4f98a2SYan Zheng upper = edge->node[UPPER]; 10643fd0a558SYan, Zheng if (upper->detached) { 10653fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10663fd0a558SYan, Zheng lower = edge->node[LOWER]; 10673fd0a558SYan, Zheng free_backref_edge(cache, edge); 10683fd0a558SYan, Zheng if (list_empty(&lower->upper)) 106984780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 10703fd0a558SYan, Zheng continue; 10713fd0a558SYan, Zheng } 10725d4f98a2SYan Zheng 10735d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 10745d4f98a2SYan Zheng if (upper->lowest) { 10755d4f98a2SYan Zheng list_del_init(&upper->lower); 10765d4f98a2SYan Zheng upper->lowest = 0; 10775d4f98a2SYan Zheng } 10785d4f98a2SYan Zheng 10795d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10805d4f98a2SYan Zheng continue; 10815d4f98a2SYan Zheng } 10825d4f98a2SYan Zheng 108375bfb9afSJosef Bacik if (!upper->checked) { 108475bfb9afSJosef Bacik /* 108575bfb9afSJosef Bacik * Still want to blow up for developers since this is a 108675bfb9afSJosef Bacik * logic bug. 108775bfb9afSJosef Bacik */ 108875bfb9afSJosef Bacik ASSERT(0); 108975bfb9afSJosef Bacik err = -EINVAL; 109075bfb9afSJosef Bacik goto out; 109175bfb9afSJosef Bacik } 109275bfb9afSJosef Bacik if (cowonly != upper->cowonly) { 109375bfb9afSJosef Bacik ASSERT(0); 109475bfb9afSJosef Bacik err = -EINVAL; 109575bfb9afSJosef Bacik goto out; 109675bfb9afSJosef Bacik } 109775bfb9afSJosef Bacik 10983fd0a558SYan, Zheng if (!cowonly) { 10995d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 11005d4f98a2SYan Zheng &upper->rb_node); 110143c04fb1SJeff Mahoney if (rb_node) 110243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 110343c04fb1SJeff Mahoney upper->bytenr); 11043fd0a558SYan, Zheng } 11055d4f98a2SYan Zheng 11065d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 11075d4f98a2SYan Zheng 11085d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 110984780289SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 11105d4f98a2SYan Zheng } 11113fd0a558SYan, Zheng /* 11123fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 11133fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 11143fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 11153fd0a558SYan, Zheng * lookup. 11163fd0a558SYan, Zheng */ 111784780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 111884780289SQu Wenruo upper = list_first_entry(&cache->useless_node, 111984780289SQu Wenruo struct backref_node, list); 11203fd0a558SYan, Zheng list_del_init(&upper->list); 112175bfb9afSJosef Bacik ASSERT(list_empty(&upper->upper)); 11223fd0a558SYan, Zheng if (upper == node) 11233fd0a558SYan, Zheng node = NULL; 11243fd0a558SYan, Zheng if (upper->lowest) { 11253fd0a558SYan, Zheng list_del_init(&upper->lower); 11263fd0a558SYan, Zheng upper->lowest = 0; 11273fd0a558SYan, Zheng } 11283fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 112984780289SQu Wenruo edge = list_first_entry(&upper->lower, 11303fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 11313fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 11323fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11333fd0a558SYan, Zheng lower = edge->node[LOWER]; 11343fd0a558SYan, Zheng free_backref_edge(cache, edge); 11353fd0a558SYan, Zheng 11363fd0a558SYan, Zheng if (list_empty(&lower->upper)) 113784780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 11383fd0a558SYan, Zheng } 11399569cc20SQu Wenruo mark_block_processed(rc, upper); 11403fd0a558SYan, Zheng if (upper->level > 0) { 11413fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 11423fd0a558SYan, Zheng upper->detached = 1; 11433fd0a558SYan, Zheng } else { 11443fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 11453fd0a558SYan, Zheng free_backref_node(cache, upper); 11463fd0a558SYan, Zheng } 11473fd0a558SYan, Zheng } 11485d4f98a2SYan Zheng out: 114971f572a9SQu Wenruo btrfs_backref_iter_free(iter); 115071f572a9SQu Wenruo btrfs_free_path(path); 11515d4f98a2SYan Zheng if (err) { 115284780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 115384780289SQu Wenruo lower = list_first_entry(&cache->useless_node, 115475bfb9afSJosef Bacik struct backref_node, list); 115575bfb9afSJosef Bacik list_del_init(&lower->list); 11563fd0a558SYan, Zheng } 115784780289SQu Wenruo while (!list_empty(&cache->pending_edge)) { 115884780289SQu Wenruo edge = list_first_entry(&cache->pending_edge, 115984780289SQu Wenruo struct backref_edge, list[UPPER]); 116075bfb9afSJosef Bacik list_del(&edge->list[UPPER]); 11613fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 116275bfb9afSJosef Bacik lower = edge->node[LOWER]; 11635d4f98a2SYan Zheng upper = edge->node[UPPER]; 11643fd0a558SYan, Zheng free_backref_edge(cache, edge); 116575bfb9afSJosef Bacik 116675bfb9afSJosef Bacik /* 116775bfb9afSJosef Bacik * Lower is no longer linked to any upper backref nodes 116875bfb9afSJosef Bacik * and isn't in the cache, we can free it ourselves. 116975bfb9afSJosef Bacik */ 117075bfb9afSJosef Bacik if (list_empty(&lower->upper) && 117175bfb9afSJosef Bacik RB_EMPTY_NODE(&lower->rb_node)) 117284780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 117375bfb9afSJosef Bacik 117475bfb9afSJosef Bacik if (!RB_EMPTY_NODE(&upper->rb_node)) 117575bfb9afSJosef Bacik continue; 117675bfb9afSJosef Bacik 117701327610SNicholas D Steeves /* Add this guy's upper edges to the list to process */ 117875bfb9afSJosef Bacik list_for_each_entry(edge, &upper->upper, list[LOWER]) 117984780289SQu Wenruo list_add_tail(&edge->list[UPPER], 118084780289SQu Wenruo &cache->pending_edge); 118175bfb9afSJosef Bacik if (list_empty(&upper->upper)) 118284780289SQu Wenruo list_add(&upper->list, &cache->useless_node); 118375bfb9afSJosef Bacik } 118475bfb9afSJosef Bacik 118584780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 118684780289SQu Wenruo lower = list_first_entry(&cache->useless_node, 118775bfb9afSJosef Bacik struct backref_node, list); 118875bfb9afSJosef Bacik list_del_init(&lower->list); 11890fd8c3daSLiu Bo if (lower == node) 11900fd8c3daSLiu Bo node = NULL; 119175bfb9afSJosef Bacik free_backref_node(cache, lower); 11925d4f98a2SYan Zheng } 11930fd8c3daSLiu Bo 11948e19c973SJosef Bacik remove_backref_node(cache, node); 119584780289SQu Wenruo ASSERT(list_empty(&cache->useless_node) && 119684780289SQu Wenruo list_empty(&cache->pending_edge)); 11975d4f98a2SYan Zheng return ERR_PTR(err); 11985d4f98a2SYan Zheng } 119975bfb9afSJosef Bacik ASSERT(!node || !node->detached); 120084780289SQu Wenruo ASSERT(list_empty(&cache->useless_node) && 120184780289SQu Wenruo list_empty(&cache->pending_edge)); 12025d4f98a2SYan Zheng return node; 12035d4f98a2SYan Zheng } 12045d4f98a2SYan Zheng 12055d4f98a2SYan Zheng /* 12063fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 12073fd0a558SYan, Zheng * the backref node is created by cloning backref node that 12083fd0a558SYan, Zheng * corresponds to root of source tree 12093fd0a558SYan, Zheng */ 12103fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 12113fd0a558SYan, Zheng struct reloc_control *rc, 12123fd0a558SYan, Zheng struct btrfs_root *src, 12133fd0a558SYan, Zheng struct btrfs_root *dest) 12143fd0a558SYan, Zheng { 12153fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 12163fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 12173fd0a558SYan, Zheng struct backref_node *node = NULL; 12183fd0a558SYan, Zheng struct backref_node *new_node; 12193fd0a558SYan, Zheng struct backref_edge *edge; 12203fd0a558SYan, Zheng struct backref_edge *new_edge; 12213fd0a558SYan, Zheng struct rb_node *rb_node; 12223fd0a558SYan, Zheng 12233fd0a558SYan, Zheng if (cache->last_trans > 0) 12243fd0a558SYan, Zheng update_backref_cache(trans, cache); 12253fd0a558SYan, Zheng 12263fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 12273fd0a558SYan, Zheng if (rb_node) { 12283fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 12293fd0a558SYan, Zheng if (node->detached) 12303fd0a558SYan, Zheng node = NULL; 12313fd0a558SYan, Zheng else 12323fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 12333fd0a558SYan, Zheng } 12343fd0a558SYan, Zheng 12353fd0a558SYan, Zheng if (!node) { 12363fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 12373fd0a558SYan, Zheng reloc_root->commit_root->start); 12383fd0a558SYan, Zheng if (rb_node) { 12393fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 12403fd0a558SYan, Zheng rb_node); 12413fd0a558SYan, Zheng BUG_ON(node->detached); 12423fd0a558SYan, Zheng } 12433fd0a558SYan, Zheng } 12443fd0a558SYan, Zheng 12453fd0a558SYan, Zheng if (!node) 12463fd0a558SYan, Zheng return 0; 12473fd0a558SYan, Zheng 12483fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 12493fd0a558SYan, Zheng if (!new_node) 12503fd0a558SYan, Zheng return -ENOMEM; 12513fd0a558SYan, Zheng 12523fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 12533fd0a558SYan, Zheng new_node->level = node->level; 12543fd0a558SYan, Zheng new_node->lowest = node->lowest; 12556848ad64SYan, Zheng new_node->checked = 1; 125600246528SJosef Bacik new_node->root = btrfs_grab_root(dest); 12570b530bc5SJosef Bacik ASSERT(new_node->root); 12583fd0a558SYan, Zheng 12593fd0a558SYan, Zheng if (!node->lowest) { 12603fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 12613fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 12623fd0a558SYan, Zheng if (!new_edge) 12633fd0a558SYan, Zheng goto fail; 12643fd0a558SYan, Zheng 12653fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 12663fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 12673fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 12683fd0a558SYan, Zheng &new_node->lower); 12693fd0a558SYan, Zheng } 127076b9e23dSMiao Xie } else { 127176b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 12723fd0a558SYan, Zheng } 12733fd0a558SYan, Zheng 12743fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 12753fd0a558SYan, Zheng &new_node->rb_node); 127643c04fb1SJeff Mahoney if (rb_node) 127743c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 12783fd0a558SYan, Zheng 12793fd0a558SYan, Zheng if (!new_node->lowest) { 12803fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 12813fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 12823fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 12833fd0a558SYan, Zheng } 12843fd0a558SYan, Zheng } 12853fd0a558SYan, Zheng return 0; 12863fd0a558SYan, Zheng fail: 12873fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 12883fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 12893fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 12903fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 12913fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 12923fd0a558SYan, Zheng } 12933fd0a558SYan, Zheng free_backref_node(cache, new_node); 12943fd0a558SYan, Zheng return -ENOMEM; 12953fd0a558SYan, Zheng } 12963fd0a558SYan, Zheng 12973fd0a558SYan, Zheng /* 12985d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 12995d4f98a2SYan Zheng */ 1300ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 13015d4f98a2SYan Zheng { 13020b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 13035d4f98a2SYan Zheng struct rb_node *rb_node; 13045d4f98a2SYan Zheng struct mapping_node *node; 13050b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 13065d4f98a2SYan Zheng 13075d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1308ffd7b339SJeff Mahoney if (!node) 1309ffd7b339SJeff Mahoney return -ENOMEM; 13105d4f98a2SYan Zheng 1311ea287ab1SJosef Bacik node->bytenr = root->commit_root->start; 13125d4f98a2SYan Zheng node->data = root; 13135d4f98a2SYan Zheng 13145d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13155d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13165d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13175d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1318ffd7b339SJeff Mahoney if (rb_node) { 13190b246afaSJeff Mahoney btrfs_panic(fs_info, -EEXIST, 13205d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 13215d163e0eSJeff Mahoney node->bytenr); 1322ffd7b339SJeff Mahoney } 13235d4f98a2SYan Zheng 13245d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 13255d4f98a2SYan Zheng return 0; 13265d4f98a2SYan Zheng } 13275d4f98a2SYan Zheng 13285d4f98a2SYan Zheng /* 1329c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 13305d4f98a2SYan Zheng * mapping 13315d4f98a2SYan Zheng */ 1332c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 13335d4f98a2SYan Zheng { 13340b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 13355d4f98a2SYan Zheng struct rb_node *rb_node; 13365d4f98a2SYan Zheng struct mapping_node *node = NULL; 13370b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1338f44deb74SJosef Bacik bool put_ref = false; 13395d4f98a2SYan Zheng 134065c6e82bSQu Wenruo if (rc && root->node) { 13415d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13425d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1343ea287ab1SJosef Bacik root->commit_root->start); 1344c974c464SWang Shilong if (rb_node) { 1345c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1346c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1347ea287ab1SJosef Bacik RB_CLEAR_NODE(&node->rb_node); 1348c974c464SWang Shilong } 1349c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1350c974c464SWang Shilong if (!node) 1351c974c464SWang Shilong return; 1352c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1353389305b2SQu Wenruo } 1354c974c464SWang Shilong 1355f44deb74SJosef Bacik /* 1356f44deb74SJosef Bacik * We only put the reloc root here if it's on the list. There's a lot 1357f44deb74SJosef Bacik * of places where the pattern is to splice the rc->reloc_roots, process 1358f44deb74SJosef Bacik * the reloc roots, and then add the reloc root back onto 1359f44deb74SJosef Bacik * rc->reloc_roots. If we call __del_reloc_root while it's off of the 1360f44deb74SJosef Bacik * list we don't want the reference being dropped, because the guy 1361f44deb74SJosef Bacik * messing with the list is in charge of the reference. 1362f44deb74SJosef Bacik */ 13630b246afaSJeff Mahoney spin_lock(&fs_info->trans_lock); 1364f44deb74SJosef Bacik if (!list_empty(&root->root_list)) { 1365f44deb74SJosef Bacik put_ref = true; 1366c974c464SWang Shilong list_del_init(&root->root_list); 1367f44deb74SJosef Bacik } 13680b246afaSJeff Mahoney spin_unlock(&fs_info->trans_lock); 1369f44deb74SJosef Bacik if (put_ref) 1370f44deb74SJosef Bacik btrfs_put_root(root); 1371c974c464SWang Shilong kfree(node); 1372c974c464SWang Shilong } 1373c974c464SWang Shilong 1374c974c464SWang Shilong /* 1375c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1376c974c464SWang Shilong * mapping 1377c974c464SWang Shilong */ 1378ea287ab1SJosef Bacik static int __update_reloc_root(struct btrfs_root *root) 1379c974c464SWang Shilong { 13800b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 1381c974c464SWang Shilong struct rb_node *rb_node; 1382c974c464SWang Shilong struct mapping_node *node = NULL; 13830b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1384c974c464SWang Shilong 1385c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1386c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1387ea287ab1SJosef Bacik root->commit_root->start); 13885d4f98a2SYan Zheng if (rb_node) { 13895d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 13905d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 13915d4f98a2SYan Zheng } 13925d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 13935d4f98a2SYan Zheng 13948f71f3e0SLiu Bo if (!node) 13958f71f3e0SLiu Bo return 0; 13965d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 13975d4f98a2SYan Zheng 13985d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1399ea287ab1SJosef Bacik node->bytenr = root->node->start; 14005d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 14015d4f98a2SYan Zheng node->bytenr, &node->rb_node); 14025d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 140343c04fb1SJeff Mahoney if (rb_node) 140443c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 14055d4f98a2SYan Zheng return 0; 14065d4f98a2SYan Zheng } 14075d4f98a2SYan Zheng 14083fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 14093fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 14105d4f98a2SYan Zheng { 14110b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14125d4f98a2SYan Zheng struct btrfs_root *reloc_root; 14135d4f98a2SYan Zheng struct extent_buffer *eb; 14145d4f98a2SYan Zheng struct btrfs_root_item *root_item; 14155d4f98a2SYan Zheng struct btrfs_key root_key; 14165d4f98a2SYan Zheng int ret; 14175d4f98a2SYan Zheng 14185d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 14195d4f98a2SYan Zheng BUG_ON(!root_item); 14205d4f98a2SYan Zheng 14215d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 14225d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 14233fd0a558SYan, Zheng root_key.offset = objectid; 14245d4f98a2SYan Zheng 14253fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 1426054570a1SFilipe Manana u64 commit_root_gen; 1427054570a1SFilipe Manana 14283fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 14295d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 14305d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 14315d4f98a2SYan Zheng BUG_ON(ret); 1432054570a1SFilipe Manana /* 1433054570a1SFilipe Manana * Set the last_snapshot field to the generation of the commit 1434054570a1SFilipe Manana * root - like this ctree.c:btrfs_block_can_be_shared() behaves 1435054570a1SFilipe Manana * correctly (returns true) when the relocation root is created 1436054570a1SFilipe Manana * either inside the critical section of a transaction commit 1437054570a1SFilipe Manana * (through transaction.c:qgroup_account_snapshot()) and when 1438054570a1SFilipe Manana * it's created before the transaction commit is started. 1439054570a1SFilipe Manana */ 1440054570a1SFilipe Manana commit_root_gen = btrfs_header_generation(root->commit_root); 1441054570a1SFilipe Manana btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); 14423fd0a558SYan, Zheng } else { 14433fd0a558SYan, Zheng /* 14443fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 14453fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 14463fd0a558SYan, Zheng * modified after it was created have RELOC flag 14473fd0a558SYan, Zheng * set in their headers. so it's OK to not update 14483fd0a558SYan, Zheng * the 'last_snapshot'. 14493fd0a558SYan, Zheng */ 14503fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 14513fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 14523fd0a558SYan, Zheng BUG_ON(ret); 14533fd0a558SYan, Zheng } 14543fd0a558SYan, Zheng 14555d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 14565d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 14575d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 14585d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 14593fd0a558SYan, Zheng 14603fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 14613fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 14623fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 14633fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 14645d4f98a2SYan Zheng root_item->drop_level = 0; 14653fd0a558SYan, Zheng } 14665d4f98a2SYan Zheng 14675d4f98a2SYan Zheng btrfs_tree_unlock(eb); 14685d4f98a2SYan Zheng free_extent_buffer(eb); 14695d4f98a2SYan Zheng 14700b246afaSJeff Mahoney ret = btrfs_insert_root(trans, fs_info->tree_root, 14715d4f98a2SYan Zheng &root_key, root_item); 14725d4f98a2SYan Zheng BUG_ON(ret); 14735d4f98a2SYan Zheng kfree(root_item); 14745d4f98a2SYan Zheng 14753dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(fs_info->tree_root, &root_key); 14765d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 14773dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 14785d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 14793fd0a558SYan, Zheng return reloc_root; 14803fd0a558SYan, Zheng } 14813fd0a558SYan, Zheng 14823fd0a558SYan, Zheng /* 14833fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 14843fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 1485f44deb74SJosef Bacik * 1486f44deb74SJosef Bacik * The reloc_root comes out of here with two references, one for 1487f44deb74SJosef Bacik * root->reloc_root, and another for being on the rc->reloc_roots list. 14883fd0a558SYan, Zheng */ 14893fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 14903fd0a558SYan, Zheng struct btrfs_root *root) 14913fd0a558SYan, Zheng { 14920b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14933fd0a558SYan, Zheng struct btrfs_root *reloc_root; 14940b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 149520dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 14963fd0a558SYan, Zheng int clear_rsv = 0; 1497ffd7b339SJeff Mahoney int ret; 14983fd0a558SYan, Zheng 1499aec7db3bSJosef Bacik if (!rc) 15002abc726aSJosef Bacik return 0; 15012abc726aSJosef Bacik 15021fac4a54SQu Wenruo /* 15031fac4a54SQu Wenruo * The subvolume has reloc tree but the swap is finished, no need to 15041fac4a54SQu Wenruo * create/update the dead reloc tree 15051fac4a54SQu Wenruo */ 15066282675eSQu Wenruo if (reloc_root_is_dead(root)) 15071fac4a54SQu Wenruo return 0; 15081fac4a54SQu Wenruo 1509aec7db3bSJosef Bacik /* 1510aec7db3bSJosef Bacik * This is subtle but important. We do not do 1511aec7db3bSJosef Bacik * record_root_in_transaction for reloc roots, instead we record their 1512aec7db3bSJosef Bacik * corresponding fs root, and then here we update the last trans for the 1513aec7db3bSJosef Bacik * reloc root. This means that we have to do this for the entire life 1514aec7db3bSJosef Bacik * of the reloc root, regardless of which stage of the relocation we are 1515aec7db3bSJosef Bacik * in. 1516aec7db3bSJosef Bacik */ 15173fd0a558SYan, Zheng if (root->reloc_root) { 15183fd0a558SYan, Zheng reloc_root = root->reloc_root; 15193fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 15203fd0a558SYan, Zheng return 0; 15213fd0a558SYan, Zheng } 15223fd0a558SYan, Zheng 1523aec7db3bSJosef Bacik /* 1524aec7db3bSJosef Bacik * We are merging reloc roots, we do not need new reloc trees. Also 1525aec7db3bSJosef Bacik * reloc trees never need their own reloc tree. 1526aec7db3bSJosef Bacik */ 1527aec7db3bSJosef Bacik if (!rc->create_reloc_tree || 1528aec7db3bSJosef Bacik root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 1529aec7db3bSJosef Bacik return 0; 1530aec7db3bSJosef Bacik 153120dd2cbfSMiao Xie if (!trans->reloc_reserved) { 153220dd2cbfSMiao Xie rsv = trans->block_rsv; 15333fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 15343fd0a558SYan, Zheng clear_rsv = 1; 15353fd0a558SYan, Zheng } 15363fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 15373fd0a558SYan, Zheng if (clear_rsv) 153820dd2cbfSMiao Xie trans->block_rsv = rsv; 15395d4f98a2SYan Zheng 1540ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1541ffd7b339SJeff Mahoney BUG_ON(ret < 0); 1542f44deb74SJosef Bacik root->reloc_root = btrfs_grab_root(reloc_root); 15435d4f98a2SYan Zheng return 0; 15445d4f98a2SYan Zheng } 15455d4f98a2SYan Zheng 15465d4f98a2SYan Zheng /* 15475d4f98a2SYan Zheng * update root item of reloc tree 15485d4f98a2SYan Zheng */ 15495d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 15505d4f98a2SYan Zheng struct btrfs_root *root) 15515d4f98a2SYan Zheng { 15520b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 15535d4f98a2SYan Zheng struct btrfs_root *reloc_root; 15545d4f98a2SYan Zheng struct btrfs_root_item *root_item; 15555d4f98a2SYan Zheng int ret; 15565d4f98a2SYan Zheng 15576282675eSQu Wenruo if (!have_reloc_root(root)) 15587585717fSChris Mason goto out; 15595d4f98a2SYan Zheng 15605d4f98a2SYan Zheng reloc_root = root->reloc_root; 15615d4f98a2SYan Zheng root_item = &reloc_root->root_item; 15625d4f98a2SYan Zheng 1563f44deb74SJosef Bacik /* 1564f44deb74SJosef Bacik * We are probably ok here, but __del_reloc_root() will drop its ref of 1565f44deb74SJosef Bacik * the root. We have the ref for root->reloc_root, but just in case 1566f44deb74SJosef Bacik * hold it while we update the reloc root. 1567f44deb74SJosef Bacik */ 1568f44deb74SJosef Bacik btrfs_grab_root(reloc_root); 1569f44deb74SJosef Bacik 1570d2311e69SQu Wenruo /* root->reloc_root will stay until current relocation finished */ 15710b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 15723fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 1573d2311e69SQu Wenruo set_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 15746282675eSQu Wenruo /* 15756282675eSQu Wenruo * Mark the tree as dead before we change reloc_root so 15766282675eSQu Wenruo * have_reloc_root will not touch it from now on. 15776282675eSQu Wenruo */ 15786282675eSQu Wenruo smp_wmb(); 1579c974c464SWang Shilong __del_reloc_root(reloc_root); 15805d4f98a2SYan Zheng } 15815d4f98a2SYan Zheng 15825d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 1583ea287ab1SJosef Bacik __update_reloc_root(reloc_root); 15845d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 15855d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 15865d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 15875d4f98a2SYan Zheng } 15885d4f98a2SYan Zheng 15890b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 15905d4f98a2SYan Zheng &reloc_root->root_key, root_item); 15915d4f98a2SYan Zheng BUG_ON(ret); 1592f44deb74SJosef Bacik btrfs_put_root(reloc_root); 15937585717fSChris Mason out: 15945d4f98a2SYan Zheng return 0; 15955d4f98a2SYan Zheng } 15965d4f98a2SYan Zheng 15975d4f98a2SYan Zheng /* 15985d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 15995d4f98a2SYan Zheng * in a subvolume 16005d4f98a2SYan Zheng */ 16015d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 16025d4f98a2SYan Zheng { 16035d4f98a2SYan Zheng struct rb_node *node; 16045d4f98a2SYan Zheng struct rb_node *prev; 16055d4f98a2SYan Zheng struct btrfs_inode *entry; 16065d4f98a2SYan Zheng struct inode *inode; 16075d4f98a2SYan Zheng 16085d4f98a2SYan Zheng spin_lock(&root->inode_lock); 16095d4f98a2SYan Zheng again: 16105d4f98a2SYan Zheng node = root->inode_tree.rb_node; 16115d4f98a2SYan Zheng prev = NULL; 16125d4f98a2SYan Zheng while (node) { 16135d4f98a2SYan Zheng prev = node; 16145d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 16155d4f98a2SYan Zheng 16164a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 16175d4f98a2SYan Zheng node = node->rb_left; 16184a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 16195d4f98a2SYan Zheng node = node->rb_right; 16205d4f98a2SYan Zheng else 16215d4f98a2SYan Zheng break; 16225d4f98a2SYan Zheng } 16235d4f98a2SYan Zheng if (!node) { 16245d4f98a2SYan Zheng while (prev) { 16255d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 16264a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 16275d4f98a2SYan Zheng node = prev; 16285d4f98a2SYan Zheng break; 16295d4f98a2SYan Zheng } 16305d4f98a2SYan Zheng prev = rb_next(prev); 16315d4f98a2SYan Zheng } 16325d4f98a2SYan Zheng } 16335d4f98a2SYan Zheng while (node) { 16345d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 16355d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 16365d4f98a2SYan Zheng if (inode) { 16375d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 16385d4f98a2SYan Zheng return inode; 16395d4f98a2SYan Zheng } 16405d4f98a2SYan Zheng 16414a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 16425d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 16435d4f98a2SYan Zheng goto again; 16445d4f98a2SYan Zheng 16455d4f98a2SYan Zheng node = rb_next(node); 16465d4f98a2SYan Zheng } 16475d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 16485d4f98a2SYan Zheng return NULL; 16495d4f98a2SYan Zheng } 16505d4f98a2SYan Zheng 16515d4f98a2SYan Zheng /* 16525d4f98a2SYan Zheng * get new location of data 16535d4f98a2SYan Zheng */ 16545d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 16555d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 16565d4f98a2SYan Zheng { 16575d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 16585d4f98a2SYan Zheng struct btrfs_path *path; 16595d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 16605d4f98a2SYan Zheng struct extent_buffer *leaf; 16615d4f98a2SYan Zheng int ret; 16625d4f98a2SYan Zheng 16635d4f98a2SYan Zheng path = btrfs_alloc_path(); 16645d4f98a2SYan Zheng if (!path) 16655d4f98a2SYan Zheng return -ENOMEM; 16665d4f98a2SYan Zheng 16675d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 1668f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 1669f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 16705d4f98a2SYan Zheng if (ret < 0) 16715d4f98a2SYan Zheng goto out; 16725d4f98a2SYan Zheng if (ret > 0) { 16735d4f98a2SYan Zheng ret = -ENOENT; 16745d4f98a2SYan Zheng goto out; 16755d4f98a2SYan Zheng } 16765d4f98a2SYan Zheng 16775d4f98a2SYan Zheng leaf = path->nodes[0]; 16785d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 16795d4f98a2SYan Zheng struct btrfs_file_extent_item); 16805d4f98a2SYan Zheng 16815d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 16825d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 16835d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 16845d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 16855d4f98a2SYan Zheng 16865d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 168783d4cfd4SJosef Bacik ret = -EINVAL; 16885d4f98a2SYan Zheng goto out; 16895d4f98a2SYan Zheng } 16905d4f98a2SYan Zheng 16915d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16925d4f98a2SYan Zheng ret = 0; 16935d4f98a2SYan Zheng out: 16945d4f98a2SYan Zheng btrfs_free_path(path); 16955d4f98a2SYan Zheng return ret; 16965d4f98a2SYan Zheng } 16975d4f98a2SYan Zheng 16985d4f98a2SYan Zheng /* 16995d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 17005d4f98a2SYan Zheng * the new locations. 17015d4f98a2SYan Zheng */ 17023fd0a558SYan, Zheng static noinline_for_stack 17033fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 17045d4f98a2SYan Zheng struct reloc_control *rc, 17055d4f98a2SYan Zheng struct btrfs_root *root, 17063fd0a558SYan, Zheng struct extent_buffer *leaf) 17075d4f98a2SYan Zheng { 17080b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 17095d4f98a2SYan Zheng struct btrfs_key key; 17105d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 17115d4f98a2SYan Zheng struct inode *inode = NULL; 17125d4f98a2SYan Zheng u64 parent; 17135d4f98a2SYan Zheng u64 bytenr; 17143fd0a558SYan, Zheng u64 new_bytenr = 0; 17155d4f98a2SYan Zheng u64 num_bytes; 17165d4f98a2SYan Zheng u64 end; 17175d4f98a2SYan Zheng u32 nritems; 17185d4f98a2SYan Zheng u32 i; 171983d4cfd4SJosef Bacik int ret = 0; 17205d4f98a2SYan Zheng int first = 1; 17215d4f98a2SYan Zheng int dirty = 0; 17225d4f98a2SYan Zheng 17235d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 17245d4f98a2SYan Zheng return 0; 17255d4f98a2SYan Zheng 17265d4f98a2SYan Zheng /* reloc trees always use full backref */ 17275d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 17285d4f98a2SYan Zheng parent = leaf->start; 17295d4f98a2SYan Zheng else 17305d4f98a2SYan Zheng parent = 0; 17315d4f98a2SYan Zheng 17325d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 17335d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 173482fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 173582fa113fSQu Wenruo 17365d4f98a2SYan Zheng cond_resched(); 17375d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 17385d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 17395d4f98a2SYan Zheng continue; 17405d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 17415d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 17425d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 17435d4f98a2SYan Zheng continue; 17445d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 17455d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 17465d4f98a2SYan Zheng if (bytenr == 0) 17475d4f98a2SYan Zheng continue; 17489569cc20SQu Wenruo if (!in_range(bytenr, rc->block_group->start, 17499569cc20SQu Wenruo rc->block_group->length)) 17505d4f98a2SYan Zheng continue; 17515d4f98a2SYan Zheng 17525d4f98a2SYan Zheng /* 17535d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 17545d4f98a2SYan Zheng * to complete and drop the extent cache 17555d4f98a2SYan Zheng */ 17565d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 17575d4f98a2SYan Zheng if (first) { 17585d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 17595d4f98a2SYan Zheng first = 0; 17604a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 17613fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 17625d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 17635d4f98a2SYan Zheng } 17644a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 17655d4f98a2SYan Zheng end = key.offset + 17665d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 17675d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 17680b246afaSJeff Mahoney fs_info->sectorsize)); 17690b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 17705d4f98a2SYan Zheng end--; 17715d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1772d0082371SJeff Mahoney key.offset, end); 17735d4f98a2SYan Zheng if (!ret) 17745d4f98a2SYan Zheng continue; 17755d4f98a2SYan Zheng 1776dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1777dcdbc059SNikolay Borisov key.offset, end, 1); 17785d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1779d0082371SJeff Mahoney key.offset, end); 17805d4f98a2SYan Zheng } 17815d4f98a2SYan Zheng } 17825d4f98a2SYan Zheng 17835d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 17845d4f98a2SYan Zheng bytenr, num_bytes); 178583d4cfd4SJosef Bacik if (ret) { 178683d4cfd4SJosef Bacik /* 178783d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 178883d4cfd4SJosef Bacik * in the file extent yet. 178983d4cfd4SJosef Bacik */ 179083d4cfd4SJosef Bacik break; 17913fd0a558SYan, Zheng } 17925d4f98a2SYan Zheng 17935d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 17945d4f98a2SYan Zheng dirty = 1; 17955d4f98a2SYan Zheng 17965d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 179782fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 179882fa113fSQu Wenruo num_bytes, parent); 179982fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 180082fa113fSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1801b06c4bf5SFilipe Manana key.objectid, key.offset); 180282fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 180383d4cfd4SJosef Bacik if (ret) { 180466642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 180583d4cfd4SJosef Bacik break; 180683d4cfd4SJosef Bacik } 18075d4f98a2SYan Zheng 1808ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, bytenr, 1809ffd4bb2aSQu Wenruo num_bytes, parent); 1810ffd4bb2aSQu Wenruo ref.real_root = root->root_key.objectid; 1811ffd4bb2aSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1812b06c4bf5SFilipe Manana key.objectid, key.offset); 1813ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 181483d4cfd4SJosef Bacik if (ret) { 181566642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 181683d4cfd4SJosef Bacik break; 181783d4cfd4SJosef Bacik } 18185d4f98a2SYan Zheng } 18195d4f98a2SYan Zheng if (dirty) 18205d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 18213fd0a558SYan, Zheng if (inode) 18223fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 182383d4cfd4SJosef Bacik return ret; 18245d4f98a2SYan Zheng } 18255d4f98a2SYan Zheng 18265d4f98a2SYan Zheng static noinline_for_stack 18275d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 18285d4f98a2SYan Zheng struct btrfs_path *path, int level) 18295d4f98a2SYan Zheng { 18305d4f98a2SYan Zheng struct btrfs_disk_key key1; 18315d4f98a2SYan Zheng struct btrfs_disk_key key2; 18325d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 18335d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 18345d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 18355d4f98a2SYan Zheng } 18365d4f98a2SYan Zheng 18375d4f98a2SYan Zheng /* 18385d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 18395d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 18405d4f98a2SYan Zheng * reloc tree was create can be replaced. 18415d4f98a2SYan Zheng * 18425d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 18435d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 18445d4f98a2SYan Zheng * errors, a negative error number is returned. 18455d4f98a2SYan Zheng */ 18463fd0a558SYan, Zheng static noinline_for_stack 18473d0174f7SQu Wenruo int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, 18485d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 18495d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 18505d4f98a2SYan Zheng int lowest_level, int max_level) 18515d4f98a2SYan Zheng { 18520b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 18535d4f98a2SYan Zheng struct extent_buffer *eb; 18545d4f98a2SYan Zheng struct extent_buffer *parent; 185582fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 18565d4f98a2SYan Zheng struct btrfs_key key; 18575d4f98a2SYan Zheng u64 old_bytenr; 18585d4f98a2SYan Zheng u64 new_bytenr; 18595d4f98a2SYan Zheng u64 old_ptr_gen; 18605d4f98a2SYan Zheng u64 new_ptr_gen; 18615d4f98a2SYan Zheng u64 last_snapshot; 18625d4f98a2SYan Zheng u32 blocksize; 18633fd0a558SYan, Zheng int cow = 0; 18645d4f98a2SYan Zheng int level; 18655d4f98a2SYan Zheng int ret; 18665d4f98a2SYan Zheng int slot; 18675d4f98a2SYan Zheng 18685d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 18695d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 18705d4f98a2SYan Zheng 18715d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 18723fd0a558SYan, Zheng again: 18735d4f98a2SYan Zheng slot = path->slots[lowest_level]; 18745d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 18755d4f98a2SYan Zheng 18765d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 18778bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 18785d4f98a2SYan Zheng level = btrfs_header_level(eb); 18795d4f98a2SYan Zheng 18805d4f98a2SYan Zheng if (level < lowest_level) { 18815d4f98a2SYan Zheng btrfs_tree_unlock(eb); 18825d4f98a2SYan Zheng free_extent_buffer(eb); 18835d4f98a2SYan Zheng return 0; 18845d4f98a2SYan Zheng } 18855d4f98a2SYan Zheng 18863fd0a558SYan, Zheng if (cow) { 18875d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 18885d4f98a2SYan Zheng BUG_ON(ret); 18893fd0a558SYan, Zheng } 18908bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 18915d4f98a2SYan Zheng 18925d4f98a2SYan Zheng if (next_key) { 18935d4f98a2SYan Zheng next_key->objectid = (u64)-1; 18945d4f98a2SYan Zheng next_key->type = (u8)-1; 18955d4f98a2SYan Zheng next_key->offset = (u64)-1; 18965d4f98a2SYan Zheng } 18975d4f98a2SYan Zheng 18985d4f98a2SYan Zheng parent = eb; 18995d4f98a2SYan Zheng while (1) { 1900581c1760SQu Wenruo struct btrfs_key first_key; 1901581c1760SQu Wenruo 19025d4f98a2SYan Zheng level = btrfs_header_level(parent); 19035d4f98a2SYan Zheng BUG_ON(level < lowest_level); 19045d4f98a2SYan Zheng 19055d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 1906cbca7d59SFilipe Manana if (ret < 0) 1907cbca7d59SFilipe Manana break; 19085d4f98a2SYan Zheng if (ret && slot > 0) 19095d4f98a2SYan Zheng slot--; 19105d4f98a2SYan Zheng 19115d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 19125d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 19135d4f98a2SYan Zheng 19145d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 19150b246afaSJeff Mahoney blocksize = fs_info->nodesize; 19165d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 191717515f1bSQu Wenruo btrfs_node_key_to_cpu(parent, &first_key, slot); 19185d4f98a2SYan Zheng 19195d4f98a2SYan Zheng if (level <= max_level) { 19205d4f98a2SYan Zheng eb = path->nodes[level]; 19215d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 19225d4f98a2SYan Zheng path->slots[level]); 19235d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 19245d4f98a2SYan Zheng path->slots[level]); 19255d4f98a2SYan Zheng } else { 19265d4f98a2SYan Zheng new_bytenr = 0; 19275d4f98a2SYan Zheng new_ptr_gen = 0; 19285d4f98a2SYan Zheng } 19295d4f98a2SYan Zheng 1930fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 19315d4f98a2SYan Zheng ret = level; 19325d4f98a2SYan Zheng break; 19335d4f98a2SYan Zheng } 19345d4f98a2SYan Zheng 19355d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 19365d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 19373fd0a558SYan, Zheng if (level <= lowest_level) { 19385d4f98a2SYan Zheng ret = 0; 19395d4f98a2SYan Zheng break; 19405d4f98a2SYan Zheng } 19415d4f98a2SYan Zheng 1942581c1760SQu Wenruo eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen, 1943581c1760SQu Wenruo level - 1, &first_key); 194464c043deSLiu Bo if (IS_ERR(eb)) { 194564c043deSLiu Bo ret = PTR_ERR(eb); 1946264813acSLiu Bo break; 194764c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 194864c043deSLiu Bo ret = -EIO; 1949416bc658SJosef Bacik free_extent_buffer(eb); 1950379cde74SStefan Behrens break; 1951416bc658SJosef Bacik } 19525d4f98a2SYan Zheng btrfs_tree_lock(eb); 19533fd0a558SYan, Zheng if (cow) { 19545d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 19555d4f98a2SYan Zheng slot, &eb); 19565d4f98a2SYan Zheng BUG_ON(ret); 19575d4f98a2SYan Zheng } 19588bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19595d4f98a2SYan Zheng 19605d4f98a2SYan Zheng btrfs_tree_unlock(parent); 19615d4f98a2SYan Zheng free_extent_buffer(parent); 19625d4f98a2SYan Zheng 19635d4f98a2SYan Zheng parent = eb; 19645d4f98a2SYan Zheng continue; 19655d4f98a2SYan Zheng } 19665d4f98a2SYan Zheng 19673fd0a558SYan, Zheng if (!cow) { 19683fd0a558SYan, Zheng btrfs_tree_unlock(parent); 19693fd0a558SYan, Zheng free_extent_buffer(parent); 19703fd0a558SYan, Zheng cow = 1; 19713fd0a558SYan, Zheng goto again; 19723fd0a558SYan, Zheng } 19733fd0a558SYan, Zheng 19745d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 19755d4f98a2SYan Zheng path->slots[level]); 1976b3b4aa74SDavid Sterba btrfs_release_path(path); 19775d4f98a2SYan Zheng 19785d4f98a2SYan Zheng path->lowest_level = level; 19795d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 19805d4f98a2SYan Zheng path->lowest_level = 0; 19815d4f98a2SYan Zheng BUG_ON(ret); 19825d4f98a2SYan Zheng 19835d4f98a2SYan Zheng /* 1984824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 1985824d8dffSQu Wenruo * 1986824d8dffSQu Wenruo * We must trace both trees. 1987824d8dffSQu Wenruo * 1) Tree reloc subtree 1988824d8dffSQu Wenruo * If not traced, we will leak data numbers 1989824d8dffSQu Wenruo * 2) Fs subtree 1990824d8dffSQu Wenruo * If not traced, we will double count old data 1991f616f5cdSQu Wenruo * 1992f616f5cdSQu Wenruo * We don't scan the subtree right now, but only record 1993f616f5cdSQu Wenruo * the swapped tree blocks. 1994f616f5cdSQu Wenruo * The real subtree rescan is delayed until we have new 1995f616f5cdSQu Wenruo * CoW on the subtree root node before transaction commit. 1996824d8dffSQu Wenruo */ 1997370a11b8SQu Wenruo ret = btrfs_qgroup_add_swapped_blocks(trans, dest, 1998370a11b8SQu Wenruo rc->block_group, parent, slot, 1999370a11b8SQu Wenruo path->nodes[level], path->slots[level], 2000370a11b8SQu Wenruo last_snapshot); 2001370a11b8SQu Wenruo if (ret < 0) 2002370a11b8SQu Wenruo break; 2003824d8dffSQu Wenruo /* 20045d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 20055d4f98a2SYan Zheng */ 20065d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 20075d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 20085d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 20095d4f98a2SYan Zheng 20105d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 20115d4f98a2SYan Zheng path->slots[level], old_bytenr); 20125d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 20135d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 20145d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 20155d4f98a2SYan Zheng 201682fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, old_bytenr, 201782fa113fSQu Wenruo blocksize, path->nodes[level]->start); 201882fa113fSQu Wenruo ref.skip_qgroup = true; 201982fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 202082fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 20215d4f98a2SYan Zheng BUG_ON(ret); 202282fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 202382fa113fSQu Wenruo blocksize, 0); 202482fa113fSQu Wenruo ref.skip_qgroup = true; 202582fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 202682fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 20275d4f98a2SYan Zheng BUG_ON(ret); 20285d4f98a2SYan Zheng 2029ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, new_bytenr, 2030ffd4bb2aSQu Wenruo blocksize, path->nodes[level]->start); 2031ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 2032ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2033ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 20345d4f98a2SYan Zheng BUG_ON(ret); 20355d4f98a2SYan Zheng 2036ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, old_bytenr, 2037ffd4bb2aSQu Wenruo blocksize, 0); 2038ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 2039ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2040ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 20415d4f98a2SYan Zheng BUG_ON(ret); 20425d4f98a2SYan Zheng 20435d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 20445d4f98a2SYan Zheng 20455d4f98a2SYan Zheng ret = level; 20465d4f98a2SYan Zheng break; 20475d4f98a2SYan Zheng } 20485d4f98a2SYan Zheng btrfs_tree_unlock(parent); 20495d4f98a2SYan Zheng free_extent_buffer(parent); 20505d4f98a2SYan Zheng return ret; 20515d4f98a2SYan Zheng } 20525d4f98a2SYan Zheng 20535d4f98a2SYan Zheng /* 20545d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 20555d4f98a2SYan Zheng */ 20565d4f98a2SYan Zheng static noinline_for_stack 20575d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 20585d4f98a2SYan Zheng int *level) 20595d4f98a2SYan Zheng { 20605d4f98a2SYan Zheng struct extent_buffer *eb; 20615d4f98a2SYan Zheng int i; 20625d4f98a2SYan Zheng u64 last_snapshot; 20635d4f98a2SYan Zheng u32 nritems; 20645d4f98a2SYan Zheng 20655d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 20665d4f98a2SYan Zheng 20675d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 20685d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 20695d4f98a2SYan Zheng path->nodes[i] = NULL; 20705d4f98a2SYan Zheng } 20715d4f98a2SYan Zheng 20725d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 20735d4f98a2SYan Zheng eb = path->nodes[i]; 20745d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 20755d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 20765d4f98a2SYan Zheng path->slots[i]++; 20775d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 20785d4f98a2SYan Zheng last_snapshot) 20795d4f98a2SYan Zheng continue; 20805d4f98a2SYan Zheng 20815d4f98a2SYan Zheng *level = i; 20825d4f98a2SYan Zheng return 0; 20835d4f98a2SYan Zheng } 20845d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 20855d4f98a2SYan Zheng path->nodes[i] = NULL; 20865d4f98a2SYan Zheng } 20875d4f98a2SYan Zheng return 1; 20885d4f98a2SYan Zheng } 20895d4f98a2SYan Zheng 20905d4f98a2SYan Zheng /* 20915d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 20925d4f98a2SYan Zheng */ 20935d4f98a2SYan Zheng static noinline_for_stack 20945d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 20955d4f98a2SYan Zheng int *level) 20965d4f98a2SYan Zheng { 20972ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 20985d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 20995d4f98a2SYan Zheng int i; 21005d4f98a2SYan Zheng u64 bytenr; 21015d4f98a2SYan Zheng u64 ptr_gen = 0; 21025d4f98a2SYan Zheng u64 last_snapshot; 21035d4f98a2SYan Zheng u32 nritems; 21045d4f98a2SYan Zheng 21055d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 21065d4f98a2SYan Zheng 21075d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 2108581c1760SQu Wenruo struct btrfs_key first_key; 2109581c1760SQu Wenruo 21105d4f98a2SYan Zheng eb = path->nodes[i]; 21115d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 21125d4f98a2SYan Zheng while (path->slots[i] < nritems) { 21135d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 21145d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 21155d4f98a2SYan Zheng break; 21165d4f98a2SYan Zheng path->slots[i]++; 21175d4f98a2SYan Zheng } 21185d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 21195d4f98a2SYan Zheng if (i == *level) 21205d4f98a2SYan Zheng break; 21215d4f98a2SYan Zheng *level = i + 1; 21225d4f98a2SYan Zheng return 0; 21235d4f98a2SYan Zheng } 21245d4f98a2SYan Zheng if (i == 1) { 21255d4f98a2SYan Zheng *level = i; 21265d4f98a2SYan Zheng return 0; 21275d4f98a2SYan Zheng } 21285d4f98a2SYan Zheng 21295d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2130581c1760SQu Wenruo btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); 2131581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1, 2132581c1760SQu Wenruo &first_key); 213364c043deSLiu Bo if (IS_ERR(eb)) { 213464c043deSLiu Bo return PTR_ERR(eb); 213564c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2136416bc658SJosef Bacik free_extent_buffer(eb); 2137416bc658SJosef Bacik return -EIO; 2138416bc658SJosef Bacik } 21395d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 21405d4f98a2SYan Zheng path->nodes[i - 1] = eb; 21415d4f98a2SYan Zheng path->slots[i - 1] = 0; 21425d4f98a2SYan Zheng } 21435d4f98a2SYan Zheng return 1; 21445d4f98a2SYan Zheng } 21455d4f98a2SYan Zheng 21465d4f98a2SYan Zheng /* 21475d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 21485d4f98a2SYan Zheng * [min_key, max_key) 21495d4f98a2SYan Zheng */ 21505d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 21515d4f98a2SYan Zheng struct btrfs_key *min_key, 21525d4f98a2SYan Zheng struct btrfs_key *max_key) 21535d4f98a2SYan Zheng { 21540b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 21555d4f98a2SYan Zheng struct inode *inode = NULL; 21565d4f98a2SYan Zheng u64 objectid; 21575d4f98a2SYan Zheng u64 start, end; 215833345d01SLi Zefan u64 ino; 21595d4f98a2SYan Zheng 21605d4f98a2SYan Zheng objectid = min_key->objectid; 21615d4f98a2SYan Zheng while (1) { 21625d4f98a2SYan Zheng cond_resched(); 21635d4f98a2SYan Zheng iput(inode); 21645d4f98a2SYan Zheng 21655d4f98a2SYan Zheng if (objectid > max_key->objectid) 21665d4f98a2SYan Zheng break; 21675d4f98a2SYan Zheng 21685d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 21695d4f98a2SYan Zheng if (!inode) 21705d4f98a2SYan Zheng break; 21714a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 21725d4f98a2SYan Zheng 217333345d01SLi Zefan if (ino > max_key->objectid) { 21745d4f98a2SYan Zheng iput(inode); 21755d4f98a2SYan Zheng break; 21765d4f98a2SYan Zheng } 21775d4f98a2SYan Zheng 217833345d01SLi Zefan objectid = ino + 1; 21795d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 21805d4f98a2SYan Zheng continue; 21815d4f98a2SYan Zheng 218233345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 21835d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 21845d4f98a2SYan Zheng continue; 21855d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 21865d4f98a2SYan Zheng start = 0; 21875d4f98a2SYan Zheng else { 21885d4f98a2SYan Zheng start = min_key->offset; 21890b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 21905d4f98a2SYan Zheng } 21915d4f98a2SYan Zheng } else { 21925d4f98a2SYan Zheng start = 0; 21935d4f98a2SYan Zheng } 21945d4f98a2SYan Zheng 219533345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 21965d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 21975d4f98a2SYan Zheng continue; 21985d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 21995d4f98a2SYan Zheng end = (u64)-1; 22005d4f98a2SYan Zheng } else { 22015d4f98a2SYan Zheng if (max_key->offset == 0) 22025d4f98a2SYan Zheng continue; 22035d4f98a2SYan Zheng end = max_key->offset; 22040b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 22055d4f98a2SYan Zheng end--; 22065d4f98a2SYan Zheng } 22075d4f98a2SYan Zheng } else { 22085d4f98a2SYan Zheng end = (u64)-1; 22095d4f98a2SYan Zheng } 22105d4f98a2SYan Zheng 22115d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2212d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 2213dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 2214d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 22155d4f98a2SYan Zheng } 22165d4f98a2SYan Zheng return 0; 22175d4f98a2SYan Zheng } 22185d4f98a2SYan Zheng 22195d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 22205d4f98a2SYan Zheng struct btrfs_key *key) 22215d4f98a2SYan Zheng 22225d4f98a2SYan Zheng { 22235d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 22245d4f98a2SYan Zheng if (!path->nodes[level]) 22255d4f98a2SYan Zheng break; 22265d4f98a2SYan Zheng if (path->slots[level] + 1 < 22275d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 22285d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 22295d4f98a2SYan Zheng path->slots[level] + 1); 22305d4f98a2SYan Zheng return 0; 22315d4f98a2SYan Zheng } 22325d4f98a2SYan Zheng level++; 22335d4f98a2SYan Zheng } 22345d4f98a2SYan Zheng return 1; 22355d4f98a2SYan Zheng } 22365d4f98a2SYan Zheng 22375d4f98a2SYan Zheng /* 2238d2311e69SQu Wenruo * Insert current subvolume into reloc_control::dirty_subvol_roots 2239d2311e69SQu Wenruo */ 2240d2311e69SQu Wenruo static void insert_dirty_subvol(struct btrfs_trans_handle *trans, 2241d2311e69SQu Wenruo struct reloc_control *rc, 2242d2311e69SQu Wenruo struct btrfs_root *root) 2243d2311e69SQu Wenruo { 2244d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2245d2311e69SQu Wenruo struct btrfs_root_item *reloc_root_item; 2246d2311e69SQu Wenruo 2247d2311e69SQu Wenruo /* @root must be a subvolume tree root with a valid reloc tree */ 2248d2311e69SQu Wenruo ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 2249d2311e69SQu Wenruo ASSERT(reloc_root); 2250d2311e69SQu Wenruo 2251d2311e69SQu Wenruo reloc_root_item = &reloc_root->root_item; 2252d2311e69SQu Wenruo memset(&reloc_root_item->drop_progress, 0, 2253d2311e69SQu Wenruo sizeof(reloc_root_item->drop_progress)); 2254d2311e69SQu Wenruo reloc_root_item->drop_level = 0; 2255d2311e69SQu Wenruo btrfs_set_root_refs(reloc_root_item, 0); 2256d2311e69SQu Wenruo btrfs_update_reloc_root(trans, root); 2257d2311e69SQu Wenruo 2258d2311e69SQu Wenruo if (list_empty(&root->reloc_dirty_list)) { 225900246528SJosef Bacik btrfs_grab_root(root); 2260d2311e69SQu Wenruo list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); 2261d2311e69SQu Wenruo } 2262d2311e69SQu Wenruo } 2263d2311e69SQu Wenruo 2264d2311e69SQu Wenruo static int clean_dirty_subvols(struct reloc_control *rc) 2265d2311e69SQu Wenruo { 2266d2311e69SQu Wenruo struct btrfs_root *root; 2267d2311e69SQu Wenruo struct btrfs_root *next; 2268d2311e69SQu Wenruo int ret = 0; 226930d40577SQu Wenruo int ret2; 2270d2311e69SQu Wenruo 2271d2311e69SQu Wenruo list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, 2272d2311e69SQu Wenruo reloc_dirty_list) { 227330d40577SQu Wenruo if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 227430d40577SQu Wenruo /* Merged subvolume, cleanup its reloc root */ 2275d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2276d2311e69SQu Wenruo 2277d2311e69SQu Wenruo list_del_init(&root->reloc_dirty_list); 2278d2311e69SQu Wenruo root->reloc_root = NULL; 22796282675eSQu Wenruo /* 22806282675eSQu Wenruo * Need barrier to ensure clear_bit() only happens after 22816282675eSQu Wenruo * root->reloc_root = NULL. Pairs with have_reloc_root. 22826282675eSQu Wenruo */ 22836282675eSQu Wenruo smp_wmb(); 22841fac4a54SQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 2285f28de8d8SJosef Bacik if (reloc_root) { 2286f44deb74SJosef Bacik /* 2287f44deb74SJosef Bacik * btrfs_drop_snapshot drops our ref we hold for 2288f44deb74SJosef Bacik * ->reloc_root. If it fails however we must 2289f44deb74SJosef Bacik * drop the ref ourselves. 2290f44deb74SJosef Bacik */ 2291f28de8d8SJosef Bacik ret2 = btrfs_drop_snapshot(reloc_root, 0, 1); 2292f44deb74SJosef Bacik if (ret2 < 0) { 2293f44deb74SJosef Bacik btrfs_put_root(reloc_root); 2294f44deb74SJosef Bacik if (!ret) 2295f28de8d8SJosef Bacik ret = ret2; 2296f28de8d8SJosef Bacik } 2297f44deb74SJosef Bacik } 229800246528SJosef Bacik btrfs_put_root(root); 229930d40577SQu Wenruo } else { 230030d40577SQu Wenruo /* Orphan reloc tree, just clean it up */ 23010078a9f9SNikolay Borisov ret2 = btrfs_drop_snapshot(root, 0, 1); 2302f44deb74SJosef Bacik if (ret2 < 0) { 2303f44deb74SJosef Bacik btrfs_put_root(root); 2304f44deb74SJosef Bacik if (!ret) 230530d40577SQu Wenruo ret = ret2; 230630d40577SQu Wenruo } 2307d2311e69SQu Wenruo } 2308f44deb74SJosef Bacik } 2309d2311e69SQu Wenruo return ret; 2310d2311e69SQu Wenruo } 2311d2311e69SQu Wenruo 2312d2311e69SQu Wenruo /* 23135d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 23145d4f98a2SYan Zheng * fs tree. 23155d4f98a2SYan Zheng */ 23165d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 23175d4f98a2SYan Zheng struct btrfs_root *root) 23185d4f98a2SYan Zheng { 23190b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 23205d4f98a2SYan Zheng struct btrfs_key key; 23215d4f98a2SYan Zheng struct btrfs_key next_key; 23229e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 23235d4f98a2SYan Zheng struct btrfs_root *reloc_root; 23245d4f98a2SYan Zheng struct btrfs_root_item *root_item; 23255d4f98a2SYan Zheng struct btrfs_path *path; 23263fd0a558SYan, Zheng struct extent_buffer *leaf; 23275d4f98a2SYan Zheng int level; 23285d4f98a2SYan Zheng int max_level; 23295d4f98a2SYan Zheng int replaced = 0; 23305d4f98a2SYan Zheng int ret; 23315d4f98a2SYan Zheng int err = 0; 23323fd0a558SYan, Zheng u32 min_reserved; 23335d4f98a2SYan Zheng 23345d4f98a2SYan Zheng path = btrfs_alloc_path(); 23355d4f98a2SYan Zheng if (!path) 23365d4f98a2SYan Zheng return -ENOMEM; 2337e4058b54SDavid Sterba path->reada = READA_FORWARD; 23385d4f98a2SYan Zheng 23395d4f98a2SYan Zheng reloc_root = root->reloc_root; 23405d4f98a2SYan Zheng root_item = &reloc_root->root_item; 23415d4f98a2SYan Zheng 23425d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 23435d4f98a2SYan Zheng level = btrfs_root_level(root_item); 234467439dadSDavid Sterba atomic_inc(&reloc_root->node->refs); 23455d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 23465d4f98a2SYan Zheng path->slots[level] = 0; 23475d4f98a2SYan Zheng } else { 23485d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 23495d4f98a2SYan Zheng 23505d4f98a2SYan Zheng level = root_item->drop_level; 23515d4f98a2SYan Zheng BUG_ON(level == 0); 23525d4f98a2SYan Zheng path->lowest_level = level; 23535d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 235433c66f43SYan Zheng path->lowest_level = 0; 23555d4f98a2SYan Zheng if (ret < 0) { 23565d4f98a2SYan Zheng btrfs_free_path(path); 23575d4f98a2SYan Zheng return ret; 23585d4f98a2SYan Zheng } 23595d4f98a2SYan Zheng 23605d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 23615d4f98a2SYan Zheng path->slots[level]); 23625d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 23635d4f98a2SYan Zheng 23645d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 23655d4f98a2SYan Zheng } 23665d4f98a2SYan Zheng 23670b246afaSJeff Mahoney min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 23685d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 23695d4f98a2SYan Zheng 23705d4f98a2SYan Zheng while (1) { 237108e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 237208e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 23733fd0a558SYan, Zheng if (ret) { 23749e6a0c52SJosef Bacik err = ret; 23759e6a0c52SJosef Bacik goto out; 23763fd0a558SYan, Zheng } 23779e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 23789e6a0c52SJosef Bacik if (IS_ERR(trans)) { 23799e6a0c52SJosef Bacik err = PTR_ERR(trans); 23809e6a0c52SJosef Bacik trans = NULL; 23819e6a0c52SJosef Bacik goto out; 23829e6a0c52SJosef Bacik } 23832abc726aSJosef Bacik 23842abc726aSJosef Bacik /* 23852abc726aSJosef Bacik * At this point we no longer have a reloc_control, so we can't 23862abc726aSJosef Bacik * depend on btrfs_init_reloc_root to update our last_trans. 23872abc726aSJosef Bacik * 23882abc726aSJosef Bacik * But that's ok, we started the trans handle on our 23892abc726aSJosef Bacik * corresponding fs_root, which means it's been added to the 23902abc726aSJosef Bacik * dirty list. At commit time we'll still call 23912abc726aSJosef Bacik * btrfs_update_reloc_root() and update our root item 23922abc726aSJosef Bacik * appropriately. 23932abc726aSJosef Bacik */ 23942abc726aSJosef Bacik reloc_root->last_trans = trans->transid; 23959e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 23963fd0a558SYan, Zheng 23973fd0a558SYan, Zheng replaced = 0; 23985d4f98a2SYan Zheng max_level = level; 23995d4f98a2SYan Zheng 24005d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 24015d4f98a2SYan Zheng if (ret < 0) { 24025d4f98a2SYan Zheng err = ret; 24035d4f98a2SYan Zheng goto out; 24045d4f98a2SYan Zheng } 24055d4f98a2SYan Zheng if (ret > 0) 24065d4f98a2SYan Zheng break; 24075d4f98a2SYan Zheng 24085d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 24095d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 24105d4f98a2SYan Zheng ret = 0; 24115d4f98a2SYan Zheng } else { 24123d0174f7SQu Wenruo ret = replace_path(trans, rc, root, reloc_root, path, 24133fd0a558SYan, Zheng &next_key, level, max_level); 24145d4f98a2SYan Zheng } 24155d4f98a2SYan Zheng if (ret < 0) { 24165d4f98a2SYan Zheng err = ret; 24175d4f98a2SYan Zheng goto out; 24185d4f98a2SYan Zheng } 24195d4f98a2SYan Zheng 24205d4f98a2SYan Zheng if (ret > 0) { 24215d4f98a2SYan Zheng level = ret; 24225d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 24235d4f98a2SYan Zheng path->slots[level]); 24245d4f98a2SYan Zheng replaced = 1; 24255d4f98a2SYan Zheng } 24265d4f98a2SYan Zheng 24275d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 24285d4f98a2SYan Zheng if (ret > 0) 24295d4f98a2SYan Zheng break; 24305d4f98a2SYan Zheng 24315d4f98a2SYan Zheng BUG_ON(level == 0); 24325d4f98a2SYan Zheng /* 24335d4f98a2SYan Zheng * save the merging progress in the drop_progress. 24345d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 24355d4f98a2SYan Zheng */ 24365d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 24375d4f98a2SYan Zheng path->slots[level]); 24385d4f98a2SYan Zheng root_item->drop_level = level; 24395d4f98a2SYan Zheng 24403a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 24419e6a0c52SJosef Bacik trans = NULL; 24425d4f98a2SYan Zheng 24432ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 24445d4f98a2SYan Zheng 24455d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 24465d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 24475d4f98a2SYan Zheng } 24485d4f98a2SYan Zheng 24495d4f98a2SYan Zheng /* 24505d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 24515d4f98a2SYan Zheng * relocated and the block is tree root. 24525d4f98a2SYan Zheng */ 24535d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 24545d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 24555d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 24565d4f98a2SYan Zheng free_extent_buffer(leaf); 24575d4f98a2SYan Zheng if (ret < 0) 24585d4f98a2SYan Zheng err = ret; 24595d4f98a2SYan Zheng out: 24605d4f98a2SYan Zheng btrfs_free_path(path); 24615d4f98a2SYan Zheng 2462d2311e69SQu Wenruo if (err == 0) 2463d2311e69SQu Wenruo insert_dirty_subvol(trans, rc, root); 24645d4f98a2SYan Zheng 24659e6a0c52SJosef Bacik if (trans) 24663a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 24675d4f98a2SYan Zheng 24682ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 24695d4f98a2SYan Zheng 24705d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 24715d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 24725d4f98a2SYan Zheng 24735d4f98a2SYan Zheng return err; 24745d4f98a2SYan Zheng } 24755d4f98a2SYan Zheng 24763fd0a558SYan, Zheng static noinline_for_stack 24773fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 24785d4f98a2SYan Zheng { 24793fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 24800b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 24813fd0a558SYan, Zheng struct btrfs_root *reloc_root; 24825d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 24833fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 24843fd0a558SYan, Zheng u64 num_bytes = 0; 24853fd0a558SYan, Zheng int ret; 24863fd0a558SYan, Zheng 24870b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 24880b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 24893fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 24900b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 24917585717fSChris Mason 24923fd0a558SYan, Zheng again: 24933fd0a558SYan, Zheng if (!err) { 24943fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 249508e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 249608e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 24973fd0a558SYan, Zheng if (ret) 24983fd0a558SYan, Zheng err = ret; 24993fd0a558SYan, Zheng } 25003fd0a558SYan, Zheng 25017a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 25023612b495STsutomu Itoh if (IS_ERR(trans)) { 25033612b495STsutomu Itoh if (!err) 25042ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 250563f018beSNikolay Borisov num_bytes, NULL); 25063612b495STsutomu Itoh return PTR_ERR(trans); 25073612b495STsutomu Itoh } 25083fd0a558SYan, Zheng 25093fd0a558SYan, Zheng if (!err) { 25103fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 25113a45bb20SJeff Mahoney btrfs_end_transaction(trans); 25122ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 251363f018beSNikolay Borisov num_bytes, NULL); 25143fd0a558SYan, Zheng goto again; 25153fd0a558SYan, Zheng } 25163fd0a558SYan, Zheng } 25173fd0a558SYan, Zheng 25183fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 25193fd0a558SYan, Zheng 25203fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 25213fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 25223fd0a558SYan, Zheng struct btrfs_root, root_list); 25233fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 25243fd0a558SYan, Zheng 25250b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 25263fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 25273fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 25283fd0a558SYan, Zheng 25293fd0a558SYan, Zheng /* 25303fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 25313fd0a558SYan, Zheng * knows it should resumes merging 25323fd0a558SYan, Zheng */ 25333fd0a558SYan, Zheng if (!err) 25343fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 25353fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 25363fd0a558SYan, Zheng 25373fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 253800246528SJosef Bacik btrfs_put_root(root); 25393fd0a558SYan, Zheng } 25403fd0a558SYan, Zheng 25413fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 25423fd0a558SYan, Zheng 25433fd0a558SYan, Zheng if (!err) 25443a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 25453fd0a558SYan, Zheng else 25463a45bb20SJeff Mahoney btrfs_end_transaction(trans); 25473fd0a558SYan, Zheng return err; 25483fd0a558SYan, Zheng } 25493fd0a558SYan, Zheng 25503fd0a558SYan, Zheng static noinline_for_stack 2551aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2552aca1bba6SLiu Bo { 2553aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2554aca1bba6SLiu Bo 2555aca1bba6SLiu Bo while (!list_empty(list)) { 2556aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2557aca1bba6SLiu Bo root_list); 2558bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 2559aca1bba6SLiu Bo } 2560aca1bba6SLiu Bo } 2561aca1bba6SLiu Bo 2562aca1bba6SLiu Bo static noinline_for_stack 256394404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 25643fd0a558SYan, Zheng { 25650b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 25665d4f98a2SYan Zheng struct btrfs_root *root; 25675d4f98a2SYan Zheng struct btrfs_root *reloc_root; 25683fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 25693fd0a558SYan, Zheng int found = 0; 2570aca1bba6SLiu Bo int ret = 0; 25713fd0a558SYan, Zheng again: 25723fd0a558SYan, Zheng root = rc->extent_root; 25737585717fSChris Mason 25747585717fSChris Mason /* 25757585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 25767585717fSChris Mason * we have to make sure nobody is in the middle of 25777585717fSChris Mason * adding their roots to the list while we are 25787585717fSChris Mason * doing this splice 25797585717fSChris Mason */ 25800b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 25813fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 25820b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 25835d4f98a2SYan Zheng 25843fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 25853fd0a558SYan, Zheng found = 1; 25863fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 25873fd0a558SYan, Zheng struct btrfs_root, root_list); 25885d4f98a2SYan Zheng 25895d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 25900b246afaSJeff Mahoney root = read_fs_root(fs_info, 25915d4f98a2SYan Zheng reloc_root->root_key.offset); 25925d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 25935d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 25945d4f98a2SYan Zheng 25953fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 259600246528SJosef Bacik btrfs_put_root(root); 2597b37b39cdSJosef Bacik if (ret) { 259825e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 259925e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 260025e293c2SWang Shilong &reloc_roots); 2601aca1bba6SLiu Bo goto out; 2602b37b39cdSJosef Bacik } 26033fd0a558SYan, Zheng } else { 26043fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 260530d40577SQu Wenruo /* Don't forget to queue this reloc root for cleanup */ 260630d40577SQu Wenruo list_add_tail(&reloc_root->reloc_dirty_list, 260730d40577SQu Wenruo &rc->dirty_subvol_roots); 26083fd0a558SYan, Zheng } 26095d4f98a2SYan Zheng } 26105d4f98a2SYan Zheng 26113fd0a558SYan, Zheng if (found) { 26123fd0a558SYan, Zheng found = 0; 26133fd0a558SYan, Zheng goto again; 26145d4f98a2SYan Zheng } 2615aca1bba6SLiu Bo out: 2616aca1bba6SLiu Bo if (ret) { 26170b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2618aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2619aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2620467bb1d2SWang Shilong 2621467bb1d2SWang Shilong /* new reloc root may be added */ 26220b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2623467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 26240b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2625467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2626467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2627aca1bba6SLiu Bo } 2628aca1bba6SLiu Bo 26297b7b7431SJosef Bacik /* 26307b7b7431SJosef Bacik * We used to have 26317b7b7431SJosef Bacik * 26327b7b7431SJosef Bacik * BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 26337b7b7431SJosef Bacik * 26347b7b7431SJosef Bacik * here, but it's wrong. If we fail to start the transaction in 26357b7b7431SJosef Bacik * prepare_to_merge() we will have only 0 ref reloc roots, none of which 26367b7b7431SJosef Bacik * have actually been removed from the reloc_root_tree rb tree. This is 26377b7b7431SJosef Bacik * fine because we're bailing here, and we hold a reference on the root 26387b7b7431SJosef Bacik * for the list that holds it, so these roots will be cleaned up when we 26397b7b7431SJosef Bacik * do the reloc_dirty_list afterwards. Meanwhile the root->reloc_root 26407b7b7431SJosef Bacik * will be cleaned up on unmount. 26417b7b7431SJosef Bacik * 26427b7b7431SJosef Bacik * The remaining nodes will be cleaned up by free_reloc_control. 26437b7b7431SJosef Bacik */ 26445d4f98a2SYan Zheng } 26455d4f98a2SYan Zheng 26465d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 26475d4f98a2SYan Zheng { 26485d4f98a2SYan Zheng struct tree_block *block; 26495d4f98a2SYan Zheng struct rb_node *rb_node; 26505d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 26515d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 26525d4f98a2SYan Zheng rb_erase(rb_node, blocks); 26535d4f98a2SYan Zheng kfree(block); 26545d4f98a2SYan Zheng } 26555d4f98a2SYan Zheng } 26565d4f98a2SYan Zheng 26575d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 26585d4f98a2SYan Zheng struct btrfs_root *reloc_root) 26595d4f98a2SYan Zheng { 26600b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 26615d4f98a2SYan Zheng struct btrfs_root *root; 2662442b1ac5SJosef Bacik int ret; 26635d4f98a2SYan Zheng 26645d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 26655d4f98a2SYan Zheng return 0; 26665d4f98a2SYan Zheng 26670b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 26685d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 26695d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 2670442b1ac5SJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 267100246528SJosef Bacik btrfs_put_root(root); 26725d4f98a2SYan Zheng 2673442b1ac5SJosef Bacik return ret; 26745d4f98a2SYan Zheng } 26755d4f98a2SYan Zheng 26763fd0a558SYan, Zheng static noinline_for_stack 26773fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 26783fd0a558SYan, Zheng struct reloc_control *rc, 26795d4f98a2SYan Zheng struct backref_node *node, 2680dc4103f9SWang Shilong struct backref_edge *edges[]) 26815d4f98a2SYan Zheng { 26825d4f98a2SYan Zheng struct backref_node *next; 26835d4f98a2SYan Zheng struct btrfs_root *root; 26843fd0a558SYan, Zheng int index = 0; 26853fd0a558SYan, Zheng 26865d4f98a2SYan Zheng next = node; 26875d4f98a2SYan Zheng while (1) { 26885d4f98a2SYan Zheng cond_resched(); 26895d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 26905d4f98a2SYan Zheng root = next->root; 26913fd0a558SYan, Zheng BUG_ON(!root); 269227cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 26935d4f98a2SYan Zheng 26945d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 26955d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 26965d4f98a2SYan Zheng break; 26975d4f98a2SYan Zheng } 26985d4f98a2SYan Zheng 26995d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 27003fd0a558SYan, Zheng root = root->reloc_root; 27013fd0a558SYan, Zheng 27023fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 27033fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 27043fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 27053fd0a558SYan, Zheng next->new_bytenr = root->node->start; 270600246528SJosef Bacik btrfs_put_root(next->root); 270700246528SJosef Bacik next->root = btrfs_grab_root(root); 27080b530bc5SJosef Bacik ASSERT(next->root); 27093fd0a558SYan, Zheng list_add_tail(&next->list, 27103fd0a558SYan, Zheng &rc->backref_cache.changed); 27119569cc20SQu Wenruo mark_block_processed(rc, next); 27125d4f98a2SYan Zheng break; 27135d4f98a2SYan Zheng } 27145d4f98a2SYan Zheng 27153fd0a558SYan, Zheng WARN_ON(1); 27165d4f98a2SYan Zheng root = NULL; 27175d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 27185d4f98a2SYan Zheng if (!next || next->level <= node->level) 27195d4f98a2SYan Zheng break; 27205d4f98a2SYan Zheng } 27213fd0a558SYan, Zheng if (!root) 27223fd0a558SYan, Zheng return NULL; 27235d4f98a2SYan Zheng 27243fd0a558SYan, Zheng next = node; 27253fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 27263fd0a558SYan, Zheng while (1) { 27273fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 27283fd0a558SYan, Zheng if (--index < 0) 27293fd0a558SYan, Zheng break; 27303fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 27313fd0a558SYan, Zheng } 27325d4f98a2SYan Zheng return root; 27335d4f98a2SYan Zheng } 27345d4f98a2SYan Zheng 27353fd0a558SYan, Zheng /* 27363fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 27373fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 27383fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 27393fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 27403fd0a558SYan, Zheng */ 27415d4f98a2SYan Zheng static noinline_for_stack 2742147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 27435d4f98a2SYan Zheng { 27443fd0a558SYan, Zheng struct backref_node *next; 27453fd0a558SYan, Zheng struct btrfs_root *root; 27463fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 27475d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 27483fd0a558SYan, Zheng int index = 0; 27493fd0a558SYan, Zheng 27503fd0a558SYan, Zheng next = node; 27513fd0a558SYan, Zheng while (1) { 27523fd0a558SYan, Zheng cond_resched(); 27533fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 27543fd0a558SYan, Zheng root = next->root; 27553fd0a558SYan, Zheng BUG_ON(!root); 27563fd0a558SYan, Zheng 275725985edcSLucas De Marchi /* no other choice for non-references counted tree */ 275827cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 27593fd0a558SYan, Zheng return root; 27603fd0a558SYan, Zheng 27613fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 27623fd0a558SYan, Zheng fs_root = root; 27633fd0a558SYan, Zheng 27643fd0a558SYan, Zheng if (next != node) 27653fd0a558SYan, Zheng return NULL; 27663fd0a558SYan, Zheng 27673fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 27683fd0a558SYan, Zheng if (!next || next->level <= node->level) 27693fd0a558SYan, Zheng break; 27703fd0a558SYan, Zheng } 27713fd0a558SYan, Zheng 27723fd0a558SYan, Zheng if (!fs_root) 27733fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 27743fd0a558SYan, Zheng return fs_root; 27755d4f98a2SYan Zheng } 27765d4f98a2SYan Zheng 27775d4f98a2SYan Zheng static noinline_for_stack 27783fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 27793fd0a558SYan, Zheng struct backref_node *node, int reserve) 27805d4f98a2SYan Zheng { 27810b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 27823fd0a558SYan, Zheng struct backref_node *next = node; 27833fd0a558SYan, Zheng struct backref_edge *edge; 27843fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 27853fd0a558SYan, Zheng u64 num_bytes = 0; 27863fd0a558SYan, Zheng int index = 0; 27875d4f98a2SYan Zheng 27883fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 27893fd0a558SYan, Zheng 27903fd0a558SYan, Zheng while (next) { 27913fd0a558SYan, Zheng cond_resched(); 27925d4f98a2SYan Zheng while (1) { 27933fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 27945d4f98a2SYan Zheng break; 27955d4f98a2SYan Zheng 27960b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 27973fd0a558SYan, Zheng 27983fd0a558SYan, Zheng if (list_empty(&next->upper)) 27993fd0a558SYan, Zheng break; 28003fd0a558SYan, Zheng 28013fd0a558SYan, Zheng edge = list_entry(next->upper.next, 28023fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 28033fd0a558SYan, Zheng edges[index++] = edge; 28043fd0a558SYan, Zheng next = edge->node[UPPER]; 28055d4f98a2SYan Zheng } 28063fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 28073fd0a558SYan, Zheng } 28083fd0a558SYan, Zheng return num_bytes; 28093fd0a558SYan, Zheng } 28103fd0a558SYan, Zheng 28113fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 28123fd0a558SYan, Zheng struct reloc_control *rc, 28133fd0a558SYan, Zheng struct backref_node *node) 28143fd0a558SYan, Zheng { 28153fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2816da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 28173fd0a558SYan, Zheng u64 num_bytes; 28183fd0a558SYan, Zheng int ret; 28190647bf56SWang Shilong u64 tmp; 28203fd0a558SYan, Zheng 28213fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 28223fd0a558SYan, Zheng 28233fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 28240647bf56SWang Shilong rc->reserved_bytes += num_bytes; 28258ca17f0fSJosef Bacik 28268ca17f0fSJosef Bacik /* 28278ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 28288ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 28298ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 28308ca17f0fSJosef Bacik */ 28310647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 28328ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 28333fd0a558SYan, Zheng if (ret) { 2834da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 28350647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 28360647bf56SWang Shilong tmp <<= 1; 28370647bf56SWang Shilong /* 28380647bf56SWang Shilong * only one thread can access block_rsv at this point, 28390647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 28400647bf56SWang Shilong * we expand more reservation size here to allow enough 284152042d8eSAndrea Gelmini * space for relocation and we will return earlier in 28420647bf56SWang Shilong * enospc case. 28430647bf56SWang Shilong */ 2844da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 28450647bf56SWang Shilong RELOCATION_RESERVED_NODES; 28468ca17f0fSJosef Bacik return -EAGAIN; 28473fd0a558SYan, Zheng } 28483fd0a558SYan, Zheng 28493fd0a558SYan, Zheng return 0; 28503fd0a558SYan, Zheng } 28513fd0a558SYan, Zheng 28525d4f98a2SYan Zheng /* 28535d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 28545d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 28555d4f98a2SYan Zheng * 28565d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 28575d4f98a2SYan Zheng * in that case this function just updates pointers. 28585d4f98a2SYan Zheng */ 28595d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 28603fd0a558SYan, Zheng struct reloc_control *rc, 28615d4f98a2SYan Zheng struct backref_node *node, 28625d4f98a2SYan Zheng struct btrfs_key *key, 28635d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 28645d4f98a2SYan Zheng { 28652ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 28665d4f98a2SYan Zheng struct backref_node *upper; 28675d4f98a2SYan Zheng struct backref_edge *edge; 28685d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28695d4f98a2SYan Zheng struct btrfs_root *root; 28705d4f98a2SYan Zheng struct extent_buffer *eb; 28715d4f98a2SYan Zheng u32 blocksize; 28725d4f98a2SYan Zheng u64 bytenr; 28735d4f98a2SYan Zheng u64 generation; 28745d4f98a2SYan Zheng int slot; 28755d4f98a2SYan Zheng int ret; 28765d4f98a2SYan Zheng int err = 0; 28775d4f98a2SYan Zheng 28785d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 28795d4f98a2SYan Zheng 28805d4f98a2SYan Zheng path->lowest_level = node->level + 1; 28813fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 28825d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 2883581c1760SQu Wenruo struct btrfs_key first_key; 288482fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 2885581c1760SQu Wenruo 28865d4f98a2SYan Zheng cond_resched(); 28875d4f98a2SYan Zheng 28885d4f98a2SYan Zheng upper = edge->node[UPPER]; 2889dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 28903fd0a558SYan, Zheng BUG_ON(!root); 28915d4f98a2SYan Zheng 28923fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 28933fd0a558SYan, Zheng if (!lowest) { 28943fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 28953fd0a558SYan, Zheng upper->level, &slot); 2896cbca7d59SFilipe Manana if (ret < 0) { 2897cbca7d59SFilipe Manana err = ret; 2898cbca7d59SFilipe Manana goto next; 2899cbca7d59SFilipe Manana } 29003fd0a558SYan, Zheng BUG_ON(ret); 29013fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 29023fd0a558SYan, Zheng if (node->eb->start == bytenr) 29033fd0a558SYan, Zheng goto next; 29043fd0a558SYan, Zheng } 29055d4f98a2SYan Zheng drop_node_buffer(upper); 29063fd0a558SYan, Zheng } 29075d4f98a2SYan Zheng 29085d4f98a2SYan Zheng if (!upper->eb) { 29095d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 29103561b9dbSLiu Bo if (ret) { 29113561b9dbSLiu Bo if (ret < 0) 29125d4f98a2SYan Zheng err = ret; 29133561b9dbSLiu Bo else 29143561b9dbSLiu Bo err = -ENOENT; 29153561b9dbSLiu Bo 29163561b9dbSLiu Bo btrfs_release_path(path); 29175d4f98a2SYan Zheng break; 29185d4f98a2SYan Zheng } 29195d4f98a2SYan Zheng 29203fd0a558SYan, Zheng if (!upper->eb) { 29213fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 29223fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 29233fd0a558SYan, Zheng } else { 29243fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 29253fd0a558SYan, Zheng } 29263fd0a558SYan, Zheng 29273fd0a558SYan, Zheng upper->locked = 1; 29283fd0a558SYan, Zheng path->locks[upper->level] = 0; 29293fd0a558SYan, Zheng 29305d4f98a2SYan Zheng slot = path->slots[upper->level]; 2931b3b4aa74SDavid Sterba btrfs_release_path(path); 29325d4f98a2SYan Zheng } else { 29335d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 29345d4f98a2SYan Zheng &slot); 2935cbca7d59SFilipe Manana if (ret < 0) { 2936cbca7d59SFilipe Manana err = ret; 2937cbca7d59SFilipe Manana goto next; 2938cbca7d59SFilipe Manana } 29395d4f98a2SYan Zheng BUG_ON(ret); 29405d4f98a2SYan Zheng } 29415d4f98a2SYan Zheng 29425d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 29433fd0a558SYan, Zheng if (lowest) { 29444547f4d8SLiu Bo if (bytenr != node->bytenr) { 29454547f4d8SLiu Bo btrfs_err(root->fs_info, 29464547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 29474547f4d8SLiu Bo bytenr, node->bytenr, slot, 29484547f4d8SLiu Bo upper->eb->start); 29494547f4d8SLiu Bo err = -EIO; 29504547f4d8SLiu Bo goto next; 29514547f4d8SLiu Bo } 29525d4f98a2SYan Zheng } else { 29533fd0a558SYan, Zheng if (node->eb->start == bytenr) 29543fd0a558SYan, Zheng goto next; 29555d4f98a2SYan Zheng } 29565d4f98a2SYan Zheng 2957da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 29585d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 2959581c1760SQu Wenruo btrfs_node_key_to_cpu(upper->eb, &first_key, slot); 2960581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, generation, 2961581c1760SQu Wenruo upper->level - 1, &first_key); 296264c043deSLiu Bo if (IS_ERR(eb)) { 296364c043deSLiu Bo err = PTR_ERR(eb); 296464c043deSLiu Bo goto next; 296564c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2966416bc658SJosef Bacik free_extent_buffer(eb); 296797d9a8a4STsutomu Itoh err = -EIO; 296897d9a8a4STsutomu Itoh goto next; 296997d9a8a4STsutomu Itoh } 29705d4f98a2SYan Zheng btrfs_tree_lock(eb); 29718bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 29725d4f98a2SYan Zheng 29735d4f98a2SYan Zheng if (!node->eb) { 29745d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 29755d4f98a2SYan Zheng slot, &eb); 29763fd0a558SYan, Zheng btrfs_tree_unlock(eb); 29773fd0a558SYan, Zheng free_extent_buffer(eb); 29785d4f98a2SYan Zheng if (ret < 0) { 29795d4f98a2SYan Zheng err = ret; 29803fd0a558SYan, Zheng goto next; 29815d4f98a2SYan Zheng } 29823fd0a558SYan, Zheng BUG_ON(node->eb != eb); 29835d4f98a2SYan Zheng } else { 29845d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 29855d4f98a2SYan Zheng node->eb->start); 29865d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 29875d4f98a2SYan Zheng trans->transid); 29885d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 29895d4f98a2SYan Zheng 299082fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, 29915d4f98a2SYan Zheng node->eb->start, blocksize, 299282fa113fSQu Wenruo upper->eb->start); 299382fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 299482fa113fSQu Wenruo btrfs_init_tree_ref(&ref, node->level, 299582fa113fSQu Wenruo btrfs_header_owner(upper->eb)); 299682fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 29975d4f98a2SYan Zheng BUG_ON(ret); 29985d4f98a2SYan Zheng 29995d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 30005d4f98a2SYan Zheng BUG_ON(ret); 30015d4f98a2SYan Zheng } 30023fd0a558SYan, Zheng next: 30033fd0a558SYan, Zheng if (!upper->pending) 30043fd0a558SYan, Zheng drop_node_buffer(upper); 30053fd0a558SYan, Zheng else 30063fd0a558SYan, Zheng unlock_node_buffer(upper); 30073fd0a558SYan, Zheng if (err) 30083fd0a558SYan, Zheng break; 30095d4f98a2SYan Zheng } 30103fd0a558SYan, Zheng 30113fd0a558SYan, Zheng if (!err && node->pending) { 30123fd0a558SYan, Zheng drop_node_buffer(node); 30133fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 30143fd0a558SYan, Zheng node->pending = 0; 30155d4f98a2SYan Zheng } 30163fd0a558SYan, Zheng 30175d4f98a2SYan Zheng path->lowest_level = 0; 30183fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 30195d4f98a2SYan Zheng return err; 30205d4f98a2SYan Zheng } 30215d4f98a2SYan Zheng 30225d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 30233fd0a558SYan, Zheng struct reloc_control *rc, 30245d4f98a2SYan Zheng struct backref_node *node, 30255d4f98a2SYan Zheng struct btrfs_path *path) 30265d4f98a2SYan Zheng { 30275d4f98a2SYan Zheng struct btrfs_key key; 30285d4f98a2SYan Zheng 30295d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 30303fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 30315d4f98a2SYan Zheng } 30325d4f98a2SYan Zheng 30335d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 30343fd0a558SYan, Zheng struct reloc_control *rc, 30353fd0a558SYan, Zheng struct btrfs_path *path, int err) 30365d4f98a2SYan Zheng { 30373fd0a558SYan, Zheng LIST_HEAD(list); 30383fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 30395d4f98a2SYan Zheng struct backref_node *node; 30405d4f98a2SYan Zheng int level; 30415d4f98a2SYan Zheng int ret; 30425d4f98a2SYan Zheng 30435d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 30445d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 30455d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 30463fd0a558SYan, Zheng struct backref_node, list); 30473fd0a558SYan, Zheng list_move_tail(&node->list, &list); 30483fd0a558SYan, Zheng BUG_ON(!node->pending); 30495d4f98a2SYan Zheng 30503fd0a558SYan, Zheng if (!err) { 30513fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 30525d4f98a2SYan Zheng if (ret < 0) 30535d4f98a2SYan Zheng err = ret; 30545d4f98a2SYan Zheng } 30555d4f98a2SYan Zheng } 30563fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 30573fd0a558SYan, Zheng } 30585d4f98a2SYan Zheng return err; 30595d4f98a2SYan Zheng } 30605d4f98a2SYan Zheng 30615d4f98a2SYan Zheng /* 30625d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 30635d4f98a2SYan Zheng * as processed. 30645d4f98a2SYan Zheng */ 30655d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 30665d4f98a2SYan Zheng struct backref_node *node) 30675d4f98a2SYan Zheng { 30685d4f98a2SYan Zheng struct backref_node *next = node; 30695d4f98a2SYan Zheng struct backref_edge *edge; 30705d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 30715d4f98a2SYan Zheng int index = 0; 30725d4f98a2SYan Zheng 30735d4f98a2SYan Zheng while (next) { 30745d4f98a2SYan Zheng cond_resched(); 30755d4f98a2SYan Zheng while (1) { 30765d4f98a2SYan Zheng if (next->processed) 30775d4f98a2SYan Zheng break; 30785d4f98a2SYan Zheng 30799569cc20SQu Wenruo mark_block_processed(rc, next); 30805d4f98a2SYan Zheng 30815d4f98a2SYan Zheng if (list_empty(&next->upper)) 30825d4f98a2SYan Zheng break; 30835d4f98a2SYan Zheng 30845d4f98a2SYan Zheng edge = list_entry(next->upper.next, 30855d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 30865d4f98a2SYan Zheng edges[index++] = edge; 30875d4f98a2SYan Zheng next = edge->node[UPPER]; 30885d4f98a2SYan Zheng } 30895d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 30905d4f98a2SYan Zheng } 30915d4f98a2SYan Zheng } 30925d4f98a2SYan Zheng 30937476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 30945d4f98a2SYan Zheng { 3095da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 30967476dfdaSDavid Sterba 30975d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 30989655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 30995d4f98a2SYan Zheng return 1; 31005d4f98a2SYan Zheng return 0; 31015d4f98a2SYan Zheng } 31025d4f98a2SYan Zheng 31032ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 31045d4f98a2SYan Zheng struct tree_block *block) 31055d4f98a2SYan Zheng { 31065d4f98a2SYan Zheng struct extent_buffer *eb; 31075d4f98a2SYan Zheng 3108581c1760SQu Wenruo eb = read_tree_block(fs_info, block->bytenr, block->key.offset, 3109581c1760SQu Wenruo block->level, NULL); 311064c043deSLiu Bo if (IS_ERR(eb)) { 311164c043deSLiu Bo return PTR_ERR(eb); 311264c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 3113416bc658SJosef Bacik free_extent_buffer(eb); 3114416bc658SJosef Bacik return -EIO; 3115416bc658SJosef Bacik } 31165d4f98a2SYan Zheng if (block->level == 0) 31175d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 31185d4f98a2SYan Zheng else 31195d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 31205d4f98a2SYan Zheng free_extent_buffer(eb); 31215d4f98a2SYan Zheng block->key_ready = 1; 31225d4f98a2SYan Zheng return 0; 31235d4f98a2SYan Zheng } 31245d4f98a2SYan Zheng 31255d4f98a2SYan Zheng /* 31265d4f98a2SYan Zheng * helper function to relocate a tree block 31275d4f98a2SYan Zheng */ 31285d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 31295d4f98a2SYan Zheng struct reloc_control *rc, 31305d4f98a2SYan Zheng struct backref_node *node, 31315d4f98a2SYan Zheng struct btrfs_key *key, 31325d4f98a2SYan Zheng struct btrfs_path *path) 31335d4f98a2SYan Zheng { 31345d4f98a2SYan Zheng struct btrfs_root *root; 31353fd0a558SYan, Zheng int ret = 0; 31365d4f98a2SYan Zheng 31373fd0a558SYan, Zheng if (!node) 31385d4f98a2SYan Zheng return 0; 31393fd0a558SYan, Zheng 31405f6b2e5cSJosef Bacik /* 31415f6b2e5cSJosef Bacik * If we fail here we want to drop our backref_node because we are going 31425f6b2e5cSJosef Bacik * to start over and regenerate the tree for it. 31435f6b2e5cSJosef Bacik */ 31445f6b2e5cSJosef Bacik ret = reserve_metadata_space(trans, rc, node); 31455f6b2e5cSJosef Bacik if (ret) 31465f6b2e5cSJosef Bacik goto out; 31475f6b2e5cSJosef Bacik 31483fd0a558SYan, Zheng BUG_ON(node->processed); 3149147d256eSZhaolei root = select_one_root(node); 31503fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 31513fd0a558SYan, Zheng update_processed_blocks(rc, node); 31523fd0a558SYan, Zheng goto out; 31535d4f98a2SYan Zheng } 31545d4f98a2SYan Zheng 31553fd0a558SYan, Zheng if (root) { 315627cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 31573fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 31583fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 31593fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 31603fd0a558SYan, Zheng root = root->reloc_root; 31613fd0a558SYan, Zheng node->new_bytenr = root->node->start; 316200246528SJosef Bacik btrfs_put_root(node->root); 316300246528SJosef Bacik node->root = btrfs_grab_root(root); 31640b530bc5SJosef Bacik ASSERT(node->root); 31653fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 31663fd0a558SYan, Zheng } else { 31675d4f98a2SYan Zheng path->lowest_level = node->level; 31685d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 3169b3b4aa74SDavid Sterba btrfs_release_path(path); 31703fd0a558SYan, Zheng if (ret > 0) 31715d4f98a2SYan Zheng ret = 0; 31723fd0a558SYan, Zheng } 31733fd0a558SYan, Zheng if (!ret) 31743fd0a558SYan, Zheng update_processed_blocks(rc, node); 31753fd0a558SYan, Zheng } else { 31763fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 31773fd0a558SYan, Zheng } 31785d4f98a2SYan Zheng out: 31790647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 31803fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 31815d4f98a2SYan Zheng return ret; 31825d4f98a2SYan Zheng } 31835d4f98a2SYan Zheng 31845d4f98a2SYan Zheng /* 31855d4f98a2SYan Zheng * relocate a list of blocks 31865d4f98a2SYan Zheng */ 31875d4f98a2SYan Zheng static noinline_for_stack 31885d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 31895d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 31905d4f98a2SYan Zheng { 31912ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 31925d4f98a2SYan Zheng struct backref_node *node; 31935d4f98a2SYan Zheng struct btrfs_path *path; 31945d4f98a2SYan Zheng struct tree_block *block; 319598ff7b94SQu Wenruo struct tree_block *next; 31965d4f98a2SYan Zheng int ret; 31975d4f98a2SYan Zheng int err = 0; 31985d4f98a2SYan Zheng 31995d4f98a2SYan Zheng path = btrfs_alloc_path(); 3200e1a12670SLiu Bo if (!path) { 3201e1a12670SLiu Bo err = -ENOMEM; 320234c2b290SDavid Sterba goto out_free_blocks; 3203e1a12670SLiu Bo } 32045d4f98a2SYan Zheng 320598ff7b94SQu Wenruo /* Kick in readahead for tree blocks with missing keys */ 320698ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 32075d4f98a2SYan Zheng if (!block->key_ready) 32082ff7e61eSJeff Mahoney readahead_tree_block(fs_info, block->bytenr); 32095d4f98a2SYan Zheng } 32105d4f98a2SYan Zheng 321198ff7b94SQu Wenruo /* Get first keys */ 321298ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 321334c2b290SDavid Sterba if (!block->key_ready) { 32142ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 321534c2b290SDavid Sterba if (err) 321634c2b290SDavid Sterba goto out_free_path; 321734c2b290SDavid Sterba } 32185d4f98a2SYan Zheng } 32195d4f98a2SYan Zheng 322098ff7b94SQu Wenruo /* Do tree relocation */ 322198ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 32223fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 32235d4f98a2SYan Zheng block->level, block->bytenr); 32245d4f98a2SYan Zheng if (IS_ERR(node)) { 32255d4f98a2SYan Zheng err = PTR_ERR(node); 32265d4f98a2SYan Zheng goto out; 32275d4f98a2SYan Zheng } 32285d4f98a2SYan Zheng 32295d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 32305d4f98a2SYan Zheng path); 32315d4f98a2SYan Zheng if (ret < 0) { 32325d4f98a2SYan Zheng err = ret; 323350dbbb71SJosef Bacik break; 32345d4f98a2SYan Zheng } 32355d4f98a2SYan Zheng } 32365d4f98a2SYan Zheng out: 32373fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 32385d4f98a2SYan Zheng 323934c2b290SDavid Sterba out_free_path: 32405d4f98a2SYan Zheng btrfs_free_path(path); 324134c2b290SDavid Sterba out_free_blocks: 3242e1a12670SLiu Bo free_block_list(blocks); 32435d4f98a2SYan Zheng return err; 32445d4f98a2SYan Zheng } 32455d4f98a2SYan Zheng 32465d4f98a2SYan Zheng static noinline_for_stack 3247efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3248efa56464SYan, Zheng struct file_extent_cluster *cluster) 3249efa56464SYan, Zheng { 3250efa56464SYan, Zheng u64 alloc_hint = 0; 3251efa56464SYan, Zheng u64 start; 3252efa56464SYan, Zheng u64 end; 3253efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3254efa56464SYan, Zheng u64 num_bytes; 3255efa56464SYan, Zheng int nr = 0; 3256efa56464SYan, Zheng int ret = 0; 3257dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 3258dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 325918513091SWang Xiaoguang u64 cur_offset; 3260364ecf36SQu Wenruo struct extent_changeset *data_reserved = NULL; 3261efa56464SYan, Zheng 3262efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 32635955102cSAl Viro inode_lock(inode); 3264efa56464SYan, Zheng 3265364ecf36SQu Wenruo ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start, 3266dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 3267efa56464SYan, Zheng if (ret) 3268efa56464SYan, Zheng goto out; 3269efa56464SYan, Zheng 327018513091SWang Xiaoguang cur_offset = prealloc_start; 3271efa56464SYan, Zheng while (nr < cluster->nr) { 3272efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3273efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3274efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3275efa56464SYan, Zheng else 3276efa56464SYan, Zheng end = cluster->end - offset; 3277efa56464SYan, Zheng 3278d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3279efa56464SYan, Zheng num_bytes = end + 1 - start; 328018513091SWang Xiaoguang if (cur_offset < start) 3281bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3282bc42bda2SQu Wenruo cur_offset, start - cur_offset); 3283efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3284efa56464SYan, Zheng num_bytes, num_bytes, 3285efa56464SYan, Zheng end + 1, &alloc_hint); 328618513091SWang Xiaoguang cur_offset = end + 1; 3287d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3288efa56464SYan, Zheng if (ret) 3289efa56464SYan, Zheng break; 3290efa56464SYan, Zheng nr++; 3291efa56464SYan, Zheng } 329218513091SWang Xiaoguang if (cur_offset < prealloc_end) 3293bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3294bc42bda2SQu Wenruo cur_offset, prealloc_end + 1 - cur_offset); 3295efa56464SYan, Zheng out: 32965955102cSAl Viro inode_unlock(inode); 3297364ecf36SQu Wenruo extent_changeset_free(data_reserved); 3298efa56464SYan, Zheng return ret; 3299efa56464SYan, Zheng } 3300efa56464SYan, Zheng 3301efa56464SYan, Zheng static noinline_for_stack 33020257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 33030257bb82SYan, Zheng u64 block_start) 33045d4f98a2SYan Zheng { 33055d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 33065d4f98a2SYan Zheng struct extent_map *em; 33070257bb82SYan, Zheng int ret = 0; 33085d4f98a2SYan Zheng 3309172ddd60SDavid Sterba em = alloc_extent_map(); 33100257bb82SYan, Zheng if (!em) 33110257bb82SYan, Zheng return -ENOMEM; 33120257bb82SYan, Zheng 33135d4f98a2SYan Zheng em->start = start; 33140257bb82SYan, Zheng em->len = end + 1 - start; 33150257bb82SYan, Zheng em->block_len = em->len; 33160257bb82SYan, Zheng em->block_start = block_start; 33175d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 33185d4f98a2SYan Zheng 3319d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 33205d4f98a2SYan Zheng while (1) { 3321890871beSChris Mason write_lock(&em_tree->lock); 332209a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3323890871beSChris Mason write_unlock(&em_tree->lock); 33245d4f98a2SYan Zheng if (ret != -EEXIST) { 33255d4f98a2SYan Zheng free_extent_map(em); 33265d4f98a2SYan Zheng break; 33275d4f98a2SYan Zheng } 3328dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 33295d4f98a2SYan Zheng } 3330d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 33310257bb82SYan, Zheng return ret; 33320257bb82SYan, Zheng } 33335d4f98a2SYan Zheng 3334726a3421SQu Wenruo /* 3335726a3421SQu Wenruo * Allow error injection to test balance cancellation 3336726a3421SQu Wenruo */ 3337726a3421SQu Wenruo int btrfs_should_cancel_balance(struct btrfs_fs_info *fs_info) 3338726a3421SQu Wenruo { 3339726a3421SQu Wenruo return atomic_read(&fs_info->balance_cancel_req); 3340726a3421SQu Wenruo } 3341726a3421SQu Wenruo ALLOW_ERROR_INJECTION(btrfs_should_cancel_balance, TRUE); 3342726a3421SQu Wenruo 33430257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 33440257bb82SYan, Zheng struct file_extent_cluster *cluster) 33450257bb82SYan, Zheng { 33462ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 33470257bb82SYan, Zheng u64 page_start; 33480257bb82SYan, Zheng u64 page_end; 33490257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 33500257bb82SYan, Zheng unsigned long index; 33510257bb82SYan, Zheng unsigned long last_index; 33520257bb82SYan, Zheng struct page *page; 33530257bb82SYan, Zheng struct file_ra_state *ra; 33543b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 33550257bb82SYan, Zheng int nr = 0; 33560257bb82SYan, Zheng int ret = 0; 33570257bb82SYan, Zheng 33580257bb82SYan, Zheng if (!cluster->nr) 33590257bb82SYan, Zheng return 0; 33600257bb82SYan, Zheng 33610257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 33620257bb82SYan, Zheng if (!ra) 33630257bb82SYan, Zheng return -ENOMEM; 33640257bb82SYan, Zheng 3365efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 33660257bb82SYan, Zheng if (ret) 3367efa56464SYan, Zheng goto out; 33680257bb82SYan, Zheng 33690257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 33700257bb82SYan, Zheng 3371efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3372efa56464SYan, Zheng cluster->end - offset, cluster->start); 3373efa56464SYan, Zheng if (ret) 3374efa56464SYan, Zheng goto out; 3375efa56464SYan, Zheng 337609cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 337709cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 33780257bb82SYan, Zheng while (index <= last_index) { 33799f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 33809f3db423SNikolay Borisov PAGE_SIZE); 3381efa56464SYan, Zheng if (ret) 3382efa56464SYan, Zheng goto out; 3383efa56464SYan, Zheng 33840257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 33850257bb82SYan, Zheng if (!page) { 33860257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 33870257bb82SYan, Zheng ra, NULL, index, 33880257bb82SYan, Zheng last_index + 1 - index); 3389a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 33903b16a4e3SJosef Bacik mask); 33910257bb82SYan, Zheng if (!page) { 3392691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 339343b18595SQu Wenruo PAGE_SIZE, true); 339444db1216SFilipe Manana btrfs_delalloc_release_extents(BTRFS_I(inode), 33958702ba93SQu Wenruo PAGE_SIZE); 33960257bb82SYan, Zheng ret = -ENOMEM; 3397efa56464SYan, Zheng goto out; 33980257bb82SYan, Zheng } 33990257bb82SYan, Zheng } 34000257bb82SYan, Zheng 34010257bb82SYan, Zheng if (PageReadahead(page)) { 34020257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 34030257bb82SYan, Zheng ra, NULL, page, index, 34040257bb82SYan, Zheng last_index + 1 - index); 34050257bb82SYan, Zheng } 34060257bb82SYan, Zheng 34070257bb82SYan, Zheng if (!PageUptodate(page)) { 34080257bb82SYan, Zheng btrfs_readpage(NULL, page); 34090257bb82SYan, Zheng lock_page(page); 34100257bb82SYan, Zheng if (!PageUptodate(page)) { 34110257bb82SYan, Zheng unlock_page(page); 341209cbfeafSKirill A. Shutemov put_page(page); 3413691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 341443b18595SQu Wenruo PAGE_SIZE, true); 34158b62f87bSJosef Bacik btrfs_delalloc_release_extents(BTRFS_I(inode), 34168702ba93SQu Wenruo PAGE_SIZE); 34170257bb82SYan, Zheng ret = -EIO; 3418efa56464SYan, Zheng goto out; 34190257bb82SYan, Zheng } 34200257bb82SYan, Zheng } 34210257bb82SYan, Zheng 34224eee4fa4SMiao Xie page_start = page_offset(page); 342309cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 34240257bb82SYan, Zheng 3425d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 34260257bb82SYan, Zheng 34270257bb82SYan, Zheng set_page_extent_mapped(page); 34280257bb82SYan, Zheng 34290257bb82SYan, Zheng if (nr < cluster->nr && 34300257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 34310257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 34320257bb82SYan, Zheng page_start, page_end, 3433ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 34340257bb82SYan, Zheng nr++; 34350257bb82SYan, Zheng } 34360257bb82SYan, Zheng 3437765f3cebSNikolay Borisov ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0, 3438330a5827SNikolay Borisov NULL); 3439765f3cebSNikolay Borisov if (ret) { 3440765f3cebSNikolay Borisov unlock_page(page); 3441765f3cebSNikolay Borisov put_page(page); 3442765f3cebSNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 344343b18595SQu Wenruo PAGE_SIZE, true); 3444765f3cebSNikolay Borisov btrfs_delalloc_release_extents(BTRFS_I(inode), 34458702ba93SQu Wenruo PAGE_SIZE); 3446765f3cebSNikolay Borisov 3447765f3cebSNikolay Borisov clear_extent_bits(&BTRFS_I(inode)->io_tree, 3448765f3cebSNikolay Borisov page_start, page_end, 3449765f3cebSNikolay Borisov EXTENT_LOCKED | EXTENT_BOUNDARY); 3450765f3cebSNikolay Borisov goto out; 3451765f3cebSNikolay Borisov 3452765f3cebSNikolay Borisov } 34530257bb82SYan, Zheng set_page_dirty(page); 34540257bb82SYan, Zheng 34550257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3456d0082371SJeff Mahoney page_start, page_end); 34570257bb82SYan, Zheng unlock_page(page); 345809cbfeafSKirill A. Shutemov put_page(page); 34590257bb82SYan, Zheng 34600257bb82SYan, Zheng index++; 34618702ba93SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); 3462efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 34632ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 34647f913c7cSQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 34657f913c7cSQu Wenruo ret = -ECANCELED; 34667f913c7cSQu Wenruo goto out; 34677f913c7cSQu Wenruo } 34680257bb82SYan, Zheng } 34690257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3470efa56464SYan, Zheng out: 34710257bb82SYan, Zheng kfree(ra); 34720257bb82SYan, Zheng return ret; 34730257bb82SYan, Zheng } 34740257bb82SYan, Zheng 34750257bb82SYan, Zheng static noinline_for_stack 34760257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 34770257bb82SYan, Zheng struct file_extent_cluster *cluster) 34780257bb82SYan, Zheng { 34790257bb82SYan, Zheng int ret; 34800257bb82SYan, Zheng 34810257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 34820257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 34830257bb82SYan, Zheng if (ret) 34840257bb82SYan, Zheng return ret; 34850257bb82SYan, Zheng cluster->nr = 0; 34860257bb82SYan, Zheng } 34870257bb82SYan, Zheng 34880257bb82SYan, Zheng if (!cluster->nr) 34890257bb82SYan, Zheng cluster->start = extent_key->objectid; 34900257bb82SYan, Zheng else 34910257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 34920257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 34930257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 34940257bb82SYan, Zheng cluster->nr++; 34950257bb82SYan, Zheng 34960257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 34970257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 34980257bb82SYan, Zheng if (ret) 34990257bb82SYan, Zheng return ret; 35000257bb82SYan, Zheng cluster->nr = 0; 35010257bb82SYan, Zheng } 35020257bb82SYan, Zheng return 0; 35035d4f98a2SYan Zheng } 35045d4f98a2SYan Zheng 35055d4f98a2SYan Zheng /* 35065d4f98a2SYan Zheng * helper to add a tree block to the list. 35075d4f98a2SYan Zheng * the major work is getting the generation and level of the block 35085d4f98a2SYan Zheng */ 35095d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 35105d4f98a2SYan Zheng struct btrfs_key *extent_key, 35115d4f98a2SYan Zheng struct btrfs_path *path, 35125d4f98a2SYan Zheng struct rb_root *blocks) 35135d4f98a2SYan Zheng { 35145d4f98a2SYan Zheng struct extent_buffer *eb; 35155d4f98a2SYan Zheng struct btrfs_extent_item *ei; 35165d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 35175d4f98a2SYan Zheng struct tree_block *block; 35185d4f98a2SYan Zheng struct rb_node *rb_node; 35195d4f98a2SYan Zheng u32 item_size; 35205d4f98a2SYan Zheng int level = -1; 35217fdf4b60SWang Shilong u64 generation; 35225d4f98a2SYan Zheng 35235d4f98a2SYan Zheng eb = path->nodes[0]; 35245d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 35255d4f98a2SYan Zheng 35263173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 35273173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 35285d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 35295d4f98a2SYan Zheng struct btrfs_extent_item); 35303173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 35315d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 35325d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 35335d4f98a2SYan Zheng } else { 35343173a18fSJosef Bacik level = (int)extent_key->offset; 35353173a18fSJosef Bacik } 35363173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 35376d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3538ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3539ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3540ba3c2b19SNikolay Borisov return -EINVAL; 35413173a18fSJosef Bacik } else { 35425d4f98a2SYan Zheng BUG(); 35435d4f98a2SYan Zheng } 35445d4f98a2SYan Zheng 3545b3b4aa74SDavid Sterba btrfs_release_path(path); 35465d4f98a2SYan Zheng 35475d4f98a2SYan Zheng BUG_ON(level == -1); 35485d4f98a2SYan Zheng 35495d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 35505d4f98a2SYan Zheng if (!block) 35515d4f98a2SYan Zheng return -ENOMEM; 35525d4f98a2SYan Zheng 35535d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3554da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 35555d4f98a2SYan Zheng block->key.offset = generation; 35565d4f98a2SYan Zheng block->level = level; 35575d4f98a2SYan Zheng block->key_ready = 0; 35585d4f98a2SYan Zheng 35595d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 356043c04fb1SJeff Mahoney if (rb_node) 356143c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 35625d4f98a2SYan Zheng 35635d4f98a2SYan Zheng return 0; 35645d4f98a2SYan Zheng } 35655d4f98a2SYan Zheng 35665d4f98a2SYan Zheng /* 35675d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 35685d4f98a2SYan Zheng */ 35695d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 35705d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 35715d4f98a2SYan Zheng struct rb_root *blocks) 35725d4f98a2SYan Zheng { 35730b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 35745d4f98a2SYan Zheng struct btrfs_path *path; 35755d4f98a2SYan Zheng struct btrfs_key key; 35765d4f98a2SYan Zheng int ret; 35770b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 35785d4f98a2SYan Zheng 35797476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 35805d4f98a2SYan Zheng return 0; 35815d4f98a2SYan Zheng 35825d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 35835d4f98a2SYan Zheng return 0; 35845d4f98a2SYan Zheng 35855d4f98a2SYan Zheng path = btrfs_alloc_path(); 35865d4f98a2SYan Zheng if (!path) 35875d4f98a2SYan Zheng return -ENOMEM; 3588aee68ee5SJosef Bacik again: 35895d4f98a2SYan Zheng key.objectid = bytenr; 3590aee68ee5SJosef Bacik if (skinny) { 3591aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3592aee68ee5SJosef Bacik key.offset = (u64)-1; 3593aee68ee5SJosef Bacik } else { 35945d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 35955d4f98a2SYan Zheng key.offset = blocksize; 3596aee68ee5SJosef Bacik } 35975d4f98a2SYan Zheng 35985d4f98a2SYan Zheng path->search_commit_root = 1; 35995d4f98a2SYan Zheng path->skip_locking = 1; 36005d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 36015d4f98a2SYan Zheng if (ret < 0) 36025d4f98a2SYan Zheng goto out; 36035d4f98a2SYan Zheng 3604aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3605aee68ee5SJosef Bacik if (path->slots[0]) { 3606aee68ee5SJosef Bacik path->slots[0]--; 3607aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3608aee68ee5SJosef Bacik path->slots[0]); 36093173a18fSJosef Bacik if (key.objectid == bytenr && 3610aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3611aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3612aee68ee5SJosef Bacik key.offset == blocksize))) 36133173a18fSJosef Bacik ret = 0; 36143173a18fSJosef Bacik } 3615aee68ee5SJosef Bacik 3616aee68ee5SJosef Bacik if (ret) { 3617aee68ee5SJosef Bacik skinny = false; 3618aee68ee5SJosef Bacik btrfs_release_path(path); 3619aee68ee5SJosef Bacik goto again; 3620aee68ee5SJosef Bacik } 3621aee68ee5SJosef Bacik } 3622cdccee99SLiu Bo if (ret) { 3623cdccee99SLiu Bo ASSERT(ret == 1); 3624cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3625cdccee99SLiu Bo btrfs_err(fs_info, 3626cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3627cdccee99SLiu Bo bytenr); 3628cdccee99SLiu Bo WARN_ON(1); 3629cdccee99SLiu Bo ret = -EINVAL; 3630cdccee99SLiu Bo goto out; 3631cdccee99SLiu Bo } 36323173a18fSJosef Bacik 36335d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 36345d4f98a2SYan Zheng out: 36355d4f98a2SYan Zheng btrfs_free_path(path); 36365d4f98a2SYan Zheng return ret; 36375d4f98a2SYan Zheng } 36385d4f98a2SYan Zheng 36390af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 364032da5386SDavid Sterba struct btrfs_block_group *block_group, 36411bbc621eSChris Mason struct inode *inode, 36421bbc621eSChris Mason u64 ino) 36430af3d00bSJosef Bacik { 36440af3d00bSJosef Bacik struct btrfs_key key; 36450af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 36460af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 36470af3d00bSJosef Bacik int ret = 0; 36480af3d00bSJosef Bacik 36490af3d00bSJosef Bacik if (inode) 36500af3d00bSJosef Bacik goto truncate; 36510af3d00bSJosef Bacik 36520af3d00bSJosef Bacik key.objectid = ino; 36530af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 36540af3d00bSJosef Bacik key.offset = 0; 36550af3d00bSJosef Bacik 36564c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 36572e19f1f9SAl Viro if (IS_ERR(inode)) 36580af3d00bSJosef Bacik return -ENOENT; 36590af3d00bSJosef Bacik 36600af3d00bSJosef Bacik truncate: 36612ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 36627b61cd92SMiao Xie &fs_info->global_block_rsv); 36637b61cd92SMiao Xie if (ret) 36647b61cd92SMiao Xie goto out; 36657b61cd92SMiao Xie 36667a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 36670af3d00bSJosef Bacik if (IS_ERR(trans)) { 36683612b495STsutomu Itoh ret = PTR_ERR(trans); 36690af3d00bSJosef Bacik goto out; 36700af3d00bSJosef Bacik } 36710af3d00bSJosef Bacik 367277ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 36730af3d00bSJosef Bacik 36743a45bb20SJeff Mahoney btrfs_end_transaction(trans); 36752ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 36760af3d00bSJosef Bacik out: 36770af3d00bSJosef Bacik iput(inode); 36780af3d00bSJosef Bacik return ret; 36790af3d00bSJosef Bacik } 36800af3d00bSJosef Bacik 36815d4f98a2SYan Zheng /* 368219b546d7SQu Wenruo * Locate the free space cache EXTENT_DATA in root tree leaf and delete the 368319b546d7SQu Wenruo * cache inode, to avoid free space cache data extent blocking data relocation. 36845d4f98a2SYan Zheng */ 368519b546d7SQu Wenruo static int delete_v1_space_cache(struct extent_buffer *leaf, 368619b546d7SQu Wenruo struct btrfs_block_group *block_group, 368719b546d7SQu Wenruo u64 data_bytenr) 36885d4f98a2SYan Zheng { 368919b546d7SQu Wenruo u64 space_cache_ino; 369019b546d7SQu Wenruo struct btrfs_file_extent_item *ei; 36915d4f98a2SYan Zheng struct btrfs_key key; 369219b546d7SQu Wenruo bool found = false; 369319b546d7SQu Wenruo int i; 36945d4f98a2SYan Zheng int ret; 36955d4f98a2SYan Zheng 369619b546d7SQu Wenruo if (btrfs_header_owner(leaf) != BTRFS_ROOT_TREE_OBJECTID) 369719b546d7SQu Wenruo return 0; 36985d4f98a2SYan Zheng 369919b546d7SQu Wenruo for (i = 0; i < btrfs_header_nritems(leaf); i++) { 370019b546d7SQu Wenruo btrfs_item_key_to_cpu(leaf, &key, i); 370119b546d7SQu Wenruo if (key.type != BTRFS_EXTENT_DATA_KEY) 370219b546d7SQu Wenruo continue; 370319b546d7SQu Wenruo ei = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 370419b546d7SQu Wenruo if (btrfs_file_extent_type(leaf, ei) == BTRFS_FILE_EXTENT_REG && 370519b546d7SQu Wenruo btrfs_file_extent_disk_bytenr(leaf, ei) == data_bytenr) { 370619b546d7SQu Wenruo found = true; 370719b546d7SQu Wenruo space_cache_ino = key.objectid; 370819b546d7SQu Wenruo break; 370919b546d7SQu Wenruo } 371019b546d7SQu Wenruo } 371119b546d7SQu Wenruo if (!found) 371219b546d7SQu Wenruo return -ENOENT; 371319b546d7SQu Wenruo ret = delete_block_group_cache(leaf->fs_info, block_group, NULL, 371419b546d7SQu Wenruo space_cache_ino); 37150af3d00bSJosef Bacik return ret; 37165d4f98a2SYan Zheng } 37175d4f98a2SYan Zheng 37185d4f98a2SYan Zheng /* 37192c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 37205d4f98a2SYan Zheng */ 37215d4f98a2SYan Zheng static noinline_for_stack 37225d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 37235d4f98a2SYan Zheng struct btrfs_key *extent_key, 37245d4f98a2SYan Zheng struct btrfs_path *path, 37255d4f98a2SYan Zheng struct rb_root *blocks) 37265d4f98a2SYan Zheng { 372719b546d7SQu Wenruo struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 372819b546d7SQu Wenruo struct ulist *leaves = NULL; 372919b546d7SQu Wenruo struct ulist_iterator leaf_uiter; 373019b546d7SQu Wenruo struct ulist_node *ref_node = NULL; 373119b546d7SQu Wenruo const u32 blocksize = fs_info->nodesize; 3732647f63bdSFilipe David Borba Manana int ret = 0; 37335d4f98a2SYan Zheng 3734b3b4aa74SDavid Sterba btrfs_release_path(path); 373519b546d7SQu Wenruo ret = btrfs_find_all_leafs(NULL, fs_info, extent_key->objectid, 373619b546d7SQu Wenruo 0, &leaves, NULL, true); 373719b546d7SQu Wenruo if (ret < 0) 373819b546d7SQu Wenruo return ret; 373919b546d7SQu Wenruo 374019b546d7SQu Wenruo ULIST_ITER_INIT(&leaf_uiter); 374119b546d7SQu Wenruo while ((ref_node = ulist_next(leaves, &leaf_uiter))) { 374219b546d7SQu Wenruo struct extent_buffer *eb; 374319b546d7SQu Wenruo 374419b546d7SQu Wenruo eb = read_tree_block(fs_info, ref_node->val, 0, 0, NULL); 374519b546d7SQu Wenruo if (IS_ERR(eb)) { 374619b546d7SQu Wenruo ret = PTR_ERR(eb); 374719b546d7SQu Wenruo break; 374819b546d7SQu Wenruo } 374919b546d7SQu Wenruo ret = delete_v1_space_cache(eb, rc->block_group, 375019b546d7SQu Wenruo extent_key->objectid); 375119b546d7SQu Wenruo free_extent_buffer(eb); 375219b546d7SQu Wenruo if (ret < 0) 375319b546d7SQu Wenruo break; 375419b546d7SQu Wenruo ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); 375519b546d7SQu Wenruo if (ret < 0) 375619b546d7SQu Wenruo break; 375719b546d7SQu Wenruo } 375819b546d7SQu Wenruo if (ret < 0) 37595d4f98a2SYan Zheng free_block_list(blocks); 376019b546d7SQu Wenruo ulist_free(leaves); 376119b546d7SQu Wenruo return ret; 37625d4f98a2SYan Zheng } 37635d4f98a2SYan Zheng 37645d4f98a2SYan Zheng /* 37652c016dc2SLiu Bo * helper to find next unprocessed extent 37665d4f98a2SYan Zheng */ 37675d4f98a2SYan Zheng static noinline_for_stack 3768147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 37693fd0a558SYan, Zheng struct btrfs_key *extent_key) 37705d4f98a2SYan Zheng { 37710b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 37725d4f98a2SYan Zheng struct btrfs_key key; 37735d4f98a2SYan Zheng struct extent_buffer *leaf; 37745d4f98a2SYan Zheng u64 start, end, last; 37755d4f98a2SYan Zheng int ret; 37765d4f98a2SYan Zheng 3777b3470b5dSDavid Sterba last = rc->block_group->start + rc->block_group->length; 37785d4f98a2SYan Zheng while (1) { 37795d4f98a2SYan Zheng cond_resched(); 37805d4f98a2SYan Zheng if (rc->search_start >= last) { 37815d4f98a2SYan Zheng ret = 1; 37825d4f98a2SYan Zheng break; 37835d4f98a2SYan Zheng } 37845d4f98a2SYan Zheng 37855d4f98a2SYan Zheng key.objectid = rc->search_start; 37865d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 37875d4f98a2SYan Zheng key.offset = 0; 37885d4f98a2SYan Zheng 37895d4f98a2SYan Zheng path->search_commit_root = 1; 37905d4f98a2SYan Zheng path->skip_locking = 1; 37915d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 37925d4f98a2SYan Zheng 0, 0); 37935d4f98a2SYan Zheng if (ret < 0) 37945d4f98a2SYan Zheng break; 37955d4f98a2SYan Zheng next: 37965d4f98a2SYan Zheng leaf = path->nodes[0]; 37975d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 37985d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 37995d4f98a2SYan Zheng if (ret != 0) 38005d4f98a2SYan Zheng break; 38015d4f98a2SYan Zheng leaf = path->nodes[0]; 38025d4f98a2SYan Zheng } 38035d4f98a2SYan Zheng 38045d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 38055d4f98a2SYan Zheng if (key.objectid >= last) { 38065d4f98a2SYan Zheng ret = 1; 38075d4f98a2SYan Zheng break; 38085d4f98a2SYan Zheng } 38095d4f98a2SYan Zheng 38103173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 38113173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 38123173a18fSJosef Bacik path->slots[0]++; 38133173a18fSJosef Bacik goto next; 38143173a18fSJosef Bacik } 38153173a18fSJosef Bacik 38163173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 38175d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 38185d4f98a2SYan Zheng path->slots[0]++; 38195d4f98a2SYan Zheng goto next; 38205d4f98a2SYan Zheng } 38215d4f98a2SYan Zheng 38223173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 38230b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 38243173a18fSJosef Bacik rc->search_start) { 38253173a18fSJosef Bacik path->slots[0]++; 38263173a18fSJosef Bacik goto next; 38273173a18fSJosef Bacik } 38283173a18fSJosef Bacik 38295d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 38305d4f98a2SYan Zheng key.objectid, &start, &end, 3831e6138876SJosef Bacik EXTENT_DIRTY, NULL); 38325d4f98a2SYan Zheng 38335d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3834b3b4aa74SDavid Sterba btrfs_release_path(path); 38355d4f98a2SYan Zheng rc->search_start = end + 1; 38365d4f98a2SYan Zheng } else { 38373173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 38385d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 38393173a18fSJosef Bacik else 38403173a18fSJosef Bacik rc->search_start = key.objectid + 38410b246afaSJeff Mahoney fs_info->nodesize; 38423fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 38435d4f98a2SYan Zheng return 0; 38445d4f98a2SYan Zheng } 38455d4f98a2SYan Zheng } 3846b3b4aa74SDavid Sterba btrfs_release_path(path); 38475d4f98a2SYan Zheng return ret; 38485d4f98a2SYan Zheng } 38495d4f98a2SYan Zheng 38505d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 38515d4f98a2SYan Zheng { 38525d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38537585717fSChris Mason 38547585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 38555d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 38567585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 38575d4f98a2SYan Zheng } 38585d4f98a2SYan Zheng 38595d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 38605d4f98a2SYan Zheng { 38615d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38627585717fSChris Mason 38637585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 38645d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 38657585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 38665d4f98a2SYan Zheng } 38675d4f98a2SYan Zheng 38685d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 38695d4f98a2SYan Zheng { 38705d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 38715d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 38725d4f98a2SYan Zheng return 1; 38735d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 38745d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 38755d4f98a2SYan Zheng return 1; 38765d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 38775d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 38785d4f98a2SYan Zheng return 1; 38795d4f98a2SYan Zheng return 0; 38805d4f98a2SYan Zheng } 38815d4f98a2SYan Zheng 38823fd0a558SYan, Zheng static noinline_for_stack 38833fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 38843fd0a558SYan, Zheng { 38853fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3886ac2fabacSJosef Bacik int ret; 38873fd0a558SYan, Zheng 38882ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 388966d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 38903fd0a558SYan, Zheng if (!rc->block_rsv) 38913fd0a558SYan, Zheng return -ENOMEM; 38923fd0a558SYan, Zheng 38933fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 3894b3470b5dSDavid Sterba rc->search_start = rc->block_group->start; 38953fd0a558SYan, Zheng rc->extents_found = 0; 38963fd0a558SYan, Zheng rc->nodes_relocated = 0; 38973fd0a558SYan, Zheng rc->merging_rsv_size = 0; 38980647bf56SWang Shilong rc->reserved_bytes = 0; 3899da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 39000647bf56SWang Shilong RELOCATION_RESERVED_NODES; 3901ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 3902ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3903ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3904ac2fabacSJosef Bacik if (ret) 3905ac2fabacSJosef Bacik return ret; 39063fd0a558SYan, Zheng 39073fd0a558SYan, Zheng rc->create_reloc_tree = 1; 39083fd0a558SYan, Zheng set_reloc_control(rc); 39093fd0a558SYan, Zheng 39107a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 391128818947SLiu Bo if (IS_ERR(trans)) { 391228818947SLiu Bo unset_reloc_control(rc); 391328818947SLiu Bo /* 391428818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 391528818947SLiu Bo * cleanup. And callers are responsible to free the above 391628818947SLiu Bo * block rsv. 391728818947SLiu Bo */ 391828818947SLiu Bo return PTR_ERR(trans); 391928818947SLiu Bo } 39203a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 39213fd0a558SYan, Zheng return 0; 39223fd0a558SYan, Zheng } 392376dda93cSYan, Zheng 39245d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 39255d4f98a2SYan Zheng { 39262ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39275d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 39285d4f98a2SYan Zheng struct btrfs_key key; 39295d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 39305d4f98a2SYan Zheng struct btrfs_path *path; 39315d4f98a2SYan Zheng struct btrfs_extent_item *ei; 39325d4f98a2SYan Zheng u64 flags; 39335d4f98a2SYan Zheng u32 item_size; 39345d4f98a2SYan Zheng int ret; 39355d4f98a2SYan Zheng int err = 0; 3936c87f08caSChris Mason int progress = 0; 39375d4f98a2SYan Zheng 39385d4f98a2SYan Zheng path = btrfs_alloc_path(); 39393fd0a558SYan, Zheng if (!path) 39405d4f98a2SYan Zheng return -ENOMEM; 3941e4058b54SDavid Sterba path->reada = READA_FORWARD; 39423fd0a558SYan, Zheng 39433fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 39443fd0a558SYan, Zheng if (ret) { 39453fd0a558SYan, Zheng err = ret; 39463fd0a558SYan, Zheng goto out_free; 39472423fdfbSJiri Slaby } 39485d4f98a2SYan Zheng 39495d4f98a2SYan Zheng while (1) { 39500647bf56SWang Shilong rc->reserved_bytes = 0; 39510647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 39520647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 39530647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 39540647bf56SWang Shilong if (ret) { 39550647bf56SWang Shilong err = ret; 39560647bf56SWang Shilong break; 39570647bf56SWang Shilong } 3958c87f08caSChris Mason progress++; 3959a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 39600f788c58SLiu Bo if (IS_ERR(trans)) { 39610f788c58SLiu Bo err = PTR_ERR(trans); 39620f788c58SLiu Bo trans = NULL; 39630f788c58SLiu Bo break; 39640f788c58SLiu Bo } 3965c87f08caSChris Mason restart: 39663fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 39673a45bb20SJeff Mahoney btrfs_end_transaction(trans); 396842a657f5SPan Bian trans = NULL; 39693fd0a558SYan, Zheng continue; 39703fd0a558SYan, Zheng } 39713fd0a558SYan, Zheng 3972147d256eSZhaolei ret = find_next_extent(rc, path, &key); 39735d4f98a2SYan Zheng if (ret < 0) 39745d4f98a2SYan Zheng err = ret; 39755d4f98a2SYan Zheng if (ret != 0) 39765d4f98a2SYan Zheng break; 39775d4f98a2SYan Zheng 39785d4f98a2SYan Zheng rc->extents_found++; 39795d4f98a2SYan Zheng 39805d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 39815d4f98a2SYan Zheng struct btrfs_extent_item); 39823fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 39835d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 39845d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 39855d4f98a2SYan Zheng ret = check_extent_flags(flags); 39865d4f98a2SYan Zheng BUG_ON(ret); 39876d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3988ba3c2b19SNikolay Borisov err = -EINVAL; 3989ba3c2b19SNikolay Borisov btrfs_print_v0_err(trans->fs_info); 3990ba3c2b19SNikolay Borisov btrfs_abort_transaction(trans, err); 3991ba3c2b19SNikolay Borisov break; 39925d4f98a2SYan Zheng } else { 39935d4f98a2SYan Zheng BUG(); 39945d4f98a2SYan Zheng } 39955d4f98a2SYan Zheng 39965d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 39975d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 39985d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 39995d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40005d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 40015d4f98a2SYan Zheng } else { 4002b3b4aa74SDavid Sterba btrfs_release_path(path); 40035d4f98a2SYan Zheng ret = 0; 40045d4f98a2SYan Zheng } 40055d4f98a2SYan Zheng if (ret < 0) { 40063fd0a558SYan, Zheng err = ret; 40075d4f98a2SYan Zheng break; 40085d4f98a2SYan Zheng } 40095d4f98a2SYan Zheng 40105d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 40115d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 40125d4f98a2SYan Zheng if (ret < 0) { 40133fd0a558SYan, Zheng if (ret != -EAGAIN) { 40145d4f98a2SYan Zheng err = ret; 40155d4f98a2SYan Zheng break; 40165d4f98a2SYan Zheng } 40173fd0a558SYan, Zheng rc->extents_found--; 40183fd0a558SYan, Zheng rc->search_start = key.objectid; 40193fd0a558SYan, Zheng } 40205d4f98a2SYan Zheng } 40215d4f98a2SYan Zheng 40223a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 40232ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 40243fd0a558SYan, Zheng trans = NULL; 40255d4f98a2SYan Zheng 40265d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 40275d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40285d4f98a2SYan Zheng rc->found_file_extent = 1; 40290257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 40303fd0a558SYan, Zheng &key, &rc->cluster); 40315d4f98a2SYan Zheng if (ret < 0) { 40325d4f98a2SYan Zheng err = ret; 40335d4f98a2SYan Zheng break; 40345d4f98a2SYan Zheng } 40355d4f98a2SYan Zheng } 4036f31ea088SQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 4037f31ea088SQu Wenruo err = -ECANCELED; 4038f31ea088SQu Wenruo break; 4039f31ea088SQu Wenruo } 40405d4f98a2SYan Zheng } 4041c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 404243a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 40439689457bSShilong Wang if (ret == 1) { 4044c87f08caSChris Mason err = 0; 4045c87f08caSChris Mason progress = 0; 4046c87f08caSChris Mason goto restart; 4047c87f08caSChris Mason } 4048c87f08caSChris Mason } 40493fd0a558SYan, Zheng 4050b3b4aa74SDavid Sterba btrfs_release_path(path); 405191166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 40525d4f98a2SYan Zheng 40535d4f98a2SYan Zheng if (trans) { 40543a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 40552ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 40565d4f98a2SYan Zheng } 40575d4f98a2SYan Zheng 40580257bb82SYan, Zheng if (!err) { 40593fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 40603fd0a558SYan, Zheng &rc->cluster); 40610257bb82SYan, Zheng if (ret < 0) 40620257bb82SYan, Zheng err = ret; 40630257bb82SYan, Zheng } 40640257bb82SYan, Zheng 40653fd0a558SYan, Zheng rc->create_reloc_tree = 0; 40663fd0a558SYan, Zheng set_reloc_control(rc); 40670257bb82SYan, Zheng 40683fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 406963f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 40705d4f98a2SYan Zheng 40717f913c7cSQu Wenruo /* 40727f913c7cSQu Wenruo * Even in the case when the relocation is cancelled, we should all go 40737f913c7cSQu Wenruo * through prepare_to_merge() and merge_reloc_roots(). 40747f913c7cSQu Wenruo * 40757f913c7cSQu Wenruo * For error (including cancelled balance), prepare_to_merge() will 40767f913c7cSQu Wenruo * mark all reloc trees orphan, then queue them for cleanup in 40777f913c7cSQu Wenruo * merge_reloc_roots() 40787f913c7cSQu Wenruo */ 40793fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 40805d4f98a2SYan Zheng 40815d4f98a2SYan Zheng merge_reloc_roots(rc); 40825d4f98a2SYan Zheng 40833fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 40845d4f98a2SYan Zheng unset_reloc_control(rc); 408563f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 40865d4f98a2SYan Zheng 40875d4f98a2SYan Zheng /* get rid of pinned extents */ 40887a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 408962b99540SQu Wenruo if (IS_ERR(trans)) { 40903612b495STsutomu Itoh err = PTR_ERR(trans); 409162b99540SQu Wenruo goto out_free; 409262b99540SQu Wenruo } 40933a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 40946217b0faSJosef Bacik out_free: 4095d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4096d2311e69SQu Wenruo if (ret < 0 && !err) 4097d2311e69SQu Wenruo err = ret; 40982ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 40993fd0a558SYan, Zheng btrfs_free_path(path); 41005d4f98a2SYan Zheng return err; 41015d4f98a2SYan Zheng } 41025d4f98a2SYan Zheng 41035d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 41040257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 41055d4f98a2SYan Zheng { 41065d4f98a2SYan Zheng struct btrfs_path *path; 41075d4f98a2SYan Zheng struct btrfs_inode_item *item; 41085d4f98a2SYan Zheng struct extent_buffer *leaf; 41095d4f98a2SYan Zheng int ret; 41105d4f98a2SYan Zheng 41115d4f98a2SYan Zheng path = btrfs_alloc_path(); 41125d4f98a2SYan Zheng if (!path) 41135d4f98a2SYan Zheng return -ENOMEM; 41145d4f98a2SYan Zheng 41155d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 41165d4f98a2SYan Zheng if (ret) 41175d4f98a2SYan Zheng goto out; 41185d4f98a2SYan Zheng 41195d4f98a2SYan Zheng leaf = path->nodes[0]; 41205d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 4121b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 41225d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 41230257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 41245d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 41253fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 41263fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 41275d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 41285d4f98a2SYan Zheng out: 41295d4f98a2SYan Zheng btrfs_free_path(path); 41305d4f98a2SYan Zheng return ret; 41315d4f98a2SYan Zheng } 41325d4f98a2SYan Zheng 41335d4f98a2SYan Zheng /* 41345d4f98a2SYan Zheng * helper to create inode for data relocation. 41355d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 41365d4f98a2SYan Zheng */ 41373fd0a558SYan, Zheng static noinline_for_stack 41383fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 413932da5386SDavid Sterba struct btrfs_block_group *group) 41405d4f98a2SYan Zheng { 41415d4f98a2SYan Zheng struct inode *inode = NULL; 41425d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 41435d4f98a2SYan Zheng struct btrfs_root *root; 41445d4f98a2SYan Zheng struct btrfs_key key; 41454624900dSZhaolei u64 objectid; 41465d4f98a2SYan Zheng int err = 0; 41475d4f98a2SYan Zheng 41485d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 41495d4f98a2SYan Zheng if (IS_ERR(root)) 41505d4f98a2SYan Zheng return ERR_CAST(root); 41515d4f98a2SYan Zheng 4152a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 415376deacf0SJosef Bacik if (IS_ERR(trans)) { 415400246528SJosef Bacik btrfs_put_root(root); 41553fd0a558SYan, Zheng return ERR_CAST(trans); 415676deacf0SJosef Bacik } 41575d4f98a2SYan Zheng 4158581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 41595d4f98a2SYan Zheng if (err) 41605d4f98a2SYan Zheng goto out; 41615d4f98a2SYan Zheng 41620257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 41635d4f98a2SYan Zheng BUG_ON(err); 41645d4f98a2SYan Zheng 41655d4f98a2SYan Zheng key.objectid = objectid; 41665d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 41675d4f98a2SYan Zheng key.offset = 0; 41684c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 41692e19f1f9SAl Viro BUG_ON(IS_ERR(inode)); 4170b3470b5dSDavid Sterba BTRFS_I(inode)->index_cnt = group->start; 41715d4f98a2SYan Zheng 417273f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 41735d4f98a2SYan Zheng out: 417400246528SJosef Bacik btrfs_put_root(root); 41753a45bb20SJeff Mahoney btrfs_end_transaction(trans); 41762ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 41775d4f98a2SYan Zheng if (err) { 41785d4f98a2SYan Zheng if (inode) 41795d4f98a2SYan Zheng iput(inode); 41805d4f98a2SYan Zheng inode = ERR_PTR(err); 41815d4f98a2SYan Zheng } 41825d4f98a2SYan Zheng return inode; 41835d4f98a2SYan Zheng } 41845d4f98a2SYan Zheng 4185c258d6e3SQu Wenruo static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 41863fd0a558SYan, Zheng { 41873fd0a558SYan, Zheng struct reloc_control *rc; 41883fd0a558SYan, Zheng 41893fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 41903fd0a558SYan, Zheng if (!rc) 41913fd0a558SYan, Zheng return NULL; 41923fd0a558SYan, Zheng 41933fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 4194d2311e69SQu Wenruo INIT_LIST_HEAD(&rc->dirty_subvol_roots); 419533a0f1f7SQu Wenruo backref_cache_init(fs_info, &rc->backref_cache); 41963fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 419743eb5f29SQu Wenruo extent_io_tree_init(fs_info, &rc->processed_blocks, 419843eb5f29SQu Wenruo IO_TREE_RELOC_BLOCKS, NULL); 41993fd0a558SYan, Zheng return rc; 42003fd0a558SYan, Zheng } 42013fd0a558SYan, Zheng 42021a0afa0eSJosef Bacik static void free_reloc_control(struct reloc_control *rc) 42031a0afa0eSJosef Bacik { 42041a0afa0eSJosef Bacik struct mapping_node *node, *tmp; 42051a0afa0eSJosef Bacik 42061a0afa0eSJosef Bacik free_reloc_roots(&rc->reloc_roots); 42071a0afa0eSJosef Bacik rbtree_postorder_for_each_entry_safe(node, tmp, 42081a0afa0eSJosef Bacik &rc->reloc_root_tree.rb_root, rb_node) 42091a0afa0eSJosef Bacik kfree(node); 42101a0afa0eSJosef Bacik 42111a0afa0eSJosef Bacik kfree(rc); 42121a0afa0eSJosef Bacik } 42131a0afa0eSJosef Bacik 42145d4f98a2SYan Zheng /* 4215ebce0e01SAdam Borowski * Print the block group being relocated 4216ebce0e01SAdam Borowski */ 4217ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 421832da5386SDavid Sterba struct btrfs_block_group *block_group) 4219ebce0e01SAdam Borowski { 4220f89e09cfSAnand Jain char buf[128] = {'\0'}; 4221ebce0e01SAdam Borowski 4222f89e09cfSAnand Jain btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); 4223ebce0e01SAdam Borowski 4224ebce0e01SAdam Borowski btrfs_info(fs_info, 4225ebce0e01SAdam Borowski "relocating block group %llu flags %s", 4226b3470b5dSDavid Sterba block_group->start, buf); 4227ebce0e01SAdam Borowski } 4228ebce0e01SAdam Borowski 4229430640e3SQu Wenruo static const char *stage_to_string(int stage) 4230430640e3SQu Wenruo { 4231430640e3SQu Wenruo if (stage == MOVE_DATA_EXTENTS) 4232430640e3SQu Wenruo return "move data extents"; 4233430640e3SQu Wenruo if (stage == UPDATE_DATA_PTRS) 4234430640e3SQu Wenruo return "update data pointers"; 4235430640e3SQu Wenruo return "unknown"; 4236430640e3SQu Wenruo } 4237430640e3SQu Wenruo 4238ebce0e01SAdam Borowski /* 42395d4f98a2SYan Zheng * function to relocate all extents in a block group. 42405d4f98a2SYan Zheng */ 42416bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 42425d4f98a2SYan Zheng { 424332da5386SDavid Sterba struct btrfs_block_group *bg; 42446bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 42455d4f98a2SYan Zheng struct reloc_control *rc; 42460af3d00bSJosef Bacik struct inode *inode; 42470af3d00bSJosef Bacik struct btrfs_path *path; 42485d4f98a2SYan Zheng int ret; 4249f0486c68SYan, Zheng int rw = 0; 42505d4f98a2SYan Zheng int err = 0; 42515d4f98a2SYan Zheng 4252eede2bf3SOmar Sandoval bg = btrfs_lookup_block_group(fs_info, group_start); 4253eede2bf3SOmar Sandoval if (!bg) 4254eede2bf3SOmar Sandoval return -ENOENT; 4255eede2bf3SOmar Sandoval 4256eede2bf3SOmar Sandoval if (btrfs_pinned_by_swapfile(fs_info, bg)) { 4257eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 4258eede2bf3SOmar Sandoval return -ETXTBSY; 4259eede2bf3SOmar Sandoval } 4260eede2bf3SOmar Sandoval 4261c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 4262eede2bf3SOmar Sandoval if (!rc) { 4263eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 42645d4f98a2SYan Zheng return -ENOMEM; 4265eede2bf3SOmar Sandoval } 42665d4f98a2SYan Zheng 4267f0486c68SYan, Zheng rc->extent_root = extent_root; 4268eede2bf3SOmar Sandoval rc->block_group = bg; 42695d4f98a2SYan Zheng 4270b12de528SQu Wenruo ret = btrfs_inc_block_group_ro(rc->block_group, true); 4271f0486c68SYan, Zheng if (ret) { 4272f0486c68SYan, Zheng err = ret; 4273f0486c68SYan, Zheng goto out; 4274f0486c68SYan, Zheng } 4275f0486c68SYan, Zheng rw = 1; 4276f0486c68SYan, Zheng 42770af3d00bSJosef Bacik path = btrfs_alloc_path(); 42780af3d00bSJosef Bacik if (!path) { 42790af3d00bSJosef Bacik err = -ENOMEM; 42800af3d00bSJosef Bacik goto out; 42810af3d00bSJosef Bacik } 42820af3d00bSJosef Bacik 42837949f339SDavid Sterba inode = lookup_free_space_inode(rc->block_group, path); 42840af3d00bSJosef Bacik btrfs_free_path(path); 42850af3d00bSJosef Bacik 42860af3d00bSJosef Bacik if (!IS_ERR(inode)) 42871bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 42880af3d00bSJosef Bacik else 42890af3d00bSJosef Bacik ret = PTR_ERR(inode); 42900af3d00bSJosef Bacik 42910af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 42920af3d00bSJosef Bacik err = ret; 42930af3d00bSJosef Bacik goto out; 42940af3d00bSJosef Bacik } 42950af3d00bSJosef Bacik 42965d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 42975d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 42985d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 42995d4f98a2SYan Zheng rc->data_inode = NULL; 43005d4f98a2SYan Zheng goto out; 43015d4f98a2SYan Zheng } 43025d4f98a2SYan Zheng 43030b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 43045d4f98a2SYan Zheng 43059cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4306f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 43076374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 4308b3470b5dSDavid Sterba rc->block_group->start, 4309b3470b5dSDavid Sterba rc->block_group->length); 43105d4f98a2SYan Zheng 43115d4f98a2SYan Zheng while (1) { 4312430640e3SQu Wenruo int finishes_stage; 4313430640e3SQu Wenruo 431476dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 43155d4f98a2SYan Zheng ret = relocate_block_group(rc); 431676dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 4317ff612ba7SJosef Bacik if (ret < 0) 43185d4f98a2SYan Zheng err = ret; 4319ff612ba7SJosef Bacik 4320430640e3SQu Wenruo finishes_stage = rc->stage; 4321ff612ba7SJosef Bacik /* 4322ff612ba7SJosef Bacik * We may have gotten ENOSPC after we already dirtied some 4323ff612ba7SJosef Bacik * extents. If writeout happens while we're relocating a 4324ff612ba7SJosef Bacik * different block group we could end up hitting the 4325ff612ba7SJosef Bacik * BUG_ON(rc->stage == UPDATE_DATA_PTRS) in 4326ff612ba7SJosef Bacik * btrfs_reloc_cow_block. Make sure we write everything out 4327ff612ba7SJosef Bacik * properly so we don't trip over this problem, and then break 4328ff612ba7SJosef Bacik * out of the loop if we hit an error. 4329ff612ba7SJosef Bacik */ 4330ff612ba7SJosef Bacik if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 4331ff612ba7SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 4332ff612ba7SJosef Bacik (u64)-1); 4333ff612ba7SJosef Bacik if (ret) 4334ff612ba7SJosef Bacik err = ret; 4335ff612ba7SJosef Bacik invalidate_mapping_pages(rc->data_inode->i_mapping, 4336ff612ba7SJosef Bacik 0, -1); 4337ff612ba7SJosef Bacik rc->stage = UPDATE_DATA_PTRS; 43385d4f98a2SYan Zheng } 43395d4f98a2SYan Zheng 4340ff612ba7SJosef Bacik if (err < 0) 4341ff612ba7SJosef Bacik goto out; 4342ff612ba7SJosef Bacik 43435d4f98a2SYan Zheng if (rc->extents_found == 0) 43445d4f98a2SYan Zheng break; 43455d4f98a2SYan Zheng 4346430640e3SQu Wenruo btrfs_info(fs_info, "found %llu extents, stage: %s", 4347430640e3SQu Wenruo rc->extents_found, stage_to_string(finishes_stage)); 43485d4f98a2SYan Zheng } 43495d4f98a2SYan Zheng 43505d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 43515d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 4352bf38be65SDavid Sterba WARN_ON(rc->block_group->used > 0); 43535d4f98a2SYan Zheng out: 4354f0486c68SYan, Zheng if (err && rw) 43552ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 43565d4f98a2SYan Zheng iput(rc->data_inode); 43575d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 43581a0afa0eSJosef Bacik free_reloc_control(rc); 43595d4f98a2SYan Zheng return err; 43605d4f98a2SYan Zheng } 43615d4f98a2SYan Zheng 436276dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 436376dda93cSYan, Zheng { 43640b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 436576dda93cSYan, Zheng struct btrfs_trans_handle *trans; 436679787eaaSJeff Mahoney int ret, err; 436776dda93cSYan, Zheng 43680b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 436979787eaaSJeff Mahoney if (IS_ERR(trans)) 437079787eaaSJeff Mahoney return PTR_ERR(trans); 437176dda93cSYan, Zheng 437276dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 437376dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 437476dda93cSYan, Zheng root->root_item.drop_level = 0; 437576dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 43760b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 437776dda93cSYan, Zheng &root->root_key, &root->root_item); 437876dda93cSYan, Zheng 43793a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 438079787eaaSJeff Mahoney if (err) 438179787eaaSJeff Mahoney return err; 438279787eaaSJeff Mahoney return ret; 438376dda93cSYan, Zheng } 438476dda93cSYan, Zheng 43855d4f98a2SYan Zheng /* 43865d4f98a2SYan Zheng * recover relocation interrupted by system crash. 43875d4f98a2SYan Zheng * 43885d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 43895d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 43905d4f98a2SYan Zheng */ 43915d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 43925d4f98a2SYan Zheng { 43930b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 43945d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 43955d4f98a2SYan Zheng struct btrfs_key key; 43965d4f98a2SYan Zheng struct btrfs_root *fs_root; 43975d4f98a2SYan Zheng struct btrfs_root *reloc_root; 43985d4f98a2SYan Zheng struct btrfs_path *path; 43995d4f98a2SYan Zheng struct extent_buffer *leaf; 44005d4f98a2SYan Zheng struct reloc_control *rc = NULL; 44015d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 44025d4f98a2SYan Zheng int ret; 44035d4f98a2SYan Zheng int err = 0; 44045d4f98a2SYan Zheng 44055d4f98a2SYan Zheng path = btrfs_alloc_path(); 44065d4f98a2SYan Zheng if (!path) 44075d4f98a2SYan Zheng return -ENOMEM; 4408e4058b54SDavid Sterba path->reada = READA_BACK; 44095d4f98a2SYan Zheng 44105d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 44115d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 44125d4f98a2SYan Zheng key.offset = (u64)-1; 44135d4f98a2SYan Zheng 44145d4f98a2SYan Zheng while (1) { 44150b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 44165d4f98a2SYan Zheng path, 0, 0); 44175d4f98a2SYan Zheng if (ret < 0) { 44185d4f98a2SYan Zheng err = ret; 44195d4f98a2SYan Zheng goto out; 44205d4f98a2SYan Zheng } 44215d4f98a2SYan Zheng if (ret > 0) { 44225d4f98a2SYan Zheng if (path->slots[0] == 0) 44235d4f98a2SYan Zheng break; 44245d4f98a2SYan Zheng path->slots[0]--; 44255d4f98a2SYan Zheng } 44265d4f98a2SYan Zheng leaf = path->nodes[0]; 44275d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4428b3b4aa74SDavid Sterba btrfs_release_path(path); 44295d4f98a2SYan Zheng 44305d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 44315d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 44325d4f98a2SYan Zheng break; 44335d4f98a2SYan Zheng 44343dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(root, &key); 44355d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 44365d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 44375d4f98a2SYan Zheng goto out; 44385d4f98a2SYan Zheng } 44395d4f98a2SYan Zheng 44403dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 44415d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 44425d4f98a2SYan Zheng 44435d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 44440b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, 44455d4f98a2SYan Zheng reloc_root->root_key.offset); 44465d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 444776dda93cSYan, Zheng ret = PTR_ERR(fs_root); 444876dda93cSYan, Zheng if (ret != -ENOENT) { 444976dda93cSYan, Zheng err = ret; 44505d4f98a2SYan Zheng goto out; 44515d4f98a2SYan Zheng } 445279787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 445379787eaaSJeff Mahoney if (ret < 0) { 445479787eaaSJeff Mahoney err = ret; 445579787eaaSJeff Mahoney goto out; 445679787eaaSJeff Mahoney } 4457932fd26dSJosef Bacik } else { 445800246528SJosef Bacik btrfs_put_root(fs_root); 445976dda93cSYan, Zheng } 44605d4f98a2SYan Zheng } 44615d4f98a2SYan Zheng 44625d4f98a2SYan Zheng if (key.offset == 0) 44635d4f98a2SYan Zheng break; 44645d4f98a2SYan Zheng 44655d4f98a2SYan Zheng key.offset--; 44665d4f98a2SYan Zheng } 4467b3b4aa74SDavid Sterba btrfs_release_path(path); 44685d4f98a2SYan Zheng 44695d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 44705d4f98a2SYan Zheng goto out; 44715d4f98a2SYan Zheng 4472c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 44735d4f98a2SYan Zheng if (!rc) { 44745d4f98a2SYan Zheng err = -ENOMEM; 44755d4f98a2SYan Zheng goto out; 44765d4f98a2SYan Zheng } 44775d4f98a2SYan Zheng 44780b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 44795d4f98a2SYan Zheng 44805d4f98a2SYan Zheng set_reloc_control(rc); 44815d4f98a2SYan Zheng 44827a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 44833612b495STsutomu Itoh if (IS_ERR(trans)) { 44843612b495STsutomu Itoh err = PTR_ERR(trans); 4485fb2d83eeSJosef Bacik goto out_unset; 44863612b495STsutomu Itoh } 44873fd0a558SYan, Zheng 44883fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 44893fd0a558SYan, Zheng 44905d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 44915d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 44925d4f98a2SYan Zheng struct btrfs_root, root_list); 44935d4f98a2SYan Zheng list_del(&reloc_root->root_list); 44945d4f98a2SYan Zheng 44955d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 44965d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 44975d4f98a2SYan Zheng &rc->reloc_roots); 44985d4f98a2SYan Zheng continue; 44995d4f98a2SYan Zheng } 45005d4f98a2SYan Zheng 45010b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, reloc_root->root_key.offset); 450279787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 450379787eaaSJeff Mahoney err = PTR_ERR(fs_root); 4504ca1aa281SJosef Bacik list_add_tail(&reloc_root->root_list, &reloc_roots); 45051402d17dSXiyu Yang btrfs_end_transaction(trans); 4506fb2d83eeSJosef Bacik goto out_unset; 450779787eaaSJeff Mahoney } 45085d4f98a2SYan Zheng 4509ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 451079787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 4511f44deb74SJosef Bacik fs_root->reloc_root = btrfs_grab_root(reloc_root); 451200246528SJosef Bacik btrfs_put_root(fs_root); 45135d4f98a2SYan Zheng } 45145d4f98a2SYan Zheng 45153a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 451679787eaaSJeff Mahoney if (err) 4517fb2d83eeSJosef Bacik goto out_unset; 45185d4f98a2SYan Zheng 45195d4f98a2SYan Zheng merge_reloc_roots(rc); 45205d4f98a2SYan Zheng 45215d4f98a2SYan Zheng unset_reloc_control(rc); 45225d4f98a2SYan Zheng 45237a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 452462b99540SQu Wenruo if (IS_ERR(trans)) { 45253612b495STsutomu Itoh err = PTR_ERR(trans); 45266217b0faSJosef Bacik goto out_clean; 452762b99540SQu Wenruo } 45283a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 45296217b0faSJosef Bacik out_clean: 4530d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4531d2311e69SQu Wenruo if (ret < 0 && !err) 4532d2311e69SQu Wenruo err = ret; 4533fb2d83eeSJosef Bacik out_unset: 4534fb2d83eeSJosef Bacik unset_reloc_control(rc); 45351a0afa0eSJosef Bacik free_reloc_control(rc); 45363612b495STsutomu Itoh out: 4537aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4538aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4539aca1bba6SLiu Bo 45405d4f98a2SYan Zheng btrfs_free_path(path); 45415d4f98a2SYan Zheng 45425d4f98a2SYan Zheng if (err == 0) { 45435d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 45440b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 4545932fd26dSJosef Bacik if (IS_ERR(fs_root)) { 45465d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4547932fd26dSJosef Bacik } else { 454866b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 454900246528SJosef Bacik btrfs_put_root(fs_root); 4550932fd26dSJosef Bacik } 4551932fd26dSJosef Bacik } 45525d4f98a2SYan Zheng return err; 45535d4f98a2SYan Zheng } 45545d4f98a2SYan Zheng 45555d4f98a2SYan Zheng /* 45565d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 45575d4f98a2SYan Zheng * 45585d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 45595d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 45605d4f98a2SYan Zheng */ 45615d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 45625d4f98a2SYan Zheng { 45630b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 45645d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 45655d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 45665d4f98a2SYan Zheng int ret; 45675d4f98a2SYan Zheng u64 disk_bytenr; 45684577b014SJosef Bacik u64 new_bytenr; 45695d4f98a2SYan Zheng LIST_HEAD(list); 45705d4f98a2SYan Zheng 45715d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 4572bffe633eSOmar Sandoval BUG_ON(ordered->file_offset != file_pos || ordered->num_bytes != len); 45735d4f98a2SYan Zheng 45745d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 45750b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4576a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 457779787eaaSJeff Mahoney if (ret) 457879787eaaSJeff Mahoney goto out; 45795d4f98a2SYan Zheng 45805d4f98a2SYan Zheng while (!list_empty(&list)) { 45815d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 45825d4f98a2SYan Zheng list_del_init(&sums->list); 45835d4f98a2SYan Zheng 45844577b014SJosef Bacik /* 45854577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 45864577b014SJosef Bacik * We need to do this because we will read in entire prealloc 45874577b014SJosef Bacik * extents but we may have written to say the middle of the 45884577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 45894577b014SJosef Bacik * the right disk offset. 45904577b014SJosef Bacik * 45914577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 45924577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 45934577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 45944577b014SJosef Bacik * disk length. 45954577b014SJosef Bacik */ 4596bffe633eSOmar Sandoval new_bytenr = ordered->disk_bytenr + sums->bytenr - disk_bytenr; 45974577b014SJosef Bacik sums->bytenr = new_bytenr; 45985d4f98a2SYan Zheng 4599f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 46005d4f98a2SYan Zheng } 460179787eaaSJeff Mahoney out: 46025d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4603411fc6bcSAndi Kleen return ret; 46045d4f98a2SYan Zheng } 46053fd0a558SYan, Zheng 460683d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 46073fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 46083fd0a558SYan, Zheng struct extent_buffer *cow) 46093fd0a558SYan, Zheng { 46100b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 46113fd0a558SYan, Zheng struct reloc_control *rc; 46123fd0a558SYan, Zheng struct backref_node *node; 46133fd0a558SYan, Zheng int first_cow = 0; 46143fd0a558SYan, Zheng int level; 461583d4cfd4SJosef Bacik int ret = 0; 46163fd0a558SYan, Zheng 46170b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 46183fd0a558SYan, Zheng if (!rc) 461983d4cfd4SJosef Bacik return 0; 46203fd0a558SYan, Zheng 46213fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 46223fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 46233fd0a558SYan, Zheng 46243fd0a558SYan, Zheng level = btrfs_header_level(buf); 46253fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 46263fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 46273fd0a558SYan, Zheng first_cow = 1; 46283fd0a558SYan, Zheng 46293fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 46303fd0a558SYan, Zheng rc->create_reloc_tree) { 46313fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 46323fd0a558SYan, Zheng 46333fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 46343fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 46353fd0a558SYan, Zheng node->new_bytenr != buf->start); 46363fd0a558SYan, Zheng 46373fd0a558SYan, Zheng drop_node_buffer(node); 463867439dadSDavid Sterba atomic_inc(&cow->refs); 46393fd0a558SYan, Zheng node->eb = cow; 46403fd0a558SYan, Zheng node->new_bytenr = cow->start; 46413fd0a558SYan, Zheng 46423fd0a558SYan, Zheng if (!node->pending) { 46433fd0a558SYan, Zheng list_move_tail(&node->list, 46443fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 46453fd0a558SYan, Zheng node->pending = 1; 46463fd0a558SYan, Zheng } 46473fd0a558SYan, Zheng 46483fd0a558SYan, Zheng if (first_cow) 46499569cc20SQu Wenruo mark_block_processed(rc, node); 46503fd0a558SYan, Zheng 46513fd0a558SYan, Zheng if (first_cow && level > 0) 46523fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 46533fd0a558SYan, Zheng } 46543fd0a558SYan, Zheng 465583d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 46563fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 465783d4cfd4SJosef Bacik return ret; 46583fd0a558SYan, Zheng } 46593fd0a558SYan, Zheng 46603fd0a558SYan, Zheng /* 46613fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 466201327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 46633fd0a558SYan, Zheng */ 4664147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 46653fd0a558SYan, Zheng u64 *bytes_to_reserve) 46663fd0a558SYan, Zheng { 466710995c04SQu Wenruo struct btrfs_root *root = pending->root; 466810995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 46693fd0a558SYan, Zheng 46706282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 46713fd0a558SYan, Zheng return; 46723fd0a558SYan, Zheng 46733fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 46743fd0a558SYan, Zheng return; 46753fd0a558SYan, Zheng 46763fd0a558SYan, Zheng root = root->reloc_root; 46773fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 46783fd0a558SYan, Zheng /* 46793fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 46803fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 46813fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 46823fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 46833fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 46843fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 46853fd0a558SYan, Zheng * tree may use more space than it frees. so we need 46863fd0a558SYan, Zheng * reserve extra space. 46873fd0a558SYan, Zheng */ 46883fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 46893fd0a558SYan, Zheng } 46903fd0a558SYan, Zheng 46913fd0a558SYan, Zheng /* 46923fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 46933fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 4694f44deb74SJosef Bacik * 4695f44deb74SJosef Bacik * This is similar to btrfs_init_reloc_root(), we come out of here with two 4696f44deb74SJosef Bacik * references held on the reloc_root, one for root->reloc_root and one for 4697f44deb74SJosef Bacik * rc->reloc_roots. 46983fd0a558SYan, Zheng */ 469949b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 47003fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 47013fd0a558SYan, Zheng { 47023fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 47033fd0a558SYan, Zheng struct btrfs_root *reloc_root; 47043fd0a558SYan, Zheng struct btrfs_root *new_root; 470510995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 47063fd0a558SYan, Zheng int ret; 47073fd0a558SYan, Zheng 47086282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 470949b25e05SJeff Mahoney return 0; 47103fd0a558SYan, Zheng 47113fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 47123fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 47133fd0a558SYan, Zheng 47143fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 47153fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 47163fd0a558SYan, Zheng rc->block_rsv, 47173a584174SLu Fengqi rc->nodes_relocated, true); 471849b25e05SJeff Mahoney if (ret) 471949b25e05SJeff Mahoney return ret; 47203fd0a558SYan, Zheng } 47213fd0a558SYan, Zheng 47223fd0a558SYan, Zheng new_root = pending->snap; 47233fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 47243fd0a558SYan, Zheng new_root->root_key.objectid); 472549b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 472649b25e05SJeff Mahoney return PTR_ERR(reloc_root); 47273fd0a558SYan, Zheng 4728ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4729ffd7b339SJeff Mahoney BUG_ON(ret < 0); 4730f44deb74SJosef Bacik new_root->reloc_root = btrfs_grab_root(reloc_root); 47313fd0a558SYan, Zheng 473249b25e05SJeff Mahoney if (rc->create_reloc_tree) 47333fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 473449b25e05SJeff Mahoney return ret; 47353fd0a558SYan, Zheng } 4736