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++) 2383fd0a558SYan, Zheng BUG_ON(!list_empty(&cache->pending[i])); 2393fd0a558SYan, Zheng BUG_ON(!list_empty(&cache->changed)); 2403fd0a558SYan, Zheng BUG_ON(!list_empty(&cache->detached)); 2413fd0a558SYan, Zheng BUG_ON(!RB_EMPTY_ROOT(&cache->rb_root)); 2423fd0a558SYan, Zheng BUG_ON(cache->nr_nodes); 2433fd0a558SYan, Zheng BUG_ON(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 || 57866463748SWang Shilong root_objectid == BTRFS_QUOTA_TREE_OBJECTID) 5795d4f98a2SYan Zheng return 1; 5805d4f98a2SYan Zheng return 0; 5815d4f98a2SYan Zheng } 5825d4f98a2SYan Zheng 5835d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 5845d4f98a2SYan Zheng u64 root_objectid) 5855d4f98a2SYan Zheng { 5865d4f98a2SYan Zheng struct btrfs_key key; 5875d4f98a2SYan Zheng 5885d4f98a2SYan Zheng key.objectid = root_objectid; 5895d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 5905d4f98a2SYan Zheng if (is_cowonly_root(root_objectid)) 5915d4f98a2SYan Zheng key.offset = 0; 5925d4f98a2SYan Zheng else 5935d4f98a2SYan Zheng key.offset = (u64)-1; 5945d4f98a2SYan Zheng 595c00869f1SMiao Xie return btrfs_get_fs_root(fs_info, &key, false); 5965d4f98a2SYan Zheng } 5975d4f98a2SYan Zheng 5985d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 5995d4f98a2SYan Zheng static noinline_for_stack 6005d4f98a2SYan Zheng struct btrfs_root *find_tree_root(struct reloc_control *rc, 6015d4f98a2SYan Zheng struct extent_buffer *leaf, 6025d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0) 6035d4f98a2SYan Zheng { 6045d4f98a2SYan Zheng struct btrfs_root *root; 6055d4f98a2SYan Zheng u64 root_objectid = btrfs_ref_root_v0(leaf, ref0); 6065d4f98a2SYan Zheng u64 generation = btrfs_ref_generation_v0(leaf, ref0); 6075d4f98a2SYan Zheng 6085d4f98a2SYan Zheng BUG_ON(root_objectid == BTRFS_TREE_RELOC_OBJECTID); 6095d4f98a2SYan Zheng 6105d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, root_objectid); 6115d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 6125d4f98a2SYan Zheng 61327cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state) && 6145d4f98a2SYan Zheng generation != btrfs_root_generation(&root->root_item)) 6155d4f98a2SYan Zheng return NULL; 6165d4f98a2SYan Zheng 6175d4f98a2SYan Zheng return root; 6185d4f98a2SYan Zheng } 6195d4f98a2SYan Zheng #endif 6205d4f98a2SYan Zheng 6215d4f98a2SYan Zheng static noinline_for_stack 6225d4f98a2SYan Zheng int find_inline_backref(struct extent_buffer *leaf, int slot, 6235d4f98a2SYan Zheng unsigned long *ptr, unsigned long *end) 6245d4f98a2SYan Zheng { 6253173a18fSJosef Bacik struct btrfs_key key; 6265d4f98a2SYan Zheng struct btrfs_extent_item *ei; 6275d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 6285d4f98a2SYan Zheng u32 item_size; 6295d4f98a2SYan Zheng 6303173a18fSJosef Bacik btrfs_item_key_to_cpu(leaf, &key, slot); 6313173a18fSJosef Bacik 6325d4f98a2SYan Zheng item_size = btrfs_item_size_nr(leaf, slot); 6335d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 6345d4f98a2SYan Zheng if (item_size < sizeof(*ei)) { 6355d4f98a2SYan Zheng WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0)); 6365d4f98a2SYan Zheng return 1; 6375d4f98a2SYan Zheng } 6385d4f98a2SYan Zheng #endif 6395d4f98a2SYan Zheng ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); 6405d4f98a2SYan Zheng WARN_ON(!(btrfs_extent_flags(leaf, ei) & 6415d4f98a2SYan Zheng BTRFS_EXTENT_FLAG_TREE_BLOCK)); 6425d4f98a2SYan Zheng 6433173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 6443173a18fSJosef Bacik item_size <= sizeof(*ei) + sizeof(*bi)) { 6455d4f98a2SYan Zheng WARN_ON(item_size < sizeof(*ei) + sizeof(*bi)); 6465d4f98a2SYan Zheng return 1; 6475d4f98a2SYan Zheng } 648d062d13cSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 649d062d13cSJosef Bacik item_size <= sizeof(*ei)) { 650d062d13cSJosef Bacik WARN_ON(item_size < sizeof(*ei)); 651d062d13cSJosef Bacik return 1; 652d062d13cSJosef Bacik } 6535d4f98a2SYan Zheng 6543173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) { 6555d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 6565d4f98a2SYan Zheng *ptr = (unsigned long)(bi + 1); 6573173a18fSJosef Bacik } else { 6583173a18fSJosef Bacik *ptr = (unsigned long)(ei + 1); 6593173a18fSJosef Bacik } 6605d4f98a2SYan Zheng *end = (unsigned long)ei + item_size; 6615d4f98a2SYan Zheng return 0; 6625d4f98a2SYan Zheng } 6635d4f98a2SYan Zheng 6645d4f98a2SYan Zheng /* 6655d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 6665d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 6675d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 6685d4f98a2SYan Zheng * 6695d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 6705d4f98a2SYan Zheng * to find upper level blocks that refernece the block, and then check 6715d4f98a2SYan Zheng * bakcrefs of these upper level blocks recursively. the recursion stop 6725d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 6735d4f98a2SYan Zheng * 6745d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 6755d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 6765d4f98a2SYan Zheng * block are also cached. 6775d4f98a2SYan Zheng */ 6783fd0a558SYan, Zheng static noinline_for_stack 6793fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 6805d4f98a2SYan Zheng struct btrfs_key *node_key, 6815d4f98a2SYan Zheng int level, u64 bytenr) 6825d4f98a2SYan Zheng { 6833fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 6845d4f98a2SYan Zheng struct btrfs_path *path1; 6855d4f98a2SYan Zheng struct btrfs_path *path2; 6865d4f98a2SYan Zheng struct extent_buffer *eb; 6875d4f98a2SYan Zheng struct btrfs_root *root; 6885d4f98a2SYan Zheng struct backref_node *cur; 6895d4f98a2SYan Zheng struct backref_node *upper; 6905d4f98a2SYan Zheng struct backref_node *lower; 6915d4f98a2SYan Zheng struct backref_node *node = NULL; 6925d4f98a2SYan Zheng struct backref_node *exist = NULL; 6935d4f98a2SYan Zheng struct backref_edge *edge; 6945d4f98a2SYan Zheng struct rb_node *rb_node; 6955d4f98a2SYan Zheng struct btrfs_key key; 6965d4f98a2SYan Zheng unsigned long end; 6975d4f98a2SYan Zheng unsigned long ptr; 6985d4f98a2SYan Zheng LIST_HEAD(list); 6993fd0a558SYan, Zheng LIST_HEAD(useless); 7003fd0a558SYan, Zheng int cowonly; 7015d4f98a2SYan Zheng int ret; 7025d4f98a2SYan Zheng int err = 0; 703b6c60c80SJosef Bacik bool need_check = true; 7045d4f98a2SYan Zheng 7055d4f98a2SYan Zheng path1 = btrfs_alloc_path(); 7065d4f98a2SYan Zheng path2 = btrfs_alloc_path(); 7075d4f98a2SYan Zheng if (!path1 || !path2) { 7085d4f98a2SYan Zheng err = -ENOMEM; 7095d4f98a2SYan Zheng goto out; 7105d4f98a2SYan Zheng } 711026fd317SJosef Bacik path1->reada = 1; 712026fd317SJosef Bacik path2->reada = 2; 7135d4f98a2SYan Zheng 7143fd0a558SYan, Zheng node = alloc_backref_node(cache); 7155d4f98a2SYan Zheng if (!node) { 7165d4f98a2SYan Zheng err = -ENOMEM; 7175d4f98a2SYan Zheng goto out; 7185d4f98a2SYan Zheng } 7195d4f98a2SYan Zheng 7205d4f98a2SYan Zheng node->bytenr = bytenr; 7215d4f98a2SYan Zheng node->level = level; 7225d4f98a2SYan Zheng node->lowest = 1; 7235d4f98a2SYan Zheng cur = node; 7245d4f98a2SYan Zheng again: 7255d4f98a2SYan Zheng end = 0; 7265d4f98a2SYan Zheng ptr = 0; 7275d4f98a2SYan Zheng key.objectid = cur->bytenr; 7283173a18fSJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 7295d4f98a2SYan Zheng key.offset = (u64)-1; 7305d4f98a2SYan Zheng 7315d4f98a2SYan Zheng path1->search_commit_root = 1; 7325d4f98a2SYan Zheng path1->skip_locking = 1; 7335d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1, 7345d4f98a2SYan Zheng 0, 0); 7355d4f98a2SYan Zheng if (ret < 0) { 7365d4f98a2SYan Zheng err = ret; 7375d4f98a2SYan Zheng goto out; 7385d4f98a2SYan Zheng } 73975bfb9afSJosef Bacik ASSERT(ret); 74075bfb9afSJosef Bacik ASSERT(path1->slots[0]); 7415d4f98a2SYan Zheng 7425d4f98a2SYan Zheng path1->slots[0]--; 7435d4f98a2SYan Zheng 7445d4f98a2SYan Zheng WARN_ON(cur->checked); 7455d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 7465d4f98a2SYan Zheng /* 74770f23fd6SJustin P. Mattock * the backref was added previously when processing 7485d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 7495d4f98a2SYan Zheng */ 75075bfb9afSJosef Bacik ASSERT(list_is_singular(&cur->upper)); 7515d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 7525d4f98a2SYan Zheng list[LOWER]); 75375bfb9afSJosef Bacik ASSERT(list_empty(&edge->list[UPPER])); 7545d4f98a2SYan Zheng exist = edge->node[UPPER]; 7555d4f98a2SYan Zheng /* 7565d4f98a2SYan Zheng * add the upper level block to pending list if we need 7575d4f98a2SYan Zheng * check its backrefs 7585d4f98a2SYan Zheng */ 7595d4f98a2SYan Zheng if (!exist->checked) 7605d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 7615d4f98a2SYan Zheng } else { 7625d4f98a2SYan Zheng exist = NULL; 7635d4f98a2SYan Zheng } 7645d4f98a2SYan Zheng 7655d4f98a2SYan Zheng while (1) { 7665d4f98a2SYan Zheng cond_resched(); 7675d4f98a2SYan Zheng eb = path1->nodes[0]; 7685d4f98a2SYan Zheng 7695d4f98a2SYan Zheng if (ptr >= end) { 7705d4f98a2SYan Zheng if (path1->slots[0] >= btrfs_header_nritems(eb)) { 7715d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path1); 7725d4f98a2SYan Zheng if (ret < 0) { 7735d4f98a2SYan Zheng err = ret; 7745d4f98a2SYan Zheng goto out; 7755d4f98a2SYan Zheng } 7765d4f98a2SYan Zheng if (ret > 0) 7775d4f98a2SYan Zheng break; 7785d4f98a2SYan Zheng eb = path1->nodes[0]; 7795d4f98a2SYan Zheng } 7805d4f98a2SYan Zheng 7815d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path1->slots[0]); 7825d4f98a2SYan Zheng if (key.objectid != cur->bytenr) { 7835d4f98a2SYan Zheng WARN_ON(exist); 7845d4f98a2SYan Zheng break; 7855d4f98a2SYan Zheng } 7865d4f98a2SYan Zheng 7873173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY || 7883173a18fSJosef Bacik key.type == BTRFS_METADATA_ITEM_KEY) { 7895d4f98a2SYan Zheng ret = find_inline_backref(eb, path1->slots[0], 7905d4f98a2SYan Zheng &ptr, &end); 7915d4f98a2SYan Zheng if (ret) 7925d4f98a2SYan Zheng goto next; 7935d4f98a2SYan Zheng } 7945d4f98a2SYan Zheng } 7955d4f98a2SYan Zheng 7965d4f98a2SYan Zheng if (ptr < end) { 7975d4f98a2SYan Zheng /* update key for inline back ref */ 7985d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 7995d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 8005d4f98a2SYan Zheng key.type = btrfs_extent_inline_ref_type(eb, iref); 8015d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 8025d4f98a2SYan Zheng WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY && 8035d4f98a2SYan Zheng key.type != BTRFS_SHARED_BLOCK_REF_KEY); 8045d4f98a2SYan Zheng } 8055d4f98a2SYan Zheng 8065d4f98a2SYan Zheng if (exist && 8075d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 8085d4f98a2SYan Zheng exist->owner == key.offset) || 8095d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 8105d4f98a2SYan Zheng exist->bytenr == key.offset))) { 8115d4f98a2SYan Zheng exist = NULL; 8125d4f98a2SYan Zheng goto next; 8135d4f98a2SYan Zheng } 8145d4f98a2SYan Zheng 8155d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 8165d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY || 8175d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 8183fd0a558SYan, Zheng if (key.type == BTRFS_EXTENT_REF_V0_KEY) { 8195d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 8205d4f98a2SYan Zheng ref0 = btrfs_item_ptr(eb, path1->slots[0], 8215d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 8223fd0a558SYan, Zheng if (key.objectid == key.offset) { 823046f264fSYan, Zheng root = find_tree_root(rc, eb, ref0); 8243fd0a558SYan, Zheng if (root && !should_ignore_root(root)) 8255d4f98a2SYan Zheng cur->root = root; 8265d4f98a2SYan Zheng else 8273fd0a558SYan, Zheng list_add(&cur->list, &useless); 8285d4f98a2SYan Zheng break; 8295d4f98a2SYan Zheng } 830046f264fSYan, Zheng if (is_cowonly_root(btrfs_ref_root_v0(eb, 831046f264fSYan, Zheng ref0))) 832046f264fSYan, Zheng cur->cowonly = 1; 8333fd0a558SYan, Zheng } 8345d4f98a2SYan Zheng #else 83575bfb9afSJosef Bacik ASSERT(key.type != BTRFS_EXTENT_REF_V0_KEY); 8365d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 8375d4f98a2SYan Zheng #endif 8385d4f98a2SYan Zheng if (key.objectid == key.offset) { 8395d4f98a2SYan Zheng /* 8405d4f98a2SYan Zheng * only root blocks of reloc trees use 8415d4f98a2SYan Zheng * backref of this type. 8425d4f98a2SYan Zheng */ 8435d4f98a2SYan Zheng root = find_reloc_root(rc, cur->bytenr); 84475bfb9afSJosef Bacik ASSERT(root); 8455d4f98a2SYan Zheng cur->root = root; 8465d4f98a2SYan Zheng break; 8475d4f98a2SYan Zheng } 8485d4f98a2SYan Zheng 8493fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 8505d4f98a2SYan Zheng if (!edge) { 8515d4f98a2SYan Zheng err = -ENOMEM; 8525d4f98a2SYan Zheng goto out; 8535d4f98a2SYan Zheng } 8545d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, key.offset); 8555d4f98a2SYan Zheng if (!rb_node) { 8563fd0a558SYan, Zheng upper = alloc_backref_node(cache); 8575d4f98a2SYan Zheng if (!upper) { 8583fd0a558SYan, Zheng free_backref_edge(cache, edge); 8595d4f98a2SYan Zheng err = -ENOMEM; 8605d4f98a2SYan Zheng goto out; 8615d4f98a2SYan Zheng } 8625d4f98a2SYan Zheng upper->bytenr = key.offset; 8635d4f98a2SYan Zheng upper->level = cur->level + 1; 8645d4f98a2SYan Zheng /* 8655d4f98a2SYan Zheng * backrefs for the upper level block isn't 8665d4f98a2SYan Zheng * cached, add the block to pending list 8675d4f98a2SYan Zheng */ 8685d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 8695d4f98a2SYan Zheng } else { 8705d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 8715d4f98a2SYan Zheng rb_node); 87275bfb9afSJosef Bacik ASSERT(upper->checked); 8735d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 8745d4f98a2SYan Zheng } 8753fd0a558SYan, Zheng list_add_tail(&edge->list[LOWER], &cur->upper); 8765d4f98a2SYan Zheng edge->node[LOWER] = cur; 8773fd0a558SYan, Zheng edge->node[UPPER] = upper; 8785d4f98a2SYan Zheng 8795d4f98a2SYan Zheng goto next; 8805d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 8815d4f98a2SYan Zheng goto next; 8825d4f98a2SYan Zheng } 8835d4f98a2SYan Zheng 8845d4f98a2SYan Zheng /* key.type == BTRFS_TREE_BLOCK_REF_KEY */ 8855d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, key.offset); 8865d4f98a2SYan Zheng if (IS_ERR(root)) { 8875d4f98a2SYan Zheng err = PTR_ERR(root); 8885d4f98a2SYan Zheng goto out; 8895d4f98a2SYan Zheng } 8905d4f98a2SYan Zheng 89127cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 8923fd0a558SYan, Zheng cur->cowonly = 1; 8933fd0a558SYan, Zheng 8945d4f98a2SYan Zheng if (btrfs_root_level(&root->root_item) == cur->level) { 8955d4f98a2SYan Zheng /* tree root */ 89675bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 8975d4f98a2SYan Zheng cur->bytenr); 8983fd0a558SYan, Zheng if (should_ignore_root(root)) 8993fd0a558SYan, Zheng list_add(&cur->list, &useless); 9003fd0a558SYan, Zheng else 9015d4f98a2SYan Zheng cur->root = root; 9025d4f98a2SYan Zheng break; 9035d4f98a2SYan Zheng } 9045d4f98a2SYan Zheng 9055d4f98a2SYan Zheng level = cur->level + 1; 9065d4f98a2SYan Zheng 9075d4f98a2SYan Zheng /* 9085d4f98a2SYan Zheng * searching the tree to find upper level blocks 9095d4f98a2SYan Zheng * reference the block. 9105d4f98a2SYan Zheng */ 9115d4f98a2SYan Zheng path2->search_commit_root = 1; 9125d4f98a2SYan Zheng path2->skip_locking = 1; 9135d4f98a2SYan Zheng path2->lowest_level = level; 9145d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0); 9155d4f98a2SYan Zheng path2->lowest_level = 0; 9165d4f98a2SYan Zheng if (ret < 0) { 9175d4f98a2SYan Zheng err = ret; 9185d4f98a2SYan Zheng goto out; 9195d4f98a2SYan Zheng } 92033c66f43SYan Zheng if (ret > 0 && path2->slots[level] > 0) 92133c66f43SYan Zheng path2->slots[level]--; 9225d4f98a2SYan Zheng 9235d4f98a2SYan Zheng eb = path2->nodes[level]; 9245d4f98a2SYan Zheng WARN_ON(btrfs_node_blockptr(eb, path2->slots[level]) != 9255d4f98a2SYan Zheng cur->bytenr); 9265d4f98a2SYan Zheng 9275d4f98a2SYan Zheng lower = cur; 928b6c60c80SJosef Bacik need_check = true; 9295d4f98a2SYan Zheng for (; level < BTRFS_MAX_LEVEL; level++) { 9305d4f98a2SYan Zheng if (!path2->nodes[level]) { 93175bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 9325d4f98a2SYan Zheng lower->bytenr); 9333fd0a558SYan, Zheng if (should_ignore_root(root)) 9343fd0a558SYan, Zheng list_add(&lower->list, &useless); 9353fd0a558SYan, Zheng else 9365d4f98a2SYan Zheng lower->root = root; 9375d4f98a2SYan Zheng break; 9385d4f98a2SYan Zheng } 9395d4f98a2SYan Zheng 9403fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 9415d4f98a2SYan Zheng if (!edge) { 9425d4f98a2SYan Zheng err = -ENOMEM; 9435d4f98a2SYan Zheng goto out; 9445d4f98a2SYan Zheng } 9455d4f98a2SYan Zheng 9465d4f98a2SYan Zheng eb = path2->nodes[level]; 9475d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, eb->start); 9485d4f98a2SYan Zheng if (!rb_node) { 9493fd0a558SYan, Zheng upper = alloc_backref_node(cache); 9505d4f98a2SYan Zheng if (!upper) { 9513fd0a558SYan, Zheng free_backref_edge(cache, edge); 9525d4f98a2SYan Zheng err = -ENOMEM; 9535d4f98a2SYan Zheng goto out; 9545d4f98a2SYan Zheng } 9555d4f98a2SYan Zheng upper->bytenr = eb->start; 9565d4f98a2SYan Zheng upper->owner = btrfs_header_owner(eb); 9575d4f98a2SYan Zheng upper->level = lower->level + 1; 95827cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, 95927cdeb70SMiao Xie &root->state)) 9603fd0a558SYan, Zheng upper->cowonly = 1; 9615d4f98a2SYan Zheng 9625d4f98a2SYan Zheng /* 9635d4f98a2SYan Zheng * if we know the block isn't shared 9645d4f98a2SYan Zheng * we can void checking its backrefs. 9655d4f98a2SYan Zheng */ 9665d4f98a2SYan Zheng if (btrfs_block_can_be_shared(root, eb)) 9675d4f98a2SYan Zheng upper->checked = 0; 9685d4f98a2SYan Zheng else 9695d4f98a2SYan Zheng upper->checked = 1; 9705d4f98a2SYan Zheng 9715d4f98a2SYan Zheng /* 9725d4f98a2SYan Zheng * add the block to pending list if we 973b6c60c80SJosef Bacik * need check its backrefs, we only do this once 974b6c60c80SJosef Bacik * while walking up a tree as we will catch 975b6c60c80SJosef Bacik * anything else later on. 9765d4f98a2SYan Zheng */ 977b6c60c80SJosef Bacik if (!upper->checked && need_check) { 978b6c60c80SJosef Bacik need_check = false; 9795d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], 9805d4f98a2SYan Zheng &list); 981bbe90514SJosef Bacik } else { 982bbe90514SJosef Bacik if (upper->checked) 983bbe90514SJosef Bacik need_check = true; 9845d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 985bbe90514SJosef Bacik } 9865d4f98a2SYan Zheng } else { 9875d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 9885d4f98a2SYan Zheng rb_node); 98975bfb9afSJosef Bacik ASSERT(upper->checked); 9905d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 9913fd0a558SYan, Zheng if (!upper->owner) 9923fd0a558SYan, Zheng upper->owner = btrfs_header_owner(eb); 9935d4f98a2SYan Zheng } 9945d4f98a2SYan Zheng list_add_tail(&edge->list[LOWER], &lower->upper); 9955d4f98a2SYan Zheng edge->node[LOWER] = lower; 9963fd0a558SYan, Zheng edge->node[UPPER] = upper; 9975d4f98a2SYan Zheng 9985d4f98a2SYan Zheng if (rb_node) 9995d4f98a2SYan Zheng break; 10005d4f98a2SYan Zheng lower = upper; 10015d4f98a2SYan Zheng upper = NULL; 10025d4f98a2SYan Zheng } 1003b3b4aa74SDavid Sterba btrfs_release_path(path2); 10045d4f98a2SYan Zheng next: 10055d4f98a2SYan Zheng if (ptr < end) { 10065d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 10075d4f98a2SYan Zheng if (ptr >= end) { 10085d4f98a2SYan Zheng WARN_ON(ptr > end); 10095d4f98a2SYan Zheng ptr = 0; 10105d4f98a2SYan Zheng end = 0; 10115d4f98a2SYan Zheng } 10125d4f98a2SYan Zheng } 10135d4f98a2SYan Zheng if (ptr >= end) 10145d4f98a2SYan Zheng path1->slots[0]++; 10155d4f98a2SYan Zheng } 1016b3b4aa74SDavid Sterba btrfs_release_path(path1); 10175d4f98a2SYan Zheng 10185d4f98a2SYan Zheng cur->checked = 1; 10195d4f98a2SYan Zheng WARN_ON(exist); 10205d4f98a2SYan Zheng 10215d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 10225d4f98a2SYan Zheng if (!list_empty(&list)) { 10235d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10245d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10255d4f98a2SYan Zheng cur = edge->node[UPPER]; 10265d4f98a2SYan Zheng goto again; 10275d4f98a2SYan Zheng } 10285d4f98a2SYan Zheng 10295d4f98a2SYan Zheng /* 10305d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 10315d4f98a2SYan Zheng * into the cache. 10325d4f98a2SYan Zheng */ 103375bfb9afSJosef Bacik ASSERT(node->checked); 10343fd0a558SYan, Zheng cowonly = node->cowonly; 10353fd0a558SYan, Zheng if (!cowonly) { 10363fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 10373fd0a558SYan, Zheng &node->rb_node); 103843c04fb1SJeff Mahoney if (rb_node) 103943c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 10403fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 10413fd0a558SYan, Zheng } 10425d4f98a2SYan Zheng 10435d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 10445d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10455d4f98a2SYan Zheng 10465d4f98a2SYan Zheng while (!list_empty(&list)) { 10475d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10485d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10495d4f98a2SYan Zheng upper = edge->node[UPPER]; 10503fd0a558SYan, Zheng if (upper->detached) { 10513fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10523fd0a558SYan, Zheng lower = edge->node[LOWER]; 10533fd0a558SYan, Zheng free_backref_edge(cache, edge); 10543fd0a558SYan, Zheng if (list_empty(&lower->upper)) 10553fd0a558SYan, Zheng list_add(&lower->list, &useless); 10563fd0a558SYan, Zheng continue; 10573fd0a558SYan, Zheng } 10585d4f98a2SYan Zheng 10595d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 10605d4f98a2SYan Zheng if (upper->lowest) { 10615d4f98a2SYan Zheng list_del_init(&upper->lower); 10625d4f98a2SYan Zheng upper->lowest = 0; 10635d4f98a2SYan Zheng } 10645d4f98a2SYan Zheng 10655d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10665d4f98a2SYan Zheng continue; 10675d4f98a2SYan Zheng } 10685d4f98a2SYan Zheng 106975bfb9afSJosef Bacik if (!upper->checked) { 107075bfb9afSJosef Bacik /* 107175bfb9afSJosef Bacik * Still want to blow up for developers since this is a 107275bfb9afSJosef Bacik * logic bug. 107375bfb9afSJosef Bacik */ 107475bfb9afSJosef Bacik ASSERT(0); 107575bfb9afSJosef Bacik err = -EINVAL; 107675bfb9afSJosef Bacik goto out; 107775bfb9afSJosef Bacik } 107875bfb9afSJosef Bacik if (cowonly != upper->cowonly) { 107975bfb9afSJosef Bacik ASSERT(0); 108075bfb9afSJosef Bacik err = -EINVAL; 108175bfb9afSJosef Bacik goto out; 108275bfb9afSJosef Bacik } 108375bfb9afSJosef Bacik 10843fd0a558SYan, Zheng if (!cowonly) { 10855d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 10865d4f98a2SYan Zheng &upper->rb_node); 108743c04fb1SJeff Mahoney if (rb_node) 108843c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 108943c04fb1SJeff Mahoney upper->bytenr); 10903fd0a558SYan, Zheng } 10915d4f98a2SYan Zheng 10925d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10935d4f98a2SYan Zheng 10945d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 10955d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10965d4f98a2SYan Zheng } 10973fd0a558SYan, Zheng /* 10983fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 10993fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 11003fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 11013fd0a558SYan, Zheng * lookup. 11023fd0a558SYan, Zheng */ 11033fd0a558SYan, Zheng while (!list_empty(&useless)) { 11043fd0a558SYan, Zheng upper = list_entry(useless.next, struct backref_node, list); 11053fd0a558SYan, Zheng list_del_init(&upper->list); 110675bfb9afSJosef Bacik ASSERT(list_empty(&upper->upper)); 11073fd0a558SYan, Zheng if (upper == node) 11083fd0a558SYan, Zheng node = NULL; 11093fd0a558SYan, Zheng if (upper->lowest) { 11103fd0a558SYan, Zheng list_del_init(&upper->lower); 11113fd0a558SYan, Zheng upper->lowest = 0; 11123fd0a558SYan, Zheng } 11133fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 11143fd0a558SYan, Zheng edge = list_entry(upper->lower.next, 11153fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 11163fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 11173fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11183fd0a558SYan, Zheng lower = edge->node[LOWER]; 11193fd0a558SYan, Zheng free_backref_edge(cache, edge); 11203fd0a558SYan, Zheng 11213fd0a558SYan, Zheng if (list_empty(&lower->upper)) 11223fd0a558SYan, Zheng list_add(&lower->list, &useless); 11233fd0a558SYan, Zheng } 11243fd0a558SYan, Zheng __mark_block_processed(rc, upper); 11253fd0a558SYan, Zheng if (upper->level > 0) { 11263fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 11273fd0a558SYan, Zheng upper->detached = 1; 11283fd0a558SYan, Zheng } else { 11293fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 11303fd0a558SYan, Zheng free_backref_node(cache, upper); 11313fd0a558SYan, Zheng } 11323fd0a558SYan, Zheng } 11335d4f98a2SYan Zheng out: 11345d4f98a2SYan Zheng btrfs_free_path(path1); 11355d4f98a2SYan Zheng btrfs_free_path(path2); 11365d4f98a2SYan Zheng if (err) { 11373fd0a558SYan, Zheng while (!list_empty(&useless)) { 11383fd0a558SYan, Zheng lower = list_entry(useless.next, 113975bfb9afSJosef Bacik struct backref_node, list); 114075bfb9afSJosef Bacik list_del_init(&lower->list); 11413fd0a558SYan, Zheng } 114275bfb9afSJosef Bacik while (!list_empty(&list)) { 114375bfb9afSJosef Bacik edge = list_first_entry(&list, struct backref_edge, 114475bfb9afSJosef Bacik list[UPPER]); 114575bfb9afSJosef Bacik list_del(&edge->list[UPPER]); 11463fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 114775bfb9afSJosef Bacik lower = edge->node[LOWER]; 11485d4f98a2SYan Zheng upper = edge->node[UPPER]; 11493fd0a558SYan, Zheng free_backref_edge(cache, edge); 115075bfb9afSJosef Bacik 115175bfb9afSJosef Bacik /* 115275bfb9afSJosef Bacik * Lower is no longer linked to any upper backref nodes 115375bfb9afSJosef Bacik * and isn't in the cache, we can free it ourselves. 115475bfb9afSJosef Bacik */ 115575bfb9afSJosef Bacik if (list_empty(&lower->upper) && 115675bfb9afSJosef Bacik RB_EMPTY_NODE(&lower->rb_node)) 115775bfb9afSJosef Bacik list_add(&lower->list, &useless); 115875bfb9afSJosef Bacik 115975bfb9afSJosef Bacik if (!RB_EMPTY_NODE(&upper->rb_node)) 116075bfb9afSJosef Bacik continue; 116175bfb9afSJosef Bacik 116275bfb9afSJosef Bacik /* Add this guy's upper edges to the list to proces */ 116375bfb9afSJosef Bacik list_for_each_entry(edge, &upper->upper, list[LOWER]) 116475bfb9afSJosef Bacik list_add_tail(&edge->list[UPPER], &list); 116575bfb9afSJosef Bacik if (list_empty(&upper->upper)) 116675bfb9afSJosef Bacik list_add(&upper->list, &useless); 116775bfb9afSJosef Bacik } 116875bfb9afSJosef Bacik 116975bfb9afSJosef Bacik while (!list_empty(&useless)) { 117075bfb9afSJosef Bacik lower = list_entry(useless.next, 117175bfb9afSJosef Bacik struct backref_node, list); 117275bfb9afSJosef Bacik list_del_init(&lower->list); 117375bfb9afSJosef Bacik free_backref_node(cache, lower); 11745d4f98a2SYan Zheng } 11755d4f98a2SYan Zheng return ERR_PTR(err); 11765d4f98a2SYan Zheng } 117775bfb9afSJosef Bacik ASSERT(!node || !node->detached); 11785d4f98a2SYan Zheng return node; 11795d4f98a2SYan Zheng } 11805d4f98a2SYan Zheng 11815d4f98a2SYan Zheng /* 11823fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 11833fd0a558SYan, Zheng * the backref node is created by cloning backref node that 11843fd0a558SYan, Zheng * corresponds to root of source tree 11853fd0a558SYan, Zheng */ 11863fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 11873fd0a558SYan, Zheng struct reloc_control *rc, 11883fd0a558SYan, Zheng struct btrfs_root *src, 11893fd0a558SYan, Zheng struct btrfs_root *dest) 11903fd0a558SYan, Zheng { 11913fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 11923fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 11933fd0a558SYan, Zheng struct backref_node *node = NULL; 11943fd0a558SYan, Zheng struct backref_node *new_node; 11953fd0a558SYan, Zheng struct backref_edge *edge; 11963fd0a558SYan, Zheng struct backref_edge *new_edge; 11973fd0a558SYan, Zheng struct rb_node *rb_node; 11983fd0a558SYan, Zheng 11993fd0a558SYan, Zheng if (cache->last_trans > 0) 12003fd0a558SYan, Zheng update_backref_cache(trans, cache); 12013fd0a558SYan, Zheng 12023fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 12033fd0a558SYan, Zheng if (rb_node) { 12043fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 12053fd0a558SYan, Zheng if (node->detached) 12063fd0a558SYan, Zheng node = NULL; 12073fd0a558SYan, Zheng else 12083fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 12093fd0a558SYan, Zheng } 12103fd0a558SYan, Zheng 12113fd0a558SYan, Zheng if (!node) { 12123fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 12133fd0a558SYan, Zheng reloc_root->commit_root->start); 12143fd0a558SYan, Zheng if (rb_node) { 12153fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 12163fd0a558SYan, Zheng rb_node); 12173fd0a558SYan, Zheng BUG_ON(node->detached); 12183fd0a558SYan, Zheng } 12193fd0a558SYan, Zheng } 12203fd0a558SYan, Zheng 12213fd0a558SYan, Zheng if (!node) 12223fd0a558SYan, Zheng return 0; 12233fd0a558SYan, Zheng 12243fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 12253fd0a558SYan, Zheng if (!new_node) 12263fd0a558SYan, Zheng return -ENOMEM; 12273fd0a558SYan, Zheng 12283fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 12293fd0a558SYan, Zheng new_node->level = node->level; 12303fd0a558SYan, Zheng new_node->lowest = node->lowest; 12316848ad64SYan, Zheng new_node->checked = 1; 12323fd0a558SYan, Zheng new_node->root = dest; 12333fd0a558SYan, Zheng 12343fd0a558SYan, Zheng if (!node->lowest) { 12353fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 12363fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 12373fd0a558SYan, Zheng if (!new_edge) 12383fd0a558SYan, Zheng goto fail; 12393fd0a558SYan, Zheng 12403fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 12413fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 12423fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 12433fd0a558SYan, Zheng &new_node->lower); 12443fd0a558SYan, Zheng } 124576b9e23dSMiao Xie } else { 124676b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 12473fd0a558SYan, Zheng } 12483fd0a558SYan, Zheng 12493fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 12503fd0a558SYan, Zheng &new_node->rb_node); 125143c04fb1SJeff Mahoney if (rb_node) 125243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 12533fd0a558SYan, Zheng 12543fd0a558SYan, Zheng if (!new_node->lowest) { 12553fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 12563fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 12573fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 12583fd0a558SYan, Zheng } 12593fd0a558SYan, Zheng } 12603fd0a558SYan, Zheng return 0; 12613fd0a558SYan, Zheng fail: 12623fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 12633fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 12643fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 12653fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 12663fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 12673fd0a558SYan, Zheng } 12683fd0a558SYan, Zheng free_backref_node(cache, new_node); 12693fd0a558SYan, Zheng return -ENOMEM; 12703fd0a558SYan, Zheng } 12713fd0a558SYan, Zheng 12723fd0a558SYan, Zheng /* 12735d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 12745d4f98a2SYan Zheng */ 1275ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 12765d4f98a2SYan Zheng { 12775d4f98a2SYan Zheng struct rb_node *rb_node; 12785d4f98a2SYan Zheng struct mapping_node *node; 12795d4f98a2SYan Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 12805d4f98a2SYan Zheng 12815d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1282ffd7b339SJeff Mahoney if (!node) 1283ffd7b339SJeff Mahoney return -ENOMEM; 12845d4f98a2SYan Zheng 12855d4f98a2SYan Zheng node->bytenr = root->node->start; 12865d4f98a2SYan Zheng node->data = root; 12875d4f98a2SYan Zheng 12885d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12895d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 12905d4f98a2SYan Zheng node->bytenr, &node->rb_node); 12915d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1292ffd7b339SJeff Mahoney if (rb_node) { 1293ffd7b339SJeff Mahoney btrfs_panic(root->fs_info, -EEXIST, "Duplicate root found " 1294ffd7b339SJeff Mahoney "for start=%llu while inserting into relocation " 1295351fd353SDavid Sterba "tree", node->bytenr); 129623291a04SDan Carpenter kfree(node); 129723291a04SDan Carpenter return -EEXIST; 1298ffd7b339SJeff Mahoney } 12995d4f98a2SYan Zheng 13005d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 13015d4f98a2SYan Zheng return 0; 13025d4f98a2SYan Zheng } 13035d4f98a2SYan Zheng 13045d4f98a2SYan Zheng /* 1305c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 13065d4f98a2SYan Zheng * mapping 13075d4f98a2SYan Zheng */ 1308c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 13095d4f98a2SYan Zheng { 13105d4f98a2SYan Zheng struct rb_node *rb_node; 13115d4f98a2SYan Zheng struct mapping_node *node = NULL; 13125d4f98a2SYan Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 13135d4f98a2SYan Zheng 13145d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13155d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1316c974c464SWang Shilong root->node->start); 1317c974c464SWang Shilong if (rb_node) { 1318c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1319c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1320c974c464SWang Shilong } 1321c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1322c974c464SWang Shilong 1323c974c464SWang Shilong if (!node) 1324c974c464SWang Shilong return; 1325c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1326c974c464SWang Shilong 1327c974c464SWang Shilong spin_lock(&root->fs_info->trans_lock); 1328c974c464SWang Shilong list_del_init(&root->root_list); 1329c974c464SWang Shilong spin_unlock(&root->fs_info->trans_lock); 1330c974c464SWang Shilong kfree(node); 1331c974c464SWang Shilong } 1332c974c464SWang Shilong 1333c974c464SWang Shilong /* 1334c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1335c974c464SWang Shilong * mapping 1336c974c464SWang Shilong */ 1337c974c464SWang Shilong static int __update_reloc_root(struct btrfs_root *root, u64 new_bytenr) 1338c974c464SWang Shilong { 1339c974c464SWang Shilong struct rb_node *rb_node; 1340c974c464SWang Shilong struct mapping_node *node = NULL; 1341c974c464SWang Shilong struct reloc_control *rc = root->fs_info->reloc_ctl; 1342c974c464SWang Shilong 1343c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1344c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1345c974c464SWang Shilong root->node->start); 13465d4f98a2SYan Zheng if (rb_node) { 13475d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 13485d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 13495d4f98a2SYan Zheng } 13505d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 13515d4f98a2SYan Zheng 13528f71f3e0SLiu Bo if (!node) 13538f71f3e0SLiu Bo return 0; 13545d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 13555d4f98a2SYan Zheng 13565d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1357c974c464SWang Shilong node->bytenr = new_bytenr; 13585d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13595d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13605d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 136143c04fb1SJeff Mahoney if (rb_node) 136243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 13635d4f98a2SYan Zheng return 0; 13645d4f98a2SYan Zheng } 13655d4f98a2SYan Zheng 13663fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 13673fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 13685d4f98a2SYan Zheng { 13695d4f98a2SYan Zheng struct btrfs_root *reloc_root; 13705d4f98a2SYan Zheng struct extent_buffer *eb; 13715d4f98a2SYan Zheng struct btrfs_root_item *root_item; 13725d4f98a2SYan Zheng struct btrfs_key root_key; 13735bc7247aSMiao Xie u64 last_snap = 0; 13745d4f98a2SYan Zheng int ret; 13755d4f98a2SYan Zheng 13765d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 13775d4f98a2SYan Zheng BUG_ON(!root_item); 13785d4f98a2SYan Zheng 13795d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 13805d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 13813fd0a558SYan, Zheng root_key.offset = objectid; 13825d4f98a2SYan Zheng 13833fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 13843fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 13855d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 13865d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 13875d4f98a2SYan Zheng BUG_ON(ret); 13885d4f98a2SYan Zheng 13895bc7247aSMiao Xie last_snap = btrfs_root_last_snapshot(&root->root_item); 13903fd0a558SYan, Zheng btrfs_set_root_last_snapshot(&root->root_item, 13913fd0a558SYan, Zheng trans->transid - 1); 13923fd0a558SYan, Zheng } else { 13933fd0a558SYan, Zheng /* 13943fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 13953fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 13963fd0a558SYan, Zheng * modified after it was created have RELOC flag 13973fd0a558SYan, Zheng * set in their headers. so it's OK to not update 13983fd0a558SYan, Zheng * the 'last_snapshot'. 13993fd0a558SYan, Zheng */ 14003fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 14013fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 14023fd0a558SYan, Zheng BUG_ON(ret); 14033fd0a558SYan, Zheng } 14043fd0a558SYan, Zheng 14055d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 14065d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 14075d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 14085d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 14093fd0a558SYan, Zheng 14103fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 14113fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 14123fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 14133fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 14145d4f98a2SYan Zheng root_item->drop_level = 0; 14155bc7247aSMiao Xie /* 14165bc7247aSMiao Xie * abuse rtransid, it is safe because it is impossible to 14175bc7247aSMiao Xie * receive data into a relocation tree. 14185bc7247aSMiao Xie */ 14195bc7247aSMiao Xie btrfs_set_root_rtransid(root_item, last_snap); 14205bc7247aSMiao Xie btrfs_set_root_otransid(root_item, trans->transid); 14213fd0a558SYan, Zheng } 14225d4f98a2SYan Zheng 14235d4f98a2SYan Zheng btrfs_tree_unlock(eb); 14245d4f98a2SYan Zheng free_extent_buffer(eb); 14255d4f98a2SYan Zheng 14265d4f98a2SYan Zheng ret = btrfs_insert_root(trans, root->fs_info->tree_root, 14275d4f98a2SYan Zheng &root_key, root_item); 14285d4f98a2SYan Zheng BUG_ON(ret); 14295d4f98a2SYan Zheng kfree(root_item); 14305d4f98a2SYan Zheng 1431cb517eabSMiao Xie reloc_root = btrfs_read_fs_root(root->fs_info->tree_root, &root_key); 14325d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 14335d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 14343fd0a558SYan, Zheng return reloc_root; 14353fd0a558SYan, Zheng } 14363fd0a558SYan, Zheng 14373fd0a558SYan, Zheng /* 14383fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 14393fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 14403fd0a558SYan, Zheng */ 14413fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 14423fd0a558SYan, Zheng struct btrfs_root *root) 14433fd0a558SYan, Zheng { 14443fd0a558SYan, Zheng struct btrfs_root *reloc_root; 14453fd0a558SYan, Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 144620dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 14473fd0a558SYan, Zheng int clear_rsv = 0; 1448ffd7b339SJeff Mahoney int ret; 14493fd0a558SYan, Zheng 14503fd0a558SYan, Zheng if (root->reloc_root) { 14513fd0a558SYan, Zheng reloc_root = root->reloc_root; 14523fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 14533fd0a558SYan, Zheng return 0; 14543fd0a558SYan, Zheng } 14553fd0a558SYan, Zheng 14563fd0a558SYan, Zheng if (!rc || !rc->create_reloc_tree || 14573fd0a558SYan, Zheng root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 14583fd0a558SYan, Zheng return 0; 14593fd0a558SYan, Zheng 146020dd2cbfSMiao Xie if (!trans->reloc_reserved) { 146120dd2cbfSMiao Xie rsv = trans->block_rsv; 14623fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 14633fd0a558SYan, Zheng clear_rsv = 1; 14643fd0a558SYan, Zheng } 14653fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 14663fd0a558SYan, Zheng if (clear_rsv) 146720dd2cbfSMiao Xie trans->block_rsv = rsv; 14685d4f98a2SYan Zheng 1469ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1470ffd7b339SJeff Mahoney BUG_ON(ret < 0); 14715d4f98a2SYan Zheng root->reloc_root = reloc_root; 14725d4f98a2SYan Zheng return 0; 14735d4f98a2SYan Zheng } 14745d4f98a2SYan Zheng 14755d4f98a2SYan Zheng /* 14765d4f98a2SYan Zheng * update root item of reloc tree 14775d4f98a2SYan Zheng */ 14785d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 14795d4f98a2SYan Zheng struct btrfs_root *root) 14805d4f98a2SYan Zheng { 14815d4f98a2SYan Zheng struct btrfs_root *reloc_root; 14825d4f98a2SYan Zheng struct btrfs_root_item *root_item; 14835d4f98a2SYan Zheng int ret; 14845d4f98a2SYan Zheng 14855d4f98a2SYan Zheng if (!root->reloc_root) 14867585717fSChris Mason goto out; 14875d4f98a2SYan Zheng 14885d4f98a2SYan Zheng reloc_root = root->reloc_root; 14895d4f98a2SYan Zheng root_item = &reloc_root->root_item; 14905d4f98a2SYan Zheng 14913fd0a558SYan, Zheng if (root->fs_info->reloc_ctl->merge_reloc_tree && 14923fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 14935d4f98a2SYan Zheng root->reloc_root = NULL; 1494c974c464SWang Shilong __del_reloc_root(reloc_root); 14955d4f98a2SYan Zheng } 14965d4f98a2SYan Zheng 14975d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 14985d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 14995d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 15005d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 15015d4f98a2SYan Zheng } 15025d4f98a2SYan Zheng 15035d4f98a2SYan Zheng ret = btrfs_update_root(trans, root->fs_info->tree_root, 15045d4f98a2SYan Zheng &reloc_root->root_key, root_item); 15055d4f98a2SYan Zheng BUG_ON(ret); 15067585717fSChris Mason 15077585717fSChris Mason out: 15085d4f98a2SYan Zheng return 0; 15095d4f98a2SYan Zheng } 15105d4f98a2SYan Zheng 15115d4f98a2SYan Zheng /* 15125d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 15135d4f98a2SYan Zheng * in a subvolume 15145d4f98a2SYan Zheng */ 15155d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 15165d4f98a2SYan Zheng { 15175d4f98a2SYan Zheng struct rb_node *node; 15185d4f98a2SYan Zheng struct rb_node *prev; 15195d4f98a2SYan Zheng struct btrfs_inode *entry; 15205d4f98a2SYan Zheng struct inode *inode; 15215d4f98a2SYan Zheng 15225d4f98a2SYan Zheng spin_lock(&root->inode_lock); 15235d4f98a2SYan Zheng again: 15245d4f98a2SYan Zheng node = root->inode_tree.rb_node; 15255d4f98a2SYan Zheng prev = NULL; 15265d4f98a2SYan Zheng while (node) { 15275d4f98a2SYan Zheng prev = node; 15285d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 15295d4f98a2SYan Zheng 153033345d01SLi Zefan if (objectid < btrfs_ino(&entry->vfs_inode)) 15315d4f98a2SYan Zheng node = node->rb_left; 153233345d01SLi Zefan else if (objectid > btrfs_ino(&entry->vfs_inode)) 15335d4f98a2SYan Zheng node = node->rb_right; 15345d4f98a2SYan Zheng else 15355d4f98a2SYan Zheng break; 15365d4f98a2SYan Zheng } 15375d4f98a2SYan Zheng if (!node) { 15385d4f98a2SYan Zheng while (prev) { 15395d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 154033345d01SLi Zefan if (objectid <= btrfs_ino(&entry->vfs_inode)) { 15415d4f98a2SYan Zheng node = prev; 15425d4f98a2SYan Zheng break; 15435d4f98a2SYan Zheng } 15445d4f98a2SYan Zheng prev = rb_next(prev); 15455d4f98a2SYan Zheng } 15465d4f98a2SYan Zheng } 15475d4f98a2SYan Zheng while (node) { 15485d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 15495d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 15505d4f98a2SYan Zheng if (inode) { 15515d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15525d4f98a2SYan Zheng return inode; 15535d4f98a2SYan Zheng } 15545d4f98a2SYan Zheng 155533345d01SLi Zefan objectid = btrfs_ino(&entry->vfs_inode) + 1; 15565d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 15575d4f98a2SYan Zheng goto again; 15585d4f98a2SYan Zheng 15595d4f98a2SYan Zheng node = rb_next(node); 15605d4f98a2SYan Zheng } 15615d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15625d4f98a2SYan Zheng return NULL; 15635d4f98a2SYan Zheng } 15645d4f98a2SYan Zheng 15655d4f98a2SYan Zheng static int in_block_group(u64 bytenr, 15665d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group) 15675d4f98a2SYan Zheng { 15685d4f98a2SYan Zheng if (bytenr >= block_group->key.objectid && 15695d4f98a2SYan Zheng bytenr < block_group->key.objectid + block_group->key.offset) 15705d4f98a2SYan Zheng return 1; 15715d4f98a2SYan Zheng return 0; 15725d4f98a2SYan Zheng } 15735d4f98a2SYan Zheng 15745d4f98a2SYan Zheng /* 15755d4f98a2SYan Zheng * get new location of data 15765d4f98a2SYan Zheng */ 15775d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 15785d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 15795d4f98a2SYan Zheng { 15805d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 15815d4f98a2SYan Zheng struct btrfs_path *path; 15825d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 15835d4f98a2SYan Zheng struct extent_buffer *leaf; 15845d4f98a2SYan Zheng int ret; 15855d4f98a2SYan Zheng 15865d4f98a2SYan Zheng path = btrfs_alloc_path(); 15875d4f98a2SYan Zheng if (!path) 15885d4f98a2SYan Zheng return -ENOMEM; 15895d4f98a2SYan Zheng 15905d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 159133345d01SLi Zefan ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(reloc_inode), 15925d4f98a2SYan Zheng bytenr, 0); 15935d4f98a2SYan Zheng if (ret < 0) 15945d4f98a2SYan Zheng goto out; 15955d4f98a2SYan Zheng if (ret > 0) { 15965d4f98a2SYan Zheng ret = -ENOENT; 15975d4f98a2SYan Zheng goto out; 15985d4f98a2SYan Zheng } 15995d4f98a2SYan Zheng 16005d4f98a2SYan Zheng leaf = path->nodes[0]; 16015d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 16025d4f98a2SYan Zheng struct btrfs_file_extent_item); 16035d4f98a2SYan Zheng 16045d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 16055d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 16065d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 16075d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 16085d4f98a2SYan Zheng 16095d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 161083d4cfd4SJosef Bacik ret = -EINVAL; 16115d4f98a2SYan Zheng goto out; 16125d4f98a2SYan Zheng } 16135d4f98a2SYan Zheng 16145d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16155d4f98a2SYan Zheng ret = 0; 16165d4f98a2SYan Zheng out: 16175d4f98a2SYan Zheng btrfs_free_path(path); 16185d4f98a2SYan Zheng return ret; 16195d4f98a2SYan Zheng } 16205d4f98a2SYan Zheng 16215d4f98a2SYan Zheng /* 16225d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 16235d4f98a2SYan Zheng * the new locations. 16245d4f98a2SYan Zheng */ 16253fd0a558SYan, Zheng static noinline_for_stack 16263fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 16275d4f98a2SYan Zheng struct reloc_control *rc, 16285d4f98a2SYan Zheng struct btrfs_root *root, 16293fd0a558SYan, Zheng struct extent_buffer *leaf) 16305d4f98a2SYan Zheng { 16315d4f98a2SYan Zheng struct btrfs_key key; 16325d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 16335d4f98a2SYan Zheng struct inode *inode = NULL; 16345d4f98a2SYan Zheng u64 parent; 16355d4f98a2SYan Zheng u64 bytenr; 16363fd0a558SYan, Zheng u64 new_bytenr = 0; 16375d4f98a2SYan Zheng u64 num_bytes; 16385d4f98a2SYan Zheng u64 end; 16395d4f98a2SYan Zheng u32 nritems; 16405d4f98a2SYan Zheng u32 i; 164183d4cfd4SJosef Bacik int ret = 0; 16425d4f98a2SYan Zheng int first = 1; 16435d4f98a2SYan Zheng int dirty = 0; 16445d4f98a2SYan Zheng 16455d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 16465d4f98a2SYan Zheng return 0; 16475d4f98a2SYan Zheng 16485d4f98a2SYan Zheng /* reloc trees always use full backref */ 16495d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 16505d4f98a2SYan Zheng parent = leaf->start; 16515d4f98a2SYan Zheng else 16525d4f98a2SYan Zheng parent = 0; 16535d4f98a2SYan Zheng 16545d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 16555d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 16565d4f98a2SYan Zheng cond_resched(); 16575d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 16585d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 16595d4f98a2SYan Zheng continue; 16605d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 16615d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 16625d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 16635d4f98a2SYan Zheng continue; 16645d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16655d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 16665d4f98a2SYan Zheng if (bytenr == 0) 16675d4f98a2SYan Zheng continue; 16685d4f98a2SYan Zheng if (!in_block_group(bytenr, rc->block_group)) 16695d4f98a2SYan Zheng continue; 16705d4f98a2SYan Zheng 16715d4f98a2SYan Zheng /* 16725d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 16735d4f98a2SYan Zheng * to complete and drop the extent cache 16745d4f98a2SYan Zheng */ 16755d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 16765d4f98a2SYan Zheng if (first) { 16775d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16785d4f98a2SYan Zheng first = 0; 167933345d01SLi Zefan } else if (inode && btrfs_ino(inode) < key.objectid) { 16803fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 16815d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16825d4f98a2SYan Zheng } 168333345d01SLi Zefan if (inode && btrfs_ino(inode) == key.objectid) { 16845d4f98a2SYan Zheng end = key.offset + 16855d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 16865d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 16875d4f98a2SYan Zheng root->sectorsize)); 16885d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(end, root->sectorsize)); 16895d4f98a2SYan Zheng end--; 16905d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1691d0082371SJeff Mahoney key.offset, end); 16925d4f98a2SYan Zheng if (!ret) 16935d4f98a2SYan Zheng continue; 16945d4f98a2SYan Zheng 16955d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, key.offset, end, 16965d4f98a2SYan Zheng 1); 16975d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1698d0082371SJeff Mahoney key.offset, end); 16995d4f98a2SYan Zheng } 17005d4f98a2SYan Zheng } 17015d4f98a2SYan Zheng 17025d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 17035d4f98a2SYan Zheng bytenr, num_bytes); 170483d4cfd4SJosef Bacik if (ret) { 170583d4cfd4SJosef Bacik /* 170683d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 170783d4cfd4SJosef Bacik * in the file extent yet. 170883d4cfd4SJosef Bacik */ 170983d4cfd4SJosef Bacik break; 17103fd0a558SYan, Zheng } 17115d4f98a2SYan Zheng 17125d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 17135d4f98a2SYan Zheng dirty = 1; 17145d4f98a2SYan Zheng 17155d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 17165d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, root, new_bytenr, 17175d4f98a2SYan Zheng num_bytes, parent, 17185d4f98a2SYan Zheng btrfs_header_owner(leaf), 171966d7e7f0SArne Jansen key.objectid, key.offset, 1); 172083d4cfd4SJosef Bacik if (ret) { 172183d4cfd4SJosef Bacik btrfs_abort_transaction(trans, root, ret); 172283d4cfd4SJosef Bacik break; 172383d4cfd4SJosef Bacik } 17245d4f98a2SYan Zheng 17255d4f98a2SYan Zheng ret = btrfs_free_extent(trans, root, bytenr, num_bytes, 17265d4f98a2SYan Zheng parent, btrfs_header_owner(leaf), 172766d7e7f0SArne Jansen key.objectid, key.offset, 1); 172883d4cfd4SJosef Bacik if (ret) { 172983d4cfd4SJosef Bacik btrfs_abort_transaction(trans, root, ret); 173083d4cfd4SJosef Bacik break; 173183d4cfd4SJosef Bacik } 17325d4f98a2SYan Zheng } 17335d4f98a2SYan Zheng if (dirty) 17345d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 17353fd0a558SYan, Zheng if (inode) 17363fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 173783d4cfd4SJosef Bacik return ret; 17385d4f98a2SYan Zheng } 17395d4f98a2SYan Zheng 17405d4f98a2SYan Zheng static noinline_for_stack 17415d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 17425d4f98a2SYan Zheng struct btrfs_path *path, int level) 17435d4f98a2SYan Zheng { 17445d4f98a2SYan Zheng struct btrfs_disk_key key1; 17455d4f98a2SYan Zheng struct btrfs_disk_key key2; 17465d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 17475d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 17485d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 17495d4f98a2SYan Zheng } 17505d4f98a2SYan Zheng 17515d4f98a2SYan Zheng /* 17525d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 17535d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 17545d4f98a2SYan Zheng * reloc tree was create can be replaced. 17555d4f98a2SYan Zheng * 17565d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 17575d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 17585d4f98a2SYan Zheng * errors, a negative error number is returned. 17595d4f98a2SYan Zheng */ 17603fd0a558SYan, Zheng static noinline_for_stack 17613fd0a558SYan, Zheng int replace_path(struct btrfs_trans_handle *trans, 17625d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 17635d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 17645d4f98a2SYan Zheng int lowest_level, int max_level) 17655d4f98a2SYan Zheng { 17665d4f98a2SYan Zheng struct extent_buffer *eb; 17675d4f98a2SYan Zheng struct extent_buffer *parent; 17685d4f98a2SYan Zheng struct btrfs_key key; 17695d4f98a2SYan Zheng u64 old_bytenr; 17705d4f98a2SYan Zheng u64 new_bytenr; 17715d4f98a2SYan Zheng u64 old_ptr_gen; 17725d4f98a2SYan Zheng u64 new_ptr_gen; 17735d4f98a2SYan Zheng u64 last_snapshot; 17745d4f98a2SYan Zheng u32 blocksize; 17753fd0a558SYan, Zheng int cow = 0; 17765d4f98a2SYan Zheng int level; 17775d4f98a2SYan Zheng int ret; 17785d4f98a2SYan Zheng int slot; 17795d4f98a2SYan Zheng 17805d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 17815d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 17825d4f98a2SYan Zheng 17835d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 17843fd0a558SYan, Zheng again: 17855d4f98a2SYan Zheng slot = path->slots[lowest_level]; 17865d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 17875d4f98a2SYan Zheng 17885d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 17895d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 17905d4f98a2SYan Zheng level = btrfs_header_level(eb); 17915d4f98a2SYan Zheng 17925d4f98a2SYan Zheng if (level < lowest_level) { 17935d4f98a2SYan Zheng btrfs_tree_unlock(eb); 17945d4f98a2SYan Zheng free_extent_buffer(eb); 17955d4f98a2SYan Zheng return 0; 17965d4f98a2SYan Zheng } 17975d4f98a2SYan Zheng 17983fd0a558SYan, Zheng if (cow) { 17995d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 18005d4f98a2SYan Zheng BUG_ON(ret); 18013fd0a558SYan, Zheng } 18025d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 18035d4f98a2SYan Zheng 18045d4f98a2SYan Zheng if (next_key) { 18055d4f98a2SYan Zheng next_key->objectid = (u64)-1; 18065d4f98a2SYan Zheng next_key->type = (u8)-1; 18075d4f98a2SYan Zheng next_key->offset = (u64)-1; 18085d4f98a2SYan Zheng } 18095d4f98a2SYan Zheng 18105d4f98a2SYan Zheng parent = eb; 18115d4f98a2SYan Zheng while (1) { 18125d4f98a2SYan Zheng level = btrfs_header_level(parent); 18135d4f98a2SYan Zheng BUG_ON(level < lowest_level); 18145d4f98a2SYan Zheng 18155d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 18165d4f98a2SYan Zheng if (ret && slot > 0) 18175d4f98a2SYan Zheng slot--; 18185d4f98a2SYan Zheng 18195d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 18205d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 18215d4f98a2SYan Zheng 18225d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 1823707e8a07SDavid Sterba blocksize = dest->nodesize; 18245d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 18255d4f98a2SYan Zheng 18265d4f98a2SYan Zheng if (level <= max_level) { 18275d4f98a2SYan Zheng eb = path->nodes[level]; 18285d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 18295d4f98a2SYan Zheng path->slots[level]); 18305d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 18315d4f98a2SYan Zheng path->slots[level]); 18325d4f98a2SYan Zheng } else { 18335d4f98a2SYan Zheng new_bytenr = 0; 18345d4f98a2SYan Zheng new_ptr_gen = 0; 18355d4f98a2SYan Zheng } 18365d4f98a2SYan Zheng 1837fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 18385d4f98a2SYan Zheng ret = level; 18395d4f98a2SYan Zheng break; 18405d4f98a2SYan Zheng } 18415d4f98a2SYan Zheng 18425d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 18435d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 18443fd0a558SYan, Zheng if (level <= lowest_level) { 18455d4f98a2SYan Zheng ret = 0; 18465d4f98a2SYan Zheng break; 18475d4f98a2SYan Zheng } 18485d4f98a2SYan Zheng 18495d4f98a2SYan Zheng eb = read_tree_block(dest, old_bytenr, blocksize, 18505d4f98a2SYan Zheng old_ptr_gen); 1851416bc658SJosef Bacik if (!eb || !extent_buffer_uptodate(eb)) { 1852416bc658SJosef Bacik ret = (!eb) ? -ENOMEM : -EIO; 1853416bc658SJosef Bacik free_extent_buffer(eb); 1854379cde74SStefan Behrens break; 1855416bc658SJosef Bacik } 18565d4f98a2SYan Zheng btrfs_tree_lock(eb); 18573fd0a558SYan, Zheng if (cow) { 18585d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 18595d4f98a2SYan Zheng slot, &eb); 18605d4f98a2SYan Zheng BUG_ON(ret); 18615d4f98a2SYan Zheng } 18623fd0a558SYan, Zheng btrfs_set_lock_blocking(eb); 18635d4f98a2SYan Zheng 18645d4f98a2SYan Zheng btrfs_tree_unlock(parent); 18655d4f98a2SYan Zheng free_extent_buffer(parent); 18665d4f98a2SYan Zheng 18675d4f98a2SYan Zheng parent = eb; 18685d4f98a2SYan Zheng continue; 18695d4f98a2SYan Zheng } 18705d4f98a2SYan Zheng 18713fd0a558SYan, Zheng if (!cow) { 18723fd0a558SYan, Zheng btrfs_tree_unlock(parent); 18733fd0a558SYan, Zheng free_extent_buffer(parent); 18743fd0a558SYan, Zheng cow = 1; 18753fd0a558SYan, Zheng goto again; 18763fd0a558SYan, Zheng } 18773fd0a558SYan, Zheng 18785d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 18795d4f98a2SYan Zheng path->slots[level]); 1880b3b4aa74SDavid Sterba btrfs_release_path(path); 18815d4f98a2SYan Zheng 18825d4f98a2SYan Zheng path->lowest_level = level; 18835d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 18845d4f98a2SYan Zheng path->lowest_level = 0; 18855d4f98a2SYan Zheng BUG_ON(ret); 18865d4f98a2SYan Zheng 18875d4f98a2SYan Zheng /* 18885d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 18895d4f98a2SYan Zheng */ 18905d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 18915d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 18925d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 18935d4f98a2SYan Zheng 18945d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 18955d4f98a2SYan Zheng path->slots[level], old_bytenr); 18965d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 18975d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 18985d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 18995d4f98a2SYan Zheng 19005d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, src, old_bytenr, blocksize, 19015d4f98a2SYan Zheng path->nodes[level]->start, 190266d7e7f0SArne Jansen src->root_key.objectid, level - 1, 0, 190366d7e7f0SArne Jansen 1); 19045d4f98a2SYan Zheng BUG_ON(ret); 19055d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, dest, new_bytenr, blocksize, 19065d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 190766d7e7f0SArne Jansen 0, 1); 19085d4f98a2SYan Zheng BUG_ON(ret); 19095d4f98a2SYan Zheng 19105d4f98a2SYan Zheng ret = btrfs_free_extent(trans, src, new_bytenr, blocksize, 19115d4f98a2SYan Zheng path->nodes[level]->start, 191266d7e7f0SArne Jansen src->root_key.objectid, level - 1, 0, 191366d7e7f0SArne Jansen 1); 19145d4f98a2SYan Zheng BUG_ON(ret); 19155d4f98a2SYan Zheng 19165d4f98a2SYan Zheng ret = btrfs_free_extent(trans, dest, old_bytenr, blocksize, 19175d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 191866d7e7f0SArne Jansen 0, 1); 19195d4f98a2SYan Zheng BUG_ON(ret); 19205d4f98a2SYan Zheng 19215d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 19225d4f98a2SYan Zheng 19235d4f98a2SYan Zheng ret = level; 19245d4f98a2SYan Zheng break; 19255d4f98a2SYan Zheng } 19265d4f98a2SYan Zheng btrfs_tree_unlock(parent); 19275d4f98a2SYan Zheng free_extent_buffer(parent); 19285d4f98a2SYan Zheng return ret; 19295d4f98a2SYan Zheng } 19305d4f98a2SYan Zheng 19315d4f98a2SYan Zheng /* 19325d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 19335d4f98a2SYan Zheng */ 19345d4f98a2SYan Zheng static noinline_for_stack 19355d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 19365d4f98a2SYan Zheng int *level) 19375d4f98a2SYan Zheng { 19385d4f98a2SYan Zheng struct extent_buffer *eb; 19395d4f98a2SYan Zheng int i; 19405d4f98a2SYan Zheng u64 last_snapshot; 19415d4f98a2SYan Zheng u32 nritems; 19425d4f98a2SYan Zheng 19435d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19445d4f98a2SYan Zheng 19455d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 19465d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19475d4f98a2SYan Zheng path->nodes[i] = NULL; 19485d4f98a2SYan Zheng } 19495d4f98a2SYan Zheng 19505d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 19515d4f98a2SYan Zheng eb = path->nodes[i]; 19525d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 19535d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 19545d4f98a2SYan Zheng path->slots[i]++; 19555d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 19565d4f98a2SYan Zheng last_snapshot) 19575d4f98a2SYan Zheng continue; 19585d4f98a2SYan Zheng 19595d4f98a2SYan Zheng *level = i; 19605d4f98a2SYan Zheng return 0; 19615d4f98a2SYan Zheng } 19625d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19635d4f98a2SYan Zheng path->nodes[i] = NULL; 19645d4f98a2SYan Zheng } 19655d4f98a2SYan Zheng return 1; 19665d4f98a2SYan Zheng } 19675d4f98a2SYan Zheng 19685d4f98a2SYan Zheng /* 19695d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 19705d4f98a2SYan Zheng */ 19715d4f98a2SYan Zheng static noinline_for_stack 19725d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 19735d4f98a2SYan Zheng int *level) 19745d4f98a2SYan Zheng { 19755d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 19765d4f98a2SYan Zheng int i; 19775d4f98a2SYan Zheng u64 bytenr; 19785d4f98a2SYan Zheng u64 ptr_gen = 0; 19795d4f98a2SYan Zheng u64 last_snapshot; 19805d4f98a2SYan Zheng u32 blocksize; 19815d4f98a2SYan Zheng u32 nritems; 19825d4f98a2SYan Zheng 19835d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19845d4f98a2SYan Zheng 19855d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 19865d4f98a2SYan Zheng eb = path->nodes[i]; 19875d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 19885d4f98a2SYan Zheng while (path->slots[i] < nritems) { 19895d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 19905d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 19915d4f98a2SYan Zheng break; 19925d4f98a2SYan Zheng path->slots[i]++; 19935d4f98a2SYan Zheng } 19945d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 19955d4f98a2SYan Zheng if (i == *level) 19965d4f98a2SYan Zheng break; 19975d4f98a2SYan Zheng *level = i + 1; 19985d4f98a2SYan Zheng return 0; 19995d4f98a2SYan Zheng } 20005d4f98a2SYan Zheng if (i == 1) { 20015d4f98a2SYan Zheng *level = i; 20025d4f98a2SYan Zheng return 0; 20035d4f98a2SYan Zheng } 20045d4f98a2SYan Zheng 20055d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2006707e8a07SDavid Sterba blocksize = root->nodesize; 20075d4f98a2SYan Zheng eb = read_tree_block(root, bytenr, blocksize, ptr_gen); 2008416bc658SJosef Bacik if (!eb || !extent_buffer_uptodate(eb)) { 2009416bc658SJosef Bacik free_extent_buffer(eb); 2010416bc658SJosef Bacik return -EIO; 2011416bc658SJosef Bacik } 20125d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 20135d4f98a2SYan Zheng path->nodes[i - 1] = eb; 20145d4f98a2SYan Zheng path->slots[i - 1] = 0; 20155d4f98a2SYan Zheng } 20165d4f98a2SYan Zheng return 1; 20175d4f98a2SYan Zheng } 20185d4f98a2SYan Zheng 20195d4f98a2SYan Zheng /* 20205d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 20215d4f98a2SYan Zheng * [min_key, max_key) 20225d4f98a2SYan Zheng */ 20235d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 20245d4f98a2SYan Zheng struct btrfs_key *min_key, 20255d4f98a2SYan Zheng struct btrfs_key *max_key) 20265d4f98a2SYan Zheng { 20275d4f98a2SYan Zheng struct inode *inode = NULL; 20285d4f98a2SYan Zheng u64 objectid; 20295d4f98a2SYan Zheng u64 start, end; 203033345d01SLi Zefan u64 ino; 20315d4f98a2SYan Zheng 20325d4f98a2SYan Zheng objectid = min_key->objectid; 20335d4f98a2SYan Zheng while (1) { 20345d4f98a2SYan Zheng cond_resched(); 20355d4f98a2SYan Zheng iput(inode); 20365d4f98a2SYan Zheng 20375d4f98a2SYan Zheng if (objectid > max_key->objectid) 20385d4f98a2SYan Zheng break; 20395d4f98a2SYan Zheng 20405d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 20415d4f98a2SYan Zheng if (!inode) 20425d4f98a2SYan Zheng break; 204333345d01SLi Zefan ino = btrfs_ino(inode); 20445d4f98a2SYan Zheng 204533345d01SLi Zefan if (ino > max_key->objectid) { 20465d4f98a2SYan Zheng iput(inode); 20475d4f98a2SYan Zheng break; 20485d4f98a2SYan Zheng } 20495d4f98a2SYan Zheng 205033345d01SLi Zefan objectid = ino + 1; 20515d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 20525d4f98a2SYan Zheng continue; 20535d4f98a2SYan Zheng 205433345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 20555d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 20565d4f98a2SYan Zheng continue; 20575d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 20585d4f98a2SYan Zheng start = 0; 20595d4f98a2SYan Zheng else { 20605d4f98a2SYan Zheng start = min_key->offset; 20615d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(start, root->sectorsize)); 20625d4f98a2SYan Zheng } 20635d4f98a2SYan Zheng } else { 20645d4f98a2SYan Zheng start = 0; 20655d4f98a2SYan Zheng } 20665d4f98a2SYan Zheng 206733345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 20685d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 20695d4f98a2SYan Zheng continue; 20705d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 20715d4f98a2SYan Zheng end = (u64)-1; 20725d4f98a2SYan Zheng } else { 20735d4f98a2SYan Zheng if (max_key->offset == 0) 20745d4f98a2SYan Zheng continue; 20755d4f98a2SYan Zheng end = max_key->offset; 20765d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(end, root->sectorsize)); 20775d4f98a2SYan Zheng end--; 20785d4f98a2SYan Zheng } 20795d4f98a2SYan Zheng } else { 20805d4f98a2SYan Zheng end = (u64)-1; 20815d4f98a2SYan Zheng } 20825d4f98a2SYan Zheng 20835d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2084d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 20855d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, start, end, 1); 2086d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 20875d4f98a2SYan Zheng } 20885d4f98a2SYan Zheng return 0; 20895d4f98a2SYan Zheng } 20905d4f98a2SYan Zheng 20915d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 20925d4f98a2SYan Zheng struct btrfs_key *key) 20935d4f98a2SYan Zheng 20945d4f98a2SYan Zheng { 20955d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 20965d4f98a2SYan Zheng if (!path->nodes[level]) 20975d4f98a2SYan Zheng break; 20985d4f98a2SYan Zheng if (path->slots[level] + 1 < 20995d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 21005d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 21015d4f98a2SYan Zheng path->slots[level] + 1); 21025d4f98a2SYan Zheng return 0; 21035d4f98a2SYan Zheng } 21045d4f98a2SYan Zheng level++; 21055d4f98a2SYan Zheng } 21065d4f98a2SYan Zheng return 1; 21075d4f98a2SYan Zheng } 21085d4f98a2SYan Zheng 21095d4f98a2SYan Zheng /* 21105d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 21115d4f98a2SYan Zheng * fs tree. 21125d4f98a2SYan Zheng */ 21135d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 21145d4f98a2SYan Zheng struct btrfs_root *root) 21155d4f98a2SYan Zheng { 21165d4f98a2SYan Zheng LIST_HEAD(inode_list); 21175d4f98a2SYan Zheng struct btrfs_key key; 21185d4f98a2SYan Zheng struct btrfs_key next_key; 21199e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 21205d4f98a2SYan Zheng struct btrfs_root *reloc_root; 21215d4f98a2SYan Zheng struct btrfs_root_item *root_item; 21225d4f98a2SYan Zheng struct btrfs_path *path; 21233fd0a558SYan, Zheng struct extent_buffer *leaf; 21245d4f98a2SYan Zheng int level; 21255d4f98a2SYan Zheng int max_level; 21265d4f98a2SYan Zheng int replaced = 0; 21275d4f98a2SYan Zheng int ret; 21285d4f98a2SYan Zheng int err = 0; 21293fd0a558SYan, Zheng u32 min_reserved; 21305d4f98a2SYan Zheng 21315d4f98a2SYan Zheng path = btrfs_alloc_path(); 21325d4f98a2SYan Zheng if (!path) 21335d4f98a2SYan Zheng return -ENOMEM; 2134026fd317SJosef Bacik path->reada = 1; 21355d4f98a2SYan Zheng 21365d4f98a2SYan Zheng reloc_root = root->reloc_root; 21375d4f98a2SYan Zheng root_item = &reloc_root->root_item; 21385d4f98a2SYan Zheng 21395d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 21405d4f98a2SYan Zheng level = btrfs_root_level(root_item); 21415d4f98a2SYan Zheng extent_buffer_get(reloc_root->node); 21425d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 21435d4f98a2SYan Zheng path->slots[level] = 0; 21445d4f98a2SYan Zheng } else { 21455d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 21465d4f98a2SYan Zheng 21475d4f98a2SYan Zheng level = root_item->drop_level; 21485d4f98a2SYan Zheng BUG_ON(level == 0); 21495d4f98a2SYan Zheng path->lowest_level = level; 21505d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 215133c66f43SYan Zheng path->lowest_level = 0; 21525d4f98a2SYan Zheng if (ret < 0) { 21535d4f98a2SYan Zheng btrfs_free_path(path); 21545d4f98a2SYan Zheng return ret; 21555d4f98a2SYan Zheng } 21565d4f98a2SYan Zheng 21575d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 21585d4f98a2SYan Zheng path->slots[level]); 21595d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 21605d4f98a2SYan Zheng 21615d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 21625d4f98a2SYan Zheng } 21635d4f98a2SYan Zheng 21643fd0a558SYan, Zheng min_reserved = root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 21655d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 21665d4f98a2SYan Zheng 21675d4f98a2SYan Zheng while (1) { 216808e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 216908e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 21703fd0a558SYan, Zheng if (ret) { 21719e6a0c52SJosef Bacik err = ret; 21729e6a0c52SJosef Bacik goto out; 21733fd0a558SYan, Zheng } 21749e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 21759e6a0c52SJosef Bacik if (IS_ERR(trans)) { 21769e6a0c52SJosef Bacik err = PTR_ERR(trans); 21779e6a0c52SJosef Bacik trans = NULL; 21789e6a0c52SJosef Bacik goto out; 21799e6a0c52SJosef Bacik } 21809e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 21813fd0a558SYan, Zheng 21823fd0a558SYan, Zheng replaced = 0; 21835d4f98a2SYan Zheng max_level = level; 21845d4f98a2SYan Zheng 21855d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 21865d4f98a2SYan Zheng if (ret < 0) { 21875d4f98a2SYan Zheng err = ret; 21885d4f98a2SYan Zheng goto out; 21895d4f98a2SYan Zheng } 21905d4f98a2SYan Zheng if (ret > 0) 21915d4f98a2SYan Zheng break; 21925d4f98a2SYan Zheng 21935d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 21945d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 21955d4f98a2SYan Zheng ret = 0; 21965d4f98a2SYan Zheng } else { 21973fd0a558SYan, Zheng ret = replace_path(trans, root, reloc_root, path, 21983fd0a558SYan, Zheng &next_key, level, max_level); 21995d4f98a2SYan Zheng } 22005d4f98a2SYan Zheng if (ret < 0) { 22015d4f98a2SYan Zheng err = ret; 22025d4f98a2SYan Zheng goto out; 22035d4f98a2SYan Zheng } 22045d4f98a2SYan Zheng 22055d4f98a2SYan Zheng if (ret > 0) { 22065d4f98a2SYan Zheng level = ret; 22075d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 22085d4f98a2SYan Zheng path->slots[level]); 22095d4f98a2SYan Zheng replaced = 1; 22105d4f98a2SYan Zheng } 22115d4f98a2SYan Zheng 22125d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 22135d4f98a2SYan Zheng if (ret > 0) 22145d4f98a2SYan Zheng break; 22155d4f98a2SYan Zheng 22165d4f98a2SYan Zheng BUG_ON(level == 0); 22175d4f98a2SYan Zheng /* 22185d4f98a2SYan Zheng * save the merging progress in the drop_progress. 22195d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 22205d4f98a2SYan Zheng */ 22215d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 22225d4f98a2SYan Zheng path->slots[level]); 22235d4f98a2SYan Zheng root_item->drop_level = level; 22245d4f98a2SYan Zheng 22253fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, root); 22269e6a0c52SJosef Bacik trans = NULL; 22275d4f98a2SYan Zheng 2228b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 22295d4f98a2SYan Zheng 22305d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 22315d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 22325d4f98a2SYan Zheng } 22335d4f98a2SYan Zheng 22345d4f98a2SYan Zheng /* 22355d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 22365d4f98a2SYan Zheng * relocated and the block is tree root. 22375d4f98a2SYan Zheng */ 22385d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 22395d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 22405d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 22415d4f98a2SYan Zheng free_extent_buffer(leaf); 22425d4f98a2SYan Zheng if (ret < 0) 22435d4f98a2SYan Zheng err = ret; 22445d4f98a2SYan Zheng out: 22455d4f98a2SYan Zheng btrfs_free_path(path); 22465d4f98a2SYan Zheng 22475d4f98a2SYan Zheng if (err == 0) { 22485d4f98a2SYan Zheng memset(&root_item->drop_progress, 0, 22495d4f98a2SYan Zheng sizeof(root_item->drop_progress)); 22505d4f98a2SYan Zheng root_item->drop_level = 0; 22515d4f98a2SYan Zheng btrfs_set_root_refs(root_item, 0); 22523fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 22535d4f98a2SYan Zheng } 22545d4f98a2SYan Zheng 22559e6a0c52SJosef Bacik if (trans) 22563fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, root); 22575d4f98a2SYan Zheng 2258b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 22595d4f98a2SYan Zheng 22605d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 22615d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 22625d4f98a2SYan Zheng 22635d4f98a2SYan Zheng return err; 22645d4f98a2SYan Zheng } 22655d4f98a2SYan Zheng 22663fd0a558SYan, Zheng static noinline_for_stack 22673fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 22685d4f98a2SYan Zheng { 22693fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 22703fd0a558SYan, Zheng struct btrfs_root *reloc_root; 22715d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 22723fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 22733fd0a558SYan, Zheng u64 num_bytes = 0; 22743fd0a558SYan, Zheng int ret; 22753fd0a558SYan, Zheng 22767585717fSChris Mason mutex_lock(&root->fs_info->reloc_mutex); 22773fd0a558SYan, Zheng rc->merging_rsv_size += root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 22783fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 22797585717fSChris Mason mutex_unlock(&root->fs_info->reloc_mutex); 22807585717fSChris Mason 22813fd0a558SYan, Zheng again: 22823fd0a558SYan, Zheng if (!err) { 22833fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 228408e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 228508e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 22863fd0a558SYan, Zheng if (ret) 22873fd0a558SYan, Zheng err = ret; 22883fd0a558SYan, Zheng } 22893fd0a558SYan, Zheng 22907a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 22913612b495STsutomu Itoh if (IS_ERR(trans)) { 22923612b495STsutomu Itoh if (!err) 22933612b495STsutomu Itoh btrfs_block_rsv_release(rc->extent_root, 22943612b495STsutomu Itoh rc->block_rsv, num_bytes); 22953612b495STsutomu Itoh return PTR_ERR(trans); 22963612b495STsutomu Itoh } 22973fd0a558SYan, Zheng 22983fd0a558SYan, Zheng if (!err) { 22993fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 23003fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 23013fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, 23023fd0a558SYan, Zheng rc->block_rsv, num_bytes); 23033fd0a558SYan, Zheng goto again; 23043fd0a558SYan, Zheng } 23053fd0a558SYan, Zheng } 23063fd0a558SYan, Zheng 23073fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 23083fd0a558SYan, Zheng 23093fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 23103fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 23113fd0a558SYan, Zheng struct btrfs_root, root_list); 23123fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 23133fd0a558SYan, Zheng 23143fd0a558SYan, Zheng root = read_fs_root(reloc_root->fs_info, 23153fd0a558SYan, Zheng reloc_root->root_key.offset); 23163fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 23173fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 23183fd0a558SYan, Zheng 23193fd0a558SYan, Zheng /* 23203fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 23213fd0a558SYan, Zheng * knows it should resumes merging 23223fd0a558SYan, Zheng */ 23233fd0a558SYan, Zheng if (!err) 23243fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 23253fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 23263fd0a558SYan, Zheng 23273fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 23283fd0a558SYan, Zheng } 23293fd0a558SYan, Zheng 23303fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 23313fd0a558SYan, Zheng 23323fd0a558SYan, Zheng if (!err) 23333fd0a558SYan, Zheng btrfs_commit_transaction(trans, rc->extent_root); 23343fd0a558SYan, Zheng else 23353fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 23363fd0a558SYan, Zheng return err; 23373fd0a558SYan, Zheng } 23383fd0a558SYan, Zheng 23393fd0a558SYan, Zheng static noinline_for_stack 2340aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2341aca1bba6SLiu Bo { 2342aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2343aca1bba6SLiu Bo 2344aca1bba6SLiu Bo while (!list_empty(list)) { 2345aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2346aca1bba6SLiu Bo root_list); 2347c974c464SWang Shilong __del_reloc_root(reloc_root); 2348aca1bba6SLiu Bo } 2349aca1bba6SLiu Bo } 2350aca1bba6SLiu Bo 2351aca1bba6SLiu Bo static noinline_for_stack 23523fd0a558SYan, Zheng int merge_reloc_roots(struct reloc_control *rc) 23533fd0a558SYan, Zheng { 23545d4f98a2SYan Zheng struct btrfs_root *root; 23555d4f98a2SYan Zheng struct btrfs_root *reloc_root; 23565bc7247aSMiao Xie u64 last_snap; 23575bc7247aSMiao Xie u64 otransid; 23585bc7247aSMiao Xie u64 objectid; 23593fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 23603fd0a558SYan, Zheng int found = 0; 2361aca1bba6SLiu Bo int ret = 0; 23623fd0a558SYan, Zheng again: 23633fd0a558SYan, Zheng root = rc->extent_root; 23647585717fSChris Mason 23657585717fSChris Mason /* 23667585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 23677585717fSChris Mason * we have to make sure nobody is in the middle of 23687585717fSChris Mason * adding their roots to the list while we are 23697585717fSChris Mason * doing this splice 23707585717fSChris Mason */ 23717585717fSChris Mason mutex_lock(&root->fs_info->reloc_mutex); 23723fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 23737585717fSChris Mason mutex_unlock(&root->fs_info->reloc_mutex); 23745d4f98a2SYan Zheng 23753fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 23763fd0a558SYan, Zheng found = 1; 23773fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 23783fd0a558SYan, Zheng struct btrfs_root, root_list); 23795d4f98a2SYan Zheng 23805d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 23815d4f98a2SYan Zheng root = read_fs_root(reloc_root->fs_info, 23825d4f98a2SYan Zheng reloc_root->root_key.offset); 23835d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 23845d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 23855d4f98a2SYan Zheng 23863fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 2387b37b39cdSJosef Bacik if (ret) { 238825e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 238925e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 239025e293c2SWang Shilong &reloc_roots); 2391aca1bba6SLiu Bo goto out; 2392b37b39cdSJosef Bacik } 23933fd0a558SYan, Zheng } else { 23943fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 23953fd0a558SYan, Zheng } 23965bc7247aSMiao Xie 23975bc7247aSMiao Xie /* 23985bc7247aSMiao Xie * we keep the old last snapshod transid in rtranid when we 23995bc7247aSMiao Xie * created the relocation tree. 24005bc7247aSMiao Xie */ 24015bc7247aSMiao Xie last_snap = btrfs_root_rtransid(&reloc_root->root_item); 24025bc7247aSMiao Xie otransid = btrfs_root_otransid(&reloc_root->root_item); 24035bc7247aSMiao Xie objectid = reloc_root->root_key.offset; 24045bc7247aSMiao Xie 24052c536799SJeff Mahoney ret = btrfs_drop_snapshot(reloc_root, rc->block_rsv, 0, 1); 2406aca1bba6SLiu Bo if (ret < 0) { 2407aca1bba6SLiu Bo if (list_empty(&reloc_root->root_list)) 2408aca1bba6SLiu Bo list_add_tail(&reloc_root->root_list, 2409aca1bba6SLiu Bo &reloc_roots); 2410aca1bba6SLiu Bo goto out; 2411aca1bba6SLiu Bo } 24125d4f98a2SYan Zheng } 24135d4f98a2SYan Zheng 24143fd0a558SYan, Zheng if (found) { 24153fd0a558SYan, Zheng found = 0; 24163fd0a558SYan, Zheng goto again; 24175d4f98a2SYan Zheng } 2418aca1bba6SLiu Bo out: 2419aca1bba6SLiu Bo if (ret) { 2420aca1bba6SLiu Bo btrfs_std_error(root->fs_info, ret); 2421aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2422aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2423467bb1d2SWang Shilong 2424467bb1d2SWang Shilong /* new reloc root may be added */ 2425467bb1d2SWang Shilong mutex_lock(&root->fs_info->reloc_mutex); 2426467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 2427467bb1d2SWang Shilong mutex_unlock(&root->fs_info->reloc_mutex); 2428467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2429467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2430aca1bba6SLiu Bo } 2431aca1bba6SLiu Bo 24325d4f98a2SYan Zheng BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 2433aca1bba6SLiu Bo return ret; 24345d4f98a2SYan Zheng } 24355d4f98a2SYan Zheng 24365d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 24375d4f98a2SYan Zheng { 24385d4f98a2SYan Zheng struct tree_block *block; 24395d4f98a2SYan Zheng struct rb_node *rb_node; 24405d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 24415d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 24425d4f98a2SYan Zheng rb_erase(rb_node, blocks); 24435d4f98a2SYan Zheng kfree(block); 24445d4f98a2SYan Zheng } 24455d4f98a2SYan Zheng } 24465d4f98a2SYan Zheng 24475d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 24485d4f98a2SYan Zheng struct btrfs_root *reloc_root) 24495d4f98a2SYan Zheng { 24505d4f98a2SYan Zheng struct btrfs_root *root; 24515d4f98a2SYan Zheng 24525d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 24535d4f98a2SYan Zheng return 0; 24545d4f98a2SYan Zheng 24555d4f98a2SYan Zheng root = read_fs_root(reloc_root->fs_info, reloc_root->root_key.offset); 24565d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 24575d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 24585d4f98a2SYan Zheng 24595d4f98a2SYan Zheng return btrfs_record_root_in_trans(trans, root); 24605d4f98a2SYan Zheng } 24615d4f98a2SYan Zheng 24623fd0a558SYan, Zheng static noinline_for_stack 24633fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 24643fd0a558SYan, Zheng struct reloc_control *rc, 24655d4f98a2SYan Zheng struct backref_node *node, 2466dc4103f9SWang Shilong struct backref_edge *edges[]) 24675d4f98a2SYan Zheng { 24685d4f98a2SYan Zheng struct backref_node *next; 24695d4f98a2SYan Zheng struct btrfs_root *root; 24703fd0a558SYan, Zheng int index = 0; 24713fd0a558SYan, Zheng 24725d4f98a2SYan Zheng next = node; 24735d4f98a2SYan Zheng while (1) { 24745d4f98a2SYan Zheng cond_resched(); 24755d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 24765d4f98a2SYan Zheng root = next->root; 24773fd0a558SYan, Zheng BUG_ON(!root); 247827cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 24795d4f98a2SYan Zheng 24805d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 24815d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 24825d4f98a2SYan Zheng break; 24835d4f98a2SYan Zheng } 24845d4f98a2SYan Zheng 24855d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 24863fd0a558SYan, Zheng root = root->reloc_root; 24873fd0a558SYan, Zheng 24883fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 24893fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 24903fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 24913fd0a558SYan, Zheng next->new_bytenr = root->node->start; 24923fd0a558SYan, Zheng next->root = root; 24933fd0a558SYan, Zheng list_add_tail(&next->list, 24943fd0a558SYan, Zheng &rc->backref_cache.changed); 24953fd0a558SYan, Zheng __mark_block_processed(rc, next); 24965d4f98a2SYan Zheng break; 24975d4f98a2SYan Zheng } 24985d4f98a2SYan Zheng 24993fd0a558SYan, Zheng WARN_ON(1); 25005d4f98a2SYan Zheng root = NULL; 25015d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 25025d4f98a2SYan Zheng if (!next || next->level <= node->level) 25035d4f98a2SYan Zheng break; 25045d4f98a2SYan Zheng } 25053fd0a558SYan, Zheng if (!root) 25063fd0a558SYan, Zheng return NULL; 25075d4f98a2SYan Zheng 25083fd0a558SYan, Zheng next = node; 25093fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 25103fd0a558SYan, Zheng while (1) { 25113fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 25123fd0a558SYan, Zheng if (--index < 0) 25133fd0a558SYan, Zheng break; 25143fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 25153fd0a558SYan, Zheng } 25165d4f98a2SYan Zheng return root; 25175d4f98a2SYan Zheng } 25185d4f98a2SYan Zheng 25193fd0a558SYan, Zheng /* 25203fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 25213fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 25223fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 25233fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 25243fd0a558SYan, Zheng */ 25255d4f98a2SYan Zheng static noinline_for_stack 25265d4f98a2SYan Zheng struct btrfs_root *select_one_root(struct btrfs_trans_handle *trans, 25275d4f98a2SYan Zheng struct backref_node *node) 25285d4f98a2SYan Zheng { 25293fd0a558SYan, Zheng struct backref_node *next; 25303fd0a558SYan, Zheng struct btrfs_root *root; 25313fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 25325d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25333fd0a558SYan, Zheng int index = 0; 25343fd0a558SYan, Zheng 25353fd0a558SYan, Zheng next = node; 25363fd0a558SYan, Zheng while (1) { 25373fd0a558SYan, Zheng cond_resched(); 25383fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 25393fd0a558SYan, Zheng root = next->root; 25403fd0a558SYan, Zheng BUG_ON(!root); 25413fd0a558SYan, Zheng 254225985edcSLucas De Marchi /* no other choice for non-references counted tree */ 254327cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 25443fd0a558SYan, Zheng return root; 25453fd0a558SYan, Zheng 25463fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 25473fd0a558SYan, Zheng fs_root = root; 25483fd0a558SYan, Zheng 25493fd0a558SYan, Zheng if (next != node) 25503fd0a558SYan, Zheng return NULL; 25513fd0a558SYan, Zheng 25523fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 25533fd0a558SYan, Zheng if (!next || next->level <= node->level) 25543fd0a558SYan, Zheng break; 25553fd0a558SYan, Zheng } 25563fd0a558SYan, Zheng 25573fd0a558SYan, Zheng if (!fs_root) 25583fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 25593fd0a558SYan, Zheng return fs_root; 25605d4f98a2SYan Zheng } 25615d4f98a2SYan Zheng 25625d4f98a2SYan Zheng static noinline_for_stack 25633fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 25643fd0a558SYan, Zheng struct backref_node *node, int reserve) 25655d4f98a2SYan Zheng { 25663fd0a558SYan, Zheng struct backref_node *next = node; 25673fd0a558SYan, Zheng struct backref_edge *edge; 25683fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25693fd0a558SYan, Zheng u64 num_bytes = 0; 25703fd0a558SYan, Zheng int index = 0; 25715d4f98a2SYan Zheng 25723fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 25733fd0a558SYan, Zheng 25743fd0a558SYan, Zheng while (next) { 25753fd0a558SYan, Zheng cond_resched(); 25765d4f98a2SYan Zheng while (1) { 25773fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 25785d4f98a2SYan Zheng break; 25795d4f98a2SYan Zheng 2580707e8a07SDavid Sterba num_bytes += rc->extent_root->nodesize; 25813fd0a558SYan, Zheng 25823fd0a558SYan, Zheng if (list_empty(&next->upper)) 25833fd0a558SYan, Zheng break; 25843fd0a558SYan, Zheng 25853fd0a558SYan, Zheng edge = list_entry(next->upper.next, 25863fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 25873fd0a558SYan, Zheng edges[index++] = edge; 25883fd0a558SYan, Zheng next = edge->node[UPPER]; 25895d4f98a2SYan Zheng } 25903fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 25913fd0a558SYan, Zheng } 25923fd0a558SYan, Zheng return num_bytes; 25933fd0a558SYan, Zheng } 25943fd0a558SYan, Zheng 25953fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 25963fd0a558SYan, Zheng struct reloc_control *rc, 25973fd0a558SYan, Zheng struct backref_node *node) 25983fd0a558SYan, Zheng { 25993fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 26003fd0a558SYan, Zheng u64 num_bytes; 26013fd0a558SYan, Zheng int ret; 26020647bf56SWang Shilong u64 tmp; 26033fd0a558SYan, Zheng 26043fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 26053fd0a558SYan, Zheng 26063fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 26070647bf56SWang Shilong rc->reserved_bytes += num_bytes; 26080647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 260908e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 26103fd0a558SYan, Zheng if (ret) { 26110647bf56SWang Shilong if (ret == -EAGAIN) { 26120647bf56SWang Shilong tmp = rc->extent_root->nodesize * 26130647bf56SWang Shilong RELOCATION_RESERVED_NODES; 26140647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 26150647bf56SWang Shilong tmp <<= 1; 26160647bf56SWang Shilong /* 26170647bf56SWang Shilong * only one thread can access block_rsv at this point, 26180647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 26190647bf56SWang Shilong * we expand more reservation size here to allow enough 26200647bf56SWang Shilong * space for relocation and we will return eailer in 26210647bf56SWang Shilong * enospc case. 26220647bf56SWang Shilong */ 26230647bf56SWang Shilong rc->block_rsv->size = tmp + rc->extent_root->nodesize * 26240647bf56SWang Shilong RELOCATION_RESERVED_NODES; 26250647bf56SWang Shilong } 26263fd0a558SYan, Zheng return ret; 26273fd0a558SYan, Zheng } 26283fd0a558SYan, Zheng 26293fd0a558SYan, Zheng return 0; 26303fd0a558SYan, Zheng } 26313fd0a558SYan, Zheng 26325d4f98a2SYan Zheng /* 26335d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 26345d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 26355d4f98a2SYan Zheng * 26365d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 26375d4f98a2SYan Zheng * in that case this function just updates pointers. 26385d4f98a2SYan Zheng */ 26395d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 26403fd0a558SYan, Zheng struct reloc_control *rc, 26415d4f98a2SYan Zheng struct backref_node *node, 26425d4f98a2SYan Zheng struct btrfs_key *key, 26435d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 26445d4f98a2SYan Zheng { 26455d4f98a2SYan Zheng struct backref_node *upper; 26465d4f98a2SYan Zheng struct backref_edge *edge; 26475d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 26485d4f98a2SYan Zheng struct btrfs_root *root; 26495d4f98a2SYan Zheng struct extent_buffer *eb; 26505d4f98a2SYan Zheng u32 blocksize; 26515d4f98a2SYan Zheng u64 bytenr; 26525d4f98a2SYan Zheng u64 generation; 26535d4f98a2SYan Zheng int slot; 26545d4f98a2SYan Zheng int ret; 26555d4f98a2SYan Zheng int err = 0; 26565d4f98a2SYan Zheng 26575d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 26585d4f98a2SYan Zheng 26595d4f98a2SYan Zheng path->lowest_level = node->level + 1; 26603fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 26615d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 26625d4f98a2SYan Zheng cond_resched(); 26635d4f98a2SYan Zheng 26645d4f98a2SYan Zheng upper = edge->node[UPPER]; 2665dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 26663fd0a558SYan, Zheng BUG_ON(!root); 26675d4f98a2SYan Zheng 26683fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 26693fd0a558SYan, Zheng if (!lowest) { 26703fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 26713fd0a558SYan, Zheng upper->level, &slot); 26723fd0a558SYan, Zheng BUG_ON(ret); 26733fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 26743fd0a558SYan, Zheng if (node->eb->start == bytenr) 26753fd0a558SYan, Zheng goto next; 26763fd0a558SYan, Zheng } 26775d4f98a2SYan Zheng drop_node_buffer(upper); 26783fd0a558SYan, Zheng } 26795d4f98a2SYan Zheng 26805d4f98a2SYan Zheng if (!upper->eb) { 26815d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 26825d4f98a2SYan Zheng if (ret < 0) { 26835d4f98a2SYan Zheng err = ret; 26845d4f98a2SYan Zheng break; 26855d4f98a2SYan Zheng } 26865d4f98a2SYan Zheng BUG_ON(ret > 0); 26875d4f98a2SYan Zheng 26883fd0a558SYan, Zheng if (!upper->eb) { 26893fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 26903fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 26913fd0a558SYan, Zheng } else { 26923fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 26933fd0a558SYan, Zheng } 26943fd0a558SYan, Zheng 26953fd0a558SYan, Zheng upper->locked = 1; 26963fd0a558SYan, Zheng path->locks[upper->level] = 0; 26973fd0a558SYan, Zheng 26985d4f98a2SYan Zheng slot = path->slots[upper->level]; 2699b3b4aa74SDavid Sterba btrfs_release_path(path); 27005d4f98a2SYan Zheng } else { 27015d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 27025d4f98a2SYan Zheng &slot); 27035d4f98a2SYan Zheng BUG_ON(ret); 27045d4f98a2SYan Zheng } 27055d4f98a2SYan Zheng 27065d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 27073fd0a558SYan, Zheng if (lowest) { 27083fd0a558SYan, Zheng BUG_ON(bytenr != node->bytenr); 27095d4f98a2SYan Zheng } else { 27103fd0a558SYan, Zheng if (node->eb->start == bytenr) 27113fd0a558SYan, Zheng goto next; 27125d4f98a2SYan Zheng } 27135d4f98a2SYan Zheng 2714707e8a07SDavid Sterba blocksize = root->nodesize; 27155d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 27165d4f98a2SYan Zheng eb = read_tree_block(root, bytenr, blocksize, generation); 2717416bc658SJosef Bacik if (!eb || !extent_buffer_uptodate(eb)) { 2718416bc658SJosef Bacik free_extent_buffer(eb); 271997d9a8a4STsutomu Itoh err = -EIO; 272097d9a8a4STsutomu Itoh goto next; 272197d9a8a4STsutomu Itoh } 27225d4f98a2SYan Zheng btrfs_tree_lock(eb); 27235d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 27245d4f98a2SYan Zheng 27255d4f98a2SYan Zheng if (!node->eb) { 27265d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 27275d4f98a2SYan Zheng slot, &eb); 27283fd0a558SYan, Zheng btrfs_tree_unlock(eb); 27293fd0a558SYan, Zheng free_extent_buffer(eb); 27305d4f98a2SYan Zheng if (ret < 0) { 27315d4f98a2SYan Zheng err = ret; 27323fd0a558SYan, Zheng goto next; 27335d4f98a2SYan Zheng } 27343fd0a558SYan, Zheng BUG_ON(node->eb != eb); 27355d4f98a2SYan Zheng } else { 27365d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 27375d4f98a2SYan Zheng node->eb->start); 27385d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 27395d4f98a2SYan Zheng trans->transid); 27405d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 27415d4f98a2SYan Zheng 27425d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, root, 27435d4f98a2SYan Zheng node->eb->start, blocksize, 27445d4f98a2SYan Zheng upper->eb->start, 27455d4f98a2SYan Zheng btrfs_header_owner(upper->eb), 274666d7e7f0SArne Jansen node->level, 0, 1); 27475d4f98a2SYan Zheng BUG_ON(ret); 27485d4f98a2SYan Zheng 27495d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 27505d4f98a2SYan Zheng BUG_ON(ret); 27515d4f98a2SYan Zheng } 27523fd0a558SYan, Zheng next: 27533fd0a558SYan, Zheng if (!upper->pending) 27543fd0a558SYan, Zheng drop_node_buffer(upper); 27553fd0a558SYan, Zheng else 27563fd0a558SYan, Zheng unlock_node_buffer(upper); 27573fd0a558SYan, Zheng if (err) 27583fd0a558SYan, Zheng break; 27595d4f98a2SYan Zheng } 27603fd0a558SYan, Zheng 27613fd0a558SYan, Zheng if (!err && node->pending) { 27623fd0a558SYan, Zheng drop_node_buffer(node); 27633fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 27643fd0a558SYan, Zheng node->pending = 0; 27655d4f98a2SYan Zheng } 27663fd0a558SYan, Zheng 27675d4f98a2SYan Zheng path->lowest_level = 0; 27683fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 27695d4f98a2SYan Zheng return err; 27705d4f98a2SYan Zheng } 27715d4f98a2SYan Zheng 27725d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 27733fd0a558SYan, Zheng struct reloc_control *rc, 27745d4f98a2SYan Zheng struct backref_node *node, 27755d4f98a2SYan Zheng struct btrfs_path *path) 27765d4f98a2SYan Zheng { 27775d4f98a2SYan Zheng struct btrfs_key key; 27785d4f98a2SYan Zheng 27795d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 27803fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 27815d4f98a2SYan Zheng } 27825d4f98a2SYan Zheng 27835d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 27843fd0a558SYan, Zheng struct reloc_control *rc, 27853fd0a558SYan, Zheng struct btrfs_path *path, int err) 27865d4f98a2SYan Zheng { 27873fd0a558SYan, Zheng LIST_HEAD(list); 27883fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 27895d4f98a2SYan Zheng struct backref_node *node; 27905d4f98a2SYan Zheng int level; 27915d4f98a2SYan Zheng int ret; 27925d4f98a2SYan Zheng 27935d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 27945d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 27955d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 27963fd0a558SYan, Zheng struct backref_node, list); 27973fd0a558SYan, Zheng list_move_tail(&node->list, &list); 27983fd0a558SYan, Zheng BUG_ON(!node->pending); 27995d4f98a2SYan Zheng 28003fd0a558SYan, Zheng if (!err) { 28013fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 28025d4f98a2SYan Zheng if (ret < 0) 28035d4f98a2SYan Zheng err = ret; 28045d4f98a2SYan Zheng } 28055d4f98a2SYan Zheng } 28063fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 28073fd0a558SYan, Zheng } 28085d4f98a2SYan Zheng return err; 28095d4f98a2SYan Zheng } 28105d4f98a2SYan Zheng 28115d4f98a2SYan Zheng static void mark_block_processed(struct reloc_control *rc, 28123fd0a558SYan, Zheng u64 bytenr, u32 blocksize) 28133fd0a558SYan, Zheng { 28143fd0a558SYan, Zheng set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, 28153fd0a558SYan, Zheng EXTENT_DIRTY, GFP_NOFS); 28163fd0a558SYan, Zheng } 28173fd0a558SYan, Zheng 28183fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 28195d4f98a2SYan Zheng struct backref_node *node) 28205d4f98a2SYan Zheng { 28215d4f98a2SYan Zheng u32 blocksize; 28225d4f98a2SYan Zheng if (node->level == 0 || 28235d4f98a2SYan Zheng in_block_group(node->bytenr, rc->block_group)) { 2824707e8a07SDavid Sterba blocksize = rc->extent_root->nodesize; 28253fd0a558SYan, Zheng mark_block_processed(rc, node->bytenr, blocksize); 28265d4f98a2SYan Zheng } 28275d4f98a2SYan Zheng node->processed = 1; 28285d4f98a2SYan Zheng } 28295d4f98a2SYan Zheng 28305d4f98a2SYan Zheng /* 28315d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 28325d4f98a2SYan Zheng * as processed. 28335d4f98a2SYan Zheng */ 28345d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 28355d4f98a2SYan Zheng struct backref_node *node) 28365d4f98a2SYan Zheng { 28375d4f98a2SYan Zheng struct backref_node *next = node; 28385d4f98a2SYan Zheng struct backref_edge *edge; 28395d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28405d4f98a2SYan Zheng int index = 0; 28415d4f98a2SYan Zheng 28425d4f98a2SYan Zheng while (next) { 28435d4f98a2SYan Zheng cond_resched(); 28445d4f98a2SYan Zheng while (1) { 28455d4f98a2SYan Zheng if (next->processed) 28465d4f98a2SYan Zheng break; 28475d4f98a2SYan Zheng 28483fd0a558SYan, Zheng __mark_block_processed(rc, next); 28495d4f98a2SYan Zheng 28505d4f98a2SYan Zheng if (list_empty(&next->upper)) 28515d4f98a2SYan Zheng break; 28525d4f98a2SYan Zheng 28535d4f98a2SYan Zheng edge = list_entry(next->upper.next, 28545d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 28555d4f98a2SYan Zheng edges[index++] = edge; 28565d4f98a2SYan Zheng next = edge->node[UPPER]; 28575d4f98a2SYan Zheng } 28585d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 28595d4f98a2SYan Zheng } 28605d4f98a2SYan Zheng } 28615d4f98a2SYan Zheng 28625d4f98a2SYan Zheng static int tree_block_processed(u64 bytenr, u32 blocksize, 28635d4f98a2SYan Zheng struct reloc_control *rc) 28645d4f98a2SYan Zheng { 28655d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 28669655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 28675d4f98a2SYan Zheng return 1; 28685d4f98a2SYan Zheng return 0; 28695d4f98a2SYan Zheng } 28705d4f98a2SYan Zheng 28715d4f98a2SYan Zheng static int get_tree_block_key(struct reloc_control *rc, 28725d4f98a2SYan Zheng struct tree_block *block) 28735d4f98a2SYan Zheng { 28745d4f98a2SYan Zheng struct extent_buffer *eb; 28755d4f98a2SYan Zheng 28765d4f98a2SYan Zheng BUG_ON(block->key_ready); 28775d4f98a2SYan Zheng eb = read_tree_block(rc->extent_root, block->bytenr, 28785d4f98a2SYan Zheng block->key.objectid, block->key.offset); 2879416bc658SJosef Bacik if (!eb || !extent_buffer_uptodate(eb)) { 2880416bc658SJosef Bacik free_extent_buffer(eb); 2881416bc658SJosef Bacik return -EIO; 2882416bc658SJosef Bacik } 28835d4f98a2SYan Zheng WARN_ON(btrfs_header_level(eb) != block->level); 28845d4f98a2SYan Zheng if (block->level == 0) 28855d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 28865d4f98a2SYan Zheng else 28875d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 28885d4f98a2SYan Zheng free_extent_buffer(eb); 28895d4f98a2SYan Zheng block->key_ready = 1; 28905d4f98a2SYan Zheng return 0; 28915d4f98a2SYan Zheng } 28925d4f98a2SYan Zheng 28935d4f98a2SYan Zheng static int reada_tree_block(struct reloc_control *rc, 28945d4f98a2SYan Zheng struct tree_block *block) 28955d4f98a2SYan Zheng { 28965d4f98a2SYan Zheng BUG_ON(block->key_ready); 28973173a18fSJosef Bacik if (block->key.type == BTRFS_METADATA_ITEM_KEY) 28983173a18fSJosef Bacik readahead_tree_block(rc->extent_root, block->bytenr, 28993173a18fSJosef Bacik block->key.objectid, 2900707e8a07SDavid Sterba rc->extent_root->nodesize); 29013173a18fSJosef Bacik else 29025d4f98a2SYan Zheng readahead_tree_block(rc->extent_root, block->bytenr, 29035d4f98a2SYan Zheng block->key.objectid, block->key.offset); 29045d4f98a2SYan Zheng return 0; 29055d4f98a2SYan Zheng } 29065d4f98a2SYan Zheng 29075d4f98a2SYan Zheng /* 29085d4f98a2SYan Zheng * helper function to relocate a tree block 29095d4f98a2SYan Zheng */ 29105d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 29115d4f98a2SYan Zheng struct reloc_control *rc, 29125d4f98a2SYan Zheng struct backref_node *node, 29135d4f98a2SYan Zheng struct btrfs_key *key, 29145d4f98a2SYan Zheng struct btrfs_path *path) 29155d4f98a2SYan Zheng { 29165d4f98a2SYan Zheng struct btrfs_root *root; 29173fd0a558SYan, Zheng int ret = 0; 29185d4f98a2SYan Zheng 29193fd0a558SYan, Zheng if (!node) 29205d4f98a2SYan Zheng return 0; 29213fd0a558SYan, Zheng 29223fd0a558SYan, Zheng BUG_ON(node->processed); 29233fd0a558SYan, Zheng root = select_one_root(trans, node); 29243fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 29253fd0a558SYan, Zheng update_processed_blocks(rc, node); 29263fd0a558SYan, Zheng goto out; 29275d4f98a2SYan Zheng } 29285d4f98a2SYan Zheng 292927cdeb70SMiao Xie if (!root || test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 29303fd0a558SYan, Zheng ret = reserve_metadata_space(trans, rc, node); 29313fd0a558SYan, Zheng if (ret) 29325d4f98a2SYan Zheng goto out; 29335d4f98a2SYan Zheng } 29343fd0a558SYan, Zheng 29353fd0a558SYan, Zheng if (root) { 293627cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 29373fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 29383fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 29393fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 29403fd0a558SYan, Zheng root = root->reloc_root; 29413fd0a558SYan, Zheng node->new_bytenr = root->node->start; 29423fd0a558SYan, Zheng node->root = root; 29433fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 29443fd0a558SYan, Zheng } else { 29455d4f98a2SYan Zheng path->lowest_level = node->level; 29465d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 2947b3b4aa74SDavid Sterba btrfs_release_path(path); 29483fd0a558SYan, Zheng if (ret > 0) 29495d4f98a2SYan Zheng ret = 0; 29503fd0a558SYan, Zheng } 29513fd0a558SYan, Zheng if (!ret) 29523fd0a558SYan, Zheng update_processed_blocks(rc, node); 29533fd0a558SYan, Zheng } else { 29543fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 29553fd0a558SYan, Zheng } 29565d4f98a2SYan Zheng out: 29570647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 29583fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 29595d4f98a2SYan Zheng return ret; 29605d4f98a2SYan Zheng } 29615d4f98a2SYan Zheng 29625d4f98a2SYan Zheng /* 29635d4f98a2SYan Zheng * relocate a list of blocks 29645d4f98a2SYan Zheng */ 29655d4f98a2SYan Zheng static noinline_for_stack 29665d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 29675d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 29685d4f98a2SYan Zheng { 29695d4f98a2SYan Zheng struct backref_node *node; 29705d4f98a2SYan Zheng struct btrfs_path *path; 29715d4f98a2SYan Zheng struct tree_block *block; 29725d4f98a2SYan Zheng struct rb_node *rb_node; 29735d4f98a2SYan Zheng int ret; 29745d4f98a2SYan Zheng int err = 0; 29755d4f98a2SYan Zheng 29765d4f98a2SYan Zheng path = btrfs_alloc_path(); 2977e1a12670SLiu Bo if (!path) { 2978e1a12670SLiu Bo err = -ENOMEM; 297934c2b290SDavid Sterba goto out_free_blocks; 2980e1a12670SLiu Bo } 29815d4f98a2SYan Zheng 29825d4f98a2SYan Zheng rb_node = rb_first(blocks); 29835d4f98a2SYan Zheng while (rb_node) { 29845d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 29855d4f98a2SYan Zheng if (!block->key_ready) 29865d4f98a2SYan Zheng reada_tree_block(rc, block); 29875d4f98a2SYan Zheng rb_node = rb_next(rb_node); 29885d4f98a2SYan Zheng } 29895d4f98a2SYan Zheng 29905d4f98a2SYan Zheng rb_node = rb_first(blocks); 29915d4f98a2SYan Zheng while (rb_node) { 29925d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 299334c2b290SDavid Sterba if (!block->key_ready) { 299434c2b290SDavid Sterba err = get_tree_block_key(rc, block); 299534c2b290SDavid Sterba if (err) 299634c2b290SDavid Sterba goto out_free_path; 299734c2b290SDavid Sterba } 29985d4f98a2SYan Zheng rb_node = rb_next(rb_node); 29995d4f98a2SYan Zheng } 30005d4f98a2SYan Zheng 30015d4f98a2SYan Zheng rb_node = rb_first(blocks); 30025d4f98a2SYan Zheng while (rb_node) { 30035d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 30045d4f98a2SYan Zheng 30053fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 30065d4f98a2SYan Zheng block->level, block->bytenr); 30075d4f98a2SYan Zheng if (IS_ERR(node)) { 30085d4f98a2SYan Zheng err = PTR_ERR(node); 30095d4f98a2SYan Zheng goto out; 30105d4f98a2SYan Zheng } 30115d4f98a2SYan Zheng 30125d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 30135d4f98a2SYan Zheng path); 30145d4f98a2SYan Zheng if (ret < 0) { 30153fd0a558SYan, Zheng if (ret != -EAGAIN || rb_node == rb_first(blocks)) 30165d4f98a2SYan Zheng err = ret; 30175d4f98a2SYan Zheng goto out; 30185d4f98a2SYan Zheng } 30195d4f98a2SYan Zheng rb_node = rb_next(rb_node); 30205d4f98a2SYan Zheng } 30215d4f98a2SYan Zheng out: 30223fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 30235d4f98a2SYan Zheng 302434c2b290SDavid Sterba out_free_path: 30255d4f98a2SYan Zheng btrfs_free_path(path); 302634c2b290SDavid Sterba out_free_blocks: 3027e1a12670SLiu Bo free_block_list(blocks); 30285d4f98a2SYan Zheng return err; 30295d4f98a2SYan Zheng } 30305d4f98a2SYan Zheng 30315d4f98a2SYan Zheng static noinline_for_stack 3032efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3033efa56464SYan, Zheng struct file_extent_cluster *cluster) 3034efa56464SYan, Zheng { 3035efa56464SYan, Zheng u64 alloc_hint = 0; 3036efa56464SYan, Zheng u64 start; 3037efa56464SYan, Zheng u64 end; 3038efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3039efa56464SYan, Zheng u64 num_bytes; 3040efa56464SYan, Zheng int nr = 0; 3041efa56464SYan, Zheng int ret = 0; 3042efa56464SYan, Zheng 3043efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 3044efa56464SYan, Zheng mutex_lock(&inode->i_mutex); 3045efa56464SYan, Zheng 3046efa56464SYan, Zheng ret = btrfs_check_data_free_space(inode, cluster->end + 3047efa56464SYan, Zheng 1 - cluster->start); 3048efa56464SYan, Zheng if (ret) 3049efa56464SYan, Zheng goto out; 3050efa56464SYan, Zheng 3051efa56464SYan, Zheng while (nr < cluster->nr) { 3052efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3053efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3054efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3055efa56464SYan, Zheng else 3056efa56464SYan, Zheng end = cluster->end - offset; 3057efa56464SYan, Zheng 3058d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3059efa56464SYan, Zheng num_bytes = end + 1 - start; 3060efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3061efa56464SYan, Zheng num_bytes, num_bytes, 3062efa56464SYan, Zheng end + 1, &alloc_hint); 3063d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3064efa56464SYan, Zheng if (ret) 3065efa56464SYan, Zheng break; 3066efa56464SYan, Zheng nr++; 3067efa56464SYan, Zheng } 3068efa56464SYan, Zheng btrfs_free_reserved_data_space(inode, cluster->end + 3069efa56464SYan, Zheng 1 - cluster->start); 3070efa56464SYan, Zheng out: 3071efa56464SYan, Zheng mutex_unlock(&inode->i_mutex); 3072efa56464SYan, Zheng return ret; 3073efa56464SYan, Zheng } 3074efa56464SYan, Zheng 3075efa56464SYan, Zheng static noinline_for_stack 30760257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 30770257bb82SYan, Zheng u64 block_start) 30785d4f98a2SYan Zheng { 30795d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(inode)->root; 30805d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 30815d4f98a2SYan Zheng struct extent_map *em; 30820257bb82SYan, Zheng int ret = 0; 30835d4f98a2SYan Zheng 3084172ddd60SDavid Sterba em = alloc_extent_map(); 30850257bb82SYan, Zheng if (!em) 30860257bb82SYan, Zheng return -ENOMEM; 30870257bb82SYan, Zheng 30885d4f98a2SYan Zheng em->start = start; 30890257bb82SYan, Zheng em->len = end + 1 - start; 30900257bb82SYan, Zheng em->block_len = em->len; 30910257bb82SYan, Zheng em->block_start = block_start; 30925d4f98a2SYan Zheng em->bdev = root->fs_info->fs_devices->latest_bdev; 30935d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 30945d4f98a2SYan Zheng 3095d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 30965d4f98a2SYan Zheng while (1) { 3097890871beSChris Mason write_lock(&em_tree->lock); 309809a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3099890871beSChris Mason write_unlock(&em_tree->lock); 31005d4f98a2SYan Zheng if (ret != -EEXIST) { 31015d4f98a2SYan Zheng free_extent_map(em); 31025d4f98a2SYan Zheng break; 31035d4f98a2SYan Zheng } 31045d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, start, end, 0); 31055d4f98a2SYan Zheng } 3106d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 31070257bb82SYan, Zheng return ret; 31080257bb82SYan, Zheng } 31095d4f98a2SYan Zheng 31100257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 31110257bb82SYan, Zheng struct file_extent_cluster *cluster) 31120257bb82SYan, Zheng { 31130257bb82SYan, Zheng u64 page_start; 31140257bb82SYan, Zheng u64 page_end; 31150257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 31160257bb82SYan, Zheng unsigned long index; 31170257bb82SYan, Zheng unsigned long last_index; 31180257bb82SYan, Zheng struct page *page; 31190257bb82SYan, Zheng struct file_ra_state *ra; 31203b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 31210257bb82SYan, Zheng int nr = 0; 31220257bb82SYan, Zheng int ret = 0; 31230257bb82SYan, Zheng 31240257bb82SYan, Zheng if (!cluster->nr) 31250257bb82SYan, Zheng return 0; 31260257bb82SYan, Zheng 31270257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 31280257bb82SYan, Zheng if (!ra) 31290257bb82SYan, Zheng return -ENOMEM; 31300257bb82SYan, Zheng 3131efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 31320257bb82SYan, Zheng if (ret) 3133efa56464SYan, Zheng goto out; 31340257bb82SYan, Zheng 31350257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 31360257bb82SYan, Zheng 3137efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3138efa56464SYan, Zheng cluster->end - offset, cluster->start); 3139efa56464SYan, Zheng if (ret) 3140efa56464SYan, Zheng goto out; 3141efa56464SYan, Zheng 3142efa56464SYan, Zheng index = (cluster->start - offset) >> PAGE_CACHE_SHIFT; 3143efa56464SYan, Zheng last_index = (cluster->end - offset) >> PAGE_CACHE_SHIFT; 31440257bb82SYan, Zheng while (index <= last_index) { 3145efa56464SYan, Zheng ret = btrfs_delalloc_reserve_metadata(inode, PAGE_CACHE_SIZE); 3146efa56464SYan, Zheng if (ret) 3147efa56464SYan, Zheng goto out; 3148efa56464SYan, Zheng 31490257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 31500257bb82SYan, Zheng if (!page) { 31510257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 31520257bb82SYan, Zheng ra, NULL, index, 31530257bb82SYan, Zheng last_index + 1 - index); 3154a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 31553b16a4e3SJosef Bacik mask); 31560257bb82SYan, Zheng if (!page) { 3157efa56464SYan, Zheng btrfs_delalloc_release_metadata(inode, 3158efa56464SYan, Zheng PAGE_CACHE_SIZE); 31590257bb82SYan, Zheng ret = -ENOMEM; 3160efa56464SYan, Zheng goto out; 31610257bb82SYan, Zheng } 31620257bb82SYan, Zheng } 31630257bb82SYan, Zheng 31640257bb82SYan, Zheng if (PageReadahead(page)) { 31650257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 31660257bb82SYan, Zheng ra, NULL, page, index, 31670257bb82SYan, Zheng last_index + 1 - index); 31680257bb82SYan, Zheng } 31690257bb82SYan, Zheng 31700257bb82SYan, Zheng if (!PageUptodate(page)) { 31710257bb82SYan, Zheng btrfs_readpage(NULL, page); 31720257bb82SYan, Zheng lock_page(page); 31730257bb82SYan, Zheng if (!PageUptodate(page)) { 31740257bb82SYan, Zheng unlock_page(page); 31750257bb82SYan, Zheng page_cache_release(page); 3176efa56464SYan, Zheng btrfs_delalloc_release_metadata(inode, 3177efa56464SYan, Zheng PAGE_CACHE_SIZE); 31780257bb82SYan, Zheng ret = -EIO; 3179efa56464SYan, Zheng goto out; 31800257bb82SYan, Zheng } 31810257bb82SYan, Zheng } 31820257bb82SYan, Zheng 31834eee4fa4SMiao Xie page_start = page_offset(page); 31840257bb82SYan, Zheng page_end = page_start + PAGE_CACHE_SIZE - 1; 31850257bb82SYan, Zheng 3186d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 31870257bb82SYan, Zheng 31880257bb82SYan, Zheng set_page_extent_mapped(page); 31890257bb82SYan, Zheng 31900257bb82SYan, Zheng if (nr < cluster->nr && 31910257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 31920257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 31930257bb82SYan, Zheng page_start, page_end, 31940257bb82SYan, Zheng EXTENT_BOUNDARY, GFP_NOFS); 31950257bb82SYan, Zheng nr++; 31960257bb82SYan, Zheng } 31970257bb82SYan, Zheng 3198efa56464SYan, Zheng btrfs_set_extent_delalloc(inode, page_start, page_end, NULL); 31990257bb82SYan, Zheng set_page_dirty(page); 32000257bb82SYan, Zheng 32010257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3202d0082371SJeff Mahoney page_start, page_end); 32030257bb82SYan, Zheng unlock_page(page); 32040257bb82SYan, Zheng page_cache_release(page); 32050257bb82SYan, Zheng 32060257bb82SYan, Zheng index++; 3207efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 3208efa56464SYan, Zheng btrfs_throttle(BTRFS_I(inode)->root); 32090257bb82SYan, Zheng } 32100257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3211efa56464SYan, Zheng out: 32120257bb82SYan, Zheng kfree(ra); 32130257bb82SYan, Zheng return ret; 32140257bb82SYan, Zheng } 32150257bb82SYan, Zheng 32160257bb82SYan, Zheng static noinline_for_stack 32170257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 32180257bb82SYan, Zheng struct file_extent_cluster *cluster) 32190257bb82SYan, Zheng { 32200257bb82SYan, Zheng int ret; 32210257bb82SYan, Zheng 32220257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 32230257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 32240257bb82SYan, Zheng if (ret) 32250257bb82SYan, Zheng return ret; 32260257bb82SYan, Zheng cluster->nr = 0; 32270257bb82SYan, Zheng } 32280257bb82SYan, Zheng 32290257bb82SYan, Zheng if (!cluster->nr) 32300257bb82SYan, Zheng cluster->start = extent_key->objectid; 32310257bb82SYan, Zheng else 32320257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 32330257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 32340257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 32350257bb82SYan, Zheng cluster->nr++; 32360257bb82SYan, Zheng 32370257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 32380257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 32390257bb82SYan, Zheng if (ret) 32400257bb82SYan, Zheng return ret; 32410257bb82SYan, Zheng cluster->nr = 0; 32420257bb82SYan, Zheng } 32430257bb82SYan, Zheng return 0; 32445d4f98a2SYan Zheng } 32455d4f98a2SYan Zheng 32465d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 32475d4f98a2SYan Zheng static int get_ref_objectid_v0(struct reloc_control *rc, 32485d4f98a2SYan Zheng struct btrfs_path *path, 32495d4f98a2SYan Zheng struct btrfs_key *extent_key, 32505d4f98a2SYan Zheng u64 *ref_objectid, int *path_change) 32515d4f98a2SYan Zheng { 32525d4f98a2SYan Zheng struct btrfs_key key; 32535d4f98a2SYan Zheng struct extent_buffer *leaf; 32545d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 32555d4f98a2SYan Zheng int ret; 32565d4f98a2SYan Zheng int slot; 32575d4f98a2SYan Zheng 32585d4f98a2SYan Zheng leaf = path->nodes[0]; 32595d4f98a2SYan Zheng slot = path->slots[0]; 32605d4f98a2SYan Zheng while (1) { 32615d4f98a2SYan Zheng if (slot >= btrfs_header_nritems(leaf)) { 32625d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 32635d4f98a2SYan Zheng if (ret < 0) 32645d4f98a2SYan Zheng return ret; 32655d4f98a2SYan Zheng BUG_ON(ret > 0); 32665d4f98a2SYan Zheng leaf = path->nodes[0]; 32675d4f98a2SYan Zheng slot = path->slots[0]; 32685d4f98a2SYan Zheng if (path_change) 32695d4f98a2SYan Zheng *path_change = 1; 32705d4f98a2SYan Zheng } 32715d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, slot); 32725d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 32735d4f98a2SYan Zheng return -ENOENT; 32745d4f98a2SYan Zheng 32755d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_REF_V0_KEY) { 32765d4f98a2SYan Zheng slot++; 32775d4f98a2SYan Zheng continue; 32785d4f98a2SYan Zheng } 32795d4f98a2SYan Zheng ref0 = btrfs_item_ptr(leaf, slot, 32805d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 32815d4f98a2SYan Zheng *ref_objectid = btrfs_ref_objectid_v0(leaf, ref0); 32825d4f98a2SYan Zheng break; 32835d4f98a2SYan Zheng } 32845d4f98a2SYan Zheng return 0; 32855d4f98a2SYan Zheng } 32865d4f98a2SYan Zheng #endif 32875d4f98a2SYan Zheng 32885d4f98a2SYan Zheng /* 32895d4f98a2SYan Zheng * helper to add a tree block to the list. 32905d4f98a2SYan Zheng * the major work is getting the generation and level of the block 32915d4f98a2SYan Zheng */ 32925d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 32935d4f98a2SYan Zheng struct btrfs_key *extent_key, 32945d4f98a2SYan Zheng struct btrfs_path *path, 32955d4f98a2SYan Zheng struct rb_root *blocks) 32965d4f98a2SYan Zheng { 32975d4f98a2SYan Zheng struct extent_buffer *eb; 32985d4f98a2SYan Zheng struct btrfs_extent_item *ei; 32995d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 33005d4f98a2SYan Zheng struct tree_block *block; 33015d4f98a2SYan Zheng struct rb_node *rb_node; 33025d4f98a2SYan Zheng u32 item_size; 33035d4f98a2SYan Zheng int level = -1; 33047fdf4b60SWang Shilong u64 generation; 33055d4f98a2SYan Zheng 33065d4f98a2SYan Zheng eb = path->nodes[0]; 33075d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 33085d4f98a2SYan Zheng 33093173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 33103173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 33115d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 33125d4f98a2SYan Zheng struct btrfs_extent_item); 33133173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 33145d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 33155d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 33165d4f98a2SYan Zheng } else { 33173173a18fSJosef Bacik level = (int)extent_key->offset; 33183173a18fSJosef Bacik } 33193173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 33203173a18fSJosef Bacik } else { 33215d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 33225d4f98a2SYan Zheng u64 ref_owner; 33235d4f98a2SYan Zheng int ret; 33245d4f98a2SYan Zheng 33255d4f98a2SYan Zheng BUG_ON(item_size != sizeof(struct btrfs_extent_item_v0)); 33265d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, extent_key, 33275d4f98a2SYan Zheng &ref_owner, NULL); 3328411fc6bcSAndi Kleen if (ret < 0) 3329411fc6bcSAndi Kleen return ret; 33305d4f98a2SYan Zheng BUG_ON(ref_owner >= BTRFS_MAX_LEVEL); 33315d4f98a2SYan Zheng level = (int)ref_owner; 33325d4f98a2SYan Zheng /* FIXME: get real generation */ 33335d4f98a2SYan Zheng generation = 0; 33345d4f98a2SYan Zheng #else 33355d4f98a2SYan Zheng BUG(); 33365d4f98a2SYan Zheng #endif 33375d4f98a2SYan Zheng } 33385d4f98a2SYan Zheng 3339b3b4aa74SDavid Sterba btrfs_release_path(path); 33405d4f98a2SYan Zheng 33415d4f98a2SYan Zheng BUG_ON(level == -1); 33425d4f98a2SYan Zheng 33435d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 33445d4f98a2SYan Zheng if (!block) 33455d4f98a2SYan Zheng return -ENOMEM; 33465d4f98a2SYan Zheng 33475d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3348707e8a07SDavid Sterba block->key.objectid = rc->extent_root->nodesize; 33495d4f98a2SYan Zheng block->key.offset = generation; 33505d4f98a2SYan Zheng block->level = level; 33515d4f98a2SYan Zheng block->key_ready = 0; 33525d4f98a2SYan Zheng 33535d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 335443c04fb1SJeff Mahoney if (rb_node) 335543c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 33565d4f98a2SYan Zheng 33575d4f98a2SYan Zheng return 0; 33585d4f98a2SYan Zheng } 33595d4f98a2SYan Zheng 33605d4f98a2SYan Zheng /* 33615d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 33625d4f98a2SYan Zheng */ 33635d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 33645d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 33655d4f98a2SYan Zheng struct rb_root *blocks) 33665d4f98a2SYan Zheng { 33675d4f98a2SYan Zheng struct btrfs_path *path; 33685d4f98a2SYan Zheng struct btrfs_key key; 33695d4f98a2SYan Zheng int ret; 3370aee68ee5SJosef Bacik bool skinny = btrfs_fs_incompat(rc->extent_root->fs_info, 3371aee68ee5SJosef Bacik SKINNY_METADATA); 33725d4f98a2SYan Zheng 33735d4f98a2SYan Zheng if (tree_block_processed(bytenr, blocksize, rc)) 33745d4f98a2SYan Zheng return 0; 33755d4f98a2SYan Zheng 33765d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 33775d4f98a2SYan Zheng return 0; 33785d4f98a2SYan Zheng 33795d4f98a2SYan Zheng path = btrfs_alloc_path(); 33805d4f98a2SYan Zheng if (!path) 33815d4f98a2SYan Zheng return -ENOMEM; 3382aee68ee5SJosef Bacik again: 33835d4f98a2SYan Zheng key.objectid = bytenr; 3384aee68ee5SJosef Bacik if (skinny) { 3385aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3386aee68ee5SJosef Bacik key.offset = (u64)-1; 3387aee68ee5SJosef Bacik } else { 33885d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 33895d4f98a2SYan Zheng key.offset = blocksize; 3390aee68ee5SJosef Bacik } 33915d4f98a2SYan Zheng 33925d4f98a2SYan Zheng path->search_commit_root = 1; 33935d4f98a2SYan Zheng path->skip_locking = 1; 33945d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 33955d4f98a2SYan Zheng if (ret < 0) 33965d4f98a2SYan Zheng goto out; 33975d4f98a2SYan Zheng 3398aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3399aee68ee5SJosef Bacik if (path->slots[0]) { 3400aee68ee5SJosef Bacik path->slots[0]--; 3401aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3402aee68ee5SJosef Bacik path->slots[0]); 34033173a18fSJosef Bacik if (key.objectid == bytenr && 3404aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3405aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3406aee68ee5SJosef Bacik key.offset == blocksize))) 34073173a18fSJosef Bacik ret = 0; 34083173a18fSJosef Bacik } 3409aee68ee5SJosef Bacik 3410aee68ee5SJosef Bacik if (ret) { 3411aee68ee5SJosef Bacik skinny = false; 3412aee68ee5SJosef Bacik btrfs_release_path(path); 3413aee68ee5SJosef Bacik goto again; 3414aee68ee5SJosef Bacik } 3415aee68ee5SJosef Bacik } 34163173a18fSJosef Bacik BUG_ON(ret); 34173173a18fSJosef Bacik 34185d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 34195d4f98a2SYan Zheng out: 34205d4f98a2SYan Zheng btrfs_free_path(path); 34215d4f98a2SYan Zheng return ret; 34225d4f98a2SYan Zheng } 34235d4f98a2SYan Zheng 34245d4f98a2SYan Zheng /* 34255d4f98a2SYan Zheng * helper to check if the block use full backrefs for pointers in it 34265d4f98a2SYan Zheng */ 34275d4f98a2SYan Zheng static int block_use_full_backref(struct reloc_control *rc, 34285d4f98a2SYan Zheng struct extent_buffer *eb) 34295d4f98a2SYan Zheng { 34305d4f98a2SYan Zheng u64 flags; 34315d4f98a2SYan Zheng int ret; 34325d4f98a2SYan Zheng 34335d4f98a2SYan Zheng if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) || 34345d4f98a2SYan Zheng btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV) 34355d4f98a2SYan Zheng return 1; 34365d4f98a2SYan Zheng 34373fd0a558SYan, Zheng ret = btrfs_lookup_extent_info(NULL, rc->extent_root, 34383173a18fSJosef Bacik eb->start, btrfs_header_level(eb), 1, 34393173a18fSJosef Bacik NULL, &flags); 34405d4f98a2SYan Zheng BUG_ON(ret); 34415d4f98a2SYan Zheng 34425d4f98a2SYan Zheng if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) 34435d4f98a2SYan Zheng ret = 1; 34445d4f98a2SYan Zheng else 34455d4f98a2SYan Zheng ret = 0; 34465d4f98a2SYan Zheng return ret; 34475d4f98a2SYan Zheng } 34485d4f98a2SYan Zheng 34490af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 34500af3d00bSJosef Bacik struct inode *inode, 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 348374514323SFilipe David Borba Manana ret = btrfs_truncate_free_space_cache(root, trans, 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, 35290af3d00bSJosef Bacik NULL, ref_objectid); 35300af3d00bSJosef Bacik if (ret != -ENOENT) 35310af3d00bSJosef Bacik return ret; 35320af3d00bSJosef Bacik ret = 0; 35330af3d00bSJosef Bacik } 35340af3d00bSJosef Bacik 35350af3d00bSJosef Bacik path = btrfs_alloc_path(); 35360af3d00bSJosef Bacik if (!path) 35370af3d00bSJosef Bacik return -ENOMEM; 3538026fd317SJosef Bacik path->reada = 1; 35390af3d00bSJosef Bacik 35405d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, ref_root); 35415d4f98a2SYan Zheng if (IS_ERR(root)) { 35425d4f98a2SYan Zheng err = PTR_ERR(root); 35435d4f98a2SYan Zheng goto out; 35445d4f98a2SYan Zheng } 35455d4f98a2SYan Zheng 35465d4f98a2SYan Zheng key.objectid = ref_objectid; 35475d4f98a2SYan Zheng key.type = BTRFS_EXTENT_DATA_KEY; 354884850e8dSYan, Zheng if (ref_offset > ((u64)-1 << 32)) 354984850e8dSYan, Zheng key.offset = 0; 355084850e8dSYan, Zheng else 355184850e8dSYan, Zheng key.offset = ref_offset; 35525d4f98a2SYan Zheng 35535d4f98a2SYan Zheng path->search_commit_root = 1; 35545d4f98a2SYan Zheng path->skip_locking = 1; 35555d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 35565d4f98a2SYan Zheng if (ret < 0) { 35575d4f98a2SYan Zheng err = ret; 35585d4f98a2SYan Zheng goto out; 35595d4f98a2SYan Zheng } 35605d4f98a2SYan Zheng 35615d4f98a2SYan Zheng leaf = path->nodes[0]; 35625d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 35635d4f98a2SYan Zheng /* 35645d4f98a2SYan Zheng * the references in tree blocks that use full backrefs 35655d4f98a2SYan Zheng * are not counted in 35665d4f98a2SYan Zheng */ 35675d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 35685d4f98a2SYan Zheng counted = 0; 35695d4f98a2SYan Zheng else 35705d4f98a2SYan Zheng counted = 1; 35715d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 35725d4f98a2SYan Zheng if (rb_node) { 35735d4f98a2SYan Zheng if (counted) 35745d4f98a2SYan Zheng added = 1; 35755d4f98a2SYan Zheng else 35765d4f98a2SYan Zheng path->slots[0] = nritems; 35775d4f98a2SYan Zheng } 35785d4f98a2SYan Zheng 35795d4f98a2SYan Zheng while (ref_count > 0) { 35805d4f98a2SYan Zheng while (path->slots[0] >= nritems) { 35815d4f98a2SYan Zheng ret = btrfs_next_leaf(root, path); 35825d4f98a2SYan Zheng if (ret < 0) { 35835d4f98a2SYan Zheng err = ret; 35845d4f98a2SYan Zheng goto out; 35855d4f98a2SYan Zheng } 3586fae7f21cSDulshani Gunawardhana if (WARN_ON(ret > 0)) 35875d4f98a2SYan Zheng goto out; 35885d4f98a2SYan Zheng 35895d4f98a2SYan Zheng leaf = path->nodes[0]; 35905d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 35915d4f98a2SYan Zheng added = 0; 35925d4f98a2SYan Zheng 35935d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 35945d4f98a2SYan Zheng counted = 0; 35955d4f98a2SYan Zheng else 35965d4f98a2SYan Zheng counted = 1; 35975d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 35985d4f98a2SYan Zheng if (rb_node) { 35995d4f98a2SYan Zheng if (counted) 36005d4f98a2SYan Zheng added = 1; 36015d4f98a2SYan Zheng else 36025d4f98a2SYan Zheng path->slots[0] = nritems; 36035d4f98a2SYan Zheng } 36045d4f98a2SYan Zheng } 36055d4f98a2SYan Zheng 36065d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 3607fae7f21cSDulshani Gunawardhana if (WARN_ON(key.objectid != ref_objectid || 3608fae7f21cSDulshani Gunawardhana key.type != BTRFS_EXTENT_DATA_KEY)) 36095d4f98a2SYan Zheng break; 36105d4f98a2SYan Zheng 36115d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 36125d4f98a2SYan Zheng struct btrfs_file_extent_item); 36135d4f98a2SYan Zheng 36145d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 36155d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 36165d4f98a2SYan Zheng goto next; 36175d4f98a2SYan Zheng 36185d4f98a2SYan Zheng if (btrfs_file_extent_disk_bytenr(leaf, fi) != 36195d4f98a2SYan Zheng extent_key->objectid) 36205d4f98a2SYan Zheng goto next; 36215d4f98a2SYan Zheng 36225d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 36235d4f98a2SYan Zheng if (key.offset != ref_offset) 36245d4f98a2SYan Zheng goto next; 36255d4f98a2SYan Zheng 36265d4f98a2SYan Zheng if (counted) 36275d4f98a2SYan Zheng ref_count--; 36285d4f98a2SYan Zheng if (added) 36295d4f98a2SYan Zheng goto next; 36305d4f98a2SYan Zheng 36315d4f98a2SYan Zheng if (!tree_block_processed(leaf->start, leaf->len, rc)) { 36325d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 36335d4f98a2SYan Zheng if (!block) { 36345d4f98a2SYan Zheng err = -ENOMEM; 36355d4f98a2SYan Zheng break; 36365d4f98a2SYan Zheng } 36375d4f98a2SYan Zheng block->bytenr = leaf->start; 36385d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &block->key, 0); 36395d4f98a2SYan Zheng block->level = 0; 36405d4f98a2SYan Zheng block->key_ready = 1; 36415d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, 36425d4f98a2SYan Zheng &block->rb_node); 364343c04fb1SJeff Mahoney if (rb_node) 364443c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 364543c04fb1SJeff Mahoney block->bytenr); 36465d4f98a2SYan Zheng } 36475d4f98a2SYan Zheng if (counted) 36485d4f98a2SYan Zheng added = 1; 36495d4f98a2SYan Zheng else 36505d4f98a2SYan Zheng path->slots[0] = nritems; 36515d4f98a2SYan Zheng next: 36525d4f98a2SYan Zheng path->slots[0]++; 36535d4f98a2SYan Zheng 36545d4f98a2SYan Zheng } 36555d4f98a2SYan Zheng out: 36565d4f98a2SYan Zheng btrfs_free_path(path); 36575d4f98a2SYan Zheng return err; 36585d4f98a2SYan Zheng } 36595d4f98a2SYan Zheng 36605d4f98a2SYan Zheng /* 36612c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 36625d4f98a2SYan Zheng */ 36635d4f98a2SYan Zheng static noinline_for_stack 36645d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 36655d4f98a2SYan Zheng struct btrfs_key *extent_key, 36665d4f98a2SYan Zheng struct btrfs_path *path, 36675d4f98a2SYan Zheng struct rb_root *blocks) 36685d4f98a2SYan Zheng { 36695d4f98a2SYan Zheng struct btrfs_key key; 36705d4f98a2SYan Zheng struct extent_buffer *eb; 36715d4f98a2SYan Zheng struct btrfs_extent_data_ref *dref; 36725d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 36735d4f98a2SYan Zheng unsigned long ptr; 36745d4f98a2SYan Zheng unsigned long end; 3675707e8a07SDavid Sterba u32 blocksize = rc->extent_root->nodesize; 3676647f63bdSFilipe David Borba Manana int ret = 0; 36775d4f98a2SYan Zheng int err = 0; 36785d4f98a2SYan Zheng 36795d4f98a2SYan Zheng eb = path->nodes[0]; 36805d4f98a2SYan Zheng ptr = btrfs_item_ptr_offset(eb, path->slots[0]); 36815d4f98a2SYan Zheng end = ptr + btrfs_item_size_nr(eb, path->slots[0]); 36825d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 36835d4f98a2SYan Zheng if (ptr + sizeof(struct btrfs_extent_item_v0) == end) 36845d4f98a2SYan Zheng ptr = end; 36855d4f98a2SYan Zheng else 36865d4f98a2SYan Zheng #endif 36875d4f98a2SYan Zheng ptr += sizeof(struct btrfs_extent_item); 36885d4f98a2SYan Zheng 36895d4f98a2SYan Zheng while (ptr < end) { 36905d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 36915d4f98a2SYan Zheng key.type = btrfs_extent_inline_ref_type(eb, iref); 36925d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 36935d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 36945d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 36955d4f98a2SYan Zheng blocks); 36965d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 36975d4f98a2SYan Zheng dref = (struct btrfs_extent_data_ref *)(&iref->offset); 36985d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 36995d4f98a2SYan Zheng eb, dref, blocks); 37005d4f98a2SYan Zheng } else { 37015d4f98a2SYan Zheng BUG(); 37025d4f98a2SYan Zheng } 3703647f63bdSFilipe David Borba Manana if (ret) { 3704647f63bdSFilipe David Borba Manana err = ret; 3705647f63bdSFilipe David Borba Manana goto out; 3706647f63bdSFilipe David Borba Manana } 37075d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 37085d4f98a2SYan Zheng } 37095d4f98a2SYan Zheng WARN_ON(ptr > end); 37105d4f98a2SYan Zheng 37115d4f98a2SYan Zheng while (1) { 37125d4f98a2SYan Zheng cond_resched(); 37135d4f98a2SYan Zheng eb = path->nodes[0]; 37145d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(eb)) { 37155d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 37165d4f98a2SYan Zheng if (ret < 0) { 37175d4f98a2SYan Zheng err = ret; 37185d4f98a2SYan Zheng break; 37195d4f98a2SYan Zheng } 37205d4f98a2SYan Zheng if (ret > 0) 37215d4f98a2SYan Zheng break; 37225d4f98a2SYan Zheng eb = path->nodes[0]; 37235d4f98a2SYan Zheng } 37245d4f98a2SYan Zheng 37255d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path->slots[0]); 37265d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 37275d4f98a2SYan Zheng break; 37285d4f98a2SYan Zheng 37295d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 37305d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY || 37315d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 37325d4f98a2SYan Zheng #else 37335d4f98a2SYan Zheng BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY); 37345d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 37355d4f98a2SYan Zheng #endif 37365d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 37375d4f98a2SYan Zheng blocks); 37385d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 37395d4f98a2SYan Zheng dref = btrfs_item_ptr(eb, path->slots[0], 37405d4f98a2SYan Zheng struct btrfs_extent_data_ref); 37415d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 37425d4f98a2SYan Zheng eb, dref, blocks); 37435d4f98a2SYan Zheng } else { 37445d4f98a2SYan Zheng ret = 0; 37455d4f98a2SYan Zheng } 37465d4f98a2SYan Zheng if (ret) { 37475d4f98a2SYan Zheng err = ret; 37485d4f98a2SYan Zheng break; 37495d4f98a2SYan Zheng } 37505d4f98a2SYan Zheng path->slots[0]++; 37515d4f98a2SYan Zheng } 3752647f63bdSFilipe David Borba Manana out: 3753b3b4aa74SDavid Sterba btrfs_release_path(path); 37545d4f98a2SYan Zheng if (err) 37555d4f98a2SYan Zheng free_block_list(blocks); 37565d4f98a2SYan Zheng return err; 37575d4f98a2SYan Zheng } 37585d4f98a2SYan Zheng 37595d4f98a2SYan Zheng /* 37602c016dc2SLiu Bo * helper to find next unprocessed extent 37615d4f98a2SYan Zheng */ 37625d4f98a2SYan Zheng static noinline_for_stack 37635d4f98a2SYan Zheng int find_next_extent(struct btrfs_trans_handle *trans, 37643fd0a558SYan, Zheng 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; 38813fd0a558SYan, Zheng 388266d8f3ddSMiao Xie rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root, 388366d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 38843fd0a558SYan, Zheng if (!rc->block_rsv) 38853fd0a558SYan, Zheng return -ENOMEM; 38863fd0a558SYan, Zheng 38873fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 38883fd0a558SYan, Zheng rc->search_start = rc->block_group->key.objectid; 38893fd0a558SYan, Zheng rc->extents_found = 0; 38903fd0a558SYan, Zheng rc->nodes_relocated = 0; 38913fd0a558SYan, Zheng rc->merging_rsv_size = 0; 38920647bf56SWang Shilong rc->reserved_bytes = 0; 38930647bf56SWang Shilong rc->block_rsv->size = rc->extent_root->nodesize * 38940647bf56SWang Shilong RELOCATION_RESERVED_NODES; 38953fd0a558SYan, Zheng 38963fd0a558SYan, Zheng rc->create_reloc_tree = 1; 38973fd0a558SYan, Zheng set_reloc_control(rc); 38983fd0a558SYan, Zheng 38997a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 390028818947SLiu Bo if (IS_ERR(trans)) { 390128818947SLiu Bo unset_reloc_control(rc); 390228818947SLiu Bo /* 390328818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 390428818947SLiu Bo * cleanup. And callers are responsible to free the above 390528818947SLiu Bo * block rsv. 390628818947SLiu Bo */ 390728818947SLiu Bo return PTR_ERR(trans); 390828818947SLiu Bo } 39093fd0a558SYan, Zheng btrfs_commit_transaction(trans, rc->extent_root); 39103fd0a558SYan, Zheng return 0; 39113fd0a558SYan, Zheng } 391276dda93cSYan, Zheng 39135d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 39145d4f98a2SYan Zheng { 39155d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 39165d4f98a2SYan Zheng struct btrfs_key key; 39175d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 39185d4f98a2SYan Zheng struct btrfs_path *path; 39195d4f98a2SYan Zheng struct btrfs_extent_item *ei; 39205d4f98a2SYan Zheng u64 flags; 39215d4f98a2SYan Zheng u32 item_size; 39225d4f98a2SYan Zheng int ret; 39235d4f98a2SYan Zheng int err = 0; 3924c87f08caSChris Mason int progress = 0; 39255d4f98a2SYan Zheng 39265d4f98a2SYan Zheng path = btrfs_alloc_path(); 39273fd0a558SYan, Zheng if (!path) 39285d4f98a2SYan Zheng return -ENOMEM; 3929026fd317SJosef Bacik path->reada = 1; 39303fd0a558SYan, Zheng 39313fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 39323fd0a558SYan, Zheng if (ret) { 39333fd0a558SYan, Zheng err = ret; 39343fd0a558SYan, Zheng goto out_free; 39352423fdfbSJiri Slaby } 39365d4f98a2SYan Zheng 39375d4f98a2SYan Zheng while (1) { 39380647bf56SWang Shilong rc->reserved_bytes = 0; 39390647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 39400647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 39410647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 39420647bf56SWang Shilong if (ret) { 39430647bf56SWang Shilong err = ret; 39440647bf56SWang Shilong break; 39450647bf56SWang Shilong } 3946c87f08caSChris Mason progress++; 3947a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 39480f788c58SLiu Bo if (IS_ERR(trans)) { 39490f788c58SLiu Bo err = PTR_ERR(trans); 39500f788c58SLiu Bo trans = NULL; 39510f788c58SLiu Bo break; 39520f788c58SLiu Bo } 3953c87f08caSChris Mason restart: 39543fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 39553fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 39563fd0a558SYan, Zheng continue; 39573fd0a558SYan, Zheng } 39583fd0a558SYan, Zheng 39593fd0a558SYan, Zheng ret = find_next_extent(trans, rc, path, &key); 39605d4f98a2SYan Zheng if (ret < 0) 39615d4f98a2SYan Zheng err = ret; 39625d4f98a2SYan Zheng if (ret != 0) 39635d4f98a2SYan Zheng break; 39645d4f98a2SYan Zheng 39655d4f98a2SYan Zheng rc->extents_found++; 39665d4f98a2SYan Zheng 39675d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 39685d4f98a2SYan Zheng struct btrfs_extent_item); 39693fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 39705d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 39715d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 39725d4f98a2SYan Zheng ret = check_extent_flags(flags); 39735d4f98a2SYan Zheng BUG_ON(ret); 39745d4f98a2SYan Zheng 39755d4f98a2SYan Zheng } else { 39765d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 39775d4f98a2SYan Zheng u64 ref_owner; 39785d4f98a2SYan Zheng int path_change = 0; 39795d4f98a2SYan Zheng 39805d4f98a2SYan Zheng BUG_ON(item_size != 39815d4f98a2SYan Zheng sizeof(struct btrfs_extent_item_v0)); 39825d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, &key, &ref_owner, 39835d4f98a2SYan Zheng &path_change); 39845d4f98a2SYan Zheng if (ref_owner < BTRFS_FIRST_FREE_OBJECTID) 39855d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_TREE_BLOCK; 39865d4f98a2SYan Zheng else 39875d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_DATA; 39885d4f98a2SYan Zheng 39895d4f98a2SYan Zheng if (path_change) { 3990b3b4aa74SDavid Sterba btrfs_release_path(path); 39915d4f98a2SYan Zheng 39925d4f98a2SYan Zheng path->search_commit_root = 1; 39935d4f98a2SYan Zheng path->skip_locking = 1; 39945d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, 39955d4f98a2SYan Zheng &key, path, 0, 0); 39965d4f98a2SYan Zheng if (ret < 0) { 39975d4f98a2SYan Zheng err = ret; 39985d4f98a2SYan Zheng break; 39995d4f98a2SYan Zheng } 40005d4f98a2SYan Zheng BUG_ON(ret > 0); 40015d4f98a2SYan Zheng } 40025d4f98a2SYan Zheng #else 40035d4f98a2SYan Zheng BUG(); 40045d4f98a2SYan Zheng #endif 40055d4f98a2SYan Zheng } 40065d4f98a2SYan Zheng 40075d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 40085d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 40095d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 40105d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40115d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 40125d4f98a2SYan Zheng } else { 4013b3b4aa74SDavid Sterba btrfs_release_path(path); 40145d4f98a2SYan Zheng ret = 0; 40155d4f98a2SYan Zheng } 40165d4f98a2SYan Zheng if (ret < 0) { 40173fd0a558SYan, Zheng err = ret; 40185d4f98a2SYan Zheng break; 40195d4f98a2SYan Zheng } 40205d4f98a2SYan Zheng 40215d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 40225d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 40235d4f98a2SYan Zheng if (ret < 0) { 40241708cc57SWang Shilong /* 40251708cc57SWang Shilong * if we fail to relocate tree blocks, force to update 40261708cc57SWang Shilong * backref cache when committing transaction. 40271708cc57SWang Shilong */ 40281708cc57SWang Shilong rc->backref_cache.last_trans = trans->transid - 1; 40291708cc57SWang Shilong 40303fd0a558SYan, Zheng if (ret != -EAGAIN) { 40315d4f98a2SYan Zheng err = ret; 40325d4f98a2SYan Zheng break; 40335d4f98a2SYan Zheng } 40343fd0a558SYan, Zheng rc->extents_found--; 40353fd0a558SYan, Zheng rc->search_start = key.objectid; 40363fd0a558SYan, Zheng } 40375d4f98a2SYan Zheng } 40385d4f98a2SYan Zheng 40393fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, rc->extent_root); 4040b53d3f5dSLiu Bo btrfs_btree_balance_dirty(rc->extent_root); 40413fd0a558SYan, Zheng trans = NULL; 40425d4f98a2SYan Zheng 40435d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 40445d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40455d4f98a2SYan Zheng rc->found_file_extent = 1; 40460257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 40473fd0a558SYan, Zheng &key, &rc->cluster); 40485d4f98a2SYan Zheng if (ret < 0) { 40495d4f98a2SYan Zheng err = ret; 40505d4f98a2SYan Zheng break; 40515d4f98a2SYan Zheng } 40525d4f98a2SYan Zheng } 40535d4f98a2SYan Zheng } 4054c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 4055c87f08caSChris Mason ret = btrfs_force_chunk_alloc(trans, rc->extent_root, 4056c87f08caSChris Mason rc->block_group->flags); 4057c87f08caSChris Mason if (ret == 0) { 4058c87f08caSChris Mason err = 0; 4059c87f08caSChris Mason progress = 0; 4060c87f08caSChris Mason goto restart; 4061c87f08caSChris Mason } 4062c87f08caSChris Mason } 40633fd0a558SYan, Zheng 4064b3b4aa74SDavid Sterba btrfs_release_path(path); 40653fd0a558SYan, Zheng clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY, 40663fd0a558SYan, Zheng GFP_NOFS); 40675d4f98a2SYan Zheng 40685d4f98a2SYan Zheng if (trans) { 40693fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, rc->extent_root); 4070b53d3f5dSLiu Bo btrfs_btree_balance_dirty(rc->extent_root); 40715d4f98a2SYan Zheng } 40725d4f98a2SYan Zheng 40730257bb82SYan, Zheng if (!err) { 40743fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 40753fd0a558SYan, Zheng &rc->cluster); 40760257bb82SYan, Zheng if (ret < 0) 40770257bb82SYan, Zheng err = ret; 40780257bb82SYan, Zheng } 40790257bb82SYan, Zheng 40803fd0a558SYan, Zheng rc->create_reloc_tree = 0; 40813fd0a558SYan, Zheng set_reloc_control(rc); 40820257bb82SYan, Zheng 40833fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 40843fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1); 40855d4f98a2SYan Zheng 40863fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 40875d4f98a2SYan Zheng 40885d4f98a2SYan Zheng merge_reloc_roots(rc); 40895d4f98a2SYan Zheng 40903fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 40915d4f98a2SYan Zheng unset_reloc_control(rc); 40923fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1); 40935d4f98a2SYan Zheng 40945d4f98a2SYan Zheng /* get rid of pinned extents */ 40957a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 40963612b495STsutomu Itoh if (IS_ERR(trans)) 40973612b495STsutomu Itoh err = PTR_ERR(trans); 40983612b495STsutomu Itoh else 40995d4f98a2SYan Zheng btrfs_commit_transaction(trans, rc->extent_root); 41003fd0a558SYan, Zheng out_free: 41013fd0a558SYan, Zheng btrfs_free_block_rsv(rc->extent_root, rc->block_rsv); 41023fd0a558SYan, Zheng btrfs_free_path(path); 41035d4f98a2SYan Zheng return err; 41045d4f98a2SYan Zheng } 41055d4f98a2SYan Zheng 41065d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 41070257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 41085d4f98a2SYan Zheng { 41095d4f98a2SYan Zheng struct btrfs_path *path; 41105d4f98a2SYan Zheng struct btrfs_inode_item *item; 41115d4f98a2SYan Zheng struct extent_buffer *leaf; 41125d4f98a2SYan Zheng int ret; 41135d4f98a2SYan Zheng 41145d4f98a2SYan Zheng path = btrfs_alloc_path(); 41155d4f98a2SYan Zheng if (!path) 41165d4f98a2SYan Zheng return -ENOMEM; 41175d4f98a2SYan Zheng 41185d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 41195d4f98a2SYan Zheng if (ret) 41205d4f98a2SYan Zheng goto out; 41215d4f98a2SYan Zheng 41225d4f98a2SYan Zheng leaf = path->nodes[0]; 41235d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 41245d4f98a2SYan Zheng memset_extent_buffer(leaf, 0, (unsigned long)item, sizeof(*item)); 41255d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 41260257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 41275d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 41283fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 41293fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 41305d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 41315d4f98a2SYan Zheng out: 41325d4f98a2SYan Zheng btrfs_free_path(path); 41335d4f98a2SYan Zheng return ret; 41345d4f98a2SYan Zheng } 41355d4f98a2SYan Zheng 41365d4f98a2SYan Zheng /* 41375d4f98a2SYan Zheng * helper to create inode for data relocation. 41385d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 41395d4f98a2SYan Zheng */ 41403fd0a558SYan, Zheng static noinline_for_stack 41413fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 41425d4f98a2SYan Zheng struct btrfs_block_group_cache *group) 41435d4f98a2SYan Zheng { 41445d4f98a2SYan Zheng struct inode *inode = NULL; 41455d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 41465d4f98a2SYan Zheng struct btrfs_root *root; 41475d4f98a2SYan Zheng struct btrfs_key key; 41485d4f98a2SYan Zheng u64 objectid = BTRFS_FIRST_FREE_OBJECTID; 41495d4f98a2SYan Zheng int err = 0; 41505d4f98a2SYan Zheng 41515d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 41525d4f98a2SYan Zheng if (IS_ERR(root)) 41535d4f98a2SYan Zheng return ERR_CAST(root); 41545d4f98a2SYan Zheng 4155a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 41563fd0a558SYan, Zheng if (IS_ERR(trans)) 41573fd0a558SYan, Zheng return ERR_CAST(trans); 41585d4f98a2SYan Zheng 4159581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 41605d4f98a2SYan Zheng if (err) 41615d4f98a2SYan Zheng goto out; 41625d4f98a2SYan Zheng 41630257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 41645d4f98a2SYan Zheng BUG_ON(err); 41655d4f98a2SYan Zheng 41665d4f98a2SYan Zheng key.objectid = objectid; 41675d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 41685d4f98a2SYan Zheng key.offset = 0; 416973f73415SJosef Bacik inode = btrfs_iget(root->fs_info->sb, &key, root, NULL); 41705d4f98a2SYan Zheng BUG_ON(IS_ERR(inode) || is_bad_inode(inode)); 41715d4f98a2SYan Zheng BTRFS_I(inode)->index_cnt = group->key.objectid; 41725d4f98a2SYan Zheng 41735d4f98a2SYan Zheng err = btrfs_orphan_add(trans, inode); 41745d4f98a2SYan Zheng out: 41755d4f98a2SYan Zheng btrfs_end_transaction(trans, root); 4176b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 41775d4f98a2SYan Zheng if (err) { 41785d4f98a2SYan Zheng if (inode) 41795d4f98a2SYan Zheng iput(inode); 41805d4f98a2SYan Zheng inode = ERR_PTR(err); 41815d4f98a2SYan Zheng } 41825d4f98a2SYan Zheng return inode; 41835d4f98a2SYan Zheng } 41845d4f98a2SYan Zheng 4185a9995eecSJosef Bacik static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 41863fd0a558SYan, Zheng { 41873fd0a558SYan, Zheng struct reloc_control *rc; 41883fd0a558SYan, Zheng 41893fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 41903fd0a558SYan, Zheng if (!rc) 41913fd0a558SYan, Zheng return NULL; 41923fd0a558SYan, Zheng 41933fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 41943fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 41953fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 4196a9995eecSJosef Bacik extent_io_tree_init(&rc->processed_blocks, 4197a9995eecSJosef Bacik fs_info->btree_inode->i_mapping); 41983fd0a558SYan, Zheng return rc; 41993fd0a558SYan, Zheng } 42003fd0a558SYan, Zheng 42015d4f98a2SYan Zheng /* 42025d4f98a2SYan Zheng * function to relocate all extents in a block group. 42035d4f98a2SYan Zheng */ 42045d4f98a2SYan Zheng int btrfs_relocate_block_group(struct btrfs_root *extent_root, u64 group_start) 42055d4f98a2SYan Zheng { 42065d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = extent_root->fs_info; 42075d4f98a2SYan Zheng struct reloc_control *rc; 42080af3d00bSJosef Bacik struct inode *inode; 42090af3d00bSJosef Bacik struct btrfs_path *path; 42105d4f98a2SYan Zheng int ret; 4211f0486c68SYan, Zheng int rw = 0; 42125d4f98a2SYan Zheng int err = 0; 42135d4f98a2SYan Zheng 4214a9995eecSJosef Bacik rc = alloc_reloc_control(fs_info); 42155d4f98a2SYan Zheng if (!rc) 42165d4f98a2SYan Zheng return -ENOMEM; 42175d4f98a2SYan Zheng 4218f0486c68SYan, Zheng rc->extent_root = extent_root; 42193fd0a558SYan, Zheng 42205d4f98a2SYan Zheng rc->block_group = btrfs_lookup_block_group(fs_info, group_start); 42215d4f98a2SYan Zheng BUG_ON(!rc->block_group); 42225d4f98a2SYan Zheng 4223f0486c68SYan, Zheng if (!rc->block_group->ro) { 4224f0486c68SYan, Zheng ret = btrfs_set_block_group_ro(extent_root, rc->block_group); 4225f0486c68SYan, Zheng if (ret) { 4226f0486c68SYan, Zheng err = ret; 4227f0486c68SYan, Zheng goto out; 4228f0486c68SYan, Zheng } 4229f0486c68SYan, Zheng rw = 1; 4230f0486c68SYan, Zheng } 4231f0486c68SYan, Zheng 42320af3d00bSJosef Bacik path = btrfs_alloc_path(); 42330af3d00bSJosef Bacik if (!path) { 42340af3d00bSJosef Bacik err = -ENOMEM; 42350af3d00bSJosef Bacik goto out; 42360af3d00bSJosef Bacik } 42370af3d00bSJosef Bacik 42380af3d00bSJosef Bacik inode = lookup_free_space_inode(fs_info->tree_root, rc->block_group, 42390af3d00bSJosef Bacik path); 42400af3d00bSJosef Bacik btrfs_free_path(path); 42410af3d00bSJosef Bacik 42420af3d00bSJosef Bacik if (!IS_ERR(inode)) 42430af3d00bSJosef Bacik ret = delete_block_group_cache(fs_info, inode, 0); 42440af3d00bSJosef Bacik else 42450af3d00bSJosef Bacik ret = PTR_ERR(inode); 42460af3d00bSJosef Bacik 42470af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 42480af3d00bSJosef Bacik err = ret; 42490af3d00bSJosef Bacik goto out; 42500af3d00bSJosef Bacik } 42510af3d00bSJosef Bacik 42525d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 42535d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 42545d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 42555d4f98a2SYan Zheng rc->data_inode = NULL; 42565d4f98a2SYan Zheng goto out; 42575d4f98a2SYan Zheng } 42585d4f98a2SYan Zheng 4259efe120a0SFrank Holton btrfs_info(extent_root->fs_info, "relocating block group %llu flags %llu", 4260c1c9ff7cSGeert Uytterhoeven rc->block_group->key.objectid, rc->block_group->flags); 42615d4f98a2SYan Zheng 42626c255e67SMiao Xie ret = btrfs_start_delalloc_roots(fs_info, 0, -1); 42638ccf6f19SMiao Xie if (ret < 0) { 42648ccf6f19SMiao Xie err = ret; 42658ccf6f19SMiao Xie goto out; 42668ccf6f19SMiao Xie } 4267b0244199SMiao Xie btrfs_wait_ordered_roots(fs_info, -1); 42685d4f98a2SYan Zheng 42695d4f98a2SYan Zheng while (1) { 427076dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 42715d4f98a2SYan Zheng ret = relocate_block_group(rc); 427276dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 42735d4f98a2SYan Zheng if (ret < 0) { 42745d4f98a2SYan Zheng err = ret; 42753fd0a558SYan, Zheng goto out; 42765d4f98a2SYan Zheng } 42775d4f98a2SYan Zheng 42785d4f98a2SYan Zheng if (rc->extents_found == 0) 42795d4f98a2SYan Zheng break; 42805d4f98a2SYan Zheng 4281efe120a0SFrank Holton btrfs_info(extent_root->fs_info, "found %llu extents", 4282c1c9ff7cSGeert Uytterhoeven rc->extents_found); 42835d4f98a2SYan Zheng 42845d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 42850ef8b726SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 42860ef8b726SJosef Bacik (u64)-1); 42870ef8b726SJosef Bacik if (ret) { 42880ef8b726SJosef Bacik err = ret; 42890ef8b726SJosef Bacik goto out; 42900ef8b726SJosef Bacik } 42915d4f98a2SYan Zheng invalidate_mapping_pages(rc->data_inode->i_mapping, 42925d4f98a2SYan Zheng 0, -1); 42935d4f98a2SYan Zheng rc->stage = UPDATE_DATA_PTRS; 42945d4f98a2SYan Zheng } 42955d4f98a2SYan Zheng } 42965d4f98a2SYan Zheng 42975d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 42985d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 42995d4f98a2SYan Zheng WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0); 43005d4f98a2SYan Zheng out: 4301f0486c68SYan, Zheng if (err && rw) 4302f0486c68SYan, Zheng btrfs_set_block_group_rw(extent_root, rc->block_group); 43035d4f98a2SYan Zheng iput(rc->data_inode); 43045d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 43055d4f98a2SYan Zheng kfree(rc); 43065d4f98a2SYan Zheng return err; 43075d4f98a2SYan Zheng } 43085d4f98a2SYan Zheng 430976dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 431076dda93cSYan, Zheng { 431176dda93cSYan, Zheng struct btrfs_trans_handle *trans; 431279787eaaSJeff Mahoney int ret, err; 431376dda93cSYan, Zheng 4314a22285a6SYan, Zheng trans = btrfs_start_transaction(root->fs_info->tree_root, 0); 431579787eaaSJeff Mahoney if (IS_ERR(trans)) 431679787eaaSJeff Mahoney return PTR_ERR(trans); 431776dda93cSYan, Zheng 431876dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 431976dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 432076dda93cSYan, Zheng root->root_item.drop_level = 0; 432176dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 432276dda93cSYan, Zheng ret = btrfs_update_root(trans, root->fs_info->tree_root, 432376dda93cSYan, Zheng &root->root_key, &root->root_item); 432476dda93cSYan, Zheng 432579787eaaSJeff Mahoney err = btrfs_end_transaction(trans, root->fs_info->tree_root); 432679787eaaSJeff Mahoney if (err) 432779787eaaSJeff Mahoney return err; 432879787eaaSJeff Mahoney return ret; 432976dda93cSYan, Zheng } 433076dda93cSYan, Zheng 43315d4f98a2SYan Zheng /* 43325d4f98a2SYan Zheng * recover relocation interrupted by system crash. 43335d4f98a2SYan Zheng * 43345d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 43355d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 43365d4f98a2SYan Zheng */ 43375d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 43385d4f98a2SYan Zheng { 43395d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 43405d4f98a2SYan Zheng struct btrfs_key key; 43415d4f98a2SYan Zheng struct btrfs_root *fs_root; 43425d4f98a2SYan Zheng struct btrfs_root *reloc_root; 43435d4f98a2SYan Zheng struct btrfs_path *path; 43445d4f98a2SYan Zheng struct extent_buffer *leaf; 43455d4f98a2SYan Zheng struct reloc_control *rc = NULL; 43465d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 43475d4f98a2SYan Zheng int ret; 43485d4f98a2SYan Zheng int err = 0; 43495d4f98a2SYan Zheng 43505d4f98a2SYan Zheng path = btrfs_alloc_path(); 43515d4f98a2SYan Zheng if (!path) 43525d4f98a2SYan Zheng return -ENOMEM; 4353026fd317SJosef Bacik path->reada = -1; 43545d4f98a2SYan Zheng 43555d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 43565d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 43575d4f98a2SYan Zheng key.offset = (u64)-1; 43585d4f98a2SYan Zheng 43595d4f98a2SYan Zheng while (1) { 43605d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key, 43615d4f98a2SYan Zheng path, 0, 0); 43625d4f98a2SYan Zheng if (ret < 0) { 43635d4f98a2SYan Zheng err = ret; 43645d4f98a2SYan Zheng goto out; 43655d4f98a2SYan Zheng } 43665d4f98a2SYan Zheng if (ret > 0) { 43675d4f98a2SYan Zheng if (path->slots[0] == 0) 43685d4f98a2SYan Zheng break; 43695d4f98a2SYan Zheng path->slots[0]--; 43705d4f98a2SYan Zheng } 43715d4f98a2SYan Zheng leaf = path->nodes[0]; 43725d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4373b3b4aa74SDavid Sterba btrfs_release_path(path); 43745d4f98a2SYan Zheng 43755d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 43765d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 43775d4f98a2SYan Zheng break; 43785d4f98a2SYan Zheng 4379cb517eabSMiao Xie reloc_root = btrfs_read_fs_root(root, &key); 43805d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 43815d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 43825d4f98a2SYan Zheng goto out; 43835d4f98a2SYan Zheng } 43845d4f98a2SYan Zheng 43855d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 43865d4f98a2SYan Zheng 43875d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 43885d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 43895d4f98a2SYan Zheng reloc_root->root_key.offset); 43905d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 439176dda93cSYan, Zheng ret = PTR_ERR(fs_root); 439276dda93cSYan, Zheng if (ret != -ENOENT) { 439376dda93cSYan, Zheng err = ret; 43945d4f98a2SYan Zheng goto out; 43955d4f98a2SYan Zheng } 439679787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 439779787eaaSJeff Mahoney if (ret < 0) { 439879787eaaSJeff Mahoney err = ret; 439979787eaaSJeff Mahoney goto out; 440079787eaaSJeff Mahoney } 440176dda93cSYan, Zheng } 44025d4f98a2SYan Zheng } 44035d4f98a2SYan Zheng 44045d4f98a2SYan Zheng if (key.offset == 0) 44055d4f98a2SYan Zheng break; 44065d4f98a2SYan Zheng 44075d4f98a2SYan Zheng key.offset--; 44085d4f98a2SYan Zheng } 4409b3b4aa74SDavid Sterba btrfs_release_path(path); 44105d4f98a2SYan Zheng 44115d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 44125d4f98a2SYan Zheng goto out; 44135d4f98a2SYan Zheng 4414a9995eecSJosef Bacik rc = alloc_reloc_control(root->fs_info); 44155d4f98a2SYan Zheng if (!rc) { 44165d4f98a2SYan Zheng err = -ENOMEM; 44175d4f98a2SYan Zheng goto out; 44185d4f98a2SYan Zheng } 44195d4f98a2SYan Zheng 44205d4f98a2SYan Zheng rc->extent_root = root->fs_info->extent_root; 44215d4f98a2SYan Zheng 44225d4f98a2SYan Zheng set_reloc_control(rc); 44235d4f98a2SYan Zheng 44247a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 44253612b495STsutomu Itoh if (IS_ERR(trans)) { 44263612b495STsutomu Itoh unset_reloc_control(rc); 44273612b495STsutomu Itoh err = PTR_ERR(trans); 44283612b495STsutomu Itoh goto out_free; 44293612b495STsutomu Itoh } 44303fd0a558SYan, Zheng 44313fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 44323fd0a558SYan, Zheng 44335d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 44345d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 44355d4f98a2SYan Zheng struct btrfs_root, root_list); 44365d4f98a2SYan Zheng list_del(&reloc_root->root_list); 44375d4f98a2SYan Zheng 44385d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 44395d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 44405d4f98a2SYan Zheng &rc->reloc_roots); 44415d4f98a2SYan Zheng continue; 44425d4f98a2SYan Zheng } 44435d4f98a2SYan Zheng 44445d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 44455d4f98a2SYan Zheng reloc_root->root_key.offset); 444679787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 444779787eaaSJeff Mahoney err = PTR_ERR(fs_root); 444879787eaaSJeff Mahoney goto out_free; 444979787eaaSJeff Mahoney } 44505d4f98a2SYan Zheng 4451ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 445279787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 44535d4f98a2SYan Zheng fs_root->reloc_root = reloc_root; 44545d4f98a2SYan Zheng } 44555d4f98a2SYan Zheng 445679787eaaSJeff Mahoney err = btrfs_commit_transaction(trans, rc->extent_root); 445779787eaaSJeff Mahoney if (err) 445879787eaaSJeff Mahoney goto out_free; 44595d4f98a2SYan Zheng 44605d4f98a2SYan Zheng merge_reloc_roots(rc); 44615d4f98a2SYan Zheng 44625d4f98a2SYan Zheng unset_reloc_control(rc); 44635d4f98a2SYan Zheng 44647a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 44653612b495STsutomu Itoh if (IS_ERR(trans)) 44663612b495STsutomu Itoh err = PTR_ERR(trans); 44673612b495STsutomu Itoh else 446879787eaaSJeff Mahoney err = btrfs_commit_transaction(trans, rc->extent_root); 44693612b495STsutomu Itoh out_free: 44705d4f98a2SYan Zheng kfree(rc); 44713612b495STsutomu Itoh out: 4472aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4473aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4474aca1bba6SLiu Bo 44755d4f98a2SYan Zheng btrfs_free_path(path); 44765d4f98a2SYan Zheng 44775d4f98a2SYan Zheng if (err == 0) { 44785d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 44795d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 44805d4f98a2SYan Zheng BTRFS_DATA_RELOC_TREE_OBJECTID); 44815d4f98a2SYan Zheng if (IS_ERR(fs_root)) 44825d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4483d7ce5843SMiao Xie else 448466b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 44855d4f98a2SYan Zheng } 44865d4f98a2SYan Zheng return err; 44875d4f98a2SYan Zheng } 44885d4f98a2SYan Zheng 44895d4f98a2SYan Zheng /* 44905d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 44915d4f98a2SYan Zheng * 44925d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 44935d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 44945d4f98a2SYan Zheng */ 44955d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 44965d4f98a2SYan Zheng { 44975d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 44985d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 44995d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(inode)->root; 45005d4f98a2SYan Zheng int ret; 45015d4f98a2SYan Zheng u64 disk_bytenr; 45024577b014SJosef Bacik u64 new_bytenr; 45035d4f98a2SYan Zheng LIST_HEAD(list); 45045d4f98a2SYan Zheng 45055d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 45065d4f98a2SYan Zheng BUG_ON(ordered->file_offset != file_pos || ordered->len != len); 45075d4f98a2SYan Zheng 45085d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 45095d4f98a2SYan Zheng ret = btrfs_lookup_csums_range(root->fs_info->csum_root, disk_bytenr, 4510a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 451179787eaaSJeff Mahoney if (ret) 451279787eaaSJeff Mahoney goto out; 45135d4f98a2SYan Zheng 45145d4f98a2SYan Zheng while (!list_empty(&list)) { 45155d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 45165d4f98a2SYan Zheng list_del_init(&sums->list); 45175d4f98a2SYan Zheng 45184577b014SJosef Bacik /* 45194577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 45204577b014SJosef Bacik * We need to do this because we will read in entire prealloc 45214577b014SJosef Bacik * extents but we may have written to say the middle of the 45224577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 45234577b014SJosef Bacik * the right disk offset. 45244577b014SJosef Bacik * 45254577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 45264577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 45274577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 45284577b014SJosef Bacik * disk length. 45294577b014SJosef Bacik */ 45304577b014SJosef Bacik new_bytenr = ordered->start + (sums->bytenr - disk_bytenr); 45314577b014SJosef Bacik sums->bytenr = new_bytenr; 45325d4f98a2SYan Zheng 45335d4f98a2SYan Zheng btrfs_add_ordered_sum(inode, ordered, sums); 45345d4f98a2SYan Zheng } 453579787eaaSJeff Mahoney out: 45365d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4537411fc6bcSAndi Kleen return ret; 45385d4f98a2SYan Zheng } 45393fd0a558SYan, Zheng 454083d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 45413fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 45423fd0a558SYan, Zheng struct extent_buffer *cow) 45433fd0a558SYan, Zheng { 45443fd0a558SYan, Zheng struct reloc_control *rc; 45453fd0a558SYan, Zheng struct backref_node *node; 45463fd0a558SYan, Zheng int first_cow = 0; 45473fd0a558SYan, Zheng int level; 454883d4cfd4SJosef Bacik int ret = 0; 45493fd0a558SYan, Zheng 45503fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 45513fd0a558SYan, Zheng if (!rc) 455283d4cfd4SJosef Bacik return 0; 45533fd0a558SYan, Zheng 45543fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 45553fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 45563fd0a558SYan, Zheng 4557c974c464SWang Shilong if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 4558c974c464SWang Shilong if (buf == root->node) 4559c974c464SWang Shilong __update_reloc_root(root, cow->start); 4560c974c464SWang Shilong } 4561c974c464SWang Shilong 45623fd0a558SYan, Zheng level = btrfs_header_level(buf); 45633fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 45643fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 45653fd0a558SYan, Zheng first_cow = 1; 45663fd0a558SYan, Zheng 45673fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 45683fd0a558SYan, Zheng rc->create_reloc_tree) { 45693fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 45703fd0a558SYan, Zheng 45713fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 45723fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 45733fd0a558SYan, Zheng node->new_bytenr != buf->start); 45743fd0a558SYan, Zheng 45753fd0a558SYan, Zheng drop_node_buffer(node); 45763fd0a558SYan, Zheng extent_buffer_get(cow); 45773fd0a558SYan, Zheng node->eb = cow; 45783fd0a558SYan, Zheng node->new_bytenr = cow->start; 45793fd0a558SYan, Zheng 45803fd0a558SYan, Zheng if (!node->pending) { 45813fd0a558SYan, Zheng list_move_tail(&node->list, 45823fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 45833fd0a558SYan, Zheng node->pending = 1; 45843fd0a558SYan, Zheng } 45853fd0a558SYan, Zheng 45863fd0a558SYan, Zheng if (first_cow) 45873fd0a558SYan, Zheng __mark_block_processed(rc, node); 45883fd0a558SYan, Zheng 45893fd0a558SYan, Zheng if (first_cow && level > 0) 45903fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 45913fd0a558SYan, Zheng } 45923fd0a558SYan, Zheng 459383d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 45943fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 459583d4cfd4SJosef Bacik return ret; 45963fd0a558SYan, Zheng } 45973fd0a558SYan, Zheng 45983fd0a558SYan, Zheng /* 45993fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 46003fd0a558SYan, Zheng * requried for relocating tree blocks in the snapshot 46013fd0a558SYan, Zheng */ 46023fd0a558SYan, Zheng void btrfs_reloc_pre_snapshot(struct btrfs_trans_handle *trans, 46033fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending, 46043fd0a558SYan, Zheng u64 *bytes_to_reserve) 46053fd0a558SYan, Zheng { 46063fd0a558SYan, Zheng struct btrfs_root *root; 46073fd0a558SYan, Zheng struct reloc_control *rc; 46083fd0a558SYan, Zheng 46093fd0a558SYan, Zheng root = pending->root; 46103fd0a558SYan, Zheng if (!root->reloc_root) 46113fd0a558SYan, Zheng return; 46123fd0a558SYan, Zheng 46133fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 46143fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 46153fd0a558SYan, Zheng return; 46163fd0a558SYan, Zheng 46173fd0a558SYan, Zheng root = root->reloc_root; 46183fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 46193fd0a558SYan, Zheng /* 46203fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 46213fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 46223fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 46233fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 46243fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 46253fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 46263fd0a558SYan, Zheng * tree may use more space than it frees. so we need 46273fd0a558SYan, Zheng * reserve extra space. 46283fd0a558SYan, Zheng */ 46293fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 46303fd0a558SYan, Zheng } 46313fd0a558SYan, Zheng 46323fd0a558SYan, Zheng /* 46333fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 46343fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 46353fd0a558SYan, Zheng */ 463649b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 46373fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 46383fd0a558SYan, Zheng { 46393fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 46403fd0a558SYan, Zheng struct btrfs_root *reloc_root; 46413fd0a558SYan, Zheng struct btrfs_root *new_root; 46423fd0a558SYan, Zheng struct reloc_control *rc; 46433fd0a558SYan, Zheng int ret; 46443fd0a558SYan, Zheng 46453fd0a558SYan, Zheng if (!root->reloc_root) 464649b25e05SJeff Mahoney return 0; 46473fd0a558SYan, Zheng 46483fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 46493fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 46503fd0a558SYan, Zheng 46513fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 46523fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 46533fd0a558SYan, Zheng rc->block_rsv, 46543fd0a558SYan, Zheng rc->nodes_relocated); 465549b25e05SJeff Mahoney if (ret) 465649b25e05SJeff Mahoney return ret; 46573fd0a558SYan, Zheng } 46583fd0a558SYan, Zheng 46593fd0a558SYan, Zheng new_root = pending->snap; 46603fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 46613fd0a558SYan, Zheng new_root->root_key.objectid); 466249b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 466349b25e05SJeff Mahoney return PTR_ERR(reloc_root); 46643fd0a558SYan, Zheng 4665ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4666ffd7b339SJeff Mahoney BUG_ON(ret < 0); 46673fd0a558SYan, Zheng new_root->reloc_root = reloc_root; 46683fd0a558SYan, Zheng 466949b25e05SJeff Mahoney if (rc->create_reloc_tree) 46703fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 467149b25e05SJeff Mahoney return ret; 46723fd0a558SYan, Zheng } 4673