15d4f98a2SYan Zheng /* 25d4f98a2SYan Zheng * Copyright (C) 2009 Oracle. All rights reserved. 35d4f98a2SYan Zheng * 45d4f98a2SYan Zheng * This program is free software; you can redistribute it and/or 55d4f98a2SYan Zheng * modify it under the terms of the GNU General Public 65d4f98a2SYan Zheng * License v2 as published by the Free Software Foundation. 75d4f98a2SYan Zheng * 85d4f98a2SYan Zheng * This program is distributed in the hope that it will be useful, 95d4f98a2SYan Zheng * but WITHOUT ANY WARRANTY; without even the implied warranty of 105d4f98a2SYan Zheng * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 115d4f98a2SYan Zheng * General Public License for more details. 125d4f98a2SYan Zheng * 135d4f98a2SYan Zheng * You should have received a copy of the GNU General Public 145d4f98a2SYan Zheng * License along with this program; if not, write to the 155d4f98a2SYan Zheng * Free Software Foundation, Inc., 59 Temple Place - Suite 330, 165d4f98a2SYan Zheng * Boston, MA 021110-1307, USA. 175d4f98a2SYan Zheng */ 185d4f98a2SYan Zheng 195d4f98a2SYan Zheng #include <linux/sched.h> 205d4f98a2SYan Zheng #include <linux/pagemap.h> 215d4f98a2SYan Zheng #include <linux/writeback.h> 225d4f98a2SYan Zheng #include <linux/blkdev.h> 235d4f98a2SYan Zheng #include <linux/rbtree.h> 245a0e3ad6STejun Heo #include <linux/slab.h> 255d4f98a2SYan Zheng #include "ctree.h" 265d4f98a2SYan Zheng #include "disk-io.h" 275d4f98a2SYan Zheng #include "transaction.h" 285d4f98a2SYan Zheng #include "volumes.h" 295d4f98a2SYan Zheng #include "locking.h" 305d4f98a2SYan Zheng #include "btrfs_inode.h" 315d4f98a2SYan Zheng #include "async-thread.h" 320af3d00bSJosef Bacik #include "free-space-cache.h" 33581bb050SLi Zefan #include "inode-map.h" 345d4f98a2SYan Zheng 355d4f98a2SYan Zheng /* 365d4f98a2SYan Zheng * backref_node, mapping_node and tree_block start with this 375d4f98a2SYan Zheng */ 385d4f98a2SYan Zheng struct tree_entry { 395d4f98a2SYan Zheng struct rb_node rb_node; 405d4f98a2SYan Zheng u64 bytenr; 415d4f98a2SYan Zheng }; 425d4f98a2SYan Zheng 435d4f98a2SYan Zheng /* 445d4f98a2SYan Zheng * present a tree block in the backref cache 455d4f98a2SYan Zheng */ 465d4f98a2SYan Zheng struct backref_node { 475d4f98a2SYan Zheng struct rb_node rb_node; 485d4f98a2SYan Zheng u64 bytenr; 493fd0a558SYan, Zheng 503fd0a558SYan, Zheng u64 new_bytenr; 513fd0a558SYan, Zheng /* objectid of tree block owner, can be not uptodate */ 525d4f98a2SYan Zheng u64 owner; 533fd0a558SYan, Zheng /* link to pending, changed or detached list */ 543fd0a558SYan, Zheng struct list_head list; 555d4f98a2SYan Zheng /* list of upper level blocks reference this block */ 565d4f98a2SYan Zheng struct list_head upper; 575d4f98a2SYan Zheng /* list of child blocks in the cache */ 585d4f98a2SYan Zheng struct list_head lower; 595d4f98a2SYan Zheng /* NULL if this node is not tree root */ 605d4f98a2SYan Zheng struct btrfs_root *root; 615d4f98a2SYan Zheng /* extent buffer got by COW the block */ 625d4f98a2SYan Zheng struct extent_buffer *eb; 635d4f98a2SYan Zheng /* level of tree block */ 645d4f98a2SYan Zheng unsigned int level:8; 653fd0a558SYan, Zheng /* is the block in non-reference counted tree */ 663fd0a558SYan, Zheng unsigned int cowonly:1; 673fd0a558SYan, Zheng /* 1 if no child node in the cache */ 685d4f98a2SYan Zheng unsigned int lowest:1; 695d4f98a2SYan Zheng /* is the extent buffer locked */ 705d4f98a2SYan Zheng unsigned int locked:1; 715d4f98a2SYan Zheng /* has the block been processed */ 725d4f98a2SYan Zheng unsigned int processed:1; 735d4f98a2SYan Zheng /* have backrefs of this block been checked */ 745d4f98a2SYan Zheng unsigned int checked:1; 753fd0a558SYan, Zheng /* 763fd0a558SYan, Zheng * 1 if corresponding block has been cowed but some upper 773fd0a558SYan, Zheng * level block pointers may not point to the new location 783fd0a558SYan, Zheng */ 793fd0a558SYan, Zheng unsigned int pending:1; 803fd0a558SYan, Zheng /* 813fd0a558SYan, Zheng * 1 if the backref node isn't connected to any other 823fd0a558SYan, Zheng * backref node. 833fd0a558SYan, Zheng */ 843fd0a558SYan, Zheng unsigned int detached:1; 855d4f98a2SYan Zheng }; 865d4f98a2SYan Zheng 875d4f98a2SYan Zheng /* 885d4f98a2SYan Zheng * present a block pointer in the backref cache 895d4f98a2SYan Zheng */ 905d4f98a2SYan Zheng struct backref_edge { 915d4f98a2SYan Zheng struct list_head list[2]; 925d4f98a2SYan Zheng struct backref_node *node[2]; 935d4f98a2SYan Zheng }; 945d4f98a2SYan Zheng 955d4f98a2SYan Zheng #define LOWER 0 965d4f98a2SYan Zheng #define UPPER 1 970647bf56SWang Shilong #define RELOCATION_RESERVED_NODES 256 985d4f98a2SYan Zheng 995d4f98a2SYan Zheng struct backref_cache { 1005d4f98a2SYan Zheng /* red black tree of all backref nodes in the cache */ 1015d4f98a2SYan Zheng struct rb_root rb_root; 1023fd0a558SYan, Zheng /* for passing backref nodes to btrfs_reloc_cow_block */ 1033fd0a558SYan, Zheng struct backref_node *path[BTRFS_MAX_LEVEL]; 1043fd0a558SYan, Zheng /* 1053fd0a558SYan, Zheng * list of blocks that have been cowed but some block 1063fd0a558SYan, Zheng * pointers in upper level blocks may not reflect the 1073fd0a558SYan, Zheng * new location 1083fd0a558SYan, Zheng */ 1095d4f98a2SYan Zheng struct list_head pending[BTRFS_MAX_LEVEL]; 1103fd0a558SYan, Zheng /* list of backref nodes with no child node */ 1113fd0a558SYan, Zheng struct list_head leaves; 1123fd0a558SYan, Zheng /* list of blocks that have been cowed in current transaction */ 1133fd0a558SYan, Zheng struct list_head changed; 1143fd0a558SYan, Zheng /* list of detached backref node. */ 1153fd0a558SYan, Zheng struct list_head detached; 1163fd0a558SYan, Zheng 1173fd0a558SYan, Zheng u64 last_trans; 1183fd0a558SYan, Zheng 1193fd0a558SYan, Zheng int nr_nodes; 1203fd0a558SYan, Zheng int nr_edges; 1215d4f98a2SYan Zheng }; 1225d4f98a2SYan Zheng 1235d4f98a2SYan Zheng /* 1245d4f98a2SYan Zheng * map address of tree root to tree 1255d4f98a2SYan Zheng */ 1265d4f98a2SYan Zheng struct mapping_node { 1275d4f98a2SYan Zheng struct rb_node rb_node; 1285d4f98a2SYan Zheng u64 bytenr; 1295d4f98a2SYan Zheng void *data; 1305d4f98a2SYan Zheng }; 1315d4f98a2SYan Zheng 1325d4f98a2SYan Zheng struct mapping_tree { 1335d4f98a2SYan Zheng struct rb_root rb_root; 1345d4f98a2SYan Zheng spinlock_t lock; 1355d4f98a2SYan Zheng }; 1365d4f98a2SYan Zheng 1375d4f98a2SYan Zheng /* 1385d4f98a2SYan Zheng * present a tree block to process 1395d4f98a2SYan Zheng */ 1405d4f98a2SYan Zheng struct tree_block { 1415d4f98a2SYan Zheng struct rb_node rb_node; 1425d4f98a2SYan Zheng u64 bytenr; 1435d4f98a2SYan Zheng struct btrfs_key key; 1445d4f98a2SYan Zheng unsigned int level:8; 1455d4f98a2SYan Zheng unsigned int key_ready:1; 1465d4f98a2SYan Zheng }; 1475d4f98a2SYan Zheng 1480257bb82SYan, Zheng #define MAX_EXTENTS 128 1490257bb82SYan, Zheng 1500257bb82SYan, Zheng struct file_extent_cluster { 1510257bb82SYan, Zheng u64 start; 1520257bb82SYan, Zheng u64 end; 1530257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 1540257bb82SYan, Zheng unsigned int nr; 1550257bb82SYan, Zheng }; 1560257bb82SYan, Zheng 1575d4f98a2SYan Zheng struct reloc_control { 1585d4f98a2SYan Zheng /* block group to relocate */ 1595d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group; 1605d4f98a2SYan Zheng /* extent tree */ 1615d4f98a2SYan Zheng struct btrfs_root *extent_root; 1625d4f98a2SYan Zheng /* inode for moving data */ 1635d4f98a2SYan Zheng struct inode *data_inode; 1643fd0a558SYan, Zheng 1653fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 1663fd0a558SYan, Zheng 1673fd0a558SYan, Zheng struct backref_cache backref_cache; 1683fd0a558SYan, Zheng 1693fd0a558SYan, Zheng struct file_extent_cluster cluster; 1705d4f98a2SYan Zheng /* tree blocks have been processed */ 1715d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 1725d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 1735d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 1745d4f98a2SYan Zheng /* list of reloc trees */ 1755d4f98a2SYan Zheng struct list_head reloc_roots; 1763fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 1773fd0a558SYan, Zheng u64 merging_rsv_size; 1783fd0a558SYan, Zheng /* size of relocated tree nodes */ 1793fd0a558SYan, Zheng u64 nodes_relocated; 1800647bf56SWang Shilong /* reserved size for block group relocation*/ 1810647bf56SWang Shilong u64 reserved_bytes; 1823fd0a558SYan, Zheng 1835d4f98a2SYan Zheng u64 search_start; 1845d4f98a2SYan Zheng u64 extents_found; 1853fd0a558SYan, Zheng 1863fd0a558SYan, Zheng unsigned int stage:8; 1873fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 1883fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 1895d4f98a2SYan Zheng unsigned int found_file_extent:1; 1905d4f98a2SYan Zheng }; 1915d4f98a2SYan Zheng 1925d4f98a2SYan Zheng /* stages of data relocation */ 1935d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 1945d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 1955d4f98a2SYan Zheng 1963fd0a558SYan, Zheng static void remove_backref_node(struct backref_cache *cache, 1973fd0a558SYan, Zheng struct backref_node *node); 1983fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 1993fd0a558SYan, Zheng struct backref_node *node); 2005d4f98a2SYan Zheng 2015d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 2025d4f98a2SYan Zheng { 2036bef4d31SEric Paris tree->rb_root = RB_ROOT; 2045d4f98a2SYan Zheng spin_lock_init(&tree->lock); 2055d4f98a2SYan Zheng } 2065d4f98a2SYan Zheng 2075d4f98a2SYan Zheng static void backref_cache_init(struct backref_cache *cache) 2085d4f98a2SYan Zheng { 2095d4f98a2SYan Zheng int i; 2106bef4d31SEric Paris cache->rb_root = RB_ROOT; 2115d4f98a2SYan Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2125d4f98a2SYan Zheng INIT_LIST_HEAD(&cache->pending[i]); 2133fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->changed); 2143fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->detached); 2153fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->leaves); 2165d4f98a2SYan Zheng } 2175d4f98a2SYan Zheng 2183fd0a558SYan, Zheng static void backref_cache_cleanup(struct backref_cache *cache) 2195d4f98a2SYan Zheng { 2203fd0a558SYan, Zheng struct backref_node *node; 2213fd0a558SYan, Zheng int i; 2223fd0a558SYan, Zheng 2233fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2243fd0a558SYan, Zheng node = list_entry(cache->detached.next, 2253fd0a558SYan, Zheng struct backref_node, list); 2263fd0a558SYan, Zheng remove_backref_node(cache, node); 2273fd0a558SYan, Zheng } 2283fd0a558SYan, Zheng 2293fd0a558SYan, Zheng while (!list_empty(&cache->leaves)) { 2303fd0a558SYan, Zheng node = list_entry(cache->leaves.next, 2313fd0a558SYan, Zheng struct backref_node, lower); 2323fd0a558SYan, Zheng remove_backref_node(cache, node); 2333fd0a558SYan, Zheng } 2343fd0a558SYan, Zheng 2353fd0a558SYan, Zheng cache->last_trans = 0; 2363fd0a558SYan, Zheng 2373fd0a558SYan, Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 238f4907095SLiu Bo ASSERT(list_empty(&cache->pending[i])); 239f4907095SLiu Bo ASSERT(list_empty(&cache->changed)); 240f4907095SLiu Bo ASSERT(list_empty(&cache->detached)); 241f4907095SLiu Bo ASSERT(RB_EMPTY_ROOT(&cache->rb_root)); 242f4907095SLiu Bo ASSERT(!cache->nr_nodes); 243f4907095SLiu Bo ASSERT(!cache->nr_edges); 2443fd0a558SYan, Zheng } 2453fd0a558SYan, Zheng 2463fd0a558SYan, Zheng static struct backref_node *alloc_backref_node(struct backref_cache *cache) 2473fd0a558SYan, Zheng { 2483fd0a558SYan, Zheng struct backref_node *node; 2493fd0a558SYan, Zheng 2503fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 2513fd0a558SYan, Zheng if (node) { 2523fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 2535d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 2545d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 2555d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 2563fd0a558SYan, Zheng cache->nr_nodes++; 2573fd0a558SYan, Zheng } 2583fd0a558SYan, Zheng return node; 2593fd0a558SYan, Zheng } 2603fd0a558SYan, Zheng 2613fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 2623fd0a558SYan, Zheng struct backref_node *node) 2633fd0a558SYan, Zheng { 2643fd0a558SYan, Zheng if (node) { 2653fd0a558SYan, Zheng cache->nr_nodes--; 2663fd0a558SYan, Zheng kfree(node); 2673fd0a558SYan, Zheng } 2683fd0a558SYan, Zheng } 2693fd0a558SYan, Zheng 2703fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 2713fd0a558SYan, Zheng { 2723fd0a558SYan, Zheng struct backref_edge *edge; 2733fd0a558SYan, Zheng 2743fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 2753fd0a558SYan, Zheng if (edge) 2763fd0a558SYan, Zheng cache->nr_edges++; 2773fd0a558SYan, Zheng return edge; 2783fd0a558SYan, Zheng } 2793fd0a558SYan, Zheng 2803fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 2813fd0a558SYan, Zheng struct backref_edge *edge) 2823fd0a558SYan, Zheng { 2833fd0a558SYan, Zheng if (edge) { 2843fd0a558SYan, Zheng cache->nr_edges--; 2853fd0a558SYan, Zheng kfree(edge); 2863fd0a558SYan, Zheng } 2875d4f98a2SYan Zheng } 2885d4f98a2SYan Zheng 2895d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 2905d4f98a2SYan Zheng struct rb_node *node) 2915d4f98a2SYan Zheng { 2925d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 2935d4f98a2SYan Zheng struct rb_node *parent = NULL; 2945d4f98a2SYan Zheng struct tree_entry *entry; 2955d4f98a2SYan Zheng 2965d4f98a2SYan Zheng while (*p) { 2975d4f98a2SYan Zheng parent = *p; 2985d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 2995d4f98a2SYan Zheng 3005d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3015d4f98a2SYan Zheng p = &(*p)->rb_left; 3025d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3035d4f98a2SYan Zheng p = &(*p)->rb_right; 3045d4f98a2SYan Zheng else 3055d4f98a2SYan Zheng return parent; 3065d4f98a2SYan Zheng } 3075d4f98a2SYan Zheng 3085d4f98a2SYan Zheng rb_link_node(node, parent, p); 3095d4f98a2SYan Zheng rb_insert_color(node, root); 3105d4f98a2SYan Zheng return NULL; 3115d4f98a2SYan Zheng } 3125d4f98a2SYan Zheng 3135d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 3145d4f98a2SYan Zheng { 3155d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 3165d4f98a2SYan Zheng struct tree_entry *entry; 3175d4f98a2SYan Zheng 3185d4f98a2SYan Zheng while (n) { 3195d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 3205d4f98a2SYan Zheng 3215d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3225d4f98a2SYan Zheng n = n->rb_left; 3235d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3245d4f98a2SYan Zheng n = n->rb_right; 3255d4f98a2SYan Zheng else 3265d4f98a2SYan Zheng return n; 3275d4f98a2SYan Zheng } 3285d4f98a2SYan Zheng return NULL; 3295d4f98a2SYan Zheng } 3305d4f98a2SYan Zheng 33148a3b636SEric Sandeen static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) 33243c04fb1SJeff Mahoney { 33343c04fb1SJeff Mahoney 33443c04fb1SJeff Mahoney struct btrfs_fs_info *fs_info = NULL; 33543c04fb1SJeff Mahoney struct backref_node *bnode = rb_entry(rb_node, struct backref_node, 33643c04fb1SJeff Mahoney rb_node); 33743c04fb1SJeff Mahoney if (bnode->root) 33843c04fb1SJeff Mahoney fs_info = bnode->root->fs_info; 33943c04fb1SJeff Mahoney btrfs_panic(fs_info, errno, "Inconsistency in backref cache " 340351fd353SDavid Sterba "found at offset %llu", bytenr); 34143c04fb1SJeff Mahoney } 34243c04fb1SJeff Mahoney 3435d4f98a2SYan Zheng /* 3445d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 3455d4f98a2SYan Zheng */ 3465d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 3475d4f98a2SYan Zheng struct backref_edge *edges[], 3485d4f98a2SYan Zheng int *index) 3495d4f98a2SYan Zheng { 3505d4f98a2SYan Zheng struct backref_edge *edge; 3515d4f98a2SYan Zheng int idx = *index; 3525d4f98a2SYan Zheng 3535d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 3545d4f98a2SYan Zheng edge = list_entry(node->upper.next, 3555d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3565d4f98a2SYan Zheng edges[idx++] = edge; 3575d4f98a2SYan Zheng node = edge->node[UPPER]; 3585d4f98a2SYan Zheng } 3593fd0a558SYan, Zheng BUG_ON(node->detached); 3605d4f98a2SYan Zheng *index = idx; 3615d4f98a2SYan Zheng return node; 3625d4f98a2SYan Zheng } 3635d4f98a2SYan Zheng 3645d4f98a2SYan Zheng /* 3655d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 3665d4f98a2SYan Zheng */ 3675d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 3685d4f98a2SYan Zheng int *index) 3695d4f98a2SYan Zheng { 3705d4f98a2SYan Zheng struct backref_edge *edge; 3715d4f98a2SYan Zheng struct backref_node *lower; 3725d4f98a2SYan Zheng int idx = *index; 3735d4f98a2SYan Zheng 3745d4f98a2SYan Zheng while (idx > 0) { 3755d4f98a2SYan Zheng edge = edges[idx - 1]; 3765d4f98a2SYan Zheng lower = edge->node[LOWER]; 3775d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 3785d4f98a2SYan Zheng idx--; 3795d4f98a2SYan Zheng continue; 3805d4f98a2SYan Zheng } 3815d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 3825d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3835d4f98a2SYan Zheng edges[idx - 1] = edge; 3845d4f98a2SYan Zheng *index = idx; 3855d4f98a2SYan Zheng return edge->node[UPPER]; 3865d4f98a2SYan Zheng } 3875d4f98a2SYan Zheng *index = 0; 3885d4f98a2SYan Zheng return NULL; 3895d4f98a2SYan Zheng } 3905d4f98a2SYan Zheng 3913fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 3925d4f98a2SYan Zheng { 3935d4f98a2SYan Zheng if (node->locked) { 3945d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 3955d4f98a2SYan Zheng node->locked = 0; 3965d4f98a2SYan Zheng } 3973fd0a558SYan, Zheng } 3983fd0a558SYan, Zheng 3993fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 4003fd0a558SYan, Zheng { 4013fd0a558SYan, Zheng if (node->eb) { 4023fd0a558SYan, Zheng unlock_node_buffer(node); 4035d4f98a2SYan Zheng free_extent_buffer(node->eb); 4045d4f98a2SYan Zheng node->eb = NULL; 4055d4f98a2SYan Zheng } 4065d4f98a2SYan Zheng } 4075d4f98a2SYan Zheng 4085d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 4095d4f98a2SYan Zheng struct backref_node *node) 4105d4f98a2SYan Zheng { 4115d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 4125d4f98a2SYan Zheng 4135d4f98a2SYan Zheng drop_node_buffer(node); 4143fd0a558SYan, Zheng list_del(&node->list); 4155d4f98a2SYan Zheng list_del(&node->lower); 4163fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 4175d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 4183fd0a558SYan, Zheng free_backref_node(tree, node); 4195d4f98a2SYan Zheng } 4205d4f98a2SYan Zheng 4215d4f98a2SYan Zheng /* 4225d4f98a2SYan Zheng * remove a backref node from the backref cache 4235d4f98a2SYan Zheng */ 4245d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 4255d4f98a2SYan Zheng struct backref_node *node) 4265d4f98a2SYan Zheng { 4275d4f98a2SYan Zheng struct backref_node *upper; 4285d4f98a2SYan Zheng struct backref_edge *edge; 4295d4f98a2SYan Zheng 4305d4f98a2SYan Zheng if (!node) 4315d4f98a2SYan Zheng return; 4325d4f98a2SYan Zheng 4333fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 4345d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4355d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 4365d4f98a2SYan Zheng list[LOWER]); 4375d4f98a2SYan Zheng upper = edge->node[UPPER]; 4385d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 4395d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 4403fd0a558SYan, Zheng free_backref_edge(cache, edge); 4413fd0a558SYan, Zheng 4423fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 4433fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 4443fd0a558SYan, Zheng drop_backref_node(cache, node); 4453fd0a558SYan, Zheng node = upper; 4463fd0a558SYan, Zheng node->lowest = 1; 4473fd0a558SYan, Zheng continue; 4483fd0a558SYan, Zheng } 4495d4f98a2SYan Zheng /* 4503fd0a558SYan, Zheng * add the node to leaf node list if no other 4515d4f98a2SYan Zheng * child block cached. 4525d4f98a2SYan Zheng */ 4535d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 4543fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 4555d4f98a2SYan Zheng upper->lowest = 1; 4565d4f98a2SYan Zheng } 4575d4f98a2SYan Zheng } 4583fd0a558SYan, Zheng 4595d4f98a2SYan Zheng drop_backref_node(cache, node); 4605d4f98a2SYan Zheng } 4615d4f98a2SYan Zheng 4623fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 4633fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 4643fd0a558SYan, Zheng { 4653fd0a558SYan, Zheng struct rb_node *rb_node; 4663fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 4673fd0a558SYan, Zheng node->bytenr = bytenr; 4683fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 46943c04fb1SJeff Mahoney if (rb_node) 47043c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, bytenr); 4713fd0a558SYan, Zheng } 4723fd0a558SYan, Zheng 4733fd0a558SYan, Zheng /* 4743fd0a558SYan, Zheng * update backref cache after a transaction commit 4753fd0a558SYan, Zheng */ 4763fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 4773fd0a558SYan, Zheng struct backref_cache *cache) 4783fd0a558SYan, Zheng { 4793fd0a558SYan, Zheng struct backref_node *node; 4803fd0a558SYan, Zheng int level = 0; 4813fd0a558SYan, Zheng 4823fd0a558SYan, Zheng if (cache->last_trans == 0) { 4833fd0a558SYan, Zheng cache->last_trans = trans->transid; 4843fd0a558SYan, Zheng return 0; 4853fd0a558SYan, Zheng } 4863fd0a558SYan, Zheng 4873fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 4883fd0a558SYan, Zheng return 0; 4893fd0a558SYan, Zheng 4903fd0a558SYan, Zheng /* 4913fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 4923fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 4933fd0a558SYan, Zheng * so the detached nodes are no longer useful. 4943fd0a558SYan, Zheng */ 4953fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 4963fd0a558SYan, Zheng node = list_entry(cache->detached.next, 4973fd0a558SYan, Zheng struct backref_node, list); 4983fd0a558SYan, Zheng remove_backref_node(cache, node); 4993fd0a558SYan, Zheng } 5003fd0a558SYan, Zheng 5013fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 5023fd0a558SYan, Zheng node = list_entry(cache->changed.next, 5033fd0a558SYan, Zheng struct backref_node, list); 5043fd0a558SYan, Zheng list_del_init(&node->list); 5053fd0a558SYan, Zheng BUG_ON(node->pending); 5063fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5073fd0a558SYan, Zheng } 5083fd0a558SYan, Zheng 5093fd0a558SYan, Zheng /* 5103fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 5113fd0a558SYan, Zheng * errors during processing the pending nodes. 5123fd0a558SYan, Zheng */ 5133fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 5143fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 5153fd0a558SYan, Zheng BUG_ON(!node->pending); 5163fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 5173fd0a558SYan, Zheng continue; 5183fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5193fd0a558SYan, Zheng } 5203fd0a558SYan, Zheng } 5213fd0a558SYan, Zheng 5223fd0a558SYan, Zheng cache->last_trans = 0; 5233fd0a558SYan, Zheng return 1; 5243fd0a558SYan, Zheng } 5253fd0a558SYan, Zheng 526f2a97a9dSDavid Sterba 5273fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 5283fd0a558SYan, Zheng { 5293fd0a558SYan, Zheng struct btrfs_root *reloc_root; 5303fd0a558SYan, Zheng 53127cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 5323fd0a558SYan, Zheng return 0; 5333fd0a558SYan, Zheng 5343fd0a558SYan, Zheng reloc_root = root->reloc_root; 5353fd0a558SYan, Zheng if (!reloc_root) 5363fd0a558SYan, Zheng return 0; 5373fd0a558SYan, Zheng 5383fd0a558SYan, Zheng if (btrfs_root_last_snapshot(&reloc_root->root_item) == 5393fd0a558SYan, Zheng root->fs_info->running_transaction->transid - 1) 5403fd0a558SYan, Zheng return 0; 5413fd0a558SYan, Zheng /* 5423fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 5433fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 5443fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 5453fd0a558SYan, Zheng * relocation. 5463fd0a558SYan, Zheng */ 5473fd0a558SYan, Zheng return 1; 5483fd0a558SYan, Zheng } 5495d4f98a2SYan Zheng /* 5505d4f98a2SYan Zheng * find reloc tree by address of tree root 5515d4f98a2SYan Zheng */ 5525d4f98a2SYan Zheng static struct btrfs_root *find_reloc_root(struct reloc_control *rc, 5535d4f98a2SYan Zheng u64 bytenr) 5545d4f98a2SYan Zheng { 5555d4f98a2SYan Zheng struct rb_node *rb_node; 5565d4f98a2SYan Zheng struct mapping_node *node; 5575d4f98a2SYan Zheng struct btrfs_root *root = NULL; 5585d4f98a2SYan Zheng 5595d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 5605d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 5615d4f98a2SYan Zheng if (rb_node) { 5625d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 5635d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 5645d4f98a2SYan Zheng } 5655d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 5665d4f98a2SYan Zheng return root; 5675d4f98a2SYan Zheng } 5685d4f98a2SYan Zheng 5695d4f98a2SYan Zheng static int is_cowonly_root(u64 root_objectid) 5705d4f98a2SYan Zheng { 5715d4f98a2SYan Zheng if (root_objectid == BTRFS_ROOT_TREE_OBJECTID || 5725d4f98a2SYan Zheng root_objectid == BTRFS_EXTENT_TREE_OBJECTID || 5735d4f98a2SYan Zheng root_objectid == BTRFS_CHUNK_TREE_OBJECTID || 5745d4f98a2SYan Zheng root_objectid == BTRFS_DEV_TREE_OBJECTID || 5755d4f98a2SYan Zheng root_objectid == BTRFS_TREE_LOG_OBJECTID || 57666463748SWang Shilong root_objectid == BTRFS_CSUM_TREE_OBJECTID || 57766463748SWang Shilong root_objectid == BTRFS_UUID_TREE_OBJECTID || 5783e4c5efbSDavid Sterba root_objectid == BTRFS_QUOTA_TREE_OBJECTID || 5793e4c5efbSDavid Sterba root_objectid == BTRFS_FREE_SPACE_TREE_OBJECTID) 5805d4f98a2SYan Zheng return 1; 5815d4f98a2SYan Zheng return 0; 5825d4f98a2SYan Zheng } 5835d4f98a2SYan Zheng 5845d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 5855d4f98a2SYan Zheng u64 root_objectid) 5865d4f98a2SYan Zheng { 5875d4f98a2SYan Zheng struct btrfs_key key; 5885d4f98a2SYan Zheng 5895d4f98a2SYan Zheng key.objectid = root_objectid; 5905d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 5915d4f98a2SYan Zheng if (is_cowonly_root(root_objectid)) 5925d4f98a2SYan Zheng key.offset = 0; 5935d4f98a2SYan Zheng else 5945d4f98a2SYan Zheng key.offset = (u64)-1; 5955d4f98a2SYan Zheng 596c00869f1SMiao Xie return btrfs_get_fs_root(fs_info, &key, false); 5975d4f98a2SYan Zheng } 5985d4f98a2SYan Zheng 5995d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 6005d4f98a2SYan Zheng static noinline_for_stack 6015d4f98a2SYan Zheng struct btrfs_root *find_tree_root(struct reloc_control *rc, 6025d4f98a2SYan Zheng struct extent_buffer *leaf, 6035d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0) 6045d4f98a2SYan Zheng { 6055d4f98a2SYan Zheng struct btrfs_root *root; 6065d4f98a2SYan Zheng u64 root_objectid = btrfs_ref_root_v0(leaf, ref0); 6075d4f98a2SYan Zheng u64 generation = btrfs_ref_generation_v0(leaf, ref0); 6085d4f98a2SYan Zheng 6095d4f98a2SYan Zheng BUG_ON(root_objectid == BTRFS_TREE_RELOC_OBJECTID); 6105d4f98a2SYan Zheng 6115d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, root_objectid); 6125d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 6135d4f98a2SYan Zheng 61427cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state) && 6155d4f98a2SYan Zheng generation != btrfs_root_generation(&root->root_item)) 6165d4f98a2SYan Zheng return NULL; 6175d4f98a2SYan Zheng 6185d4f98a2SYan Zheng return root; 6195d4f98a2SYan Zheng } 6205d4f98a2SYan Zheng #endif 6215d4f98a2SYan Zheng 6225d4f98a2SYan Zheng static noinline_for_stack 6235d4f98a2SYan Zheng int find_inline_backref(struct extent_buffer *leaf, int slot, 6245d4f98a2SYan Zheng unsigned long *ptr, unsigned long *end) 6255d4f98a2SYan Zheng { 6263173a18fSJosef Bacik struct btrfs_key key; 6275d4f98a2SYan Zheng struct btrfs_extent_item *ei; 6285d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 6295d4f98a2SYan Zheng u32 item_size; 6305d4f98a2SYan Zheng 6313173a18fSJosef Bacik btrfs_item_key_to_cpu(leaf, &key, slot); 6323173a18fSJosef Bacik 6335d4f98a2SYan Zheng item_size = btrfs_item_size_nr(leaf, slot); 6345d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 6355d4f98a2SYan Zheng if (item_size < sizeof(*ei)) { 6365d4f98a2SYan Zheng WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0)); 6375d4f98a2SYan Zheng return 1; 6385d4f98a2SYan Zheng } 6395d4f98a2SYan Zheng #endif 6405d4f98a2SYan Zheng ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); 6415d4f98a2SYan Zheng WARN_ON(!(btrfs_extent_flags(leaf, ei) & 6425d4f98a2SYan Zheng BTRFS_EXTENT_FLAG_TREE_BLOCK)); 6435d4f98a2SYan Zheng 6443173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 6453173a18fSJosef Bacik item_size <= sizeof(*ei) + sizeof(*bi)) { 6465d4f98a2SYan Zheng WARN_ON(item_size < sizeof(*ei) + sizeof(*bi)); 6475d4f98a2SYan Zheng return 1; 6485d4f98a2SYan Zheng } 649d062d13cSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 650d062d13cSJosef Bacik item_size <= sizeof(*ei)) { 651d062d13cSJosef Bacik WARN_ON(item_size < sizeof(*ei)); 652d062d13cSJosef Bacik return 1; 653d062d13cSJosef Bacik } 6545d4f98a2SYan Zheng 6553173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) { 6565d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 6575d4f98a2SYan Zheng *ptr = (unsigned long)(bi + 1); 6583173a18fSJosef Bacik } else { 6593173a18fSJosef Bacik *ptr = (unsigned long)(ei + 1); 6603173a18fSJosef Bacik } 6615d4f98a2SYan Zheng *end = (unsigned long)ei + item_size; 6625d4f98a2SYan Zheng return 0; 6635d4f98a2SYan Zheng } 6645d4f98a2SYan Zheng 6655d4f98a2SYan Zheng /* 6665d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 6675d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 6685d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 6695d4f98a2SYan Zheng * 6705d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 67101327610SNicholas D Steeves * to find upper level blocks that reference the block, and then check 67201327610SNicholas D Steeves * backrefs of these upper level blocks recursively. the recursion stop 6735d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 6745d4f98a2SYan Zheng * 6755d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 6765d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 6775d4f98a2SYan Zheng * block are also cached. 6785d4f98a2SYan Zheng */ 6793fd0a558SYan, Zheng static noinline_for_stack 6803fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 6815d4f98a2SYan Zheng struct btrfs_key *node_key, 6825d4f98a2SYan Zheng int level, u64 bytenr) 6835d4f98a2SYan Zheng { 6843fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 6855d4f98a2SYan Zheng struct btrfs_path *path1; 6865d4f98a2SYan Zheng struct btrfs_path *path2; 6875d4f98a2SYan Zheng struct extent_buffer *eb; 6885d4f98a2SYan Zheng struct btrfs_root *root; 6895d4f98a2SYan Zheng struct backref_node *cur; 6905d4f98a2SYan Zheng struct backref_node *upper; 6915d4f98a2SYan Zheng struct backref_node *lower; 6925d4f98a2SYan Zheng struct backref_node *node = NULL; 6935d4f98a2SYan Zheng struct backref_node *exist = NULL; 6945d4f98a2SYan Zheng struct backref_edge *edge; 6955d4f98a2SYan Zheng struct rb_node *rb_node; 6965d4f98a2SYan Zheng struct btrfs_key key; 6975d4f98a2SYan Zheng unsigned long end; 6985d4f98a2SYan Zheng unsigned long ptr; 6995d4f98a2SYan Zheng LIST_HEAD(list); 7003fd0a558SYan, Zheng LIST_HEAD(useless); 7013fd0a558SYan, Zheng int cowonly; 7025d4f98a2SYan Zheng int ret; 7035d4f98a2SYan Zheng int err = 0; 704b6c60c80SJosef Bacik bool need_check = true; 7055d4f98a2SYan Zheng 7065d4f98a2SYan Zheng path1 = btrfs_alloc_path(); 7075d4f98a2SYan Zheng path2 = btrfs_alloc_path(); 7085d4f98a2SYan Zheng if (!path1 || !path2) { 7095d4f98a2SYan Zheng err = -ENOMEM; 7105d4f98a2SYan Zheng goto out; 7115d4f98a2SYan Zheng } 712e4058b54SDavid Sterba path1->reada = READA_FORWARD; 713e4058b54SDavid Sterba path2->reada = READA_FORWARD; 7145d4f98a2SYan Zheng 7153fd0a558SYan, Zheng node = alloc_backref_node(cache); 7165d4f98a2SYan Zheng if (!node) { 7175d4f98a2SYan Zheng err = -ENOMEM; 7185d4f98a2SYan Zheng goto out; 7195d4f98a2SYan Zheng } 7205d4f98a2SYan Zheng 7215d4f98a2SYan Zheng node->bytenr = bytenr; 7225d4f98a2SYan Zheng node->level = level; 7235d4f98a2SYan Zheng node->lowest = 1; 7245d4f98a2SYan Zheng cur = node; 7255d4f98a2SYan Zheng again: 7265d4f98a2SYan Zheng end = 0; 7275d4f98a2SYan Zheng ptr = 0; 7285d4f98a2SYan Zheng key.objectid = cur->bytenr; 7293173a18fSJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 7305d4f98a2SYan Zheng key.offset = (u64)-1; 7315d4f98a2SYan Zheng 7325d4f98a2SYan Zheng path1->search_commit_root = 1; 7335d4f98a2SYan Zheng path1->skip_locking = 1; 7345d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1, 7355d4f98a2SYan Zheng 0, 0); 7365d4f98a2SYan Zheng if (ret < 0) { 7375d4f98a2SYan Zheng err = ret; 7385d4f98a2SYan Zheng goto out; 7395d4f98a2SYan Zheng } 74075bfb9afSJosef Bacik ASSERT(ret); 74175bfb9afSJosef Bacik ASSERT(path1->slots[0]); 7425d4f98a2SYan Zheng 7435d4f98a2SYan Zheng path1->slots[0]--; 7445d4f98a2SYan Zheng 7455d4f98a2SYan Zheng WARN_ON(cur->checked); 7465d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 7475d4f98a2SYan Zheng /* 74870f23fd6SJustin P. Mattock * the backref was added previously when processing 7495d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 7505d4f98a2SYan Zheng */ 75175bfb9afSJosef Bacik ASSERT(list_is_singular(&cur->upper)); 7525d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 7535d4f98a2SYan Zheng list[LOWER]); 75475bfb9afSJosef Bacik ASSERT(list_empty(&edge->list[UPPER])); 7555d4f98a2SYan Zheng exist = edge->node[UPPER]; 7565d4f98a2SYan Zheng /* 7575d4f98a2SYan Zheng * add the upper level block to pending list if we need 7585d4f98a2SYan Zheng * check its backrefs 7595d4f98a2SYan Zheng */ 7605d4f98a2SYan Zheng if (!exist->checked) 7615d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 7625d4f98a2SYan Zheng } else { 7635d4f98a2SYan Zheng exist = NULL; 7645d4f98a2SYan Zheng } 7655d4f98a2SYan Zheng 7665d4f98a2SYan Zheng while (1) { 7675d4f98a2SYan Zheng cond_resched(); 7685d4f98a2SYan Zheng eb = path1->nodes[0]; 7695d4f98a2SYan Zheng 7705d4f98a2SYan Zheng if (ptr >= end) { 7715d4f98a2SYan Zheng if (path1->slots[0] >= btrfs_header_nritems(eb)) { 7725d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path1); 7735d4f98a2SYan Zheng if (ret < 0) { 7745d4f98a2SYan Zheng err = ret; 7755d4f98a2SYan Zheng goto out; 7765d4f98a2SYan Zheng } 7775d4f98a2SYan Zheng if (ret > 0) 7785d4f98a2SYan Zheng break; 7795d4f98a2SYan Zheng eb = path1->nodes[0]; 7805d4f98a2SYan Zheng } 7815d4f98a2SYan Zheng 7825d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path1->slots[0]); 7835d4f98a2SYan Zheng if (key.objectid != cur->bytenr) { 7845d4f98a2SYan Zheng WARN_ON(exist); 7855d4f98a2SYan Zheng break; 7865d4f98a2SYan Zheng } 7875d4f98a2SYan Zheng 7883173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY || 7893173a18fSJosef Bacik key.type == BTRFS_METADATA_ITEM_KEY) { 7905d4f98a2SYan Zheng ret = find_inline_backref(eb, path1->slots[0], 7915d4f98a2SYan Zheng &ptr, &end); 7925d4f98a2SYan Zheng if (ret) 7935d4f98a2SYan Zheng goto next; 7945d4f98a2SYan Zheng } 7955d4f98a2SYan Zheng } 7965d4f98a2SYan Zheng 7975d4f98a2SYan Zheng if (ptr < end) { 7985d4f98a2SYan Zheng /* update key for inline back ref */ 7995d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 8005d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 8015d4f98a2SYan Zheng key.type = btrfs_extent_inline_ref_type(eb, iref); 8025d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 8035d4f98a2SYan Zheng WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY && 8045d4f98a2SYan Zheng key.type != BTRFS_SHARED_BLOCK_REF_KEY); 8055d4f98a2SYan Zheng } 8065d4f98a2SYan Zheng 8075d4f98a2SYan Zheng if (exist && 8085d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 8095d4f98a2SYan Zheng exist->owner == key.offset) || 8105d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 8115d4f98a2SYan Zheng exist->bytenr == key.offset))) { 8125d4f98a2SYan Zheng exist = NULL; 8135d4f98a2SYan Zheng goto next; 8145d4f98a2SYan Zheng } 8155d4f98a2SYan Zheng 8165d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 8175d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY || 8185d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 8193fd0a558SYan, Zheng if (key.type == BTRFS_EXTENT_REF_V0_KEY) { 8205d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 8215d4f98a2SYan Zheng ref0 = btrfs_item_ptr(eb, path1->slots[0], 8225d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 8233fd0a558SYan, Zheng if (key.objectid == key.offset) { 824046f264fSYan, Zheng root = find_tree_root(rc, eb, ref0); 8253fd0a558SYan, Zheng if (root && !should_ignore_root(root)) 8265d4f98a2SYan Zheng cur->root = root; 8275d4f98a2SYan Zheng else 8283fd0a558SYan, Zheng list_add(&cur->list, &useless); 8295d4f98a2SYan Zheng break; 8305d4f98a2SYan Zheng } 831046f264fSYan, Zheng if (is_cowonly_root(btrfs_ref_root_v0(eb, 832046f264fSYan, Zheng ref0))) 833046f264fSYan, Zheng cur->cowonly = 1; 8343fd0a558SYan, Zheng } 8355d4f98a2SYan Zheng #else 83675bfb9afSJosef Bacik ASSERT(key.type != BTRFS_EXTENT_REF_V0_KEY); 8375d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 8385d4f98a2SYan Zheng #endif 8395d4f98a2SYan Zheng if (key.objectid == key.offset) { 8405d4f98a2SYan Zheng /* 8415d4f98a2SYan Zheng * only root blocks of reloc trees use 8425d4f98a2SYan Zheng * backref of this type. 8435d4f98a2SYan Zheng */ 8445d4f98a2SYan Zheng root = find_reloc_root(rc, cur->bytenr); 84575bfb9afSJosef Bacik ASSERT(root); 8465d4f98a2SYan Zheng cur->root = root; 8475d4f98a2SYan Zheng break; 8485d4f98a2SYan Zheng } 8495d4f98a2SYan Zheng 8503fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 8515d4f98a2SYan Zheng if (!edge) { 8525d4f98a2SYan Zheng err = -ENOMEM; 8535d4f98a2SYan Zheng goto out; 8545d4f98a2SYan Zheng } 8555d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, key.offset); 8565d4f98a2SYan Zheng if (!rb_node) { 8573fd0a558SYan, Zheng upper = alloc_backref_node(cache); 8585d4f98a2SYan Zheng if (!upper) { 8593fd0a558SYan, Zheng free_backref_edge(cache, edge); 8605d4f98a2SYan Zheng err = -ENOMEM; 8615d4f98a2SYan Zheng goto out; 8625d4f98a2SYan Zheng } 8635d4f98a2SYan Zheng upper->bytenr = key.offset; 8645d4f98a2SYan Zheng upper->level = cur->level + 1; 8655d4f98a2SYan Zheng /* 8665d4f98a2SYan Zheng * backrefs for the upper level block isn't 8675d4f98a2SYan Zheng * cached, add the block to pending list 8685d4f98a2SYan Zheng */ 8695d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 8705d4f98a2SYan Zheng } else { 8715d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 8725d4f98a2SYan Zheng rb_node); 87375bfb9afSJosef Bacik ASSERT(upper->checked); 8745d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 8755d4f98a2SYan Zheng } 8763fd0a558SYan, Zheng list_add_tail(&edge->list[LOWER], &cur->upper); 8775d4f98a2SYan Zheng edge->node[LOWER] = cur; 8783fd0a558SYan, Zheng edge->node[UPPER] = upper; 8795d4f98a2SYan Zheng 8805d4f98a2SYan Zheng goto next; 8815d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 8825d4f98a2SYan Zheng goto next; 8835d4f98a2SYan Zheng } 8845d4f98a2SYan Zheng 8855d4f98a2SYan Zheng /* key.type == BTRFS_TREE_BLOCK_REF_KEY */ 8865d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, key.offset); 8875d4f98a2SYan Zheng if (IS_ERR(root)) { 8885d4f98a2SYan Zheng err = PTR_ERR(root); 8895d4f98a2SYan Zheng goto out; 8905d4f98a2SYan Zheng } 8915d4f98a2SYan Zheng 89227cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 8933fd0a558SYan, Zheng cur->cowonly = 1; 8943fd0a558SYan, Zheng 8955d4f98a2SYan Zheng if (btrfs_root_level(&root->root_item) == cur->level) { 8965d4f98a2SYan Zheng /* tree root */ 89775bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 8985d4f98a2SYan Zheng cur->bytenr); 8993fd0a558SYan, Zheng if (should_ignore_root(root)) 9003fd0a558SYan, Zheng list_add(&cur->list, &useless); 9013fd0a558SYan, Zheng else 9025d4f98a2SYan Zheng cur->root = root; 9035d4f98a2SYan Zheng break; 9045d4f98a2SYan Zheng } 9055d4f98a2SYan Zheng 9065d4f98a2SYan Zheng level = cur->level + 1; 9075d4f98a2SYan Zheng 9085d4f98a2SYan Zheng /* 9095d4f98a2SYan Zheng * searching the tree to find upper level blocks 9105d4f98a2SYan Zheng * reference the block. 9115d4f98a2SYan Zheng */ 9125d4f98a2SYan Zheng path2->search_commit_root = 1; 9135d4f98a2SYan Zheng path2->skip_locking = 1; 9145d4f98a2SYan Zheng path2->lowest_level = level; 9155d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0); 9165d4f98a2SYan Zheng path2->lowest_level = 0; 9175d4f98a2SYan Zheng if (ret < 0) { 9185d4f98a2SYan Zheng err = ret; 9195d4f98a2SYan Zheng goto out; 9205d4f98a2SYan Zheng } 92133c66f43SYan Zheng if (ret > 0 && path2->slots[level] > 0) 92233c66f43SYan Zheng path2->slots[level]--; 9235d4f98a2SYan Zheng 9245d4f98a2SYan Zheng eb = path2->nodes[level]; 9255d4f98a2SYan Zheng WARN_ON(btrfs_node_blockptr(eb, path2->slots[level]) != 9265d4f98a2SYan Zheng cur->bytenr); 9275d4f98a2SYan Zheng 9285d4f98a2SYan Zheng lower = cur; 929b6c60c80SJosef Bacik need_check = true; 9305d4f98a2SYan Zheng for (; level < BTRFS_MAX_LEVEL; level++) { 9315d4f98a2SYan Zheng if (!path2->nodes[level]) { 93275bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 9335d4f98a2SYan Zheng lower->bytenr); 9343fd0a558SYan, Zheng if (should_ignore_root(root)) 9353fd0a558SYan, Zheng list_add(&lower->list, &useless); 9363fd0a558SYan, Zheng else 9375d4f98a2SYan Zheng lower->root = root; 9385d4f98a2SYan Zheng break; 9395d4f98a2SYan Zheng } 9405d4f98a2SYan Zheng 9413fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 9425d4f98a2SYan Zheng if (!edge) { 9435d4f98a2SYan Zheng err = -ENOMEM; 9445d4f98a2SYan Zheng goto out; 9455d4f98a2SYan Zheng } 9465d4f98a2SYan Zheng 9475d4f98a2SYan Zheng eb = path2->nodes[level]; 9485d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, eb->start); 9495d4f98a2SYan Zheng if (!rb_node) { 9503fd0a558SYan, Zheng upper = alloc_backref_node(cache); 9515d4f98a2SYan Zheng if (!upper) { 9523fd0a558SYan, Zheng free_backref_edge(cache, edge); 9535d4f98a2SYan Zheng err = -ENOMEM; 9545d4f98a2SYan Zheng goto out; 9555d4f98a2SYan Zheng } 9565d4f98a2SYan Zheng upper->bytenr = eb->start; 9575d4f98a2SYan Zheng upper->owner = btrfs_header_owner(eb); 9585d4f98a2SYan Zheng upper->level = lower->level + 1; 95927cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, 96027cdeb70SMiao Xie &root->state)) 9613fd0a558SYan, Zheng upper->cowonly = 1; 9625d4f98a2SYan Zheng 9635d4f98a2SYan Zheng /* 9645d4f98a2SYan Zheng * if we know the block isn't shared 9655d4f98a2SYan Zheng * we can void checking its backrefs. 9665d4f98a2SYan Zheng */ 9675d4f98a2SYan Zheng if (btrfs_block_can_be_shared(root, eb)) 9685d4f98a2SYan Zheng upper->checked = 0; 9695d4f98a2SYan Zheng else 9705d4f98a2SYan Zheng upper->checked = 1; 9715d4f98a2SYan Zheng 9725d4f98a2SYan Zheng /* 9735d4f98a2SYan Zheng * add the block to pending list if we 974b6c60c80SJosef Bacik * need check its backrefs, we only do this once 975b6c60c80SJosef Bacik * while walking up a tree as we will catch 976b6c60c80SJosef Bacik * anything else later on. 9775d4f98a2SYan Zheng */ 978b6c60c80SJosef Bacik if (!upper->checked && need_check) { 979b6c60c80SJosef Bacik need_check = false; 9805d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], 9815d4f98a2SYan Zheng &list); 982bbe90514SJosef Bacik } else { 983bbe90514SJosef Bacik if (upper->checked) 984bbe90514SJosef Bacik need_check = true; 9855d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 986bbe90514SJosef Bacik } 9875d4f98a2SYan Zheng } else { 9885d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 9895d4f98a2SYan Zheng rb_node); 99075bfb9afSJosef Bacik ASSERT(upper->checked); 9915d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 9923fd0a558SYan, Zheng if (!upper->owner) 9933fd0a558SYan, Zheng upper->owner = btrfs_header_owner(eb); 9945d4f98a2SYan Zheng } 9955d4f98a2SYan Zheng list_add_tail(&edge->list[LOWER], &lower->upper); 9965d4f98a2SYan Zheng edge->node[LOWER] = lower; 9973fd0a558SYan, Zheng edge->node[UPPER] = upper; 9985d4f98a2SYan Zheng 9995d4f98a2SYan Zheng if (rb_node) 10005d4f98a2SYan Zheng break; 10015d4f98a2SYan Zheng lower = upper; 10025d4f98a2SYan Zheng upper = NULL; 10035d4f98a2SYan Zheng } 1004b3b4aa74SDavid Sterba btrfs_release_path(path2); 10055d4f98a2SYan Zheng next: 10065d4f98a2SYan Zheng if (ptr < end) { 10075d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 10085d4f98a2SYan Zheng if (ptr >= end) { 10095d4f98a2SYan Zheng WARN_ON(ptr > end); 10105d4f98a2SYan Zheng ptr = 0; 10115d4f98a2SYan Zheng end = 0; 10125d4f98a2SYan Zheng } 10135d4f98a2SYan Zheng } 10145d4f98a2SYan Zheng if (ptr >= end) 10155d4f98a2SYan Zheng path1->slots[0]++; 10165d4f98a2SYan Zheng } 1017b3b4aa74SDavid Sterba btrfs_release_path(path1); 10185d4f98a2SYan Zheng 10195d4f98a2SYan Zheng cur->checked = 1; 10205d4f98a2SYan Zheng WARN_ON(exist); 10215d4f98a2SYan Zheng 10225d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 10235d4f98a2SYan Zheng if (!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 cur = edge->node[UPPER]; 10275d4f98a2SYan Zheng goto again; 10285d4f98a2SYan Zheng } 10295d4f98a2SYan Zheng 10305d4f98a2SYan Zheng /* 10315d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 10325d4f98a2SYan Zheng * into the cache. 10335d4f98a2SYan Zheng */ 103475bfb9afSJosef Bacik ASSERT(node->checked); 10353fd0a558SYan, Zheng cowonly = node->cowonly; 10363fd0a558SYan, Zheng if (!cowonly) { 10373fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 10383fd0a558SYan, Zheng &node->rb_node); 103943c04fb1SJeff Mahoney if (rb_node) 104043c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 10413fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 10423fd0a558SYan, Zheng } 10435d4f98a2SYan Zheng 10445d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 10455d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10465d4f98a2SYan Zheng 10475d4f98a2SYan Zheng while (!list_empty(&list)) { 10485d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10495d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10505d4f98a2SYan Zheng upper = edge->node[UPPER]; 10513fd0a558SYan, Zheng if (upper->detached) { 10523fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10533fd0a558SYan, Zheng lower = edge->node[LOWER]; 10543fd0a558SYan, Zheng free_backref_edge(cache, edge); 10553fd0a558SYan, Zheng if (list_empty(&lower->upper)) 10563fd0a558SYan, Zheng list_add(&lower->list, &useless); 10573fd0a558SYan, Zheng continue; 10583fd0a558SYan, Zheng } 10595d4f98a2SYan Zheng 10605d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 10615d4f98a2SYan Zheng if (upper->lowest) { 10625d4f98a2SYan Zheng list_del_init(&upper->lower); 10635d4f98a2SYan Zheng upper->lowest = 0; 10645d4f98a2SYan Zheng } 10655d4f98a2SYan Zheng 10665d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10675d4f98a2SYan Zheng continue; 10685d4f98a2SYan Zheng } 10695d4f98a2SYan Zheng 107075bfb9afSJosef Bacik if (!upper->checked) { 107175bfb9afSJosef Bacik /* 107275bfb9afSJosef Bacik * Still want to blow up for developers since this is a 107375bfb9afSJosef Bacik * logic bug. 107475bfb9afSJosef Bacik */ 107575bfb9afSJosef Bacik ASSERT(0); 107675bfb9afSJosef Bacik err = -EINVAL; 107775bfb9afSJosef Bacik goto out; 107875bfb9afSJosef Bacik } 107975bfb9afSJosef Bacik if (cowonly != upper->cowonly) { 108075bfb9afSJosef Bacik ASSERT(0); 108175bfb9afSJosef Bacik err = -EINVAL; 108275bfb9afSJosef Bacik goto out; 108375bfb9afSJosef Bacik } 108475bfb9afSJosef Bacik 10853fd0a558SYan, Zheng if (!cowonly) { 10865d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 10875d4f98a2SYan Zheng &upper->rb_node); 108843c04fb1SJeff Mahoney if (rb_node) 108943c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 109043c04fb1SJeff Mahoney upper->bytenr); 10913fd0a558SYan, Zheng } 10925d4f98a2SYan Zheng 10935d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10945d4f98a2SYan Zheng 10955d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 10965d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10975d4f98a2SYan Zheng } 10983fd0a558SYan, Zheng /* 10993fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 11003fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 11013fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 11023fd0a558SYan, Zheng * lookup. 11033fd0a558SYan, Zheng */ 11043fd0a558SYan, Zheng while (!list_empty(&useless)) { 11053fd0a558SYan, Zheng upper = list_entry(useless.next, struct backref_node, list); 11063fd0a558SYan, Zheng list_del_init(&upper->list); 110775bfb9afSJosef Bacik ASSERT(list_empty(&upper->upper)); 11083fd0a558SYan, Zheng if (upper == node) 11093fd0a558SYan, Zheng node = NULL; 11103fd0a558SYan, Zheng if (upper->lowest) { 11113fd0a558SYan, Zheng list_del_init(&upper->lower); 11123fd0a558SYan, Zheng upper->lowest = 0; 11133fd0a558SYan, Zheng } 11143fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 11153fd0a558SYan, Zheng edge = list_entry(upper->lower.next, 11163fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 11173fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 11183fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11193fd0a558SYan, Zheng lower = edge->node[LOWER]; 11203fd0a558SYan, Zheng free_backref_edge(cache, edge); 11213fd0a558SYan, Zheng 11223fd0a558SYan, Zheng if (list_empty(&lower->upper)) 11233fd0a558SYan, Zheng list_add(&lower->list, &useless); 11243fd0a558SYan, Zheng } 11253fd0a558SYan, Zheng __mark_block_processed(rc, upper); 11263fd0a558SYan, Zheng if (upper->level > 0) { 11273fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 11283fd0a558SYan, Zheng upper->detached = 1; 11293fd0a558SYan, Zheng } else { 11303fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 11313fd0a558SYan, Zheng free_backref_node(cache, upper); 11323fd0a558SYan, Zheng } 11333fd0a558SYan, Zheng } 11345d4f98a2SYan Zheng out: 11355d4f98a2SYan Zheng btrfs_free_path(path1); 11365d4f98a2SYan Zheng btrfs_free_path(path2); 11375d4f98a2SYan Zheng if (err) { 11383fd0a558SYan, Zheng while (!list_empty(&useless)) { 11393fd0a558SYan, Zheng lower = list_entry(useless.next, 114075bfb9afSJosef Bacik struct backref_node, list); 114175bfb9afSJosef Bacik list_del_init(&lower->list); 11423fd0a558SYan, Zheng } 114375bfb9afSJosef Bacik while (!list_empty(&list)) { 114475bfb9afSJosef Bacik edge = list_first_entry(&list, struct backref_edge, 114575bfb9afSJosef Bacik list[UPPER]); 114675bfb9afSJosef Bacik list_del(&edge->list[UPPER]); 11473fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 114875bfb9afSJosef Bacik lower = edge->node[LOWER]; 11495d4f98a2SYan Zheng upper = edge->node[UPPER]; 11503fd0a558SYan, Zheng free_backref_edge(cache, edge); 115175bfb9afSJosef Bacik 115275bfb9afSJosef Bacik /* 115375bfb9afSJosef Bacik * Lower is no longer linked to any upper backref nodes 115475bfb9afSJosef Bacik * and isn't in the cache, we can free it ourselves. 115575bfb9afSJosef Bacik */ 115675bfb9afSJosef Bacik if (list_empty(&lower->upper) && 115775bfb9afSJosef Bacik RB_EMPTY_NODE(&lower->rb_node)) 115875bfb9afSJosef Bacik list_add(&lower->list, &useless); 115975bfb9afSJosef Bacik 116075bfb9afSJosef Bacik if (!RB_EMPTY_NODE(&upper->rb_node)) 116175bfb9afSJosef Bacik continue; 116275bfb9afSJosef Bacik 116301327610SNicholas D Steeves /* Add this guy's upper edges to the list to process */ 116475bfb9afSJosef Bacik list_for_each_entry(edge, &upper->upper, list[LOWER]) 116575bfb9afSJosef Bacik list_add_tail(&edge->list[UPPER], &list); 116675bfb9afSJosef Bacik if (list_empty(&upper->upper)) 116775bfb9afSJosef Bacik list_add(&upper->list, &useless); 116875bfb9afSJosef Bacik } 116975bfb9afSJosef Bacik 117075bfb9afSJosef Bacik while (!list_empty(&useless)) { 117175bfb9afSJosef Bacik lower = list_entry(useless.next, 117275bfb9afSJosef Bacik struct backref_node, list); 117375bfb9afSJosef Bacik list_del_init(&lower->list); 11740fd8c3daSLiu Bo if (lower == node) 11750fd8c3daSLiu Bo node = NULL; 117675bfb9afSJosef Bacik free_backref_node(cache, lower); 11775d4f98a2SYan Zheng } 11780fd8c3daSLiu Bo 11790fd8c3daSLiu Bo free_backref_node(cache, node); 11805d4f98a2SYan Zheng return ERR_PTR(err); 11815d4f98a2SYan Zheng } 118275bfb9afSJosef Bacik ASSERT(!node || !node->detached); 11835d4f98a2SYan Zheng return node; 11845d4f98a2SYan Zheng } 11855d4f98a2SYan Zheng 11865d4f98a2SYan Zheng /* 11873fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 11883fd0a558SYan, Zheng * the backref node is created by cloning backref node that 11893fd0a558SYan, Zheng * corresponds to root of source tree 11903fd0a558SYan, Zheng */ 11913fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 11923fd0a558SYan, Zheng struct reloc_control *rc, 11933fd0a558SYan, Zheng struct btrfs_root *src, 11943fd0a558SYan, Zheng struct btrfs_root *dest) 11953fd0a558SYan, Zheng { 11963fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 11973fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 11983fd0a558SYan, Zheng struct backref_node *node = NULL; 11993fd0a558SYan, Zheng struct backref_node *new_node; 12003fd0a558SYan, Zheng struct backref_edge *edge; 12013fd0a558SYan, Zheng struct backref_edge *new_edge; 12023fd0a558SYan, Zheng struct rb_node *rb_node; 12033fd0a558SYan, Zheng 12043fd0a558SYan, Zheng if (cache->last_trans > 0) 12053fd0a558SYan, Zheng update_backref_cache(trans, cache); 12063fd0a558SYan, Zheng 12073fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 12083fd0a558SYan, Zheng if (rb_node) { 12093fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 12103fd0a558SYan, Zheng if (node->detached) 12113fd0a558SYan, Zheng node = NULL; 12123fd0a558SYan, Zheng else 12133fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 12143fd0a558SYan, Zheng } 12153fd0a558SYan, Zheng 12163fd0a558SYan, Zheng if (!node) { 12173fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 12183fd0a558SYan, Zheng reloc_root->commit_root->start); 12193fd0a558SYan, Zheng if (rb_node) { 12203fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 12213fd0a558SYan, Zheng rb_node); 12223fd0a558SYan, Zheng BUG_ON(node->detached); 12233fd0a558SYan, Zheng } 12243fd0a558SYan, Zheng } 12253fd0a558SYan, Zheng 12263fd0a558SYan, Zheng if (!node) 12273fd0a558SYan, Zheng return 0; 12283fd0a558SYan, Zheng 12293fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 12303fd0a558SYan, Zheng if (!new_node) 12313fd0a558SYan, Zheng return -ENOMEM; 12323fd0a558SYan, Zheng 12333fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 12343fd0a558SYan, Zheng new_node->level = node->level; 12353fd0a558SYan, Zheng new_node->lowest = node->lowest; 12366848ad64SYan, Zheng new_node->checked = 1; 12373fd0a558SYan, Zheng new_node->root = dest; 12383fd0a558SYan, Zheng 12393fd0a558SYan, Zheng if (!node->lowest) { 12403fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 12413fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 12423fd0a558SYan, Zheng if (!new_edge) 12433fd0a558SYan, Zheng goto fail; 12443fd0a558SYan, Zheng 12453fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 12463fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 12473fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 12483fd0a558SYan, Zheng &new_node->lower); 12493fd0a558SYan, Zheng } 125076b9e23dSMiao Xie } else { 125176b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 12523fd0a558SYan, Zheng } 12533fd0a558SYan, Zheng 12543fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 12553fd0a558SYan, Zheng &new_node->rb_node); 125643c04fb1SJeff Mahoney if (rb_node) 125743c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 12583fd0a558SYan, Zheng 12593fd0a558SYan, Zheng if (!new_node->lowest) { 12603fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 12613fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 12623fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 12633fd0a558SYan, Zheng } 12643fd0a558SYan, Zheng } 12653fd0a558SYan, Zheng return 0; 12663fd0a558SYan, Zheng fail: 12673fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 12683fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 12693fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 12703fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 12713fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 12723fd0a558SYan, Zheng } 12733fd0a558SYan, Zheng free_backref_node(cache, new_node); 12743fd0a558SYan, Zheng return -ENOMEM; 12753fd0a558SYan, Zheng } 12763fd0a558SYan, Zheng 12773fd0a558SYan, Zheng /* 12785d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 12795d4f98a2SYan Zheng */ 1280ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 12815d4f98a2SYan Zheng { 12825d4f98a2SYan Zheng struct rb_node *rb_node; 12835d4f98a2SYan Zheng struct mapping_node *node; 12845d4f98a2SYan Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 12855d4f98a2SYan Zheng 12865d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1287ffd7b339SJeff Mahoney if (!node) 1288ffd7b339SJeff Mahoney return -ENOMEM; 12895d4f98a2SYan Zheng 12905d4f98a2SYan Zheng node->bytenr = root->node->start; 12915d4f98a2SYan Zheng node->data = root; 12925d4f98a2SYan Zheng 12935d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12945d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 12955d4f98a2SYan Zheng node->bytenr, &node->rb_node); 12965d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1297ffd7b339SJeff Mahoney if (rb_node) { 1298ffd7b339SJeff Mahoney btrfs_panic(root->fs_info, -EEXIST, "Duplicate root found " 1299ffd7b339SJeff Mahoney "for start=%llu while inserting into relocation " 1300351fd353SDavid Sterba "tree", node->bytenr); 130123291a04SDan Carpenter kfree(node); 130223291a04SDan Carpenter return -EEXIST; 1303ffd7b339SJeff Mahoney } 13045d4f98a2SYan Zheng 13055d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 13065d4f98a2SYan Zheng return 0; 13075d4f98a2SYan Zheng } 13085d4f98a2SYan Zheng 13095d4f98a2SYan Zheng /* 1310c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 13115d4f98a2SYan Zheng * mapping 13125d4f98a2SYan Zheng */ 1313c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 13145d4f98a2SYan Zheng { 13155d4f98a2SYan Zheng struct rb_node *rb_node; 13165d4f98a2SYan Zheng struct mapping_node *node = NULL; 13175d4f98a2SYan Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 13185d4f98a2SYan Zheng 13195d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13205d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1321c974c464SWang Shilong root->node->start); 1322c974c464SWang Shilong if (rb_node) { 1323c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1324c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1325c974c464SWang Shilong } 1326c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1327c974c464SWang Shilong 1328c974c464SWang Shilong if (!node) 1329c974c464SWang Shilong return; 1330c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1331c974c464SWang Shilong 1332c974c464SWang Shilong spin_lock(&root->fs_info->trans_lock); 1333c974c464SWang Shilong list_del_init(&root->root_list); 1334c974c464SWang Shilong spin_unlock(&root->fs_info->trans_lock); 1335c974c464SWang Shilong kfree(node); 1336c974c464SWang Shilong } 1337c974c464SWang Shilong 1338c974c464SWang Shilong /* 1339c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1340c974c464SWang Shilong * mapping 1341c974c464SWang Shilong */ 1342c974c464SWang Shilong static int __update_reloc_root(struct btrfs_root *root, u64 new_bytenr) 1343c974c464SWang Shilong { 1344c974c464SWang Shilong struct rb_node *rb_node; 1345c974c464SWang Shilong struct mapping_node *node = NULL; 1346c974c464SWang Shilong struct reloc_control *rc = root->fs_info->reloc_ctl; 1347c974c464SWang Shilong 1348c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1349c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1350c974c464SWang Shilong root->node->start); 13515d4f98a2SYan Zheng if (rb_node) { 13525d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 13535d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 13545d4f98a2SYan Zheng } 13555d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 13565d4f98a2SYan Zheng 13578f71f3e0SLiu Bo if (!node) 13588f71f3e0SLiu Bo return 0; 13595d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 13605d4f98a2SYan Zheng 13615d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1362c974c464SWang Shilong node->bytenr = new_bytenr; 13635d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13645d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13655d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 136643c04fb1SJeff Mahoney if (rb_node) 136743c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 13685d4f98a2SYan Zheng return 0; 13695d4f98a2SYan Zheng } 13705d4f98a2SYan Zheng 13713fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 13723fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 13735d4f98a2SYan Zheng { 13745d4f98a2SYan Zheng struct btrfs_root *reloc_root; 13755d4f98a2SYan Zheng struct extent_buffer *eb; 13765d4f98a2SYan Zheng struct btrfs_root_item *root_item; 13775d4f98a2SYan Zheng struct btrfs_key root_key; 13785bc7247aSMiao Xie u64 last_snap = 0; 13795d4f98a2SYan Zheng int ret; 13805d4f98a2SYan Zheng 13815d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 13825d4f98a2SYan Zheng BUG_ON(!root_item); 13835d4f98a2SYan Zheng 13845d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 13855d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 13863fd0a558SYan, Zheng root_key.offset = objectid; 13875d4f98a2SYan Zheng 13883fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 13893fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 13905d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 13915d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 13925d4f98a2SYan Zheng BUG_ON(ret); 13935d4f98a2SYan Zheng 13945bc7247aSMiao Xie last_snap = btrfs_root_last_snapshot(&root->root_item); 13953fd0a558SYan, Zheng btrfs_set_root_last_snapshot(&root->root_item, 13963fd0a558SYan, Zheng trans->transid - 1); 13973fd0a558SYan, Zheng } else { 13983fd0a558SYan, Zheng /* 13993fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 14003fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 14013fd0a558SYan, Zheng * modified after it was created have RELOC flag 14023fd0a558SYan, Zheng * set in their headers. so it's OK to not update 14033fd0a558SYan, Zheng * the 'last_snapshot'. 14043fd0a558SYan, Zheng */ 14053fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 14063fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 14073fd0a558SYan, Zheng BUG_ON(ret); 14083fd0a558SYan, Zheng } 14093fd0a558SYan, Zheng 14105d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 14115d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 14125d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 14135d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 14143fd0a558SYan, Zheng 14153fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 14163fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 14173fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 14183fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 14195d4f98a2SYan Zheng root_item->drop_level = 0; 14205bc7247aSMiao Xie /* 14215bc7247aSMiao Xie * abuse rtransid, it is safe because it is impossible to 14225bc7247aSMiao Xie * receive data into a relocation tree. 14235bc7247aSMiao Xie */ 14245bc7247aSMiao Xie btrfs_set_root_rtransid(root_item, last_snap); 14255bc7247aSMiao Xie btrfs_set_root_otransid(root_item, trans->transid); 14263fd0a558SYan, Zheng } 14275d4f98a2SYan Zheng 14285d4f98a2SYan Zheng btrfs_tree_unlock(eb); 14295d4f98a2SYan Zheng free_extent_buffer(eb); 14305d4f98a2SYan Zheng 14315d4f98a2SYan Zheng ret = btrfs_insert_root(trans, root->fs_info->tree_root, 14325d4f98a2SYan Zheng &root_key, root_item); 14335d4f98a2SYan Zheng BUG_ON(ret); 14345d4f98a2SYan Zheng kfree(root_item); 14355d4f98a2SYan Zheng 1436cb517eabSMiao Xie reloc_root = btrfs_read_fs_root(root->fs_info->tree_root, &root_key); 14375d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 14385d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 14393fd0a558SYan, Zheng return reloc_root; 14403fd0a558SYan, Zheng } 14413fd0a558SYan, Zheng 14423fd0a558SYan, Zheng /* 14433fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 14443fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 14453fd0a558SYan, Zheng */ 14463fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 14473fd0a558SYan, Zheng struct btrfs_root *root) 14483fd0a558SYan, Zheng { 14493fd0a558SYan, Zheng struct btrfs_root *reloc_root; 14503fd0a558SYan, Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 145120dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 14523fd0a558SYan, Zheng int clear_rsv = 0; 1453ffd7b339SJeff Mahoney int ret; 14543fd0a558SYan, Zheng 14553fd0a558SYan, Zheng if (root->reloc_root) { 14563fd0a558SYan, Zheng reloc_root = root->reloc_root; 14573fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 14583fd0a558SYan, Zheng return 0; 14593fd0a558SYan, Zheng } 14603fd0a558SYan, Zheng 14613fd0a558SYan, Zheng if (!rc || !rc->create_reloc_tree || 14623fd0a558SYan, Zheng root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 14633fd0a558SYan, Zheng return 0; 14643fd0a558SYan, Zheng 146520dd2cbfSMiao Xie if (!trans->reloc_reserved) { 146620dd2cbfSMiao Xie rsv = trans->block_rsv; 14673fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 14683fd0a558SYan, Zheng clear_rsv = 1; 14693fd0a558SYan, Zheng } 14703fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 14713fd0a558SYan, Zheng if (clear_rsv) 147220dd2cbfSMiao Xie trans->block_rsv = rsv; 14735d4f98a2SYan Zheng 1474ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1475ffd7b339SJeff Mahoney BUG_ON(ret < 0); 14765d4f98a2SYan Zheng root->reloc_root = reloc_root; 14775d4f98a2SYan Zheng return 0; 14785d4f98a2SYan Zheng } 14795d4f98a2SYan Zheng 14805d4f98a2SYan Zheng /* 14815d4f98a2SYan Zheng * update root item of reloc tree 14825d4f98a2SYan Zheng */ 14835d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 14845d4f98a2SYan Zheng struct btrfs_root *root) 14855d4f98a2SYan Zheng { 14865d4f98a2SYan Zheng struct btrfs_root *reloc_root; 14875d4f98a2SYan Zheng struct btrfs_root_item *root_item; 14885d4f98a2SYan Zheng int ret; 14895d4f98a2SYan Zheng 14905d4f98a2SYan Zheng if (!root->reloc_root) 14917585717fSChris Mason goto out; 14925d4f98a2SYan Zheng 14935d4f98a2SYan Zheng reloc_root = root->reloc_root; 14945d4f98a2SYan Zheng root_item = &reloc_root->root_item; 14955d4f98a2SYan Zheng 14963fd0a558SYan, Zheng if (root->fs_info->reloc_ctl->merge_reloc_tree && 14973fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 14985d4f98a2SYan Zheng root->reloc_root = NULL; 1499c974c464SWang Shilong __del_reloc_root(reloc_root); 15005d4f98a2SYan Zheng } 15015d4f98a2SYan Zheng 15025d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 15035d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 15045d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 15055d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 15065d4f98a2SYan Zheng } 15075d4f98a2SYan Zheng 15085d4f98a2SYan Zheng ret = btrfs_update_root(trans, root->fs_info->tree_root, 15095d4f98a2SYan Zheng &reloc_root->root_key, root_item); 15105d4f98a2SYan Zheng BUG_ON(ret); 15117585717fSChris Mason 15127585717fSChris Mason out: 15135d4f98a2SYan Zheng return 0; 15145d4f98a2SYan Zheng } 15155d4f98a2SYan Zheng 15165d4f98a2SYan Zheng /* 15175d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 15185d4f98a2SYan Zheng * in a subvolume 15195d4f98a2SYan Zheng */ 15205d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 15215d4f98a2SYan Zheng { 15225d4f98a2SYan Zheng struct rb_node *node; 15235d4f98a2SYan Zheng struct rb_node *prev; 15245d4f98a2SYan Zheng struct btrfs_inode *entry; 15255d4f98a2SYan Zheng struct inode *inode; 15265d4f98a2SYan Zheng 15275d4f98a2SYan Zheng spin_lock(&root->inode_lock); 15285d4f98a2SYan Zheng again: 15295d4f98a2SYan Zheng node = root->inode_tree.rb_node; 15305d4f98a2SYan Zheng prev = NULL; 15315d4f98a2SYan Zheng while (node) { 15325d4f98a2SYan Zheng prev = node; 15335d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 15345d4f98a2SYan Zheng 153533345d01SLi Zefan if (objectid < btrfs_ino(&entry->vfs_inode)) 15365d4f98a2SYan Zheng node = node->rb_left; 153733345d01SLi Zefan else if (objectid > btrfs_ino(&entry->vfs_inode)) 15385d4f98a2SYan Zheng node = node->rb_right; 15395d4f98a2SYan Zheng else 15405d4f98a2SYan Zheng break; 15415d4f98a2SYan Zheng } 15425d4f98a2SYan Zheng if (!node) { 15435d4f98a2SYan Zheng while (prev) { 15445d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 154533345d01SLi Zefan if (objectid <= btrfs_ino(&entry->vfs_inode)) { 15465d4f98a2SYan Zheng node = prev; 15475d4f98a2SYan Zheng break; 15485d4f98a2SYan Zheng } 15495d4f98a2SYan Zheng prev = rb_next(prev); 15505d4f98a2SYan Zheng } 15515d4f98a2SYan Zheng } 15525d4f98a2SYan Zheng while (node) { 15535d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 15545d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 15555d4f98a2SYan Zheng if (inode) { 15565d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15575d4f98a2SYan Zheng return inode; 15585d4f98a2SYan Zheng } 15595d4f98a2SYan Zheng 156033345d01SLi Zefan objectid = btrfs_ino(&entry->vfs_inode) + 1; 15615d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 15625d4f98a2SYan Zheng goto again; 15635d4f98a2SYan Zheng 15645d4f98a2SYan Zheng node = rb_next(node); 15655d4f98a2SYan Zheng } 15665d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15675d4f98a2SYan Zheng return NULL; 15685d4f98a2SYan Zheng } 15695d4f98a2SYan Zheng 15705d4f98a2SYan Zheng static int in_block_group(u64 bytenr, 15715d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group) 15725d4f98a2SYan Zheng { 15735d4f98a2SYan Zheng if (bytenr >= block_group->key.objectid && 15745d4f98a2SYan Zheng bytenr < block_group->key.objectid + block_group->key.offset) 15755d4f98a2SYan Zheng return 1; 15765d4f98a2SYan Zheng return 0; 15775d4f98a2SYan Zheng } 15785d4f98a2SYan Zheng 15795d4f98a2SYan Zheng /* 15805d4f98a2SYan Zheng * get new location of data 15815d4f98a2SYan Zheng */ 15825d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 15835d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 15845d4f98a2SYan Zheng { 15855d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 15865d4f98a2SYan Zheng struct btrfs_path *path; 15875d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 15885d4f98a2SYan Zheng struct extent_buffer *leaf; 15895d4f98a2SYan Zheng int ret; 15905d4f98a2SYan Zheng 15915d4f98a2SYan Zheng path = btrfs_alloc_path(); 15925d4f98a2SYan Zheng if (!path) 15935d4f98a2SYan Zheng return -ENOMEM; 15945d4f98a2SYan Zheng 15955d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 159633345d01SLi Zefan ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(reloc_inode), 15975d4f98a2SYan Zheng bytenr, 0); 15985d4f98a2SYan Zheng if (ret < 0) 15995d4f98a2SYan Zheng goto out; 16005d4f98a2SYan Zheng if (ret > 0) { 16015d4f98a2SYan Zheng ret = -ENOENT; 16025d4f98a2SYan Zheng goto out; 16035d4f98a2SYan Zheng } 16045d4f98a2SYan Zheng 16055d4f98a2SYan Zheng leaf = path->nodes[0]; 16065d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 16075d4f98a2SYan Zheng struct btrfs_file_extent_item); 16085d4f98a2SYan Zheng 16095d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 16105d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 16115d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 16125d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 16135d4f98a2SYan Zheng 16145d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 161583d4cfd4SJosef Bacik ret = -EINVAL; 16165d4f98a2SYan Zheng goto out; 16175d4f98a2SYan Zheng } 16185d4f98a2SYan Zheng 16195d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16205d4f98a2SYan Zheng ret = 0; 16215d4f98a2SYan Zheng out: 16225d4f98a2SYan Zheng btrfs_free_path(path); 16235d4f98a2SYan Zheng return ret; 16245d4f98a2SYan Zheng } 16255d4f98a2SYan Zheng 16265d4f98a2SYan Zheng /* 16275d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 16285d4f98a2SYan Zheng * the new locations. 16295d4f98a2SYan Zheng */ 16303fd0a558SYan, Zheng static noinline_for_stack 16313fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 16325d4f98a2SYan Zheng struct reloc_control *rc, 16335d4f98a2SYan Zheng struct btrfs_root *root, 16343fd0a558SYan, Zheng struct extent_buffer *leaf) 16355d4f98a2SYan Zheng { 16365d4f98a2SYan Zheng struct btrfs_key key; 16375d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 16385d4f98a2SYan Zheng struct inode *inode = NULL; 16395d4f98a2SYan Zheng u64 parent; 16405d4f98a2SYan Zheng u64 bytenr; 16413fd0a558SYan, Zheng u64 new_bytenr = 0; 16425d4f98a2SYan Zheng u64 num_bytes; 16435d4f98a2SYan Zheng u64 end; 16445d4f98a2SYan Zheng u32 nritems; 16455d4f98a2SYan Zheng u32 i; 164683d4cfd4SJosef Bacik int ret = 0; 16475d4f98a2SYan Zheng int first = 1; 16485d4f98a2SYan Zheng int dirty = 0; 16495d4f98a2SYan Zheng 16505d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 16515d4f98a2SYan Zheng return 0; 16525d4f98a2SYan Zheng 16535d4f98a2SYan Zheng /* reloc trees always use full backref */ 16545d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 16555d4f98a2SYan Zheng parent = leaf->start; 16565d4f98a2SYan Zheng else 16575d4f98a2SYan Zheng parent = 0; 16585d4f98a2SYan Zheng 16595d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 16605d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 16615d4f98a2SYan Zheng cond_resched(); 16625d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 16635d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 16645d4f98a2SYan Zheng continue; 16655d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 16665d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 16675d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 16685d4f98a2SYan Zheng continue; 16695d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16705d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 16715d4f98a2SYan Zheng if (bytenr == 0) 16725d4f98a2SYan Zheng continue; 16735d4f98a2SYan Zheng if (!in_block_group(bytenr, rc->block_group)) 16745d4f98a2SYan Zheng continue; 16755d4f98a2SYan Zheng 16765d4f98a2SYan Zheng /* 16775d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 16785d4f98a2SYan Zheng * to complete and drop the extent cache 16795d4f98a2SYan Zheng */ 16805d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 16815d4f98a2SYan Zheng if (first) { 16825d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16835d4f98a2SYan Zheng first = 0; 168433345d01SLi Zefan } else if (inode && btrfs_ino(inode) < key.objectid) { 16853fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 16865d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16875d4f98a2SYan Zheng } 168833345d01SLi Zefan if (inode && btrfs_ino(inode) == key.objectid) { 16895d4f98a2SYan Zheng end = key.offset + 16905d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 16915d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 16925d4f98a2SYan Zheng root->sectorsize)); 16935d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(end, root->sectorsize)); 16945d4f98a2SYan Zheng end--; 16955d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1696d0082371SJeff Mahoney key.offset, end); 16975d4f98a2SYan Zheng if (!ret) 16985d4f98a2SYan Zheng continue; 16995d4f98a2SYan Zheng 17005d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, key.offset, end, 17015d4f98a2SYan Zheng 1); 17025d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1703d0082371SJeff Mahoney key.offset, end); 17045d4f98a2SYan Zheng } 17055d4f98a2SYan Zheng } 17065d4f98a2SYan Zheng 17075d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 17085d4f98a2SYan Zheng bytenr, num_bytes); 170983d4cfd4SJosef Bacik if (ret) { 171083d4cfd4SJosef Bacik /* 171183d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 171283d4cfd4SJosef Bacik * in the file extent yet. 171383d4cfd4SJosef Bacik */ 171483d4cfd4SJosef Bacik break; 17153fd0a558SYan, Zheng } 17165d4f98a2SYan Zheng 17175d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 17185d4f98a2SYan Zheng dirty = 1; 17195d4f98a2SYan Zheng 17205d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 17215d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, root, new_bytenr, 17225d4f98a2SYan Zheng num_bytes, parent, 17235d4f98a2SYan Zheng btrfs_header_owner(leaf), 1724b06c4bf5SFilipe Manana key.objectid, key.offset); 172583d4cfd4SJosef Bacik if (ret) { 172683d4cfd4SJosef Bacik btrfs_abort_transaction(trans, root, ret); 172783d4cfd4SJosef Bacik break; 172883d4cfd4SJosef Bacik } 17295d4f98a2SYan Zheng 17305d4f98a2SYan Zheng ret = btrfs_free_extent(trans, root, bytenr, num_bytes, 17315d4f98a2SYan Zheng parent, btrfs_header_owner(leaf), 1732b06c4bf5SFilipe Manana key.objectid, key.offset); 173383d4cfd4SJosef Bacik if (ret) { 173483d4cfd4SJosef Bacik btrfs_abort_transaction(trans, root, ret); 173583d4cfd4SJosef Bacik break; 173683d4cfd4SJosef Bacik } 17375d4f98a2SYan Zheng } 17385d4f98a2SYan Zheng if (dirty) 17395d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 17403fd0a558SYan, Zheng if (inode) 17413fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 174283d4cfd4SJosef Bacik return ret; 17435d4f98a2SYan Zheng } 17445d4f98a2SYan Zheng 17455d4f98a2SYan Zheng static noinline_for_stack 17465d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 17475d4f98a2SYan Zheng struct btrfs_path *path, int level) 17485d4f98a2SYan Zheng { 17495d4f98a2SYan Zheng struct btrfs_disk_key key1; 17505d4f98a2SYan Zheng struct btrfs_disk_key key2; 17515d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 17525d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 17535d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 17545d4f98a2SYan Zheng } 17555d4f98a2SYan Zheng 17565d4f98a2SYan Zheng /* 17575d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 17585d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 17595d4f98a2SYan Zheng * reloc tree was create can be replaced. 17605d4f98a2SYan Zheng * 17615d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 17625d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 17635d4f98a2SYan Zheng * errors, a negative error number is returned. 17645d4f98a2SYan Zheng */ 17653fd0a558SYan, Zheng static noinline_for_stack 17663fd0a558SYan, Zheng int replace_path(struct btrfs_trans_handle *trans, 17675d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 17685d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 17695d4f98a2SYan Zheng int lowest_level, int max_level) 17705d4f98a2SYan Zheng { 17715d4f98a2SYan Zheng struct extent_buffer *eb; 17725d4f98a2SYan Zheng struct extent_buffer *parent; 17735d4f98a2SYan Zheng struct btrfs_key key; 17745d4f98a2SYan Zheng u64 old_bytenr; 17755d4f98a2SYan Zheng u64 new_bytenr; 17765d4f98a2SYan Zheng u64 old_ptr_gen; 17775d4f98a2SYan Zheng u64 new_ptr_gen; 17785d4f98a2SYan Zheng u64 last_snapshot; 17795d4f98a2SYan Zheng u32 blocksize; 17803fd0a558SYan, Zheng int cow = 0; 17815d4f98a2SYan Zheng int level; 17825d4f98a2SYan Zheng int ret; 17835d4f98a2SYan Zheng int slot; 17845d4f98a2SYan Zheng 17855d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 17865d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 17875d4f98a2SYan Zheng 17885d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 17893fd0a558SYan, Zheng again: 17905d4f98a2SYan Zheng slot = path->slots[lowest_level]; 17915d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 17925d4f98a2SYan Zheng 17935d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 17945d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 17955d4f98a2SYan Zheng level = btrfs_header_level(eb); 17965d4f98a2SYan Zheng 17975d4f98a2SYan Zheng if (level < lowest_level) { 17985d4f98a2SYan Zheng btrfs_tree_unlock(eb); 17995d4f98a2SYan Zheng free_extent_buffer(eb); 18005d4f98a2SYan Zheng return 0; 18015d4f98a2SYan Zheng } 18025d4f98a2SYan Zheng 18033fd0a558SYan, Zheng if (cow) { 18045d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 18055d4f98a2SYan Zheng BUG_ON(ret); 18063fd0a558SYan, Zheng } 18075d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 18085d4f98a2SYan Zheng 18095d4f98a2SYan Zheng if (next_key) { 18105d4f98a2SYan Zheng next_key->objectid = (u64)-1; 18115d4f98a2SYan Zheng next_key->type = (u8)-1; 18125d4f98a2SYan Zheng next_key->offset = (u64)-1; 18135d4f98a2SYan Zheng } 18145d4f98a2SYan Zheng 18155d4f98a2SYan Zheng parent = eb; 18165d4f98a2SYan Zheng while (1) { 18175d4f98a2SYan Zheng level = btrfs_header_level(parent); 18185d4f98a2SYan Zheng BUG_ON(level < lowest_level); 18195d4f98a2SYan Zheng 18205d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 18215d4f98a2SYan Zheng if (ret && slot > 0) 18225d4f98a2SYan Zheng slot--; 18235d4f98a2SYan Zheng 18245d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 18255d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 18265d4f98a2SYan Zheng 18275d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 1828707e8a07SDavid Sterba blocksize = dest->nodesize; 18295d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 18305d4f98a2SYan Zheng 18315d4f98a2SYan Zheng if (level <= max_level) { 18325d4f98a2SYan Zheng eb = path->nodes[level]; 18335d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 18345d4f98a2SYan Zheng path->slots[level]); 18355d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 18365d4f98a2SYan Zheng path->slots[level]); 18375d4f98a2SYan Zheng } else { 18385d4f98a2SYan Zheng new_bytenr = 0; 18395d4f98a2SYan Zheng new_ptr_gen = 0; 18405d4f98a2SYan Zheng } 18415d4f98a2SYan Zheng 1842fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 18435d4f98a2SYan Zheng ret = level; 18445d4f98a2SYan Zheng break; 18455d4f98a2SYan Zheng } 18465d4f98a2SYan Zheng 18475d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 18485d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 18493fd0a558SYan, Zheng if (level <= lowest_level) { 18505d4f98a2SYan Zheng ret = 0; 18515d4f98a2SYan Zheng break; 18525d4f98a2SYan Zheng } 18535d4f98a2SYan Zheng 1854ce86cd59SDavid Sterba eb = read_tree_block(dest, old_bytenr, old_ptr_gen); 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 } 18693fd0a558SYan, Zheng btrfs_set_lock_blocking(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 /* 18955d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 18965d4f98a2SYan Zheng */ 18975d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 18985d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 18995d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 19005d4f98a2SYan Zheng 19015d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 19025d4f98a2SYan Zheng path->slots[level], old_bytenr); 19035d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 19045d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 19055d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 19065d4f98a2SYan Zheng 19075d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, src, old_bytenr, blocksize, 19085d4f98a2SYan Zheng path->nodes[level]->start, 1909b06c4bf5SFilipe Manana src->root_key.objectid, level - 1, 0); 19105d4f98a2SYan Zheng BUG_ON(ret); 19115d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, dest, new_bytenr, blocksize, 19125d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 1913b06c4bf5SFilipe Manana 0); 19145d4f98a2SYan Zheng BUG_ON(ret); 19155d4f98a2SYan Zheng 19165d4f98a2SYan Zheng ret = btrfs_free_extent(trans, src, new_bytenr, blocksize, 19175d4f98a2SYan Zheng path->nodes[level]->start, 1918b06c4bf5SFilipe Manana src->root_key.objectid, level - 1, 0); 19195d4f98a2SYan Zheng BUG_ON(ret); 19205d4f98a2SYan Zheng 19215d4f98a2SYan Zheng ret = btrfs_free_extent(trans, dest, old_bytenr, blocksize, 19225d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 1923b06c4bf5SFilipe Manana 0); 19245d4f98a2SYan Zheng BUG_ON(ret); 19255d4f98a2SYan Zheng 19265d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 19275d4f98a2SYan Zheng 19285d4f98a2SYan Zheng ret = level; 19295d4f98a2SYan Zheng break; 19305d4f98a2SYan Zheng } 19315d4f98a2SYan Zheng btrfs_tree_unlock(parent); 19325d4f98a2SYan Zheng free_extent_buffer(parent); 19335d4f98a2SYan Zheng return ret; 19345d4f98a2SYan Zheng } 19355d4f98a2SYan Zheng 19365d4f98a2SYan Zheng /* 19375d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 19385d4f98a2SYan Zheng */ 19395d4f98a2SYan Zheng static noinline_for_stack 19405d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 19415d4f98a2SYan Zheng int *level) 19425d4f98a2SYan Zheng { 19435d4f98a2SYan Zheng struct extent_buffer *eb; 19445d4f98a2SYan Zheng int i; 19455d4f98a2SYan Zheng u64 last_snapshot; 19465d4f98a2SYan Zheng u32 nritems; 19475d4f98a2SYan Zheng 19485d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19495d4f98a2SYan Zheng 19505d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 19515d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19525d4f98a2SYan Zheng path->nodes[i] = NULL; 19535d4f98a2SYan Zheng } 19545d4f98a2SYan Zheng 19555d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 19565d4f98a2SYan Zheng eb = path->nodes[i]; 19575d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 19585d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 19595d4f98a2SYan Zheng path->slots[i]++; 19605d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 19615d4f98a2SYan Zheng last_snapshot) 19625d4f98a2SYan Zheng continue; 19635d4f98a2SYan Zheng 19645d4f98a2SYan Zheng *level = i; 19655d4f98a2SYan Zheng return 0; 19665d4f98a2SYan Zheng } 19675d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19685d4f98a2SYan Zheng path->nodes[i] = NULL; 19695d4f98a2SYan Zheng } 19705d4f98a2SYan Zheng return 1; 19715d4f98a2SYan Zheng } 19725d4f98a2SYan Zheng 19735d4f98a2SYan Zheng /* 19745d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 19755d4f98a2SYan Zheng */ 19765d4f98a2SYan Zheng static noinline_for_stack 19775d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 19785d4f98a2SYan Zheng int *level) 19795d4f98a2SYan Zheng { 19805d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 19815d4f98a2SYan Zheng int i; 19825d4f98a2SYan Zheng u64 bytenr; 19835d4f98a2SYan Zheng u64 ptr_gen = 0; 19845d4f98a2SYan Zheng u64 last_snapshot; 19855d4f98a2SYan Zheng u32 nritems; 19865d4f98a2SYan Zheng 19875d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19885d4f98a2SYan Zheng 19895d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 19905d4f98a2SYan Zheng eb = path->nodes[i]; 19915d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 19925d4f98a2SYan Zheng while (path->slots[i] < nritems) { 19935d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 19945d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 19955d4f98a2SYan Zheng break; 19965d4f98a2SYan Zheng path->slots[i]++; 19975d4f98a2SYan Zheng } 19985d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 19995d4f98a2SYan Zheng if (i == *level) 20005d4f98a2SYan Zheng break; 20015d4f98a2SYan Zheng *level = i + 1; 20025d4f98a2SYan Zheng return 0; 20035d4f98a2SYan Zheng } 20045d4f98a2SYan Zheng if (i == 1) { 20055d4f98a2SYan Zheng *level = i; 20065d4f98a2SYan Zheng return 0; 20075d4f98a2SYan Zheng } 20085d4f98a2SYan Zheng 20095d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2010ce86cd59SDavid Sterba eb = read_tree_block(root, bytenr, ptr_gen); 201164c043deSLiu Bo if (IS_ERR(eb)) { 201264c043deSLiu Bo return PTR_ERR(eb); 201364c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2014416bc658SJosef Bacik free_extent_buffer(eb); 2015416bc658SJosef Bacik return -EIO; 2016416bc658SJosef Bacik } 20175d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 20185d4f98a2SYan Zheng path->nodes[i - 1] = eb; 20195d4f98a2SYan Zheng path->slots[i - 1] = 0; 20205d4f98a2SYan Zheng } 20215d4f98a2SYan Zheng return 1; 20225d4f98a2SYan Zheng } 20235d4f98a2SYan Zheng 20245d4f98a2SYan Zheng /* 20255d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 20265d4f98a2SYan Zheng * [min_key, max_key) 20275d4f98a2SYan Zheng */ 20285d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 20295d4f98a2SYan Zheng struct btrfs_key *min_key, 20305d4f98a2SYan Zheng struct btrfs_key *max_key) 20315d4f98a2SYan Zheng { 20325d4f98a2SYan Zheng struct inode *inode = NULL; 20335d4f98a2SYan Zheng u64 objectid; 20345d4f98a2SYan Zheng u64 start, end; 203533345d01SLi Zefan u64 ino; 20365d4f98a2SYan Zheng 20375d4f98a2SYan Zheng objectid = min_key->objectid; 20385d4f98a2SYan Zheng while (1) { 20395d4f98a2SYan Zheng cond_resched(); 20405d4f98a2SYan Zheng iput(inode); 20415d4f98a2SYan Zheng 20425d4f98a2SYan Zheng if (objectid > max_key->objectid) 20435d4f98a2SYan Zheng break; 20445d4f98a2SYan Zheng 20455d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 20465d4f98a2SYan Zheng if (!inode) 20475d4f98a2SYan Zheng break; 204833345d01SLi Zefan ino = btrfs_ino(inode); 20495d4f98a2SYan Zheng 205033345d01SLi Zefan if (ino > max_key->objectid) { 20515d4f98a2SYan Zheng iput(inode); 20525d4f98a2SYan Zheng break; 20535d4f98a2SYan Zheng } 20545d4f98a2SYan Zheng 205533345d01SLi Zefan objectid = ino + 1; 20565d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 20575d4f98a2SYan Zheng continue; 20585d4f98a2SYan Zheng 205933345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 20605d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 20615d4f98a2SYan Zheng continue; 20625d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 20635d4f98a2SYan Zheng start = 0; 20645d4f98a2SYan Zheng else { 20655d4f98a2SYan Zheng start = min_key->offset; 20665d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(start, root->sectorsize)); 20675d4f98a2SYan Zheng } 20685d4f98a2SYan Zheng } else { 20695d4f98a2SYan Zheng start = 0; 20705d4f98a2SYan Zheng } 20715d4f98a2SYan Zheng 207233345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 20735d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 20745d4f98a2SYan Zheng continue; 20755d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 20765d4f98a2SYan Zheng end = (u64)-1; 20775d4f98a2SYan Zheng } else { 20785d4f98a2SYan Zheng if (max_key->offset == 0) 20795d4f98a2SYan Zheng continue; 20805d4f98a2SYan Zheng end = max_key->offset; 20815d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(end, root->sectorsize)); 20825d4f98a2SYan Zheng end--; 20835d4f98a2SYan Zheng } 20845d4f98a2SYan Zheng } else { 20855d4f98a2SYan Zheng end = (u64)-1; 20865d4f98a2SYan Zheng } 20875d4f98a2SYan Zheng 20885d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2089d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 20905d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, start, end, 1); 2091d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 20925d4f98a2SYan Zheng } 20935d4f98a2SYan Zheng return 0; 20945d4f98a2SYan Zheng } 20955d4f98a2SYan Zheng 20965d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 20975d4f98a2SYan Zheng struct btrfs_key *key) 20985d4f98a2SYan Zheng 20995d4f98a2SYan Zheng { 21005d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 21015d4f98a2SYan Zheng if (!path->nodes[level]) 21025d4f98a2SYan Zheng break; 21035d4f98a2SYan Zheng if (path->slots[level] + 1 < 21045d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 21055d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 21065d4f98a2SYan Zheng path->slots[level] + 1); 21075d4f98a2SYan Zheng return 0; 21085d4f98a2SYan Zheng } 21095d4f98a2SYan Zheng level++; 21105d4f98a2SYan Zheng } 21115d4f98a2SYan Zheng return 1; 21125d4f98a2SYan Zheng } 21135d4f98a2SYan Zheng 21145d4f98a2SYan Zheng /* 21155d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 21165d4f98a2SYan Zheng * fs tree. 21175d4f98a2SYan Zheng */ 21185d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 21195d4f98a2SYan Zheng struct btrfs_root *root) 21205d4f98a2SYan Zheng { 21215d4f98a2SYan Zheng LIST_HEAD(inode_list); 21225d4f98a2SYan Zheng struct btrfs_key key; 21235d4f98a2SYan Zheng struct btrfs_key next_key; 21249e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 21255d4f98a2SYan Zheng struct btrfs_root *reloc_root; 21265d4f98a2SYan Zheng struct btrfs_root_item *root_item; 21275d4f98a2SYan Zheng struct btrfs_path *path; 21283fd0a558SYan, Zheng struct extent_buffer *leaf; 21295d4f98a2SYan Zheng int level; 21305d4f98a2SYan Zheng int max_level; 21315d4f98a2SYan Zheng int replaced = 0; 21325d4f98a2SYan Zheng int ret; 21335d4f98a2SYan Zheng int err = 0; 21343fd0a558SYan, Zheng u32 min_reserved; 21355d4f98a2SYan Zheng 21365d4f98a2SYan Zheng path = btrfs_alloc_path(); 21375d4f98a2SYan Zheng if (!path) 21385d4f98a2SYan Zheng return -ENOMEM; 2139e4058b54SDavid Sterba path->reada = READA_FORWARD; 21405d4f98a2SYan Zheng 21415d4f98a2SYan Zheng reloc_root = root->reloc_root; 21425d4f98a2SYan Zheng root_item = &reloc_root->root_item; 21435d4f98a2SYan Zheng 21445d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 21455d4f98a2SYan Zheng level = btrfs_root_level(root_item); 21465d4f98a2SYan Zheng extent_buffer_get(reloc_root->node); 21475d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 21485d4f98a2SYan Zheng path->slots[level] = 0; 21495d4f98a2SYan Zheng } else { 21505d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 21515d4f98a2SYan Zheng 21525d4f98a2SYan Zheng level = root_item->drop_level; 21535d4f98a2SYan Zheng BUG_ON(level == 0); 21545d4f98a2SYan Zheng path->lowest_level = level; 21555d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 215633c66f43SYan Zheng path->lowest_level = 0; 21575d4f98a2SYan Zheng if (ret < 0) { 21585d4f98a2SYan Zheng btrfs_free_path(path); 21595d4f98a2SYan Zheng return ret; 21605d4f98a2SYan Zheng } 21615d4f98a2SYan Zheng 21625d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 21635d4f98a2SYan Zheng path->slots[level]); 21645d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 21655d4f98a2SYan Zheng 21665d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 21675d4f98a2SYan Zheng } 21685d4f98a2SYan Zheng 21693fd0a558SYan, Zheng min_reserved = root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 21705d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 21715d4f98a2SYan Zheng 21725d4f98a2SYan Zheng while (1) { 217308e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 217408e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 21753fd0a558SYan, Zheng if (ret) { 21769e6a0c52SJosef Bacik err = ret; 21779e6a0c52SJosef Bacik goto out; 21783fd0a558SYan, Zheng } 21799e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 21809e6a0c52SJosef Bacik if (IS_ERR(trans)) { 21819e6a0c52SJosef Bacik err = PTR_ERR(trans); 21829e6a0c52SJosef Bacik trans = NULL; 21839e6a0c52SJosef Bacik goto out; 21849e6a0c52SJosef Bacik } 21859e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 21863fd0a558SYan, Zheng 21873fd0a558SYan, Zheng replaced = 0; 21885d4f98a2SYan Zheng max_level = level; 21895d4f98a2SYan Zheng 21905d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 21915d4f98a2SYan Zheng if (ret < 0) { 21925d4f98a2SYan Zheng err = ret; 21935d4f98a2SYan Zheng goto out; 21945d4f98a2SYan Zheng } 21955d4f98a2SYan Zheng if (ret > 0) 21965d4f98a2SYan Zheng break; 21975d4f98a2SYan Zheng 21985d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 21995d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 22005d4f98a2SYan Zheng ret = 0; 22015d4f98a2SYan Zheng } else { 22023fd0a558SYan, Zheng ret = replace_path(trans, root, reloc_root, path, 22033fd0a558SYan, Zheng &next_key, level, max_level); 22045d4f98a2SYan Zheng } 22055d4f98a2SYan Zheng if (ret < 0) { 22065d4f98a2SYan Zheng err = ret; 22075d4f98a2SYan Zheng goto out; 22085d4f98a2SYan Zheng } 22095d4f98a2SYan Zheng 22105d4f98a2SYan Zheng if (ret > 0) { 22115d4f98a2SYan Zheng level = ret; 22125d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 22135d4f98a2SYan Zheng path->slots[level]); 22145d4f98a2SYan Zheng replaced = 1; 22155d4f98a2SYan Zheng } 22165d4f98a2SYan Zheng 22175d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 22185d4f98a2SYan Zheng if (ret > 0) 22195d4f98a2SYan Zheng break; 22205d4f98a2SYan Zheng 22215d4f98a2SYan Zheng BUG_ON(level == 0); 22225d4f98a2SYan Zheng /* 22235d4f98a2SYan Zheng * save the merging progress in the drop_progress. 22245d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 22255d4f98a2SYan Zheng */ 22265d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 22275d4f98a2SYan Zheng path->slots[level]); 22285d4f98a2SYan Zheng root_item->drop_level = level; 22295d4f98a2SYan Zheng 22303fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, root); 22319e6a0c52SJosef Bacik trans = NULL; 22325d4f98a2SYan Zheng 2233b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 22345d4f98a2SYan Zheng 22355d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 22365d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 22375d4f98a2SYan Zheng } 22385d4f98a2SYan Zheng 22395d4f98a2SYan Zheng /* 22405d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 22415d4f98a2SYan Zheng * relocated and the block is tree root. 22425d4f98a2SYan Zheng */ 22435d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 22445d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 22455d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 22465d4f98a2SYan Zheng free_extent_buffer(leaf); 22475d4f98a2SYan Zheng if (ret < 0) 22485d4f98a2SYan Zheng err = ret; 22495d4f98a2SYan Zheng out: 22505d4f98a2SYan Zheng btrfs_free_path(path); 22515d4f98a2SYan Zheng 22525d4f98a2SYan Zheng if (err == 0) { 22535d4f98a2SYan Zheng memset(&root_item->drop_progress, 0, 22545d4f98a2SYan Zheng sizeof(root_item->drop_progress)); 22555d4f98a2SYan Zheng root_item->drop_level = 0; 22565d4f98a2SYan Zheng btrfs_set_root_refs(root_item, 0); 22573fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 22585d4f98a2SYan Zheng } 22595d4f98a2SYan Zheng 22609e6a0c52SJosef Bacik if (trans) 22613fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, root); 22625d4f98a2SYan Zheng 2263b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 22645d4f98a2SYan Zheng 22655d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 22665d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 22675d4f98a2SYan Zheng 22685d4f98a2SYan Zheng return err; 22695d4f98a2SYan Zheng } 22705d4f98a2SYan Zheng 22713fd0a558SYan, Zheng static noinline_for_stack 22723fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 22735d4f98a2SYan Zheng { 22743fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 22753fd0a558SYan, Zheng struct btrfs_root *reloc_root; 22765d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 22773fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 22783fd0a558SYan, Zheng u64 num_bytes = 0; 22793fd0a558SYan, Zheng int ret; 22803fd0a558SYan, Zheng 22817585717fSChris Mason mutex_lock(&root->fs_info->reloc_mutex); 22823fd0a558SYan, Zheng rc->merging_rsv_size += root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 22833fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 22847585717fSChris Mason mutex_unlock(&root->fs_info->reloc_mutex); 22857585717fSChris Mason 22863fd0a558SYan, Zheng again: 22873fd0a558SYan, Zheng if (!err) { 22883fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 228908e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 229008e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 22913fd0a558SYan, Zheng if (ret) 22923fd0a558SYan, Zheng err = ret; 22933fd0a558SYan, Zheng } 22943fd0a558SYan, Zheng 22957a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 22963612b495STsutomu Itoh if (IS_ERR(trans)) { 22973612b495STsutomu Itoh if (!err) 22983612b495STsutomu Itoh btrfs_block_rsv_release(rc->extent_root, 22993612b495STsutomu Itoh rc->block_rsv, num_bytes); 23003612b495STsutomu Itoh return PTR_ERR(trans); 23013612b495STsutomu Itoh } 23023fd0a558SYan, Zheng 23033fd0a558SYan, Zheng if (!err) { 23043fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 23053fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 23063fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, 23073fd0a558SYan, Zheng rc->block_rsv, num_bytes); 23083fd0a558SYan, Zheng goto again; 23093fd0a558SYan, Zheng } 23103fd0a558SYan, Zheng } 23113fd0a558SYan, Zheng 23123fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 23133fd0a558SYan, Zheng 23143fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 23153fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 23163fd0a558SYan, Zheng struct btrfs_root, root_list); 23173fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 23183fd0a558SYan, Zheng 23193fd0a558SYan, Zheng root = read_fs_root(reloc_root->fs_info, 23203fd0a558SYan, Zheng reloc_root->root_key.offset); 23213fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 23223fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 23233fd0a558SYan, Zheng 23243fd0a558SYan, Zheng /* 23253fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 23263fd0a558SYan, Zheng * knows it should resumes merging 23273fd0a558SYan, Zheng */ 23283fd0a558SYan, Zheng if (!err) 23293fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 23303fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 23313fd0a558SYan, Zheng 23323fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 23333fd0a558SYan, Zheng } 23343fd0a558SYan, Zheng 23353fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 23363fd0a558SYan, Zheng 23373fd0a558SYan, Zheng if (!err) 23383fd0a558SYan, Zheng btrfs_commit_transaction(trans, rc->extent_root); 23393fd0a558SYan, Zheng else 23403fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 23413fd0a558SYan, Zheng return err; 23423fd0a558SYan, Zheng } 23433fd0a558SYan, Zheng 23443fd0a558SYan, Zheng static noinline_for_stack 2345aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2346aca1bba6SLiu Bo { 2347aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2348aca1bba6SLiu Bo 2349aca1bba6SLiu Bo while (!list_empty(list)) { 2350aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2351aca1bba6SLiu Bo root_list); 2352c974c464SWang Shilong __del_reloc_root(reloc_root); 2353aca1bba6SLiu Bo } 2354aca1bba6SLiu Bo } 2355aca1bba6SLiu Bo 2356aca1bba6SLiu Bo static noinline_for_stack 235794404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 23583fd0a558SYan, Zheng { 23595d4f98a2SYan Zheng struct btrfs_root *root; 23605d4f98a2SYan Zheng struct btrfs_root *reloc_root; 23615bc7247aSMiao Xie u64 last_snap; 23625bc7247aSMiao Xie u64 otransid; 23635bc7247aSMiao Xie u64 objectid; 23643fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 23653fd0a558SYan, Zheng int found = 0; 2366aca1bba6SLiu Bo int ret = 0; 23673fd0a558SYan, Zheng again: 23683fd0a558SYan, Zheng root = rc->extent_root; 23697585717fSChris Mason 23707585717fSChris Mason /* 23717585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 23727585717fSChris Mason * we have to make sure nobody is in the middle of 23737585717fSChris Mason * adding their roots to the list while we are 23747585717fSChris Mason * doing this splice 23757585717fSChris Mason */ 23767585717fSChris Mason mutex_lock(&root->fs_info->reloc_mutex); 23773fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 23787585717fSChris Mason mutex_unlock(&root->fs_info->reloc_mutex); 23795d4f98a2SYan Zheng 23803fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 23813fd0a558SYan, Zheng found = 1; 23823fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 23833fd0a558SYan, Zheng struct btrfs_root, root_list); 23845d4f98a2SYan Zheng 23855d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 23865d4f98a2SYan Zheng root = read_fs_root(reloc_root->fs_info, 23875d4f98a2SYan Zheng reloc_root->root_key.offset); 23885d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 23895d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 23905d4f98a2SYan Zheng 23913fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 2392b37b39cdSJosef Bacik if (ret) { 239325e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 239425e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 239525e293c2SWang Shilong &reloc_roots); 2396aca1bba6SLiu Bo goto out; 2397b37b39cdSJosef Bacik } 23983fd0a558SYan, Zheng } else { 23993fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 24003fd0a558SYan, Zheng } 24015bc7247aSMiao Xie 24025bc7247aSMiao Xie /* 240301327610SNicholas D Steeves * we keep the old last snapshot transid in rtranid when we 24045bc7247aSMiao Xie * created the relocation tree. 24055bc7247aSMiao Xie */ 24065bc7247aSMiao Xie last_snap = btrfs_root_rtransid(&reloc_root->root_item); 24075bc7247aSMiao Xie otransid = btrfs_root_otransid(&reloc_root->root_item); 24085bc7247aSMiao Xie objectid = reloc_root->root_key.offset; 24095bc7247aSMiao Xie 24102c536799SJeff Mahoney ret = btrfs_drop_snapshot(reloc_root, rc->block_rsv, 0, 1); 2411aca1bba6SLiu Bo if (ret < 0) { 2412aca1bba6SLiu Bo if (list_empty(&reloc_root->root_list)) 2413aca1bba6SLiu Bo list_add_tail(&reloc_root->root_list, 2414aca1bba6SLiu Bo &reloc_roots); 2415aca1bba6SLiu Bo goto out; 2416aca1bba6SLiu Bo } 24175d4f98a2SYan Zheng } 24185d4f98a2SYan Zheng 24193fd0a558SYan, Zheng if (found) { 24203fd0a558SYan, Zheng found = 0; 24213fd0a558SYan, Zheng goto again; 24225d4f98a2SYan Zheng } 2423aca1bba6SLiu Bo out: 2424aca1bba6SLiu Bo if (ret) { 242534d97007SAnand Jain btrfs_handle_fs_error(root->fs_info, ret, NULL); 2426aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2427aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2428467bb1d2SWang Shilong 2429467bb1d2SWang Shilong /* new reloc root may be added */ 2430467bb1d2SWang Shilong mutex_lock(&root->fs_info->reloc_mutex); 2431467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 2432467bb1d2SWang Shilong mutex_unlock(&root->fs_info->reloc_mutex); 2433467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2434467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2435aca1bba6SLiu Bo } 2436aca1bba6SLiu Bo 24375d4f98a2SYan Zheng BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 24385d4f98a2SYan Zheng } 24395d4f98a2SYan Zheng 24405d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 24415d4f98a2SYan Zheng { 24425d4f98a2SYan Zheng struct tree_block *block; 24435d4f98a2SYan Zheng struct rb_node *rb_node; 24445d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 24455d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 24465d4f98a2SYan Zheng rb_erase(rb_node, blocks); 24475d4f98a2SYan Zheng kfree(block); 24485d4f98a2SYan Zheng } 24495d4f98a2SYan Zheng } 24505d4f98a2SYan Zheng 24515d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 24525d4f98a2SYan Zheng struct btrfs_root *reloc_root) 24535d4f98a2SYan Zheng { 24545d4f98a2SYan Zheng struct btrfs_root *root; 24555d4f98a2SYan Zheng 24565d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 24575d4f98a2SYan Zheng return 0; 24585d4f98a2SYan Zheng 24595d4f98a2SYan Zheng root = read_fs_root(reloc_root->fs_info, reloc_root->root_key.offset); 24605d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 24615d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 24625d4f98a2SYan Zheng 24635d4f98a2SYan Zheng return btrfs_record_root_in_trans(trans, root); 24645d4f98a2SYan Zheng } 24655d4f98a2SYan Zheng 24663fd0a558SYan, Zheng static noinline_for_stack 24673fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 24683fd0a558SYan, Zheng struct reloc_control *rc, 24695d4f98a2SYan Zheng struct backref_node *node, 2470dc4103f9SWang Shilong struct backref_edge *edges[]) 24715d4f98a2SYan Zheng { 24725d4f98a2SYan Zheng struct backref_node *next; 24735d4f98a2SYan Zheng struct btrfs_root *root; 24743fd0a558SYan, Zheng int index = 0; 24753fd0a558SYan, Zheng 24765d4f98a2SYan Zheng next = node; 24775d4f98a2SYan Zheng while (1) { 24785d4f98a2SYan Zheng cond_resched(); 24795d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 24805d4f98a2SYan Zheng root = next->root; 24813fd0a558SYan, Zheng BUG_ON(!root); 248227cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 24835d4f98a2SYan Zheng 24845d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 24855d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 24865d4f98a2SYan Zheng break; 24875d4f98a2SYan Zheng } 24885d4f98a2SYan Zheng 24895d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 24903fd0a558SYan, Zheng root = root->reloc_root; 24913fd0a558SYan, Zheng 24923fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 24933fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 24943fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 24953fd0a558SYan, Zheng next->new_bytenr = root->node->start; 24963fd0a558SYan, Zheng next->root = root; 24973fd0a558SYan, Zheng list_add_tail(&next->list, 24983fd0a558SYan, Zheng &rc->backref_cache.changed); 24993fd0a558SYan, Zheng __mark_block_processed(rc, next); 25005d4f98a2SYan Zheng break; 25015d4f98a2SYan Zheng } 25025d4f98a2SYan Zheng 25033fd0a558SYan, Zheng WARN_ON(1); 25045d4f98a2SYan Zheng root = NULL; 25055d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 25065d4f98a2SYan Zheng if (!next || next->level <= node->level) 25075d4f98a2SYan Zheng break; 25085d4f98a2SYan Zheng } 25093fd0a558SYan, Zheng if (!root) 25103fd0a558SYan, Zheng return NULL; 25115d4f98a2SYan Zheng 25123fd0a558SYan, Zheng next = node; 25133fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 25143fd0a558SYan, Zheng while (1) { 25153fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 25163fd0a558SYan, Zheng if (--index < 0) 25173fd0a558SYan, Zheng break; 25183fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 25193fd0a558SYan, Zheng } 25205d4f98a2SYan Zheng return root; 25215d4f98a2SYan Zheng } 25225d4f98a2SYan Zheng 25233fd0a558SYan, Zheng /* 25243fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 25253fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 25263fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 25273fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 25283fd0a558SYan, Zheng */ 25295d4f98a2SYan Zheng static noinline_for_stack 2530147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 25315d4f98a2SYan Zheng { 25323fd0a558SYan, Zheng struct backref_node *next; 25333fd0a558SYan, Zheng struct btrfs_root *root; 25343fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 25355d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25363fd0a558SYan, Zheng int index = 0; 25373fd0a558SYan, Zheng 25383fd0a558SYan, Zheng next = node; 25393fd0a558SYan, Zheng while (1) { 25403fd0a558SYan, Zheng cond_resched(); 25413fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 25423fd0a558SYan, Zheng root = next->root; 25433fd0a558SYan, Zheng BUG_ON(!root); 25443fd0a558SYan, Zheng 254525985edcSLucas De Marchi /* no other choice for non-references counted tree */ 254627cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 25473fd0a558SYan, Zheng return root; 25483fd0a558SYan, Zheng 25493fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 25503fd0a558SYan, Zheng fs_root = root; 25513fd0a558SYan, Zheng 25523fd0a558SYan, Zheng if (next != node) 25533fd0a558SYan, Zheng return NULL; 25543fd0a558SYan, Zheng 25553fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 25563fd0a558SYan, Zheng if (!next || next->level <= node->level) 25573fd0a558SYan, Zheng break; 25583fd0a558SYan, Zheng } 25593fd0a558SYan, Zheng 25603fd0a558SYan, Zheng if (!fs_root) 25613fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 25623fd0a558SYan, Zheng return fs_root; 25635d4f98a2SYan Zheng } 25645d4f98a2SYan Zheng 25655d4f98a2SYan Zheng static noinline_for_stack 25663fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 25673fd0a558SYan, Zheng struct backref_node *node, int reserve) 25685d4f98a2SYan Zheng { 25693fd0a558SYan, Zheng struct backref_node *next = node; 25703fd0a558SYan, Zheng struct backref_edge *edge; 25713fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25723fd0a558SYan, Zheng u64 num_bytes = 0; 25733fd0a558SYan, Zheng int index = 0; 25745d4f98a2SYan Zheng 25753fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 25763fd0a558SYan, Zheng 25773fd0a558SYan, Zheng while (next) { 25783fd0a558SYan, Zheng cond_resched(); 25795d4f98a2SYan Zheng while (1) { 25803fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 25815d4f98a2SYan Zheng break; 25825d4f98a2SYan Zheng 2583707e8a07SDavid Sterba num_bytes += rc->extent_root->nodesize; 25843fd0a558SYan, Zheng 25853fd0a558SYan, Zheng if (list_empty(&next->upper)) 25863fd0a558SYan, Zheng break; 25873fd0a558SYan, Zheng 25883fd0a558SYan, Zheng edge = list_entry(next->upper.next, 25893fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 25903fd0a558SYan, Zheng edges[index++] = edge; 25913fd0a558SYan, Zheng next = edge->node[UPPER]; 25925d4f98a2SYan Zheng } 25933fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 25943fd0a558SYan, Zheng } 25953fd0a558SYan, Zheng return num_bytes; 25963fd0a558SYan, Zheng } 25973fd0a558SYan, Zheng 25983fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 25993fd0a558SYan, Zheng struct reloc_control *rc, 26003fd0a558SYan, Zheng struct backref_node *node) 26013fd0a558SYan, Zheng { 26023fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 26033fd0a558SYan, Zheng u64 num_bytes; 26043fd0a558SYan, Zheng int ret; 26050647bf56SWang Shilong u64 tmp; 26063fd0a558SYan, Zheng 26073fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 26083fd0a558SYan, Zheng 26093fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 26100647bf56SWang Shilong rc->reserved_bytes += num_bytes; 26118ca17f0fSJosef Bacik 26128ca17f0fSJosef Bacik /* 26138ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 26148ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 26158ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 26168ca17f0fSJosef Bacik */ 26170647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 26188ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 26193fd0a558SYan, Zheng if (ret) { 26208ca17f0fSJosef Bacik tmp = rc->extent_root->nodesize * RELOCATION_RESERVED_NODES; 26210647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 26220647bf56SWang Shilong tmp <<= 1; 26230647bf56SWang Shilong /* 26240647bf56SWang Shilong * only one thread can access block_rsv at this point, 26250647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 26260647bf56SWang Shilong * we expand more reservation size here to allow enough 26278ca17f0fSJosef Bacik * space for relocation and we will return eailer in 26280647bf56SWang Shilong * enospc case. 26290647bf56SWang Shilong */ 26300647bf56SWang Shilong rc->block_rsv->size = tmp + rc->extent_root->nodesize * 26310647bf56SWang Shilong RELOCATION_RESERVED_NODES; 26328ca17f0fSJosef Bacik return -EAGAIN; 26333fd0a558SYan, Zheng } 26343fd0a558SYan, Zheng 26353fd0a558SYan, Zheng return 0; 26363fd0a558SYan, Zheng } 26373fd0a558SYan, Zheng 26385d4f98a2SYan Zheng /* 26395d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 26405d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 26415d4f98a2SYan Zheng * 26425d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 26435d4f98a2SYan Zheng * in that case this function just updates pointers. 26445d4f98a2SYan Zheng */ 26455d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 26463fd0a558SYan, Zheng struct reloc_control *rc, 26475d4f98a2SYan Zheng struct backref_node *node, 26485d4f98a2SYan Zheng struct btrfs_key *key, 26495d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 26505d4f98a2SYan Zheng { 26515d4f98a2SYan Zheng struct backref_node *upper; 26525d4f98a2SYan Zheng struct backref_edge *edge; 26535d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 26545d4f98a2SYan Zheng struct btrfs_root *root; 26555d4f98a2SYan Zheng struct extent_buffer *eb; 26565d4f98a2SYan Zheng u32 blocksize; 26575d4f98a2SYan Zheng u64 bytenr; 26585d4f98a2SYan Zheng u64 generation; 26595d4f98a2SYan Zheng int slot; 26605d4f98a2SYan Zheng int ret; 26615d4f98a2SYan Zheng int err = 0; 26625d4f98a2SYan Zheng 26635d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 26645d4f98a2SYan Zheng 26655d4f98a2SYan Zheng path->lowest_level = node->level + 1; 26663fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 26675d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 26685d4f98a2SYan Zheng cond_resched(); 26695d4f98a2SYan Zheng 26705d4f98a2SYan Zheng upper = edge->node[UPPER]; 2671dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 26723fd0a558SYan, Zheng BUG_ON(!root); 26735d4f98a2SYan Zheng 26743fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 26753fd0a558SYan, Zheng if (!lowest) { 26763fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 26773fd0a558SYan, Zheng upper->level, &slot); 26783fd0a558SYan, Zheng BUG_ON(ret); 26793fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 26803fd0a558SYan, Zheng if (node->eb->start == bytenr) 26813fd0a558SYan, Zheng goto next; 26823fd0a558SYan, Zheng } 26835d4f98a2SYan Zheng drop_node_buffer(upper); 26843fd0a558SYan, Zheng } 26855d4f98a2SYan Zheng 26865d4f98a2SYan Zheng if (!upper->eb) { 26875d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 26885d4f98a2SYan Zheng if (ret < 0) { 26895d4f98a2SYan Zheng err = ret; 26905d4f98a2SYan Zheng break; 26915d4f98a2SYan Zheng } 26925d4f98a2SYan Zheng BUG_ON(ret > 0); 26935d4f98a2SYan Zheng 26943fd0a558SYan, Zheng if (!upper->eb) { 26953fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 26963fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 26973fd0a558SYan, Zheng } else { 26983fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 26993fd0a558SYan, Zheng } 27003fd0a558SYan, Zheng 27013fd0a558SYan, Zheng upper->locked = 1; 27023fd0a558SYan, Zheng path->locks[upper->level] = 0; 27033fd0a558SYan, Zheng 27045d4f98a2SYan Zheng slot = path->slots[upper->level]; 2705b3b4aa74SDavid Sterba btrfs_release_path(path); 27065d4f98a2SYan Zheng } else { 27075d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 27085d4f98a2SYan Zheng &slot); 27095d4f98a2SYan Zheng BUG_ON(ret); 27105d4f98a2SYan Zheng } 27115d4f98a2SYan Zheng 27125d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 27133fd0a558SYan, Zheng if (lowest) { 27143fd0a558SYan, Zheng BUG_ON(bytenr != node->bytenr); 27155d4f98a2SYan Zheng } else { 27163fd0a558SYan, Zheng if (node->eb->start == bytenr) 27173fd0a558SYan, Zheng goto next; 27185d4f98a2SYan Zheng } 27195d4f98a2SYan Zheng 2720707e8a07SDavid Sterba blocksize = root->nodesize; 27215d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 2722ce86cd59SDavid Sterba eb = read_tree_block(root, bytenr, generation); 272364c043deSLiu Bo if (IS_ERR(eb)) { 272464c043deSLiu Bo err = PTR_ERR(eb); 272564c043deSLiu Bo goto next; 272664c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2727416bc658SJosef Bacik free_extent_buffer(eb); 272897d9a8a4STsutomu Itoh err = -EIO; 272997d9a8a4STsutomu Itoh goto next; 273097d9a8a4STsutomu Itoh } 27315d4f98a2SYan Zheng btrfs_tree_lock(eb); 27325d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 27335d4f98a2SYan Zheng 27345d4f98a2SYan Zheng if (!node->eb) { 27355d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 27365d4f98a2SYan Zheng slot, &eb); 27373fd0a558SYan, Zheng btrfs_tree_unlock(eb); 27383fd0a558SYan, Zheng free_extent_buffer(eb); 27395d4f98a2SYan Zheng if (ret < 0) { 27405d4f98a2SYan Zheng err = ret; 27413fd0a558SYan, Zheng goto next; 27425d4f98a2SYan Zheng } 27433fd0a558SYan, Zheng BUG_ON(node->eb != eb); 27445d4f98a2SYan Zheng } else { 27455d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 27465d4f98a2SYan Zheng node->eb->start); 27475d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 27485d4f98a2SYan Zheng trans->transid); 27495d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 27505d4f98a2SYan Zheng 27515d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, root, 27525d4f98a2SYan Zheng node->eb->start, blocksize, 27535d4f98a2SYan Zheng upper->eb->start, 27545d4f98a2SYan Zheng btrfs_header_owner(upper->eb), 2755b06c4bf5SFilipe Manana node->level, 0); 27565d4f98a2SYan Zheng BUG_ON(ret); 27575d4f98a2SYan Zheng 27585d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 27595d4f98a2SYan Zheng BUG_ON(ret); 27605d4f98a2SYan Zheng } 27613fd0a558SYan, Zheng next: 27623fd0a558SYan, Zheng if (!upper->pending) 27633fd0a558SYan, Zheng drop_node_buffer(upper); 27643fd0a558SYan, Zheng else 27653fd0a558SYan, Zheng unlock_node_buffer(upper); 27663fd0a558SYan, Zheng if (err) 27673fd0a558SYan, Zheng break; 27685d4f98a2SYan Zheng } 27693fd0a558SYan, Zheng 27703fd0a558SYan, Zheng if (!err && node->pending) { 27713fd0a558SYan, Zheng drop_node_buffer(node); 27723fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 27733fd0a558SYan, Zheng node->pending = 0; 27745d4f98a2SYan Zheng } 27753fd0a558SYan, Zheng 27765d4f98a2SYan Zheng path->lowest_level = 0; 27773fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 27785d4f98a2SYan Zheng return err; 27795d4f98a2SYan Zheng } 27805d4f98a2SYan Zheng 27815d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 27823fd0a558SYan, Zheng struct reloc_control *rc, 27835d4f98a2SYan Zheng struct backref_node *node, 27845d4f98a2SYan Zheng struct btrfs_path *path) 27855d4f98a2SYan Zheng { 27865d4f98a2SYan Zheng struct btrfs_key key; 27875d4f98a2SYan Zheng 27885d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 27893fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 27905d4f98a2SYan Zheng } 27915d4f98a2SYan Zheng 27925d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 27933fd0a558SYan, Zheng struct reloc_control *rc, 27943fd0a558SYan, Zheng struct btrfs_path *path, int err) 27955d4f98a2SYan Zheng { 27963fd0a558SYan, Zheng LIST_HEAD(list); 27973fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 27985d4f98a2SYan Zheng struct backref_node *node; 27995d4f98a2SYan Zheng int level; 28005d4f98a2SYan Zheng int ret; 28015d4f98a2SYan Zheng 28025d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 28035d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 28045d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 28053fd0a558SYan, Zheng struct backref_node, list); 28063fd0a558SYan, Zheng list_move_tail(&node->list, &list); 28073fd0a558SYan, Zheng BUG_ON(!node->pending); 28085d4f98a2SYan Zheng 28093fd0a558SYan, Zheng if (!err) { 28103fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 28115d4f98a2SYan Zheng if (ret < 0) 28125d4f98a2SYan Zheng err = ret; 28135d4f98a2SYan Zheng } 28145d4f98a2SYan Zheng } 28153fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 28163fd0a558SYan, Zheng } 28175d4f98a2SYan Zheng return err; 28185d4f98a2SYan Zheng } 28195d4f98a2SYan Zheng 28205d4f98a2SYan Zheng static void mark_block_processed(struct reloc_control *rc, 28213fd0a558SYan, Zheng u64 bytenr, u32 blocksize) 28223fd0a558SYan, Zheng { 28233fd0a558SYan, Zheng set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, 2824ceeb0ae7SDavid Sterba EXTENT_DIRTY); 28253fd0a558SYan, Zheng } 28263fd0a558SYan, Zheng 28273fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 28285d4f98a2SYan Zheng struct backref_node *node) 28295d4f98a2SYan Zheng { 28305d4f98a2SYan Zheng u32 blocksize; 28315d4f98a2SYan Zheng if (node->level == 0 || 28325d4f98a2SYan Zheng in_block_group(node->bytenr, rc->block_group)) { 2833707e8a07SDavid Sterba blocksize = rc->extent_root->nodesize; 28343fd0a558SYan, Zheng mark_block_processed(rc, node->bytenr, blocksize); 28355d4f98a2SYan Zheng } 28365d4f98a2SYan Zheng node->processed = 1; 28375d4f98a2SYan Zheng } 28385d4f98a2SYan Zheng 28395d4f98a2SYan Zheng /* 28405d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 28415d4f98a2SYan Zheng * as processed. 28425d4f98a2SYan Zheng */ 28435d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 28445d4f98a2SYan Zheng struct backref_node *node) 28455d4f98a2SYan Zheng { 28465d4f98a2SYan Zheng struct backref_node *next = node; 28475d4f98a2SYan Zheng struct backref_edge *edge; 28485d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28495d4f98a2SYan Zheng int index = 0; 28505d4f98a2SYan Zheng 28515d4f98a2SYan Zheng while (next) { 28525d4f98a2SYan Zheng cond_resched(); 28535d4f98a2SYan Zheng while (1) { 28545d4f98a2SYan Zheng if (next->processed) 28555d4f98a2SYan Zheng break; 28565d4f98a2SYan Zheng 28573fd0a558SYan, Zheng __mark_block_processed(rc, next); 28585d4f98a2SYan Zheng 28595d4f98a2SYan Zheng if (list_empty(&next->upper)) 28605d4f98a2SYan Zheng break; 28615d4f98a2SYan Zheng 28625d4f98a2SYan Zheng edge = list_entry(next->upper.next, 28635d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 28645d4f98a2SYan Zheng edges[index++] = edge; 28655d4f98a2SYan Zheng next = edge->node[UPPER]; 28665d4f98a2SYan Zheng } 28675d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 28685d4f98a2SYan Zheng } 28695d4f98a2SYan Zheng } 28705d4f98a2SYan Zheng 28717476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 28725d4f98a2SYan Zheng { 28737476dfdaSDavid Sterba u32 blocksize = rc->extent_root->nodesize; 28747476dfdaSDavid Sterba 28755d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 28769655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 28775d4f98a2SYan Zheng return 1; 28785d4f98a2SYan Zheng return 0; 28795d4f98a2SYan Zheng } 28805d4f98a2SYan Zheng 28815d4f98a2SYan Zheng static int get_tree_block_key(struct reloc_control *rc, 28825d4f98a2SYan Zheng struct tree_block *block) 28835d4f98a2SYan Zheng { 28845d4f98a2SYan Zheng struct extent_buffer *eb; 28855d4f98a2SYan Zheng 28865d4f98a2SYan Zheng BUG_ON(block->key_ready); 28875d4f98a2SYan Zheng eb = read_tree_block(rc->extent_root, block->bytenr, 2888ce86cd59SDavid Sterba block->key.offset); 288964c043deSLiu Bo if (IS_ERR(eb)) { 289064c043deSLiu Bo return PTR_ERR(eb); 289164c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2892416bc658SJosef Bacik free_extent_buffer(eb); 2893416bc658SJosef Bacik return -EIO; 2894416bc658SJosef Bacik } 28955d4f98a2SYan Zheng WARN_ON(btrfs_header_level(eb) != block->level); 28965d4f98a2SYan Zheng if (block->level == 0) 28975d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 28985d4f98a2SYan Zheng else 28995d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 29005d4f98a2SYan Zheng free_extent_buffer(eb); 29015d4f98a2SYan Zheng block->key_ready = 1; 29025d4f98a2SYan Zheng return 0; 29035d4f98a2SYan Zheng } 29045d4f98a2SYan Zheng 29055d4f98a2SYan Zheng /* 29065d4f98a2SYan Zheng * helper function to relocate a tree block 29075d4f98a2SYan Zheng */ 29085d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 29095d4f98a2SYan Zheng struct reloc_control *rc, 29105d4f98a2SYan Zheng struct backref_node *node, 29115d4f98a2SYan Zheng struct btrfs_key *key, 29125d4f98a2SYan Zheng struct btrfs_path *path) 29135d4f98a2SYan Zheng { 29145d4f98a2SYan Zheng struct btrfs_root *root; 29153fd0a558SYan, Zheng int ret = 0; 29165d4f98a2SYan Zheng 29173fd0a558SYan, Zheng if (!node) 29185d4f98a2SYan Zheng return 0; 29193fd0a558SYan, Zheng 29203fd0a558SYan, Zheng BUG_ON(node->processed); 2921147d256eSZhaolei root = select_one_root(node); 29223fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 29233fd0a558SYan, Zheng update_processed_blocks(rc, node); 29243fd0a558SYan, Zheng goto out; 29255d4f98a2SYan Zheng } 29265d4f98a2SYan Zheng 292727cdeb70SMiao Xie if (!root || test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 29283fd0a558SYan, Zheng ret = reserve_metadata_space(trans, rc, node); 29293fd0a558SYan, Zheng if (ret) 29305d4f98a2SYan Zheng goto out; 29315d4f98a2SYan Zheng } 29323fd0a558SYan, Zheng 29333fd0a558SYan, Zheng if (root) { 293427cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 29353fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 29363fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 29373fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 29383fd0a558SYan, Zheng root = root->reloc_root; 29393fd0a558SYan, Zheng node->new_bytenr = root->node->start; 29403fd0a558SYan, Zheng node->root = root; 29413fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 29423fd0a558SYan, Zheng } else { 29435d4f98a2SYan Zheng path->lowest_level = node->level; 29445d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 2945b3b4aa74SDavid Sterba btrfs_release_path(path); 29463fd0a558SYan, Zheng if (ret > 0) 29475d4f98a2SYan Zheng ret = 0; 29483fd0a558SYan, Zheng } 29493fd0a558SYan, Zheng if (!ret) 29503fd0a558SYan, Zheng update_processed_blocks(rc, node); 29513fd0a558SYan, Zheng } else { 29523fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 29533fd0a558SYan, Zheng } 29545d4f98a2SYan Zheng out: 29550647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 29563fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 29575d4f98a2SYan Zheng return ret; 29585d4f98a2SYan Zheng } 29595d4f98a2SYan Zheng 29605d4f98a2SYan Zheng /* 29615d4f98a2SYan Zheng * relocate a list of blocks 29625d4f98a2SYan Zheng */ 29635d4f98a2SYan Zheng static noinline_for_stack 29645d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 29655d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 29665d4f98a2SYan Zheng { 29675d4f98a2SYan Zheng struct backref_node *node; 29685d4f98a2SYan Zheng struct btrfs_path *path; 29695d4f98a2SYan Zheng struct tree_block *block; 29705d4f98a2SYan Zheng struct rb_node *rb_node; 29715d4f98a2SYan Zheng int ret; 29725d4f98a2SYan Zheng int err = 0; 29735d4f98a2SYan Zheng 29745d4f98a2SYan Zheng path = btrfs_alloc_path(); 2975e1a12670SLiu Bo if (!path) { 2976e1a12670SLiu Bo err = -ENOMEM; 297734c2b290SDavid Sterba goto out_free_blocks; 2978e1a12670SLiu Bo } 29795d4f98a2SYan Zheng 29805d4f98a2SYan Zheng rb_node = rb_first(blocks); 29815d4f98a2SYan Zheng while (rb_node) { 29825d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 29835d4f98a2SYan Zheng if (!block->key_ready) 2984d3e46feaSDavid Sterba readahead_tree_block(rc->extent_root, block->bytenr); 29855d4f98a2SYan Zheng rb_node = rb_next(rb_node); 29865d4f98a2SYan Zheng } 29875d4f98a2SYan Zheng 29885d4f98a2SYan Zheng rb_node = rb_first(blocks); 29895d4f98a2SYan Zheng while (rb_node) { 29905d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 299134c2b290SDavid Sterba if (!block->key_ready) { 299234c2b290SDavid Sterba err = get_tree_block_key(rc, block); 299334c2b290SDavid Sterba if (err) 299434c2b290SDavid Sterba goto out_free_path; 299534c2b290SDavid Sterba } 29965d4f98a2SYan Zheng rb_node = rb_next(rb_node); 29975d4f98a2SYan Zheng } 29985d4f98a2SYan Zheng 29995d4f98a2SYan Zheng rb_node = rb_first(blocks); 30005d4f98a2SYan Zheng while (rb_node) { 30015d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 30025d4f98a2SYan Zheng 30033fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 30045d4f98a2SYan Zheng block->level, block->bytenr); 30055d4f98a2SYan Zheng if (IS_ERR(node)) { 30065d4f98a2SYan Zheng err = PTR_ERR(node); 30075d4f98a2SYan Zheng goto out; 30085d4f98a2SYan Zheng } 30095d4f98a2SYan Zheng 30105d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 30115d4f98a2SYan Zheng path); 30125d4f98a2SYan Zheng if (ret < 0) { 30133fd0a558SYan, Zheng if (ret != -EAGAIN || rb_node == rb_first(blocks)) 30145d4f98a2SYan Zheng err = ret; 30155d4f98a2SYan Zheng goto out; 30165d4f98a2SYan Zheng } 30175d4f98a2SYan Zheng rb_node = rb_next(rb_node); 30185d4f98a2SYan Zheng } 30195d4f98a2SYan Zheng out: 30203fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 30215d4f98a2SYan Zheng 302234c2b290SDavid Sterba out_free_path: 30235d4f98a2SYan Zheng btrfs_free_path(path); 302434c2b290SDavid Sterba out_free_blocks: 3025e1a12670SLiu Bo free_block_list(blocks); 30265d4f98a2SYan Zheng return err; 30275d4f98a2SYan Zheng } 30285d4f98a2SYan Zheng 30295d4f98a2SYan Zheng static noinline_for_stack 3030efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3031efa56464SYan, Zheng struct file_extent_cluster *cluster) 3032efa56464SYan, Zheng { 3033efa56464SYan, Zheng u64 alloc_hint = 0; 3034efa56464SYan, Zheng u64 start; 3035efa56464SYan, Zheng u64 end; 3036efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3037efa56464SYan, Zheng u64 num_bytes; 3038efa56464SYan, Zheng int nr = 0; 3039efa56464SYan, Zheng int ret = 0; 3040efa56464SYan, Zheng 3041efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 30425955102cSAl Viro inode_lock(inode); 3043efa56464SYan, Zheng 30447cf5b976SQu Wenruo ret = btrfs_check_data_free_space(inode, cluster->start, 3045d9d8b2a5SQu Wenruo cluster->end + 1 - cluster->start); 3046efa56464SYan, Zheng if (ret) 3047efa56464SYan, Zheng goto out; 3048efa56464SYan, Zheng 3049efa56464SYan, Zheng while (nr < cluster->nr) { 3050efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3051efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3052efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3053efa56464SYan, Zheng else 3054efa56464SYan, Zheng end = cluster->end - offset; 3055efa56464SYan, Zheng 3056d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3057efa56464SYan, Zheng num_bytes = end + 1 - start; 3058efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3059efa56464SYan, Zheng num_bytes, num_bytes, 3060efa56464SYan, Zheng end + 1, &alloc_hint); 3061d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3062efa56464SYan, Zheng if (ret) 3063efa56464SYan, Zheng break; 3064efa56464SYan, Zheng nr++; 3065efa56464SYan, Zheng } 30667cf5b976SQu Wenruo btrfs_free_reserved_data_space(inode, cluster->start, 3067d9d8b2a5SQu Wenruo cluster->end + 1 - cluster->start); 3068efa56464SYan, Zheng out: 30695955102cSAl Viro inode_unlock(inode); 3070efa56464SYan, Zheng return ret; 3071efa56464SYan, Zheng } 3072efa56464SYan, Zheng 3073efa56464SYan, Zheng static noinline_for_stack 30740257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 30750257bb82SYan, Zheng u64 block_start) 30765d4f98a2SYan Zheng { 30775d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(inode)->root; 30785d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 30795d4f98a2SYan Zheng struct extent_map *em; 30800257bb82SYan, Zheng int ret = 0; 30815d4f98a2SYan Zheng 3082172ddd60SDavid Sterba em = alloc_extent_map(); 30830257bb82SYan, Zheng if (!em) 30840257bb82SYan, Zheng return -ENOMEM; 30850257bb82SYan, Zheng 30865d4f98a2SYan Zheng em->start = start; 30870257bb82SYan, Zheng em->len = end + 1 - start; 30880257bb82SYan, Zheng em->block_len = em->len; 30890257bb82SYan, Zheng em->block_start = block_start; 30905d4f98a2SYan Zheng em->bdev = root->fs_info->fs_devices->latest_bdev; 30915d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 30925d4f98a2SYan Zheng 3093d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 30945d4f98a2SYan Zheng while (1) { 3095890871beSChris Mason write_lock(&em_tree->lock); 309609a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3097890871beSChris Mason write_unlock(&em_tree->lock); 30985d4f98a2SYan Zheng if (ret != -EEXIST) { 30995d4f98a2SYan Zheng free_extent_map(em); 31005d4f98a2SYan Zheng break; 31015d4f98a2SYan Zheng } 31025d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, start, end, 0); 31035d4f98a2SYan Zheng } 3104d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 31050257bb82SYan, Zheng return ret; 31060257bb82SYan, Zheng } 31075d4f98a2SYan Zheng 31080257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 31090257bb82SYan, Zheng struct file_extent_cluster *cluster) 31100257bb82SYan, Zheng { 31110257bb82SYan, Zheng u64 page_start; 31120257bb82SYan, Zheng u64 page_end; 31130257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 31140257bb82SYan, Zheng unsigned long index; 31150257bb82SYan, Zheng unsigned long last_index; 31160257bb82SYan, Zheng struct page *page; 31170257bb82SYan, Zheng struct file_ra_state *ra; 31183b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 31190257bb82SYan, Zheng int nr = 0; 31200257bb82SYan, Zheng int ret = 0; 31210257bb82SYan, Zheng 31220257bb82SYan, Zheng if (!cluster->nr) 31230257bb82SYan, Zheng return 0; 31240257bb82SYan, Zheng 31250257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 31260257bb82SYan, Zheng if (!ra) 31270257bb82SYan, Zheng return -ENOMEM; 31280257bb82SYan, Zheng 3129efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 31300257bb82SYan, Zheng if (ret) 3131efa56464SYan, Zheng goto out; 31320257bb82SYan, Zheng 31330257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 31340257bb82SYan, Zheng 3135efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3136efa56464SYan, Zheng cluster->end - offset, cluster->start); 3137efa56464SYan, Zheng if (ret) 3138efa56464SYan, Zheng goto out; 3139efa56464SYan, Zheng 314009cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 314109cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 31420257bb82SYan, Zheng while (index <= last_index) { 314309cbfeafSKirill A. Shutemov ret = btrfs_delalloc_reserve_metadata(inode, PAGE_SIZE); 3144efa56464SYan, Zheng if (ret) 3145efa56464SYan, Zheng goto out; 3146efa56464SYan, Zheng 31470257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 31480257bb82SYan, Zheng if (!page) { 31490257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 31500257bb82SYan, Zheng ra, NULL, index, 31510257bb82SYan, Zheng last_index + 1 - index); 3152a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 31533b16a4e3SJosef Bacik mask); 31540257bb82SYan, Zheng if (!page) { 3155efa56464SYan, Zheng btrfs_delalloc_release_metadata(inode, 315609cbfeafSKirill A. Shutemov PAGE_SIZE); 31570257bb82SYan, Zheng ret = -ENOMEM; 3158efa56464SYan, Zheng goto out; 31590257bb82SYan, Zheng } 31600257bb82SYan, Zheng } 31610257bb82SYan, Zheng 31620257bb82SYan, Zheng if (PageReadahead(page)) { 31630257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 31640257bb82SYan, Zheng ra, NULL, page, index, 31650257bb82SYan, Zheng last_index + 1 - index); 31660257bb82SYan, Zheng } 31670257bb82SYan, Zheng 31680257bb82SYan, Zheng if (!PageUptodate(page)) { 31690257bb82SYan, Zheng btrfs_readpage(NULL, page); 31700257bb82SYan, Zheng lock_page(page); 31710257bb82SYan, Zheng if (!PageUptodate(page)) { 31720257bb82SYan, Zheng unlock_page(page); 317309cbfeafSKirill A. Shutemov put_page(page); 3174efa56464SYan, Zheng btrfs_delalloc_release_metadata(inode, 317509cbfeafSKirill A. Shutemov PAGE_SIZE); 31760257bb82SYan, Zheng ret = -EIO; 3177efa56464SYan, Zheng goto out; 31780257bb82SYan, Zheng } 31790257bb82SYan, Zheng } 31800257bb82SYan, Zheng 31814eee4fa4SMiao Xie page_start = page_offset(page); 318209cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 31830257bb82SYan, Zheng 3184d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 31850257bb82SYan, Zheng 31860257bb82SYan, Zheng set_page_extent_mapped(page); 31870257bb82SYan, Zheng 31880257bb82SYan, Zheng if (nr < cluster->nr && 31890257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 31900257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 31910257bb82SYan, Zheng page_start, page_end, 3192ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 31930257bb82SYan, Zheng nr++; 31940257bb82SYan, Zheng } 31950257bb82SYan, Zheng 3196efa56464SYan, Zheng btrfs_set_extent_delalloc(inode, page_start, page_end, NULL); 31970257bb82SYan, Zheng set_page_dirty(page); 31980257bb82SYan, Zheng 31990257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3200d0082371SJeff Mahoney page_start, page_end); 32010257bb82SYan, Zheng unlock_page(page); 320209cbfeafSKirill A. Shutemov put_page(page); 32030257bb82SYan, Zheng 32040257bb82SYan, Zheng index++; 3205efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 3206efa56464SYan, Zheng btrfs_throttle(BTRFS_I(inode)->root); 32070257bb82SYan, Zheng } 32080257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3209efa56464SYan, Zheng out: 32100257bb82SYan, Zheng kfree(ra); 32110257bb82SYan, Zheng return ret; 32120257bb82SYan, Zheng } 32130257bb82SYan, Zheng 32140257bb82SYan, Zheng static noinline_for_stack 32150257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 32160257bb82SYan, Zheng struct file_extent_cluster *cluster) 32170257bb82SYan, Zheng { 32180257bb82SYan, Zheng int ret; 32190257bb82SYan, Zheng 32200257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 32210257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 32220257bb82SYan, Zheng if (ret) 32230257bb82SYan, Zheng return ret; 32240257bb82SYan, Zheng cluster->nr = 0; 32250257bb82SYan, Zheng } 32260257bb82SYan, Zheng 32270257bb82SYan, Zheng if (!cluster->nr) 32280257bb82SYan, Zheng cluster->start = extent_key->objectid; 32290257bb82SYan, Zheng else 32300257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 32310257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 32320257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 32330257bb82SYan, Zheng cluster->nr++; 32340257bb82SYan, Zheng 32350257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 32360257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 32370257bb82SYan, Zheng if (ret) 32380257bb82SYan, Zheng return ret; 32390257bb82SYan, Zheng cluster->nr = 0; 32400257bb82SYan, Zheng } 32410257bb82SYan, Zheng return 0; 32425d4f98a2SYan Zheng } 32435d4f98a2SYan Zheng 32445d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 32455d4f98a2SYan Zheng static int get_ref_objectid_v0(struct reloc_control *rc, 32465d4f98a2SYan Zheng struct btrfs_path *path, 32475d4f98a2SYan Zheng struct btrfs_key *extent_key, 32485d4f98a2SYan Zheng u64 *ref_objectid, int *path_change) 32495d4f98a2SYan Zheng { 32505d4f98a2SYan Zheng struct btrfs_key key; 32515d4f98a2SYan Zheng struct extent_buffer *leaf; 32525d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 32535d4f98a2SYan Zheng int ret; 32545d4f98a2SYan Zheng int slot; 32555d4f98a2SYan Zheng 32565d4f98a2SYan Zheng leaf = path->nodes[0]; 32575d4f98a2SYan Zheng slot = path->slots[0]; 32585d4f98a2SYan Zheng while (1) { 32595d4f98a2SYan Zheng if (slot >= btrfs_header_nritems(leaf)) { 32605d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 32615d4f98a2SYan Zheng if (ret < 0) 32625d4f98a2SYan Zheng return ret; 32635d4f98a2SYan Zheng BUG_ON(ret > 0); 32645d4f98a2SYan Zheng leaf = path->nodes[0]; 32655d4f98a2SYan Zheng slot = path->slots[0]; 32665d4f98a2SYan Zheng if (path_change) 32675d4f98a2SYan Zheng *path_change = 1; 32685d4f98a2SYan Zheng } 32695d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, slot); 32705d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 32715d4f98a2SYan Zheng return -ENOENT; 32725d4f98a2SYan Zheng 32735d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_REF_V0_KEY) { 32745d4f98a2SYan Zheng slot++; 32755d4f98a2SYan Zheng continue; 32765d4f98a2SYan Zheng } 32775d4f98a2SYan Zheng ref0 = btrfs_item_ptr(leaf, slot, 32785d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 32795d4f98a2SYan Zheng *ref_objectid = btrfs_ref_objectid_v0(leaf, ref0); 32805d4f98a2SYan Zheng break; 32815d4f98a2SYan Zheng } 32825d4f98a2SYan Zheng return 0; 32835d4f98a2SYan Zheng } 32845d4f98a2SYan Zheng #endif 32855d4f98a2SYan Zheng 32865d4f98a2SYan Zheng /* 32875d4f98a2SYan Zheng * helper to add a tree block to the list. 32885d4f98a2SYan Zheng * the major work is getting the generation and level of the block 32895d4f98a2SYan Zheng */ 32905d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 32915d4f98a2SYan Zheng struct btrfs_key *extent_key, 32925d4f98a2SYan Zheng struct btrfs_path *path, 32935d4f98a2SYan Zheng struct rb_root *blocks) 32945d4f98a2SYan Zheng { 32955d4f98a2SYan Zheng struct extent_buffer *eb; 32965d4f98a2SYan Zheng struct btrfs_extent_item *ei; 32975d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 32985d4f98a2SYan Zheng struct tree_block *block; 32995d4f98a2SYan Zheng struct rb_node *rb_node; 33005d4f98a2SYan Zheng u32 item_size; 33015d4f98a2SYan Zheng int level = -1; 33027fdf4b60SWang Shilong u64 generation; 33035d4f98a2SYan Zheng 33045d4f98a2SYan Zheng eb = path->nodes[0]; 33055d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 33065d4f98a2SYan Zheng 33073173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 33083173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 33095d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 33105d4f98a2SYan Zheng struct btrfs_extent_item); 33113173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 33125d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 33135d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 33145d4f98a2SYan Zheng } else { 33153173a18fSJosef Bacik level = (int)extent_key->offset; 33163173a18fSJosef Bacik } 33173173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 33183173a18fSJosef Bacik } else { 33195d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 33205d4f98a2SYan Zheng u64 ref_owner; 33215d4f98a2SYan Zheng int ret; 33225d4f98a2SYan Zheng 33235d4f98a2SYan Zheng BUG_ON(item_size != sizeof(struct btrfs_extent_item_v0)); 33245d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, extent_key, 33255d4f98a2SYan Zheng &ref_owner, NULL); 3326411fc6bcSAndi Kleen if (ret < 0) 3327411fc6bcSAndi Kleen return ret; 33285d4f98a2SYan Zheng BUG_ON(ref_owner >= BTRFS_MAX_LEVEL); 33295d4f98a2SYan Zheng level = (int)ref_owner; 33305d4f98a2SYan Zheng /* FIXME: get real generation */ 33315d4f98a2SYan Zheng generation = 0; 33325d4f98a2SYan Zheng #else 33335d4f98a2SYan Zheng BUG(); 33345d4f98a2SYan Zheng #endif 33355d4f98a2SYan Zheng } 33365d4f98a2SYan Zheng 3337b3b4aa74SDavid Sterba btrfs_release_path(path); 33385d4f98a2SYan Zheng 33395d4f98a2SYan Zheng BUG_ON(level == -1); 33405d4f98a2SYan Zheng 33415d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 33425d4f98a2SYan Zheng if (!block) 33435d4f98a2SYan Zheng return -ENOMEM; 33445d4f98a2SYan Zheng 33455d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3346707e8a07SDavid Sterba block->key.objectid = rc->extent_root->nodesize; 33475d4f98a2SYan Zheng block->key.offset = generation; 33485d4f98a2SYan Zheng block->level = level; 33495d4f98a2SYan Zheng block->key_ready = 0; 33505d4f98a2SYan Zheng 33515d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 335243c04fb1SJeff Mahoney if (rb_node) 335343c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 33545d4f98a2SYan Zheng 33555d4f98a2SYan Zheng return 0; 33565d4f98a2SYan Zheng } 33575d4f98a2SYan Zheng 33585d4f98a2SYan Zheng /* 33595d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 33605d4f98a2SYan Zheng */ 33615d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 33625d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 33635d4f98a2SYan Zheng struct rb_root *blocks) 33645d4f98a2SYan Zheng { 33655d4f98a2SYan Zheng struct btrfs_path *path; 33665d4f98a2SYan Zheng struct btrfs_key key; 33675d4f98a2SYan Zheng int ret; 3368aee68ee5SJosef Bacik bool skinny = btrfs_fs_incompat(rc->extent_root->fs_info, 3369aee68ee5SJosef Bacik SKINNY_METADATA); 33705d4f98a2SYan Zheng 33717476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 33725d4f98a2SYan Zheng return 0; 33735d4f98a2SYan Zheng 33745d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 33755d4f98a2SYan Zheng return 0; 33765d4f98a2SYan Zheng 33775d4f98a2SYan Zheng path = btrfs_alloc_path(); 33785d4f98a2SYan Zheng if (!path) 33795d4f98a2SYan Zheng return -ENOMEM; 3380aee68ee5SJosef Bacik again: 33815d4f98a2SYan Zheng key.objectid = bytenr; 3382aee68ee5SJosef Bacik if (skinny) { 3383aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3384aee68ee5SJosef Bacik key.offset = (u64)-1; 3385aee68ee5SJosef Bacik } else { 33865d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 33875d4f98a2SYan Zheng key.offset = blocksize; 3388aee68ee5SJosef Bacik } 33895d4f98a2SYan Zheng 33905d4f98a2SYan Zheng path->search_commit_root = 1; 33915d4f98a2SYan Zheng path->skip_locking = 1; 33925d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 33935d4f98a2SYan Zheng if (ret < 0) 33945d4f98a2SYan Zheng goto out; 33955d4f98a2SYan Zheng 3396aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3397aee68ee5SJosef Bacik if (path->slots[0]) { 3398aee68ee5SJosef Bacik path->slots[0]--; 3399aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3400aee68ee5SJosef Bacik path->slots[0]); 34013173a18fSJosef Bacik if (key.objectid == bytenr && 3402aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3403aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3404aee68ee5SJosef Bacik key.offset == blocksize))) 34053173a18fSJosef Bacik ret = 0; 34063173a18fSJosef Bacik } 3407aee68ee5SJosef Bacik 3408aee68ee5SJosef Bacik if (ret) { 3409aee68ee5SJosef Bacik skinny = false; 3410aee68ee5SJosef Bacik btrfs_release_path(path); 3411aee68ee5SJosef Bacik goto again; 3412aee68ee5SJosef Bacik } 3413aee68ee5SJosef Bacik } 34143173a18fSJosef Bacik BUG_ON(ret); 34153173a18fSJosef Bacik 34165d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 34175d4f98a2SYan Zheng out: 34185d4f98a2SYan Zheng btrfs_free_path(path); 34195d4f98a2SYan Zheng return ret; 34205d4f98a2SYan Zheng } 34215d4f98a2SYan Zheng 34225d4f98a2SYan Zheng /* 34235d4f98a2SYan Zheng * helper to check if the block use full backrefs for pointers in it 34245d4f98a2SYan Zheng */ 34255d4f98a2SYan Zheng static int block_use_full_backref(struct reloc_control *rc, 34265d4f98a2SYan Zheng struct extent_buffer *eb) 34275d4f98a2SYan Zheng { 34285d4f98a2SYan Zheng u64 flags; 34295d4f98a2SYan Zheng int ret; 34305d4f98a2SYan Zheng 34315d4f98a2SYan Zheng if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) || 34325d4f98a2SYan Zheng btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV) 34335d4f98a2SYan Zheng return 1; 34345d4f98a2SYan Zheng 34353fd0a558SYan, Zheng ret = btrfs_lookup_extent_info(NULL, rc->extent_root, 34363173a18fSJosef Bacik eb->start, btrfs_header_level(eb), 1, 34373173a18fSJosef Bacik NULL, &flags); 34385d4f98a2SYan Zheng BUG_ON(ret); 34395d4f98a2SYan Zheng 34405d4f98a2SYan Zheng if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) 34415d4f98a2SYan Zheng ret = 1; 34425d4f98a2SYan Zheng else 34435d4f98a2SYan Zheng ret = 0; 34445d4f98a2SYan Zheng return ret; 34455d4f98a2SYan Zheng } 34465d4f98a2SYan Zheng 34470af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 34481bbc621eSChris Mason struct btrfs_block_group_cache *block_group, 34491bbc621eSChris Mason struct inode *inode, 34501bbc621eSChris Mason u64 ino) 34510af3d00bSJosef Bacik { 34520af3d00bSJosef Bacik struct btrfs_key key; 34530af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 34540af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 34550af3d00bSJosef Bacik int ret = 0; 34560af3d00bSJosef Bacik 34570af3d00bSJosef Bacik if (inode) 34580af3d00bSJosef Bacik goto truncate; 34590af3d00bSJosef Bacik 34600af3d00bSJosef Bacik key.objectid = ino; 34610af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 34620af3d00bSJosef Bacik key.offset = 0; 34630af3d00bSJosef Bacik 34640af3d00bSJosef Bacik inode = btrfs_iget(fs_info->sb, &key, root, NULL); 3465f54fb859STsutomu Itoh if (IS_ERR(inode) || is_bad_inode(inode)) { 3466f54fb859STsutomu Itoh if (!IS_ERR(inode)) 34670af3d00bSJosef Bacik iput(inode); 34680af3d00bSJosef Bacik return -ENOENT; 34690af3d00bSJosef Bacik } 34700af3d00bSJosef Bacik 34710af3d00bSJosef Bacik truncate: 34727b61cd92SMiao Xie ret = btrfs_check_trunc_cache_free_space(root, 34737b61cd92SMiao Xie &fs_info->global_block_rsv); 34747b61cd92SMiao Xie if (ret) 34757b61cd92SMiao Xie goto out; 34767b61cd92SMiao Xie 34777a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 34780af3d00bSJosef Bacik if (IS_ERR(trans)) { 34793612b495STsutomu Itoh ret = PTR_ERR(trans); 34800af3d00bSJosef Bacik goto out; 34810af3d00bSJosef Bacik } 34820af3d00bSJosef Bacik 34831bbc621eSChris Mason ret = btrfs_truncate_free_space_cache(root, trans, block_group, inode); 34840af3d00bSJosef Bacik 34850af3d00bSJosef Bacik btrfs_end_transaction(trans, root); 3486b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 34870af3d00bSJosef Bacik out: 34880af3d00bSJosef Bacik iput(inode); 34890af3d00bSJosef Bacik return ret; 34900af3d00bSJosef Bacik } 34910af3d00bSJosef Bacik 34925d4f98a2SYan Zheng /* 34935d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY 34945d4f98a2SYan Zheng * this function scans fs tree to find blocks reference the data extent 34955d4f98a2SYan Zheng */ 34965d4f98a2SYan Zheng static int find_data_references(struct reloc_control *rc, 34975d4f98a2SYan Zheng struct btrfs_key *extent_key, 34985d4f98a2SYan Zheng struct extent_buffer *leaf, 34995d4f98a2SYan Zheng struct btrfs_extent_data_ref *ref, 35005d4f98a2SYan Zheng struct rb_root *blocks) 35015d4f98a2SYan Zheng { 35025d4f98a2SYan Zheng struct btrfs_path *path; 35035d4f98a2SYan Zheng struct tree_block *block; 35045d4f98a2SYan Zheng struct btrfs_root *root; 35055d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 35065d4f98a2SYan Zheng struct rb_node *rb_node; 35075d4f98a2SYan Zheng struct btrfs_key key; 35085d4f98a2SYan Zheng u64 ref_root; 35095d4f98a2SYan Zheng u64 ref_objectid; 35105d4f98a2SYan Zheng u64 ref_offset; 35115d4f98a2SYan Zheng u32 ref_count; 35125d4f98a2SYan Zheng u32 nritems; 35135d4f98a2SYan Zheng int err = 0; 35145d4f98a2SYan Zheng int added = 0; 35155d4f98a2SYan Zheng int counted; 35165d4f98a2SYan Zheng int ret; 35175d4f98a2SYan Zheng 35185d4f98a2SYan Zheng ref_root = btrfs_extent_data_ref_root(leaf, ref); 35195d4f98a2SYan Zheng ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref); 35205d4f98a2SYan Zheng ref_offset = btrfs_extent_data_ref_offset(leaf, ref); 35215d4f98a2SYan Zheng ref_count = btrfs_extent_data_ref_count(leaf, ref); 35225d4f98a2SYan Zheng 35230af3d00bSJosef Bacik /* 35240af3d00bSJosef Bacik * This is an extent belonging to the free space cache, lets just delete 35250af3d00bSJosef Bacik * it and redo the search. 35260af3d00bSJosef Bacik */ 35270af3d00bSJosef Bacik if (ref_root == BTRFS_ROOT_TREE_OBJECTID) { 35280af3d00bSJosef Bacik ret = delete_block_group_cache(rc->extent_root->fs_info, 35291bbc621eSChris Mason rc->block_group, 35300af3d00bSJosef Bacik NULL, ref_objectid); 35310af3d00bSJosef Bacik if (ret != -ENOENT) 35320af3d00bSJosef Bacik return ret; 35330af3d00bSJosef Bacik ret = 0; 35340af3d00bSJosef Bacik } 35350af3d00bSJosef Bacik 35360af3d00bSJosef Bacik path = btrfs_alloc_path(); 35370af3d00bSJosef Bacik if (!path) 35380af3d00bSJosef Bacik return -ENOMEM; 3539e4058b54SDavid Sterba path->reada = READA_FORWARD; 35400af3d00bSJosef Bacik 35415d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, ref_root); 35425d4f98a2SYan Zheng if (IS_ERR(root)) { 35435d4f98a2SYan Zheng err = PTR_ERR(root); 35445d4f98a2SYan Zheng goto out; 35455d4f98a2SYan Zheng } 35465d4f98a2SYan Zheng 35475d4f98a2SYan Zheng key.objectid = ref_objectid; 35485d4f98a2SYan Zheng key.type = BTRFS_EXTENT_DATA_KEY; 354984850e8dSYan, Zheng if (ref_offset > ((u64)-1 << 32)) 355084850e8dSYan, Zheng key.offset = 0; 355184850e8dSYan, Zheng else 355284850e8dSYan, Zheng key.offset = ref_offset; 35535d4f98a2SYan Zheng 35545d4f98a2SYan Zheng path->search_commit_root = 1; 35555d4f98a2SYan Zheng path->skip_locking = 1; 35565d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 35575d4f98a2SYan Zheng if (ret < 0) { 35585d4f98a2SYan Zheng err = ret; 35595d4f98a2SYan Zheng goto out; 35605d4f98a2SYan Zheng } 35615d4f98a2SYan Zheng 35625d4f98a2SYan Zheng leaf = path->nodes[0]; 35635d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 35645d4f98a2SYan Zheng /* 35655d4f98a2SYan Zheng * the references in tree blocks that use full backrefs 35665d4f98a2SYan Zheng * are not counted in 35675d4f98a2SYan Zheng */ 35685d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 35695d4f98a2SYan Zheng counted = 0; 35705d4f98a2SYan Zheng else 35715d4f98a2SYan Zheng counted = 1; 35725d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 35735d4f98a2SYan Zheng if (rb_node) { 35745d4f98a2SYan Zheng if (counted) 35755d4f98a2SYan Zheng added = 1; 35765d4f98a2SYan Zheng else 35775d4f98a2SYan Zheng path->slots[0] = nritems; 35785d4f98a2SYan Zheng } 35795d4f98a2SYan Zheng 35805d4f98a2SYan Zheng while (ref_count > 0) { 35815d4f98a2SYan Zheng while (path->slots[0] >= nritems) { 35825d4f98a2SYan Zheng ret = btrfs_next_leaf(root, path); 35835d4f98a2SYan Zheng if (ret < 0) { 35845d4f98a2SYan Zheng err = ret; 35855d4f98a2SYan Zheng goto out; 35865d4f98a2SYan Zheng } 3587fae7f21cSDulshani Gunawardhana if (WARN_ON(ret > 0)) 35885d4f98a2SYan Zheng goto out; 35895d4f98a2SYan Zheng 35905d4f98a2SYan Zheng leaf = path->nodes[0]; 35915d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 35925d4f98a2SYan Zheng added = 0; 35935d4f98a2SYan Zheng 35945d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 35955d4f98a2SYan Zheng counted = 0; 35965d4f98a2SYan Zheng else 35975d4f98a2SYan Zheng counted = 1; 35985d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 35995d4f98a2SYan Zheng if (rb_node) { 36005d4f98a2SYan Zheng if (counted) 36015d4f98a2SYan Zheng added = 1; 36025d4f98a2SYan Zheng else 36035d4f98a2SYan Zheng path->slots[0] = nritems; 36045d4f98a2SYan Zheng } 36055d4f98a2SYan Zheng } 36065d4f98a2SYan Zheng 36075d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 3608fae7f21cSDulshani Gunawardhana if (WARN_ON(key.objectid != ref_objectid || 3609fae7f21cSDulshani Gunawardhana key.type != BTRFS_EXTENT_DATA_KEY)) 36105d4f98a2SYan Zheng break; 36115d4f98a2SYan Zheng 36125d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 36135d4f98a2SYan Zheng struct btrfs_file_extent_item); 36145d4f98a2SYan Zheng 36155d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 36165d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 36175d4f98a2SYan Zheng goto next; 36185d4f98a2SYan Zheng 36195d4f98a2SYan Zheng if (btrfs_file_extent_disk_bytenr(leaf, fi) != 36205d4f98a2SYan Zheng extent_key->objectid) 36215d4f98a2SYan Zheng goto next; 36225d4f98a2SYan Zheng 36235d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 36245d4f98a2SYan Zheng if (key.offset != ref_offset) 36255d4f98a2SYan Zheng goto next; 36265d4f98a2SYan Zheng 36275d4f98a2SYan Zheng if (counted) 36285d4f98a2SYan Zheng ref_count--; 36295d4f98a2SYan Zheng if (added) 36305d4f98a2SYan Zheng goto next; 36315d4f98a2SYan Zheng 36327476dfdaSDavid Sterba if (!tree_block_processed(leaf->start, rc)) { 36335d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 36345d4f98a2SYan Zheng if (!block) { 36355d4f98a2SYan Zheng err = -ENOMEM; 36365d4f98a2SYan Zheng break; 36375d4f98a2SYan Zheng } 36385d4f98a2SYan Zheng block->bytenr = leaf->start; 36395d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &block->key, 0); 36405d4f98a2SYan Zheng block->level = 0; 36415d4f98a2SYan Zheng block->key_ready = 1; 36425d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, 36435d4f98a2SYan Zheng &block->rb_node); 364443c04fb1SJeff Mahoney if (rb_node) 364543c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 364643c04fb1SJeff Mahoney block->bytenr); 36475d4f98a2SYan Zheng } 36485d4f98a2SYan Zheng if (counted) 36495d4f98a2SYan Zheng added = 1; 36505d4f98a2SYan Zheng else 36515d4f98a2SYan Zheng path->slots[0] = nritems; 36525d4f98a2SYan Zheng next: 36535d4f98a2SYan Zheng path->slots[0]++; 36545d4f98a2SYan Zheng 36555d4f98a2SYan Zheng } 36565d4f98a2SYan Zheng out: 36575d4f98a2SYan Zheng btrfs_free_path(path); 36585d4f98a2SYan Zheng return err; 36595d4f98a2SYan Zheng } 36605d4f98a2SYan Zheng 36615d4f98a2SYan Zheng /* 36622c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 36635d4f98a2SYan Zheng */ 36645d4f98a2SYan Zheng static noinline_for_stack 36655d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 36665d4f98a2SYan Zheng struct btrfs_key *extent_key, 36675d4f98a2SYan Zheng struct btrfs_path *path, 36685d4f98a2SYan Zheng struct rb_root *blocks) 36695d4f98a2SYan Zheng { 36705d4f98a2SYan Zheng struct btrfs_key key; 36715d4f98a2SYan Zheng struct extent_buffer *eb; 36725d4f98a2SYan Zheng struct btrfs_extent_data_ref *dref; 36735d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 36745d4f98a2SYan Zheng unsigned long ptr; 36755d4f98a2SYan Zheng unsigned long end; 3676707e8a07SDavid Sterba u32 blocksize = rc->extent_root->nodesize; 3677647f63bdSFilipe David Borba Manana int ret = 0; 36785d4f98a2SYan Zheng int err = 0; 36795d4f98a2SYan Zheng 36805d4f98a2SYan Zheng eb = path->nodes[0]; 36815d4f98a2SYan Zheng ptr = btrfs_item_ptr_offset(eb, path->slots[0]); 36825d4f98a2SYan Zheng end = ptr + btrfs_item_size_nr(eb, path->slots[0]); 36835d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 36845d4f98a2SYan Zheng if (ptr + sizeof(struct btrfs_extent_item_v0) == end) 36855d4f98a2SYan Zheng ptr = end; 36865d4f98a2SYan Zheng else 36875d4f98a2SYan Zheng #endif 36885d4f98a2SYan Zheng ptr += sizeof(struct btrfs_extent_item); 36895d4f98a2SYan Zheng 36905d4f98a2SYan Zheng while (ptr < end) { 36915d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 36925d4f98a2SYan Zheng key.type = btrfs_extent_inline_ref_type(eb, iref); 36935d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 36945d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 36955d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 36965d4f98a2SYan Zheng blocks); 36975d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 36985d4f98a2SYan Zheng dref = (struct btrfs_extent_data_ref *)(&iref->offset); 36995d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 37005d4f98a2SYan Zheng eb, dref, blocks); 37015d4f98a2SYan Zheng } else { 37025d4f98a2SYan Zheng BUG(); 37035d4f98a2SYan Zheng } 3704647f63bdSFilipe David Borba Manana if (ret) { 3705647f63bdSFilipe David Borba Manana err = ret; 3706647f63bdSFilipe David Borba Manana goto out; 3707647f63bdSFilipe David Borba Manana } 37085d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 37095d4f98a2SYan Zheng } 37105d4f98a2SYan Zheng WARN_ON(ptr > end); 37115d4f98a2SYan Zheng 37125d4f98a2SYan Zheng while (1) { 37135d4f98a2SYan Zheng cond_resched(); 37145d4f98a2SYan Zheng eb = path->nodes[0]; 37155d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(eb)) { 37165d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 37175d4f98a2SYan Zheng if (ret < 0) { 37185d4f98a2SYan Zheng err = ret; 37195d4f98a2SYan Zheng break; 37205d4f98a2SYan Zheng } 37215d4f98a2SYan Zheng if (ret > 0) 37225d4f98a2SYan Zheng break; 37235d4f98a2SYan Zheng eb = path->nodes[0]; 37245d4f98a2SYan Zheng } 37255d4f98a2SYan Zheng 37265d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path->slots[0]); 37275d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 37285d4f98a2SYan Zheng break; 37295d4f98a2SYan Zheng 37305d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 37315d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY || 37325d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 37335d4f98a2SYan Zheng #else 37345d4f98a2SYan Zheng BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY); 37355d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 37365d4f98a2SYan Zheng #endif 37375d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 37385d4f98a2SYan Zheng blocks); 37395d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 37405d4f98a2SYan Zheng dref = btrfs_item_ptr(eb, path->slots[0], 37415d4f98a2SYan Zheng struct btrfs_extent_data_ref); 37425d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 37435d4f98a2SYan Zheng eb, dref, blocks); 37445d4f98a2SYan Zheng } else { 37455d4f98a2SYan Zheng ret = 0; 37465d4f98a2SYan Zheng } 37475d4f98a2SYan Zheng if (ret) { 37485d4f98a2SYan Zheng err = ret; 37495d4f98a2SYan Zheng break; 37505d4f98a2SYan Zheng } 37515d4f98a2SYan Zheng path->slots[0]++; 37525d4f98a2SYan Zheng } 3753647f63bdSFilipe David Borba Manana out: 3754b3b4aa74SDavid Sterba btrfs_release_path(path); 37555d4f98a2SYan Zheng if (err) 37565d4f98a2SYan Zheng free_block_list(blocks); 37575d4f98a2SYan Zheng return err; 37585d4f98a2SYan Zheng } 37595d4f98a2SYan Zheng 37605d4f98a2SYan Zheng /* 37612c016dc2SLiu Bo * helper to find next unprocessed extent 37625d4f98a2SYan Zheng */ 37635d4f98a2SYan Zheng static noinline_for_stack 3764147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 37653fd0a558SYan, Zheng struct btrfs_key *extent_key) 37665d4f98a2SYan Zheng { 37675d4f98a2SYan Zheng struct btrfs_key key; 37685d4f98a2SYan Zheng struct extent_buffer *leaf; 37695d4f98a2SYan Zheng u64 start, end, last; 37705d4f98a2SYan Zheng int ret; 37715d4f98a2SYan Zheng 37725d4f98a2SYan Zheng last = rc->block_group->key.objectid + rc->block_group->key.offset; 37735d4f98a2SYan Zheng while (1) { 37745d4f98a2SYan Zheng cond_resched(); 37755d4f98a2SYan Zheng if (rc->search_start >= last) { 37765d4f98a2SYan Zheng ret = 1; 37775d4f98a2SYan Zheng break; 37785d4f98a2SYan Zheng } 37795d4f98a2SYan Zheng 37805d4f98a2SYan Zheng key.objectid = rc->search_start; 37815d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 37825d4f98a2SYan Zheng key.offset = 0; 37835d4f98a2SYan Zheng 37845d4f98a2SYan Zheng path->search_commit_root = 1; 37855d4f98a2SYan Zheng path->skip_locking = 1; 37865d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 37875d4f98a2SYan Zheng 0, 0); 37885d4f98a2SYan Zheng if (ret < 0) 37895d4f98a2SYan Zheng break; 37905d4f98a2SYan Zheng next: 37915d4f98a2SYan Zheng leaf = path->nodes[0]; 37925d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 37935d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 37945d4f98a2SYan Zheng if (ret != 0) 37955d4f98a2SYan Zheng break; 37965d4f98a2SYan Zheng leaf = path->nodes[0]; 37975d4f98a2SYan Zheng } 37985d4f98a2SYan Zheng 37995d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 38005d4f98a2SYan Zheng if (key.objectid >= last) { 38015d4f98a2SYan Zheng ret = 1; 38025d4f98a2SYan Zheng break; 38035d4f98a2SYan Zheng } 38045d4f98a2SYan Zheng 38053173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 38063173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 38073173a18fSJosef Bacik path->slots[0]++; 38083173a18fSJosef Bacik goto next; 38093173a18fSJosef Bacik } 38103173a18fSJosef Bacik 38113173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 38125d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 38135d4f98a2SYan Zheng path->slots[0]++; 38145d4f98a2SYan Zheng goto next; 38155d4f98a2SYan Zheng } 38165d4f98a2SYan Zheng 38173173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 3818707e8a07SDavid Sterba key.objectid + rc->extent_root->nodesize <= 38193173a18fSJosef Bacik rc->search_start) { 38203173a18fSJosef Bacik path->slots[0]++; 38213173a18fSJosef Bacik goto next; 38223173a18fSJosef Bacik } 38233173a18fSJosef Bacik 38245d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 38255d4f98a2SYan Zheng key.objectid, &start, &end, 3826e6138876SJosef Bacik EXTENT_DIRTY, NULL); 38275d4f98a2SYan Zheng 38285d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3829b3b4aa74SDavid Sterba btrfs_release_path(path); 38305d4f98a2SYan Zheng rc->search_start = end + 1; 38315d4f98a2SYan Zheng } else { 38323173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 38335d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 38343173a18fSJosef Bacik else 38353173a18fSJosef Bacik rc->search_start = key.objectid + 3836707e8a07SDavid Sterba rc->extent_root->nodesize; 38373fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 38385d4f98a2SYan Zheng return 0; 38395d4f98a2SYan Zheng } 38405d4f98a2SYan Zheng } 3841b3b4aa74SDavid Sterba btrfs_release_path(path); 38425d4f98a2SYan Zheng return ret; 38435d4f98a2SYan Zheng } 38445d4f98a2SYan Zheng 38455d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 38465d4f98a2SYan Zheng { 38475d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38487585717fSChris Mason 38497585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 38505d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 38517585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 38525d4f98a2SYan Zheng } 38535d4f98a2SYan Zheng 38545d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 38555d4f98a2SYan Zheng { 38565d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38577585717fSChris Mason 38587585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 38595d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 38607585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 38615d4f98a2SYan Zheng } 38625d4f98a2SYan Zheng 38635d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 38645d4f98a2SYan Zheng { 38655d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 38665d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 38675d4f98a2SYan Zheng return 1; 38685d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 38695d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 38705d4f98a2SYan Zheng return 1; 38715d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 38725d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 38735d4f98a2SYan Zheng return 1; 38745d4f98a2SYan Zheng return 0; 38755d4f98a2SYan Zheng } 38765d4f98a2SYan Zheng 38773fd0a558SYan, Zheng static noinline_for_stack 38783fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 38793fd0a558SYan, Zheng { 38803fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3881ac2fabacSJosef Bacik int ret; 38823fd0a558SYan, Zheng 388366d8f3ddSMiao Xie rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root, 388466d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 38853fd0a558SYan, Zheng if (!rc->block_rsv) 38863fd0a558SYan, Zheng return -ENOMEM; 38873fd0a558SYan, Zheng 38883fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 38893fd0a558SYan, Zheng rc->search_start = rc->block_group->key.objectid; 38903fd0a558SYan, Zheng rc->extents_found = 0; 38913fd0a558SYan, Zheng rc->nodes_relocated = 0; 38923fd0a558SYan, Zheng rc->merging_rsv_size = 0; 38930647bf56SWang Shilong rc->reserved_bytes = 0; 38940647bf56SWang Shilong rc->block_rsv->size = rc->extent_root->nodesize * 38950647bf56SWang Shilong RELOCATION_RESERVED_NODES; 3896ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 3897ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3898ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3899ac2fabacSJosef Bacik if (ret) 3900ac2fabacSJosef Bacik return ret; 39013fd0a558SYan, Zheng 39023fd0a558SYan, Zheng rc->create_reloc_tree = 1; 39033fd0a558SYan, Zheng set_reloc_control(rc); 39043fd0a558SYan, Zheng 39057a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 390628818947SLiu Bo if (IS_ERR(trans)) { 390728818947SLiu Bo unset_reloc_control(rc); 390828818947SLiu Bo /* 390928818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 391028818947SLiu Bo * cleanup. And callers are responsible to free the above 391128818947SLiu Bo * block rsv. 391228818947SLiu Bo */ 391328818947SLiu Bo return PTR_ERR(trans); 391428818947SLiu Bo } 39153fd0a558SYan, Zheng btrfs_commit_transaction(trans, rc->extent_root); 39163fd0a558SYan, Zheng return 0; 39173fd0a558SYan, Zheng } 391876dda93cSYan, Zheng 39195d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 39205d4f98a2SYan Zheng { 39215d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 39225d4f98a2SYan Zheng struct btrfs_key key; 39235d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 39245d4f98a2SYan Zheng struct btrfs_path *path; 39255d4f98a2SYan Zheng struct btrfs_extent_item *ei; 39265d4f98a2SYan Zheng u64 flags; 39275d4f98a2SYan Zheng u32 item_size; 39285d4f98a2SYan Zheng int ret; 39295d4f98a2SYan Zheng int err = 0; 3930c87f08caSChris Mason int progress = 0; 39315d4f98a2SYan Zheng 39325d4f98a2SYan Zheng path = btrfs_alloc_path(); 39333fd0a558SYan, Zheng if (!path) 39345d4f98a2SYan Zheng return -ENOMEM; 3935e4058b54SDavid Sterba path->reada = READA_FORWARD; 39363fd0a558SYan, Zheng 39373fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 39383fd0a558SYan, Zheng if (ret) { 39393fd0a558SYan, Zheng err = ret; 39403fd0a558SYan, Zheng goto out_free; 39412423fdfbSJiri Slaby } 39425d4f98a2SYan Zheng 39435d4f98a2SYan Zheng while (1) { 39440647bf56SWang Shilong rc->reserved_bytes = 0; 39450647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 39460647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 39470647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 39480647bf56SWang Shilong if (ret) { 39490647bf56SWang Shilong err = ret; 39500647bf56SWang Shilong break; 39510647bf56SWang Shilong } 3952c87f08caSChris Mason progress++; 3953a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 39540f788c58SLiu Bo if (IS_ERR(trans)) { 39550f788c58SLiu Bo err = PTR_ERR(trans); 39560f788c58SLiu Bo trans = NULL; 39570f788c58SLiu Bo break; 39580f788c58SLiu Bo } 3959c87f08caSChris Mason restart: 39603fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 39613fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 39623fd0a558SYan, Zheng continue; 39633fd0a558SYan, Zheng } 39643fd0a558SYan, Zheng 3965147d256eSZhaolei ret = find_next_extent(rc, path, &key); 39665d4f98a2SYan Zheng if (ret < 0) 39675d4f98a2SYan Zheng err = ret; 39685d4f98a2SYan Zheng if (ret != 0) 39695d4f98a2SYan Zheng break; 39705d4f98a2SYan Zheng 39715d4f98a2SYan Zheng rc->extents_found++; 39725d4f98a2SYan Zheng 39735d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 39745d4f98a2SYan Zheng struct btrfs_extent_item); 39753fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 39765d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 39775d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 39785d4f98a2SYan Zheng ret = check_extent_flags(flags); 39795d4f98a2SYan Zheng BUG_ON(ret); 39805d4f98a2SYan Zheng 39815d4f98a2SYan Zheng } else { 39825d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 39835d4f98a2SYan Zheng u64 ref_owner; 39845d4f98a2SYan Zheng int path_change = 0; 39855d4f98a2SYan Zheng 39865d4f98a2SYan Zheng BUG_ON(item_size != 39875d4f98a2SYan Zheng sizeof(struct btrfs_extent_item_v0)); 39885d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, &key, &ref_owner, 39895d4f98a2SYan Zheng &path_change); 39904b3576e4SZhaolei if (ret < 0) { 39914b3576e4SZhaolei err = ret; 39924b3576e4SZhaolei break; 39934b3576e4SZhaolei } 39945d4f98a2SYan Zheng if (ref_owner < BTRFS_FIRST_FREE_OBJECTID) 39955d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_TREE_BLOCK; 39965d4f98a2SYan Zheng else 39975d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_DATA; 39985d4f98a2SYan Zheng 39995d4f98a2SYan Zheng if (path_change) { 4000b3b4aa74SDavid Sterba btrfs_release_path(path); 40015d4f98a2SYan Zheng 40025d4f98a2SYan Zheng path->search_commit_root = 1; 40035d4f98a2SYan Zheng path->skip_locking = 1; 40045d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, 40055d4f98a2SYan Zheng &key, path, 0, 0); 40065d4f98a2SYan Zheng if (ret < 0) { 40075d4f98a2SYan Zheng err = ret; 40085d4f98a2SYan Zheng break; 40095d4f98a2SYan Zheng } 40105d4f98a2SYan Zheng BUG_ON(ret > 0); 40115d4f98a2SYan Zheng } 40125d4f98a2SYan Zheng #else 40135d4f98a2SYan Zheng BUG(); 40145d4f98a2SYan Zheng #endif 40155d4f98a2SYan Zheng } 40165d4f98a2SYan Zheng 40175d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 40185d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 40195d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 40205d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40215d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 40225d4f98a2SYan Zheng } else { 4023b3b4aa74SDavid Sterba btrfs_release_path(path); 40245d4f98a2SYan Zheng ret = 0; 40255d4f98a2SYan Zheng } 40265d4f98a2SYan Zheng if (ret < 0) { 40273fd0a558SYan, Zheng err = ret; 40285d4f98a2SYan Zheng break; 40295d4f98a2SYan Zheng } 40305d4f98a2SYan Zheng 40315d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 40325d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 40335d4f98a2SYan Zheng if (ret < 0) { 40341708cc57SWang Shilong /* 40351708cc57SWang Shilong * if we fail to relocate tree blocks, force to update 40361708cc57SWang Shilong * backref cache when committing transaction. 40371708cc57SWang Shilong */ 40381708cc57SWang Shilong rc->backref_cache.last_trans = trans->transid - 1; 40391708cc57SWang Shilong 40403fd0a558SYan, Zheng if (ret != -EAGAIN) { 40415d4f98a2SYan Zheng err = ret; 40425d4f98a2SYan Zheng break; 40435d4f98a2SYan Zheng } 40443fd0a558SYan, Zheng rc->extents_found--; 40453fd0a558SYan, Zheng rc->search_start = key.objectid; 40463fd0a558SYan, Zheng } 40475d4f98a2SYan Zheng } 40485d4f98a2SYan Zheng 40493fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, rc->extent_root); 4050b53d3f5dSLiu Bo btrfs_btree_balance_dirty(rc->extent_root); 40513fd0a558SYan, Zheng trans = NULL; 40525d4f98a2SYan Zheng 40535d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 40545d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40555d4f98a2SYan Zheng rc->found_file_extent = 1; 40560257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 40573fd0a558SYan, Zheng &key, &rc->cluster); 40585d4f98a2SYan Zheng if (ret < 0) { 40595d4f98a2SYan Zheng err = ret; 40605d4f98a2SYan Zheng break; 40615d4f98a2SYan Zheng } 40625d4f98a2SYan Zheng } 40635d4f98a2SYan Zheng } 4064c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 4065c87f08caSChris Mason ret = btrfs_force_chunk_alloc(trans, rc->extent_root, 4066c87f08caSChris Mason rc->block_group->flags); 40679689457bSShilong Wang if (ret == 1) { 4068c87f08caSChris Mason err = 0; 4069c87f08caSChris Mason progress = 0; 4070c87f08caSChris Mason goto restart; 4071c87f08caSChris Mason } 4072c87f08caSChris Mason } 40733fd0a558SYan, Zheng 4074b3b4aa74SDavid Sterba btrfs_release_path(path); 407591166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 40765d4f98a2SYan Zheng 40775d4f98a2SYan Zheng if (trans) { 40783fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, rc->extent_root); 4079b53d3f5dSLiu Bo btrfs_btree_balance_dirty(rc->extent_root); 40805d4f98a2SYan Zheng } 40815d4f98a2SYan Zheng 40820257bb82SYan, Zheng if (!err) { 40833fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 40843fd0a558SYan, Zheng &rc->cluster); 40850257bb82SYan, Zheng if (ret < 0) 40860257bb82SYan, Zheng err = ret; 40870257bb82SYan, Zheng } 40880257bb82SYan, Zheng 40893fd0a558SYan, Zheng rc->create_reloc_tree = 0; 40903fd0a558SYan, Zheng set_reloc_control(rc); 40910257bb82SYan, Zheng 40923fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 40933fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1); 40945d4f98a2SYan Zheng 40953fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 40965d4f98a2SYan Zheng 40975d4f98a2SYan Zheng merge_reloc_roots(rc); 40985d4f98a2SYan Zheng 40993fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 41005d4f98a2SYan Zheng unset_reloc_control(rc); 41013fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1); 41025d4f98a2SYan Zheng 41035d4f98a2SYan Zheng /* get rid of pinned extents */ 41047a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 41053612b495STsutomu Itoh if (IS_ERR(trans)) 41063612b495STsutomu Itoh err = PTR_ERR(trans); 41073612b495STsutomu Itoh else 41085d4f98a2SYan Zheng btrfs_commit_transaction(trans, rc->extent_root); 41093fd0a558SYan, Zheng out_free: 41103fd0a558SYan, Zheng btrfs_free_block_rsv(rc->extent_root, rc->block_rsv); 41113fd0a558SYan, Zheng btrfs_free_path(path); 41125d4f98a2SYan Zheng return err; 41135d4f98a2SYan Zheng } 41145d4f98a2SYan Zheng 41155d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 41160257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 41175d4f98a2SYan Zheng { 41185d4f98a2SYan Zheng struct btrfs_path *path; 41195d4f98a2SYan Zheng struct btrfs_inode_item *item; 41205d4f98a2SYan Zheng struct extent_buffer *leaf; 41215d4f98a2SYan Zheng int ret; 41225d4f98a2SYan Zheng 41235d4f98a2SYan Zheng path = btrfs_alloc_path(); 41245d4f98a2SYan Zheng if (!path) 41255d4f98a2SYan Zheng return -ENOMEM; 41265d4f98a2SYan Zheng 41275d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 41285d4f98a2SYan Zheng if (ret) 41295d4f98a2SYan Zheng goto out; 41305d4f98a2SYan Zheng 41315d4f98a2SYan Zheng leaf = path->nodes[0]; 41325d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 41335d4f98a2SYan Zheng memset_extent_buffer(leaf, 0, (unsigned long)item, sizeof(*item)); 41345d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 41350257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 41365d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 41373fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 41383fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 41395d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 41405d4f98a2SYan Zheng out: 41415d4f98a2SYan Zheng btrfs_free_path(path); 41425d4f98a2SYan Zheng return ret; 41435d4f98a2SYan Zheng } 41445d4f98a2SYan Zheng 41455d4f98a2SYan Zheng /* 41465d4f98a2SYan Zheng * helper to create inode for data relocation. 41475d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 41485d4f98a2SYan Zheng */ 41493fd0a558SYan, Zheng static noinline_for_stack 41503fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 41515d4f98a2SYan Zheng struct btrfs_block_group_cache *group) 41525d4f98a2SYan Zheng { 41535d4f98a2SYan Zheng struct inode *inode = NULL; 41545d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 41555d4f98a2SYan Zheng struct btrfs_root *root; 41565d4f98a2SYan Zheng struct btrfs_key key; 41574624900dSZhaolei u64 objectid; 41585d4f98a2SYan Zheng int err = 0; 41595d4f98a2SYan Zheng 41605d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 41615d4f98a2SYan Zheng if (IS_ERR(root)) 41625d4f98a2SYan Zheng return ERR_CAST(root); 41635d4f98a2SYan Zheng 4164a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 41653fd0a558SYan, Zheng if (IS_ERR(trans)) 41663fd0a558SYan, Zheng return ERR_CAST(trans); 41675d4f98a2SYan Zheng 4168581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 41695d4f98a2SYan Zheng if (err) 41705d4f98a2SYan Zheng goto out; 41715d4f98a2SYan Zheng 41720257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 41735d4f98a2SYan Zheng BUG_ON(err); 41745d4f98a2SYan Zheng 41755d4f98a2SYan Zheng key.objectid = objectid; 41765d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 41775d4f98a2SYan Zheng key.offset = 0; 417873f73415SJosef Bacik inode = btrfs_iget(root->fs_info->sb, &key, root, NULL); 41795d4f98a2SYan Zheng BUG_ON(IS_ERR(inode) || is_bad_inode(inode)); 41805d4f98a2SYan Zheng BTRFS_I(inode)->index_cnt = group->key.objectid; 41815d4f98a2SYan Zheng 41825d4f98a2SYan Zheng err = btrfs_orphan_add(trans, inode); 41835d4f98a2SYan Zheng out: 41845d4f98a2SYan Zheng btrfs_end_transaction(trans, root); 4185b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 41865d4f98a2SYan Zheng if (err) { 41875d4f98a2SYan Zheng if (inode) 41885d4f98a2SYan Zheng iput(inode); 41895d4f98a2SYan Zheng inode = ERR_PTR(err); 41905d4f98a2SYan Zheng } 41915d4f98a2SYan Zheng return inode; 41925d4f98a2SYan Zheng } 41935d4f98a2SYan Zheng 4194a9995eecSJosef Bacik static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 41953fd0a558SYan, Zheng { 41963fd0a558SYan, Zheng struct reloc_control *rc; 41973fd0a558SYan, Zheng 41983fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 41993fd0a558SYan, Zheng if (!rc) 42003fd0a558SYan, Zheng return NULL; 42013fd0a558SYan, Zheng 42023fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 42033fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 42043fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 4205a9995eecSJosef Bacik extent_io_tree_init(&rc->processed_blocks, 4206a9995eecSJosef Bacik fs_info->btree_inode->i_mapping); 42073fd0a558SYan, Zheng return rc; 42083fd0a558SYan, Zheng } 42093fd0a558SYan, Zheng 42105d4f98a2SYan Zheng /* 42115d4f98a2SYan Zheng * function to relocate all extents in a block group. 42125d4f98a2SYan Zheng */ 42135d4f98a2SYan Zheng int btrfs_relocate_block_group(struct btrfs_root *extent_root, u64 group_start) 42145d4f98a2SYan Zheng { 42155d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = extent_root->fs_info; 42165d4f98a2SYan Zheng struct reloc_control *rc; 42170af3d00bSJosef Bacik struct inode *inode; 42180af3d00bSJosef Bacik struct btrfs_path *path; 42195d4f98a2SYan Zheng int ret; 4220f0486c68SYan, Zheng int rw = 0; 42215d4f98a2SYan Zheng int err = 0; 42225d4f98a2SYan Zheng 4223a9995eecSJosef Bacik rc = alloc_reloc_control(fs_info); 42245d4f98a2SYan Zheng if (!rc) 42255d4f98a2SYan Zheng return -ENOMEM; 42265d4f98a2SYan Zheng 4227f0486c68SYan, Zheng rc->extent_root = extent_root; 42283fd0a558SYan, Zheng 42295d4f98a2SYan Zheng rc->block_group = btrfs_lookup_block_group(fs_info, group_start); 42305d4f98a2SYan Zheng BUG_ON(!rc->block_group); 42315d4f98a2SYan Zheng 4232868f401aSZhaolei ret = btrfs_inc_block_group_ro(extent_root, rc->block_group); 4233f0486c68SYan, Zheng if (ret) { 4234f0486c68SYan, Zheng err = ret; 4235f0486c68SYan, Zheng goto out; 4236f0486c68SYan, Zheng } 4237f0486c68SYan, Zheng rw = 1; 4238f0486c68SYan, Zheng 42390af3d00bSJosef Bacik path = btrfs_alloc_path(); 42400af3d00bSJosef Bacik if (!path) { 42410af3d00bSJosef Bacik err = -ENOMEM; 42420af3d00bSJosef Bacik goto out; 42430af3d00bSJosef Bacik } 42440af3d00bSJosef Bacik 42450af3d00bSJosef Bacik inode = lookup_free_space_inode(fs_info->tree_root, rc->block_group, 42460af3d00bSJosef Bacik path); 42470af3d00bSJosef Bacik btrfs_free_path(path); 42480af3d00bSJosef Bacik 42490af3d00bSJosef Bacik if (!IS_ERR(inode)) 42501bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 42510af3d00bSJosef Bacik else 42520af3d00bSJosef Bacik ret = PTR_ERR(inode); 42530af3d00bSJosef Bacik 42540af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 42550af3d00bSJosef Bacik err = ret; 42560af3d00bSJosef Bacik goto out; 42570af3d00bSJosef Bacik } 42580af3d00bSJosef Bacik 42595d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 42605d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 42615d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 42625d4f98a2SYan Zheng rc->data_inode = NULL; 42635d4f98a2SYan Zheng goto out; 42645d4f98a2SYan Zheng } 42655d4f98a2SYan Zheng 4266efe120a0SFrank Holton btrfs_info(extent_root->fs_info, "relocating block group %llu flags %llu", 4267c1c9ff7cSGeert Uytterhoeven rc->block_group->key.objectid, rc->block_group->flags); 42685d4f98a2SYan Zheng 42699cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4270f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 4271578def7cSFilipe Manana btrfs_wait_ordered_roots(fs_info, -1, 4272578def7cSFilipe Manana rc->block_group->key.objectid, 4273578def7cSFilipe Manana rc->block_group->key.offset); 42745d4f98a2SYan Zheng 42755d4f98a2SYan Zheng while (1) { 427676dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 42775d4f98a2SYan Zheng ret = relocate_block_group(rc); 427876dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 42795d4f98a2SYan Zheng if (ret < 0) { 42805d4f98a2SYan Zheng err = ret; 42813fd0a558SYan, Zheng goto out; 42825d4f98a2SYan Zheng } 42835d4f98a2SYan Zheng 42845d4f98a2SYan Zheng if (rc->extents_found == 0) 42855d4f98a2SYan Zheng break; 42865d4f98a2SYan Zheng 4287efe120a0SFrank Holton btrfs_info(extent_root->fs_info, "found %llu extents", 4288c1c9ff7cSGeert Uytterhoeven rc->extents_found); 42895d4f98a2SYan Zheng 42905d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 42910ef8b726SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 42920ef8b726SJosef Bacik (u64)-1); 42930ef8b726SJosef Bacik if (ret) { 42940ef8b726SJosef Bacik err = ret; 42950ef8b726SJosef Bacik goto out; 42960ef8b726SJosef Bacik } 42975d4f98a2SYan Zheng invalidate_mapping_pages(rc->data_inode->i_mapping, 42985d4f98a2SYan Zheng 0, -1); 42995d4f98a2SYan Zheng rc->stage = UPDATE_DATA_PTRS; 43005d4f98a2SYan Zheng } 43015d4f98a2SYan Zheng } 43025d4f98a2SYan Zheng 43035d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 43045d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 43055d4f98a2SYan Zheng WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0); 43065d4f98a2SYan Zheng out: 4307f0486c68SYan, Zheng if (err && rw) 4308868f401aSZhaolei btrfs_dec_block_group_ro(extent_root, rc->block_group); 43095d4f98a2SYan Zheng iput(rc->data_inode); 43105d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 43115d4f98a2SYan Zheng kfree(rc); 43125d4f98a2SYan Zheng return err; 43135d4f98a2SYan Zheng } 43145d4f98a2SYan Zheng 431576dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 431676dda93cSYan, Zheng { 431776dda93cSYan, Zheng struct btrfs_trans_handle *trans; 431879787eaaSJeff Mahoney int ret, err; 431976dda93cSYan, Zheng 4320a22285a6SYan, Zheng trans = btrfs_start_transaction(root->fs_info->tree_root, 0); 432179787eaaSJeff Mahoney if (IS_ERR(trans)) 432279787eaaSJeff Mahoney return PTR_ERR(trans); 432376dda93cSYan, Zheng 432476dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 432576dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 432676dda93cSYan, Zheng root->root_item.drop_level = 0; 432776dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 432876dda93cSYan, Zheng ret = btrfs_update_root(trans, root->fs_info->tree_root, 432976dda93cSYan, Zheng &root->root_key, &root->root_item); 433076dda93cSYan, Zheng 433179787eaaSJeff Mahoney err = btrfs_end_transaction(trans, root->fs_info->tree_root); 433279787eaaSJeff Mahoney if (err) 433379787eaaSJeff Mahoney return err; 433479787eaaSJeff Mahoney return ret; 433576dda93cSYan, Zheng } 433676dda93cSYan, Zheng 43375d4f98a2SYan Zheng /* 43385d4f98a2SYan Zheng * recover relocation interrupted by system crash. 43395d4f98a2SYan Zheng * 43405d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 43415d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 43425d4f98a2SYan Zheng */ 43435d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 43445d4f98a2SYan Zheng { 43455d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 43465d4f98a2SYan Zheng struct btrfs_key key; 43475d4f98a2SYan Zheng struct btrfs_root *fs_root; 43485d4f98a2SYan Zheng struct btrfs_root *reloc_root; 43495d4f98a2SYan Zheng struct btrfs_path *path; 43505d4f98a2SYan Zheng struct extent_buffer *leaf; 43515d4f98a2SYan Zheng struct reloc_control *rc = NULL; 43525d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 43535d4f98a2SYan Zheng int ret; 43545d4f98a2SYan Zheng int err = 0; 43555d4f98a2SYan Zheng 43565d4f98a2SYan Zheng path = btrfs_alloc_path(); 43575d4f98a2SYan Zheng if (!path) 43585d4f98a2SYan Zheng return -ENOMEM; 4359e4058b54SDavid Sterba path->reada = READA_BACK; 43605d4f98a2SYan Zheng 43615d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 43625d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 43635d4f98a2SYan Zheng key.offset = (u64)-1; 43645d4f98a2SYan Zheng 43655d4f98a2SYan Zheng while (1) { 43665d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key, 43675d4f98a2SYan Zheng path, 0, 0); 43685d4f98a2SYan Zheng if (ret < 0) { 43695d4f98a2SYan Zheng err = ret; 43705d4f98a2SYan Zheng goto out; 43715d4f98a2SYan Zheng } 43725d4f98a2SYan Zheng if (ret > 0) { 43735d4f98a2SYan Zheng if (path->slots[0] == 0) 43745d4f98a2SYan Zheng break; 43755d4f98a2SYan Zheng path->slots[0]--; 43765d4f98a2SYan Zheng } 43775d4f98a2SYan Zheng leaf = path->nodes[0]; 43785d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4379b3b4aa74SDavid Sterba btrfs_release_path(path); 43805d4f98a2SYan Zheng 43815d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 43825d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 43835d4f98a2SYan Zheng break; 43845d4f98a2SYan Zheng 4385cb517eabSMiao Xie reloc_root = btrfs_read_fs_root(root, &key); 43865d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 43875d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 43885d4f98a2SYan Zheng goto out; 43895d4f98a2SYan Zheng } 43905d4f98a2SYan Zheng 43915d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 43925d4f98a2SYan Zheng 43935d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 43945d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 43955d4f98a2SYan Zheng reloc_root->root_key.offset); 43965d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 439776dda93cSYan, Zheng ret = PTR_ERR(fs_root); 439876dda93cSYan, Zheng if (ret != -ENOENT) { 439976dda93cSYan, Zheng err = ret; 44005d4f98a2SYan Zheng goto out; 44015d4f98a2SYan Zheng } 440279787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 440379787eaaSJeff Mahoney if (ret < 0) { 440479787eaaSJeff Mahoney err = ret; 440579787eaaSJeff Mahoney goto out; 440679787eaaSJeff Mahoney } 440776dda93cSYan, Zheng } 44085d4f98a2SYan Zheng } 44095d4f98a2SYan Zheng 44105d4f98a2SYan Zheng if (key.offset == 0) 44115d4f98a2SYan Zheng break; 44125d4f98a2SYan Zheng 44135d4f98a2SYan Zheng key.offset--; 44145d4f98a2SYan Zheng } 4415b3b4aa74SDavid Sterba btrfs_release_path(path); 44165d4f98a2SYan Zheng 44175d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 44185d4f98a2SYan Zheng goto out; 44195d4f98a2SYan Zheng 4420a9995eecSJosef Bacik rc = alloc_reloc_control(root->fs_info); 44215d4f98a2SYan Zheng if (!rc) { 44225d4f98a2SYan Zheng err = -ENOMEM; 44235d4f98a2SYan Zheng goto out; 44245d4f98a2SYan Zheng } 44255d4f98a2SYan Zheng 44265d4f98a2SYan Zheng rc->extent_root = root->fs_info->extent_root; 44275d4f98a2SYan Zheng 44285d4f98a2SYan Zheng set_reloc_control(rc); 44295d4f98a2SYan Zheng 44307a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 44313612b495STsutomu Itoh if (IS_ERR(trans)) { 44323612b495STsutomu Itoh unset_reloc_control(rc); 44333612b495STsutomu Itoh err = PTR_ERR(trans); 44343612b495STsutomu Itoh goto out_free; 44353612b495STsutomu Itoh } 44363fd0a558SYan, Zheng 44373fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 44383fd0a558SYan, Zheng 44395d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 44405d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 44415d4f98a2SYan Zheng struct btrfs_root, root_list); 44425d4f98a2SYan Zheng list_del(&reloc_root->root_list); 44435d4f98a2SYan Zheng 44445d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 44455d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 44465d4f98a2SYan Zheng &rc->reloc_roots); 44475d4f98a2SYan Zheng continue; 44485d4f98a2SYan Zheng } 44495d4f98a2SYan Zheng 44505d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 44515d4f98a2SYan Zheng reloc_root->root_key.offset); 445279787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 445379787eaaSJeff Mahoney err = PTR_ERR(fs_root); 445479787eaaSJeff Mahoney goto out_free; 445579787eaaSJeff Mahoney } 44565d4f98a2SYan Zheng 4457ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 445879787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 44595d4f98a2SYan Zheng fs_root->reloc_root = reloc_root; 44605d4f98a2SYan Zheng } 44615d4f98a2SYan Zheng 446279787eaaSJeff Mahoney err = btrfs_commit_transaction(trans, rc->extent_root); 446379787eaaSJeff Mahoney if (err) 446479787eaaSJeff Mahoney goto out_free; 44655d4f98a2SYan Zheng 44665d4f98a2SYan Zheng merge_reloc_roots(rc); 44675d4f98a2SYan Zheng 44685d4f98a2SYan Zheng unset_reloc_control(rc); 44695d4f98a2SYan Zheng 44707a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 44713612b495STsutomu Itoh if (IS_ERR(trans)) 44723612b495STsutomu Itoh err = PTR_ERR(trans); 44733612b495STsutomu Itoh else 447479787eaaSJeff Mahoney err = btrfs_commit_transaction(trans, rc->extent_root); 44753612b495STsutomu Itoh out_free: 44765d4f98a2SYan Zheng kfree(rc); 44773612b495STsutomu Itoh out: 4478aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4479aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4480aca1bba6SLiu Bo 44815d4f98a2SYan Zheng btrfs_free_path(path); 44825d4f98a2SYan Zheng 44835d4f98a2SYan Zheng if (err == 0) { 44845d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 44855d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 44865d4f98a2SYan Zheng BTRFS_DATA_RELOC_TREE_OBJECTID); 44875d4f98a2SYan Zheng if (IS_ERR(fs_root)) 44885d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4489d7ce5843SMiao Xie else 449066b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 44915d4f98a2SYan Zheng } 44925d4f98a2SYan Zheng return err; 44935d4f98a2SYan Zheng } 44945d4f98a2SYan Zheng 44955d4f98a2SYan Zheng /* 44965d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 44975d4f98a2SYan Zheng * 44985d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 44995d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 45005d4f98a2SYan Zheng */ 45015d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 45025d4f98a2SYan Zheng { 45035d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 45045d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 45055d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(inode)->root; 45065d4f98a2SYan Zheng int ret; 45075d4f98a2SYan Zheng u64 disk_bytenr; 45084577b014SJosef Bacik u64 new_bytenr; 45095d4f98a2SYan Zheng LIST_HEAD(list); 45105d4f98a2SYan Zheng 45115d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 45125d4f98a2SYan Zheng BUG_ON(ordered->file_offset != file_pos || ordered->len != len); 45135d4f98a2SYan Zheng 45145d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 45155d4f98a2SYan Zheng ret = btrfs_lookup_csums_range(root->fs_info->csum_root, disk_bytenr, 4516a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 451779787eaaSJeff Mahoney if (ret) 451879787eaaSJeff Mahoney goto out; 45195d4f98a2SYan Zheng 45205d4f98a2SYan Zheng while (!list_empty(&list)) { 45215d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 45225d4f98a2SYan Zheng list_del_init(&sums->list); 45235d4f98a2SYan Zheng 45244577b014SJosef Bacik /* 45254577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 45264577b014SJosef Bacik * We need to do this because we will read in entire prealloc 45274577b014SJosef Bacik * extents but we may have written to say the middle of the 45284577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 45294577b014SJosef Bacik * the right disk offset. 45304577b014SJosef Bacik * 45314577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 45324577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 45334577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 45344577b014SJosef Bacik * disk length. 45354577b014SJosef Bacik */ 45364577b014SJosef Bacik new_bytenr = ordered->start + (sums->bytenr - disk_bytenr); 45374577b014SJosef Bacik sums->bytenr = new_bytenr; 45385d4f98a2SYan Zheng 45395d4f98a2SYan Zheng btrfs_add_ordered_sum(inode, ordered, sums); 45405d4f98a2SYan Zheng } 454179787eaaSJeff Mahoney out: 45425d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4543411fc6bcSAndi Kleen return ret; 45445d4f98a2SYan Zheng } 45453fd0a558SYan, Zheng 454683d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 45473fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 45483fd0a558SYan, Zheng struct extent_buffer *cow) 45493fd0a558SYan, Zheng { 45503fd0a558SYan, Zheng struct reloc_control *rc; 45513fd0a558SYan, Zheng struct backref_node *node; 45523fd0a558SYan, Zheng int first_cow = 0; 45533fd0a558SYan, Zheng int level; 455483d4cfd4SJosef Bacik int ret = 0; 45553fd0a558SYan, Zheng 45563fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 45573fd0a558SYan, Zheng if (!rc) 455883d4cfd4SJosef Bacik return 0; 45593fd0a558SYan, Zheng 45603fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 45613fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 45623fd0a558SYan, Zheng 4563c974c464SWang Shilong if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 4564c974c464SWang Shilong if (buf == root->node) 4565c974c464SWang Shilong __update_reloc_root(root, cow->start); 4566c974c464SWang Shilong } 4567c974c464SWang Shilong 45683fd0a558SYan, Zheng level = btrfs_header_level(buf); 45693fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 45703fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 45713fd0a558SYan, Zheng first_cow = 1; 45723fd0a558SYan, Zheng 45733fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 45743fd0a558SYan, Zheng rc->create_reloc_tree) { 45753fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 45763fd0a558SYan, Zheng 45773fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 45783fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 45793fd0a558SYan, Zheng node->new_bytenr != buf->start); 45803fd0a558SYan, Zheng 45813fd0a558SYan, Zheng drop_node_buffer(node); 45823fd0a558SYan, Zheng extent_buffer_get(cow); 45833fd0a558SYan, Zheng node->eb = cow; 45843fd0a558SYan, Zheng node->new_bytenr = cow->start; 45853fd0a558SYan, Zheng 45863fd0a558SYan, Zheng if (!node->pending) { 45873fd0a558SYan, Zheng list_move_tail(&node->list, 45883fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 45893fd0a558SYan, Zheng node->pending = 1; 45903fd0a558SYan, Zheng } 45913fd0a558SYan, Zheng 45923fd0a558SYan, Zheng if (first_cow) 45933fd0a558SYan, Zheng __mark_block_processed(rc, node); 45943fd0a558SYan, Zheng 45953fd0a558SYan, Zheng if (first_cow && level > 0) 45963fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 45973fd0a558SYan, Zheng } 45983fd0a558SYan, Zheng 459983d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 46003fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 460183d4cfd4SJosef Bacik return ret; 46023fd0a558SYan, Zheng } 46033fd0a558SYan, Zheng 46043fd0a558SYan, Zheng /* 46053fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 460601327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 46073fd0a558SYan, Zheng */ 4608147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 46093fd0a558SYan, Zheng u64 *bytes_to_reserve) 46103fd0a558SYan, Zheng { 46113fd0a558SYan, Zheng struct btrfs_root *root; 46123fd0a558SYan, Zheng struct reloc_control *rc; 46133fd0a558SYan, Zheng 46143fd0a558SYan, Zheng root = pending->root; 46153fd0a558SYan, Zheng if (!root->reloc_root) 46163fd0a558SYan, Zheng return; 46173fd0a558SYan, Zheng 46183fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 46193fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 46203fd0a558SYan, Zheng return; 46213fd0a558SYan, Zheng 46223fd0a558SYan, Zheng root = root->reloc_root; 46233fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 46243fd0a558SYan, Zheng /* 46253fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 46263fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 46273fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 46283fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 46293fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 46303fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 46313fd0a558SYan, Zheng * tree may use more space than it frees. so we need 46323fd0a558SYan, Zheng * reserve extra space. 46333fd0a558SYan, Zheng */ 46343fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 46353fd0a558SYan, Zheng } 46363fd0a558SYan, Zheng 46373fd0a558SYan, Zheng /* 46383fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 46393fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 46403fd0a558SYan, Zheng */ 464149b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 46423fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 46433fd0a558SYan, Zheng { 46443fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 46453fd0a558SYan, Zheng struct btrfs_root *reloc_root; 46463fd0a558SYan, Zheng struct btrfs_root *new_root; 46473fd0a558SYan, Zheng struct reloc_control *rc; 46483fd0a558SYan, Zheng int ret; 46493fd0a558SYan, Zheng 46503fd0a558SYan, Zheng if (!root->reloc_root) 465149b25e05SJeff Mahoney return 0; 46523fd0a558SYan, Zheng 46533fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 46543fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 46553fd0a558SYan, Zheng 46563fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 46573fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 46583fd0a558SYan, Zheng rc->block_rsv, 465925d609f8SJosef Bacik rc->nodes_relocated, 1); 466049b25e05SJeff Mahoney if (ret) 466149b25e05SJeff Mahoney return ret; 46623fd0a558SYan, Zheng } 46633fd0a558SYan, Zheng 46643fd0a558SYan, Zheng new_root = pending->snap; 46653fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 46663fd0a558SYan, Zheng new_root->root_key.objectid); 466749b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 466849b25e05SJeff Mahoney return PTR_ERR(reloc_root); 46693fd0a558SYan, Zheng 4670ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4671ffd7b339SJeff Mahoney BUG_ON(ret < 0); 46723fd0a558SYan, Zheng new_root->reloc_root = reloc_root; 46733fd0a558SYan, Zheng 467449b25e05SJeff Mahoney if (rc->create_reloc_tree) 46753fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 467649b25e05SJeff Mahoney return ret; 46773fd0a558SYan, Zheng } 4678