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; 165d2311e69SQu Wenruo /* list of subvolume trees that get relocated */ 166d2311e69SQu Wenruo struct list_head dirty_subvol_roots; 1673fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 1683fd0a558SYan, Zheng u64 merging_rsv_size; 1693fd0a558SYan, Zheng /* size of relocated tree nodes */ 1703fd0a558SYan, Zheng u64 nodes_relocated; 1710647bf56SWang Shilong /* reserved size for block group relocation*/ 1720647bf56SWang Shilong u64 reserved_bytes; 1733fd0a558SYan, Zheng 1745d4f98a2SYan Zheng u64 search_start; 1755d4f98a2SYan Zheng u64 extents_found; 1763fd0a558SYan, Zheng 1773fd0a558SYan, Zheng unsigned int stage:8; 1783fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 1793fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 1805d4f98a2SYan Zheng unsigned int found_file_extent:1; 1815d4f98a2SYan Zheng }; 1825d4f98a2SYan Zheng 1835d4f98a2SYan Zheng /* stages of data relocation */ 1845d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 1855d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 1865d4f98a2SYan Zheng 1873fd0a558SYan, Zheng static void remove_backref_node(struct backref_cache *cache, 1883fd0a558SYan, Zheng struct backref_node *node); 1893fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 1903fd0a558SYan, Zheng struct backref_node *node); 1915d4f98a2SYan Zheng 1925d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 1935d4f98a2SYan Zheng { 1946bef4d31SEric Paris tree->rb_root = RB_ROOT; 1955d4f98a2SYan Zheng spin_lock_init(&tree->lock); 1965d4f98a2SYan Zheng } 1975d4f98a2SYan Zheng 1985d4f98a2SYan Zheng static void backref_cache_init(struct backref_cache *cache) 1995d4f98a2SYan Zheng { 2005d4f98a2SYan Zheng int i; 2016bef4d31SEric Paris cache->rb_root = RB_ROOT; 2025d4f98a2SYan Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2035d4f98a2SYan Zheng INIT_LIST_HEAD(&cache->pending[i]); 2043fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->changed); 2053fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->detached); 2063fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->leaves); 2075d4f98a2SYan Zheng } 2085d4f98a2SYan Zheng 2093fd0a558SYan, Zheng static void backref_cache_cleanup(struct backref_cache *cache) 2105d4f98a2SYan Zheng { 2113fd0a558SYan, Zheng struct backref_node *node; 2123fd0a558SYan, Zheng int i; 2133fd0a558SYan, Zheng 2143fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2153fd0a558SYan, Zheng node = list_entry(cache->detached.next, 2163fd0a558SYan, Zheng struct backref_node, list); 2173fd0a558SYan, Zheng remove_backref_node(cache, node); 2183fd0a558SYan, Zheng } 2193fd0a558SYan, Zheng 2203fd0a558SYan, Zheng while (!list_empty(&cache->leaves)) { 2213fd0a558SYan, Zheng node = list_entry(cache->leaves.next, 2223fd0a558SYan, Zheng struct backref_node, lower); 2233fd0a558SYan, Zheng remove_backref_node(cache, node); 2243fd0a558SYan, Zheng } 2253fd0a558SYan, Zheng 2263fd0a558SYan, Zheng cache->last_trans = 0; 2273fd0a558SYan, Zheng 2283fd0a558SYan, Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 229f4907095SLiu Bo ASSERT(list_empty(&cache->pending[i])); 230f4907095SLiu Bo ASSERT(list_empty(&cache->changed)); 231f4907095SLiu Bo ASSERT(list_empty(&cache->detached)); 232f4907095SLiu Bo ASSERT(RB_EMPTY_ROOT(&cache->rb_root)); 233f4907095SLiu Bo ASSERT(!cache->nr_nodes); 234f4907095SLiu Bo ASSERT(!cache->nr_edges); 2353fd0a558SYan, Zheng } 2363fd0a558SYan, Zheng 2373fd0a558SYan, Zheng static struct backref_node *alloc_backref_node(struct backref_cache *cache) 2383fd0a558SYan, Zheng { 2393fd0a558SYan, Zheng struct backref_node *node; 2403fd0a558SYan, Zheng 2413fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 2423fd0a558SYan, Zheng if (node) { 2433fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 2445d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 2455d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 2465d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 2473fd0a558SYan, Zheng cache->nr_nodes++; 2483fd0a558SYan, Zheng } 2493fd0a558SYan, Zheng return node; 2503fd0a558SYan, Zheng } 2513fd0a558SYan, Zheng 2523fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 2533fd0a558SYan, Zheng struct backref_node *node) 2543fd0a558SYan, Zheng { 2553fd0a558SYan, Zheng if (node) { 2563fd0a558SYan, Zheng cache->nr_nodes--; 2573fd0a558SYan, Zheng kfree(node); 2583fd0a558SYan, Zheng } 2593fd0a558SYan, Zheng } 2603fd0a558SYan, Zheng 2613fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 2623fd0a558SYan, Zheng { 2633fd0a558SYan, Zheng struct backref_edge *edge; 2643fd0a558SYan, Zheng 2653fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 2663fd0a558SYan, Zheng if (edge) 2673fd0a558SYan, Zheng cache->nr_edges++; 2683fd0a558SYan, Zheng return edge; 2693fd0a558SYan, Zheng } 2703fd0a558SYan, Zheng 2713fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 2723fd0a558SYan, Zheng struct backref_edge *edge) 2733fd0a558SYan, Zheng { 2743fd0a558SYan, Zheng if (edge) { 2753fd0a558SYan, Zheng cache->nr_edges--; 2763fd0a558SYan, Zheng kfree(edge); 2773fd0a558SYan, Zheng } 2785d4f98a2SYan Zheng } 2795d4f98a2SYan Zheng 2805d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 2815d4f98a2SYan Zheng struct rb_node *node) 2825d4f98a2SYan Zheng { 2835d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 2845d4f98a2SYan Zheng struct rb_node *parent = NULL; 2855d4f98a2SYan Zheng struct tree_entry *entry; 2865d4f98a2SYan Zheng 2875d4f98a2SYan Zheng while (*p) { 2885d4f98a2SYan Zheng parent = *p; 2895d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 2905d4f98a2SYan Zheng 2915d4f98a2SYan Zheng if (bytenr < entry->bytenr) 2925d4f98a2SYan Zheng p = &(*p)->rb_left; 2935d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 2945d4f98a2SYan Zheng p = &(*p)->rb_right; 2955d4f98a2SYan Zheng else 2965d4f98a2SYan Zheng return parent; 2975d4f98a2SYan Zheng } 2985d4f98a2SYan Zheng 2995d4f98a2SYan Zheng rb_link_node(node, parent, p); 3005d4f98a2SYan Zheng rb_insert_color(node, root); 3015d4f98a2SYan Zheng return NULL; 3025d4f98a2SYan Zheng } 3035d4f98a2SYan Zheng 3045d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 3055d4f98a2SYan Zheng { 3065d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 3075d4f98a2SYan Zheng struct tree_entry *entry; 3085d4f98a2SYan Zheng 3095d4f98a2SYan Zheng while (n) { 3105d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 3115d4f98a2SYan Zheng 3125d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3135d4f98a2SYan Zheng n = n->rb_left; 3145d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3155d4f98a2SYan Zheng n = n->rb_right; 3165d4f98a2SYan Zheng else 3175d4f98a2SYan Zheng return n; 3185d4f98a2SYan Zheng } 3195d4f98a2SYan Zheng return NULL; 3205d4f98a2SYan Zheng } 3215d4f98a2SYan Zheng 32248a3b636SEric Sandeen static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) 32343c04fb1SJeff Mahoney { 32443c04fb1SJeff Mahoney 32543c04fb1SJeff Mahoney struct btrfs_fs_info *fs_info = NULL; 32643c04fb1SJeff Mahoney struct backref_node *bnode = rb_entry(rb_node, struct backref_node, 32743c04fb1SJeff Mahoney rb_node); 32843c04fb1SJeff Mahoney if (bnode->root) 32943c04fb1SJeff Mahoney fs_info = bnode->root->fs_info; 3305d163e0eSJeff Mahoney btrfs_panic(fs_info, errno, 3315d163e0eSJeff Mahoney "Inconsistency in backref cache found at offset %llu", 3325d163e0eSJeff Mahoney bytenr); 33343c04fb1SJeff Mahoney } 33443c04fb1SJeff Mahoney 3355d4f98a2SYan Zheng /* 3365d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 3375d4f98a2SYan Zheng */ 3385d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 3395d4f98a2SYan Zheng struct backref_edge *edges[], 3405d4f98a2SYan Zheng int *index) 3415d4f98a2SYan Zheng { 3425d4f98a2SYan Zheng struct backref_edge *edge; 3435d4f98a2SYan Zheng int idx = *index; 3445d4f98a2SYan Zheng 3455d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 3465d4f98a2SYan Zheng edge = list_entry(node->upper.next, 3475d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3485d4f98a2SYan Zheng edges[idx++] = edge; 3495d4f98a2SYan Zheng node = edge->node[UPPER]; 3505d4f98a2SYan Zheng } 3513fd0a558SYan, Zheng BUG_ON(node->detached); 3525d4f98a2SYan Zheng *index = idx; 3535d4f98a2SYan Zheng return node; 3545d4f98a2SYan Zheng } 3555d4f98a2SYan Zheng 3565d4f98a2SYan Zheng /* 3575d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 3585d4f98a2SYan Zheng */ 3595d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 3605d4f98a2SYan Zheng int *index) 3615d4f98a2SYan Zheng { 3625d4f98a2SYan Zheng struct backref_edge *edge; 3635d4f98a2SYan Zheng struct backref_node *lower; 3645d4f98a2SYan Zheng int idx = *index; 3655d4f98a2SYan Zheng 3665d4f98a2SYan Zheng while (idx > 0) { 3675d4f98a2SYan Zheng edge = edges[idx - 1]; 3685d4f98a2SYan Zheng lower = edge->node[LOWER]; 3695d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 3705d4f98a2SYan Zheng idx--; 3715d4f98a2SYan Zheng continue; 3725d4f98a2SYan Zheng } 3735d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 3745d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3755d4f98a2SYan Zheng edges[idx - 1] = edge; 3765d4f98a2SYan Zheng *index = idx; 3775d4f98a2SYan Zheng return edge->node[UPPER]; 3785d4f98a2SYan Zheng } 3795d4f98a2SYan Zheng *index = 0; 3805d4f98a2SYan Zheng return NULL; 3815d4f98a2SYan Zheng } 3825d4f98a2SYan Zheng 3833fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 3845d4f98a2SYan Zheng { 3855d4f98a2SYan Zheng if (node->locked) { 3865d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 3875d4f98a2SYan Zheng node->locked = 0; 3885d4f98a2SYan Zheng } 3893fd0a558SYan, Zheng } 3903fd0a558SYan, Zheng 3913fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 3923fd0a558SYan, Zheng { 3933fd0a558SYan, Zheng if (node->eb) { 3943fd0a558SYan, Zheng unlock_node_buffer(node); 3955d4f98a2SYan Zheng free_extent_buffer(node->eb); 3965d4f98a2SYan Zheng node->eb = NULL; 3975d4f98a2SYan Zheng } 3985d4f98a2SYan Zheng } 3995d4f98a2SYan Zheng 4005d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 4015d4f98a2SYan Zheng struct backref_node *node) 4025d4f98a2SYan Zheng { 4035d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 4045d4f98a2SYan Zheng 4055d4f98a2SYan Zheng drop_node_buffer(node); 4063fd0a558SYan, Zheng list_del(&node->list); 4075d4f98a2SYan Zheng list_del(&node->lower); 4083fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 4095d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 4103fd0a558SYan, Zheng free_backref_node(tree, node); 4115d4f98a2SYan Zheng } 4125d4f98a2SYan Zheng 4135d4f98a2SYan Zheng /* 4145d4f98a2SYan Zheng * remove a backref node from the backref cache 4155d4f98a2SYan Zheng */ 4165d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 4175d4f98a2SYan Zheng struct backref_node *node) 4185d4f98a2SYan Zheng { 4195d4f98a2SYan Zheng struct backref_node *upper; 4205d4f98a2SYan Zheng struct backref_edge *edge; 4215d4f98a2SYan Zheng 4225d4f98a2SYan Zheng if (!node) 4235d4f98a2SYan Zheng return; 4245d4f98a2SYan Zheng 4253fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 4265d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4275d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 4285d4f98a2SYan Zheng list[LOWER]); 4295d4f98a2SYan Zheng upper = edge->node[UPPER]; 4305d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 4315d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 4323fd0a558SYan, Zheng free_backref_edge(cache, edge); 4333fd0a558SYan, Zheng 4343fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 4353fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 4363fd0a558SYan, Zheng drop_backref_node(cache, node); 4373fd0a558SYan, Zheng node = upper; 4383fd0a558SYan, Zheng node->lowest = 1; 4393fd0a558SYan, Zheng continue; 4403fd0a558SYan, Zheng } 4415d4f98a2SYan Zheng /* 4423fd0a558SYan, Zheng * add the node to leaf node list if no other 4435d4f98a2SYan Zheng * child block cached. 4445d4f98a2SYan Zheng */ 4455d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 4463fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 4475d4f98a2SYan Zheng upper->lowest = 1; 4485d4f98a2SYan Zheng } 4495d4f98a2SYan Zheng } 4503fd0a558SYan, Zheng 4515d4f98a2SYan Zheng drop_backref_node(cache, node); 4525d4f98a2SYan Zheng } 4535d4f98a2SYan Zheng 4543fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 4553fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 4563fd0a558SYan, Zheng { 4573fd0a558SYan, Zheng struct rb_node *rb_node; 4583fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 4593fd0a558SYan, Zheng node->bytenr = bytenr; 4603fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 46143c04fb1SJeff Mahoney if (rb_node) 46243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, bytenr); 4633fd0a558SYan, Zheng } 4643fd0a558SYan, Zheng 4653fd0a558SYan, Zheng /* 4663fd0a558SYan, Zheng * update backref cache after a transaction commit 4673fd0a558SYan, Zheng */ 4683fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 4693fd0a558SYan, Zheng struct backref_cache *cache) 4703fd0a558SYan, Zheng { 4713fd0a558SYan, Zheng struct backref_node *node; 4723fd0a558SYan, Zheng int level = 0; 4733fd0a558SYan, Zheng 4743fd0a558SYan, Zheng if (cache->last_trans == 0) { 4753fd0a558SYan, Zheng cache->last_trans = trans->transid; 4763fd0a558SYan, Zheng return 0; 4773fd0a558SYan, Zheng } 4783fd0a558SYan, Zheng 4793fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 4803fd0a558SYan, Zheng return 0; 4813fd0a558SYan, Zheng 4823fd0a558SYan, Zheng /* 4833fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 4843fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 4853fd0a558SYan, Zheng * so the detached nodes are no longer useful. 4863fd0a558SYan, Zheng */ 4873fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 4883fd0a558SYan, Zheng node = list_entry(cache->detached.next, 4893fd0a558SYan, Zheng struct backref_node, list); 4903fd0a558SYan, Zheng remove_backref_node(cache, node); 4913fd0a558SYan, Zheng } 4923fd0a558SYan, Zheng 4933fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 4943fd0a558SYan, Zheng node = list_entry(cache->changed.next, 4953fd0a558SYan, Zheng struct backref_node, list); 4963fd0a558SYan, Zheng list_del_init(&node->list); 4973fd0a558SYan, Zheng BUG_ON(node->pending); 4983fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 4993fd0a558SYan, Zheng } 5003fd0a558SYan, Zheng 5013fd0a558SYan, Zheng /* 5023fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 5033fd0a558SYan, Zheng * errors during processing the pending nodes. 5043fd0a558SYan, Zheng */ 5053fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 5063fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 5073fd0a558SYan, Zheng BUG_ON(!node->pending); 5083fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 5093fd0a558SYan, Zheng continue; 5103fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5113fd0a558SYan, Zheng } 5123fd0a558SYan, Zheng } 5133fd0a558SYan, Zheng 5143fd0a558SYan, Zheng cache->last_trans = 0; 5153fd0a558SYan, Zheng return 1; 5163fd0a558SYan, Zheng } 5173fd0a558SYan, Zheng 518f2a97a9dSDavid Sterba 5193fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 5203fd0a558SYan, Zheng { 5213fd0a558SYan, Zheng struct btrfs_root *reloc_root; 5223fd0a558SYan, Zheng 52327cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 5243fd0a558SYan, Zheng return 0; 5253fd0a558SYan, Zheng 5263fd0a558SYan, Zheng reloc_root = root->reloc_root; 5273fd0a558SYan, Zheng if (!reloc_root) 5283fd0a558SYan, Zheng return 0; 5293fd0a558SYan, Zheng 5303fd0a558SYan, Zheng if (btrfs_root_last_snapshot(&reloc_root->root_item) == 5313fd0a558SYan, Zheng root->fs_info->running_transaction->transid - 1) 5323fd0a558SYan, Zheng return 0; 5333fd0a558SYan, Zheng /* 5343fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 5353fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 5363fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 5373fd0a558SYan, Zheng * relocation. 5383fd0a558SYan, Zheng */ 5393fd0a558SYan, Zheng return 1; 5403fd0a558SYan, Zheng } 5415d4f98a2SYan Zheng /* 5425d4f98a2SYan Zheng * find reloc tree by address of tree root 5435d4f98a2SYan Zheng */ 5445d4f98a2SYan Zheng static struct btrfs_root *find_reloc_root(struct reloc_control *rc, 5455d4f98a2SYan Zheng u64 bytenr) 5465d4f98a2SYan Zheng { 5475d4f98a2SYan Zheng struct rb_node *rb_node; 5485d4f98a2SYan Zheng struct mapping_node *node; 5495d4f98a2SYan Zheng struct btrfs_root *root = NULL; 5505d4f98a2SYan Zheng 5515d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 5525d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 5535d4f98a2SYan Zheng if (rb_node) { 5545d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 5555d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 5565d4f98a2SYan Zheng } 5575d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 5585d4f98a2SYan Zheng return root; 5595d4f98a2SYan Zheng } 5605d4f98a2SYan Zheng 5615d4f98a2SYan Zheng static int is_cowonly_root(u64 root_objectid) 5625d4f98a2SYan Zheng { 5635d4f98a2SYan Zheng if (root_objectid == BTRFS_ROOT_TREE_OBJECTID || 5645d4f98a2SYan Zheng root_objectid == BTRFS_EXTENT_TREE_OBJECTID || 5655d4f98a2SYan Zheng root_objectid == BTRFS_CHUNK_TREE_OBJECTID || 5665d4f98a2SYan Zheng root_objectid == BTRFS_DEV_TREE_OBJECTID || 5675d4f98a2SYan Zheng root_objectid == BTRFS_TREE_LOG_OBJECTID || 56866463748SWang Shilong root_objectid == BTRFS_CSUM_TREE_OBJECTID || 56966463748SWang Shilong root_objectid == BTRFS_UUID_TREE_OBJECTID || 5703e4c5efbSDavid Sterba root_objectid == BTRFS_QUOTA_TREE_OBJECTID || 5713e4c5efbSDavid Sterba root_objectid == BTRFS_FREE_SPACE_TREE_OBJECTID) 5725d4f98a2SYan Zheng return 1; 5735d4f98a2SYan Zheng return 0; 5745d4f98a2SYan Zheng } 5755d4f98a2SYan Zheng 5765d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 5775d4f98a2SYan Zheng u64 root_objectid) 5785d4f98a2SYan Zheng { 5795d4f98a2SYan Zheng struct btrfs_key key; 5805d4f98a2SYan Zheng 5815d4f98a2SYan Zheng key.objectid = root_objectid; 5825d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 5835d4f98a2SYan Zheng if (is_cowonly_root(root_objectid)) 5845d4f98a2SYan Zheng key.offset = 0; 5855d4f98a2SYan Zheng else 5865d4f98a2SYan Zheng key.offset = (u64)-1; 5875d4f98a2SYan Zheng 588c00869f1SMiao Xie return btrfs_get_fs_root(fs_info, &key, false); 5895d4f98a2SYan Zheng } 5905d4f98a2SYan Zheng 5915d4f98a2SYan Zheng static noinline_for_stack 5925d4f98a2SYan Zheng int find_inline_backref(struct extent_buffer *leaf, int slot, 5935d4f98a2SYan Zheng unsigned long *ptr, unsigned long *end) 5945d4f98a2SYan Zheng { 5953173a18fSJosef Bacik struct btrfs_key key; 5965d4f98a2SYan Zheng struct btrfs_extent_item *ei; 5975d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 5985d4f98a2SYan Zheng u32 item_size; 5995d4f98a2SYan Zheng 6003173a18fSJosef Bacik btrfs_item_key_to_cpu(leaf, &key, slot); 6013173a18fSJosef Bacik 6025d4f98a2SYan Zheng item_size = btrfs_item_size_nr(leaf, slot); 603ba3c2b19SNikolay Borisov if (item_size < sizeof(*ei)) { 604ba3c2b19SNikolay Borisov btrfs_print_v0_err(leaf->fs_info); 605ba3c2b19SNikolay Borisov btrfs_handle_fs_error(leaf->fs_info, -EINVAL, NULL); 606ba3c2b19SNikolay Borisov return 1; 607ba3c2b19SNikolay Borisov } 6085d4f98a2SYan Zheng ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); 6095d4f98a2SYan Zheng WARN_ON(!(btrfs_extent_flags(leaf, ei) & 6105d4f98a2SYan Zheng BTRFS_EXTENT_FLAG_TREE_BLOCK)); 6115d4f98a2SYan Zheng 6123173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 6133173a18fSJosef Bacik item_size <= sizeof(*ei) + sizeof(*bi)) { 6145d4f98a2SYan Zheng WARN_ON(item_size < sizeof(*ei) + sizeof(*bi)); 6155d4f98a2SYan Zheng return 1; 6165d4f98a2SYan Zheng } 617d062d13cSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 618d062d13cSJosef Bacik item_size <= sizeof(*ei)) { 619d062d13cSJosef Bacik WARN_ON(item_size < sizeof(*ei)); 620d062d13cSJosef Bacik return 1; 621d062d13cSJosef Bacik } 6225d4f98a2SYan Zheng 6233173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) { 6245d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 6255d4f98a2SYan Zheng *ptr = (unsigned long)(bi + 1); 6263173a18fSJosef Bacik } else { 6273173a18fSJosef Bacik *ptr = (unsigned long)(ei + 1); 6283173a18fSJosef Bacik } 6295d4f98a2SYan Zheng *end = (unsigned long)ei + item_size; 6305d4f98a2SYan Zheng return 0; 6315d4f98a2SYan Zheng } 6325d4f98a2SYan Zheng 6335d4f98a2SYan Zheng /* 6345d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 6355d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 6365d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 6375d4f98a2SYan Zheng * 6385d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 63901327610SNicholas D Steeves * to find upper level blocks that reference the block, and then check 64001327610SNicholas D Steeves * backrefs of these upper level blocks recursively. the recursion stop 6415d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 6425d4f98a2SYan Zheng * 6435d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 6445d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 6455d4f98a2SYan Zheng * block are also cached. 6465d4f98a2SYan Zheng */ 6473fd0a558SYan, Zheng static noinline_for_stack 6483fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 6495d4f98a2SYan Zheng struct btrfs_key *node_key, 6505d4f98a2SYan Zheng int level, u64 bytenr) 6515d4f98a2SYan Zheng { 6523fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 653fa6ac715SQu Wenruo struct btrfs_path *path1; /* For searching extent root */ 654fa6ac715SQu Wenruo struct btrfs_path *path2; /* For searching parent of TREE_BLOCK_REF */ 6555d4f98a2SYan Zheng struct extent_buffer *eb; 6565d4f98a2SYan Zheng struct btrfs_root *root; 6575d4f98a2SYan Zheng struct backref_node *cur; 6585d4f98a2SYan Zheng struct backref_node *upper; 6595d4f98a2SYan Zheng struct backref_node *lower; 6605d4f98a2SYan Zheng struct backref_node *node = NULL; 6615d4f98a2SYan Zheng struct backref_node *exist = NULL; 6625d4f98a2SYan Zheng struct backref_edge *edge; 6635d4f98a2SYan Zheng struct rb_node *rb_node; 6645d4f98a2SYan Zheng struct btrfs_key key; 6655d4f98a2SYan Zheng unsigned long end; 6665d4f98a2SYan Zheng unsigned long ptr; 667fa6ac715SQu Wenruo LIST_HEAD(list); /* Pending edge list, upper node needs to be checked */ 6683fd0a558SYan, Zheng LIST_HEAD(useless); 6693fd0a558SYan, Zheng int cowonly; 6705d4f98a2SYan Zheng int ret; 6715d4f98a2SYan Zheng int err = 0; 672b6c60c80SJosef Bacik bool need_check = true; 6735d4f98a2SYan Zheng 6745d4f98a2SYan Zheng path1 = btrfs_alloc_path(); 6755d4f98a2SYan Zheng path2 = btrfs_alloc_path(); 6765d4f98a2SYan Zheng if (!path1 || !path2) { 6775d4f98a2SYan Zheng err = -ENOMEM; 6785d4f98a2SYan Zheng goto out; 6795d4f98a2SYan Zheng } 680e4058b54SDavid Sterba path1->reada = READA_FORWARD; 681e4058b54SDavid Sterba path2->reada = READA_FORWARD; 6825d4f98a2SYan Zheng 6833fd0a558SYan, Zheng node = alloc_backref_node(cache); 6845d4f98a2SYan Zheng if (!node) { 6855d4f98a2SYan Zheng err = -ENOMEM; 6865d4f98a2SYan Zheng goto out; 6875d4f98a2SYan Zheng } 6885d4f98a2SYan Zheng 6895d4f98a2SYan Zheng node->bytenr = bytenr; 6905d4f98a2SYan Zheng node->level = level; 6915d4f98a2SYan Zheng node->lowest = 1; 6925d4f98a2SYan Zheng cur = node; 6935d4f98a2SYan Zheng again: 6945d4f98a2SYan Zheng end = 0; 6955d4f98a2SYan Zheng ptr = 0; 6965d4f98a2SYan Zheng key.objectid = cur->bytenr; 6973173a18fSJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 6985d4f98a2SYan Zheng key.offset = (u64)-1; 6995d4f98a2SYan Zheng 7005d4f98a2SYan Zheng path1->search_commit_root = 1; 7015d4f98a2SYan Zheng path1->skip_locking = 1; 7025d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1, 7035d4f98a2SYan Zheng 0, 0); 7045d4f98a2SYan Zheng if (ret < 0) { 7055d4f98a2SYan Zheng err = ret; 7065d4f98a2SYan Zheng goto out; 7075d4f98a2SYan Zheng } 70875bfb9afSJosef Bacik ASSERT(ret); 70975bfb9afSJosef Bacik ASSERT(path1->slots[0]); 7105d4f98a2SYan Zheng 7115d4f98a2SYan Zheng path1->slots[0]--; 7125d4f98a2SYan Zheng 7135d4f98a2SYan Zheng WARN_ON(cur->checked); 7145d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 7155d4f98a2SYan Zheng /* 71670f23fd6SJustin P. Mattock * the backref was added previously when processing 7175d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 7185d4f98a2SYan Zheng */ 71975bfb9afSJosef Bacik ASSERT(list_is_singular(&cur->upper)); 7205d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 7215d4f98a2SYan Zheng list[LOWER]); 72275bfb9afSJosef Bacik ASSERT(list_empty(&edge->list[UPPER])); 7235d4f98a2SYan Zheng exist = edge->node[UPPER]; 7245d4f98a2SYan Zheng /* 7255d4f98a2SYan Zheng * add the upper level block to pending list if we need 7265d4f98a2SYan Zheng * check its backrefs 7275d4f98a2SYan Zheng */ 7285d4f98a2SYan Zheng if (!exist->checked) 7295d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 7305d4f98a2SYan Zheng } else { 7315d4f98a2SYan Zheng exist = NULL; 7325d4f98a2SYan Zheng } 7335d4f98a2SYan Zheng 7345d4f98a2SYan Zheng while (1) { 7355d4f98a2SYan Zheng cond_resched(); 7365d4f98a2SYan Zheng eb = path1->nodes[0]; 7375d4f98a2SYan Zheng 7385d4f98a2SYan Zheng if (ptr >= end) { 7395d4f98a2SYan Zheng if (path1->slots[0] >= btrfs_header_nritems(eb)) { 7405d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path1); 7415d4f98a2SYan Zheng if (ret < 0) { 7425d4f98a2SYan Zheng err = ret; 7435d4f98a2SYan Zheng goto out; 7445d4f98a2SYan Zheng } 7455d4f98a2SYan Zheng if (ret > 0) 7465d4f98a2SYan Zheng break; 7475d4f98a2SYan Zheng eb = path1->nodes[0]; 7485d4f98a2SYan Zheng } 7495d4f98a2SYan Zheng 7505d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path1->slots[0]); 7515d4f98a2SYan Zheng if (key.objectid != cur->bytenr) { 7525d4f98a2SYan Zheng WARN_ON(exist); 7535d4f98a2SYan Zheng break; 7545d4f98a2SYan Zheng } 7555d4f98a2SYan Zheng 7563173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY || 7573173a18fSJosef Bacik key.type == BTRFS_METADATA_ITEM_KEY) { 7585d4f98a2SYan Zheng ret = find_inline_backref(eb, path1->slots[0], 7595d4f98a2SYan Zheng &ptr, &end); 7605d4f98a2SYan Zheng if (ret) 7615d4f98a2SYan Zheng goto next; 7625d4f98a2SYan Zheng } 7635d4f98a2SYan Zheng } 7645d4f98a2SYan Zheng 7655d4f98a2SYan Zheng if (ptr < end) { 7665d4f98a2SYan Zheng /* update key for inline back ref */ 7675d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 7683de28d57SLiu Bo int type; 7695d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 7703de28d57SLiu Bo type = btrfs_get_extent_inline_ref_type(eb, iref, 7713de28d57SLiu Bo BTRFS_REF_TYPE_BLOCK); 7723de28d57SLiu Bo if (type == BTRFS_REF_TYPE_INVALID) { 773af431dcbSSu Yue err = -EUCLEAN; 7743de28d57SLiu Bo goto out; 7753de28d57SLiu Bo } 7763de28d57SLiu Bo key.type = type; 7775d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 7783de28d57SLiu Bo 7795d4f98a2SYan Zheng WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY && 7805d4f98a2SYan Zheng key.type != BTRFS_SHARED_BLOCK_REF_KEY); 7815d4f98a2SYan Zheng } 7825d4f98a2SYan Zheng 783fa6ac715SQu Wenruo /* 784fa6ac715SQu Wenruo * Parent node found and matches current inline ref, no need to 785fa6ac715SQu Wenruo * rebuild this node for this inline ref. 786fa6ac715SQu Wenruo */ 7875d4f98a2SYan Zheng if (exist && 7885d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 7895d4f98a2SYan Zheng exist->owner == key.offset) || 7905d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 7915d4f98a2SYan Zheng exist->bytenr == key.offset))) { 7925d4f98a2SYan Zheng exist = NULL; 7935d4f98a2SYan Zheng goto next; 7945d4f98a2SYan Zheng } 7955d4f98a2SYan Zheng 796fa6ac715SQu Wenruo /* SHARED_BLOCK_REF means key.offset is the parent bytenr */ 7975d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 7985d4f98a2SYan Zheng if (key.objectid == key.offset) { 7995d4f98a2SYan Zheng /* 800fa6ac715SQu Wenruo * Only root blocks of reloc trees use backref 801fa6ac715SQu Wenruo * pointing to itself. 8025d4f98a2SYan Zheng */ 8035d4f98a2SYan Zheng root = find_reloc_root(rc, cur->bytenr); 80475bfb9afSJosef Bacik ASSERT(root); 8055d4f98a2SYan Zheng cur->root = root; 8065d4f98a2SYan Zheng break; 8075d4f98a2SYan Zheng } 8085d4f98a2SYan Zheng 8093fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 8105d4f98a2SYan Zheng if (!edge) { 8115d4f98a2SYan Zheng err = -ENOMEM; 8125d4f98a2SYan Zheng goto out; 8135d4f98a2SYan Zheng } 8145d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, key.offset); 8155d4f98a2SYan Zheng if (!rb_node) { 8163fd0a558SYan, Zheng upper = alloc_backref_node(cache); 8175d4f98a2SYan Zheng if (!upper) { 8183fd0a558SYan, Zheng free_backref_edge(cache, edge); 8195d4f98a2SYan Zheng err = -ENOMEM; 8205d4f98a2SYan Zheng goto out; 8215d4f98a2SYan Zheng } 8225d4f98a2SYan Zheng upper->bytenr = key.offset; 8235d4f98a2SYan Zheng upper->level = cur->level + 1; 8245d4f98a2SYan Zheng /* 8255d4f98a2SYan Zheng * backrefs for the upper level block isn't 8265d4f98a2SYan Zheng * cached, add the block to pending list 8275d4f98a2SYan Zheng */ 8285d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 8295d4f98a2SYan Zheng } else { 8305d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 8315d4f98a2SYan Zheng rb_node); 83275bfb9afSJosef Bacik ASSERT(upper->checked); 8335d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 8345d4f98a2SYan Zheng } 8353fd0a558SYan, Zheng list_add_tail(&edge->list[LOWER], &cur->upper); 8365d4f98a2SYan Zheng edge->node[LOWER] = cur; 8373fd0a558SYan, Zheng edge->node[UPPER] = upper; 8385d4f98a2SYan Zheng 8395d4f98a2SYan Zheng goto next; 8406d8ff4e4SDavid Sterba } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) { 841ba3c2b19SNikolay Borisov err = -EINVAL; 842ba3c2b19SNikolay Borisov btrfs_print_v0_err(rc->extent_root->fs_info); 843ba3c2b19SNikolay Borisov btrfs_handle_fs_error(rc->extent_root->fs_info, err, 844ba3c2b19SNikolay Borisov NULL); 845ba3c2b19SNikolay Borisov goto out; 8465d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 8475d4f98a2SYan Zheng goto next; 8485d4f98a2SYan Zheng } 8495d4f98a2SYan Zheng 850fa6ac715SQu Wenruo /* 851fa6ac715SQu Wenruo * key.type == BTRFS_TREE_BLOCK_REF_KEY, inline ref offset 852fa6ac715SQu Wenruo * means the root objectid. We need to search the tree to get 853fa6ac715SQu Wenruo * its parent bytenr. 854fa6ac715SQu Wenruo */ 8555d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, key.offset); 8565d4f98a2SYan Zheng if (IS_ERR(root)) { 8575d4f98a2SYan Zheng err = PTR_ERR(root); 8585d4f98a2SYan Zheng goto out; 8595d4f98a2SYan Zheng } 8605d4f98a2SYan Zheng 86127cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 8623fd0a558SYan, Zheng cur->cowonly = 1; 8633fd0a558SYan, Zheng 8645d4f98a2SYan Zheng if (btrfs_root_level(&root->root_item) == cur->level) { 8655d4f98a2SYan Zheng /* tree root */ 86675bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 8675d4f98a2SYan Zheng cur->bytenr); 8683fd0a558SYan, Zheng if (should_ignore_root(root)) 8693fd0a558SYan, Zheng list_add(&cur->list, &useless); 8703fd0a558SYan, Zheng else 8715d4f98a2SYan Zheng cur->root = root; 8725d4f98a2SYan Zheng break; 8735d4f98a2SYan Zheng } 8745d4f98a2SYan Zheng 8755d4f98a2SYan Zheng level = cur->level + 1; 8765d4f98a2SYan Zheng 877fa6ac715SQu Wenruo /* Search the tree to find parent blocks referring the block. */ 8785d4f98a2SYan Zheng path2->search_commit_root = 1; 8795d4f98a2SYan Zheng path2->skip_locking = 1; 8805d4f98a2SYan Zheng path2->lowest_level = level; 8815d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0); 8825d4f98a2SYan Zheng path2->lowest_level = 0; 8835d4f98a2SYan Zheng if (ret < 0) { 8845d4f98a2SYan Zheng err = ret; 8855d4f98a2SYan Zheng goto out; 8865d4f98a2SYan Zheng } 88733c66f43SYan Zheng if (ret > 0 && path2->slots[level] > 0) 88833c66f43SYan Zheng path2->slots[level]--; 8895d4f98a2SYan Zheng 8905d4f98a2SYan Zheng eb = path2->nodes[level]; 8913561b9dbSLiu Bo if (btrfs_node_blockptr(eb, path2->slots[level]) != 8923561b9dbSLiu Bo cur->bytenr) { 8933561b9dbSLiu Bo btrfs_err(root->fs_info, 8943561b9dbSLiu Bo "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)", 8954fd786e6SMisono Tomohiro cur->bytenr, level - 1, 8964fd786e6SMisono Tomohiro root->root_key.objectid, 8973561b9dbSLiu Bo node_key->objectid, node_key->type, 8983561b9dbSLiu Bo node_key->offset); 8993561b9dbSLiu Bo err = -ENOENT; 9003561b9dbSLiu Bo goto out; 9013561b9dbSLiu Bo } 9025d4f98a2SYan Zheng lower = cur; 903b6c60c80SJosef Bacik need_check = true; 904fa6ac715SQu Wenruo 905fa6ac715SQu Wenruo /* Add all nodes and edges in the path */ 9065d4f98a2SYan Zheng for (; level < BTRFS_MAX_LEVEL; level++) { 9075d4f98a2SYan Zheng if (!path2->nodes[level]) { 90875bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 9095d4f98a2SYan Zheng lower->bytenr); 9103fd0a558SYan, Zheng if (should_ignore_root(root)) 9113fd0a558SYan, Zheng list_add(&lower->list, &useless); 9123fd0a558SYan, Zheng else 9135d4f98a2SYan Zheng lower->root = root; 9145d4f98a2SYan Zheng break; 9155d4f98a2SYan Zheng } 9165d4f98a2SYan Zheng 9173fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 9185d4f98a2SYan Zheng if (!edge) { 9195d4f98a2SYan Zheng err = -ENOMEM; 9205d4f98a2SYan Zheng goto out; 9215d4f98a2SYan Zheng } 9225d4f98a2SYan Zheng 9235d4f98a2SYan Zheng eb = path2->nodes[level]; 9245d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, eb->start); 9255d4f98a2SYan Zheng if (!rb_node) { 9263fd0a558SYan, Zheng upper = alloc_backref_node(cache); 9275d4f98a2SYan Zheng if (!upper) { 9283fd0a558SYan, Zheng free_backref_edge(cache, edge); 9295d4f98a2SYan Zheng err = -ENOMEM; 9305d4f98a2SYan Zheng goto out; 9315d4f98a2SYan Zheng } 9325d4f98a2SYan Zheng upper->bytenr = eb->start; 9335d4f98a2SYan Zheng upper->owner = btrfs_header_owner(eb); 9345d4f98a2SYan Zheng upper->level = lower->level + 1; 93527cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, 93627cdeb70SMiao Xie &root->state)) 9373fd0a558SYan, Zheng upper->cowonly = 1; 9385d4f98a2SYan Zheng 9395d4f98a2SYan Zheng /* 9405d4f98a2SYan Zheng * if we know the block isn't shared 9415d4f98a2SYan Zheng * we can void checking its backrefs. 9425d4f98a2SYan Zheng */ 9435d4f98a2SYan Zheng if (btrfs_block_can_be_shared(root, eb)) 9445d4f98a2SYan Zheng upper->checked = 0; 9455d4f98a2SYan Zheng else 9465d4f98a2SYan Zheng upper->checked = 1; 9475d4f98a2SYan Zheng 9485d4f98a2SYan Zheng /* 9495d4f98a2SYan Zheng * add the block to pending list if we 950b6c60c80SJosef Bacik * need check its backrefs, we only do this once 951b6c60c80SJosef Bacik * while walking up a tree as we will catch 952b6c60c80SJosef Bacik * anything else later on. 9535d4f98a2SYan Zheng */ 954b6c60c80SJosef Bacik if (!upper->checked && need_check) { 955b6c60c80SJosef Bacik need_check = false; 9565d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], 9575d4f98a2SYan Zheng &list); 958bbe90514SJosef Bacik } else { 959bbe90514SJosef Bacik if (upper->checked) 960bbe90514SJosef Bacik need_check = true; 9615d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 962bbe90514SJosef Bacik } 9635d4f98a2SYan Zheng } else { 9645d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 9655d4f98a2SYan Zheng rb_node); 96675bfb9afSJosef Bacik ASSERT(upper->checked); 9675d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 9683fd0a558SYan, Zheng if (!upper->owner) 9693fd0a558SYan, Zheng upper->owner = btrfs_header_owner(eb); 9705d4f98a2SYan Zheng } 9715d4f98a2SYan Zheng list_add_tail(&edge->list[LOWER], &lower->upper); 9725d4f98a2SYan Zheng edge->node[LOWER] = lower; 9733fd0a558SYan, Zheng edge->node[UPPER] = upper; 9745d4f98a2SYan Zheng 9755d4f98a2SYan Zheng if (rb_node) 9765d4f98a2SYan Zheng break; 9775d4f98a2SYan Zheng lower = upper; 9785d4f98a2SYan Zheng upper = NULL; 9795d4f98a2SYan Zheng } 980b3b4aa74SDavid Sterba btrfs_release_path(path2); 9815d4f98a2SYan Zheng next: 9825d4f98a2SYan Zheng if (ptr < end) { 9835d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 9845d4f98a2SYan Zheng if (ptr >= end) { 9855d4f98a2SYan Zheng WARN_ON(ptr > end); 9865d4f98a2SYan Zheng ptr = 0; 9875d4f98a2SYan Zheng end = 0; 9885d4f98a2SYan Zheng } 9895d4f98a2SYan Zheng } 9905d4f98a2SYan Zheng if (ptr >= end) 9915d4f98a2SYan Zheng path1->slots[0]++; 9925d4f98a2SYan Zheng } 993b3b4aa74SDavid Sterba btrfs_release_path(path1); 9945d4f98a2SYan Zheng 9955d4f98a2SYan Zheng cur->checked = 1; 9965d4f98a2SYan Zheng WARN_ON(exist); 9975d4f98a2SYan Zheng 9985d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 9995d4f98a2SYan Zheng if (!list_empty(&list)) { 10005d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10015d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10025d4f98a2SYan Zheng cur = edge->node[UPPER]; 10035d4f98a2SYan Zheng goto again; 10045d4f98a2SYan Zheng } 10055d4f98a2SYan Zheng 10065d4f98a2SYan Zheng /* 10075d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 10085d4f98a2SYan Zheng * into the cache. 10095d4f98a2SYan Zheng */ 101075bfb9afSJosef Bacik ASSERT(node->checked); 10113fd0a558SYan, Zheng cowonly = node->cowonly; 10123fd0a558SYan, Zheng if (!cowonly) { 10133fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 10143fd0a558SYan, Zheng &node->rb_node); 101543c04fb1SJeff Mahoney if (rb_node) 101643c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 10173fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 10183fd0a558SYan, Zheng } 10195d4f98a2SYan Zheng 10205d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 10215d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10225d4f98a2SYan Zheng 10235d4f98a2SYan Zheng while (!list_empty(&list)) { 10245d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10255d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10265d4f98a2SYan Zheng upper = edge->node[UPPER]; 10273fd0a558SYan, Zheng if (upper->detached) { 10283fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10293fd0a558SYan, Zheng lower = edge->node[LOWER]; 10303fd0a558SYan, Zheng free_backref_edge(cache, edge); 10313fd0a558SYan, Zheng if (list_empty(&lower->upper)) 10323fd0a558SYan, Zheng list_add(&lower->list, &useless); 10333fd0a558SYan, Zheng continue; 10343fd0a558SYan, Zheng } 10355d4f98a2SYan Zheng 10365d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 10375d4f98a2SYan Zheng if (upper->lowest) { 10385d4f98a2SYan Zheng list_del_init(&upper->lower); 10395d4f98a2SYan Zheng upper->lowest = 0; 10405d4f98a2SYan Zheng } 10415d4f98a2SYan Zheng 10425d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10435d4f98a2SYan Zheng continue; 10445d4f98a2SYan Zheng } 10455d4f98a2SYan Zheng 104675bfb9afSJosef Bacik if (!upper->checked) { 104775bfb9afSJosef Bacik /* 104875bfb9afSJosef Bacik * Still want to blow up for developers since this is a 104975bfb9afSJosef Bacik * logic bug. 105075bfb9afSJosef Bacik */ 105175bfb9afSJosef Bacik ASSERT(0); 105275bfb9afSJosef Bacik err = -EINVAL; 105375bfb9afSJosef Bacik goto out; 105475bfb9afSJosef Bacik } 105575bfb9afSJosef Bacik if (cowonly != upper->cowonly) { 105675bfb9afSJosef Bacik ASSERT(0); 105775bfb9afSJosef Bacik err = -EINVAL; 105875bfb9afSJosef Bacik goto out; 105975bfb9afSJosef Bacik } 106075bfb9afSJosef Bacik 10613fd0a558SYan, Zheng if (!cowonly) { 10625d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 10635d4f98a2SYan Zheng &upper->rb_node); 106443c04fb1SJeff Mahoney if (rb_node) 106543c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 106643c04fb1SJeff Mahoney upper->bytenr); 10673fd0a558SYan, Zheng } 10685d4f98a2SYan Zheng 10695d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10705d4f98a2SYan Zheng 10715d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 10725d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10735d4f98a2SYan Zheng } 10743fd0a558SYan, Zheng /* 10753fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 10763fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 10773fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 10783fd0a558SYan, Zheng * lookup. 10793fd0a558SYan, Zheng */ 10803fd0a558SYan, Zheng while (!list_empty(&useless)) { 10813fd0a558SYan, Zheng upper = list_entry(useless.next, struct backref_node, list); 10823fd0a558SYan, Zheng list_del_init(&upper->list); 108375bfb9afSJosef Bacik ASSERT(list_empty(&upper->upper)); 10843fd0a558SYan, Zheng if (upper == node) 10853fd0a558SYan, Zheng node = NULL; 10863fd0a558SYan, Zheng if (upper->lowest) { 10873fd0a558SYan, Zheng list_del_init(&upper->lower); 10883fd0a558SYan, Zheng upper->lowest = 0; 10893fd0a558SYan, Zheng } 10903fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 10913fd0a558SYan, Zheng edge = list_entry(upper->lower.next, 10923fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 10933fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 10943fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10953fd0a558SYan, Zheng lower = edge->node[LOWER]; 10963fd0a558SYan, Zheng free_backref_edge(cache, edge); 10973fd0a558SYan, Zheng 10983fd0a558SYan, Zheng if (list_empty(&lower->upper)) 10993fd0a558SYan, Zheng list_add(&lower->list, &useless); 11003fd0a558SYan, Zheng } 11013fd0a558SYan, Zheng __mark_block_processed(rc, upper); 11023fd0a558SYan, Zheng if (upper->level > 0) { 11033fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 11043fd0a558SYan, Zheng upper->detached = 1; 11053fd0a558SYan, Zheng } else { 11063fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 11073fd0a558SYan, Zheng free_backref_node(cache, upper); 11083fd0a558SYan, Zheng } 11093fd0a558SYan, Zheng } 11105d4f98a2SYan Zheng out: 11115d4f98a2SYan Zheng btrfs_free_path(path1); 11125d4f98a2SYan Zheng btrfs_free_path(path2); 11135d4f98a2SYan Zheng if (err) { 11143fd0a558SYan, Zheng while (!list_empty(&useless)) { 11153fd0a558SYan, Zheng lower = list_entry(useless.next, 111675bfb9afSJosef Bacik struct backref_node, list); 111775bfb9afSJosef Bacik list_del_init(&lower->list); 11183fd0a558SYan, Zheng } 111975bfb9afSJosef Bacik while (!list_empty(&list)) { 112075bfb9afSJosef Bacik edge = list_first_entry(&list, struct backref_edge, 112175bfb9afSJosef Bacik list[UPPER]); 112275bfb9afSJosef Bacik list_del(&edge->list[UPPER]); 11233fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 112475bfb9afSJosef Bacik lower = edge->node[LOWER]; 11255d4f98a2SYan Zheng upper = edge->node[UPPER]; 11263fd0a558SYan, Zheng free_backref_edge(cache, edge); 112775bfb9afSJosef Bacik 112875bfb9afSJosef Bacik /* 112975bfb9afSJosef Bacik * Lower is no longer linked to any upper backref nodes 113075bfb9afSJosef Bacik * and isn't in the cache, we can free it ourselves. 113175bfb9afSJosef Bacik */ 113275bfb9afSJosef Bacik if (list_empty(&lower->upper) && 113375bfb9afSJosef Bacik RB_EMPTY_NODE(&lower->rb_node)) 113475bfb9afSJosef Bacik list_add(&lower->list, &useless); 113575bfb9afSJosef Bacik 113675bfb9afSJosef Bacik if (!RB_EMPTY_NODE(&upper->rb_node)) 113775bfb9afSJosef Bacik continue; 113875bfb9afSJosef Bacik 113901327610SNicholas D Steeves /* Add this guy's upper edges to the list to process */ 114075bfb9afSJosef Bacik list_for_each_entry(edge, &upper->upper, list[LOWER]) 114175bfb9afSJosef Bacik list_add_tail(&edge->list[UPPER], &list); 114275bfb9afSJosef Bacik if (list_empty(&upper->upper)) 114375bfb9afSJosef Bacik list_add(&upper->list, &useless); 114475bfb9afSJosef Bacik } 114575bfb9afSJosef Bacik 114675bfb9afSJosef Bacik while (!list_empty(&useless)) { 114775bfb9afSJosef Bacik lower = list_entry(useless.next, 114875bfb9afSJosef Bacik struct backref_node, list); 114975bfb9afSJosef Bacik list_del_init(&lower->list); 11500fd8c3daSLiu Bo if (lower == node) 11510fd8c3daSLiu Bo node = NULL; 115275bfb9afSJosef Bacik free_backref_node(cache, lower); 11535d4f98a2SYan Zheng } 11540fd8c3daSLiu Bo 11550fd8c3daSLiu Bo free_backref_node(cache, node); 11565d4f98a2SYan Zheng return ERR_PTR(err); 11575d4f98a2SYan Zheng } 115875bfb9afSJosef Bacik ASSERT(!node || !node->detached); 11595d4f98a2SYan Zheng return node; 11605d4f98a2SYan Zheng } 11615d4f98a2SYan Zheng 11625d4f98a2SYan Zheng /* 11633fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 11643fd0a558SYan, Zheng * the backref node is created by cloning backref node that 11653fd0a558SYan, Zheng * corresponds to root of source tree 11663fd0a558SYan, Zheng */ 11673fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 11683fd0a558SYan, Zheng struct reloc_control *rc, 11693fd0a558SYan, Zheng struct btrfs_root *src, 11703fd0a558SYan, Zheng struct btrfs_root *dest) 11713fd0a558SYan, Zheng { 11723fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 11733fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 11743fd0a558SYan, Zheng struct backref_node *node = NULL; 11753fd0a558SYan, Zheng struct backref_node *new_node; 11763fd0a558SYan, Zheng struct backref_edge *edge; 11773fd0a558SYan, Zheng struct backref_edge *new_edge; 11783fd0a558SYan, Zheng struct rb_node *rb_node; 11793fd0a558SYan, Zheng 11803fd0a558SYan, Zheng if (cache->last_trans > 0) 11813fd0a558SYan, Zheng update_backref_cache(trans, cache); 11823fd0a558SYan, Zheng 11833fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 11843fd0a558SYan, Zheng if (rb_node) { 11853fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 11863fd0a558SYan, Zheng if (node->detached) 11873fd0a558SYan, Zheng node = NULL; 11883fd0a558SYan, Zheng else 11893fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 11903fd0a558SYan, Zheng } 11913fd0a558SYan, Zheng 11923fd0a558SYan, Zheng if (!node) { 11933fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 11943fd0a558SYan, Zheng reloc_root->commit_root->start); 11953fd0a558SYan, Zheng if (rb_node) { 11963fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 11973fd0a558SYan, Zheng rb_node); 11983fd0a558SYan, Zheng BUG_ON(node->detached); 11993fd0a558SYan, Zheng } 12003fd0a558SYan, Zheng } 12013fd0a558SYan, Zheng 12023fd0a558SYan, Zheng if (!node) 12033fd0a558SYan, Zheng return 0; 12043fd0a558SYan, Zheng 12053fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 12063fd0a558SYan, Zheng if (!new_node) 12073fd0a558SYan, Zheng return -ENOMEM; 12083fd0a558SYan, Zheng 12093fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 12103fd0a558SYan, Zheng new_node->level = node->level; 12113fd0a558SYan, Zheng new_node->lowest = node->lowest; 12126848ad64SYan, Zheng new_node->checked = 1; 12133fd0a558SYan, Zheng new_node->root = dest; 12143fd0a558SYan, Zheng 12153fd0a558SYan, Zheng if (!node->lowest) { 12163fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 12173fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 12183fd0a558SYan, Zheng if (!new_edge) 12193fd0a558SYan, Zheng goto fail; 12203fd0a558SYan, Zheng 12213fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 12223fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 12233fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 12243fd0a558SYan, Zheng &new_node->lower); 12253fd0a558SYan, Zheng } 122676b9e23dSMiao Xie } else { 122776b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 12283fd0a558SYan, Zheng } 12293fd0a558SYan, Zheng 12303fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 12313fd0a558SYan, Zheng &new_node->rb_node); 123243c04fb1SJeff Mahoney if (rb_node) 123343c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 12343fd0a558SYan, Zheng 12353fd0a558SYan, Zheng if (!new_node->lowest) { 12363fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 12373fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 12383fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 12393fd0a558SYan, Zheng } 12403fd0a558SYan, Zheng } 12413fd0a558SYan, Zheng return 0; 12423fd0a558SYan, Zheng fail: 12433fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 12443fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 12453fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 12463fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 12473fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 12483fd0a558SYan, Zheng } 12493fd0a558SYan, Zheng free_backref_node(cache, new_node); 12503fd0a558SYan, Zheng return -ENOMEM; 12513fd0a558SYan, Zheng } 12523fd0a558SYan, Zheng 12533fd0a558SYan, Zheng /* 12545d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 12555d4f98a2SYan Zheng */ 1256ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 12575d4f98a2SYan Zheng { 12580b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 12595d4f98a2SYan Zheng struct rb_node *rb_node; 12605d4f98a2SYan Zheng struct mapping_node *node; 12610b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 12625d4f98a2SYan Zheng 12635d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1264ffd7b339SJeff Mahoney if (!node) 1265ffd7b339SJeff Mahoney return -ENOMEM; 12665d4f98a2SYan Zheng 12675d4f98a2SYan Zheng node->bytenr = root->node->start; 12685d4f98a2SYan Zheng node->data = root; 12695d4f98a2SYan Zheng 12705d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12715d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 12725d4f98a2SYan Zheng node->bytenr, &node->rb_node); 12735d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1274ffd7b339SJeff Mahoney if (rb_node) { 12750b246afaSJeff Mahoney btrfs_panic(fs_info, -EEXIST, 12765d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 12775d163e0eSJeff Mahoney node->bytenr); 1278ffd7b339SJeff Mahoney } 12795d4f98a2SYan Zheng 12805d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 12815d4f98a2SYan Zheng return 0; 12825d4f98a2SYan Zheng } 12835d4f98a2SYan Zheng 12845d4f98a2SYan Zheng /* 1285c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 12865d4f98a2SYan Zheng * mapping 12875d4f98a2SYan Zheng */ 1288c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 12895d4f98a2SYan Zheng { 12900b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 12915d4f98a2SYan Zheng struct rb_node *rb_node; 12925d4f98a2SYan Zheng struct mapping_node *node = NULL; 12930b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 12945d4f98a2SYan Zheng 129565c6e82bSQu Wenruo if (rc && root->node) { 12965d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12975d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1298c974c464SWang Shilong root->node->start); 1299c974c464SWang Shilong if (rb_node) { 1300c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1301c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1302c974c464SWang Shilong } 1303c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1304c974c464SWang Shilong if (!node) 1305c974c464SWang Shilong return; 1306c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1307389305b2SQu Wenruo } 1308c974c464SWang Shilong 13090b246afaSJeff Mahoney spin_lock(&fs_info->trans_lock); 1310c974c464SWang Shilong list_del_init(&root->root_list); 13110b246afaSJeff Mahoney spin_unlock(&fs_info->trans_lock); 1312c974c464SWang Shilong kfree(node); 1313c974c464SWang Shilong } 1314c974c464SWang Shilong 1315c974c464SWang Shilong /* 1316c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1317c974c464SWang Shilong * mapping 1318c974c464SWang Shilong */ 1319c974c464SWang Shilong static int __update_reloc_root(struct btrfs_root *root, u64 new_bytenr) 1320c974c464SWang Shilong { 13210b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 1322c974c464SWang Shilong struct rb_node *rb_node; 1323c974c464SWang Shilong struct mapping_node *node = NULL; 13240b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1325c974c464SWang Shilong 1326c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1327c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1328c974c464SWang Shilong root->node->start); 13295d4f98a2SYan Zheng if (rb_node) { 13305d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 13315d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 13325d4f98a2SYan Zheng } 13335d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 13345d4f98a2SYan Zheng 13358f71f3e0SLiu Bo if (!node) 13368f71f3e0SLiu Bo return 0; 13375d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 13385d4f98a2SYan Zheng 13395d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1340c974c464SWang Shilong node->bytenr = new_bytenr; 13415d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13425d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13435d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 134443c04fb1SJeff Mahoney if (rb_node) 134543c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 13465d4f98a2SYan Zheng return 0; 13475d4f98a2SYan Zheng } 13485d4f98a2SYan Zheng 13493fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 13503fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 13515d4f98a2SYan Zheng { 13520b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 13535d4f98a2SYan Zheng struct btrfs_root *reloc_root; 13545d4f98a2SYan Zheng struct extent_buffer *eb; 13555d4f98a2SYan Zheng struct btrfs_root_item *root_item; 13565d4f98a2SYan Zheng struct btrfs_key root_key; 13575d4f98a2SYan Zheng int ret; 13585d4f98a2SYan Zheng 13595d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 13605d4f98a2SYan Zheng BUG_ON(!root_item); 13615d4f98a2SYan Zheng 13625d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 13635d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 13643fd0a558SYan, Zheng root_key.offset = objectid; 13655d4f98a2SYan Zheng 13663fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 1367054570a1SFilipe Manana u64 commit_root_gen; 1368054570a1SFilipe Manana 13693fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 13705d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 13715d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 13725d4f98a2SYan Zheng BUG_ON(ret); 1373054570a1SFilipe Manana /* 1374054570a1SFilipe Manana * Set the last_snapshot field to the generation of the commit 1375054570a1SFilipe Manana * root - like this ctree.c:btrfs_block_can_be_shared() behaves 1376054570a1SFilipe Manana * correctly (returns true) when the relocation root is created 1377054570a1SFilipe Manana * either inside the critical section of a transaction commit 1378054570a1SFilipe Manana * (through transaction.c:qgroup_account_snapshot()) and when 1379054570a1SFilipe Manana * it's created before the transaction commit is started. 1380054570a1SFilipe Manana */ 1381054570a1SFilipe Manana commit_root_gen = btrfs_header_generation(root->commit_root); 1382054570a1SFilipe Manana btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); 13833fd0a558SYan, Zheng } else { 13843fd0a558SYan, Zheng /* 13853fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 13863fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 13873fd0a558SYan, Zheng * modified after it was created have RELOC flag 13883fd0a558SYan, Zheng * set in their headers. so it's OK to not update 13893fd0a558SYan, Zheng * the 'last_snapshot'. 13903fd0a558SYan, Zheng */ 13913fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 13923fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 13933fd0a558SYan, Zheng BUG_ON(ret); 13943fd0a558SYan, Zheng } 13953fd0a558SYan, Zheng 13965d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 13975d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 13985d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 13995d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 14003fd0a558SYan, Zheng 14013fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 14023fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 14033fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 14043fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 14055d4f98a2SYan Zheng root_item->drop_level = 0; 14063fd0a558SYan, Zheng } 14075d4f98a2SYan Zheng 14085d4f98a2SYan Zheng btrfs_tree_unlock(eb); 14095d4f98a2SYan Zheng free_extent_buffer(eb); 14105d4f98a2SYan Zheng 14110b246afaSJeff Mahoney ret = btrfs_insert_root(trans, fs_info->tree_root, 14125d4f98a2SYan Zheng &root_key, root_item); 14135d4f98a2SYan Zheng BUG_ON(ret); 14145d4f98a2SYan Zheng kfree(root_item); 14155d4f98a2SYan Zheng 14160b246afaSJeff Mahoney reloc_root = btrfs_read_fs_root(fs_info->tree_root, &root_key); 14175d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 14185d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 14193fd0a558SYan, Zheng return reloc_root; 14203fd0a558SYan, Zheng } 14213fd0a558SYan, Zheng 14223fd0a558SYan, Zheng /* 14233fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 14243fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 14253fd0a558SYan, Zheng */ 14263fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 14273fd0a558SYan, Zheng struct btrfs_root *root) 14283fd0a558SYan, Zheng { 14290b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14303fd0a558SYan, Zheng struct btrfs_root *reloc_root; 14310b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 143220dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 14333fd0a558SYan, Zheng int clear_rsv = 0; 1434ffd7b339SJeff Mahoney int ret; 14353fd0a558SYan, Zheng 14363fd0a558SYan, Zheng if (root->reloc_root) { 14373fd0a558SYan, Zheng reloc_root = root->reloc_root; 14383fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 14393fd0a558SYan, Zheng return 0; 14403fd0a558SYan, Zheng } 14413fd0a558SYan, Zheng 14423fd0a558SYan, Zheng if (!rc || !rc->create_reloc_tree || 14433fd0a558SYan, Zheng root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 14443fd0a558SYan, Zheng return 0; 14453fd0a558SYan, Zheng 144620dd2cbfSMiao Xie if (!trans->reloc_reserved) { 144720dd2cbfSMiao Xie rsv = trans->block_rsv; 14483fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 14493fd0a558SYan, Zheng clear_rsv = 1; 14503fd0a558SYan, Zheng } 14513fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 14523fd0a558SYan, Zheng if (clear_rsv) 145320dd2cbfSMiao Xie trans->block_rsv = rsv; 14545d4f98a2SYan Zheng 1455ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1456ffd7b339SJeff Mahoney BUG_ON(ret < 0); 14575d4f98a2SYan Zheng root->reloc_root = reloc_root; 14585d4f98a2SYan Zheng return 0; 14595d4f98a2SYan Zheng } 14605d4f98a2SYan Zheng 14615d4f98a2SYan Zheng /* 14625d4f98a2SYan Zheng * update root item of reloc tree 14635d4f98a2SYan Zheng */ 14645d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 14655d4f98a2SYan Zheng struct btrfs_root *root) 14665d4f98a2SYan Zheng { 14670b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14685d4f98a2SYan Zheng struct btrfs_root *reloc_root; 14695d4f98a2SYan Zheng struct btrfs_root_item *root_item; 14705d4f98a2SYan Zheng int ret; 14715d4f98a2SYan Zheng 1472d2311e69SQu Wenruo if (test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state) || 1473d2311e69SQu Wenruo !root->reloc_root) 14747585717fSChris Mason goto out; 14755d4f98a2SYan Zheng 14765d4f98a2SYan Zheng reloc_root = root->reloc_root; 14775d4f98a2SYan Zheng root_item = &reloc_root->root_item; 14785d4f98a2SYan Zheng 1479d2311e69SQu Wenruo /* root->reloc_root will stay until current relocation finished */ 14800b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 14813fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 1482d2311e69SQu Wenruo set_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 1483c974c464SWang Shilong __del_reloc_root(reloc_root); 14845d4f98a2SYan Zheng } 14855d4f98a2SYan Zheng 14865d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 14875d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 14885d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 14895d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 14905d4f98a2SYan Zheng } 14915d4f98a2SYan Zheng 14920b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 14935d4f98a2SYan Zheng &reloc_root->root_key, root_item); 14945d4f98a2SYan Zheng BUG_ON(ret); 14957585717fSChris Mason 14967585717fSChris Mason out: 14975d4f98a2SYan Zheng return 0; 14985d4f98a2SYan Zheng } 14995d4f98a2SYan Zheng 15005d4f98a2SYan Zheng /* 15015d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 15025d4f98a2SYan Zheng * in a subvolume 15035d4f98a2SYan Zheng */ 15045d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 15055d4f98a2SYan Zheng { 15065d4f98a2SYan Zheng struct rb_node *node; 15075d4f98a2SYan Zheng struct rb_node *prev; 15085d4f98a2SYan Zheng struct btrfs_inode *entry; 15095d4f98a2SYan Zheng struct inode *inode; 15105d4f98a2SYan Zheng 15115d4f98a2SYan Zheng spin_lock(&root->inode_lock); 15125d4f98a2SYan Zheng again: 15135d4f98a2SYan Zheng node = root->inode_tree.rb_node; 15145d4f98a2SYan Zheng prev = NULL; 15155d4f98a2SYan Zheng while (node) { 15165d4f98a2SYan Zheng prev = node; 15175d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 15185d4f98a2SYan Zheng 15194a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 15205d4f98a2SYan Zheng node = node->rb_left; 15214a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 15225d4f98a2SYan Zheng node = node->rb_right; 15235d4f98a2SYan Zheng else 15245d4f98a2SYan Zheng break; 15255d4f98a2SYan Zheng } 15265d4f98a2SYan Zheng if (!node) { 15275d4f98a2SYan Zheng while (prev) { 15285d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 15294a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 15305d4f98a2SYan Zheng node = prev; 15315d4f98a2SYan Zheng break; 15325d4f98a2SYan Zheng } 15335d4f98a2SYan Zheng prev = rb_next(prev); 15345d4f98a2SYan Zheng } 15355d4f98a2SYan Zheng } 15365d4f98a2SYan Zheng while (node) { 15375d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 15385d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 15395d4f98a2SYan Zheng if (inode) { 15405d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15415d4f98a2SYan Zheng return inode; 15425d4f98a2SYan Zheng } 15435d4f98a2SYan Zheng 15444a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 15455d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 15465d4f98a2SYan Zheng goto again; 15475d4f98a2SYan Zheng 15485d4f98a2SYan Zheng node = rb_next(node); 15495d4f98a2SYan Zheng } 15505d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15515d4f98a2SYan Zheng return NULL; 15525d4f98a2SYan Zheng } 15535d4f98a2SYan Zheng 15545d4f98a2SYan Zheng static int in_block_group(u64 bytenr, 15555d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group) 15565d4f98a2SYan Zheng { 15575d4f98a2SYan Zheng if (bytenr >= block_group->key.objectid && 15585d4f98a2SYan Zheng bytenr < block_group->key.objectid + block_group->key.offset) 15595d4f98a2SYan Zheng return 1; 15605d4f98a2SYan Zheng return 0; 15615d4f98a2SYan Zheng } 15625d4f98a2SYan Zheng 15635d4f98a2SYan Zheng /* 15645d4f98a2SYan Zheng * get new location of data 15655d4f98a2SYan Zheng */ 15665d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 15675d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 15685d4f98a2SYan Zheng { 15695d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 15705d4f98a2SYan Zheng struct btrfs_path *path; 15715d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 15725d4f98a2SYan Zheng struct extent_buffer *leaf; 15735d4f98a2SYan Zheng int ret; 15745d4f98a2SYan Zheng 15755d4f98a2SYan Zheng path = btrfs_alloc_path(); 15765d4f98a2SYan Zheng if (!path) 15775d4f98a2SYan Zheng return -ENOMEM; 15785d4f98a2SYan Zheng 15795d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 1580f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 1581f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 15825d4f98a2SYan Zheng if (ret < 0) 15835d4f98a2SYan Zheng goto out; 15845d4f98a2SYan Zheng if (ret > 0) { 15855d4f98a2SYan Zheng ret = -ENOENT; 15865d4f98a2SYan Zheng goto out; 15875d4f98a2SYan Zheng } 15885d4f98a2SYan Zheng 15895d4f98a2SYan Zheng leaf = path->nodes[0]; 15905d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 15915d4f98a2SYan Zheng struct btrfs_file_extent_item); 15925d4f98a2SYan Zheng 15935d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 15945d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 15955d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 15965d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 15975d4f98a2SYan Zheng 15985d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 159983d4cfd4SJosef Bacik ret = -EINVAL; 16005d4f98a2SYan Zheng goto out; 16015d4f98a2SYan Zheng } 16025d4f98a2SYan Zheng 16035d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16045d4f98a2SYan Zheng ret = 0; 16055d4f98a2SYan Zheng out: 16065d4f98a2SYan Zheng btrfs_free_path(path); 16075d4f98a2SYan Zheng return ret; 16085d4f98a2SYan Zheng } 16095d4f98a2SYan Zheng 16105d4f98a2SYan Zheng /* 16115d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 16125d4f98a2SYan Zheng * the new locations. 16135d4f98a2SYan Zheng */ 16143fd0a558SYan, Zheng static noinline_for_stack 16153fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 16165d4f98a2SYan Zheng struct reloc_control *rc, 16175d4f98a2SYan Zheng struct btrfs_root *root, 16183fd0a558SYan, Zheng struct extent_buffer *leaf) 16195d4f98a2SYan Zheng { 16200b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 16215d4f98a2SYan Zheng struct btrfs_key key; 16225d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 16235d4f98a2SYan Zheng struct inode *inode = NULL; 16245d4f98a2SYan Zheng u64 parent; 16255d4f98a2SYan Zheng u64 bytenr; 16263fd0a558SYan, Zheng u64 new_bytenr = 0; 16275d4f98a2SYan Zheng u64 num_bytes; 16285d4f98a2SYan Zheng u64 end; 16295d4f98a2SYan Zheng u32 nritems; 16305d4f98a2SYan Zheng u32 i; 163183d4cfd4SJosef Bacik int ret = 0; 16325d4f98a2SYan Zheng int first = 1; 16335d4f98a2SYan Zheng int dirty = 0; 16345d4f98a2SYan Zheng 16355d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 16365d4f98a2SYan Zheng return 0; 16375d4f98a2SYan Zheng 16385d4f98a2SYan Zheng /* reloc trees always use full backref */ 16395d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 16405d4f98a2SYan Zheng parent = leaf->start; 16415d4f98a2SYan Zheng else 16425d4f98a2SYan Zheng parent = 0; 16435d4f98a2SYan Zheng 16445d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 16455d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 16465d4f98a2SYan Zheng cond_resched(); 16475d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 16485d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 16495d4f98a2SYan Zheng continue; 16505d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 16515d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 16525d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 16535d4f98a2SYan Zheng continue; 16545d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16555d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 16565d4f98a2SYan Zheng if (bytenr == 0) 16575d4f98a2SYan Zheng continue; 16585d4f98a2SYan Zheng if (!in_block_group(bytenr, rc->block_group)) 16595d4f98a2SYan Zheng continue; 16605d4f98a2SYan Zheng 16615d4f98a2SYan Zheng /* 16625d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 16635d4f98a2SYan Zheng * to complete and drop the extent cache 16645d4f98a2SYan Zheng */ 16655d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 16665d4f98a2SYan Zheng if (first) { 16675d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16685d4f98a2SYan Zheng first = 0; 16694a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 16703fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 16715d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16725d4f98a2SYan Zheng } 16734a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 16745d4f98a2SYan Zheng end = key.offset + 16755d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 16765d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 16770b246afaSJeff Mahoney fs_info->sectorsize)); 16780b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 16795d4f98a2SYan Zheng end--; 16805d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1681d0082371SJeff Mahoney key.offset, end); 16825d4f98a2SYan Zheng if (!ret) 16835d4f98a2SYan Zheng continue; 16845d4f98a2SYan Zheng 1685dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1686dcdbc059SNikolay Borisov key.offset, end, 1); 16875d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1688d0082371SJeff Mahoney key.offset, end); 16895d4f98a2SYan Zheng } 16905d4f98a2SYan Zheng } 16915d4f98a2SYan Zheng 16925d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 16935d4f98a2SYan Zheng bytenr, num_bytes); 169483d4cfd4SJosef Bacik if (ret) { 169583d4cfd4SJosef Bacik /* 169683d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 169783d4cfd4SJosef Bacik * in the file extent yet. 169883d4cfd4SJosef Bacik */ 169983d4cfd4SJosef Bacik break; 17003fd0a558SYan, Zheng } 17015d4f98a2SYan Zheng 17025d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 17035d4f98a2SYan Zheng dirty = 1; 17045d4f98a2SYan Zheng 17055d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 170684f7d8e6SJosef Bacik ret = btrfs_inc_extent_ref(trans, root, new_bytenr, 17075d4f98a2SYan Zheng num_bytes, parent, 17085d4f98a2SYan Zheng btrfs_header_owner(leaf), 1709b06c4bf5SFilipe Manana key.objectid, key.offset); 171083d4cfd4SJosef Bacik if (ret) { 171166642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 171283d4cfd4SJosef Bacik break; 171383d4cfd4SJosef Bacik } 17145d4f98a2SYan Zheng 171584f7d8e6SJosef Bacik ret = btrfs_free_extent(trans, root, bytenr, num_bytes, 17165d4f98a2SYan Zheng parent, btrfs_header_owner(leaf), 1717b06c4bf5SFilipe Manana key.objectid, key.offset); 171883d4cfd4SJosef Bacik if (ret) { 171966642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 172083d4cfd4SJosef Bacik break; 172183d4cfd4SJosef Bacik } 17225d4f98a2SYan Zheng } 17235d4f98a2SYan Zheng if (dirty) 17245d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 17253fd0a558SYan, Zheng if (inode) 17263fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 172783d4cfd4SJosef Bacik return ret; 17285d4f98a2SYan Zheng } 17295d4f98a2SYan Zheng 17305d4f98a2SYan Zheng static noinline_for_stack 17315d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 17325d4f98a2SYan Zheng struct btrfs_path *path, int level) 17335d4f98a2SYan Zheng { 17345d4f98a2SYan Zheng struct btrfs_disk_key key1; 17355d4f98a2SYan Zheng struct btrfs_disk_key key2; 17365d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 17375d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 17385d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 17395d4f98a2SYan Zheng } 17405d4f98a2SYan Zheng 17415d4f98a2SYan Zheng /* 17425d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 17435d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 17445d4f98a2SYan Zheng * reloc tree was create can be replaced. 17455d4f98a2SYan Zheng * 17465d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 17475d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 17485d4f98a2SYan Zheng * errors, a negative error number is returned. 17495d4f98a2SYan Zheng */ 17503fd0a558SYan, Zheng static noinline_for_stack 17513d0174f7SQu Wenruo int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, 17525d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 17535d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 17545d4f98a2SYan Zheng int lowest_level, int max_level) 17555d4f98a2SYan Zheng { 17560b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 17575d4f98a2SYan Zheng struct extent_buffer *eb; 17585d4f98a2SYan Zheng struct extent_buffer *parent; 17595d4f98a2SYan Zheng struct btrfs_key key; 17605d4f98a2SYan Zheng u64 old_bytenr; 17615d4f98a2SYan Zheng u64 new_bytenr; 17625d4f98a2SYan Zheng u64 old_ptr_gen; 17635d4f98a2SYan Zheng u64 new_ptr_gen; 17645d4f98a2SYan Zheng u64 last_snapshot; 17655d4f98a2SYan Zheng u32 blocksize; 17663fd0a558SYan, Zheng int cow = 0; 17675d4f98a2SYan Zheng int level; 17685d4f98a2SYan Zheng int ret; 17695d4f98a2SYan Zheng int slot; 17705d4f98a2SYan Zheng 17715d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 17725d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 17735d4f98a2SYan Zheng 17745d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 17753fd0a558SYan, Zheng again: 17765d4f98a2SYan Zheng slot = path->slots[lowest_level]; 17775d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 17785d4f98a2SYan Zheng 17795d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 17805d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 17815d4f98a2SYan Zheng level = btrfs_header_level(eb); 17825d4f98a2SYan Zheng 17835d4f98a2SYan Zheng if (level < lowest_level) { 17845d4f98a2SYan Zheng btrfs_tree_unlock(eb); 17855d4f98a2SYan Zheng free_extent_buffer(eb); 17865d4f98a2SYan Zheng return 0; 17875d4f98a2SYan Zheng } 17885d4f98a2SYan Zheng 17893fd0a558SYan, Zheng if (cow) { 17905d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 17915d4f98a2SYan Zheng BUG_ON(ret); 17923fd0a558SYan, Zheng } 17935d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 17945d4f98a2SYan Zheng 17955d4f98a2SYan Zheng if (next_key) { 17965d4f98a2SYan Zheng next_key->objectid = (u64)-1; 17975d4f98a2SYan Zheng next_key->type = (u8)-1; 17985d4f98a2SYan Zheng next_key->offset = (u64)-1; 17995d4f98a2SYan Zheng } 18005d4f98a2SYan Zheng 18015d4f98a2SYan Zheng parent = eb; 18025d4f98a2SYan Zheng while (1) { 1803581c1760SQu Wenruo struct btrfs_key first_key; 1804581c1760SQu Wenruo 18055d4f98a2SYan Zheng level = btrfs_header_level(parent); 18065d4f98a2SYan Zheng BUG_ON(level < lowest_level); 18075d4f98a2SYan Zheng 18085d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 18095d4f98a2SYan Zheng if (ret && slot > 0) 18105d4f98a2SYan Zheng slot--; 18115d4f98a2SYan Zheng 18125d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 18135d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 18145d4f98a2SYan Zheng 18155d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 18160b246afaSJeff Mahoney blocksize = fs_info->nodesize; 18175d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 181817515f1bSQu Wenruo btrfs_node_key_to_cpu(parent, &first_key, slot); 18195d4f98a2SYan Zheng 18205d4f98a2SYan Zheng if (level <= max_level) { 18215d4f98a2SYan Zheng eb = path->nodes[level]; 18225d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 18235d4f98a2SYan Zheng path->slots[level]); 18245d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 18255d4f98a2SYan Zheng path->slots[level]); 18265d4f98a2SYan Zheng } else { 18275d4f98a2SYan Zheng new_bytenr = 0; 18285d4f98a2SYan Zheng new_ptr_gen = 0; 18295d4f98a2SYan Zheng } 18305d4f98a2SYan Zheng 1831fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 18325d4f98a2SYan Zheng ret = level; 18335d4f98a2SYan Zheng break; 18345d4f98a2SYan Zheng } 18355d4f98a2SYan Zheng 18365d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 18375d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 18383fd0a558SYan, Zheng if (level <= lowest_level) { 18395d4f98a2SYan Zheng ret = 0; 18405d4f98a2SYan Zheng break; 18415d4f98a2SYan Zheng } 18425d4f98a2SYan Zheng 1843581c1760SQu Wenruo eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen, 1844581c1760SQu Wenruo level - 1, &first_key); 184564c043deSLiu Bo if (IS_ERR(eb)) { 184664c043deSLiu Bo ret = PTR_ERR(eb); 1847264813acSLiu Bo break; 184864c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 184964c043deSLiu Bo ret = -EIO; 1850416bc658SJosef Bacik free_extent_buffer(eb); 1851379cde74SStefan Behrens break; 1852416bc658SJosef Bacik } 18535d4f98a2SYan Zheng btrfs_tree_lock(eb); 18543fd0a558SYan, Zheng if (cow) { 18555d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 18565d4f98a2SYan Zheng slot, &eb); 18575d4f98a2SYan Zheng BUG_ON(ret); 18585d4f98a2SYan Zheng } 18593fd0a558SYan, Zheng btrfs_set_lock_blocking(eb); 18605d4f98a2SYan Zheng 18615d4f98a2SYan Zheng btrfs_tree_unlock(parent); 18625d4f98a2SYan Zheng free_extent_buffer(parent); 18635d4f98a2SYan Zheng 18645d4f98a2SYan Zheng parent = eb; 18655d4f98a2SYan Zheng continue; 18665d4f98a2SYan Zheng } 18675d4f98a2SYan Zheng 18683fd0a558SYan, Zheng if (!cow) { 18693fd0a558SYan, Zheng btrfs_tree_unlock(parent); 18703fd0a558SYan, Zheng free_extent_buffer(parent); 18713fd0a558SYan, Zheng cow = 1; 18723fd0a558SYan, Zheng goto again; 18733fd0a558SYan, Zheng } 18743fd0a558SYan, Zheng 18755d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 18765d4f98a2SYan Zheng path->slots[level]); 1877b3b4aa74SDavid Sterba btrfs_release_path(path); 18785d4f98a2SYan Zheng 18795d4f98a2SYan Zheng path->lowest_level = level; 18805d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 18815d4f98a2SYan Zheng path->lowest_level = 0; 18825d4f98a2SYan Zheng BUG_ON(ret); 18835d4f98a2SYan Zheng 18845d4f98a2SYan Zheng /* 1885824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 1886824d8dffSQu Wenruo * 1887824d8dffSQu Wenruo * We must trace both trees. 1888824d8dffSQu Wenruo * 1) Tree reloc subtree 1889824d8dffSQu Wenruo * If not traced, we will leak data numbers 1890824d8dffSQu Wenruo * 2) Fs subtree 1891824d8dffSQu Wenruo * If not traced, we will double count old data 1892f616f5cdSQu Wenruo * 1893f616f5cdSQu Wenruo * We don't scan the subtree right now, but only record 1894f616f5cdSQu Wenruo * the swapped tree blocks. 1895f616f5cdSQu Wenruo * The real subtree rescan is delayed until we have new 1896f616f5cdSQu Wenruo * CoW on the subtree root node before transaction commit. 1897824d8dffSQu Wenruo */ 1898370a11b8SQu Wenruo ret = btrfs_qgroup_add_swapped_blocks(trans, dest, 1899370a11b8SQu Wenruo rc->block_group, parent, slot, 1900370a11b8SQu Wenruo path->nodes[level], path->slots[level], 1901370a11b8SQu Wenruo last_snapshot); 1902370a11b8SQu Wenruo if (ret < 0) 1903370a11b8SQu Wenruo break; 1904824d8dffSQu Wenruo /* 19055d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 19065d4f98a2SYan Zheng */ 19075d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 19085d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 19095d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 19105d4f98a2SYan Zheng 19115d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 19125d4f98a2SYan Zheng path->slots[level], old_bytenr); 19135d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 19145d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 19155d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 19165d4f98a2SYan Zheng 191784f7d8e6SJosef Bacik ret = btrfs_inc_extent_ref(trans, src, old_bytenr, 19182ff7e61eSJeff Mahoney blocksize, path->nodes[level]->start, 1919b06c4bf5SFilipe Manana src->root_key.objectid, level - 1, 0); 19205d4f98a2SYan Zheng BUG_ON(ret); 192184f7d8e6SJosef Bacik ret = btrfs_inc_extent_ref(trans, dest, new_bytenr, 19222ff7e61eSJeff Mahoney blocksize, 0, dest->root_key.objectid, 19232ff7e61eSJeff Mahoney level - 1, 0); 19245d4f98a2SYan Zheng BUG_ON(ret); 19255d4f98a2SYan Zheng 192684f7d8e6SJosef Bacik ret = btrfs_free_extent(trans, src, new_bytenr, blocksize, 19275d4f98a2SYan Zheng path->nodes[level]->start, 1928b06c4bf5SFilipe Manana src->root_key.objectid, level - 1, 0); 19295d4f98a2SYan Zheng BUG_ON(ret); 19305d4f98a2SYan Zheng 193184f7d8e6SJosef Bacik ret = btrfs_free_extent(trans, dest, old_bytenr, blocksize, 19325d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 1933b06c4bf5SFilipe Manana 0); 19345d4f98a2SYan Zheng BUG_ON(ret); 19355d4f98a2SYan Zheng 19365d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 19375d4f98a2SYan Zheng 19385d4f98a2SYan Zheng ret = level; 19395d4f98a2SYan Zheng break; 19405d4f98a2SYan Zheng } 19415d4f98a2SYan Zheng btrfs_tree_unlock(parent); 19425d4f98a2SYan Zheng free_extent_buffer(parent); 19435d4f98a2SYan Zheng return ret; 19445d4f98a2SYan Zheng } 19455d4f98a2SYan Zheng 19465d4f98a2SYan Zheng /* 19475d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 19485d4f98a2SYan Zheng */ 19495d4f98a2SYan Zheng static noinline_for_stack 19505d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 19515d4f98a2SYan Zheng int *level) 19525d4f98a2SYan Zheng { 19535d4f98a2SYan Zheng struct extent_buffer *eb; 19545d4f98a2SYan Zheng int i; 19555d4f98a2SYan Zheng u64 last_snapshot; 19565d4f98a2SYan Zheng u32 nritems; 19575d4f98a2SYan Zheng 19585d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19595d4f98a2SYan Zheng 19605d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 19615d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19625d4f98a2SYan Zheng path->nodes[i] = NULL; 19635d4f98a2SYan Zheng } 19645d4f98a2SYan Zheng 19655d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 19665d4f98a2SYan Zheng eb = path->nodes[i]; 19675d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 19685d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 19695d4f98a2SYan Zheng path->slots[i]++; 19705d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 19715d4f98a2SYan Zheng last_snapshot) 19725d4f98a2SYan Zheng continue; 19735d4f98a2SYan Zheng 19745d4f98a2SYan Zheng *level = i; 19755d4f98a2SYan Zheng return 0; 19765d4f98a2SYan Zheng } 19775d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19785d4f98a2SYan Zheng path->nodes[i] = NULL; 19795d4f98a2SYan Zheng } 19805d4f98a2SYan Zheng return 1; 19815d4f98a2SYan Zheng } 19825d4f98a2SYan Zheng 19835d4f98a2SYan Zheng /* 19845d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 19855d4f98a2SYan Zheng */ 19865d4f98a2SYan Zheng static noinline_for_stack 19875d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 19885d4f98a2SYan Zheng int *level) 19895d4f98a2SYan Zheng { 19902ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 19915d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 19925d4f98a2SYan Zheng int i; 19935d4f98a2SYan Zheng u64 bytenr; 19945d4f98a2SYan Zheng u64 ptr_gen = 0; 19955d4f98a2SYan Zheng u64 last_snapshot; 19965d4f98a2SYan Zheng u32 nritems; 19975d4f98a2SYan Zheng 19985d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19995d4f98a2SYan Zheng 20005d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 2001581c1760SQu Wenruo struct btrfs_key first_key; 2002581c1760SQu Wenruo 20035d4f98a2SYan Zheng eb = path->nodes[i]; 20045d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 20055d4f98a2SYan Zheng while (path->slots[i] < nritems) { 20065d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 20075d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 20085d4f98a2SYan Zheng break; 20095d4f98a2SYan Zheng path->slots[i]++; 20105d4f98a2SYan Zheng } 20115d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 20125d4f98a2SYan Zheng if (i == *level) 20135d4f98a2SYan Zheng break; 20145d4f98a2SYan Zheng *level = i + 1; 20155d4f98a2SYan Zheng return 0; 20165d4f98a2SYan Zheng } 20175d4f98a2SYan Zheng if (i == 1) { 20185d4f98a2SYan Zheng *level = i; 20195d4f98a2SYan Zheng return 0; 20205d4f98a2SYan Zheng } 20215d4f98a2SYan Zheng 20225d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2023581c1760SQu Wenruo btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); 2024581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1, 2025581c1760SQu Wenruo &first_key); 202664c043deSLiu Bo if (IS_ERR(eb)) { 202764c043deSLiu Bo return PTR_ERR(eb); 202864c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2029416bc658SJosef Bacik free_extent_buffer(eb); 2030416bc658SJosef Bacik return -EIO; 2031416bc658SJosef Bacik } 20325d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 20335d4f98a2SYan Zheng path->nodes[i - 1] = eb; 20345d4f98a2SYan Zheng path->slots[i - 1] = 0; 20355d4f98a2SYan Zheng } 20365d4f98a2SYan Zheng return 1; 20375d4f98a2SYan Zheng } 20385d4f98a2SYan Zheng 20395d4f98a2SYan Zheng /* 20405d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 20415d4f98a2SYan Zheng * [min_key, max_key) 20425d4f98a2SYan Zheng */ 20435d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 20445d4f98a2SYan Zheng struct btrfs_key *min_key, 20455d4f98a2SYan Zheng struct btrfs_key *max_key) 20465d4f98a2SYan Zheng { 20470b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 20485d4f98a2SYan Zheng struct inode *inode = NULL; 20495d4f98a2SYan Zheng u64 objectid; 20505d4f98a2SYan Zheng u64 start, end; 205133345d01SLi Zefan u64 ino; 20525d4f98a2SYan Zheng 20535d4f98a2SYan Zheng objectid = min_key->objectid; 20545d4f98a2SYan Zheng while (1) { 20555d4f98a2SYan Zheng cond_resched(); 20565d4f98a2SYan Zheng iput(inode); 20575d4f98a2SYan Zheng 20585d4f98a2SYan Zheng if (objectid > max_key->objectid) 20595d4f98a2SYan Zheng break; 20605d4f98a2SYan Zheng 20615d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 20625d4f98a2SYan Zheng if (!inode) 20635d4f98a2SYan Zheng break; 20644a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 20655d4f98a2SYan Zheng 206633345d01SLi Zefan if (ino > max_key->objectid) { 20675d4f98a2SYan Zheng iput(inode); 20685d4f98a2SYan Zheng break; 20695d4f98a2SYan Zheng } 20705d4f98a2SYan Zheng 207133345d01SLi Zefan objectid = ino + 1; 20725d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 20735d4f98a2SYan Zheng continue; 20745d4f98a2SYan Zheng 207533345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 20765d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 20775d4f98a2SYan Zheng continue; 20785d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 20795d4f98a2SYan Zheng start = 0; 20805d4f98a2SYan Zheng else { 20815d4f98a2SYan Zheng start = min_key->offset; 20820b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 20835d4f98a2SYan Zheng } 20845d4f98a2SYan Zheng } else { 20855d4f98a2SYan Zheng start = 0; 20865d4f98a2SYan Zheng } 20875d4f98a2SYan Zheng 208833345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 20895d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 20905d4f98a2SYan Zheng continue; 20915d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 20925d4f98a2SYan Zheng end = (u64)-1; 20935d4f98a2SYan Zheng } else { 20945d4f98a2SYan Zheng if (max_key->offset == 0) 20955d4f98a2SYan Zheng continue; 20965d4f98a2SYan Zheng end = max_key->offset; 20970b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 20985d4f98a2SYan Zheng end--; 20995d4f98a2SYan Zheng } 21005d4f98a2SYan Zheng } else { 21015d4f98a2SYan Zheng end = (u64)-1; 21025d4f98a2SYan Zheng } 21035d4f98a2SYan Zheng 21045d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2105d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 2106dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 2107d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 21085d4f98a2SYan Zheng } 21095d4f98a2SYan Zheng return 0; 21105d4f98a2SYan Zheng } 21115d4f98a2SYan Zheng 21125d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 21135d4f98a2SYan Zheng struct btrfs_key *key) 21145d4f98a2SYan Zheng 21155d4f98a2SYan Zheng { 21165d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 21175d4f98a2SYan Zheng if (!path->nodes[level]) 21185d4f98a2SYan Zheng break; 21195d4f98a2SYan Zheng if (path->slots[level] + 1 < 21205d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 21215d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 21225d4f98a2SYan Zheng path->slots[level] + 1); 21235d4f98a2SYan Zheng return 0; 21245d4f98a2SYan Zheng } 21255d4f98a2SYan Zheng level++; 21265d4f98a2SYan Zheng } 21275d4f98a2SYan Zheng return 1; 21285d4f98a2SYan Zheng } 21295d4f98a2SYan Zheng 21305d4f98a2SYan Zheng /* 2131d2311e69SQu Wenruo * Insert current subvolume into reloc_control::dirty_subvol_roots 2132d2311e69SQu Wenruo */ 2133d2311e69SQu Wenruo static void insert_dirty_subvol(struct btrfs_trans_handle *trans, 2134d2311e69SQu Wenruo struct reloc_control *rc, 2135d2311e69SQu Wenruo struct btrfs_root *root) 2136d2311e69SQu Wenruo { 2137d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2138d2311e69SQu Wenruo struct btrfs_root_item *reloc_root_item; 2139d2311e69SQu Wenruo 2140d2311e69SQu Wenruo /* @root must be a subvolume tree root with a valid reloc tree */ 2141d2311e69SQu Wenruo ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 2142d2311e69SQu Wenruo ASSERT(reloc_root); 2143d2311e69SQu Wenruo 2144d2311e69SQu Wenruo reloc_root_item = &reloc_root->root_item; 2145d2311e69SQu Wenruo memset(&reloc_root_item->drop_progress, 0, 2146d2311e69SQu Wenruo sizeof(reloc_root_item->drop_progress)); 2147d2311e69SQu Wenruo reloc_root_item->drop_level = 0; 2148d2311e69SQu Wenruo btrfs_set_root_refs(reloc_root_item, 0); 2149d2311e69SQu Wenruo btrfs_update_reloc_root(trans, root); 2150d2311e69SQu Wenruo 2151d2311e69SQu Wenruo if (list_empty(&root->reloc_dirty_list)) { 2152d2311e69SQu Wenruo btrfs_grab_fs_root(root); 2153d2311e69SQu Wenruo list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); 2154d2311e69SQu Wenruo } 2155d2311e69SQu Wenruo } 2156d2311e69SQu Wenruo 2157d2311e69SQu Wenruo static int clean_dirty_subvols(struct reloc_control *rc) 2158d2311e69SQu Wenruo { 2159d2311e69SQu Wenruo struct btrfs_root *root; 2160d2311e69SQu Wenruo struct btrfs_root *next; 2161d2311e69SQu Wenruo int ret = 0; 2162d2311e69SQu Wenruo 2163d2311e69SQu Wenruo list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, 2164d2311e69SQu Wenruo reloc_dirty_list) { 2165d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2166d2311e69SQu Wenruo 2167d2311e69SQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 2168d2311e69SQu Wenruo list_del_init(&root->reloc_dirty_list); 2169d2311e69SQu Wenruo root->reloc_root = NULL; 2170d2311e69SQu Wenruo if (reloc_root) { 2171d2311e69SQu Wenruo int ret2; 2172d2311e69SQu Wenruo 2173d2311e69SQu Wenruo ret2 = btrfs_drop_snapshot(reloc_root, NULL, 0, 1); 2174d2311e69SQu Wenruo if (ret2 < 0 && !ret) 2175d2311e69SQu Wenruo ret = ret2; 2176d2311e69SQu Wenruo } 2177d2311e69SQu Wenruo btrfs_put_fs_root(root); 2178d2311e69SQu Wenruo } 2179d2311e69SQu Wenruo return ret; 2180d2311e69SQu Wenruo } 2181d2311e69SQu Wenruo 2182d2311e69SQu Wenruo /* 21835d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 21845d4f98a2SYan Zheng * fs tree. 21855d4f98a2SYan Zheng */ 21865d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 21875d4f98a2SYan Zheng struct btrfs_root *root) 21885d4f98a2SYan Zheng { 21890b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 21905d4f98a2SYan Zheng struct btrfs_key key; 21915d4f98a2SYan Zheng struct btrfs_key next_key; 21929e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 21935d4f98a2SYan Zheng struct btrfs_root *reloc_root; 21945d4f98a2SYan Zheng struct btrfs_root_item *root_item; 21955d4f98a2SYan Zheng struct btrfs_path *path; 21963fd0a558SYan, Zheng struct extent_buffer *leaf; 21975d4f98a2SYan Zheng int level; 21985d4f98a2SYan Zheng int max_level; 21995d4f98a2SYan Zheng int replaced = 0; 22005d4f98a2SYan Zheng int ret; 22015d4f98a2SYan Zheng int err = 0; 22023fd0a558SYan, Zheng u32 min_reserved; 22035d4f98a2SYan Zheng 22045d4f98a2SYan Zheng path = btrfs_alloc_path(); 22055d4f98a2SYan Zheng if (!path) 22065d4f98a2SYan Zheng return -ENOMEM; 2207e4058b54SDavid Sterba path->reada = READA_FORWARD; 22085d4f98a2SYan Zheng 22095d4f98a2SYan Zheng reloc_root = root->reloc_root; 22105d4f98a2SYan Zheng root_item = &reloc_root->root_item; 22115d4f98a2SYan Zheng 22125d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 22135d4f98a2SYan Zheng level = btrfs_root_level(root_item); 22145d4f98a2SYan Zheng extent_buffer_get(reloc_root->node); 22155d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 22165d4f98a2SYan Zheng path->slots[level] = 0; 22175d4f98a2SYan Zheng } else { 22185d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 22195d4f98a2SYan Zheng 22205d4f98a2SYan Zheng level = root_item->drop_level; 22215d4f98a2SYan Zheng BUG_ON(level == 0); 22225d4f98a2SYan Zheng path->lowest_level = level; 22235d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 222433c66f43SYan Zheng path->lowest_level = 0; 22255d4f98a2SYan Zheng if (ret < 0) { 22265d4f98a2SYan Zheng btrfs_free_path(path); 22275d4f98a2SYan Zheng return ret; 22285d4f98a2SYan Zheng } 22295d4f98a2SYan Zheng 22305d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 22315d4f98a2SYan Zheng path->slots[level]); 22325d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 22335d4f98a2SYan Zheng 22345d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 22355d4f98a2SYan Zheng } 22365d4f98a2SYan Zheng 22370b246afaSJeff Mahoney min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 22385d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 22395d4f98a2SYan Zheng 22405d4f98a2SYan Zheng while (1) { 224108e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 224208e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 22433fd0a558SYan, Zheng if (ret) { 22449e6a0c52SJosef Bacik err = ret; 22459e6a0c52SJosef Bacik goto out; 22463fd0a558SYan, Zheng } 22479e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 22489e6a0c52SJosef Bacik if (IS_ERR(trans)) { 22499e6a0c52SJosef Bacik err = PTR_ERR(trans); 22509e6a0c52SJosef Bacik trans = NULL; 22519e6a0c52SJosef Bacik goto out; 22529e6a0c52SJosef Bacik } 22539e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 22543fd0a558SYan, Zheng 22553fd0a558SYan, Zheng replaced = 0; 22565d4f98a2SYan Zheng max_level = level; 22575d4f98a2SYan Zheng 22585d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 22595d4f98a2SYan Zheng if (ret < 0) { 22605d4f98a2SYan Zheng err = ret; 22615d4f98a2SYan Zheng goto out; 22625d4f98a2SYan Zheng } 22635d4f98a2SYan Zheng if (ret > 0) 22645d4f98a2SYan Zheng break; 22655d4f98a2SYan Zheng 22665d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 22675d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 22685d4f98a2SYan Zheng ret = 0; 22695d4f98a2SYan Zheng } else { 22703d0174f7SQu Wenruo ret = replace_path(trans, rc, root, reloc_root, path, 22713fd0a558SYan, Zheng &next_key, level, max_level); 22725d4f98a2SYan Zheng } 22735d4f98a2SYan Zheng if (ret < 0) { 22745d4f98a2SYan Zheng err = ret; 22755d4f98a2SYan Zheng goto out; 22765d4f98a2SYan Zheng } 22775d4f98a2SYan Zheng 22785d4f98a2SYan Zheng if (ret > 0) { 22795d4f98a2SYan Zheng level = ret; 22805d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 22815d4f98a2SYan Zheng path->slots[level]); 22825d4f98a2SYan Zheng replaced = 1; 22835d4f98a2SYan Zheng } 22845d4f98a2SYan Zheng 22855d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 22865d4f98a2SYan Zheng if (ret > 0) 22875d4f98a2SYan Zheng break; 22885d4f98a2SYan Zheng 22895d4f98a2SYan Zheng BUG_ON(level == 0); 22905d4f98a2SYan Zheng /* 22915d4f98a2SYan Zheng * save the merging progress in the drop_progress. 22925d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 22935d4f98a2SYan Zheng */ 22945d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 22955d4f98a2SYan Zheng path->slots[level]); 22965d4f98a2SYan Zheng root_item->drop_level = level; 22975d4f98a2SYan Zheng 22983a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 22999e6a0c52SJosef Bacik trans = NULL; 23005d4f98a2SYan Zheng 23012ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 23025d4f98a2SYan Zheng 23035d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 23045d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 23055d4f98a2SYan Zheng } 23065d4f98a2SYan Zheng 23075d4f98a2SYan Zheng /* 23085d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 23095d4f98a2SYan Zheng * relocated and the block is tree root. 23105d4f98a2SYan Zheng */ 23115d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 23125d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 23135d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 23145d4f98a2SYan Zheng free_extent_buffer(leaf); 23155d4f98a2SYan Zheng if (ret < 0) 23165d4f98a2SYan Zheng err = ret; 23175d4f98a2SYan Zheng out: 23185d4f98a2SYan Zheng btrfs_free_path(path); 23195d4f98a2SYan Zheng 2320d2311e69SQu Wenruo if (err == 0) 2321d2311e69SQu Wenruo insert_dirty_subvol(trans, rc, root); 23225d4f98a2SYan Zheng 23239e6a0c52SJosef Bacik if (trans) 23243a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 23255d4f98a2SYan Zheng 23262ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 23275d4f98a2SYan Zheng 23285d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 23295d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 23305d4f98a2SYan Zheng 23315d4f98a2SYan Zheng return err; 23325d4f98a2SYan Zheng } 23335d4f98a2SYan Zheng 23343fd0a558SYan, Zheng static noinline_for_stack 23353fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 23365d4f98a2SYan Zheng { 23373fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 23380b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 23393fd0a558SYan, Zheng struct btrfs_root *reloc_root; 23405d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 23413fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 23423fd0a558SYan, Zheng u64 num_bytes = 0; 23433fd0a558SYan, Zheng int ret; 23443fd0a558SYan, Zheng 23450b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 23460b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 23473fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 23480b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 23497585717fSChris Mason 23503fd0a558SYan, Zheng again: 23513fd0a558SYan, Zheng if (!err) { 23523fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 235308e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 235408e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 23553fd0a558SYan, Zheng if (ret) 23563fd0a558SYan, Zheng err = ret; 23573fd0a558SYan, Zheng } 23583fd0a558SYan, Zheng 23597a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 23603612b495STsutomu Itoh if (IS_ERR(trans)) { 23613612b495STsutomu Itoh if (!err) 23622ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 23632ff7e61eSJeff Mahoney num_bytes); 23643612b495STsutomu Itoh return PTR_ERR(trans); 23653612b495STsutomu Itoh } 23663fd0a558SYan, Zheng 23673fd0a558SYan, Zheng if (!err) { 23683fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 23693a45bb20SJeff Mahoney btrfs_end_transaction(trans); 23702ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 23712ff7e61eSJeff Mahoney num_bytes); 23723fd0a558SYan, Zheng goto again; 23733fd0a558SYan, Zheng } 23743fd0a558SYan, Zheng } 23753fd0a558SYan, Zheng 23763fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 23773fd0a558SYan, Zheng 23783fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 23793fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 23803fd0a558SYan, Zheng struct btrfs_root, root_list); 23813fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 23823fd0a558SYan, Zheng 23830b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 23843fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 23853fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 23863fd0a558SYan, Zheng 23873fd0a558SYan, Zheng /* 23883fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 23893fd0a558SYan, Zheng * knows it should resumes merging 23903fd0a558SYan, Zheng */ 23913fd0a558SYan, Zheng if (!err) 23923fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 23933fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 23943fd0a558SYan, Zheng 23953fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 23963fd0a558SYan, Zheng } 23973fd0a558SYan, Zheng 23983fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 23993fd0a558SYan, Zheng 24003fd0a558SYan, Zheng if (!err) 24013a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 24023fd0a558SYan, Zheng else 24033a45bb20SJeff Mahoney btrfs_end_transaction(trans); 24043fd0a558SYan, Zheng return err; 24053fd0a558SYan, Zheng } 24063fd0a558SYan, Zheng 24073fd0a558SYan, Zheng static noinline_for_stack 2408aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2409aca1bba6SLiu Bo { 2410aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2411aca1bba6SLiu Bo 2412aca1bba6SLiu Bo while (!list_empty(list)) { 2413aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2414aca1bba6SLiu Bo root_list); 2415bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 24166bdf131fSJosef Bacik free_extent_buffer(reloc_root->node); 24176bdf131fSJosef Bacik free_extent_buffer(reloc_root->commit_root); 24186bdf131fSJosef Bacik reloc_root->node = NULL; 24196bdf131fSJosef Bacik reloc_root->commit_root = NULL; 2420aca1bba6SLiu Bo } 2421aca1bba6SLiu Bo } 2422aca1bba6SLiu Bo 2423aca1bba6SLiu Bo static noinline_for_stack 242494404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 24253fd0a558SYan, Zheng { 24260b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 24275d4f98a2SYan Zheng struct btrfs_root *root; 24285d4f98a2SYan Zheng struct btrfs_root *reloc_root; 24293fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 24303fd0a558SYan, Zheng int found = 0; 2431aca1bba6SLiu Bo int ret = 0; 24323fd0a558SYan, Zheng again: 24333fd0a558SYan, Zheng root = rc->extent_root; 24347585717fSChris Mason 24357585717fSChris Mason /* 24367585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 24377585717fSChris Mason * we have to make sure nobody is in the middle of 24387585717fSChris Mason * adding their roots to the list while we are 24397585717fSChris Mason * doing this splice 24407585717fSChris Mason */ 24410b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 24423fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 24430b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 24445d4f98a2SYan Zheng 24453fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 24463fd0a558SYan, Zheng found = 1; 24473fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 24483fd0a558SYan, Zheng struct btrfs_root, root_list); 24495d4f98a2SYan Zheng 24505d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 24510b246afaSJeff Mahoney root = read_fs_root(fs_info, 24525d4f98a2SYan Zheng reloc_root->root_key.offset); 24535d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 24545d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 24555d4f98a2SYan Zheng 24563fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 2457b37b39cdSJosef Bacik if (ret) { 245825e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 245925e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 246025e293c2SWang Shilong &reloc_roots); 2461aca1bba6SLiu Bo goto out; 2462b37b39cdSJosef Bacik } 24633fd0a558SYan, Zheng } else { 24643fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 24653fd0a558SYan, Zheng } 24665d4f98a2SYan Zheng } 24675d4f98a2SYan Zheng 24683fd0a558SYan, Zheng if (found) { 24693fd0a558SYan, Zheng found = 0; 24703fd0a558SYan, Zheng goto again; 24715d4f98a2SYan Zheng } 2472aca1bba6SLiu Bo out: 2473aca1bba6SLiu Bo if (ret) { 24740b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2475aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2476aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2477467bb1d2SWang Shilong 2478467bb1d2SWang Shilong /* new reloc root may be added */ 24790b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2480467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 24810b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2482467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2483467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2484aca1bba6SLiu Bo } 2485aca1bba6SLiu Bo 24865d4f98a2SYan Zheng BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 24875d4f98a2SYan Zheng } 24885d4f98a2SYan Zheng 24895d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 24905d4f98a2SYan Zheng { 24915d4f98a2SYan Zheng struct tree_block *block; 24925d4f98a2SYan Zheng struct rb_node *rb_node; 24935d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 24945d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 24955d4f98a2SYan Zheng rb_erase(rb_node, blocks); 24965d4f98a2SYan Zheng kfree(block); 24975d4f98a2SYan Zheng } 24985d4f98a2SYan Zheng } 24995d4f98a2SYan Zheng 25005d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 25015d4f98a2SYan Zheng struct btrfs_root *reloc_root) 25025d4f98a2SYan Zheng { 25030b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 25045d4f98a2SYan Zheng struct btrfs_root *root; 25055d4f98a2SYan Zheng 25065d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 25075d4f98a2SYan Zheng return 0; 25085d4f98a2SYan Zheng 25090b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 25105d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 25115d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 25125d4f98a2SYan Zheng 25135d4f98a2SYan Zheng return btrfs_record_root_in_trans(trans, root); 25145d4f98a2SYan Zheng } 25155d4f98a2SYan Zheng 25163fd0a558SYan, Zheng static noinline_for_stack 25173fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 25183fd0a558SYan, Zheng struct reloc_control *rc, 25195d4f98a2SYan Zheng struct backref_node *node, 2520dc4103f9SWang Shilong struct backref_edge *edges[]) 25215d4f98a2SYan Zheng { 25225d4f98a2SYan Zheng struct backref_node *next; 25235d4f98a2SYan Zheng struct btrfs_root *root; 25243fd0a558SYan, Zheng int index = 0; 25253fd0a558SYan, Zheng 25265d4f98a2SYan Zheng next = node; 25275d4f98a2SYan Zheng while (1) { 25285d4f98a2SYan Zheng cond_resched(); 25295d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 25305d4f98a2SYan Zheng root = next->root; 25313fd0a558SYan, Zheng BUG_ON(!root); 253227cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 25335d4f98a2SYan Zheng 25345d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 25355d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 25365d4f98a2SYan Zheng break; 25375d4f98a2SYan Zheng } 25385d4f98a2SYan Zheng 25395d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 25403fd0a558SYan, Zheng root = root->reloc_root; 25413fd0a558SYan, Zheng 25423fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 25433fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 25443fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 25453fd0a558SYan, Zheng next->new_bytenr = root->node->start; 25463fd0a558SYan, Zheng next->root = root; 25473fd0a558SYan, Zheng list_add_tail(&next->list, 25483fd0a558SYan, Zheng &rc->backref_cache.changed); 25493fd0a558SYan, Zheng __mark_block_processed(rc, next); 25505d4f98a2SYan Zheng break; 25515d4f98a2SYan Zheng } 25525d4f98a2SYan Zheng 25533fd0a558SYan, Zheng WARN_ON(1); 25545d4f98a2SYan Zheng root = NULL; 25555d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 25565d4f98a2SYan Zheng if (!next || next->level <= node->level) 25575d4f98a2SYan Zheng break; 25585d4f98a2SYan Zheng } 25593fd0a558SYan, Zheng if (!root) 25603fd0a558SYan, Zheng return NULL; 25615d4f98a2SYan Zheng 25623fd0a558SYan, Zheng next = node; 25633fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 25643fd0a558SYan, Zheng while (1) { 25653fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 25663fd0a558SYan, Zheng if (--index < 0) 25673fd0a558SYan, Zheng break; 25683fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 25693fd0a558SYan, Zheng } 25705d4f98a2SYan Zheng return root; 25715d4f98a2SYan Zheng } 25725d4f98a2SYan Zheng 25733fd0a558SYan, Zheng /* 25743fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 25753fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 25763fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 25773fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 25783fd0a558SYan, Zheng */ 25795d4f98a2SYan Zheng static noinline_for_stack 2580147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 25815d4f98a2SYan Zheng { 25823fd0a558SYan, Zheng struct backref_node *next; 25833fd0a558SYan, Zheng struct btrfs_root *root; 25843fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 25855d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25863fd0a558SYan, Zheng int index = 0; 25873fd0a558SYan, Zheng 25883fd0a558SYan, Zheng next = node; 25893fd0a558SYan, Zheng while (1) { 25903fd0a558SYan, Zheng cond_resched(); 25913fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 25923fd0a558SYan, Zheng root = next->root; 25933fd0a558SYan, Zheng BUG_ON(!root); 25943fd0a558SYan, Zheng 259525985edcSLucas De Marchi /* no other choice for non-references counted tree */ 259627cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 25973fd0a558SYan, Zheng return root; 25983fd0a558SYan, Zheng 25993fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 26003fd0a558SYan, Zheng fs_root = root; 26013fd0a558SYan, Zheng 26023fd0a558SYan, Zheng if (next != node) 26033fd0a558SYan, Zheng return NULL; 26043fd0a558SYan, Zheng 26053fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 26063fd0a558SYan, Zheng if (!next || next->level <= node->level) 26073fd0a558SYan, Zheng break; 26083fd0a558SYan, Zheng } 26093fd0a558SYan, Zheng 26103fd0a558SYan, Zheng if (!fs_root) 26113fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 26123fd0a558SYan, Zheng return fs_root; 26135d4f98a2SYan Zheng } 26145d4f98a2SYan Zheng 26155d4f98a2SYan Zheng static noinline_for_stack 26163fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 26173fd0a558SYan, Zheng struct backref_node *node, int reserve) 26185d4f98a2SYan Zheng { 26190b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 26203fd0a558SYan, Zheng struct backref_node *next = node; 26213fd0a558SYan, Zheng struct backref_edge *edge; 26223fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 26233fd0a558SYan, Zheng u64 num_bytes = 0; 26243fd0a558SYan, Zheng int index = 0; 26255d4f98a2SYan Zheng 26263fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 26273fd0a558SYan, Zheng 26283fd0a558SYan, Zheng while (next) { 26293fd0a558SYan, Zheng cond_resched(); 26305d4f98a2SYan Zheng while (1) { 26313fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 26325d4f98a2SYan Zheng break; 26335d4f98a2SYan Zheng 26340b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 26353fd0a558SYan, Zheng 26363fd0a558SYan, Zheng if (list_empty(&next->upper)) 26373fd0a558SYan, Zheng break; 26383fd0a558SYan, Zheng 26393fd0a558SYan, Zheng edge = list_entry(next->upper.next, 26403fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 26413fd0a558SYan, Zheng edges[index++] = edge; 26423fd0a558SYan, Zheng next = edge->node[UPPER]; 26435d4f98a2SYan Zheng } 26443fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 26453fd0a558SYan, Zheng } 26463fd0a558SYan, Zheng return num_bytes; 26473fd0a558SYan, Zheng } 26483fd0a558SYan, Zheng 26493fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 26503fd0a558SYan, Zheng struct reloc_control *rc, 26513fd0a558SYan, Zheng struct backref_node *node) 26523fd0a558SYan, Zheng { 26533fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2654da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 26553fd0a558SYan, Zheng u64 num_bytes; 26563fd0a558SYan, Zheng int ret; 26570647bf56SWang Shilong u64 tmp; 26583fd0a558SYan, Zheng 26593fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 26603fd0a558SYan, Zheng 26613fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 26620647bf56SWang Shilong rc->reserved_bytes += num_bytes; 26638ca17f0fSJosef Bacik 26648ca17f0fSJosef Bacik /* 26658ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 26668ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 26678ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 26688ca17f0fSJosef Bacik */ 26690647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 26708ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 26713fd0a558SYan, Zheng if (ret) { 2672da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 26730647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 26740647bf56SWang Shilong tmp <<= 1; 26750647bf56SWang Shilong /* 26760647bf56SWang Shilong * only one thread can access block_rsv at this point, 26770647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 26780647bf56SWang Shilong * we expand more reservation size here to allow enough 267952042d8eSAndrea Gelmini * space for relocation and we will return earlier in 26800647bf56SWang Shilong * enospc case. 26810647bf56SWang Shilong */ 2682da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 26830647bf56SWang Shilong RELOCATION_RESERVED_NODES; 26848ca17f0fSJosef Bacik return -EAGAIN; 26853fd0a558SYan, Zheng } 26863fd0a558SYan, Zheng 26873fd0a558SYan, Zheng return 0; 26883fd0a558SYan, Zheng } 26893fd0a558SYan, Zheng 26905d4f98a2SYan Zheng /* 26915d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 26925d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 26935d4f98a2SYan Zheng * 26945d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 26955d4f98a2SYan Zheng * in that case this function just updates pointers. 26965d4f98a2SYan Zheng */ 26975d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 26983fd0a558SYan, Zheng struct reloc_control *rc, 26995d4f98a2SYan Zheng struct backref_node *node, 27005d4f98a2SYan Zheng struct btrfs_key *key, 27015d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 27025d4f98a2SYan Zheng { 27032ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 27045d4f98a2SYan Zheng struct backref_node *upper; 27055d4f98a2SYan Zheng struct backref_edge *edge; 27065d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 27075d4f98a2SYan Zheng struct btrfs_root *root; 27085d4f98a2SYan Zheng struct extent_buffer *eb; 27095d4f98a2SYan Zheng u32 blocksize; 27105d4f98a2SYan Zheng u64 bytenr; 27115d4f98a2SYan Zheng u64 generation; 27125d4f98a2SYan Zheng int slot; 27135d4f98a2SYan Zheng int ret; 27145d4f98a2SYan Zheng int err = 0; 27155d4f98a2SYan Zheng 27165d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 27175d4f98a2SYan Zheng 27185d4f98a2SYan Zheng path->lowest_level = node->level + 1; 27193fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 27205d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 2721581c1760SQu Wenruo struct btrfs_key first_key; 2722581c1760SQu Wenruo 27235d4f98a2SYan Zheng cond_resched(); 27245d4f98a2SYan Zheng 27255d4f98a2SYan Zheng upper = edge->node[UPPER]; 2726dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 27273fd0a558SYan, Zheng BUG_ON(!root); 27285d4f98a2SYan Zheng 27293fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 27303fd0a558SYan, Zheng if (!lowest) { 27313fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 27323fd0a558SYan, Zheng upper->level, &slot); 27333fd0a558SYan, Zheng BUG_ON(ret); 27343fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 27353fd0a558SYan, Zheng if (node->eb->start == bytenr) 27363fd0a558SYan, Zheng goto next; 27373fd0a558SYan, Zheng } 27385d4f98a2SYan Zheng drop_node_buffer(upper); 27393fd0a558SYan, Zheng } 27405d4f98a2SYan Zheng 27415d4f98a2SYan Zheng if (!upper->eb) { 27425d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 27433561b9dbSLiu Bo if (ret) { 27443561b9dbSLiu Bo if (ret < 0) 27455d4f98a2SYan Zheng err = ret; 27463561b9dbSLiu Bo else 27473561b9dbSLiu Bo err = -ENOENT; 27483561b9dbSLiu Bo 27493561b9dbSLiu Bo btrfs_release_path(path); 27505d4f98a2SYan Zheng break; 27515d4f98a2SYan Zheng } 27525d4f98a2SYan Zheng 27533fd0a558SYan, Zheng if (!upper->eb) { 27543fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 27553fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 27563fd0a558SYan, Zheng } else { 27573fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 27583fd0a558SYan, Zheng } 27593fd0a558SYan, Zheng 27603fd0a558SYan, Zheng upper->locked = 1; 27613fd0a558SYan, Zheng path->locks[upper->level] = 0; 27623fd0a558SYan, Zheng 27635d4f98a2SYan Zheng slot = path->slots[upper->level]; 2764b3b4aa74SDavid Sterba btrfs_release_path(path); 27655d4f98a2SYan Zheng } else { 27665d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 27675d4f98a2SYan Zheng &slot); 27685d4f98a2SYan Zheng BUG_ON(ret); 27695d4f98a2SYan Zheng } 27705d4f98a2SYan Zheng 27715d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 27723fd0a558SYan, Zheng if (lowest) { 27734547f4d8SLiu Bo if (bytenr != node->bytenr) { 27744547f4d8SLiu Bo btrfs_err(root->fs_info, 27754547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 27764547f4d8SLiu Bo bytenr, node->bytenr, slot, 27774547f4d8SLiu Bo upper->eb->start); 27784547f4d8SLiu Bo err = -EIO; 27794547f4d8SLiu Bo goto next; 27804547f4d8SLiu Bo } 27815d4f98a2SYan Zheng } else { 27823fd0a558SYan, Zheng if (node->eb->start == bytenr) 27833fd0a558SYan, Zheng goto next; 27845d4f98a2SYan Zheng } 27855d4f98a2SYan Zheng 2786da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 27875d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 2788581c1760SQu Wenruo btrfs_node_key_to_cpu(upper->eb, &first_key, slot); 2789581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, generation, 2790581c1760SQu Wenruo upper->level - 1, &first_key); 279164c043deSLiu Bo if (IS_ERR(eb)) { 279264c043deSLiu Bo err = PTR_ERR(eb); 279364c043deSLiu Bo goto next; 279464c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2795416bc658SJosef Bacik free_extent_buffer(eb); 279697d9a8a4STsutomu Itoh err = -EIO; 279797d9a8a4STsutomu Itoh goto next; 279897d9a8a4STsutomu Itoh } 27995d4f98a2SYan Zheng btrfs_tree_lock(eb); 28005d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 28015d4f98a2SYan Zheng 28025d4f98a2SYan Zheng if (!node->eb) { 28035d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 28045d4f98a2SYan Zheng slot, &eb); 28053fd0a558SYan, Zheng btrfs_tree_unlock(eb); 28063fd0a558SYan, Zheng free_extent_buffer(eb); 28075d4f98a2SYan Zheng if (ret < 0) { 28085d4f98a2SYan Zheng err = ret; 28093fd0a558SYan, Zheng goto next; 28105d4f98a2SYan Zheng } 28113fd0a558SYan, Zheng BUG_ON(node->eb != eb); 28125d4f98a2SYan Zheng } else { 28135d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 28145d4f98a2SYan Zheng node->eb->start); 28155d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 28165d4f98a2SYan Zheng trans->transid); 28175d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 28185d4f98a2SYan Zheng 281984f7d8e6SJosef Bacik ret = btrfs_inc_extent_ref(trans, root, 28205d4f98a2SYan Zheng node->eb->start, blocksize, 28215d4f98a2SYan Zheng upper->eb->start, 28225d4f98a2SYan Zheng btrfs_header_owner(upper->eb), 2823b06c4bf5SFilipe Manana node->level, 0); 28245d4f98a2SYan Zheng BUG_ON(ret); 28255d4f98a2SYan Zheng 28265d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 28275d4f98a2SYan Zheng BUG_ON(ret); 28285d4f98a2SYan Zheng } 28293fd0a558SYan, Zheng next: 28303fd0a558SYan, Zheng if (!upper->pending) 28313fd0a558SYan, Zheng drop_node_buffer(upper); 28323fd0a558SYan, Zheng else 28333fd0a558SYan, Zheng unlock_node_buffer(upper); 28343fd0a558SYan, Zheng if (err) 28353fd0a558SYan, Zheng break; 28365d4f98a2SYan Zheng } 28373fd0a558SYan, Zheng 28383fd0a558SYan, Zheng if (!err && node->pending) { 28393fd0a558SYan, Zheng drop_node_buffer(node); 28403fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 28413fd0a558SYan, Zheng node->pending = 0; 28425d4f98a2SYan Zheng } 28433fd0a558SYan, Zheng 28445d4f98a2SYan Zheng path->lowest_level = 0; 28453fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 28465d4f98a2SYan Zheng return err; 28475d4f98a2SYan Zheng } 28485d4f98a2SYan Zheng 28495d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 28503fd0a558SYan, Zheng struct reloc_control *rc, 28515d4f98a2SYan Zheng struct backref_node *node, 28525d4f98a2SYan Zheng struct btrfs_path *path) 28535d4f98a2SYan Zheng { 28545d4f98a2SYan Zheng struct btrfs_key key; 28555d4f98a2SYan Zheng 28565d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 28573fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 28585d4f98a2SYan Zheng } 28595d4f98a2SYan Zheng 28605d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 28613fd0a558SYan, Zheng struct reloc_control *rc, 28623fd0a558SYan, Zheng struct btrfs_path *path, int err) 28635d4f98a2SYan Zheng { 28643fd0a558SYan, Zheng LIST_HEAD(list); 28653fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 28665d4f98a2SYan Zheng struct backref_node *node; 28675d4f98a2SYan Zheng int level; 28685d4f98a2SYan Zheng int ret; 28695d4f98a2SYan Zheng 28705d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 28715d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 28725d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 28733fd0a558SYan, Zheng struct backref_node, list); 28743fd0a558SYan, Zheng list_move_tail(&node->list, &list); 28753fd0a558SYan, Zheng BUG_ON(!node->pending); 28765d4f98a2SYan Zheng 28773fd0a558SYan, Zheng if (!err) { 28783fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 28795d4f98a2SYan Zheng if (ret < 0) 28805d4f98a2SYan Zheng err = ret; 28815d4f98a2SYan Zheng } 28825d4f98a2SYan Zheng } 28833fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 28843fd0a558SYan, Zheng } 28855d4f98a2SYan Zheng return err; 28865d4f98a2SYan Zheng } 28875d4f98a2SYan Zheng 28885d4f98a2SYan Zheng static void mark_block_processed(struct reloc_control *rc, 28893fd0a558SYan, Zheng u64 bytenr, u32 blocksize) 28903fd0a558SYan, Zheng { 28913fd0a558SYan, Zheng set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, 2892ceeb0ae7SDavid Sterba EXTENT_DIRTY); 28933fd0a558SYan, Zheng } 28943fd0a558SYan, Zheng 28953fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 28965d4f98a2SYan Zheng struct backref_node *node) 28975d4f98a2SYan Zheng { 28985d4f98a2SYan Zheng u32 blocksize; 28995d4f98a2SYan Zheng if (node->level == 0 || 29005d4f98a2SYan Zheng in_block_group(node->bytenr, rc->block_group)) { 2901da17066cSJeff Mahoney blocksize = rc->extent_root->fs_info->nodesize; 29023fd0a558SYan, Zheng mark_block_processed(rc, node->bytenr, blocksize); 29035d4f98a2SYan Zheng } 29045d4f98a2SYan Zheng node->processed = 1; 29055d4f98a2SYan Zheng } 29065d4f98a2SYan Zheng 29075d4f98a2SYan Zheng /* 29085d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 29095d4f98a2SYan Zheng * as processed. 29105d4f98a2SYan Zheng */ 29115d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 29125d4f98a2SYan Zheng struct backref_node *node) 29135d4f98a2SYan Zheng { 29145d4f98a2SYan Zheng struct backref_node *next = node; 29155d4f98a2SYan Zheng struct backref_edge *edge; 29165d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 29175d4f98a2SYan Zheng int index = 0; 29185d4f98a2SYan Zheng 29195d4f98a2SYan Zheng while (next) { 29205d4f98a2SYan Zheng cond_resched(); 29215d4f98a2SYan Zheng while (1) { 29225d4f98a2SYan Zheng if (next->processed) 29235d4f98a2SYan Zheng break; 29245d4f98a2SYan Zheng 29253fd0a558SYan, Zheng __mark_block_processed(rc, next); 29265d4f98a2SYan Zheng 29275d4f98a2SYan Zheng if (list_empty(&next->upper)) 29285d4f98a2SYan Zheng break; 29295d4f98a2SYan Zheng 29305d4f98a2SYan Zheng edge = list_entry(next->upper.next, 29315d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 29325d4f98a2SYan Zheng edges[index++] = edge; 29335d4f98a2SYan Zheng next = edge->node[UPPER]; 29345d4f98a2SYan Zheng } 29355d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 29365d4f98a2SYan Zheng } 29375d4f98a2SYan Zheng } 29385d4f98a2SYan Zheng 29397476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 29405d4f98a2SYan Zheng { 2941da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 29427476dfdaSDavid Sterba 29435d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 29449655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 29455d4f98a2SYan Zheng return 1; 29465d4f98a2SYan Zheng return 0; 29475d4f98a2SYan Zheng } 29485d4f98a2SYan Zheng 29492ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 29505d4f98a2SYan Zheng struct tree_block *block) 29515d4f98a2SYan Zheng { 29525d4f98a2SYan Zheng struct extent_buffer *eb; 29535d4f98a2SYan Zheng 29545d4f98a2SYan Zheng BUG_ON(block->key_ready); 2955581c1760SQu Wenruo eb = read_tree_block(fs_info, block->bytenr, block->key.offset, 2956581c1760SQu Wenruo block->level, NULL); 295764c043deSLiu Bo if (IS_ERR(eb)) { 295864c043deSLiu Bo return PTR_ERR(eb); 295964c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2960416bc658SJosef Bacik free_extent_buffer(eb); 2961416bc658SJosef Bacik return -EIO; 2962416bc658SJosef Bacik } 29635d4f98a2SYan Zheng if (block->level == 0) 29645d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 29655d4f98a2SYan Zheng else 29665d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 29675d4f98a2SYan Zheng free_extent_buffer(eb); 29685d4f98a2SYan Zheng block->key_ready = 1; 29695d4f98a2SYan Zheng return 0; 29705d4f98a2SYan Zheng } 29715d4f98a2SYan Zheng 29725d4f98a2SYan Zheng /* 29735d4f98a2SYan Zheng * helper function to relocate a tree block 29745d4f98a2SYan Zheng */ 29755d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 29765d4f98a2SYan Zheng struct reloc_control *rc, 29775d4f98a2SYan Zheng struct backref_node *node, 29785d4f98a2SYan Zheng struct btrfs_key *key, 29795d4f98a2SYan Zheng struct btrfs_path *path) 29805d4f98a2SYan Zheng { 29815d4f98a2SYan Zheng struct btrfs_root *root; 29823fd0a558SYan, Zheng int ret = 0; 29835d4f98a2SYan Zheng 29843fd0a558SYan, Zheng if (!node) 29855d4f98a2SYan Zheng return 0; 29863fd0a558SYan, Zheng 29873fd0a558SYan, Zheng BUG_ON(node->processed); 2988147d256eSZhaolei root = select_one_root(node); 29893fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 29903fd0a558SYan, Zheng update_processed_blocks(rc, node); 29913fd0a558SYan, Zheng goto out; 29925d4f98a2SYan Zheng } 29935d4f98a2SYan Zheng 299427cdeb70SMiao Xie if (!root || test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 29953fd0a558SYan, Zheng ret = reserve_metadata_space(trans, rc, node); 29963fd0a558SYan, Zheng if (ret) 29975d4f98a2SYan Zheng goto out; 29985d4f98a2SYan Zheng } 29993fd0a558SYan, Zheng 30003fd0a558SYan, Zheng if (root) { 300127cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 30023fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 30033fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 30043fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 30053fd0a558SYan, Zheng root = root->reloc_root; 30063fd0a558SYan, Zheng node->new_bytenr = root->node->start; 30073fd0a558SYan, Zheng node->root = root; 30083fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 30093fd0a558SYan, Zheng } else { 30105d4f98a2SYan Zheng path->lowest_level = node->level; 30115d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 3012b3b4aa74SDavid Sterba btrfs_release_path(path); 30133fd0a558SYan, Zheng if (ret > 0) 30145d4f98a2SYan Zheng ret = 0; 30153fd0a558SYan, Zheng } 30163fd0a558SYan, Zheng if (!ret) 30173fd0a558SYan, Zheng update_processed_blocks(rc, node); 30183fd0a558SYan, Zheng } else { 30193fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 30203fd0a558SYan, Zheng } 30215d4f98a2SYan Zheng out: 30220647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 30233fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 30245d4f98a2SYan Zheng return ret; 30255d4f98a2SYan Zheng } 30265d4f98a2SYan Zheng 30275d4f98a2SYan Zheng /* 30285d4f98a2SYan Zheng * relocate a list of blocks 30295d4f98a2SYan Zheng */ 30305d4f98a2SYan Zheng static noinline_for_stack 30315d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 30325d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 30335d4f98a2SYan Zheng { 30342ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 30355d4f98a2SYan Zheng struct backref_node *node; 30365d4f98a2SYan Zheng struct btrfs_path *path; 30375d4f98a2SYan Zheng struct tree_block *block; 303898ff7b94SQu Wenruo struct tree_block *next; 30395d4f98a2SYan Zheng int ret; 30405d4f98a2SYan Zheng int err = 0; 30415d4f98a2SYan Zheng 30425d4f98a2SYan Zheng path = btrfs_alloc_path(); 3043e1a12670SLiu Bo if (!path) { 3044e1a12670SLiu Bo err = -ENOMEM; 304534c2b290SDavid Sterba goto out_free_blocks; 3046e1a12670SLiu Bo } 30475d4f98a2SYan Zheng 304898ff7b94SQu Wenruo /* Kick in readahead for tree blocks with missing keys */ 304998ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 30505d4f98a2SYan Zheng if (!block->key_ready) 30512ff7e61eSJeff Mahoney readahead_tree_block(fs_info, block->bytenr); 30525d4f98a2SYan Zheng } 30535d4f98a2SYan Zheng 305498ff7b94SQu Wenruo /* Get first keys */ 305598ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 305634c2b290SDavid Sterba if (!block->key_ready) { 30572ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 305834c2b290SDavid Sterba if (err) 305934c2b290SDavid Sterba goto out_free_path; 306034c2b290SDavid Sterba } 30615d4f98a2SYan Zheng } 30625d4f98a2SYan Zheng 306398ff7b94SQu Wenruo /* Do tree relocation */ 306498ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 30653fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 30665d4f98a2SYan Zheng block->level, block->bytenr); 30675d4f98a2SYan Zheng if (IS_ERR(node)) { 30685d4f98a2SYan Zheng err = PTR_ERR(node); 30695d4f98a2SYan Zheng goto out; 30705d4f98a2SYan Zheng } 30715d4f98a2SYan Zheng 30725d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 30735d4f98a2SYan Zheng path); 30745d4f98a2SYan Zheng if (ret < 0) { 307598ff7b94SQu Wenruo if (ret != -EAGAIN || &block->rb_node == rb_first(blocks)) 30765d4f98a2SYan Zheng err = ret; 30775d4f98a2SYan Zheng goto out; 30785d4f98a2SYan Zheng } 30795d4f98a2SYan Zheng } 30805d4f98a2SYan Zheng out: 30813fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 30825d4f98a2SYan Zheng 308334c2b290SDavid Sterba out_free_path: 30845d4f98a2SYan Zheng btrfs_free_path(path); 308534c2b290SDavid Sterba out_free_blocks: 3086e1a12670SLiu Bo free_block_list(blocks); 30875d4f98a2SYan Zheng return err; 30885d4f98a2SYan Zheng } 30895d4f98a2SYan Zheng 30905d4f98a2SYan Zheng static noinline_for_stack 3091efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3092efa56464SYan, Zheng struct file_extent_cluster *cluster) 3093efa56464SYan, Zheng { 3094efa56464SYan, Zheng u64 alloc_hint = 0; 3095efa56464SYan, Zheng u64 start; 3096efa56464SYan, Zheng u64 end; 3097efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3098efa56464SYan, Zheng u64 num_bytes; 3099efa56464SYan, Zheng int nr = 0; 3100efa56464SYan, Zheng int ret = 0; 3101dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 3102dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 310318513091SWang Xiaoguang u64 cur_offset; 3104364ecf36SQu Wenruo struct extent_changeset *data_reserved = NULL; 3105efa56464SYan, Zheng 3106efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 31075955102cSAl Viro inode_lock(inode); 3108efa56464SYan, Zheng 3109364ecf36SQu Wenruo ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start, 3110dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 3111efa56464SYan, Zheng if (ret) 3112efa56464SYan, Zheng goto out; 3113efa56464SYan, Zheng 311418513091SWang Xiaoguang cur_offset = prealloc_start; 3115efa56464SYan, Zheng while (nr < cluster->nr) { 3116efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3117efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3118efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3119efa56464SYan, Zheng else 3120efa56464SYan, Zheng end = cluster->end - offset; 3121efa56464SYan, Zheng 3122d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3123efa56464SYan, Zheng num_bytes = end + 1 - start; 312418513091SWang Xiaoguang if (cur_offset < start) 3125bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3126bc42bda2SQu Wenruo cur_offset, start - cur_offset); 3127efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3128efa56464SYan, Zheng num_bytes, num_bytes, 3129efa56464SYan, Zheng end + 1, &alloc_hint); 313018513091SWang Xiaoguang cur_offset = end + 1; 3131d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3132efa56464SYan, Zheng if (ret) 3133efa56464SYan, Zheng break; 3134efa56464SYan, Zheng nr++; 3135efa56464SYan, Zheng } 313618513091SWang Xiaoguang if (cur_offset < prealloc_end) 3137bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3138bc42bda2SQu Wenruo cur_offset, prealloc_end + 1 - cur_offset); 3139efa56464SYan, Zheng out: 31405955102cSAl Viro inode_unlock(inode); 3141364ecf36SQu Wenruo extent_changeset_free(data_reserved); 3142efa56464SYan, Zheng return ret; 3143efa56464SYan, Zheng } 3144efa56464SYan, Zheng 3145efa56464SYan, Zheng static noinline_for_stack 31460257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 31470257bb82SYan, Zheng u64 block_start) 31485d4f98a2SYan Zheng { 31490b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 31505d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 31515d4f98a2SYan Zheng struct extent_map *em; 31520257bb82SYan, Zheng int ret = 0; 31535d4f98a2SYan Zheng 3154172ddd60SDavid Sterba em = alloc_extent_map(); 31550257bb82SYan, Zheng if (!em) 31560257bb82SYan, Zheng return -ENOMEM; 31570257bb82SYan, Zheng 31585d4f98a2SYan Zheng em->start = start; 31590257bb82SYan, Zheng em->len = end + 1 - start; 31600257bb82SYan, Zheng em->block_len = em->len; 31610257bb82SYan, Zheng em->block_start = block_start; 31620b246afaSJeff Mahoney em->bdev = fs_info->fs_devices->latest_bdev; 31635d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 31645d4f98a2SYan Zheng 3165d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 31665d4f98a2SYan Zheng while (1) { 3167890871beSChris Mason write_lock(&em_tree->lock); 316809a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3169890871beSChris Mason write_unlock(&em_tree->lock); 31705d4f98a2SYan Zheng if (ret != -EEXIST) { 31715d4f98a2SYan Zheng free_extent_map(em); 31725d4f98a2SYan Zheng break; 31735d4f98a2SYan Zheng } 3174dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 31755d4f98a2SYan Zheng } 3176d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 31770257bb82SYan, Zheng return ret; 31780257bb82SYan, Zheng } 31795d4f98a2SYan Zheng 31800257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 31810257bb82SYan, Zheng struct file_extent_cluster *cluster) 31820257bb82SYan, Zheng { 31832ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 31840257bb82SYan, Zheng u64 page_start; 31850257bb82SYan, Zheng u64 page_end; 31860257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 31870257bb82SYan, Zheng unsigned long index; 31880257bb82SYan, Zheng unsigned long last_index; 31890257bb82SYan, Zheng struct page *page; 31900257bb82SYan, Zheng struct file_ra_state *ra; 31913b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 31920257bb82SYan, Zheng int nr = 0; 31930257bb82SYan, Zheng int ret = 0; 31940257bb82SYan, Zheng 31950257bb82SYan, Zheng if (!cluster->nr) 31960257bb82SYan, Zheng return 0; 31970257bb82SYan, Zheng 31980257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 31990257bb82SYan, Zheng if (!ra) 32000257bb82SYan, Zheng return -ENOMEM; 32010257bb82SYan, Zheng 3202efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 32030257bb82SYan, Zheng if (ret) 3204efa56464SYan, Zheng goto out; 32050257bb82SYan, Zheng 32060257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 32070257bb82SYan, Zheng 3208efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3209efa56464SYan, Zheng cluster->end - offset, cluster->start); 3210efa56464SYan, Zheng if (ret) 3211efa56464SYan, Zheng goto out; 3212efa56464SYan, Zheng 321309cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 321409cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 32150257bb82SYan, Zheng while (index <= last_index) { 32169f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 32179f3db423SNikolay Borisov PAGE_SIZE); 3218efa56464SYan, Zheng if (ret) 3219efa56464SYan, Zheng goto out; 3220efa56464SYan, Zheng 32210257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 32220257bb82SYan, Zheng if (!page) { 32230257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 32240257bb82SYan, Zheng ra, NULL, index, 32250257bb82SYan, Zheng last_index + 1 - index); 3226a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 32273b16a4e3SJosef Bacik mask); 32280257bb82SYan, Zheng if (!page) { 3229691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 323043b18595SQu Wenruo PAGE_SIZE, true); 32310257bb82SYan, Zheng ret = -ENOMEM; 3232efa56464SYan, Zheng goto out; 32330257bb82SYan, Zheng } 32340257bb82SYan, Zheng } 32350257bb82SYan, Zheng 32360257bb82SYan, Zheng if (PageReadahead(page)) { 32370257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 32380257bb82SYan, Zheng ra, NULL, page, index, 32390257bb82SYan, Zheng last_index + 1 - index); 32400257bb82SYan, Zheng } 32410257bb82SYan, Zheng 32420257bb82SYan, Zheng if (!PageUptodate(page)) { 32430257bb82SYan, Zheng btrfs_readpage(NULL, page); 32440257bb82SYan, Zheng lock_page(page); 32450257bb82SYan, Zheng if (!PageUptodate(page)) { 32460257bb82SYan, Zheng unlock_page(page); 324709cbfeafSKirill A. Shutemov put_page(page); 3248691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 324943b18595SQu Wenruo PAGE_SIZE, true); 32508b62f87bSJosef Bacik btrfs_delalloc_release_extents(BTRFS_I(inode), 325143b18595SQu Wenruo PAGE_SIZE, true); 32520257bb82SYan, Zheng ret = -EIO; 3253efa56464SYan, Zheng goto out; 32540257bb82SYan, Zheng } 32550257bb82SYan, Zheng } 32560257bb82SYan, Zheng 32574eee4fa4SMiao Xie page_start = page_offset(page); 325809cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 32590257bb82SYan, Zheng 3260d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 32610257bb82SYan, Zheng 32620257bb82SYan, Zheng set_page_extent_mapped(page); 32630257bb82SYan, Zheng 32640257bb82SYan, Zheng if (nr < cluster->nr && 32650257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 32660257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 32670257bb82SYan, Zheng page_start, page_end, 3268ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 32690257bb82SYan, Zheng nr++; 32700257bb82SYan, Zheng } 32710257bb82SYan, Zheng 3272765f3cebSNikolay Borisov ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0, 3273765f3cebSNikolay Borisov NULL, 0); 3274765f3cebSNikolay Borisov if (ret) { 3275765f3cebSNikolay Borisov unlock_page(page); 3276765f3cebSNikolay Borisov put_page(page); 3277765f3cebSNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 327843b18595SQu Wenruo PAGE_SIZE, true); 3279765f3cebSNikolay Borisov btrfs_delalloc_release_extents(BTRFS_I(inode), 328043b18595SQu Wenruo PAGE_SIZE, true); 3281765f3cebSNikolay Borisov 3282765f3cebSNikolay Borisov clear_extent_bits(&BTRFS_I(inode)->io_tree, 3283765f3cebSNikolay Borisov page_start, page_end, 3284765f3cebSNikolay Borisov EXTENT_LOCKED | EXTENT_BOUNDARY); 3285765f3cebSNikolay Borisov goto out; 3286765f3cebSNikolay Borisov 3287765f3cebSNikolay Borisov } 32880257bb82SYan, Zheng set_page_dirty(page); 32890257bb82SYan, Zheng 32900257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3291d0082371SJeff Mahoney page_start, page_end); 32920257bb82SYan, Zheng unlock_page(page); 329309cbfeafSKirill A. Shutemov put_page(page); 32940257bb82SYan, Zheng 32950257bb82SYan, Zheng index++; 329643b18595SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE, 329743b18595SQu Wenruo false); 3298efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 32992ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 33000257bb82SYan, Zheng } 33010257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3302efa56464SYan, Zheng out: 33030257bb82SYan, Zheng kfree(ra); 33040257bb82SYan, Zheng return ret; 33050257bb82SYan, Zheng } 33060257bb82SYan, Zheng 33070257bb82SYan, Zheng static noinline_for_stack 33080257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 33090257bb82SYan, Zheng struct file_extent_cluster *cluster) 33100257bb82SYan, Zheng { 33110257bb82SYan, Zheng int ret; 33120257bb82SYan, Zheng 33130257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 33140257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 33150257bb82SYan, Zheng if (ret) 33160257bb82SYan, Zheng return ret; 33170257bb82SYan, Zheng cluster->nr = 0; 33180257bb82SYan, Zheng } 33190257bb82SYan, Zheng 33200257bb82SYan, Zheng if (!cluster->nr) 33210257bb82SYan, Zheng cluster->start = extent_key->objectid; 33220257bb82SYan, Zheng else 33230257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 33240257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 33250257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 33260257bb82SYan, Zheng cluster->nr++; 33270257bb82SYan, Zheng 33280257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 33290257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 33300257bb82SYan, Zheng if (ret) 33310257bb82SYan, Zheng return ret; 33320257bb82SYan, Zheng cluster->nr = 0; 33330257bb82SYan, Zheng } 33340257bb82SYan, Zheng return 0; 33355d4f98a2SYan Zheng } 33365d4f98a2SYan Zheng 33375d4f98a2SYan Zheng /* 33385d4f98a2SYan Zheng * helper to add a tree block to the list. 33395d4f98a2SYan Zheng * the major work is getting the generation and level of the block 33405d4f98a2SYan Zheng */ 33415d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 33425d4f98a2SYan Zheng struct btrfs_key *extent_key, 33435d4f98a2SYan Zheng struct btrfs_path *path, 33445d4f98a2SYan Zheng struct rb_root *blocks) 33455d4f98a2SYan Zheng { 33465d4f98a2SYan Zheng struct extent_buffer *eb; 33475d4f98a2SYan Zheng struct btrfs_extent_item *ei; 33485d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 33495d4f98a2SYan Zheng struct tree_block *block; 33505d4f98a2SYan Zheng struct rb_node *rb_node; 33515d4f98a2SYan Zheng u32 item_size; 33525d4f98a2SYan Zheng int level = -1; 33537fdf4b60SWang Shilong u64 generation; 33545d4f98a2SYan Zheng 33555d4f98a2SYan Zheng eb = path->nodes[0]; 33565d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 33575d4f98a2SYan Zheng 33583173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 33593173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 33605d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 33615d4f98a2SYan Zheng struct btrfs_extent_item); 33623173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 33635d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 33645d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 33655d4f98a2SYan Zheng } else { 33663173a18fSJosef Bacik level = (int)extent_key->offset; 33673173a18fSJosef Bacik } 33683173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 33696d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3370ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3371ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3372ba3c2b19SNikolay Borisov return -EINVAL; 33733173a18fSJosef Bacik } else { 33745d4f98a2SYan Zheng BUG(); 33755d4f98a2SYan Zheng } 33765d4f98a2SYan Zheng 3377b3b4aa74SDavid Sterba btrfs_release_path(path); 33785d4f98a2SYan Zheng 33795d4f98a2SYan Zheng BUG_ON(level == -1); 33805d4f98a2SYan Zheng 33815d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 33825d4f98a2SYan Zheng if (!block) 33835d4f98a2SYan Zheng return -ENOMEM; 33845d4f98a2SYan Zheng 33855d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3386da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 33875d4f98a2SYan Zheng block->key.offset = generation; 33885d4f98a2SYan Zheng block->level = level; 33895d4f98a2SYan Zheng block->key_ready = 0; 33905d4f98a2SYan Zheng 33915d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 339243c04fb1SJeff Mahoney if (rb_node) 339343c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 33945d4f98a2SYan Zheng 33955d4f98a2SYan Zheng return 0; 33965d4f98a2SYan Zheng } 33975d4f98a2SYan Zheng 33985d4f98a2SYan Zheng /* 33995d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 34005d4f98a2SYan Zheng */ 34015d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 34025d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 34035d4f98a2SYan Zheng struct rb_root *blocks) 34045d4f98a2SYan Zheng { 34050b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 34065d4f98a2SYan Zheng struct btrfs_path *path; 34075d4f98a2SYan Zheng struct btrfs_key key; 34085d4f98a2SYan Zheng int ret; 34090b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 34105d4f98a2SYan Zheng 34117476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 34125d4f98a2SYan Zheng return 0; 34135d4f98a2SYan Zheng 34145d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 34155d4f98a2SYan Zheng return 0; 34165d4f98a2SYan Zheng 34175d4f98a2SYan Zheng path = btrfs_alloc_path(); 34185d4f98a2SYan Zheng if (!path) 34195d4f98a2SYan Zheng return -ENOMEM; 3420aee68ee5SJosef Bacik again: 34215d4f98a2SYan Zheng key.objectid = bytenr; 3422aee68ee5SJosef Bacik if (skinny) { 3423aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3424aee68ee5SJosef Bacik key.offset = (u64)-1; 3425aee68ee5SJosef Bacik } else { 34265d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 34275d4f98a2SYan Zheng key.offset = blocksize; 3428aee68ee5SJosef Bacik } 34295d4f98a2SYan Zheng 34305d4f98a2SYan Zheng path->search_commit_root = 1; 34315d4f98a2SYan Zheng path->skip_locking = 1; 34325d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 34335d4f98a2SYan Zheng if (ret < 0) 34345d4f98a2SYan Zheng goto out; 34355d4f98a2SYan Zheng 3436aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3437aee68ee5SJosef Bacik if (path->slots[0]) { 3438aee68ee5SJosef Bacik path->slots[0]--; 3439aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3440aee68ee5SJosef Bacik path->slots[0]); 34413173a18fSJosef Bacik if (key.objectid == bytenr && 3442aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3443aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3444aee68ee5SJosef Bacik key.offset == blocksize))) 34453173a18fSJosef Bacik ret = 0; 34463173a18fSJosef Bacik } 3447aee68ee5SJosef Bacik 3448aee68ee5SJosef Bacik if (ret) { 3449aee68ee5SJosef Bacik skinny = false; 3450aee68ee5SJosef Bacik btrfs_release_path(path); 3451aee68ee5SJosef Bacik goto again; 3452aee68ee5SJosef Bacik } 3453aee68ee5SJosef Bacik } 3454cdccee99SLiu Bo if (ret) { 3455cdccee99SLiu Bo ASSERT(ret == 1); 3456cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3457cdccee99SLiu Bo btrfs_err(fs_info, 3458cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3459cdccee99SLiu Bo bytenr); 3460cdccee99SLiu Bo WARN_ON(1); 3461cdccee99SLiu Bo ret = -EINVAL; 3462cdccee99SLiu Bo goto out; 3463cdccee99SLiu Bo } 34643173a18fSJosef Bacik 34655d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 34665d4f98a2SYan Zheng out: 34675d4f98a2SYan Zheng btrfs_free_path(path); 34685d4f98a2SYan Zheng return ret; 34695d4f98a2SYan Zheng } 34705d4f98a2SYan Zheng 34715d4f98a2SYan Zheng /* 34725d4f98a2SYan Zheng * helper to check if the block use full backrefs for pointers in it 34735d4f98a2SYan Zheng */ 34745d4f98a2SYan Zheng static int block_use_full_backref(struct reloc_control *rc, 34755d4f98a2SYan Zheng struct extent_buffer *eb) 34765d4f98a2SYan Zheng { 34775d4f98a2SYan Zheng u64 flags; 34785d4f98a2SYan Zheng int ret; 34795d4f98a2SYan Zheng 34805d4f98a2SYan Zheng if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) || 34815d4f98a2SYan Zheng btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV) 34825d4f98a2SYan Zheng return 1; 34835d4f98a2SYan Zheng 34842ff7e61eSJeff Mahoney ret = btrfs_lookup_extent_info(NULL, rc->extent_root->fs_info, 34853173a18fSJosef Bacik eb->start, btrfs_header_level(eb), 1, 34863173a18fSJosef Bacik NULL, &flags); 34875d4f98a2SYan Zheng BUG_ON(ret); 34885d4f98a2SYan Zheng 34895d4f98a2SYan Zheng if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) 34905d4f98a2SYan Zheng ret = 1; 34915d4f98a2SYan Zheng else 34925d4f98a2SYan Zheng ret = 0; 34935d4f98a2SYan Zheng return ret; 34945d4f98a2SYan Zheng } 34955d4f98a2SYan Zheng 34960af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 34971bbc621eSChris Mason struct btrfs_block_group_cache *block_group, 34981bbc621eSChris Mason struct inode *inode, 34991bbc621eSChris Mason u64 ino) 35000af3d00bSJosef Bacik { 35010af3d00bSJosef Bacik struct btrfs_key key; 35020af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 35030af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 35040af3d00bSJosef Bacik int ret = 0; 35050af3d00bSJosef Bacik 35060af3d00bSJosef Bacik if (inode) 35070af3d00bSJosef Bacik goto truncate; 35080af3d00bSJosef Bacik 35090af3d00bSJosef Bacik key.objectid = ino; 35100af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 35110af3d00bSJosef Bacik key.offset = 0; 35120af3d00bSJosef Bacik 35130af3d00bSJosef Bacik inode = btrfs_iget(fs_info->sb, &key, root, NULL); 35142e19f1f9SAl Viro if (IS_ERR(inode)) 35150af3d00bSJosef Bacik return -ENOENT; 35160af3d00bSJosef Bacik 35170af3d00bSJosef Bacik truncate: 35182ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 35197b61cd92SMiao Xie &fs_info->global_block_rsv); 35207b61cd92SMiao Xie if (ret) 35217b61cd92SMiao Xie goto out; 35227b61cd92SMiao Xie 35237a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 35240af3d00bSJosef Bacik if (IS_ERR(trans)) { 35253612b495STsutomu Itoh ret = PTR_ERR(trans); 35260af3d00bSJosef Bacik goto out; 35270af3d00bSJosef Bacik } 35280af3d00bSJosef Bacik 352977ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 35300af3d00bSJosef Bacik 35313a45bb20SJeff Mahoney btrfs_end_transaction(trans); 35322ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 35330af3d00bSJosef Bacik out: 35340af3d00bSJosef Bacik iput(inode); 35350af3d00bSJosef Bacik return ret; 35360af3d00bSJosef Bacik } 35370af3d00bSJosef Bacik 35385d4f98a2SYan Zheng /* 35395d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY 35405d4f98a2SYan Zheng * this function scans fs tree to find blocks reference the data extent 35415d4f98a2SYan Zheng */ 35425d4f98a2SYan Zheng static int find_data_references(struct reloc_control *rc, 35435d4f98a2SYan Zheng struct btrfs_key *extent_key, 35445d4f98a2SYan Zheng struct extent_buffer *leaf, 35455d4f98a2SYan Zheng struct btrfs_extent_data_ref *ref, 35465d4f98a2SYan Zheng struct rb_root *blocks) 35475d4f98a2SYan Zheng { 35480b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 35495d4f98a2SYan Zheng struct btrfs_path *path; 35505d4f98a2SYan Zheng struct tree_block *block; 35515d4f98a2SYan Zheng struct btrfs_root *root; 35525d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 35535d4f98a2SYan Zheng struct rb_node *rb_node; 35545d4f98a2SYan Zheng struct btrfs_key key; 35555d4f98a2SYan Zheng u64 ref_root; 35565d4f98a2SYan Zheng u64 ref_objectid; 35575d4f98a2SYan Zheng u64 ref_offset; 35585d4f98a2SYan Zheng u32 ref_count; 35595d4f98a2SYan Zheng u32 nritems; 35605d4f98a2SYan Zheng int err = 0; 35615d4f98a2SYan Zheng int added = 0; 35625d4f98a2SYan Zheng int counted; 35635d4f98a2SYan Zheng int ret; 35645d4f98a2SYan Zheng 35655d4f98a2SYan Zheng ref_root = btrfs_extent_data_ref_root(leaf, ref); 35665d4f98a2SYan Zheng ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref); 35675d4f98a2SYan Zheng ref_offset = btrfs_extent_data_ref_offset(leaf, ref); 35685d4f98a2SYan Zheng ref_count = btrfs_extent_data_ref_count(leaf, ref); 35695d4f98a2SYan Zheng 35700af3d00bSJosef Bacik /* 35710af3d00bSJosef Bacik * This is an extent belonging to the free space cache, lets just delete 35720af3d00bSJosef Bacik * it and redo the search. 35730af3d00bSJosef Bacik */ 35740af3d00bSJosef Bacik if (ref_root == BTRFS_ROOT_TREE_OBJECTID) { 35750b246afaSJeff Mahoney ret = delete_block_group_cache(fs_info, rc->block_group, 35760af3d00bSJosef Bacik NULL, ref_objectid); 35770af3d00bSJosef Bacik if (ret != -ENOENT) 35780af3d00bSJosef Bacik return ret; 35790af3d00bSJosef Bacik ret = 0; 35800af3d00bSJosef Bacik } 35810af3d00bSJosef Bacik 35820af3d00bSJosef Bacik path = btrfs_alloc_path(); 35830af3d00bSJosef Bacik if (!path) 35840af3d00bSJosef Bacik return -ENOMEM; 3585e4058b54SDavid Sterba path->reada = READA_FORWARD; 35860af3d00bSJosef Bacik 35870b246afaSJeff Mahoney root = read_fs_root(fs_info, ref_root); 35885d4f98a2SYan Zheng if (IS_ERR(root)) { 35895d4f98a2SYan Zheng err = PTR_ERR(root); 35905d4f98a2SYan Zheng goto out; 35915d4f98a2SYan Zheng } 35925d4f98a2SYan Zheng 35935d4f98a2SYan Zheng key.objectid = ref_objectid; 35945d4f98a2SYan Zheng key.type = BTRFS_EXTENT_DATA_KEY; 359584850e8dSYan, Zheng if (ref_offset > ((u64)-1 << 32)) 359684850e8dSYan, Zheng key.offset = 0; 359784850e8dSYan, Zheng else 359884850e8dSYan, Zheng key.offset = ref_offset; 35995d4f98a2SYan Zheng 36005d4f98a2SYan Zheng path->search_commit_root = 1; 36015d4f98a2SYan Zheng path->skip_locking = 1; 36025d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 36035d4f98a2SYan Zheng if (ret < 0) { 36045d4f98a2SYan Zheng err = ret; 36055d4f98a2SYan Zheng goto out; 36065d4f98a2SYan Zheng } 36075d4f98a2SYan Zheng 36085d4f98a2SYan Zheng leaf = path->nodes[0]; 36095d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 36105d4f98a2SYan Zheng /* 36115d4f98a2SYan Zheng * the references in tree blocks that use full backrefs 36125d4f98a2SYan Zheng * are not counted in 36135d4f98a2SYan Zheng */ 36145d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 36155d4f98a2SYan Zheng counted = 0; 36165d4f98a2SYan Zheng else 36175d4f98a2SYan Zheng counted = 1; 36185d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 36195d4f98a2SYan Zheng if (rb_node) { 36205d4f98a2SYan Zheng if (counted) 36215d4f98a2SYan Zheng added = 1; 36225d4f98a2SYan Zheng else 36235d4f98a2SYan Zheng path->slots[0] = nritems; 36245d4f98a2SYan Zheng } 36255d4f98a2SYan Zheng 36265d4f98a2SYan Zheng while (ref_count > 0) { 36275d4f98a2SYan Zheng while (path->slots[0] >= nritems) { 36285d4f98a2SYan Zheng ret = btrfs_next_leaf(root, path); 36295d4f98a2SYan Zheng if (ret < 0) { 36305d4f98a2SYan Zheng err = ret; 36315d4f98a2SYan Zheng goto out; 36325d4f98a2SYan Zheng } 3633fae7f21cSDulshani Gunawardhana if (WARN_ON(ret > 0)) 36345d4f98a2SYan Zheng goto out; 36355d4f98a2SYan Zheng 36365d4f98a2SYan Zheng leaf = path->nodes[0]; 36375d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 36385d4f98a2SYan Zheng added = 0; 36395d4f98a2SYan Zheng 36405d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 36415d4f98a2SYan Zheng counted = 0; 36425d4f98a2SYan Zheng else 36435d4f98a2SYan Zheng counted = 1; 36445d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 36455d4f98a2SYan Zheng if (rb_node) { 36465d4f98a2SYan Zheng if (counted) 36475d4f98a2SYan Zheng added = 1; 36485d4f98a2SYan Zheng else 36495d4f98a2SYan Zheng path->slots[0] = nritems; 36505d4f98a2SYan Zheng } 36515d4f98a2SYan Zheng } 36525d4f98a2SYan Zheng 36535d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 3654fae7f21cSDulshani Gunawardhana if (WARN_ON(key.objectid != ref_objectid || 3655fae7f21cSDulshani Gunawardhana key.type != BTRFS_EXTENT_DATA_KEY)) 36565d4f98a2SYan Zheng break; 36575d4f98a2SYan Zheng 36585d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 36595d4f98a2SYan Zheng struct btrfs_file_extent_item); 36605d4f98a2SYan Zheng 36615d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 36625d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 36635d4f98a2SYan Zheng goto next; 36645d4f98a2SYan Zheng 36655d4f98a2SYan Zheng if (btrfs_file_extent_disk_bytenr(leaf, fi) != 36665d4f98a2SYan Zheng extent_key->objectid) 36675d4f98a2SYan Zheng goto next; 36685d4f98a2SYan Zheng 36695d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 36705d4f98a2SYan Zheng if (key.offset != ref_offset) 36715d4f98a2SYan Zheng goto next; 36725d4f98a2SYan Zheng 36735d4f98a2SYan Zheng if (counted) 36745d4f98a2SYan Zheng ref_count--; 36755d4f98a2SYan Zheng if (added) 36765d4f98a2SYan Zheng goto next; 36775d4f98a2SYan Zheng 36787476dfdaSDavid Sterba if (!tree_block_processed(leaf->start, rc)) { 36795d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 36805d4f98a2SYan Zheng if (!block) { 36815d4f98a2SYan Zheng err = -ENOMEM; 36825d4f98a2SYan Zheng break; 36835d4f98a2SYan Zheng } 36845d4f98a2SYan Zheng block->bytenr = leaf->start; 36855d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &block->key, 0); 36865d4f98a2SYan Zheng block->level = 0; 36875d4f98a2SYan Zheng block->key_ready = 1; 36885d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, 36895d4f98a2SYan Zheng &block->rb_node); 369043c04fb1SJeff Mahoney if (rb_node) 369143c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 369243c04fb1SJeff Mahoney block->bytenr); 36935d4f98a2SYan Zheng } 36945d4f98a2SYan Zheng if (counted) 36955d4f98a2SYan Zheng added = 1; 36965d4f98a2SYan Zheng else 36975d4f98a2SYan Zheng path->slots[0] = nritems; 36985d4f98a2SYan Zheng next: 36995d4f98a2SYan Zheng path->slots[0]++; 37005d4f98a2SYan Zheng 37015d4f98a2SYan Zheng } 37025d4f98a2SYan Zheng out: 37035d4f98a2SYan Zheng btrfs_free_path(path); 37045d4f98a2SYan Zheng return err; 37055d4f98a2SYan Zheng } 37065d4f98a2SYan Zheng 37075d4f98a2SYan Zheng /* 37082c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 37095d4f98a2SYan Zheng */ 37105d4f98a2SYan Zheng static noinline_for_stack 37115d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 37125d4f98a2SYan Zheng struct btrfs_key *extent_key, 37135d4f98a2SYan Zheng struct btrfs_path *path, 37145d4f98a2SYan Zheng struct rb_root *blocks) 37155d4f98a2SYan Zheng { 37165d4f98a2SYan Zheng struct btrfs_key key; 37175d4f98a2SYan Zheng struct extent_buffer *eb; 37185d4f98a2SYan Zheng struct btrfs_extent_data_ref *dref; 37195d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 37205d4f98a2SYan Zheng unsigned long ptr; 37215d4f98a2SYan Zheng unsigned long end; 3722da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 3723647f63bdSFilipe David Borba Manana int ret = 0; 37245d4f98a2SYan Zheng int err = 0; 37255d4f98a2SYan Zheng 37265d4f98a2SYan Zheng eb = path->nodes[0]; 37275d4f98a2SYan Zheng ptr = btrfs_item_ptr_offset(eb, path->slots[0]); 37285d4f98a2SYan Zheng end = ptr + btrfs_item_size_nr(eb, path->slots[0]); 37295d4f98a2SYan Zheng ptr += sizeof(struct btrfs_extent_item); 37305d4f98a2SYan Zheng 37315d4f98a2SYan Zheng while (ptr < end) { 37325d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 37333de28d57SLiu Bo key.type = btrfs_get_extent_inline_ref_type(eb, iref, 37343de28d57SLiu Bo BTRFS_REF_TYPE_DATA); 37355d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 37365d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 37375d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 37385d4f98a2SYan Zheng blocks); 37395d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 37405d4f98a2SYan Zheng dref = (struct btrfs_extent_data_ref *)(&iref->offset); 37415d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 37425d4f98a2SYan Zheng eb, dref, blocks); 37435d4f98a2SYan Zheng } else { 3744af431dcbSSu Yue ret = -EUCLEAN; 3745b14c55a1SLiu Bo btrfs_err(rc->extent_root->fs_info, 3746b14c55a1SLiu Bo "extent %llu slot %d has an invalid inline ref type", 3747b14c55a1SLiu Bo eb->start, path->slots[0]); 37485d4f98a2SYan Zheng } 3749647f63bdSFilipe David Borba Manana if (ret) { 3750647f63bdSFilipe David Borba Manana err = ret; 3751647f63bdSFilipe David Borba Manana goto out; 3752647f63bdSFilipe David Borba Manana } 37535d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 37545d4f98a2SYan Zheng } 37555d4f98a2SYan Zheng WARN_ON(ptr > end); 37565d4f98a2SYan Zheng 37575d4f98a2SYan Zheng while (1) { 37585d4f98a2SYan Zheng cond_resched(); 37595d4f98a2SYan Zheng eb = path->nodes[0]; 37605d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(eb)) { 37615d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 37625d4f98a2SYan Zheng if (ret < 0) { 37635d4f98a2SYan Zheng err = ret; 37645d4f98a2SYan Zheng break; 37655d4f98a2SYan Zheng } 37665d4f98a2SYan Zheng if (ret > 0) 37675d4f98a2SYan Zheng break; 37685d4f98a2SYan Zheng eb = path->nodes[0]; 37695d4f98a2SYan Zheng } 37705d4f98a2SYan Zheng 37715d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path->slots[0]); 37725d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 37735d4f98a2SYan Zheng break; 37745d4f98a2SYan Zheng 37755d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 37765d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 37775d4f98a2SYan Zheng blocks); 37785d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 37795d4f98a2SYan Zheng dref = btrfs_item_ptr(eb, path->slots[0], 37805d4f98a2SYan Zheng struct btrfs_extent_data_ref); 37815d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 37825d4f98a2SYan Zheng eb, dref, blocks); 37836d8ff4e4SDavid Sterba } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) { 3784ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3785ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3786ba3c2b19SNikolay Borisov ret = -EINVAL; 37875d4f98a2SYan Zheng } else { 37885d4f98a2SYan Zheng ret = 0; 37895d4f98a2SYan Zheng } 37905d4f98a2SYan Zheng if (ret) { 37915d4f98a2SYan Zheng err = ret; 37925d4f98a2SYan Zheng break; 37935d4f98a2SYan Zheng } 37945d4f98a2SYan Zheng path->slots[0]++; 37955d4f98a2SYan Zheng } 3796647f63bdSFilipe David Borba Manana out: 3797b3b4aa74SDavid Sterba btrfs_release_path(path); 37985d4f98a2SYan Zheng if (err) 37995d4f98a2SYan Zheng free_block_list(blocks); 38005d4f98a2SYan Zheng return err; 38015d4f98a2SYan Zheng } 38025d4f98a2SYan Zheng 38035d4f98a2SYan Zheng /* 38042c016dc2SLiu Bo * helper to find next unprocessed extent 38055d4f98a2SYan Zheng */ 38065d4f98a2SYan Zheng static noinline_for_stack 3807147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 38083fd0a558SYan, Zheng struct btrfs_key *extent_key) 38095d4f98a2SYan Zheng { 38100b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38115d4f98a2SYan Zheng struct btrfs_key key; 38125d4f98a2SYan Zheng struct extent_buffer *leaf; 38135d4f98a2SYan Zheng u64 start, end, last; 38145d4f98a2SYan Zheng int ret; 38155d4f98a2SYan Zheng 38165d4f98a2SYan Zheng last = rc->block_group->key.objectid + rc->block_group->key.offset; 38175d4f98a2SYan Zheng while (1) { 38185d4f98a2SYan Zheng cond_resched(); 38195d4f98a2SYan Zheng if (rc->search_start >= last) { 38205d4f98a2SYan Zheng ret = 1; 38215d4f98a2SYan Zheng break; 38225d4f98a2SYan Zheng } 38235d4f98a2SYan Zheng 38245d4f98a2SYan Zheng key.objectid = rc->search_start; 38255d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 38265d4f98a2SYan Zheng key.offset = 0; 38275d4f98a2SYan Zheng 38285d4f98a2SYan Zheng path->search_commit_root = 1; 38295d4f98a2SYan Zheng path->skip_locking = 1; 38305d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 38315d4f98a2SYan Zheng 0, 0); 38325d4f98a2SYan Zheng if (ret < 0) 38335d4f98a2SYan Zheng break; 38345d4f98a2SYan Zheng next: 38355d4f98a2SYan Zheng leaf = path->nodes[0]; 38365d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 38375d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 38385d4f98a2SYan Zheng if (ret != 0) 38395d4f98a2SYan Zheng break; 38405d4f98a2SYan Zheng leaf = path->nodes[0]; 38415d4f98a2SYan Zheng } 38425d4f98a2SYan Zheng 38435d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 38445d4f98a2SYan Zheng if (key.objectid >= last) { 38455d4f98a2SYan Zheng ret = 1; 38465d4f98a2SYan Zheng break; 38475d4f98a2SYan Zheng } 38485d4f98a2SYan Zheng 38493173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 38503173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 38513173a18fSJosef Bacik path->slots[0]++; 38523173a18fSJosef Bacik goto next; 38533173a18fSJosef Bacik } 38543173a18fSJosef Bacik 38553173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 38565d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 38575d4f98a2SYan Zheng path->slots[0]++; 38585d4f98a2SYan Zheng goto next; 38595d4f98a2SYan Zheng } 38605d4f98a2SYan Zheng 38613173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 38620b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 38633173a18fSJosef Bacik rc->search_start) { 38643173a18fSJosef Bacik path->slots[0]++; 38653173a18fSJosef Bacik goto next; 38663173a18fSJosef Bacik } 38673173a18fSJosef Bacik 38685d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 38695d4f98a2SYan Zheng key.objectid, &start, &end, 3870e6138876SJosef Bacik EXTENT_DIRTY, NULL); 38715d4f98a2SYan Zheng 38725d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3873b3b4aa74SDavid Sterba btrfs_release_path(path); 38745d4f98a2SYan Zheng rc->search_start = end + 1; 38755d4f98a2SYan Zheng } else { 38763173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 38775d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 38783173a18fSJosef Bacik else 38793173a18fSJosef Bacik rc->search_start = key.objectid + 38800b246afaSJeff Mahoney fs_info->nodesize; 38813fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 38825d4f98a2SYan Zheng return 0; 38835d4f98a2SYan Zheng } 38845d4f98a2SYan Zheng } 3885b3b4aa74SDavid Sterba btrfs_release_path(path); 38865d4f98a2SYan Zheng return ret; 38875d4f98a2SYan Zheng } 38885d4f98a2SYan Zheng 38895d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 38905d4f98a2SYan Zheng { 38915d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38927585717fSChris Mason 38937585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 38945d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 38957585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 38965d4f98a2SYan Zheng } 38975d4f98a2SYan Zheng 38985d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 38995d4f98a2SYan Zheng { 39005d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39017585717fSChris Mason 39027585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39035d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 39047585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39055d4f98a2SYan Zheng } 39065d4f98a2SYan Zheng 39075d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 39085d4f98a2SYan Zheng { 39095d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39105d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39115d4f98a2SYan Zheng return 1; 39125d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 39135d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39145d4f98a2SYan Zheng return 1; 39155d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39165d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 39175d4f98a2SYan Zheng return 1; 39185d4f98a2SYan Zheng return 0; 39195d4f98a2SYan Zheng } 39205d4f98a2SYan Zheng 39213fd0a558SYan, Zheng static noinline_for_stack 39223fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 39233fd0a558SYan, Zheng { 39243fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3925ac2fabacSJosef Bacik int ret; 39263fd0a558SYan, Zheng 39272ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 392866d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 39293fd0a558SYan, Zheng if (!rc->block_rsv) 39303fd0a558SYan, Zheng return -ENOMEM; 39313fd0a558SYan, Zheng 39323fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 39333fd0a558SYan, Zheng rc->search_start = rc->block_group->key.objectid; 39343fd0a558SYan, Zheng rc->extents_found = 0; 39353fd0a558SYan, Zheng rc->nodes_relocated = 0; 39363fd0a558SYan, Zheng rc->merging_rsv_size = 0; 39370647bf56SWang Shilong rc->reserved_bytes = 0; 3938da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 39390647bf56SWang Shilong RELOCATION_RESERVED_NODES; 3940ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 3941ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3942ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3943ac2fabacSJosef Bacik if (ret) 3944ac2fabacSJosef Bacik return ret; 39453fd0a558SYan, Zheng 39463fd0a558SYan, Zheng rc->create_reloc_tree = 1; 39473fd0a558SYan, Zheng set_reloc_control(rc); 39483fd0a558SYan, Zheng 39497a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 395028818947SLiu Bo if (IS_ERR(trans)) { 395128818947SLiu Bo unset_reloc_control(rc); 395228818947SLiu Bo /* 395328818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 395428818947SLiu Bo * cleanup. And callers are responsible to free the above 395528818947SLiu Bo * block rsv. 395628818947SLiu Bo */ 395728818947SLiu Bo return PTR_ERR(trans); 395828818947SLiu Bo } 39593a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 39603fd0a558SYan, Zheng return 0; 39613fd0a558SYan, Zheng } 396276dda93cSYan, Zheng 39635d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 39645d4f98a2SYan Zheng { 39652ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39665d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 39675d4f98a2SYan Zheng struct btrfs_key key; 39685d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 39695d4f98a2SYan Zheng struct btrfs_path *path; 39705d4f98a2SYan Zheng struct btrfs_extent_item *ei; 39715d4f98a2SYan Zheng u64 flags; 39725d4f98a2SYan Zheng u32 item_size; 39735d4f98a2SYan Zheng int ret; 39745d4f98a2SYan Zheng int err = 0; 3975c87f08caSChris Mason int progress = 0; 39765d4f98a2SYan Zheng 39775d4f98a2SYan Zheng path = btrfs_alloc_path(); 39783fd0a558SYan, Zheng if (!path) 39795d4f98a2SYan Zheng return -ENOMEM; 3980e4058b54SDavid Sterba path->reada = READA_FORWARD; 39813fd0a558SYan, Zheng 39823fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 39833fd0a558SYan, Zheng if (ret) { 39843fd0a558SYan, Zheng err = ret; 39853fd0a558SYan, Zheng goto out_free; 39862423fdfbSJiri Slaby } 39875d4f98a2SYan Zheng 39885d4f98a2SYan Zheng while (1) { 39890647bf56SWang Shilong rc->reserved_bytes = 0; 39900647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 39910647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 39920647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 39930647bf56SWang Shilong if (ret) { 39940647bf56SWang Shilong err = ret; 39950647bf56SWang Shilong break; 39960647bf56SWang Shilong } 3997c87f08caSChris Mason progress++; 3998a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 39990f788c58SLiu Bo if (IS_ERR(trans)) { 40000f788c58SLiu Bo err = PTR_ERR(trans); 40010f788c58SLiu Bo trans = NULL; 40020f788c58SLiu Bo break; 40030f788c58SLiu Bo } 4004c87f08caSChris Mason restart: 40053fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 40063a45bb20SJeff Mahoney btrfs_end_transaction(trans); 400742a657f5SPan Bian trans = NULL; 40083fd0a558SYan, Zheng continue; 40093fd0a558SYan, Zheng } 40103fd0a558SYan, Zheng 4011147d256eSZhaolei ret = find_next_extent(rc, path, &key); 40125d4f98a2SYan Zheng if (ret < 0) 40135d4f98a2SYan Zheng err = ret; 40145d4f98a2SYan Zheng if (ret != 0) 40155d4f98a2SYan Zheng break; 40165d4f98a2SYan Zheng 40175d4f98a2SYan Zheng rc->extents_found++; 40185d4f98a2SYan Zheng 40195d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 40205d4f98a2SYan Zheng struct btrfs_extent_item); 40213fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 40225d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 40235d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 40245d4f98a2SYan Zheng ret = check_extent_flags(flags); 40255d4f98a2SYan Zheng BUG_ON(ret); 40266d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 4027ba3c2b19SNikolay Borisov err = -EINVAL; 4028ba3c2b19SNikolay Borisov btrfs_print_v0_err(trans->fs_info); 4029ba3c2b19SNikolay Borisov btrfs_abort_transaction(trans, err); 4030ba3c2b19SNikolay Borisov break; 40315d4f98a2SYan Zheng } else { 40325d4f98a2SYan Zheng BUG(); 40335d4f98a2SYan Zheng } 40345d4f98a2SYan Zheng 40355d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 40365d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 40375d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 40385d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40395d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 40405d4f98a2SYan Zheng } else { 4041b3b4aa74SDavid Sterba btrfs_release_path(path); 40425d4f98a2SYan Zheng ret = 0; 40435d4f98a2SYan Zheng } 40445d4f98a2SYan Zheng if (ret < 0) { 40453fd0a558SYan, Zheng err = ret; 40465d4f98a2SYan Zheng break; 40475d4f98a2SYan Zheng } 40485d4f98a2SYan Zheng 40495d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 40505d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 40515d4f98a2SYan Zheng if (ret < 0) { 40521708cc57SWang Shilong /* 40531708cc57SWang Shilong * if we fail to relocate tree blocks, force to update 40541708cc57SWang Shilong * backref cache when committing transaction. 40551708cc57SWang Shilong */ 40561708cc57SWang Shilong rc->backref_cache.last_trans = trans->transid - 1; 40571708cc57SWang Shilong 40583fd0a558SYan, Zheng if (ret != -EAGAIN) { 40595d4f98a2SYan Zheng err = ret; 40605d4f98a2SYan Zheng break; 40615d4f98a2SYan Zheng } 40623fd0a558SYan, Zheng rc->extents_found--; 40633fd0a558SYan, Zheng rc->search_start = key.objectid; 40643fd0a558SYan, Zheng } 40655d4f98a2SYan Zheng } 40665d4f98a2SYan Zheng 40673a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 40682ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 40693fd0a558SYan, Zheng trans = NULL; 40705d4f98a2SYan Zheng 40715d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 40725d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40735d4f98a2SYan Zheng rc->found_file_extent = 1; 40740257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 40753fd0a558SYan, Zheng &key, &rc->cluster); 40765d4f98a2SYan Zheng if (ret < 0) { 40775d4f98a2SYan Zheng err = ret; 40785d4f98a2SYan Zheng break; 40795d4f98a2SYan Zheng } 40805d4f98a2SYan Zheng } 40815d4f98a2SYan Zheng } 4082c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 408343a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 40849689457bSShilong Wang if (ret == 1) { 4085c87f08caSChris Mason err = 0; 4086c87f08caSChris Mason progress = 0; 4087c87f08caSChris Mason goto restart; 4088c87f08caSChris Mason } 4089c87f08caSChris Mason } 40903fd0a558SYan, Zheng 4091b3b4aa74SDavid Sterba btrfs_release_path(path); 409291166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 40935d4f98a2SYan Zheng 40945d4f98a2SYan Zheng if (trans) { 40953a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 40962ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 40975d4f98a2SYan Zheng } 40985d4f98a2SYan Zheng 40990257bb82SYan, Zheng if (!err) { 41003fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 41013fd0a558SYan, Zheng &rc->cluster); 41020257bb82SYan, Zheng if (ret < 0) 41030257bb82SYan, Zheng err = ret; 41040257bb82SYan, Zheng } 41050257bb82SYan, Zheng 41063fd0a558SYan, Zheng rc->create_reloc_tree = 0; 41073fd0a558SYan, Zheng set_reloc_control(rc); 41080257bb82SYan, Zheng 41093fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 41102ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1); 41115d4f98a2SYan Zheng 41123fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 41135d4f98a2SYan Zheng 41145d4f98a2SYan Zheng merge_reloc_roots(rc); 41155d4f98a2SYan Zheng 41163fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 41175d4f98a2SYan Zheng unset_reloc_control(rc); 41182ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1); 41195d4f98a2SYan Zheng 41205d4f98a2SYan Zheng /* get rid of pinned extents */ 41217a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 412262b99540SQu Wenruo if (IS_ERR(trans)) { 41233612b495STsutomu Itoh err = PTR_ERR(trans); 412462b99540SQu Wenruo goto out_free; 412562b99540SQu Wenruo } 41263a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 4127d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4128d2311e69SQu Wenruo if (ret < 0 && !err) 4129d2311e69SQu Wenruo err = ret; 41303fd0a558SYan, Zheng out_free: 41312ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 41323fd0a558SYan, Zheng btrfs_free_path(path); 41335d4f98a2SYan Zheng return err; 41345d4f98a2SYan Zheng } 41355d4f98a2SYan Zheng 41365d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 41370257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 41385d4f98a2SYan Zheng { 41395d4f98a2SYan Zheng struct btrfs_path *path; 41405d4f98a2SYan Zheng struct btrfs_inode_item *item; 41415d4f98a2SYan Zheng struct extent_buffer *leaf; 41425d4f98a2SYan Zheng int ret; 41435d4f98a2SYan Zheng 41445d4f98a2SYan Zheng path = btrfs_alloc_path(); 41455d4f98a2SYan Zheng if (!path) 41465d4f98a2SYan Zheng return -ENOMEM; 41475d4f98a2SYan Zheng 41485d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 41495d4f98a2SYan Zheng if (ret) 41505d4f98a2SYan Zheng goto out; 41515d4f98a2SYan Zheng 41525d4f98a2SYan Zheng leaf = path->nodes[0]; 41535d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 4154b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 41555d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 41560257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 41575d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 41583fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 41593fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 41605d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 41615d4f98a2SYan Zheng out: 41625d4f98a2SYan Zheng btrfs_free_path(path); 41635d4f98a2SYan Zheng return ret; 41645d4f98a2SYan Zheng } 41655d4f98a2SYan Zheng 41665d4f98a2SYan Zheng /* 41675d4f98a2SYan Zheng * helper to create inode for data relocation. 41685d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 41695d4f98a2SYan Zheng */ 41703fd0a558SYan, Zheng static noinline_for_stack 41713fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 41725d4f98a2SYan Zheng struct btrfs_block_group_cache *group) 41735d4f98a2SYan Zheng { 41745d4f98a2SYan Zheng struct inode *inode = NULL; 41755d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 41765d4f98a2SYan Zheng struct btrfs_root *root; 41775d4f98a2SYan Zheng struct btrfs_key key; 41784624900dSZhaolei u64 objectid; 41795d4f98a2SYan Zheng int err = 0; 41805d4f98a2SYan Zheng 41815d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 41825d4f98a2SYan Zheng if (IS_ERR(root)) 41835d4f98a2SYan Zheng return ERR_CAST(root); 41845d4f98a2SYan Zheng 4185a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 41863fd0a558SYan, Zheng if (IS_ERR(trans)) 41873fd0a558SYan, Zheng return ERR_CAST(trans); 41885d4f98a2SYan Zheng 4189581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 41905d4f98a2SYan Zheng if (err) 41915d4f98a2SYan Zheng goto out; 41925d4f98a2SYan Zheng 41930257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 41945d4f98a2SYan Zheng BUG_ON(err); 41955d4f98a2SYan Zheng 41965d4f98a2SYan Zheng key.objectid = objectid; 41975d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 41985d4f98a2SYan Zheng key.offset = 0; 41990b246afaSJeff Mahoney inode = btrfs_iget(fs_info->sb, &key, root, NULL); 42002e19f1f9SAl Viro BUG_ON(IS_ERR(inode)); 42015d4f98a2SYan Zheng BTRFS_I(inode)->index_cnt = group->key.objectid; 42025d4f98a2SYan Zheng 420373f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 42045d4f98a2SYan Zheng out: 42053a45bb20SJeff Mahoney btrfs_end_transaction(trans); 42062ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 42075d4f98a2SYan Zheng if (err) { 42085d4f98a2SYan Zheng if (inode) 42095d4f98a2SYan Zheng iput(inode); 42105d4f98a2SYan Zheng inode = ERR_PTR(err); 42115d4f98a2SYan Zheng } 42125d4f98a2SYan Zheng return inode; 42135d4f98a2SYan Zheng } 42145d4f98a2SYan Zheng 42159113493eSGu Jinxiang static struct reloc_control *alloc_reloc_control(void) 42163fd0a558SYan, Zheng { 42173fd0a558SYan, Zheng struct reloc_control *rc; 42183fd0a558SYan, Zheng 42193fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 42203fd0a558SYan, Zheng if (!rc) 42213fd0a558SYan, Zheng return NULL; 42223fd0a558SYan, Zheng 42233fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 4224d2311e69SQu Wenruo INIT_LIST_HEAD(&rc->dirty_subvol_roots); 42253fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 42263fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 4227c6100a4bSJosef Bacik extent_io_tree_init(&rc->processed_blocks, NULL); 42283fd0a558SYan, Zheng return rc; 42293fd0a558SYan, Zheng } 42303fd0a558SYan, Zheng 42315d4f98a2SYan Zheng /* 4232ebce0e01SAdam Borowski * Print the block group being relocated 4233ebce0e01SAdam Borowski */ 4234ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 4235ebce0e01SAdam Borowski struct btrfs_block_group_cache *block_group) 4236ebce0e01SAdam Borowski { 4237f89e09cfSAnand Jain char buf[128] = {'\0'}; 4238ebce0e01SAdam Borowski 4239f89e09cfSAnand Jain btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); 4240ebce0e01SAdam Borowski 4241ebce0e01SAdam Borowski btrfs_info(fs_info, 4242ebce0e01SAdam Borowski "relocating block group %llu flags %s", 4243f89e09cfSAnand Jain block_group->key.objectid, buf); 4244ebce0e01SAdam Borowski } 4245ebce0e01SAdam Borowski 4246ebce0e01SAdam Borowski /* 42475d4f98a2SYan Zheng * function to relocate all extents in a block group. 42485d4f98a2SYan Zheng */ 42496bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 42505d4f98a2SYan Zheng { 4251eede2bf3SOmar Sandoval struct btrfs_block_group_cache *bg; 42526bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 42535d4f98a2SYan Zheng struct reloc_control *rc; 42540af3d00bSJosef Bacik struct inode *inode; 42550af3d00bSJosef Bacik struct btrfs_path *path; 42565d4f98a2SYan Zheng int ret; 4257f0486c68SYan, Zheng int rw = 0; 42585d4f98a2SYan Zheng int err = 0; 42595d4f98a2SYan Zheng 4260eede2bf3SOmar Sandoval bg = btrfs_lookup_block_group(fs_info, group_start); 4261eede2bf3SOmar Sandoval if (!bg) 4262eede2bf3SOmar Sandoval return -ENOENT; 4263eede2bf3SOmar Sandoval 4264eede2bf3SOmar Sandoval if (btrfs_pinned_by_swapfile(fs_info, bg)) { 4265eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 4266eede2bf3SOmar Sandoval return -ETXTBSY; 4267eede2bf3SOmar Sandoval } 4268eede2bf3SOmar Sandoval 42699113493eSGu Jinxiang rc = alloc_reloc_control(); 4270eede2bf3SOmar Sandoval if (!rc) { 4271eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 42725d4f98a2SYan Zheng return -ENOMEM; 4273eede2bf3SOmar Sandoval } 42745d4f98a2SYan Zheng 4275f0486c68SYan, Zheng rc->extent_root = extent_root; 4276eede2bf3SOmar Sandoval rc->block_group = bg; 42775d4f98a2SYan Zheng 4278c83488afSNikolay Borisov ret = btrfs_inc_block_group_ro(rc->block_group); 4279f0486c68SYan, Zheng if (ret) { 4280f0486c68SYan, Zheng err = ret; 4281f0486c68SYan, Zheng goto out; 4282f0486c68SYan, Zheng } 4283f0486c68SYan, Zheng rw = 1; 4284f0486c68SYan, Zheng 42850af3d00bSJosef Bacik path = btrfs_alloc_path(); 42860af3d00bSJosef Bacik if (!path) { 42870af3d00bSJosef Bacik err = -ENOMEM; 42880af3d00bSJosef Bacik goto out; 42890af3d00bSJosef Bacik } 42900af3d00bSJosef Bacik 429177ab86bfSJeff Mahoney inode = lookup_free_space_inode(fs_info, rc->block_group, path); 42920af3d00bSJosef Bacik btrfs_free_path(path); 42930af3d00bSJosef Bacik 42940af3d00bSJosef Bacik if (!IS_ERR(inode)) 42951bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 42960af3d00bSJosef Bacik else 42970af3d00bSJosef Bacik ret = PTR_ERR(inode); 42980af3d00bSJosef Bacik 42990af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 43000af3d00bSJosef Bacik err = ret; 43010af3d00bSJosef Bacik goto out; 43020af3d00bSJosef Bacik } 43030af3d00bSJosef Bacik 43045d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 43055d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 43065d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 43075d4f98a2SYan Zheng rc->data_inode = NULL; 43085d4f98a2SYan Zheng goto out; 43095d4f98a2SYan Zheng } 43105d4f98a2SYan Zheng 43110b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 43125d4f98a2SYan Zheng 43139cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4314f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 43156374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 4316578def7cSFilipe Manana rc->block_group->key.objectid, 4317578def7cSFilipe Manana rc->block_group->key.offset); 43185d4f98a2SYan Zheng 43195d4f98a2SYan Zheng while (1) { 432076dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 43215d4f98a2SYan Zheng ret = relocate_block_group(rc); 432276dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 43235d4f98a2SYan Zheng if (ret < 0) { 43245d4f98a2SYan Zheng err = ret; 43253fd0a558SYan, Zheng goto out; 43265d4f98a2SYan Zheng } 43275d4f98a2SYan Zheng 43285d4f98a2SYan Zheng if (rc->extents_found == 0) 43295d4f98a2SYan Zheng break; 43305d4f98a2SYan Zheng 43310b246afaSJeff Mahoney btrfs_info(fs_info, "found %llu extents", rc->extents_found); 43325d4f98a2SYan Zheng 43335d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 43340ef8b726SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 43350ef8b726SJosef Bacik (u64)-1); 43360ef8b726SJosef Bacik if (ret) { 43370ef8b726SJosef Bacik err = ret; 43380ef8b726SJosef Bacik goto out; 43390ef8b726SJosef Bacik } 43405d4f98a2SYan Zheng invalidate_mapping_pages(rc->data_inode->i_mapping, 43415d4f98a2SYan Zheng 0, -1); 43425d4f98a2SYan Zheng rc->stage = UPDATE_DATA_PTRS; 43435d4f98a2SYan Zheng } 43445d4f98a2SYan Zheng } 43455d4f98a2SYan Zheng 43465d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 43475d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 43485d4f98a2SYan Zheng WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0); 43495d4f98a2SYan Zheng out: 4350f0486c68SYan, Zheng if (err && rw) 43512ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 43525d4f98a2SYan Zheng iput(rc->data_inode); 43535d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 43545d4f98a2SYan Zheng kfree(rc); 43555d4f98a2SYan Zheng return err; 43565d4f98a2SYan Zheng } 43575d4f98a2SYan Zheng 435876dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 435976dda93cSYan, Zheng { 43600b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 436176dda93cSYan, Zheng struct btrfs_trans_handle *trans; 436279787eaaSJeff Mahoney int ret, err; 436376dda93cSYan, Zheng 43640b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 436579787eaaSJeff Mahoney if (IS_ERR(trans)) 436679787eaaSJeff Mahoney return PTR_ERR(trans); 436776dda93cSYan, Zheng 436876dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 436976dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 437076dda93cSYan, Zheng root->root_item.drop_level = 0; 437176dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 43720b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 437376dda93cSYan, Zheng &root->root_key, &root->root_item); 437476dda93cSYan, Zheng 43753a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 437679787eaaSJeff Mahoney if (err) 437779787eaaSJeff Mahoney return err; 437879787eaaSJeff Mahoney return ret; 437976dda93cSYan, Zheng } 438076dda93cSYan, Zheng 43815d4f98a2SYan Zheng /* 43825d4f98a2SYan Zheng * recover relocation interrupted by system crash. 43835d4f98a2SYan Zheng * 43845d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 43855d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 43865d4f98a2SYan Zheng */ 43875d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 43885d4f98a2SYan Zheng { 43890b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 43905d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 43915d4f98a2SYan Zheng struct btrfs_key key; 43925d4f98a2SYan Zheng struct btrfs_root *fs_root; 43935d4f98a2SYan Zheng struct btrfs_root *reloc_root; 43945d4f98a2SYan Zheng struct btrfs_path *path; 43955d4f98a2SYan Zheng struct extent_buffer *leaf; 43965d4f98a2SYan Zheng struct reloc_control *rc = NULL; 43975d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 43985d4f98a2SYan Zheng int ret; 43995d4f98a2SYan Zheng int err = 0; 44005d4f98a2SYan Zheng 44015d4f98a2SYan Zheng path = btrfs_alloc_path(); 44025d4f98a2SYan Zheng if (!path) 44035d4f98a2SYan Zheng return -ENOMEM; 4404e4058b54SDavid Sterba path->reada = READA_BACK; 44055d4f98a2SYan Zheng 44065d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 44075d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 44085d4f98a2SYan Zheng key.offset = (u64)-1; 44095d4f98a2SYan Zheng 44105d4f98a2SYan Zheng while (1) { 44110b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 44125d4f98a2SYan Zheng path, 0, 0); 44135d4f98a2SYan Zheng if (ret < 0) { 44145d4f98a2SYan Zheng err = ret; 44155d4f98a2SYan Zheng goto out; 44165d4f98a2SYan Zheng } 44175d4f98a2SYan Zheng if (ret > 0) { 44185d4f98a2SYan Zheng if (path->slots[0] == 0) 44195d4f98a2SYan Zheng break; 44205d4f98a2SYan Zheng path->slots[0]--; 44215d4f98a2SYan Zheng } 44225d4f98a2SYan Zheng leaf = path->nodes[0]; 44235d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4424b3b4aa74SDavid Sterba btrfs_release_path(path); 44255d4f98a2SYan Zheng 44265d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 44275d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 44285d4f98a2SYan Zheng break; 44295d4f98a2SYan Zheng 4430cb517eabSMiao Xie reloc_root = btrfs_read_fs_root(root, &key); 44315d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 44325d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 44335d4f98a2SYan Zheng goto out; 44345d4f98a2SYan Zheng } 44355d4f98a2SYan Zheng 44365d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 44375d4f98a2SYan Zheng 44385d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 44390b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, 44405d4f98a2SYan Zheng reloc_root->root_key.offset); 44415d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 444276dda93cSYan, Zheng ret = PTR_ERR(fs_root); 444376dda93cSYan, Zheng if (ret != -ENOENT) { 444476dda93cSYan, Zheng err = ret; 44455d4f98a2SYan Zheng goto out; 44465d4f98a2SYan Zheng } 444779787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 444879787eaaSJeff Mahoney if (ret < 0) { 444979787eaaSJeff Mahoney err = ret; 445079787eaaSJeff Mahoney goto out; 445179787eaaSJeff Mahoney } 445276dda93cSYan, Zheng } 44535d4f98a2SYan Zheng } 44545d4f98a2SYan Zheng 44555d4f98a2SYan Zheng if (key.offset == 0) 44565d4f98a2SYan Zheng break; 44575d4f98a2SYan Zheng 44585d4f98a2SYan Zheng key.offset--; 44595d4f98a2SYan Zheng } 4460b3b4aa74SDavid Sterba btrfs_release_path(path); 44615d4f98a2SYan Zheng 44625d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 44635d4f98a2SYan Zheng goto out; 44645d4f98a2SYan Zheng 44659113493eSGu Jinxiang rc = alloc_reloc_control(); 44665d4f98a2SYan Zheng if (!rc) { 44675d4f98a2SYan Zheng err = -ENOMEM; 44685d4f98a2SYan Zheng goto out; 44695d4f98a2SYan Zheng } 44705d4f98a2SYan Zheng 44710b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 44725d4f98a2SYan Zheng 44735d4f98a2SYan Zheng set_reloc_control(rc); 44745d4f98a2SYan Zheng 44757a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 44763612b495STsutomu Itoh if (IS_ERR(trans)) { 44773612b495STsutomu Itoh unset_reloc_control(rc); 44783612b495STsutomu Itoh err = PTR_ERR(trans); 44793612b495STsutomu Itoh goto out_free; 44803612b495STsutomu Itoh } 44813fd0a558SYan, Zheng 44823fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 44833fd0a558SYan, Zheng 44845d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 44855d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 44865d4f98a2SYan Zheng struct btrfs_root, root_list); 44875d4f98a2SYan Zheng list_del(&reloc_root->root_list); 44885d4f98a2SYan Zheng 44895d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 44905d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 44915d4f98a2SYan Zheng &rc->reloc_roots); 44925d4f98a2SYan Zheng continue; 44935d4f98a2SYan Zheng } 44945d4f98a2SYan Zheng 44950b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, reloc_root->root_key.offset); 449679787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 449779787eaaSJeff Mahoney err = PTR_ERR(fs_root); 449879787eaaSJeff Mahoney goto out_free; 449979787eaaSJeff Mahoney } 45005d4f98a2SYan Zheng 4501ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 450279787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 45035d4f98a2SYan Zheng fs_root->reloc_root = reloc_root; 45045d4f98a2SYan Zheng } 45055d4f98a2SYan Zheng 45063a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 450779787eaaSJeff Mahoney if (err) 450879787eaaSJeff Mahoney goto out_free; 45095d4f98a2SYan Zheng 45105d4f98a2SYan Zheng merge_reloc_roots(rc); 45115d4f98a2SYan Zheng 45125d4f98a2SYan Zheng unset_reloc_control(rc); 45135d4f98a2SYan Zheng 45147a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 451562b99540SQu Wenruo if (IS_ERR(trans)) { 45163612b495STsutomu Itoh err = PTR_ERR(trans); 451762b99540SQu Wenruo goto out_free; 451862b99540SQu Wenruo } 45193a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 4520d2311e69SQu Wenruo 4521d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4522d2311e69SQu Wenruo if (ret < 0 && !err) 4523d2311e69SQu Wenruo err = ret; 45243612b495STsutomu Itoh out_free: 45255d4f98a2SYan Zheng kfree(rc); 45263612b495STsutomu Itoh out: 4527aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4528aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4529aca1bba6SLiu Bo 45305d4f98a2SYan Zheng btrfs_free_path(path); 45315d4f98a2SYan Zheng 45325d4f98a2SYan Zheng if (err == 0) { 45335d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 45340b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 45355d4f98a2SYan Zheng if (IS_ERR(fs_root)) 45365d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4537d7ce5843SMiao Xie else 453866b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 45395d4f98a2SYan Zheng } 45405d4f98a2SYan Zheng return err; 45415d4f98a2SYan Zheng } 45425d4f98a2SYan Zheng 45435d4f98a2SYan Zheng /* 45445d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 45455d4f98a2SYan Zheng * 45465d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 45475d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 45485d4f98a2SYan Zheng */ 45495d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 45505d4f98a2SYan Zheng { 45510b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 45525d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 45535d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 45545d4f98a2SYan Zheng int ret; 45555d4f98a2SYan Zheng u64 disk_bytenr; 45564577b014SJosef Bacik u64 new_bytenr; 45575d4f98a2SYan Zheng LIST_HEAD(list); 45585d4f98a2SYan Zheng 45595d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 45605d4f98a2SYan Zheng BUG_ON(ordered->file_offset != file_pos || ordered->len != len); 45615d4f98a2SYan Zheng 45625d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 45630b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4564a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 456579787eaaSJeff Mahoney if (ret) 456679787eaaSJeff Mahoney goto out; 45675d4f98a2SYan Zheng 45685d4f98a2SYan Zheng while (!list_empty(&list)) { 45695d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 45705d4f98a2SYan Zheng list_del_init(&sums->list); 45715d4f98a2SYan Zheng 45724577b014SJosef Bacik /* 45734577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 45744577b014SJosef Bacik * We need to do this because we will read in entire prealloc 45754577b014SJosef Bacik * extents but we may have written to say the middle of the 45764577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 45774577b014SJosef Bacik * the right disk offset. 45784577b014SJosef Bacik * 45794577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 45804577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 45814577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 45824577b014SJosef Bacik * disk length. 45834577b014SJosef Bacik */ 45844577b014SJosef Bacik new_bytenr = ordered->start + (sums->bytenr - disk_bytenr); 45854577b014SJosef Bacik sums->bytenr = new_bytenr; 45865d4f98a2SYan Zheng 45875d4f98a2SYan Zheng btrfs_add_ordered_sum(inode, ordered, sums); 45885d4f98a2SYan Zheng } 458979787eaaSJeff Mahoney out: 45905d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4591411fc6bcSAndi Kleen return ret; 45925d4f98a2SYan Zheng } 45933fd0a558SYan, Zheng 459483d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 45953fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 45963fd0a558SYan, Zheng struct extent_buffer *cow) 45973fd0a558SYan, Zheng { 45980b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 45993fd0a558SYan, Zheng struct reloc_control *rc; 46003fd0a558SYan, Zheng struct backref_node *node; 46013fd0a558SYan, Zheng int first_cow = 0; 46023fd0a558SYan, Zheng int level; 460383d4cfd4SJosef Bacik int ret = 0; 46043fd0a558SYan, Zheng 46050b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 46063fd0a558SYan, Zheng if (!rc) 460783d4cfd4SJosef Bacik return 0; 46083fd0a558SYan, Zheng 46093fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 46103fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 46113fd0a558SYan, Zheng 4612c974c464SWang Shilong if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 4613c974c464SWang Shilong if (buf == root->node) 4614c974c464SWang Shilong __update_reloc_root(root, cow->start); 4615c974c464SWang Shilong } 4616c974c464SWang Shilong 46173fd0a558SYan, Zheng level = btrfs_header_level(buf); 46183fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 46193fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 46203fd0a558SYan, Zheng first_cow = 1; 46213fd0a558SYan, Zheng 46223fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 46233fd0a558SYan, Zheng rc->create_reloc_tree) { 46243fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 46253fd0a558SYan, Zheng 46263fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 46273fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 46283fd0a558SYan, Zheng node->new_bytenr != buf->start); 46293fd0a558SYan, Zheng 46303fd0a558SYan, Zheng drop_node_buffer(node); 46313fd0a558SYan, Zheng extent_buffer_get(cow); 46323fd0a558SYan, Zheng node->eb = cow; 46333fd0a558SYan, Zheng node->new_bytenr = cow->start; 46343fd0a558SYan, Zheng 46353fd0a558SYan, Zheng if (!node->pending) { 46363fd0a558SYan, Zheng list_move_tail(&node->list, 46373fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 46383fd0a558SYan, Zheng node->pending = 1; 46393fd0a558SYan, Zheng } 46403fd0a558SYan, Zheng 46413fd0a558SYan, Zheng if (first_cow) 46423fd0a558SYan, Zheng __mark_block_processed(rc, node); 46433fd0a558SYan, Zheng 46443fd0a558SYan, Zheng if (first_cow && level > 0) 46453fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 46463fd0a558SYan, Zheng } 46473fd0a558SYan, Zheng 464883d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 46493fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 465083d4cfd4SJosef Bacik return ret; 46513fd0a558SYan, Zheng } 46523fd0a558SYan, Zheng 46533fd0a558SYan, Zheng /* 46543fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 465501327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 46563fd0a558SYan, Zheng */ 4657147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 46583fd0a558SYan, Zheng u64 *bytes_to_reserve) 46593fd0a558SYan, Zheng { 46603fd0a558SYan, Zheng struct btrfs_root *root; 46613fd0a558SYan, Zheng struct reloc_control *rc; 46623fd0a558SYan, Zheng 46633fd0a558SYan, Zheng root = pending->root; 46643fd0a558SYan, Zheng if (!root->reloc_root) 46653fd0a558SYan, Zheng return; 46663fd0a558SYan, Zheng 46673fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 46683fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 46693fd0a558SYan, Zheng return; 46703fd0a558SYan, Zheng 46713fd0a558SYan, Zheng root = root->reloc_root; 46723fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 46733fd0a558SYan, Zheng /* 46743fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 46753fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 46763fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 46773fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 46783fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 46793fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 46803fd0a558SYan, Zheng * tree may use more space than it frees. so we need 46813fd0a558SYan, Zheng * reserve extra space. 46823fd0a558SYan, Zheng */ 46833fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 46843fd0a558SYan, Zheng } 46853fd0a558SYan, Zheng 46863fd0a558SYan, Zheng /* 46873fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 46883fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 46893fd0a558SYan, Zheng */ 469049b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 46913fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 46923fd0a558SYan, Zheng { 46933fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 46943fd0a558SYan, Zheng struct btrfs_root *reloc_root; 46953fd0a558SYan, Zheng struct btrfs_root *new_root; 46963fd0a558SYan, Zheng struct reloc_control *rc; 46973fd0a558SYan, Zheng int ret; 46983fd0a558SYan, Zheng 46993fd0a558SYan, Zheng if (!root->reloc_root) 470049b25e05SJeff Mahoney return 0; 47013fd0a558SYan, Zheng 47023fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 47033fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 47043fd0a558SYan, Zheng 47053fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 47063fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 47073fd0a558SYan, Zheng rc->block_rsv, 47083a584174SLu Fengqi rc->nodes_relocated, true); 470949b25e05SJeff Mahoney if (ret) 471049b25e05SJeff Mahoney return ret; 47113fd0a558SYan, Zheng } 47123fd0a558SYan, Zheng 47133fd0a558SYan, Zheng new_root = pending->snap; 47143fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 47153fd0a558SYan, Zheng new_root->root_key.objectid); 471649b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 471749b25e05SJeff Mahoney return PTR_ERR(reloc_root); 47183fd0a558SYan, Zheng 4719ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4720ffd7b339SJeff Mahoney BUG_ON(ret < 0); 47213fd0a558SYan, Zheng new_root->reloc_root = reloc_root; 47223fd0a558SYan, Zheng 472349b25e05SJeff Mahoney if (rc->create_reloc_tree) 47243fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 472549b25e05SJeff Mahoney return ret; 47263fd0a558SYan, Zheng } 4727