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 975d4f98a2SYan Zheng 985d4f98a2SYan Zheng struct backref_cache { 995d4f98a2SYan Zheng /* red black tree of all backref nodes in the cache */ 1005d4f98a2SYan Zheng struct rb_root rb_root; 1013fd0a558SYan, Zheng /* for passing backref nodes to btrfs_reloc_cow_block */ 1023fd0a558SYan, Zheng struct backref_node *path[BTRFS_MAX_LEVEL]; 1033fd0a558SYan, Zheng /* 1043fd0a558SYan, Zheng * list of blocks that have been cowed but some block 1053fd0a558SYan, Zheng * pointers in upper level blocks may not reflect the 1063fd0a558SYan, Zheng * new location 1073fd0a558SYan, Zheng */ 1085d4f98a2SYan Zheng struct list_head pending[BTRFS_MAX_LEVEL]; 1093fd0a558SYan, Zheng /* list of backref nodes with no child node */ 1103fd0a558SYan, Zheng struct list_head leaves; 1113fd0a558SYan, Zheng /* list of blocks that have been cowed in current transaction */ 1123fd0a558SYan, Zheng struct list_head changed; 1133fd0a558SYan, Zheng /* list of detached backref node. */ 1143fd0a558SYan, Zheng struct list_head detached; 1153fd0a558SYan, Zheng 1163fd0a558SYan, Zheng u64 last_trans; 1173fd0a558SYan, Zheng 1183fd0a558SYan, Zheng int nr_nodes; 1193fd0a558SYan, Zheng int nr_edges; 1205d4f98a2SYan Zheng }; 1215d4f98a2SYan Zheng 1225d4f98a2SYan Zheng /* 1235d4f98a2SYan Zheng * map address of tree root to tree 1245d4f98a2SYan Zheng */ 1255d4f98a2SYan Zheng struct mapping_node { 1265d4f98a2SYan Zheng struct rb_node rb_node; 1275d4f98a2SYan Zheng u64 bytenr; 1285d4f98a2SYan Zheng void *data; 1295d4f98a2SYan Zheng }; 1305d4f98a2SYan Zheng 1315d4f98a2SYan Zheng struct mapping_tree { 1325d4f98a2SYan Zheng struct rb_root rb_root; 1335d4f98a2SYan Zheng spinlock_t lock; 1345d4f98a2SYan Zheng }; 1355d4f98a2SYan Zheng 1365d4f98a2SYan Zheng /* 1375d4f98a2SYan Zheng * present a tree block to process 1385d4f98a2SYan Zheng */ 1395d4f98a2SYan Zheng struct tree_block { 1405d4f98a2SYan Zheng struct rb_node rb_node; 1415d4f98a2SYan Zheng u64 bytenr; 1425d4f98a2SYan Zheng struct btrfs_key key; 1435d4f98a2SYan Zheng unsigned int level:8; 1445d4f98a2SYan Zheng unsigned int key_ready:1; 1455d4f98a2SYan Zheng }; 1465d4f98a2SYan Zheng 1470257bb82SYan, Zheng #define MAX_EXTENTS 128 1480257bb82SYan, Zheng 1490257bb82SYan, Zheng struct file_extent_cluster { 1500257bb82SYan, Zheng u64 start; 1510257bb82SYan, Zheng u64 end; 1520257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 1530257bb82SYan, Zheng unsigned int nr; 1540257bb82SYan, Zheng }; 1550257bb82SYan, Zheng 1565d4f98a2SYan Zheng struct reloc_control { 1575d4f98a2SYan Zheng /* block group to relocate */ 1585d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group; 1595d4f98a2SYan Zheng /* extent tree */ 1605d4f98a2SYan Zheng struct btrfs_root *extent_root; 1615d4f98a2SYan Zheng /* inode for moving data */ 1625d4f98a2SYan Zheng struct inode *data_inode; 1633fd0a558SYan, Zheng 1643fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 1653fd0a558SYan, Zheng 1663fd0a558SYan, Zheng struct backref_cache backref_cache; 1673fd0a558SYan, Zheng 1683fd0a558SYan, Zheng struct file_extent_cluster cluster; 1695d4f98a2SYan Zheng /* tree blocks have been processed */ 1705d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 1715d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 1725d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 1735d4f98a2SYan Zheng /* list of reloc trees */ 1745d4f98a2SYan Zheng struct list_head reloc_roots; 1753fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 1763fd0a558SYan, Zheng u64 merging_rsv_size; 1773fd0a558SYan, Zheng /* size of relocated tree nodes */ 1783fd0a558SYan, Zheng u64 nodes_relocated; 1793fd0a558SYan, Zheng 1805d4f98a2SYan Zheng u64 search_start; 1815d4f98a2SYan Zheng u64 extents_found; 1823fd0a558SYan, Zheng 1833fd0a558SYan, Zheng unsigned int stage:8; 1843fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 1853fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 1865d4f98a2SYan Zheng unsigned int found_file_extent:1; 1873fd0a558SYan, Zheng unsigned int commit_transaction:1; 1885d4f98a2SYan Zheng }; 1895d4f98a2SYan Zheng 1905d4f98a2SYan Zheng /* stages of data relocation */ 1915d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 1925d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 1935d4f98a2SYan Zheng 1943fd0a558SYan, Zheng static void remove_backref_node(struct backref_cache *cache, 1953fd0a558SYan, Zheng struct backref_node *node); 1963fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 1973fd0a558SYan, Zheng struct backref_node *node); 1985d4f98a2SYan Zheng 1995d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 2005d4f98a2SYan Zheng { 2016bef4d31SEric Paris tree->rb_root = RB_ROOT; 2025d4f98a2SYan Zheng spin_lock_init(&tree->lock); 2035d4f98a2SYan Zheng } 2045d4f98a2SYan Zheng 2055d4f98a2SYan Zheng static void backref_cache_init(struct backref_cache *cache) 2065d4f98a2SYan Zheng { 2075d4f98a2SYan Zheng int i; 2086bef4d31SEric Paris cache->rb_root = RB_ROOT; 2095d4f98a2SYan Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2105d4f98a2SYan Zheng INIT_LIST_HEAD(&cache->pending[i]); 2113fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->changed); 2123fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->detached); 2133fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->leaves); 2145d4f98a2SYan Zheng } 2155d4f98a2SYan Zheng 2163fd0a558SYan, Zheng static void backref_cache_cleanup(struct backref_cache *cache) 2175d4f98a2SYan Zheng { 2183fd0a558SYan, Zheng struct backref_node *node; 2193fd0a558SYan, Zheng int i; 2203fd0a558SYan, Zheng 2213fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2223fd0a558SYan, Zheng node = list_entry(cache->detached.next, 2233fd0a558SYan, Zheng struct backref_node, list); 2243fd0a558SYan, Zheng remove_backref_node(cache, node); 2253fd0a558SYan, Zheng } 2263fd0a558SYan, Zheng 2273fd0a558SYan, Zheng while (!list_empty(&cache->leaves)) { 2283fd0a558SYan, Zheng node = list_entry(cache->leaves.next, 2293fd0a558SYan, Zheng struct backref_node, lower); 2303fd0a558SYan, Zheng remove_backref_node(cache, node); 2313fd0a558SYan, Zheng } 2323fd0a558SYan, Zheng 2333fd0a558SYan, Zheng cache->last_trans = 0; 2343fd0a558SYan, Zheng 2353fd0a558SYan, Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2363fd0a558SYan, Zheng BUG_ON(!list_empty(&cache->pending[i])); 2373fd0a558SYan, Zheng BUG_ON(!list_empty(&cache->changed)); 2383fd0a558SYan, Zheng BUG_ON(!list_empty(&cache->detached)); 2393fd0a558SYan, Zheng BUG_ON(!RB_EMPTY_ROOT(&cache->rb_root)); 2403fd0a558SYan, Zheng BUG_ON(cache->nr_nodes); 2413fd0a558SYan, Zheng BUG_ON(cache->nr_edges); 2423fd0a558SYan, Zheng } 2433fd0a558SYan, Zheng 2443fd0a558SYan, Zheng static struct backref_node *alloc_backref_node(struct backref_cache *cache) 2453fd0a558SYan, Zheng { 2463fd0a558SYan, Zheng struct backref_node *node; 2473fd0a558SYan, Zheng 2483fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 2493fd0a558SYan, Zheng if (node) { 2503fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 2515d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 2525d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 2535d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 2543fd0a558SYan, Zheng cache->nr_nodes++; 2553fd0a558SYan, Zheng } 2563fd0a558SYan, Zheng return node; 2573fd0a558SYan, Zheng } 2583fd0a558SYan, Zheng 2593fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 2603fd0a558SYan, Zheng struct backref_node *node) 2613fd0a558SYan, Zheng { 2623fd0a558SYan, Zheng if (node) { 2633fd0a558SYan, Zheng cache->nr_nodes--; 2643fd0a558SYan, Zheng kfree(node); 2653fd0a558SYan, Zheng } 2663fd0a558SYan, Zheng } 2673fd0a558SYan, Zheng 2683fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 2693fd0a558SYan, Zheng { 2703fd0a558SYan, Zheng struct backref_edge *edge; 2713fd0a558SYan, Zheng 2723fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 2733fd0a558SYan, Zheng if (edge) 2743fd0a558SYan, Zheng cache->nr_edges++; 2753fd0a558SYan, Zheng return edge; 2763fd0a558SYan, Zheng } 2773fd0a558SYan, Zheng 2783fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 2793fd0a558SYan, Zheng struct backref_edge *edge) 2803fd0a558SYan, Zheng { 2813fd0a558SYan, Zheng if (edge) { 2823fd0a558SYan, Zheng cache->nr_edges--; 2833fd0a558SYan, Zheng kfree(edge); 2843fd0a558SYan, Zheng } 2855d4f98a2SYan Zheng } 2865d4f98a2SYan Zheng 2875d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 2885d4f98a2SYan Zheng struct rb_node *node) 2895d4f98a2SYan Zheng { 2905d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 2915d4f98a2SYan Zheng struct rb_node *parent = NULL; 2925d4f98a2SYan Zheng struct tree_entry *entry; 2935d4f98a2SYan Zheng 2945d4f98a2SYan Zheng while (*p) { 2955d4f98a2SYan Zheng parent = *p; 2965d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 2975d4f98a2SYan Zheng 2985d4f98a2SYan Zheng if (bytenr < entry->bytenr) 2995d4f98a2SYan Zheng p = &(*p)->rb_left; 3005d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3015d4f98a2SYan Zheng p = &(*p)->rb_right; 3025d4f98a2SYan Zheng else 3035d4f98a2SYan Zheng return parent; 3045d4f98a2SYan Zheng } 3055d4f98a2SYan Zheng 3065d4f98a2SYan Zheng rb_link_node(node, parent, p); 3075d4f98a2SYan Zheng rb_insert_color(node, root); 3085d4f98a2SYan Zheng return NULL; 3095d4f98a2SYan Zheng } 3105d4f98a2SYan Zheng 3115d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 3125d4f98a2SYan Zheng { 3135d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 3145d4f98a2SYan Zheng struct tree_entry *entry; 3155d4f98a2SYan Zheng 3165d4f98a2SYan Zheng while (n) { 3175d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 3185d4f98a2SYan Zheng 3195d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3205d4f98a2SYan Zheng n = n->rb_left; 3215d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3225d4f98a2SYan Zheng n = n->rb_right; 3235d4f98a2SYan Zheng else 3245d4f98a2SYan Zheng return n; 3255d4f98a2SYan Zheng } 3265d4f98a2SYan Zheng return NULL; 3275d4f98a2SYan Zheng } 3285d4f98a2SYan Zheng 32948a3b636SEric Sandeen static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) 33043c04fb1SJeff Mahoney { 33143c04fb1SJeff Mahoney 33243c04fb1SJeff Mahoney struct btrfs_fs_info *fs_info = NULL; 33343c04fb1SJeff Mahoney struct backref_node *bnode = rb_entry(rb_node, struct backref_node, 33443c04fb1SJeff Mahoney rb_node); 33543c04fb1SJeff Mahoney if (bnode->root) 33643c04fb1SJeff Mahoney fs_info = bnode->root->fs_info; 33743c04fb1SJeff Mahoney btrfs_panic(fs_info, errno, "Inconsistency in backref cache " 338c1c9ff7cSGeert Uytterhoeven "found at offset %llu\n", bytenr); 33943c04fb1SJeff Mahoney } 34043c04fb1SJeff Mahoney 3415d4f98a2SYan Zheng /* 3425d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 3435d4f98a2SYan Zheng */ 3445d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 3455d4f98a2SYan Zheng struct backref_edge *edges[], 3465d4f98a2SYan Zheng int *index) 3475d4f98a2SYan Zheng { 3485d4f98a2SYan Zheng struct backref_edge *edge; 3495d4f98a2SYan Zheng int idx = *index; 3505d4f98a2SYan Zheng 3515d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 3525d4f98a2SYan Zheng edge = list_entry(node->upper.next, 3535d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3545d4f98a2SYan Zheng edges[idx++] = edge; 3555d4f98a2SYan Zheng node = edge->node[UPPER]; 3565d4f98a2SYan Zheng } 3573fd0a558SYan, Zheng BUG_ON(node->detached); 3585d4f98a2SYan Zheng *index = idx; 3595d4f98a2SYan Zheng return node; 3605d4f98a2SYan Zheng } 3615d4f98a2SYan Zheng 3625d4f98a2SYan Zheng /* 3635d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 3645d4f98a2SYan Zheng */ 3655d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 3665d4f98a2SYan Zheng int *index) 3675d4f98a2SYan Zheng { 3685d4f98a2SYan Zheng struct backref_edge *edge; 3695d4f98a2SYan Zheng struct backref_node *lower; 3705d4f98a2SYan Zheng int idx = *index; 3715d4f98a2SYan Zheng 3725d4f98a2SYan Zheng while (idx > 0) { 3735d4f98a2SYan Zheng edge = edges[idx - 1]; 3745d4f98a2SYan Zheng lower = edge->node[LOWER]; 3755d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 3765d4f98a2SYan Zheng idx--; 3775d4f98a2SYan Zheng continue; 3785d4f98a2SYan Zheng } 3795d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 3805d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3815d4f98a2SYan Zheng edges[idx - 1] = edge; 3825d4f98a2SYan Zheng *index = idx; 3835d4f98a2SYan Zheng return edge->node[UPPER]; 3845d4f98a2SYan Zheng } 3855d4f98a2SYan Zheng *index = 0; 3865d4f98a2SYan Zheng return NULL; 3875d4f98a2SYan Zheng } 3885d4f98a2SYan Zheng 3893fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 3905d4f98a2SYan Zheng { 3915d4f98a2SYan Zheng if (node->locked) { 3925d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 3935d4f98a2SYan Zheng node->locked = 0; 3945d4f98a2SYan Zheng } 3953fd0a558SYan, Zheng } 3963fd0a558SYan, Zheng 3973fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 3983fd0a558SYan, Zheng { 3993fd0a558SYan, Zheng if (node->eb) { 4003fd0a558SYan, Zheng unlock_node_buffer(node); 4015d4f98a2SYan Zheng free_extent_buffer(node->eb); 4025d4f98a2SYan Zheng node->eb = NULL; 4035d4f98a2SYan Zheng } 4045d4f98a2SYan Zheng } 4055d4f98a2SYan Zheng 4065d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 4075d4f98a2SYan Zheng struct backref_node *node) 4085d4f98a2SYan Zheng { 4095d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 4105d4f98a2SYan Zheng 4115d4f98a2SYan Zheng drop_node_buffer(node); 4123fd0a558SYan, Zheng list_del(&node->list); 4135d4f98a2SYan Zheng list_del(&node->lower); 4143fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 4155d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 4163fd0a558SYan, Zheng free_backref_node(tree, node); 4175d4f98a2SYan Zheng } 4185d4f98a2SYan Zheng 4195d4f98a2SYan Zheng /* 4205d4f98a2SYan Zheng * remove a backref node from the backref cache 4215d4f98a2SYan Zheng */ 4225d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 4235d4f98a2SYan Zheng struct backref_node *node) 4245d4f98a2SYan Zheng { 4255d4f98a2SYan Zheng struct backref_node *upper; 4265d4f98a2SYan Zheng struct backref_edge *edge; 4275d4f98a2SYan Zheng 4285d4f98a2SYan Zheng if (!node) 4295d4f98a2SYan Zheng return; 4305d4f98a2SYan Zheng 4313fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 4325d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4335d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 4345d4f98a2SYan Zheng list[LOWER]); 4355d4f98a2SYan Zheng upper = edge->node[UPPER]; 4365d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 4375d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 4383fd0a558SYan, Zheng free_backref_edge(cache, edge); 4393fd0a558SYan, Zheng 4403fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 4413fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 4423fd0a558SYan, Zheng drop_backref_node(cache, node); 4433fd0a558SYan, Zheng node = upper; 4443fd0a558SYan, Zheng node->lowest = 1; 4453fd0a558SYan, Zheng continue; 4463fd0a558SYan, Zheng } 4475d4f98a2SYan Zheng /* 4483fd0a558SYan, Zheng * add the node to leaf node list if no other 4495d4f98a2SYan Zheng * child block cached. 4505d4f98a2SYan Zheng */ 4515d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 4523fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 4535d4f98a2SYan Zheng upper->lowest = 1; 4545d4f98a2SYan Zheng } 4555d4f98a2SYan Zheng } 4563fd0a558SYan, Zheng 4575d4f98a2SYan Zheng drop_backref_node(cache, node); 4585d4f98a2SYan Zheng } 4595d4f98a2SYan Zheng 4603fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 4613fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 4623fd0a558SYan, Zheng { 4633fd0a558SYan, Zheng struct rb_node *rb_node; 4643fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 4653fd0a558SYan, Zheng node->bytenr = bytenr; 4663fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 46743c04fb1SJeff Mahoney if (rb_node) 46843c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, bytenr); 4693fd0a558SYan, Zheng } 4703fd0a558SYan, Zheng 4713fd0a558SYan, Zheng /* 4723fd0a558SYan, Zheng * update backref cache after a transaction commit 4733fd0a558SYan, Zheng */ 4743fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 4753fd0a558SYan, Zheng struct backref_cache *cache) 4763fd0a558SYan, Zheng { 4773fd0a558SYan, Zheng struct backref_node *node; 4783fd0a558SYan, Zheng int level = 0; 4793fd0a558SYan, Zheng 4803fd0a558SYan, Zheng if (cache->last_trans == 0) { 4813fd0a558SYan, Zheng cache->last_trans = trans->transid; 4823fd0a558SYan, Zheng return 0; 4833fd0a558SYan, Zheng } 4843fd0a558SYan, Zheng 4853fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 4863fd0a558SYan, Zheng return 0; 4873fd0a558SYan, Zheng 4883fd0a558SYan, Zheng /* 4893fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 4903fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 4913fd0a558SYan, Zheng * so the detached nodes are no longer useful. 4923fd0a558SYan, Zheng */ 4933fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 4943fd0a558SYan, Zheng node = list_entry(cache->detached.next, 4953fd0a558SYan, Zheng struct backref_node, list); 4963fd0a558SYan, Zheng remove_backref_node(cache, node); 4973fd0a558SYan, Zheng } 4983fd0a558SYan, Zheng 4993fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 5003fd0a558SYan, Zheng node = list_entry(cache->changed.next, 5013fd0a558SYan, Zheng struct backref_node, list); 5023fd0a558SYan, Zheng list_del_init(&node->list); 5033fd0a558SYan, Zheng BUG_ON(node->pending); 5043fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5053fd0a558SYan, Zheng } 5063fd0a558SYan, Zheng 5073fd0a558SYan, Zheng /* 5083fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 5093fd0a558SYan, Zheng * errors during processing the pending nodes. 5103fd0a558SYan, Zheng */ 5113fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 5123fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 5133fd0a558SYan, Zheng BUG_ON(!node->pending); 5143fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 5153fd0a558SYan, Zheng continue; 5163fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5173fd0a558SYan, Zheng } 5183fd0a558SYan, Zheng } 5193fd0a558SYan, Zheng 5203fd0a558SYan, Zheng cache->last_trans = 0; 5213fd0a558SYan, Zheng return 1; 5223fd0a558SYan, Zheng } 5233fd0a558SYan, Zheng 524f2a97a9dSDavid Sterba 5253fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 5263fd0a558SYan, Zheng { 5273fd0a558SYan, Zheng struct btrfs_root *reloc_root; 5283fd0a558SYan, Zheng 5293fd0a558SYan, Zheng if (!root->ref_cows) 5303fd0a558SYan, Zheng return 0; 5313fd0a558SYan, Zheng 5323fd0a558SYan, Zheng reloc_root = root->reloc_root; 5333fd0a558SYan, Zheng if (!reloc_root) 5343fd0a558SYan, Zheng return 0; 5353fd0a558SYan, Zheng 5363fd0a558SYan, Zheng if (btrfs_root_last_snapshot(&reloc_root->root_item) == 5373fd0a558SYan, Zheng root->fs_info->running_transaction->transid - 1) 5383fd0a558SYan, Zheng return 0; 5393fd0a558SYan, Zheng /* 5403fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 5413fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 5423fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 5433fd0a558SYan, Zheng * relocation. 5443fd0a558SYan, Zheng */ 5453fd0a558SYan, Zheng return 1; 5463fd0a558SYan, Zheng } 5475d4f98a2SYan Zheng /* 5485d4f98a2SYan Zheng * find reloc tree by address of tree root 5495d4f98a2SYan Zheng */ 5505d4f98a2SYan Zheng static struct btrfs_root *find_reloc_root(struct reloc_control *rc, 5515d4f98a2SYan Zheng u64 bytenr) 5525d4f98a2SYan Zheng { 5535d4f98a2SYan Zheng struct rb_node *rb_node; 5545d4f98a2SYan Zheng struct mapping_node *node; 5555d4f98a2SYan Zheng struct btrfs_root *root = NULL; 5565d4f98a2SYan Zheng 5575d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 5585d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 5595d4f98a2SYan Zheng if (rb_node) { 5605d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 5615d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 5625d4f98a2SYan Zheng } 5635d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 5645d4f98a2SYan Zheng return root; 5655d4f98a2SYan Zheng } 5665d4f98a2SYan Zheng 5675d4f98a2SYan Zheng static int is_cowonly_root(u64 root_objectid) 5685d4f98a2SYan Zheng { 5695d4f98a2SYan Zheng if (root_objectid == BTRFS_ROOT_TREE_OBJECTID || 5705d4f98a2SYan Zheng root_objectid == BTRFS_EXTENT_TREE_OBJECTID || 5715d4f98a2SYan Zheng root_objectid == BTRFS_CHUNK_TREE_OBJECTID || 5725d4f98a2SYan Zheng root_objectid == BTRFS_DEV_TREE_OBJECTID || 5735d4f98a2SYan Zheng root_objectid == BTRFS_TREE_LOG_OBJECTID || 57466463748SWang Shilong root_objectid == BTRFS_CSUM_TREE_OBJECTID || 57566463748SWang Shilong root_objectid == BTRFS_UUID_TREE_OBJECTID || 57666463748SWang Shilong root_objectid == BTRFS_QUOTA_TREE_OBJECTID) 5775d4f98a2SYan Zheng return 1; 5785d4f98a2SYan Zheng return 0; 5795d4f98a2SYan Zheng } 5805d4f98a2SYan Zheng 5815d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 5825d4f98a2SYan Zheng u64 root_objectid) 5835d4f98a2SYan Zheng { 5845d4f98a2SYan Zheng struct btrfs_key key; 5855d4f98a2SYan Zheng 5865d4f98a2SYan Zheng key.objectid = root_objectid; 5875d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 5885d4f98a2SYan Zheng if (is_cowonly_root(root_objectid)) 5895d4f98a2SYan Zheng key.offset = 0; 5905d4f98a2SYan Zheng else 5915d4f98a2SYan Zheng key.offset = (u64)-1; 5925d4f98a2SYan Zheng 593c00869f1SMiao Xie return btrfs_get_fs_root(fs_info, &key, false); 5945d4f98a2SYan Zheng } 5955d4f98a2SYan Zheng 5965d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 5975d4f98a2SYan Zheng static noinline_for_stack 5985d4f98a2SYan Zheng struct btrfs_root *find_tree_root(struct reloc_control *rc, 5995d4f98a2SYan Zheng struct extent_buffer *leaf, 6005d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0) 6015d4f98a2SYan Zheng { 6025d4f98a2SYan Zheng struct btrfs_root *root; 6035d4f98a2SYan Zheng u64 root_objectid = btrfs_ref_root_v0(leaf, ref0); 6045d4f98a2SYan Zheng u64 generation = btrfs_ref_generation_v0(leaf, ref0); 6055d4f98a2SYan Zheng 6065d4f98a2SYan Zheng BUG_ON(root_objectid == BTRFS_TREE_RELOC_OBJECTID); 6075d4f98a2SYan Zheng 6085d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, root_objectid); 6095d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 6105d4f98a2SYan Zheng 6115d4f98a2SYan Zheng if (root->ref_cows && 6125d4f98a2SYan Zheng generation != btrfs_root_generation(&root->root_item)) 6135d4f98a2SYan Zheng return NULL; 6145d4f98a2SYan Zheng 6155d4f98a2SYan Zheng return root; 6165d4f98a2SYan Zheng } 6175d4f98a2SYan Zheng #endif 6185d4f98a2SYan Zheng 6195d4f98a2SYan Zheng static noinline_for_stack 6205d4f98a2SYan Zheng int find_inline_backref(struct extent_buffer *leaf, int slot, 6215d4f98a2SYan Zheng unsigned long *ptr, unsigned long *end) 6225d4f98a2SYan Zheng { 6233173a18fSJosef Bacik struct btrfs_key key; 6245d4f98a2SYan Zheng struct btrfs_extent_item *ei; 6255d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 6265d4f98a2SYan Zheng u32 item_size; 6275d4f98a2SYan Zheng 6283173a18fSJosef Bacik btrfs_item_key_to_cpu(leaf, &key, slot); 6293173a18fSJosef Bacik 6305d4f98a2SYan Zheng item_size = btrfs_item_size_nr(leaf, slot); 6315d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 6325d4f98a2SYan Zheng if (item_size < sizeof(*ei)) { 6335d4f98a2SYan Zheng WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0)); 6345d4f98a2SYan Zheng return 1; 6355d4f98a2SYan Zheng } 6365d4f98a2SYan Zheng #endif 6375d4f98a2SYan Zheng ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); 6385d4f98a2SYan Zheng WARN_ON(!(btrfs_extent_flags(leaf, ei) & 6395d4f98a2SYan Zheng BTRFS_EXTENT_FLAG_TREE_BLOCK)); 6405d4f98a2SYan Zheng 6413173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 6423173a18fSJosef Bacik item_size <= sizeof(*ei) + sizeof(*bi)) { 6435d4f98a2SYan Zheng WARN_ON(item_size < sizeof(*ei) + sizeof(*bi)); 6445d4f98a2SYan Zheng return 1; 6455d4f98a2SYan Zheng } 646d062d13cSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 647d062d13cSJosef Bacik item_size <= sizeof(*ei)) { 648d062d13cSJosef Bacik WARN_ON(item_size < sizeof(*ei)); 649d062d13cSJosef Bacik return 1; 650d062d13cSJosef Bacik } 6515d4f98a2SYan Zheng 6523173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) { 6535d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 6545d4f98a2SYan Zheng *ptr = (unsigned long)(bi + 1); 6553173a18fSJosef Bacik } else { 6563173a18fSJosef Bacik *ptr = (unsigned long)(ei + 1); 6573173a18fSJosef Bacik } 6585d4f98a2SYan Zheng *end = (unsigned long)ei + item_size; 6595d4f98a2SYan Zheng return 0; 6605d4f98a2SYan Zheng } 6615d4f98a2SYan Zheng 6625d4f98a2SYan Zheng /* 6635d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 6645d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 6655d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 6665d4f98a2SYan Zheng * 6675d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 6685d4f98a2SYan Zheng * to find upper level blocks that refernece the block, and then check 6695d4f98a2SYan Zheng * bakcrefs of these upper level blocks recursively. the recursion stop 6705d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 6715d4f98a2SYan Zheng * 6725d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 6735d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 6745d4f98a2SYan Zheng * block are also cached. 6755d4f98a2SYan Zheng */ 6763fd0a558SYan, Zheng static noinline_for_stack 6773fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 6785d4f98a2SYan Zheng struct btrfs_key *node_key, 6795d4f98a2SYan Zheng int level, u64 bytenr) 6805d4f98a2SYan Zheng { 6813fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 6825d4f98a2SYan Zheng struct btrfs_path *path1; 6835d4f98a2SYan Zheng struct btrfs_path *path2; 6845d4f98a2SYan Zheng struct extent_buffer *eb; 6855d4f98a2SYan Zheng struct btrfs_root *root; 6865d4f98a2SYan Zheng struct backref_node *cur; 6875d4f98a2SYan Zheng struct backref_node *upper; 6885d4f98a2SYan Zheng struct backref_node *lower; 6895d4f98a2SYan Zheng struct backref_node *node = NULL; 6905d4f98a2SYan Zheng struct backref_node *exist = NULL; 6915d4f98a2SYan Zheng struct backref_edge *edge; 6925d4f98a2SYan Zheng struct rb_node *rb_node; 6935d4f98a2SYan Zheng struct btrfs_key key; 6945d4f98a2SYan Zheng unsigned long end; 6955d4f98a2SYan Zheng unsigned long ptr; 6965d4f98a2SYan Zheng LIST_HEAD(list); 6973fd0a558SYan, Zheng LIST_HEAD(useless); 6983fd0a558SYan, Zheng int cowonly; 6995d4f98a2SYan Zheng int ret; 7005d4f98a2SYan Zheng int err = 0; 701b6c60c80SJosef Bacik bool need_check = true; 7025d4f98a2SYan Zheng 7035d4f98a2SYan Zheng path1 = btrfs_alloc_path(); 7045d4f98a2SYan Zheng path2 = btrfs_alloc_path(); 7055d4f98a2SYan Zheng if (!path1 || !path2) { 7065d4f98a2SYan Zheng err = -ENOMEM; 7075d4f98a2SYan Zheng goto out; 7085d4f98a2SYan Zheng } 709026fd317SJosef Bacik path1->reada = 1; 710026fd317SJosef Bacik path2->reada = 2; 7115d4f98a2SYan Zheng 7123fd0a558SYan, Zheng node = alloc_backref_node(cache); 7135d4f98a2SYan Zheng if (!node) { 7145d4f98a2SYan Zheng err = -ENOMEM; 7155d4f98a2SYan Zheng goto out; 7165d4f98a2SYan Zheng } 7175d4f98a2SYan Zheng 7185d4f98a2SYan Zheng node->bytenr = bytenr; 7195d4f98a2SYan Zheng node->level = level; 7205d4f98a2SYan Zheng node->lowest = 1; 7215d4f98a2SYan Zheng cur = node; 7225d4f98a2SYan Zheng again: 7235d4f98a2SYan Zheng end = 0; 7245d4f98a2SYan Zheng ptr = 0; 7255d4f98a2SYan Zheng key.objectid = cur->bytenr; 7263173a18fSJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 7275d4f98a2SYan Zheng key.offset = (u64)-1; 7285d4f98a2SYan Zheng 7295d4f98a2SYan Zheng path1->search_commit_root = 1; 7305d4f98a2SYan Zheng path1->skip_locking = 1; 7315d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1, 7325d4f98a2SYan Zheng 0, 0); 7335d4f98a2SYan Zheng if (ret < 0) { 7345d4f98a2SYan Zheng err = ret; 7355d4f98a2SYan Zheng goto out; 7365d4f98a2SYan Zheng } 7375d4f98a2SYan Zheng BUG_ON(!ret || !path1->slots[0]); 7385d4f98a2SYan Zheng 7395d4f98a2SYan Zheng path1->slots[0]--; 7405d4f98a2SYan Zheng 7415d4f98a2SYan Zheng WARN_ON(cur->checked); 7425d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 7435d4f98a2SYan Zheng /* 74470f23fd6SJustin P. Mattock * the backref was added previously when processing 7455d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 7465d4f98a2SYan Zheng */ 7475d4f98a2SYan Zheng BUG_ON(!list_is_singular(&cur->upper)); 7485d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 7495d4f98a2SYan Zheng list[LOWER]); 7505d4f98a2SYan Zheng BUG_ON(!list_empty(&edge->list[UPPER])); 7515d4f98a2SYan Zheng exist = edge->node[UPPER]; 7525d4f98a2SYan Zheng /* 7535d4f98a2SYan Zheng * add the upper level block to pending list if we need 7545d4f98a2SYan Zheng * check its backrefs 7555d4f98a2SYan Zheng */ 7565d4f98a2SYan Zheng if (!exist->checked) 7575d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 7585d4f98a2SYan Zheng } else { 7595d4f98a2SYan Zheng exist = NULL; 7605d4f98a2SYan Zheng } 7615d4f98a2SYan Zheng 7625d4f98a2SYan Zheng while (1) { 7635d4f98a2SYan Zheng cond_resched(); 7645d4f98a2SYan Zheng eb = path1->nodes[0]; 7655d4f98a2SYan Zheng 7665d4f98a2SYan Zheng if (ptr >= end) { 7675d4f98a2SYan Zheng if (path1->slots[0] >= btrfs_header_nritems(eb)) { 7685d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path1); 7695d4f98a2SYan Zheng if (ret < 0) { 7705d4f98a2SYan Zheng err = ret; 7715d4f98a2SYan Zheng goto out; 7725d4f98a2SYan Zheng } 7735d4f98a2SYan Zheng if (ret > 0) 7745d4f98a2SYan Zheng break; 7755d4f98a2SYan Zheng eb = path1->nodes[0]; 7765d4f98a2SYan Zheng } 7775d4f98a2SYan Zheng 7785d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path1->slots[0]); 7795d4f98a2SYan Zheng if (key.objectid != cur->bytenr) { 7805d4f98a2SYan Zheng WARN_ON(exist); 7815d4f98a2SYan Zheng break; 7825d4f98a2SYan Zheng } 7835d4f98a2SYan Zheng 7843173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY || 7853173a18fSJosef Bacik key.type == BTRFS_METADATA_ITEM_KEY) { 7865d4f98a2SYan Zheng ret = find_inline_backref(eb, path1->slots[0], 7875d4f98a2SYan Zheng &ptr, &end); 7885d4f98a2SYan Zheng if (ret) 7895d4f98a2SYan Zheng goto next; 7905d4f98a2SYan Zheng } 7915d4f98a2SYan Zheng } 7925d4f98a2SYan Zheng 7935d4f98a2SYan Zheng if (ptr < end) { 7945d4f98a2SYan Zheng /* update key for inline back ref */ 7955d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 7965d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 7975d4f98a2SYan Zheng key.type = btrfs_extent_inline_ref_type(eb, iref); 7985d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 7995d4f98a2SYan Zheng WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY && 8005d4f98a2SYan Zheng key.type != BTRFS_SHARED_BLOCK_REF_KEY); 8015d4f98a2SYan Zheng } 8025d4f98a2SYan Zheng 8035d4f98a2SYan Zheng if (exist && 8045d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 8055d4f98a2SYan Zheng exist->owner == key.offset) || 8065d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 8075d4f98a2SYan Zheng exist->bytenr == key.offset))) { 8085d4f98a2SYan Zheng exist = NULL; 8095d4f98a2SYan Zheng goto next; 8105d4f98a2SYan Zheng } 8115d4f98a2SYan Zheng 8125d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 8135d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY || 8145d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 8153fd0a558SYan, Zheng if (key.type == BTRFS_EXTENT_REF_V0_KEY) { 8165d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 8175d4f98a2SYan Zheng ref0 = btrfs_item_ptr(eb, path1->slots[0], 8185d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 8193fd0a558SYan, Zheng if (key.objectid == key.offset) { 820046f264fSYan, Zheng root = find_tree_root(rc, eb, ref0); 8213fd0a558SYan, Zheng if (root && !should_ignore_root(root)) 8225d4f98a2SYan Zheng cur->root = root; 8235d4f98a2SYan Zheng else 8243fd0a558SYan, Zheng list_add(&cur->list, &useless); 8255d4f98a2SYan Zheng break; 8265d4f98a2SYan Zheng } 827046f264fSYan, Zheng if (is_cowonly_root(btrfs_ref_root_v0(eb, 828046f264fSYan, Zheng ref0))) 829046f264fSYan, Zheng cur->cowonly = 1; 8303fd0a558SYan, Zheng } 8315d4f98a2SYan Zheng #else 8325d4f98a2SYan Zheng BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY); 8335d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 8345d4f98a2SYan Zheng #endif 8355d4f98a2SYan Zheng if (key.objectid == key.offset) { 8365d4f98a2SYan Zheng /* 8375d4f98a2SYan Zheng * only root blocks of reloc trees use 8385d4f98a2SYan Zheng * backref of this type. 8395d4f98a2SYan Zheng */ 8405d4f98a2SYan Zheng root = find_reloc_root(rc, cur->bytenr); 8415d4f98a2SYan Zheng BUG_ON(!root); 8425d4f98a2SYan Zheng cur->root = root; 8435d4f98a2SYan Zheng break; 8445d4f98a2SYan Zheng } 8455d4f98a2SYan Zheng 8463fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 8475d4f98a2SYan Zheng if (!edge) { 8485d4f98a2SYan Zheng err = -ENOMEM; 8495d4f98a2SYan Zheng goto out; 8505d4f98a2SYan Zheng } 8515d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, key.offset); 8525d4f98a2SYan Zheng if (!rb_node) { 8533fd0a558SYan, Zheng upper = alloc_backref_node(cache); 8545d4f98a2SYan Zheng if (!upper) { 8553fd0a558SYan, Zheng free_backref_edge(cache, edge); 8565d4f98a2SYan Zheng err = -ENOMEM; 8575d4f98a2SYan Zheng goto out; 8585d4f98a2SYan Zheng } 8595d4f98a2SYan Zheng upper->bytenr = key.offset; 8605d4f98a2SYan Zheng upper->level = cur->level + 1; 8615d4f98a2SYan Zheng /* 8625d4f98a2SYan Zheng * backrefs for the upper level block isn't 8635d4f98a2SYan Zheng * cached, add the block to pending list 8645d4f98a2SYan Zheng */ 8655d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 8665d4f98a2SYan Zheng } else { 8675d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 8685d4f98a2SYan Zheng rb_node); 8693fd0a558SYan, Zheng BUG_ON(!upper->checked); 8705d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 8715d4f98a2SYan Zheng } 8723fd0a558SYan, Zheng list_add_tail(&edge->list[LOWER], &cur->upper); 8735d4f98a2SYan Zheng edge->node[LOWER] = cur; 8743fd0a558SYan, Zheng edge->node[UPPER] = upper; 8755d4f98a2SYan Zheng 8765d4f98a2SYan Zheng goto next; 8775d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 8785d4f98a2SYan Zheng goto next; 8795d4f98a2SYan Zheng } 8805d4f98a2SYan Zheng 8815d4f98a2SYan Zheng /* key.type == BTRFS_TREE_BLOCK_REF_KEY */ 8825d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, key.offset); 8835d4f98a2SYan Zheng if (IS_ERR(root)) { 8845d4f98a2SYan Zheng err = PTR_ERR(root); 8855d4f98a2SYan Zheng goto out; 8865d4f98a2SYan Zheng } 8875d4f98a2SYan Zheng 8883fd0a558SYan, Zheng if (!root->ref_cows) 8893fd0a558SYan, Zheng cur->cowonly = 1; 8903fd0a558SYan, Zheng 8915d4f98a2SYan Zheng if (btrfs_root_level(&root->root_item) == cur->level) { 8925d4f98a2SYan Zheng /* tree root */ 8935d4f98a2SYan Zheng BUG_ON(btrfs_root_bytenr(&root->root_item) != 8945d4f98a2SYan Zheng cur->bytenr); 8953fd0a558SYan, Zheng if (should_ignore_root(root)) 8963fd0a558SYan, Zheng list_add(&cur->list, &useless); 8973fd0a558SYan, Zheng else 8985d4f98a2SYan Zheng cur->root = root; 8995d4f98a2SYan Zheng break; 9005d4f98a2SYan Zheng } 9015d4f98a2SYan Zheng 9025d4f98a2SYan Zheng level = cur->level + 1; 9035d4f98a2SYan Zheng 9045d4f98a2SYan Zheng /* 9055d4f98a2SYan Zheng * searching the tree to find upper level blocks 9065d4f98a2SYan Zheng * reference the block. 9075d4f98a2SYan Zheng */ 9085d4f98a2SYan Zheng path2->search_commit_root = 1; 9095d4f98a2SYan Zheng path2->skip_locking = 1; 9105d4f98a2SYan Zheng path2->lowest_level = level; 9115d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0); 9125d4f98a2SYan Zheng path2->lowest_level = 0; 9135d4f98a2SYan Zheng if (ret < 0) { 9145d4f98a2SYan Zheng err = ret; 9155d4f98a2SYan Zheng goto out; 9165d4f98a2SYan Zheng } 91733c66f43SYan Zheng if (ret > 0 && path2->slots[level] > 0) 91833c66f43SYan Zheng path2->slots[level]--; 9195d4f98a2SYan Zheng 9205d4f98a2SYan Zheng eb = path2->nodes[level]; 9215d4f98a2SYan Zheng WARN_ON(btrfs_node_blockptr(eb, path2->slots[level]) != 9225d4f98a2SYan Zheng cur->bytenr); 9235d4f98a2SYan Zheng 9245d4f98a2SYan Zheng lower = cur; 925b6c60c80SJosef Bacik need_check = true; 9265d4f98a2SYan Zheng for (; level < BTRFS_MAX_LEVEL; level++) { 9275d4f98a2SYan Zheng if (!path2->nodes[level]) { 9285d4f98a2SYan Zheng BUG_ON(btrfs_root_bytenr(&root->root_item) != 9295d4f98a2SYan Zheng lower->bytenr); 9303fd0a558SYan, Zheng if (should_ignore_root(root)) 9313fd0a558SYan, Zheng list_add(&lower->list, &useless); 9323fd0a558SYan, Zheng else 9335d4f98a2SYan Zheng lower->root = root; 9345d4f98a2SYan Zheng break; 9355d4f98a2SYan Zheng } 9365d4f98a2SYan Zheng 9373fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 9385d4f98a2SYan Zheng if (!edge) { 9395d4f98a2SYan Zheng err = -ENOMEM; 9405d4f98a2SYan Zheng goto out; 9415d4f98a2SYan Zheng } 9425d4f98a2SYan Zheng 9435d4f98a2SYan Zheng eb = path2->nodes[level]; 9445d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, eb->start); 9455d4f98a2SYan Zheng if (!rb_node) { 9463fd0a558SYan, Zheng upper = alloc_backref_node(cache); 9475d4f98a2SYan Zheng if (!upper) { 9483fd0a558SYan, Zheng free_backref_edge(cache, edge); 9495d4f98a2SYan Zheng err = -ENOMEM; 9505d4f98a2SYan Zheng goto out; 9515d4f98a2SYan Zheng } 9525d4f98a2SYan Zheng upper->bytenr = eb->start; 9535d4f98a2SYan Zheng upper->owner = btrfs_header_owner(eb); 9545d4f98a2SYan Zheng upper->level = lower->level + 1; 9553fd0a558SYan, Zheng if (!root->ref_cows) 9563fd0a558SYan, Zheng upper->cowonly = 1; 9575d4f98a2SYan Zheng 9585d4f98a2SYan Zheng /* 9595d4f98a2SYan Zheng * if we know the block isn't shared 9605d4f98a2SYan Zheng * we can void checking its backrefs. 9615d4f98a2SYan Zheng */ 9625d4f98a2SYan Zheng if (btrfs_block_can_be_shared(root, eb)) 9635d4f98a2SYan Zheng upper->checked = 0; 9645d4f98a2SYan Zheng else 9655d4f98a2SYan Zheng upper->checked = 1; 9665d4f98a2SYan Zheng 9675d4f98a2SYan Zheng /* 9685d4f98a2SYan Zheng * add the block to pending list if we 969b6c60c80SJosef Bacik * need check its backrefs, we only do this once 970b6c60c80SJosef Bacik * while walking up a tree as we will catch 971b6c60c80SJosef Bacik * anything else later on. 9725d4f98a2SYan Zheng */ 973b6c60c80SJosef Bacik if (!upper->checked && need_check) { 974b6c60c80SJosef Bacik need_check = false; 9755d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], 9765d4f98a2SYan Zheng &list); 9775d4f98a2SYan Zheng } else 9785d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 9795d4f98a2SYan Zheng } else { 9805d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 9815d4f98a2SYan Zheng rb_node); 9825d4f98a2SYan Zheng BUG_ON(!upper->checked); 9835d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 9843fd0a558SYan, Zheng if (!upper->owner) 9853fd0a558SYan, Zheng upper->owner = btrfs_header_owner(eb); 9865d4f98a2SYan Zheng } 9875d4f98a2SYan Zheng list_add_tail(&edge->list[LOWER], &lower->upper); 9885d4f98a2SYan Zheng edge->node[LOWER] = lower; 9893fd0a558SYan, Zheng edge->node[UPPER] = upper; 9905d4f98a2SYan Zheng 9915d4f98a2SYan Zheng if (rb_node) 9925d4f98a2SYan Zheng break; 9935d4f98a2SYan Zheng lower = upper; 9945d4f98a2SYan Zheng upper = NULL; 9955d4f98a2SYan Zheng } 996b3b4aa74SDavid Sterba btrfs_release_path(path2); 9975d4f98a2SYan Zheng next: 9985d4f98a2SYan Zheng if (ptr < end) { 9995d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 10005d4f98a2SYan Zheng if (ptr >= end) { 10015d4f98a2SYan Zheng WARN_ON(ptr > end); 10025d4f98a2SYan Zheng ptr = 0; 10035d4f98a2SYan Zheng end = 0; 10045d4f98a2SYan Zheng } 10055d4f98a2SYan Zheng } 10065d4f98a2SYan Zheng if (ptr >= end) 10075d4f98a2SYan Zheng path1->slots[0]++; 10085d4f98a2SYan Zheng } 1009b3b4aa74SDavid Sterba btrfs_release_path(path1); 10105d4f98a2SYan Zheng 10115d4f98a2SYan Zheng cur->checked = 1; 10125d4f98a2SYan Zheng WARN_ON(exist); 10135d4f98a2SYan Zheng 10145d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 10155d4f98a2SYan Zheng if (!list_empty(&list)) { 10165d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10175d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10185d4f98a2SYan Zheng cur = edge->node[UPPER]; 10195d4f98a2SYan Zheng goto again; 10205d4f98a2SYan Zheng } 10215d4f98a2SYan Zheng 10225d4f98a2SYan Zheng /* 10235d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 10245d4f98a2SYan Zheng * into the cache. 10255d4f98a2SYan Zheng */ 10265d4f98a2SYan Zheng BUG_ON(!node->checked); 10273fd0a558SYan, Zheng cowonly = node->cowonly; 10283fd0a558SYan, Zheng if (!cowonly) { 10293fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 10303fd0a558SYan, Zheng &node->rb_node); 103143c04fb1SJeff Mahoney if (rb_node) 103243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 10333fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 10343fd0a558SYan, Zheng } 10355d4f98a2SYan Zheng 10365d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 10375d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10385d4f98a2SYan Zheng 10395d4f98a2SYan Zheng while (!list_empty(&list)) { 10405d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10415d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10425d4f98a2SYan Zheng upper = edge->node[UPPER]; 10433fd0a558SYan, Zheng if (upper->detached) { 10443fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10453fd0a558SYan, Zheng lower = edge->node[LOWER]; 10463fd0a558SYan, Zheng free_backref_edge(cache, edge); 10473fd0a558SYan, Zheng if (list_empty(&lower->upper)) 10483fd0a558SYan, Zheng list_add(&lower->list, &useless); 10493fd0a558SYan, Zheng continue; 10503fd0a558SYan, Zheng } 10515d4f98a2SYan Zheng 10525d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 10535d4f98a2SYan Zheng if (upper->lowest) { 10545d4f98a2SYan Zheng list_del_init(&upper->lower); 10555d4f98a2SYan Zheng upper->lowest = 0; 10565d4f98a2SYan Zheng } 10575d4f98a2SYan Zheng 10585d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10595d4f98a2SYan Zheng continue; 10605d4f98a2SYan Zheng } 10615d4f98a2SYan Zheng 10625d4f98a2SYan Zheng BUG_ON(!upper->checked); 10633fd0a558SYan, Zheng BUG_ON(cowonly != upper->cowonly); 10643fd0a558SYan, Zheng if (!cowonly) { 10655d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 10665d4f98a2SYan Zheng &upper->rb_node); 106743c04fb1SJeff Mahoney if (rb_node) 106843c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 106943c04fb1SJeff Mahoney upper->bytenr); 10703fd0a558SYan, Zheng } 10715d4f98a2SYan Zheng 10725d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10735d4f98a2SYan Zheng 10745d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 10755d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10765d4f98a2SYan Zheng } 10773fd0a558SYan, Zheng /* 10783fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 10793fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 10803fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 10813fd0a558SYan, Zheng * lookup. 10823fd0a558SYan, Zheng */ 10833fd0a558SYan, Zheng while (!list_empty(&useless)) { 10843fd0a558SYan, Zheng upper = list_entry(useless.next, struct backref_node, list); 10853fd0a558SYan, Zheng list_del_init(&upper->list); 10863fd0a558SYan, Zheng BUG_ON(!list_empty(&upper->upper)); 10873fd0a558SYan, Zheng if (upper == node) 10883fd0a558SYan, Zheng node = NULL; 10893fd0a558SYan, Zheng if (upper->lowest) { 10903fd0a558SYan, Zheng list_del_init(&upper->lower); 10913fd0a558SYan, Zheng upper->lowest = 0; 10923fd0a558SYan, Zheng } 10933fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 10943fd0a558SYan, Zheng edge = list_entry(upper->lower.next, 10953fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 10963fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 10973fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10983fd0a558SYan, Zheng lower = edge->node[LOWER]; 10993fd0a558SYan, Zheng free_backref_edge(cache, edge); 11003fd0a558SYan, Zheng 11013fd0a558SYan, Zheng if (list_empty(&lower->upper)) 11023fd0a558SYan, Zheng list_add(&lower->list, &useless); 11033fd0a558SYan, Zheng } 11043fd0a558SYan, Zheng __mark_block_processed(rc, upper); 11053fd0a558SYan, Zheng if (upper->level > 0) { 11063fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 11073fd0a558SYan, Zheng upper->detached = 1; 11083fd0a558SYan, Zheng } else { 11093fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 11103fd0a558SYan, Zheng free_backref_node(cache, upper); 11113fd0a558SYan, Zheng } 11123fd0a558SYan, Zheng } 11135d4f98a2SYan Zheng out: 11145d4f98a2SYan Zheng btrfs_free_path(path1); 11155d4f98a2SYan Zheng btrfs_free_path(path2); 11165d4f98a2SYan Zheng if (err) { 11173fd0a558SYan, Zheng while (!list_empty(&useless)) { 11183fd0a558SYan, Zheng lower = list_entry(useless.next, 11193fd0a558SYan, Zheng struct backref_node, upper); 11203fd0a558SYan, Zheng list_del_init(&lower->upper); 11213fd0a558SYan, Zheng } 11225d4f98a2SYan Zheng upper = node; 11233fd0a558SYan, Zheng INIT_LIST_HEAD(&list); 11245d4f98a2SYan Zheng while (upper) { 11255d4f98a2SYan Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 11265d4f98a2SYan Zheng list_splice_tail(&upper->upper, &list); 11273fd0a558SYan, Zheng free_backref_node(cache, upper); 11285d4f98a2SYan Zheng } 11295d4f98a2SYan Zheng 11305d4f98a2SYan Zheng if (list_empty(&list)) 11315d4f98a2SYan Zheng break; 11325d4f98a2SYan Zheng 11335d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, 11345d4f98a2SYan Zheng list[LOWER]); 11353fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11365d4f98a2SYan Zheng upper = edge->node[UPPER]; 11373fd0a558SYan, Zheng free_backref_edge(cache, edge); 11385d4f98a2SYan Zheng } 11395d4f98a2SYan Zheng return ERR_PTR(err); 11405d4f98a2SYan Zheng } 11413fd0a558SYan, Zheng BUG_ON(node && node->detached); 11425d4f98a2SYan Zheng return node; 11435d4f98a2SYan Zheng } 11445d4f98a2SYan Zheng 11455d4f98a2SYan Zheng /* 11463fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 11473fd0a558SYan, Zheng * the backref node is created by cloning backref node that 11483fd0a558SYan, Zheng * corresponds to root of source tree 11493fd0a558SYan, Zheng */ 11503fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 11513fd0a558SYan, Zheng struct reloc_control *rc, 11523fd0a558SYan, Zheng struct btrfs_root *src, 11533fd0a558SYan, Zheng struct btrfs_root *dest) 11543fd0a558SYan, Zheng { 11553fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 11563fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 11573fd0a558SYan, Zheng struct backref_node *node = NULL; 11583fd0a558SYan, Zheng struct backref_node *new_node; 11593fd0a558SYan, Zheng struct backref_edge *edge; 11603fd0a558SYan, Zheng struct backref_edge *new_edge; 11613fd0a558SYan, Zheng struct rb_node *rb_node; 11623fd0a558SYan, Zheng 11633fd0a558SYan, Zheng if (cache->last_trans > 0) 11643fd0a558SYan, Zheng update_backref_cache(trans, cache); 11653fd0a558SYan, Zheng 11663fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 11673fd0a558SYan, Zheng if (rb_node) { 11683fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 11693fd0a558SYan, Zheng if (node->detached) 11703fd0a558SYan, Zheng node = NULL; 11713fd0a558SYan, Zheng else 11723fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 11733fd0a558SYan, Zheng } 11743fd0a558SYan, Zheng 11753fd0a558SYan, Zheng if (!node) { 11763fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 11773fd0a558SYan, Zheng reloc_root->commit_root->start); 11783fd0a558SYan, Zheng if (rb_node) { 11793fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 11803fd0a558SYan, Zheng rb_node); 11813fd0a558SYan, Zheng BUG_ON(node->detached); 11823fd0a558SYan, Zheng } 11833fd0a558SYan, Zheng } 11843fd0a558SYan, Zheng 11853fd0a558SYan, Zheng if (!node) 11863fd0a558SYan, Zheng return 0; 11873fd0a558SYan, Zheng 11883fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 11893fd0a558SYan, Zheng if (!new_node) 11903fd0a558SYan, Zheng return -ENOMEM; 11913fd0a558SYan, Zheng 11923fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 11933fd0a558SYan, Zheng new_node->level = node->level; 11943fd0a558SYan, Zheng new_node->lowest = node->lowest; 11956848ad64SYan, Zheng new_node->checked = 1; 11963fd0a558SYan, Zheng new_node->root = dest; 11973fd0a558SYan, Zheng 11983fd0a558SYan, Zheng if (!node->lowest) { 11993fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 12003fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 12013fd0a558SYan, Zheng if (!new_edge) 12023fd0a558SYan, Zheng goto fail; 12033fd0a558SYan, Zheng 12043fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 12053fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 12063fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 12073fd0a558SYan, Zheng &new_node->lower); 12083fd0a558SYan, Zheng } 120976b9e23dSMiao Xie } else { 121076b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 12113fd0a558SYan, Zheng } 12123fd0a558SYan, Zheng 12133fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 12143fd0a558SYan, Zheng &new_node->rb_node); 121543c04fb1SJeff Mahoney if (rb_node) 121643c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 12173fd0a558SYan, Zheng 12183fd0a558SYan, Zheng if (!new_node->lowest) { 12193fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 12203fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 12213fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 12223fd0a558SYan, Zheng } 12233fd0a558SYan, Zheng } 12243fd0a558SYan, Zheng return 0; 12253fd0a558SYan, Zheng fail: 12263fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 12273fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 12283fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 12293fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 12303fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 12313fd0a558SYan, Zheng } 12323fd0a558SYan, Zheng free_backref_node(cache, new_node); 12333fd0a558SYan, Zheng return -ENOMEM; 12343fd0a558SYan, Zheng } 12353fd0a558SYan, Zheng 12363fd0a558SYan, Zheng /* 12375d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 12385d4f98a2SYan Zheng */ 1239ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 12405d4f98a2SYan Zheng { 12415d4f98a2SYan Zheng struct rb_node *rb_node; 12425d4f98a2SYan Zheng struct mapping_node *node; 12435d4f98a2SYan Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 12445d4f98a2SYan Zheng 12455d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1246ffd7b339SJeff Mahoney if (!node) 1247ffd7b339SJeff Mahoney return -ENOMEM; 12485d4f98a2SYan Zheng 12495d4f98a2SYan Zheng node->bytenr = root->node->start; 12505d4f98a2SYan Zheng node->data = root; 12515d4f98a2SYan Zheng 12525d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12535d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 12545d4f98a2SYan Zheng node->bytenr, &node->rb_node); 12555d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1256ffd7b339SJeff Mahoney if (rb_node) { 1257ffd7b339SJeff Mahoney btrfs_panic(root->fs_info, -EEXIST, "Duplicate root found " 1258ffd7b339SJeff Mahoney "for start=%llu while inserting into relocation " 1259533574c6SJoe Perches "tree\n", node->bytenr); 126023291a04SDan Carpenter kfree(node); 126123291a04SDan Carpenter return -EEXIST; 1262ffd7b339SJeff Mahoney } 12635d4f98a2SYan Zheng 12645d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 12655d4f98a2SYan Zheng return 0; 12665d4f98a2SYan Zheng } 12675d4f98a2SYan Zheng 12685d4f98a2SYan Zheng /* 1269c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 12705d4f98a2SYan Zheng * mapping 12715d4f98a2SYan Zheng */ 1272c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 12735d4f98a2SYan Zheng { 12745d4f98a2SYan Zheng struct rb_node *rb_node; 12755d4f98a2SYan Zheng struct mapping_node *node = NULL; 12765d4f98a2SYan Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 12775d4f98a2SYan Zheng 12785d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12795d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1280c974c464SWang Shilong root->node->start); 1281c974c464SWang Shilong if (rb_node) { 1282c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1283c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1284c974c464SWang Shilong } 1285c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1286c974c464SWang Shilong 1287c974c464SWang Shilong if (!node) 1288c974c464SWang Shilong return; 1289c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1290c974c464SWang Shilong 1291c974c464SWang Shilong spin_lock(&root->fs_info->trans_lock); 1292c974c464SWang Shilong list_del_init(&root->root_list); 1293c974c464SWang Shilong spin_unlock(&root->fs_info->trans_lock); 1294c974c464SWang Shilong kfree(node); 1295c974c464SWang Shilong } 1296c974c464SWang Shilong 1297c974c464SWang Shilong /* 1298c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1299c974c464SWang Shilong * mapping 1300c974c464SWang Shilong */ 1301c974c464SWang Shilong static int __update_reloc_root(struct btrfs_root *root, u64 new_bytenr) 1302c974c464SWang Shilong { 1303c974c464SWang Shilong struct rb_node *rb_node; 1304c974c464SWang Shilong struct mapping_node *node = NULL; 1305c974c464SWang Shilong struct reloc_control *rc = root->fs_info->reloc_ctl; 1306c974c464SWang Shilong 1307c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1308c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1309c974c464SWang Shilong root->node->start); 13105d4f98a2SYan Zheng if (rb_node) { 13115d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 13125d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 13135d4f98a2SYan Zheng } 13145d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 13155d4f98a2SYan Zheng 13168f71f3e0SLiu Bo if (!node) 13178f71f3e0SLiu Bo return 0; 13185d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 13195d4f98a2SYan Zheng 13205d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1321c974c464SWang Shilong node->bytenr = new_bytenr; 13225d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13235d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13245d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 132543c04fb1SJeff Mahoney if (rb_node) 132643c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 13275d4f98a2SYan Zheng return 0; 13285d4f98a2SYan Zheng } 13295d4f98a2SYan Zheng 13303fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 13313fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 13325d4f98a2SYan Zheng { 13335d4f98a2SYan Zheng struct btrfs_root *reloc_root; 13345d4f98a2SYan Zheng struct extent_buffer *eb; 13355d4f98a2SYan Zheng struct btrfs_root_item *root_item; 13365d4f98a2SYan Zheng struct btrfs_key root_key; 13375bc7247aSMiao Xie u64 last_snap = 0; 13385d4f98a2SYan Zheng int ret; 13395d4f98a2SYan Zheng 13405d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 13415d4f98a2SYan Zheng BUG_ON(!root_item); 13425d4f98a2SYan Zheng 13435d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 13445d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 13453fd0a558SYan, Zheng root_key.offset = objectid; 13465d4f98a2SYan Zheng 13473fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 13483fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 13495d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 13505d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 13515d4f98a2SYan Zheng BUG_ON(ret); 13525d4f98a2SYan Zheng 13535bc7247aSMiao Xie last_snap = btrfs_root_last_snapshot(&root->root_item); 13543fd0a558SYan, Zheng btrfs_set_root_last_snapshot(&root->root_item, 13553fd0a558SYan, Zheng trans->transid - 1); 13563fd0a558SYan, Zheng } else { 13573fd0a558SYan, Zheng /* 13583fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 13593fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 13603fd0a558SYan, Zheng * modified after it was created have RELOC flag 13613fd0a558SYan, Zheng * set in their headers. so it's OK to not update 13623fd0a558SYan, Zheng * the 'last_snapshot'. 13633fd0a558SYan, Zheng */ 13643fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 13653fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 13663fd0a558SYan, Zheng BUG_ON(ret); 13673fd0a558SYan, Zheng } 13683fd0a558SYan, Zheng 13695d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 13705d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 13715d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 13725d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 13733fd0a558SYan, Zheng 13743fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 13753fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 13763fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 13773fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 13785d4f98a2SYan Zheng root_item->drop_level = 0; 13795bc7247aSMiao Xie /* 13805bc7247aSMiao Xie * abuse rtransid, it is safe because it is impossible to 13815bc7247aSMiao Xie * receive data into a relocation tree. 13825bc7247aSMiao Xie */ 13835bc7247aSMiao Xie btrfs_set_root_rtransid(root_item, last_snap); 13845bc7247aSMiao Xie btrfs_set_root_otransid(root_item, trans->transid); 13853fd0a558SYan, Zheng } 13865d4f98a2SYan Zheng 13875d4f98a2SYan Zheng btrfs_tree_unlock(eb); 13885d4f98a2SYan Zheng free_extent_buffer(eb); 13895d4f98a2SYan Zheng 13905d4f98a2SYan Zheng ret = btrfs_insert_root(trans, root->fs_info->tree_root, 13915d4f98a2SYan Zheng &root_key, root_item); 13925d4f98a2SYan Zheng BUG_ON(ret); 13935d4f98a2SYan Zheng kfree(root_item); 13945d4f98a2SYan Zheng 1395cb517eabSMiao Xie reloc_root = btrfs_read_fs_root(root->fs_info->tree_root, &root_key); 13965d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 13975d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 13983fd0a558SYan, Zheng return reloc_root; 13993fd0a558SYan, Zheng } 14003fd0a558SYan, Zheng 14013fd0a558SYan, Zheng /* 14023fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 14033fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 14043fd0a558SYan, Zheng */ 14053fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 14063fd0a558SYan, Zheng struct btrfs_root *root) 14073fd0a558SYan, Zheng { 14083fd0a558SYan, Zheng struct btrfs_root *reloc_root; 14093fd0a558SYan, Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 141020dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 14113fd0a558SYan, Zheng int clear_rsv = 0; 1412ffd7b339SJeff Mahoney int ret; 14133fd0a558SYan, Zheng 14143fd0a558SYan, Zheng if (root->reloc_root) { 14153fd0a558SYan, Zheng reloc_root = root->reloc_root; 14163fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 14173fd0a558SYan, Zheng return 0; 14183fd0a558SYan, Zheng } 14193fd0a558SYan, Zheng 14203fd0a558SYan, Zheng if (!rc || !rc->create_reloc_tree || 14213fd0a558SYan, Zheng root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 14223fd0a558SYan, Zheng return 0; 14233fd0a558SYan, Zheng 142420dd2cbfSMiao Xie if (!trans->reloc_reserved) { 142520dd2cbfSMiao Xie rsv = trans->block_rsv; 14263fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 14273fd0a558SYan, Zheng clear_rsv = 1; 14283fd0a558SYan, Zheng } 14293fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 14303fd0a558SYan, Zheng if (clear_rsv) 143120dd2cbfSMiao Xie trans->block_rsv = rsv; 14325d4f98a2SYan Zheng 1433ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1434ffd7b339SJeff Mahoney BUG_ON(ret < 0); 14355d4f98a2SYan Zheng root->reloc_root = reloc_root; 14365d4f98a2SYan Zheng return 0; 14375d4f98a2SYan Zheng } 14385d4f98a2SYan Zheng 14395d4f98a2SYan Zheng /* 14405d4f98a2SYan Zheng * update root item of reloc tree 14415d4f98a2SYan Zheng */ 14425d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 14435d4f98a2SYan Zheng struct btrfs_root *root) 14445d4f98a2SYan Zheng { 14455d4f98a2SYan Zheng struct btrfs_root *reloc_root; 14465d4f98a2SYan Zheng struct btrfs_root_item *root_item; 14475d4f98a2SYan Zheng int ret; 14485d4f98a2SYan Zheng 14495d4f98a2SYan Zheng if (!root->reloc_root) 14507585717fSChris Mason goto out; 14515d4f98a2SYan Zheng 14525d4f98a2SYan Zheng reloc_root = root->reloc_root; 14535d4f98a2SYan Zheng root_item = &reloc_root->root_item; 14545d4f98a2SYan Zheng 14553fd0a558SYan, Zheng if (root->fs_info->reloc_ctl->merge_reloc_tree && 14563fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 14575d4f98a2SYan Zheng root->reloc_root = NULL; 1458c974c464SWang Shilong __del_reloc_root(reloc_root); 14595d4f98a2SYan Zheng } 14605d4f98a2SYan Zheng 14615d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 14625d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 14635d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 14645d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 14655d4f98a2SYan Zheng } 14665d4f98a2SYan Zheng 14675d4f98a2SYan Zheng ret = btrfs_update_root(trans, root->fs_info->tree_root, 14685d4f98a2SYan Zheng &reloc_root->root_key, root_item); 14695d4f98a2SYan Zheng BUG_ON(ret); 14707585717fSChris Mason 14717585717fSChris Mason out: 14725d4f98a2SYan Zheng return 0; 14735d4f98a2SYan Zheng } 14745d4f98a2SYan Zheng 14755d4f98a2SYan Zheng /* 14765d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 14775d4f98a2SYan Zheng * in a subvolume 14785d4f98a2SYan Zheng */ 14795d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 14805d4f98a2SYan Zheng { 14815d4f98a2SYan Zheng struct rb_node *node; 14825d4f98a2SYan Zheng struct rb_node *prev; 14835d4f98a2SYan Zheng struct btrfs_inode *entry; 14845d4f98a2SYan Zheng struct inode *inode; 14855d4f98a2SYan Zheng 14865d4f98a2SYan Zheng spin_lock(&root->inode_lock); 14875d4f98a2SYan Zheng again: 14885d4f98a2SYan Zheng node = root->inode_tree.rb_node; 14895d4f98a2SYan Zheng prev = NULL; 14905d4f98a2SYan Zheng while (node) { 14915d4f98a2SYan Zheng prev = node; 14925d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 14935d4f98a2SYan Zheng 149433345d01SLi Zefan if (objectid < btrfs_ino(&entry->vfs_inode)) 14955d4f98a2SYan Zheng node = node->rb_left; 149633345d01SLi Zefan else if (objectid > btrfs_ino(&entry->vfs_inode)) 14975d4f98a2SYan Zheng node = node->rb_right; 14985d4f98a2SYan Zheng else 14995d4f98a2SYan Zheng break; 15005d4f98a2SYan Zheng } 15015d4f98a2SYan Zheng if (!node) { 15025d4f98a2SYan Zheng while (prev) { 15035d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 150433345d01SLi Zefan if (objectid <= btrfs_ino(&entry->vfs_inode)) { 15055d4f98a2SYan Zheng node = prev; 15065d4f98a2SYan Zheng break; 15075d4f98a2SYan Zheng } 15085d4f98a2SYan Zheng prev = rb_next(prev); 15095d4f98a2SYan Zheng } 15105d4f98a2SYan Zheng } 15115d4f98a2SYan Zheng while (node) { 15125d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 15135d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 15145d4f98a2SYan Zheng if (inode) { 15155d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15165d4f98a2SYan Zheng return inode; 15175d4f98a2SYan Zheng } 15185d4f98a2SYan Zheng 151933345d01SLi Zefan objectid = btrfs_ino(&entry->vfs_inode) + 1; 15205d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 15215d4f98a2SYan Zheng goto again; 15225d4f98a2SYan Zheng 15235d4f98a2SYan Zheng node = rb_next(node); 15245d4f98a2SYan Zheng } 15255d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15265d4f98a2SYan Zheng return NULL; 15275d4f98a2SYan Zheng } 15285d4f98a2SYan Zheng 15295d4f98a2SYan Zheng static int in_block_group(u64 bytenr, 15305d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group) 15315d4f98a2SYan Zheng { 15325d4f98a2SYan Zheng if (bytenr >= block_group->key.objectid && 15335d4f98a2SYan Zheng bytenr < block_group->key.objectid + block_group->key.offset) 15345d4f98a2SYan Zheng return 1; 15355d4f98a2SYan Zheng return 0; 15365d4f98a2SYan Zheng } 15375d4f98a2SYan Zheng 15385d4f98a2SYan Zheng /* 15395d4f98a2SYan Zheng * get new location of data 15405d4f98a2SYan Zheng */ 15415d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 15425d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 15435d4f98a2SYan Zheng { 15445d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 15455d4f98a2SYan Zheng struct btrfs_path *path; 15465d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 15475d4f98a2SYan Zheng struct extent_buffer *leaf; 15485d4f98a2SYan Zheng int ret; 15495d4f98a2SYan Zheng 15505d4f98a2SYan Zheng path = btrfs_alloc_path(); 15515d4f98a2SYan Zheng if (!path) 15525d4f98a2SYan Zheng return -ENOMEM; 15535d4f98a2SYan Zheng 15545d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 155533345d01SLi Zefan ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(reloc_inode), 15565d4f98a2SYan Zheng bytenr, 0); 15575d4f98a2SYan Zheng if (ret < 0) 15585d4f98a2SYan Zheng goto out; 15595d4f98a2SYan Zheng if (ret > 0) { 15605d4f98a2SYan Zheng ret = -ENOENT; 15615d4f98a2SYan Zheng goto out; 15625d4f98a2SYan Zheng } 15635d4f98a2SYan Zheng 15645d4f98a2SYan Zheng leaf = path->nodes[0]; 15655d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 15665d4f98a2SYan Zheng struct btrfs_file_extent_item); 15675d4f98a2SYan Zheng 15685d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 15695d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 15705d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 15715d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 15725d4f98a2SYan Zheng 15735d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 157483d4cfd4SJosef Bacik ret = -EINVAL; 15755d4f98a2SYan Zheng goto out; 15765d4f98a2SYan Zheng } 15775d4f98a2SYan Zheng 15785d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 15795d4f98a2SYan Zheng ret = 0; 15805d4f98a2SYan Zheng out: 15815d4f98a2SYan Zheng btrfs_free_path(path); 15825d4f98a2SYan Zheng return ret; 15835d4f98a2SYan Zheng } 15845d4f98a2SYan Zheng 15855d4f98a2SYan Zheng /* 15865d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 15875d4f98a2SYan Zheng * the new locations. 15885d4f98a2SYan Zheng */ 15893fd0a558SYan, Zheng static noinline_for_stack 15903fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 15915d4f98a2SYan Zheng struct reloc_control *rc, 15925d4f98a2SYan Zheng struct btrfs_root *root, 15933fd0a558SYan, Zheng struct extent_buffer *leaf) 15945d4f98a2SYan Zheng { 15955d4f98a2SYan Zheng struct btrfs_key key; 15965d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 15975d4f98a2SYan Zheng struct inode *inode = NULL; 15985d4f98a2SYan Zheng u64 parent; 15995d4f98a2SYan Zheng u64 bytenr; 16003fd0a558SYan, Zheng u64 new_bytenr = 0; 16015d4f98a2SYan Zheng u64 num_bytes; 16025d4f98a2SYan Zheng u64 end; 16035d4f98a2SYan Zheng u32 nritems; 16045d4f98a2SYan Zheng u32 i; 160583d4cfd4SJosef Bacik int ret = 0; 16065d4f98a2SYan Zheng int first = 1; 16075d4f98a2SYan Zheng int dirty = 0; 16085d4f98a2SYan Zheng 16095d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 16105d4f98a2SYan Zheng return 0; 16115d4f98a2SYan Zheng 16125d4f98a2SYan Zheng /* reloc trees always use full backref */ 16135d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 16145d4f98a2SYan Zheng parent = leaf->start; 16155d4f98a2SYan Zheng else 16165d4f98a2SYan Zheng parent = 0; 16175d4f98a2SYan Zheng 16185d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 16195d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 16205d4f98a2SYan Zheng cond_resched(); 16215d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 16225d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 16235d4f98a2SYan Zheng continue; 16245d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 16255d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 16265d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 16275d4f98a2SYan Zheng continue; 16285d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16295d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 16305d4f98a2SYan Zheng if (bytenr == 0) 16315d4f98a2SYan Zheng continue; 16325d4f98a2SYan Zheng if (!in_block_group(bytenr, rc->block_group)) 16335d4f98a2SYan Zheng continue; 16345d4f98a2SYan Zheng 16355d4f98a2SYan Zheng /* 16365d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 16375d4f98a2SYan Zheng * to complete and drop the extent cache 16385d4f98a2SYan Zheng */ 16395d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 16405d4f98a2SYan Zheng if (first) { 16415d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16425d4f98a2SYan Zheng first = 0; 164333345d01SLi Zefan } else if (inode && btrfs_ino(inode) < key.objectid) { 16443fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 16455d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16465d4f98a2SYan Zheng } 164733345d01SLi Zefan if (inode && btrfs_ino(inode) == key.objectid) { 16485d4f98a2SYan Zheng end = key.offset + 16495d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 16505d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 16515d4f98a2SYan Zheng root->sectorsize)); 16525d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(end, root->sectorsize)); 16535d4f98a2SYan Zheng end--; 16545d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1655d0082371SJeff Mahoney key.offset, end); 16565d4f98a2SYan Zheng if (!ret) 16575d4f98a2SYan Zheng continue; 16585d4f98a2SYan Zheng 16595d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, key.offset, end, 16605d4f98a2SYan Zheng 1); 16615d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1662d0082371SJeff Mahoney key.offset, end); 16635d4f98a2SYan Zheng } 16645d4f98a2SYan Zheng } 16655d4f98a2SYan Zheng 16665d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 16675d4f98a2SYan Zheng bytenr, num_bytes); 166883d4cfd4SJosef Bacik if (ret) { 166983d4cfd4SJosef Bacik /* 167083d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 167183d4cfd4SJosef Bacik * in the file extent yet. 167283d4cfd4SJosef Bacik */ 167383d4cfd4SJosef Bacik break; 16743fd0a558SYan, Zheng } 16755d4f98a2SYan Zheng 16765d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 16775d4f98a2SYan Zheng dirty = 1; 16785d4f98a2SYan Zheng 16795d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 16805d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, root, new_bytenr, 16815d4f98a2SYan Zheng num_bytes, parent, 16825d4f98a2SYan Zheng btrfs_header_owner(leaf), 168366d7e7f0SArne Jansen key.objectid, key.offset, 1); 168483d4cfd4SJosef Bacik if (ret) { 168583d4cfd4SJosef Bacik btrfs_abort_transaction(trans, root, ret); 168683d4cfd4SJosef Bacik break; 168783d4cfd4SJosef Bacik } 16885d4f98a2SYan Zheng 16895d4f98a2SYan Zheng ret = btrfs_free_extent(trans, root, bytenr, num_bytes, 16905d4f98a2SYan Zheng parent, btrfs_header_owner(leaf), 169166d7e7f0SArne Jansen key.objectid, key.offset, 1); 169283d4cfd4SJosef Bacik if (ret) { 169383d4cfd4SJosef Bacik btrfs_abort_transaction(trans, root, ret); 169483d4cfd4SJosef Bacik break; 169583d4cfd4SJosef Bacik } 16965d4f98a2SYan Zheng } 16975d4f98a2SYan Zheng if (dirty) 16985d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 16993fd0a558SYan, Zheng if (inode) 17003fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 170183d4cfd4SJosef Bacik return ret; 17025d4f98a2SYan Zheng } 17035d4f98a2SYan Zheng 17045d4f98a2SYan Zheng static noinline_for_stack 17055d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 17065d4f98a2SYan Zheng struct btrfs_path *path, int level) 17075d4f98a2SYan Zheng { 17085d4f98a2SYan Zheng struct btrfs_disk_key key1; 17095d4f98a2SYan Zheng struct btrfs_disk_key key2; 17105d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 17115d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 17125d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 17135d4f98a2SYan Zheng } 17145d4f98a2SYan Zheng 17155d4f98a2SYan Zheng /* 17165d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 17175d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 17185d4f98a2SYan Zheng * reloc tree was create can be replaced. 17195d4f98a2SYan Zheng * 17205d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 17215d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 17225d4f98a2SYan Zheng * errors, a negative error number is returned. 17235d4f98a2SYan Zheng */ 17243fd0a558SYan, Zheng static noinline_for_stack 17253fd0a558SYan, Zheng int replace_path(struct btrfs_trans_handle *trans, 17265d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 17275d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 17285d4f98a2SYan Zheng int lowest_level, int max_level) 17295d4f98a2SYan Zheng { 17305d4f98a2SYan Zheng struct extent_buffer *eb; 17315d4f98a2SYan Zheng struct extent_buffer *parent; 17325d4f98a2SYan Zheng struct btrfs_key key; 17335d4f98a2SYan Zheng u64 old_bytenr; 17345d4f98a2SYan Zheng u64 new_bytenr; 17355d4f98a2SYan Zheng u64 old_ptr_gen; 17365d4f98a2SYan Zheng u64 new_ptr_gen; 17375d4f98a2SYan Zheng u64 last_snapshot; 17385d4f98a2SYan Zheng u32 blocksize; 17393fd0a558SYan, Zheng int cow = 0; 17405d4f98a2SYan Zheng int level; 17415d4f98a2SYan Zheng int ret; 17425d4f98a2SYan Zheng int slot; 17435d4f98a2SYan Zheng 17445d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 17455d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 17465d4f98a2SYan Zheng 17475d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 17483fd0a558SYan, Zheng again: 17495d4f98a2SYan Zheng slot = path->slots[lowest_level]; 17505d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 17515d4f98a2SYan Zheng 17525d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 17535d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 17545d4f98a2SYan Zheng level = btrfs_header_level(eb); 17555d4f98a2SYan Zheng 17565d4f98a2SYan Zheng if (level < lowest_level) { 17575d4f98a2SYan Zheng btrfs_tree_unlock(eb); 17585d4f98a2SYan Zheng free_extent_buffer(eb); 17595d4f98a2SYan Zheng return 0; 17605d4f98a2SYan Zheng } 17615d4f98a2SYan Zheng 17623fd0a558SYan, Zheng if (cow) { 17635d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 17645d4f98a2SYan Zheng BUG_ON(ret); 17653fd0a558SYan, Zheng } 17665d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 17675d4f98a2SYan Zheng 17685d4f98a2SYan Zheng if (next_key) { 17695d4f98a2SYan Zheng next_key->objectid = (u64)-1; 17705d4f98a2SYan Zheng next_key->type = (u8)-1; 17715d4f98a2SYan Zheng next_key->offset = (u64)-1; 17725d4f98a2SYan Zheng } 17735d4f98a2SYan Zheng 17745d4f98a2SYan Zheng parent = eb; 17755d4f98a2SYan Zheng while (1) { 17765d4f98a2SYan Zheng level = btrfs_header_level(parent); 17775d4f98a2SYan Zheng BUG_ON(level < lowest_level); 17785d4f98a2SYan Zheng 17795d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 17805d4f98a2SYan Zheng if (ret && slot > 0) 17815d4f98a2SYan Zheng slot--; 17825d4f98a2SYan Zheng 17835d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 17845d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 17855d4f98a2SYan Zheng 17865d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 17875d4f98a2SYan Zheng blocksize = btrfs_level_size(dest, level - 1); 17885d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 17895d4f98a2SYan Zheng 17905d4f98a2SYan Zheng if (level <= max_level) { 17915d4f98a2SYan Zheng eb = path->nodes[level]; 17925d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 17935d4f98a2SYan Zheng path->slots[level]); 17945d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 17955d4f98a2SYan Zheng path->slots[level]); 17965d4f98a2SYan Zheng } else { 17975d4f98a2SYan Zheng new_bytenr = 0; 17985d4f98a2SYan Zheng new_ptr_gen = 0; 17995d4f98a2SYan Zheng } 18005d4f98a2SYan Zheng 1801fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 18025d4f98a2SYan Zheng ret = level; 18035d4f98a2SYan Zheng break; 18045d4f98a2SYan Zheng } 18055d4f98a2SYan Zheng 18065d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 18075d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 18083fd0a558SYan, Zheng if (level <= lowest_level) { 18095d4f98a2SYan Zheng ret = 0; 18105d4f98a2SYan Zheng break; 18115d4f98a2SYan Zheng } 18125d4f98a2SYan Zheng 18135d4f98a2SYan Zheng eb = read_tree_block(dest, old_bytenr, blocksize, 18145d4f98a2SYan Zheng old_ptr_gen); 1815416bc658SJosef Bacik if (!eb || !extent_buffer_uptodate(eb)) { 1816416bc658SJosef Bacik ret = (!eb) ? -ENOMEM : -EIO; 1817416bc658SJosef Bacik free_extent_buffer(eb); 1818379cde74SStefan Behrens break; 1819416bc658SJosef Bacik } 18205d4f98a2SYan Zheng btrfs_tree_lock(eb); 18213fd0a558SYan, Zheng if (cow) { 18225d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 18235d4f98a2SYan Zheng slot, &eb); 18245d4f98a2SYan Zheng BUG_ON(ret); 18255d4f98a2SYan Zheng } 18263fd0a558SYan, Zheng btrfs_set_lock_blocking(eb); 18275d4f98a2SYan Zheng 18285d4f98a2SYan Zheng btrfs_tree_unlock(parent); 18295d4f98a2SYan Zheng free_extent_buffer(parent); 18305d4f98a2SYan Zheng 18315d4f98a2SYan Zheng parent = eb; 18325d4f98a2SYan Zheng continue; 18335d4f98a2SYan Zheng } 18345d4f98a2SYan Zheng 18353fd0a558SYan, Zheng if (!cow) { 18363fd0a558SYan, Zheng btrfs_tree_unlock(parent); 18373fd0a558SYan, Zheng free_extent_buffer(parent); 18383fd0a558SYan, Zheng cow = 1; 18393fd0a558SYan, Zheng goto again; 18403fd0a558SYan, Zheng } 18413fd0a558SYan, Zheng 18425d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 18435d4f98a2SYan Zheng path->slots[level]); 1844b3b4aa74SDavid Sterba btrfs_release_path(path); 18455d4f98a2SYan Zheng 18465d4f98a2SYan Zheng path->lowest_level = level; 18475d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 18485d4f98a2SYan Zheng path->lowest_level = 0; 18495d4f98a2SYan Zheng BUG_ON(ret); 18505d4f98a2SYan Zheng 18515d4f98a2SYan Zheng /* 18525d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 18535d4f98a2SYan Zheng */ 18545d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 18555d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 18565d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 18575d4f98a2SYan Zheng 18585d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 18595d4f98a2SYan Zheng path->slots[level], old_bytenr); 18605d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 18615d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 18625d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 18635d4f98a2SYan Zheng 18645d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, src, old_bytenr, blocksize, 18655d4f98a2SYan Zheng path->nodes[level]->start, 186666d7e7f0SArne Jansen src->root_key.objectid, level - 1, 0, 186766d7e7f0SArne Jansen 1); 18685d4f98a2SYan Zheng BUG_ON(ret); 18695d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, dest, new_bytenr, blocksize, 18705d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 187166d7e7f0SArne Jansen 0, 1); 18725d4f98a2SYan Zheng BUG_ON(ret); 18735d4f98a2SYan Zheng 18745d4f98a2SYan Zheng ret = btrfs_free_extent(trans, src, new_bytenr, blocksize, 18755d4f98a2SYan Zheng path->nodes[level]->start, 187666d7e7f0SArne Jansen src->root_key.objectid, level - 1, 0, 187766d7e7f0SArne Jansen 1); 18785d4f98a2SYan Zheng BUG_ON(ret); 18795d4f98a2SYan Zheng 18805d4f98a2SYan Zheng ret = btrfs_free_extent(trans, dest, old_bytenr, blocksize, 18815d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 188266d7e7f0SArne Jansen 0, 1); 18835d4f98a2SYan Zheng BUG_ON(ret); 18845d4f98a2SYan Zheng 18855d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 18865d4f98a2SYan Zheng 18875d4f98a2SYan Zheng ret = level; 18885d4f98a2SYan Zheng break; 18895d4f98a2SYan Zheng } 18905d4f98a2SYan Zheng btrfs_tree_unlock(parent); 18915d4f98a2SYan Zheng free_extent_buffer(parent); 18925d4f98a2SYan Zheng return ret; 18935d4f98a2SYan Zheng } 18945d4f98a2SYan Zheng 18955d4f98a2SYan Zheng /* 18965d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 18975d4f98a2SYan Zheng */ 18985d4f98a2SYan Zheng static noinline_for_stack 18995d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 19005d4f98a2SYan Zheng int *level) 19015d4f98a2SYan Zheng { 19025d4f98a2SYan Zheng struct extent_buffer *eb; 19035d4f98a2SYan Zheng int i; 19045d4f98a2SYan Zheng u64 last_snapshot; 19055d4f98a2SYan Zheng u32 nritems; 19065d4f98a2SYan Zheng 19075d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19085d4f98a2SYan Zheng 19095d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 19105d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19115d4f98a2SYan Zheng path->nodes[i] = NULL; 19125d4f98a2SYan Zheng } 19135d4f98a2SYan Zheng 19145d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 19155d4f98a2SYan Zheng eb = path->nodes[i]; 19165d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 19175d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 19185d4f98a2SYan Zheng path->slots[i]++; 19195d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 19205d4f98a2SYan Zheng last_snapshot) 19215d4f98a2SYan Zheng continue; 19225d4f98a2SYan Zheng 19235d4f98a2SYan Zheng *level = i; 19245d4f98a2SYan Zheng return 0; 19255d4f98a2SYan Zheng } 19265d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19275d4f98a2SYan Zheng path->nodes[i] = NULL; 19285d4f98a2SYan Zheng } 19295d4f98a2SYan Zheng return 1; 19305d4f98a2SYan Zheng } 19315d4f98a2SYan Zheng 19325d4f98a2SYan Zheng /* 19335d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 19345d4f98a2SYan Zheng */ 19355d4f98a2SYan Zheng static noinline_for_stack 19365d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 19375d4f98a2SYan Zheng int *level) 19385d4f98a2SYan Zheng { 19395d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 19405d4f98a2SYan Zheng int i; 19415d4f98a2SYan Zheng u64 bytenr; 19425d4f98a2SYan Zheng u64 ptr_gen = 0; 19435d4f98a2SYan Zheng u64 last_snapshot; 19445d4f98a2SYan Zheng u32 blocksize; 19455d4f98a2SYan Zheng u32 nritems; 19465d4f98a2SYan Zheng 19475d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19485d4f98a2SYan Zheng 19495d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 19505d4f98a2SYan Zheng eb = path->nodes[i]; 19515d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 19525d4f98a2SYan Zheng while (path->slots[i] < nritems) { 19535d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 19545d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 19555d4f98a2SYan Zheng break; 19565d4f98a2SYan Zheng path->slots[i]++; 19575d4f98a2SYan Zheng } 19585d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 19595d4f98a2SYan Zheng if (i == *level) 19605d4f98a2SYan Zheng break; 19615d4f98a2SYan Zheng *level = i + 1; 19625d4f98a2SYan Zheng return 0; 19635d4f98a2SYan Zheng } 19645d4f98a2SYan Zheng if (i == 1) { 19655d4f98a2SYan Zheng *level = i; 19665d4f98a2SYan Zheng return 0; 19675d4f98a2SYan Zheng } 19685d4f98a2SYan Zheng 19695d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 19705d4f98a2SYan Zheng blocksize = btrfs_level_size(root, i - 1); 19715d4f98a2SYan Zheng eb = read_tree_block(root, bytenr, blocksize, ptr_gen); 1972416bc658SJosef Bacik if (!eb || !extent_buffer_uptodate(eb)) { 1973416bc658SJosef Bacik free_extent_buffer(eb); 1974416bc658SJosef Bacik return -EIO; 1975416bc658SJosef Bacik } 19765d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 19775d4f98a2SYan Zheng path->nodes[i - 1] = eb; 19785d4f98a2SYan Zheng path->slots[i - 1] = 0; 19795d4f98a2SYan Zheng } 19805d4f98a2SYan Zheng return 1; 19815d4f98a2SYan Zheng } 19825d4f98a2SYan Zheng 19835d4f98a2SYan Zheng /* 19845d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 19855d4f98a2SYan Zheng * [min_key, max_key) 19865d4f98a2SYan Zheng */ 19875d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 19885d4f98a2SYan Zheng struct btrfs_key *min_key, 19895d4f98a2SYan Zheng struct btrfs_key *max_key) 19905d4f98a2SYan Zheng { 19915d4f98a2SYan Zheng struct inode *inode = NULL; 19925d4f98a2SYan Zheng u64 objectid; 19935d4f98a2SYan Zheng u64 start, end; 199433345d01SLi Zefan u64 ino; 19955d4f98a2SYan Zheng 19965d4f98a2SYan Zheng objectid = min_key->objectid; 19975d4f98a2SYan Zheng while (1) { 19985d4f98a2SYan Zheng cond_resched(); 19995d4f98a2SYan Zheng iput(inode); 20005d4f98a2SYan Zheng 20015d4f98a2SYan Zheng if (objectid > max_key->objectid) 20025d4f98a2SYan Zheng break; 20035d4f98a2SYan Zheng 20045d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 20055d4f98a2SYan Zheng if (!inode) 20065d4f98a2SYan Zheng break; 200733345d01SLi Zefan ino = btrfs_ino(inode); 20085d4f98a2SYan Zheng 200933345d01SLi Zefan if (ino > max_key->objectid) { 20105d4f98a2SYan Zheng iput(inode); 20115d4f98a2SYan Zheng break; 20125d4f98a2SYan Zheng } 20135d4f98a2SYan Zheng 201433345d01SLi Zefan objectid = ino + 1; 20155d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 20165d4f98a2SYan Zheng continue; 20175d4f98a2SYan Zheng 201833345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 20195d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 20205d4f98a2SYan Zheng continue; 20215d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 20225d4f98a2SYan Zheng start = 0; 20235d4f98a2SYan Zheng else { 20245d4f98a2SYan Zheng start = min_key->offset; 20255d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(start, root->sectorsize)); 20265d4f98a2SYan Zheng } 20275d4f98a2SYan Zheng } else { 20285d4f98a2SYan Zheng start = 0; 20295d4f98a2SYan Zheng } 20305d4f98a2SYan Zheng 203133345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 20325d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 20335d4f98a2SYan Zheng continue; 20345d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 20355d4f98a2SYan Zheng end = (u64)-1; 20365d4f98a2SYan Zheng } else { 20375d4f98a2SYan Zheng if (max_key->offset == 0) 20385d4f98a2SYan Zheng continue; 20395d4f98a2SYan Zheng end = max_key->offset; 20405d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(end, root->sectorsize)); 20415d4f98a2SYan Zheng end--; 20425d4f98a2SYan Zheng } 20435d4f98a2SYan Zheng } else { 20445d4f98a2SYan Zheng end = (u64)-1; 20455d4f98a2SYan Zheng } 20465d4f98a2SYan Zheng 20475d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2048d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 20495d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, start, end, 1); 2050d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 20515d4f98a2SYan Zheng } 20525d4f98a2SYan Zheng return 0; 20535d4f98a2SYan Zheng } 20545d4f98a2SYan Zheng 20555d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 20565d4f98a2SYan Zheng struct btrfs_key *key) 20575d4f98a2SYan Zheng 20585d4f98a2SYan Zheng { 20595d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 20605d4f98a2SYan Zheng if (!path->nodes[level]) 20615d4f98a2SYan Zheng break; 20625d4f98a2SYan Zheng if (path->slots[level] + 1 < 20635d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 20645d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 20655d4f98a2SYan Zheng path->slots[level] + 1); 20665d4f98a2SYan Zheng return 0; 20675d4f98a2SYan Zheng } 20685d4f98a2SYan Zheng level++; 20695d4f98a2SYan Zheng } 20705d4f98a2SYan Zheng return 1; 20715d4f98a2SYan Zheng } 20725d4f98a2SYan Zheng 20735d4f98a2SYan Zheng /* 20745d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 20755d4f98a2SYan Zheng * fs tree. 20765d4f98a2SYan Zheng */ 20775d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 20785d4f98a2SYan Zheng struct btrfs_root *root) 20795d4f98a2SYan Zheng { 20805d4f98a2SYan Zheng LIST_HEAD(inode_list); 20815d4f98a2SYan Zheng struct btrfs_key key; 20825d4f98a2SYan Zheng struct btrfs_key next_key; 20839e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 20845d4f98a2SYan Zheng struct btrfs_root *reloc_root; 20855d4f98a2SYan Zheng struct btrfs_root_item *root_item; 20865d4f98a2SYan Zheng struct btrfs_path *path; 20873fd0a558SYan, Zheng struct extent_buffer *leaf; 20885d4f98a2SYan Zheng int level; 20895d4f98a2SYan Zheng int max_level; 20905d4f98a2SYan Zheng int replaced = 0; 20915d4f98a2SYan Zheng int ret; 20925d4f98a2SYan Zheng int err = 0; 20933fd0a558SYan, Zheng u32 min_reserved; 20945d4f98a2SYan Zheng 20955d4f98a2SYan Zheng path = btrfs_alloc_path(); 20965d4f98a2SYan Zheng if (!path) 20975d4f98a2SYan Zheng return -ENOMEM; 2098026fd317SJosef Bacik path->reada = 1; 20995d4f98a2SYan Zheng 21005d4f98a2SYan Zheng reloc_root = root->reloc_root; 21015d4f98a2SYan Zheng root_item = &reloc_root->root_item; 21025d4f98a2SYan Zheng 21035d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 21045d4f98a2SYan Zheng level = btrfs_root_level(root_item); 21055d4f98a2SYan Zheng extent_buffer_get(reloc_root->node); 21065d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 21075d4f98a2SYan Zheng path->slots[level] = 0; 21085d4f98a2SYan Zheng } else { 21095d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 21105d4f98a2SYan Zheng 21115d4f98a2SYan Zheng level = root_item->drop_level; 21125d4f98a2SYan Zheng BUG_ON(level == 0); 21135d4f98a2SYan Zheng path->lowest_level = level; 21145d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 211533c66f43SYan Zheng path->lowest_level = 0; 21165d4f98a2SYan Zheng if (ret < 0) { 21175d4f98a2SYan Zheng btrfs_free_path(path); 21185d4f98a2SYan Zheng return ret; 21195d4f98a2SYan Zheng } 21205d4f98a2SYan Zheng 21215d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 21225d4f98a2SYan Zheng path->slots[level]); 21235d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 21245d4f98a2SYan Zheng 21255d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 21265d4f98a2SYan Zheng } 21275d4f98a2SYan Zheng 21283fd0a558SYan, Zheng min_reserved = root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 21295d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 21305d4f98a2SYan Zheng 21315d4f98a2SYan Zheng while (1) { 213208e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 213308e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 21343fd0a558SYan, Zheng if (ret) { 21359e6a0c52SJosef Bacik err = ret; 21369e6a0c52SJosef Bacik goto out; 21373fd0a558SYan, Zheng } 21389e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 21399e6a0c52SJosef Bacik if (IS_ERR(trans)) { 21409e6a0c52SJosef Bacik err = PTR_ERR(trans); 21419e6a0c52SJosef Bacik trans = NULL; 21429e6a0c52SJosef Bacik goto out; 21439e6a0c52SJosef Bacik } 21449e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 21453fd0a558SYan, Zheng 21463fd0a558SYan, Zheng replaced = 0; 21475d4f98a2SYan Zheng max_level = level; 21485d4f98a2SYan Zheng 21495d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 21505d4f98a2SYan Zheng if (ret < 0) { 21515d4f98a2SYan Zheng err = ret; 21525d4f98a2SYan Zheng goto out; 21535d4f98a2SYan Zheng } 21545d4f98a2SYan Zheng if (ret > 0) 21555d4f98a2SYan Zheng break; 21565d4f98a2SYan Zheng 21575d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 21585d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 21595d4f98a2SYan Zheng ret = 0; 21605d4f98a2SYan Zheng } else { 21613fd0a558SYan, Zheng ret = replace_path(trans, root, reloc_root, path, 21623fd0a558SYan, Zheng &next_key, level, max_level); 21635d4f98a2SYan Zheng } 21645d4f98a2SYan Zheng if (ret < 0) { 21655d4f98a2SYan Zheng err = ret; 21665d4f98a2SYan Zheng goto out; 21675d4f98a2SYan Zheng } 21685d4f98a2SYan Zheng 21695d4f98a2SYan Zheng if (ret > 0) { 21705d4f98a2SYan Zheng level = ret; 21715d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 21725d4f98a2SYan Zheng path->slots[level]); 21735d4f98a2SYan Zheng replaced = 1; 21745d4f98a2SYan Zheng } 21755d4f98a2SYan Zheng 21765d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 21775d4f98a2SYan Zheng if (ret > 0) 21785d4f98a2SYan Zheng break; 21795d4f98a2SYan Zheng 21805d4f98a2SYan Zheng BUG_ON(level == 0); 21815d4f98a2SYan Zheng /* 21825d4f98a2SYan Zheng * save the merging progress in the drop_progress. 21835d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 21845d4f98a2SYan Zheng */ 21855d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 21865d4f98a2SYan Zheng path->slots[level]); 21875d4f98a2SYan Zheng root_item->drop_level = level; 21885d4f98a2SYan Zheng 21893fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, root); 21909e6a0c52SJosef Bacik trans = NULL; 21915d4f98a2SYan Zheng 2192b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 21935d4f98a2SYan Zheng 21945d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 21955d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 21965d4f98a2SYan Zheng } 21975d4f98a2SYan Zheng 21985d4f98a2SYan Zheng /* 21995d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 22005d4f98a2SYan Zheng * relocated and the block is tree root. 22015d4f98a2SYan Zheng */ 22025d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 22035d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 22045d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 22055d4f98a2SYan Zheng free_extent_buffer(leaf); 22065d4f98a2SYan Zheng if (ret < 0) 22075d4f98a2SYan Zheng err = ret; 22085d4f98a2SYan Zheng out: 22095d4f98a2SYan Zheng btrfs_free_path(path); 22105d4f98a2SYan Zheng 22115d4f98a2SYan Zheng if (err == 0) { 22125d4f98a2SYan Zheng memset(&root_item->drop_progress, 0, 22135d4f98a2SYan Zheng sizeof(root_item->drop_progress)); 22145d4f98a2SYan Zheng root_item->drop_level = 0; 22155d4f98a2SYan Zheng btrfs_set_root_refs(root_item, 0); 22163fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 22175d4f98a2SYan Zheng } 22185d4f98a2SYan Zheng 22199e6a0c52SJosef Bacik if (trans) 22203fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, root); 22215d4f98a2SYan Zheng 2222b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 22235d4f98a2SYan Zheng 22245d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 22255d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 22265d4f98a2SYan Zheng 22275d4f98a2SYan Zheng return err; 22285d4f98a2SYan Zheng } 22295d4f98a2SYan Zheng 22303fd0a558SYan, Zheng static noinline_for_stack 22313fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 22325d4f98a2SYan Zheng { 22333fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 22343fd0a558SYan, Zheng struct btrfs_root *reloc_root; 22355d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 22363fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 22373fd0a558SYan, Zheng u64 num_bytes = 0; 22383fd0a558SYan, Zheng int ret; 22393fd0a558SYan, Zheng 22407585717fSChris Mason mutex_lock(&root->fs_info->reloc_mutex); 22413fd0a558SYan, Zheng rc->merging_rsv_size += root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 22423fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 22437585717fSChris Mason mutex_unlock(&root->fs_info->reloc_mutex); 22447585717fSChris Mason 22453fd0a558SYan, Zheng again: 22463fd0a558SYan, Zheng if (!err) { 22473fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 224808e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 224908e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 22503fd0a558SYan, Zheng if (ret) 22513fd0a558SYan, Zheng err = ret; 22523fd0a558SYan, Zheng } 22533fd0a558SYan, Zheng 22547a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 22553612b495STsutomu Itoh if (IS_ERR(trans)) { 22563612b495STsutomu Itoh if (!err) 22573612b495STsutomu Itoh btrfs_block_rsv_release(rc->extent_root, 22583612b495STsutomu Itoh rc->block_rsv, num_bytes); 22593612b495STsutomu Itoh return PTR_ERR(trans); 22603612b495STsutomu Itoh } 22613fd0a558SYan, Zheng 22623fd0a558SYan, Zheng if (!err) { 22633fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 22643fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 22653fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, 22663fd0a558SYan, Zheng rc->block_rsv, num_bytes); 22673fd0a558SYan, Zheng goto again; 22683fd0a558SYan, Zheng } 22693fd0a558SYan, Zheng } 22703fd0a558SYan, Zheng 22713fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 22723fd0a558SYan, Zheng 22733fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 22743fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 22753fd0a558SYan, Zheng struct btrfs_root, root_list); 22763fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 22773fd0a558SYan, Zheng 22783fd0a558SYan, Zheng root = read_fs_root(reloc_root->fs_info, 22793fd0a558SYan, Zheng reloc_root->root_key.offset); 22803fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 22813fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 22823fd0a558SYan, Zheng 22833fd0a558SYan, Zheng /* 22843fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 22853fd0a558SYan, Zheng * knows it should resumes merging 22863fd0a558SYan, Zheng */ 22873fd0a558SYan, Zheng if (!err) 22883fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 22893fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 22903fd0a558SYan, Zheng 22913fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 22923fd0a558SYan, Zheng } 22933fd0a558SYan, Zheng 22943fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 22953fd0a558SYan, Zheng 22963fd0a558SYan, Zheng if (!err) 22973fd0a558SYan, Zheng btrfs_commit_transaction(trans, rc->extent_root); 22983fd0a558SYan, Zheng else 22993fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 23003fd0a558SYan, Zheng return err; 23013fd0a558SYan, Zheng } 23023fd0a558SYan, Zheng 23033fd0a558SYan, Zheng static noinline_for_stack 2304aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2305aca1bba6SLiu Bo { 2306aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2307aca1bba6SLiu Bo 2308aca1bba6SLiu Bo while (!list_empty(list)) { 2309aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2310aca1bba6SLiu Bo root_list); 2311c974c464SWang Shilong __del_reloc_root(reloc_root); 2312aca1bba6SLiu Bo free_extent_buffer(reloc_root->node); 2313aca1bba6SLiu Bo free_extent_buffer(reloc_root->commit_root); 2314aca1bba6SLiu Bo kfree(reloc_root); 2315aca1bba6SLiu Bo } 2316aca1bba6SLiu Bo } 2317aca1bba6SLiu Bo 2318aca1bba6SLiu Bo static noinline_for_stack 23193fd0a558SYan, Zheng int merge_reloc_roots(struct reloc_control *rc) 23203fd0a558SYan, Zheng { 23215bc7247aSMiao Xie struct btrfs_trans_handle *trans; 23225d4f98a2SYan Zheng struct btrfs_root *root; 23235d4f98a2SYan Zheng struct btrfs_root *reloc_root; 23245bc7247aSMiao Xie u64 last_snap; 23255bc7247aSMiao Xie u64 otransid; 23265bc7247aSMiao Xie u64 objectid; 23273fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 23283fd0a558SYan, Zheng int found = 0; 2329aca1bba6SLiu Bo int ret = 0; 23303fd0a558SYan, Zheng again: 23313fd0a558SYan, Zheng root = rc->extent_root; 23327585717fSChris Mason 23337585717fSChris Mason /* 23347585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 23357585717fSChris Mason * we have to make sure nobody is in the middle of 23367585717fSChris Mason * adding their roots to the list while we are 23377585717fSChris Mason * doing this splice 23387585717fSChris Mason */ 23397585717fSChris Mason mutex_lock(&root->fs_info->reloc_mutex); 23403fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 23417585717fSChris Mason mutex_unlock(&root->fs_info->reloc_mutex); 23425d4f98a2SYan Zheng 23433fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 23443fd0a558SYan, Zheng found = 1; 23453fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 23463fd0a558SYan, Zheng struct btrfs_root, root_list); 23475d4f98a2SYan Zheng 23485d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 23495d4f98a2SYan Zheng root = read_fs_root(reloc_root->fs_info, 23505d4f98a2SYan Zheng reloc_root->root_key.offset); 23515d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 23525d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 23535d4f98a2SYan Zheng 23543fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 2355b37b39cdSJosef Bacik if (ret) { 2356c974c464SWang Shilong __del_reloc_root(reloc_root); 2357b37b39cdSJosef Bacik free_extent_buffer(reloc_root->node); 2358b37b39cdSJosef Bacik free_extent_buffer(reloc_root->commit_root); 2359b37b39cdSJosef Bacik kfree(reloc_root); 2360aca1bba6SLiu Bo goto out; 2361b37b39cdSJosef Bacik } 23623fd0a558SYan, Zheng } else { 23633fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 23643fd0a558SYan, Zheng } 23655bc7247aSMiao Xie 23665bc7247aSMiao Xie /* 23675bc7247aSMiao Xie * we keep the old last snapshod transid in rtranid when we 23685bc7247aSMiao Xie * created the relocation tree. 23695bc7247aSMiao Xie */ 23705bc7247aSMiao Xie last_snap = btrfs_root_rtransid(&reloc_root->root_item); 23715bc7247aSMiao Xie otransid = btrfs_root_otransid(&reloc_root->root_item); 23725bc7247aSMiao Xie objectid = reloc_root->root_key.offset; 23735bc7247aSMiao Xie 23742c536799SJeff Mahoney ret = btrfs_drop_snapshot(reloc_root, rc->block_rsv, 0, 1); 2375aca1bba6SLiu Bo if (ret < 0) { 2376aca1bba6SLiu Bo if (list_empty(&reloc_root->root_list)) 2377aca1bba6SLiu Bo list_add_tail(&reloc_root->root_list, 2378aca1bba6SLiu Bo &reloc_roots); 2379aca1bba6SLiu Bo goto out; 23805bc7247aSMiao Xie } else if (!ret) { 23815bc7247aSMiao Xie /* 23825bc7247aSMiao Xie * recover the last snapshot tranid to avoid 23835bc7247aSMiao Xie * the space balance break NOCOW. 23845bc7247aSMiao Xie */ 23855bc7247aSMiao Xie root = read_fs_root(rc->extent_root->fs_info, 23865bc7247aSMiao Xie objectid); 23875bc7247aSMiao Xie if (IS_ERR(root)) 23885bc7247aSMiao Xie continue; 23895bc7247aSMiao Xie 23905bc7247aSMiao Xie trans = btrfs_join_transaction(root); 23915bc7247aSMiao Xie BUG_ON(IS_ERR(trans)); 23925bc7247aSMiao Xie 23935bc7247aSMiao Xie /* Check if the fs/file tree was snapshoted or not. */ 23945bc7247aSMiao Xie if (btrfs_root_last_snapshot(&root->root_item) == 23955bc7247aSMiao Xie otransid - 1) 23965bc7247aSMiao Xie btrfs_set_root_last_snapshot(&root->root_item, 23975bc7247aSMiao Xie last_snap); 23985bc7247aSMiao Xie 23995bc7247aSMiao Xie btrfs_end_transaction(trans, root); 2400aca1bba6SLiu Bo } 24015d4f98a2SYan Zheng } 24025d4f98a2SYan Zheng 24033fd0a558SYan, Zheng if (found) { 24043fd0a558SYan, Zheng found = 0; 24053fd0a558SYan, Zheng goto again; 24065d4f98a2SYan Zheng } 2407aca1bba6SLiu Bo out: 2408aca1bba6SLiu Bo if (ret) { 2409aca1bba6SLiu Bo btrfs_std_error(root->fs_info, ret); 2410aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2411aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2412aca1bba6SLiu Bo } 2413aca1bba6SLiu Bo 24145d4f98a2SYan Zheng BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 2415aca1bba6SLiu Bo return ret; 24165d4f98a2SYan Zheng } 24175d4f98a2SYan Zheng 24185d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 24195d4f98a2SYan Zheng { 24205d4f98a2SYan Zheng struct tree_block *block; 24215d4f98a2SYan Zheng struct rb_node *rb_node; 24225d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 24235d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 24245d4f98a2SYan Zheng rb_erase(rb_node, blocks); 24255d4f98a2SYan Zheng kfree(block); 24265d4f98a2SYan Zheng } 24275d4f98a2SYan Zheng } 24285d4f98a2SYan Zheng 24295d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 24305d4f98a2SYan Zheng struct btrfs_root *reloc_root) 24315d4f98a2SYan Zheng { 24325d4f98a2SYan Zheng struct btrfs_root *root; 24335d4f98a2SYan Zheng 24345d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 24355d4f98a2SYan Zheng return 0; 24365d4f98a2SYan Zheng 24375d4f98a2SYan Zheng root = read_fs_root(reloc_root->fs_info, reloc_root->root_key.offset); 24385d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 24395d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 24405d4f98a2SYan Zheng 24415d4f98a2SYan Zheng return btrfs_record_root_in_trans(trans, root); 24425d4f98a2SYan Zheng } 24435d4f98a2SYan Zheng 24443fd0a558SYan, Zheng static noinline_for_stack 24453fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 24463fd0a558SYan, Zheng struct reloc_control *rc, 24475d4f98a2SYan Zheng struct backref_node *node, 24483fd0a558SYan, Zheng struct backref_edge *edges[], int *nr) 24495d4f98a2SYan Zheng { 24505d4f98a2SYan Zheng struct backref_node *next; 24515d4f98a2SYan Zheng struct btrfs_root *root; 24523fd0a558SYan, Zheng int index = 0; 24533fd0a558SYan, Zheng 24545d4f98a2SYan Zheng next = node; 24555d4f98a2SYan Zheng while (1) { 24565d4f98a2SYan Zheng cond_resched(); 24575d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 24585d4f98a2SYan Zheng root = next->root; 24593fd0a558SYan, Zheng BUG_ON(!root); 24603fd0a558SYan, Zheng BUG_ON(!root->ref_cows); 24615d4f98a2SYan Zheng 24625d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 24635d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 24645d4f98a2SYan Zheng break; 24655d4f98a2SYan Zheng } 24665d4f98a2SYan Zheng 24675d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 24683fd0a558SYan, Zheng root = root->reloc_root; 24693fd0a558SYan, Zheng 24703fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 24713fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 24723fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 24733fd0a558SYan, Zheng next->new_bytenr = root->node->start; 24743fd0a558SYan, Zheng next->root = root; 24753fd0a558SYan, Zheng list_add_tail(&next->list, 24763fd0a558SYan, Zheng &rc->backref_cache.changed); 24773fd0a558SYan, Zheng __mark_block_processed(rc, next); 24785d4f98a2SYan Zheng break; 24795d4f98a2SYan Zheng } 24805d4f98a2SYan Zheng 24813fd0a558SYan, Zheng WARN_ON(1); 24825d4f98a2SYan Zheng root = NULL; 24835d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 24845d4f98a2SYan Zheng if (!next || next->level <= node->level) 24855d4f98a2SYan Zheng break; 24865d4f98a2SYan Zheng } 24873fd0a558SYan, Zheng if (!root) 24883fd0a558SYan, Zheng return NULL; 24895d4f98a2SYan Zheng 24905d4f98a2SYan Zheng *nr = index; 24913fd0a558SYan, Zheng next = node; 24923fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 24933fd0a558SYan, Zheng while (1) { 24943fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 24953fd0a558SYan, Zheng if (--index < 0) 24963fd0a558SYan, Zheng break; 24973fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 24983fd0a558SYan, Zheng } 24995d4f98a2SYan Zheng return root; 25005d4f98a2SYan Zheng } 25015d4f98a2SYan Zheng 25023fd0a558SYan, Zheng /* 25033fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 25043fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 25053fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 25063fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 25073fd0a558SYan, Zheng */ 25085d4f98a2SYan Zheng static noinline_for_stack 25095d4f98a2SYan Zheng struct btrfs_root *select_one_root(struct btrfs_trans_handle *trans, 25105d4f98a2SYan Zheng struct backref_node *node) 25115d4f98a2SYan Zheng { 25123fd0a558SYan, Zheng struct backref_node *next; 25133fd0a558SYan, Zheng struct btrfs_root *root; 25143fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 25155d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25163fd0a558SYan, Zheng int index = 0; 25173fd0a558SYan, Zheng 25183fd0a558SYan, Zheng next = node; 25193fd0a558SYan, Zheng while (1) { 25203fd0a558SYan, Zheng cond_resched(); 25213fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 25223fd0a558SYan, Zheng root = next->root; 25233fd0a558SYan, Zheng BUG_ON(!root); 25243fd0a558SYan, Zheng 252525985edcSLucas De Marchi /* no other choice for non-references counted tree */ 25263fd0a558SYan, Zheng if (!root->ref_cows) 25273fd0a558SYan, Zheng return root; 25283fd0a558SYan, Zheng 25293fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 25303fd0a558SYan, Zheng fs_root = root; 25313fd0a558SYan, Zheng 25323fd0a558SYan, Zheng if (next != node) 25333fd0a558SYan, Zheng return NULL; 25343fd0a558SYan, Zheng 25353fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 25363fd0a558SYan, Zheng if (!next || next->level <= node->level) 25373fd0a558SYan, Zheng break; 25383fd0a558SYan, Zheng } 25393fd0a558SYan, Zheng 25403fd0a558SYan, Zheng if (!fs_root) 25413fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 25423fd0a558SYan, Zheng return fs_root; 25435d4f98a2SYan Zheng } 25445d4f98a2SYan Zheng 25455d4f98a2SYan Zheng static noinline_for_stack 25463fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 25473fd0a558SYan, Zheng struct backref_node *node, int reserve) 25485d4f98a2SYan Zheng { 25493fd0a558SYan, Zheng struct backref_node *next = node; 25503fd0a558SYan, Zheng struct backref_edge *edge; 25513fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25523fd0a558SYan, Zheng u64 num_bytes = 0; 25533fd0a558SYan, Zheng int index = 0; 25545d4f98a2SYan Zheng 25553fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 25563fd0a558SYan, Zheng 25573fd0a558SYan, Zheng while (next) { 25583fd0a558SYan, Zheng cond_resched(); 25595d4f98a2SYan Zheng while (1) { 25603fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 25615d4f98a2SYan Zheng break; 25625d4f98a2SYan Zheng 25633fd0a558SYan, Zheng num_bytes += btrfs_level_size(rc->extent_root, 25643fd0a558SYan, Zheng next->level); 25653fd0a558SYan, Zheng 25663fd0a558SYan, Zheng if (list_empty(&next->upper)) 25673fd0a558SYan, Zheng break; 25683fd0a558SYan, Zheng 25693fd0a558SYan, Zheng edge = list_entry(next->upper.next, 25703fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 25713fd0a558SYan, Zheng edges[index++] = edge; 25723fd0a558SYan, Zheng next = edge->node[UPPER]; 25735d4f98a2SYan Zheng } 25743fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 25753fd0a558SYan, Zheng } 25763fd0a558SYan, Zheng return num_bytes; 25773fd0a558SYan, Zheng } 25783fd0a558SYan, Zheng 25793fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 25803fd0a558SYan, Zheng struct reloc_control *rc, 25813fd0a558SYan, Zheng struct backref_node *node) 25823fd0a558SYan, Zheng { 25833fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 25843fd0a558SYan, Zheng u64 num_bytes; 25853fd0a558SYan, Zheng int ret; 25863fd0a558SYan, Zheng 25873fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 25883fd0a558SYan, Zheng 25893fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 259008e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 259108e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 25923fd0a558SYan, Zheng if (ret) { 25933fd0a558SYan, Zheng if (ret == -EAGAIN) 25943fd0a558SYan, Zheng rc->commit_transaction = 1; 25953fd0a558SYan, Zheng return ret; 25963fd0a558SYan, Zheng } 25973fd0a558SYan, Zheng 25983fd0a558SYan, Zheng return 0; 25993fd0a558SYan, Zheng } 26003fd0a558SYan, Zheng 26013fd0a558SYan, Zheng static void release_metadata_space(struct reloc_control *rc, 26023fd0a558SYan, Zheng struct backref_node *node) 26033fd0a558SYan, Zheng { 26043fd0a558SYan, Zheng u64 num_bytes = calcu_metadata_size(rc, node, 0) * 2; 26053fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, num_bytes); 26065d4f98a2SYan Zheng } 26075d4f98a2SYan Zheng 26085d4f98a2SYan Zheng /* 26095d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 26105d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 26115d4f98a2SYan Zheng * 26125d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 26135d4f98a2SYan Zheng * in that case this function just updates pointers. 26145d4f98a2SYan Zheng */ 26155d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 26163fd0a558SYan, Zheng struct reloc_control *rc, 26175d4f98a2SYan Zheng struct backref_node *node, 26185d4f98a2SYan Zheng struct btrfs_key *key, 26195d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 26205d4f98a2SYan Zheng { 26215d4f98a2SYan Zheng struct backref_node *upper; 26225d4f98a2SYan Zheng struct backref_edge *edge; 26235d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 26245d4f98a2SYan Zheng struct btrfs_root *root; 26255d4f98a2SYan Zheng struct extent_buffer *eb; 26265d4f98a2SYan Zheng u32 blocksize; 26275d4f98a2SYan Zheng u64 bytenr; 26285d4f98a2SYan Zheng u64 generation; 26295d4f98a2SYan Zheng int nr; 26305d4f98a2SYan Zheng int slot; 26315d4f98a2SYan Zheng int ret; 26325d4f98a2SYan Zheng int err = 0; 26335d4f98a2SYan Zheng 26345d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 26355d4f98a2SYan Zheng 26365d4f98a2SYan Zheng path->lowest_level = node->level + 1; 26373fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 26385d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 26395d4f98a2SYan Zheng cond_resched(); 26405d4f98a2SYan Zheng 26415d4f98a2SYan Zheng upper = edge->node[UPPER]; 26423fd0a558SYan, Zheng root = select_reloc_root(trans, rc, upper, edges, &nr); 26433fd0a558SYan, Zheng BUG_ON(!root); 26445d4f98a2SYan Zheng 26453fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 26463fd0a558SYan, Zheng if (!lowest) { 26473fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 26483fd0a558SYan, Zheng upper->level, &slot); 26493fd0a558SYan, Zheng BUG_ON(ret); 26503fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 26513fd0a558SYan, Zheng if (node->eb->start == bytenr) 26523fd0a558SYan, Zheng goto next; 26533fd0a558SYan, Zheng } 26545d4f98a2SYan Zheng drop_node_buffer(upper); 26553fd0a558SYan, Zheng } 26565d4f98a2SYan Zheng 26575d4f98a2SYan Zheng if (!upper->eb) { 26585d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 26595d4f98a2SYan Zheng if (ret < 0) { 26605d4f98a2SYan Zheng err = ret; 26615d4f98a2SYan Zheng break; 26625d4f98a2SYan Zheng } 26635d4f98a2SYan Zheng BUG_ON(ret > 0); 26645d4f98a2SYan Zheng 26653fd0a558SYan, Zheng if (!upper->eb) { 26663fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 26673fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 26683fd0a558SYan, Zheng } else { 26693fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 26703fd0a558SYan, Zheng } 26713fd0a558SYan, Zheng 26723fd0a558SYan, Zheng upper->locked = 1; 26733fd0a558SYan, Zheng path->locks[upper->level] = 0; 26743fd0a558SYan, Zheng 26755d4f98a2SYan Zheng slot = path->slots[upper->level]; 2676b3b4aa74SDavid Sterba btrfs_release_path(path); 26775d4f98a2SYan Zheng } else { 26785d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 26795d4f98a2SYan Zheng &slot); 26805d4f98a2SYan Zheng BUG_ON(ret); 26815d4f98a2SYan Zheng } 26825d4f98a2SYan Zheng 26835d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 26843fd0a558SYan, Zheng if (lowest) { 26853fd0a558SYan, Zheng BUG_ON(bytenr != node->bytenr); 26865d4f98a2SYan Zheng } else { 26873fd0a558SYan, Zheng if (node->eb->start == bytenr) 26883fd0a558SYan, Zheng goto next; 26895d4f98a2SYan Zheng } 26905d4f98a2SYan Zheng 26915d4f98a2SYan Zheng blocksize = btrfs_level_size(root, node->level); 26925d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 26935d4f98a2SYan Zheng eb = read_tree_block(root, bytenr, blocksize, generation); 2694416bc658SJosef Bacik if (!eb || !extent_buffer_uptodate(eb)) { 2695416bc658SJosef Bacik free_extent_buffer(eb); 269697d9a8a4STsutomu Itoh err = -EIO; 269797d9a8a4STsutomu Itoh goto next; 269897d9a8a4STsutomu Itoh } 26995d4f98a2SYan Zheng btrfs_tree_lock(eb); 27005d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 27015d4f98a2SYan Zheng 27025d4f98a2SYan Zheng if (!node->eb) { 27035d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 27045d4f98a2SYan Zheng slot, &eb); 27053fd0a558SYan, Zheng btrfs_tree_unlock(eb); 27063fd0a558SYan, Zheng free_extent_buffer(eb); 27075d4f98a2SYan Zheng if (ret < 0) { 27085d4f98a2SYan Zheng err = ret; 27093fd0a558SYan, Zheng goto next; 27105d4f98a2SYan Zheng } 27113fd0a558SYan, Zheng BUG_ON(node->eb != eb); 27125d4f98a2SYan Zheng } else { 27135d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 27145d4f98a2SYan Zheng node->eb->start); 27155d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 27165d4f98a2SYan Zheng trans->transid); 27175d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 27185d4f98a2SYan Zheng 27195d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, root, 27205d4f98a2SYan Zheng node->eb->start, blocksize, 27215d4f98a2SYan Zheng upper->eb->start, 27225d4f98a2SYan Zheng btrfs_header_owner(upper->eb), 272366d7e7f0SArne Jansen node->level, 0, 1); 27245d4f98a2SYan Zheng BUG_ON(ret); 27255d4f98a2SYan Zheng 27265d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 27275d4f98a2SYan Zheng BUG_ON(ret); 27285d4f98a2SYan Zheng } 27293fd0a558SYan, Zheng next: 27303fd0a558SYan, Zheng if (!upper->pending) 27313fd0a558SYan, Zheng drop_node_buffer(upper); 27323fd0a558SYan, Zheng else 27333fd0a558SYan, Zheng unlock_node_buffer(upper); 27343fd0a558SYan, Zheng if (err) 27353fd0a558SYan, Zheng break; 27365d4f98a2SYan Zheng } 27373fd0a558SYan, Zheng 27383fd0a558SYan, Zheng if (!err && node->pending) { 27393fd0a558SYan, Zheng drop_node_buffer(node); 27403fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 27413fd0a558SYan, Zheng node->pending = 0; 27425d4f98a2SYan Zheng } 27433fd0a558SYan, Zheng 27445d4f98a2SYan Zheng path->lowest_level = 0; 27453fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 27465d4f98a2SYan Zheng return err; 27475d4f98a2SYan Zheng } 27485d4f98a2SYan Zheng 27495d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 27503fd0a558SYan, Zheng struct reloc_control *rc, 27515d4f98a2SYan Zheng struct backref_node *node, 27525d4f98a2SYan Zheng struct btrfs_path *path) 27535d4f98a2SYan Zheng { 27545d4f98a2SYan Zheng struct btrfs_key key; 27555d4f98a2SYan Zheng 27565d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 27573fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 27585d4f98a2SYan Zheng } 27595d4f98a2SYan Zheng 27605d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 27613fd0a558SYan, Zheng struct reloc_control *rc, 27623fd0a558SYan, Zheng struct btrfs_path *path, int err) 27635d4f98a2SYan Zheng { 27643fd0a558SYan, Zheng LIST_HEAD(list); 27653fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 27665d4f98a2SYan Zheng struct backref_node *node; 27675d4f98a2SYan Zheng int level; 27685d4f98a2SYan Zheng int ret; 27695d4f98a2SYan Zheng 27705d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 27715d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 27725d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 27733fd0a558SYan, Zheng struct backref_node, list); 27743fd0a558SYan, Zheng list_move_tail(&node->list, &list); 27753fd0a558SYan, Zheng BUG_ON(!node->pending); 27765d4f98a2SYan Zheng 27773fd0a558SYan, Zheng if (!err) { 27783fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 27795d4f98a2SYan Zheng if (ret < 0) 27805d4f98a2SYan Zheng err = ret; 27815d4f98a2SYan Zheng } 27825d4f98a2SYan Zheng } 27833fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 27843fd0a558SYan, Zheng } 27855d4f98a2SYan Zheng return err; 27865d4f98a2SYan Zheng } 27875d4f98a2SYan Zheng 27885d4f98a2SYan Zheng static void mark_block_processed(struct reloc_control *rc, 27893fd0a558SYan, Zheng u64 bytenr, u32 blocksize) 27903fd0a558SYan, Zheng { 27913fd0a558SYan, Zheng set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, 27923fd0a558SYan, Zheng EXTENT_DIRTY, GFP_NOFS); 27933fd0a558SYan, Zheng } 27943fd0a558SYan, Zheng 27953fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 27965d4f98a2SYan Zheng struct backref_node *node) 27975d4f98a2SYan Zheng { 27985d4f98a2SYan Zheng u32 blocksize; 27995d4f98a2SYan Zheng if (node->level == 0 || 28005d4f98a2SYan Zheng in_block_group(node->bytenr, rc->block_group)) { 28015d4f98a2SYan Zheng blocksize = btrfs_level_size(rc->extent_root, node->level); 28023fd0a558SYan, Zheng mark_block_processed(rc, node->bytenr, blocksize); 28035d4f98a2SYan Zheng } 28045d4f98a2SYan Zheng node->processed = 1; 28055d4f98a2SYan Zheng } 28065d4f98a2SYan Zheng 28075d4f98a2SYan Zheng /* 28085d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 28095d4f98a2SYan Zheng * as processed. 28105d4f98a2SYan Zheng */ 28115d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 28125d4f98a2SYan Zheng struct backref_node *node) 28135d4f98a2SYan Zheng { 28145d4f98a2SYan Zheng struct backref_node *next = node; 28155d4f98a2SYan Zheng struct backref_edge *edge; 28165d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28175d4f98a2SYan Zheng int index = 0; 28185d4f98a2SYan Zheng 28195d4f98a2SYan Zheng while (next) { 28205d4f98a2SYan Zheng cond_resched(); 28215d4f98a2SYan Zheng while (1) { 28225d4f98a2SYan Zheng if (next->processed) 28235d4f98a2SYan Zheng break; 28245d4f98a2SYan Zheng 28253fd0a558SYan, Zheng __mark_block_processed(rc, next); 28265d4f98a2SYan Zheng 28275d4f98a2SYan Zheng if (list_empty(&next->upper)) 28285d4f98a2SYan Zheng break; 28295d4f98a2SYan Zheng 28305d4f98a2SYan Zheng edge = list_entry(next->upper.next, 28315d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 28325d4f98a2SYan Zheng edges[index++] = edge; 28335d4f98a2SYan Zheng next = edge->node[UPPER]; 28345d4f98a2SYan Zheng } 28355d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 28365d4f98a2SYan Zheng } 28375d4f98a2SYan Zheng } 28385d4f98a2SYan Zheng 28395d4f98a2SYan Zheng static int tree_block_processed(u64 bytenr, u32 blocksize, 28405d4f98a2SYan Zheng struct reloc_control *rc) 28415d4f98a2SYan Zheng { 28425d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 28439655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 28445d4f98a2SYan Zheng return 1; 28455d4f98a2SYan Zheng return 0; 28465d4f98a2SYan Zheng } 28475d4f98a2SYan Zheng 28485d4f98a2SYan Zheng static int get_tree_block_key(struct reloc_control *rc, 28495d4f98a2SYan Zheng struct tree_block *block) 28505d4f98a2SYan Zheng { 28515d4f98a2SYan Zheng struct extent_buffer *eb; 28525d4f98a2SYan Zheng 28535d4f98a2SYan Zheng BUG_ON(block->key_ready); 28545d4f98a2SYan Zheng eb = read_tree_block(rc->extent_root, block->bytenr, 28555d4f98a2SYan Zheng block->key.objectid, block->key.offset); 2856416bc658SJosef Bacik if (!eb || !extent_buffer_uptodate(eb)) { 2857416bc658SJosef Bacik free_extent_buffer(eb); 2858416bc658SJosef Bacik return -EIO; 2859416bc658SJosef Bacik } 28605d4f98a2SYan Zheng WARN_ON(btrfs_header_level(eb) != block->level); 28615d4f98a2SYan Zheng if (block->level == 0) 28625d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 28635d4f98a2SYan Zheng else 28645d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 28655d4f98a2SYan Zheng free_extent_buffer(eb); 28665d4f98a2SYan Zheng block->key_ready = 1; 28675d4f98a2SYan Zheng return 0; 28685d4f98a2SYan Zheng } 28695d4f98a2SYan Zheng 28705d4f98a2SYan Zheng static int reada_tree_block(struct reloc_control *rc, 28715d4f98a2SYan Zheng struct tree_block *block) 28725d4f98a2SYan Zheng { 28735d4f98a2SYan Zheng BUG_ON(block->key_ready); 28743173a18fSJosef Bacik if (block->key.type == BTRFS_METADATA_ITEM_KEY) 28753173a18fSJosef Bacik readahead_tree_block(rc->extent_root, block->bytenr, 28763173a18fSJosef Bacik block->key.objectid, 28773173a18fSJosef Bacik rc->extent_root->leafsize); 28783173a18fSJosef Bacik else 28795d4f98a2SYan Zheng readahead_tree_block(rc->extent_root, block->bytenr, 28805d4f98a2SYan Zheng block->key.objectid, block->key.offset); 28815d4f98a2SYan Zheng return 0; 28825d4f98a2SYan Zheng } 28835d4f98a2SYan Zheng 28845d4f98a2SYan Zheng /* 28855d4f98a2SYan Zheng * helper function to relocate a tree block 28865d4f98a2SYan Zheng */ 28875d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 28885d4f98a2SYan Zheng struct reloc_control *rc, 28895d4f98a2SYan Zheng struct backref_node *node, 28905d4f98a2SYan Zheng struct btrfs_key *key, 28915d4f98a2SYan Zheng struct btrfs_path *path) 28925d4f98a2SYan Zheng { 28935d4f98a2SYan Zheng struct btrfs_root *root; 28943fd0a558SYan, Zheng int release = 0; 28953fd0a558SYan, Zheng int ret = 0; 28965d4f98a2SYan Zheng 28973fd0a558SYan, Zheng if (!node) 28985d4f98a2SYan Zheng return 0; 28993fd0a558SYan, Zheng 29003fd0a558SYan, Zheng BUG_ON(node->processed); 29013fd0a558SYan, Zheng root = select_one_root(trans, node); 29023fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 29033fd0a558SYan, Zheng update_processed_blocks(rc, node); 29043fd0a558SYan, Zheng goto out; 29055d4f98a2SYan Zheng } 29065d4f98a2SYan Zheng 29073fd0a558SYan, Zheng if (!root || root->ref_cows) { 29083fd0a558SYan, Zheng ret = reserve_metadata_space(trans, rc, node); 29093fd0a558SYan, Zheng if (ret) 29105d4f98a2SYan Zheng goto out; 29113fd0a558SYan, Zheng release = 1; 29125d4f98a2SYan Zheng } 29133fd0a558SYan, Zheng 29143fd0a558SYan, Zheng if (root) { 29153fd0a558SYan, Zheng if (root->ref_cows) { 29163fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 29173fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 29183fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 29193fd0a558SYan, Zheng root = root->reloc_root; 29203fd0a558SYan, Zheng node->new_bytenr = root->node->start; 29213fd0a558SYan, Zheng node->root = root; 29223fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 29233fd0a558SYan, Zheng } else { 29245d4f98a2SYan Zheng path->lowest_level = node->level; 29255d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 2926b3b4aa74SDavid Sterba btrfs_release_path(path); 29273fd0a558SYan, Zheng if (ret > 0) 29285d4f98a2SYan Zheng ret = 0; 29293fd0a558SYan, Zheng } 29303fd0a558SYan, Zheng if (!ret) 29313fd0a558SYan, Zheng update_processed_blocks(rc, node); 29323fd0a558SYan, Zheng } else { 29333fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 29343fd0a558SYan, Zheng } 29355d4f98a2SYan Zheng out: 29363fd0a558SYan, Zheng if (ret || node->level == 0 || node->cowonly) { 29373fd0a558SYan, Zheng if (release) 29383fd0a558SYan, Zheng release_metadata_space(rc, node); 29393fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 29403fd0a558SYan, Zheng } 29415d4f98a2SYan Zheng return ret; 29425d4f98a2SYan Zheng } 29435d4f98a2SYan Zheng 29445d4f98a2SYan Zheng /* 29455d4f98a2SYan Zheng * relocate a list of blocks 29465d4f98a2SYan Zheng */ 29475d4f98a2SYan Zheng static noinline_for_stack 29485d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 29495d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 29505d4f98a2SYan Zheng { 29515d4f98a2SYan Zheng struct backref_node *node; 29525d4f98a2SYan Zheng struct btrfs_path *path; 29535d4f98a2SYan Zheng struct tree_block *block; 29545d4f98a2SYan Zheng struct rb_node *rb_node; 29555d4f98a2SYan Zheng int ret; 29565d4f98a2SYan Zheng int err = 0; 29575d4f98a2SYan Zheng 29585d4f98a2SYan Zheng path = btrfs_alloc_path(); 2959e1a12670SLiu Bo if (!path) { 2960e1a12670SLiu Bo err = -ENOMEM; 296134c2b290SDavid Sterba goto out_free_blocks; 2962e1a12670SLiu Bo } 29635d4f98a2SYan Zheng 29645d4f98a2SYan Zheng rb_node = rb_first(blocks); 29655d4f98a2SYan Zheng while (rb_node) { 29665d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 29675d4f98a2SYan Zheng if (!block->key_ready) 29685d4f98a2SYan Zheng reada_tree_block(rc, block); 29695d4f98a2SYan Zheng rb_node = rb_next(rb_node); 29705d4f98a2SYan Zheng } 29715d4f98a2SYan Zheng 29725d4f98a2SYan Zheng rb_node = rb_first(blocks); 29735d4f98a2SYan Zheng while (rb_node) { 29745d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 297534c2b290SDavid Sterba if (!block->key_ready) { 297634c2b290SDavid Sterba err = get_tree_block_key(rc, block); 297734c2b290SDavid Sterba if (err) 297834c2b290SDavid Sterba goto out_free_path; 297934c2b290SDavid Sterba } 29805d4f98a2SYan Zheng rb_node = rb_next(rb_node); 29815d4f98a2SYan Zheng } 29825d4f98a2SYan Zheng 29835d4f98a2SYan Zheng rb_node = rb_first(blocks); 29845d4f98a2SYan Zheng while (rb_node) { 29855d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 29865d4f98a2SYan Zheng 29873fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 29885d4f98a2SYan Zheng block->level, block->bytenr); 29895d4f98a2SYan Zheng if (IS_ERR(node)) { 29905d4f98a2SYan Zheng err = PTR_ERR(node); 29915d4f98a2SYan Zheng goto out; 29925d4f98a2SYan Zheng } 29935d4f98a2SYan Zheng 29945d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 29955d4f98a2SYan Zheng path); 29965d4f98a2SYan Zheng if (ret < 0) { 29973fd0a558SYan, Zheng if (ret != -EAGAIN || rb_node == rb_first(blocks)) 29985d4f98a2SYan Zheng err = ret; 29995d4f98a2SYan Zheng goto out; 30005d4f98a2SYan Zheng } 30015d4f98a2SYan Zheng rb_node = rb_next(rb_node); 30025d4f98a2SYan Zheng } 30035d4f98a2SYan Zheng out: 30043fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 30055d4f98a2SYan Zheng 300634c2b290SDavid Sterba out_free_path: 30075d4f98a2SYan Zheng btrfs_free_path(path); 300834c2b290SDavid Sterba out_free_blocks: 3009e1a12670SLiu Bo free_block_list(blocks); 30105d4f98a2SYan Zheng return err; 30115d4f98a2SYan Zheng } 30125d4f98a2SYan Zheng 30135d4f98a2SYan Zheng static noinline_for_stack 3014efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3015efa56464SYan, Zheng struct file_extent_cluster *cluster) 3016efa56464SYan, Zheng { 3017efa56464SYan, Zheng u64 alloc_hint = 0; 3018efa56464SYan, Zheng u64 start; 3019efa56464SYan, Zheng u64 end; 3020efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3021efa56464SYan, Zheng u64 num_bytes; 3022efa56464SYan, Zheng int nr = 0; 3023efa56464SYan, Zheng int ret = 0; 3024efa56464SYan, Zheng 3025efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 3026efa56464SYan, Zheng mutex_lock(&inode->i_mutex); 3027efa56464SYan, Zheng 3028efa56464SYan, Zheng ret = btrfs_check_data_free_space(inode, cluster->end + 3029efa56464SYan, Zheng 1 - cluster->start); 3030efa56464SYan, Zheng if (ret) 3031efa56464SYan, Zheng goto out; 3032efa56464SYan, Zheng 3033efa56464SYan, Zheng while (nr < cluster->nr) { 3034efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3035efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3036efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3037efa56464SYan, Zheng else 3038efa56464SYan, Zheng end = cluster->end - offset; 3039efa56464SYan, Zheng 3040d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3041efa56464SYan, Zheng num_bytes = end + 1 - start; 3042efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3043efa56464SYan, Zheng num_bytes, num_bytes, 3044efa56464SYan, Zheng end + 1, &alloc_hint); 3045d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3046efa56464SYan, Zheng if (ret) 3047efa56464SYan, Zheng break; 3048efa56464SYan, Zheng nr++; 3049efa56464SYan, Zheng } 3050efa56464SYan, Zheng btrfs_free_reserved_data_space(inode, cluster->end + 3051efa56464SYan, Zheng 1 - cluster->start); 3052efa56464SYan, Zheng out: 3053efa56464SYan, Zheng mutex_unlock(&inode->i_mutex); 3054efa56464SYan, Zheng return ret; 3055efa56464SYan, Zheng } 3056efa56464SYan, Zheng 3057efa56464SYan, Zheng static noinline_for_stack 30580257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 30590257bb82SYan, Zheng u64 block_start) 30605d4f98a2SYan Zheng { 30615d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(inode)->root; 30625d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 30635d4f98a2SYan Zheng struct extent_map *em; 30640257bb82SYan, Zheng int ret = 0; 30655d4f98a2SYan Zheng 3066172ddd60SDavid Sterba em = alloc_extent_map(); 30670257bb82SYan, Zheng if (!em) 30680257bb82SYan, Zheng return -ENOMEM; 30690257bb82SYan, Zheng 30705d4f98a2SYan Zheng em->start = start; 30710257bb82SYan, Zheng em->len = end + 1 - start; 30720257bb82SYan, Zheng em->block_len = em->len; 30730257bb82SYan, Zheng em->block_start = block_start; 30745d4f98a2SYan Zheng em->bdev = root->fs_info->fs_devices->latest_bdev; 30755d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 30765d4f98a2SYan Zheng 3077d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 30785d4f98a2SYan Zheng while (1) { 3079890871beSChris Mason write_lock(&em_tree->lock); 308009a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3081890871beSChris Mason write_unlock(&em_tree->lock); 30825d4f98a2SYan Zheng if (ret != -EEXIST) { 30835d4f98a2SYan Zheng free_extent_map(em); 30845d4f98a2SYan Zheng break; 30855d4f98a2SYan Zheng } 30865d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, start, end, 0); 30875d4f98a2SYan Zheng } 3088d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 30890257bb82SYan, Zheng return ret; 30900257bb82SYan, Zheng } 30915d4f98a2SYan Zheng 30920257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 30930257bb82SYan, Zheng struct file_extent_cluster *cluster) 30940257bb82SYan, Zheng { 30950257bb82SYan, Zheng u64 page_start; 30960257bb82SYan, Zheng u64 page_end; 30970257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 30980257bb82SYan, Zheng unsigned long index; 30990257bb82SYan, Zheng unsigned long last_index; 31000257bb82SYan, Zheng struct page *page; 31010257bb82SYan, Zheng struct file_ra_state *ra; 31023b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 31030257bb82SYan, Zheng int nr = 0; 31040257bb82SYan, Zheng int ret = 0; 31050257bb82SYan, Zheng 31060257bb82SYan, Zheng if (!cluster->nr) 31070257bb82SYan, Zheng return 0; 31080257bb82SYan, Zheng 31090257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 31100257bb82SYan, Zheng if (!ra) 31110257bb82SYan, Zheng return -ENOMEM; 31120257bb82SYan, Zheng 3113efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 31140257bb82SYan, Zheng if (ret) 3115efa56464SYan, Zheng goto out; 31160257bb82SYan, Zheng 31170257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 31180257bb82SYan, Zheng 3119efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3120efa56464SYan, Zheng cluster->end - offset, cluster->start); 3121efa56464SYan, Zheng if (ret) 3122efa56464SYan, Zheng goto out; 3123efa56464SYan, Zheng 3124efa56464SYan, Zheng index = (cluster->start - offset) >> PAGE_CACHE_SHIFT; 3125efa56464SYan, Zheng last_index = (cluster->end - offset) >> PAGE_CACHE_SHIFT; 31260257bb82SYan, Zheng while (index <= last_index) { 3127efa56464SYan, Zheng ret = btrfs_delalloc_reserve_metadata(inode, PAGE_CACHE_SIZE); 3128efa56464SYan, Zheng if (ret) 3129efa56464SYan, Zheng goto out; 3130efa56464SYan, Zheng 31310257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 31320257bb82SYan, Zheng if (!page) { 31330257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 31340257bb82SYan, Zheng ra, NULL, index, 31350257bb82SYan, Zheng last_index + 1 - index); 3136a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 31373b16a4e3SJosef Bacik mask); 31380257bb82SYan, Zheng if (!page) { 3139efa56464SYan, Zheng btrfs_delalloc_release_metadata(inode, 3140efa56464SYan, Zheng PAGE_CACHE_SIZE); 31410257bb82SYan, Zheng ret = -ENOMEM; 3142efa56464SYan, Zheng goto out; 31430257bb82SYan, Zheng } 31440257bb82SYan, Zheng } 31450257bb82SYan, Zheng 31460257bb82SYan, Zheng if (PageReadahead(page)) { 31470257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 31480257bb82SYan, Zheng ra, NULL, page, index, 31490257bb82SYan, Zheng last_index + 1 - index); 31500257bb82SYan, Zheng } 31510257bb82SYan, Zheng 31520257bb82SYan, Zheng if (!PageUptodate(page)) { 31530257bb82SYan, Zheng btrfs_readpage(NULL, page); 31540257bb82SYan, Zheng lock_page(page); 31550257bb82SYan, Zheng if (!PageUptodate(page)) { 31560257bb82SYan, Zheng unlock_page(page); 31570257bb82SYan, Zheng page_cache_release(page); 3158efa56464SYan, Zheng btrfs_delalloc_release_metadata(inode, 3159efa56464SYan, Zheng PAGE_CACHE_SIZE); 31600257bb82SYan, Zheng ret = -EIO; 3161efa56464SYan, Zheng goto out; 31620257bb82SYan, Zheng } 31630257bb82SYan, Zheng } 31640257bb82SYan, Zheng 31654eee4fa4SMiao Xie page_start = page_offset(page); 31660257bb82SYan, Zheng page_end = page_start + PAGE_CACHE_SIZE - 1; 31670257bb82SYan, Zheng 3168d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 31690257bb82SYan, Zheng 31700257bb82SYan, Zheng set_page_extent_mapped(page); 31710257bb82SYan, Zheng 31720257bb82SYan, Zheng if (nr < cluster->nr && 31730257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 31740257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 31750257bb82SYan, Zheng page_start, page_end, 31760257bb82SYan, Zheng EXTENT_BOUNDARY, GFP_NOFS); 31770257bb82SYan, Zheng nr++; 31780257bb82SYan, Zheng } 31790257bb82SYan, Zheng 3180efa56464SYan, Zheng btrfs_set_extent_delalloc(inode, page_start, page_end, NULL); 31810257bb82SYan, Zheng set_page_dirty(page); 31820257bb82SYan, Zheng 31830257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3184d0082371SJeff Mahoney page_start, page_end); 31850257bb82SYan, Zheng unlock_page(page); 31860257bb82SYan, Zheng page_cache_release(page); 31870257bb82SYan, Zheng 31880257bb82SYan, Zheng index++; 3189efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 3190efa56464SYan, Zheng btrfs_throttle(BTRFS_I(inode)->root); 31910257bb82SYan, Zheng } 31920257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3193efa56464SYan, Zheng out: 31940257bb82SYan, Zheng kfree(ra); 31950257bb82SYan, Zheng return ret; 31960257bb82SYan, Zheng } 31970257bb82SYan, Zheng 31980257bb82SYan, Zheng static noinline_for_stack 31990257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 32000257bb82SYan, Zheng struct file_extent_cluster *cluster) 32010257bb82SYan, Zheng { 32020257bb82SYan, Zheng int ret; 32030257bb82SYan, Zheng 32040257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 32050257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 32060257bb82SYan, Zheng if (ret) 32070257bb82SYan, Zheng return ret; 32080257bb82SYan, Zheng cluster->nr = 0; 32090257bb82SYan, Zheng } 32100257bb82SYan, Zheng 32110257bb82SYan, Zheng if (!cluster->nr) 32120257bb82SYan, Zheng cluster->start = extent_key->objectid; 32130257bb82SYan, Zheng else 32140257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 32150257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 32160257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 32170257bb82SYan, Zheng cluster->nr++; 32180257bb82SYan, Zheng 32190257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 32200257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 32210257bb82SYan, Zheng if (ret) 32220257bb82SYan, Zheng return ret; 32230257bb82SYan, Zheng cluster->nr = 0; 32240257bb82SYan, Zheng } 32250257bb82SYan, Zheng return 0; 32265d4f98a2SYan Zheng } 32275d4f98a2SYan Zheng 32285d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 32295d4f98a2SYan Zheng static int get_ref_objectid_v0(struct reloc_control *rc, 32305d4f98a2SYan Zheng struct btrfs_path *path, 32315d4f98a2SYan Zheng struct btrfs_key *extent_key, 32325d4f98a2SYan Zheng u64 *ref_objectid, int *path_change) 32335d4f98a2SYan Zheng { 32345d4f98a2SYan Zheng struct btrfs_key key; 32355d4f98a2SYan Zheng struct extent_buffer *leaf; 32365d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 32375d4f98a2SYan Zheng int ret; 32385d4f98a2SYan Zheng int slot; 32395d4f98a2SYan Zheng 32405d4f98a2SYan Zheng leaf = path->nodes[0]; 32415d4f98a2SYan Zheng slot = path->slots[0]; 32425d4f98a2SYan Zheng while (1) { 32435d4f98a2SYan Zheng if (slot >= btrfs_header_nritems(leaf)) { 32445d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 32455d4f98a2SYan Zheng if (ret < 0) 32465d4f98a2SYan Zheng return ret; 32475d4f98a2SYan Zheng BUG_ON(ret > 0); 32485d4f98a2SYan Zheng leaf = path->nodes[0]; 32495d4f98a2SYan Zheng slot = path->slots[0]; 32505d4f98a2SYan Zheng if (path_change) 32515d4f98a2SYan Zheng *path_change = 1; 32525d4f98a2SYan Zheng } 32535d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, slot); 32545d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 32555d4f98a2SYan Zheng return -ENOENT; 32565d4f98a2SYan Zheng 32575d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_REF_V0_KEY) { 32585d4f98a2SYan Zheng slot++; 32595d4f98a2SYan Zheng continue; 32605d4f98a2SYan Zheng } 32615d4f98a2SYan Zheng ref0 = btrfs_item_ptr(leaf, slot, 32625d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 32635d4f98a2SYan Zheng *ref_objectid = btrfs_ref_objectid_v0(leaf, ref0); 32645d4f98a2SYan Zheng break; 32655d4f98a2SYan Zheng } 32665d4f98a2SYan Zheng return 0; 32675d4f98a2SYan Zheng } 32685d4f98a2SYan Zheng #endif 32695d4f98a2SYan Zheng 32705d4f98a2SYan Zheng /* 32715d4f98a2SYan Zheng * helper to add a tree block to the list. 32725d4f98a2SYan Zheng * the major work is getting the generation and level of the block 32735d4f98a2SYan Zheng */ 32745d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 32755d4f98a2SYan Zheng struct btrfs_key *extent_key, 32765d4f98a2SYan Zheng struct btrfs_path *path, 32775d4f98a2SYan Zheng struct rb_root *blocks) 32785d4f98a2SYan Zheng { 32795d4f98a2SYan Zheng struct extent_buffer *eb; 32805d4f98a2SYan Zheng struct btrfs_extent_item *ei; 32815d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 32825d4f98a2SYan Zheng struct tree_block *block; 32835d4f98a2SYan Zheng struct rb_node *rb_node; 32845d4f98a2SYan Zheng u32 item_size; 32855d4f98a2SYan Zheng int level = -1; 32867fdf4b60SWang Shilong u64 generation; 32875d4f98a2SYan Zheng 32885d4f98a2SYan Zheng eb = path->nodes[0]; 32895d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 32905d4f98a2SYan Zheng 32913173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 32923173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 32935d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 32945d4f98a2SYan Zheng struct btrfs_extent_item); 32953173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 32965d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 32975d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 32985d4f98a2SYan Zheng } else { 32993173a18fSJosef Bacik level = (int)extent_key->offset; 33003173a18fSJosef Bacik } 33013173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 33023173a18fSJosef Bacik } else { 33035d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 33045d4f98a2SYan Zheng u64 ref_owner; 33055d4f98a2SYan Zheng int ret; 33065d4f98a2SYan Zheng 33075d4f98a2SYan Zheng BUG_ON(item_size != sizeof(struct btrfs_extent_item_v0)); 33085d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, extent_key, 33095d4f98a2SYan Zheng &ref_owner, NULL); 3310411fc6bcSAndi Kleen if (ret < 0) 3311411fc6bcSAndi Kleen return ret; 33125d4f98a2SYan Zheng BUG_ON(ref_owner >= BTRFS_MAX_LEVEL); 33135d4f98a2SYan Zheng level = (int)ref_owner; 33145d4f98a2SYan Zheng /* FIXME: get real generation */ 33155d4f98a2SYan Zheng generation = 0; 33165d4f98a2SYan Zheng #else 33175d4f98a2SYan Zheng BUG(); 33185d4f98a2SYan Zheng #endif 33195d4f98a2SYan Zheng } 33205d4f98a2SYan Zheng 3321b3b4aa74SDavid Sterba btrfs_release_path(path); 33225d4f98a2SYan Zheng 33235d4f98a2SYan Zheng BUG_ON(level == -1); 33245d4f98a2SYan Zheng 33255d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 33265d4f98a2SYan Zheng if (!block) 33275d4f98a2SYan Zheng return -ENOMEM; 33285d4f98a2SYan Zheng 33295d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 33303173a18fSJosef Bacik block->key.objectid = rc->extent_root->leafsize; 33315d4f98a2SYan Zheng block->key.offset = generation; 33325d4f98a2SYan Zheng block->level = level; 33335d4f98a2SYan Zheng block->key_ready = 0; 33345d4f98a2SYan Zheng 33355d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 333643c04fb1SJeff Mahoney if (rb_node) 333743c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 33385d4f98a2SYan Zheng 33395d4f98a2SYan Zheng return 0; 33405d4f98a2SYan Zheng } 33415d4f98a2SYan Zheng 33425d4f98a2SYan Zheng /* 33435d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 33445d4f98a2SYan Zheng */ 33455d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 33465d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 33475d4f98a2SYan Zheng struct rb_root *blocks) 33485d4f98a2SYan Zheng { 33495d4f98a2SYan Zheng struct btrfs_path *path; 33505d4f98a2SYan Zheng struct btrfs_key key; 33515d4f98a2SYan Zheng int ret; 3352aee68ee5SJosef Bacik bool skinny = btrfs_fs_incompat(rc->extent_root->fs_info, 3353aee68ee5SJosef Bacik SKINNY_METADATA); 33545d4f98a2SYan Zheng 33555d4f98a2SYan Zheng if (tree_block_processed(bytenr, blocksize, rc)) 33565d4f98a2SYan Zheng return 0; 33575d4f98a2SYan Zheng 33585d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 33595d4f98a2SYan Zheng return 0; 33605d4f98a2SYan Zheng 33615d4f98a2SYan Zheng path = btrfs_alloc_path(); 33625d4f98a2SYan Zheng if (!path) 33635d4f98a2SYan Zheng return -ENOMEM; 3364aee68ee5SJosef Bacik again: 33655d4f98a2SYan Zheng key.objectid = bytenr; 3366aee68ee5SJosef Bacik if (skinny) { 3367aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3368aee68ee5SJosef Bacik key.offset = (u64)-1; 3369aee68ee5SJosef Bacik } else { 33705d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 33715d4f98a2SYan Zheng key.offset = blocksize; 3372aee68ee5SJosef Bacik } 33735d4f98a2SYan Zheng 33745d4f98a2SYan Zheng path->search_commit_root = 1; 33755d4f98a2SYan Zheng path->skip_locking = 1; 33765d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 33775d4f98a2SYan Zheng if (ret < 0) 33785d4f98a2SYan Zheng goto out; 33795d4f98a2SYan Zheng 3380aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3381aee68ee5SJosef Bacik if (path->slots[0]) { 3382aee68ee5SJosef Bacik path->slots[0]--; 3383aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3384aee68ee5SJosef Bacik path->slots[0]); 33853173a18fSJosef Bacik if (key.objectid == bytenr && 3386aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3387aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3388aee68ee5SJosef Bacik key.offset == blocksize))) 33893173a18fSJosef Bacik ret = 0; 33903173a18fSJosef Bacik } 3391aee68ee5SJosef Bacik 3392aee68ee5SJosef Bacik if (ret) { 3393aee68ee5SJosef Bacik skinny = false; 3394aee68ee5SJosef Bacik btrfs_release_path(path); 3395aee68ee5SJosef Bacik goto again; 3396aee68ee5SJosef Bacik } 3397aee68ee5SJosef Bacik } 33983173a18fSJosef Bacik BUG_ON(ret); 33993173a18fSJosef Bacik 34005d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 34015d4f98a2SYan Zheng out: 34025d4f98a2SYan Zheng btrfs_free_path(path); 34035d4f98a2SYan Zheng return ret; 34045d4f98a2SYan Zheng } 34055d4f98a2SYan Zheng 34065d4f98a2SYan Zheng /* 34075d4f98a2SYan Zheng * helper to check if the block use full backrefs for pointers in it 34085d4f98a2SYan Zheng */ 34095d4f98a2SYan Zheng static int block_use_full_backref(struct reloc_control *rc, 34105d4f98a2SYan Zheng struct extent_buffer *eb) 34115d4f98a2SYan Zheng { 34125d4f98a2SYan Zheng u64 flags; 34135d4f98a2SYan Zheng int ret; 34145d4f98a2SYan Zheng 34155d4f98a2SYan Zheng if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) || 34165d4f98a2SYan Zheng btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV) 34175d4f98a2SYan Zheng return 1; 34185d4f98a2SYan Zheng 34193fd0a558SYan, Zheng ret = btrfs_lookup_extent_info(NULL, rc->extent_root, 34203173a18fSJosef Bacik eb->start, btrfs_header_level(eb), 1, 34213173a18fSJosef Bacik NULL, &flags); 34225d4f98a2SYan Zheng BUG_ON(ret); 34235d4f98a2SYan Zheng 34245d4f98a2SYan Zheng if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) 34255d4f98a2SYan Zheng ret = 1; 34265d4f98a2SYan Zheng else 34275d4f98a2SYan Zheng ret = 0; 34285d4f98a2SYan Zheng return ret; 34295d4f98a2SYan Zheng } 34305d4f98a2SYan Zheng 34310af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 34320af3d00bSJosef Bacik struct inode *inode, u64 ino) 34330af3d00bSJosef Bacik { 34340af3d00bSJosef Bacik struct btrfs_key key; 34350af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 34360af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 34370af3d00bSJosef Bacik int ret = 0; 34380af3d00bSJosef Bacik 34390af3d00bSJosef Bacik if (inode) 34400af3d00bSJosef Bacik goto truncate; 34410af3d00bSJosef Bacik 34420af3d00bSJosef Bacik key.objectid = ino; 34430af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 34440af3d00bSJosef Bacik key.offset = 0; 34450af3d00bSJosef Bacik 34460af3d00bSJosef Bacik inode = btrfs_iget(fs_info->sb, &key, root, NULL); 3447f54fb859STsutomu Itoh if (IS_ERR(inode) || is_bad_inode(inode)) { 3448f54fb859STsutomu Itoh if (!IS_ERR(inode)) 34490af3d00bSJosef Bacik iput(inode); 34500af3d00bSJosef Bacik return -ENOENT; 34510af3d00bSJosef Bacik } 34520af3d00bSJosef Bacik 34530af3d00bSJosef Bacik truncate: 34547b61cd92SMiao Xie ret = btrfs_check_trunc_cache_free_space(root, 34557b61cd92SMiao Xie &fs_info->global_block_rsv); 34567b61cd92SMiao Xie if (ret) 34577b61cd92SMiao Xie goto out; 34587b61cd92SMiao Xie 34597a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 34600af3d00bSJosef Bacik if (IS_ERR(trans)) { 34613612b495STsutomu Itoh ret = PTR_ERR(trans); 34620af3d00bSJosef Bacik goto out; 34630af3d00bSJosef Bacik } 34640af3d00bSJosef Bacik 346574514323SFilipe David Borba Manana ret = btrfs_truncate_free_space_cache(root, trans, inode); 34660af3d00bSJosef Bacik 34670af3d00bSJosef Bacik btrfs_end_transaction(trans, root); 3468b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 34690af3d00bSJosef Bacik out: 34700af3d00bSJosef Bacik iput(inode); 34710af3d00bSJosef Bacik return ret; 34720af3d00bSJosef Bacik } 34730af3d00bSJosef Bacik 34745d4f98a2SYan Zheng /* 34755d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY 34765d4f98a2SYan Zheng * this function scans fs tree to find blocks reference the data extent 34775d4f98a2SYan Zheng */ 34785d4f98a2SYan Zheng static int find_data_references(struct reloc_control *rc, 34795d4f98a2SYan Zheng struct btrfs_key *extent_key, 34805d4f98a2SYan Zheng struct extent_buffer *leaf, 34815d4f98a2SYan Zheng struct btrfs_extent_data_ref *ref, 34825d4f98a2SYan Zheng struct rb_root *blocks) 34835d4f98a2SYan Zheng { 34845d4f98a2SYan Zheng struct btrfs_path *path; 34855d4f98a2SYan Zheng struct tree_block *block; 34865d4f98a2SYan Zheng struct btrfs_root *root; 34875d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 34885d4f98a2SYan Zheng struct rb_node *rb_node; 34895d4f98a2SYan Zheng struct btrfs_key key; 34905d4f98a2SYan Zheng u64 ref_root; 34915d4f98a2SYan Zheng u64 ref_objectid; 34925d4f98a2SYan Zheng u64 ref_offset; 34935d4f98a2SYan Zheng u32 ref_count; 34945d4f98a2SYan Zheng u32 nritems; 34955d4f98a2SYan Zheng int err = 0; 34965d4f98a2SYan Zheng int added = 0; 34975d4f98a2SYan Zheng int counted; 34985d4f98a2SYan Zheng int ret; 34995d4f98a2SYan Zheng 35005d4f98a2SYan Zheng ref_root = btrfs_extent_data_ref_root(leaf, ref); 35015d4f98a2SYan Zheng ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref); 35025d4f98a2SYan Zheng ref_offset = btrfs_extent_data_ref_offset(leaf, ref); 35035d4f98a2SYan Zheng ref_count = btrfs_extent_data_ref_count(leaf, ref); 35045d4f98a2SYan Zheng 35050af3d00bSJosef Bacik /* 35060af3d00bSJosef Bacik * This is an extent belonging to the free space cache, lets just delete 35070af3d00bSJosef Bacik * it and redo the search. 35080af3d00bSJosef Bacik */ 35090af3d00bSJosef Bacik if (ref_root == BTRFS_ROOT_TREE_OBJECTID) { 35100af3d00bSJosef Bacik ret = delete_block_group_cache(rc->extent_root->fs_info, 35110af3d00bSJosef Bacik NULL, ref_objectid); 35120af3d00bSJosef Bacik if (ret != -ENOENT) 35130af3d00bSJosef Bacik return ret; 35140af3d00bSJosef Bacik ret = 0; 35150af3d00bSJosef Bacik } 35160af3d00bSJosef Bacik 35170af3d00bSJosef Bacik path = btrfs_alloc_path(); 35180af3d00bSJosef Bacik if (!path) 35190af3d00bSJosef Bacik return -ENOMEM; 3520026fd317SJosef Bacik path->reada = 1; 35210af3d00bSJosef Bacik 35225d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, ref_root); 35235d4f98a2SYan Zheng if (IS_ERR(root)) { 35245d4f98a2SYan Zheng err = PTR_ERR(root); 35255d4f98a2SYan Zheng goto out; 35265d4f98a2SYan Zheng } 35275d4f98a2SYan Zheng 35285d4f98a2SYan Zheng key.objectid = ref_objectid; 35295d4f98a2SYan Zheng key.type = BTRFS_EXTENT_DATA_KEY; 353084850e8dSYan, Zheng if (ref_offset > ((u64)-1 << 32)) 353184850e8dSYan, Zheng key.offset = 0; 353284850e8dSYan, Zheng else 353384850e8dSYan, Zheng key.offset = ref_offset; 35345d4f98a2SYan Zheng 35355d4f98a2SYan Zheng path->search_commit_root = 1; 35365d4f98a2SYan Zheng path->skip_locking = 1; 35375d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 35385d4f98a2SYan Zheng if (ret < 0) { 35395d4f98a2SYan Zheng err = ret; 35405d4f98a2SYan Zheng goto out; 35415d4f98a2SYan Zheng } 35425d4f98a2SYan Zheng 35435d4f98a2SYan Zheng leaf = path->nodes[0]; 35445d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 35455d4f98a2SYan Zheng /* 35465d4f98a2SYan Zheng * the references in tree blocks that use full backrefs 35475d4f98a2SYan Zheng * are not counted in 35485d4f98a2SYan Zheng */ 35495d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 35505d4f98a2SYan Zheng counted = 0; 35515d4f98a2SYan Zheng else 35525d4f98a2SYan Zheng counted = 1; 35535d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 35545d4f98a2SYan Zheng if (rb_node) { 35555d4f98a2SYan Zheng if (counted) 35565d4f98a2SYan Zheng added = 1; 35575d4f98a2SYan Zheng else 35585d4f98a2SYan Zheng path->slots[0] = nritems; 35595d4f98a2SYan Zheng } 35605d4f98a2SYan Zheng 35615d4f98a2SYan Zheng while (ref_count > 0) { 35625d4f98a2SYan Zheng while (path->slots[0] >= nritems) { 35635d4f98a2SYan Zheng ret = btrfs_next_leaf(root, path); 35645d4f98a2SYan Zheng if (ret < 0) { 35655d4f98a2SYan Zheng err = ret; 35665d4f98a2SYan Zheng goto out; 35675d4f98a2SYan Zheng } 3568fae7f21cSDulshani Gunawardhana if (WARN_ON(ret > 0)) 35695d4f98a2SYan Zheng goto out; 35705d4f98a2SYan Zheng 35715d4f98a2SYan Zheng leaf = path->nodes[0]; 35725d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 35735d4f98a2SYan Zheng added = 0; 35745d4f98a2SYan Zheng 35755d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 35765d4f98a2SYan Zheng counted = 0; 35775d4f98a2SYan Zheng else 35785d4f98a2SYan Zheng counted = 1; 35795d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 35805d4f98a2SYan Zheng if (rb_node) { 35815d4f98a2SYan Zheng if (counted) 35825d4f98a2SYan Zheng added = 1; 35835d4f98a2SYan Zheng else 35845d4f98a2SYan Zheng path->slots[0] = nritems; 35855d4f98a2SYan Zheng } 35865d4f98a2SYan Zheng } 35875d4f98a2SYan Zheng 35885d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 3589fae7f21cSDulshani Gunawardhana if (WARN_ON(key.objectid != ref_objectid || 3590fae7f21cSDulshani Gunawardhana key.type != BTRFS_EXTENT_DATA_KEY)) 35915d4f98a2SYan Zheng break; 35925d4f98a2SYan Zheng 35935d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 35945d4f98a2SYan Zheng struct btrfs_file_extent_item); 35955d4f98a2SYan Zheng 35965d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 35975d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 35985d4f98a2SYan Zheng goto next; 35995d4f98a2SYan Zheng 36005d4f98a2SYan Zheng if (btrfs_file_extent_disk_bytenr(leaf, fi) != 36015d4f98a2SYan Zheng extent_key->objectid) 36025d4f98a2SYan Zheng goto next; 36035d4f98a2SYan Zheng 36045d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 36055d4f98a2SYan Zheng if (key.offset != ref_offset) 36065d4f98a2SYan Zheng goto next; 36075d4f98a2SYan Zheng 36085d4f98a2SYan Zheng if (counted) 36095d4f98a2SYan Zheng ref_count--; 36105d4f98a2SYan Zheng if (added) 36115d4f98a2SYan Zheng goto next; 36125d4f98a2SYan Zheng 36135d4f98a2SYan Zheng if (!tree_block_processed(leaf->start, leaf->len, rc)) { 36145d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 36155d4f98a2SYan Zheng if (!block) { 36165d4f98a2SYan Zheng err = -ENOMEM; 36175d4f98a2SYan Zheng break; 36185d4f98a2SYan Zheng } 36195d4f98a2SYan Zheng block->bytenr = leaf->start; 36205d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &block->key, 0); 36215d4f98a2SYan Zheng block->level = 0; 36225d4f98a2SYan Zheng block->key_ready = 1; 36235d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, 36245d4f98a2SYan Zheng &block->rb_node); 362543c04fb1SJeff Mahoney if (rb_node) 362643c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 362743c04fb1SJeff Mahoney block->bytenr); 36285d4f98a2SYan Zheng } 36295d4f98a2SYan Zheng if (counted) 36305d4f98a2SYan Zheng added = 1; 36315d4f98a2SYan Zheng else 36325d4f98a2SYan Zheng path->slots[0] = nritems; 36335d4f98a2SYan Zheng next: 36345d4f98a2SYan Zheng path->slots[0]++; 36355d4f98a2SYan Zheng 36365d4f98a2SYan Zheng } 36375d4f98a2SYan Zheng out: 36385d4f98a2SYan Zheng btrfs_free_path(path); 36395d4f98a2SYan Zheng return err; 36405d4f98a2SYan Zheng } 36415d4f98a2SYan Zheng 36425d4f98a2SYan Zheng /* 36432c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 36445d4f98a2SYan Zheng */ 36455d4f98a2SYan Zheng static noinline_for_stack 36465d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 36475d4f98a2SYan Zheng struct btrfs_key *extent_key, 36485d4f98a2SYan Zheng struct btrfs_path *path, 36495d4f98a2SYan Zheng struct rb_root *blocks) 36505d4f98a2SYan Zheng { 36515d4f98a2SYan Zheng struct btrfs_key key; 36525d4f98a2SYan Zheng struct extent_buffer *eb; 36535d4f98a2SYan Zheng struct btrfs_extent_data_ref *dref; 36545d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 36555d4f98a2SYan Zheng unsigned long ptr; 36565d4f98a2SYan Zheng unsigned long end; 36573fd0a558SYan, Zheng u32 blocksize = btrfs_level_size(rc->extent_root, 0); 3658647f63bdSFilipe David Borba Manana int ret = 0; 36595d4f98a2SYan Zheng int err = 0; 36605d4f98a2SYan Zheng 36615d4f98a2SYan Zheng eb = path->nodes[0]; 36625d4f98a2SYan Zheng ptr = btrfs_item_ptr_offset(eb, path->slots[0]); 36635d4f98a2SYan Zheng end = ptr + btrfs_item_size_nr(eb, path->slots[0]); 36645d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 36655d4f98a2SYan Zheng if (ptr + sizeof(struct btrfs_extent_item_v0) == end) 36665d4f98a2SYan Zheng ptr = end; 36675d4f98a2SYan Zheng else 36685d4f98a2SYan Zheng #endif 36695d4f98a2SYan Zheng ptr += sizeof(struct btrfs_extent_item); 36705d4f98a2SYan Zheng 36715d4f98a2SYan Zheng while (ptr < end) { 36725d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 36735d4f98a2SYan Zheng key.type = btrfs_extent_inline_ref_type(eb, iref); 36745d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 36755d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 36765d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 36775d4f98a2SYan Zheng blocks); 36785d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 36795d4f98a2SYan Zheng dref = (struct btrfs_extent_data_ref *)(&iref->offset); 36805d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 36815d4f98a2SYan Zheng eb, dref, blocks); 36825d4f98a2SYan Zheng } else { 36835d4f98a2SYan Zheng BUG(); 36845d4f98a2SYan Zheng } 3685647f63bdSFilipe David Borba Manana if (ret) { 3686647f63bdSFilipe David Borba Manana err = ret; 3687647f63bdSFilipe David Borba Manana goto out; 3688647f63bdSFilipe David Borba Manana } 36895d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 36905d4f98a2SYan Zheng } 36915d4f98a2SYan Zheng WARN_ON(ptr > end); 36925d4f98a2SYan Zheng 36935d4f98a2SYan Zheng while (1) { 36945d4f98a2SYan Zheng cond_resched(); 36955d4f98a2SYan Zheng eb = path->nodes[0]; 36965d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(eb)) { 36975d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 36985d4f98a2SYan Zheng if (ret < 0) { 36995d4f98a2SYan Zheng err = ret; 37005d4f98a2SYan Zheng break; 37015d4f98a2SYan Zheng } 37025d4f98a2SYan Zheng if (ret > 0) 37035d4f98a2SYan Zheng break; 37045d4f98a2SYan Zheng eb = path->nodes[0]; 37055d4f98a2SYan Zheng } 37065d4f98a2SYan Zheng 37075d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path->slots[0]); 37085d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 37095d4f98a2SYan Zheng break; 37105d4f98a2SYan Zheng 37115d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 37125d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY || 37135d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 37145d4f98a2SYan Zheng #else 37155d4f98a2SYan Zheng BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY); 37165d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 37175d4f98a2SYan Zheng #endif 37185d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 37195d4f98a2SYan Zheng blocks); 37205d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 37215d4f98a2SYan Zheng dref = btrfs_item_ptr(eb, path->slots[0], 37225d4f98a2SYan Zheng struct btrfs_extent_data_ref); 37235d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 37245d4f98a2SYan Zheng eb, dref, blocks); 37255d4f98a2SYan Zheng } else { 37265d4f98a2SYan Zheng ret = 0; 37275d4f98a2SYan Zheng } 37285d4f98a2SYan Zheng if (ret) { 37295d4f98a2SYan Zheng err = ret; 37305d4f98a2SYan Zheng break; 37315d4f98a2SYan Zheng } 37325d4f98a2SYan Zheng path->slots[0]++; 37335d4f98a2SYan Zheng } 3734647f63bdSFilipe David Borba Manana out: 3735b3b4aa74SDavid Sterba btrfs_release_path(path); 37365d4f98a2SYan Zheng if (err) 37375d4f98a2SYan Zheng free_block_list(blocks); 37385d4f98a2SYan Zheng return err; 37395d4f98a2SYan Zheng } 37405d4f98a2SYan Zheng 37415d4f98a2SYan Zheng /* 37422c016dc2SLiu Bo * helper to find next unprocessed extent 37435d4f98a2SYan Zheng */ 37445d4f98a2SYan Zheng static noinline_for_stack 37455d4f98a2SYan Zheng int find_next_extent(struct btrfs_trans_handle *trans, 37463fd0a558SYan, Zheng struct reloc_control *rc, struct btrfs_path *path, 37473fd0a558SYan, Zheng struct btrfs_key *extent_key) 37485d4f98a2SYan Zheng { 37495d4f98a2SYan Zheng struct btrfs_key key; 37505d4f98a2SYan Zheng struct extent_buffer *leaf; 37515d4f98a2SYan Zheng u64 start, end, last; 37525d4f98a2SYan Zheng int ret; 37535d4f98a2SYan Zheng 37545d4f98a2SYan Zheng last = rc->block_group->key.objectid + rc->block_group->key.offset; 37555d4f98a2SYan Zheng while (1) { 37565d4f98a2SYan Zheng cond_resched(); 37575d4f98a2SYan Zheng if (rc->search_start >= last) { 37585d4f98a2SYan Zheng ret = 1; 37595d4f98a2SYan Zheng break; 37605d4f98a2SYan Zheng } 37615d4f98a2SYan Zheng 37625d4f98a2SYan Zheng key.objectid = rc->search_start; 37635d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 37645d4f98a2SYan Zheng key.offset = 0; 37655d4f98a2SYan Zheng 37665d4f98a2SYan Zheng path->search_commit_root = 1; 37675d4f98a2SYan Zheng path->skip_locking = 1; 37685d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 37695d4f98a2SYan Zheng 0, 0); 37705d4f98a2SYan Zheng if (ret < 0) 37715d4f98a2SYan Zheng break; 37725d4f98a2SYan Zheng next: 37735d4f98a2SYan Zheng leaf = path->nodes[0]; 37745d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 37755d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 37765d4f98a2SYan Zheng if (ret != 0) 37775d4f98a2SYan Zheng break; 37785d4f98a2SYan Zheng leaf = path->nodes[0]; 37795d4f98a2SYan Zheng } 37805d4f98a2SYan Zheng 37815d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 37825d4f98a2SYan Zheng if (key.objectid >= last) { 37835d4f98a2SYan Zheng ret = 1; 37845d4f98a2SYan Zheng break; 37855d4f98a2SYan Zheng } 37865d4f98a2SYan Zheng 37873173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 37883173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 37893173a18fSJosef Bacik path->slots[0]++; 37903173a18fSJosef Bacik goto next; 37913173a18fSJosef Bacik } 37923173a18fSJosef Bacik 37933173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 37945d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 37955d4f98a2SYan Zheng path->slots[0]++; 37965d4f98a2SYan Zheng goto next; 37975d4f98a2SYan Zheng } 37985d4f98a2SYan Zheng 37993173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 38003173a18fSJosef Bacik key.objectid + rc->extent_root->leafsize <= 38013173a18fSJosef Bacik rc->search_start) { 38023173a18fSJosef Bacik path->slots[0]++; 38033173a18fSJosef Bacik goto next; 38043173a18fSJosef Bacik } 38053173a18fSJosef Bacik 38065d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 38075d4f98a2SYan Zheng key.objectid, &start, &end, 3808e6138876SJosef Bacik EXTENT_DIRTY, NULL); 38095d4f98a2SYan Zheng 38105d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3811b3b4aa74SDavid Sterba btrfs_release_path(path); 38125d4f98a2SYan Zheng rc->search_start = end + 1; 38135d4f98a2SYan Zheng } else { 38143173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 38155d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 38163173a18fSJosef Bacik else 38173173a18fSJosef Bacik rc->search_start = key.objectid + 38183173a18fSJosef Bacik rc->extent_root->leafsize; 38193fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 38205d4f98a2SYan Zheng return 0; 38215d4f98a2SYan Zheng } 38225d4f98a2SYan Zheng } 3823b3b4aa74SDavid Sterba btrfs_release_path(path); 38245d4f98a2SYan Zheng return ret; 38255d4f98a2SYan Zheng } 38265d4f98a2SYan Zheng 38275d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 38285d4f98a2SYan Zheng { 38295d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38307585717fSChris Mason 38317585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 38325d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 38337585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 38345d4f98a2SYan Zheng } 38355d4f98a2SYan Zheng 38365d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 38375d4f98a2SYan Zheng { 38385d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38397585717fSChris Mason 38407585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 38415d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 38427585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 38435d4f98a2SYan Zheng } 38445d4f98a2SYan Zheng 38455d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 38465d4f98a2SYan Zheng { 38475d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 38485d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 38495d4f98a2SYan Zheng return 1; 38505d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 38515d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 38525d4f98a2SYan Zheng return 1; 38535d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 38545d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 38555d4f98a2SYan Zheng return 1; 38565d4f98a2SYan Zheng return 0; 38575d4f98a2SYan Zheng } 38585d4f98a2SYan Zheng 38593fd0a558SYan, Zheng static noinline_for_stack 38603fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 38613fd0a558SYan, Zheng { 38623fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 38633fd0a558SYan, Zheng int ret; 38643fd0a558SYan, Zheng 386566d8f3ddSMiao Xie rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root, 386666d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 38673fd0a558SYan, Zheng if (!rc->block_rsv) 38683fd0a558SYan, Zheng return -ENOMEM; 38693fd0a558SYan, Zheng 38703fd0a558SYan, Zheng /* 38713fd0a558SYan, Zheng * reserve some space for creating reloc trees. 38723fd0a558SYan, Zheng * btrfs_init_reloc_root will use them when there 38733fd0a558SYan, Zheng * is no reservation in transaction handle. 38743fd0a558SYan, Zheng */ 38754a92b1b8SJosef Bacik ret = btrfs_block_rsv_add(rc->extent_root, rc->block_rsv, 387608e007d2SMiao Xie rc->extent_root->nodesize * 256, 387708e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 38783fd0a558SYan, Zheng if (ret) 38793fd0a558SYan, Zheng return ret; 38803fd0a558SYan, Zheng 38813fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 38823fd0a558SYan, Zheng rc->search_start = rc->block_group->key.objectid; 38833fd0a558SYan, Zheng rc->extents_found = 0; 38843fd0a558SYan, Zheng rc->nodes_relocated = 0; 38853fd0a558SYan, Zheng rc->merging_rsv_size = 0; 38863fd0a558SYan, Zheng 38873fd0a558SYan, Zheng rc->create_reloc_tree = 1; 38883fd0a558SYan, Zheng set_reloc_control(rc); 38893fd0a558SYan, Zheng 38907a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 389128818947SLiu Bo if (IS_ERR(trans)) { 389228818947SLiu Bo unset_reloc_control(rc); 389328818947SLiu Bo /* 389428818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 389528818947SLiu Bo * cleanup. And callers are responsible to free the above 389628818947SLiu Bo * block rsv. 389728818947SLiu Bo */ 389828818947SLiu Bo return PTR_ERR(trans); 389928818947SLiu Bo } 39003fd0a558SYan, Zheng btrfs_commit_transaction(trans, rc->extent_root); 39013fd0a558SYan, Zheng return 0; 39023fd0a558SYan, Zheng } 390376dda93cSYan, Zheng 39045d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 39055d4f98a2SYan Zheng { 39065d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 39075d4f98a2SYan Zheng struct btrfs_key key; 39085d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 39095d4f98a2SYan Zheng struct btrfs_path *path; 39105d4f98a2SYan Zheng struct btrfs_extent_item *ei; 39115d4f98a2SYan Zheng u64 flags; 39125d4f98a2SYan Zheng u32 item_size; 39135d4f98a2SYan Zheng int ret; 39145d4f98a2SYan Zheng int err = 0; 3915c87f08caSChris Mason int progress = 0; 39165d4f98a2SYan Zheng 39175d4f98a2SYan Zheng path = btrfs_alloc_path(); 39183fd0a558SYan, Zheng if (!path) 39195d4f98a2SYan Zheng return -ENOMEM; 3920026fd317SJosef Bacik path->reada = 1; 39213fd0a558SYan, Zheng 39223fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 39233fd0a558SYan, Zheng if (ret) { 39243fd0a558SYan, Zheng err = ret; 39253fd0a558SYan, Zheng goto out_free; 39262423fdfbSJiri Slaby } 39275d4f98a2SYan Zheng 39285d4f98a2SYan Zheng while (1) { 3929c87f08caSChris Mason progress++; 3930a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 39310f788c58SLiu Bo if (IS_ERR(trans)) { 39320f788c58SLiu Bo err = PTR_ERR(trans); 39330f788c58SLiu Bo trans = NULL; 39340f788c58SLiu Bo break; 39350f788c58SLiu Bo } 3936c87f08caSChris Mason restart: 39373fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 39383fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 39393fd0a558SYan, Zheng continue; 39403fd0a558SYan, Zheng } 39413fd0a558SYan, Zheng 39423fd0a558SYan, Zheng ret = find_next_extent(trans, rc, path, &key); 39435d4f98a2SYan Zheng if (ret < 0) 39445d4f98a2SYan Zheng err = ret; 39455d4f98a2SYan Zheng if (ret != 0) 39465d4f98a2SYan Zheng break; 39475d4f98a2SYan Zheng 39485d4f98a2SYan Zheng rc->extents_found++; 39495d4f98a2SYan Zheng 39505d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 39515d4f98a2SYan Zheng struct btrfs_extent_item); 39523fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 39535d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 39545d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 39555d4f98a2SYan Zheng ret = check_extent_flags(flags); 39565d4f98a2SYan Zheng BUG_ON(ret); 39575d4f98a2SYan Zheng 39585d4f98a2SYan Zheng } else { 39595d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 39605d4f98a2SYan Zheng u64 ref_owner; 39615d4f98a2SYan Zheng int path_change = 0; 39625d4f98a2SYan Zheng 39635d4f98a2SYan Zheng BUG_ON(item_size != 39645d4f98a2SYan Zheng sizeof(struct btrfs_extent_item_v0)); 39655d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, &key, &ref_owner, 39665d4f98a2SYan Zheng &path_change); 39675d4f98a2SYan Zheng if (ref_owner < BTRFS_FIRST_FREE_OBJECTID) 39685d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_TREE_BLOCK; 39695d4f98a2SYan Zheng else 39705d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_DATA; 39715d4f98a2SYan Zheng 39725d4f98a2SYan Zheng if (path_change) { 3973b3b4aa74SDavid Sterba btrfs_release_path(path); 39745d4f98a2SYan Zheng 39755d4f98a2SYan Zheng path->search_commit_root = 1; 39765d4f98a2SYan Zheng path->skip_locking = 1; 39775d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, 39785d4f98a2SYan Zheng &key, path, 0, 0); 39795d4f98a2SYan Zheng if (ret < 0) { 39805d4f98a2SYan Zheng err = ret; 39815d4f98a2SYan Zheng break; 39825d4f98a2SYan Zheng } 39835d4f98a2SYan Zheng BUG_ON(ret > 0); 39845d4f98a2SYan Zheng } 39855d4f98a2SYan Zheng #else 39865d4f98a2SYan Zheng BUG(); 39875d4f98a2SYan Zheng #endif 39885d4f98a2SYan Zheng } 39895d4f98a2SYan Zheng 39905d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 39915d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 39925d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 39935d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 39945d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 39955d4f98a2SYan Zheng } else { 3996b3b4aa74SDavid Sterba btrfs_release_path(path); 39975d4f98a2SYan Zheng ret = 0; 39985d4f98a2SYan Zheng } 39995d4f98a2SYan Zheng if (ret < 0) { 40003fd0a558SYan, Zheng err = ret; 40015d4f98a2SYan Zheng break; 40025d4f98a2SYan Zheng } 40035d4f98a2SYan Zheng 40045d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 40055d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 40065d4f98a2SYan Zheng if (ret < 0) { 40073fd0a558SYan, Zheng if (ret != -EAGAIN) { 40085d4f98a2SYan Zheng err = ret; 40095d4f98a2SYan Zheng break; 40105d4f98a2SYan Zheng } 40113fd0a558SYan, Zheng rc->extents_found--; 40123fd0a558SYan, Zheng rc->search_start = key.objectid; 40133fd0a558SYan, Zheng } 40145d4f98a2SYan Zheng } 40155d4f98a2SYan Zheng 40163fd0a558SYan, Zheng if (rc->commit_transaction) { 40173fd0a558SYan, Zheng rc->commit_transaction = 0; 40183fd0a558SYan, Zheng ret = btrfs_commit_transaction(trans, rc->extent_root); 40193fd0a558SYan, Zheng BUG_ON(ret); 40203fd0a558SYan, Zheng } else { 40213fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, rc->extent_root); 4022b53d3f5dSLiu Bo btrfs_btree_balance_dirty(rc->extent_root); 40233fd0a558SYan, Zheng } 40243fd0a558SYan, Zheng trans = NULL; 40255d4f98a2SYan Zheng 40265d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 40275d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40285d4f98a2SYan Zheng rc->found_file_extent = 1; 40290257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 40303fd0a558SYan, Zheng &key, &rc->cluster); 40315d4f98a2SYan Zheng if (ret < 0) { 40325d4f98a2SYan Zheng err = ret; 40335d4f98a2SYan Zheng break; 40345d4f98a2SYan Zheng } 40355d4f98a2SYan Zheng } 40365d4f98a2SYan Zheng } 4037c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 4038c87f08caSChris Mason ret = btrfs_force_chunk_alloc(trans, rc->extent_root, 4039c87f08caSChris Mason rc->block_group->flags); 4040c87f08caSChris Mason if (ret == 0) { 4041c87f08caSChris Mason err = 0; 4042c87f08caSChris Mason progress = 0; 4043c87f08caSChris Mason goto restart; 4044c87f08caSChris Mason } 4045c87f08caSChris Mason } 40463fd0a558SYan, Zheng 4047b3b4aa74SDavid Sterba btrfs_release_path(path); 40483fd0a558SYan, Zheng clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY, 40493fd0a558SYan, Zheng GFP_NOFS); 40505d4f98a2SYan Zheng 40515d4f98a2SYan Zheng if (trans) { 40523fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, rc->extent_root); 4053b53d3f5dSLiu Bo btrfs_btree_balance_dirty(rc->extent_root); 40545d4f98a2SYan Zheng } 40555d4f98a2SYan Zheng 40560257bb82SYan, Zheng if (!err) { 40573fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 40583fd0a558SYan, Zheng &rc->cluster); 40590257bb82SYan, Zheng if (ret < 0) 40600257bb82SYan, Zheng err = ret; 40610257bb82SYan, Zheng } 40620257bb82SYan, Zheng 40633fd0a558SYan, Zheng rc->create_reloc_tree = 0; 40643fd0a558SYan, Zheng set_reloc_control(rc); 40650257bb82SYan, Zheng 40663fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 40673fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1); 40685d4f98a2SYan Zheng 40693fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 40705d4f98a2SYan Zheng 40715d4f98a2SYan Zheng merge_reloc_roots(rc); 40725d4f98a2SYan Zheng 40733fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 40745d4f98a2SYan Zheng unset_reloc_control(rc); 40753fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1); 40765d4f98a2SYan Zheng 40775d4f98a2SYan Zheng /* get rid of pinned extents */ 40787a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 40793612b495STsutomu Itoh if (IS_ERR(trans)) 40803612b495STsutomu Itoh err = PTR_ERR(trans); 40813612b495STsutomu Itoh else 40825d4f98a2SYan Zheng btrfs_commit_transaction(trans, rc->extent_root); 40833fd0a558SYan, Zheng out_free: 40843fd0a558SYan, Zheng btrfs_free_block_rsv(rc->extent_root, rc->block_rsv); 40853fd0a558SYan, Zheng btrfs_free_path(path); 40865d4f98a2SYan Zheng return err; 40875d4f98a2SYan Zheng } 40885d4f98a2SYan Zheng 40895d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 40900257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 40915d4f98a2SYan Zheng { 40925d4f98a2SYan Zheng struct btrfs_path *path; 40935d4f98a2SYan Zheng struct btrfs_inode_item *item; 40945d4f98a2SYan Zheng struct extent_buffer *leaf; 40955d4f98a2SYan Zheng int ret; 40965d4f98a2SYan Zheng 40975d4f98a2SYan Zheng path = btrfs_alloc_path(); 40985d4f98a2SYan Zheng if (!path) 40995d4f98a2SYan Zheng return -ENOMEM; 41005d4f98a2SYan Zheng 41015d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 41025d4f98a2SYan Zheng if (ret) 41035d4f98a2SYan Zheng goto out; 41045d4f98a2SYan Zheng 41055d4f98a2SYan Zheng leaf = path->nodes[0]; 41065d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 41075d4f98a2SYan Zheng memset_extent_buffer(leaf, 0, (unsigned long)item, sizeof(*item)); 41085d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 41090257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 41105d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 41113fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 41123fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 41135d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 4114b3b4aa74SDavid Sterba btrfs_release_path(path); 41155d4f98a2SYan Zheng out: 41165d4f98a2SYan Zheng btrfs_free_path(path); 41175d4f98a2SYan Zheng return ret; 41185d4f98a2SYan Zheng } 41195d4f98a2SYan Zheng 41205d4f98a2SYan Zheng /* 41215d4f98a2SYan Zheng * helper to create inode for data relocation. 41225d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 41235d4f98a2SYan Zheng */ 41243fd0a558SYan, Zheng static noinline_for_stack 41253fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 41265d4f98a2SYan Zheng struct btrfs_block_group_cache *group) 41275d4f98a2SYan Zheng { 41285d4f98a2SYan Zheng struct inode *inode = NULL; 41295d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 41305d4f98a2SYan Zheng struct btrfs_root *root; 41315d4f98a2SYan Zheng struct btrfs_key key; 41325d4f98a2SYan Zheng u64 objectid = BTRFS_FIRST_FREE_OBJECTID; 41335d4f98a2SYan Zheng int err = 0; 41345d4f98a2SYan Zheng 41355d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 41365d4f98a2SYan Zheng if (IS_ERR(root)) 41375d4f98a2SYan Zheng return ERR_CAST(root); 41385d4f98a2SYan Zheng 4139a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 41403fd0a558SYan, Zheng if (IS_ERR(trans)) 41413fd0a558SYan, Zheng return ERR_CAST(trans); 41425d4f98a2SYan Zheng 4143581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 41445d4f98a2SYan Zheng if (err) 41455d4f98a2SYan Zheng goto out; 41465d4f98a2SYan Zheng 41470257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 41485d4f98a2SYan Zheng BUG_ON(err); 41495d4f98a2SYan Zheng 41505d4f98a2SYan Zheng key.objectid = objectid; 41515d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 41525d4f98a2SYan Zheng key.offset = 0; 415373f73415SJosef Bacik inode = btrfs_iget(root->fs_info->sb, &key, root, NULL); 41545d4f98a2SYan Zheng BUG_ON(IS_ERR(inode) || is_bad_inode(inode)); 41555d4f98a2SYan Zheng BTRFS_I(inode)->index_cnt = group->key.objectid; 41565d4f98a2SYan Zheng 41575d4f98a2SYan Zheng err = btrfs_orphan_add(trans, inode); 41585d4f98a2SYan Zheng out: 41595d4f98a2SYan Zheng btrfs_end_transaction(trans, root); 4160b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 41615d4f98a2SYan Zheng if (err) { 41625d4f98a2SYan Zheng if (inode) 41635d4f98a2SYan Zheng iput(inode); 41645d4f98a2SYan Zheng inode = ERR_PTR(err); 41655d4f98a2SYan Zheng } 41665d4f98a2SYan Zheng return inode; 41675d4f98a2SYan Zheng } 41685d4f98a2SYan Zheng 4169a9995eecSJosef Bacik static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 41703fd0a558SYan, Zheng { 41713fd0a558SYan, Zheng struct reloc_control *rc; 41723fd0a558SYan, Zheng 41733fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 41743fd0a558SYan, Zheng if (!rc) 41753fd0a558SYan, Zheng return NULL; 41763fd0a558SYan, Zheng 41773fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 41783fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 41793fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 4180a9995eecSJosef Bacik extent_io_tree_init(&rc->processed_blocks, 4181a9995eecSJosef Bacik fs_info->btree_inode->i_mapping); 41823fd0a558SYan, Zheng return rc; 41833fd0a558SYan, Zheng } 41843fd0a558SYan, Zheng 41855d4f98a2SYan Zheng /* 41865d4f98a2SYan Zheng * function to relocate all extents in a block group. 41875d4f98a2SYan Zheng */ 41885d4f98a2SYan Zheng int btrfs_relocate_block_group(struct btrfs_root *extent_root, u64 group_start) 41895d4f98a2SYan Zheng { 41905d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = extent_root->fs_info; 41915d4f98a2SYan Zheng struct reloc_control *rc; 41920af3d00bSJosef Bacik struct inode *inode; 41930af3d00bSJosef Bacik struct btrfs_path *path; 41945d4f98a2SYan Zheng int ret; 4195f0486c68SYan, Zheng int rw = 0; 41965d4f98a2SYan Zheng int err = 0; 41975d4f98a2SYan Zheng 4198a9995eecSJosef Bacik rc = alloc_reloc_control(fs_info); 41995d4f98a2SYan Zheng if (!rc) 42005d4f98a2SYan Zheng return -ENOMEM; 42015d4f98a2SYan Zheng 4202f0486c68SYan, Zheng rc->extent_root = extent_root; 42033fd0a558SYan, Zheng 42045d4f98a2SYan Zheng rc->block_group = btrfs_lookup_block_group(fs_info, group_start); 42055d4f98a2SYan Zheng BUG_ON(!rc->block_group); 42065d4f98a2SYan Zheng 4207f0486c68SYan, Zheng if (!rc->block_group->ro) { 4208f0486c68SYan, Zheng ret = btrfs_set_block_group_ro(extent_root, rc->block_group); 4209f0486c68SYan, Zheng if (ret) { 4210f0486c68SYan, Zheng err = ret; 4211f0486c68SYan, Zheng goto out; 4212f0486c68SYan, Zheng } 4213f0486c68SYan, Zheng rw = 1; 4214f0486c68SYan, Zheng } 4215f0486c68SYan, Zheng 42160af3d00bSJosef Bacik path = btrfs_alloc_path(); 42170af3d00bSJosef Bacik if (!path) { 42180af3d00bSJosef Bacik err = -ENOMEM; 42190af3d00bSJosef Bacik goto out; 42200af3d00bSJosef Bacik } 42210af3d00bSJosef Bacik 42220af3d00bSJosef Bacik inode = lookup_free_space_inode(fs_info->tree_root, rc->block_group, 42230af3d00bSJosef Bacik path); 42240af3d00bSJosef Bacik btrfs_free_path(path); 42250af3d00bSJosef Bacik 42260af3d00bSJosef Bacik if (!IS_ERR(inode)) 42270af3d00bSJosef Bacik ret = delete_block_group_cache(fs_info, inode, 0); 42280af3d00bSJosef Bacik else 42290af3d00bSJosef Bacik ret = PTR_ERR(inode); 42300af3d00bSJosef Bacik 42310af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 42320af3d00bSJosef Bacik err = ret; 42330af3d00bSJosef Bacik goto out; 42340af3d00bSJosef Bacik } 42350af3d00bSJosef Bacik 42365d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 42375d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 42385d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 42395d4f98a2SYan Zheng rc->data_inode = NULL; 42405d4f98a2SYan Zheng goto out; 42415d4f98a2SYan Zheng } 42425d4f98a2SYan Zheng 42435d4f98a2SYan Zheng printk(KERN_INFO "btrfs: relocating block group %llu flags %llu\n", 4244c1c9ff7cSGeert Uytterhoeven rc->block_group->key.objectid, rc->block_group->flags); 42455d4f98a2SYan Zheng 424691aef86fSMiao Xie ret = btrfs_start_delalloc_roots(fs_info, 0); 42478ccf6f19SMiao Xie if (ret < 0) { 42488ccf6f19SMiao Xie err = ret; 42498ccf6f19SMiao Xie goto out; 42508ccf6f19SMiao Xie } 4251b0244199SMiao Xie btrfs_wait_ordered_roots(fs_info, -1); 42525d4f98a2SYan Zheng 42535d4f98a2SYan Zheng while (1) { 425476dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 42555d4f98a2SYan Zheng ret = relocate_block_group(rc); 425676dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 42575d4f98a2SYan Zheng if (ret < 0) { 42585d4f98a2SYan Zheng err = ret; 42593fd0a558SYan, Zheng goto out; 42605d4f98a2SYan Zheng } 42615d4f98a2SYan Zheng 42625d4f98a2SYan Zheng if (rc->extents_found == 0) 42635d4f98a2SYan Zheng break; 42645d4f98a2SYan Zheng 42655d4f98a2SYan Zheng printk(KERN_INFO "btrfs: found %llu extents\n", 4266c1c9ff7cSGeert Uytterhoeven rc->extents_found); 42675d4f98a2SYan Zheng 42685d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 42690ef8b726SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 42700ef8b726SJosef Bacik (u64)-1); 42710ef8b726SJosef Bacik if (ret) { 42720ef8b726SJosef Bacik err = ret; 42730ef8b726SJosef Bacik goto out; 42740ef8b726SJosef Bacik } 42755d4f98a2SYan Zheng invalidate_mapping_pages(rc->data_inode->i_mapping, 42765d4f98a2SYan Zheng 0, -1); 42775d4f98a2SYan Zheng rc->stage = UPDATE_DATA_PTRS; 42785d4f98a2SYan Zheng } 42795d4f98a2SYan Zheng } 42805d4f98a2SYan Zheng 42810257bb82SYan, Zheng filemap_write_and_wait_range(fs_info->btree_inode->i_mapping, 42825d4f98a2SYan Zheng rc->block_group->key.objectid, 42835d4f98a2SYan Zheng rc->block_group->key.objectid + 42845d4f98a2SYan Zheng rc->block_group->key.offset - 1); 42855d4f98a2SYan Zheng 42865d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 42875d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 42885d4f98a2SYan Zheng WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0); 42895d4f98a2SYan Zheng out: 4290f0486c68SYan, Zheng if (err && rw) 4291f0486c68SYan, Zheng btrfs_set_block_group_rw(extent_root, rc->block_group); 42925d4f98a2SYan Zheng iput(rc->data_inode); 42935d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 42945d4f98a2SYan Zheng kfree(rc); 42955d4f98a2SYan Zheng return err; 42965d4f98a2SYan Zheng } 42975d4f98a2SYan Zheng 429876dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 429976dda93cSYan, Zheng { 430076dda93cSYan, Zheng struct btrfs_trans_handle *trans; 430179787eaaSJeff Mahoney int ret, err; 430276dda93cSYan, Zheng 4303a22285a6SYan, Zheng trans = btrfs_start_transaction(root->fs_info->tree_root, 0); 430479787eaaSJeff Mahoney if (IS_ERR(trans)) 430579787eaaSJeff Mahoney return PTR_ERR(trans); 430676dda93cSYan, Zheng 430776dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 430876dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 430976dda93cSYan, Zheng root->root_item.drop_level = 0; 431076dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 431176dda93cSYan, Zheng ret = btrfs_update_root(trans, root->fs_info->tree_root, 431276dda93cSYan, Zheng &root->root_key, &root->root_item); 431376dda93cSYan, Zheng 431479787eaaSJeff Mahoney err = btrfs_end_transaction(trans, root->fs_info->tree_root); 431579787eaaSJeff Mahoney if (err) 431679787eaaSJeff Mahoney return err; 431779787eaaSJeff Mahoney return ret; 431876dda93cSYan, Zheng } 431976dda93cSYan, Zheng 43205d4f98a2SYan Zheng /* 43215d4f98a2SYan Zheng * recover relocation interrupted by system crash. 43225d4f98a2SYan Zheng * 43235d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 43245d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 43255d4f98a2SYan Zheng */ 43265d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 43275d4f98a2SYan Zheng { 43285d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 43295d4f98a2SYan Zheng struct btrfs_key key; 43305d4f98a2SYan Zheng struct btrfs_root *fs_root; 43315d4f98a2SYan Zheng struct btrfs_root *reloc_root; 43325d4f98a2SYan Zheng struct btrfs_path *path; 43335d4f98a2SYan Zheng struct extent_buffer *leaf; 43345d4f98a2SYan Zheng struct reloc_control *rc = NULL; 43355d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 43365d4f98a2SYan Zheng int ret; 43375d4f98a2SYan Zheng int err = 0; 43385d4f98a2SYan Zheng 43395d4f98a2SYan Zheng path = btrfs_alloc_path(); 43405d4f98a2SYan Zheng if (!path) 43415d4f98a2SYan Zheng return -ENOMEM; 4342026fd317SJosef Bacik path->reada = -1; 43435d4f98a2SYan Zheng 43445d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 43455d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 43465d4f98a2SYan Zheng key.offset = (u64)-1; 43475d4f98a2SYan Zheng 43485d4f98a2SYan Zheng while (1) { 43495d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key, 43505d4f98a2SYan Zheng path, 0, 0); 43515d4f98a2SYan Zheng if (ret < 0) { 43525d4f98a2SYan Zheng err = ret; 43535d4f98a2SYan Zheng goto out; 43545d4f98a2SYan Zheng } 43555d4f98a2SYan Zheng if (ret > 0) { 43565d4f98a2SYan Zheng if (path->slots[0] == 0) 43575d4f98a2SYan Zheng break; 43585d4f98a2SYan Zheng path->slots[0]--; 43595d4f98a2SYan Zheng } 43605d4f98a2SYan Zheng leaf = path->nodes[0]; 43615d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4362b3b4aa74SDavid Sterba btrfs_release_path(path); 43635d4f98a2SYan Zheng 43645d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 43655d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 43665d4f98a2SYan Zheng break; 43675d4f98a2SYan Zheng 4368cb517eabSMiao Xie reloc_root = btrfs_read_fs_root(root, &key); 43695d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 43705d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 43715d4f98a2SYan Zheng goto out; 43725d4f98a2SYan Zheng } 43735d4f98a2SYan Zheng 43745d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 43755d4f98a2SYan Zheng 43765d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 43775d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 43785d4f98a2SYan Zheng reloc_root->root_key.offset); 43795d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 438076dda93cSYan, Zheng ret = PTR_ERR(fs_root); 438176dda93cSYan, Zheng if (ret != -ENOENT) { 438276dda93cSYan, Zheng err = ret; 43835d4f98a2SYan Zheng goto out; 43845d4f98a2SYan Zheng } 438579787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 438679787eaaSJeff Mahoney if (ret < 0) { 438779787eaaSJeff Mahoney err = ret; 438879787eaaSJeff Mahoney goto out; 438979787eaaSJeff Mahoney } 439076dda93cSYan, Zheng } 43915d4f98a2SYan Zheng } 43925d4f98a2SYan Zheng 43935d4f98a2SYan Zheng if (key.offset == 0) 43945d4f98a2SYan Zheng break; 43955d4f98a2SYan Zheng 43965d4f98a2SYan Zheng key.offset--; 43975d4f98a2SYan Zheng } 4398b3b4aa74SDavid Sterba btrfs_release_path(path); 43995d4f98a2SYan Zheng 44005d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 44015d4f98a2SYan Zheng goto out; 44025d4f98a2SYan Zheng 4403a9995eecSJosef Bacik rc = alloc_reloc_control(root->fs_info); 44045d4f98a2SYan Zheng if (!rc) { 44055d4f98a2SYan Zheng err = -ENOMEM; 44065d4f98a2SYan Zheng goto out; 44075d4f98a2SYan Zheng } 44085d4f98a2SYan Zheng 44095d4f98a2SYan Zheng rc->extent_root = root->fs_info->extent_root; 44105d4f98a2SYan Zheng 44115d4f98a2SYan Zheng set_reloc_control(rc); 44125d4f98a2SYan Zheng 44137a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 44143612b495STsutomu Itoh if (IS_ERR(trans)) { 44153612b495STsutomu Itoh unset_reloc_control(rc); 44163612b495STsutomu Itoh err = PTR_ERR(trans); 44173612b495STsutomu Itoh goto out_free; 44183612b495STsutomu Itoh } 44193fd0a558SYan, Zheng 44203fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 44213fd0a558SYan, Zheng 44225d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 44235d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 44245d4f98a2SYan Zheng struct btrfs_root, root_list); 44255d4f98a2SYan Zheng list_del(&reloc_root->root_list); 44265d4f98a2SYan Zheng 44275d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 44285d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 44295d4f98a2SYan Zheng &rc->reloc_roots); 44305d4f98a2SYan Zheng continue; 44315d4f98a2SYan Zheng } 44325d4f98a2SYan Zheng 44335d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 44345d4f98a2SYan Zheng reloc_root->root_key.offset); 443579787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 443679787eaaSJeff Mahoney err = PTR_ERR(fs_root); 443779787eaaSJeff Mahoney goto out_free; 443879787eaaSJeff Mahoney } 44395d4f98a2SYan Zheng 4440ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 444179787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 44425d4f98a2SYan Zheng fs_root->reloc_root = reloc_root; 44435d4f98a2SYan Zheng } 44445d4f98a2SYan Zheng 444579787eaaSJeff Mahoney err = btrfs_commit_transaction(trans, rc->extent_root); 444679787eaaSJeff Mahoney if (err) 444779787eaaSJeff Mahoney goto out_free; 44485d4f98a2SYan Zheng 44495d4f98a2SYan Zheng merge_reloc_roots(rc); 44505d4f98a2SYan Zheng 44515d4f98a2SYan Zheng unset_reloc_control(rc); 44525d4f98a2SYan Zheng 44537a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 44543612b495STsutomu Itoh if (IS_ERR(trans)) 44553612b495STsutomu Itoh err = PTR_ERR(trans); 44563612b495STsutomu Itoh else 445779787eaaSJeff Mahoney err = btrfs_commit_transaction(trans, rc->extent_root); 44583612b495STsutomu Itoh out_free: 44595d4f98a2SYan Zheng kfree(rc); 44603612b495STsutomu Itoh out: 4461aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4462aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4463aca1bba6SLiu Bo 44645d4f98a2SYan Zheng btrfs_free_path(path); 44655d4f98a2SYan Zheng 44665d4f98a2SYan Zheng if (err == 0) { 44675d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 44685d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 44695d4f98a2SYan Zheng BTRFS_DATA_RELOC_TREE_OBJECTID); 44705d4f98a2SYan Zheng if (IS_ERR(fs_root)) 44715d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4472d7ce5843SMiao Xie else 447366b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 44745d4f98a2SYan Zheng } 44755d4f98a2SYan Zheng return err; 44765d4f98a2SYan Zheng } 44775d4f98a2SYan Zheng 44785d4f98a2SYan Zheng /* 44795d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 44805d4f98a2SYan Zheng * 44815d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 44825d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 44835d4f98a2SYan Zheng */ 44845d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 44855d4f98a2SYan Zheng { 44865d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 44875d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 44885d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(inode)->root; 44895d4f98a2SYan Zheng int ret; 44905d4f98a2SYan Zheng u64 disk_bytenr; 44914577b014SJosef Bacik u64 new_bytenr; 44925d4f98a2SYan Zheng LIST_HEAD(list); 44935d4f98a2SYan Zheng 44945d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 44955d4f98a2SYan Zheng BUG_ON(ordered->file_offset != file_pos || ordered->len != len); 44965d4f98a2SYan Zheng 44975d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 44985d4f98a2SYan Zheng ret = btrfs_lookup_csums_range(root->fs_info->csum_root, disk_bytenr, 4499a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 450079787eaaSJeff Mahoney if (ret) 450179787eaaSJeff Mahoney goto out; 45025d4f98a2SYan Zheng 45035d4f98a2SYan Zheng while (!list_empty(&list)) { 45045d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 45055d4f98a2SYan Zheng list_del_init(&sums->list); 45065d4f98a2SYan Zheng 45074577b014SJosef Bacik /* 45084577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 45094577b014SJosef Bacik * We need to do this because we will read in entire prealloc 45104577b014SJosef Bacik * extents but we may have written to say the middle of the 45114577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 45124577b014SJosef Bacik * the right disk offset. 45134577b014SJosef Bacik * 45144577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 45154577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 45164577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 45174577b014SJosef Bacik * disk length. 45184577b014SJosef Bacik */ 45194577b014SJosef Bacik new_bytenr = ordered->start + (sums->bytenr - disk_bytenr); 45204577b014SJosef Bacik sums->bytenr = new_bytenr; 45215d4f98a2SYan Zheng 45225d4f98a2SYan Zheng btrfs_add_ordered_sum(inode, ordered, sums); 45235d4f98a2SYan Zheng } 452479787eaaSJeff Mahoney out: 45255d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4526411fc6bcSAndi Kleen return ret; 45275d4f98a2SYan Zheng } 45283fd0a558SYan, Zheng 452983d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 45303fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 45313fd0a558SYan, Zheng struct extent_buffer *cow) 45323fd0a558SYan, Zheng { 45333fd0a558SYan, Zheng struct reloc_control *rc; 45343fd0a558SYan, Zheng struct backref_node *node; 45353fd0a558SYan, Zheng int first_cow = 0; 45363fd0a558SYan, Zheng int level; 453783d4cfd4SJosef Bacik int ret = 0; 45383fd0a558SYan, Zheng 45393fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 45403fd0a558SYan, Zheng if (!rc) 454183d4cfd4SJosef Bacik return 0; 45423fd0a558SYan, Zheng 45433fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 45443fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 45453fd0a558SYan, Zheng 4546c974c464SWang Shilong if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 4547c974c464SWang Shilong if (buf == root->node) 4548c974c464SWang Shilong __update_reloc_root(root, cow->start); 4549c974c464SWang Shilong } 4550c974c464SWang Shilong 45513fd0a558SYan, Zheng level = btrfs_header_level(buf); 45523fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 45533fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 45543fd0a558SYan, Zheng first_cow = 1; 45553fd0a558SYan, Zheng 45563fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 45573fd0a558SYan, Zheng rc->create_reloc_tree) { 45583fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 45593fd0a558SYan, Zheng 45603fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 45613fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 45623fd0a558SYan, Zheng node->new_bytenr != buf->start); 45633fd0a558SYan, Zheng 45643fd0a558SYan, Zheng drop_node_buffer(node); 45653fd0a558SYan, Zheng extent_buffer_get(cow); 45663fd0a558SYan, Zheng node->eb = cow; 45673fd0a558SYan, Zheng node->new_bytenr = cow->start; 45683fd0a558SYan, Zheng 45693fd0a558SYan, Zheng if (!node->pending) { 45703fd0a558SYan, Zheng list_move_tail(&node->list, 45713fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 45723fd0a558SYan, Zheng node->pending = 1; 45733fd0a558SYan, Zheng } 45743fd0a558SYan, Zheng 45753fd0a558SYan, Zheng if (first_cow) 45763fd0a558SYan, Zheng __mark_block_processed(rc, node); 45773fd0a558SYan, Zheng 45783fd0a558SYan, Zheng if (first_cow && level > 0) 45793fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 45803fd0a558SYan, Zheng } 45813fd0a558SYan, Zheng 458283d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 45833fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 458483d4cfd4SJosef Bacik return ret; 45853fd0a558SYan, Zheng } 45863fd0a558SYan, Zheng 45873fd0a558SYan, Zheng /* 45883fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 45893fd0a558SYan, Zheng * requried for relocating tree blocks in the snapshot 45903fd0a558SYan, Zheng */ 45913fd0a558SYan, Zheng void btrfs_reloc_pre_snapshot(struct btrfs_trans_handle *trans, 45923fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending, 45933fd0a558SYan, Zheng u64 *bytes_to_reserve) 45943fd0a558SYan, Zheng { 45953fd0a558SYan, Zheng struct btrfs_root *root; 45963fd0a558SYan, Zheng struct reloc_control *rc; 45973fd0a558SYan, Zheng 45983fd0a558SYan, Zheng root = pending->root; 45993fd0a558SYan, Zheng if (!root->reloc_root) 46003fd0a558SYan, Zheng return; 46013fd0a558SYan, Zheng 46023fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 46033fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 46043fd0a558SYan, Zheng return; 46053fd0a558SYan, Zheng 46063fd0a558SYan, Zheng root = root->reloc_root; 46073fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 46083fd0a558SYan, Zheng /* 46093fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 46103fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 46113fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 46123fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 46133fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 46143fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 46153fd0a558SYan, Zheng * tree may use more space than it frees. so we need 46163fd0a558SYan, Zheng * reserve extra space. 46173fd0a558SYan, Zheng */ 46183fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 46193fd0a558SYan, Zheng } 46203fd0a558SYan, Zheng 46213fd0a558SYan, Zheng /* 46223fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 46233fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 46243fd0a558SYan, Zheng */ 462549b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 46263fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 46273fd0a558SYan, Zheng { 46283fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 46293fd0a558SYan, Zheng struct btrfs_root *reloc_root; 46303fd0a558SYan, Zheng struct btrfs_root *new_root; 46313fd0a558SYan, Zheng struct reloc_control *rc; 46323fd0a558SYan, Zheng int ret; 46333fd0a558SYan, Zheng 46343fd0a558SYan, Zheng if (!root->reloc_root) 463549b25e05SJeff Mahoney return 0; 46363fd0a558SYan, Zheng 46373fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 46383fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 46393fd0a558SYan, Zheng 46403fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 46413fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 46423fd0a558SYan, Zheng rc->block_rsv, 46433fd0a558SYan, Zheng rc->nodes_relocated); 464449b25e05SJeff Mahoney if (ret) 464549b25e05SJeff Mahoney return ret; 46463fd0a558SYan, Zheng } 46473fd0a558SYan, Zheng 46483fd0a558SYan, Zheng new_root = pending->snap; 46493fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 46503fd0a558SYan, Zheng new_root->root_key.objectid); 465149b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 465249b25e05SJeff Mahoney return PTR_ERR(reloc_root); 46533fd0a558SYan, Zheng 4654ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4655ffd7b339SJeff Mahoney BUG_ON(ret < 0); 46563fd0a558SYan, Zheng new_root->reloc_root = reloc_root; 46573fd0a558SYan, Zheng 465849b25e05SJeff Mahoney if (rc->create_reloc_tree) 46593fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 466049b25e05SJeff Mahoney return ret; 46613fd0a558SYan, Zheng } 4662