1c1d7c514SDavid Sterba // SPDX-License-Identifier: GPL-2.0 25d4f98a2SYan Zheng /* 35d4f98a2SYan Zheng * Copyright (C) 2009 Oracle. All rights reserved. 45d4f98a2SYan Zheng */ 55d4f98a2SYan Zheng 65d4f98a2SYan Zheng #include <linux/sched.h> 75d4f98a2SYan Zheng #include <linux/pagemap.h> 85d4f98a2SYan Zheng #include <linux/writeback.h> 95d4f98a2SYan Zheng #include <linux/blkdev.h> 105d4f98a2SYan Zheng #include <linux/rbtree.h> 115a0e3ad6STejun Heo #include <linux/slab.h> 12726a3421SQu Wenruo #include <linux/error-injection.h> 135d4f98a2SYan Zheng #include "ctree.h" 145d4f98a2SYan Zheng #include "disk-io.h" 155d4f98a2SYan Zheng #include "transaction.h" 165d4f98a2SYan Zheng #include "volumes.h" 175d4f98a2SYan Zheng #include "locking.h" 185d4f98a2SYan Zheng #include "btrfs_inode.h" 195d4f98a2SYan Zheng #include "async-thread.h" 200af3d00bSJosef Bacik #include "free-space-cache.h" 21581bb050SLi Zefan #include "inode-map.h" 2262b99540SQu Wenruo #include "qgroup.h" 23cdccee99SLiu Bo #include "print-tree.h" 2486736342SJosef Bacik #include "delalloc-space.h" 25aac0023cSJosef Bacik #include "block-group.h" 2619b546d7SQu Wenruo #include "backref.h" 275d4f98a2SYan Zheng 285d4f98a2SYan Zheng /* 290c891389SQu Wenruo * Relocation overview 300c891389SQu Wenruo * 310c891389SQu Wenruo * [What does relocation do] 320c891389SQu Wenruo * 330c891389SQu Wenruo * The objective of relocation is to relocate all extents of the target block 340c891389SQu Wenruo * group to other block groups. 350c891389SQu Wenruo * This is utilized by resize (shrink only), profile converting, compacting 360c891389SQu Wenruo * space, or balance routine to spread chunks over devices. 370c891389SQu Wenruo * 380c891389SQu Wenruo * Before | After 390c891389SQu Wenruo * ------------------------------------------------------------------ 400c891389SQu Wenruo * BG A: 10 data extents | BG A: deleted 410c891389SQu Wenruo * BG B: 2 data extents | BG B: 10 data extents (2 old + 8 relocated) 420c891389SQu Wenruo * BG C: 1 extents | BG C: 3 data extents (1 old + 2 relocated) 430c891389SQu Wenruo * 440c891389SQu Wenruo * [How does relocation work] 450c891389SQu Wenruo * 460c891389SQu Wenruo * 1. Mark the target block group read-only 470c891389SQu Wenruo * New extents won't be allocated from the target block group. 480c891389SQu Wenruo * 490c891389SQu Wenruo * 2.1 Record each extent in the target block group 500c891389SQu Wenruo * To build a proper map of extents to be relocated. 510c891389SQu Wenruo * 520c891389SQu Wenruo * 2.2 Build data reloc tree and reloc trees 530c891389SQu Wenruo * Data reloc tree will contain an inode, recording all newly relocated 540c891389SQu Wenruo * data extents. 550c891389SQu Wenruo * There will be only one data reloc tree for one data block group. 560c891389SQu Wenruo * 570c891389SQu Wenruo * Reloc tree will be a special snapshot of its source tree, containing 580c891389SQu Wenruo * relocated tree blocks. 590c891389SQu Wenruo * Each tree referring to a tree block in target block group will get its 600c891389SQu Wenruo * reloc tree built. 610c891389SQu Wenruo * 620c891389SQu Wenruo * 2.3 Swap source tree with its corresponding reloc tree 630c891389SQu Wenruo * Each involved tree only refers to new extents after swap. 640c891389SQu Wenruo * 650c891389SQu Wenruo * 3. Cleanup reloc trees and data reloc tree. 660c891389SQu Wenruo * As old extents in the target block group are still referenced by reloc 670c891389SQu Wenruo * trees, we need to clean them up before really freeing the target block 680c891389SQu Wenruo * group. 690c891389SQu Wenruo * 700c891389SQu Wenruo * The main complexity is in steps 2.2 and 2.3. 710c891389SQu Wenruo * 720c891389SQu Wenruo * The entry point of relocation is relocate_block_group() function. 730c891389SQu Wenruo */ 740c891389SQu Wenruo 750c891389SQu Wenruo /* 765d4f98a2SYan Zheng * backref_node, mapping_node and tree_block start with this 775d4f98a2SYan Zheng */ 785d4f98a2SYan Zheng struct tree_entry { 795d4f98a2SYan Zheng struct rb_node rb_node; 805d4f98a2SYan Zheng u64 bytenr; 815d4f98a2SYan Zheng }; 825d4f98a2SYan Zheng 835d4f98a2SYan Zheng /* 845d4f98a2SYan Zheng * present a tree block in the backref cache 855d4f98a2SYan Zheng */ 865d4f98a2SYan Zheng struct backref_node { 875d4f98a2SYan Zheng struct rb_node rb_node; 885d4f98a2SYan Zheng u64 bytenr; 893fd0a558SYan, Zheng 903fd0a558SYan, Zheng u64 new_bytenr; 913fd0a558SYan, Zheng /* objectid of tree block owner, can be not uptodate */ 925d4f98a2SYan Zheng u64 owner; 933fd0a558SYan, Zheng /* link to pending, changed or detached list */ 943fd0a558SYan, Zheng struct list_head list; 955d4f98a2SYan Zheng /* list of upper level blocks reference this block */ 965d4f98a2SYan Zheng struct list_head upper; 975d4f98a2SYan Zheng /* list of child blocks in the cache */ 985d4f98a2SYan Zheng struct list_head lower; 995d4f98a2SYan Zheng /* NULL if this node is not tree root */ 1005d4f98a2SYan Zheng struct btrfs_root *root; 1015d4f98a2SYan Zheng /* extent buffer got by COW the block */ 1025d4f98a2SYan Zheng struct extent_buffer *eb; 1035d4f98a2SYan Zheng /* level of tree block */ 1045d4f98a2SYan Zheng unsigned int level:8; 1053fd0a558SYan, Zheng /* is the block in non-reference counted tree */ 1063fd0a558SYan, Zheng unsigned int cowonly:1; 1073fd0a558SYan, Zheng /* 1 if no child node in the cache */ 1085d4f98a2SYan Zheng unsigned int lowest:1; 1095d4f98a2SYan Zheng /* is the extent buffer locked */ 1105d4f98a2SYan Zheng unsigned int locked:1; 1115d4f98a2SYan Zheng /* has the block been processed */ 1125d4f98a2SYan Zheng unsigned int processed:1; 1135d4f98a2SYan Zheng /* have backrefs of this block been checked */ 1145d4f98a2SYan Zheng unsigned int checked:1; 1153fd0a558SYan, Zheng /* 1163fd0a558SYan, Zheng * 1 if corresponding block has been cowed but some upper 1173fd0a558SYan, Zheng * level block pointers may not point to the new location 1183fd0a558SYan, Zheng */ 1193fd0a558SYan, Zheng unsigned int pending:1; 1203fd0a558SYan, Zheng /* 1213fd0a558SYan, Zheng * 1 if the backref node isn't connected to any other 1223fd0a558SYan, Zheng * backref node. 1233fd0a558SYan, Zheng */ 1243fd0a558SYan, Zheng unsigned int detached:1; 1255d4f98a2SYan Zheng }; 1265d4f98a2SYan Zheng 1275d4f98a2SYan Zheng /* 1285d4f98a2SYan Zheng * present a block pointer in the backref cache 1295d4f98a2SYan Zheng */ 1305d4f98a2SYan Zheng struct backref_edge { 1315d4f98a2SYan Zheng struct list_head list[2]; 1325d4f98a2SYan Zheng struct backref_node *node[2]; 1335d4f98a2SYan Zheng }; 1345d4f98a2SYan Zheng 1355d4f98a2SYan Zheng #define LOWER 0 1365d4f98a2SYan Zheng #define UPPER 1 1370647bf56SWang Shilong #define RELOCATION_RESERVED_NODES 256 1385d4f98a2SYan Zheng 1395d4f98a2SYan Zheng struct backref_cache { 1405d4f98a2SYan Zheng /* red black tree of all backref nodes in the cache */ 1415d4f98a2SYan Zheng struct rb_root rb_root; 1423fd0a558SYan, Zheng /* for passing backref nodes to btrfs_reloc_cow_block */ 1433fd0a558SYan, Zheng struct backref_node *path[BTRFS_MAX_LEVEL]; 1443fd0a558SYan, Zheng /* 1453fd0a558SYan, Zheng * list of blocks that have been cowed but some block 1463fd0a558SYan, Zheng * pointers in upper level blocks may not reflect the 1473fd0a558SYan, Zheng * new location 1483fd0a558SYan, Zheng */ 1495d4f98a2SYan Zheng struct list_head pending[BTRFS_MAX_LEVEL]; 1503fd0a558SYan, Zheng /* list of backref nodes with no child node */ 1513fd0a558SYan, Zheng struct list_head leaves; 1523fd0a558SYan, Zheng /* list of blocks that have been cowed in current transaction */ 1533fd0a558SYan, Zheng struct list_head changed; 1543fd0a558SYan, Zheng /* list of detached backref node. */ 1553fd0a558SYan, Zheng struct list_head detached; 1563fd0a558SYan, Zheng 1573fd0a558SYan, Zheng u64 last_trans; 1583fd0a558SYan, Zheng 1593fd0a558SYan, Zheng int nr_nodes; 1603fd0a558SYan, Zheng int nr_edges; 1615d4f98a2SYan Zheng }; 1625d4f98a2SYan Zheng 1635d4f98a2SYan Zheng /* 1645d4f98a2SYan Zheng * map address of tree root to tree 1655d4f98a2SYan Zheng */ 1665d4f98a2SYan Zheng struct mapping_node { 1675d4f98a2SYan Zheng struct rb_node rb_node; 1685d4f98a2SYan Zheng u64 bytenr; 1695d4f98a2SYan Zheng void *data; 1705d4f98a2SYan Zheng }; 1715d4f98a2SYan Zheng 1725d4f98a2SYan Zheng struct mapping_tree { 1735d4f98a2SYan Zheng struct rb_root rb_root; 1745d4f98a2SYan Zheng spinlock_t lock; 1755d4f98a2SYan Zheng }; 1765d4f98a2SYan Zheng 1775d4f98a2SYan Zheng /* 1785d4f98a2SYan Zheng * present a tree block to process 1795d4f98a2SYan Zheng */ 1805d4f98a2SYan Zheng struct tree_block { 1815d4f98a2SYan Zheng struct rb_node rb_node; 1825d4f98a2SYan Zheng u64 bytenr; 1835d4f98a2SYan Zheng struct btrfs_key key; 1845d4f98a2SYan Zheng unsigned int level:8; 1855d4f98a2SYan Zheng unsigned int key_ready:1; 1865d4f98a2SYan Zheng }; 1875d4f98a2SYan Zheng 1880257bb82SYan, Zheng #define MAX_EXTENTS 128 1890257bb82SYan, Zheng 1900257bb82SYan, Zheng struct file_extent_cluster { 1910257bb82SYan, Zheng u64 start; 1920257bb82SYan, Zheng u64 end; 1930257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 1940257bb82SYan, Zheng unsigned int nr; 1950257bb82SYan, Zheng }; 1960257bb82SYan, Zheng 1975d4f98a2SYan Zheng struct reloc_control { 1985d4f98a2SYan Zheng /* block group to relocate */ 19932da5386SDavid Sterba struct btrfs_block_group *block_group; 2005d4f98a2SYan Zheng /* extent tree */ 2015d4f98a2SYan Zheng struct btrfs_root *extent_root; 2025d4f98a2SYan Zheng /* inode for moving data */ 2035d4f98a2SYan Zheng struct inode *data_inode; 2043fd0a558SYan, Zheng 2053fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 2063fd0a558SYan, Zheng 2073fd0a558SYan, Zheng struct backref_cache backref_cache; 2083fd0a558SYan, Zheng 2093fd0a558SYan, Zheng struct file_extent_cluster cluster; 2105d4f98a2SYan Zheng /* tree blocks have been processed */ 2115d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 2125d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 2135d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 2145d4f98a2SYan Zheng /* list of reloc trees */ 2155d4f98a2SYan Zheng struct list_head reloc_roots; 216d2311e69SQu Wenruo /* list of subvolume trees that get relocated */ 217d2311e69SQu Wenruo struct list_head dirty_subvol_roots; 2183fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 2193fd0a558SYan, Zheng u64 merging_rsv_size; 2203fd0a558SYan, Zheng /* size of relocated tree nodes */ 2213fd0a558SYan, Zheng u64 nodes_relocated; 2220647bf56SWang Shilong /* reserved size for block group relocation*/ 2230647bf56SWang Shilong u64 reserved_bytes; 2243fd0a558SYan, Zheng 2255d4f98a2SYan Zheng u64 search_start; 2265d4f98a2SYan Zheng u64 extents_found; 2273fd0a558SYan, Zheng 2283fd0a558SYan, Zheng unsigned int stage:8; 2293fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 2303fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 2315d4f98a2SYan Zheng unsigned int found_file_extent:1; 2325d4f98a2SYan Zheng }; 2335d4f98a2SYan Zheng 2345d4f98a2SYan Zheng /* stages of data relocation */ 2355d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 2365d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 2375d4f98a2SYan Zheng 2383fd0a558SYan, Zheng static void remove_backref_node(struct backref_cache *cache, 2393fd0a558SYan, Zheng struct backref_node *node); 2403fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 2413fd0a558SYan, Zheng struct backref_node *node); 2425d4f98a2SYan Zheng 2435d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 2445d4f98a2SYan Zheng { 2456bef4d31SEric Paris tree->rb_root = RB_ROOT; 2465d4f98a2SYan Zheng spin_lock_init(&tree->lock); 2475d4f98a2SYan Zheng } 2485d4f98a2SYan Zheng 2495d4f98a2SYan Zheng static void backref_cache_init(struct backref_cache *cache) 2505d4f98a2SYan Zheng { 2515d4f98a2SYan Zheng int i; 2526bef4d31SEric Paris cache->rb_root = RB_ROOT; 2535d4f98a2SYan Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2545d4f98a2SYan Zheng INIT_LIST_HEAD(&cache->pending[i]); 2553fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->changed); 2563fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->detached); 2573fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->leaves); 2585d4f98a2SYan Zheng } 2595d4f98a2SYan Zheng 2603fd0a558SYan, Zheng static void backref_cache_cleanup(struct backref_cache *cache) 2615d4f98a2SYan Zheng { 2623fd0a558SYan, Zheng struct backref_node *node; 2633fd0a558SYan, Zheng int i; 2643fd0a558SYan, Zheng 2653fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2663fd0a558SYan, Zheng node = list_entry(cache->detached.next, 2673fd0a558SYan, Zheng struct backref_node, list); 2683fd0a558SYan, Zheng remove_backref_node(cache, node); 2693fd0a558SYan, Zheng } 2703fd0a558SYan, Zheng 2713fd0a558SYan, Zheng while (!list_empty(&cache->leaves)) { 2723fd0a558SYan, Zheng node = list_entry(cache->leaves.next, 2733fd0a558SYan, Zheng struct backref_node, lower); 2743fd0a558SYan, Zheng remove_backref_node(cache, node); 2753fd0a558SYan, Zheng } 2763fd0a558SYan, Zheng 2773fd0a558SYan, Zheng cache->last_trans = 0; 2783fd0a558SYan, Zheng 2793fd0a558SYan, Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 280f4907095SLiu Bo ASSERT(list_empty(&cache->pending[i])); 281f4907095SLiu Bo ASSERT(list_empty(&cache->changed)); 282f4907095SLiu Bo ASSERT(list_empty(&cache->detached)); 283f4907095SLiu Bo ASSERT(RB_EMPTY_ROOT(&cache->rb_root)); 284f4907095SLiu Bo ASSERT(!cache->nr_nodes); 285f4907095SLiu Bo ASSERT(!cache->nr_edges); 2863fd0a558SYan, Zheng } 2873fd0a558SYan, Zheng 2883fd0a558SYan, Zheng static struct backref_node *alloc_backref_node(struct backref_cache *cache) 2893fd0a558SYan, Zheng { 2903fd0a558SYan, Zheng struct backref_node *node; 2913fd0a558SYan, Zheng 2923fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 2933fd0a558SYan, Zheng if (node) { 2943fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 2955d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 2965d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 2975d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 2983fd0a558SYan, Zheng cache->nr_nodes++; 2993fd0a558SYan, Zheng } 3003fd0a558SYan, Zheng return node; 3013fd0a558SYan, Zheng } 3023fd0a558SYan, Zheng 3033fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 3043fd0a558SYan, Zheng struct backref_node *node) 3053fd0a558SYan, Zheng { 3063fd0a558SYan, Zheng if (node) { 3073fd0a558SYan, Zheng cache->nr_nodes--; 30800246528SJosef Bacik btrfs_put_root(node->root); 3093fd0a558SYan, Zheng kfree(node); 3103fd0a558SYan, Zheng } 3113fd0a558SYan, Zheng } 3123fd0a558SYan, Zheng 3133fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 3143fd0a558SYan, Zheng { 3153fd0a558SYan, Zheng struct backref_edge *edge; 3163fd0a558SYan, Zheng 3173fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 3183fd0a558SYan, Zheng if (edge) 3193fd0a558SYan, Zheng cache->nr_edges++; 3203fd0a558SYan, Zheng return edge; 3213fd0a558SYan, Zheng } 3223fd0a558SYan, Zheng 3233fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 3243fd0a558SYan, Zheng struct backref_edge *edge) 3253fd0a558SYan, Zheng { 3263fd0a558SYan, Zheng if (edge) { 3273fd0a558SYan, Zheng cache->nr_edges--; 3283fd0a558SYan, Zheng kfree(edge); 3293fd0a558SYan, Zheng } 3305d4f98a2SYan Zheng } 3315d4f98a2SYan Zheng 3325d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 3335d4f98a2SYan Zheng struct rb_node *node) 3345d4f98a2SYan Zheng { 3355d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 3365d4f98a2SYan Zheng struct rb_node *parent = NULL; 3375d4f98a2SYan Zheng struct tree_entry *entry; 3385d4f98a2SYan Zheng 3395d4f98a2SYan Zheng while (*p) { 3405d4f98a2SYan Zheng parent = *p; 3415d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 3425d4f98a2SYan Zheng 3435d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3445d4f98a2SYan Zheng p = &(*p)->rb_left; 3455d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3465d4f98a2SYan Zheng p = &(*p)->rb_right; 3475d4f98a2SYan Zheng else 3485d4f98a2SYan Zheng return parent; 3495d4f98a2SYan Zheng } 3505d4f98a2SYan Zheng 3515d4f98a2SYan Zheng rb_link_node(node, parent, p); 3525d4f98a2SYan Zheng rb_insert_color(node, root); 3535d4f98a2SYan Zheng return NULL; 3545d4f98a2SYan Zheng } 3555d4f98a2SYan Zheng 3565d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 3575d4f98a2SYan Zheng { 3585d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 3595d4f98a2SYan Zheng struct tree_entry *entry; 3605d4f98a2SYan Zheng 3615d4f98a2SYan Zheng while (n) { 3625d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 3635d4f98a2SYan Zheng 3645d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3655d4f98a2SYan Zheng n = n->rb_left; 3665d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3675d4f98a2SYan Zheng n = n->rb_right; 3685d4f98a2SYan Zheng else 3695d4f98a2SYan Zheng return n; 3705d4f98a2SYan Zheng } 3715d4f98a2SYan Zheng return NULL; 3725d4f98a2SYan Zheng } 3735d4f98a2SYan Zheng 37448a3b636SEric Sandeen static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) 37543c04fb1SJeff Mahoney { 37643c04fb1SJeff Mahoney 37743c04fb1SJeff Mahoney struct btrfs_fs_info *fs_info = NULL; 37843c04fb1SJeff Mahoney struct backref_node *bnode = rb_entry(rb_node, struct backref_node, 37943c04fb1SJeff Mahoney rb_node); 38043c04fb1SJeff Mahoney if (bnode->root) 38143c04fb1SJeff Mahoney fs_info = bnode->root->fs_info; 3825d163e0eSJeff Mahoney btrfs_panic(fs_info, errno, 3835d163e0eSJeff Mahoney "Inconsistency in backref cache found at offset %llu", 3845d163e0eSJeff Mahoney bytenr); 38543c04fb1SJeff Mahoney } 38643c04fb1SJeff Mahoney 3875d4f98a2SYan Zheng /* 3885d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 3895d4f98a2SYan Zheng */ 3905d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 3915d4f98a2SYan Zheng struct backref_edge *edges[], 3925d4f98a2SYan Zheng int *index) 3935d4f98a2SYan Zheng { 3945d4f98a2SYan Zheng struct backref_edge *edge; 3955d4f98a2SYan Zheng int idx = *index; 3965d4f98a2SYan Zheng 3975d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 3985d4f98a2SYan Zheng edge = list_entry(node->upper.next, 3995d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 4005d4f98a2SYan Zheng edges[idx++] = edge; 4015d4f98a2SYan Zheng node = edge->node[UPPER]; 4025d4f98a2SYan Zheng } 4033fd0a558SYan, Zheng BUG_ON(node->detached); 4045d4f98a2SYan Zheng *index = idx; 4055d4f98a2SYan Zheng return node; 4065d4f98a2SYan Zheng } 4075d4f98a2SYan Zheng 4085d4f98a2SYan Zheng /* 4095d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 4105d4f98a2SYan Zheng */ 4115d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 4125d4f98a2SYan Zheng int *index) 4135d4f98a2SYan Zheng { 4145d4f98a2SYan Zheng struct backref_edge *edge; 4155d4f98a2SYan Zheng struct backref_node *lower; 4165d4f98a2SYan Zheng int idx = *index; 4175d4f98a2SYan Zheng 4185d4f98a2SYan Zheng while (idx > 0) { 4195d4f98a2SYan Zheng edge = edges[idx - 1]; 4205d4f98a2SYan Zheng lower = edge->node[LOWER]; 4215d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 4225d4f98a2SYan Zheng idx--; 4235d4f98a2SYan Zheng continue; 4245d4f98a2SYan Zheng } 4255d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 4265d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 4275d4f98a2SYan Zheng edges[idx - 1] = edge; 4285d4f98a2SYan Zheng *index = idx; 4295d4f98a2SYan Zheng return edge->node[UPPER]; 4305d4f98a2SYan Zheng } 4315d4f98a2SYan Zheng *index = 0; 4325d4f98a2SYan Zheng return NULL; 4335d4f98a2SYan Zheng } 4345d4f98a2SYan Zheng 4353fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 4365d4f98a2SYan Zheng { 4375d4f98a2SYan Zheng if (node->locked) { 4385d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 4395d4f98a2SYan Zheng node->locked = 0; 4405d4f98a2SYan Zheng } 4413fd0a558SYan, Zheng } 4423fd0a558SYan, Zheng 4433fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 4443fd0a558SYan, Zheng { 4453fd0a558SYan, Zheng if (node->eb) { 4463fd0a558SYan, Zheng unlock_node_buffer(node); 4475d4f98a2SYan Zheng free_extent_buffer(node->eb); 4485d4f98a2SYan Zheng node->eb = NULL; 4495d4f98a2SYan Zheng } 4505d4f98a2SYan Zheng } 4515d4f98a2SYan Zheng 4525d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 4535d4f98a2SYan Zheng struct backref_node *node) 4545d4f98a2SYan Zheng { 4555d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 4565d4f98a2SYan Zheng 4575d4f98a2SYan Zheng drop_node_buffer(node); 4583fd0a558SYan, Zheng list_del(&node->list); 4595d4f98a2SYan Zheng list_del(&node->lower); 4603fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 4615d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 4623fd0a558SYan, Zheng free_backref_node(tree, node); 4635d4f98a2SYan Zheng } 4645d4f98a2SYan Zheng 4655d4f98a2SYan Zheng /* 4665d4f98a2SYan Zheng * remove a backref node from the backref cache 4675d4f98a2SYan Zheng */ 4685d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 4695d4f98a2SYan Zheng struct backref_node *node) 4705d4f98a2SYan Zheng { 4715d4f98a2SYan Zheng struct backref_node *upper; 4725d4f98a2SYan Zheng struct backref_edge *edge; 4735d4f98a2SYan Zheng 4745d4f98a2SYan Zheng if (!node) 4755d4f98a2SYan Zheng return; 4765d4f98a2SYan Zheng 4773fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 4785d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4795d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 4805d4f98a2SYan Zheng list[LOWER]); 4815d4f98a2SYan Zheng upper = edge->node[UPPER]; 4825d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 4835d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 4843fd0a558SYan, Zheng free_backref_edge(cache, edge); 4853fd0a558SYan, Zheng 4863fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 4873fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 4883fd0a558SYan, Zheng drop_backref_node(cache, node); 4893fd0a558SYan, Zheng node = upper; 4903fd0a558SYan, Zheng node->lowest = 1; 4913fd0a558SYan, Zheng continue; 4923fd0a558SYan, Zheng } 4935d4f98a2SYan Zheng /* 4943fd0a558SYan, Zheng * add the node to leaf node list if no other 4955d4f98a2SYan Zheng * child block cached. 4965d4f98a2SYan Zheng */ 4975d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 4983fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 4995d4f98a2SYan Zheng upper->lowest = 1; 5005d4f98a2SYan Zheng } 5015d4f98a2SYan Zheng } 5023fd0a558SYan, Zheng 5035d4f98a2SYan Zheng drop_backref_node(cache, node); 5045d4f98a2SYan Zheng } 5055d4f98a2SYan Zheng 5063fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 5073fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 5083fd0a558SYan, Zheng { 5093fd0a558SYan, Zheng struct rb_node *rb_node; 5103fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 5113fd0a558SYan, Zheng node->bytenr = bytenr; 5123fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 51343c04fb1SJeff Mahoney if (rb_node) 51443c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, bytenr); 5153fd0a558SYan, Zheng } 5163fd0a558SYan, Zheng 5173fd0a558SYan, Zheng /* 5183fd0a558SYan, Zheng * update backref cache after a transaction commit 5193fd0a558SYan, Zheng */ 5203fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 5213fd0a558SYan, Zheng struct backref_cache *cache) 5223fd0a558SYan, Zheng { 5233fd0a558SYan, Zheng struct backref_node *node; 5243fd0a558SYan, Zheng int level = 0; 5253fd0a558SYan, Zheng 5263fd0a558SYan, Zheng if (cache->last_trans == 0) { 5273fd0a558SYan, Zheng cache->last_trans = trans->transid; 5283fd0a558SYan, Zheng return 0; 5293fd0a558SYan, Zheng } 5303fd0a558SYan, Zheng 5313fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 5323fd0a558SYan, Zheng return 0; 5333fd0a558SYan, Zheng 5343fd0a558SYan, Zheng /* 5353fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 5363fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 5373fd0a558SYan, Zheng * so the detached nodes are no longer useful. 5383fd0a558SYan, Zheng */ 5393fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 5403fd0a558SYan, Zheng node = list_entry(cache->detached.next, 5413fd0a558SYan, Zheng struct backref_node, list); 5423fd0a558SYan, Zheng remove_backref_node(cache, node); 5433fd0a558SYan, Zheng } 5443fd0a558SYan, Zheng 5453fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 5463fd0a558SYan, Zheng node = list_entry(cache->changed.next, 5473fd0a558SYan, Zheng struct backref_node, list); 5483fd0a558SYan, Zheng list_del_init(&node->list); 5493fd0a558SYan, Zheng BUG_ON(node->pending); 5503fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5513fd0a558SYan, Zheng } 5523fd0a558SYan, Zheng 5533fd0a558SYan, Zheng /* 5543fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 5553fd0a558SYan, Zheng * errors during processing the pending nodes. 5563fd0a558SYan, Zheng */ 5573fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 5583fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 5593fd0a558SYan, Zheng BUG_ON(!node->pending); 5603fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 5613fd0a558SYan, Zheng continue; 5623fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5633fd0a558SYan, Zheng } 5643fd0a558SYan, Zheng } 5653fd0a558SYan, Zheng 5663fd0a558SYan, Zheng cache->last_trans = 0; 5673fd0a558SYan, Zheng return 1; 5683fd0a558SYan, Zheng } 5693fd0a558SYan, Zheng 5706282675eSQu Wenruo static bool reloc_root_is_dead(struct btrfs_root *root) 5716282675eSQu Wenruo { 5726282675eSQu Wenruo /* 5736282675eSQu Wenruo * Pair with set_bit/clear_bit in clean_dirty_subvols and 5746282675eSQu Wenruo * btrfs_update_reloc_root. We need to see the updated bit before 5756282675eSQu Wenruo * trying to access reloc_root 5766282675eSQu Wenruo */ 5776282675eSQu Wenruo smp_rmb(); 5786282675eSQu Wenruo if (test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state)) 5796282675eSQu Wenruo return true; 5806282675eSQu Wenruo return false; 5816282675eSQu Wenruo } 5826282675eSQu Wenruo 5836282675eSQu Wenruo /* 5846282675eSQu Wenruo * Check if this subvolume tree has valid reloc tree. 5856282675eSQu Wenruo * 5866282675eSQu Wenruo * Reloc tree after swap is considered dead, thus not considered as valid. 5876282675eSQu Wenruo * This is enough for most callers, as they don't distinguish dead reloc root 5886282675eSQu Wenruo * from no reloc root. But should_ignore_root() below is a special case. 5896282675eSQu Wenruo */ 5906282675eSQu Wenruo static bool have_reloc_root(struct btrfs_root *root) 5916282675eSQu Wenruo { 5926282675eSQu Wenruo if (reloc_root_is_dead(root)) 5936282675eSQu Wenruo return false; 5946282675eSQu Wenruo if (!root->reloc_root) 5956282675eSQu Wenruo return false; 5966282675eSQu Wenruo return true; 5976282675eSQu Wenruo } 598f2a97a9dSDavid Sterba 5993fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 6003fd0a558SYan, Zheng { 6013fd0a558SYan, Zheng struct btrfs_root *reloc_root; 6023fd0a558SYan, Zheng 60327cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 6043fd0a558SYan, Zheng return 0; 6053fd0a558SYan, Zheng 6066282675eSQu Wenruo /* This root has been merged with its reloc tree, we can ignore it */ 6076282675eSQu Wenruo if (reloc_root_is_dead(root)) 6086282675eSQu Wenruo return 1; 6096282675eSQu Wenruo 6103fd0a558SYan, Zheng reloc_root = root->reloc_root; 6113fd0a558SYan, Zheng if (!reloc_root) 6123fd0a558SYan, Zheng return 0; 6133fd0a558SYan, Zheng 6143fd0a558SYan, Zheng if (btrfs_root_last_snapshot(&reloc_root->root_item) == 6153fd0a558SYan, Zheng root->fs_info->running_transaction->transid - 1) 6163fd0a558SYan, Zheng return 0; 6173fd0a558SYan, Zheng /* 6183fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 6193fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 6203fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 6213fd0a558SYan, Zheng * relocation. 6223fd0a558SYan, Zheng */ 6233fd0a558SYan, Zheng return 1; 6243fd0a558SYan, Zheng } 6255d4f98a2SYan Zheng /* 6265d4f98a2SYan Zheng * find reloc tree by address of tree root 6275d4f98a2SYan Zheng */ 6285d4f98a2SYan Zheng static struct btrfs_root *find_reloc_root(struct reloc_control *rc, 6295d4f98a2SYan Zheng u64 bytenr) 6305d4f98a2SYan Zheng { 6315d4f98a2SYan Zheng struct rb_node *rb_node; 6325d4f98a2SYan Zheng struct mapping_node *node; 6335d4f98a2SYan Zheng struct btrfs_root *root = NULL; 6345d4f98a2SYan Zheng 6355d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 6365d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 6375d4f98a2SYan Zheng if (rb_node) { 6385d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 6395d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 6405d4f98a2SYan Zheng } 6415d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 64200246528SJosef Bacik return btrfs_grab_root(root); 6435d4f98a2SYan Zheng } 6445d4f98a2SYan Zheng 6455d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 6465d4f98a2SYan Zheng u64 root_objectid) 6475d4f98a2SYan Zheng { 6485d4f98a2SYan Zheng struct btrfs_key key; 6495d4f98a2SYan Zheng 6505d4f98a2SYan Zheng key.objectid = root_objectid; 6515d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 6525d4f98a2SYan Zheng key.offset = (u64)-1; 6535d4f98a2SYan Zheng 654bc44d7c4SJosef Bacik return btrfs_get_fs_root(fs_info, &key, false); 6555d4f98a2SYan Zheng } 6565d4f98a2SYan Zheng 6575d4f98a2SYan Zheng static noinline_for_stack 6585d4f98a2SYan Zheng int find_inline_backref(struct extent_buffer *leaf, int slot, 6595d4f98a2SYan Zheng unsigned long *ptr, unsigned long *end) 6605d4f98a2SYan Zheng { 6613173a18fSJosef Bacik struct btrfs_key key; 6625d4f98a2SYan Zheng struct btrfs_extent_item *ei; 6635d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 6645d4f98a2SYan Zheng u32 item_size; 6655d4f98a2SYan Zheng 6663173a18fSJosef Bacik btrfs_item_key_to_cpu(leaf, &key, slot); 6673173a18fSJosef Bacik 6685d4f98a2SYan Zheng item_size = btrfs_item_size_nr(leaf, slot); 669ba3c2b19SNikolay Borisov if (item_size < sizeof(*ei)) { 670ba3c2b19SNikolay Borisov btrfs_print_v0_err(leaf->fs_info); 671ba3c2b19SNikolay Borisov btrfs_handle_fs_error(leaf->fs_info, -EINVAL, NULL); 672ba3c2b19SNikolay Borisov return 1; 673ba3c2b19SNikolay Borisov } 6745d4f98a2SYan Zheng ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); 6755d4f98a2SYan Zheng WARN_ON(!(btrfs_extent_flags(leaf, ei) & 6765d4f98a2SYan Zheng BTRFS_EXTENT_FLAG_TREE_BLOCK)); 6775d4f98a2SYan Zheng 6783173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 6793173a18fSJosef Bacik item_size <= sizeof(*ei) + sizeof(*bi)) { 6805d4f98a2SYan Zheng WARN_ON(item_size < sizeof(*ei) + sizeof(*bi)); 6815d4f98a2SYan Zheng return 1; 6825d4f98a2SYan Zheng } 683d062d13cSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 684d062d13cSJosef Bacik item_size <= sizeof(*ei)) { 685d062d13cSJosef Bacik WARN_ON(item_size < sizeof(*ei)); 686d062d13cSJosef Bacik return 1; 687d062d13cSJosef Bacik } 6885d4f98a2SYan Zheng 6893173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) { 6905d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 6915d4f98a2SYan Zheng *ptr = (unsigned long)(bi + 1); 6923173a18fSJosef Bacik } else { 6933173a18fSJosef Bacik *ptr = (unsigned long)(ei + 1); 6943173a18fSJosef Bacik } 6955d4f98a2SYan Zheng *end = (unsigned long)ei + item_size; 6965d4f98a2SYan Zheng return 0; 6975d4f98a2SYan Zheng } 6985d4f98a2SYan Zheng 6995d4f98a2SYan Zheng /* 7005d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 7015d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 7025d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 7035d4f98a2SYan Zheng * 7045d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 70501327610SNicholas D Steeves * to find upper level blocks that reference the block, and then check 70601327610SNicholas D Steeves * backrefs of these upper level blocks recursively. the recursion stop 7075d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 7085d4f98a2SYan Zheng * 7095d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 7105d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 7115d4f98a2SYan Zheng * block are also cached. 7125d4f98a2SYan Zheng */ 7133fd0a558SYan, Zheng static noinline_for_stack 7143fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 7155d4f98a2SYan Zheng struct btrfs_key *node_key, 7165d4f98a2SYan Zheng int level, u64 bytenr) 7175d4f98a2SYan Zheng { 7183fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 719fa6ac715SQu Wenruo struct btrfs_path *path1; /* For searching extent root */ 720fa6ac715SQu Wenruo struct btrfs_path *path2; /* For searching parent of TREE_BLOCK_REF */ 7215d4f98a2SYan Zheng struct extent_buffer *eb; 7225d4f98a2SYan Zheng struct btrfs_root *root; 7235d4f98a2SYan Zheng struct backref_node *cur; 7245d4f98a2SYan Zheng struct backref_node *upper; 7255d4f98a2SYan Zheng struct backref_node *lower; 7265d4f98a2SYan Zheng struct backref_node *node = NULL; 7275d4f98a2SYan Zheng struct backref_node *exist = NULL; 7285d4f98a2SYan Zheng struct backref_edge *edge; 7295d4f98a2SYan Zheng struct rb_node *rb_node; 7305d4f98a2SYan Zheng struct btrfs_key key; 7315d4f98a2SYan Zheng unsigned long end; 7325d4f98a2SYan Zheng unsigned long ptr; 733fa6ac715SQu Wenruo LIST_HEAD(list); /* Pending edge list, upper node needs to be checked */ 7343fd0a558SYan, Zheng LIST_HEAD(useless); 7353fd0a558SYan, Zheng int cowonly; 7365d4f98a2SYan Zheng int ret; 7375d4f98a2SYan Zheng int err = 0; 738b6c60c80SJosef Bacik bool need_check = true; 7395d4f98a2SYan Zheng 7405d4f98a2SYan Zheng path1 = btrfs_alloc_path(); 7415d4f98a2SYan Zheng path2 = btrfs_alloc_path(); 7425d4f98a2SYan Zheng if (!path1 || !path2) { 7435d4f98a2SYan Zheng err = -ENOMEM; 7445d4f98a2SYan Zheng goto out; 7455d4f98a2SYan Zheng } 7465d4f98a2SYan Zheng 7473fd0a558SYan, Zheng node = alloc_backref_node(cache); 7485d4f98a2SYan Zheng if (!node) { 7495d4f98a2SYan Zheng err = -ENOMEM; 7505d4f98a2SYan Zheng goto out; 7515d4f98a2SYan Zheng } 7525d4f98a2SYan Zheng 7535d4f98a2SYan Zheng node->bytenr = bytenr; 7545d4f98a2SYan Zheng node->level = level; 7555d4f98a2SYan Zheng node->lowest = 1; 7565d4f98a2SYan Zheng cur = node; 7575d4f98a2SYan Zheng again: 7585d4f98a2SYan Zheng end = 0; 7595d4f98a2SYan Zheng ptr = 0; 7605d4f98a2SYan Zheng key.objectid = cur->bytenr; 7613173a18fSJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 7625d4f98a2SYan Zheng key.offset = (u64)-1; 7635d4f98a2SYan Zheng 7645d4f98a2SYan Zheng path1->search_commit_root = 1; 7655d4f98a2SYan Zheng path1->skip_locking = 1; 7665d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1, 7675d4f98a2SYan Zheng 0, 0); 7685d4f98a2SYan Zheng if (ret < 0) { 7695d4f98a2SYan Zheng err = ret; 7705d4f98a2SYan Zheng goto out; 7715d4f98a2SYan Zheng } 77275bfb9afSJosef Bacik ASSERT(ret); 77375bfb9afSJosef Bacik ASSERT(path1->slots[0]); 7745d4f98a2SYan Zheng 7755d4f98a2SYan Zheng path1->slots[0]--; 7765d4f98a2SYan Zheng 7775d4f98a2SYan Zheng WARN_ON(cur->checked); 7785d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 7795d4f98a2SYan Zheng /* 78070f23fd6SJustin P. Mattock * the backref was added previously when processing 7815d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 7825d4f98a2SYan Zheng */ 78375bfb9afSJosef Bacik ASSERT(list_is_singular(&cur->upper)); 7845d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 7855d4f98a2SYan Zheng list[LOWER]); 78675bfb9afSJosef Bacik ASSERT(list_empty(&edge->list[UPPER])); 7875d4f98a2SYan Zheng exist = edge->node[UPPER]; 7885d4f98a2SYan Zheng /* 7895d4f98a2SYan Zheng * add the upper level block to pending list if we need 7905d4f98a2SYan Zheng * check its backrefs 7915d4f98a2SYan Zheng */ 7925d4f98a2SYan Zheng if (!exist->checked) 7935d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 7945d4f98a2SYan Zheng } else { 7955d4f98a2SYan Zheng exist = NULL; 7965d4f98a2SYan Zheng } 7975d4f98a2SYan Zheng 7985d4f98a2SYan Zheng while (1) { 7995d4f98a2SYan Zheng cond_resched(); 8005d4f98a2SYan Zheng eb = path1->nodes[0]; 8015d4f98a2SYan Zheng 8025d4f98a2SYan Zheng if (ptr >= end) { 8035d4f98a2SYan Zheng if (path1->slots[0] >= btrfs_header_nritems(eb)) { 8045d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path1); 8055d4f98a2SYan Zheng if (ret < 0) { 8065d4f98a2SYan Zheng err = ret; 8075d4f98a2SYan Zheng goto out; 8085d4f98a2SYan Zheng } 8095d4f98a2SYan Zheng if (ret > 0) 8105d4f98a2SYan Zheng break; 8115d4f98a2SYan Zheng eb = path1->nodes[0]; 8125d4f98a2SYan Zheng } 8135d4f98a2SYan Zheng 8145d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path1->slots[0]); 8155d4f98a2SYan Zheng if (key.objectid != cur->bytenr) { 8165d4f98a2SYan Zheng WARN_ON(exist); 8175d4f98a2SYan Zheng break; 8185d4f98a2SYan Zheng } 8195d4f98a2SYan Zheng 8203173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY || 8213173a18fSJosef Bacik key.type == BTRFS_METADATA_ITEM_KEY) { 8225d4f98a2SYan Zheng ret = find_inline_backref(eb, path1->slots[0], 8235d4f98a2SYan Zheng &ptr, &end); 8245d4f98a2SYan Zheng if (ret) 8255d4f98a2SYan Zheng goto next; 8265d4f98a2SYan Zheng } 8275d4f98a2SYan Zheng } 8285d4f98a2SYan Zheng 8295d4f98a2SYan Zheng if (ptr < end) { 8305d4f98a2SYan Zheng /* update key for inline back ref */ 8315d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 8323de28d57SLiu Bo int type; 8335d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 8343de28d57SLiu Bo type = btrfs_get_extent_inline_ref_type(eb, iref, 8353de28d57SLiu Bo BTRFS_REF_TYPE_BLOCK); 8363de28d57SLiu Bo if (type == BTRFS_REF_TYPE_INVALID) { 837af431dcbSSu Yue err = -EUCLEAN; 8383de28d57SLiu Bo goto out; 8393de28d57SLiu Bo } 8403de28d57SLiu Bo key.type = type; 8415d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 8423de28d57SLiu Bo 8435d4f98a2SYan Zheng WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY && 8445d4f98a2SYan Zheng key.type != BTRFS_SHARED_BLOCK_REF_KEY); 8455d4f98a2SYan Zheng } 8465d4f98a2SYan Zheng 847fa6ac715SQu Wenruo /* 848fa6ac715SQu Wenruo * Parent node found and matches current inline ref, no need to 849fa6ac715SQu Wenruo * rebuild this node for this inline ref. 850fa6ac715SQu Wenruo */ 8515d4f98a2SYan Zheng if (exist && 8525d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 8535d4f98a2SYan Zheng exist->owner == key.offset) || 8545d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 8555d4f98a2SYan Zheng exist->bytenr == key.offset))) { 8565d4f98a2SYan Zheng exist = NULL; 8575d4f98a2SYan Zheng goto next; 8585d4f98a2SYan Zheng } 8595d4f98a2SYan Zheng 860fa6ac715SQu Wenruo /* SHARED_BLOCK_REF means key.offset is the parent bytenr */ 8615d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 8625d4f98a2SYan Zheng if (key.objectid == key.offset) { 8635d4f98a2SYan Zheng /* 864fa6ac715SQu Wenruo * Only root blocks of reloc trees use backref 865fa6ac715SQu Wenruo * pointing to itself. 8665d4f98a2SYan Zheng */ 8675d4f98a2SYan Zheng root = find_reloc_root(rc, cur->bytenr); 86875bfb9afSJosef Bacik ASSERT(root); 8695d4f98a2SYan Zheng cur->root = root; 8705d4f98a2SYan Zheng break; 8715d4f98a2SYan Zheng } 8725d4f98a2SYan Zheng 8733fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 8745d4f98a2SYan Zheng if (!edge) { 8755d4f98a2SYan Zheng err = -ENOMEM; 8765d4f98a2SYan Zheng goto out; 8775d4f98a2SYan Zheng } 8785d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, key.offset); 8795d4f98a2SYan Zheng if (!rb_node) { 8803fd0a558SYan, Zheng upper = alloc_backref_node(cache); 8815d4f98a2SYan Zheng if (!upper) { 8823fd0a558SYan, Zheng free_backref_edge(cache, edge); 8835d4f98a2SYan Zheng err = -ENOMEM; 8845d4f98a2SYan Zheng goto out; 8855d4f98a2SYan Zheng } 8865d4f98a2SYan Zheng upper->bytenr = key.offset; 8875d4f98a2SYan Zheng upper->level = cur->level + 1; 8885d4f98a2SYan Zheng /* 8895d4f98a2SYan Zheng * backrefs for the upper level block isn't 8905d4f98a2SYan Zheng * cached, add the block to pending list 8915d4f98a2SYan Zheng */ 8925d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 8935d4f98a2SYan Zheng } else { 8945d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 8955d4f98a2SYan Zheng rb_node); 89675bfb9afSJosef Bacik ASSERT(upper->checked); 8975d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 8985d4f98a2SYan Zheng } 8993fd0a558SYan, Zheng list_add_tail(&edge->list[LOWER], &cur->upper); 9005d4f98a2SYan Zheng edge->node[LOWER] = cur; 9013fd0a558SYan, Zheng edge->node[UPPER] = upper; 9025d4f98a2SYan Zheng 9035d4f98a2SYan Zheng goto next; 9046d8ff4e4SDavid Sterba } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) { 905ba3c2b19SNikolay Borisov err = -EINVAL; 906ba3c2b19SNikolay Borisov btrfs_print_v0_err(rc->extent_root->fs_info); 907ba3c2b19SNikolay Borisov btrfs_handle_fs_error(rc->extent_root->fs_info, err, 908ba3c2b19SNikolay Borisov NULL); 909ba3c2b19SNikolay Borisov goto out; 9105d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 9115d4f98a2SYan Zheng goto next; 9125d4f98a2SYan Zheng } 9135d4f98a2SYan Zheng 914fa6ac715SQu Wenruo /* 915fa6ac715SQu Wenruo * key.type == BTRFS_TREE_BLOCK_REF_KEY, inline ref offset 916fa6ac715SQu Wenruo * means the root objectid. We need to search the tree to get 917fa6ac715SQu Wenruo * its parent bytenr. 918fa6ac715SQu Wenruo */ 9195d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, key.offset); 9205d4f98a2SYan Zheng if (IS_ERR(root)) { 9215d4f98a2SYan Zheng err = PTR_ERR(root); 9225d4f98a2SYan Zheng goto out; 9235d4f98a2SYan Zheng } 9245d4f98a2SYan Zheng 92527cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 9263fd0a558SYan, Zheng cur->cowonly = 1; 9273fd0a558SYan, Zheng 9285d4f98a2SYan Zheng if (btrfs_root_level(&root->root_item) == cur->level) { 9295d4f98a2SYan Zheng /* tree root */ 93075bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 9315d4f98a2SYan Zheng cur->bytenr); 9320b530bc5SJosef Bacik if (should_ignore_root(root)) { 93300246528SJosef Bacik btrfs_put_root(root); 9343fd0a558SYan, Zheng list_add(&cur->list, &useless); 9350b530bc5SJosef Bacik } else { 9365d4f98a2SYan Zheng cur->root = root; 9370b530bc5SJosef Bacik } 9385d4f98a2SYan Zheng break; 9395d4f98a2SYan Zheng } 9405d4f98a2SYan Zheng 9415d4f98a2SYan Zheng level = cur->level + 1; 9425d4f98a2SYan Zheng 943fa6ac715SQu Wenruo /* Search the tree to find parent blocks referring the block. */ 9445d4f98a2SYan Zheng path2->search_commit_root = 1; 9455d4f98a2SYan Zheng path2->skip_locking = 1; 9465d4f98a2SYan Zheng path2->lowest_level = level; 9475d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0); 9485d4f98a2SYan Zheng path2->lowest_level = 0; 9495d4f98a2SYan Zheng if (ret < 0) { 95000246528SJosef Bacik btrfs_put_root(root); 9515d4f98a2SYan Zheng err = ret; 9525d4f98a2SYan Zheng goto out; 9535d4f98a2SYan Zheng } 95433c66f43SYan Zheng if (ret > 0 && path2->slots[level] > 0) 95533c66f43SYan Zheng path2->slots[level]--; 9565d4f98a2SYan Zheng 9575d4f98a2SYan Zheng eb = path2->nodes[level]; 9583561b9dbSLiu Bo if (btrfs_node_blockptr(eb, path2->slots[level]) != 9593561b9dbSLiu Bo cur->bytenr) { 9603561b9dbSLiu Bo btrfs_err(root->fs_info, 9613561b9dbSLiu Bo "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)", 9624fd786e6SMisono Tomohiro cur->bytenr, level - 1, 9634fd786e6SMisono Tomohiro root->root_key.objectid, 9643561b9dbSLiu Bo node_key->objectid, node_key->type, 9653561b9dbSLiu Bo node_key->offset); 96600246528SJosef Bacik btrfs_put_root(root); 9673561b9dbSLiu Bo err = -ENOENT; 9683561b9dbSLiu Bo goto out; 9693561b9dbSLiu Bo } 9705d4f98a2SYan Zheng lower = cur; 971b6c60c80SJosef Bacik need_check = true; 972fa6ac715SQu Wenruo 973fa6ac715SQu Wenruo /* Add all nodes and edges in the path */ 9745d4f98a2SYan Zheng for (; level < BTRFS_MAX_LEVEL; level++) { 9755d4f98a2SYan Zheng if (!path2->nodes[level]) { 97675bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 9775d4f98a2SYan Zheng lower->bytenr); 9780b530bc5SJosef Bacik if (should_ignore_root(root)) { 97900246528SJosef Bacik btrfs_put_root(root); 9803fd0a558SYan, Zheng list_add(&lower->list, &useless); 9810b530bc5SJosef Bacik } else { 9825d4f98a2SYan Zheng lower->root = root; 9830b530bc5SJosef Bacik } 9845d4f98a2SYan Zheng break; 9855d4f98a2SYan Zheng } 9865d4f98a2SYan Zheng 9873fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 9885d4f98a2SYan Zheng if (!edge) { 98900246528SJosef Bacik btrfs_put_root(root); 9905d4f98a2SYan Zheng err = -ENOMEM; 9915d4f98a2SYan Zheng goto out; 9925d4f98a2SYan Zheng } 9935d4f98a2SYan Zheng 9945d4f98a2SYan Zheng eb = path2->nodes[level]; 9955d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, eb->start); 9965d4f98a2SYan Zheng if (!rb_node) { 9973fd0a558SYan, Zheng upper = alloc_backref_node(cache); 9985d4f98a2SYan Zheng if (!upper) { 99900246528SJosef Bacik btrfs_put_root(root); 10003fd0a558SYan, Zheng free_backref_edge(cache, edge); 10015d4f98a2SYan Zheng err = -ENOMEM; 10025d4f98a2SYan Zheng goto out; 10035d4f98a2SYan Zheng } 10045d4f98a2SYan Zheng upper->bytenr = eb->start; 10055d4f98a2SYan Zheng upper->owner = btrfs_header_owner(eb); 10065d4f98a2SYan Zheng upper->level = lower->level + 1; 100727cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, 100827cdeb70SMiao Xie &root->state)) 10093fd0a558SYan, Zheng upper->cowonly = 1; 10105d4f98a2SYan Zheng 10115d4f98a2SYan Zheng /* 10125d4f98a2SYan Zheng * if we know the block isn't shared 10135d4f98a2SYan Zheng * we can void checking its backrefs. 10145d4f98a2SYan Zheng */ 10155d4f98a2SYan Zheng if (btrfs_block_can_be_shared(root, eb)) 10165d4f98a2SYan Zheng upper->checked = 0; 10175d4f98a2SYan Zheng else 10185d4f98a2SYan Zheng upper->checked = 1; 10195d4f98a2SYan Zheng 10205d4f98a2SYan Zheng /* 10215d4f98a2SYan Zheng * add the block to pending list if we 1022b6c60c80SJosef Bacik * need check its backrefs, we only do this once 1023b6c60c80SJosef Bacik * while walking up a tree as we will catch 1024b6c60c80SJosef Bacik * anything else later on. 10255d4f98a2SYan Zheng */ 1026b6c60c80SJosef Bacik if (!upper->checked && need_check) { 1027b6c60c80SJosef Bacik need_check = false; 10285d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], 10295d4f98a2SYan Zheng &list); 1030bbe90514SJosef Bacik } else { 1031bbe90514SJosef Bacik if (upper->checked) 1032bbe90514SJosef Bacik need_check = true; 10335d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 1034bbe90514SJosef Bacik } 10355d4f98a2SYan Zheng } else { 10365d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 10375d4f98a2SYan Zheng rb_node); 103875bfb9afSJosef Bacik ASSERT(upper->checked); 10395d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 10403fd0a558SYan, Zheng if (!upper->owner) 10413fd0a558SYan, Zheng upper->owner = btrfs_header_owner(eb); 10425d4f98a2SYan Zheng } 10435d4f98a2SYan Zheng list_add_tail(&edge->list[LOWER], &lower->upper); 10445d4f98a2SYan Zheng edge->node[LOWER] = lower; 10453fd0a558SYan, Zheng edge->node[UPPER] = upper; 10465d4f98a2SYan Zheng 10470b530bc5SJosef Bacik if (rb_node) { 104800246528SJosef Bacik btrfs_put_root(root); 10495d4f98a2SYan Zheng break; 10500b530bc5SJosef Bacik } 10515d4f98a2SYan Zheng lower = upper; 10525d4f98a2SYan Zheng upper = NULL; 10535d4f98a2SYan Zheng } 1054b3b4aa74SDavid Sterba btrfs_release_path(path2); 10555d4f98a2SYan Zheng next: 10565d4f98a2SYan Zheng if (ptr < end) { 10575d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 10585d4f98a2SYan Zheng if (ptr >= end) { 10595d4f98a2SYan Zheng WARN_ON(ptr > end); 10605d4f98a2SYan Zheng ptr = 0; 10615d4f98a2SYan Zheng end = 0; 10625d4f98a2SYan Zheng } 10635d4f98a2SYan Zheng } 10645d4f98a2SYan Zheng if (ptr >= end) 10655d4f98a2SYan Zheng path1->slots[0]++; 10665d4f98a2SYan Zheng } 1067b3b4aa74SDavid Sterba btrfs_release_path(path1); 10685d4f98a2SYan Zheng 10695d4f98a2SYan Zheng cur->checked = 1; 10705d4f98a2SYan Zheng WARN_ON(exist); 10715d4f98a2SYan Zheng 10725d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 10735d4f98a2SYan Zheng if (!list_empty(&list)) { 10745d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10755d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10765d4f98a2SYan Zheng cur = edge->node[UPPER]; 10775d4f98a2SYan Zheng goto again; 10785d4f98a2SYan Zheng } 10795d4f98a2SYan Zheng 10805d4f98a2SYan Zheng /* 10815d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 10825d4f98a2SYan Zheng * into the cache. 10835d4f98a2SYan Zheng */ 108475bfb9afSJosef Bacik ASSERT(node->checked); 10853fd0a558SYan, Zheng cowonly = node->cowonly; 10863fd0a558SYan, Zheng if (!cowonly) { 10873fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 10883fd0a558SYan, Zheng &node->rb_node); 108943c04fb1SJeff Mahoney if (rb_node) 109043c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 10913fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 10923fd0a558SYan, Zheng } 10935d4f98a2SYan Zheng 10945d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 10955d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10965d4f98a2SYan Zheng 10975d4f98a2SYan Zheng while (!list_empty(&list)) { 10985d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10995d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 11005d4f98a2SYan Zheng upper = edge->node[UPPER]; 11013fd0a558SYan, Zheng if (upper->detached) { 11023fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11033fd0a558SYan, Zheng lower = edge->node[LOWER]; 11043fd0a558SYan, Zheng free_backref_edge(cache, edge); 11053fd0a558SYan, Zheng if (list_empty(&lower->upper)) 11063fd0a558SYan, Zheng list_add(&lower->list, &useless); 11073fd0a558SYan, Zheng continue; 11083fd0a558SYan, Zheng } 11095d4f98a2SYan Zheng 11105d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 11115d4f98a2SYan Zheng if (upper->lowest) { 11125d4f98a2SYan Zheng list_del_init(&upper->lower); 11135d4f98a2SYan Zheng upper->lowest = 0; 11145d4f98a2SYan Zheng } 11155d4f98a2SYan Zheng 11165d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 11175d4f98a2SYan Zheng continue; 11185d4f98a2SYan Zheng } 11195d4f98a2SYan Zheng 112075bfb9afSJosef Bacik if (!upper->checked) { 112175bfb9afSJosef Bacik /* 112275bfb9afSJosef Bacik * Still want to blow up for developers since this is a 112375bfb9afSJosef Bacik * logic bug. 112475bfb9afSJosef Bacik */ 112575bfb9afSJosef Bacik ASSERT(0); 112675bfb9afSJosef Bacik err = -EINVAL; 112775bfb9afSJosef Bacik goto out; 112875bfb9afSJosef Bacik } 112975bfb9afSJosef Bacik if (cowonly != upper->cowonly) { 113075bfb9afSJosef Bacik ASSERT(0); 113175bfb9afSJosef Bacik err = -EINVAL; 113275bfb9afSJosef Bacik goto out; 113375bfb9afSJosef Bacik } 113475bfb9afSJosef Bacik 11353fd0a558SYan, Zheng if (!cowonly) { 11365d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 11375d4f98a2SYan Zheng &upper->rb_node); 113843c04fb1SJeff Mahoney if (rb_node) 113943c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 114043c04fb1SJeff Mahoney upper->bytenr); 11413fd0a558SYan, Zheng } 11425d4f98a2SYan Zheng 11435d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 11445d4f98a2SYan Zheng 11455d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 11465d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 11475d4f98a2SYan Zheng } 11483fd0a558SYan, Zheng /* 11493fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 11503fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 11513fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 11523fd0a558SYan, Zheng * lookup. 11533fd0a558SYan, Zheng */ 11543fd0a558SYan, Zheng while (!list_empty(&useless)) { 11553fd0a558SYan, Zheng upper = list_entry(useless.next, struct backref_node, list); 11563fd0a558SYan, Zheng list_del_init(&upper->list); 115775bfb9afSJosef Bacik ASSERT(list_empty(&upper->upper)); 11583fd0a558SYan, Zheng if (upper == node) 11593fd0a558SYan, Zheng node = NULL; 11603fd0a558SYan, Zheng if (upper->lowest) { 11613fd0a558SYan, Zheng list_del_init(&upper->lower); 11623fd0a558SYan, Zheng upper->lowest = 0; 11633fd0a558SYan, Zheng } 11643fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 11653fd0a558SYan, Zheng edge = list_entry(upper->lower.next, 11663fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 11673fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 11683fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11693fd0a558SYan, Zheng lower = edge->node[LOWER]; 11703fd0a558SYan, Zheng free_backref_edge(cache, edge); 11713fd0a558SYan, Zheng 11723fd0a558SYan, Zheng if (list_empty(&lower->upper)) 11733fd0a558SYan, Zheng list_add(&lower->list, &useless); 11743fd0a558SYan, Zheng } 11753fd0a558SYan, Zheng __mark_block_processed(rc, upper); 11763fd0a558SYan, Zheng if (upper->level > 0) { 11773fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 11783fd0a558SYan, Zheng upper->detached = 1; 11793fd0a558SYan, Zheng } else { 11803fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 11813fd0a558SYan, Zheng free_backref_node(cache, upper); 11823fd0a558SYan, Zheng } 11833fd0a558SYan, Zheng } 11845d4f98a2SYan Zheng out: 11855d4f98a2SYan Zheng btrfs_free_path(path1); 11865d4f98a2SYan Zheng btrfs_free_path(path2); 11875d4f98a2SYan Zheng if (err) { 11883fd0a558SYan, Zheng while (!list_empty(&useless)) { 11893fd0a558SYan, Zheng lower = list_entry(useless.next, 119075bfb9afSJosef Bacik struct backref_node, list); 119175bfb9afSJosef Bacik list_del_init(&lower->list); 11923fd0a558SYan, Zheng } 119375bfb9afSJosef Bacik while (!list_empty(&list)) { 119475bfb9afSJosef Bacik edge = list_first_entry(&list, struct backref_edge, 119575bfb9afSJosef Bacik list[UPPER]); 119675bfb9afSJosef Bacik list_del(&edge->list[UPPER]); 11973fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 119875bfb9afSJosef Bacik lower = edge->node[LOWER]; 11995d4f98a2SYan Zheng upper = edge->node[UPPER]; 12003fd0a558SYan, Zheng free_backref_edge(cache, edge); 120175bfb9afSJosef Bacik 120275bfb9afSJosef Bacik /* 120375bfb9afSJosef Bacik * Lower is no longer linked to any upper backref nodes 120475bfb9afSJosef Bacik * and isn't in the cache, we can free it ourselves. 120575bfb9afSJosef Bacik */ 120675bfb9afSJosef Bacik if (list_empty(&lower->upper) && 120775bfb9afSJosef Bacik RB_EMPTY_NODE(&lower->rb_node)) 120875bfb9afSJosef Bacik list_add(&lower->list, &useless); 120975bfb9afSJosef Bacik 121075bfb9afSJosef Bacik if (!RB_EMPTY_NODE(&upper->rb_node)) 121175bfb9afSJosef Bacik continue; 121275bfb9afSJosef Bacik 121301327610SNicholas D Steeves /* Add this guy's upper edges to the list to process */ 121475bfb9afSJosef Bacik list_for_each_entry(edge, &upper->upper, list[LOWER]) 121575bfb9afSJosef Bacik list_add_tail(&edge->list[UPPER], &list); 121675bfb9afSJosef Bacik if (list_empty(&upper->upper)) 121775bfb9afSJosef Bacik list_add(&upper->list, &useless); 121875bfb9afSJosef Bacik } 121975bfb9afSJosef Bacik 122075bfb9afSJosef Bacik while (!list_empty(&useless)) { 122175bfb9afSJosef Bacik lower = list_entry(useless.next, 122275bfb9afSJosef Bacik struct backref_node, list); 122375bfb9afSJosef Bacik list_del_init(&lower->list); 12240fd8c3daSLiu Bo if (lower == node) 12250fd8c3daSLiu Bo node = NULL; 122675bfb9afSJosef Bacik free_backref_node(cache, lower); 12275d4f98a2SYan Zheng } 12280fd8c3daSLiu Bo 12298e19c973SJosef Bacik remove_backref_node(cache, node); 12305d4f98a2SYan Zheng return ERR_PTR(err); 12315d4f98a2SYan Zheng } 123275bfb9afSJosef Bacik ASSERT(!node || !node->detached); 12335d4f98a2SYan Zheng return node; 12345d4f98a2SYan Zheng } 12355d4f98a2SYan Zheng 12365d4f98a2SYan Zheng /* 12373fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 12383fd0a558SYan, Zheng * the backref node is created by cloning backref node that 12393fd0a558SYan, Zheng * corresponds to root of source tree 12403fd0a558SYan, Zheng */ 12413fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 12423fd0a558SYan, Zheng struct reloc_control *rc, 12433fd0a558SYan, Zheng struct btrfs_root *src, 12443fd0a558SYan, Zheng struct btrfs_root *dest) 12453fd0a558SYan, Zheng { 12463fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 12473fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 12483fd0a558SYan, Zheng struct backref_node *node = NULL; 12493fd0a558SYan, Zheng struct backref_node *new_node; 12503fd0a558SYan, Zheng struct backref_edge *edge; 12513fd0a558SYan, Zheng struct backref_edge *new_edge; 12523fd0a558SYan, Zheng struct rb_node *rb_node; 12533fd0a558SYan, Zheng 12543fd0a558SYan, Zheng if (cache->last_trans > 0) 12553fd0a558SYan, Zheng update_backref_cache(trans, cache); 12563fd0a558SYan, Zheng 12573fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 12583fd0a558SYan, Zheng if (rb_node) { 12593fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 12603fd0a558SYan, Zheng if (node->detached) 12613fd0a558SYan, Zheng node = NULL; 12623fd0a558SYan, Zheng else 12633fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 12643fd0a558SYan, Zheng } 12653fd0a558SYan, Zheng 12663fd0a558SYan, Zheng if (!node) { 12673fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 12683fd0a558SYan, Zheng reloc_root->commit_root->start); 12693fd0a558SYan, Zheng if (rb_node) { 12703fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 12713fd0a558SYan, Zheng rb_node); 12723fd0a558SYan, Zheng BUG_ON(node->detached); 12733fd0a558SYan, Zheng } 12743fd0a558SYan, Zheng } 12753fd0a558SYan, Zheng 12763fd0a558SYan, Zheng if (!node) 12773fd0a558SYan, Zheng return 0; 12783fd0a558SYan, Zheng 12793fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 12803fd0a558SYan, Zheng if (!new_node) 12813fd0a558SYan, Zheng return -ENOMEM; 12823fd0a558SYan, Zheng 12833fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 12843fd0a558SYan, Zheng new_node->level = node->level; 12853fd0a558SYan, Zheng new_node->lowest = node->lowest; 12866848ad64SYan, Zheng new_node->checked = 1; 128700246528SJosef Bacik new_node->root = btrfs_grab_root(dest); 12880b530bc5SJosef Bacik ASSERT(new_node->root); 12893fd0a558SYan, Zheng 12903fd0a558SYan, Zheng if (!node->lowest) { 12913fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 12923fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 12933fd0a558SYan, Zheng if (!new_edge) 12943fd0a558SYan, Zheng goto fail; 12953fd0a558SYan, Zheng 12963fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 12973fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 12983fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 12993fd0a558SYan, Zheng &new_node->lower); 13003fd0a558SYan, Zheng } 130176b9e23dSMiao Xie } else { 130276b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 13033fd0a558SYan, Zheng } 13043fd0a558SYan, Zheng 13053fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 13063fd0a558SYan, Zheng &new_node->rb_node); 130743c04fb1SJeff Mahoney if (rb_node) 130843c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 13093fd0a558SYan, Zheng 13103fd0a558SYan, Zheng if (!new_node->lowest) { 13113fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 13123fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 13133fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 13143fd0a558SYan, Zheng } 13153fd0a558SYan, Zheng } 13163fd0a558SYan, Zheng return 0; 13173fd0a558SYan, Zheng fail: 13183fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 13193fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 13203fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 13213fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 13223fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 13233fd0a558SYan, Zheng } 13243fd0a558SYan, Zheng free_backref_node(cache, new_node); 13253fd0a558SYan, Zheng return -ENOMEM; 13263fd0a558SYan, Zheng } 13273fd0a558SYan, Zheng 13283fd0a558SYan, Zheng /* 13295d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 13305d4f98a2SYan Zheng */ 1331ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 13325d4f98a2SYan Zheng { 13330b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 13345d4f98a2SYan Zheng struct rb_node *rb_node; 13355d4f98a2SYan Zheng struct mapping_node *node; 13360b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 13375d4f98a2SYan Zheng 13385d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1339ffd7b339SJeff Mahoney if (!node) 1340ffd7b339SJeff Mahoney return -ENOMEM; 13415d4f98a2SYan Zheng 1342ea287ab1SJosef Bacik node->bytenr = root->commit_root->start; 13435d4f98a2SYan Zheng node->data = root; 13445d4f98a2SYan Zheng 13455d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13465d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13475d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13485d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1349ffd7b339SJeff Mahoney if (rb_node) { 13500b246afaSJeff Mahoney btrfs_panic(fs_info, -EEXIST, 13515d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 13525d163e0eSJeff Mahoney node->bytenr); 1353ffd7b339SJeff Mahoney } 13545d4f98a2SYan Zheng 13555d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 13565d4f98a2SYan Zheng return 0; 13575d4f98a2SYan Zheng } 13585d4f98a2SYan Zheng 13595d4f98a2SYan Zheng /* 1360c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 13615d4f98a2SYan Zheng * mapping 13625d4f98a2SYan Zheng */ 1363c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 13645d4f98a2SYan Zheng { 13650b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 13665d4f98a2SYan Zheng struct rb_node *rb_node; 13675d4f98a2SYan Zheng struct mapping_node *node = NULL; 13680b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1369f44deb74SJosef Bacik bool put_ref = false; 13705d4f98a2SYan Zheng 137165c6e82bSQu Wenruo if (rc && root->node) { 13725d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13735d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1374ea287ab1SJosef Bacik root->commit_root->start); 1375c974c464SWang Shilong if (rb_node) { 1376c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1377c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1378ea287ab1SJosef Bacik RB_CLEAR_NODE(&node->rb_node); 1379c974c464SWang Shilong } 1380c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1381c974c464SWang Shilong if (!node) 1382c974c464SWang Shilong return; 1383c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1384389305b2SQu Wenruo } 1385c974c464SWang Shilong 1386f44deb74SJosef Bacik /* 1387f44deb74SJosef Bacik * We only put the reloc root here if it's on the list. There's a lot 1388f44deb74SJosef Bacik * of places where the pattern is to splice the rc->reloc_roots, process 1389f44deb74SJosef Bacik * the reloc roots, and then add the reloc root back onto 1390f44deb74SJosef Bacik * rc->reloc_roots. If we call __del_reloc_root while it's off of the 1391f44deb74SJosef Bacik * list we don't want the reference being dropped, because the guy 1392f44deb74SJosef Bacik * messing with the list is in charge of the reference. 1393f44deb74SJosef Bacik */ 13940b246afaSJeff Mahoney spin_lock(&fs_info->trans_lock); 1395f44deb74SJosef Bacik if (!list_empty(&root->root_list)) { 1396f44deb74SJosef Bacik put_ref = true; 1397c974c464SWang Shilong list_del_init(&root->root_list); 1398f44deb74SJosef Bacik } 13990b246afaSJeff Mahoney spin_unlock(&fs_info->trans_lock); 1400f44deb74SJosef Bacik if (put_ref) 1401f44deb74SJosef Bacik btrfs_put_root(root); 1402c974c464SWang Shilong kfree(node); 1403c974c464SWang Shilong } 1404c974c464SWang Shilong 1405c974c464SWang Shilong /* 1406c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1407c974c464SWang Shilong * mapping 1408c974c464SWang Shilong */ 1409ea287ab1SJosef Bacik static int __update_reloc_root(struct btrfs_root *root) 1410c974c464SWang Shilong { 14110b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 1412c974c464SWang Shilong struct rb_node *rb_node; 1413c974c464SWang Shilong struct mapping_node *node = NULL; 14140b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1415c974c464SWang Shilong 1416c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1417c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1418ea287ab1SJosef Bacik root->commit_root->start); 14195d4f98a2SYan Zheng if (rb_node) { 14205d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 14215d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 14225d4f98a2SYan Zheng } 14235d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 14245d4f98a2SYan Zheng 14258f71f3e0SLiu Bo if (!node) 14268f71f3e0SLiu Bo return 0; 14275d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 14285d4f98a2SYan Zheng 14295d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1430ea287ab1SJosef Bacik node->bytenr = root->node->start; 14315d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 14325d4f98a2SYan Zheng node->bytenr, &node->rb_node); 14335d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 143443c04fb1SJeff Mahoney if (rb_node) 143543c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 14365d4f98a2SYan Zheng return 0; 14375d4f98a2SYan Zheng } 14385d4f98a2SYan Zheng 14393fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 14403fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 14415d4f98a2SYan Zheng { 14420b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14435d4f98a2SYan Zheng struct btrfs_root *reloc_root; 14445d4f98a2SYan Zheng struct extent_buffer *eb; 14455d4f98a2SYan Zheng struct btrfs_root_item *root_item; 14465d4f98a2SYan Zheng struct btrfs_key root_key; 14475d4f98a2SYan Zheng int ret; 14485d4f98a2SYan Zheng 14495d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 14505d4f98a2SYan Zheng BUG_ON(!root_item); 14515d4f98a2SYan Zheng 14525d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 14535d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 14543fd0a558SYan, Zheng root_key.offset = objectid; 14555d4f98a2SYan Zheng 14563fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 1457054570a1SFilipe Manana u64 commit_root_gen; 1458054570a1SFilipe Manana 14593fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 14605d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 14615d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 14625d4f98a2SYan Zheng BUG_ON(ret); 1463054570a1SFilipe Manana /* 1464054570a1SFilipe Manana * Set the last_snapshot field to the generation of the commit 1465054570a1SFilipe Manana * root - like this ctree.c:btrfs_block_can_be_shared() behaves 1466054570a1SFilipe Manana * correctly (returns true) when the relocation root is created 1467054570a1SFilipe Manana * either inside the critical section of a transaction commit 1468054570a1SFilipe Manana * (through transaction.c:qgroup_account_snapshot()) and when 1469054570a1SFilipe Manana * it's created before the transaction commit is started. 1470054570a1SFilipe Manana */ 1471054570a1SFilipe Manana commit_root_gen = btrfs_header_generation(root->commit_root); 1472054570a1SFilipe Manana btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); 14733fd0a558SYan, Zheng } else { 14743fd0a558SYan, Zheng /* 14753fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 14763fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 14773fd0a558SYan, Zheng * modified after it was created have RELOC flag 14783fd0a558SYan, Zheng * set in their headers. so it's OK to not update 14793fd0a558SYan, Zheng * the 'last_snapshot'. 14803fd0a558SYan, Zheng */ 14813fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 14823fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 14833fd0a558SYan, Zheng BUG_ON(ret); 14843fd0a558SYan, Zheng } 14853fd0a558SYan, Zheng 14865d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 14875d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 14885d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 14895d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 14903fd0a558SYan, Zheng 14913fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 14923fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 14933fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 14943fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 14955d4f98a2SYan Zheng root_item->drop_level = 0; 14963fd0a558SYan, Zheng } 14975d4f98a2SYan Zheng 14985d4f98a2SYan Zheng btrfs_tree_unlock(eb); 14995d4f98a2SYan Zheng free_extent_buffer(eb); 15005d4f98a2SYan Zheng 15010b246afaSJeff Mahoney ret = btrfs_insert_root(trans, fs_info->tree_root, 15025d4f98a2SYan Zheng &root_key, root_item); 15035d4f98a2SYan Zheng BUG_ON(ret); 15045d4f98a2SYan Zheng kfree(root_item); 15055d4f98a2SYan Zheng 15063dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(fs_info->tree_root, &root_key); 15075d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 15083dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 15095d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 15103fd0a558SYan, Zheng return reloc_root; 15113fd0a558SYan, Zheng } 15123fd0a558SYan, Zheng 15133fd0a558SYan, Zheng /* 15143fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 15153fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 1516f44deb74SJosef Bacik * 1517f44deb74SJosef Bacik * The reloc_root comes out of here with two references, one for 1518f44deb74SJosef Bacik * root->reloc_root, and another for being on the rc->reloc_roots list. 15193fd0a558SYan, Zheng */ 15203fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 15213fd0a558SYan, Zheng struct btrfs_root *root) 15223fd0a558SYan, Zheng { 15230b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 15243fd0a558SYan, Zheng struct btrfs_root *reloc_root; 15250b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 152620dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 15273fd0a558SYan, Zheng int clear_rsv = 0; 1528ffd7b339SJeff Mahoney int ret; 15293fd0a558SYan, Zheng 15302abc726aSJosef Bacik if (!rc || !rc->create_reloc_tree || 15312abc726aSJosef Bacik root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 15322abc726aSJosef Bacik return 0; 15332abc726aSJosef Bacik 15341fac4a54SQu Wenruo /* 15351fac4a54SQu Wenruo * The subvolume has reloc tree but the swap is finished, no need to 15361fac4a54SQu Wenruo * create/update the dead reloc tree 15371fac4a54SQu Wenruo */ 15386282675eSQu Wenruo if (reloc_root_is_dead(root)) 15391fac4a54SQu Wenruo return 0; 15401fac4a54SQu Wenruo 15413fd0a558SYan, Zheng if (root->reloc_root) { 15423fd0a558SYan, Zheng reloc_root = root->reloc_root; 15433fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 15443fd0a558SYan, Zheng return 0; 15453fd0a558SYan, Zheng } 15463fd0a558SYan, Zheng 154720dd2cbfSMiao Xie if (!trans->reloc_reserved) { 154820dd2cbfSMiao Xie rsv = trans->block_rsv; 15493fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 15503fd0a558SYan, Zheng clear_rsv = 1; 15513fd0a558SYan, Zheng } 15523fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 15533fd0a558SYan, Zheng if (clear_rsv) 155420dd2cbfSMiao Xie trans->block_rsv = rsv; 15555d4f98a2SYan Zheng 1556ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1557ffd7b339SJeff Mahoney BUG_ON(ret < 0); 1558f44deb74SJosef Bacik root->reloc_root = btrfs_grab_root(reloc_root); 15595d4f98a2SYan Zheng return 0; 15605d4f98a2SYan Zheng } 15615d4f98a2SYan Zheng 15625d4f98a2SYan Zheng /* 15635d4f98a2SYan Zheng * update root item of reloc tree 15645d4f98a2SYan Zheng */ 15655d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 15665d4f98a2SYan Zheng struct btrfs_root *root) 15675d4f98a2SYan Zheng { 15680b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 15695d4f98a2SYan Zheng struct btrfs_root *reloc_root; 15705d4f98a2SYan Zheng struct btrfs_root_item *root_item; 15715d4f98a2SYan Zheng int ret; 15725d4f98a2SYan Zheng 15736282675eSQu Wenruo if (!have_reloc_root(root)) 15747585717fSChris Mason goto out; 15755d4f98a2SYan Zheng 15765d4f98a2SYan Zheng reloc_root = root->reloc_root; 15775d4f98a2SYan Zheng root_item = &reloc_root->root_item; 15785d4f98a2SYan Zheng 1579f44deb74SJosef Bacik /* 1580f44deb74SJosef Bacik * We are probably ok here, but __del_reloc_root() will drop its ref of 1581f44deb74SJosef Bacik * the root. We have the ref for root->reloc_root, but just in case 1582f44deb74SJosef Bacik * hold it while we update the reloc root. 1583f44deb74SJosef Bacik */ 1584f44deb74SJosef Bacik btrfs_grab_root(reloc_root); 1585f44deb74SJosef Bacik 1586d2311e69SQu Wenruo /* root->reloc_root will stay until current relocation finished */ 15870b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 15883fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 1589d2311e69SQu Wenruo set_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 15906282675eSQu Wenruo /* 15916282675eSQu Wenruo * Mark the tree as dead before we change reloc_root so 15926282675eSQu Wenruo * have_reloc_root will not touch it from now on. 15936282675eSQu Wenruo */ 15946282675eSQu Wenruo smp_wmb(); 1595c974c464SWang Shilong __del_reloc_root(reloc_root); 15965d4f98a2SYan Zheng } 15975d4f98a2SYan Zheng 15985d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 1599ea287ab1SJosef Bacik __update_reloc_root(reloc_root); 16005d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 16015d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 16025d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 16035d4f98a2SYan Zheng } 16045d4f98a2SYan Zheng 16050b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 16065d4f98a2SYan Zheng &reloc_root->root_key, root_item); 16075d4f98a2SYan Zheng BUG_ON(ret); 1608f44deb74SJosef Bacik btrfs_put_root(reloc_root); 16097585717fSChris Mason out: 16105d4f98a2SYan Zheng return 0; 16115d4f98a2SYan Zheng } 16125d4f98a2SYan Zheng 16135d4f98a2SYan Zheng /* 16145d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 16155d4f98a2SYan Zheng * in a subvolume 16165d4f98a2SYan Zheng */ 16175d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 16185d4f98a2SYan Zheng { 16195d4f98a2SYan Zheng struct rb_node *node; 16205d4f98a2SYan Zheng struct rb_node *prev; 16215d4f98a2SYan Zheng struct btrfs_inode *entry; 16225d4f98a2SYan Zheng struct inode *inode; 16235d4f98a2SYan Zheng 16245d4f98a2SYan Zheng spin_lock(&root->inode_lock); 16255d4f98a2SYan Zheng again: 16265d4f98a2SYan Zheng node = root->inode_tree.rb_node; 16275d4f98a2SYan Zheng prev = NULL; 16285d4f98a2SYan Zheng while (node) { 16295d4f98a2SYan Zheng prev = node; 16305d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 16315d4f98a2SYan Zheng 16324a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 16335d4f98a2SYan Zheng node = node->rb_left; 16344a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 16355d4f98a2SYan Zheng node = node->rb_right; 16365d4f98a2SYan Zheng else 16375d4f98a2SYan Zheng break; 16385d4f98a2SYan Zheng } 16395d4f98a2SYan Zheng if (!node) { 16405d4f98a2SYan Zheng while (prev) { 16415d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 16424a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 16435d4f98a2SYan Zheng node = prev; 16445d4f98a2SYan Zheng break; 16455d4f98a2SYan Zheng } 16465d4f98a2SYan Zheng prev = rb_next(prev); 16475d4f98a2SYan Zheng } 16485d4f98a2SYan Zheng } 16495d4f98a2SYan Zheng while (node) { 16505d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 16515d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 16525d4f98a2SYan Zheng if (inode) { 16535d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 16545d4f98a2SYan Zheng return inode; 16555d4f98a2SYan Zheng } 16565d4f98a2SYan Zheng 16574a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 16585d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 16595d4f98a2SYan Zheng goto again; 16605d4f98a2SYan Zheng 16615d4f98a2SYan Zheng node = rb_next(node); 16625d4f98a2SYan Zheng } 16635d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 16645d4f98a2SYan Zheng return NULL; 16655d4f98a2SYan Zheng } 16665d4f98a2SYan Zheng 166732da5386SDavid Sterba static int in_block_group(u64 bytenr, struct btrfs_block_group *block_group) 16685d4f98a2SYan Zheng { 1669b3470b5dSDavid Sterba if (bytenr >= block_group->start && 1670b3470b5dSDavid Sterba bytenr < block_group->start + block_group->length) 16715d4f98a2SYan Zheng return 1; 16725d4f98a2SYan Zheng return 0; 16735d4f98a2SYan Zheng } 16745d4f98a2SYan Zheng 16755d4f98a2SYan Zheng /* 16765d4f98a2SYan Zheng * get new location of data 16775d4f98a2SYan Zheng */ 16785d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 16795d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 16805d4f98a2SYan Zheng { 16815d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 16825d4f98a2SYan Zheng struct btrfs_path *path; 16835d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 16845d4f98a2SYan Zheng struct extent_buffer *leaf; 16855d4f98a2SYan Zheng int ret; 16865d4f98a2SYan Zheng 16875d4f98a2SYan Zheng path = btrfs_alloc_path(); 16885d4f98a2SYan Zheng if (!path) 16895d4f98a2SYan Zheng return -ENOMEM; 16905d4f98a2SYan Zheng 16915d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 1692f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 1693f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 16945d4f98a2SYan Zheng if (ret < 0) 16955d4f98a2SYan Zheng goto out; 16965d4f98a2SYan Zheng if (ret > 0) { 16975d4f98a2SYan Zheng ret = -ENOENT; 16985d4f98a2SYan Zheng goto out; 16995d4f98a2SYan Zheng } 17005d4f98a2SYan Zheng 17015d4f98a2SYan Zheng leaf = path->nodes[0]; 17025d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 17035d4f98a2SYan Zheng struct btrfs_file_extent_item); 17045d4f98a2SYan Zheng 17055d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 17065d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 17075d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 17085d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 17095d4f98a2SYan Zheng 17105d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 171183d4cfd4SJosef Bacik ret = -EINVAL; 17125d4f98a2SYan Zheng goto out; 17135d4f98a2SYan Zheng } 17145d4f98a2SYan Zheng 17155d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 17165d4f98a2SYan Zheng ret = 0; 17175d4f98a2SYan Zheng out: 17185d4f98a2SYan Zheng btrfs_free_path(path); 17195d4f98a2SYan Zheng return ret; 17205d4f98a2SYan Zheng } 17215d4f98a2SYan Zheng 17225d4f98a2SYan Zheng /* 17235d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 17245d4f98a2SYan Zheng * the new locations. 17255d4f98a2SYan Zheng */ 17263fd0a558SYan, Zheng static noinline_for_stack 17273fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 17285d4f98a2SYan Zheng struct reloc_control *rc, 17295d4f98a2SYan Zheng struct btrfs_root *root, 17303fd0a558SYan, Zheng struct extent_buffer *leaf) 17315d4f98a2SYan Zheng { 17320b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 17335d4f98a2SYan Zheng struct btrfs_key key; 17345d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 17355d4f98a2SYan Zheng struct inode *inode = NULL; 17365d4f98a2SYan Zheng u64 parent; 17375d4f98a2SYan Zheng u64 bytenr; 17383fd0a558SYan, Zheng u64 new_bytenr = 0; 17395d4f98a2SYan Zheng u64 num_bytes; 17405d4f98a2SYan Zheng u64 end; 17415d4f98a2SYan Zheng u32 nritems; 17425d4f98a2SYan Zheng u32 i; 174383d4cfd4SJosef Bacik int ret = 0; 17445d4f98a2SYan Zheng int first = 1; 17455d4f98a2SYan Zheng int dirty = 0; 17465d4f98a2SYan Zheng 17475d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 17485d4f98a2SYan Zheng return 0; 17495d4f98a2SYan Zheng 17505d4f98a2SYan Zheng /* reloc trees always use full backref */ 17515d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 17525d4f98a2SYan Zheng parent = leaf->start; 17535d4f98a2SYan Zheng else 17545d4f98a2SYan Zheng parent = 0; 17555d4f98a2SYan Zheng 17565d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 17575d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 175882fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 175982fa113fSQu Wenruo 17605d4f98a2SYan Zheng cond_resched(); 17615d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 17625d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 17635d4f98a2SYan Zheng continue; 17645d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 17655d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 17665d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 17675d4f98a2SYan Zheng continue; 17685d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 17695d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 17705d4f98a2SYan Zheng if (bytenr == 0) 17715d4f98a2SYan Zheng continue; 17725d4f98a2SYan Zheng if (!in_block_group(bytenr, rc->block_group)) 17735d4f98a2SYan Zheng continue; 17745d4f98a2SYan Zheng 17755d4f98a2SYan Zheng /* 17765d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 17775d4f98a2SYan Zheng * to complete and drop the extent cache 17785d4f98a2SYan Zheng */ 17795d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 17805d4f98a2SYan Zheng if (first) { 17815d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 17825d4f98a2SYan Zheng first = 0; 17834a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 17843fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 17855d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 17865d4f98a2SYan Zheng } 17874a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 17885d4f98a2SYan Zheng end = key.offset + 17895d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 17905d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 17910b246afaSJeff Mahoney fs_info->sectorsize)); 17920b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 17935d4f98a2SYan Zheng end--; 17945d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1795d0082371SJeff Mahoney key.offset, end); 17965d4f98a2SYan Zheng if (!ret) 17975d4f98a2SYan Zheng continue; 17985d4f98a2SYan Zheng 1799dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1800dcdbc059SNikolay Borisov key.offset, end, 1); 18015d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1802d0082371SJeff Mahoney key.offset, end); 18035d4f98a2SYan Zheng } 18045d4f98a2SYan Zheng } 18055d4f98a2SYan Zheng 18065d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 18075d4f98a2SYan Zheng bytenr, num_bytes); 180883d4cfd4SJosef Bacik if (ret) { 180983d4cfd4SJosef Bacik /* 181083d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 181183d4cfd4SJosef Bacik * in the file extent yet. 181283d4cfd4SJosef Bacik */ 181383d4cfd4SJosef Bacik break; 18143fd0a558SYan, Zheng } 18155d4f98a2SYan Zheng 18165d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 18175d4f98a2SYan Zheng dirty = 1; 18185d4f98a2SYan Zheng 18195d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 182082fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 182182fa113fSQu Wenruo num_bytes, parent); 182282fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 182382fa113fSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1824b06c4bf5SFilipe Manana key.objectid, key.offset); 182582fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 182683d4cfd4SJosef Bacik if (ret) { 182766642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 182883d4cfd4SJosef Bacik break; 182983d4cfd4SJosef Bacik } 18305d4f98a2SYan Zheng 1831ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, bytenr, 1832ffd4bb2aSQu Wenruo num_bytes, parent); 1833ffd4bb2aSQu Wenruo ref.real_root = root->root_key.objectid; 1834ffd4bb2aSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1835b06c4bf5SFilipe Manana key.objectid, key.offset); 1836ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 183783d4cfd4SJosef Bacik if (ret) { 183866642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 183983d4cfd4SJosef Bacik break; 184083d4cfd4SJosef Bacik } 18415d4f98a2SYan Zheng } 18425d4f98a2SYan Zheng if (dirty) 18435d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 18443fd0a558SYan, Zheng if (inode) 18453fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 184683d4cfd4SJosef Bacik return ret; 18475d4f98a2SYan Zheng } 18485d4f98a2SYan Zheng 18495d4f98a2SYan Zheng static noinline_for_stack 18505d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 18515d4f98a2SYan Zheng struct btrfs_path *path, int level) 18525d4f98a2SYan Zheng { 18535d4f98a2SYan Zheng struct btrfs_disk_key key1; 18545d4f98a2SYan Zheng struct btrfs_disk_key key2; 18555d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 18565d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 18575d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 18585d4f98a2SYan Zheng } 18595d4f98a2SYan Zheng 18605d4f98a2SYan Zheng /* 18615d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 18625d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 18635d4f98a2SYan Zheng * reloc tree was create can be replaced. 18645d4f98a2SYan Zheng * 18655d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 18665d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 18675d4f98a2SYan Zheng * errors, a negative error number is returned. 18685d4f98a2SYan Zheng */ 18693fd0a558SYan, Zheng static noinline_for_stack 18703d0174f7SQu Wenruo int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, 18715d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 18725d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 18735d4f98a2SYan Zheng int lowest_level, int max_level) 18745d4f98a2SYan Zheng { 18750b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 18765d4f98a2SYan Zheng struct extent_buffer *eb; 18775d4f98a2SYan Zheng struct extent_buffer *parent; 187882fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 18795d4f98a2SYan Zheng struct btrfs_key key; 18805d4f98a2SYan Zheng u64 old_bytenr; 18815d4f98a2SYan Zheng u64 new_bytenr; 18825d4f98a2SYan Zheng u64 old_ptr_gen; 18835d4f98a2SYan Zheng u64 new_ptr_gen; 18845d4f98a2SYan Zheng u64 last_snapshot; 18855d4f98a2SYan Zheng u32 blocksize; 18863fd0a558SYan, Zheng int cow = 0; 18875d4f98a2SYan Zheng int level; 18885d4f98a2SYan Zheng int ret; 18895d4f98a2SYan Zheng int slot; 18905d4f98a2SYan Zheng 18915d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 18925d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 18935d4f98a2SYan Zheng 18945d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 18953fd0a558SYan, Zheng again: 18965d4f98a2SYan Zheng slot = path->slots[lowest_level]; 18975d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 18985d4f98a2SYan Zheng 18995d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 19008bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19015d4f98a2SYan Zheng level = btrfs_header_level(eb); 19025d4f98a2SYan Zheng 19035d4f98a2SYan Zheng if (level < lowest_level) { 19045d4f98a2SYan Zheng btrfs_tree_unlock(eb); 19055d4f98a2SYan Zheng free_extent_buffer(eb); 19065d4f98a2SYan Zheng return 0; 19075d4f98a2SYan Zheng } 19085d4f98a2SYan Zheng 19093fd0a558SYan, Zheng if (cow) { 19105d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 19115d4f98a2SYan Zheng BUG_ON(ret); 19123fd0a558SYan, Zheng } 19138bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19145d4f98a2SYan Zheng 19155d4f98a2SYan Zheng if (next_key) { 19165d4f98a2SYan Zheng next_key->objectid = (u64)-1; 19175d4f98a2SYan Zheng next_key->type = (u8)-1; 19185d4f98a2SYan Zheng next_key->offset = (u64)-1; 19195d4f98a2SYan Zheng } 19205d4f98a2SYan Zheng 19215d4f98a2SYan Zheng parent = eb; 19225d4f98a2SYan Zheng while (1) { 1923581c1760SQu Wenruo struct btrfs_key first_key; 1924581c1760SQu Wenruo 19255d4f98a2SYan Zheng level = btrfs_header_level(parent); 19265d4f98a2SYan Zheng BUG_ON(level < lowest_level); 19275d4f98a2SYan Zheng 19285d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 1929cbca7d59SFilipe Manana if (ret < 0) 1930cbca7d59SFilipe Manana break; 19315d4f98a2SYan Zheng if (ret && slot > 0) 19325d4f98a2SYan Zheng slot--; 19335d4f98a2SYan Zheng 19345d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 19355d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 19365d4f98a2SYan Zheng 19375d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 19380b246afaSJeff Mahoney blocksize = fs_info->nodesize; 19395d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 194017515f1bSQu Wenruo btrfs_node_key_to_cpu(parent, &first_key, slot); 19415d4f98a2SYan Zheng 19425d4f98a2SYan Zheng if (level <= max_level) { 19435d4f98a2SYan Zheng eb = path->nodes[level]; 19445d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 19455d4f98a2SYan Zheng path->slots[level]); 19465d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 19475d4f98a2SYan Zheng path->slots[level]); 19485d4f98a2SYan Zheng } else { 19495d4f98a2SYan Zheng new_bytenr = 0; 19505d4f98a2SYan Zheng new_ptr_gen = 0; 19515d4f98a2SYan Zheng } 19525d4f98a2SYan Zheng 1953fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 19545d4f98a2SYan Zheng ret = level; 19555d4f98a2SYan Zheng break; 19565d4f98a2SYan Zheng } 19575d4f98a2SYan Zheng 19585d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 19595d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 19603fd0a558SYan, Zheng if (level <= lowest_level) { 19615d4f98a2SYan Zheng ret = 0; 19625d4f98a2SYan Zheng break; 19635d4f98a2SYan Zheng } 19645d4f98a2SYan Zheng 1965581c1760SQu Wenruo eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen, 1966581c1760SQu Wenruo level - 1, &first_key); 196764c043deSLiu Bo if (IS_ERR(eb)) { 196864c043deSLiu Bo ret = PTR_ERR(eb); 1969264813acSLiu Bo break; 197064c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 197164c043deSLiu Bo ret = -EIO; 1972416bc658SJosef Bacik free_extent_buffer(eb); 1973379cde74SStefan Behrens break; 1974416bc658SJosef Bacik } 19755d4f98a2SYan Zheng btrfs_tree_lock(eb); 19763fd0a558SYan, Zheng if (cow) { 19775d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 19785d4f98a2SYan Zheng slot, &eb); 19795d4f98a2SYan Zheng BUG_ON(ret); 19805d4f98a2SYan Zheng } 19818bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19825d4f98a2SYan Zheng 19835d4f98a2SYan Zheng btrfs_tree_unlock(parent); 19845d4f98a2SYan Zheng free_extent_buffer(parent); 19855d4f98a2SYan Zheng 19865d4f98a2SYan Zheng parent = eb; 19875d4f98a2SYan Zheng continue; 19885d4f98a2SYan Zheng } 19895d4f98a2SYan Zheng 19903fd0a558SYan, Zheng if (!cow) { 19913fd0a558SYan, Zheng btrfs_tree_unlock(parent); 19923fd0a558SYan, Zheng free_extent_buffer(parent); 19933fd0a558SYan, Zheng cow = 1; 19943fd0a558SYan, Zheng goto again; 19953fd0a558SYan, Zheng } 19963fd0a558SYan, Zheng 19975d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 19985d4f98a2SYan Zheng path->slots[level]); 1999b3b4aa74SDavid Sterba btrfs_release_path(path); 20005d4f98a2SYan Zheng 20015d4f98a2SYan Zheng path->lowest_level = level; 20025d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 20035d4f98a2SYan Zheng path->lowest_level = 0; 20045d4f98a2SYan Zheng BUG_ON(ret); 20055d4f98a2SYan Zheng 20065d4f98a2SYan Zheng /* 2007824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 2008824d8dffSQu Wenruo * 2009824d8dffSQu Wenruo * We must trace both trees. 2010824d8dffSQu Wenruo * 1) Tree reloc subtree 2011824d8dffSQu Wenruo * If not traced, we will leak data numbers 2012824d8dffSQu Wenruo * 2) Fs subtree 2013824d8dffSQu Wenruo * If not traced, we will double count old data 2014f616f5cdSQu Wenruo * 2015f616f5cdSQu Wenruo * We don't scan the subtree right now, but only record 2016f616f5cdSQu Wenruo * the swapped tree blocks. 2017f616f5cdSQu Wenruo * The real subtree rescan is delayed until we have new 2018f616f5cdSQu Wenruo * CoW on the subtree root node before transaction commit. 2019824d8dffSQu Wenruo */ 2020370a11b8SQu Wenruo ret = btrfs_qgroup_add_swapped_blocks(trans, dest, 2021370a11b8SQu Wenruo rc->block_group, parent, slot, 2022370a11b8SQu Wenruo path->nodes[level], path->slots[level], 2023370a11b8SQu Wenruo last_snapshot); 2024370a11b8SQu Wenruo if (ret < 0) 2025370a11b8SQu Wenruo break; 2026824d8dffSQu Wenruo /* 20275d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 20285d4f98a2SYan Zheng */ 20295d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 20305d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 20315d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 20325d4f98a2SYan Zheng 20335d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 20345d4f98a2SYan Zheng path->slots[level], old_bytenr); 20355d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 20365d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 20375d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 20385d4f98a2SYan Zheng 203982fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, old_bytenr, 204082fa113fSQu Wenruo blocksize, path->nodes[level]->start); 204182fa113fSQu Wenruo ref.skip_qgroup = true; 204282fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 204382fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 20445d4f98a2SYan Zheng BUG_ON(ret); 204582fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 204682fa113fSQu Wenruo blocksize, 0); 204782fa113fSQu Wenruo ref.skip_qgroup = true; 204882fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 204982fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 20505d4f98a2SYan Zheng BUG_ON(ret); 20515d4f98a2SYan Zheng 2052ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, new_bytenr, 2053ffd4bb2aSQu Wenruo blocksize, path->nodes[level]->start); 2054ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 2055ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2056ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 20575d4f98a2SYan Zheng BUG_ON(ret); 20585d4f98a2SYan Zheng 2059ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, old_bytenr, 2060ffd4bb2aSQu Wenruo blocksize, 0); 2061ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 2062ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2063ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 20645d4f98a2SYan Zheng BUG_ON(ret); 20655d4f98a2SYan Zheng 20665d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 20675d4f98a2SYan Zheng 20685d4f98a2SYan Zheng ret = level; 20695d4f98a2SYan Zheng break; 20705d4f98a2SYan Zheng } 20715d4f98a2SYan Zheng btrfs_tree_unlock(parent); 20725d4f98a2SYan Zheng free_extent_buffer(parent); 20735d4f98a2SYan Zheng return ret; 20745d4f98a2SYan Zheng } 20755d4f98a2SYan Zheng 20765d4f98a2SYan Zheng /* 20775d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 20785d4f98a2SYan Zheng */ 20795d4f98a2SYan Zheng static noinline_for_stack 20805d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 20815d4f98a2SYan Zheng int *level) 20825d4f98a2SYan Zheng { 20835d4f98a2SYan Zheng struct extent_buffer *eb; 20845d4f98a2SYan Zheng int i; 20855d4f98a2SYan Zheng u64 last_snapshot; 20865d4f98a2SYan Zheng u32 nritems; 20875d4f98a2SYan Zheng 20885d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 20895d4f98a2SYan Zheng 20905d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 20915d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 20925d4f98a2SYan Zheng path->nodes[i] = NULL; 20935d4f98a2SYan Zheng } 20945d4f98a2SYan Zheng 20955d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 20965d4f98a2SYan Zheng eb = path->nodes[i]; 20975d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 20985d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 20995d4f98a2SYan Zheng path->slots[i]++; 21005d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 21015d4f98a2SYan Zheng last_snapshot) 21025d4f98a2SYan Zheng continue; 21035d4f98a2SYan Zheng 21045d4f98a2SYan Zheng *level = i; 21055d4f98a2SYan Zheng return 0; 21065d4f98a2SYan Zheng } 21075d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 21085d4f98a2SYan Zheng path->nodes[i] = NULL; 21095d4f98a2SYan Zheng } 21105d4f98a2SYan Zheng return 1; 21115d4f98a2SYan Zheng } 21125d4f98a2SYan Zheng 21135d4f98a2SYan Zheng /* 21145d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 21155d4f98a2SYan Zheng */ 21165d4f98a2SYan Zheng static noinline_for_stack 21175d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 21185d4f98a2SYan Zheng int *level) 21195d4f98a2SYan Zheng { 21202ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 21215d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 21225d4f98a2SYan Zheng int i; 21235d4f98a2SYan Zheng u64 bytenr; 21245d4f98a2SYan Zheng u64 ptr_gen = 0; 21255d4f98a2SYan Zheng u64 last_snapshot; 21265d4f98a2SYan Zheng u32 nritems; 21275d4f98a2SYan Zheng 21285d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 21295d4f98a2SYan Zheng 21305d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 2131581c1760SQu Wenruo struct btrfs_key first_key; 2132581c1760SQu Wenruo 21335d4f98a2SYan Zheng eb = path->nodes[i]; 21345d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 21355d4f98a2SYan Zheng while (path->slots[i] < nritems) { 21365d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 21375d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 21385d4f98a2SYan Zheng break; 21395d4f98a2SYan Zheng path->slots[i]++; 21405d4f98a2SYan Zheng } 21415d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 21425d4f98a2SYan Zheng if (i == *level) 21435d4f98a2SYan Zheng break; 21445d4f98a2SYan Zheng *level = i + 1; 21455d4f98a2SYan Zheng return 0; 21465d4f98a2SYan Zheng } 21475d4f98a2SYan Zheng if (i == 1) { 21485d4f98a2SYan Zheng *level = i; 21495d4f98a2SYan Zheng return 0; 21505d4f98a2SYan Zheng } 21515d4f98a2SYan Zheng 21525d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2153581c1760SQu Wenruo btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); 2154581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1, 2155581c1760SQu Wenruo &first_key); 215664c043deSLiu Bo if (IS_ERR(eb)) { 215764c043deSLiu Bo return PTR_ERR(eb); 215864c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2159416bc658SJosef Bacik free_extent_buffer(eb); 2160416bc658SJosef Bacik return -EIO; 2161416bc658SJosef Bacik } 21625d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 21635d4f98a2SYan Zheng path->nodes[i - 1] = eb; 21645d4f98a2SYan Zheng path->slots[i - 1] = 0; 21655d4f98a2SYan Zheng } 21665d4f98a2SYan Zheng return 1; 21675d4f98a2SYan Zheng } 21685d4f98a2SYan Zheng 21695d4f98a2SYan Zheng /* 21705d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 21715d4f98a2SYan Zheng * [min_key, max_key) 21725d4f98a2SYan Zheng */ 21735d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 21745d4f98a2SYan Zheng struct btrfs_key *min_key, 21755d4f98a2SYan Zheng struct btrfs_key *max_key) 21765d4f98a2SYan Zheng { 21770b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 21785d4f98a2SYan Zheng struct inode *inode = NULL; 21795d4f98a2SYan Zheng u64 objectid; 21805d4f98a2SYan Zheng u64 start, end; 218133345d01SLi Zefan u64 ino; 21825d4f98a2SYan Zheng 21835d4f98a2SYan Zheng objectid = min_key->objectid; 21845d4f98a2SYan Zheng while (1) { 21855d4f98a2SYan Zheng cond_resched(); 21865d4f98a2SYan Zheng iput(inode); 21875d4f98a2SYan Zheng 21885d4f98a2SYan Zheng if (objectid > max_key->objectid) 21895d4f98a2SYan Zheng break; 21905d4f98a2SYan Zheng 21915d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 21925d4f98a2SYan Zheng if (!inode) 21935d4f98a2SYan Zheng break; 21944a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 21955d4f98a2SYan Zheng 219633345d01SLi Zefan if (ino > max_key->objectid) { 21975d4f98a2SYan Zheng iput(inode); 21985d4f98a2SYan Zheng break; 21995d4f98a2SYan Zheng } 22005d4f98a2SYan Zheng 220133345d01SLi Zefan objectid = ino + 1; 22025d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 22035d4f98a2SYan Zheng continue; 22045d4f98a2SYan Zheng 220533345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 22065d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 22075d4f98a2SYan Zheng continue; 22085d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 22095d4f98a2SYan Zheng start = 0; 22105d4f98a2SYan Zheng else { 22115d4f98a2SYan Zheng start = min_key->offset; 22120b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 22135d4f98a2SYan Zheng } 22145d4f98a2SYan Zheng } else { 22155d4f98a2SYan Zheng start = 0; 22165d4f98a2SYan Zheng } 22175d4f98a2SYan Zheng 221833345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 22195d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 22205d4f98a2SYan Zheng continue; 22215d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 22225d4f98a2SYan Zheng end = (u64)-1; 22235d4f98a2SYan Zheng } else { 22245d4f98a2SYan Zheng if (max_key->offset == 0) 22255d4f98a2SYan Zheng continue; 22265d4f98a2SYan Zheng end = max_key->offset; 22270b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 22285d4f98a2SYan Zheng end--; 22295d4f98a2SYan Zheng } 22305d4f98a2SYan Zheng } else { 22315d4f98a2SYan Zheng end = (u64)-1; 22325d4f98a2SYan Zheng } 22335d4f98a2SYan Zheng 22345d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2235d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 2236dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 2237d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 22385d4f98a2SYan Zheng } 22395d4f98a2SYan Zheng return 0; 22405d4f98a2SYan Zheng } 22415d4f98a2SYan Zheng 22425d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 22435d4f98a2SYan Zheng struct btrfs_key *key) 22445d4f98a2SYan Zheng 22455d4f98a2SYan Zheng { 22465d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 22475d4f98a2SYan Zheng if (!path->nodes[level]) 22485d4f98a2SYan Zheng break; 22495d4f98a2SYan Zheng if (path->slots[level] + 1 < 22505d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 22515d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 22525d4f98a2SYan Zheng path->slots[level] + 1); 22535d4f98a2SYan Zheng return 0; 22545d4f98a2SYan Zheng } 22555d4f98a2SYan Zheng level++; 22565d4f98a2SYan Zheng } 22575d4f98a2SYan Zheng return 1; 22585d4f98a2SYan Zheng } 22595d4f98a2SYan Zheng 22605d4f98a2SYan Zheng /* 2261d2311e69SQu Wenruo * Insert current subvolume into reloc_control::dirty_subvol_roots 2262d2311e69SQu Wenruo */ 2263d2311e69SQu Wenruo static void insert_dirty_subvol(struct btrfs_trans_handle *trans, 2264d2311e69SQu Wenruo struct reloc_control *rc, 2265d2311e69SQu Wenruo struct btrfs_root *root) 2266d2311e69SQu Wenruo { 2267d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2268d2311e69SQu Wenruo struct btrfs_root_item *reloc_root_item; 2269d2311e69SQu Wenruo 2270d2311e69SQu Wenruo /* @root must be a subvolume tree root with a valid reloc tree */ 2271d2311e69SQu Wenruo ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 2272d2311e69SQu Wenruo ASSERT(reloc_root); 2273d2311e69SQu Wenruo 2274d2311e69SQu Wenruo reloc_root_item = &reloc_root->root_item; 2275d2311e69SQu Wenruo memset(&reloc_root_item->drop_progress, 0, 2276d2311e69SQu Wenruo sizeof(reloc_root_item->drop_progress)); 2277d2311e69SQu Wenruo reloc_root_item->drop_level = 0; 2278d2311e69SQu Wenruo btrfs_set_root_refs(reloc_root_item, 0); 2279d2311e69SQu Wenruo btrfs_update_reloc_root(trans, root); 2280d2311e69SQu Wenruo 2281d2311e69SQu Wenruo if (list_empty(&root->reloc_dirty_list)) { 228200246528SJosef Bacik btrfs_grab_root(root); 2283d2311e69SQu Wenruo list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); 2284d2311e69SQu Wenruo } 2285d2311e69SQu Wenruo } 2286d2311e69SQu Wenruo 2287d2311e69SQu Wenruo static int clean_dirty_subvols(struct reloc_control *rc) 2288d2311e69SQu Wenruo { 2289d2311e69SQu Wenruo struct btrfs_root *root; 2290d2311e69SQu Wenruo struct btrfs_root *next; 2291d2311e69SQu Wenruo int ret = 0; 229230d40577SQu Wenruo int ret2; 2293d2311e69SQu Wenruo 2294d2311e69SQu Wenruo list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, 2295d2311e69SQu Wenruo reloc_dirty_list) { 229630d40577SQu Wenruo if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 229730d40577SQu Wenruo /* Merged subvolume, cleanup its reloc root */ 2298d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2299d2311e69SQu Wenruo 2300d2311e69SQu Wenruo list_del_init(&root->reloc_dirty_list); 2301d2311e69SQu Wenruo root->reloc_root = NULL; 23026282675eSQu Wenruo /* 23036282675eSQu Wenruo * Need barrier to ensure clear_bit() only happens after 23046282675eSQu Wenruo * root->reloc_root = NULL. Pairs with have_reloc_root. 23056282675eSQu Wenruo */ 23066282675eSQu Wenruo smp_wmb(); 23071fac4a54SQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 2308f28de8d8SJosef Bacik if (reloc_root) { 2309f44deb74SJosef Bacik /* 2310f44deb74SJosef Bacik * btrfs_drop_snapshot drops our ref we hold for 2311f44deb74SJosef Bacik * ->reloc_root. If it fails however we must 2312f44deb74SJosef Bacik * drop the ref ourselves. 2313f44deb74SJosef Bacik */ 2314f28de8d8SJosef Bacik ret2 = btrfs_drop_snapshot(reloc_root, 0, 1); 2315f44deb74SJosef Bacik if (ret2 < 0) { 2316f44deb74SJosef Bacik btrfs_put_root(reloc_root); 2317f44deb74SJosef Bacik if (!ret) 2318f28de8d8SJosef Bacik ret = ret2; 2319f28de8d8SJosef Bacik } 2320f44deb74SJosef Bacik } 232100246528SJosef Bacik btrfs_put_root(root); 232230d40577SQu Wenruo } else { 232330d40577SQu Wenruo /* Orphan reloc tree, just clean it up */ 23240078a9f9SNikolay Borisov ret2 = btrfs_drop_snapshot(root, 0, 1); 2325f44deb74SJosef Bacik if (ret2 < 0) { 2326f44deb74SJosef Bacik btrfs_put_root(root); 2327f44deb74SJosef Bacik if (!ret) 232830d40577SQu Wenruo ret = ret2; 232930d40577SQu Wenruo } 2330d2311e69SQu Wenruo } 2331f44deb74SJosef Bacik } 2332d2311e69SQu Wenruo return ret; 2333d2311e69SQu Wenruo } 2334d2311e69SQu Wenruo 2335d2311e69SQu Wenruo /* 23365d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 23375d4f98a2SYan Zheng * fs tree. 23385d4f98a2SYan Zheng */ 23395d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 23405d4f98a2SYan Zheng struct btrfs_root *root) 23415d4f98a2SYan Zheng { 23420b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 23435d4f98a2SYan Zheng struct btrfs_key key; 23445d4f98a2SYan Zheng struct btrfs_key next_key; 23459e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 23465d4f98a2SYan Zheng struct btrfs_root *reloc_root; 23475d4f98a2SYan Zheng struct btrfs_root_item *root_item; 23485d4f98a2SYan Zheng struct btrfs_path *path; 23493fd0a558SYan, Zheng struct extent_buffer *leaf; 23505d4f98a2SYan Zheng int level; 23515d4f98a2SYan Zheng int max_level; 23525d4f98a2SYan Zheng int replaced = 0; 23535d4f98a2SYan Zheng int ret; 23545d4f98a2SYan Zheng int err = 0; 23553fd0a558SYan, Zheng u32 min_reserved; 23565d4f98a2SYan Zheng 23575d4f98a2SYan Zheng path = btrfs_alloc_path(); 23585d4f98a2SYan Zheng if (!path) 23595d4f98a2SYan Zheng return -ENOMEM; 2360e4058b54SDavid Sterba path->reada = READA_FORWARD; 23615d4f98a2SYan Zheng 23625d4f98a2SYan Zheng reloc_root = root->reloc_root; 23635d4f98a2SYan Zheng root_item = &reloc_root->root_item; 23645d4f98a2SYan Zheng 23655d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 23665d4f98a2SYan Zheng level = btrfs_root_level(root_item); 236767439dadSDavid Sterba atomic_inc(&reloc_root->node->refs); 23685d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 23695d4f98a2SYan Zheng path->slots[level] = 0; 23705d4f98a2SYan Zheng } else { 23715d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 23725d4f98a2SYan Zheng 23735d4f98a2SYan Zheng level = root_item->drop_level; 23745d4f98a2SYan Zheng BUG_ON(level == 0); 23755d4f98a2SYan Zheng path->lowest_level = level; 23765d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 237733c66f43SYan Zheng path->lowest_level = 0; 23785d4f98a2SYan Zheng if (ret < 0) { 23795d4f98a2SYan Zheng btrfs_free_path(path); 23805d4f98a2SYan Zheng return ret; 23815d4f98a2SYan Zheng } 23825d4f98a2SYan Zheng 23835d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 23845d4f98a2SYan Zheng path->slots[level]); 23855d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 23865d4f98a2SYan Zheng 23875d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 23885d4f98a2SYan Zheng } 23895d4f98a2SYan Zheng 23900b246afaSJeff Mahoney min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 23915d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 23925d4f98a2SYan Zheng 23935d4f98a2SYan Zheng while (1) { 239408e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 239508e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 23963fd0a558SYan, Zheng if (ret) { 23979e6a0c52SJosef Bacik err = ret; 23989e6a0c52SJosef Bacik goto out; 23993fd0a558SYan, Zheng } 24009e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 24019e6a0c52SJosef Bacik if (IS_ERR(trans)) { 24029e6a0c52SJosef Bacik err = PTR_ERR(trans); 24039e6a0c52SJosef Bacik trans = NULL; 24049e6a0c52SJosef Bacik goto out; 24059e6a0c52SJosef Bacik } 24062abc726aSJosef Bacik 24072abc726aSJosef Bacik /* 24082abc726aSJosef Bacik * At this point we no longer have a reloc_control, so we can't 24092abc726aSJosef Bacik * depend on btrfs_init_reloc_root to update our last_trans. 24102abc726aSJosef Bacik * 24112abc726aSJosef Bacik * But that's ok, we started the trans handle on our 24122abc726aSJosef Bacik * corresponding fs_root, which means it's been added to the 24132abc726aSJosef Bacik * dirty list. At commit time we'll still call 24142abc726aSJosef Bacik * btrfs_update_reloc_root() and update our root item 24152abc726aSJosef Bacik * appropriately. 24162abc726aSJosef Bacik */ 24172abc726aSJosef Bacik reloc_root->last_trans = trans->transid; 24189e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 24193fd0a558SYan, Zheng 24203fd0a558SYan, Zheng replaced = 0; 24215d4f98a2SYan Zheng max_level = level; 24225d4f98a2SYan Zheng 24235d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 24245d4f98a2SYan Zheng if (ret < 0) { 24255d4f98a2SYan Zheng err = ret; 24265d4f98a2SYan Zheng goto out; 24275d4f98a2SYan Zheng } 24285d4f98a2SYan Zheng if (ret > 0) 24295d4f98a2SYan Zheng break; 24305d4f98a2SYan Zheng 24315d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 24325d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 24335d4f98a2SYan Zheng ret = 0; 24345d4f98a2SYan Zheng } else { 24353d0174f7SQu Wenruo ret = replace_path(trans, rc, root, reloc_root, path, 24363fd0a558SYan, Zheng &next_key, level, max_level); 24375d4f98a2SYan Zheng } 24385d4f98a2SYan Zheng if (ret < 0) { 24395d4f98a2SYan Zheng err = ret; 24405d4f98a2SYan Zheng goto out; 24415d4f98a2SYan Zheng } 24425d4f98a2SYan Zheng 24435d4f98a2SYan Zheng if (ret > 0) { 24445d4f98a2SYan Zheng level = ret; 24455d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 24465d4f98a2SYan Zheng path->slots[level]); 24475d4f98a2SYan Zheng replaced = 1; 24485d4f98a2SYan Zheng } 24495d4f98a2SYan Zheng 24505d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 24515d4f98a2SYan Zheng if (ret > 0) 24525d4f98a2SYan Zheng break; 24535d4f98a2SYan Zheng 24545d4f98a2SYan Zheng BUG_ON(level == 0); 24555d4f98a2SYan Zheng /* 24565d4f98a2SYan Zheng * save the merging progress in the drop_progress. 24575d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 24585d4f98a2SYan Zheng */ 24595d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 24605d4f98a2SYan Zheng path->slots[level]); 24615d4f98a2SYan Zheng root_item->drop_level = level; 24625d4f98a2SYan Zheng 24633a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 24649e6a0c52SJosef Bacik trans = NULL; 24655d4f98a2SYan Zheng 24662ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 24675d4f98a2SYan Zheng 24685d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 24695d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 24705d4f98a2SYan Zheng } 24715d4f98a2SYan Zheng 24725d4f98a2SYan Zheng /* 24735d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 24745d4f98a2SYan Zheng * relocated and the block is tree root. 24755d4f98a2SYan Zheng */ 24765d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 24775d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 24785d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 24795d4f98a2SYan Zheng free_extent_buffer(leaf); 24805d4f98a2SYan Zheng if (ret < 0) 24815d4f98a2SYan Zheng err = ret; 24825d4f98a2SYan Zheng out: 24835d4f98a2SYan Zheng btrfs_free_path(path); 24845d4f98a2SYan Zheng 2485d2311e69SQu Wenruo if (err == 0) 2486d2311e69SQu Wenruo insert_dirty_subvol(trans, rc, root); 24875d4f98a2SYan Zheng 24889e6a0c52SJosef Bacik if (trans) 24893a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 24905d4f98a2SYan Zheng 24912ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 24925d4f98a2SYan Zheng 24935d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 24945d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 24955d4f98a2SYan Zheng 24965d4f98a2SYan Zheng return err; 24975d4f98a2SYan Zheng } 24985d4f98a2SYan Zheng 24993fd0a558SYan, Zheng static noinline_for_stack 25003fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 25015d4f98a2SYan Zheng { 25023fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 25030b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 25043fd0a558SYan, Zheng struct btrfs_root *reloc_root; 25055d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 25063fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 25073fd0a558SYan, Zheng u64 num_bytes = 0; 25083fd0a558SYan, Zheng int ret; 25093fd0a558SYan, Zheng 25100b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 25110b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 25123fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 25130b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 25147585717fSChris Mason 25153fd0a558SYan, Zheng again: 25163fd0a558SYan, Zheng if (!err) { 25173fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 251808e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 251908e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 25203fd0a558SYan, Zheng if (ret) 25213fd0a558SYan, Zheng err = ret; 25223fd0a558SYan, Zheng } 25233fd0a558SYan, Zheng 25247a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 25253612b495STsutomu Itoh if (IS_ERR(trans)) { 25263612b495STsutomu Itoh if (!err) 25272ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 252863f018beSNikolay Borisov num_bytes, NULL); 25293612b495STsutomu Itoh return PTR_ERR(trans); 25303612b495STsutomu Itoh } 25313fd0a558SYan, Zheng 25323fd0a558SYan, Zheng if (!err) { 25333fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 25343a45bb20SJeff Mahoney btrfs_end_transaction(trans); 25352ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 253663f018beSNikolay Borisov num_bytes, NULL); 25373fd0a558SYan, Zheng goto again; 25383fd0a558SYan, Zheng } 25393fd0a558SYan, Zheng } 25403fd0a558SYan, Zheng 25413fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 25423fd0a558SYan, Zheng 25433fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 25443fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 25453fd0a558SYan, Zheng struct btrfs_root, root_list); 25463fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 25473fd0a558SYan, Zheng 25480b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 25493fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 25503fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 25513fd0a558SYan, Zheng 25523fd0a558SYan, Zheng /* 25533fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 25543fd0a558SYan, Zheng * knows it should resumes merging 25553fd0a558SYan, Zheng */ 25563fd0a558SYan, Zheng if (!err) 25573fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 25583fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 25593fd0a558SYan, Zheng 25603fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 256100246528SJosef Bacik btrfs_put_root(root); 25623fd0a558SYan, Zheng } 25633fd0a558SYan, Zheng 25643fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 25653fd0a558SYan, Zheng 25663fd0a558SYan, Zheng if (!err) 25673a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 25683fd0a558SYan, Zheng else 25693a45bb20SJeff Mahoney btrfs_end_transaction(trans); 25703fd0a558SYan, Zheng return err; 25713fd0a558SYan, Zheng } 25723fd0a558SYan, Zheng 25733fd0a558SYan, Zheng static noinline_for_stack 2574aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2575aca1bba6SLiu Bo { 2576aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2577aca1bba6SLiu Bo 2578aca1bba6SLiu Bo while (!list_empty(list)) { 2579aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2580aca1bba6SLiu Bo root_list); 2581bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 2582aca1bba6SLiu Bo } 2583aca1bba6SLiu Bo } 2584aca1bba6SLiu Bo 2585aca1bba6SLiu Bo static noinline_for_stack 258694404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 25873fd0a558SYan, Zheng { 25880b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 25895d4f98a2SYan Zheng struct btrfs_root *root; 25905d4f98a2SYan Zheng struct btrfs_root *reloc_root; 25913fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 25923fd0a558SYan, Zheng int found = 0; 2593aca1bba6SLiu Bo int ret = 0; 25943fd0a558SYan, Zheng again: 25953fd0a558SYan, Zheng root = rc->extent_root; 25967585717fSChris Mason 25977585717fSChris Mason /* 25987585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 25997585717fSChris Mason * we have to make sure nobody is in the middle of 26007585717fSChris Mason * adding their roots to the list while we are 26017585717fSChris Mason * doing this splice 26027585717fSChris Mason */ 26030b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 26043fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 26050b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 26065d4f98a2SYan Zheng 26073fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 26083fd0a558SYan, Zheng found = 1; 26093fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 26103fd0a558SYan, Zheng struct btrfs_root, root_list); 26115d4f98a2SYan Zheng 26125d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 26130b246afaSJeff Mahoney root = read_fs_root(fs_info, 26145d4f98a2SYan Zheng reloc_root->root_key.offset); 26155d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 26165d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 26175d4f98a2SYan Zheng 26183fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 261900246528SJosef Bacik btrfs_put_root(root); 2620b37b39cdSJosef Bacik if (ret) { 262125e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 262225e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 262325e293c2SWang Shilong &reloc_roots); 2624aca1bba6SLiu Bo goto out; 2625b37b39cdSJosef Bacik } 26263fd0a558SYan, Zheng } else { 26273fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 262830d40577SQu Wenruo /* Don't forget to queue this reloc root for cleanup */ 262930d40577SQu Wenruo list_add_tail(&reloc_root->reloc_dirty_list, 263030d40577SQu Wenruo &rc->dirty_subvol_roots); 26313fd0a558SYan, Zheng } 26325d4f98a2SYan Zheng } 26335d4f98a2SYan Zheng 26343fd0a558SYan, Zheng if (found) { 26353fd0a558SYan, Zheng found = 0; 26363fd0a558SYan, Zheng goto again; 26375d4f98a2SYan Zheng } 2638aca1bba6SLiu Bo out: 2639aca1bba6SLiu Bo if (ret) { 26400b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2641aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2642aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2643467bb1d2SWang Shilong 2644467bb1d2SWang Shilong /* new reloc root may be added */ 26450b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2646467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 26470b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2648467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2649467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2650aca1bba6SLiu Bo } 2651aca1bba6SLiu Bo 26527b7b7431SJosef Bacik /* 26537b7b7431SJosef Bacik * We used to have 26547b7b7431SJosef Bacik * 26557b7b7431SJosef Bacik * BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 26567b7b7431SJosef Bacik * 26577b7b7431SJosef Bacik * here, but it's wrong. If we fail to start the transaction in 26587b7b7431SJosef Bacik * prepare_to_merge() we will have only 0 ref reloc roots, none of which 26597b7b7431SJosef Bacik * have actually been removed from the reloc_root_tree rb tree. This is 26607b7b7431SJosef Bacik * fine because we're bailing here, and we hold a reference on the root 26617b7b7431SJosef Bacik * for the list that holds it, so these roots will be cleaned up when we 26627b7b7431SJosef Bacik * do the reloc_dirty_list afterwards. Meanwhile the root->reloc_root 26637b7b7431SJosef Bacik * will be cleaned up on unmount. 26647b7b7431SJosef Bacik * 26657b7b7431SJosef Bacik * The remaining nodes will be cleaned up by free_reloc_control. 26667b7b7431SJosef Bacik */ 26675d4f98a2SYan Zheng } 26685d4f98a2SYan Zheng 26695d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 26705d4f98a2SYan Zheng { 26715d4f98a2SYan Zheng struct tree_block *block; 26725d4f98a2SYan Zheng struct rb_node *rb_node; 26735d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 26745d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 26755d4f98a2SYan Zheng rb_erase(rb_node, blocks); 26765d4f98a2SYan Zheng kfree(block); 26775d4f98a2SYan Zheng } 26785d4f98a2SYan Zheng } 26795d4f98a2SYan Zheng 26805d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 26815d4f98a2SYan Zheng struct btrfs_root *reloc_root) 26825d4f98a2SYan Zheng { 26830b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 26845d4f98a2SYan Zheng struct btrfs_root *root; 2685442b1ac5SJosef Bacik int ret; 26865d4f98a2SYan Zheng 26875d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 26885d4f98a2SYan Zheng return 0; 26895d4f98a2SYan Zheng 26900b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 26915d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 26925d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 2693442b1ac5SJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 269400246528SJosef Bacik btrfs_put_root(root); 26955d4f98a2SYan Zheng 2696442b1ac5SJosef Bacik return ret; 26975d4f98a2SYan Zheng } 26985d4f98a2SYan Zheng 26993fd0a558SYan, Zheng static noinline_for_stack 27003fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 27013fd0a558SYan, Zheng struct reloc_control *rc, 27025d4f98a2SYan Zheng struct backref_node *node, 2703dc4103f9SWang Shilong struct backref_edge *edges[]) 27045d4f98a2SYan Zheng { 27055d4f98a2SYan Zheng struct backref_node *next; 27065d4f98a2SYan Zheng struct btrfs_root *root; 27073fd0a558SYan, Zheng int index = 0; 27083fd0a558SYan, Zheng 27095d4f98a2SYan Zheng next = node; 27105d4f98a2SYan Zheng while (1) { 27115d4f98a2SYan Zheng cond_resched(); 27125d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 27135d4f98a2SYan Zheng root = next->root; 27143fd0a558SYan, Zheng BUG_ON(!root); 271527cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 27165d4f98a2SYan Zheng 27175d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 27185d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 27195d4f98a2SYan Zheng break; 27205d4f98a2SYan Zheng } 27215d4f98a2SYan Zheng 27225d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 27233fd0a558SYan, Zheng root = root->reloc_root; 27243fd0a558SYan, Zheng 27253fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 27263fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 27273fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 27283fd0a558SYan, Zheng next->new_bytenr = root->node->start; 272900246528SJosef Bacik btrfs_put_root(next->root); 273000246528SJosef Bacik next->root = btrfs_grab_root(root); 27310b530bc5SJosef Bacik ASSERT(next->root); 27323fd0a558SYan, Zheng list_add_tail(&next->list, 27333fd0a558SYan, Zheng &rc->backref_cache.changed); 27343fd0a558SYan, Zheng __mark_block_processed(rc, next); 27355d4f98a2SYan Zheng break; 27365d4f98a2SYan Zheng } 27375d4f98a2SYan Zheng 27383fd0a558SYan, Zheng WARN_ON(1); 27395d4f98a2SYan Zheng root = NULL; 27405d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 27415d4f98a2SYan Zheng if (!next || next->level <= node->level) 27425d4f98a2SYan Zheng break; 27435d4f98a2SYan Zheng } 27443fd0a558SYan, Zheng if (!root) 27453fd0a558SYan, Zheng return NULL; 27465d4f98a2SYan Zheng 27473fd0a558SYan, Zheng next = node; 27483fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 27493fd0a558SYan, Zheng while (1) { 27503fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 27513fd0a558SYan, Zheng if (--index < 0) 27523fd0a558SYan, Zheng break; 27533fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 27543fd0a558SYan, Zheng } 27555d4f98a2SYan Zheng return root; 27565d4f98a2SYan Zheng } 27575d4f98a2SYan Zheng 27583fd0a558SYan, Zheng /* 27593fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 27603fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 27613fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 27623fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 27633fd0a558SYan, Zheng */ 27645d4f98a2SYan Zheng static noinline_for_stack 2765147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 27665d4f98a2SYan Zheng { 27673fd0a558SYan, Zheng struct backref_node *next; 27683fd0a558SYan, Zheng struct btrfs_root *root; 27693fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 27705d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 27713fd0a558SYan, Zheng int index = 0; 27723fd0a558SYan, Zheng 27733fd0a558SYan, Zheng next = node; 27743fd0a558SYan, Zheng while (1) { 27753fd0a558SYan, Zheng cond_resched(); 27763fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 27773fd0a558SYan, Zheng root = next->root; 27783fd0a558SYan, Zheng BUG_ON(!root); 27793fd0a558SYan, Zheng 278025985edcSLucas De Marchi /* no other choice for non-references counted tree */ 278127cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 27823fd0a558SYan, Zheng return root; 27833fd0a558SYan, Zheng 27843fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 27853fd0a558SYan, Zheng fs_root = root; 27863fd0a558SYan, Zheng 27873fd0a558SYan, Zheng if (next != node) 27883fd0a558SYan, Zheng return NULL; 27893fd0a558SYan, Zheng 27903fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 27913fd0a558SYan, Zheng if (!next || next->level <= node->level) 27923fd0a558SYan, Zheng break; 27933fd0a558SYan, Zheng } 27943fd0a558SYan, Zheng 27953fd0a558SYan, Zheng if (!fs_root) 27963fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 27973fd0a558SYan, Zheng return fs_root; 27985d4f98a2SYan Zheng } 27995d4f98a2SYan Zheng 28005d4f98a2SYan Zheng static noinline_for_stack 28013fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 28023fd0a558SYan, Zheng struct backref_node *node, int reserve) 28035d4f98a2SYan Zheng { 28040b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 28053fd0a558SYan, Zheng struct backref_node *next = node; 28063fd0a558SYan, Zheng struct backref_edge *edge; 28073fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28083fd0a558SYan, Zheng u64 num_bytes = 0; 28093fd0a558SYan, Zheng int index = 0; 28105d4f98a2SYan Zheng 28113fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 28123fd0a558SYan, Zheng 28133fd0a558SYan, Zheng while (next) { 28143fd0a558SYan, Zheng cond_resched(); 28155d4f98a2SYan Zheng while (1) { 28163fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 28175d4f98a2SYan Zheng break; 28185d4f98a2SYan Zheng 28190b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 28203fd0a558SYan, Zheng 28213fd0a558SYan, Zheng if (list_empty(&next->upper)) 28223fd0a558SYan, Zheng break; 28233fd0a558SYan, Zheng 28243fd0a558SYan, Zheng edge = list_entry(next->upper.next, 28253fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 28263fd0a558SYan, Zheng edges[index++] = edge; 28273fd0a558SYan, Zheng next = edge->node[UPPER]; 28285d4f98a2SYan Zheng } 28293fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 28303fd0a558SYan, Zheng } 28313fd0a558SYan, Zheng return num_bytes; 28323fd0a558SYan, Zheng } 28333fd0a558SYan, Zheng 28343fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 28353fd0a558SYan, Zheng struct reloc_control *rc, 28363fd0a558SYan, Zheng struct backref_node *node) 28373fd0a558SYan, Zheng { 28383fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2839da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 28403fd0a558SYan, Zheng u64 num_bytes; 28413fd0a558SYan, Zheng int ret; 28420647bf56SWang Shilong u64 tmp; 28433fd0a558SYan, Zheng 28443fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 28453fd0a558SYan, Zheng 28463fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 28470647bf56SWang Shilong rc->reserved_bytes += num_bytes; 28488ca17f0fSJosef Bacik 28498ca17f0fSJosef Bacik /* 28508ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 28518ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 28528ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 28538ca17f0fSJosef Bacik */ 28540647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 28558ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 28563fd0a558SYan, Zheng if (ret) { 2857da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 28580647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 28590647bf56SWang Shilong tmp <<= 1; 28600647bf56SWang Shilong /* 28610647bf56SWang Shilong * only one thread can access block_rsv at this point, 28620647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 28630647bf56SWang Shilong * we expand more reservation size here to allow enough 286452042d8eSAndrea Gelmini * space for relocation and we will return earlier in 28650647bf56SWang Shilong * enospc case. 28660647bf56SWang Shilong */ 2867da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 28680647bf56SWang Shilong RELOCATION_RESERVED_NODES; 28698ca17f0fSJosef Bacik return -EAGAIN; 28703fd0a558SYan, Zheng } 28713fd0a558SYan, Zheng 28723fd0a558SYan, Zheng return 0; 28733fd0a558SYan, Zheng } 28743fd0a558SYan, Zheng 28755d4f98a2SYan Zheng /* 28765d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 28775d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 28785d4f98a2SYan Zheng * 28795d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 28805d4f98a2SYan Zheng * in that case this function just updates pointers. 28815d4f98a2SYan Zheng */ 28825d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 28833fd0a558SYan, Zheng struct reloc_control *rc, 28845d4f98a2SYan Zheng struct backref_node *node, 28855d4f98a2SYan Zheng struct btrfs_key *key, 28865d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 28875d4f98a2SYan Zheng { 28882ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 28895d4f98a2SYan Zheng struct backref_node *upper; 28905d4f98a2SYan Zheng struct backref_edge *edge; 28915d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28925d4f98a2SYan Zheng struct btrfs_root *root; 28935d4f98a2SYan Zheng struct extent_buffer *eb; 28945d4f98a2SYan Zheng u32 blocksize; 28955d4f98a2SYan Zheng u64 bytenr; 28965d4f98a2SYan Zheng u64 generation; 28975d4f98a2SYan Zheng int slot; 28985d4f98a2SYan Zheng int ret; 28995d4f98a2SYan Zheng int err = 0; 29005d4f98a2SYan Zheng 29015d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 29025d4f98a2SYan Zheng 29035d4f98a2SYan Zheng path->lowest_level = node->level + 1; 29043fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 29055d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 2906581c1760SQu Wenruo struct btrfs_key first_key; 290782fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 2908581c1760SQu Wenruo 29095d4f98a2SYan Zheng cond_resched(); 29105d4f98a2SYan Zheng 29115d4f98a2SYan Zheng upper = edge->node[UPPER]; 2912dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 29133fd0a558SYan, Zheng BUG_ON(!root); 29145d4f98a2SYan Zheng 29153fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 29163fd0a558SYan, Zheng if (!lowest) { 29173fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 29183fd0a558SYan, Zheng upper->level, &slot); 2919cbca7d59SFilipe Manana if (ret < 0) { 2920cbca7d59SFilipe Manana err = ret; 2921cbca7d59SFilipe Manana goto next; 2922cbca7d59SFilipe Manana } 29233fd0a558SYan, Zheng BUG_ON(ret); 29243fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 29253fd0a558SYan, Zheng if (node->eb->start == bytenr) 29263fd0a558SYan, Zheng goto next; 29273fd0a558SYan, Zheng } 29285d4f98a2SYan Zheng drop_node_buffer(upper); 29293fd0a558SYan, Zheng } 29305d4f98a2SYan Zheng 29315d4f98a2SYan Zheng if (!upper->eb) { 29325d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 29333561b9dbSLiu Bo if (ret) { 29343561b9dbSLiu Bo if (ret < 0) 29355d4f98a2SYan Zheng err = ret; 29363561b9dbSLiu Bo else 29373561b9dbSLiu Bo err = -ENOENT; 29383561b9dbSLiu Bo 29393561b9dbSLiu Bo btrfs_release_path(path); 29405d4f98a2SYan Zheng break; 29415d4f98a2SYan Zheng } 29425d4f98a2SYan Zheng 29433fd0a558SYan, Zheng if (!upper->eb) { 29443fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 29453fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 29463fd0a558SYan, Zheng } else { 29473fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 29483fd0a558SYan, Zheng } 29493fd0a558SYan, Zheng 29503fd0a558SYan, Zheng upper->locked = 1; 29513fd0a558SYan, Zheng path->locks[upper->level] = 0; 29523fd0a558SYan, Zheng 29535d4f98a2SYan Zheng slot = path->slots[upper->level]; 2954b3b4aa74SDavid Sterba btrfs_release_path(path); 29555d4f98a2SYan Zheng } else { 29565d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 29575d4f98a2SYan Zheng &slot); 2958cbca7d59SFilipe Manana if (ret < 0) { 2959cbca7d59SFilipe Manana err = ret; 2960cbca7d59SFilipe Manana goto next; 2961cbca7d59SFilipe Manana } 29625d4f98a2SYan Zheng BUG_ON(ret); 29635d4f98a2SYan Zheng } 29645d4f98a2SYan Zheng 29655d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 29663fd0a558SYan, Zheng if (lowest) { 29674547f4d8SLiu Bo if (bytenr != node->bytenr) { 29684547f4d8SLiu Bo btrfs_err(root->fs_info, 29694547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 29704547f4d8SLiu Bo bytenr, node->bytenr, slot, 29714547f4d8SLiu Bo upper->eb->start); 29724547f4d8SLiu Bo err = -EIO; 29734547f4d8SLiu Bo goto next; 29744547f4d8SLiu Bo } 29755d4f98a2SYan Zheng } else { 29763fd0a558SYan, Zheng if (node->eb->start == bytenr) 29773fd0a558SYan, Zheng goto next; 29785d4f98a2SYan Zheng } 29795d4f98a2SYan Zheng 2980da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 29815d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 2982581c1760SQu Wenruo btrfs_node_key_to_cpu(upper->eb, &first_key, slot); 2983581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, generation, 2984581c1760SQu Wenruo upper->level - 1, &first_key); 298564c043deSLiu Bo if (IS_ERR(eb)) { 298664c043deSLiu Bo err = PTR_ERR(eb); 298764c043deSLiu Bo goto next; 298864c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2989416bc658SJosef Bacik free_extent_buffer(eb); 299097d9a8a4STsutomu Itoh err = -EIO; 299197d9a8a4STsutomu Itoh goto next; 299297d9a8a4STsutomu Itoh } 29935d4f98a2SYan Zheng btrfs_tree_lock(eb); 29948bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 29955d4f98a2SYan Zheng 29965d4f98a2SYan Zheng if (!node->eb) { 29975d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 29985d4f98a2SYan Zheng slot, &eb); 29993fd0a558SYan, Zheng btrfs_tree_unlock(eb); 30003fd0a558SYan, Zheng free_extent_buffer(eb); 30015d4f98a2SYan Zheng if (ret < 0) { 30025d4f98a2SYan Zheng err = ret; 30033fd0a558SYan, Zheng goto next; 30045d4f98a2SYan Zheng } 30053fd0a558SYan, Zheng BUG_ON(node->eb != eb); 30065d4f98a2SYan Zheng } else { 30075d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 30085d4f98a2SYan Zheng node->eb->start); 30095d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 30105d4f98a2SYan Zheng trans->transid); 30115d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 30125d4f98a2SYan Zheng 301382fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, 30145d4f98a2SYan Zheng node->eb->start, blocksize, 301582fa113fSQu Wenruo upper->eb->start); 301682fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 301782fa113fSQu Wenruo btrfs_init_tree_ref(&ref, node->level, 301882fa113fSQu Wenruo btrfs_header_owner(upper->eb)); 301982fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 30205d4f98a2SYan Zheng BUG_ON(ret); 30215d4f98a2SYan Zheng 30225d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 30235d4f98a2SYan Zheng BUG_ON(ret); 30245d4f98a2SYan Zheng } 30253fd0a558SYan, Zheng next: 30263fd0a558SYan, Zheng if (!upper->pending) 30273fd0a558SYan, Zheng drop_node_buffer(upper); 30283fd0a558SYan, Zheng else 30293fd0a558SYan, Zheng unlock_node_buffer(upper); 30303fd0a558SYan, Zheng if (err) 30313fd0a558SYan, Zheng break; 30325d4f98a2SYan Zheng } 30333fd0a558SYan, Zheng 30343fd0a558SYan, Zheng if (!err && node->pending) { 30353fd0a558SYan, Zheng drop_node_buffer(node); 30363fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 30373fd0a558SYan, Zheng node->pending = 0; 30385d4f98a2SYan Zheng } 30393fd0a558SYan, Zheng 30405d4f98a2SYan Zheng path->lowest_level = 0; 30413fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 30425d4f98a2SYan Zheng return err; 30435d4f98a2SYan Zheng } 30445d4f98a2SYan Zheng 30455d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 30463fd0a558SYan, Zheng struct reloc_control *rc, 30475d4f98a2SYan Zheng struct backref_node *node, 30485d4f98a2SYan Zheng struct btrfs_path *path) 30495d4f98a2SYan Zheng { 30505d4f98a2SYan Zheng struct btrfs_key key; 30515d4f98a2SYan Zheng 30525d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 30533fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 30545d4f98a2SYan Zheng } 30555d4f98a2SYan Zheng 30565d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 30573fd0a558SYan, Zheng struct reloc_control *rc, 30583fd0a558SYan, Zheng struct btrfs_path *path, int err) 30595d4f98a2SYan Zheng { 30603fd0a558SYan, Zheng LIST_HEAD(list); 30613fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 30625d4f98a2SYan Zheng struct backref_node *node; 30635d4f98a2SYan Zheng int level; 30645d4f98a2SYan Zheng int ret; 30655d4f98a2SYan Zheng 30665d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 30675d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 30685d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 30693fd0a558SYan, Zheng struct backref_node, list); 30703fd0a558SYan, Zheng list_move_tail(&node->list, &list); 30713fd0a558SYan, Zheng BUG_ON(!node->pending); 30725d4f98a2SYan Zheng 30733fd0a558SYan, Zheng if (!err) { 30743fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 30755d4f98a2SYan Zheng if (ret < 0) 30765d4f98a2SYan Zheng err = ret; 30775d4f98a2SYan Zheng } 30785d4f98a2SYan Zheng } 30793fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 30803fd0a558SYan, Zheng } 30815d4f98a2SYan Zheng return err; 30825d4f98a2SYan Zheng } 30835d4f98a2SYan Zheng 30845d4f98a2SYan Zheng static void mark_block_processed(struct reloc_control *rc, 30853fd0a558SYan, Zheng u64 bytenr, u32 blocksize) 30863fd0a558SYan, Zheng { 30873fd0a558SYan, Zheng set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, 3088ceeb0ae7SDavid Sterba EXTENT_DIRTY); 30893fd0a558SYan, Zheng } 30903fd0a558SYan, Zheng 30913fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 30925d4f98a2SYan Zheng struct backref_node *node) 30935d4f98a2SYan Zheng { 30945d4f98a2SYan Zheng u32 blocksize; 30955d4f98a2SYan Zheng if (node->level == 0 || 30965d4f98a2SYan Zheng in_block_group(node->bytenr, rc->block_group)) { 3097da17066cSJeff Mahoney blocksize = rc->extent_root->fs_info->nodesize; 30983fd0a558SYan, Zheng mark_block_processed(rc, node->bytenr, blocksize); 30995d4f98a2SYan Zheng } 31005d4f98a2SYan Zheng node->processed = 1; 31015d4f98a2SYan Zheng } 31025d4f98a2SYan Zheng 31035d4f98a2SYan Zheng /* 31045d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 31055d4f98a2SYan Zheng * as processed. 31065d4f98a2SYan Zheng */ 31075d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 31085d4f98a2SYan Zheng struct backref_node *node) 31095d4f98a2SYan Zheng { 31105d4f98a2SYan Zheng struct backref_node *next = node; 31115d4f98a2SYan Zheng struct backref_edge *edge; 31125d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 31135d4f98a2SYan Zheng int index = 0; 31145d4f98a2SYan Zheng 31155d4f98a2SYan Zheng while (next) { 31165d4f98a2SYan Zheng cond_resched(); 31175d4f98a2SYan Zheng while (1) { 31185d4f98a2SYan Zheng if (next->processed) 31195d4f98a2SYan Zheng break; 31205d4f98a2SYan Zheng 31213fd0a558SYan, Zheng __mark_block_processed(rc, next); 31225d4f98a2SYan Zheng 31235d4f98a2SYan Zheng if (list_empty(&next->upper)) 31245d4f98a2SYan Zheng break; 31255d4f98a2SYan Zheng 31265d4f98a2SYan Zheng edge = list_entry(next->upper.next, 31275d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 31285d4f98a2SYan Zheng edges[index++] = edge; 31295d4f98a2SYan Zheng next = edge->node[UPPER]; 31305d4f98a2SYan Zheng } 31315d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 31325d4f98a2SYan Zheng } 31335d4f98a2SYan Zheng } 31345d4f98a2SYan Zheng 31357476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 31365d4f98a2SYan Zheng { 3137da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 31387476dfdaSDavid Sterba 31395d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 31409655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 31415d4f98a2SYan Zheng return 1; 31425d4f98a2SYan Zheng return 0; 31435d4f98a2SYan Zheng } 31445d4f98a2SYan Zheng 31452ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 31465d4f98a2SYan Zheng struct tree_block *block) 31475d4f98a2SYan Zheng { 31485d4f98a2SYan Zheng struct extent_buffer *eb; 31495d4f98a2SYan Zheng 3150581c1760SQu Wenruo eb = read_tree_block(fs_info, block->bytenr, block->key.offset, 3151581c1760SQu Wenruo block->level, NULL); 315264c043deSLiu Bo if (IS_ERR(eb)) { 315364c043deSLiu Bo return PTR_ERR(eb); 315464c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 3155416bc658SJosef Bacik free_extent_buffer(eb); 3156416bc658SJosef Bacik return -EIO; 3157416bc658SJosef Bacik } 31585d4f98a2SYan Zheng if (block->level == 0) 31595d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 31605d4f98a2SYan Zheng else 31615d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 31625d4f98a2SYan Zheng free_extent_buffer(eb); 31635d4f98a2SYan Zheng block->key_ready = 1; 31645d4f98a2SYan Zheng return 0; 31655d4f98a2SYan Zheng } 31665d4f98a2SYan Zheng 31675d4f98a2SYan Zheng /* 31685d4f98a2SYan Zheng * helper function to relocate a tree block 31695d4f98a2SYan Zheng */ 31705d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 31715d4f98a2SYan Zheng struct reloc_control *rc, 31725d4f98a2SYan Zheng struct backref_node *node, 31735d4f98a2SYan Zheng struct btrfs_key *key, 31745d4f98a2SYan Zheng struct btrfs_path *path) 31755d4f98a2SYan Zheng { 31765d4f98a2SYan Zheng struct btrfs_root *root; 31773fd0a558SYan, Zheng int ret = 0; 31785d4f98a2SYan Zheng 31793fd0a558SYan, Zheng if (!node) 31805d4f98a2SYan Zheng return 0; 31813fd0a558SYan, Zheng 31825f6b2e5cSJosef Bacik /* 31835f6b2e5cSJosef Bacik * If we fail here we want to drop our backref_node because we are going 31845f6b2e5cSJosef Bacik * to start over and regenerate the tree for it. 31855f6b2e5cSJosef Bacik */ 31865f6b2e5cSJosef Bacik ret = reserve_metadata_space(trans, rc, node); 31875f6b2e5cSJosef Bacik if (ret) 31885f6b2e5cSJosef Bacik goto out; 31895f6b2e5cSJosef Bacik 31903fd0a558SYan, Zheng BUG_ON(node->processed); 3191147d256eSZhaolei root = select_one_root(node); 31923fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 31933fd0a558SYan, Zheng update_processed_blocks(rc, node); 31943fd0a558SYan, Zheng goto out; 31955d4f98a2SYan Zheng } 31965d4f98a2SYan Zheng 31973fd0a558SYan, Zheng if (root) { 319827cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 31993fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 32003fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 32013fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 32023fd0a558SYan, Zheng root = root->reloc_root; 32033fd0a558SYan, Zheng node->new_bytenr = root->node->start; 320400246528SJosef Bacik btrfs_put_root(node->root); 320500246528SJosef Bacik node->root = btrfs_grab_root(root); 32060b530bc5SJosef Bacik ASSERT(node->root); 32073fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 32083fd0a558SYan, Zheng } else { 32095d4f98a2SYan Zheng path->lowest_level = node->level; 32105d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 3211b3b4aa74SDavid Sterba btrfs_release_path(path); 32123fd0a558SYan, Zheng if (ret > 0) 32135d4f98a2SYan Zheng ret = 0; 32143fd0a558SYan, Zheng } 32153fd0a558SYan, Zheng if (!ret) 32163fd0a558SYan, Zheng update_processed_blocks(rc, node); 32173fd0a558SYan, Zheng } else { 32183fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 32193fd0a558SYan, Zheng } 32205d4f98a2SYan Zheng out: 32210647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 32223fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 32235d4f98a2SYan Zheng return ret; 32245d4f98a2SYan Zheng } 32255d4f98a2SYan Zheng 32265d4f98a2SYan Zheng /* 32275d4f98a2SYan Zheng * relocate a list of blocks 32285d4f98a2SYan Zheng */ 32295d4f98a2SYan Zheng static noinline_for_stack 32305d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 32315d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 32325d4f98a2SYan Zheng { 32332ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 32345d4f98a2SYan Zheng struct backref_node *node; 32355d4f98a2SYan Zheng struct btrfs_path *path; 32365d4f98a2SYan Zheng struct tree_block *block; 323798ff7b94SQu Wenruo struct tree_block *next; 32385d4f98a2SYan Zheng int ret; 32395d4f98a2SYan Zheng int err = 0; 32405d4f98a2SYan Zheng 32415d4f98a2SYan Zheng path = btrfs_alloc_path(); 3242e1a12670SLiu Bo if (!path) { 3243e1a12670SLiu Bo err = -ENOMEM; 324434c2b290SDavid Sterba goto out_free_blocks; 3245e1a12670SLiu Bo } 32465d4f98a2SYan Zheng 324798ff7b94SQu Wenruo /* Kick in readahead for tree blocks with missing keys */ 324898ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 32495d4f98a2SYan Zheng if (!block->key_ready) 32502ff7e61eSJeff Mahoney readahead_tree_block(fs_info, block->bytenr); 32515d4f98a2SYan Zheng } 32525d4f98a2SYan Zheng 325398ff7b94SQu Wenruo /* Get first keys */ 325498ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 325534c2b290SDavid Sterba if (!block->key_ready) { 32562ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 325734c2b290SDavid Sterba if (err) 325834c2b290SDavid Sterba goto out_free_path; 325934c2b290SDavid Sterba } 32605d4f98a2SYan Zheng } 32615d4f98a2SYan Zheng 326298ff7b94SQu Wenruo /* Do tree relocation */ 326398ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 32643fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 32655d4f98a2SYan Zheng block->level, block->bytenr); 32665d4f98a2SYan Zheng if (IS_ERR(node)) { 32675d4f98a2SYan Zheng err = PTR_ERR(node); 32685d4f98a2SYan Zheng goto out; 32695d4f98a2SYan Zheng } 32705d4f98a2SYan Zheng 32715d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 32725d4f98a2SYan Zheng path); 32735d4f98a2SYan Zheng if (ret < 0) { 32745d4f98a2SYan Zheng err = ret; 327550dbbb71SJosef Bacik break; 32765d4f98a2SYan Zheng } 32775d4f98a2SYan Zheng } 32785d4f98a2SYan Zheng out: 32793fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 32805d4f98a2SYan Zheng 328134c2b290SDavid Sterba out_free_path: 32825d4f98a2SYan Zheng btrfs_free_path(path); 328334c2b290SDavid Sterba out_free_blocks: 3284e1a12670SLiu Bo free_block_list(blocks); 32855d4f98a2SYan Zheng return err; 32865d4f98a2SYan Zheng } 32875d4f98a2SYan Zheng 32885d4f98a2SYan Zheng static noinline_for_stack 3289efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3290efa56464SYan, Zheng struct file_extent_cluster *cluster) 3291efa56464SYan, Zheng { 3292efa56464SYan, Zheng u64 alloc_hint = 0; 3293efa56464SYan, Zheng u64 start; 3294efa56464SYan, Zheng u64 end; 3295efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3296efa56464SYan, Zheng u64 num_bytes; 3297efa56464SYan, Zheng int nr = 0; 3298efa56464SYan, Zheng int ret = 0; 3299dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 3300dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 330118513091SWang Xiaoguang u64 cur_offset; 3302364ecf36SQu Wenruo struct extent_changeset *data_reserved = NULL; 3303efa56464SYan, Zheng 3304efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 33055955102cSAl Viro inode_lock(inode); 3306efa56464SYan, Zheng 3307364ecf36SQu Wenruo ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start, 3308dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 3309efa56464SYan, Zheng if (ret) 3310efa56464SYan, Zheng goto out; 3311efa56464SYan, Zheng 331218513091SWang Xiaoguang cur_offset = prealloc_start; 3313efa56464SYan, Zheng while (nr < cluster->nr) { 3314efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3315efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3316efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3317efa56464SYan, Zheng else 3318efa56464SYan, Zheng end = cluster->end - offset; 3319efa56464SYan, Zheng 3320d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3321efa56464SYan, Zheng num_bytes = end + 1 - start; 332218513091SWang Xiaoguang if (cur_offset < start) 3323bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3324bc42bda2SQu Wenruo cur_offset, start - cur_offset); 3325efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3326efa56464SYan, Zheng num_bytes, num_bytes, 3327efa56464SYan, Zheng end + 1, &alloc_hint); 332818513091SWang Xiaoguang cur_offset = end + 1; 3329d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3330efa56464SYan, Zheng if (ret) 3331efa56464SYan, Zheng break; 3332efa56464SYan, Zheng nr++; 3333efa56464SYan, Zheng } 333418513091SWang Xiaoguang if (cur_offset < prealloc_end) 3335bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3336bc42bda2SQu Wenruo cur_offset, prealloc_end + 1 - cur_offset); 3337efa56464SYan, Zheng out: 33385955102cSAl Viro inode_unlock(inode); 3339364ecf36SQu Wenruo extent_changeset_free(data_reserved); 3340efa56464SYan, Zheng return ret; 3341efa56464SYan, Zheng } 3342efa56464SYan, Zheng 3343efa56464SYan, Zheng static noinline_for_stack 33440257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 33450257bb82SYan, Zheng u64 block_start) 33465d4f98a2SYan Zheng { 33475d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 33485d4f98a2SYan Zheng struct extent_map *em; 33490257bb82SYan, Zheng int ret = 0; 33505d4f98a2SYan Zheng 3351172ddd60SDavid Sterba em = alloc_extent_map(); 33520257bb82SYan, Zheng if (!em) 33530257bb82SYan, Zheng return -ENOMEM; 33540257bb82SYan, Zheng 33555d4f98a2SYan Zheng em->start = start; 33560257bb82SYan, Zheng em->len = end + 1 - start; 33570257bb82SYan, Zheng em->block_len = em->len; 33580257bb82SYan, Zheng em->block_start = block_start; 33595d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 33605d4f98a2SYan Zheng 3361d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 33625d4f98a2SYan Zheng while (1) { 3363890871beSChris Mason write_lock(&em_tree->lock); 336409a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3365890871beSChris Mason write_unlock(&em_tree->lock); 33665d4f98a2SYan Zheng if (ret != -EEXIST) { 33675d4f98a2SYan Zheng free_extent_map(em); 33685d4f98a2SYan Zheng break; 33695d4f98a2SYan Zheng } 3370dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 33715d4f98a2SYan Zheng } 3372d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 33730257bb82SYan, Zheng return ret; 33740257bb82SYan, Zheng } 33755d4f98a2SYan Zheng 3376726a3421SQu Wenruo /* 3377726a3421SQu Wenruo * Allow error injection to test balance cancellation 3378726a3421SQu Wenruo */ 3379726a3421SQu Wenruo int btrfs_should_cancel_balance(struct btrfs_fs_info *fs_info) 3380726a3421SQu Wenruo { 3381726a3421SQu Wenruo return atomic_read(&fs_info->balance_cancel_req); 3382726a3421SQu Wenruo } 3383726a3421SQu Wenruo ALLOW_ERROR_INJECTION(btrfs_should_cancel_balance, TRUE); 3384726a3421SQu Wenruo 33850257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 33860257bb82SYan, Zheng struct file_extent_cluster *cluster) 33870257bb82SYan, Zheng { 33882ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 33890257bb82SYan, Zheng u64 page_start; 33900257bb82SYan, Zheng u64 page_end; 33910257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 33920257bb82SYan, Zheng unsigned long index; 33930257bb82SYan, Zheng unsigned long last_index; 33940257bb82SYan, Zheng struct page *page; 33950257bb82SYan, Zheng struct file_ra_state *ra; 33963b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 33970257bb82SYan, Zheng int nr = 0; 33980257bb82SYan, Zheng int ret = 0; 33990257bb82SYan, Zheng 34000257bb82SYan, Zheng if (!cluster->nr) 34010257bb82SYan, Zheng return 0; 34020257bb82SYan, Zheng 34030257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 34040257bb82SYan, Zheng if (!ra) 34050257bb82SYan, Zheng return -ENOMEM; 34060257bb82SYan, Zheng 3407efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 34080257bb82SYan, Zheng if (ret) 3409efa56464SYan, Zheng goto out; 34100257bb82SYan, Zheng 34110257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 34120257bb82SYan, Zheng 3413efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3414efa56464SYan, Zheng cluster->end - offset, cluster->start); 3415efa56464SYan, Zheng if (ret) 3416efa56464SYan, Zheng goto out; 3417efa56464SYan, Zheng 341809cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 341909cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 34200257bb82SYan, Zheng while (index <= last_index) { 34219f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 34229f3db423SNikolay Borisov PAGE_SIZE); 3423efa56464SYan, Zheng if (ret) 3424efa56464SYan, Zheng goto out; 3425efa56464SYan, Zheng 34260257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 34270257bb82SYan, Zheng if (!page) { 34280257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 34290257bb82SYan, Zheng ra, NULL, index, 34300257bb82SYan, Zheng last_index + 1 - index); 3431a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 34323b16a4e3SJosef Bacik mask); 34330257bb82SYan, Zheng if (!page) { 3434691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 343543b18595SQu Wenruo PAGE_SIZE, true); 343644db1216SFilipe Manana btrfs_delalloc_release_extents(BTRFS_I(inode), 34378702ba93SQu Wenruo PAGE_SIZE); 34380257bb82SYan, Zheng ret = -ENOMEM; 3439efa56464SYan, Zheng goto out; 34400257bb82SYan, Zheng } 34410257bb82SYan, Zheng } 34420257bb82SYan, Zheng 34430257bb82SYan, Zheng if (PageReadahead(page)) { 34440257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 34450257bb82SYan, Zheng ra, NULL, page, index, 34460257bb82SYan, Zheng last_index + 1 - index); 34470257bb82SYan, Zheng } 34480257bb82SYan, Zheng 34490257bb82SYan, Zheng if (!PageUptodate(page)) { 34500257bb82SYan, Zheng btrfs_readpage(NULL, page); 34510257bb82SYan, Zheng lock_page(page); 34520257bb82SYan, Zheng if (!PageUptodate(page)) { 34530257bb82SYan, Zheng unlock_page(page); 345409cbfeafSKirill A. Shutemov put_page(page); 3455691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 345643b18595SQu Wenruo PAGE_SIZE, true); 34578b62f87bSJosef Bacik btrfs_delalloc_release_extents(BTRFS_I(inode), 34588702ba93SQu Wenruo PAGE_SIZE); 34590257bb82SYan, Zheng ret = -EIO; 3460efa56464SYan, Zheng goto out; 34610257bb82SYan, Zheng } 34620257bb82SYan, Zheng } 34630257bb82SYan, Zheng 34644eee4fa4SMiao Xie page_start = page_offset(page); 346509cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 34660257bb82SYan, Zheng 3467d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 34680257bb82SYan, Zheng 34690257bb82SYan, Zheng set_page_extent_mapped(page); 34700257bb82SYan, Zheng 34710257bb82SYan, Zheng if (nr < cluster->nr && 34720257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 34730257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 34740257bb82SYan, Zheng page_start, page_end, 3475ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 34760257bb82SYan, Zheng nr++; 34770257bb82SYan, Zheng } 34780257bb82SYan, Zheng 3479765f3cebSNikolay Borisov ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0, 3480330a5827SNikolay Borisov NULL); 3481765f3cebSNikolay Borisov if (ret) { 3482765f3cebSNikolay Borisov unlock_page(page); 3483765f3cebSNikolay Borisov put_page(page); 3484765f3cebSNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 348543b18595SQu Wenruo PAGE_SIZE, true); 3486765f3cebSNikolay Borisov btrfs_delalloc_release_extents(BTRFS_I(inode), 34878702ba93SQu Wenruo PAGE_SIZE); 3488765f3cebSNikolay Borisov 3489765f3cebSNikolay Borisov clear_extent_bits(&BTRFS_I(inode)->io_tree, 3490765f3cebSNikolay Borisov page_start, page_end, 3491765f3cebSNikolay Borisov EXTENT_LOCKED | EXTENT_BOUNDARY); 3492765f3cebSNikolay Borisov goto out; 3493765f3cebSNikolay Borisov 3494765f3cebSNikolay Borisov } 34950257bb82SYan, Zheng set_page_dirty(page); 34960257bb82SYan, Zheng 34970257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3498d0082371SJeff Mahoney page_start, page_end); 34990257bb82SYan, Zheng unlock_page(page); 350009cbfeafSKirill A. Shutemov put_page(page); 35010257bb82SYan, Zheng 35020257bb82SYan, Zheng index++; 35038702ba93SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); 3504efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 35052ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 35067f913c7cSQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 35077f913c7cSQu Wenruo ret = -ECANCELED; 35087f913c7cSQu Wenruo goto out; 35097f913c7cSQu Wenruo } 35100257bb82SYan, Zheng } 35110257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3512efa56464SYan, Zheng out: 35130257bb82SYan, Zheng kfree(ra); 35140257bb82SYan, Zheng return ret; 35150257bb82SYan, Zheng } 35160257bb82SYan, Zheng 35170257bb82SYan, Zheng static noinline_for_stack 35180257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 35190257bb82SYan, Zheng struct file_extent_cluster *cluster) 35200257bb82SYan, Zheng { 35210257bb82SYan, Zheng int ret; 35220257bb82SYan, Zheng 35230257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 35240257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 35250257bb82SYan, Zheng if (ret) 35260257bb82SYan, Zheng return ret; 35270257bb82SYan, Zheng cluster->nr = 0; 35280257bb82SYan, Zheng } 35290257bb82SYan, Zheng 35300257bb82SYan, Zheng if (!cluster->nr) 35310257bb82SYan, Zheng cluster->start = extent_key->objectid; 35320257bb82SYan, Zheng else 35330257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 35340257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 35350257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 35360257bb82SYan, Zheng cluster->nr++; 35370257bb82SYan, Zheng 35380257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 35390257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 35400257bb82SYan, Zheng if (ret) 35410257bb82SYan, Zheng return ret; 35420257bb82SYan, Zheng cluster->nr = 0; 35430257bb82SYan, Zheng } 35440257bb82SYan, Zheng return 0; 35455d4f98a2SYan Zheng } 35465d4f98a2SYan Zheng 35475d4f98a2SYan Zheng /* 35485d4f98a2SYan Zheng * helper to add a tree block to the list. 35495d4f98a2SYan Zheng * the major work is getting the generation and level of the block 35505d4f98a2SYan Zheng */ 35515d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 35525d4f98a2SYan Zheng struct btrfs_key *extent_key, 35535d4f98a2SYan Zheng struct btrfs_path *path, 35545d4f98a2SYan Zheng struct rb_root *blocks) 35555d4f98a2SYan Zheng { 35565d4f98a2SYan Zheng struct extent_buffer *eb; 35575d4f98a2SYan Zheng struct btrfs_extent_item *ei; 35585d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 35595d4f98a2SYan Zheng struct tree_block *block; 35605d4f98a2SYan Zheng struct rb_node *rb_node; 35615d4f98a2SYan Zheng u32 item_size; 35625d4f98a2SYan Zheng int level = -1; 35637fdf4b60SWang Shilong u64 generation; 35645d4f98a2SYan Zheng 35655d4f98a2SYan Zheng eb = path->nodes[0]; 35665d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 35675d4f98a2SYan Zheng 35683173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 35693173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 35705d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 35715d4f98a2SYan Zheng struct btrfs_extent_item); 35723173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 35735d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 35745d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 35755d4f98a2SYan Zheng } else { 35763173a18fSJosef Bacik level = (int)extent_key->offset; 35773173a18fSJosef Bacik } 35783173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 35796d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3580ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3581ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3582ba3c2b19SNikolay Borisov return -EINVAL; 35833173a18fSJosef Bacik } else { 35845d4f98a2SYan Zheng BUG(); 35855d4f98a2SYan Zheng } 35865d4f98a2SYan Zheng 3587b3b4aa74SDavid Sterba btrfs_release_path(path); 35885d4f98a2SYan Zheng 35895d4f98a2SYan Zheng BUG_ON(level == -1); 35905d4f98a2SYan Zheng 35915d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 35925d4f98a2SYan Zheng if (!block) 35935d4f98a2SYan Zheng return -ENOMEM; 35945d4f98a2SYan Zheng 35955d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3596da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 35975d4f98a2SYan Zheng block->key.offset = generation; 35985d4f98a2SYan Zheng block->level = level; 35995d4f98a2SYan Zheng block->key_ready = 0; 36005d4f98a2SYan Zheng 36015d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 360243c04fb1SJeff Mahoney if (rb_node) 360343c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 36045d4f98a2SYan Zheng 36055d4f98a2SYan Zheng return 0; 36065d4f98a2SYan Zheng } 36075d4f98a2SYan Zheng 36085d4f98a2SYan Zheng /* 36095d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 36105d4f98a2SYan Zheng */ 36115d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 36125d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 36135d4f98a2SYan Zheng struct rb_root *blocks) 36145d4f98a2SYan Zheng { 36150b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 36165d4f98a2SYan Zheng struct btrfs_path *path; 36175d4f98a2SYan Zheng struct btrfs_key key; 36185d4f98a2SYan Zheng int ret; 36190b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 36205d4f98a2SYan Zheng 36217476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 36225d4f98a2SYan Zheng return 0; 36235d4f98a2SYan Zheng 36245d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 36255d4f98a2SYan Zheng return 0; 36265d4f98a2SYan Zheng 36275d4f98a2SYan Zheng path = btrfs_alloc_path(); 36285d4f98a2SYan Zheng if (!path) 36295d4f98a2SYan Zheng return -ENOMEM; 3630aee68ee5SJosef Bacik again: 36315d4f98a2SYan Zheng key.objectid = bytenr; 3632aee68ee5SJosef Bacik if (skinny) { 3633aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3634aee68ee5SJosef Bacik key.offset = (u64)-1; 3635aee68ee5SJosef Bacik } else { 36365d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 36375d4f98a2SYan Zheng key.offset = blocksize; 3638aee68ee5SJosef Bacik } 36395d4f98a2SYan Zheng 36405d4f98a2SYan Zheng path->search_commit_root = 1; 36415d4f98a2SYan Zheng path->skip_locking = 1; 36425d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 36435d4f98a2SYan Zheng if (ret < 0) 36445d4f98a2SYan Zheng goto out; 36455d4f98a2SYan Zheng 3646aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3647aee68ee5SJosef Bacik if (path->slots[0]) { 3648aee68ee5SJosef Bacik path->slots[0]--; 3649aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3650aee68ee5SJosef Bacik path->slots[0]); 36513173a18fSJosef Bacik if (key.objectid == bytenr && 3652aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3653aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3654aee68ee5SJosef Bacik key.offset == blocksize))) 36553173a18fSJosef Bacik ret = 0; 36563173a18fSJosef Bacik } 3657aee68ee5SJosef Bacik 3658aee68ee5SJosef Bacik if (ret) { 3659aee68ee5SJosef Bacik skinny = false; 3660aee68ee5SJosef Bacik btrfs_release_path(path); 3661aee68ee5SJosef Bacik goto again; 3662aee68ee5SJosef Bacik } 3663aee68ee5SJosef Bacik } 3664cdccee99SLiu Bo if (ret) { 3665cdccee99SLiu Bo ASSERT(ret == 1); 3666cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3667cdccee99SLiu Bo btrfs_err(fs_info, 3668cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3669cdccee99SLiu Bo bytenr); 3670cdccee99SLiu Bo WARN_ON(1); 3671cdccee99SLiu Bo ret = -EINVAL; 3672cdccee99SLiu Bo goto out; 3673cdccee99SLiu Bo } 36743173a18fSJosef Bacik 36755d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 36765d4f98a2SYan Zheng out: 36775d4f98a2SYan Zheng btrfs_free_path(path); 36785d4f98a2SYan Zheng return ret; 36795d4f98a2SYan Zheng } 36805d4f98a2SYan Zheng 36810af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 368232da5386SDavid Sterba struct btrfs_block_group *block_group, 36831bbc621eSChris Mason struct inode *inode, 36841bbc621eSChris Mason u64 ino) 36850af3d00bSJosef Bacik { 36860af3d00bSJosef Bacik struct btrfs_key key; 36870af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 36880af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 36890af3d00bSJosef Bacik int ret = 0; 36900af3d00bSJosef Bacik 36910af3d00bSJosef Bacik if (inode) 36920af3d00bSJosef Bacik goto truncate; 36930af3d00bSJosef Bacik 36940af3d00bSJosef Bacik key.objectid = ino; 36950af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 36960af3d00bSJosef Bacik key.offset = 0; 36970af3d00bSJosef Bacik 36984c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 36992e19f1f9SAl Viro if (IS_ERR(inode)) 37000af3d00bSJosef Bacik return -ENOENT; 37010af3d00bSJosef Bacik 37020af3d00bSJosef Bacik truncate: 37032ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 37047b61cd92SMiao Xie &fs_info->global_block_rsv); 37057b61cd92SMiao Xie if (ret) 37067b61cd92SMiao Xie goto out; 37077b61cd92SMiao Xie 37087a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 37090af3d00bSJosef Bacik if (IS_ERR(trans)) { 37103612b495STsutomu Itoh ret = PTR_ERR(trans); 37110af3d00bSJosef Bacik goto out; 37120af3d00bSJosef Bacik } 37130af3d00bSJosef Bacik 371477ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 37150af3d00bSJosef Bacik 37163a45bb20SJeff Mahoney btrfs_end_transaction(trans); 37172ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 37180af3d00bSJosef Bacik out: 37190af3d00bSJosef Bacik iput(inode); 37200af3d00bSJosef Bacik return ret; 37210af3d00bSJosef Bacik } 37220af3d00bSJosef Bacik 37235d4f98a2SYan Zheng /* 372419b546d7SQu Wenruo * Locate the free space cache EXTENT_DATA in root tree leaf and delete the 372519b546d7SQu Wenruo * cache inode, to avoid free space cache data extent blocking data relocation. 37265d4f98a2SYan Zheng */ 372719b546d7SQu Wenruo static int delete_v1_space_cache(struct extent_buffer *leaf, 372819b546d7SQu Wenruo struct btrfs_block_group *block_group, 372919b546d7SQu Wenruo u64 data_bytenr) 37305d4f98a2SYan Zheng { 373119b546d7SQu Wenruo u64 space_cache_ino; 373219b546d7SQu Wenruo struct btrfs_file_extent_item *ei; 37335d4f98a2SYan Zheng struct btrfs_key key; 373419b546d7SQu Wenruo bool found = false; 373519b546d7SQu Wenruo int i; 37365d4f98a2SYan Zheng int ret; 37375d4f98a2SYan Zheng 373819b546d7SQu Wenruo if (btrfs_header_owner(leaf) != BTRFS_ROOT_TREE_OBJECTID) 373919b546d7SQu Wenruo return 0; 37405d4f98a2SYan Zheng 374119b546d7SQu Wenruo for (i = 0; i < btrfs_header_nritems(leaf); i++) { 374219b546d7SQu Wenruo btrfs_item_key_to_cpu(leaf, &key, i); 374319b546d7SQu Wenruo if (key.type != BTRFS_EXTENT_DATA_KEY) 374419b546d7SQu Wenruo continue; 374519b546d7SQu Wenruo ei = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 374619b546d7SQu Wenruo if (btrfs_file_extent_type(leaf, ei) == BTRFS_FILE_EXTENT_REG && 374719b546d7SQu Wenruo btrfs_file_extent_disk_bytenr(leaf, ei) == data_bytenr) { 374819b546d7SQu Wenruo found = true; 374919b546d7SQu Wenruo space_cache_ino = key.objectid; 375019b546d7SQu Wenruo break; 375119b546d7SQu Wenruo } 375219b546d7SQu Wenruo } 375319b546d7SQu Wenruo if (!found) 375419b546d7SQu Wenruo return -ENOENT; 375519b546d7SQu Wenruo ret = delete_block_group_cache(leaf->fs_info, block_group, NULL, 375619b546d7SQu Wenruo space_cache_ino); 37570af3d00bSJosef Bacik return ret; 37585d4f98a2SYan Zheng } 37595d4f98a2SYan Zheng 37605d4f98a2SYan Zheng /* 37612c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 37625d4f98a2SYan Zheng */ 37635d4f98a2SYan Zheng static noinline_for_stack 37645d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 37655d4f98a2SYan Zheng struct btrfs_key *extent_key, 37665d4f98a2SYan Zheng struct btrfs_path *path, 37675d4f98a2SYan Zheng struct rb_root *blocks) 37685d4f98a2SYan Zheng { 376919b546d7SQu Wenruo struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 377019b546d7SQu Wenruo struct ulist *leaves = NULL; 377119b546d7SQu Wenruo struct ulist_iterator leaf_uiter; 377219b546d7SQu Wenruo struct ulist_node *ref_node = NULL; 377319b546d7SQu Wenruo const u32 blocksize = fs_info->nodesize; 3774647f63bdSFilipe David Borba Manana int ret = 0; 37755d4f98a2SYan Zheng 3776b3b4aa74SDavid Sterba btrfs_release_path(path); 377719b546d7SQu Wenruo ret = btrfs_find_all_leafs(NULL, fs_info, extent_key->objectid, 377819b546d7SQu Wenruo 0, &leaves, NULL, true); 377919b546d7SQu Wenruo if (ret < 0) 378019b546d7SQu Wenruo return ret; 378119b546d7SQu Wenruo 378219b546d7SQu Wenruo ULIST_ITER_INIT(&leaf_uiter); 378319b546d7SQu Wenruo while ((ref_node = ulist_next(leaves, &leaf_uiter))) { 378419b546d7SQu Wenruo struct extent_buffer *eb; 378519b546d7SQu Wenruo 378619b546d7SQu Wenruo eb = read_tree_block(fs_info, ref_node->val, 0, 0, NULL); 378719b546d7SQu Wenruo if (IS_ERR(eb)) { 378819b546d7SQu Wenruo ret = PTR_ERR(eb); 378919b546d7SQu Wenruo break; 379019b546d7SQu Wenruo } 379119b546d7SQu Wenruo ret = delete_v1_space_cache(eb, rc->block_group, 379219b546d7SQu Wenruo extent_key->objectid); 379319b546d7SQu Wenruo free_extent_buffer(eb); 379419b546d7SQu Wenruo if (ret < 0) 379519b546d7SQu Wenruo break; 379619b546d7SQu Wenruo ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); 379719b546d7SQu Wenruo if (ret < 0) 379819b546d7SQu Wenruo break; 379919b546d7SQu Wenruo } 380019b546d7SQu Wenruo if (ret < 0) 38015d4f98a2SYan Zheng free_block_list(blocks); 380219b546d7SQu Wenruo ulist_free(leaves); 380319b546d7SQu Wenruo return ret; 38045d4f98a2SYan Zheng } 38055d4f98a2SYan Zheng 38065d4f98a2SYan Zheng /* 38072c016dc2SLiu Bo * helper to find next unprocessed extent 38085d4f98a2SYan Zheng */ 38095d4f98a2SYan Zheng static noinline_for_stack 3810147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 38113fd0a558SYan, Zheng struct btrfs_key *extent_key) 38125d4f98a2SYan Zheng { 38130b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38145d4f98a2SYan Zheng struct btrfs_key key; 38155d4f98a2SYan Zheng struct extent_buffer *leaf; 38165d4f98a2SYan Zheng u64 start, end, last; 38175d4f98a2SYan Zheng int ret; 38185d4f98a2SYan Zheng 3819b3470b5dSDavid Sterba last = rc->block_group->start + rc->block_group->length; 38205d4f98a2SYan Zheng while (1) { 38215d4f98a2SYan Zheng cond_resched(); 38225d4f98a2SYan Zheng if (rc->search_start >= last) { 38235d4f98a2SYan Zheng ret = 1; 38245d4f98a2SYan Zheng break; 38255d4f98a2SYan Zheng } 38265d4f98a2SYan Zheng 38275d4f98a2SYan Zheng key.objectid = rc->search_start; 38285d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 38295d4f98a2SYan Zheng key.offset = 0; 38305d4f98a2SYan Zheng 38315d4f98a2SYan Zheng path->search_commit_root = 1; 38325d4f98a2SYan Zheng path->skip_locking = 1; 38335d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 38345d4f98a2SYan Zheng 0, 0); 38355d4f98a2SYan Zheng if (ret < 0) 38365d4f98a2SYan Zheng break; 38375d4f98a2SYan Zheng next: 38385d4f98a2SYan Zheng leaf = path->nodes[0]; 38395d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 38405d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 38415d4f98a2SYan Zheng if (ret != 0) 38425d4f98a2SYan Zheng break; 38435d4f98a2SYan Zheng leaf = path->nodes[0]; 38445d4f98a2SYan Zheng } 38455d4f98a2SYan Zheng 38465d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 38475d4f98a2SYan Zheng if (key.objectid >= last) { 38485d4f98a2SYan Zheng ret = 1; 38495d4f98a2SYan Zheng break; 38505d4f98a2SYan Zheng } 38515d4f98a2SYan Zheng 38523173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 38533173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 38543173a18fSJosef Bacik path->slots[0]++; 38553173a18fSJosef Bacik goto next; 38563173a18fSJosef Bacik } 38573173a18fSJosef Bacik 38583173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 38595d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 38605d4f98a2SYan Zheng path->slots[0]++; 38615d4f98a2SYan Zheng goto next; 38625d4f98a2SYan Zheng } 38635d4f98a2SYan Zheng 38643173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 38650b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 38663173a18fSJosef Bacik rc->search_start) { 38673173a18fSJosef Bacik path->slots[0]++; 38683173a18fSJosef Bacik goto next; 38693173a18fSJosef Bacik } 38703173a18fSJosef Bacik 38715d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 38725d4f98a2SYan Zheng key.objectid, &start, &end, 3873e6138876SJosef Bacik EXTENT_DIRTY, NULL); 38745d4f98a2SYan Zheng 38755d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3876b3b4aa74SDavid Sterba btrfs_release_path(path); 38775d4f98a2SYan Zheng rc->search_start = end + 1; 38785d4f98a2SYan Zheng } else { 38793173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 38805d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 38813173a18fSJosef Bacik else 38823173a18fSJosef Bacik rc->search_start = key.objectid + 38830b246afaSJeff Mahoney fs_info->nodesize; 38843fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 38855d4f98a2SYan Zheng return 0; 38865d4f98a2SYan Zheng } 38875d4f98a2SYan Zheng } 3888b3b4aa74SDavid Sterba btrfs_release_path(path); 38895d4f98a2SYan Zheng return ret; 38905d4f98a2SYan Zheng } 38915d4f98a2SYan Zheng 38925d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 38935d4f98a2SYan Zheng { 38945d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38957585717fSChris Mason 38967585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 38975d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 38987585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 38995d4f98a2SYan Zheng } 39005d4f98a2SYan Zheng 39015d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 39025d4f98a2SYan Zheng { 39035d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39047585717fSChris Mason 39057585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39065d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 39077585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39085d4f98a2SYan Zheng } 39095d4f98a2SYan Zheng 39105d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 39115d4f98a2SYan Zheng { 39125d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39135d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39145d4f98a2SYan Zheng return 1; 39155d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 39165d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39175d4f98a2SYan Zheng return 1; 39185d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39195d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 39205d4f98a2SYan Zheng return 1; 39215d4f98a2SYan Zheng return 0; 39225d4f98a2SYan Zheng } 39235d4f98a2SYan Zheng 39243fd0a558SYan, Zheng static noinline_for_stack 39253fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 39263fd0a558SYan, Zheng { 39273fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3928ac2fabacSJosef Bacik int ret; 39293fd0a558SYan, Zheng 39302ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 393166d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 39323fd0a558SYan, Zheng if (!rc->block_rsv) 39333fd0a558SYan, Zheng return -ENOMEM; 39343fd0a558SYan, Zheng 39353fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 3936b3470b5dSDavid Sterba rc->search_start = rc->block_group->start; 39373fd0a558SYan, Zheng rc->extents_found = 0; 39383fd0a558SYan, Zheng rc->nodes_relocated = 0; 39393fd0a558SYan, Zheng rc->merging_rsv_size = 0; 39400647bf56SWang Shilong rc->reserved_bytes = 0; 3941da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 39420647bf56SWang Shilong RELOCATION_RESERVED_NODES; 3943ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 3944ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3945ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3946ac2fabacSJosef Bacik if (ret) 3947ac2fabacSJosef Bacik return ret; 39483fd0a558SYan, Zheng 39493fd0a558SYan, Zheng rc->create_reloc_tree = 1; 39503fd0a558SYan, Zheng set_reloc_control(rc); 39513fd0a558SYan, Zheng 39527a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 395328818947SLiu Bo if (IS_ERR(trans)) { 395428818947SLiu Bo unset_reloc_control(rc); 395528818947SLiu Bo /* 395628818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 395728818947SLiu Bo * cleanup. And callers are responsible to free the above 395828818947SLiu Bo * block rsv. 395928818947SLiu Bo */ 396028818947SLiu Bo return PTR_ERR(trans); 396128818947SLiu Bo } 39623a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 39633fd0a558SYan, Zheng return 0; 39643fd0a558SYan, Zheng } 396576dda93cSYan, Zheng 39665d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 39675d4f98a2SYan Zheng { 39682ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39695d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 39705d4f98a2SYan Zheng struct btrfs_key key; 39715d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 39725d4f98a2SYan Zheng struct btrfs_path *path; 39735d4f98a2SYan Zheng struct btrfs_extent_item *ei; 39745d4f98a2SYan Zheng u64 flags; 39755d4f98a2SYan Zheng u32 item_size; 39765d4f98a2SYan Zheng int ret; 39775d4f98a2SYan Zheng int err = 0; 3978c87f08caSChris Mason int progress = 0; 39795d4f98a2SYan Zheng 39805d4f98a2SYan Zheng path = btrfs_alloc_path(); 39813fd0a558SYan, Zheng if (!path) 39825d4f98a2SYan Zheng return -ENOMEM; 3983e4058b54SDavid Sterba path->reada = READA_FORWARD; 39843fd0a558SYan, Zheng 39853fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 39863fd0a558SYan, Zheng if (ret) { 39873fd0a558SYan, Zheng err = ret; 39883fd0a558SYan, Zheng goto out_free; 39892423fdfbSJiri Slaby } 39905d4f98a2SYan Zheng 39915d4f98a2SYan Zheng while (1) { 39920647bf56SWang Shilong rc->reserved_bytes = 0; 39930647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 39940647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 39950647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 39960647bf56SWang Shilong if (ret) { 39970647bf56SWang Shilong err = ret; 39980647bf56SWang Shilong break; 39990647bf56SWang Shilong } 4000c87f08caSChris Mason progress++; 4001a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 40020f788c58SLiu Bo if (IS_ERR(trans)) { 40030f788c58SLiu Bo err = PTR_ERR(trans); 40040f788c58SLiu Bo trans = NULL; 40050f788c58SLiu Bo break; 40060f788c58SLiu Bo } 4007c87f08caSChris Mason restart: 40083fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 40093a45bb20SJeff Mahoney btrfs_end_transaction(trans); 401042a657f5SPan Bian trans = NULL; 40113fd0a558SYan, Zheng continue; 40123fd0a558SYan, Zheng } 40133fd0a558SYan, Zheng 4014147d256eSZhaolei ret = find_next_extent(rc, path, &key); 40155d4f98a2SYan Zheng if (ret < 0) 40165d4f98a2SYan Zheng err = ret; 40175d4f98a2SYan Zheng if (ret != 0) 40185d4f98a2SYan Zheng break; 40195d4f98a2SYan Zheng 40205d4f98a2SYan Zheng rc->extents_found++; 40215d4f98a2SYan Zheng 40225d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 40235d4f98a2SYan Zheng struct btrfs_extent_item); 40243fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 40255d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 40265d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 40275d4f98a2SYan Zheng ret = check_extent_flags(flags); 40285d4f98a2SYan Zheng BUG_ON(ret); 40296d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 4030ba3c2b19SNikolay Borisov err = -EINVAL; 4031ba3c2b19SNikolay Borisov btrfs_print_v0_err(trans->fs_info); 4032ba3c2b19SNikolay Borisov btrfs_abort_transaction(trans, err); 4033ba3c2b19SNikolay Borisov break; 40345d4f98a2SYan Zheng } else { 40355d4f98a2SYan Zheng BUG(); 40365d4f98a2SYan Zheng } 40375d4f98a2SYan Zheng 40385d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 40395d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 40405d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 40415d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40425d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 40435d4f98a2SYan Zheng } else { 4044b3b4aa74SDavid Sterba btrfs_release_path(path); 40455d4f98a2SYan Zheng ret = 0; 40465d4f98a2SYan Zheng } 40475d4f98a2SYan Zheng if (ret < 0) { 40483fd0a558SYan, Zheng err = ret; 40495d4f98a2SYan Zheng break; 40505d4f98a2SYan Zheng } 40515d4f98a2SYan Zheng 40525d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 40535d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 40545d4f98a2SYan Zheng if (ret < 0) { 40553fd0a558SYan, Zheng if (ret != -EAGAIN) { 40565d4f98a2SYan Zheng err = ret; 40575d4f98a2SYan Zheng break; 40585d4f98a2SYan Zheng } 40593fd0a558SYan, Zheng rc->extents_found--; 40603fd0a558SYan, Zheng rc->search_start = key.objectid; 40613fd0a558SYan, Zheng } 40625d4f98a2SYan Zheng } 40635d4f98a2SYan Zheng 40643a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 40652ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 40663fd0a558SYan, Zheng trans = NULL; 40675d4f98a2SYan Zheng 40685d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 40695d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40705d4f98a2SYan Zheng rc->found_file_extent = 1; 40710257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 40723fd0a558SYan, Zheng &key, &rc->cluster); 40735d4f98a2SYan Zheng if (ret < 0) { 40745d4f98a2SYan Zheng err = ret; 40755d4f98a2SYan Zheng break; 40765d4f98a2SYan Zheng } 40775d4f98a2SYan Zheng } 4078f31ea088SQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 4079f31ea088SQu Wenruo err = -ECANCELED; 4080f31ea088SQu Wenruo break; 4081f31ea088SQu Wenruo } 40825d4f98a2SYan Zheng } 4083c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 408443a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 40859689457bSShilong Wang if (ret == 1) { 4086c87f08caSChris Mason err = 0; 4087c87f08caSChris Mason progress = 0; 4088c87f08caSChris Mason goto restart; 4089c87f08caSChris Mason } 4090c87f08caSChris Mason } 40913fd0a558SYan, Zheng 4092b3b4aa74SDavid Sterba btrfs_release_path(path); 409391166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 40945d4f98a2SYan Zheng 40955d4f98a2SYan Zheng if (trans) { 40963a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 40972ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 40985d4f98a2SYan Zheng } 40995d4f98a2SYan Zheng 41000257bb82SYan, Zheng if (!err) { 41013fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 41023fd0a558SYan, Zheng &rc->cluster); 41030257bb82SYan, Zheng if (ret < 0) 41040257bb82SYan, Zheng err = ret; 41050257bb82SYan, Zheng } 41060257bb82SYan, Zheng 41073fd0a558SYan, Zheng rc->create_reloc_tree = 0; 41083fd0a558SYan, Zheng set_reloc_control(rc); 41090257bb82SYan, Zheng 41103fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 411163f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 41125d4f98a2SYan Zheng 41137f913c7cSQu Wenruo /* 41147f913c7cSQu Wenruo * Even in the case when the relocation is cancelled, we should all go 41157f913c7cSQu Wenruo * through prepare_to_merge() and merge_reloc_roots(). 41167f913c7cSQu Wenruo * 41177f913c7cSQu Wenruo * For error (including cancelled balance), prepare_to_merge() will 41187f913c7cSQu Wenruo * mark all reloc trees orphan, then queue them for cleanup in 41197f913c7cSQu Wenruo * merge_reloc_roots() 41207f913c7cSQu Wenruo */ 41213fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 41225d4f98a2SYan Zheng 41235d4f98a2SYan Zheng merge_reloc_roots(rc); 41245d4f98a2SYan Zheng 41253fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 41265d4f98a2SYan Zheng unset_reloc_control(rc); 412763f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 41285d4f98a2SYan Zheng 41295d4f98a2SYan Zheng /* get rid of pinned extents */ 41307a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 413162b99540SQu Wenruo if (IS_ERR(trans)) { 41323612b495STsutomu Itoh err = PTR_ERR(trans); 413362b99540SQu Wenruo goto out_free; 413462b99540SQu Wenruo } 41353a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 41366217b0faSJosef Bacik out_free: 4137d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4138d2311e69SQu Wenruo if (ret < 0 && !err) 4139d2311e69SQu Wenruo err = ret; 41402ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 41413fd0a558SYan, Zheng btrfs_free_path(path); 41425d4f98a2SYan Zheng return err; 41435d4f98a2SYan Zheng } 41445d4f98a2SYan Zheng 41455d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 41460257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 41475d4f98a2SYan Zheng { 41485d4f98a2SYan Zheng struct btrfs_path *path; 41495d4f98a2SYan Zheng struct btrfs_inode_item *item; 41505d4f98a2SYan Zheng struct extent_buffer *leaf; 41515d4f98a2SYan Zheng int ret; 41525d4f98a2SYan Zheng 41535d4f98a2SYan Zheng path = btrfs_alloc_path(); 41545d4f98a2SYan Zheng if (!path) 41555d4f98a2SYan Zheng return -ENOMEM; 41565d4f98a2SYan Zheng 41575d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 41585d4f98a2SYan Zheng if (ret) 41595d4f98a2SYan Zheng goto out; 41605d4f98a2SYan Zheng 41615d4f98a2SYan Zheng leaf = path->nodes[0]; 41625d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 4163b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 41645d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 41650257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 41665d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 41673fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 41683fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 41695d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 41705d4f98a2SYan Zheng out: 41715d4f98a2SYan Zheng btrfs_free_path(path); 41725d4f98a2SYan Zheng return ret; 41735d4f98a2SYan Zheng } 41745d4f98a2SYan Zheng 41755d4f98a2SYan Zheng /* 41765d4f98a2SYan Zheng * helper to create inode for data relocation. 41775d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 41785d4f98a2SYan Zheng */ 41793fd0a558SYan, Zheng static noinline_for_stack 41803fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 418132da5386SDavid Sterba struct btrfs_block_group *group) 41825d4f98a2SYan Zheng { 41835d4f98a2SYan Zheng struct inode *inode = NULL; 41845d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 41855d4f98a2SYan Zheng struct btrfs_root *root; 41865d4f98a2SYan Zheng struct btrfs_key key; 41874624900dSZhaolei u64 objectid; 41885d4f98a2SYan Zheng int err = 0; 41895d4f98a2SYan Zheng 41905d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 41915d4f98a2SYan Zheng if (IS_ERR(root)) 41925d4f98a2SYan Zheng return ERR_CAST(root); 41935d4f98a2SYan Zheng 4194a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 419576deacf0SJosef Bacik if (IS_ERR(trans)) { 419600246528SJosef Bacik btrfs_put_root(root); 41973fd0a558SYan, Zheng return ERR_CAST(trans); 419876deacf0SJosef Bacik } 41995d4f98a2SYan Zheng 4200581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 42015d4f98a2SYan Zheng if (err) 42025d4f98a2SYan Zheng goto out; 42035d4f98a2SYan Zheng 42040257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 42055d4f98a2SYan Zheng BUG_ON(err); 42065d4f98a2SYan Zheng 42075d4f98a2SYan Zheng key.objectid = objectid; 42085d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 42095d4f98a2SYan Zheng key.offset = 0; 42104c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 42112e19f1f9SAl Viro BUG_ON(IS_ERR(inode)); 4212b3470b5dSDavid Sterba BTRFS_I(inode)->index_cnt = group->start; 42135d4f98a2SYan Zheng 421473f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 42155d4f98a2SYan Zheng out: 421600246528SJosef Bacik btrfs_put_root(root); 42173a45bb20SJeff Mahoney btrfs_end_transaction(trans); 42182ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 42195d4f98a2SYan Zheng if (err) { 42205d4f98a2SYan Zheng if (inode) 42215d4f98a2SYan Zheng iput(inode); 42225d4f98a2SYan Zheng inode = ERR_PTR(err); 42235d4f98a2SYan Zheng } 42245d4f98a2SYan Zheng return inode; 42255d4f98a2SYan Zheng } 42265d4f98a2SYan Zheng 4227c258d6e3SQu Wenruo static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 42283fd0a558SYan, Zheng { 42293fd0a558SYan, Zheng struct reloc_control *rc; 42303fd0a558SYan, Zheng 42313fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 42323fd0a558SYan, Zheng if (!rc) 42333fd0a558SYan, Zheng return NULL; 42343fd0a558SYan, Zheng 42353fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 4236d2311e69SQu Wenruo INIT_LIST_HEAD(&rc->dirty_subvol_roots); 42373fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 42383fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 423943eb5f29SQu Wenruo extent_io_tree_init(fs_info, &rc->processed_blocks, 424043eb5f29SQu Wenruo IO_TREE_RELOC_BLOCKS, NULL); 42413fd0a558SYan, Zheng return rc; 42423fd0a558SYan, Zheng } 42433fd0a558SYan, Zheng 42441a0afa0eSJosef Bacik static void free_reloc_control(struct reloc_control *rc) 42451a0afa0eSJosef Bacik { 42461a0afa0eSJosef Bacik struct mapping_node *node, *tmp; 42471a0afa0eSJosef Bacik 42481a0afa0eSJosef Bacik free_reloc_roots(&rc->reloc_roots); 42491a0afa0eSJosef Bacik rbtree_postorder_for_each_entry_safe(node, tmp, 42501a0afa0eSJosef Bacik &rc->reloc_root_tree.rb_root, rb_node) 42511a0afa0eSJosef Bacik kfree(node); 42521a0afa0eSJosef Bacik 42531a0afa0eSJosef Bacik kfree(rc); 42541a0afa0eSJosef Bacik } 42551a0afa0eSJosef Bacik 42565d4f98a2SYan Zheng /* 4257ebce0e01SAdam Borowski * Print the block group being relocated 4258ebce0e01SAdam Borowski */ 4259ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 426032da5386SDavid Sterba struct btrfs_block_group *block_group) 4261ebce0e01SAdam Borowski { 4262f89e09cfSAnand Jain char buf[128] = {'\0'}; 4263ebce0e01SAdam Borowski 4264f89e09cfSAnand Jain btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); 4265ebce0e01SAdam Borowski 4266ebce0e01SAdam Borowski btrfs_info(fs_info, 4267ebce0e01SAdam Borowski "relocating block group %llu flags %s", 4268b3470b5dSDavid Sterba block_group->start, buf); 4269ebce0e01SAdam Borowski } 4270ebce0e01SAdam Borowski 4271430640e3SQu Wenruo static const char *stage_to_string(int stage) 4272430640e3SQu Wenruo { 4273430640e3SQu Wenruo if (stage == MOVE_DATA_EXTENTS) 4274430640e3SQu Wenruo return "move data extents"; 4275430640e3SQu Wenruo if (stage == UPDATE_DATA_PTRS) 4276430640e3SQu Wenruo return "update data pointers"; 4277430640e3SQu Wenruo return "unknown"; 4278430640e3SQu Wenruo } 4279430640e3SQu Wenruo 4280ebce0e01SAdam Borowski /* 42815d4f98a2SYan Zheng * function to relocate all extents in a block group. 42825d4f98a2SYan Zheng */ 42836bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 42845d4f98a2SYan Zheng { 428532da5386SDavid Sterba struct btrfs_block_group *bg; 42866bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 42875d4f98a2SYan Zheng struct reloc_control *rc; 42880af3d00bSJosef Bacik struct inode *inode; 42890af3d00bSJosef Bacik struct btrfs_path *path; 42905d4f98a2SYan Zheng int ret; 4291f0486c68SYan, Zheng int rw = 0; 42925d4f98a2SYan Zheng int err = 0; 42935d4f98a2SYan Zheng 4294eede2bf3SOmar Sandoval bg = btrfs_lookup_block_group(fs_info, group_start); 4295eede2bf3SOmar Sandoval if (!bg) 4296eede2bf3SOmar Sandoval return -ENOENT; 4297eede2bf3SOmar Sandoval 4298eede2bf3SOmar Sandoval if (btrfs_pinned_by_swapfile(fs_info, bg)) { 4299eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 4300eede2bf3SOmar Sandoval return -ETXTBSY; 4301eede2bf3SOmar Sandoval } 4302eede2bf3SOmar Sandoval 4303c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 4304eede2bf3SOmar Sandoval if (!rc) { 4305eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 43065d4f98a2SYan Zheng return -ENOMEM; 4307eede2bf3SOmar Sandoval } 43085d4f98a2SYan Zheng 4309f0486c68SYan, Zheng rc->extent_root = extent_root; 4310eede2bf3SOmar Sandoval rc->block_group = bg; 43115d4f98a2SYan Zheng 4312b12de528SQu Wenruo ret = btrfs_inc_block_group_ro(rc->block_group, true); 4313f0486c68SYan, Zheng if (ret) { 4314f0486c68SYan, Zheng err = ret; 4315f0486c68SYan, Zheng goto out; 4316f0486c68SYan, Zheng } 4317f0486c68SYan, Zheng rw = 1; 4318f0486c68SYan, Zheng 43190af3d00bSJosef Bacik path = btrfs_alloc_path(); 43200af3d00bSJosef Bacik if (!path) { 43210af3d00bSJosef Bacik err = -ENOMEM; 43220af3d00bSJosef Bacik goto out; 43230af3d00bSJosef Bacik } 43240af3d00bSJosef Bacik 43257949f339SDavid Sterba inode = lookup_free_space_inode(rc->block_group, path); 43260af3d00bSJosef Bacik btrfs_free_path(path); 43270af3d00bSJosef Bacik 43280af3d00bSJosef Bacik if (!IS_ERR(inode)) 43291bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 43300af3d00bSJosef Bacik else 43310af3d00bSJosef Bacik ret = PTR_ERR(inode); 43320af3d00bSJosef Bacik 43330af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 43340af3d00bSJosef Bacik err = ret; 43350af3d00bSJosef Bacik goto out; 43360af3d00bSJosef Bacik } 43370af3d00bSJosef Bacik 43385d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 43395d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 43405d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 43415d4f98a2SYan Zheng rc->data_inode = NULL; 43425d4f98a2SYan Zheng goto out; 43435d4f98a2SYan Zheng } 43445d4f98a2SYan Zheng 43450b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 43465d4f98a2SYan Zheng 43479cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4348f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 43496374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 4350b3470b5dSDavid Sterba rc->block_group->start, 4351b3470b5dSDavid Sterba rc->block_group->length); 43525d4f98a2SYan Zheng 43535d4f98a2SYan Zheng while (1) { 4354430640e3SQu Wenruo int finishes_stage; 4355430640e3SQu Wenruo 435676dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 43575d4f98a2SYan Zheng ret = relocate_block_group(rc); 435876dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 4359ff612ba7SJosef Bacik if (ret < 0) 43605d4f98a2SYan Zheng err = ret; 4361ff612ba7SJosef Bacik 4362430640e3SQu Wenruo finishes_stage = rc->stage; 4363ff612ba7SJosef Bacik /* 4364ff612ba7SJosef Bacik * We may have gotten ENOSPC after we already dirtied some 4365ff612ba7SJosef Bacik * extents. If writeout happens while we're relocating a 4366ff612ba7SJosef Bacik * different block group we could end up hitting the 4367ff612ba7SJosef Bacik * BUG_ON(rc->stage == UPDATE_DATA_PTRS) in 4368ff612ba7SJosef Bacik * btrfs_reloc_cow_block. Make sure we write everything out 4369ff612ba7SJosef Bacik * properly so we don't trip over this problem, and then break 4370ff612ba7SJosef Bacik * out of the loop if we hit an error. 4371ff612ba7SJosef Bacik */ 4372ff612ba7SJosef Bacik if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 4373ff612ba7SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 4374ff612ba7SJosef Bacik (u64)-1); 4375ff612ba7SJosef Bacik if (ret) 4376ff612ba7SJosef Bacik err = ret; 4377ff612ba7SJosef Bacik invalidate_mapping_pages(rc->data_inode->i_mapping, 4378ff612ba7SJosef Bacik 0, -1); 4379ff612ba7SJosef Bacik rc->stage = UPDATE_DATA_PTRS; 43805d4f98a2SYan Zheng } 43815d4f98a2SYan Zheng 4382ff612ba7SJosef Bacik if (err < 0) 4383ff612ba7SJosef Bacik goto out; 4384ff612ba7SJosef Bacik 43855d4f98a2SYan Zheng if (rc->extents_found == 0) 43865d4f98a2SYan Zheng break; 43875d4f98a2SYan Zheng 4388430640e3SQu Wenruo btrfs_info(fs_info, "found %llu extents, stage: %s", 4389430640e3SQu Wenruo rc->extents_found, stage_to_string(finishes_stage)); 43905d4f98a2SYan Zheng } 43915d4f98a2SYan Zheng 43925d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 43935d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 4394bf38be65SDavid Sterba WARN_ON(rc->block_group->used > 0); 43955d4f98a2SYan Zheng out: 4396f0486c68SYan, Zheng if (err && rw) 43972ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 43985d4f98a2SYan Zheng iput(rc->data_inode); 43995d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 44001a0afa0eSJosef Bacik free_reloc_control(rc); 44015d4f98a2SYan Zheng return err; 44025d4f98a2SYan Zheng } 44035d4f98a2SYan Zheng 440476dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 440576dda93cSYan, Zheng { 44060b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 440776dda93cSYan, Zheng struct btrfs_trans_handle *trans; 440879787eaaSJeff Mahoney int ret, err; 440976dda93cSYan, Zheng 44100b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 441179787eaaSJeff Mahoney if (IS_ERR(trans)) 441279787eaaSJeff Mahoney return PTR_ERR(trans); 441376dda93cSYan, Zheng 441476dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 441576dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 441676dda93cSYan, Zheng root->root_item.drop_level = 0; 441776dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 44180b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 441976dda93cSYan, Zheng &root->root_key, &root->root_item); 442076dda93cSYan, Zheng 44213a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 442279787eaaSJeff Mahoney if (err) 442379787eaaSJeff Mahoney return err; 442479787eaaSJeff Mahoney return ret; 442576dda93cSYan, Zheng } 442676dda93cSYan, Zheng 44275d4f98a2SYan Zheng /* 44285d4f98a2SYan Zheng * recover relocation interrupted by system crash. 44295d4f98a2SYan Zheng * 44305d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 44315d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 44325d4f98a2SYan Zheng */ 44335d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 44345d4f98a2SYan Zheng { 44350b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 44365d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 44375d4f98a2SYan Zheng struct btrfs_key key; 44385d4f98a2SYan Zheng struct btrfs_root *fs_root; 44395d4f98a2SYan Zheng struct btrfs_root *reloc_root; 44405d4f98a2SYan Zheng struct btrfs_path *path; 44415d4f98a2SYan Zheng struct extent_buffer *leaf; 44425d4f98a2SYan Zheng struct reloc_control *rc = NULL; 44435d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 44445d4f98a2SYan Zheng int ret; 44455d4f98a2SYan Zheng int err = 0; 44465d4f98a2SYan Zheng 44475d4f98a2SYan Zheng path = btrfs_alloc_path(); 44485d4f98a2SYan Zheng if (!path) 44495d4f98a2SYan Zheng return -ENOMEM; 4450e4058b54SDavid Sterba path->reada = READA_BACK; 44515d4f98a2SYan Zheng 44525d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 44535d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 44545d4f98a2SYan Zheng key.offset = (u64)-1; 44555d4f98a2SYan Zheng 44565d4f98a2SYan Zheng while (1) { 44570b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 44585d4f98a2SYan Zheng path, 0, 0); 44595d4f98a2SYan Zheng if (ret < 0) { 44605d4f98a2SYan Zheng err = ret; 44615d4f98a2SYan Zheng goto out; 44625d4f98a2SYan Zheng } 44635d4f98a2SYan Zheng if (ret > 0) { 44645d4f98a2SYan Zheng if (path->slots[0] == 0) 44655d4f98a2SYan Zheng break; 44665d4f98a2SYan Zheng path->slots[0]--; 44675d4f98a2SYan Zheng } 44685d4f98a2SYan Zheng leaf = path->nodes[0]; 44695d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4470b3b4aa74SDavid Sterba btrfs_release_path(path); 44715d4f98a2SYan Zheng 44725d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 44735d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 44745d4f98a2SYan Zheng break; 44755d4f98a2SYan Zheng 44763dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(root, &key); 44775d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 44785d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 44795d4f98a2SYan Zheng goto out; 44805d4f98a2SYan Zheng } 44815d4f98a2SYan Zheng 44823dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 44835d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 44845d4f98a2SYan Zheng 44855d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 44860b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, 44875d4f98a2SYan Zheng reloc_root->root_key.offset); 44885d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 448976dda93cSYan, Zheng ret = PTR_ERR(fs_root); 449076dda93cSYan, Zheng if (ret != -ENOENT) { 449176dda93cSYan, Zheng err = ret; 44925d4f98a2SYan Zheng goto out; 44935d4f98a2SYan Zheng } 449479787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 449579787eaaSJeff Mahoney if (ret < 0) { 449679787eaaSJeff Mahoney err = ret; 449779787eaaSJeff Mahoney goto out; 449879787eaaSJeff Mahoney } 4499932fd26dSJosef Bacik } else { 450000246528SJosef Bacik btrfs_put_root(fs_root); 450176dda93cSYan, Zheng } 45025d4f98a2SYan Zheng } 45035d4f98a2SYan Zheng 45045d4f98a2SYan Zheng if (key.offset == 0) 45055d4f98a2SYan Zheng break; 45065d4f98a2SYan Zheng 45075d4f98a2SYan Zheng key.offset--; 45085d4f98a2SYan Zheng } 4509b3b4aa74SDavid Sterba btrfs_release_path(path); 45105d4f98a2SYan Zheng 45115d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 45125d4f98a2SYan Zheng goto out; 45135d4f98a2SYan Zheng 4514c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 45155d4f98a2SYan Zheng if (!rc) { 45165d4f98a2SYan Zheng err = -ENOMEM; 45175d4f98a2SYan Zheng goto out; 45185d4f98a2SYan Zheng } 45195d4f98a2SYan Zheng 45200b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 45215d4f98a2SYan Zheng 45225d4f98a2SYan Zheng set_reloc_control(rc); 45235d4f98a2SYan Zheng 45247a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 45253612b495STsutomu Itoh if (IS_ERR(trans)) { 45263612b495STsutomu Itoh err = PTR_ERR(trans); 4527fb2d83eeSJosef Bacik goto out_unset; 45283612b495STsutomu Itoh } 45293fd0a558SYan, Zheng 45303fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 45313fd0a558SYan, Zheng 45325d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 45335d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 45345d4f98a2SYan Zheng struct btrfs_root, root_list); 45355d4f98a2SYan Zheng list_del(&reloc_root->root_list); 45365d4f98a2SYan Zheng 45375d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 45385d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 45395d4f98a2SYan Zheng &rc->reloc_roots); 45405d4f98a2SYan Zheng continue; 45415d4f98a2SYan Zheng } 45425d4f98a2SYan Zheng 45430b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, reloc_root->root_key.offset); 454479787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 454579787eaaSJeff Mahoney err = PTR_ERR(fs_root); 4546ca1aa281SJosef Bacik list_add_tail(&reloc_root->root_list, &reloc_roots); 4547fb2d83eeSJosef Bacik goto out_unset; 454879787eaaSJeff Mahoney } 45495d4f98a2SYan Zheng 4550ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 455179787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 4552f44deb74SJosef Bacik fs_root->reloc_root = btrfs_grab_root(reloc_root); 455300246528SJosef Bacik btrfs_put_root(fs_root); 45545d4f98a2SYan Zheng } 45555d4f98a2SYan Zheng 45563a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 455779787eaaSJeff Mahoney if (err) 4558fb2d83eeSJosef Bacik goto out_unset; 45595d4f98a2SYan Zheng 45605d4f98a2SYan Zheng merge_reloc_roots(rc); 45615d4f98a2SYan Zheng 45625d4f98a2SYan Zheng unset_reloc_control(rc); 45635d4f98a2SYan Zheng 45647a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 456562b99540SQu Wenruo if (IS_ERR(trans)) { 45663612b495STsutomu Itoh err = PTR_ERR(trans); 45676217b0faSJosef Bacik goto out_clean; 456862b99540SQu Wenruo } 45693a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 45706217b0faSJosef Bacik out_clean: 4571d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4572d2311e69SQu Wenruo if (ret < 0 && !err) 4573d2311e69SQu Wenruo err = ret; 4574fb2d83eeSJosef Bacik out_unset: 4575fb2d83eeSJosef Bacik unset_reloc_control(rc); 45761a0afa0eSJosef Bacik free_reloc_control(rc); 45773612b495STsutomu Itoh out: 4578aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4579aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4580aca1bba6SLiu Bo 45815d4f98a2SYan Zheng btrfs_free_path(path); 45825d4f98a2SYan Zheng 45835d4f98a2SYan Zheng if (err == 0) { 45845d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 45850b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 4586932fd26dSJosef Bacik if (IS_ERR(fs_root)) { 45875d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4588932fd26dSJosef Bacik } else { 458966b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 459000246528SJosef Bacik btrfs_put_root(fs_root); 4591932fd26dSJosef Bacik } 4592932fd26dSJosef Bacik } 45935d4f98a2SYan Zheng return err; 45945d4f98a2SYan Zheng } 45955d4f98a2SYan Zheng 45965d4f98a2SYan Zheng /* 45975d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 45985d4f98a2SYan Zheng * 45995d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 46005d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 46015d4f98a2SYan Zheng */ 46025d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 46035d4f98a2SYan Zheng { 46040b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 46055d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 46065d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 46075d4f98a2SYan Zheng int ret; 46085d4f98a2SYan Zheng u64 disk_bytenr; 46094577b014SJosef Bacik u64 new_bytenr; 46105d4f98a2SYan Zheng LIST_HEAD(list); 46115d4f98a2SYan Zheng 46125d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 4613bffe633eSOmar Sandoval BUG_ON(ordered->file_offset != file_pos || ordered->num_bytes != len); 46145d4f98a2SYan Zheng 46155d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 46160b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4617a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 461879787eaaSJeff Mahoney if (ret) 461979787eaaSJeff Mahoney goto out; 46205d4f98a2SYan Zheng 46215d4f98a2SYan Zheng while (!list_empty(&list)) { 46225d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 46235d4f98a2SYan Zheng list_del_init(&sums->list); 46245d4f98a2SYan Zheng 46254577b014SJosef Bacik /* 46264577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 46274577b014SJosef Bacik * We need to do this because we will read in entire prealloc 46284577b014SJosef Bacik * extents but we may have written to say the middle of the 46294577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 46304577b014SJosef Bacik * the right disk offset. 46314577b014SJosef Bacik * 46324577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 46334577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 46344577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 46354577b014SJosef Bacik * disk length. 46364577b014SJosef Bacik */ 4637bffe633eSOmar Sandoval new_bytenr = ordered->disk_bytenr + sums->bytenr - disk_bytenr; 46384577b014SJosef Bacik sums->bytenr = new_bytenr; 46395d4f98a2SYan Zheng 4640f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 46415d4f98a2SYan Zheng } 464279787eaaSJeff Mahoney out: 46435d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4644411fc6bcSAndi Kleen return ret; 46455d4f98a2SYan Zheng } 46463fd0a558SYan, Zheng 464783d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 46483fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 46493fd0a558SYan, Zheng struct extent_buffer *cow) 46503fd0a558SYan, Zheng { 46510b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 46523fd0a558SYan, Zheng struct reloc_control *rc; 46533fd0a558SYan, Zheng struct backref_node *node; 46543fd0a558SYan, Zheng int first_cow = 0; 46553fd0a558SYan, Zheng int level; 465683d4cfd4SJosef Bacik int ret = 0; 46573fd0a558SYan, Zheng 46580b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 46593fd0a558SYan, Zheng if (!rc) 466083d4cfd4SJosef Bacik return 0; 46613fd0a558SYan, Zheng 46623fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 46633fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 46643fd0a558SYan, Zheng 46653fd0a558SYan, Zheng level = btrfs_header_level(buf); 46663fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 46673fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 46683fd0a558SYan, Zheng first_cow = 1; 46693fd0a558SYan, Zheng 46703fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 46713fd0a558SYan, Zheng rc->create_reloc_tree) { 46723fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 46733fd0a558SYan, Zheng 46743fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 46753fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 46763fd0a558SYan, Zheng node->new_bytenr != buf->start); 46773fd0a558SYan, Zheng 46783fd0a558SYan, Zheng drop_node_buffer(node); 467967439dadSDavid Sterba atomic_inc(&cow->refs); 46803fd0a558SYan, Zheng node->eb = cow; 46813fd0a558SYan, Zheng node->new_bytenr = cow->start; 46823fd0a558SYan, Zheng 46833fd0a558SYan, Zheng if (!node->pending) { 46843fd0a558SYan, Zheng list_move_tail(&node->list, 46853fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 46863fd0a558SYan, Zheng node->pending = 1; 46873fd0a558SYan, Zheng } 46883fd0a558SYan, Zheng 46893fd0a558SYan, Zheng if (first_cow) 46903fd0a558SYan, Zheng __mark_block_processed(rc, node); 46913fd0a558SYan, Zheng 46923fd0a558SYan, Zheng if (first_cow && level > 0) 46933fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 46943fd0a558SYan, Zheng } 46953fd0a558SYan, Zheng 469683d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 46973fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 469883d4cfd4SJosef Bacik return ret; 46993fd0a558SYan, Zheng } 47003fd0a558SYan, Zheng 47013fd0a558SYan, Zheng /* 47023fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 470301327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 47043fd0a558SYan, Zheng */ 4705147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 47063fd0a558SYan, Zheng u64 *bytes_to_reserve) 47073fd0a558SYan, Zheng { 470810995c04SQu Wenruo struct btrfs_root *root = pending->root; 470910995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 47103fd0a558SYan, Zheng 47116282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 47123fd0a558SYan, Zheng return; 47133fd0a558SYan, Zheng 47143fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 47153fd0a558SYan, Zheng return; 47163fd0a558SYan, Zheng 47173fd0a558SYan, Zheng root = root->reloc_root; 47183fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 47193fd0a558SYan, Zheng /* 47203fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 47213fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 47223fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 47233fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 47243fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 47253fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 47263fd0a558SYan, Zheng * tree may use more space than it frees. so we need 47273fd0a558SYan, Zheng * reserve extra space. 47283fd0a558SYan, Zheng */ 47293fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 47303fd0a558SYan, Zheng } 47313fd0a558SYan, Zheng 47323fd0a558SYan, Zheng /* 47333fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 47343fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 4735f44deb74SJosef Bacik * 4736f44deb74SJosef Bacik * This is similar to btrfs_init_reloc_root(), we come out of here with two 4737f44deb74SJosef Bacik * references held on the reloc_root, one for root->reloc_root and one for 4738f44deb74SJosef Bacik * rc->reloc_roots. 47393fd0a558SYan, Zheng */ 474049b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 47413fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 47423fd0a558SYan, Zheng { 47433fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 47443fd0a558SYan, Zheng struct btrfs_root *reloc_root; 47453fd0a558SYan, Zheng struct btrfs_root *new_root; 474610995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 47473fd0a558SYan, Zheng int ret; 47483fd0a558SYan, Zheng 47496282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 475049b25e05SJeff Mahoney return 0; 47513fd0a558SYan, Zheng 47523fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 47533fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 47543fd0a558SYan, Zheng 47553fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 47563fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 47573fd0a558SYan, Zheng rc->block_rsv, 47583a584174SLu Fengqi rc->nodes_relocated, true); 475949b25e05SJeff Mahoney if (ret) 476049b25e05SJeff Mahoney return ret; 47613fd0a558SYan, Zheng } 47623fd0a558SYan, Zheng 47633fd0a558SYan, Zheng new_root = pending->snap; 47643fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 47653fd0a558SYan, Zheng new_root->root_key.objectid); 476649b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 476749b25e05SJeff Mahoney return PTR_ERR(reloc_root); 47683fd0a558SYan, Zheng 4769ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4770ffd7b339SJeff Mahoney BUG_ON(ret < 0); 4771f44deb74SJosef Bacik new_root->reloc_root = btrfs_grab_root(reloc_root); 47723fd0a558SYan, Zheng 477349b25e05SJeff Mahoney if (rc->create_reloc_tree) 47743fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 477549b25e05SJeff Mahoney return ret; 47763fd0a558SYan, Zheng } 4777