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> 125d4f98a2SYan Zheng #include "ctree.h" 135d4f98a2SYan Zheng #include "disk-io.h" 145d4f98a2SYan Zheng #include "transaction.h" 155d4f98a2SYan Zheng #include "volumes.h" 165d4f98a2SYan Zheng #include "locking.h" 175d4f98a2SYan Zheng #include "btrfs_inode.h" 185d4f98a2SYan Zheng #include "async-thread.h" 190af3d00bSJosef Bacik #include "free-space-cache.h" 20581bb050SLi Zefan #include "inode-map.h" 2162b99540SQu Wenruo #include "qgroup.h" 22cdccee99SLiu Bo #include "print-tree.h" 2386736342SJosef Bacik #include "delalloc-space.h" 24aac0023cSJosef Bacik #include "block-group.h" 255d4f98a2SYan Zheng 265d4f98a2SYan Zheng /* 270c891389SQu Wenruo * Relocation overview 280c891389SQu Wenruo * 290c891389SQu Wenruo * [What does relocation do] 300c891389SQu Wenruo * 310c891389SQu Wenruo * The objective of relocation is to relocate all extents of the target block 320c891389SQu Wenruo * group to other block groups. 330c891389SQu Wenruo * This is utilized by resize (shrink only), profile converting, compacting 340c891389SQu Wenruo * space, or balance routine to spread chunks over devices. 350c891389SQu Wenruo * 360c891389SQu Wenruo * Before | After 370c891389SQu Wenruo * ------------------------------------------------------------------ 380c891389SQu Wenruo * BG A: 10 data extents | BG A: deleted 390c891389SQu Wenruo * BG B: 2 data extents | BG B: 10 data extents (2 old + 8 relocated) 400c891389SQu Wenruo * BG C: 1 extents | BG C: 3 data extents (1 old + 2 relocated) 410c891389SQu Wenruo * 420c891389SQu Wenruo * [How does relocation work] 430c891389SQu Wenruo * 440c891389SQu Wenruo * 1. Mark the target block group read-only 450c891389SQu Wenruo * New extents won't be allocated from the target block group. 460c891389SQu Wenruo * 470c891389SQu Wenruo * 2.1 Record each extent in the target block group 480c891389SQu Wenruo * To build a proper map of extents to be relocated. 490c891389SQu Wenruo * 500c891389SQu Wenruo * 2.2 Build data reloc tree and reloc trees 510c891389SQu Wenruo * Data reloc tree will contain an inode, recording all newly relocated 520c891389SQu Wenruo * data extents. 530c891389SQu Wenruo * There will be only one data reloc tree for one data block group. 540c891389SQu Wenruo * 550c891389SQu Wenruo * Reloc tree will be a special snapshot of its source tree, containing 560c891389SQu Wenruo * relocated tree blocks. 570c891389SQu Wenruo * Each tree referring to a tree block in target block group will get its 580c891389SQu Wenruo * reloc tree built. 590c891389SQu Wenruo * 600c891389SQu Wenruo * 2.3 Swap source tree with its corresponding reloc tree 610c891389SQu Wenruo * Each involved tree only refers to new extents after swap. 620c891389SQu Wenruo * 630c891389SQu Wenruo * 3. Cleanup reloc trees and data reloc tree. 640c891389SQu Wenruo * As old extents in the target block group are still referenced by reloc 650c891389SQu Wenruo * trees, we need to clean them up before really freeing the target block 660c891389SQu Wenruo * group. 670c891389SQu Wenruo * 680c891389SQu Wenruo * The main complexity is in steps 2.2 and 2.3. 690c891389SQu Wenruo * 700c891389SQu Wenruo * The entry point of relocation is relocate_block_group() function. 710c891389SQu Wenruo */ 720c891389SQu Wenruo 730c891389SQu Wenruo /* 745d4f98a2SYan Zheng * backref_node, mapping_node and tree_block start with this 755d4f98a2SYan Zheng */ 765d4f98a2SYan Zheng struct tree_entry { 775d4f98a2SYan Zheng struct rb_node rb_node; 785d4f98a2SYan Zheng u64 bytenr; 795d4f98a2SYan Zheng }; 805d4f98a2SYan Zheng 815d4f98a2SYan Zheng /* 825d4f98a2SYan Zheng * present a tree block in the backref cache 835d4f98a2SYan Zheng */ 845d4f98a2SYan Zheng struct backref_node { 855d4f98a2SYan Zheng struct rb_node rb_node; 865d4f98a2SYan Zheng u64 bytenr; 873fd0a558SYan, Zheng 883fd0a558SYan, Zheng u64 new_bytenr; 893fd0a558SYan, Zheng /* objectid of tree block owner, can be not uptodate */ 905d4f98a2SYan Zheng u64 owner; 913fd0a558SYan, Zheng /* link to pending, changed or detached list */ 923fd0a558SYan, Zheng struct list_head list; 935d4f98a2SYan Zheng /* list of upper level blocks reference this block */ 945d4f98a2SYan Zheng struct list_head upper; 955d4f98a2SYan Zheng /* list of child blocks in the cache */ 965d4f98a2SYan Zheng struct list_head lower; 975d4f98a2SYan Zheng /* NULL if this node is not tree root */ 985d4f98a2SYan Zheng struct btrfs_root *root; 995d4f98a2SYan Zheng /* extent buffer got by COW the block */ 1005d4f98a2SYan Zheng struct extent_buffer *eb; 1015d4f98a2SYan Zheng /* level of tree block */ 1025d4f98a2SYan Zheng unsigned int level:8; 1033fd0a558SYan, Zheng /* is the block in non-reference counted tree */ 1043fd0a558SYan, Zheng unsigned int cowonly:1; 1053fd0a558SYan, Zheng /* 1 if no child node in the cache */ 1065d4f98a2SYan Zheng unsigned int lowest:1; 1075d4f98a2SYan Zheng /* is the extent buffer locked */ 1085d4f98a2SYan Zheng unsigned int locked:1; 1095d4f98a2SYan Zheng /* has the block been processed */ 1105d4f98a2SYan Zheng unsigned int processed:1; 1115d4f98a2SYan Zheng /* have backrefs of this block been checked */ 1125d4f98a2SYan Zheng unsigned int checked:1; 1133fd0a558SYan, Zheng /* 1143fd0a558SYan, Zheng * 1 if corresponding block has been cowed but some upper 1153fd0a558SYan, Zheng * level block pointers may not point to the new location 1163fd0a558SYan, Zheng */ 1173fd0a558SYan, Zheng unsigned int pending:1; 1183fd0a558SYan, Zheng /* 1193fd0a558SYan, Zheng * 1 if the backref node isn't connected to any other 1203fd0a558SYan, Zheng * backref node. 1213fd0a558SYan, Zheng */ 1223fd0a558SYan, Zheng unsigned int detached:1; 1235d4f98a2SYan Zheng }; 1245d4f98a2SYan Zheng 1255d4f98a2SYan Zheng /* 1265d4f98a2SYan Zheng * present a block pointer in the backref cache 1275d4f98a2SYan Zheng */ 1285d4f98a2SYan Zheng struct backref_edge { 1295d4f98a2SYan Zheng struct list_head list[2]; 1305d4f98a2SYan Zheng struct backref_node *node[2]; 1315d4f98a2SYan Zheng }; 1325d4f98a2SYan Zheng 1335d4f98a2SYan Zheng #define LOWER 0 1345d4f98a2SYan Zheng #define UPPER 1 1350647bf56SWang Shilong #define RELOCATION_RESERVED_NODES 256 1365d4f98a2SYan Zheng 1375d4f98a2SYan Zheng struct backref_cache { 1385d4f98a2SYan Zheng /* red black tree of all backref nodes in the cache */ 1395d4f98a2SYan Zheng struct rb_root rb_root; 1403fd0a558SYan, Zheng /* for passing backref nodes to btrfs_reloc_cow_block */ 1413fd0a558SYan, Zheng struct backref_node *path[BTRFS_MAX_LEVEL]; 1423fd0a558SYan, Zheng /* 1433fd0a558SYan, Zheng * list of blocks that have been cowed but some block 1443fd0a558SYan, Zheng * pointers in upper level blocks may not reflect the 1453fd0a558SYan, Zheng * new location 1463fd0a558SYan, Zheng */ 1475d4f98a2SYan Zheng struct list_head pending[BTRFS_MAX_LEVEL]; 1483fd0a558SYan, Zheng /* list of backref nodes with no child node */ 1493fd0a558SYan, Zheng struct list_head leaves; 1503fd0a558SYan, Zheng /* list of blocks that have been cowed in current transaction */ 1513fd0a558SYan, Zheng struct list_head changed; 1523fd0a558SYan, Zheng /* list of detached backref node. */ 1533fd0a558SYan, Zheng struct list_head detached; 1543fd0a558SYan, Zheng 1553fd0a558SYan, Zheng u64 last_trans; 1563fd0a558SYan, Zheng 1573fd0a558SYan, Zheng int nr_nodes; 1583fd0a558SYan, Zheng int nr_edges; 1595d4f98a2SYan Zheng }; 1605d4f98a2SYan Zheng 1615d4f98a2SYan Zheng /* 1625d4f98a2SYan Zheng * map address of tree root to tree 1635d4f98a2SYan Zheng */ 1645d4f98a2SYan Zheng struct mapping_node { 1655d4f98a2SYan Zheng struct rb_node rb_node; 1665d4f98a2SYan Zheng u64 bytenr; 1675d4f98a2SYan Zheng void *data; 1685d4f98a2SYan Zheng }; 1695d4f98a2SYan Zheng 1705d4f98a2SYan Zheng struct mapping_tree { 1715d4f98a2SYan Zheng struct rb_root rb_root; 1725d4f98a2SYan Zheng spinlock_t lock; 1735d4f98a2SYan Zheng }; 1745d4f98a2SYan Zheng 1755d4f98a2SYan Zheng /* 1765d4f98a2SYan Zheng * present a tree block to process 1775d4f98a2SYan Zheng */ 1785d4f98a2SYan Zheng struct tree_block { 1795d4f98a2SYan Zheng struct rb_node rb_node; 1805d4f98a2SYan Zheng u64 bytenr; 1815d4f98a2SYan Zheng struct btrfs_key key; 1825d4f98a2SYan Zheng unsigned int level:8; 1835d4f98a2SYan Zheng unsigned int key_ready:1; 1845d4f98a2SYan Zheng }; 1855d4f98a2SYan Zheng 1860257bb82SYan, Zheng #define MAX_EXTENTS 128 1870257bb82SYan, Zheng 1880257bb82SYan, Zheng struct file_extent_cluster { 1890257bb82SYan, Zheng u64 start; 1900257bb82SYan, Zheng u64 end; 1910257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 1920257bb82SYan, Zheng unsigned int nr; 1930257bb82SYan, Zheng }; 1940257bb82SYan, Zheng 1955d4f98a2SYan Zheng struct reloc_control { 1965d4f98a2SYan Zheng /* block group to relocate */ 19732da5386SDavid Sterba struct btrfs_block_group *block_group; 1985d4f98a2SYan Zheng /* extent tree */ 1995d4f98a2SYan Zheng struct btrfs_root *extent_root; 2005d4f98a2SYan Zheng /* inode for moving data */ 2015d4f98a2SYan Zheng struct inode *data_inode; 2023fd0a558SYan, Zheng 2033fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 2043fd0a558SYan, Zheng 2053fd0a558SYan, Zheng struct backref_cache backref_cache; 2063fd0a558SYan, Zheng 2073fd0a558SYan, Zheng struct file_extent_cluster cluster; 2085d4f98a2SYan Zheng /* tree blocks have been processed */ 2095d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 2105d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 2115d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 2125d4f98a2SYan Zheng /* list of reloc trees */ 2135d4f98a2SYan Zheng struct list_head reloc_roots; 214d2311e69SQu Wenruo /* list of subvolume trees that get relocated */ 215d2311e69SQu Wenruo struct list_head dirty_subvol_roots; 2163fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 2173fd0a558SYan, Zheng u64 merging_rsv_size; 2183fd0a558SYan, Zheng /* size of relocated tree nodes */ 2193fd0a558SYan, Zheng u64 nodes_relocated; 2200647bf56SWang Shilong /* reserved size for block group relocation*/ 2210647bf56SWang Shilong u64 reserved_bytes; 2223fd0a558SYan, Zheng 2235d4f98a2SYan Zheng u64 search_start; 2245d4f98a2SYan Zheng u64 extents_found; 2253fd0a558SYan, Zheng 2263fd0a558SYan, Zheng unsigned int stage:8; 2273fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 2283fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 2295d4f98a2SYan Zheng unsigned int found_file_extent:1; 2305d4f98a2SYan Zheng }; 2315d4f98a2SYan Zheng 2325d4f98a2SYan Zheng /* stages of data relocation */ 2335d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 2345d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 2355d4f98a2SYan Zheng 2363fd0a558SYan, Zheng static void remove_backref_node(struct backref_cache *cache, 2373fd0a558SYan, Zheng struct backref_node *node); 2383fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 2393fd0a558SYan, Zheng struct backref_node *node); 2405d4f98a2SYan Zheng 2415d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 2425d4f98a2SYan Zheng { 2436bef4d31SEric Paris tree->rb_root = RB_ROOT; 2445d4f98a2SYan Zheng spin_lock_init(&tree->lock); 2455d4f98a2SYan Zheng } 2465d4f98a2SYan Zheng 2475d4f98a2SYan Zheng static void backref_cache_init(struct backref_cache *cache) 2485d4f98a2SYan Zheng { 2495d4f98a2SYan Zheng int i; 2506bef4d31SEric Paris cache->rb_root = RB_ROOT; 2515d4f98a2SYan Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2525d4f98a2SYan Zheng INIT_LIST_HEAD(&cache->pending[i]); 2533fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->changed); 2543fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->detached); 2553fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->leaves); 2565d4f98a2SYan Zheng } 2575d4f98a2SYan Zheng 2583fd0a558SYan, Zheng static void backref_cache_cleanup(struct backref_cache *cache) 2595d4f98a2SYan Zheng { 2603fd0a558SYan, Zheng struct backref_node *node; 2613fd0a558SYan, Zheng int i; 2623fd0a558SYan, Zheng 2633fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2643fd0a558SYan, Zheng node = list_entry(cache->detached.next, 2653fd0a558SYan, Zheng struct backref_node, list); 2663fd0a558SYan, Zheng remove_backref_node(cache, node); 2673fd0a558SYan, Zheng } 2683fd0a558SYan, Zheng 2693fd0a558SYan, Zheng while (!list_empty(&cache->leaves)) { 2703fd0a558SYan, Zheng node = list_entry(cache->leaves.next, 2713fd0a558SYan, Zheng struct backref_node, lower); 2723fd0a558SYan, Zheng remove_backref_node(cache, node); 2733fd0a558SYan, Zheng } 2743fd0a558SYan, Zheng 2753fd0a558SYan, Zheng cache->last_trans = 0; 2763fd0a558SYan, Zheng 2773fd0a558SYan, Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 278f4907095SLiu Bo ASSERT(list_empty(&cache->pending[i])); 279f4907095SLiu Bo ASSERT(list_empty(&cache->changed)); 280f4907095SLiu Bo ASSERT(list_empty(&cache->detached)); 281f4907095SLiu Bo ASSERT(RB_EMPTY_ROOT(&cache->rb_root)); 282f4907095SLiu Bo ASSERT(!cache->nr_nodes); 283f4907095SLiu Bo ASSERT(!cache->nr_edges); 2843fd0a558SYan, Zheng } 2853fd0a558SYan, Zheng 2863fd0a558SYan, Zheng static struct backref_node *alloc_backref_node(struct backref_cache *cache) 2873fd0a558SYan, Zheng { 2883fd0a558SYan, Zheng struct backref_node *node; 2893fd0a558SYan, Zheng 2903fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 2913fd0a558SYan, Zheng if (node) { 2923fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 2935d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 2945d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 2955d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 2963fd0a558SYan, Zheng cache->nr_nodes++; 2973fd0a558SYan, Zheng } 2983fd0a558SYan, Zheng return node; 2993fd0a558SYan, Zheng } 3003fd0a558SYan, Zheng 3013fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 3023fd0a558SYan, Zheng struct backref_node *node) 3033fd0a558SYan, Zheng { 3043fd0a558SYan, Zheng if (node) { 3053fd0a558SYan, Zheng cache->nr_nodes--; 30600246528SJosef Bacik btrfs_put_root(node->root); 3073fd0a558SYan, Zheng kfree(node); 3083fd0a558SYan, Zheng } 3093fd0a558SYan, Zheng } 3103fd0a558SYan, Zheng 3113fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 3123fd0a558SYan, Zheng { 3133fd0a558SYan, Zheng struct backref_edge *edge; 3143fd0a558SYan, Zheng 3153fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 3163fd0a558SYan, Zheng if (edge) 3173fd0a558SYan, Zheng cache->nr_edges++; 3183fd0a558SYan, Zheng return edge; 3193fd0a558SYan, Zheng } 3203fd0a558SYan, Zheng 3213fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 3223fd0a558SYan, Zheng struct backref_edge *edge) 3233fd0a558SYan, Zheng { 3243fd0a558SYan, Zheng if (edge) { 3253fd0a558SYan, Zheng cache->nr_edges--; 3263fd0a558SYan, Zheng kfree(edge); 3273fd0a558SYan, Zheng } 3285d4f98a2SYan Zheng } 3295d4f98a2SYan Zheng 3305d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 3315d4f98a2SYan Zheng struct rb_node *node) 3325d4f98a2SYan Zheng { 3335d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 3345d4f98a2SYan Zheng struct rb_node *parent = NULL; 3355d4f98a2SYan Zheng struct tree_entry *entry; 3365d4f98a2SYan Zheng 3375d4f98a2SYan Zheng while (*p) { 3385d4f98a2SYan Zheng parent = *p; 3395d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 3405d4f98a2SYan Zheng 3415d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3425d4f98a2SYan Zheng p = &(*p)->rb_left; 3435d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3445d4f98a2SYan Zheng p = &(*p)->rb_right; 3455d4f98a2SYan Zheng else 3465d4f98a2SYan Zheng return parent; 3475d4f98a2SYan Zheng } 3485d4f98a2SYan Zheng 3495d4f98a2SYan Zheng rb_link_node(node, parent, p); 3505d4f98a2SYan Zheng rb_insert_color(node, root); 3515d4f98a2SYan Zheng return NULL; 3525d4f98a2SYan Zheng } 3535d4f98a2SYan Zheng 3545d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 3555d4f98a2SYan Zheng { 3565d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 3575d4f98a2SYan Zheng struct tree_entry *entry; 3585d4f98a2SYan Zheng 3595d4f98a2SYan Zheng while (n) { 3605d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 3615d4f98a2SYan Zheng 3625d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3635d4f98a2SYan Zheng n = n->rb_left; 3645d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3655d4f98a2SYan Zheng n = n->rb_right; 3665d4f98a2SYan Zheng else 3675d4f98a2SYan Zheng return n; 3685d4f98a2SYan Zheng } 3695d4f98a2SYan Zheng return NULL; 3705d4f98a2SYan Zheng } 3715d4f98a2SYan Zheng 37248a3b636SEric Sandeen static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) 37343c04fb1SJeff Mahoney { 37443c04fb1SJeff Mahoney 37543c04fb1SJeff Mahoney struct btrfs_fs_info *fs_info = NULL; 37643c04fb1SJeff Mahoney struct backref_node *bnode = rb_entry(rb_node, struct backref_node, 37743c04fb1SJeff Mahoney rb_node); 37843c04fb1SJeff Mahoney if (bnode->root) 37943c04fb1SJeff Mahoney fs_info = bnode->root->fs_info; 3805d163e0eSJeff Mahoney btrfs_panic(fs_info, errno, 3815d163e0eSJeff Mahoney "Inconsistency in backref cache found at offset %llu", 3825d163e0eSJeff Mahoney bytenr); 38343c04fb1SJeff Mahoney } 38443c04fb1SJeff Mahoney 3855d4f98a2SYan Zheng /* 3865d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 3875d4f98a2SYan Zheng */ 3885d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 3895d4f98a2SYan Zheng struct backref_edge *edges[], 3905d4f98a2SYan Zheng int *index) 3915d4f98a2SYan Zheng { 3925d4f98a2SYan Zheng struct backref_edge *edge; 3935d4f98a2SYan Zheng int idx = *index; 3945d4f98a2SYan Zheng 3955d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 3965d4f98a2SYan Zheng edge = list_entry(node->upper.next, 3975d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3985d4f98a2SYan Zheng edges[idx++] = edge; 3995d4f98a2SYan Zheng node = edge->node[UPPER]; 4005d4f98a2SYan Zheng } 4013fd0a558SYan, Zheng BUG_ON(node->detached); 4025d4f98a2SYan Zheng *index = idx; 4035d4f98a2SYan Zheng return node; 4045d4f98a2SYan Zheng } 4055d4f98a2SYan Zheng 4065d4f98a2SYan Zheng /* 4075d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 4085d4f98a2SYan Zheng */ 4095d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 4105d4f98a2SYan Zheng int *index) 4115d4f98a2SYan Zheng { 4125d4f98a2SYan Zheng struct backref_edge *edge; 4135d4f98a2SYan Zheng struct backref_node *lower; 4145d4f98a2SYan Zheng int idx = *index; 4155d4f98a2SYan Zheng 4165d4f98a2SYan Zheng while (idx > 0) { 4175d4f98a2SYan Zheng edge = edges[idx - 1]; 4185d4f98a2SYan Zheng lower = edge->node[LOWER]; 4195d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 4205d4f98a2SYan Zheng idx--; 4215d4f98a2SYan Zheng continue; 4225d4f98a2SYan Zheng } 4235d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 4245d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 4255d4f98a2SYan Zheng edges[idx - 1] = edge; 4265d4f98a2SYan Zheng *index = idx; 4275d4f98a2SYan Zheng return edge->node[UPPER]; 4285d4f98a2SYan Zheng } 4295d4f98a2SYan Zheng *index = 0; 4305d4f98a2SYan Zheng return NULL; 4315d4f98a2SYan Zheng } 4325d4f98a2SYan Zheng 4333fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 4345d4f98a2SYan Zheng { 4355d4f98a2SYan Zheng if (node->locked) { 4365d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 4375d4f98a2SYan Zheng node->locked = 0; 4385d4f98a2SYan Zheng } 4393fd0a558SYan, Zheng } 4403fd0a558SYan, Zheng 4413fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 4423fd0a558SYan, Zheng { 4433fd0a558SYan, Zheng if (node->eb) { 4443fd0a558SYan, Zheng unlock_node_buffer(node); 4455d4f98a2SYan Zheng free_extent_buffer(node->eb); 4465d4f98a2SYan Zheng node->eb = NULL; 4475d4f98a2SYan Zheng } 4485d4f98a2SYan Zheng } 4495d4f98a2SYan Zheng 4505d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 4515d4f98a2SYan Zheng struct backref_node *node) 4525d4f98a2SYan Zheng { 4535d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 4545d4f98a2SYan Zheng 4555d4f98a2SYan Zheng drop_node_buffer(node); 4563fd0a558SYan, Zheng list_del(&node->list); 4575d4f98a2SYan Zheng list_del(&node->lower); 4583fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 4595d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 4603fd0a558SYan, Zheng free_backref_node(tree, node); 4615d4f98a2SYan Zheng } 4625d4f98a2SYan Zheng 4635d4f98a2SYan Zheng /* 4645d4f98a2SYan Zheng * remove a backref node from the backref cache 4655d4f98a2SYan Zheng */ 4665d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 4675d4f98a2SYan Zheng struct backref_node *node) 4685d4f98a2SYan Zheng { 4695d4f98a2SYan Zheng struct backref_node *upper; 4705d4f98a2SYan Zheng struct backref_edge *edge; 4715d4f98a2SYan Zheng 4725d4f98a2SYan Zheng if (!node) 4735d4f98a2SYan Zheng return; 4745d4f98a2SYan Zheng 4753fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 4765d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4775d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 4785d4f98a2SYan Zheng list[LOWER]); 4795d4f98a2SYan Zheng upper = edge->node[UPPER]; 4805d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 4815d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 4823fd0a558SYan, Zheng free_backref_edge(cache, edge); 4833fd0a558SYan, Zheng 4843fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 4853fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 4863fd0a558SYan, Zheng drop_backref_node(cache, node); 4873fd0a558SYan, Zheng node = upper; 4883fd0a558SYan, Zheng node->lowest = 1; 4893fd0a558SYan, Zheng continue; 4903fd0a558SYan, Zheng } 4915d4f98a2SYan Zheng /* 4923fd0a558SYan, Zheng * add the node to leaf node list if no other 4935d4f98a2SYan Zheng * child block cached. 4945d4f98a2SYan Zheng */ 4955d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 4963fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 4975d4f98a2SYan Zheng upper->lowest = 1; 4985d4f98a2SYan Zheng } 4995d4f98a2SYan Zheng } 5003fd0a558SYan, Zheng 5015d4f98a2SYan Zheng drop_backref_node(cache, node); 5025d4f98a2SYan Zheng } 5035d4f98a2SYan Zheng 5043fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 5053fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 5063fd0a558SYan, Zheng { 5073fd0a558SYan, Zheng struct rb_node *rb_node; 5083fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 5093fd0a558SYan, Zheng node->bytenr = bytenr; 5103fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 51143c04fb1SJeff Mahoney if (rb_node) 51243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, bytenr); 5133fd0a558SYan, Zheng } 5143fd0a558SYan, Zheng 5153fd0a558SYan, Zheng /* 5163fd0a558SYan, Zheng * update backref cache after a transaction commit 5173fd0a558SYan, Zheng */ 5183fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 5193fd0a558SYan, Zheng struct backref_cache *cache) 5203fd0a558SYan, Zheng { 5213fd0a558SYan, Zheng struct backref_node *node; 5223fd0a558SYan, Zheng int level = 0; 5233fd0a558SYan, Zheng 5243fd0a558SYan, Zheng if (cache->last_trans == 0) { 5253fd0a558SYan, Zheng cache->last_trans = trans->transid; 5263fd0a558SYan, Zheng return 0; 5273fd0a558SYan, Zheng } 5283fd0a558SYan, Zheng 5293fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 5303fd0a558SYan, Zheng return 0; 5313fd0a558SYan, Zheng 5323fd0a558SYan, Zheng /* 5333fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 5343fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 5353fd0a558SYan, Zheng * so the detached nodes are no longer useful. 5363fd0a558SYan, Zheng */ 5373fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 5383fd0a558SYan, Zheng node = list_entry(cache->detached.next, 5393fd0a558SYan, Zheng struct backref_node, list); 5403fd0a558SYan, Zheng remove_backref_node(cache, node); 5413fd0a558SYan, Zheng } 5423fd0a558SYan, Zheng 5433fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 5443fd0a558SYan, Zheng node = list_entry(cache->changed.next, 5453fd0a558SYan, Zheng struct backref_node, list); 5463fd0a558SYan, Zheng list_del_init(&node->list); 5473fd0a558SYan, Zheng BUG_ON(node->pending); 5483fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5493fd0a558SYan, Zheng } 5503fd0a558SYan, Zheng 5513fd0a558SYan, Zheng /* 5523fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 5533fd0a558SYan, Zheng * errors during processing the pending nodes. 5543fd0a558SYan, Zheng */ 5553fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 5563fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 5573fd0a558SYan, Zheng BUG_ON(!node->pending); 5583fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 5593fd0a558SYan, Zheng continue; 5603fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5613fd0a558SYan, Zheng } 5623fd0a558SYan, Zheng } 5633fd0a558SYan, Zheng 5643fd0a558SYan, Zheng cache->last_trans = 0; 5653fd0a558SYan, Zheng return 1; 5663fd0a558SYan, Zheng } 5673fd0a558SYan, Zheng 5686282675eSQu Wenruo static bool reloc_root_is_dead(struct btrfs_root *root) 5696282675eSQu Wenruo { 5706282675eSQu Wenruo /* 5716282675eSQu Wenruo * Pair with set_bit/clear_bit in clean_dirty_subvols and 5726282675eSQu Wenruo * btrfs_update_reloc_root. We need to see the updated bit before 5736282675eSQu Wenruo * trying to access reloc_root 5746282675eSQu Wenruo */ 5756282675eSQu Wenruo smp_rmb(); 5766282675eSQu Wenruo if (test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state)) 5776282675eSQu Wenruo return true; 5786282675eSQu Wenruo return false; 5796282675eSQu Wenruo } 5806282675eSQu Wenruo 5816282675eSQu Wenruo /* 5826282675eSQu Wenruo * Check if this subvolume tree has valid reloc tree. 5836282675eSQu Wenruo * 5846282675eSQu Wenruo * Reloc tree after swap is considered dead, thus not considered as valid. 5856282675eSQu Wenruo * This is enough for most callers, as they don't distinguish dead reloc root 5866282675eSQu Wenruo * from no reloc root. But should_ignore_root() below is a special case. 5876282675eSQu Wenruo */ 5886282675eSQu Wenruo static bool have_reloc_root(struct btrfs_root *root) 5896282675eSQu Wenruo { 5906282675eSQu Wenruo if (reloc_root_is_dead(root)) 5916282675eSQu Wenruo return false; 5926282675eSQu Wenruo if (!root->reloc_root) 5936282675eSQu Wenruo return false; 5946282675eSQu Wenruo return true; 5956282675eSQu Wenruo } 596f2a97a9dSDavid Sterba 5973fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 5983fd0a558SYan, Zheng { 5993fd0a558SYan, Zheng struct btrfs_root *reloc_root; 6003fd0a558SYan, Zheng 60127cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 6023fd0a558SYan, Zheng return 0; 6033fd0a558SYan, Zheng 6046282675eSQu Wenruo /* This root has been merged with its reloc tree, we can ignore it */ 6056282675eSQu Wenruo if (reloc_root_is_dead(root)) 6066282675eSQu Wenruo return 1; 6076282675eSQu Wenruo 6083fd0a558SYan, Zheng reloc_root = root->reloc_root; 6093fd0a558SYan, Zheng if (!reloc_root) 6103fd0a558SYan, Zheng return 0; 6113fd0a558SYan, Zheng 6123fd0a558SYan, Zheng if (btrfs_root_last_snapshot(&reloc_root->root_item) == 6133fd0a558SYan, Zheng root->fs_info->running_transaction->transid - 1) 6143fd0a558SYan, Zheng return 0; 6153fd0a558SYan, Zheng /* 6163fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 6173fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 6183fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 6193fd0a558SYan, Zheng * relocation. 6203fd0a558SYan, Zheng */ 6213fd0a558SYan, Zheng return 1; 6223fd0a558SYan, Zheng } 6235d4f98a2SYan Zheng /* 6245d4f98a2SYan Zheng * find reloc tree by address of tree root 6255d4f98a2SYan Zheng */ 6265d4f98a2SYan Zheng static struct btrfs_root *find_reloc_root(struct reloc_control *rc, 6275d4f98a2SYan Zheng u64 bytenr) 6285d4f98a2SYan Zheng { 6295d4f98a2SYan Zheng struct rb_node *rb_node; 6305d4f98a2SYan Zheng struct mapping_node *node; 6315d4f98a2SYan Zheng struct btrfs_root *root = NULL; 6325d4f98a2SYan Zheng 6335d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 6345d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 6355d4f98a2SYan Zheng if (rb_node) { 6365d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 6375d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 6385d4f98a2SYan Zheng } 6395d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 64000246528SJosef Bacik return btrfs_grab_root(root); 6415d4f98a2SYan Zheng } 6425d4f98a2SYan Zheng 6435d4f98a2SYan Zheng static int is_cowonly_root(u64 root_objectid) 6445d4f98a2SYan Zheng { 6455d4f98a2SYan Zheng if (root_objectid == BTRFS_ROOT_TREE_OBJECTID || 6465d4f98a2SYan Zheng root_objectid == BTRFS_EXTENT_TREE_OBJECTID || 6475d4f98a2SYan Zheng root_objectid == BTRFS_CHUNK_TREE_OBJECTID || 6485d4f98a2SYan Zheng root_objectid == BTRFS_DEV_TREE_OBJECTID || 6495d4f98a2SYan Zheng root_objectid == BTRFS_TREE_LOG_OBJECTID || 65066463748SWang Shilong root_objectid == BTRFS_CSUM_TREE_OBJECTID || 65166463748SWang Shilong root_objectid == BTRFS_UUID_TREE_OBJECTID || 6523e4c5efbSDavid Sterba root_objectid == BTRFS_QUOTA_TREE_OBJECTID || 6533e4c5efbSDavid Sterba root_objectid == BTRFS_FREE_SPACE_TREE_OBJECTID) 6545d4f98a2SYan Zheng return 1; 6555d4f98a2SYan Zheng return 0; 6565d4f98a2SYan Zheng } 6575d4f98a2SYan Zheng 6585d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 6595d4f98a2SYan Zheng u64 root_objectid) 6605d4f98a2SYan Zheng { 6615d4f98a2SYan Zheng struct btrfs_key key; 6625d4f98a2SYan Zheng 6635d4f98a2SYan Zheng key.objectid = root_objectid; 6645d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 6655d4f98a2SYan Zheng if (is_cowonly_root(root_objectid)) 6665d4f98a2SYan Zheng key.offset = 0; 6675d4f98a2SYan Zheng else 6685d4f98a2SYan Zheng key.offset = (u64)-1; 6695d4f98a2SYan Zheng 670bc44d7c4SJosef Bacik return btrfs_get_fs_root(fs_info, &key, false); 6715d4f98a2SYan Zheng } 6725d4f98a2SYan Zheng 6735d4f98a2SYan Zheng static noinline_for_stack 6745d4f98a2SYan Zheng int find_inline_backref(struct extent_buffer *leaf, int slot, 6755d4f98a2SYan Zheng unsigned long *ptr, unsigned long *end) 6765d4f98a2SYan Zheng { 6773173a18fSJosef Bacik struct btrfs_key key; 6785d4f98a2SYan Zheng struct btrfs_extent_item *ei; 6795d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 6805d4f98a2SYan Zheng u32 item_size; 6815d4f98a2SYan Zheng 6823173a18fSJosef Bacik btrfs_item_key_to_cpu(leaf, &key, slot); 6833173a18fSJosef Bacik 6845d4f98a2SYan Zheng item_size = btrfs_item_size_nr(leaf, slot); 685ba3c2b19SNikolay Borisov if (item_size < sizeof(*ei)) { 686ba3c2b19SNikolay Borisov btrfs_print_v0_err(leaf->fs_info); 687ba3c2b19SNikolay Borisov btrfs_handle_fs_error(leaf->fs_info, -EINVAL, NULL); 688ba3c2b19SNikolay Borisov return 1; 689ba3c2b19SNikolay Borisov } 6905d4f98a2SYan Zheng ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); 6915d4f98a2SYan Zheng WARN_ON(!(btrfs_extent_flags(leaf, ei) & 6925d4f98a2SYan Zheng BTRFS_EXTENT_FLAG_TREE_BLOCK)); 6935d4f98a2SYan Zheng 6943173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 6953173a18fSJosef Bacik item_size <= sizeof(*ei) + sizeof(*bi)) { 6965d4f98a2SYan Zheng WARN_ON(item_size < sizeof(*ei) + sizeof(*bi)); 6975d4f98a2SYan Zheng return 1; 6985d4f98a2SYan Zheng } 699d062d13cSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 700d062d13cSJosef Bacik item_size <= sizeof(*ei)) { 701d062d13cSJosef Bacik WARN_ON(item_size < sizeof(*ei)); 702d062d13cSJosef Bacik return 1; 703d062d13cSJosef Bacik } 7045d4f98a2SYan Zheng 7053173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) { 7065d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 7075d4f98a2SYan Zheng *ptr = (unsigned long)(bi + 1); 7083173a18fSJosef Bacik } else { 7093173a18fSJosef Bacik *ptr = (unsigned long)(ei + 1); 7103173a18fSJosef Bacik } 7115d4f98a2SYan Zheng *end = (unsigned long)ei + item_size; 7125d4f98a2SYan Zheng return 0; 7135d4f98a2SYan Zheng } 7145d4f98a2SYan Zheng 7155d4f98a2SYan Zheng /* 7165d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 7175d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 7185d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 7195d4f98a2SYan Zheng * 7205d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 72101327610SNicholas D Steeves * to find upper level blocks that reference the block, and then check 72201327610SNicholas D Steeves * backrefs of these upper level blocks recursively. the recursion stop 7235d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 7245d4f98a2SYan Zheng * 7255d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 7265d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 7275d4f98a2SYan Zheng * block are also cached. 7285d4f98a2SYan Zheng */ 7293fd0a558SYan, Zheng static noinline_for_stack 7303fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 7315d4f98a2SYan Zheng struct btrfs_key *node_key, 7325d4f98a2SYan Zheng int level, u64 bytenr) 7335d4f98a2SYan Zheng { 7343fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 735fa6ac715SQu Wenruo struct btrfs_path *path1; /* For searching extent root */ 736fa6ac715SQu Wenruo struct btrfs_path *path2; /* For searching parent of TREE_BLOCK_REF */ 7375d4f98a2SYan Zheng struct extent_buffer *eb; 7385d4f98a2SYan Zheng struct btrfs_root *root; 7395d4f98a2SYan Zheng struct backref_node *cur; 7405d4f98a2SYan Zheng struct backref_node *upper; 7415d4f98a2SYan Zheng struct backref_node *lower; 7425d4f98a2SYan Zheng struct backref_node *node = NULL; 7435d4f98a2SYan Zheng struct backref_node *exist = NULL; 7445d4f98a2SYan Zheng struct backref_edge *edge; 7455d4f98a2SYan Zheng struct rb_node *rb_node; 7465d4f98a2SYan Zheng struct btrfs_key key; 7475d4f98a2SYan Zheng unsigned long end; 7485d4f98a2SYan Zheng unsigned long ptr; 749fa6ac715SQu Wenruo LIST_HEAD(list); /* Pending edge list, upper node needs to be checked */ 7503fd0a558SYan, Zheng LIST_HEAD(useless); 7513fd0a558SYan, Zheng int cowonly; 7525d4f98a2SYan Zheng int ret; 7535d4f98a2SYan Zheng int err = 0; 754b6c60c80SJosef Bacik bool need_check = true; 7555d4f98a2SYan Zheng 7565d4f98a2SYan Zheng path1 = btrfs_alloc_path(); 7575d4f98a2SYan Zheng path2 = btrfs_alloc_path(); 7585d4f98a2SYan Zheng if (!path1 || !path2) { 7595d4f98a2SYan Zheng err = -ENOMEM; 7605d4f98a2SYan Zheng goto out; 7615d4f98a2SYan Zheng } 762e4058b54SDavid Sterba path1->reada = READA_FORWARD; 763e4058b54SDavid Sterba path2->reada = READA_FORWARD; 7645d4f98a2SYan Zheng 7653fd0a558SYan, Zheng node = alloc_backref_node(cache); 7665d4f98a2SYan Zheng if (!node) { 7675d4f98a2SYan Zheng err = -ENOMEM; 7685d4f98a2SYan Zheng goto out; 7695d4f98a2SYan Zheng } 7705d4f98a2SYan Zheng 7715d4f98a2SYan Zheng node->bytenr = bytenr; 7725d4f98a2SYan Zheng node->level = level; 7735d4f98a2SYan Zheng node->lowest = 1; 7745d4f98a2SYan Zheng cur = node; 7755d4f98a2SYan Zheng again: 7765d4f98a2SYan Zheng end = 0; 7775d4f98a2SYan Zheng ptr = 0; 7785d4f98a2SYan Zheng key.objectid = cur->bytenr; 7793173a18fSJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 7805d4f98a2SYan Zheng key.offset = (u64)-1; 7815d4f98a2SYan Zheng 7825d4f98a2SYan Zheng path1->search_commit_root = 1; 7835d4f98a2SYan Zheng path1->skip_locking = 1; 7845d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1, 7855d4f98a2SYan Zheng 0, 0); 7865d4f98a2SYan Zheng if (ret < 0) { 7875d4f98a2SYan Zheng err = ret; 7885d4f98a2SYan Zheng goto out; 7895d4f98a2SYan Zheng } 79075bfb9afSJosef Bacik ASSERT(ret); 79175bfb9afSJosef Bacik ASSERT(path1->slots[0]); 7925d4f98a2SYan Zheng 7935d4f98a2SYan Zheng path1->slots[0]--; 7945d4f98a2SYan Zheng 7955d4f98a2SYan Zheng WARN_ON(cur->checked); 7965d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 7975d4f98a2SYan Zheng /* 79870f23fd6SJustin P. Mattock * the backref was added previously when processing 7995d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 8005d4f98a2SYan Zheng */ 80175bfb9afSJosef Bacik ASSERT(list_is_singular(&cur->upper)); 8025d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 8035d4f98a2SYan Zheng list[LOWER]); 80475bfb9afSJosef Bacik ASSERT(list_empty(&edge->list[UPPER])); 8055d4f98a2SYan Zheng exist = edge->node[UPPER]; 8065d4f98a2SYan Zheng /* 8075d4f98a2SYan Zheng * add the upper level block to pending list if we need 8085d4f98a2SYan Zheng * check its backrefs 8095d4f98a2SYan Zheng */ 8105d4f98a2SYan Zheng if (!exist->checked) 8115d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 8125d4f98a2SYan Zheng } else { 8135d4f98a2SYan Zheng exist = NULL; 8145d4f98a2SYan Zheng } 8155d4f98a2SYan Zheng 8165d4f98a2SYan Zheng while (1) { 8175d4f98a2SYan Zheng cond_resched(); 8185d4f98a2SYan Zheng eb = path1->nodes[0]; 8195d4f98a2SYan Zheng 8205d4f98a2SYan Zheng if (ptr >= end) { 8215d4f98a2SYan Zheng if (path1->slots[0] >= btrfs_header_nritems(eb)) { 8225d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path1); 8235d4f98a2SYan Zheng if (ret < 0) { 8245d4f98a2SYan Zheng err = ret; 8255d4f98a2SYan Zheng goto out; 8265d4f98a2SYan Zheng } 8275d4f98a2SYan Zheng if (ret > 0) 8285d4f98a2SYan Zheng break; 8295d4f98a2SYan Zheng eb = path1->nodes[0]; 8305d4f98a2SYan Zheng } 8315d4f98a2SYan Zheng 8325d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path1->slots[0]); 8335d4f98a2SYan Zheng if (key.objectid != cur->bytenr) { 8345d4f98a2SYan Zheng WARN_ON(exist); 8355d4f98a2SYan Zheng break; 8365d4f98a2SYan Zheng } 8375d4f98a2SYan Zheng 8383173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY || 8393173a18fSJosef Bacik key.type == BTRFS_METADATA_ITEM_KEY) { 8405d4f98a2SYan Zheng ret = find_inline_backref(eb, path1->slots[0], 8415d4f98a2SYan Zheng &ptr, &end); 8425d4f98a2SYan Zheng if (ret) 8435d4f98a2SYan Zheng goto next; 8445d4f98a2SYan Zheng } 8455d4f98a2SYan Zheng } 8465d4f98a2SYan Zheng 8475d4f98a2SYan Zheng if (ptr < end) { 8485d4f98a2SYan Zheng /* update key for inline back ref */ 8495d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 8503de28d57SLiu Bo int type; 8515d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 8523de28d57SLiu Bo type = btrfs_get_extent_inline_ref_type(eb, iref, 8533de28d57SLiu Bo BTRFS_REF_TYPE_BLOCK); 8543de28d57SLiu Bo if (type == BTRFS_REF_TYPE_INVALID) { 855af431dcbSSu Yue err = -EUCLEAN; 8563de28d57SLiu Bo goto out; 8573de28d57SLiu Bo } 8583de28d57SLiu Bo key.type = type; 8595d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 8603de28d57SLiu Bo 8615d4f98a2SYan Zheng WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY && 8625d4f98a2SYan Zheng key.type != BTRFS_SHARED_BLOCK_REF_KEY); 8635d4f98a2SYan Zheng } 8645d4f98a2SYan Zheng 865fa6ac715SQu Wenruo /* 866fa6ac715SQu Wenruo * Parent node found and matches current inline ref, no need to 867fa6ac715SQu Wenruo * rebuild this node for this inline ref. 868fa6ac715SQu Wenruo */ 8695d4f98a2SYan Zheng if (exist && 8705d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 8715d4f98a2SYan Zheng exist->owner == key.offset) || 8725d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 8735d4f98a2SYan Zheng exist->bytenr == key.offset))) { 8745d4f98a2SYan Zheng exist = NULL; 8755d4f98a2SYan Zheng goto next; 8765d4f98a2SYan Zheng } 8775d4f98a2SYan Zheng 878fa6ac715SQu Wenruo /* SHARED_BLOCK_REF means key.offset is the parent bytenr */ 8795d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 8805d4f98a2SYan Zheng if (key.objectid == key.offset) { 8815d4f98a2SYan Zheng /* 882fa6ac715SQu Wenruo * Only root blocks of reloc trees use backref 883fa6ac715SQu Wenruo * pointing to itself. 8845d4f98a2SYan Zheng */ 8855d4f98a2SYan Zheng root = find_reloc_root(rc, cur->bytenr); 88675bfb9afSJosef Bacik ASSERT(root); 8875d4f98a2SYan Zheng cur->root = root; 8885d4f98a2SYan Zheng break; 8895d4f98a2SYan Zheng } 8905d4f98a2SYan Zheng 8913fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 8925d4f98a2SYan Zheng if (!edge) { 8935d4f98a2SYan Zheng err = -ENOMEM; 8945d4f98a2SYan Zheng goto out; 8955d4f98a2SYan Zheng } 8965d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, key.offset); 8975d4f98a2SYan Zheng if (!rb_node) { 8983fd0a558SYan, Zheng upper = alloc_backref_node(cache); 8995d4f98a2SYan Zheng if (!upper) { 9003fd0a558SYan, Zheng free_backref_edge(cache, edge); 9015d4f98a2SYan Zheng err = -ENOMEM; 9025d4f98a2SYan Zheng goto out; 9035d4f98a2SYan Zheng } 9045d4f98a2SYan Zheng upper->bytenr = key.offset; 9055d4f98a2SYan Zheng upper->level = cur->level + 1; 9065d4f98a2SYan Zheng /* 9075d4f98a2SYan Zheng * backrefs for the upper level block isn't 9085d4f98a2SYan Zheng * cached, add the block to pending list 9095d4f98a2SYan Zheng */ 9105d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 9115d4f98a2SYan Zheng } else { 9125d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 9135d4f98a2SYan Zheng rb_node); 91475bfb9afSJosef Bacik ASSERT(upper->checked); 9155d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 9165d4f98a2SYan Zheng } 9173fd0a558SYan, Zheng list_add_tail(&edge->list[LOWER], &cur->upper); 9185d4f98a2SYan Zheng edge->node[LOWER] = cur; 9193fd0a558SYan, Zheng edge->node[UPPER] = upper; 9205d4f98a2SYan Zheng 9215d4f98a2SYan Zheng goto next; 9226d8ff4e4SDavid Sterba } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) { 923ba3c2b19SNikolay Borisov err = -EINVAL; 924ba3c2b19SNikolay Borisov btrfs_print_v0_err(rc->extent_root->fs_info); 925ba3c2b19SNikolay Borisov btrfs_handle_fs_error(rc->extent_root->fs_info, err, 926ba3c2b19SNikolay Borisov NULL); 927ba3c2b19SNikolay Borisov goto out; 9285d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 9295d4f98a2SYan Zheng goto next; 9305d4f98a2SYan Zheng } 9315d4f98a2SYan Zheng 932fa6ac715SQu Wenruo /* 933fa6ac715SQu Wenruo * key.type == BTRFS_TREE_BLOCK_REF_KEY, inline ref offset 934fa6ac715SQu Wenruo * means the root objectid. We need to search the tree to get 935fa6ac715SQu Wenruo * its parent bytenr. 936fa6ac715SQu Wenruo */ 9375d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, key.offset); 9385d4f98a2SYan Zheng if (IS_ERR(root)) { 9395d4f98a2SYan Zheng err = PTR_ERR(root); 9405d4f98a2SYan Zheng goto out; 9415d4f98a2SYan Zheng } 9425d4f98a2SYan Zheng 94327cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 9443fd0a558SYan, Zheng cur->cowonly = 1; 9453fd0a558SYan, Zheng 9465d4f98a2SYan Zheng if (btrfs_root_level(&root->root_item) == cur->level) { 9475d4f98a2SYan Zheng /* tree root */ 94875bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 9495d4f98a2SYan Zheng cur->bytenr); 9500b530bc5SJosef Bacik if (should_ignore_root(root)) { 95100246528SJosef Bacik btrfs_put_root(root); 9523fd0a558SYan, Zheng list_add(&cur->list, &useless); 9530b530bc5SJosef Bacik } else { 9545d4f98a2SYan Zheng cur->root = root; 9550b530bc5SJosef Bacik } 9565d4f98a2SYan Zheng break; 9575d4f98a2SYan Zheng } 9585d4f98a2SYan Zheng 9595d4f98a2SYan Zheng level = cur->level + 1; 9605d4f98a2SYan Zheng 961fa6ac715SQu Wenruo /* Search the tree to find parent blocks referring the block. */ 9625d4f98a2SYan Zheng path2->search_commit_root = 1; 9635d4f98a2SYan Zheng path2->skip_locking = 1; 9645d4f98a2SYan Zheng path2->lowest_level = level; 9655d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0); 9665d4f98a2SYan Zheng path2->lowest_level = 0; 9675d4f98a2SYan Zheng if (ret < 0) { 96800246528SJosef Bacik btrfs_put_root(root); 9695d4f98a2SYan Zheng err = ret; 9705d4f98a2SYan Zheng goto out; 9715d4f98a2SYan Zheng } 97233c66f43SYan Zheng if (ret > 0 && path2->slots[level] > 0) 97333c66f43SYan Zheng path2->slots[level]--; 9745d4f98a2SYan Zheng 9755d4f98a2SYan Zheng eb = path2->nodes[level]; 9763561b9dbSLiu Bo if (btrfs_node_blockptr(eb, path2->slots[level]) != 9773561b9dbSLiu Bo cur->bytenr) { 9783561b9dbSLiu Bo btrfs_err(root->fs_info, 9793561b9dbSLiu Bo "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)", 9804fd786e6SMisono Tomohiro cur->bytenr, level - 1, 9814fd786e6SMisono Tomohiro root->root_key.objectid, 9823561b9dbSLiu Bo node_key->objectid, node_key->type, 9833561b9dbSLiu Bo node_key->offset); 98400246528SJosef Bacik btrfs_put_root(root); 9853561b9dbSLiu Bo err = -ENOENT; 9863561b9dbSLiu Bo goto out; 9873561b9dbSLiu Bo } 9885d4f98a2SYan Zheng lower = cur; 989b6c60c80SJosef Bacik need_check = true; 990fa6ac715SQu Wenruo 991fa6ac715SQu Wenruo /* Add all nodes and edges in the path */ 9925d4f98a2SYan Zheng for (; level < BTRFS_MAX_LEVEL; level++) { 9935d4f98a2SYan Zheng if (!path2->nodes[level]) { 99475bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 9955d4f98a2SYan Zheng lower->bytenr); 9960b530bc5SJosef Bacik if (should_ignore_root(root)) { 99700246528SJosef Bacik btrfs_put_root(root); 9983fd0a558SYan, Zheng list_add(&lower->list, &useless); 9990b530bc5SJosef Bacik } else { 10005d4f98a2SYan Zheng lower->root = root; 10010b530bc5SJosef Bacik } 10025d4f98a2SYan Zheng break; 10035d4f98a2SYan Zheng } 10045d4f98a2SYan Zheng 10053fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 10065d4f98a2SYan Zheng if (!edge) { 100700246528SJosef Bacik btrfs_put_root(root); 10085d4f98a2SYan Zheng err = -ENOMEM; 10095d4f98a2SYan Zheng goto out; 10105d4f98a2SYan Zheng } 10115d4f98a2SYan Zheng 10125d4f98a2SYan Zheng eb = path2->nodes[level]; 10135d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, eb->start); 10145d4f98a2SYan Zheng if (!rb_node) { 10153fd0a558SYan, Zheng upper = alloc_backref_node(cache); 10165d4f98a2SYan Zheng if (!upper) { 101700246528SJosef Bacik btrfs_put_root(root); 10183fd0a558SYan, Zheng free_backref_edge(cache, edge); 10195d4f98a2SYan Zheng err = -ENOMEM; 10205d4f98a2SYan Zheng goto out; 10215d4f98a2SYan Zheng } 10225d4f98a2SYan Zheng upper->bytenr = eb->start; 10235d4f98a2SYan Zheng upper->owner = btrfs_header_owner(eb); 10245d4f98a2SYan Zheng upper->level = lower->level + 1; 102527cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, 102627cdeb70SMiao Xie &root->state)) 10273fd0a558SYan, Zheng upper->cowonly = 1; 10285d4f98a2SYan Zheng 10295d4f98a2SYan Zheng /* 10305d4f98a2SYan Zheng * if we know the block isn't shared 10315d4f98a2SYan Zheng * we can void checking its backrefs. 10325d4f98a2SYan Zheng */ 10335d4f98a2SYan Zheng if (btrfs_block_can_be_shared(root, eb)) 10345d4f98a2SYan Zheng upper->checked = 0; 10355d4f98a2SYan Zheng else 10365d4f98a2SYan Zheng upper->checked = 1; 10375d4f98a2SYan Zheng 10385d4f98a2SYan Zheng /* 10395d4f98a2SYan Zheng * add the block to pending list if we 1040b6c60c80SJosef Bacik * need check its backrefs, we only do this once 1041b6c60c80SJosef Bacik * while walking up a tree as we will catch 1042b6c60c80SJosef Bacik * anything else later on. 10435d4f98a2SYan Zheng */ 1044b6c60c80SJosef Bacik if (!upper->checked && need_check) { 1045b6c60c80SJosef Bacik need_check = false; 10465d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], 10475d4f98a2SYan Zheng &list); 1048bbe90514SJosef Bacik } else { 1049bbe90514SJosef Bacik if (upper->checked) 1050bbe90514SJosef Bacik need_check = true; 10515d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 1052bbe90514SJosef Bacik } 10535d4f98a2SYan Zheng } else { 10545d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 10555d4f98a2SYan Zheng rb_node); 105675bfb9afSJosef Bacik ASSERT(upper->checked); 10575d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 10583fd0a558SYan, Zheng if (!upper->owner) 10593fd0a558SYan, Zheng upper->owner = btrfs_header_owner(eb); 10605d4f98a2SYan Zheng } 10615d4f98a2SYan Zheng list_add_tail(&edge->list[LOWER], &lower->upper); 10625d4f98a2SYan Zheng edge->node[LOWER] = lower; 10633fd0a558SYan, Zheng edge->node[UPPER] = upper; 10645d4f98a2SYan Zheng 10650b530bc5SJosef Bacik if (rb_node) { 106600246528SJosef Bacik btrfs_put_root(root); 10675d4f98a2SYan Zheng break; 10680b530bc5SJosef Bacik } 10695d4f98a2SYan Zheng lower = upper; 10705d4f98a2SYan Zheng upper = NULL; 10715d4f98a2SYan Zheng } 1072b3b4aa74SDavid Sterba btrfs_release_path(path2); 10735d4f98a2SYan Zheng next: 10745d4f98a2SYan Zheng if (ptr < end) { 10755d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 10765d4f98a2SYan Zheng if (ptr >= end) { 10775d4f98a2SYan Zheng WARN_ON(ptr > end); 10785d4f98a2SYan Zheng ptr = 0; 10795d4f98a2SYan Zheng end = 0; 10805d4f98a2SYan Zheng } 10815d4f98a2SYan Zheng } 10825d4f98a2SYan Zheng if (ptr >= end) 10835d4f98a2SYan Zheng path1->slots[0]++; 10845d4f98a2SYan Zheng } 1085b3b4aa74SDavid Sterba btrfs_release_path(path1); 10865d4f98a2SYan Zheng 10875d4f98a2SYan Zheng cur->checked = 1; 10885d4f98a2SYan Zheng WARN_ON(exist); 10895d4f98a2SYan Zheng 10905d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 10915d4f98a2SYan Zheng if (!list_empty(&list)) { 10925d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10935d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10945d4f98a2SYan Zheng cur = edge->node[UPPER]; 10955d4f98a2SYan Zheng goto again; 10965d4f98a2SYan Zheng } 10975d4f98a2SYan Zheng 10985d4f98a2SYan Zheng /* 10995d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 11005d4f98a2SYan Zheng * into the cache. 11015d4f98a2SYan Zheng */ 110275bfb9afSJosef Bacik ASSERT(node->checked); 11033fd0a558SYan, Zheng cowonly = node->cowonly; 11043fd0a558SYan, Zheng if (!cowonly) { 11053fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 11063fd0a558SYan, Zheng &node->rb_node); 110743c04fb1SJeff Mahoney if (rb_node) 110843c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 11093fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 11103fd0a558SYan, Zheng } 11115d4f98a2SYan Zheng 11125d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 11135d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 11145d4f98a2SYan Zheng 11155d4f98a2SYan Zheng while (!list_empty(&list)) { 11165d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 11175d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 11185d4f98a2SYan Zheng upper = edge->node[UPPER]; 11193fd0a558SYan, Zheng if (upper->detached) { 11203fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11213fd0a558SYan, Zheng lower = edge->node[LOWER]; 11223fd0a558SYan, Zheng free_backref_edge(cache, edge); 11233fd0a558SYan, Zheng if (list_empty(&lower->upper)) 11243fd0a558SYan, Zheng list_add(&lower->list, &useless); 11253fd0a558SYan, Zheng continue; 11263fd0a558SYan, Zheng } 11275d4f98a2SYan Zheng 11285d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 11295d4f98a2SYan Zheng if (upper->lowest) { 11305d4f98a2SYan Zheng list_del_init(&upper->lower); 11315d4f98a2SYan Zheng upper->lowest = 0; 11325d4f98a2SYan Zheng } 11335d4f98a2SYan Zheng 11345d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 11355d4f98a2SYan Zheng continue; 11365d4f98a2SYan Zheng } 11375d4f98a2SYan Zheng 113875bfb9afSJosef Bacik if (!upper->checked) { 113975bfb9afSJosef Bacik /* 114075bfb9afSJosef Bacik * Still want to blow up for developers since this is a 114175bfb9afSJosef Bacik * logic bug. 114275bfb9afSJosef Bacik */ 114375bfb9afSJosef Bacik ASSERT(0); 114475bfb9afSJosef Bacik err = -EINVAL; 114575bfb9afSJosef Bacik goto out; 114675bfb9afSJosef Bacik } 114775bfb9afSJosef Bacik if (cowonly != upper->cowonly) { 114875bfb9afSJosef Bacik ASSERT(0); 114975bfb9afSJosef Bacik err = -EINVAL; 115075bfb9afSJosef Bacik goto out; 115175bfb9afSJosef Bacik } 115275bfb9afSJosef Bacik 11533fd0a558SYan, Zheng if (!cowonly) { 11545d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 11555d4f98a2SYan Zheng &upper->rb_node); 115643c04fb1SJeff Mahoney if (rb_node) 115743c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 115843c04fb1SJeff Mahoney upper->bytenr); 11593fd0a558SYan, Zheng } 11605d4f98a2SYan Zheng 11615d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 11625d4f98a2SYan Zheng 11635d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 11645d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 11655d4f98a2SYan Zheng } 11663fd0a558SYan, Zheng /* 11673fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 11683fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 11693fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 11703fd0a558SYan, Zheng * lookup. 11713fd0a558SYan, Zheng */ 11723fd0a558SYan, Zheng while (!list_empty(&useless)) { 11733fd0a558SYan, Zheng upper = list_entry(useless.next, struct backref_node, list); 11743fd0a558SYan, Zheng list_del_init(&upper->list); 117575bfb9afSJosef Bacik ASSERT(list_empty(&upper->upper)); 11763fd0a558SYan, Zheng if (upper == node) 11773fd0a558SYan, Zheng node = NULL; 11783fd0a558SYan, Zheng if (upper->lowest) { 11793fd0a558SYan, Zheng list_del_init(&upper->lower); 11803fd0a558SYan, Zheng upper->lowest = 0; 11813fd0a558SYan, Zheng } 11823fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 11833fd0a558SYan, Zheng edge = list_entry(upper->lower.next, 11843fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 11853fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 11863fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11873fd0a558SYan, Zheng lower = edge->node[LOWER]; 11883fd0a558SYan, Zheng free_backref_edge(cache, edge); 11893fd0a558SYan, Zheng 11903fd0a558SYan, Zheng if (list_empty(&lower->upper)) 11913fd0a558SYan, Zheng list_add(&lower->list, &useless); 11923fd0a558SYan, Zheng } 11933fd0a558SYan, Zheng __mark_block_processed(rc, upper); 11943fd0a558SYan, Zheng if (upper->level > 0) { 11953fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 11963fd0a558SYan, Zheng upper->detached = 1; 11973fd0a558SYan, Zheng } else { 11983fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 11993fd0a558SYan, Zheng free_backref_node(cache, upper); 12003fd0a558SYan, Zheng } 12013fd0a558SYan, Zheng } 12025d4f98a2SYan Zheng out: 12035d4f98a2SYan Zheng btrfs_free_path(path1); 12045d4f98a2SYan Zheng btrfs_free_path(path2); 12055d4f98a2SYan Zheng if (err) { 12063fd0a558SYan, Zheng while (!list_empty(&useless)) { 12073fd0a558SYan, Zheng lower = list_entry(useless.next, 120875bfb9afSJosef Bacik struct backref_node, list); 120975bfb9afSJosef Bacik list_del_init(&lower->list); 12103fd0a558SYan, Zheng } 121175bfb9afSJosef Bacik while (!list_empty(&list)) { 121275bfb9afSJosef Bacik edge = list_first_entry(&list, struct backref_edge, 121375bfb9afSJosef Bacik list[UPPER]); 121475bfb9afSJosef Bacik list_del(&edge->list[UPPER]); 12153fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 121675bfb9afSJosef Bacik lower = edge->node[LOWER]; 12175d4f98a2SYan Zheng upper = edge->node[UPPER]; 12183fd0a558SYan, Zheng free_backref_edge(cache, edge); 121975bfb9afSJosef Bacik 122075bfb9afSJosef Bacik /* 122175bfb9afSJosef Bacik * Lower is no longer linked to any upper backref nodes 122275bfb9afSJosef Bacik * and isn't in the cache, we can free it ourselves. 122375bfb9afSJosef Bacik */ 122475bfb9afSJosef Bacik if (list_empty(&lower->upper) && 122575bfb9afSJosef Bacik RB_EMPTY_NODE(&lower->rb_node)) 122675bfb9afSJosef Bacik list_add(&lower->list, &useless); 122775bfb9afSJosef Bacik 122875bfb9afSJosef Bacik if (!RB_EMPTY_NODE(&upper->rb_node)) 122975bfb9afSJosef Bacik continue; 123075bfb9afSJosef Bacik 123101327610SNicholas D Steeves /* Add this guy's upper edges to the list to process */ 123275bfb9afSJosef Bacik list_for_each_entry(edge, &upper->upper, list[LOWER]) 123375bfb9afSJosef Bacik list_add_tail(&edge->list[UPPER], &list); 123475bfb9afSJosef Bacik if (list_empty(&upper->upper)) 123575bfb9afSJosef Bacik list_add(&upper->list, &useless); 123675bfb9afSJosef Bacik } 123775bfb9afSJosef Bacik 123875bfb9afSJosef Bacik while (!list_empty(&useless)) { 123975bfb9afSJosef Bacik lower = list_entry(useless.next, 124075bfb9afSJosef Bacik struct backref_node, list); 124175bfb9afSJosef Bacik list_del_init(&lower->list); 12420fd8c3daSLiu Bo if (lower == node) 12430fd8c3daSLiu Bo node = NULL; 124475bfb9afSJosef Bacik free_backref_node(cache, lower); 12455d4f98a2SYan Zheng } 12460fd8c3daSLiu Bo 12470fd8c3daSLiu Bo free_backref_node(cache, node); 12485d4f98a2SYan Zheng return ERR_PTR(err); 12495d4f98a2SYan Zheng } 125075bfb9afSJosef Bacik ASSERT(!node || !node->detached); 12515d4f98a2SYan Zheng return node; 12525d4f98a2SYan Zheng } 12535d4f98a2SYan Zheng 12545d4f98a2SYan Zheng /* 12553fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 12563fd0a558SYan, Zheng * the backref node is created by cloning backref node that 12573fd0a558SYan, Zheng * corresponds to root of source tree 12583fd0a558SYan, Zheng */ 12593fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 12603fd0a558SYan, Zheng struct reloc_control *rc, 12613fd0a558SYan, Zheng struct btrfs_root *src, 12623fd0a558SYan, Zheng struct btrfs_root *dest) 12633fd0a558SYan, Zheng { 12643fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 12653fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 12663fd0a558SYan, Zheng struct backref_node *node = NULL; 12673fd0a558SYan, Zheng struct backref_node *new_node; 12683fd0a558SYan, Zheng struct backref_edge *edge; 12693fd0a558SYan, Zheng struct backref_edge *new_edge; 12703fd0a558SYan, Zheng struct rb_node *rb_node; 12713fd0a558SYan, Zheng 12723fd0a558SYan, Zheng if (cache->last_trans > 0) 12733fd0a558SYan, Zheng update_backref_cache(trans, cache); 12743fd0a558SYan, Zheng 12753fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 12763fd0a558SYan, Zheng if (rb_node) { 12773fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 12783fd0a558SYan, Zheng if (node->detached) 12793fd0a558SYan, Zheng node = NULL; 12803fd0a558SYan, Zheng else 12813fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 12823fd0a558SYan, Zheng } 12833fd0a558SYan, Zheng 12843fd0a558SYan, Zheng if (!node) { 12853fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 12863fd0a558SYan, Zheng reloc_root->commit_root->start); 12873fd0a558SYan, Zheng if (rb_node) { 12883fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 12893fd0a558SYan, Zheng rb_node); 12903fd0a558SYan, Zheng BUG_ON(node->detached); 12913fd0a558SYan, Zheng } 12923fd0a558SYan, Zheng } 12933fd0a558SYan, Zheng 12943fd0a558SYan, Zheng if (!node) 12953fd0a558SYan, Zheng return 0; 12963fd0a558SYan, Zheng 12973fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 12983fd0a558SYan, Zheng if (!new_node) 12993fd0a558SYan, Zheng return -ENOMEM; 13003fd0a558SYan, Zheng 13013fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 13023fd0a558SYan, Zheng new_node->level = node->level; 13033fd0a558SYan, Zheng new_node->lowest = node->lowest; 13046848ad64SYan, Zheng new_node->checked = 1; 130500246528SJosef Bacik new_node->root = btrfs_grab_root(dest); 13060b530bc5SJosef Bacik ASSERT(new_node->root); 13073fd0a558SYan, Zheng 13083fd0a558SYan, Zheng if (!node->lowest) { 13093fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 13103fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 13113fd0a558SYan, Zheng if (!new_edge) 13123fd0a558SYan, Zheng goto fail; 13133fd0a558SYan, Zheng 13143fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 13153fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 13163fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 13173fd0a558SYan, Zheng &new_node->lower); 13183fd0a558SYan, Zheng } 131976b9e23dSMiao Xie } else { 132076b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 13213fd0a558SYan, Zheng } 13223fd0a558SYan, Zheng 13233fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 13243fd0a558SYan, Zheng &new_node->rb_node); 132543c04fb1SJeff Mahoney if (rb_node) 132643c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 13273fd0a558SYan, Zheng 13283fd0a558SYan, Zheng if (!new_node->lowest) { 13293fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 13303fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 13313fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 13323fd0a558SYan, Zheng } 13333fd0a558SYan, Zheng } 13343fd0a558SYan, Zheng return 0; 13353fd0a558SYan, Zheng fail: 13363fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 13373fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 13383fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 13393fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 13403fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 13413fd0a558SYan, Zheng } 13423fd0a558SYan, Zheng free_backref_node(cache, new_node); 13433fd0a558SYan, Zheng return -ENOMEM; 13443fd0a558SYan, Zheng } 13453fd0a558SYan, Zheng 13463fd0a558SYan, Zheng /* 13475d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 13485d4f98a2SYan Zheng */ 1349ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 13505d4f98a2SYan Zheng { 13510b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 13525d4f98a2SYan Zheng struct rb_node *rb_node; 13535d4f98a2SYan Zheng struct mapping_node *node; 13540b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 13555d4f98a2SYan Zheng 13565d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1357ffd7b339SJeff Mahoney if (!node) 1358ffd7b339SJeff Mahoney return -ENOMEM; 13595d4f98a2SYan Zheng 13605d4f98a2SYan Zheng node->bytenr = root->node->start; 13615d4f98a2SYan Zheng node->data = root; 13625d4f98a2SYan Zheng 13635d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13645d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13655d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13665d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1367ffd7b339SJeff Mahoney if (rb_node) { 13680b246afaSJeff Mahoney btrfs_panic(fs_info, -EEXIST, 13695d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 13705d163e0eSJeff Mahoney node->bytenr); 1371ffd7b339SJeff Mahoney } 13725d4f98a2SYan Zheng 13735d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 13745d4f98a2SYan Zheng return 0; 13755d4f98a2SYan Zheng } 13765d4f98a2SYan Zheng 13775d4f98a2SYan Zheng /* 1378c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 13795d4f98a2SYan Zheng * mapping 13805d4f98a2SYan Zheng */ 1381c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 13825d4f98a2SYan Zheng { 13830b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 13845d4f98a2SYan Zheng struct rb_node *rb_node; 13855d4f98a2SYan Zheng struct mapping_node *node = NULL; 13860b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 13875d4f98a2SYan Zheng 138865c6e82bSQu Wenruo if (rc && root->node) { 13895d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13905d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1391c974c464SWang Shilong root->node->start); 1392c974c464SWang Shilong if (rb_node) { 1393c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1394c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1395c974c464SWang Shilong } 1396c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1397c974c464SWang Shilong if (!node) 1398c974c464SWang Shilong return; 1399c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1400389305b2SQu Wenruo } 1401c974c464SWang Shilong 14020b246afaSJeff Mahoney spin_lock(&fs_info->trans_lock); 1403c974c464SWang Shilong list_del_init(&root->root_list); 14040b246afaSJeff Mahoney spin_unlock(&fs_info->trans_lock); 1405c974c464SWang Shilong kfree(node); 1406c974c464SWang Shilong } 1407c974c464SWang Shilong 1408c974c464SWang Shilong /* 1409c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1410c974c464SWang Shilong * mapping 1411c974c464SWang Shilong */ 1412c974c464SWang Shilong static int __update_reloc_root(struct btrfs_root *root, u64 new_bytenr) 1413c974c464SWang Shilong { 14140b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 1415c974c464SWang Shilong struct rb_node *rb_node; 1416c974c464SWang Shilong struct mapping_node *node = NULL; 14170b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1418c974c464SWang Shilong 1419c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1420c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1421c974c464SWang Shilong root->node->start); 14225d4f98a2SYan Zheng if (rb_node) { 14235d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 14245d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 14255d4f98a2SYan Zheng } 14265d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 14275d4f98a2SYan Zheng 14288f71f3e0SLiu Bo if (!node) 14298f71f3e0SLiu Bo return 0; 14305d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 14315d4f98a2SYan Zheng 14325d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1433c974c464SWang Shilong node->bytenr = new_bytenr; 14345d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 14355d4f98a2SYan Zheng node->bytenr, &node->rb_node); 14365d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 143743c04fb1SJeff Mahoney if (rb_node) 143843c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 14395d4f98a2SYan Zheng return 0; 14405d4f98a2SYan Zheng } 14415d4f98a2SYan Zheng 14423fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 14433fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 14445d4f98a2SYan Zheng { 14450b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14465d4f98a2SYan Zheng struct btrfs_root *reloc_root; 14475d4f98a2SYan Zheng struct extent_buffer *eb; 14485d4f98a2SYan Zheng struct btrfs_root_item *root_item; 14495d4f98a2SYan Zheng struct btrfs_key root_key; 14505d4f98a2SYan Zheng int ret; 14515d4f98a2SYan Zheng 14525d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 14535d4f98a2SYan Zheng BUG_ON(!root_item); 14545d4f98a2SYan Zheng 14555d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 14565d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 14573fd0a558SYan, Zheng root_key.offset = objectid; 14585d4f98a2SYan Zheng 14593fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 1460054570a1SFilipe Manana u64 commit_root_gen; 1461054570a1SFilipe Manana 14623fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 14635d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 14645d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 14655d4f98a2SYan Zheng BUG_ON(ret); 1466054570a1SFilipe Manana /* 1467054570a1SFilipe Manana * Set the last_snapshot field to the generation of the commit 1468054570a1SFilipe Manana * root - like this ctree.c:btrfs_block_can_be_shared() behaves 1469054570a1SFilipe Manana * correctly (returns true) when the relocation root is created 1470054570a1SFilipe Manana * either inside the critical section of a transaction commit 1471054570a1SFilipe Manana * (through transaction.c:qgroup_account_snapshot()) and when 1472054570a1SFilipe Manana * it's created before the transaction commit is started. 1473054570a1SFilipe Manana */ 1474054570a1SFilipe Manana commit_root_gen = btrfs_header_generation(root->commit_root); 1475054570a1SFilipe Manana btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); 14763fd0a558SYan, Zheng } else { 14773fd0a558SYan, Zheng /* 14783fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 14793fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 14803fd0a558SYan, Zheng * modified after it was created have RELOC flag 14813fd0a558SYan, Zheng * set in their headers. so it's OK to not update 14823fd0a558SYan, Zheng * the 'last_snapshot'. 14833fd0a558SYan, Zheng */ 14843fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 14853fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 14863fd0a558SYan, Zheng BUG_ON(ret); 14873fd0a558SYan, Zheng } 14883fd0a558SYan, Zheng 14895d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 14905d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 14915d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 14925d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 14933fd0a558SYan, Zheng 14943fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 14953fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 14963fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 14973fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 14985d4f98a2SYan Zheng root_item->drop_level = 0; 14993fd0a558SYan, Zheng } 15005d4f98a2SYan Zheng 15015d4f98a2SYan Zheng btrfs_tree_unlock(eb); 15025d4f98a2SYan Zheng free_extent_buffer(eb); 15035d4f98a2SYan Zheng 15040b246afaSJeff Mahoney ret = btrfs_insert_root(trans, fs_info->tree_root, 15055d4f98a2SYan Zheng &root_key, root_item); 15065d4f98a2SYan Zheng BUG_ON(ret); 15075d4f98a2SYan Zheng kfree(root_item); 15085d4f98a2SYan Zheng 15093dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(fs_info->tree_root, &root_key); 15105d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 15113dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 15125d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 15133fd0a558SYan, Zheng return reloc_root; 15143fd0a558SYan, Zheng } 15153fd0a558SYan, Zheng 15163fd0a558SYan, Zheng /* 15173fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 15183fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 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 15301fac4a54SQu Wenruo /* 15311fac4a54SQu Wenruo * The subvolume has reloc tree but the swap is finished, no need to 15321fac4a54SQu Wenruo * create/update the dead reloc tree 15331fac4a54SQu Wenruo */ 15346282675eSQu Wenruo if (reloc_root_is_dead(root)) 15351fac4a54SQu Wenruo return 0; 15361fac4a54SQu Wenruo 15373fd0a558SYan, Zheng if (root->reloc_root) { 15383fd0a558SYan, Zheng reloc_root = root->reloc_root; 15393fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 15403fd0a558SYan, Zheng return 0; 15413fd0a558SYan, Zheng } 15423fd0a558SYan, Zheng 15433fd0a558SYan, Zheng if (!rc || !rc->create_reloc_tree || 15443fd0a558SYan, Zheng root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 15453fd0a558SYan, Zheng return 0; 15463fd0a558SYan, Zheng 154720dd2cbfSMiao Xie if (!trans->reloc_reserved) { 154820dd2cbfSMiao Xie rsv = trans->block_rsv; 15493fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 15503fd0a558SYan, Zheng clear_rsv = 1; 15513fd0a558SYan, Zheng } 15523fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 15533fd0a558SYan, Zheng if (clear_rsv) 155420dd2cbfSMiao Xie trans->block_rsv = rsv; 15555d4f98a2SYan Zheng 1556ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1557ffd7b339SJeff Mahoney BUG_ON(ret < 0); 15585d4f98a2SYan Zheng root->reloc_root = reloc_root; 15595d4f98a2SYan Zheng return 0; 15605d4f98a2SYan Zheng } 15615d4f98a2SYan Zheng 15625d4f98a2SYan Zheng /* 15635d4f98a2SYan Zheng * update root item of reloc tree 15645d4f98a2SYan Zheng */ 15655d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 15665d4f98a2SYan Zheng struct btrfs_root *root) 15675d4f98a2SYan Zheng { 15680b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 15695d4f98a2SYan Zheng struct btrfs_root *reloc_root; 15705d4f98a2SYan Zheng struct btrfs_root_item *root_item; 15715d4f98a2SYan Zheng int ret; 15725d4f98a2SYan Zheng 15736282675eSQu Wenruo if (!have_reloc_root(root)) 15747585717fSChris Mason goto out; 15755d4f98a2SYan Zheng 15765d4f98a2SYan Zheng reloc_root = root->reloc_root; 15775d4f98a2SYan Zheng root_item = &reloc_root->root_item; 15785d4f98a2SYan Zheng 1579d2311e69SQu Wenruo /* root->reloc_root will stay until current relocation finished */ 15800b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 15813fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 1582d2311e69SQu Wenruo set_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 15836282675eSQu Wenruo /* 15846282675eSQu Wenruo * Mark the tree as dead before we change reloc_root so 15856282675eSQu Wenruo * have_reloc_root will not touch it from now on. 15866282675eSQu Wenruo */ 15876282675eSQu Wenruo smp_wmb(); 1588c974c464SWang Shilong __del_reloc_root(reloc_root); 15895d4f98a2SYan Zheng } 15905d4f98a2SYan Zheng 15915d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 15925d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 15935d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 15945d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 15955d4f98a2SYan Zheng } 15965d4f98a2SYan Zheng 15970b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 15985d4f98a2SYan Zheng &reloc_root->root_key, root_item); 15995d4f98a2SYan Zheng BUG_ON(ret); 16007585717fSChris Mason 16017585717fSChris Mason out: 16025d4f98a2SYan Zheng return 0; 16035d4f98a2SYan Zheng } 16045d4f98a2SYan Zheng 16055d4f98a2SYan Zheng /* 16065d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 16075d4f98a2SYan Zheng * in a subvolume 16085d4f98a2SYan Zheng */ 16095d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 16105d4f98a2SYan Zheng { 16115d4f98a2SYan Zheng struct rb_node *node; 16125d4f98a2SYan Zheng struct rb_node *prev; 16135d4f98a2SYan Zheng struct btrfs_inode *entry; 16145d4f98a2SYan Zheng struct inode *inode; 16155d4f98a2SYan Zheng 16165d4f98a2SYan Zheng spin_lock(&root->inode_lock); 16175d4f98a2SYan Zheng again: 16185d4f98a2SYan Zheng node = root->inode_tree.rb_node; 16195d4f98a2SYan Zheng prev = NULL; 16205d4f98a2SYan Zheng while (node) { 16215d4f98a2SYan Zheng prev = node; 16225d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 16235d4f98a2SYan Zheng 16244a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 16255d4f98a2SYan Zheng node = node->rb_left; 16264a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 16275d4f98a2SYan Zheng node = node->rb_right; 16285d4f98a2SYan Zheng else 16295d4f98a2SYan Zheng break; 16305d4f98a2SYan Zheng } 16315d4f98a2SYan Zheng if (!node) { 16325d4f98a2SYan Zheng while (prev) { 16335d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 16344a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 16355d4f98a2SYan Zheng node = prev; 16365d4f98a2SYan Zheng break; 16375d4f98a2SYan Zheng } 16385d4f98a2SYan Zheng prev = rb_next(prev); 16395d4f98a2SYan Zheng } 16405d4f98a2SYan Zheng } 16415d4f98a2SYan Zheng while (node) { 16425d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 16435d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 16445d4f98a2SYan Zheng if (inode) { 16455d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 16465d4f98a2SYan Zheng return inode; 16475d4f98a2SYan Zheng } 16485d4f98a2SYan Zheng 16494a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 16505d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 16515d4f98a2SYan Zheng goto again; 16525d4f98a2SYan Zheng 16535d4f98a2SYan Zheng node = rb_next(node); 16545d4f98a2SYan Zheng } 16555d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 16565d4f98a2SYan Zheng return NULL; 16575d4f98a2SYan Zheng } 16585d4f98a2SYan Zheng 165932da5386SDavid Sterba static int in_block_group(u64 bytenr, struct btrfs_block_group *block_group) 16605d4f98a2SYan Zheng { 1661b3470b5dSDavid Sterba if (bytenr >= block_group->start && 1662b3470b5dSDavid Sterba bytenr < block_group->start + block_group->length) 16635d4f98a2SYan Zheng return 1; 16645d4f98a2SYan Zheng return 0; 16655d4f98a2SYan Zheng } 16665d4f98a2SYan Zheng 16675d4f98a2SYan Zheng /* 16685d4f98a2SYan Zheng * get new location of data 16695d4f98a2SYan Zheng */ 16705d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 16715d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 16725d4f98a2SYan Zheng { 16735d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 16745d4f98a2SYan Zheng struct btrfs_path *path; 16755d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 16765d4f98a2SYan Zheng struct extent_buffer *leaf; 16775d4f98a2SYan Zheng int ret; 16785d4f98a2SYan Zheng 16795d4f98a2SYan Zheng path = btrfs_alloc_path(); 16805d4f98a2SYan Zheng if (!path) 16815d4f98a2SYan Zheng return -ENOMEM; 16825d4f98a2SYan Zheng 16835d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 1684f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 1685f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 16865d4f98a2SYan Zheng if (ret < 0) 16875d4f98a2SYan Zheng goto out; 16885d4f98a2SYan Zheng if (ret > 0) { 16895d4f98a2SYan Zheng ret = -ENOENT; 16905d4f98a2SYan Zheng goto out; 16915d4f98a2SYan Zheng } 16925d4f98a2SYan Zheng 16935d4f98a2SYan Zheng leaf = path->nodes[0]; 16945d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 16955d4f98a2SYan Zheng struct btrfs_file_extent_item); 16965d4f98a2SYan Zheng 16975d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 16985d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 16995d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 17005d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 17015d4f98a2SYan Zheng 17025d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 170383d4cfd4SJosef Bacik ret = -EINVAL; 17045d4f98a2SYan Zheng goto out; 17055d4f98a2SYan Zheng } 17065d4f98a2SYan Zheng 17075d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 17085d4f98a2SYan Zheng ret = 0; 17095d4f98a2SYan Zheng out: 17105d4f98a2SYan Zheng btrfs_free_path(path); 17115d4f98a2SYan Zheng return ret; 17125d4f98a2SYan Zheng } 17135d4f98a2SYan Zheng 17145d4f98a2SYan Zheng /* 17155d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 17165d4f98a2SYan Zheng * the new locations. 17175d4f98a2SYan Zheng */ 17183fd0a558SYan, Zheng static noinline_for_stack 17193fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 17205d4f98a2SYan Zheng struct reloc_control *rc, 17215d4f98a2SYan Zheng struct btrfs_root *root, 17223fd0a558SYan, Zheng struct extent_buffer *leaf) 17235d4f98a2SYan Zheng { 17240b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 17255d4f98a2SYan Zheng struct btrfs_key key; 17265d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 17275d4f98a2SYan Zheng struct inode *inode = NULL; 17285d4f98a2SYan Zheng u64 parent; 17295d4f98a2SYan Zheng u64 bytenr; 17303fd0a558SYan, Zheng u64 new_bytenr = 0; 17315d4f98a2SYan Zheng u64 num_bytes; 17325d4f98a2SYan Zheng u64 end; 17335d4f98a2SYan Zheng u32 nritems; 17345d4f98a2SYan Zheng u32 i; 173583d4cfd4SJosef Bacik int ret = 0; 17365d4f98a2SYan Zheng int first = 1; 17375d4f98a2SYan Zheng int dirty = 0; 17385d4f98a2SYan Zheng 17395d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 17405d4f98a2SYan Zheng return 0; 17415d4f98a2SYan Zheng 17425d4f98a2SYan Zheng /* reloc trees always use full backref */ 17435d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 17445d4f98a2SYan Zheng parent = leaf->start; 17455d4f98a2SYan Zheng else 17465d4f98a2SYan Zheng parent = 0; 17475d4f98a2SYan Zheng 17485d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 17495d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 175082fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 175182fa113fSQu Wenruo 17525d4f98a2SYan Zheng cond_resched(); 17535d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 17545d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 17555d4f98a2SYan Zheng continue; 17565d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 17575d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 17585d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 17595d4f98a2SYan Zheng continue; 17605d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 17615d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 17625d4f98a2SYan Zheng if (bytenr == 0) 17635d4f98a2SYan Zheng continue; 17645d4f98a2SYan Zheng if (!in_block_group(bytenr, rc->block_group)) 17655d4f98a2SYan Zheng continue; 17665d4f98a2SYan Zheng 17675d4f98a2SYan Zheng /* 17685d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 17695d4f98a2SYan Zheng * to complete and drop the extent cache 17705d4f98a2SYan Zheng */ 17715d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 17725d4f98a2SYan Zheng if (first) { 17735d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 17745d4f98a2SYan Zheng first = 0; 17754a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 17763fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 17775d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 17785d4f98a2SYan Zheng } 17794a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 17805d4f98a2SYan Zheng end = key.offset + 17815d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 17825d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 17830b246afaSJeff Mahoney fs_info->sectorsize)); 17840b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 17855d4f98a2SYan Zheng end--; 17865d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1787d0082371SJeff Mahoney key.offset, end); 17885d4f98a2SYan Zheng if (!ret) 17895d4f98a2SYan Zheng continue; 17905d4f98a2SYan Zheng 1791dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1792dcdbc059SNikolay Borisov key.offset, end, 1); 17935d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1794d0082371SJeff Mahoney key.offset, end); 17955d4f98a2SYan Zheng } 17965d4f98a2SYan Zheng } 17975d4f98a2SYan Zheng 17985d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 17995d4f98a2SYan Zheng bytenr, num_bytes); 180083d4cfd4SJosef Bacik if (ret) { 180183d4cfd4SJosef Bacik /* 180283d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 180383d4cfd4SJosef Bacik * in the file extent yet. 180483d4cfd4SJosef Bacik */ 180583d4cfd4SJosef Bacik break; 18063fd0a558SYan, Zheng } 18075d4f98a2SYan Zheng 18085d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 18095d4f98a2SYan Zheng dirty = 1; 18105d4f98a2SYan Zheng 18115d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 181282fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 181382fa113fSQu Wenruo num_bytes, parent); 181482fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 181582fa113fSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1816b06c4bf5SFilipe Manana key.objectid, key.offset); 181782fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 181883d4cfd4SJosef Bacik if (ret) { 181966642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 182083d4cfd4SJosef Bacik break; 182183d4cfd4SJosef Bacik } 18225d4f98a2SYan Zheng 1823ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, bytenr, 1824ffd4bb2aSQu Wenruo num_bytes, parent); 1825ffd4bb2aSQu Wenruo ref.real_root = root->root_key.objectid; 1826ffd4bb2aSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1827b06c4bf5SFilipe Manana key.objectid, key.offset); 1828ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 182983d4cfd4SJosef Bacik if (ret) { 183066642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 183183d4cfd4SJosef Bacik break; 183283d4cfd4SJosef Bacik } 18335d4f98a2SYan Zheng } 18345d4f98a2SYan Zheng if (dirty) 18355d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 18363fd0a558SYan, Zheng if (inode) 18373fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 183883d4cfd4SJosef Bacik return ret; 18395d4f98a2SYan Zheng } 18405d4f98a2SYan Zheng 18415d4f98a2SYan Zheng static noinline_for_stack 18425d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 18435d4f98a2SYan Zheng struct btrfs_path *path, int level) 18445d4f98a2SYan Zheng { 18455d4f98a2SYan Zheng struct btrfs_disk_key key1; 18465d4f98a2SYan Zheng struct btrfs_disk_key key2; 18475d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 18485d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 18495d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 18505d4f98a2SYan Zheng } 18515d4f98a2SYan Zheng 18525d4f98a2SYan Zheng /* 18535d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 18545d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 18555d4f98a2SYan Zheng * reloc tree was create can be replaced. 18565d4f98a2SYan Zheng * 18575d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 18585d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 18595d4f98a2SYan Zheng * errors, a negative error number is returned. 18605d4f98a2SYan Zheng */ 18613fd0a558SYan, Zheng static noinline_for_stack 18623d0174f7SQu Wenruo int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, 18635d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 18645d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 18655d4f98a2SYan Zheng int lowest_level, int max_level) 18665d4f98a2SYan Zheng { 18670b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 18685d4f98a2SYan Zheng struct extent_buffer *eb; 18695d4f98a2SYan Zheng struct extent_buffer *parent; 187082fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 18715d4f98a2SYan Zheng struct btrfs_key key; 18725d4f98a2SYan Zheng u64 old_bytenr; 18735d4f98a2SYan Zheng u64 new_bytenr; 18745d4f98a2SYan Zheng u64 old_ptr_gen; 18755d4f98a2SYan Zheng u64 new_ptr_gen; 18765d4f98a2SYan Zheng u64 last_snapshot; 18775d4f98a2SYan Zheng u32 blocksize; 18783fd0a558SYan, Zheng int cow = 0; 18795d4f98a2SYan Zheng int level; 18805d4f98a2SYan Zheng int ret; 18815d4f98a2SYan Zheng int slot; 18825d4f98a2SYan Zheng 18835d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 18845d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 18855d4f98a2SYan Zheng 18865d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 18873fd0a558SYan, Zheng again: 18885d4f98a2SYan Zheng slot = path->slots[lowest_level]; 18895d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 18905d4f98a2SYan Zheng 18915d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 18928bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 18935d4f98a2SYan Zheng level = btrfs_header_level(eb); 18945d4f98a2SYan Zheng 18955d4f98a2SYan Zheng if (level < lowest_level) { 18965d4f98a2SYan Zheng btrfs_tree_unlock(eb); 18975d4f98a2SYan Zheng free_extent_buffer(eb); 18985d4f98a2SYan Zheng return 0; 18995d4f98a2SYan Zheng } 19005d4f98a2SYan Zheng 19013fd0a558SYan, Zheng if (cow) { 19025d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 19035d4f98a2SYan Zheng BUG_ON(ret); 19043fd0a558SYan, Zheng } 19058bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19065d4f98a2SYan Zheng 19075d4f98a2SYan Zheng if (next_key) { 19085d4f98a2SYan Zheng next_key->objectid = (u64)-1; 19095d4f98a2SYan Zheng next_key->type = (u8)-1; 19105d4f98a2SYan Zheng next_key->offset = (u64)-1; 19115d4f98a2SYan Zheng } 19125d4f98a2SYan Zheng 19135d4f98a2SYan Zheng parent = eb; 19145d4f98a2SYan Zheng while (1) { 1915581c1760SQu Wenruo struct btrfs_key first_key; 1916581c1760SQu Wenruo 19175d4f98a2SYan Zheng level = btrfs_header_level(parent); 19185d4f98a2SYan Zheng BUG_ON(level < lowest_level); 19195d4f98a2SYan Zheng 19205d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 1921cbca7d59SFilipe Manana if (ret < 0) 1922cbca7d59SFilipe Manana break; 19235d4f98a2SYan Zheng if (ret && slot > 0) 19245d4f98a2SYan Zheng slot--; 19255d4f98a2SYan Zheng 19265d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 19275d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 19285d4f98a2SYan Zheng 19295d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 19300b246afaSJeff Mahoney blocksize = fs_info->nodesize; 19315d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 193217515f1bSQu Wenruo btrfs_node_key_to_cpu(parent, &first_key, slot); 19335d4f98a2SYan Zheng 19345d4f98a2SYan Zheng if (level <= max_level) { 19355d4f98a2SYan Zheng eb = path->nodes[level]; 19365d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 19375d4f98a2SYan Zheng path->slots[level]); 19385d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 19395d4f98a2SYan Zheng path->slots[level]); 19405d4f98a2SYan Zheng } else { 19415d4f98a2SYan Zheng new_bytenr = 0; 19425d4f98a2SYan Zheng new_ptr_gen = 0; 19435d4f98a2SYan Zheng } 19445d4f98a2SYan Zheng 1945fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 19465d4f98a2SYan Zheng ret = level; 19475d4f98a2SYan Zheng break; 19485d4f98a2SYan Zheng } 19495d4f98a2SYan Zheng 19505d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 19515d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 19523fd0a558SYan, Zheng if (level <= lowest_level) { 19535d4f98a2SYan Zheng ret = 0; 19545d4f98a2SYan Zheng break; 19555d4f98a2SYan Zheng } 19565d4f98a2SYan Zheng 1957581c1760SQu Wenruo eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen, 1958581c1760SQu Wenruo level - 1, &first_key); 195964c043deSLiu Bo if (IS_ERR(eb)) { 196064c043deSLiu Bo ret = PTR_ERR(eb); 1961264813acSLiu Bo break; 196264c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 196364c043deSLiu Bo ret = -EIO; 1964416bc658SJosef Bacik free_extent_buffer(eb); 1965379cde74SStefan Behrens break; 1966416bc658SJosef Bacik } 19675d4f98a2SYan Zheng btrfs_tree_lock(eb); 19683fd0a558SYan, Zheng if (cow) { 19695d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 19705d4f98a2SYan Zheng slot, &eb); 19715d4f98a2SYan Zheng BUG_ON(ret); 19725d4f98a2SYan Zheng } 19738bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 19745d4f98a2SYan Zheng 19755d4f98a2SYan Zheng btrfs_tree_unlock(parent); 19765d4f98a2SYan Zheng free_extent_buffer(parent); 19775d4f98a2SYan Zheng 19785d4f98a2SYan Zheng parent = eb; 19795d4f98a2SYan Zheng continue; 19805d4f98a2SYan Zheng } 19815d4f98a2SYan Zheng 19823fd0a558SYan, Zheng if (!cow) { 19833fd0a558SYan, Zheng btrfs_tree_unlock(parent); 19843fd0a558SYan, Zheng free_extent_buffer(parent); 19853fd0a558SYan, Zheng cow = 1; 19863fd0a558SYan, Zheng goto again; 19873fd0a558SYan, Zheng } 19883fd0a558SYan, Zheng 19895d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 19905d4f98a2SYan Zheng path->slots[level]); 1991b3b4aa74SDavid Sterba btrfs_release_path(path); 19925d4f98a2SYan Zheng 19935d4f98a2SYan Zheng path->lowest_level = level; 19945d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 19955d4f98a2SYan Zheng path->lowest_level = 0; 19965d4f98a2SYan Zheng BUG_ON(ret); 19975d4f98a2SYan Zheng 19985d4f98a2SYan Zheng /* 1999824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 2000824d8dffSQu Wenruo * 2001824d8dffSQu Wenruo * We must trace both trees. 2002824d8dffSQu Wenruo * 1) Tree reloc subtree 2003824d8dffSQu Wenruo * If not traced, we will leak data numbers 2004824d8dffSQu Wenruo * 2) Fs subtree 2005824d8dffSQu Wenruo * If not traced, we will double count old data 2006f616f5cdSQu Wenruo * 2007f616f5cdSQu Wenruo * We don't scan the subtree right now, but only record 2008f616f5cdSQu Wenruo * the swapped tree blocks. 2009f616f5cdSQu Wenruo * The real subtree rescan is delayed until we have new 2010f616f5cdSQu Wenruo * CoW on the subtree root node before transaction commit. 2011824d8dffSQu Wenruo */ 2012370a11b8SQu Wenruo ret = btrfs_qgroup_add_swapped_blocks(trans, dest, 2013370a11b8SQu Wenruo rc->block_group, parent, slot, 2014370a11b8SQu Wenruo path->nodes[level], path->slots[level], 2015370a11b8SQu Wenruo last_snapshot); 2016370a11b8SQu Wenruo if (ret < 0) 2017370a11b8SQu Wenruo break; 2018824d8dffSQu Wenruo /* 20195d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 20205d4f98a2SYan Zheng */ 20215d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 20225d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 20235d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 20245d4f98a2SYan Zheng 20255d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 20265d4f98a2SYan Zheng path->slots[level], old_bytenr); 20275d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 20285d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 20295d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 20305d4f98a2SYan Zheng 203182fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, old_bytenr, 203282fa113fSQu Wenruo blocksize, path->nodes[level]->start); 203382fa113fSQu Wenruo ref.skip_qgroup = true; 203482fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 203582fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 20365d4f98a2SYan Zheng BUG_ON(ret); 203782fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 203882fa113fSQu Wenruo blocksize, 0); 203982fa113fSQu Wenruo ref.skip_qgroup = true; 204082fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 204182fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 20425d4f98a2SYan Zheng BUG_ON(ret); 20435d4f98a2SYan Zheng 2044ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, new_bytenr, 2045ffd4bb2aSQu Wenruo blocksize, path->nodes[level]->start); 2046ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 2047ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2048ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 20495d4f98a2SYan Zheng BUG_ON(ret); 20505d4f98a2SYan Zheng 2051ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, old_bytenr, 2052ffd4bb2aSQu Wenruo blocksize, 0); 2053ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 2054ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 2055ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 20565d4f98a2SYan Zheng BUG_ON(ret); 20575d4f98a2SYan Zheng 20585d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 20595d4f98a2SYan Zheng 20605d4f98a2SYan Zheng ret = level; 20615d4f98a2SYan Zheng break; 20625d4f98a2SYan Zheng } 20635d4f98a2SYan Zheng btrfs_tree_unlock(parent); 20645d4f98a2SYan Zheng free_extent_buffer(parent); 20655d4f98a2SYan Zheng return ret; 20665d4f98a2SYan Zheng } 20675d4f98a2SYan Zheng 20685d4f98a2SYan Zheng /* 20695d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 20705d4f98a2SYan Zheng */ 20715d4f98a2SYan Zheng static noinline_for_stack 20725d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 20735d4f98a2SYan Zheng int *level) 20745d4f98a2SYan Zheng { 20755d4f98a2SYan Zheng struct extent_buffer *eb; 20765d4f98a2SYan Zheng int i; 20775d4f98a2SYan Zheng u64 last_snapshot; 20785d4f98a2SYan Zheng u32 nritems; 20795d4f98a2SYan Zheng 20805d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 20815d4f98a2SYan Zheng 20825d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 20835d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 20845d4f98a2SYan Zheng path->nodes[i] = NULL; 20855d4f98a2SYan Zheng } 20865d4f98a2SYan Zheng 20875d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 20885d4f98a2SYan Zheng eb = path->nodes[i]; 20895d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 20905d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 20915d4f98a2SYan Zheng path->slots[i]++; 20925d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 20935d4f98a2SYan Zheng last_snapshot) 20945d4f98a2SYan Zheng continue; 20955d4f98a2SYan Zheng 20965d4f98a2SYan Zheng *level = i; 20975d4f98a2SYan Zheng return 0; 20985d4f98a2SYan Zheng } 20995d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 21005d4f98a2SYan Zheng path->nodes[i] = NULL; 21015d4f98a2SYan Zheng } 21025d4f98a2SYan Zheng return 1; 21035d4f98a2SYan Zheng } 21045d4f98a2SYan Zheng 21055d4f98a2SYan Zheng /* 21065d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 21075d4f98a2SYan Zheng */ 21085d4f98a2SYan Zheng static noinline_for_stack 21095d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 21105d4f98a2SYan Zheng int *level) 21115d4f98a2SYan Zheng { 21122ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 21135d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 21145d4f98a2SYan Zheng int i; 21155d4f98a2SYan Zheng u64 bytenr; 21165d4f98a2SYan Zheng u64 ptr_gen = 0; 21175d4f98a2SYan Zheng u64 last_snapshot; 21185d4f98a2SYan Zheng u32 nritems; 21195d4f98a2SYan Zheng 21205d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 21215d4f98a2SYan Zheng 21225d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 2123581c1760SQu Wenruo struct btrfs_key first_key; 2124581c1760SQu Wenruo 21255d4f98a2SYan Zheng eb = path->nodes[i]; 21265d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 21275d4f98a2SYan Zheng while (path->slots[i] < nritems) { 21285d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 21295d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 21305d4f98a2SYan Zheng break; 21315d4f98a2SYan Zheng path->slots[i]++; 21325d4f98a2SYan Zheng } 21335d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 21345d4f98a2SYan Zheng if (i == *level) 21355d4f98a2SYan Zheng break; 21365d4f98a2SYan Zheng *level = i + 1; 21375d4f98a2SYan Zheng return 0; 21385d4f98a2SYan Zheng } 21395d4f98a2SYan Zheng if (i == 1) { 21405d4f98a2SYan Zheng *level = i; 21415d4f98a2SYan Zheng return 0; 21425d4f98a2SYan Zheng } 21435d4f98a2SYan Zheng 21445d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2145581c1760SQu Wenruo btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); 2146581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1, 2147581c1760SQu Wenruo &first_key); 214864c043deSLiu Bo if (IS_ERR(eb)) { 214964c043deSLiu Bo return PTR_ERR(eb); 215064c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2151416bc658SJosef Bacik free_extent_buffer(eb); 2152416bc658SJosef Bacik return -EIO; 2153416bc658SJosef Bacik } 21545d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 21555d4f98a2SYan Zheng path->nodes[i - 1] = eb; 21565d4f98a2SYan Zheng path->slots[i - 1] = 0; 21575d4f98a2SYan Zheng } 21585d4f98a2SYan Zheng return 1; 21595d4f98a2SYan Zheng } 21605d4f98a2SYan Zheng 21615d4f98a2SYan Zheng /* 21625d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 21635d4f98a2SYan Zheng * [min_key, max_key) 21645d4f98a2SYan Zheng */ 21655d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 21665d4f98a2SYan Zheng struct btrfs_key *min_key, 21675d4f98a2SYan Zheng struct btrfs_key *max_key) 21685d4f98a2SYan Zheng { 21690b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 21705d4f98a2SYan Zheng struct inode *inode = NULL; 21715d4f98a2SYan Zheng u64 objectid; 21725d4f98a2SYan Zheng u64 start, end; 217333345d01SLi Zefan u64 ino; 21745d4f98a2SYan Zheng 21755d4f98a2SYan Zheng objectid = min_key->objectid; 21765d4f98a2SYan Zheng while (1) { 21775d4f98a2SYan Zheng cond_resched(); 21785d4f98a2SYan Zheng iput(inode); 21795d4f98a2SYan Zheng 21805d4f98a2SYan Zheng if (objectid > max_key->objectid) 21815d4f98a2SYan Zheng break; 21825d4f98a2SYan Zheng 21835d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 21845d4f98a2SYan Zheng if (!inode) 21855d4f98a2SYan Zheng break; 21864a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 21875d4f98a2SYan Zheng 218833345d01SLi Zefan if (ino > max_key->objectid) { 21895d4f98a2SYan Zheng iput(inode); 21905d4f98a2SYan Zheng break; 21915d4f98a2SYan Zheng } 21925d4f98a2SYan Zheng 219333345d01SLi Zefan objectid = ino + 1; 21945d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 21955d4f98a2SYan Zheng continue; 21965d4f98a2SYan Zheng 219733345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 21985d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 21995d4f98a2SYan Zheng continue; 22005d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 22015d4f98a2SYan Zheng start = 0; 22025d4f98a2SYan Zheng else { 22035d4f98a2SYan Zheng start = min_key->offset; 22040b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 22055d4f98a2SYan Zheng } 22065d4f98a2SYan Zheng } else { 22075d4f98a2SYan Zheng start = 0; 22085d4f98a2SYan Zheng } 22095d4f98a2SYan Zheng 221033345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 22115d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 22125d4f98a2SYan Zheng continue; 22135d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 22145d4f98a2SYan Zheng end = (u64)-1; 22155d4f98a2SYan Zheng } else { 22165d4f98a2SYan Zheng if (max_key->offset == 0) 22175d4f98a2SYan Zheng continue; 22185d4f98a2SYan Zheng end = max_key->offset; 22190b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 22205d4f98a2SYan Zheng end--; 22215d4f98a2SYan Zheng } 22225d4f98a2SYan Zheng } else { 22235d4f98a2SYan Zheng end = (u64)-1; 22245d4f98a2SYan Zheng } 22255d4f98a2SYan Zheng 22265d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2227d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 2228dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 2229d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 22305d4f98a2SYan Zheng } 22315d4f98a2SYan Zheng return 0; 22325d4f98a2SYan Zheng } 22335d4f98a2SYan Zheng 22345d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 22355d4f98a2SYan Zheng struct btrfs_key *key) 22365d4f98a2SYan Zheng 22375d4f98a2SYan Zheng { 22385d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 22395d4f98a2SYan Zheng if (!path->nodes[level]) 22405d4f98a2SYan Zheng break; 22415d4f98a2SYan Zheng if (path->slots[level] + 1 < 22425d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 22435d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 22445d4f98a2SYan Zheng path->slots[level] + 1); 22455d4f98a2SYan Zheng return 0; 22465d4f98a2SYan Zheng } 22475d4f98a2SYan Zheng level++; 22485d4f98a2SYan Zheng } 22495d4f98a2SYan Zheng return 1; 22505d4f98a2SYan Zheng } 22515d4f98a2SYan Zheng 22525d4f98a2SYan Zheng /* 2253d2311e69SQu Wenruo * Insert current subvolume into reloc_control::dirty_subvol_roots 2254d2311e69SQu Wenruo */ 2255d2311e69SQu Wenruo static void insert_dirty_subvol(struct btrfs_trans_handle *trans, 2256d2311e69SQu Wenruo struct reloc_control *rc, 2257d2311e69SQu Wenruo struct btrfs_root *root) 2258d2311e69SQu Wenruo { 2259d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2260d2311e69SQu Wenruo struct btrfs_root_item *reloc_root_item; 2261d2311e69SQu Wenruo 2262d2311e69SQu Wenruo /* @root must be a subvolume tree root with a valid reloc tree */ 2263d2311e69SQu Wenruo ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 2264d2311e69SQu Wenruo ASSERT(reloc_root); 2265d2311e69SQu Wenruo 2266d2311e69SQu Wenruo reloc_root_item = &reloc_root->root_item; 2267d2311e69SQu Wenruo memset(&reloc_root_item->drop_progress, 0, 2268d2311e69SQu Wenruo sizeof(reloc_root_item->drop_progress)); 2269d2311e69SQu Wenruo reloc_root_item->drop_level = 0; 2270d2311e69SQu Wenruo btrfs_set_root_refs(reloc_root_item, 0); 2271d2311e69SQu Wenruo btrfs_update_reloc_root(trans, root); 2272d2311e69SQu Wenruo 2273d2311e69SQu Wenruo if (list_empty(&root->reloc_dirty_list)) { 227400246528SJosef Bacik btrfs_grab_root(root); 2275d2311e69SQu Wenruo list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); 2276d2311e69SQu Wenruo } 2277d2311e69SQu Wenruo } 2278d2311e69SQu Wenruo 2279d2311e69SQu Wenruo static int clean_dirty_subvols(struct reloc_control *rc) 2280d2311e69SQu Wenruo { 2281d2311e69SQu Wenruo struct btrfs_root *root; 2282d2311e69SQu Wenruo struct btrfs_root *next; 2283d2311e69SQu Wenruo int ret = 0; 228430d40577SQu Wenruo int ret2; 2285d2311e69SQu Wenruo 2286d2311e69SQu Wenruo list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, 2287d2311e69SQu Wenruo reloc_dirty_list) { 228830d40577SQu Wenruo if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 228930d40577SQu Wenruo /* Merged subvolume, cleanup its reloc root */ 2290d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2291d2311e69SQu Wenruo 2292d2311e69SQu Wenruo list_del_init(&root->reloc_dirty_list); 2293d2311e69SQu Wenruo root->reloc_root = NULL; 2294d2311e69SQu Wenruo if (reloc_root) { 2295d2311e69SQu Wenruo 2296d2311e69SQu Wenruo ret2 = btrfs_drop_snapshot(reloc_root, NULL, 0, 1); 2297d2311e69SQu Wenruo if (ret2 < 0 && !ret) 2298d2311e69SQu Wenruo ret = ret2; 2299d2311e69SQu Wenruo } 23006282675eSQu Wenruo /* 23016282675eSQu Wenruo * Need barrier to ensure clear_bit() only happens after 23026282675eSQu Wenruo * root->reloc_root = NULL. Pairs with have_reloc_root. 23036282675eSQu Wenruo */ 23046282675eSQu Wenruo smp_wmb(); 23051fac4a54SQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 230600246528SJosef Bacik btrfs_put_root(root); 230730d40577SQu Wenruo } else { 230830d40577SQu Wenruo /* Orphan reloc tree, just clean it up */ 230930d40577SQu Wenruo ret2 = btrfs_drop_snapshot(root, NULL, 0, 1); 231030d40577SQu Wenruo if (ret2 < 0 && !ret) 231130d40577SQu Wenruo ret = ret2; 231230d40577SQu Wenruo } 2313d2311e69SQu Wenruo } 2314d2311e69SQu Wenruo return ret; 2315d2311e69SQu Wenruo } 2316d2311e69SQu Wenruo 2317d2311e69SQu Wenruo /* 23185d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 23195d4f98a2SYan Zheng * fs tree. 23205d4f98a2SYan Zheng */ 23215d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 23225d4f98a2SYan Zheng struct btrfs_root *root) 23235d4f98a2SYan Zheng { 23240b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 23255d4f98a2SYan Zheng struct btrfs_key key; 23265d4f98a2SYan Zheng struct btrfs_key next_key; 23279e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 23285d4f98a2SYan Zheng struct btrfs_root *reloc_root; 23295d4f98a2SYan Zheng struct btrfs_root_item *root_item; 23305d4f98a2SYan Zheng struct btrfs_path *path; 23313fd0a558SYan, Zheng struct extent_buffer *leaf; 23325d4f98a2SYan Zheng int level; 23335d4f98a2SYan Zheng int max_level; 23345d4f98a2SYan Zheng int replaced = 0; 23355d4f98a2SYan Zheng int ret; 23365d4f98a2SYan Zheng int err = 0; 23373fd0a558SYan, Zheng u32 min_reserved; 23385d4f98a2SYan Zheng 23395d4f98a2SYan Zheng path = btrfs_alloc_path(); 23405d4f98a2SYan Zheng if (!path) 23415d4f98a2SYan Zheng return -ENOMEM; 2342e4058b54SDavid Sterba path->reada = READA_FORWARD; 23435d4f98a2SYan Zheng 23445d4f98a2SYan Zheng reloc_root = root->reloc_root; 23455d4f98a2SYan Zheng root_item = &reloc_root->root_item; 23465d4f98a2SYan Zheng 23475d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 23485d4f98a2SYan Zheng level = btrfs_root_level(root_item); 234967439dadSDavid Sterba atomic_inc(&reloc_root->node->refs); 23505d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 23515d4f98a2SYan Zheng path->slots[level] = 0; 23525d4f98a2SYan Zheng } else { 23535d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 23545d4f98a2SYan Zheng 23555d4f98a2SYan Zheng level = root_item->drop_level; 23565d4f98a2SYan Zheng BUG_ON(level == 0); 23575d4f98a2SYan Zheng path->lowest_level = level; 23585d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 235933c66f43SYan Zheng path->lowest_level = 0; 23605d4f98a2SYan Zheng if (ret < 0) { 23615d4f98a2SYan Zheng btrfs_free_path(path); 23625d4f98a2SYan Zheng return ret; 23635d4f98a2SYan Zheng } 23645d4f98a2SYan Zheng 23655d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 23665d4f98a2SYan Zheng path->slots[level]); 23675d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 23685d4f98a2SYan Zheng 23695d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 23705d4f98a2SYan Zheng } 23715d4f98a2SYan Zheng 23720b246afaSJeff Mahoney min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 23735d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 23745d4f98a2SYan Zheng 23755d4f98a2SYan Zheng while (1) { 237608e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 237708e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 23783fd0a558SYan, Zheng if (ret) { 23799e6a0c52SJosef Bacik err = ret; 23809e6a0c52SJosef Bacik goto out; 23813fd0a558SYan, Zheng } 23829e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 23839e6a0c52SJosef Bacik if (IS_ERR(trans)) { 23849e6a0c52SJosef Bacik err = PTR_ERR(trans); 23859e6a0c52SJosef Bacik trans = NULL; 23869e6a0c52SJosef Bacik goto out; 23879e6a0c52SJosef Bacik } 23889e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 23893fd0a558SYan, Zheng 23903fd0a558SYan, Zheng replaced = 0; 23915d4f98a2SYan Zheng max_level = level; 23925d4f98a2SYan Zheng 23935d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 23945d4f98a2SYan Zheng if (ret < 0) { 23955d4f98a2SYan Zheng err = ret; 23965d4f98a2SYan Zheng goto out; 23975d4f98a2SYan Zheng } 23985d4f98a2SYan Zheng if (ret > 0) 23995d4f98a2SYan Zheng break; 24005d4f98a2SYan Zheng 24015d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 24025d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 24035d4f98a2SYan Zheng ret = 0; 24045d4f98a2SYan Zheng } else { 24053d0174f7SQu Wenruo ret = replace_path(trans, rc, root, reloc_root, path, 24063fd0a558SYan, Zheng &next_key, level, max_level); 24075d4f98a2SYan Zheng } 24085d4f98a2SYan Zheng if (ret < 0) { 24095d4f98a2SYan Zheng err = ret; 24105d4f98a2SYan Zheng goto out; 24115d4f98a2SYan Zheng } 24125d4f98a2SYan Zheng 24135d4f98a2SYan Zheng if (ret > 0) { 24145d4f98a2SYan Zheng level = ret; 24155d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 24165d4f98a2SYan Zheng path->slots[level]); 24175d4f98a2SYan Zheng replaced = 1; 24185d4f98a2SYan Zheng } 24195d4f98a2SYan Zheng 24205d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 24215d4f98a2SYan Zheng if (ret > 0) 24225d4f98a2SYan Zheng break; 24235d4f98a2SYan Zheng 24245d4f98a2SYan Zheng BUG_ON(level == 0); 24255d4f98a2SYan Zheng /* 24265d4f98a2SYan Zheng * save the merging progress in the drop_progress. 24275d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 24285d4f98a2SYan Zheng */ 24295d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 24305d4f98a2SYan Zheng path->slots[level]); 24315d4f98a2SYan Zheng root_item->drop_level = level; 24325d4f98a2SYan Zheng 24333a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 24349e6a0c52SJosef Bacik trans = NULL; 24355d4f98a2SYan Zheng 24362ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 24375d4f98a2SYan Zheng 24385d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 24395d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 24405d4f98a2SYan Zheng } 24415d4f98a2SYan Zheng 24425d4f98a2SYan Zheng /* 24435d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 24445d4f98a2SYan Zheng * relocated and the block is tree root. 24455d4f98a2SYan Zheng */ 24465d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 24475d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 24485d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 24495d4f98a2SYan Zheng free_extent_buffer(leaf); 24505d4f98a2SYan Zheng if (ret < 0) 24515d4f98a2SYan Zheng err = ret; 24525d4f98a2SYan Zheng out: 24535d4f98a2SYan Zheng btrfs_free_path(path); 24545d4f98a2SYan Zheng 2455d2311e69SQu Wenruo if (err == 0) 2456d2311e69SQu Wenruo insert_dirty_subvol(trans, rc, root); 24575d4f98a2SYan Zheng 24589e6a0c52SJosef Bacik if (trans) 24593a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 24605d4f98a2SYan Zheng 24612ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 24625d4f98a2SYan Zheng 24635d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 24645d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 24655d4f98a2SYan Zheng 24665d4f98a2SYan Zheng return err; 24675d4f98a2SYan Zheng } 24685d4f98a2SYan Zheng 24693fd0a558SYan, Zheng static noinline_for_stack 24703fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 24715d4f98a2SYan Zheng { 24723fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 24730b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 24743fd0a558SYan, Zheng struct btrfs_root *reloc_root; 24755d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 24763fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 24773fd0a558SYan, Zheng u64 num_bytes = 0; 24783fd0a558SYan, Zheng int ret; 24793fd0a558SYan, Zheng 24800b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 24810b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 24823fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 24830b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 24847585717fSChris Mason 24853fd0a558SYan, Zheng again: 24863fd0a558SYan, Zheng if (!err) { 24873fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 248808e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 248908e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 24903fd0a558SYan, Zheng if (ret) 24913fd0a558SYan, Zheng err = ret; 24923fd0a558SYan, Zheng } 24933fd0a558SYan, Zheng 24947a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 24953612b495STsutomu Itoh if (IS_ERR(trans)) { 24963612b495STsutomu Itoh if (!err) 24972ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 24982ff7e61eSJeff Mahoney num_bytes); 24993612b495STsutomu Itoh return PTR_ERR(trans); 25003612b495STsutomu Itoh } 25013fd0a558SYan, Zheng 25023fd0a558SYan, Zheng if (!err) { 25033fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 25043a45bb20SJeff Mahoney btrfs_end_transaction(trans); 25052ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 25062ff7e61eSJeff Mahoney num_bytes); 25073fd0a558SYan, Zheng goto again; 25083fd0a558SYan, Zheng } 25093fd0a558SYan, Zheng } 25103fd0a558SYan, Zheng 25113fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 25123fd0a558SYan, Zheng 25133fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 25143fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 25153fd0a558SYan, Zheng struct btrfs_root, root_list); 25163fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 25173fd0a558SYan, Zheng 25180b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 25193fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 25203fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 25213fd0a558SYan, Zheng 25223fd0a558SYan, Zheng /* 25233fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 25243fd0a558SYan, Zheng * knows it should resumes merging 25253fd0a558SYan, Zheng */ 25263fd0a558SYan, Zheng if (!err) 25273fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 25283fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 25293fd0a558SYan, Zheng 25303fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 253100246528SJosef Bacik btrfs_put_root(root); 25323fd0a558SYan, Zheng } 25333fd0a558SYan, Zheng 25343fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 25353fd0a558SYan, Zheng 25363fd0a558SYan, Zheng if (!err) 25373a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 25383fd0a558SYan, Zheng else 25393a45bb20SJeff Mahoney btrfs_end_transaction(trans); 25403fd0a558SYan, Zheng return err; 25413fd0a558SYan, Zheng } 25423fd0a558SYan, Zheng 25433fd0a558SYan, Zheng static noinline_for_stack 2544aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2545aca1bba6SLiu Bo { 2546aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2547aca1bba6SLiu Bo 2548aca1bba6SLiu Bo while (!list_empty(list)) { 2549aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2550aca1bba6SLiu Bo root_list); 2551bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 25526bdf131fSJosef Bacik free_extent_buffer(reloc_root->node); 25536bdf131fSJosef Bacik free_extent_buffer(reloc_root->commit_root); 25546bdf131fSJosef Bacik reloc_root->node = NULL; 25556bdf131fSJosef Bacik reloc_root->commit_root = NULL; 2556aca1bba6SLiu Bo } 2557aca1bba6SLiu Bo } 2558aca1bba6SLiu Bo 2559aca1bba6SLiu Bo static noinline_for_stack 256094404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 25613fd0a558SYan, Zheng { 25620b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 25635d4f98a2SYan Zheng struct btrfs_root *root; 25645d4f98a2SYan Zheng struct btrfs_root *reloc_root; 25653fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 25663fd0a558SYan, Zheng int found = 0; 2567aca1bba6SLiu Bo int ret = 0; 25683fd0a558SYan, Zheng again: 25693fd0a558SYan, Zheng root = rc->extent_root; 25707585717fSChris Mason 25717585717fSChris Mason /* 25727585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 25737585717fSChris Mason * we have to make sure nobody is in the middle of 25747585717fSChris Mason * adding their roots to the list while we are 25757585717fSChris Mason * doing this splice 25767585717fSChris Mason */ 25770b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 25783fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 25790b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 25805d4f98a2SYan Zheng 25813fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 25823fd0a558SYan, Zheng found = 1; 25833fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 25843fd0a558SYan, Zheng struct btrfs_root, root_list); 25855d4f98a2SYan Zheng 25865d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 25870b246afaSJeff Mahoney root = read_fs_root(fs_info, 25885d4f98a2SYan Zheng reloc_root->root_key.offset); 25895d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 25905d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 25915d4f98a2SYan Zheng 25923fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 259300246528SJosef Bacik btrfs_put_root(root); 2594b37b39cdSJosef Bacik if (ret) { 259525e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 259625e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 259725e293c2SWang Shilong &reloc_roots); 2598aca1bba6SLiu Bo goto out; 2599b37b39cdSJosef Bacik } 26003fd0a558SYan, Zheng } else { 26013fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 260230d40577SQu Wenruo /* Don't forget to queue this reloc root for cleanup */ 260330d40577SQu Wenruo list_add_tail(&reloc_root->reloc_dirty_list, 260430d40577SQu Wenruo &rc->dirty_subvol_roots); 26053fd0a558SYan, Zheng } 26065d4f98a2SYan Zheng } 26075d4f98a2SYan Zheng 26083fd0a558SYan, Zheng if (found) { 26093fd0a558SYan, Zheng found = 0; 26103fd0a558SYan, Zheng goto again; 26115d4f98a2SYan Zheng } 2612aca1bba6SLiu Bo out: 2613aca1bba6SLiu Bo if (ret) { 26140b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2615aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2616aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2617467bb1d2SWang Shilong 2618467bb1d2SWang Shilong /* new reloc root may be added */ 26190b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2620467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 26210b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2622467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2623467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2624aca1bba6SLiu Bo } 2625aca1bba6SLiu Bo 26265d4f98a2SYan Zheng BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 26275d4f98a2SYan Zheng } 26285d4f98a2SYan Zheng 26295d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 26305d4f98a2SYan Zheng { 26315d4f98a2SYan Zheng struct tree_block *block; 26325d4f98a2SYan Zheng struct rb_node *rb_node; 26335d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 26345d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 26355d4f98a2SYan Zheng rb_erase(rb_node, blocks); 26365d4f98a2SYan Zheng kfree(block); 26375d4f98a2SYan Zheng } 26385d4f98a2SYan Zheng } 26395d4f98a2SYan Zheng 26405d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 26415d4f98a2SYan Zheng struct btrfs_root *reloc_root) 26425d4f98a2SYan Zheng { 26430b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 26445d4f98a2SYan Zheng struct btrfs_root *root; 2645442b1ac5SJosef Bacik int ret; 26465d4f98a2SYan Zheng 26475d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 26485d4f98a2SYan Zheng return 0; 26495d4f98a2SYan Zheng 26500b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 26515d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 26525d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 2653442b1ac5SJosef Bacik ret = btrfs_record_root_in_trans(trans, root); 265400246528SJosef Bacik btrfs_put_root(root); 26555d4f98a2SYan Zheng 2656442b1ac5SJosef Bacik return ret; 26575d4f98a2SYan Zheng } 26585d4f98a2SYan Zheng 26593fd0a558SYan, Zheng static noinline_for_stack 26603fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 26613fd0a558SYan, Zheng struct reloc_control *rc, 26625d4f98a2SYan Zheng struct backref_node *node, 2663dc4103f9SWang Shilong struct backref_edge *edges[]) 26645d4f98a2SYan Zheng { 26655d4f98a2SYan Zheng struct backref_node *next; 26665d4f98a2SYan Zheng struct btrfs_root *root; 26673fd0a558SYan, Zheng int index = 0; 26683fd0a558SYan, Zheng 26695d4f98a2SYan Zheng next = node; 26705d4f98a2SYan Zheng while (1) { 26715d4f98a2SYan Zheng cond_resched(); 26725d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 26735d4f98a2SYan Zheng root = next->root; 26743fd0a558SYan, Zheng BUG_ON(!root); 267527cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 26765d4f98a2SYan Zheng 26775d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 26785d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 26795d4f98a2SYan Zheng break; 26805d4f98a2SYan Zheng } 26815d4f98a2SYan Zheng 26825d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 26833fd0a558SYan, Zheng root = root->reloc_root; 26843fd0a558SYan, Zheng 26853fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 26863fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 26873fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 26883fd0a558SYan, Zheng next->new_bytenr = root->node->start; 268900246528SJosef Bacik btrfs_put_root(next->root); 269000246528SJosef Bacik next->root = btrfs_grab_root(root); 26910b530bc5SJosef Bacik ASSERT(next->root); 26923fd0a558SYan, Zheng list_add_tail(&next->list, 26933fd0a558SYan, Zheng &rc->backref_cache.changed); 26943fd0a558SYan, Zheng __mark_block_processed(rc, next); 26955d4f98a2SYan Zheng break; 26965d4f98a2SYan Zheng } 26975d4f98a2SYan Zheng 26983fd0a558SYan, Zheng WARN_ON(1); 26995d4f98a2SYan Zheng root = NULL; 27005d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 27015d4f98a2SYan Zheng if (!next || next->level <= node->level) 27025d4f98a2SYan Zheng break; 27035d4f98a2SYan Zheng } 27043fd0a558SYan, Zheng if (!root) 27053fd0a558SYan, Zheng return NULL; 27065d4f98a2SYan Zheng 27073fd0a558SYan, Zheng next = node; 27083fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 27093fd0a558SYan, Zheng while (1) { 27103fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 27113fd0a558SYan, Zheng if (--index < 0) 27123fd0a558SYan, Zheng break; 27133fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 27143fd0a558SYan, Zheng } 27155d4f98a2SYan Zheng return root; 27165d4f98a2SYan Zheng } 27175d4f98a2SYan Zheng 27183fd0a558SYan, Zheng /* 27193fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 27203fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 27213fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 27223fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 27233fd0a558SYan, Zheng */ 27245d4f98a2SYan Zheng static noinline_for_stack 2725147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 27265d4f98a2SYan Zheng { 27273fd0a558SYan, Zheng struct backref_node *next; 27283fd0a558SYan, Zheng struct btrfs_root *root; 27293fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 27305d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 27313fd0a558SYan, Zheng int index = 0; 27323fd0a558SYan, Zheng 27333fd0a558SYan, Zheng next = node; 27343fd0a558SYan, Zheng while (1) { 27353fd0a558SYan, Zheng cond_resched(); 27363fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 27373fd0a558SYan, Zheng root = next->root; 27383fd0a558SYan, Zheng BUG_ON(!root); 27393fd0a558SYan, Zheng 274025985edcSLucas De Marchi /* no other choice for non-references counted tree */ 274127cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 27423fd0a558SYan, Zheng return root; 27433fd0a558SYan, Zheng 27443fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 27453fd0a558SYan, Zheng fs_root = root; 27463fd0a558SYan, Zheng 27473fd0a558SYan, Zheng if (next != node) 27483fd0a558SYan, Zheng return NULL; 27493fd0a558SYan, Zheng 27503fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 27513fd0a558SYan, Zheng if (!next || next->level <= node->level) 27523fd0a558SYan, Zheng break; 27533fd0a558SYan, Zheng } 27543fd0a558SYan, Zheng 27553fd0a558SYan, Zheng if (!fs_root) 27563fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 27573fd0a558SYan, Zheng return fs_root; 27585d4f98a2SYan Zheng } 27595d4f98a2SYan Zheng 27605d4f98a2SYan Zheng static noinline_for_stack 27613fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 27623fd0a558SYan, Zheng struct backref_node *node, int reserve) 27635d4f98a2SYan Zheng { 27640b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 27653fd0a558SYan, Zheng struct backref_node *next = node; 27663fd0a558SYan, Zheng struct backref_edge *edge; 27673fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 27683fd0a558SYan, Zheng u64 num_bytes = 0; 27693fd0a558SYan, Zheng int index = 0; 27705d4f98a2SYan Zheng 27713fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 27723fd0a558SYan, Zheng 27733fd0a558SYan, Zheng while (next) { 27743fd0a558SYan, Zheng cond_resched(); 27755d4f98a2SYan Zheng while (1) { 27763fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 27775d4f98a2SYan Zheng break; 27785d4f98a2SYan Zheng 27790b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 27803fd0a558SYan, Zheng 27813fd0a558SYan, Zheng if (list_empty(&next->upper)) 27823fd0a558SYan, Zheng break; 27833fd0a558SYan, Zheng 27843fd0a558SYan, Zheng edge = list_entry(next->upper.next, 27853fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 27863fd0a558SYan, Zheng edges[index++] = edge; 27873fd0a558SYan, Zheng next = edge->node[UPPER]; 27885d4f98a2SYan Zheng } 27893fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 27903fd0a558SYan, Zheng } 27913fd0a558SYan, Zheng return num_bytes; 27923fd0a558SYan, Zheng } 27933fd0a558SYan, Zheng 27943fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 27953fd0a558SYan, Zheng struct reloc_control *rc, 27963fd0a558SYan, Zheng struct backref_node *node) 27973fd0a558SYan, Zheng { 27983fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2799da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 28003fd0a558SYan, Zheng u64 num_bytes; 28013fd0a558SYan, Zheng int ret; 28020647bf56SWang Shilong u64 tmp; 28033fd0a558SYan, Zheng 28043fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 28053fd0a558SYan, Zheng 28063fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 28070647bf56SWang Shilong rc->reserved_bytes += num_bytes; 28088ca17f0fSJosef Bacik 28098ca17f0fSJosef Bacik /* 28108ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 28118ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 28128ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 28138ca17f0fSJosef Bacik */ 28140647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 28158ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 28163fd0a558SYan, Zheng if (ret) { 2817da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 28180647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 28190647bf56SWang Shilong tmp <<= 1; 28200647bf56SWang Shilong /* 28210647bf56SWang Shilong * only one thread can access block_rsv at this point, 28220647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 28230647bf56SWang Shilong * we expand more reservation size here to allow enough 282452042d8eSAndrea Gelmini * space for relocation and we will return earlier in 28250647bf56SWang Shilong * enospc case. 28260647bf56SWang Shilong */ 2827da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 28280647bf56SWang Shilong RELOCATION_RESERVED_NODES; 28298ca17f0fSJosef Bacik return -EAGAIN; 28303fd0a558SYan, Zheng } 28313fd0a558SYan, Zheng 28323fd0a558SYan, Zheng return 0; 28333fd0a558SYan, Zheng } 28343fd0a558SYan, Zheng 28355d4f98a2SYan Zheng /* 28365d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 28375d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 28385d4f98a2SYan Zheng * 28395d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 28405d4f98a2SYan Zheng * in that case this function just updates pointers. 28415d4f98a2SYan Zheng */ 28425d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 28433fd0a558SYan, Zheng struct reloc_control *rc, 28445d4f98a2SYan Zheng struct backref_node *node, 28455d4f98a2SYan Zheng struct btrfs_key *key, 28465d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 28475d4f98a2SYan Zheng { 28482ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 28495d4f98a2SYan Zheng struct backref_node *upper; 28505d4f98a2SYan Zheng struct backref_edge *edge; 28515d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28525d4f98a2SYan Zheng struct btrfs_root *root; 28535d4f98a2SYan Zheng struct extent_buffer *eb; 28545d4f98a2SYan Zheng u32 blocksize; 28555d4f98a2SYan Zheng u64 bytenr; 28565d4f98a2SYan Zheng u64 generation; 28575d4f98a2SYan Zheng int slot; 28585d4f98a2SYan Zheng int ret; 28595d4f98a2SYan Zheng int err = 0; 28605d4f98a2SYan Zheng 28615d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 28625d4f98a2SYan Zheng 28635d4f98a2SYan Zheng path->lowest_level = node->level + 1; 28643fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 28655d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 2866581c1760SQu Wenruo struct btrfs_key first_key; 286782fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 2868581c1760SQu Wenruo 28695d4f98a2SYan Zheng cond_resched(); 28705d4f98a2SYan Zheng 28715d4f98a2SYan Zheng upper = edge->node[UPPER]; 2872dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 28733fd0a558SYan, Zheng BUG_ON(!root); 28745d4f98a2SYan Zheng 28753fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 28763fd0a558SYan, Zheng if (!lowest) { 28773fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 28783fd0a558SYan, Zheng upper->level, &slot); 2879cbca7d59SFilipe Manana if (ret < 0) { 2880cbca7d59SFilipe Manana err = ret; 2881cbca7d59SFilipe Manana goto next; 2882cbca7d59SFilipe Manana } 28833fd0a558SYan, Zheng BUG_ON(ret); 28843fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 28853fd0a558SYan, Zheng if (node->eb->start == bytenr) 28863fd0a558SYan, Zheng goto next; 28873fd0a558SYan, Zheng } 28885d4f98a2SYan Zheng drop_node_buffer(upper); 28893fd0a558SYan, Zheng } 28905d4f98a2SYan Zheng 28915d4f98a2SYan Zheng if (!upper->eb) { 28925d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 28933561b9dbSLiu Bo if (ret) { 28943561b9dbSLiu Bo if (ret < 0) 28955d4f98a2SYan Zheng err = ret; 28963561b9dbSLiu Bo else 28973561b9dbSLiu Bo err = -ENOENT; 28983561b9dbSLiu Bo 28993561b9dbSLiu Bo btrfs_release_path(path); 29005d4f98a2SYan Zheng break; 29015d4f98a2SYan Zheng } 29025d4f98a2SYan Zheng 29033fd0a558SYan, Zheng if (!upper->eb) { 29043fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 29053fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 29063fd0a558SYan, Zheng } else { 29073fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 29083fd0a558SYan, Zheng } 29093fd0a558SYan, Zheng 29103fd0a558SYan, Zheng upper->locked = 1; 29113fd0a558SYan, Zheng path->locks[upper->level] = 0; 29123fd0a558SYan, Zheng 29135d4f98a2SYan Zheng slot = path->slots[upper->level]; 2914b3b4aa74SDavid Sterba btrfs_release_path(path); 29155d4f98a2SYan Zheng } else { 29165d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 29175d4f98a2SYan Zheng &slot); 2918cbca7d59SFilipe Manana if (ret < 0) { 2919cbca7d59SFilipe Manana err = ret; 2920cbca7d59SFilipe Manana goto next; 2921cbca7d59SFilipe Manana } 29225d4f98a2SYan Zheng BUG_ON(ret); 29235d4f98a2SYan Zheng } 29245d4f98a2SYan Zheng 29255d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 29263fd0a558SYan, Zheng if (lowest) { 29274547f4d8SLiu Bo if (bytenr != node->bytenr) { 29284547f4d8SLiu Bo btrfs_err(root->fs_info, 29294547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 29304547f4d8SLiu Bo bytenr, node->bytenr, slot, 29314547f4d8SLiu Bo upper->eb->start); 29324547f4d8SLiu Bo err = -EIO; 29334547f4d8SLiu Bo goto next; 29344547f4d8SLiu Bo } 29355d4f98a2SYan Zheng } else { 29363fd0a558SYan, Zheng if (node->eb->start == bytenr) 29373fd0a558SYan, Zheng goto next; 29385d4f98a2SYan Zheng } 29395d4f98a2SYan Zheng 2940da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 29415d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 2942581c1760SQu Wenruo btrfs_node_key_to_cpu(upper->eb, &first_key, slot); 2943581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, generation, 2944581c1760SQu Wenruo upper->level - 1, &first_key); 294564c043deSLiu Bo if (IS_ERR(eb)) { 294664c043deSLiu Bo err = PTR_ERR(eb); 294764c043deSLiu Bo goto next; 294864c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2949416bc658SJosef Bacik free_extent_buffer(eb); 295097d9a8a4STsutomu Itoh err = -EIO; 295197d9a8a4STsutomu Itoh goto next; 295297d9a8a4STsutomu Itoh } 29535d4f98a2SYan Zheng btrfs_tree_lock(eb); 29548bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 29555d4f98a2SYan Zheng 29565d4f98a2SYan Zheng if (!node->eb) { 29575d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 29585d4f98a2SYan Zheng slot, &eb); 29593fd0a558SYan, Zheng btrfs_tree_unlock(eb); 29603fd0a558SYan, Zheng free_extent_buffer(eb); 29615d4f98a2SYan Zheng if (ret < 0) { 29625d4f98a2SYan Zheng err = ret; 29633fd0a558SYan, Zheng goto next; 29645d4f98a2SYan Zheng } 29653fd0a558SYan, Zheng BUG_ON(node->eb != eb); 29665d4f98a2SYan Zheng } else { 29675d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 29685d4f98a2SYan Zheng node->eb->start); 29695d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 29705d4f98a2SYan Zheng trans->transid); 29715d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 29725d4f98a2SYan Zheng 297382fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, 29745d4f98a2SYan Zheng node->eb->start, blocksize, 297582fa113fSQu Wenruo upper->eb->start); 297682fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 297782fa113fSQu Wenruo btrfs_init_tree_ref(&ref, node->level, 297882fa113fSQu Wenruo btrfs_header_owner(upper->eb)); 297982fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 29805d4f98a2SYan Zheng BUG_ON(ret); 29815d4f98a2SYan Zheng 29825d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 29835d4f98a2SYan Zheng BUG_ON(ret); 29845d4f98a2SYan Zheng } 29853fd0a558SYan, Zheng next: 29863fd0a558SYan, Zheng if (!upper->pending) 29873fd0a558SYan, Zheng drop_node_buffer(upper); 29883fd0a558SYan, Zheng else 29893fd0a558SYan, Zheng unlock_node_buffer(upper); 29903fd0a558SYan, Zheng if (err) 29913fd0a558SYan, Zheng break; 29925d4f98a2SYan Zheng } 29933fd0a558SYan, Zheng 29943fd0a558SYan, Zheng if (!err && node->pending) { 29953fd0a558SYan, Zheng drop_node_buffer(node); 29963fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 29973fd0a558SYan, Zheng node->pending = 0; 29985d4f98a2SYan Zheng } 29993fd0a558SYan, Zheng 30005d4f98a2SYan Zheng path->lowest_level = 0; 30013fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 30025d4f98a2SYan Zheng return err; 30035d4f98a2SYan Zheng } 30045d4f98a2SYan Zheng 30055d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 30063fd0a558SYan, Zheng struct reloc_control *rc, 30075d4f98a2SYan Zheng struct backref_node *node, 30085d4f98a2SYan Zheng struct btrfs_path *path) 30095d4f98a2SYan Zheng { 30105d4f98a2SYan Zheng struct btrfs_key key; 30115d4f98a2SYan Zheng 30125d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 30133fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 30145d4f98a2SYan Zheng } 30155d4f98a2SYan Zheng 30165d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 30173fd0a558SYan, Zheng struct reloc_control *rc, 30183fd0a558SYan, Zheng struct btrfs_path *path, int err) 30195d4f98a2SYan Zheng { 30203fd0a558SYan, Zheng LIST_HEAD(list); 30213fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 30225d4f98a2SYan Zheng struct backref_node *node; 30235d4f98a2SYan Zheng int level; 30245d4f98a2SYan Zheng int ret; 30255d4f98a2SYan Zheng 30265d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 30275d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 30285d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 30293fd0a558SYan, Zheng struct backref_node, list); 30303fd0a558SYan, Zheng list_move_tail(&node->list, &list); 30313fd0a558SYan, Zheng BUG_ON(!node->pending); 30325d4f98a2SYan Zheng 30333fd0a558SYan, Zheng if (!err) { 30343fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 30355d4f98a2SYan Zheng if (ret < 0) 30365d4f98a2SYan Zheng err = ret; 30375d4f98a2SYan Zheng } 30385d4f98a2SYan Zheng } 30393fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 30403fd0a558SYan, Zheng } 30415d4f98a2SYan Zheng return err; 30425d4f98a2SYan Zheng } 30435d4f98a2SYan Zheng 30445d4f98a2SYan Zheng static void mark_block_processed(struct reloc_control *rc, 30453fd0a558SYan, Zheng u64 bytenr, u32 blocksize) 30463fd0a558SYan, Zheng { 30473fd0a558SYan, Zheng set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, 3048ceeb0ae7SDavid Sterba EXTENT_DIRTY); 30493fd0a558SYan, Zheng } 30503fd0a558SYan, Zheng 30513fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 30525d4f98a2SYan Zheng struct backref_node *node) 30535d4f98a2SYan Zheng { 30545d4f98a2SYan Zheng u32 blocksize; 30555d4f98a2SYan Zheng if (node->level == 0 || 30565d4f98a2SYan Zheng in_block_group(node->bytenr, rc->block_group)) { 3057da17066cSJeff Mahoney blocksize = rc->extent_root->fs_info->nodesize; 30583fd0a558SYan, Zheng mark_block_processed(rc, node->bytenr, blocksize); 30595d4f98a2SYan Zheng } 30605d4f98a2SYan Zheng node->processed = 1; 30615d4f98a2SYan Zheng } 30625d4f98a2SYan Zheng 30635d4f98a2SYan Zheng /* 30645d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 30655d4f98a2SYan Zheng * as processed. 30665d4f98a2SYan Zheng */ 30675d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 30685d4f98a2SYan Zheng struct backref_node *node) 30695d4f98a2SYan Zheng { 30705d4f98a2SYan Zheng struct backref_node *next = node; 30715d4f98a2SYan Zheng struct backref_edge *edge; 30725d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 30735d4f98a2SYan Zheng int index = 0; 30745d4f98a2SYan Zheng 30755d4f98a2SYan Zheng while (next) { 30765d4f98a2SYan Zheng cond_resched(); 30775d4f98a2SYan Zheng while (1) { 30785d4f98a2SYan Zheng if (next->processed) 30795d4f98a2SYan Zheng break; 30805d4f98a2SYan Zheng 30813fd0a558SYan, Zheng __mark_block_processed(rc, next); 30825d4f98a2SYan Zheng 30835d4f98a2SYan Zheng if (list_empty(&next->upper)) 30845d4f98a2SYan Zheng break; 30855d4f98a2SYan Zheng 30865d4f98a2SYan Zheng edge = list_entry(next->upper.next, 30875d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 30885d4f98a2SYan Zheng edges[index++] = edge; 30895d4f98a2SYan Zheng next = edge->node[UPPER]; 30905d4f98a2SYan Zheng } 30915d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 30925d4f98a2SYan Zheng } 30935d4f98a2SYan Zheng } 30945d4f98a2SYan Zheng 30957476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 30965d4f98a2SYan Zheng { 3097da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 30987476dfdaSDavid Sterba 30995d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 31009655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 31015d4f98a2SYan Zheng return 1; 31025d4f98a2SYan Zheng return 0; 31035d4f98a2SYan Zheng } 31045d4f98a2SYan Zheng 31052ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 31065d4f98a2SYan Zheng struct tree_block *block) 31075d4f98a2SYan Zheng { 31085d4f98a2SYan Zheng struct extent_buffer *eb; 31095d4f98a2SYan Zheng 31105d4f98a2SYan Zheng BUG_ON(block->key_ready); 3111581c1760SQu Wenruo eb = read_tree_block(fs_info, block->bytenr, block->key.offset, 3112581c1760SQu Wenruo block->level, NULL); 311364c043deSLiu Bo if (IS_ERR(eb)) { 311464c043deSLiu Bo return PTR_ERR(eb); 311564c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 3116416bc658SJosef Bacik free_extent_buffer(eb); 3117416bc658SJosef Bacik return -EIO; 3118416bc658SJosef Bacik } 31195d4f98a2SYan Zheng if (block->level == 0) 31205d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 31215d4f98a2SYan Zheng else 31225d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 31235d4f98a2SYan Zheng free_extent_buffer(eb); 31245d4f98a2SYan Zheng block->key_ready = 1; 31255d4f98a2SYan Zheng return 0; 31265d4f98a2SYan Zheng } 31275d4f98a2SYan Zheng 31285d4f98a2SYan Zheng /* 31295d4f98a2SYan Zheng * helper function to relocate a tree block 31305d4f98a2SYan Zheng */ 31315d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 31325d4f98a2SYan Zheng struct reloc_control *rc, 31335d4f98a2SYan Zheng struct backref_node *node, 31345d4f98a2SYan Zheng struct btrfs_key *key, 31355d4f98a2SYan Zheng struct btrfs_path *path) 31365d4f98a2SYan Zheng { 31375d4f98a2SYan Zheng struct btrfs_root *root; 31383fd0a558SYan, Zheng int ret = 0; 31395d4f98a2SYan Zheng 31403fd0a558SYan, Zheng if (!node) 31415d4f98a2SYan Zheng return 0; 31423fd0a558SYan, Zheng 31433fd0a558SYan, Zheng BUG_ON(node->processed); 3144147d256eSZhaolei root = select_one_root(node); 31453fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 31463fd0a558SYan, Zheng update_processed_blocks(rc, node); 31473fd0a558SYan, Zheng goto out; 31485d4f98a2SYan Zheng } 31495d4f98a2SYan Zheng 315027cdeb70SMiao Xie if (!root || test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 31513fd0a558SYan, Zheng ret = reserve_metadata_space(trans, rc, node); 31523fd0a558SYan, Zheng if (ret) 31535d4f98a2SYan Zheng goto out; 31545d4f98a2SYan Zheng } 31553fd0a558SYan, Zheng 31563fd0a558SYan, Zheng if (root) { 315727cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 31583fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 31593fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 31603fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 31613fd0a558SYan, Zheng root = root->reloc_root; 31623fd0a558SYan, Zheng node->new_bytenr = root->node->start; 316300246528SJosef Bacik btrfs_put_root(node->root); 316400246528SJosef Bacik node->root = btrfs_grab_root(root); 31650b530bc5SJosef Bacik ASSERT(node->root); 31663fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 31673fd0a558SYan, Zheng } else { 31685d4f98a2SYan Zheng path->lowest_level = node->level; 31695d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 3170b3b4aa74SDavid Sterba btrfs_release_path(path); 31713fd0a558SYan, Zheng if (ret > 0) 31725d4f98a2SYan Zheng ret = 0; 31733fd0a558SYan, Zheng } 31743fd0a558SYan, Zheng if (!ret) 31753fd0a558SYan, Zheng update_processed_blocks(rc, node); 31763fd0a558SYan, Zheng } else { 31773fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 31783fd0a558SYan, Zheng } 31795d4f98a2SYan Zheng out: 31800647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 31813fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 31825d4f98a2SYan Zheng return ret; 31835d4f98a2SYan Zheng } 31845d4f98a2SYan Zheng 31855d4f98a2SYan Zheng /* 31865d4f98a2SYan Zheng * relocate a list of blocks 31875d4f98a2SYan Zheng */ 31885d4f98a2SYan Zheng static noinline_for_stack 31895d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 31905d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 31915d4f98a2SYan Zheng { 31922ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 31935d4f98a2SYan Zheng struct backref_node *node; 31945d4f98a2SYan Zheng struct btrfs_path *path; 31955d4f98a2SYan Zheng struct tree_block *block; 319698ff7b94SQu Wenruo struct tree_block *next; 31975d4f98a2SYan Zheng int ret; 31985d4f98a2SYan Zheng int err = 0; 31995d4f98a2SYan Zheng 32005d4f98a2SYan Zheng path = btrfs_alloc_path(); 3201e1a12670SLiu Bo if (!path) { 3202e1a12670SLiu Bo err = -ENOMEM; 320334c2b290SDavid Sterba goto out_free_blocks; 3204e1a12670SLiu Bo } 32055d4f98a2SYan Zheng 320698ff7b94SQu Wenruo /* Kick in readahead for tree blocks with missing keys */ 320798ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 32085d4f98a2SYan Zheng if (!block->key_ready) 32092ff7e61eSJeff Mahoney readahead_tree_block(fs_info, block->bytenr); 32105d4f98a2SYan Zheng } 32115d4f98a2SYan Zheng 321298ff7b94SQu Wenruo /* Get first keys */ 321398ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 321434c2b290SDavid Sterba if (!block->key_ready) { 32152ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 321634c2b290SDavid Sterba if (err) 321734c2b290SDavid Sterba goto out_free_path; 321834c2b290SDavid Sterba } 32195d4f98a2SYan Zheng } 32205d4f98a2SYan Zheng 322198ff7b94SQu Wenruo /* Do tree relocation */ 322298ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 32233fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 32245d4f98a2SYan Zheng block->level, block->bytenr); 32255d4f98a2SYan Zheng if (IS_ERR(node)) { 32265d4f98a2SYan Zheng err = PTR_ERR(node); 32275d4f98a2SYan Zheng goto out; 32285d4f98a2SYan Zheng } 32295d4f98a2SYan Zheng 32305d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 32315d4f98a2SYan Zheng path); 32325d4f98a2SYan Zheng if (ret < 0) { 323398ff7b94SQu Wenruo if (ret != -EAGAIN || &block->rb_node == rb_first(blocks)) 32345d4f98a2SYan Zheng err = ret; 32355d4f98a2SYan Zheng goto out; 32365d4f98a2SYan Zheng } 32375d4f98a2SYan Zheng } 32385d4f98a2SYan Zheng out: 32393fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 32405d4f98a2SYan Zheng 324134c2b290SDavid Sterba out_free_path: 32425d4f98a2SYan Zheng btrfs_free_path(path); 324334c2b290SDavid Sterba out_free_blocks: 3244e1a12670SLiu Bo free_block_list(blocks); 32455d4f98a2SYan Zheng return err; 32465d4f98a2SYan Zheng } 32475d4f98a2SYan Zheng 32485d4f98a2SYan Zheng static noinline_for_stack 3249efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3250efa56464SYan, Zheng struct file_extent_cluster *cluster) 3251efa56464SYan, Zheng { 3252efa56464SYan, Zheng u64 alloc_hint = 0; 3253efa56464SYan, Zheng u64 start; 3254efa56464SYan, Zheng u64 end; 3255efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3256efa56464SYan, Zheng u64 num_bytes; 3257efa56464SYan, Zheng int nr = 0; 3258efa56464SYan, Zheng int ret = 0; 3259dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 3260dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 326118513091SWang Xiaoguang u64 cur_offset; 3262364ecf36SQu Wenruo struct extent_changeset *data_reserved = NULL; 3263efa56464SYan, Zheng 3264efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 32655955102cSAl Viro inode_lock(inode); 3266efa56464SYan, Zheng 3267364ecf36SQu Wenruo ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start, 3268dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 3269efa56464SYan, Zheng if (ret) 3270efa56464SYan, Zheng goto out; 3271efa56464SYan, Zheng 327218513091SWang Xiaoguang cur_offset = prealloc_start; 3273efa56464SYan, Zheng while (nr < cluster->nr) { 3274efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3275efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3276efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3277efa56464SYan, Zheng else 3278efa56464SYan, Zheng end = cluster->end - offset; 3279efa56464SYan, Zheng 3280d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3281efa56464SYan, Zheng num_bytes = end + 1 - start; 328218513091SWang Xiaoguang if (cur_offset < start) 3283bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3284bc42bda2SQu Wenruo cur_offset, start - cur_offset); 3285efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3286efa56464SYan, Zheng num_bytes, num_bytes, 3287efa56464SYan, Zheng end + 1, &alloc_hint); 328818513091SWang Xiaoguang cur_offset = end + 1; 3289d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3290efa56464SYan, Zheng if (ret) 3291efa56464SYan, Zheng break; 3292efa56464SYan, Zheng nr++; 3293efa56464SYan, Zheng } 329418513091SWang Xiaoguang if (cur_offset < prealloc_end) 3295bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3296bc42bda2SQu Wenruo cur_offset, prealloc_end + 1 - cur_offset); 3297efa56464SYan, Zheng out: 32985955102cSAl Viro inode_unlock(inode); 3299364ecf36SQu Wenruo extent_changeset_free(data_reserved); 3300efa56464SYan, Zheng return ret; 3301efa56464SYan, Zheng } 3302efa56464SYan, Zheng 3303efa56464SYan, Zheng static noinline_for_stack 33040257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 33050257bb82SYan, Zheng u64 block_start) 33065d4f98a2SYan Zheng { 33075d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 33085d4f98a2SYan Zheng struct extent_map *em; 33090257bb82SYan, Zheng int ret = 0; 33105d4f98a2SYan Zheng 3311172ddd60SDavid Sterba em = alloc_extent_map(); 33120257bb82SYan, Zheng if (!em) 33130257bb82SYan, Zheng return -ENOMEM; 33140257bb82SYan, Zheng 33155d4f98a2SYan Zheng em->start = start; 33160257bb82SYan, Zheng em->len = end + 1 - start; 33170257bb82SYan, Zheng em->block_len = em->len; 33180257bb82SYan, Zheng em->block_start = block_start; 33195d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 33205d4f98a2SYan Zheng 3321d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 33225d4f98a2SYan Zheng while (1) { 3323890871beSChris Mason write_lock(&em_tree->lock); 332409a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3325890871beSChris Mason write_unlock(&em_tree->lock); 33265d4f98a2SYan Zheng if (ret != -EEXIST) { 33275d4f98a2SYan Zheng free_extent_map(em); 33285d4f98a2SYan Zheng break; 33295d4f98a2SYan Zheng } 3330dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 33315d4f98a2SYan Zheng } 3332d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 33330257bb82SYan, Zheng return ret; 33340257bb82SYan, Zheng } 33355d4f98a2SYan Zheng 33360257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 33370257bb82SYan, Zheng struct file_extent_cluster *cluster) 33380257bb82SYan, Zheng { 33392ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 33400257bb82SYan, Zheng u64 page_start; 33410257bb82SYan, Zheng u64 page_end; 33420257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 33430257bb82SYan, Zheng unsigned long index; 33440257bb82SYan, Zheng unsigned long last_index; 33450257bb82SYan, Zheng struct page *page; 33460257bb82SYan, Zheng struct file_ra_state *ra; 33473b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 33480257bb82SYan, Zheng int nr = 0; 33490257bb82SYan, Zheng int ret = 0; 33500257bb82SYan, Zheng 33510257bb82SYan, Zheng if (!cluster->nr) 33520257bb82SYan, Zheng return 0; 33530257bb82SYan, Zheng 33540257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 33550257bb82SYan, Zheng if (!ra) 33560257bb82SYan, Zheng return -ENOMEM; 33570257bb82SYan, Zheng 3358efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 33590257bb82SYan, Zheng if (ret) 3360efa56464SYan, Zheng goto out; 33610257bb82SYan, Zheng 33620257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 33630257bb82SYan, Zheng 3364efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3365efa56464SYan, Zheng cluster->end - offset, cluster->start); 3366efa56464SYan, Zheng if (ret) 3367efa56464SYan, Zheng goto out; 3368efa56464SYan, Zheng 336909cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 337009cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 33710257bb82SYan, Zheng while (index <= last_index) { 33729f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 33739f3db423SNikolay Borisov PAGE_SIZE); 3374efa56464SYan, Zheng if (ret) 3375efa56464SYan, Zheng goto out; 3376efa56464SYan, Zheng 33770257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 33780257bb82SYan, Zheng if (!page) { 33790257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 33800257bb82SYan, Zheng ra, NULL, index, 33810257bb82SYan, Zheng last_index + 1 - index); 3382a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 33833b16a4e3SJosef Bacik mask); 33840257bb82SYan, Zheng if (!page) { 3385691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 338643b18595SQu Wenruo PAGE_SIZE, true); 338744db1216SFilipe Manana btrfs_delalloc_release_extents(BTRFS_I(inode), 33888702ba93SQu Wenruo PAGE_SIZE); 33890257bb82SYan, Zheng ret = -ENOMEM; 3390efa56464SYan, Zheng goto out; 33910257bb82SYan, Zheng } 33920257bb82SYan, Zheng } 33930257bb82SYan, Zheng 33940257bb82SYan, Zheng if (PageReadahead(page)) { 33950257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 33960257bb82SYan, Zheng ra, NULL, page, index, 33970257bb82SYan, Zheng last_index + 1 - index); 33980257bb82SYan, Zheng } 33990257bb82SYan, Zheng 34000257bb82SYan, Zheng if (!PageUptodate(page)) { 34010257bb82SYan, Zheng btrfs_readpage(NULL, page); 34020257bb82SYan, Zheng lock_page(page); 34030257bb82SYan, Zheng if (!PageUptodate(page)) { 34040257bb82SYan, Zheng unlock_page(page); 340509cbfeafSKirill A. Shutemov put_page(page); 3406691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 340743b18595SQu Wenruo PAGE_SIZE, true); 34088b62f87bSJosef Bacik btrfs_delalloc_release_extents(BTRFS_I(inode), 34098702ba93SQu Wenruo PAGE_SIZE); 34100257bb82SYan, Zheng ret = -EIO; 3411efa56464SYan, Zheng goto out; 34120257bb82SYan, Zheng } 34130257bb82SYan, Zheng } 34140257bb82SYan, Zheng 34154eee4fa4SMiao Xie page_start = page_offset(page); 341609cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 34170257bb82SYan, Zheng 3418d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 34190257bb82SYan, Zheng 34200257bb82SYan, Zheng set_page_extent_mapped(page); 34210257bb82SYan, Zheng 34220257bb82SYan, Zheng if (nr < cluster->nr && 34230257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 34240257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 34250257bb82SYan, Zheng page_start, page_end, 3426ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 34270257bb82SYan, Zheng nr++; 34280257bb82SYan, Zheng } 34290257bb82SYan, Zheng 3430765f3cebSNikolay Borisov ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0, 3431330a5827SNikolay Borisov NULL); 3432765f3cebSNikolay Borisov if (ret) { 3433765f3cebSNikolay Borisov unlock_page(page); 3434765f3cebSNikolay Borisov put_page(page); 3435765f3cebSNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 343643b18595SQu Wenruo PAGE_SIZE, true); 3437765f3cebSNikolay Borisov btrfs_delalloc_release_extents(BTRFS_I(inode), 34388702ba93SQu Wenruo PAGE_SIZE); 3439765f3cebSNikolay Borisov 3440765f3cebSNikolay Borisov clear_extent_bits(&BTRFS_I(inode)->io_tree, 3441765f3cebSNikolay Borisov page_start, page_end, 3442765f3cebSNikolay Borisov EXTENT_LOCKED | EXTENT_BOUNDARY); 3443765f3cebSNikolay Borisov goto out; 3444765f3cebSNikolay Borisov 3445765f3cebSNikolay Borisov } 34460257bb82SYan, Zheng set_page_dirty(page); 34470257bb82SYan, Zheng 34480257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3449d0082371SJeff Mahoney page_start, page_end); 34500257bb82SYan, Zheng unlock_page(page); 345109cbfeafSKirill A. Shutemov put_page(page); 34520257bb82SYan, Zheng 34530257bb82SYan, Zheng index++; 34548702ba93SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE); 3455efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 34562ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 34570257bb82SYan, Zheng } 34580257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3459efa56464SYan, Zheng out: 34600257bb82SYan, Zheng kfree(ra); 34610257bb82SYan, Zheng return ret; 34620257bb82SYan, Zheng } 34630257bb82SYan, Zheng 34640257bb82SYan, Zheng static noinline_for_stack 34650257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 34660257bb82SYan, Zheng struct file_extent_cluster *cluster) 34670257bb82SYan, Zheng { 34680257bb82SYan, Zheng int ret; 34690257bb82SYan, Zheng 34700257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 34710257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 34720257bb82SYan, Zheng if (ret) 34730257bb82SYan, Zheng return ret; 34740257bb82SYan, Zheng cluster->nr = 0; 34750257bb82SYan, Zheng } 34760257bb82SYan, Zheng 34770257bb82SYan, Zheng if (!cluster->nr) 34780257bb82SYan, Zheng cluster->start = extent_key->objectid; 34790257bb82SYan, Zheng else 34800257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 34810257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 34820257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 34830257bb82SYan, Zheng cluster->nr++; 34840257bb82SYan, Zheng 34850257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 34860257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 34870257bb82SYan, Zheng if (ret) 34880257bb82SYan, Zheng return ret; 34890257bb82SYan, Zheng cluster->nr = 0; 34900257bb82SYan, Zheng } 34910257bb82SYan, Zheng return 0; 34925d4f98a2SYan Zheng } 34935d4f98a2SYan Zheng 34945d4f98a2SYan Zheng /* 34955d4f98a2SYan Zheng * helper to add a tree block to the list. 34965d4f98a2SYan Zheng * the major work is getting the generation and level of the block 34975d4f98a2SYan Zheng */ 34985d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 34995d4f98a2SYan Zheng struct btrfs_key *extent_key, 35005d4f98a2SYan Zheng struct btrfs_path *path, 35015d4f98a2SYan Zheng struct rb_root *blocks) 35025d4f98a2SYan Zheng { 35035d4f98a2SYan Zheng struct extent_buffer *eb; 35045d4f98a2SYan Zheng struct btrfs_extent_item *ei; 35055d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 35065d4f98a2SYan Zheng struct tree_block *block; 35075d4f98a2SYan Zheng struct rb_node *rb_node; 35085d4f98a2SYan Zheng u32 item_size; 35095d4f98a2SYan Zheng int level = -1; 35107fdf4b60SWang Shilong u64 generation; 35115d4f98a2SYan Zheng 35125d4f98a2SYan Zheng eb = path->nodes[0]; 35135d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 35145d4f98a2SYan Zheng 35153173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 35163173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 35175d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 35185d4f98a2SYan Zheng struct btrfs_extent_item); 35193173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 35205d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 35215d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 35225d4f98a2SYan Zheng } else { 35233173a18fSJosef Bacik level = (int)extent_key->offset; 35243173a18fSJosef Bacik } 35253173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 35266d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3527ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3528ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3529ba3c2b19SNikolay Borisov return -EINVAL; 35303173a18fSJosef Bacik } else { 35315d4f98a2SYan Zheng BUG(); 35325d4f98a2SYan Zheng } 35335d4f98a2SYan Zheng 3534b3b4aa74SDavid Sterba btrfs_release_path(path); 35355d4f98a2SYan Zheng 35365d4f98a2SYan Zheng BUG_ON(level == -1); 35375d4f98a2SYan Zheng 35385d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 35395d4f98a2SYan Zheng if (!block) 35405d4f98a2SYan Zheng return -ENOMEM; 35415d4f98a2SYan Zheng 35425d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3543da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 35445d4f98a2SYan Zheng block->key.offset = generation; 35455d4f98a2SYan Zheng block->level = level; 35465d4f98a2SYan Zheng block->key_ready = 0; 35475d4f98a2SYan Zheng 35485d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 354943c04fb1SJeff Mahoney if (rb_node) 355043c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 35515d4f98a2SYan Zheng 35525d4f98a2SYan Zheng return 0; 35535d4f98a2SYan Zheng } 35545d4f98a2SYan Zheng 35555d4f98a2SYan Zheng /* 35565d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 35575d4f98a2SYan Zheng */ 35585d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 35595d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 35605d4f98a2SYan Zheng struct rb_root *blocks) 35615d4f98a2SYan Zheng { 35620b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 35635d4f98a2SYan Zheng struct btrfs_path *path; 35645d4f98a2SYan Zheng struct btrfs_key key; 35655d4f98a2SYan Zheng int ret; 35660b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 35675d4f98a2SYan Zheng 35687476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 35695d4f98a2SYan Zheng return 0; 35705d4f98a2SYan Zheng 35715d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 35725d4f98a2SYan Zheng return 0; 35735d4f98a2SYan Zheng 35745d4f98a2SYan Zheng path = btrfs_alloc_path(); 35755d4f98a2SYan Zheng if (!path) 35765d4f98a2SYan Zheng return -ENOMEM; 3577aee68ee5SJosef Bacik again: 35785d4f98a2SYan Zheng key.objectid = bytenr; 3579aee68ee5SJosef Bacik if (skinny) { 3580aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3581aee68ee5SJosef Bacik key.offset = (u64)-1; 3582aee68ee5SJosef Bacik } else { 35835d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 35845d4f98a2SYan Zheng key.offset = blocksize; 3585aee68ee5SJosef Bacik } 35865d4f98a2SYan Zheng 35875d4f98a2SYan Zheng path->search_commit_root = 1; 35885d4f98a2SYan Zheng path->skip_locking = 1; 35895d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 35905d4f98a2SYan Zheng if (ret < 0) 35915d4f98a2SYan Zheng goto out; 35925d4f98a2SYan Zheng 3593aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3594aee68ee5SJosef Bacik if (path->slots[0]) { 3595aee68ee5SJosef Bacik path->slots[0]--; 3596aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3597aee68ee5SJosef Bacik path->slots[0]); 35983173a18fSJosef Bacik if (key.objectid == bytenr && 3599aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3600aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3601aee68ee5SJosef Bacik key.offset == blocksize))) 36023173a18fSJosef Bacik ret = 0; 36033173a18fSJosef Bacik } 3604aee68ee5SJosef Bacik 3605aee68ee5SJosef Bacik if (ret) { 3606aee68ee5SJosef Bacik skinny = false; 3607aee68ee5SJosef Bacik btrfs_release_path(path); 3608aee68ee5SJosef Bacik goto again; 3609aee68ee5SJosef Bacik } 3610aee68ee5SJosef Bacik } 3611cdccee99SLiu Bo if (ret) { 3612cdccee99SLiu Bo ASSERT(ret == 1); 3613cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3614cdccee99SLiu Bo btrfs_err(fs_info, 3615cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3616cdccee99SLiu Bo bytenr); 3617cdccee99SLiu Bo WARN_ON(1); 3618cdccee99SLiu Bo ret = -EINVAL; 3619cdccee99SLiu Bo goto out; 3620cdccee99SLiu Bo } 36213173a18fSJosef Bacik 36225d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 36235d4f98a2SYan Zheng out: 36245d4f98a2SYan Zheng btrfs_free_path(path); 36255d4f98a2SYan Zheng return ret; 36265d4f98a2SYan Zheng } 36275d4f98a2SYan Zheng 36285d4f98a2SYan Zheng /* 36295d4f98a2SYan Zheng * helper to check if the block use full backrefs for pointers in it 36305d4f98a2SYan Zheng */ 36315d4f98a2SYan Zheng static int block_use_full_backref(struct reloc_control *rc, 36325d4f98a2SYan Zheng struct extent_buffer *eb) 36335d4f98a2SYan Zheng { 36345d4f98a2SYan Zheng u64 flags; 36355d4f98a2SYan Zheng int ret; 36365d4f98a2SYan Zheng 36375d4f98a2SYan Zheng if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) || 36385d4f98a2SYan Zheng btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV) 36395d4f98a2SYan Zheng return 1; 36405d4f98a2SYan Zheng 36412ff7e61eSJeff Mahoney ret = btrfs_lookup_extent_info(NULL, rc->extent_root->fs_info, 36423173a18fSJosef Bacik eb->start, btrfs_header_level(eb), 1, 36433173a18fSJosef Bacik NULL, &flags); 36445d4f98a2SYan Zheng BUG_ON(ret); 36455d4f98a2SYan Zheng 36465d4f98a2SYan Zheng if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) 36475d4f98a2SYan Zheng ret = 1; 36485d4f98a2SYan Zheng else 36495d4f98a2SYan Zheng ret = 0; 36505d4f98a2SYan Zheng return ret; 36515d4f98a2SYan Zheng } 36525d4f98a2SYan Zheng 36530af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 365432da5386SDavid Sterba struct btrfs_block_group *block_group, 36551bbc621eSChris Mason struct inode *inode, 36561bbc621eSChris Mason u64 ino) 36570af3d00bSJosef Bacik { 36580af3d00bSJosef Bacik struct btrfs_key key; 36590af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 36600af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 36610af3d00bSJosef Bacik int ret = 0; 36620af3d00bSJosef Bacik 36630af3d00bSJosef Bacik if (inode) 36640af3d00bSJosef Bacik goto truncate; 36650af3d00bSJosef Bacik 36660af3d00bSJosef Bacik key.objectid = ino; 36670af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 36680af3d00bSJosef Bacik key.offset = 0; 36690af3d00bSJosef Bacik 36704c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 36712e19f1f9SAl Viro if (IS_ERR(inode)) 36720af3d00bSJosef Bacik return -ENOENT; 36730af3d00bSJosef Bacik 36740af3d00bSJosef Bacik truncate: 36752ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 36767b61cd92SMiao Xie &fs_info->global_block_rsv); 36777b61cd92SMiao Xie if (ret) 36787b61cd92SMiao Xie goto out; 36797b61cd92SMiao Xie 36807a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 36810af3d00bSJosef Bacik if (IS_ERR(trans)) { 36823612b495STsutomu Itoh ret = PTR_ERR(trans); 36830af3d00bSJosef Bacik goto out; 36840af3d00bSJosef Bacik } 36850af3d00bSJosef Bacik 368677ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 36870af3d00bSJosef Bacik 36883a45bb20SJeff Mahoney btrfs_end_transaction(trans); 36892ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 36900af3d00bSJosef Bacik out: 36910af3d00bSJosef Bacik iput(inode); 36920af3d00bSJosef Bacik return ret; 36930af3d00bSJosef Bacik } 36940af3d00bSJosef Bacik 36955d4f98a2SYan Zheng /* 36965d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY 36975d4f98a2SYan Zheng * this function scans fs tree to find blocks reference the data extent 36985d4f98a2SYan Zheng */ 36995d4f98a2SYan Zheng static int find_data_references(struct reloc_control *rc, 37005d4f98a2SYan Zheng struct btrfs_key *extent_key, 37015d4f98a2SYan Zheng struct extent_buffer *leaf, 37025d4f98a2SYan Zheng struct btrfs_extent_data_ref *ref, 37035d4f98a2SYan Zheng struct rb_root *blocks) 37045d4f98a2SYan Zheng { 37050b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 37065d4f98a2SYan Zheng struct btrfs_path *path; 37075d4f98a2SYan Zheng struct tree_block *block; 37085d4f98a2SYan Zheng struct btrfs_root *root; 37095d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 37105d4f98a2SYan Zheng struct rb_node *rb_node; 37115d4f98a2SYan Zheng struct btrfs_key key; 37125d4f98a2SYan Zheng u64 ref_root; 37135d4f98a2SYan Zheng u64 ref_objectid; 37145d4f98a2SYan Zheng u64 ref_offset; 37155d4f98a2SYan Zheng u32 ref_count; 37165d4f98a2SYan Zheng u32 nritems; 37175d4f98a2SYan Zheng int err = 0; 37185d4f98a2SYan Zheng int added = 0; 37195d4f98a2SYan Zheng int counted; 37205d4f98a2SYan Zheng int ret; 37215d4f98a2SYan Zheng 37225d4f98a2SYan Zheng ref_root = btrfs_extent_data_ref_root(leaf, ref); 37235d4f98a2SYan Zheng ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref); 37245d4f98a2SYan Zheng ref_offset = btrfs_extent_data_ref_offset(leaf, ref); 37255d4f98a2SYan Zheng ref_count = btrfs_extent_data_ref_count(leaf, ref); 37265d4f98a2SYan Zheng 37270af3d00bSJosef Bacik /* 37280af3d00bSJosef Bacik * This is an extent belonging to the free space cache, lets just delete 37290af3d00bSJosef Bacik * it and redo the search. 37300af3d00bSJosef Bacik */ 37310af3d00bSJosef Bacik if (ref_root == BTRFS_ROOT_TREE_OBJECTID) { 37320b246afaSJeff Mahoney ret = delete_block_group_cache(fs_info, rc->block_group, 37330af3d00bSJosef Bacik NULL, ref_objectid); 37340af3d00bSJosef Bacik if (ret != -ENOENT) 37350af3d00bSJosef Bacik return ret; 37360af3d00bSJosef Bacik ret = 0; 37370af3d00bSJosef Bacik } 37380af3d00bSJosef Bacik 37390af3d00bSJosef Bacik path = btrfs_alloc_path(); 37400af3d00bSJosef Bacik if (!path) 37410af3d00bSJosef Bacik return -ENOMEM; 3742e4058b54SDavid Sterba path->reada = READA_FORWARD; 37430af3d00bSJosef Bacik 37440b246afaSJeff Mahoney root = read_fs_root(fs_info, ref_root); 37455d4f98a2SYan Zheng if (IS_ERR(root)) { 37465d4f98a2SYan Zheng err = PTR_ERR(root); 37473d7babdcSJosef Bacik goto out_free; 37483d7babdcSJosef Bacik } 37495d4f98a2SYan Zheng 37505d4f98a2SYan Zheng key.objectid = ref_objectid; 37515d4f98a2SYan Zheng key.type = BTRFS_EXTENT_DATA_KEY; 375284850e8dSYan, Zheng if (ref_offset > ((u64)-1 << 32)) 375384850e8dSYan, Zheng key.offset = 0; 375484850e8dSYan, Zheng else 375584850e8dSYan, Zheng key.offset = ref_offset; 37565d4f98a2SYan Zheng 37575d4f98a2SYan Zheng path->search_commit_root = 1; 37585d4f98a2SYan Zheng path->skip_locking = 1; 37595d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 37605d4f98a2SYan Zheng if (ret < 0) { 37615d4f98a2SYan Zheng err = ret; 37625d4f98a2SYan Zheng goto out; 37635d4f98a2SYan Zheng } 37645d4f98a2SYan Zheng 37655d4f98a2SYan Zheng leaf = path->nodes[0]; 37665d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 37675d4f98a2SYan Zheng /* 37685d4f98a2SYan Zheng * the references in tree blocks that use full backrefs 37695d4f98a2SYan Zheng * are not counted in 37705d4f98a2SYan Zheng */ 37715d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 37725d4f98a2SYan Zheng counted = 0; 37735d4f98a2SYan Zheng else 37745d4f98a2SYan Zheng counted = 1; 37755d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 37765d4f98a2SYan Zheng if (rb_node) { 37775d4f98a2SYan Zheng if (counted) 37785d4f98a2SYan Zheng added = 1; 37795d4f98a2SYan Zheng else 37805d4f98a2SYan Zheng path->slots[0] = nritems; 37815d4f98a2SYan Zheng } 37825d4f98a2SYan Zheng 37835d4f98a2SYan Zheng while (ref_count > 0) { 37845d4f98a2SYan Zheng while (path->slots[0] >= nritems) { 37855d4f98a2SYan Zheng ret = btrfs_next_leaf(root, path); 37865d4f98a2SYan Zheng if (ret < 0) { 37875d4f98a2SYan Zheng err = ret; 37885d4f98a2SYan Zheng goto out; 37895d4f98a2SYan Zheng } 3790fae7f21cSDulshani Gunawardhana if (WARN_ON(ret > 0)) 37915d4f98a2SYan Zheng goto out; 37925d4f98a2SYan Zheng 37935d4f98a2SYan Zheng leaf = path->nodes[0]; 37945d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 37955d4f98a2SYan Zheng added = 0; 37965d4f98a2SYan Zheng 37975d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 37985d4f98a2SYan Zheng counted = 0; 37995d4f98a2SYan Zheng else 38005d4f98a2SYan Zheng counted = 1; 38015d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 38025d4f98a2SYan Zheng if (rb_node) { 38035d4f98a2SYan Zheng if (counted) 38045d4f98a2SYan Zheng added = 1; 38055d4f98a2SYan Zheng else 38065d4f98a2SYan Zheng path->slots[0] = nritems; 38075d4f98a2SYan Zheng } 38085d4f98a2SYan Zheng } 38095d4f98a2SYan Zheng 38105d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 3811fae7f21cSDulshani Gunawardhana if (WARN_ON(key.objectid != ref_objectid || 3812fae7f21cSDulshani Gunawardhana key.type != BTRFS_EXTENT_DATA_KEY)) 38135d4f98a2SYan Zheng break; 38145d4f98a2SYan Zheng 38155d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 38165d4f98a2SYan Zheng struct btrfs_file_extent_item); 38175d4f98a2SYan Zheng 38185d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 38195d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 38205d4f98a2SYan Zheng goto next; 38215d4f98a2SYan Zheng 38225d4f98a2SYan Zheng if (btrfs_file_extent_disk_bytenr(leaf, fi) != 38235d4f98a2SYan Zheng extent_key->objectid) 38245d4f98a2SYan Zheng goto next; 38255d4f98a2SYan Zheng 38265d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 38275d4f98a2SYan Zheng if (key.offset != ref_offset) 38285d4f98a2SYan Zheng goto next; 38295d4f98a2SYan Zheng 38305d4f98a2SYan Zheng if (counted) 38315d4f98a2SYan Zheng ref_count--; 38325d4f98a2SYan Zheng if (added) 38335d4f98a2SYan Zheng goto next; 38345d4f98a2SYan Zheng 38357476dfdaSDavid Sterba if (!tree_block_processed(leaf->start, rc)) { 38365d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 38375d4f98a2SYan Zheng if (!block) { 38385d4f98a2SYan Zheng err = -ENOMEM; 38395d4f98a2SYan Zheng break; 38405d4f98a2SYan Zheng } 38415d4f98a2SYan Zheng block->bytenr = leaf->start; 38425d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &block->key, 0); 38435d4f98a2SYan Zheng block->level = 0; 38445d4f98a2SYan Zheng block->key_ready = 1; 38455d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, 38465d4f98a2SYan Zheng &block->rb_node); 384743c04fb1SJeff Mahoney if (rb_node) 384843c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 384943c04fb1SJeff Mahoney block->bytenr); 38505d4f98a2SYan Zheng } 38515d4f98a2SYan Zheng if (counted) 38525d4f98a2SYan Zheng added = 1; 38535d4f98a2SYan Zheng else 38545d4f98a2SYan Zheng path->slots[0] = nritems; 38555d4f98a2SYan Zheng next: 38565d4f98a2SYan Zheng path->slots[0]++; 38575d4f98a2SYan Zheng 38585d4f98a2SYan Zheng } 38595d4f98a2SYan Zheng out: 386000246528SJosef Bacik btrfs_put_root(root); 38613d7babdcSJosef Bacik out_free: 38625d4f98a2SYan Zheng btrfs_free_path(path); 38635d4f98a2SYan Zheng return err; 38645d4f98a2SYan Zheng } 38655d4f98a2SYan Zheng 38665d4f98a2SYan Zheng /* 38672c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 38685d4f98a2SYan Zheng */ 38695d4f98a2SYan Zheng static noinline_for_stack 38705d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 38715d4f98a2SYan Zheng struct btrfs_key *extent_key, 38725d4f98a2SYan Zheng struct btrfs_path *path, 38735d4f98a2SYan Zheng struct rb_root *blocks) 38745d4f98a2SYan Zheng { 38755d4f98a2SYan Zheng struct btrfs_key key; 38765d4f98a2SYan Zheng struct extent_buffer *eb; 38775d4f98a2SYan Zheng struct btrfs_extent_data_ref *dref; 38785d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 38795d4f98a2SYan Zheng unsigned long ptr; 38805d4f98a2SYan Zheng unsigned long end; 3881da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 3882647f63bdSFilipe David Borba Manana int ret = 0; 38835d4f98a2SYan Zheng int err = 0; 38845d4f98a2SYan Zheng 38855d4f98a2SYan Zheng eb = path->nodes[0]; 38865d4f98a2SYan Zheng ptr = btrfs_item_ptr_offset(eb, path->slots[0]); 38875d4f98a2SYan Zheng end = ptr + btrfs_item_size_nr(eb, path->slots[0]); 38885d4f98a2SYan Zheng ptr += sizeof(struct btrfs_extent_item); 38895d4f98a2SYan Zheng 38905d4f98a2SYan Zheng while (ptr < end) { 38915d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 38923de28d57SLiu Bo key.type = btrfs_get_extent_inline_ref_type(eb, iref, 38933de28d57SLiu Bo BTRFS_REF_TYPE_DATA); 38945d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 38955d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 38965d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 38975d4f98a2SYan Zheng blocks); 38985d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 38995d4f98a2SYan Zheng dref = (struct btrfs_extent_data_ref *)(&iref->offset); 39005d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 39015d4f98a2SYan Zheng eb, dref, blocks); 39025d4f98a2SYan Zheng } else { 3903af431dcbSSu Yue ret = -EUCLEAN; 3904b14c55a1SLiu Bo btrfs_err(rc->extent_root->fs_info, 3905b14c55a1SLiu Bo "extent %llu slot %d has an invalid inline ref type", 3906b14c55a1SLiu Bo eb->start, path->slots[0]); 39075d4f98a2SYan Zheng } 3908647f63bdSFilipe David Borba Manana if (ret) { 3909647f63bdSFilipe David Borba Manana err = ret; 3910647f63bdSFilipe David Borba Manana goto out; 3911647f63bdSFilipe David Borba Manana } 39125d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 39135d4f98a2SYan Zheng } 39145d4f98a2SYan Zheng WARN_ON(ptr > end); 39155d4f98a2SYan Zheng 39165d4f98a2SYan Zheng while (1) { 39175d4f98a2SYan Zheng cond_resched(); 39185d4f98a2SYan Zheng eb = path->nodes[0]; 39195d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(eb)) { 39205d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 39215d4f98a2SYan Zheng if (ret < 0) { 39225d4f98a2SYan Zheng err = ret; 39235d4f98a2SYan Zheng break; 39245d4f98a2SYan Zheng } 39255d4f98a2SYan Zheng if (ret > 0) 39265d4f98a2SYan Zheng break; 39275d4f98a2SYan Zheng eb = path->nodes[0]; 39285d4f98a2SYan Zheng } 39295d4f98a2SYan Zheng 39305d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path->slots[0]); 39315d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 39325d4f98a2SYan Zheng break; 39335d4f98a2SYan Zheng 39345d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 39355d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 39365d4f98a2SYan Zheng blocks); 39375d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 39385d4f98a2SYan Zheng dref = btrfs_item_ptr(eb, path->slots[0], 39395d4f98a2SYan Zheng struct btrfs_extent_data_ref); 39405d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 39415d4f98a2SYan Zheng eb, dref, blocks); 39426d8ff4e4SDavid Sterba } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) { 3943ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3944ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3945ba3c2b19SNikolay Borisov ret = -EINVAL; 39465d4f98a2SYan Zheng } else { 39475d4f98a2SYan Zheng ret = 0; 39485d4f98a2SYan Zheng } 39495d4f98a2SYan Zheng if (ret) { 39505d4f98a2SYan Zheng err = ret; 39515d4f98a2SYan Zheng break; 39525d4f98a2SYan Zheng } 39535d4f98a2SYan Zheng path->slots[0]++; 39545d4f98a2SYan Zheng } 3955647f63bdSFilipe David Borba Manana out: 3956b3b4aa74SDavid Sterba btrfs_release_path(path); 39575d4f98a2SYan Zheng if (err) 39585d4f98a2SYan Zheng free_block_list(blocks); 39595d4f98a2SYan Zheng return err; 39605d4f98a2SYan Zheng } 39615d4f98a2SYan Zheng 39625d4f98a2SYan Zheng /* 39632c016dc2SLiu Bo * helper to find next unprocessed extent 39645d4f98a2SYan Zheng */ 39655d4f98a2SYan Zheng static noinline_for_stack 3966147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 39673fd0a558SYan, Zheng struct btrfs_key *extent_key) 39685d4f98a2SYan Zheng { 39690b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39705d4f98a2SYan Zheng struct btrfs_key key; 39715d4f98a2SYan Zheng struct extent_buffer *leaf; 39725d4f98a2SYan Zheng u64 start, end, last; 39735d4f98a2SYan Zheng int ret; 39745d4f98a2SYan Zheng 3975b3470b5dSDavid Sterba last = rc->block_group->start + rc->block_group->length; 39765d4f98a2SYan Zheng while (1) { 39775d4f98a2SYan Zheng cond_resched(); 39785d4f98a2SYan Zheng if (rc->search_start >= last) { 39795d4f98a2SYan Zheng ret = 1; 39805d4f98a2SYan Zheng break; 39815d4f98a2SYan Zheng } 39825d4f98a2SYan Zheng 39835d4f98a2SYan Zheng key.objectid = rc->search_start; 39845d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 39855d4f98a2SYan Zheng key.offset = 0; 39865d4f98a2SYan Zheng 39875d4f98a2SYan Zheng path->search_commit_root = 1; 39885d4f98a2SYan Zheng path->skip_locking = 1; 39895d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 39905d4f98a2SYan Zheng 0, 0); 39915d4f98a2SYan Zheng if (ret < 0) 39925d4f98a2SYan Zheng break; 39935d4f98a2SYan Zheng next: 39945d4f98a2SYan Zheng leaf = path->nodes[0]; 39955d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 39965d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 39975d4f98a2SYan Zheng if (ret != 0) 39985d4f98a2SYan Zheng break; 39995d4f98a2SYan Zheng leaf = path->nodes[0]; 40005d4f98a2SYan Zheng } 40015d4f98a2SYan Zheng 40025d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 40035d4f98a2SYan Zheng if (key.objectid >= last) { 40045d4f98a2SYan Zheng ret = 1; 40055d4f98a2SYan Zheng break; 40065d4f98a2SYan Zheng } 40075d4f98a2SYan Zheng 40083173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 40093173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 40103173a18fSJosef Bacik path->slots[0]++; 40113173a18fSJosef Bacik goto next; 40123173a18fSJosef Bacik } 40133173a18fSJosef Bacik 40143173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 40155d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 40165d4f98a2SYan Zheng path->slots[0]++; 40175d4f98a2SYan Zheng goto next; 40185d4f98a2SYan Zheng } 40195d4f98a2SYan Zheng 40203173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 40210b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 40223173a18fSJosef Bacik rc->search_start) { 40233173a18fSJosef Bacik path->slots[0]++; 40243173a18fSJosef Bacik goto next; 40253173a18fSJosef Bacik } 40263173a18fSJosef Bacik 40275d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 40285d4f98a2SYan Zheng key.objectid, &start, &end, 4029e6138876SJosef Bacik EXTENT_DIRTY, NULL); 40305d4f98a2SYan Zheng 40315d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 4032b3b4aa74SDavid Sterba btrfs_release_path(path); 40335d4f98a2SYan Zheng rc->search_start = end + 1; 40345d4f98a2SYan Zheng } else { 40353173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 40365d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 40373173a18fSJosef Bacik else 40383173a18fSJosef Bacik rc->search_start = key.objectid + 40390b246afaSJeff Mahoney fs_info->nodesize; 40403fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 40415d4f98a2SYan Zheng return 0; 40425d4f98a2SYan Zheng } 40435d4f98a2SYan Zheng } 4044b3b4aa74SDavid Sterba btrfs_release_path(path); 40455d4f98a2SYan Zheng return ret; 40465d4f98a2SYan Zheng } 40475d4f98a2SYan Zheng 40485d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 40495d4f98a2SYan Zheng { 40505d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 40517585717fSChris Mason 40527585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 40535d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 40547585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 40555d4f98a2SYan Zheng } 40565d4f98a2SYan Zheng 40575d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 40585d4f98a2SYan Zheng { 40595d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 40607585717fSChris Mason 40617585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 40625d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 40637585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 40645d4f98a2SYan Zheng } 40655d4f98a2SYan Zheng 40665d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 40675d4f98a2SYan Zheng { 40685d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 40695d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 40705d4f98a2SYan Zheng return 1; 40715d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 40725d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 40735d4f98a2SYan Zheng return 1; 40745d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 40755d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 40765d4f98a2SYan Zheng return 1; 40775d4f98a2SYan Zheng return 0; 40785d4f98a2SYan Zheng } 40795d4f98a2SYan Zheng 40803fd0a558SYan, Zheng static noinline_for_stack 40813fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 40823fd0a558SYan, Zheng { 40833fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 4084ac2fabacSJosef Bacik int ret; 40853fd0a558SYan, Zheng 40862ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 408766d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 40883fd0a558SYan, Zheng if (!rc->block_rsv) 40893fd0a558SYan, Zheng return -ENOMEM; 40903fd0a558SYan, Zheng 40913fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 4092b3470b5dSDavid Sterba rc->search_start = rc->block_group->start; 40933fd0a558SYan, Zheng rc->extents_found = 0; 40943fd0a558SYan, Zheng rc->nodes_relocated = 0; 40953fd0a558SYan, Zheng rc->merging_rsv_size = 0; 40960647bf56SWang Shilong rc->reserved_bytes = 0; 4097da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 40980647bf56SWang Shilong RELOCATION_RESERVED_NODES; 4099ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 4100ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 4101ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 4102ac2fabacSJosef Bacik if (ret) 4103ac2fabacSJosef Bacik return ret; 41043fd0a558SYan, Zheng 41053fd0a558SYan, Zheng rc->create_reloc_tree = 1; 41063fd0a558SYan, Zheng set_reloc_control(rc); 41073fd0a558SYan, Zheng 41087a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 410928818947SLiu Bo if (IS_ERR(trans)) { 411028818947SLiu Bo unset_reloc_control(rc); 411128818947SLiu Bo /* 411228818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 411328818947SLiu Bo * cleanup. And callers are responsible to free the above 411428818947SLiu Bo * block rsv. 411528818947SLiu Bo */ 411628818947SLiu Bo return PTR_ERR(trans); 411728818947SLiu Bo } 41183a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 41193fd0a558SYan, Zheng return 0; 41203fd0a558SYan, Zheng } 412176dda93cSYan, Zheng 41225d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 41235d4f98a2SYan Zheng { 41242ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 41255d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 41265d4f98a2SYan Zheng struct btrfs_key key; 41275d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 41285d4f98a2SYan Zheng struct btrfs_path *path; 41295d4f98a2SYan Zheng struct btrfs_extent_item *ei; 41305d4f98a2SYan Zheng u64 flags; 41315d4f98a2SYan Zheng u32 item_size; 41325d4f98a2SYan Zheng int ret; 41335d4f98a2SYan Zheng int err = 0; 4134c87f08caSChris Mason int progress = 0; 41355d4f98a2SYan Zheng 41365d4f98a2SYan Zheng path = btrfs_alloc_path(); 41373fd0a558SYan, Zheng if (!path) 41385d4f98a2SYan Zheng return -ENOMEM; 4139e4058b54SDavid Sterba path->reada = READA_FORWARD; 41403fd0a558SYan, Zheng 41413fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 41423fd0a558SYan, Zheng if (ret) { 41433fd0a558SYan, Zheng err = ret; 41443fd0a558SYan, Zheng goto out_free; 41452423fdfbSJiri Slaby } 41465d4f98a2SYan Zheng 41475d4f98a2SYan Zheng while (1) { 41480647bf56SWang Shilong rc->reserved_bytes = 0; 41490647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 41500647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 41510647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 41520647bf56SWang Shilong if (ret) { 41530647bf56SWang Shilong err = ret; 41540647bf56SWang Shilong break; 41550647bf56SWang Shilong } 4156c87f08caSChris Mason progress++; 4157a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 41580f788c58SLiu Bo if (IS_ERR(trans)) { 41590f788c58SLiu Bo err = PTR_ERR(trans); 41600f788c58SLiu Bo trans = NULL; 41610f788c58SLiu Bo break; 41620f788c58SLiu Bo } 4163c87f08caSChris Mason restart: 41643fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 41653a45bb20SJeff Mahoney btrfs_end_transaction(trans); 416642a657f5SPan Bian trans = NULL; 41673fd0a558SYan, Zheng continue; 41683fd0a558SYan, Zheng } 41693fd0a558SYan, Zheng 4170147d256eSZhaolei ret = find_next_extent(rc, path, &key); 41715d4f98a2SYan Zheng if (ret < 0) 41725d4f98a2SYan Zheng err = ret; 41735d4f98a2SYan Zheng if (ret != 0) 41745d4f98a2SYan Zheng break; 41755d4f98a2SYan Zheng 41765d4f98a2SYan Zheng rc->extents_found++; 41775d4f98a2SYan Zheng 41785d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 41795d4f98a2SYan Zheng struct btrfs_extent_item); 41803fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 41815d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 41825d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 41835d4f98a2SYan Zheng ret = check_extent_flags(flags); 41845d4f98a2SYan Zheng BUG_ON(ret); 41856d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 4186ba3c2b19SNikolay Borisov err = -EINVAL; 4187ba3c2b19SNikolay Borisov btrfs_print_v0_err(trans->fs_info); 4188ba3c2b19SNikolay Borisov btrfs_abort_transaction(trans, err); 4189ba3c2b19SNikolay Borisov break; 41905d4f98a2SYan Zheng } else { 41915d4f98a2SYan Zheng BUG(); 41925d4f98a2SYan Zheng } 41935d4f98a2SYan Zheng 41945d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 41955d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 41965d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 41975d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 41985d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 41995d4f98a2SYan Zheng } else { 4200b3b4aa74SDavid Sterba btrfs_release_path(path); 42015d4f98a2SYan Zheng ret = 0; 42025d4f98a2SYan Zheng } 42035d4f98a2SYan Zheng if (ret < 0) { 42043fd0a558SYan, Zheng err = ret; 42055d4f98a2SYan Zheng break; 42065d4f98a2SYan Zheng } 42075d4f98a2SYan Zheng 42085d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 42095d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 42105d4f98a2SYan Zheng if (ret < 0) { 42111708cc57SWang Shilong /* 42121708cc57SWang Shilong * if we fail to relocate tree blocks, force to update 42131708cc57SWang Shilong * backref cache when committing transaction. 42141708cc57SWang Shilong */ 42151708cc57SWang Shilong rc->backref_cache.last_trans = trans->transid - 1; 42161708cc57SWang Shilong 42173fd0a558SYan, Zheng if (ret != -EAGAIN) { 42185d4f98a2SYan Zheng err = ret; 42195d4f98a2SYan Zheng break; 42205d4f98a2SYan Zheng } 42213fd0a558SYan, Zheng rc->extents_found--; 42223fd0a558SYan, Zheng rc->search_start = key.objectid; 42233fd0a558SYan, Zheng } 42245d4f98a2SYan Zheng } 42255d4f98a2SYan Zheng 42263a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 42272ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 42283fd0a558SYan, Zheng trans = NULL; 42295d4f98a2SYan Zheng 42305d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 42315d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 42325d4f98a2SYan Zheng rc->found_file_extent = 1; 42330257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 42343fd0a558SYan, Zheng &key, &rc->cluster); 42355d4f98a2SYan Zheng if (ret < 0) { 42365d4f98a2SYan Zheng err = ret; 42375d4f98a2SYan Zheng break; 42385d4f98a2SYan Zheng } 42395d4f98a2SYan Zheng } 42405d4f98a2SYan Zheng } 4241c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 424243a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 42439689457bSShilong Wang if (ret == 1) { 4244c87f08caSChris Mason err = 0; 4245c87f08caSChris Mason progress = 0; 4246c87f08caSChris Mason goto restart; 4247c87f08caSChris Mason } 4248c87f08caSChris Mason } 42493fd0a558SYan, Zheng 4250b3b4aa74SDavid Sterba btrfs_release_path(path); 425191166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 42525d4f98a2SYan Zheng 42535d4f98a2SYan Zheng if (trans) { 42543a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 42552ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 42565d4f98a2SYan Zheng } 42575d4f98a2SYan Zheng 42580257bb82SYan, Zheng if (!err) { 42593fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 42603fd0a558SYan, Zheng &rc->cluster); 42610257bb82SYan, Zheng if (ret < 0) 42620257bb82SYan, Zheng err = ret; 42630257bb82SYan, Zheng } 42640257bb82SYan, Zheng 42653fd0a558SYan, Zheng rc->create_reloc_tree = 0; 42663fd0a558SYan, Zheng set_reloc_control(rc); 42670257bb82SYan, Zheng 42683fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 42692ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1); 42705d4f98a2SYan Zheng 42713fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 42725d4f98a2SYan Zheng 42735d4f98a2SYan Zheng merge_reloc_roots(rc); 42745d4f98a2SYan Zheng 42753fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 42765d4f98a2SYan Zheng unset_reloc_control(rc); 42772ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1); 42785d4f98a2SYan Zheng 42795d4f98a2SYan Zheng /* get rid of pinned extents */ 42807a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 428162b99540SQu Wenruo if (IS_ERR(trans)) { 42823612b495STsutomu Itoh err = PTR_ERR(trans); 428362b99540SQu Wenruo goto out_free; 428462b99540SQu Wenruo } 42853a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 4286d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4287d2311e69SQu Wenruo if (ret < 0 && !err) 4288d2311e69SQu Wenruo err = ret; 42893fd0a558SYan, Zheng out_free: 42902ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 42913fd0a558SYan, Zheng btrfs_free_path(path); 42925d4f98a2SYan Zheng return err; 42935d4f98a2SYan Zheng } 42945d4f98a2SYan Zheng 42955d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 42960257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 42975d4f98a2SYan Zheng { 42985d4f98a2SYan Zheng struct btrfs_path *path; 42995d4f98a2SYan Zheng struct btrfs_inode_item *item; 43005d4f98a2SYan Zheng struct extent_buffer *leaf; 43015d4f98a2SYan Zheng int ret; 43025d4f98a2SYan Zheng 43035d4f98a2SYan Zheng path = btrfs_alloc_path(); 43045d4f98a2SYan Zheng if (!path) 43055d4f98a2SYan Zheng return -ENOMEM; 43065d4f98a2SYan Zheng 43075d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 43085d4f98a2SYan Zheng if (ret) 43095d4f98a2SYan Zheng goto out; 43105d4f98a2SYan Zheng 43115d4f98a2SYan Zheng leaf = path->nodes[0]; 43125d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 4313b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 43145d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 43150257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 43165d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 43173fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 43183fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 43195d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 43205d4f98a2SYan Zheng out: 43215d4f98a2SYan Zheng btrfs_free_path(path); 43225d4f98a2SYan Zheng return ret; 43235d4f98a2SYan Zheng } 43245d4f98a2SYan Zheng 43255d4f98a2SYan Zheng /* 43265d4f98a2SYan Zheng * helper to create inode for data relocation. 43275d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 43285d4f98a2SYan Zheng */ 43293fd0a558SYan, Zheng static noinline_for_stack 43303fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 433132da5386SDavid Sterba struct btrfs_block_group *group) 43325d4f98a2SYan Zheng { 43335d4f98a2SYan Zheng struct inode *inode = NULL; 43345d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 43355d4f98a2SYan Zheng struct btrfs_root *root; 43365d4f98a2SYan Zheng struct btrfs_key key; 43374624900dSZhaolei u64 objectid; 43385d4f98a2SYan Zheng int err = 0; 43395d4f98a2SYan Zheng 43405d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 43415d4f98a2SYan Zheng if (IS_ERR(root)) 43425d4f98a2SYan Zheng return ERR_CAST(root); 43435d4f98a2SYan Zheng 4344a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 434576deacf0SJosef Bacik if (IS_ERR(trans)) { 434600246528SJosef Bacik btrfs_put_root(root); 43473fd0a558SYan, Zheng return ERR_CAST(trans); 434876deacf0SJosef Bacik } 43495d4f98a2SYan Zheng 4350581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 43515d4f98a2SYan Zheng if (err) 43525d4f98a2SYan Zheng goto out; 43535d4f98a2SYan Zheng 43540257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 43555d4f98a2SYan Zheng BUG_ON(err); 43565d4f98a2SYan Zheng 43575d4f98a2SYan Zheng key.objectid = objectid; 43585d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 43595d4f98a2SYan Zheng key.offset = 0; 43604c66e0d4SDavid Sterba inode = btrfs_iget(fs_info->sb, &key, root); 43612e19f1f9SAl Viro BUG_ON(IS_ERR(inode)); 4362b3470b5dSDavid Sterba BTRFS_I(inode)->index_cnt = group->start; 43635d4f98a2SYan Zheng 436473f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 43655d4f98a2SYan Zheng out: 436600246528SJosef Bacik btrfs_put_root(root); 43673a45bb20SJeff Mahoney btrfs_end_transaction(trans); 43682ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 43695d4f98a2SYan Zheng if (err) { 43705d4f98a2SYan Zheng if (inode) 43715d4f98a2SYan Zheng iput(inode); 43725d4f98a2SYan Zheng inode = ERR_PTR(err); 43735d4f98a2SYan Zheng } 43745d4f98a2SYan Zheng return inode; 43755d4f98a2SYan Zheng } 43765d4f98a2SYan Zheng 4377c258d6e3SQu Wenruo static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 43783fd0a558SYan, Zheng { 43793fd0a558SYan, Zheng struct reloc_control *rc; 43803fd0a558SYan, Zheng 43813fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 43823fd0a558SYan, Zheng if (!rc) 43833fd0a558SYan, Zheng return NULL; 43843fd0a558SYan, Zheng 43853fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 4386d2311e69SQu Wenruo INIT_LIST_HEAD(&rc->dirty_subvol_roots); 43873fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 43883fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 438943eb5f29SQu Wenruo extent_io_tree_init(fs_info, &rc->processed_blocks, 439043eb5f29SQu Wenruo IO_TREE_RELOC_BLOCKS, NULL); 43913fd0a558SYan, Zheng return rc; 43923fd0a558SYan, Zheng } 43933fd0a558SYan, Zheng 43945d4f98a2SYan Zheng /* 4395ebce0e01SAdam Borowski * Print the block group being relocated 4396ebce0e01SAdam Borowski */ 4397ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 439832da5386SDavid Sterba struct btrfs_block_group *block_group) 4399ebce0e01SAdam Borowski { 4400f89e09cfSAnand Jain char buf[128] = {'\0'}; 4401ebce0e01SAdam Borowski 4402f89e09cfSAnand Jain btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); 4403ebce0e01SAdam Borowski 4404ebce0e01SAdam Borowski btrfs_info(fs_info, 4405ebce0e01SAdam Borowski "relocating block group %llu flags %s", 4406b3470b5dSDavid Sterba block_group->start, buf); 4407ebce0e01SAdam Borowski } 4408ebce0e01SAdam Borowski 4409430640e3SQu Wenruo static const char *stage_to_string(int stage) 4410430640e3SQu Wenruo { 4411430640e3SQu Wenruo if (stage == MOVE_DATA_EXTENTS) 4412430640e3SQu Wenruo return "move data extents"; 4413430640e3SQu Wenruo if (stage == UPDATE_DATA_PTRS) 4414430640e3SQu Wenruo return "update data pointers"; 4415430640e3SQu Wenruo return "unknown"; 4416430640e3SQu Wenruo } 4417430640e3SQu Wenruo 4418ebce0e01SAdam Borowski /* 44195d4f98a2SYan Zheng * function to relocate all extents in a block group. 44205d4f98a2SYan Zheng */ 44216bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 44225d4f98a2SYan Zheng { 442332da5386SDavid Sterba struct btrfs_block_group *bg; 44246bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 44255d4f98a2SYan Zheng struct reloc_control *rc; 44260af3d00bSJosef Bacik struct inode *inode; 44270af3d00bSJosef Bacik struct btrfs_path *path; 44285d4f98a2SYan Zheng int ret; 4429f0486c68SYan, Zheng int rw = 0; 44305d4f98a2SYan Zheng int err = 0; 44315d4f98a2SYan Zheng 4432eede2bf3SOmar Sandoval bg = btrfs_lookup_block_group(fs_info, group_start); 4433eede2bf3SOmar Sandoval if (!bg) 4434eede2bf3SOmar Sandoval return -ENOENT; 4435eede2bf3SOmar Sandoval 4436eede2bf3SOmar Sandoval if (btrfs_pinned_by_swapfile(fs_info, bg)) { 4437eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 4438eede2bf3SOmar Sandoval return -ETXTBSY; 4439eede2bf3SOmar Sandoval } 4440eede2bf3SOmar Sandoval 4441c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 4442eede2bf3SOmar Sandoval if (!rc) { 4443eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 44445d4f98a2SYan Zheng return -ENOMEM; 4445eede2bf3SOmar Sandoval } 44465d4f98a2SYan Zheng 4447f0486c68SYan, Zheng rc->extent_root = extent_root; 4448eede2bf3SOmar Sandoval rc->block_group = bg; 44495d4f98a2SYan Zheng 4450b12de528SQu Wenruo ret = btrfs_inc_block_group_ro(rc->block_group, true); 4451f0486c68SYan, Zheng if (ret) { 4452f0486c68SYan, Zheng err = ret; 4453f0486c68SYan, Zheng goto out; 4454f0486c68SYan, Zheng } 4455f0486c68SYan, Zheng rw = 1; 4456f0486c68SYan, Zheng 44570af3d00bSJosef Bacik path = btrfs_alloc_path(); 44580af3d00bSJosef Bacik if (!path) { 44590af3d00bSJosef Bacik err = -ENOMEM; 44600af3d00bSJosef Bacik goto out; 44610af3d00bSJosef Bacik } 44620af3d00bSJosef Bacik 44637949f339SDavid Sterba inode = lookup_free_space_inode(rc->block_group, path); 44640af3d00bSJosef Bacik btrfs_free_path(path); 44650af3d00bSJosef Bacik 44660af3d00bSJosef Bacik if (!IS_ERR(inode)) 44671bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 44680af3d00bSJosef Bacik else 44690af3d00bSJosef Bacik ret = PTR_ERR(inode); 44700af3d00bSJosef Bacik 44710af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 44720af3d00bSJosef Bacik err = ret; 44730af3d00bSJosef Bacik goto out; 44740af3d00bSJosef Bacik } 44750af3d00bSJosef Bacik 44765d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 44775d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 44785d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 44795d4f98a2SYan Zheng rc->data_inode = NULL; 44805d4f98a2SYan Zheng goto out; 44815d4f98a2SYan Zheng } 44825d4f98a2SYan Zheng 44830b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 44845d4f98a2SYan Zheng 44859cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4486f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 44876374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 4488b3470b5dSDavid Sterba rc->block_group->start, 4489b3470b5dSDavid Sterba rc->block_group->length); 44905d4f98a2SYan Zheng 44915d4f98a2SYan Zheng while (1) { 4492430640e3SQu Wenruo int finishes_stage; 4493430640e3SQu Wenruo 449476dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 44955d4f98a2SYan Zheng ret = relocate_block_group(rc); 449676dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 4497ff612ba7SJosef Bacik if (ret < 0) 44985d4f98a2SYan Zheng err = ret; 4499ff612ba7SJosef Bacik 4500430640e3SQu Wenruo finishes_stage = rc->stage; 4501ff612ba7SJosef Bacik /* 4502ff612ba7SJosef Bacik * We may have gotten ENOSPC after we already dirtied some 4503ff612ba7SJosef Bacik * extents. If writeout happens while we're relocating a 4504ff612ba7SJosef Bacik * different block group we could end up hitting the 4505ff612ba7SJosef Bacik * BUG_ON(rc->stage == UPDATE_DATA_PTRS) in 4506ff612ba7SJosef Bacik * btrfs_reloc_cow_block. Make sure we write everything out 4507ff612ba7SJosef Bacik * properly so we don't trip over this problem, and then break 4508ff612ba7SJosef Bacik * out of the loop if we hit an error. 4509ff612ba7SJosef Bacik */ 4510ff612ba7SJosef Bacik if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 4511ff612ba7SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 4512ff612ba7SJosef Bacik (u64)-1); 4513ff612ba7SJosef Bacik if (ret) 4514ff612ba7SJosef Bacik err = ret; 4515ff612ba7SJosef Bacik invalidate_mapping_pages(rc->data_inode->i_mapping, 4516ff612ba7SJosef Bacik 0, -1); 4517ff612ba7SJosef Bacik rc->stage = UPDATE_DATA_PTRS; 45185d4f98a2SYan Zheng } 45195d4f98a2SYan Zheng 4520ff612ba7SJosef Bacik if (err < 0) 4521ff612ba7SJosef Bacik goto out; 4522ff612ba7SJosef Bacik 45235d4f98a2SYan Zheng if (rc->extents_found == 0) 45245d4f98a2SYan Zheng break; 45255d4f98a2SYan Zheng 4526430640e3SQu Wenruo btrfs_info(fs_info, "found %llu extents, stage: %s", 4527430640e3SQu Wenruo rc->extents_found, stage_to_string(finishes_stage)); 45285d4f98a2SYan Zheng } 45295d4f98a2SYan Zheng 45305d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 45315d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 4532bf38be65SDavid Sterba WARN_ON(rc->block_group->used > 0); 45335d4f98a2SYan Zheng out: 4534f0486c68SYan, Zheng if (err && rw) 45352ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 45365d4f98a2SYan Zheng iput(rc->data_inode); 45375d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 45385d4f98a2SYan Zheng kfree(rc); 45395d4f98a2SYan Zheng return err; 45405d4f98a2SYan Zheng } 45415d4f98a2SYan Zheng 454276dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 454376dda93cSYan, Zheng { 45440b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 454576dda93cSYan, Zheng struct btrfs_trans_handle *trans; 454679787eaaSJeff Mahoney int ret, err; 454776dda93cSYan, Zheng 45480b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 454979787eaaSJeff Mahoney if (IS_ERR(trans)) 455079787eaaSJeff Mahoney return PTR_ERR(trans); 455176dda93cSYan, Zheng 455276dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 455376dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 455476dda93cSYan, Zheng root->root_item.drop_level = 0; 455576dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 45560b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 455776dda93cSYan, Zheng &root->root_key, &root->root_item); 455876dda93cSYan, Zheng 45593a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 456079787eaaSJeff Mahoney if (err) 456179787eaaSJeff Mahoney return err; 456279787eaaSJeff Mahoney return ret; 456376dda93cSYan, Zheng } 456476dda93cSYan, Zheng 45655d4f98a2SYan Zheng /* 45665d4f98a2SYan Zheng * recover relocation interrupted by system crash. 45675d4f98a2SYan Zheng * 45685d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 45695d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 45705d4f98a2SYan Zheng */ 45715d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 45725d4f98a2SYan Zheng { 45730b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 45745d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 45755d4f98a2SYan Zheng struct btrfs_key key; 45765d4f98a2SYan Zheng struct btrfs_root *fs_root; 45775d4f98a2SYan Zheng struct btrfs_root *reloc_root; 45785d4f98a2SYan Zheng struct btrfs_path *path; 45795d4f98a2SYan Zheng struct extent_buffer *leaf; 45805d4f98a2SYan Zheng struct reloc_control *rc = NULL; 45815d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 45825d4f98a2SYan Zheng int ret; 45835d4f98a2SYan Zheng int err = 0; 45845d4f98a2SYan Zheng 45855d4f98a2SYan Zheng path = btrfs_alloc_path(); 45865d4f98a2SYan Zheng if (!path) 45875d4f98a2SYan Zheng return -ENOMEM; 4588e4058b54SDavid Sterba path->reada = READA_BACK; 45895d4f98a2SYan Zheng 45905d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 45915d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 45925d4f98a2SYan Zheng key.offset = (u64)-1; 45935d4f98a2SYan Zheng 45945d4f98a2SYan Zheng while (1) { 45950b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 45965d4f98a2SYan Zheng path, 0, 0); 45975d4f98a2SYan Zheng if (ret < 0) { 45985d4f98a2SYan Zheng err = ret; 45995d4f98a2SYan Zheng goto out; 46005d4f98a2SYan Zheng } 46015d4f98a2SYan Zheng if (ret > 0) { 46025d4f98a2SYan Zheng if (path->slots[0] == 0) 46035d4f98a2SYan Zheng break; 46045d4f98a2SYan Zheng path->slots[0]--; 46055d4f98a2SYan Zheng } 46065d4f98a2SYan Zheng leaf = path->nodes[0]; 46075d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4608b3b4aa74SDavid Sterba btrfs_release_path(path); 46095d4f98a2SYan Zheng 46105d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 46115d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 46125d4f98a2SYan Zheng break; 46135d4f98a2SYan Zheng 46143dbf1738SJosef Bacik reloc_root = btrfs_read_tree_root(root, &key); 46155d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 46165d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 46175d4f98a2SYan Zheng goto out; 46185d4f98a2SYan Zheng } 46195d4f98a2SYan Zheng 46203dbf1738SJosef Bacik set_bit(BTRFS_ROOT_REF_COWS, &reloc_root->state); 46215d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 46225d4f98a2SYan Zheng 46235d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 46240b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, 46255d4f98a2SYan Zheng reloc_root->root_key.offset); 46265d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 462776dda93cSYan, Zheng ret = PTR_ERR(fs_root); 462876dda93cSYan, Zheng if (ret != -ENOENT) { 462976dda93cSYan, Zheng err = ret; 46305d4f98a2SYan Zheng goto out; 46315d4f98a2SYan Zheng } 463279787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 463379787eaaSJeff Mahoney if (ret < 0) { 463479787eaaSJeff Mahoney err = ret; 463579787eaaSJeff Mahoney goto out; 463679787eaaSJeff Mahoney } 4637932fd26dSJosef Bacik } else { 463800246528SJosef Bacik btrfs_put_root(fs_root); 463976dda93cSYan, Zheng } 46405d4f98a2SYan Zheng } 46415d4f98a2SYan Zheng 46425d4f98a2SYan Zheng if (key.offset == 0) 46435d4f98a2SYan Zheng break; 46445d4f98a2SYan Zheng 46455d4f98a2SYan Zheng key.offset--; 46465d4f98a2SYan Zheng } 4647b3b4aa74SDavid Sterba btrfs_release_path(path); 46485d4f98a2SYan Zheng 46495d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 46505d4f98a2SYan Zheng goto out; 46515d4f98a2SYan Zheng 4652c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 46535d4f98a2SYan Zheng if (!rc) { 46545d4f98a2SYan Zheng err = -ENOMEM; 46555d4f98a2SYan Zheng goto out; 46565d4f98a2SYan Zheng } 46575d4f98a2SYan Zheng 46580b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 46595d4f98a2SYan Zheng 46605d4f98a2SYan Zheng set_reloc_control(rc); 46615d4f98a2SYan Zheng 46627a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 46633612b495STsutomu Itoh if (IS_ERR(trans)) { 46643612b495STsutomu Itoh unset_reloc_control(rc); 46653612b495STsutomu Itoh err = PTR_ERR(trans); 46663612b495STsutomu Itoh goto out_free; 46673612b495STsutomu Itoh } 46683fd0a558SYan, Zheng 46693fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 46703fd0a558SYan, Zheng 46715d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 46725d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 46735d4f98a2SYan Zheng struct btrfs_root, root_list); 46745d4f98a2SYan Zheng list_del(&reloc_root->root_list); 46755d4f98a2SYan Zheng 46765d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 46775d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 46785d4f98a2SYan Zheng &rc->reloc_roots); 46795d4f98a2SYan Zheng continue; 46805d4f98a2SYan Zheng } 46815d4f98a2SYan Zheng 46820b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, reloc_root->root_key.offset); 468379787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 468479787eaaSJeff Mahoney err = PTR_ERR(fs_root); 4685ca1aa281SJosef Bacik list_add_tail(&reloc_root->root_list, &reloc_roots); 468679787eaaSJeff Mahoney goto out_free; 468779787eaaSJeff Mahoney } 46885d4f98a2SYan Zheng 4689ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 469079787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 46915d4f98a2SYan Zheng fs_root->reloc_root = reloc_root; 469200246528SJosef Bacik btrfs_put_root(fs_root); 46935d4f98a2SYan Zheng } 46945d4f98a2SYan Zheng 46953a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 469679787eaaSJeff Mahoney if (err) 469779787eaaSJeff Mahoney goto out_free; 46985d4f98a2SYan Zheng 46995d4f98a2SYan Zheng merge_reloc_roots(rc); 47005d4f98a2SYan Zheng 47015d4f98a2SYan Zheng unset_reloc_control(rc); 47025d4f98a2SYan Zheng 47037a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 470462b99540SQu Wenruo if (IS_ERR(trans)) { 47053612b495STsutomu Itoh err = PTR_ERR(trans); 470662b99540SQu Wenruo goto out_free; 470762b99540SQu Wenruo } 47083a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 4709d2311e69SQu Wenruo 4710d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4711d2311e69SQu Wenruo if (ret < 0 && !err) 4712d2311e69SQu Wenruo err = ret; 47133612b495STsutomu Itoh out_free: 47145d4f98a2SYan Zheng kfree(rc); 47153612b495STsutomu Itoh out: 4716aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4717aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4718aca1bba6SLiu Bo 47195d4f98a2SYan Zheng btrfs_free_path(path); 47205d4f98a2SYan Zheng 47215d4f98a2SYan Zheng if (err == 0) { 47225d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 47230b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 4724932fd26dSJosef Bacik if (IS_ERR(fs_root)) { 47255d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4726932fd26dSJosef Bacik } else { 472766b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 472800246528SJosef Bacik btrfs_put_root(fs_root); 4729932fd26dSJosef Bacik } 4730932fd26dSJosef Bacik } 47315d4f98a2SYan Zheng return err; 47325d4f98a2SYan Zheng } 47335d4f98a2SYan Zheng 47345d4f98a2SYan Zheng /* 47355d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 47365d4f98a2SYan Zheng * 47375d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 47385d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 47395d4f98a2SYan Zheng */ 47405d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 47415d4f98a2SYan Zheng { 47420b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 47435d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 47445d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 47455d4f98a2SYan Zheng int ret; 47465d4f98a2SYan Zheng u64 disk_bytenr; 47474577b014SJosef Bacik u64 new_bytenr; 47485d4f98a2SYan Zheng LIST_HEAD(list); 47495d4f98a2SYan Zheng 47505d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 4751bffe633eSOmar Sandoval BUG_ON(ordered->file_offset != file_pos || ordered->num_bytes != len); 47525d4f98a2SYan Zheng 47535d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 47540b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4755a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 475679787eaaSJeff Mahoney if (ret) 475779787eaaSJeff Mahoney goto out; 47585d4f98a2SYan Zheng 47595d4f98a2SYan Zheng while (!list_empty(&list)) { 47605d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 47615d4f98a2SYan Zheng list_del_init(&sums->list); 47625d4f98a2SYan Zheng 47634577b014SJosef Bacik /* 47644577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 47654577b014SJosef Bacik * We need to do this because we will read in entire prealloc 47664577b014SJosef Bacik * extents but we may have written to say the middle of the 47674577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 47684577b014SJosef Bacik * the right disk offset. 47694577b014SJosef Bacik * 47704577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 47714577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 47724577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 47734577b014SJosef Bacik * disk length. 47744577b014SJosef Bacik */ 4775bffe633eSOmar Sandoval new_bytenr = ordered->disk_bytenr + sums->bytenr - disk_bytenr; 47764577b014SJosef Bacik sums->bytenr = new_bytenr; 47775d4f98a2SYan Zheng 4778f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 47795d4f98a2SYan Zheng } 478079787eaaSJeff Mahoney out: 47815d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4782411fc6bcSAndi Kleen return ret; 47835d4f98a2SYan Zheng } 47843fd0a558SYan, Zheng 478583d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 47863fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 47873fd0a558SYan, Zheng struct extent_buffer *cow) 47883fd0a558SYan, Zheng { 47890b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 47903fd0a558SYan, Zheng struct reloc_control *rc; 47913fd0a558SYan, Zheng struct backref_node *node; 47923fd0a558SYan, Zheng int first_cow = 0; 47933fd0a558SYan, Zheng int level; 479483d4cfd4SJosef Bacik int ret = 0; 47953fd0a558SYan, Zheng 47960b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 47973fd0a558SYan, Zheng if (!rc) 479883d4cfd4SJosef Bacik return 0; 47993fd0a558SYan, Zheng 48003fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 48013fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 48023fd0a558SYan, Zheng 4803c974c464SWang Shilong if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 4804c974c464SWang Shilong if (buf == root->node) 4805c974c464SWang Shilong __update_reloc_root(root, cow->start); 4806c974c464SWang Shilong } 4807c974c464SWang Shilong 48083fd0a558SYan, Zheng level = btrfs_header_level(buf); 48093fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 48103fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 48113fd0a558SYan, Zheng first_cow = 1; 48123fd0a558SYan, Zheng 48133fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 48143fd0a558SYan, Zheng rc->create_reloc_tree) { 48153fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 48163fd0a558SYan, Zheng 48173fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 48183fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 48193fd0a558SYan, Zheng node->new_bytenr != buf->start); 48203fd0a558SYan, Zheng 48213fd0a558SYan, Zheng drop_node_buffer(node); 482267439dadSDavid Sterba atomic_inc(&cow->refs); 48233fd0a558SYan, Zheng node->eb = cow; 48243fd0a558SYan, Zheng node->new_bytenr = cow->start; 48253fd0a558SYan, Zheng 48263fd0a558SYan, Zheng if (!node->pending) { 48273fd0a558SYan, Zheng list_move_tail(&node->list, 48283fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 48293fd0a558SYan, Zheng node->pending = 1; 48303fd0a558SYan, Zheng } 48313fd0a558SYan, Zheng 48323fd0a558SYan, Zheng if (first_cow) 48333fd0a558SYan, Zheng __mark_block_processed(rc, node); 48343fd0a558SYan, Zheng 48353fd0a558SYan, Zheng if (first_cow && level > 0) 48363fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 48373fd0a558SYan, Zheng } 48383fd0a558SYan, Zheng 483983d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 48403fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 484183d4cfd4SJosef Bacik return ret; 48423fd0a558SYan, Zheng } 48433fd0a558SYan, Zheng 48443fd0a558SYan, Zheng /* 48453fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 484601327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 48473fd0a558SYan, Zheng */ 4848147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 48493fd0a558SYan, Zheng u64 *bytes_to_reserve) 48503fd0a558SYan, Zheng { 485110995c04SQu Wenruo struct btrfs_root *root = pending->root; 485210995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 48533fd0a558SYan, Zheng 48546282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 48553fd0a558SYan, Zheng return; 48563fd0a558SYan, Zheng 48573fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 48583fd0a558SYan, Zheng return; 48593fd0a558SYan, Zheng 48603fd0a558SYan, Zheng root = root->reloc_root; 48613fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 48623fd0a558SYan, Zheng /* 48633fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 48643fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 48653fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 48663fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 48673fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 48683fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 48693fd0a558SYan, Zheng * tree may use more space than it frees. so we need 48703fd0a558SYan, Zheng * reserve extra space. 48713fd0a558SYan, Zheng */ 48723fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 48733fd0a558SYan, Zheng } 48743fd0a558SYan, Zheng 48753fd0a558SYan, Zheng /* 48763fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 48773fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 48783fd0a558SYan, Zheng */ 487949b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 48803fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 48813fd0a558SYan, Zheng { 48823fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 48833fd0a558SYan, Zheng struct btrfs_root *reloc_root; 48843fd0a558SYan, Zheng struct btrfs_root *new_root; 488510995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 48863fd0a558SYan, Zheng int ret; 48873fd0a558SYan, Zheng 48886282675eSQu Wenruo if (!rc || !have_reloc_root(root)) 488949b25e05SJeff Mahoney return 0; 48903fd0a558SYan, Zheng 48913fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 48923fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 48933fd0a558SYan, Zheng 48943fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 48953fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 48963fd0a558SYan, Zheng rc->block_rsv, 48973a584174SLu Fengqi rc->nodes_relocated, true); 489849b25e05SJeff Mahoney if (ret) 489949b25e05SJeff Mahoney return ret; 49003fd0a558SYan, Zheng } 49013fd0a558SYan, Zheng 49023fd0a558SYan, Zheng new_root = pending->snap; 49033fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 49043fd0a558SYan, Zheng new_root->root_key.objectid); 490549b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 490649b25e05SJeff Mahoney return PTR_ERR(reloc_root); 49073fd0a558SYan, Zheng 4908ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4909ffd7b339SJeff Mahoney BUG_ON(ret < 0); 49103fd0a558SYan, Zheng new_root->reloc_root = reloc_root; 49113fd0a558SYan, Zheng 491249b25e05SJeff Mahoney if (rc->create_reloc_tree) 49133fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 491449b25e05SJeff Mahoney return ret; 49153fd0a558SYan, Zheng } 4916