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; 1252433bea5SQu Wenruo 1262433bea5SQu Wenruo /* 1272433bea5SQu Wenruo * For generic purpose backref cache, where we only care if it's a reloc 1282433bea5SQu Wenruo * root, doesn't care the source subvolid. 1292433bea5SQu Wenruo */ 1302433bea5SQu Wenruo unsigned int is_reloc_root:1; 1315d4f98a2SYan Zheng }; 1325d4f98a2SYan Zheng 1335d4f98a2SYan Zheng /* 1345d4f98a2SYan Zheng * present a block pointer in the backref cache 1355d4f98a2SYan Zheng */ 1365d4f98a2SYan Zheng struct backref_edge { 1375d4f98a2SYan Zheng struct list_head list[2]; 1385d4f98a2SYan Zheng struct backref_node *node[2]; 1395d4f98a2SYan Zheng }; 1405d4f98a2SYan Zheng 1415d4f98a2SYan Zheng #define LOWER 0 1425d4f98a2SYan Zheng #define UPPER 1 1430647bf56SWang Shilong #define RELOCATION_RESERVED_NODES 256 1445d4f98a2SYan Zheng 1455d4f98a2SYan Zheng struct backref_cache { 1465d4f98a2SYan Zheng /* red black tree of all backref nodes in the cache */ 1475d4f98a2SYan Zheng struct rb_root rb_root; 1483fd0a558SYan, Zheng /* for passing backref nodes to btrfs_reloc_cow_block */ 1493fd0a558SYan, Zheng struct backref_node *path[BTRFS_MAX_LEVEL]; 1503fd0a558SYan, Zheng /* 1513fd0a558SYan, Zheng * list of blocks that have been cowed but some block 1523fd0a558SYan, Zheng * pointers in upper level blocks may not reflect the 1533fd0a558SYan, Zheng * new location 1543fd0a558SYan, Zheng */ 1555d4f98a2SYan Zheng struct list_head pending[BTRFS_MAX_LEVEL]; 1563fd0a558SYan, Zheng /* list of backref nodes with no child node */ 1573fd0a558SYan, Zheng struct list_head leaves; 1583fd0a558SYan, Zheng /* list of blocks that have been cowed in current transaction */ 1593fd0a558SYan, Zheng struct list_head changed; 1603fd0a558SYan, Zheng /* list of detached backref node. */ 1613fd0a558SYan, Zheng struct list_head detached; 1623fd0a558SYan, Zheng 1633fd0a558SYan, Zheng u64 last_trans; 1643fd0a558SYan, Zheng 1653fd0a558SYan, Zheng int nr_nodes; 1663fd0a558SYan, Zheng int nr_edges; 16784780289SQu Wenruo 16884780289SQu Wenruo /* The list of unchecked backref edges during backref cache build */ 16984780289SQu Wenruo struct list_head pending_edge; 17084780289SQu Wenruo 17184780289SQu Wenruo /* The list of useless backref nodes during backref cache build */ 17284780289SQu Wenruo struct list_head useless_node; 17333a0f1f7SQu Wenruo 17433a0f1f7SQu Wenruo struct btrfs_fs_info *fs_info; 1752433bea5SQu Wenruo 1762433bea5SQu Wenruo /* 1772433bea5SQu Wenruo * Whether this cache is for relocation 1782433bea5SQu Wenruo * 1792433bea5SQu Wenruo * Reloction backref cache require more info for reloc root compared 1802433bea5SQu Wenruo * to generic backref cache. 1812433bea5SQu Wenruo */ 1822433bea5SQu Wenruo unsigned int is_reloc; 1835d4f98a2SYan Zheng }; 1845d4f98a2SYan Zheng 1855d4f98a2SYan Zheng /* 1865d4f98a2SYan Zheng * map address of tree root to tree 1875d4f98a2SYan Zheng */ 1885d4f98a2SYan Zheng struct mapping_node { 1895d4f98a2SYan Zheng struct rb_node rb_node; 1905d4f98a2SYan Zheng u64 bytenr; 1915d4f98a2SYan Zheng void *data; 1925d4f98a2SYan Zheng }; 1935d4f98a2SYan Zheng 1945d4f98a2SYan Zheng struct mapping_tree { 1955d4f98a2SYan Zheng struct rb_root rb_root; 1965d4f98a2SYan Zheng spinlock_t lock; 1975d4f98a2SYan Zheng }; 1985d4f98a2SYan Zheng 1995d4f98a2SYan Zheng /* 2005d4f98a2SYan Zheng * present a tree block to process 2015d4f98a2SYan Zheng */ 2025d4f98a2SYan Zheng struct tree_block { 2035d4f98a2SYan Zheng struct rb_node rb_node; 2045d4f98a2SYan Zheng u64 bytenr; 2055d4f98a2SYan Zheng struct btrfs_key key; 2065d4f98a2SYan Zheng unsigned int level:8; 2075d4f98a2SYan Zheng unsigned int key_ready:1; 2085d4f98a2SYan Zheng }; 2095d4f98a2SYan Zheng 2100257bb82SYan, Zheng #define MAX_EXTENTS 128 2110257bb82SYan, Zheng 2120257bb82SYan, Zheng struct file_extent_cluster { 2130257bb82SYan, Zheng u64 start; 2140257bb82SYan, Zheng u64 end; 2150257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 2160257bb82SYan, Zheng unsigned int nr; 2170257bb82SYan, Zheng }; 2180257bb82SYan, Zheng 2195d4f98a2SYan Zheng struct reloc_control { 2205d4f98a2SYan Zheng /* block group to relocate */ 22132da5386SDavid Sterba struct btrfs_block_group *block_group; 2225d4f98a2SYan Zheng /* extent tree */ 2235d4f98a2SYan Zheng struct btrfs_root *extent_root; 2245d4f98a2SYan Zheng /* inode for moving data */ 2255d4f98a2SYan Zheng struct inode *data_inode; 2263fd0a558SYan, Zheng 2273fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 2283fd0a558SYan, Zheng 2293fd0a558SYan, Zheng struct backref_cache backref_cache; 2303fd0a558SYan, Zheng 2313fd0a558SYan, Zheng struct file_extent_cluster cluster; 2325d4f98a2SYan Zheng /* tree blocks have been processed */ 2335d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 2345d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 2355d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 2365d4f98a2SYan Zheng /* list of reloc trees */ 2375d4f98a2SYan Zheng struct list_head reloc_roots; 238d2311e69SQu Wenruo /* list of subvolume trees that get relocated */ 239d2311e69SQu Wenruo struct list_head dirty_subvol_roots; 2403fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 2413fd0a558SYan, Zheng u64 merging_rsv_size; 2423fd0a558SYan, Zheng /* size of relocated tree nodes */ 2433fd0a558SYan, Zheng u64 nodes_relocated; 2440647bf56SWang Shilong /* reserved size for block group relocation*/ 2450647bf56SWang Shilong u64 reserved_bytes; 2463fd0a558SYan, Zheng 2475d4f98a2SYan Zheng u64 search_start; 2485d4f98a2SYan Zheng u64 extents_found; 2493fd0a558SYan, Zheng 2503fd0a558SYan, Zheng unsigned int stage:8; 2513fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 2523fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 2535d4f98a2SYan Zheng unsigned int found_file_extent:1; 2545d4f98a2SYan Zheng }; 2555d4f98a2SYan Zheng 2565d4f98a2SYan Zheng /* stages of data relocation */ 2575d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 2585d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 2595d4f98a2SYan Zheng 2603fd0a558SYan, Zheng static void remove_backref_node(struct backref_cache *cache, 2613fd0a558SYan, Zheng struct backref_node *node); 2629569cc20SQu Wenruo 2639569cc20SQu Wenruo static void mark_block_processed(struct reloc_control *rc, 2649569cc20SQu Wenruo struct backref_node *node) 2659569cc20SQu Wenruo { 2669569cc20SQu Wenruo u32 blocksize; 2679569cc20SQu Wenruo 2689569cc20SQu Wenruo if (node->level == 0 || 2699569cc20SQu Wenruo in_range(node->bytenr, rc->block_group->start, 2709569cc20SQu Wenruo rc->block_group->length)) { 2719569cc20SQu Wenruo blocksize = rc->extent_root->fs_info->nodesize; 2729569cc20SQu Wenruo set_extent_bits(&rc->processed_blocks, node->bytenr, 2739569cc20SQu Wenruo node->bytenr + blocksize - 1, EXTENT_DIRTY); 2749569cc20SQu Wenruo } 2759569cc20SQu Wenruo node->processed = 1; 2769569cc20SQu Wenruo } 2779569cc20SQu Wenruo 2785d4f98a2SYan Zheng 2795d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 2805d4f98a2SYan Zheng { 2816bef4d31SEric Paris tree->rb_root = RB_ROOT; 2825d4f98a2SYan Zheng spin_lock_init(&tree->lock); 2835d4f98a2SYan Zheng } 2845d4f98a2SYan Zheng 28533a0f1f7SQu Wenruo static void backref_cache_init(struct btrfs_fs_info *fs_info, 2862433bea5SQu Wenruo struct backref_cache *cache, int is_reloc) 2875d4f98a2SYan Zheng { 2885d4f98a2SYan Zheng int i; 2896bef4d31SEric Paris cache->rb_root = RB_ROOT; 2905d4f98a2SYan Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2915d4f98a2SYan Zheng INIT_LIST_HEAD(&cache->pending[i]); 2923fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->changed); 2933fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->detached); 2943fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->leaves); 29584780289SQu Wenruo INIT_LIST_HEAD(&cache->pending_edge); 29684780289SQu Wenruo INIT_LIST_HEAD(&cache->useless_node); 29733a0f1f7SQu Wenruo cache->fs_info = fs_info; 2982433bea5SQu Wenruo cache->is_reloc = is_reloc; 2995d4f98a2SYan Zheng } 3005d4f98a2SYan Zheng 3013fd0a558SYan, Zheng static void backref_cache_cleanup(struct backref_cache *cache) 3025d4f98a2SYan Zheng { 3033fd0a558SYan, Zheng struct backref_node *node; 3043fd0a558SYan, Zheng int i; 3053fd0a558SYan, Zheng 3063fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 3073fd0a558SYan, Zheng node = list_entry(cache->detached.next, 3083fd0a558SYan, Zheng struct backref_node, list); 3093fd0a558SYan, Zheng remove_backref_node(cache, node); 3103fd0a558SYan, Zheng } 3113fd0a558SYan, Zheng 3123fd0a558SYan, Zheng while (!list_empty(&cache->leaves)) { 3133fd0a558SYan, Zheng node = list_entry(cache->leaves.next, 3143fd0a558SYan, Zheng struct backref_node, lower); 3153fd0a558SYan, Zheng remove_backref_node(cache, node); 3163fd0a558SYan, Zheng } 3173fd0a558SYan, Zheng 3183fd0a558SYan, Zheng cache->last_trans = 0; 3193fd0a558SYan, Zheng 3203fd0a558SYan, Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 321f4907095SLiu Bo ASSERT(list_empty(&cache->pending[i])); 32284780289SQu Wenruo ASSERT(list_empty(&cache->pending_edge)); 32384780289SQu Wenruo ASSERT(list_empty(&cache->useless_node)); 324f4907095SLiu Bo ASSERT(list_empty(&cache->changed)); 325f4907095SLiu Bo ASSERT(list_empty(&cache->detached)); 326f4907095SLiu Bo ASSERT(RB_EMPTY_ROOT(&cache->rb_root)); 327f4907095SLiu Bo ASSERT(!cache->nr_nodes); 328f4907095SLiu Bo ASSERT(!cache->nr_edges); 3293fd0a558SYan, Zheng } 3303fd0a558SYan, Zheng 3313fd0a558SYan, Zheng static struct backref_node *alloc_backref_node(struct backref_cache *cache) 3323fd0a558SYan, Zheng { 3333fd0a558SYan, Zheng struct backref_node *node; 3343fd0a558SYan, Zheng 3353fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 3363fd0a558SYan, Zheng if (node) { 3373fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 3385d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 3395d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 3405d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 3413fd0a558SYan, Zheng cache->nr_nodes++; 3423fd0a558SYan, Zheng } 3433fd0a558SYan, Zheng return node; 3443fd0a558SYan, Zheng } 3453fd0a558SYan, Zheng 3463fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 3473fd0a558SYan, Zheng struct backref_node *node) 3483fd0a558SYan, Zheng { 3493fd0a558SYan, Zheng if (node) { 3503fd0a558SYan, Zheng cache->nr_nodes--; 35100246528SJosef Bacik btrfs_put_root(node->root); 3523fd0a558SYan, Zheng kfree(node); 3533fd0a558SYan, Zheng } 3543fd0a558SYan, Zheng } 3553fd0a558SYan, Zheng 3563fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 3573fd0a558SYan, Zheng { 3583fd0a558SYan, Zheng struct backref_edge *edge; 3593fd0a558SYan, Zheng 3603fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 3613fd0a558SYan, Zheng if (edge) 3623fd0a558SYan, Zheng cache->nr_edges++; 3633fd0a558SYan, Zheng return edge; 3643fd0a558SYan, Zheng } 3653fd0a558SYan, Zheng 3663fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 3673fd0a558SYan, Zheng struct backref_edge *edge) 3683fd0a558SYan, Zheng { 3693fd0a558SYan, Zheng if (edge) { 3703fd0a558SYan, Zheng cache->nr_edges--; 3713fd0a558SYan, Zheng kfree(edge); 3723fd0a558SYan, Zheng } 3735d4f98a2SYan Zheng } 3745d4f98a2SYan Zheng 3755d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 3765d4f98a2SYan Zheng struct rb_node *node) 3775d4f98a2SYan Zheng { 3785d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 3795d4f98a2SYan Zheng struct rb_node *parent = NULL; 3805d4f98a2SYan Zheng struct tree_entry *entry; 3815d4f98a2SYan Zheng 3825d4f98a2SYan Zheng while (*p) { 3835d4f98a2SYan Zheng parent = *p; 3845d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 3855d4f98a2SYan Zheng 3865d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3875d4f98a2SYan Zheng p = &(*p)->rb_left; 3885d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3895d4f98a2SYan Zheng p = &(*p)->rb_right; 3905d4f98a2SYan Zheng else 3915d4f98a2SYan Zheng return parent; 3925d4f98a2SYan Zheng } 3935d4f98a2SYan Zheng 3945d4f98a2SYan Zheng rb_link_node(node, parent, p); 3955d4f98a2SYan Zheng rb_insert_color(node, root); 3965d4f98a2SYan Zheng return NULL; 3975d4f98a2SYan Zheng } 3985d4f98a2SYan Zheng 3995d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 4005d4f98a2SYan Zheng { 4015d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 4025d4f98a2SYan Zheng struct tree_entry *entry; 4035d4f98a2SYan Zheng 4045d4f98a2SYan Zheng while (n) { 4055d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 4065d4f98a2SYan Zheng 4075d4f98a2SYan Zheng if (bytenr < entry->bytenr) 4085d4f98a2SYan Zheng n = n->rb_left; 4095d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 4105d4f98a2SYan Zheng n = n->rb_right; 4115d4f98a2SYan Zheng else 4125d4f98a2SYan Zheng return n; 4135d4f98a2SYan Zheng } 4145d4f98a2SYan Zheng return NULL; 4155d4f98a2SYan Zheng } 4165d4f98a2SYan Zheng 41748a3b636SEric Sandeen static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) 41843c04fb1SJeff Mahoney { 41943c04fb1SJeff Mahoney 42043c04fb1SJeff Mahoney struct btrfs_fs_info *fs_info = NULL; 42143c04fb1SJeff Mahoney struct backref_node *bnode = rb_entry(rb_node, struct backref_node, 42243c04fb1SJeff Mahoney rb_node); 42343c04fb1SJeff Mahoney if (bnode->root) 42443c04fb1SJeff Mahoney fs_info = bnode->root->fs_info; 4255d163e0eSJeff Mahoney btrfs_panic(fs_info, errno, 4265d163e0eSJeff Mahoney "Inconsistency in backref cache found at offset %llu", 4275d163e0eSJeff Mahoney bytenr); 42843c04fb1SJeff Mahoney } 42943c04fb1SJeff Mahoney 4305d4f98a2SYan Zheng /* 4315d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 4325d4f98a2SYan Zheng */ 4335d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 4345d4f98a2SYan Zheng struct backref_edge *edges[], 4355d4f98a2SYan Zheng int *index) 4365d4f98a2SYan Zheng { 4375d4f98a2SYan Zheng struct backref_edge *edge; 4385d4f98a2SYan Zheng int idx = *index; 4395d4f98a2SYan Zheng 4405d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4415d4f98a2SYan Zheng edge = list_entry(node->upper.next, 4425d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 4435d4f98a2SYan Zheng edges[idx++] = edge; 4445d4f98a2SYan Zheng node = edge->node[UPPER]; 4455d4f98a2SYan Zheng } 4463fd0a558SYan, Zheng BUG_ON(node->detached); 4475d4f98a2SYan Zheng *index = idx; 4485d4f98a2SYan Zheng return node; 4495d4f98a2SYan Zheng } 4505d4f98a2SYan Zheng 4515d4f98a2SYan Zheng /* 4525d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 4535d4f98a2SYan Zheng */ 4545d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 4555d4f98a2SYan Zheng int *index) 4565d4f98a2SYan Zheng { 4575d4f98a2SYan Zheng struct backref_edge *edge; 4585d4f98a2SYan Zheng struct backref_node *lower; 4595d4f98a2SYan Zheng int idx = *index; 4605d4f98a2SYan Zheng 4615d4f98a2SYan Zheng while (idx > 0) { 4625d4f98a2SYan Zheng edge = edges[idx - 1]; 4635d4f98a2SYan Zheng lower = edge->node[LOWER]; 4645d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 4655d4f98a2SYan Zheng idx--; 4665d4f98a2SYan Zheng continue; 4675d4f98a2SYan Zheng } 4685d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 4695d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 4705d4f98a2SYan Zheng edges[idx - 1] = edge; 4715d4f98a2SYan Zheng *index = idx; 4725d4f98a2SYan Zheng return edge->node[UPPER]; 4735d4f98a2SYan Zheng } 4745d4f98a2SYan Zheng *index = 0; 4755d4f98a2SYan Zheng return NULL; 4765d4f98a2SYan Zheng } 4775d4f98a2SYan Zheng 4783fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 4795d4f98a2SYan Zheng { 4805d4f98a2SYan Zheng if (node->locked) { 4815d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 4825d4f98a2SYan Zheng node->locked = 0; 4835d4f98a2SYan Zheng } 4843fd0a558SYan, Zheng } 4853fd0a558SYan, Zheng 4863fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 4873fd0a558SYan, Zheng { 4883fd0a558SYan, Zheng if (node->eb) { 4893fd0a558SYan, Zheng unlock_node_buffer(node); 4905d4f98a2SYan Zheng free_extent_buffer(node->eb); 4915d4f98a2SYan Zheng node->eb = NULL; 4925d4f98a2SYan Zheng } 4935d4f98a2SYan Zheng } 4945d4f98a2SYan Zheng 4955d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 4965d4f98a2SYan Zheng struct backref_node *node) 4975d4f98a2SYan Zheng { 4985d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 4995d4f98a2SYan Zheng 5005d4f98a2SYan Zheng drop_node_buffer(node); 5013fd0a558SYan, Zheng list_del(&node->list); 5025d4f98a2SYan Zheng list_del(&node->lower); 5033fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 5045d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 5053fd0a558SYan, Zheng free_backref_node(tree, node); 5065d4f98a2SYan Zheng } 5075d4f98a2SYan Zheng 5085d4f98a2SYan Zheng /* 5095d4f98a2SYan Zheng * remove a backref node from the backref cache 5105d4f98a2SYan Zheng */ 5115d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 5125d4f98a2SYan Zheng struct backref_node *node) 5135d4f98a2SYan Zheng { 5145d4f98a2SYan Zheng struct backref_node *upper; 5155d4f98a2SYan Zheng struct backref_edge *edge; 5165d4f98a2SYan Zheng 5175d4f98a2SYan Zheng if (!node) 5185d4f98a2SYan Zheng return; 5195d4f98a2SYan Zheng 5203fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 5215d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 5225d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 5235d4f98a2SYan Zheng list[LOWER]); 5245d4f98a2SYan Zheng upper = edge->node[UPPER]; 5255d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 5265d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 5273fd0a558SYan, Zheng free_backref_edge(cache, edge); 5283fd0a558SYan, Zheng 5293fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 5303fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 5313fd0a558SYan, Zheng drop_backref_node(cache, node); 5323fd0a558SYan, Zheng node = upper; 5333fd0a558SYan, Zheng node->lowest = 1; 5343fd0a558SYan, Zheng continue; 5353fd0a558SYan, Zheng } 5365d4f98a2SYan Zheng /* 5373fd0a558SYan, Zheng * add the node to leaf node list if no other 5385d4f98a2SYan Zheng * child block cached. 5395d4f98a2SYan Zheng */ 5405d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 5413fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 5425d4f98a2SYan Zheng upper->lowest = 1; 5435d4f98a2SYan Zheng } 5445d4f98a2SYan Zheng } 5453fd0a558SYan, Zheng 5465d4f98a2SYan Zheng drop_backref_node(cache, node); 5475d4f98a2SYan Zheng } 5485d4f98a2SYan Zheng 5493fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 5503fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 5513fd0a558SYan, Zheng { 5523fd0a558SYan, Zheng struct rb_node *rb_node; 5533fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 5543fd0a558SYan, Zheng node->bytenr = bytenr; 5553fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 55643c04fb1SJeff Mahoney if (rb_node) 55743c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, bytenr); 5583fd0a558SYan, Zheng } 5593fd0a558SYan, Zheng 5603fd0a558SYan, Zheng /* 5613fd0a558SYan, Zheng * update backref cache after a transaction commit 5623fd0a558SYan, Zheng */ 5633fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 5643fd0a558SYan, Zheng struct backref_cache *cache) 5653fd0a558SYan, Zheng { 5663fd0a558SYan, Zheng struct backref_node *node; 5673fd0a558SYan, Zheng int level = 0; 5683fd0a558SYan, Zheng 5693fd0a558SYan, Zheng if (cache->last_trans == 0) { 5703fd0a558SYan, Zheng cache->last_trans = trans->transid; 5713fd0a558SYan, Zheng return 0; 5723fd0a558SYan, Zheng } 5733fd0a558SYan, Zheng 5743fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 5753fd0a558SYan, Zheng return 0; 5763fd0a558SYan, Zheng 5773fd0a558SYan, Zheng /* 5783fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 5793fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 5803fd0a558SYan, Zheng * so the detached nodes are no longer useful. 5813fd0a558SYan, Zheng */ 5823fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 5833fd0a558SYan, Zheng node = list_entry(cache->detached.next, 5843fd0a558SYan, Zheng struct backref_node, list); 5853fd0a558SYan, Zheng remove_backref_node(cache, node); 5863fd0a558SYan, Zheng } 5873fd0a558SYan, Zheng 5883fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 5893fd0a558SYan, Zheng node = list_entry(cache->changed.next, 5903fd0a558SYan, Zheng struct backref_node, list); 5913fd0a558SYan, Zheng list_del_init(&node->list); 5923fd0a558SYan, Zheng BUG_ON(node->pending); 5933fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5943fd0a558SYan, Zheng } 5953fd0a558SYan, Zheng 5963fd0a558SYan, Zheng /* 5973fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 5983fd0a558SYan, Zheng * errors during processing the pending nodes. 5993fd0a558SYan, Zheng */ 6003fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 6013fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 6023fd0a558SYan, Zheng BUG_ON(!node->pending); 6033fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 6043fd0a558SYan, Zheng continue; 6053fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 6063fd0a558SYan, Zheng } 6073fd0a558SYan, Zheng } 6083fd0a558SYan, Zheng 6093fd0a558SYan, Zheng cache->last_trans = 0; 6103fd0a558SYan, Zheng return 1; 6113fd0a558SYan, Zheng } 6123fd0a558SYan, Zheng 6136282675eSQu Wenruo static bool reloc_root_is_dead(struct btrfs_root *root) 6146282675eSQu Wenruo { 6156282675eSQu Wenruo /* 6166282675eSQu Wenruo * Pair with set_bit/clear_bit in clean_dirty_subvols and 6176282675eSQu Wenruo * btrfs_update_reloc_root. We need to see the updated bit before 6186282675eSQu Wenruo * trying to access reloc_root 6196282675eSQu Wenruo */ 6206282675eSQu Wenruo smp_rmb(); 6216282675eSQu Wenruo if (test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state)) 6226282675eSQu Wenruo return true; 6236282675eSQu Wenruo return false; 6246282675eSQu Wenruo } 6256282675eSQu Wenruo 6266282675eSQu Wenruo /* 6276282675eSQu Wenruo * Check if this subvolume tree has valid reloc tree. 6286282675eSQu Wenruo * 6296282675eSQu Wenruo * Reloc tree after swap is considered dead, thus not considered as valid. 6306282675eSQu Wenruo * This is enough for most callers, as they don't distinguish dead reloc root 6316282675eSQu Wenruo * from no reloc root. But should_ignore_root() below is a special case. 6326282675eSQu Wenruo */ 6336282675eSQu Wenruo static bool have_reloc_root(struct btrfs_root *root) 6346282675eSQu Wenruo { 6356282675eSQu Wenruo if (reloc_root_is_dead(root)) 6366282675eSQu Wenruo return false; 6376282675eSQu Wenruo if (!root->reloc_root) 6386282675eSQu Wenruo return false; 6396282675eSQu Wenruo return true; 6406282675eSQu Wenruo } 641f2a97a9dSDavid Sterba 6423fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 6433fd0a558SYan, Zheng { 6443fd0a558SYan, Zheng struct btrfs_root *reloc_root; 6453fd0a558SYan, Zheng 64627cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 6473fd0a558SYan, Zheng return 0; 6483fd0a558SYan, Zheng 6496282675eSQu Wenruo /* This root has been merged with its reloc tree, we can ignore it */ 6506282675eSQu Wenruo if (reloc_root_is_dead(root)) 6516282675eSQu Wenruo return 1; 6526282675eSQu Wenruo 6533fd0a558SYan, Zheng reloc_root = root->reloc_root; 6543fd0a558SYan, Zheng if (!reloc_root) 6553fd0a558SYan, Zheng return 0; 6563fd0a558SYan, Zheng 6574d4225fcSJosef Bacik if (btrfs_header_generation(reloc_root->commit_root) == 6584d4225fcSJosef Bacik root->fs_info->running_transaction->transid) 6593fd0a558SYan, Zheng return 0; 6603fd0a558SYan, Zheng /* 6613fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 6623fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 6633fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 6643fd0a558SYan, Zheng * relocation. 6653fd0a558SYan, Zheng */ 6663fd0a558SYan, Zheng return 1; 6673fd0a558SYan, Zheng } 6685d4f98a2SYan Zheng /* 6695d4f98a2SYan Zheng * find reloc tree by address of tree root 6705d4f98a2SYan Zheng */ 6712433bea5SQu Wenruo struct btrfs_root *find_reloc_root(struct btrfs_fs_info *fs_info, u64 bytenr) 6725d4f98a2SYan Zheng { 6732433bea5SQu Wenruo struct reloc_control *rc = fs_info->reloc_ctl; 6745d4f98a2SYan Zheng struct rb_node *rb_node; 6755d4f98a2SYan Zheng struct mapping_node *node; 6765d4f98a2SYan Zheng struct btrfs_root *root = NULL; 6775d4f98a2SYan Zheng 6782433bea5SQu Wenruo ASSERT(rc); 6795d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 6805d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 6815d4f98a2SYan Zheng if (rb_node) { 6825d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 6835d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 6845d4f98a2SYan Zheng } 6855d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 68600246528SJosef Bacik return btrfs_grab_root(root); 6875d4f98a2SYan Zheng } 6885d4f98a2SYan Zheng 6895d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 6905d4f98a2SYan Zheng u64 root_objectid) 6915d4f98a2SYan Zheng { 6925d4f98a2SYan Zheng struct btrfs_key key; 6935d4f98a2SYan Zheng 6945d4f98a2SYan Zheng key.objectid = root_objectid; 6955d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 6965d4f98a2SYan Zheng key.offset = (u64)-1; 6975d4f98a2SYan Zheng 698bc44d7c4SJosef Bacik return btrfs_get_fs_root(fs_info, &key, false); 6995d4f98a2SYan Zheng } 7005d4f98a2SYan Zheng 7015d4f98a2SYan Zheng /* 7024007ea87SQu Wenruo * Handle direct tree backref 7034007ea87SQu Wenruo * 7044007ea87SQu Wenruo * Direct tree backref means, the backref item shows its parent bytenr 7054007ea87SQu Wenruo * directly. This is for SHARED_BLOCK_REF backref (keyed or inlined). 7064007ea87SQu Wenruo * 7074007ea87SQu Wenruo * @ref_key: The converted backref key. 7084007ea87SQu Wenruo * For keyed backref, it's the item key. 7094007ea87SQu Wenruo * For inlined backref, objectid is the bytenr, 7104007ea87SQu Wenruo * type is btrfs_inline_ref_type, offset is 7114007ea87SQu Wenruo * btrfs_inline_ref_offset. 7124007ea87SQu Wenruo */ 7134007ea87SQu Wenruo static int handle_direct_tree_backref(struct backref_cache *cache, 7144007ea87SQu Wenruo struct btrfs_key *ref_key, 7154007ea87SQu Wenruo struct backref_node *cur) 7164007ea87SQu Wenruo { 7174007ea87SQu Wenruo struct backref_edge *edge; 7184007ea87SQu Wenruo struct backref_node *upper; 7194007ea87SQu Wenruo struct rb_node *rb_node; 7204007ea87SQu Wenruo 7214007ea87SQu Wenruo ASSERT(ref_key->type == BTRFS_SHARED_BLOCK_REF_KEY); 7224007ea87SQu Wenruo 7234007ea87SQu Wenruo /* Only reloc root uses backref pointing to itself */ 7244007ea87SQu Wenruo if (ref_key->objectid == ref_key->offset) { 7254007ea87SQu Wenruo struct btrfs_root *root; 7264007ea87SQu Wenruo 7274007ea87SQu Wenruo cur->is_reloc_root = 1; 7284007ea87SQu Wenruo /* Only reloc backref cache cares about a specific root */ 7294007ea87SQu Wenruo if (cache->is_reloc) { 7304007ea87SQu Wenruo root = find_reloc_root(cache->fs_info, cur->bytenr); 7314007ea87SQu Wenruo if (WARN_ON(!root)) 7324007ea87SQu Wenruo return -ENOENT; 7334007ea87SQu Wenruo cur->root = root; 7344007ea87SQu Wenruo } else { 7354007ea87SQu Wenruo /* 7364007ea87SQu Wenruo * For generic purpose backref cache, reloc root node 7374007ea87SQu Wenruo * is useless. 7384007ea87SQu Wenruo */ 7394007ea87SQu Wenruo list_add(&cur->list, &cache->useless_node); 7404007ea87SQu Wenruo } 7414007ea87SQu Wenruo return 0; 7424007ea87SQu Wenruo } 7434007ea87SQu Wenruo 7444007ea87SQu Wenruo edge = alloc_backref_edge(cache); 7454007ea87SQu Wenruo if (!edge) 7464007ea87SQu Wenruo return -ENOMEM; 7474007ea87SQu Wenruo 7484007ea87SQu Wenruo rb_node = tree_search(&cache->rb_root, ref_key->offset); 7494007ea87SQu Wenruo if (!rb_node) { 7504007ea87SQu Wenruo /* Parent node not yet cached */ 7514007ea87SQu Wenruo upper = alloc_backref_node(cache); 7524007ea87SQu Wenruo if (!upper) { 7534007ea87SQu Wenruo free_backref_edge(cache, edge); 7544007ea87SQu Wenruo return -ENOMEM; 7554007ea87SQu Wenruo } 7564007ea87SQu Wenruo upper->bytenr = ref_key->offset; 7574007ea87SQu Wenruo upper->level = cur->level + 1; 7584007ea87SQu Wenruo 7594007ea87SQu Wenruo /* 7604007ea87SQu Wenruo * Backrefs for the upper level block isn't cached, add the 7614007ea87SQu Wenruo * block to pending list 7624007ea87SQu Wenruo */ 7634007ea87SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 7644007ea87SQu Wenruo } else { 7654007ea87SQu Wenruo /* Parent node already cached */ 7664007ea87SQu Wenruo upper = rb_entry(rb_node, struct backref_node, rb_node); 7674007ea87SQu Wenruo ASSERT(upper->checked); 7684007ea87SQu Wenruo INIT_LIST_HEAD(&edge->list[UPPER]); 7694007ea87SQu Wenruo } 7704007ea87SQu Wenruo list_add_tail(&edge->list[LOWER], &cur->upper); 7714007ea87SQu Wenruo edge->node[LOWER] = cur; 7724007ea87SQu Wenruo edge->node[UPPER] = upper; 7734007ea87SQu Wenruo return 0; 7744007ea87SQu Wenruo } 7754007ea87SQu Wenruo 7764007ea87SQu Wenruo /* 7774d81ea8bSQu Wenruo * Handle indirect tree backref 7784d81ea8bSQu Wenruo * 7794d81ea8bSQu Wenruo * Indirect tree backref means, we only know which tree the node belongs to. 7804d81ea8bSQu Wenruo * We still need to do a tree search to find out the parents. This is for 7814d81ea8bSQu Wenruo * TREE_BLOCK_REF backref (keyed or inlined). 7824d81ea8bSQu Wenruo * 7834d81ea8bSQu Wenruo * @ref_key: The same as @ref_key in handle_direct_tree_backref() 7844d81ea8bSQu Wenruo * @tree_key: The first key of this tree block. 7854d81ea8bSQu Wenruo * @path: A clean (released) path, to avoid allocating path everytime 7864d81ea8bSQu Wenruo * the function get called. 7874d81ea8bSQu Wenruo */ 7884d81ea8bSQu Wenruo static int handle_indirect_tree_backref(struct backref_cache *cache, 7894d81ea8bSQu Wenruo struct btrfs_path *path, 7904d81ea8bSQu Wenruo struct btrfs_key *ref_key, 7914d81ea8bSQu Wenruo struct btrfs_key *tree_key, 7924d81ea8bSQu Wenruo struct backref_node *cur) 7934d81ea8bSQu Wenruo { 7944d81ea8bSQu Wenruo struct btrfs_fs_info *fs_info = cache->fs_info; 7954d81ea8bSQu Wenruo struct backref_node *upper; 7964d81ea8bSQu Wenruo struct backref_node *lower; 7974d81ea8bSQu Wenruo struct backref_edge *edge; 7984d81ea8bSQu Wenruo struct extent_buffer *eb; 7994d81ea8bSQu Wenruo struct btrfs_root *root; 8004d81ea8bSQu Wenruo struct rb_node *rb_node; 8014d81ea8bSQu Wenruo int level; 8024d81ea8bSQu Wenruo bool need_check = true; 8034d81ea8bSQu Wenruo int ret; 8044d81ea8bSQu Wenruo 8054d81ea8bSQu Wenruo root = read_fs_root(fs_info, ref_key->offset); 8064d81ea8bSQu Wenruo if (IS_ERR(root)) 8074d81ea8bSQu Wenruo return PTR_ERR(root); 8084d81ea8bSQu Wenruo if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 8094d81ea8bSQu Wenruo cur->cowonly = 1; 8104d81ea8bSQu Wenruo 8114d81ea8bSQu Wenruo if (btrfs_root_level(&root->root_item) == cur->level) { 8124d81ea8bSQu Wenruo /* Tree root */ 8134d81ea8bSQu Wenruo ASSERT(btrfs_root_bytenr(&root->root_item) == cur->bytenr); 8144d81ea8bSQu Wenruo if (should_ignore_root(root)) { 8154d81ea8bSQu Wenruo btrfs_put_root(root); 8164d81ea8bSQu Wenruo list_add(&cur->list, &cache->useless_node); 8174d81ea8bSQu Wenruo } else { 8184d81ea8bSQu Wenruo cur->root = root; 8194d81ea8bSQu Wenruo } 8204d81ea8bSQu Wenruo return 0; 8214d81ea8bSQu Wenruo } 8224d81ea8bSQu Wenruo 8234d81ea8bSQu Wenruo level = cur->level + 1; 8244d81ea8bSQu Wenruo 8254d81ea8bSQu Wenruo /* Search the tree to find parent blocks referring to the block */ 8264d81ea8bSQu Wenruo path->search_commit_root = 1; 8274d81ea8bSQu Wenruo path->skip_locking = 1; 8284d81ea8bSQu Wenruo path->lowest_level = level; 8294d81ea8bSQu Wenruo ret = btrfs_search_slot(NULL, root, tree_key, path, 0, 0); 8304d81ea8bSQu Wenruo path->lowest_level = 0; 8314d81ea8bSQu Wenruo if (ret < 0) { 8324d81ea8bSQu Wenruo btrfs_put_root(root); 8334d81ea8bSQu Wenruo return ret; 8344d81ea8bSQu Wenruo } 8354d81ea8bSQu Wenruo if (ret > 0 && path->slots[level] > 0) 8364d81ea8bSQu Wenruo path->slots[level]--; 8374d81ea8bSQu Wenruo 8384d81ea8bSQu Wenruo eb = path->nodes[level]; 8394d81ea8bSQu Wenruo if (btrfs_node_blockptr(eb, path->slots[level]) != cur->bytenr) { 8404d81ea8bSQu Wenruo btrfs_err(fs_info, 8414d81ea8bSQu Wenruo "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)", 8424d81ea8bSQu Wenruo cur->bytenr, level - 1, root->root_key.objectid, 8434d81ea8bSQu Wenruo tree_key->objectid, tree_key->type, tree_key->offset); 8444d81ea8bSQu Wenruo btrfs_put_root(root); 8454d81ea8bSQu Wenruo ret = -ENOENT; 8464d81ea8bSQu Wenruo goto out; 8474d81ea8bSQu Wenruo } 8484d81ea8bSQu Wenruo lower = cur; 8494d81ea8bSQu Wenruo 8504d81ea8bSQu Wenruo /* Add all nodes and edges in the path */ 8514d81ea8bSQu Wenruo for (; level < BTRFS_MAX_LEVEL; level++) { 8524d81ea8bSQu Wenruo if (!path->nodes[level]) { 8534d81ea8bSQu Wenruo ASSERT(btrfs_root_bytenr(&root->root_item) == 8544d81ea8bSQu Wenruo lower->bytenr); 8554d81ea8bSQu Wenruo if (should_ignore_root(root)) { 8564d81ea8bSQu Wenruo btrfs_put_root(root); 8574d81ea8bSQu Wenruo list_add(&lower->list, &cache->useless_node); 8584d81ea8bSQu Wenruo } else { 8594d81ea8bSQu Wenruo lower->root = root; 8604d81ea8bSQu Wenruo } 8614d81ea8bSQu Wenruo break; 8624d81ea8bSQu Wenruo } 8634d81ea8bSQu Wenruo 8644d81ea8bSQu Wenruo edge = alloc_backref_edge(cache); 8654d81ea8bSQu Wenruo if (!edge) { 8664d81ea8bSQu Wenruo btrfs_put_root(root); 8674d81ea8bSQu Wenruo ret = -ENOMEM; 8684d81ea8bSQu Wenruo goto out; 8694d81ea8bSQu Wenruo } 8704d81ea8bSQu Wenruo 8714d81ea8bSQu Wenruo eb = path->nodes[level]; 8724d81ea8bSQu Wenruo rb_node = tree_search(&cache->rb_root, eb->start); 8734d81ea8bSQu Wenruo if (!rb_node) { 8744d81ea8bSQu Wenruo upper = alloc_backref_node(cache); 8754d81ea8bSQu Wenruo if (!upper) { 8764d81ea8bSQu Wenruo btrfs_put_root(root); 8774d81ea8bSQu Wenruo free_backref_edge(cache, edge); 8784d81ea8bSQu Wenruo ret = -ENOMEM; 8794d81ea8bSQu Wenruo goto out; 8804d81ea8bSQu Wenruo } 8814d81ea8bSQu Wenruo upper->bytenr = eb->start; 8824d81ea8bSQu Wenruo upper->owner = btrfs_header_owner(eb); 8834d81ea8bSQu Wenruo upper->level = lower->level + 1; 8844d81ea8bSQu Wenruo if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 8854d81ea8bSQu Wenruo upper->cowonly = 1; 8864d81ea8bSQu Wenruo 8874d81ea8bSQu Wenruo /* 8884d81ea8bSQu Wenruo * If we know the block isn't shared we can avoid 8894d81ea8bSQu Wenruo * checking its backrefs. 8904d81ea8bSQu Wenruo */ 8914d81ea8bSQu Wenruo if (btrfs_block_can_be_shared(root, eb)) 8924d81ea8bSQu Wenruo upper->checked = 0; 8934d81ea8bSQu Wenruo else 8944d81ea8bSQu Wenruo upper->checked = 1; 8954d81ea8bSQu Wenruo 8964d81ea8bSQu Wenruo /* 8974d81ea8bSQu Wenruo * Add the block to pending list if we need to check its 8984d81ea8bSQu Wenruo * backrefs, we only do this once while walking up a 8994d81ea8bSQu Wenruo * tree as we will catch anything else later on. 9004d81ea8bSQu Wenruo */ 9014d81ea8bSQu Wenruo if (!upper->checked && need_check) { 9024d81ea8bSQu Wenruo need_check = false; 9034d81ea8bSQu Wenruo list_add_tail(&edge->list[UPPER], 9044d81ea8bSQu Wenruo &cache->pending_edge); 9054d81ea8bSQu Wenruo } else { 9064d81ea8bSQu Wenruo if (upper->checked) 9074d81ea8bSQu Wenruo need_check = true; 9084d81ea8bSQu Wenruo INIT_LIST_HEAD(&edge->list[UPPER]); 9094d81ea8bSQu Wenruo } 9104d81ea8bSQu Wenruo } else { 9114d81ea8bSQu Wenruo upper = rb_entry(rb_node, struct backref_node, rb_node); 9124d81ea8bSQu Wenruo ASSERT(upper->checked); 9134d81ea8bSQu Wenruo INIT_LIST_HEAD(&edge->list[UPPER]); 9144d81ea8bSQu Wenruo if (!upper->owner) 9154d81ea8bSQu Wenruo upper->owner = btrfs_header_owner(eb); 9164d81ea8bSQu Wenruo } 9174d81ea8bSQu Wenruo list_add_tail(&edge->list[LOWER], &lower->upper); 9184d81ea8bSQu Wenruo edge->node[LOWER] = lower; 9194d81ea8bSQu Wenruo edge->node[UPPER] = upper; 9204d81ea8bSQu Wenruo 9214d81ea8bSQu Wenruo if (rb_node) { 9224d81ea8bSQu Wenruo btrfs_put_root(root); 9234d81ea8bSQu Wenruo break; 9244d81ea8bSQu Wenruo } 9254d81ea8bSQu Wenruo lower = upper; 9264d81ea8bSQu Wenruo upper = NULL; 9274d81ea8bSQu Wenruo } 9284d81ea8bSQu Wenruo out: 9294d81ea8bSQu Wenruo btrfs_release_path(path); 9304d81ea8bSQu Wenruo return ret; 9314d81ea8bSQu Wenruo } 9324d81ea8bSQu Wenruo 9334d81ea8bSQu Wenruo /* 9345d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 9355d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 9365d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 9375d4f98a2SYan Zheng * 9385d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 93901327610SNicholas D Steeves * to find upper level blocks that reference the block, and then check 94001327610SNicholas D Steeves * backrefs of these upper level blocks recursively. the recursion stop 9415d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 9425d4f98a2SYan Zheng * 9435d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 9445d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 9455d4f98a2SYan Zheng * block are also cached. 9465d4f98a2SYan Zheng */ 9473fd0a558SYan, Zheng static noinline_for_stack 9483fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 9495d4f98a2SYan Zheng struct btrfs_key *node_key, 9505d4f98a2SYan Zheng int level, u64 bytenr) 9515d4f98a2SYan Zheng { 95271f572a9SQu Wenruo struct btrfs_backref_iter *iter; 9533fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 95471f572a9SQu Wenruo /* For searching parent of TREE_BLOCK_REF */ 95571f572a9SQu Wenruo struct btrfs_path *path; 9565d4f98a2SYan Zheng struct backref_node *cur; 9575d4f98a2SYan Zheng struct backref_node *upper; 9585d4f98a2SYan Zheng struct backref_node *lower; 9595d4f98a2SYan Zheng struct backref_node *node = NULL; 9605d4f98a2SYan Zheng struct backref_node *exist = NULL; 9615d4f98a2SYan Zheng struct backref_edge *edge; 9625d4f98a2SYan Zheng struct rb_node *rb_node; 9633fd0a558SYan, Zheng int cowonly; 9645d4f98a2SYan Zheng int ret; 9655d4f98a2SYan Zheng int err = 0; 9665d4f98a2SYan Zheng 96771f572a9SQu Wenruo iter = btrfs_backref_iter_alloc(rc->extent_root->fs_info, GFP_NOFS); 96871f572a9SQu Wenruo if (!iter) 96971f572a9SQu Wenruo return ERR_PTR(-ENOMEM); 97071f572a9SQu Wenruo path = btrfs_alloc_path(); 97171f572a9SQu Wenruo if (!path) { 9725d4f98a2SYan Zheng err = -ENOMEM; 9735d4f98a2SYan Zheng goto out; 9745d4f98a2SYan Zheng } 9755d4f98a2SYan Zheng 9763fd0a558SYan, Zheng node = alloc_backref_node(cache); 9775d4f98a2SYan Zheng if (!node) { 9785d4f98a2SYan Zheng err = -ENOMEM; 9795d4f98a2SYan Zheng goto out; 9805d4f98a2SYan Zheng } 9815d4f98a2SYan Zheng 9825d4f98a2SYan Zheng node->bytenr = bytenr; 9835d4f98a2SYan Zheng node->level = level; 9845d4f98a2SYan Zheng node->lowest = 1; 9855d4f98a2SYan Zheng cur = node; 9865d4f98a2SYan Zheng again: 98771f572a9SQu Wenruo ret = btrfs_backref_iter_start(iter, cur->bytenr); 9885d4f98a2SYan Zheng if (ret < 0) { 9895d4f98a2SYan Zheng err = ret; 9905d4f98a2SYan Zheng goto out; 9915d4f98a2SYan Zheng } 9925d4f98a2SYan Zheng 99371f572a9SQu Wenruo /* 99471f572a9SQu Wenruo * We skip the first btrfs_tree_block_info, as we don't use the key 99571f572a9SQu Wenruo * stored in it, but fetch it from the tree block 99671f572a9SQu Wenruo */ 99771f572a9SQu Wenruo if (btrfs_backref_has_tree_block_info(iter)) { 99871f572a9SQu Wenruo ret = btrfs_backref_iter_next(iter); 99971f572a9SQu Wenruo if (ret < 0) { 100071f572a9SQu Wenruo err = ret; 100171f572a9SQu Wenruo goto out; 100271f572a9SQu Wenruo } 100371f572a9SQu Wenruo /* No extra backref? This means the tree block is corrupted */ 100471f572a9SQu Wenruo if (ret > 0) { 100571f572a9SQu Wenruo err = -EUCLEAN; 100671f572a9SQu Wenruo goto out; 100771f572a9SQu Wenruo } 100871f572a9SQu Wenruo } 10095d4f98a2SYan Zheng WARN_ON(cur->checked); 10105d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 10115d4f98a2SYan Zheng /* 101270f23fd6SJustin P. Mattock * the backref was added previously when processing 10135d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 10145d4f98a2SYan Zheng */ 101575bfb9afSJosef Bacik ASSERT(list_is_singular(&cur->upper)); 10165d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 10175d4f98a2SYan Zheng list[LOWER]); 101875bfb9afSJosef Bacik ASSERT(list_empty(&edge->list[UPPER])); 10195d4f98a2SYan Zheng exist = edge->node[UPPER]; 10205d4f98a2SYan Zheng /* 10215d4f98a2SYan Zheng * add the upper level block to pending list if we need 10225d4f98a2SYan Zheng * check its backrefs 10235d4f98a2SYan Zheng */ 10245d4f98a2SYan Zheng if (!exist->checked) 102584780289SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 10265d4f98a2SYan Zheng } else { 10275d4f98a2SYan Zheng exist = NULL; 10285d4f98a2SYan Zheng } 10295d4f98a2SYan Zheng 103071f572a9SQu Wenruo for (; ret == 0; ret = btrfs_backref_iter_next(iter)) { 103171f572a9SQu Wenruo struct extent_buffer *eb; 103271f572a9SQu Wenruo struct btrfs_key key; 10333de28d57SLiu Bo int type; 103471f572a9SQu Wenruo 103571f572a9SQu Wenruo cond_resched(); 103671f572a9SQu Wenruo eb = btrfs_backref_get_eb(iter); 103771f572a9SQu Wenruo 103871f572a9SQu Wenruo key.objectid = iter->bytenr; 103971f572a9SQu Wenruo if (btrfs_backref_iter_is_inline_ref(iter)) { 104071f572a9SQu Wenruo struct btrfs_extent_inline_ref *iref; 104171f572a9SQu Wenruo 104271f572a9SQu Wenruo /* update key for inline back ref */ 104371f572a9SQu Wenruo iref = (struct btrfs_extent_inline_ref *) 104471f572a9SQu Wenruo ((unsigned long)iter->cur_ptr); 10453de28d57SLiu Bo type = btrfs_get_extent_inline_ref_type(eb, iref, 10463de28d57SLiu Bo BTRFS_REF_TYPE_BLOCK); 10473de28d57SLiu Bo if (type == BTRFS_REF_TYPE_INVALID) { 1048af431dcbSSu Yue err = -EUCLEAN; 10493de28d57SLiu Bo goto out; 10503de28d57SLiu Bo } 10513de28d57SLiu Bo key.type = type; 10525d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 105371f572a9SQu Wenruo } else { 105471f572a9SQu Wenruo key.type = iter->cur_key.type; 105571f572a9SQu Wenruo key.offset = iter->cur_key.offset; 10565d4f98a2SYan Zheng } 10575d4f98a2SYan Zheng 1058fa6ac715SQu Wenruo /* 1059fa6ac715SQu Wenruo * Parent node found and matches current inline ref, no need to 1060fa6ac715SQu Wenruo * rebuild this node for this inline ref. 1061fa6ac715SQu Wenruo */ 10625d4f98a2SYan Zheng if (exist && 10635d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 10645d4f98a2SYan Zheng exist->owner == key.offset) || 10655d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 10665d4f98a2SYan Zheng exist->bytenr == key.offset))) { 10675d4f98a2SYan Zheng exist = NULL; 106871f572a9SQu Wenruo continue; 10695d4f98a2SYan Zheng } 10705d4f98a2SYan Zheng 1071fa6ac715SQu Wenruo /* SHARED_BLOCK_REF means key.offset is the parent bytenr */ 10725d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 10734007ea87SQu Wenruo ret = handle_direct_tree_backref(cache, &key, cur); 10744007ea87SQu Wenruo if (ret < 0) { 10754007ea87SQu Wenruo err = ret; 10762433bea5SQu Wenruo goto out; 10772433bea5SQu Wenruo } 107871f572a9SQu Wenruo continue; 10796d8ff4e4SDavid Sterba } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) { 1080ba3c2b19SNikolay Borisov err = -EINVAL; 1081ba3c2b19SNikolay Borisov btrfs_print_v0_err(rc->extent_root->fs_info); 1082ba3c2b19SNikolay Borisov btrfs_handle_fs_error(rc->extent_root->fs_info, err, 1083ba3c2b19SNikolay Borisov NULL); 1084ba3c2b19SNikolay Borisov goto out; 10855d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 108671f572a9SQu Wenruo continue; 10875d4f98a2SYan Zheng } 10885d4f98a2SYan Zheng 1089fa6ac715SQu Wenruo /* 1090fa6ac715SQu Wenruo * key.type == BTRFS_TREE_BLOCK_REF_KEY, inline ref offset 1091fa6ac715SQu Wenruo * means the root objectid. We need to search the tree to get 1092fa6ac715SQu Wenruo * its parent bytenr. 1093fa6ac715SQu Wenruo */ 10944d81ea8bSQu Wenruo ret = handle_indirect_tree_backref(cache, path, &key, node_key, 10954d81ea8bSQu Wenruo cur); 10965d4f98a2SYan Zheng if (ret < 0) { 10975d4f98a2SYan Zheng err = ret; 10985d4f98a2SYan Zheng goto out; 10995d4f98a2SYan Zheng } 11005d4f98a2SYan Zheng } 110171f572a9SQu Wenruo if (ret < 0) { 110271f572a9SQu Wenruo err = ret; 110371f572a9SQu Wenruo goto out; 11045d4f98a2SYan Zheng } 110571f572a9SQu Wenruo ret = 0; 110671f572a9SQu Wenruo btrfs_backref_iter_release(iter); 11075d4f98a2SYan Zheng 11085d4f98a2SYan Zheng cur->checked = 1; 11095d4f98a2SYan Zheng WARN_ON(exist); 11105d4f98a2SYan Zheng 11115d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 111284780289SQu Wenruo if (!list_empty(&cache->pending_edge)) { 111384780289SQu Wenruo edge = list_first_entry(&cache->pending_edge, 111484780289SQu Wenruo struct backref_edge, list[UPPER]); 11155d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 11165d4f98a2SYan Zheng cur = edge->node[UPPER]; 11175d4f98a2SYan Zheng goto again; 11185d4f98a2SYan Zheng } 11195d4f98a2SYan Zheng 11205d4f98a2SYan Zheng /* 11215d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 11225d4f98a2SYan Zheng * into the cache. 11235d4f98a2SYan Zheng */ 112475bfb9afSJosef Bacik ASSERT(node->checked); 11253fd0a558SYan, Zheng cowonly = node->cowonly; 11263fd0a558SYan, Zheng if (!cowonly) { 11273fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 11283fd0a558SYan, Zheng &node->rb_node); 112943c04fb1SJeff Mahoney if (rb_node) 113043c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 11313fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 11323fd0a558SYan, Zheng } 11335d4f98a2SYan Zheng 11345d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 113584780289SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 11365d4f98a2SYan Zheng 113784780289SQu Wenruo while (!list_empty(&cache->pending_edge)) { 113884780289SQu Wenruo edge = list_first_entry(&cache->pending_edge, 113984780289SQu Wenruo struct backref_edge, list[UPPER]); 11405d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 11415d4f98a2SYan Zheng upper = edge->node[UPPER]; 11423fd0a558SYan, Zheng if (upper->detached) { 11433fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11443fd0a558SYan, Zheng lower = edge->node[LOWER]; 11453fd0a558SYan, Zheng free_backref_edge(cache, edge); 11463fd0a558SYan, Zheng if (list_empty(&lower->upper)) 114784780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 11483fd0a558SYan, Zheng continue; 11493fd0a558SYan, Zheng } 11505d4f98a2SYan Zheng 11515d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 11525d4f98a2SYan Zheng if (upper->lowest) { 11535d4f98a2SYan Zheng list_del_init(&upper->lower); 11545d4f98a2SYan Zheng upper->lowest = 0; 11555d4f98a2SYan Zheng } 11565d4f98a2SYan Zheng 11575d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 11585d4f98a2SYan Zheng continue; 11595d4f98a2SYan Zheng } 11605d4f98a2SYan Zheng 116175bfb9afSJosef Bacik if (!upper->checked) { 116275bfb9afSJosef Bacik /* 116375bfb9afSJosef Bacik * Still want to blow up for developers since this is a 116475bfb9afSJosef Bacik * logic bug. 116575bfb9afSJosef Bacik */ 116675bfb9afSJosef Bacik ASSERT(0); 116775bfb9afSJosef Bacik err = -EINVAL; 116875bfb9afSJosef Bacik goto out; 116975bfb9afSJosef Bacik } 117075bfb9afSJosef Bacik if (cowonly != upper->cowonly) { 117175bfb9afSJosef Bacik ASSERT(0); 117275bfb9afSJosef Bacik err = -EINVAL; 117375bfb9afSJosef Bacik goto out; 117475bfb9afSJosef Bacik } 117575bfb9afSJosef Bacik 11763fd0a558SYan, Zheng if (!cowonly) { 11775d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 11785d4f98a2SYan Zheng &upper->rb_node); 117943c04fb1SJeff Mahoney if (rb_node) 118043c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 118143c04fb1SJeff Mahoney upper->bytenr); 11823fd0a558SYan, Zheng } 11835d4f98a2SYan Zheng 11845d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 11855d4f98a2SYan Zheng 11865d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 118784780289SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 11885d4f98a2SYan Zheng } 11893fd0a558SYan, Zheng /* 11903fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 11913fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 11923fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 11933fd0a558SYan, Zheng * lookup. 11943fd0a558SYan, Zheng */ 119584780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 119684780289SQu Wenruo upper = list_first_entry(&cache->useless_node, 119784780289SQu Wenruo struct backref_node, list); 11983fd0a558SYan, Zheng list_del_init(&upper->list); 119975bfb9afSJosef Bacik ASSERT(list_empty(&upper->upper)); 12003fd0a558SYan, Zheng if (upper == node) 12013fd0a558SYan, Zheng node = NULL; 12023fd0a558SYan, Zheng if (upper->lowest) { 12033fd0a558SYan, Zheng list_del_init(&upper->lower); 12043fd0a558SYan, Zheng upper->lowest = 0; 12053fd0a558SYan, Zheng } 12063fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 120784780289SQu Wenruo edge = list_first_entry(&upper->lower, 12083fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 12093fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 12103fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 12113fd0a558SYan, Zheng lower = edge->node[LOWER]; 12123fd0a558SYan, Zheng free_backref_edge(cache, edge); 12133fd0a558SYan, Zheng 12143fd0a558SYan, Zheng if (list_empty(&lower->upper)) 121584780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 12163fd0a558SYan, Zheng } 12179569cc20SQu Wenruo mark_block_processed(rc, upper); 12183fd0a558SYan, Zheng if (upper->level > 0) { 12193fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 12203fd0a558SYan, Zheng upper->detached = 1; 12213fd0a558SYan, Zheng } else { 12223fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 12233fd0a558SYan, Zheng free_backref_node(cache, upper); 12243fd0a558SYan, Zheng } 12253fd0a558SYan, Zheng } 12265d4f98a2SYan Zheng out: 122771f572a9SQu Wenruo btrfs_backref_iter_free(iter); 122871f572a9SQu Wenruo btrfs_free_path(path); 12295d4f98a2SYan Zheng if (err) { 123084780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 123184780289SQu Wenruo lower = list_first_entry(&cache->useless_node, 123275bfb9afSJosef Bacik struct backref_node, list); 123375bfb9afSJosef Bacik list_del_init(&lower->list); 12343fd0a558SYan, Zheng } 123584780289SQu Wenruo while (!list_empty(&cache->pending_edge)) { 123684780289SQu Wenruo edge = list_first_entry(&cache->pending_edge, 123784780289SQu Wenruo struct backref_edge, list[UPPER]); 123875bfb9afSJosef Bacik list_del(&edge->list[UPPER]); 12393fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 124075bfb9afSJosef Bacik lower = edge->node[LOWER]; 12415d4f98a2SYan Zheng upper = edge->node[UPPER]; 12423fd0a558SYan, Zheng free_backref_edge(cache, edge); 124375bfb9afSJosef Bacik 124475bfb9afSJosef Bacik /* 124575bfb9afSJosef Bacik * Lower is no longer linked to any upper backref nodes 124675bfb9afSJosef Bacik * and isn't in the cache, we can free it ourselves. 124775bfb9afSJosef Bacik */ 124875bfb9afSJosef Bacik if (list_empty(&lower->upper) && 124975bfb9afSJosef Bacik RB_EMPTY_NODE(&lower->rb_node)) 125084780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 125175bfb9afSJosef Bacik 125275bfb9afSJosef Bacik if (!RB_EMPTY_NODE(&upper->rb_node)) 125375bfb9afSJosef Bacik continue; 125475bfb9afSJosef Bacik 125501327610SNicholas D Steeves /* Add this guy's upper edges to the list to process */ 125675bfb9afSJosef Bacik list_for_each_entry(edge, &upper->upper, list[LOWER]) 125784780289SQu Wenruo list_add_tail(&edge->list[UPPER], 125884780289SQu Wenruo &cache->pending_edge); 125975bfb9afSJosef Bacik if (list_empty(&upper->upper)) 126084780289SQu Wenruo list_add(&upper->list, &cache->useless_node); 126175bfb9afSJosef Bacik } 126275bfb9afSJosef Bacik 126384780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 126484780289SQu Wenruo lower = list_first_entry(&cache->useless_node, 126575bfb9afSJosef Bacik struct backref_node, list); 126675bfb9afSJosef Bacik list_del_init(&lower->list); 12670fd8c3daSLiu Bo if (lower == node) 12680fd8c3daSLiu Bo node = NULL; 126975bfb9afSJosef Bacik free_backref_node(cache, lower); 12705d4f98a2SYan Zheng } 12710fd8c3daSLiu Bo 12728e19c973SJosef Bacik remove_backref_node(cache, node); 127384780289SQu Wenruo ASSERT(list_empty(&cache->useless_node) && 127484780289SQu Wenruo list_empty(&cache->pending_edge)); 12755d4f98a2SYan Zheng return ERR_PTR(err); 12765d4f98a2SYan Zheng } 127775bfb9afSJosef Bacik ASSERT(!node || !node->detached); 127884780289SQu Wenruo ASSERT(list_empty(&cache->useless_node) && 127984780289SQu Wenruo list_empty(&cache->pending_edge)); 12805d4f98a2SYan Zheng return node; 12815d4f98a2SYan Zheng } 12825d4f98a2SYan Zheng 12835d4f98a2SYan Zheng /* 12843fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 12853fd0a558SYan, Zheng * the backref node is created by cloning backref node that 12863fd0a558SYan, Zheng * corresponds to root of source tree 12873fd0a558SYan, Zheng */ 12883fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 12893fd0a558SYan, Zheng struct reloc_control *rc, 12903fd0a558SYan, Zheng struct btrfs_root *src, 12913fd0a558SYan, Zheng struct btrfs_root *dest) 12923fd0a558SYan, Zheng { 12933fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 12943fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 12953fd0a558SYan, Zheng struct backref_node *node = NULL; 12963fd0a558SYan, Zheng struct backref_node *new_node; 12973fd0a558SYan, Zheng struct backref_edge *edge; 12983fd0a558SYan, Zheng struct backref_edge *new_edge; 12993fd0a558SYan, Zheng struct rb_node *rb_node; 13003fd0a558SYan, Zheng 13013fd0a558SYan, Zheng if (cache->last_trans > 0) 13023fd0a558SYan, Zheng update_backref_cache(trans, cache); 13033fd0a558SYan, Zheng 13043fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 13053fd0a558SYan, Zheng if (rb_node) { 13063fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 13073fd0a558SYan, Zheng if (node->detached) 13083fd0a558SYan, Zheng node = NULL; 13093fd0a558SYan, Zheng else 13103fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 13113fd0a558SYan, Zheng } 13123fd0a558SYan, Zheng 13133fd0a558SYan, Zheng if (!node) { 13143fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 13153fd0a558SYan, Zheng reloc_root->commit_root->start); 13163fd0a558SYan, Zheng if (rb_node) { 13173fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 13183fd0a558SYan, Zheng rb_node); 13193fd0a558SYan, Zheng BUG_ON(node->detached); 13203fd0a558SYan, Zheng } 13213fd0a558SYan, Zheng } 13223fd0a558SYan, Zheng 13233fd0a558SYan, Zheng if (!node) 13243fd0a558SYan, Zheng return 0; 13253fd0a558SYan, Zheng 13263fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 13273fd0a558SYan, Zheng if (!new_node) 13283fd0a558SYan, Zheng return -ENOMEM; 13293fd0a558SYan, Zheng 13303fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 13313fd0a558SYan, Zheng new_node->level = node->level; 13323fd0a558SYan, Zheng new_node->lowest = node->lowest; 13336848ad64SYan, Zheng new_node->checked = 1; 133400246528SJosef Bacik new_node->root = btrfs_grab_root(dest); 13350b530bc5SJosef Bacik ASSERT(new_node->root); 13363fd0a558SYan, Zheng 13373fd0a558SYan, Zheng if (!node->lowest) { 13383fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 13393fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 13403fd0a558SYan, Zheng if (!new_edge) 13413fd0a558SYan, Zheng goto fail; 13423fd0a558SYan, Zheng 13433fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 13443fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 13453fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 13463fd0a558SYan, Zheng &new_node->lower); 13473fd0a558SYan, Zheng } 134876b9e23dSMiao Xie } else { 134976b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 13503fd0a558SYan, Zheng } 13513fd0a558SYan, Zheng 13523fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 13533fd0a558SYan, Zheng &new_node->rb_node); 135443c04fb1SJeff Mahoney if (rb_node) 135543c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 13563fd0a558SYan, Zheng 13573fd0a558SYan, Zheng if (!new_node->lowest) { 13583fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 13593fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 13603fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 13613fd0a558SYan, Zheng } 13623fd0a558SYan, Zheng } 13633fd0a558SYan, Zheng return 0; 13643fd0a558SYan, Zheng fail: 13653fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 13663fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 13673fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 13683fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 13693fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 13703fd0a558SYan, Zheng } 13713fd0a558SYan, Zheng free_backref_node(cache, new_node); 13723fd0a558SYan, Zheng return -ENOMEM; 13733fd0a558SYan, Zheng } 13743fd0a558SYan, Zheng 13753fd0a558SYan, Zheng /* 13765d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 13775d4f98a2SYan Zheng */ 1378ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 13795d4f98a2SYan Zheng { 13800b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 13815d4f98a2SYan Zheng struct rb_node *rb_node; 13825d4f98a2SYan Zheng struct mapping_node *node; 13830b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 13845d4f98a2SYan Zheng 13855d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1386ffd7b339SJeff Mahoney if (!node) 1387ffd7b339SJeff Mahoney return -ENOMEM; 13885d4f98a2SYan Zheng 1389ea287ab1SJosef Bacik node->bytenr = root->commit_root->start; 13905d4f98a2SYan Zheng node->data = root; 13915d4f98a2SYan Zheng 13925d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13935d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13945d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13955d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1396ffd7b339SJeff Mahoney if (rb_node) { 13970b246afaSJeff Mahoney btrfs_panic(fs_info, -EEXIST, 13985d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 13995d163e0eSJeff Mahoney node->bytenr); 1400ffd7b339SJeff Mahoney } 14015d4f98a2SYan Zheng 14025d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 14035d4f98a2SYan Zheng return 0; 14045d4f98a2SYan Zheng } 14055d4f98a2SYan Zheng 14065d4f98a2SYan Zheng /* 1407c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 14085d4f98a2SYan Zheng * mapping 14095d4f98a2SYan Zheng */ 1410c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 14115d4f98a2SYan Zheng { 14120b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14135d4f98a2SYan Zheng struct rb_node *rb_node; 14145d4f98a2SYan Zheng struct mapping_node *node = NULL; 14150b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1416f44deb74SJosef Bacik bool put_ref = false; 14175d4f98a2SYan Zheng 141865c6e82bSQu Wenruo if (rc && root->node) { 14195d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 14205d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1421ea287ab1SJosef Bacik root->commit_root->start); 1422c974c464SWang Shilong if (rb_node) { 1423c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1424c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1425ea287ab1SJosef Bacik RB_CLEAR_NODE(&node->rb_node); 1426c974c464SWang Shilong } 1427c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1428c974c464SWang Shilong if (!node) 1429c974c464SWang Shilong return; 1430c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1431389305b2SQu Wenruo } 1432c974c464SWang Shilong 1433f44deb74SJosef Bacik /* 1434f44deb74SJosef Bacik * We only put the reloc root here if it's on the list. There's a lot 1435f44deb74SJosef Bacik * of places where the pattern is to splice the rc->reloc_roots, process 1436f44deb74SJosef Bacik * the reloc roots, and then add the reloc root back onto 1437f44deb74SJosef Bacik * rc->reloc_roots. If we call __del_reloc_root while it's off of the 1438f44deb74SJosef Bacik * list we don't want the reference being dropped, because the guy 1439f44deb74SJosef Bacik * messing with the list is in charge of the reference. 1440f44deb74SJosef Bacik */ 14410b246afaSJeff Mahoney spin_lock(&fs_info->trans_lock); 1442f44deb74SJosef Bacik if (!list_empty(&root->root_list)) { 1443f44deb74SJosef Bacik put_ref = true; 1444c974c464SWang Shilong list_del_init(&root->root_list); 1445f44deb74SJosef Bacik } 14460b246afaSJeff Mahoney spin_unlock(&fs_info->trans_lock); 1447f44deb74SJosef Bacik if (put_ref) 1448f44deb74SJosef Bacik btrfs_put_root(root); 1449c974c464SWang Shilong kfree(node); 1450c974c464SWang Shilong } 1451c974c464SWang Shilong 1452c974c464SWang Shilong /* 1453c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1454c974c464SWang Shilong * mapping 1455c974c464SWang Shilong */ 1456ea287ab1SJosef Bacik static int __update_reloc_root(struct btrfs_root *root) 1457c974c464SWang Shilong { 14580b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 1459c974c464SWang Shilong struct rb_node *rb_node; 1460c974c464SWang Shilong struct mapping_node *node = NULL; 14610b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1462c974c464SWang Shilong 1463c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1464c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1465ea287ab1SJosef Bacik root->commit_root->start); 14665d4f98a2SYan Zheng if (rb_node) { 14675d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 14685d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 14695d4f98a2SYan Zheng } 14705d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 14715d4f98a2SYan Zheng 14728f71f3e0SLiu Bo if (!node) 14738f71f3e0SLiu Bo return 0; 14745d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 14755d4f98a2SYan Zheng 14765d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1477ea287ab1SJosef Bacik node->bytenr = root->node->start; 14785d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 14795d4f98a2SYan Zheng node->bytenr, &node->rb_node); 14805d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 148143c04fb1SJeff Mahoney if (rb_node) 148243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 14835d4f98a2SYan Zheng return 0; 14845d4f98a2SYan Zheng } 14855d4f98a2SYan Zheng 14863fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 14873fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 14885d4f98a2SYan Zheng { 14890b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14905d4f98a2SYan Zheng struct btrfs_root *reloc_root; 14915d4f98a2SYan Zheng struct extent_buffer *eb; 14925d4f98a2SYan Zheng struct btrfs_root_item *root_item; 14935d4f98a2SYan Zheng struct btrfs_key root_key; 14945d4f98a2SYan Zheng int ret; 14955d4f98a2SYan Zheng 14965d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 14975d4f98a2SYan Zheng BUG_ON(!root_item); 14985d4f98a2SYan Zheng 14995d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 15005d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 15013fd0a558SYan, Zheng root_key.offset = objectid; 15025d4f98a2SYan Zheng 15033fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 1504054570a1SFilipe Manana u64 commit_root_gen; 1505054570a1SFilipe Manana 15063fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 15075d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 15085d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 15095d4f98a2SYan Zheng BUG_ON(ret); 1510054570a1SFilipe Manana /* 1511054570a1SFilipe Manana * Set the last_snapshot field to the generation of the commit 1512054570a1SFilipe Manana * root - like this ctree.c:btrfs_block_can_be_shared() behaves 1513054570a1SFilipe Manana * correctly (returns true) when the relocation root is created 1514054570a1SFilipe Manana * either inside the critical section of a transaction commit 1515054570a1SFilipe Manana * (through transaction.c:qgroup_account_snapshot()) and when 1516054570a1SFilipe Manana * it's created before the transaction commit is started. 1517054570a1SFilipe Manana */ 1518054570a1SFilipe Manana commit_root_gen = btrfs_header_generation(root->commit_root); 1519054570a1SFilipe Manana btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); 15203fd0a558SYan, Zheng } else { 15213fd0a558SYan, Zheng /* 15223fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 15233fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 15243fd0a558SYan, Zheng * modified after it was created have RELOC flag 15253fd0a558SYan, Zheng * set in their headers. so it's OK to not update 15263fd0a558SYan, Zheng * the 'last_snapshot'. 15273fd0a558SYan, Zheng */ 15283fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 15293fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 15303fd0a558SYan, Zheng BUG_ON(ret); 15313fd0a558SYan, Zheng } 15323fd0a558SYan, Zheng 15335d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 15345d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 15355d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 15365d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 15373fd0a558SYan, Zheng 15383fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 15393fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 15403fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 15413fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 15425d4f98a2SYan Zheng root_item->drop_level = 0; 15433fd0a558SYan, Zheng } 15445d4f98a2SYan Zheng 15455d4f98a2SYan Zheng btrfs_tree_unlock(eb); 15465d4f98a2SYan Zheng free_extent_buffer(eb); 15475d4f98a2SYan Zheng 15480b246afaSJeff Mahoney ret = btrfs_insert_root(trans, fs_info->tree_root, 15495d4f98a2SYan Zheng &root_key, root_item); 15505d4f98a2SYan Zheng BUG_ON(ret); 15515d4f98a2SYan Zheng kfree(root_item); 15525d4f98a2SYan Zheng 15533dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(fs_info->tree_root, &root_key); 15545d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 15553dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 15565d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 15573fd0a558SYan, Zheng return reloc_root; 15583fd0a558SYan, Zheng } 15593fd0a558SYan, Zheng 15603fd0a558SYan, Zheng /* 15613fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 15623fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 1563f44deb74SJosef Bacik * 1564f44deb74SJosef Bacik * The reloc_root comes out of here with two references, one for 1565f44deb74SJosef Bacik * root->reloc_root, and another for being on the rc->reloc_roots list. 15663fd0a558SYan, Zheng */ 15673fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 15683fd0a558SYan, Zheng struct btrfs_root *root) 15693fd0a558SYan, Zheng { 15700b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 15713fd0a558SYan, Zheng struct btrfs_root *reloc_root; 15720b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 157320dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 15743fd0a558SYan, Zheng int clear_rsv = 0; 1575ffd7b339SJeff Mahoney int ret; 15763fd0a558SYan, Zheng 1577aec7db3bSJosef Bacik if (!rc) 15782abc726aSJosef Bacik return 0; 15792abc726aSJosef Bacik 15801fac4a54SQu Wenruo /* 15811fac4a54SQu Wenruo * The subvolume has reloc tree but the swap is finished, no need to 15821fac4a54SQu Wenruo * create/update the dead reloc tree 15831fac4a54SQu Wenruo */ 15846282675eSQu Wenruo if (reloc_root_is_dead(root)) 15851fac4a54SQu Wenruo return 0; 15861fac4a54SQu Wenruo 1587aec7db3bSJosef Bacik /* 1588aec7db3bSJosef Bacik * This is subtle but important. We do not do 1589aec7db3bSJosef Bacik * record_root_in_transaction for reloc roots, instead we record their 1590aec7db3bSJosef Bacik * corresponding fs root, and then here we update the last trans for the 1591aec7db3bSJosef Bacik * reloc root. This means that we have to do this for the entire life 1592aec7db3bSJosef Bacik * of the reloc root, regardless of which stage of the relocation we are 1593aec7db3bSJosef Bacik * in. 1594aec7db3bSJosef Bacik */ 15953fd0a558SYan, Zheng if (root->reloc_root) { 15963fd0a558SYan, Zheng reloc_root = root->reloc_root; 15973fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 15983fd0a558SYan, Zheng return 0; 15993fd0a558SYan, Zheng } 16003fd0a558SYan, Zheng 1601aec7db3bSJosef Bacik /* 1602aec7db3bSJosef Bacik * We are merging reloc roots, we do not need new reloc trees. Also 1603aec7db3bSJosef Bacik * reloc trees never need their own reloc tree. 1604aec7db3bSJosef Bacik */ 1605aec7db3bSJosef Bacik if (!rc->create_reloc_tree || 1606aec7db3bSJosef Bacik root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 1607aec7db3bSJosef Bacik return 0; 1608aec7db3bSJosef Bacik 160920dd2cbfSMiao Xie if (!trans->reloc_reserved) { 161020dd2cbfSMiao Xie rsv = trans->block_rsv; 16113fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 16123fd0a558SYan, Zheng clear_rsv = 1; 16133fd0a558SYan, Zheng } 16143fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 16153fd0a558SYan, Zheng if (clear_rsv) 161620dd2cbfSMiao Xie trans->block_rsv = rsv; 16175d4f98a2SYan Zheng 1618ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1619ffd7b339SJeff Mahoney BUG_ON(ret < 0); 1620f44deb74SJosef Bacik root->reloc_root = btrfs_grab_root(reloc_root); 16215d4f98a2SYan Zheng return 0; 16225d4f98a2SYan Zheng } 16235d4f98a2SYan Zheng 16245d4f98a2SYan Zheng /* 16255d4f98a2SYan Zheng * update root item of reloc tree 16265d4f98a2SYan Zheng */ 16275d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 16285d4f98a2SYan Zheng struct btrfs_root *root) 16295d4f98a2SYan Zheng { 16300b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 16315d4f98a2SYan Zheng struct btrfs_root *reloc_root; 16325d4f98a2SYan Zheng struct btrfs_root_item *root_item; 16335d4f98a2SYan Zheng int ret; 16345d4f98a2SYan Zheng 16356282675eSQu Wenruo if (!have_reloc_root(root)) 16367585717fSChris Mason goto out; 16375d4f98a2SYan Zheng 16385d4f98a2SYan Zheng reloc_root = root->reloc_root; 16395d4f98a2SYan Zheng root_item = &reloc_root->root_item; 16405d4f98a2SYan Zheng 1641f44deb74SJosef Bacik /* 1642f44deb74SJosef Bacik * We are probably ok here, but __del_reloc_root() will drop its ref of 1643f44deb74SJosef Bacik * the root. We have the ref for root->reloc_root, but just in case 1644f44deb74SJosef Bacik * hold it while we update the reloc root. 1645f44deb74SJosef Bacik */ 1646f44deb74SJosef Bacik btrfs_grab_root(reloc_root); 1647f44deb74SJosef Bacik 1648d2311e69SQu Wenruo /* root->reloc_root will stay until current relocation finished */ 16490b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 16503fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 1651d2311e69SQu Wenruo set_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 16526282675eSQu Wenruo /* 16536282675eSQu Wenruo * Mark the tree as dead before we change reloc_root so 16546282675eSQu Wenruo * have_reloc_root will not touch it from now on. 16556282675eSQu Wenruo */ 16566282675eSQu Wenruo smp_wmb(); 1657c974c464SWang Shilong __del_reloc_root(reloc_root); 16585d4f98a2SYan Zheng } 16595d4f98a2SYan Zheng 16605d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 1661ea287ab1SJosef Bacik __update_reloc_root(reloc_root); 16625d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 16635d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 16645d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 16655d4f98a2SYan Zheng } 16665d4f98a2SYan Zheng 16670b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 16685d4f98a2SYan Zheng &reloc_root->root_key, root_item); 16695d4f98a2SYan Zheng BUG_ON(ret); 1670f44deb74SJosef Bacik btrfs_put_root(reloc_root); 16717585717fSChris Mason out: 16725d4f98a2SYan Zheng return 0; 16735d4f98a2SYan Zheng } 16745d4f98a2SYan Zheng 16755d4f98a2SYan Zheng /* 16765d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 16775d4f98a2SYan Zheng * in a subvolume 16785d4f98a2SYan Zheng */ 16795d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 16805d4f98a2SYan Zheng { 16815d4f98a2SYan Zheng struct rb_node *node; 16825d4f98a2SYan Zheng struct rb_node *prev; 16835d4f98a2SYan Zheng struct btrfs_inode *entry; 16845d4f98a2SYan Zheng struct inode *inode; 16855d4f98a2SYan Zheng 16865d4f98a2SYan Zheng spin_lock(&root->inode_lock); 16875d4f98a2SYan Zheng again: 16885d4f98a2SYan Zheng node = root->inode_tree.rb_node; 16895d4f98a2SYan Zheng prev = NULL; 16905d4f98a2SYan Zheng while (node) { 16915d4f98a2SYan Zheng prev = node; 16925d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 16935d4f98a2SYan Zheng 16944a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 16955d4f98a2SYan Zheng node = node->rb_left; 16964a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 16975d4f98a2SYan Zheng node = node->rb_right; 16985d4f98a2SYan Zheng else 16995d4f98a2SYan Zheng break; 17005d4f98a2SYan Zheng } 17015d4f98a2SYan Zheng if (!node) { 17025d4f98a2SYan Zheng while (prev) { 17035d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 17044a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 17055d4f98a2SYan Zheng node = prev; 17065d4f98a2SYan Zheng break; 17075d4f98a2SYan Zheng } 17085d4f98a2SYan Zheng prev = rb_next(prev); 17095d4f98a2SYan Zheng } 17105d4f98a2SYan Zheng } 17115d4f98a2SYan Zheng while (node) { 17125d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 17135d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 17145d4f98a2SYan Zheng if (inode) { 17155d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 17165d4f98a2SYan Zheng return inode; 17175d4f98a2SYan Zheng } 17185d4f98a2SYan Zheng 17194a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 17205d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 17215d4f98a2SYan Zheng goto again; 17225d4f98a2SYan Zheng 17235d4f98a2SYan Zheng node = rb_next(node); 17245d4f98a2SYan Zheng } 17255d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 17265d4f98a2SYan Zheng return NULL; 17275d4f98a2SYan Zheng } 17285d4f98a2SYan Zheng 17295d4f98a2SYan Zheng /* 17305d4f98a2SYan Zheng * get new location of data 17315d4f98a2SYan Zheng */ 17325d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 17335d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 17345d4f98a2SYan Zheng { 17355d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 17365d4f98a2SYan Zheng struct btrfs_path *path; 17375d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 17385d4f98a2SYan Zheng struct extent_buffer *leaf; 17395d4f98a2SYan Zheng int ret; 17405d4f98a2SYan Zheng 17415d4f98a2SYan Zheng path = btrfs_alloc_path(); 17425d4f98a2SYan Zheng if (!path) 17435d4f98a2SYan Zheng return -ENOMEM; 17445d4f98a2SYan Zheng 17455d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 1746f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 1747f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 17485d4f98a2SYan Zheng if (ret < 0) 17495d4f98a2SYan Zheng goto out; 17505d4f98a2SYan Zheng if (ret > 0) { 17515d4f98a2SYan Zheng ret = -ENOENT; 17525d4f98a2SYan Zheng goto out; 17535d4f98a2SYan Zheng } 17545d4f98a2SYan Zheng 17555d4f98a2SYan Zheng leaf = path->nodes[0]; 17565d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 17575d4f98a2SYan Zheng struct btrfs_file_extent_item); 17585d4f98a2SYan Zheng 17595d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 17605d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 17615d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 17625d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 17635d4f98a2SYan Zheng 17645d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 176583d4cfd4SJosef Bacik ret = -EINVAL; 17665d4f98a2SYan Zheng goto out; 17675d4f98a2SYan Zheng } 17685d4f98a2SYan Zheng 17695d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 17705d4f98a2SYan Zheng ret = 0; 17715d4f98a2SYan Zheng out: 17725d4f98a2SYan Zheng btrfs_free_path(path); 17735d4f98a2SYan Zheng return ret; 17745d4f98a2SYan Zheng } 17755d4f98a2SYan Zheng 17765d4f98a2SYan Zheng /* 17775d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 17785d4f98a2SYan Zheng * the new locations. 17795d4f98a2SYan Zheng */ 17803fd0a558SYan, Zheng static noinline_for_stack 17813fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 17825d4f98a2SYan Zheng struct reloc_control *rc, 17835d4f98a2SYan Zheng struct btrfs_root *root, 17843fd0a558SYan, Zheng struct extent_buffer *leaf) 17855d4f98a2SYan Zheng { 17860b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 17875d4f98a2SYan Zheng struct btrfs_key key; 17885d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 17895d4f98a2SYan Zheng struct inode *inode = NULL; 17905d4f98a2SYan Zheng u64 parent; 17915d4f98a2SYan Zheng u64 bytenr; 17923fd0a558SYan, Zheng u64 new_bytenr = 0; 17935d4f98a2SYan Zheng u64 num_bytes; 17945d4f98a2SYan Zheng u64 end; 17955d4f98a2SYan Zheng u32 nritems; 17965d4f98a2SYan Zheng u32 i; 179783d4cfd4SJosef Bacik int ret = 0; 17985d4f98a2SYan Zheng int first = 1; 17995d4f98a2SYan Zheng int dirty = 0; 18005d4f98a2SYan Zheng 18015d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 18025d4f98a2SYan Zheng return 0; 18035d4f98a2SYan Zheng 18045d4f98a2SYan Zheng /* reloc trees always use full backref */ 18055d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 18065d4f98a2SYan Zheng parent = leaf->start; 18075d4f98a2SYan Zheng else 18085d4f98a2SYan Zheng parent = 0; 18095d4f98a2SYan Zheng 18105d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 18115d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 181282fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 181382fa113fSQu Wenruo 18145d4f98a2SYan Zheng cond_resched(); 18155d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 18165d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 18175d4f98a2SYan Zheng continue; 18185d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 18195d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 18205d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 18215d4f98a2SYan Zheng continue; 18225d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 18235d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 18245d4f98a2SYan Zheng if (bytenr == 0) 18255d4f98a2SYan Zheng continue; 18269569cc20SQu Wenruo if (!in_range(bytenr, rc->block_group->start, 18279569cc20SQu Wenruo rc->block_group->length)) 18285d4f98a2SYan Zheng continue; 18295d4f98a2SYan Zheng 18305d4f98a2SYan Zheng /* 18315d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 18325d4f98a2SYan Zheng * to complete and drop the extent cache 18335d4f98a2SYan Zheng */ 18345d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 18355d4f98a2SYan Zheng if (first) { 18365d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 18375d4f98a2SYan Zheng first = 0; 18384a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 18393fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 18405d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 18415d4f98a2SYan Zheng } 18424a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 18435d4f98a2SYan Zheng end = key.offset + 18445d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 18455d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 18460b246afaSJeff Mahoney fs_info->sectorsize)); 18470b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 18485d4f98a2SYan Zheng end--; 18495d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1850d0082371SJeff Mahoney key.offset, end); 18515d4f98a2SYan Zheng if (!ret) 18525d4f98a2SYan Zheng continue; 18535d4f98a2SYan Zheng 1854dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1855dcdbc059SNikolay Borisov key.offset, end, 1); 18565d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1857d0082371SJeff Mahoney key.offset, end); 18585d4f98a2SYan Zheng } 18595d4f98a2SYan Zheng } 18605d4f98a2SYan Zheng 18615d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 18625d4f98a2SYan Zheng bytenr, num_bytes); 186383d4cfd4SJosef Bacik if (ret) { 186483d4cfd4SJosef Bacik /* 186583d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 186683d4cfd4SJosef Bacik * in the file extent yet. 186783d4cfd4SJosef Bacik */ 186883d4cfd4SJosef Bacik break; 18693fd0a558SYan, Zheng } 18705d4f98a2SYan Zheng 18715d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 18725d4f98a2SYan Zheng dirty = 1; 18735d4f98a2SYan Zheng 18745d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 187582fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 187682fa113fSQu Wenruo num_bytes, parent); 187782fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 187882fa113fSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1879b06c4bf5SFilipe Manana key.objectid, key.offset); 188082fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 188183d4cfd4SJosef Bacik if (ret) { 188266642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 188383d4cfd4SJosef Bacik break; 188483d4cfd4SJosef Bacik } 18855d4f98a2SYan Zheng 1886ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, bytenr, 1887ffd4bb2aSQu Wenruo num_bytes, parent); 1888ffd4bb2aSQu Wenruo ref.real_root = root->root_key.objectid; 1889ffd4bb2aSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1890b06c4bf5SFilipe Manana key.objectid, key.offset); 1891ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 189283d4cfd4SJosef Bacik if (ret) { 189366642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 189483d4cfd4SJosef Bacik break; 189583d4cfd4SJosef Bacik } 18965d4f98a2SYan Zheng } 18975d4f98a2SYan Zheng if (dirty) 18985d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 18993fd0a558SYan, Zheng if (inode) 19003fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 190183d4cfd4SJosef Bacik return ret; 19025d4f98a2SYan Zheng } 19035d4f98a2SYan Zheng 19045d4f98a2SYan Zheng static noinline_for_stack 19055d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 19065d4f98a2SYan Zheng struct btrfs_path *path, int level) 19075d4f98a2SYan Zheng { 19085d4f98a2SYan Zheng struct btrfs_disk_key key1; 19095d4f98a2SYan Zheng struct btrfs_disk_key key2; 19105d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 19115d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 19125d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 19135d4f98a2SYan Zheng } 19145d4f98a2SYan Zheng 19155d4f98a2SYan Zheng /* 19165d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 19175d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 19185d4f98a2SYan Zheng * reloc tree was create can be replaced. 19195d4f98a2SYan Zheng * 19205d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 19215d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 19225d4f98a2SYan Zheng * errors, a negative error number is returned. 19235d4f98a2SYan Zheng */ 19243fd0a558SYan, Zheng static noinline_for_stack 19253d0174f7SQu Wenruo int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, 19265d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 19275d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 19285d4f98a2SYan Zheng int lowest_level, int max_level) 19295d4f98a2SYan Zheng { 19300b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 19315d4f98a2SYan Zheng struct extent_buffer *eb; 19325d4f98a2SYan Zheng struct extent_buffer *parent; 193382fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 19345d4f98a2SYan Zheng struct btrfs_key key; 19355d4f98a2SYan Zheng u64 old_bytenr; 19365d4f98a2SYan Zheng u64 new_bytenr; 19375d4f98a2SYan Zheng u64 old_ptr_gen; 19385d4f98a2SYan Zheng u64 new_ptr_gen; 19395d4f98a2SYan Zheng u64 last_snapshot; 19405d4f98a2SYan Zheng u32 blocksize; 19413fd0a558SYan, Zheng int cow = 0; 19425d4f98a2SYan Zheng int level; 19435d4f98a2SYan Zheng int ret; 19445d4f98a2SYan Zheng int slot; 19455d4f98a2SYan Zheng 19465d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 19475d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 19485d4f98a2SYan Zheng 19495d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 19503fd0a558SYan, Zheng again: 19515d4f98a2SYan Zheng slot = path->slots[lowest_level]; 19525d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 19535d4f98a2SYan Zheng 19545d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 19558bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19565d4f98a2SYan Zheng level = btrfs_header_level(eb); 19575d4f98a2SYan Zheng 19585d4f98a2SYan Zheng if (level < lowest_level) { 19595d4f98a2SYan Zheng btrfs_tree_unlock(eb); 19605d4f98a2SYan Zheng free_extent_buffer(eb); 19615d4f98a2SYan Zheng return 0; 19625d4f98a2SYan Zheng } 19635d4f98a2SYan Zheng 19643fd0a558SYan, Zheng if (cow) { 19655d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 19665d4f98a2SYan Zheng BUG_ON(ret); 19673fd0a558SYan, Zheng } 19688bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19695d4f98a2SYan Zheng 19705d4f98a2SYan Zheng if (next_key) { 19715d4f98a2SYan Zheng next_key->objectid = (u64)-1; 19725d4f98a2SYan Zheng next_key->type = (u8)-1; 19735d4f98a2SYan Zheng next_key->offset = (u64)-1; 19745d4f98a2SYan Zheng } 19755d4f98a2SYan Zheng 19765d4f98a2SYan Zheng parent = eb; 19775d4f98a2SYan Zheng while (1) { 1978581c1760SQu Wenruo struct btrfs_key first_key; 1979581c1760SQu Wenruo 19805d4f98a2SYan Zheng level = btrfs_header_level(parent); 19815d4f98a2SYan Zheng BUG_ON(level < lowest_level); 19825d4f98a2SYan Zheng 19835d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 1984cbca7d59SFilipe Manana if (ret < 0) 1985cbca7d59SFilipe Manana break; 19865d4f98a2SYan Zheng if (ret && slot > 0) 19875d4f98a2SYan Zheng slot--; 19885d4f98a2SYan Zheng 19895d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 19905d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 19915d4f98a2SYan Zheng 19925d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 19930b246afaSJeff Mahoney blocksize = fs_info->nodesize; 19945d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 199517515f1bSQu Wenruo btrfs_node_key_to_cpu(parent, &first_key, slot); 19965d4f98a2SYan Zheng 19975d4f98a2SYan Zheng if (level <= max_level) { 19985d4f98a2SYan Zheng eb = path->nodes[level]; 19995d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 20005d4f98a2SYan Zheng path->slots[level]); 20015d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 20025d4f98a2SYan Zheng path->slots[level]); 20035d4f98a2SYan Zheng } else { 20045d4f98a2SYan Zheng new_bytenr = 0; 20055d4f98a2SYan Zheng new_ptr_gen = 0; 20065d4f98a2SYan Zheng } 20075d4f98a2SYan Zheng 2008fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 20095d4f98a2SYan Zheng ret = level; 20105d4f98a2SYan Zheng break; 20115d4f98a2SYan Zheng } 20125d4f98a2SYan Zheng 20135d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 20145d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 20153fd0a558SYan, Zheng if (level <= lowest_level) { 20165d4f98a2SYan Zheng ret = 0; 20175d4f98a2SYan Zheng break; 20185d4f98a2SYan Zheng } 20195d4f98a2SYan Zheng 2020581c1760SQu Wenruo eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen, 2021581c1760SQu Wenruo level - 1, &first_key); 202264c043deSLiu Bo if (IS_ERR(eb)) { 202364c043deSLiu Bo ret = PTR_ERR(eb); 2024264813acSLiu Bo break; 202564c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 202664c043deSLiu Bo ret = -EIO; 2027416bc658SJosef Bacik free_extent_buffer(eb); 2028379cde74SStefan Behrens break; 2029416bc658SJosef Bacik } 20305d4f98a2SYan Zheng btrfs_tree_lock(eb); 20313fd0a558SYan, Zheng if (cow) { 20325d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 20335d4f98a2SYan Zheng slot, &eb); 20345d4f98a2SYan Zheng BUG_ON(ret); 20355d4f98a2SYan Zheng } 20368bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 20375d4f98a2SYan Zheng 20385d4f98a2SYan Zheng btrfs_tree_unlock(parent); 20395d4f98a2SYan Zheng free_extent_buffer(parent); 20405d4f98a2SYan Zheng 20415d4f98a2SYan Zheng parent = eb; 20425d4f98a2SYan Zheng continue; 20435d4f98a2SYan Zheng } 20445d4f98a2SYan Zheng 20453fd0a558SYan, Zheng if (!cow) { 20463fd0a558SYan, Zheng btrfs_tree_unlock(parent); 20473fd0a558SYan, Zheng free_extent_buffer(parent); 20483fd0a558SYan, Zheng cow = 1; 20493fd0a558SYan, Zheng goto again; 20503fd0a558SYan, Zheng } 20513fd0a558SYan, Zheng 20525d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 20535d4f98a2SYan Zheng path->slots[level]); 2054b3b4aa74SDavid Sterba btrfs_release_path(path); 20555d4f98a2SYan Zheng 20565d4f98a2SYan Zheng path->lowest_level = level; 20575d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 20585d4f98a2SYan Zheng path->lowest_level = 0; 20595d4f98a2SYan Zheng BUG_ON(ret); 20605d4f98a2SYan Zheng 20615d4f98a2SYan Zheng /* 2062824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 2063824d8dffSQu Wenruo * 2064824d8dffSQu Wenruo * We must trace both trees. 2065824d8dffSQu Wenruo * 1) Tree reloc subtree 2066824d8dffSQu Wenruo * If not traced, we will leak data numbers 2067824d8dffSQu Wenruo * 2) Fs subtree 2068824d8dffSQu Wenruo * If not traced, we will double count old data 2069f616f5cdSQu Wenruo * 2070f616f5cdSQu Wenruo * We don't scan the subtree right now, but only record 2071f616f5cdSQu Wenruo * the swapped tree blocks. 2072f616f5cdSQu Wenruo * The real subtree rescan is delayed until we have new 2073f616f5cdSQu Wenruo * CoW on the subtree root node before transaction commit. 2074824d8dffSQu Wenruo */ 2075370a11b8SQu Wenruo ret = btrfs_qgroup_add_swapped_blocks(trans, dest, 2076370a11b8SQu Wenruo rc->block_group, parent, slot, 2077370a11b8SQu Wenruo path->nodes[level], path->slots[level], 2078370a11b8SQu Wenruo last_snapshot); 2079370a11b8SQu Wenruo if (ret < 0) 2080370a11b8SQu Wenruo break; 2081824d8dffSQu Wenruo /* 20825d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 20835d4f98a2SYan Zheng */ 20845d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 20855d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 20865d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 20875d4f98a2SYan Zheng 20885d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 20895d4f98a2SYan Zheng path->slots[level], old_bytenr); 20905d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 20915d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 20925d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 20935d4f98a2SYan Zheng 209482fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, old_bytenr, 209582fa113fSQu Wenruo blocksize, path->nodes[level]->start); 209682fa113fSQu Wenruo ref.skip_qgroup = true; 209782fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 209882fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 20995d4f98a2SYan Zheng BUG_ON(ret); 210082fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 210182fa113fSQu Wenruo blocksize, 0); 210282fa113fSQu Wenruo ref.skip_qgroup = true; 210382fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 210482fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 21055d4f98a2SYan Zheng BUG_ON(ret); 21065d4f98a2SYan Zheng 2107ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, new_bytenr, 2108ffd4bb2aSQu Wenruo blocksize, path->nodes[level]->start); 2109ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 2110ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2111ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 21125d4f98a2SYan Zheng BUG_ON(ret); 21135d4f98a2SYan Zheng 2114ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, old_bytenr, 2115ffd4bb2aSQu Wenruo blocksize, 0); 2116ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 2117ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2118ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 21195d4f98a2SYan Zheng BUG_ON(ret); 21205d4f98a2SYan Zheng 21215d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 21225d4f98a2SYan Zheng 21235d4f98a2SYan Zheng ret = level; 21245d4f98a2SYan Zheng break; 21255d4f98a2SYan Zheng } 21265d4f98a2SYan Zheng btrfs_tree_unlock(parent); 21275d4f98a2SYan Zheng free_extent_buffer(parent); 21285d4f98a2SYan Zheng return ret; 21295d4f98a2SYan Zheng } 21305d4f98a2SYan Zheng 21315d4f98a2SYan Zheng /* 21325d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 21335d4f98a2SYan Zheng */ 21345d4f98a2SYan Zheng static noinline_for_stack 21355d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 21365d4f98a2SYan Zheng int *level) 21375d4f98a2SYan Zheng { 21385d4f98a2SYan Zheng struct extent_buffer *eb; 21395d4f98a2SYan Zheng int i; 21405d4f98a2SYan Zheng u64 last_snapshot; 21415d4f98a2SYan Zheng u32 nritems; 21425d4f98a2SYan Zheng 21435d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 21445d4f98a2SYan Zheng 21455d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 21465d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 21475d4f98a2SYan Zheng path->nodes[i] = NULL; 21485d4f98a2SYan Zheng } 21495d4f98a2SYan Zheng 21505d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 21515d4f98a2SYan Zheng eb = path->nodes[i]; 21525d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 21535d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 21545d4f98a2SYan Zheng path->slots[i]++; 21555d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 21565d4f98a2SYan Zheng last_snapshot) 21575d4f98a2SYan Zheng continue; 21585d4f98a2SYan Zheng 21595d4f98a2SYan Zheng *level = i; 21605d4f98a2SYan Zheng return 0; 21615d4f98a2SYan Zheng } 21625d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 21635d4f98a2SYan Zheng path->nodes[i] = NULL; 21645d4f98a2SYan Zheng } 21655d4f98a2SYan Zheng return 1; 21665d4f98a2SYan Zheng } 21675d4f98a2SYan Zheng 21685d4f98a2SYan Zheng /* 21695d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 21705d4f98a2SYan Zheng */ 21715d4f98a2SYan Zheng static noinline_for_stack 21725d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 21735d4f98a2SYan Zheng int *level) 21745d4f98a2SYan Zheng { 21752ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 21765d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 21775d4f98a2SYan Zheng int i; 21785d4f98a2SYan Zheng u64 bytenr; 21795d4f98a2SYan Zheng u64 ptr_gen = 0; 21805d4f98a2SYan Zheng u64 last_snapshot; 21815d4f98a2SYan Zheng u32 nritems; 21825d4f98a2SYan Zheng 21835d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 21845d4f98a2SYan Zheng 21855d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 2186581c1760SQu Wenruo struct btrfs_key first_key; 2187581c1760SQu Wenruo 21885d4f98a2SYan Zheng eb = path->nodes[i]; 21895d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 21905d4f98a2SYan Zheng while (path->slots[i] < nritems) { 21915d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 21925d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 21935d4f98a2SYan Zheng break; 21945d4f98a2SYan Zheng path->slots[i]++; 21955d4f98a2SYan Zheng } 21965d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 21975d4f98a2SYan Zheng if (i == *level) 21985d4f98a2SYan Zheng break; 21995d4f98a2SYan Zheng *level = i + 1; 22005d4f98a2SYan Zheng return 0; 22015d4f98a2SYan Zheng } 22025d4f98a2SYan Zheng if (i == 1) { 22035d4f98a2SYan Zheng *level = i; 22045d4f98a2SYan Zheng return 0; 22055d4f98a2SYan Zheng } 22065d4f98a2SYan Zheng 22075d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2208581c1760SQu Wenruo btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); 2209581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1, 2210581c1760SQu Wenruo &first_key); 221164c043deSLiu Bo if (IS_ERR(eb)) { 221264c043deSLiu Bo return PTR_ERR(eb); 221364c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2214416bc658SJosef Bacik free_extent_buffer(eb); 2215416bc658SJosef Bacik return -EIO; 2216416bc658SJosef Bacik } 22175d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 22185d4f98a2SYan Zheng path->nodes[i - 1] = eb; 22195d4f98a2SYan Zheng path->slots[i - 1] = 0; 22205d4f98a2SYan Zheng } 22215d4f98a2SYan Zheng return 1; 22225d4f98a2SYan Zheng } 22235d4f98a2SYan Zheng 22245d4f98a2SYan Zheng /* 22255d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 22265d4f98a2SYan Zheng * [min_key, max_key) 22275d4f98a2SYan Zheng */ 22285d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 22295d4f98a2SYan Zheng struct btrfs_key *min_key, 22305d4f98a2SYan Zheng struct btrfs_key *max_key) 22315d4f98a2SYan Zheng { 22320b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 22335d4f98a2SYan Zheng struct inode *inode = NULL; 22345d4f98a2SYan Zheng u64 objectid; 22355d4f98a2SYan Zheng u64 start, end; 223633345d01SLi Zefan u64 ino; 22375d4f98a2SYan Zheng 22385d4f98a2SYan Zheng objectid = min_key->objectid; 22395d4f98a2SYan Zheng while (1) { 22405d4f98a2SYan Zheng cond_resched(); 22415d4f98a2SYan Zheng iput(inode); 22425d4f98a2SYan Zheng 22435d4f98a2SYan Zheng if (objectid > max_key->objectid) 22445d4f98a2SYan Zheng break; 22455d4f98a2SYan Zheng 22465d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 22475d4f98a2SYan Zheng if (!inode) 22485d4f98a2SYan Zheng break; 22494a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 22505d4f98a2SYan Zheng 225133345d01SLi Zefan if (ino > max_key->objectid) { 22525d4f98a2SYan Zheng iput(inode); 22535d4f98a2SYan Zheng break; 22545d4f98a2SYan Zheng } 22555d4f98a2SYan Zheng 225633345d01SLi Zefan objectid = ino + 1; 22575d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 22585d4f98a2SYan Zheng continue; 22595d4f98a2SYan Zheng 226033345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 22615d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 22625d4f98a2SYan Zheng continue; 22635d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 22645d4f98a2SYan Zheng start = 0; 22655d4f98a2SYan Zheng else { 22665d4f98a2SYan Zheng start = min_key->offset; 22670b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 22685d4f98a2SYan Zheng } 22695d4f98a2SYan Zheng } else { 22705d4f98a2SYan Zheng start = 0; 22715d4f98a2SYan Zheng } 22725d4f98a2SYan Zheng 227333345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 22745d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 22755d4f98a2SYan Zheng continue; 22765d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 22775d4f98a2SYan Zheng end = (u64)-1; 22785d4f98a2SYan Zheng } else { 22795d4f98a2SYan Zheng if (max_key->offset == 0) 22805d4f98a2SYan Zheng continue; 22815d4f98a2SYan Zheng end = max_key->offset; 22820b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 22835d4f98a2SYan Zheng end--; 22845d4f98a2SYan Zheng } 22855d4f98a2SYan Zheng } else { 22865d4f98a2SYan Zheng end = (u64)-1; 22875d4f98a2SYan Zheng } 22885d4f98a2SYan Zheng 22895d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2290d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 2291dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 2292d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 22935d4f98a2SYan Zheng } 22945d4f98a2SYan Zheng return 0; 22955d4f98a2SYan Zheng } 22965d4f98a2SYan Zheng 22975d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 22985d4f98a2SYan Zheng struct btrfs_key *key) 22995d4f98a2SYan Zheng 23005d4f98a2SYan Zheng { 23015d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 23025d4f98a2SYan Zheng if (!path->nodes[level]) 23035d4f98a2SYan Zheng break; 23045d4f98a2SYan Zheng if (path->slots[level] + 1 < 23055d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 23065d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 23075d4f98a2SYan Zheng path->slots[level] + 1); 23085d4f98a2SYan Zheng return 0; 23095d4f98a2SYan Zheng } 23105d4f98a2SYan Zheng level++; 23115d4f98a2SYan Zheng } 23125d4f98a2SYan Zheng return 1; 23135d4f98a2SYan Zheng } 23145d4f98a2SYan Zheng 23155d4f98a2SYan Zheng /* 2316d2311e69SQu Wenruo * Insert current subvolume into reloc_control::dirty_subvol_roots 2317d2311e69SQu Wenruo */ 2318d2311e69SQu Wenruo static void insert_dirty_subvol(struct btrfs_trans_handle *trans, 2319d2311e69SQu Wenruo struct reloc_control *rc, 2320d2311e69SQu Wenruo struct btrfs_root *root) 2321d2311e69SQu Wenruo { 2322d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2323d2311e69SQu Wenruo struct btrfs_root_item *reloc_root_item; 2324d2311e69SQu Wenruo 2325d2311e69SQu Wenruo /* @root must be a subvolume tree root with a valid reloc tree */ 2326d2311e69SQu Wenruo ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 2327d2311e69SQu Wenruo ASSERT(reloc_root); 2328d2311e69SQu Wenruo 2329d2311e69SQu Wenruo reloc_root_item = &reloc_root->root_item; 2330d2311e69SQu Wenruo memset(&reloc_root_item->drop_progress, 0, 2331d2311e69SQu Wenruo sizeof(reloc_root_item->drop_progress)); 2332d2311e69SQu Wenruo reloc_root_item->drop_level = 0; 2333d2311e69SQu Wenruo btrfs_set_root_refs(reloc_root_item, 0); 2334d2311e69SQu Wenruo btrfs_update_reloc_root(trans, root); 2335d2311e69SQu Wenruo 2336d2311e69SQu Wenruo if (list_empty(&root->reloc_dirty_list)) { 233700246528SJosef Bacik btrfs_grab_root(root); 2338d2311e69SQu Wenruo list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); 2339d2311e69SQu Wenruo } 2340d2311e69SQu Wenruo } 2341d2311e69SQu Wenruo 2342d2311e69SQu Wenruo static int clean_dirty_subvols(struct reloc_control *rc) 2343d2311e69SQu Wenruo { 2344d2311e69SQu Wenruo struct btrfs_root *root; 2345d2311e69SQu Wenruo struct btrfs_root *next; 2346d2311e69SQu Wenruo int ret = 0; 234730d40577SQu Wenruo int ret2; 2348d2311e69SQu Wenruo 2349d2311e69SQu Wenruo list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, 2350d2311e69SQu Wenruo reloc_dirty_list) { 235130d40577SQu Wenruo if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 235230d40577SQu Wenruo /* Merged subvolume, cleanup its reloc root */ 2353d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2354d2311e69SQu Wenruo 2355d2311e69SQu Wenruo list_del_init(&root->reloc_dirty_list); 2356d2311e69SQu Wenruo root->reloc_root = NULL; 23576282675eSQu Wenruo /* 23586282675eSQu Wenruo * Need barrier to ensure clear_bit() only happens after 23596282675eSQu Wenruo * root->reloc_root = NULL. Pairs with have_reloc_root. 23606282675eSQu Wenruo */ 23616282675eSQu Wenruo smp_wmb(); 23621fac4a54SQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 2363f28de8d8SJosef Bacik if (reloc_root) { 2364f44deb74SJosef Bacik /* 2365f44deb74SJosef Bacik * btrfs_drop_snapshot drops our ref we hold for 2366f44deb74SJosef Bacik * ->reloc_root. If it fails however we must 2367f44deb74SJosef Bacik * drop the ref ourselves. 2368f44deb74SJosef Bacik */ 2369f28de8d8SJosef Bacik ret2 = btrfs_drop_snapshot(reloc_root, 0, 1); 2370f44deb74SJosef Bacik if (ret2 < 0) { 2371f44deb74SJosef Bacik btrfs_put_root(reloc_root); 2372f44deb74SJosef Bacik if (!ret) 2373f28de8d8SJosef Bacik ret = ret2; 2374f28de8d8SJosef Bacik } 2375f44deb74SJosef Bacik } 237600246528SJosef Bacik btrfs_put_root(root); 237730d40577SQu Wenruo } else { 237830d40577SQu Wenruo /* Orphan reloc tree, just clean it up */ 23790078a9f9SNikolay Borisov ret2 = btrfs_drop_snapshot(root, 0, 1); 2380f44deb74SJosef Bacik if (ret2 < 0) { 2381f44deb74SJosef Bacik btrfs_put_root(root); 2382f44deb74SJosef Bacik if (!ret) 238330d40577SQu Wenruo ret = ret2; 238430d40577SQu Wenruo } 2385d2311e69SQu Wenruo } 2386f44deb74SJosef Bacik } 2387d2311e69SQu Wenruo return ret; 2388d2311e69SQu Wenruo } 2389d2311e69SQu Wenruo 2390d2311e69SQu Wenruo /* 23915d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 23925d4f98a2SYan Zheng * fs tree. 23935d4f98a2SYan Zheng */ 23945d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 23955d4f98a2SYan Zheng struct btrfs_root *root) 23965d4f98a2SYan Zheng { 23970b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 23985d4f98a2SYan Zheng struct btrfs_key key; 23995d4f98a2SYan Zheng struct btrfs_key next_key; 24009e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 24015d4f98a2SYan Zheng struct btrfs_root *reloc_root; 24025d4f98a2SYan Zheng struct btrfs_root_item *root_item; 24035d4f98a2SYan Zheng struct btrfs_path *path; 24043fd0a558SYan, Zheng struct extent_buffer *leaf; 24055d4f98a2SYan Zheng int level; 24065d4f98a2SYan Zheng int max_level; 24075d4f98a2SYan Zheng int replaced = 0; 24085d4f98a2SYan Zheng int ret; 24095d4f98a2SYan Zheng int err = 0; 24103fd0a558SYan, Zheng u32 min_reserved; 24115d4f98a2SYan Zheng 24125d4f98a2SYan Zheng path = btrfs_alloc_path(); 24135d4f98a2SYan Zheng if (!path) 24145d4f98a2SYan Zheng return -ENOMEM; 2415e4058b54SDavid Sterba path->reada = READA_FORWARD; 24165d4f98a2SYan Zheng 24175d4f98a2SYan Zheng reloc_root = root->reloc_root; 24185d4f98a2SYan Zheng root_item = &reloc_root->root_item; 24195d4f98a2SYan Zheng 24205d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 24215d4f98a2SYan Zheng level = btrfs_root_level(root_item); 242267439dadSDavid Sterba atomic_inc(&reloc_root->node->refs); 24235d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 24245d4f98a2SYan Zheng path->slots[level] = 0; 24255d4f98a2SYan Zheng } else { 24265d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 24275d4f98a2SYan Zheng 24285d4f98a2SYan Zheng level = root_item->drop_level; 24295d4f98a2SYan Zheng BUG_ON(level == 0); 24305d4f98a2SYan Zheng path->lowest_level = level; 24315d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 243233c66f43SYan Zheng path->lowest_level = 0; 24335d4f98a2SYan Zheng if (ret < 0) { 24345d4f98a2SYan Zheng btrfs_free_path(path); 24355d4f98a2SYan Zheng return ret; 24365d4f98a2SYan Zheng } 24375d4f98a2SYan Zheng 24385d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 24395d4f98a2SYan Zheng path->slots[level]); 24405d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 24415d4f98a2SYan Zheng 24425d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 24435d4f98a2SYan Zheng } 24445d4f98a2SYan Zheng 24450b246afaSJeff Mahoney min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 24465d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 24475d4f98a2SYan Zheng 24485d4f98a2SYan Zheng while (1) { 244908e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 245008e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 24513fd0a558SYan, Zheng if (ret) { 24529e6a0c52SJosef Bacik err = ret; 24539e6a0c52SJosef Bacik goto out; 24543fd0a558SYan, Zheng } 24559e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 24569e6a0c52SJosef Bacik if (IS_ERR(trans)) { 24579e6a0c52SJosef Bacik err = PTR_ERR(trans); 24589e6a0c52SJosef Bacik trans = NULL; 24599e6a0c52SJosef Bacik goto out; 24609e6a0c52SJosef Bacik } 24612abc726aSJosef Bacik 24622abc726aSJosef Bacik /* 24632abc726aSJosef Bacik * At this point we no longer have a reloc_control, so we can't 24642abc726aSJosef Bacik * depend on btrfs_init_reloc_root to update our last_trans. 24652abc726aSJosef Bacik * 24662abc726aSJosef Bacik * But that's ok, we started the trans handle on our 24672abc726aSJosef Bacik * corresponding fs_root, which means it's been added to the 24682abc726aSJosef Bacik * dirty list. At commit time we'll still call 24692abc726aSJosef Bacik * btrfs_update_reloc_root() and update our root item 24702abc726aSJosef Bacik * appropriately. 24712abc726aSJosef Bacik */ 24722abc726aSJosef Bacik reloc_root->last_trans = trans->transid; 24739e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 24743fd0a558SYan, Zheng 24753fd0a558SYan, Zheng replaced = 0; 24765d4f98a2SYan Zheng max_level = level; 24775d4f98a2SYan Zheng 24785d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 24795d4f98a2SYan Zheng if (ret < 0) { 24805d4f98a2SYan Zheng err = ret; 24815d4f98a2SYan Zheng goto out; 24825d4f98a2SYan Zheng } 24835d4f98a2SYan Zheng if (ret > 0) 24845d4f98a2SYan Zheng break; 24855d4f98a2SYan Zheng 24865d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 24875d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 24885d4f98a2SYan Zheng ret = 0; 24895d4f98a2SYan Zheng } else { 24903d0174f7SQu Wenruo ret = replace_path(trans, rc, root, reloc_root, path, 24913fd0a558SYan, Zheng &next_key, level, max_level); 24925d4f98a2SYan Zheng } 24935d4f98a2SYan Zheng if (ret < 0) { 24945d4f98a2SYan Zheng err = ret; 24955d4f98a2SYan Zheng goto out; 24965d4f98a2SYan Zheng } 24975d4f98a2SYan Zheng 24985d4f98a2SYan Zheng if (ret > 0) { 24995d4f98a2SYan Zheng level = ret; 25005d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 25015d4f98a2SYan Zheng path->slots[level]); 25025d4f98a2SYan Zheng replaced = 1; 25035d4f98a2SYan Zheng } 25045d4f98a2SYan Zheng 25055d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 25065d4f98a2SYan Zheng if (ret > 0) 25075d4f98a2SYan Zheng break; 25085d4f98a2SYan Zheng 25095d4f98a2SYan Zheng BUG_ON(level == 0); 25105d4f98a2SYan Zheng /* 25115d4f98a2SYan Zheng * save the merging progress in the drop_progress. 25125d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 25135d4f98a2SYan Zheng */ 25145d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 25155d4f98a2SYan Zheng path->slots[level]); 25165d4f98a2SYan Zheng root_item->drop_level = level; 25175d4f98a2SYan Zheng 25183a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 25199e6a0c52SJosef Bacik trans = NULL; 25205d4f98a2SYan Zheng 25212ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 25225d4f98a2SYan Zheng 25235d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 25245d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 25255d4f98a2SYan Zheng } 25265d4f98a2SYan Zheng 25275d4f98a2SYan Zheng /* 25285d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 25295d4f98a2SYan Zheng * relocated and the block is tree root. 25305d4f98a2SYan Zheng */ 25315d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 25325d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 25335d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 25345d4f98a2SYan Zheng free_extent_buffer(leaf); 25355d4f98a2SYan Zheng if (ret < 0) 25365d4f98a2SYan Zheng err = ret; 25375d4f98a2SYan Zheng out: 25385d4f98a2SYan Zheng btrfs_free_path(path); 25395d4f98a2SYan Zheng 2540d2311e69SQu Wenruo if (err == 0) 2541d2311e69SQu Wenruo insert_dirty_subvol(trans, rc, root); 25425d4f98a2SYan Zheng 25439e6a0c52SJosef Bacik if (trans) 25443a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 25455d4f98a2SYan Zheng 25462ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 25475d4f98a2SYan Zheng 25485d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 25495d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 25505d4f98a2SYan Zheng 25515d4f98a2SYan Zheng return err; 25525d4f98a2SYan Zheng } 25535d4f98a2SYan Zheng 25543fd0a558SYan, Zheng static noinline_for_stack 25553fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 25565d4f98a2SYan Zheng { 25573fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 25580b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 25593fd0a558SYan, Zheng struct btrfs_root *reloc_root; 25605d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 25613fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 25623fd0a558SYan, Zheng u64 num_bytes = 0; 25633fd0a558SYan, Zheng int ret; 25643fd0a558SYan, Zheng 25650b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 25660b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 25673fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 25680b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 25697585717fSChris Mason 25703fd0a558SYan, Zheng again: 25713fd0a558SYan, Zheng if (!err) { 25723fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 257308e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 257408e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 25753fd0a558SYan, Zheng if (ret) 25763fd0a558SYan, Zheng err = ret; 25773fd0a558SYan, Zheng } 25783fd0a558SYan, Zheng 25797a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 25803612b495STsutomu Itoh if (IS_ERR(trans)) { 25813612b495STsutomu Itoh if (!err) 25822ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 258363f018beSNikolay Borisov num_bytes, NULL); 25843612b495STsutomu Itoh return PTR_ERR(trans); 25853612b495STsutomu Itoh } 25863fd0a558SYan, Zheng 25873fd0a558SYan, Zheng if (!err) { 25883fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 25893a45bb20SJeff Mahoney btrfs_end_transaction(trans); 25902ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 259163f018beSNikolay Borisov num_bytes, NULL); 25923fd0a558SYan, Zheng goto again; 25933fd0a558SYan, Zheng } 25943fd0a558SYan, Zheng } 25953fd0a558SYan, Zheng 25963fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 25973fd0a558SYan, Zheng 25983fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 25993fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 26003fd0a558SYan, Zheng struct btrfs_root, root_list); 26013fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 26023fd0a558SYan, Zheng 26030b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 26043fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 26053fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 26063fd0a558SYan, Zheng 26073fd0a558SYan, Zheng /* 26083fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 26093fd0a558SYan, Zheng * knows it should resumes merging 26103fd0a558SYan, Zheng */ 26113fd0a558SYan, Zheng if (!err) 26123fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 26133fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 26143fd0a558SYan, Zheng 26153fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 261600246528SJosef Bacik btrfs_put_root(root); 26173fd0a558SYan, Zheng } 26183fd0a558SYan, Zheng 26193fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 26203fd0a558SYan, Zheng 26213fd0a558SYan, Zheng if (!err) 26223a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 26233fd0a558SYan, Zheng else 26243a45bb20SJeff Mahoney btrfs_end_transaction(trans); 26253fd0a558SYan, Zheng return err; 26263fd0a558SYan, Zheng } 26273fd0a558SYan, Zheng 26283fd0a558SYan, Zheng static noinline_for_stack 2629aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2630aca1bba6SLiu Bo { 2631aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2632aca1bba6SLiu Bo 2633aca1bba6SLiu Bo while (!list_empty(list)) { 2634aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2635aca1bba6SLiu Bo root_list); 2636bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 2637aca1bba6SLiu Bo } 2638aca1bba6SLiu Bo } 2639aca1bba6SLiu Bo 2640aca1bba6SLiu Bo static noinline_for_stack 264194404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 26423fd0a558SYan, Zheng { 26430b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 26445d4f98a2SYan Zheng struct btrfs_root *root; 26455d4f98a2SYan Zheng struct btrfs_root *reloc_root; 26463fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 26473fd0a558SYan, Zheng int found = 0; 2648aca1bba6SLiu Bo int ret = 0; 26493fd0a558SYan, Zheng again: 26503fd0a558SYan, Zheng root = rc->extent_root; 26517585717fSChris Mason 26527585717fSChris Mason /* 26537585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 26547585717fSChris Mason * we have to make sure nobody is in the middle of 26557585717fSChris Mason * adding their roots to the list while we are 26567585717fSChris Mason * doing this splice 26577585717fSChris Mason */ 26580b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 26593fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 26600b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 26615d4f98a2SYan Zheng 26623fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 26633fd0a558SYan, Zheng found = 1; 26643fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 26653fd0a558SYan, Zheng struct btrfs_root, root_list); 26665d4f98a2SYan Zheng 26675d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 26680b246afaSJeff Mahoney root = read_fs_root(fs_info, 26695d4f98a2SYan Zheng reloc_root->root_key.offset); 26705d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 26715d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 26725d4f98a2SYan Zheng 26733fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 267400246528SJosef Bacik btrfs_put_root(root); 2675b37b39cdSJosef Bacik if (ret) { 267625e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 267725e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 267825e293c2SWang Shilong &reloc_roots); 2679aca1bba6SLiu Bo goto out; 2680b37b39cdSJosef Bacik } 26813fd0a558SYan, Zheng } else { 26823fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 268330d40577SQu Wenruo /* Don't forget to queue this reloc root for cleanup */ 268430d40577SQu Wenruo list_add_tail(&reloc_root->reloc_dirty_list, 268530d40577SQu Wenruo &rc->dirty_subvol_roots); 26863fd0a558SYan, Zheng } 26875d4f98a2SYan Zheng } 26885d4f98a2SYan Zheng 26893fd0a558SYan, Zheng if (found) { 26903fd0a558SYan, Zheng found = 0; 26913fd0a558SYan, Zheng goto again; 26925d4f98a2SYan Zheng } 2693aca1bba6SLiu Bo out: 2694aca1bba6SLiu Bo if (ret) { 26950b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2696aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2697aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2698467bb1d2SWang Shilong 2699467bb1d2SWang Shilong /* new reloc root may be added */ 27000b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2701467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 27020b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2703467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2704467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2705aca1bba6SLiu Bo } 2706aca1bba6SLiu Bo 27077b7b7431SJosef Bacik /* 27087b7b7431SJosef Bacik * We used to have 27097b7b7431SJosef Bacik * 27107b7b7431SJosef Bacik * BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 27117b7b7431SJosef Bacik * 27127b7b7431SJosef Bacik * here, but it's wrong. If we fail to start the transaction in 27137b7b7431SJosef Bacik * prepare_to_merge() we will have only 0 ref reloc roots, none of which 27147b7b7431SJosef Bacik * have actually been removed from the reloc_root_tree rb tree. This is 27157b7b7431SJosef Bacik * fine because we're bailing here, and we hold a reference on the root 27167b7b7431SJosef Bacik * for the list that holds it, so these roots will be cleaned up when we 27177b7b7431SJosef Bacik * do the reloc_dirty_list afterwards. Meanwhile the root->reloc_root 27187b7b7431SJosef Bacik * will be cleaned up on unmount. 27197b7b7431SJosef Bacik * 27207b7b7431SJosef Bacik * The remaining nodes will be cleaned up by free_reloc_control. 27217b7b7431SJosef Bacik */ 27225d4f98a2SYan Zheng } 27235d4f98a2SYan Zheng 27245d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 27255d4f98a2SYan Zheng { 27265d4f98a2SYan Zheng struct tree_block *block; 27275d4f98a2SYan Zheng struct rb_node *rb_node; 27285d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 27295d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 27305d4f98a2SYan Zheng rb_erase(rb_node, blocks); 27315d4f98a2SYan Zheng kfree(block); 27325d4f98a2SYan Zheng } 27335d4f98a2SYan Zheng } 27345d4f98a2SYan Zheng 27355d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 27365d4f98a2SYan Zheng struct btrfs_root *reloc_root) 27375d4f98a2SYan Zheng { 27380b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 27395d4f98a2SYan Zheng struct btrfs_root *root; 2740442b1ac5SJosef Bacik int ret; 27415d4f98a2SYan Zheng 27425d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 27435d4f98a2SYan Zheng return 0; 27445d4f98a2SYan Zheng 27450b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 27465d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 27475d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 2748442b1ac5SJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 274900246528SJosef Bacik btrfs_put_root(root); 27505d4f98a2SYan Zheng 2751442b1ac5SJosef Bacik return ret; 27525d4f98a2SYan Zheng } 27535d4f98a2SYan Zheng 27543fd0a558SYan, Zheng static noinline_for_stack 27553fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 27563fd0a558SYan, Zheng struct reloc_control *rc, 27575d4f98a2SYan Zheng struct backref_node *node, 2758dc4103f9SWang Shilong struct backref_edge *edges[]) 27595d4f98a2SYan Zheng { 27605d4f98a2SYan Zheng struct backref_node *next; 27615d4f98a2SYan Zheng struct btrfs_root *root; 27623fd0a558SYan, Zheng int index = 0; 27633fd0a558SYan, Zheng 27645d4f98a2SYan Zheng next = node; 27655d4f98a2SYan Zheng while (1) { 27665d4f98a2SYan Zheng cond_resched(); 27675d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 27685d4f98a2SYan Zheng root = next->root; 27693fd0a558SYan, Zheng BUG_ON(!root); 277027cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 27715d4f98a2SYan Zheng 27725d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 27735d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 27745d4f98a2SYan Zheng break; 27755d4f98a2SYan Zheng } 27765d4f98a2SYan Zheng 27775d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 27783fd0a558SYan, Zheng root = root->reloc_root; 27793fd0a558SYan, Zheng 27803fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 27813fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 27823fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 27833fd0a558SYan, Zheng next->new_bytenr = root->node->start; 278400246528SJosef Bacik btrfs_put_root(next->root); 278500246528SJosef Bacik next->root = btrfs_grab_root(root); 27860b530bc5SJosef Bacik ASSERT(next->root); 27873fd0a558SYan, Zheng list_add_tail(&next->list, 27883fd0a558SYan, Zheng &rc->backref_cache.changed); 27899569cc20SQu Wenruo mark_block_processed(rc, next); 27905d4f98a2SYan Zheng break; 27915d4f98a2SYan Zheng } 27925d4f98a2SYan Zheng 27933fd0a558SYan, Zheng WARN_ON(1); 27945d4f98a2SYan Zheng root = NULL; 27955d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 27965d4f98a2SYan Zheng if (!next || next->level <= node->level) 27975d4f98a2SYan Zheng break; 27985d4f98a2SYan Zheng } 27993fd0a558SYan, Zheng if (!root) 28003fd0a558SYan, Zheng return NULL; 28015d4f98a2SYan Zheng 28023fd0a558SYan, Zheng next = node; 28033fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 28043fd0a558SYan, Zheng while (1) { 28053fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 28063fd0a558SYan, Zheng if (--index < 0) 28073fd0a558SYan, Zheng break; 28083fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 28093fd0a558SYan, Zheng } 28105d4f98a2SYan Zheng return root; 28115d4f98a2SYan Zheng } 28125d4f98a2SYan Zheng 28133fd0a558SYan, Zheng /* 28143fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 28153fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 28163fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 28173fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 28183fd0a558SYan, Zheng */ 28195d4f98a2SYan Zheng static noinline_for_stack 2820147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 28215d4f98a2SYan Zheng { 28223fd0a558SYan, Zheng struct backref_node *next; 28233fd0a558SYan, Zheng struct btrfs_root *root; 28243fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 28255d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28263fd0a558SYan, Zheng int index = 0; 28273fd0a558SYan, Zheng 28283fd0a558SYan, Zheng next = node; 28293fd0a558SYan, Zheng while (1) { 28303fd0a558SYan, Zheng cond_resched(); 28313fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 28323fd0a558SYan, Zheng root = next->root; 28333fd0a558SYan, Zheng BUG_ON(!root); 28343fd0a558SYan, Zheng 283525985edcSLucas De Marchi /* no other choice for non-references counted tree */ 283627cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 28373fd0a558SYan, Zheng return root; 28383fd0a558SYan, Zheng 28393fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 28403fd0a558SYan, Zheng fs_root = root; 28413fd0a558SYan, Zheng 28423fd0a558SYan, Zheng if (next != node) 28433fd0a558SYan, Zheng return NULL; 28443fd0a558SYan, Zheng 28453fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 28463fd0a558SYan, Zheng if (!next || next->level <= node->level) 28473fd0a558SYan, Zheng break; 28483fd0a558SYan, Zheng } 28493fd0a558SYan, Zheng 28503fd0a558SYan, Zheng if (!fs_root) 28513fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 28523fd0a558SYan, Zheng return fs_root; 28535d4f98a2SYan Zheng } 28545d4f98a2SYan Zheng 28555d4f98a2SYan Zheng static noinline_for_stack 28563fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 28573fd0a558SYan, Zheng struct backref_node *node, int reserve) 28585d4f98a2SYan Zheng { 28590b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 28603fd0a558SYan, Zheng struct backref_node *next = node; 28613fd0a558SYan, Zheng struct backref_edge *edge; 28623fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28633fd0a558SYan, Zheng u64 num_bytes = 0; 28643fd0a558SYan, Zheng int index = 0; 28655d4f98a2SYan Zheng 28663fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 28673fd0a558SYan, Zheng 28683fd0a558SYan, Zheng while (next) { 28693fd0a558SYan, Zheng cond_resched(); 28705d4f98a2SYan Zheng while (1) { 28713fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 28725d4f98a2SYan Zheng break; 28735d4f98a2SYan Zheng 28740b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 28753fd0a558SYan, Zheng 28763fd0a558SYan, Zheng if (list_empty(&next->upper)) 28773fd0a558SYan, Zheng break; 28783fd0a558SYan, Zheng 28793fd0a558SYan, Zheng edge = list_entry(next->upper.next, 28803fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 28813fd0a558SYan, Zheng edges[index++] = edge; 28823fd0a558SYan, Zheng next = edge->node[UPPER]; 28835d4f98a2SYan Zheng } 28843fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 28853fd0a558SYan, Zheng } 28863fd0a558SYan, Zheng return num_bytes; 28873fd0a558SYan, Zheng } 28883fd0a558SYan, Zheng 28893fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 28903fd0a558SYan, Zheng struct reloc_control *rc, 28913fd0a558SYan, Zheng struct backref_node *node) 28923fd0a558SYan, Zheng { 28933fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2894da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 28953fd0a558SYan, Zheng u64 num_bytes; 28963fd0a558SYan, Zheng int ret; 28970647bf56SWang Shilong u64 tmp; 28983fd0a558SYan, Zheng 28993fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 29003fd0a558SYan, Zheng 29013fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 29020647bf56SWang Shilong rc->reserved_bytes += num_bytes; 29038ca17f0fSJosef Bacik 29048ca17f0fSJosef Bacik /* 29058ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 29068ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 29078ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 29088ca17f0fSJosef Bacik */ 29090647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 29108ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 29113fd0a558SYan, Zheng if (ret) { 2912da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 29130647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 29140647bf56SWang Shilong tmp <<= 1; 29150647bf56SWang Shilong /* 29160647bf56SWang Shilong * only one thread can access block_rsv at this point, 29170647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 29180647bf56SWang Shilong * we expand more reservation size here to allow enough 291952042d8eSAndrea Gelmini * space for relocation and we will return earlier in 29200647bf56SWang Shilong * enospc case. 29210647bf56SWang Shilong */ 2922da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 29230647bf56SWang Shilong RELOCATION_RESERVED_NODES; 29248ca17f0fSJosef Bacik return -EAGAIN; 29253fd0a558SYan, Zheng } 29263fd0a558SYan, Zheng 29273fd0a558SYan, Zheng return 0; 29283fd0a558SYan, Zheng } 29293fd0a558SYan, Zheng 29305d4f98a2SYan Zheng /* 29315d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 29325d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 29335d4f98a2SYan Zheng * 29345d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 29355d4f98a2SYan Zheng * in that case this function just updates pointers. 29365d4f98a2SYan Zheng */ 29375d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 29383fd0a558SYan, Zheng struct reloc_control *rc, 29395d4f98a2SYan Zheng struct backref_node *node, 29405d4f98a2SYan Zheng struct btrfs_key *key, 29415d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 29425d4f98a2SYan Zheng { 29432ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 29445d4f98a2SYan Zheng struct backref_node *upper; 29455d4f98a2SYan Zheng struct backref_edge *edge; 29465d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 29475d4f98a2SYan Zheng struct btrfs_root *root; 29485d4f98a2SYan Zheng struct extent_buffer *eb; 29495d4f98a2SYan Zheng u32 blocksize; 29505d4f98a2SYan Zheng u64 bytenr; 29515d4f98a2SYan Zheng u64 generation; 29525d4f98a2SYan Zheng int slot; 29535d4f98a2SYan Zheng int ret; 29545d4f98a2SYan Zheng int err = 0; 29555d4f98a2SYan Zheng 29565d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 29575d4f98a2SYan Zheng 29585d4f98a2SYan Zheng path->lowest_level = node->level + 1; 29593fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 29605d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 2961581c1760SQu Wenruo struct btrfs_key first_key; 296282fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 2963581c1760SQu Wenruo 29645d4f98a2SYan Zheng cond_resched(); 29655d4f98a2SYan Zheng 29665d4f98a2SYan Zheng upper = edge->node[UPPER]; 2967dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 29683fd0a558SYan, Zheng BUG_ON(!root); 29695d4f98a2SYan Zheng 29703fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 29713fd0a558SYan, Zheng if (!lowest) { 29723fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 29733fd0a558SYan, Zheng upper->level, &slot); 2974cbca7d59SFilipe Manana if (ret < 0) { 2975cbca7d59SFilipe Manana err = ret; 2976cbca7d59SFilipe Manana goto next; 2977cbca7d59SFilipe Manana } 29783fd0a558SYan, Zheng BUG_ON(ret); 29793fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 29803fd0a558SYan, Zheng if (node->eb->start == bytenr) 29813fd0a558SYan, Zheng goto next; 29823fd0a558SYan, Zheng } 29835d4f98a2SYan Zheng drop_node_buffer(upper); 29843fd0a558SYan, Zheng } 29855d4f98a2SYan Zheng 29865d4f98a2SYan Zheng if (!upper->eb) { 29875d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 29883561b9dbSLiu Bo if (ret) { 29893561b9dbSLiu Bo if (ret < 0) 29905d4f98a2SYan Zheng err = ret; 29913561b9dbSLiu Bo else 29923561b9dbSLiu Bo err = -ENOENT; 29933561b9dbSLiu Bo 29943561b9dbSLiu Bo btrfs_release_path(path); 29955d4f98a2SYan Zheng break; 29965d4f98a2SYan Zheng } 29975d4f98a2SYan Zheng 29983fd0a558SYan, Zheng if (!upper->eb) { 29993fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 30003fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 30013fd0a558SYan, Zheng } else { 30023fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 30033fd0a558SYan, Zheng } 30043fd0a558SYan, Zheng 30053fd0a558SYan, Zheng upper->locked = 1; 30063fd0a558SYan, Zheng path->locks[upper->level] = 0; 30073fd0a558SYan, Zheng 30085d4f98a2SYan Zheng slot = path->slots[upper->level]; 3009b3b4aa74SDavid Sterba btrfs_release_path(path); 30105d4f98a2SYan Zheng } else { 30115d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 30125d4f98a2SYan Zheng &slot); 3013cbca7d59SFilipe Manana if (ret < 0) { 3014cbca7d59SFilipe Manana err = ret; 3015cbca7d59SFilipe Manana goto next; 3016cbca7d59SFilipe Manana } 30175d4f98a2SYan Zheng BUG_ON(ret); 30185d4f98a2SYan Zheng } 30195d4f98a2SYan Zheng 30205d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 30213fd0a558SYan, Zheng if (lowest) { 30224547f4d8SLiu Bo if (bytenr != node->bytenr) { 30234547f4d8SLiu Bo btrfs_err(root->fs_info, 30244547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 30254547f4d8SLiu Bo bytenr, node->bytenr, slot, 30264547f4d8SLiu Bo upper->eb->start); 30274547f4d8SLiu Bo err = -EIO; 30284547f4d8SLiu Bo goto next; 30294547f4d8SLiu Bo } 30305d4f98a2SYan Zheng } else { 30313fd0a558SYan, Zheng if (node->eb->start == bytenr) 30323fd0a558SYan, Zheng goto next; 30335d4f98a2SYan Zheng } 30345d4f98a2SYan Zheng 3035da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 30365d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 3037581c1760SQu Wenruo btrfs_node_key_to_cpu(upper->eb, &first_key, slot); 3038581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, generation, 3039581c1760SQu Wenruo upper->level - 1, &first_key); 304064c043deSLiu Bo if (IS_ERR(eb)) { 304164c043deSLiu Bo err = PTR_ERR(eb); 304264c043deSLiu Bo goto next; 304364c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 3044416bc658SJosef Bacik free_extent_buffer(eb); 304597d9a8a4STsutomu Itoh err = -EIO; 304697d9a8a4STsutomu Itoh goto next; 304797d9a8a4STsutomu Itoh } 30485d4f98a2SYan Zheng btrfs_tree_lock(eb); 30498bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 30505d4f98a2SYan Zheng 30515d4f98a2SYan Zheng if (!node->eb) { 30525d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 30535d4f98a2SYan Zheng slot, &eb); 30543fd0a558SYan, Zheng btrfs_tree_unlock(eb); 30553fd0a558SYan, Zheng free_extent_buffer(eb); 30565d4f98a2SYan Zheng if (ret < 0) { 30575d4f98a2SYan Zheng err = ret; 30583fd0a558SYan, Zheng goto next; 30595d4f98a2SYan Zheng } 30603fd0a558SYan, Zheng BUG_ON(node->eb != eb); 30615d4f98a2SYan Zheng } else { 30625d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 30635d4f98a2SYan Zheng node->eb->start); 30645d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 30655d4f98a2SYan Zheng trans->transid); 30665d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 30675d4f98a2SYan Zheng 306882fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, 30695d4f98a2SYan Zheng node->eb->start, blocksize, 307082fa113fSQu Wenruo upper->eb->start); 307182fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 307282fa113fSQu Wenruo btrfs_init_tree_ref(&ref, node->level, 307382fa113fSQu Wenruo btrfs_header_owner(upper->eb)); 307482fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 30755d4f98a2SYan Zheng BUG_ON(ret); 30765d4f98a2SYan Zheng 30775d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 30785d4f98a2SYan Zheng BUG_ON(ret); 30795d4f98a2SYan Zheng } 30803fd0a558SYan, Zheng next: 30813fd0a558SYan, Zheng if (!upper->pending) 30823fd0a558SYan, Zheng drop_node_buffer(upper); 30833fd0a558SYan, Zheng else 30843fd0a558SYan, Zheng unlock_node_buffer(upper); 30853fd0a558SYan, Zheng if (err) 30863fd0a558SYan, Zheng break; 30875d4f98a2SYan Zheng } 30883fd0a558SYan, Zheng 30893fd0a558SYan, Zheng if (!err && node->pending) { 30903fd0a558SYan, Zheng drop_node_buffer(node); 30913fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 30923fd0a558SYan, Zheng node->pending = 0; 30935d4f98a2SYan Zheng } 30943fd0a558SYan, Zheng 30955d4f98a2SYan Zheng path->lowest_level = 0; 30963fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 30975d4f98a2SYan Zheng return err; 30985d4f98a2SYan Zheng } 30995d4f98a2SYan Zheng 31005d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 31013fd0a558SYan, Zheng struct reloc_control *rc, 31025d4f98a2SYan Zheng struct backref_node *node, 31035d4f98a2SYan Zheng struct btrfs_path *path) 31045d4f98a2SYan Zheng { 31055d4f98a2SYan Zheng struct btrfs_key key; 31065d4f98a2SYan Zheng 31075d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 31083fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 31095d4f98a2SYan Zheng } 31105d4f98a2SYan Zheng 31115d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 31123fd0a558SYan, Zheng struct reloc_control *rc, 31133fd0a558SYan, Zheng struct btrfs_path *path, int err) 31145d4f98a2SYan Zheng { 31153fd0a558SYan, Zheng LIST_HEAD(list); 31163fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 31175d4f98a2SYan Zheng struct backref_node *node; 31185d4f98a2SYan Zheng int level; 31195d4f98a2SYan Zheng int ret; 31205d4f98a2SYan Zheng 31215d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 31225d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 31235d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 31243fd0a558SYan, Zheng struct backref_node, list); 31253fd0a558SYan, Zheng list_move_tail(&node->list, &list); 31263fd0a558SYan, Zheng BUG_ON(!node->pending); 31275d4f98a2SYan Zheng 31283fd0a558SYan, Zheng if (!err) { 31293fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 31305d4f98a2SYan Zheng if (ret < 0) 31315d4f98a2SYan Zheng err = ret; 31325d4f98a2SYan Zheng } 31335d4f98a2SYan Zheng } 31343fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 31353fd0a558SYan, Zheng } 31365d4f98a2SYan Zheng return err; 31375d4f98a2SYan Zheng } 31385d4f98a2SYan Zheng 31395d4f98a2SYan Zheng /* 31405d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 31415d4f98a2SYan Zheng * as processed. 31425d4f98a2SYan Zheng */ 31435d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 31445d4f98a2SYan Zheng struct backref_node *node) 31455d4f98a2SYan Zheng { 31465d4f98a2SYan Zheng struct backref_node *next = node; 31475d4f98a2SYan Zheng struct backref_edge *edge; 31485d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 31495d4f98a2SYan Zheng int index = 0; 31505d4f98a2SYan Zheng 31515d4f98a2SYan Zheng while (next) { 31525d4f98a2SYan Zheng cond_resched(); 31535d4f98a2SYan Zheng while (1) { 31545d4f98a2SYan Zheng if (next->processed) 31555d4f98a2SYan Zheng break; 31565d4f98a2SYan Zheng 31579569cc20SQu Wenruo mark_block_processed(rc, next); 31585d4f98a2SYan Zheng 31595d4f98a2SYan Zheng if (list_empty(&next->upper)) 31605d4f98a2SYan Zheng break; 31615d4f98a2SYan Zheng 31625d4f98a2SYan Zheng edge = list_entry(next->upper.next, 31635d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 31645d4f98a2SYan Zheng edges[index++] = edge; 31655d4f98a2SYan Zheng next = edge->node[UPPER]; 31665d4f98a2SYan Zheng } 31675d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 31685d4f98a2SYan Zheng } 31695d4f98a2SYan Zheng } 31705d4f98a2SYan Zheng 31717476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 31725d4f98a2SYan Zheng { 3173da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 31747476dfdaSDavid Sterba 31755d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 31769655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 31775d4f98a2SYan Zheng return 1; 31785d4f98a2SYan Zheng return 0; 31795d4f98a2SYan Zheng } 31805d4f98a2SYan Zheng 31812ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 31825d4f98a2SYan Zheng struct tree_block *block) 31835d4f98a2SYan Zheng { 31845d4f98a2SYan Zheng struct extent_buffer *eb; 31855d4f98a2SYan Zheng 3186581c1760SQu Wenruo eb = read_tree_block(fs_info, block->bytenr, block->key.offset, 3187581c1760SQu Wenruo block->level, NULL); 318864c043deSLiu Bo if (IS_ERR(eb)) { 318964c043deSLiu Bo return PTR_ERR(eb); 319064c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 3191416bc658SJosef Bacik free_extent_buffer(eb); 3192416bc658SJosef Bacik return -EIO; 3193416bc658SJosef Bacik } 31945d4f98a2SYan Zheng if (block->level == 0) 31955d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 31965d4f98a2SYan Zheng else 31975d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 31985d4f98a2SYan Zheng free_extent_buffer(eb); 31995d4f98a2SYan Zheng block->key_ready = 1; 32005d4f98a2SYan Zheng return 0; 32015d4f98a2SYan Zheng } 32025d4f98a2SYan Zheng 32035d4f98a2SYan Zheng /* 32045d4f98a2SYan Zheng * helper function to relocate a tree block 32055d4f98a2SYan Zheng */ 32065d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 32075d4f98a2SYan Zheng struct reloc_control *rc, 32085d4f98a2SYan Zheng struct backref_node *node, 32095d4f98a2SYan Zheng struct btrfs_key *key, 32105d4f98a2SYan Zheng struct btrfs_path *path) 32115d4f98a2SYan Zheng { 32125d4f98a2SYan Zheng struct btrfs_root *root; 32133fd0a558SYan, Zheng int ret = 0; 32145d4f98a2SYan Zheng 32153fd0a558SYan, Zheng if (!node) 32165d4f98a2SYan Zheng return 0; 32173fd0a558SYan, Zheng 32185f6b2e5cSJosef Bacik /* 32195f6b2e5cSJosef Bacik * If we fail here we want to drop our backref_node because we are going 32205f6b2e5cSJosef Bacik * to start over and regenerate the tree for it. 32215f6b2e5cSJosef Bacik */ 32225f6b2e5cSJosef Bacik ret = reserve_metadata_space(trans, rc, node); 32235f6b2e5cSJosef Bacik if (ret) 32245f6b2e5cSJosef Bacik goto out; 32255f6b2e5cSJosef Bacik 32263fd0a558SYan, Zheng BUG_ON(node->processed); 3227147d256eSZhaolei root = select_one_root(node); 32283fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 32293fd0a558SYan, Zheng update_processed_blocks(rc, node); 32303fd0a558SYan, Zheng goto out; 32315d4f98a2SYan Zheng } 32325d4f98a2SYan Zheng 32333fd0a558SYan, Zheng if (root) { 323427cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 32353fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 32363fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 32373fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 32383fd0a558SYan, Zheng root = root->reloc_root; 32393fd0a558SYan, Zheng node->new_bytenr = root->node->start; 324000246528SJosef Bacik btrfs_put_root(node->root); 324100246528SJosef Bacik node->root = btrfs_grab_root(root); 32420b530bc5SJosef Bacik ASSERT(node->root); 32433fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 32443fd0a558SYan, Zheng } else { 32455d4f98a2SYan Zheng path->lowest_level = node->level; 32465d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 3247b3b4aa74SDavid Sterba btrfs_release_path(path); 32483fd0a558SYan, Zheng if (ret > 0) 32495d4f98a2SYan Zheng ret = 0; 32503fd0a558SYan, Zheng } 32513fd0a558SYan, Zheng if (!ret) 32523fd0a558SYan, Zheng update_processed_blocks(rc, node); 32533fd0a558SYan, Zheng } else { 32543fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 32553fd0a558SYan, Zheng } 32565d4f98a2SYan Zheng out: 32570647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 32583fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 32595d4f98a2SYan Zheng return ret; 32605d4f98a2SYan Zheng } 32615d4f98a2SYan Zheng 32625d4f98a2SYan Zheng /* 32635d4f98a2SYan Zheng * relocate a list of blocks 32645d4f98a2SYan Zheng */ 32655d4f98a2SYan Zheng static noinline_for_stack 32665d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 32675d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 32685d4f98a2SYan Zheng { 32692ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 32705d4f98a2SYan Zheng struct backref_node *node; 32715d4f98a2SYan Zheng struct btrfs_path *path; 32725d4f98a2SYan Zheng struct tree_block *block; 327398ff7b94SQu Wenruo struct tree_block *next; 32745d4f98a2SYan Zheng int ret; 32755d4f98a2SYan Zheng int err = 0; 32765d4f98a2SYan Zheng 32775d4f98a2SYan Zheng path = btrfs_alloc_path(); 3278e1a12670SLiu Bo if (!path) { 3279e1a12670SLiu Bo err = -ENOMEM; 328034c2b290SDavid Sterba goto out_free_blocks; 3281e1a12670SLiu Bo } 32825d4f98a2SYan Zheng 328398ff7b94SQu Wenruo /* Kick in readahead for tree blocks with missing keys */ 328498ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 32855d4f98a2SYan Zheng if (!block->key_ready) 32862ff7e61eSJeff Mahoney readahead_tree_block(fs_info, block->bytenr); 32875d4f98a2SYan Zheng } 32885d4f98a2SYan Zheng 328998ff7b94SQu Wenruo /* Get first keys */ 329098ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 329134c2b290SDavid Sterba if (!block->key_ready) { 32922ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 329334c2b290SDavid Sterba if (err) 329434c2b290SDavid Sterba goto out_free_path; 329534c2b290SDavid Sterba } 32965d4f98a2SYan Zheng } 32975d4f98a2SYan Zheng 329898ff7b94SQu Wenruo /* Do tree relocation */ 329998ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 33003fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 33015d4f98a2SYan Zheng block->level, block->bytenr); 33025d4f98a2SYan Zheng if (IS_ERR(node)) { 33035d4f98a2SYan Zheng err = PTR_ERR(node); 33045d4f98a2SYan Zheng goto out; 33055d4f98a2SYan Zheng } 33065d4f98a2SYan Zheng 33075d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 33085d4f98a2SYan Zheng path); 33095d4f98a2SYan Zheng if (ret < 0) { 33105d4f98a2SYan Zheng err = ret; 331150dbbb71SJosef Bacik break; 33125d4f98a2SYan Zheng } 33135d4f98a2SYan Zheng } 33145d4f98a2SYan Zheng out: 33153fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 33165d4f98a2SYan Zheng 331734c2b290SDavid Sterba out_free_path: 33185d4f98a2SYan Zheng btrfs_free_path(path); 331934c2b290SDavid Sterba out_free_blocks: 3320e1a12670SLiu Bo free_block_list(blocks); 33215d4f98a2SYan Zheng return err; 33225d4f98a2SYan Zheng } 33235d4f98a2SYan Zheng 33245d4f98a2SYan Zheng static noinline_for_stack 3325efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3326efa56464SYan, Zheng struct file_extent_cluster *cluster) 3327efa56464SYan, Zheng { 3328efa56464SYan, Zheng u64 alloc_hint = 0; 3329efa56464SYan, Zheng u64 start; 3330efa56464SYan, Zheng u64 end; 3331efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3332efa56464SYan, Zheng u64 num_bytes; 3333efa56464SYan, Zheng int nr = 0; 3334efa56464SYan, Zheng int ret = 0; 3335dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 3336dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 333718513091SWang Xiaoguang u64 cur_offset; 3338364ecf36SQu Wenruo struct extent_changeset *data_reserved = NULL; 3339efa56464SYan, Zheng 3340efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 33415955102cSAl Viro inode_lock(inode); 3342efa56464SYan, Zheng 3343364ecf36SQu Wenruo ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start, 3344dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 3345efa56464SYan, Zheng if (ret) 3346efa56464SYan, Zheng goto out; 3347efa56464SYan, Zheng 334818513091SWang Xiaoguang cur_offset = prealloc_start; 3349efa56464SYan, Zheng while (nr < cluster->nr) { 3350efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3351efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3352efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3353efa56464SYan, Zheng else 3354efa56464SYan, Zheng end = cluster->end - offset; 3355efa56464SYan, Zheng 3356d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3357efa56464SYan, Zheng num_bytes = end + 1 - start; 335818513091SWang Xiaoguang if (cur_offset < start) 3359bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3360bc42bda2SQu Wenruo cur_offset, start - cur_offset); 3361efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3362efa56464SYan, Zheng num_bytes, num_bytes, 3363efa56464SYan, Zheng end + 1, &alloc_hint); 336418513091SWang Xiaoguang cur_offset = end + 1; 3365d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3366efa56464SYan, Zheng if (ret) 3367efa56464SYan, Zheng break; 3368efa56464SYan, Zheng nr++; 3369efa56464SYan, Zheng } 337018513091SWang Xiaoguang if (cur_offset < prealloc_end) 3371bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3372bc42bda2SQu Wenruo cur_offset, prealloc_end + 1 - cur_offset); 3373efa56464SYan, Zheng out: 33745955102cSAl Viro inode_unlock(inode); 3375364ecf36SQu Wenruo extent_changeset_free(data_reserved); 3376efa56464SYan, Zheng return ret; 3377efa56464SYan, Zheng } 3378efa56464SYan, Zheng 3379efa56464SYan, Zheng static noinline_for_stack 33800257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 33810257bb82SYan, Zheng u64 block_start) 33825d4f98a2SYan Zheng { 33835d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 33845d4f98a2SYan Zheng struct extent_map *em; 33850257bb82SYan, Zheng int ret = 0; 33865d4f98a2SYan Zheng 3387172ddd60SDavid Sterba em = alloc_extent_map(); 33880257bb82SYan, Zheng if (!em) 33890257bb82SYan, Zheng return -ENOMEM; 33900257bb82SYan, Zheng 33915d4f98a2SYan Zheng em->start = start; 33920257bb82SYan, Zheng em->len = end + 1 - start; 33930257bb82SYan, Zheng em->block_len = em->len; 33940257bb82SYan, Zheng em->block_start = block_start; 33955d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 33965d4f98a2SYan Zheng 3397d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 33985d4f98a2SYan Zheng while (1) { 3399890871beSChris Mason write_lock(&em_tree->lock); 340009a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3401890871beSChris Mason write_unlock(&em_tree->lock); 34025d4f98a2SYan Zheng if (ret != -EEXIST) { 34035d4f98a2SYan Zheng free_extent_map(em); 34045d4f98a2SYan Zheng break; 34055d4f98a2SYan Zheng } 3406dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 34075d4f98a2SYan Zheng } 3408d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 34090257bb82SYan, Zheng return ret; 34100257bb82SYan, Zheng } 34115d4f98a2SYan Zheng 3412726a3421SQu Wenruo /* 3413726a3421SQu Wenruo * Allow error injection to test balance cancellation 3414726a3421SQu Wenruo */ 3415726a3421SQu Wenruo int btrfs_should_cancel_balance(struct btrfs_fs_info *fs_info) 3416726a3421SQu Wenruo { 3417726a3421SQu Wenruo return atomic_read(&fs_info->balance_cancel_req); 3418726a3421SQu Wenruo } 3419726a3421SQu Wenruo ALLOW_ERROR_INJECTION(btrfs_should_cancel_balance, TRUE); 3420726a3421SQu Wenruo 34210257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 34220257bb82SYan, Zheng struct file_extent_cluster *cluster) 34230257bb82SYan, Zheng { 34242ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 34250257bb82SYan, Zheng u64 page_start; 34260257bb82SYan, Zheng u64 page_end; 34270257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 34280257bb82SYan, Zheng unsigned long index; 34290257bb82SYan, Zheng unsigned long last_index; 34300257bb82SYan, Zheng struct page *page; 34310257bb82SYan, Zheng struct file_ra_state *ra; 34323b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 34330257bb82SYan, Zheng int nr = 0; 34340257bb82SYan, Zheng int ret = 0; 34350257bb82SYan, Zheng 34360257bb82SYan, Zheng if (!cluster->nr) 34370257bb82SYan, Zheng return 0; 34380257bb82SYan, Zheng 34390257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 34400257bb82SYan, Zheng if (!ra) 34410257bb82SYan, Zheng return -ENOMEM; 34420257bb82SYan, Zheng 3443efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 34440257bb82SYan, Zheng if (ret) 3445efa56464SYan, Zheng goto out; 34460257bb82SYan, Zheng 34470257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 34480257bb82SYan, Zheng 3449efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3450efa56464SYan, Zheng cluster->end - offset, cluster->start); 3451efa56464SYan, Zheng if (ret) 3452efa56464SYan, Zheng goto out; 3453efa56464SYan, Zheng 345409cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 345509cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 34560257bb82SYan, Zheng while (index <= last_index) { 34579f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 34589f3db423SNikolay Borisov PAGE_SIZE); 3459efa56464SYan, Zheng if (ret) 3460efa56464SYan, Zheng goto out; 3461efa56464SYan, Zheng 34620257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 34630257bb82SYan, Zheng if (!page) { 34640257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 34650257bb82SYan, Zheng ra, NULL, index, 34660257bb82SYan, Zheng last_index + 1 - index); 3467a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 34683b16a4e3SJosef Bacik mask); 34690257bb82SYan, Zheng if (!page) { 3470691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 347143b18595SQu Wenruo PAGE_SIZE, true); 347244db1216SFilipe Manana btrfs_delalloc_release_extents(BTRFS_I(inode), 34738702ba93SQu Wenruo PAGE_SIZE); 34740257bb82SYan, Zheng ret = -ENOMEM; 3475efa56464SYan, Zheng goto out; 34760257bb82SYan, Zheng } 34770257bb82SYan, Zheng } 34780257bb82SYan, Zheng 34790257bb82SYan, Zheng if (PageReadahead(page)) { 34800257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 34810257bb82SYan, Zheng ra, NULL, page, index, 34820257bb82SYan, Zheng last_index + 1 - index); 34830257bb82SYan, Zheng } 34840257bb82SYan, Zheng 34850257bb82SYan, Zheng if (!PageUptodate(page)) { 34860257bb82SYan, Zheng btrfs_readpage(NULL, page); 34870257bb82SYan, Zheng lock_page(page); 34880257bb82SYan, Zheng if (!PageUptodate(page)) { 34890257bb82SYan, Zheng unlock_page(page); 349009cbfeafSKirill A. Shutemov put_page(page); 3491691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 349243b18595SQu Wenruo PAGE_SIZE, true); 34938b62f87bSJosef Bacik btrfs_delalloc_release_extents(BTRFS_I(inode), 34948702ba93SQu Wenruo PAGE_SIZE); 34950257bb82SYan, Zheng ret = -EIO; 3496efa56464SYan, Zheng goto out; 34970257bb82SYan, Zheng } 34980257bb82SYan, Zheng } 34990257bb82SYan, Zheng 35004eee4fa4SMiao Xie page_start = page_offset(page); 350109cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 35020257bb82SYan, Zheng 3503d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 35040257bb82SYan, Zheng 35050257bb82SYan, Zheng set_page_extent_mapped(page); 35060257bb82SYan, Zheng 35070257bb82SYan, Zheng if (nr < cluster->nr && 35080257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 35090257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 35100257bb82SYan, Zheng page_start, page_end, 3511ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 35120257bb82SYan, Zheng nr++; 35130257bb82SYan, Zheng } 35140257bb82SYan, Zheng 3515765f3cebSNikolay Borisov ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0, 3516330a5827SNikolay Borisov NULL); 3517765f3cebSNikolay Borisov if (ret) { 3518765f3cebSNikolay Borisov unlock_page(page); 3519765f3cebSNikolay Borisov put_page(page); 3520765f3cebSNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 352143b18595SQu Wenruo PAGE_SIZE, true); 3522765f3cebSNikolay Borisov btrfs_delalloc_release_extents(BTRFS_I(inode), 35238702ba93SQu Wenruo PAGE_SIZE); 3524765f3cebSNikolay Borisov 3525765f3cebSNikolay Borisov clear_extent_bits(&BTRFS_I(inode)->io_tree, 3526765f3cebSNikolay Borisov page_start, page_end, 3527765f3cebSNikolay Borisov EXTENT_LOCKED | EXTENT_BOUNDARY); 3528765f3cebSNikolay Borisov goto out; 3529765f3cebSNikolay Borisov 3530765f3cebSNikolay Borisov } 35310257bb82SYan, Zheng set_page_dirty(page); 35320257bb82SYan, Zheng 35330257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3534d0082371SJeff Mahoney page_start, page_end); 35350257bb82SYan, Zheng unlock_page(page); 353609cbfeafSKirill A. Shutemov put_page(page); 35370257bb82SYan, Zheng 35380257bb82SYan, Zheng index++; 35398702ba93SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); 3540efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 35412ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 35427f913c7cSQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 35437f913c7cSQu Wenruo ret = -ECANCELED; 35447f913c7cSQu Wenruo goto out; 35457f913c7cSQu Wenruo } 35460257bb82SYan, Zheng } 35470257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3548efa56464SYan, Zheng out: 35490257bb82SYan, Zheng kfree(ra); 35500257bb82SYan, Zheng return ret; 35510257bb82SYan, Zheng } 35520257bb82SYan, Zheng 35530257bb82SYan, Zheng static noinline_for_stack 35540257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 35550257bb82SYan, Zheng struct file_extent_cluster *cluster) 35560257bb82SYan, Zheng { 35570257bb82SYan, Zheng int ret; 35580257bb82SYan, Zheng 35590257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 35600257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 35610257bb82SYan, Zheng if (ret) 35620257bb82SYan, Zheng return ret; 35630257bb82SYan, Zheng cluster->nr = 0; 35640257bb82SYan, Zheng } 35650257bb82SYan, Zheng 35660257bb82SYan, Zheng if (!cluster->nr) 35670257bb82SYan, Zheng cluster->start = extent_key->objectid; 35680257bb82SYan, Zheng else 35690257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 35700257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 35710257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 35720257bb82SYan, Zheng cluster->nr++; 35730257bb82SYan, Zheng 35740257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 35750257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 35760257bb82SYan, Zheng if (ret) 35770257bb82SYan, Zheng return ret; 35780257bb82SYan, Zheng cluster->nr = 0; 35790257bb82SYan, Zheng } 35800257bb82SYan, Zheng return 0; 35815d4f98a2SYan Zheng } 35825d4f98a2SYan Zheng 35835d4f98a2SYan Zheng /* 35845d4f98a2SYan Zheng * helper to add a tree block to the list. 35855d4f98a2SYan Zheng * the major work is getting the generation and level of the block 35865d4f98a2SYan Zheng */ 35875d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 35885d4f98a2SYan Zheng struct btrfs_key *extent_key, 35895d4f98a2SYan Zheng struct btrfs_path *path, 35905d4f98a2SYan Zheng struct rb_root *blocks) 35915d4f98a2SYan Zheng { 35925d4f98a2SYan Zheng struct extent_buffer *eb; 35935d4f98a2SYan Zheng struct btrfs_extent_item *ei; 35945d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 35955d4f98a2SYan Zheng struct tree_block *block; 35965d4f98a2SYan Zheng struct rb_node *rb_node; 35975d4f98a2SYan Zheng u32 item_size; 35985d4f98a2SYan Zheng int level = -1; 35997fdf4b60SWang Shilong u64 generation; 36005d4f98a2SYan Zheng 36015d4f98a2SYan Zheng eb = path->nodes[0]; 36025d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 36035d4f98a2SYan Zheng 36043173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 36053173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 36065d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 36075d4f98a2SYan Zheng struct btrfs_extent_item); 36083173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 36095d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 36105d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 36115d4f98a2SYan Zheng } else { 36123173a18fSJosef Bacik level = (int)extent_key->offset; 36133173a18fSJosef Bacik } 36143173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 36156d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3616ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3617ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3618ba3c2b19SNikolay Borisov return -EINVAL; 36193173a18fSJosef Bacik } else { 36205d4f98a2SYan Zheng BUG(); 36215d4f98a2SYan Zheng } 36225d4f98a2SYan Zheng 3623b3b4aa74SDavid Sterba btrfs_release_path(path); 36245d4f98a2SYan Zheng 36255d4f98a2SYan Zheng BUG_ON(level == -1); 36265d4f98a2SYan Zheng 36275d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 36285d4f98a2SYan Zheng if (!block) 36295d4f98a2SYan Zheng return -ENOMEM; 36305d4f98a2SYan Zheng 36315d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3632da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 36335d4f98a2SYan Zheng block->key.offset = generation; 36345d4f98a2SYan Zheng block->level = level; 36355d4f98a2SYan Zheng block->key_ready = 0; 36365d4f98a2SYan Zheng 36375d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 363843c04fb1SJeff Mahoney if (rb_node) 363943c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 36405d4f98a2SYan Zheng 36415d4f98a2SYan Zheng return 0; 36425d4f98a2SYan Zheng } 36435d4f98a2SYan Zheng 36445d4f98a2SYan Zheng /* 36455d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 36465d4f98a2SYan Zheng */ 36475d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 36485d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 36495d4f98a2SYan Zheng struct rb_root *blocks) 36505d4f98a2SYan Zheng { 36510b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 36525d4f98a2SYan Zheng struct btrfs_path *path; 36535d4f98a2SYan Zheng struct btrfs_key key; 36545d4f98a2SYan Zheng int ret; 36550b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 36565d4f98a2SYan Zheng 36577476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 36585d4f98a2SYan Zheng return 0; 36595d4f98a2SYan Zheng 36605d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 36615d4f98a2SYan Zheng return 0; 36625d4f98a2SYan Zheng 36635d4f98a2SYan Zheng path = btrfs_alloc_path(); 36645d4f98a2SYan Zheng if (!path) 36655d4f98a2SYan Zheng return -ENOMEM; 3666aee68ee5SJosef Bacik again: 36675d4f98a2SYan Zheng key.objectid = bytenr; 3668aee68ee5SJosef Bacik if (skinny) { 3669aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3670aee68ee5SJosef Bacik key.offset = (u64)-1; 3671aee68ee5SJosef Bacik } else { 36725d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 36735d4f98a2SYan Zheng key.offset = blocksize; 3674aee68ee5SJosef Bacik } 36755d4f98a2SYan Zheng 36765d4f98a2SYan Zheng path->search_commit_root = 1; 36775d4f98a2SYan Zheng path->skip_locking = 1; 36785d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 36795d4f98a2SYan Zheng if (ret < 0) 36805d4f98a2SYan Zheng goto out; 36815d4f98a2SYan Zheng 3682aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3683aee68ee5SJosef Bacik if (path->slots[0]) { 3684aee68ee5SJosef Bacik path->slots[0]--; 3685aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3686aee68ee5SJosef Bacik path->slots[0]); 36873173a18fSJosef Bacik if (key.objectid == bytenr && 3688aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3689aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3690aee68ee5SJosef Bacik key.offset == blocksize))) 36913173a18fSJosef Bacik ret = 0; 36923173a18fSJosef Bacik } 3693aee68ee5SJosef Bacik 3694aee68ee5SJosef Bacik if (ret) { 3695aee68ee5SJosef Bacik skinny = false; 3696aee68ee5SJosef Bacik btrfs_release_path(path); 3697aee68ee5SJosef Bacik goto again; 3698aee68ee5SJosef Bacik } 3699aee68ee5SJosef Bacik } 3700cdccee99SLiu Bo if (ret) { 3701cdccee99SLiu Bo ASSERT(ret == 1); 3702cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3703cdccee99SLiu Bo btrfs_err(fs_info, 3704cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3705cdccee99SLiu Bo bytenr); 3706cdccee99SLiu Bo WARN_ON(1); 3707cdccee99SLiu Bo ret = -EINVAL; 3708cdccee99SLiu Bo goto out; 3709cdccee99SLiu Bo } 37103173a18fSJosef Bacik 37115d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 37125d4f98a2SYan Zheng out: 37135d4f98a2SYan Zheng btrfs_free_path(path); 37145d4f98a2SYan Zheng return ret; 37155d4f98a2SYan Zheng } 37165d4f98a2SYan Zheng 37170af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 371832da5386SDavid Sterba struct btrfs_block_group *block_group, 37191bbc621eSChris Mason struct inode *inode, 37201bbc621eSChris Mason u64 ino) 37210af3d00bSJosef Bacik { 37220af3d00bSJosef Bacik struct btrfs_key key; 37230af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 37240af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 37250af3d00bSJosef Bacik int ret = 0; 37260af3d00bSJosef Bacik 37270af3d00bSJosef Bacik if (inode) 37280af3d00bSJosef Bacik goto truncate; 37290af3d00bSJosef Bacik 37300af3d00bSJosef Bacik key.objectid = ino; 37310af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 37320af3d00bSJosef Bacik key.offset = 0; 37330af3d00bSJosef Bacik 37344c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 37352e19f1f9SAl Viro if (IS_ERR(inode)) 37360af3d00bSJosef Bacik return -ENOENT; 37370af3d00bSJosef Bacik 37380af3d00bSJosef Bacik truncate: 37392ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 37407b61cd92SMiao Xie &fs_info->global_block_rsv); 37417b61cd92SMiao Xie if (ret) 37427b61cd92SMiao Xie goto out; 37437b61cd92SMiao Xie 37447a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 37450af3d00bSJosef Bacik if (IS_ERR(trans)) { 37463612b495STsutomu Itoh ret = PTR_ERR(trans); 37470af3d00bSJosef Bacik goto out; 37480af3d00bSJosef Bacik } 37490af3d00bSJosef Bacik 375077ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 37510af3d00bSJosef Bacik 37523a45bb20SJeff Mahoney btrfs_end_transaction(trans); 37532ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 37540af3d00bSJosef Bacik out: 37550af3d00bSJosef Bacik iput(inode); 37560af3d00bSJosef Bacik return ret; 37570af3d00bSJosef Bacik } 37580af3d00bSJosef Bacik 37595d4f98a2SYan Zheng /* 376019b546d7SQu Wenruo * Locate the free space cache EXTENT_DATA in root tree leaf and delete the 376119b546d7SQu Wenruo * cache inode, to avoid free space cache data extent blocking data relocation. 37625d4f98a2SYan Zheng */ 376319b546d7SQu Wenruo static int delete_v1_space_cache(struct extent_buffer *leaf, 376419b546d7SQu Wenruo struct btrfs_block_group *block_group, 376519b546d7SQu Wenruo u64 data_bytenr) 37665d4f98a2SYan Zheng { 376719b546d7SQu Wenruo u64 space_cache_ino; 376819b546d7SQu Wenruo struct btrfs_file_extent_item *ei; 37695d4f98a2SYan Zheng struct btrfs_key key; 377019b546d7SQu Wenruo bool found = false; 377119b546d7SQu Wenruo int i; 37725d4f98a2SYan Zheng int ret; 37735d4f98a2SYan Zheng 377419b546d7SQu Wenruo if (btrfs_header_owner(leaf) != BTRFS_ROOT_TREE_OBJECTID) 377519b546d7SQu Wenruo return 0; 37765d4f98a2SYan Zheng 377719b546d7SQu Wenruo for (i = 0; i < btrfs_header_nritems(leaf); i++) { 377819b546d7SQu Wenruo btrfs_item_key_to_cpu(leaf, &key, i); 377919b546d7SQu Wenruo if (key.type != BTRFS_EXTENT_DATA_KEY) 378019b546d7SQu Wenruo continue; 378119b546d7SQu Wenruo ei = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 378219b546d7SQu Wenruo if (btrfs_file_extent_type(leaf, ei) == BTRFS_FILE_EXTENT_REG && 378319b546d7SQu Wenruo btrfs_file_extent_disk_bytenr(leaf, ei) == data_bytenr) { 378419b546d7SQu Wenruo found = true; 378519b546d7SQu Wenruo space_cache_ino = key.objectid; 378619b546d7SQu Wenruo break; 378719b546d7SQu Wenruo } 378819b546d7SQu Wenruo } 378919b546d7SQu Wenruo if (!found) 379019b546d7SQu Wenruo return -ENOENT; 379119b546d7SQu Wenruo ret = delete_block_group_cache(leaf->fs_info, block_group, NULL, 379219b546d7SQu Wenruo space_cache_ino); 37930af3d00bSJosef Bacik return ret; 37945d4f98a2SYan Zheng } 37955d4f98a2SYan Zheng 37965d4f98a2SYan Zheng /* 37972c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 37985d4f98a2SYan Zheng */ 37995d4f98a2SYan Zheng static noinline_for_stack 38005d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 38015d4f98a2SYan Zheng struct btrfs_key *extent_key, 38025d4f98a2SYan Zheng struct btrfs_path *path, 38035d4f98a2SYan Zheng struct rb_root *blocks) 38045d4f98a2SYan Zheng { 380519b546d7SQu Wenruo struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 380619b546d7SQu Wenruo struct ulist *leaves = NULL; 380719b546d7SQu Wenruo struct ulist_iterator leaf_uiter; 380819b546d7SQu Wenruo struct ulist_node *ref_node = NULL; 380919b546d7SQu Wenruo const u32 blocksize = fs_info->nodesize; 3810647f63bdSFilipe David Borba Manana int ret = 0; 38115d4f98a2SYan Zheng 3812b3b4aa74SDavid Sterba btrfs_release_path(path); 381319b546d7SQu Wenruo ret = btrfs_find_all_leafs(NULL, fs_info, extent_key->objectid, 381419b546d7SQu Wenruo 0, &leaves, NULL, true); 381519b546d7SQu Wenruo if (ret < 0) 381619b546d7SQu Wenruo return ret; 381719b546d7SQu Wenruo 381819b546d7SQu Wenruo ULIST_ITER_INIT(&leaf_uiter); 381919b546d7SQu Wenruo while ((ref_node = ulist_next(leaves, &leaf_uiter))) { 382019b546d7SQu Wenruo struct extent_buffer *eb; 382119b546d7SQu Wenruo 382219b546d7SQu Wenruo eb = read_tree_block(fs_info, ref_node->val, 0, 0, NULL); 382319b546d7SQu Wenruo if (IS_ERR(eb)) { 382419b546d7SQu Wenruo ret = PTR_ERR(eb); 382519b546d7SQu Wenruo break; 382619b546d7SQu Wenruo } 382719b546d7SQu Wenruo ret = delete_v1_space_cache(eb, rc->block_group, 382819b546d7SQu Wenruo extent_key->objectid); 382919b546d7SQu Wenruo free_extent_buffer(eb); 383019b546d7SQu Wenruo if (ret < 0) 383119b546d7SQu Wenruo break; 383219b546d7SQu Wenruo ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); 383319b546d7SQu Wenruo if (ret < 0) 383419b546d7SQu Wenruo break; 383519b546d7SQu Wenruo } 383619b546d7SQu Wenruo if (ret < 0) 38375d4f98a2SYan Zheng free_block_list(blocks); 383819b546d7SQu Wenruo ulist_free(leaves); 383919b546d7SQu Wenruo return ret; 38405d4f98a2SYan Zheng } 38415d4f98a2SYan Zheng 38425d4f98a2SYan Zheng /* 38432c016dc2SLiu Bo * helper to find next unprocessed extent 38445d4f98a2SYan Zheng */ 38455d4f98a2SYan Zheng static noinline_for_stack 3846147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 38473fd0a558SYan, Zheng struct btrfs_key *extent_key) 38485d4f98a2SYan Zheng { 38490b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38505d4f98a2SYan Zheng struct btrfs_key key; 38515d4f98a2SYan Zheng struct extent_buffer *leaf; 38525d4f98a2SYan Zheng u64 start, end, last; 38535d4f98a2SYan Zheng int ret; 38545d4f98a2SYan Zheng 3855b3470b5dSDavid Sterba last = rc->block_group->start + rc->block_group->length; 38565d4f98a2SYan Zheng while (1) { 38575d4f98a2SYan Zheng cond_resched(); 38585d4f98a2SYan Zheng if (rc->search_start >= last) { 38595d4f98a2SYan Zheng ret = 1; 38605d4f98a2SYan Zheng break; 38615d4f98a2SYan Zheng } 38625d4f98a2SYan Zheng 38635d4f98a2SYan Zheng key.objectid = rc->search_start; 38645d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 38655d4f98a2SYan Zheng key.offset = 0; 38665d4f98a2SYan Zheng 38675d4f98a2SYan Zheng path->search_commit_root = 1; 38685d4f98a2SYan Zheng path->skip_locking = 1; 38695d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 38705d4f98a2SYan Zheng 0, 0); 38715d4f98a2SYan Zheng if (ret < 0) 38725d4f98a2SYan Zheng break; 38735d4f98a2SYan Zheng next: 38745d4f98a2SYan Zheng leaf = path->nodes[0]; 38755d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 38765d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 38775d4f98a2SYan Zheng if (ret != 0) 38785d4f98a2SYan Zheng break; 38795d4f98a2SYan Zheng leaf = path->nodes[0]; 38805d4f98a2SYan Zheng } 38815d4f98a2SYan Zheng 38825d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 38835d4f98a2SYan Zheng if (key.objectid >= last) { 38845d4f98a2SYan Zheng ret = 1; 38855d4f98a2SYan Zheng break; 38865d4f98a2SYan Zheng } 38875d4f98a2SYan Zheng 38883173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 38893173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 38903173a18fSJosef Bacik path->slots[0]++; 38913173a18fSJosef Bacik goto next; 38923173a18fSJosef Bacik } 38933173a18fSJosef Bacik 38943173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 38955d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 38965d4f98a2SYan Zheng path->slots[0]++; 38975d4f98a2SYan Zheng goto next; 38985d4f98a2SYan Zheng } 38995d4f98a2SYan Zheng 39003173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 39010b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 39023173a18fSJosef Bacik rc->search_start) { 39033173a18fSJosef Bacik path->slots[0]++; 39043173a18fSJosef Bacik goto next; 39053173a18fSJosef Bacik } 39063173a18fSJosef Bacik 39075d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 39085d4f98a2SYan Zheng key.objectid, &start, &end, 3909e6138876SJosef Bacik EXTENT_DIRTY, NULL); 39105d4f98a2SYan Zheng 39115d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3912b3b4aa74SDavid Sterba btrfs_release_path(path); 39135d4f98a2SYan Zheng rc->search_start = end + 1; 39145d4f98a2SYan Zheng } else { 39153173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 39165d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 39173173a18fSJosef Bacik else 39183173a18fSJosef Bacik rc->search_start = key.objectid + 39190b246afaSJeff Mahoney fs_info->nodesize; 39203fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 39215d4f98a2SYan Zheng return 0; 39225d4f98a2SYan Zheng } 39235d4f98a2SYan Zheng } 3924b3b4aa74SDavid Sterba btrfs_release_path(path); 39255d4f98a2SYan Zheng return ret; 39265d4f98a2SYan Zheng } 39275d4f98a2SYan Zheng 39285d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 39295d4f98a2SYan Zheng { 39305d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39317585717fSChris Mason 39327585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39335d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 39347585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39355d4f98a2SYan Zheng } 39365d4f98a2SYan Zheng 39375d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 39385d4f98a2SYan Zheng { 39395d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39407585717fSChris Mason 39417585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39425d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 39437585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39445d4f98a2SYan Zheng } 39455d4f98a2SYan Zheng 39465d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 39475d4f98a2SYan Zheng { 39485d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39495d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39505d4f98a2SYan Zheng return 1; 39515d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 39525d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39535d4f98a2SYan Zheng return 1; 39545d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39555d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 39565d4f98a2SYan Zheng return 1; 39575d4f98a2SYan Zheng return 0; 39585d4f98a2SYan Zheng } 39595d4f98a2SYan Zheng 39603fd0a558SYan, Zheng static noinline_for_stack 39613fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 39623fd0a558SYan, Zheng { 39633fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3964ac2fabacSJosef Bacik int ret; 39653fd0a558SYan, Zheng 39662ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 396766d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 39683fd0a558SYan, Zheng if (!rc->block_rsv) 39693fd0a558SYan, Zheng return -ENOMEM; 39703fd0a558SYan, Zheng 39713fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 3972b3470b5dSDavid Sterba rc->search_start = rc->block_group->start; 39733fd0a558SYan, Zheng rc->extents_found = 0; 39743fd0a558SYan, Zheng rc->nodes_relocated = 0; 39753fd0a558SYan, Zheng rc->merging_rsv_size = 0; 39760647bf56SWang Shilong rc->reserved_bytes = 0; 3977da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 39780647bf56SWang Shilong RELOCATION_RESERVED_NODES; 3979ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 3980ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3981ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3982ac2fabacSJosef Bacik if (ret) 3983ac2fabacSJosef Bacik return ret; 39843fd0a558SYan, Zheng 39853fd0a558SYan, Zheng rc->create_reloc_tree = 1; 39863fd0a558SYan, Zheng set_reloc_control(rc); 39873fd0a558SYan, Zheng 39887a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 398928818947SLiu Bo if (IS_ERR(trans)) { 399028818947SLiu Bo unset_reloc_control(rc); 399128818947SLiu Bo /* 399228818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 399328818947SLiu Bo * cleanup. And callers are responsible to free the above 399428818947SLiu Bo * block rsv. 399528818947SLiu Bo */ 399628818947SLiu Bo return PTR_ERR(trans); 399728818947SLiu Bo } 39983a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 39993fd0a558SYan, Zheng return 0; 40003fd0a558SYan, Zheng } 400176dda93cSYan, Zheng 40025d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 40035d4f98a2SYan Zheng { 40042ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 40055d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 40065d4f98a2SYan Zheng struct btrfs_key key; 40075d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 40085d4f98a2SYan Zheng struct btrfs_path *path; 40095d4f98a2SYan Zheng struct btrfs_extent_item *ei; 40105d4f98a2SYan Zheng u64 flags; 40115d4f98a2SYan Zheng u32 item_size; 40125d4f98a2SYan Zheng int ret; 40135d4f98a2SYan Zheng int err = 0; 4014c87f08caSChris Mason int progress = 0; 40155d4f98a2SYan Zheng 40165d4f98a2SYan Zheng path = btrfs_alloc_path(); 40173fd0a558SYan, Zheng if (!path) 40185d4f98a2SYan Zheng return -ENOMEM; 4019e4058b54SDavid Sterba path->reada = READA_FORWARD; 40203fd0a558SYan, Zheng 40213fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 40223fd0a558SYan, Zheng if (ret) { 40233fd0a558SYan, Zheng err = ret; 40243fd0a558SYan, Zheng goto out_free; 40252423fdfbSJiri Slaby } 40265d4f98a2SYan Zheng 40275d4f98a2SYan Zheng while (1) { 40280647bf56SWang Shilong rc->reserved_bytes = 0; 40290647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 40300647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 40310647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 40320647bf56SWang Shilong if (ret) { 40330647bf56SWang Shilong err = ret; 40340647bf56SWang Shilong break; 40350647bf56SWang Shilong } 4036c87f08caSChris Mason progress++; 4037a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 40380f788c58SLiu Bo if (IS_ERR(trans)) { 40390f788c58SLiu Bo err = PTR_ERR(trans); 40400f788c58SLiu Bo trans = NULL; 40410f788c58SLiu Bo break; 40420f788c58SLiu Bo } 4043c87f08caSChris Mason restart: 40443fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 40453a45bb20SJeff Mahoney btrfs_end_transaction(trans); 404642a657f5SPan Bian trans = NULL; 40473fd0a558SYan, Zheng continue; 40483fd0a558SYan, Zheng } 40493fd0a558SYan, Zheng 4050147d256eSZhaolei ret = find_next_extent(rc, path, &key); 40515d4f98a2SYan Zheng if (ret < 0) 40525d4f98a2SYan Zheng err = ret; 40535d4f98a2SYan Zheng if (ret != 0) 40545d4f98a2SYan Zheng break; 40555d4f98a2SYan Zheng 40565d4f98a2SYan Zheng rc->extents_found++; 40575d4f98a2SYan Zheng 40585d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 40595d4f98a2SYan Zheng struct btrfs_extent_item); 40603fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 40615d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 40625d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 40635d4f98a2SYan Zheng ret = check_extent_flags(flags); 40645d4f98a2SYan Zheng BUG_ON(ret); 40656d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 4066ba3c2b19SNikolay Borisov err = -EINVAL; 4067ba3c2b19SNikolay Borisov btrfs_print_v0_err(trans->fs_info); 4068ba3c2b19SNikolay Borisov btrfs_abort_transaction(trans, err); 4069ba3c2b19SNikolay Borisov break; 40705d4f98a2SYan Zheng } else { 40715d4f98a2SYan Zheng BUG(); 40725d4f98a2SYan Zheng } 40735d4f98a2SYan Zheng 40745d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 40755d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 40765d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 40775d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40785d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 40795d4f98a2SYan Zheng } else { 4080b3b4aa74SDavid Sterba btrfs_release_path(path); 40815d4f98a2SYan Zheng ret = 0; 40825d4f98a2SYan Zheng } 40835d4f98a2SYan Zheng if (ret < 0) { 40843fd0a558SYan, Zheng err = ret; 40855d4f98a2SYan Zheng break; 40865d4f98a2SYan Zheng } 40875d4f98a2SYan Zheng 40885d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 40895d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 40905d4f98a2SYan Zheng if (ret < 0) { 40913fd0a558SYan, Zheng if (ret != -EAGAIN) { 40925d4f98a2SYan Zheng err = ret; 40935d4f98a2SYan Zheng break; 40945d4f98a2SYan Zheng } 40953fd0a558SYan, Zheng rc->extents_found--; 40963fd0a558SYan, Zheng rc->search_start = key.objectid; 40973fd0a558SYan, Zheng } 40985d4f98a2SYan Zheng } 40995d4f98a2SYan Zheng 41003a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 41012ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 41023fd0a558SYan, Zheng trans = NULL; 41035d4f98a2SYan Zheng 41045d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 41055d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 41065d4f98a2SYan Zheng rc->found_file_extent = 1; 41070257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 41083fd0a558SYan, Zheng &key, &rc->cluster); 41095d4f98a2SYan Zheng if (ret < 0) { 41105d4f98a2SYan Zheng err = ret; 41115d4f98a2SYan Zheng break; 41125d4f98a2SYan Zheng } 41135d4f98a2SYan Zheng } 4114f31ea088SQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 4115f31ea088SQu Wenruo err = -ECANCELED; 4116f31ea088SQu Wenruo break; 4117f31ea088SQu Wenruo } 41185d4f98a2SYan Zheng } 4119c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 412043a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 41219689457bSShilong Wang if (ret == 1) { 4122c87f08caSChris Mason err = 0; 4123c87f08caSChris Mason progress = 0; 4124c87f08caSChris Mason goto restart; 4125c87f08caSChris Mason } 4126c87f08caSChris Mason } 41273fd0a558SYan, Zheng 4128b3b4aa74SDavid Sterba btrfs_release_path(path); 412991166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 41305d4f98a2SYan Zheng 41315d4f98a2SYan Zheng if (trans) { 41323a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 41332ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 41345d4f98a2SYan Zheng } 41355d4f98a2SYan Zheng 41360257bb82SYan, Zheng if (!err) { 41373fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 41383fd0a558SYan, Zheng &rc->cluster); 41390257bb82SYan, Zheng if (ret < 0) 41400257bb82SYan, Zheng err = ret; 41410257bb82SYan, Zheng } 41420257bb82SYan, Zheng 41433fd0a558SYan, Zheng rc->create_reloc_tree = 0; 41443fd0a558SYan, Zheng set_reloc_control(rc); 41450257bb82SYan, Zheng 41463fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 414763f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 41485d4f98a2SYan Zheng 41497f913c7cSQu Wenruo /* 41507f913c7cSQu Wenruo * Even in the case when the relocation is cancelled, we should all go 41517f913c7cSQu Wenruo * through prepare_to_merge() and merge_reloc_roots(). 41527f913c7cSQu Wenruo * 41537f913c7cSQu Wenruo * For error (including cancelled balance), prepare_to_merge() will 41547f913c7cSQu Wenruo * mark all reloc trees orphan, then queue them for cleanup in 41557f913c7cSQu Wenruo * merge_reloc_roots() 41567f913c7cSQu Wenruo */ 41573fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 41585d4f98a2SYan Zheng 41595d4f98a2SYan Zheng merge_reloc_roots(rc); 41605d4f98a2SYan Zheng 41613fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 41625d4f98a2SYan Zheng unset_reloc_control(rc); 416363f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 41645d4f98a2SYan Zheng 41655d4f98a2SYan Zheng /* get rid of pinned extents */ 41667a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 416762b99540SQu Wenruo if (IS_ERR(trans)) { 41683612b495STsutomu Itoh err = PTR_ERR(trans); 416962b99540SQu Wenruo goto out_free; 417062b99540SQu Wenruo } 41713a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 41726217b0faSJosef Bacik out_free: 4173d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4174d2311e69SQu Wenruo if (ret < 0 && !err) 4175d2311e69SQu Wenruo err = ret; 41762ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 41773fd0a558SYan, Zheng btrfs_free_path(path); 41785d4f98a2SYan Zheng return err; 41795d4f98a2SYan Zheng } 41805d4f98a2SYan Zheng 41815d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 41820257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 41835d4f98a2SYan Zheng { 41845d4f98a2SYan Zheng struct btrfs_path *path; 41855d4f98a2SYan Zheng struct btrfs_inode_item *item; 41865d4f98a2SYan Zheng struct extent_buffer *leaf; 41875d4f98a2SYan Zheng int ret; 41885d4f98a2SYan Zheng 41895d4f98a2SYan Zheng path = btrfs_alloc_path(); 41905d4f98a2SYan Zheng if (!path) 41915d4f98a2SYan Zheng return -ENOMEM; 41925d4f98a2SYan Zheng 41935d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 41945d4f98a2SYan Zheng if (ret) 41955d4f98a2SYan Zheng goto out; 41965d4f98a2SYan Zheng 41975d4f98a2SYan Zheng leaf = path->nodes[0]; 41985d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 4199b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 42005d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 42010257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 42025d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 42033fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 42043fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 42055d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 42065d4f98a2SYan Zheng out: 42075d4f98a2SYan Zheng btrfs_free_path(path); 42085d4f98a2SYan Zheng return ret; 42095d4f98a2SYan Zheng } 42105d4f98a2SYan Zheng 42115d4f98a2SYan Zheng /* 42125d4f98a2SYan Zheng * helper to create inode for data relocation. 42135d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 42145d4f98a2SYan Zheng */ 42153fd0a558SYan, Zheng static noinline_for_stack 42163fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 421732da5386SDavid Sterba struct btrfs_block_group *group) 42185d4f98a2SYan Zheng { 42195d4f98a2SYan Zheng struct inode *inode = NULL; 42205d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 42215d4f98a2SYan Zheng struct btrfs_root *root; 42225d4f98a2SYan Zheng struct btrfs_key key; 42234624900dSZhaolei u64 objectid; 42245d4f98a2SYan Zheng int err = 0; 42255d4f98a2SYan Zheng 42265d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 42275d4f98a2SYan Zheng if (IS_ERR(root)) 42285d4f98a2SYan Zheng return ERR_CAST(root); 42295d4f98a2SYan Zheng 4230a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 423176deacf0SJosef Bacik if (IS_ERR(trans)) { 423200246528SJosef Bacik btrfs_put_root(root); 42333fd0a558SYan, Zheng return ERR_CAST(trans); 423476deacf0SJosef Bacik } 42355d4f98a2SYan Zheng 4236581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 42375d4f98a2SYan Zheng if (err) 42385d4f98a2SYan Zheng goto out; 42395d4f98a2SYan Zheng 42400257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 42415d4f98a2SYan Zheng BUG_ON(err); 42425d4f98a2SYan Zheng 42435d4f98a2SYan Zheng key.objectid = objectid; 42445d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 42455d4f98a2SYan Zheng key.offset = 0; 42464c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 42472e19f1f9SAl Viro BUG_ON(IS_ERR(inode)); 4248b3470b5dSDavid Sterba BTRFS_I(inode)->index_cnt = group->start; 42495d4f98a2SYan Zheng 425073f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 42515d4f98a2SYan Zheng out: 425200246528SJosef Bacik btrfs_put_root(root); 42533a45bb20SJeff Mahoney btrfs_end_transaction(trans); 42542ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 42555d4f98a2SYan Zheng if (err) { 42565d4f98a2SYan Zheng if (inode) 42575d4f98a2SYan Zheng iput(inode); 42585d4f98a2SYan Zheng inode = ERR_PTR(err); 42595d4f98a2SYan Zheng } 42605d4f98a2SYan Zheng return inode; 42615d4f98a2SYan Zheng } 42625d4f98a2SYan Zheng 4263c258d6e3SQu Wenruo static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 42643fd0a558SYan, Zheng { 42653fd0a558SYan, Zheng struct reloc_control *rc; 42663fd0a558SYan, Zheng 42673fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 42683fd0a558SYan, Zheng if (!rc) 42693fd0a558SYan, Zheng return NULL; 42703fd0a558SYan, Zheng 42713fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 4272d2311e69SQu Wenruo INIT_LIST_HEAD(&rc->dirty_subvol_roots); 42732433bea5SQu Wenruo backref_cache_init(fs_info, &rc->backref_cache, 1); 42743fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 427543eb5f29SQu Wenruo extent_io_tree_init(fs_info, &rc->processed_blocks, 427643eb5f29SQu Wenruo IO_TREE_RELOC_BLOCKS, NULL); 42773fd0a558SYan, Zheng return rc; 42783fd0a558SYan, Zheng } 42793fd0a558SYan, Zheng 42801a0afa0eSJosef Bacik static void free_reloc_control(struct reloc_control *rc) 42811a0afa0eSJosef Bacik { 42821a0afa0eSJosef Bacik struct mapping_node *node, *tmp; 42831a0afa0eSJosef Bacik 42841a0afa0eSJosef Bacik free_reloc_roots(&rc->reloc_roots); 42851a0afa0eSJosef Bacik rbtree_postorder_for_each_entry_safe(node, tmp, 42861a0afa0eSJosef Bacik &rc->reloc_root_tree.rb_root, rb_node) 42871a0afa0eSJosef Bacik kfree(node); 42881a0afa0eSJosef Bacik 42891a0afa0eSJosef Bacik kfree(rc); 42901a0afa0eSJosef Bacik } 42911a0afa0eSJosef Bacik 42925d4f98a2SYan Zheng /* 4293ebce0e01SAdam Borowski * Print the block group being relocated 4294ebce0e01SAdam Borowski */ 4295ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 429632da5386SDavid Sterba struct btrfs_block_group *block_group) 4297ebce0e01SAdam Borowski { 4298f89e09cfSAnand Jain char buf[128] = {'\0'}; 4299ebce0e01SAdam Borowski 4300f89e09cfSAnand Jain btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); 4301ebce0e01SAdam Borowski 4302ebce0e01SAdam Borowski btrfs_info(fs_info, 4303ebce0e01SAdam Borowski "relocating block group %llu flags %s", 4304b3470b5dSDavid Sterba block_group->start, buf); 4305ebce0e01SAdam Borowski } 4306ebce0e01SAdam Borowski 4307430640e3SQu Wenruo static const char *stage_to_string(int stage) 4308430640e3SQu Wenruo { 4309430640e3SQu Wenruo if (stage == MOVE_DATA_EXTENTS) 4310430640e3SQu Wenruo return "move data extents"; 4311430640e3SQu Wenruo if (stage == UPDATE_DATA_PTRS) 4312430640e3SQu Wenruo return "update data pointers"; 4313430640e3SQu Wenruo return "unknown"; 4314430640e3SQu Wenruo } 4315430640e3SQu Wenruo 4316ebce0e01SAdam Borowski /* 43175d4f98a2SYan Zheng * function to relocate all extents in a block group. 43185d4f98a2SYan Zheng */ 43196bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 43205d4f98a2SYan Zheng { 432132da5386SDavid Sterba struct btrfs_block_group *bg; 43226bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 43235d4f98a2SYan Zheng struct reloc_control *rc; 43240af3d00bSJosef Bacik struct inode *inode; 43250af3d00bSJosef Bacik struct btrfs_path *path; 43265d4f98a2SYan Zheng int ret; 4327f0486c68SYan, Zheng int rw = 0; 43285d4f98a2SYan Zheng int err = 0; 43295d4f98a2SYan Zheng 4330eede2bf3SOmar Sandoval bg = btrfs_lookup_block_group(fs_info, group_start); 4331eede2bf3SOmar Sandoval if (!bg) 4332eede2bf3SOmar Sandoval return -ENOENT; 4333eede2bf3SOmar Sandoval 4334eede2bf3SOmar Sandoval if (btrfs_pinned_by_swapfile(fs_info, bg)) { 4335eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 4336eede2bf3SOmar Sandoval return -ETXTBSY; 4337eede2bf3SOmar Sandoval } 4338eede2bf3SOmar Sandoval 4339c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 4340eede2bf3SOmar Sandoval if (!rc) { 4341eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 43425d4f98a2SYan Zheng return -ENOMEM; 4343eede2bf3SOmar Sandoval } 43445d4f98a2SYan Zheng 4345f0486c68SYan, Zheng rc->extent_root = extent_root; 4346eede2bf3SOmar Sandoval rc->block_group = bg; 43475d4f98a2SYan Zheng 4348b12de528SQu Wenruo ret = btrfs_inc_block_group_ro(rc->block_group, true); 4349f0486c68SYan, Zheng if (ret) { 4350f0486c68SYan, Zheng err = ret; 4351f0486c68SYan, Zheng goto out; 4352f0486c68SYan, Zheng } 4353f0486c68SYan, Zheng rw = 1; 4354f0486c68SYan, Zheng 43550af3d00bSJosef Bacik path = btrfs_alloc_path(); 43560af3d00bSJosef Bacik if (!path) { 43570af3d00bSJosef Bacik err = -ENOMEM; 43580af3d00bSJosef Bacik goto out; 43590af3d00bSJosef Bacik } 43600af3d00bSJosef Bacik 43617949f339SDavid Sterba inode = lookup_free_space_inode(rc->block_group, path); 43620af3d00bSJosef Bacik btrfs_free_path(path); 43630af3d00bSJosef Bacik 43640af3d00bSJosef Bacik if (!IS_ERR(inode)) 43651bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 43660af3d00bSJosef Bacik else 43670af3d00bSJosef Bacik ret = PTR_ERR(inode); 43680af3d00bSJosef Bacik 43690af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 43700af3d00bSJosef Bacik err = ret; 43710af3d00bSJosef Bacik goto out; 43720af3d00bSJosef Bacik } 43730af3d00bSJosef Bacik 43745d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 43755d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 43765d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 43775d4f98a2SYan Zheng rc->data_inode = NULL; 43785d4f98a2SYan Zheng goto out; 43795d4f98a2SYan Zheng } 43805d4f98a2SYan Zheng 43810b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 43825d4f98a2SYan Zheng 43839cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4384f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 43856374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 4386b3470b5dSDavid Sterba rc->block_group->start, 4387b3470b5dSDavid Sterba rc->block_group->length); 43885d4f98a2SYan Zheng 43895d4f98a2SYan Zheng while (1) { 4390430640e3SQu Wenruo int finishes_stage; 4391430640e3SQu Wenruo 439276dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 43935d4f98a2SYan Zheng ret = relocate_block_group(rc); 439476dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 4395ff612ba7SJosef Bacik if (ret < 0) 43965d4f98a2SYan Zheng err = ret; 4397ff612ba7SJosef Bacik 4398430640e3SQu Wenruo finishes_stage = rc->stage; 4399ff612ba7SJosef Bacik /* 4400ff612ba7SJosef Bacik * We may have gotten ENOSPC after we already dirtied some 4401ff612ba7SJosef Bacik * extents. If writeout happens while we're relocating a 4402ff612ba7SJosef Bacik * different block group we could end up hitting the 4403ff612ba7SJosef Bacik * BUG_ON(rc->stage == UPDATE_DATA_PTRS) in 4404ff612ba7SJosef Bacik * btrfs_reloc_cow_block. Make sure we write everything out 4405ff612ba7SJosef Bacik * properly so we don't trip over this problem, and then break 4406ff612ba7SJosef Bacik * out of the loop if we hit an error. 4407ff612ba7SJosef Bacik */ 4408ff612ba7SJosef Bacik if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 4409ff612ba7SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 4410ff612ba7SJosef Bacik (u64)-1); 4411ff612ba7SJosef Bacik if (ret) 4412ff612ba7SJosef Bacik err = ret; 4413ff612ba7SJosef Bacik invalidate_mapping_pages(rc->data_inode->i_mapping, 4414ff612ba7SJosef Bacik 0, -1); 4415ff612ba7SJosef Bacik rc->stage = UPDATE_DATA_PTRS; 44165d4f98a2SYan Zheng } 44175d4f98a2SYan Zheng 4418ff612ba7SJosef Bacik if (err < 0) 4419ff612ba7SJosef Bacik goto out; 4420ff612ba7SJosef Bacik 44215d4f98a2SYan Zheng if (rc->extents_found == 0) 44225d4f98a2SYan Zheng break; 44235d4f98a2SYan Zheng 4424430640e3SQu Wenruo btrfs_info(fs_info, "found %llu extents, stage: %s", 4425430640e3SQu Wenruo rc->extents_found, stage_to_string(finishes_stage)); 44265d4f98a2SYan Zheng } 44275d4f98a2SYan Zheng 44285d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 44295d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 4430bf38be65SDavid Sterba WARN_ON(rc->block_group->used > 0); 44315d4f98a2SYan Zheng out: 4432f0486c68SYan, Zheng if (err && rw) 44332ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 44345d4f98a2SYan Zheng iput(rc->data_inode); 44355d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 44361a0afa0eSJosef Bacik free_reloc_control(rc); 44375d4f98a2SYan Zheng return err; 44385d4f98a2SYan Zheng } 44395d4f98a2SYan Zheng 444076dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 444176dda93cSYan, Zheng { 44420b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 444376dda93cSYan, Zheng struct btrfs_trans_handle *trans; 444479787eaaSJeff Mahoney int ret, err; 444576dda93cSYan, Zheng 44460b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 444779787eaaSJeff Mahoney if (IS_ERR(trans)) 444879787eaaSJeff Mahoney return PTR_ERR(trans); 444976dda93cSYan, Zheng 445076dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 445176dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 445276dda93cSYan, Zheng root->root_item.drop_level = 0; 445376dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 44540b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 445576dda93cSYan, Zheng &root->root_key, &root->root_item); 445676dda93cSYan, Zheng 44573a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 445879787eaaSJeff Mahoney if (err) 445979787eaaSJeff Mahoney return err; 446079787eaaSJeff Mahoney return ret; 446176dda93cSYan, Zheng } 446276dda93cSYan, Zheng 44635d4f98a2SYan Zheng /* 44645d4f98a2SYan Zheng * recover relocation interrupted by system crash. 44655d4f98a2SYan Zheng * 44665d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 44675d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 44685d4f98a2SYan Zheng */ 44695d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 44705d4f98a2SYan Zheng { 44710b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 44725d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 44735d4f98a2SYan Zheng struct btrfs_key key; 44745d4f98a2SYan Zheng struct btrfs_root *fs_root; 44755d4f98a2SYan Zheng struct btrfs_root *reloc_root; 44765d4f98a2SYan Zheng struct btrfs_path *path; 44775d4f98a2SYan Zheng struct extent_buffer *leaf; 44785d4f98a2SYan Zheng struct reloc_control *rc = NULL; 44795d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 44805d4f98a2SYan Zheng int ret; 44815d4f98a2SYan Zheng int err = 0; 44825d4f98a2SYan Zheng 44835d4f98a2SYan Zheng path = btrfs_alloc_path(); 44845d4f98a2SYan Zheng if (!path) 44855d4f98a2SYan Zheng return -ENOMEM; 4486e4058b54SDavid Sterba path->reada = READA_BACK; 44875d4f98a2SYan Zheng 44885d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 44895d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 44905d4f98a2SYan Zheng key.offset = (u64)-1; 44915d4f98a2SYan Zheng 44925d4f98a2SYan Zheng while (1) { 44930b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 44945d4f98a2SYan Zheng path, 0, 0); 44955d4f98a2SYan Zheng if (ret < 0) { 44965d4f98a2SYan Zheng err = ret; 44975d4f98a2SYan Zheng goto out; 44985d4f98a2SYan Zheng } 44995d4f98a2SYan Zheng if (ret > 0) { 45005d4f98a2SYan Zheng if (path->slots[0] == 0) 45015d4f98a2SYan Zheng break; 45025d4f98a2SYan Zheng path->slots[0]--; 45035d4f98a2SYan Zheng } 45045d4f98a2SYan Zheng leaf = path->nodes[0]; 45055d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4506b3b4aa74SDavid Sterba btrfs_release_path(path); 45075d4f98a2SYan Zheng 45085d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 45095d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 45105d4f98a2SYan Zheng break; 45115d4f98a2SYan Zheng 45123dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(root, &key); 45135d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 45145d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 45155d4f98a2SYan Zheng goto out; 45165d4f98a2SYan Zheng } 45175d4f98a2SYan Zheng 45183dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 45195d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 45205d4f98a2SYan Zheng 45215d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 45220b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, 45235d4f98a2SYan Zheng reloc_root->root_key.offset); 45245d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 452576dda93cSYan, Zheng ret = PTR_ERR(fs_root); 452676dda93cSYan, Zheng if (ret != -ENOENT) { 452776dda93cSYan, Zheng err = ret; 45285d4f98a2SYan Zheng goto out; 45295d4f98a2SYan Zheng } 453079787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 453179787eaaSJeff Mahoney if (ret < 0) { 453279787eaaSJeff Mahoney err = ret; 453379787eaaSJeff Mahoney goto out; 453479787eaaSJeff Mahoney } 4535932fd26dSJosef Bacik } else { 453600246528SJosef Bacik btrfs_put_root(fs_root); 453776dda93cSYan, Zheng } 45385d4f98a2SYan Zheng } 45395d4f98a2SYan Zheng 45405d4f98a2SYan Zheng if (key.offset == 0) 45415d4f98a2SYan Zheng break; 45425d4f98a2SYan Zheng 45435d4f98a2SYan Zheng key.offset--; 45445d4f98a2SYan Zheng } 4545b3b4aa74SDavid Sterba btrfs_release_path(path); 45465d4f98a2SYan Zheng 45475d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 45485d4f98a2SYan Zheng goto out; 45495d4f98a2SYan Zheng 4550c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 45515d4f98a2SYan Zheng if (!rc) { 45525d4f98a2SYan Zheng err = -ENOMEM; 45535d4f98a2SYan Zheng goto out; 45545d4f98a2SYan Zheng } 45555d4f98a2SYan Zheng 45560b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 45575d4f98a2SYan Zheng 45585d4f98a2SYan Zheng set_reloc_control(rc); 45595d4f98a2SYan Zheng 45607a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 45613612b495STsutomu Itoh if (IS_ERR(trans)) { 45623612b495STsutomu Itoh err = PTR_ERR(trans); 4563fb2d83eeSJosef Bacik goto out_unset; 45643612b495STsutomu Itoh } 45653fd0a558SYan, Zheng 45663fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 45673fd0a558SYan, Zheng 45685d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 45695d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 45705d4f98a2SYan Zheng struct btrfs_root, root_list); 45715d4f98a2SYan Zheng list_del(&reloc_root->root_list); 45725d4f98a2SYan Zheng 45735d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 45745d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 45755d4f98a2SYan Zheng &rc->reloc_roots); 45765d4f98a2SYan Zheng continue; 45775d4f98a2SYan Zheng } 45785d4f98a2SYan Zheng 45790b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, reloc_root->root_key.offset); 458079787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 458179787eaaSJeff Mahoney err = PTR_ERR(fs_root); 4582ca1aa281SJosef Bacik list_add_tail(&reloc_root->root_list, &reloc_roots); 45831402d17dSXiyu Yang btrfs_end_transaction(trans); 4584fb2d83eeSJosef Bacik goto out_unset; 458579787eaaSJeff Mahoney } 45865d4f98a2SYan Zheng 4587ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 458879787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 4589f44deb74SJosef Bacik fs_root->reloc_root = btrfs_grab_root(reloc_root); 459000246528SJosef Bacik btrfs_put_root(fs_root); 45915d4f98a2SYan Zheng } 45925d4f98a2SYan Zheng 45933a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 459479787eaaSJeff Mahoney if (err) 4595fb2d83eeSJosef Bacik goto out_unset; 45965d4f98a2SYan Zheng 45975d4f98a2SYan Zheng merge_reloc_roots(rc); 45985d4f98a2SYan Zheng 45995d4f98a2SYan Zheng unset_reloc_control(rc); 46005d4f98a2SYan Zheng 46017a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 460262b99540SQu Wenruo if (IS_ERR(trans)) { 46033612b495STsutomu Itoh err = PTR_ERR(trans); 46046217b0faSJosef Bacik goto out_clean; 460562b99540SQu Wenruo } 46063a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 46076217b0faSJosef Bacik out_clean: 4608d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4609d2311e69SQu Wenruo if (ret < 0 && !err) 4610d2311e69SQu Wenruo err = ret; 4611fb2d83eeSJosef Bacik out_unset: 4612fb2d83eeSJosef Bacik unset_reloc_control(rc); 46131a0afa0eSJosef Bacik free_reloc_control(rc); 46143612b495STsutomu Itoh out: 4615aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4616aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4617aca1bba6SLiu Bo 46185d4f98a2SYan Zheng btrfs_free_path(path); 46195d4f98a2SYan Zheng 46205d4f98a2SYan Zheng if (err == 0) { 46215d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 46220b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 4623932fd26dSJosef Bacik if (IS_ERR(fs_root)) { 46245d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4625932fd26dSJosef Bacik } else { 462666b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 462700246528SJosef Bacik btrfs_put_root(fs_root); 4628932fd26dSJosef Bacik } 4629932fd26dSJosef Bacik } 46305d4f98a2SYan Zheng return err; 46315d4f98a2SYan Zheng } 46325d4f98a2SYan Zheng 46335d4f98a2SYan Zheng /* 46345d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 46355d4f98a2SYan Zheng * 46365d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 46375d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 46385d4f98a2SYan Zheng */ 46395d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 46405d4f98a2SYan Zheng { 46410b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 46425d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 46435d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 46445d4f98a2SYan Zheng int ret; 46455d4f98a2SYan Zheng u64 disk_bytenr; 46464577b014SJosef Bacik u64 new_bytenr; 46475d4f98a2SYan Zheng LIST_HEAD(list); 46485d4f98a2SYan Zheng 46495d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 4650bffe633eSOmar Sandoval BUG_ON(ordered->file_offset != file_pos || ordered->num_bytes != len); 46515d4f98a2SYan Zheng 46525d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 46530b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4654a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 465579787eaaSJeff Mahoney if (ret) 465679787eaaSJeff Mahoney goto out; 46575d4f98a2SYan Zheng 46585d4f98a2SYan Zheng while (!list_empty(&list)) { 46595d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 46605d4f98a2SYan Zheng list_del_init(&sums->list); 46615d4f98a2SYan Zheng 46624577b014SJosef Bacik /* 46634577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 46644577b014SJosef Bacik * We need to do this because we will read in entire prealloc 46654577b014SJosef Bacik * extents but we may have written to say the middle of the 46664577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 46674577b014SJosef Bacik * the right disk offset. 46684577b014SJosef Bacik * 46694577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 46704577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 46714577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 46724577b014SJosef Bacik * disk length. 46734577b014SJosef Bacik */ 4674bffe633eSOmar Sandoval new_bytenr = ordered->disk_bytenr + sums->bytenr - disk_bytenr; 46754577b014SJosef Bacik sums->bytenr = new_bytenr; 46765d4f98a2SYan Zheng 4677f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 46785d4f98a2SYan Zheng } 467979787eaaSJeff Mahoney out: 46805d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4681411fc6bcSAndi Kleen return ret; 46825d4f98a2SYan Zheng } 46833fd0a558SYan, Zheng 468483d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 46853fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 46863fd0a558SYan, Zheng struct extent_buffer *cow) 46873fd0a558SYan, Zheng { 46880b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 46893fd0a558SYan, Zheng struct reloc_control *rc; 46903fd0a558SYan, Zheng struct backref_node *node; 46913fd0a558SYan, Zheng int first_cow = 0; 46923fd0a558SYan, Zheng int level; 469383d4cfd4SJosef Bacik int ret = 0; 46943fd0a558SYan, Zheng 46950b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 46963fd0a558SYan, Zheng if (!rc) 469783d4cfd4SJosef Bacik return 0; 46983fd0a558SYan, Zheng 46993fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 47003fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 47013fd0a558SYan, Zheng 47023fd0a558SYan, Zheng level = btrfs_header_level(buf); 47033fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 47043fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 47053fd0a558SYan, Zheng first_cow = 1; 47063fd0a558SYan, Zheng 47073fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 47083fd0a558SYan, Zheng rc->create_reloc_tree) { 47093fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 47103fd0a558SYan, Zheng 47113fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 47123fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 47133fd0a558SYan, Zheng node->new_bytenr != buf->start); 47143fd0a558SYan, Zheng 47153fd0a558SYan, Zheng drop_node_buffer(node); 471667439dadSDavid Sterba atomic_inc(&cow->refs); 47173fd0a558SYan, Zheng node->eb = cow; 47183fd0a558SYan, Zheng node->new_bytenr = cow->start; 47193fd0a558SYan, Zheng 47203fd0a558SYan, Zheng if (!node->pending) { 47213fd0a558SYan, Zheng list_move_tail(&node->list, 47223fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 47233fd0a558SYan, Zheng node->pending = 1; 47243fd0a558SYan, Zheng } 47253fd0a558SYan, Zheng 47263fd0a558SYan, Zheng if (first_cow) 47279569cc20SQu Wenruo mark_block_processed(rc, node); 47283fd0a558SYan, Zheng 47293fd0a558SYan, Zheng if (first_cow && level > 0) 47303fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 47313fd0a558SYan, Zheng } 47323fd0a558SYan, Zheng 473383d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 47343fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 473583d4cfd4SJosef Bacik return ret; 47363fd0a558SYan, Zheng } 47373fd0a558SYan, Zheng 47383fd0a558SYan, Zheng /* 47393fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 474001327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 47413fd0a558SYan, Zheng */ 4742147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 47433fd0a558SYan, Zheng u64 *bytes_to_reserve) 47443fd0a558SYan, Zheng { 474510995c04SQu Wenruo struct btrfs_root *root = pending->root; 474610995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 47473fd0a558SYan, Zheng 47486282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 47493fd0a558SYan, Zheng return; 47503fd0a558SYan, Zheng 47513fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 47523fd0a558SYan, Zheng return; 47533fd0a558SYan, Zheng 47543fd0a558SYan, Zheng root = root->reloc_root; 47553fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 47563fd0a558SYan, Zheng /* 47573fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 47583fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 47593fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 47603fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 47613fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 47623fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 47633fd0a558SYan, Zheng * tree may use more space than it frees. so we need 47643fd0a558SYan, Zheng * reserve extra space. 47653fd0a558SYan, Zheng */ 47663fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 47673fd0a558SYan, Zheng } 47683fd0a558SYan, Zheng 47693fd0a558SYan, Zheng /* 47703fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 47713fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 4772f44deb74SJosef Bacik * 4773f44deb74SJosef Bacik * This is similar to btrfs_init_reloc_root(), we come out of here with two 4774f44deb74SJosef Bacik * references held on the reloc_root, one for root->reloc_root and one for 4775f44deb74SJosef Bacik * rc->reloc_roots. 47763fd0a558SYan, Zheng */ 477749b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 47783fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 47793fd0a558SYan, Zheng { 47803fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 47813fd0a558SYan, Zheng struct btrfs_root *reloc_root; 47823fd0a558SYan, Zheng struct btrfs_root *new_root; 478310995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 47843fd0a558SYan, Zheng int ret; 47853fd0a558SYan, Zheng 47866282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 478749b25e05SJeff Mahoney return 0; 47883fd0a558SYan, Zheng 47893fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 47903fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 47913fd0a558SYan, Zheng 47923fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 47933fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 47943fd0a558SYan, Zheng rc->block_rsv, 47953a584174SLu Fengqi rc->nodes_relocated, true); 479649b25e05SJeff Mahoney if (ret) 479749b25e05SJeff Mahoney return ret; 47983fd0a558SYan, Zheng } 47993fd0a558SYan, Zheng 48003fd0a558SYan, Zheng new_root = pending->snap; 48013fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 48023fd0a558SYan, Zheng new_root->root_key.objectid); 480349b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 480449b25e05SJeff Mahoney return PTR_ERR(reloc_root); 48053fd0a558SYan, Zheng 4806ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4807ffd7b339SJeff Mahoney BUG_ON(ret < 0); 4808f44deb74SJosef Bacik new_root->reloc_root = btrfs_grab_root(reloc_root); 48093fd0a558SYan, Zheng 481049b25e05SJeff Mahoney if (rc->create_reloc_tree) 48113fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 481249b25e05SJeff Mahoney return ret; 48133fd0a558SYan, Zheng } 4814