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++) { 164682fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 164782fa113fSQu Wenruo 16485d4f98a2SYan Zheng cond_resched(); 16495d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 16505d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 16515d4f98a2SYan Zheng continue; 16525d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 16535d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 16545d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 16555d4f98a2SYan Zheng continue; 16565d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16575d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 16585d4f98a2SYan Zheng if (bytenr == 0) 16595d4f98a2SYan Zheng continue; 16605d4f98a2SYan Zheng if (!in_block_group(bytenr, rc->block_group)) 16615d4f98a2SYan Zheng continue; 16625d4f98a2SYan Zheng 16635d4f98a2SYan Zheng /* 16645d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 16655d4f98a2SYan Zheng * to complete and drop the extent cache 16665d4f98a2SYan Zheng */ 16675d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 16685d4f98a2SYan Zheng if (first) { 16695d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16705d4f98a2SYan Zheng first = 0; 16714a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 16723fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 16735d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16745d4f98a2SYan Zheng } 16754a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 16765d4f98a2SYan Zheng end = key.offset + 16775d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 16785d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 16790b246afaSJeff Mahoney fs_info->sectorsize)); 16800b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 16815d4f98a2SYan Zheng end--; 16825d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1683d0082371SJeff Mahoney key.offset, end); 16845d4f98a2SYan Zheng if (!ret) 16855d4f98a2SYan Zheng continue; 16865d4f98a2SYan Zheng 1687dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1688dcdbc059SNikolay Borisov key.offset, end, 1); 16895d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1690d0082371SJeff Mahoney key.offset, end); 16915d4f98a2SYan Zheng } 16925d4f98a2SYan Zheng } 16935d4f98a2SYan Zheng 16945d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 16955d4f98a2SYan Zheng bytenr, num_bytes); 169683d4cfd4SJosef Bacik if (ret) { 169783d4cfd4SJosef Bacik /* 169883d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 169983d4cfd4SJosef Bacik * in the file extent yet. 170083d4cfd4SJosef Bacik */ 170183d4cfd4SJosef Bacik break; 17023fd0a558SYan, Zheng } 17035d4f98a2SYan Zheng 17045d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 17055d4f98a2SYan Zheng dirty = 1; 17065d4f98a2SYan Zheng 17075d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 170882fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 170982fa113fSQu Wenruo num_bytes, parent); 171082fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 171182fa113fSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1712b06c4bf5SFilipe Manana key.objectid, key.offset); 171382fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 171483d4cfd4SJosef Bacik if (ret) { 171566642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 171683d4cfd4SJosef Bacik break; 171783d4cfd4SJosef Bacik } 17185d4f98a2SYan Zheng 1719ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, bytenr, 1720ffd4bb2aSQu Wenruo num_bytes, parent); 1721ffd4bb2aSQu Wenruo ref.real_root = root->root_key.objectid; 1722ffd4bb2aSQu Wenruo btrfs_init_data_ref(&ref, btrfs_header_owner(leaf), 1723b06c4bf5SFilipe Manana key.objectid, key.offset); 1724ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 172583d4cfd4SJosef Bacik if (ret) { 172666642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 172783d4cfd4SJosef Bacik break; 172883d4cfd4SJosef Bacik } 17295d4f98a2SYan Zheng } 17305d4f98a2SYan Zheng if (dirty) 17315d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 17323fd0a558SYan, Zheng if (inode) 17333fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 173483d4cfd4SJosef Bacik return ret; 17355d4f98a2SYan Zheng } 17365d4f98a2SYan Zheng 17375d4f98a2SYan Zheng static noinline_for_stack 17385d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 17395d4f98a2SYan Zheng struct btrfs_path *path, int level) 17405d4f98a2SYan Zheng { 17415d4f98a2SYan Zheng struct btrfs_disk_key key1; 17425d4f98a2SYan Zheng struct btrfs_disk_key key2; 17435d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 17445d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 17455d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 17465d4f98a2SYan Zheng } 17475d4f98a2SYan Zheng 17485d4f98a2SYan Zheng /* 17495d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 17505d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 17515d4f98a2SYan Zheng * reloc tree was create can be replaced. 17525d4f98a2SYan Zheng * 17535d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 17545d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 17555d4f98a2SYan Zheng * errors, a negative error number is returned. 17565d4f98a2SYan Zheng */ 17573fd0a558SYan, Zheng static noinline_for_stack 17583d0174f7SQu Wenruo int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, 17595d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 17605d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 17615d4f98a2SYan Zheng int lowest_level, int max_level) 17625d4f98a2SYan Zheng { 17630b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 17645d4f98a2SYan Zheng struct extent_buffer *eb; 17655d4f98a2SYan Zheng struct extent_buffer *parent; 176682fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 17675d4f98a2SYan Zheng struct btrfs_key key; 17685d4f98a2SYan Zheng u64 old_bytenr; 17695d4f98a2SYan Zheng u64 new_bytenr; 17705d4f98a2SYan Zheng u64 old_ptr_gen; 17715d4f98a2SYan Zheng u64 new_ptr_gen; 17725d4f98a2SYan Zheng u64 last_snapshot; 17735d4f98a2SYan Zheng u32 blocksize; 17743fd0a558SYan, Zheng int cow = 0; 17755d4f98a2SYan Zheng int level; 17765d4f98a2SYan Zheng int ret; 17775d4f98a2SYan Zheng int slot; 17785d4f98a2SYan Zheng 17795d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 17805d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 17815d4f98a2SYan Zheng 17825d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 17833fd0a558SYan, Zheng again: 17845d4f98a2SYan Zheng slot = path->slots[lowest_level]; 17855d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 17865d4f98a2SYan Zheng 17875d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 17888bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 17895d4f98a2SYan Zheng level = btrfs_header_level(eb); 17905d4f98a2SYan Zheng 17915d4f98a2SYan Zheng if (level < lowest_level) { 17925d4f98a2SYan Zheng btrfs_tree_unlock(eb); 17935d4f98a2SYan Zheng free_extent_buffer(eb); 17945d4f98a2SYan Zheng return 0; 17955d4f98a2SYan Zheng } 17965d4f98a2SYan Zheng 17973fd0a558SYan, Zheng if (cow) { 17985d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 17995d4f98a2SYan Zheng BUG_ON(ret); 18003fd0a558SYan, Zheng } 18018bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 18025d4f98a2SYan Zheng 18035d4f98a2SYan Zheng if (next_key) { 18045d4f98a2SYan Zheng next_key->objectid = (u64)-1; 18055d4f98a2SYan Zheng next_key->type = (u8)-1; 18065d4f98a2SYan Zheng next_key->offset = (u64)-1; 18075d4f98a2SYan Zheng } 18085d4f98a2SYan Zheng 18095d4f98a2SYan Zheng parent = eb; 18105d4f98a2SYan Zheng while (1) { 1811581c1760SQu Wenruo struct btrfs_key first_key; 1812581c1760SQu Wenruo 18135d4f98a2SYan Zheng level = btrfs_header_level(parent); 18145d4f98a2SYan Zheng BUG_ON(level < lowest_level); 18155d4f98a2SYan Zheng 18165d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 1817cbca7d59SFilipe Manana if (ret < 0) 1818cbca7d59SFilipe Manana break; 18195d4f98a2SYan Zheng if (ret && slot > 0) 18205d4f98a2SYan Zheng slot--; 18215d4f98a2SYan Zheng 18225d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 18235d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 18245d4f98a2SYan Zheng 18255d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 18260b246afaSJeff Mahoney blocksize = fs_info->nodesize; 18275d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 182817515f1bSQu Wenruo btrfs_node_key_to_cpu(parent, &first_key, slot); 18295d4f98a2SYan Zheng 18305d4f98a2SYan Zheng if (level <= max_level) { 18315d4f98a2SYan Zheng eb = path->nodes[level]; 18325d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 18335d4f98a2SYan Zheng path->slots[level]); 18345d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 18355d4f98a2SYan Zheng path->slots[level]); 18365d4f98a2SYan Zheng } else { 18375d4f98a2SYan Zheng new_bytenr = 0; 18385d4f98a2SYan Zheng new_ptr_gen = 0; 18395d4f98a2SYan Zheng } 18405d4f98a2SYan Zheng 1841fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 18425d4f98a2SYan Zheng ret = level; 18435d4f98a2SYan Zheng break; 18445d4f98a2SYan Zheng } 18455d4f98a2SYan Zheng 18465d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 18475d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 18483fd0a558SYan, Zheng if (level <= lowest_level) { 18495d4f98a2SYan Zheng ret = 0; 18505d4f98a2SYan Zheng break; 18515d4f98a2SYan Zheng } 18525d4f98a2SYan Zheng 1853581c1760SQu Wenruo eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen, 1854581c1760SQu Wenruo level - 1, &first_key); 185564c043deSLiu Bo if (IS_ERR(eb)) { 185664c043deSLiu Bo ret = PTR_ERR(eb); 1857264813acSLiu Bo break; 185864c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 185964c043deSLiu Bo ret = -EIO; 1860416bc658SJosef Bacik free_extent_buffer(eb); 1861379cde74SStefan Behrens break; 1862416bc658SJosef Bacik } 18635d4f98a2SYan Zheng btrfs_tree_lock(eb); 18643fd0a558SYan, Zheng if (cow) { 18655d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 18665d4f98a2SYan Zheng slot, &eb); 18675d4f98a2SYan Zheng BUG_ON(ret); 18685d4f98a2SYan Zheng } 18698bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 18705d4f98a2SYan Zheng 18715d4f98a2SYan Zheng btrfs_tree_unlock(parent); 18725d4f98a2SYan Zheng free_extent_buffer(parent); 18735d4f98a2SYan Zheng 18745d4f98a2SYan Zheng parent = eb; 18755d4f98a2SYan Zheng continue; 18765d4f98a2SYan Zheng } 18775d4f98a2SYan Zheng 18783fd0a558SYan, Zheng if (!cow) { 18793fd0a558SYan, Zheng btrfs_tree_unlock(parent); 18803fd0a558SYan, Zheng free_extent_buffer(parent); 18813fd0a558SYan, Zheng cow = 1; 18823fd0a558SYan, Zheng goto again; 18833fd0a558SYan, Zheng } 18843fd0a558SYan, Zheng 18855d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 18865d4f98a2SYan Zheng path->slots[level]); 1887b3b4aa74SDavid Sterba btrfs_release_path(path); 18885d4f98a2SYan Zheng 18895d4f98a2SYan Zheng path->lowest_level = level; 18905d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 18915d4f98a2SYan Zheng path->lowest_level = 0; 18925d4f98a2SYan Zheng BUG_ON(ret); 18935d4f98a2SYan Zheng 18945d4f98a2SYan Zheng /* 1895824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 1896824d8dffSQu Wenruo * 1897824d8dffSQu Wenruo * We must trace both trees. 1898824d8dffSQu Wenruo * 1) Tree reloc subtree 1899824d8dffSQu Wenruo * If not traced, we will leak data numbers 1900824d8dffSQu Wenruo * 2) Fs subtree 1901824d8dffSQu Wenruo * If not traced, we will double count old data 1902f616f5cdSQu Wenruo * 1903f616f5cdSQu Wenruo * We don't scan the subtree right now, but only record 1904f616f5cdSQu Wenruo * the swapped tree blocks. 1905f616f5cdSQu Wenruo * The real subtree rescan is delayed until we have new 1906f616f5cdSQu Wenruo * CoW on the subtree root node before transaction commit. 1907824d8dffSQu Wenruo */ 1908370a11b8SQu Wenruo ret = btrfs_qgroup_add_swapped_blocks(trans, dest, 1909370a11b8SQu Wenruo rc->block_group, parent, slot, 1910370a11b8SQu Wenruo path->nodes[level], path->slots[level], 1911370a11b8SQu Wenruo last_snapshot); 1912370a11b8SQu Wenruo if (ret < 0) 1913370a11b8SQu Wenruo break; 1914824d8dffSQu Wenruo /* 19155d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 19165d4f98a2SYan Zheng */ 19175d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 19185d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 19195d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 19205d4f98a2SYan Zheng 19215d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 19225d4f98a2SYan Zheng path->slots[level], old_bytenr); 19235d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 19245d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 19255d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 19265d4f98a2SYan Zheng 192782fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, old_bytenr, 192882fa113fSQu Wenruo blocksize, path->nodes[level]->start); 192982fa113fSQu Wenruo ref.skip_qgroup = true; 193082fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 193182fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 19325d4f98a2SYan Zheng BUG_ON(ret); 193382fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, new_bytenr, 193482fa113fSQu Wenruo blocksize, 0); 193582fa113fSQu Wenruo ref.skip_qgroup = true; 193682fa113fSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 193782fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 19385d4f98a2SYan Zheng BUG_ON(ret); 19395d4f98a2SYan Zheng 1940ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, new_bytenr, 1941ffd4bb2aSQu Wenruo blocksize, path->nodes[level]->start); 1942ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, src->root_key.objectid); 1943ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 1944ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 19455d4f98a2SYan Zheng BUG_ON(ret); 19465d4f98a2SYan Zheng 1947ffd4bb2aSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, old_bytenr, 1948ffd4bb2aSQu Wenruo blocksize, 0); 1949ffd4bb2aSQu Wenruo btrfs_init_tree_ref(&ref, level - 1, dest->root_key.objectid); 1950ffd4bb2aSQu Wenruo ref.skip_qgroup = true; 1951ffd4bb2aSQu Wenruo ret = btrfs_free_extent(trans, &ref); 19525d4f98a2SYan Zheng BUG_ON(ret); 19535d4f98a2SYan Zheng 19545d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 19555d4f98a2SYan Zheng 19565d4f98a2SYan Zheng ret = level; 19575d4f98a2SYan Zheng break; 19585d4f98a2SYan Zheng } 19595d4f98a2SYan Zheng btrfs_tree_unlock(parent); 19605d4f98a2SYan Zheng free_extent_buffer(parent); 19615d4f98a2SYan Zheng return ret; 19625d4f98a2SYan Zheng } 19635d4f98a2SYan Zheng 19645d4f98a2SYan Zheng /* 19655d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 19665d4f98a2SYan Zheng */ 19675d4f98a2SYan Zheng static noinline_for_stack 19685d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 19695d4f98a2SYan Zheng int *level) 19705d4f98a2SYan Zheng { 19715d4f98a2SYan Zheng struct extent_buffer *eb; 19725d4f98a2SYan Zheng int i; 19735d4f98a2SYan Zheng u64 last_snapshot; 19745d4f98a2SYan Zheng u32 nritems; 19755d4f98a2SYan Zheng 19765d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19775d4f98a2SYan Zheng 19785d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 19795d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19805d4f98a2SYan Zheng path->nodes[i] = NULL; 19815d4f98a2SYan Zheng } 19825d4f98a2SYan Zheng 19835d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 19845d4f98a2SYan Zheng eb = path->nodes[i]; 19855d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 19865d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 19875d4f98a2SYan Zheng path->slots[i]++; 19885d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 19895d4f98a2SYan Zheng last_snapshot) 19905d4f98a2SYan Zheng continue; 19915d4f98a2SYan Zheng 19925d4f98a2SYan Zheng *level = i; 19935d4f98a2SYan Zheng return 0; 19945d4f98a2SYan Zheng } 19955d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19965d4f98a2SYan Zheng path->nodes[i] = NULL; 19975d4f98a2SYan Zheng } 19985d4f98a2SYan Zheng return 1; 19995d4f98a2SYan Zheng } 20005d4f98a2SYan Zheng 20015d4f98a2SYan Zheng /* 20025d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 20035d4f98a2SYan Zheng */ 20045d4f98a2SYan Zheng static noinline_for_stack 20055d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 20065d4f98a2SYan Zheng int *level) 20075d4f98a2SYan Zheng { 20082ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 20095d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 20105d4f98a2SYan Zheng int i; 20115d4f98a2SYan Zheng u64 bytenr; 20125d4f98a2SYan Zheng u64 ptr_gen = 0; 20135d4f98a2SYan Zheng u64 last_snapshot; 20145d4f98a2SYan Zheng u32 nritems; 20155d4f98a2SYan Zheng 20165d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 20175d4f98a2SYan Zheng 20185d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 2019581c1760SQu Wenruo struct btrfs_key first_key; 2020581c1760SQu Wenruo 20215d4f98a2SYan Zheng eb = path->nodes[i]; 20225d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 20235d4f98a2SYan Zheng while (path->slots[i] < nritems) { 20245d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 20255d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 20265d4f98a2SYan Zheng break; 20275d4f98a2SYan Zheng path->slots[i]++; 20285d4f98a2SYan Zheng } 20295d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 20305d4f98a2SYan Zheng if (i == *level) 20315d4f98a2SYan Zheng break; 20325d4f98a2SYan Zheng *level = i + 1; 20335d4f98a2SYan Zheng return 0; 20345d4f98a2SYan Zheng } 20355d4f98a2SYan Zheng if (i == 1) { 20365d4f98a2SYan Zheng *level = i; 20375d4f98a2SYan Zheng return 0; 20385d4f98a2SYan Zheng } 20395d4f98a2SYan Zheng 20405d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2041581c1760SQu Wenruo btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); 2042581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1, 2043581c1760SQu Wenruo &first_key); 204464c043deSLiu Bo if (IS_ERR(eb)) { 204564c043deSLiu Bo return PTR_ERR(eb); 204664c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2047416bc658SJosef Bacik free_extent_buffer(eb); 2048416bc658SJosef Bacik return -EIO; 2049416bc658SJosef Bacik } 20505d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 20515d4f98a2SYan Zheng path->nodes[i - 1] = eb; 20525d4f98a2SYan Zheng path->slots[i - 1] = 0; 20535d4f98a2SYan Zheng } 20545d4f98a2SYan Zheng return 1; 20555d4f98a2SYan Zheng } 20565d4f98a2SYan Zheng 20575d4f98a2SYan Zheng /* 20585d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 20595d4f98a2SYan Zheng * [min_key, max_key) 20605d4f98a2SYan Zheng */ 20615d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 20625d4f98a2SYan Zheng struct btrfs_key *min_key, 20635d4f98a2SYan Zheng struct btrfs_key *max_key) 20645d4f98a2SYan Zheng { 20650b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 20665d4f98a2SYan Zheng struct inode *inode = NULL; 20675d4f98a2SYan Zheng u64 objectid; 20685d4f98a2SYan Zheng u64 start, end; 206933345d01SLi Zefan u64 ino; 20705d4f98a2SYan Zheng 20715d4f98a2SYan Zheng objectid = min_key->objectid; 20725d4f98a2SYan Zheng while (1) { 20735d4f98a2SYan Zheng cond_resched(); 20745d4f98a2SYan Zheng iput(inode); 20755d4f98a2SYan Zheng 20765d4f98a2SYan Zheng if (objectid > max_key->objectid) 20775d4f98a2SYan Zheng break; 20785d4f98a2SYan Zheng 20795d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 20805d4f98a2SYan Zheng if (!inode) 20815d4f98a2SYan Zheng break; 20824a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 20835d4f98a2SYan Zheng 208433345d01SLi Zefan if (ino > max_key->objectid) { 20855d4f98a2SYan Zheng iput(inode); 20865d4f98a2SYan Zheng break; 20875d4f98a2SYan Zheng } 20885d4f98a2SYan Zheng 208933345d01SLi Zefan objectid = ino + 1; 20905d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 20915d4f98a2SYan Zheng continue; 20925d4f98a2SYan Zheng 209333345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 20945d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 20955d4f98a2SYan Zheng continue; 20965d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 20975d4f98a2SYan Zheng start = 0; 20985d4f98a2SYan Zheng else { 20995d4f98a2SYan Zheng start = min_key->offset; 21000b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 21015d4f98a2SYan Zheng } 21025d4f98a2SYan Zheng } else { 21035d4f98a2SYan Zheng start = 0; 21045d4f98a2SYan Zheng } 21055d4f98a2SYan Zheng 210633345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 21075d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 21085d4f98a2SYan Zheng continue; 21095d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 21105d4f98a2SYan Zheng end = (u64)-1; 21115d4f98a2SYan Zheng } else { 21125d4f98a2SYan Zheng if (max_key->offset == 0) 21135d4f98a2SYan Zheng continue; 21145d4f98a2SYan Zheng end = max_key->offset; 21150b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 21165d4f98a2SYan Zheng end--; 21175d4f98a2SYan Zheng } 21185d4f98a2SYan Zheng } else { 21195d4f98a2SYan Zheng end = (u64)-1; 21205d4f98a2SYan Zheng } 21215d4f98a2SYan Zheng 21225d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2123d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 2124dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 2125d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 21265d4f98a2SYan Zheng } 21275d4f98a2SYan Zheng return 0; 21285d4f98a2SYan Zheng } 21295d4f98a2SYan Zheng 21305d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 21315d4f98a2SYan Zheng struct btrfs_key *key) 21325d4f98a2SYan Zheng 21335d4f98a2SYan Zheng { 21345d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 21355d4f98a2SYan Zheng if (!path->nodes[level]) 21365d4f98a2SYan Zheng break; 21375d4f98a2SYan Zheng if (path->slots[level] + 1 < 21385d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 21395d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 21405d4f98a2SYan Zheng path->slots[level] + 1); 21415d4f98a2SYan Zheng return 0; 21425d4f98a2SYan Zheng } 21435d4f98a2SYan Zheng level++; 21445d4f98a2SYan Zheng } 21455d4f98a2SYan Zheng return 1; 21465d4f98a2SYan Zheng } 21475d4f98a2SYan Zheng 21485d4f98a2SYan Zheng /* 2149d2311e69SQu Wenruo * Insert current subvolume into reloc_control::dirty_subvol_roots 2150d2311e69SQu Wenruo */ 2151d2311e69SQu Wenruo static void insert_dirty_subvol(struct btrfs_trans_handle *trans, 2152d2311e69SQu Wenruo struct reloc_control *rc, 2153d2311e69SQu Wenruo struct btrfs_root *root) 2154d2311e69SQu Wenruo { 2155d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2156d2311e69SQu Wenruo struct btrfs_root_item *reloc_root_item; 2157d2311e69SQu Wenruo 2158d2311e69SQu Wenruo /* @root must be a subvolume tree root with a valid reloc tree */ 2159d2311e69SQu Wenruo ASSERT(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 2160d2311e69SQu Wenruo ASSERT(reloc_root); 2161d2311e69SQu Wenruo 2162d2311e69SQu Wenruo reloc_root_item = &reloc_root->root_item; 2163d2311e69SQu Wenruo memset(&reloc_root_item->drop_progress, 0, 2164d2311e69SQu Wenruo sizeof(reloc_root_item->drop_progress)); 2165d2311e69SQu Wenruo reloc_root_item->drop_level = 0; 2166d2311e69SQu Wenruo btrfs_set_root_refs(reloc_root_item, 0); 2167d2311e69SQu Wenruo btrfs_update_reloc_root(trans, root); 2168d2311e69SQu Wenruo 2169d2311e69SQu Wenruo if (list_empty(&root->reloc_dirty_list)) { 2170d2311e69SQu Wenruo btrfs_grab_fs_root(root); 2171d2311e69SQu Wenruo list_add_tail(&root->reloc_dirty_list, &rc->dirty_subvol_roots); 2172d2311e69SQu Wenruo } 2173d2311e69SQu Wenruo } 2174d2311e69SQu Wenruo 2175d2311e69SQu Wenruo static int clean_dirty_subvols(struct reloc_control *rc) 2176d2311e69SQu Wenruo { 2177d2311e69SQu Wenruo struct btrfs_root *root; 2178d2311e69SQu Wenruo struct btrfs_root *next; 2179d2311e69SQu Wenruo int ret = 0; 2180d2311e69SQu Wenruo 2181d2311e69SQu Wenruo list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, 2182d2311e69SQu Wenruo reloc_dirty_list) { 2183d2311e69SQu Wenruo struct btrfs_root *reloc_root = root->reloc_root; 2184d2311e69SQu Wenruo 2185d2311e69SQu Wenruo clear_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state); 2186d2311e69SQu Wenruo list_del_init(&root->reloc_dirty_list); 2187d2311e69SQu Wenruo root->reloc_root = NULL; 2188d2311e69SQu Wenruo if (reloc_root) { 2189d2311e69SQu Wenruo int ret2; 2190d2311e69SQu Wenruo 2191d2311e69SQu Wenruo ret2 = btrfs_drop_snapshot(reloc_root, NULL, 0, 1); 2192d2311e69SQu Wenruo if (ret2 < 0 && !ret) 2193d2311e69SQu Wenruo ret = ret2; 2194d2311e69SQu Wenruo } 2195d2311e69SQu Wenruo btrfs_put_fs_root(root); 2196d2311e69SQu Wenruo } 2197d2311e69SQu Wenruo return ret; 2198d2311e69SQu Wenruo } 2199d2311e69SQu Wenruo 2200d2311e69SQu Wenruo /* 22015d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 22025d4f98a2SYan Zheng * fs tree. 22035d4f98a2SYan Zheng */ 22045d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 22055d4f98a2SYan Zheng struct btrfs_root *root) 22065d4f98a2SYan Zheng { 22070b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 22085d4f98a2SYan Zheng struct btrfs_key key; 22095d4f98a2SYan Zheng struct btrfs_key next_key; 22109e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 22115d4f98a2SYan Zheng struct btrfs_root *reloc_root; 22125d4f98a2SYan Zheng struct btrfs_root_item *root_item; 22135d4f98a2SYan Zheng struct btrfs_path *path; 22143fd0a558SYan, Zheng struct extent_buffer *leaf; 22155d4f98a2SYan Zheng int level; 22165d4f98a2SYan Zheng int max_level; 22175d4f98a2SYan Zheng int replaced = 0; 22185d4f98a2SYan Zheng int ret; 22195d4f98a2SYan Zheng int err = 0; 22203fd0a558SYan, Zheng u32 min_reserved; 22215d4f98a2SYan Zheng 22225d4f98a2SYan Zheng path = btrfs_alloc_path(); 22235d4f98a2SYan Zheng if (!path) 22245d4f98a2SYan Zheng return -ENOMEM; 2225e4058b54SDavid Sterba path->reada = READA_FORWARD; 22265d4f98a2SYan Zheng 22275d4f98a2SYan Zheng reloc_root = root->reloc_root; 22285d4f98a2SYan Zheng root_item = &reloc_root->root_item; 22295d4f98a2SYan Zheng 22305d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 22315d4f98a2SYan Zheng level = btrfs_root_level(root_item); 22325d4f98a2SYan Zheng extent_buffer_get(reloc_root->node); 22335d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 22345d4f98a2SYan Zheng path->slots[level] = 0; 22355d4f98a2SYan Zheng } else { 22365d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 22375d4f98a2SYan Zheng 22385d4f98a2SYan Zheng level = root_item->drop_level; 22395d4f98a2SYan Zheng BUG_ON(level == 0); 22405d4f98a2SYan Zheng path->lowest_level = level; 22415d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 224233c66f43SYan Zheng path->lowest_level = 0; 22435d4f98a2SYan Zheng if (ret < 0) { 22445d4f98a2SYan Zheng btrfs_free_path(path); 22455d4f98a2SYan Zheng return ret; 22465d4f98a2SYan Zheng } 22475d4f98a2SYan Zheng 22485d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 22495d4f98a2SYan Zheng path->slots[level]); 22505d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 22515d4f98a2SYan Zheng 22525d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 22535d4f98a2SYan Zheng } 22545d4f98a2SYan Zheng 22550b246afaSJeff Mahoney min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 22565d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 22575d4f98a2SYan Zheng 22585d4f98a2SYan Zheng while (1) { 225908e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 226008e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 22613fd0a558SYan, Zheng if (ret) { 22629e6a0c52SJosef Bacik err = ret; 22639e6a0c52SJosef Bacik goto out; 22643fd0a558SYan, Zheng } 22659e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 22669e6a0c52SJosef Bacik if (IS_ERR(trans)) { 22679e6a0c52SJosef Bacik err = PTR_ERR(trans); 22689e6a0c52SJosef Bacik trans = NULL; 22699e6a0c52SJosef Bacik goto out; 22709e6a0c52SJosef Bacik } 22719e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 22723fd0a558SYan, Zheng 22733fd0a558SYan, Zheng replaced = 0; 22745d4f98a2SYan Zheng max_level = level; 22755d4f98a2SYan Zheng 22765d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 22775d4f98a2SYan Zheng if (ret < 0) { 22785d4f98a2SYan Zheng err = ret; 22795d4f98a2SYan Zheng goto out; 22805d4f98a2SYan Zheng } 22815d4f98a2SYan Zheng if (ret > 0) 22825d4f98a2SYan Zheng break; 22835d4f98a2SYan Zheng 22845d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 22855d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 22865d4f98a2SYan Zheng ret = 0; 22875d4f98a2SYan Zheng } else { 22883d0174f7SQu Wenruo ret = replace_path(trans, rc, root, reloc_root, path, 22893fd0a558SYan, Zheng &next_key, level, max_level); 22905d4f98a2SYan Zheng } 22915d4f98a2SYan Zheng if (ret < 0) { 22925d4f98a2SYan Zheng err = ret; 22935d4f98a2SYan Zheng goto out; 22945d4f98a2SYan Zheng } 22955d4f98a2SYan Zheng 22965d4f98a2SYan Zheng if (ret > 0) { 22975d4f98a2SYan Zheng level = ret; 22985d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 22995d4f98a2SYan Zheng path->slots[level]); 23005d4f98a2SYan Zheng replaced = 1; 23015d4f98a2SYan Zheng } 23025d4f98a2SYan Zheng 23035d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 23045d4f98a2SYan Zheng if (ret > 0) 23055d4f98a2SYan Zheng break; 23065d4f98a2SYan Zheng 23075d4f98a2SYan Zheng BUG_ON(level == 0); 23085d4f98a2SYan Zheng /* 23095d4f98a2SYan Zheng * save the merging progress in the drop_progress. 23105d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 23115d4f98a2SYan Zheng */ 23125d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 23135d4f98a2SYan Zheng path->slots[level]); 23145d4f98a2SYan Zheng root_item->drop_level = level; 23155d4f98a2SYan Zheng 23163a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 23179e6a0c52SJosef Bacik trans = NULL; 23185d4f98a2SYan Zheng 23192ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 23205d4f98a2SYan Zheng 23215d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 23225d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 23235d4f98a2SYan Zheng } 23245d4f98a2SYan Zheng 23255d4f98a2SYan Zheng /* 23265d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 23275d4f98a2SYan Zheng * relocated and the block is tree root. 23285d4f98a2SYan Zheng */ 23295d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 23305d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 23315d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 23325d4f98a2SYan Zheng free_extent_buffer(leaf); 23335d4f98a2SYan Zheng if (ret < 0) 23345d4f98a2SYan Zheng err = ret; 23355d4f98a2SYan Zheng out: 23365d4f98a2SYan Zheng btrfs_free_path(path); 23375d4f98a2SYan Zheng 2338d2311e69SQu Wenruo if (err == 0) 2339d2311e69SQu Wenruo insert_dirty_subvol(trans, rc, root); 23405d4f98a2SYan Zheng 23419e6a0c52SJosef Bacik if (trans) 23423a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 23435d4f98a2SYan Zheng 23442ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 23455d4f98a2SYan Zheng 23465d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 23475d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 23485d4f98a2SYan Zheng 23495d4f98a2SYan Zheng return err; 23505d4f98a2SYan Zheng } 23515d4f98a2SYan Zheng 23523fd0a558SYan, Zheng static noinline_for_stack 23533fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 23545d4f98a2SYan Zheng { 23553fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 23560b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 23573fd0a558SYan, Zheng struct btrfs_root *reloc_root; 23585d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 23593fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 23603fd0a558SYan, Zheng u64 num_bytes = 0; 23613fd0a558SYan, Zheng int ret; 23623fd0a558SYan, Zheng 23630b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 23640b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 23653fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 23660b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 23677585717fSChris Mason 23683fd0a558SYan, Zheng again: 23693fd0a558SYan, Zheng if (!err) { 23703fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 237108e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 237208e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 23733fd0a558SYan, Zheng if (ret) 23743fd0a558SYan, Zheng err = ret; 23753fd0a558SYan, Zheng } 23763fd0a558SYan, Zheng 23777a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 23783612b495STsutomu Itoh if (IS_ERR(trans)) { 23793612b495STsutomu Itoh if (!err) 23802ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 23812ff7e61eSJeff Mahoney num_bytes); 23823612b495STsutomu Itoh return PTR_ERR(trans); 23833612b495STsutomu Itoh } 23843fd0a558SYan, Zheng 23853fd0a558SYan, Zheng if (!err) { 23863fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 23873a45bb20SJeff Mahoney btrfs_end_transaction(trans); 23882ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 23892ff7e61eSJeff Mahoney num_bytes); 23903fd0a558SYan, Zheng goto again; 23913fd0a558SYan, Zheng } 23923fd0a558SYan, Zheng } 23933fd0a558SYan, Zheng 23943fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 23953fd0a558SYan, Zheng 23963fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 23973fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 23983fd0a558SYan, Zheng struct btrfs_root, root_list); 23993fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 24003fd0a558SYan, Zheng 24010b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 24023fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 24033fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 24043fd0a558SYan, Zheng 24053fd0a558SYan, Zheng /* 24063fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 24073fd0a558SYan, Zheng * knows it should resumes merging 24083fd0a558SYan, Zheng */ 24093fd0a558SYan, Zheng if (!err) 24103fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 24113fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 24123fd0a558SYan, Zheng 24133fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 24143fd0a558SYan, Zheng } 24153fd0a558SYan, Zheng 24163fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 24173fd0a558SYan, Zheng 24183fd0a558SYan, Zheng if (!err) 24193a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 24203fd0a558SYan, Zheng else 24213a45bb20SJeff Mahoney btrfs_end_transaction(trans); 24223fd0a558SYan, Zheng return err; 24233fd0a558SYan, Zheng } 24243fd0a558SYan, Zheng 24253fd0a558SYan, Zheng static noinline_for_stack 2426aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2427aca1bba6SLiu Bo { 2428aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2429aca1bba6SLiu Bo 2430aca1bba6SLiu Bo while (!list_empty(list)) { 2431aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2432aca1bba6SLiu Bo root_list); 2433bb166d72SNaohiro Aota __del_reloc_root(reloc_root); 24346bdf131fSJosef Bacik free_extent_buffer(reloc_root->node); 24356bdf131fSJosef Bacik free_extent_buffer(reloc_root->commit_root); 24366bdf131fSJosef Bacik reloc_root->node = NULL; 24376bdf131fSJosef Bacik reloc_root->commit_root = NULL; 2438aca1bba6SLiu Bo } 2439aca1bba6SLiu Bo } 2440aca1bba6SLiu Bo 2441aca1bba6SLiu Bo static noinline_for_stack 244294404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 24433fd0a558SYan, Zheng { 24440b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 24455d4f98a2SYan Zheng struct btrfs_root *root; 24465d4f98a2SYan Zheng struct btrfs_root *reloc_root; 24473fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 24483fd0a558SYan, Zheng int found = 0; 2449aca1bba6SLiu Bo int ret = 0; 24503fd0a558SYan, Zheng again: 24513fd0a558SYan, Zheng root = rc->extent_root; 24527585717fSChris Mason 24537585717fSChris Mason /* 24547585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 24557585717fSChris Mason * we have to make sure nobody is in the middle of 24567585717fSChris Mason * adding their roots to the list while we are 24577585717fSChris Mason * doing this splice 24587585717fSChris Mason */ 24590b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 24603fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 24610b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 24625d4f98a2SYan Zheng 24633fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 24643fd0a558SYan, Zheng found = 1; 24653fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 24663fd0a558SYan, Zheng struct btrfs_root, root_list); 24675d4f98a2SYan Zheng 24685d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 24690b246afaSJeff Mahoney root = read_fs_root(fs_info, 24705d4f98a2SYan Zheng reloc_root->root_key.offset); 24715d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 24725d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 24735d4f98a2SYan Zheng 24743fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 2475b37b39cdSJosef Bacik if (ret) { 247625e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 247725e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 247825e293c2SWang Shilong &reloc_roots); 2479aca1bba6SLiu Bo goto out; 2480b37b39cdSJosef Bacik } 24813fd0a558SYan, Zheng } else { 24823fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 24833fd0a558SYan, Zheng } 24845d4f98a2SYan Zheng } 24855d4f98a2SYan Zheng 24863fd0a558SYan, Zheng if (found) { 24873fd0a558SYan, Zheng found = 0; 24883fd0a558SYan, Zheng goto again; 24895d4f98a2SYan Zheng } 2490aca1bba6SLiu Bo out: 2491aca1bba6SLiu Bo if (ret) { 24920b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2493aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2494aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2495467bb1d2SWang Shilong 2496467bb1d2SWang Shilong /* new reloc root may be added */ 24970b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2498467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 24990b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2500467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2501467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2502aca1bba6SLiu Bo } 2503aca1bba6SLiu Bo 25045d4f98a2SYan Zheng BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 25055d4f98a2SYan Zheng } 25065d4f98a2SYan Zheng 25075d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 25085d4f98a2SYan Zheng { 25095d4f98a2SYan Zheng struct tree_block *block; 25105d4f98a2SYan Zheng struct rb_node *rb_node; 25115d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 25125d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 25135d4f98a2SYan Zheng rb_erase(rb_node, blocks); 25145d4f98a2SYan Zheng kfree(block); 25155d4f98a2SYan Zheng } 25165d4f98a2SYan Zheng } 25175d4f98a2SYan Zheng 25185d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 25195d4f98a2SYan Zheng struct btrfs_root *reloc_root) 25205d4f98a2SYan Zheng { 25210b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 25225d4f98a2SYan Zheng struct btrfs_root *root; 25235d4f98a2SYan Zheng 25245d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 25255d4f98a2SYan Zheng return 0; 25265d4f98a2SYan Zheng 25270b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 25285d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 25295d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 25305d4f98a2SYan Zheng 25315d4f98a2SYan Zheng return btrfs_record_root_in_trans(trans, root); 25325d4f98a2SYan Zheng } 25335d4f98a2SYan Zheng 25343fd0a558SYan, Zheng static noinline_for_stack 25353fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 25363fd0a558SYan, Zheng struct reloc_control *rc, 25375d4f98a2SYan Zheng struct backref_node *node, 2538dc4103f9SWang Shilong struct backref_edge *edges[]) 25395d4f98a2SYan Zheng { 25405d4f98a2SYan Zheng struct backref_node *next; 25415d4f98a2SYan Zheng struct btrfs_root *root; 25423fd0a558SYan, Zheng int index = 0; 25433fd0a558SYan, Zheng 25445d4f98a2SYan Zheng next = node; 25455d4f98a2SYan Zheng while (1) { 25465d4f98a2SYan Zheng cond_resched(); 25475d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 25485d4f98a2SYan Zheng root = next->root; 25493fd0a558SYan, Zheng BUG_ON(!root); 255027cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 25515d4f98a2SYan Zheng 25525d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 25535d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 25545d4f98a2SYan Zheng break; 25555d4f98a2SYan Zheng } 25565d4f98a2SYan Zheng 25575d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 25583fd0a558SYan, Zheng root = root->reloc_root; 25593fd0a558SYan, Zheng 25603fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 25613fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 25623fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 25633fd0a558SYan, Zheng next->new_bytenr = root->node->start; 25643fd0a558SYan, Zheng next->root = root; 25653fd0a558SYan, Zheng list_add_tail(&next->list, 25663fd0a558SYan, Zheng &rc->backref_cache.changed); 25673fd0a558SYan, Zheng __mark_block_processed(rc, next); 25685d4f98a2SYan Zheng break; 25695d4f98a2SYan Zheng } 25705d4f98a2SYan Zheng 25713fd0a558SYan, Zheng WARN_ON(1); 25725d4f98a2SYan Zheng root = NULL; 25735d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 25745d4f98a2SYan Zheng if (!next || next->level <= node->level) 25755d4f98a2SYan Zheng break; 25765d4f98a2SYan Zheng } 25773fd0a558SYan, Zheng if (!root) 25783fd0a558SYan, Zheng return NULL; 25795d4f98a2SYan Zheng 25803fd0a558SYan, Zheng next = node; 25813fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 25823fd0a558SYan, Zheng while (1) { 25833fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 25843fd0a558SYan, Zheng if (--index < 0) 25853fd0a558SYan, Zheng break; 25863fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 25873fd0a558SYan, Zheng } 25885d4f98a2SYan Zheng return root; 25895d4f98a2SYan Zheng } 25905d4f98a2SYan Zheng 25913fd0a558SYan, Zheng /* 25923fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 25933fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 25943fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 25953fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 25963fd0a558SYan, Zheng */ 25975d4f98a2SYan Zheng static noinline_for_stack 2598147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 25995d4f98a2SYan Zheng { 26003fd0a558SYan, Zheng struct backref_node *next; 26013fd0a558SYan, Zheng struct btrfs_root *root; 26023fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 26035d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 26043fd0a558SYan, Zheng int index = 0; 26053fd0a558SYan, Zheng 26063fd0a558SYan, Zheng next = node; 26073fd0a558SYan, Zheng while (1) { 26083fd0a558SYan, Zheng cond_resched(); 26093fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 26103fd0a558SYan, Zheng root = next->root; 26113fd0a558SYan, Zheng BUG_ON(!root); 26123fd0a558SYan, Zheng 261325985edcSLucas De Marchi /* no other choice for non-references counted tree */ 261427cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 26153fd0a558SYan, Zheng return root; 26163fd0a558SYan, Zheng 26173fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 26183fd0a558SYan, Zheng fs_root = root; 26193fd0a558SYan, Zheng 26203fd0a558SYan, Zheng if (next != node) 26213fd0a558SYan, Zheng return NULL; 26223fd0a558SYan, Zheng 26233fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 26243fd0a558SYan, Zheng if (!next || next->level <= node->level) 26253fd0a558SYan, Zheng break; 26263fd0a558SYan, Zheng } 26273fd0a558SYan, Zheng 26283fd0a558SYan, Zheng if (!fs_root) 26293fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 26303fd0a558SYan, Zheng return fs_root; 26315d4f98a2SYan Zheng } 26325d4f98a2SYan Zheng 26335d4f98a2SYan Zheng static noinline_for_stack 26343fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 26353fd0a558SYan, Zheng struct backref_node *node, int reserve) 26365d4f98a2SYan Zheng { 26370b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 26383fd0a558SYan, Zheng struct backref_node *next = node; 26393fd0a558SYan, Zheng struct backref_edge *edge; 26403fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 26413fd0a558SYan, Zheng u64 num_bytes = 0; 26423fd0a558SYan, Zheng int index = 0; 26435d4f98a2SYan Zheng 26443fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 26453fd0a558SYan, Zheng 26463fd0a558SYan, Zheng while (next) { 26473fd0a558SYan, Zheng cond_resched(); 26485d4f98a2SYan Zheng while (1) { 26493fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 26505d4f98a2SYan Zheng break; 26515d4f98a2SYan Zheng 26520b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 26533fd0a558SYan, Zheng 26543fd0a558SYan, Zheng if (list_empty(&next->upper)) 26553fd0a558SYan, Zheng break; 26563fd0a558SYan, Zheng 26573fd0a558SYan, Zheng edge = list_entry(next->upper.next, 26583fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 26593fd0a558SYan, Zheng edges[index++] = edge; 26603fd0a558SYan, Zheng next = edge->node[UPPER]; 26615d4f98a2SYan Zheng } 26623fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 26633fd0a558SYan, Zheng } 26643fd0a558SYan, Zheng return num_bytes; 26653fd0a558SYan, Zheng } 26663fd0a558SYan, Zheng 26673fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 26683fd0a558SYan, Zheng struct reloc_control *rc, 26693fd0a558SYan, Zheng struct backref_node *node) 26703fd0a558SYan, Zheng { 26713fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2672da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 26733fd0a558SYan, Zheng u64 num_bytes; 26743fd0a558SYan, Zheng int ret; 26750647bf56SWang Shilong u64 tmp; 26763fd0a558SYan, Zheng 26773fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 26783fd0a558SYan, Zheng 26793fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 26800647bf56SWang Shilong rc->reserved_bytes += num_bytes; 26818ca17f0fSJosef Bacik 26828ca17f0fSJosef Bacik /* 26838ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 26848ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 26858ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 26868ca17f0fSJosef Bacik */ 26870647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 26888ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 26893fd0a558SYan, Zheng if (ret) { 2690da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 26910647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 26920647bf56SWang Shilong tmp <<= 1; 26930647bf56SWang Shilong /* 26940647bf56SWang Shilong * only one thread can access block_rsv at this point, 26950647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 26960647bf56SWang Shilong * we expand more reservation size here to allow enough 269752042d8eSAndrea Gelmini * space for relocation and we will return earlier in 26980647bf56SWang Shilong * enospc case. 26990647bf56SWang Shilong */ 2700da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 27010647bf56SWang Shilong RELOCATION_RESERVED_NODES; 27028ca17f0fSJosef Bacik return -EAGAIN; 27033fd0a558SYan, Zheng } 27043fd0a558SYan, Zheng 27053fd0a558SYan, Zheng return 0; 27063fd0a558SYan, Zheng } 27073fd0a558SYan, Zheng 27085d4f98a2SYan Zheng /* 27095d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 27105d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 27115d4f98a2SYan Zheng * 27125d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 27135d4f98a2SYan Zheng * in that case this function just updates pointers. 27145d4f98a2SYan Zheng */ 27155d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 27163fd0a558SYan, Zheng struct reloc_control *rc, 27175d4f98a2SYan Zheng struct backref_node *node, 27185d4f98a2SYan Zheng struct btrfs_key *key, 27195d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 27205d4f98a2SYan Zheng { 27212ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 27225d4f98a2SYan Zheng struct backref_node *upper; 27235d4f98a2SYan Zheng struct backref_edge *edge; 27245d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 27255d4f98a2SYan Zheng struct btrfs_root *root; 27265d4f98a2SYan Zheng struct extent_buffer *eb; 27275d4f98a2SYan Zheng u32 blocksize; 27285d4f98a2SYan Zheng u64 bytenr; 27295d4f98a2SYan Zheng u64 generation; 27305d4f98a2SYan Zheng int slot; 27315d4f98a2SYan Zheng int ret; 27325d4f98a2SYan Zheng int err = 0; 27335d4f98a2SYan Zheng 27345d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 27355d4f98a2SYan Zheng 27365d4f98a2SYan Zheng path->lowest_level = node->level + 1; 27373fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 27385d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 2739581c1760SQu Wenruo struct btrfs_key first_key; 274082fa113fSQu Wenruo struct btrfs_ref ref = { 0 }; 2741581c1760SQu Wenruo 27425d4f98a2SYan Zheng cond_resched(); 27435d4f98a2SYan Zheng 27445d4f98a2SYan Zheng upper = edge->node[UPPER]; 2745dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 27463fd0a558SYan, Zheng BUG_ON(!root); 27475d4f98a2SYan Zheng 27483fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 27493fd0a558SYan, Zheng if (!lowest) { 27503fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 27513fd0a558SYan, Zheng upper->level, &slot); 2752cbca7d59SFilipe Manana if (ret < 0) { 2753cbca7d59SFilipe Manana err = ret; 2754cbca7d59SFilipe Manana goto next; 2755cbca7d59SFilipe Manana } 27563fd0a558SYan, Zheng BUG_ON(ret); 27573fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 27583fd0a558SYan, Zheng if (node->eb->start == bytenr) 27593fd0a558SYan, Zheng goto next; 27603fd0a558SYan, Zheng } 27615d4f98a2SYan Zheng drop_node_buffer(upper); 27623fd0a558SYan, Zheng } 27635d4f98a2SYan Zheng 27645d4f98a2SYan Zheng if (!upper->eb) { 27655d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 27663561b9dbSLiu Bo if (ret) { 27673561b9dbSLiu Bo if (ret < 0) 27685d4f98a2SYan Zheng err = ret; 27693561b9dbSLiu Bo else 27703561b9dbSLiu Bo err = -ENOENT; 27713561b9dbSLiu Bo 27723561b9dbSLiu Bo btrfs_release_path(path); 27735d4f98a2SYan Zheng break; 27745d4f98a2SYan Zheng } 27755d4f98a2SYan Zheng 27763fd0a558SYan, Zheng if (!upper->eb) { 27773fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 27783fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 27793fd0a558SYan, Zheng } else { 27803fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 27813fd0a558SYan, Zheng } 27823fd0a558SYan, Zheng 27833fd0a558SYan, Zheng upper->locked = 1; 27843fd0a558SYan, Zheng path->locks[upper->level] = 0; 27853fd0a558SYan, Zheng 27865d4f98a2SYan Zheng slot = path->slots[upper->level]; 2787b3b4aa74SDavid Sterba btrfs_release_path(path); 27885d4f98a2SYan Zheng } else { 27895d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 27905d4f98a2SYan Zheng &slot); 2791cbca7d59SFilipe Manana if (ret < 0) { 2792cbca7d59SFilipe Manana err = ret; 2793cbca7d59SFilipe Manana goto next; 2794cbca7d59SFilipe Manana } 27955d4f98a2SYan Zheng BUG_ON(ret); 27965d4f98a2SYan Zheng } 27975d4f98a2SYan Zheng 27985d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 27993fd0a558SYan, Zheng if (lowest) { 28004547f4d8SLiu Bo if (bytenr != node->bytenr) { 28014547f4d8SLiu Bo btrfs_err(root->fs_info, 28024547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 28034547f4d8SLiu Bo bytenr, node->bytenr, slot, 28044547f4d8SLiu Bo upper->eb->start); 28054547f4d8SLiu Bo err = -EIO; 28064547f4d8SLiu Bo goto next; 28074547f4d8SLiu Bo } 28085d4f98a2SYan Zheng } else { 28093fd0a558SYan, Zheng if (node->eb->start == bytenr) 28103fd0a558SYan, Zheng goto next; 28115d4f98a2SYan Zheng } 28125d4f98a2SYan Zheng 2813da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 28145d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 2815581c1760SQu Wenruo btrfs_node_key_to_cpu(upper->eb, &first_key, slot); 2816581c1760SQu Wenruo eb = read_tree_block(fs_info, bytenr, generation, 2817581c1760SQu Wenruo upper->level - 1, &first_key); 281864c043deSLiu Bo if (IS_ERR(eb)) { 281964c043deSLiu Bo err = PTR_ERR(eb); 282064c043deSLiu Bo goto next; 282164c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2822416bc658SJosef Bacik free_extent_buffer(eb); 282397d9a8a4STsutomu Itoh err = -EIO; 282497d9a8a4STsutomu Itoh goto next; 282597d9a8a4STsutomu Itoh } 28265d4f98a2SYan Zheng btrfs_tree_lock(eb); 28278bead258SDavid Sterba btrfs_set_lock_blocking_write(eb); 28285d4f98a2SYan Zheng 28295d4f98a2SYan Zheng if (!node->eb) { 28305d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 28315d4f98a2SYan Zheng slot, &eb); 28323fd0a558SYan, Zheng btrfs_tree_unlock(eb); 28333fd0a558SYan, Zheng free_extent_buffer(eb); 28345d4f98a2SYan Zheng if (ret < 0) { 28355d4f98a2SYan Zheng err = ret; 28363fd0a558SYan, Zheng goto next; 28375d4f98a2SYan Zheng } 28383fd0a558SYan, Zheng BUG_ON(node->eb != eb); 28395d4f98a2SYan Zheng } else { 28405d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 28415d4f98a2SYan Zheng node->eb->start); 28425d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 28435d4f98a2SYan Zheng trans->transid); 28445d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 28455d4f98a2SYan Zheng 284682fa113fSQu Wenruo btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, 28475d4f98a2SYan Zheng node->eb->start, blocksize, 284882fa113fSQu Wenruo upper->eb->start); 284982fa113fSQu Wenruo ref.real_root = root->root_key.objectid; 285082fa113fSQu Wenruo btrfs_init_tree_ref(&ref, node->level, 285182fa113fSQu Wenruo btrfs_header_owner(upper->eb)); 285282fa113fSQu Wenruo ret = btrfs_inc_extent_ref(trans, &ref); 28535d4f98a2SYan Zheng BUG_ON(ret); 28545d4f98a2SYan Zheng 28555d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 28565d4f98a2SYan Zheng BUG_ON(ret); 28575d4f98a2SYan Zheng } 28583fd0a558SYan, Zheng next: 28593fd0a558SYan, Zheng if (!upper->pending) 28603fd0a558SYan, Zheng drop_node_buffer(upper); 28613fd0a558SYan, Zheng else 28623fd0a558SYan, Zheng unlock_node_buffer(upper); 28633fd0a558SYan, Zheng if (err) 28643fd0a558SYan, Zheng break; 28655d4f98a2SYan Zheng } 28663fd0a558SYan, Zheng 28673fd0a558SYan, Zheng if (!err && node->pending) { 28683fd0a558SYan, Zheng drop_node_buffer(node); 28693fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 28703fd0a558SYan, Zheng node->pending = 0; 28715d4f98a2SYan Zheng } 28723fd0a558SYan, Zheng 28735d4f98a2SYan Zheng path->lowest_level = 0; 28743fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 28755d4f98a2SYan Zheng return err; 28765d4f98a2SYan Zheng } 28775d4f98a2SYan Zheng 28785d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 28793fd0a558SYan, Zheng struct reloc_control *rc, 28805d4f98a2SYan Zheng struct backref_node *node, 28815d4f98a2SYan Zheng struct btrfs_path *path) 28825d4f98a2SYan Zheng { 28835d4f98a2SYan Zheng struct btrfs_key key; 28845d4f98a2SYan Zheng 28855d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 28863fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 28875d4f98a2SYan Zheng } 28885d4f98a2SYan Zheng 28895d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 28903fd0a558SYan, Zheng struct reloc_control *rc, 28913fd0a558SYan, Zheng struct btrfs_path *path, int err) 28925d4f98a2SYan Zheng { 28933fd0a558SYan, Zheng LIST_HEAD(list); 28943fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 28955d4f98a2SYan Zheng struct backref_node *node; 28965d4f98a2SYan Zheng int level; 28975d4f98a2SYan Zheng int ret; 28985d4f98a2SYan Zheng 28995d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 29005d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 29015d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 29023fd0a558SYan, Zheng struct backref_node, list); 29033fd0a558SYan, Zheng list_move_tail(&node->list, &list); 29043fd0a558SYan, Zheng BUG_ON(!node->pending); 29055d4f98a2SYan Zheng 29063fd0a558SYan, Zheng if (!err) { 29073fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 29085d4f98a2SYan Zheng if (ret < 0) 29095d4f98a2SYan Zheng err = ret; 29105d4f98a2SYan Zheng } 29115d4f98a2SYan Zheng } 29123fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 29133fd0a558SYan, Zheng } 29145d4f98a2SYan Zheng return err; 29155d4f98a2SYan Zheng } 29165d4f98a2SYan Zheng 29175d4f98a2SYan Zheng static void mark_block_processed(struct reloc_control *rc, 29183fd0a558SYan, Zheng u64 bytenr, u32 blocksize) 29193fd0a558SYan, Zheng { 29203fd0a558SYan, Zheng set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, 2921ceeb0ae7SDavid Sterba EXTENT_DIRTY); 29223fd0a558SYan, Zheng } 29233fd0a558SYan, Zheng 29243fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 29255d4f98a2SYan Zheng struct backref_node *node) 29265d4f98a2SYan Zheng { 29275d4f98a2SYan Zheng u32 blocksize; 29285d4f98a2SYan Zheng if (node->level == 0 || 29295d4f98a2SYan Zheng in_block_group(node->bytenr, rc->block_group)) { 2930da17066cSJeff Mahoney blocksize = rc->extent_root->fs_info->nodesize; 29313fd0a558SYan, Zheng mark_block_processed(rc, node->bytenr, blocksize); 29325d4f98a2SYan Zheng } 29335d4f98a2SYan Zheng node->processed = 1; 29345d4f98a2SYan Zheng } 29355d4f98a2SYan Zheng 29365d4f98a2SYan Zheng /* 29375d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 29385d4f98a2SYan Zheng * as processed. 29395d4f98a2SYan Zheng */ 29405d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 29415d4f98a2SYan Zheng struct backref_node *node) 29425d4f98a2SYan Zheng { 29435d4f98a2SYan Zheng struct backref_node *next = node; 29445d4f98a2SYan Zheng struct backref_edge *edge; 29455d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 29465d4f98a2SYan Zheng int index = 0; 29475d4f98a2SYan Zheng 29485d4f98a2SYan Zheng while (next) { 29495d4f98a2SYan Zheng cond_resched(); 29505d4f98a2SYan Zheng while (1) { 29515d4f98a2SYan Zheng if (next->processed) 29525d4f98a2SYan Zheng break; 29535d4f98a2SYan Zheng 29543fd0a558SYan, Zheng __mark_block_processed(rc, next); 29555d4f98a2SYan Zheng 29565d4f98a2SYan Zheng if (list_empty(&next->upper)) 29575d4f98a2SYan Zheng break; 29585d4f98a2SYan Zheng 29595d4f98a2SYan Zheng edge = list_entry(next->upper.next, 29605d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 29615d4f98a2SYan Zheng edges[index++] = edge; 29625d4f98a2SYan Zheng next = edge->node[UPPER]; 29635d4f98a2SYan Zheng } 29645d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 29655d4f98a2SYan Zheng } 29665d4f98a2SYan Zheng } 29675d4f98a2SYan Zheng 29687476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 29695d4f98a2SYan Zheng { 2970da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 29717476dfdaSDavid Sterba 29725d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 29739655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 29745d4f98a2SYan Zheng return 1; 29755d4f98a2SYan Zheng return 0; 29765d4f98a2SYan Zheng } 29775d4f98a2SYan Zheng 29782ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 29795d4f98a2SYan Zheng struct tree_block *block) 29805d4f98a2SYan Zheng { 29815d4f98a2SYan Zheng struct extent_buffer *eb; 29825d4f98a2SYan Zheng 29835d4f98a2SYan Zheng BUG_ON(block->key_ready); 2984581c1760SQu Wenruo eb = read_tree_block(fs_info, block->bytenr, block->key.offset, 2985581c1760SQu Wenruo block->level, NULL); 298664c043deSLiu Bo if (IS_ERR(eb)) { 298764c043deSLiu Bo return PTR_ERR(eb); 298864c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2989416bc658SJosef Bacik free_extent_buffer(eb); 2990416bc658SJosef Bacik return -EIO; 2991416bc658SJosef Bacik } 29925d4f98a2SYan Zheng if (block->level == 0) 29935d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 29945d4f98a2SYan Zheng else 29955d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 29965d4f98a2SYan Zheng free_extent_buffer(eb); 29975d4f98a2SYan Zheng block->key_ready = 1; 29985d4f98a2SYan Zheng return 0; 29995d4f98a2SYan Zheng } 30005d4f98a2SYan Zheng 30015d4f98a2SYan Zheng /* 30025d4f98a2SYan Zheng * helper function to relocate a tree block 30035d4f98a2SYan Zheng */ 30045d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 30055d4f98a2SYan Zheng struct reloc_control *rc, 30065d4f98a2SYan Zheng struct backref_node *node, 30075d4f98a2SYan Zheng struct btrfs_key *key, 30085d4f98a2SYan Zheng struct btrfs_path *path) 30095d4f98a2SYan Zheng { 30105d4f98a2SYan Zheng struct btrfs_root *root; 30113fd0a558SYan, Zheng int ret = 0; 30125d4f98a2SYan Zheng 30133fd0a558SYan, Zheng if (!node) 30145d4f98a2SYan Zheng return 0; 30153fd0a558SYan, Zheng 30163fd0a558SYan, Zheng BUG_ON(node->processed); 3017147d256eSZhaolei root = select_one_root(node); 30183fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 30193fd0a558SYan, Zheng update_processed_blocks(rc, node); 30203fd0a558SYan, Zheng goto out; 30215d4f98a2SYan Zheng } 30225d4f98a2SYan Zheng 302327cdeb70SMiao Xie if (!root || test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 30243fd0a558SYan, Zheng ret = reserve_metadata_space(trans, rc, node); 30253fd0a558SYan, Zheng if (ret) 30265d4f98a2SYan Zheng goto out; 30275d4f98a2SYan Zheng } 30283fd0a558SYan, Zheng 30293fd0a558SYan, Zheng if (root) { 303027cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 30313fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 30323fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 30333fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 30343fd0a558SYan, Zheng root = root->reloc_root; 30353fd0a558SYan, Zheng node->new_bytenr = root->node->start; 30363fd0a558SYan, Zheng node->root = root; 30373fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 30383fd0a558SYan, Zheng } else { 30395d4f98a2SYan Zheng path->lowest_level = node->level; 30405d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 3041b3b4aa74SDavid Sterba btrfs_release_path(path); 30423fd0a558SYan, Zheng if (ret > 0) 30435d4f98a2SYan Zheng ret = 0; 30443fd0a558SYan, Zheng } 30453fd0a558SYan, Zheng if (!ret) 30463fd0a558SYan, Zheng update_processed_blocks(rc, node); 30473fd0a558SYan, Zheng } else { 30483fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 30493fd0a558SYan, Zheng } 30505d4f98a2SYan Zheng out: 30510647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 30523fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 30535d4f98a2SYan Zheng return ret; 30545d4f98a2SYan Zheng } 30555d4f98a2SYan Zheng 30565d4f98a2SYan Zheng /* 30575d4f98a2SYan Zheng * relocate a list of blocks 30585d4f98a2SYan Zheng */ 30595d4f98a2SYan Zheng static noinline_for_stack 30605d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 30615d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 30625d4f98a2SYan Zheng { 30632ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 30645d4f98a2SYan Zheng struct backref_node *node; 30655d4f98a2SYan Zheng struct btrfs_path *path; 30665d4f98a2SYan Zheng struct tree_block *block; 306798ff7b94SQu Wenruo struct tree_block *next; 30685d4f98a2SYan Zheng int ret; 30695d4f98a2SYan Zheng int err = 0; 30705d4f98a2SYan Zheng 30715d4f98a2SYan Zheng path = btrfs_alloc_path(); 3072e1a12670SLiu Bo if (!path) { 3073e1a12670SLiu Bo err = -ENOMEM; 307434c2b290SDavid Sterba goto out_free_blocks; 3075e1a12670SLiu Bo } 30765d4f98a2SYan Zheng 307798ff7b94SQu Wenruo /* Kick in readahead for tree blocks with missing keys */ 307898ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 30795d4f98a2SYan Zheng if (!block->key_ready) 30802ff7e61eSJeff Mahoney readahead_tree_block(fs_info, block->bytenr); 30815d4f98a2SYan Zheng } 30825d4f98a2SYan Zheng 308398ff7b94SQu Wenruo /* Get first keys */ 308498ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 308534c2b290SDavid Sterba if (!block->key_ready) { 30862ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 308734c2b290SDavid Sterba if (err) 308834c2b290SDavid Sterba goto out_free_path; 308934c2b290SDavid Sterba } 30905d4f98a2SYan Zheng } 30915d4f98a2SYan Zheng 309298ff7b94SQu Wenruo /* Do tree relocation */ 309398ff7b94SQu Wenruo rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { 30943fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 30955d4f98a2SYan Zheng block->level, block->bytenr); 30965d4f98a2SYan Zheng if (IS_ERR(node)) { 30975d4f98a2SYan Zheng err = PTR_ERR(node); 30985d4f98a2SYan Zheng goto out; 30995d4f98a2SYan Zheng } 31005d4f98a2SYan Zheng 31015d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 31025d4f98a2SYan Zheng path); 31035d4f98a2SYan Zheng if (ret < 0) { 310498ff7b94SQu Wenruo if (ret != -EAGAIN || &block->rb_node == rb_first(blocks)) 31055d4f98a2SYan Zheng err = ret; 31065d4f98a2SYan Zheng goto out; 31075d4f98a2SYan Zheng } 31085d4f98a2SYan Zheng } 31095d4f98a2SYan Zheng out: 31103fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 31115d4f98a2SYan Zheng 311234c2b290SDavid Sterba out_free_path: 31135d4f98a2SYan Zheng btrfs_free_path(path); 311434c2b290SDavid Sterba out_free_blocks: 3115e1a12670SLiu Bo free_block_list(blocks); 31165d4f98a2SYan Zheng return err; 31175d4f98a2SYan Zheng } 31185d4f98a2SYan Zheng 31195d4f98a2SYan Zheng static noinline_for_stack 3120efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3121efa56464SYan, Zheng struct file_extent_cluster *cluster) 3122efa56464SYan, Zheng { 3123efa56464SYan, Zheng u64 alloc_hint = 0; 3124efa56464SYan, Zheng u64 start; 3125efa56464SYan, Zheng u64 end; 3126efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3127efa56464SYan, Zheng u64 num_bytes; 3128efa56464SYan, Zheng int nr = 0; 3129efa56464SYan, Zheng int ret = 0; 3130dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 3131dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 313218513091SWang Xiaoguang u64 cur_offset; 3133364ecf36SQu Wenruo struct extent_changeset *data_reserved = NULL; 3134efa56464SYan, Zheng 3135efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 31365955102cSAl Viro inode_lock(inode); 3137efa56464SYan, Zheng 3138364ecf36SQu Wenruo ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start, 3139dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 3140efa56464SYan, Zheng if (ret) 3141efa56464SYan, Zheng goto out; 3142efa56464SYan, Zheng 314318513091SWang Xiaoguang cur_offset = prealloc_start; 3144efa56464SYan, Zheng while (nr < cluster->nr) { 3145efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3146efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3147efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3148efa56464SYan, Zheng else 3149efa56464SYan, Zheng end = cluster->end - offset; 3150efa56464SYan, Zheng 3151d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3152efa56464SYan, Zheng num_bytes = end + 1 - start; 315318513091SWang Xiaoguang if (cur_offset < start) 3154bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3155bc42bda2SQu Wenruo cur_offset, start - cur_offset); 3156efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3157efa56464SYan, Zheng num_bytes, num_bytes, 3158efa56464SYan, Zheng end + 1, &alloc_hint); 315918513091SWang Xiaoguang cur_offset = end + 1; 3160d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3161efa56464SYan, Zheng if (ret) 3162efa56464SYan, Zheng break; 3163efa56464SYan, Zheng nr++; 3164efa56464SYan, Zheng } 316518513091SWang Xiaoguang if (cur_offset < prealloc_end) 3166bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3167bc42bda2SQu Wenruo cur_offset, prealloc_end + 1 - cur_offset); 3168efa56464SYan, Zheng out: 31695955102cSAl Viro inode_unlock(inode); 3170364ecf36SQu Wenruo extent_changeset_free(data_reserved); 3171efa56464SYan, Zheng return ret; 3172efa56464SYan, Zheng } 3173efa56464SYan, Zheng 3174efa56464SYan, Zheng static noinline_for_stack 31750257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 31760257bb82SYan, Zheng u64 block_start) 31775d4f98a2SYan Zheng { 31780b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 31795d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 31805d4f98a2SYan Zheng struct extent_map *em; 31810257bb82SYan, Zheng int ret = 0; 31825d4f98a2SYan Zheng 3183172ddd60SDavid Sterba em = alloc_extent_map(); 31840257bb82SYan, Zheng if (!em) 31850257bb82SYan, Zheng return -ENOMEM; 31860257bb82SYan, Zheng 31875d4f98a2SYan Zheng em->start = start; 31880257bb82SYan, Zheng em->len = end + 1 - start; 31890257bb82SYan, Zheng em->block_len = em->len; 31900257bb82SYan, Zheng em->block_start = block_start; 31910b246afaSJeff Mahoney em->bdev = fs_info->fs_devices->latest_bdev; 31925d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 31935d4f98a2SYan Zheng 3194d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 31955d4f98a2SYan Zheng while (1) { 3196890871beSChris Mason write_lock(&em_tree->lock); 319709a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3198890871beSChris Mason write_unlock(&em_tree->lock); 31995d4f98a2SYan Zheng if (ret != -EEXIST) { 32005d4f98a2SYan Zheng free_extent_map(em); 32015d4f98a2SYan Zheng break; 32025d4f98a2SYan Zheng } 3203dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 32045d4f98a2SYan Zheng } 3205d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 32060257bb82SYan, Zheng return ret; 32070257bb82SYan, Zheng } 32085d4f98a2SYan Zheng 32090257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 32100257bb82SYan, Zheng struct file_extent_cluster *cluster) 32110257bb82SYan, Zheng { 32122ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 32130257bb82SYan, Zheng u64 page_start; 32140257bb82SYan, Zheng u64 page_end; 32150257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 32160257bb82SYan, Zheng unsigned long index; 32170257bb82SYan, Zheng unsigned long last_index; 32180257bb82SYan, Zheng struct page *page; 32190257bb82SYan, Zheng struct file_ra_state *ra; 32203b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 32210257bb82SYan, Zheng int nr = 0; 32220257bb82SYan, Zheng int ret = 0; 32230257bb82SYan, Zheng 32240257bb82SYan, Zheng if (!cluster->nr) 32250257bb82SYan, Zheng return 0; 32260257bb82SYan, Zheng 32270257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 32280257bb82SYan, Zheng if (!ra) 32290257bb82SYan, Zheng return -ENOMEM; 32300257bb82SYan, Zheng 3231efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 32320257bb82SYan, Zheng if (ret) 3233efa56464SYan, Zheng goto out; 32340257bb82SYan, Zheng 32350257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 32360257bb82SYan, Zheng 3237efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3238efa56464SYan, Zheng cluster->end - offset, cluster->start); 3239efa56464SYan, Zheng if (ret) 3240efa56464SYan, Zheng goto out; 3241efa56464SYan, Zheng 324209cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 324309cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 32440257bb82SYan, Zheng while (index <= last_index) { 32459f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 32469f3db423SNikolay Borisov PAGE_SIZE); 3247efa56464SYan, Zheng if (ret) 3248efa56464SYan, Zheng goto out; 3249efa56464SYan, Zheng 32500257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 32510257bb82SYan, Zheng if (!page) { 32520257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 32530257bb82SYan, Zheng ra, NULL, index, 32540257bb82SYan, Zheng last_index + 1 - index); 3255a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 32563b16a4e3SJosef Bacik mask); 32570257bb82SYan, Zheng if (!page) { 3258691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 325943b18595SQu Wenruo PAGE_SIZE, true); 32600257bb82SYan, Zheng ret = -ENOMEM; 3261efa56464SYan, Zheng goto out; 32620257bb82SYan, Zheng } 32630257bb82SYan, Zheng } 32640257bb82SYan, Zheng 32650257bb82SYan, Zheng if (PageReadahead(page)) { 32660257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 32670257bb82SYan, Zheng ra, NULL, page, index, 32680257bb82SYan, Zheng last_index + 1 - index); 32690257bb82SYan, Zheng } 32700257bb82SYan, Zheng 32710257bb82SYan, Zheng if (!PageUptodate(page)) { 32720257bb82SYan, Zheng btrfs_readpage(NULL, page); 32730257bb82SYan, Zheng lock_page(page); 32740257bb82SYan, Zheng if (!PageUptodate(page)) { 32750257bb82SYan, Zheng unlock_page(page); 327609cbfeafSKirill A. Shutemov put_page(page); 3277691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 327843b18595SQu Wenruo PAGE_SIZE, true); 32798b62f87bSJosef Bacik btrfs_delalloc_release_extents(BTRFS_I(inode), 328043b18595SQu Wenruo PAGE_SIZE, true); 32810257bb82SYan, Zheng ret = -EIO; 3282efa56464SYan, Zheng goto out; 32830257bb82SYan, Zheng } 32840257bb82SYan, Zheng } 32850257bb82SYan, Zheng 32864eee4fa4SMiao Xie page_start = page_offset(page); 328709cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 32880257bb82SYan, Zheng 3289d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 32900257bb82SYan, Zheng 32910257bb82SYan, Zheng set_page_extent_mapped(page); 32920257bb82SYan, Zheng 32930257bb82SYan, Zheng if (nr < cluster->nr && 32940257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 32950257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 32960257bb82SYan, Zheng page_start, page_end, 3297ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 32980257bb82SYan, Zheng nr++; 32990257bb82SYan, Zheng } 33000257bb82SYan, Zheng 3301765f3cebSNikolay Borisov ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0, 3302765f3cebSNikolay Borisov NULL, 0); 3303765f3cebSNikolay Borisov if (ret) { 3304765f3cebSNikolay Borisov unlock_page(page); 3305765f3cebSNikolay Borisov put_page(page); 3306765f3cebSNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 330743b18595SQu Wenruo PAGE_SIZE, true); 3308765f3cebSNikolay Borisov btrfs_delalloc_release_extents(BTRFS_I(inode), 330943b18595SQu Wenruo PAGE_SIZE, true); 3310765f3cebSNikolay Borisov 3311765f3cebSNikolay Borisov clear_extent_bits(&BTRFS_I(inode)->io_tree, 3312765f3cebSNikolay Borisov page_start, page_end, 3313765f3cebSNikolay Borisov EXTENT_LOCKED | EXTENT_BOUNDARY); 3314765f3cebSNikolay Borisov goto out; 3315765f3cebSNikolay Borisov 3316765f3cebSNikolay Borisov } 33170257bb82SYan, Zheng set_page_dirty(page); 33180257bb82SYan, Zheng 33190257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3320d0082371SJeff Mahoney page_start, page_end); 33210257bb82SYan, Zheng unlock_page(page); 332209cbfeafSKirill A. Shutemov put_page(page); 33230257bb82SYan, Zheng 33240257bb82SYan, Zheng index++; 332543b18595SQu Wenruo btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE, 332643b18595SQu Wenruo false); 3327efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 33282ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 33290257bb82SYan, Zheng } 33300257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3331efa56464SYan, Zheng out: 33320257bb82SYan, Zheng kfree(ra); 33330257bb82SYan, Zheng return ret; 33340257bb82SYan, Zheng } 33350257bb82SYan, Zheng 33360257bb82SYan, Zheng static noinline_for_stack 33370257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 33380257bb82SYan, Zheng struct file_extent_cluster *cluster) 33390257bb82SYan, Zheng { 33400257bb82SYan, Zheng int ret; 33410257bb82SYan, Zheng 33420257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 33430257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 33440257bb82SYan, Zheng if (ret) 33450257bb82SYan, Zheng return ret; 33460257bb82SYan, Zheng cluster->nr = 0; 33470257bb82SYan, Zheng } 33480257bb82SYan, Zheng 33490257bb82SYan, Zheng if (!cluster->nr) 33500257bb82SYan, Zheng cluster->start = extent_key->objectid; 33510257bb82SYan, Zheng else 33520257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 33530257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 33540257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 33550257bb82SYan, Zheng cluster->nr++; 33560257bb82SYan, Zheng 33570257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 33580257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 33590257bb82SYan, Zheng if (ret) 33600257bb82SYan, Zheng return ret; 33610257bb82SYan, Zheng cluster->nr = 0; 33620257bb82SYan, Zheng } 33630257bb82SYan, Zheng return 0; 33645d4f98a2SYan Zheng } 33655d4f98a2SYan Zheng 33665d4f98a2SYan Zheng /* 33675d4f98a2SYan Zheng * helper to add a tree block to the list. 33685d4f98a2SYan Zheng * the major work is getting the generation and level of the block 33695d4f98a2SYan Zheng */ 33705d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 33715d4f98a2SYan Zheng struct btrfs_key *extent_key, 33725d4f98a2SYan Zheng struct btrfs_path *path, 33735d4f98a2SYan Zheng struct rb_root *blocks) 33745d4f98a2SYan Zheng { 33755d4f98a2SYan Zheng struct extent_buffer *eb; 33765d4f98a2SYan Zheng struct btrfs_extent_item *ei; 33775d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 33785d4f98a2SYan Zheng struct tree_block *block; 33795d4f98a2SYan Zheng struct rb_node *rb_node; 33805d4f98a2SYan Zheng u32 item_size; 33815d4f98a2SYan Zheng int level = -1; 33827fdf4b60SWang Shilong u64 generation; 33835d4f98a2SYan Zheng 33845d4f98a2SYan Zheng eb = path->nodes[0]; 33855d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 33865d4f98a2SYan Zheng 33873173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 33883173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 33895d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 33905d4f98a2SYan Zheng struct btrfs_extent_item); 33913173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 33925d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 33935d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 33945d4f98a2SYan Zheng } else { 33953173a18fSJosef Bacik level = (int)extent_key->offset; 33963173a18fSJosef Bacik } 33973173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 33986d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 3399ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3400ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3401ba3c2b19SNikolay Borisov return -EINVAL; 34023173a18fSJosef Bacik } else { 34035d4f98a2SYan Zheng BUG(); 34045d4f98a2SYan Zheng } 34055d4f98a2SYan Zheng 3406b3b4aa74SDavid Sterba btrfs_release_path(path); 34075d4f98a2SYan Zheng 34085d4f98a2SYan Zheng BUG_ON(level == -1); 34095d4f98a2SYan Zheng 34105d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 34115d4f98a2SYan Zheng if (!block) 34125d4f98a2SYan Zheng return -ENOMEM; 34135d4f98a2SYan Zheng 34145d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3415da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 34165d4f98a2SYan Zheng block->key.offset = generation; 34175d4f98a2SYan Zheng block->level = level; 34185d4f98a2SYan Zheng block->key_ready = 0; 34195d4f98a2SYan Zheng 34205d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 342143c04fb1SJeff Mahoney if (rb_node) 342243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 34235d4f98a2SYan Zheng 34245d4f98a2SYan Zheng return 0; 34255d4f98a2SYan Zheng } 34265d4f98a2SYan Zheng 34275d4f98a2SYan Zheng /* 34285d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 34295d4f98a2SYan Zheng */ 34305d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 34315d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 34325d4f98a2SYan Zheng struct rb_root *blocks) 34335d4f98a2SYan Zheng { 34340b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 34355d4f98a2SYan Zheng struct btrfs_path *path; 34365d4f98a2SYan Zheng struct btrfs_key key; 34375d4f98a2SYan Zheng int ret; 34380b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 34395d4f98a2SYan Zheng 34407476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 34415d4f98a2SYan Zheng return 0; 34425d4f98a2SYan Zheng 34435d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 34445d4f98a2SYan Zheng return 0; 34455d4f98a2SYan Zheng 34465d4f98a2SYan Zheng path = btrfs_alloc_path(); 34475d4f98a2SYan Zheng if (!path) 34485d4f98a2SYan Zheng return -ENOMEM; 3449aee68ee5SJosef Bacik again: 34505d4f98a2SYan Zheng key.objectid = bytenr; 3451aee68ee5SJosef Bacik if (skinny) { 3452aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3453aee68ee5SJosef Bacik key.offset = (u64)-1; 3454aee68ee5SJosef Bacik } else { 34555d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 34565d4f98a2SYan Zheng key.offset = blocksize; 3457aee68ee5SJosef Bacik } 34585d4f98a2SYan Zheng 34595d4f98a2SYan Zheng path->search_commit_root = 1; 34605d4f98a2SYan Zheng path->skip_locking = 1; 34615d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 34625d4f98a2SYan Zheng if (ret < 0) 34635d4f98a2SYan Zheng goto out; 34645d4f98a2SYan Zheng 3465aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3466aee68ee5SJosef Bacik if (path->slots[0]) { 3467aee68ee5SJosef Bacik path->slots[0]--; 3468aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3469aee68ee5SJosef Bacik path->slots[0]); 34703173a18fSJosef Bacik if (key.objectid == bytenr && 3471aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3472aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3473aee68ee5SJosef Bacik key.offset == blocksize))) 34743173a18fSJosef Bacik ret = 0; 34753173a18fSJosef Bacik } 3476aee68ee5SJosef Bacik 3477aee68ee5SJosef Bacik if (ret) { 3478aee68ee5SJosef Bacik skinny = false; 3479aee68ee5SJosef Bacik btrfs_release_path(path); 3480aee68ee5SJosef Bacik goto again; 3481aee68ee5SJosef Bacik } 3482aee68ee5SJosef Bacik } 3483cdccee99SLiu Bo if (ret) { 3484cdccee99SLiu Bo ASSERT(ret == 1); 3485cdccee99SLiu Bo btrfs_print_leaf(path->nodes[0]); 3486cdccee99SLiu Bo btrfs_err(fs_info, 3487cdccee99SLiu Bo "tree block extent item (%llu) is not found in extent tree", 3488cdccee99SLiu Bo bytenr); 3489cdccee99SLiu Bo WARN_ON(1); 3490cdccee99SLiu Bo ret = -EINVAL; 3491cdccee99SLiu Bo goto out; 3492cdccee99SLiu Bo } 34933173a18fSJosef Bacik 34945d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 34955d4f98a2SYan Zheng out: 34965d4f98a2SYan Zheng btrfs_free_path(path); 34975d4f98a2SYan Zheng return ret; 34985d4f98a2SYan Zheng } 34995d4f98a2SYan Zheng 35005d4f98a2SYan Zheng /* 35015d4f98a2SYan Zheng * helper to check if the block use full backrefs for pointers in it 35025d4f98a2SYan Zheng */ 35035d4f98a2SYan Zheng static int block_use_full_backref(struct reloc_control *rc, 35045d4f98a2SYan Zheng struct extent_buffer *eb) 35055d4f98a2SYan Zheng { 35065d4f98a2SYan Zheng u64 flags; 35075d4f98a2SYan Zheng int ret; 35085d4f98a2SYan Zheng 35095d4f98a2SYan Zheng if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) || 35105d4f98a2SYan Zheng btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV) 35115d4f98a2SYan Zheng return 1; 35125d4f98a2SYan Zheng 35132ff7e61eSJeff Mahoney ret = btrfs_lookup_extent_info(NULL, rc->extent_root->fs_info, 35143173a18fSJosef Bacik eb->start, btrfs_header_level(eb), 1, 35153173a18fSJosef Bacik NULL, &flags); 35165d4f98a2SYan Zheng BUG_ON(ret); 35175d4f98a2SYan Zheng 35185d4f98a2SYan Zheng if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) 35195d4f98a2SYan Zheng ret = 1; 35205d4f98a2SYan Zheng else 35215d4f98a2SYan Zheng ret = 0; 35225d4f98a2SYan Zheng return ret; 35235d4f98a2SYan Zheng } 35245d4f98a2SYan Zheng 35250af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 35261bbc621eSChris Mason struct btrfs_block_group_cache *block_group, 35271bbc621eSChris Mason struct inode *inode, 35281bbc621eSChris Mason u64 ino) 35290af3d00bSJosef Bacik { 35300af3d00bSJosef Bacik struct btrfs_key key; 35310af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 35320af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 35330af3d00bSJosef Bacik int ret = 0; 35340af3d00bSJosef Bacik 35350af3d00bSJosef Bacik if (inode) 35360af3d00bSJosef Bacik goto truncate; 35370af3d00bSJosef Bacik 35380af3d00bSJosef Bacik key.objectid = ino; 35390af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 35400af3d00bSJosef Bacik key.offset = 0; 35410af3d00bSJosef Bacik 35420af3d00bSJosef Bacik inode = btrfs_iget(fs_info->sb, &key, root, NULL); 35432e19f1f9SAl Viro if (IS_ERR(inode)) 35440af3d00bSJosef Bacik return -ENOENT; 35450af3d00bSJosef Bacik 35460af3d00bSJosef Bacik truncate: 35472ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 35487b61cd92SMiao Xie &fs_info->global_block_rsv); 35497b61cd92SMiao Xie if (ret) 35507b61cd92SMiao Xie goto out; 35517b61cd92SMiao Xie 35527a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 35530af3d00bSJosef Bacik if (IS_ERR(trans)) { 35543612b495STsutomu Itoh ret = PTR_ERR(trans); 35550af3d00bSJosef Bacik goto out; 35560af3d00bSJosef Bacik } 35570af3d00bSJosef Bacik 355877ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 35590af3d00bSJosef Bacik 35603a45bb20SJeff Mahoney btrfs_end_transaction(trans); 35612ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 35620af3d00bSJosef Bacik out: 35630af3d00bSJosef Bacik iput(inode); 35640af3d00bSJosef Bacik return ret; 35650af3d00bSJosef Bacik } 35660af3d00bSJosef Bacik 35675d4f98a2SYan Zheng /* 35685d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY 35695d4f98a2SYan Zheng * this function scans fs tree to find blocks reference the data extent 35705d4f98a2SYan Zheng */ 35715d4f98a2SYan Zheng static int find_data_references(struct reloc_control *rc, 35725d4f98a2SYan Zheng struct btrfs_key *extent_key, 35735d4f98a2SYan Zheng struct extent_buffer *leaf, 35745d4f98a2SYan Zheng struct btrfs_extent_data_ref *ref, 35755d4f98a2SYan Zheng struct rb_root *blocks) 35765d4f98a2SYan Zheng { 35770b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 35785d4f98a2SYan Zheng struct btrfs_path *path; 35795d4f98a2SYan Zheng struct tree_block *block; 35805d4f98a2SYan Zheng struct btrfs_root *root; 35815d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 35825d4f98a2SYan Zheng struct rb_node *rb_node; 35835d4f98a2SYan Zheng struct btrfs_key key; 35845d4f98a2SYan Zheng u64 ref_root; 35855d4f98a2SYan Zheng u64 ref_objectid; 35865d4f98a2SYan Zheng u64 ref_offset; 35875d4f98a2SYan Zheng u32 ref_count; 35885d4f98a2SYan Zheng u32 nritems; 35895d4f98a2SYan Zheng int err = 0; 35905d4f98a2SYan Zheng int added = 0; 35915d4f98a2SYan Zheng int counted; 35925d4f98a2SYan Zheng int ret; 35935d4f98a2SYan Zheng 35945d4f98a2SYan Zheng ref_root = btrfs_extent_data_ref_root(leaf, ref); 35955d4f98a2SYan Zheng ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref); 35965d4f98a2SYan Zheng ref_offset = btrfs_extent_data_ref_offset(leaf, ref); 35975d4f98a2SYan Zheng ref_count = btrfs_extent_data_ref_count(leaf, ref); 35985d4f98a2SYan Zheng 35990af3d00bSJosef Bacik /* 36000af3d00bSJosef Bacik * This is an extent belonging to the free space cache, lets just delete 36010af3d00bSJosef Bacik * it and redo the search. 36020af3d00bSJosef Bacik */ 36030af3d00bSJosef Bacik if (ref_root == BTRFS_ROOT_TREE_OBJECTID) { 36040b246afaSJeff Mahoney ret = delete_block_group_cache(fs_info, rc->block_group, 36050af3d00bSJosef Bacik NULL, ref_objectid); 36060af3d00bSJosef Bacik if (ret != -ENOENT) 36070af3d00bSJosef Bacik return ret; 36080af3d00bSJosef Bacik ret = 0; 36090af3d00bSJosef Bacik } 36100af3d00bSJosef Bacik 36110af3d00bSJosef Bacik path = btrfs_alloc_path(); 36120af3d00bSJosef Bacik if (!path) 36130af3d00bSJosef Bacik return -ENOMEM; 3614e4058b54SDavid Sterba path->reada = READA_FORWARD; 36150af3d00bSJosef Bacik 36160b246afaSJeff Mahoney root = read_fs_root(fs_info, ref_root); 36175d4f98a2SYan Zheng if (IS_ERR(root)) { 36185d4f98a2SYan Zheng err = PTR_ERR(root); 36195d4f98a2SYan Zheng goto out; 36205d4f98a2SYan Zheng } 36215d4f98a2SYan Zheng 36225d4f98a2SYan Zheng key.objectid = ref_objectid; 36235d4f98a2SYan Zheng key.type = BTRFS_EXTENT_DATA_KEY; 362484850e8dSYan, Zheng if (ref_offset > ((u64)-1 << 32)) 362584850e8dSYan, Zheng key.offset = 0; 362684850e8dSYan, Zheng else 362784850e8dSYan, Zheng key.offset = ref_offset; 36285d4f98a2SYan Zheng 36295d4f98a2SYan Zheng path->search_commit_root = 1; 36305d4f98a2SYan Zheng path->skip_locking = 1; 36315d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 36325d4f98a2SYan Zheng if (ret < 0) { 36335d4f98a2SYan Zheng err = ret; 36345d4f98a2SYan Zheng goto out; 36355d4f98a2SYan Zheng } 36365d4f98a2SYan Zheng 36375d4f98a2SYan Zheng leaf = path->nodes[0]; 36385d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 36395d4f98a2SYan Zheng /* 36405d4f98a2SYan Zheng * the references in tree blocks that use full backrefs 36415d4f98a2SYan Zheng * are not counted in 36425d4f98a2SYan Zheng */ 36435d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 36445d4f98a2SYan Zheng counted = 0; 36455d4f98a2SYan Zheng else 36465d4f98a2SYan Zheng counted = 1; 36475d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 36485d4f98a2SYan Zheng if (rb_node) { 36495d4f98a2SYan Zheng if (counted) 36505d4f98a2SYan Zheng added = 1; 36515d4f98a2SYan Zheng else 36525d4f98a2SYan Zheng path->slots[0] = nritems; 36535d4f98a2SYan Zheng } 36545d4f98a2SYan Zheng 36555d4f98a2SYan Zheng while (ref_count > 0) { 36565d4f98a2SYan Zheng while (path->slots[0] >= nritems) { 36575d4f98a2SYan Zheng ret = btrfs_next_leaf(root, path); 36585d4f98a2SYan Zheng if (ret < 0) { 36595d4f98a2SYan Zheng err = ret; 36605d4f98a2SYan Zheng goto out; 36615d4f98a2SYan Zheng } 3662fae7f21cSDulshani Gunawardhana if (WARN_ON(ret > 0)) 36635d4f98a2SYan Zheng goto out; 36645d4f98a2SYan Zheng 36655d4f98a2SYan Zheng leaf = path->nodes[0]; 36665d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 36675d4f98a2SYan Zheng added = 0; 36685d4f98a2SYan Zheng 36695d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 36705d4f98a2SYan Zheng counted = 0; 36715d4f98a2SYan Zheng else 36725d4f98a2SYan Zheng counted = 1; 36735d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 36745d4f98a2SYan Zheng if (rb_node) { 36755d4f98a2SYan Zheng if (counted) 36765d4f98a2SYan Zheng added = 1; 36775d4f98a2SYan Zheng else 36785d4f98a2SYan Zheng path->slots[0] = nritems; 36795d4f98a2SYan Zheng } 36805d4f98a2SYan Zheng } 36815d4f98a2SYan Zheng 36825d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 3683fae7f21cSDulshani Gunawardhana if (WARN_ON(key.objectid != ref_objectid || 3684fae7f21cSDulshani Gunawardhana key.type != BTRFS_EXTENT_DATA_KEY)) 36855d4f98a2SYan Zheng break; 36865d4f98a2SYan Zheng 36875d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 36885d4f98a2SYan Zheng struct btrfs_file_extent_item); 36895d4f98a2SYan Zheng 36905d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 36915d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 36925d4f98a2SYan Zheng goto next; 36935d4f98a2SYan Zheng 36945d4f98a2SYan Zheng if (btrfs_file_extent_disk_bytenr(leaf, fi) != 36955d4f98a2SYan Zheng extent_key->objectid) 36965d4f98a2SYan Zheng goto next; 36975d4f98a2SYan Zheng 36985d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 36995d4f98a2SYan Zheng if (key.offset != ref_offset) 37005d4f98a2SYan Zheng goto next; 37015d4f98a2SYan Zheng 37025d4f98a2SYan Zheng if (counted) 37035d4f98a2SYan Zheng ref_count--; 37045d4f98a2SYan Zheng if (added) 37055d4f98a2SYan Zheng goto next; 37065d4f98a2SYan Zheng 37077476dfdaSDavid Sterba if (!tree_block_processed(leaf->start, rc)) { 37085d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 37095d4f98a2SYan Zheng if (!block) { 37105d4f98a2SYan Zheng err = -ENOMEM; 37115d4f98a2SYan Zheng break; 37125d4f98a2SYan Zheng } 37135d4f98a2SYan Zheng block->bytenr = leaf->start; 37145d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &block->key, 0); 37155d4f98a2SYan Zheng block->level = 0; 37165d4f98a2SYan Zheng block->key_ready = 1; 37175d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, 37185d4f98a2SYan Zheng &block->rb_node); 371943c04fb1SJeff Mahoney if (rb_node) 372043c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 372143c04fb1SJeff Mahoney block->bytenr); 37225d4f98a2SYan Zheng } 37235d4f98a2SYan Zheng if (counted) 37245d4f98a2SYan Zheng added = 1; 37255d4f98a2SYan Zheng else 37265d4f98a2SYan Zheng path->slots[0] = nritems; 37275d4f98a2SYan Zheng next: 37285d4f98a2SYan Zheng path->slots[0]++; 37295d4f98a2SYan Zheng 37305d4f98a2SYan Zheng } 37315d4f98a2SYan Zheng out: 37325d4f98a2SYan Zheng btrfs_free_path(path); 37335d4f98a2SYan Zheng return err; 37345d4f98a2SYan Zheng } 37355d4f98a2SYan Zheng 37365d4f98a2SYan Zheng /* 37372c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 37385d4f98a2SYan Zheng */ 37395d4f98a2SYan Zheng static noinline_for_stack 37405d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 37415d4f98a2SYan Zheng struct btrfs_key *extent_key, 37425d4f98a2SYan Zheng struct btrfs_path *path, 37435d4f98a2SYan Zheng struct rb_root *blocks) 37445d4f98a2SYan Zheng { 37455d4f98a2SYan Zheng struct btrfs_key key; 37465d4f98a2SYan Zheng struct extent_buffer *eb; 37475d4f98a2SYan Zheng struct btrfs_extent_data_ref *dref; 37485d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 37495d4f98a2SYan Zheng unsigned long ptr; 37505d4f98a2SYan Zheng unsigned long end; 3751da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 3752647f63bdSFilipe David Borba Manana int ret = 0; 37535d4f98a2SYan Zheng int err = 0; 37545d4f98a2SYan Zheng 37555d4f98a2SYan Zheng eb = path->nodes[0]; 37565d4f98a2SYan Zheng ptr = btrfs_item_ptr_offset(eb, path->slots[0]); 37575d4f98a2SYan Zheng end = ptr + btrfs_item_size_nr(eb, path->slots[0]); 37585d4f98a2SYan Zheng ptr += sizeof(struct btrfs_extent_item); 37595d4f98a2SYan Zheng 37605d4f98a2SYan Zheng while (ptr < end) { 37615d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 37623de28d57SLiu Bo key.type = btrfs_get_extent_inline_ref_type(eb, iref, 37633de28d57SLiu Bo BTRFS_REF_TYPE_DATA); 37645d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 37655d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 37665d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 37675d4f98a2SYan Zheng blocks); 37685d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 37695d4f98a2SYan Zheng dref = (struct btrfs_extent_data_ref *)(&iref->offset); 37705d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 37715d4f98a2SYan Zheng eb, dref, blocks); 37725d4f98a2SYan Zheng } else { 3773af431dcbSSu Yue ret = -EUCLEAN; 3774b14c55a1SLiu Bo btrfs_err(rc->extent_root->fs_info, 3775b14c55a1SLiu Bo "extent %llu slot %d has an invalid inline ref type", 3776b14c55a1SLiu Bo eb->start, path->slots[0]); 37775d4f98a2SYan Zheng } 3778647f63bdSFilipe David Borba Manana if (ret) { 3779647f63bdSFilipe David Borba Manana err = ret; 3780647f63bdSFilipe David Borba Manana goto out; 3781647f63bdSFilipe David Borba Manana } 37825d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 37835d4f98a2SYan Zheng } 37845d4f98a2SYan Zheng WARN_ON(ptr > end); 37855d4f98a2SYan Zheng 37865d4f98a2SYan Zheng while (1) { 37875d4f98a2SYan Zheng cond_resched(); 37885d4f98a2SYan Zheng eb = path->nodes[0]; 37895d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(eb)) { 37905d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 37915d4f98a2SYan Zheng if (ret < 0) { 37925d4f98a2SYan Zheng err = ret; 37935d4f98a2SYan Zheng break; 37945d4f98a2SYan Zheng } 37955d4f98a2SYan Zheng if (ret > 0) 37965d4f98a2SYan Zheng break; 37975d4f98a2SYan Zheng eb = path->nodes[0]; 37985d4f98a2SYan Zheng } 37995d4f98a2SYan Zheng 38005d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path->slots[0]); 38015d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 38025d4f98a2SYan Zheng break; 38035d4f98a2SYan Zheng 38045d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 38055d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 38065d4f98a2SYan Zheng blocks); 38075d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 38085d4f98a2SYan Zheng dref = btrfs_item_ptr(eb, path->slots[0], 38095d4f98a2SYan Zheng struct btrfs_extent_data_ref); 38105d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 38115d4f98a2SYan Zheng eb, dref, blocks); 38126d8ff4e4SDavid Sterba } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) { 3813ba3c2b19SNikolay Borisov btrfs_print_v0_err(eb->fs_info); 3814ba3c2b19SNikolay Borisov btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL); 3815ba3c2b19SNikolay Borisov ret = -EINVAL; 38165d4f98a2SYan Zheng } else { 38175d4f98a2SYan Zheng ret = 0; 38185d4f98a2SYan Zheng } 38195d4f98a2SYan Zheng if (ret) { 38205d4f98a2SYan Zheng err = ret; 38215d4f98a2SYan Zheng break; 38225d4f98a2SYan Zheng } 38235d4f98a2SYan Zheng path->slots[0]++; 38245d4f98a2SYan Zheng } 3825647f63bdSFilipe David Borba Manana out: 3826b3b4aa74SDavid Sterba btrfs_release_path(path); 38275d4f98a2SYan Zheng if (err) 38285d4f98a2SYan Zheng free_block_list(blocks); 38295d4f98a2SYan Zheng return err; 38305d4f98a2SYan Zheng } 38315d4f98a2SYan Zheng 38325d4f98a2SYan Zheng /* 38332c016dc2SLiu Bo * helper to find next unprocessed extent 38345d4f98a2SYan Zheng */ 38355d4f98a2SYan Zheng static noinline_for_stack 3836147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 38373fd0a558SYan, Zheng struct btrfs_key *extent_key) 38385d4f98a2SYan Zheng { 38390b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38405d4f98a2SYan Zheng struct btrfs_key key; 38415d4f98a2SYan Zheng struct extent_buffer *leaf; 38425d4f98a2SYan Zheng u64 start, end, last; 38435d4f98a2SYan Zheng int ret; 38445d4f98a2SYan Zheng 38455d4f98a2SYan Zheng last = rc->block_group->key.objectid + rc->block_group->key.offset; 38465d4f98a2SYan Zheng while (1) { 38475d4f98a2SYan Zheng cond_resched(); 38485d4f98a2SYan Zheng if (rc->search_start >= last) { 38495d4f98a2SYan Zheng ret = 1; 38505d4f98a2SYan Zheng break; 38515d4f98a2SYan Zheng } 38525d4f98a2SYan Zheng 38535d4f98a2SYan Zheng key.objectid = rc->search_start; 38545d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 38555d4f98a2SYan Zheng key.offset = 0; 38565d4f98a2SYan Zheng 38575d4f98a2SYan Zheng path->search_commit_root = 1; 38585d4f98a2SYan Zheng path->skip_locking = 1; 38595d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 38605d4f98a2SYan Zheng 0, 0); 38615d4f98a2SYan Zheng if (ret < 0) 38625d4f98a2SYan Zheng break; 38635d4f98a2SYan Zheng next: 38645d4f98a2SYan Zheng leaf = path->nodes[0]; 38655d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 38665d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 38675d4f98a2SYan Zheng if (ret != 0) 38685d4f98a2SYan Zheng break; 38695d4f98a2SYan Zheng leaf = path->nodes[0]; 38705d4f98a2SYan Zheng } 38715d4f98a2SYan Zheng 38725d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 38735d4f98a2SYan Zheng if (key.objectid >= last) { 38745d4f98a2SYan Zheng ret = 1; 38755d4f98a2SYan Zheng break; 38765d4f98a2SYan Zheng } 38775d4f98a2SYan Zheng 38783173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 38793173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 38803173a18fSJosef Bacik path->slots[0]++; 38813173a18fSJosef Bacik goto next; 38823173a18fSJosef Bacik } 38833173a18fSJosef Bacik 38843173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 38855d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 38865d4f98a2SYan Zheng path->slots[0]++; 38875d4f98a2SYan Zheng goto next; 38885d4f98a2SYan Zheng } 38895d4f98a2SYan Zheng 38903173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 38910b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 38923173a18fSJosef Bacik rc->search_start) { 38933173a18fSJosef Bacik path->slots[0]++; 38943173a18fSJosef Bacik goto next; 38953173a18fSJosef Bacik } 38963173a18fSJosef Bacik 38975d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 38985d4f98a2SYan Zheng key.objectid, &start, &end, 3899e6138876SJosef Bacik EXTENT_DIRTY, NULL); 39005d4f98a2SYan Zheng 39015d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3902b3b4aa74SDavid Sterba btrfs_release_path(path); 39035d4f98a2SYan Zheng rc->search_start = end + 1; 39045d4f98a2SYan Zheng } else { 39053173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 39065d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 39073173a18fSJosef Bacik else 39083173a18fSJosef Bacik rc->search_start = key.objectid + 39090b246afaSJeff Mahoney fs_info->nodesize; 39103fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 39115d4f98a2SYan Zheng return 0; 39125d4f98a2SYan Zheng } 39135d4f98a2SYan Zheng } 3914b3b4aa74SDavid Sterba btrfs_release_path(path); 39155d4f98a2SYan Zheng return ret; 39165d4f98a2SYan Zheng } 39175d4f98a2SYan Zheng 39185d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 39195d4f98a2SYan Zheng { 39205d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39217585717fSChris Mason 39227585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39235d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 39247585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39255d4f98a2SYan Zheng } 39265d4f98a2SYan Zheng 39275d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 39285d4f98a2SYan Zheng { 39295d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39307585717fSChris Mason 39317585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39325d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 39337585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39345d4f98a2SYan Zheng } 39355d4f98a2SYan Zheng 39365d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 39375d4f98a2SYan Zheng { 39385d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39395d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39405d4f98a2SYan Zheng return 1; 39415d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 39425d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39435d4f98a2SYan Zheng return 1; 39445d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39455d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 39465d4f98a2SYan Zheng return 1; 39475d4f98a2SYan Zheng return 0; 39485d4f98a2SYan Zheng } 39495d4f98a2SYan Zheng 39503fd0a558SYan, Zheng static noinline_for_stack 39513fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 39523fd0a558SYan, Zheng { 39533fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3954ac2fabacSJosef Bacik int ret; 39553fd0a558SYan, Zheng 39562ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 395766d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 39583fd0a558SYan, Zheng if (!rc->block_rsv) 39593fd0a558SYan, Zheng return -ENOMEM; 39603fd0a558SYan, Zheng 39613fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 39623fd0a558SYan, Zheng rc->search_start = rc->block_group->key.objectid; 39633fd0a558SYan, Zheng rc->extents_found = 0; 39643fd0a558SYan, Zheng rc->nodes_relocated = 0; 39653fd0a558SYan, Zheng rc->merging_rsv_size = 0; 39660647bf56SWang Shilong rc->reserved_bytes = 0; 3967da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 39680647bf56SWang Shilong RELOCATION_RESERVED_NODES; 3969ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 3970ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3971ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3972ac2fabacSJosef Bacik if (ret) 3973ac2fabacSJosef Bacik return ret; 39743fd0a558SYan, Zheng 39753fd0a558SYan, Zheng rc->create_reloc_tree = 1; 39763fd0a558SYan, Zheng set_reloc_control(rc); 39773fd0a558SYan, Zheng 39787a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 397928818947SLiu Bo if (IS_ERR(trans)) { 398028818947SLiu Bo unset_reloc_control(rc); 398128818947SLiu Bo /* 398228818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 398328818947SLiu Bo * cleanup. And callers are responsible to free the above 398428818947SLiu Bo * block rsv. 398528818947SLiu Bo */ 398628818947SLiu Bo return PTR_ERR(trans); 398728818947SLiu Bo } 39883a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 39893fd0a558SYan, Zheng return 0; 39903fd0a558SYan, Zheng } 399176dda93cSYan, Zheng 39925d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 39935d4f98a2SYan Zheng { 39942ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39955d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 39965d4f98a2SYan Zheng struct btrfs_key key; 39975d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 39985d4f98a2SYan Zheng struct btrfs_path *path; 39995d4f98a2SYan Zheng struct btrfs_extent_item *ei; 40005d4f98a2SYan Zheng u64 flags; 40015d4f98a2SYan Zheng u32 item_size; 40025d4f98a2SYan Zheng int ret; 40035d4f98a2SYan Zheng int err = 0; 4004c87f08caSChris Mason int progress = 0; 40055d4f98a2SYan Zheng 40065d4f98a2SYan Zheng path = btrfs_alloc_path(); 40073fd0a558SYan, Zheng if (!path) 40085d4f98a2SYan Zheng return -ENOMEM; 4009e4058b54SDavid Sterba path->reada = READA_FORWARD; 40103fd0a558SYan, Zheng 40113fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 40123fd0a558SYan, Zheng if (ret) { 40133fd0a558SYan, Zheng err = ret; 40143fd0a558SYan, Zheng goto out_free; 40152423fdfbSJiri Slaby } 40165d4f98a2SYan Zheng 40175d4f98a2SYan Zheng while (1) { 40180647bf56SWang Shilong rc->reserved_bytes = 0; 40190647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 40200647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 40210647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 40220647bf56SWang Shilong if (ret) { 40230647bf56SWang Shilong err = ret; 40240647bf56SWang Shilong break; 40250647bf56SWang Shilong } 4026c87f08caSChris Mason progress++; 4027a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 40280f788c58SLiu Bo if (IS_ERR(trans)) { 40290f788c58SLiu Bo err = PTR_ERR(trans); 40300f788c58SLiu Bo trans = NULL; 40310f788c58SLiu Bo break; 40320f788c58SLiu Bo } 4033c87f08caSChris Mason restart: 40343fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 40353a45bb20SJeff Mahoney btrfs_end_transaction(trans); 403642a657f5SPan Bian trans = NULL; 40373fd0a558SYan, Zheng continue; 40383fd0a558SYan, Zheng } 40393fd0a558SYan, Zheng 4040147d256eSZhaolei ret = find_next_extent(rc, path, &key); 40415d4f98a2SYan Zheng if (ret < 0) 40425d4f98a2SYan Zheng err = ret; 40435d4f98a2SYan Zheng if (ret != 0) 40445d4f98a2SYan Zheng break; 40455d4f98a2SYan Zheng 40465d4f98a2SYan Zheng rc->extents_found++; 40475d4f98a2SYan Zheng 40485d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 40495d4f98a2SYan Zheng struct btrfs_extent_item); 40503fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 40515d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 40525d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 40535d4f98a2SYan Zheng ret = check_extent_flags(flags); 40545d4f98a2SYan Zheng BUG_ON(ret); 40556d8ff4e4SDavid Sterba } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) { 4056ba3c2b19SNikolay Borisov err = -EINVAL; 4057ba3c2b19SNikolay Borisov btrfs_print_v0_err(trans->fs_info); 4058ba3c2b19SNikolay Borisov btrfs_abort_transaction(trans, err); 4059ba3c2b19SNikolay Borisov break; 40605d4f98a2SYan Zheng } else { 40615d4f98a2SYan Zheng BUG(); 40625d4f98a2SYan Zheng } 40635d4f98a2SYan Zheng 40645d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 40655d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 40665d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 40675d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40685d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 40695d4f98a2SYan Zheng } else { 4070b3b4aa74SDavid Sterba btrfs_release_path(path); 40715d4f98a2SYan Zheng ret = 0; 40725d4f98a2SYan Zheng } 40735d4f98a2SYan Zheng if (ret < 0) { 40743fd0a558SYan, Zheng err = ret; 40755d4f98a2SYan Zheng break; 40765d4f98a2SYan Zheng } 40775d4f98a2SYan Zheng 40785d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 40795d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 40805d4f98a2SYan Zheng if (ret < 0) { 40811708cc57SWang Shilong /* 40821708cc57SWang Shilong * if we fail to relocate tree blocks, force to update 40831708cc57SWang Shilong * backref cache when committing transaction. 40841708cc57SWang Shilong */ 40851708cc57SWang Shilong rc->backref_cache.last_trans = trans->transid - 1; 40861708cc57SWang Shilong 40873fd0a558SYan, Zheng if (ret != -EAGAIN) { 40885d4f98a2SYan Zheng err = ret; 40895d4f98a2SYan Zheng break; 40905d4f98a2SYan Zheng } 40913fd0a558SYan, Zheng rc->extents_found--; 40923fd0a558SYan, Zheng rc->search_start = key.objectid; 40933fd0a558SYan, Zheng } 40945d4f98a2SYan Zheng } 40955d4f98a2SYan Zheng 40963a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 40972ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 40983fd0a558SYan, Zheng trans = NULL; 40995d4f98a2SYan Zheng 41005d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 41015d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 41025d4f98a2SYan Zheng rc->found_file_extent = 1; 41030257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 41043fd0a558SYan, Zheng &key, &rc->cluster); 41055d4f98a2SYan Zheng if (ret < 0) { 41065d4f98a2SYan Zheng err = ret; 41075d4f98a2SYan Zheng break; 41085d4f98a2SYan Zheng } 41095d4f98a2SYan Zheng } 41105d4f98a2SYan Zheng } 4111c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 411243a7e99dSNikolay Borisov ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags); 41139689457bSShilong Wang if (ret == 1) { 4114c87f08caSChris Mason err = 0; 4115c87f08caSChris Mason progress = 0; 4116c87f08caSChris Mason goto restart; 4117c87f08caSChris Mason } 4118c87f08caSChris Mason } 41193fd0a558SYan, Zheng 4120b3b4aa74SDavid Sterba btrfs_release_path(path); 412191166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 41225d4f98a2SYan Zheng 41235d4f98a2SYan Zheng if (trans) { 41243a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 41252ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 41265d4f98a2SYan Zheng } 41275d4f98a2SYan Zheng 41280257bb82SYan, Zheng if (!err) { 41293fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 41303fd0a558SYan, Zheng &rc->cluster); 41310257bb82SYan, Zheng if (ret < 0) 41320257bb82SYan, Zheng err = ret; 41330257bb82SYan, Zheng } 41340257bb82SYan, Zheng 41353fd0a558SYan, Zheng rc->create_reloc_tree = 0; 41363fd0a558SYan, Zheng set_reloc_control(rc); 41370257bb82SYan, Zheng 41383fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 41392ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1); 41405d4f98a2SYan Zheng 41413fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 41425d4f98a2SYan Zheng 41435d4f98a2SYan Zheng merge_reloc_roots(rc); 41445d4f98a2SYan Zheng 41453fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 41465d4f98a2SYan Zheng unset_reloc_control(rc); 41472ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1); 41485d4f98a2SYan Zheng 41495d4f98a2SYan Zheng /* get rid of pinned extents */ 41507a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 415162b99540SQu Wenruo if (IS_ERR(trans)) { 41523612b495STsutomu Itoh err = PTR_ERR(trans); 415362b99540SQu Wenruo goto out_free; 415462b99540SQu Wenruo } 41553a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 4156d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4157d2311e69SQu Wenruo if (ret < 0 && !err) 4158d2311e69SQu Wenruo err = ret; 41593fd0a558SYan, Zheng out_free: 41602ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 41613fd0a558SYan, Zheng btrfs_free_path(path); 41625d4f98a2SYan Zheng return err; 41635d4f98a2SYan Zheng } 41645d4f98a2SYan Zheng 41655d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 41660257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 41675d4f98a2SYan Zheng { 41685d4f98a2SYan Zheng struct btrfs_path *path; 41695d4f98a2SYan Zheng struct btrfs_inode_item *item; 41705d4f98a2SYan Zheng struct extent_buffer *leaf; 41715d4f98a2SYan Zheng int ret; 41725d4f98a2SYan Zheng 41735d4f98a2SYan Zheng path = btrfs_alloc_path(); 41745d4f98a2SYan Zheng if (!path) 41755d4f98a2SYan Zheng return -ENOMEM; 41765d4f98a2SYan Zheng 41775d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 41785d4f98a2SYan Zheng if (ret) 41795d4f98a2SYan Zheng goto out; 41805d4f98a2SYan Zheng 41815d4f98a2SYan Zheng leaf = path->nodes[0]; 41825d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 4183b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 41845d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 41850257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 41865d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 41873fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 41883fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 41895d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 41905d4f98a2SYan Zheng out: 41915d4f98a2SYan Zheng btrfs_free_path(path); 41925d4f98a2SYan Zheng return ret; 41935d4f98a2SYan Zheng } 41945d4f98a2SYan Zheng 41955d4f98a2SYan Zheng /* 41965d4f98a2SYan Zheng * helper to create inode for data relocation. 41975d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 41985d4f98a2SYan Zheng */ 41993fd0a558SYan, Zheng static noinline_for_stack 42003fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 42015d4f98a2SYan Zheng struct btrfs_block_group_cache *group) 42025d4f98a2SYan Zheng { 42035d4f98a2SYan Zheng struct inode *inode = NULL; 42045d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 42055d4f98a2SYan Zheng struct btrfs_root *root; 42065d4f98a2SYan Zheng struct btrfs_key key; 42074624900dSZhaolei u64 objectid; 42085d4f98a2SYan Zheng int err = 0; 42095d4f98a2SYan Zheng 42105d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 42115d4f98a2SYan Zheng if (IS_ERR(root)) 42125d4f98a2SYan Zheng return ERR_CAST(root); 42135d4f98a2SYan Zheng 4214a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 42153fd0a558SYan, Zheng if (IS_ERR(trans)) 42163fd0a558SYan, Zheng return ERR_CAST(trans); 42175d4f98a2SYan Zheng 4218581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 42195d4f98a2SYan Zheng if (err) 42205d4f98a2SYan Zheng goto out; 42215d4f98a2SYan Zheng 42220257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 42235d4f98a2SYan Zheng BUG_ON(err); 42245d4f98a2SYan Zheng 42255d4f98a2SYan Zheng key.objectid = objectid; 42265d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 42275d4f98a2SYan Zheng key.offset = 0; 42280b246afaSJeff Mahoney inode = btrfs_iget(fs_info->sb, &key, root, NULL); 42292e19f1f9SAl Viro BUG_ON(IS_ERR(inode)); 42305d4f98a2SYan Zheng BTRFS_I(inode)->index_cnt = group->key.objectid; 42315d4f98a2SYan Zheng 423273f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 42335d4f98a2SYan Zheng out: 42343a45bb20SJeff Mahoney btrfs_end_transaction(trans); 42352ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 42365d4f98a2SYan Zheng if (err) { 42375d4f98a2SYan Zheng if (inode) 42385d4f98a2SYan Zheng iput(inode); 42395d4f98a2SYan Zheng inode = ERR_PTR(err); 42405d4f98a2SYan Zheng } 42415d4f98a2SYan Zheng return inode; 42425d4f98a2SYan Zheng } 42435d4f98a2SYan Zheng 4244c258d6e3SQu Wenruo static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 42453fd0a558SYan, Zheng { 42463fd0a558SYan, Zheng struct reloc_control *rc; 42473fd0a558SYan, Zheng 42483fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 42493fd0a558SYan, Zheng if (!rc) 42503fd0a558SYan, Zheng return NULL; 42513fd0a558SYan, Zheng 42523fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 4253d2311e69SQu Wenruo INIT_LIST_HEAD(&rc->dirty_subvol_roots); 42543fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 42553fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 425643eb5f29SQu Wenruo extent_io_tree_init(fs_info, &rc->processed_blocks, 425743eb5f29SQu Wenruo IO_TREE_RELOC_BLOCKS, NULL); 42583fd0a558SYan, Zheng return rc; 42593fd0a558SYan, Zheng } 42603fd0a558SYan, Zheng 42615d4f98a2SYan Zheng /* 4262ebce0e01SAdam Borowski * Print the block group being relocated 4263ebce0e01SAdam Borowski */ 4264ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 4265ebce0e01SAdam Borowski struct btrfs_block_group_cache *block_group) 4266ebce0e01SAdam Borowski { 4267f89e09cfSAnand Jain char buf[128] = {'\0'}; 4268ebce0e01SAdam Borowski 4269f89e09cfSAnand Jain btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf)); 4270ebce0e01SAdam Borowski 4271ebce0e01SAdam Borowski btrfs_info(fs_info, 4272ebce0e01SAdam Borowski "relocating block group %llu flags %s", 4273f89e09cfSAnand Jain block_group->key.objectid, buf); 4274ebce0e01SAdam Borowski } 4275ebce0e01SAdam Borowski 4276ebce0e01SAdam Borowski /* 42775d4f98a2SYan Zheng * function to relocate all extents in a block group. 42785d4f98a2SYan Zheng */ 42796bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 42805d4f98a2SYan Zheng { 4281eede2bf3SOmar Sandoval struct btrfs_block_group_cache *bg; 42826bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 42835d4f98a2SYan Zheng struct reloc_control *rc; 42840af3d00bSJosef Bacik struct inode *inode; 42850af3d00bSJosef Bacik struct btrfs_path *path; 42865d4f98a2SYan Zheng int ret; 4287f0486c68SYan, Zheng int rw = 0; 42885d4f98a2SYan Zheng int err = 0; 42895d4f98a2SYan Zheng 4290eede2bf3SOmar Sandoval bg = btrfs_lookup_block_group(fs_info, group_start); 4291eede2bf3SOmar Sandoval if (!bg) 4292eede2bf3SOmar Sandoval return -ENOENT; 4293eede2bf3SOmar Sandoval 4294eede2bf3SOmar Sandoval if (btrfs_pinned_by_swapfile(fs_info, bg)) { 4295eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 4296eede2bf3SOmar Sandoval return -ETXTBSY; 4297eede2bf3SOmar Sandoval } 4298eede2bf3SOmar Sandoval 4299c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 4300eede2bf3SOmar Sandoval if (!rc) { 4301eede2bf3SOmar Sandoval btrfs_put_block_group(bg); 43025d4f98a2SYan Zheng return -ENOMEM; 4303eede2bf3SOmar Sandoval } 43045d4f98a2SYan Zheng 4305f0486c68SYan, Zheng rc->extent_root = extent_root; 4306eede2bf3SOmar Sandoval rc->block_group = bg; 43075d4f98a2SYan Zheng 4308c83488afSNikolay Borisov ret = btrfs_inc_block_group_ro(rc->block_group); 4309f0486c68SYan, Zheng if (ret) { 4310f0486c68SYan, Zheng err = ret; 4311f0486c68SYan, Zheng goto out; 4312f0486c68SYan, Zheng } 4313f0486c68SYan, Zheng rw = 1; 4314f0486c68SYan, Zheng 43150af3d00bSJosef Bacik path = btrfs_alloc_path(); 43160af3d00bSJosef Bacik if (!path) { 43170af3d00bSJosef Bacik err = -ENOMEM; 43180af3d00bSJosef Bacik goto out; 43190af3d00bSJosef Bacik } 43200af3d00bSJosef Bacik 43217949f339SDavid Sterba inode = lookup_free_space_inode(rc->block_group, path); 43220af3d00bSJosef Bacik btrfs_free_path(path); 43230af3d00bSJosef Bacik 43240af3d00bSJosef Bacik if (!IS_ERR(inode)) 43251bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 43260af3d00bSJosef Bacik else 43270af3d00bSJosef Bacik ret = PTR_ERR(inode); 43280af3d00bSJosef Bacik 43290af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 43300af3d00bSJosef Bacik err = ret; 43310af3d00bSJosef Bacik goto out; 43320af3d00bSJosef Bacik } 43330af3d00bSJosef Bacik 43345d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 43355d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 43365d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 43375d4f98a2SYan Zheng rc->data_inode = NULL; 43385d4f98a2SYan Zheng goto out; 43395d4f98a2SYan Zheng } 43405d4f98a2SYan Zheng 43410b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 43425d4f98a2SYan Zheng 43439cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4344f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 43456374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 4346578def7cSFilipe Manana rc->block_group->key.objectid, 4347578def7cSFilipe Manana rc->block_group->key.offset); 43485d4f98a2SYan Zheng 43495d4f98a2SYan Zheng while (1) { 435076dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 43515d4f98a2SYan Zheng ret = relocate_block_group(rc); 435276dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 4353ff612ba7SJosef Bacik if (ret < 0) 43545d4f98a2SYan Zheng err = ret; 4355ff612ba7SJosef Bacik 4356ff612ba7SJosef Bacik /* 4357ff612ba7SJosef Bacik * We may have gotten ENOSPC after we already dirtied some 4358ff612ba7SJosef Bacik * extents. If writeout happens while we're relocating a 4359ff612ba7SJosef Bacik * different block group we could end up hitting the 4360ff612ba7SJosef Bacik * BUG_ON(rc->stage == UPDATE_DATA_PTRS) in 4361ff612ba7SJosef Bacik * btrfs_reloc_cow_block. Make sure we write everything out 4362ff612ba7SJosef Bacik * properly so we don't trip over this problem, and then break 4363ff612ba7SJosef Bacik * out of the loop if we hit an error. 4364ff612ba7SJosef Bacik */ 4365ff612ba7SJosef Bacik if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 4366ff612ba7SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 4367ff612ba7SJosef Bacik (u64)-1); 4368ff612ba7SJosef Bacik if (ret) 4369ff612ba7SJosef Bacik err = ret; 4370ff612ba7SJosef Bacik invalidate_mapping_pages(rc->data_inode->i_mapping, 4371ff612ba7SJosef Bacik 0, -1); 4372ff612ba7SJosef Bacik rc->stage = UPDATE_DATA_PTRS; 43735d4f98a2SYan Zheng } 43745d4f98a2SYan Zheng 4375ff612ba7SJosef Bacik if (err < 0) 4376ff612ba7SJosef Bacik goto out; 4377ff612ba7SJosef Bacik 43785d4f98a2SYan Zheng if (rc->extents_found == 0) 43795d4f98a2SYan Zheng break; 43805d4f98a2SYan Zheng 43810b246afaSJeff Mahoney btrfs_info(fs_info, "found %llu extents", rc->extents_found); 43825d4f98a2SYan Zheng 43835d4f98a2SYan Zheng } 43845d4f98a2SYan Zheng 43855d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 43865d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 43875d4f98a2SYan Zheng WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0); 43885d4f98a2SYan Zheng out: 4389f0486c68SYan, Zheng if (err && rw) 43902ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 43915d4f98a2SYan Zheng iput(rc->data_inode); 43925d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 43935d4f98a2SYan Zheng kfree(rc); 43945d4f98a2SYan Zheng return err; 43955d4f98a2SYan Zheng } 43965d4f98a2SYan Zheng 439776dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 439876dda93cSYan, Zheng { 43990b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 440076dda93cSYan, Zheng struct btrfs_trans_handle *trans; 440179787eaaSJeff Mahoney int ret, err; 440276dda93cSYan, Zheng 44030b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 440479787eaaSJeff Mahoney if (IS_ERR(trans)) 440579787eaaSJeff Mahoney return PTR_ERR(trans); 440676dda93cSYan, Zheng 440776dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 440876dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 440976dda93cSYan, Zheng root->root_item.drop_level = 0; 441076dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 44110b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 441276dda93cSYan, Zheng &root->root_key, &root->root_item); 441376dda93cSYan, Zheng 44143a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 441579787eaaSJeff Mahoney if (err) 441679787eaaSJeff Mahoney return err; 441779787eaaSJeff Mahoney return ret; 441876dda93cSYan, Zheng } 441976dda93cSYan, Zheng 44205d4f98a2SYan Zheng /* 44215d4f98a2SYan Zheng * recover relocation interrupted by system crash. 44225d4f98a2SYan Zheng * 44235d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 44245d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 44255d4f98a2SYan Zheng */ 44265d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 44275d4f98a2SYan Zheng { 44280b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 44295d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 44305d4f98a2SYan Zheng struct btrfs_key key; 44315d4f98a2SYan Zheng struct btrfs_root *fs_root; 44325d4f98a2SYan Zheng struct btrfs_root *reloc_root; 44335d4f98a2SYan Zheng struct btrfs_path *path; 44345d4f98a2SYan Zheng struct extent_buffer *leaf; 44355d4f98a2SYan Zheng struct reloc_control *rc = NULL; 44365d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 44375d4f98a2SYan Zheng int ret; 44385d4f98a2SYan Zheng int err = 0; 44395d4f98a2SYan Zheng 44405d4f98a2SYan Zheng path = btrfs_alloc_path(); 44415d4f98a2SYan Zheng if (!path) 44425d4f98a2SYan Zheng return -ENOMEM; 4443e4058b54SDavid Sterba path->reada = READA_BACK; 44445d4f98a2SYan Zheng 44455d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 44465d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 44475d4f98a2SYan Zheng key.offset = (u64)-1; 44485d4f98a2SYan Zheng 44495d4f98a2SYan Zheng while (1) { 44500b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 44515d4f98a2SYan Zheng path, 0, 0); 44525d4f98a2SYan Zheng if (ret < 0) { 44535d4f98a2SYan Zheng err = ret; 44545d4f98a2SYan Zheng goto out; 44555d4f98a2SYan Zheng } 44565d4f98a2SYan Zheng if (ret > 0) { 44575d4f98a2SYan Zheng if (path->slots[0] == 0) 44585d4f98a2SYan Zheng break; 44595d4f98a2SYan Zheng path->slots[0]--; 44605d4f98a2SYan Zheng } 44615d4f98a2SYan Zheng leaf = path->nodes[0]; 44625d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4463b3b4aa74SDavid Sterba btrfs_release_path(path); 44645d4f98a2SYan Zheng 44655d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 44665d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 44675d4f98a2SYan Zheng break; 44685d4f98a2SYan Zheng 4469cb517eabSMiao Xie reloc_root = btrfs_read_fs_root(root, &key); 44705d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 44715d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 44725d4f98a2SYan Zheng goto out; 44735d4f98a2SYan Zheng } 44745d4f98a2SYan Zheng 44755d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 44765d4f98a2SYan Zheng 44775d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 44780b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, 44795d4f98a2SYan Zheng reloc_root->root_key.offset); 44805d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 448176dda93cSYan, Zheng ret = PTR_ERR(fs_root); 448276dda93cSYan, Zheng if (ret != -ENOENT) { 448376dda93cSYan, Zheng err = ret; 44845d4f98a2SYan Zheng goto out; 44855d4f98a2SYan Zheng } 448679787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 448779787eaaSJeff Mahoney if (ret < 0) { 448879787eaaSJeff Mahoney err = ret; 448979787eaaSJeff Mahoney goto out; 449079787eaaSJeff Mahoney } 449176dda93cSYan, Zheng } 44925d4f98a2SYan Zheng } 44935d4f98a2SYan Zheng 44945d4f98a2SYan Zheng if (key.offset == 0) 44955d4f98a2SYan Zheng break; 44965d4f98a2SYan Zheng 44975d4f98a2SYan Zheng key.offset--; 44985d4f98a2SYan Zheng } 4499b3b4aa74SDavid Sterba btrfs_release_path(path); 45005d4f98a2SYan Zheng 45015d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 45025d4f98a2SYan Zheng goto out; 45035d4f98a2SYan Zheng 4504c258d6e3SQu Wenruo rc = alloc_reloc_control(fs_info); 45055d4f98a2SYan Zheng if (!rc) { 45065d4f98a2SYan Zheng err = -ENOMEM; 45075d4f98a2SYan Zheng goto out; 45085d4f98a2SYan Zheng } 45095d4f98a2SYan Zheng 45100b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 45115d4f98a2SYan Zheng 45125d4f98a2SYan Zheng set_reloc_control(rc); 45135d4f98a2SYan Zheng 45147a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 45153612b495STsutomu Itoh if (IS_ERR(trans)) { 45163612b495STsutomu Itoh unset_reloc_control(rc); 45173612b495STsutomu Itoh err = PTR_ERR(trans); 45183612b495STsutomu Itoh goto out_free; 45193612b495STsutomu Itoh } 45203fd0a558SYan, Zheng 45213fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 45223fd0a558SYan, Zheng 45235d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 45245d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 45255d4f98a2SYan Zheng struct btrfs_root, root_list); 45265d4f98a2SYan Zheng list_del(&reloc_root->root_list); 45275d4f98a2SYan Zheng 45285d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 45295d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 45305d4f98a2SYan Zheng &rc->reloc_roots); 45315d4f98a2SYan Zheng continue; 45325d4f98a2SYan Zheng } 45335d4f98a2SYan Zheng 45340b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, reloc_root->root_key.offset); 453579787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 453679787eaaSJeff Mahoney err = PTR_ERR(fs_root); 453779787eaaSJeff Mahoney goto out_free; 453879787eaaSJeff Mahoney } 45395d4f98a2SYan Zheng 4540ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 454179787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 45425d4f98a2SYan Zheng fs_root->reloc_root = reloc_root; 45435d4f98a2SYan Zheng } 45445d4f98a2SYan Zheng 45453a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 454679787eaaSJeff Mahoney if (err) 454779787eaaSJeff Mahoney goto out_free; 45485d4f98a2SYan Zheng 45495d4f98a2SYan Zheng merge_reloc_roots(rc); 45505d4f98a2SYan Zheng 45515d4f98a2SYan Zheng unset_reloc_control(rc); 45525d4f98a2SYan Zheng 45537a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 455462b99540SQu Wenruo if (IS_ERR(trans)) { 45553612b495STsutomu Itoh err = PTR_ERR(trans); 455662b99540SQu Wenruo goto out_free; 455762b99540SQu Wenruo } 45583a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 4559d2311e69SQu Wenruo 4560d2311e69SQu Wenruo ret = clean_dirty_subvols(rc); 4561d2311e69SQu Wenruo if (ret < 0 && !err) 4562d2311e69SQu Wenruo err = ret; 45633612b495STsutomu Itoh out_free: 45645d4f98a2SYan Zheng kfree(rc); 45653612b495STsutomu Itoh out: 4566aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4567aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4568aca1bba6SLiu Bo 45695d4f98a2SYan Zheng btrfs_free_path(path); 45705d4f98a2SYan Zheng 45715d4f98a2SYan Zheng if (err == 0) { 45725d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 45730b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 45745d4f98a2SYan Zheng if (IS_ERR(fs_root)) 45755d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4576d7ce5843SMiao Xie else 457766b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 45785d4f98a2SYan Zheng } 45795d4f98a2SYan Zheng return err; 45805d4f98a2SYan Zheng } 45815d4f98a2SYan Zheng 45825d4f98a2SYan Zheng /* 45835d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 45845d4f98a2SYan Zheng * 45855d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 45865d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 45875d4f98a2SYan Zheng */ 45885d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 45895d4f98a2SYan Zheng { 45900b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 45915d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 45925d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 45935d4f98a2SYan Zheng int ret; 45945d4f98a2SYan Zheng u64 disk_bytenr; 45954577b014SJosef Bacik u64 new_bytenr; 45965d4f98a2SYan Zheng LIST_HEAD(list); 45975d4f98a2SYan Zheng 45985d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 45995d4f98a2SYan Zheng BUG_ON(ordered->file_offset != file_pos || ordered->len != len); 46005d4f98a2SYan Zheng 46015d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 46020b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4603a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 460479787eaaSJeff Mahoney if (ret) 460579787eaaSJeff Mahoney goto out; 46065d4f98a2SYan Zheng 46075d4f98a2SYan Zheng while (!list_empty(&list)) { 46085d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 46095d4f98a2SYan Zheng list_del_init(&sums->list); 46105d4f98a2SYan Zheng 46114577b014SJosef Bacik /* 46124577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 46134577b014SJosef Bacik * We need to do this because we will read in entire prealloc 46144577b014SJosef Bacik * extents but we may have written to say the middle of the 46154577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 46164577b014SJosef Bacik * the right disk offset. 46174577b014SJosef Bacik * 46184577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 46194577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 46204577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 46214577b014SJosef Bacik * disk length. 46224577b014SJosef Bacik */ 46234577b014SJosef Bacik new_bytenr = ordered->start + (sums->bytenr - disk_bytenr); 46244577b014SJosef Bacik sums->bytenr = new_bytenr; 46255d4f98a2SYan Zheng 4626f9756261SNikolay Borisov btrfs_add_ordered_sum(ordered, sums); 46275d4f98a2SYan Zheng } 462879787eaaSJeff Mahoney out: 46295d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4630411fc6bcSAndi Kleen return ret; 46315d4f98a2SYan Zheng } 46323fd0a558SYan, Zheng 463383d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 46343fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 46353fd0a558SYan, Zheng struct extent_buffer *cow) 46363fd0a558SYan, Zheng { 46370b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 46383fd0a558SYan, Zheng struct reloc_control *rc; 46393fd0a558SYan, Zheng struct backref_node *node; 46403fd0a558SYan, Zheng int first_cow = 0; 46413fd0a558SYan, Zheng int level; 464283d4cfd4SJosef Bacik int ret = 0; 46433fd0a558SYan, Zheng 46440b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 46453fd0a558SYan, Zheng if (!rc) 464683d4cfd4SJosef Bacik return 0; 46473fd0a558SYan, Zheng 46483fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 46493fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 46503fd0a558SYan, Zheng 4651c974c464SWang Shilong if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 4652c974c464SWang Shilong if (buf == root->node) 4653c974c464SWang Shilong __update_reloc_root(root, cow->start); 4654c974c464SWang Shilong } 4655c974c464SWang Shilong 46563fd0a558SYan, Zheng level = btrfs_header_level(buf); 46573fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 46583fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 46593fd0a558SYan, Zheng first_cow = 1; 46603fd0a558SYan, Zheng 46613fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 46623fd0a558SYan, Zheng rc->create_reloc_tree) { 46633fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 46643fd0a558SYan, Zheng 46653fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 46663fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 46673fd0a558SYan, Zheng node->new_bytenr != buf->start); 46683fd0a558SYan, Zheng 46693fd0a558SYan, Zheng drop_node_buffer(node); 46703fd0a558SYan, Zheng extent_buffer_get(cow); 46713fd0a558SYan, Zheng node->eb = cow; 46723fd0a558SYan, Zheng node->new_bytenr = cow->start; 46733fd0a558SYan, Zheng 46743fd0a558SYan, Zheng if (!node->pending) { 46753fd0a558SYan, Zheng list_move_tail(&node->list, 46763fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 46773fd0a558SYan, Zheng node->pending = 1; 46783fd0a558SYan, Zheng } 46793fd0a558SYan, Zheng 46803fd0a558SYan, Zheng if (first_cow) 46813fd0a558SYan, Zheng __mark_block_processed(rc, node); 46823fd0a558SYan, Zheng 46833fd0a558SYan, Zheng if (first_cow && level > 0) 46843fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 46853fd0a558SYan, Zheng } 46863fd0a558SYan, Zheng 468783d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 46883fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 468983d4cfd4SJosef Bacik return ret; 46903fd0a558SYan, Zheng } 46913fd0a558SYan, Zheng 46923fd0a558SYan, Zheng /* 46933fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 469401327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 46953fd0a558SYan, Zheng */ 4696147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 46973fd0a558SYan, Zheng u64 *bytes_to_reserve) 46983fd0a558SYan, Zheng { 469910995c04SQu Wenruo struct btrfs_root *root = pending->root; 470010995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 47013fd0a558SYan, Zheng 470210995c04SQu Wenruo if (!root->reloc_root || !rc) 47033fd0a558SYan, Zheng return; 47043fd0a558SYan, Zheng 47053fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 47063fd0a558SYan, Zheng return; 47073fd0a558SYan, Zheng 47083fd0a558SYan, Zheng root = root->reloc_root; 47093fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 47103fd0a558SYan, Zheng /* 47113fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 47123fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 47133fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 47143fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 47153fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 47163fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 47173fd0a558SYan, Zheng * tree may use more space than it frees. so we need 47183fd0a558SYan, Zheng * reserve extra space. 47193fd0a558SYan, Zheng */ 47203fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 47213fd0a558SYan, Zheng } 47223fd0a558SYan, Zheng 47233fd0a558SYan, Zheng /* 47243fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 47253fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 47263fd0a558SYan, Zheng */ 472749b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 47283fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 47293fd0a558SYan, Zheng { 47303fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 47313fd0a558SYan, Zheng struct btrfs_root *reloc_root; 47323fd0a558SYan, Zheng struct btrfs_root *new_root; 473310995c04SQu Wenruo struct reloc_control *rc = root->fs_info->reloc_ctl; 47343fd0a558SYan, Zheng int ret; 47353fd0a558SYan, Zheng 473610995c04SQu Wenruo if (!root->reloc_root || !rc) 473749b25e05SJeff Mahoney return 0; 47383fd0a558SYan, Zheng 47393fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 47403fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 47413fd0a558SYan, Zheng 47423fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 47433fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 47443fd0a558SYan, Zheng rc->block_rsv, 47453a584174SLu Fengqi rc->nodes_relocated, true); 474649b25e05SJeff Mahoney if (ret) 474749b25e05SJeff Mahoney return ret; 47483fd0a558SYan, Zheng } 47493fd0a558SYan, Zheng 47503fd0a558SYan, Zheng new_root = pending->snap; 47513fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 47523fd0a558SYan, Zheng new_root->root_key.objectid); 475349b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 475449b25e05SJeff Mahoney return PTR_ERR(reloc_root); 47553fd0a558SYan, Zheng 4756ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4757ffd7b339SJeff Mahoney BUG_ON(ret < 0); 47583fd0a558SYan, Zheng new_root->reloc_root = reloc_root; 47593fd0a558SYan, Zheng 476049b25e05SJeff Mahoney if (rc->create_reloc_tree) 47613fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 476249b25e05SJeff Mahoney return ret; 47633fd0a558SYan, Zheng } 4764