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 3423fd0a558SYan, Zheng static struct backref_node *alloc_backref_node(struct backref_cache *cache) 3433fd0a558SYan, Zheng { 3443fd0a558SYan, Zheng struct backref_node *node; 3453fd0a558SYan, Zheng 3463fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 3473fd0a558SYan, Zheng if (node) { 3483fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 3495d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 3505d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 3515d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 3523fd0a558SYan, Zheng cache->nr_nodes++; 3533fd0a558SYan, Zheng } 3543fd0a558SYan, Zheng return node; 3553fd0a558SYan, Zheng } 3563fd0a558SYan, Zheng 3573fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 3583fd0a558SYan, Zheng struct backref_node *node) 3593fd0a558SYan, Zheng { 3603fd0a558SYan, Zheng if (node) { 3613fd0a558SYan, Zheng cache->nr_nodes--; 36200246528SJosef Bacik btrfs_put_root(node->root); 3633fd0a558SYan, Zheng kfree(node); 3643fd0a558SYan, Zheng } 3653fd0a558SYan, Zheng } 3663fd0a558SYan, Zheng 3673fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 3683fd0a558SYan, Zheng { 3693fd0a558SYan, Zheng struct backref_edge *edge; 3703fd0a558SYan, Zheng 3713fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 3723fd0a558SYan, Zheng if (edge) 3733fd0a558SYan, Zheng cache->nr_edges++; 3743fd0a558SYan, Zheng return edge; 3753fd0a558SYan, Zheng } 3763fd0a558SYan, Zheng 3772a979612SQu Wenruo #define LINK_LOWER (1 << 0) 3782a979612SQu Wenruo #define LINK_UPPER (1 << 1) 3792a979612SQu Wenruo static void link_backref_edge(struct backref_edge *edge, 3802a979612SQu Wenruo struct backref_node *lower, 3812a979612SQu Wenruo struct backref_node *upper, 3822a979612SQu Wenruo int link_which) 3832a979612SQu Wenruo { 3842a979612SQu Wenruo ASSERT(upper && lower && upper->level == lower->level + 1); 3852a979612SQu Wenruo edge->node[LOWER] = lower; 3862a979612SQu Wenruo edge->node[UPPER] = upper; 3872a979612SQu Wenruo if (link_which & LINK_LOWER) 3882a979612SQu Wenruo list_add_tail(&edge->list[LOWER], &lower->upper); 3892a979612SQu Wenruo if (link_which & LINK_UPPER) 3902a979612SQu Wenruo list_add_tail(&edge->list[UPPER], &upper->lower); 3912a979612SQu Wenruo } 3922a979612SQu Wenruo 3933fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 3943fd0a558SYan, Zheng struct backref_edge *edge) 3953fd0a558SYan, Zheng { 3963fd0a558SYan, Zheng if (edge) { 3973fd0a558SYan, Zheng cache->nr_edges--; 3983fd0a558SYan, Zheng kfree(edge); 3993fd0a558SYan, Zheng } 4005d4f98a2SYan Zheng } 4015d4f98a2SYan Zheng 4025d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 4035d4f98a2SYan Zheng struct rb_node *node) 4045d4f98a2SYan Zheng { 4055d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 4065d4f98a2SYan Zheng struct rb_node *parent = NULL; 4075d4f98a2SYan Zheng struct tree_entry *entry; 4085d4f98a2SYan Zheng 4095d4f98a2SYan Zheng while (*p) { 4105d4f98a2SYan Zheng parent = *p; 4115d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 4125d4f98a2SYan Zheng 4135d4f98a2SYan Zheng if (bytenr < entry->bytenr) 4145d4f98a2SYan Zheng p = &(*p)->rb_left; 4155d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 4165d4f98a2SYan Zheng p = &(*p)->rb_right; 4175d4f98a2SYan Zheng else 4185d4f98a2SYan Zheng return parent; 4195d4f98a2SYan Zheng } 4205d4f98a2SYan Zheng 4215d4f98a2SYan Zheng rb_link_node(node, parent, p); 4225d4f98a2SYan Zheng rb_insert_color(node, root); 4235d4f98a2SYan Zheng return NULL; 4245d4f98a2SYan Zheng } 4255d4f98a2SYan Zheng 4265d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 4275d4f98a2SYan Zheng { 4285d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 4295d4f98a2SYan Zheng struct tree_entry *entry; 4305d4f98a2SYan Zheng 4315d4f98a2SYan Zheng while (n) { 4325d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 4335d4f98a2SYan Zheng 4345d4f98a2SYan Zheng if (bytenr < entry->bytenr) 4355d4f98a2SYan Zheng n = n->rb_left; 4365d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 4375d4f98a2SYan Zheng n = n->rb_right; 4385d4f98a2SYan Zheng else 4395d4f98a2SYan Zheng return n; 4405d4f98a2SYan Zheng } 4415d4f98a2SYan Zheng return NULL; 4425d4f98a2SYan Zheng } 4435d4f98a2SYan Zheng 44448a3b636SEric Sandeen static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) 44543c04fb1SJeff Mahoney { 44643c04fb1SJeff Mahoney 44743c04fb1SJeff Mahoney struct btrfs_fs_info *fs_info = NULL; 44843c04fb1SJeff Mahoney struct backref_node *bnode = rb_entry(rb_node, struct backref_node, 44943c04fb1SJeff Mahoney rb_node); 45043c04fb1SJeff Mahoney if (bnode->root) 45143c04fb1SJeff Mahoney fs_info = bnode->root->fs_info; 4525d163e0eSJeff Mahoney btrfs_panic(fs_info, errno, 4535d163e0eSJeff Mahoney "Inconsistency in backref cache found at offset %llu", 4545d163e0eSJeff Mahoney bytenr); 45543c04fb1SJeff Mahoney } 45643c04fb1SJeff Mahoney 4575d4f98a2SYan Zheng /* 4585d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 4595d4f98a2SYan Zheng */ 4605d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 4615d4f98a2SYan Zheng struct backref_edge *edges[], 4625d4f98a2SYan Zheng int *index) 4635d4f98a2SYan Zheng { 4645d4f98a2SYan Zheng struct backref_edge *edge; 4655d4f98a2SYan Zheng int idx = *index; 4665d4f98a2SYan Zheng 4675d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4685d4f98a2SYan Zheng edge = list_entry(node->upper.next, 4695d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 4705d4f98a2SYan Zheng edges[idx++] = edge; 4715d4f98a2SYan Zheng node = edge->node[UPPER]; 4725d4f98a2SYan Zheng } 4733fd0a558SYan, Zheng BUG_ON(node->detached); 4745d4f98a2SYan Zheng *index = idx; 4755d4f98a2SYan Zheng return node; 4765d4f98a2SYan Zheng } 4775d4f98a2SYan Zheng 4785d4f98a2SYan Zheng /* 4795d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 4805d4f98a2SYan Zheng */ 4815d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 4825d4f98a2SYan Zheng int *index) 4835d4f98a2SYan Zheng { 4845d4f98a2SYan Zheng struct backref_edge *edge; 4855d4f98a2SYan Zheng struct backref_node *lower; 4865d4f98a2SYan Zheng int idx = *index; 4875d4f98a2SYan Zheng 4885d4f98a2SYan Zheng while (idx > 0) { 4895d4f98a2SYan Zheng edge = edges[idx - 1]; 4905d4f98a2SYan Zheng lower = edge->node[LOWER]; 4915d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 4925d4f98a2SYan Zheng idx--; 4935d4f98a2SYan Zheng continue; 4945d4f98a2SYan Zheng } 4955d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 4965d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 4975d4f98a2SYan Zheng edges[idx - 1] = edge; 4985d4f98a2SYan Zheng *index = idx; 4995d4f98a2SYan Zheng return edge->node[UPPER]; 5005d4f98a2SYan Zheng } 5015d4f98a2SYan Zheng *index = 0; 5025d4f98a2SYan Zheng return NULL; 5035d4f98a2SYan Zheng } 5045d4f98a2SYan Zheng 5053fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 5065d4f98a2SYan Zheng { 5075d4f98a2SYan Zheng if (node->locked) { 5085d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 5095d4f98a2SYan Zheng node->locked = 0; 5105d4f98a2SYan Zheng } 5113fd0a558SYan, Zheng } 5123fd0a558SYan, Zheng 5133fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 5143fd0a558SYan, Zheng { 5153fd0a558SYan, Zheng if (node->eb) { 5163fd0a558SYan, Zheng unlock_node_buffer(node); 5175d4f98a2SYan Zheng free_extent_buffer(node->eb); 5185d4f98a2SYan Zheng node->eb = NULL; 5195d4f98a2SYan Zheng } 5205d4f98a2SYan Zheng } 5215d4f98a2SYan Zheng 5225d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 5235d4f98a2SYan Zheng struct backref_node *node) 5245d4f98a2SYan Zheng { 5255d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 5265d4f98a2SYan Zheng 5275d4f98a2SYan Zheng drop_node_buffer(node); 5283fd0a558SYan, Zheng list_del(&node->list); 5295d4f98a2SYan Zheng list_del(&node->lower); 5303fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 5315d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 5323fd0a558SYan, Zheng free_backref_node(tree, node); 5335d4f98a2SYan Zheng } 5345d4f98a2SYan Zheng 5355d4f98a2SYan Zheng /* 5365d4f98a2SYan Zheng * remove a backref node from the backref cache 5375d4f98a2SYan Zheng */ 5385d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 5395d4f98a2SYan Zheng struct backref_node *node) 5405d4f98a2SYan Zheng { 5415d4f98a2SYan Zheng struct backref_node *upper; 5425d4f98a2SYan Zheng struct backref_edge *edge; 5435d4f98a2SYan Zheng 5445d4f98a2SYan Zheng if (!node) 5455d4f98a2SYan Zheng return; 5465d4f98a2SYan Zheng 5473fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 5485d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 5495d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 5505d4f98a2SYan Zheng list[LOWER]); 5515d4f98a2SYan Zheng upper = edge->node[UPPER]; 5525d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 5535d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 5543fd0a558SYan, Zheng free_backref_edge(cache, edge); 5553fd0a558SYan, Zheng 5563fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 5573fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 5583fd0a558SYan, Zheng drop_backref_node(cache, node); 5593fd0a558SYan, Zheng node = upper; 5603fd0a558SYan, Zheng node->lowest = 1; 5613fd0a558SYan, Zheng continue; 5623fd0a558SYan, Zheng } 5635d4f98a2SYan Zheng /* 5643fd0a558SYan, Zheng * add the node to leaf node list if no other 5655d4f98a2SYan Zheng * child block cached. 5665d4f98a2SYan Zheng */ 5675d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 5683fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 5695d4f98a2SYan Zheng upper->lowest = 1; 5705d4f98a2SYan Zheng } 5715d4f98a2SYan Zheng } 5723fd0a558SYan, Zheng 5735d4f98a2SYan Zheng drop_backref_node(cache, node); 5745d4f98a2SYan Zheng } 5755d4f98a2SYan Zheng 5763fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 5773fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 5783fd0a558SYan, Zheng { 5793fd0a558SYan, Zheng struct rb_node *rb_node; 5803fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 5813fd0a558SYan, Zheng node->bytenr = bytenr; 5823fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 58343c04fb1SJeff Mahoney if (rb_node) 58443c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, bytenr); 5853fd0a558SYan, Zheng } 5863fd0a558SYan, Zheng 5873fd0a558SYan, Zheng /* 5883fd0a558SYan, Zheng * update backref cache after a transaction commit 5893fd0a558SYan, Zheng */ 5903fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 5913fd0a558SYan, Zheng struct backref_cache *cache) 5923fd0a558SYan, Zheng { 5933fd0a558SYan, Zheng struct backref_node *node; 5943fd0a558SYan, Zheng int level = 0; 5953fd0a558SYan, Zheng 5963fd0a558SYan, Zheng if (cache->last_trans == 0) { 5973fd0a558SYan, Zheng cache->last_trans = trans->transid; 5983fd0a558SYan, Zheng return 0; 5993fd0a558SYan, Zheng } 6003fd0a558SYan, Zheng 6013fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 6023fd0a558SYan, Zheng return 0; 6033fd0a558SYan, Zheng 6043fd0a558SYan, Zheng /* 6053fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 6063fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 6073fd0a558SYan, Zheng * so the detached nodes are no longer useful. 6083fd0a558SYan, Zheng */ 6093fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 6103fd0a558SYan, Zheng node = list_entry(cache->detached.next, 6113fd0a558SYan, Zheng struct backref_node, list); 6123fd0a558SYan, Zheng remove_backref_node(cache, node); 6133fd0a558SYan, Zheng } 6143fd0a558SYan, Zheng 6153fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 6163fd0a558SYan, Zheng node = list_entry(cache->changed.next, 6173fd0a558SYan, Zheng struct backref_node, list); 6183fd0a558SYan, Zheng list_del_init(&node->list); 6193fd0a558SYan, Zheng BUG_ON(node->pending); 6203fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 6213fd0a558SYan, Zheng } 6223fd0a558SYan, Zheng 6233fd0a558SYan, Zheng /* 6243fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 6253fd0a558SYan, Zheng * errors during processing the pending nodes. 6263fd0a558SYan, Zheng */ 6273fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 6283fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 6293fd0a558SYan, Zheng BUG_ON(!node->pending); 6303fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 6313fd0a558SYan, Zheng continue; 6323fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 6333fd0a558SYan, Zheng } 6343fd0a558SYan, Zheng } 6353fd0a558SYan, Zheng 6363fd0a558SYan, Zheng cache->last_trans = 0; 6373fd0a558SYan, Zheng return 1; 6383fd0a558SYan, Zheng } 6393fd0a558SYan, Zheng 6406282675eSQu Wenruo static bool reloc_root_is_dead(struct btrfs_root *root) 6416282675eSQu Wenruo { 6426282675eSQu Wenruo /* 6436282675eSQu Wenruo * Pair with set_bit/clear_bit in clean_dirty_subvols and 6446282675eSQu Wenruo * btrfs_update_reloc_root. We need to see the updated bit before 6456282675eSQu Wenruo * trying to access reloc_root 6466282675eSQu Wenruo */ 6476282675eSQu Wenruo smp_rmb(); 6486282675eSQu Wenruo if (test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state)) 6496282675eSQu Wenruo return true; 6506282675eSQu Wenruo return false; 6516282675eSQu Wenruo } 6526282675eSQu Wenruo 6536282675eSQu Wenruo /* 6546282675eSQu Wenruo * Check if this subvolume tree has valid reloc tree. 6556282675eSQu Wenruo * 6566282675eSQu Wenruo * Reloc tree after swap is considered dead, thus not considered as valid. 6576282675eSQu Wenruo * This is enough for most callers, as they don't distinguish dead reloc root 6586282675eSQu Wenruo * from no reloc root. But should_ignore_root() below is a special case. 6596282675eSQu Wenruo */ 6606282675eSQu Wenruo static bool have_reloc_root(struct btrfs_root *root) 6616282675eSQu Wenruo { 6626282675eSQu Wenruo if (reloc_root_is_dead(root)) 6636282675eSQu Wenruo return false; 6646282675eSQu Wenruo if (!root->reloc_root) 6656282675eSQu Wenruo return false; 6666282675eSQu Wenruo return true; 6676282675eSQu Wenruo } 668f2a97a9dSDavid Sterba 6693fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 6703fd0a558SYan, Zheng { 6713fd0a558SYan, Zheng struct btrfs_root *reloc_root; 6723fd0a558SYan, Zheng 67327cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 6743fd0a558SYan, Zheng return 0; 6753fd0a558SYan, Zheng 6766282675eSQu Wenruo /* This root has been merged with its reloc tree, we can ignore it */ 6776282675eSQu Wenruo if (reloc_root_is_dead(root)) 6786282675eSQu Wenruo return 1; 6796282675eSQu Wenruo 6803fd0a558SYan, Zheng reloc_root = root->reloc_root; 6813fd0a558SYan, Zheng if (!reloc_root) 6823fd0a558SYan, Zheng return 0; 6833fd0a558SYan, Zheng 6844d4225fcSJosef Bacik if (btrfs_header_generation(reloc_root->commit_root) == 6854d4225fcSJosef Bacik root->fs_info->running_transaction->transid) 6863fd0a558SYan, Zheng return 0; 6873fd0a558SYan, Zheng /* 6883fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 6893fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 6903fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 6913fd0a558SYan, Zheng * relocation. 6923fd0a558SYan, Zheng */ 6933fd0a558SYan, Zheng return 1; 6943fd0a558SYan, Zheng } 6955d4f98a2SYan Zheng /* 6965d4f98a2SYan Zheng * find reloc tree by address of tree root 6975d4f98a2SYan Zheng */ 6982433bea5SQu Wenruo struct btrfs_root *find_reloc_root(struct btrfs_fs_info *fs_info, u64 bytenr) 6995d4f98a2SYan Zheng { 7002433bea5SQu Wenruo struct reloc_control *rc = fs_info->reloc_ctl; 7015d4f98a2SYan Zheng struct rb_node *rb_node; 7025d4f98a2SYan Zheng struct mapping_node *node; 7035d4f98a2SYan Zheng struct btrfs_root *root = NULL; 7045d4f98a2SYan Zheng 7052433bea5SQu Wenruo ASSERT(rc); 7065d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 7075d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 7085d4f98a2SYan Zheng if (rb_node) { 7095d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 7105d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 7115d4f98a2SYan Zheng } 7125d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 71300246528SJosef Bacik return btrfs_grab_root(root); 7145d4f98a2SYan Zheng } 7155d4f98a2SYan Zheng 7165d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 7175d4f98a2SYan Zheng u64 root_objectid) 7185d4f98a2SYan Zheng { 7195d4f98a2SYan Zheng struct btrfs_key key; 7205d4f98a2SYan Zheng 7215d4f98a2SYan Zheng key.objectid = root_objectid; 7225d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 7235d4f98a2SYan Zheng key.offset = (u64)-1; 7245d4f98a2SYan Zheng 725bc44d7c4SJosef Bacik return btrfs_get_fs_root(fs_info, &key, false); 7265d4f98a2SYan Zheng } 7275d4f98a2SYan Zheng 7285d4f98a2SYan Zheng /* 7294007ea87SQu Wenruo * Handle direct tree backref 7304007ea87SQu Wenruo * 7314007ea87SQu Wenruo * Direct tree backref means, the backref item shows its parent bytenr 7324007ea87SQu Wenruo * directly. This is for SHARED_BLOCK_REF backref (keyed or inlined). 7334007ea87SQu Wenruo * 7344007ea87SQu Wenruo * @ref_key: The converted backref key. 7354007ea87SQu Wenruo * For keyed backref, it's the item key. 7364007ea87SQu Wenruo * For inlined backref, objectid is the bytenr, 7374007ea87SQu Wenruo * type is btrfs_inline_ref_type, offset is 7384007ea87SQu Wenruo * btrfs_inline_ref_offset. 7394007ea87SQu Wenruo */ 7404007ea87SQu Wenruo static int handle_direct_tree_backref(struct backref_cache *cache, 7414007ea87SQu Wenruo struct btrfs_key *ref_key, 7424007ea87SQu Wenruo struct backref_node *cur) 7434007ea87SQu Wenruo { 7444007ea87SQu Wenruo struct backref_edge *edge; 7454007ea87SQu Wenruo struct backref_node *upper; 7464007ea87SQu Wenruo struct rb_node *rb_node; 7474007ea87SQu Wenruo 7484007ea87SQu Wenruo ASSERT(ref_key->type == BTRFS_SHARED_BLOCK_REF_KEY); 7494007ea87SQu Wenruo 7504007ea87SQu Wenruo /* Only reloc root uses backref pointing to itself */ 7514007ea87SQu Wenruo if (ref_key->objectid == ref_key->offset) { 7524007ea87SQu Wenruo struct btrfs_root *root; 7534007ea87SQu Wenruo 7544007ea87SQu Wenruo cur->is_reloc_root = 1; 7554007ea87SQu Wenruo /* Only reloc backref cache cares about a specific root */ 7564007ea87SQu Wenruo if (cache->is_reloc) { 7574007ea87SQu Wenruo root = find_reloc_root(cache->fs_info, cur->bytenr); 7584007ea87SQu Wenruo if (WARN_ON(!root)) 7594007ea87SQu Wenruo return -ENOENT; 7604007ea87SQu Wenruo cur->root = root; 7614007ea87SQu Wenruo } else { 7624007ea87SQu Wenruo /* 7634007ea87SQu Wenruo * For generic purpose backref cache, reloc root node 7644007ea87SQu Wenruo * is useless. 7654007ea87SQu Wenruo */ 7664007ea87SQu Wenruo list_add(&cur->list, &cache->useless_node); 7674007ea87SQu Wenruo } 7684007ea87SQu Wenruo return 0; 7694007ea87SQu Wenruo } 7704007ea87SQu Wenruo 7714007ea87SQu Wenruo edge = alloc_backref_edge(cache); 7724007ea87SQu Wenruo if (!edge) 7734007ea87SQu Wenruo return -ENOMEM; 7744007ea87SQu Wenruo 7754007ea87SQu Wenruo rb_node = tree_search(&cache->rb_root, ref_key->offset); 7764007ea87SQu Wenruo if (!rb_node) { 7774007ea87SQu Wenruo /* Parent node not yet cached */ 7784007ea87SQu Wenruo upper = alloc_backref_node(cache); 7794007ea87SQu Wenruo if (!upper) { 7804007ea87SQu Wenruo free_backref_edge(cache, edge); 7814007ea87SQu Wenruo return -ENOMEM; 7824007ea87SQu Wenruo } 7834007ea87SQu Wenruo upper->bytenr = ref_key->offset; 7844007ea87SQu Wenruo upper->level = cur->level + 1; 7854007ea87SQu Wenruo 7864007ea87SQu Wenruo /* 7874007ea87SQu Wenruo * Backrefs for the upper level block isn't cached, add the 7884007ea87SQu Wenruo * block to pending list 7894007ea87SQu Wenruo */ 7904007ea87SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 7914007ea87SQu Wenruo } else { 7924007ea87SQu Wenruo /* Parent node already cached */ 7934007ea87SQu Wenruo upper = rb_entry(rb_node, struct backref_node, rb_node); 7944007ea87SQu Wenruo ASSERT(upper->checked); 7954007ea87SQu Wenruo INIT_LIST_HEAD(&edge->list[UPPER]); 7964007ea87SQu Wenruo } 7972a979612SQu Wenruo link_backref_edge(edge, cur, upper, LINK_LOWER); 7984007ea87SQu Wenruo return 0; 7994007ea87SQu Wenruo } 8004007ea87SQu Wenruo 8014007ea87SQu Wenruo /* 8024d81ea8bSQu Wenruo * Handle indirect tree backref 8034d81ea8bSQu Wenruo * 8044d81ea8bSQu Wenruo * Indirect tree backref means, we only know which tree the node belongs to. 8054d81ea8bSQu Wenruo * We still need to do a tree search to find out the parents. This is for 8064d81ea8bSQu Wenruo * TREE_BLOCK_REF backref (keyed or inlined). 8074d81ea8bSQu Wenruo * 8084d81ea8bSQu Wenruo * @ref_key: The same as @ref_key in handle_direct_tree_backref() 8094d81ea8bSQu Wenruo * @tree_key: The first key of this tree block. 8104d81ea8bSQu Wenruo * @path: A clean (released) path, to avoid allocating path everytime 8114d81ea8bSQu Wenruo * the function get called. 8124d81ea8bSQu Wenruo */ 8134d81ea8bSQu Wenruo static int handle_indirect_tree_backref(struct backref_cache *cache, 8144d81ea8bSQu Wenruo struct btrfs_path *path, 8154d81ea8bSQu Wenruo struct btrfs_key *ref_key, 8164d81ea8bSQu Wenruo struct btrfs_key *tree_key, 8174d81ea8bSQu Wenruo struct backref_node *cur) 8184d81ea8bSQu Wenruo { 8194d81ea8bSQu Wenruo struct btrfs_fs_info *fs_info = cache->fs_info; 8204d81ea8bSQu Wenruo struct backref_node *upper; 8214d81ea8bSQu Wenruo struct backref_node *lower; 8224d81ea8bSQu Wenruo struct backref_edge *edge; 8234d81ea8bSQu Wenruo struct extent_buffer *eb; 8244d81ea8bSQu Wenruo struct btrfs_root *root; 8254d81ea8bSQu Wenruo struct rb_node *rb_node; 8264d81ea8bSQu Wenruo int level; 8274d81ea8bSQu Wenruo bool need_check = true; 8284d81ea8bSQu Wenruo int ret; 8294d81ea8bSQu Wenruo 8304d81ea8bSQu Wenruo root = read_fs_root(fs_info, ref_key->offset); 8314d81ea8bSQu Wenruo if (IS_ERR(root)) 8324d81ea8bSQu Wenruo return PTR_ERR(root); 8334d81ea8bSQu Wenruo if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 8344d81ea8bSQu Wenruo cur->cowonly = 1; 8354d81ea8bSQu Wenruo 8364d81ea8bSQu Wenruo if (btrfs_root_level(&root->root_item) == cur->level) { 8374d81ea8bSQu Wenruo /* Tree root */ 8384d81ea8bSQu Wenruo ASSERT(btrfs_root_bytenr(&root->root_item) == cur->bytenr); 8394d81ea8bSQu Wenruo if (should_ignore_root(root)) { 8404d81ea8bSQu Wenruo btrfs_put_root(root); 8414d81ea8bSQu Wenruo list_add(&cur->list, &cache->useless_node); 8424d81ea8bSQu Wenruo } else { 8434d81ea8bSQu Wenruo cur->root = root; 8444d81ea8bSQu Wenruo } 8454d81ea8bSQu Wenruo return 0; 8464d81ea8bSQu Wenruo } 8474d81ea8bSQu Wenruo 8484d81ea8bSQu Wenruo level = cur->level + 1; 8494d81ea8bSQu Wenruo 8504d81ea8bSQu Wenruo /* Search the tree to find parent blocks referring to the block */ 8514d81ea8bSQu Wenruo path->search_commit_root = 1; 8524d81ea8bSQu Wenruo path->skip_locking = 1; 8534d81ea8bSQu Wenruo path->lowest_level = level; 8544d81ea8bSQu Wenruo ret = btrfs_search_slot(NULL, root, tree_key, path, 0, 0); 8554d81ea8bSQu Wenruo path->lowest_level = 0; 8564d81ea8bSQu Wenruo if (ret < 0) { 8574d81ea8bSQu Wenruo btrfs_put_root(root); 8584d81ea8bSQu Wenruo return ret; 8594d81ea8bSQu Wenruo } 8604d81ea8bSQu Wenruo if (ret > 0 && path->slots[level] > 0) 8614d81ea8bSQu Wenruo path->slots[level]--; 8624d81ea8bSQu Wenruo 8634d81ea8bSQu Wenruo eb = path->nodes[level]; 8644d81ea8bSQu Wenruo if (btrfs_node_blockptr(eb, path->slots[level]) != cur->bytenr) { 8654d81ea8bSQu Wenruo btrfs_err(fs_info, 8664d81ea8bSQu Wenruo "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)", 8674d81ea8bSQu Wenruo cur->bytenr, level - 1, root->root_key.objectid, 8684d81ea8bSQu Wenruo tree_key->objectid, tree_key->type, tree_key->offset); 8694d81ea8bSQu Wenruo btrfs_put_root(root); 8704d81ea8bSQu Wenruo ret = -ENOENT; 8714d81ea8bSQu Wenruo goto out; 8724d81ea8bSQu Wenruo } 8734d81ea8bSQu Wenruo lower = cur; 8744d81ea8bSQu Wenruo 8754d81ea8bSQu Wenruo /* Add all nodes and edges in the path */ 8764d81ea8bSQu Wenruo for (; level < BTRFS_MAX_LEVEL; level++) { 8774d81ea8bSQu Wenruo if (!path->nodes[level]) { 8784d81ea8bSQu Wenruo ASSERT(btrfs_root_bytenr(&root->root_item) == 8794d81ea8bSQu Wenruo lower->bytenr); 8804d81ea8bSQu Wenruo if (should_ignore_root(root)) { 8814d81ea8bSQu Wenruo btrfs_put_root(root); 8824d81ea8bSQu Wenruo list_add(&lower->list, &cache->useless_node); 8834d81ea8bSQu Wenruo } else { 8844d81ea8bSQu Wenruo lower->root = root; 8854d81ea8bSQu Wenruo } 8864d81ea8bSQu Wenruo break; 8874d81ea8bSQu Wenruo } 8884d81ea8bSQu Wenruo 8894d81ea8bSQu Wenruo edge = alloc_backref_edge(cache); 8904d81ea8bSQu Wenruo if (!edge) { 8914d81ea8bSQu Wenruo btrfs_put_root(root); 8924d81ea8bSQu Wenruo ret = -ENOMEM; 8934d81ea8bSQu Wenruo goto out; 8944d81ea8bSQu Wenruo } 8954d81ea8bSQu Wenruo 8964d81ea8bSQu Wenruo eb = path->nodes[level]; 8974d81ea8bSQu Wenruo rb_node = tree_search(&cache->rb_root, eb->start); 8984d81ea8bSQu Wenruo if (!rb_node) { 8994d81ea8bSQu Wenruo upper = alloc_backref_node(cache); 9004d81ea8bSQu Wenruo if (!upper) { 9014d81ea8bSQu Wenruo btrfs_put_root(root); 9024d81ea8bSQu Wenruo free_backref_edge(cache, edge); 9034d81ea8bSQu Wenruo ret = -ENOMEM; 9044d81ea8bSQu Wenruo goto out; 9054d81ea8bSQu Wenruo } 9064d81ea8bSQu Wenruo upper->bytenr = eb->start; 9074d81ea8bSQu Wenruo upper->owner = btrfs_header_owner(eb); 9084d81ea8bSQu Wenruo upper->level = lower->level + 1; 9094d81ea8bSQu Wenruo if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 9104d81ea8bSQu Wenruo upper->cowonly = 1; 9114d81ea8bSQu Wenruo 9124d81ea8bSQu Wenruo /* 9134d81ea8bSQu Wenruo * If we know the block isn't shared we can avoid 9144d81ea8bSQu Wenruo * checking its backrefs. 9154d81ea8bSQu Wenruo */ 9164d81ea8bSQu Wenruo if (btrfs_block_can_be_shared(root, eb)) 9174d81ea8bSQu Wenruo upper->checked = 0; 9184d81ea8bSQu Wenruo else 9194d81ea8bSQu Wenruo upper->checked = 1; 9204d81ea8bSQu Wenruo 9214d81ea8bSQu Wenruo /* 9224d81ea8bSQu Wenruo * Add the block to pending list if we need to check its 9234d81ea8bSQu Wenruo * backrefs, we only do this once while walking up a 9244d81ea8bSQu Wenruo * tree as we will catch anything else later on. 9254d81ea8bSQu Wenruo */ 9264d81ea8bSQu Wenruo if (!upper->checked && need_check) { 9274d81ea8bSQu Wenruo need_check = false; 9284d81ea8bSQu Wenruo list_add_tail(&edge->list[UPPER], 9294d81ea8bSQu Wenruo &cache->pending_edge); 9304d81ea8bSQu Wenruo } else { 9314d81ea8bSQu Wenruo if (upper->checked) 9324d81ea8bSQu Wenruo need_check = true; 9334d81ea8bSQu Wenruo INIT_LIST_HEAD(&edge->list[UPPER]); 9344d81ea8bSQu Wenruo } 9354d81ea8bSQu Wenruo } else { 9364d81ea8bSQu Wenruo upper = rb_entry(rb_node, struct backref_node, rb_node); 9374d81ea8bSQu Wenruo ASSERT(upper->checked); 9384d81ea8bSQu Wenruo INIT_LIST_HEAD(&edge->list[UPPER]); 9394d81ea8bSQu Wenruo if (!upper->owner) 9404d81ea8bSQu Wenruo upper->owner = btrfs_header_owner(eb); 9414d81ea8bSQu Wenruo } 9422a979612SQu Wenruo link_backref_edge(edge, lower, upper, LINK_LOWER); 9434d81ea8bSQu Wenruo 9444d81ea8bSQu Wenruo if (rb_node) { 9454d81ea8bSQu Wenruo btrfs_put_root(root); 9464d81ea8bSQu Wenruo break; 9474d81ea8bSQu Wenruo } 9484d81ea8bSQu Wenruo lower = upper; 9494d81ea8bSQu Wenruo upper = NULL; 9504d81ea8bSQu Wenruo } 9514d81ea8bSQu Wenruo out: 9524d81ea8bSQu Wenruo btrfs_release_path(path); 9534d81ea8bSQu Wenruo return ret; 9544d81ea8bSQu Wenruo } 9554d81ea8bSQu Wenruo 9564d81ea8bSQu Wenruo /* 9575d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 9585d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 9595d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 9605d4f98a2SYan Zheng * 9615d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 96201327610SNicholas D Steeves * to find upper level blocks that reference the block, and then check 96301327610SNicholas D Steeves * backrefs of these upper level blocks recursively. the recursion stop 9645d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 9655d4f98a2SYan Zheng * 9665d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 9675d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 9685d4f98a2SYan Zheng * block are also cached. 9695d4f98a2SYan Zheng */ 9703fd0a558SYan, Zheng static noinline_for_stack 9713fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 9725d4f98a2SYan Zheng struct btrfs_key *node_key, 9735d4f98a2SYan Zheng int level, u64 bytenr) 9745d4f98a2SYan Zheng { 97571f572a9SQu Wenruo struct btrfs_backref_iter *iter; 9763fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 97771f572a9SQu Wenruo /* For searching parent of TREE_BLOCK_REF */ 97871f572a9SQu Wenruo struct btrfs_path *path; 9795d4f98a2SYan Zheng struct backref_node *cur; 9805d4f98a2SYan Zheng struct backref_node *upper; 9815d4f98a2SYan Zheng struct backref_node *lower; 9825d4f98a2SYan Zheng struct backref_node *node = NULL; 9835d4f98a2SYan Zheng struct backref_node *exist = NULL; 9845d4f98a2SYan Zheng struct backref_edge *edge; 9855d4f98a2SYan Zheng struct rb_node *rb_node; 9863fd0a558SYan, Zheng int cowonly; 9875d4f98a2SYan Zheng int ret; 9885d4f98a2SYan Zheng int err = 0; 9895d4f98a2SYan Zheng 99071f572a9SQu Wenruo iter = btrfs_backref_iter_alloc(rc->extent_root->fs_info, GFP_NOFS); 99171f572a9SQu Wenruo if (!iter) 99271f572a9SQu Wenruo return ERR_PTR(-ENOMEM); 99371f572a9SQu Wenruo path = btrfs_alloc_path(); 99471f572a9SQu Wenruo if (!path) { 9955d4f98a2SYan Zheng err = -ENOMEM; 9965d4f98a2SYan Zheng goto out; 9975d4f98a2SYan Zheng } 9985d4f98a2SYan Zheng 9993fd0a558SYan, Zheng node = alloc_backref_node(cache); 10005d4f98a2SYan Zheng if (!node) { 10015d4f98a2SYan Zheng err = -ENOMEM; 10025d4f98a2SYan Zheng goto out; 10035d4f98a2SYan Zheng } 10045d4f98a2SYan Zheng 10055d4f98a2SYan Zheng node->bytenr = bytenr; 10065d4f98a2SYan Zheng node->level = level; 10075d4f98a2SYan Zheng node->lowest = 1; 10085d4f98a2SYan Zheng cur = node; 10095d4f98a2SYan Zheng again: 101071f572a9SQu Wenruo ret = btrfs_backref_iter_start(iter, cur->bytenr); 10115d4f98a2SYan Zheng if (ret < 0) { 10125d4f98a2SYan Zheng err = ret; 10135d4f98a2SYan Zheng goto out; 10145d4f98a2SYan Zheng } 10155d4f98a2SYan Zheng 101671f572a9SQu Wenruo /* 101771f572a9SQu Wenruo * We skip the first btrfs_tree_block_info, as we don't use the key 101871f572a9SQu Wenruo * stored in it, but fetch it from the tree block 101971f572a9SQu Wenruo */ 102071f572a9SQu Wenruo if (btrfs_backref_has_tree_block_info(iter)) { 102171f572a9SQu Wenruo ret = btrfs_backref_iter_next(iter); 102271f572a9SQu Wenruo if (ret < 0) { 102371f572a9SQu Wenruo err = ret; 102471f572a9SQu Wenruo goto out; 102571f572a9SQu Wenruo } 102671f572a9SQu Wenruo /* No extra backref? This means the tree block is corrupted */ 102771f572a9SQu Wenruo if (ret > 0) { 102871f572a9SQu Wenruo err = -EUCLEAN; 102971f572a9SQu Wenruo goto out; 103071f572a9SQu Wenruo } 103171f572a9SQu Wenruo } 10325d4f98a2SYan Zheng WARN_ON(cur->checked); 10335d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 10345d4f98a2SYan Zheng /* 103570f23fd6SJustin P. Mattock * the backref was added previously when processing 10365d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 10375d4f98a2SYan Zheng */ 103875bfb9afSJosef Bacik ASSERT(list_is_singular(&cur->upper)); 10395d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 10405d4f98a2SYan Zheng list[LOWER]); 104175bfb9afSJosef Bacik ASSERT(list_empty(&edge->list[UPPER])); 10425d4f98a2SYan Zheng exist = edge->node[UPPER]; 10435d4f98a2SYan Zheng /* 10445d4f98a2SYan Zheng * add the upper level block to pending list if we need 10455d4f98a2SYan Zheng * check its backrefs 10465d4f98a2SYan Zheng */ 10475d4f98a2SYan Zheng if (!exist->checked) 104884780289SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 10495d4f98a2SYan Zheng } else { 10505d4f98a2SYan Zheng exist = NULL; 10515d4f98a2SYan Zheng } 10525d4f98a2SYan Zheng 105371f572a9SQu Wenruo for (; ret == 0; ret = btrfs_backref_iter_next(iter)) { 105471f572a9SQu Wenruo struct extent_buffer *eb; 105571f572a9SQu Wenruo struct btrfs_key key; 10563de28d57SLiu Bo int type; 105771f572a9SQu Wenruo 105871f572a9SQu Wenruo cond_resched(); 105971f572a9SQu Wenruo eb = btrfs_backref_get_eb(iter); 106071f572a9SQu Wenruo 106171f572a9SQu Wenruo key.objectid = iter->bytenr; 106271f572a9SQu Wenruo if (btrfs_backref_iter_is_inline_ref(iter)) { 106371f572a9SQu Wenruo struct btrfs_extent_inline_ref *iref; 106471f572a9SQu Wenruo 106571f572a9SQu Wenruo /* update key for inline back ref */ 106671f572a9SQu Wenruo iref = (struct btrfs_extent_inline_ref *) 106771f572a9SQu Wenruo ((unsigned long)iter->cur_ptr); 10683de28d57SLiu Bo type = btrfs_get_extent_inline_ref_type(eb, iref, 10693de28d57SLiu Bo BTRFS_REF_TYPE_BLOCK); 10703de28d57SLiu Bo if (type == BTRFS_REF_TYPE_INVALID) { 1071af431dcbSSu Yue err = -EUCLEAN; 10723de28d57SLiu Bo goto out; 10733de28d57SLiu Bo } 10743de28d57SLiu Bo key.type = type; 10755d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 107671f572a9SQu Wenruo } else { 107771f572a9SQu Wenruo key.type = iter->cur_key.type; 107871f572a9SQu Wenruo key.offset = iter->cur_key.offset; 10795d4f98a2SYan Zheng } 10805d4f98a2SYan Zheng 1081fa6ac715SQu Wenruo /* 1082fa6ac715SQu Wenruo * Parent node found and matches current inline ref, no need to 1083fa6ac715SQu Wenruo * rebuild this node for this inline ref. 1084fa6ac715SQu Wenruo */ 10855d4f98a2SYan Zheng if (exist && 10865d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 10875d4f98a2SYan Zheng exist->owner == key.offset) || 10885d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 10895d4f98a2SYan Zheng exist->bytenr == key.offset))) { 10905d4f98a2SYan Zheng exist = NULL; 109171f572a9SQu Wenruo continue; 10925d4f98a2SYan Zheng } 10935d4f98a2SYan Zheng 1094fa6ac715SQu Wenruo /* SHARED_BLOCK_REF means key.offset is the parent bytenr */ 10955d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 10964007ea87SQu Wenruo ret = handle_direct_tree_backref(cache, &key, cur); 10974007ea87SQu Wenruo if (ret < 0) { 10984007ea87SQu Wenruo err = ret; 10992433bea5SQu Wenruo goto out; 11002433bea5SQu Wenruo } 110171f572a9SQu Wenruo continue; 11026d8ff4e4SDavid Sterba } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) { 1103ba3c2b19SNikolay Borisov err = -EINVAL; 1104ba3c2b19SNikolay Borisov btrfs_print_v0_err(rc->extent_root->fs_info); 1105ba3c2b19SNikolay Borisov btrfs_handle_fs_error(rc->extent_root->fs_info, err, 1106ba3c2b19SNikolay Borisov NULL); 1107ba3c2b19SNikolay Borisov goto out; 11085d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 110971f572a9SQu Wenruo continue; 11105d4f98a2SYan Zheng } 11115d4f98a2SYan Zheng 1112fa6ac715SQu Wenruo /* 1113fa6ac715SQu Wenruo * key.type == BTRFS_TREE_BLOCK_REF_KEY, inline ref offset 1114fa6ac715SQu Wenruo * means the root objectid. We need to search the tree to get 1115fa6ac715SQu Wenruo * its parent bytenr. 1116fa6ac715SQu Wenruo */ 11174d81ea8bSQu Wenruo ret = handle_indirect_tree_backref(cache, path, &key, node_key, 11184d81ea8bSQu Wenruo cur); 11195d4f98a2SYan Zheng if (ret < 0) { 11205d4f98a2SYan Zheng err = ret; 11215d4f98a2SYan Zheng goto out; 11225d4f98a2SYan Zheng } 11235d4f98a2SYan Zheng } 112471f572a9SQu Wenruo if (ret < 0) { 112571f572a9SQu Wenruo err = ret; 112671f572a9SQu Wenruo goto out; 11275d4f98a2SYan Zheng } 112871f572a9SQu Wenruo ret = 0; 112971f572a9SQu Wenruo btrfs_backref_iter_release(iter); 11305d4f98a2SYan Zheng 11315d4f98a2SYan Zheng cur->checked = 1; 11325d4f98a2SYan Zheng WARN_ON(exist); 11335d4f98a2SYan Zheng 11345d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 113584780289SQu Wenruo if (!list_empty(&cache->pending_edge)) { 113684780289SQu Wenruo edge = list_first_entry(&cache->pending_edge, 113784780289SQu Wenruo struct backref_edge, list[UPPER]); 11385d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 11395d4f98a2SYan Zheng cur = edge->node[UPPER]; 11405d4f98a2SYan Zheng goto again; 11415d4f98a2SYan Zheng } 11425d4f98a2SYan Zheng 11435d4f98a2SYan Zheng /* 11445d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 11455d4f98a2SYan Zheng * into the cache. 11465d4f98a2SYan Zheng */ 114775bfb9afSJosef Bacik ASSERT(node->checked); 11483fd0a558SYan, Zheng cowonly = node->cowonly; 11493fd0a558SYan, Zheng if (!cowonly) { 11503fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 11513fd0a558SYan, Zheng &node->rb_node); 115243c04fb1SJeff Mahoney if (rb_node) 115343c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 11543fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 11553fd0a558SYan, Zheng } 11565d4f98a2SYan Zheng 11575d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 115884780289SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 11595d4f98a2SYan Zheng 116084780289SQu Wenruo while (!list_empty(&cache->pending_edge)) { 116184780289SQu Wenruo edge = list_first_entry(&cache->pending_edge, 116284780289SQu Wenruo struct backref_edge, list[UPPER]); 11635d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 11645d4f98a2SYan Zheng upper = edge->node[UPPER]; 11653fd0a558SYan, Zheng if (upper->detached) { 11663fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11673fd0a558SYan, Zheng lower = edge->node[LOWER]; 11683fd0a558SYan, Zheng free_backref_edge(cache, edge); 11693fd0a558SYan, Zheng if (list_empty(&lower->upper)) 117084780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 11713fd0a558SYan, Zheng continue; 11723fd0a558SYan, Zheng } 11735d4f98a2SYan Zheng 11745d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 11755d4f98a2SYan Zheng if (upper->lowest) { 11765d4f98a2SYan Zheng list_del_init(&upper->lower); 11775d4f98a2SYan Zheng upper->lowest = 0; 11785d4f98a2SYan Zheng } 11795d4f98a2SYan Zheng 11805d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 11815d4f98a2SYan Zheng continue; 11825d4f98a2SYan Zheng } 11835d4f98a2SYan Zheng 118475bfb9afSJosef Bacik if (!upper->checked) { 118575bfb9afSJosef Bacik /* 118675bfb9afSJosef Bacik * Still want to blow up for developers since this is a 118775bfb9afSJosef Bacik * logic bug. 118875bfb9afSJosef Bacik */ 118975bfb9afSJosef Bacik ASSERT(0); 119075bfb9afSJosef Bacik err = -EINVAL; 119175bfb9afSJosef Bacik goto out; 119275bfb9afSJosef Bacik } 119375bfb9afSJosef Bacik if (cowonly != upper->cowonly) { 119475bfb9afSJosef Bacik ASSERT(0); 119575bfb9afSJosef Bacik err = -EINVAL; 119675bfb9afSJosef Bacik goto out; 119775bfb9afSJosef Bacik } 119875bfb9afSJosef Bacik 11993fd0a558SYan, Zheng if (!cowonly) { 12005d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 12015d4f98a2SYan Zheng &upper->rb_node); 120243c04fb1SJeff Mahoney if (rb_node) 120343c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 120443c04fb1SJeff Mahoney upper->bytenr); 12053fd0a558SYan, Zheng } 12065d4f98a2SYan Zheng 12075d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 12085d4f98a2SYan Zheng 12095d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 121084780289SQu Wenruo list_add_tail(&edge->list[UPPER], &cache->pending_edge); 12115d4f98a2SYan Zheng } 12123fd0a558SYan, Zheng /* 12133fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 12143fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 12153fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 12163fd0a558SYan, Zheng * lookup. 12173fd0a558SYan, Zheng */ 121884780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 121984780289SQu Wenruo upper = list_first_entry(&cache->useless_node, 122084780289SQu Wenruo struct backref_node, list); 12213fd0a558SYan, Zheng list_del_init(&upper->list); 122275bfb9afSJosef Bacik ASSERT(list_empty(&upper->upper)); 12233fd0a558SYan, Zheng if (upper == node) 12243fd0a558SYan, Zheng node = NULL; 12253fd0a558SYan, Zheng if (upper->lowest) { 12263fd0a558SYan, Zheng list_del_init(&upper->lower); 12273fd0a558SYan, Zheng upper->lowest = 0; 12283fd0a558SYan, Zheng } 12293fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 123084780289SQu Wenruo edge = list_first_entry(&upper->lower, 12313fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 12323fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 12333fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 12343fd0a558SYan, Zheng lower = edge->node[LOWER]; 12353fd0a558SYan, Zheng free_backref_edge(cache, edge); 12363fd0a558SYan, Zheng 12373fd0a558SYan, Zheng if (list_empty(&lower->upper)) 123884780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 12393fd0a558SYan, Zheng } 12409569cc20SQu Wenruo mark_block_processed(rc, upper); 12413fd0a558SYan, Zheng if (upper->level > 0) { 12423fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 12433fd0a558SYan, Zheng upper->detached = 1; 12443fd0a558SYan, Zheng } else { 12453fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 12463fd0a558SYan, Zheng free_backref_node(cache, upper); 12473fd0a558SYan, Zheng } 12483fd0a558SYan, Zheng } 12495d4f98a2SYan Zheng out: 125071f572a9SQu Wenruo btrfs_backref_iter_free(iter); 125171f572a9SQu Wenruo btrfs_free_path(path); 12525d4f98a2SYan Zheng if (err) { 125384780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 125484780289SQu Wenruo lower = list_first_entry(&cache->useless_node, 125575bfb9afSJosef Bacik struct backref_node, list); 125675bfb9afSJosef Bacik list_del_init(&lower->list); 12573fd0a558SYan, Zheng } 125884780289SQu Wenruo while (!list_empty(&cache->pending_edge)) { 125984780289SQu Wenruo edge = list_first_entry(&cache->pending_edge, 126084780289SQu Wenruo struct backref_edge, list[UPPER]); 126175bfb9afSJosef Bacik list_del(&edge->list[UPPER]); 12623fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 126375bfb9afSJosef Bacik lower = edge->node[LOWER]; 12645d4f98a2SYan Zheng upper = edge->node[UPPER]; 12653fd0a558SYan, Zheng free_backref_edge(cache, edge); 126675bfb9afSJosef Bacik 126775bfb9afSJosef Bacik /* 126875bfb9afSJosef Bacik * Lower is no longer linked to any upper backref nodes 126975bfb9afSJosef Bacik * and isn't in the cache, we can free it ourselves. 127075bfb9afSJosef Bacik */ 127175bfb9afSJosef Bacik if (list_empty(&lower->upper) && 127275bfb9afSJosef Bacik RB_EMPTY_NODE(&lower->rb_node)) 127384780289SQu Wenruo list_add(&lower->list, &cache->useless_node); 127475bfb9afSJosef Bacik 127575bfb9afSJosef Bacik if (!RB_EMPTY_NODE(&upper->rb_node)) 127675bfb9afSJosef Bacik continue; 127775bfb9afSJosef Bacik 127801327610SNicholas D Steeves /* Add this guy's upper edges to the list to process */ 127975bfb9afSJosef Bacik list_for_each_entry(edge, &upper->upper, list[LOWER]) 128084780289SQu Wenruo list_add_tail(&edge->list[UPPER], 128184780289SQu Wenruo &cache->pending_edge); 128275bfb9afSJosef Bacik if (list_empty(&upper->upper)) 128384780289SQu Wenruo list_add(&upper->list, &cache->useless_node); 128475bfb9afSJosef Bacik } 128575bfb9afSJosef Bacik 128684780289SQu Wenruo while (!list_empty(&cache->useless_node)) { 128784780289SQu Wenruo lower = list_first_entry(&cache->useless_node, 128875bfb9afSJosef Bacik struct backref_node, list); 128975bfb9afSJosef Bacik list_del_init(&lower->list); 12900fd8c3daSLiu Bo if (lower == node) 12910fd8c3daSLiu Bo node = NULL; 129275bfb9afSJosef Bacik free_backref_node(cache, lower); 12935d4f98a2SYan Zheng } 12940fd8c3daSLiu Bo 12958e19c973SJosef Bacik remove_backref_node(cache, node); 129684780289SQu Wenruo ASSERT(list_empty(&cache->useless_node) && 129784780289SQu Wenruo list_empty(&cache->pending_edge)); 12985d4f98a2SYan Zheng return ERR_PTR(err); 12995d4f98a2SYan Zheng } 130075bfb9afSJosef Bacik ASSERT(!node || !node->detached); 130184780289SQu Wenruo ASSERT(list_empty(&cache->useless_node) && 130284780289SQu Wenruo list_empty(&cache->pending_edge)); 13035d4f98a2SYan Zheng return node; 13045d4f98a2SYan Zheng } 13055d4f98a2SYan Zheng 13065d4f98a2SYan Zheng /* 13073fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 13083fd0a558SYan, Zheng * the backref node is created by cloning backref node that 13093fd0a558SYan, Zheng * corresponds to root of source tree 13103fd0a558SYan, Zheng */ 13113fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 13123fd0a558SYan, Zheng struct reloc_control *rc, 13133fd0a558SYan, Zheng struct btrfs_root *src, 13143fd0a558SYan, Zheng struct btrfs_root *dest) 13153fd0a558SYan, Zheng { 13163fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 13173fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 13183fd0a558SYan, Zheng struct backref_node *node = NULL; 13193fd0a558SYan, Zheng struct backref_node *new_node; 13203fd0a558SYan, Zheng struct backref_edge *edge; 13213fd0a558SYan, Zheng struct backref_edge *new_edge; 13223fd0a558SYan, Zheng struct rb_node *rb_node; 13233fd0a558SYan, Zheng 13243fd0a558SYan, Zheng if (cache->last_trans > 0) 13253fd0a558SYan, Zheng update_backref_cache(trans, cache); 13263fd0a558SYan, Zheng 13273fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 13283fd0a558SYan, Zheng if (rb_node) { 13293fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 13303fd0a558SYan, Zheng if (node->detached) 13313fd0a558SYan, Zheng node = NULL; 13323fd0a558SYan, Zheng else 13333fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 13343fd0a558SYan, Zheng } 13353fd0a558SYan, Zheng 13363fd0a558SYan, Zheng if (!node) { 13373fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 13383fd0a558SYan, Zheng reloc_root->commit_root->start); 13393fd0a558SYan, Zheng if (rb_node) { 13403fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 13413fd0a558SYan, Zheng rb_node); 13423fd0a558SYan, Zheng BUG_ON(node->detached); 13433fd0a558SYan, Zheng } 13443fd0a558SYan, Zheng } 13453fd0a558SYan, Zheng 13463fd0a558SYan, Zheng if (!node) 13473fd0a558SYan, Zheng return 0; 13483fd0a558SYan, Zheng 13493fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 13503fd0a558SYan, Zheng if (!new_node) 13513fd0a558SYan, Zheng return -ENOMEM; 13523fd0a558SYan, Zheng 13533fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 13543fd0a558SYan, Zheng new_node->level = node->level; 13553fd0a558SYan, Zheng new_node->lowest = node->lowest; 13566848ad64SYan, Zheng new_node->checked = 1; 135700246528SJosef Bacik new_node->root = btrfs_grab_root(dest); 13580b530bc5SJosef Bacik ASSERT(new_node->root); 13593fd0a558SYan, Zheng 13603fd0a558SYan, Zheng if (!node->lowest) { 13613fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 13623fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 13633fd0a558SYan, Zheng if (!new_edge) 13643fd0a558SYan, Zheng goto fail; 13653fd0a558SYan, Zheng 13662a979612SQu Wenruo link_backref_edge(new_edge, edge->node[LOWER], new_node, 13672a979612SQu Wenruo LINK_UPPER); 13683fd0a558SYan, Zheng } 136976b9e23dSMiao Xie } else { 137076b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 13713fd0a558SYan, Zheng } 13723fd0a558SYan, Zheng 13733fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 13743fd0a558SYan, Zheng &new_node->rb_node); 137543c04fb1SJeff Mahoney if (rb_node) 137643c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 13773fd0a558SYan, Zheng 13783fd0a558SYan, Zheng if (!new_node->lowest) { 13793fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 13803fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 13813fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 13823fd0a558SYan, Zheng } 13833fd0a558SYan, Zheng } 13843fd0a558SYan, Zheng return 0; 13853fd0a558SYan, Zheng fail: 13863fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 13873fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 13883fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 13893fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 13903fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 13913fd0a558SYan, Zheng } 13923fd0a558SYan, Zheng free_backref_node(cache, new_node); 13933fd0a558SYan, Zheng return -ENOMEM; 13943fd0a558SYan, Zheng } 13953fd0a558SYan, Zheng 13963fd0a558SYan, Zheng /* 13975d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 13985d4f98a2SYan Zheng */ 1399ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 14005d4f98a2SYan Zheng { 14010b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14025d4f98a2SYan Zheng struct rb_node *rb_node; 14035d4f98a2SYan Zheng struct mapping_node *node; 14040b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 14055d4f98a2SYan Zheng 14065d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1407ffd7b339SJeff Mahoney if (!node) 1408ffd7b339SJeff Mahoney return -ENOMEM; 14095d4f98a2SYan Zheng 1410ea287ab1SJosef Bacik node->bytenr = root->commit_root->start; 14115d4f98a2SYan Zheng node->data = root; 14125d4f98a2SYan Zheng 14135d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 14145d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 14155d4f98a2SYan Zheng node->bytenr, &node->rb_node); 14165d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1417ffd7b339SJeff Mahoney if (rb_node) { 14180b246afaSJeff Mahoney btrfs_panic(fs_info, -EEXIST, 14195d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 14205d163e0eSJeff Mahoney node->bytenr); 1421ffd7b339SJeff Mahoney } 14225d4f98a2SYan Zheng 14235d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 14245d4f98a2SYan Zheng return 0; 14255d4f98a2SYan Zheng } 14265d4f98a2SYan Zheng 14275d4f98a2SYan Zheng /* 1428c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 14295d4f98a2SYan Zheng * mapping 14305d4f98a2SYan Zheng */ 1431c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 14325d4f98a2SYan Zheng { 14330b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14345d4f98a2SYan Zheng struct rb_node *rb_node; 14355d4f98a2SYan Zheng struct mapping_node *node = NULL; 14360b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1437f44deb74SJosef Bacik bool put_ref = false; 14385d4f98a2SYan Zheng 143965c6e82bSQu Wenruo if (rc && root->node) { 14405d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 14415d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1442ea287ab1SJosef Bacik root->commit_root->start); 1443c974c464SWang Shilong if (rb_node) { 1444c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1445c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1446ea287ab1SJosef Bacik RB_CLEAR_NODE(&node->rb_node); 1447c974c464SWang Shilong } 1448c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1449c974c464SWang Shilong if (!node) 1450c974c464SWang Shilong return; 1451c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1452389305b2SQu Wenruo } 1453c974c464SWang Shilong 1454f44deb74SJosef Bacik /* 1455f44deb74SJosef Bacik * We only put the reloc root here if it's on the list. There's a lot 1456f44deb74SJosef Bacik * of places where the pattern is to splice the rc->reloc_roots, process 1457f44deb74SJosef Bacik * the reloc roots, and then add the reloc root back onto 1458f44deb74SJosef Bacik * rc->reloc_roots. If we call __del_reloc_root while it's off of the 1459f44deb74SJosef Bacik * list we don't want the reference being dropped, because the guy 1460f44deb74SJosef Bacik * messing with the list is in charge of the reference. 1461f44deb74SJosef Bacik */ 14620b246afaSJeff Mahoney spin_lock(&fs_info->trans_lock); 1463f44deb74SJosef Bacik if (!list_empty(&root->root_list)) { 1464f44deb74SJosef Bacik put_ref = true; 1465c974c464SWang Shilong list_del_init(&root->root_list); 1466f44deb74SJosef Bacik } 14670b246afaSJeff Mahoney spin_unlock(&fs_info->trans_lock); 1468f44deb74SJosef Bacik if (put_ref) 1469f44deb74SJosef Bacik btrfs_put_root(root); 1470c974c464SWang Shilong kfree(node); 1471c974c464SWang Shilong } 1472c974c464SWang Shilong 1473c974c464SWang Shilong /* 1474c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1475c974c464SWang Shilong * mapping 1476c974c464SWang Shilong */ 1477ea287ab1SJosef Bacik static int __update_reloc_root(struct btrfs_root *root) 1478c974c464SWang Shilong { 14790b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 1480c974c464SWang Shilong struct rb_node *rb_node; 1481c974c464SWang Shilong struct mapping_node *node = NULL; 14820b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1483c974c464SWang Shilong 1484c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1485c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1486ea287ab1SJosef Bacik root->commit_root->start); 14875d4f98a2SYan Zheng if (rb_node) { 14885d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 14895d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 14905d4f98a2SYan Zheng } 14915d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 14925d4f98a2SYan Zheng 14938f71f3e0SLiu Bo if (!node) 14948f71f3e0SLiu Bo return 0; 14955d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 14965d4f98a2SYan Zheng 14975d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1498ea287ab1SJosef Bacik node->bytenr = root->node->start; 14995d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 15005d4f98a2SYan Zheng node->bytenr, &node->rb_node); 15015d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 150243c04fb1SJeff Mahoney if (rb_node) 150343c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 15045d4f98a2SYan Zheng return 0; 15055d4f98a2SYan Zheng } 15065d4f98a2SYan Zheng 15073fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 15083fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 15095d4f98a2SYan Zheng { 15100b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 15115d4f98a2SYan Zheng struct btrfs_root *reloc_root; 15125d4f98a2SYan Zheng struct extent_buffer *eb; 15135d4f98a2SYan Zheng struct btrfs_root_item *root_item; 15145d4f98a2SYan Zheng struct btrfs_key root_key; 15155d4f98a2SYan Zheng int ret; 15165d4f98a2SYan Zheng 15175d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 15185d4f98a2SYan Zheng BUG_ON(!root_item); 15195d4f98a2SYan Zheng 15205d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 15215d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 15223fd0a558SYan, Zheng root_key.offset = objectid; 15235d4f98a2SYan Zheng 15243fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 1525054570a1SFilipe Manana u64 commit_root_gen; 1526054570a1SFilipe Manana 15273fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 15285d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 15295d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 15305d4f98a2SYan Zheng BUG_ON(ret); 1531054570a1SFilipe Manana /* 1532054570a1SFilipe Manana * Set the last_snapshot field to the generation of the commit 1533054570a1SFilipe Manana * root - like this ctree.c:btrfs_block_can_be_shared() behaves 1534054570a1SFilipe Manana * correctly (returns true) when the relocation root is created 1535054570a1SFilipe Manana * either inside the critical section of a transaction commit 1536054570a1SFilipe Manana * (through transaction.c:qgroup_account_snapshot()) and when 1537054570a1SFilipe Manana * it's created before the transaction commit is started. 1538054570a1SFilipe Manana */ 1539054570a1SFilipe Manana commit_root_gen = btrfs_header_generation(root->commit_root); 1540054570a1SFilipe Manana btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); 15413fd0a558SYan, Zheng } else { 15423fd0a558SYan, Zheng /* 15433fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 15443fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 15453fd0a558SYan, Zheng * modified after it was created have RELOC flag 15463fd0a558SYan, Zheng * set in their headers. so it's OK to not update 15473fd0a558SYan, Zheng * the 'last_snapshot'. 15483fd0a558SYan, Zheng */ 15493fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 15503fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 15513fd0a558SYan, Zheng BUG_ON(ret); 15523fd0a558SYan, Zheng } 15533fd0a558SYan, Zheng 15545d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 15555d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 15565d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 15575d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 15583fd0a558SYan, Zheng 15593fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 15603fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 15613fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 15623fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 15635d4f98a2SYan Zheng root_item->drop_level = 0; 15643fd0a558SYan, Zheng } 15655d4f98a2SYan Zheng 15665d4f98a2SYan Zheng btrfs_tree_unlock(eb); 15675d4f98a2SYan Zheng free_extent_buffer(eb); 15685d4f98a2SYan Zheng 15690b246afaSJeff Mahoney ret = btrfs_insert_root(trans, fs_info->tree_root, 15705d4f98a2SYan Zheng &root_key, root_item); 15715d4f98a2SYan Zheng BUG_ON(ret); 15725d4f98a2SYan Zheng kfree(root_item); 15735d4f98a2SYan Zheng 15743dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(fs_info->tree_root, &root_key); 15755d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 15763dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 15775d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 15783fd0a558SYan, Zheng return reloc_root; 15793fd0a558SYan, Zheng } 15803fd0a558SYan, Zheng 15813fd0a558SYan, Zheng /* 15823fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 15833fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 1584f44deb74SJosef Bacik * 1585f44deb74SJosef Bacik * The reloc_root comes out of here with two references, one for 1586f44deb74SJosef Bacik * root->reloc_root, and another for being on the rc->reloc_roots list. 15873fd0a558SYan, Zheng */ 15883fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 15893fd0a558SYan, Zheng struct btrfs_root *root) 15903fd0a558SYan, Zheng { 15910b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 15923fd0a558SYan, Zheng struct btrfs_root *reloc_root; 15930b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 159420dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 15953fd0a558SYan, Zheng int clear_rsv = 0; 1596ffd7b339SJeff Mahoney int ret; 15973fd0a558SYan, Zheng 1598aec7db3bSJosef Bacik if (!rc) 15992abc726aSJosef Bacik return 0; 16002abc726aSJosef Bacik 16011fac4a54SQu Wenruo /* 16021fac4a54SQu Wenruo * The subvolume has reloc tree but the swap is finished, no need to 16031fac4a54SQu Wenruo * create/update the dead reloc tree 16041fac4a54SQu Wenruo */ 16056282675eSQu Wenruo if (reloc_root_is_dead(root)) 16061fac4a54SQu Wenruo return 0; 16071fac4a54SQu Wenruo 1608aec7db3bSJosef Bacik /* 1609aec7db3bSJosef Bacik * This is subtle but important. We do not do 1610aec7db3bSJosef Bacik * record_root_in_transaction for reloc roots, instead we record their 1611aec7db3bSJosef Bacik * corresponding fs root, and then here we update the last trans for the 1612aec7db3bSJosef Bacik * reloc root. This means that we have to do this for the entire life 1613aec7db3bSJosef Bacik * of the reloc root, regardless of which stage of the relocation we are 1614aec7db3bSJosef Bacik * in. 1615aec7db3bSJosef Bacik */ 16163fd0a558SYan, Zheng if (root->reloc_root) { 16173fd0a558SYan, Zheng reloc_root = root->reloc_root; 16183fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 16193fd0a558SYan, Zheng return 0; 16203fd0a558SYan, Zheng } 16213fd0a558SYan, Zheng 1622aec7db3bSJosef Bacik /* 1623aec7db3bSJosef Bacik * We are merging reloc roots, we do not need new reloc trees. Also 1624aec7db3bSJosef Bacik * reloc trees never need their own reloc tree. 1625aec7db3bSJosef Bacik */ 1626aec7db3bSJosef Bacik if (!rc->create_reloc_tree || 1627aec7db3bSJosef Bacik root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 1628aec7db3bSJosef Bacik return 0; 1629aec7db3bSJosef Bacik 163020dd2cbfSMiao Xie if (!trans->reloc_reserved) { 163120dd2cbfSMiao Xie rsv = trans->block_rsv; 16323fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 16333fd0a558SYan, Zheng clear_rsv = 1; 16343fd0a558SYan, Zheng } 16353fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 16363fd0a558SYan, Zheng if (clear_rsv) 163720dd2cbfSMiao Xie trans->block_rsv = rsv; 16385d4f98a2SYan Zheng 1639ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1640ffd7b339SJeff Mahoney BUG_ON(ret < 0); 1641f44deb74SJosef Bacik root->reloc_root = btrfs_grab_root(reloc_root); 16425d4f98a2SYan Zheng return 0; 16435d4f98a2SYan Zheng } 16445d4f98a2SYan Zheng 16455d4f98a2SYan Zheng /* 16465d4f98a2SYan Zheng * update root item of reloc tree 16475d4f98a2SYan Zheng */ 16485d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 16495d4f98a2SYan Zheng struct btrfs_root *root) 16505d4f98a2SYan Zheng { 16510b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 16525d4f98a2SYan Zheng struct btrfs_root *reloc_root; 16535d4f98a2SYan Zheng struct btrfs_root_item *root_item; 16545d4f98a2SYan Zheng int ret; 16555d4f98a2SYan Zheng 16566282675eSQu Wenruo if (!have_reloc_root(root)) 16577585717fSChris Mason goto out; 16585d4f98a2SYan Zheng 16595d4f98a2SYan Zheng reloc_root = root->reloc_root; 16605d4f98a2SYan Zheng root_item = &reloc_root->root_item; 16615d4f98a2SYan Zheng 1662f44deb74SJosef Bacik /* 1663f44deb74SJosef Bacik * We are probably ok here, but __del_reloc_root() will drop its ref of 1664f44deb74SJosef Bacik * the root. We have the ref for root->reloc_root, but just in case 1665f44deb74SJosef Bacik * hold it while we update the reloc root. 1666f44deb74SJosef Bacik */ 1667f44deb74SJosef Bacik btrfs_grab_root(reloc_root); 1668f44deb74SJosef Bacik 1669d2311e69SQu Wenruo /* root->reloc_root will stay until current relocation finished */ 16700b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 16713fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 1672d2311e69SQu Wenruo set_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 16736282675eSQu Wenruo /* 16746282675eSQu Wenruo * Mark the tree as dead before we change reloc_root so 16756282675eSQu Wenruo * have_reloc_root will not touch it from now on. 16766282675eSQu Wenruo */ 16776282675eSQu Wenruo smp_wmb(); 1678c974c464SWang Shilong __del_reloc_root(reloc_root); 16795d4f98a2SYan Zheng } 16805d4f98a2SYan Zheng 16815d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 1682ea287ab1SJosef Bacik __update_reloc_root(reloc_root); 16835d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 16845d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 16855d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 16865d4f98a2SYan Zheng } 16875d4f98a2SYan Zheng 16880b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 16895d4f98a2SYan Zheng &reloc_root->root_key, root_item); 16905d4f98a2SYan Zheng BUG_ON(ret); 1691f44deb74SJosef Bacik btrfs_put_root(reloc_root); 16927585717fSChris Mason out: 16935d4f98a2SYan Zheng return 0; 16945d4f98a2SYan Zheng } 16955d4f98a2SYan Zheng 16965d4f98a2SYan Zheng /* 16975d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 16985d4f98a2SYan Zheng * in a subvolume 16995d4f98a2SYan Zheng */ 17005d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 17015d4f98a2SYan Zheng { 17025d4f98a2SYan Zheng struct rb_node *node; 17035d4f98a2SYan Zheng struct rb_node *prev; 17045d4f98a2SYan Zheng struct btrfs_inode *entry; 17055d4f98a2SYan Zheng struct inode *inode; 17065d4f98a2SYan Zheng 17075d4f98a2SYan Zheng spin_lock(&root->inode_lock); 17085d4f98a2SYan Zheng again: 17095d4f98a2SYan Zheng node = root->inode_tree.rb_node; 17105d4f98a2SYan Zheng prev = NULL; 17115d4f98a2SYan Zheng while (node) { 17125d4f98a2SYan Zheng prev = node; 17135d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 17145d4f98a2SYan Zheng 17154a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 17165d4f98a2SYan Zheng node = node->rb_left; 17174a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 17185d4f98a2SYan Zheng node = node->rb_right; 17195d4f98a2SYan Zheng else 17205d4f98a2SYan Zheng break; 17215d4f98a2SYan Zheng } 17225d4f98a2SYan Zheng if (!node) { 17235d4f98a2SYan Zheng while (prev) { 17245d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 17254a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 17265d4f98a2SYan Zheng node = prev; 17275d4f98a2SYan Zheng break; 17285d4f98a2SYan Zheng } 17295d4f98a2SYan Zheng prev = rb_next(prev); 17305d4f98a2SYan Zheng } 17315d4f98a2SYan Zheng } 17325d4f98a2SYan Zheng while (node) { 17335d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 17345d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 17355d4f98a2SYan Zheng if (inode) { 17365d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 17375d4f98a2SYan Zheng return inode; 17385d4f98a2SYan Zheng } 17395d4f98a2SYan Zheng 17404a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 17415d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 17425d4f98a2SYan Zheng goto again; 17435d4f98a2SYan Zheng 17445d4f98a2SYan Zheng node = rb_next(node); 17455d4f98a2SYan Zheng } 17465d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 17475d4f98a2SYan Zheng return NULL; 17485d4f98a2SYan Zheng } 17495d4f98a2SYan Zheng 17505d4f98a2SYan Zheng /* 17515d4f98a2SYan Zheng * get new location of data 17525d4f98a2SYan Zheng */ 17535d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 17545d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 17555d4f98a2SYan Zheng { 17565d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 17575d4f98a2SYan Zheng struct btrfs_path *path; 17585d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 17595d4f98a2SYan Zheng struct extent_buffer *leaf; 17605d4f98a2SYan Zheng int ret; 17615d4f98a2SYan Zheng 17625d4f98a2SYan Zheng path = btrfs_alloc_path(); 17635d4f98a2SYan Zheng if (!path) 17645d4f98a2SYan Zheng return -ENOMEM; 17655d4f98a2SYan Zheng 17665d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 1767f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 1768f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 17695d4f98a2SYan Zheng if (ret < 0) 17705d4f98a2SYan Zheng goto out; 17715d4f98a2SYan Zheng if (ret > 0) { 17725d4f98a2SYan Zheng ret = -ENOENT; 17735d4f98a2SYan Zheng goto out; 17745d4f98a2SYan Zheng } 17755d4f98a2SYan Zheng 17765d4f98a2SYan Zheng leaf = path->nodes[0]; 17775d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 17785d4f98a2SYan Zheng struct btrfs_file_extent_item); 17795d4f98a2SYan Zheng 17805d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 17815d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 17825d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 17835d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 17845d4f98a2SYan Zheng 17855d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 178683d4cfd4SJosef Bacik ret = -EINVAL; 17875d4f98a2SYan Zheng goto out; 17885d4f98a2SYan Zheng } 17895d4f98a2SYan Zheng 17905d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 17915d4f98a2SYan Zheng ret = 0; 17925d4f98a2SYan Zheng out: 17935d4f98a2SYan Zheng btrfs_free_path(path); 17945d4f98a2SYan Zheng return ret; 17955d4f98a2SYan Zheng } 17965d4f98a2SYan Zheng 17975d4f98a2SYan Zheng /* 17985d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 17995d4f98a2SYan Zheng * the new locations. 18005d4f98a2SYan Zheng */ 18013fd0a558SYan, Zheng static noinline_for_stack 18023fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 18035d4f98a2SYan Zheng struct reloc_control *rc, 18045d4f98a2SYan Zheng struct btrfs_root *root, 18053fd0a558SYan, Zheng struct extent_buffer *leaf) 18065d4f98a2SYan Zheng { 18070b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 18085d4f98a2SYan Zheng struct btrfs_key key; 18095d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 18105d4f98a2SYan Zheng struct inode *inode = NULL; 18115d4f98a2SYan Zheng u64 parent; 18125d4f98a2SYan Zheng u64 bytenr; 18133fd0a558SYan, Zheng u64 new_bytenr = 0; 18145d4f98a2SYan Zheng u64 num_bytes; 18155d4f98a2SYan Zheng u64 end; 18165d4f98a2SYan Zheng u32 nritems; 18175d4f98a2SYan Zheng u32 i; 181883d4cfd4SJosef Bacik int ret = 0; 18195d4f98a2SYan Zheng int first = 1; 18205d4f98a2SYan Zheng int dirty = 0; 18215d4f98a2SYan Zheng 18225d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 18235d4f98a2SYan Zheng return 0; 18245d4f98a2SYan Zheng 18255d4f98a2SYan Zheng /* reloc trees always use full backref */ 18265d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 18275d4f98a2SYan Zheng parent = leaf->start; 18285d4f98a2SYan Zheng else 18295d4f98a2SYan Zheng parent = 0; 18305d4f98a2SYan Zheng 18315d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 18325d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 183382fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 183482fa113fSQu Wenruo 18355d4f98a2SYan Zheng cond_resched(); 18365d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 18375d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 18385d4f98a2SYan Zheng continue; 18395d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 18405d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 18415d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 18425d4f98a2SYan Zheng continue; 18435d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 18445d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 18455d4f98a2SYan Zheng if (bytenr == 0) 18465d4f98a2SYan Zheng continue; 18479569cc20SQu Wenruo if (!in_range(bytenr, rc->block_group->start, 18489569cc20SQu Wenruo rc->block_group->length)) 18495d4f98a2SYan Zheng continue; 18505d4f98a2SYan Zheng 18515d4f98a2SYan Zheng /* 18525d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 18535d4f98a2SYan Zheng * to complete and drop the extent cache 18545d4f98a2SYan Zheng */ 18555d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 18565d4f98a2SYan Zheng if (first) { 18575d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 18585d4f98a2SYan Zheng first = 0; 18594a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 18603fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 18615d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 18625d4f98a2SYan Zheng } 18634a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 18645d4f98a2SYan Zheng end = key.offset + 18655d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 18665d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 18670b246afaSJeff Mahoney fs_info->sectorsize)); 18680b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 18695d4f98a2SYan Zheng end--; 18705d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1871d0082371SJeff Mahoney key.offset, end); 18725d4f98a2SYan Zheng if (!ret) 18735d4f98a2SYan Zheng continue; 18745d4f98a2SYan Zheng 1875dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1876dcdbc059SNikolay Borisov key.offset, end, 1); 18775d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1878d0082371SJeff Mahoney key.offset, end); 18795d4f98a2SYan Zheng } 18805d4f98a2SYan Zheng } 18815d4f98a2SYan Zheng 18825d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 18835d4f98a2SYan Zheng bytenr, num_bytes); 188483d4cfd4SJosef Bacik if (ret) { 188583d4cfd4SJosef Bacik /* 188683d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 188783d4cfd4SJosef Bacik * in the file extent yet. 188883d4cfd4SJosef Bacik */ 188983d4cfd4SJosef Bacik break; 18903fd0a558SYan, Zheng } 18915d4f98a2SYan Zheng 18925d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 18935d4f98a2SYan Zheng dirty = 1; 18945d4f98a2SYan Zheng 18955d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 189682fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 189782fa113fSQu Wenruo num_bytes, parent); 189882fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 189982fa113fSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1900b06c4bf5SFilipe Manana key.objectid, key.offset); 190182fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 190283d4cfd4SJosef Bacik if (ret) { 190366642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 190483d4cfd4SJosef Bacik break; 190583d4cfd4SJosef Bacik } 19065d4f98a2SYan Zheng 1907ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, bytenr, 1908ffd4bb2aSQu Wenruo num_bytes, parent); 1909ffd4bb2aSQu Wenruo ref.real_root = root->root_key.objectid; 1910ffd4bb2aSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1911b06c4bf5SFilipe Manana key.objectid, key.offset); 1912ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 191383d4cfd4SJosef Bacik if (ret) { 191466642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 191583d4cfd4SJosef Bacik break; 191683d4cfd4SJosef Bacik } 19175d4f98a2SYan Zheng } 19185d4f98a2SYan Zheng if (dirty) 19195d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 19203fd0a558SYan, Zheng if (inode) 19213fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 192283d4cfd4SJosef Bacik return ret; 19235d4f98a2SYan Zheng } 19245d4f98a2SYan Zheng 19255d4f98a2SYan Zheng static noinline_for_stack 19265d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 19275d4f98a2SYan Zheng struct btrfs_path *path, int level) 19285d4f98a2SYan Zheng { 19295d4f98a2SYan Zheng struct btrfs_disk_key key1; 19305d4f98a2SYan Zheng struct btrfs_disk_key key2; 19315d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 19325d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 19335d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 19345d4f98a2SYan Zheng } 19355d4f98a2SYan Zheng 19365d4f98a2SYan Zheng /* 19375d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 19385d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 19395d4f98a2SYan Zheng * reloc tree was create can be replaced. 19405d4f98a2SYan Zheng * 19415d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 19425d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 19435d4f98a2SYan Zheng * errors, a negative error number is returned. 19445d4f98a2SYan Zheng */ 19453fd0a558SYan, Zheng static noinline_for_stack 19463d0174f7SQu Wenruo int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, 19475d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 19485d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 19495d4f98a2SYan Zheng int lowest_level, int max_level) 19505d4f98a2SYan Zheng { 19510b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 19525d4f98a2SYan Zheng struct extent_buffer *eb; 19535d4f98a2SYan Zheng struct extent_buffer *parent; 195482fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 19555d4f98a2SYan Zheng struct btrfs_key key; 19565d4f98a2SYan Zheng u64 old_bytenr; 19575d4f98a2SYan Zheng u64 new_bytenr; 19585d4f98a2SYan Zheng u64 old_ptr_gen; 19595d4f98a2SYan Zheng u64 new_ptr_gen; 19605d4f98a2SYan Zheng u64 last_snapshot; 19615d4f98a2SYan Zheng u32 blocksize; 19623fd0a558SYan, Zheng int cow = 0; 19635d4f98a2SYan Zheng int level; 19645d4f98a2SYan Zheng int ret; 19655d4f98a2SYan Zheng int slot; 19665d4f98a2SYan Zheng 19675d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 19685d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 19695d4f98a2SYan Zheng 19705d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 19713fd0a558SYan, Zheng again: 19725d4f98a2SYan Zheng slot = path->slots[lowest_level]; 19735d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 19745d4f98a2SYan Zheng 19755d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 19768bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19775d4f98a2SYan Zheng level = btrfs_header_level(eb); 19785d4f98a2SYan Zheng 19795d4f98a2SYan Zheng if (level < lowest_level) { 19805d4f98a2SYan Zheng btrfs_tree_unlock(eb); 19815d4f98a2SYan Zheng free_extent_buffer(eb); 19825d4f98a2SYan Zheng return 0; 19835d4f98a2SYan Zheng } 19845d4f98a2SYan Zheng 19853fd0a558SYan, Zheng if (cow) { 19865d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 19875d4f98a2SYan Zheng BUG_ON(ret); 19883fd0a558SYan, Zheng } 19898bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19905d4f98a2SYan Zheng 19915d4f98a2SYan Zheng if (next_key) { 19925d4f98a2SYan Zheng next_key->objectid = (u64)-1; 19935d4f98a2SYan Zheng next_key->type = (u8)-1; 19945d4f98a2SYan Zheng next_key->offset = (u64)-1; 19955d4f98a2SYan Zheng } 19965d4f98a2SYan Zheng 19975d4f98a2SYan Zheng parent = eb; 19985d4f98a2SYan Zheng while (1) { 1999581c1760SQu Wenruo struct btrfs_key first_key; 2000581c1760SQu Wenruo 20015d4f98a2SYan Zheng level = btrfs_header_level(parent); 20025d4f98a2SYan Zheng BUG_ON(level < lowest_level); 20035d4f98a2SYan Zheng 20045d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 2005cbca7d59SFilipe Manana if (ret < 0) 2006cbca7d59SFilipe Manana break; 20075d4f98a2SYan Zheng if (ret && slot > 0) 20085d4f98a2SYan Zheng slot--; 20095d4f98a2SYan Zheng 20105d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 20115d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 20125d4f98a2SYan Zheng 20135d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 20140b246afaSJeff Mahoney blocksize = fs_info->nodesize; 20155d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 201617515f1bSQu Wenruo btrfs_node_key_to_cpu(parent, &first_key, slot); 20175d4f98a2SYan Zheng 20185d4f98a2SYan Zheng if (level <= max_level) { 20195d4f98a2SYan Zheng eb = path->nodes[level]; 20205d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 20215d4f98a2SYan Zheng path->slots[level]); 20225d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 20235d4f98a2SYan Zheng path->slots[level]); 20245d4f98a2SYan Zheng } else { 20255d4f98a2SYan Zheng new_bytenr = 0; 20265d4f98a2SYan Zheng new_ptr_gen = 0; 20275d4f98a2SYan Zheng } 20285d4f98a2SYan Zheng 2029fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 20305d4f98a2SYan Zheng ret = level; 20315d4f98a2SYan Zheng break; 20325d4f98a2SYan Zheng } 20335d4f98a2SYan Zheng 20345d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 20355d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 20363fd0a558SYan, Zheng if (level <= lowest_level) { 20375d4f98a2SYan Zheng ret = 0; 20385d4f98a2SYan Zheng break; 20395d4f98a2SYan Zheng } 20405d4f98a2SYan Zheng 2041581c1760SQu Wenruo eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen, 2042581c1760SQu Wenruo level - 1, &first_key); 204364c043deSLiu Bo if (IS_ERR(eb)) { 204464c043deSLiu Bo ret = PTR_ERR(eb); 2045264813acSLiu Bo break; 204664c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 204764c043deSLiu Bo ret = -EIO; 2048416bc658SJosef Bacik free_extent_buffer(eb); 2049379cde74SStefan Behrens break; 2050416bc658SJosef Bacik } 20515d4f98a2SYan Zheng btrfs_tree_lock(eb); 20523fd0a558SYan, Zheng if (cow) { 20535d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 20545d4f98a2SYan Zheng slot, &eb); 20555d4f98a2SYan Zheng BUG_ON(ret); 20565d4f98a2SYan Zheng } 20578bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 20585d4f98a2SYan Zheng 20595d4f98a2SYan Zheng btrfs_tree_unlock(parent); 20605d4f98a2SYan Zheng free_extent_buffer(parent); 20615d4f98a2SYan Zheng 20625d4f98a2SYan Zheng parent = eb; 20635d4f98a2SYan Zheng continue; 20645d4f98a2SYan Zheng } 20655d4f98a2SYan Zheng 20663fd0a558SYan, Zheng if (!cow) { 20673fd0a558SYan, Zheng btrfs_tree_unlock(parent); 20683fd0a558SYan, Zheng free_extent_buffer(parent); 20693fd0a558SYan, Zheng cow = 1; 20703fd0a558SYan, Zheng goto again; 20713fd0a558SYan, Zheng } 20723fd0a558SYan, Zheng 20735d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 20745d4f98a2SYan Zheng path->slots[level]); 2075b3b4aa74SDavid Sterba btrfs_release_path(path); 20765d4f98a2SYan Zheng 20775d4f98a2SYan Zheng path->lowest_level = level; 20785d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 20795d4f98a2SYan Zheng path->lowest_level = 0; 20805d4f98a2SYan Zheng BUG_ON(ret); 20815d4f98a2SYan Zheng 20825d4f98a2SYan Zheng /* 2083824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 2084824d8dffSQu Wenruo * 2085824d8dffSQu Wenruo * We must trace both trees. 2086824d8dffSQu Wenruo * 1) Tree reloc subtree 2087824d8dffSQu Wenruo * If not traced, we will leak data numbers 2088824d8dffSQu Wenruo * 2) Fs subtree 2089824d8dffSQu Wenruo * If not traced, we will double count old data 2090f616f5cdSQu Wenruo * 2091f616f5cdSQu Wenruo * We don't scan the subtree right now, but only record 2092f616f5cdSQu Wenruo * the swapped tree blocks. 2093f616f5cdSQu Wenruo * The real subtree rescan is delayed until we have new 2094f616f5cdSQu Wenruo * CoW on the subtree root node before transaction commit. 2095824d8dffSQu Wenruo */ 2096370a11b8SQu Wenruo ret = btrfs_qgroup_add_swapped_blocks(trans, dest, 2097370a11b8SQu Wenruo rc->block_group, parent, slot, 2098370a11b8SQu Wenruo path->nodes[level], path->slots[level], 2099370a11b8SQu Wenruo last_snapshot); 2100370a11b8SQu Wenruo if (ret < 0) 2101370a11b8SQu Wenruo break; 2102824d8dffSQu Wenruo /* 21035d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 21045d4f98a2SYan Zheng */ 21055d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 21065d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 21075d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 21085d4f98a2SYan Zheng 21095d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 21105d4f98a2SYan Zheng path->slots[level], old_bytenr); 21115d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 21125d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 21135d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 21145d4f98a2SYan Zheng 211582fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, old_bytenr, 211682fa113fSQu Wenruo blocksize, path->nodes[level]->start); 211782fa113fSQu Wenruo ref.skip_qgroup = true; 211882fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 211982fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 21205d4f98a2SYan Zheng BUG_ON(ret); 212182fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 212282fa113fSQu Wenruo blocksize, 0); 212382fa113fSQu Wenruo ref.skip_qgroup = true; 212482fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 212582fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 21265d4f98a2SYan Zheng BUG_ON(ret); 21275d4f98a2SYan Zheng 2128ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, new_bytenr, 2129ffd4bb2aSQu Wenruo blocksize, path->nodes[level]->start); 2130ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 2131ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2132ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 21335d4f98a2SYan Zheng BUG_ON(ret); 21345d4f98a2SYan Zheng 2135ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, old_bytenr, 2136ffd4bb2aSQu Wenruo blocksize, 0); 2137ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 2138ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2139ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 21405d4f98a2SYan Zheng BUG_ON(ret); 21415d4f98a2SYan Zheng 21425d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 21435d4f98a2SYan Zheng 21445d4f98a2SYan Zheng ret = level; 21455d4f98a2SYan Zheng break; 21465d4f98a2SYan Zheng } 21475d4f98a2SYan Zheng btrfs_tree_unlock(parent); 21485d4f98a2SYan Zheng free_extent_buffer(parent); 21495d4f98a2SYan Zheng return ret; 21505d4f98a2SYan Zheng } 21515d4f98a2SYan Zheng 21525d4f98a2SYan Zheng /* 21535d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 21545d4f98a2SYan Zheng */ 21555d4f98a2SYan Zheng static noinline_for_stack 21565d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 21575d4f98a2SYan Zheng int *level) 21585d4f98a2SYan Zheng { 21595d4f98a2SYan Zheng struct extent_buffer *eb; 21605d4f98a2SYan Zheng int i; 21615d4f98a2SYan Zheng u64 last_snapshot; 21625d4f98a2SYan Zheng u32 nritems; 21635d4f98a2SYan Zheng 21645d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 21655d4f98a2SYan Zheng 21665d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 21675d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 21685d4f98a2SYan Zheng path->nodes[i] = NULL; 21695d4f98a2SYan Zheng } 21705d4f98a2SYan Zheng 21715d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 21725d4f98a2SYan Zheng eb = path->nodes[i]; 21735d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 21745d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 21755d4f98a2SYan Zheng path->slots[i]++; 21765d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 21775d4f98a2SYan Zheng last_snapshot) 21785d4f98a2SYan Zheng continue; 21795d4f98a2SYan Zheng 21805d4f98a2SYan Zheng *level = i; 21815d4f98a2SYan Zheng return 0; 21825d4f98a2SYan Zheng } 21835d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 21845d4f98a2SYan Zheng path->nodes[i] = NULL; 21855d4f98a2SYan Zheng } 21865d4f98a2SYan Zheng return 1; 21875d4f98a2SYan Zheng } 21885d4f98a2SYan Zheng 21895d4f98a2SYan Zheng /* 21905d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 21915d4f98a2SYan Zheng */ 21925d4f98a2SYan Zheng static noinline_for_stack 21935d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 21945d4f98a2SYan Zheng int *level) 21955d4f98a2SYan Zheng { 21962ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 21975d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 21985d4f98a2SYan Zheng int i; 21995d4f98a2SYan Zheng u64 bytenr; 22005d4f98a2SYan Zheng u64 ptr_gen = 0; 22015d4f98a2SYan Zheng u64 last_snapshot; 22025d4f98a2SYan Zheng u32 nritems; 22035d4f98a2SYan Zheng 22045d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 22055d4f98a2SYan Zheng 22065d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 2207581c1760SQu Wenruo struct btrfs_key first_key; 2208581c1760SQu Wenruo 22095d4f98a2SYan Zheng eb = path->nodes[i]; 22105d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 22115d4f98a2SYan Zheng while (path->slots[i] < nritems) { 22125d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 22135d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 22145d4f98a2SYan Zheng break; 22155d4f98a2SYan Zheng path->slots[i]++; 22165d4f98a2SYan Zheng } 22175d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 22185d4f98a2SYan Zheng if (i == *level) 22195d4f98a2SYan Zheng break; 22205d4f98a2SYan Zheng *level = i + 1; 22215d4f98a2SYan Zheng return 0; 22225d4f98a2SYan Zheng } 22235d4f98a2SYan Zheng if (i == 1) { 22245d4f98a2SYan Zheng *level = i; 22255d4f98a2SYan Zheng return 0; 22265d4f98a2SYan Zheng } 22275d4f98a2SYan Zheng 22285d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2229581c1760SQu Wenruo btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); 2230581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1, 2231581c1760SQu Wenruo &first_key); 223264c043deSLiu Bo if (IS_ERR(eb)) { 223364c043deSLiu Bo return PTR_ERR(eb); 223464c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2235416bc658SJosef Bacik free_extent_buffer(eb); 2236416bc658SJosef Bacik return -EIO; 2237416bc658SJosef Bacik } 22385d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 22395d4f98a2SYan Zheng path->nodes[i - 1] = eb; 22405d4f98a2SYan Zheng path->slots[i - 1] = 0; 22415d4f98a2SYan Zheng } 22425d4f98a2SYan Zheng return 1; 22435d4f98a2SYan Zheng } 22445d4f98a2SYan Zheng 22455d4f98a2SYan Zheng /* 22465d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 22475d4f98a2SYan Zheng * [min_key, max_key) 22485d4f98a2SYan Zheng */ 22495d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 22505d4f98a2SYan Zheng struct btrfs_key *min_key, 22515d4f98a2SYan Zheng struct btrfs_key *max_key) 22525d4f98a2SYan Zheng { 22530b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 22545d4f98a2SYan Zheng struct inode *inode = NULL; 22555d4f98a2SYan Zheng u64 objectid; 22565d4f98a2SYan Zheng u64 start, end; 225733345d01SLi Zefan u64 ino; 22585d4f98a2SYan Zheng 22595d4f98a2SYan Zheng objectid = min_key->objectid; 22605d4f98a2SYan Zheng while (1) { 22615d4f98a2SYan Zheng cond_resched(); 22625d4f98a2SYan Zheng iput(inode); 22635d4f98a2SYan Zheng 22645d4f98a2SYan Zheng if (objectid > max_key->objectid) 22655d4f98a2SYan Zheng break; 22665d4f98a2SYan Zheng 22675d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 22685d4f98a2SYan Zheng if (!inode) 22695d4f98a2SYan Zheng break; 22704a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 22715d4f98a2SYan Zheng 227233345d01SLi Zefan if (ino > max_key->objectid) { 22735d4f98a2SYan Zheng iput(inode); 22745d4f98a2SYan Zheng break; 22755d4f98a2SYan Zheng } 22765d4f98a2SYan Zheng 227733345d01SLi Zefan objectid = ino + 1; 22785d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 22795d4f98a2SYan Zheng continue; 22805d4f98a2SYan Zheng 228133345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 22825d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 22835d4f98a2SYan Zheng continue; 22845d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 22855d4f98a2SYan Zheng start = 0; 22865d4f98a2SYan Zheng else { 22875d4f98a2SYan Zheng start = min_key->offset; 22880b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 22895d4f98a2SYan Zheng } 22905d4f98a2SYan Zheng } else { 22915d4f98a2SYan Zheng start = 0; 22925d4f98a2SYan Zheng } 22935d4f98a2SYan Zheng 229433345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 22955d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 22965d4f98a2SYan Zheng continue; 22975d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 22985d4f98a2SYan Zheng end = (u64)-1; 22995d4f98a2SYan Zheng } else { 23005d4f98a2SYan Zheng if (max_key->offset == 0) 23015d4f98a2SYan Zheng continue; 23025d4f98a2SYan Zheng end = max_key->offset; 23030b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 23045d4f98a2SYan Zheng end--; 23055d4f98a2SYan Zheng } 23065d4f98a2SYan Zheng } else { 23075d4f98a2SYan Zheng end = (u64)-1; 23085d4f98a2SYan Zheng } 23095d4f98a2SYan Zheng 23105d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2311d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 2312dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 2313d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 23145d4f98a2SYan Zheng } 23155d4f98a2SYan Zheng return 0; 23165d4f98a2SYan Zheng } 23175d4f98a2SYan Zheng 23185d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 23195d4f98a2SYan Zheng struct btrfs_key *key) 23205d4f98a2SYan Zheng 23215d4f98a2SYan Zheng { 23225d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 23235d4f98a2SYan Zheng if (!path->nodes[level]) 23245d4f98a2SYan Zheng break; 23255d4f98a2SYan Zheng if (path->slots[level] + 1 < 23265d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 23275d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 23285d4f98a2SYan Zheng path->slots[level] + 1); 23295d4f98a2SYan Zheng return 0; 23305d4f98a2SYan Zheng } 23315d4f98a2SYan Zheng level++; 23325d4f98a2SYan Zheng } 23335d4f98a2SYan Zheng return 1; 23345d4f98a2SYan Zheng } 23355d4f98a2SYan Zheng 23365d4f98a2SYan Zheng /* 2337d2311e69SQu Wenruo * Insert current subvolume into reloc_control::dirty_subvol_roots 2338d2311e69SQu Wenruo */ 2339d2311e69SQu Wenruo static void insert_dirty_subvol(struct btrfs_trans_handle *trans, 2340d2311e69SQu Wenruo struct reloc_control *rc, 2341d2311e69SQu Wenruo struct btrfs_root *root) 2342d2311e69SQu Wenruo { 2343d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2344d2311e69SQu Wenruo struct btrfs_root_item *reloc_root_item; 2345d2311e69SQu Wenruo 2346d2311e69SQu Wenruo /* @root must be a subvolume tree root with a valid reloc tree */ 2347d2311e69SQu Wenruo ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 2348d2311e69SQu Wenruo ASSERT(reloc_root); 2349d2311e69SQu Wenruo 2350d2311e69SQu Wenruo reloc_root_item = &reloc_root->root_item; 2351d2311e69SQu Wenruo memset(&reloc_root_item->drop_progress, 0, 2352d2311e69SQu Wenruo sizeof(reloc_root_item->drop_progress)); 2353d2311e69SQu Wenruo reloc_root_item->drop_level = 0; 2354d2311e69SQu Wenruo btrfs_set_root_refs(reloc_root_item, 0); 2355d2311e69SQu Wenruo btrfs_update_reloc_root(trans, root); 2356d2311e69SQu Wenruo 2357d2311e69SQu Wenruo if (list_empty(&root->reloc_dirty_list)) { 235800246528SJosef Bacik btrfs_grab_root(root); 2359d2311e69SQu Wenruo list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); 2360d2311e69SQu Wenruo } 2361d2311e69SQu Wenruo } 2362d2311e69SQu Wenruo 2363d2311e69SQu Wenruo static int clean_dirty_subvols(struct reloc_control *rc) 2364d2311e69SQu Wenruo { 2365d2311e69SQu Wenruo struct btrfs_root *root; 2366d2311e69SQu Wenruo struct btrfs_root *next; 2367d2311e69SQu Wenruo int ret = 0; 236830d40577SQu Wenruo int ret2; 2369d2311e69SQu Wenruo 2370d2311e69SQu Wenruo list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, 2371d2311e69SQu Wenruo reloc_dirty_list) { 237230d40577SQu Wenruo if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 237330d40577SQu Wenruo /* Merged subvolume, cleanup its reloc root */ 2374d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2375d2311e69SQu Wenruo 2376d2311e69SQu Wenruo list_del_init(&root->reloc_dirty_list); 2377d2311e69SQu Wenruo root->reloc_root = NULL; 23786282675eSQu Wenruo /* 23796282675eSQu Wenruo * Need barrier to ensure clear_bit() only happens after 23806282675eSQu Wenruo * root->reloc_root = NULL. Pairs with have_reloc_root. 23816282675eSQu Wenruo */ 23826282675eSQu Wenruo smp_wmb(); 23831fac4a54SQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 2384f28de8d8SJosef Bacik if (reloc_root) { 2385f44deb74SJosef Bacik /* 2386f44deb74SJosef Bacik * btrfs_drop_snapshot drops our ref we hold for 2387f44deb74SJosef Bacik * ->reloc_root. If it fails however we must 2388f44deb74SJosef Bacik * drop the ref ourselves. 2389f44deb74SJosef Bacik */ 2390f28de8d8SJosef Bacik ret2 = btrfs_drop_snapshot(reloc_root, 0, 1); 2391f44deb74SJosef Bacik if (ret2 < 0) { 2392f44deb74SJosef Bacik btrfs_put_root(reloc_root); 2393f44deb74SJosef Bacik if (!ret) 2394f28de8d8SJosef Bacik ret = ret2; 2395f28de8d8SJosef Bacik } 2396f44deb74SJosef Bacik } 239700246528SJosef Bacik btrfs_put_root(root); 239830d40577SQu Wenruo } else { 239930d40577SQu Wenruo /* Orphan reloc tree, just clean it up */ 24000078a9f9SNikolay Borisov ret2 = btrfs_drop_snapshot(root, 0, 1); 2401f44deb74SJosef Bacik if (ret2 < 0) { 2402f44deb74SJosef Bacik btrfs_put_root(root); 2403f44deb74SJosef Bacik if (!ret) 240430d40577SQu Wenruo ret = ret2; 240530d40577SQu Wenruo } 2406d2311e69SQu Wenruo } 2407f44deb74SJosef Bacik } 2408d2311e69SQu Wenruo return ret; 2409d2311e69SQu Wenruo } 2410d2311e69SQu Wenruo 2411d2311e69SQu Wenruo /* 24125d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 24135d4f98a2SYan Zheng * fs tree. 24145d4f98a2SYan Zheng */ 24155d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 24165d4f98a2SYan Zheng struct btrfs_root *root) 24175d4f98a2SYan Zheng { 24180b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 24195d4f98a2SYan Zheng struct btrfs_key key; 24205d4f98a2SYan Zheng struct btrfs_key next_key; 24219e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 24225d4f98a2SYan Zheng struct btrfs_root *reloc_root; 24235d4f98a2SYan Zheng struct btrfs_root_item *root_item; 24245d4f98a2SYan Zheng struct btrfs_path *path; 24253fd0a558SYan, Zheng struct extent_buffer *leaf; 24265d4f98a2SYan Zheng int level; 24275d4f98a2SYan Zheng int max_level; 24285d4f98a2SYan Zheng int replaced = 0; 24295d4f98a2SYan Zheng int ret; 24305d4f98a2SYan Zheng int err = 0; 24313fd0a558SYan, Zheng u32 min_reserved; 24325d4f98a2SYan Zheng 24335d4f98a2SYan Zheng path = btrfs_alloc_path(); 24345d4f98a2SYan Zheng if (!path) 24355d4f98a2SYan Zheng return -ENOMEM; 2436e4058b54SDavid Sterba path->reada = READA_FORWARD; 24375d4f98a2SYan Zheng 24385d4f98a2SYan Zheng reloc_root = root->reloc_root; 24395d4f98a2SYan Zheng root_item = &reloc_root->root_item; 24405d4f98a2SYan Zheng 24415d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 24425d4f98a2SYan Zheng level = btrfs_root_level(root_item); 244367439dadSDavid Sterba atomic_inc(&reloc_root->node->refs); 24445d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 24455d4f98a2SYan Zheng path->slots[level] = 0; 24465d4f98a2SYan Zheng } else { 24475d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 24485d4f98a2SYan Zheng 24495d4f98a2SYan Zheng level = root_item->drop_level; 24505d4f98a2SYan Zheng BUG_ON(level == 0); 24515d4f98a2SYan Zheng path->lowest_level = level; 24525d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 245333c66f43SYan Zheng path->lowest_level = 0; 24545d4f98a2SYan Zheng if (ret < 0) { 24555d4f98a2SYan Zheng btrfs_free_path(path); 24565d4f98a2SYan Zheng return ret; 24575d4f98a2SYan Zheng } 24585d4f98a2SYan Zheng 24595d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 24605d4f98a2SYan Zheng path->slots[level]); 24615d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 24625d4f98a2SYan Zheng 24635d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 24645d4f98a2SYan Zheng } 24655d4f98a2SYan Zheng 24660b246afaSJeff Mahoney min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 24675d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 24685d4f98a2SYan Zheng 24695d4f98a2SYan Zheng while (1) { 247008e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 247108e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 24723fd0a558SYan, Zheng if (ret) { 24739e6a0c52SJosef Bacik err = ret; 24749e6a0c52SJosef Bacik goto out; 24753fd0a558SYan, Zheng } 24769e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 24779e6a0c52SJosef Bacik if (IS_ERR(trans)) { 24789e6a0c52SJosef Bacik err = PTR_ERR(trans); 24799e6a0c52SJosef Bacik trans = NULL; 24809e6a0c52SJosef Bacik goto out; 24819e6a0c52SJosef Bacik } 24822abc726aSJosef Bacik 24832abc726aSJosef Bacik /* 24842abc726aSJosef Bacik * At this point we no longer have a reloc_control, so we can't 24852abc726aSJosef Bacik * depend on btrfs_init_reloc_root to update our last_trans. 24862abc726aSJosef Bacik * 24872abc726aSJosef Bacik * But that's ok, we started the trans handle on our 24882abc726aSJosef Bacik * corresponding fs_root, which means it's been added to the 24892abc726aSJosef Bacik * dirty list. At commit time we'll still call 24902abc726aSJosef Bacik * btrfs_update_reloc_root() and update our root item 24912abc726aSJosef Bacik * appropriately. 24922abc726aSJosef Bacik */ 24932abc726aSJosef Bacik reloc_root->last_trans = trans->transid; 24949e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 24953fd0a558SYan, Zheng 24963fd0a558SYan, Zheng replaced = 0; 24975d4f98a2SYan Zheng max_level = level; 24985d4f98a2SYan Zheng 24995d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 25005d4f98a2SYan Zheng if (ret < 0) { 25015d4f98a2SYan Zheng err = ret; 25025d4f98a2SYan Zheng goto out; 25035d4f98a2SYan Zheng } 25045d4f98a2SYan Zheng if (ret > 0) 25055d4f98a2SYan Zheng break; 25065d4f98a2SYan Zheng 25075d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 25085d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 25095d4f98a2SYan Zheng ret = 0; 25105d4f98a2SYan Zheng } else { 25113d0174f7SQu Wenruo ret = replace_path(trans, rc, root, reloc_root, path, 25123fd0a558SYan, Zheng &next_key, level, max_level); 25135d4f98a2SYan Zheng } 25145d4f98a2SYan Zheng if (ret < 0) { 25155d4f98a2SYan Zheng err = ret; 25165d4f98a2SYan Zheng goto out; 25175d4f98a2SYan Zheng } 25185d4f98a2SYan Zheng 25195d4f98a2SYan Zheng if (ret > 0) { 25205d4f98a2SYan Zheng level = ret; 25215d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 25225d4f98a2SYan Zheng path->slots[level]); 25235d4f98a2SYan Zheng replaced = 1; 25245d4f98a2SYan Zheng } 25255d4f98a2SYan Zheng 25265d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 25275d4f98a2SYan Zheng if (ret > 0) 25285d4f98a2SYan Zheng break; 25295d4f98a2SYan Zheng 25305d4f98a2SYan Zheng BUG_ON(level == 0); 25315d4f98a2SYan Zheng /* 25325d4f98a2SYan Zheng * save the merging progress in the drop_progress. 25335d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 25345d4f98a2SYan Zheng */ 25355d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 25365d4f98a2SYan Zheng path->slots[level]); 25375d4f98a2SYan Zheng root_item->drop_level = level; 25385d4f98a2SYan Zheng 25393a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 25409e6a0c52SJosef Bacik trans = NULL; 25415d4f98a2SYan Zheng 25422ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 25435d4f98a2SYan Zheng 25445d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 25455d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 25465d4f98a2SYan Zheng } 25475d4f98a2SYan Zheng 25485d4f98a2SYan Zheng /* 25495d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 25505d4f98a2SYan Zheng * relocated and the block is tree root. 25515d4f98a2SYan Zheng */ 25525d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 25535d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 25545d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 25555d4f98a2SYan Zheng free_extent_buffer(leaf); 25565d4f98a2SYan Zheng if (ret < 0) 25575d4f98a2SYan Zheng err = ret; 25585d4f98a2SYan Zheng out: 25595d4f98a2SYan Zheng btrfs_free_path(path); 25605d4f98a2SYan Zheng 2561d2311e69SQu Wenruo if (err == 0) 2562d2311e69SQu Wenruo insert_dirty_subvol(trans, rc, root); 25635d4f98a2SYan Zheng 25649e6a0c52SJosef Bacik if (trans) 25653a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 25665d4f98a2SYan Zheng 25672ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 25685d4f98a2SYan Zheng 25695d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 25705d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 25715d4f98a2SYan Zheng 25725d4f98a2SYan Zheng return err; 25735d4f98a2SYan Zheng } 25745d4f98a2SYan Zheng 25753fd0a558SYan, Zheng static noinline_for_stack 25763fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 25775d4f98a2SYan Zheng { 25783fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 25790b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 25803fd0a558SYan, Zheng struct btrfs_root *reloc_root; 25815d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 25823fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 25833fd0a558SYan, Zheng u64 num_bytes = 0; 25843fd0a558SYan, Zheng int ret; 25853fd0a558SYan, Zheng 25860b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 25870b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 25883fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 25890b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 25907585717fSChris Mason 25913fd0a558SYan, Zheng again: 25923fd0a558SYan, Zheng if (!err) { 25933fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 259408e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 259508e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 25963fd0a558SYan, Zheng if (ret) 25973fd0a558SYan, Zheng err = ret; 25983fd0a558SYan, Zheng } 25993fd0a558SYan, Zheng 26007a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 26013612b495STsutomu Itoh if (IS_ERR(trans)) { 26023612b495STsutomu Itoh if (!err) 26032ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 260463f018beSNikolay Borisov num_bytes, NULL); 26053612b495STsutomu Itoh return PTR_ERR(trans); 26063612b495STsutomu Itoh } 26073fd0a558SYan, Zheng 26083fd0a558SYan, Zheng if (!err) { 26093fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 26103a45bb20SJeff Mahoney btrfs_end_transaction(trans); 26112ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 261263f018beSNikolay Borisov num_bytes, NULL); 26133fd0a558SYan, Zheng goto again; 26143fd0a558SYan, Zheng } 26153fd0a558SYan, Zheng } 26163fd0a558SYan, Zheng 26173fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 26183fd0a558SYan, Zheng 26193fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 26203fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 26213fd0a558SYan, Zheng struct btrfs_root, root_list); 26223fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 26233fd0a558SYan, Zheng 26240b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 26253fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 26263fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 26273fd0a558SYan, Zheng 26283fd0a558SYan, Zheng /* 26293fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 26303fd0a558SYan, Zheng * knows it should resumes merging 26313fd0a558SYan, Zheng */ 26323fd0a558SYan, Zheng if (!err) 26333fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 26343fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 26353fd0a558SYan, Zheng 26363fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 263700246528SJosef Bacik btrfs_put_root(root); 26383fd0a558SYan, Zheng } 26393fd0a558SYan, Zheng 26403fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 26413fd0a558SYan, Zheng 26423fd0a558SYan, Zheng if (!err) 26433a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 26443fd0a558SYan, Zheng else 26453a45bb20SJeff Mahoney btrfs_end_transaction(trans); 26463fd0a558SYan, Zheng return err; 26473fd0a558SYan, Zheng } 26483fd0a558SYan, Zheng 26493fd0a558SYan, Zheng static noinline_for_stack 2650aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2651aca1bba6SLiu Bo { 2652aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2653aca1bba6SLiu Bo 2654aca1bba6SLiu Bo while (!list_empty(list)) { 2655aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2656aca1bba6SLiu Bo root_list); 2657bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 2658aca1bba6SLiu Bo } 2659aca1bba6SLiu Bo } 2660aca1bba6SLiu Bo 2661aca1bba6SLiu Bo static noinline_for_stack 266294404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 26633fd0a558SYan, Zheng { 26640b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 26655d4f98a2SYan Zheng struct btrfs_root *root; 26665d4f98a2SYan Zheng struct btrfs_root *reloc_root; 26673fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 26683fd0a558SYan, Zheng int found = 0; 2669aca1bba6SLiu Bo int ret = 0; 26703fd0a558SYan, Zheng again: 26713fd0a558SYan, Zheng root = rc->extent_root; 26727585717fSChris Mason 26737585717fSChris Mason /* 26747585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 26757585717fSChris Mason * we have to make sure nobody is in the middle of 26767585717fSChris Mason * adding their roots to the list while we are 26777585717fSChris Mason * doing this splice 26787585717fSChris Mason */ 26790b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 26803fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 26810b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 26825d4f98a2SYan Zheng 26833fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 26843fd0a558SYan, Zheng found = 1; 26853fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 26863fd0a558SYan, Zheng struct btrfs_root, root_list); 26875d4f98a2SYan Zheng 26885d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 26890b246afaSJeff Mahoney root = read_fs_root(fs_info, 26905d4f98a2SYan Zheng reloc_root->root_key.offset); 26915d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 26925d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 26935d4f98a2SYan Zheng 26943fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 269500246528SJosef Bacik btrfs_put_root(root); 2696b37b39cdSJosef Bacik if (ret) { 269725e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 269825e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 269925e293c2SWang Shilong &reloc_roots); 2700aca1bba6SLiu Bo goto out; 2701b37b39cdSJosef Bacik } 27023fd0a558SYan, Zheng } else { 27033fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 270430d40577SQu Wenruo /* Don't forget to queue this reloc root for cleanup */ 270530d40577SQu Wenruo list_add_tail(&reloc_root->reloc_dirty_list, 270630d40577SQu Wenruo &rc->dirty_subvol_roots); 27073fd0a558SYan, Zheng } 27085d4f98a2SYan Zheng } 27095d4f98a2SYan Zheng 27103fd0a558SYan, Zheng if (found) { 27113fd0a558SYan, Zheng found = 0; 27123fd0a558SYan, Zheng goto again; 27135d4f98a2SYan Zheng } 2714aca1bba6SLiu Bo out: 2715aca1bba6SLiu Bo if (ret) { 27160b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2717aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2718aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2719467bb1d2SWang Shilong 2720467bb1d2SWang Shilong /* new reloc root may be added */ 27210b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2722467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 27230b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2724467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2725467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2726aca1bba6SLiu Bo } 2727aca1bba6SLiu Bo 27287b7b7431SJosef Bacik /* 27297b7b7431SJosef Bacik * We used to have 27307b7b7431SJosef Bacik * 27317b7b7431SJosef Bacik * BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 27327b7b7431SJosef Bacik * 27337b7b7431SJosef Bacik * here, but it's wrong. If we fail to start the transaction in 27347b7b7431SJosef Bacik * prepare_to_merge() we will have only 0 ref reloc roots, none of which 27357b7b7431SJosef Bacik * have actually been removed from the reloc_root_tree rb tree. This is 27367b7b7431SJosef Bacik * fine because we're bailing here, and we hold a reference on the root 27377b7b7431SJosef Bacik * for the list that holds it, so these roots will be cleaned up when we 27387b7b7431SJosef Bacik * do the reloc_dirty_list afterwards. Meanwhile the root->reloc_root 27397b7b7431SJosef Bacik * will be cleaned up on unmount. 27407b7b7431SJosef Bacik * 27417b7b7431SJosef Bacik * The remaining nodes will be cleaned up by free_reloc_control. 27427b7b7431SJosef Bacik */ 27435d4f98a2SYan Zheng } 27445d4f98a2SYan Zheng 27455d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 27465d4f98a2SYan Zheng { 27475d4f98a2SYan Zheng struct tree_block *block; 27485d4f98a2SYan Zheng struct rb_node *rb_node; 27495d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 27505d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 27515d4f98a2SYan Zheng rb_erase(rb_node, blocks); 27525d4f98a2SYan Zheng kfree(block); 27535d4f98a2SYan Zheng } 27545d4f98a2SYan Zheng } 27555d4f98a2SYan Zheng 27565d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 27575d4f98a2SYan Zheng struct btrfs_root *reloc_root) 27585d4f98a2SYan Zheng { 27590b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 27605d4f98a2SYan Zheng struct btrfs_root *root; 2761442b1ac5SJosef Bacik int ret; 27625d4f98a2SYan Zheng 27635d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 27645d4f98a2SYan Zheng return 0; 27655d4f98a2SYan Zheng 27660b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 27675d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 27685d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 2769442b1ac5SJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 277000246528SJosef Bacik btrfs_put_root(root); 27715d4f98a2SYan Zheng 2772442b1ac5SJosef Bacik return ret; 27735d4f98a2SYan Zheng } 27745d4f98a2SYan Zheng 27753fd0a558SYan, Zheng static noinline_for_stack 27763fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 27773fd0a558SYan, Zheng struct reloc_control *rc, 27785d4f98a2SYan Zheng struct backref_node *node, 2779dc4103f9SWang Shilong struct backref_edge *edges[]) 27805d4f98a2SYan Zheng { 27815d4f98a2SYan Zheng struct backref_node *next; 27825d4f98a2SYan Zheng struct btrfs_root *root; 27833fd0a558SYan, Zheng int index = 0; 27843fd0a558SYan, Zheng 27855d4f98a2SYan Zheng next = node; 27865d4f98a2SYan Zheng while (1) { 27875d4f98a2SYan Zheng cond_resched(); 27885d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 27895d4f98a2SYan Zheng root = next->root; 27903fd0a558SYan, Zheng BUG_ON(!root); 279127cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 27925d4f98a2SYan Zheng 27935d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 27945d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 27955d4f98a2SYan Zheng break; 27965d4f98a2SYan Zheng } 27975d4f98a2SYan Zheng 27985d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 27993fd0a558SYan, Zheng root = root->reloc_root; 28003fd0a558SYan, Zheng 28013fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 28023fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 28033fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 28043fd0a558SYan, Zheng next->new_bytenr = root->node->start; 280500246528SJosef Bacik btrfs_put_root(next->root); 280600246528SJosef Bacik next->root = btrfs_grab_root(root); 28070b530bc5SJosef Bacik ASSERT(next->root); 28083fd0a558SYan, Zheng list_add_tail(&next->list, 28093fd0a558SYan, Zheng &rc->backref_cache.changed); 28109569cc20SQu Wenruo mark_block_processed(rc, next); 28115d4f98a2SYan Zheng break; 28125d4f98a2SYan Zheng } 28135d4f98a2SYan Zheng 28143fd0a558SYan, Zheng WARN_ON(1); 28155d4f98a2SYan Zheng root = NULL; 28165d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 28175d4f98a2SYan Zheng if (!next || next->level <= node->level) 28185d4f98a2SYan Zheng break; 28195d4f98a2SYan Zheng } 28203fd0a558SYan, Zheng if (!root) 28213fd0a558SYan, Zheng return NULL; 28225d4f98a2SYan Zheng 28233fd0a558SYan, Zheng next = node; 28243fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 28253fd0a558SYan, Zheng while (1) { 28263fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 28273fd0a558SYan, Zheng if (--index < 0) 28283fd0a558SYan, Zheng break; 28293fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 28303fd0a558SYan, Zheng } 28315d4f98a2SYan Zheng return root; 28325d4f98a2SYan Zheng } 28335d4f98a2SYan Zheng 28343fd0a558SYan, Zheng /* 28353fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 28363fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 28373fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 28383fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 28393fd0a558SYan, Zheng */ 28405d4f98a2SYan Zheng static noinline_for_stack 2841147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 28425d4f98a2SYan Zheng { 28433fd0a558SYan, Zheng struct backref_node *next; 28443fd0a558SYan, Zheng struct btrfs_root *root; 28453fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 28465d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28473fd0a558SYan, Zheng int index = 0; 28483fd0a558SYan, Zheng 28493fd0a558SYan, Zheng next = node; 28503fd0a558SYan, Zheng while (1) { 28513fd0a558SYan, Zheng cond_resched(); 28523fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 28533fd0a558SYan, Zheng root = next->root; 28543fd0a558SYan, Zheng BUG_ON(!root); 28553fd0a558SYan, Zheng 285625985edcSLucas De Marchi /* no other choice for non-references counted tree */ 285727cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 28583fd0a558SYan, Zheng return root; 28593fd0a558SYan, Zheng 28603fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 28613fd0a558SYan, Zheng fs_root = root; 28623fd0a558SYan, Zheng 28633fd0a558SYan, Zheng if (next != node) 28643fd0a558SYan, Zheng return NULL; 28653fd0a558SYan, Zheng 28663fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 28673fd0a558SYan, Zheng if (!next || next->level <= node->level) 28683fd0a558SYan, Zheng break; 28693fd0a558SYan, Zheng } 28703fd0a558SYan, Zheng 28713fd0a558SYan, Zheng if (!fs_root) 28723fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 28733fd0a558SYan, Zheng return fs_root; 28745d4f98a2SYan Zheng } 28755d4f98a2SYan Zheng 28765d4f98a2SYan Zheng static noinline_for_stack 28773fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 28783fd0a558SYan, Zheng struct backref_node *node, int reserve) 28795d4f98a2SYan Zheng { 28800b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 28813fd0a558SYan, Zheng struct backref_node *next = node; 28823fd0a558SYan, Zheng struct backref_edge *edge; 28833fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28843fd0a558SYan, Zheng u64 num_bytes = 0; 28853fd0a558SYan, Zheng int index = 0; 28865d4f98a2SYan Zheng 28873fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 28883fd0a558SYan, Zheng 28893fd0a558SYan, Zheng while (next) { 28903fd0a558SYan, Zheng cond_resched(); 28915d4f98a2SYan Zheng while (1) { 28923fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 28935d4f98a2SYan Zheng break; 28945d4f98a2SYan Zheng 28950b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 28963fd0a558SYan, Zheng 28973fd0a558SYan, Zheng if (list_empty(&next->upper)) 28983fd0a558SYan, Zheng break; 28993fd0a558SYan, Zheng 29003fd0a558SYan, Zheng edge = list_entry(next->upper.next, 29013fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 29023fd0a558SYan, Zheng edges[index++] = edge; 29033fd0a558SYan, Zheng next = edge->node[UPPER]; 29045d4f98a2SYan Zheng } 29053fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 29063fd0a558SYan, Zheng } 29073fd0a558SYan, Zheng return num_bytes; 29083fd0a558SYan, Zheng } 29093fd0a558SYan, Zheng 29103fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 29113fd0a558SYan, Zheng struct reloc_control *rc, 29123fd0a558SYan, Zheng struct backref_node *node) 29133fd0a558SYan, Zheng { 29143fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2915da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 29163fd0a558SYan, Zheng u64 num_bytes; 29173fd0a558SYan, Zheng int ret; 29180647bf56SWang Shilong u64 tmp; 29193fd0a558SYan, Zheng 29203fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 29213fd0a558SYan, Zheng 29223fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 29230647bf56SWang Shilong rc->reserved_bytes += num_bytes; 29248ca17f0fSJosef Bacik 29258ca17f0fSJosef Bacik /* 29268ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 29278ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 29288ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 29298ca17f0fSJosef Bacik */ 29300647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 29318ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 29323fd0a558SYan, Zheng if (ret) { 2933da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 29340647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 29350647bf56SWang Shilong tmp <<= 1; 29360647bf56SWang Shilong /* 29370647bf56SWang Shilong * only one thread can access block_rsv at this point, 29380647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 29390647bf56SWang Shilong * we expand more reservation size here to allow enough 294052042d8eSAndrea Gelmini * space for relocation and we will return earlier in 29410647bf56SWang Shilong * enospc case. 29420647bf56SWang Shilong */ 2943da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 29440647bf56SWang Shilong RELOCATION_RESERVED_NODES; 29458ca17f0fSJosef Bacik return -EAGAIN; 29463fd0a558SYan, Zheng } 29473fd0a558SYan, Zheng 29483fd0a558SYan, Zheng return 0; 29493fd0a558SYan, Zheng } 29503fd0a558SYan, Zheng 29515d4f98a2SYan Zheng /* 29525d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 29535d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 29545d4f98a2SYan Zheng * 29555d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 29565d4f98a2SYan Zheng * in that case this function just updates pointers. 29575d4f98a2SYan Zheng */ 29585d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 29593fd0a558SYan, Zheng struct reloc_control *rc, 29605d4f98a2SYan Zheng struct backref_node *node, 29615d4f98a2SYan Zheng struct btrfs_key *key, 29625d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 29635d4f98a2SYan Zheng { 29642ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 29655d4f98a2SYan Zheng struct backref_node *upper; 29665d4f98a2SYan Zheng struct backref_edge *edge; 29675d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 29685d4f98a2SYan Zheng struct btrfs_root *root; 29695d4f98a2SYan Zheng struct extent_buffer *eb; 29705d4f98a2SYan Zheng u32 blocksize; 29715d4f98a2SYan Zheng u64 bytenr; 29725d4f98a2SYan Zheng u64 generation; 29735d4f98a2SYan Zheng int slot; 29745d4f98a2SYan Zheng int ret; 29755d4f98a2SYan Zheng int err = 0; 29765d4f98a2SYan Zheng 29775d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 29785d4f98a2SYan Zheng 29795d4f98a2SYan Zheng path->lowest_level = node->level + 1; 29803fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 29815d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 2982581c1760SQu Wenruo struct btrfs_key first_key; 298382fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 2984581c1760SQu Wenruo 29855d4f98a2SYan Zheng cond_resched(); 29865d4f98a2SYan Zheng 29875d4f98a2SYan Zheng upper = edge->node[UPPER]; 2988dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 29893fd0a558SYan, Zheng BUG_ON(!root); 29905d4f98a2SYan Zheng 29913fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 29923fd0a558SYan, Zheng if (!lowest) { 29933fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 29943fd0a558SYan, Zheng upper->level, &slot); 2995cbca7d59SFilipe Manana if (ret < 0) { 2996cbca7d59SFilipe Manana err = ret; 2997cbca7d59SFilipe Manana goto next; 2998cbca7d59SFilipe Manana } 29993fd0a558SYan, Zheng BUG_ON(ret); 30003fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 30013fd0a558SYan, Zheng if (node->eb->start == bytenr) 30023fd0a558SYan, Zheng goto next; 30033fd0a558SYan, Zheng } 30045d4f98a2SYan Zheng drop_node_buffer(upper); 30053fd0a558SYan, Zheng } 30065d4f98a2SYan Zheng 30075d4f98a2SYan Zheng if (!upper->eb) { 30085d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 30093561b9dbSLiu Bo if (ret) { 30103561b9dbSLiu Bo if (ret < 0) 30115d4f98a2SYan Zheng err = ret; 30123561b9dbSLiu Bo else 30133561b9dbSLiu Bo err = -ENOENT; 30143561b9dbSLiu Bo 30153561b9dbSLiu Bo btrfs_release_path(path); 30165d4f98a2SYan Zheng break; 30175d4f98a2SYan Zheng } 30185d4f98a2SYan Zheng 30193fd0a558SYan, Zheng if (!upper->eb) { 30203fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 30213fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 30223fd0a558SYan, Zheng } else { 30233fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 30243fd0a558SYan, Zheng } 30253fd0a558SYan, Zheng 30263fd0a558SYan, Zheng upper->locked = 1; 30273fd0a558SYan, Zheng path->locks[upper->level] = 0; 30283fd0a558SYan, Zheng 30295d4f98a2SYan Zheng slot = path->slots[upper->level]; 3030b3b4aa74SDavid Sterba btrfs_release_path(path); 30315d4f98a2SYan Zheng } else { 30325d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 30335d4f98a2SYan Zheng &slot); 3034cbca7d59SFilipe Manana if (ret < 0) { 3035cbca7d59SFilipe Manana err = ret; 3036cbca7d59SFilipe Manana goto next; 3037cbca7d59SFilipe Manana } 30385d4f98a2SYan Zheng BUG_ON(ret); 30395d4f98a2SYan Zheng } 30405d4f98a2SYan Zheng 30415d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 30423fd0a558SYan, Zheng if (lowest) { 30434547f4d8SLiu Bo if (bytenr != node->bytenr) { 30444547f4d8SLiu Bo btrfs_err(root->fs_info, 30454547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 30464547f4d8SLiu Bo bytenr, node->bytenr, slot, 30474547f4d8SLiu Bo upper->eb->start); 30484547f4d8SLiu Bo err = -EIO; 30494547f4d8SLiu Bo goto next; 30504547f4d8SLiu Bo } 30515d4f98a2SYan Zheng } else { 30523fd0a558SYan, Zheng if (node->eb->start == bytenr) 30533fd0a558SYan, Zheng goto next; 30545d4f98a2SYan Zheng } 30555d4f98a2SYan Zheng 3056da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 30575d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 3058581c1760SQu Wenruo btrfs_node_key_to_cpu(upper->eb, &first_key, slot); 3059581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, generation, 3060581c1760SQu Wenruo upper->level - 1, &first_key); 306164c043deSLiu Bo if (IS_ERR(eb)) { 306264c043deSLiu Bo err = PTR_ERR(eb); 306364c043deSLiu Bo goto next; 306464c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 3065416bc658SJosef Bacik free_extent_buffer(eb); 306697d9a8a4STsutomu Itoh err = -EIO; 306797d9a8a4STsutomu Itoh goto next; 306897d9a8a4STsutomu Itoh } 30695d4f98a2SYan Zheng btrfs_tree_lock(eb); 30708bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 30715d4f98a2SYan Zheng 30725d4f98a2SYan Zheng if (!node->eb) { 30735d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 30745d4f98a2SYan Zheng slot, &eb); 30753fd0a558SYan, Zheng btrfs_tree_unlock(eb); 30763fd0a558SYan, Zheng free_extent_buffer(eb); 30775d4f98a2SYan Zheng if (ret < 0) { 30785d4f98a2SYan Zheng err = ret; 30793fd0a558SYan, Zheng goto next; 30805d4f98a2SYan Zheng } 30813fd0a558SYan, Zheng BUG_ON(node->eb != eb); 30825d4f98a2SYan Zheng } else { 30835d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 30845d4f98a2SYan Zheng node->eb->start); 30855d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 30865d4f98a2SYan Zheng trans->transid); 30875d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 30885d4f98a2SYan Zheng 308982fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, 30905d4f98a2SYan Zheng node->eb->start, blocksize, 309182fa113fSQu Wenruo upper->eb->start); 309282fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 309382fa113fSQu Wenruo btrfs_init_tree_ref(&ref, node->level, 309482fa113fSQu Wenruo btrfs_header_owner(upper->eb)); 309582fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 30965d4f98a2SYan Zheng BUG_ON(ret); 30975d4f98a2SYan Zheng 30985d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 30995d4f98a2SYan Zheng BUG_ON(ret); 31005d4f98a2SYan Zheng } 31013fd0a558SYan, Zheng next: 31023fd0a558SYan, Zheng if (!upper->pending) 31033fd0a558SYan, Zheng drop_node_buffer(upper); 31043fd0a558SYan, Zheng else 31053fd0a558SYan, Zheng unlock_node_buffer(upper); 31063fd0a558SYan, Zheng if (err) 31073fd0a558SYan, Zheng break; 31085d4f98a2SYan Zheng } 31093fd0a558SYan, Zheng 31103fd0a558SYan, Zheng if (!err && node->pending) { 31113fd0a558SYan, Zheng drop_node_buffer(node); 31123fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 31133fd0a558SYan, Zheng node->pending = 0; 31145d4f98a2SYan Zheng } 31153fd0a558SYan, Zheng 31165d4f98a2SYan Zheng path->lowest_level = 0; 31173fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 31185d4f98a2SYan Zheng return err; 31195d4f98a2SYan Zheng } 31205d4f98a2SYan Zheng 31215d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 31223fd0a558SYan, Zheng struct reloc_control *rc, 31235d4f98a2SYan Zheng struct backref_node *node, 31245d4f98a2SYan Zheng struct btrfs_path *path) 31255d4f98a2SYan Zheng { 31265d4f98a2SYan Zheng struct btrfs_key key; 31275d4f98a2SYan Zheng 31285d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 31293fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 31305d4f98a2SYan Zheng } 31315d4f98a2SYan Zheng 31325d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 31333fd0a558SYan, Zheng struct reloc_control *rc, 31343fd0a558SYan, Zheng struct btrfs_path *path, int err) 31355d4f98a2SYan Zheng { 31363fd0a558SYan, Zheng LIST_HEAD(list); 31373fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 31385d4f98a2SYan Zheng struct backref_node *node; 31395d4f98a2SYan Zheng int level; 31405d4f98a2SYan Zheng int ret; 31415d4f98a2SYan Zheng 31425d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 31435d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 31445d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 31453fd0a558SYan, Zheng struct backref_node, list); 31463fd0a558SYan, Zheng list_move_tail(&node->list, &list); 31473fd0a558SYan, Zheng BUG_ON(!node->pending); 31485d4f98a2SYan Zheng 31493fd0a558SYan, Zheng if (!err) { 31503fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 31515d4f98a2SYan Zheng if (ret < 0) 31525d4f98a2SYan Zheng err = ret; 31535d4f98a2SYan Zheng } 31545d4f98a2SYan Zheng } 31553fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 31563fd0a558SYan, Zheng } 31575d4f98a2SYan Zheng return err; 31585d4f98a2SYan Zheng } 31595d4f98a2SYan Zheng 31605d4f98a2SYan Zheng /* 31615d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 31625d4f98a2SYan Zheng * as processed. 31635d4f98a2SYan Zheng */ 31645d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 31655d4f98a2SYan Zheng struct backref_node *node) 31665d4f98a2SYan Zheng { 31675d4f98a2SYan Zheng struct backref_node *next = node; 31685d4f98a2SYan Zheng struct backref_edge *edge; 31695d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 31705d4f98a2SYan Zheng int index = 0; 31715d4f98a2SYan Zheng 31725d4f98a2SYan Zheng while (next) { 31735d4f98a2SYan Zheng cond_resched(); 31745d4f98a2SYan Zheng while (1) { 31755d4f98a2SYan Zheng if (next->processed) 31765d4f98a2SYan Zheng break; 31775d4f98a2SYan Zheng 31789569cc20SQu Wenruo mark_block_processed(rc, next); 31795d4f98a2SYan Zheng 31805d4f98a2SYan Zheng if (list_empty(&next->upper)) 31815d4f98a2SYan Zheng break; 31825d4f98a2SYan Zheng 31835d4f98a2SYan Zheng edge = list_entry(next->upper.next, 31845d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 31855d4f98a2SYan Zheng edges[index++] = edge; 31865d4f98a2SYan Zheng next = edge->node[UPPER]; 31875d4f98a2SYan Zheng } 31885d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 31895d4f98a2SYan Zheng } 31905d4f98a2SYan Zheng } 31915d4f98a2SYan Zheng 31927476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 31935d4f98a2SYan Zheng { 3194da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 31957476dfdaSDavid Sterba 31965d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 31979655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 31985d4f98a2SYan Zheng return 1; 31995d4f98a2SYan Zheng return 0; 32005d4f98a2SYan Zheng } 32015d4f98a2SYan Zheng 32022ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 32035d4f98a2SYan Zheng struct tree_block *block) 32045d4f98a2SYan Zheng { 32055d4f98a2SYan Zheng struct extent_buffer *eb; 32065d4f98a2SYan Zheng 3207581c1760SQu Wenruo eb = read_tree_block(fs_info, block->bytenr, block->key.offset, 3208581c1760SQu Wenruo block->level, NULL); 320964c043deSLiu Bo if (IS_ERR(eb)) { 321064c043deSLiu Bo return PTR_ERR(eb); 321164c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 3212416bc658SJosef Bacik free_extent_buffer(eb); 3213416bc658SJosef Bacik return -EIO; 3214416bc658SJosef Bacik } 32155d4f98a2SYan Zheng if (block->level == 0) 32165d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 32175d4f98a2SYan Zheng else 32185d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 32195d4f98a2SYan Zheng free_extent_buffer(eb); 32205d4f98a2SYan Zheng block->key_ready = 1; 32215d4f98a2SYan Zheng return 0; 32225d4f98a2SYan Zheng } 32235d4f98a2SYan Zheng 32245d4f98a2SYan Zheng /* 32255d4f98a2SYan Zheng * helper function to relocate a tree block 32265d4f98a2SYan Zheng */ 32275d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 32285d4f98a2SYan Zheng struct reloc_control *rc, 32295d4f98a2SYan Zheng struct backref_node *node, 32305d4f98a2SYan Zheng struct btrfs_key *key, 32315d4f98a2SYan Zheng struct btrfs_path *path) 32325d4f98a2SYan Zheng { 32335d4f98a2SYan Zheng struct btrfs_root *root; 32343fd0a558SYan, Zheng int ret = 0; 32355d4f98a2SYan Zheng 32363fd0a558SYan, Zheng if (!node) 32375d4f98a2SYan Zheng return 0; 32383fd0a558SYan, Zheng 32395f6b2e5cSJosef Bacik /* 32405f6b2e5cSJosef Bacik * If we fail here we want to drop our backref_node because we are going 32415f6b2e5cSJosef Bacik * to start over and regenerate the tree for it. 32425f6b2e5cSJosef Bacik */ 32435f6b2e5cSJosef Bacik ret = reserve_metadata_space(trans, rc, node); 32445f6b2e5cSJosef Bacik if (ret) 32455f6b2e5cSJosef Bacik goto out; 32465f6b2e5cSJosef Bacik 32473fd0a558SYan, Zheng BUG_ON(node->processed); 3248147d256eSZhaolei root = select_one_root(node); 32493fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 32503fd0a558SYan, Zheng update_processed_blocks(rc, node); 32513fd0a558SYan, Zheng goto out; 32525d4f98a2SYan Zheng } 32535d4f98a2SYan Zheng 32543fd0a558SYan, Zheng if (root) { 325527cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 32563fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 32573fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 32583fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 32593fd0a558SYan, Zheng root = root->reloc_root; 32603fd0a558SYan, Zheng node->new_bytenr = root->node->start; 326100246528SJosef Bacik btrfs_put_root(node->root); 326200246528SJosef Bacik node->root = btrfs_grab_root(root); 32630b530bc5SJosef Bacik ASSERT(node->root); 32643fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 32653fd0a558SYan, Zheng } else { 32665d4f98a2SYan Zheng path->lowest_level = node->level; 32675d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 3268b3b4aa74SDavid Sterba btrfs_release_path(path); 32693fd0a558SYan, Zheng if (ret > 0) 32705d4f98a2SYan Zheng ret = 0; 32713fd0a558SYan, Zheng } 32723fd0a558SYan, Zheng if (!ret) 32733fd0a558SYan, Zheng update_processed_blocks(rc, node); 32743fd0a558SYan, Zheng } else { 32753fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 32763fd0a558SYan, Zheng } 32775d4f98a2SYan Zheng out: 32780647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 32793fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 32805d4f98a2SYan Zheng return ret; 32815d4f98a2SYan Zheng } 32825d4f98a2SYan Zheng 32835d4f98a2SYan Zheng /* 32845d4f98a2SYan Zheng * relocate a list of blocks 32855d4f98a2SYan Zheng */ 32865d4f98a2SYan Zheng static noinline_for_stack 32875d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 32885d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 32895d4f98a2SYan Zheng { 32902ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 32915d4f98a2SYan Zheng struct backref_node *node; 32925d4f98a2SYan Zheng struct btrfs_path *path; 32935d4f98a2SYan Zheng struct tree_block *block; 329498ff7b94SQu Wenruo struct tree_block *next; 32955d4f98a2SYan Zheng int ret; 32965d4f98a2SYan Zheng int err = 0; 32975d4f98a2SYan Zheng 32985d4f98a2SYan Zheng path = btrfs_alloc_path(); 3299e1a12670SLiu Bo if (!path) { 3300e1a12670SLiu Bo err = -ENOMEM; 330134c2b290SDavid Sterba goto out_free_blocks; 3302e1a12670SLiu Bo } 33035d4f98a2SYan Zheng 330498ff7b94SQu Wenruo /* Kick in readahead for tree blocks with missing keys */ 330598ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 33065d4f98a2SYan Zheng if (!block->key_ready) 33072ff7e61eSJeff Mahoney readahead_tree_block(fs_info, block->bytenr); 33085d4f98a2SYan Zheng } 33095d4f98a2SYan Zheng 331098ff7b94SQu Wenruo /* Get first keys */ 331198ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 331234c2b290SDavid Sterba if (!block->key_ready) { 33132ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 331434c2b290SDavid Sterba if (err) 331534c2b290SDavid Sterba goto out_free_path; 331634c2b290SDavid Sterba } 33175d4f98a2SYan Zheng } 33185d4f98a2SYan Zheng 331998ff7b94SQu Wenruo /* Do tree relocation */ 332098ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 33213fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 33225d4f98a2SYan Zheng block->level, block->bytenr); 33235d4f98a2SYan Zheng if (IS_ERR(node)) { 33245d4f98a2SYan Zheng err = PTR_ERR(node); 33255d4f98a2SYan Zheng goto out; 33265d4f98a2SYan Zheng } 33275d4f98a2SYan Zheng 33285d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 33295d4f98a2SYan Zheng path); 33305d4f98a2SYan Zheng if (ret < 0) { 33315d4f98a2SYan Zheng err = ret; 333250dbbb71SJosef Bacik break; 33335d4f98a2SYan Zheng } 33345d4f98a2SYan Zheng } 33355d4f98a2SYan Zheng out: 33363fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 33375d4f98a2SYan Zheng 333834c2b290SDavid Sterba out_free_path: 33395d4f98a2SYan Zheng btrfs_free_path(path); 334034c2b290SDavid Sterba out_free_blocks: 3341e1a12670SLiu Bo free_block_list(blocks); 33425d4f98a2SYan Zheng return err; 33435d4f98a2SYan Zheng } 33445d4f98a2SYan Zheng 33455d4f98a2SYan Zheng static noinline_for_stack 3346efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3347efa56464SYan, Zheng struct file_extent_cluster *cluster) 3348efa56464SYan, Zheng { 3349efa56464SYan, Zheng u64 alloc_hint = 0; 3350efa56464SYan, Zheng u64 start; 3351efa56464SYan, Zheng u64 end; 3352efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3353efa56464SYan, Zheng u64 num_bytes; 3354efa56464SYan, Zheng int nr = 0; 3355efa56464SYan, Zheng int ret = 0; 3356dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 3357dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 335818513091SWang Xiaoguang u64 cur_offset; 3359364ecf36SQu Wenruo struct extent_changeset *data_reserved = NULL; 3360efa56464SYan, Zheng 3361efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 33625955102cSAl Viro inode_lock(inode); 3363efa56464SYan, Zheng 3364364ecf36SQu Wenruo ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start, 3365dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 3366efa56464SYan, Zheng if (ret) 3367efa56464SYan, Zheng goto out; 3368efa56464SYan, Zheng 336918513091SWang Xiaoguang cur_offset = prealloc_start; 3370efa56464SYan, Zheng while (nr < cluster->nr) { 3371efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3372efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3373efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3374efa56464SYan, Zheng else 3375efa56464SYan, Zheng end = cluster->end - offset; 3376efa56464SYan, Zheng 3377d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3378efa56464SYan, Zheng num_bytes = end + 1 - start; 337918513091SWang Xiaoguang if (cur_offset < start) 3380bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3381bc42bda2SQu Wenruo cur_offset, start - cur_offset); 3382efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3383efa56464SYan, Zheng num_bytes, num_bytes, 3384efa56464SYan, Zheng end + 1, &alloc_hint); 338518513091SWang Xiaoguang cur_offset = end + 1; 3386d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3387efa56464SYan, Zheng if (ret) 3388efa56464SYan, Zheng break; 3389efa56464SYan, Zheng nr++; 3390efa56464SYan, Zheng } 339118513091SWang Xiaoguang if (cur_offset < prealloc_end) 3392bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3393bc42bda2SQu Wenruo cur_offset, prealloc_end + 1 - cur_offset); 3394efa56464SYan, Zheng out: 33955955102cSAl Viro inode_unlock(inode); 3396364ecf36SQu Wenruo extent_changeset_free(data_reserved); 3397efa56464SYan, Zheng return ret; 3398efa56464SYan, Zheng } 3399efa56464SYan, Zheng 3400efa56464SYan, Zheng static noinline_for_stack 34010257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 34020257bb82SYan, Zheng u64 block_start) 34035d4f98a2SYan Zheng { 34045d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 34055d4f98a2SYan Zheng struct extent_map *em; 34060257bb82SYan, Zheng int ret = 0; 34075d4f98a2SYan Zheng 3408172ddd60SDavid Sterba em = alloc_extent_map(); 34090257bb82SYan, Zheng if (!em) 34100257bb82SYan, Zheng return -ENOMEM; 34110257bb82SYan, Zheng 34125d4f98a2SYan Zheng em->start = start; 34130257bb82SYan, Zheng em->len = end + 1 - start; 34140257bb82SYan, Zheng em->block_len = em->len; 34150257bb82SYan, Zheng em->block_start = block_start; 34165d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 34175d4f98a2SYan Zheng 3418d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 34195d4f98a2SYan Zheng while (1) { 3420890871beSChris Mason write_lock(&em_tree->lock); 342109a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3422890871beSChris Mason write_unlock(&em_tree->lock); 34235d4f98a2SYan Zheng if (ret != -EEXIST) { 34245d4f98a2SYan Zheng free_extent_map(em); 34255d4f98a2SYan Zheng break; 34265d4f98a2SYan Zheng } 3427dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 34285d4f98a2SYan Zheng } 3429d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 34300257bb82SYan, Zheng return ret; 34310257bb82SYan, Zheng } 34325d4f98a2SYan Zheng 3433726a3421SQu Wenruo /* 3434726a3421SQu Wenruo * Allow error injection to test balance cancellation 3435726a3421SQu Wenruo */ 3436726a3421SQu Wenruo int btrfs_should_cancel_balance(struct btrfs_fs_info *fs_info) 3437726a3421SQu Wenruo { 3438726a3421SQu Wenruo return atomic_read(&fs_info->balance_cancel_req); 3439726a3421SQu Wenruo } 3440726a3421SQu Wenruo ALLOW_ERROR_INJECTION(btrfs_should_cancel_balance, TRUE); 3441726a3421SQu Wenruo 34420257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 34430257bb82SYan, Zheng struct file_extent_cluster *cluster) 34440257bb82SYan, Zheng { 34452ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 34460257bb82SYan, Zheng u64 page_start; 34470257bb82SYan, Zheng u64 page_end; 34480257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 34490257bb82SYan, Zheng unsigned long index; 34500257bb82SYan, Zheng unsigned long last_index; 34510257bb82SYan, Zheng struct page *page; 34520257bb82SYan, Zheng struct file_ra_state *ra; 34533b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 34540257bb82SYan, Zheng int nr = 0; 34550257bb82SYan, Zheng int ret = 0; 34560257bb82SYan, Zheng 34570257bb82SYan, Zheng if (!cluster->nr) 34580257bb82SYan, Zheng return 0; 34590257bb82SYan, Zheng 34600257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 34610257bb82SYan, Zheng if (!ra) 34620257bb82SYan, Zheng return -ENOMEM; 34630257bb82SYan, Zheng 3464efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 34650257bb82SYan, Zheng if (ret) 3466efa56464SYan, Zheng goto out; 34670257bb82SYan, Zheng 34680257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 34690257bb82SYan, Zheng 3470efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3471efa56464SYan, Zheng cluster->end - offset, cluster->start); 3472efa56464SYan, Zheng if (ret) 3473efa56464SYan, Zheng goto out; 3474efa56464SYan, Zheng 347509cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 347609cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 34770257bb82SYan, Zheng while (index <= last_index) { 34789f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 34799f3db423SNikolay Borisov PAGE_SIZE); 3480efa56464SYan, Zheng if (ret) 3481efa56464SYan, Zheng goto out; 3482efa56464SYan, Zheng 34830257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 34840257bb82SYan, Zheng if (!page) { 34850257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 34860257bb82SYan, Zheng ra, NULL, index, 34870257bb82SYan, Zheng last_index + 1 - index); 3488a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 34893b16a4e3SJosef Bacik mask); 34900257bb82SYan, Zheng if (!page) { 3491691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 349243b18595SQu Wenruo PAGE_SIZE, true); 349344db1216SFilipe Manana btrfs_delalloc_release_extents(BTRFS_I(inode), 34948702ba93SQu Wenruo PAGE_SIZE); 34950257bb82SYan, Zheng ret = -ENOMEM; 3496efa56464SYan, Zheng goto out; 34970257bb82SYan, Zheng } 34980257bb82SYan, Zheng } 34990257bb82SYan, Zheng 35000257bb82SYan, Zheng if (PageReadahead(page)) { 35010257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 35020257bb82SYan, Zheng ra, NULL, page, index, 35030257bb82SYan, Zheng last_index + 1 - index); 35040257bb82SYan, Zheng } 35050257bb82SYan, Zheng 35060257bb82SYan, Zheng if (!PageUptodate(page)) { 35070257bb82SYan, Zheng btrfs_readpage(NULL, page); 35080257bb82SYan, Zheng lock_page(page); 35090257bb82SYan, Zheng if (!PageUptodate(page)) { 35100257bb82SYan, Zheng unlock_page(page); 351109cbfeafSKirill A. Shutemov put_page(page); 3512691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 351343b18595SQu Wenruo PAGE_SIZE, true); 35148b62f87bSJosef Bacik btrfs_delalloc_release_extents(BTRFS_I(inode), 35158702ba93SQu Wenruo PAGE_SIZE); 35160257bb82SYan, Zheng ret = -EIO; 3517efa56464SYan, Zheng goto out; 35180257bb82SYan, Zheng } 35190257bb82SYan, Zheng } 35200257bb82SYan, Zheng 35214eee4fa4SMiao Xie page_start = page_offset(page); 352209cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 35230257bb82SYan, Zheng 3524d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 35250257bb82SYan, Zheng 35260257bb82SYan, Zheng set_page_extent_mapped(page); 35270257bb82SYan, Zheng 35280257bb82SYan, Zheng if (nr < cluster->nr && 35290257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 35300257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 35310257bb82SYan, Zheng page_start, page_end, 3532ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 35330257bb82SYan, Zheng nr++; 35340257bb82SYan, Zheng } 35350257bb82SYan, Zheng 3536765f3cebSNikolay Borisov ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0, 3537330a5827SNikolay Borisov NULL); 3538765f3cebSNikolay Borisov if (ret) { 3539765f3cebSNikolay Borisov unlock_page(page); 3540765f3cebSNikolay Borisov put_page(page); 3541765f3cebSNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 354243b18595SQu Wenruo PAGE_SIZE, true); 3543765f3cebSNikolay Borisov btrfs_delalloc_release_extents(BTRFS_I(inode), 35448702ba93SQu Wenruo PAGE_SIZE); 3545765f3cebSNikolay Borisov 3546765f3cebSNikolay Borisov clear_extent_bits(&BTRFS_I(inode)->io_tree, 3547765f3cebSNikolay Borisov page_start, page_end, 3548765f3cebSNikolay Borisov EXTENT_LOCKED | EXTENT_BOUNDARY); 3549765f3cebSNikolay Borisov goto out; 3550765f3cebSNikolay Borisov 3551765f3cebSNikolay Borisov } 35520257bb82SYan, Zheng set_page_dirty(page); 35530257bb82SYan, Zheng 35540257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3555d0082371SJeff Mahoney page_start, page_end); 35560257bb82SYan, Zheng unlock_page(page); 355709cbfeafSKirill A. Shutemov put_page(page); 35580257bb82SYan, Zheng 35590257bb82SYan, Zheng index++; 35608702ba93SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); 3561efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 35622ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 35637f913c7cSQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 35647f913c7cSQu Wenruo ret = -ECANCELED; 35657f913c7cSQu Wenruo goto out; 35667f913c7cSQu Wenruo } 35670257bb82SYan, Zheng } 35680257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3569efa56464SYan, Zheng out: 35700257bb82SYan, Zheng kfree(ra); 35710257bb82SYan, Zheng return ret; 35720257bb82SYan, Zheng } 35730257bb82SYan, Zheng 35740257bb82SYan, Zheng static noinline_for_stack 35750257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 35760257bb82SYan, Zheng struct file_extent_cluster *cluster) 35770257bb82SYan, Zheng { 35780257bb82SYan, Zheng int ret; 35790257bb82SYan, Zheng 35800257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 35810257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 35820257bb82SYan, Zheng if (ret) 35830257bb82SYan, Zheng return ret; 35840257bb82SYan, Zheng cluster->nr = 0; 35850257bb82SYan, Zheng } 35860257bb82SYan, Zheng 35870257bb82SYan, Zheng if (!cluster->nr) 35880257bb82SYan, Zheng cluster->start = extent_key->objectid; 35890257bb82SYan, Zheng else 35900257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 35910257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 35920257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 35930257bb82SYan, Zheng cluster->nr++; 35940257bb82SYan, Zheng 35950257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 35960257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 35970257bb82SYan, Zheng if (ret) 35980257bb82SYan, Zheng return ret; 35990257bb82SYan, Zheng cluster->nr = 0; 36000257bb82SYan, Zheng } 36010257bb82SYan, Zheng return 0; 36025d4f98a2SYan Zheng } 36035d4f98a2SYan Zheng 36045d4f98a2SYan Zheng /* 36055d4f98a2SYan Zheng * helper to add a tree block to the list. 36065d4f98a2SYan Zheng * the major work is getting the generation and level of the block 36075d4f98a2SYan Zheng */ 36085d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 36095d4f98a2SYan Zheng struct btrfs_key *extent_key, 36105d4f98a2SYan Zheng struct btrfs_path *path, 36115d4f98a2SYan Zheng struct rb_root *blocks) 36125d4f98a2SYan Zheng { 36135d4f98a2SYan Zheng struct extent_buffer *eb; 36145d4f98a2SYan Zheng struct btrfs_extent_item *ei; 36155d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 36165d4f98a2SYan Zheng struct tree_block *block; 36175d4f98a2SYan Zheng struct rb_node *rb_node; 36185d4f98a2SYan Zheng u32 item_size; 36195d4f98a2SYan Zheng int level = -1; 36207fdf4b60SWang Shilong u64 generation; 36215d4f98a2SYan Zheng 36225d4f98a2SYan Zheng eb = path->nodes[0]; 36235d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 36245d4f98a2SYan Zheng 36253173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 36263173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 36275d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 36285d4f98a2SYan Zheng struct btrfs_extent_item); 36293173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 36305d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 36315d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 36325d4f98a2SYan Zheng } else { 36333173a18fSJosef Bacik level = (int)extent_key->offset; 36343173a18fSJosef Bacik } 36353173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 36366d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3637ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3638ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3639ba3c2b19SNikolay Borisov return -EINVAL; 36403173a18fSJosef Bacik } else { 36415d4f98a2SYan Zheng BUG(); 36425d4f98a2SYan Zheng } 36435d4f98a2SYan Zheng 3644b3b4aa74SDavid Sterba btrfs_release_path(path); 36455d4f98a2SYan Zheng 36465d4f98a2SYan Zheng BUG_ON(level == -1); 36475d4f98a2SYan Zheng 36485d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 36495d4f98a2SYan Zheng if (!block) 36505d4f98a2SYan Zheng return -ENOMEM; 36515d4f98a2SYan Zheng 36525d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3653da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 36545d4f98a2SYan Zheng block->key.offset = generation; 36555d4f98a2SYan Zheng block->level = level; 36565d4f98a2SYan Zheng block->key_ready = 0; 36575d4f98a2SYan Zheng 36585d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 365943c04fb1SJeff Mahoney if (rb_node) 366043c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 36615d4f98a2SYan Zheng 36625d4f98a2SYan Zheng return 0; 36635d4f98a2SYan Zheng } 36645d4f98a2SYan Zheng 36655d4f98a2SYan Zheng /* 36665d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 36675d4f98a2SYan Zheng */ 36685d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 36695d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 36705d4f98a2SYan Zheng struct rb_root *blocks) 36715d4f98a2SYan Zheng { 36720b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 36735d4f98a2SYan Zheng struct btrfs_path *path; 36745d4f98a2SYan Zheng struct btrfs_key key; 36755d4f98a2SYan Zheng int ret; 36760b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 36775d4f98a2SYan Zheng 36787476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 36795d4f98a2SYan Zheng return 0; 36805d4f98a2SYan Zheng 36815d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 36825d4f98a2SYan Zheng return 0; 36835d4f98a2SYan Zheng 36845d4f98a2SYan Zheng path = btrfs_alloc_path(); 36855d4f98a2SYan Zheng if (!path) 36865d4f98a2SYan Zheng return -ENOMEM; 3687aee68ee5SJosef Bacik again: 36885d4f98a2SYan Zheng key.objectid = bytenr; 3689aee68ee5SJosef Bacik if (skinny) { 3690aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3691aee68ee5SJosef Bacik key.offset = (u64)-1; 3692aee68ee5SJosef Bacik } else { 36935d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 36945d4f98a2SYan Zheng key.offset = blocksize; 3695aee68ee5SJosef Bacik } 36965d4f98a2SYan Zheng 36975d4f98a2SYan Zheng path->search_commit_root = 1; 36985d4f98a2SYan Zheng path->skip_locking = 1; 36995d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 37005d4f98a2SYan Zheng if (ret < 0) 37015d4f98a2SYan Zheng goto out; 37025d4f98a2SYan Zheng 3703aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3704aee68ee5SJosef Bacik if (path->slots[0]) { 3705aee68ee5SJosef Bacik path->slots[0]--; 3706aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3707aee68ee5SJosef Bacik path->slots[0]); 37083173a18fSJosef Bacik if (key.objectid == bytenr && 3709aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3710aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3711aee68ee5SJosef Bacik key.offset == blocksize))) 37123173a18fSJosef Bacik ret = 0; 37133173a18fSJosef Bacik } 3714aee68ee5SJosef Bacik 3715aee68ee5SJosef Bacik if (ret) { 3716aee68ee5SJosef Bacik skinny = false; 3717aee68ee5SJosef Bacik btrfs_release_path(path); 3718aee68ee5SJosef Bacik goto again; 3719aee68ee5SJosef Bacik } 3720aee68ee5SJosef Bacik } 3721cdccee99SLiu Bo if (ret) { 3722cdccee99SLiu Bo ASSERT(ret == 1); 3723cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3724cdccee99SLiu Bo btrfs_err(fs_info, 3725cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3726cdccee99SLiu Bo bytenr); 3727cdccee99SLiu Bo WARN_ON(1); 3728cdccee99SLiu Bo ret = -EINVAL; 3729cdccee99SLiu Bo goto out; 3730cdccee99SLiu Bo } 37313173a18fSJosef Bacik 37325d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 37335d4f98a2SYan Zheng out: 37345d4f98a2SYan Zheng btrfs_free_path(path); 37355d4f98a2SYan Zheng return ret; 37365d4f98a2SYan Zheng } 37375d4f98a2SYan Zheng 37380af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 373932da5386SDavid Sterba struct btrfs_block_group *block_group, 37401bbc621eSChris Mason struct inode *inode, 37411bbc621eSChris Mason u64 ino) 37420af3d00bSJosef Bacik { 37430af3d00bSJosef Bacik struct btrfs_key key; 37440af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 37450af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 37460af3d00bSJosef Bacik int ret = 0; 37470af3d00bSJosef Bacik 37480af3d00bSJosef Bacik if (inode) 37490af3d00bSJosef Bacik goto truncate; 37500af3d00bSJosef Bacik 37510af3d00bSJosef Bacik key.objectid = ino; 37520af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 37530af3d00bSJosef Bacik key.offset = 0; 37540af3d00bSJosef Bacik 37554c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 37562e19f1f9SAl Viro if (IS_ERR(inode)) 37570af3d00bSJosef Bacik return -ENOENT; 37580af3d00bSJosef Bacik 37590af3d00bSJosef Bacik truncate: 37602ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 37617b61cd92SMiao Xie &fs_info->global_block_rsv); 37627b61cd92SMiao Xie if (ret) 37637b61cd92SMiao Xie goto out; 37647b61cd92SMiao Xie 37657a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 37660af3d00bSJosef Bacik if (IS_ERR(trans)) { 37673612b495STsutomu Itoh ret = PTR_ERR(trans); 37680af3d00bSJosef Bacik goto out; 37690af3d00bSJosef Bacik } 37700af3d00bSJosef Bacik 377177ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 37720af3d00bSJosef Bacik 37733a45bb20SJeff Mahoney btrfs_end_transaction(trans); 37742ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 37750af3d00bSJosef Bacik out: 37760af3d00bSJosef Bacik iput(inode); 37770af3d00bSJosef Bacik return ret; 37780af3d00bSJosef Bacik } 37790af3d00bSJosef Bacik 37805d4f98a2SYan Zheng /* 378119b546d7SQu Wenruo * Locate the free space cache EXTENT_DATA in root tree leaf and delete the 378219b546d7SQu Wenruo * cache inode, to avoid free space cache data extent blocking data relocation. 37835d4f98a2SYan Zheng */ 378419b546d7SQu Wenruo static int delete_v1_space_cache(struct extent_buffer *leaf, 378519b546d7SQu Wenruo struct btrfs_block_group *block_group, 378619b546d7SQu Wenruo u64 data_bytenr) 37875d4f98a2SYan Zheng { 378819b546d7SQu Wenruo u64 space_cache_ino; 378919b546d7SQu Wenruo struct btrfs_file_extent_item *ei; 37905d4f98a2SYan Zheng struct btrfs_key key; 379119b546d7SQu Wenruo bool found = false; 379219b546d7SQu Wenruo int i; 37935d4f98a2SYan Zheng int ret; 37945d4f98a2SYan Zheng 379519b546d7SQu Wenruo if (btrfs_header_owner(leaf) != BTRFS_ROOT_TREE_OBJECTID) 379619b546d7SQu Wenruo return 0; 37975d4f98a2SYan Zheng 379819b546d7SQu Wenruo for (i = 0; i < btrfs_header_nritems(leaf); i++) { 379919b546d7SQu Wenruo btrfs_item_key_to_cpu(leaf, &key, i); 380019b546d7SQu Wenruo if (key.type != BTRFS_EXTENT_DATA_KEY) 380119b546d7SQu Wenruo continue; 380219b546d7SQu Wenruo ei = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 380319b546d7SQu Wenruo if (btrfs_file_extent_type(leaf, ei) == BTRFS_FILE_EXTENT_REG && 380419b546d7SQu Wenruo btrfs_file_extent_disk_bytenr(leaf, ei) == data_bytenr) { 380519b546d7SQu Wenruo found = true; 380619b546d7SQu Wenruo space_cache_ino = key.objectid; 380719b546d7SQu Wenruo break; 380819b546d7SQu Wenruo } 380919b546d7SQu Wenruo } 381019b546d7SQu Wenruo if (!found) 381119b546d7SQu Wenruo return -ENOENT; 381219b546d7SQu Wenruo ret = delete_block_group_cache(leaf->fs_info, block_group, NULL, 381319b546d7SQu Wenruo space_cache_ino); 38140af3d00bSJosef Bacik return ret; 38155d4f98a2SYan Zheng } 38165d4f98a2SYan Zheng 38175d4f98a2SYan Zheng /* 38182c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 38195d4f98a2SYan Zheng */ 38205d4f98a2SYan Zheng static noinline_for_stack 38215d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 38225d4f98a2SYan Zheng struct btrfs_key *extent_key, 38235d4f98a2SYan Zheng struct btrfs_path *path, 38245d4f98a2SYan Zheng struct rb_root *blocks) 38255d4f98a2SYan Zheng { 382619b546d7SQu Wenruo struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 382719b546d7SQu Wenruo struct ulist *leaves = NULL; 382819b546d7SQu Wenruo struct ulist_iterator leaf_uiter; 382919b546d7SQu Wenruo struct ulist_node *ref_node = NULL; 383019b546d7SQu Wenruo const u32 blocksize = fs_info->nodesize; 3831647f63bdSFilipe David Borba Manana int ret = 0; 38325d4f98a2SYan Zheng 3833b3b4aa74SDavid Sterba btrfs_release_path(path); 383419b546d7SQu Wenruo ret = btrfs_find_all_leafs(NULL, fs_info, extent_key->objectid, 383519b546d7SQu Wenruo 0, &leaves, NULL, true); 383619b546d7SQu Wenruo if (ret < 0) 383719b546d7SQu Wenruo return ret; 383819b546d7SQu Wenruo 383919b546d7SQu Wenruo ULIST_ITER_INIT(&leaf_uiter); 384019b546d7SQu Wenruo while ((ref_node = ulist_next(leaves, &leaf_uiter))) { 384119b546d7SQu Wenruo struct extent_buffer *eb; 384219b546d7SQu Wenruo 384319b546d7SQu Wenruo eb = read_tree_block(fs_info, ref_node->val, 0, 0, NULL); 384419b546d7SQu Wenruo if (IS_ERR(eb)) { 384519b546d7SQu Wenruo ret = PTR_ERR(eb); 384619b546d7SQu Wenruo break; 384719b546d7SQu Wenruo } 384819b546d7SQu Wenruo ret = delete_v1_space_cache(eb, rc->block_group, 384919b546d7SQu Wenruo extent_key->objectid); 385019b546d7SQu Wenruo free_extent_buffer(eb); 385119b546d7SQu Wenruo if (ret < 0) 385219b546d7SQu Wenruo break; 385319b546d7SQu Wenruo ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); 385419b546d7SQu Wenruo if (ret < 0) 385519b546d7SQu Wenruo break; 385619b546d7SQu Wenruo } 385719b546d7SQu Wenruo if (ret < 0) 38585d4f98a2SYan Zheng free_block_list(blocks); 385919b546d7SQu Wenruo ulist_free(leaves); 386019b546d7SQu Wenruo return ret; 38615d4f98a2SYan Zheng } 38625d4f98a2SYan Zheng 38635d4f98a2SYan Zheng /* 38642c016dc2SLiu Bo * helper to find next unprocessed extent 38655d4f98a2SYan Zheng */ 38665d4f98a2SYan Zheng static noinline_for_stack 3867147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 38683fd0a558SYan, Zheng struct btrfs_key *extent_key) 38695d4f98a2SYan Zheng { 38700b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38715d4f98a2SYan Zheng struct btrfs_key key; 38725d4f98a2SYan Zheng struct extent_buffer *leaf; 38735d4f98a2SYan Zheng u64 start, end, last; 38745d4f98a2SYan Zheng int ret; 38755d4f98a2SYan Zheng 3876b3470b5dSDavid Sterba last = rc->block_group->start + rc->block_group->length; 38775d4f98a2SYan Zheng while (1) { 38785d4f98a2SYan Zheng cond_resched(); 38795d4f98a2SYan Zheng if (rc->search_start >= last) { 38805d4f98a2SYan Zheng ret = 1; 38815d4f98a2SYan Zheng break; 38825d4f98a2SYan Zheng } 38835d4f98a2SYan Zheng 38845d4f98a2SYan Zheng key.objectid = rc->search_start; 38855d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 38865d4f98a2SYan Zheng key.offset = 0; 38875d4f98a2SYan Zheng 38885d4f98a2SYan Zheng path->search_commit_root = 1; 38895d4f98a2SYan Zheng path->skip_locking = 1; 38905d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 38915d4f98a2SYan Zheng 0, 0); 38925d4f98a2SYan Zheng if (ret < 0) 38935d4f98a2SYan Zheng break; 38945d4f98a2SYan Zheng next: 38955d4f98a2SYan Zheng leaf = path->nodes[0]; 38965d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 38975d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 38985d4f98a2SYan Zheng if (ret != 0) 38995d4f98a2SYan Zheng break; 39005d4f98a2SYan Zheng leaf = path->nodes[0]; 39015d4f98a2SYan Zheng } 39025d4f98a2SYan Zheng 39035d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 39045d4f98a2SYan Zheng if (key.objectid >= last) { 39055d4f98a2SYan Zheng ret = 1; 39065d4f98a2SYan Zheng break; 39075d4f98a2SYan Zheng } 39085d4f98a2SYan Zheng 39093173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 39103173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 39113173a18fSJosef Bacik path->slots[0]++; 39123173a18fSJosef Bacik goto next; 39133173a18fSJosef Bacik } 39143173a18fSJosef Bacik 39153173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 39165d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 39175d4f98a2SYan Zheng path->slots[0]++; 39185d4f98a2SYan Zheng goto next; 39195d4f98a2SYan Zheng } 39205d4f98a2SYan Zheng 39213173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 39220b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 39233173a18fSJosef Bacik rc->search_start) { 39243173a18fSJosef Bacik path->slots[0]++; 39253173a18fSJosef Bacik goto next; 39263173a18fSJosef Bacik } 39273173a18fSJosef Bacik 39285d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 39295d4f98a2SYan Zheng key.objectid, &start, &end, 3930e6138876SJosef Bacik EXTENT_DIRTY, NULL); 39315d4f98a2SYan Zheng 39325d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3933b3b4aa74SDavid Sterba btrfs_release_path(path); 39345d4f98a2SYan Zheng rc->search_start = end + 1; 39355d4f98a2SYan Zheng } else { 39363173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 39375d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 39383173a18fSJosef Bacik else 39393173a18fSJosef Bacik rc->search_start = key.objectid + 39400b246afaSJeff Mahoney fs_info->nodesize; 39413fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 39425d4f98a2SYan Zheng return 0; 39435d4f98a2SYan Zheng } 39445d4f98a2SYan Zheng } 3945b3b4aa74SDavid Sterba btrfs_release_path(path); 39465d4f98a2SYan Zheng return ret; 39475d4f98a2SYan Zheng } 39485d4f98a2SYan Zheng 39495d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 39505d4f98a2SYan Zheng { 39515d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39527585717fSChris Mason 39537585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39545d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 39557585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39565d4f98a2SYan Zheng } 39575d4f98a2SYan Zheng 39585d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 39595d4f98a2SYan Zheng { 39605d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39617585717fSChris Mason 39627585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39635d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 39647585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39655d4f98a2SYan Zheng } 39665d4f98a2SYan Zheng 39675d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 39685d4f98a2SYan Zheng { 39695d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39705d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39715d4f98a2SYan Zheng return 1; 39725d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 39735d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39745d4f98a2SYan Zheng return 1; 39755d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39765d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 39775d4f98a2SYan Zheng return 1; 39785d4f98a2SYan Zheng return 0; 39795d4f98a2SYan Zheng } 39805d4f98a2SYan Zheng 39813fd0a558SYan, Zheng static noinline_for_stack 39823fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 39833fd0a558SYan, Zheng { 39843fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3985ac2fabacSJosef Bacik int ret; 39863fd0a558SYan, Zheng 39872ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 398866d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 39893fd0a558SYan, Zheng if (!rc->block_rsv) 39903fd0a558SYan, Zheng return -ENOMEM; 39913fd0a558SYan, Zheng 39923fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 3993b3470b5dSDavid Sterba rc->search_start = rc->block_group->start; 39943fd0a558SYan, Zheng rc->extents_found = 0; 39953fd0a558SYan, Zheng rc->nodes_relocated = 0; 39963fd0a558SYan, Zheng rc->merging_rsv_size = 0; 39970647bf56SWang Shilong rc->reserved_bytes = 0; 3998da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 39990647bf56SWang Shilong RELOCATION_RESERVED_NODES; 4000ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 4001ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 4002ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 4003ac2fabacSJosef Bacik if (ret) 4004ac2fabacSJosef Bacik return ret; 40053fd0a558SYan, Zheng 40063fd0a558SYan, Zheng rc->create_reloc_tree = 1; 40073fd0a558SYan, Zheng set_reloc_control(rc); 40083fd0a558SYan, Zheng 40097a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 401028818947SLiu Bo if (IS_ERR(trans)) { 401128818947SLiu Bo unset_reloc_control(rc); 401228818947SLiu Bo /* 401328818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 401428818947SLiu Bo * cleanup. And callers are responsible to free the above 401528818947SLiu Bo * block rsv. 401628818947SLiu Bo */ 401728818947SLiu Bo return PTR_ERR(trans); 401828818947SLiu Bo } 40193a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 40203fd0a558SYan, Zheng return 0; 40213fd0a558SYan, Zheng } 402276dda93cSYan, Zheng 40235d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 40245d4f98a2SYan Zheng { 40252ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 40265d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 40275d4f98a2SYan Zheng struct btrfs_key key; 40285d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 40295d4f98a2SYan Zheng struct btrfs_path *path; 40305d4f98a2SYan Zheng struct btrfs_extent_item *ei; 40315d4f98a2SYan Zheng u64 flags; 40325d4f98a2SYan Zheng u32 item_size; 40335d4f98a2SYan Zheng int ret; 40345d4f98a2SYan Zheng int err = 0; 4035c87f08caSChris Mason int progress = 0; 40365d4f98a2SYan Zheng 40375d4f98a2SYan Zheng path = btrfs_alloc_path(); 40383fd0a558SYan, Zheng if (!path) 40395d4f98a2SYan Zheng return -ENOMEM; 4040e4058b54SDavid Sterba path->reada = READA_FORWARD; 40413fd0a558SYan, Zheng 40423fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 40433fd0a558SYan, Zheng if (ret) { 40443fd0a558SYan, Zheng err = ret; 40453fd0a558SYan, Zheng goto out_free; 40462423fdfbSJiri Slaby } 40475d4f98a2SYan Zheng 40485d4f98a2SYan Zheng while (1) { 40490647bf56SWang Shilong rc->reserved_bytes = 0; 40500647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 40510647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 40520647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 40530647bf56SWang Shilong if (ret) { 40540647bf56SWang Shilong err = ret; 40550647bf56SWang Shilong break; 40560647bf56SWang Shilong } 4057c87f08caSChris Mason progress++; 4058a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 40590f788c58SLiu Bo if (IS_ERR(trans)) { 40600f788c58SLiu Bo err = PTR_ERR(trans); 40610f788c58SLiu Bo trans = NULL; 40620f788c58SLiu Bo break; 40630f788c58SLiu Bo } 4064c87f08caSChris Mason restart: 40653fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 40663a45bb20SJeff Mahoney btrfs_end_transaction(trans); 406742a657f5SPan Bian trans = NULL; 40683fd0a558SYan, Zheng continue; 40693fd0a558SYan, Zheng } 40703fd0a558SYan, Zheng 4071147d256eSZhaolei ret = find_next_extent(rc, path, &key); 40725d4f98a2SYan Zheng if (ret < 0) 40735d4f98a2SYan Zheng err = ret; 40745d4f98a2SYan Zheng if (ret != 0) 40755d4f98a2SYan Zheng break; 40765d4f98a2SYan Zheng 40775d4f98a2SYan Zheng rc->extents_found++; 40785d4f98a2SYan Zheng 40795d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 40805d4f98a2SYan Zheng struct btrfs_extent_item); 40813fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 40825d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 40835d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 40845d4f98a2SYan Zheng ret = check_extent_flags(flags); 40855d4f98a2SYan Zheng BUG_ON(ret); 40866d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 4087ba3c2b19SNikolay Borisov err = -EINVAL; 4088ba3c2b19SNikolay Borisov btrfs_print_v0_err(trans->fs_info); 4089ba3c2b19SNikolay Borisov btrfs_abort_transaction(trans, err); 4090ba3c2b19SNikolay Borisov break; 40915d4f98a2SYan Zheng } else { 40925d4f98a2SYan Zheng BUG(); 40935d4f98a2SYan Zheng } 40945d4f98a2SYan Zheng 40955d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 40965d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 40975d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 40985d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40995d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 41005d4f98a2SYan Zheng } else { 4101b3b4aa74SDavid Sterba btrfs_release_path(path); 41025d4f98a2SYan Zheng ret = 0; 41035d4f98a2SYan Zheng } 41045d4f98a2SYan Zheng if (ret < 0) { 41053fd0a558SYan, Zheng err = ret; 41065d4f98a2SYan Zheng break; 41075d4f98a2SYan Zheng } 41085d4f98a2SYan Zheng 41095d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 41105d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 41115d4f98a2SYan Zheng if (ret < 0) { 41123fd0a558SYan, Zheng if (ret != -EAGAIN) { 41135d4f98a2SYan Zheng err = ret; 41145d4f98a2SYan Zheng break; 41155d4f98a2SYan Zheng } 41163fd0a558SYan, Zheng rc->extents_found--; 41173fd0a558SYan, Zheng rc->search_start = key.objectid; 41183fd0a558SYan, Zheng } 41195d4f98a2SYan Zheng } 41205d4f98a2SYan Zheng 41213a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 41222ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 41233fd0a558SYan, Zheng trans = NULL; 41245d4f98a2SYan Zheng 41255d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 41265d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 41275d4f98a2SYan Zheng rc->found_file_extent = 1; 41280257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 41293fd0a558SYan, Zheng &key, &rc->cluster); 41305d4f98a2SYan Zheng if (ret < 0) { 41315d4f98a2SYan Zheng err = ret; 41325d4f98a2SYan Zheng break; 41335d4f98a2SYan Zheng } 41345d4f98a2SYan Zheng } 4135f31ea088SQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 4136f31ea088SQu Wenruo err = -ECANCELED; 4137f31ea088SQu Wenruo break; 4138f31ea088SQu Wenruo } 41395d4f98a2SYan Zheng } 4140c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 414143a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 41429689457bSShilong Wang if (ret == 1) { 4143c87f08caSChris Mason err = 0; 4144c87f08caSChris Mason progress = 0; 4145c87f08caSChris Mason goto restart; 4146c87f08caSChris Mason } 4147c87f08caSChris Mason } 41483fd0a558SYan, Zheng 4149b3b4aa74SDavid Sterba btrfs_release_path(path); 415091166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 41515d4f98a2SYan Zheng 41525d4f98a2SYan Zheng if (trans) { 41533a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 41542ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 41555d4f98a2SYan Zheng } 41565d4f98a2SYan Zheng 41570257bb82SYan, Zheng if (!err) { 41583fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 41593fd0a558SYan, Zheng &rc->cluster); 41600257bb82SYan, Zheng if (ret < 0) 41610257bb82SYan, Zheng err = ret; 41620257bb82SYan, Zheng } 41630257bb82SYan, Zheng 41643fd0a558SYan, Zheng rc->create_reloc_tree = 0; 41653fd0a558SYan, Zheng set_reloc_control(rc); 41660257bb82SYan, Zheng 41673fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 416863f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 41695d4f98a2SYan Zheng 41707f913c7cSQu Wenruo /* 41717f913c7cSQu Wenruo * Even in the case when the relocation is cancelled, we should all go 41727f913c7cSQu Wenruo * through prepare_to_merge() and merge_reloc_roots(). 41737f913c7cSQu Wenruo * 41747f913c7cSQu Wenruo * For error (including cancelled balance), prepare_to_merge() will 41757f913c7cSQu Wenruo * mark all reloc trees orphan, then queue them for cleanup in 41767f913c7cSQu Wenruo * merge_reloc_roots() 41777f913c7cSQu Wenruo */ 41783fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 41795d4f98a2SYan Zheng 41805d4f98a2SYan Zheng merge_reloc_roots(rc); 41815d4f98a2SYan Zheng 41823fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 41835d4f98a2SYan Zheng unset_reloc_control(rc); 418463f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 41855d4f98a2SYan Zheng 41865d4f98a2SYan Zheng /* get rid of pinned extents */ 41877a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 418862b99540SQu Wenruo if (IS_ERR(trans)) { 41893612b495STsutomu Itoh err = PTR_ERR(trans); 419062b99540SQu Wenruo goto out_free; 419162b99540SQu Wenruo } 41923a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 41936217b0faSJosef Bacik out_free: 4194d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4195d2311e69SQu Wenruo if (ret < 0 && !err) 4196d2311e69SQu Wenruo err = ret; 41972ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 41983fd0a558SYan, Zheng btrfs_free_path(path); 41995d4f98a2SYan Zheng return err; 42005d4f98a2SYan Zheng } 42015d4f98a2SYan Zheng 42025d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 42030257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 42045d4f98a2SYan Zheng { 42055d4f98a2SYan Zheng struct btrfs_path *path; 42065d4f98a2SYan Zheng struct btrfs_inode_item *item; 42075d4f98a2SYan Zheng struct extent_buffer *leaf; 42085d4f98a2SYan Zheng int ret; 42095d4f98a2SYan Zheng 42105d4f98a2SYan Zheng path = btrfs_alloc_path(); 42115d4f98a2SYan Zheng if (!path) 42125d4f98a2SYan Zheng return -ENOMEM; 42135d4f98a2SYan Zheng 42145d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 42155d4f98a2SYan Zheng if (ret) 42165d4f98a2SYan Zheng goto out; 42175d4f98a2SYan Zheng 42185d4f98a2SYan Zheng leaf = path->nodes[0]; 42195d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 4220b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 42215d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 42220257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 42235d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 42243fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 42253fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 42265d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 42275d4f98a2SYan Zheng out: 42285d4f98a2SYan Zheng btrfs_free_path(path); 42295d4f98a2SYan Zheng return ret; 42305d4f98a2SYan Zheng } 42315d4f98a2SYan Zheng 42325d4f98a2SYan Zheng /* 42335d4f98a2SYan Zheng * helper to create inode for data relocation. 42345d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 42355d4f98a2SYan Zheng */ 42363fd0a558SYan, Zheng static noinline_for_stack 42373fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 423832da5386SDavid Sterba struct btrfs_block_group *group) 42395d4f98a2SYan Zheng { 42405d4f98a2SYan Zheng struct inode *inode = NULL; 42415d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 42425d4f98a2SYan Zheng struct btrfs_root *root; 42435d4f98a2SYan Zheng struct btrfs_key key; 42444624900dSZhaolei u64 objectid; 42455d4f98a2SYan Zheng int err = 0; 42465d4f98a2SYan Zheng 42475d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 42485d4f98a2SYan Zheng if (IS_ERR(root)) 42495d4f98a2SYan Zheng return ERR_CAST(root); 42505d4f98a2SYan Zheng 4251a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 425276deacf0SJosef Bacik if (IS_ERR(trans)) { 425300246528SJosef Bacik btrfs_put_root(root); 42543fd0a558SYan, Zheng return ERR_CAST(trans); 425576deacf0SJosef Bacik } 42565d4f98a2SYan Zheng 4257581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 42585d4f98a2SYan Zheng if (err) 42595d4f98a2SYan Zheng goto out; 42605d4f98a2SYan Zheng 42610257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 42625d4f98a2SYan Zheng BUG_ON(err); 42635d4f98a2SYan Zheng 42645d4f98a2SYan Zheng key.objectid = objectid; 42655d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 42665d4f98a2SYan Zheng key.offset = 0; 42674c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 42682e19f1f9SAl Viro BUG_ON(IS_ERR(inode)); 4269b3470b5dSDavid Sterba BTRFS_I(inode)->index_cnt = group->start; 42705d4f98a2SYan Zheng 427173f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 42725d4f98a2SYan Zheng out: 427300246528SJosef Bacik btrfs_put_root(root); 42743a45bb20SJeff Mahoney btrfs_end_transaction(trans); 42752ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 42765d4f98a2SYan Zheng if (err) { 42775d4f98a2SYan Zheng if (inode) 42785d4f98a2SYan Zheng iput(inode); 42795d4f98a2SYan Zheng inode = ERR_PTR(err); 42805d4f98a2SYan Zheng } 42815d4f98a2SYan Zheng return inode; 42825d4f98a2SYan Zheng } 42835d4f98a2SYan Zheng 4284c258d6e3SQu Wenruo static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 42853fd0a558SYan, Zheng { 42863fd0a558SYan, Zheng struct reloc_control *rc; 42873fd0a558SYan, Zheng 42883fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 42893fd0a558SYan, Zheng if (!rc) 42903fd0a558SYan, Zheng return NULL; 42913fd0a558SYan, Zheng 42923fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 4293d2311e69SQu Wenruo INIT_LIST_HEAD(&rc->dirty_subvol_roots); 42942433bea5SQu Wenruo backref_cache_init(fs_info, &rc->backref_cache, 1); 42953fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 429643eb5f29SQu Wenruo extent_io_tree_init(fs_info, &rc->processed_blocks, 429743eb5f29SQu Wenruo IO_TREE_RELOC_BLOCKS, NULL); 42983fd0a558SYan, Zheng return rc; 42993fd0a558SYan, Zheng } 43003fd0a558SYan, Zheng 43011a0afa0eSJosef Bacik static void free_reloc_control(struct reloc_control *rc) 43021a0afa0eSJosef Bacik { 43031a0afa0eSJosef Bacik struct mapping_node *node, *tmp; 43041a0afa0eSJosef Bacik 43051a0afa0eSJosef Bacik free_reloc_roots(&rc->reloc_roots); 43061a0afa0eSJosef Bacik rbtree_postorder_for_each_entry_safe(node, tmp, 43071a0afa0eSJosef Bacik &rc->reloc_root_tree.rb_root, rb_node) 43081a0afa0eSJosef Bacik kfree(node); 43091a0afa0eSJosef Bacik 43101a0afa0eSJosef Bacik kfree(rc); 43111a0afa0eSJosef Bacik } 43121a0afa0eSJosef Bacik 43135d4f98a2SYan Zheng /* 4314ebce0e01SAdam Borowski * Print the block group being relocated 4315ebce0e01SAdam Borowski */ 4316ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 431732da5386SDavid Sterba struct btrfs_block_group *block_group) 4318ebce0e01SAdam Borowski { 4319f89e09cfSAnand Jain char buf[128] = {'\0'}; 4320ebce0e01SAdam Borowski 4321f89e09cfSAnand Jain btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); 4322ebce0e01SAdam Borowski 4323ebce0e01SAdam Borowski btrfs_info(fs_info, 4324ebce0e01SAdam Borowski "relocating block group %llu flags %s", 4325b3470b5dSDavid Sterba block_group->start, buf); 4326ebce0e01SAdam Borowski } 4327ebce0e01SAdam Borowski 4328430640e3SQu Wenruo static const char *stage_to_string(int stage) 4329430640e3SQu Wenruo { 4330430640e3SQu Wenruo if (stage == MOVE_DATA_EXTENTS) 4331430640e3SQu Wenruo return "move data extents"; 4332430640e3SQu Wenruo if (stage == UPDATE_DATA_PTRS) 4333430640e3SQu Wenruo return "update data pointers"; 4334430640e3SQu Wenruo return "unknown"; 4335430640e3SQu Wenruo } 4336430640e3SQu Wenruo 4337ebce0e01SAdam Borowski /* 43385d4f98a2SYan Zheng * function to relocate all extents in a block group. 43395d4f98a2SYan Zheng */ 43406bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 43415d4f98a2SYan Zheng { 434232da5386SDavid Sterba struct btrfs_block_group *bg; 43436bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 43445d4f98a2SYan Zheng struct reloc_control *rc; 43450af3d00bSJosef Bacik struct inode *inode; 43460af3d00bSJosef Bacik struct btrfs_path *path; 43475d4f98a2SYan Zheng int ret; 4348f0486c68SYan, Zheng int rw = 0; 43495d4f98a2SYan Zheng int err = 0; 43505d4f98a2SYan Zheng 4351eede2bf3SOmar Sandoval bg = btrfs_lookup_block_group(fs_info, group_start); 4352eede2bf3SOmar Sandoval if (!bg) 4353eede2bf3SOmar Sandoval return -ENOENT; 4354eede2bf3SOmar Sandoval 4355eede2bf3SOmar Sandoval if (btrfs_pinned_by_swapfile(fs_info, bg)) { 4356eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 4357eede2bf3SOmar Sandoval return -ETXTBSY; 4358eede2bf3SOmar Sandoval } 4359eede2bf3SOmar Sandoval 4360c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 4361eede2bf3SOmar Sandoval if (!rc) { 4362eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 43635d4f98a2SYan Zheng return -ENOMEM; 4364eede2bf3SOmar Sandoval } 43655d4f98a2SYan Zheng 4366f0486c68SYan, Zheng rc->extent_root = extent_root; 4367eede2bf3SOmar Sandoval rc->block_group = bg; 43685d4f98a2SYan Zheng 4369b12de528SQu Wenruo ret = btrfs_inc_block_group_ro(rc->block_group, true); 4370f0486c68SYan, Zheng if (ret) { 4371f0486c68SYan, Zheng err = ret; 4372f0486c68SYan, Zheng goto out; 4373f0486c68SYan, Zheng } 4374f0486c68SYan, Zheng rw = 1; 4375f0486c68SYan, Zheng 43760af3d00bSJosef Bacik path = btrfs_alloc_path(); 43770af3d00bSJosef Bacik if (!path) { 43780af3d00bSJosef Bacik err = -ENOMEM; 43790af3d00bSJosef Bacik goto out; 43800af3d00bSJosef Bacik } 43810af3d00bSJosef Bacik 43827949f339SDavid Sterba inode = lookup_free_space_inode(rc->block_group, path); 43830af3d00bSJosef Bacik btrfs_free_path(path); 43840af3d00bSJosef Bacik 43850af3d00bSJosef Bacik if (!IS_ERR(inode)) 43861bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 43870af3d00bSJosef Bacik else 43880af3d00bSJosef Bacik ret = PTR_ERR(inode); 43890af3d00bSJosef Bacik 43900af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 43910af3d00bSJosef Bacik err = ret; 43920af3d00bSJosef Bacik goto out; 43930af3d00bSJosef Bacik } 43940af3d00bSJosef Bacik 43955d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 43965d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 43975d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 43985d4f98a2SYan Zheng rc->data_inode = NULL; 43995d4f98a2SYan Zheng goto out; 44005d4f98a2SYan Zheng } 44015d4f98a2SYan Zheng 44020b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 44035d4f98a2SYan Zheng 44049cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4405f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 44066374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 4407b3470b5dSDavid Sterba rc->block_group->start, 4408b3470b5dSDavid Sterba rc->block_group->length); 44095d4f98a2SYan Zheng 44105d4f98a2SYan Zheng while (1) { 4411430640e3SQu Wenruo int finishes_stage; 4412430640e3SQu Wenruo 441376dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 44145d4f98a2SYan Zheng ret = relocate_block_group(rc); 441576dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 4416ff612ba7SJosef Bacik if (ret < 0) 44175d4f98a2SYan Zheng err = ret; 4418ff612ba7SJosef Bacik 4419430640e3SQu Wenruo finishes_stage = rc->stage; 4420ff612ba7SJosef Bacik /* 4421ff612ba7SJosef Bacik * We may have gotten ENOSPC after we already dirtied some 4422ff612ba7SJosef Bacik * extents. If writeout happens while we're relocating a 4423ff612ba7SJosef Bacik * different block group we could end up hitting the 4424ff612ba7SJosef Bacik * BUG_ON(rc->stage == UPDATE_DATA_PTRS) in 4425ff612ba7SJosef Bacik * btrfs_reloc_cow_block. Make sure we write everything out 4426ff612ba7SJosef Bacik * properly so we don't trip over this problem, and then break 4427ff612ba7SJosef Bacik * out of the loop if we hit an error. 4428ff612ba7SJosef Bacik */ 4429ff612ba7SJosef Bacik if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 4430ff612ba7SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 4431ff612ba7SJosef Bacik (u64)-1); 4432ff612ba7SJosef Bacik if (ret) 4433ff612ba7SJosef Bacik err = ret; 4434ff612ba7SJosef Bacik invalidate_mapping_pages(rc->data_inode->i_mapping, 4435ff612ba7SJosef Bacik 0, -1); 4436ff612ba7SJosef Bacik rc->stage = UPDATE_DATA_PTRS; 44375d4f98a2SYan Zheng } 44385d4f98a2SYan Zheng 4439ff612ba7SJosef Bacik if (err < 0) 4440ff612ba7SJosef Bacik goto out; 4441ff612ba7SJosef Bacik 44425d4f98a2SYan Zheng if (rc->extents_found == 0) 44435d4f98a2SYan Zheng break; 44445d4f98a2SYan Zheng 4445430640e3SQu Wenruo btrfs_info(fs_info, "found %llu extents, stage: %s", 4446430640e3SQu Wenruo rc->extents_found, stage_to_string(finishes_stage)); 44475d4f98a2SYan Zheng } 44485d4f98a2SYan Zheng 44495d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 44505d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 4451bf38be65SDavid Sterba WARN_ON(rc->block_group->used > 0); 44525d4f98a2SYan Zheng out: 4453f0486c68SYan, Zheng if (err && rw) 44542ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 44555d4f98a2SYan Zheng iput(rc->data_inode); 44565d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 44571a0afa0eSJosef Bacik free_reloc_control(rc); 44585d4f98a2SYan Zheng return err; 44595d4f98a2SYan Zheng } 44605d4f98a2SYan Zheng 446176dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 446276dda93cSYan, Zheng { 44630b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 446476dda93cSYan, Zheng struct btrfs_trans_handle *trans; 446579787eaaSJeff Mahoney int ret, err; 446676dda93cSYan, Zheng 44670b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 446879787eaaSJeff Mahoney if (IS_ERR(trans)) 446979787eaaSJeff Mahoney return PTR_ERR(trans); 447076dda93cSYan, Zheng 447176dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 447276dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 447376dda93cSYan, Zheng root->root_item.drop_level = 0; 447476dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 44750b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 447676dda93cSYan, Zheng &root->root_key, &root->root_item); 447776dda93cSYan, Zheng 44783a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 447979787eaaSJeff Mahoney if (err) 448079787eaaSJeff Mahoney return err; 448179787eaaSJeff Mahoney return ret; 448276dda93cSYan, Zheng } 448376dda93cSYan, Zheng 44845d4f98a2SYan Zheng /* 44855d4f98a2SYan Zheng * recover relocation interrupted by system crash. 44865d4f98a2SYan Zheng * 44875d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 44885d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 44895d4f98a2SYan Zheng */ 44905d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 44915d4f98a2SYan Zheng { 44920b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 44935d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 44945d4f98a2SYan Zheng struct btrfs_key key; 44955d4f98a2SYan Zheng struct btrfs_root *fs_root; 44965d4f98a2SYan Zheng struct btrfs_root *reloc_root; 44975d4f98a2SYan Zheng struct btrfs_path *path; 44985d4f98a2SYan Zheng struct extent_buffer *leaf; 44995d4f98a2SYan Zheng struct reloc_control *rc = NULL; 45005d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 45015d4f98a2SYan Zheng int ret; 45025d4f98a2SYan Zheng int err = 0; 45035d4f98a2SYan Zheng 45045d4f98a2SYan Zheng path = btrfs_alloc_path(); 45055d4f98a2SYan Zheng if (!path) 45065d4f98a2SYan Zheng return -ENOMEM; 4507e4058b54SDavid Sterba path->reada = READA_BACK; 45085d4f98a2SYan Zheng 45095d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 45105d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 45115d4f98a2SYan Zheng key.offset = (u64)-1; 45125d4f98a2SYan Zheng 45135d4f98a2SYan Zheng while (1) { 45140b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 45155d4f98a2SYan Zheng path, 0, 0); 45165d4f98a2SYan Zheng if (ret < 0) { 45175d4f98a2SYan Zheng err = ret; 45185d4f98a2SYan Zheng goto out; 45195d4f98a2SYan Zheng } 45205d4f98a2SYan Zheng if (ret > 0) { 45215d4f98a2SYan Zheng if (path->slots[0] == 0) 45225d4f98a2SYan Zheng break; 45235d4f98a2SYan Zheng path->slots[0]--; 45245d4f98a2SYan Zheng } 45255d4f98a2SYan Zheng leaf = path->nodes[0]; 45265d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4527b3b4aa74SDavid Sterba btrfs_release_path(path); 45285d4f98a2SYan Zheng 45295d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 45305d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 45315d4f98a2SYan Zheng break; 45325d4f98a2SYan Zheng 45333dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(root, &key); 45345d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 45355d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 45365d4f98a2SYan Zheng goto out; 45375d4f98a2SYan Zheng } 45385d4f98a2SYan Zheng 45393dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 45405d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 45415d4f98a2SYan Zheng 45425d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 45430b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, 45445d4f98a2SYan Zheng reloc_root->root_key.offset); 45455d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 454676dda93cSYan, Zheng ret = PTR_ERR(fs_root); 454776dda93cSYan, Zheng if (ret != -ENOENT) { 454876dda93cSYan, Zheng err = ret; 45495d4f98a2SYan Zheng goto out; 45505d4f98a2SYan Zheng } 455179787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 455279787eaaSJeff Mahoney if (ret < 0) { 455379787eaaSJeff Mahoney err = ret; 455479787eaaSJeff Mahoney goto out; 455579787eaaSJeff Mahoney } 4556932fd26dSJosef Bacik } else { 455700246528SJosef Bacik btrfs_put_root(fs_root); 455876dda93cSYan, Zheng } 45595d4f98a2SYan Zheng } 45605d4f98a2SYan Zheng 45615d4f98a2SYan Zheng if (key.offset == 0) 45625d4f98a2SYan Zheng break; 45635d4f98a2SYan Zheng 45645d4f98a2SYan Zheng key.offset--; 45655d4f98a2SYan Zheng } 4566b3b4aa74SDavid Sterba btrfs_release_path(path); 45675d4f98a2SYan Zheng 45685d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 45695d4f98a2SYan Zheng goto out; 45705d4f98a2SYan Zheng 4571c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 45725d4f98a2SYan Zheng if (!rc) { 45735d4f98a2SYan Zheng err = -ENOMEM; 45745d4f98a2SYan Zheng goto out; 45755d4f98a2SYan Zheng } 45765d4f98a2SYan Zheng 45770b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 45785d4f98a2SYan Zheng 45795d4f98a2SYan Zheng set_reloc_control(rc); 45805d4f98a2SYan Zheng 45817a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 45823612b495STsutomu Itoh if (IS_ERR(trans)) { 45833612b495STsutomu Itoh err = PTR_ERR(trans); 4584fb2d83eeSJosef Bacik goto out_unset; 45853612b495STsutomu Itoh } 45863fd0a558SYan, Zheng 45873fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 45883fd0a558SYan, Zheng 45895d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 45905d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 45915d4f98a2SYan Zheng struct btrfs_root, root_list); 45925d4f98a2SYan Zheng list_del(&reloc_root->root_list); 45935d4f98a2SYan Zheng 45945d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 45955d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 45965d4f98a2SYan Zheng &rc->reloc_roots); 45975d4f98a2SYan Zheng continue; 45985d4f98a2SYan Zheng } 45995d4f98a2SYan Zheng 46000b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, reloc_root->root_key.offset); 460179787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 460279787eaaSJeff Mahoney err = PTR_ERR(fs_root); 4603ca1aa281SJosef Bacik list_add_tail(&reloc_root->root_list, &reloc_roots); 46041402d17dSXiyu Yang btrfs_end_transaction(trans); 4605fb2d83eeSJosef Bacik goto out_unset; 460679787eaaSJeff Mahoney } 46075d4f98a2SYan Zheng 4608ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 460979787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 4610f44deb74SJosef Bacik fs_root->reloc_root = btrfs_grab_root(reloc_root); 461100246528SJosef Bacik btrfs_put_root(fs_root); 46125d4f98a2SYan Zheng } 46135d4f98a2SYan Zheng 46143a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 461579787eaaSJeff Mahoney if (err) 4616fb2d83eeSJosef Bacik goto out_unset; 46175d4f98a2SYan Zheng 46185d4f98a2SYan Zheng merge_reloc_roots(rc); 46195d4f98a2SYan Zheng 46205d4f98a2SYan Zheng unset_reloc_control(rc); 46215d4f98a2SYan Zheng 46227a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 462362b99540SQu Wenruo if (IS_ERR(trans)) { 46243612b495STsutomu Itoh err = PTR_ERR(trans); 46256217b0faSJosef Bacik goto out_clean; 462662b99540SQu Wenruo } 46273a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 46286217b0faSJosef Bacik out_clean: 4629d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4630d2311e69SQu Wenruo if (ret < 0 && !err) 4631d2311e69SQu Wenruo err = ret; 4632fb2d83eeSJosef Bacik out_unset: 4633fb2d83eeSJosef Bacik unset_reloc_control(rc); 46341a0afa0eSJosef Bacik free_reloc_control(rc); 46353612b495STsutomu Itoh out: 4636aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4637aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4638aca1bba6SLiu Bo 46395d4f98a2SYan Zheng btrfs_free_path(path); 46405d4f98a2SYan Zheng 46415d4f98a2SYan Zheng if (err == 0) { 46425d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 46430b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 4644932fd26dSJosef Bacik if (IS_ERR(fs_root)) { 46455d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4646932fd26dSJosef Bacik } else { 464766b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 464800246528SJosef Bacik btrfs_put_root(fs_root); 4649932fd26dSJosef Bacik } 4650932fd26dSJosef Bacik } 46515d4f98a2SYan Zheng return err; 46525d4f98a2SYan Zheng } 46535d4f98a2SYan Zheng 46545d4f98a2SYan Zheng /* 46555d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 46565d4f98a2SYan Zheng * 46575d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 46585d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 46595d4f98a2SYan Zheng */ 46605d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 46615d4f98a2SYan Zheng { 46620b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 46635d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 46645d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 46655d4f98a2SYan Zheng int ret; 46665d4f98a2SYan Zheng u64 disk_bytenr; 46674577b014SJosef Bacik u64 new_bytenr; 46685d4f98a2SYan Zheng LIST_HEAD(list); 46695d4f98a2SYan Zheng 46705d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 4671bffe633eSOmar Sandoval BUG_ON(ordered->file_offset != file_pos || ordered->num_bytes != len); 46725d4f98a2SYan Zheng 46735d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 46740b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4675a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 467679787eaaSJeff Mahoney if (ret) 467779787eaaSJeff Mahoney goto out; 46785d4f98a2SYan Zheng 46795d4f98a2SYan Zheng while (!list_empty(&list)) { 46805d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 46815d4f98a2SYan Zheng list_del_init(&sums->list); 46825d4f98a2SYan Zheng 46834577b014SJosef Bacik /* 46844577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 46854577b014SJosef Bacik * We need to do this because we will read in entire prealloc 46864577b014SJosef Bacik * extents but we may have written to say the middle of the 46874577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 46884577b014SJosef Bacik * the right disk offset. 46894577b014SJosef Bacik * 46904577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 46914577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 46924577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 46934577b014SJosef Bacik * disk length. 46944577b014SJosef Bacik */ 4695bffe633eSOmar Sandoval new_bytenr = ordered->disk_bytenr + sums->bytenr - disk_bytenr; 46964577b014SJosef Bacik sums->bytenr = new_bytenr; 46975d4f98a2SYan Zheng 4698f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 46995d4f98a2SYan Zheng } 470079787eaaSJeff Mahoney out: 47015d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4702411fc6bcSAndi Kleen return ret; 47035d4f98a2SYan Zheng } 47043fd0a558SYan, Zheng 470583d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 47063fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 47073fd0a558SYan, Zheng struct extent_buffer *cow) 47083fd0a558SYan, Zheng { 47090b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 47103fd0a558SYan, Zheng struct reloc_control *rc; 47113fd0a558SYan, Zheng struct backref_node *node; 47123fd0a558SYan, Zheng int first_cow = 0; 47133fd0a558SYan, Zheng int level; 471483d4cfd4SJosef Bacik int ret = 0; 47153fd0a558SYan, Zheng 47160b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 47173fd0a558SYan, Zheng if (!rc) 471883d4cfd4SJosef Bacik return 0; 47193fd0a558SYan, Zheng 47203fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 47213fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 47223fd0a558SYan, Zheng 47233fd0a558SYan, Zheng level = btrfs_header_level(buf); 47243fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 47253fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 47263fd0a558SYan, Zheng first_cow = 1; 47273fd0a558SYan, Zheng 47283fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 47293fd0a558SYan, Zheng rc->create_reloc_tree) { 47303fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 47313fd0a558SYan, Zheng 47323fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 47333fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 47343fd0a558SYan, Zheng node->new_bytenr != buf->start); 47353fd0a558SYan, Zheng 47363fd0a558SYan, Zheng drop_node_buffer(node); 473767439dadSDavid Sterba atomic_inc(&cow->refs); 47383fd0a558SYan, Zheng node->eb = cow; 47393fd0a558SYan, Zheng node->new_bytenr = cow->start; 47403fd0a558SYan, Zheng 47413fd0a558SYan, Zheng if (!node->pending) { 47423fd0a558SYan, Zheng list_move_tail(&node->list, 47433fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 47443fd0a558SYan, Zheng node->pending = 1; 47453fd0a558SYan, Zheng } 47463fd0a558SYan, Zheng 47473fd0a558SYan, Zheng if (first_cow) 47489569cc20SQu Wenruo mark_block_processed(rc, node); 47493fd0a558SYan, Zheng 47503fd0a558SYan, Zheng if (first_cow && level > 0) 47513fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 47523fd0a558SYan, Zheng } 47533fd0a558SYan, Zheng 475483d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 47553fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 475683d4cfd4SJosef Bacik return ret; 47573fd0a558SYan, Zheng } 47583fd0a558SYan, Zheng 47593fd0a558SYan, Zheng /* 47603fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 476101327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 47623fd0a558SYan, Zheng */ 4763147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 47643fd0a558SYan, Zheng u64 *bytes_to_reserve) 47653fd0a558SYan, Zheng { 476610995c04SQu Wenruo struct btrfs_root *root = pending->root; 476710995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 47683fd0a558SYan, Zheng 47696282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 47703fd0a558SYan, Zheng return; 47713fd0a558SYan, Zheng 47723fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 47733fd0a558SYan, Zheng return; 47743fd0a558SYan, Zheng 47753fd0a558SYan, Zheng root = root->reloc_root; 47763fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 47773fd0a558SYan, Zheng /* 47783fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 47793fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 47803fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 47813fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 47823fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 47833fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 47843fd0a558SYan, Zheng * tree may use more space than it frees. so we need 47853fd0a558SYan, Zheng * reserve extra space. 47863fd0a558SYan, Zheng */ 47873fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 47883fd0a558SYan, Zheng } 47893fd0a558SYan, Zheng 47903fd0a558SYan, Zheng /* 47913fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 47923fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 4793f44deb74SJosef Bacik * 4794f44deb74SJosef Bacik * This is similar to btrfs_init_reloc_root(), we come out of here with two 4795f44deb74SJosef Bacik * references held on the reloc_root, one for root->reloc_root and one for 4796f44deb74SJosef Bacik * rc->reloc_roots. 47973fd0a558SYan, Zheng */ 479849b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 47993fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 48003fd0a558SYan, Zheng { 48013fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 48023fd0a558SYan, Zheng struct btrfs_root *reloc_root; 48033fd0a558SYan, Zheng struct btrfs_root *new_root; 480410995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 48053fd0a558SYan, Zheng int ret; 48063fd0a558SYan, Zheng 48076282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 480849b25e05SJeff Mahoney return 0; 48093fd0a558SYan, Zheng 48103fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 48113fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 48123fd0a558SYan, Zheng 48133fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 48143fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 48153fd0a558SYan, Zheng rc->block_rsv, 48163a584174SLu Fengqi rc->nodes_relocated, true); 481749b25e05SJeff Mahoney if (ret) 481849b25e05SJeff Mahoney return ret; 48193fd0a558SYan, Zheng } 48203fd0a558SYan, Zheng 48213fd0a558SYan, Zheng new_root = pending->snap; 48223fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 48233fd0a558SYan, Zheng new_root->root_key.objectid); 482449b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 482549b25e05SJeff Mahoney return PTR_ERR(reloc_root); 48263fd0a558SYan, Zheng 4827ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4828ffd7b339SJeff Mahoney BUG_ON(ret < 0); 4829f44deb74SJosef Bacik new_root->reloc_root = btrfs_grab_root(reloc_root); 48303fd0a558SYan, Zheng 483149b25e05SJeff Mahoney if (rc->create_reloc_tree) 48323fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 483349b25e05SJeff Mahoney return ret; 48343fd0a558SYan, Zheng } 4835