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" 235d4f98a2SYan Zheng 245d4f98a2SYan Zheng /* 255d4f98a2SYan Zheng * backref_node, mapping_node and tree_block start with this 265d4f98a2SYan Zheng */ 275d4f98a2SYan Zheng struct tree_entry { 285d4f98a2SYan Zheng struct rb_node rb_node; 295d4f98a2SYan Zheng u64 bytenr; 305d4f98a2SYan Zheng }; 315d4f98a2SYan Zheng 325d4f98a2SYan Zheng /* 335d4f98a2SYan Zheng * present a tree block in the backref cache 345d4f98a2SYan Zheng */ 355d4f98a2SYan Zheng struct backref_node { 365d4f98a2SYan Zheng struct rb_node rb_node; 375d4f98a2SYan Zheng u64 bytenr; 383fd0a558SYan, Zheng 393fd0a558SYan, Zheng u64 new_bytenr; 403fd0a558SYan, Zheng /* objectid of tree block owner, can be not uptodate */ 415d4f98a2SYan Zheng u64 owner; 423fd0a558SYan, Zheng /* link to pending, changed or detached list */ 433fd0a558SYan, Zheng struct list_head list; 445d4f98a2SYan Zheng /* list of upper level blocks reference this block */ 455d4f98a2SYan Zheng struct list_head upper; 465d4f98a2SYan Zheng /* list of child blocks in the cache */ 475d4f98a2SYan Zheng struct list_head lower; 485d4f98a2SYan Zheng /* NULL if this node is not tree root */ 495d4f98a2SYan Zheng struct btrfs_root *root; 505d4f98a2SYan Zheng /* extent buffer got by COW the block */ 515d4f98a2SYan Zheng struct extent_buffer *eb; 525d4f98a2SYan Zheng /* level of tree block */ 535d4f98a2SYan Zheng unsigned int level:8; 543fd0a558SYan, Zheng /* is the block in non-reference counted tree */ 553fd0a558SYan, Zheng unsigned int cowonly:1; 563fd0a558SYan, Zheng /* 1 if no child node in the cache */ 575d4f98a2SYan Zheng unsigned int lowest:1; 585d4f98a2SYan Zheng /* is the extent buffer locked */ 595d4f98a2SYan Zheng unsigned int locked:1; 605d4f98a2SYan Zheng /* has the block been processed */ 615d4f98a2SYan Zheng unsigned int processed:1; 625d4f98a2SYan Zheng /* have backrefs of this block been checked */ 635d4f98a2SYan Zheng unsigned int checked:1; 643fd0a558SYan, Zheng /* 653fd0a558SYan, Zheng * 1 if corresponding block has been cowed but some upper 663fd0a558SYan, Zheng * level block pointers may not point to the new location 673fd0a558SYan, Zheng */ 683fd0a558SYan, Zheng unsigned int pending:1; 693fd0a558SYan, Zheng /* 703fd0a558SYan, Zheng * 1 if the backref node isn't connected to any other 713fd0a558SYan, Zheng * backref node. 723fd0a558SYan, Zheng */ 733fd0a558SYan, Zheng unsigned int detached:1; 745d4f98a2SYan Zheng }; 755d4f98a2SYan Zheng 765d4f98a2SYan Zheng /* 775d4f98a2SYan Zheng * present a block pointer in the backref cache 785d4f98a2SYan Zheng */ 795d4f98a2SYan Zheng struct backref_edge { 805d4f98a2SYan Zheng struct list_head list[2]; 815d4f98a2SYan Zheng struct backref_node *node[2]; 825d4f98a2SYan Zheng }; 835d4f98a2SYan Zheng 845d4f98a2SYan Zheng #define LOWER 0 855d4f98a2SYan Zheng #define UPPER 1 860647bf56SWang Shilong #define RELOCATION_RESERVED_NODES 256 875d4f98a2SYan Zheng 885d4f98a2SYan Zheng struct backref_cache { 895d4f98a2SYan Zheng /* red black tree of all backref nodes in the cache */ 905d4f98a2SYan Zheng struct rb_root rb_root; 913fd0a558SYan, Zheng /* for passing backref nodes to btrfs_reloc_cow_block */ 923fd0a558SYan, Zheng struct backref_node *path[BTRFS_MAX_LEVEL]; 933fd0a558SYan, Zheng /* 943fd0a558SYan, Zheng * list of blocks that have been cowed but some block 953fd0a558SYan, Zheng * pointers in upper level blocks may not reflect the 963fd0a558SYan, Zheng * new location 973fd0a558SYan, Zheng */ 985d4f98a2SYan Zheng struct list_head pending[BTRFS_MAX_LEVEL]; 993fd0a558SYan, Zheng /* list of backref nodes with no child node */ 1003fd0a558SYan, Zheng struct list_head leaves; 1013fd0a558SYan, Zheng /* list of blocks that have been cowed in current transaction */ 1023fd0a558SYan, Zheng struct list_head changed; 1033fd0a558SYan, Zheng /* list of detached backref node. */ 1043fd0a558SYan, Zheng struct list_head detached; 1053fd0a558SYan, Zheng 1063fd0a558SYan, Zheng u64 last_trans; 1073fd0a558SYan, Zheng 1083fd0a558SYan, Zheng int nr_nodes; 1093fd0a558SYan, Zheng int nr_edges; 1105d4f98a2SYan Zheng }; 1115d4f98a2SYan Zheng 1125d4f98a2SYan Zheng /* 1135d4f98a2SYan Zheng * map address of tree root to tree 1145d4f98a2SYan Zheng */ 1155d4f98a2SYan Zheng struct mapping_node { 1165d4f98a2SYan Zheng struct rb_node rb_node; 1175d4f98a2SYan Zheng u64 bytenr; 1185d4f98a2SYan Zheng void *data; 1195d4f98a2SYan Zheng }; 1205d4f98a2SYan Zheng 1215d4f98a2SYan Zheng struct mapping_tree { 1225d4f98a2SYan Zheng struct rb_root rb_root; 1235d4f98a2SYan Zheng spinlock_t lock; 1245d4f98a2SYan Zheng }; 1255d4f98a2SYan Zheng 1265d4f98a2SYan Zheng /* 1275d4f98a2SYan Zheng * present a tree block to process 1285d4f98a2SYan Zheng */ 1295d4f98a2SYan Zheng struct tree_block { 1305d4f98a2SYan Zheng struct rb_node rb_node; 1315d4f98a2SYan Zheng u64 bytenr; 1325d4f98a2SYan Zheng struct btrfs_key key; 1335d4f98a2SYan Zheng unsigned int level:8; 1345d4f98a2SYan Zheng unsigned int key_ready:1; 1355d4f98a2SYan Zheng }; 1365d4f98a2SYan Zheng 1370257bb82SYan, Zheng #define MAX_EXTENTS 128 1380257bb82SYan, Zheng 1390257bb82SYan, Zheng struct file_extent_cluster { 1400257bb82SYan, Zheng u64 start; 1410257bb82SYan, Zheng u64 end; 1420257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 1430257bb82SYan, Zheng unsigned int nr; 1440257bb82SYan, Zheng }; 1450257bb82SYan, Zheng 1465d4f98a2SYan Zheng struct reloc_control { 1475d4f98a2SYan Zheng /* block group to relocate */ 1485d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group; 1495d4f98a2SYan Zheng /* extent tree */ 1505d4f98a2SYan Zheng struct btrfs_root *extent_root; 1515d4f98a2SYan Zheng /* inode for moving data */ 1525d4f98a2SYan Zheng struct inode *data_inode; 1533fd0a558SYan, Zheng 1543fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 1553fd0a558SYan, Zheng 1563fd0a558SYan, Zheng struct backref_cache backref_cache; 1573fd0a558SYan, Zheng 1583fd0a558SYan, Zheng struct file_extent_cluster cluster; 1595d4f98a2SYan Zheng /* tree blocks have been processed */ 1605d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 1615d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 1625d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 1635d4f98a2SYan Zheng /* list of reloc trees */ 1645d4f98a2SYan Zheng struct list_head reloc_roots; 1653fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 1663fd0a558SYan, Zheng u64 merging_rsv_size; 1673fd0a558SYan, Zheng /* size of relocated tree nodes */ 1683fd0a558SYan, Zheng u64 nodes_relocated; 1690647bf56SWang Shilong /* reserved size for block group relocation*/ 1700647bf56SWang Shilong u64 reserved_bytes; 1713fd0a558SYan, Zheng 1725d4f98a2SYan Zheng u64 search_start; 1735d4f98a2SYan Zheng u64 extents_found; 1743fd0a558SYan, Zheng 1753fd0a558SYan, Zheng unsigned int stage:8; 1763fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 1773fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 1785d4f98a2SYan Zheng unsigned int found_file_extent:1; 1795d4f98a2SYan Zheng }; 1805d4f98a2SYan Zheng 1815d4f98a2SYan Zheng /* stages of data relocation */ 1825d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 1835d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 1845d4f98a2SYan Zheng 1853fd0a558SYan, Zheng static void remove_backref_node(struct backref_cache *cache, 1863fd0a558SYan, Zheng struct backref_node *node); 1873fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 1883fd0a558SYan, Zheng struct backref_node *node); 1895d4f98a2SYan Zheng 1905d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 1915d4f98a2SYan Zheng { 1926bef4d31SEric Paris tree->rb_root = RB_ROOT; 1935d4f98a2SYan Zheng spin_lock_init(&tree->lock); 1945d4f98a2SYan Zheng } 1955d4f98a2SYan Zheng 1965d4f98a2SYan Zheng static void backref_cache_init(struct backref_cache *cache) 1975d4f98a2SYan Zheng { 1985d4f98a2SYan Zheng int i; 1996bef4d31SEric Paris cache->rb_root = RB_ROOT; 2005d4f98a2SYan Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2015d4f98a2SYan Zheng INIT_LIST_HEAD(&cache->pending[i]); 2023fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->changed); 2033fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->detached); 2043fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->leaves); 2055d4f98a2SYan Zheng } 2065d4f98a2SYan Zheng 2073fd0a558SYan, Zheng static void backref_cache_cleanup(struct backref_cache *cache) 2085d4f98a2SYan Zheng { 2093fd0a558SYan, Zheng struct backref_node *node; 2103fd0a558SYan, Zheng int i; 2113fd0a558SYan, Zheng 2123fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2133fd0a558SYan, Zheng node = list_entry(cache->detached.next, 2143fd0a558SYan, Zheng struct backref_node, list); 2153fd0a558SYan, Zheng remove_backref_node(cache, node); 2163fd0a558SYan, Zheng } 2173fd0a558SYan, Zheng 2183fd0a558SYan, Zheng while (!list_empty(&cache->leaves)) { 2193fd0a558SYan, Zheng node = list_entry(cache->leaves.next, 2203fd0a558SYan, Zheng struct backref_node, lower); 2213fd0a558SYan, Zheng remove_backref_node(cache, node); 2223fd0a558SYan, Zheng } 2233fd0a558SYan, Zheng 2243fd0a558SYan, Zheng cache->last_trans = 0; 2253fd0a558SYan, Zheng 2263fd0a558SYan, Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 227f4907095SLiu Bo ASSERT(list_empty(&cache->pending[i])); 228f4907095SLiu Bo ASSERT(list_empty(&cache->changed)); 229f4907095SLiu Bo ASSERT(list_empty(&cache->detached)); 230f4907095SLiu Bo ASSERT(RB_EMPTY_ROOT(&cache->rb_root)); 231f4907095SLiu Bo ASSERT(!cache->nr_nodes); 232f4907095SLiu Bo ASSERT(!cache->nr_edges); 2333fd0a558SYan, Zheng } 2343fd0a558SYan, Zheng 2353fd0a558SYan, Zheng static struct backref_node *alloc_backref_node(struct backref_cache *cache) 2363fd0a558SYan, Zheng { 2373fd0a558SYan, Zheng struct backref_node *node; 2383fd0a558SYan, Zheng 2393fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 2403fd0a558SYan, Zheng if (node) { 2413fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 2425d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 2435d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 2445d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 2453fd0a558SYan, Zheng cache->nr_nodes++; 2463fd0a558SYan, Zheng } 2473fd0a558SYan, Zheng return node; 2483fd0a558SYan, Zheng } 2493fd0a558SYan, Zheng 2503fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 2513fd0a558SYan, Zheng struct backref_node *node) 2523fd0a558SYan, Zheng { 2533fd0a558SYan, Zheng if (node) { 2543fd0a558SYan, Zheng cache->nr_nodes--; 2553fd0a558SYan, Zheng kfree(node); 2563fd0a558SYan, Zheng } 2573fd0a558SYan, Zheng } 2583fd0a558SYan, Zheng 2593fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 2603fd0a558SYan, Zheng { 2613fd0a558SYan, Zheng struct backref_edge *edge; 2623fd0a558SYan, Zheng 2633fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 2643fd0a558SYan, Zheng if (edge) 2653fd0a558SYan, Zheng cache->nr_edges++; 2663fd0a558SYan, Zheng return edge; 2673fd0a558SYan, Zheng } 2683fd0a558SYan, Zheng 2693fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 2703fd0a558SYan, Zheng struct backref_edge *edge) 2713fd0a558SYan, Zheng { 2723fd0a558SYan, Zheng if (edge) { 2733fd0a558SYan, Zheng cache->nr_edges--; 2743fd0a558SYan, Zheng kfree(edge); 2753fd0a558SYan, Zheng } 2765d4f98a2SYan Zheng } 2775d4f98a2SYan Zheng 2785d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 2795d4f98a2SYan Zheng struct rb_node *node) 2805d4f98a2SYan Zheng { 2815d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 2825d4f98a2SYan Zheng struct rb_node *parent = NULL; 2835d4f98a2SYan Zheng struct tree_entry *entry; 2845d4f98a2SYan Zheng 2855d4f98a2SYan Zheng while (*p) { 2865d4f98a2SYan Zheng parent = *p; 2875d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 2885d4f98a2SYan Zheng 2895d4f98a2SYan Zheng if (bytenr < entry->bytenr) 2905d4f98a2SYan Zheng p = &(*p)->rb_left; 2915d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 2925d4f98a2SYan Zheng p = &(*p)->rb_right; 2935d4f98a2SYan Zheng else 2945d4f98a2SYan Zheng return parent; 2955d4f98a2SYan Zheng } 2965d4f98a2SYan Zheng 2975d4f98a2SYan Zheng rb_link_node(node, parent, p); 2985d4f98a2SYan Zheng rb_insert_color(node, root); 2995d4f98a2SYan Zheng return NULL; 3005d4f98a2SYan Zheng } 3015d4f98a2SYan Zheng 3025d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 3035d4f98a2SYan Zheng { 3045d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 3055d4f98a2SYan Zheng struct tree_entry *entry; 3065d4f98a2SYan Zheng 3075d4f98a2SYan Zheng while (n) { 3085d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 3095d4f98a2SYan Zheng 3105d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3115d4f98a2SYan Zheng n = n->rb_left; 3125d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3135d4f98a2SYan Zheng n = n->rb_right; 3145d4f98a2SYan Zheng else 3155d4f98a2SYan Zheng return n; 3165d4f98a2SYan Zheng } 3175d4f98a2SYan Zheng return NULL; 3185d4f98a2SYan Zheng } 3195d4f98a2SYan Zheng 32048a3b636SEric Sandeen static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) 32143c04fb1SJeff Mahoney { 32243c04fb1SJeff Mahoney 32343c04fb1SJeff Mahoney struct btrfs_fs_info *fs_info = NULL; 32443c04fb1SJeff Mahoney struct backref_node *bnode = rb_entry(rb_node, struct backref_node, 32543c04fb1SJeff Mahoney rb_node); 32643c04fb1SJeff Mahoney if (bnode->root) 32743c04fb1SJeff Mahoney fs_info = bnode->root->fs_info; 3285d163e0eSJeff Mahoney btrfs_panic(fs_info, errno, 3295d163e0eSJeff Mahoney "Inconsistency in backref cache found at offset %llu", 3305d163e0eSJeff Mahoney bytenr); 33143c04fb1SJeff Mahoney } 33243c04fb1SJeff Mahoney 3335d4f98a2SYan Zheng /* 3345d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 3355d4f98a2SYan Zheng */ 3365d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 3375d4f98a2SYan Zheng struct backref_edge *edges[], 3385d4f98a2SYan Zheng int *index) 3395d4f98a2SYan Zheng { 3405d4f98a2SYan Zheng struct backref_edge *edge; 3415d4f98a2SYan Zheng int idx = *index; 3425d4f98a2SYan Zheng 3435d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 3445d4f98a2SYan Zheng edge = list_entry(node->upper.next, 3455d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3465d4f98a2SYan Zheng edges[idx++] = edge; 3475d4f98a2SYan Zheng node = edge->node[UPPER]; 3485d4f98a2SYan Zheng } 3493fd0a558SYan, Zheng BUG_ON(node->detached); 3505d4f98a2SYan Zheng *index = idx; 3515d4f98a2SYan Zheng return node; 3525d4f98a2SYan Zheng } 3535d4f98a2SYan Zheng 3545d4f98a2SYan Zheng /* 3555d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 3565d4f98a2SYan Zheng */ 3575d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 3585d4f98a2SYan Zheng int *index) 3595d4f98a2SYan Zheng { 3605d4f98a2SYan Zheng struct backref_edge *edge; 3615d4f98a2SYan Zheng struct backref_node *lower; 3625d4f98a2SYan Zheng int idx = *index; 3635d4f98a2SYan Zheng 3645d4f98a2SYan Zheng while (idx > 0) { 3655d4f98a2SYan Zheng edge = edges[idx - 1]; 3665d4f98a2SYan Zheng lower = edge->node[LOWER]; 3675d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 3685d4f98a2SYan Zheng idx--; 3695d4f98a2SYan Zheng continue; 3705d4f98a2SYan Zheng } 3715d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 3725d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3735d4f98a2SYan Zheng edges[idx - 1] = edge; 3745d4f98a2SYan Zheng *index = idx; 3755d4f98a2SYan Zheng return edge->node[UPPER]; 3765d4f98a2SYan Zheng } 3775d4f98a2SYan Zheng *index = 0; 3785d4f98a2SYan Zheng return NULL; 3795d4f98a2SYan Zheng } 3805d4f98a2SYan Zheng 3813fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 3825d4f98a2SYan Zheng { 3835d4f98a2SYan Zheng if (node->locked) { 3845d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 3855d4f98a2SYan Zheng node->locked = 0; 3865d4f98a2SYan Zheng } 3873fd0a558SYan, Zheng } 3883fd0a558SYan, Zheng 3893fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 3903fd0a558SYan, Zheng { 3913fd0a558SYan, Zheng if (node->eb) { 3923fd0a558SYan, Zheng unlock_node_buffer(node); 3935d4f98a2SYan Zheng free_extent_buffer(node->eb); 3945d4f98a2SYan Zheng node->eb = NULL; 3955d4f98a2SYan Zheng } 3965d4f98a2SYan Zheng } 3975d4f98a2SYan Zheng 3985d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 3995d4f98a2SYan Zheng struct backref_node *node) 4005d4f98a2SYan Zheng { 4015d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 4025d4f98a2SYan Zheng 4035d4f98a2SYan Zheng drop_node_buffer(node); 4043fd0a558SYan, Zheng list_del(&node->list); 4055d4f98a2SYan Zheng list_del(&node->lower); 4063fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 4075d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 4083fd0a558SYan, Zheng free_backref_node(tree, node); 4095d4f98a2SYan Zheng } 4105d4f98a2SYan Zheng 4115d4f98a2SYan Zheng /* 4125d4f98a2SYan Zheng * remove a backref node from the backref cache 4135d4f98a2SYan Zheng */ 4145d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 4155d4f98a2SYan Zheng struct backref_node *node) 4165d4f98a2SYan Zheng { 4175d4f98a2SYan Zheng struct backref_node *upper; 4185d4f98a2SYan Zheng struct backref_edge *edge; 4195d4f98a2SYan Zheng 4205d4f98a2SYan Zheng if (!node) 4215d4f98a2SYan Zheng return; 4225d4f98a2SYan Zheng 4233fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 4245d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4255d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 4265d4f98a2SYan Zheng list[LOWER]); 4275d4f98a2SYan Zheng upper = edge->node[UPPER]; 4285d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 4295d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 4303fd0a558SYan, Zheng free_backref_edge(cache, edge); 4313fd0a558SYan, Zheng 4323fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 4333fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 4343fd0a558SYan, Zheng drop_backref_node(cache, node); 4353fd0a558SYan, Zheng node = upper; 4363fd0a558SYan, Zheng node->lowest = 1; 4373fd0a558SYan, Zheng continue; 4383fd0a558SYan, Zheng } 4395d4f98a2SYan Zheng /* 4403fd0a558SYan, Zheng * add the node to leaf node list if no other 4415d4f98a2SYan Zheng * child block cached. 4425d4f98a2SYan Zheng */ 4435d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 4443fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 4455d4f98a2SYan Zheng upper->lowest = 1; 4465d4f98a2SYan Zheng } 4475d4f98a2SYan Zheng } 4483fd0a558SYan, Zheng 4495d4f98a2SYan Zheng drop_backref_node(cache, node); 4505d4f98a2SYan Zheng } 4515d4f98a2SYan Zheng 4523fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 4533fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 4543fd0a558SYan, Zheng { 4553fd0a558SYan, Zheng struct rb_node *rb_node; 4563fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 4573fd0a558SYan, Zheng node->bytenr = bytenr; 4583fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 45943c04fb1SJeff Mahoney if (rb_node) 46043c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, bytenr); 4613fd0a558SYan, Zheng } 4623fd0a558SYan, Zheng 4633fd0a558SYan, Zheng /* 4643fd0a558SYan, Zheng * update backref cache after a transaction commit 4653fd0a558SYan, Zheng */ 4663fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 4673fd0a558SYan, Zheng struct backref_cache *cache) 4683fd0a558SYan, Zheng { 4693fd0a558SYan, Zheng struct backref_node *node; 4703fd0a558SYan, Zheng int level = 0; 4713fd0a558SYan, Zheng 4723fd0a558SYan, Zheng if (cache->last_trans == 0) { 4733fd0a558SYan, Zheng cache->last_trans = trans->transid; 4743fd0a558SYan, Zheng return 0; 4753fd0a558SYan, Zheng } 4763fd0a558SYan, Zheng 4773fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 4783fd0a558SYan, Zheng return 0; 4793fd0a558SYan, Zheng 4803fd0a558SYan, Zheng /* 4813fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 4823fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 4833fd0a558SYan, Zheng * so the detached nodes are no longer useful. 4843fd0a558SYan, Zheng */ 4853fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 4863fd0a558SYan, Zheng node = list_entry(cache->detached.next, 4873fd0a558SYan, Zheng struct backref_node, list); 4883fd0a558SYan, Zheng remove_backref_node(cache, node); 4893fd0a558SYan, Zheng } 4903fd0a558SYan, Zheng 4913fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 4923fd0a558SYan, Zheng node = list_entry(cache->changed.next, 4933fd0a558SYan, Zheng struct backref_node, list); 4943fd0a558SYan, Zheng list_del_init(&node->list); 4953fd0a558SYan, Zheng BUG_ON(node->pending); 4963fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 4973fd0a558SYan, Zheng } 4983fd0a558SYan, Zheng 4993fd0a558SYan, Zheng /* 5003fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 5013fd0a558SYan, Zheng * errors during processing the pending nodes. 5023fd0a558SYan, Zheng */ 5033fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 5043fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 5053fd0a558SYan, Zheng BUG_ON(!node->pending); 5063fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 5073fd0a558SYan, Zheng continue; 5083fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5093fd0a558SYan, Zheng } 5103fd0a558SYan, Zheng } 5113fd0a558SYan, Zheng 5123fd0a558SYan, Zheng cache->last_trans = 0; 5133fd0a558SYan, Zheng return 1; 5143fd0a558SYan, Zheng } 5153fd0a558SYan, Zheng 516f2a97a9dSDavid Sterba 5173fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 5183fd0a558SYan, Zheng { 5193fd0a558SYan, Zheng struct btrfs_root *reloc_root; 5203fd0a558SYan, Zheng 52127cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 5223fd0a558SYan, Zheng return 0; 5233fd0a558SYan, Zheng 5243fd0a558SYan, Zheng reloc_root = root->reloc_root; 5253fd0a558SYan, Zheng if (!reloc_root) 5263fd0a558SYan, Zheng return 0; 5273fd0a558SYan, Zheng 5283fd0a558SYan, Zheng if (btrfs_root_last_snapshot(&reloc_root->root_item) == 5293fd0a558SYan, Zheng root->fs_info->running_transaction->transid - 1) 5303fd0a558SYan, Zheng return 0; 5313fd0a558SYan, Zheng /* 5323fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 5333fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 5343fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 5353fd0a558SYan, Zheng * relocation. 5363fd0a558SYan, Zheng */ 5373fd0a558SYan, Zheng return 1; 5383fd0a558SYan, Zheng } 5395d4f98a2SYan Zheng /* 5405d4f98a2SYan Zheng * find reloc tree by address of tree root 5415d4f98a2SYan Zheng */ 5425d4f98a2SYan Zheng static struct btrfs_root *find_reloc_root(struct reloc_control *rc, 5435d4f98a2SYan Zheng u64 bytenr) 5445d4f98a2SYan Zheng { 5455d4f98a2SYan Zheng struct rb_node *rb_node; 5465d4f98a2SYan Zheng struct mapping_node *node; 5475d4f98a2SYan Zheng struct btrfs_root *root = NULL; 5485d4f98a2SYan Zheng 5495d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 5505d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 5515d4f98a2SYan Zheng if (rb_node) { 5525d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 5535d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 5545d4f98a2SYan Zheng } 5555d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 5565d4f98a2SYan Zheng return root; 5575d4f98a2SYan Zheng } 5585d4f98a2SYan Zheng 5595d4f98a2SYan Zheng static int is_cowonly_root(u64 root_objectid) 5605d4f98a2SYan Zheng { 5615d4f98a2SYan Zheng if (root_objectid == BTRFS_ROOT_TREE_OBJECTID || 5625d4f98a2SYan Zheng root_objectid == BTRFS_EXTENT_TREE_OBJECTID || 5635d4f98a2SYan Zheng root_objectid == BTRFS_CHUNK_TREE_OBJECTID || 5645d4f98a2SYan Zheng root_objectid == BTRFS_DEV_TREE_OBJECTID || 5655d4f98a2SYan Zheng root_objectid == BTRFS_TREE_LOG_OBJECTID || 56666463748SWang Shilong root_objectid == BTRFS_CSUM_TREE_OBJECTID || 56766463748SWang Shilong root_objectid == BTRFS_UUID_TREE_OBJECTID || 5683e4c5efbSDavid Sterba root_objectid == BTRFS_QUOTA_TREE_OBJECTID || 5693e4c5efbSDavid Sterba root_objectid == BTRFS_FREE_SPACE_TREE_OBJECTID) 5705d4f98a2SYan Zheng return 1; 5715d4f98a2SYan Zheng return 0; 5725d4f98a2SYan Zheng } 5735d4f98a2SYan Zheng 5745d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 5755d4f98a2SYan Zheng u64 root_objectid) 5765d4f98a2SYan Zheng { 5775d4f98a2SYan Zheng struct btrfs_key key; 5785d4f98a2SYan Zheng 5795d4f98a2SYan Zheng key.objectid = root_objectid; 5805d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 5815d4f98a2SYan Zheng if (is_cowonly_root(root_objectid)) 5825d4f98a2SYan Zheng key.offset = 0; 5835d4f98a2SYan Zheng else 5845d4f98a2SYan Zheng key.offset = (u64)-1; 5855d4f98a2SYan Zheng 586c00869f1SMiao Xie return btrfs_get_fs_root(fs_info, &key, false); 5875d4f98a2SYan Zheng } 5885d4f98a2SYan Zheng 5895d4f98a2SYan Zheng static noinline_for_stack 5905d4f98a2SYan Zheng int find_inline_backref(struct extent_buffer *leaf, int slot, 5915d4f98a2SYan Zheng unsigned long *ptr, unsigned long *end) 5925d4f98a2SYan Zheng { 5933173a18fSJosef Bacik struct btrfs_key key; 5945d4f98a2SYan Zheng struct btrfs_extent_item *ei; 5955d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 5965d4f98a2SYan Zheng u32 item_size; 5975d4f98a2SYan Zheng 5983173a18fSJosef Bacik btrfs_item_key_to_cpu(leaf, &key, slot); 5993173a18fSJosef Bacik 6005d4f98a2SYan Zheng item_size = btrfs_item_size_nr(leaf, slot); 601*ba3c2b19SNikolay Borisov if (item_size < sizeof(*ei)) { 602*ba3c2b19SNikolay Borisov btrfs_print_v0_err(leaf->fs_info); 603*ba3c2b19SNikolay Borisov btrfs_handle_fs_error(leaf->fs_info, -EINVAL, NULL); 604*ba3c2b19SNikolay Borisov return 1; 605*ba3c2b19SNikolay Borisov } 6065d4f98a2SYan Zheng ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); 6075d4f98a2SYan Zheng WARN_ON(!(btrfs_extent_flags(leaf, ei) & 6085d4f98a2SYan Zheng BTRFS_EXTENT_FLAG_TREE_BLOCK)); 6095d4f98a2SYan Zheng 6103173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 6113173a18fSJosef Bacik item_size <= sizeof(*ei) + sizeof(*bi)) { 6125d4f98a2SYan Zheng WARN_ON(item_size < sizeof(*ei) + sizeof(*bi)); 6135d4f98a2SYan Zheng return 1; 6145d4f98a2SYan Zheng } 615d062d13cSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 616d062d13cSJosef Bacik item_size <= sizeof(*ei)) { 617d062d13cSJosef Bacik WARN_ON(item_size < sizeof(*ei)); 618d062d13cSJosef Bacik return 1; 619d062d13cSJosef Bacik } 6205d4f98a2SYan Zheng 6213173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) { 6225d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 6235d4f98a2SYan Zheng *ptr = (unsigned long)(bi + 1); 6243173a18fSJosef Bacik } else { 6253173a18fSJosef Bacik *ptr = (unsigned long)(ei + 1); 6263173a18fSJosef Bacik } 6275d4f98a2SYan Zheng *end = (unsigned long)ei + item_size; 6285d4f98a2SYan Zheng return 0; 6295d4f98a2SYan Zheng } 6305d4f98a2SYan Zheng 6315d4f98a2SYan Zheng /* 6325d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 6335d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 6345d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 6355d4f98a2SYan Zheng * 6365d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 63701327610SNicholas D Steeves * to find upper level blocks that reference the block, and then check 63801327610SNicholas D Steeves * backrefs of these upper level blocks recursively. the recursion stop 6395d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 6405d4f98a2SYan Zheng * 6415d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 6425d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 6435d4f98a2SYan Zheng * block are also cached. 6445d4f98a2SYan Zheng */ 6453fd0a558SYan, Zheng static noinline_for_stack 6463fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 6475d4f98a2SYan Zheng struct btrfs_key *node_key, 6485d4f98a2SYan Zheng int level, u64 bytenr) 6495d4f98a2SYan Zheng { 6503fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 6515d4f98a2SYan Zheng struct btrfs_path *path1; 6525d4f98a2SYan Zheng struct btrfs_path *path2; 6535d4f98a2SYan Zheng struct extent_buffer *eb; 6545d4f98a2SYan Zheng struct btrfs_root *root; 6555d4f98a2SYan Zheng struct backref_node *cur; 6565d4f98a2SYan Zheng struct backref_node *upper; 6575d4f98a2SYan Zheng struct backref_node *lower; 6585d4f98a2SYan Zheng struct backref_node *node = NULL; 6595d4f98a2SYan Zheng struct backref_node *exist = NULL; 6605d4f98a2SYan Zheng struct backref_edge *edge; 6615d4f98a2SYan Zheng struct rb_node *rb_node; 6625d4f98a2SYan Zheng struct btrfs_key key; 6635d4f98a2SYan Zheng unsigned long end; 6645d4f98a2SYan Zheng unsigned long ptr; 6655d4f98a2SYan Zheng LIST_HEAD(list); 6663fd0a558SYan, Zheng LIST_HEAD(useless); 6673fd0a558SYan, Zheng int cowonly; 6685d4f98a2SYan Zheng int ret; 6695d4f98a2SYan Zheng int err = 0; 670b6c60c80SJosef Bacik bool need_check = true; 6715d4f98a2SYan Zheng 6725d4f98a2SYan Zheng path1 = btrfs_alloc_path(); 6735d4f98a2SYan Zheng path2 = btrfs_alloc_path(); 6745d4f98a2SYan Zheng if (!path1 || !path2) { 6755d4f98a2SYan Zheng err = -ENOMEM; 6765d4f98a2SYan Zheng goto out; 6775d4f98a2SYan Zheng } 678e4058b54SDavid Sterba path1->reada = READA_FORWARD; 679e4058b54SDavid Sterba path2->reada = READA_FORWARD; 6805d4f98a2SYan Zheng 6813fd0a558SYan, Zheng node = alloc_backref_node(cache); 6825d4f98a2SYan Zheng if (!node) { 6835d4f98a2SYan Zheng err = -ENOMEM; 6845d4f98a2SYan Zheng goto out; 6855d4f98a2SYan Zheng } 6865d4f98a2SYan Zheng 6875d4f98a2SYan Zheng node->bytenr = bytenr; 6885d4f98a2SYan Zheng node->level = level; 6895d4f98a2SYan Zheng node->lowest = 1; 6905d4f98a2SYan Zheng cur = node; 6915d4f98a2SYan Zheng again: 6925d4f98a2SYan Zheng end = 0; 6935d4f98a2SYan Zheng ptr = 0; 6945d4f98a2SYan Zheng key.objectid = cur->bytenr; 6953173a18fSJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 6965d4f98a2SYan Zheng key.offset = (u64)-1; 6975d4f98a2SYan Zheng 6985d4f98a2SYan Zheng path1->search_commit_root = 1; 6995d4f98a2SYan Zheng path1->skip_locking = 1; 7005d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1, 7015d4f98a2SYan Zheng 0, 0); 7025d4f98a2SYan Zheng if (ret < 0) { 7035d4f98a2SYan Zheng err = ret; 7045d4f98a2SYan Zheng goto out; 7055d4f98a2SYan Zheng } 70675bfb9afSJosef Bacik ASSERT(ret); 70775bfb9afSJosef Bacik ASSERT(path1->slots[0]); 7085d4f98a2SYan Zheng 7095d4f98a2SYan Zheng path1->slots[0]--; 7105d4f98a2SYan Zheng 7115d4f98a2SYan Zheng WARN_ON(cur->checked); 7125d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 7135d4f98a2SYan Zheng /* 71470f23fd6SJustin P. Mattock * the backref was added previously when processing 7155d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 7165d4f98a2SYan Zheng */ 71775bfb9afSJosef Bacik ASSERT(list_is_singular(&cur->upper)); 7185d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 7195d4f98a2SYan Zheng list[LOWER]); 72075bfb9afSJosef Bacik ASSERT(list_empty(&edge->list[UPPER])); 7215d4f98a2SYan Zheng exist = edge->node[UPPER]; 7225d4f98a2SYan Zheng /* 7235d4f98a2SYan Zheng * add the upper level block to pending list if we need 7245d4f98a2SYan Zheng * check its backrefs 7255d4f98a2SYan Zheng */ 7265d4f98a2SYan Zheng if (!exist->checked) 7275d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 7285d4f98a2SYan Zheng } else { 7295d4f98a2SYan Zheng exist = NULL; 7305d4f98a2SYan Zheng } 7315d4f98a2SYan Zheng 7325d4f98a2SYan Zheng while (1) { 7335d4f98a2SYan Zheng cond_resched(); 7345d4f98a2SYan Zheng eb = path1->nodes[0]; 7355d4f98a2SYan Zheng 7365d4f98a2SYan Zheng if (ptr >= end) { 7375d4f98a2SYan Zheng if (path1->slots[0] >= btrfs_header_nritems(eb)) { 7385d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path1); 7395d4f98a2SYan Zheng if (ret < 0) { 7405d4f98a2SYan Zheng err = ret; 7415d4f98a2SYan Zheng goto out; 7425d4f98a2SYan Zheng } 7435d4f98a2SYan Zheng if (ret > 0) 7445d4f98a2SYan Zheng break; 7455d4f98a2SYan Zheng eb = path1->nodes[0]; 7465d4f98a2SYan Zheng } 7475d4f98a2SYan Zheng 7485d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path1->slots[0]); 7495d4f98a2SYan Zheng if (key.objectid != cur->bytenr) { 7505d4f98a2SYan Zheng WARN_ON(exist); 7515d4f98a2SYan Zheng break; 7525d4f98a2SYan Zheng } 7535d4f98a2SYan Zheng 7543173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY || 7553173a18fSJosef Bacik key.type == BTRFS_METADATA_ITEM_KEY) { 7565d4f98a2SYan Zheng ret = find_inline_backref(eb, path1->slots[0], 7575d4f98a2SYan Zheng &ptr, &end); 7585d4f98a2SYan Zheng if (ret) 7595d4f98a2SYan Zheng goto next; 7605d4f98a2SYan Zheng } 7615d4f98a2SYan Zheng } 7625d4f98a2SYan Zheng 7635d4f98a2SYan Zheng if (ptr < end) { 7645d4f98a2SYan Zheng /* update key for inline back ref */ 7655d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 7663de28d57SLiu Bo int type; 7675d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 7683de28d57SLiu Bo type = btrfs_get_extent_inline_ref_type(eb, iref, 7693de28d57SLiu Bo BTRFS_REF_TYPE_BLOCK); 7703de28d57SLiu Bo if (type == BTRFS_REF_TYPE_INVALID) { 771af431dcbSSu Yue err = -EUCLEAN; 7723de28d57SLiu Bo goto out; 7733de28d57SLiu Bo } 7743de28d57SLiu Bo key.type = type; 7755d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 7763de28d57SLiu Bo 7775d4f98a2SYan Zheng WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY && 7785d4f98a2SYan Zheng key.type != BTRFS_SHARED_BLOCK_REF_KEY); 7795d4f98a2SYan Zheng } 7805d4f98a2SYan Zheng 7815d4f98a2SYan Zheng if (exist && 7825d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 7835d4f98a2SYan Zheng exist->owner == key.offset) || 7845d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 7855d4f98a2SYan Zheng exist->bytenr == key.offset))) { 7865d4f98a2SYan Zheng exist = NULL; 7875d4f98a2SYan Zheng goto next; 7885d4f98a2SYan Zheng } 7895d4f98a2SYan Zheng 7905d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 7915d4f98a2SYan Zheng if (key.objectid == key.offset) { 7925d4f98a2SYan Zheng /* 7935d4f98a2SYan Zheng * only root blocks of reloc trees use 7945d4f98a2SYan Zheng * backref of this type. 7955d4f98a2SYan Zheng */ 7965d4f98a2SYan Zheng root = find_reloc_root(rc, cur->bytenr); 79775bfb9afSJosef Bacik ASSERT(root); 7985d4f98a2SYan Zheng cur->root = root; 7995d4f98a2SYan Zheng break; 8005d4f98a2SYan Zheng } 8015d4f98a2SYan Zheng 8023fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 8035d4f98a2SYan Zheng if (!edge) { 8045d4f98a2SYan Zheng err = -ENOMEM; 8055d4f98a2SYan Zheng goto out; 8065d4f98a2SYan Zheng } 8075d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, key.offset); 8085d4f98a2SYan Zheng if (!rb_node) { 8093fd0a558SYan, Zheng upper = alloc_backref_node(cache); 8105d4f98a2SYan Zheng if (!upper) { 8113fd0a558SYan, Zheng free_backref_edge(cache, edge); 8125d4f98a2SYan Zheng err = -ENOMEM; 8135d4f98a2SYan Zheng goto out; 8145d4f98a2SYan Zheng } 8155d4f98a2SYan Zheng upper->bytenr = key.offset; 8165d4f98a2SYan Zheng upper->level = cur->level + 1; 8175d4f98a2SYan Zheng /* 8185d4f98a2SYan Zheng * backrefs for the upper level block isn't 8195d4f98a2SYan Zheng * cached, add the block to pending list 8205d4f98a2SYan Zheng */ 8215d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 8225d4f98a2SYan Zheng } else { 8235d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 8245d4f98a2SYan Zheng rb_node); 82575bfb9afSJosef Bacik ASSERT(upper->checked); 8265d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 8275d4f98a2SYan Zheng } 8283fd0a558SYan, Zheng list_add_tail(&edge->list[LOWER], &cur->upper); 8295d4f98a2SYan Zheng edge->node[LOWER] = cur; 8303fd0a558SYan, Zheng edge->node[UPPER] = upper; 8315d4f98a2SYan Zheng 8325d4f98a2SYan Zheng goto next; 833*ba3c2b19SNikolay Borisov } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) { 834*ba3c2b19SNikolay Borisov err = -EINVAL; 835*ba3c2b19SNikolay Borisov btrfs_print_v0_err(rc->extent_root->fs_info); 836*ba3c2b19SNikolay Borisov btrfs_handle_fs_error(rc->extent_root->fs_info, err, 837*ba3c2b19SNikolay Borisov NULL); 838*ba3c2b19SNikolay Borisov goto out; 8395d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 8405d4f98a2SYan Zheng goto next; 8415d4f98a2SYan Zheng } 8425d4f98a2SYan Zheng 8435d4f98a2SYan Zheng /* key.type == BTRFS_TREE_BLOCK_REF_KEY */ 8445d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, key.offset); 8455d4f98a2SYan Zheng if (IS_ERR(root)) { 8465d4f98a2SYan Zheng err = PTR_ERR(root); 8475d4f98a2SYan Zheng goto out; 8485d4f98a2SYan Zheng } 8495d4f98a2SYan Zheng 85027cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 8513fd0a558SYan, Zheng cur->cowonly = 1; 8523fd0a558SYan, Zheng 8535d4f98a2SYan Zheng if (btrfs_root_level(&root->root_item) == cur->level) { 8545d4f98a2SYan Zheng /* tree root */ 85575bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 8565d4f98a2SYan Zheng cur->bytenr); 8573fd0a558SYan, Zheng if (should_ignore_root(root)) 8583fd0a558SYan, Zheng list_add(&cur->list, &useless); 8593fd0a558SYan, Zheng else 8605d4f98a2SYan Zheng cur->root = root; 8615d4f98a2SYan Zheng break; 8625d4f98a2SYan Zheng } 8635d4f98a2SYan Zheng 8645d4f98a2SYan Zheng level = cur->level + 1; 8655d4f98a2SYan Zheng 8665d4f98a2SYan Zheng /* 8675d4f98a2SYan Zheng * searching the tree to find upper level blocks 8685d4f98a2SYan Zheng * reference the block. 8695d4f98a2SYan Zheng */ 8705d4f98a2SYan Zheng path2->search_commit_root = 1; 8715d4f98a2SYan Zheng path2->skip_locking = 1; 8725d4f98a2SYan Zheng path2->lowest_level = level; 8735d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0); 8745d4f98a2SYan Zheng path2->lowest_level = 0; 8755d4f98a2SYan Zheng if (ret < 0) { 8765d4f98a2SYan Zheng err = ret; 8775d4f98a2SYan Zheng goto out; 8785d4f98a2SYan Zheng } 87933c66f43SYan Zheng if (ret > 0 && path2->slots[level] > 0) 88033c66f43SYan Zheng path2->slots[level]--; 8815d4f98a2SYan Zheng 8825d4f98a2SYan Zheng eb = path2->nodes[level]; 8833561b9dbSLiu Bo if (btrfs_node_blockptr(eb, path2->slots[level]) != 8843561b9dbSLiu Bo cur->bytenr) { 8853561b9dbSLiu Bo btrfs_err(root->fs_info, 8863561b9dbSLiu Bo "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)", 8873561b9dbSLiu Bo cur->bytenr, level - 1, root->objectid, 8883561b9dbSLiu Bo node_key->objectid, node_key->type, 8893561b9dbSLiu Bo node_key->offset); 8903561b9dbSLiu Bo err = -ENOENT; 8913561b9dbSLiu Bo goto out; 8923561b9dbSLiu Bo } 8935d4f98a2SYan Zheng lower = cur; 894b6c60c80SJosef Bacik need_check = true; 8955d4f98a2SYan Zheng for (; level < BTRFS_MAX_LEVEL; level++) { 8965d4f98a2SYan Zheng if (!path2->nodes[level]) { 89775bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 8985d4f98a2SYan Zheng lower->bytenr); 8993fd0a558SYan, Zheng if (should_ignore_root(root)) 9003fd0a558SYan, Zheng list_add(&lower->list, &useless); 9013fd0a558SYan, Zheng else 9025d4f98a2SYan Zheng lower->root = root; 9035d4f98a2SYan Zheng break; 9045d4f98a2SYan Zheng } 9055d4f98a2SYan Zheng 9063fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 9075d4f98a2SYan Zheng if (!edge) { 9085d4f98a2SYan Zheng err = -ENOMEM; 9095d4f98a2SYan Zheng goto out; 9105d4f98a2SYan Zheng } 9115d4f98a2SYan Zheng 9125d4f98a2SYan Zheng eb = path2->nodes[level]; 9135d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, eb->start); 9145d4f98a2SYan Zheng if (!rb_node) { 9153fd0a558SYan, Zheng upper = alloc_backref_node(cache); 9165d4f98a2SYan Zheng if (!upper) { 9173fd0a558SYan, Zheng free_backref_edge(cache, edge); 9185d4f98a2SYan Zheng err = -ENOMEM; 9195d4f98a2SYan Zheng goto out; 9205d4f98a2SYan Zheng } 9215d4f98a2SYan Zheng upper->bytenr = eb->start; 9225d4f98a2SYan Zheng upper->owner = btrfs_header_owner(eb); 9235d4f98a2SYan Zheng upper->level = lower->level + 1; 92427cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, 92527cdeb70SMiao Xie &root->state)) 9263fd0a558SYan, Zheng upper->cowonly = 1; 9275d4f98a2SYan Zheng 9285d4f98a2SYan Zheng /* 9295d4f98a2SYan Zheng * if we know the block isn't shared 9305d4f98a2SYan Zheng * we can void checking its backrefs. 9315d4f98a2SYan Zheng */ 9325d4f98a2SYan Zheng if (btrfs_block_can_be_shared(root, eb)) 9335d4f98a2SYan Zheng upper->checked = 0; 9345d4f98a2SYan Zheng else 9355d4f98a2SYan Zheng upper->checked = 1; 9365d4f98a2SYan Zheng 9375d4f98a2SYan Zheng /* 9385d4f98a2SYan Zheng * add the block to pending list if we 939b6c60c80SJosef Bacik * need check its backrefs, we only do this once 940b6c60c80SJosef Bacik * while walking up a tree as we will catch 941b6c60c80SJosef Bacik * anything else later on. 9425d4f98a2SYan Zheng */ 943b6c60c80SJosef Bacik if (!upper->checked && need_check) { 944b6c60c80SJosef Bacik need_check = false; 9455d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], 9465d4f98a2SYan Zheng &list); 947bbe90514SJosef Bacik } else { 948bbe90514SJosef Bacik if (upper->checked) 949bbe90514SJosef Bacik need_check = true; 9505d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 951bbe90514SJosef Bacik } 9525d4f98a2SYan Zheng } else { 9535d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 9545d4f98a2SYan Zheng rb_node); 95575bfb9afSJosef Bacik ASSERT(upper->checked); 9565d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 9573fd0a558SYan, Zheng if (!upper->owner) 9583fd0a558SYan, Zheng upper->owner = btrfs_header_owner(eb); 9595d4f98a2SYan Zheng } 9605d4f98a2SYan Zheng list_add_tail(&edge->list[LOWER], &lower->upper); 9615d4f98a2SYan Zheng edge->node[LOWER] = lower; 9623fd0a558SYan, Zheng edge->node[UPPER] = upper; 9635d4f98a2SYan Zheng 9645d4f98a2SYan Zheng if (rb_node) 9655d4f98a2SYan Zheng break; 9665d4f98a2SYan Zheng lower = upper; 9675d4f98a2SYan Zheng upper = NULL; 9685d4f98a2SYan Zheng } 969b3b4aa74SDavid Sterba btrfs_release_path(path2); 9705d4f98a2SYan Zheng next: 9715d4f98a2SYan Zheng if (ptr < end) { 9725d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 9735d4f98a2SYan Zheng if (ptr >= end) { 9745d4f98a2SYan Zheng WARN_ON(ptr > end); 9755d4f98a2SYan Zheng ptr = 0; 9765d4f98a2SYan Zheng end = 0; 9775d4f98a2SYan Zheng } 9785d4f98a2SYan Zheng } 9795d4f98a2SYan Zheng if (ptr >= end) 9805d4f98a2SYan Zheng path1->slots[0]++; 9815d4f98a2SYan Zheng } 982b3b4aa74SDavid Sterba btrfs_release_path(path1); 9835d4f98a2SYan Zheng 9845d4f98a2SYan Zheng cur->checked = 1; 9855d4f98a2SYan Zheng WARN_ON(exist); 9865d4f98a2SYan Zheng 9875d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 9885d4f98a2SYan Zheng if (!list_empty(&list)) { 9895d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 9905d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 9915d4f98a2SYan Zheng cur = edge->node[UPPER]; 9925d4f98a2SYan Zheng goto again; 9935d4f98a2SYan Zheng } 9945d4f98a2SYan Zheng 9955d4f98a2SYan Zheng /* 9965d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 9975d4f98a2SYan Zheng * into the cache. 9985d4f98a2SYan Zheng */ 99975bfb9afSJosef Bacik ASSERT(node->checked); 10003fd0a558SYan, Zheng cowonly = node->cowonly; 10013fd0a558SYan, Zheng if (!cowonly) { 10023fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 10033fd0a558SYan, Zheng &node->rb_node); 100443c04fb1SJeff Mahoney if (rb_node) 100543c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 10063fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 10073fd0a558SYan, Zheng } 10085d4f98a2SYan Zheng 10095d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 10105d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10115d4f98a2SYan Zheng 10125d4f98a2SYan Zheng while (!list_empty(&list)) { 10135d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10145d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10155d4f98a2SYan Zheng upper = edge->node[UPPER]; 10163fd0a558SYan, Zheng if (upper->detached) { 10173fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10183fd0a558SYan, Zheng lower = edge->node[LOWER]; 10193fd0a558SYan, Zheng free_backref_edge(cache, edge); 10203fd0a558SYan, Zheng if (list_empty(&lower->upper)) 10213fd0a558SYan, Zheng list_add(&lower->list, &useless); 10223fd0a558SYan, Zheng continue; 10233fd0a558SYan, Zheng } 10245d4f98a2SYan Zheng 10255d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 10265d4f98a2SYan Zheng if (upper->lowest) { 10275d4f98a2SYan Zheng list_del_init(&upper->lower); 10285d4f98a2SYan Zheng upper->lowest = 0; 10295d4f98a2SYan Zheng } 10305d4f98a2SYan Zheng 10315d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10325d4f98a2SYan Zheng continue; 10335d4f98a2SYan Zheng } 10345d4f98a2SYan Zheng 103575bfb9afSJosef Bacik if (!upper->checked) { 103675bfb9afSJosef Bacik /* 103775bfb9afSJosef Bacik * Still want to blow up for developers since this is a 103875bfb9afSJosef Bacik * logic bug. 103975bfb9afSJosef Bacik */ 104075bfb9afSJosef Bacik ASSERT(0); 104175bfb9afSJosef Bacik err = -EINVAL; 104275bfb9afSJosef Bacik goto out; 104375bfb9afSJosef Bacik } 104475bfb9afSJosef Bacik if (cowonly != upper->cowonly) { 104575bfb9afSJosef Bacik ASSERT(0); 104675bfb9afSJosef Bacik err = -EINVAL; 104775bfb9afSJosef Bacik goto out; 104875bfb9afSJosef Bacik } 104975bfb9afSJosef Bacik 10503fd0a558SYan, Zheng if (!cowonly) { 10515d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 10525d4f98a2SYan Zheng &upper->rb_node); 105343c04fb1SJeff Mahoney if (rb_node) 105443c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 105543c04fb1SJeff Mahoney upper->bytenr); 10563fd0a558SYan, Zheng } 10575d4f98a2SYan Zheng 10585d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10595d4f98a2SYan Zheng 10605d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 10615d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10625d4f98a2SYan Zheng } 10633fd0a558SYan, Zheng /* 10643fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 10653fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 10663fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 10673fd0a558SYan, Zheng * lookup. 10683fd0a558SYan, Zheng */ 10693fd0a558SYan, Zheng while (!list_empty(&useless)) { 10703fd0a558SYan, Zheng upper = list_entry(useless.next, struct backref_node, list); 10713fd0a558SYan, Zheng list_del_init(&upper->list); 107275bfb9afSJosef Bacik ASSERT(list_empty(&upper->upper)); 10733fd0a558SYan, Zheng if (upper == node) 10743fd0a558SYan, Zheng node = NULL; 10753fd0a558SYan, Zheng if (upper->lowest) { 10763fd0a558SYan, Zheng list_del_init(&upper->lower); 10773fd0a558SYan, Zheng upper->lowest = 0; 10783fd0a558SYan, Zheng } 10793fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 10803fd0a558SYan, Zheng edge = list_entry(upper->lower.next, 10813fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 10823fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 10833fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10843fd0a558SYan, Zheng lower = edge->node[LOWER]; 10853fd0a558SYan, Zheng free_backref_edge(cache, edge); 10863fd0a558SYan, Zheng 10873fd0a558SYan, Zheng if (list_empty(&lower->upper)) 10883fd0a558SYan, Zheng list_add(&lower->list, &useless); 10893fd0a558SYan, Zheng } 10903fd0a558SYan, Zheng __mark_block_processed(rc, upper); 10913fd0a558SYan, Zheng if (upper->level > 0) { 10923fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 10933fd0a558SYan, Zheng upper->detached = 1; 10943fd0a558SYan, Zheng } else { 10953fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 10963fd0a558SYan, Zheng free_backref_node(cache, upper); 10973fd0a558SYan, Zheng } 10983fd0a558SYan, Zheng } 10995d4f98a2SYan Zheng out: 11005d4f98a2SYan Zheng btrfs_free_path(path1); 11015d4f98a2SYan Zheng btrfs_free_path(path2); 11025d4f98a2SYan Zheng if (err) { 11033fd0a558SYan, Zheng while (!list_empty(&useless)) { 11043fd0a558SYan, Zheng lower = list_entry(useless.next, 110575bfb9afSJosef Bacik struct backref_node, list); 110675bfb9afSJosef Bacik list_del_init(&lower->list); 11073fd0a558SYan, Zheng } 110875bfb9afSJosef Bacik while (!list_empty(&list)) { 110975bfb9afSJosef Bacik edge = list_first_entry(&list, struct backref_edge, 111075bfb9afSJosef Bacik list[UPPER]); 111175bfb9afSJosef Bacik list_del(&edge->list[UPPER]); 11123fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 111375bfb9afSJosef Bacik lower = edge->node[LOWER]; 11145d4f98a2SYan Zheng upper = edge->node[UPPER]; 11153fd0a558SYan, Zheng free_backref_edge(cache, edge); 111675bfb9afSJosef Bacik 111775bfb9afSJosef Bacik /* 111875bfb9afSJosef Bacik * Lower is no longer linked to any upper backref nodes 111975bfb9afSJosef Bacik * and isn't in the cache, we can free it ourselves. 112075bfb9afSJosef Bacik */ 112175bfb9afSJosef Bacik if (list_empty(&lower->upper) && 112275bfb9afSJosef Bacik RB_EMPTY_NODE(&lower->rb_node)) 112375bfb9afSJosef Bacik list_add(&lower->list, &useless); 112475bfb9afSJosef Bacik 112575bfb9afSJosef Bacik if (!RB_EMPTY_NODE(&upper->rb_node)) 112675bfb9afSJosef Bacik continue; 112775bfb9afSJosef Bacik 112801327610SNicholas D Steeves /* Add this guy's upper edges to the list to process */ 112975bfb9afSJosef Bacik list_for_each_entry(edge, &upper->upper, list[LOWER]) 113075bfb9afSJosef Bacik list_add_tail(&edge->list[UPPER], &list); 113175bfb9afSJosef Bacik if (list_empty(&upper->upper)) 113275bfb9afSJosef Bacik list_add(&upper->list, &useless); 113375bfb9afSJosef Bacik } 113475bfb9afSJosef Bacik 113575bfb9afSJosef Bacik while (!list_empty(&useless)) { 113675bfb9afSJosef Bacik lower = list_entry(useless.next, 113775bfb9afSJosef Bacik struct backref_node, list); 113875bfb9afSJosef Bacik list_del_init(&lower->list); 11390fd8c3daSLiu Bo if (lower == node) 11400fd8c3daSLiu Bo node = NULL; 114175bfb9afSJosef Bacik free_backref_node(cache, lower); 11425d4f98a2SYan Zheng } 11430fd8c3daSLiu Bo 11440fd8c3daSLiu Bo free_backref_node(cache, node); 11455d4f98a2SYan Zheng return ERR_PTR(err); 11465d4f98a2SYan Zheng } 114775bfb9afSJosef Bacik ASSERT(!node || !node->detached); 11485d4f98a2SYan Zheng return node; 11495d4f98a2SYan Zheng } 11505d4f98a2SYan Zheng 11515d4f98a2SYan Zheng /* 11523fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 11533fd0a558SYan, Zheng * the backref node is created by cloning backref node that 11543fd0a558SYan, Zheng * corresponds to root of source tree 11553fd0a558SYan, Zheng */ 11563fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 11573fd0a558SYan, Zheng struct reloc_control *rc, 11583fd0a558SYan, Zheng struct btrfs_root *src, 11593fd0a558SYan, Zheng struct btrfs_root *dest) 11603fd0a558SYan, Zheng { 11613fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 11623fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 11633fd0a558SYan, Zheng struct backref_node *node = NULL; 11643fd0a558SYan, Zheng struct backref_node *new_node; 11653fd0a558SYan, Zheng struct backref_edge *edge; 11663fd0a558SYan, Zheng struct backref_edge *new_edge; 11673fd0a558SYan, Zheng struct rb_node *rb_node; 11683fd0a558SYan, Zheng 11693fd0a558SYan, Zheng if (cache->last_trans > 0) 11703fd0a558SYan, Zheng update_backref_cache(trans, cache); 11713fd0a558SYan, Zheng 11723fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 11733fd0a558SYan, Zheng if (rb_node) { 11743fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 11753fd0a558SYan, Zheng if (node->detached) 11763fd0a558SYan, Zheng node = NULL; 11773fd0a558SYan, Zheng else 11783fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 11793fd0a558SYan, Zheng } 11803fd0a558SYan, Zheng 11813fd0a558SYan, Zheng if (!node) { 11823fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 11833fd0a558SYan, Zheng reloc_root->commit_root->start); 11843fd0a558SYan, Zheng if (rb_node) { 11853fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 11863fd0a558SYan, Zheng rb_node); 11873fd0a558SYan, Zheng BUG_ON(node->detached); 11883fd0a558SYan, Zheng } 11893fd0a558SYan, Zheng } 11903fd0a558SYan, Zheng 11913fd0a558SYan, Zheng if (!node) 11923fd0a558SYan, Zheng return 0; 11933fd0a558SYan, Zheng 11943fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 11953fd0a558SYan, Zheng if (!new_node) 11963fd0a558SYan, Zheng return -ENOMEM; 11973fd0a558SYan, Zheng 11983fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 11993fd0a558SYan, Zheng new_node->level = node->level; 12003fd0a558SYan, Zheng new_node->lowest = node->lowest; 12016848ad64SYan, Zheng new_node->checked = 1; 12023fd0a558SYan, Zheng new_node->root = dest; 12033fd0a558SYan, Zheng 12043fd0a558SYan, Zheng if (!node->lowest) { 12053fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 12063fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 12073fd0a558SYan, Zheng if (!new_edge) 12083fd0a558SYan, Zheng goto fail; 12093fd0a558SYan, Zheng 12103fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 12113fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 12123fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 12133fd0a558SYan, Zheng &new_node->lower); 12143fd0a558SYan, Zheng } 121576b9e23dSMiao Xie } else { 121676b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 12173fd0a558SYan, Zheng } 12183fd0a558SYan, Zheng 12193fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 12203fd0a558SYan, Zheng &new_node->rb_node); 122143c04fb1SJeff Mahoney if (rb_node) 122243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 12233fd0a558SYan, Zheng 12243fd0a558SYan, Zheng if (!new_node->lowest) { 12253fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 12263fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 12273fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 12283fd0a558SYan, Zheng } 12293fd0a558SYan, Zheng } 12303fd0a558SYan, Zheng return 0; 12313fd0a558SYan, Zheng fail: 12323fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 12333fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 12343fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 12353fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 12363fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 12373fd0a558SYan, Zheng } 12383fd0a558SYan, Zheng free_backref_node(cache, new_node); 12393fd0a558SYan, Zheng return -ENOMEM; 12403fd0a558SYan, Zheng } 12413fd0a558SYan, Zheng 12423fd0a558SYan, Zheng /* 12435d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 12445d4f98a2SYan Zheng */ 1245ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 12465d4f98a2SYan Zheng { 12470b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 12485d4f98a2SYan Zheng struct rb_node *rb_node; 12495d4f98a2SYan Zheng struct mapping_node *node; 12500b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 12515d4f98a2SYan Zheng 12525d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1253ffd7b339SJeff Mahoney if (!node) 1254ffd7b339SJeff Mahoney return -ENOMEM; 12555d4f98a2SYan Zheng 12565d4f98a2SYan Zheng node->bytenr = root->node->start; 12575d4f98a2SYan Zheng node->data = root; 12585d4f98a2SYan Zheng 12595d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12605d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 12615d4f98a2SYan Zheng node->bytenr, &node->rb_node); 12625d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1263ffd7b339SJeff Mahoney if (rb_node) { 12640b246afaSJeff Mahoney btrfs_panic(fs_info, -EEXIST, 12655d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 12665d163e0eSJeff Mahoney node->bytenr); 1267ffd7b339SJeff Mahoney } 12685d4f98a2SYan Zheng 12695d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 12705d4f98a2SYan Zheng return 0; 12715d4f98a2SYan Zheng } 12725d4f98a2SYan Zheng 12735d4f98a2SYan Zheng /* 1274c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 12755d4f98a2SYan Zheng * mapping 12765d4f98a2SYan Zheng */ 1277c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 12785d4f98a2SYan Zheng { 12790b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 12805d4f98a2SYan Zheng struct rb_node *rb_node; 12815d4f98a2SYan Zheng struct mapping_node *node = NULL; 12820b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 12835d4f98a2SYan Zheng 12845d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12855d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1286c974c464SWang Shilong root->node->start); 1287c974c464SWang Shilong if (rb_node) { 1288c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1289c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1290c974c464SWang Shilong } 1291c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1292c974c464SWang Shilong 1293c974c464SWang Shilong if (!node) 1294c974c464SWang Shilong return; 1295c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1296c974c464SWang Shilong 12970b246afaSJeff Mahoney spin_lock(&fs_info->trans_lock); 1298c974c464SWang Shilong list_del_init(&root->root_list); 12990b246afaSJeff Mahoney spin_unlock(&fs_info->trans_lock); 1300c974c464SWang Shilong kfree(node); 1301c974c464SWang Shilong } 1302c974c464SWang Shilong 1303c974c464SWang Shilong /* 1304c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1305c974c464SWang Shilong * mapping 1306c974c464SWang Shilong */ 1307c974c464SWang Shilong static int __update_reloc_root(struct btrfs_root *root, u64 new_bytenr) 1308c974c464SWang Shilong { 13090b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 1310c974c464SWang Shilong struct rb_node *rb_node; 1311c974c464SWang Shilong struct mapping_node *node = NULL; 13120b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1313c974c464SWang Shilong 1314c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1315c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1316c974c464SWang Shilong root->node->start); 13175d4f98a2SYan Zheng if (rb_node) { 13185d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 13195d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 13205d4f98a2SYan Zheng } 13215d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 13225d4f98a2SYan Zheng 13238f71f3e0SLiu Bo if (!node) 13248f71f3e0SLiu Bo return 0; 13255d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 13265d4f98a2SYan Zheng 13275d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1328c974c464SWang Shilong node->bytenr = new_bytenr; 13295d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13305d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13315d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 133243c04fb1SJeff Mahoney if (rb_node) 133343c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 13345d4f98a2SYan Zheng return 0; 13355d4f98a2SYan Zheng } 13365d4f98a2SYan Zheng 13373fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 13383fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 13395d4f98a2SYan Zheng { 13400b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 13415d4f98a2SYan Zheng struct btrfs_root *reloc_root; 13425d4f98a2SYan Zheng struct extent_buffer *eb; 13435d4f98a2SYan Zheng struct btrfs_root_item *root_item; 13445d4f98a2SYan Zheng struct btrfs_key root_key; 13455d4f98a2SYan Zheng int ret; 13465d4f98a2SYan Zheng 13475d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 13485d4f98a2SYan Zheng BUG_ON(!root_item); 13495d4f98a2SYan Zheng 13505d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 13515d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 13523fd0a558SYan, Zheng root_key.offset = objectid; 13535d4f98a2SYan Zheng 13543fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 1355054570a1SFilipe Manana u64 commit_root_gen; 1356054570a1SFilipe Manana 13573fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 13585d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 13595d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 13605d4f98a2SYan Zheng BUG_ON(ret); 1361054570a1SFilipe Manana /* 1362054570a1SFilipe Manana * Set the last_snapshot field to the generation of the commit 1363054570a1SFilipe Manana * root - like this ctree.c:btrfs_block_can_be_shared() behaves 1364054570a1SFilipe Manana * correctly (returns true) when the relocation root is created 1365054570a1SFilipe Manana * either inside the critical section of a transaction commit 1366054570a1SFilipe Manana * (through transaction.c:qgroup_account_snapshot()) and when 1367054570a1SFilipe Manana * it's created before the transaction commit is started. 1368054570a1SFilipe Manana */ 1369054570a1SFilipe Manana commit_root_gen = btrfs_header_generation(root->commit_root); 1370054570a1SFilipe Manana btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); 13713fd0a558SYan, Zheng } else { 13723fd0a558SYan, Zheng /* 13733fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 13743fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 13753fd0a558SYan, Zheng * modified after it was created have RELOC flag 13763fd0a558SYan, Zheng * set in their headers. so it's OK to not update 13773fd0a558SYan, Zheng * the 'last_snapshot'. 13783fd0a558SYan, Zheng */ 13793fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 13803fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 13813fd0a558SYan, Zheng BUG_ON(ret); 13823fd0a558SYan, Zheng } 13833fd0a558SYan, Zheng 13845d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 13855d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 13865d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 13875d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 13883fd0a558SYan, Zheng 13893fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 13903fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 13913fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 13923fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 13935d4f98a2SYan Zheng root_item->drop_level = 0; 13943fd0a558SYan, Zheng } 13955d4f98a2SYan Zheng 13965d4f98a2SYan Zheng btrfs_tree_unlock(eb); 13975d4f98a2SYan Zheng free_extent_buffer(eb); 13985d4f98a2SYan Zheng 13990b246afaSJeff Mahoney ret = btrfs_insert_root(trans, fs_info->tree_root, 14005d4f98a2SYan Zheng &root_key, root_item); 14015d4f98a2SYan Zheng BUG_ON(ret); 14025d4f98a2SYan Zheng kfree(root_item); 14035d4f98a2SYan Zheng 14040b246afaSJeff Mahoney reloc_root = btrfs_read_fs_root(fs_info->tree_root, &root_key); 14055d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 14065d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 14073fd0a558SYan, Zheng return reloc_root; 14083fd0a558SYan, Zheng } 14093fd0a558SYan, Zheng 14103fd0a558SYan, Zheng /* 14113fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 14123fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 14133fd0a558SYan, Zheng */ 14143fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 14153fd0a558SYan, Zheng struct btrfs_root *root) 14163fd0a558SYan, Zheng { 14170b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14183fd0a558SYan, Zheng struct btrfs_root *reloc_root; 14190b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 142020dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 14213fd0a558SYan, Zheng int clear_rsv = 0; 1422ffd7b339SJeff Mahoney int ret; 14233fd0a558SYan, Zheng 14243fd0a558SYan, Zheng if (root->reloc_root) { 14253fd0a558SYan, Zheng reloc_root = root->reloc_root; 14263fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 14273fd0a558SYan, Zheng return 0; 14283fd0a558SYan, Zheng } 14293fd0a558SYan, Zheng 14303fd0a558SYan, Zheng if (!rc || !rc->create_reloc_tree || 14313fd0a558SYan, Zheng root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 14323fd0a558SYan, Zheng return 0; 14333fd0a558SYan, Zheng 143420dd2cbfSMiao Xie if (!trans->reloc_reserved) { 143520dd2cbfSMiao Xie rsv = trans->block_rsv; 14363fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 14373fd0a558SYan, Zheng clear_rsv = 1; 14383fd0a558SYan, Zheng } 14393fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 14403fd0a558SYan, Zheng if (clear_rsv) 144120dd2cbfSMiao Xie trans->block_rsv = rsv; 14425d4f98a2SYan Zheng 1443ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1444ffd7b339SJeff Mahoney BUG_ON(ret < 0); 14455d4f98a2SYan Zheng root->reloc_root = reloc_root; 14465d4f98a2SYan Zheng return 0; 14475d4f98a2SYan Zheng } 14485d4f98a2SYan Zheng 14495d4f98a2SYan Zheng /* 14505d4f98a2SYan Zheng * update root item of reloc tree 14515d4f98a2SYan Zheng */ 14525d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 14535d4f98a2SYan Zheng struct btrfs_root *root) 14545d4f98a2SYan Zheng { 14550b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14565d4f98a2SYan Zheng struct btrfs_root *reloc_root; 14575d4f98a2SYan Zheng struct btrfs_root_item *root_item; 14585d4f98a2SYan Zheng int ret; 14595d4f98a2SYan Zheng 14605d4f98a2SYan Zheng if (!root->reloc_root) 14617585717fSChris Mason goto out; 14625d4f98a2SYan Zheng 14635d4f98a2SYan Zheng reloc_root = root->reloc_root; 14645d4f98a2SYan Zheng root_item = &reloc_root->root_item; 14655d4f98a2SYan Zheng 14660b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 14673fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 14685d4f98a2SYan Zheng root->reloc_root = NULL; 1469c974c464SWang Shilong __del_reloc_root(reloc_root); 14705d4f98a2SYan Zheng } 14715d4f98a2SYan Zheng 14725d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 14735d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 14745d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 14755d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 14765d4f98a2SYan Zheng } 14775d4f98a2SYan Zheng 14780b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 14795d4f98a2SYan Zheng &reloc_root->root_key, root_item); 14805d4f98a2SYan Zheng BUG_ON(ret); 14817585717fSChris Mason 14827585717fSChris Mason out: 14835d4f98a2SYan Zheng return 0; 14845d4f98a2SYan Zheng } 14855d4f98a2SYan Zheng 14865d4f98a2SYan Zheng /* 14875d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 14885d4f98a2SYan Zheng * in a subvolume 14895d4f98a2SYan Zheng */ 14905d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 14915d4f98a2SYan Zheng { 14925d4f98a2SYan Zheng struct rb_node *node; 14935d4f98a2SYan Zheng struct rb_node *prev; 14945d4f98a2SYan Zheng struct btrfs_inode *entry; 14955d4f98a2SYan Zheng struct inode *inode; 14965d4f98a2SYan Zheng 14975d4f98a2SYan Zheng spin_lock(&root->inode_lock); 14985d4f98a2SYan Zheng again: 14995d4f98a2SYan Zheng node = root->inode_tree.rb_node; 15005d4f98a2SYan Zheng prev = NULL; 15015d4f98a2SYan Zheng while (node) { 15025d4f98a2SYan Zheng prev = node; 15035d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 15045d4f98a2SYan Zheng 15054a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 15065d4f98a2SYan Zheng node = node->rb_left; 15074a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 15085d4f98a2SYan Zheng node = node->rb_right; 15095d4f98a2SYan Zheng else 15105d4f98a2SYan Zheng break; 15115d4f98a2SYan Zheng } 15125d4f98a2SYan Zheng if (!node) { 15135d4f98a2SYan Zheng while (prev) { 15145d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 15154a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 15165d4f98a2SYan Zheng node = prev; 15175d4f98a2SYan Zheng break; 15185d4f98a2SYan Zheng } 15195d4f98a2SYan Zheng prev = rb_next(prev); 15205d4f98a2SYan Zheng } 15215d4f98a2SYan Zheng } 15225d4f98a2SYan Zheng while (node) { 15235d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 15245d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 15255d4f98a2SYan Zheng if (inode) { 15265d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15275d4f98a2SYan Zheng return inode; 15285d4f98a2SYan Zheng } 15295d4f98a2SYan Zheng 15304a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 15315d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 15325d4f98a2SYan Zheng goto again; 15335d4f98a2SYan Zheng 15345d4f98a2SYan Zheng node = rb_next(node); 15355d4f98a2SYan Zheng } 15365d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15375d4f98a2SYan Zheng return NULL; 15385d4f98a2SYan Zheng } 15395d4f98a2SYan Zheng 15405d4f98a2SYan Zheng static int in_block_group(u64 bytenr, 15415d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group) 15425d4f98a2SYan Zheng { 15435d4f98a2SYan Zheng if (bytenr >= block_group->key.objectid && 15445d4f98a2SYan Zheng bytenr < block_group->key.objectid + block_group->key.offset) 15455d4f98a2SYan Zheng return 1; 15465d4f98a2SYan Zheng return 0; 15475d4f98a2SYan Zheng } 15485d4f98a2SYan Zheng 15495d4f98a2SYan Zheng /* 15505d4f98a2SYan Zheng * get new location of data 15515d4f98a2SYan Zheng */ 15525d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 15535d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 15545d4f98a2SYan Zheng { 15555d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 15565d4f98a2SYan Zheng struct btrfs_path *path; 15575d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 15585d4f98a2SYan Zheng struct extent_buffer *leaf; 15595d4f98a2SYan Zheng int ret; 15605d4f98a2SYan Zheng 15615d4f98a2SYan Zheng path = btrfs_alloc_path(); 15625d4f98a2SYan Zheng if (!path) 15635d4f98a2SYan Zheng return -ENOMEM; 15645d4f98a2SYan Zheng 15655d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 1566f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 1567f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 15685d4f98a2SYan Zheng if (ret < 0) 15695d4f98a2SYan Zheng goto out; 15705d4f98a2SYan Zheng if (ret > 0) { 15715d4f98a2SYan Zheng ret = -ENOENT; 15725d4f98a2SYan Zheng goto out; 15735d4f98a2SYan Zheng } 15745d4f98a2SYan Zheng 15755d4f98a2SYan Zheng leaf = path->nodes[0]; 15765d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 15775d4f98a2SYan Zheng struct btrfs_file_extent_item); 15785d4f98a2SYan Zheng 15795d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 15805d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 15815d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 15825d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 15835d4f98a2SYan Zheng 15845d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 158583d4cfd4SJosef Bacik ret = -EINVAL; 15865d4f98a2SYan Zheng goto out; 15875d4f98a2SYan Zheng } 15885d4f98a2SYan Zheng 15895d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 15905d4f98a2SYan Zheng ret = 0; 15915d4f98a2SYan Zheng out: 15925d4f98a2SYan Zheng btrfs_free_path(path); 15935d4f98a2SYan Zheng return ret; 15945d4f98a2SYan Zheng } 15955d4f98a2SYan Zheng 15965d4f98a2SYan Zheng /* 15975d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 15985d4f98a2SYan Zheng * the new locations. 15995d4f98a2SYan Zheng */ 16003fd0a558SYan, Zheng static noinline_for_stack 16013fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 16025d4f98a2SYan Zheng struct reloc_control *rc, 16035d4f98a2SYan Zheng struct btrfs_root *root, 16043fd0a558SYan, Zheng struct extent_buffer *leaf) 16055d4f98a2SYan Zheng { 16060b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 16075d4f98a2SYan Zheng struct btrfs_key key; 16085d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 16095d4f98a2SYan Zheng struct inode *inode = NULL; 16105d4f98a2SYan Zheng u64 parent; 16115d4f98a2SYan Zheng u64 bytenr; 16123fd0a558SYan, Zheng u64 new_bytenr = 0; 16135d4f98a2SYan Zheng u64 num_bytes; 16145d4f98a2SYan Zheng u64 end; 16155d4f98a2SYan Zheng u32 nritems; 16165d4f98a2SYan Zheng u32 i; 161783d4cfd4SJosef Bacik int ret = 0; 16185d4f98a2SYan Zheng int first = 1; 16195d4f98a2SYan Zheng int dirty = 0; 16205d4f98a2SYan Zheng 16215d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 16225d4f98a2SYan Zheng return 0; 16235d4f98a2SYan Zheng 16245d4f98a2SYan Zheng /* reloc trees always use full backref */ 16255d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 16265d4f98a2SYan Zheng parent = leaf->start; 16275d4f98a2SYan Zheng else 16285d4f98a2SYan Zheng parent = 0; 16295d4f98a2SYan Zheng 16305d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 16315d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 16325d4f98a2SYan Zheng cond_resched(); 16335d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 16345d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 16355d4f98a2SYan Zheng continue; 16365d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 16375d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 16385d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 16395d4f98a2SYan Zheng continue; 16405d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16415d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 16425d4f98a2SYan Zheng if (bytenr == 0) 16435d4f98a2SYan Zheng continue; 16445d4f98a2SYan Zheng if (!in_block_group(bytenr, rc->block_group)) 16455d4f98a2SYan Zheng continue; 16465d4f98a2SYan Zheng 16475d4f98a2SYan Zheng /* 16485d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 16495d4f98a2SYan Zheng * to complete and drop the extent cache 16505d4f98a2SYan Zheng */ 16515d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 16525d4f98a2SYan Zheng if (first) { 16535d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16545d4f98a2SYan Zheng first = 0; 16554a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 16563fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 16575d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16585d4f98a2SYan Zheng } 16594a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 16605d4f98a2SYan Zheng end = key.offset + 16615d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 16625d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 16630b246afaSJeff Mahoney fs_info->sectorsize)); 16640b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 16655d4f98a2SYan Zheng end--; 16665d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1667d0082371SJeff Mahoney key.offset, end); 16685d4f98a2SYan Zheng if (!ret) 16695d4f98a2SYan Zheng continue; 16705d4f98a2SYan Zheng 1671dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1672dcdbc059SNikolay Borisov key.offset, end, 1); 16735d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1674d0082371SJeff Mahoney key.offset, end); 16755d4f98a2SYan Zheng } 16765d4f98a2SYan Zheng } 16775d4f98a2SYan Zheng 16785d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 16795d4f98a2SYan Zheng bytenr, num_bytes); 168083d4cfd4SJosef Bacik if (ret) { 168183d4cfd4SJosef Bacik /* 168283d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 168383d4cfd4SJosef Bacik * in the file extent yet. 168483d4cfd4SJosef Bacik */ 168583d4cfd4SJosef Bacik break; 16863fd0a558SYan, Zheng } 16875d4f98a2SYan Zheng 16885d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 16895d4f98a2SYan Zheng dirty = 1; 16905d4f98a2SYan Zheng 16915d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 169284f7d8e6SJosef Bacik ret = btrfs_inc_extent_ref(trans, root, new_bytenr, 16935d4f98a2SYan Zheng num_bytes, parent, 16945d4f98a2SYan Zheng btrfs_header_owner(leaf), 1695b06c4bf5SFilipe Manana key.objectid, key.offset); 169683d4cfd4SJosef Bacik if (ret) { 169766642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 169883d4cfd4SJosef Bacik break; 169983d4cfd4SJosef Bacik } 17005d4f98a2SYan Zheng 170184f7d8e6SJosef Bacik ret = btrfs_free_extent(trans, root, bytenr, num_bytes, 17025d4f98a2SYan Zheng parent, btrfs_header_owner(leaf), 1703b06c4bf5SFilipe Manana key.objectid, key.offset); 170483d4cfd4SJosef Bacik if (ret) { 170566642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 170683d4cfd4SJosef Bacik break; 170783d4cfd4SJosef Bacik } 17085d4f98a2SYan Zheng } 17095d4f98a2SYan Zheng if (dirty) 17105d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 17113fd0a558SYan, Zheng if (inode) 17123fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 171383d4cfd4SJosef Bacik return ret; 17145d4f98a2SYan Zheng } 17155d4f98a2SYan Zheng 17165d4f98a2SYan Zheng static noinline_for_stack 17175d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 17185d4f98a2SYan Zheng struct btrfs_path *path, int level) 17195d4f98a2SYan Zheng { 17205d4f98a2SYan Zheng struct btrfs_disk_key key1; 17215d4f98a2SYan Zheng struct btrfs_disk_key key2; 17225d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 17235d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 17245d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 17255d4f98a2SYan Zheng } 17265d4f98a2SYan Zheng 17275d4f98a2SYan Zheng /* 17285d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 17295d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 17305d4f98a2SYan Zheng * reloc tree was create can be replaced. 17315d4f98a2SYan Zheng * 17325d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 17335d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 17345d4f98a2SYan Zheng * errors, a negative error number is returned. 17355d4f98a2SYan Zheng */ 17363fd0a558SYan, Zheng static noinline_for_stack 17373fd0a558SYan, Zheng int replace_path(struct btrfs_trans_handle *trans, 17385d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 17395d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 17405d4f98a2SYan Zheng int lowest_level, int max_level) 17415d4f98a2SYan Zheng { 17420b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 17435d4f98a2SYan Zheng struct extent_buffer *eb; 17445d4f98a2SYan Zheng struct extent_buffer *parent; 17455d4f98a2SYan Zheng struct btrfs_key key; 17465d4f98a2SYan Zheng u64 old_bytenr; 17475d4f98a2SYan Zheng u64 new_bytenr; 17485d4f98a2SYan Zheng u64 old_ptr_gen; 17495d4f98a2SYan Zheng u64 new_ptr_gen; 17505d4f98a2SYan Zheng u64 last_snapshot; 17515d4f98a2SYan Zheng u32 blocksize; 17523fd0a558SYan, Zheng int cow = 0; 17535d4f98a2SYan Zheng int level; 17545d4f98a2SYan Zheng int ret; 17555d4f98a2SYan Zheng int slot; 17565d4f98a2SYan Zheng 17575d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 17585d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 17595d4f98a2SYan Zheng 17605d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 17613fd0a558SYan, Zheng again: 17625d4f98a2SYan Zheng slot = path->slots[lowest_level]; 17635d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 17645d4f98a2SYan Zheng 17655d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 17665d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 17675d4f98a2SYan Zheng level = btrfs_header_level(eb); 17685d4f98a2SYan Zheng 17695d4f98a2SYan Zheng if (level < lowest_level) { 17705d4f98a2SYan Zheng btrfs_tree_unlock(eb); 17715d4f98a2SYan Zheng free_extent_buffer(eb); 17725d4f98a2SYan Zheng return 0; 17735d4f98a2SYan Zheng } 17745d4f98a2SYan Zheng 17753fd0a558SYan, Zheng if (cow) { 17765d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 17775d4f98a2SYan Zheng BUG_ON(ret); 17783fd0a558SYan, Zheng } 17795d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 17805d4f98a2SYan Zheng 17815d4f98a2SYan Zheng if (next_key) { 17825d4f98a2SYan Zheng next_key->objectid = (u64)-1; 17835d4f98a2SYan Zheng next_key->type = (u8)-1; 17845d4f98a2SYan Zheng next_key->offset = (u64)-1; 17855d4f98a2SYan Zheng } 17865d4f98a2SYan Zheng 17875d4f98a2SYan Zheng parent = eb; 17885d4f98a2SYan Zheng while (1) { 1789581c1760SQu Wenruo struct btrfs_key first_key; 1790581c1760SQu Wenruo 17915d4f98a2SYan Zheng level = btrfs_header_level(parent); 17925d4f98a2SYan Zheng BUG_ON(level < lowest_level); 17935d4f98a2SYan Zheng 17945d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 17955d4f98a2SYan Zheng if (ret && slot > 0) 17965d4f98a2SYan Zheng slot--; 17975d4f98a2SYan Zheng 17985d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 17995d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 18005d4f98a2SYan Zheng 18015d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 18020b246afaSJeff Mahoney blocksize = fs_info->nodesize; 18035d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 180417515f1bSQu Wenruo btrfs_node_key_to_cpu(parent, &first_key, slot); 18055d4f98a2SYan Zheng 18065d4f98a2SYan Zheng if (level <= max_level) { 18075d4f98a2SYan Zheng eb = path->nodes[level]; 18085d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 18095d4f98a2SYan Zheng path->slots[level]); 18105d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 18115d4f98a2SYan Zheng path->slots[level]); 18125d4f98a2SYan Zheng } else { 18135d4f98a2SYan Zheng new_bytenr = 0; 18145d4f98a2SYan Zheng new_ptr_gen = 0; 18155d4f98a2SYan Zheng } 18165d4f98a2SYan Zheng 1817fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 18185d4f98a2SYan Zheng ret = level; 18195d4f98a2SYan Zheng break; 18205d4f98a2SYan Zheng } 18215d4f98a2SYan Zheng 18225d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 18235d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 18243fd0a558SYan, Zheng if (level <= lowest_level) { 18255d4f98a2SYan Zheng ret = 0; 18265d4f98a2SYan Zheng break; 18275d4f98a2SYan Zheng } 18285d4f98a2SYan Zheng 1829581c1760SQu Wenruo eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen, 1830581c1760SQu Wenruo level - 1, &first_key); 183164c043deSLiu Bo if (IS_ERR(eb)) { 183264c043deSLiu Bo ret = PTR_ERR(eb); 1833264813acSLiu Bo break; 183464c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 183564c043deSLiu Bo ret = -EIO; 1836416bc658SJosef Bacik free_extent_buffer(eb); 1837379cde74SStefan Behrens break; 1838416bc658SJosef Bacik } 18395d4f98a2SYan Zheng btrfs_tree_lock(eb); 18403fd0a558SYan, Zheng if (cow) { 18415d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 18425d4f98a2SYan Zheng slot, &eb); 18435d4f98a2SYan Zheng BUG_ON(ret); 18445d4f98a2SYan Zheng } 18453fd0a558SYan, Zheng btrfs_set_lock_blocking(eb); 18465d4f98a2SYan Zheng 18475d4f98a2SYan Zheng btrfs_tree_unlock(parent); 18485d4f98a2SYan Zheng free_extent_buffer(parent); 18495d4f98a2SYan Zheng 18505d4f98a2SYan Zheng parent = eb; 18515d4f98a2SYan Zheng continue; 18525d4f98a2SYan Zheng } 18535d4f98a2SYan Zheng 18543fd0a558SYan, Zheng if (!cow) { 18553fd0a558SYan, Zheng btrfs_tree_unlock(parent); 18563fd0a558SYan, Zheng free_extent_buffer(parent); 18573fd0a558SYan, Zheng cow = 1; 18583fd0a558SYan, Zheng goto again; 18593fd0a558SYan, Zheng } 18603fd0a558SYan, Zheng 18615d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 18625d4f98a2SYan Zheng path->slots[level]); 1863b3b4aa74SDavid Sterba btrfs_release_path(path); 18645d4f98a2SYan Zheng 18655d4f98a2SYan Zheng path->lowest_level = level; 18665d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 18675d4f98a2SYan Zheng path->lowest_level = 0; 18685d4f98a2SYan Zheng BUG_ON(ret); 18695d4f98a2SYan Zheng 18705d4f98a2SYan Zheng /* 1871824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 1872824d8dffSQu Wenruo * 1873824d8dffSQu Wenruo * We must trace both trees. 1874824d8dffSQu Wenruo * 1) Tree reloc subtree 1875824d8dffSQu Wenruo * If not traced, we will leak data numbers 1876824d8dffSQu Wenruo * 2) Fs subtree 1877824d8dffSQu Wenruo * If not traced, we will double count old data 1878824d8dffSQu Wenruo * and tree block numbers, if current trans doesn't free 1879824d8dffSQu Wenruo * data reloc tree inode. 1880824d8dffSQu Wenruo */ 1881824d8dffSQu Wenruo ret = btrfs_qgroup_trace_subtree(trans, src, parent, 1882824d8dffSQu Wenruo btrfs_header_generation(parent), 1883824d8dffSQu Wenruo btrfs_header_level(parent)); 1884824d8dffSQu Wenruo if (ret < 0) 1885824d8dffSQu Wenruo break; 1886824d8dffSQu Wenruo ret = btrfs_qgroup_trace_subtree(trans, dest, 1887824d8dffSQu Wenruo path->nodes[level], 1888824d8dffSQu Wenruo btrfs_header_generation(path->nodes[level]), 1889824d8dffSQu Wenruo btrfs_header_level(path->nodes[level])); 1890824d8dffSQu Wenruo if (ret < 0) 1891824d8dffSQu Wenruo break; 1892824d8dffSQu Wenruo 1893824d8dffSQu Wenruo /* 18945d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 18955d4f98a2SYan Zheng */ 18965d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 18975d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 18985d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 18995d4f98a2SYan Zheng 19005d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 19015d4f98a2SYan Zheng path->slots[level], old_bytenr); 19025d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 19035d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 19045d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 19055d4f98a2SYan Zheng 190684f7d8e6SJosef Bacik ret = btrfs_inc_extent_ref(trans, src, old_bytenr, 19072ff7e61eSJeff Mahoney blocksize, path->nodes[level]->start, 1908b06c4bf5SFilipe Manana src->root_key.objectid, level - 1, 0); 19095d4f98a2SYan Zheng BUG_ON(ret); 191084f7d8e6SJosef Bacik ret = btrfs_inc_extent_ref(trans, dest, new_bytenr, 19112ff7e61eSJeff Mahoney blocksize, 0, dest->root_key.objectid, 19122ff7e61eSJeff Mahoney level - 1, 0); 19135d4f98a2SYan Zheng BUG_ON(ret); 19145d4f98a2SYan Zheng 191584f7d8e6SJosef Bacik ret = btrfs_free_extent(trans, src, new_bytenr, blocksize, 19165d4f98a2SYan Zheng path->nodes[level]->start, 1917b06c4bf5SFilipe Manana src->root_key.objectid, level - 1, 0); 19185d4f98a2SYan Zheng BUG_ON(ret); 19195d4f98a2SYan Zheng 192084f7d8e6SJosef Bacik ret = btrfs_free_extent(trans, dest, old_bytenr, blocksize, 19215d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 1922b06c4bf5SFilipe Manana 0); 19235d4f98a2SYan Zheng BUG_ON(ret); 19245d4f98a2SYan Zheng 19255d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 19265d4f98a2SYan Zheng 19275d4f98a2SYan Zheng ret = level; 19285d4f98a2SYan Zheng break; 19295d4f98a2SYan Zheng } 19305d4f98a2SYan Zheng btrfs_tree_unlock(parent); 19315d4f98a2SYan Zheng free_extent_buffer(parent); 19325d4f98a2SYan Zheng return ret; 19335d4f98a2SYan Zheng } 19345d4f98a2SYan Zheng 19355d4f98a2SYan Zheng /* 19365d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 19375d4f98a2SYan Zheng */ 19385d4f98a2SYan Zheng static noinline_for_stack 19395d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 19405d4f98a2SYan Zheng int *level) 19415d4f98a2SYan Zheng { 19425d4f98a2SYan Zheng struct extent_buffer *eb; 19435d4f98a2SYan Zheng int i; 19445d4f98a2SYan Zheng u64 last_snapshot; 19455d4f98a2SYan Zheng u32 nritems; 19465d4f98a2SYan Zheng 19475d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19485d4f98a2SYan Zheng 19495d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 19505d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19515d4f98a2SYan Zheng path->nodes[i] = NULL; 19525d4f98a2SYan Zheng } 19535d4f98a2SYan Zheng 19545d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 19555d4f98a2SYan Zheng eb = path->nodes[i]; 19565d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 19575d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 19585d4f98a2SYan Zheng path->slots[i]++; 19595d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 19605d4f98a2SYan Zheng last_snapshot) 19615d4f98a2SYan Zheng continue; 19625d4f98a2SYan Zheng 19635d4f98a2SYan Zheng *level = i; 19645d4f98a2SYan Zheng return 0; 19655d4f98a2SYan Zheng } 19665d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19675d4f98a2SYan Zheng path->nodes[i] = NULL; 19685d4f98a2SYan Zheng } 19695d4f98a2SYan Zheng return 1; 19705d4f98a2SYan Zheng } 19715d4f98a2SYan Zheng 19725d4f98a2SYan Zheng /* 19735d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 19745d4f98a2SYan Zheng */ 19755d4f98a2SYan Zheng static noinline_for_stack 19765d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 19775d4f98a2SYan Zheng int *level) 19785d4f98a2SYan Zheng { 19792ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 19805d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 19815d4f98a2SYan Zheng int i; 19825d4f98a2SYan Zheng u64 bytenr; 19835d4f98a2SYan Zheng u64 ptr_gen = 0; 19845d4f98a2SYan Zheng u64 last_snapshot; 19855d4f98a2SYan Zheng u32 nritems; 19865d4f98a2SYan Zheng 19875d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19885d4f98a2SYan Zheng 19895d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 1990581c1760SQu Wenruo struct btrfs_key first_key; 1991581c1760SQu Wenruo 19925d4f98a2SYan Zheng eb = path->nodes[i]; 19935d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 19945d4f98a2SYan Zheng while (path->slots[i] < nritems) { 19955d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 19965d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 19975d4f98a2SYan Zheng break; 19985d4f98a2SYan Zheng path->slots[i]++; 19995d4f98a2SYan Zheng } 20005d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 20015d4f98a2SYan Zheng if (i == *level) 20025d4f98a2SYan Zheng break; 20035d4f98a2SYan Zheng *level = i + 1; 20045d4f98a2SYan Zheng return 0; 20055d4f98a2SYan Zheng } 20065d4f98a2SYan Zheng if (i == 1) { 20075d4f98a2SYan Zheng *level = i; 20085d4f98a2SYan Zheng return 0; 20095d4f98a2SYan Zheng } 20105d4f98a2SYan Zheng 20115d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2012581c1760SQu Wenruo btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); 2013581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1, 2014581c1760SQu Wenruo &first_key); 201564c043deSLiu Bo if (IS_ERR(eb)) { 201664c043deSLiu Bo return PTR_ERR(eb); 201764c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2018416bc658SJosef Bacik free_extent_buffer(eb); 2019416bc658SJosef Bacik return -EIO; 2020416bc658SJosef Bacik } 20215d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 20225d4f98a2SYan Zheng path->nodes[i - 1] = eb; 20235d4f98a2SYan Zheng path->slots[i - 1] = 0; 20245d4f98a2SYan Zheng } 20255d4f98a2SYan Zheng return 1; 20265d4f98a2SYan Zheng } 20275d4f98a2SYan Zheng 20285d4f98a2SYan Zheng /* 20295d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 20305d4f98a2SYan Zheng * [min_key, max_key) 20315d4f98a2SYan Zheng */ 20325d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 20335d4f98a2SYan Zheng struct btrfs_key *min_key, 20345d4f98a2SYan Zheng struct btrfs_key *max_key) 20355d4f98a2SYan Zheng { 20360b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 20375d4f98a2SYan Zheng struct inode *inode = NULL; 20385d4f98a2SYan Zheng u64 objectid; 20395d4f98a2SYan Zheng u64 start, end; 204033345d01SLi Zefan u64 ino; 20415d4f98a2SYan Zheng 20425d4f98a2SYan Zheng objectid = min_key->objectid; 20435d4f98a2SYan Zheng while (1) { 20445d4f98a2SYan Zheng cond_resched(); 20455d4f98a2SYan Zheng iput(inode); 20465d4f98a2SYan Zheng 20475d4f98a2SYan Zheng if (objectid > max_key->objectid) 20485d4f98a2SYan Zheng break; 20495d4f98a2SYan Zheng 20505d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 20515d4f98a2SYan Zheng if (!inode) 20525d4f98a2SYan Zheng break; 20534a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 20545d4f98a2SYan Zheng 205533345d01SLi Zefan if (ino > max_key->objectid) { 20565d4f98a2SYan Zheng iput(inode); 20575d4f98a2SYan Zheng break; 20585d4f98a2SYan Zheng } 20595d4f98a2SYan Zheng 206033345d01SLi Zefan objectid = ino + 1; 20615d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 20625d4f98a2SYan Zheng continue; 20635d4f98a2SYan Zheng 206433345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 20655d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 20665d4f98a2SYan Zheng continue; 20675d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 20685d4f98a2SYan Zheng start = 0; 20695d4f98a2SYan Zheng else { 20705d4f98a2SYan Zheng start = min_key->offset; 20710b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 20725d4f98a2SYan Zheng } 20735d4f98a2SYan Zheng } else { 20745d4f98a2SYan Zheng start = 0; 20755d4f98a2SYan Zheng } 20765d4f98a2SYan Zheng 207733345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 20785d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 20795d4f98a2SYan Zheng continue; 20805d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 20815d4f98a2SYan Zheng end = (u64)-1; 20825d4f98a2SYan Zheng } else { 20835d4f98a2SYan Zheng if (max_key->offset == 0) 20845d4f98a2SYan Zheng continue; 20855d4f98a2SYan Zheng end = max_key->offset; 20860b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 20875d4f98a2SYan Zheng end--; 20885d4f98a2SYan Zheng } 20895d4f98a2SYan Zheng } else { 20905d4f98a2SYan Zheng end = (u64)-1; 20915d4f98a2SYan Zheng } 20925d4f98a2SYan Zheng 20935d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2094d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 2095dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 2096d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 20975d4f98a2SYan Zheng } 20985d4f98a2SYan Zheng return 0; 20995d4f98a2SYan Zheng } 21005d4f98a2SYan Zheng 21015d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 21025d4f98a2SYan Zheng struct btrfs_key *key) 21035d4f98a2SYan Zheng 21045d4f98a2SYan Zheng { 21055d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 21065d4f98a2SYan Zheng if (!path->nodes[level]) 21075d4f98a2SYan Zheng break; 21085d4f98a2SYan Zheng if (path->slots[level] + 1 < 21095d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 21105d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 21115d4f98a2SYan Zheng path->slots[level] + 1); 21125d4f98a2SYan Zheng return 0; 21135d4f98a2SYan Zheng } 21145d4f98a2SYan Zheng level++; 21155d4f98a2SYan Zheng } 21165d4f98a2SYan Zheng return 1; 21175d4f98a2SYan Zheng } 21185d4f98a2SYan Zheng 21195d4f98a2SYan Zheng /* 21205d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 21215d4f98a2SYan Zheng * fs tree. 21225d4f98a2SYan Zheng */ 21235d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 21245d4f98a2SYan Zheng struct btrfs_root *root) 21255d4f98a2SYan Zheng { 21260b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 21275d4f98a2SYan Zheng LIST_HEAD(inode_list); 21285d4f98a2SYan Zheng struct btrfs_key key; 21295d4f98a2SYan Zheng struct btrfs_key next_key; 21309e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 21315d4f98a2SYan Zheng struct btrfs_root *reloc_root; 21325d4f98a2SYan Zheng struct btrfs_root_item *root_item; 21335d4f98a2SYan Zheng struct btrfs_path *path; 21343fd0a558SYan, Zheng struct extent_buffer *leaf; 21355d4f98a2SYan Zheng int level; 21365d4f98a2SYan Zheng int max_level; 21375d4f98a2SYan Zheng int replaced = 0; 21385d4f98a2SYan Zheng int ret; 21395d4f98a2SYan Zheng int err = 0; 21403fd0a558SYan, Zheng u32 min_reserved; 21415d4f98a2SYan Zheng 21425d4f98a2SYan Zheng path = btrfs_alloc_path(); 21435d4f98a2SYan Zheng if (!path) 21445d4f98a2SYan Zheng return -ENOMEM; 2145e4058b54SDavid Sterba path->reada = READA_FORWARD; 21465d4f98a2SYan Zheng 21475d4f98a2SYan Zheng reloc_root = root->reloc_root; 21485d4f98a2SYan Zheng root_item = &reloc_root->root_item; 21495d4f98a2SYan Zheng 21505d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 21515d4f98a2SYan Zheng level = btrfs_root_level(root_item); 21525d4f98a2SYan Zheng extent_buffer_get(reloc_root->node); 21535d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 21545d4f98a2SYan Zheng path->slots[level] = 0; 21555d4f98a2SYan Zheng } else { 21565d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 21575d4f98a2SYan Zheng 21585d4f98a2SYan Zheng level = root_item->drop_level; 21595d4f98a2SYan Zheng BUG_ON(level == 0); 21605d4f98a2SYan Zheng path->lowest_level = level; 21615d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 216233c66f43SYan Zheng path->lowest_level = 0; 21635d4f98a2SYan Zheng if (ret < 0) { 21645d4f98a2SYan Zheng btrfs_free_path(path); 21655d4f98a2SYan Zheng return ret; 21665d4f98a2SYan Zheng } 21675d4f98a2SYan Zheng 21685d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 21695d4f98a2SYan Zheng path->slots[level]); 21705d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 21715d4f98a2SYan Zheng 21725d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 21735d4f98a2SYan Zheng } 21745d4f98a2SYan Zheng 21750b246afaSJeff Mahoney min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 21765d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 21775d4f98a2SYan Zheng 21785d4f98a2SYan Zheng while (1) { 217908e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 218008e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 21813fd0a558SYan, Zheng if (ret) { 21829e6a0c52SJosef Bacik err = ret; 21839e6a0c52SJosef Bacik goto out; 21843fd0a558SYan, Zheng } 21859e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 21869e6a0c52SJosef Bacik if (IS_ERR(trans)) { 21879e6a0c52SJosef Bacik err = PTR_ERR(trans); 21889e6a0c52SJosef Bacik trans = NULL; 21899e6a0c52SJosef Bacik goto out; 21909e6a0c52SJosef Bacik } 21919e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 21923fd0a558SYan, Zheng 21933fd0a558SYan, Zheng replaced = 0; 21945d4f98a2SYan Zheng max_level = level; 21955d4f98a2SYan Zheng 21965d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 21975d4f98a2SYan Zheng if (ret < 0) { 21985d4f98a2SYan Zheng err = ret; 21995d4f98a2SYan Zheng goto out; 22005d4f98a2SYan Zheng } 22015d4f98a2SYan Zheng if (ret > 0) 22025d4f98a2SYan Zheng break; 22035d4f98a2SYan Zheng 22045d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 22055d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 22065d4f98a2SYan Zheng ret = 0; 22075d4f98a2SYan Zheng } else { 22083fd0a558SYan, Zheng ret = replace_path(trans, root, reloc_root, path, 22093fd0a558SYan, Zheng &next_key, level, max_level); 22105d4f98a2SYan Zheng } 22115d4f98a2SYan Zheng if (ret < 0) { 22125d4f98a2SYan Zheng err = ret; 22135d4f98a2SYan Zheng goto out; 22145d4f98a2SYan Zheng } 22155d4f98a2SYan Zheng 22165d4f98a2SYan Zheng if (ret > 0) { 22175d4f98a2SYan Zheng level = ret; 22185d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 22195d4f98a2SYan Zheng path->slots[level]); 22205d4f98a2SYan Zheng replaced = 1; 22215d4f98a2SYan Zheng } 22225d4f98a2SYan Zheng 22235d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 22245d4f98a2SYan Zheng if (ret > 0) 22255d4f98a2SYan Zheng break; 22265d4f98a2SYan Zheng 22275d4f98a2SYan Zheng BUG_ON(level == 0); 22285d4f98a2SYan Zheng /* 22295d4f98a2SYan Zheng * save the merging progress in the drop_progress. 22305d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 22315d4f98a2SYan Zheng */ 22325d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 22335d4f98a2SYan Zheng path->slots[level]); 22345d4f98a2SYan Zheng root_item->drop_level = level; 22355d4f98a2SYan Zheng 22363a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 22379e6a0c52SJosef Bacik trans = NULL; 22385d4f98a2SYan Zheng 22392ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 22405d4f98a2SYan Zheng 22415d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 22425d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 22435d4f98a2SYan Zheng } 22445d4f98a2SYan Zheng 22455d4f98a2SYan Zheng /* 22465d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 22475d4f98a2SYan Zheng * relocated and the block is tree root. 22485d4f98a2SYan Zheng */ 22495d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 22505d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 22515d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 22525d4f98a2SYan Zheng free_extent_buffer(leaf); 22535d4f98a2SYan Zheng if (ret < 0) 22545d4f98a2SYan Zheng err = ret; 22555d4f98a2SYan Zheng out: 22565d4f98a2SYan Zheng btrfs_free_path(path); 22575d4f98a2SYan Zheng 22585d4f98a2SYan Zheng if (err == 0) { 22595d4f98a2SYan Zheng memset(&root_item->drop_progress, 0, 22605d4f98a2SYan Zheng sizeof(root_item->drop_progress)); 22615d4f98a2SYan Zheng root_item->drop_level = 0; 22625d4f98a2SYan Zheng btrfs_set_root_refs(root_item, 0); 22633fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 22645d4f98a2SYan Zheng } 22655d4f98a2SYan Zheng 22669e6a0c52SJosef Bacik if (trans) 22673a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 22685d4f98a2SYan Zheng 22692ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 22705d4f98a2SYan Zheng 22715d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 22725d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 22735d4f98a2SYan Zheng 22745d4f98a2SYan Zheng return err; 22755d4f98a2SYan Zheng } 22765d4f98a2SYan Zheng 22773fd0a558SYan, Zheng static noinline_for_stack 22783fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 22795d4f98a2SYan Zheng { 22803fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 22810b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 22823fd0a558SYan, Zheng struct btrfs_root *reloc_root; 22835d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 22843fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 22853fd0a558SYan, Zheng u64 num_bytes = 0; 22863fd0a558SYan, Zheng int ret; 22873fd0a558SYan, Zheng 22880b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 22890b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 22903fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 22910b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 22927585717fSChris Mason 22933fd0a558SYan, Zheng again: 22943fd0a558SYan, Zheng if (!err) { 22953fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 229608e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 229708e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 22983fd0a558SYan, Zheng if (ret) 22993fd0a558SYan, Zheng err = ret; 23003fd0a558SYan, Zheng } 23013fd0a558SYan, Zheng 23027a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 23033612b495STsutomu Itoh if (IS_ERR(trans)) { 23043612b495STsutomu Itoh if (!err) 23052ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 23062ff7e61eSJeff Mahoney num_bytes); 23073612b495STsutomu Itoh return PTR_ERR(trans); 23083612b495STsutomu Itoh } 23093fd0a558SYan, Zheng 23103fd0a558SYan, Zheng if (!err) { 23113fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 23123a45bb20SJeff Mahoney btrfs_end_transaction(trans); 23132ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 23142ff7e61eSJeff Mahoney num_bytes); 23153fd0a558SYan, Zheng goto again; 23163fd0a558SYan, Zheng } 23173fd0a558SYan, Zheng } 23183fd0a558SYan, Zheng 23193fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 23203fd0a558SYan, Zheng 23213fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 23223fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 23233fd0a558SYan, Zheng struct btrfs_root, root_list); 23243fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 23253fd0a558SYan, Zheng 23260b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 23273fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 23283fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 23293fd0a558SYan, Zheng 23303fd0a558SYan, Zheng /* 23313fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 23323fd0a558SYan, Zheng * knows it should resumes merging 23333fd0a558SYan, Zheng */ 23343fd0a558SYan, Zheng if (!err) 23353fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 23363fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 23373fd0a558SYan, Zheng 23383fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 23393fd0a558SYan, Zheng } 23403fd0a558SYan, Zheng 23413fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 23423fd0a558SYan, Zheng 23433fd0a558SYan, Zheng if (!err) 23443a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 23453fd0a558SYan, Zheng else 23463a45bb20SJeff Mahoney btrfs_end_transaction(trans); 23473fd0a558SYan, Zheng return err; 23483fd0a558SYan, Zheng } 23493fd0a558SYan, Zheng 23503fd0a558SYan, Zheng static noinline_for_stack 2351aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2352aca1bba6SLiu Bo { 2353aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2354aca1bba6SLiu Bo 2355aca1bba6SLiu Bo while (!list_empty(list)) { 2356aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2357aca1bba6SLiu Bo root_list); 2358bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 23596bdf131fSJosef Bacik free_extent_buffer(reloc_root->node); 23606bdf131fSJosef Bacik free_extent_buffer(reloc_root->commit_root); 23616bdf131fSJosef Bacik reloc_root->node = NULL; 23626bdf131fSJosef Bacik reloc_root->commit_root = NULL; 2363aca1bba6SLiu Bo } 2364aca1bba6SLiu Bo } 2365aca1bba6SLiu Bo 2366aca1bba6SLiu Bo static noinline_for_stack 236794404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 23683fd0a558SYan, Zheng { 23690b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 23705d4f98a2SYan Zheng struct btrfs_root *root; 23715d4f98a2SYan Zheng struct btrfs_root *reloc_root; 23723fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 23733fd0a558SYan, Zheng int found = 0; 2374aca1bba6SLiu Bo int ret = 0; 23753fd0a558SYan, Zheng again: 23763fd0a558SYan, Zheng root = rc->extent_root; 23777585717fSChris Mason 23787585717fSChris Mason /* 23797585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 23807585717fSChris Mason * we have to make sure nobody is in the middle of 23817585717fSChris Mason * adding their roots to the list while we are 23827585717fSChris Mason * doing this splice 23837585717fSChris Mason */ 23840b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 23853fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 23860b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 23875d4f98a2SYan Zheng 23883fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 23893fd0a558SYan, Zheng found = 1; 23903fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 23913fd0a558SYan, Zheng struct btrfs_root, root_list); 23925d4f98a2SYan Zheng 23935d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 23940b246afaSJeff Mahoney root = read_fs_root(fs_info, 23955d4f98a2SYan Zheng reloc_root->root_key.offset); 23965d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 23975d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 23985d4f98a2SYan Zheng 23993fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 2400b37b39cdSJosef Bacik if (ret) { 240125e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 240225e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 240325e293c2SWang Shilong &reloc_roots); 2404aca1bba6SLiu Bo goto out; 2405b37b39cdSJosef Bacik } 24063fd0a558SYan, Zheng } else { 24073fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 24083fd0a558SYan, Zheng } 24095bc7247aSMiao Xie 24102c536799SJeff Mahoney ret = btrfs_drop_snapshot(reloc_root, rc->block_rsv, 0, 1); 2411aca1bba6SLiu Bo if (ret < 0) { 2412aca1bba6SLiu Bo if (list_empty(&reloc_root->root_list)) 2413aca1bba6SLiu Bo list_add_tail(&reloc_root->root_list, 2414aca1bba6SLiu Bo &reloc_roots); 2415aca1bba6SLiu Bo goto out; 2416aca1bba6SLiu Bo } 24175d4f98a2SYan Zheng } 24185d4f98a2SYan Zheng 24193fd0a558SYan, Zheng if (found) { 24203fd0a558SYan, Zheng found = 0; 24213fd0a558SYan, Zheng goto again; 24225d4f98a2SYan Zheng } 2423aca1bba6SLiu Bo out: 2424aca1bba6SLiu Bo if (ret) { 24250b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2426aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2427aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2428467bb1d2SWang Shilong 2429467bb1d2SWang Shilong /* new reloc root may be added */ 24300b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2431467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 24320b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2433467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2434467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2435aca1bba6SLiu Bo } 2436aca1bba6SLiu Bo 24375d4f98a2SYan Zheng BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 24385d4f98a2SYan Zheng } 24395d4f98a2SYan Zheng 24405d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 24415d4f98a2SYan Zheng { 24425d4f98a2SYan Zheng struct tree_block *block; 24435d4f98a2SYan Zheng struct rb_node *rb_node; 24445d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 24455d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 24465d4f98a2SYan Zheng rb_erase(rb_node, blocks); 24475d4f98a2SYan Zheng kfree(block); 24485d4f98a2SYan Zheng } 24495d4f98a2SYan Zheng } 24505d4f98a2SYan Zheng 24515d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 24525d4f98a2SYan Zheng struct btrfs_root *reloc_root) 24535d4f98a2SYan Zheng { 24540b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 24555d4f98a2SYan Zheng struct btrfs_root *root; 24565d4f98a2SYan Zheng 24575d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 24585d4f98a2SYan Zheng return 0; 24595d4f98a2SYan Zheng 24600b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 24615d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 24625d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 24635d4f98a2SYan Zheng 24645d4f98a2SYan Zheng return btrfs_record_root_in_trans(trans, root); 24655d4f98a2SYan Zheng } 24665d4f98a2SYan Zheng 24673fd0a558SYan, Zheng static noinline_for_stack 24683fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 24693fd0a558SYan, Zheng struct reloc_control *rc, 24705d4f98a2SYan Zheng struct backref_node *node, 2471dc4103f9SWang Shilong struct backref_edge *edges[]) 24725d4f98a2SYan Zheng { 24735d4f98a2SYan Zheng struct backref_node *next; 24745d4f98a2SYan Zheng struct btrfs_root *root; 24753fd0a558SYan, Zheng int index = 0; 24763fd0a558SYan, Zheng 24775d4f98a2SYan Zheng next = node; 24785d4f98a2SYan Zheng while (1) { 24795d4f98a2SYan Zheng cond_resched(); 24805d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 24815d4f98a2SYan Zheng root = next->root; 24823fd0a558SYan, Zheng BUG_ON(!root); 248327cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 24845d4f98a2SYan Zheng 24855d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 24865d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 24875d4f98a2SYan Zheng break; 24885d4f98a2SYan Zheng } 24895d4f98a2SYan Zheng 24905d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 24913fd0a558SYan, Zheng root = root->reloc_root; 24923fd0a558SYan, Zheng 24933fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 24943fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 24953fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 24963fd0a558SYan, Zheng next->new_bytenr = root->node->start; 24973fd0a558SYan, Zheng next->root = root; 24983fd0a558SYan, Zheng list_add_tail(&next->list, 24993fd0a558SYan, Zheng &rc->backref_cache.changed); 25003fd0a558SYan, Zheng __mark_block_processed(rc, next); 25015d4f98a2SYan Zheng break; 25025d4f98a2SYan Zheng } 25035d4f98a2SYan Zheng 25043fd0a558SYan, Zheng WARN_ON(1); 25055d4f98a2SYan Zheng root = NULL; 25065d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 25075d4f98a2SYan Zheng if (!next || next->level <= node->level) 25085d4f98a2SYan Zheng break; 25095d4f98a2SYan Zheng } 25103fd0a558SYan, Zheng if (!root) 25113fd0a558SYan, Zheng return NULL; 25125d4f98a2SYan Zheng 25133fd0a558SYan, Zheng next = node; 25143fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 25153fd0a558SYan, Zheng while (1) { 25163fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 25173fd0a558SYan, Zheng if (--index < 0) 25183fd0a558SYan, Zheng break; 25193fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 25203fd0a558SYan, Zheng } 25215d4f98a2SYan Zheng return root; 25225d4f98a2SYan Zheng } 25235d4f98a2SYan Zheng 25243fd0a558SYan, Zheng /* 25253fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 25263fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 25273fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 25283fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 25293fd0a558SYan, Zheng */ 25305d4f98a2SYan Zheng static noinline_for_stack 2531147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 25325d4f98a2SYan Zheng { 25333fd0a558SYan, Zheng struct backref_node *next; 25343fd0a558SYan, Zheng struct btrfs_root *root; 25353fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 25365d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25373fd0a558SYan, Zheng int index = 0; 25383fd0a558SYan, Zheng 25393fd0a558SYan, Zheng next = node; 25403fd0a558SYan, Zheng while (1) { 25413fd0a558SYan, Zheng cond_resched(); 25423fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 25433fd0a558SYan, Zheng root = next->root; 25443fd0a558SYan, Zheng BUG_ON(!root); 25453fd0a558SYan, Zheng 254625985edcSLucas De Marchi /* no other choice for non-references counted tree */ 254727cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 25483fd0a558SYan, Zheng return root; 25493fd0a558SYan, Zheng 25503fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 25513fd0a558SYan, Zheng fs_root = root; 25523fd0a558SYan, Zheng 25533fd0a558SYan, Zheng if (next != node) 25543fd0a558SYan, Zheng return NULL; 25553fd0a558SYan, Zheng 25563fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 25573fd0a558SYan, Zheng if (!next || next->level <= node->level) 25583fd0a558SYan, Zheng break; 25593fd0a558SYan, Zheng } 25603fd0a558SYan, Zheng 25613fd0a558SYan, Zheng if (!fs_root) 25623fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 25633fd0a558SYan, Zheng return fs_root; 25645d4f98a2SYan Zheng } 25655d4f98a2SYan Zheng 25665d4f98a2SYan Zheng static noinline_for_stack 25673fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 25683fd0a558SYan, Zheng struct backref_node *node, int reserve) 25695d4f98a2SYan Zheng { 25700b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 25713fd0a558SYan, Zheng struct backref_node *next = node; 25723fd0a558SYan, Zheng struct backref_edge *edge; 25733fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25743fd0a558SYan, Zheng u64 num_bytes = 0; 25753fd0a558SYan, Zheng int index = 0; 25765d4f98a2SYan Zheng 25773fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 25783fd0a558SYan, Zheng 25793fd0a558SYan, Zheng while (next) { 25803fd0a558SYan, Zheng cond_resched(); 25815d4f98a2SYan Zheng while (1) { 25823fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 25835d4f98a2SYan Zheng break; 25845d4f98a2SYan Zheng 25850b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 25863fd0a558SYan, Zheng 25873fd0a558SYan, Zheng if (list_empty(&next->upper)) 25883fd0a558SYan, Zheng break; 25893fd0a558SYan, Zheng 25903fd0a558SYan, Zheng edge = list_entry(next->upper.next, 25913fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 25923fd0a558SYan, Zheng edges[index++] = edge; 25933fd0a558SYan, Zheng next = edge->node[UPPER]; 25945d4f98a2SYan Zheng } 25953fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 25963fd0a558SYan, Zheng } 25973fd0a558SYan, Zheng return num_bytes; 25983fd0a558SYan, Zheng } 25993fd0a558SYan, Zheng 26003fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 26013fd0a558SYan, Zheng struct reloc_control *rc, 26023fd0a558SYan, Zheng struct backref_node *node) 26033fd0a558SYan, Zheng { 26043fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2605da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 26063fd0a558SYan, Zheng u64 num_bytes; 26073fd0a558SYan, Zheng int ret; 26080647bf56SWang Shilong u64 tmp; 26093fd0a558SYan, Zheng 26103fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 26113fd0a558SYan, Zheng 26123fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 26130647bf56SWang Shilong rc->reserved_bytes += num_bytes; 26148ca17f0fSJosef Bacik 26158ca17f0fSJosef Bacik /* 26168ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 26178ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 26188ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 26198ca17f0fSJosef Bacik */ 26200647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 26218ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 26223fd0a558SYan, Zheng if (ret) { 2623da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 26240647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 26250647bf56SWang Shilong tmp <<= 1; 26260647bf56SWang Shilong /* 26270647bf56SWang Shilong * only one thread can access block_rsv at this point, 26280647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 26290647bf56SWang Shilong * we expand more reservation size here to allow enough 26308ca17f0fSJosef Bacik * space for relocation and we will return eailer in 26310647bf56SWang Shilong * enospc case. 26320647bf56SWang Shilong */ 2633da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 26340647bf56SWang Shilong RELOCATION_RESERVED_NODES; 26358ca17f0fSJosef Bacik return -EAGAIN; 26363fd0a558SYan, Zheng } 26373fd0a558SYan, Zheng 26383fd0a558SYan, Zheng return 0; 26393fd0a558SYan, Zheng } 26403fd0a558SYan, Zheng 26415d4f98a2SYan Zheng /* 26425d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 26435d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 26445d4f98a2SYan Zheng * 26455d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 26465d4f98a2SYan Zheng * in that case this function just updates pointers. 26475d4f98a2SYan Zheng */ 26485d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 26493fd0a558SYan, Zheng struct reloc_control *rc, 26505d4f98a2SYan Zheng struct backref_node *node, 26515d4f98a2SYan Zheng struct btrfs_key *key, 26525d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 26535d4f98a2SYan Zheng { 26542ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 26555d4f98a2SYan Zheng struct backref_node *upper; 26565d4f98a2SYan Zheng struct backref_edge *edge; 26575d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 26585d4f98a2SYan Zheng struct btrfs_root *root; 26595d4f98a2SYan Zheng struct extent_buffer *eb; 26605d4f98a2SYan Zheng u32 blocksize; 26615d4f98a2SYan Zheng u64 bytenr; 26625d4f98a2SYan Zheng u64 generation; 26635d4f98a2SYan Zheng int slot; 26645d4f98a2SYan Zheng int ret; 26655d4f98a2SYan Zheng int err = 0; 26665d4f98a2SYan Zheng 26675d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 26685d4f98a2SYan Zheng 26695d4f98a2SYan Zheng path->lowest_level = node->level + 1; 26703fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 26715d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 2672581c1760SQu Wenruo struct btrfs_key first_key; 2673581c1760SQu Wenruo 26745d4f98a2SYan Zheng cond_resched(); 26755d4f98a2SYan Zheng 26765d4f98a2SYan Zheng upper = edge->node[UPPER]; 2677dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 26783fd0a558SYan, Zheng BUG_ON(!root); 26795d4f98a2SYan Zheng 26803fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 26813fd0a558SYan, Zheng if (!lowest) { 26823fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 26833fd0a558SYan, Zheng upper->level, &slot); 26843fd0a558SYan, Zheng BUG_ON(ret); 26853fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 26863fd0a558SYan, Zheng if (node->eb->start == bytenr) 26873fd0a558SYan, Zheng goto next; 26883fd0a558SYan, Zheng } 26895d4f98a2SYan Zheng drop_node_buffer(upper); 26903fd0a558SYan, Zheng } 26915d4f98a2SYan Zheng 26925d4f98a2SYan Zheng if (!upper->eb) { 26935d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 26943561b9dbSLiu Bo if (ret) { 26953561b9dbSLiu Bo if (ret < 0) 26965d4f98a2SYan Zheng err = ret; 26973561b9dbSLiu Bo else 26983561b9dbSLiu Bo err = -ENOENT; 26993561b9dbSLiu Bo 27003561b9dbSLiu Bo btrfs_release_path(path); 27015d4f98a2SYan Zheng break; 27025d4f98a2SYan Zheng } 27035d4f98a2SYan Zheng 27043fd0a558SYan, Zheng if (!upper->eb) { 27053fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 27063fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 27073fd0a558SYan, Zheng } else { 27083fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 27093fd0a558SYan, Zheng } 27103fd0a558SYan, Zheng 27113fd0a558SYan, Zheng upper->locked = 1; 27123fd0a558SYan, Zheng path->locks[upper->level] = 0; 27133fd0a558SYan, Zheng 27145d4f98a2SYan Zheng slot = path->slots[upper->level]; 2715b3b4aa74SDavid Sterba btrfs_release_path(path); 27165d4f98a2SYan Zheng } else { 27175d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 27185d4f98a2SYan Zheng &slot); 27195d4f98a2SYan Zheng BUG_ON(ret); 27205d4f98a2SYan Zheng } 27215d4f98a2SYan Zheng 27225d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 27233fd0a558SYan, Zheng if (lowest) { 27244547f4d8SLiu Bo if (bytenr != node->bytenr) { 27254547f4d8SLiu Bo btrfs_err(root->fs_info, 27264547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 27274547f4d8SLiu Bo bytenr, node->bytenr, slot, 27284547f4d8SLiu Bo upper->eb->start); 27294547f4d8SLiu Bo err = -EIO; 27304547f4d8SLiu Bo goto next; 27314547f4d8SLiu Bo } 27325d4f98a2SYan Zheng } else { 27333fd0a558SYan, Zheng if (node->eb->start == bytenr) 27343fd0a558SYan, Zheng goto next; 27355d4f98a2SYan Zheng } 27365d4f98a2SYan Zheng 2737da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 27385d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 2739581c1760SQu Wenruo btrfs_node_key_to_cpu(upper->eb, &first_key, slot); 2740581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, generation, 2741581c1760SQu Wenruo upper->level - 1, &first_key); 274264c043deSLiu Bo if (IS_ERR(eb)) { 274364c043deSLiu Bo err = PTR_ERR(eb); 274464c043deSLiu Bo goto next; 274564c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2746416bc658SJosef Bacik free_extent_buffer(eb); 274797d9a8a4STsutomu Itoh err = -EIO; 274897d9a8a4STsutomu Itoh goto next; 274997d9a8a4STsutomu Itoh } 27505d4f98a2SYan Zheng btrfs_tree_lock(eb); 27515d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 27525d4f98a2SYan Zheng 27535d4f98a2SYan Zheng if (!node->eb) { 27545d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 27555d4f98a2SYan Zheng slot, &eb); 27563fd0a558SYan, Zheng btrfs_tree_unlock(eb); 27573fd0a558SYan, Zheng free_extent_buffer(eb); 27585d4f98a2SYan Zheng if (ret < 0) { 27595d4f98a2SYan Zheng err = ret; 27603fd0a558SYan, Zheng goto next; 27615d4f98a2SYan Zheng } 27623fd0a558SYan, Zheng BUG_ON(node->eb != eb); 27635d4f98a2SYan Zheng } else { 27645d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 27655d4f98a2SYan Zheng node->eb->start); 27665d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 27675d4f98a2SYan Zheng trans->transid); 27685d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 27695d4f98a2SYan Zheng 277084f7d8e6SJosef Bacik ret = btrfs_inc_extent_ref(trans, root, 27715d4f98a2SYan Zheng node->eb->start, blocksize, 27725d4f98a2SYan Zheng upper->eb->start, 27735d4f98a2SYan Zheng btrfs_header_owner(upper->eb), 2774b06c4bf5SFilipe Manana node->level, 0); 27755d4f98a2SYan Zheng BUG_ON(ret); 27765d4f98a2SYan Zheng 27775d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 27785d4f98a2SYan Zheng BUG_ON(ret); 27795d4f98a2SYan Zheng } 27803fd0a558SYan, Zheng next: 27813fd0a558SYan, Zheng if (!upper->pending) 27823fd0a558SYan, Zheng drop_node_buffer(upper); 27833fd0a558SYan, Zheng else 27843fd0a558SYan, Zheng unlock_node_buffer(upper); 27853fd0a558SYan, Zheng if (err) 27863fd0a558SYan, Zheng break; 27875d4f98a2SYan Zheng } 27883fd0a558SYan, Zheng 27893fd0a558SYan, Zheng if (!err && node->pending) { 27903fd0a558SYan, Zheng drop_node_buffer(node); 27913fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 27923fd0a558SYan, Zheng node->pending = 0; 27935d4f98a2SYan Zheng } 27943fd0a558SYan, Zheng 27955d4f98a2SYan Zheng path->lowest_level = 0; 27963fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 27975d4f98a2SYan Zheng return err; 27985d4f98a2SYan Zheng } 27995d4f98a2SYan Zheng 28005d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 28013fd0a558SYan, Zheng struct reloc_control *rc, 28025d4f98a2SYan Zheng struct backref_node *node, 28035d4f98a2SYan Zheng struct btrfs_path *path) 28045d4f98a2SYan Zheng { 28055d4f98a2SYan Zheng struct btrfs_key key; 28065d4f98a2SYan Zheng 28075d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 28083fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 28095d4f98a2SYan Zheng } 28105d4f98a2SYan Zheng 28115d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 28123fd0a558SYan, Zheng struct reloc_control *rc, 28133fd0a558SYan, Zheng struct btrfs_path *path, int err) 28145d4f98a2SYan Zheng { 28153fd0a558SYan, Zheng LIST_HEAD(list); 28163fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 28175d4f98a2SYan Zheng struct backref_node *node; 28185d4f98a2SYan Zheng int level; 28195d4f98a2SYan Zheng int ret; 28205d4f98a2SYan Zheng 28215d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 28225d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 28235d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 28243fd0a558SYan, Zheng struct backref_node, list); 28253fd0a558SYan, Zheng list_move_tail(&node->list, &list); 28263fd0a558SYan, Zheng BUG_ON(!node->pending); 28275d4f98a2SYan Zheng 28283fd0a558SYan, Zheng if (!err) { 28293fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 28305d4f98a2SYan Zheng if (ret < 0) 28315d4f98a2SYan Zheng err = ret; 28325d4f98a2SYan Zheng } 28335d4f98a2SYan Zheng } 28343fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 28353fd0a558SYan, Zheng } 28365d4f98a2SYan Zheng return err; 28375d4f98a2SYan Zheng } 28385d4f98a2SYan Zheng 28395d4f98a2SYan Zheng static void mark_block_processed(struct reloc_control *rc, 28403fd0a558SYan, Zheng u64 bytenr, u32 blocksize) 28413fd0a558SYan, Zheng { 28423fd0a558SYan, Zheng set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, 2843ceeb0ae7SDavid Sterba EXTENT_DIRTY); 28443fd0a558SYan, Zheng } 28453fd0a558SYan, Zheng 28463fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 28475d4f98a2SYan Zheng struct backref_node *node) 28485d4f98a2SYan Zheng { 28495d4f98a2SYan Zheng u32 blocksize; 28505d4f98a2SYan Zheng if (node->level == 0 || 28515d4f98a2SYan Zheng in_block_group(node->bytenr, rc->block_group)) { 2852da17066cSJeff Mahoney blocksize = rc->extent_root->fs_info->nodesize; 28533fd0a558SYan, Zheng mark_block_processed(rc, node->bytenr, blocksize); 28545d4f98a2SYan Zheng } 28555d4f98a2SYan Zheng node->processed = 1; 28565d4f98a2SYan Zheng } 28575d4f98a2SYan Zheng 28585d4f98a2SYan Zheng /* 28595d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 28605d4f98a2SYan Zheng * as processed. 28615d4f98a2SYan Zheng */ 28625d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 28635d4f98a2SYan Zheng struct backref_node *node) 28645d4f98a2SYan Zheng { 28655d4f98a2SYan Zheng struct backref_node *next = node; 28665d4f98a2SYan Zheng struct backref_edge *edge; 28675d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28685d4f98a2SYan Zheng int index = 0; 28695d4f98a2SYan Zheng 28705d4f98a2SYan Zheng while (next) { 28715d4f98a2SYan Zheng cond_resched(); 28725d4f98a2SYan Zheng while (1) { 28735d4f98a2SYan Zheng if (next->processed) 28745d4f98a2SYan Zheng break; 28755d4f98a2SYan Zheng 28763fd0a558SYan, Zheng __mark_block_processed(rc, next); 28775d4f98a2SYan Zheng 28785d4f98a2SYan Zheng if (list_empty(&next->upper)) 28795d4f98a2SYan Zheng break; 28805d4f98a2SYan Zheng 28815d4f98a2SYan Zheng edge = list_entry(next->upper.next, 28825d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 28835d4f98a2SYan Zheng edges[index++] = edge; 28845d4f98a2SYan Zheng next = edge->node[UPPER]; 28855d4f98a2SYan Zheng } 28865d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 28875d4f98a2SYan Zheng } 28885d4f98a2SYan Zheng } 28895d4f98a2SYan Zheng 28907476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 28915d4f98a2SYan Zheng { 2892da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 28937476dfdaSDavid Sterba 28945d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 28959655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 28965d4f98a2SYan Zheng return 1; 28975d4f98a2SYan Zheng return 0; 28985d4f98a2SYan Zheng } 28995d4f98a2SYan Zheng 29002ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 29015d4f98a2SYan Zheng struct tree_block *block) 29025d4f98a2SYan Zheng { 29035d4f98a2SYan Zheng struct extent_buffer *eb; 29045d4f98a2SYan Zheng 29055d4f98a2SYan Zheng BUG_ON(block->key_ready); 2906581c1760SQu Wenruo eb = read_tree_block(fs_info, block->bytenr, block->key.offset, 2907581c1760SQu Wenruo block->level, NULL); 290864c043deSLiu Bo if (IS_ERR(eb)) { 290964c043deSLiu Bo return PTR_ERR(eb); 291064c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2911416bc658SJosef Bacik free_extent_buffer(eb); 2912416bc658SJosef Bacik return -EIO; 2913416bc658SJosef Bacik } 29145d4f98a2SYan Zheng WARN_ON(btrfs_header_level(eb) != block->level); 29155d4f98a2SYan Zheng if (block->level == 0) 29165d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 29175d4f98a2SYan Zheng else 29185d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 29195d4f98a2SYan Zheng free_extent_buffer(eb); 29205d4f98a2SYan Zheng block->key_ready = 1; 29215d4f98a2SYan Zheng return 0; 29225d4f98a2SYan Zheng } 29235d4f98a2SYan Zheng 29245d4f98a2SYan Zheng /* 29255d4f98a2SYan Zheng * helper function to relocate a tree block 29265d4f98a2SYan Zheng */ 29275d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 29285d4f98a2SYan Zheng struct reloc_control *rc, 29295d4f98a2SYan Zheng struct backref_node *node, 29305d4f98a2SYan Zheng struct btrfs_key *key, 29315d4f98a2SYan Zheng struct btrfs_path *path) 29325d4f98a2SYan Zheng { 29335d4f98a2SYan Zheng struct btrfs_root *root; 29343fd0a558SYan, Zheng int ret = 0; 29355d4f98a2SYan Zheng 29363fd0a558SYan, Zheng if (!node) 29375d4f98a2SYan Zheng return 0; 29383fd0a558SYan, Zheng 29393fd0a558SYan, Zheng BUG_ON(node->processed); 2940147d256eSZhaolei root = select_one_root(node); 29413fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 29423fd0a558SYan, Zheng update_processed_blocks(rc, node); 29433fd0a558SYan, Zheng goto out; 29445d4f98a2SYan Zheng } 29455d4f98a2SYan Zheng 294627cdeb70SMiao Xie if (!root || test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 29473fd0a558SYan, Zheng ret = reserve_metadata_space(trans, rc, node); 29483fd0a558SYan, Zheng if (ret) 29495d4f98a2SYan Zheng goto out; 29505d4f98a2SYan Zheng } 29513fd0a558SYan, Zheng 29523fd0a558SYan, Zheng if (root) { 295327cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 29543fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 29553fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 29563fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 29573fd0a558SYan, Zheng root = root->reloc_root; 29583fd0a558SYan, Zheng node->new_bytenr = root->node->start; 29593fd0a558SYan, Zheng node->root = root; 29603fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 29613fd0a558SYan, Zheng } else { 29625d4f98a2SYan Zheng path->lowest_level = node->level; 29635d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 2964b3b4aa74SDavid Sterba btrfs_release_path(path); 29653fd0a558SYan, Zheng if (ret > 0) 29665d4f98a2SYan Zheng ret = 0; 29673fd0a558SYan, Zheng } 29683fd0a558SYan, Zheng if (!ret) 29693fd0a558SYan, Zheng update_processed_blocks(rc, node); 29703fd0a558SYan, Zheng } else { 29713fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 29723fd0a558SYan, Zheng } 29735d4f98a2SYan Zheng out: 29740647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 29753fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 29765d4f98a2SYan Zheng return ret; 29775d4f98a2SYan Zheng } 29785d4f98a2SYan Zheng 29795d4f98a2SYan Zheng /* 29805d4f98a2SYan Zheng * relocate a list of blocks 29815d4f98a2SYan Zheng */ 29825d4f98a2SYan Zheng static noinline_for_stack 29835d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 29845d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 29855d4f98a2SYan Zheng { 29862ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 29875d4f98a2SYan Zheng struct backref_node *node; 29885d4f98a2SYan Zheng struct btrfs_path *path; 29895d4f98a2SYan Zheng struct tree_block *block; 29905d4f98a2SYan Zheng struct rb_node *rb_node; 29915d4f98a2SYan Zheng int ret; 29925d4f98a2SYan Zheng int err = 0; 29935d4f98a2SYan Zheng 29945d4f98a2SYan Zheng path = btrfs_alloc_path(); 2995e1a12670SLiu Bo if (!path) { 2996e1a12670SLiu Bo err = -ENOMEM; 299734c2b290SDavid Sterba goto out_free_blocks; 2998e1a12670SLiu Bo } 29995d4f98a2SYan Zheng 30005d4f98a2SYan Zheng rb_node = rb_first(blocks); 30015d4f98a2SYan Zheng while (rb_node) { 30025d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 30035d4f98a2SYan Zheng if (!block->key_ready) 30042ff7e61eSJeff Mahoney readahead_tree_block(fs_info, block->bytenr); 30055d4f98a2SYan Zheng rb_node = rb_next(rb_node); 30065d4f98a2SYan Zheng } 30075d4f98a2SYan Zheng 30085d4f98a2SYan Zheng rb_node = rb_first(blocks); 30095d4f98a2SYan Zheng while (rb_node) { 30105d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 301134c2b290SDavid Sterba if (!block->key_ready) { 30122ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 301334c2b290SDavid Sterba if (err) 301434c2b290SDavid Sterba goto out_free_path; 301534c2b290SDavid Sterba } 30165d4f98a2SYan Zheng rb_node = rb_next(rb_node); 30175d4f98a2SYan Zheng } 30185d4f98a2SYan Zheng 30195d4f98a2SYan Zheng rb_node = rb_first(blocks); 30205d4f98a2SYan Zheng while (rb_node) { 30215d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 30225d4f98a2SYan Zheng 30233fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 30245d4f98a2SYan Zheng block->level, block->bytenr); 30255d4f98a2SYan Zheng if (IS_ERR(node)) { 30265d4f98a2SYan Zheng err = PTR_ERR(node); 30275d4f98a2SYan Zheng goto out; 30285d4f98a2SYan Zheng } 30295d4f98a2SYan Zheng 30305d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 30315d4f98a2SYan Zheng path); 30325d4f98a2SYan Zheng if (ret < 0) { 30333fd0a558SYan, Zheng if (ret != -EAGAIN || rb_node == rb_first(blocks)) 30345d4f98a2SYan Zheng err = ret; 30355d4f98a2SYan Zheng goto out; 30365d4f98a2SYan Zheng } 30375d4f98a2SYan Zheng rb_node = rb_next(rb_node); 30385d4f98a2SYan Zheng } 30395d4f98a2SYan Zheng out: 30403fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 30415d4f98a2SYan Zheng 304234c2b290SDavid Sterba out_free_path: 30435d4f98a2SYan Zheng btrfs_free_path(path); 304434c2b290SDavid Sterba out_free_blocks: 3045e1a12670SLiu Bo free_block_list(blocks); 30465d4f98a2SYan Zheng return err; 30475d4f98a2SYan Zheng } 30485d4f98a2SYan Zheng 30495d4f98a2SYan Zheng static noinline_for_stack 3050efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3051efa56464SYan, Zheng struct file_extent_cluster *cluster) 3052efa56464SYan, Zheng { 3053efa56464SYan, Zheng u64 alloc_hint = 0; 3054efa56464SYan, Zheng u64 start; 3055efa56464SYan, Zheng u64 end; 3056efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3057efa56464SYan, Zheng u64 num_bytes; 3058efa56464SYan, Zheng int nr = 0; 3059efa56464SYan, Zheng int ret = 0; 3060dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 3061dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 306218513091SWang Xiaoguang u64 cur_offset; 3063364ecf36SQu Wenruo struct extent_changeset *data_reserved = NULL; 3064efa56464SYan, Zheng 3065efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 30665955102cSAl Viro inode_lock(inode); 3067efa56464SYan, Zheng 3068364ecf36SQu Wenruo ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start, 3069dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 3070efa56464SYan, Zheng if (ret) 3071efa56464SYan, Zheng goto out; 3072efa56464SYan, Zheng 307318513091SWang Xiaoguang cur_offset = prealloc_start; 3074efa56464SYan, Zheng while (nr < cluster->nr) { 3075efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3076efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3077efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3078efa56464SYan, Zheng else 3079efa56464SYan, Zheng end = cluster->end - offset; 3080efa56464SYan, Zheng 3081d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3082efa56464SYan, Zheng num_bytes = end + 1 - start; 308318513091SWang Xiaoguang if (cur_offset < start) 3084bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3085bc42bda2SQu Wenruo cur_offset, start - cur_offset); 3086efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3087efa56464SYan, Zheng num_bytes, num_bytes, 3088efa56464SYan, Zheng end + 1, &alloc_hint); 308918513091SWang Xiaoguang cur_offset = end + 1; 3090d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3091efa56464SYan, Zheng if (ret) 3092efa56464SYan, Zheng break; 3093efa56464SYan, Zheng nr++; 3094efa56464SYan, Zheng } 309518513091SWang Xiaoguang if (cur_offset < prealloc_end) 3096bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3097bc42bda2SQu Wenruo cur_offset, prealloc_end + 1 - cur_offset); 3098efa56464SYan, Zheng out: 30995955102cSAl Viro inode_unlock(inode); 3100364ecf36SQu Wenruo extent_changeset_free(data_reserved); 3101efa56464SYan, Zheng return ret; 3102efa56464SYan, Zheng } 3103efa56464SYan, Zheng 3104efa56464SYan, Zheng static noinline_for_stack 31050257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 31060257bb82SYan, Zheng u64 block_start) 31075d4f98a2SYan Zheng { 31080b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 31095d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 31105d4f98a2SYan Zheng struct extent_map *em; 31110257bb82SYan, Zheng int ret = 0; 31125d4f98a2SYan Zheng 3113172ddd60SDavid Sterba em = alloc_extent_map(); 31140257bb82SYan, Zheng if (!em) 31150257bb82SYan, Zheng return -ENOMEM; 31160257bb82SYan, Zheng 31175d4f98a2SYan Zheng em->start = start; 31180257bb82SYan, Zheng em->len = end + 1 - start; 31190257bb82SYan, Zheng em->block_len = em->len; 31200257bb82SYan, Zheng em->block_start = block_start; 31210b246afaSJeff Mahoney em->bdev = fs_info->fs_devices->latest_bdev; 31225d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 31235d4f98a2SYan Zheng 3124d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 31255d4f98a2SYan Zheng while (1) { 3126890871beSChris Mason write_lock(&em_tree->lock); 312709a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3128890871beSChris Mason write_unlock(&em_tree->lock); 31295d4f98a2SYan Zheng if (ret != -EEXIST) { 31305d4f98a2SYan Zheng free_extent_map(em); 31315d4f98a2SYan Zheng break; 31325d4f98a2SYan Zheng } 3133dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 31345d4f98a2SYan Zheng } 3135d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 31360257bb82SYan, Zheng return ret; 31370257bb82SYan, Zheng } 31385d4f98a2SYan Zheng 31390257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 31400257bb82SYan, Zheng struct file_extent_cluster *cluster) 31410257bb82SYan, Zheng { 31422ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 31430257bb82SYan, Zheng u64 page_start; 31440257bb82SYan, Zheng u64 page_end; 31450257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 31460257bb82SYan, Zheng unsigned long index; 31470257bb82SYan, Zheng unsigned long last_index; 31480257bb82SYan, Zheng struct page *page; 31490257bb82SYan, Zheng struct file_ra_state *ra; 31503b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 31510257bb82SYan, Zheng int nr = 0; 31520257bb82SYan, Zheng int ret = 0; 31530257bb82SYan, Zheng 31540257bb82SYan, Zheng if (!cluster->nr) 31550257bb82SYan, Zheng return 0; 31560257bb82SYan, Zheng 31570257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 31580257bb82SYan, Zheng if (!ra) 31590257bb82SYan, Zheng return -ENOMEM; 31600257bb82SYan, Zheng 3161efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 31620257bb82SYan, Zheng if (ret) 3163efa56464SYan, Zheng goto out; 31640257bb82SYan, Zheng 31650257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 31660257bb82SYan, Zheng 3167efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3168efa56464SYan, Zheng cluster->end - offset, cluster->start); 3169efa56464SYan, Zheng if (ret) 3170efa56464SYan, Zheng goto out; 3171efa56464SYan, Zheng 317209cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 317309cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 31740257bb82SYan, Zheng while (index <= last_index) { 31759f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 31769f3db423SNikolay Borisov PAGE_SIZE); 3177efa56464SYan, Zheng if (ret) 3178efa56464SYan, Zheng goto out; 3179efa56464SYan, Zheng 31800257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 31810257bb82SYan, Zheng if (!page) { 31820257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 31830257bb82SYan, Zheng ra, NULL, index, 31840257bb82SYan, Zheng last_index + 1 - index); 3185a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 31863b16a4e3SJosef Bacik mask); 31870257bb82SYan, Zheng if (!page) { 3188691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 318943b18595SQu Wenruo PAGE_SIZE, true); 31900257bb82SYan, Zheng ret = -ENOMEM; 3191efa56464SYan, Zheng goto out; 31920257bb82SYan, Zheng } 31930257bb82SYan, Zheng } 31940257bb82SYan, Zheng 31950257bb82SYan, Zheng if (PageReadahead(page)) { 31960257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 31970257bb82SYan, Zheng ra, NULL, page, index, 31980257bb82SYan, Zheng last_index + 1 - index); 31990257bb82SYan, Zheng } 32000257bb82SYan, Zheng 32010257bb82SYan, Zheng if (!PageUptodate(page)) { 32020257bb82SYan, Zheng btrfs_readpage(NULL, page); 32030257bb82SYan, Zheng lock_page(page); 32040257bb82SYan, Zheng if (!PageUptodate(page)) { 32050257bb82SYan, Zheng unlock_page(page); 320609cbfeafSKirill A. Shutemov put_page(page); 3207691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 320843b18595SQu Wenruo PAGE_SIZE, true); 32098b62f87bSJosef Bacik btrfs_delalloc_release_extents(BTRFS_I(inode), 321043b18595SQu Wenruo PAGE_SIZE, true); 32110257bb82SYan, Zheng ret = -EIO; 3212efa56464SYan, Zheng goto out; 32130257bb82SYan, Zheng } 32140257bb82SYan, Zheng } 32150257bb82SYan, Zheng 32164eee4fa4SMiao Xie page_start = page_offset(page); 321709cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 32180257bb82SYan, Zheng 3219d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 32200257bb82SYan, Zheng 32210257bb82SYan, Zheng set_page_extent_mapped(page); 32220257bb82SYan, Zheng 32230257bb82SYan, Zheng if (nr < cluster->nr && 32240257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 32250257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 32260257bb82SYan, Zheng page_start, page_end, 3227ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 32280257bb82SYan, Zheng nr++; 32290257bb82SYan, Zheng } 32300257bb82SYan, Zheng 3231765f3cebSNikolay Borisov ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0, 3232765f3cebSNikolay Borisov NULL, 0); 3233765f3cebSNikolay Borisov if (ret) { 3234765f3cebSNikolay Borisov unlock_page(page); 3235765f3cebSNikolay Borisov put_page(page); 3236765f3cebSNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 323743b18595SQu Wenruo PAGE_SIZE, true); 3238765f3cebSNikolay Borisov btrfs_delalloc_release_extents(BTRFS_I(inode), 323943b18595SQu Wenruo PAGE_SIZE, true); 3240765f3cebSNikolay Borisov 3241765f3cebSNikolay Borisov clear_extent_bits(&BTRFS_I(inode)->io_tree, 3242765f3cebSNikolay Borisov page_start, page_end, 3243765f3cebSNikolay Borisov EXTENT_LOCKED | EXTENT_BOUNDARY); 3244765f3cebSNikolay Borisov goto out; 3245765f3cebSNikolay Borisov 3246765f3cebSNikolay Borisov } 32470257bb82SYan, Zheng set_page_dirty(page); 32480257bb82SYan, Zheng 32490257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3250d0082371SJeff Mahoney page_start, page_end); 32510257bb82SYan, Zheng unlock_page(page); 325209cbfeafSKirill A. Shutemov put_page(page); 32530257bb82SYan, Zheng 32540257bb82SYan, Zheng index++; 325543b18595SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE, 325643b18595SQu Wenruo false); 3257efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 32582ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 32590257bb82SYan, Zheng } 32600257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3261efa56464SYan, Zheng out: 32620257bb82SYan, Zheng kfree(ra); 32630257bb82SYan, Zheng return ret; 32640257bb82SYan, Zheng } 32650257bb82SYan, Zheng 32660257bb82SYan, Zheng static noinline_for_stack 32670257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 32680257bb82SYan, Zheng struct file_extent_cluster *cluster) 32690257bb82SYan, Zheng { 32700257bb82SYan, Zheng int ret; 32710257bb82SYan, Zheng 32720257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 32730257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 32740257bb82SYan, Zheng if (ret) 32750257bb82SYan, Zheng return ret; 32760257bb82SYan, Zheng cluster->nr = 0; 32770257bb82SYan, Zheng } 32780257bb82SYan, Zheng 32790257bb82SYan, Zheng if (!cluster->nr) 32800257bb82SYan, Zheng cluster->start = extent_key->objectid; 32810257bb82SYan, Zheng else 32820257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 32830257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 32840257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 32850257bb82SYan, Zheng cluster->nr++; 32860257bb82SYan, Zheng 32870257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 32880257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 32890257bb82SYan, Zheng if (ret) 32900257bb82SYan, Zheng return ret; 32910257bb82SYan, Zheng cluster->nr = 0; 32920257bb82SYan, Zheng } 32930257bb82SYan, Zheng return 0; 32945d4f98a2SYan Zheng } 32955d4f98a2SYan Zheng 32965d4f98a2SYan Zheng /* 32975d4f98a2SYan Zheng * helper to add a tree block to the list. 32985d4f98a2SYan Zheng * the major work is getting the generation and level of the block 32995d4f98a2SYan Zheng */ 33005d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 33015d4f98a2SYan Zheng struct btrfs_key *extent_key, 33025d4f98a2SYan Zheng struct btrfs_path *path, 33035d4f98a2SYan Zheng struct rb_root *blocks) 33045d4f98a2SYan Zheng { 33055d4f98a2SYan Zheng struct extent_buffer *eb; 33065d4f98a2SYan Zheng struct btrfs_extent_item *ei; 33075d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 33085d4f98a2SYan Zheng struct tree_block *block; 33095d4f98a2SYan Zheng struct rb_node *rb_node; 33105d4f98a2SYan Zheng u32 item_size; 33115d4f98a2SYan Zheng int level = -1; 33127fdf4b60SWang Shilong u64 generation; 33135d4f98a2SYan Zheng 33145d4f98a2SYan Zheng eb = path->nodes[0]; 33155d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 33165d4f98a2SYan Zheng 33173173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 33183173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 33195d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 33205d4f98a2SYan Zheng struct btrfs_extent_item); 33213173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 33225d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 33235d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 33245d4f98a2SYan Zheng } else { 33253173a18fSJosef Bacik level = (int)extent_key->offset; 33263173a18fSJosef Bacik } 33273173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 3328*ba3c2b19SNikolay Borisov } else if (item_size == sizeof(struct btrfs_extent_item_v0)) { 3329*ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3330*ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3331*ba3c2b19SNikolay Borisov return -EINVAL; 33323173a18fSJosef Bacik } else { 33335d4f98a2SYan Zheng BUG(); 33345d4f98a2SYan Zheng } 33355d4f98a2SYan Zheng 3336b3b4aa74SDavid Sterba btrfs_release_path(path); 33375d4f98a2SYan Zheng 33385d4f98a2SYan Zheng BUG_ON(level == -1); 33395d4f98a2SYan Zheng 33405d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 33415d4f98a2SYan Zheng if (!block) 33425d4f98a2SYan Zheng return -ENOMEM; 33435d4f98a2SYan Zheng 33445d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3345da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 33465d4f98a2SYan Zheng block->key.offset = generation; 33475d4f98a2SYan Zheng block->level = level; 33485d4f98a2SYan Zheng block->key_ready = 0; 33495d4f98a2SYan Zheng 33505d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 335143c04fb1SJeff Mahoney if (rb_node) 335243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 33535d4f98a2SYan Zheng 33545d4f98a2SYan Zheng return 0; 33555d4f98a2SYan Zheng } 33565d4f98a2SYan Zheng 33575d4f98a2SYan Zheng /* 33585d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 33595d4f98a2SYan Zheng */ 33605d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 33615d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 33625d4f98a2SYan Zheng struct rb_root *blocks) 33635d4f98a2SYan Zheng { 33640b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 33655d4f98a2SYan Zheng struct btrfs_path *path; 33665d4f98a2SYan Zheng struct btrfs_key key; 33675d4f98a2SYan Zheng int ret; 33680b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 33695d4f98a2SYan Zheng 33707476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 33715d4f98a2SYan Zheng return 0; 33725d4f98a2SYan Zheng 33735d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 33745d4f98a2SYan Zheng return 0; 33755d4f98a2SYan Zheng 33765d4f98a2SYan Zheng path = btrfs_alloc_path(); 33775d4f98a2SYan Zheng if (!path) 33785d4f98a2SYan Zheng return -ENOMEM; 3379aee68ee5SJosef Bacik again: 33805d4f98a2SYan Zheng key.objectid = bytenr; 3381aee68ee5SJosef Bacik if (skinny) { 3382aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3383aee68ee5SJosef Bacik key.offset = (u64)-1; 3384aee68ee5SJosef Bacik } else { 33855d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 33865d4f98a2SYan Zheng key.offset = blocksize; 3387aee68ee5SJosef Bacik } 33885d4f98a2SYan Zheng 33895d4f98a2SYan Zheng path->search_commit_root = 1; 33905d4f98a2SYan Zheng path->skip_locking = 1; 33915d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 33925d4f98a2SYan Zheng if (ret < 0) 33935d4f98a2SYan Zheng goto out; 33945d4f98a2SYan Zheng 3395aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3396aee68ee5SJosef Bacik if (path->slots[0]) { 3397aee68ee5SJosef Bacik path->slots[0]--; 3398aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3399aee68ee5SJosef Bacik path->slots[0]); 34003173a18fSJosef Bacik if (key.objectid == bytenr && 3401aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3402aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3403aee68ee5SJosef Bacik key.offset == blocksize))) 34043173a18fSJosef Bacik ret = 0; 34053173a18fSJosef Bacik } 3406aee68ee5SJosef Bacik 3407aee68ee5SJosef Bacik if (ret) { 3408aee68ee5SJosef Bacik skinny = false; 3409aee68ee5SJosef Bacik btrfs_release_path(path); 3410aee68ee5SJosef Bacik goto again; 3411aee68ee5SJosef Bacik } 3412aee68ee5SJosef Bacik } 3413cdccee99SLiu Bo if (ret) { 3414cdccee99SLiu Bo ASSERT(ret == 1); 3415cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3416cdccee99SLiu Bo btrfs_err(fs_info, 3417cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3418cdccee99SLiu Bo bytenr); 3419cdccee99SLiu Bo WARN_ON(1); 3420cdccee99SLiu Bo ret = -EINVAL; 3421cdccee99SLiu Bo goto out; 3422cdccee99SLiu Bo } 34233173a18fSJosef Bacik 34245d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 34255d4f98a2SYan Zheng out: 34265d4f98a2SYan Zheng btrfs_free_path(path); 34275d4f98a2SYan Zheng return ret; 34285d4f98a2SYan Zheng } 34295d4f98a2SYan Zheng 34305d4f98a2SYan Zheng /* 34315d4f98a2SYan Zheng * helper to check if the block use full backrefs for pointers in it 34325d4f98a2SYan Zheng */ 34335d4f98a2SYan Zheng static int block_use_full_backref(struct reloc_control *rc, 34345d4f98a2SYan Zheng struct extent_buffer *eb) 34355d4f98a2SYan Zheng { 34365d4f98a2SYan Zheng u64 flags; 34375d4f98a2SYan Zheng int ret; 34385d4f98a2SYan Zheng 34395d4f98a2SYan Zheng if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) || 34405d4f98a2SYan Zheng btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV) 34415d4f98a2SYan Zheng return 1; 34425d4f98a2SYan Zheng 34432ff7e61eSJeff Mahoney ret = btrfs_lookup_extent_info(NULL, rc->extent_root->fs_info, 34443173a18fSJosef Bacik eb->start, btrfs_header_level(eb), 1, 34453173a18fSJosef Bacik NULL, &flags); 34465d4f98a2SYan Zheng BUG_ON(ret); 34475d4f98a2SYan Zheng 34485d4f98a2SYan Zheng if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) 34495d4f98a2SYan Zheng ret = 1; 34505d4f98a2SYan Zheng else 34515d4f98a2SYan Zheng ret = 0; 34525d4f98a2SYan Zheng return ret; 34535d4f98a2SYan Zheng } 34545d4f98a2SYan Zheng 34550af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 34561bbc621eSChris Mason struct btrfs_block_group_cache *block_group, 34571bbc621eSChris Mason struct inode *inode, 34581bbc621eSChris Mason u64 ino) 34590af3d00bSJosef Bacik { 34600af3d00bSJosef Bacik struct btrfs_key key; 34610af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 34620af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 34630af3d00bSJosef Bacik int ret = 0; 34640af3d00bSJosef Bacik 34650af3d00bSJosef Bacik if (inode) 34660af3d00bSJosef Bacik goto truncate; 34670af3d00bSJosef Bacik 34680af3d00bSJosef Bacik key.objectid = ino; 34690af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 34700af3d00bSJosef Bacik key.offset = 0; 34710af3d00bSJosef Bacik 34720af3d00bSJosef Bacik inode = btrfs_iget(fs_info->sb, &key, root, NULL); 3473f54fb859STsutomu Itoh if (IS_ERR(inode) || is_bad_inode(inode)) { 3474f54fb859STsutomu Itoh if (!IS_ERR(inode)) 34750af3d00bSJosef Bacik iput(inode); 34760af3d00bSJosef Bacik return -ENOENT; 34770af3d00bSJosef Bacik } 34780af3d00bSJosef Bacik 34790af3d00bSJosef Bacik truncate: 34802ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 34817b61cd92SMiao Xie &fs_info->global_block_rsv); 34827b61cd92SMiao Xie if (ret) 34837b61cd92SMiao Xie goto out; 34847b61cd92SMiao Xie 34857a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 34860af3d00bSJosef Bacik if (IS_ERR(trans)) { 34873612b495STsutomu Itoh ret = PTR_ERR(trans); 34880af3d00bSJosef Bacik goto out; 34890af3d00bSJosef Bacik } 34900af3d00bSJosef Bacik 349177ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 34920af3d00bSJosef Bacik 34933a45bb20SJeff Mahoney btrfs_end_transaction(trans); 34942ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 34950af3d00bSJosef Bacik out: 34960af3d00bSJosef Bacik iput(inode); 34970af3d00bSJosef Bacik return ret; 34980af3d00bSJosef Bacik } 34990af3d00bSJosef Bacik 35005d4f98a2SYan Zheng /* 35015d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY 35025d4f98a2SYan Zheng * this function scans fs tree to find blocks reference the data extent 35035d4f98a2SYan Zheng */ 35045d4f98a2SYan Zheng static int find_data_references(struct reloc_control *rc, 35055d4f98a2SYan Zheng struct btrfs_key *extent_key, 35065d4f98a2SYan Zheng struct extent_buffer *leaf, 35075d4f98a2SYan Zheng struct btrfs_extent_data_ref *ref, 35085d4f98a2SYan Zheng struct rb_root *blocks) 35095d4f98a2SYan Zheng { 35100b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 35115d4f98a2SYan Zheng struct btrfs_path *path; 35125d4f98a2SYan Zheng struct tree_block *block; 35135d4f98a2SYan Zheng struct btrfs_root *root; 35145d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 35155d4f98a2SYan Zheng struct rb_node *rb_node; 35165d4f98a2SYan Zheng struct btrfs_key key; 35175d4f98a2SYan Zheng u64 ref_root; 35185d4f98a2SYan Zheng u64 ref_objectid; 35195d4f98a2SYan Zheng u64 ref_offset; 35205d4f98a2SYan Zheng u32 ref_count; 35215d4f98a2SYan Zheng u32 nritems; 35225d4f98a2SYan Zheng int err = 0; 35235d4f98a2SYan Zheng int added = 0; 35245d4f98a2SYan Zheng int counted; 35255d4f98a2SYan Zheng int ret; 35265d4f98a2SYan Zheng 35275d4f98a2SYan Zheng ref_root = btrfs_extent_data_ref_root(leaf, ref); 35285d4f98a2SYan Zheng ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref); 35295d4f98a2SYan Zheng ref_offset = btrfs_extent_data_ref_offset(leaf, ref); 35305d4f98a2SYan Zheng ref_count = btrfs_extent_data_ref_count(leaf, ref); 35315d4f98a2SYan Zheng 35320af3d00bSJosef Bacik /* 35330af3d00bSJosef Bacik * This is an extent belonging to the free space cache, lets just delete 35340af3d00bSJosef Bacik * it and redo the search. 35350af3d00bSJosef Bacik */ 35360af3d00bSJosef Bacik if (ref_root == BTRFS_ROOT_TREE_OBJECTID) { 35370b246afaSJeff Mahoney ret = delete_block_group_cache(fs_info, rc->block_group, 35380af3d00bSJosef Bacik NULL, ref_objectid); 35390af3d00bSJosef Bacik if (ret != -ENOENT) 35400af3d00bSJosef Bacik return ret; 35410af3d00bSJosef Bacik ret = 0; 35420af3d00bSJosef Bacik } 35430af3d00bSJosef Bacik 35440af3d00bSJosef Bacik path = btrfs_alloc_path(); 35450af3d00bSJosef Bacik if (!path) 35460af3d00bSJosef Bacik return -ENOMEM; 3547e4058b54SDavid Sterba path->reada = READA_FORWARD; 35480af3d00bSJosef Bacik 35490b246afaSJeff Mahoney root = read_fs_root(fs_info, ref_root); 35505d4f98a2SYan Zheng if (IS_ERR(root)) { 35515d4f98a2SYan Zheng err = PTR_ERR(root); 35525d4f98a2SYan Zheng goto out; 35535d4f98a2SYan Zheng } 35545d4f98a2SYan Zheng 35555d4f98a2SYan Zheng key.objectid = ref_objectid; 35565d4f98a2SYan Zheng key.type = BTRFS_EXTENT_DATA_KEY; 355784850e8dSYan, Zheng if (ref_offset > ((u64)-1 << 32)) 355884850e8dSYan, Zheng key.offset = 0; 355984850e8dSYan, Zheng else 356084850e8dSYan, Zheng key.offset = ref_offset; 35615d4f98a2SYan Zheng 35625d4f98a2SYan Zheng path->search_commit_root = 1; 35635d4f98a2SYan Zheng path->skip_locking = 1; 35645d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 35655d4f98a2SYan Zheng if (ret < 0) { 35665d4f98a2SYan Zheng err = ret; 35675d4f98a2SYan Zheng goto out; 35685d4f98a2SYan Zheng } 35695d4f98a2SYan Zheng 35705d4f98a2SYan Zheng leaf = path->nodes[0]; 35715d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 35725d4f98a2SYan Zheng /* 35735d4f98a2SYan Zheng * the references in tree blocks that use full backrefs 35745d4f98a2SYan Zheng * are not counted in 35755d4f98a2SYan Zheng */ 35765d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 35775d4f98a2SYan Zheng counted = 0; 35785d4f98a2SYan Zheng else 35795d4f98a2SYan Zheng counted = 1; 35805d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 35815d4f98a2SYan Zheng if (rb_node) { 35825d4f98a2SYan Zheng if (counted) 35835d4f98a2SYan Zheng added = 1; 35845d4f98a2SYan Zheng else 35855d4f98a2SYan Zheng path->slots[0] = nritems; 35865d4f98a2SYan Zheng } 35875d4f98a2SYan Zheng 35885d4f98a2SYan Zheng while (ref_count > 0) { 35895d4f98a2SYan Zheng while (path->slots[0] >= nritems) { 35905d4f98a2SYan Zheng ret = btrfs_next_leaf(root, path); 35915d4f98a2SYan Zheng if (ret < 0) { 35925d4f98a2SYan Zheng err = ret; 35935d4f98a2SYan Zheng goto out; 35945d4f98a2SYan Zheng } 3595fae7f21cSDulshani Gunawardhana if (WARN_ON(ret > 0)) 35965d4f98a2SYan Zheng goto out; 35975d4f98a2SYan Zheng 35985d4f98a2SYan Zheng leaf = path->nodes[0]; 35995d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 36005d4f98a2SYan Zheng added = 0; 36015d4f98a2SYan Zheng 36025d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 36035d4f98a2SYan Zheng counted = 0; 36045d4f98a2SYan Zheng else 36055d4f98a2SYan Zheng counted = 1; 36065d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 36075d4f98a2SYan Zheng if (rb_node) { 36085d4f98a2SYan Zheng if (counted) 36095d4f98a2SYan Zheng added = 1; 36105d4f98a2SYan Zheng else 36115d4f98a2SYan Zheng path->slots[0] = nritems; 36125d4f98a2SYan Zheng } 36135d4f98a2SYan Zheng } 36145d4f98a2SYan Zheng 36155d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 3616fae7f21cSDulshani Gunawardhana if (WARN_ON(key.objectid != ref_objectid || 3617fae7f21cSDulshani Gunawardhana key.type != BTRFS_EXTENT_DATA_KEY)) 36185d4f98a2SYan Zheng break; 36195d4f98a2SYan Zheng 36205d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 36215d4f98a2SYan Zheng struct btrfs_file_extent_item); 36225d4f98a2SYan Zheng 36235d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 36245d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 36255d4f98a2SYan Zheng goto next; 36265d4f98a2SYan Zheng 36275d4f98a2SYan Zheng if (btrfs_file_extent_disk_bytenr(leaf, fi) != 36285d4f98a2SYan Zheng extent_key->objectid) 36295d4f98a2SYan Zheng goto next; 36305d4f98a2SYan Zheng 36315d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 36325d4f98a2SYan Zheng if (key.offset != ref_offset) 36335d4f98a2SYan Zheng goto next; 36345d4f98a2SYan Zheng 36355d4f98a2SYan Zheng if (counted) 36365d4f98a2SYan Zheng ref_count--; 36375d4f98a2SYan Zheng if (added) 36385d4f98a2SYan Zheng goto next; 36395d4f98a2SYan Zheng 36407476dfdaSDavid Sterba if (!tree_block_processed(leaf->start, rc)) { 36415d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 36425d4f98a2SYan Zheng if (!block) { 36435d4f98a2SYan Zheng err = -ENOMEM; 36445d4f98a2SYan Zheng break; 36455d4f98a2SYan Zheng } 36465d4f98a2SYan Zheng block->bytenr = leaf->start; 36475d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &block->key, 0); 36485d4f98a2SYan Zheng block->level = 0; 36495d4f98a2SYan Zheng block->key_ready = 1; 36505d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, 36515d4f98a2SYan Zheng &block->rb_node); 365243c04fb1SJeff Mahoney if (rb_node) 365343c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 365443c04fb1SJeff Mahoney block->bytenr); 36555d4f98a2SYan Zheng } 36565d4f98a2SYan Zheng if (counted) 36575d4f98a2SYan Zheng added = 1; 36585d4f98a2SYan Zheng else 36595d4f98a2SYan Zheng path->slots[0] = nritems; 36605d4f98a2SYan Zheng next: 36615d4f98a2SYan Zheng path->slots[0]++; 36625d4f98a2SYan Zheng 36635d4f98a2SYan Zheng } 36645d4f98a2SYan Zheng out: 36655d4f98a2SYan Zheng btrfs_free_path(path); 36665d4f98a2SYan Zheng return err; 36675d4f98a2SYan Zheng } 36685d4f98a2SYan Zheng 36695d4f98a2SYan Zheng /* 36702c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 36715d4f98a2SYan Zheng */ 36725d4f98a2SYan Zheng static noinline_for_stack 36735d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 36745d4f98a2SYan Zheng struct btrfs_key *extent_key, 36755d4f98a2SYan Zheng struct btrfs_path *path, 36765d4f98a2SYan Zheng struct rb_root *blocks) 36775d4f98a2SYan Zheng { 36785d4f98a2SYan Zheng struct btrfs_key key; 36795d4f98a2SYan Zheng struct extent_buffer *eb; 36805d4f98a2SYan Zheng struct btrfs_extent_data_ref *dref; 36815d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 36825d4f98a2SYan Zheng unsigned long ptr; 36835d4f98a2SYan Zheng unsigned long end; 3684da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 3685647f63bdSFilipe David Borba Manana int ret = 0; 36865d4f98a2SYan Zheng int err = 0; 36875d4f98a2SYan Zheng 36885d4f98a2SYan Zheng eb = path->nodes[0]; 36895d4f98a2SYan Zheng ptr = btrfs_item_ptr_offset(eb, path->slots[0]); 36905d4f98a2SYan Zheng end = ptr + btrfs_item_size_nr(eb, path->slots[0]); 36915d4f98a2SYan Zheng ptr += sizeof(struct btrfs_extent_item); 36925d4f98a2SYan Zheng 36935d4f98a2SYan Zheng while (ptr < end) { 36945d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 36953de28d57SLiu Bo key.type = btrfs_get_extent_inline_ref_type(eb, iref, 36963de28d57SLiu Bo BTRFS_REF_TYPE_DATA); 36975d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 36985d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 36995d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 37005d4f98a2SYan Zheng blocks); 37015d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 37025d4f98a2SYan Zheng dref = (struct btrfs_extent_data_ref *)(&iref->offset); 37035d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 37045d4f98a2SYan Zheng eb, dref, blocks); 37055d4f98a2SYan Zheng } else { 3706af431dcbSSu Yue ret = -EUCLEAN; 3707b14c55a1SLiu Bo btrfs_err(rc->extent_root->fs_info, 3708b14c55a1SLiu Bo "extent %llu slot %d has an invalid inline ref type", 3709b14c55a1SLiu Bo eb->start, path->slots[0]); 37105d4f98a2SYan Zheng } 3711647f63bdSFilipe David Borba Manana if (ret) { 3712647f63bdSFilipe David Borba Manana err = ret; 3713647f63bdSFilipe David Borba Manana goto out; 3714647f63bdSFilipe David Borba Manana } 37155d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 37165d4f98a2SYan Zheng } 37175d4f98a2SYan Zheng WARN_ON(ptr > end); 37185d4f98a2SYan Zheng 37195d4f98a2SYan Zheng while (1) { 37205d4f98a2SYan Zheng cond_resched(); 37215d4f98a2SYan Zheng eb = path->nodes[0]; 37225d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(eb)) { 37235d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 37245d4f98a2SYan Zheng if (ret < 0) { 37255d4f98a2SYan Zheng err = ret; 37265d4f98a2SYan Zheng break; 37275d4f98a2SYan Zheng } 37285d4f98a2SYan Zheng if (ret > 0) 37295d4f98a2SYan Zheng break; 37305d4f98a2SYan Zheng eb = path->nodes[0]; 37315d4f98a2SYan Zheng } 37325d4f98a2SYan Zheng 37335d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path->slots[0]); 37345d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 37355d4f98a2SYan Zheng break; 37365d4f98a2SYan Zheng 37375d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 37385d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 37395d4f98a2SYan Zheng blocks); 37405d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 37415d4f98a2SYan Zheng dref = btrfs_item_ptr(eb, path->slots[0], 37425d4f98a2SYan Zheng struct btrfs_extent_data_ref); 37435d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 37445d4f98a2SYan Zheng eb, dref, blocks); 3745*ba3c2b19SNikolay Borisov } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) { 3746*ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3747*ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3748*ba3c2b19SNikolay Borisov ret = -EINVAL; 37495d4f98a2SYan Zheng } else { 37505d4f98a2SYan Zheng ret = 0; 37515d4f98a2SYan Zheng } 37525d4f98a2SYan Zheng if (ret) { 37535d4f98a2SYan Zheng err = ret; 37545d4f98a2SYan Zheng break; 37555d4f98a2SYan Zheng } 37565d4f98a2SYan Zheng path->slots[0]++; 37575d4f98a2SYan Zheng } 3758647f63bdSFilipe David Borba Manana out: 3759b3b4aa74SDavid Sterba btrfs_release_path(path); 37605d4f98a2SYan Zheng if (err) 37615d4f98a2SYan Zheng free_block_list(blocks); 37625d4f98a2SYan Zheng return err; 37635d4f98a2SYan Zheng } 37645d4f98a2SYan Zheng 37655d4f98a2SYan Zheng /* 37662c016dc2SLiu Bo * helper to find next unprocessed extent 37675d4f98a2SYan Zheng */ 37685d4f98a2SYan Zheng static noinline_for_stack 3769147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 37703fd0a558SYan, Zheng struct btrfs_key *extent_key) 37715d4f98a2SYan Zheng { 37720b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 37735d4f98a2SYan Zheng struct btrfs_key key; 37745d4f98a2SYan Zheng struct extent_buffer *leaf; 37755d4f98a2SYan Zheng u64 start, end, last; 37765d4f98a2SYan Zheng int ret; 37775d4f98a2SYan Zheng 37785d4f98a2SYan Zheng last = rc->block_group->key.objectid + rc->block_group->key.offset; 37795d4f98a2SYan Zheng while (1) { 37805d4f98a2SYan Zheng cond_resched(); 37815d4f98a2SYan Zheng if (rc->search_start >= last) { 37825d4f98a2SYan Zheng ret = 1; 37835d4f98a2SYan Zheng break; 37845d4f98a2SYan Zheng } 37855d4f98a2SYan Zheng 37865d4f98a2SYan Zheng key.objectid = rc->search_start; 37875d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 37885d4f98a2SYan Zheng key.offset = 0; 37895d4f98a2SYan Zheng 37905d4f98a2SYan Zheng path->search_commit_root = 1; 37915d4f98a2SYan Zheng path->skip_locking = 1; 37925d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 37935d4f98a2SYan Zheng 0, 0); 37945d4f98a2SYan Zheng if (ret < 0) 37955d4f98a2SYan Zheng break; 37965d4f98a2SYan Zheng next: 37975d4f98a2SYan Zheng leaf = path->nodes[0]; 37985d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 37995d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 38005d4f98a2SYan Zheng if (ret != 0) 38015d4f98a2SYan Zheng break; 38025d4f98a2SYan Zheng leaf = path->nodes[0]; 38035d4f98a2SYan Zheng } 38045d4f98a2SYan Zheng 38055d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 38065d4f98a2SYan Zheng if (key.objectid >= last) { 38075d4f98a2SYan Zheng ret = 1; 38085d4f98a2SYan Zheng break; 38095d4f98a2SYan Zheng } 38105d4f98a2SYan Zheng 38113173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 38123173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 38133173a18fSJosef Bacik path->slots[0]++; 38143173a18fSJosef Bacik goto next; 38153173a18fSJosef Bacik } 38163173a18fSJosef Bacik 38173173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 38185d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 38195d4f98a2SYan Zheng path->slots[0]++; 38205d4f98a2SYan Zheng goto next; 38215d4f98a2SYan Zheng } 38225d4f98a2SYan Zheng 38233173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 38240b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 38253173a18fSJosef Bacik rc->search_start) { 38263173a18fSJosef Bacik path->slots[0]++; 38273173a18fSJosef Bacik goto next; 38283173a18fSJosef Bacik } 38293173a18fSJosef Bacik 38305d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 38315d4f98a2SYan Zheng key.objectid, &start, &end, 3832e6138876SJosef Bacik EXTENT_DIRTY, NULL); 38335d4f98a2SYan Zheng 38345d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3835b3b4aa74SDavid Sterba btrfs_release_path(path); 38365d4f98a2SYan Zheng rc->search_start = end + 1; 38375d4f98a2SYan Zheng } else { 38383173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 38395d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 38403173a18fSJosef Bacik else 38413173a18fSJosef Bacik rc->search_start = key.objectid + 38420b246afaSJeff Mahoney fs_info->nodesize; 38433fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 38445d4f98a2SYan Zheng return 0; 38455d4f98a2SYan Zheng } 38465d4f98a2SYan Zheng } 3847b3b4aa74SDavid Sterba btrfs_release_path(path); 38485d4f98a2SYan Zheng return ret; 38495d4f98a2SYan Zheng } 38505d4f98a2SYan Zheng 38515d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 38525d4f98a2SYan Zheng { 38535d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38547585717fSChris Mason 38557585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 38565d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 38577585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 38585d4f98a2SYan Zheng } 38595d4f98a2SYan Zheng 38605d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 38615d4f98a2SYan Zheng { 38625d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38637585717fSChris Mason 38647585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 38655d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 38667585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 38675d4f98a2SYan Zheng } 38685d4f98a2SYan Zheng 38695d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 38705d4f98a2SYan Zheng { 38715d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 38725d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 38735d4f98a2SYan Zheng return 1; 38745d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 38755d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 38765d4f98a2SYan Zheng return 1; 38775d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 38785d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 38795d4f98a2SYan Zheng return 1; 38805d4f98a2SYan Zheng return 0; 38815d4f98a2SYan Zheng } 38825d4f98a2SYan Zheng 38833fd0a558SYan, Zheng static noinline_for_stack 38843fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 38853fd0a558SYan, Zheng { 38863fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3887ac2fabacSJosef Bacik int ret; 38883fd0a558SYan, Zheng 38892ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 389066d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 38913fd0a558SYan, Zheng if (!rc->block_rsv) 38923fd0a558SYan, Zheng return -ENOMEM; 38933fd0a558SYan, Zheng 38943fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 38953fd0a558SYan, Zheng rc->search_start = rc->block_group->key.objectid; 38963fd0a558SYan, Zheng rc->extents_found = 0; 38973fd0a558SYan, Zheng rc->nodes_relocated = 0; 38983fd0a558SYan, Zheng rc->merging_rsv_size = 0; 38990647bf56SWang Shilong rc->reserved_bytes = 0; 3900da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 39010647bf56SWang Shilong RELOCATION_RESERVED_NODES; 3902ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 3903ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3904ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3905ac2fabacSJosef Bacik if (ret) 3906ac2fabacSJosef Bacik return ret; 39073fd0a558SYan, Zheng 39083fd0a558SYan, Zheng rc->create_reloc_tree = 1; 39093fd0a558SYan, Zheng set_reloc_control(rc); 39103fd0a558SYan, Zheng 39117a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 391228818947SLiu Bo if (IS_ERR(trans)) { 391328818947SLiu Bo unset_reloc_control(rc); 391428818947SLiu Bo /* 391528818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 391628818947SLiu Bo * cleanup. And callers are responsible to free the above 391728818947SLiu Bo * block rsv. 391828818947SLiu Bo */ 391928818947SLiu Bo return PTR_ERR(trans); 392028818947SLiu Bo } 39213a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 39223fd0a558SYan, Zheng return 0; 39233fd0a558SYan, Zheng } 392476dda93cSYan, Zheng 39255d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 39265d4f98a2SYan Zheng { 39272ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39285d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 39295d4f98a2SYan Zheng struct btrfs_key key; 39305d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 39315d4f98a2SYan Zheng struct btrfs_path *path; 39325d4f98a2SYan Zheng struct btrfs_extent_item *ei; 39335d4f98a2SYan Zheng u64 flags; 39345d4f98a2SYan Zheng u32 item_size; 39355d4f98a2SYan Zheng int ret; 39365d4f98a2SYan Zheng int err = 0; 3937c87f08caSChris Mason int progress = 0; 39385d4f98a2SYan Zheng 39395d4f98a2SYan Zheng path = btrfs_alloc_path(); 39403fd0a558SYan, Zheng if (!path) 39415d4f98a2SYan Zheng return -ENOMEM; 3942e4058b54SDavid Sterba path->reada = READA_FORWARD; 39433fd0a558SYan, Zheng 39443fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 39453fd0a558SYan, Zheng if (ret) { 39463fd0a558SYan, Zheng err = ret; 39473fd0a558SYan, Zheng goto out_free; 39482423fdfbSJiri Slaby } 39495d4f98a2SYan Zheng 39505d4f98a2SYan Zheng while (1) { 39510647bf56SWang Shilong rc->reserved_bytes = 0; 39520647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 39530647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 39540647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 39550647bf56SWang Shilong if (ret) { 39560647bf56SWang Shilong err = ret; 39570647bf56SWang Shilong break; 39580647bf56SWang Shilong } 3959c87f08caSChris Mason progress++; 3960a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 39610f788c58SLiu Bo if (IS_ERR(trans)) { 39620f788c58SLiu Bo err = PTR_ERR(trans); 39630f788c58SLiu Bo trans = NULL; 39640f788c58SLiu Bo break; 39650f788c58SLiu Bo } 3966c87f08caSChris Mason restart: 39673fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 39683a45bb20SJeff Mahoney btrfs_end_transaction(trans); 39693fd0a558SYan, Zheng continue; 39703fd0a558SYan, Zheng } 39713fd0a558SYan, Zheng 3972147d256eSZhaolei ret = find_next_extent(rc, path, &key); 39735d4f98a2SYan Zheng if (ret < 0) 39745d4f98a2SYan Zheng err = ret; 39755d4f98a2SYan Zheng if (ret != 0) 39765d4f98a2SYan Zheng break; 39775d4f98a2SYan Zheng 39785d4f98a2SYan Zheng rc->extents_found++; 39795d4f98a2SYan Zheng 39805d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 39815d4f98a2SYan Zheng struct btrfs_extent_item); 39823fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 39835d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 39845d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 39855d4f98a2SYan Zheng ret = check_extent_flags(flags); 39865d4f98a2SYan Zheng BUG_ON(ret); 3987*ba3c2b19SNikolay Borisov } else if (item_size == sizeof(struct btrfs_extent_item_v0)) { 3988*ba3c2b19SNikolay Borisov err = -EINVAL; 3989*ba3c2b19SNikolay Borisov btrfs_print_v0_err(trans->fs_info); 3990*ba3c2b19SNikolay Borisov btrfs_abort_transaction(trans, err); 3991*ba3c2b19SNikolay Borisov break; 39925d4f98a2SYan Zheng } else { 39935d4f98a2SYan Zheng BUG(); 39945d4f98a2SYan Zheng } 39955d4f98a2SYan Zheng 39965d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 39975d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 39985d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 39995d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40005d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 40015d4f98a2SYan Zheng } else { 4002b3b4aa74SDavid Sterba btrfs_release_path(path); 40035d4f98a2SYan Zheng ret = 0; 40045d4f98a2SYan Zheng } 40055d4f98a2SYan Zheng if (ret < 0) { 40063fd0a558SYan, Zheng err = ret; 40075d4f98a2SYan Zheng break; 40085d4f98a2SYan Zheng } 40095d4f98a2SYan Zheng 40105d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 40115d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 40125d4f98a2SYan Zheng if (ret < 0) { 40131708cc57SWang Shilong /* 40141708cc57SWang Shilong * if we fail to relocate tree blocks, force to update 40151708cc57SWang Shilong * backref cache when committing transaction. 40161708cc57SWang Shilong */ 40171708cc57SWang Shilong rc->backref_cache.last_trans = trans->transid - 1; 40181708cc57SWang Shilong 40193fd0a558SYan, Zheng if (ret != -EAGAIN) { 40205d4f98a2SYan Zheng err = ret; 40215d4f98a2SYan Zheng break; 40225d4f98a2SYan Zheng } 40233fd0a558SYan, Zheng rc->extents_found--; 40243fd0a558SYan, Zheng rc->search_start = key.objectid; 40253fd0a558SYan, Zheng } 40265d4f98a2SYan Zheng } 40275d4f98a2SYan Zheng 40283a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 40292ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 40303fd0a558SYan, Zheng trans = NULL; 40315d4f98a2SYan Zheng 40325d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 40335d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40345d4f98a2SYan Zheng rc->found_file_extent = 1; 40350257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 40363fd0a558SYan, Zheng &key, &rc->cluster); 40375d4f98a2SYan Zheng if (ret < 0) { 40385d4f98a2SYan Zheng err = ret; 40395d4f98a2SYan Zheng break; 40405d4f98a2SYan Zheng } 40415d4f98a2SYan Zheng } 40425d4f98a2SYan Zheng } 4043c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 404443a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 40459689457bSShilong Wang if (ret == 1) { 4046c87f08caSChris Mason err = 0; 4047c87f08caSChris Mason progress = 0; 4048c87f08caSChris Mason goto restart; 4049c87f08caSChris Mason } 4050c87f08caSChris Mason } 40513fd0a558SYan, Zheng 4052b3b4aa74SDavid Sterba btrfs_release_path(path); 405391166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 40545d4f98a2SYan Zheng 40555d4f98a2SYan Zheng if (trans) { 40563a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 40572ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 40585d4f98a2SYan Zheng } 40595d4f98a2SYan Zheng 40600257bb82SYan, Zheng if (!err) { 40613fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 40623fd0a558SYan, Zheng &rc->cluster); 40630257bb82SYan, Zheng if (ret < 0) 40640257bb82SYan, Zheng err = ret; 40650257bb82SYan, Zheng } 40660257bb82SYan, Zheng 40673fd0a558SYan, Zheng rc->create_reloc_tree = 0; 40683fd0a558SYan, Zheng set_reloc_control(rc); 40690257bb82SYan, Zheng 40703fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 40712ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1); 40725d4f98a2SYan Zheng 40733fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 40745d4f98a2SYan Zheng 40755d4f98a2SYan Zheng merge_reloc_roots(rc); 40765d4f98a2SYan Zheng 40773fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 40785d4f98a2SYan Zheng unset_reloc_control(rc); 40792ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1); 40805d4f98a2SYan Zheng 40815d4f98a2SYan Zheng /* get rid of pinned extents */ 40827a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 408362b99540SQu Wenruo if (IS_ERR(trans)) { 40843612b495STsutomu Itoh err = PTR_ERR(trans); 408562b99540SQu Wenruo goto out_free; 408662b99540SQu Wenruo } 40873a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 40883fd0a558SYan, Zheng out_free: 40892ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 40903fd0a558SYan, Zheng btrfs_free_path(path); 40915d4f98a2SYan Zheng return err; 40925d4f98a2SYan Zheng } 40935d4f98a2SYan Zheng 40945d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 40950257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 40965d4f98a2SYan Zheng { 40975d4f98a2SYan Zheng struct btrfs_path *path; 40985d4f98a2SYan Zheng struct btrfs_inode_item *item; 40995d4f98a2SYan Zheng struct extent_buffer *leaf; 41005d4f98a2SYan Zheng int ret; 41015d4f98a2SYan Zheng 41025d4f98a2SYan Zheng path = btrfs_alloc_path(); 41035d4f98a2SYan Zheng if (!path) 41045d4f98a2SYan Zheng return -ENOMEM; 41055d4f98a2SYan Zheng 41065d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 41075d4f98a2SYan Zheng if (ret) 41085d4f98a2SYan Zheng goto out; 41095d4f98a2SYan Zheng 41105d4f98a2SYan Zheng leaf = path->nodes[0]; 41115d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 4112b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 41135d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 41140257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 41155d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 41163fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 41173fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 41185d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 41195d4f98a2SYan Zheng out: 41205d4f98a2SYan Zheng btrfs_free_path(path); 41215d4f98a2SYan Zheng return ret; 41225d4f98a2SYan Zheng } 41235d4f98a2SYan Zheng 41245d4f98a2SYan Zheng /* 41255d4f98a2SYan Zheng * helper to create inode for data relocation. 41265d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 41275d4f98a2SYan Zheng */ 41283fd0a558SYan, Zheng static noinline_for_stack 41293fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 41305d4f98a2SYan Zheng struct btrfs_block_group_cache *group) 41315d4f98a2SYan Zheng { 41325d4f98a2SYan Zheng struct inode *inode = NULL; 41335d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 41345d4f98a2SYan Zheng struct btrfs_root *root; 41355d4f98a2SYan Zheng struct btrfs_key key; 41364624900dSZhaolei u64 objectid; 41375d4f98a2SYan Zheng int err = 0; 41385d4f98a2SYan Zheng 41395d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 41405d4f98a2SYan Zheng if (IS_ERR(root)) 41415d4f98a2SYan Zheng return ERR_CAST(root); 41425d4f98a2SYan Zheng 4143a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 41443fd0a558SYan, Zheng if (IS_ERR(trans)) 41453fd0a558SYan, Zheng return ERR_CAST(trans); 41465d4f98a2SYan Zheng 4147581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 41485d4f98a2SYan Zheng if (err) 41495d4f98a2SYan Zheng goto out; 41505d4f98a2SYan Zheng 41510257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 41525d4f98a2SYan Zheng BUG_ON(err); 41535d4f98a2SYan Zheng 41545d4f98a2SYan Zheng key.objectid = objectid; 41555d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 41565d4f98a2SYan Zheng key.offset = 0; 41570b246afaSJeff Mahoney inode = btrfs_iget(fs_info->sb, &key, root, NULL); 41585d4f98a2SYan Zheng BUG_ON(IS_ERR(inode) || is_bad_inode(inode)); 41595d4f98a2SYan Zheng BTRFS_I(inode)->index_cnt = group->key.objectid; 41605d4f98a2SYan Zheng 416173f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 41625d4f98a2SYan Zheng out: 41633a45bb20SJeff Mahoney btrfs_end_transaction(trans); 41642ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 41655d4f98a2SYan Zheng if (err) { 41665d4f98a2SYan Zheng if (inode) 41675d4f98a2SYan Zheng iput(inode); 41685d4f98a2SYan Zheng inode = ERR_PTR(err); 41695d4f98a2SYan Zheng } 41705d4f98a2SYan Zheng return inode; 41715d4f98a2SYan Zheng } 41725d4f98a2SYan Zheng 41739113493eSGu Jinxiang static struct reloc_control *alloc_reloc_control(void) 41743fd0a558SYan, Zheng { 41753fd0a558SYan, Zheng struct reloc_control *rc; 41763fd0a558SYan, Zheng 41773fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 41783fd0a558SYan, Zheng if (!rc) 41793fd0a558SYan, Zheng return NULL; 41803fd0a558SYan, Zheng 41813fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 41823fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 41833fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 4184c6100a4bSJosef Bacik extent_io_tree_init(&rc->processed_blocks, NULL); 41853fd0a558SYan, Zheng return rc; 41863fd0a558SYan, Zheng } 41873fd0a558SYan, Zheng 41885d4f98a2SYan Zheng /* 4189ebce0e01SAdam Borowski * Print the block group being relocated 4190ebce0e01SAdam Borowski */ 4191ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 4192ebce0e01SAdam Borowski struct btrfs_block_group_cache *block_group) 4193ebce0e01SAdam Borowski { 4194ebce0e01SAdam Borowski char buf[128]; /* prefixed by a '|' that'll be dropped */ 4195ebce0e01SAdam Borowski u64 flags = block_group->flags; 4196ebce0e01SAdam Borowski 4197ebce0e01SAdam Borowski /* Shouldn't happen */ 4198ebce0e01SAdam Borowski if (!flags) { 4199ebce0e01SAdam Borowski strcpy(buf, "|NONE"); 4200ebce0e01SAdam Borowski } else { 4201ebce0e01SAdam Borowski char *bp = buf; 4202ebce0e01SAdam Borowski 4203ebce0e01SAdam Borowski #define DESCRIBE_FLAG(f, d) \ 4204ebce0e01SAdam Borowski if (flags & BTRFS_BLOCK_GROUP_##f) { \ 4205ebce0e01SAdam Borowski bp += snprintf(bp, buf - bp + sizeof(buf), "|%s", d); \ 4206ebce0e01SAdam Borowski flags &= ~BTRFS_BLOCK_GROUP_##f; \ 4207ebce0e01SAdam Borowski } 4208ebce0e01SAdam Borowski DESCRIBE_FLAG(DATA, "data"); 4209ebce0e01SAdam Borowski DESCRIBE_FLAG(SYSTEM, "system"); 4210ebce0e01SAdam Borowski DESCRIBE_FLAG(METADATA, "metadata"); 4211ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID0, "raid0"); 4212ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID1, "raid1"); 4213ebce0e01SAdam Borowski DESCRIBE_FLAG(DUP, "dup"); 4214ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID10, "raid10"); 4215ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID5, "raid5"); 4216ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID6, "raid6"); 4217ebce0e01SAdam Borowski if (flags) 4218b78e2b78SAnand Jain snprintf(bp, buf - bp + sizeof(buf), "|0x%llx", flags); 4219ebce0e01SAdam Borowski #undef DESCRIBE_FLAG 4220ebce0e01SAdam Borowski } 4221ebce0e01SAdam Borowski 4222ebce0e01SAdam Borowski btrfs_info(fs_info, 4223ebce0e01SAdam Borowski "relocating block group %llu flags %s", 4224ebce0e01SAdam Borowski block_group->key.objectid, buf + 1); 4225ebce0e01SAdam Borowski } 4226ebce0e01SAdam Borowski 4227ebce0e01SAdam Borowski /* 42285d4f98a2SYan Zheng * function to relocate all extents in a block group. 42295d4f98a2SYan Zheng */ 42306bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 42315d4f98a2SYan Zheng { 42326bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 42335d4f98a2SYan Zheng struct reloc_control *rc; 42340af3d00bSJosef Bacik struct inode *inode; 42350af3d00bSJosef Bacik struct btrfs_path *path; 42365d4f98a2SYan Zheng int ret; 4237f0486c68SYan, Zheng int rw = 0; 42385d4f98a2SYan Zheng int err = 0; 42395d4f98a2SYan Zheng 42409113493eSGu Jinxiang rc = alloc_reloc_control(); 42415d4f98a2SYan Zheng if (!rc) 42425d4f98a2SYan Zheng return -ENOMEM; 42435d4f98a2SYan Zheng 4244f0486c68SYan, Zheng rc->extent_root = extent_root; 42453fd0a558SYan, Zheng 42465d4f98a2SYan Zheng rc->block_group = btrfs_lookup_block_group(fs_info, group_start); 42475d4f98a2SYan Zheng BUG_ON(!rc->block_group); 42485d4f98a2SYan Zheng 4249c83488afSNikolay Borisov ret = btrfs_inc_block_group_ro(rc->block_group); 4250f0486c68SYan, Zheng if (ret) { 4251f0486c68SYan, Zheng err = ret; 4252f0486c68SYan, Zheng goto out; 4253f0486c68SYan, Zheng } 4254f0486c68SYan, Zheng rw = 1; 4255f0486c68SYan, Zheng 42560af3d00bSJosef Bacik path = btrfs_alloc_path(); 42570af3d00bSJosef Bacik if (!path) { 42580af3d00bSJosef Bacik err = -ENOMEM; 42590af3d00bSJosef Bacik goto out; 42600af3d00bSJosef Bacik } 42610af3d00bSJosef Bacik 426277ab86bfSJeff Mahoney inode = lookup_free_space_inode(fs_info, rc->block_group, path); 42630af3d00bSJosef Bacik btrfs_free_path(path); 42640af3d00bSJosef Bacik 42650af3d00bSJosef Bacik if (!IS_ERR(inode)) 42661bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 42670af3d00bSJosef Bacik else 42680af3d00bSJosef Bacik ret = PTR_ERR(inode); 42690af3d00bSJosef Bacik 42700af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 42710af3d00bSJosef Bacik err = ret; 42720af3d00bSJosef Bacik goto out; 42730af3d00bSJosef Bacik } 42740af3d00bSJosef Bacik 42755d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 42765d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 42775d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 42785d4f98a2SYan Zheng rc->data_inode = NULL; 42795d4f98a2SYan Zheng goto out; 42805d4f98a2SYan Zheng } 42815d4f98a2SYan Zheng 42820b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 42835d4f98a2SYan Zheng 42849cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4285f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 42866374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 4287578def7cSFilipe Manana rc->block_group->key.objectid, 4288578def7cSFilipe Manana rc->block_group->key.offset); 42895d4f98a2SYan Zheng 42905d4f98a2SYan Zheng while (1) { 429176dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 42925d4f98a2SYan Zheng ret = relocate_block_group(rc); 429376dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 42945d4f98a2SYan Zheng if (ret < 0) { 42955d4f98a2SYan Zheng err = ret; 42963fd0a558SYan, Zheng goto out; 42975d4f98a2SYan Zheng } 42985d4f98a2SYan Zheng 42995d4f98a2SYan Zheng if (rc->extents_found == 0) 43005d4f98a2SYan Zheng break; 43015d4f98a2SYan Zheng 43020b246afaSJeff Mahoney btrfs_info(fs_info, "found %llu extents", rc->extents_found); 43035d4f98a2SYan Zheng 43045d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 43050ef8b726SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 43060ef8b726SJosef Bacik (u64)-1); 43070ef8b726SJosef Bacik if (ret) { 43080ef8b726SJosef Bacik err = ret; 43090ef8b726SJosef Bacik goto out; 43100ef8b726SJosef Bacik } 43115d4f98a2SYan Zheng invalidate_mapping_pages(rc->data_inode->i_mapping, 43125d4f98a2SYan Zheng 0, -1); 43135d4f98a2SYan Zheng rc->stage = UPDATE_DATA_PTRS; 43145d4f98a2SYan Zheng } 43155d4f98a2SYan Zheng } 43165d4f98a2SYan Zheng 43175d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 43185d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 43195d4f98a2SYan Zheng WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0); 43205d4f98a2SYan Zheng out: 4321f0486c68SYan, Zheng if (err && rw) 43222ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 43235d4f98a2SYan Zheng iput(rc->data_inode); 43245d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 43255d4f98a2SYan Zheng kfree(rc); 43265d4f98a2SYan Zheng return err; 43275d4f98a2SYan Zheng } 43285d4f98a2SYan Zheng 432976dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 433076dda93cSYan, Zheng { 43310b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 433276dda93cSYan, Zheng struct btrfs_trans_handle *trans; 433379787eaaSJeff Mahoney int ret, err; 433476dda93cSYan, Zheng 43350b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 433679787eaaSJeff Mahoney if (IS_ERR(trans)) 433779787eaaSJeff Mahoney return PTR_ERR(trans); 433876dda93cSYan, Zheng 433976dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 434076dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 434176dda93cSYan, Zheng root->root_item.drop_level = 0; 434276dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 43430b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 434476dda93cSYan, Zheng &root->root_key, &root->root_item); 434576dda93cSYan, Zheng 43463a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 434779787eaaSJeff Mahoney if (err) 434879787eaaSJeff Mahoney return err; 434979787eaaSJeff Mahoney return ret; 435076dda93cSYan, Zheng } 435176dda93cSYan, Zheng 43525d4f98a2SYan Zheng /* 43535d4f98a2SYan Zheng * recover relocation interrupted by system crash. 43545d4f98a2SYan Zheng * 43555d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 43565d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 43575d4f98a2SYan Zheng */ 43585d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 43595d4f98a2SYan Zheng { 43600b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 43615d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 43625d4f98a2SYan Zheng struct btrfs_key key; 43635d4f98a2SYan Zheng struct btrfs_root *fs_root; 43645d4f98a2SYan Zheng struct btrfs_root *reloc_root; 43655d4f98a2SYan Zheng struct btrfs_path *path; 43665d4f98a2SYan Zheng struct extent_buffer *leaf; 43675d4f98a2SYan Zheng struct reloc_control *rc = NULL; 43685d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 43695d4f98a2SYan Zheng int ret; 43705d4f98a2SYan Zheng int err = 0; 43715d4f98a2SYan Zheng 43725d4f98a2SYan Zheng path = btrfs_alloc_path(); 43735d4f98a2SYan Zheng if (!path) 43745d4f98a2SYan Zheng return -ENOMEM; 4375e4058b54SDavid Sterba path->reada = READA_BACK; 43765d4f98a2SYan Zheng 43775d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 43785d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 43795d4f98a2SYan Zheng key.offset = (u64)-1; 43805d4f98a2SYan Zheng 43815d4f98a2SYan Zheng while (1) { 43820b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 43835d4f98a2SYan Zheng path, 0, 0); 43845d4f98a2SYan Zheng if (ret < 0) { 43855d4f98a2SYan Zheng err = ret; 43865d4f98a2SYan Zheng goto out; 43875d4f98a2SYan Zheng } 43885d4f98a2SYan Zheng if (ret > 0) { 43895d4f98a2SYan Zheng if (path->slots[0] == 0) 43905d4f98a2SYan Zheng break; 43915d4f98a2SYan Zheng path->slots[0]--; 43925d4f98a2SYan Zheng } 43935d4f98a2SYan Zheng leaf = path->nodes[0]; 43945d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4395b3b4aa74SDavid Sterba btrfs_release_path(path); 43965d4f98a2SYan Zheng 43975d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 43985d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 43995d4f98a2SYan Zheng break; 44005d4f98a2SYan Zheng 4401cb517eabSMiao Xie reloc_root = btrfs_read_fs_root(root, &key); 44025d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 44035d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 44045d4f98a2SYan Zheng goto out; 44055d4f98a2SYan Zheng } 44065d4f98a2SYan Zheng 44075d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 44085d4f98a2SYan Zheng 44095d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 44100b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, 44115d4f98a2SYan Zheng reloc_root->root_key.offset); 44125d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 441376dda93cSYan, Zheng ret = PTR_ERR(fs_root); 441476dda93cSYan, Zheng if (ret != -ENOENT) { 441576dda93cSYan, Zheng err = ret; 44165d4f98a2SYan Zheng goto out; 44175d4f98a2SYan Zheng } 441879787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 441979787eaaSJeff Mahoney if (ret < 0) { 442079787eaaSJeff Mahoney err = ret; 442179787eaaSJeff Mahoney goto out; 442279787eaaSJeff Mahoney } 442376dda93cSYan, Zheng } 44245d4f98a2SYan Zheng } 44255d4f98a2SYan Zheng 44265d4f98a2SYan Zheng if (key.offset == 0) 44275d4f98a2SYan Zheng break; 44285d4f98a2SYan Zheng 44295d4f98a2SYan Zheng key.offset--; 44305d4f98a2SYan Zheng } 4431b3b4aa74SDavid Sterba btrfs_release_path(path); 44325d4f98a2SYan Zheng 44335d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 44345d4f98a2SYan Zheng goto out; 44355d4f98a2SYan Zheng 44369113493eSGu Jinxiang rc = alloc_reloc_control(); 44375d4f98a2SYan Zheng if (!rc) { 44385d4f98a2SYan Zheng err = -ENOMEM; 44395d4f98a2SYan Zheng goto out; 44405d4f98a2SYan Zheng } 44415d4f98a2SYan Zheng 44420b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 44435d4f98a2SYan Zheng 44445d4f98a2SYan Zheng set_reloc_control(rc); 44455d4f98a2SYan Zheng 44467a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 44473612b495STsutomu Itoh if (IS_ERR(trans)) { 44483612b495STsutomu Itoh unset_reloc_control(rc); 44493612b495STsutomu Itoh err = PTR_ERR(trans); 44503612b495STsutomu Itoh goto out_free; 44513612b495STsutomu Itoh } 44523fd0a558SYan, Zheng 44533fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 44543fd0a558SYan, Zheng 44555d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 44565d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 44575d4f98a2SYan Zheng struct btrfs_root, root_list); 44585d4f98a2SYan Zheng list_del(&reloc_root->root_list); 44595d4f98a2SYan Zheng 44605d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 44615d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 44625d4f98a2SYan Zheng &rc->reloc_roots); 44635d4f98a2SYan Zheng continue; 44645d4f98a2SYan Zheng } 44655d4f98a2SYan Zheng 44660b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, reloc_root->root_key.offset); 446779787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 446879787eaaSJeff Mahoney err = PTR_ERR(fs_root); 446979787eaaSJeff Mahoney goto out_free; 447079787eaaSJeff Mahoney } 44715d4f98a2SYan Zheng 4472ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 447379787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 44745d4f98a2SYan Zheng fs_root->reloc_root = reloc_root; 44755d4f98a2SYan Zheng } 44765d4f98a2SYan Zheng 44773a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 447879787eaaSJeff Mahoney if (err) 447979787eaaSJeff Mahoney goto out_free; 44805d4f98a2SYan Zheng 44815d4f98a2SYan Zheng merge_reloc_roots(rc); 44825d4f98a2SYan Zheng 44835d4f98a2SYan Zheng unset_reloc_control(rc); 44845d4f98a2SYan Zheng 44857a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 448662b99540SQu Wenruo if (IS_ERR(trans)) { 44873612b495STsutomu Itoh err = PTR_ERR(trans); 448862b99540SQu Wenruo goto out_free; 448962b99540SQu Wenruo } 44903a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 44913612b495STsutomu Itoh out_free: 44925d4f98a2SYan Zheng kfree(rc); 44933612b495STsutomu Itoh out: 4494aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4495aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4496aca1bba6SLiu Bo 44975d4f98a2SYan Zheng btrfs_free_path(path); 44985d4f98a2SYan Zheng 44995d4f98a2SYan Zheng if (err == 0) { 45005d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 45010b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 45025d4f98a2SYan Zheng if (IS_ERR(fs_root)) 45035d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4504d7ce5843SMiao Xie else 450566b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 45065d4f98a2SYan Zheng } 45075d4f98a2SYan Zheng return err; 45085d4f98a2SYan Zheng } 45095d4f98a2SYan Zheng 45105d4f98a2SYan Zheng /* 45115d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 45125d4f98a2SYan Zheng * 45135d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 45145d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 45155d4f98a2SYan Zheng */ 45165d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 45175d4f98a2SYan Zheng { 45180b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 45195d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 45205d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 45215d4f98a2SYan Zheng int ret; 45225d4f98a2SYan Zheng u64 disk_bytenr; 45234577b014SJosef Bacik u64 new_bytenr; 45245d4f98a2SYan Zheng LIST_HEAD(list); 45255d4f98a2SYan Zheng 45265d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 45275d4f98a2SYan Zheng BUG_ON(ordered->file_offset != file_pos || ordered->len != len); 45285d4f98a2SYan Zheng 45295d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 45300b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4531a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 453279787eaaSJeff Mahoney if (ret) 453379787eaaSJeff Mahoney goto out; 45345d4f98a2SYan Zheng 45355d4f98a2SYan Zheng while (!list_empty(&list)) { 45365d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 45375d4f98a2SYan Zheng list_del_init(&sums->list); 45385d4f98a2SYan Zheng 45394577b014SJosef Bacik /* 45404577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 45414577b014SJosef Bacik * We need to do this because we will read in entire prealloc 45424577b014SJosef Bacik * extents but we may have written to say the middle of the 45434577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 45444577b014SJosef Bacik * the right disk offset. 45454577b014SJosef Bacik * 45464577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 45474577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 45484577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 45494577b014SJosef Bacik * disk length. 45504577b014SJosef Bacik */ 45514577b014SJosef Bacik new_bytenr = ordered->start + (sums->bytenr - disk_bytenr); 45524577b014SJosef Bacik sums->bytenr = new_bytenr; 45535d4f98a2SYan Zheng 45545d4f98a2SYan Zheng btrfs_add_ordered_sum(inode, ordered, sums); 45555d4f98a2SYan Zheng } 455679787eaaSJeff Mahoney out: 45575d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4558411fc6bcSAndi Kleen return ret; 45595d4f98a2SYan Zheng } 45603fd0a558SYan, Zheng 456183d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 45623fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 45633fd0a558SYan, Zheng struct extent_buffer *cow) 45643fd0a558SYan, Zheng { 45650b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 45663fd0a558SYan, Zheng struct reloc_control *rc; 45673fd0a558SYan, Zheng struct backref_node *node; 45683fd0a558SYan, Zheng int first_cow = 0; 45693fd0a558SYan, Zheng int level; 457083d4cfd4SJosef Bacik int ret = 0; 45713fd0a558SYan, Zheng 45720b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 45733fd0a558SYan, Zheng if (!rc) 457483d4cfd4SJosef Bacik return 0; 45753fd0a558SYan, Zheng 45763fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 45773fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 45783fd0a558SYan, Zheng 4579c974c464SWang Shilong if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 4580c974c464SWang Shilong if (buf == root->node) 4581c974c464SWang Shilong __update_reloc_root(root, cow->start); 4582c974c464SWang Shilong } 4583c974c464SWang Shilong 45843fd0a558SYan, Zheng level = btrfs_header_level(buf); 45853fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 45863fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 45873fd0a558SYan, Zheng first_cow = 1; 45883fd0a558SYan, Zheng 45893fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 45903fd0a558SYan, Zheng rc->create_reloc_tree) { 45913fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 45923fd0a558SYan, Zheng 45933fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 45943fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 45953fd0a558SYan, Zheng node->new_bytenr != buf->start); 45963fd0a558SYan, Zheng 45973fd0a558SYan, Zheng drop_node_buffer(node); 45983fd0a558SYan, Zheng extent_buffer_get(cow); 45993fd0a558SYan, Zheng node->eb = cow; 46003fd0a558SYan, Zheng node->new_bytenr = cow->start; 46013fd0a558SYan, Zheng 46023fd0a558SYan, Zheng if (!node->pending) { 46033fd0a558SYan, Zheng list_move_tail(&node->list, 46043fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 46053fd0a558SYan, Zheng node->pending = 1; 46063fd0a558SYan, Zheng } 46073fd0a558SYan, Zheng 46083fd0a558SYan, Zheng if (first_cow) 46093fd0a558SYan, Zheng __mark_block_processed(rc, node); 46103fd0a558SYan, Zheng 46113fd0a558SYan, Zheng if (first_cow && level > 0) 46123fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 46133fd0a558SYan, Zheng } 46143fd0a558SYan, Zheng 461583d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 46163fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 461783d4cfd4SJosef Bacik return ret; 46183fd0a558SYan, Zheng } 46193fd0a558SYan, Zheng 46203fd0a558SYan, Zheng /* 46213fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 462201327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 46233fd0a558SYan, Zheng */ 4624147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 46253fd0a558SYan, Zheng u64 *bytes_to_reserve) 46263fd0a558SYan, Zheng { 46273fd0a558SYan, Zheng struct btrfs_root *root; 46283fd0a558SYan, Zheng struct reloc_control *rc; 46293fd0a558SYan, Zheng 46303fd0a558SYan, Zheng root = pending->root; 46313fd0a558SYan, Zheng if (!root->reloc_root) 46323fd0a558SYan, Zheng return; 46333fd0a558SYan, Zheng 46343fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 46353fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 46363fd0a558SYan, Zheng return; 46373fd0a558SYan, Zheng 46383fd0a558SYan, Zheng root = root->reloc_root; 46393fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 46403fd0a558SYan, Zheng /* 46413fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 46423fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 46433fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 46443fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 46453fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 46463fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 46473fd0a558SYan, Zheng * tree may use more space than it frees. so we need 46483fd0a558SYan, Zheng * reserve extra space. 46493fd0a558SYan, Zheng */ 46503fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 46513fd0a558SYan, Zheng } 46523fd0a558SYan, Zheng 46533fd0a558SYan, Zheng /* 46543fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 46553fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 46563fd0a558SYan, Zheng */ 465749b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 46583fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 46593fd0a558SYan, Zheng { 46603fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 46613fd0a558SYan, Zheng struct btrfs_root *reloc_root; 46623fd0a558SYan, Zheng struct btrfs_root *new_root; 46633fd0a558SYan, Zheng struct reloc_control *rc; 46643fd0a558SYan, Zheng int ret; 46653fd0a558SYan, Zheng 46663fd0a558SYan, Zheng if (!root->reloc_root) 466749b25e05SJeff Mahoney return 0; 46683fd0a558SYan, Zheng 46693fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 46703fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 46713fd0a558SYan, Zheng 46723fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 46733fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 46743fd0a558SYan, Zheng rc->block_rsv, 467525d609f8SJosef Bacik rc->nodes_relocated, 1); 467649b25e05SJeff Mahoney if (ret) 467749b25e05SJeff Mahoney return ret; 46783fd0a558SYan, Zheng } 46793fd0a558SYan, Zheng 46803fd0a558SYan, Zheng new_root = pending->snap; 46813fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 46823fd0a558SYan, Zheng new_root->root_key.objectid); 468349b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 468449b25e05SJeff Mahoney return PTR_ERR(reloc_root); 46853fd0a558SYan, Zheng 4686ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4687ffd7b339SJeff Mahoney BUG_ON(ret < 0); 46883fd0a558SYan, Zheng new_root->reloc_root = reloc_root; 46893fd0a558SYan, Zheng 469049b25e05SJeff Mahoney if (rc->create_reloc_tree) 46913fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 469249b25e05SJeff Mahoney return ret; 46933fd0a558SYan, Zheng } 4694