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 6144d4225fcSJosef Bacik if (btrfs_header_generation(reloc_root->commit_root) == 6154d4225fcSJosef Bacik root->fs_info->running_transaction->transid) 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 1530aec7db3bSJosef Bacik if (!rc) 15312abc726aSJosef Bacik return 0; 15322abc726aSJosef Bacik 15331fac4a54SQu Wenruo /* 15341fac4a54SQu Wenruo * The subvolume has reloc tree but the swap is finished, no need to 15351fac4a54SQu Wenruo * create/update the dead reloc tree 15361fac4a54SQu Wenruo */ 15376282675eSQu Wenruo if (reloc_root_is_dead(root)) 15381fac4a54SQu Wenruo return 0; 15391fac4a54SQu Wenruo 1540aec7db3bSJosef Bacik /* 1541aec7db3bSJosef Bacik * This is subtle but important. We do not do 1542aec7db3bSJosef Bacik * record_root_in_transaction for reloc roots, instead we record their 1543aec7db3bSJosef Bacik * corresponding fs root, and then here we update the last trans for the 1544aec7db3bSJosef Bacik * reloc root. This means that we have to do this for the entire life 1545aec7db3bSJosef Bacik * of the reloc root, regardless of which stage of the relocation we are 1546aec7db3bSJosef Bacik * in. 1547aec7db3bSJosef Bacik */ 15483fd0a558SYan, Zheng if (root->reloc_root) { 15493fd0a558SYan, Zheng reloc_root = root->reloc_root; 15503fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 15513fd0a558SYan, Zheng return 0; 15523fd0a558SYan, Zheng } 15533fd0a558SYan, Zheng 1554aec7db3bSJosef Bacik /* 1555aec7db3bSJosef Bacik * We are merging reloc roots, we do not need new reloc trees. Also 1556aec7db3bSJosef Bacik * reloc trees never need their own reloc tree. 1557aec7db3bSJosef Bacik */ 1558aec7db3bSJosef Bacik if (!rc->create_reloc_tree || 1559aec7db3bSJosef Bacik root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 1560aec7db3bSJosef Bacik return 0; 1561aec7db3bSJosef Bacik 156220dd2cbfSMiao Xie if (!trans->reloc_reserved) { 156320dd2cbfSMiao Xie rsv = trans->block_rsv; 15643fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 15653fd0a558SYan, Zheng clear_rsv = 1; 15663fd0a558SYan, Zheng } 15673fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 15683fd0a558SYan, Zheng if (clear_rsv) 156920dd2cbfSMiao Xie trans->block_rsv = rsv; 15705d4f98a2SYan Zheng 1571ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1572ffd7b339SJeff Mahoney BUG_ON(ret < 0); 1573f44deb74SJosef Bacik root->reloc_root = btrfs_grab_root(reloc_root); 15745d4f98a2SYan Zheng return 0; 15755d4f98a2SYan Zheng } 15765d4f98a2SYan Zheng 15775d4f98a2SYan Zheng /* 15785d4f98a2SYan Zheng * update root item of reloc tree 15795d4f98a2SYan Zheng */ 15805d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 15815d4f98a2SYan Zheng struct btrfs_root *root) 15825d4f98a2SYan Zheng { 15830b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 15845d4f98a2SYan Zheng struct btrfs_root *reloc_root; 15855d4f98a2SYan Zheng struct btrfs_root_item *root_item; 15865d4f98a2SYan Zheng int ret; 15875d4f98a2SYan Zheng 15886282675eSQu Wenruo if (!have_reloc_root(root)) 15897585717fSChris Mason goto out; 15905d4f98a2SYan Zheng 15915d4f98a2SYan Zheng reloc_root = root->reloc_root; 15925d4f98a2SYan Zheng root_item = &reloc_root->root_item; 15935d4f98a2SYan Zheng 1594f44deb74SJosef Bacik /* 1595f44deb74SJosef Bacik * We are probably ok here, but __del_reloc_root() will drop its ref of 1596f44deb74SJosef Bacik * the root. We have the ref for root->reloc_root, but just in case 1597f44deb74SJosef Bacik * hold it while we update the reloc root. 1598f44deb74SJosef Bacik */ 1599f44deb74SJosef Bacik btrfs_grab_root(reloc_root); 1600f44deb74SJosef Bacik 1601d2311e69SQu Wenruo /* root->reloc_root will stay until current relocation finished */ 16020b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 16033fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 1604d2311e69SQu Wenruo set_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 16056282675eSQu Wenruo /* 16066282675eSQu Wenruo * Mark the tree as dead before we change reloc_root so 16076282675eSQu Wenruo * have_reloc_root will not touch it from now on. 16086282675eSQu Wenruo */ 16096282675eSQu Wenruo smp_wmb(); 1610c974c464SWang Shilong __del_reloc_root(reloc_root); 16115d4f98a2SYan Zheng } 16125d4f98a2SYan Zheng 16135d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 1614ea287ab1SJosef Bacik __update_reloc_root(reloc_root); 16155d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 16165d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 16175d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 16185d4f98a2SYan Zheng } 16195d4f98a2SYan Zheng 16200b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 16215d4f98a2SYan Zheng &reloc_root->root_key, root_item); 16225d4f98a2SYan Zheng BUG_ON(ret); 1623f44deb74SJosef Bacik btrfs_put_root(reloc_root); 16247585717fSChris Mason out: 16255d4f98a2SYan Zheng return 0; 16265d4f98a2SYan Zheng } 16275d4f98a2SYan Zheng 16285d4f98a2SYan Zheng /* 16295d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 16305d4f98a2SYan Zheng * in a subvolume 16315d4f98a2SYan Zheng */ 16325d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 16335d4f98a2SYan Zheng { 16345d4f98a2SYan Zheng struct rb_node *node; 16355d4f98a2SYan Zheng struct rb_node *prev; 16365d4f98a2SYan Zheng struct btrfs_inode *entry; 16375d4f98a2SYan Zheng struct inode *inode; 16385d4f98a2SYan Zheng 16395d4f98a2SYan Zheng spin_lock(&root->inode_lock); 16405d4f98a2SYan Zheng again: 16415d4f98a2SYan Zheng node = root->inode_tree.rb_node; 16425d4f98a2SYan Zheng prev = NULL; 16435d4f98a2SYan Zheng while (node) { 16445d4f98a2SYan Zheng prev = node; 16455d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 16465d4f98a2SYan Zheng 16474a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 16485d4f98a2SYan Zheng node = node->rb_left; 16494a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 16505d4f98a2SYan Zheng node = node->rb_right; 16515d4f98a2SYan Zheng else 16525d4f98a2SYan Zheng break; 16535d4f98a2SYan Zheng } 16545d4f98a2SYan Zheng if (!node) { 16555d4f98a2SYan Zheng while (prev) { 16565d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 16574a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 16585d4f98a2SYan Zheng node = prev; 16595d4f98a2SYan Zheng break; 16605d4f98a2SYan Zheng } 16615d4f98a2SYan Zheng prev = rb_next(prev); 16625d4f98a2SYan Zheng } 16635d4f98a2SYan Zheng } 16645d4f98a2SYan Zheng while (node) { 16655d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 16665d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 16675d4f98a2SYan Zheng if (inode) { 16685d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 16695d4f98a2SYan Zheng return inode; 16705d4f98a2SYan Zheng } 16715d4f98a2SYan Zheng 16724a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 16735d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 16745d4f98a2SYan Zheng goto again; 16755d4f98a2SYan Zheng 16765d4f98a2SYan Zheng node = rb_next(node); 16775d4f98a2SYan Zheng } 16785d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 16795d4f98a2SYan Zheng return NULL; 16805d4f98a2SYan Zheng } 16815d4f98a2SYan Zheng 168232da5386SDavid Sterba static int in_block_group(u64 bytenr, struct btrfs_block_group *block_group) 16835d4f98a2SYan Zheng { 1684b3470b5dSDavid Sterba if (bytenr >= block_group->start && 1685b3470b5dSDavid Sterba bytenr < block_group->start + block_group->length) 16865d4f98a2SYan Zheng return 1; 16875d4f98a2SYan Zheng return 0; 16885d4f98a2SYan Zheng } 16895d4f98a2SYan Zheng 16905d4f98a2SYan Zheng /* 16915d4f98a2SYan Zheng * get new location of data 16925d4f98a2SYan Zheng */ 16935d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 16945d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 16955d4f98a2SYan Zheng { 16965d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 16975d4f98a2SYan Zheng struct btrfs_path *path; 16985d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 16995d4f98a2SYan Zheng struct extent_buffer *leaf; 17005d4f98a2SYan Zheng int ret; 17015d4f98a2SYan Zheng 17025d4f98a2SYan Zheng path = btrfs_alloc_path(); 17035d4f98a2SYan Zheng if (!path) 17045d4f98a2SYan Zheng return -ENOMEM; 17055d4f98a2SYan Zheng 17065d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 1707f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 1708f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 17095d4f98a2SYan Zheng if (ret < 0) 17105d4f98a2SYan Zheng goto out; 17115d4f98a2SYan Zheng if (ret > 0) { 17125d4f98a2SYan Zheng ret = -ENOENT; 17135d4f98a2SYan Zheng goto out; 17145d4f98a2SYan Zheng } 17155d4f98a2SYan Zheng 17165d4f98a2SYan Zheng leaf = path->nodes[0]; 17175d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 17185d4f98a2SYan Zheng struct btrfs_file_extent_item); 17195d4f98a2SYan Zheng 17205d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 17215d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 17225d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 17235d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 17245d4f98a2SYan Zheng 17255d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 172683d4cfd4SJosef Bacik ret = -EINVAL; 17275d4f98a2SYan Zheng goto out; 17285d4f98a2SYan Zheng } 17295d4f98a2SYan Zheng 17305d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 17315d4f98a2SYan Zheng ret = 0; 17325d4f98a2SYan Zheng out: 17335d4f98a2SYan Zheng btrfs_free_path(path); 17345d4f98a2SYan Zheng return ret; 17355d4f98a2SYan Zheng } 17365d4f98a2SYan Zheng 17375d4f98a2SYan Zheng /* 17385d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 17395d4f98a2SYan Zheng * the new locations. 17405d4f98a2SYan Zheng */ 17413fd0a558SYan, Zheng static noinline_for_stack 17423fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 17435d4f98a2SYan Zheng struct reloc_control *rc, 17445d4f98a2SYan Zheng struct btrfs_root *root, 17453fd0a558SYan, Zheng struct extent_buffer *leaf) 17465d4f98a2SYan Zheng { 17470b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 17485d4f98a2SYan Zheng struct btrfs_key key; 17495d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 17505d4f98a2SYan Zheng struct inode *inode = NULL; 17515d4f98a2SYan Zheng u64 parent; 17525d4f98a2SYan Zheng u64 bytenr; 17533fd0a558SYan, Zheng u64 new_bytenr = 0; 17545d4f98a2SYan Zheng u64 num_bytes; 17555d4f98a2SYan Zheng u64 end; 17565d4f98a2SYan Zheng u32 nritems; 17575d4f98a2SYan Zheng u32 i; 175883d4cfd4SJosef Bacik int ret = 0; 17595d4f98a2SYan Zheng int first = 1; 17605d4f98a2SYan Zheng int dirty = 0; 17615d4f98a2SYan Zheng 17625d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 17635d4f98a2SYan Zheng return 0; 17645d4f98a2SYan Zheng 17655d4f98a2SYan Zheng /* reloc trees always use full backref */ 17665d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 17675d4f98a2SYan Zheng parent = leaf->start; 17685d4f98a2SYan Zheng else 17695d4f98a2SYan Zheng parent = 0; 17705d4f98a2SYan Zheng 17715d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 17725d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 177382fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 177482fa113fSQu Wenruo 17755d4f98a2SYan Zheng cond_resched(); 17765d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 17775d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 17785d4f98a2SYan Zheng continue; 17795d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 17805d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 17815d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 17825d4f98a2SYan Zheng continue; 17835d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 17845d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 17855d4f98a2SYan Zheng if (bytenr == 0) 17865d4f98a2SYan Zheng continue; 17875d4f98a2SYan Zheng if (!in_block_group(bytenr, rc->block_group)) 17885d4f98a2SYan Zheng continue; 17895d4f98a2SYan Zheng 17905d4f98a2SYan Zheng /* 17915d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 17925d4f98a2SYan Zheng * to complete and drop the extent cache 17935d4f98a2SYan Zheng */ 17945d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 17955d4f98a2SYan Zheng if (first) { 17965d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 17975d4f98a2SYan Zheng first = 0; 17984a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 17993fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 18005d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 18015d4f98a2SYan Zheng } 18024a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 18035d4f98a2SYan Zheng end = key.offset + 18045d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 18055d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 18060b246afaSJeff Mahoney fs_info->sectorsize)); 18070b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 18085d4f98a2SYan Zheng end--; 18095d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1810d0082371SJeff Mahoney key.offset, end); 18115d4f98a2SYan Zheng if (!ret) 18125d4f98a2SYan Zheng continue; 18135d4f98a2SYan Zheng 1814dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1815dcdbc059SNikolay Borisov key.offset, end, 1); 18165d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1817d0082371SJeff Mahoney key.offset, end); 18185d4f98a2SYan Zheng } 18195d4f98a2SYan Zheng } 18205d4f98a2SYan Zheng 18215d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 18225d4f98a2SYan Zheng bytenr, num_bytes); 182383d4cfd4SJosef Bacik if (ret) { 182483d4cfd4SJosef Bacik /* 182583d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 182683d4cfd4SJosef Bacik * in the file extent yet. 182783d4cfd4SJosef Bacik */ 182883d4cfd4SJosef Bacik break; 18293fd0a558SYan, Zheng } 18305d4f98a2SYan Zheng 18315d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 18325d4f98a2SYan Zheng dirty = 1; 18335d4f98a2SYan Zheng 18345d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 183582fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 183682fa113fSQu Wenruo num_bytes, parent); 183782fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 183882fa113fSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1839b06c4bf5SFilipe Manana key.objectid, key.offset); 184082fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 184183d4cfd4SJosef Bacik if (ret) { 184266642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 184383d4cfd4SJosef Bacik break; 184483d4cfd4SJosef Bacik } 18455d4f98a2SYan Zheng 1846ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, bytenr, 1847ffd4bb2aSQu Wenruo num_bytes, parent); 1848ffd4bb2aSQu Wenruo ref.real_root = root->root_key.objectid; 1849ffd4bb2aSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1850b06c4bf5SFilipe Manana key.objectid, key.offset); 1851ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 185283d4cfd4SJosef Bacik if (ret) { 185366642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 185483d4cfd4SJosef Bacik break; 185583d4cfd4SJosef Bacik } 18565d4f98a2SYan Zheng } 18575d4f98a2SYan Zheng if (dirty) 18585d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 18593fd0a558SYan, Zheng if (inode) 18603fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 186183d4cfd4SJosef Bacik return ret; 18625d4f98a2SYan Zheng } 18635d4f98a2SYan Zheng 18645d4f98a2SYan Zheng static noinline_for_stack 18655d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 18665d4f98a2SYan Zheng struct btrfs_path *path, int level) 18675d4f98a2SYan Zheng { 18685d4f98a2SYan Zheng struct btrfs_disk_key key1; 18695d4f98a2SYan Zheng struct btrfs_disk_key key2; 18705d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 18715d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 18725d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 18735d4f98a2SYan Zheng } 18745d4f98a2SYan Zheng 18755d4f98a2SYan Zheng /* 18765d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 18775d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 18785d4f98a2SYan Zheng * reloc tree was create can be replaced. 18795d4f98a2SYan Zheng * 18805d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 18815d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 18825d4f98a2SYan Zheng * errors, a negative error number is returned. 18835d4f98a2SYan Zheng */ 18843fd0a558SYan, Zheng static noinline_for_stack 18853d0174f7SQu Wenruo int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, 18865d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 18875d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 18885d4f98a2SYan Zheng int lowest_level, int max_level) 18895d4f98a2SYan Zheng { 18900b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 18915d4f98a2SYan Zheng struct extent_buffer *eb; 18925d4f98a2SYan Zheng struct extent_buffer *parent; 189382fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 18945d4f98a2SYan Zheng struct btrfs_key key; 18955d4f98a2SYan Zheng u64 old_bytenr; 18965d4f98a2SYan Zheng u64 new_bytenr; 18975d4f98a2SYan Zheng u64 old_ptr_gen; 18985d4f98a2SYan Zheng u64 new_ptr_gen; 18995d4f98a2SYan Zheng u64 last_snapshot; 19005d4f98a2SYan Zheng u32 blocksize; 19013fd0a558SYan, Zheng int cow = 0; 19025d4f98a2SYan Zheng int level; 19035d4f98a2SYan Zheng int ret; 19045d4f98a2SYan Zheng int slot; 19055d4f98a2SYan Zheng 19065d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 19075d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 19085d4f98a2SYan Zheng 19095d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 19103fd0a558SYan, Zheng again: 19115d4f98a2SYan Zheng slot = path->slots[lowest_level]; 19125d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 19135d4f98a2SYan Zheng 19145d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 19158bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19165d4f98a2SYan Zheng level = btrfs_header_level(eb); 19175d4f98a2SYan Zheng 19185d4f98a2SYan Zheng if (level < lowest_level) { 19195d4f98a2SYan Zheng btrfs_tree_unlock(eb); 19205d4f98a2SYan Zheng free_extent_buffer(eb); 19215d4f98a2SYan Zheng return 0; 19225d4f98a2SYan Zheng } 19235d4f98a2SYan Zheng 19243fd0a558SYan, Zheng if (cow) { 19255d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 19265d4f98a2SYan Zheng BUG_ON(ret); 19273fd0a558SYan, Zheng } 19288bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19295d4f98a2SYan Zheng 19305d4f98a2SYan Zheng if (next_key) { 19315d4f98a2SYan Zheng next_key->objectid = (u64)-1; 19325d4f98a2SYan Zheng next_key->type = (u8)-1; 19335d4f98a2SYan Zheng next_key->offset = (u64)-1; 19345d4f98a2SYan Zheng } 19355d4f98a2SYan Zheng 19365d4f98a2SYan Zheng parent = eb; 19375d4f98a2SYan Zheng while (1) { 1938581c1760SQu Wenruo struct btrfs_key first_key; 1939581c1760SQu Wenruo 19405d4f98a2SYan Zheng level = btrfs_header_level(parent); 19415d4f98a2SYan Zheng BUG_ON(level < lowest_level); 19425d4f98a2SYan Zheng 19435d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 1944cbca7d59SFilipe Manana if (ret < 0) 1945cbca7d59SFilipe Manana break; 19465d4f98a2SYan Zheng if (ret && slot > 0) 19475d4f98a2SYan Zheng slot--; 19485d4f98a2SYan Zheng 19495d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 19505d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 19515d4f98a2SYan Zheng 19525d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 19530b246afaSJeff Mahoney blocksize = fs_info->nodesize; 19545d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 195517515f1bSQu Wenruo btrfs_node_key_to_cpu(parent, &first_key, slot); 19565d4f98a2SYan Zheng 19575d4f98a2SYan Zheng if (level <= max_level) { 19585d4f98a2SYan Zheng eb = path->nodes[level]; 19595d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 19605d4f98a2SYan Zheng path->slots[level]); 19615d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 19625d4f98a2SYan Zheng path->slots[level]); 19635d4f98a2SYan Zheng } else { 19645d4f98a2SYan Zheng new_bytenr = 0; 19655d4f98a2SYan Zheng new_ptr_gen = 0; 19665d4f98a2SYan Zheng } 19675d4f98a2SYan Zheng 1968fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 19695d4f98a2SYan Zheng ret = level; 19705d4f98a2SYan Zheng break; 19715d4f98a2SYan Zheng } 19725d4f98a2SYan Zheng 19735d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 19745d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 19753fd0a558SYan, Zheng if (level <= lowest_level) { 19765d4f98a2SYan Zheng ret = 0; 19775d4f98a2SYan Zheng break; 19785d4f98a2SYan Zheng } 19795d4f98a2SYan Zheng 1980581c1760SQu Wenruo eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen, 1981581c1760SQu Wenruo level - 1, &first_key); 198264c043deSLiu Bo if (IS_ERR(eb)) { 198364c043deSLiu Bo ret = PTR_ERR(eb); 1984264813acSLiu Bo break; 198564c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 198664c043deSLiu Bo ret = -EIO; 1987416bc658SJosef Bacik free_extent_buffer(eb); 1988379cde74SStefan Behrens break; 1989416bc658SJosef Bacik } 19905d4f98a2SYan Zheng btrfs_tree_lock(eb); 19913fd0a558SYan, Zheng if (cow) { 19925d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 19935d4f98a2SYan Zheng slot, &eb); 19945d4f98a2SYan Zheng BUG_ON(ret); 19955d4f98a2SYan Zheng } 19968bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19975d4f98a2SYan Zheng 19985d4f98a2SYan Zheng btrfs_tree_unlock(parent); 19995d4f98a2SYan Zheng free_extent_buffer(parent); 20005d4f98a2SYan Zheng 20015d4f98a2SYan Zheng parent = eb; 20025d4f98a2SYan Zheng continue; 20035d4f98a2SYan Zheng } 20045d4f98a2SYan Zheng 20053fd0a558SYan, Zheng if (!cow) { 20063fd0a558SYan, Zheng btrfs_tree_unlock(parent); 20073fd0a558SYan, Zheng free_extent_buffer(parent); 20083fd0a558SYan, Zheng cow = 1; 20093fd0a558SYan, Zheng goto again; 20103fd0a558SYan, Zheng } 20113fd0a558SYan, Zheng 20125d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 20135d4f98a2SYan Zheng path->slots[level]); 2014b3b4aa74SDavid Sterba btrfs_release_path(path); 20155d4f98a2SYan Zheng 20165d4f98a2SYan Zheng path->lowest_level = level; 20175d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 20185d4f98a2SYan Zheng path->lowest_level = 0; 20195d4f98a2SYan Zheng BUG_ON(ret); 20205d4f98a2SYan Zheng 20215d4f98a2SYan Zheng /* 2022824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 2023824d8dffSQu Wenruo * 2024824d8dffSQu Wenruo * We must trace both trees. 2025824d8dffSQu Wenruo * 1) Tree reloc subtree 2026824d8dffSQu Wenruo * If not traced, we will leak data numbers 2027824d8dffSQu Wenruo * 2) Fs subtree 2028824d8dffSQu Wenruo * If not traced, we will double count old data 2029f616f5cdSQu Wenruo * 2030f616f5cdSQu Wenruo * We don't scan the subtree right now, but only record 2031f616f5cdSQu Wenruo * the swapped tree blocks. 2032f616f5cdSQu Wenruo * The real subtree rescan is delayed until we have new 2033f616f5cdSQu Wenruo * CoW on the subtree root node before transaction commit. 2034824d8dffSQu Wenruo */ 2035370a11b8SQu Wenruo ret = btrfs_qgroup_add_swapped_blocks(trans, dest, 2036370a11b8SQu Wenruo rc->block_group, parent, slot, 2037370a11b8SQu Wenruo path->nodes[level], path->slots[level], 2038370a11b8SQu Wenruo last_snapshot); 2039370a11b8SQu Wenruo if (ret < 0) 2040370a11b8SQu Wenruo break; 2041824d8dffSQu Wenruo /* 20425d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 20435d4f98a2SYan Zheng */ 20445d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 20455d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 20465d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 20475d4f98a2SYan Zheng 20485d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 20495d4f98a2SYan Zheng path->slots[level], old_bytenr); 20505d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 20515d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 20525d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 20535d4f98a2SYan Zheng 205482fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, old_bytenr, 205582fa113fSQu Wenruo blocksize, path->nodes[level]->start); 205682fa113fSQu Wenruo ref.skip_qgroup = true; 205782fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 205882fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 20595d4f98a2SYan Zheng BUG_ON(ret); 206082fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 206182fa113fSQu Wenruo blocksize, 0); 206282fa113fSQu Wenruo ref.skip_qgroup = true; 206382fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 206482fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 20655d4f98a2SYan Zheng BUG_ON(ret); 20665d4f98a2SYan Zheng 2067ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, new_bytenr, 2068ffd4bb2aSQu Wenruo blocksize, path->nodes[level]->start); 2069ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 2070ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2071ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 20725d4f98a2SYan Zheng BUG_ON(ret); 20735d4f98a2SYan Zheng 2074ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, old_bytenr, 2075ffd4bb2aSQu Wenruo blocksize, 0); 2076ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 2077ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2078ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 20795d4f98a2SYan Zheng BUG_ON(ret); 20805d4f98a2SYan Zheng 20815d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 20825d4f98a2SYan Zheng 20835d4f98a2SYan Zheng ret = level; 20845d4f98a2SYan Zheng break; 20855d4f98a2SYan Zheng } 20865d4f98a2SYan Zheng btrfs_tree_unlock(parent); 20875d4f98a2SYan Zheng free_extent_buffer(parent); 20885d4f98a2SYan Zheng return ret; 20895d4f98a2SYan Zheng } 20905d4f98a2SYan Zheng 20915d4f98a2SYan Zheng /* 20925d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 20935d4f98a2SYan Zheng */ 20945d4f98a2SYan Zheng static noinline_for_stack 20955d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 20965d4f98a2SYan Zheng int *level) 20975d4f98a2SYan Zheng { 20985d4f98a2SYan Zheng struct extent_buffer *eb; 20995d4f98a2SYan Zheng int i; 21005d4f98a2SYan Zheng u64 last_snapshot; 21015d4f98a2SYan Zheng u32 nritems; 21025d4f98a2SYan Zheng 21035d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 21045d4f98a2SYan Zheng 21055d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 21065d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 21075d4f98a2SYan Zheng path->nodes[i] = NULL; 21085d4f98a2SYan Zheng } 21095d4f98a2SYan Zheng 21105d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 21115d4f98a2SYan Zheng eb = path->nodes[i]; 21125d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 21135d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 21145d4f98a2SYan Zheng path->slots[i]++; 21155d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 21165d4f98a2SYan Zheng last_snapshot) 21175d4f98a2SYan Zheng continue; 21185d4f98a2SYan Zheng 21195d4f98a2SYan Zheng *level = i; 21205d4f98a2SYan Zheng return 0; 21215d4f98a2SYan Zheng } 21225d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 21235d4f98a2SYan Zheng path->nodes[i] = NULL; 21245d4f98a2SYan Zheng } 21255d4f98a2SYan Zheng return 1; 21265d4f98a2SYan Zheng } 21275d4f98a2SYan Zheng 21285d4f98a2SYan Zheng /* 21295d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 21305d4f98a2SYan Zheng */ 21315d4f98a2SYan Zheng static noinline_for_stack 21325d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 21335d4f98a2SYan Zheng int *level) 21345d4f98a2SYan Zheng { 21352ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 21365d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 21375d4f98a2SYan Zheng int i; 21385d4f98a2SYan Zheng u64 bytenr; 21395d4f98a2SYan Zheng u64 ptr_gen = 0; 21405d4f98a2SYan Zheng u64 last_snapshot; 21415d4f98a2SYan Zheng u32 nritems; 21425d4f98a2SYan Zheng 21435d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 21445d4f98a2SYan Zheng 21455d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 2146581c1760SQu Wenruo struct btrfs_key first_key; 2147581c1760SQu Wenruo 21485d4f98a2SYan Zheng eb = path->nodes[i]; 21495d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 21505d4f98a2SYan Zheng while (path->slots[i] < nritems) { 21515d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 21525d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 21535d4f98a2SYan Zheng break; 21545d4f98a2SYan Zheng path->slots[i]++; 21555d4f98a2SYan Zheng } 21565d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 21575d4f98a2SYan Zheng if (i == *level) 21585d4f98a2SYan Zheng break; 21595d4f98a2SYan Zheng *level = i + 1; 21605d4f98a2SYan Zheng return 0; 21615d4f98a2SYan Zheng } 21625d4f98a2SYan Zheng if (i == 1) { 21635d4f98a2SYan Zheng *level = i; 21645d4f98a2SYan Zheng return 0; 21655d4f98a2SYan Zheng } 21665d4f98a2SYan Zheng 21675d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2168581c1760SQu Wenruo btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); 2169581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1, 2170581c1760SQu Wenruo &first_key); 217164c043deSLiu Bo if (IS_ERR(eb)) { 217264c043deSLiu Bo return PTR_ERR(eb); 217364c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2174416bc658SJosef Bacik free_extent_buffer(eb); 2175416bc658SJosef Bacik return -EIO; 2176416bc658SJosef Bacik } 21775d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 21785d4f98a2SYan Zheng path->nodes[i - 1] = eb; 21795d4f98a2SYan Zheng path->slots[i - 1] = 0; 21805d4f98a2SYan Zheng } 21815d4f98a2SYan Zheng return 1; 21825d4f98a2SYan Zheng } 21835d4f98a2SYan Zheng 21845d4f98a2SYan Zheng /* 21855d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 21865d4f98a2SYan Zheng * [min_key, max_key) 21875d4f98a2SYan Zheng */ 21885d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 21895d4f98a2SYan Zheng struct btrfs_key *min_key, 21905d4f98a2SYan Zheng struct btrfs_key *max_key) 21915d4f98a2SYan Zheng { 21920b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 21935d4f98a2SYan Zheng struct inode *inode = NULL; 21945d4f98a2SYan Zheng u64 objectid; 21955d4f98a2SYan Zheng u64 start, end; 219633345d01SLi Zefan u64 ino; 21975d4f98a2SYan Zheng 21985d4f98a2SYan Zheng objectid = min_key->objectid; 21995d4f98a2SYan Zheng while (1) { 22005d4f98a2SYan Zheng cond_resched(); 22015d4f98a2SYan Zheng iput(inode); 22025d4f98a2SYan Zheng 22035d4f98a2SYan Zheng if (objectid > max_key->objectid) 22045d4f98a2SYan Zheng break; 22055d4f98a2SYan Zheng 22065d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 22075d4f98a2SYan Zheng if (!inode) 22085d4f98a2SYan Zheng break; 22094a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 22105d4f98a2SYan Zheng 221133345d01SLi Zefan if (ino > max_key->objectid) { 22125d4f98a2SYan Zheng iput(inode); 22135d4f98a2SYan Zheng break; 22145d4f98a2SYan Zheng } 22155d4f98a2SYan Zheng 221633345d01SLi Zefan objectid = ino + 1; 22175d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 22185d4f98a2SYan Zheng continue; 22195d4f98a2SYan Zheng 222033345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 22215d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 22225d4f98a2SYan Zheng continue; 22235d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 22245d4f98a2SYan Zheng start = 0; 22255d4f98a2SYan Zheng else { 22265d4f98a2SYan Zheng start = min_key->offset; 22270b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 22285d4f98a2SYan Zheng } 22295d4f98a2SYan Zheng } else { 22305d4f98a2SYan Zheng start = 0; 22315d4f98a2SYan Zheng } 22325d4f98a2SYan Zheng 223333345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 22345d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 22355d4f98a2SYan Zheng continue; 22365d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 22375d4f98a2SYan Zheng end = (u64)-1; 22385d4f98a2SYan Zheng } else { 22395d4f98a2SYan Zheng if (max_key->offset == 0) 22405d4f98a2SYan Zheng continue; 22415d4f98a2SYan Zheng end = max_key->offset; 22420b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 22435d4f98a2SYan Zheng end--; 22445d4f98a2SYan Zheng } 22455d4f98a2SYan Zheng } else { 22465d4f98a2SYan Zheng end = (u64)-1; 22475d4f98a2SYan Zheng } 22485d4f98a2SYan Zheng 22495d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2250d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 2251dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 2252d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 22535d4f98a2SYan Zheng } 22545d4f98a2SYan Zheng return 0; 22555d4f98a2SYan Zheng } 22565d4f98a2SYan Zheng 22575d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 22585d4f98a2SYan Zheng struct btrfs_key *key) 22595d4f98a2SYan Zheng 22605d4f98a2SYan Zheng { 22615d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 22625d4f98a2SYan Zheng if (!path->nodes[level]) 22635d4f98a2SYan Zheng break; 22645d4f98a2SYan Zheng if (path->slots[level] + 1 < 22655d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 22665d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 22675d4f98a2SYan Zheng path->slots[level] + 1); 22685d4f98a2SYan Zheng return 0; 22695d4f98a2SYan Zheng } 22705d4f98a2SYan Zheng level++; 22715d4f98a2SYan Zheng } 22725d4f98a2SYan Zheng return 1; 22735d4f98a2SYan Zheng } 22745d4f98a2SYan Zheng 22755d4f98a2SYan Zheng /* 2276d2311e69SQu Wenruo * Insert current subvolume into reloc_control::dirty_subvol_roots 2277d2311e69SQu Wenruo */ 2278d2311e69SQu Wenruo static void insert_dirty_subvol(struct btrfs_trans_handle *trans, 2279d2311e69SQu Wenruo struct reloc_control *rc, 2280d2311e69SQu Wenruo struct btrfs_root *root) 2281d2311e69SQu Wenruo { 2282d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2283d2311e69SQu Wenruo struct btrfs_root_item *reloc_root_item; 2284d2311e69SQu Wenruo 2285d2311e69SQu Wenruo /* @root must be a subvolume tree root with a valid reloc tree */ 2286d2311e69SQu Wenruo ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 2287d2311e69SQu Wenruo ASSERT(reloc_root); 2288d2311e69SQu Wenruo 2289d2311e69SQu Wenruo reloc_root_item = &reloc_root->root_item; 2290d2311e69SQu Wenruo memset(&reloc_root_item->drop_progress, 0, 2291d2311e69SQu Wenruo sizeof(reloc_root_item->drop_progress)); 2292d2311e69SQu Wenruo reloc_root_item->drop_level = 0; 2293d2311e69SQu Wenruo btrfs_set_root_refs(reloc_root_item, 0); 2294d2311e69SQu Wenruo btrfs_update_reloc_root(trans, root); 2295d2311e69SQu Wenruo 2296d2311e69SQu Wenruo if (list_empty(&root->reloc_dirty_list)) { 229700246528SJosef Bacik btrfs_grab_root(root); 2298d2311e69SQu Wenruo list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); 2299d2311e69SQu Wenruo } 2300d2311e69SQu Wenruo } 2301d2311e69SQu Wenruo 2302d2311e69SQu Wenruo static int clean_dirty_subvols(struct reloc_control *rc) 2303d2311e69SQu Wenruo { 2304d2311e69SQu Wenruo struct btrfs_root *root; 2305d2311e69SQu Wenruo struct btrfs_root *next; 2306d2311e69SQu Wenruo int ret = 0; 230730d40577SQu Wenruo int ret2; 2308d2311e69SQu Wenruo 2309d2311e69SQu Wenruo list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, 2310d2311e69SQu Wenruo reloc_dirty_list) { 231130d40577SQu Wenruo if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 231230d40577SQu Wenruo /* Merged subvolume, cleanup its reloc root */ 2313d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2314d2311e69SQu Wenruo 2315d2311e69SQu Wenruo list_del_init(&root->reloc_dirty_list); 2316d2311e69SQu Wenruo root->reloc_root = NULL; 23176282675eSQu Wenruo /* 23186282675eSQu Wenruo * Need barrier to ensure clear_bit() only happens after 23196282675eSQu Wenruo * root->reloc_root = NULL. Pairs with have_reloc_root. 23206282675eSQu Wenruo */ 23216282675eSQu Wenruo smp_wmb(); 23221fac4a54SQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 2323f28de8d8SJosef Bacik if (reloc_root) { 2324f44deb74SJosef Bacik /* 2325f44deb74SJosef Bacik * btrfs_drop_snapshot drops our ref we hold for 2326f44deb74SJosef Bacik * ->reloc_root. If it fails however we must 2327f44deb74SJosef Bacik * drop the ref ourselves. 2328f44deb74SJosef Bacik */ 2329f28de8d8SJosef Bacik ret2 = btrfs_drop_snapshot(reloc_root, 0, 1); 2330f44deb74SJosef Bacik if (ret2 < 0) { 2331f44deb74SJosef Bacik btrfs_put_root(reloc_root); 2332f44deb74SJosef Bacik if (!ret) 2333f28de8d8SJosef Bacik ret = ret2; 2334f28de8d8SJosef Bacik } 2335f44deb74SJosef Bacik } 233600246528SJosef Bacik btrfs_put_root(root); 233730d40577SQu Wenruo } else { 233830d40577SQu Wenruo /* Orphan reloc tree, just clean it up */ 23390078a9f9SNikolay Borisov ret2 = btrfs_drop_snapshot(root, 0, 1); 2340f44deb74SJosef Bacik if (ret2 < 0) { 2341f44deb74SJosef Bacik btrfs_put_root(root); 2342f44deb74SJosef Bacik if (!ret) 234330d40577SQu Wenruo ret = ret2; 234430d40577SQu Wenruo } 2345d2311e69SQu Wenruo } 2346f44deb74SJosef Bacik } 2347d2311e69SQu Wenruo return ret; 2348d2311e69SQu Wenruo } 2349d2311e69SQu Wenruo 2350d2311e69SQu Wenruo /* 23515d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 23525d4f98a2SYan Zheng * fs tree. 23535d4f98a2SYan Zheng */ 23545d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 23555d4f98a2SYan Zheng struct btrfs_root *root) 23565d4f98a2SYan Zheng { 23570b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 23585d4f98a2SYan Zheng struct btrfs_key key; 23595d4f98a2SYan Zheng struct btrfs_key next_key; 23609e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 23615d4f98a2SYan Zheng struct btrfs_root *reloc_root; 23625d4f98a2SYan Zheng struct btrfs_root_item *root_item; 23635d4f98a2SYan Zheng struct btrfs_path *path; 23643fd0a558SYan, Zheng struct extent_buffer *leaf; 23655d4f98a2SYan Zheng int level; 23665d4f98a2SYan Zheng int max_level; 23675d4f98a2SYan Zheng int replaced = 0; 23685d4f98a2SYan Zheng int ret; 23695d4f98a2SYan Zheng int err = 0; 23703fd0a558SYan, Zheng u32 min_reserved; 23715d4f98a2SYan Zheng 23725d4f98a2SYan Zheng path = btrfs_alloc_path(); 23735d4f98a2SYan Zheng if (!path) 23745d4f98a2SYan Zheng return -ENOMEM; 2375e4058b54SDavid Sterba path->reada = READA_FORWARD; 23765d4f98a2SYan Zheng 23775d4f98a2SYan Zheng reloc_root = root->reloc_root; 23785d4f98a2SYan Zheng root_item = &reloc_root->root_item; 23795d4f98a2SYan Zheng 23805d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 23815d4f98a2SYan Zheng level = btrfs_root_level(root_item); 238267439dadSDavid Sterba atomic_inc(&reloc_root->node->refs); 23835d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 23845d4f98a2SYan Zheng path->slots[level] = 0; 23855d4f98a2SYan Zheng } else { 23865d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 23875d4f98a2SYan Zheng 23885d4f98a2SYan Zheng level = root_item->drop_level; 23895d4f98a2SYan Zheng BUG_ON(level == 0); 23905d4f98a2SYan Zheng path->lowest_level = level; 23915d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 239233c66f43SYan Zheng path->lowest_level = 0; 23935d4f98a2SYan Zheng if (ret < 0) { 23945d4f98a2SYan Zheng btrfs_free_path(path); 23955d4f98a2SYan Zheng return ret; 23965d4f98a2SYan Zheng } 23975d4f98a2SYan Zheng 23985d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 23995d4f98a2SYan Zheng path->slots[level]); 24005d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 24015d4f98a2SYan Zheng 24025d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 24035d4f98a2SYan Zheng } 24045d4f98a2SYan Zheng 24050b246afaSJeff Mahoney min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 24065d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 24075d4f98a2SYan Zheng 24085d4f98a2SYan Zheng while (1) { 240908e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 241008e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 24113fd0a558SYan, Zheng if (ret) { 24129e6a0c52SJosef Bacik err = ret; 24139e6a0c52SJosef Bacik goto out; 24143fd0a558SYan, Zheng } 24159e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 24169e6a0c52SJosef Bacik if (IS_ERR(trans)) { 24179e6a0c52SJosef Bacik err = PTR_ERR(trans); 24189e6a0c52SJosef Bacik trans = NULL; 24199e6a0c52SJosef Bacik goto out; 24209e6a0c52SJosef Bacik } 24212abc726aSJosef Bacik 24222abc726aSJosef Bacik /* 24232abc726aSJosef Bacik * At this point we no longer have a reloc_control, so we can't 24242abc726aSJosef Bacik * depend on btrfs_init_reloc_root to update our last_trans. 24252abc726aSJosef Bacik * 24262abc726aSJosef Bacik * But that's ok, we started the trans handle on our 24272abc726aSJosef Bacik * corresponding fs_root, which means it's been added to the 24282abc726aSJosef Bacik * dirty list. At commit time we'll still call 24292abc726aSJosef Bacik * btrfs_update_reloc_root() and update our root item 24302abc726aSJosef Bacik * appropriately. 24312abc726aSJosef Bacik */ 24322abc726aSJosef Bacik reloc_root->last_trans = trans->transid; 24339e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 24343fd0a558SYan, Zheng 24353fd0a558SYan, Zheng replaced = 0; 24365d4f98a2SYan Zheng max_level = level; 24375d4f98a2SYan Zheng 24385d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 24395d4f98a2SYan Zheng if (ret < 0) { 24405d4f98a2SYan Zheng err = ret; 24415d4f98a2SYan Zheng goto out; 24425d4f98a2SYan Zheng } 24435d4f98a2SYan Zheng if (ret > 0) 24445d4f98a2SYan Zheng break; 24455d4f98a2SYan Zheng 24465d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 24475d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 24485d4f98a2SYan Zheng ret = 0; 24495d4f98a2SYan Zheng } else { 24503d0174f7SQu Wenruo ret = replace_path(trans, rc, root, reloc_root, path, 24513fd0a558SYan, Zheng &next_key, level, max_level); 24525d4f98a2SYan Zheng } 24535d4f98a2SYan Zheng if (ret < 0) { 24545d4f98a2SYan Zheng err = ret; 24555d4f98a2SYan Zheng goto out; 24565d4f98a2SYan Zheng } 24575d4f98a2SYan Zheng 24585d4f98a2SYan Zheng if (ret > 0) { 24595d4f98a2SYan Zheng level = ret; 24605d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 24615d4f98a2SYan Zheng path->slots[level]); 24625d4f98a2SYan Zheng replaced = 1; 24635d4f98a2SYan Zheng } 24645d4f98a2SYan Zheng 24655d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 24665d4f98a2SYan Zheng if (ret > 0) 24675d4f98a2SYan Zheng break; 24685d4f98a2SYan Zheng 24695d4f98a2SYan Zheng BUG_ON(level == 0); 24705d4f98a2SYan Zheng /* 24715d4f98a2SYan Zheng * save the merging progress in the drop_progress. 24725d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 24735d4f98a2SYan Zheng */ 24745d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 24755d4f98a2SYan Zheng path->slots[level]); 24765d4f98a2SYan Zheng root_item->drop_level = level; 24775d4f98a2SYan Zheng 24783a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 24799e6a0c52SJosef Bacik trans = NULL; 24805d4f98a2SYan Zheng 24812ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 24825d4f98a2SYan Zheng 24835d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 24845d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 24855d4f98a2SYan Zheng } 24865d4f98a2SYan Zheng 24875d4f98a2SYan Zheng /* 24885d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 24895d4f98a2SYan Zheng * relocated and the block is tree root. 24905d4f98a2SYan Zheng */ 24915d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 24925d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 24935d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 24945d4f98a2SYan Zheng free_extent_buffer(leaf); 24955d4f98a2SYan Zheng if (ret < 0) 24965d4f98a2SYan Zheng err = ret; 24975d4f98a2SYan Zheng out: 24985d4f98a2SYan Zheng btrfs_free_path(path); 24995d4f98a2SYan Zheng 2500d2311e69SQu Wenruo if (err == 0) 2501d2311e69SQu Wenruo insert_dirty_subvol(trans, rc, root); 25025d4f98a2SYan Zheng 25039e6a0c52SJosef Bacik if (trans) 25043a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 25055d4f98a2SYan Zheng 25062ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 25075d4f98a2SYan Zheng 25085d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 25095d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 25105d4f98a2SYan Zheng 25115d4f98a2SYan Zheng return err; 25125d4f98a2SYan Zheng } 25135d4f98a2SYan Zheng 25143fd0a558SYan, Zheng static noinline_for_stack 25153fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 25165d4f98a2SYan Zheng { 25173fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 25180b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 25193fd0a558SYan, Zheng struct btrfs_root *reloc_root; 25205d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 25213fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 25223fd0a558SYan, Zheng u64 num_bytes = 0; 25233fd0a558SYan, Zheng int ret; 25243fd0a558SYan, Zheng 25250b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 25260b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 25273fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 25280b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 25297585717fSChris Mason 25303fd0a558SYan, Zheng again: 25313fd0a558SYan, Zheng if (!err) { 25323fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 253308e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 253408e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 25353fd0a558SYan, Zheng if (ret) 25363fd0a558SYan, Zheng err = ret; 25373fd0a558SYan, Zheng } 25383fd0a558SYan, Zheng 25397a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 25403612b495STsutomu Itoh if (IS_ERR(trans)) { 25413612b495STsutomu Itoh if (!err) 25422ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 254363f018beSNikolay Borisov num_bytes, NULL); 25443612b495STsutomu Itoh return PTR_ERR(trans); 25453612b495STsutomu Itoh } 25463fd0a558SYan, Zheng 25473fd0a558SYan, Zheng if (!err) { 25483fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 25493a45bb20SJeff Mahoney btrfs_end_transaction(trans); 25502ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 255163f018beSNikolay Borisov num_bytes, NULL); 25523fd0a558SYan, Zheng goto again; 25533fd0a558SYan, Zheng } 25543fd0a558SYan, Zheng } 25553fd0a558SYan, Zheng 25563fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 25573fd0a558SYan, Zheng 25583fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 25593fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 25603fd0a558SYan, Zheng struct btrfs_root, root_list); 25613fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 25623fd0a558SYan, Zheng 25630b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 25643fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 25653fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 25663fd0a558SYan, Zheng 25673fd0a558SYan, Zheng /* 25683fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 25693fd0a558SYan, Zheng * knows it should resumes merging 25703fd0a558SYan, Zheng */ 25713fd0a558SYan, Zheng if (!err) 25723fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 25733fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 25743fd0a558SYan, Zheng 25753fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 257600246528SJosef Bacik btrfs_put_root(root); 25773fd0a558SYan, Zheng } 25783fd0a558SYan, Zheng 25793fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 25803fd0a558SYan, Zheng 25813fd0a558SYan, Zheng if (!err) 25823a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 25833fd0a558SYan, Zheng else 25843a45bb20SJeff Mahoney btrfs_end_transaction(trans); 25853fd0a558SYan, Zheng return err; 25863fd0a558SYan, Zheng } 25873fd0a558SYan, Zheng 25883fd0a558SYan, Zheng static noinline_for_stack 2589aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2590aca1bba6SLiu Bo { 2591aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2592aca1bba6SLiu Bo 2593aca1bba6SLiu Bo while (!list_empty(list)) { 2594aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2595aca1bba6SLiu Bo root_list); 2596bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 2597aca1bba6SLiu Bo } 2598aca1bba6SLiu Bo } 2599aca1bba6SLiu Bo 2600aca1bba6SLiu Bo static noinline_for_stack 260194404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 26023fd0a558SYan, Zheng { 26030b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 26045d4f98a2SYan Zheng struct btrfs_root *root; 26055d4f98a2SYan Zheng struct btrfs_root *reloc_root; 26063fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 26073fd0a558SYan, Zheng int found = 0; 2608aca1bba6SLiu Bo int ret = 0; 26093fd0a558SYan, Zheng again: 26103fd0a558SYan, Zheng root = rc->extent_root; 26117585717fSChris Mason 26127585717fSChris Mason /* 26137585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 26147585717fSChris Mason * we have to make sure nobody is in the middle of 26157585717fSChris Mason * adding their roots to the list while we are 26167585717fSChris Mason * doing this splice 26177585717fSChris Mason */ 26180b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 26193fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 26200b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 26215d4f98a2SYan Zheng 26223fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 26233fd0a558SYan, Zheng found = 1; 26243fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 26253fd0a558SYan, Zheng struct btrfs_root, root_list); 26265d4f98a2SYan Zheng 26275d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 26280b246afaSJeff Mahoney root = read_fs_root(fs_info, 26295d4f98a2SYan Zheng reloc_root->root_key.offset); 26305d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 26315d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 26325d4f98a2SYan Zheng 26333fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 263400246528SJosef Bacik btrfs_put_root(root); 2635b37b39cdSJosef Bacik if (ret) { 263625e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 263725e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 263825e293c2SWang Shilong &reloc_roots); 2639aca1bba6SLiu Bo goto out; 2640b37b39cdSJosef Bacik } 26413fd0a558SYan, Zheng } else { 26423fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 264330d40577SQu Wenruo /* Don't forget to queue this reloc root for cleanup */ 264430d40577SQu Wenruo list_add_tail(&reloc_root->reloc_dirty_list, 264530d40577SQu Wenruo &rc->dirty_subvol_roots); 26463fd0a558SYan, Zheng } 26475d4f98a2SYan Zheng } 26485d4f98a2SYan Zheng 26493fd0a558SYan, Zheng if (found) { 26503fd0a558SYan, Zheng found = 0; 26513fd0a558SYan, Zheng goto again; 26525d4f98a2SYan Zheng } 2653aca1bba6SLiu Bo out: 2654aca1bba6SLiu Bo if (ret) { 26550b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2656aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2657aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2658467bb1d2SWang Shilong 2659467bb1d2SWang Shilong /* new reloc root may be added */ 26600b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2661467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 26620b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2663467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2664467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2665aca1bba6SLiu Bo } 2666aca1bba6SLiu Bo 26677b7b7431SJosef Bacik /* 26687b7b7431SJosef Bacik * We used to have 26697b7b7431SJosef Bacik * 26707b7b7431SJosef Bacik * BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 26717b7b7431SJosef Bacik * 26727b7b7431SJosef Bacik * here, but it's wrong. If we fail to start the transaction in 26737b7b7431SJosef Bacik * prepare_to_merge() we will have only 0 ref reloc roots, none of which 26747b7b7431SJosef Bacik * have actually been removed from the reloc_root_tree rb tree. This is 26757b7b7431SJosef Bacik * fine because we're bailing here, and we hold a reference on the root 26767b7b7431SJosef Bacik * for the list that holds it, so these roots will be cleaned up when we 26777b7b7431SJosef Bacik * do the reloc_dirty_list afterwards. Meanwhile the root->reloc_root 26787b7b7431SJosef Bacik * will be cleaned up on unmount. 26797b7b7431SJosef Bacik * 26807b7b7431SJosef Bacik * The remaining nodes will be cleaned up by free_reloc_control. 26817b7b7431SJosef Bacik */ 26825d4f98a2SYan Zheng } 26835d4f98a2SYan Zheng 26845d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 26855d4f98a2SYan Zheng { 26865d4f98a2SYan Zheng struct tree_block *block; 26875d4f98a2SYan Zheng struct rb_node *rb_node; 26885d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 26895d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 26905d4f98a2SYan Zheng rb_erase(rb_node, blocks); 26915d4f98a2SYan Zheng kfree(block); 26925d4f98a2SYan Zheng } 26935d4f98a2SYan Zheng } 26945d4f98a2SYan Zheng 26955d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 26965d4f98a2SYan Zheng struct btrfs_root *reloc_root) 26975d4f98a2SYan Zheng { 26980b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 26995d4f98a2SYan Zheng struct btrfs_root *root; 2700442b1ac5SJosef Bacik int ret; 27015d4f98a2SYan Zheng 27025d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 27035d4f98a2SYan Zheng return 0; 27045d4f98a2SYan Zheng 27050b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 27065d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 27075d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 2708442b1ac5SJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 270900246528SJosef Bacik btrfs_put_root(root); 27105d4f98a2SYan Zheng 2711442b1ac5SJosef Bacik return ret; 27125d4f98a2SYan Zheng } 27135d4f98a2SYan Zheng 27143fd0a558SYan, Zheng static noinline_for_stack 27153fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 27163fd0a558SYan, Zheng struct reloc_control *rc, 27175d4f98a2SYan Zheng struct backref_node *node, 2718dc4103f9SWang Shilong struct backref_edge *edges[]) 27195d4f98a2SYan Zheng { 27205d4f98a2SYan Zheng struct backref_node *next; 27215d4f98a2SYan Zheng struct btrfs_root *root; 27223fd0a558SYan, Zheng int index = 0; 27233fd0a558SYan, Zheng 27245d4f98a2SYan Zheng next = node; 27255d4f98a2SYan Zheng while (1) { 27265d4f98a2SYan Zheng cond_resched(); 27275d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 27285d4f98a2SYan Zheng root = next->root; 27293fd0a558SYan, Zheng BUG_ON(!root); 273027cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 27315d4f98a2SYan Zheng 27325d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 27335d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 27345d4f98a2SYan Zheng break; 27355d4f98a2SYan Zheng } 27365d4f98a2SYan Zheng 27375d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 27383fd0a558SYan, Zheng root = root->reloc_root; 27393fd0a558SYan, Zheng 27403fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 27413fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 27423fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 27433fd0a558SYan, Zheng next->new_bytenr = root->node->start; 274400246528SJosef Bacik btrfs_put_root(next->root); 274500246528SJosef Bacik next->root = btrfs_grab_root(root); 27460b530bc5SJosef Bacik ASSERT(next->root); 27473fd0a558SYan, Zheng list_add_tail(&next->list, 27483fd0a558SYan, Zheng &rc->backref_cache.changed); 27493fd0a558SYan, Zheng __mark_block_processed(rc, next); 27505d4f98a2SYan Zheng break; 27515d4f98a2SYan Zheng } 27525d4f98a2SYan Zheng 27533fd0a558SYan, Zheng WARN_ON(1); 27545d4f98a2SYan Zheng root = NULL; 27555d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 27565d4f98a2SYan Zheng if (!next || next->level <= node->level) 27575d4f98a2SYan Zheng break; 27585d4f98a2SYan Zheng } 27593fd0a558SYan, Zheng if (!root) 27603fd0a558SYan, Zheng return NULL; 27615d4f98a2SYan Zheng 27623fd0a558SYan, Zheng next = node; 27633fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 27643fd0a558SYan, Zheng while (1) { 27653fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 27663fd0a558SYan, Zheng if (--index < 0) 27673fd0a558SYan, Zheng break; 27683fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 27693fd0a558SYan, Zheng } 27705d4f98a2SYan Zheng return root; 27715d4f98a2SYan Zheng } 27725d4f98a2SYan Zheng 27733fd0a558SYan, Zheng /* 27743fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 27753fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 27763fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 27773fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 27783fd0a558SYan, Zheng */ 27795d4f98a2SYan Zheng static noinline_for_stack 2780147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 27815d4f98a2SYan Zheng { 27823fd0a558SYan, Zheng struct backref_node *next; 27833fd0a558SYan, Zheng struct btrfs_root *root; 27843fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 27855d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 27863fd0a558SYan, Zheng int index = 0; 27873fd0a558SYan, Zheng 27883fd0a558SYan, Zheng next = node; 27893fd0a558SYan, Zheng while (1) { 27903fd0a558SYan, Zheng cond_resched(); 27913fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 27923fd0a558SYan, Zheng root = next->root; 27933fd0a558SYan, Zheng BUG_ON(!root); 27943fd0a558SYan, Zheng 279525985edcSLucas De Marchi /* no other choice for non-references counted tree */ 279627cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 27973fd0a558SYan, Zheng return root; 27983fd0a558SYan, Zheng 27993fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 28003fd0a558SYan, Zheng fs_root = root; 28013fd0a558SYan, Zheng 28023fd0a558SYan, Zheng if (next != node) 28033fd0a558SYan, Zheng return NULL; 28043fd0a558SYan, Zheng 28053fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 28063fd0a558SYan, Zheng if (!next || next->level <= node->level) 28073fd0a558SYan, Zheng break; 28083fd0a558SYan, Zheng } 28093fd0a558SYan, Zheng 28103fd0a558SYan, Zheng if (!fs_root) 28113fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 28123fd0a558SYan, Zheng return fs_root; 28135d4f98a2SYan Zheng } 28145d4f98a2SYan Zheng 28155d4f98a2SYan Zheng static noinline_for_stack 28163fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 28173fd0a558SYan, Zheng struct backref_node *node, int reserve) 28185d4f98a2SYan Zheng { 28190b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 28203fd0a558SYan, Zheng struct backref_node *next = node; 28213fd0a558SYan, Zheng struct backref_edge *edge; 28223fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28233fd0a558SYan, Zheng u64 num_bytes = 0; 28243fd0a558SYan, Zheng int index = 0; 28255d4f98a2SYan Zheng 28263fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 28273fd0a558SYan, Zheng 28283fd0a558SYan, Zheng while (next) { 28293fd0a558SYan, Zheng cond_resched(); 28305d4f98a2SYan Zheng while (1) { 28313fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 28325d4f98a2SYan Zheng break; 28335d4f98a2SYan Zheng 28340b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 28353fd0a558SYan, Zheng 28363fd0a558SYan, Zheng if (list_empty(&next->upper)) 28373fd0a558SYan, Zheng break; 28383fd0a558SYan, Zheng 28393fd0a558SYan, Zheng edge = list_entry(next->upper.next, 28403fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 28413fd0a558SYan, Zheng edges[index++] = edge; 28423fd0a558SYan, Zheng next = edge->node[UPPER]; 28435d4f98a2SYan Zheng } 28443fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 28453fd0a558SYan, Zheng } 28463fd0a558SYan, Zheng return num_bytes; 28473fd0a558SYan, Zheng } 28483fd0a558SYan, Zheng 28493fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 28503fd0a558SYan, Zheng struct reloc_control *rc, 28513fd0a558SYan, Zheng struct backref_node *node) 28523fd0a558SYan, Zheng { 28533fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2854da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 28553fd0a558SYan, Zheng u64 num_bytes; 28563fd0a558SYan, Zheng int ret; 28570647bf56SWang Shilong u64 tmp; 28583fd0a558SYan, Zheng 28593fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 28603fd0a558SYan, Zheng 28613fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 28620647bf56SWang Shilong rc->reserved_bytes += num_bytes; 28638ca17f0fSJosef Bacik 28648ca17f0fSJosef Bacik /* 28658ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 28668ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 28678ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 28688ca17f0fSJosef Bacik */ 28690647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 28708ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 28713fd0a558SYan, Zheng if (ret) { 2872da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 28730647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 28740647bf56SWang Shilong tmp <<= 1; 28750647bf56SWang Shilong /* 28760647bf56SWang Shilong * only one thread can access block_rsv at this point, 28770647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 28780647bf56SWang Shilong * we expand more reservation size here to allow enough 287952042d8eSAndrea Gelmini * space for relocation and we will return earlier in 28800647bf56SWang Shilong * enospc case. 28810647bf56SWang Shilong */ 2882da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 28830647bf56SWang Shilong RELOCATION_RESERVED_NODES; 28848ca17f0fSJosef Bacik return -EAGAIN; 28853fd0a558SYan, Zheng } 28863fd0a558SYan, Zheng 28873fd0a558SYan, Zheng return 0; 28883fd0a558SYan, Zheng } 28893fd0a558SYan, Zheng 28905d4f98a2SYan Zheng /* 28915d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 28925d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 28935d4f98a2SYan Zheng * 28945d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 28955d4f98a2SYan Zheng * in that case this function just updates pointers. 28965d4f98a2SYan Zheng */ 28975d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 28983fd0a558SYan, Zheng struct reloc_control *rc, 28995d4f98a2SYan Zheng struct backref_node *node, 29005d4f98a2SYan Zheng struct btrfs_key *key, 29015d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 29025d4f98a2SYan Zheng { 29032ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 29045d4f98a2SYan Zheng struct backref_node *upper; 29055d4f98a2SYan Zheng struct backref_edge *edge; 29065d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 29075d4f98a2SYan Zheng struct btrfs_root *root; 29085d4f98a2SYan Zheng struct extent_buffer *eb; 29095d4f98a2SYan Zheng u32 blocksize; 29105d4f98a2SYan Zheng u64 bytenr; 29115d4f98a2SYan Zheng u64 generation; 29125d4f98a2SYan Zheng int slot; 29135d4f98a2SYan Zheng int ret; 29145d4f98a2SYan Zheng int err = 0; 29155d4f98a2SYan Zheng 29165d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 29175d4f98a2SYan Zheng 29185d4f98a2SYan Zheng path->lowest_level = node->level + 1; 29193fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 29205d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 2921581c1760SQu Wenruo struct btrfs_key first_key; 292282fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 2923581c1760SQu Wenruo 29245d4f98a2SYan Zheng cond_resched(); 29255d4f98a2SYan Zheng 29265d4f98a2SYan Zheng upper = edge->node[UPPER]; 2927dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 29283fd0a558SYan, Zheng BUG_ON(!root); 29295d4f98a2SYan Zheng 29303fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 29313fd0a558SYan, Zheng if (!lowest) { 29323fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 29333fd0a558SYan, Zheng upper->level, &slot); 2934cbca7d59SFilipe Manana if (ret < 0) { 2935cbca7d59SFilipe Manana err = ret; 2936cbca7d59SFilipe Manana goto next; 2937cbca7d59SFilipe Manana } 29383fd0a558SYan, Zheng BUG_ON(ret); 29393fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 29403fd0a558SYan, Zheng if (node->eb->start == bytenr) 29413fd0a558SYan, Zheng goto next; 29423fd0a558SYan, Zheng } 29435d4f98a2SYan Zheng drop_node_buffer(upper); 29443fd0a558SYan, Zheng } 29455d4f98a2SYan Zheng 29465d4f98a2SYan Zheng if (!upper->eb) { 29475d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 29483561b9dbSLiu Bo if (ret) { 29493561b9dbSLiu Bo if (ret < 0) 29505d4f98a2SYan Zheng err = ret; 29513561b9dbSLiu Bo else 29523561b9dbSLiu Bo err = -ENOENT; 29533561b9dbSLiu Bo 29543561b9dbSLiu Bo btrfs_release_path(path); 29555d4f98a2SYan Zheng break; 29565d4f98a2SYan Zheng } 29575d4f98a2SYan Zheng 29583fd0a558SYan, Zheng if (!upper->eb) { 29593fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 29603fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 29613fd0a558SYan, Zheng } else { 29623fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 29633fd0a558SYan, Zheng } 29643fd0a558SYan, Zheng 29653fd0a558SYan, Zheng upper->locked = 1; 29663fd0a558SYan, Zheng path->locks[upper->level] = 0; 29673fd0a558SYan, Zheng 29685d4f98a2SYan Zheng slot = path->slots[upper->level]; 2969b3b4aa74SDavid Sterba btrfs_release_path(path); 29705d4f98a2SYan Zheng } else { 29715d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 29725d4f98a2SYan Zheng &slot); 2973cbca7d59SFilipe Manana if (ret < 0) { 2974cbca7d59SFilipe Manana err = ret; 2975cbca7d59SFilipe Manana goto next; 2976cbca7d59SFilipe Manana } 29775d4f98a2SYan Zheng BUG_ON(ret); 29785d4f98a2SYan Zheng } 29795d4f98a2SYan Zheng 29805d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 29813fd0a558SYan, Zheng if (lowest) { 29824547f4d8SLiu Bo if (bytenr != node->bytenr) { 29834547f4d8SLiu Bo btrfs_err(root->fs_info, 29844547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 29854547f4d8SLiu Bo bytenr, node->bytenr, slot, 29864547f4d8SLiu Bo upper->eb->start); 29874547f4d8SLiu Bo err = -EIO; 29884547f4d8SLiu Bo goto next; 29894547f4d8SLiu Bo } 29905d4f98a2SYan Zheng } else { 29913fd0a558SYan, Zheng if (node->eb->start == bytenr) 29923fd0a558SYan, Zheng goto next; 29935d4f98a2SYan Zheng } 29945d4f98a2SYan Zheng 2995da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 29965d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 2997581c1760SQu Wenruo btrfs_node_key_to_cpu(upper->eb, &first_key, slot); 2998581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, generation, 2999581c1760SQu Wenruo upper->level - 1, &first_key); 300064c043deSLiu Bo if (IS_ERR(eb)) { 300164c043deSLiu Bo err = PTR_ERR(eb); 300264c043deSLiu Bo goto next; 300364c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 3004416bc658SJosef Bacik free_extent_buffer(eb); 300597d9a8a4STsutomu Itoh err = -EIO; 300697d9a8a4STsutomu Itoh goto next; 300797d9a8a4STsutomu Itoh } 30085d4f98a2SYan Zheng btrfs_tree_lock(eb); 30098bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 30105d4f98a2SYan Zheng 30115d4f98a2SYan Zheng if (!node->eb) { 30125d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 30135d4f98a2SYan Zheng slot, &eb); 30143fd0a558SYan, Zheng btrfs_tree_unlock(eb); 30153fd0a558SYan, Zheng free_extent_buffer(eb); 30165d4f98a2SYan Zheng if (ret < 0) { 30175d4f98a2SYan Zheng err = ret; 30183fd0a558SYan, Zheng goto next; 30195d4f98a2SYan Zheng } 30203fd0a558SYan, Zheng BUG_ON(node->eb != eb); 30215d4f98a2SYan Zheng } else { 30225d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 30235d4f98a2SYan Zheng node->eb->start); 30245d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 30255d4f98a2SYan Zheng trans->transid); 30265d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 30275d4f98a2SYan Zheng 302882fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, 30295d4f98a2SYan Zheng node->eb->start, blocksize, 303082fa113fSQu Wenruo upper->eb->start); 303182fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 303282fa113fSQu Wenruo btrfs_init_tree_ref(&ref, node->level, 303382fa113fSQu Wenruo btrfs_header_owner(upper->eb)); 303482fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 30355d4f98a2SYan Zheng BUG_ON(ret); 30365d4f98a2SYan Zheng 30375d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 30385d4f98a2SYan Zheng BUG_ON(ret); 30395d4f98a2SYan Zheng } 30403fd0a558SYan, Zheng next: 30413fd0a558SYan, Zheng if (!upper->pending) 30423fd0a558SYan, Zheng drop_node_buffer(upper); 30433fd0a558SYan, Zheng else 30443fd0a558SYan, Zheng unlock_node_buffer(upper); 30453fd0a558SYan, Zheng if (err) 30463fd0a558SYan, Zheng break; 30475d4f98a2SYan Zheng } 30483fd0a558SYan, Zheng 30493fd0a558SYan, Zheng if (!err && node->pending) { 30503fd0a558SYan, Zheng drop_node_buffer(node); 30513fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 30523fd0a558SYan, Zheng node->pending = 0; 30535d4f98a2SYan Zheng } 30543fd0a558SYan, Zheng 30555d4f98a2SYan Zheng path->lowest_level = 0; 30563fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 30575d4f98a2SYan Zheng return err; 30585d4f98a2SYan Zheng } 30595d4f98a2SYan Zheng 30605d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 30613fd0a558SYan, Zheng struct reloc_control *rc, 30625d4f98a2SYan Zheng struct backref_node *node, 30635d4f98a2SYan Zheng struct btrfs_path *path) 30645d4f98a2SYan Zheng { 30655d4f98a2SYan Zheng struct btrfs_key key; 30665d4f98a2SYan Zheng 30675d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 30683fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 30695d4f98a2SYan Zheng } 30705d4f98a2SYan Zheng 30715d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 30723fd0a558SYan, Zheng struct reloc_control *rc, 30733fd0a558SYan, Zheng struct btrfs_path *path, int err) 30745d4f98a2SYan Zheng { 30753fd0a558SYan, Zheng LIST_HEAD(list); 30763fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 30775d4f98a2SYan Zheng struct backref_node *node; 30785d4f98a2SYan Zheng int level; 30795d4f98a2SYan Zheng int ret; 30805d4f98a2SYan Zheng 30815d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 30825d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 30835d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 30843fd0a558SYan, Zheng struct backref_node, list); 30853fd0a558SYan, Zheng list_move_tail(&node->list, &list); 30863fd0a558SYan, Zheng BUG_ON(!node->pending); 30875d4f98a2SYan Zheng 30883fd0a558SYan, Zheng if (!err) { 30893fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 30905d4f98a2SYan Zheng if (ret < 0) 30915d4f98a2SYan Zheng err = ret; 30925d4f98a2SYan Zheng } 30935d4f98a2SYan Zheng } 30943fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 30953fd0a558SYan, Zheng } 30965d4f98a2SYan Zheng return err; 30975d4f98a2SYan Zheng } 30985d4f98a2SYan Zheng 30995d4f98a2SYan Zheng static void mark_block_processed(struct reloc_control *rc, 31003fd0a558SYan, Zheng u64 bytenr, u32 blocksize) 31013fd0a558SYan, Zheng { 31023fd0a558SYan, Zheng set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, 3103ceeb0ae7SDavid Sterba EXTENT_DIRTY); 31043fd0a558SYan, Zheng } 31053fd0a558SYan, Zheng 31063fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 31075d4f98a2SYan Zheng struct backref_node *node) 31085d4f98a2SYan Zheng { 31095d4f98a2SYan Zheng u32 blocksize; 31105d4f98a2SYan Zheng if (node->level == 0 || 31115d4f98a2SYan Zheng in_block_group(node->bytenr, rc->block_group)) { 3112da17066cSJeff Mahoney blocksize = rc->extent_root->fs_info->nodesize; 31133fd0a558SYan, Zheng mark_block_processed(rc, node->bytenr, blocksize); 31145d4f98a2SYan Zheng } 31155d4f98a2SYan Zheng node->processed = 1; 31165d4f98a2SYan Zheng } 31175d4f98a2SYan Zheng 31185d4f98a2SYan Zheng /* 31195d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 31205d4f98a2SYan Zheng * as processed. 31215d4f98a2SYan Zheng */ 31225d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 31235d4f98a2SYan Zheng struct backref_node *node) 31245d4f98a2SYan Zheng { 31255d4f98a2SYan Zheng struct backref_node *next = node; 31265d4f98a2SYan Zheng struct backref_edge *edge; 31275d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 31285d4f98a2SYan Zheng int index = 0; 31295d4f98a2SYan Zheng 31305d4f98a2SYan Zheng while (next) { 31315d4f98a2SYan Zheng cond_resched(); 31325d4f98a2SYan Zheng while (1) { 31335d4f98a2SYan Zheng if (next->processed) 31345d4f98a2SYan Zheng break; 31355d4f98a2SYan Zheng 31363fd0a558SYan, Zheng __mark_block_processed(rc, next); 31375d4f98a2SYan Zheng 31385d4f98a2SYan Zheng if (list_empty(&next->upper)) 31395d4f98a2SYan Zheng break; 31405d4f98a2SYan Zheng 31415d4f98a2SYan Zheng edge = list_entry(next->upper.next, 31425d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 31435d4f98a2SYan Zheng edges[index++] = edge; 31445d4f98a2SYan Zheng next = edge->node[UPPER]; 31455d4f98a2SYan Zheng } 31465d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 31475d4f98a2SYan Zheng } 31485d4f98a2SYan Zheng } 31495d4f98a2SYan Zheng 31507476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 31515d4f98a2SYan Zheng { 3152da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 31537476dfdaSDavid Sterba 31545d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 31559655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 31565d4f98a2SYan Zheng return 1; 31575d4f98a2SYan Zheng return 0; 31585d4f98a2SYan Zheng } 31595d4f98a2SYan Zheng 31602ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 31615d4f98a2SYan Zheng struct tree_block *block) 31625d4f98a2SYan Zheng { 31635d4f98a2SYan Zheng struct extent_buffer *eb; 31645d4f98a2SYan Zheng 3165581c1760SQu Wenruo eb = read_tree_block(fs_info, block->bytenr, block->key.offset, 3166581c1760SQu Wenruo block->level, NULL); 316764c043deSLiu Bo if (IS_ERR(eb)) { 316864c043deSLiu Bo return PTR_ERR(eb); 316964c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 3170416bc658SJosef Bacik free_extent_buffer(eb); 3171416bc658SJosef Bacik return -EIO; 3172416bc658SJosef Bacik } 31735d4f98a2SYan Zheng if (block->level == 0) 31745d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 31755d4f98a2SYan Zheng else 31765d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 31775d4f98a2SYan Zheng free_extent_buffer(eb); 31785d4f98a2SYan Zheng block->key_ready = 1; 31795d4f98a2SYan Zheng return 0; 31805d4f98a2SYan Zheng } 31815d4f98a2SYan Zheng 31825d4f98a2SYan Zheng /* 31835d4f98a2SYan Zheng * helper function to relocate a tree block 31845d4f98a2SYan Zheng */ 31855d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 31865d4f98a2SYan Zheng struct reloc_control *rc, 31875d4f98a2SYan Zheng struct backref_node *node, 31885d4f98a2SYan Zheng struct btrfs_key *key, 31895d4f98a2SYan Zheng struct btrfs_path *path) 31905d4f98a2SYan Zheng { 31915d4f98a2SYan Zheng struct btrfs_root *root; 31923fd0a558SYan, Zheng int ret = 0; 31935d4f98a2SYan Zheng 31943fd0a558SYan, Zheng if (!node) 31955d4f98a2SYan Zheng return 0; 31963fd0a558SYan, Zheng 31975f6b2e5cSJosef Bacik /* 31985f6b2e5cSJosef Bacik * If we fail here we want to drop our backref_node because we are going 31995f6b2e5cSJosef Bacik * to start over and regenerate the tree for it. 32005f6b2e5cSJosef Bacik */ 32015f6b2e5cSJosef Bacik ret = reserve_metadata_space(trans, rc, node); 32025f6b2e5cSJosef Bacik if (ret) 32035f6b2e5cSJosef Bacik goto out; 32045f6b2e5cSJosef Bacik 32053fd0a558SYan, Zheng BUG_ON(node->processed); 3206147d256eSZhaolei root = select_one_root(node); 32073fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 32083fd0a558SYan, Zheng update_processed_blocks(rc, node); 32093fd0a558SYan, Zheng goto out; 32105d4f98a2SYan Zheng } 32115d4f98a2SYan Zheng 32123fd0a558SYan, Zheng if (root) { 321327cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 32143fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 32153fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 32163fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 32173fd0a558SYan, Zheng root = root->reloc_root; 32183fd0a558SYan, Zheng node->new_bytenr = root->node->start; 321900246528SJosef Bacik btrfs_put_root(node->root); 322000246528SJosef Bacik node->root = btrfs_grab_root(root); 32210b530bc5SJosef Bacik ASSERT(node->root); 32223fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 32233fd0a558SYan, Zheng } else { 32245d4f98a2SYan Zheng path->lowest_level = node->level; 32255d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 3226b3b4aa74SDavid Sterba btrfs_release_path(path); 32273fd0a558SYan, Zheng if (ret > 0) 32285d4f98a2SYan Zheng ret = 0; 32293fd0a558SYan, Zheng } 32303fd0a558SYan, Zheng if (!ret) 32313fd0a558SYan, Zheng update_processed_blocks(rc, node); 32323fd0a558SYan, Zheng } else { 32333fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 32343fd0a558SYan, Zheng } 32355d4f98a2SYan Zheng out: 32360647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 32373fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 32385d4f98a2SYan Zheng return ret; 32395d4f98a2SYan Zheng } 32405d4f98a2SYan Zheng 32415d4f98a2SYan Zheng /* 32425d4f98a2SYan Zheng * relocate a list of blocks 32435d4f98a2SYan Zheng */ 32445d4f98a2SYan Zheng static noinline_for_stack 32455d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 32465d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 32475d4f98a2SYan Zheng { 32482ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 32495d4f98a2SYan Zheng struct backref_node *node; 32505d4f98a2SYan Zheng struct btrfs_path *path; 32515d4f98a2SYan Zheng struct tree_block *block; 325298ff7b94SQu Wenruo struct tree_block *next; 32535d4f98a2SYan Zheng int ret; 32545d4f98a2SYan Zheng int err = 0; 32555d4f98a2SYan Zheng 32565d4f98a2SYan Zheng path = btrfs_alloc_path(); 3257e1a12670SLiu Bo if (!path) { 3258e1a12670SLiu Bo err = -ENOMEM; 325934c2b290SDavid Sterba goto out_free_blocks; 3260e1a12670SLiu Bo } 32615d4f98a2SYan Zheng 326298ff7b94SQu Wenruo /* Kick in readahead for tree blocks with missing keys */ 326398ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 32645d4f98a2SYan Zheng if (!block->key_ready) 32652ff7e61eSJeff Mahoney readahead_tree_block(fs_info, block->bytenr); 32665d4f98a2SYan Zheng } 32675d4f98a2SYan Zheng 326898ff7b94SQu Wenruo /* Get first keys */ 326998ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 327034c2b290SDavid Sterba if (!block->key_ready) { 32712ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 327234c2b290SDavid Sterba if (err) 327334c2b290SDavid Sterba goto out_free_path; 327434c2b290SDavid Sterba } 32755d4f98a2SYan Zheng } 32765d4f98a2SYan Zheng 327798ff7b94SQu Wenruo /* Do tree relocation */ 327898ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 32793fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 32805d4f98a2SYan Zheng block->level, block->bytenr); 32815d4f98a2SYan Zheng if (IS_ERR(node)) { 32825d4f98a2SYan Zheng err = PTR_ERR(node); 32835d4f98a2SYan Zheng goto out; 32845d4f98a2SYan Zheng } 32855d4f98a2SYan Zheng 32865d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 32875d4f98a2SYan Zheng path); 32885d4f98a2SYan Zheng if (ret < 0) { 32895d4f98a2SYan Zheng err = ret; 329050dbbb71SJosef Bacik break; 32915d4f98a2SYan Zheng } 32925d4f98a2SYan Zheng } 32935d4f98a2SYan Zheng out: 32943fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 32955d4f98a2SYan Zheng 329634c2b290SDavid Sterba out_free_path: 32975d4f98a2SYan Zheng btrfs_free_path(path); 329834c2b290SDavid Sterba out_free_blocks: 3299e1a12670SLiu Bo free_block_list(blocks); 33005d4f98a2SYan Zheng return err; 33015d4f98a2SYan Zheng } 33025d4f98a2SYan Zheng 33035d4f98a2SYan Zheng static noinline_for_stack 3304efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3305efa56464SYan, Zheng struct file_extent_cluster *cluster) 3306efa56464SYan, Zheng { 3307efa56464SYan, Zheng u64 alloc_hint = 0; 3308efa56464SYan, Zheng u64 start; 3309efa56464SYan, Zheng u64 end; 3310efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3311efa56464SYan, Zheng u64 num_bytes; 3312efa56464SYan, Zheng int nr = 0; 3313efa56464SYan, Zheng int ret = 0; 3314dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 3315dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 331618513091SWang Xiaoguang u64 cur_offset; 3317364ecf36SQu Wenruo struct extent_changeset *data_reserved = NULL; 3318efa56464SYan, Zheng 3319efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 33205955102cSAl Viro inode_lock(inode); 3321efa56464SYan, Zheng 3322364ecf36SQu Wenruo ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start, 3323dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 3324efa56464SYan, Zheng if (ret) 3325efa56464SYan, Zheng goto out; 3326efa56464SYan, Zheng 332718513091SWang Xiaoguang cur_offset = prealloc_start; 3328efa56464SYan, Zheng while (nr < cluster->nr) { 3329efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3330efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3331efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3332efa56464SYan, Zheng else 3333efa56464SYan, Zheng end = cluster->end - offset; 3334efa56464SYan, Zheng 3335d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3336efa56464SYan, Zheng num_bytes = end + 1 - start; 333718513091SWang Xiaoguang if (cur_offset < start) 3338bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3339bc42bda2SQu Wenruo cur_offset, start - cur_offset); 3340efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3341efa56464SYan, Zheng num_bytes, num_bytes, 3342efa56464SYan, Zheng end + 1, &alloc_hint); 334318513091SWang Xiaoguang cur_offset = end + 1; 3344d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3345efa56464SYan, Zheng if (ret) 3346efa56464SYan, Zheng break; 3347efa56464SYan, Zheng nr++; 3348efa56464SYan, Zheng } 334918513091SWang Xiaoguang if (cur_offset < prealloc_end) 3350bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3351bc42bda2SQu Wenruo cur_offset, prealloc_end + 1 - cur_offset); 3352efa56464SYan, Zheng out: 33535955102cSAl Viro inode_unlock(inode); 3354364ecf36SQu Wenruo extent_changeset_free(data_reserved); 3355efa56464SYan, Zheng return ret; 3356efa56464SYan, Zheng } 3357efa56464SYan, Zheng 3358efa56464SYan, Zheng static noinline_for_stack 33590257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 33600257bb82SYan, Zheng u64 block_start) 33615d4f98a2SYan Zheng { 33625d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 33635d4f98a2SYan Zheng struct extent_map *em; 33640257bb82SYan, Zheng int ret = 0; 33655d4f98a2SYan Zheng 3366172ddd60SDavid Sterba em = alloc_extent_map(); 33670257bb82SYan, Zheng if (!em) 33680257bb82SYan, Zheng return -ENOMEM; 33690257bb82SYan, Zheng 33705d4f98a2SYan Zheng em->start = start; 33710257bb82SYan, Zheng em->len = end + 1 - start; 33720257bb82SYan, Zheng em->block_len = em->len; 33730257bb82SYan, Zheng em->block_start = block_start; 33745d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 33755d4f98a2SYan Zheng 3376d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 33775d4f98a2SYan Zheng while (1) { 3378890871beSChris Mason write_lock(&em_tree->lock); 337909a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3380890871beSChris Mason write_unlock(&em_tree->lock); 33815d4f98a2SYan Zheng if (ret != -EEXIST) { 33825d4f98a2SYan Zheng free_extent_map(em); 33835d4f98a2SYan Zheng break; 33845d4f98a2SYan Zheng } 3385dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 33865d4f98a2SYan Zheng } 3387d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 33880257bb82SYan, Zheng return ret; 33890257bb82SYan, Zheng } 33905d4f98a2SYan Zheng 3391726a3421SQu Wenruo /* 3392726a3421SQu Wenruo * Allow error injection to test balance cancellation 3393726a3421SQu Wenruo */ 3394726a3421SQu Wenruo int btrfs_should_cancel_balance(struct btrfs_fs_info *fs_info) 3395726a3421SQu Wenruo { 3396726a3421SQu Wenruo return atomic_read(&fs_info->balance_cancel_req); 3397726a3421SQu Wenruo } 3398726a3421SQu Wenruo ALLOW_ERROR_INJECTION(btrfs_should_cancel_balance, TRUE); 3399726a3421SQu Wenruo 34000257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 34010257bb82SYan, Zheng struct file_extent_cluster *cluster) 34020257bb82SYan, Zheng { 34032ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 34040257bb82SYan, Zheng u64 page_start; 34050257bb82SYan, Zheng u64 page_end; 34060257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 34070257bb82SYan, Zheng unsigned long index; 34080257bb82SYan, Zheng unsigned long last_index; 34090257bb82SYan, Zheng struct page *page; 34100257bb82SYan, Zheng struct file_ra_state *ra; 34113b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 34120257bb82SYan, Zheng int nr = 0; 34130257bb82SYan, Zheng int ret = 0; 34140257bb82SYan, Zheng 34150257bb82SYan, Zheng if (!cluster->nr) 34160257bb82SYan, Zheng return 0; 34170257bb82SYan, Zheng 34180257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 34190257bb82SYan, Zheng if (!ra) 34200257bb82SYan, Zheng return -ENOMEM; 34210257bb82SYan, Zheng 3422efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 34230257bb82SYan, Zheng if (ret) 3424efa56464SYan, Zheng goto out; 34250257bb82SYan, Zheng 34260257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 34270257bb82SYan, Zheng 3428efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3429efa56464SYan, Zheng cluster->end - offset, cluster->start); 3430efa56464SYan, Zheng if (ret) 3431efa56464SYan, Zheng goto out; 3432efa56464SYan, Zheng 343309cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 343409cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 34350257bb82SYan, Zheng while (index <= last_index) { 34369f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 34379f3db423SNikolay Borisov PAGE_SIZE); 3438efa56464SYan, Zheng if (ret) 3439efa56464SYan, Zheng goto out; 3440efa56464SYan, Zheng 34410257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 34420257bb82SYan, Zheng if (!page) { 34430257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 34440257bb82SYan, Zheng ra, NULL, index, 34450257bb82SYan, Zheng last_index + 1 - index); 3446a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 34473b16a4e3SJosef Bacik mask); 34480257bb82SYan, Zheng if (!page) { 3449691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 345043b18595SQu Wenruo PAGE_SIZE, true); 345144db1216SFilipe Manana btrfs_delalloc_release_extents(BTRFS_I(inode), 34528702ba93SQu Wenruo PAGE_SIZE); 34530257bb82SYan, Zheng ret = -ENOMEM; 3454efa56464SYan, Zheng goto out; 34550257bb82SYan, Zheng } 34560257bb82SYan, Zheng } 34570257bb82SYan, Zheng 34580257bb82SYan, Zheng if (PageReadahead(page)) { 34590257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 34600257bb82SYan, Zheng ra, NULL, page, index, 34610257bb82SYan, Zheng last_index + 1 - index); 34620257bb82SYan, Zheng } 34630257bb82SYan, Zheng 34640257bb82SYan, Zheng if (!PageUptodate(page)) { 34650257bb82SYan, Zheng btrfs_readpage(NULL, page); 34660257bb82SYan, Zheng lock_page(page); 34670257bb82SYan, Zheng if (!PageUptodate(page)) { 34680257bb82SYan, Zheng unlock_page(page); 346909cbfeafSKirill A. Shutemov put_page(page); 3470691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 347143b18595SQu Wenruo PAGE_SIZE, true); 34728b62f87bSJosef Bacik btrfs_delalloc_release_extents(BTRFS_I(inode), 34738702ba93SQu Wenruo PAGE_SIZE); 34740257bb82SYan, Zheng ret = -EIO; 3475efa56464SYan, Zheng goto out; 34760257bb82SYan, Zheng } 34770257bb82SYan, Zheng } 34780257bb82SYan, Zheng 34794eee4fa4SMiao Xie page_start = page_offset(page); 348009cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 34810257bb82SYan, Zheng 3482d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 34830257bb82SYan, Zheng 34840257bb82SYan, Zheng set_page_extent_mapped(page); 34850257bb82SYan, Zheng 34860257bb82SYan, Zheng if (nr < cluster->nr && 34870257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 34880257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 34890257bb82SYan, Zheng page_start, page_end, 3490ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 34910257bb82SYan, Zheng nr++; 34920257bb82SYan, Zheng } 34930257bb82SYan, Zheng 3494765f3cebSNikolay Borisov ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0, 3495330a5827SNikolay Borisov NULL); 3496765f3cebSNikolay Borisov if (ret) { 3497765f3cebSNikolay Borisov unlock_page(page); 3498765f3cebSNikolay Borisov put_page(page); 3499765f3cebSNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 350043b18595SQu Wenruo PAGE_SIZE, true); 3501765f3cebSNikolay Borisov btrfs_delalloc_release_extents(BTRFS_I(inode), 35028702ba93SQu Wenruo PAGE_SIZE); 3503765f3cebSNikolay Borisov 3504765f3cebSNikolay Borisov clear_extent_bits(&BTRFS_I(inode)->io_tree, 3505765f3cebSNikolay Borisov page_start, page_end, 3506765f3cebSNikolay Borisov EXTENT_LOCKED | EXTENT_BOUNDARY); 3507765f3cebSNikolay Borisov goto out; 3508765f3cebSNikolay Borisov 3509765f3cebSNikolay Borisov } 35100257bb82SYan, Zheng set_page_dirty(page); 35110257bb82SYan, Zheng 35120257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3513d0082371SJeff Mahoney page_start, page_end); 35140257bb82SYan, Zheng unlock_page(page); 351509cbfeafSKirill A. Shutemov put_page(page); 35160257bb82SYan, Zheng 35170257bb82SYan, Zheng index++; 35188702ba93SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); 3519efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 35202ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 35217f913c7cSQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 35227f913c7cSQu Wenruo ret = -ECANCELED; 35237f913c7cSQu Wenruo goto out; 35247f913c7cSQu Wenruo } 35250257bb82SYan, Zheng } 35260257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3527efa56464SYan, Zheng out: 35280257bb82SYan, Zheng kfree(ra); 35290257bb82SYan, Zheng return ret; 35300257bb82SYan, Zheng } 35310257bb82SYan, Zheng 35320257bb82SYan, Zheng static noinline_for_stack 35330257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 35340257bb82SYan, Zheng struct file_extent_cluster *cluster) 35350257bb82SYan, Zheng { 35360257bb82SYan, Zheng int ret; 35370257bb82SYan, Zheng 35380257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 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 35450257bb82SYan, Zheng if (!cluster->nr) 35460257bb82SYan, Zheng cluster->start = extent_key->objectid; 35470257bb82SYan, Zheng else 35480257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 35490257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 35500257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 35510257bb82SYan, Zheng cluster->nr++; 35520257bb82SYan, Zheng 35530257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 35540257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 35550257bb82SYan, Zheng if (ret) 35560257bb82SYan, Zheng return ret; 35570257bb82SYan, Zheng cluster->nr = 0; 35580257bb82SYan, Zheng } 35590257bb82SYan, Zheng return 0; 35605d4f98a2SYan Zheng } 35615d4f98a2SYan Zheng 35625d4f98a2SYan Zheng /* 35635d4f98a2SYan Zheng * helper to add a tree block to the list. 35645d4f98a2SYan Zheng * the major work is getting the generation and level of the block 35655d4f98a2SYan Zheng */ 35665d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 35675d4f98a2SYan Zheng struct btrfs_key *extent_key, 35685d4f98a2SYan Zheng struct btrfs_path *path, 35695d4f98a2SYan Zheng struct rb_root *blocks) 35705d4f98a2SYan Zheng { 35715d4f98a2SYan Zheng struct extent_buffer *eb; 35725d4f98a2SYan Zheng struct btrfs_extent_item *ei; 35735d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 35745d4f98a2SYan Zheng struct tree_block *block; 35755d4f98a2SYan Zheng struct rb_node *rb_node; 35765d4f98a2SYan Zheng u32 item_size; 35775d4f98a2SYan Zheng int level = -1; 35787fdf4b60SWang Shilong u64 generation; 35795d4f98a2SYan Zheng 35805d4f98a2SYan Zheng eb = path->nodes[0]; 35815d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 35825d4f98a2SYan Zheng 35833173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 35843173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 35855d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 35865d4f98a2SYan Zheng struct btrfs_extent_item); 35873173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 35885d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 35895d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 35905d4f98a2SYan Zheng } else { 35913173a18fSJosef Bacik level = (int)extent_key->offset; 35923173a18fSJosef Bacik } 35933173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 35946d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3595ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3596ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3597ba3c2b19SNikolay Borisov return -EINVAL; 35983173a18fSJosef Bacik } else { 35995d4f98a2SYan Zheng BUG(); 36005d4f98a2SYan Zheng } 36015d4f98a2SYan Zheng 3602b3b4aa74SDavid Sterba btrfs_release_path(path); 36035d4f98a2SYan Zheng 36045d4f98a2SYan Zheng BUG_ON(level == -1); 36055d4f98a2SYan Zheng 36065d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 36075d4f98a2SYan Zheng if (!block) 36085d4f98a2SYan Zheng return -ENOMEM; 36095d4f98a2SYan Zheng 36105d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3611da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 36125d4f98a2SYan Zheng block->key.offset = generation; 36135d4f98a2SYan Zheng block->level = level; 36145d4f98a2SYan Zheng block->key_ready = 0; 36155d4f98a2SYan Zheng 36165d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 361743c04fb1SJeff Mahoney if (rb_node) 361843c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 36195d4f98a2SYan Zheng 36205d4f98a2SYan Zheng return 0; 36215d4f98a2SYan Zheng } 36225d4f98a2SYan Zheng 36235d4f98a2SYan Zheng /* 36245d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 36255d4f98a2SYan Zheng */ 36265d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 36275d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 36285d4f98a2SYan Zheng struct rb_root *blocks) 36295d4f98a2SYan Zheng { 36300b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 36315d4f98a2SYan Zheng struct btrfs_path *path; 36325d4f98a2SYan Zheng struct btrfs_key key; 36335d4f98a2SYan Zheng int ret; 36340b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 36355d4f98a2SYan Zheng 36367476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 36375d4f98a2SYan Zheng return 0; 36385d4f98a2SYan Zheng 36395d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 36405d4f98a2SYan Zheng return 0; 36415d4f98a2SYan Zheng 36425d4f98a2SYan Zheng path = btrfs_alloc_path(); 36435d4f98a2SYan Zheng if (!path) 36445d4f98a2SYan Zheng return -ENOMEM; 3645aee68ee5SJosef Bacik again: 36465d4f98a2SYan Zheng key.objectid = bytenr; 3647aee68ee5SJosef Bacik if (skinny) { 3648aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3649aee68ee5SJosef Bacik key.offset = (u64)-1; 3650aee68ee5SJosef Bacik } else { 36515d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 36525d4f98a2SYan Zheng key.offset = blocksize; 3653aee68ee5SJosef Bacik } 36545d4f98a2SYan Zheng 36555d4f98a2SYan Zheng path->search_commit_root = 1; 36565d4f98a2SYan Zheng path->skip_locking = 1; 36575d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 36585d4f98a2SYan Zheng if (ret < 0) 36595d4f98a2SYan Zheng goto out; 36605d4f98a2SYan Zheng 3661aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3662aee68ee5SJosef Bacik if (path->slots[0]) { 3663aee68ee5SJosef Bacik path->slots[0]--; 3664aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3665aee68ee5SJosef Bacik path->slots[0]); 36663173a18fSJosef Bacik if (key.objectid == bytenr && 3667aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3668aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3669aee68ee5SJosef Bacik key.offset == blocksize))) 36703173a18fSJosef Bacik ret = 0; 36713173a18fSJosef Bacik } 3672aee68ee5SJosef Bacik 3673aee68ee5SJosef Bacik if (ret) { 3674aee68ee5SJosef Bacik skinny = false; 3675aee68ee5SJosef Bacik btrfs_release_path(path); 3676aee68ee5SJosef Bacik goto again; 3677aee68ee5SJosef Bacik } 3678aee68ee5SJosef Bacik } 3679cdccee99SLiu Bo if (ret) { 3680cdccee99SLiu Bo ASSERT(ret == 1); 3681cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3682cdccee99SLiu Bo btrfs_err(fs_info, 3683cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3684cdccee99SLiu Bo bytenr); 3685cdccee99SLiu Bo WARN_ON(1); 3686cdccee99SLiu Bo ret = -EINVAL; 3687cdccee99SLiu Bo goto out; 3688cdccee99SLiu Bo } 36893173a18fSJosef Bacik 36905d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 36915d4f98a2SYan Zheng out: 36925d4f98a2SYan Zheng btrfs_free_path(path); 36935d4f98a2SYan Zheng return ret; 36945d4f98a2SYan Zheng } 36955d4f98a2SYan Zheng 36960af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 369732da5386SDavid Sterba struct btrfs_block_group *block_group, 36981bbc621eSChris Mason struct inode *inode, 36991bbc621eSChris Mason u64 ino) 37000af3d00bSJosef Bacik { 37010af3d00bSJosef Bacik struct btrfs_key key; 37020af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 37030af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 37040af3d00bSJosef Bacik int ret = 0; 37050af3d00bSJosef Bacik 37060af3d00bSJosef Bacik if (inode) 37070af3d00bSJosef Bacik goto truncate; 37080af3d00bSJosef Bacik 37090af3d00bSJosef Bacik key.objectid = ino; 37100af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 37110af3d00bSJosef Bacik key.offset = 0; 37120af3d00bSJosef Bacik 37134c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 37142e19f1f9SAl Viro if (IS_ERR(inode)) 37150af3d00bSJosef Bacik return -ENOENT; 37160af3d00bSJosef Bacik 37170af3d00bSJosef Bacik truncate: 37182ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 37197b61cd92SMiao Xie &fs_info->global_block_rsv); 37207b61cd92SMiao Xie if (ret) 37217b61cd92SMiao Xie goto out; 37227b61cd92SMiao Xie 37237a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 37240af3d00bSJosef Bacik if (IS_ERR(trans)) { 37253612b495STsutomu Itoh ret = PTR_ERR(trans); 37260af3d00bSJosef Bacik goto out; 37270af3d00bSJosef Bacik } 37280af3d00bSJosef Bacik 372977ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 37300af3d00bSJosef Bacik 37313a45bb20SJeff Mahoney btrfs_end_transaction(trans); 37322ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 37330af3d00bSJosef Bacik out: 37340af3d00bSJosef Bacik iput(inode); 37350af3d00bSJosef Bacik return ret; 37360af3d00bSJosef Bacik } 37370af3d00bSJosef Bacik 37385d4f98a2SYan Zheng /* 373919b546d7SQu Wenruo * Locate the free space cache EXTENT_DATA in root tree leaf and delete the 374019b546d7SQu Wenruo * cache inode, to avoid free space cache data extent blocking data relocation. 37415d4f98a2SYan Zheng */ 374219b546d7SQu Wenruo static int delete_v1_space_cache(struct extent_buffer *leaf, 374319b546d7SQu Wenruo struct btrfs_block_group *block_group, 374419b546d7SQu Wenruo u64 data_bytenr) 37455d4f98a2SYan Zheng { 374619b546d7SQu Wenruo u64 space_cache_ino; 374719b546d7SQu Wenruo struct btrfs_file_extent_item *ei; 37485d4f98a2SYan Zheng struct btrfs_key key; 374919b546d7SQu Wenruo bool found = false; 375019b546d7SQu Wenruo int i; 37515d4f98a2SYan Zheng int ret; 37525d4f98a2SYan Zheng 375319b546d7SQu Wenruo if (btrfs_header_owner(leaf) != BTRFS_ROOT_TREE_OBJECTID) 375419b546d7SQu Wenruo return 0; 37555d4f98a2SYan Zheng 375619b546d7SQu Wenruo for (i = 0; i < btrfs_header_nritems(leaf); i++) { 375719b546d7SQu Wenruo btrfs_item_key_to_cpu(leaf, &key, i); 375819b546d7SQu Wenruo if (key.type != BTRFS_EXTENT_DATA_KEY) 375919b546d7SQu Wenruo continue; 376019b546d7SQu Wenruo ei = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 376119b546d7SQu Wenruo if (btrfs_file_extent_type(leaf, ei) == BTRFS_FILE_EXTENT_REG && 376219b546d7SQu Wenruo btrfs_file_extent_disk_bytenr(leaf, ei) == data_bytenr) { 376319b546d7SQu Wenruo found = true; 376419b546d7SQu Wenruo space_cache_ino = key.objectid; 376519b546d7SQu Wenruo break; 376619b546d7SQu Wenruo } 376719b546d7SQu Wenruo } 376819b546d7SQu Wenruo if (!found) 376919b546d7SQu Wenruo return -ENOENT; 377019b546d7SQu Wenruo ret = delete_block_group_cache(leaf->fs_info, block_group, NULL, 377119b546d7SQu Wenruo space_cache_ino); 37720af3d00bSJosef Bacik return ret; 37735d4f98a2SYan Zheng } 37745d4f98a2SYan Zheng 37755d4f98a2SYan Zheng /* 37762c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 37775d4f98a2SYan Zheng */ 37785d4f98a2SYan Zheng static noinline_for_stack 37795d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 37805d4f98a2SYan Zheng struct btrfs_key *extent_key, 37815d4f98a2SYan Zheng struct btrfs_path *path, 37825d4f98a2SYan Zheng struct rb_root *blocks) 37835d4f98a2SYan Zheng { 378419b546d7SQu Wenruo struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 378519b546d7SQu Wenruo struct ulist *leaves = NULL; 378619b546d7SQu Wenruo struct ulist_iterator leaf_uiter; 378719b546d7SQu Wenruo struct ulist_node *ref_node = NULL; 378819b546d7SQu Wenruo const u32 blocksize = fs_info->nodesize; 3789647f63bdSFilipe David Borba Manana int ret = 0; 37905d4f98a2SYan Zheng 3791b3b4aa74SDavid Sterba btrfs_release_path(path); 379219b546d7SQu Wenruo ret = btrfs_find_all_leafs(NULL, fs_info, extent_key->objectid, 379319b546d7SQu Wenruo 0, &leaves, NULL, true); 379419b546d7SQu Wenruo if (ret < 0) 379519b546d7SQu Wenruo return ret; 379619b546d7SQu Wenruo 379719b546d7SQu Wenruo ULIST_ITER_INIT(&leaf_uiter); 379819b546d7SQu Wenruo while ((ref_node = ulist_next(leaves, &leaf_uiter))) { 379919b546d7SQu Wenruo struct extent_buffer *eb; 380019b546d7SQu Wenruo 380119b546d7SQu Wenruo eb = read_tree_block(fs_info, ref_node->val, 0, 0, NULL); 380219b546d7SQu Wenruo if (IS_ERR(eb)) { 380319b546d7SQu Wenruo ret = PTR_ERR(eb); 380419b546d7SQu Wenruo break; 380519b546d7SQu Wenruo } 380619b546d7SQu Wenruo ret = delete_v1_space_cache(eb, rc->block_group, 380719b546d7SQu Wenruo extent_key->objectid); 380819b546d7SQu Wenruo free_extent_buffer(eb); 380919b546d7SQu Wenruo if (ret < 0) 381019b546d7SQu Wenruo break; 381119b546d7SQu Wenruo ret = __add_tree_block(rc, ref_node->val, blocksize, blocks); 381219b546d7SQu Wenruo if (ret < 0) 381319b546d7SQu Wenruo break; 381419b546d7SQu Wenruo } 381519b546d7SQu Wenruo if (ret < 0) 38165d4f98a2SYan Zheng free_block_list(blocks); 381719b546d7SQu Wenruo ulist_free(leaves); 381819b546d7SQu Wenruo return ret; 38195d4f98a2SYan Zheng } 38205d4f98a2SYan Zheng 38215d4f98a2SYan Zheng /* 38222c016dc2SLiu Bo * helper to find next unprocessed extent 38235d4f98a2SYan Zheng */ 38245d4f98a2SYan Zheng static noinline_for_stack 3825147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 38263fd0a558SYan, Zheng struct btrfs_key *extent_key) 38275d4f98a2SYan Zheng { 38280b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38295d4f98a2SYan Zheng struct btrfs_key key; 38305d4f98a2SYan Zheng struct extent_buffer *leaf; 38315d4f98a2SYan Zheng u64 start, end, last; 38325d4f98a2SYan Zheng int ret; 38335d4f98a2SYan Zheng 3834b3470b5dSDavid Sterba last = rc->block_group->start + rc->block_group->length; 38355d4f98a2SYan Zheng while (1) { 38365d4f98a2SYan Zheng cond_resched(); 38375d4f98a2SYan Zheng if (rc->search_start >= last) { 38385d4f98a2SYan Zheng ret = 1; 38395d4f98a2SYan Zheng break; 38405d4f98a2SYan Zheng } 38415d4f98a2SYan Zheng 38425d4f98a2SYan Zheng key.objectid = rc->search_start; 38435d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 38445d4f98a2SYan Zheng key.offset = 0; 38455d4f98a2SYan Zheng 38465d4f98a2SYan Zheng path->search_commit_root = 1; 38475d4f98a2SYan Zheng path->skip_locking = 1; 38485d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 38495d4f98a2SYan Zheng 0, 0); 38505d4f98a2SYan Zheng if (ret < 0) 38515d4f98a2SYan Zheng break; 38525d4f98a2SYan Zheng next: 38535d4f98a2SYan Zheng leaf = path->nodes[0]; 38545d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 38555d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 38565d4f98a2SYan Zheng if (ret != 0) 38575d4f98a2SYan Zheng break; 38585d4f98a2SYan Zheng leaf = path->nodes[0]; 38595d4f98a2SYan Zheng } 38605d4f98a2SYan Zheng 38615d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 38625d4f98a2SYan Zheng if (key.objectid >= last) { 38635d4f98a2SYan Zheng ret = 1; 38645d4f98a2SYan Zheng break; 38655d4f98a2SYan Zheng } 38665d4f98a2SYan Zheng 38673173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 38683173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 38693173a18fSJosef Bacik path->slots[0]++; 38703173a18fSJosef Bacik goto next; 38713173a18fSJosef Bacik } 38723173a18fSJosef Bacik 38733173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 38745d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 38755d4f98a2SYan Zheng path->slots[0]++; 38765d4f98a2SYan Zheng goto next; 38775d4f98a2SYan Zheng } 38785d4f98a2SYan Zheng 38793173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 38800b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 38813173a18fSJosef Bacik rc->search_start) { 38823173a18fSJosef Bacik path->slots[0]++; 38833173a18fSJosef Bacik goto next; 38843173a18fSJosef Bacik } 38853173a18fSJosef Bacik 38865d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 38875d4f98a2SYan Zheng key.objectid, &start, &end, 3888e6138876SJosef Bacik EXTENT_DIRTY, NULL); 38895d4f98a2SYan Zheng 38905d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3891b3b4aa74SDavid Sterba btrfs_release_path(path); 38925d4f98a2SYan Zheng rc->search_start = end + 1; 38935d4f98a2SYan Zheng } else { 38943173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 38955d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 38963173a18fSJosef Bacik else 38973173a18fSJosef Bacik rc->search_start = key.objectid + 38980b246afaSJeff Mahoney fs_info->nodesize; 38993fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 39005d4f98a2SYan Zheng return 0; 39015d4f98a2SYan Zheng } 39025d4f98a2SYan Zheng } 3903b3b4aa74SDavid Sterba btrfs_release_path(path); 39045d4f98a2SYan Zheng return ret; 39055d4f98a2SYan Zheng } 39065d4f98a2SYan Zheng 39075d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 39085d4f98a2SYan Zheng { 39095d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39107585717fSChris Mason 39117585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39125d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 39137585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39145d4f98a2SYan Zheng } 39155d4f98a2SYan Zheng 39165d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 39175d4f98a2SYan Zheng { 39185d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39197585717fSChris Mason 39207585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39215d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 39227585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39235d4f98a2SYan Zheng } 39245d4f98a2SYan Zheng 39255d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 39265d4f98a2SYan Zheng { 39275d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39285d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39295d4f98a2SYan Zheng return 1; 39305d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 39315d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39325d4f98a2SYan Zheng return 1; 39335d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39345d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 39355d4f98a2SYan Zheng return 1; 39365d4f98a2SYan Zheng return 0; 39375d4f98a2SYan Zheng } 39385d4f98a2SYan Zheng 39393fd0a558SYan, Zheng static noinline_for_stack 39403fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 39413fd0a558SYan, Zheng { 39423fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3943ac2fabacSJosef Bacik int ret; 39443fd0a558SYan, Zheng 39452ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 394666d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 39473fd0a558SYan, Zheng if (!rc->block_rsv) 39483fd0a558SYan, Zheng return -ENOMEM; 39493fd0a558SYan, Zheng 39503fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 3951b3470b5dSDavid Sterba rc->search_start = rc->block_group->start; 39523fd0a558SYan, Zheng rc->extents_found = 0; 39533fd0a558SYan, Zheng rc->nodes_relocated = 0; 39543fd0a558SYan, Zheng rc->merging_rsv_size = 0; 39550647bf56SWang Shilong rc->reserved_bytes = 0; 3956da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 39570647bf56SWang Shilong RELOCATION_RESERVED_NODES; 3958ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 3959ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3960ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3961ac2fabacSJosef Bacik if (ret) 3962ac2fabacSJosef Bacik return ret; 39633fd0a558SYan, Zheng 39643fd0a558SYan, Zheng rc->create_reloc_tree = 1; 39653fd0a558SYan, Zheng set_reloc_control(rc); 39663fd0a558SYan, Zheng 39677a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 396828818947SLiu Bo if (IS_ERR(trans)) { 396928818947SLiu Bo unset_reloc_control(rc); 397028818947SLiu Bo /* 397128818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 397228818947SLiu Bo * cleanup. And callers are responsible to free the above 397328818947SLiu Bo * block rsv. 397428818947SLiu Bo */ 397528818947SLiu Bo return PTR_ERR(trans); 397628818947SLiu Bo } 39773a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 39783fd0a558SYan, Zheng return 0; 39793fd0a558SYan, Zheng } 398076dda93cSYan, Zheng 39815d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 39825d4f98a2SYan Zheng { 39832ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39845d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 39855d4f98a2SYan Zheng struct btrfs_key key; 39865d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 39875d4f98a2SYan Zheng struct btrfs_path *path; 39885d4f98a2SYan Zheng struct btrfs_extent_item *ei; 39895d4f98a2SYan Zheng u64 flags; 39905d4f98a2SYan Zheng u32 item_size; 39915d4f98a2SYan Zheng int ret; 39925d4f98a2SYan Zheng int err = 0; 3993c87f08caSChris Mason int progress = 0; 39945d4f98a2SYan Zheng 39955d4f98a2SYan Zheng path = btrfs_alloc_path(); 39963fd0a558SYan, Zheng if (!path) 39975d4f98a2SYan Zheng return -ENOMEM; 3998e4058b54SDavid Sterba path->reada = READA_FORWARD; 39993fd0a558SYan, Zheng 40003fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 40013fd0a558SYan, Zheng if (ret) { 40023fd0a558SYan, Zheng err = ret; 40033fd0a558SYan, Zheng goto out_free; 40042423fdfbSJiri Slaby } 40055d4f98a2SYan Zheng 40065d4f98a2SYan Zheng while (1) { 40070647bf56SWang Shilong rc->reserved_bytes = 0; 40080647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 40090647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 40100647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 40110647bf56SWang Shilong if (ret) { 40120647bf56SWang Shilong err = ret; 40130647bf56SWang Shilong break; 40140647bf56SWang Shilong } 4015c87f08caSChris Mason progress++; 4016a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 40170f788c58SLiu Bo if (IS_ERR(trans)) { 40180f788c58SLiu Bo err = PTR_ERR(trans); 40190f788c58SLiu Bo trans = NULL; 40200f788c58SLiu Bo break; 40210f788c58SLiu Bo } 4022c87f08caSChris Mason restart: 40233fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 40243a45bb20SJeff Mahoney btrfs_end_transaction(trans); 402542a657f5SPan Bian trans = NULL; 40263fd0a558SYan, Zheng continue; 40273fd0a558SYan, Zheng } 40283fd0a558SYan, Zheng 4029147d256eSZhaolei ret = find_next_extent(rc, path, &key); 40305d4f98a2SYan Zheng if (ret < 0) 40315d4f98a2SYan Zheng err = ret; 40325d4f98a2SYan Zheng if (ret != 0) 40335d4f98a2SYan Zheng break; 40345d4f98a2SYan Zheng 40355d4f98a2SYan Zheng rc->extents_found++; 40365d4f98a2SYan Zheng 40375d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 40385d4f98a2SYan Zheng struct btrfs_extent_item); 40393fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 40405d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 40415d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 40425d4f98a2SYan Zheng ret = check_extent_flags(flags); 40435d4f98a2SYan Zheng BUG_ON(ret); 40446d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 4045ba3c2b19SNikolay Borisov err = -EINVAL; 4046ba3c2b19SNikolay Borisov btrfs_print_v0_err(trans->fs_info); 4047ba3c2b19SNikolay Borisov btrfs_abort_transaction(trans, err); 4048ba3c2b19SNikolay Borisov break; 40495d4f98a2SYan Zheng } else { 40505d4f98a2SYan Zheng BUG(); 40515d4f98a2SYan Zheng } 40525d4f98a2SYan Zheng 40535d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 40545d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 40555d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 40565d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40575d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 40585d4f98a2SYan Zheng } else { 4059b3b4aa74SDavid Sterba btrfs_release_path(path); 40605d4f98a2SYan Zheng ret = 0; 40615d4f98a2SYan Zheng } 40625d4f98a2SYan Zheng if (ret < 0) { 40633fd0a558SYan, Zheng err = ret; 40645d4f98a2SYan Zheng break; 40655d4f98a2SYan Zheng } 40665d4f98a2SYan Zheng 40675d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 40685d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 40695d4f98a2SYan Zheng if (ret < 0) { 40703fd0a558SYan, Zheng if (ret != -EAGAIN) { 40715d4f98a2SYan Zheng err = ret; 40725d4f98a2SYan Zheng break; 40735d4f98a2SYan Zheng } 40743fd0a558SYan, Zheng rc->extents_found--; 40753fd0a558SYan, Zheng rc->search_start = key.objectid; 40763fd0a558SYan, Zheng } 40775d4f98a2SYan Zheng } 40785d4f98a2SYan Zheng 40793a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 40802ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 40813fd0a558SYan, Zheng trans = NULL; 40825d4f98a2SYan Zheng 40835d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 40845d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40855d4f98a2SYan Zheng rc->found_file_extent = 1; 40860257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 40873fd0a558SYan, Zheng &key, &rc->cluster); 40885d4f98a2SYan Zheng if (ret < 0) { 40895d4f98a2SYan Zheng err = ret; 40905d4f98a2SYan Zheng break; 40915d4f98a2SYan Zheng } 40925d4f98a2SYan Zheng } 4093f31ea088SQu Wenruo if (btrfs_should_cancel_balance(fs_info)) { 4094f31ea088SQu Wenruo err = -ECANCELED; 4095f31ea088SQu Wenruo break; 4096f31ea088SQu Wenruo } 40975d4f98a2SYan Zheng } 4098c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 409943a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 41009689457bSShilong Wang if (ret == 1) { 4101c87f08caSChris Mason err = 0; 4102c87f08caSChris Mason progress = 0; 4103c87f08caSChris Mason goto restart; 4104c87f08caSChris Mason } 4105c87f08caSChris Mason } 41063fd0a558SYan, Zheng 4107b3b4aa74SDavid Sterba btrfs_release_path(path); 410891166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 41095d4f98a2SYan Zheng 41105d4f98a2SYan Zheng if (trans) { 41113a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 41122ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 41135d4f98a2SYan Zheng } 41145d4f98a2SYan Zheng 41150257bb82SYan, Zheng if (!err) { 41163fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 41173fd0a558SYan, Zheng &rc->cluster); 41180257bb82SYan, Zheng if (ret < 0) 41190257bb82SYan, Zheng err = ret; 41200257bb82SYan, Zheng } 41210257bb82SYan, Zheng 41223fd0a558SYan, Zheng rc->create_reloc_tree = 0; 41233fd0a558SYan, Zheng set_reloc_control(rc); 41240257bb82SYan, Zheng 41253fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 412663f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 41275d4f98a2SYan Zheng 41287f913c7cSQu Wenruo /* 41297f913c7cSQu Wenruo * Even in the case when the relocation is cancelled, we should all go 41307f913c7cSQu Wenruo * through prepare_to_merge() and merge_reloc_roots(). 41317f913c7cSQu Wenruo * 41327f913c7cSQu Wenruo * For error (including cancelled balance), prepare_to_merge() will 41337f913c7cSQu Wenruo * mark all reloc trees orphan, then queue them for cleanup in 41347f913c7cSQu Wenruo * merge_reloc_roots() 41357f913c7cSQu Wenruo */ 41363fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 41375d4f98a2SYan Zheng 41385d4f98a2SYan Zheng merge_reloc_roots(rc); 41395d4f98a2SYan Zheng 41403fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 41415d4f98a2SYan Zheng unset_reloc_control(rc); 414263f018beSNikolay Borisov btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1, NULL); 41435d4f98a2SYan Zheng 41445d4f98a2SYan Zheng /* get rid of pinned extents */ 41457a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 414662b99540SQu Wenruo if (IS_ERR(trans)) { 41473612b495STsutomu Itoh err = PTR_ERR(trans); 414862b99540SQu Wenruo goto out_free; 414962b99540SQu Wenruo } 41503a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 41516217b0faSJosef Bacik out_free: 4152d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4153d2311e69SQu Wenruo if (ret < 0 && !err) 4154d2311e69SQu Wenruo err = ret; 41552ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 41563fd0a558SYan, Zheng btrfs_free_path(path); 41575d4f98a2SYan Zheng return err; 41585d4f98a2SYan Zheng } 41595d4f98a2SYan Zheng 41605d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 41610257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 41625d4f98a2SYan Zheng { 41635d4f98a2SYan Zheng struct btrfs_path *path; 41645d4f98a2SYan Zheng struct btrfs_inode_item *item; 41655d4f98a2SYan Zheng struct extent_buffer *leaf; 41665d4f98a2SYan Zheng int ret; 41675d4f98a2SYan Zheng 41685d4f98a2SYan Zheng path = btrfs_alloc_path(); 41695d4f98a2SYan Zheng if (!path) 41705d4f98a2SYan Zheng return -ENOMEM; 41715d4f98a2SYan Zheng 41725d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 41735d4f98a2SYan Zheng if (ret) 41745d4f98a2SYan Zheng goto out; 41755d4f98a2SYan Zheng 41765d4f98a2SYan Zheng leaf = path->nodes[0]; 41775d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 4178b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 41795d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 41800257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 41815d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 41823fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 41833fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 41845d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 41855d4f98a2SYan Zheng out: 41865d4f98a2SYan Zheng btrfs_free_path(path); 41875d4f98a2SYan Zheng return ret; 41885d4f98a2SYan Zheng } 41895d4f98a2SYan Zheng 41905d4f98a2SYan Zheng /* 41915d4f98a2SYan Zheng * helper to create inode for data relocation. 41925d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 41935d4f98a2SYan Zheng */ 41943fd0a558SYan, Zheng static noinline_for_stack 41953fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 419632da5386SDavid Sterba struct btrfs_block_group *group) 41975d4f98a2SYan Zheng { 41985d4f98a2SYan Zheng struct inode *inode = NULL; 41995d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 42005d4f98a2SYan Zheng struct btrfs_root *root; 42015d4f98a2SYan Zheng struct btrfs_key key; 42024624900dSZhaolei u64 objectid; 42035d4f98a2SYan Zheng int err = 0; 42045d4f98a2SYan Zheng 42055d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 42065d4f98a2SYan Zheng if (IS_ERR(root)) 42075d4f98a2SYan Zheng return ERR_CAST(root); 42085d4f98a2SYan Zheng 4209a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 421076deacf0SJosef Bacik if (IS_ERR(trans)) { 421100246528SJosef Bacik btrfs_put_root(root); 42123fd0a558SYan, Zheng return ERR_CAST(trans); 421376deacf0SJosef Bacik } 42145d4f98a2SYan Zheng 4215581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 42165d4f98a2SYan Zheng if (err) 42175d4f98a2SYan Zheng goto out; 42185d4f98a2SYan Zheng 42190257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 42205d4f98a2SYan Zheng BUG_ON(err); 42215d4f98a2SYan Zheng 42225d4f98a2SYan Zheng key.objectid = objectid; 42235d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 42245d4f98a2SYan Zheng key.offset = 0; 42254c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 42262e19f1f9SAl Viro BUG_ON(IS_ERR(inode)); 4227b3470b5dSDavid Sterba BTRFS_I(inode)->index_cnt = group->start; 42285d4f98a2SYan Zheng 422973f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 42305d4f98a2SYan Zheng out: 423100246528SJosef Bacik btrfs_put_root(root); 42323a45bb20SJeff Mahoney btrfs_end_transaction(trans); 42332ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 42345d4f98a2SYan Zheng if (err) { 42355d4f98a2SYan Zheng if (inode) 42365d4f98a2SYan Zheng iput(inode); 42375d4f98a2SYan Zheng inode = ERR_PTR(err); 42385d4f98a2SYan Zheng } 42395d4f98a2SYan Zheng return inode; 42405d4f98a2SYan Zheng } 42415d4f98a2SYan Zheng 4242c258d6e3SQu Wenruo static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 42433fd0a558SYan, Zheng { 42443fd0a558SYan, Zheng struct reloc_control *rc; 42453fd0a558SYan, Zheng 42463fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 42473fd0a558SYan, Zheng if (!rc) 42483fd0a558SYan, Zheng return NULL; 42493fd0a558SYan, Zheng 42503fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 4251d2311e69SQu Wenruo INIT_LIST_HEAD(&rc->dirty_subvol_roots); 42523fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 42533fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 425443eb5f29SQu Wenruo extent_io_tree_init(fs_info, &rc->processed_blocks, 425543eb5f29SQu Wenruo IO_TREE_RELOC_BLOCKS, NULL); 42563fd0a558SYan, Zheng return rc; 42573fd0a558SYan, Zheng } 42583fd0a558SYan, Zheng 42591a0afa0eSJosef Bacik static void free_reloc_control(struct reloc_control *rc) 42601a0afa0eSJosef Bacik { 42611a0afa0eSJosef Bacik struct mapping_node *node, *tmp; 42621a0afa0eSJosef Bacik 42631a0afa0eSJosef Bacik free_reloc_roots(&rc->reloc_roots); 42641a0afa0eSJosef Bacik rbtree_postorder_for_each_entry_safe(node, tmp, 42651a0afa0eSJosef Bacik &rc->reloc_root_tree.rb_root, rb_node) 42661a0afa0eSJosef Bacik kfree(node); 42671a0afa0eSJosef Bacik 42681a0afa0eSJosef Bacik kfree(rc); 42691a0afa0eSJosef Bacik } 42701a0afa0eSJosef Bacik 42715d4f98a2SYan Zheng /* 4272ebce0e01SAdam Borowski * Print the block group being relocated 4273ebce0e01SAdam Borowski */ 4274ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 427532da5386SDavid Sterba struct btrfs_block_group *block_group) 4276ebce0e01SAdam Borowski { 4277f89e09cfSAnand Jain char buf[128] = {'\0'}; 4278ebce0e01SAdam Borowski 4279f89e09cfSAnand Jain btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); 4280ebce0e01SAdam Borowski 4281ebce0e01SAdam Borowski btrfs_info(fs_info, 4282ebce0e01SAdam Borowski "relocating block group %llu flags %s", 4283b3470b5dSDavid Sterba block_group->start, buf); 4284ebce0e01SAdam Borowski } 4285ebce0e01SAdam Borowski 4286430640e3SQu Wenruo static const char *stage_to_string(int stage) 4287430640e3SQu Wenruo { 4288430640e3SQu Wenruo if (stage == MOVE_DATA_EXTENTS) 4289430640e3SQu Wenruo return "move data extents"; 4290430640e3SQu Wenruo if (stage == UPDATE_DATA_PTRS) 4291430640e3SQu Wenruo return "update data pointers"; 4292430640e3SQu Wenruo return "unknown"; 4293430640e3SQu Wenruo } 4294430640e3SQu Wenruo 4295ebce0e01SAdam Borowski /* 42965d4f98a2SYan Zheng * function to relocate all extents in a block group. 42975d4f98a2SYan Zheng */ 42986bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 42995d4f98a2SYan Zheng { 430032da5386SDavid Sterba struct btrfs_block_group *bg; 43016bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 43025d4f98a2SYan Zheng struct reloc_control *rc; 43030af3d00bSJosef Bacik struct inode *inode; 43040af3d00bSJosef Bacik struct btrfs_path *path; 43055d4f98a2SYan Zheng int ret; 4306f0486c68SYan, Zheng int rw = 0; 43075d4f98a2SYan Zheng int err = 0; 43085d4f98a2SYan Zheng 4309eede2bf3SOmar Sandoval bg = btrfs_lookup_block_group(fs_info, group_start); 4310eede2bf3SOmar Sandoval if (!bg) 4311eede2bf3SOmar Sandoval return -ENOENT; 4312eede2bf3SOmar Sandoval 4313eede2bf3SOmar Sandoval if (btrfs_pinned_by_swapfile(fs_info, bg)) { 4314eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 4315eede2bf3SOmar Sandoval return -ETXTBSY; 4316eede2bf3SOmar Sandoval } 4317eede2bf3SOmar Sandoval 4318c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 4319eede2bf3SOmar Sandoval if (!rc) { 4320eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 43215d4f98a2SYan Zheng return -ENOMEM; 4322eede2bf3SOmar Sandoval } 43235d4f98a2SYan Zheng 4324f0486c68SYan, Zheng rc->extent_root = extent_root; 4325eede2bf3SOmar Sandoval rc->block_group = bg; 43265d4f98a2SYan Zheng 4327b12de528SQu Wenruo ret = btrfs_inc_block_group_ro(rc->block_group, true); 4328f0486c68SYan, Zheng if (ret) { 4329f0486c68SYan, Zheng err = ret; 4330f0486c68SYan, Zheng goto out; 4331f0486c68SYan, Zheng } 4332f0486c68SYan, Zheng rw = 1; 4333f0486c68SYan, Zheng 43340af3d00bSJosef Bacik path = btrfs_alloc_path(); 43350af3d00bSJosef Bacik if (!path) { 43360af3d00bSJosef Bacik err = -ENOMEM; 43370af3d00bSJosef Bacik goto out; 43380af3d00bSJosef Bacik } 43390af3d00bSJosef Bacik 43407949f339SDavid Sterba inode = lookup_free_space_inode(rc->block_group, path); 43410af3d00bSJosef Bacik btrfs_free_path(path); 43420af3d00bSJosef Bacik 43430af3d00bSJosef Bacik if (!IS_ERR(inode)) 43441bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 43450af3d00bSJosef Bacik else 43460af3d00bSJosef Bacik ret = PTR_ERR(inode); 43470af3d00bSJosef Bacik 43480af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 43490af3d00bSJosef Bacik err = ret; 43500af3d00bSJosef Bacik goto out; 43510af3d00bSJosef Bacik } 43520af3d00bSJosef Bacik 43535d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 43545d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 43555d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 43565d4f98a2SYan Zheng rc->data_inode = NULL; 43575d4f98a2SYan Zheng goto out; 43585d4f98a2SYan Zheng } 43595d4f98a2SYan Zheng 43600b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 43615d4f98a2SYan Zheng 43629cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4363f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 43646374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 4365b3470b5dSDavid Sterba rc->block_group->start, 4366b3470b5dSDavid Sterba rc->block_group->length); 43675d4f98a2SYan Zheng 43685d4f98a2SYan Zheng while (1) { 4369430640e3SQu Wenruo int finishes_stage; 4370430640e3SQu Wenruo 437176dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 43725d4f98a2SYan Zheng ret = relocate_block_group(rc); 437376dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 4374ff612ba7SJosef Bacik if (ret < 0) 43755d4f98a2SYan Zheng err = ret; 4376ff612ba7SJosef Bacik 4377430640e3SQu Wenruo finishes_stage = rc->stage; 4378ff612ba7SJosef Bacik /* 4379ff612ba7SJosef Bacik * We may have gotten ENOSPC after we already dirtied some 4380ff612ba7SJosef Bacik * extents. If writeout happens while we're relocating a 4381ff612ba7SJosef Bacik * different block group we could end up hitting the 4382ff612ba7SJosef Bacik * BUG_ON(rc->stage == UPDATE_DATA_PTRS) in 4383ff612ba7SJosef Bacik * btrfs_reloc_cow_block. Make sure we write everything out 4384ff612ba7SJosef Bacik * properly so we don't trip over this problem, and then break 4385ff612ba7SJosef Bacik * out of the loop if we hit an error. 4386ff612ba7SJosef Bacik */ 4387ff612ba7SJosef Bacik if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 4388ff612ba7SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 4389ff612ba7SJosef Bacik (u64)-1); 4390ff612ba7SJosef Bacik if (ret) 4391ff612ba7SJosef Bacik err = ret; 4392ff612ba7SJosef Bacik invalidate_mapping_pages(rc->data_inode->i_mapping, 4393ff612ba7SJosef Bacik 0, -1); 4394ff612ba7SJosef Bacik rc->stage = UPDATE_DATA_PTRS; 43955d4f98a2SYan Zheng } 43965d4f98a2SYan Zheng 4397ff612ba7SJosef Bacik if (err < 0) 4398ff612ba7SJosef Bacik goto out; 4399ff612ba7SJosef Bacik 44005d4f98a2SYan Zheng if (rc->extents_found == 0) 44015d4f98a2SYan Zheng break; 44025d4f98a2SYan Zheng 4403430640e3SQu Wenruo btrfs_info(fs_info, "found %llu extents, stage: %s", 4404430640e3SQu Wenruo rc->extents_found, stage_to_string(finishes_stage)); 44055d4f98a2SYan Zheng } 44065d4f98a2SYan Zheng 44075d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 44085d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 4409bf38be65SDavid Sterba WARN_ON(rc->block_group->used > 0); 44105d4f98a2SYan Zheng out: 4411f0486c68SYan, Zheng if (err && rw) 44122ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 44135d4f98a2SYan Zheng iput(rc->data_inode); 44145d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 44151a0afa0eSJosef Bacik free_reloc_control(rc); 44165d4f98a2SYan Zheng return err; 44175d4f98a2SYan Zheng } 44185d4f98a2SYan Zheng 441976dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 442076dda93cSYan, Zheng { 44210b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 442276dda93cSYan, Zheng struct btrfs_trans_handle *trans; 442379787eaaSJeff Mahoney int ret, err; 442476dda93cSYan, Zheng 44250b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 442679787eaaSJeff Mahoney if (IS_ERR(trans)) 442779787eaaSJeff Mahoney return PTR_ERR(trans); 442876dda93cSYan, Zheng 442976dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 443076dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 443176dda93cSYan, Zheng root->root_item.drop_level = 0; 443276dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 44330b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 443476dda93cSYan, Zheng &root->root_key, &root->root_item); 443576dda93cSYan, Zheng 44363a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 443779787eaaSJeff Mahoney if (err) 443879787eaaSJeff Mahoney return err; 443979787eaaSJeff Mahoney return ret; 444076dda93cSYan, Zheng } 444176dda93cSYan, Zheng 44425d4f98a2SYan Zheng /* 44435d4f98a2SYan Zheng * recover relocation interrupted by system crash. 44445d4f98a2SYan Zheng * 44455d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 44465d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 44475d4f98a2SYan Zheng */ 44485d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 44495d4f98a2SYan Zheng { 44500b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 44515d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 44525d4f98a2SYan Zheng struct btrfs_key key; 44535d4f98a2SYan Zheng struct btrfs_root *fs_root; 44545d4f98a2SYan Zheng struct btrfs_root *reloc_root; 44555d4f98a2SYan Zheng struct btrfs_path *path; 44565d4f98a2SYan Zheng struct extent_buffer *leaf; 44575d4f98a2SYan Zheng struct reloc_control *rc = NULL; 44585d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 44595d4f98a2SYan Zheng int ret; 44605d4f98a2SYan Zheng int err = 0; 44615d4f98a2SYan Zheng 44625d4f98a2SYan Zheng path = btrfs_alloc_path(); 44635d4f98a2SYan Zheng if (!path) 44645d4f98a2SYan Zheng return -ENOMEM; 4465e4058b54SDavid Sterba path->reada = READA_BACK; 44665d4f98a2SYan Zheng 44675d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 44685d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 44695d4f98a2SYan Zheng key.offset = (u64)-1; 44705d4f98a2SYan Zheng 44715d4f98a2SYan Zheng while (1) { 44720b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 44735d4f98a2SYan Zheng path, 0, 0); 44745d4f98a2SYan Zheng if (ret < 0) { 44755d4f98a2SYan Zheng err = ret; 44765d4f98a2SYan Zheng goto out; 44775d4f98a2SYan Zheng } 44785d4f98a2SYan Zheng if (ret > 0) { 44795d4f98a2SYan Zheng if (path->slots[0] == 0) 44805d4f98a2SYan Zheng break; 44815d4f98a2SYan Zheng path->slots[0]--; 44825d4f98a2SYan Zheng } 44835d4f98a2SYan Zheng leaf = path->nodes[0]; 44845d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4485b3b4aa74SDavid Sterba btrfs_release_path(path); 44865d4f98a2SYan Zheng 44875d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 44885d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 44895d4f98a2SYan Zheng break; 44905d4f98a2SYan Zheng 44913dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(root, &key); 44925d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 44935d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 44945d4f98a2SYan Zheng goto out; 44955d4f98a2SYan Zheng } 44965d4f98a2SYan Zheng 44973dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 44985d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 44995d4f98a2SYan Zheng 45005d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 45010b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, 45025d4f98a2SYan Zheng reloc_root->root_key.offset); 45035d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 450476dda93cSYan, Zheng ret = PTR_ERR(fs_root); 450576dda93cSYan, Zheng if (ret != -ENOENT) { 450676dda93cSYan, Zheng err = ret; 45075d4f98a2SYan Zheng goto out; 45085d4f98a2SYan Zheng } 450979787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 451079787eaaSJeff Mahoney if (ret < 0) { 451179787eaaSJeff Mahoney err = ret; 451279787eaaSJeff Mahoney goto out; 451379787eaaSJeff Mahoney } 4514932fd26dSJosef Bacik } else { 451500246528SJosef Bacik btrfs_put_root(fs_root); 451676dda93cSYan, Zheng } 45175d4f98a2SYan Zheng } 45185d4f98a2SYan Zheng 45195d4f98a2SYan Zheng if (key.offset == 0) 45205d4f98a2SYan Zheng break; 45215d4f98a2SYan Zheng 45225d4f98a2SYan Zheng key.offset--; 45235d4f98a2SYan Zheng } 4524b3b4aa74SDavid Sterba btrfs_release_path(path); 45255d4f98a2SYan Zheng 45265d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 45275d4f98a2SYan Zheng goto out; 45285d4f98a2SYan Zheng 4529c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 45305d4f98a2SYan Zheng if (!rc) { 45315d4f98a2SYan Zheng err = -ENOMEM; 45325d4f98a2SYan Zheng goto out; 45335d4f98a2SYan Zheng } 45345d4f98a2SYan Zheng 45350b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 45365d4f98a2SYan Zheng 45375d4f98a2SYan Zheng set_reloc_control(rc); 45385d4f98a2SYan Zheng 45397a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 45403612b495STsutomu Itoh if (IS_ERR(trans)) { 45413612b495STsutomu Itoh err = PTR_ERR(trans); 4542fb2d83eeSJosef Bacik goto out_unset; 45433612b495STsutomu Itoh } 45443fd0a558SYan, Zheng 45453fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 45463fd0a558SYan, Zheng 45475d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 45485d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 45495d4f98a2SYan Zheng struct btrfs_root, root_list); 45505d4f98a2SYan Zheng list_del(&reloc_root->root_list); 45515d4f98a2SYan Zheng 45525d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 45535d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 45545d4f98a2SYan Zheng &rc->reloc_roots); 45555d4f98a2SYan Zheng continue; 45565d4f98a2SYan Zheng } 45575d4f98a2SYan Zheng 45580b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, reloc_root->root_key.offset); 455979787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 456079787eaaSJeff Mahoney err = PTR_ERR(fs_root); 4561ca1aa281SJosef Bacik list_add_tail(&reloc_root->root_list, &reloc_roots); 45621402d17dSXiyu Yang btrfs_end_transaction(trans); 4563fb2d83eeSJosef Bacik goto out_unset; 456479787eaaSJeff Mahoney } 45655d4f98a2SYan Zheng 4566ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 456779787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 4568f44deb74SJosef Bacik fs_root->reloc_root = btrfs_grab_root(reloc_root); 456900246528SJosef Bacik btrfs_put_root(fs_root); 45705d4f98a2SYan Zheng } 45715d4f98a2SYan Zheng 45723a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 457379787eaaSJeff Mahoney if (err) 4574fb2d83eeSJosef Bacik goto out_unset; 45755d4f98a2SYan Zheng 45765d4f98a2SYan Zheng merge_reloc_roots(rc); 45775d4f98a2SYan Zheng 45785d4f98a2SYan Zheng unset_reloc_control(rc); 45795d4f98a2SYan Zheng 45807a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 458162b99540SQu Wenruo if (IS_ERR(trans)) { 45823612b495STsutomu Itoh err = PTR_ERR(trans); 45836217b0faSJosef Bacik goto out_clean; 458462b99540SQu Wenruo } 45853a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 45866217b0faSJosef Bacik out_clean: 4587d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4588d2311e69SQu Wenruo if (ret < 0 && !err) 4589d2311e69SQu Wenruo err = ret; 4590fb2d83eeSJosef Bacik out_unset: 4591fb2d83eeSJosef Bacik unset_reloc_control(rc); 45921a0afa0eSJosef Bacik free_reloc_control(rc); 45933612b495STsutomu Itoh out: 4594aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4595aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4596aca1bba6SLiu Bo 45975d4f98a2SYan Zheng btrfs_free_path(path); 45985d4f98a2SYan Zheng 45995d4f98a2SYan Zheng if (err == 0) { 46005d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 46010b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 4602932fd26dSJosef Bacik if (IS_ERR(fs_root)) { 46035d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4604932fd26dSJosef Bacik } else { 460566b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 460600246528SJosef Bacik btrfs_put_root(fs_root); 4607932fd26dSJosef Bacik } 4608932fd26dSJosef Bacik } 46095d4f98a2SYan Zheng return err; 46105d4f98a2SYan Zheng } 46115d4f98a2SYan Zheng 46125d4f98a2SYan Zheng /* 46135d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 46145d4f98a2SYan Zheng * 46155d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 46165d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 46175d4f98a2SYan Zheng */ 46185d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 46195d4f98a2SYan Zheng { 46200b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 46215d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 46225d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 46235d4f98a2SYan Zheng int ret; 46245d4f98a2SYan Zheng u64 disk_bytenr; 46254577b014SJosef Bacik u64 new_bytenr; 46265d4f98a2SYan Zheng LIST_HEAD(list); 46275d4f98a2SYan Zheng 46285d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 4629bffe633eSOmar Sandoval BUG_ON(ordered->file_offset != file_pos || ordered->num_bytes != len); 46305d4f98a2SYan Zheng 46315d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 46320b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4633a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 463479787eaaSJeff Mahoney if (ret) 463579787eaaSJeff Mahoney goto out; 46365d4f98a2SYan Zheng 46375d4f98a2SYan Zheng while (!list_empty(&list)) { 46385d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 46395d4f98a2SYan Zheng list_del_init(&sums->list); 46405d4f98a2SYan Zheng 46414577b014SJosef Bacik /* 46424577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 46434577b014SJosef Bacik * We need to do this because we will read in entire prealloc 46444577b014SJosef Bacik * extents but we may have written to say the middle of the 46454577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 46464577b014SJosef Bacik * the right disk offset. 46474577b014SJosef Bacik * 46484577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 46494577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 46504577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 46514577b014SJosef Bacik * disk length. 46524577b014SJosef Bacik */ 4653bffe633eSOmar Sandoval new_bytenr = ordered->disk_bytenr + sums->bytenr - disk_bytenr; 46544577b014SJosef Bacik sums->bytenr = new_bytenr; 46555d4f98a2SYan Zheng 4656f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 46575d4f98a2SYan Zheng } 465879787eaaSJeff Mahoney out: 46595d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4660411fc6bcSAndi Kleen return ret; 46615d4f98a2SYan Zheng } 46623fd0a558SYan, Zheng 466383d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 46643fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 46653fd0a558SYan, Zheng struct extent_buffer *cow) 46663fd0a558SYan, Zheng { 46670b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 46683fd0a558SYan, Zheng struct reloc_control *rc; 46693fd0a558SYan, Zheng struct backref_node *node; 46703fd0a558SYan, Zheng int first_cow = 0; 46713fd0a558SYan, Zheng int level; 467283d4cfd4SJosef Bacik int ret = 0; 46733fd0a558SYan, Zheng 46740b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 46753fd0a558SYan, Zheng if (!rc) 467683d4cfd4SJosef Bacik return 0; 46773fd0a558SYan, Zheng 46783fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 46793fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 46803fd0a558SYan, Zheng 46813fd0a558SYan, Zheng level = btrfs_header_level(buf); 46823fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 46833fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 46843fd0a558SYan, Zheng first_cow = 1; 46853fd0a558SYan, Zheng 46863fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 46873fd0a558SYan, Zheng rc->create_reloc_tree) { 46883fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 46893fd0a558SYan, Zheng 46903fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 46913fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 46923fd0a558SYan, Zheng node->new_bytenr != buf->start); 46933fd0a558SYan, Zheng 46943fd0a558SYan, Zheng drop_node_buffer(node); 469567439dadSDavid Sterba atomic_inc(&cow->refs); 46963fd0a558SYan, Zheng node->eb = cow; 46973fd0a558SYan, Zheng node->new_bytenr = cow->start; 46983fd0a558SYan, Zheng 46993fd0a558SYan, Zheng if (!node->pending) { 47003fd0a558SYan, Zheng list_move_tail(&node->list, 47013fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 47023fd0a558SYan, Zheng node->pending = 1; 47033fd0a558SYan, Zheng } 47043fd0a558SYan, Zheng 47053fd0a558SYan, Zheng if (first_cow) 47063fd0a558SYan, Zheng __mark_block_processed(rc, node); 47073fd0a558SYan, Zheng 47083fd0a558SYan, Zheng if (first_cow && level > 0) 47093fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 47103fd0a558SYan, Zheng } 47113fd0a558SYan, Zheng 471283d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 47133fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 471483d4cfd4SJosef Bacik return ret; 47153fd0a558SYan, Zheng } 47163fd0a558SYan, Zheng 47173fd0a558SYan, Zheng /* 47183fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 471901327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 47203fd0a558SYan, Zheng */ 4721147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 47223fd0a558SYan, Zheng u64 *bytes_to_reserve) 47233fd0a558SYan, Zheng { 472410995c04SQu Wenruo struct btrfs_root *root = pending->root; 472510995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 47263fd0a558SYan, Zheng 47276282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 47283fd0a558SYan, Zheng return; 47293fd0a558SYan, Zheng 47303fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 47313fd0a558SYan, Zheng return; 47323fd0a558SYan, Zheng 47333fd0a558SYan, Zheng root = root->reloc_root; 47343fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 47353fd0a558SYan, Zheng /* 47363fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 47373fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 47383fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 47393fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 47403fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 47413fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 47423fd0a558SYan, Zheng * tree may use more space than it frees. so we need 47433fd0a558SYan, Zheng * reserve extra space. 47443fd0a558SYan, Zheng */ 47453fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 47463fd0a558SYan, Zheng } 47473fd0a558SYan, Zheng 47483fd0a558SYan, Zheng /* 47493fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 47503fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 4751f44deb74SJosef Bacik * 4752f44deb74SJosef Bacik * This is similar to btrfs_init_reloc_root(), we come out of here with two 4753f44deb74SJosef Bacik * references held on the reloc_root, one for root->reloc_root and one for 4754f44deb74SJosef Bacik * rc->reloc_roots. 47553fd0a558SYan, Zheng */ 475649b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 47573fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 47583fd0a558SYan, Zheng { 47593fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 47603fd0a558SYan, Zheng struct btrfs_root *reloc_root; 47613fd0a558SYan, Zheng struct btrfs_root *new_root; 476210995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 47633fd0a558SYan, Zheng int ret; 47643fd0a558SYan, Zheng 47656282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 476649b25e05SJeff Mahoney return 0; 47673fd0a558SYan, Zheng 47683fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 47693fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 47703fd0a558SYan, Zheng 47713fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 47723fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 47733fd0a558SYan, Zheng rc->block_rsv, 47743a584174SLu Fengqi rc->nodes_relocated, true); 477549b25e05SJeff Mahoney if (ret) 477649b25e05SJeff Mahoney return ret; 47773fd0a558SYan, Zheng } 47783fd0a558SYan, Zheng 47793fd0a558SYan, Zheng new_root = pending->snap; 47803fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 47813fd0a558SYan, Zheng new_root->root_key.objectid); 478249b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 478349b25e05SJeff Mahoney return PTR_ERR(reloc_root); 47843fd0a558SYan, Zheng 4785ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4786ffd7b339SJeff Mahoney BUG_ON(ret < 0); 4787f44deb74SJosef Bacik new_root->reloc_root = btrfs_grab_root(reloc_root); 47883fd0a558SYan, Zheng 478949b25e05SJeff Mahoney if (rc->create_reloc_tree) 47903fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 479149b25e05SJeff Mahoney return ret; 47923fd0a558SYan, Zheng } 4793