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; 1675d4f98a2SYan Zheng }; 1685d4f98a2SYan Zheng 1695d4f98a2SYan Zheng /* 1705d4f98a2SYan Zheng * map address of tree root to tree 1715d4f98a2SYan Zheng */ 1725d4f98a2SYan Zheng struct mapping_node { 1735d4f98a2SYan Zheng struct rb_node rb_node; 1745d4f98a2SYan Zheng u64 bytenr; 1755d4f98a2SYan Zheng void *data; 1765d4f98a2SYan Zheng }; 1775d4f98a2SYan Zheng 1785d4f98a2SYan Zheng struct mapping_tree { 1795d4f98a2SYan Zheng struct rb_root rb_root; 1805d4f98a2SYan Zheng spinlock_t lock; 1815d4f98a2SYan Zheng }; 1825d4f98a2SYan Zheng 1835d4f98a2SYan Zheng /* 1845d4f98a2SYan Zheng * present a tree block to process 1855d4f98a2SYan Zheng */ 1865d4f98a2SYan Zheng struct tree_block { 1875d4f98a2SYan Zheng struct rb_node rb_node; 1885d4f98a2SYan Zheng u64 bytenr; 1895d4f98a2SYan Zheng struct btrfs_key key; 1905d4f98a2SYan Zheng unsigned int level:8; 1915d4f98a2SYan Zheng unsigned int key_ready:1; 1925d4f98a2SYan Zheng }; 1935d4f98a2SYan Zheng 1940257bb82SYan, Zheng #define MAX_EXTENTS 128 1950257bb82SYan, Zheng 1960257bb82SYan, Zheng struct file_extent_cluster { 1970257bb82SYan, Zheng u64 start; 1980257bb82SYan, Zheng u64 end; 1990257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 2000257bb82SYan, Zheng unsigned int nr; 2010257bb82SYan, Zheng }; 2020257bb82SYan, Zheng 2035d4f98a2SYan Zheng struct reloc_control { 2045d4f98a2SYan Zheng /* block group to relocate */ 20532da5386SDavid Sterba struct btrfs_block_group *block_group; 2065d4f98a2SYan Zheng /* extent tree */ 2075d4f98a2SYan Zheng struct btrfs_root *extent_root; 2085d4f98a2SYan Zheng /* inode for moving data */ 2095d4f98a2SYan Zheng struct inode *data_inode; 2103fd0a558SYan, Zheng 2113fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 2123fd0a558SYan, Zheng 2133fd0a558SYan, Zheng struct backref_cache backref_cache; 2143fd0a558SYan, Zheng 2153fd0a558SYan, Zheng struct file_extent_cluster cluster; 2165d4f98a2SYan Zheng /* tree blocks have been processed */ 2175d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 2185d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 2195d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 2205d4f98a2SYan Zheng /* list of reloc trees */ 2215d4f98a2SYan Zheng struct list_head reloc_roots; 222d2311e69SQu Wenruo /* list of subvolume trees that get relocated */ 223d2311e69SQu Wenruo struct list_head dirty_subvol_roots; 2243fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 2253fd0a558SYan, Zheng u64 merging_rsv_size; 2263fd0a558SYan, Zheng /* size of relocated tree nodes */ 2273fd0a558SYan, Zheng u64 nodes_relocated; 2280647bf56SWang Shilong /* reserved size for block group relocation*/ 2290647bf56SWang Shilong u64 reserved_bytes; 2303fd0a558SYan, Zheng 2315d4f98a2SYan Zheng u64 search_start; 2325d4f98a2SYan Zheng u64 extents_found; 2333fd0a558SYan, Zheng 2343fd0a558SYan, Zheng unsigned int stage:8; 2353fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 2363fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 2375d4f98a2SYan Zheng unsigned int found_file_extent:1; 2385d4f98a2SYan Zheng }; 2395d4f98a2SYan Zheng 2405d4f98a2SYan Zheng /* stages of data relocation */ 2415d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 2425d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 2435d4f98a2SYan Zheng 2443fd0a558SYan, Zheng static void remove_backref_node(struct backref_cache *cache, 2453fd0a558SYan, Zheng struct backref_node *node); 2469569cc20SQu Wenruo 2479569cc20SQu Wenruo static void mark_block_processed(struct reloc_control *rc, 2489569cc20SQu Wenruo struct backref_node *node) 2499569cc20SQu Wenruo { 2509569cc20SQu Wenruo u32 blocksize; 2519569cc20SQu Wenruo 2529569cc20SQu Wenruo if (node->level == 0 || 2539569cc20SQu Wenruo in_range(node->bytenr, rc->block_group->start, 2549569cc20SQu Wenruo rc->block_group->length)) { 2559569cc20SQu Wenruo blocksize = rc->extent_root->fs_info->nodesize; 2569569cc20SQu Wenruo set_extent_bits(&rc->processed_blocks, node->bytenr, 2579569cc20SQu Wenruo node->bytenr + blocksize - 1, EXTENT_DIRTY); 2589569cc20SQu Wenruo } 2599569cc20SQu Wenruo node->processed = 1; 2609569cc20SQu Wenruo } 2619569cc20SQu Wenruo 2625d4f98a2SYan Zheng 2635d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 2645d4f98a2SYan Zheng { 2656bef4d31SEric Paris tree->rb_root = RB_ROOT; 2665d4f98a2SYan Zheng spin_lock_init(&tree->lock); 2675d4f98a2SYan Zheng } 2685d4f98a2SYan Zheng 2695d4f98a2SYan Zheng static void backref_cache_init(struct backref_cache *cache) 2705d4f98a2SYan Zheng { 2715d4f98a2SYan Zheng int i; 2726bef4d31SEric Paris cache->rb_root = RB_ROOT; 2735d4f98a2SYan Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2745d4f98a2SYan Zheng INIT_LIST_HEAD(&cache->pending[i]); 2753fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->changed); 2763fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->detached); 2773fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->leaves); 27884780289SQu Wenruo INIT_LIST_HEAD(&cache->pending_edge); 27984780289SQu Wenruo INIT_LIST_HEAD(&cache->useless_node); 2805d4f98a2SYan Zheng } 2815d4f98a2SYan Zheng 2823fd0a558SYan, Zheng static void backref_cache_cleanup(struct backref_cache *cache) 2835d4f98a2SYan Zheng { 2843fd0a558SYan, Zheng struct backref_node *node; 2853fd0a558SYan, Zheng int i; 2863fd0a558SYan, Zheng 2873fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2883fd0a558SYan, Zheng node = list_entry(cache->detached.next, 2893fd0a558SYan, Zheng struct backref_node, list); 2903fd0a558SYan, Zheng remove_backref_node(cache, node); 2913fd0a558SYan, Zheng } 2923fd0a558SYan, Zheng 2933fd0a558SYan, Zheng while (!list_empty(&cache->leaves)) { 2943fd0a558SYan, Zheng node = list_entry(cache->leaves.next, 2953fd0a558SYan, Zheng struct backref_node, lower); 2963fd0a558SYan, Zheng remove_backref_node(cache, node); 2973fd0a558SYan, Zheng } 2983fd0a558SYan, Zheng 2993fd0a558SYan, Zheng cache->last_trans = 0; 3003fd0a558SYan, Zheng 3013fd0a558SYan, Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 302f4907095SLiu Bo ASSERT(list_empty(&cache->pending[i])); 30384780289SQu Wenruo ASSERT(list_empty(&cache->pending_edge)); 30484780289SQu Wenruo ASSERT(list_empty(&cache->useless_node)); 305f4907095SLiu Bo ASSERT(list_empty(&cache->changed)); 306f4907095SLiu Bo ASSERT(list_empty(&cache->detached)); 307f4907095SLiu Bo ASSERT(RB_EMPTY_ROOT(&cache->rb_root)); 308f4907095SLiu Bo ASSERT(!cache->nr_nodes); 309f4907095SLiu Bo ASSERT(!cache->nr_edges); 3103fd0a558SYan, Zheng } 3113fd0a558SYan, Zheng 3123fd0a558SYan, Zheng static struct backref_node *alloc_backref_node(struct backref_cache *cache) 3133fd0a558SYan, Zheng { 3143fd0a558SYan, Zheng struct backref_node *node; 3153fd0a558SYan, Zheng 3163fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 3173fd0a558SYan, Zheng if (node) { 3183fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 3195d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 3205d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 3215d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 3223fd0a558SYan, Zheng cache->nr_nodes++; 3233fd0a558SYan, Zheng } 3243fd0a558SYan, Zheng return node; 3253fd0a558SYan, Zheng } 3263fd0a558SYan, Zheng 3273fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 3283fd0a558SYan, Zheng struct backref_node *node) 3293fd0a558SYan, Zheng { 3303fd0a558SYan, Zheng if (node) { 3313fd0a558SYan, Zheng cache->nr_nodes--; 33200246528SJosef Bacik btrfs_put_root(node->root); 3333fd0a558SYan, Zheng kfree(node); 3343fd0a558SYan, Zheng } 3353fd0a558SYan, Zheng } 3363fd0a558SYan, Zheng 3373fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 3383fd0a558SYan, Zheng { 3393fd0a558SYan, Zheng struct backref_edge *edge; 3403fd0a558SYan, Zheng 3413fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 3423fd0a558SYan, Zheng if (edge) 3433fd0a558SYan, Zheng cache->nr_edges++; 3443fd0a558SYan, Zheng return edge; 3453fd0a558SYan, Zheng } 3463fd0a558SYan, Zheng 3473fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 3483fd0a558SYan, Zheng struct backref_edge *edge) 3493fd0a558SYan, Zheng { 3503fd0a558SYan, Zheng if (edge) { 3513fd0a558SYan, Zheng cache->nr_edges--; 3523fd0a558SYan, Zheng kfree(edge); 3533fd0a558SYan, Zheng } 3545d4f98a2SYan Zheng } 3555d4f98a2SYan Zheng 3565d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 3575d4f98a2SYan Zheng struct rb_node *node) 3585d4f98a2SYan Zheng { 3595d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 3605d4f98a2SYan Zheng struct rb_node *parent = NULL; 3615d4f98a2SYan Zheng struct tree_entry *entry; 3625d4f98a2SYan Zheng 3635d4f98a2SYan Zheng while (*p) { 3645d4f98a2SYan Zheng parent = *p; 3655d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 3665d4f98a2SYan Zheng 3675d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3685d4f98a2SYan Zheng p = &(*p)->rb_left; 3695d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3705d4f98a2SYan Zheng p = &(*p)->rb_right; 3715d4f98a2SYan Zheng else 3725d4f98a2SYan Zheng return parent; 3735d4f98a2SYan Zheng } 3745d4f98a2SYan Zheng 3755d4f98a2SYan Zheng rb_link_node(node, parent, p); 3765d4f98a2SYan Zheng rb_insert_color(node, root); 3775d4f98a2SYan Zheng return NULL; 3785d4f98a2SYan Zheng } 3795d4f98a2SYan Zheng 3805d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 3815d4f98a2SYan Zheng { 3825d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 3835d4f98a2SYan Zheng struct tree_entry *entry; 3845d4f98a2SYan Zheng 3855d4f98a2SYan Zheng while (n) { 3865d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 3875d4f98a2SYan Zheng 3885d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3895d4f98a2SYan Zheng n = n->rb_left; 3905d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3915d4f98a2SYan Zheng n = n->rb_right; 3925d4f98a2SYan Zheng else 3935d4f98a2SYan Zheng return n; 3945d4f98a2SYan Zheng } 3955d4f98a2SYan Zheng return NULL; 3965d4f98a2SYan Zheng } 3975d4f98a2SYan Zheng 39848a3b636SEric Sandeen static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) 39943c04fb1SJeff Mahoney { 40043c04fb1SJeff Mahoney 40143c04fb1SJeff Mahoney struct btrfs_fs_info *fs_info = NULL; 40243c04fb1SJeff Mahoney struct backref_node *bnode = rb_entry(rb_node, struct backref_node, 40343c04fb1SJeff Mahoney rb_node); 40443c04fb1SJeff Mahoney if (bnode->root) 40543c04fb1SJeff Mahoney fs_info = bnode->root->fs_info; 4065d163e0eSJeff Mahoney btrfs_panic(fs_info, errno, 4075d163e0eSJeff Mahoney "Inconsistency in backref cache found at offset %llu", 4085d163e0eSJeff Mahoney bytenr); 40943c04fb1SJeff Mahoney } 41043c04fb1SJeff Mahoney 4115d4f98a2SYan Zheng /* 4125d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 4135d4f98a2SYan Zheng */ 4145d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 4155d4f98a2SYan Zheng struct backref_edge *edges[], 4165d4f98a2SYan Zheng int *index) 4175d4f98a2SYan Zheng { 4185d4f98a2SYan Zheng struct backref_edge *edge; 4195d4f98a2SYan Zheng int idx = *index; 4205d4f98a2SYan Zheng 4215d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4225d4f98a2SYan Zheng edge = list_entry(node->upper.next, 4235d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 4245d4f98a2SYan Zheng edges[idx++] = edge; 4255d4f98a2SYan Zheng node = edge->node[UPPER]; 4265d4f98a2SYan Zheng } 4273fd0a558SYan, Zheng BUG_ON(node->detached); 4285d4f98a2SYan Zheng *index = idx; 4295d4f98a2SYan Zheng return node; 4305d4f98a2SYan Zheng } 4315d4f98a2SYan Zheng 4325d4f98a2SYan Zheng /* 4335d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 4345d4f98a2SYan Zheng */ 4355d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 4365d4f98a2SYan Zheng int *index) 4375d4f98a2SYan Zheng { 4385d4f98a2SYan Zheng struct backref_edge *edge; 4395d4f98a2SYan Zheng struct backref_node *lower; 4405d4f98a2SYan Zheng int idx = *index; 4415d4f98a2SYan Zheng 4425d4f98a2SYan Zheng while (idx > 0) { 4435d4f98a2SYan Zheng edge = edges[idx - 1]; 4445d4f98a2SYan Zheng lower = edge->node[LOWER]; 4455d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 4465d4f98a2SYan Zheng idx--; 4475d4f98a2SYan Zheng continue; 4485d4f98a2SYan Zheng } 4495d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 4505d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 4515d4f98a2SYan Zheng edges[idx - 1] = edge; 4525d4f98a2SYan Zheng *index = idx; 4535d4f98a2SYan Zheng return edge->node[UPPER]; 4545d4f98a2SYan Zheng } 4555d4f98a2SYan Zheng *index = 0; 4565d4f98a2SYan Zheng return NULL; 4575d4f98a2SYan Zheng } 4585d4f98a2SYan Zheng 4593fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 4605d4f98a2SYan Zheng { 4615d4f98a2SYan Zheng if (node->locked) { 4625d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 4635d4f98a2SYan Zheng node->locked = 0; 4645d4f98a2SYan Zheng } 4653fd0a558SYan, Zheng } 4663fd0a558SYan, Zheng 4673fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 4683fd0a558SYan, Zheng { 4693fd0a558SYan, Zheng if (node->eb) { 4703fd0a558SYan, Zheng unlock_node_buffer(node); 4715d4f98a2SYan Zheng free_extent_buffer(node->eb); 4725d4f98a2SYan Zheng node->eb = NULL; 4735d4f98a2SYan Zheng } 4745d4f98a2SYan Zheng } 4755d4f98a2SYan Zheng 4765d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 4775d4f98a2SYan Zheng struct backref_node *node) 4785d4f98a2SYan Zheng { 4795d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 4805d4f98a2SYan Zheng 4815d4f98a2SYan Zheng drop_node_buffer(node); 4823fd0a558SYan, Zheng list_del(&node->list); 4835d4f98a2SYan Zheng list_del(&node->lower); 4843fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 4855d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 4863fd0a558SYan, Zheng free_backref_node(tree, node); 4875d4f98a2SYan Zheng } 4885d4f98a2SYan Zheng 4895d4f98a2SYan Zheng /* 4905d4f98a2SYan Zheng * remove a backref node from the backref cache 4915d4f98a2SYan Zheng */ 4925d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 4935d4f98a2SYan Zheng struct backref_node *node) 4945d4f98a2SYan Zheng { 4955d4f98a2SYan Zheng struct backref_node *upper; 4965d4f98a2SYan Zheng struct backref_edge *edge; 4975d4f98a2SYan Zheng 4985d4f98a2SYan Zheng if (!node) 4995d4f98a2SYan Zheng return; 5005d4f98a2SYan Zheng 5013fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 5025d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 5035d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 5045d4f98a2SYan Zheng list[LOWER]); 5055d4f98a2SYan Zheng upper = edge->node[UPPER]; 5065d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 5075d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 5083fd0a558SYan, Zheng free_backref_edge(cache, edge); 5093fd0a558SYan, Zheng 5103fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 5113fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 5123fd0a558SYan, Zheng drop_backref_node(cache, node); 5133fd0a558SYan, Zheng node = upper; 5143fd0a558SYan, Zheng node->lowest = 1; 5153fd0a558SYan, Zheng continue; 5163fd0a558SYan, Zheng } 5175d4f98a2SYan Zheng /* 5183fd0a558SYan, Zheng * add the node to leaf node list if no other 5195d4f98a2SYan Zheng * child block cached. 5205d4f98a2SYan Zheng */ 5215d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 5223fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 5235d4f98a2SYan Zheng upper->lowest = 1; 5245d4f98a2SYan Zheng } 5255d4f98a2SYan Zheng } 5263fd0a558SYan, Zheng 5275d4f98a2SYan Zheng drop_backref_node(cache, node); 5285d4f98a2SYan Zheng } 5295d4f98a2SYan Zheng 5303fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 5313fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 5323fd0a558SYan, Zheng { 5333fd0a558SYan, Zheng struct rb_node *rb_node; 5343fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 5353fd0a558SYan, Zheng node->bytenr = bytenr; 5363fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 53743c04fb1SJeff Mahoney if (rb_node) 53843c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, bytenr); 5393fd0a558SYan, Zheng } 5403fd0a558SYan, Zheng 5413fd0a558SYan, Zheng /* 5423fd0a558SYan, Zheng * update backref cache after a transaction commit 5433fd0a558SYan, Zheng */ 5443fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 5453fd0a558SYan, Zheng struct backref_cache *cache) 5463fd0a558SYan, Zheng { 5473fd0a558SYan, Zheng struct backref_node *node; 5483fd0a558SYan, Zheng int level = 0; 5493fd0a558SYan, Zheng 5503fd0a558SYan, Zheng if (cache->last_trans == 0) { 5513fd0a558SYan, Zheng cache->last_trans = trans->transid; 5523fd0a558SYan, Zheng return 0; 5533fd0a558SYan, Zheng } 5543fd0a558SYan, Zheng 5553fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 5563fd0a558SYan, Zheng return 0; 5573fd0a558SYan, Zheng 5583fd0a558SYan, Zheng /* 5593fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 5603fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 5613fd0a558SYan, Zheng * so the detached nodes are no longer useful. 5623fd0a558SYan, Zheng */ 5633fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 5643fd0a558SYan, Zheng node = list_entry(cache->detached.next, 5653fd0a558SYan, Zheng struct backref_node, list); 5663fd0a558SYan, Zheng remove_backref_node(cache, node); 5673fd0a558SYan, Zheng } 5683fd0a558SYan, Zheng 5693fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 5703fd0a558SYan, Zheng node = list_entry(cache->changed.next, 5713fd0a558SYan, Zheng struct backref_node, list); 5723fd0a558SYan, Zheng list_del_init(&node->list); 5733fd0a558SYan, Zheng BUG_ON(node->pending); 5743fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5753fd0a558SYan, Zheng } 5763fd0a558SYan, Zheng 5773fd0a558SYan, Zheng /* 5783fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 5793fd0a558SYan, Zheng * errors during processing the pending nodes. 5803fd0a558SYan, Zheng */ 5813fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 5823fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 5833fd0a558SYan, Zheng BUG_ON(!node->pending); 5843fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 5853fd0a558SYan, Zheng continue; 5863fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5873fd0a558SYan, Zheng } 5883fd0a558SYan, Zheng } 5893fd0a558SYan, Zheng 5903fd0a558SYan, Zheng cache->last_trans = 0; 5913fd0a558SYan, Zheng return 1; 5923fd0a558SYan, Zheng } 5933fd0a558SYan, Zheng 5946282675eSQu Wenruo static bool reloc_root_is_dead(struct btrfs_root *root) 5956282675eSQu Wenruo { 5966282675eSQu Wenruo /* 5976282675eSQu Wenruo * Pair with set_bit/clear_bit in clean_dirty_subvols and 5986282675eSQu Wenruo * btrfs_update_reloc_root. We need to see the updated bit before 5996282675eSQu Wenruo * trying to access reloc_root 6006282675eSQu Wenruo */ 6016282675eSQu Wenruo smp_rmb(); 6026282675eSQu Wenruo if (test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state)) 6036282675eSQu Wenruo return true; 6046282675eSQu Wenruo return false; 6056282675eSQu Wenruo } 6066282675eSQu Wenruo 6076282675eSQu Wenruo /* 6086282675eSQu Wenruo * Check if this subvolume tree has valid reloc tree. 6096282675eSQu Wenruo * 6106282675eSQu Wenruo * Reloc tree after swap is considered dead, thus not considered as valid. 6116282675eSQu Wenruo * This is enough for most callers, as they don't distinguish dead reloc root 6126282675eSQu Wenruo * from no reloc root. But should_ignore_root() below is a special case. 6136282675eSQu Wenruo */ 6146282675eSQu Wenruo static bool have_reloc_root(struct btrfs_root *root) 6156282675eSQu Wenruo { 6166282675eSQu Wenruo if (reloc_root_is_dead(root)) 6176282675eSQu Wenruo return false; 6186282675eSQu Wenruo if (!root->reloc_root) 6196282675eSQu Wenruo return false; 6206282675eSQu Wenruo return true; 6216282675eSQu Wenruo } 622f2a97a9dSDavid Sterba 6233fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 6243fd0a558SYan, Zheng { 6253fd0a558SYan, Zheng struct btrfs_root *reloc_root; 6263fd0a558SYan, Zheng 62727cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 6283fd0a558SYan, Zheng return 0; 6293fd0a558SYan, Zheng 6306282675eSQu Wenruo /* This root has been merged with its reloc tree, we can ignore it */ 6316282675eSQu Wenruo if (reloc_root_is_dead(root)) 6326282675eSQu Wenruo return 1; 6336282675eSQu Wenruo 6343fd0a558SYan, Zheng reloc_root = root->reloc_root; 6353fd0a558SYan, Zheng if (!reloc_root) 6363fd0a558SYan, Zheng return 0; 6373fd0a558SYan, Zheng 6384d4225fcSJosef Bacik if (btrfs_header_generation(reloc_root->commit_root) == 6394d4225fcSJosef Bacik root->fs_info->running_transaction->transid) 6403fd0a558SYan, Zheng return 0; 6413fd0a558SYan, Zheng /* 6423fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 6433fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 6443fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 6453fd0a558SYan, Zheng * relocation. 6463fd0a558SYan, Zheng */ 6473fd0a558SYan, Zheng return 1; 6483fd0a558SYan, Zheng } 6495d4f98a2SYan Zheng /* 6505d4f98a2SYan Zheng * find reloc tree by address of tree root 6515d4f98a2SYan Zheng */ 6525d4f98a2SYan Zheng static struct btrfs_root *find_reloc_root(struct reloc_control *rc, 6535d4f98a2SYan Zheng u64 bytenr) 6545d4f98a2SYan Zheng { 6555d4f98a2SYan Zheng struct rb_node *rb_node; 6565d4f98a2SYan Zheng struct mapping_node *node; 6575d4f98a2SYan Zheng struct btrfs_root *root = NULL; 6585d4f98a2SYan Zheng 6595d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 6605d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 6615d4f98a2SYan Zheng if (rb_node) { 6625d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 6635d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 6645d4f98a2SYan Zheng } 6655d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 66600246528SJosef Bacik return btrfs_grab_root(root); 6675d4f98a2SYan Zheng } 6685d4f98a2SYan Zheng 6695d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 6705d4f98a2SYan Zheng u64 root_objectid) 6715d4f98a2SYan Zheng { 6725d4f98a2SYan Zheng struct btrfs_key key; 6735d4f98a2SYan Zheng 6745d4f98a2SYan Zheng key.objectid = root_objectid; 6755d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 6765d4f98a2SYan Zheng key.offset = (u64)-1; 6775d4f98a2SYan Zheng 678bc44d7c4SJosef Bacik return btrfs_get_fs_root(fs_info, &key, false); 6795d4f98a2SYan Zheng } 6805d4f98a2SYan Zheng 6815d4f98a2SYan Zheng /* 6825d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 6835d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 6845d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 6855d4f98a2SYan Zheng * 6865d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 68701327610SNicholas D Steeves * to find upper level blocks that reference the block, and then check 68801327610SNicholas D Steeves * backrefs of these upper level blocks recursively. the recursion stop 6895d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 6905d4f98a2SYan Zheng * 6915d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 6925d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 6935d4f98a2SYan Zheng * block are also cached. 6945d4f98a2SYan Zheng */ 6953fd0a558SYan, Zheng static noinline_for_stack 6963fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 6975d4f98a2SYan Zheng struct btrfs_key *node_key, 6985d4f98a2SYan Zheng int level, u64 bytenr) 6995d4f98a2SYan Zheng { 70071f572a9SQu Wenruo struct btrfs_backref_iter *iter; 7013fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 70271f572a9SQu Wenruo /* For searching parent of TREE_BLOCK_REF */ 70371f572a9SQu Wenruo struct btrfs_path *path; 7045d4f98a2SYan Zheng struct btrfs_root *root; 7055d4f98a2SYan Zheng struct backref_node *cur; 7065d4f98a2SYan Zheng struct backref_node *upper; 7075d4f98a2SYan Zheng struct backref_node *lower; 7085d4f98a2SYan Zheng struct backref_node *node = NULL; 7095d4f98a2SYan Zheng struct backref_node *exist = NULL; 7105d4f98a2SYan Zheng struct backref_edge *edge; 7115d4f98a2SYan Zheng struct rb_node *rb_node; 7123fd0a558SYan, Zheng int cowonly; 7135d4f98a2SYan Zheng int ret; 7145d4f98a2SYan Zheng int err = 0; 715b6c60c80SJosef Bacik bool need_check = true; 7165d4f98a2SYan Zheng 71771f572a9SQu Wenruo iter = btrfs_backref_iter_alloc(rc->extent_root->fs_info, GFP_NOFS); 71871f572a9SQu Wenruo if (!iter) 71971f572a9SQu Wenruo return ERR_PTR(-ENOMEM); 72071f572a9SQu Wenruo path = btrfs_alloc_path(); 72171f572a9SQu Wenruo if (!path) { 7225d4f98a2SYan Zheng err = -ENOMEM; 7235d4f98a2SYan Zheng goto out; 7245d4f98a2SYan Zheng } 7255d4f98a2SYan Zheng 7263fd0a558SYan, Zheng node = alloc_backref_node(cache); 7275d4f98a2SYan Zheng if (!node) { 7285d4f98a2SYan Zheng err = -ENOMEM; 7295d4f98a2SYan Zheng goto out; 7305d4f98a2SYan Zheng } 7315d4f98a2SYan Zheng 7325d4f98a2SYan Zheng node->bytenr = bytenr; 7335d4f98a2SYan Zheng node->level = level; 7345d4f98a2SYan Zheng node->lowest = 1; 7355d4f98a2SYan Zheng cur = node; 7365d4f98a2SYan Zheng again: 73771f572a9SQu Wenruo ret = btrfs_backref_iter_start(iter, cur->bytenr); 7385d4f98a2SYan Zheng if (ret < 0) { 7395d4f98a2SYan Zheng err = ret; 7405d4f98a2SYan Zheng goto out; 7415d4f98a2SYan Zheng } 7425d4f98a2SYan Zheng 74371f572a9SQu Wenruo /* 74471f572a9SQu Wenruo * We skip the first btrfs_tree_block_info, as we don't use the key 74571f572a9SQu Wenruo * stored in it, but fetch it from the tree block 74671f572a9SQu Wenruo */ 74771f572a9SQu Wenruo if (btrfs_backref_has_tree_block_info(iter)) { 74871f572a9SQu Wenruo ret = btrfs_backref_iter_next(iter); 74971f572a9SQu Wenruo if (ret < 0) { 75071f572a9SQu Wenruo err = ret; 75171f572a9SQu Wenruo goto out; 75271f572a9SQu Wenruo } 75371f572a9SQu Wenruo /* No extra backref? This means the tree block is corrupted */ 75471f572a9SQu Wenruo if (ret > 0) { 75571f572a9SQu Wenruo err = -EUCLEAN; 75671f572a9SQu Wenruo goto out; 75771f572a9SQu Wenruo } 75871f572a9SQu Wenruo } 7595d4f98a2SYan Zheng WARN_ON(cur->checked); 7605d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 7615d4f98a2SYan Zheng /* 76270f23fd6SJustin P. Mattock * the backref was added previously when processing 7635d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 7645d4f98a2SYan Zheng */ 76575bfb9afSJosef Bacik ASSERT(list_is_singular(&cur->upper)); 7665d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 7675d4f98a2SYan Zheng list[LOWER]); 76875bfb9afSJosef Bacik ASSERT(list_empty(&edge->list[UPPER])); 7695d4f98a2SYan Zheng exist = edge->node[UPPER]; 7705d4f98a2SYan Zheng /* 7715d4f98a2SYan Zheng * add the upper level block to pending list if we need 7725d4f98a2SYan Zheng * check its backrefs 7735d4f98a2SYan Zheng */ 7745d4f98a2SYan Zheng if (!exist->checked) 77584780289SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 7765d4f98a2SYan Zheng } else { 7775d4f98a2SYan Zheng exist = NULL; 7785d4f98a2SYan Zheng } 7795d4f98a2SYan Zheng 78071f572a9SQu Wenruo for (; ret == 0; ret = btrfs_backref_iter_next(iter)) { 78171f572a9SQu Wenruo struct extent_buffer *eb; 78271f572a9SQu Wenruo struct btrfs_key key; 7833de28d57SLiu Bo int type; 78471f572a9SQu Wenruo 78571f572a9SQu Wenruo cond_resched(); 78671f572a9SQu Wenruo eb = btrfs_backref_get_eb(iter); 78771f572a9SQu Wenruo 78871f572a9SQu Wenruo key.objectid = iter->bytenr; 78971f572a9SQu Wenruo if (btrfs_backref_iter_is_inline_ref(iter)) { 79071f572a9SQu Wenruo struct btrfs_extent_inline_ref *iref; 79171f572a9SQu Wenruo 79271f572a9SQu Wenruo /* update key for inline back ref */ 79371f572a9SQu Wenruo iref = (struct btrfs_extent_inline_ref *) 79471f572a9SQu Wenruo ((unsigned long)iter->cur_ptr); 7953de28d57SLiu Bo type = btrfs_get_extent_inline_ref_type(eb, iref, 7963de28d57SLiu Bo BTRFS_REF_TYPE_BLOCK); 7973de28d57SLiu Bo if (type == BTRFS_REF_TYPE_INVALID) { 798af431dcbSSu Yue err = -EUCLEAN; 7993de28d57SLiu Bo goto out; 8003de28d57SLiu Bo } 8013de28d57SLiu Bo key.type = type; 8025d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 80371f572a9SQu Wenruo } else { 80471f572a9SQu Wenruo key.type = iter->cur_key.type; 80571f572a9SQu Wenruo key.offset = iter->cur_key.offset; 8065d4f98a2SYan Zheng } 8075d4f98a2SYan Zheng 808fa6ac715SQu Wenruo /* 809fa6ac715SQu Wenruo * Parent node found and matches current inline ref, no need to 810fa6ac715SQu Wenruo * rebuild this node for this inline ref. 811fa6ac715SQu Wenruo */ 8125d4f98a2SYan Zheng if (exist && 8135d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 8145d4f98a2SYan Zheng exist->owner == key.offset) || 8155d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 8165d4f98a2SYan Zheng exist->bytenr == key.offset))) { 8175d4f98a2SYan Zheng exist = NULL; 81871f572a9SQu Wenruo continue; 8195d4f98a2SYan Zheng } 8205d4f98a2SYan Zheng 821fa6ac715SQu Wenruo /* SHARED_BLOCK_REF means key.offset is the parent bytenr */ 8225d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 8235d4f98a2SYan Zheng if (key.objectid == key.offset) { 8245d4f98a2SYan Zheng /* 825fa6ac715SQu Wenruo * Only root blocks of reloc trees use backref 826fa6ac715SQu Wenruo * pointing to itself. 8275d4f98a2SYan Zheng */ 8285d4f98a2SYan Zheng root = find_reloc_root(rc, cur->bytenr); 82975bfb9afSJosef Bacik ASSERT(root); 8305d4f98a2SYan Zheng cur->root = root; 8315d4f98a2SYan Zheng break; 8325d4f98a2SYan Zheng } 8335d4f98a2SYan Zheng 8343fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 8355d4f98a2SYan Zheng if (!edge) { 8365d4f98a2SYan Zheng err = -ENOMEM; 8375d4f98a2SYan Zheng goto out; 8385d4f98a2SYan Zheng } 8395d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, key.offset); 8405d4f98a2SYan Zheng if (!rb_node) { 8413fd0a558SYan, Zheng upper = alloc_backref_node(cache); 8425d4f98a2SYan Zheng if (!upper) { 8433fd0a558SYan, Zheng free_backref_edge(cache, edge); 8445d4f98a2SYan Zheng err = -ENOMEM; 8455d4f98a2SYan Zheng goto out; 8465d4f98a2SYan Zheng } 8475d4f98a2SYan Zheng upper->bytenr = key.offset; 8485d4f98a2SYan Zheng upper->level = cur->level + 1; 8495d4f98a2SYan Zheng /* 8505d4f98a2SYan Zheng * backrefs for the upper level block isn't 8515d4f98a2SYan Zheng * cached, add the block to pending list 8525d4f98a2SYan Zheng */ 85384780289SQu Wenruo list_add_tail(&edge->list[UPPER], 85484780289SQu Wenruo &cache->pending_edge); 8555d4f98a2SYan Zheng } else { 8565d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 8575d4f98a2SYan Zheng rb_node); 85875bfb9afSJosef Bacik ASSERT(upper->checked); 8595d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 8605d4f98a2SYan Zheng } 8613fd0a558SYan, Zheng list_add_tail(&edge->list[LOWER], &cur->upper); 8625d4f98a2SYan Zheng edge->node[LOWER] = cur; 8633fd0a558SYan, Zheng edge->node[UPPER] = upper; 8645d4f98a2SYan Zheng 86571f572a9SQu Wenruo continue; 8666d8ff4e4SDavid Sterba } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) { 867ba3c2b19SNikolay Borisov err = -EINVAL; 868ba3c2b19SNikolay Borisov btrfs_print_v0_err(rc->extent_root->fs_info); 869ba3c2b19SNikolay Borisov btrfs_handle_fs_error(rc->extent_root->fs_info, err, 870ba3c2b19SNikolay Borisov NULL); 871ba3c2b19SNikolay Borisov goto out; 8725d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 87371f572a9SQu Wenruo continue; 8745d4f98a2SYan Zheng } 8755d4f98a2SYan Zheng 876fa6ac715SQu Wenruo /* 877fa6ac715SQu Wenruo * key.type == BTRFS_TREE_BLOCK_REF_KEY, inline ref offset 878fa6ac715SQu Wenruo * means the root objectid. We need to search the tree to get 879fa6ac715SQu Wenruo * its parent bytenr. 880fa6ac715SQu Wenruo */ 8815d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, key.offset); 8825d4f98a2SYan Zheng if (IS_ERR(root)) { 8835d4f98a2SYan Zheng err = PTR_ERR(root); 8845d4f98a2SYan Zheng goto out; 8855d4f98a2SYan Zheng } 8865d4f98a2SYan Zheng 88727cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 8883fd0a558SYan, Zheng cur->cowonly = 1; 8893fd0a558SYan, Zheng 8905d4f98a2SYan Zheng if (btrfs_root_level(&root->root_item) == cur->level) { 8915d4f98a2SYan Zheng /* tree root */ 89275bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 8935d4f98a2SYan Zheng cur->bytenr); 8940b530bc5SJosef Bacik if (should_ignore_root(root)) { 89500246528SJosef Bacik btrfs_put_root(root); 89684780289SQu Wenruo list_add(&cur->list, &cache->useless_node); 8970b530bc5SJosef Bacik } else { 8985d4f98a2SYan Zheng cur->root = root; 8990b530bc5SJosef Bacik } 9005d4f98a2SYan Zheng break; 9015d4f98a2SYan Zheng } 9025d4f98a2SYan Zheng 9035d4f98a2SYan Zheng level = cur->level + 1; 9045d4f98a2SYan Zheng 905fa6ac715SQu Wenruo /* Search the tree to find parent blocks referring the block. */ 90671f572a9SQu Wenruo path->search_commit_root = 1; 90771f572a9SQu Wenruo path->skip_locking = 1; 90871f572a9SQu Wenruo path->lowest_level = level; 90971f572a9SQu Wenruo ret = btrfs_search_slot(NULL, root, node_key, path, 0, 0); 91071f572a9SQu Wenruo path->lowest_level = 0; 9115d4f98a2SYan Zheng if (ret < 0) { 91200246528SJosef Bacik btrfs_put_root(root); 9135d4f98a2SYan Zheng err = ret; 9145d4f98a2SYan Zheng goto out; 9155d4f98a2SYan Zheng } 91671f572a9SQu Wenruo if (ret > 0 && path->slots[level] > 0) 91771f572a9SQu Wenruo path->slots[level]--; 9185d4f98a2SYan Zheng 91971f572a9SQu Wenruo eb = path->nodes[level]; 92071f572a9SQu Wenruo if (btrfs_node_blockptr(eb, path->slots[level]) != 9213561b9dbSLiu Bo cur->bytenr) { 9223561b9dbSLiu Bo btrfs_err(root->fs_info, 9233561b9dbSLiu Bo "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)", 9244fd786e6SMisono Tomohiro cur->bytenr, level - 1, 9254fd786e6SMisono Tomohiro root->root_key.objectid, 9263561b9dbSLiu Bo node_key->objectid, node_key->type, 9273561b9dbSLiu Bo node_key->offset); 92800246528SJosef Bacik btrfs_put_root(root); 9293561b9dbSLiu Bo err = -ENOENT; 9303561b9dbSLiu Bo goto out; 9313561b9dbSLiu Bo } 9325d4f98a2SYan Zheng lower = cur; 933b6c60c80SJosef Bacik need_check = true; 934fa6ac715SQu Wenruo 935fa6ac715SQu Wenruo /* Add all nodes and edges in the path */ 9365d4f98a2SYan Zheng for (; level < BTRFS_MAX_LEVEL; level++) { 93771f572a9SQu Wenruo if (!path->nodes[level]) { 93875bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 9395d4f98a2SYan Zheng lower->bytenr); 9400b530bc5SJosef Bacik if (should_ignore_root(root)) { 94100246528SJosef Bacik btrfs_put_root(root); 94284780289SQu Wenruo list_add(&lower->list, 94384780289SQu Wenruo &cache->useless_node); 9440b530bc5SJosef Bacik } else { 9455d4f98a2SYan Zheng lower->root = root; 9460b530bc5SJosef Bacik } 9475d4f98a2SYan Zheng break; 9485d4f98a2SYan Zheng } 9495d4f98a2SYan Zheng 9503fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 9515d4f98a2SYan Zheng if (!edge) { 95200246528SJosef Bacik btrfs_put_root(root); 9535d4f98a2SYan Zheng err = -ENOMEM; 9545d4f98a2SYan Zheng goto out; 9555d4f98a2SYan Zheng } 9565d4f98a2SYan Zheng 95771f572a9SQu Wenruo eb = path->nodes[level]; 9585d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, eb->start); 9595d4f98a2SYan Zheng if (!rb_node) { 9603fd0a558SYan, Zheng upper = alloc_backref_node(cache); 9615d4f98a2SYan Zheng if (!upper) { 96200246528SJosef Bacik btrfs_put_root(root); 9633fd0a558SYan, Zheng free_backref_edge(cache, edge); 9645d4f98a2SYan Zheng err = -ENOMEM; 9655d4f98a2SYan Zheng goto out; 9665d4f98a2SYan Zheng } 9675d4f98a2SYan Zheng upper->bytenr = eb->start; 9685d4f98a2SYan Zheng upper->owner = btrfs_header_owner(eb); 9695d4f98a2SYan Zheng upper->level = lower->level + 1; 97027cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, 97127cdeb70SMiao Xie &root->state)) 9723fd0a558SYan, Zheng upper->cowonly = 1; 9735d4f98a2SYan Zheng 9745d4f98a2SYan Zheng /* 9755d4f98a2SYan Zheng * if we know the block isn't shared 9765d4f98a2SYan Zheng * we can void checking its backrefs. 9775d4f98a2SYan Zheng */ 9785d4f98a2SYan Zheng if (btrfs_block_can_be_shared(root, eb)) 9795d4f98a2SYan Zheng upper->checked = 0; 9805d4f98a2SYan Zheng else 9815d4f98a2SYan Zheng upper->checked = 1; 9825d4f98a2SYan Zheng 9835d4f98a2SYan Zheng /* 9845d4f98a2SYan Zheng * add the block to pending list if we 985b6c60c80SJosef Bacik * need check its backrefs, we only do this once 986b6c60c80SJosef Bacik * while walking up a tree as we will catch 987b6c60c80SJosef Bacik * anything else later on. 9885d4f98a2SYan Zheng */ 989b6c60c80SJosef Bacik if (!upper->checked && need_check) { 990b6c60c80SJosef Bacik need_check = false; 9915d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], 99284780289SQu Wenruo &cache->pending_edge); 993bbe90514SJosef Bacik } else { 994bbe90514SJosef Bacik if (upper->checked) 995bbe90514SJosef Bacik need_check = true; 9965d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 997bbe90514SJosef Bacik } 9985d4f98a2SYan Zheng } else { 9995d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 10005d4f98a2SYan Zheng rb_node); 100175bfb9afSJosef Bacik ASSERT(upper->checked); 10025d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 10033fd0a558SYan, Zheng if (!upper->owner) 10043fd0a558SYan, Zheng upper->owner = btrfs_header_owner(eb); 10055d4f98a2SYan Zheng } 10065d4f98a2SYan Zheng list_add_tail(&edge->list[LOWER], &lower->upper); 10075d4f98a2SYan Zheng edge->node[LOWER] = lower; 10083fd0a558SYan, Zheng edge->node[UPPER] = upper; 10095d4f98a2SYan Zheng 10100b530bc5SJosef Bacik if (rb_node) { 101100246528SJosef Bacik btrfs_put_root(root); 10125d4f98a2SYan Zheng break; 10130b530bc5SJosef Bacik } 10145d4f98a2SYan Zheng lower = upper; 10155d4f98a2SYan Zheng upper = NULL; 10165d4f98a2SYan Zheng } 101771f572a9SQu Wenruo btrfs_release_path(path); 10185d4f98a2SYan Zheng } 101971f572a9SQu Wenruo if (ret < 0) { 102071f572a9SQu Wenruo err = ret; 102171f572a9SQu Wenruo goto out; 10225d4f98a2SYan Zheng } 102371f572a9SQu Wenruo ret = 0; 102471f572a9SQu Wenruo btrfs_backref_iter_release(iter); 10255d4f98a2SYan Zheng 10265d4f98a2SYan Zheng cur->checked = 1; 10275d4f98a2SYan Zheng WARN_ON(exist); 10285d4f98a2SYan Zheng 10295d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 103084780289SQu Wenruo if (!list_empty(&cache->pending_edge)) { 103184780289SQu Wenruo edge = list_first_entry(&cache->pending_edge, 103284780289SQu Wenruo struct backref_edge, list[UPPER]); 10335d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10345d4f98a2SYan Zheng cur = edge->node[UPPER]; 10355d4f98a2SYan Zheng goto again; 10365d4f98a2SYan Zheng } 10375d4f98a2SYan Zheng 10385d4f98a2SYan Zheng /* 10395d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 10405d4f98a2SYan Zheng * into the cache. 10415d4f98a2SYan Zheng */ 104275bfb9afSJosef Bacik ASSERT(node->checked); 10433fd0a558SYan, Zheng cowonly = node->cowonly; 10443fd0a558SYan, Zheng if (!cowonly) { 10453fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 10463fd0a558SYan, Zheng &node->rb_node); 104743c04fb1SJeff Mahoney if (rb_node) 104843c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 10493fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 10503fd0a558SYan, Zheng } 10515d4f98a2SYan Zheng 10525d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 105384780289SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 10545d4f98a2SYan Zheng 105584780289SQu Wenruo while (!list_empty(&cache->pending_edge)) { 105684780289SQu Wenruo edge = list_first_entry(&cache->pending_edge, 105784780289SQu Wenruo struct backref_edge, list[UPPER]); 10585d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10595d4f98a2SYan Zheng upper = edge->node[UPPER]; 10603fd0a558SYan, Zheng if (upper->detached) { 10613fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10623fd0a558SYan, Zheng lower = edge->node[LOWER]; 10633fd0a558SYan, Zheng free_backref_edge(cache, edge); 10643fd0a558SYan, Zheng if (list_empty(&lower->upper)) 106584780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 10663fd0a558SYan, Zheng continue; 10673fd0a558SYan, Zheng } 10685d4f98a2SYan Zheng 10695d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 10705d4f98a2SYan Zheng if (upper->lowest) { 10715d4f98a2SYan Zheng list_del_init(&upper->lower); 10725d4f98a2SYan Zheng upper->lowest = 0; 10735d4f98a2SYan Zheng } 10745d4f98a2SYan Zheng 10755d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10765d4f98a2SYan Zheng continue; 10775d4f98a2SYan Zheng } 10785d4f98a2SYan Zheng 107975bfb9afSJosef Bacik if (!upper->checked) { 108075bfb9afSJosef Bacik /* 108175bfb9afSJosef Bacik * Still want to blow up for developers since this is a 108275bfb9afSJosef Bacik * logic bug. 108375bfb9afSJosef Bacik */ 108475bfb9afSJosef Bacik ASSERT(0); 108575bfb9afSJosef Bacik err = -EINVAL; 108675bfb9afSJosef Bacik goto out; 108775bfb9afSJosef Bacik } 108875bfb9afSJosef Bacik if (cowonly != upper->cowonly) { 108975bfb9afSJosef Bacik ASSERT(0); 109075bfb9afSJosef Bacik err = -EINVAL; 109175bfb9afSJosef Bacik goto out; 109275bfb9afSJosef Bacik } 109375bfb9afSJosef Bacik 10943fd0a558SYan, Zheng if (!cowonly) { 10955d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 10965d4f98a2SYan Zheng &upper->rb_node); 109743c04fb1SJeff Mahoney if (rb_node) 109843c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 109943c04fb1SJeff Mahoney upper->bytenr); 11003fd0a558SYan, Zheng } 11015d4f98a2SYan Zheng 11025d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 11035d4f98a2SYan Zheng 11045d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 110584780289SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 11065d4f98a2SYan Zheng } 11073fd0a558SYan, Zheng /* 11083fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 11093fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 11103fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 11113fd0a558SYan, Zheng * lookup. 11123fd0a558SYan, Zheng */ 111384780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 111484780289SQu Wenruo upper = list_first_entry(&cache->useless_node, 111584780289SQu Wenruo struct backref_node, list); 11163fd0a558SYan, Zheng list_del_init(&upper->list); 111775bfb9afSJosef Bacik ASSERT(list_empty(&upper->upper)); 11183fd0a558SYan, Zheng if (upper == node) 11193fd0a558SYan, Zheng node = NULL; 11203fd0a558SYan, Zheng if (upper->lowest) { 11213fd0a558SYan, Zheng list_del_init(&upper->lower); 11223fd0a558SYan, Zheng upper->lowest = 0; 11233fd0a558SYan, Zheng } 11243fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 112584780289SQu Wenruo edge = list_first_entry(&upper->lower, 11263fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 11273fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 11283fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11293fd0a558SYan, Zheng lower = edge->node[LOWER]; 11303fd0a558SYan, Zheng free_backref_edge(cache, edge); 11313fd0a558SYan, Zheng 11323fd0a558SYan, Zheng if (list_empty(&lower->upper)) 113384780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 11343fd0a558SYan, Zheng } 11359569cc20SQu Wenruo mark_block_processed(rc, upper); 11363fd0a558SYan, Zheng if (upper->level > 0) { 11373fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 11383fd0a558SYan, Zheng upper->detached = 1; 11393fd0a558SYan, Zheng } else { 11403fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 11413fd0a558SYan, Zheng free_backref_node(cache, upper); 11423fd0a558SYan, Zheng } 11433fd0a558SYan, Zheng } 11445d4f98a2SYan Zheng out: 114571f572a9SQu Wenruo btrfs_backref_iter_free(iter); 114671f572a9SQu Wenruo btrfs_free_path(path); 11475d4f98a2SYan Zheng if (err) { 114884780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 114984780289SQu Wenruo lower = list_first_entry(&cache->useless_node, 115075bfb9afSJosef Bacik struct backref_node, list); 115175bfb9afSJosef Bacik list_del_init(&lower->list); 11523fd0a558SYan, Zheng } 115384780289SQu Wenruo while (!list_empty(&cache->pending_edge)) { 115484780289SQu Wenruo edge = list_first_entry(&cache->pending_edge, 115584780289SQu Wenruo struct backref_edge, list[UPPER]); 115675bfb9afSJosef Bacik list_del(&edge->list[UPPER]); 11573fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 115875bfb9afSJosef Bacik lower = edge->node[LOWER]; 11595d4f98a2SYan Zheng upper = edge->node[UPPER]; 11603fd0a558SYan, Zheng free_backref_edge(cache, edge); 116175bfb9afSJosef Bacik 116275bfb9afSJosef Bacik /* 116375bfb9afSJosef Bacik * Lower is no longer linked to any upper backref nodes 116475bfb9afSJosef Bacik * and isn't in the cache, we can free it ourselves. 116575bfb9afSJosef Bacik */ 116675bfb9afSJosef Bacik if (list_empty(&lower->upper) && 116775bfb9afSJosef Bacik RB_EMPTY_NODE(&lower->rb_node)) 116884780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 116975bfb9afSJosef Bacik 117075bfb9afSJosef Bacik if (!RB_EMPTY_NODE(&upper->rb_node)) 117175bfb9afSJosef Bacik continue; 117275bfb9afSJosef Bacik 117301327610SNicholas D Steeves /* Add this guy's upper edges to the list to process */ 117475bfb9afSJosef Bacik list_for_each_entry(edge, &upper->upper, list[LOWER]) 117584780289SQu Wenruo list_add_tail(&edge->list[UPPER], 117684780289SQu Wenruo &cache->pending_edge); 117775bfb9afSJosef Bacik if (list_empty(&upper->upper)) 117884780289SQu Wenruo list_add(&upper->list, &cache->useless_node); 117975bfb9afSJosef Bacik } 118075bfb9afSJosef Bacik 118184780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 118284780289SQu Wenruo lower = list_first_entry(&cache->useless_node, 118375bfb9afSJosef Bacik struct backref_node, list); 118475bfb9afSJosef Bacik list_del_init(&lower->list); 11850fd8c3daSLiu Bo if (lower == node) 11860fd8c3daSLiu Bo node = NULL; 118775bfb9afSJosef Bacik free_backref_node(cache, lower); 11885d4f98a2SYan Zheng } 11890fd8c3daSLiu Bo 11908e19c973SJosef Bacik remove_backref_node(cache, node); 119184780289SQu Wenruo ASSERT(list_empty(&cache->useless_node) && 119284780289SQu Wenruo list_empty(&cache->pending_edge)); 11935d4f98a2SYan Zheng return ERR_PTR(err); 11945d4f98a2SYan Zheng } 119575bfb9afSJosef Bacik ASSERT(!node || !node->detached); 119684780289SQu Wenruo ASSERT(list_empty(&cache->useless_node) && 119784780289SQu Wenruo list_empty(&cache->pending_edge)); 11985d4f98a2SYan Zheng return node; 11995d4f98a2SYan Zheng } 12005d4f98a2SYan Zheng 12015d4f98a2SYan Zheng /* 12023fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 12033fd0a558SYan, Zheng * the backref node is created by cloning backref node that 12043fd0a558SYan, Zheng * corresponds to root of source tree 12053fd0a558SYan, Zheng */ 12063fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 12073fd0a558SYan, Zheng struct reloc_control *rc, 12083fd0a558SYan, Zheng struct btrfs_root *src, 12093fd0a558SYan, Zheng struct btrfs_root *dest) 12103fd0a558SYan, Zheng { 12113fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 12123fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 12133fd0a558SYan, Zheng struct backref_node *node = NULL; 12143fd0a558SYan, Zheng struct backref_node *new_node; 12153fd0a558SYan, Zheng struct backref_edge *edge; 12163fd0a558SYan, Zheng struct backref_edge *new_edge; 12173fd0a558SYan, Zheng struct rb_node *rb_node; 12183fd0a558SYan, Zheng 12193fd0a558SYan, Zheng if (cache->last_trans > 0) 12203fd0a558SYan, Zheng update_backref_cache(trans, cache); 12213fd0a558SYan, Zheng 12223fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 12233fd0a558SYan, Zheng if (rb_node) { 12243fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 12253fd0a558SYan, Zheng if (node->detached) 12263fd0a558SYan, Zheng node = NULL; 12273fd0a558SYan, Zheng else 12283fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 12293fd0a558SYan, Zheng } 12303fd0a558SYan, Zheng 12313fd0a558SYan, Zheng if (!node) { 12323fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 12333fd0a558SYan, Zheng reloc_root->commit_root->start); 12343fd0a558SYan, Zheng if (rb_node) { 12353fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 12363fd0a558SYan, Zheng rb_node); 12373fd0a558SYan, Zheng BUG_ON(node->detached); 12383fd0a558SYan, Zheng } 12393fd0a558SYan, Zheng } 12403fd0a558SYan, Zheng 12413fd0a558SYan, Zheng if (!node) 12423fd0a558SYan, Zheng return 0; 12433fd0a558SYan, Zheng 12443fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 12453fd0a558SYan, Zheng if (!new_node) 12463fd0a558SYan, Zheng return -ENOMEM; 12473fd0a558SYan, Zheng 12483fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 12493fd0a558SYan, Zheng new_node->level = node->level; 12503fd0a558SYan, Zheng new_node->lowest = node->lowest; 12516848ad64SYan, Zheng new_node->checked = 1; 125200246528SJosef Bacik new_node->root = btrfs_grab_root(dest); 12530b530bc5SJosef Bacik ASSERT(new_node->root); 12543fd0a558SYan, Zheng 12553fd0a558SYan, Zheng if (!node->lowest) { 12563fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 12573fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 12583fd0a558SYan, Zheng if (!new_edge) 12593fd0a558SYan, Zheng goto fail; 12603fd0a558SYan, Zheng 12613fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 12623fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 12633fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 12643fd0a558SYan, Zheng &new_node->lower); 12653fd0a558SYan, Zheng } 126676b9e23dSMiao Xie } else { 126776b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 12683fd0a558SYan, Zheng } 12693fd0a558SYan, Zheng 12703fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 12713fd0a558SYan, Zheng &new_node->rb_node); 127243c04fb1SJeff Mahoney if (rb_node) 127343c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 12743fd0a558SYan, Zheng 12753fd0a558SYan, Zheng if (!new_node->lowest) { 12763fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 12773fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 12783fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 12793fd0a558SYan, Zheng } 12803fd0a558SYan, Zheng } 12813fd0a558SYan, Zheng return 0; 12823fd0a558SYan, Zheng fail: 12833fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 12843fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 12853fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 12863fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 12873fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 12883fd0a558SYan, Zheng } 12893fd0a558SYan, Zheng free_backref_node(cache, new_node); 12903fd0a558SYan, Zheng return -ENOMEM; 12913fd0a558SYan, Zheng } 12923fd0a558SYan, Zheng 12933fd0a558SYan, Zheng /* 12945d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 12955d4f98a2SYan Zheng */ 1296ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 12975d4f98a2SYan Zheng { 12980b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 12995d4f98a2SYan Zheng struct rb_node *rb_node; 13005d4f98a2SYan Zheng struct mapping_node *node; 13010b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 13025d4f98a2SYan Zheng 13035d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1304ffd7b339SJeff Mahoney if (!node) 1305ffd7b339SJeff Mahoney return -ENOMEM; 13065d4f98a2SYan Zheng 1307ea287ab1SJosef Bacik node->bytenr = root->commit_root->start; 13085d4f98a2SYan Zheng node->data = root; 13095d4f98a2SYan Zheng 13105d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13115d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13125d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13135d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1314ffd7b339SJeff Mahoney if (rb_node) { 13150b246afaSJeff Mahoney btrfs_panic(fs_info, -EEXIST, 13165d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 13175d163e0eSJeff Mahoney node->bytenr); 1318ffd7b339SJeff Mahoney } 13195d4f98a2SYan Zheng 13205d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 13215d4f98a2SYan Zheng return 0; 13225d4f98a2SYan Zheng } 13235d4f98a2SYan Zheng 13245d4f98a2SYan Zheng /* 1325c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 13265d4f98a2SYan Zheng * mapping 13275d4f98a2SYan Zheng */ 1328c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 13295d4f98a2SYan Zheng { 13300b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 13315d4f98a2SYan Zheng struct rb_node *rb_node; 13325d4f98a2SYan Zheng struct mapping_node *node = NULL; 13330b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1334f44deb74SJosef Bacik bool put_ref = false; 13355d4f98a2SYan Zheng 133665c6e82bSQu Wenruo if (rc && root->node) { 13375d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13385d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1339ea287ab1SJosef Bacik root->commit_root->start); 1340c974c464SWang Shilong if (rb_node) { 1341c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1342c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1343ea287ab1SJosef Bacik RB_CLEAR_NODE(&node->rb_node); 1344c974c464SWang Shilong } 1345c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1346c974c464SWang Shilong if (!node) 1347c974c464SWang Shilong return; 1348c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1349389305b2SQu Wenruo } 1350c974c464SWang Shilong 1351f44deb74SJosef Bacik /* 1352f44deb74SJosef Bacik * We only put the reloc root here if it's on the list. There's a lot 1353f44deb74SJosef Bacik * of places where the pattern is to splice the rc->reloc_roots, process 1354f44deb74SJosef Bacik * the reloc roots, and then add the reloc root back onto 1355f44deb74SJosef Bacik * rc->reloc_roots. If we call __del_reloc_root while it's off of the 1356f44deb74SJosef Bacik * list we don't want the reference being dropped, because the guy 1357f44deb74SJosef Bacik * messing with the list is in charge of the reference. 1358f44deb74SJosef Bacik */ 13590b246afaSJeff Mahoney spin_lock(&fs_info->trans_lock); 1360f44deb74SJosef Bacik if (!list_empty(&root->root_list)) { 1361f44deb74SJosef Bacik put_ref = true; 1362c974c464SWang Shilong list_del_init(&root->root_list); 1363f44deb74SJosef Bacik } 13640b246afaSJeff Mahoney spin_unlock(&fs_info->trans_lock); 1365f44deb74SJosef Bacik if (put_ref) 1366f44deb74SJosef Bacik btrfs_put_root(root); 1367c974c464SWang Shilong kfree(node); 1368c974c464SWang Shilong } 1369c974c464SWang Shilong 1370c974c464SWang Shilong /* 1371c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1372c974c464SWang Shilong * mapping 1373c974c464SWang Shilong */ 1374ea287ab1SJosef Bacik static int __update_reloc_root(struct btrfs_root *root) 1375c974c464SWang Shilong { 13760b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 1377c974c464SWang Shilong struct rb_node *rb_node; 1378c974c464SWang Shilong struct mapping_node *node = NULL; 13790b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1380c974c464SWang Shilong 1381c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1382c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1383ea287ab1SJosef Bacik root->commit_root->start); 13845d4f98a2SYan Zheng if (rb_node) { 13855d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 13865d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 13875d4f98a2SYan Zheng } 13885d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 13895d4f98a2SYan Zheng 13908f71f3e0SLiu Bo if (!node) 13918f71f3e0SLiu Bo return 0; 13925d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 13935d4f98a2SYan Zheng 13945d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1395ea287ab1SJosef Bacik node->bytenr = root->node->start; 13965d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13975d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13985d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 139943c04fb1SJeff Mahoney if (rb_node) 140043c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 14015d4f98a2SYan Zheng return 0; 14025d4f98a2SYan Zheng } 14035d4f98a2SYan Zheng 14043fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 14053fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 14065d4f98a2SYan Zheng { 14070b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14085d4f98a2SYan Zheng struct btrfs_root *reloc_root; 14095d4f98a2SYan Zheng struct extent_buffer *eb; 14105d4f98a2SYan Zheng struct btrfs_root_item *root_item; 14115d4f98a2SYan Zheng struct btrfs_key root_key; 14125d4f98a2SYan Zheng int ret; 14135d4f98a2SYan Zheng 14145d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 14155d4f98a2SYan Zheng BUG_ON(!root_item); 14165d4f98a2SYan Zheng 14175d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 14185d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 14193fd0a558SYan, Zheng root_key.offset = objectid; 14205d4f98a2SYan Zheng 14213fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 1422054570a1SFilipe Manana u64 commit_root_gen; 1423054570a1SFilipe Manana 14243fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 14255d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 14265d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 14275d4f98a2SYan Zheng BUG_ON(ret); 1428054570a1SFilipe Manana /* 1429054570a1SFilipe Manana * Set the last_snapshot field to the generation of the commit 1430054570a1SFilipe Manana * root - like this ctree.c:btrfs_block_can_be_shared() behaves 1431054570a1SFilipe Manana * correctly (returns true) when the relocation root is created 1432054570a1SFilipe Manana * either inside the critical section of a transaction commit 1433054570a1SFilipe Manana * (through transaction.c:qgroup_account_snapshot()) and when 1434054570a1SFilipe Manana * it's created before the transaction commit is started. 1435054570a1SFilipe Manana */ 1436054570a1SFilipe Manana commit_root_gen = btrfs_header_generation(root->commit_root); 1437054570a1SFilipe Manana btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); 14383fd0a558SYan, Zheng } else { 14393fd0a558SYan, Zheng /* 14403fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 14413fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 14423fd0a558SYan, Zheng * modified after it was created have RELOC flag 14433fd0a558SYan, Zheng * set in their headers. so it's OK to not update 14443fd0a558SYan, Zheng * the 'last_snapshot'. 14453fd0a558SYan, Zheng */ 14463fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 14473fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 14483fd0a558SYan, Zheng BUG_ON(ret); 14493fd0a558SYan, Zheng } 14503fd0a558SYan, Zheng 14515d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 14525d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 14535d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 14545d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 14553fd0a558SYan, Zheng 14563fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 14573fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 14583fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 14593fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 14605d4f98a2SYan Zheng root_item->drop_level = 0; 14613fd0a558SYan, Zheng } 14625d4f98a2SYan Zheng 14635d4f98a2SYan Zheng btrfs_tree_unlock(eb); 14645d4f98a2SYan Zheng free_extent_buffer(eb); 14655d4f98a2SYan Zheng 14660b246afaSJeff Mahoney ret = btrfs_insert_root(trans, fs_info->tree_root, 14675d4f98a2SYan Zheng &root_key, root_item); 14685d4f98a2SYan Zheng BUG_ON(ret); 14695d4f98a2SYan Zheng kfree(root_item); 14705d4f98a2SYan Zheng 14713dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(fs_info->tree_root, &root_key); 14725d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 14733dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 14745d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 14753fd0a558SYan, Zheng return reloc_root; 14763fd0a558SYan, Zheng } 14773fd0a558SYan, Zheng 14783fd0a558SYan, Zheng /* 14793fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 14803fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 1481f44deb74SJosef Bacik * 1482f44deb74SJosef Bacik * The reloc_root comes out of here with two references, one for 1483f44deb74SJosef Bacik * root->reloc_root, and another for being on the rc->reloc_roots list. 14843fd0a558SYan, Zheng */ 14853fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 14863fd0a558SYan, Zheng struct btrfs_root *root) 14873fd0a558SYan, Zheng { 14880b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14893fd0a558SYan, Zheng struct btrfs_root *reloc_root; 14900b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 149120dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 14923fd0a558SYan, Zheng int clear_rsv = 0; 1493ffd7b339SJeff Mahoney int ret; 14943fd0a558SYan, Zheng 1495aec7db3bSJosef Bacik if (!rc) 14962abc726aSJosef Bacik return 0; 14972abc726aSJosef Bacik 14981fac4a54SQu Wenruo /* 14991fac4a54SQu Wenruo * The subvolume has reloc tree but the swap is finished, no need to 15001fac4a54SQu Wenruo * create/update the dead reloc tree 15011fac4a54SQu Wenruo */ 15026282675eSQu Wenruo if (reloc_root_is_dead(root)) 15031fac4a54SQu Wenruo return 0; 15041fac4a54SQu Wenruo 1505aec7db3bSJosef Bacik /* 1506aec7db3bSJosef Bacik * This is subtle but important. We do not do 1507aec7db3bSJosef Bacik * record_root_in_transaction for reloc roots, instead we record their 1508aec7db3bSJosef Bacik * corresponding fs root, and then here we update the last trans for the 1509aec7db3bSJosef Bacik * reloc root. This means that we have to do this for the entire life 1510aec7db3bSJosef Bacik * of the reloc root, regardless of which stage of the relocation we are 1511aec7db3bSJosef Bacik * in. 1512aec7db3bSJosef Bacik */ 15133fd0a558SYan, Zheng if (root->reloc_root) { 15143fd0a558SYan, Zheng reloc_root = root->reloc_root; 15153fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 15163fd0a558SYan, Zheng return 0; 15173fd0a558SYan, Zheng } 15183fd0a558SYan, Zheng 1519aec7db3bSJosef Bacik /* 1520aec7db3bSJosef Bacik * We are merging reloc roots, we do not need new reloc trees. Also 1521aec7db3bSJosef Bacik * reloc trees never need their own reloc tree. 1522aec7db3bSJosef Bacik */ 1523aec7db3bSJosef Bacik if (!rc->create_reloc_tree || 1524aec7db3bSJosef Bacik root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 1525aec7db3bSJosef Bacik return 0; 1526aec7db3bSJosef Bacik 152720dd2cbfSMiao Xie if (!trans->reloc_reserved) { 152820dd2cbfSMiao Xie rsv = trans->block_rsv; 15293fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 15303fd0a558SYan, Zheng clear_rsv = 1; 15313fd0a558SYan, Zheng } 15323fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 15333fd0a558SYan, Zheng if (clear_rsv) 153420dd2cbfSMiao Xie trans->block_rsv = rsv; 15355d4f98a2SYan Zheng 1536ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1537ffd7b339SJeff Mahoney BUG_ON(ret < 0); 1538f44deb74SJosef Bacik root->reloc_root = btrfs_grab_root(reloc_root); 15395d4f98a2SYan Zheng return 0; 15405d4f98a2SYan Zheng } 15415d4f98a2SYan Zheng 15425d4f98a2SYan Zheng /* 15435d4f98a2SYan Zheng * update root item of reloc tree 15445d4f98a2SYan Zheng */ 15455d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 15465d4f98a2SYan Zheng struct btrfs_root *root) 15475d4f98a2SYan Zheng { 15480b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 15495d4f98a2SYan Zheng struct btrfs_root *reloc_root; 15505d4f98a2SYan Zheng struct btrfs_root_item *root_item; 15515d4f98a2SYan Zheng int ret; 15525d4f98a2SYan Zheng 15536282675eSQu Wenruo if (!have_reloc_root(root)) 15547585717fSChris Mason goto out; 15555d4f98a2SYan Zheng 15565d4f98a2SYan Zheng reloc_root = root->reloc_root; 15575d4f98a2SYan Zheng root_item = &reloc_root->root_item; 15585d4f98a2SYan Zheng 1559f44deb74SJosef Bacik /* 1560f44deb74SJosef Bacik * We are probably ok here, but __del_reloc_root() will drop its ref of 1561f44deb74SJosef Bacik * the root. We have the ref for root->reloc_root, but just in case 1562f44deb74SJosef Bacik * hold it while we update the reloc root. 1563f44deb74SJosef Bacik */ 1564f44deb74SJosef Bacik btrfs_grab_root(reloc_root); 1565f44deb74SJosef Bacik 1566d2311e69SQu Wenruo /* root->reloc_root will stay until current relocation finished */ 15670b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 15683fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 1569d2311e69SQu Wenruo set_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 15706282675eSQu Wenruo /* 15716282675eSQu Wenruo * Mark the tree as dead before we change reloc_root so 15726282675eSQu Wenruo * have_reloc_root will not touch it from now on. 15736282675eSQu Wenruo */ 15746282675eSQu Wenruo smp_wmb(); 1575c974c464SWang Shilong __del_reloc_root(reloc_root); 15765d4f98a2SYan Zheng } 15775d4f98a2SYan Zheng 15785d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 1579ea287ab1SJosef Bacik __update_reloc_root(reloc_root); 15805d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 15815d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 15825d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 15835d4f98a2SYan Zheng } 15845d4f98a2SYan Zheng 15850b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 15865d4f98a2SYan Zheng &reloc_root->root_key, root_item); 15875d4f98a2SYan Zheng BUG_ON(ret); 1588f44deb74SJosef Bacik btrfs_put_root(reloc_root); 15897585717fSChris Mason out: 15905d4f98a2SYan Zheng return 0; 15915d4f98a2SYan Zheng } 15925d4f98a2SYan Zheng 15935d4f98a2SYan Zheng /* 15945d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 15955d4f98a2SYan Zheng * in a subvolume 15965d4f98a2SYan Zheng */ 15975d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 15985d4f98a2SYan Zheng { 15995d4f98a2SYan Zheng struct rb_node *node; 16005d4f98a2SYan Zheng struct rb_node *prev; 16015d4f98a2SYan Zheng struct btrfs_inode *entry; 16025d4f98a2SYan Zheng struct inode *inode; 16035d4f98a2SYan Zheng 16045d4f98a2SYan Zheng spin_lock(&root->inode_lock); 16055d4f98a2SYan Zheng again: 16065d4f98a2SYan Zheng node = root->inode_tree.rb_node; 16075d4f98a2SYan Zheng prev = NULL; 16085d4f98a2SYan Zheng while (node) { 16095d4f98a2SYan Zheng prev = node; 16105d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 16115d4f98a2SYan Zheng 16124a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 16135d4f98a2SYan Zheng node = node->rb_left; 16144a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 16155d4f98a2SYan Zheng node = node->rb_right; 16165d4f98a2SYan Zheng else 16175d4f98a2SYan Zheng break; 16185d4f98a2SYan Zheng } 16195d4f98a2SYan Zheng if (!node) { 16205d4f98a2SYan Zheng while (prev) { 16215d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 16224a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 16235d4f98a2SYan Zheng node = prev; 16245d4f98a2SYan Zheng break; 16255d4f98a2SYan Zheng } 16265d4f98a2SYan Zheng prev = rb_next(prev); 16275d4f98a2SYan Zheng } 16285d4f98a2SYan Zheng } 16295d4f98a2SYan Zheng while (node) { 16305d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 16315d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 16325d4f98a2SYan Zheng if (inode) { 16335d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 16345d4f98a2SYan Zheng return inode; 16355d4f98a2SYan Zheng } 16365d4f98a2SYan Zheng 16374a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 16385d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 16395d4f98a2SYan Zheng goto again; 16405d4f98a2SYan Zheng 16415d4f98a2SYan Zheng node = rb_next(node); 16425d4f98a2SYan Zheng } 16435d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 16445d4f98a2SYan Zheng return NULL; 16455d4f98a2SYan Zheng } 16465d4f98a2SYan Zheng 16475d4f98a2SYan Zheng /* 16485d4f98a2SYan Zheng * get new location of data 16495d4f98a2SYan Zheng */ 16505d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 16515d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 16525d4f98a2SYan Zheng { 16535d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 16545d4f98a2SYan Zheng struct btrfs_path *path; 16555d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 16565d4f98a2SYan Zheng struct extent_buffer *leaf; 16575d4f98a2SYan Zheng int ret; 16585d4f98a2SYan Zheng 16595d4f98a2SYan Zheng path = btrfs_alloc_path(); 16605d4f98a2SYan Zheng if (!path) 16615d4f98a2SYan Zheng return -ENOMEM; 16625d4f98a2SYan Zheng 16635d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 1664f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 1665f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 16665d4f98a2SYan Zheng if (ret < 0) 16675d4f98a2SYan Zheng goto out; 16685d4f98a2SYan Zheng if (ret > 0) { 16695d4f98a2SYan Zheng ret = -ENOENT; 16705d4f98a2SYan Zheng goto out; 16715d4f98a2SYan Zheng } 16725d4f98a2SYan Zheng 16735d4f98a2SYan Zheng leaf = path->nodes[0]; 16745d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 16755d4f98a2SYan Zheng struct btrfs_file_extent_item); 16765d4f98a2SYan Zheng 16775d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 16785d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 16795d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 16805d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 16815d4f98a2SYan Zheng 16825d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 168383d4cfd4SJosef Bacik ret = -EINVAL; 16845d4f98a2SYan Zheng goto out; 16855d4f98a2SYan Zheng } 16865d4f98a2SYan Zheng 16875d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16885d4f98a2SYan Zheng ret = 0; 16895d4f98a2SYan Zheng out: 16905d4f98a2SYan Zheng btrfs_free_path(path); 16915d4f98a2SYan Zheng return ret; 16925d4f98a2SYan Zheng } 16935d4f98a2SYan Zheng 16945d4f98a2SYan Zheng /* 16955d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 16965d4f98a2SYan Zheng * the new locations. 16975d4f98a2SYan Zheng */ 16983fd0a558SYan, Zheng static noinline_for_stack 16993fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 17005d4f98a2SYan Zheng struct reloc_control *rc, 17015d4f98a2SYan Zheng struct btrfs_root *root, 17023fd0a558SYan, Zheng struct extent_buffer *leaf) 17035d4f98a2SYan Zheng { 17040b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 17055d4f98a2SYan Zheng struct btrfs_key key; 17065d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 17075d4f98a2SYan Zheng struct inode *inode = NULL; 17085d4f98a2SYan Zheng u64 parent; 17095d4f98a2SYan Zheng u64 bytenr; 17103fd0a558SYan, Zheng u64 new_bytenr = 0; 17115d4f98a2SYan Zheng u64 num_bytes; 17125d4f98a2SYan Zheng u64 end; 17135d4f98a2SYan Zheng u32 nritems; 17145d4f98a2SYan Zheng u32 i; 171583d4cfd4SJosef Bacik int ret = 0; 17165d4f98a2SYan Zheng int first = 1; 17175d4f98a2SYan Zheng int dirty = 0; 17185d4f98a2SYan Zheng 17195d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 17205d4f98a2SYan Zheng return 0; 17215d4f98a2SYan Zheng 17225d4f98a2SYan Zheng /* reloc trees always use full backref */ 17235d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 17245d4f98a2SYan Zheng parent = leaf->start; 17255d4f98a2SYan Zheng else 17265d4f98a2SYan Zheng parent = 0; 17275d4f98a2SYan Zheng 17285d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 17295d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 173082fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 173182fa113fSQu Wenruo 17325d4f98a2SYan Zheng cond_resched(); 17335d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 17345d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 17355d4f98a2SYan Zheng continue; 17365d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 17375d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 17385d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 17395d4f98a2SYan Zheng continue; 17405d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 17415d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 17425d4f98a2SYan Zheng if (bytenr == 0) 17435d4f98a2SYan Zheng continue; 17449569cc20SQu Wenruo if (!in_range(bytenr, rc->block_group->start, 17459569cc20SQu Wenruo rc->block_group->length)) 17465d4f98a2SYan Zheng continue; 17475d4f98a2SYan Zheng 17485d4f98a2SYan Zheng /* 17495d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 17505d4f98a2SYan Zheng * to complete and drop the extent cache 17515d4f98a2SYan Zheng */ 17525d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 17535d4f98a2SYan Zheng if (first) { 17545d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 17555d4f98a2SYan Zheng first = 0; 17564a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 17573fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 17585d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 17595d4f98a2SYan Zheng } 17604a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 17615d4f98a2SYan Zheng end = key.offset + 17625d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 17635d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 17640b246afaSJeff Mahoney fs_info->sectorsize)); 17650b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 17665d4f98a2SYan Zheng end--; 17675d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1768d0082371SJeff Mahoney key.offset, end); 17695d4f98a2SYan Zheng if (!ret) 17705d4f98a2SYan Zheng continue; 17715d4f98a2SYan Zheng 1772dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1773dcdbc059SNikolay Borisov key.offset, end, 1); 17745d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1775d0082371SJeff Mahoney key.offset, end); 17765d4f98a2SYan Zheng } 17775d4f98a2SYan Zheng } 17785d4f98a2SYan Zheng 17795d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 17805d4f98a2SYan Zheng bytenr, num_bytes); 178183d4cfd4SJosef Bacik if (ret) { 178283d4cfd4SJosef Bacik /* 178383d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 178483d4cfd4SJosef Bacik * in the file extent yet. 178583d4cfd4SJosef Bacik */ 178683d4cfd4SJosef Bacik break; 17873fd0a558SYan, Zheng } 17885d4f98a2SYan Zheng 17895d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 17905d4f98a2SYan Zheng dirty = 1; 17915d4f98a2SYan Zheng 17925d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 179382fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 179482fa113fSQu Wenruo num_bytes, parent); 179582fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 179682fa113fSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1797b06c4bf5SFilipe Manana key.objectid, key.offset); 179882fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 179983d4cfd4SJosef Bacik if (ret) { 180066642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 180183d4cfd4SJosef Bacik break; 180283d4cfd4SJosef Bacik } 18035d4f98a2SYan Zheng 1804ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, bytenr, 1805ffd4bb2aSQu Wenruo num_bytes, parent); 1806ffd4bb2aSQu Wenruo ref.real_root = root->root_key.objectid; 1807ffd4bb2aSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1808b06c4bf5SFilipe Manana key.objectid, key.offset); 1809ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 181083d4cfd4SJosef Bacik if (ret) { 181166642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 181283d4cfd4SJosef Bacik break; 181383d4cfd4SJosef Bacik } 18145d4f98a2SYan Zheng } 18155d4f98a2SYan Zheng if (dirty) 18165d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 18173fd0a558SYan, Zheng if (inode) 18183fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 181983d4cfd4SJosef Bacik return ret; 18205d4f98a2SYan Zheng } 18215d4f98a2SYan Zheng 18225d4f98a2SYan Zheng static noinline_for_stack 18235d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 18245d4f98a2SYan Zheng struct btrfs_path *path, int level) 18255d4f98a2SYan Zheng { 18265d4f98a2SYan Zheng struct btrfs_disk_key key1; 18275d4f98a2SYan Zheng struct btrfs_disk_key key2; 18285d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 18295d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 18305d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 18315d4f98a2SYan Zheng } 18325d4f98a2SYan Zheng 18335d4f98a2SYan Zheng /* 18345d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 18355d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 18365d4f98a2SYan Zheng * reloc tree was create can be replaced. 18375d4f98a2SYan Zheng * 18385d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 18395d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 18405d4f98a2SYan Zheng * errors, a negative error number is returned. 18415d4f98a2SYan Zheng */ 18423fd0a558SYan, Zheng static noinline_for_stack 18433d0174f7SQu Wenruo int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, 18445d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 18455d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 18465d4f98a2SYan Zheng int lowest_level, int max_level) 18475d4f98a2SYan Zheng { 18480b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 18495d4f98a2SYan Zheng struct extent_buffer *eb; 18505d4f98a2SYan Zheng struct extent_buffer *parent; 185182fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 18525d4f98a2SYan Zheng struct btrfs_key key; 18535d4f98a2SYan Zheng u64 old_bytenr; 18545d4f98a2SYan Zheng u64 new_bytenr; 18555d4f98a2SYan Zheng u64 old_ptr_gen; 18565d4f98a2SYan Zheng u64 new_ptr_gen; 18575d4f98a2SYan Zheng u64 last_snapshot; 18585d4f98a2SYan Zheng u32 blocksize; 18593fd0a558SYan, Zheng int cow = 0; 18605d4f98a2SYan Zheng int level; 18615d4f98a2SYan Zheng int ret; 18625d4f98a2SYan Zheng int slot; 18635d4f98a2SYan Zheng 18645d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 18655d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 18665d4f98a2SYan Zheng 18675d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 18683fd0a558SYan, Zheng again: 18695d4f98a2SYan Zheng slot = path->slots[lowest_level]; 18705d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 18715d4f98a2SYan Zheng 18725d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 18738bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 18745d4f98a2SYan Zheng level = btrfs_header_level(eb); 18755d4f98a2SYan Zheng 18765d4f98a2SYan Zheng if (level < lowest_level) { 18775d4f98a2SYan Zheng btrfs_tree_unlock(eb); 18785d4f98a2SYan Zheng free_extent_buffer(eb); 18795d4f98a2SYan Zheng return 0; 18805d4f98a2SYan Zheng } 18815d4f98a2SYan Zheng 18823fd0a558SYan, Zheng if (cow) { 18835d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 18845d4f98a2SYan Zheng BUG_ON(ret); 18853fd0a558SYan, Zheng } 18868bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 18875d4f98a2SYan Zheng 18885d4f98a2SYan Zheng if (next_key) { 18895d4f98a2SYan Zheng next_key->objectid = (u64)-1; 18905d4f98a2SYan Zheng next_key->type = (u8)-1; 18915d4f98a2SYan Zheng next_key->offset = (u64)-1; 18925d4f98a2SYan Zheng } 18935d4f98a2SYan Zheng 18945d4f98a2SYan Zheng parent = eb; 18955d4f98a2SYan Zheng while (1) { 1896581c1760SQu Wenruo struct btrfs_key first_key; 1897581c1760SQu Wenruo 18985d4f98a2SYan Zheng level = btrfs_header_level(parent); 18995d4f98a2SYan Zheng BUG_ON(level < lowest_level); 19005d4f98a2SYan Zheng 19015d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 1902cbca7d59SFilipe Manana if (ret < 0) 1903cbca7d59SFilipe Manana break; 19045d4f98a2SYan Zheng if (ret && slot > 0) 19055d4f98a2SYan Zheng slot--; 19065d4f98a2SYan Zheng 19075d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 19085d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 19095d4f98a2SYan Zheng 19105d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 19110b246afaSJeff Mahoney blocksize = fs_info->nodesize; 19125d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 191317515f1bSQu Wenruo btrfs_node_key_to_cpu(parent, &first_key, slot); 19145d4f98a2SYan Zheng 19155d4f98a2SYan Zheng if (level <= max_level) { 19165d4f98a2SYan Zheng eb = path->nodes[level]; 19175d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 19185d4f98a2SYan Zheng path->slots[level]); 19195d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 19205d4f98a2SYan Zheng path->slots[level]); 19215d4f98a2SYan Zheng } else { 19225d4f98a2SYan Zheng new_bytenr = 0; 19235d4f98a2SYan Zheng new_ptr_gen = 0; 19245d4f98a2SYan Zheng } 19255d4f98a2SYan Zheng 1926fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 19275d4f98a2SYan Zheng ret = level; 19285d4f98a2SYan Zheng break; 19295d4f98a2SYan Zheng } 19305d4f98a2SYan Zheng 19315d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 19325d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 19333fd0a558SYan, Zheng if (level <= lowest_level) { 19345d4f98a2SYan Zheng ret = 0; 19355d4f98a2SYan Zheng break; 19365d4f98a2SYan Zheng } 19375d4f98a2SYan Zheng 1938581c1760SQu Wenruo eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen, 1939581c1760SQu Wenruo level - 1, &first_key); 194064c043deSLiu Bo if (IS_ERR(eb)) { 194164c043deSLiu Bo ret = PTR_ERR(eb); 1942264813acSLiu Bo break; 194364c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 194464c043deSLiu Bo ret = -EIO; 1945416bc658SJosef Bacik free_extent_buffer(eb); 1946379cde74SStefan Behrens break; 1947416bc658SJosef Bacik } 19485d4f98a2SYan Zheng btrfs_tree_lock(eb); 19493fd0a558SYan, Zheng if (cow) { 19505d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 19515d4f98a2SYan Zheng slot, &eb); 19525d4f98a2SYan Zheng BUG_ON(ret); 19535d4f98a2SYan Zheng } 19548bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19555d4f98a2SYan Zheng 19565d4f98a2SYan Zheng btrfs_tree_unlock(parent); 19575d4f98a2SYan Zheng free_extent_buffer(parent); 19585d4f98a2SYan Zheng 19595d4f98a2SYan Zheng parent = eb; 19605d4f98a2SYan Zheng continue; 19615d4f98a2SYan Zheng } 19625d4f98a2SYan Zheng 19633fd0a558SYan, Zheng if (!cow) { 19643fd0a558SYan, Zheng btrfs_tree_unlock(parent); 19653fd0a558SYan, Zheng free_extent_buffer(parent); 19663fd0a558SYan, Zheng cow = 1; 19673fd0a558SYan, Zheng goto again; 19683fd0a558SYan, Zheng } 19693fd0a558SYan, Zheng 19705d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 19715d4f98a2SYan Zheng path->slots[level]); 1972b3b4aa74SDavid Sterba btrfs_release_path(path); 19735d4f98a2SYan Zheng 19745d4f98a2SYan Zheng path->lowest_level = level; 19755d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 19765d4f98a2SYan Zheng path->lowest_level = 0; 19775d4f98a2SYan Zheng BUG_ON(ret); 19785d4f98a2SYan Zheng 19795d4f98a2SYan Zheng /* 1980824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 1981824d8dffSQu Wenruo * 1982824d8dffSQu Wenruo * We must trace both trees. 1983824d8dffSQu Wenruo * 1) Tree reloc subtree 1984824d8dffSQu Wenruo * If not traced, we will leak data numbers 1985824d8dffSQu Wenruo * 2) Fs subtree 1986824d8dffSQu Wenruo * If not traced, we will double count old data 1987f616f5cdSQu Wenruo * 1988f616f5cdSQu Wenruo * We don't scan the subtree right now, but only record 1989f616f5cdSQu Wenruo * the swapped tree blocks. 1990f616f5cdSQu Wenruo * The real subtree rescan is delayed until we have new 1991f616f5cdSQu Wenruo * CoW on the subtree root node before transaction commit. 1992824d8dffSQu Wenruo */ 1993370a11b8SQu Wenruo ret = btrfs_qgroup_add_swapped_blocks(trans, dest, 1994370a11b8SQu Wenruo rc->block_group, parent, slot, 1995370a11b8SQu Wenruo path->nodes[level], path->slots[level], 1996370a11b8SQu Wenruo last_snapshot); 1997370a11b8SQu Wenruo if (ret < 0) 1998370a11b8SQu Wenruo break; 1999824d8dffSQu Wenruo /* 20005d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 20015d4f98a2SYan Zheng */ 20025d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 20035d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 20045d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 20055d4f98a2SYan Zheng 20065d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 20075d4f98a2SYan Zheng path->slots[level], old_bytenr); 20085d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 20095d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 20105d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 20115d4f98a2SYan Zheng 201282fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, old_bytenr, 201382fa113fSQu Wenruo blocksize, path->nodes[level]->start); 201482fa113fSQu Wenruo ref.skip_qgroup = true; 201582fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 201682fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 20175d4f98a2SYan Zheng BUG_ON(ret); 201882fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 201982fa113fSQu Wenruo blocksize, 0); 202082fa113fSQu Wenruo ref.skip_qgroup = true; 202182fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 202282fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 20235d4f98a2SYan Zheng BUG_ON(ret); 20245d4f98a2SYan Zheng 2025ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, new_bytenr, 2026ffd4bb2aSQu Wenruo blocksize, path->nodes[level]->start); 2027ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 2028ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2029ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 20305d4f98a2SYan Zheng BUG_ON(ret); 20315d4f98a2SYan Zheng 2032ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, old_bytenr, 2033ffd4bb2aSQu Wenruo blocksize, 0); 2034ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 2035ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2036ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 20375d4f98a2SYan Zheng BUG_ON(ret); 20385d4f98a2SYan Zheng 20395d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 20405d4f98a2SYan Zheng 20415d4f98a2SYan Zheng ret = level; 20425d4f98a2SYan Zheng break; 20435d4f98a2SYan Zheng } 20445d4f98a2SYan Zheng btrfs_tree_unlock(parent); 20455d4f98a2SYan Zheng free_extent_buffer(parent); 20465d4f98a2SYan Zheng return ret; 20475d4f98a2SYan Zheng } 20485d4f98a2SYan Zheng 20495d4f98a2SYan Zheng /* 20505d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 20515d4f98a2SYan Zheng */ 20525d4f98a2SYan Zheng static noinline_for_stack 20535d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 20545d4f98a2SYan Zheng int *level) 20555d4f98a2SYan Zheng { 20565d4f98a2SYan Zheng struct extent_buffer *eb; 20575d4f98a2SYan Zheng int i; 20585d4f98a2SYan Zheng u64 last_snapshot; 20595d4f98a2SYan Zheng u32 nritems; 20605d4f98a2SYan Zheng 20615d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 20625d4f98a2SYan Zheng 20635d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 20645d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 20655d4f98a2SYan Zheng path->nodes[i] = NULL; 20665d4f98a2SYan Zheng } 20675d4f98a2SYan Zheng 20685d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 20695d4f98a2SYan Zheng eb = path->nodes[i]; 20705d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 20715d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 20725d4f98a2SYan Zheng path->slots[i]++; 20735d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 20745d4f98a2SYan Zheng last_snapshot) 20755d4f98a2SYan Zheng continue; 20765d4f98a2SYan Zheng 20775d4f98a2SYan Zheng *level = i; 20785d4f98a2SYan Zheng return 0; 20795d4f98a2SYan Zheng } 20805d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 20815d4f98a2SYan Zheng path->nodes[i] = NULL; 20825d4f98a2SYan Zheng } 20835d4f98a2SYan Zheng return 1; 20845d4f98a2SYan Zheng } 20855d4f98a2SYan Zheng 20865d4f98a2SYan Zheng /* 20875d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 20885d4f98a2SYan Zheng */ 20895d4f98a2SYan Zheng static noinline_for_stack 20905d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 20915d4f98a2SYan Zheng int *level) 20925d4f98a2SYan Zheng { 20932ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 20945d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 20955d4f98a2SYan Zheng int i; 20965d4f98a2SYan Zheng u64 bytenr; 20975d4f98a2SYan Zheng u64 ptr_gen = 0; 20985d4f98a2SYan Zheng u64 last_snapshot; 20995d4f98a2SYan Zheng u32 nritems; 21005d4f98a2SYan Zheng 21015d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 21025d4f98a2SYan Zheng 21035d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 2104581c1760SQu Wenruo struct btrfs_key first_key; 2105581c1760SQu Wenruo 21065d4f98a2SYan Zheng eb = path->nodes[i]; 21075d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 21085d4f98a2SYan Zheng while (path->slots[i] < nritems) { 21095d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 21105d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 21115d4f98a2SYan Zheng break; 21125d4f98a2SYan Zheng path->slots[i]++; 21135d4f98a2SYan Zheng } 21145d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 21155d4f98a2SYan Zheng if (i == *level) 21165d4f98a2SYan Zheng break; 21175d4f98a2SYan Zheng *level = i + 1; 21185d4f98a2SYan Zheng return 0; 21195d4f98a2SYan Zheng } 21205d4f98a2SYan Zheng if (i == 1) { 21215d4f98a2SYan Zheng *level = i; 21225d4f98a2SYan Zheng return 0; 21235d4f98a2SYan Zheng } 21245d4f98a2SYan Zheng 21255d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2126581c1760SQu Wenruo btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); 2127581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1, 2128581c1760SQu Wenruo &first_key); 212964c043deSLiu Bo if (IS_ERR(eb)) { 213064c043deSLiu Bo return PTR_ERR(eb); 213164c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2132416bc658SJosef Bacik free_extent_buffer(eb); 2133416bc658SJosef Bacik return -EIO; 2134416bc658SJosef Bacik } 21355d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 21365d4f98a2SYan Zheng path->nodes[i - 1] = eb; 21375d4f98a2SYan Zheng path->slots[i - 1] = 0; 21385d4f98a2SYan Zheng } 21395d4f98a2SYan Zheng return 1; 21405d4f98a2SYan Zheng } 21415d4f98a2SYan Zheng 21425d4f98a2SYan Zheng /* 21435d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 21445d4f98a2SYan Zheng * [min_key, max_key) 21455d4f98a2SYan Zheng */ 21465d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 21475d4f98a2SYan Zheng struct btrfs_key *min_key, 21485d4f98a2SYan Zheng struct btrfs_key *max_key) 21495d4f98a2SYan Zheng { 21500b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 21515d4f98a2SYan Zheng struct inode *inode = NULL; 21525d4f98a2SYan Zheng u64 objectid; 21535d4f98a2SYan Zheng u64 start, end; 215433345d01SLi Zefan u64 ino; 21555d4f98a2SYan Zheng 21565d4f98a2SYan Zheng objectid = min_key->objectid; 21575d4f98a2SYan Zheng while (1) { 21585d4f98a2SYan Zheng cond_resched(); 21595d4f98a2SYan Zheng iput(inode); 21605d4f98a2SYan Zheng 21615d4f98a2SYan Zheng if (objectid > max_key->objectid) 21625d4f98a2SYan Zheng break; 21635d4f98a2SYan Zheng 21645d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 21655d4f98a2SYan Zheng if (!inode) 21665d4f98a2SYan Zheng break; 21674a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 21685d4f98a2SYan Zheng 216933345d01SLi Zefan if (ino > max_key->objectid) { 21705d4f98a2SYan Zheng iput(inode); 21715d4f98a2SYan Zheng break; 21725d4f98a2SYan Zheng } 21735d4f98a2SYan Zheng 217433345d01SLi Zefan objectid = ino + 1; 21755d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 21765d4f98a2SYan Zheng continue; 21775d4f98a2SYan Zheng 217833345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 21795d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 21805d4f98a2SYan Zheng continue; 21815d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 21825d4f98a2SYan Zheng start = 0; 21835d4f98a2SYan Zheng else { 21845d4f98a2SYan Zheng start = min_key->offset; 21850b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 21865d4f98a2SYan Zheng } 21875d4f98a2SYan Zheng } else { 21885d4f98a2SYan Zheng start = 0; 21895d4f98a2SYan Zheng } 21905d4f98a2SYan Zheng 219133345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 21925d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 21935d4f98a2SYan Zheng continue; 21945d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 21955d4f98a2SYan Zheng end = (u64)-1; 21965d4f98a2SYan Zheng } else { 21975d4f98a2SYan Zheng if (max_key->offset == 0) 21985d4f98a2SYan Zheng continue; 21995d4f98a2SYan Zheng end = max_key->offset; 22000b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 22015d4f98a2SYan Zheng end--; 22025d4f98a2SYan Zheng } 22035d4f98a2SYan Zheng } else { 22045d4f98a2SYan Zheng end = (u64)-1; 22055d4f98a2SYan Zheng } 22065d4f98a2SYan Zheng 22075d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2208d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 2209dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 2210d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 22115d4f98a2SYan Zheng } 22125d4f98a2SYan Zheng return 0; 22135d4f98a2SYan Zheng } 22145d4f98a2SYan Zheng 22155d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 22165d4f98a2SYan Zheng struct btrfs_key *key) 22175d4f98a2SYan Zheng 22185d4f98a2SYan Zheng { 22195d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 22205d4f98a2SYan Zheng if (!path->nodes[level]) 22215d4f98a2SYan Zheng break; 22225d4f98a2SYan Zheng if (path->slots[level] + 1 < 22235d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 22245d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 22255d4f98a2SYan Zheng path->slots[level] + 1); 22265d4f98a2SYan Zheng return 0; 22275d4f98a2SYan Zheng } 22285d4f98a2SYan Zheng level++; 22295d4f98a2SYan Zheng } 22305d4f98a2SYan Zheng return 1; 22315d4f98a2SYan Zheng } 22325d4f98a2SYan Zheng 22335d4f98a2SYan Zheng /* 2234d2311e69SQu Wenruo * Insert current subvolume into reloc_control::dirty_subvol_roots 2235d2311e69SQu Wenruo */ 2236d2311e69SQu Wenruo static void insert_dirty_subvol(struct btrfs_trans_handle *trans, 2237d2311e69SQu Wenruo struct reloc_control *rc, 2238d2311e69SQu Wenruo struct btrfs_root *root) 2239d2311e69SQu Wenruo { 2240d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2241d2311e69SQu Wenruo struct btrfs_root_item *reloc_root_item; 2242d2311e69SQu Wenruo 2243d2311e69SQu Wenruo /* @root must be a subvolume tree root with a valid reloc tree */ 2244d2311e69SQu Wenruo ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 2245d2311e69SQu Wenruo ASSERT(reloc_root); 2246d2311e69SQu Wenruo 2247d2311e69SQu Wenruo reloc_root_item = &reloc_root->root_item; 2248d2311e69SQu Wenruo memset(&reloc_root_item->drop_progress, 0, 2249d2311e69SQu Wenruo sizeof(reloc_root_item->drop_progress)); 2250d2311e69SQu Wenruo reloc_root_item->drop_level = 0; 2251d2311e69SQu Wenruo btrfs_set_root_refs(reloc_root_item, 0); 2252d2311e69SQu Wenruo btrfs_update_reloc_root(trans, root); 2253d2311e69SQu Wenruo 2254d2311e69SQu Wenruo if (list_empty(&root->reloc_dirty_list)) { 225500246528SJosef Bacik btrfs_grab_root(root); 2256d2311e69SQu Wenruo list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); 2257d2311e69SQu Wenruo } 2258d2311e69SQu Wenruo } 2259d2311e69SQu Wenruo 2260d2311e69SQu Wenruo static int clean_dirty_subvols(struct reloc_control *rc) 2261d2311e69SQu Wenruo { 2262d2311e69SQu Wenruo struct btrfs_root *root; 2263d2311e69SQu Wenruo struct btrfs_root *next; 2264d2311e69SQu Wenruo int ret = 0; 226530d40577SQu Wenruo int ret2; 2266d2311e69SQu Wenruo 2267d2311e69SQu Wenruo list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, 2268d2311e69SQu Wenruo reloc_dirty_list) { 226930d40577SQu Wenruo if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 227030d40577SQu Wenruo /* Merged subvolume, cleanup its reloc root */ 2271d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2272d2311e69SQu Wenruo 2273d2311e69SQu Wenruo list_del_init(&root->reloc_dirty_list); 2274d2311e69SQu Wenruo root->reloc_root = NULL; 22756282675eSQu Wenruo /* 22766282675eSQu Wenruo * Need barrier to ensure clear_bit() only happens after 22776282675eSQu Wenruo * root->reloc_root = NULL. Pairs with have_reloc_root. 22786282675eSQu Wenruo */ 22796282675eSQu Wenruo smp_wmb(); 22801fac4a54SQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 2281f28de8d8SJosef Bacik if (reloc_root) { 2282f44deb74SJosef Bacik /* 2283f44deb74SJosef Bacik * btrfs_drop_snapshot drops our ref we hold for 2284f44deb74SJosef Bacik * ->reloc_root. If it fails however we must 2285f44deb74SJosef Bacik * drop the ref ourselves. 2286f44deb74SJosef Bacik */ 2287f28de8d8SJosef Bacik ret2 = btrfs_drop_snapshot(reloc_root, 0, 1); 2288f44deb74SJosef Bacik if (ret2 < 0) { 2289f44deb74SJosef Bacik btrfs_put_root(reloc_root); 2290f44deb74SJosef Bacik if (!ret) 2291f28de8d8SJosef Bacik ret = ret2; 2292f28de8d8SJosef Bacik } 2293f44deb74SJosef Bacik } 229400246528SJosef Bacik btrfs_put_root(root); 229530d40577SQu Wenruo } else { 229630d40577SQu Wenruo /* Orphan reloc tree, just clean it up */ 22970078a9f9SNikolay Borisov ret2 = btrfs_drop_snapshot(root, 0, 1); 2298f44deb74SJosef Bacik if (ret2 < 0) { 2299f44deb74SJosef Bacik btrfs_put_root(root); 2300f44deb74SJosef Bacik if (!ret) 230130d40577SQu Wenruo ret = ret2; 230230d40577SQu Wenruo } 2303d2311e69SQu Wenruo } 2304f44deb74SJosef Bacik } 2305d2311e69SQu Wenruo return ret; 2306d2311e69SQu Wenruo } 2307d2311e69SQu Wenruo 2308d2311e69SQu Wenruo /* 23095d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 23105d4f98a2SYan Zheng * fs tree. 23115d4f98a2SYan Zheng */ 23125d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 23135d4f98a2SYan Zheng struct btrfs_root *root) 23145d4f98a2SYan Zheng { 23150b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 23165d4f98a2SYan Zheng struct btrfs_key key; 23175d4f98a2SYan Zheng struct btrfs_key next_key; 23189e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 23195d4f98a2SYan Zheng struct btrfs_root *reloc_root; 23205d4f98a2SYan Zheng struct btrfs_root_item *root_item; 23215d4f98a2SYan Zheng struct btrfs_path *path; 23223fd0a558SYan, Zheng struct extent_buffer *leaf; 23235d4f98a2SYan Zheng int level; 23245d4f98a2SYan Zheng int max_level; 23255d4f98a2SYan Zheng int replaced = 0; 23265d4f98a2SYan Zheng int ret; 23275d4f98a2SYan Zheng int err = 0; 23283fd0a558SYan, Zheng u32 min_reserved; 23295d4f98a2SYan Zheng 23305d4f98a2SYan Zheng path = btrfs_alloc_path(); 23315d4f98a2SYan Zheng if (!path) 23325d4f98a2SYan Zheng return -ENOMEM; 2333e4058b54SDavid Sterba path->reada = READA_FORWARD; 23345d4f98a2SYan Zheng 23355d4f98a2SYan Zheng reloc_root = root->reloc_root; 23365d4f98a2SYan Zheng root_item = &reloc_root->root_item; 23375d4f98a2SYan Zheng 23385d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 23395d4f98a2SYan Zheng level = btrfs_root_level(root_item); 234067439dadSDavid Sterba atomic_inc(&reloc_root->node->refs); 23415d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 23425d4f98a2SYan Zheng path->slots[level] = 0; 23435d4f98a2SYan Zheng } else { 23445d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 23455d4f98a2SYan Zheng 23465d4f98a2SYan Zheng level = root_item->drop_level; 23475d4f98a2SYan Zheng BUG_ON(level == 0); 23485d4f98a2SYan Zheng path->lowest_level = level; 23495d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 235033c66f43SYan Zheng path->lowest_level = 0; 23515d4f98a2SYan Zheng if (ret < 0) { 23525d4f98a2SYan Zheng btrfs_free_path(path); 23535d4f98a2SYan Zheng return ret; 23545d4f98a2SYan Zheng } 23555d4f98a2SYan Zheng 23565d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 23575d4f98a2SYan Zheng path->slots[level]); 23585d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 23595d4f98a2SYan Zheng 23605d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 23615d4f98a2SYan Zheng } 23625d4f98a2SYan Zheng 23630b246afaSJeff Mahoney min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 23645d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 23655d4f98a2SYan Zheng 23665d4f98a2SYan Zheng while (1) { 236708e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 236808e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 23693fd0a558SYan, Zheng if (ret) { 23709e6a0c52SJosef Bacik err = ret; 23719e6a0c52SJosef Bacik goto out; 23723fd0a558SYan, Zheng } 23739e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 23749e6a0c52SJosef Bacik if (IS_ERR(trans)) { 23759e6a0c52SJosef Bacik err = PTR_ERR(trans); 23769e6a0c52SJosef Bacik trans = NULL; 23779e6a0c52SJosef Bacik goto out; 23789e6a0c52SJosef Bacik } 23792abc726aSJosef Bacik 23802abc726aSJosef Bacik /* 23812abc726aSJosef Bacik * At this point we no longer have a reloc_control, so we can't 23822abc726aSJosef Bacik * depend on btrfs_init_reloc_root to update our last_trans. 23832abc726aSJosef Bacik * 23842abc726aSJosef Bacik * But that's ok, we started the trans handle on our 23852abc726aSJosef Bacik * corresponding fs_root, which means it's been added to the 23862abc726aSJosef Bacik * dirty list. At commit time we'll still call 23872abc726aSJosef Bacik * btrfs_update_reloc_root() and update our root item 23882abc726aSJosef Bacik * appropriately. 23892abc726aSJosef Bacik */ 23902abc726aSJosef Bacik reloc_root->last_trans = trans->transid; 23919e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 23923fd0a558SYan, Zheng 23933fd0a558SYan, Zheng replaced = 0; 23945d4f98a2SYan Zheng max_level = level; 23955d4f98a2SYan Zheng 23965d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 23975d4f98a2SYan Zheng if (ret < 0) { 23985d4f98a2SYan Zheng err = ret; 23995d4f98a2SYan Zheng goto out; 24005d4f98a2SYan Zheng } 24015d4f98a2SYan Zheng if (ret > 0) 24025d4f98a2SYan Zheng break; 24035d4f98a2SYan Zheng 24045d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 24055d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 24065d4f98a2SYan Zheng ret = 0; 24075d4f98a2SYan Zheng } else { 24083d0174f7SQu Wenruo ret = replace_path(trans, rc, root, reloc_root, path, 24093fd0a558SYan, Zheng &next_key, level, max_level); 24105d4f98a2SYan Zheng } 24115d4f98a2SYan Zheng if (ret < 0) { 24125d4f98a2SYan Zheng err = ret; 24135d4f98a2SYan Zheng goto out; 24145d4f98a2SYan Zheng } 24155d4f98a2SYan Zheng 24165d4f98a2SYan Zheng if (ret > 0) { 24175d4f98a2SYan Zheng level = ret; 24185d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 24195d4f98a2SYan Zheng path->slots[level]); 24205d4f98a2SYan Zheng replaced = 1; 24215d4f98a2SYan Zheng } 24225d4f98a2SYan Zheng 24235d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 24245d4f98a2SYan Zheng if (ret > 0) 24255d4f98a2SYan Zheng break; 24265d4f98a2SYan Zheng 24275d4f98a2SYan Zheng BUG_ON(level == 0); 24285d4f98a2SYan Zheng /* 24295d4f98a2SYan Zheng * save the merging progress in the drop_progress. 24305d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 24315d4f98a2SYan Zheng */ 24325d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 24335d4f98a2SYan Zheng path->slots[level]); 24345d4f98a2SYan Zheng root_item->drop_level = level; 24355d4f98a2SYan Zheng 24363a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 24379e6a0c52SJosef Bacik trans = NULL; 24385d4f98a2SYan Zheng 24392ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 24405d4f98a2SYan Zheng 24415d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 24425d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 24435d4f98a2SYan Zheng } 24445d4f98a2SYan Zheng 24455d4f98a2SYan Zheng /* 24465d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 24475d4f98a2SYan Zheng * relocated and the block is tree root. 24485d4f98a2SYan Zheng */ 24495d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 24505d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 24515d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 24525d4f98a2SYan Zheng free_extent_buffer(leaf); 24535d4f98a2SYan Zheng if (ret < 0) 24545d4f98a2SYan Zheng err = ret; 24555d4f98a2SYan Zheng out: 24565d4f98a2SYan Zheng btrfs_free_path(path); 24575d4f98a2SYan Zheng 2458d2311e69SQu Wenruo if (err == 0) 2459d2311e69SQu Wenruo insert_dirty_subvol(trans, rc, root); 24605d4f98a2SYan Zheng 24619e6a0c52SJosef Bacik if (trans) 24623a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 24635d4f98a2SYan Zheng 24642ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 24655d4f98a2SYan Zheng 24665d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 24675d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 24685d4f98a2SYan Zheng 24695d4f98a2SYan Zheng return err; 24705d4f98a2SYan Zheng } 24715d4f98a2SYan Zheng 24723fd0a558SYan, Zheng static noinline_for_stack 24733fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 24745d4f98a2SYan Zheng { 24753fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 24760b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 24773fd0a558SYan, Zheng struct btrfs_root *reloc_root; 24785d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 24793fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 24803fd0a558SYan, Zheng u64 num_bytes = 0; 24813fd0a558SYan, Zheng int ret; 24823fd0a558SYan, Zheng 24830b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 24840b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 24853fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 24860b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 24877585717fSChris Mason 24883fd0a558SYan, Zheng again: 24893fd0a558SYan, Zheng if (!err) { 24903fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 249108e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 249208e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 24933fd0a558SYan, Zheng if (ret) 24943fd0a558SYan, Zheng err = ret; 24953fd0a558SYan, Zheng } 24963fd0a558SYan, Zheng 24977a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 24983612b495STsutomu Itoh if (IS_ERR(trans)) { 24993612b495STsutomu Itoh if (!err) 25002ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 250163f018beSNikolay Borisov num_bytes, NULL); 25023612b495STsutomu Itoh return PTR_ERR(trans); 25033612b495STsutomu Itoh } 25043fd0a558SYan, Zheng 25053fd0a558SYan, Zheng if (!err) { 25063fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 25073a45bb20SJeff Mahoney btrfs_end_transaction(trans); 25082ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 250963f018beSNikolay Borisov num_bytes, NULL); 25103fd0a558SYan, Zheng goto again; 25113fd0a558SYan, Zheng } 25123fd0a558SYan, Zheng } 25133fd0a558SYan, Zheng 25143fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 25153fd0a558SYan, Zheng 25163fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 25173fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 25183fd0a558SYan, Zheng struct btrfs_root, root_list); 25193fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 25203fd0a558SYan, Zheng 25210b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 25223fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 25233fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 25243fd0a558SYan, Zheng 25253fd0a558SYan, Zheng /* 25263fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 25273fd0a558SYan, Zheng * knows it should resumes merging 25283fd0a558SYan, Zheng */ 25293fd0a558SYan, Zheng if (!err) 25303fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 25313fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 25323fd0a558SYan, Zheng 25333fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 253400246528SJosef Bacik btrfs_put_root(root); 25353fd0a558SYan, Zheng } 25363fd0a558SYan, Zheng 25373fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 25383fd0a558SYan, Zheng 25393fd0a558SYan, Zheng if (!err) 25403a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 25413fd0a558SYan, Zheng else 25423a45bb20SJeff Mahoney btrfs_end_transaction(trans); 25433fd0a558SYan, Zheng return err; 25443fd0a558SYan, Zheng } 25453fd0a558SYan, Zheng 25463fd0a558SYan, Zheng static noinline_for_stack 2547aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2548aca1bba6SLiu Bo { 2549aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2550aca1bba6SLiu Bo 2551aca1bba6SLiu Bo while (!list_empty(list)) { 2552aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2553aca1bba6SLiu Bo root_list); 2554bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 2555aca1bba6SLiu Bo } 2556aca1bba6SLiu Bo } 2557aca1bba6SLiu Bo 2558aca1bba6SLiu Bo static noinline_for_stack 255994404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 25603fd0a558SYan, Zheng { 25610b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 25625d4f98a2SYan Zheng struct btrfs_root *root; 25635d4f98a2SYan Zheng struct btrfs_root *reloc_root; 25643fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 25653fd0a558SYan, Zheng int found = 0; 2566aca1bba6SLiu Bo int ret = 0; 25673fd0a558SYan, Zheng again: 25683fd0a558SYan, Zheng root = rc->extent_root; 25697585717fSChris Mason 25707585717fSChris Mason /* 25717585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 25727585717fSChris Mason * we have to make sure nobody is in the middle of 25737585717fSChris Mason * adding their roots to the list while we are 25747585717fSChris Mason * doing this splice 25757585717fSChris Mason */ 25760b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 25773fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 25780b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 25795d4f98a2SYan Zheng 25803fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 25813fd0a558SYan, Zheng found = 1; 25823fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 25833fd0a558SYan, Zheng struct btrfs_root, root_list); 25845d4f98a2SYan Zheng 25855d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 25860b246afaSJeff Mahoney root = read_fs_root(fs_info, 25875d4f98a2SYan Zheng reloc_root->root_key.offset); 25885d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 25895d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 25905d4f98a2SYan Zheng 25913fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 259200246528SJosef Bacik btrfs_put_root(root); 2593b37b39cdSJosef Bacik if (ret) { 259425e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 259525e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 259625e293c2SWang Shilong &reloc_roots); 2597aca1bba6SLiu Bo goto out; 2598b37b39cdSJosef Bacik } 25993fd0a558SYan, Zheng } else { 26003fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 260130d40577SQu Wenruo /* Don't forget to queue this reloc root for cleanup */ 260230d40577SQu Wenruo list_add_tail(&reloc_root->reloc_dirty_list, 260330d40577SQu Wenruo &rc->dirty_subvol_roots); 26043fd0a558SYan, Zheng } 26055d4f98a2SYan Zheng } 26065d4f98a2SYan Zheng 26073fd0a558SYan, Zheng if (found) { 26083fd0a558SYan, Zheng found = 0; 26093fd0a558SYan, Zheng goto again; 26105d4f98a2SYan Zheng } 2611aca1bba6SLiu Bo out: 2612aca1bba6SLiu Bo if (ret) { 26130b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2614aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2615aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2616467bb1d2SWang Shilong 2617467bb1d2SWang Shilong /* new reloc root may be added */ 26180b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2619467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 26200b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2621467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2622467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2623aca1bba6SLiu Bo } 2624aca1bba6SLiu Bo 26257b7b7431SJosef Bacik /* 26267b7b7431SJosef Bacik * We used to have 26277b7b7431SJosef Bacik * 26287b7b7431SJosef Bacik * BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 26297b7b7431SJosef Bacik * 26307b7b7431SJosef Bacik * here, but it's wrong. If we fail to start the transaction in 26317b7b7431SJosef Bacik * prepare_to_merge() we will have only 0 ref reloc roots, none of which 26327b7b7431SJosef Bacik * have actually been removed from the reloc_root_tree rb tree. This is 26337b7b7431SJosef Bacik * fine because we're bailing here, and we hold a reference on the root 26347b7b7431SJosef Bacik * for the list that holds it, so these roots will be cleaned up when we 26357b7b7431SJosef Bacik * do the reloc_dirty_list afterwards. Meanwhile the root->reloc_root 26367b7b7431SJosef Bacik * will be cleaned up on unmount. 26377b7b7431SJosef Bacik * 26387b7b7431SJosef Bacik * The remaining nodes will be cleaned up by free_reloc_control. 26397b7b7431SJosef Bacik */ 26405d4f98a2SYan Zheng } 26415d4f98a2SYan Zheng 26425d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 26435d4f98a2SYan Zheng { 26445d4f98a2SYan Zheng struct tree_block *block; 26455d4f98a2SYan Zheng struct rb_node *rb_node; 26465d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 26475d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 26485d4f98a2SYan Zheng rb_erase(rb_node, blocks); 26495d4f98a2SYan Zheng kfree(block); 26505d4f98a2SYan Zheng } 26515d4f98a2SYan Zheng } 26525d4f98a2SYan Zheng 26535d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 26545d4f98a2SYan Zheng struct btrfs_root *reloc_root) 26555d4f98a2SYan Zheng { 26560b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 26575d4f98a2SYan Zheng struct btrfs_root *root; 2658442b1ac5SJosef Bacik int ret; 26595d4f98a2SYan Zheng 26605d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 26615d4f98a2SYan Zheng return 0; 26625d4f98a2SYan Zheng 26630b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 26645d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 26655d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 2666442b1ac5SJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 266700246528SJosef Bacik btrfs_put_root(root); 26685d4f98a2SYan Zheng 2669442b1ac5SJosef Bacik return ret; 26705d4f98a2SYan Zheng } 26715d4f98a2SYan Zheng 26723fd0a558SYan, Zheng static noinline_for_stack 26733fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 26743fd0a558SYan, Zheng struct reloc_control *rc, 26755d4f98a2SYan Zheng struct backref_node *node, 2676dc4103f9SWang Shilong struct backref_edge *edges[]) 26775d4f98a2SYan Zheng { 26785d4f98a2SYan Zheng struct backref_node *next; 26795d4f98a2SYan Zheng struct btrfs_root *root; 26803fd0a558SYan, Zheng int index = 0; 26813fd0a558SYan, Zheng 26825d4f98a2SYan Zheng next = node; 26835d4f98a2SYan Zheng while (1) { 26845d4f98a2SYan Zheng cond_resched(); 26855d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 26865d4f98a2SYan Zheng root = next->root; 26873fd0a558SYan, Zheng BUG_ON(!root); 268827cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 26895d4f98a2SYan Zheng 26905d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 26915d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 26925d4f98a2SYan Zheng break; 26935d4f98a2SYan Zheng } 26945d4f98a2SYan Zheng 26955d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 26963fd0a558SYan, Zheng root = root->reloc_root; 26973fd0a558SYan, Zheng 26983fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 26993fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 27003fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 27013fd0a558SYan, Zheng next->new_bytenr = root->node->start; 270200246528SJosef Bacik btrfs_put_root(next->root); 270300246528SJosef Bacik next->root = btrfs_grab_root(root); 27040b530bc5SJosef Bacik ASSERT(next->root); 27053fd0a558SYan, Zheng list_add_tail(&next->list, 27063fd0a558SYan, Zheng &rc->backref_cache.changed); 27079569cc20SQu Wenruo mark_block_processed(rc, next); 27085d4f98a2SYan Zheng break; 27095d4f98a2SYan Zheng } 27105d4f98a2SYan Zheng 27113fd0a558SYan, Zheng WARN_ON(1); 27125d4f98a2SYan Zheng root = NULL; 27135d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 27145d4f98a2SYan Zheng if (!next || next->level <= node->level) 27155d4f98a2SYan Zheng break; 27165d4f98a2SYan Zheng } 27173fd0a558SYan, Zheng if (!root) 27183fd0a558SYan, Zheng return NULL; 27195d4f98a2SYan Zheng 27203fd0a558SYan, Zheng next = node; 27213fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 27223fd0a558SYan, Zheng while (1) { 27233fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 27243fd0a558SYan, Zheng if (--index < 0) 27253fd0a558SYan, Zheng break; 27263fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 27273fd0a558SYan, Zheng } 27285d4f98a2SYan Zheng return root; 27295d4f98a2SYan Zheng } 27305d4f98a2SYan Zheng 27313fd0a558SYan, Zheng /* 27323fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 27333fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 27343fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 27353fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 27363fd0a558SYan, Zheng */ 27375d4f98a2SYan Zheng static noinline_for_stack 2738147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 27395d4f98a2SYan Zheng { 27403fd0a558SYan, Zheng struct backref_node *next; 27413fd0a558SYan, Zheng struct btrfs_root *root; 27423fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 27435d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 27443fd0a558SYan, Zheng int index = 0; 27453fd0a558SYan, Zheng 27463fd0a558SYan, Zheng next = node; 27473fd0a558SYan, Zheng while (1) { 27483fd0a558SYan, Zheng cond_resched(); 27493fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 27503fd0a558SYan, Zheng root = next->root; 27513fd0a558SYan, Zheng BUG_ON(!root); 27523fd0a558SYan, Zheng 275325985edcSLucas De Marchi /* no other choice for non-references counted tree */ 275427cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 27553fd0a558SYan, Zheng return root; 27563fd0a558SYan, Zheng 27573fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 27583fd0a558SYan, Zheng fs_root = root; 27593fd0a558SYan, Zheng 27603fd0a558SYan, Zheng if (next != node) 27613fd0a558SYan, Zheng return NULL; 27623fd0a558SYan, Zheng 27633fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 27643fd0a558SYan, Zheng if (!next || next->level <= node->level) 27653fd0a558SYan, Zheng break; 27663fd0a558SYan, Zheng } 27673fd0a558SYan, Zheng 27683fd0a558SYan, Zheng if (!fs_root) 27693fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 27703fd0a558SYan, Zheng return fs_root; 27715d4f98a2SYan Zheng } 27725d4f98a2SYan Zheng 27735d4f98a2SYan Zheng static noinline_for_stack 27743fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 27753fd0a558SYan, Zheng struct backref_node *node, int reserve) 27765d4f98a2SYan Zheng { 27770b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 27783fd0a558SYan, Zheng struct backref_node *next = node; 27793fd0a558SYan, Zheng struct backref_edge *edge; 27803fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 27813fd0a558SYan, Zheng u64 num_bytes = 0; 27823fd0a558SYan, Zheng int index = 0; 27835d4f98a2SYan Zheng 27843fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 27853fd0a558SYan, Zheng 27863fd0a558SYan, Zheng while (next) { 27873fd0a558SYan, Zheng cond_resched(); 27885d4f98a2SYan Zheng while (1) { 27893fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 27905d4f98a2SYan Zheng break; 27915d4f98a2SYan Zheng 27920b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 27933fd0a558SYan, Zheng 27943fd0a558SYan, Zheng if (list_empty(&next->upper)) 27953fd0a558SYan, Zheng break; 27963fd0a558SYan, Zheng 27973fd0a558SYan, Zheng edge = list_entry(next->upper.next, 27983fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 27993fd0a558SYan, Zheng edges[index++] = edge; 28003fd0a558SYan, Zheng next = edge->node[UPPER]; 28015d4f98a2SYan Zheng } 28023fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 28033fd0a558SYan, Zheng } 28043fd0a558SYan, Zheng return num_bytes; 28053fd0a558SYan, Zheng } 28063fd0a558SYan, Zheng 28073fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 28083fd0a558SYan, Zheng struct reloc_control *rc, 28093fd0a558SYan, Zheng struct backref_node *node) 28103fd0a558SYan, Zheng { 28113fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2812da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 28133fd0a558SYan, Zheng u64 num_bytes; 28143fd0a558SYan, Zheng int ret; 28150647bf56SWang Shilong u64 tmp; 28163fd0a558SYan, Zheng 28173fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 28183fd0a558SYan, Zheng 28193fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 28200647bf56SWang Shilong rc->reserved_bytes += num_bytes; 28218ca17f0fSJosef Bacik 28228ca17f0fSJosef Bacik /* 28238ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 28248ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 28258ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 28268ca17f0fSJosef Bacik */ 28270647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 28288ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 28293fd0a558SYan, Zheng if (ret) { 2830da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 28310647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 28320647bf56SWang Shilong tmp <<= 1; 28330647bf56SWang Shilong /* 28340647bf56SWang Shilong * only one thread can access block_rsv at this point, 28350647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 28360647bf56SWang Shilong * we expand more reservation size here to allow enough 283752042d8eSAndrea Gelmini * space for relocation and we will return earlier in 28380647bf56SWang Shilong * enospc case. 28390647bf56SWang Shilong */ 2840da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 28410647bf56SWang Shilong RELOCATION_RESERVED_NODES; 28428ca17f0fSJosef Bacik return -EAGAIN; 28433fd0a558SYan, Zheng } 28443fd0a558SYan, Zheng 28453fd0a558SYan, Zheng return 0; 28463fd0a558SYan, Zheng } 28473fd0a558SYan, Zheng 28485d4f98a2SYan Zheng /* 28495d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 28505d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 28515d4f98a2SYan Zheng * 28525d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 28535d4f98a2SYan Zheng * in that case this function just updates pointers. 28545d4f98a2SYan Zheng */ 28555d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 28563fd0a558SYan, Zheng struct reloc_control *rc, 28575d4f98a2SYan Zheng struct backref_node *node, 28585d4f98a2SYan Zheng struct btrfs_key *key, 28595d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 28605d4f98a2SYan Zheng { 28612ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 28625d4f98a2SYan Zheng struct backref_node *upper; 28635d4f98a2SYan Zheng struct backref_edge *edge; 28645d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28655d4f98a2SYan Zheng struct btrfs_root *root; 28665d4f98a2SYan Zheng struct extent_buffer *eb; 28675d4f98a2SYan Zheng u32 blocksize; 28685d4f98a2SYan Zheng u64 bytenr; 28695d4f98a2SYan Zheng u64 generation; 28705d4f98a2SYan Zheng int slot; 28715d4f98a2SYan Zheng int ret; 28725d4f98a2SYan Zheng int err = 0; 28735d4f98a2SYan Zheng 28745d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 28755d4f98a2SYan Zheng 28765d4f98a2SYan Zheng path->lowest_level = node->level + 1; 28773fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 28785d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 2879581c1760SQu Wenruo struct btrfs_key first_key; 288082fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 2881581c1760SQu Wenruo 28825d4f98a2SYan Zheng cond_resched(); 28835d4f98a2SYan Zheng 28845d4f98a2SYan Zheng upper = edge->node[UPPER]; 2885dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 28863fd0a558SYan, Zheng BUG_ON(!root); 28875d4f98a2SYan Zheng 28883fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 28893fd0a558SYan, Zheng if (!lowest) { 28903fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 28913fd0a558SYan, Zheng upper->level, &slot); 2892cbca7d59SFilipe Manana if (ret < 0) { 2893cbca7d59SFilipe Manana err = ret; 2894cbca7d59SFilipe Manana goto next; 2895cbca7d59SFilipe Manana } 28963fd0a558SYan, Zheng BUG_ON(ret); 28973fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 28983fd0a558SYan, Zheng if (node->eb->start == bytenr) 28993fd0a558SYan, Zheng goto next; 29003fd0a558SYan, Zheng } 29015d4f98a2SYan Zheng drop_node_buffer(upper); 29023fd0a558SYan, Zheng } 29035d4f98a2SYan Zheng 29045d4f98a2SYan Zheng if (!upper->eb) { 29055d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 29063561b9dbSLiu Bo if (ret) { 29073561b9dbSLiu Bo if (ret < 0) 29085d4f98a2SYan Zheng err = ret; 29093561b9dbSLiu Bo else 29103561b9dbSLiu Bo err = -ENOENT; 29113561b9dbSLiu Bo 29123561b9dbSLiu Bo btrfs_release_path(path); 29135d4f98a2SYan Zheng break; 29145d4f98a2SYan Zheng } 29155d4f98a2SYan Zheng 29163fd0a558SYan, Zheng if (!upper->eb) { 29173fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 29183fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 29193fd0a558SYan, Zheng } else { 29203fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 29213fd0a558SYan, Zheng } 29223fd0a558SYan, Zheng 29233fd0a558SYan, Zheng upper->locked = 1; 29243fd0a558SYan, Zheng path->locks[upper->level] = 0; 29253fd0a558SYan, Zheng 29265d4f98a2SYan Zheng slot = path->slots[upper->level]; 2927b3b4aa74SDavid Sterba btrfs_release_path(path); 29285d4f98a2SYan Zheng } else { 29295d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 29305d4f98a2SYan Zheng &slot); 2931cbca7d59SFilipe Manana if (ret < 0) { 2932cbca7d59SFilipe Manana err = ret; 2933cbca7d59SFilipe Manana goto next; 2934cbca7d59SFilipe Manana } 29355d4f98a2SYan Zheng BUG_ON(ret); 29365d4f98a2SYan Zheng } 29375d4f98a2SYan Zheng 29385d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 29393fd0a558SYan, Zheng if (lowest) { 29404547f4d8SLiu Bo if (bytenr != node->bytenr) { 29414547f4d8SLiu Bo btrfs_err(root->fs_info, 29424547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 29434547f4d8SLiu Bo bytenr, node->bytenr, slot, 29444547f4d8SLiu Bo upper->eb->start); 29454547f4d8SLiu Bo err = -EIO; 29464547f4d8SLiu Bo goto next; 29474547f4d8SLiu Bo } 29485d4f98a2SYan Zheng } else { 29493fd0a558SYan, Zheng if (node->eb->start == bytenr) 29503fd0a558SYan, Zheng goto next; 29515d4f98a2SYan Zheng } 29525d4f98a2SYan Zheng 2953da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 29545d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 2955581c1760SQu Wenruo btrfs_node_key_to_cpu(upper->eb, &first_key, slot); 2956581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, generation, 2957581c1760SQu Wenruo upper->level - 1, &first_key); 295864c043deSLiu Bo if (IS_ERR(eb)) { 295964c043deSLiu Bo err = PTR_ERR(eb); 296064c043deSLiu Bo goto next; 296164c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2962416bc658SJosef Bacik free_extent_buffer(eb); 296397d9a8a4STsutomu Itoh err = -EIO; 296497d9a8a4STsutomu Itoh goto next; 296597d9a8a4STsutomu Itoh } 29665d4f98a2SYan Zheng btrfs_tree_lock(eb); 29678bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 29685d4f98a2SYan Zheng 29695d4f98a2SYan Zheng if (!node->eb) { 29705d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 29715d4f98a2SYan Zheng slot, &eb); 29723fd0a558SYan, Zheng btrfs_tree_unlock(eb); 29733fd0a558SYan, Zheng free_extent_buffer(eb); 29745d4f98a2SYan Zheng if (ret < 0) { 29755d4f98a2SYan Zheng err = ret; 29763fd0a558SYan, Zheng goto next; 29775d4f98a2SYan Zheng } 29783fd0a558SYan, Zheng BUG_ON(node->eb != eb); 29795d4f98a2SYan Zheng } else { 29805d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 29815d4f98a2SYan Zheng node->eb->start); 29825d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 29835d4f98a2SYan Zheng trans->transid); 29845d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 29855d4f98a2SYan Zheng 298682fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, 29875d4f98a2SYan Zheng node->eb->start, blocksize, 298882fa113fSQu Wenruo upper->eb->start); 298982fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 299082fa113fSQu Wenruo btrfs_init_tree_ref(&ref, node->level, 299182fa113fSQu Wenruo btrfs_header_owner(upper->eb)); 299282fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 29935d4f98a2SYan Zheng BUG_ON(ret); 29945d4f98a2SYan Zheng 29955d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 29965d4f98a2SYan Zheng BUG_ON(ret); 29975d4f98a2SYan Zheng } 29983fd0a558SYan, Zheng next: 29993fd0a558SYan, Zheng if (!upper->pending) 30003fd0a558SYan, Zheng drop_node_buffer(upper); 30013fd0a558SYan, Zheng else 30023fd0a558SYan, Zheng unlock_node_buffer(upper); 30033fd0a558SYan, Zheng if (err) 30043fd0a558SYan, Zheng break; 30055d4f98a2SYan Zheng } 30063fd0a558SYan, Zheng 30073fd0a558SYan, Zheng if (!err && node->pending) { 30083fd0a558SYan, Zheng drop_node_buffer(node); 30093fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 30103fd0a558SYan, Zheng node->pending = 0; 30115d4f98a2SYan Zheng } 30123fd0a558SYan, Zheng 30135d4f98a2SYan Zheng path->lowest_level = 0; 30143fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 30155d4f98a2SYan Zheng return err; 30165d4f98a2SYan Zheng } 30175d4f98a2SYan Zheng 30185d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 30193fd0a558SYan, Zheng struct reloc_control *rc, 30205d4f98a2SYan Zheng struct backref_node *node, 30215d4f98a2SYan Zheng struct btrfs_path *path) 30225d4f98a2SYan Zheng { 30235d4f98a2SYan Zheng struct btrfs_key key; 30245d4f98a2SYan Zheng 30255d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 30263fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 30275d4f98a2SYan Zheng } 30285d4f98a2SYan Zheng 30295d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 30303fd0a558SYan, Zheng struct reloc_control *rc, 30313fd0a558SYan, Zheng struct btrfs_path *path, int err) 30325d4f98a2SYan Zheng { 30333fd0a558SYan, Zheng LIST_HEAD(list); 30343fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 30355d4f98a2SYan Zheng struct backref_node *node; 30365d4f98a2SYan Zheng int level; 30375d4f98a2SYan Zheng int ret; 30385d4f98a2SYan Zheng 30395d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 30405d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 30415d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 30423fd0a558SYan, Zheng struct backref_node, list); 30433fd0a558SYan, Zheng list_move_tail(&node->list, &list); 30443fd0a558SYan, Zheng BUG_ON(!node->pending); 30455d4f98a2SYan Zheng 30463fd0a558SYan, Zheng if (!err) { 30473fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 30485d4f98a2SYan Zheng if (ret < 0) 30495d4f98a2SYan Zheng err = ret; 30505d4f98a2SYan Zheng } 30515d4f98a2SYan Zheng } 30523fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 30533fd0a558SYan, Zheng } 30545d4f98a2SYan Zheng return err; 30555d4f98a2SYan Zheng } 30565d4f98a2SYan Zheng 30575d4f98a2SYan Zheng /* 30585d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 30595d4f98a2SYan Zheng * as processed. 30605d4f98a2SYan Zheng */ 30615d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 30625d4f98a2SYan Zheng struct backref_node *node) 30635d4f98a2SYan Zheng { 30645d4f98a2SYan Zheng struct backref_node *next = node; 30655d4f98a2SYan Zheng struct backref_edge *edge; 30665d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 30675d4f98a2SYan Zheng int index = 0; 30685d4f98a2SYan Zheng 30695d4f98a2SYan Zheng while (next) { 30705d4f98a2SYan Zheng cond_resched(); 30715d4f98a2SYan Zheng while (1) { 30725d4f98a2SYan Zheng if (next->processed) 30735d4f98a2SYan Zheng break; 30745d4f98a2SYan Zheng 30759569cc20SQu Wenruo mark_block_processed(rc, next); 30765d4f98a2SYan Zheng 30775d4f98a2SYan Zheng if (list_empty(&next->upper)) 30785d4f98a2SYan Zheng break; 30795d4f98a2SYan Zheng 30805d4f98a2SYan Zheng edge = list_entry(next->upper.next, 30815d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 30825d4f98a2SYan Zheng edges[index++] = edge; 30835d4f98a2SYan Zheng next = edge->node[UPPER]; 30845d4f98a2SYan Zheng } 30855d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 30865d4f98a2SYan Zheng } 30875d4f98a2SYan Zheng } 30885d4f98a2SYan Zheng 30897476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 30905d4f98a2SYan Zheng { 3091da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 30927476dfdaSDavid Sterba 30935d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 30949655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 30955d4f98a2SYan Zheng return 1; 30965d4f98a2SYan Zheng return 0; 30975d4f98a2SYan Zheng } 30985d4f98a2SYan Zheng 30992ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 31005d4f98a2SYan Zheng struct tree_block *block) 31015d4f98a2SYan Zheng { 31025d4f98a2SYan Zheng struct extent_buffer *eb; 31035d4f98a2SYan Zheng 3104581c1760SQu Wenruo eb = read_tree_block(fs_info, block->bytenr, block->key.offset, 3105581c1760SQu Wenruo block->level, NULL); 310664c043deSLiu Bo if (IS_ERR(eb)) { 310764c043deSLiu Bo return PTR_ERR(eb); 310864c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 3109416bc658SJosef Bacik free_extent_buffer(eb); 3110416bc658SJosef Bacik return -EIO; 3111416bc658SJosef Bacik } 31125d4f98a2SYan Zheng if (block->level == 0) 31135d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 31145d4f98a2SYan Zheng else 31155d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 31165d4f98a2SYan Zheng free_extent_buffer(eb); 31175d4f98a2SYan Zheng block->key_ready = 1; 31185d4f98a2SYan Zheng return 0; 31195d4f98a2SYan Zheng } 31205d4f98a2SYan Zheng 31215d4f98a2SYan Zheng /* 31225d4f98a2SYan Zheng * helper function to relocate a tree block 31235d4f98a2SYan Zheng */ 31245d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 31255d4f98a2SYan Zheng struct reloc_control *rc, 31265d4f98a2SYan Zheng struct backref_node *node, 31275d4f98a2SYan Zheng struct btrfs_key *key, 31285d4f98a2SYan Zheng struct btrfs_path *path) 31295d4f98a2SYan Zheng { 31305d4f98a2SYan Zheng struct btrfs_root *root; 31313fd0a558SYan, Zheng int ret = 0; 31325d4f98a2SYan Zheng 31333fd0a558SYan, Zheng if (!node) 31345d4f98a2SYan Zheng return 0; 31353fd0a558SYan, Zheng 31365f6b2e5cSJosef Bacik /* 31375f6b2e5cSJosef Bacik * If we fail here we want to drop our backref_node because we are going 31385f6b2e5cSJosef Bacik * to start over and regenerate the tree for it. 31395f6b2e5cSJosef Bacik */ 31405f6b2e5cSJosef Bacik ret = reserve_metadata_space(trans, rc, node); 31415f6b2e5cSJosef Bacik if (ret) 31425f6b2e5cSJosef Bacik goto out; 31435f6b2e5cSJosef Bacik 31443fd0a558SYan, Zheng BUG_ON(node->processed); 3145147d256eSZhaolei root = select_one_root(node); 31463fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 31473fd0a558SYan, Zheng update_processed_blocks(rc, node); 31483fd0a558SYan, Zheng goto out; 31495d4f98a2SYan Zheng } 31505d4f98a2SYan Zheng 31513fd0a558SYan, Zheng if (root) { 315227cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 31533fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 31543fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 31553fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 31563fd0a558SYan, Zheng root = root->reloc_root; 31573fd0a558SYan, Zheng node->new_bytenr = root->node->start; 315800246528SJosef Bacik btrfs_put_root(node->root); 315900246528SJosef Bacik node->root = btrfs_grab_root(root); 31600b530bc5SJosef Bacik ASSERT(node->root); 31613fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 31623fd0a558SYan, Zheng } else { 31635d4f98a2SYan Zheng path->lowest_level = node->level; 31645d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 3165b3b4aa74SDavid Sterba btrfs_release_path(path); 31663fd0a558SYan, Zheng if (ret > 0) 31675d4f98a2SYan Zheng ret = 0; 31683fd0a558SYan, Zheng } 31693fd0a558SYan, Zheng if (!ret) 31703fd0a558SYan, Zheng update_processed_blocks(rc, node); 31713fd0a558SYan, Zheng } else { 31723fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 31733fd0a558SYan, Zheng } 31745d4f98a2SYan Zheng out: 31750647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 31763fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 31775d4f98a2SYan Zheng return ret; 31785d4f98a2SYan Zheng } 31795d4f98a2SYan Zheng 31805d4f98a2SYan Zheng /* 31815d4f98a2SYan Zheng * relocate a list of blocks 31825d4f98a2SYan Zheng */ 31835d4f98a2SYan Zheng static noinline_for_stack 31845d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 31855d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 31865d4f98a2SYan Zheng { 31872ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 31885d4f98a2SYan Zheng struct backref_node *node; 31895d4f98a2SYan Zheng struct btrfs_path *path; 31905d4f98a2SYan Zheng struct tree_block *block; 319198ff7b94SQu Wenruo struct tree_block *next; 31925d4f98a2SYan Zheng int ret; 31935d4f98a2SYan Zheng int err = 0; 31945d4f98a2SYan Zheng 31955d4f98a2SYan Zheng path = btrfs_alloc_path(); 3196e1a12670SLiu Bo if (!path) { 3197e1a12670SLiu Bo err = -ENOMEM; 319834c2b290SDavid Sterba goto out_free_blocks; 3199e1a12670SLiu Bo } 32005d4f98a2SYan Zheng 320198ff7b94SQu Wenruo /* Kick in readahead for tree blocks with missing keys */ 320298ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 32035d4f98a2SYan Zheng if (!block->key_ready) 32042ff7e61eSJeff Mahoney readahead_tree_block(fs_info, block->bytenr); 32055d4f98a2SYan Zheng } 32065d4f98a2SYan Zheng 320798ff7b94SQu Wenruo /* Get first keys */ 320898ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 320934c2b290SDavid Sterba if (!block->key_ready) { 32102ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 321134c2b290SDavid Sterba if (err) 321234c2b290SDavid Sterba goto out_free_path; 321334c2b290SDavid Sterba } 32145d4f98a2SYan Zheng } 32155d4f98a2SYan Zheng 321698ff7b94SQu Wenruo /* Do tree relocation */ 321798ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 32183fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 32195d4f98a2SYan Zheng block->level, block->bytenr); 32205d4f98a2SYan Zheng if (IS_ERR(node)) { 32215d4f98a2SYan Zheng err = PTR_ERR(node); 32225d4f98a2SYan Zheng goto out; 32235d4f98a2SYan Zheng } 32245d4f98a2SYan Zheng 32255d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 32265d4f98a2SYan Zheng path); 32275d4f98a2SYan Zheng if (ret < 0) { 32285d4f98a2SYan Zheng err = ret; 322950dbbb71SJosef Bacik break; 32305d4f98a2SYan Zheng } 32315d4f98a2SYan Zheng } 32325d4f98a2SYan Zheng out: 32333fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 32345d4f98a2SYan Zheng 323534c2b290SDavid Sterba out_free_path: 32365d4f98a2SYan Zheng btrfs_free_path(path); 323734c2b290SDavid Sterba out_free_blocks: 3238e1a12670SLiu Bo free_block_list(blocks); 32395d4f98a2SYan Zheng return err; 32405d4f98a2SYan Zheng } 32415d4f98a2SYan Zheng 32425d4f98a2SYan Zheng static noinline_for_stack 3243efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3244efa56464SYan, Zheng struct file_extent_cluster *cluster) 3245efa56464SYan, Zheng { 3246efa56464SYan, Zheng u64 alloc_hint = 0; 3247efa56464SYan, Zheng u64 start; 3248efa56464SYan, Zheng u64 end; 3249efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3250efa56464SYan, Zheng u64 num_bytes; 3251efa56464SYan, Zheng int nr = 0; 3252efa56464SYan, Zheng int ret = 0; 3253dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 3254dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 325518513091SWang Xiaoguang u64 cur_offset; 3256364ecf36SQu Wenruo struct extent_changeset *data_reserved = NULL; 3257efa56464SYan, Zheng 3258efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 32595955102cSAl Viro inode_lock(inode); 3260efa56464SYan, Zheng 3261364ecf36SQu Wenruo ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start, 3262dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 3263efa56464SYan, Zheng if (ret) 3264efa56464SYan, Zheng goto out; 3265efa56464SYan, Zheng 326618513091SWang Xiaoguang cur_offset = prealloc_start; 3267efa56464SYan, Zheng while (nr < cluster->nr) { 3268efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3269efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3270efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3271efa56464SYan, Zheng else 3272efa56464SYan, Zheng end = cluster->end - offset; 3273efa56464SYan, Zheng 3274d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3275efa56464SYan, Zheng num_bytes = end + 1 - start; 327618513091SWang Xiaoguang if (cur_offset < start) 3277bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3278bc42bda2SQu Wenruo cur_offset, start - cur_offset); 3279efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3280efa56464SYan, Zheng num_bytes, num_bytes, 3281efa56464SYan, Zheng end + 1, &alloc_hint); 328218513091SWang Xiaoguang cur_offset = end + 1; 3283d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3284efa56464SYan, Zheng if (ret) 3285efa56464SYan, Zheng break; 3286efa56464SYan, Zheng nr++; 3287efa56464SYan, Zheng } 328818513091SWang Xiaoguang if (cur_offset < prealloc_end) 3289bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3290bc42bda2SQu Wenruo cur_offset, prealloc_end + 1 - cur_offset); 3291efa56464SYan, Zheng out: 32925955102cSAl Viro inode_unlock(inode); 3293364ecf36SQu Wenruo extent_changeset_free(data_reserved); 3294efa56464SYan, Zheng return ret; 3295efa56464SYan, Zheng } 3296efa56464SYan, Zheng 3297efa56464SYan, Zheng static noinline_for_stack 32980257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 32990257bb82SYan, Zheng u64 block_start) 33005d4f98a2SYan Zheng { 33015d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 33025d4f98a2SYan Zheng struct extent_map *em; 33030257bb82SYan, Zheng int ret = 0; 33045d4f98a2SYan Zheng 3305172ddd60SDavid Sterba em = alloc_extent_map(); 33060257bb82SYan, Zheng if (!em) 33070257bb82SYan, Zheng return -ENOMEM; 33080257bb82SYan, Zheng 33095d4f98a2SYan Zheng em->start = start; 33100257bb82SYan, Zheng em->len = end + 1 - start; 33110257bb82SYan, Zheng em->block_len = em->len; 33120257bb82SYan, Zheng em->block_start = block_start; 33135d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 33145d4f98a2SYan Zheng 3315d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 33165d4f98a2SYan Zheng while (1) { 3317890871beSChris Mason write_lock(&em_tree->lock); 331809a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3319890871beSChris Mason write_unlock(&em_tree->lock); 33205d4f98a2SYan Zheng if (ret != -EEXIST) { 33215d4f98a2SYan Zheng free_extent_map(em); 33225d4f98a2SYan Zheng break; 33235d4f98a2SYan Zheng } 3324dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 33255d4f98a2SYan Zheng } 3326d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 33270257bb82SYan, Zheng return ret; 33280257bb82SYan, Zheng } 33295d4f98a2SYan Zheng 3330726a3421SQu Wenruo /* 3331726a3421SQu Wenruo * Allow error injection to test balance cancellation 3332726a3421SQu Wenruo */ 3333726a3421SQu Wenruo int btrfs_should_cancel_balance(struct btrfs_fs_info *fs_info) 3334726a3421SQu Wenruo { 3335726a3421SQu Wenruo return atomic_read(&fs_info->balance_cancel_req); 3336726a3421SQu Wenruo } 3337726a3421SQu Wenruo ALLOW_ERROR_INJECTION(btrfs_should_cancel_balance, TRUE); 3338726a3421SQu Wenruo 33390257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 33400257bb82SYan, Zheng struct file_extent_cluster *cluster) 33410257bb82SYan, Zheng { 33422ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 33430257bb82SYan, Zheng u64 page_start; 33440257bb82SYan, Zheng u64 page_end; 33450257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 33460257bb82SYan, Zheng unsigned long index; 33470257bb82SYan, Zheng unsigned long last_index; 33480257bb82SYan, Zheng struct page *page; 33490257bb82SYan, Zheng struct file_ra_state *ra; 33503b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 33510257bb82SYan, Zheng int nr = 0; 33520257bb82SYan, Zheng int ret = 0; 33530257bb82SYan, Zheng 33540257bb82SYan, Zheng if (!cluster->nr) 33550257bb82SYan, Zheng return 0; 33560257bb82SYan, Zheng 33570257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 33580257bb82SYan, Zheng if (!ra) 33590257bb82SYan, Zheng return -ENOMEM; 33600257bb82SYan, Zheng 3361efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 33620257bb82SYan, Zheng if (ret) 3363efa56464SYan, Zheng goto out; 33640257bb82SYan, Zheng 33650257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 33660257bb82SYan, Zheng 3367efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3368efa56464SYan, Zheng cluster->end - offset, cluster->start); 3369efa56464SYan, Zheng if (ret) 3370efa56464SYan, Zheng goto out; 3371efa56464SYan, Zheng 337209cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 337309cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 33740257bb82SYan, Zheng while (index <= last_index) { 33759f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 33769f3db423SNikolay Borisov PAGE_SIZE); 3377efa56464SYan, Zheng if (ret) 3378efa56464SYan, Zheng goto out; 3379efa56464SYan, Zheng 33800257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 33810257bb82SYan, Zheng if (!page) { 33820257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 33830257bb82SYan, Zheng ra, NULL, index, 33840257bb82SYan, Zheng last_index + 1 - index); 3385a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 33863b16a4e3SJosef Bacik mask); 33870257bb82SYan, Zheng if (!page) { 3388691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 338943b18595SQu Wenruo PAGE_SIZE, true); 339044db1216SFilipe Manana btrfs_delalloc_release_extents(BTRFS_I(inode), 33918702ba93SQu Wenruo PAGE_SIZE); 33920257bb82SYan, Zheng ret = -ENOMEM; 3393efa56464SYan, Zheng goto out; 33940257bb82SYan, Zheng } 33950257bb82SYan, Zheng } 33960257bb82SYan, Zheng 33970257bb82SYan, Zheng if (PageReadahead(page)) { 33980257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 33990257bb82SYan, Zheng ra, NULL, page, index, 34000257bb82SYan, Zheng last_index + 1 - index); 34010257bb82SYan, Zheng } 34020257bb82SYan, Zheng 34030257bb82SYan, Zheng if (!PageUptodate(page)) { 34040257bb82SYan, Zheng btrfs_readpage(NULL, page); 34050257bb82SYan, Zheng lock_page(page); 34060257bb82SYan, Zheng if (!PageUptodate(page)) { 34070257bb82SYan, Zheng unlock_page(page); 340809cbfeafSKirill A. Shutemov put_page(page); 3409691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 341043b18595SQu Wenruo PAGE_SIZE, true); 34118b62f87bSJosef Bacik btrfs_delalloc_release_extents(BTRFS_I(inode), 34128702ba93SQu Wenruo PAGE_SIZE); 34130257bb82SYan, Zheng ret = -EIO; 3414efa56464SYan, Zheng goto out; 34150257bb82SYan, Zheng } 34160257bb82SYan, Zheng } 34170257bb82SYan, Zheng 34184eee4fa4SMiao Xie page_start = page_offset(page); 341909cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 34200257bb82SYan, Zheng 3421d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 34220257bb82SYan, Zheng 34230257bb82SYan, Zheng set_page_extent_mapped(page); 34240257bb82SYan, Zheng 34250257bb82SYan, Zheng if (nr < cluster->nr && 34260257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 34270257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 34280257bb82SYan, Zheng page_start, page_end, 3429ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 34300257bb82SYan, Zheng nr++; 34310257bb82SYan, Zheng } 34320257bb82SYan, Zheng 3433765f3cebSNikolay Borisov ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0, 3434330a5827SNikolay Borisov NULL); 3435765f3cebSNikolay Borisov if (ret) { 3436765f3cebSNikolay Borisov unlock_page(page); 3437765f3cebSNikolay Borisov put_page(page); 3438765f3cebSNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 343943b18595SQu Wenruo PAGE_SIZE, true); 3440765f3cebSNikolay Borisov btrfs_delalloc_release_extents(BTRFS_I(inode), 34418702ba93SQu Wenruo PAGE_SIZE); 3442765f3cebSNikolay Borisov 3443765f3cebSNikolay Borisov clear_extent_bits(&BTRFS_I(inode)->io_tree, 3444765f3cebSNikolay Borisov page_start, page_end, 3445765f3cebSNikolay Borisov EXTENT_LOCKED | EXTENT_BOUNDARY); 3446765f3cebSNikolay Borisov goto out; 3447765f3cebSNikolay Borisov 3448765f3cebSNikolay Borisov } 34490257bb82SYan, Zheng set_page_dirty(page); 34500257bb82SYan, Zheng 34510257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3452d0082371SJeff Mahoney page_start, page_end); 34530257bb82SYan, Zheng unlock_page(page); 345409cbfeafSKirill A. Shutemov put_page(page); 34550257bb82SYan, Zheng 34560257bb82SYan, Zheng index++; 34578702ba93SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); 3458efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 34592ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 34607f913c7cSQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 34617f913c7cSQu Wenruo ret = -ECANCELED; 34627f913c7cSQu Wenruo goto out; 34637f913c7cSQu Wenruo } 34640257bb82SYan, Zheng } 34650257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3466efa56464SYan, Zheng out: 34670257bb82SYan, Zheng kfree(ra); 34680257bb82SYan, Zheng return ret; 34690257bb82SYan, Zheng } 34700257bb82SYan, Zheng 34710257bb82SYan, Zheng static noinline_for_stack 34720257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 34730257bb82SYan, Zheng struct file_extent_cluster *cluster) 34740257bb82SYan, Zheng { 34750257bb82SYan, Zheng int ret; 34760257bb82SYan, Zheng 34770257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 34780257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 34790257bb82SYan, Zheng if (ret) 34800257bb82SYan, Zheng return ret; 34810257bb82SYan, Zheng cluster->nr = 0; 34820257bb82SYan, Zheng } 34830257bb82SYan, Zheng 34840257bb82SYan, Zheng if (!cluster->nr) 34850257bb82SYan, Zheng cluster->start = extent_key->objectid; 34860257bb82SYan, Zheng else 34870257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 34880257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 34890257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 34900257bb82SYan, Zheng cluster->nr++; 34910257bb82SYan, Zheng 34920257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 34930257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 34940257bb82SYan, Zheng if (ret) 34950257bb82SYan, Zheng return ret; 34960257bb82SYan, Zheng cluster->nr = 0; 34970257bb82SYan, Zheng } 34980257bb82SYan, Zheng return 0; 34995d4f98a2SYan Zheng } 35005d4f98a2SYan Zheng 35015d4f98a2SYan Zheng /* 35025d4f98a2SYan Zheng * helper to add a tree block to the list. 35035d4f98a2SYan Zheng * the major work is getting the generation and level of the block 35045d4f98a2SYan Zheng */ 35055d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 35065d4f98a2SYan Zheng struct btrfs_key *extent_key, 35075d4f98a2SYan Zheng struct btrfs_path *path, 35085d4f98a2SYan Zheng struct rb_root *blocks) 35095d4f98a2SYan Zheng { 35105d4f98a2SYan Zheng struct extent_buffer *eb; 35115d4f98a2SYan Zheng struct btrfs_extent_item *ei; 35125d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 35135d4f98a2SYan Zheng struct tree_block *block; 35145d4f98a2SYan Zheng struct rb_node *rb_node; 35155d4f98a2SYan Zheng u32 item_size; 35165d4f98a2SYan Zheng int level = -1; 35177fdf4b60SWang Shilong u64 generation; 35185d4f98a2SYan Zheng 35195d4f98a2SYan Zheng eb = path->nodes[0]; 35205d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 35215d4f98a2SYan Zheng 35223173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 35233173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 35245d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 35255d4f98a2SYan Zheng struct btrfs_extent_item); 35263173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 35275d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 35285d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 35295d4f98a2SYan Zheng } else { 35303173a18fSJosef Bacik level = (int)extent_key->offset; 35313173a18fSJosef Bacik } 35323173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 35336d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3534ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3535ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3536ba3c2b19SNikolay Borisov return -EINVAL; 35373173a18fSJosef Bacik } else { 35385d4f98a2SYan Zheng BUG(); 35395d4f98a2SYan Zheng } 35405d4f98a2SYan Zheng 3541b3b4aa74SDavid Sterba btrfs_release_path(path); 35425d4f98a2SYan Zheng 35435d4f98a2SYan Zheng BUG_ON(level == -1); 35445d4f98a2SYan Zheng 35455d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 35465d4f98a2SYan Zheng if (!block) 35475d4f98a2SYan Zheng return -ENOMEM; 35485d4f98a2SYan Zheng 35495d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3550da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 35515d4f98a2SYan Zheng block->key.offset = generation; 35525d4f98a2SYan Zheng block->level = level; 35535d4f98a2SYan Zheng block->key_ready = 0; 35545d4f98a2SYan Zheng 35555d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 355643c04fb1SJeff Mahoney if (rb_node) 355743c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 35585d4f98a2SYan Zheng 35595d4f98a2SYan Zheng return 0; 35605d4f98a2SYan Zheng } 35615d4f98a2SYan Zheng 35625d4f98a2SYan Zheng /* 35635d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 35645d4f98a2SYan Zheng */ 35655d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 35665d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 35675d4f98a2SYan Zheng struct rb_root *blocks) 35685d4f98a2SYan Zheng { 35690b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 35705d4f98a2SYan Zheng struct btrfs_path *path; 35715d4f98a2SYan Zheng struct btrfs_key key; 35725d4f98a2SYan Zheng int ret; 35730b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 35745d4f98a2SYan Zheng 35757476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 35765d4f98a2SYan Zheng return 0; 35775d4f98a2SYan Zheng 35785d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 35795d4f98a2SYan Zheng return 0; 35805d4f98a2SYan Zheng 35815d4f98a2SYan Zheng path = btrfs_alloc_path(); 35825d4f98a2SYan Zheng if (!path) 35835d4f98a2SYan Zheng return -ENOMEM; 3584aee68ee5SJosef Bacik again: 35855d4f98a2SYan Zheng key.objectid = bytenr; 3586aee68ee5SJosef Bacik if (skinny) { 3587aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3588aee68ee5SJosef Bacik key.offset = (u64)-1; 3589aee68ee5SJosef Bacik } else { 35905d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 35915d4f98a2SYan Zheng key.offset = blocksize; 3592aee68ee5SJosef Bacik } 35935d4f98a2SYan Zheng 35945d4f98a2SYan Zheng path->search_commit_root = 1; 35955d4f98a2SYan Zheng path->skip_locking = 1; 35965d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 35975d4f98a2SYan Zheng if (ret < 0) 35985d4f98a2SYan Zheng goto out; 35995d4f98a2SYan Zheng 3600aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3601aee68ee5SJosef Bacik if (path->slots[0]) { 3602aee68ee5SJosef Bacik path->slots[0]--; 3603aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3604aee68ee5SJosef Bacik path->slots[0]); 36053173a18fSJosef Bacik if (key.objectid == bytenr && 3606aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3607aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3608aee68ee5SJosef Bacik key.offset == blocksize))) 36093173a18fSJosef Bacik ret = 0; 36103173a18fSJosef Bacik } 3611aee68ee5SJosef Bacik 3612aee68ee5SJosef Bacik if (ret) { 3613aee68ee5SJosef Bacik skinny = false; 3614aee68ee5SJosef Bacik btrfs_release_path(path); 3615aee68ee5SJosef Bacik goto again; 3616aee68ee5SJosef Bacik } 3617aee68ee5SJosef Bacik } 3618cdccee99SLiu Bo if (ret) { 3619cdccee99SLiu Bo ASSERT(ret == 1); 3620cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3621cdccee99SLiu Bo btrfs_err(fs_info, 3622cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3623cdccee99SLiu Bo bytenr); 3624cdccee99SLiu Bo WARN_ON(1); 3625cdccee99SLiu Bo ret = -EINVAL; 3626cdccee99SLiu Bo goto out; 3627cdccee99SLiu Bo } 36283173a18fSJosef Bacik 36295d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 36305d4f98a2SYan Zheng out: 36315d4f98a2SYan Zheng btrfs_free_path(path); 36325d4f98a2SYan Zheng return ret; 36335d4f98a2SYan Zheng } 36345d4f98a2SYan Zheng 36350af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 363632da5386SDavid Sterba struct btrfs_block_group *block_group, 36371bbc621eSChris Mason struct inode *inode, 36381bbc621eSChris Mason u64 ino) 36390af3d00bSJosef Bacik { 36400af3d00bSJosef Bacik struct btrfs_key key; 36410af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 36420af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 36430af3d00bSJosef Bacik int ret = 0; 36440af3d00bSJosef Bacik 36450af3d00bSJosef Bacik if (inode) 36460af3d00bSJosef Bacik goto truncate; 36470af3d00bSJosef Bacik 36480af3d00bSJosef Bacik key.objectid = ino; 36490af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 36500af3d00bSJosef Bacik key.offset = 0; 36510af3d00bSJosef Bacik 36524c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 36532e19f1f9SAl Viro if (IS_ERR(inode)) 36540af3d00bSJosef Bacik return -ENOENT; 36550af3d00bSJosef Bacik 36560af3d00bSJosef Bacik truncate: 36572ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 36587b61cd92SMiao Xie &fs_info->global_block_rsv); 36597b61cd92SMiao Xie if (ret) 36607b61cd92SMiao Xie goto out; 36617b61cd92SMiao Xie 36627a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 36630af3d00bSJosef Bacik if (IS_ERR(trans)) { 36643612b495STsutomu Itoh ret = PTR_ERR(trans); 36650af3d00bSJosef Bacik goto out; 36660af3d00bSJosef Bacik } 36670af3d00bSJosef Bacik 366877ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 36690af3d00bSJosef Bacik 36703a45bb20SJeff Mahoney btrfs_end_transaction(trans); 36712ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 36720af3d00bSJosef Bacik out: 36730af3d00bSJosef Bacik iput(inode); 36740af3d00bSJosef Bacik return ret; 36750af3d00bSJosef Bacik } 36760af3d00bSJosef Bacik 36775d4f98a2SYan Zheng /* 367819b546d7SQu Wenruo * Locate the free space cache EXTENT_DATA in root tree leaf and delete the 367919b546d7SQu Wenruo * cache inode, to avoid free space cache data extent blocking data relocation. 36805d4f98a2SYan Zheng */ 368119b546d7SQu Wenruo static int delete_v1_space_cache(struct extent_buffer *leaf, 368219b546d7SQu Wenruo struct btrfs_block_group *block_group, 368319b546d7SQu Wenruo u64 data_bytenr) 36845d4f98a2SYan Zheng { 368519b546d7SQu Wenruo u64 space_cache_ino; 368619b546d7SQu Wenruo struct btrfs_file_extent_item *ei; 36875d4f98a2SYan Zheng struct btrfs_key key; 368819b546d7SQu Wenruo bool found = false; 368919b546d7SQu Wenruo int i; 36905d4f98a2SYan Zheng int ret; 36915d4f98a2SYan Zheng 369219b546d7SQu Wenruo if (btrfs_header_owner(leaf) != BTRFS_ROOT_TREE_OBJECTID) 369319b546d7SQu Wenruo return 0; 36945d4f98a2SYan Zheng 369519b546d7SQu Wenruo for (i = 0; i < btrfs_header_nritems(leaf); i++) { 369619b546d7SQu Wenruo btrfs_item_key_to_cpu(leaf, &key, i); 369719b546d7SQu Wenruo if (key.type != BTRFS_EXTENT_DATA_KEY) 369819b546d7SQu Wenruo continue; 369919b546d7SQu Wenruo ei = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 370019b546d7SQu Wenruo if (btrfs_file_extent_type(leaf, ei) == BTRFS_FILE_EXTENT_REG && 370119b546d7SQu Wenruo btrfs_file_extent_disk_bytenr(leaf, ei) == data_bytenr) { 370219b546d7SQu Wenruo found = true; 370319b546d7SQu Wenruo space_cache_ino = key.objectid; 370419b546d7SQu Wenruo break; 370519b546d7SQu Wenruo } 370619b546d7SQu Wenruo } 370719b546d7SQu Wenruo if (!found) 370819b546d7SQu Wenruo return -ENOENT; 370919b546d7SQu Wenruo ret = delete_block_group_cache(leaf->fs_info, block_group, NULL, 371019b546d7SQu Wenruo space_cache_ino); 37110af3d00bSJosef Bacik return ret; 37125d4f98a2SYan Zheng } 37135d4f98a2SYan Zheng 37145d4f98a2SYan Zheng /* 37152c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 37165d4f98a2SYan Zheng */ 37175d4f98a2SYan Zheng static noinline_for_stack 37185d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 37195d4f98a2SYan Zheng struct btrfs_key *extent_key, 37205d4f98a2SYan Zheng struct btrfs_path *path, 37215d4f98a2SYan Zheng struct rb_root *blocks) 37225d4f98a2SYan Zheng { 372319b546d7SQu Wenruo struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 372419b546d7SQu Wenruo struct ulist *leaves = NULL; 372519b546d7SQu Wenruo struct ulist_iterator leaf_uiter; 372619b546d7SQu Wenruo struct ulist_node *ref_node = NULL; 372719b546d7SQu Wenruo const u32 blocksize = fs_info->nodesize; 3728647f63bdSFilipe David Borba Manana int ret = 0; 37295d4f98a2SYan Zheng 3730b3b4aa74SDavid Sterba btrfs_release_path(path); 373119b546d7SQu Wenruo ret = btrfs_find_all_leafs(NULL, fs_info, extent_key->objectid, 373219b546d7SQu Wenruo 0, &leaves, NULL, true); 373319b546d7SQu Wenruo if (ret < 0) 373419b546d7SQu Wenruo return ret; 373519b546d7SQu Wenruo 373619b546d7SQu Wenruo ULIST_ITER_INIT(&leaf_uiter); 373719b546d7SQu Wenruo while ((ref_node = ulist_next(leaves, &leaf_uiter))) { 373819b546d7SQu Wenruo struct extent_buffer *eb; 373919b546d7SQu Wenruo 374019b546d7SQu Wenruo eb = read_tree_block(fs_info, ref_node->val, 0, 0, NULL); 374119b546d7SQu Wenruo if (IS_ERR(eb)) { 374219b546d7SQu Wenruo ret = PTR_ERR(eb); 374319b546d7SQu Wenruo break; 374419b546d7SQu Wenruo } 374519b546d7SQu Wenruo ret = delete_v1_space_cache(eb, rc->block_group, 374619b546d7SQu Wenruo extent_key->objectid); 374719b546d7SQu Wenruo free_extent_buffer(eb); 374819b546d7SQu Wenruo if (ret < 0) 374919b546d7SQu Wenruo break; 375019b546d7SQu Wenruo ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); 375119b546d7SQu Wenruo if (ret < 0) 375219b546d7SQu Wenruo break; 375319b546d7SQu Wenruo } 375419b546d7SQu Wenruo if (ret < 0) 37555d4f98a2SYan Zheng free_block_list(blocks); 375619b546d7SQu Wenruo ulist_free(leaves); 375719b546d7SQu Wenruo return ret; 37585d4f98a2SYan Zheng } 37595d4f98a2SYan Zheng 37605d4f98a2SYan Zheng /* 37612c016dc2SLiu Bo * helper to find next unprocessed extent 37625d4f98a2SYan Zheng */ 37635d4f98a2SYan Zheng static noinline_for_stack 3764147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 37653fd0a558SYan, Zheng struct btrfs_key *extent_key) 37665d4f98a2SYan Zheng { 37670b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 37685d4f98a2SYan Zheng struct btrfs_key key; 37695d4f98a2SYan Zheng struct extent_buffer *leaf; 37705d4f98a2SYan Zheng u64 start, end, last; 37715d4f98a2SYan Zheng int ret; 37725d4f98a2SYan Zheng 3773b3470b5dSDavid Sterba last = rc->block_group->start + rc->block_group->length; 37745d4f98a2SYan Zheng while (1) { 37755d4f98a2SYan Zheng cond_resched(); 37765d4f98a2SYan Zheng if (rc->search_start >= last) { 37775d4f98a2SYan Zheng ret = 1; 37785d4f98a2SYan Zheng break; 37795d4f98a2SYan Zheng } 37805d4f98a2SYan Zheng 37815d4f98a2SYan Zheng key.objectid = rc->search_start; 37825d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 37835d4f98a2SYan Zheng key.offset = 0; 37845d4f98a2SYan Zheng 37855d4f98a2SYan Zheng path->search_commit_root = 1; 37865d4f98a2SYan Zheng path->skip_locking = 1; 37875d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 37885d4f98a2SYan Zheng 0, 0); 37895d4f98a2SYan Zheng if (ret < 0) 37905d4f98a2SYan Zheng break; 37915d4f98a2SYan Zheng next: 37925d4f98a2SYan Zheng leaf = path->nodes[0]; 37935d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 37945d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 37955d4f98a2SYan Zheng if (ret != 0) 37965d4f98a2SYan Zheng break; 37975d4f98a2SYan Zheng leaf = path->nodes[0]; 37985d4f98a2SYan Zheng } 37995d4f98a2SYan Zheng 38005d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 38015d4f98a2SYan Zheng if (key.objectid >= last) { 38025d4f98a2SYan Zheng ret = 1; 38035d4f98a2SYan Zheng break; 38045d4f98a2SYan Zheng } 38055d4f98a2SYan Zheng 38063173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 38073173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 38083173a18fSJosef Bacik path->slots[0]++; 38093173a18fSJosef Bacik goto next; 38103173a18fSJosef Bacik } 38113173a18fSJosef Bacik 38123173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 38135d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 38145d4f98a2SYan Zheng path->slots[0]++; 38155d4f98a2SYan Zheng goto next; 38165d4f98a2SYan Zheng } 38175d4f98a2SYan Zheng 38183173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 38190b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 38203173a18fSJosef Bacik rc->search_start) { 38213173a18fSJosef Bacik path->slots[0]++; 38223173a18fSJosef Bacik goto next; 38233173a18fSJosef Bacik } 38243173a18fSJosef Bacik 38255d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 38265d4f98a2SYan Zheng key.objectid, &start, &end, 3827e6138876SJosef Bacik EXTENT_DIRTY, NULL); 38285d4f98a2SYan Zheng 38295d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3830b3b4aa74SDavid Sterba btrfs_release_path(path); 38315d4f98a2SYan Zheng rc->search_start = end + 1; 38325d4f98a2SYan Zheng } else { 38333173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 38345d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 38353173a18fSJosef Bacik else 38363173a18fSJosef Bacik rc->search_start = key.objectid + 38370b246afaSJeff Mahoney fs_info->nodesize; 38383fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 38395d4f98a2SYan Zheng return 0; 38405d4f98a2SYan Zheng } 38415d4f98a2SYan Zheng } 3842b3b4aa74SDavid Sterba btrfs_release_path(path); 38435d4f98a2SYan Zheng return ret; 38445d4f98a2SYan Zheng } 38455d4f98a2SYan Zheng 38465d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 38475d4f98a2SYan Zheng { 38485d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38497585717fSChris Mason 38507585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 38515d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 38527585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 38535d4f98a2SYan Zheng } 38545d4f98a2SYan Zheng 38555d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 38565d4f98a2SYan Zheng { 38575d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38587585717fSChris Mason 38597585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 38605d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 38617585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 38625d4f98a2SYan Zheng } 38635d4f98a2SYan Zheng 38645d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 38655d4f98a2SYan Zheng { 38665d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 38675d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 38685d4f98a2SYan Zheng return 1; 38695d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 38705d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 38715d4f98a2SYan Zheng return 1; 38725d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 38735d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 38745d4f98a2SYan Zheng return 1; 38755d4f98a2SYan Zheng return 0; 38765d4f98a2SYan Zheng } 38775d4f98a2SYan Zheng 38783fd0a558SYan, Zheng static noinline_for_stack 38793fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 38803fd0a558SYan, Zheng { 38813fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3882ac2fabacSJosef Bacik int ret; 38833fd0a558SYan, Zheng 38842ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 388566d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 38863fd0a558SYan, Zheng if (!rc->block_rsv) 38873fd0a558SYan, Zheng return -ENOMEM; 38883fd0a558SYan, Zheng 38893fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 3890b3470b5dSDavid Sterba rc->search_start = rc->block_group->start; 38913fd0a558SYan, Zheng rc->extents_found = 0; 38923fd0a558SYan, Zheng rc->nodes_relocated = 0; 38933fd0a558SYan, Zheng rc->merging_rsv_size = 0; 38940647bf56SWang Shilong rc->reserved_bytes = 0; 3895da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 38960647bf56SWang Shilong RELOCATION_RESERVED_NODES; 3897ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 3898ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3899ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3900ac2fabacSJosef Bacik if (ret) 3901ac2fabacSJosef Bacik return ret; 39023fd0a558SYan, Zheng 39033fd0a558SYan, Zheng rc->create_reloc_tree = 1; 39043fd0a558SYan, Zheng set_reloc_control(rc); 39053fd0a558SYan, Zheng 39067a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 390728818947SLiu Bo if (IS_ERR(trans)) { 390828818947SLiu Bo unset_reloc_control(rc); 390928818947SLiu Bo /* 391028818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 391128818947SLiu Bo * cleanup. And callers are responsible to free the above 391228818947SLiu Bo * block rsv. 391328818947SLiu Bo */ 391428818947SLiu Bo return PTR_ERR(trans); 391528818947SLiu Bo } 39163a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 39173fd0a558SYan, Zheng return 0; 39183fd0a558SYan, Zheng } 391976dda93cSYan, Zheng 39205d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 39215d4f98a2SYan Zheng { 39222ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39235d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 39245d4f98a2SYan Zheng struct btrfs_key key; 39255d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 39265d4f98a2SYan Zheng struct btrfs_path *path; 39275d4f98a2SYan Zheng struct btrfs_extent_item *ei; 39285d4f98a2SYan Zheng u64 flags; 39295d4f98a2SYan Zheng u32 item_size; 39305d4f98a2SYan Zheng int ret; 39315d4f98a2SYan Zheng int err = 0; 3932c87f08caSChris Mason int progress = 0; 39335d4f98a2SYan Zheng 39345d4f98a2SYan Zheng path = btrfs_alloc_path(); 39353fd0a558SYan, Zheng if (!path) 39365d4f98a2SYan Zheng return -ENOMEM; 3937e4058b54SDavid Sterba path->reada = READA_FORWARD; 39383fd0a558SYan, Zheng 39393fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 39403fd0a558SYan, Zheng if (ret) { 39413fd0a558SYan, Zheng err = ret; 39423fd0a558SYan, Zheng goto out_free; 39432423fdfbSJiri Slaby } 39445d4f98a2SYan Zheng 39455d4f98a2SYan Zheng while (1) { 39460647bf56SWang Shilong rc->reserved_bytes = 0; 39470647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 39480647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 39490647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 39500647bf56SWang Shilong if (ret) { 39510647bf56SWang Shilong err = ret; 39520647bf56SWang Shilong break; 39530647bf56SWang Shilong } 3954c87f08caSChris Mason progress++; 3955a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 39560f788c58SLiu Bo if (IS_ERR(trans)) { 39570f788c58SLiu Bo err = PTR_ERR(trans); 39580f788c58SLiu Bo trans = NULL; 39590f788c58SLiu Bo break; 39600f788c58SLiu Bo } 3961c87f08caSChris Mason restart: 39623fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 39633a45bb20SJeff Mahoney btrfs_end_transaction(trans); 396442a657f5SPan Bian trans = NULL; 39653fd0a558SYan, Zheng continue; 39663fd0a558SYan, Zheng } 39673fd0a558SYan, Zheng 3968147d256eSZhaolei ret = find_next_extent(rc, path, &key); 39695d4f98a2SYan Zheng if (ret < 0) 39705d4f98a2SYan Zheng err = ret; 39715d4f98a2SYan Zheng if (ret != 0) 39725d4f98a2SYan Zheng break; 39735d4f98a2SYan Zheng 39745d4f98a2SYan Zheng rc->extents_found++; 39755d4f98a2SYan Zheng 39765d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 39775d4f98a2SYan Zheng struct btrfs_extent_item); 39783fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 39795d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 39805d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 39815d4f98a2SYan Zheng ret = check_extent_flags(flags); 39825d4f98a2SYan Zheng BUG_ON(ret); 39836d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3984ba3c2b19SNikolay Borisov err = -EINVAL; 3985ba3c2b19SNikolay Borisov btrfs_print_v0_err(trans->fs_info); 3986ba3c2b19SNikolay Borisov btrfs_abort_transaction(trans, err); 3987ba3c2b19SNikolay Borisov break; 39885d4f98a2SYan Zheng } else { 39895d4f98a2SYan Zheng BUG(); 39905d4f98a2SYan Zheng } 39915d4f98a2SYan Zheng 39925d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 39935d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 39945d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 39955d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 39965d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 39975d4f98a2SYan Zheng } else { 3998b3b4aa74SDavid Sterba btrfs_release_path(path); 39995d4f98a2SYan Zheng ret = 0; 40005d4f98a2SYan Zheng } 40015d4f98a2SYan Zheng if (ret < 0) { 40023fd0a558SYan, Zheng err = ret; 40035d4f98a2SYan Zheng break; 40045d4f98a2SYan Zheng } 40055d4f98a2SYan Zheng 40065d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 40075d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 40085d4f98a2SYan Zheng if (ret < 0) { 40093fd0a558SYan, Zheng if (ret != -EAGAIN) { 40105d4f98a2SYan Zheng err = ret; 40115d4f98a2SYan Zheng break; 40125d4f98a2SYan Zheng } 40133fd0a558SYan, Zheng rc->extents_found--; 40143fd0a558SYan, Zheng rc->search_start = key.objectid; 40153fd0a558SYan, Zheng } 40165d4f98a2SYan Zheng } 40175d4f98a2SYan Zheng 40183a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 40192ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 40203fd0a558SYan, Zheng trans = NULL; 40215d4f98a2SYan Zheng 40225d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 40235d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40245d4f98a2SYan Zheng rc->found_file_extent = 1; 40250257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 40263fd0a558SYan, Zheng &key, &rc->cluster); 40275d4f98a2SYan Zheng if (ret < 0) { 40285d4f98a2SYan Zheng err = ret; 40295d4f98a2SYan Zheng break; 40305d4f98a2SYan Zheng } 40315d4f98a2SYan Zheng } 4032f31ea088SQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 4033f31ea088SQu Wenruo err = -ECANCELED; 4034f31ea088SQu Wenruo break; 4035f31ea088SQu Wenruo } 40365d4f98a2SYan Zheng } 4037c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 403843a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 40399689457bSShilong Wang if (ret == 1) { 4040c87f08caSChris Mason err = 0; 4041c87f08caSChris Mason progress = 0; 4042c87f08caSChris Mason goto restart; 4043c87f08caSChris Mason } 4044c87f08caSChris Mason } 40453fd0a558SYan, Zheng 4046b3b4aa74SDavid Sterba btrfs_release_path(path); 404791166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 40485d4f98a2SYan Zheng 40495d4f98a2SYan Zheng if (trans) { 40503a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 40512ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 40525d4f98a2SYan Zheng } 40535d4f98a2SYan Zheng 40540257bb82SYan, Zheng if (!err) { 40553fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 40563fd0a558SYan, Zheng &rc->cluster); 40570257bb82SYan, Zheng if (ret < 0) 40580257bb82SYan, Zheng err = ret; 40590257bb82SYan, Zheng } 40600257bb82SYan, Zheng 40613fd0a558SYan, Zheng rc->create_reloc_tree = 0; 40623fd0a558SYan, Zheng set_reloc_control(rc); 40630257bb82SYan, Zheng 40643fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 406563f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 40665d4f98a2SYan Zheng 40677f913c7cSQu Wenruo /* 40687f913c7cSQu Wenruo * Even in the case when the relocation is cancelled, we should all go 40697f913c7cSQu Wenruo * through prepare_to_merge() and merge_reloc_roots(). 40707f913c7cSQu Wenruo * 40717f913c7cSQu Wenruo * For error (including cancelled balance), prepare_to_merge() will 40727f913c7cSQu Wenruo * mark all reloc trees orphan, then queue them for cleanup in 40737f913c7cSQu Wenruo * merge_reloc_roots() 40747f913c7cSQu Wenruo */ 40753fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 40765d4f98a2SYan Zheng 40775d4f98a2SYan Zheng merge_reloc_roots(rc); 40785d4f98a2SYan Zheng 40793fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 40805d4f98a2SYan Zheng unset_reloc_control(rc); 408163f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 40825d4f98a2SYan Zheng 40835d4f98a2SYan Zheng /* get rid of pinned extents */ 40847a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 408562b99540SQu Wenruo if (IS_ERR(trans)) { 40863612b495STsutomu Itoh err = PTR_ERR(trans); 408762b99540SQu Wenruo goto out_free; 408862b99540SQu Wenruo } 40893a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 40906217b0faSJosef Bacik out_free: 4091d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4092d2311e69SQu Wenruo if (ret < 0 && !err) 4093d2311e69SQu Wenruo err = ret; 40942ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 40953fd0a558SYan, Zheng btrfs_free_path(path); 40965d4f98a2SYan Zheng return err; 40975d4f98a2SYan Zheng } 40985d4f98a2SYan Zheng 40995d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 41000257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 41015d4f98a2SYan Zheng { 41025d4f98a2SYan Zheng struct btrfs_path *path; 41035d4f98a2SYan Zheng struct btrfs_inode_item *item; 41045d4f98a2SYan Zheng struct extent_buffer *leaf; 41055d4f98a2SYan Zheng int ret; 41065d4f98a2SYan Zheng 41075d4f98a2SYan Zheng path = btrfs_alloc_path(); 41085d4f98a2SYan Zheng if (!path) 41095d4f98a2SYan Zheng return -ENOMEM; 41105d4f98a2SYan Zheng 41115d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 41125d4f98a2SYan Zheng if (ret) 41135d4f98a2SYan Zheng goto out; 41145d4f98a2SYan Zheng 41155d4f98a2SYan Zheng leaf = path->nodes[0]; 41165d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 4117b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 41185d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 41190257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 41205d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 41213fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 41223fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 41235d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 41245d4f98a2SYan Zheng out: 41255d4f98a2SYan Zheng btrfs_free_path(path); 41265d4f98a2SYan Zheng return ret; 41275d4f98a2SYan Zheng } 41285d4f98a2SYan Zheng 41295d4f98a2SYan Zheng /* 41305d4f98a2SYan Zheng * helper to create inode for data relocation. 41315d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 41325d4f98a2SYan Zheng */ 41333fd0a558SYan, Zheng static noinline_for_stack 41343fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 413532da5386SDavid Sterba struct btrfs_block_group *group) 41365d4f98a2SYan Zheng { 41375d4f98a2SYan Zheng struct inode *inode = NULL; 41385d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 41395d4f98a2SYan Zheng struct btrfs_root *root; 41405d4f98a2SYan Zheng struct btrfs_key key; 41414624900dSZhaolei u64 objectid; 41425d4f98a2SYan Zheng int err = 0; 41435d4f98a2SYan Zheng 41445d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 41455d4f98a2SYan Zheng if (IS_ERR(root)) 41465d4f98a2SYan Zheng return ERR_CAST(root); 41475d4f98a2SYan Zheng 4148a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 414976deacf0SJosef Bacik if (IS_ERR(trans)) { 415000246528SJosef Bacik btrfs_put_root(root); 41513fd0a558SYan, Zheng return ERR_CAST(trans); 415276deacf0SJosef Bacik } 41535d4f98a2SYan Zheng 4154581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 41555d4f98a2SYan Zheng if (err) 41565d4f98a2SYan Zheng goto out; 41575d4f98a2SYan Zheng 41580257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 41595d4f98a2SYan Zheng BUG_ON(err); 41605d4f98a2SYan Zheng 41615d4f98a2SYan Zheng key.objectid = objectid; 41625d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 41635d4f98a2SYan Zheng key.offset = 0; 41644c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 41652e19f1f9SAl Viro BUG_ON(IS_ERR(inode)); 4166b3470b5dSDavid Sterba BTRFS_I(inode)->index_cnt = group->start; 41675d4f98a2SYan Zheng 416873f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 41695d4f98a2SYan Zheng out: 417000246528SJosef Bacik btrfs_put_root(root); 41713a45bb20SJeff Mahoney btrfs_end_transaction(trans); 41722ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 41735d4f98a2SYan Zheng if (err) { 41745d4f98a2SYan Zheng if (inode) 41755d4f98a2SYan Zheng iput(inode); 41765d4f98a2SYan Zheng inode = ERR_PTR(err); 41775d4f98a2SYan Zheng } 41785d4f98a2SYan Zheng return inode; 41795d4f98a2SYan Zheng } 41805d4f98a2SYan Zheng 4181c258d6e3SQu Wenruo static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 41823fd0a558SYan, Zheng { 41833fd0a558SYan, Zheng struct reloc_control *rc; 41843fd0a558SYan, Zheng 41853fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 41863fd0a558SYan, Zheng if (!rc) 41873fd0a558SYan, Zheng return NULL; 41883fd0a558SYan, Zheng 41893fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 4190d2311e69SQu Wenruo INIT_LIST_HEAD(&rc->dirty_subvol_roots); 41913fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 41923fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 419343eb5f29SQu Wenruo extent_io_tree_init(fs_info, &rc->processed_blocks, 419443eb5f29SQu Wenruo IO_TREE_RELOC_BLOCKS, NULL); 41953fd0a558SYan, Zheng return rc; 41963fd0a558SYan, Zheng } 41973fd0a558SYan, Zheng 41981a0afa0eSJosef Bacik static void free_reloc_control(struct reloc_control *rc) 41991a0afa0eSJosef Bacik { 42001a0afa0eSJosef Bacik struct mapping_node *node, *tmp; 42011a0afa0eSJosef Bacik 42021a0afa0eSJosef Bacik free_reloc_roots(&rc->reloc_roots); 42031a0afa0eSJosef Bacik rbtree_postorder_for_each_entry_safe(node, tmp, 42041a0afa0eSJosef Bacik &rc->reloc_root_tree.rb_root, rb_node) 42051a0afa0eSJosef Bacik kfree(node); 42061a0afa0eSJosef Bacik 42071a0afa0eSJosef Bacik kfree(rc); 42081a0afa0eSJosef Bacik } 42091a0afa0eSJosef Bacik 42105d4f98a2SYan Zheng /* 4211ebce0e01SAdam Borowski * Print the block group being relocated 4212ebce0e01SAdam Borowski */ 4213ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 421432da5386SDavid Sterba struct btrfs_block_group *block_group) 4215ebce0e01SAdam Borowski { 4216f89e09cfSAnand Jain char buf[128] = {'\0'}; 4217ebce0e01SAdam Borowski 4218f89e09cfSAnand Jain btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); 4219ebce0e01SAdam Borowski 4220ebce0e01SAdam Borowski btrfs_info(fs_info, 4221ebce0e01SAdam Borowski "relocating block group %llu flags %s", 4222b3470b5dSDavid Sterba block_group->start, buf); 4223ebce0e01SAdam Borowski } 4224ebce0e01SAdam Borowski 4225430640e3SQu Wenruo static const char *stage_to_string(int stage) 4226430640e3SQu Wenruo { 4227430640e3SQu Wenruo if (stage == MOVE_DATA_EXTENTS) 4228430640e3SQu Wenruo return "move data extents"; 4229430640e3SQu Wenruo if (stage == UPDATE_DATA_PTRS) 4230430640e3SQu Wenruo return "update data pointers"; 4231430640e3SQu Wenruo return "unknown"; 4232430640e3SQu Wenruo } 4233430640e3SQu Wenruo 4234ebce0e01SAdam Borowski /* 42355d4f98a2SYan Zheng * function to relocate all extents in a block group. 42365d4f98a2SYan Zheng */ 42376bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 42385d4f98a2SYan Zheng { 423932da5386SDavid Sterba struct btrfs_block_group *bg; 42406bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 42415d4f98a2SYan Zheng struct reloc_control *rc; 42420af3d00bSJosef Bacik struct inode *inode; 42430af3d00bSJosef Bacik struct btrfs_path *path; 42445d4f98a2SYan Zheng int ret; 4245f0486c68SYan, Zheng int rw = 0; 42465d4f98a2SYan Zheng int err = 0; 42475d4f98a2SYan Zheng 4248eede2bf3SOmar Sandoval bg = btrfs_lookup_block_group(fs_info, group_start); 4249eede2bf3SOmar Sandoval if (!bg) 4250eede2bf3SOmar Sandoval return -ENOENT; 4251eede2bf3SOmar Sandoval 4252eede2bf3SOmar Sandoval if (btrfs_pinned_by_swapfile(fs_info, bg)) { 4253eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 4254eede2bf3SOmar Sandoval return -ETXTBSY; 4255eede2bf3SOmar Sandoval } 4256eede2bf3SOmar Sandoval 4257c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 4258eede2bf3SOmar Sandoval if (!rc) { 4259eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 42605d4f98a2SYan Zheng return -ENOMEM; 4261eede2bf3SOmar Sandoval } 42625d4f98a2SYan Zheng 4263f0486c68SYan, Zheng rc->extent_root = extent_root; 4264eede2bf3SOmar Sandoval rc->block_group = bg; 42655d4f98a2SYan Zheng 4266b12de528SQu Wenruo ret = btrfs_inc_block_group_ro(rc->block_group, true); 4267f0486c68SYan, Zheng if (ret) { 4268f0486c68SYan, Zheng err = ret; 4269f0486c68SYan, Zheng goto out; 4270f0486c68SYan, Zheng } 4271f0486c68SYan, Zheng rw = 1; 4272f0486c68SYan, Zheng 42730af3d00bSJosef Bacik path = btrfs_alloc_path(); 42740af3d00bSJosef Bacik if (!path) { 42750af3d00bSJosef Bacik err = -ENOMEM; 42760af3d00bSJosef Bacik goto out; 42770af3d00bSJosef Bacik } 42780af3d00bSJosef Bacik 42797949f339SDavid Sterba inode = lookup_free_space_inode(rc->block_group, path); 42800af3d00bSJosef Bacik btrfs_free_path(path); 42810af3d00bSJosef Bacik 42820af3d00bSJosef Bacik if (!IS_ERR(inode)) 42831bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 42840af3d00bSJosef Bacik else 42850af3d00bSJosef Bacik ret = PTR_ERR(inode); 42860af3d00bSJosef Bacik 42870af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 42880af3d00bSJosef Bacik err = ret; 42890af3d00bSJosef Bacik goto out; 42900af3d00bSJosef Bacik } 42910af3d00bSJosef Bacik 42925d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 42935d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 42945d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 42955d4f98a2SYan Zheng rc->data_inode = NULL; 42965d4f98a2SYan Zheng goto out; 42975d4f98a2SYan Zheng } 42985d4f98a2SYan Zheng 42990b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 43005d4f98a2SYan Zheng 43019cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4302f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 43036374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 4304b3470b5dSDavid Sterba rc->block_group->start, 4305b3470b5dSDavid Sterba rc->block_group->length); 43065d4f98a2SYan Zheng 43075d4f98a2SYan Zheng while (1) { 4308430640e3SQu Wenruo int finishes_stage; 4309430640e3SQu Wenruo 431076dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 43115d4f98a2SYan Zheng ret = relocate_block_group(rc); 431276dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 4313ff612ba7SJosef Bacik if (ret < 0) 43145d4f98a2SYan Zheng err = ret; 4315ff612ba7SJosef Bacik 4316430640e3SQu Wenruo finishes_stage = rc->stage; 4317ff612ba7SJosef Bacik /* 4318ff612ba7SJosef Bacik * We may have gotten ENOSPC after we already dirtied some 4319ff612ba7SJosef Bacik * extents. If writeout happens while we're relocating a 4320ff612ba7SJosef Bacik * different block group we could end up hitting the 4321ff612ba7SJosef Bacik * BUG_ON(rc->stage == UPDATE_DATA_PTRS) in 4322ff612ba7SJosef Bacik * btrfs_reloc_cow_block. Make sure we write everything out 4323ff612ba7SJosef Bacik * properly so we don't trip over this problem, and then break 4324ff612ba7SJosef Bacik * out of the loop if we hit an error. 4325ff612ba7SJosef Bacik */ 4326ff612ba7SJosef Bacik if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 4327ff612ba7SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 4328ff612ba7SJosef Bacik (u64)-1); 4329ff612ba7SJosef Bacik if (ret) 4330ff612ba7SJosef Bacik err = ret; 4331ff612ba7SJosef Bacik invalidate_mapping_pages(rc->data_inode->i_mapping, 4332ff612ba7SJosef Bacik 0, -1); 4333ff612ba7SJosef Bacik rc->stage = UPDATE_DATA_PTRS; 43345d4f98a2SYan Zheng } 43355d4f98a2SYan Zheng 4336ff612ba7SJosef Bacik if (err < 0) 4337ff612ba7SJosef Bacik goto out; 4338ff612ba7SJosef Bacik 43395d4f98a2SYan Zheng if (rc->extents_found == 0) 43405d4f98a2SYan Zheng break; 43415d4f98a2SYan Zheng 4342430640e3SQu Wenruo btrfs_info(fs_info, "found %llu extents, stage: %s", 4343430640e3SQu Wenruo rc->extents_found, stage_to_string(finishes_stage)); 43445d4f98a2SYan Zheng } 43455d4f98a2SYan Zheng 43465d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 43475d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 4348bf38be65SDavid Sterba WARN_ON(rc->block_group->used > 0); 43495d4f98a2SYan Zheng out: 4350f0486c68SYan, Zheng if (err && rw) 43512ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 43525d4f98a2SYan Zheng iput(rc->data_inode); 43535d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 43541a0afa0eSJosef Bacik free_reloc_control(rc); 43555d4f98a2SYan Zheng return err; 43565d4f98a2SYan Zheng } 43575d4f98a2SYan Zheng 435876dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 435976dda93cSYan, Zheng { 43600b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 436176dda93cSYan, Zheng struct btrfs_trans_handle *trans; 436279787eaaSJeff Mahoney int ret, err; 436376dda93cSYan, Zheng 43640b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 436579787eaaSJeff Mahoney if (IS_ERR(trans)) 436679787eaaSJeff Mahoney return PTR_ERR(trans); 436776dda93cSYan, Zheng 436876dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 436976dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 437076dda93cSYan, Zheng root->root_item.drop_level = 0; 437176dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 43720b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 437376dda93cSYan, Zheng &root->root_key, &root->root_item); 437476dda93cSYan, Zheng 43753a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 437679787eaaSJeff Mahoney if (err) 437779787eaaSJeff Mahoney return err; 437879787eaaSJeff Mahoney return ret; 437976dda93cSYan, Zheng } 438076dda93cSYan, Zheng 43815d4f98a2SYan Zheng /* 43825d4f98a2SYan Zheng * recover relocation interrupted by system crash. 43835d4f98a2SYan Zheng * 43845d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 43855d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 43865d4f98a2SYan Zheng */ 43875d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 43885d4f98a2SYan Zheng { 43890b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 43905d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 43915d4f98a2SYan Zheng struct btrfs_key key; 43925d4f98a2SYan Zheng struct btrfs_root *fs_root; 43935d4f98a2SYan Zheng struct btrfs_root *reloc_root; 43945d4f98a2SYan Zheng struct btrfs_path *path; 43955d4f98a2SYan Zheng struct extent_buffer *leaf; 43965d4f98a2SYan Zheng struct reloc_control *rc = NULL; 43975d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 43985d4f98a2SYan Zheng int ret; 43995d4f98a2SYan Zheng int err = 0; 44005d4f98a2SYan Zheng 44015d4f98a2SYan Zheng path = btrfs_alloc_path(); 44025d4f98a2SYan Zheng if (!path) 44035d4f98a2SYan Zheng return -ENOMEM; 4404e4058b54SDavid Sterba path->reada = READA_BACK; 44055d4f98a2SYan Zheng 44065d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 44075d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 44085d4f98a2SYan Zheng key.offset = (u64)-1; 44095d4f98a2SYan Zheng 44105d4f98a2SYan Zheng while (1) { 44110b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 44125d4f98a2SYan Zheng path, 0, 0); 44135d4f98a2SYan Zheng if (ret < 0) { 44145d4f98a2SYan Zheng err = ret; 44155d4f98a2SYan Zheng goto out; 44165d4f98a2SYan Zheng } 44175d4f98a2SYan Zheng if (ret > 0) { 44185d4f98a2SYan Zheng if (path->slots[0] == 0) 44195d4f98a2SYan Zheng break; 44205d4f98a2SYan Zheng path->slots[0]--; 44215d4f98a2SYan Zheng } 44225d4f98a2SYan Zheng leaf = path->nodes[0]; 44235d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4424b3b4aa74SDavid Sterba btrfs_release_path(path); 44255d4f98a2SYan Zheng 44265d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 44275d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 44285d4f98a2SYan Zheng break; 44295d4f98a2SYan Zheng 44303dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(root, &key); 44315d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 44325d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 44335d4f98a2SYan Zheng goto out; 44345d4f98a2SYan Zheng } 44355d4f98a2SYan Zheng 44363dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 44375d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 44385d4f98a2SYan Zheng 44395d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 44400b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, 44415d4f98a2SYan Zheng reloc_root->root_key.offset); 44425d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 444376dda93cSYan, Zheng ret = PTR_ERR(fs_root); 444476dda93cSYan, Zheng if (ret != -ENOENT) { 444576dda93cSYan, Zheng err = ret; 44465d4f98a2SYan Zheng goto out; 44475d4f98a2SYan Zheng } 444879787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 444979787eaaSJeff Mahoney if (ret < 0) { 445079787eaaSJeff Mahoney err = ret; 445179787eaaSJeff Mahoney goto out; 445279787eaaSJeff Mahoney } 4453932fd26dSJosef Bacik } else { 445400246528SJosef Bacik btrfs_put_root(fs_root); 445576dda93cSYan, Zheng } 44565d4f98a2SYan Zheng } 44575d4f98a2SYan Zheng 44585d4f98a2SYan Zheng if (key.offset == 0) 44595d4f98a2SYan Zheng break; 44605d4f98a2SYan Zheng 44615d4f98a2SYan Zheng key.offset--; 44625d4f98a2SYan Zheng } 4463b3b4aa74SDavid Sterba btrfs_release_path(path); 44645d4f98a2SYan Zheng 44655d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 44665d4f98a2SYan Zheng goto out; 44675d4f98a2SYan Zheng 4468c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 44695d4f98a2SYan Zheng if (!rc) { 44705d4f98a2SYan Zheng err = -ENOMEM; 44715d4f98a2SYan Zheng goto out; 44725d4f98a2SYan Zheng } 44735d4f98a2SYan Zheng 44740b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 44755d4f98a2SYan Zheng 44765d4f98a2SYan Zheng set_reloc_control(rc); 44775d4f98a2SYan Zheng 44787a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 44793612b495STsutomu Itoh if (IS_ERR(trans)) { 44803612b495STsutomu Itoh err = PTR_ERR(trans); 4481fb2d83eeSJosef Bacik goto out_unset; 44823612b495STsutomu Itoh } 44833fd0a558SYan, Zheng 44843fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 44853fd0a558SYan, Zheng 44865d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 44875d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 44885d4f98a2SYan Zheng struct btrfs_root, root_list); 44895d4f98a2SYan Zheng list_del(&reloc_root->root_list); 44905d4f98a2SYan Zheng 44915d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 44925d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 44935d4f98a2SYan Zheng &rc->reloc_roots); 44945d4f98a2SYan Zheng continue; 44955d4f98a2SYan Zheng } 44965d4f98a2SYan Zheng 44970b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, reloc_root->root_key.offset); 449879787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 449979787eaaSJeff Mahoney err = PTR_ERR(fs_root); 4500ca1aa281SJosef Bacik list_add_tail(&reloc_root->root_list, &reloc_roots); 45011402d17dSXiyu Yang btrfs_end_transaction(trans); 4502fb2d83eeSJosef Bacik goto out_unset; 450379787eaaSJeff Mahoney } 45045d4f98a2SYan Zheng 4505ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 450679787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 4507f44deb74SJosef Bacik fs_root->reloc_root = btrfs_grab_root(reloc_root); 450800246528SJosef Bacik btrfs_put_root(fs_root); 45095d4f98a2SYan Zheng } 45105d4f98a2SYan Zheng 45113a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 451279787eaaSJeff Mahoney if (err) 4513fb2d83eeSJosef Bacik goto out_unset; 45145d4f98a2SYan Zheng 45155d4f98a2SYan Zheng merge_reloc_roots(rc); 45165d4f98a2SYan Zheng 45175d4f98a2SYan Zheng unset_reloc_control(rc); 45185d4f98a2SYan Zheng 45197a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 452062b99540SQu Wenruo if (IS_ERR(trans)) { 45213612b495STsutomu Itoh err = PTR_ERR(trans); 45226217b0faSJosef Bacik goto out_clean; 452362b99540SQu Wenruo } 45243a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 45256217b0faSJosef Bacik out_clean: 4526d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4527d2311e69SQu Wenruo if (ret < 0 && !err) 4528d2311e69SQu Wenruo err = ret; 4529fb2d83eeSJosef Bacik out_unset: 4530fb2d83eeSJosef Bacik unset_reloc_control(rc); 45311a0afa0eSJosef Bacik free_reloc_control(rc); 45323612b495STsutomu Itoh out: 4533aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4534aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4535aca1bba6SLiu Bo 45365d4f98a2SYan Zheng btrfs_free_path(path); 45375d4f98a2SYan Zheng 45385d4f98a2SYan Zheng if (err == 0) { 45395d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 45400b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 4541932fd26dSJosef Bacik if (IS_ERR(fs_root)) { 45425d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4543932fd26dSJosef Bacik } else { 454466b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 454500246528SJosef Bacik btrfs_put_root(fs_root); 4546932fd26dSJosef Bacik } 4547932fd26dSJosef Bacik } 45485d4f98a2SYan Zheng return err; 45495d4f98a2SYan Zheng } 45505d4f98a2SYan Zheng 45515d4f98a2SYan Zheng /* 45525d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 45535d4f98a2SYan Zheng * 45545d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 45555d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 45565d4f98a2SYan Zheng */ 45575d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 45585d4f98a2SYan Zheng { 45590b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 45605d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 45615d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 45625d4f98a2SYan Zheng int ret; 45635d4f98a2SYan Zheng u64 disk_bytenr; 45644577b014SJosef Bacik u64 new_bytenr; 45655d4f98a2SYan Zheng LIST_HEAD(list); 45665d4f98a2SYan Zheng 45675d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 4568bffe633eSOmar Sandoval BUG_ON(ordered->file_offset != file_pos || ordered->num_bytes != len); 45695d4f98a2SYan Zheng 45705d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 45710b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4572a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 457379787eaaSJeff Mahoney if (ret) 457479787eaaSJeff Mahoney goto out; 45755d4f98a2SYan Zheng 45765d4f98a2SYan Zheng while (!list_empty(&list)) { 45775d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 45785d4f98a2SYan Zheng list_del_init(&sums->list); 45795d4f98a2SYan Zheng 45804577b014SJosef Bacik /* 45814577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 45824577b014SJosef Bacik * We need to do this because we will read in entire prealloc 45834577b014SJosef Bacik * extents but we may have written to say the middle of the 45844577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 45854577b014SJosef Bacik * the right disk offset. 45864577b014SJosef Bacik * 45874577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 45884577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 45894577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 45904577b014SJosef Bacik * disk length. 45914577b014SJosef Bacik */ 4592bffe633eSOmar Sandoval new_bytenr = ordered->disk_bytenr + sums->bytenr - disk_bytenr; 45934577b014SJosef Bacik sums->bytenr = new_bytenr; 45945d4f98a2SYan Zheng 4595f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 45965d4f98a2SYan Zheng } 459779787eaaSJeff Mahoney out: 45985d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4599411fc6bcSAndi Kleen return ret; 46005d4f98a2SYan Zheng } 46013fd0a558SYan, Zheng 460283d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 46033fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 46043fd0a558SYan, Zheng struct extent_buffer *cow) 46053fd0a558SYan, Zheng { 46060b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 46073fd0a558SYan, Zheng struct reloc_control *rc; 46083fd0a558SYan, Zheng struct backref_node *node; 46093fd0a558SYan, Zheng int first_cow = 0; 46103fd0a558SYan, Zheng int level; 461183d4cfd4SJosef Bacik int ret = 0; 46123fd0a558SYan, Zheng 46130b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 46143fd0a558SYan, Zheng if (!rc) 461583d4cfd4SJosef Bacik return 0; 46163fd0a558SYan, Zheng 46173fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 46183fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 46193fd0a558SYan, Zheng 46203fd0a558SYan, Zheng level = btrfs_header_level(buf); 46213fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 46223fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 46233fd0a558SYan, Zheng first_cow = 1; 46243fd0a558SYan, Zheng 46253fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 46263fd0a558SYan, Zheng rc->create_reloc_tree) { 46273fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 46283fd0a558SYan, Zheng 46293fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 46303fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 46313fd0a558SYan, Zheng node->new_bytenr != buf->start); 46323fd0a558SYan, Zheng 46333fd0a558SYan, Zheng drop_node_buffer(node); 463467439dadSDavid Sterba atomic_inc(&cow->refs); 46353fd0a558SYan, Zheng node->eb = cow; 46363fd0a558SYan, Zheng node->new_bytenr = cow->start; 46373fd0a558SYan, Zheng 46383fd0a558SYan, Zheng if (!node->pending) { 46393fd0a558SYan, Zheng list_move_tail(&node->list, 46403fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 46413fd0a558SYan, Zheng node->pending = 1; 46423fd0a558SYan, Zheng } 46433fd0a558SYan, Zheng 46443fd0a558SYan, Zheng if (first_cow) 46459569cc20SQu Wenruo mark_block_processed(rc, node); 46463fd0a558SYan, Zheng 46473fd0a558SYan, Zheng if (first_cow && level > 0) 46483fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 46493fd0a558SYan, Zheng } 46503fd0a558SYan, Zheng 465183d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 46523fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 465383d4cfd4SJosef Bacik return ret; 46543fd0a558SYan, Zheng } 46553fd0a558SYan, Zheng 46563fd0a558SYan, Zheng /* 46573fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 465801327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 46593fd0a558SYan, Zheng */ 4660147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 46613fd0a558SYan, Zheng u64 *bytes_to_reserve) 46623fd0a558SYan, Zheng { 466310995c04SQu Wenruo struct btrfs_root *root = pending->root; 466410995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 46653fd0a558SYan, Zheng 46666282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 46673fd0a558SYan, Zheng return; 46683fd0a558SYan, Zheng 46693fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 46703fd0a558SYan, Zheng return; 46713fd0a558SYan, Zheng 46723fd0a558SYan, Zheng root = root->reloc_root; 46733fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 46743fd0a558SYan, Zheng /* 46753fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 46763fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 46773fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 46783fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 46793fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 46803fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 46813fd0a558SYan, Zheng * tree may use more space than it frees. so we need 46823fd0a558SYan, Zheng * reserve extra space. 46833fd0a558SYan, Zheng */ 46843fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 46853fd0a558SYan, Zheng } 46863fd0a558SYan, Zheng 46873fd0a558SYan, Zheng /* 46883fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 46893fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 4690f44deb74SJosef Bacik * 4691f44deb74SJosef Bacik * This is similar to btrfs_init_reloc_root(), we come out of here with two 4692f44deb74SJosef Bacik * references held on the reloc_root, one for root->reloc_root and one for 4693f44deb74SJosef Bacik * rc->reloc_roots. 46943fd0a558SYan, Zheng */ 469549b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 46963fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 46973fd0a558SYan, Zheng { 46983fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 46993fd0a558SYan, Zheng struct btrfs_root *reloc_root; 47003fd0a558SYan, Zheng struct btrfs_root *new_root; 470110995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 47023fd0a558SYan, Zheng int ret; 47033fd0a558SYan, Zheng 47046282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 470549b25e05SJeff Mahoney return 0; 47063fd0a558SYan, Zheng 47073fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 47083fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 47093fd0a558SYan, Zheng 47103fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 47113fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 47123fd0a558SYan, Zheng rc->block_rsv, 47133a584174SLu Fengqi rc->nodes_relocated, true); 471449b25e05SJeff Mahoney if (ret) 471549b25e05SJeff Mahoney return ret; 47163fd0a558SYan, Zheng } 47173fd0a558SYan, Zheng 47183fd0a558SYan, Zheng new_root = pending->snap; 47193fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 47203fd0a558SYan, Zheng new_root->root_key.objectid); 472149b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 472249b25e05SJeff Mahoney return PTR_ERR(reloc_root); 47233fd0a558SYan, Zheng 4724ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4725ffd7b339SJeff Mahoney BUG_ON(ret < 0); 4726f44deb74SJosef Bacik new_root->reloc_root = btrfs_grab_root(reloc_root); 47273fd0a558SYan, Zheng 472849b25e05SJeff Mahoney if (rc->create_reloc_tree) 47293fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 473049b25e05SJeff Mahoney return ret; 47313fd0a558SYan, Zheng } 4732