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; 952a979612SQu Wenruo 962a979612SQu Wenruo /* List of upper level edges, which link this node to its parents */ 975d4f98a2SYan Zheng struct list_head upper; 982a979612SQu Wenruo /* List of lower level edges, which link this node to its children */ 995d4f98a2SYan Zheng struct list_head lower; 1002a979612SQu Wenruo 1015d4f98a2SYan Zheng /* NULL if this node is not tree root */ 1025d4f98a2SYan Zheng struct btrfs_root *root; 1035d4f98a2SYan Zheng /* extent buffer got by COW the block */ 1045d4f98a2SYan Zheng struct extent_buffer *eb; 1055d4f98a2SYan Zheng /* level of tree block */ 1065d4f98a2SYan Zheng unsigned int level:8; 1073fd0a558SYan, Zheng /* is the block in non-reference counted tree */ 1083fd0a558SYan, Zheng unsigned int cowonly:1; 1093fd0a558SYan, Zheng /* 1 if no child node in the cache */ 1105d4f98a2SYan Zheng unsigned int lowest:1; 1115d4f98a2SYan Zheng /* is the extent buffer locked */ 1125d4f98a2SYan Zheng unsigned int locked:1; 1135d4f98a2SYan Zheng /* has the block been processed */ 1145d4f98a2SYan Zheng unsigned int processed:1; 1155d4f98a2SYan Zheng /* have backrefs of this block been checked */ 1165d4f98a2SYan Zheng unsigned int checked:1; 1173fd0a558SYan, Zheng /* 1183fd0a558SYan, Zheng * 1 if corresponding block has been cowed but some upper 1193fd0a558SYan, Zheng * level block pointers may not point to the new location 1203fd0a558SYan, Zheng */ 1213fd0a558SYan, Zheng unsigned int pending:1; 1223fd0a558SYan, Zheng /* 1233fd0a558SYan, Zheng * 1 if the backref node isn't connected to any other 1243fd0a558SYan, Zheng * backref node. 1253fd0a558SYan, Zheng */ 1263fd0a558SYan, Zheng unsigned int detached:1; 1272433bea5SQu Wenruo 1282433bea5SQu Wenruo /* 1292433bea5SQu Wenruo * For generic purpose backref cache, where we only care if it's a reloc 1302433bea5SQu Wenruo * root, doesn't care the source subvolid. 1312433bea5SQu Wenruo */ 1322433bea5SQu Wenruo unsigned int is_reloc_root:1; 1335d4f98a2SYan Zheng }; 1345d4f98a2SYan Zheng 1355d4f98a2SYan Zheng #define LOWER 0 1365d4f98a2SYan Zheng #define UPPER 1 1370647bf56SWang Shilong #define RELOCATION_RESERVED_NODES 256 1382a979612SQu Wenruo /* 1392a979612SQu Wenruo * present an edge connecting upper and lower backref nodes. 1402a979612SQu Wenruo */ 1412a979612SQu Wenruo struct backref_edge { 1422a979612SQu Wenruo /* 1432a979612SQu Wenruo * list[LOWER] is linked to backref_node::upper of lower level node, 1442a979612SQu Wenruo * and list[UPPER] is linked to backref_node::lower of upper level node. 1452a979612SQu Wenruo * 1462a979612SQu Wenruo * Also, build_backref_tree() uses list[UPPER] for pending edges, before 1472a979612SQu Wenruo * linking list[UPPER] to its upper level nodes. 1482a979612SQu Wenruo */ 1492a979612SQu Wenruo struct list_head list[2]; 1502a979612SQu Wenruo 1512a979612SQu Wenruo /* Two related nodes */ 1522a979612SQu Wenruo struct backref_node *node[2]; 1532a979612SQu Wenruo }; 1542a979612SQu Wenruo 1555d4f98a2SYan Zheng 1565d4f98a2SYan Zheng struct backref_cache { 1575d4f98a2SYan Zheng /* red black tree of all backref nodes in the cache */ 1585d4f98a2SYan Zheng struct rb_root rb_root; 1593fd0a558SYan, Zheng /* for passing backref nodes to btrfs_reloc_cow_block */ 1603fd0a558SYan, Zheng struct backref_node *path[BTRFS_MAX_LEVEL]; 1613fd0a558SYan, Zheng /* 1623fd0a558SYan, Zheng * list of blocks that have been cowed but some block 1633fd0a558SYan, Zheng * pointers in upper level blocks may not reflect the 1643fd0a558SYan, Zheng * new location 1653fd0a558SYan, Zheng */ 1665d4f98a2SYan Zheng struct list_head pending[BTRFS_MAX_LEVEL]; 1673fd0a558SYan, Zheng /* list of backref nodes with no child node */ 1683fd0a558SYan, Zheng struct list_head leaves; 1693fd0a558SYan, Zheng /* list of blocks that have been cowed in current transaction */ 1703fd0a558SYan, Zheng struct list_head changed; 1713fd0a558SYan, Zheng /* list of detached backref node. */ 1723fd0a558SYan, Zheng struct list_head detached; 1733fd0a558SYan, Zheng 1743fd0a558SYan, Zheng u64 last_trans; 1753fd0a558SYan, Zheng 1763fd0a558SYan, Zheng int nr_nodes; 1773fd0a558SYan, Zheng int nr_edges; 17884780289SQu Wenruo 17984780289SQu Wenruo /* The list of unchecked backref edges during backref cache build */ 18084780289SQu Wenruo struct list_head pending_edge; 18184780289SQu Wenruo 18284780289SQu Wenruo /* The list of useless backref nodes during backref cache build */ 18384780289SQu Wenruo struct list_head useless_node; 18433a0f1f7SQu Wenruo 18533a0f1f7SQu Wenruo struct btrfs_fs_info *fs_info; 1862433bea5SQu Wenruo 1872433bea5SQu Wenruo /* 1882433bea5SQu Wenruo * Whether this cache is for relocation 1892433bea5SQu Wenruo * 1902433bea5SQu Wenruo * Reloction backref cache require more info for reloc root compared 1912433bea5SQu Wenruo * to generic backref cache. 1922433bea5SQu Wenruo */ 1932433bea5SQu Wenruo unsigned int is_reloc; 1945d4f98a2SYan Zheng }; 1955d4f98a2SYan Zheng 1965d4f98a2SYan Zheng /* 1975d4f98a2SYan Zheng * map address of tree root to tree 1985d4f98a2SYan Zheng */ 1995d4f98a2SYan Zheng struct mapping_node { 2005d4f98a2SYan Zheng struct rb_node rb_node; 2015d4f98a2SYan Zheng u64 bytenr; 2025d4f98a2SYan Zheng void *data; 2035d4f98a2SYan Zheng }; 2045d4f98a2SYan Zheng 2055d4f98a2SYan Zheng struct mapping_tree { 2065d4f98a2SYan Zheng struct rb_root rb_root; 2075d4f98a2SYan Zheng spinlock_t lock; 2085d4f98a2SYan Zheng }; 2095d4f98a2SYan Zheng 2105d4f98a2SYan Zheng /* 2115d4f98a2SYan Zheng * present a tree block to process 2125d4f98a2SYan Zheng */ 2135d4f98a2SYan Zheng struct tree_block { 2145d4f98a2SYan Zheng struct rb_node rb_node; 2155d4f98a2SYan Zheng u64 bytenr; 2165d4f98a2SYan Zheng struct btrfs_key key; 2175d4f98a2SYan Zheng unsigned int level:8; 2185d4f98a2SYan Zheng unsigned int key_ready:1; 2195d4f98a2SYan Zheng }; 2205d4f98a2SYan Zheng 2210257bb82SYan, Zheng #define MAX_EXTENTS 128 2220257bb82SYan, Zheng 2230257bb82SYan, Zheng struct file_extent_cluster { 2240257bb82SYan, Zheng u64 start; 2250257bb82SYan, Zheng u64 end; 2260257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 2270257bb82SYan, Zheng unsigned int nr; 2280257bb82SYan, Zheng }; 2290257bb82SYan, Zheng 2305d4f98a2SYan Zheng struct reloc_control { 2315d4f98a2SYan Zheng /* block group to relocate */ 23232da5386SDavid Sterba struct btrfs_block_group *block_group; 2335d4f98a2SYan Zheng /* extent tree */ 2345d4f98a2SYan Zheng struct btrfs_root *extent_root; 2355d4f98a2SYan Zheng /* inode for moving data */ 2365d4f98a2SYan Zheng struct inode *data_inode; 2373fd0a558SYan, Zheng 2383fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 2393fd0a558SYan, Zheng 2403fd0a558SYan, Zheng struct backref_cache backref_cache; 2413fd0a558SYan, Zheng 2423fd0a558SYan, Zheng struct file_extent_cluster cluster; 2435d4f98a2SYan Zheng /* tree blocks have been processed */ 2445d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 2455d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 2465d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 2475d4f98a2SYan Zheng /* list of reloc trees */ 2485d4f98a2SYan Zheng struct list_head reloc_roots; 249d2311e69SQu Wenruo /* list of subvolume trees that get relocated */ 250d2311e69SQu Wenruo struct list_head dirty_subvol_roots; 2513fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 2523fd0a558SYan, Zheng u64 merging_rsv_size; 2533fd0a558SYan, Zheng /* size of relocated tree nodes */ 2543fd0a558SYan, Zheng u64 nodes_relocated; 2550647bf56SWang Shilong /* reserved size for block group relocation*/ 2560647bf56SWang Shilong u64 reserved_bytes; 2573fd0a558SYan, Zheng 2585d4f98a2SYan Zheng u64 search_start; 2595d4f98a2SYan Zheng u64 extents_found; 2603fd0a558SYan, Zheng 2613fd0a558SYan, Zheng unsigned int stage:8; 2623fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 2633fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 2645d4f98a2SYan Zheng unsigned int found_file_extent:1; 2655d4f98a2SYan Zheng }; 2665d4f98a2SYan Zheng 2675d4f98a2SYan Zheng /* stages of data relocation */ 2685d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 2695d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 2705d4f98a2SYan Zheng 2713fd0a558SYan, Zheng static void remove_backref_node(struct backref_cache *cache, 2723fd0a558SYan, Zheng struct backref_node *node); 2739569cc20SQu Wenruo 2749569cc20SQu Wenruo static void mark_block_processed(struct reloc_control *rc, 2759569cc20SQu Wenruo struct backref_node *node) 2769569cc20SQu Wenruo { 2779569cc20SQu Wenruo u32 blocksize; 2789569cc20SQu Wenruo 2799569cc20SQu Wenruo if (node->level == 0 || 2809569cc20SQu Wenruo in_range(node->bytenr, rc->block_group->start, 2819569cc20SQu Wenruo rc->block_group->length)) { 2829569cc20SQu Wenruo blocksize = rc->extent_root->fs_info->nodesize; 2839569cc20SQu Wenruo set_extent_bits(&rc->processed_blocks, node->bytenr, 2849569cc20SQu Wenruo node->bytenr + blocksize - 1, EXTENT_DIRTY); 2859569cc20SQu Wenruo } 2869569cc20SQu Wenruo node->processed = 1; 2879569cc20SQu Wenruo } 2889569cc20SQu Wenruo 2895d4f98a2SYan Zheng 2905d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 2915d4f98a2SYan Zheng { 2926bef4d31SEric Paris tree->rb_root = RB_ROOT; 2935d4f98a2SYan Zheng spin_lock_init(&tree->lock); 2945d4f98a2SYan Zheng } 2955d4f98a2SYan Zheng 29633a0f1f7SQu Wenruo static void backref_cache_init(struct btrfs_fs_info *fs_info, 2972433bea5SQu Wenruo struct backref_cache *cache, int is_reloc) 2985d4f98a2SYan Zheng { 2995d4f98a2SYan Zheng int i; 3006bef4d31SEric Paris cache->rb_root = RB_ROOT; 3015d4f98a2SYan Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 3025d4f98a2SYan Zheng INIT_LIST_HEAD(&cache->pending[i]); 3033fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->changed); 3043fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->detached); 3053fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->leaves); 30684780289SQu Wenruo INIT_LIST_HEAD(&cache->pending_edge); 30784780289SQu Wenruo INIT_LIST_HEAD(&cache->useless_node); 30833a0f1f7SQu Wenruo cache->fs_info = fs_info; 3092433bea5SQu Wenruo cache->is_reloc = is_reloc; 3105d4f98a2SYan Zheng } 3115d4f98a2SYan Zheng 3123fd0a558SYan, Zheng static void backref_cache_cleanup(struct backref_cache *cache) 3135d4f98a2SYan Zheng { 3143fd0a558SYan, Zheng struct backref_node *node; 3153fd0a558SYan, Zheng int i; 3163fd0a558SYan, Zheng 3173fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 3183fd0a558SYan, Zheng node = list_entry(cache->detached.next, 3193fd0a558SYan, Zheng struct backref_node, list); 3203fd0a558SYan, Zheng remove_backref_node(cache, node); 3213fd0a558SYan, Zheng } 3223fd0a558SYan, Zheng 3233fd0a558SYan, Zheng while (!list_empty(&cache->leaves)) { 3243fd0a558SYan, Zheng node = list_entry(cache->leaves.next, 3253fd0a558SYan, Zheng struct backref_node, lower); 3263fd0a558SYan, Zheng remove_backref_node(cache, node); 3273fd0a558SYan, Zheng } 3283fd0a558SYan, Zheng 3293fd0a558SYan, Zheng cache->last_trans = 0; 3303fd0a558SYan, Zheng 3313fd0a558SYan, Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 332f4907095SLiu Bo ASSERT(list_empty(&cache->pending[i])); 33384780289SQu Wenruo ASSERT(list_empty(&cache->pending_edge)); 33484780289SQu Wenruo ASSERT(list_empty(&cache->useless_node)); 335f4907095SLiu Bo ASSERT(list_empty(&cache->changed)); 336f4907095SLiu Bo ASSERT(list_empty(&cache->detached)); 337f4907095SLiu Bo ASSERT(RB_EMPTY_ROOT(&cache->rb_root)); 338f4907095SLiu Bo ASSERT(!cache->nr_nodes); 339f4907095SLiu Bo ASSERT(!cache->nr_edges); 3403fd0a558SYan, Zheng } 3413fd0a558SYan, Zheng 3420304f2d8SQu Wenruo static struct backref_node *alloc_backref_node(struct backref_cache *cache, 3430304f2d8SQu Wenruo u64 bytenr, int level) 3443fd0a558SYan, Zheng { 3453fd0a558SYan, Zheng struct backref_node *node; 3463fd0a558SYan, Zheng 3470304f2d8SQu Wenruo ASSERT(level >= 0 && level < BTRFS_MAX_LEVEL); 3483fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 3490304f2d8SQu Wenruo if (!node) 3500304f2d8SQu Wenruo return node; 3510304f2d8SQu Wenruo 3523fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 3535d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 3545d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 3555d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 3563fd0a558SYan, Zheng cache->nr_nodes++; 3570304f2d8SQu Wenruo node->level = level; 3580304f2d8SQu Wenruo node->bytenr = bytenr; 3590304f2d8SQu Wenruo 3603fd0a558SYan, Zheng return node; 3613fd0a558SYan, Zheng } 3623fd0a558SYan, Zheng 3633fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 3643fd0a558SYan, Zheng struct backref_node *node) 3653fd0a558SYan, Zheng { 3663fd0a558SYan, Zheng if (node) { 3673fd0a558SYan, Zheng cache->nr_nodes--; 36800246528SJosef Bacik btrfs_put_root(node->root); 3693fd0a558SYan, Zheng kfree(node); 3703fd0a558SYan, Zheng } 3713fd0a558SYan, Zheng } 3723fd0a558SYan, Zheng 3733fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 3743fd0a558SYan, Zheng { 3753fd0a558SYan, Zheng struct backref_edge *edge; 3763fd0a558SYan, Zheng 3773fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 3783fd0a558SYan, Zheng if (edge) 3793fd0a558SYan, Zheng cache->nr_edges++; 3803fd0a558SYan, Zheng return edge; 3813fd0a558SYan, Zheng } 3823fd0a558SYan, Zheng 3832a979612SQu Wenruo #define LINK_LOWER (1 << 0) 3842a979612SQu Wenruo #define LINK_UPPER (1 << 1) 3852a979612SQu Wenruo static void link_backref_edge(struct backref_edge *edge, 3862a979612SQu Wenruo struct backref_node *lower, 3872a979612SQu Wenruo struct backref_node *upper, 3882a979612SQu Wenruo int link_which) 3892a979612SQu Wenruo { 3902a979612SQu Wenruo ASSERT(upper && lower && upper->level == lower->level + 1); 3912a979612SQu Wenruo edge->node[LOWER] = lower; 3922a979612SQu Wenruo edge->node[UPPER] = upper; 3932a979612SQu Wenruo if (link_which & LINK_LOWER) 3942a979612SQu Wenruo list_add_tail(&edge->list[LOWER], &lower->upper); 3952a979612SQu Wenruo if (link_which & LINK_UPPER) 3962a979612SQu Wenruo list_add_tail(&edge->list[UPPER], &upper->lower); 3972a979612SQu Wenruo } 3982a979612SQu Wenruo 3993fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 4003fd0a558SYan, Zheng struct backref_edge *edge) 4013fd0a558SYan, Zheng { 4023fd0a558SYan, Zheng if (edge) { 4033fd0a558SYan, Zheng cache->nr_edges--; 4043fd0a558SYan, Zheng kfree(edge); 4053fd0a558SYan, Zheng } 4065d4f98a2SYan Zheng } 4075d4f98a2SYan Zheng 4085d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 4095d4f98a2SYan Zheng struct rb_node *node) 4105d4f98a2SYan Zheng { 4115d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 4125d4f98a2SYan Zheng struct rb_node *parent = NULL; 4135d4f98a2SYan Zheng struct tree_entry *entry; 4145d4f98a2SYan Zheng 4155d4f98a2SYan Zheng while (*p) { 4165d4f98a2SYan Zheng parent = *p; 4175d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 4185d4f98a2SYan Zheng 4195d4f98a2SYan Zheng if (bytenr < entry->bytenr) 4205d4f98a2SYan Zheng p = &(*p)->rb_left; 4215d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 4225d4f98a2SYan Zheng p = &(*p)->rb_right; 4235d4f98a2SYan Zheng else 4245d4f98a2SYan Zheng return parent; 4255d4f98a2SYan Zheng } 4265d4f98a2SYan Zheng 4275d4f98a2SYan Zheng rb_link_node(node, parent, p); 4285d4f98a2SYan Zheng rb_insert_color(node, root); 4295d4f98a2SYan Zheng return NULL; 4305d4f98a2SYan Zheng } 4315d4f98a2SYan Zheng 4325d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 4335d4f98a2SYan Zheng { 4345d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 4355d4f98a2SYan Zheng struct tree_entry *entry; 4365d4f98a2SYan Zheng 4375d4f98a2SYan Zheng while (n) { 4385d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 4395d4f98a2SYan Zheng 4405d4f98a2SYan Zheng if (bytenr < entry->bytenr) 4415d4f98a2SYan Zheng n = n->rb_left; 4425d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 4435d4f98a2SYan Zheng n = n->rb_right; 4445d4f98a2SYan Zheng else 4455d4f98a2SYan Zheng return n; 4465d4f98a2SYan Zheng } 4475d4f98a2SYan Zheng return NULL; 4485d4f98a2SYan Zheng } 4495d4f98a2SYan Zheng 45048a3b636SEric Sandeen static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) 45143c04fb1SJeff Mahoney { 45243c04fb1SJeff Mahoney 45343c04fb1SJeff Mahoney struct btrfs_fs_info *fs_info = NULL; 45443c04fb1SJeff Mahoney struct backref_node *bnode = rb_entry(rb_node, struct backref_node, 45543c04fb1SJeff Mahoney rb_node); 45643c04fb1SJeff Mahoney if (bnode->root) 45743c04fb1SJeff Mahoney fs_info = bnode->root->fs_info; 4585d163e0eSJeff Mahoney btrfs_panic(fs_info, errno, 4595d163e0eSJeff Mahoney "Inconsistency in backref cache found at offset %llu", 4605d163e0eSJeff Mahoney bytenr); 46143c04fb1SJeff Mahoney } 46243c04fb1SJeff Mahoney 4635d4f98a2SYan Zheng /* 4645d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 4655d4f98a2SYan Zheng */ 4665d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 4675d4f98a2SYan Zheng struct backref_edge *edges[], 4685d4f98a2SYan Zheng int *index) 4695d4f98a2SYan Zheng { 4705d4f98a2SYan Zheng struct backref_edge *edge; 4715d4f98a2SYan Zheng int idx = *index; 4725d4f98a2SYan Zheng 4735d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4745d4f98a2SYan Zheng edge = list_entry(node->upper.next, 4755d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 4765d4f98a2SYan Zheng edges[idx++] = edge; 4775d4f98a2SYan Zheng node = edge->node[UPPER]; 4785d4f98a2SYan Zheng } 4793fd0a558SYan, Zheng BUG_ON(node->detached); 4805d4f98a2SYan Zheng *index = idx; 4815d4f98a2SYan Zheng return node; 4825d4f98a2SYan Zheng } 4835d4f98a2SYan Zheng 4845d4f98a2SYan Zheng /* 4855d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 4865d4f98a2SYan Zheng */ 4875d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 4885d4f98a2SYan Zheng int *index) 4895d4f98a2SYan Zheng { 4905d4f98a2SYan Zheng struct backref_edge *edge; 4915d4f98a2SYan Zheng struct backref_node *lower; 4925d4f98a2SYan Zheng int idx = *index; 4935d4f98a2SYan Zheng 4945d4f98a2SYan Zheng while (idx > 0) { 4955d4f98a2SYan Zheng edge = edges[idx - 1]; 4965d4f98a2SYan Zheng lower = edge->node[LOWER]; 4975d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 4985d4f98a2SYan Zheng idx--; 4995d4f98a2SYan Zheng continue; 5005d4f98a2SYan Zheng } 5015d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 5025d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 5035d4f98a2SYan Zheng edges[idx - 1] = edge; 5045d4f98a2SYan Zheng *index = idx; 5055d4f98a2SYan Zheng return edge->node[UPPER]; 5065d4f98a2SYan Zheng } 5075d4f98a2SYan Zheng *index = 0; 5085d4f98a2SYan Zheng return NULL; 5095d4f98a2SYan Zheng } 5105d4f98a2SYan Zheng 5113fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 5125d4f98a2SYan Zheng { 5135d4f98a2SYan Zheng if (node->locked) { 5145d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 5155d4f98a2SYan Zheng node->locked = 0; 5165d4f98a2SYan Zheng } 5173fd0a558SYan, Zheng } 5183fd0a558SYan, Zheng 5193fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 5203fd0a558SYan, Zheng { 5213fd0a558SYan, Zheng if (node->eb) { 5223fd0a558SYan, Zheng unlock_node_buffer(node); 5235d4f98a2SYan Zheng free_extent_buffer(node->eb); 5245d4f98a2SYan Zheng node->eb = NULL; 5255d4f98a2SYan Zheng } 5265d4f98a2SYan Zheng } 5275d4f98a2SYan Zheng 5285d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 5295d4f98a2SYan Zheng struct backref_node *node) 5305d4f98a2SYan Zheng { 5315d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 5325d4f98a2SYan Zheng 5335d4f98a2SYan Zheng drop_node_buffer(node); 5343fd0a558SYan, Zheng list_del(&node->list); 5355d4f98a2SYan Zheng list_del(&node->lower); 5363fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 5375d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 5383fd0a558SYan, Zheng free_backref_node(tree, node); 5395d4f98a2SYan Zheng } 5405d4f98a2SYan Zheng 5415d4f98a2SYan Zheng /* 5425d4f98a2SYan Zheng * remove a backref node from the backref cache 5435d4f98a2SYan Zheng */ 5445d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 5455d4f98a2SYan Zheng struct backref_node *node) 5465d4f98a2SYan Zheng { 5475d4f98a2SYan Zheng struct backref_node *upper; 5485d4f98a2SYan Zheng struct backref_edge *edge; 5495d4f98a2SYan Zheng 5505d4f98a2SYan Zheng if (!node) 5515d4f98a2SYan Zheng return; 5525d4f98a2SYan Zheng 5533fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 5545d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 5555d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 5565d4f98a2SYan Zheng list[LOWER]); 5575d4f98a2SYan Zheng upper = edge->node[UPPER]; 5585d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 5595d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 5603fd0a558SYan, Zheng free_backref_edge(cache, edge); 5613fd0a558SYan, Zheng 5623fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 5633fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 5643fd0a558SYan, Zheng drop_backref_node(cache, node); 5653fd0a558SYan, Zheng node = upper; 5663fd0a558SYan, Zheng node->lowest = 1; 5673fd0a558SYan, Zheng continue; 5683fd0a558SYan, Zheng } 5695d4f98a2SYan Zheng /* 5703fd0a558SYan, Zheng * add the node to leaf node list if no other 5715d4f98a2SYan Zheng * child block cached. 5725d4f98a2SYan Zheng */ 5735d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 5743fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 5755d4f98a2SYan Zheng upper->lowest = 1; 5765d4f98a2SYan Zheng } 5775d4f98a2SYan Zheng } 5783fd0a558SYan, Zheng 5795d4f98a2SYan Zheng drop_backref_node(cache, node); 5805d4f98a2SYan Zheng } 5815d4f98a2SYan Zheng 5823fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 5833fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 5843fd0a558SYan, Zheng { 5853fd0a558SYan, Zheng struct rb_node *rb_node; 5863fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 5873fd0a558SYan, Zheng node->bytenr = bytenr; 5883fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 58943c04fb1SJeff Mahoney if (rb_node) 59043c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, bytenr); 5913fd0a558SYan, Zheng } 5923fd0a558SYan, Zheng 5933fd0a558SYan, Zheng /* 5943fd0a558SYan, Zheng * update backref cache after a transaction commit 5953fd0a558SYan, Zheng */ 5963fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 5973fd0a558SYan, Zheng struct backref_cache *cache) 5983fd0a558SYan, Zheng { 5993fd0a558SYan, Zheng struct backref_node *node; 6003fd0a558SYan, Zheng int level = 0; 6013fd0a558SYan, Zheng 6023fd0a558SYan, Zheng if (cache->last_trans == 0) { 6033fd0a558SYan, Zheng cache->last_trans = trans->transid; 6043fd0a558SYan, Zheng return 0; 6053fd0a558SYan, Zheng } 6063fd0a558SYan, Zheng 6073fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 6083fd0a558SYan, Zheng return 0; 6093fd0a558SYan, Zheng 6103fd0a558SYan, Zheng /* 6113fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 6123fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 6133fd0a558SYan, Zheng * so the detached nodes are no longer useful. 6143fd0a558SYan, Zheng */ 6153fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 6163fd0a558SYan, Zheng node = list_entry(cache->detached.next, 6173fd0a558SYan, Zheng struct backref_node, list); 6183fd0a558SYan, Zheng remove_backref_node(cache, node); 6193fd0a558SYan, Zheng } 6203fd0a558SYan, Zheng 6213fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 6223fd0a558SYan, Zheng node = list_entry(cache->changed.next, 6233fd0a558SYan, Zheng struct backref_node, list); 6243fd0a558SYan, Zheng list_del_init(&node->list); 6253fd0a558SYan, Zheng BUG_ON(node->pending); 6263fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 6273fd0a558SYan, Zheng } 6283fd0a558SYan, Zheng 6293fd0a558SYan, Zheng /* 6303fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 6313fd0a558SYan, Zheng * errors during processing the pending nodes. 6323fd0a558SYan, Zheng */ 6333fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 6343fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 6353fd0a558SYan, Zheng BUG_ON(!node->pending); 6363fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 6373fd0a558SYan, Zheng continue; 6383fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 6393fd0a558SYan, Zheng } 6403fd0a558SYan, Zheng } 6413fd0a558SYan, Zheng 6423fd0a558SYan, Zheng cache->last_trans = 0; 6433fd0a558SYan, Zheng return 1; 6443fd0a558SYan, Zheng } 6453fd0a558SYan, Zheng 6466282675eSQu Wenruo static bool reloc_root_is_dead(struct btrfs_root *root) 6476282675eSQu Wenruo { 6486282675eSQu Wenruo /* 6496282675eSQu Wenruo * Pair with set_bit/clear_bit in clean_dirty_subvols and 6506282675eSQu Wenruo * btrfs_update_reloc_root. We need to see the updated bit before 6516282675eSQu Wenruo * trying to access reloc_root 6526282675eSQu Wenruo */ 6536282675eSQu Wenruo smp_rmb(); 6546282675eSQu Wenruo if (test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state)) 6556282675eSQu Wenruo return true; 6566282675eSQu Wenruo return false; 6576282675eSQu Wenruo } 6586282675eSQu Wenruo 6596282675eSQu Wenruo /* 6606282675eSQu Wenruo * Check if this subvolume tree has valid reloc tree. 6616282675eSQu Wenruo * 6626282675eSQu Wenruo * Reloc tree after swap is considered dead, thus not considered as valid. 6636282675eSQu Wenruo * This is enough for most callers, as they don't distinguish dead reloc root 6646282675eSQu Wenruo * from no reloc root. But should_ignore_root() below is a special case. 6656282675eSQu Wenruo */ 6666282675eSQu Wenruo static bool have_reloc_root(struct btrfs_root *root) 6676282675eSQu Wenruo { 6686282675eSQu Wenruo if (reloc_root_is_dead(root)) 6696282675eSQu Wenruo return false; 6706282675eSQu Wenruo if (!root->reloc_root) 6716282675eSQu Wenruo return false; 6726282675eSQu Wenruo return true; 6736282675eSQu Wenruo } 674f2a97a9dSDavid Sterba 6753fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 6763fd0a558SYan, Zheng { 6773fd0a558SYan, Zheng struct btrfs_root *reloc_root; 6783fd0a558SYan, Zheng 67927cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 6803fd0a558SYan, Zheng return 0; 6813fd0a558SYan, Zheng 6826282675eSQu Wenruo /* This root has been merged with its reloc tree, we can ignore it */ 6836282675eSQu Wenruo if (reloc_root_is_dead(root)) 6846282675eSQu Wenruo return 1; 6856282675eSQu Wenruo 6863fd0a558SYan, Zheng reloc_root = root->reloc_root; 6873fd0a558SYan, Zheng if (!reloc_root) 6883fd0a558SYan, Zheng return 0; 6893fd0a558SYan, Zheng 6904d4225fcSJosef Bacik if (btrfs_header_generation(reloc_root->commit_root) == 6914d4225fcSJosef Bacik root->fs_info->running_transaction->transid) 6923fd0a558SYan, Zheng return 0; 6933fd0a558SYan, Zheng /* 6943fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 6953fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 6963fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 6973fd0a558SYan, Zheng * relocation. 6983fd0a558SYan, Zheng */ 6993fd0a558SYan, Zheng return 1; 7003fd0a558SYan, Zheng } 7015d4f98a2SYan Zheng /* 7025d4f98a2SYan Zheng * find reloc tree by address of tree root 7035d4f98a2SYan Zheng */ 7042433bea5SQu Wenruo struct btrfs_root *find_reloc_root(struct btrfs_fs_info *fs_info, u64 bytenr) 7055d4f98a2SYan Zheng { 7062433bea5SQu Wenruo struct reloc_control *rc = fs_info->reloc_ctl; 7075d4f98a2SYan Zheng struct rb_node *rb_node; 7085d4f98a2SYan Zheng struct mapping_node *node; 7095d4f98a2SYan Zheng struct btrfs_root *root = NULL; 7105d4f98a2SYan Zheng 7112433bea5SQu Wenruo ASSERT(rc); 7125d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 7135d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 7145d4f98a2SYan Zheng if (rb_node) { 7155d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 7165d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 7175d4f98a2SYan Zheng } 7185d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 71900246528SJosef Bacik return btrfs_grab_root(root); 7205d4f98a2SYan Zheng } 7215d4f98a2SYan Zheng 7225d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 7235d4f98a2SYan Zheng u64 root_objectid) 7245d4f98a2SYan Zheng { 7255d4f98a2SYan Zheng struct btrfs_key key; 7265d4f98a2SYan Zheng 7275d4f98a2SYan Zheng key.objectid = root_objectid; 7285d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 7295d4f98a2SYan Zheng key.offset = (u64)-1; 7305d4f98a2SYan Zheng 731bc44d7c4SJosef Bacik return btrfs_get_fs_root(fs_info, &key, false); 7325d4f98a2SYan Zheng } 7335d4f98a2SYan Zheng 7345d4f98a2SYan Zheng /* 7354007ea87SQu Wenruo * Handle direct tree backref 7364007ea87SQu Wenruo * 7374007ea87SQu Wenruo * Direct tree backref means, the backref item shows its parent bytenr 7384007ea87SQu Wenruo * directly. This is for SHARED_BLOCK_REF backref (keyed or inlined). 7394007ea87SQu Wenruo * 7404007ea87SQu Wenruo * @ref_key: The converted backref key. 7414007ea87SQu Wenruo * For keyed backref, it's the item key. 7424007ea87SQu Wenruo * For inlined backref, objectid is the bytenr, 7434007ea87SQu Wenruo * type is btrfs_inline_ref_type, offset is 7444007ea87SQu Wenruo * btrfs_inline_ref_offset. 7454007ea87SQu Wenruo */ 7464007ea87SQu Wenruo static int handle_direct_tree_backref(struct backref_cache *cache, 7474007ea87SQu Wenruo struct btrfs_key *ref_key, 7484007ea87SQu Wenruo struct backref_node *cur) 7494007ea87SQu Wenruo { 7504007ea87SQu Wenruo struct backref_edge *edge; 7514007ea87SQu Wenruo struct backref_node *upper; 7524007ea87SQu Wenruo struct rb_node *rb_node; 7534007ea87SQu Wenruo 7544007ea87SQu Wenruo ASSERT(ref_key->type == BTRFS_SHARED_BLOCK_REF_KEY); 7554007ea87SQu Wenruo 7564007ea87SQu Wenruo /* Only reloc root uses backref pointing to itself */ 7574007ea87SQu Wenruo if (ref_key->objectid == ref_key->offset) { 7584007ea87SQu Wenruo struct btrfs_root *root; 7594007ea87SQu Wenruo 7604007ea87SQu Wenruo cur->is_reloc_root = 1; 7614007ea87SQu Wenruo /* Only reloc backref cache cares about a specific root */ 7624007ea87SQu Wenruo if (cache->is_reloc) { 7634007ea87SQu Wenruo root = find_reloc_root(cache->fs_info, cur->bytenr); 7644007ea87SQu Wenruo if (WARN_ON(!root)) 7654007ea87SQu Wenruo return -ENOENT; 7664007ea87SQu Wenruo cur->root = root; 7674007ea87SQu Wenruo } else { 7684007ea87SQu Wenruo /* 7694007ea87SQu Wenruo * For generic purpose backref cache, reloc root node 7704007ea87SQu Wenruo * is useless. 7714007ea87SQu Wenruo */ 7724007ea87SQu Wenruo list_add(&cur->list, &cache->useless_node); 7734007ea87SQu Wenruo } 7744007ea87SQu Wenruo return 0; 7754007ea87SQu Wenruo } 7764007ea87SQu Wenruo 7774007ea87SQu Wenruo edge = alloc_backref_edge(cache); 7784007ea87SQu Wenruo if (!edge) 7794007ea87SQu Wenruo return -ENOMEM; 7804007ea87SQu Wenruo 7814007ea87SQu Wenruo rb_node = tree_search(&cache->rb_root, ref_key->offset); 7824007ea87SQu Wenruo if (!rb_node) { 7834007ea87SQu Wenruo /* Parent node not yet cached */ 7840304f2d8SQu Wenruo upper = alloc_backref_node(cache, ref_key->offset, 7850304f2d8SQu Wenruo cur->level + 1); 7864007ea87SQu Wenruo if (!upper) { 7874007ea87SQu Wenruo free_backref_edge(cache, edge); 7884007ea87SQu Wenruo return -ENOMEM; 7894007ea87SQu Wenruo } 7904007ea87SQu Wenruo 7914007ea87SQu Wenruo /* 7924007ea87SQu Wenruo * Backrefs for the upper level block isn't cached, add the 7934007ea87SQu Wenruo * block to pending list 7944007ea87SQu Wenruo */ 7954007ea87SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 7964007ea87SQu Wenruo } else { 7974007ea87SQu Wenruo /* Parent node already cached */ 7984007ea87SQu Wenruo upper = rb_entry(rb_node, struct backref_node, rb_node); 7994007ea87SQu Wenruo ASSERT(upper->checked); 8004007ea87SQu Wenruo INIT_LIST_HEAD(&edge->list[UPPER]); 8014007ea87SQu Wenruo } 8022a979612SQu Wenruo link_backref_edge(edge, cur, upper, LINK_LOWER); 8034007ea87SQu Wenruo return 0; 8044007ea87SQu Wenruo } 8054007ea87SQu Wenruo 8064007ea87SQu Wenruo /* 8074d81ea8bSQu Wenruo * Handle indirect tree backref 8084d81ea8bSQu Wenruo * 8094d81ea8bSQu Wenruo * Indirect tree backref means, we only know which tree the node belongs to. 8104d81ea8bSQu Wenruo * We still need to do a tree search to find out the parents. This is for 8114d81ea8bSQu Wenruo * TREE_BLOCK_REF backref (keyed or inlined). 8124d81ea8bSQu Wenruo * 8134d81ea8bSQu Wenruo * @ref_key: The same as @ref_key in handle_direct_tree_backref() 8144d81ea8bSQu Wenruo * @tree_key: The first key of this tree block. 8154d81ea8bSQu Wenruo * @path: A clean (released) path, to avoid allocating path everytime 8164d81ea8bSQu Wenruo * the function get called. 8174d81ea8bSQu Wenruo */ 8184d81ea8bSQu Wenruo static int handle_indirect_tree_backref(struct backref_cache *cache, 8194d81ea8bSQu Wenruo struct btrfs_path *path, 8204d81ea8bSQu Wenruo struct btrfs_key *ref_key, 8214d81ea8bSQu Wenruo struct btrfs_key *tree_key, 8224d81ea8bSQu Wenruo struct backref_node *cur) 8234d81ea8bSQu Wenruo { 8244d81ea8bSQu Wenruo struct btrfs_fs_info *fs_info = cache->fs_info; 8254d81ea8bSQu Wenruo struct backref_node *upper; 8264d81ea8bSQu Wenruo struct backref_node *lower; 8274d81ea8bSQu Wenruo struct backref_edge *edge; 8284d81ea8bSQu Wenruo struct extent_buffer *eb; 8294d81ea8bSQu Wenruo struct btrfs_root *root; 8304d81ea8bSQu Wenruo struct rb_node *rb_node; 8314d81ea8bSQu Wenruo int level; 8324d81ea8bSQu Wenruo bool need_check = true; 8334d81ea8bSQu Wenruo int ret; 8344d81ea8bSQu Wenruo 8354d81ea8bSQu Wenruo root = read_fs_root(fs_info, ref_key->offset); 8364d81ea8bSQu Wenruo if (IS_ERR(root)) 8374d81ea8bSQu Wenruo return PTR_ERR(root); 8384d81ea8bSQu Wenruo if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 8394d81ea8bSQu Wenruo cur->cowonly = 1; 8404d81ea8bSQu Wenruo 8414d81ea8bSQu Wenruo if (btrfs_root_level(&root->root_item) == cur->level) { 8424d81ea8bSQu Wenruo /* Tree root */ 8434d81ea8bSQu Wenruo ASSERT(btrfs_root_bytenr(&root->root_item) == cur->bytenr); 8444d81ea8bSQu Wenruo if (should_ignore_root(root)) { 8454d81ea8bSQu Wenruo btrfs_put_root(root); 8464d81ea8bSQu Wenruo list_add(&cur->list, &cache->useless_node); 8474d81ea8bSQu Wenruo } else { 8484d81ea8bSQu Wenruo cur->root = root; 8494d81ea8bSQu Wenruo } 8504d81ea8bSQu Wenruo return 0; 8514d81ea8bSQu Wenruo } 8524d81ea8bSQu Wenruo 8534d81ea8bSQu Wenruo level = cur->level + 1; 8544d81ea8bSQu Wenruo 8554d81ea8bSQu Wenruo /* Search the tree to find parent blocks referring to the block */ 8564d81ea8bSQu Wenruo path->search_commit_root = 1; 8574d81ea8bSQu Wenruo path->skip_locking = 1; 8584d81ea8bSQu Wenruo path->lowest_level = level; 8594d81ea8bSQu Wenruo ret = btrfs_search_slot(NULL, root, tree_key, path, 0, 0); 8604d81ea8bSQu Wenruo path->lowest_level = 0; 8614d81ea8bSQu Wenruo if (ret < 0) { 8624d81ea8bSQu Wenruo btrfs_put_root(root); 8634d81ea8bSQu Wenruo return ret; 8644d81ea8bSQu Wenruo } 8654d81ea8bSQu Wenruo if (ret > 0 && path->slots[level] > 0) 8664d81ea8bSQu Wenruo path->slots[level]--; 8674d81ea8bSQu Wenruo 8684d81ea8bSQu Wenruo eb = path->nodes[level]; 8694d81ea8bSQu Wenruo if (btrfs_node_blockptr(eb, path->slots[level]) != cur->bytenr) { 8704d81ea8bSQu Wenruo btrfs_err(fs_info, 8714d81ea8bSQu Wenruo "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)", 8724d81ea8bSQu Wenruo cur->bytenr, level - 1, root->root_key.objectid, 8734d81ea8bSQu Wenruo tree_key->objectid, tree_key->type, tree_key->offset); 8744d81ea8bSQu Wenruo btrfs_put_root(root); 8754d81ea8bSQu Wenruo ret = -ENOENT; 8764d81ea8bSQu Wenruo goto out; 8774d81ea8bSQu Wenruo } 8784d81ea8bSQu Wenruo lower = cur; 8794d81ea8bSQu Wenruo 8804d81ea8bSQu Wenruo /* Add all nodes and edges in the path */ 8814d81ea8bSQu Wenruo for (; level < BTRFS_MAX_LEVEL; level++) { 8824d81ea8bSQu Wenruo if (!path->nodes[level]) { 8834d81ea8bSQu Wenruo ASSERT(btrfs_root_bytenr(&root->root_item) == 8844d81ea8bSQu Wenruo lower->bytenr); 8854d81ea8bSQu Wenruo if (should_ignore_root(root)) { 8864d81ea8bSQu Wenruo btrfs_put_root(root); 8874d81ea8bSQu Wenruo list_add(&lower->list, &cache->useless_node); 8884d81ea8bSQu Wenruo } else { 8894d81ea8bSQu Wenruo lower->root = root; 8904d81ea8bSQu Wenruo } 8914d81ea8bSQu Wenruo break; 8924d81ea8bSQu Wenruo } 8934d81ea8bSQu Wenruo 8944d81ea8bSQu Wenruo edge = alloc_backref_edge(cache); 8954d81ea8bSQu Wenruo if (!edge) { 8964d81ea8bSQu Wenruo btrfs_put_root(root); 8974d81ea8bSQu Wenruo ret = -ENOMEM; 8984d81ea8bSQu Wenruo goto out; 8994d81ea8bSQu Wenruo } 9004d81ea8bSQu Wenruo 9014d81ea8bSQu Wenruo eb = path->nodes[level]; 9024d81ea8bSQu Wenruo rb_node = tree_search(&cache->rb_root, eb->start); 9034d81ea8bSQu Wenruo if (!rb_node) { 9040304f2d8SQu Wenruo upper = alloc_backref_node(cache, eb->start, 9050304f2d8SQu Wenruo lower->level + 1); 9064d81ea8bSQu Wenruo if (!upper) { 9074d81ea8bSQu Wenruo btrfs_put_root(root); 9084d81ea8bSQu Wenruo free_backref_edge(cache, edge); 9094d81ea8bSQu Wenruo ret = -ENOMEM; 9104d81ea8bSQu Wenruo goto out; 9114d81ea8bSQu Wenruo } 9124d81ea8bSQu Wenruo upper->owner = btrfs_header_owner(eb); 9134d81ea8bSQu Wenruo if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 9144d81ea8bSQu Wenruo upper->cowonly = 1; 9154d81ea8bSQu Wenruo 9164d81ea8bSQu Wenruo /* 9174d81ea8bSQu Wenruo * If we know the block isn't shared we can avoid 9184d81ea8bSQu Wenruo * checking its backrefs. 9194d81ea8bSQu Wenruo */ 9204d81ea8bSQu Wenruo if (btrfs_block_can_be_shared(root, eb)) 9214d81ea8bSQu Wenruo upper->checked = 0; 9224d81ea8bSQu Wenruo else 9234d81ea8bSQu Wenruo upper->checked = 1; 9244d81ea8bSQu Wenruo 9254d81ea8bSQu Wenruo /* 9264d81ea8bSQu Wenruo * Add the block to pending list if we need to check its 9274d81ea8bSQu Wenruo * backrefs, we only do this once while walking up a 9284d81ea8bSQu Wenruo * tree as we will catch anything else later on. 9294d81ea8bSQu Wenruo */ 9304d81ea8bSQu Wenruo if (!upper->checked && need_check) { 9314d81ea8bSQu Wenruo need_check = false; 9324d81ea8bSQu Wenruo list_add_tail(&edge->list[UPPER], 9334d81ea8bSQu Wenruo &cache->pending_edge); 9344d81ea8bSQu Wenruo } else { 9354d81ea8bSQu Wenruo if (upper->checked) 9364d81ea8bSQu Wenruo need_check = true; 9374d81ea8bSQu Wenruo INIT_LIST_HEAD(&edge->list[UPPER]); 9384d81ea8bSQu Wenruo } 9394d81ea8bSQu Wenruo } else { 9404d81ea8bSQu Wenruo upper = rb_entry(rb_node, struct backref_node, rb_node); 9414d81ea8bSQu Wenruo ASSERT(upper->checked); 9424d81ea8bSQu Wenruo INIT_LIST_HEAD(&edge->list[UPPER]); 9434d81ea8bSQu Wenruo if (!upper->owner) 9444d81ea8bSQu Wenruo upper->owner = btrfs_header_owner(eb); 9454d81ea8bSQu Wenruo } 9462a979612SQu Wenruo link_backref_edge(edge, lower, upper, LINK_LOWER); 9474d81ea8bSQu Wenruo 9484d81ea8bSQu Wenruo if (rb_node) { 9494d81ea8bSQu Wenruo btrfs_put_root(root); 9504d81ea8bSQu Wenruo break; 9514d81ea8bSQu Wenruo } 9524d81ea8bSQu Wenruo lower = upper; 9534d81ea8bSQu Wenruo upper = NULL; 9544d81ea8bSQu Wenruo } 9554d81ea8bSQu Wenruo out: 9564d81ea8bSQu Wenruo btrfs_release_path(path); 9574d81ea8bSQu Wenruo return ret; 9584d81ea8bSQu Wenruo } 9594d81ea8bSQu Wenruo 960e7d571c7SQu Wenruo static int handle_one_tree_block(struct backref_cache *cache, 961e7d571c7SQu Wenruo struct btrfs_path *path, 962e7d571c7SQu Wenruo struct btrfs_backref_iter *iter, 9635d4f98a2SYan Zheng struct btrfs_key *node_key, 964e7d571c7SQu Wenruo struct backref_node *cur) 9655d4f98a2SYan Zheng { 966e7d571c7SQu Wenruo struct btrfs_fs_info *fs_info = cache->fs_info; 9675d4f98a2SYan Zheng struct backref_edge *edge; 968e7d571c7SQu Wenruo struct backref_node *exist; 9695d4f98a2SYan Zheng int ret; 9705d4f98a2SYan Zheng 97171f572a9SQu Wenruo ret = btrfs_backref_iter_start(iter, cur->bytenr); 972e7d571c7SQu Wenruo if (ret < 0) 973e7d571c7SQu Wenruo return ret; 97471f572a9SQu Wenruo /* 97571f572a9SQu Wenruo * We skip the first btrfs_tree_block_info, as we don't use the key 97671f572a9SQu Wenruo * stored in it, but fetch it from the tree block 97771f572a9SQu Wenruo */ 97871f572a9SQu Wenruo if (btrfs_backref_has_tree_block_info(iter)) { 97971f572a9SQu Wenruo ret = btrfs_backref_iter_next(iter); 980e7d571c7SQu Wenruo if (ret < 0) 98171f572a9SQu Wenruo goto out; 98271f572a9SQu Wenruo /* No extra backref? This means the tree block is corrupted */ 98371f572a9SQu Wenruo if (ret > 0) { 984e7d571c7SQu Wenruo ret = -EUCLEAN; 98571f572a9SQu Wenruo goto out; 98671f572a9SQu Wenruo } 98771f572a9SQu Wenruo } 9885d4f98a2SYan Zheng WARN_ON(cur->checked); 9895d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 9905d4f98a2SYan Zheng /* 99170f23fd6SJustin P. Mattock * the backref was added previously when processing 9925d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 9935d4f98a2SYan Zheng */ 99475bfb9afSJosef Bacik ASSERT(list_is_singular(&cur->upper)); 9955d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 9965d4f98a2SYan Zheng list[LOWER]); 99775bfb9afSJosef Bacik ASSERT(list_empty(&edge->list[UPPER])); 9985d4f98a2SYan Zheng exist = edge->node[UPPER]; 9995d4f98a2SYan Zheng /* 10005d4f98a2SYan Zheng * add the upper level block to pending list if we need 10015d4f98a2SYan Zheng * check its backrefs 10025d4f98a2SYan Zheng */ 10035d4f98a2SYan Zheng if (!exist->checked) 100484780289SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 10055d4f98a2SYan Zheng } else { 10065d4f98a2SYan Zheng exist = NULL; 10075d4f98a2SYan Zheng } 10085d4f98a2SYan Zheng 100971f572a9SQu Wenruo for (; ret == 0; ret = btrfs_backref_iter_next(iter)) { 101071f572a9SQu Wenruo struct extent_buffer *eb; 101171f572a9SQu Wenruo struct btrfs_key key; 10123de28d57SLiu Bo int type; 101371f572a9SQu Wenruo 101471f572a9SQu Wenruo cond_resched(); 101571f572a9SQu Wenruo eb = btrfs_backref_get_eb(iter); 101671f572a9SQu Wenruo 101771f572a9SQu Wenruo key.objectid = iter->bytenr; 101871f572a9SQu Wenruo if (btrfs_backref_iter_is_inline_ref(iter)) { 101971f572a9SQu Wenruo struct btrfs_extent_inline_ref *iref; 102071f572a9SQu Wenruo 102171f572a9SQu Wenruo /* update key for inline back ref */ 102271f572a9SQu Wenruo iref = (struct btrfs_extent_inline_ref *) 102371f572a9SQu Wenruo ((unsigned long)iter->cur_ptr); 10243de28d57SLiu Bo type = btrfs_get_extent_inline_ref_type(eb, iref, 10253de28d57SLiu Bo BTRFS_REF_TYPE_BLOCK); 10263de28d57SLiu Bo if (type == BTRFS_REF_TYPE_INVALID) { 1027e7d571c7SQu Wenruo ret = -EUCLEAN; 10283de28d57SLiu Bo goto out; 10293de28d57SLiu Bo } 10303de28d57SLiu Bo key.type = type; 10315d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 103271f572a9SQu Wenruo } else { 103371f572a9SQu Wenruo key.type = iter->cur_key.type; 103471f572a9SQu Wenruo key.offset = iter->cur_key.offset; 10355d4f98a2SYan Zheng } 10365d4f98a2SYan Zheng 1037fa6ac715SQu Wenruo /* 1038fa6ac715SQu Wenruo * Parent node found and matches current inline ref, no need to 1039fa6ac715SQu Wenruo * rebuild this node for this inline ref. 1040fa6ac715SQu Wenruo */ 10415d4f98a2SYan Zheng if (exist && 10425d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 10435d4f98a2SYan Zheng exist->owner == key.offset) || 10445d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 10455d4f98a2SYan Zheng exist->bytenr == key.offset))) { 10465d4f98a2SYan Zheng exist = NULL; 104771f572a9SQu Wenruo continue; 10485d4f98a2SYan Zheng } 10495d4f98a2SYan Zheng 1050fa6ac715SQu Wenruo /* SHARED_BLOCK_REF means key.offset is the parent bytenr */ 10515d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 10524007ea87SQu Wenruo ret = handle_direct_tree_backref(cache, &key, cur); 1053e7d571c7SQu Wenruo if (ret < 0) 10542433bea5SQu Wenruo goto out; 105571f572a9SQu Wenruo continue; 10566d8ff4e4SDavid Sterba } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) { 1057e7d571c7SQu Wenruo ret = -EINVAL; 1058e7d571c7SQu Wenruo btrfs_print_v0_err(fs_info); 1059e7d571c7SQu Wenruo btrfs_handle_fs_error(fs_info, ret, NULL); 1060ba3c2b19SNikolay Borisov goto out; 10615d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 106271f572a9SQu Wenruo continue; 10635d4f98a2SYan Zheng } 10645d4f98a2SYan Zheng 1065fa6ac715SQu Wenruo /* 1066fa6ac715SQu Wenruo * key.type == BTRFS_TREE_BLOCK_REF_KEY, inline ref offset 1067fa6ac715SQu Wenruo * means the root objectid. We need to search the tree to get 1068fa6ac715SQu Wenruo * its parent bytenr. 1069fa6ac715SQu Wenruo */ 10704d81ea8bSQu Wenruo ret = handle_indirect_tree_backref(cache, path, &key, node_key, 10714d81ea8bSQu Wenruo cur); 1072e7d571c7SQu Wenruo if (ret < 0) 107371f572a9SQu Wenruo goto out; 10745d4f98a2SYan Zheng } 107571f572a9SQu Wenruo ret = 0; 10765d4f98a2SYan Zheng cur->checked = 1; 10775d4f98a2SYan Zheng WARN_ON(exist); 1078e7d571c7SQu Wenruo out: 1079e7d571c7SQu Wenruo btrfs_backref_iter_release(iter); 1080e7d571c7SQu Wenruo return ret; 1081e7d571c7SQu Wenruo } 10825d4f98a2SYan Zheng 1083e7d571c7SQu Wenruo /* 10841f872924SQu Wenruo * In handle_one_tree_backref(), we have only linked the lower node to the edge, 10851f872924SQu Wenruo * but the upper node hasn't been linked to the edge. 10861f872924SQu Wenruo * This means we can only iterate through backref_node::upper to reach parent 10871f872924SQu Wenruo * edges, but not through backref_node::lower to reach children edges. 10881f872924SQu Wenruo * 10891f872924SQu Wenruo * This function will finish the backref_node::lower to related edges, so that 10901f872924SQu Wenruo * backref cache can be bi-directionally iterated. 10911f872924SQu Wenruo * 10921f872924SQu Wenruo * Also, this will add the nodes to backref cache for the next run. 10931f872924SQu Wenruo */ 10941f872924SQu Wenruo static int finish_upper_links(struct backref_cache *cache, 10951f872924SQu Wenruo struct backref_node *start) 10961f872924SQu Wenruo { 10971f872924SQu Wenruo struct list_head *useless_node = &cache->useless_node; 10981f872924SQu Wenruo struct backref_edge *edge; 10991f872924SQu Wenruo struct rb_node *rb_node; 11001f872924SQu Wenruo LIST_HEAD(pending_edge); 11011f872924SQu Wenruo 11021f872924SQu Wenruo ASSERT(start->checked); 11031f872924SQu Wenruo 11041f872924SQu Wenruo /* Insert this node to cache if it's not COW-only */ 11051f872924SQu Wenruo if (!start->cowonly) { 11061f872924SQu Wenruo rb_node = tree_insert(&cache->rb_root, start->bytenr, 11071f872924SQu Wenruo &start->rb_node); 11081f872924SQu Wenruo if (rb_node) 11091f872924SQu Wenruo backref_tree_panic(rb_node, -EEXIST, start->bytenr); 11101f872924SQu Wenruo list_add_tail(&start->lower, &cache->leaves); 11111f872924SQu Wenruo } 11121f872924SQu Wenruo 11131f872924SQu Wenruo /* 11141f872924SQu Wenruo * Use breadth first search to iterate all related edges. 11151f872924SQu Wenruo * 11161f872924SQu Wenruo * The starting points are all the edges of this node 11171f872924SQu Wenruo */ 11181f872924SQu Wenruo list_for_each_entry(edge, &start->upper, list[LOWER]) 11191f872924SQu Wenruo list_add_tail(&edge->list[UPPER], &pending_edge); 11201f872924SQu Wenruo 11211f872924SQu Wenruo while (!list_empty(&pending_edge)) { 11221f872924SQu Wenruo struct backref_node *upper; 11231f872924SQu Wenruo struct backref_node *lower; 11241f872924SQu Wenruo struct rb_node *rb_node; 11251f872924SQu Wenruo 11261f872924SQu Wenruo edge = list_first_entry(&pending_edge, struct backref_edge, 11271f872924SQu Wenruo list[UPPER]); 11281f872924SQu Wenruo list_del_init(&edge->list[UPPER]); 11291f872924SQu Wenruo upper = edge->node[UPPER]; 11301f872924SQu Wenruo lower = edge->node[LOWER]; 11311f872924SQu Wenruo 11321f872924SQu Wenruo /* Parent is detached, no need to keep any edges */ 11331f872924SQu Wenruo if (upper->detached) { 11341f872924SQu Wenruo list_del(&edge->list[LOWER]); 11351f872924SQu Wenruo free_backref_edge(cache, edge); 11361f872924SQu Wenruo 11371f872924SQu Wenruo /* Lower node is orphan, queue for cleanup */ 11381f872924SQu Wenruo if (list_empty(&lower->upper)) 11391f872924SQu Wenruo list_add(&lower->list, useless_node); 11401f872924SQu Wenruo continue; 11411f872924SQu Wenruo } 11421f872924SQu Wenruo 11431f872924SQu Wenruo /* 11441f872924SQu Wenruo * All new nodes added in current build_backref_tree() haven't 11451f872924SQu Wenruo * been linked to the cache rb tree. 11461f872924SQu Wenruo * So if we have upper->rb_node populated, this means a cache 11471f872924SQu Wenruo * hit. We only need to link the edge, as @upper and all its 11481f872924SQu Wenruo * parent have already been linked. 11491f872924SQu Wenruo */ 11501f872924SQu Wenruo if (!RB_EMPTY_NODE(&upper->rb_node)) { 11511f872924SQu Wenruo if (upper->lowest) { 11521f872924SQu Wenruo list_del_init(&upper->lower); 11531f872924SQu Wenruo upper->lowest = 0; 11541f872924SQu Wenruo } 11551f872924SQu Wenruo 11561f872924SQu Wenruo list_add_tail(&edge->list[UPPER], &upper->lower); 11571f872924SQu Wenruo continue; 11581f872924SQu Wenruo } 11591f872924SQu Wenruo 11601f872924SQu Wenruo /* Sanity check, we shouldn't have any unchecked nodes */ 11611f872924SQu Wenruo if (!upper->checked) { 11621f872924SQu Wenruo ASSERT(0); 11631f872924SQu Wenruo return -EUCLEAN; 11641f872924SQu Wenruo } 11651f872924SQu Wenruo 11661f872924SQu Wenruo /* Sanity check, COW-only node has non-COW-only parent */ 11671f872924SQu Wenruo if (start->cowonly != upper->cowonly) { 11681f872924SQu Wenruo ASSERT(0); 11691f872924SQu Wenruo return -EUCLEAN; 11701f872924SQu Wenruo } 11711f872924SQu Wenruo 11721f872924SQu Wenruo /* Only cache non-COW-only (subvolume trees) tree blocks */ 11731f872924SQu Wenruo if (!upper->cowonly) { 11741f872924SQu Wenruo rb_node = tree_insert(&cache->rb_root, upper->bytenr, 11751f872924SQu Wenruo &upper->rb_node); 11761f872924SQu Wenruo if (rb_node) { 11771f872924SQu Wenruo backref_tree_panic(rb_node, -EEXIST, 11781f872924SQu Wenruo upper->bytenr); 11791f872924SQu Wenruo return -EUCLEAN; 11801f872924SQu Wenruo } 11811f872924SQu Wenruo } 11821f872924SQu Wenruo 11831f872924SQu Wenruo list_add_tail(&edge->list[UPPER], &upper->lower); 11841f872924SQu Wenruo 11851f872924SQu Wenruo /* 11861f872924SQu Wenruo * Also queue all the parent edges of this uncached node to 11871f872924SQu Wenruo * finish the upper linkage 11881f872924SQu Wenruo */ 11891f872924SQu Wenruo list_for_each_entry(edge, &upper->upper, list[LOWER]) 11901f872924SQu Wenruo list_add_tail(&edge->list[UPPER], &pending_edge); 11911f872924SQu Wenruo } 11921f872924SQu Wenruo return 0; 11931f872924SQu Wenruo } 11941f872924SQu Wenruo 11951f872924SQu Wenruo /* 1196e7d571c7SQu Wenruo * Build backref tree for a given tree block. Root of the backref tree 1197e7d571c7SQu Wenruo * corresponds the tree block, leaves of the backref tree correspond roots of 1198e7d571c7SQu Wenruo * b-trees that reference the tree block. 1199e7d571c7SQu Wenruo * 1200e7d571c7SQu Wenruo * The basic idea of this function is check backrefs of a given block to find 1201e7d571c7SQu Wenruo * upper level blocks that reference the block, and then check backrefs of 1202e7d571c7SQu Wenruo * these upper level blocks recursively. The recursion stops when tree root is 1203e7d571c7SQu Wenruo * reached or backrefs for the block is cached. 1204e7d571c7SQu Wenruo * 1205e7d571c7SQu Wenruo * NOTE: if we find that backrefs for a block are cached, we know backrefs for 1206e7d571c7SQu Wenruo * all upper level blocks that directly/indirectly reference the block are also 1207e7d571c7SQu Wenruo * cached. 1208e7d571c7SQu Wenruo */ 1209e7d571c7SQu Wenruo static noinline_for_stack struct backref_node *build_backref_tree( 1210e7d571c7SQu Wenruo struct reloc_control *rc, struct btrfs_key *node_key, 1211e7d571c7SQu Wenruo int level, u64 bytenr) 1212e7d571c7SQu Wenruo { 1213e7d571c7SQu Wenruo struct btrfs_backref_iter *iter; 1214e7d571c7SQu Wenruo struct backref_cache *cache = &rc->backref_cache; 1215e7d571c7SQu Wenruo /* For searching parent of TREE_BLOCK_REF */ 1216e7d571c7SQu Wenruo struct btrfs_path *path; 1217e7d571c7SQu Wenruo struct backref_node *cur; 1218e7d571c7SQu Wenruo struct backref_node *upper; 1219e7d571c7SQu Wenruo struct backref_node *lower; 1220e7d571c7SQu Wenruo struct backref_node *node = NULL; 1221e7d571c7SQu Wenruo struct backref_edge *edge; 1222e7d571c7SQu Wenruo int ret; 1223e7d571c7SQu Wenruo int err = 0; 1224e7d571c7SQu Wenruo 1225e7d571c7SQu Wenruo iter = btrfs_backref_iter_alloc(rc->extent_root->fs_info, GFP_NOFS); 1226e7d571c7SQu Wenruo if (!iter) 1227e7d571c7SQu Wenruo return ERR_PTR(-ENOMEM); 1228e7d571c7SQu Wenruo path = btrfs_alloc_path(); 1229e7d571c7SQu Wenruo if (!path) { 1230e7d571c7SQu Wenruo err = -ENOMEM; 1231e7d571c7SQu Wenruo goto out; 1232e7d571c7SQu Wenruo } 1233e7d571c7SQu Wenruo 1234e7d571c7SQu Wenruo node = alloc_backref_node(cache, bytenr, level); 1235e7d571c7SQu Wenruo if (!node) { 1236e7d571c7SQu Wenruo err = -ENOMEM; 1237e7d571c7SQu Wenruo goto out; 1238e7d571c7SQu Wenruo } 1239e7d571c7SQu Wenruo 1240e7d571c7SQu Wenruo node->lowest = 1; 1241e7d571c7SQu Wenruo cur = node; 1242e7d571c7SQu Wenruo 1243e7d571c7SQu Wenruo /* Breadth-first search to build backref cache */ 1244e7d571c7SQu Wenruo do { 1245e7d571c7SQu Wenruo ret = handle_one_tree_block(cache, path, iter, node_key, cur); 1246e7d571c7SQu Wenruo if (ret < 0) { 1247e7d571c7SQu Wenruo err = ret; 1248e7d571c7SQu Wenruo goto out; 1249e7d571c7SQu Wenruo } 1250e7d571c7SQu Wenruo edge = list_first_entry_or_null(&cache->pending_edge, 125184780289SQu Wenruo struct backref_edge, list[UPPER]); 1252e7d571c7SQu Wenruo /* 1253e7d571c7SQu Wenruo * The pending list isn't empty, take the first block to 1254e7d571c7SQu Wenruo * process 1255e7d571c7SQu Wenruo */ 1256e7d571c7SQu Wenruo if (edge) { 12575d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 12585d4f98a2SYan Zheng cur = edge->node[UPPER]; 12595d4f98a2SYan Zheng } 1260e7d571c7SQu Wenruo } while (edge); 12615d4f98a2SYan Zheng 12621f872924SQu Wenruo /* Finish the upper linkage of newly added edges/nodes */ 12631f872924SQu Wenruo ret = finish_upper_links(cache, node); 12641f872924SQu Wenruo if (ret < 0) { 12651f872924SQu Wenruo err = ret; 126675bfb9afSJosef Bacik goto out; 126775bfb9afSJosef Bacik } 126875bfb9afSJosef Bacik 12693fd0a558SYan, Zheng /* 12703fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 12713fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 12723fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 12733fd0a558SYan, Zheng * lookup. 12743fd0a558SYan, Zheng */ 127584780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 127684780289SQu Wenruo upper = list_first_entry(&cache->useless_node, 127784780289SQu Wenruo struct backref_node, list); 12783fd0a558SYan, Zheng list_del_init(&upper->list); 127975bfb9afSJosef Bacik ASSERT(list_empty(&upper->upper)); 12803fd0a558SYan, Zheng if (upper == node) 12813fd0a558SYan, Zheng node = NULL; 12823fd0a558SYan, Zheng if (upper->lowest) { 12833fd0a558SYan, Zheng list_del_init(&upper->lower); 12843fd0a558SYan, Zheng upper->lowest = 0; 12853fd0a558SYan, Zheng } 12863fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 128784780289SQu Wenruo edge = list_first_entry(&upper->lower, 12883fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 12893fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 12903fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 12913fd0a558SYan, Zheng lower = edge->node[LOWER]; 12923fd0a558SYan, Zheng free_backref_edge(cache, edge); 12933fd0a558SYan, Zheng 12943fd0a558SYan, Zheng if (list_empty(&lower->upper)) 129584780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 12963fd0a558SYan, Zheng } 12979569cc20SQu Wenruo mark_block_processed(rc, upper); 12983fd0a558SYan, Zheng if (upper->level > 0) { 12993fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 13003fd0a558SYan, Zheng upper->detached = 1; 13013fd0a558SYan, Zheng } else { 13023fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 13033fd0a558SYan, Zheng free_backref_node(cache, upper); 13043fd0a558SYan, Zheng } 13053fd0a558SYan, Zheng } 13065d4f98a2SYan Zheng out: 130771f572a9SQu Wenruo btrfs_backref_iter_free(iter); 130871f572a9SQu Wenruo btrfs_free_path(path); 13095d4f98a2SYan Zheng if (err) { 131084780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 131184780289SQu Wenruo lower = list_first_entry(&cache->useless_node, 131275bfb9afSJosef Bacik struct backref_node, list); 131375bfb9afSJosef Bacik list_del_init(&lower->list); 13143fd0a558SYan, Zheng } 131584780289SQu Wenruo while (!list_empty(&cache->pending_edge)) { 131684780289SQu Wenruo edge = list_first_entry(&cache->pending_edge, 131784780289SQu Wenruo struct backref_edge, list[UPPER]); 131875bfb9afSJosef Bacik list_del(&edge->list[UPPER]); 13193fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 132075bfb9afSJosef Bacik lower = edge->node[LOWER]; 13215d4f98a2SYan Zheng upper = edge->node[UPPER]; 13223fd0a558SYan, Zheng free_backref_edge(cache, edge); 132375bfb9afSJosef Bacik 132475bfb9afSJosef Bacik /* 132575bfb9afSJosef Bacik * Lower is no longer linked to any upper backref nodes 132675bfb9afSJosef Bacik * and isn't in the cache, we can free it ourselves. 132775bfb9afSJosef Bacik */ 132875bfb9afSJosef Bacik if (list_empty(&lower->upper) && 132975bfb9afSJosef Bacik RB_EMPTY_NODE(&lower->rb_node)) 133084780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 133175bfb9afSJosef Bacik 133275bfb9afSJosef Bacik if (!RB_EMPTY_NODE(&upper->rb_node)) 133375bfb9afSJosef Bacik continue; 133475bfb9afSJosef Bacik 133501327610SNicholas D Steeves /* Add this guy's upper edges to the list to process */ 133675bfb9afSJosef Bacik list_for_each_entry(edge, &upper->upper, list[LOWER]) 133784780289SQu Wenruo list_add_tail(&edge->list[UPPER], 133884780289SQu Wenruo &cache->pending_edge); 133975bfb9afSJosef Bacik if (list_empty(&upper->upper)) 134084780289SQu Wenruo list_add(&upper->list, &cache->useless_node); 134175bfb9afSJosef Bacik } 134275bfb9afSJosef Bacik 134384780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 134484780289SQu Wenruo lower = list_first_entry(&cache->useless_node, 134575bfb9afSJosef Bacik struct backref_node, list); 134675bfb9afSJosef Bacik list_del_init(&lower->list); 13470fd8c3daSLiu Bo if (lower == node) 13480fd8c3daSLiu Bo node = NULL; 134975bfb9afSJosef Bacik free_backref_node(cache, lower); 13505d4f98a2SYan Zheng } 13510fd8c3daSLiu Bo 13528e19c973SJosef Bacik remove_backref_node(cache, node); 135384780289SQu Wenruo ASSERT(list_empty(&cache->useless_node) && 135484780289SQu Wenruo list_empty(&cache->pending_edge)); 13555d4f98a2SYan Zheng return ERR_PTR(err); 13565d4f98a2SYan Zheng } 135775bfb9afSJosef Bacik ASSERT(!node || !node->detached); 135884780289SQu Wenruo ASSERT(list_empty(&cache->useless_node) && 135984780289SQu Wenruo list_empty(&cache->pending_edge)); 13605d4f98a2SYan Zheng return node; 13615d4f98a2SYan Zheng } 13625d4f98a2SYan Zheng 13635d4f98a2SYan Zheng /* 13643fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 13653fd0a558SYan, Zheng * the backref node is created by cloning backref node that 13663fd0a558SYan, Zheng * corresponds to root of source tree 13673fd0a558SYan, Zheng */ 13683fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 13693fd0a558SYan, Zheng struct reloc_control *rc, 13703fd0a558SYan, Zheng struct btrfs_root *src, 13713fd0a558SYan, Zheng struct btrfs_root *dest) 13723fd0a558SYan, Zheng { 13733fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 13743fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 13753fd0a558SYan, Zheng struct backref_node *node = NULL; 13763fd0a558SYan, Zheng struct backref_node *new_node; 13773fd0a558SYan, Zheng struct backref_edge *edge; 13783fd0a558SYan, Zheng struct backref_edge *new_edge; 13793fd0a558SYan, Zheng struct rb_node *rb_node; 13803fd0a558SYan, Zheng 13813fd0a558SYan, Zheng if (cache->last_trans > 0) 13823fd0a558SYan, Zheng update_backref_cache(trans, cache); 13833fd0a558SYan, Zheng 13843fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 13853fd0a558SYan, Zheng if (rb_node) { 13863fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 13873fd0a558SYan, Zheng if (node->detached) 13883fd0a558SYan, Zheng node = NULL; 13893fd0a558SYan, Zheng else 13903fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 13913fd0a558SYan, Zheng } 13923fd0a558SYan, Zheng 13933fd0a558SYan, Zheng if (!node) { 13943fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 13953fd0a558SYan, Zheng reloc_root->commit_root->start); 13963fd0a558SYan, Zheng if (rb_node) { 13973fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 13983fd0a558SYan, Zheng rb_node); 13993fd0a558SYan, Zheng BUG_ON(node->detached); 14003fd0a558SYan, Zheng } 14013fd0a558SYan, Zheng } 14023fd0a558SYan, Zheng 14033fd0a558SYan, Zheng if (!node) 14043fd0a558SYan, Zheng return 0; 14053fd0a558SYan, Zheng 14060304f2d8SQu Wenruo new_node = alloc_backref_node(cache, dest->node->start, node->level); 14073fd0a558SYan, Zheng if (!new_node) 14083fd0a558SYan, Zheng return -ENOMEM; 14093fd0a558SYan, Zheng 14103fd0a558SYan, Zheng new_node->lowest = node->lowest; 14116848ad64SYan, Zheng new_node->checked = 1; 141200246528SJosef Bacik new_node->root = btrfs_grab_root(dest); 14130b530bc5SJosef Bacik ASSERT(new_node->root); 14143fd0a558SYan, Zheng 14153fd0a558SYan, Zheng if (!node->lowest) { 14163fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 14173fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 14183fd0a558SYan, Zheng if (!new_edge) 14193fd0a558SYan, Zheng goto fail; 14203fd0a558SYan, Zheng 14212a979612SQu Wenruo link_backref_edge(new_edge, edge->node[LOWER], new_node, 14222a979612SQu Wenruo LINK_UPPER); 14233fd0a558SYan, Zheng } 142476b9e23dSMiao Xie } else { 142576b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 14263fd0a558SYan, Zheng } 14273fd0a558SYan, Zheng 14283fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 14293fd0a558SYan, Zheng &new_node->rb_node); 143043c04fb1SJeff Mahoney if (rb_node) 143143c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 14323fd0a558SYan, Zheng 14333fd0a558SYan, Zheng if (!new_node->lowest) { 14343fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 14353fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 14363fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 14373fd0a558SYan, Zheng } 14383fd0a558SYan, Zheng } 14393fd0a558SYan, Zheng return 0; 14403fd0a558SYan, Zheng fail: 14413fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 14423fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 14433fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 14443fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 14453fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 14463fd0a558SYan, Zheng } 14473fd0a558SYan, Zheng free_backref_node(cache, new_node); 14483fd0a558SYan, Zheng return -ENOMEM; 14493fd0a558SYan, Zheng } 14503fd0a558SYan, Zheng 14513fd0a558SYan, Zheng /* 14525d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 14535d4f98a2SYan Zheng */ 1454ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 14555d4f98a2SYan Zheng { 14560b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14575d4f98a2SYan Zheng struct rb_node *rb_node; 14585d4f98a2SYan Zheng struct mapping_node *node; 14590b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 14605d4f98a2SYan Zheng 14615d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1462ffd7b339SJeff Mahoney if (!node) 1463ffd7b339SJeff Mahoney return -ENOMEM; 14645d4f98a2SYan Zheng 1465ea287ab1SJosef Bacik node->bytenr = root->commit_root->start; 14665d4f98a2SYan Zheng node->data = root; 14675d4f98a2SYan Zheng 14685d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 14695d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 14705d4f98a2SYan Zheng node->bytenr, &node->rb_node); 14715d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1472ffd7b339SJeff Mahoney if (rb_node) { 14730b246afaSJeff Mahoney btrfs_panic(fs_info, -EEXIST, 14745d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 14755d163e0eSJeff Mahoney node->bytenr); 1476ffd7b339SJeff Mahoney } 14775d4f98a2SYan Zheng 14785d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 14795d4f98a2SYan Zheng return 0; 14805d4f98a2SYan Zheng } 14815d4f98a2SYan Zheng 14825d4f98a2SYan Zheng /* 1483c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 14845d4f98a2SYan Zheng * mapping 14855d4f98a2SYan Zheng */ 1486c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 14875d4f98a2SYan Zheng { 14880b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14895d4f98a2SYan Zheng struct rb_node *rb_node; 14905d4f98a2SYan Zheng struct mapping_node *node = NULL; 14910b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1492f44deb74SJosef Bacik bool put_ref = false; 14935d4f98a2SYan Zheng 149465c6e82bSQu Wenruo if (rc && root->node) { 14955d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 14965d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1497ea287ab1SJosef Bacik root->commit_root->start); 1498c974c464SWang Shilong if (rb_node) { 1499c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1500c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1501ea287ab1SJosef Bacik RB_CLEAR_NODE(&node->rb_node); 1502c974c464SWang Shilong } 1503c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1504c974c464SWang Shilong if (!node) 1505c974c464SWang Shilong return; 1506c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1507389305b2SQu Wenruo } 1508c974c464SWang Shilong 1509f44deb74SJosef Bacik /* 1510f44deb74SJosef Bacik * We only put the reloc root here if it's on the list. There's a lot 1511f44deb74SJosef Bacik * of places where the pattern is to splice the rc->reloc_roots, process 1512f44deb74SJosef Bacik * the reloc roots, and then add the reloc root back onto 1513f44deb74SJosef Bacik * rc->reloc_roots. If we call __del_reloc_root while it's off of the 1514f44deb74SJosef Bacik * list we don't want the reference being dropped, because the guy 1515f44deb74SJosef Bacik * messing with the list is in charge of the reference. 1516f44deb74SJosef Bacik */ 15170b246afaSJeff Mahoney spin_lock(&fs_info->trans_lock); 1518f44deb74SJosef Bacik if (!list_empty(&root->root_list)) { 1519f44deb74SJosef Bacik put_ref = true; 1520c974c464SWang Shilong list_del_init(&root->root_list); 1521f44deb74SJosef Bacik } 15220b246afaSJeff Mahoney spin_unlock(&fs_info->trans_lock); 1523f44deb74SJosef Bacik if (put_ref) 1524f44deb74SJosef Bacik btrfs_put_root(root); 1525c974c464SWang Shilong kfree(node); 1526c974c464SWang Shilong } 1527c974c464SWang Shilong 1528c974c464SWang Shilong /* 1529c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1530c974c464SWang Shilong * mapping 1531c974c464SWang Shilong */ 1532ea287ab1SJosef Bacik static int __update_reloc_root(struct btrfs_root *root) 1533c974c464SWang Shilong { 15340b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 1535c974c464SWang Shilong struct rb_node *rb_node; 1536c974c464SWang Shilong struct mapping_node *node = NULL; 15370b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1538c974c464SWang Shilong 1539c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1540c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1541ea287ab1SJosef Bacik root->commit_root->start); 15425d4f98a2SYan Zheng if (rb_node) { 15435d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 15445d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 15455d4f98a2SYan Zheng } 15465d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 15475d4f98a2SYan Zheng 15488f71f3e0SLiu Bo if (!node) 15498f71f3e0SLiu Bo return 0; 15505d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 15515d4f98a2SYan Zheng 15525d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1553ea287ab1SJosef Bacik node->bytenr = root->node->start; 15545d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 15555d4f98a2SYan Zheng node->bytenr, &node->rb_node); 15565d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 155743c04fb1SJeff Mahoney if (rb_node) 155843c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 15595d4f98a2SYan Zheng return 0; 15605d4f98a2SYan Zheng } 15615d4f98a2SYan Zheng 15623fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 15633fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 15645d4f98a2SYan Zheng { 15650b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 15665d4f98a2SYan Zheng struct btrfs_root *reloc_root; 15675d4f98a2SYan Zheng struct extent_buffer *eb; 15685d4f98a2SYan Zheng struct btrfs_root_item *root_item; 15695d4f98a2SYan Zheng struct btrfs_key root_key; 15705d4f98a2SYan Zheng int ret; 15715d4f98a2SYan Zheng 15725d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 15735d4f98a2SYan Zheng BUG_ON(!root_item); 15745d4f98a2SYan Zheng 15755d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 15765d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 15773fd0a558SYan, Zheng root_key.offset = objectid; 15785d4f98a2SYan Zheng 15793fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 1580054570a1SFilipe Manana u64 commit_root_gen; 1581054570a1SFilipe Manana 15823fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 15835d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 15845d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 15855d4f98a2SYan Zheng BUG_ON(ret); 1586054570a1SFilipe Manana /* 1587054570a1SFilipe Manana * Set the last_snapshot field to the generation of the commit 1588054570a1SFilipe Manana * root - like this ctree.c:btrfs_block_can_be_shared() behaves 1589054570a1SFilipe Manana * correctly (returns true) when the relocation root is created 1590054570a1SFilipe Manana * either inside the critical section of a transaction commit 1591054570a1SFilipe Manana * (through transaction.c:qgroup_account_snapshot()) and when 1592054570a1SFilipe Manana * it's created before the transaction commit is started. 1593054570a1SFilipe Manana */ 1594054570a1SFilipe Manana commit_root_gen = btrfs_header_generation(root->commit_root); 1595054570a1SFilipe Manana btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); 15963fd0a558SYan, Zheng } else { 15973fd0a558SYan, Zheng /* 15983fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 15993fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 16003fd0a558SYan, Zheng * modified after it was created have RELOC flag 16013fd0a558SYan, Zheng * set in their headers. so it's OK to not update 16023fd0a558SYan, Zheng * the 'last_snapshot'. 16033fd0a558SYan, Zheng */ 16043fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 16053fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 16063fd0a558SYan, Zheng BUG_ON(ret); 16073fd0a558SYan, Zheng } 16083fd0a558SYan, Zheng 16095d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 16105d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 16115d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 16125d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 16133fd0a558SYan, Zheng 16143fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 16153fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 16163fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 16173fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 16185d4f98a2SYan Zheng root_item->drop_level = 0; 16193fd0a558SYan, Zheng } 16205d4f98a2SYan Zheng 16215d4f98a2SYan Zheng btrfs_tree_unlock(eb); 16225d4f98a2SYan Zheng free_extent_buffer(eb); 16235d4f98a2SYan Zheng 16240b246afaSJeff Mahoney ret = btrfs_insert_root(trans, fs_info->tree_root, 16255d4f98a2SYan Zheng &root_key, root_item); 16265d4f98a2SYan Zheng BUG_ON(ret); 16275d4f98a2SYan Zheng kfree(root_item); 16285d4f98a2SYan Zheng 16293dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(fs_info->tree_root, &root_key); 16305d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 16313dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 16325d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 16333fd0a558SYan, Zheng return reloc_root; 16343fd0a558SYan, Zheng } 16353fd0a558SYan, Zheng 16363fd0a558SYan, Zheng /* 16373fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 16383fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 1639f44deb74SJosef Bacik * 1640f44deb74SJosef Bacik * The reloc_root comes out of here with two references, one for 1641f44deb74SJosef Bacik * root->reloc_root, and another for being on the rc->reloc_roots list. 16423fd0a558SYan, Zheng */ 16433fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 16443fd0a558SYan, Zheng struct btrfs_root *root) 16453fd0a558SYan, Zheng { 16460b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 16473fd0a558SYan, Zheng struct btrfs_root *reloc_root; 16480b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 164920dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 16503fd0a558SYan, Zheng int clear_rsv = 0; 1651ffd7b339SJeff Mahoney int ret; 16523fd0a558SYan, Zheng 1653aec7db3bSJosef Bacik if (!rc) 16542abc726aSJosef Bacik return 0; 16552abc726aSJosef Bacik 16561fac4a54SQu Wenruo /* 16571fac4a54SQu Wenruo * The subvolume has reloc tree but the swap is finished, no need to 16581fac4a54SQu Wenruo * create/update the dead reloc tree 16591fac4a54SQu Wenruo */ 16606282675eSQu Wenruo if (reloc_root_is_dead(root)) 16611fac4a54SQu Wenruo return 0; 16621fac4a54SQu Wenruo 1663aec7db3bSJosef Bacik /* 1664aec7db3bSJosef Bacik * This is subtle but important. We do not do 1665aec7db3bSJosef Bacik * record_root_in_transaction for reloc roots, instead we record their 1666aec7db3bSJosef Bacik * corresponding fs root, and then here we update the last trans for the 1667aec7db3bSJosef Bacik * reloc root. This means that we have to do this for the entire life 1668aec7db3bSJosef Bacik * of the reloc root, regardless of which stage of the relocation we are 1669aec7db3bSJosef Bacik * in. 1670aec7db3bSJosef Bacik */ 16713fd0a558SYan, Zheng if (root->reloc_root) { 16723fd0a558SYan, Zheng reloc_root = root->reloc_root; 16733fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 16743fd0a558SYan, Zheng return 0; 16753fd0a558SYan, Zheng } 16763fd0a558SYan, Zheng 1677aec7db3bSJosef Bacik /* 1678aec7db3bSJosef Bacik * We are merging reloc roots, we do not need new reloc trees. Also 1679aec7db3bSJosef Bacik * reloc trees never need their own reloc tree. 1680aec7db3bSJosef Bacik */ 1681aec7db3bSJosef Bacik if (!rc->create_reloc_tree || 1682aec7db3bSJosef Bacik root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 1683aec7db3bSJosef Bacik return 0; 1684aec7db3bSJosef Bacik 168520dd2cbfSMiao Xie if (!trans->reloc_reserved) { 168620dd2cbfSMiao Xie rsv = trans->block_rsv; 16873fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 16883fd0a558SYan, Zheng clear_rsv = 1; 16893fd0a558SYan, Zheng } 16903fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 16913fd0a558SYan, Zheng if (clear_rsv) 169220dd2cbfSMiao Xie trans->block_rsv = rsv; 16935d4f98a2SYan Zheng 1694ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1695ffd7b339SJeff Mahoney BUG_ON(ret < 0); 1696f44deb74SJosef Bacik root->reloc_root = btrfs_grab_root(reloc_root); 16975d4f98a2SYan Zheng return 0; 16985d4f98a2SYan Zheng } 16995d4f98a2SYan Zheng 17005d4f98a2SYan Zheng /* 17015d4f98a2SYan Zheng * update root item of reloc tree 17025d4f98a2SYan Zheng */ 17035d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 17045d4f98a2SYan Zheng struct btrfs_root *root) 17055d4f98a2SYan Zheng { 17060b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 17075d4f98a2SYan Zheng struct btrfs_root *reloc_root; 17085d4f98a2SYan Zheng struct btrfs_root_item *root_item; 17095d4f98a2SYan Zheng int ret; 17105d4f98a2SYan Zheng 17116282675eSQu Wenruo if (!have_reloc_root(root)) 17127585717fSChris Mason goto out; 17135d4f98a2SYan Zheng 17145d4f98a2SYan Zheng reloc_root = root->reloc_root; 17155d4f98a2SYan Zheng root_item = &reloc_root->root_item; 17165d4f98a2SYan Zheng 1717f44deb74SJosef Bacik /* 1718f44deb74SJosef Bacik * We are probably ok here, but __del_reloc_root() will drop its ref of 1719f44deb74SJosef Bacik * the root. We have the ref for root->reloc_root, but just in case 1720f44deb74SJosef Bacik * hold it while we update the reloc root. 1721f44deb74SJosef Bacik */ 1722f44deb74SJosef Bacik btrfs_grab_root(reloc_root); 1723f44deb74SJosef Bacik 1724d2311e69SQu Wenruo /* root->reloc_root will stay until current relocation finished */ 17250b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 17263fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 1727d2311e69SQu Wenruo set_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 17286282675eSQu Wenruo /* 17296282675eSQu Wenruo * Mark the tree as dead before we change reloc_root so 17306282675eSQu Wenruo * have_reloc_root will not touch it from now on. 17316282675eSQu Wenruo */ 17326282675eSQu Wenruo smp_wmb(); 1733c974c464SWang Shilong __del_reloc_root(reloc_root); 17345d4f98a2SYan Zheng } 17355d4f98a2SYan Zheng 17365d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 1737ea287ab1SJosef Bacik __update_reloc_root(reloc_root); 17385d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 17395d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 17405d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 17415d4f98a2SYan Zheng } 17425d4f98a2SYan Zheng 17430b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 17445d4f98a2SYan Zheng &reloc_root->root_key, root_item); 17455d4f98a2SYan Zheng BUG_ON(ret); 1746f44deb74SJosef Bacik btrfs_put_root(reloc_root); 17477585717fSChris Mason out: 17485d4f98a2SYan Zheng return 0; 17495d4f98a2SYan Zheng } 17505d4f98a2SYan Zheng 17515d4f98a2SYan Zheng /* 17525d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 17535d4f98a2SYan Zheng * in a subvolume 17545d4f98a2SYan Zheng */ 17555d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 17565d4f98a2SYan Zheng { 17575d4f98a2SYan Zheng struct rb_node *node; 17585d4f98a2SYan Zheng struct rb_node *prev; 17595d4f98a2SYan Zheng struct btrfs_inode *entry; 17605d4f98a2SYan Zheng struct inode *inode; 17615d4f98a2SYan Zheng 17625d4f98a2SYan Zheng spin_lock(&root->inode_lock); 17635d4f98a2SYan Zheng again: 17645d4f98a2SYan Zheng node = root->inode_tree.rb_node; 17655d4f98a2SYan Zheng prev = NULL; 17665d4f98a2SYan Zheng while (node) { 17675d4f98a2SYan Zheng prev = node; 17685d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 17695d4f98a2SYan Zheng 17704a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 17715d4f98a2SYan Zheng node = node->rb_left; 17724a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 17735d4f98a2SYan Zheng node = node->rb_right; 17745d4f98a2SYan Zheng else 17755d4f98a2SYan Zheng break; 17765d4f98a2SYan Zheng } 17775d4f98a2SYan Zheng if (!node) { 17785d4f98a2SYan Zheng while (prev) { 17795d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 17804a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 17815d4f98a2SYan Zheng node = prev; 17825d4f98a2SYan Zheng break; 17835d4f98a2SYan Zheng } 17845d4f98a2SYan Zheng prev = rb_next(prev); 17855d4f98a2SYan Zheng } 17865d4f98a2SYan Zheng } 17875d4f98a2SYan Zheng while (node) { 17885d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 17895d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 17905d4f98a2SYan Zheng if (inode) { 17915d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 17925d4f98a2SYan Zheng return inode; 17935d4f98a2SYan Zheng } 17945d4f98a2SYan Zheng 17954a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 17965d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 17975d4f98a2SYan Zheng goto again; 17985d4f98a2SYan Zheng 17995d4f98a2SYan Zheng node = rb_next(node); 18005d4f98a2SYan Zheng } 18015d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 18025d4f98a2SYan Zheng return NULL; 18035d4f98a2SYan Zheng } 18045d4f98a2SYan Zheng 18055d4f98a2SYan Zheng /* 18065d4f98a2SYan Zheng * get new location of data 18075d4f98a2SYan Zheng */ 18085d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 18095d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 18105d4f98a2SYan Zheng { 18115d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 18125d4f98a2SYan Zheng struct btrfs_path *path; 18135d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 18145d4f98a2SYan Zheng struct extent_buffer *leaf; 18155d4f98a2SYan Zheng int ret; 18165d4f98a2SYan Zheng 18175d4f98a2SYan Zheng path = btrfs_alloc_path(); 18185d4f98a2SYan Zheng if (!path) 18195d4f98a2SYan Zheng return -ENOMEM; 18205d4f98a2SYan Zheng 18215d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 1822f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 1823f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 18245d4f98a2SYan Zheng if (ret < 0) 18255d4f98a2SYan Zheng goto out; 18265d4f98a2SYan Zheng if (ret > 0) { 18275d4f98a2SYan Zheng ret = -ENOENT; 18285d4f98a2SYan Zheng goto out; 18295d4f98a2SYan Zheng } 18305d4f98a2SYan Zheng 18315d4f98a2SYan Zheng leaf = path->nodes[0]; 18325d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 18335d4f98a2SYan Zheng struct btrfs_file_extent_item); 18345d4f98a2SYan Zheng 18355d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 18365d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 18375d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 18385d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 18395d4f98a2SYan Zheng 18405d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 184183d4cfd4SJosef Bacik ret = -EINVAL; 18425d4f98a2SYan Zheng goto out; 18435d4f98a2SYan Zheng } 18445d4f98a2SYan Zheng 18455d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 18465d4f98a2SYan Zheng ret = 0; 18475d4f98a2SYan Zheng out: 18485d4f98a2SYan Zheng btrfs_free_path(path); 18495d4f98a2SYan Zheng return ret; 18505d4f98a2SYan Zheng } 18515d4f98a2SYan Zheng 18525d4f98a2SYan Zheng /* 18535d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 18545d4f98a2SYan Zheng * the new locations. 18555d4f98a2SYan Zheng */ 18563fd0a558SYan, Zheng static noinline_for_stack 18573fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 18585d4f98a2SYan Zheng struct reloc_control *rc, 18595d4f98a2SYan Zheng struct btrfs_root *root, 18603fd0a558SYan, Zheng struct extent_buffer *leaf) 18615d4f98a2SYan Zheng { 18620b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 18635d4f98a2SYan Zheng struct btrfs_key key; 18645d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 18655d4f98a2SYan Zheng struct inode *inode = NULL; 18665d4f98a2SYan Zheng u64 parent; 18675d4f98a2SYan Zheng u64 bytenr; 18683fd0a558SYan, Zheng u64 new_bytenr = 0; 18695d4f98a2SYan Zheng u64 num_bytes; 18705d4f98a2SYan Zheng u64 end; 18715d4f98a2SYan Zheng u32 nritems; 18725d4f98a2SYan Zheng u32 i; 187383d4cfd4SJosef Bacik int ret = 0; 18745d4f98a2SYan Zheng int first = 1; 18755d4f98a2SYan Zheng int dirty = 0; 18765d4f98a2SYan Zheng 18775d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 18785d4f98a2SYan Zheng return 0; 18795d4f98a2SYan Zheng 18805d4f98a2SYan Zheng /* reloc trees always use full backref */ 18815d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 18825d4f98a2SYan Zheng parent = leaf->start; 18835d4f98a2SYan Zheng else 18845d4f98a2SYan Zheng parent = 0; 18855d4f98a2SYan Zheng 18865d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 18875d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 188882fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 188982fa113fSQu Wenruo 18905d4f98a2SYan Zheng cond_resched(); 18915d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 18925d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 18935d4f98a2SYan Zheng continue; 18945d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 18955d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 18965d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 18975d4f98a2SYan Zheng continue; 18985d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 18995d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 19005d4f98a2SYan Zheng if (bytenr == 0) 19015d4f98a2SYan Zheng continue; 19029569cc20SQu Wenruo if (!in_range(bytenr, rc->block_group->start, 19039569cc20SQu Wenruo rc->block_group->length)) 19045d4f98a2SYan Zheng continue; 19055d4f98a2SYan Zheng 19065d4f98a2SYan Zheng /* 19075d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 19085d4f98a2SYan Zheng * to complete and drop the extent cache 19095d4f98a2SYan Zheng */ 19105d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 19115d4f98a2SYan Zheng if (first) { 19125d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 19135d4f98a2SYan Zheng first = 0; 19144a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 19153fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 19165d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 19175d4f98a2SYan Zheng } 19184a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 19195d4f98a2SYan Zheng end = key.offset + 19205d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 19215d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 19220b246afaSJeff Mahoney fs_info->sectorsize)); 19230b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 19245d4f98a2SYan Zheng end--; 19255d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1926d0082371SJeff Mahoney key.offset, end); 19275d4f98a2SYan Zheng if (!ret) 19285d4f98a2SYan Zheng continue; 19295d4f98a2SYan Zheng 1930dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1931dcdbc059SNikolay Borisov key.offset, end, 1); 19325d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1933d0082371SJeff Mahoney key.offset, end); 19345d4f98a2SYan Zheng } 19355d4f98a2SYan Zheng } 19365d4f98a2SYan Zheng 19375d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 19385d4f98a2SYan Zheng bytenr, num_bytes); 193983d4cfd4SJosef Bacik if (ret) { 194083d4cfd4SJosef Bacik /* 194183d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 194283d4cfd4SJosef Bacik * in the file extent yet. 194383d4cfd4SJosef Bacik */ 194483d4cfd4SJosef Bacik break; 19453fd0a558SYan, Zheng } 19465d4f98a2SYan Zheng 19475d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 19485d4f98a2SYan Zheng dirty = 1; 19495d4f98a2SYan Zheng 19505d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 195182fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 195282fa113fSQu Wenruo num_bytes, parent); 195382fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 195482fa113fSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1955b06c4bf5SFilipe Manana key.objectid, key.offset); 195682fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 195783d4cfd4SJosef Bacik if (ret) { 195866642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 195983d4cfd4SJosef Bacik break; 196083d4cfd4SJosef Bacik } 19615d4f98a2SYan Zheng 1962ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, bytenr, 1963ffd4bb2aSQu Wenruo num_bytes, parent); 1964ffd4bb2aSQu Wenruo ref.real_root = root->root_key.objectid; 1965ffd4bb2aSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1966b06c4bf5SFilipe Manana key.objectid, key.offset); 1967ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 196883d4cfd4SJosef Bacik if (ret) { 196966642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 197083d4cfd4SJosef Bacik break; 197183d4cfd4SJosef Bacik } 19725d4f98a2SYan Zheng } 19735d4f98a2SYan Zheng if (dirty) 19745d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 19753fd0a558SYan, Zheng if (inode) 19763fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 197783d4cfd4SJosef Bacik return ret; 19785d4f98a2SYan Zheng } 19795d4f98a2SYan Zheng 19805d4f98a2SYan Zheng static noinline_for_stack 19815d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 19825d4f98a2SYan Zheng struct btrfs_path *path, int level) 19835d4f98a2SYan Zheng { 19845d4f98a2SYan Zheng struct btrfs_disk_key key1; 19855d4f98a2SYan Zheng struct btrfs_disk_key key2; 19865d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 19875d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 19885d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 19895d4f98a2SYan Zheng } 19905d4f98a2SYan Zheng 19915d4f98a2SYan Zheng /* 19925d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 19935d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 19945d4f98a2SYan Zheng * reloc tree was create can be replaced. 19955d4f98a2SYan Zheng * 19965d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 19975d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 19985d4f98a2SYan Zheng * errors, a negative error number is returned. 19995d4f98a2SYan Zheng */ 20003fd0a558SYan, Zheng static noinline_for_stack 20013d0174f7SQu Wenruo int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, 20025d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 20035d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 20045d4f98a2SYan Zheng int lowest_level, int max_level) 20055d4f98a2SYan Zheng { 20060b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 20075d4f98a2SYan Zheng struct extent_buffer *eb; 20085d4f98a2SYan Zheng struct extent_buffer *parent; 200982fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 20105d4f98a2SYan Zheng struct btrfs_key key; 20115d4f98a2SYan Zheng u64 old_bytenr; 20125d4f98a2SYan Zheng u64 new_bytenr; 20135d4f98a2SYan Zheng u64 old_ptr_gen; 20145d4f98a2SYan Zheng u64 new_ptr_gen; 20155d4f98a2SYan Zheng u64 last_snapshot; 20165d4f98a2SYan Zheng u32 blocksize; 20173fd0a558SYan, Zheng int cow = 0; 20185d4f98a2SYan Zheng int level; 20195d4f98a2SYan Zheng int ret; 20205d4f98a2SYan Zheng int slot; 20215d4f98a2SYan Zheng 20225d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 20235d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 20245d4f98a2SYan Zheng 20255d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 20263fd0a558SYan, Zheng again: 20275d4f98a2SYan Zheng slot = path->slots[lowest_level]; 20285d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 20295d4f98a2SYan Zheng 20305d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 20318bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 20325d4f98a2SYan Zheng level = btrfs_header_level(eb); 20335d4f98a2SYan Zheng 20345d4f98a2SYan Zheng if (level < lowest_level) { 20355d4f98a2SYan Zheng btrfs_tree_unlock(eb); 20365d4f98a2SYan Zheng free_extent_buffer(eb); 20375d4f98a2SYan Zheng return 0; 20385d4f98a2SYan Zheng } 20395d4f98a2SYan Zheng 20403fd0a558SYan, Zheng if (cow) { 20415d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 20425d4f98a2SYan Zheng BUG_ON(ret); 20433fd0a558SYan, Zheng } 20448bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 20455d4f98a2SYan Zheng 20465d4f98a2SYan Zheng if (next_key) { 20475d4f98a2SYan Zheng next_key->objectid = (u64)-1; 20485d4f98a2SYan Zheng next_key->type = (u8)-1; 20495d4f98a2SYan Zheng next_key->offset = (u64)-1; 20505d4f98a2SYan Zheng } 20515d4f98a2SYan Zheng 20525d4f98a2SYan Zheng parent = eb; 20535d4f98a2SYan Zheng while (1) { 2054581c1760SQu Wenruo struct btrfs_key first_key; 2055581c1760SQu Wenruo 20565d4f98a2SYan Zheng level = btrfs_header_level(parent); 20575d4f98a2SYan Zheng BUG_ON(level < lowest_level); 20585d4f98a2SYan Zheng 20595d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 2060cbca7d59SFilipe Manana if (ret < 0) 2061cbca7d59SFilipe Manana break; 20625d4f98a2SYan Zheng if (ret && slot > 0) 20635d4f98a2SYan Zheng slot--; 20645d4f98a2SYan Zheng 20655d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 20665d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 20675d4f98a2SYan Zheng 20685d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 20690b246afaSJeff Mahoney blocksize = fs_info->nodesize; 20705d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 207117515f1bSQu Wenruo btrfs_node_key_to_cpu(parent, &first_key, slot); 20725d4f98a2SYan Zheng 20735d4f98a2SYan Zheng if (level <= max_level) { 20745d4f98a2SYan Zheng eb = path->nodes[level]; 20755d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 20765d4f98a2SYan Zheng path->slots[level]); 20775d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 20785d4f98a2SYan Zheng path->slots[level]); 20795d4f98a2SYan Zheng } else { 20805d4f98a2SYan Zheng new_bytenr = 0; 20815d4f98a2SYan Zheng new_ptr_gen = 0; 20825d4f98a2SYan Zheng } 20835d4f98a2SYan Zheng 2084fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 20855d4f98a2SYan Zheng ret = level; 20865d4f98a2SYan Zheng break; 20875d4f98a2SYan Zheng } 20885d4f98a2SYan Zheng 20895d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 20905d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 20913fd0a558SYan, Zheng if (level <= lowest_level) { 20925d4f98a2SYan Zheng ret = 0; 20935d4f98a2SYan Zheng break; 20945d4f98a2SYan Zheng } 20955d4f98a2SYan Zheng 2096581c1760SQu Wenruo eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen, 2097581c1760SQu Wenruo level - 1, &first_key); 209864c043deSLiu Bo if (IS_ERR(eb)) { 209964c043deSLiu Bo ret = PTR_ERR(eb); 2100264813acSLiu Bo break; 210164c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 210264c043deSLiu Bo ret = -EIO; 2103416bc658SJosef Bacik free_extent_buffer(eb); 2104379cde74SStefan Behrens break; 2105416bc658SJosef Bacik } 21065d4f98a2SYan Zheng btrfs_tree_lock(eb); 21073fd0a558SYan, Zheng if (cow) { 21085d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 21095d4f98a2SYan Zheng slot, &eb); 21105d4f98a2SYan Zheng BUG_ON(ret); 21115d4f98a2SYan Zheng } 21128bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 21135d4f98a2SYan Zheng 21145d4f98a2SYan Zheng btrfs_tree_unlock(parent); 21155d4f98a2SYan Zheng free_extent_buffer(parent); 21165d4f98a2SYan Zheng 21175d4f98a2SYan Zheng parent = eb; 21185d4f98a2SYan Zheng continue; 21195d4f98a2SYan Zheng } 21205d4f98a2SYan Zheng 21213fd0a558SYan, Zheng if (!cow) { 21223fd0a558SYan, Zheng btrfs_tree_unlock(parent); 21233fd0a558SYan, Zheng free_extent_buffer(parent); 21243fd0a558SYan, Zheng cow = 1; 21253fd0a558SYan, Zheng goto again; 21263fd0a558SYan, Zheng } 21273fd0a558SYan, Zheng 21285d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 21295d4f98a2SYan Zheng path->slots[level]); 2130b3b4aa74SDavid Sterba btrfs_release_path(path); 21315d4f98a2SYan Zheng 21325d4f98a2SYan Zheng path->lowest_level = level; 21335d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 21345d4f98a2SYan Zheng path->lowest_level = 0; 21355d4f98a2SYan Zheng BUG_ON(ret); 21365d4f98a2SYan Zheng 21375d4f98a2SYan Zheng /* 2138824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 2139824d8dffSQu Wenruo * 2140824d8dffSQu Wenruo * We must trace both trees. 2141824d8dffSQu Wenruo * 1) Tree reloc subtree 2142824d8dffSQu Wenruo * If not traced, we will leak data numbers 2143824d8dffSQu Wenruo * 2) Fs subtree 2144824d8dffSQu Wenruo * If not traced, we will double count old data 2145f616f5cdSQu Wenruo * 2146f616f5cdSQu Wenruo * We don't scan the subtree right now, but only record 2147f616f5cdSQu Wenruo * the swapped tree blocks. 2148f616f5cdSQu Wenruo * The real subtree rescan is delayed until we have new 2149f616f5cdSQu Wenruo * CoW on the subtree root node before transaction commit. 2150824d8dffSQu Wenruo */ 2151370a11b8SQu Wenruo ret = btrfs_qgroup_add_swapped_blocks(trans, dest, 2152370a11b8SQu Wenruo rc->block_group, parent, slot, 2153370a11b8SQu Wenruo path->nodes[level], path->slots[level], 2154370a11b8SQu Wenruo last_snapshot); 2155370a11b8SQu Wenruo if (ret < 0) 2156370a11b8SQu Wenruo break; 2157824d8dffSQu Wenruo /* 21585d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 21595d4f98a2SYan Zheng */ 21605d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 21615d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 21625d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 21635d4f98a2SYan Zheng 21645d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 21655d4f98a2SYan Zheng path->slots[level], old_bytenr); 21665d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 21675d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 21685d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 21695d4f98a2SYan Zheng 217082fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, old_bytenr, 217182fa113fSQu Wenruo blocksize, path->nodes[level]->start); 217282fa113fSQu Wenruo ref.skip_qgroup = true; 217382fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 217482fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 21755d4f98a2SYan Zheng BUG_ON(ret); 217682fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 217782fa113fSQu Wenruo blocksize, 0); 217882fa113fSQu Wenruo ref.skip_qgroup = true; 217982fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 218082fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 21815d4f98a2SYan Zheng BUG_ON(ret); 21825d4f98a2SYan Zheng 2183ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, new_bytenr, 2184ffd4bb2aSQu Wenruo blocksize, path->nodes[level]->start); 2185ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 2186ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2187ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 21885d4f98a2SYan Zheng BUG_ON(ret); 21895d4f98a2SYan Zheng 2190ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, old_bytenr, 2191ffd4bb2aSQu Wenruo blocksize, 0); 2192ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 2193ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2194ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 21955d4f98a2SYan Zheng BUG_ON(ret); 21965d4f98a2SYan Zheng 21975d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 21985d4f98a2SYan Zheng 21995d4f98a2SYan Zheng ret = level; 22005d4f98a2SYan Zheng break; 22015d4f98a2SYan Zheng } 22025d4f98a2SYan Zheng btrfs_tree_unlock(parent); 22035d4f98a2SYan Zheng free_extent_buffer(parent); 22045d4f98a2SYan Zheng return ret; 22055d4f98a2SYan Zheng } 22065d4f98a2SYan Zheng 22075d4f98a2SYan Zheng /* 22085d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 22095d4f98a2SYan Zheng */ 22105d4f98a2SYan Zheng static noinline_for_stack 22115d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 22125d4f98a2SYan Zheng int *level) 22135d4f98a2SYan Zheng { 22145d4f98a2SYan Zheng struct extent_buffer *eb; 22155d4f98a2SYan Zheng int i; 22165d4f98a2SYan Zheng u64 last_snapshot; 22175d4f98a2SYan Zheng u32 nritems; 22185d4f98a2SYan Zheng 22195d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 22205d4f98a2SYan Zheng 22215d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 22225d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 22235d4f98a2SYan Zheng path->nodes[i] = NULL; 22245d4f98a2SYan Zheng } 22255d4f98a2SYan Zheng 22265d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 22275d4f98a2SYan Zheng eb = path->nodes[i]; 22285d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 22295d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 22305d4f98a2SYan Zheng path->slots[i]++; 22315d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 22325d4f98a2SYan Zheng last_snapshot) 22335d4f98a2SYan Zheng continue; 22345d4f98a2SYan Zheng 22355d4f98a2SYan Zheng *level = i; 22365d4f98a2SYan Zheng return 0; 22375d4f98a2SYan Zheng } 22385d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 22395d4f98a2SYan Zheng path->nodes[i] = NULL; 22405d4f98a2SYan Zheng } 22415d4f98a2SYan Zheng return 1; 22425d4f98a2SYan Zheng } 22435d4f98a2SYan Zheng 22445d4f98a2SYan Zheng /* 22455d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 22465d4f98a2SYan Zheng */ 22475d4f98a2SYan Zheng static noinline_for_stack 22485d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 22495d4f98a2SYan Zheng int *level) 22505d4f98a2SYan Zheng { 22512ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 22525d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 22535d4f98a2SYan Zheng int i; 22545d4f98a2SYan Zheng u64 bytenr; 22555d4f98a2SYan Zheng u64 ptr_gen = 0; 22565d4f98a2SYan Zheng u64 last_snapshot; 22575d4f98a2SYan Zheng u32 nritems; 22585d4f98a2SYan Zheng 22595d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 22605d4f98a2SYan Zheng 22615d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 2262581c1760SQu Wenruo struct btrfs_key first_key; 2263581c1760SQu Wenruo 22645d4f98a2SYan Zheng eb = path->nodes[i]; 22655d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 22665d4f98a2SYan Zheng while (path->slots[i] < nritems) { 22675d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 22685d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 22695d4f98a2SYan Zheng break; 22705d4f98a2SYan Zheng path->slots[i]++; 22715d4f98a2SYan Zheng } 22725d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 22735d4f98a2SYan Zheng if (i == *level) 22745d4f98a2SYan Zheng break; 22755d4f98a2SYan Zheng *level = i + 1; 22765d4f98a2SYan Zheng return 0; 22775d4f98a2SYan Zheng } 22785d4f98a2SYan Zheng if (i == 1) { 22795d4f98a2SYan Zheng *level = i; 22805d4f98a2SYan Zheng return 0; 22815d4f98a2SYan Zheng } 22825d4f98a2SYan Zheng 22835d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2284581c1760SQu Wenruo btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); 2285581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1, 2286581c1760SQu Wenruo &first_key); 228764c043deSLiu Bo if (IS_ERR(eb)) { 228864c043deSLiu Bo return PTR_ERR(eb); 228964c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2290416bc658SJosef Bacik free_extent_buffer(eb); 2291416bc658SJosef Bacik return -EIO; 2292416bc658SJosef Bacik } 22935d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 22945d4f98a2SYan Zheng path->nodes[i - 1] = eb; 22955d4f98a2SYan Zheng path->slots[i - 1] = 0; 22965d4f98a2SYan Zheng } 22975d4f98a2SYan Zheng return 1; 22985d4f98a2SYan Zheng } 22995d4f98a2SYan Zheng 23005d4f98a2SYan Zheng /* 23015d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 23025d4f98a2SYan Zheng * [min_key, max_key) 23035d4f98a2SYan Zheng */ 23045d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 23055d4f98a2SYan Zheng struct btrfs_key *min_key, 23065d4f98a2SYan Zheng struct btrfs_key *max_key) 23075d4f98a2SYan Zheng { 23080b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 23095d4f98a2SYan Zheng struct inode *inode = NULL; 23105d4f98a2SYan Zheng u64 objectid; 23115d4f98a2SYan Zheng u64 start, end; 231233345d01SLi Zefan u64 ino; 23135d4f98a2SYan Zheng 23145d4f98a2SYan Zheng objectid = min_key->objectid; 23155d4f98a2SYan Zheng while (1) { 23165d4f98a2SYan Zheng cond_resched(); 23175d4f98a2SYan Zheng iput(inode); 23185d4f98a2SYan Zheng 23195d4f98a2SYan Zheng if (objectid > max_key->objectid) 23205d4f98a2SYan Zheng break; 23215d4f98a2SYan Zheng 23225d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 23235d4f98a2SYan Zheng if (!inode) 23245d4f98a2SYan Zheng break; 23254a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 23265d4f98a2SYan Zheng 232733345d01SLi Zefan if (ino > max_key->objectid) { 23285d4f98a2SYan Zheng iput(inode); 23295d4f98a2SYan Zheng break; 23305d4f98a2SYan Zheng } 23315d4f98a2SYan Zheng 233233345d01SLi Zefan objectid = ino + 1; 23335d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 23345d4f98a2SYan Zheng continue; 23355d4f98a2SYan Zheng 233633345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 23375d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 23385d4f98a2SYan Zheng continue; 23395d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 23405d4f98a2SYan Zheng start = 0; 23415d4f98a2SYan Zheng else { 23425d4f98a2SYan Zheng start = min_key->offset; 23430b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 23445d4f98a2SYan Zheng } 23455d4f98a2SYan Zheng } else { 23465d4f98a2SYan Zheng start = 0; 23475d4f98a2SYan Zheng } 23485d4f98a2SYan Zheng 234933345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 23505d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 23515d4f98a2SYan Zheng continue; 23525d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 23535d4f98a2SYan Zheng end = (u64)-1; 23545d4f98a2SYan Zheng } else { 23555d4f98a2SYan Zheng if (max_key->offset == 0) 23565d4f98a2SYan Zheng continue; 23575d4f98a2SYan Zheng end = max_key->offset; 23580b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 23595d4f98a2SYan Zheng end--; 23605d4f98a2SYan Zheng } 23615d4f98a2SYan Zheng } else { 23625d4f98a2SYan Zheng end = (u64)-1; 23635d4f98a2SYan Zheng } 23645d4f98a2SYan Zheng 23655d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2366d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 2367dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 2368d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 23695d4f98a2SYan Zheng } 23705d4f98a2SYan Zheng return 0; 23715d4f98a2SYan Zheng } 23725d4f98a2SYan Zheng 23735d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 23745d4f98a2SYan Zheng struct btrfs_key *key) 23755d4f98a2SYan Zheng 23765d4f98a2SYan Zheng { 23775d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 23785d4f98a2SYan Zheng if (!path->nodes[level]) 23795d4f98a2SYan Zheng break; 23805d4f98a2SYan Zheng if (path->slots[level] + 1 < 23815d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 23825d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 23835d4f98a2SYan Zheng path->slots[level] + 1); 23845d4f98a2SYan Zheng return 0; 23855d4f98a2SYan Zheng } 23865d4f98a2SYan Zheng level++; 23875d4f98a2SYan Zheng } 23885d4f98a2SYan Zheng return 1; 23895d4f98a2SYan Zheng } 23905d4f98a2SYan Zheng 23915d4f98a2SYan Zheng /* 2392d2311e69SQu Wenruo * Insert current subvolume into reloc_control::dirty_subvol_roots 2393d2311e69SQu Wenruo */ 2394d2311e69SQu Wenruo static void insert_dirty_subvol(struct btrfs_trans_handle *trans, 2395d2311e69SQu Wenruo struct reloc_control *rc, 2396d2311e69SQu Wenruo struct btrfs_root *root) 2397d2311e69SQu Wenruo { 2398d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2399d2311e69SQu Wenruo struct btrfs_root_item *reloc_root_item; 2400d2311e69SQu Wenruo 2401d2311e69SQu Wenruo /* @root must be a subvolume tree root with a valid reloc tree */ 2402d2311e69SQu Wenruo ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 2403d2311e69SQu Wenruo ASSERT(reloc_root); 2404d2311e69SQu Wenruo 2405d2311e69SQu Wenruo reloc_root_item = &reloc_root->root_item; 2406d2311e69SQu Wenruo memset(&reloc_root_item->drop_progress, 0, 2407d2311e69SQu Wenruo sizeof(reloc_root_item->drop_progress)); 2408d2311e69SQu Wenruo reloc_root_item->drop_level = 0; 2409d2311e69SQu Wenruo btrfs_set_root_refs(reloc_root_item, 0); 2410d2311e69SQu Wenruo btrfs_update_reloc_root(trans, root); 2411d2311e69SQu Wenruo 2412d2311e69SQu Wenruo if (list_empty(&root->reloc_dirty_list)) { 241300246528SJosef Bacik btrfs_grab_root(root); 2414d2311e69SQu Wenruo list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); 2415d2311e69SQu Wenruo } 2416d2311e69SQu Wenruo } 2417d2311e69SQu Wenruo 2418d2311e69SQu Wenruo static int clean_dirty_subvols(struct reloc_control *rc) 2419d2311e69SQu Wenruo { 2420d2311e69SQu Wenruo struct btrfs_root *root; 2421d2311e69SQu Wenruo struct btrfs_root *next; 2422d2311e69SQu Wenruo int ret = 0; 242330d40577SQu Wenruo int ret2; 2424d2311e69SQu Wenruo 2425d2311e69SQu Wenruo list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, 2426d2311e69SQu Wenruo reloc_dirty_list) { 242730d40577SQu Wenruo if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 242830d40577SQu Wenruo /* Merged subvolume, cleanup its reloc root */ 2429d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2430d2311e69SQu Wenruo 2431d2311e69SQu Wenruo list_del_init(&root->reloc_dirty_list); 2432d2311e69SQu Wenruo root->reloc_root = NULL; 24336282675eSQu Wenruo /* 24346282675eSQu Wenruo * Need barrier to ensure clear_bit() only happens after 24356282675eSQu Wenruo * root->reloc_root = NULL. Pairs with have_reloc_root. 24366282675eSQu Wenruo */ 24376282675eSQu Wenruo smp_wmb(); 24381fac4a54SQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 2439f28de8d8SJosef Bacik if (reloc_root) { 2440f44deb74SJosef Bacik /* 2441f44deb74SJosef Bacik * btrfs_drop_snapshot drops our ref we hold for 2442f44deb74SJosef Bacik * ->reloc_root. If it fails however we must 2443f44deb74SJosef Bacik * drop the ref ourselves. 2444f44deb74SJosef Bacik */ 2445f28de8d8SJosef Bacik ret2 = btrfs_drop_snapshot(reloc_root, 0, 1); 2446f44deb74SJosef Bacik if (ret2 < 0) { 2447f44deb74SJosef Bacik btrfs_put_root(reloc_root); 2448f44deb74SJosef Bacik if (!ret) 2449f28de8d8SJosef Bacik ret = ret2; 2450f28de8d8SJosef Bacik } 2451f44deb74SJosef Bacik } 245200246528SJosef Bacik btrfs_put_root(root); 245330d40577SQu Wenruo } else { 245430d40577SQu Wenruo /* Orphan reloc tree, just clean it up */ 24550078a9f9SNikolay Borisov ret2 = btrfs_drop_snapshot(root, 0, 1); 2456f44deb74SJosef Bacik if (ret2 < 0) { 2457f44deb74SJosef Bacik btrfs_put_root(root); 2458f44deb74SJosef Bacik if (!ret) 245930d40577SQu Wenruo ret = ret2; 246030d40577SQu Wenruo } 2461d2311e69SQu Wenruo } 2462f44deb74SJosef Bacik } 2463d2311e69SQu Wenruo return ret; 2464d2311e69SQu Wenruo } 2465d2311e69SQu Wenruo 2466d2311e69SQu Wenruo /* 24675d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 24685d4f98a2SYan Zheng * fs tree. 24695d4f98a2SYan Zheng */ 24705d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 24715d4f98a2SYan Zheng struct btrfs_root *root) 24725d4f98a2SYan Zheng { 24730b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 24745d4f98a2SYan Zheng struct btrfs_key key; 24755d4f98a2SYan Zheng struct btrfs_key next_key; 24769e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 24775d4f98a2SYan Zheng struct btrfs_root *reloc_root; 24785d4f98a2SYan Zheng struct btrfs_root_item *root_item; 24795d4f98a2SYan Zheng struct btrfs_path *path; 24803fd0a558SYan, Zheng struct extent_buffer *leaf; 24815d4f98a2SYan Zheng int level; 24825d4f98a2SYan Zheng int max_level; 24835d4f98a2SYan Zheng int replaced = 0; 24845d4f98a2SYan Zheng int ret; 24855d4f98a2SYan Zheng int err = 0; 24863fd0a558SYan, Zheng u32 min_reserved; 24875d4f98a2SYan Zheng 24885d4f98a2SYan Zheng path = btrfs_alloc_path(); 24895d4f98a2SYan Zheng if (!path) 24905d4f98a2SYan Zheng return -ENOMEM; 2491e4058b54SDavid Sterba path->reada = READA_FORWARD; 24925d4f98a2SYan Zheng 24935d4f98a2SYan Zheng reloc_root = root->reloc_root; 24945d4f98a2SYan Zheng root_item = &reloc_root->root_item; 24955d4f98a2SYan Zheng 24965d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 24975d4f98a2SYan Zheng level = btrfs_root_level(root_item); 249867439dadSDavid Sterba atomic_inc(&reloc_root->node->refs); 24995d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 25005d4f98a2SYan Zheng path->slots[level] = 0; 25015d4f98a2SYan Zheng } else { 25025d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 25035d4f98a2SYan Zheng 25045d4f98a2SYan Zheng level = root_item->drop_level; 25055d4f98a2SYan Zheng BUG_ON(level == 0); 25065d4f98a2SYan Zheng path->lowest_level = level; 25075d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 250833c66f43SYan Zheng path->lowest_level = 0; 25095d4f98a2SYan Zheng if (ret < 0) { 25105d4f98a2SYan Zheng btrfs_free_path(path); 25115d4f98a2SYan Zheng return ret; 25125d4f98a2SYan Zheng } 25135d4f98a2SYan Zheng 25145d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 25155d4f98a2SYan Zheng path->slots[level]); 25165d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 25175d4f98a2SYan Zheng 25185d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 25195d4f98a2SYan Zheng } 25205d4f98a2SYan Zheng 25210b246afaSJeff Mahoney min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 25225d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 25235d4f98a2SYan Zheng 25245d4f98a2SYan Zheng while (1) { 252508e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 252608e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 25273fd0a558SYan, Zheng if (ret) { 25289e6a0c52SJosef Bacik err = ret; 25299e6a0c52SJosef Bacik goto out; 25303fd0a558SYan, Zheng } 25319e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 25329e6a0c52SJosef Bacik if (IS_ERR(trans)) { 25339e6a0c52SJosef Bacik err = PTR_ERR(trans); 25349e6a0c52SJosef Bacik trans = NULL; 25359e6a0c52SJosef Bacik goto out; 25369e6a0c52SJosef Bacik } 25372abc726aSJosef Bacik 25382abc726aSJosef Bacik /* 25392abc726aSJosef Bacik * At this point we no longer have a reloc_control, so we can't 25402abc726aSJosef Bacik * depend on btrfs_init_reloc_root to update our last_trans. 25412abc726aSJosef Bacik * 25422abc726aSJosef Bacik * But that's ok, we started the trans handle on our 25432abc726aSJosef Bacik * corresponding fs_root, which means it's been added to the 25442abc726aSJosef Bacik * dirty list. At commit time we'll still call 25452abc726aSJosef Bacik * btrfs_update_reloc_root() and update our root item 25462abc726aSJosef Bacik * appropriately. 25472abc726aSJosef Bacik */ 25482abc726aSJosef Bacik reloc_root->last_trans = trans->transid; 25499e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 25503fd0a558SYan, Zheng 25513fd0a558SYan, Zheng replaced = 0; 25525d4f98a2SYan Zheng max_level = level; 25535d4f98a2SYan Zheng 25545d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 25555d4f98a2SYan Zheng if (ret < 0) { 25565d4f98a2SYan Zheng err = ret; 25575d4f98a2SYan Zheng goto out; 25585d4f98a2SYan Zheng } 25595d4f98a2SYan Zheng if (ret > 0) 25605d4f98a2SYan Zheng break; 25615d4f98a2SYan Zheng 25625d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 25635d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 25645d4f98a2SYan Zheng ret = 0; 25655d4f98a2SYan Zheng } else { 25663d0174f7SQu Wenruo ret = replace_path(trans, rc, root, reloc_root, path, 25673fd0a558SYan, Zheng &next_key, level, max_level); 25685d4f98a2SYan Zheng } 25695d4f98a2SYan Zheng if (ret < 0) { 25705d4f98a2SYan Zheng err = ret; 25715d4f98a2SYan Zheng goto out; 25725d4f98a2SYan Zheng } 25735d4f98a2SYan Zheng 25745d4f98a2SYan Zheng if (ret > 0) { 25755d4f98a2SYan Zheng level = ret; 25765d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 25775d4f98a2SYan Zheng path->slots[level]); 25785d4f98a2SYan Zheng replaced = 1; 25795d4f98a2SYan Zheng } 25805d4f98a2SYan Zheng 25815d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 25825d4f98a2SYan Zheng if (ret > 0) 25835d4f98a2SYan Zheng break; 25845d4f98a2SYan Zheng 25855d4f98a2SYan Zheng BUG_ON(level == 0); 25865d4f98a2SYan Zheng /* 25875d4f98a2SYan Zheng * save the merging progress in the drop_progress. 25885d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 25895d4f98a2SYan Zheng */ 25905d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 25915d4f98a2SYan Zheng path->slots[level]); 25925d4f98a2SYan Zheng root_item->drop_level = level; 25935d4f98a2SYan Zheng 25943a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 25959e6a0c52SJosef Bacik trans = NULL; 25965d4f98a2SYan Zheng 25972ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 25985d4f98a2SYan Zheng 25995d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 26005d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 26015d4f98a2SYan Zheng } 26025d4f98a2SYan Zheng 26035d4f98a2SYan Zheng /* 26045d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 26055d4f98a2SYan Zheng * relocated and the block is tree root. 26065d4f98a2SYan Zheng */ 26075d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 26085d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 26095d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 26105d4f98a2SYan Zheng free_extent_buffer(leaf); 26115d4f98a2SYan Zheng if (ret < 0) 26125d4f98a2SYan Zheng err = ret; 26135d4f98a2SYan Zheng out: 26145d4f98a2SYan Zheng btrfs_free_path(path); 26155d4f98a2SYan Zheng 2616d2311e69SQu Wenruo if (err == 0) 2617d2311e69SQu Wenruo insert_dirty_subvol(trans, rc, root); 26185d4f98a2SYan Zheng 26199e6a0c52SJosef Bacik if (trans) 26203a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 26215d4f98a2SYan Zheng 26222ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 26235d4f98a2SYan Zheng 26245d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 26255d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 26265d4f98a2SYan Zheng 26275d4f98a2SYan Zheng return err; 26285d4f98a2SYan Zheng } 26295d4f98a2SYan Zheng 26303fd0a558SYan, Zheng static noinline_for_stack 26313fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 26325d4f98a2SYan Zheng { 26333fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 26340b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 26353fd0a558SYan, Zheng struct btrfs_root *reloc_root; 26365d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 26373fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 26383fd0a558SYan, Zheng u64 num_bytes = 0; 26393fd0a558SYan, Zheng int ret; 26403fd0a558SYan, Zheng 26410b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 26420b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 26433fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 26440b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 26457585717fSChris Mason 26463fd0a558SYan, Zheng again: 26473fd0a558SYan, Zheng if (!err) { 26483fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 264908e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 265008e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 26513fd0a558SYan, Zheng if (ret) 26523fd0a558SYan, Zheng err = ret; 26533fd0a558SYan, Zheng } 26543fd0a558SYan, Zheng 26557a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 26563612b495STsutomu Itoh if (IS_ERR(trans)) { 26573612b495STsutomu Itoh if (!err) 26582ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 265963f018beSNikolay Borisov num_bytes, NULL); 26603612b495STsutomu Itoh return PTR_ERR(trans); 26613612b495STsutomu Itoh } 26623fd0a558SYan, Zheng 26633fd0a558SYan, Zheng if (!err) { 26643fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 26653a45bb20SJeff Mahoney btrfs_end_transaction(trans); 26662ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 266763f018beSNikolay Borisov num_bytes, NULL); 26683fd0a558SYan, Zheng goto again; 26693fd0a558SYan, Zheng } 26703fd0a558SYan, Zheng } 26713fd0a558SYan, Zheng 26723fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 26733fd0a558SYan, Zheng 26743fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 26753fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 26763fd0a558SYan, Zheng struct btrfs_root, root_list); 26773fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 26783fd0a558SYan, Zheng 26790b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 26803fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 26813fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 26823fd0a558SYan, Zheng 26833fd0a558SYan, Zheng /* 26843fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 26853fd0a558SYan, Zheng * knows it should resumes merging 26863fd0a558SYan, Zheng */ 26873fd0a558SYan, Zheng if (!err) 26883fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 26893fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 26903fd0a558SYan, Zheng 26913fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 269200246528SJosef Bacik btrfs_put_root(root); 26933fd0a558SYan, Zheng } 26943fd0a558SYan, Zheng 26953fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 26963fd0a558SYan, Zheng 26973fd0a558SYan, Zheng if (!err) 26983a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 26993fd0a558SYan, Zheng else 27003a45bb20SJeff Mahoney btrfs_end_transaction(trans); 27013fd0a558SYan, Zheng return err; 27023fd0a558SYan, Zheng } 27033fd0a558SYan, Zheng 27043fd0a558SYan, Zheng static noinline_for_stack 2705aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2706aca1bba6SLiu Bo { 2707aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2708aca1bba6SLiu Bo 2709aca1bba6SLiu Bo while (!list_empty(list)) { 2710aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2711aca1bba6SLiu Bo root_list); 2712bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 2713aca1bba6SLiu Bo } 2714aca1bba6SLiu Bo } 2715aca1bba6SLiu Bo 2716aca1bba6SLiu Bo static noinline_for_stack 271794404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 27183fd0a558SYan, Zheng { 27190b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 27205d4f98a2SYan Zheng struct btrfs_root *root; 27215d4f98a2SYan Zheng struct btrfs_root *reloc_root; 27223fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 27233fd0a558SYan, Zheng int found = 0; 2724aca1bba6SLiu Bo int ret = 0; 27253fd0a558SYan, Zheng again: 27263fd0a558SYan, Zheng root = rc->extent_root; 27277585717fSChris Mason 27287585717fSChris Mason /* 27297585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 27307585717fSChris Mason * we have to make sure nobody is in the middle of 27317585717fSChris Mason * adding their roots to the list while we are 27327585717fSChris Mason * doing this splice 27337585717fSChris Mason */ 27340b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 27353fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 27360b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 27375d4f98a2SYan Zheng 27383fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 27393fd0a558SYan, Zheng found = 1; 27403fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 27413fd0a558SYan, Zheng struct btrfs_root, root_list); 27425d4f98a2SYan Zheng 27435d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 27440b246afaSJeff Mahoney root = read_fs_root(fs_info, 27455d4f98a2SYan Zheng reloc_root->root_key.offset); 27465d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 27475d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 27485d4f98a2SYan Zheng 27493fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 275000246528SJosef Bacik btrfs_put_root(root); 2751b37b39cdSJosef Bacik if (ret) { 275225e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 275325e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 275425e293c2SWang Shilong &reloc_roots); 2755aca1bba6SLiu Bo goto out; 2756b37b39cdSJosef Bacik } 27573fd0a558SYan, Zheng } else { 27583fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 275930d40577SQu Wenruo /* Don't forget to queue this reloc root for cleanup */ 276030d40577SQu Wenruo list_add_tail(&reloc_root->reloc_dirty_list, 276130d40577SQu Wenruo &rc->dirty_subvol_roots); 27623fd0a558SYan, Zheng } 27635d4f98a2SYan Zheng } 27645d4f98a2SYan Zheng 27653fd0a558SYan, Zheng if (found) { 27663fd0a558SYan, Zheng found = 0; 27673fd0a558SYan, Zheng goto again; 27685d4f98a2SYan Zheng } 2769aca1bba6SLiu Bo out: 2770aca1bba6SLiu Bo if (ret) { 27710b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2772aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2773aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2774467bb1d2SWang Shilong 2775467bb1d2SWang Shilong /* new reloc root may be added */ 27760b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2777467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 27780b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2779467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2780467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2781aca1bba6SLiu Bo } 2782aca1bba6SLiu Bo 27837b7b7431SJosef Bacik /* 27847b7b7431SJosef Bacik * We used to have 27857b7b7431SJosef Bacik * 27867b7b7431SJosef Bacik * BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 27877b7b7431SJosef Bacik * 27887b7b7431SJosef Bacik * here, but it's wrong. If we fail to start the transaction in 27897b7b7431SJosef Bacik * prepare_to_merge() we will have only 0 ref reloc roots, none of which 27907b7b7431SJosef Bacik * have actually been removed from the reloc_root_tree rb tree. This is 27917b7b7431SJosef Bacik * fine because we're bailing here, and we hold a reference on the root 27927b7b7431SJosef Bacik * for the list that holds it, so these roots will be cleaned up when we 27937b7b7431SJosef Bacik * do the reloc_dirty_list afterwards. Meanwhile the root->reloc_root 27947b7b7431SJosef Bacik * will be cleaned up on unmount. 27957b7b7431SJosef Bacik * 27967b7b7431SJosef Bacik * The remaining nodes will be cleaned up by free_reloc_control. 27977b7b7431SJosef Bacik */ 27985d4f98a2SYan Zheng } 27995d4f98a2SYan Zheng 28005d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 28015d4f98a2SYan Zheng { 28025d4f98a2SYan Zheng struct tree_block *block; 28035d4f98a2SYan Zheng struct rb_node *rb_node; 28045d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 28055d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 28065d4f98a2SYan Zheng rb_erase(rb_node, blocks); 28075d4f98a2SYan Zheng kfree(block); 28085d4f98a2SYan Zheng } 28095d4f98a2SYan Zheng } 28105d4f98a2SYan Zheng 28115d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 28125d4f98a2SYan Zheng struct btrfs_root *reloc_root) 28135d4f98a2SYan Zheng { 28140b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 28155d4f98a2SYan Zheng struct btrfs_root *root; 2816442b1ac5SJosef Bacik int ret; 28175d4f98a2SYan Zheng 28185d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 28195d4f98a2SYan Zheng return 0; 28205d4f98a2SYan Zheng 28210b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 28225d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 28235d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 2824442b1ac5SJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 282500246528SJosef Bacik btrfs_put_root(root); 28265d4f98a2SYan Zheng 2827442b1ac5SJosef Bacik return ret; 28285d4f98a2SYan Zheng } 28295d4f98a2SYan Zheng 28303fd0a558SYan, Zheng static noinline_for_stack 28313fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 28323fd0a558SYan, Zheng struct reloc_control *rc, 28335d4f98a2SYan Zheng struct backref_node *node, 2834dc4103f9SWang Shilong struct backref_edge *edges[]) 28355d4f98a2SYan Zheng { 28365d4f98a2SYan Zheng struct backref_node *next; 28375d4f98a2SYan Zheng struct btrfs_root *root; 28383fd0a558SYan, Zheng int index = 0; 28393fd0a558SYan, Zheng 28405d4f98a2SYan Zheng next = node; 28415d4f98a2SYan Zheng while (1) { 28425d4f98a2SYan Zheng cond_resched(); 28435d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 28445d4f98a2SYan Zheng root = next->root; 28453fd0a558SYan, Zheng BUG_ON(!root); 284627cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 28475d4f98a2SYan Zheng 28485d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 28495d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 28505d4f98a2SYan Zheng break; 28515d4f98a2SYan Zheng } 28525d4f98a2SYan Zheng 28535d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 28543fd0a558SYan, Zheng root = root->reloc_root; 28553fd0a558SYan, Zheng 28563fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 28573fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 28583fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 28593fd0a558SYan, Zheng next->new_bytenr = root->node->start; 286000246528SJosef Bacik btrfs_put_root(next->root); 286100246528SJosef Bacik next->root = btrfs_grab_root(root); 28620b530bc5SJosef Bacik ASSERT(next->root); 28633fd0a558SYan, Zheng list_add_tail(&next->list, 28643fd0a558SYan, Zheng &rc->backref_cache.changed); 28659569cc20SQu Wenruo mark_block_processed(rc, next); 28665d4f98a2SYan Zheng break; 28675d4f98a2SYan Zheng } 28685d4f98a2SYan Zheng 28693fd0a558SYan, Zheng WARN_ON(1); 28705d4f98a2SYan Zheng root = NULL; 28715d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 28725d4f98a2SYan Zheng if (!next || next->level <= node->level) 28735d4f98a2SYan Zheng break; 28745d4f98a2SYan Zheng } 28753fd0a558SYan, Zheng if (!root) 28763fd0a558SYan, Zheng return NULL; 28775d4f98a2SYan Zheng 28783fd0a558SYan, Zheng next = node; 28793fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 28803fd0a558SYan, Zheng while (1) { 28813fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 28823fd0a558SYan, Zheng if (--index < 0) 28833fd0a558SYan, Zheng break; 28843fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 28853fd0a558SYan, Zheng } 28865d4f98a2SYan Zheng return root; 28875d4f98a2SYan Zheng } 28885d4f98a2SYan Zheng 28893fd0a558SYan, Zheng /* 28903fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 28913fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 28923fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 28933fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 28943fd0a558SYan, Zheng */ 28955d4f98a2SYan Zheng static noinline_for_stack 2896147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 28975d4f98a2SYan Zheng { 28983fd0a558SYan, Zheng struct backref_node *next; 28993fd0a558SYan, Zheng struct btrfs_root *root; 29003fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 29015d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 29023fd0a558SYan, Zheng int index = 0; 29033fd0a558SYan, Zheng 29043fd0a558SYan, Zheng next = node; 29053fd0a558SYan, Zheng while (1) { 29063fd0a558SYan, Zheng cond_resched(); 29073fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 29083fd0a558SYan, Zheng root = next->root; 29093fd0a558SYan, Zheng BUG_ON(!root); 29103fd0a558SYan, Zheng 291125985edcSLucas De Marchi /* no other choice for non-references counted tree */ 291227cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 29133fd0a558SYan, Zheng return root; 29143fd0a558SYan, Zheng 29153fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 29163fd0a558SYan, Zheng fs_root = root; 29173fd0a558SYan, Zheng 29183fd0a558SYan, Zheng if (next != node) 29193fd0a558SYan, Zheng return NULL; 29203fd0a558SYan, Zheng 29213fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 29223fd0a558SYan, Zheng if (!next || next->level <= node->level) 29233fd0a558SYan, Zheng break; 29243fd0a558SYan, Zheng } 29253fd0a558SYan, Zheng 29263fd0a558SYan, Zheng if (!fs_root) 29273fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 29283fd0a558SYan, Zheng return fs_root; 29295d4f98a2SYan Zheng } 29305d4f98a2SYan Zheng 29315d4f98a2SYan Zheng static noinline_for_stack 29323fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 29333fd0a558SYan, Zheng struct backref_node *node, int reserve) 29345d4f98a2SYan Zheng { 29350b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 29363fd0a558SYan, Zheng struct backref_node *next = node; 29373fd0a558SYan, Zheng struct backref_edge *edge; 29383fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 29393fd0a558SYan, Zheng u64 num_bytes = 0; 29403fd0a558SYan, Zheng int index = 0; 29415d4f98a2SYan Zheng 29423fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 29433fd0a558SYan, Zheng 29443fd0a558SYan, Zheng while (next) { 29453fd0a558SYan, Zheng cond_resched(); 29465d4f98a2SYan Zheng while (1) { 29473fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 29485d4f98a2SYan Zheng break; 29495d4f98a2SYan Zheng 29500b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 29513fd0a558SYan, Zheng 29523fd0a558SYan, Zheng if (list_empty(&next->upper)) 29533fd0a558SYan, Zheng break; 29543fd0a558SYan, Zheng 29553fd0a558SYan, Zheng edge = list_entry(next->upper.next, 29563fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 29573fd0a558SYan, Zheng edges[index++] = edge; 29583fd0a558SYan, Zheng next = edge->node[UPPER]; 29595d4f98a2SYan Zheng } 29603fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 29613fd0a558SYan, Zheng } 29623fd0a558SYan, Zheng return num_bytes; 29633fd0a558SYan, Zheng } 29643fd0a558SYan, Zheng 29653fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 29663fd0a558SYan, Zheng struct reloc_control *rc, 29673fd0a558SYan, Zheng struct backref_node *node) 29683fd0a558SYan, Zheng { 29693fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2970da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 29713fd0a558SYan, Zheng u64 num_bytes; 29723fd0a558SYan, Zheng int ret; 29730647bf56SWang Shilong u64 tmp; 29743fd0a558SYan, Zheng 29753fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 29763fd0a558SYan, Zheng 29773fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 29780647bf56SWang Shilong rc->reserved_bytes += num_bytes; 29798ca17f0fSJosef Bacik 29808ca17f0fSJosef Bacik /* 29818ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 29828ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 29838ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 29848ca17f0fSJosef Bacik */ 29850647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 29868ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 29873fd0a558SYan, Zheng if (ret) { 2988da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 29890647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 29900647bf56SWang Shilong tmp <<= 1; 29910647bf56SWang Shilong /* 29920647bf56SWang Shilong * only one thread can access block_rsv at this point, 29930647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 29940647bf56SWang Shilong * we expand more reservation size here to allow enough 299552042d8eSAndrea Gelmini * space for relocation and we will return earlier in 29960647bf56SWang Shilong * enospc case. 29970647bf56SWang Shilong */ 2998da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 29990647bf56SWang Shilong RELOCATION_RESERVED_NODES; 30008ca17f0fSJosef Bacik return -EAGAIN; 30013fd0a558SYan, Zheng } 30023fd0a558SYan, Zheng 30033fd0a558SYan, Zheng return 0; 30043fd0a558SYan, Zheng } 30053fd0a558SYan, Zheng 30065d4f98a2SYan Zheng /* 30075d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 30085d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 30095d4f98a2SYan Zheng * 30105d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 30115d4f98a2SYan Zheng * in that case this function just updates pointers. 30125d4f98a2SYan Zheng */ 30135d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 30143fd0a558SYan, Zheng struct reloc_control *rc, 30155d4f98a2SYan Zheng struct backref_node *node, 30165d4f98a2SYan Zheng struct btrfs_key *key, 30175d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 30185d4f98a2SYan Zheng { 30192ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 30205d4f98a2SYan Zheng struct backref_node *upper; 30215d4f98a2SYan Zheng struct backref_edge *edge; 30225d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 30235d4f98a2SYan Zheng struct btrfs_root *root; 30245d4f98a2SYan Zheng struct extent_buffer *eb; 30255d4f98a2SYan Zheng u32 blocksize; 30265d4f98a2SYan Zheng u64 bytenr; 30275d4f98a2SYan Zheng u64 generation; 30285d4f98a2SYan Zheng int slot; 30295d4f98a2SYan Zheng int ret; 30305d4f98a2SYan Zheng int err = 0; 30315d4f98a2SYan Zheng 30325d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 30335d4f98a2SYan Zheng 30345d4f98a2SYan Zheng path->lowest_level = node->level + 1; 30353fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 30365d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 3037581c1760SQu Wenruo struct btrfs_key first_key; 303882fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 3039581c1760SQu Wenruo 30405d4f98a2SYan Zheng cond_resched(); 30415d4f98a2SYan Zheng 30425d4f98a2SYan Zheng upper = edge->node[UPPER]; 3043dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 30443fd0a558SYan, Zheng BUG_ON(!root); 30455d4f98a2SYan Zheng 30463fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 30473fd0a558SYan, Zheng if (!lowest) { 30483fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 30493fd0a558SYan, Zheng upper->level, &slot); 3050cbca7d59SFilipe Manana if (ret < 0) { 3051cbca7d59SFilipe Manana err = ret; 3052cbca7d59SFilipe Manana goto next; 3053cbca7d59SFilipe Manana } 30543fd0a558SYan, Zheng BUG_ON(ret); 30553fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 30563fd0a558SYan, Zheng if (node->eb->start == bytenr) 30573fd0a558SYan, Zheng goto next; 30583fd0a558SYan, Zheng } 30595d4f98a2SYan Zheng drop_node_buffer(upper); 30603fd0a558SYan, Zheng } 30615d4f98a2SYan Zheng 30625d4f98a2SYan Zheng if (!upper->eb) { 30635d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 30643561b9dbSLiu Bo if (ret) { 30653561b9dbSLiu Bo if (ret < 0) 30665d4f98a2SYan Zheng err = ret; 30673561b9dbSLiu Bo else 30683561b9dbSLiu Bo err = -ENOENT; 30693561b9dbSLiu Bo 30703561b9dbSLiu Bo btrfs_release_path(path); 30715d4f98a2SYan Zheng break; 30725d4f98a2SYan Zheng } 30735d4f98a2SYan Zheng 30743fd0a558SYan, Zheng if (!upper->eb) { 30753fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 30763fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 30773fd0a558SYan, Zheng } else { 30783fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 30793fd0a558SYan, Zheng } 30803fd0a558SYan, Zheng 30813fd0a558SYan, Zheng upper->locked = 1; 30823fd0a558SYan, Zheng path->locks[upper->level] = 0; 30833fd0a558SYan, Zheng 30845d4f98a2SYan Zheng slot = path->slots[upper->level]; 3085b3b4aa74SDavid Sterba btrfs_release_path(path); 30865d4f98a2SYan Zheng } else { 30875d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 30885d4f98a2SYan Zheng &slot); 3089cbca7d59SFilipe Manana if (ret < 0) { 3090cbca7d59SFilipe Manana err = ret; 3091cbca7d59SFilipe Manana goto next; 3092cbca7d59SFilipe Manana } 30935d4f98a2SYan Zheng BUG_ON(ret); 30945d4f98a2SYan Zheng } 30955d4f98a2SYan Zheng 30965d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 30973fd0a558SYan, Zheng if (lowest) { 30984547f4d8SLiu Bo if (bytenr != node->bytenr) { 30994547f4d8SLiu Bo btrfs_err(root->fs_info, 31004547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 31014547f4d8SLiu Bo bytenr, node->bytenr, slot, 31024547f4d8SLiu Bo upper->eb->start); 31034547f4d8SLiu Bo err = -EIO; 31044547f4d8SLiu Bo goto next; 31054547f4d8SLiu Bo } 31065d4f98a2SYan Zheng } else { 31073fd0a558SYan, Zheng if (node->eb->start == bytenr) 31083fd0a558SYan, Zheng goto next; 31095d4f98a2SYan Zheng } 31105d4f98a2SYan Zheng 3111da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 31125d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 3113581c1760SQu Wenruo btrfs_node_key_to_cpu(upper->eb, &first_key, slot); 3114581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, generation, 3115581c1760SQu Wenruo upper->level - 1, &first_key); 311664c043deSLiu Bo if (IS_ERR(eb)) { 311764c043deSLiu Bo err = PTR_ERR(eb); 311864c043deSLiu Bo goto next; 311964c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 3120416bc658SJosef Bacik free_extent_buffer(eb); 312197d9a8a4STsutomu Itoh err = -EIO; 312297d9a8a4STsutomu Itoh goto next; 312397d9a8a4STsutomu Itoh } 31245d4f98a2SYan Zheng btrfs_tree_lock(eb); 31258bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 31265d4f98a2SYan Zheng 31275d4f98a2SYan Zheng if (!node->eb) { 31285d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 31295d4f98a2SYan Zheng slot, &eb); 31303fd0a558SYan, Zheng btrfs_tree_unlock(eb); 31313fd0a558SYan, Zheng free_extent_buffer(eb); 31325d4f98a2SYan Zheng if (ret < 0) { 31335d4f98a2SYan Zheng err = ret; 31343fd0a558SYan, Zheng goto next; 31355d4f98a2SYan Zheng } 31363fd0a558SYan, Zheng BUG_ON(node->eb != eb); 31375d4f98a2SYan Zheng } else { 31385d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 31395d4f98a2SYan Zheng node->eb->start); 31405d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 31415d4f98a2SYan Zheng trans->transid); 31425d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 31435d4f98a2SYan Zheng 314482fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, 31455d4f98a2SYan Zheng node->eb->start, blocksize, 314682fa113fSQu Wenruo upper->eb->start); 314782fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 314882fa113fSQu Wenruo btrfs_init_tree_ref(&ref, node->level, 314982fa113fSQu Wenruo btrfs_header_owner(upper->eb)); 315082fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 31515d4f98a2SYan Zheng BUG_ON(ret); 31525d4f98a2SYan Zheng 31535d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 31545d4f98a2SYan Zheng BUG_ON(ret); 31555d4f98a2SYan Zheng } 31563fd0a558SYan, Zheng next: 31573fd0a558SYan, Zheng if (!upper->pending) 31583fd0a558SYan, Zheng drop_node_buffer(upper); 31593fd0a558SYan, Zheng else 31603fd0a558SYan, Zheng unlock_node_buffer(upper); 31613fd0a558SYan, Zheng if (err) 31623fd0a558SYan, Zheng break; 31635d4f98a2SYan Zheng } 31643fd0a558SYan, Zheng 31653fd0a558SYan, Zheng if (!err && node->pending) { 31663fd0a558SYan, Zheng drop_node_buffer(node); 31673fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 31683fd0a558SYan, Zheng node->pending = 0; 31695d4f98a2SYan Zheng } 31703fd0a558SYan, Zheng 31715d4f98a2SYan Zheng path->lowest_level = 0; 31723fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 31735d4f98a2SYan Zheng return err; 31745d4f98a2SYan Zheng } 31755d4f98a2SYan Zheng 31765d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 31773fd0a558SYan, Zheng struct reloc_control *rc, 31785d4f98a2SYan Zheng struct backref_node *node, 31795d4f98a2SYan Zheng struct btrfs_path *path) 31805d4f98a2SYan Zheng { 31815d4f98a2SYan Zheng struct btrfs_key key; 31825d4f98a2SYan Zheng 31835d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 31843fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 31855d4f98a2SYan Zheng } 31865d4f98a2SYan Zheng 31875d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 31883fd0a558SYan, Zheng struct reloc_control *rc, 31893fd0a558SYan, Zheng struct btrfs_path *path, int err) 31905d4f98a2SYan Zheng { 31913fd0a558SYan, Zheng LIST_HEAD(list); 31923fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 31935d4f98a2SYan Zheng struct backref_node *node; 31945d4f98a2SYan Zheng int level; 31955d4f98a2SYan Zheng int ret; 31965d4f98a2SYan Zheng 31975d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 31985d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 31995d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 32003fd0a558SYan, Zheng struct backref_node, list); 32013fd0a558SYan, Zheng list_move_tail(&node->list, &list); 32023fd0a558SYan, Zheng BUG_ON(!node->pending); 32035d4f98a2SYan Zheng 32043fd0a558SYan, Zheng if (!err) { 32053fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 32065d4f98a2SYan Zheng if (ret < 0) 32075d4f98a2SYan Zheng err = ret; 32085d4f98a2SYan Zheng } 32095d4f98a2SYan Zheng } 32103fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 32113fd0a558SYan, Zheng } 32125d4f98a2SYan Zheng return err; 32135d4f98a2SYan Zheng } 32145d4f98a2SYan Zheng 32155d4f98a2SYan Zheng /* 32165d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 32175d4f98a2SYan Zheng * as processed. 32185d4f98a2SYan Zheng */ 32195d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 32205d4f98a2SYan Zheng struct backref_node *node) 32215d4f98a2SYan Zheng { 32225d4f98a2SYan Zheng struct backref_node *next = node; 32235d4f98a2SYan Zheng struct backref_edge *edge; 32245d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 32255d4f98a2SYan Zheng int index = 0; 32265d4f98a2SYan Zheng 32275d4f98a2SYan Zheng while (next) { 32285d4f98a2SYan Zheng cond_resched(); 32295d4f98a2SYan Zheng while (1) { 32305d4f98a2SYan Zheng if (next->processed) 32315d4f98a2SYan Zheng break; 32325d4f98a2SYan Zheng 32339569cc20SQu Wenruo mark_block_processed(rc, next); 32345d4f98a2SYan Zheng 32355d4f98a2SYan Zheng if (list_empty(&next->upper)) 32365d4f98a2SYan Zheng break; 32375d4f98a2SYan Zheng 32385d4f98a2SYan Zheng edge = list_entry(next->upper.next, 32395d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 32405d4f98a2SYan Zheng edges[index++] = edge; 32415d4f98a2SYan Zheng next = edge->node[UPPER]; 32425d4f98a2SYan Zheng } 32435d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 32445d4f98a2SYan Zheng } 32455d4f98a2SYan Zheng } 32465d4f98a2SYan Zheng 32477476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 32485d4f98a2SYan Zheng { 3249da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 32507476dfdaSDavid Sterba 32515d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 32529655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 32535d4f98a2SYan Zheng return 1; 32545d4f98a2SYan Zheng return 0; 32555d4f98a2SYan Zheng } 32565d4f98a2SYan Zheng 32572ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 32585d4f98a2SYan Zheng struct tree_block *block) 32595d4f98a2SYan Zheng { 32605d4f98a2SYan Zheng struct extent_buffer *eb; 32615d4f98a2SYan Zheng 3262581c1760SQu Wenruo eb = read_tree_block(fs_info, block->bytenr, block->key.offset, 3263581c1760SQu Wenruo block->level, NULL); 326464c043deSLiu Bo if (IS_ERR(eb)) { 326564c043deSLiu Bo return PTR_ERR(eb); 326664c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 3267416bc658SJosef Bacik free_extent_buffer(eb); 3268416bc658SJosef Bacik return -EIO; 3269416bc658SJosef Bacik } 32705d4f98a2SYan Zheng if (block->level == 0) 32715d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 32725d4f98a2SYan Zheng else 32735d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 32745d4f98a2SYan Zheng free_extent_buffer(eb); 32755d4f98a2SYan Zheng block->key_ready = 1; 32765d4f98a2SYan Zheng return 0; 32775d4f98a2SYan Zheng } 32785d4f98a2SYan Zheng 32795d4f98a2SYan Zheng /* 32805d4f98a2SYan Zheng * helper function to relocate a tree block 32815d4f98a2SYan Zheng */ 32825d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 32835d4f98a2SYan Zheng struct reloc_control *rc, 32845d4f98a2SYan Zheng struct backref_node *node, 32855d4f98a2SYan Zheng struct btrfs_key *key, 32865d4f98a2SYan Zheng struct btrfs_path *path) 32875d4f98a2SYan Zheng { 32885d4f98a2SYan Zheng struct btrfs_root *root; 32893fd0a558SYan, Zheng int ret = 0; 32905d4f98a2SYan Zheng 32913fd0a558SYan, Zheng if (!node) 32925d4f98a2SYan Zheng return 0; 32933fd0a558SYan, Zheng 32945f6b2e5cSJosef Bacik /* 32955f6b2e5cSJosef Bacik * If we fail here we want to drop our backref_node because we are going 32965f6b2e5cSJosef Bacik * to start over and regenerate the tree for it. 32975f6b2e5cSJosef Bacik */ 32985f6b2e5cSJosef Bacik ret = reserve_metadata_space(trans, rc, node); 32995f6b2e5cSJosef Bacik if (ret) 33005f6b2e5cSJosef Bacik goto out; 33015f6b2e5cSJosef Bacik 33023fd0a558SYan, Zheng BUG_ON(node->processed); 3303147d256eSZhaolei root = select_one_root(node); 33043fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 33053fd0a558SYan, Zheng update_processed_blocks(rc, node); 33063fd0a558SYan, Zheng goto out; 33075d4f98a2SYan Zheng } 33085d4f98a2SYan Zheng 33093fd0a558SYan, Zheng if (root) { 331027cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 33113fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 33123fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 33133fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 33143fd0a558SYan, Zheng root = root->reloc_root; 33153fd0a558SYan, Zheng node->new_bytenr = root->node->start; 331600246528SJosef Bacik btrfs_put_root(node->root); 331700246528SJosef Bacik node->root = btrfs_grab_root(root); 33180b530bc5SJosef Bacik ASSERT(node->root); 33193fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 33203fd0a558SYan, Zheng } else { 33215d4f98a2SYan Zheng path->lowest_level = node->level; 33225d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 3323b3b4aa74SDavid Sterba btrfs_release_path(path); 33243fd0a558SYan, Zheng if (ret > 0) 33255d4f98a2SYan Zheng ret = 0; 33263fd0a558SYan, Zheng } 33273fd0a558SYan, Zheng if (!ret) 33283fd0a558SYan, Zheng update_processed_blocks(rc, node); 33293fd0a558SYan, Zheng } else { 33303fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 33313fd0a558SYan, Zheng } 33325d4f98a2SYan Zheng out: 33330647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 33343fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 33355d4f98a2SYan Zheng return ret; 33365d4f98a2SYan Zheng } 33375d4f98a2SYan Zheng 33385d4f98a2SYan Zheng /* 33395d4f98a2SYan Zheng * relocate a list of blocks 33405d4f98a2SYan Zheng */ 33415d4f98a2SYan Zheng static noinline_for_stack 33425d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 33435d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 33445d4f98a2SYan Zheng { 33452ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 33465d4f98a2SYan Zheng struct backref_node *node; 33475d4f98a2SYan Zheng struct btrfs_path *path; 33485d4f98a2SYan Zheng struct tree_block *block; 334998ff7b94SQu Wenruo struct tree_block *next; 33505d4f98a2SYan Zheng int ret; 33515d4f98a2SYan Zheng int err = 0; 33525d4f98a2SYan Zheng 33535d4f98a2SYan Zheng path = btrfs_alloc_path(); 3354e1a12670SLiu Bo if (!path) { 3355e1a12670SLiu Bo err = -ENOMEM; 335634c2b290SDavid Sterba goto out_free_blocks; 3357e1a12670SLiu Bo } 33585d4f98a2SYan Zheng 335998ff7b94SQu Wenruo /* Kick in readahead for tree blocks with missing keys */ 336098ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 33615d4f98a2SYan Zheng if (!block->key_ready) 33622ff7e61eSJeff Mahoney readahead_tree_block(fs_info, block->bytenr); 33635d4f98a2SYan Zheng } 33645d4f98a2SYan Zheng 336598ff7b94SQu Wenruo /* Get first keys */ 336698ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 336734c2b290SDavid Sterba if (!block->key_ready) { 33682ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 336934c2b290SDavid Sterba if (err) 337034c2b290SDavid Sterba goto out_free_path; 337134c2b290SDavid Sterba } 33725d4f98a2SYan Zheng } 33735d4f98a2SYan Zheng 337498ff7b94SQu Wenruo /* Do tree relocation */ 337598ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 33763fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 33775d4f98a2SYan Zheng block->level, block->bytenr); 33785d4f98a2SYan Zheng if (IS_ERR(node)) { 33795d4f98a2SYan Zheng err = PTR_ERR(node); 33805d4f98a2SYan Zheng goto out; 33815d4f98a2SYan Zheng } 33825d4f98a2SYan Zheng 33835d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 33845d4f98a2SYan Zheng path); 33855d4f98a2SYan Zheng if (ret < 0) { 33865d4f98a2SYan Zheng err = ret; 338750dbbb71SJosef Bacik break; 33885d4f98a2SYan Zheng } 33895d4f98a2SYan Zheng } 33905d4f98a2SYan Zheng out: 33913fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 33925d4f98a2SYan Zheng 339334c2b290SDavid Sterba out_free_path: 33945d4f98a2SYan Zheng btrfs_free_path(path); 339534c2b290SDavid Sterba out_free_blocks: 3396e1a12670SLiu Bo free_block_list(blocks); 33975d4f98a2SYan Zheng return err; 33985d4f98a2SYan Zheng } 33995d4f98a2SYan Zheng 34005d4f98a2SYan Zheng static noinline_for_stack 3401efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3402efa56464SYan, Zheng struct file_extent_cluster *cluster) 3403efa56464SYan, Zheng { 3404efa56464SYan, Zheng u64 alloc_hint = 0; 3405efa56464SYan, Zheng u64 start; 3406efa56464SYan, Zheng u64 end; 3407efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3408efa56464SYan, Zheng u64 num_bytes; 3409efa56464SYan, Zheng int nr = 0; 3410efa56464SYan, Zheng int ret = 0; 3411dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 3412dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 341318513091SWang Xiaoguang u64 cur_offset; 3414364ecf36SQu Wenruo struct extent_changeset *data_reserved = NULL; 3415efa56464SYan, Zheng 3416efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 34175955102cSAl Viro inode_lock(inode); 3418efa56464SYan, Zheng 3419364ecf36SQu Wenruo ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start, 3420dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 3421efa56464SYan, Zheng if (ret) 3422efa56464SYan, Zheng goto out; 3423efa56464SYan, Zheng 342418513091SWang Xiaoguang cur_offset = prealloc_start; 3425efa56464SYan, Zheng while (nr < cluster->nr) { 3426efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3427efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3428efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3429efa56464SYan, Zheng else 3430efa56464SYan, Zheng end = cluster->end - offset; 3431efa56464SYan, Zheng 3432d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3433efa56464SYan, Zheng num_bytes = end + 1 - start; 343418513091SWang Xiaoguang if (cur_offset < start) 3435bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3436bc42bda2SQu Wenruo cur_offset, start - cur_offset); 3437efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3438efa56464SYan, Zheng num_bytes, num_bytes, 3439efa56464SYan, Zheng end + 1, &alloc_hint); 344018513091SWang Xiaoguang cur_offset = end + 1; 3441d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3442efa56464SYan, Zheng if (ret) 3443efa56464SYan, Zheng break; 3444efa56464SYan, Zheng nr++; 3445efa56464SYan, Zheng } 344618513091SWang Xiaoguang if (cur_offset < prealloc_end) 3447bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3448bc42bda2SQu Wenruo cur_offset, prealloc_end + 1 - cur_offset); 3449efa56464SYan, Zheng out: 34505955102cSAl Viro inode_unlock(inode); 3451364ecf36SQu Wenruo extent_changeset_free(data_reserved); 3452efa56464SYan, Zheng return ret; 3453efa56464SYan, Zheng } 3454efa56464SYan, Zheng 3455efa56464SYan, Zheng static noinline_for_stack 34560257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 34570257bb82SYan, Zheng u64 block_start) 34585d4f98a2SYan Zheng { 34595d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 34605d4f98a2SYan Zheng struct extent_map *em; 34610257bb82SYan, Zheng int ret = 0; 34625d4f98a2SYan Zheng 3463172ddd60SDavid Sterba em = alloc_extent_map(); 34640257bb82SYan, Zheng if (!em) 34650257bb82SYan, Zheng return -ENOMEM; 34660257bb82SYan, Zheng 34675d4f98a2SYan Zheng em->start = start; 34680257bb82SYan, Zheng em->len = end + 1 - start; 34690257bb82SYan, Zheng em->block_len = em->len; 34700257bb82SYan, Zheng em->block_start = block_start; 34715d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 34725d4f98a2SYan Zheng 3473d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 34745d4f98a2SYan Zheng while (1) { 3475890871beSChris Mason write_lock(&em_tree->lock); 347609a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3477890871beSChris Mason write_unlock(&em_tree->lock); 34785d4f98a2SYan Zheng if (ret != -EEXIST) { 34795d4f98a2SYan Zheng free_extent_map(em); 34805d4f98a2SYan Zheng break; 34815d4f98a2SYan Zheng } 3482dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 34835d4f98a2SYan Zheng } 3484d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 34850257bb82SYan, Zheng return ret; 34860257bb82SYan, Zheng } 34875d4f98a2SYan Zheng 3488726a3421SQu Wenruo /* 3489726a3421SQu Wenruo * Allow error injection to test balance cancellation 3490726a3421SQu Wenruo */ 3491726a3421SQu Wenruo int btrfs_should_cancel_balance(struct btrfs_fs_info *fs_info) 3492726a3421SQu Wenruo { 3493726a3421SQu Wenruo return atomic_read(&fs_info->balance_cancel_req); 3494726a3421SQu Wenruo } 3495726a3421SQu Wenruo ALLOW_ERROR_INJECTION(btrfs_should_cancel_balance, TRUE); 3496726a3421SQu Wenruo 34970257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 34980257bb82SYan, Zheng struct file_extent_cluster *cluster) 34990257bb82SYan, Zheng { 35002ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 35010257bb82SYan, Zheng u64 page_start; 35020257bb82SYan, Zheng u64 page_end; 35030257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 35040257bb82SYan, Zheng unsigned long index; 35050257bb82SYan, Zheng unsigned long last_index; 35060257bb82SYan, Zheng struct page *page; 35070257bb82SYan, Zheng struct file_ra_state *ra; 35083b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 35090257bb82SYan, Zheng int nr = 0; 35100257bb82SYan, Zheng int ret = 0; 35110257bb82SYan, Zheng 35120257bb82SYan, Zheng if (!cluster->nr) 35130257bb82SYan, Zheng return 0; 35140257bb82SYan, Zheng 35150257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 35160257bb82SYan, Zheng if (!ra) 35170257bb82SYan, Zheng return -ENOMEM; 35180257bb82SYan, Zheng 3519efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 35200257bb82SYan, Zheng if (ret) 3521efa56464SYan, Zheng goto out; 35220257bb82SYan, Zheng 35230257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 35240257bb82SYan, Zheng 3525efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3526efa56464SYan, Zheng cluster->end - offset, cluster->start); 3527efa56464SYan, Zheng if (ret) 3528efa56464SYan, Zheng goto out; 3529efa56464SYan, Zheng 353009cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 353109cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 35320257bb82SYan, Zheng while (index <= last_index) { 35339f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 35349f3db423SNikolay Borisov PAGE_SIZE); 3535efa56464SYan, Zheng if (ret) 3536efa56464SYan, Zheng goto out; 3537efa56464SYan, Zheng 35380257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 35390257bb82SYan, Zheng if (!page) { 35400257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 35410257bb82SYan, Zheng ra, NULL, index, 35420257bb82SYan, Zheng last_index + 1 - index); 3543a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 35443b16a4e3SJosef Bacik mask); 35450257bb82SYan, Zheng if (!page) { 3546691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 354743b18595SQu Wenruo PAGE_SIZE, true); 354844db1216SFilipe Manana btrfs_delalloc_release_extents(BTRFS_I(inode), 35498702ba93SQu Wenruo PAGE_SIZE); 35500257bb82SYan, Zheng ret = -ENOMEM; 3551efa56464SYan, Zheng goto out; 35520257bb82SYan, Zheng } 35530257bb82SYan, Zheng } 35540257bb82SYan, Zheng 35550257bb82SYan, Zheng if (PageReadahead(page)) { 35560257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 35570257bb82SYan, Zheng ra, NULL, page, index, 35580257bb82SYan, Zheng last_index + 1 - index); 35590257bb82SYan, Zheng } 35600257bb82SYan, Zheng 35610257bb82SYan, Zheng if (!PageUptodate(page)) { 35620257bb82SYan, Zheng btrfs_readpage(NULL, page); 35630257bb82SYan, Zheng lock_page(page); 35640257bb82SYan, Zheng if (!PageUptodate(page)) { 35650257bb82SYan, Zheng unlock_page(page); 356609cbfeafSKirill A. Shutemov put_page(page); 3567691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 356843b18595SQu Wenruo PAGE_SIZE, true); 35698b62f87bSJosef Bacik btrfs_delalloc_release_extents(BTRFS_I(inode), 35708702ba93SQu Wenruo PAGE_SIZE); 35710257bb82SYan, Zheng ret = -EIO; 3572efa56464SYan, Zheng goto out; 35730257bb82SYan, Zheng } 35740257bb82SYan, Zheng } 35750257bb82SYan, Zheng 35764eee4fa4SMiao Xie page_start = page_offset(page); 357709cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 35780257bb82SYan, Zheng 3579d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 35800257bb82SYan, Zheng 35810257bb82SYan, Zheng set_page_extent_mapped(page); 35820257bb82SYan, Zheng 35830257bb82SYan, Zheng if (nr < cluster->nr && 35840257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 35850257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 35860257bb82SYan, Zheng page_start, page_end, 3587ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 35880257bb82SYan, Zheng nr++; 35890257bb82SYan, Zheng } 35900257bb82SYan, Zheng 3591765f3cebSNikolay Borisov ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0, 3592330a5827SNikolay Borisov NULL); 3593765f3cebSNikolay Borisov if (ret) { 3594765f3cebSNikolay Borisov unlock_page(page); 3595765f3cebSNikolay Borisov put_page(page); 3596765f3cebSNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 359743b18595SQu Wenruo PAGE_SIZE, true); 3598765f3cebSNikolay Borisov btrfs_delalloc_release_extents(BTRFS_I(inode), 35998702ba93SQu Wenruo PAGE_SIZE); 3600765f3cebSNikolay Borisov 3601765f3cebSNikolay Borisov clear_extent_bits(&BTRFS_I(inode)->io_tree, 3602765f3cebSNikolay Borisov page_start, page_end, 3603765f3cebSNikolay Borisov EXTENT_LOCKED | EXTENT_BOUNDARY); 3604765f3cebSNikolay Borisov goto out; 3605765f3cebSNikolay Borisov 3606765f3cebSNikolay Borisov } 36070257bb82SYan, Zheng set_page_dirty(page); 36080257bb82SYan, Zheng 36090257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3610d0082371SJeff Mahoney page_start, page_end); 36110257bb82SYan, Zheng unlock_page(page); 361209cbfeafSKirill A. Shutemov put_page(page); 36130257bb82SYan, Zheng 36140257bb82SYan, Zheng index++; 36158702ba93SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); 3616efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 36172ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 36187f913c7cSQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 36197f913c7cSQu Wenruo ret = -ECANCELED; 36207f913c7cSQu Wenruo goto out; 36217f913c7cSQu Wenruo } 36220257bb82SYan, Zheng } 36230257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3624efa56464SYan, Zheng out: 36250257bb82SYan, Zheng kfree(ra); 36260257bb82SYan, Zheng return ret; 36270257bb82SYan, Zheng } 36280257bb82SYan, Zheng 36290257bb82SYan, Zheng static noinline_for_stack 36300257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 36310257bb82SYan, Zheng struct file_extent_cluster *cluster) 36320257bb82SYan, Zheng { 36330257bb82SYan, Zheng int ret; 36340257bb82SYan, Zheng 36350257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 36360257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 36370257bb82SYan, Zheng if (ret) 36380257bb82SYan, Zheng return ret; 36390257bb82SYan, Zheng cluster->nr = 0; 36400257bb82SYan, Zheng } 36410257bb82SYan, Zheng 36420257bb82SYan, Zheng if (!cluster->nr) 36430257bb82SYan, Zheng cluster->start = extent_key->objectid; 36440257bb82SYan, Zheng else 36450257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 36460257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 36470257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 36480257bb82SYan, Zheng cluster->nr++; 36490257bb82SYan, Zheng 36500257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 36510257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 36520257bb82SYan, Zheng if (ret) 36530257bb82SYan, Zheng return ret; 36540257bb82SYan, Zheng cluster->nr = 0; 36550257bb82SYan, Zheng } 36560257bb82SYan, Zheng return 0; 36575d4f98a2SYan Zheng } 36585d4f98a2SYan Zheng 36595d4f98a2SYan Zheng /* 36605d4f98a2SYan Zheng * helper to add a tree block to the list. 36615d4f98a2SYan Zheng * the major work is getting the generation and level of the block 36625d4f98a2SYan Zheng */ 36635d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 36645d4f98a2SYan Zheng struct btrfs_key *extent_key, 36655d4f98a2SYan Zheng struct btrfs_path *path, 36665d4f98a2SYan Zheng struct rb_root *blocks) 36675d4f98a2SYan Zheng { 36685d4f98a2SYan Zheng struct extent_buffer *eb; 36695d4f98a2SYan Zheng struct btrfs_extent_item *ei; 36705d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 36715d4f98a2SYan Zheng struct tree_block *block; 36725d4f98a2SYan Zheng struct rb_node *rb_node; 36735d4f98a2SYan Zheng u32 item_size; 36745d4f98a2SYan Zheng int level = -1; 36757fdf4b60SWang Shilong u64 generation; 36765d4f98a2SYan Zheng 36775d4f98a2SYan Zheng eb = path->nodes[0]; 36785d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 36795d4f98a2SYan Zheng 36803173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 36813173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 36825d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 36835d4f98a2SYan Zheng struct btrfs_extent_item); 36843173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 36855d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 36865d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 36875d4f98a2SYan Zheng } else { 36883173a18fSJosef Bacik level = (int)extent_key->offset; 36893173a18fSJosef Bacik } 36903173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 36916d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3692ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3693ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3694ba3c2b19SNikolay Borisov return -EINVAL; 36953173a18fSJosef Bacik } else { 36965d4f98a2SYan Zheng BUG(); 36975d4f98a2SYan Zheng } 36985d4f98a2SYan Zheng 3699b3b4aa74SDavid Sterba btrfs_release_path(path); 37005d4f98a2SYan Zheng 37015d4f98a2SYan Zheng BUG_ON(level == -1); 37025d4f98a2SYan Zheng 37035d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 37045d4f98a2SYan Zheng if (!block) 37055d4f98a2SYan Zheng return -ENOMEM; 37065d4f98a2SYan Zheng 37075d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3708da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 37095d4f98a2SYan Zheng block->key.offset = generation; 37105d4f98a2SYan Zheng block->level = level; 37115d4f98a2SYan Zheng block->key_ready = 0; 37125d4f98a2SYan Zheng 37135d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 371443c04fb1SJeff Mahoney if (rb_node) 371543c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 37165d4f98a2SYan Zheng 37175d4f98a2SYan Zheng return 0; 37185d4f98a2SYan Zheng } 37195d4f98a2SYan Zheng 37205d4f98a2SYan Zheng /* 37215d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 37225d4f98a2SYan Zheng */ 37235d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 37245d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 37255d4f98a2SYan Zheng struct rb_root *blocks) 37265d4f98a2SYan Zheng { 37270b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 37285d4f98a2SYan Zheng struct btrfs_path *path; 37295d4f98a2SYan Zheng struct btrfs_key key; 37305d4f98a2SYan Zheng int ret; 37310b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 37325d4f98a2SYan Zheng 37337476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 37345d4f98a2SYan Zheng return 0; 37355d4f98a2SYan Zheng 37365d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 37375d4f98a2SYan Zheng return 0; 37385d4f98a2SYan Zheng 37395d4f98a2SYan Zheng path = btrfs_alloc_path(); 37405d4f98a2SYan Zheng if (!path) 37415d4f98a2SYan Zheng return -ENOMEM; 3742aee68ee5SJosef Bacik again: 37435d4f98a2SYan Zheng key.objectid = bytenr; 3744aee68ee5SJosef Bacik if (skinny) { 3745aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3746aee68ee5SJosef Bacik key.offset = (u64)-1; 3747aee68ee5SJosef Bacik } else { 37485d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 37495d4f98a2SYan Zheng key.offset = blocksize; 3750aee68ee5SJosef Bacik } 37515d4f98a2SYan Zheng 37525d4f98a2SYan Zheng path->search_commit_root = 1; 37535d4f98a2SYan Zheng path->skip_locking = 1; 37545d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 37555d4f98a2SYan Zheng if (ret < 0) 37565d4f98a2SYan Zheng goto out; 37575d4f98a2SYan Zheng 3758aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3759aee68ee5SJosef Bacik if (path->slots[0]) { 3760aee68ee5SJosef Bacik path->slots[0]--; 3761aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3762aee68ee5SJosef Bacik path->slots[0]); 37633173a18fSJosef Bacik if (key.objectid == bytenr && 3764aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3765aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3766aee68ee5SJosef Bacik key.offset == blocksize))) 37673173a18fSJosef Bacik ret = 0; 37683173a18fSJosef Bacik } 3769aee68ee5SJosef Bacik 3770aee68ee5SJosef Bacik if (ret) { 3771aee68ee5SJosef Bacik skinny = false; 3772aee68ee5SJosef Bacik btrfs_release_path(path); 3773aee68ee5SJosef Bacik goto again; 3774aee68ee5SJosef Bacik } 3775aee68ee5SJosef Bacik } 3776cdccee99SLiu Bo if (ret) { 3777cdccee99SLiu Bo ASSERT(ret == 1); 3778cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3779cdccee99SLiu Bo btrfs_err(fs_info, 3780cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3781cdccee99SLiu Bo bytenr); 3782cdccee99SLiu Bo WARN_ON(1); 3783cdccee99SLiu Bo ret = -EINVAL; 3784cdccee99SLiu Bo goto out; 3785cdccee99SLiu Bo } 37863173a18fSJosef Bacik 37875d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 37885d4f98a2SYan Zheng out: 37895d4f98a2SYan Zheng btrfs_free_path(path); 37905d4f98a2SYan Zheng return ret; 37915d4f98a2SYan Zheng } 37925d4f98a2SYan Zheng 37930af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 379432da5386SDavid Sterba struct btrfs_block_group *block_group, 37951bbc621eSChris Mason struct inode *inode, 37961bbc621eSChris Mason u64 ino) 37970af3d00bSJosef Bacik { 37980af3d00bSJosef Bacik struct btrfs_key key; 37990af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 38000af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 38010af3d00bSJosef Bacik int ret = 0; 38020af3d00bSJosef Bacik 38030af3d00bSJosef Bacik if (inode) 38040af3d00bSJosef Bacik goto truncate; 38050af3d00bSJosef Bacik 38060af3d00bSJosef Bacik key.objectid = ino; 38070af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 38080af3d00bSJosef Bacik key.offset = 0; 38090af3d00bSJosef Bacik 38104c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 38112e19f1f9SAl Viro if (IS_ERR(inode)) 38120af3d00bSJosef Bacik return -ENOENT; 38130af3d00bSJosef Bacik 38140af3d00bSJosef Bacik truncate: 38152ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 38167b61cd92SMiao Xie &fs_info->global_block_rsv); 38177b61cd92SMiao Xie if (ret) 38187b61cd92SMiao Xie goto out; 38197b61cd92SMiao Xie 38207a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 38210af3d00bSJosef Bacik if (IS_ERR(trans)) { 38223612b495STsutomu Itoh ret = PTR_ERR(trans); 38230af3d00bSJosef Bacik goto out; 38240af3d00bSJosef Bacik } 38250af3d00bSJosef Bacik 382677ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 38270af3d00bSJosef Bacik 38283a45bb20SJeff Mahoney btrfs_end_transaction(trans); 38292ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 38300af3d00bSJosef Bacik out: 38310af3d00bSJosef Bacik iput(inode); 38320af3d00bSJosef Bacik return ret; 38330af3d00bSJosef Bacik } 38340af3d00bSJosef Bacik 38355d4f98a2SYan Zheng /* 383619b546d7SQu Wenruo * Locate the free space cache EXTENT_DATA in root tree leaf and delete the 383719b546d7SQu Wenruo * cache inode, to avoid free space cache data extent blocking data relocation. 38385d4f98a2SYan Zheng */ 383919b546d7SQu Wenruo static int delete_v1_space_cache(struct extent_buffer *leaf, 384019b546d7SQu Wenruo struct btrfs_block_group *block_group, 384119b546d7SQu Wenruo u64 data_bytenr) 38425d4f98a2SYan Zheng { 384319b546d7SQu Wenruo u64 space_cache_ino; 384419b546d7SQu Wenruo struct btrfs_file_extent_item *ei; 38455d4f98a2SYan Zheng struct btrfs_key key; 384619b546d7SQu Wenruo bool found = false; 384719b546d7SQu Wenruo int i; 38485d4f98a2SYan Zheng int ret; 38495d4f98a2SYan Zheng 385019b546d7SQu Wenruo if (btrfs_header_owner(leaf) != BTRFS_ROOT_TREE_OBJECTID) 385119b546d7SQu Wenruo return 0; 38525d4f98a2SYan Zheng 385319b546d7SQu Wenruo for (i = 0; i < btrfs_header_nritems(leaf); i++) { 385419b546d7SQu Wenruo btrfs_item_key_to_cpu(leaf, &key, i); 385519b546d7SQu Wenruo if (key.type != BTRFS_EXTENT_DATA_KEY) 385619b546d7SQu Wenruo continue; 385719b546d7SQu Wenruo ei = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 385819b546d7SQu Wenruo if (btrfs_file_extent_type(leaf, ei) == BTRFS_FILE_EXTENT_REG && 385919b546d7SQu Wenruo btrfs_file_extent_disk_bytenr(leaf, ei) == data_bytenr) { 386019b546d7SQu Wenruo found = true; 386119b546d7SQu Wenruo space_cache_ino = key.objectid; 386219b546d7SQu Wenruo break; 386319b546d7SQu Wenruo } 386419b546d7SQu Wenruo } 386519b546d7SQu Wenruo if (!found) 386619b546d7SQu Wenruo return -ENOENT; 386719b546d7SQu Wenruo ret = delete_block_group_cache(leaf->fs_info, block_group, NULL, 386819b546d7SQu Wenruo space_cache_ino); 38690af3d00bSJosef Bacik return ret; 38705d4f98a2SYan Zheng } 38715d4f98a2SYan Zheng 38725d4f98a2SYan Zheng /* 38732c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 38745d4f98a2SYan Zheng */ 38755d4f98a2SYan Zheng static noinline_for_stack 38765d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 38775d4f98a2SYan Zheng struct btrfs_key *extent_key, 38785d4f98a2SYan Zheng struct btrfs_path *path, 38795d4f98a2SYan Zheng struct rb_root *blocks) 38805d4f98a2SYan Zheng { 388119b546d7SQu Wenruo struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 388219b546d7SQu Wenruo struct ulist *leaves = NULL; 388319b546d7SQu Wenruo struct ulist_iterator leaf_uiter; 388419b546d7SQu Wenruo struct ulist_node *ref_node = NULL; 388519b546d7SQu Wenruo const u32 blocksize = fs_info->nodesize; 3886647f63bdSFilipe David Borba Manana int ret = 0; 38875d4f98a2SYan Zheng 3888b3b4aa74SDavid Sterba btrfs_release_path(path); 388919b546d7SQu Wenruo ret = btrfs_find_all_leafs(NULL, fs_info, extent_key->objectid, 389019b546d7SQu Wenruo 0, &leaves, NULL, true); 389119b546d7SQu Wenruo if (ret < 0) 389219b546d7SQu Wenruo return ret; 389319b546d7SQu Wenruo 389419b546d7SQu Wenruo ULIST_ITER_INIT(&leaf_uiter); 389519b546d7SQu Wenruo while ((ref_node = ulist_next(leaves, &leaf_uiter))) { 389619b546d7SQu Wenruo struct extent_buffer *eb; 389719b546d7SQu Wenruo 389819b546d7SQu Wenruo eb = read_tree_block(fs_info, ref_node->val, 0, 0, NULL); 389919b546d7SQu Wenruo if (IS_ERR(eb)) { 390019b546d7SQu Wenruo ret = PTR_ERR(eb); 390119b546d7SQu Wenruo break; 390219b546d7SQu Wenruo } 390319b546d7SQu Wenruo ret = delete_v1_space_cache(eb, rc->block_group, 390419b546d7SQu Wenruo extent_key->objectid); 390519b546d7SQu Wenruo free_extent_buffer(eb); 390619b546d7SQu Wenruo if (ret < 0) 390719b546d7SQu Wenruo break; 390819b546d7SQu Wenruo ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); 390919b546d7SQu Wenruo if (ret < 0) 391019b546d7SQu Wenruo break; 391119b546d7SQu Wenruo } 391219b546d7SQu Wenruo if (ret < 0) 39135d4f98a2SYan Zheng free_block_list(blocks); 391419b546d7SQu Wenruo ulist_free(leaves); 391519b546d7SQu Wenruo return ret; 39165d4f98a2SYan Zheng } 39175d4f98a2SYan Zheng 39185d4f98a2SYan Zheng /* 39192c016dc2SLiu Bo * helper to find next unprocessed extent 39205d4f98a2SYan Zheng */ 39215d4f98a2SYan Zheng static noinline_for_stack 3922147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 39233fd0a558SYan, Zheng struct btrfs_key *extent_key) 39245d4f98a2SYan Zheng { 39250b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39265d4f98a2SYan Zheng struct btrfs_key key; 39275d4f98a2SYan Zheng struct extent_buffer *leaf; 39285d4f98a2SYan Zheng u64 start, end, last; 39295d4f98a2SYan Zheng int ret; 39305d4f98a2SYan Zheng 3931b3470b5dSDavid Sterba last = rc->block_group->start + rc->block_group->length; 39325d4f98a2SYan Zheng while (1) { 39335d4f98a2SYan Zheng cond_resched(); 39345d4f98a2SYan Zheng if (rc->search_start >= last) { 39355d4f98a2SYan Zheng ret = 1; 39365d4f98a2SYan Zheng break; 39375d4f98a2SYan Zheng } 39385d4f98a2SYan Zheng 39395d4f98a2SYan Zheng key.objectid = rc->search_start; 39405d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 39415d4f98a2SYan Zheng key.offset = 0; 39425d4f98a2SYan Zheng 39435d4f98a2SYan Zheng path->search_commit_root = 1; 39445d4f98a2SYan Zheng path->skip_locking = 1; 39455d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 39465d4f98a2SYan Zheng 0, 0); 39475d4f98a2SYan Zheng if (ret < 0) 39485d4f98a2SYan Zheng break; 39495d4f98a2SYan Zheng next: 39505d4f98a2SYan Zheng leaf = path->nodes[0]; 39515d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 39525d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 39535d4f98a2SYan Zheng if (ret != 0) 39545d4f98a2SYan Zheng break; 39555d4f98a2SYan Zheng leaf = path->nodes[0]; 39565d4f98a2SYan Zheng } 39575d4f98a2SYan Zheng 39585d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 39595d4f98a2SYan Zheng if (key.objectid >= last) { 39605d4f98a2SYan Zheng ret = 1; 39615d4f98a2SYan Zheng break; 39625d4f98a2SYan Zheng } 39635d4f98a2SYan Zheng 39643173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 39653173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 39663173a18fSJosef Bacik path->slots[0]++; 39673173a18fSJosef Bacik goto next; 39683173a18fSJosef Bacik } 39693173a18fSJosef Bacik 39703173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 39715d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 39725d4f98a2SYan Zheng path->slots[0]++; 39735d4f98a2SYan Zheng goto next; 39745d4f98a2SYan Zheng } 39755d4f98a2SYan Zheng 39763173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 39770b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 39783173a18fSJosef Bacik rc->search_start) { 39793173a18fSJosef Bacik path->slots[0]++; 39803173a18fSJosef Bacik goto next; 39813173a18fSJosef Bacik } 39823173a18fSJosef Bacik 39835d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 39845d4f98a2SYan Zheng key.objectid, &start, &end, 3985e6138876SJosef Bacik EXTENT_DIRTY, NULL); 39865d4f98a2SYan Zheng 39875d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3988b3b4aa74SDavid Sterba btrfs_release_path(path); 39895d4f98a2SYan Zheng rc->search_start = end + 1; 39905d4f98a2SYan Zheng } else { 39913173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 39925d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 39933173a18fSJosef Bacik else 39943173a18fSJosef Bacik rc->search_start = key.objectid + 39950b246afaSJeff Mahoney fs_info->nodesize; 39963fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 39975d4f98a2SYan Zheng return 0; 39985d4f98a2SYan Zheng } 39995d4f98a2SYan Zheng } 4000b3b4aa74SDavid Sterba btrfs_release_path(path); 40015d4f98a2SYan Zheng return ret; 40025d4f98a2SYan Zheng } 40035d4f98a2SYan Zheng 40045d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 40055d4f98a2SYan Zheng { 40065d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 40077585717fSChris Mason 40087585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 40095d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 40107585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 40115d4f98a2SYan Zheng } 40125d4f98a2SYan Zheng 40135d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 40145d4f98a2SYan Zheng { 40155d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 40167585717fSChris Mason 40177585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 40185d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 40197585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 40205d4f98a2SYan Zheng } 40215d4f98a2SYan Zheng 40225d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 40235d4f98a2SYan Zheng { 40245d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 40255d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 40265d4f98a2SYan Zheng return 1; 40275d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 40285d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 40295d4f98a2SYan Zheng return 1; 40305d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 40315d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 40325d4f98a2SYan Zheng return 1; 40335d4f98a2SYan Zheng return 0; 40345d4f98a2SYan Zheng } 40355d4f98a2SYan Zheng 40363fd0a558SYan, Zheng static noinline_for_stack 40373fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 40383fd0a558SYan, Zheng { 40393fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 4040ac2fabacSJosef Bacik int ret; 40413fd0a558SYan, Zheng 40422ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 404366d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 40443fd0a558SYan, Zheng if (!rc->block_rsv) 40453fd0a558SYan, Zheng return -ENOMEM; 40463fd0a558SYan, Zheng 40473fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 4048b3470b5dSDavid Sterba rc->search_start = rc->block_group->start; 40493fd0a558SYan, Zheng rc->extents_found = 0; 40503fd0a558SYan, Zheng rc->nodes_relocated = 0; 40513fd0a558SYan, Zheng rc->merging_rsv_size = 0; 40520647bf56SWang Shilong rc->reserved_bytes = 0; 4053da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 40540647bf56SWang Shilong RELOCATION_RESERVED_NODES; 4055ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 4056ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 4057ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 4058ac2fabacSJosef Bacik if (ret) 4059ac2fabacSJosef Bacik return ret; 40603fd0a558SYan, Zheng 40613fd0a558SYan, Zheng rc->create_reloc_tree = 1; 40623fd0a558SYan, Zheng set_reloc_control(rc); 40633fd0a558SYan, Zheng 40647a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 406528818947SLiu Bo if (IS_ERR(trans)) { 406628818947SLiu Bo unset_reloc_control(rc); 406728818947SLiu Bo /* 406828818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 406928818947SLiu Bo * cleanup. And callers are responsible to free the above 407028818947SLiu Bo * block rsv. 407128818947SLiu Bo */ 407228818947SLiu Bo return PTR_ERR(trans); 407328818947SLiu Bo } 40743a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 40753fd0a558SYan, Zheng return 0; 40763fd0a558SYan, Zheng } 407776dda93cSYan, Zheng 40785d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 40795d4f98a2SYan Zheng { 40802ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 40815d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 40825d4f98a2SYan Zheng struct btrfs_key key; 40835d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 40845d4f98a2SYan Zheng struct btrfs_path *path; 40855d4f98a2SYan Zheng struct btrfs_extent_item *ei; 40865d4f98a2SYan Zheng u64 flags; 40875d4f98a2SYan Zheng u32 item_size; 40885d4f98a2SYan Zheng int ret; 40895d4f98a2SYan Zheng int err = 0; 4090c87f08caSChris Mason int progress = 0; 40915d4f98a2SYan Zheng 40925d4f98a2SYan Zheng path = btrfs_alloc_path(); 40933fd0a558SYan, Zheng if (!path) 40945d4f98a2SYan Zheng return -ENOMEM; 4095e4058b54SDavid Sterba path->reada = READA_FORWARD; 40963fd0a558SYan, Zheng 40973fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 40983fd0a558SYan, Zheng if (ret) { 40993fd0a558SYan, Zheng err = ret; 41003fd0a558SYan, Zheng goto out_free; 41012423fdfbSJiri Slaby } 41025d4f98a2SYan Zheng 41035d4f98a2SYan Zheng while (1) { 41040647bf56SWang Shilong rc->reserved_bytes = 0; 41050647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 41060647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 41070647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 41080647bf56SWang Shilong if (ret) { 41090647bf56SWang Shilong err = ret; 41100647bf56SWang Shilong break; 41110647bf56SWang Shilong } 4112c87f08caSChris Mason progress++; 4113a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 41140f788c58SLiu Bo if (IS_ERR(trans)) { 41150f788c58SLiu Bo err = PTR_ERR(trans); 41160f788c58SLiu Bo trans = NULL; 41170f788c58SLiu Bo break; 41180f788c58SLiu Bo } 4119c87f08caSChris Mason restart: 41203fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 41213a45bb20SJeff Mahoney btrfs_end_transaction(trans); 412242a657f5SPan Bian trans = NULL; 41233fd0a558SYan, Zheng continue; 41243fd0a558SYan, Zheng } 41253fd0a558SYan, Zheng 4126147d256eSZhaolei ret = find_next_extent(rc, path, &key); 41275d4f98a2SYan Zheng if (ret < 0) 41285d4f98a2SYan Zheng err = ret; 41295d4f98a2SYan Zheng if (ret != 0) 41305d4f98a2SYan Zheng break; 41315d4f98a2SYan Zheng 41325d4f98a2SYan Zheng rc->extents_found++; 41335d4f98a2SYan Zheng 41345d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 41355d4f98a2SYan Zheng struct btrfs_extent_item); 41363fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 41375d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 41385d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 41395d4f98a2SYan Zheng ret = check_extent_flags(flags); 41405d4f98a2SYan Zheng BUG_ON(ret); 41416d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 4142ba3c2b19SNikolay Borisov err = -EINVAL; 4143ba3c2b19SNikolay Borisov btrfs_print_v0_err(trans->fs_info); 4144ba3c2b19SNikolay Borisov btrfs_abort_transaction(trans, err); 4145ba3c2b19SNikolay Borisov break; 41465d4f98a2SYan Zheng } else { 41475d4f98a2SYan Zheng BUG(); 41485d4f98a2SYan Zheng } 41495d4f98a2SYan Zheng 41505d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 41515d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 41525d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 41535d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 41545d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 41555d4f98a2SYan Zheng } else { 4156b3b4aa74SDavid Sterba btrfs_release_path(path); 41575d4f98a2SYan Zheng ret = 0; 41585d4f98a2SYan Zheng } 41595d4f98a2SYan Zheng if (ret < 0) { 41603fd0a558SYan, Zheng err = ret; 41615d4f98a2SYan Zheng break; 41625d4f98a2SYan Zheng } 41635d4f98a2SYan Zheng 41645d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 41655d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 41665d4f98a2SYan Zheng if (ret < 0) { 41673fd0a558SYan, Zheng if (ret != -EAGAIN) { 41685d4f98a2SYan Zheng err = ret; 41695d4f98a2SYan Zheng break; 41705d4f98a2SYan Zheng } 41713fd0a558SYan, Zheng rc->extents_found--; 41723fd0a558SYan, Zheng rc->search_start = key.objectid; 41733fd0a558SYan, Zheng } 41745d4f98a2SYan Zheng } 41755d4f98a2SYan Zheng 41763a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 41772ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 41783fd0a558SYan, Zheng trans = NULL; 41795d4f98a2SYan Zheng 41805d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 41815d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 41825d4f98a2SYan Zheng rc->found_file_extent = 1; 41830257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 41843fd0a558SYan, Zheng &key, &rc->cluster); 41855d4f98a2SYan Zheng if (ret < 0) { 41865d4f98a2SYan Zheng err = ret; 41875d4f98a2SYan Zheng break; 41885d4f98a2SYan Zheng } 41895d4f98a2SYan Zheng } 4190f31ea088SQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 4191f31ea088SQu Wenruo err = -ECANCELED; 4192f31ea088SQu Wenruo break; 4193f31ea088SQu Wenruo } 41945d4f98a2SYan Zheng } 4195c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 419643a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 41979689457bSShilong Wang if (ret == 1) { 4198c87f08caSChris Mason err = 0; 4199c87f08caSChris Mason progress = 0; 4200c87f08caSChris Mason goto restart; 4201c87f08caSChris Mason } 4202c87f08caSChris Mason } 42033fd0a558SYan, Zheng 4204b3b4aa74SDavid Sterba btrfs_release_path(path); 420591166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 42065d4f98a2SYan Zheng 42075d4f98a2SYan Zheng if (trans) { 42083a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 42092ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 42105d4f98a2SYan Zheng } 42115d4f98a2SYan Zheng 42120257bb82SYan, Zheng if (!err) { 42133fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 42143fd0a558SYan, Zheng &rc->cluster); 42150257bb82SYan, Zheng if (ret < 0) 42160257bb82SYan, Zheng err = ret; 42170257bb82SYan, Zheng } 42180257bb82SYan, Zheng 42193fd0a558SYan, Zheng rc->create_reloc_tree = 0; 42203fd0a558SYan, Zheng set_reloc_control(rc); 42210257bb82SYan, Zheng 42223fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 422363f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 42245d4f98a2SYan Zheng 42257f913c7cSQu Wenruo /* 42267f913c7cSQu Wenruo * Even in the case when the relocation is cancelled, we should all go 42277f913c7cSQu Wenruo * through prepare_to_merge() and merge_reloc_roots(). 42287f913c7cSQu Wenruo * 42297f913c7cSQu Wenruo * For error (including cancelled balance), prepare_to_merge() will 42307f913c7cSQu Wenruo * mark all reloc trees orphan, then queue them for cleanup in 42317f913c7cSQu Wenruo * merge_reloc_roots() 42327f913c7cSQu Wenruo */ 42333fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 42345d4f98a2SYan Zheng 42355d4f98a2SYan Zheng merge_reloc_roots(rc); 42365d4f98a2SYan Zheng 42373fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 42385d4f98a2SYan Zheng unset_reloc_control(rc); 423963f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 42405d4f98a2SYan Zheng 42415d4f98a2SYan Zheng /* get rid of pinned extents */ 42427a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 424362b99540SQu Wenruo if (IS_ERR(trans)) { 42443612b495STsutomu Itoh err = PTR_ERR(trans); 424562b99540SQu Wenruo goto out_free; 424662b99540SQu Wenruo } 42473a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 42486217b0faSJosef Bacik out_free: 4249d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4250d2311e69SQu Wenruo if (ret < 0 && !err) 4251d2311e69SQu Wenruo err = ret; 42522ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 42533fd0a558SYan, Zheng btrfs_free_path(path); 42545d4f98a2SYan Zheng return err; 42555d4f98a2SYan Zheng } 42565d4f98a2SYan Zheng 42575d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 42580257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 42595d4f98a2SYan Zheng { 42605d4f98a2SYan Zheng struct btrfs_path *path; 42615d4f98a2SYan Zheng struct btrfs_inode_item *item; 42625d4f98a2SYan Zheng struct extent_buffer *leaf; 42635d4f98a2SYan Zheng int ret; 42645d4f98a2SYan Zheng 42655d4f98a2SYan Zheng path = btrfs_alloc_path(); 42665d4f98a2SYan Zheng if (!path) 42675d4f98a2SYan Zheng return -ENOMEM; 42685d4f98a2SYan Zheng 42695d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 42705d4f98a2SYan Zheng if (ret) 42715d4f98a2SYan Zheng goto out; 42725d4f98a2SYan Zheng 42735d4f98a2SYan Zheng leaf = path->nodes[0]; 42745d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 4275b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 42765d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 42770257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 42785d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 42793fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 42803fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 42815d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 42825d4f98a2SYan Zheng out: 42835d4f98a2SYan Zheng btrfs_free_path(path); 42845d4f98a2SYan Zheng return ret; 42855d4f98a2SYan Zheng } 42865d4f98a2SYan Zheng 42875d4f98a2SYan Zheng /* 42885d4f98a2SYan Zheng * helper to create inode for data relocation. 42895d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 42905d4f98a2SYan Zheng */ 42913fd0a558SYan, Zheng static noinline_for_stack 42923fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 429332da5386SDavid Sterba struct btrfs_block_group *group) 42945d4f98a2SYan Zheng { 42955d4f98a2SYan Zheng struct inode *inode = NULL; 42965d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 42975d4f98a2SYan Zheng struct btrfs_root *root; 42985d4f98a2SYan Zheng struct btrfs_key key; 42994624900dSZhaolei u64 objectid; 43005d4f98a2SYan Zheng int err = 0; 43015d4f98a2SYan Zheng 43025d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 43035d4f98a2SYan Zheng if (IS_ERR(root)) 43045d4f98a2SYan Zheng return ERR_CAST(root); 43055d4f98a2SYan Zheng 4306a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 430776deacf0SJosef Bacik if (IS_ERR(trans)) { 430800246528SJosef Bacik btrfs_put_root(root); 43093fd0a558SYan, Zheng return ERR_CAST(trans); 431076deacf0SJosef Bacik } 43115d4f98a2SYan Zheng 4312581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 43135d4f98a2SYan Zheng if (err) 43145d4f98a2SYan Zheng goto out; 43155d4f98a2SYan Zheng 43160257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 43175d4f98a2SYan Zheng BUG_ON(err); 43185d4f98a2SYan Zheng 43195d4f98a2SYan Zheng key.objectid = objectid; 43205d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 43215d4f98a2SYan Zheng key.offset = 0; 43224c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 43232e19f1f9SAl Viro BUG_ON(IS_ERR(inode)); 4324b3470b5dSDavid Sterba BTRFS_I(inode)->index_cnt = group->start; 43255d4f98a2SYan Zheng 432673f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 43275d4f98a2SYan Zheng out: 432800246528SJosef Bacik btrfs_put_root(root); 43293a45bb20SJeff Mahoney btrfs_end_transaction(trans); 43302ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 43315d4f98a2SYan Zheng if (err) { 43325d4f98a2SYan Zheng if (inode) 43335d4f98a2SYan Zheng iput(inode); 43345d4f98a2SYan Zheng inode = ERR_PTR(err); 43355d4f98a2SYan Zheng } 43365d4f98a2SYan Zheng return inode; 43375d4f98a2SYan Zheng } 43385d4f98a2SYan Zheng 4339c258d6e3SQu Wenruo static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 43403fd0a558SYan, Zheng { 43413fd0a558SYan, Zheng struct reloc_control *rc; 43423fd0a558SYan, Zheng 43433fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 43443fd0a558SYan, Zheng if (!rc) 43453fd0a558SYan, Zheng return NULL; 43463fd0a558SYan, Zheng 43473fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 4348d2311e69SQu Wenruo INIT_LIST_HEAD(&rc->dirty_subvol_roots); 43492433bea5SQu Wenruo backref_cache_init(fs_info, &rc->backref_cache, 1); 43503fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 435143eb5f29SQu Wenruo extent_io_tree_init(fs_info, &rc->processed_blocks, 435243eb5f29SQu Wenruo IO_TREE_RELOC_BLOCKS, NULL); 43533fd0a558SYan, Zheng return rc; 43543fd0a558SYan, Zheng } 43553fd0a558SYan, Zheng 43561a0afa0eSJosef Bacik static void free_reloc_control(struct reloc_control *rc) 43571a0afa0eSJosef Bacik { 43581a0afa0eSJosef Bacik struct mapping_node *node, *tmp; 43591a0afa0eSJosef Bacik 43601a0afa0eSJosef Bacik free_reloc_roots(&rc->reloc_roots); 43611a0afa0eSJosef Bacik rbtree_postorder_for_each_entry_safe(node, tmp, 43621a0afa0eSJosef Bacik &rc->reloc_root_tree.rb_root, rb_node) 43631a0afa0eSJosef Bacik kfree(node); 43641a0afa0eSJosef Bacik 43651a0afa0eSJosef Bacik kfree(rc); 43661a0afa0eSJosef Bacik } 43671a0afa0eSJosef Bacik 43685d4f98a2SYan Zheng /* 4369ebce0e01SAdam Borowski * Print the block group being relocated 4370ebce0e01SAdam Borowski */ 4371ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 437232da5386SDavid Sterba struct btrfs_block_group *block_group) 4373ebce0e01SAdam Borowski { 4374f89e09cfSAnand Jain char buf[128] = {'\0'}; 4375ebce0e01SAdam Borowski 4376f89e09cfSAnand Jain btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); 4377ebce0e01SAdam Borowski 4378ebce0e01SAdam Borowski btrfs_info(fs_info, 4379ebce0e01SAdam Borowski "relocating block group %llu flags %s", 4380b3470b5dSDavid Sterba block_group->start, buf); 4381ebce0e01SAdam Borowski } 4382ebce0e01SAdam Borowski 4383430640e3SQu Wenruo static const char *stage_to_string(int stage) 4384430640e3SQu Wenruo { 4385430640e3SQu Wenruo if (stage == MOVE_DATA_EXTENTS) 4386430640e3SQu Wenruo return "move data extents"; 4387430640e3SQu Wenruo if (stage == UPDATE_DATA_PTRS) 4388430640e3SQu Wenruo return "update data pointers"; 4389430640e3SQu Wenruo return "unknown"; 4390430640e3SQu Wenruo } 4391430640e3SQu Wenruo 4392ebce0e01SAdam Borowski /* 43935d4f98a2SYan Zheng * function to relocate all extents in a block group. 43945d4f98a2SYan Zheng */ 43956bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 43965d4f98a2SYan Zheng { 439732da5386SDavid Sterba struct btrfs_block_group *bg; 43986bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 43995d4f98a2SYan Zheng struct reloc_control *rc; 44000af3d00bSJosef Bacik struct inode *inode; 44010af3d00bSJosef Bacik struct btrfs_path *path; 44025d4f98a2SYan Zheng int ret; 4403f0486c68SYan, Zheng int rw = 0; 44045d4f98a2SYan Zheng int err = 0; 44055d4f98a2SYan Zheng 4406eede2bf3SOmar Sandoval bg = btrfs_lookup_block_group(fs_info, group_start); 4407eede2bf3SOmar Sandoval if (!bg) 4408eede2bf3SOmar Sandoval return -ENOENT; 4409eede2bf3SOmar Sandoval 4410eede2bf3SOmar Sandoval if (btrfs_pinned_by_swapfile(fs_info, bg)) { 4411eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 4412eede2bf3SOmar Sandoval return -ETXTBSY; 4413eede2bf3SOmar Sandoval } 4414eede2bf3SOmar Sandoval 4415c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 4416eede2bf3SOmar Sandoval if (!rc) { 4417eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 44185d4f98a2SYan Zheng return -ENOMEM; 4419eede2bf3SOmar Sandoval } 44205d4f98a2SYan Zheng 4421f0486c68SYan, Zheng rc->extent_root = extent_root; 4422eede2bf3SOmar Sandoval rc->block_group = bg; 44235d4f98a2SYan Zheng 4424b12de528SQu Wenruo ret = btrfs_inc_block_group_ro(rc->block_group, true); 4425f0486c68SYan, Zheng if (ret) { 4426f0486c68SYan, Zheng err = ret; 4427f0486c68SYan, Zheng goto out; 4428f0486c68SYan, Zheng } 4429f0486c68SYan, Zheng rw = 1; 4430f0486c68SYan, Zheng 44310af3d00bSJosef Bacik path = btrfs_alloc_path(); 44320af3d00bSJosef Bacik if (!path) { 44330af3d00bSJosef Bacik err = -ENOMEM; 44340af3d00bSJosef Bacik goto out; 44350af3d00bSJosef Bacik } 44360af3d00bSJosef Bacik 44377949f339SDavid Sterba inode = lookup_free_space_inode(rc->block_group, path); 44380af3d00bSJosef Bacik btrfs_free_path(path); 44390af3d00bSJosef Bacik 44400af3d00bSJosef Bacik if (!IS_ERR(inode)) 44411bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 44420af3d00bSJosef Bacik else 44430af3d00bSJosef Bacik ret = PTR_ERR(inode); 44440af3d00bSJosef Bacik 44450af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 44460af3d00bSJosef Bacik err = ret; 44470af3d00bSJosef Bacik goto out; 44480af3d00bSJosef Bacik } 44490af3d00bSJosef Bacik 44505d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 44515d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 44525d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 44535d4f98a2SYan Zheng rc->data_inode = NULL; 44545d4f98a2SYan Zheng goto out; 44555d4f98a2SYan Zheng } 44565d4f98a2SYan Zheng 44570b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 44585d4f98a2SYan Zheng 44599cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4460f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 44616374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 4462b3470b5dSDavid Sterba rc->block_group->start, 4463b3470b5dSDavid Sterba rc->block_group->length); 44645d4f98a2SYan Zheng 44655d4f98a2SYan Zheng while (1) { 4466430640e3SQu Wenruo int finishes_stage; 4467430640e3SQu Wenruo 446876dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 44695d4f98a2SYan Zheng ret = relocate_block_group(rc); 447076dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 4471ff612ba7SJosef Bacik if (ret < 0) 44725d4f98a2SYan Zheng err = ret; 4473ff612ba7SJosef Bacik 4474430640e3SQu Wenruo finishes_stage = rc->stage; 4475ff612ba7SJosef Bacik /* 4476ff612ba7SJosef Bacik * We may have gotten ENOSPC after we already dirtied some 4477ff612ba7SJosef Bacik * extents. If writeout happens while we're relocating a 4478ff612ba7SJosef Bacik * different block group we could end up hitting the 4479ff612ba7SJosef Bacik * BUG_ON(rc->stage == UPDATE_DATA_PTRS) in 4480ff612ba7SJosef Bacik * btrfs_reloc_cow_block. Make sure we write everything out 4481ff612ba7SJosef Bacik * properly so we don't trip over this problem, and then break 4482ff612ba7SJosef Bacik * out of the loop if we hit an error. 4483ff612ba7SJosef Bacik */ 4484ff612ba7SJosef Bacik if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 4485ff612ba7SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 4486ff612ba7SJosef Bacik (u64)-1); 4487ff612ba7SJosef Bacik if (ret) 4488ff612ba7SJosef Bacik err = ret; 4489ff612ba7SJosef Bacik invalidate_mapping_pages(rc->data_inode->i_mapping, 4490ff612ba7SJosef Bacik 0, -1); 4491ff612ba7SJosef Bacik rc->stage = UPDATE_DATA_PTRS; 44925d4f98a2SYan Zheng } 44935d4f98a2SYan Zheng 4494ff612ba7SJosef Bacik if (err < 0) 4495ff612ba7SJosef Bacik goto out; 4496ff612ba7SJosef Bacik 44975d4f98a2SYan Zheng if (rc->extents_found == 0) 44985d4f98a2SYan Zheng break; 44995d4f98a2SYan Zheng 4500430640e3SQu Wenruo btrfs_info(fs_info, "found %llu extents, stage: %s", 4501430640e3SQu Wenruo rc->extents_found, stage_to_string(finishes_stage)); 45025d4f98a2SYan Zheng } 45035d4f98a2SYan Zheng 45045d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 45055d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 4506bf38be65SDavid Sterba WARN_ON(rc->block_group->used > 0); 45075d4f98a2SYan Zheng out: 4508f0486c68SYan, Zheng if (err && rw) 45092ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 45105d4f98a2SYan Zheng iput(rc->data_inode); 45115d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 45121a0afa0eSJosef Bacik free_reloc_control(rc); 45135d4f98a2SYan Zheng return err; 45145d4f98a2SYan Zheng } 45155d4f98a2SYan Zheng 451676dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 451776dda93cSYan, Zheng { 45180b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 451976dda93cSYan, Zheng struct btrfs_trans_handle *trans; 452079787eaaSJeff Mahoney int ret, err; 452176dda93cSYan, Zheng 45220b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 452379787eaaSJeff Mahoney if (IS_ERR(trans)) 452479787eaaSJeff Mahoney return PTR_ERR(trans); 452576dda93cSYan, Zheng 452676dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 452776dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 452876dda93cSYan, Zheng root->root_item.drop_level = 0; 452976dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 45300b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 453176dda93cSYan, Zheng &root->root_key, &root->root_item); 453276dda93cSYan, Zheng 45333a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 453479787eaaSJeff Mahoney if (err) 453579787eaaSJeff Mahoney return err; 453679787eaaSJeff Mahoney return ret; 453776dda93cSYan, Zheng } 453876dda93cSYan, Zheng 45395d4f98a2SYan Zheng /* 45405d4f98a2SYan Zheng * recover relocation interrupted by system crash. 45415d4f98a2SYan Zheng * 45425d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 45435d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 45445d4f98a2SYan Zheng */ 45455d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 45465d4f98a2SYan Zheng { 45470b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 45485d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 45495d4f98a2SYan Zheng struct btrfs_key key; 45505d4f98a2SYan Zheng struct btrfs_root *fs_root; 45515d4f98a2SYan Zheng struct btrfs_root *reloc_root; 45525d4f98a2SYan Zheng struct btrfs_path *path; 45535d4f98a2SYan Zheng struct extent_buffer *leaf; 45545d4f98a2SYan Zheng struct reloc_control *rc = NULL; 45555d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 45565d4f98a2SYan Zheng int ret; 45575d4f98a2SYan Zheng int err = 0; 45585d4f98a2SYan Zheng 45595d4f98a2SYan Zheng path = btrfs_alloc_path(); 45605d4f98a2SYan Zheng if (!path) 45615d4f98a2SYan Zheng return -ENOMEM; 4562e4058b54SDavid Sterba path->reada = READA_BACK; 45635d4f98a2SYan Zheng 45645d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 45655d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 45665d4f98a2SYan Zheng key.offset = (u64)-1; 45675d4f98a2SYan Zheng 45685d4f98a2SYan Zheng while (1) { 45690b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 45705d4f98a2SYan Zheng path, 0, 0); 45715d4f98a2SYan Zheng if (ret < 0) { 45725d4f98a2SYan Zheng err = ret; 45735d4f98a2SYan Zheng goto out; 45745d4f98a2SYan Zheng } 45755d4f98a2SYan Zheng if (ret > 0) { 45765d4f98a2SYan Zheng if (path->slots[0] == 0) 45775d4f98a2SYan Zheng break; 45785d4f98a2SYan Zheng path->slots[0]--; 45795d4f98a2SYan Zheng } 45805d4f98a2SYan Zheng leaf = path->nodes[0]; 45815d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4582b3b4aa74SDavid Sterba btrfs_release_path(path); 45835d4f98a2SYan Zheng 45845d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 45855d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 45865d4f98a2SYan Zheng break; 45875d4f98a2SYan Zheng 45883dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(root, &key); 45895d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 45905d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 45915d4f98a2SYan Zheng goto out; 45925d4f98a2SYan Zheng } 45935d4f98a2SYan Zheng 45943dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 45955d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 45965d4f98a2SYan Zheng 45975d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 45980b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, 45995d4f98a2SYan Zheng reloc_root->root_key.offset); 46005d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 460176dda93cSYan, Zheng ret = PTR_ERR(fs_root); 460276dda93cSYan, Zheng if (ret != -ENOENT) { 460376dda93cSYan, Zheng err = ret; 46045d4f98a2SYan Zheng goto out; 46055d4f98a2SYan Zheng } 460679787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 460779787eaaSJeff Mahoney if (ret < 0) { 460879787eaaSJeff Mahoney err = ret; 460979787eaaSJeff Mahoney goto out; 461079787eaaSJeff Mahoney } 4611932fd26dSJosef Bacik } else { 461200246528SJosef Bacik btrfs_put_root(fs_root); 461376dda93cSYan, Zheng } 46145d4f98a2SYan Zheng } 46155d4f98a2SYan Zheng 46165d4f98a2SYan Zheng if (key.offset == 0) 46175d4f98a2SYan Zheng break; 46185d4f98a2SYan Zheng 46195d4f98a2SYan Zheng key.offset--; 46205d4f98a2SYan Zheng } 4621b3b4aa74SDavid Sterba btrfs_release_path(path); 46225d4f98a2SYan Zheng 46235d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 46245d4f98a2SYan Zheng goto out; 46255d4f98a2SYan Zheng 4626c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 46275d4f98a2SYan Zheng if (!rc) { 46285d4f98a2SYan Zheng err = -ENOMEM; 46295d4f98a2SYan Zheng goto out; 46305d4f98a2SYan Zheng } 46315d4f98a2SYan Zheng 46320b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 46335d4f98a2SYan Zheng 46345d4f98a2SYan Zheng set_reloc_control(rc); 46355d4f98a2SYan Zheng 46367a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 46373612b495STsutomu Itoh if (IS_ERR(trans)) { 46383612b495STsutomu Itoh err = PTR_ERR(trans); 4639fb2d83eeSJosef Bacik goto out_unset; 46403612b495STsutomu Itoh } 46413fd0a558SYan, Zheng 46423fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 46433fd0a558SYan, Zheng 46445d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 46455d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 46465d4f98a2SYan Zheng struct btrfs_root, root_list); 46475d4f98a2SYan Zheng list_del(&reloc_root->root_list); 46485d4f98a2SYan Zheng 46495d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 46505d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 46515d4f98a2SYan Zheng &rc->reloc_roots); 46525d4f98a2SYan Zheng continue; 46535d4f98a2SYan Zheng } 46545d4f98a2SYan Zheng 46550b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, reloc_root->root_key.offset); 465679787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 465779787eaaSJeff Mahoney err = PTR_ERR(fs_root); 4658ca1aa281SJosef Bacik list_add_tail(&reloc_root->root_list, &reloc_roots); 46591402d17dSXiyu Yang btrfs_end_transaction(trans); 4660fb2d83eeSJosef Bacik goto out_unset; 466179787eaaSJeff Mahoney } 46625d4f98a2SYan Zheng 4663ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 466479787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 4665f44deb74SJosef Bacik fs_root->reloc_root = btrfs_grab_root(reloc_root); 466600246528SJosef Bacik btrfs_put_root(fs_root); 46675d4f98a2SYan Zheng } 46685d4f98a2SYan Zheng 46693a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 467079787eaaSJeff Mahoney if (err) 4671fb2d83eeSJosef Bacik goto out_unset; 46725d4f98a2SYan Zheng 46735d4f98a2SYan Zheng merge_reloc_roots(rc); 46745d4f98a2SYan Zheng 46755d4f98a2SYan Zheng unset_reloc_control(rc); 46765d4f98a2SYan Zheng 46777a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 467862b99540SQu Wenruo if (IS_ERR(trans)) { 46793612b495STsutomu Itoh err = PTR_ERR(trans); 46806217b0faSJosef Bacik goto out_clean; 468162b99540SQu Wenruo } 46823a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 46836217b0faSJosef Bacik out_clean: 4684d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4685d2311e69SQu Wenruo if (ret < 0 && !err) 4686d2311e69SQu Wenruo err = ret; 4687fb2d83eeSJosef Bacik out_unset: 4688fb2d83eeSJosef Bacik unset_reloc_control(rc); 46891a0afa0eSJosef Bacik free_reloc_control(rc); 46903612b495STsutomu Itoh out: 4691aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4692aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4693aca1bba6SLiu Bo 46945d4f98a2SYan Zheng btrfs_free_path(path); 46955d4f98a2SYan Zheng 46965d4f98a2SYan Zheng if (err == 0) { 46975d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 46980b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 4699932fd26dSJosef Bacik if (IS_ERR(fs_root)) { 47005d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4701932fd26dSJosef Bacik } else { 470266b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 470300246528SJosef Bacik btrfs_put_root(fs_root); 4704932fd26dSJosef Bacik } 4705932fd26dSJosef Bacik } 47065d4f98a2SYan Zheng return err; 47075d4f98a2SYan Zheng } 47085d4f98a2SYan Zheng 47095d4f98a2SYan Zheng /* 47105d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 47115d4f98a2SYan Zheng * 47125d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 47135d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 47145d4f98a2SYan Zheng */ 47155d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 47165d4f98a2SYan Zheng { 47170b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 47185d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 47195d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 47205d4f98a2SYan Zheng int ret; 47215d4f98a2SYan Zheng u64 disk_bytenr; 47224577b014SJosef Bacik u64 new_bytenr; 47235d4f98a2SYan Zheng LIST_HEAD(list); 47245d4f98a2SYan Zheng 47255d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 4726bffe633eSOmar Sandoval BUG_ON(ordered->file_offset != file_pos || ordered->num_bytes != len); 47275d4f98a2SYan Zheng 47285d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 47290b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4730a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 473179787eaaSJeff Mahoney if (ret) 473279787eaaSJeff Mahoney goto out; 47335d4f98a2SYan Zheng 47345d4f98a2SYan Zheng while (!list_empty(&list)) { 47355d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 47365d4f98a2SYan Zheng list_del_init(&sums->list); 47375d4f98a2SYan Zheng 47384577b014SJosef Bacik /* 47394577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 47404577b014SJosef Bacik * We need to do this because we will read in entire prealloc 47414577b014SJosef Bacik * extents but we may have written to say the middle of the 47424577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 47434577b014SJosef Bacik * the right disk offset. 47444577b014SJosef Bacik * 47454577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 47464577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 47474577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 47484577b014SJosef Bacik * disk length. 47494577b014SJosef Bacik */ 4750bffe633eSOmar Sandoval new_bytenr = ordered->disk_bytenr + sums->bytenr - disk_bytenr; 47514577b014SJosef Bacik sums->bytenr = new_bytenr; 47525d4f98a2SYan Zheng 4753f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 47545d4f98a2SYan Zheng } 475579787eaaSJeff Mahoney out: 47565d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4757411fc6bcSAndi Kleen return ret; 47585d4f98a2SYan Zheng } 47593fd0a558SYan, Zheng 476083d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 47613fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 47623fd0a558SYan, Zheng struct extent_buffer *cow) 47633fd0a558SYan, Zheng { 47640b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 47653fd0a558SYan, Zheng struct reloc_control *rc; 47663fd0a558SYan, Zheng struct backref_node *node; 47673fd0a558SYan, Zheng int first_cow = 0; 47683fd0a558SYan, Zheng int level; 476983d4cfd4SJosef Bacik int ret = 0; 47703fd0a558SYan, Zheng 47710b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 47723fd0a558SYan, Zheng if (!rc) 477383d4cfd4SJosef Bacik return 0; 47743fd0a558SYan, Zheng 47753fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 47763fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 47773fd0a558SYan, Zheng 47783fd0a558SYan, Zheng level = btrfs_header_level(buf); 47793fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 47803fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 47813fd0a558SYan, Zheng first_cow = 1; 47823fd0a558SYan, Zheng 47833fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 47843fd0a558SYan, Zheng rc->create_reloc_tree) { 47853fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 47863fd0a558SYan, Zheng 47873fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 47883fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 47893fd0a558SYan, Zheng node->new_bytenr != buf->start); 47903fd0a558SYan, Zheng 47913fd0a558SYan, Zheng drop_node_buffer(node); 479267439dadSDavid Sterba atomic_inc(&cow->refs); 47933fd0a558SYan, Zheng node->eb = cow; 47943fd0a558SYan, Zheng node->new_bytenr = cow->start; 47953fd0a558SYan, Zheng 47963fd0a558SYan, Zheng if (!node->pending) { 47973fd0a558SYan, Zheng list_move_tail(&node->list, 47983fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 47993fd0a558SYan, Zheng node->pending = 1; 48003fd0a558SYan, Zheng } 48013fd0a558SYan, Zheng 48023fd0a558SYan, Zheng if (first_cow) 48039569cc20SQu Wenruo mark_block_processed(rc, node); 48043fd0a558SYan, Zheng 48053fd0a558SYan, Zheng if (first_cow && level > 0) 48063fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 48073fd0a558SYan, Zheng } 48083fd0a558SYan, Zheng 480983d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 48103fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 481183d4cfd4SJosef Bacik return ret; 48123fd0a558SYan, Zheng } 48133fd0a558SYan, Zheng 48143fd0a558SYan, Zheng /* 48153fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 481601327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 48173fd0a558SYan, Zheng */ 4818147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 48193fd0a558SYan, Zheng u64 *bytes_to_reserve) 48203fd0a558SYan, Zheng { 482110995c04SQu Wenruo struct btrfs_root *root = pending->root; 482210995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 48233fd0a558SYan, Zheng 48246282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 48253fd0a558SYan, Zheng return; 48263fd0a558SYan, Zheng 48273fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 48283fd0a558SYan, Zheng return; 48293fd0a558SYan, Zheng 48303fd0a558SYan, Zheng root = root->reloc_root; 48313fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 48323fd0a558SYan, Zheng /* 48333fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 48343fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 48353fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 48363fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 48373fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 48383fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 48393fd0a558SYan, Zheng * tree may use more space than it frees. so we need 48403fd0a558SYan, Zheng * reserve extra space. 48413fd0a558SYan, Zheng */ 48423fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 48433fd0a558SYan, Zheng } 48443fd0a558SYan, Zheng 48453fd0a558SYan, Zheng /* 48463fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 48473fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 4848f44deb74SJosef Bacik * 4849f44deb74SJosef Bacik * This is similar to btrfs_init_reloc_root(), we come out of here with two 4850f44deb74SJosef Bacik * references held on the reloc_root, one for root->reloc_root and one for 4851f44deb74SJosef Bacik * rc->reloc_roots. 48523fd0a558SYan, Zheng */ 485349b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 48543fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 48553fd0a558SYan, Zheng { 48563fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 48573fd0a558SYan, Zheng struct btrfs_root *reloc_root; 48583fd0a558SYan, Zheng struct btrfs_root *new_root; 485910995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 48603fd0a558SYan, Zheng int ret; 48613fd0a558SYan, Zheng 48626282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 486349b25e05SJeff Mahoney return 0; 48643fd0a558SYan, Zheng 48653fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 48663fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 48673fd0a558SYan, Zheng 48683fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 48693fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 48703fd0a558SYan, Zheng rc->block_rsv, 48713a584174SLu Fengqi rc->nodes_relocated, true); 487249b25e05SJeff Mahoney if (ret) 487349b25e05SJeff Mahoney return ret; 48743fd0a558SYan, Zheng } 48753fd0a558SYan, Zheng 48763fd0a558SYan, Zheng new_root = pending->snap; 48773fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 48783fd0a558SYan, Zheng new_root->root_key.objectid); 487949b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 488049b25e05SJeff Mahoney return PTR_ERR(reloc_root); 48813fd0a558SYan, Zheng 4882ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4883ffd7b339SJeff Mahoney BUG_ON(ret < 0); 4884f44deb74SJosef Bacik new_root->reloc_root = btrfs_grab_root(reloc_root); 48853fd0a558SYan, Zheng 488649b25e05SJeff Mahoney if (rc->create_reloc_tree) 48873fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 488849b25e05SJeff Mahoney return ret; 48893fd0a558SYan, Zheng } 4890