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" 3462b99540SQu Wenruo #include "qgroup.h" 355d4f98a2SYan Zheng 365d4f98a2SYan Zheng /* 375d4f98a2SYan Zheng * backref_node, mapping_node and tree_block start with this 385d4f98a2SYan Zheng */ 395d4f98a2SYan Zheng struct tree_entry { 405d4f98a2SYan Zheng struct rb_node rb_node; 415d4f98a2SYan Zheng u64 bytenr; 425d4f98a2SYan Zheng }; 435d4f98a2SYan Zheng 445d4f98a2SYan Zheng /* 455d4f98a2SYan Zheng * present a tree block in the backref cache 465d4f98a2SYan Zheng */ 475d4f98a2SYan Zheng struct backref_node { 485d4f98a2SYan Zheng struct rb_node rb_node; 495d4f98a2SYan Zheng u64 bytenr; 503fd0a558SYan, Zheng 513fd0a558SYan, Zheng u64 new_bytenr; 523fd0a558SYan, Zheng /* objectid of tree block owner, can be not uptodate */ 535d4f98a2SYan Zheng u64 owner; 543fd0a558SYan, Zheng /* link to pending, changed or detached list */ 553fd0a558SYan, Zheng struct list_head list; 565d4f98a2SYan Zheng /* list of upper level blocks reference this block */ 575d4f98a2SYan Zheng struct list_head upper; 585d4f98a2SYan Zheng /* list of child blocks in the cache */ 595d4f98a2SYan Zheng struct list_head lower; 605d4f98a2SYan Zheng /* NULL if this node is not tree root */ 615d4f98a2SYan Zheng struct btrfs_root *root; 625d4f98a2SYan Zheng /* extent buffer got by COW the block */ 635d4f98a2SYan Zheng struct extent_buffer *eb; 645d4f98a2SYan Zheng /* level of tree block */ 655d4f98a2SYan Zheng unsigned int level:8; 663fd0a558SYan, Zheng /* is the block in non-reference counted tree */ 673fd0a558SYan, Zheng unsigned int cowonly:1; 683fd0a558SYan, Zheng /* 1 if no child node in the cache */ 695d4f98a2SYan Zheng unsigned int lowest:1; 705d4f98a2SYan Zheng /* is the extent buffer locked */ 715d4f98a2SYan Zheng unsigned int locked:1; 725d4f98a2SYan Zheng /* has the block been processed */ 735d4f98a2SYan Zheng unsigned int processed:1; 745d4f98a2SYan Zheng /* have backrefs of this block been checked */ 755d4f98a2SYan Zheng unsigned int checked:1; 763fd0a558SYan, Zheng /* 773fd0a558SYan, Zheng * 1 if corresponding block has been cowed but some upper 783fd0a558SYan, Zheng * level block pointers may not point to the new location 793fd0a558SYan, Zheng */ 803fd0a558SYan, Zheng unsigned int pending:1; 813fd0a558SYan, Zheng /* 823fd0a558SYan, Zheng * 1 if the backref node isn't connected to any other 833fd0a558SYan, Zheng * backref node. 843fd0a558SYan, Zheng */ 853fd0a558SYan, Zheng unsigned int detached:1; 865d4f98a2SYan Zheng }; 875d4f98a2SYan Zheng 885d4f98a2SYan Zheng /* 895d4f98a2SYan Zheng * present a block pointer in the backref cache 905d4f98a2SYan Zheng */ 915d4f98a2SYan Zheng struct backref_edge { 925d4f98a2SYan Zheng struct list_head list[2]; 935d4f98a2SYan Zheng struct backref_node *node[2]; 945d4f98a2SYan Zheng }; 955d4f98a2SYan Zheng 965d4f98a2SYan Zheng #define LOWER 0 975d4f98a2SYan Zheng #define UPPER 1 980647bf56SWang Shilong #define RELOCATION_RESERVED_NODES 256 995d4f98a2SYan Zheng 1005d4f98a2SYan Zheng struct backref_cache { 1015d4f98a2SYan Zheng /* red black tree of all backref nodes in the cache */ 1025d4f98a2SYan Zheng struct rb_root rb_root; 1033fd0a558SYan, Zheng /* for passing backref nodes to btrfs_reloc_cow_block */ 1043fd0a558SYan, Zheng struct backref_node *path[BTRFS_MAX_LEVEL]; 1053fd0a558SYan, Zheng /* 1063fd0a558SYan, Zheng * list of blocks that have been cowed but some block 1073fd0a558SYan, Zheng * pointers in upper level blocks may not reflect the 1083fd0a558SYan, Zheng * new location 1093fd0a558SYan, Zheng */ 1105d4f98a2SYan Zheng struct list_head pending[BTRFS_MAX_LEVEL]; 1113fd0a558SYan, Zheng /* list of backref nodes with no child node */ 1123fd0a558SYan, Zheng struct list_head leaves; 1133fd0a558SYan, Zheng /* list of blocks that have been cowed in current transaction */ 1143fd0a558SYan, Zheng struct list_head changed; 1153fd0a558SYan, Zheng /* list of detached backref node. */ 1163fd0a558SYan, Zheng struct list_head detached; 1173fd0a558SYan, Zheng 1183fd0a558SYan, Zheng u64 last_trans; 1193fd0a558SYan, Zheng 1203fd0a558SYan, Zheng int nr_nodes; 1213fd0a558SYan, Zheng int nr_edges; 1225d4f98a2SYan Zheng }; 1235d4f98a2SYan Zheng 1245d4f98a2SYan Zheng /* 1255d4f98a2SYan Zheng * map address of tree root to tree 1265d4f98a2SYan Zheng */ 1275d4f98a2SYan Zheng struct mapping_node { 1285d4f98a2SYan Zheng struct rb_node rb_node; 1295d4f98a2SYan Zheng u64 bytenr; 1305d4f98a2SYan Zheng void *data; 1315d4f98a2SYan Zheng }; 1325d4f98a2SYan Zheng 1335d4f98a2SYan Zheng struct mapping_tree { 1345d4f98a2SYan Zheng struct rb_root rb_root; 1355d4f98a2SYan Zheng spinlock_t lock; 1365d4f98a2SYan Zheng }; 1375d4f98a2SYan Zheng 1385d4f98a2SYan Zheng /* 1395d4f98a2SYan Zheng * present a tree block to process 1405d4f98a2SYan Zheng */ 1415d4f98a2SYan Zheng struct tree_block { 1425d4f98a2SYan Zheng struct rb_node rb_node; 1435d4f98a2SYan Zheng u64 bytenr; 1445d4f98a2SYan Zheng struct btrfs_key key; 1455d4f98a2SYan Zheng unsigned int level:8; 1465d4f98a2SYan Zheng unsigned int key_ready:1; 1475d4f98a2SYan Zheng }; 1485d4f98a2SYan Zheng 1490257bb82SYan, Zheng #define MAX_EXTENTS 128 1500257bb82SYan, Zheng 1510257bb82SYan, Zheng struct file_extent_cluster { 1520257bb82SYan, Zheng u64 start; 1530257bb82SYan, Zheng u64 end; 1540257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 1550257bb82SYan, Zheng unsigned int nr; 1560257bb82SYan, Zheng }; 1570257bb82SYan, Zheng 1585d4f98a2SYan Zheng struct reloc_control { 1595d4f98a2SYan Zheng /* block group to relocate */ 1605d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group; 1615d4f98a2SYan Zheng /* extent tree */ 1625d4f98a2SYan Zheng struct btrfs_root *extent_root; 1635d4f98a2SYan Zheng /* inode for moving data */ 1645d4f98a2SYan Zheng struct inode *data_inode; 1653fd0a558SYan, Zheng 1663fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 1673fd0a558SYan, Zheng 1683fd0a558SYan, Zheng struct backref_cache backref_cache; 1693fd0a558SYan, Zheng 1703fd0a558SYan, Zheng struct file_extent_cluster cluster; 1715d4f98a2SYan Zheng /* tree blocks have been processed */ 1725d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 1735d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 1745d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 1755d4f98a2SYan Zheng /* list of reloc trees */ 1765d4f98a2SYan Zheng struct list_head reloc_roots; 1773fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 1783fd0a558SYan, Zheng u64 merging_rsv_size; 1793fd0a558SYan, Zheng /* size of relocated tree nodes */ 1803fd0a558SYan, Zheng u64 nodes_relocated; 1810647bf56SWang Shilong /* reserved size for block group relocation*/ 1820647bf56SWang Shilong u64 reserved_bytes; 1833fd0a558SYan, Zheng 1845d4f98a2SYan Zheng u64 search_start; 1855d4f98a2SYan Zheng u64 extents_found; 1863fd0a558SYan, Zheng 1873fd0a558SYan, Zheng unsigned int stage:8; 1883fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 1893fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 1905d4f98a2SYan Zheng unsigned int found_file_extent:1; 1915d4f98a2SYan Zheng }; 1925d4f98a2SYan Zheng 1935d4f98a2SYan Zheng /* stages of data relocation */ 1945d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 1955d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 1965d4f98a2SYan Zheng 1973fd0a558SYan, Zheng static void remove_backref_node(struct backref_cache *cache, 1983fd0a558SYan, Zheng struct backref_node *node); 1993fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 2003fd0a558SYan, Zheng struct backref_node *node); 2015d4f98a2SYan Zheng 2025d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 2035d4f98a2SYan Zheng { 2046bef4d31SEric Paris tree->rb_root = RB_ROOT; 2055d4f98a2SYan Zheng spin_lock_init(&tree->lock); 2065d4f98a2SYan Zheng } 2075d4f98a2SYan Zheng 2085d4f98a2SYan Zheng static void backref_cache_init(struct backref_cache *cache) 2095d4f98a2SYan Zheng { 2105d4f98a2SYan Zheng int i; 2116bef4d31SEric Paris cache->rb_root = RB_ROOT; 2125d4f98a2SYan Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2135d4f98a2SYan Zheng INIT_LIST_HEAD(&cache->pending[i]); 2143fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->changed); 2153fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->detached); 2163fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->leaves); 2175d4f98a2SYan Zheng } 2185d4f98a2SYan Zheng 2193fd0a558SYan, Zheng static void backref_cache_cleanup(struct backref_cache *cache) 2205d4f98a2SYan Zheng { 2213fd0a558SYan, Zheng struct backref_node *node; 2223fd0a558SYan, Zheng int i; 2233fd0a558SYan, Zheng 2243fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2253fd0a558SYan, Zheng node = list_entry(cache->detached.next, 2263fd0a558SYan, Zheng struct backref_node, list); 2273fd0a558SYan, Zheng remove_backref_node(cache, node); 2283fd0a558SYan, Zheng } 2293fd0a558SYan, Zheng 2303fd0a558SYan, Zheng while (!list_empty(&cache->leaves)) { 2313fd0a558SYan, Zheng node = list_entry(cache->leaves.next, 2323fd0a558SYan, Zheng struct backref_node, lower); 2333fd0a558SYan, Zheng remove_backref_node(cache, node); 2343fd0a558SYan, Zheng } 2353fd0a558SYan, Zheng 2363fd0a558SYan, Zheng cache->last_trans = 0; 2373fd0a558SYan, Zheng 2383fd0a558SYan, Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 239f4907095SLiu Bo ASSERT(list_empty(&cache->pending[i])); 240f4907095SLiu Bo ASSERT(list_empty(&cache->changed)); 241f4907095SLiu Bo ASSERT(list_empty(&cache->detached)); 242f4907095SLiu Bo ASSERT(RB_EMPTY_ROOT(&cache->rb_root)); 243f4907095SLiu Bo ASSERT(!cache->nr_nodes); 244f4907095SLiu Bo ASSERT(!cache->nr_edges); 2453fd0a558SYan, Zheng } 2463fd0a558SYan, Zheng 2473fd0a558SYan, Zheng static struct backref_node *alloc_backref_node(struct backref_cache *cache) 2483fd0a558SYan, Zheng { 2493fd0a558SYan, Zheng struct backref_node *node; 2503fd0a558SYan, Zheng 2513fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 2523fd0a558SYan, Zheng if (node) { 2533fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 2545d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 2555d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 2565d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 2573fd0a558SYan, Zheng cache->nr_nodes++; 2583fd0a558SYan, Zheng } 2593fd0a558SYan, Zheng return node; 2603fd0a558SYan, Zheng } 2613fd0a558SYan, Zheng 2623fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 2633fd0a558SYan, Zheng struct backref_node *node) 2643fd0a558SYan, Zheng { 2653fd0a558SYan, Zheng if (node) { 2663fd0a558SYan, Zheng cache->nr_nodes--; 2673fd0a558SYan, Zheng kfree(node); 2683fd0a558SYan, Zheng } 2693fd0a558SYan, Zheng } 2703fd0a558SYan, Zheng 2713fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 2723fd0a558SYan, Zheng { 2733fd0a558SYan, Zheng struct backref_edge *edge; 2743fd0a558SYan, Zheng 2753fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 2763fd0a558SYan, Zheng if (edge) 2773fd0a558SYan, Zheng cache->nr_edges++; 2783fd0a558SYan, Zheng return edge; 2793fd0a558SYan, Zheng } 2803fd0a558SYan, Zheng 2813fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 2823fd0a558SYan, Zheng struct backref_edge *edge) 2833fd0a558SYan, Zheng { 2843fd0a558SYan, Zheng if (edge) { 2853fd0a558SYan, Zheng cache->nr_edges--; 2863fd0a558SYan, Zheng kfree(edge); 2873fd0a558SYan, Zheng } 2885d4f98a2SYan Zheng } 2895d4f98a2SYan Zheng 2905d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 2915d4f98a2SYan Zheng struct rb_node *node) 2925d4f98a2SYan Zheng { 2935d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 2945d4f98a2SYan Zheng struct rb_node *parent = NULL; 2955d4f98a2SYan Zheng struct tree_entry *entry; 2965d4f98a2SYan Zheng 2975d4f98a2SYan Zheng while (*p) { 2985d4f98a2SYan Zheng parent = *p; 2995d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 3005d4f98a2SYan Zheng 3015d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3025d4f98a2SYan Zheng p = &(*p)->rb_left; 3035d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3045d4f98a2SYan Zheng p = &(*p)->rb_right; 3055d4f98a2SYan Zheng else 3065d4f98a2SYan Zheng return parent; 3075d4f98a2SYan Zheng } 3085d4f98a2SYan Zheng 3095d4f98a2SYan Zheng rb_link_node(node, parent, p); 3105d4f98a2SYan Zheng rb_insert_color(node, root); 3115d4f98a2SYan Zheng return NULL; 3125d4f98a2SYan Zheng } 3135d4f98a2SYan Zheng 3145d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 3155d4f98a2SYan Zheng { 3165d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 3175d4f98a2SYan Zheng struct tree_entry *entry; 3185d4f98a2SYan Zheng 3195d4f98a2SYan Zheng while (n) { 3205d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 3215d4f98a2SYan Zheng 3225d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3235d4f98a2SYan Zheng n = n->rb_left; 3245d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3255d4f98a2SYan Zheng n = n->rb_right; 3265d4f98a2SYan Zheng else 3275d4f98a2SYan Zheng return n; 3285d4f98a2SYan Zheng } 3295d4f98a2SYan Zheng return NULL; 3305d4f98a2SYan Zheng } 3315d4f98a2SYan Zheng 33248a3b636SEric Sandeen static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) 33343c04fb1SJeff Mahoney { 33443c04fb1SJeff Mahoney 33543c04fb1SJeff Mahoney struct btrfs_fs_info *fs_info = NULL; 33643c04fb1SJeff Mahoney struct backref_node *bnode = rb_entry(rb_node, struct backref_node, 33743c04fb1SJeff Mahoney rb_node); 33843c04fb1SJeff Mahoney if (bnode->root) 33943c04fb1SJeff Mahoney fs_info = bnode->root->fs_info; 3405d163e0eSJeff Mahoney btrfs_panic(fs_info, errno, 3415d163e0eSJeff Mahoney "Inconsistency in backref cache found at offset %llu", 3425d163e0eSJeff Mahoney bytenr); 34343c04fb1SJeff Mahoney } 34443c04fb1SJeff Mahoney 3455d4f98a2SYan Zheng /* 3465d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 3475d4f98a2SYan Zheng */ 3485d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 3495d4f98a2SYan Zheng struct backref_edge *edges[], 3505d4f98a2SYan Zheng int *index) 3515d4f98a2SYan Zheng { 3525d4f98a2SYan Zheng struct backref_edge *edge; 3535d4f98a2SYan Zheng int idx = *index; 3545d4f98a2SYan Zheng 3555d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 3565d4f98a2SYan Zheng edge = list_entry(node->upper.next, 3575d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3585d4f98a2SYan Zheng edges[idx++] = edge; 3595d4f98a2SYan Zheng node = edge->node[UPPER]; 3605d4f98a2SYan Zheng } 3613fd0a558SYan, Zheng BUG_ON(node->detached); 3625d4f98a2SYan Zheng *index = idx; 3635d4f98a2SYan Zheng return node; 3645d4f98a2SYan Zheng } 3655d4f98a2SYan Zheng 3665d4f98a2SYan Zheng /* 3675d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 3685d4f98a2SYan Zheng */ 3695d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 3705d4f98a2SYan Zheng int *index) 3715d4f98a2SYan Zheng { 3725d4f98a2SYan Zheng struct backref_edge *edge; 3735d4f98a2SYan Zheng struct backref_node *lower; 3745d4f98a2SYan Zheng int idx = *index; 3755d4f98a2SYan Zheng 3765d4f98a2SYan Zheng while (idx > 0) { 3775d4f98a2SYan Zheng edge = edges[idx - 1]; 3785d4f98a2SYan Zheng lower = edge->node[LOWER]; 3795d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 3805d4f98a2SYan Zheng idx--; 3815d4f98a2SYan Zheng continue; 3825d4f98a2SYan Zheng } 3835d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 3845d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3855d4f98a2SYan Zheng edges[idx - 1] = edge; 3865d4f98a2SYan Zheng *index = idx; 3875d4f98a2SYan Zheng return edge->node[UPPER]; 3885d4f98a2SYan Zheng } 3895d4f98a2SYan Zheng *index = 0; 3905d4f98a2SYan Zheng return NULL; 3915d4f98a2SYan Zheng } 3925d4f98a2SYan Zheng 3933fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 3945d4f98a2SYan Zheng { 3955d4f98a2SYan Zheng if (node->locked) { 3965d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 3975d4f98a2SYan Zheng node->locked = 0; 3985d4f98a2SYan Zheng } 3993fd0a558SYan, Zheng } 4003fd0a558SYan, Zheng 4013fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 4023fd0a558SYan, Zheng { 4033fd0a558SYan, Zheng if (node->eb) { 4043fd0a558SYan, Zheng unlock_node_buffer(node); 4055d4f98a2SYan Zheng free_extent_buffer(node->eb); 4065d4f98a2SYan Zheng node->eb = NULL; 4075d4f98a2SYan Zheng } 4085d4f98a2SYan Zheng } 4095d4f98a2SYan Zheng 4105d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 4115d4f98a2SYan Zheng struct backref_node *node) 4125d4f98a2SYan Zheng { 4135d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 4145d4f98a2SYan Zheng 4155d4f98a2SYan Zheng drop_node_buffer(node); 4163fd0a558SYan, Zheng list_del(&node->list); 4175d4f98a2SYan Zheng list_del(&node->lower); 4183fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 4195d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 4203fd0a558SYan, Zheng free_backref_node(tree, node); 4215d4f98a2SYan Zheng } 4225d4f98a2SYan Zheng 4235d4f98a2SYan Zheng /* 4245d4f98a2SYan Zheng * remove a backref node from the backref cache 4255d4f98a2SYan Zheng */ 4265d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 4275d4f98a2SYan Zheng struct backref_node *node) 4285d4f98a2SYan Zheng { 4295d4f98a2SYan Zheng struct backref_node *upper; 4305d4f98a2SYan Zheng struct backref_edge *edge; 4315d4f98a2SYan Zheng 4325d4f98a2SYan Zheng if (!node) 4335d4f98a2SYan Zheng return; 4345d4f98a2SYan Zheng 4353fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 4365d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4375d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 4385d4f98a2SYan Zheng list[LOWER]); 4395d4f98a2SYan Zheng upper = edge->node[UPPER]; 4405d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 4415d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 4423fd0a558SYan, Zheng free_backref_edge(cache, edge); 4433fd0a558SYan, Zheng 4443fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 4453fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 4463fd0a558SYan, Zheng drop_backref_node(cache, node); 4473fd0a558SYan, Zheng node = upper; 4483fd0a558SYan, Zheng node->lowest = 1; 4493fd0a558SYan, Zheng continue; 4503fd0a558SYan, Zheng } 4515d4f98a2SYan Zheng /* 4523fd0a558SYan, Zheng * add the node to leaf node list if no other 4535d4f98a2SYan Zheng * child block cached. 4545d4f98a2SYan Zheng */ 4555d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 4563fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 4575d4f98a2SYan Zheng upper->lowest = 1; 4585d4f98a2SYan Zheng } 4595d4f98a2SYan Zheng } 4603fd0a558SYan, Zheng 4615d4f98a2SYan Zheng drop_backref_node(cache, node); 4625d4f98a2SYan Zheng } 4635d4f98a2SYan Zheng 4643fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 4653fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 4663fd0a558SYan, Zheng { 4673fd0a558SYan, Zheng struct rb_node *rb_node; 4683fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 4693fd0a558SYan, Zheng node->bytenr = bytenr; 4703fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 47143c04fb1SJeff Mahoney if (rb_node) 47243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, bytenr); 4733fd0a558SYan, Zheng } 4743fd0a558SYan, Zheng 4753fd0a558SYan, Zheng /* 4763fd0a558SYan, Zheng * update backref cache after a transaction commit 4773fd0a558SYan, Zheng */ 4783fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 4793fd0a558SYan, Zheng struct backref_cache *cache) 4803fd0a558SYan, Zheng { 4813fd0a558SYan, Zheng struct backref_node *node; 4823fd0a558SYan, Zheng int level = 0; 4833fd0a558SYan, Zheng 4843fd0a558SYan, Zheng if (cache->last_trans == 0) { 4853fd0a558SYan, Zheng cache->last_trans = trans->transid; 4863fd0a558SYan, Zheng return 0; 4873fd0a558SYan, Zheng } 4883fd0a558SYan, Zheng 4893fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 4903fd0a558SYan, Zheng return 0; 4913fd0a558SYan, Zheng 4923fd0a558SYan, Zheng /* 4933fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 4943fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 4953fd0a558SYan, Zheng * so the detached nodes are no longer useful. 4963fd0a558SYan, Zheng */ 4973fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 4983fd0a558SYan, Zheng node = list_entry(cache->detached.next, 4993fd0a558SYan, Zheng struct backref_node, list); 5003fd0a558SYan, Zheng remove_backref_node(cache, node); 5013fd0a558SYan, Zheng } 5023fd0a558SYan, Zheng 5033fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 5043fd0a558SYan, Zheng node = list_entry(cache->changed.next, 5053fd0a558SYan, Zheng struct backref_node, list); 5063fd0a558SYan, Zheng list_del_init(&node->list); 5073fd0a558SYan, Zheng BUG_ON(node->pending); 5083fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5093fd0a558SYan, Zheng } 5103fd0a558SYan, Zheng 5113fd0a558SYan, Zheng /* 5123fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 5133fd0a558SYan, Zheng * errors during processing the pending nodes. 5143fd0a558SYan, Zheng */ 5153fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 5163fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 5173fd0a558SYan, Zheng BUG_ON(!node->pending); 5183fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 5193fd0a558SYan, Zheng continue; 5203fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5213fd0a558SYan, Zheng } 5223fd0a558SYan, Zheng } 5233fd0a558SYan, Zheng 5243fd0a558SYan, Zheng cache->last_trans = 0; 5253fd0a558SYan, Zheng return 1; 5263fd0a558SYan, Zheng } 5273fd0a558SYan, Zheng 528f2a97a9dSDavid Sterba 5293fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 5303fd0a558SYan, Zheng { 5313fd0a558SYan, Zheng struct btrfs_root *reloc_root; 5323fd0a558SYan, Zheng 53327cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 5343fd0a558SYan, Zheng return 0; 5353fd0a558SYan, Zheng 5363fd0a558SYan, Zheng reloc_root = root->reloc_root; 5373fd0a558SYan, Zheng if (!reloc_root) 5383fd0a558SYan, Zheng return 0; 5393fd0a558SYan, Zheng 5403fd0a558SYan, Zheng if (btrfs_root_last_snapshot(&reloc_root->root_item) == 5413fd0a558SYan, Zheng root->fs_info->running_transaction->transid - 1) 5423fd0a558SYan, Zheng return 0; 5433fd0a558SYan, Zheng /* 5443fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 5453fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 5463fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 5473fd0a558SYan, Zheng * relocation. 5483fd0a558SYan, Zheng */ 5493fd0a558SYan, Zheng return 1; 5503fd0a558SYan, Zheng } 5515d4f98a2SYan Zheng /* 5525d4f98a2SYan Zheng * find reloc tree by address of tree root 5535d4f98a2SYan Zheng */ 5545d4f98a2SYan Zheng static struct btrfs_root *find_reloc_root(struct reloc_control *rc, 5555d4f98a2SYan Zheng u64 bytenr) 5565d4f98a2SYan Zheng { 5575d4f98a2SYan Zheng struct rb_node *rb_node; 5585d4f98a2SYan Zheng struct mapping_node *node; 5595d4f98a2SYan Zheng struct btrfs_root *root = NULL; 5605d4f98a2SYan Zheng 5615d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 5625d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 5635d4f98a2SYan Zheng if (rb_node) { 5645d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 5655d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 5665d4f98a2SYan Zheng } 5675d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 5685d4f98a2SYan Zheng return root; 5695d4f98a2SYan Zheng } 5705d4f98a2SYan Zheng 5715d4f98a2SYan Zheng static int is_cowonly_root(u64 root_objectid) 5725d4f98a2SYan Zheng { 5735d4f98a2SYan Zheng if (root_objectid == BTRFS_ROOT_TREE_OBJECTID || 5745d4f98a2SYan Zheng root_objectid == BTRFS_EXTENT_TREE_OBJECTID || 5755d4f98a2SYan Zheng root_objectid == BTRFS_CHUNK_TREE_OBJECTID || 5765d4f98a2SYan Zheng root_objectid == BTRFS_DEV_TREE_OBJECTID || 5775d4f98a2SYan Zheng root_objectid == BTRFS_TREE_LOG_OBJECTID || 57866463748SWang Shilong root_objectid == BTRFS_CSUM_TREE_OBJECTID || 57966463748SWang Shilong root_objectid == BTRFS_UUID_TREE_OBJECTID || 5803e4c5efbSDavid Sterba root_objectid == BTRFS_QUOTA_TREE_OBJECTID || 5813e4c5efbSDavid Sterba root_objectid == BTRFS_FREE_SPACE_TREE_OBJECTID) 5825d4f98a2SYan Zheng return 1; 5835d4f98a2SYan Zheng return 0; 5845d4f98a2SYan Zheng } 5855d4f98a2SYan Zheng 5865d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 5875d4f98a2SYan Zheng u64 root_objectid) 5885d4f98a2SYan Zheng { 5895d4f98a2SYan Zheng struct btrfs_key key; 5905d4f98a2SYan Zheng 5915d4f98a2SYan Zheng key.objectid = root_objectid; 5925d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 5935d4f98a2SYan Zheng if (is_cowonly_root(root_objectid)) 5945d4f98a2SYan Zheng key.offset = 0; 5955d4f98a2SYan Zheng else 5965d4f98a2SYan Zheng key.offset = (u64)-1; 5975d4f98a2SYan Zheng 598c00869f1SMiao Xie return btrfs_get_fs_root(fs_info, &key, false); 5995d4f98a2SYan Zheng } 6005d4f98a2SYan Zheng 6015d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 6025d4f98a2SYan Zheng static noinline_for_stack 6035d4f98a2SYan Zheng struct btrfs_root *find_tree_root(struct reloc_control *rc, 6045d4f98a2SYan Zheng struct extent_buffer *leaf, 6055d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0) 6065d4f98a2SYan Zheng { 6075d4f98a2SYan Zheng struct btrfs_root *root; 6085d4f98a2SYan Zheng u64 root_objectid = btrfs_ref_root_v0(leaf, ref0); 6095d4f98a2SYan Zheng u64 generation = btrfs_ref_generation_v0(leaf, ref0); 6105d4f98a2SYan Zheng 6115d4f98a2SYan Zheng BUG_ON(root_objectid == BTRFS_TREE_RELOC_OBJECTID); 6125d4f98a2SYan Zheng 6135d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, root_objectid); 6145d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 6155d4f98a2SYan Zheng 61627cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state) && 6175d4f98a2SYan Zheng generation != btrfs_root_generation(&root->root_item)) 6185d4f98a2SYan Zheng return NULL; 6195d4f98a2SYan Zheng 6205d4f98a2SYan Zheng return root; 6215d4f98a2SYan Zheng } 6225d4f98a2SYan Zheng #endif 6235d4f98a2SYan Zheng 6245d4f98a2SYan Zheng static noinline_for_stack 6255d4f98a2SYan Zheng int find_inline_backref(struct extent_buffer *leaf, int slot, 6265d4f98a2SYan Zheng unsigned long *ptr, unsigned long *end) 6275d4f98a2SYan Zheng { 6283173a18fSJosef Bacik struct btrfs_key key; 6295d4f98a2SYan Zheng struct btrfs_extent_item *ei; 6305d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 6315d4f98a2SYan Zheng u32 item_size; 6325d4f98a2SYan Zheng 6333173a18fSJosef Bacik btrfs_item_key_to_cpu(leaf, &key, slot); 6343173a18fSJosef Bacik 6355d4f98a2SYan Zheng item_size = btrfs_item_size_nr(leaf, slot); 6365d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 6375d4f98a2SYan Zheng if (item_size < sizeof(*ei)) { 6385d4f98a2SYan Zheng WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0)); 6395d4f98a2SYan Zheng return 1; 6405d4f98a2SYan Zheng } 6415d4f98a2SYan Zheng #endif 6425d4f98a2SYan Zheng ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); 6435d4f98a2SYan Zheng WARN_ON(!(btrfs_extent_flags(leaf, ei) & 6445d4f98a2SYan Zheng BTRFS_EXTENT_FLAG_TREE_BLOCK)); 6455d4f98a2SYan Zheng 6463173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 6473173a18fSJosef Bacik item_size <= sizeof(*ei) + sizeof(*bi)) { 6485d4f98a2SYan Zheng WARN_ON(item_size < sizeof(*ei) + sizeof(*bi)); 6495d4f98a2SYan Zheng return 1; 6505d4f98a2SYan Zheng } 651d062d13cSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 652d062d13cSJosef Bacik item_size <= sizeof(*ei)) { 653d062d13cSJosef Bacik WARN_ON(item_size < sizeof(*ei)); 654d062d13cSJosef Bacik return 1; 655d062d13cSJosef Bacik } 6565d4f98a2SYan Zheng 6573173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) { 6585d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 6595d4f98a2SYan Zheng *ptr = (unsigned long)(bi + 1); 6603173a18fSJosef Bacik } else { 6613173a18fSJosef Bacik *ptr = (unsigned long)(ei + 1); 6623173a18fSJosef Bacik } 6635d4f98a2SYan Zheng *end = (unsigned long)ei + item_size; 6645d4f98a2SYan Zheng return 0; 6655d4f98a2SYan Zheng } 6665d4f98a2SYan Zheng 6675d4f98a2SYan Zheng /* 6685d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 6695d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 6705d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 6715d4f98a2SYan Zheng * 6725d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 67301327610SNicholas D Steeves * to find upper level blocks that reference the block, and then check 67401327610SNicholas D Steeves * backrefs of these upper level blocks recursively. the recursion stop 6755d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 6765d4f98a2SYan Zheng * 6775d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 6785d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 6795d4f98a2SYan Zheng * block are also cached. 6805d4f98a2SYan Zheng */ 6813fd0a558SYan, Zheng static noinline_for_stack 6823fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 6835d4f98a2SYan Zheng struct btrfs_key *node_key, 6845d4f98a2SYan Zheng int level, u64 bytenr) 6855d4f98a2SYan Zheng { 6863fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 6875d4f98a2SYan Zheng struct btrfs_path *path1; 6885d4f98a2SYan Zheng struct btrfs_path *path2; 6895d4f98a2SYan Zheng struct extent_buffer *eb; 6905d4f98a2SYan Zheng struct btrfs_root *root; 6915d4f98a2SYan Zheng struct backref_node *cur; 6925d4f98a2SYan Zheng struct backref_node *upper; 6935d4f98a2SYan Zheng struct backref_node *lower; 6945d4f98a2SYan Zheng struct backref_node *node = NULL; 6955d4f98a2SYan Zheng struct backref_node *exist = NULL; 6965d4f98a2SYan Zheng struct backref_edge *edge; 6975d4f98a2SYan Zheng struct rb_node *rb_node; 6985d4f98a2SYan Zheng struct btrfs_key key; 6995d4f98a2SYan Zheng unsigned long end; 7005d4f98a2SYan Zheng unsigned long ptr; 7015d4f98a2SYan Zheng LIST_HEAD(list); 7023fd0a558SYan, Zheng LIST_HEAD(useless); 7033fd0a558SYan, Zheng int cowonly; 7045d4f98a2SYan Zheng int ret; 7055d4f98a2SYan Zheng int err = 0; 706b6c60c80SJosef Bacik bool need_check = true; 7075d4f98a2SYan Zheng 7085d4f98a2SYan Zheng path1 = btrfs_alloc_path(); 7095d4f98a2SYan Zheng path2 = btrfs_alloc_path(); 7105d4f98a2SYan Zheng if (!path1 || !path2) { 7115d4f98a2SYan Zheng err = -ENOMEM; 7125d4f98a2SYan Zheng goto out; 7135d4f98a2SYan Zheng } 714e4058b54SDavid Sterba path1->reada = READA_FORWARD; 715e4058b54SDavid Sterba path2->reada = READA_FORWARD; 7165d4f98a2SYan Zheng 7173fd0a558SYan, Zheng node = alloc_backref_node(cache); 7185d4f98a2SYan Zheng if (!node) { 7195d4f98a2SYan Zheng err = -ENOMEM; 7205d4f98a2SYan Zheng goto out; 7215d4f98a2SYan Zheng } 7225d4f98a2SYan Zheng 7235d4f98a2SYan Zheng node->bytenr = bytenr; 7245d4f98a2SYan Zheng node->level = level; 7255d4f98a2SYan Zheng node->lowest = 1; 7265d4f98a2SYan Zheng cur = node; 7275d4f98a2SYan Zheng again: 7285d4f98a2SYan Zheng end = 0; 7295d4f98a2SYan Zheng ptr = 0; 7305d4f98a2SYan Zheng key.objectid = cur->bytenr; 7313173a18fSJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 7325d4f98a2SYan Zheng key.offset = (u64)-1; 7335d4f98a2SYan Zheng 7345d4f98a2SYan Zheng path1->search_commit_root = 1; 7355d4f98a2SYan Zheng path1->skip_locking = 1; 7365d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1, 7375d4f98a2SYan Zheng 0, 0); 7385d4f98a2SYan Zheng if (ret < 0) { 7395d4f98a2SYan Zheng err = ret; 7405d4f98a2SYan Zheng goto out; 7415d4f98a2SYan Zheng } 74275bfb9afSJosef Bacik ASSERT(ret); 74375bfb9afSJosef Bacik ASSERT(path1->slots[0]); 7445d4f98a2SYan Zheng 7455d4f98a2SYan Zheng path1->slots[0]--; 7465d4f98a2SYan Zheng 7475d4f98a2SYan Zheng WARN_ON(cur->checked); 7485d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 7495d4f98a2SYan Zheng /* 75070f23fd6SJustin P. Mattock * the backref was added previously when processing 7515d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 7525d4f98a2SYan Zheng */ 75375bfb9afSJosef Bacik ASSERT(list_is_singular(&cur->upper)); 7545d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 7555d4f98a2SYan Zheng list[LOWER]); 75675bfb9afSJosef Bacik ASSERT(list_empty(&edge->list[UPPER])); 7575d4f98a2SYan Zheng exist = edge->node[UPPER]; 7585d4f98a2SYan Zheng /* 7595d4f98a2SYan Zheng * add the upper level block to pending list if we need 7605d4f98a2SYan Zheng * check its backrefs 7615d4f98a2SYan Zheng */ 7625d4f98a2SYan Zheng if (!exist->checked) 7635d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 7645d4f98a2SYan Zheng } else { 7655d4f98a2SYan Zheng exist = NULL; 7665d4f98a2SYan Zheng } 7675d4f98a2SYan Zheng 7685d4f98a2SYan Zheng while (1) { 7695d4f98a2SYan Zheng cond_resched(); 7705d4f98a2SYan Zheng eb = path1->nodes[0]; 7715d4f98a2SYan Zheng 7725d4f98a2SYan Zheng if (ptr >= end) { 7735d4f98a2SYan Zheng if (path1->slots[0] >= btrfs_header_nritems(eb)) { 7745d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path1); 7755d4f98a2SYan Zheng if (ret < 0) { 7765d4f98a2SYan Zheng err = ret; 7775d4f98a2SYan Zheng goto out; 7785d4f98a2SYan Zheng } 7795d4f98a2SYan Zheng if (ret > 0) 7805d4f98a2SYan Zheng break; 7815d4f98a2SYan Zheng eb = path1->nodes[0]; 7825d4f98a2SYan Zheng } 7835d4f98a2SYan Zheng 7845d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path1->slots[0]); 7855d4f98a2SYan Zheng if (key.objectid != cur->bytenr) { 7865d4f98a2SYan Zheng WARN_ON(exist); 7875d4f98a2SYan Zheng break; 7885d4f98a2SYan Zheng } 7895d4f98a2SYan Zheng 7903173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY || 7913173a18fSJosef Bacik key.type == BTRFS_METADATA_ITEM_KEY) { 7925d4f98a2SYan Zheng ret = find_inline_backref(eb, path1->slots[0], 7935d4f98a2SYan Zheng &ptr, &end); 7945d4f98a2SYan Zheng if (ret) 7955d4f98a2SYan Zheng goto next; 7965d4f98a2SYan Zheng } 7975d4f98a2SYan Zheng } 7985d4f98a2SYan Zheng 7995d4f98a2SYan Zheng if (ptr < end) { 8005d4f98a2SYan Zheng /* update key for inline back ref */ 8015d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 8025d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 8035d4f98a2SYan Zheng key.type = btrfs_extent_inline_ref_type(eb, iref); 8045d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 8055d4f98a2SYan Zheng WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY && 8065d4f98a2SYan Zheng key.type != BTRFS_SHARED_BLOCK_REF_KEY); 8075d4f98a2SYan Zheng } 8085d4f98a2SYan Zheng 8095d4f98a2SYan Zheng if (exist && 8105d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 8115d4f98a2SYan Zheng exist->owner == key.offset) || 8125d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 8135d4f98a2SYan Zheng exist->bytenr == key.offset))) { 8145d4f98a2SYan Zheng exist = NULL; 8155d4f98a2SYan Zheng goto next; 8165d4f98a2SYan Zheng } 8175d4f98a2SYan Zheng 8185d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 8195d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY || 8205d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 8213fd0a558SYan, Zheng if (key.type == BTRFS_EXTENT_REF_V0_KEY) { 8225d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 8235d4f98a2SYan Zheng ref0 = btrfs_item_ptr(eb, path1->slots[0], 8245d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 8253fd0a558SYan, Zheng if (key.objectid == key.offset) { 826046f264fSYan, Zheng root = find_tree_root(rc, eb, ref0); 8273fd0a558SYan, Zheng if (root && !should_ignore_root(root)) 8285d4f98a2SYan Zheng cur->root = root; 8295d4f98a2SYan Zheng else 8303fd0a558SYan, Zheng list_add(&cur->list, &useless); 8315d4f98a2SYan Zheng break; 8325d4f98a2SYan Zheng } 833046f264fSYan, Zheng if (is_cowonly_root(btrfs_ref_root_v0(eb, 834046f264fSYan, Zheng ref0))) 835046f264fSYan, Zheng cur->cowonly = 1; 8363fd0a558SYan, Zheng } 8375d4f98a2SYan Zheng #else 83875bfb9afSJosef Bacik ASSERT(key.type != BTRFS_EXTENT_REF_V0_KEY); 8395d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 8405d4f98a2SYan Zheng #endif 8415d4f98a2SYan Zheng if (key.objectid == key.offset) { 8425d4f98a2SYan Zheng /* 8435d4f98a2SYan Zheng * only root blocks of reloc trees use 8445d4f98a2SYan Zheng * backref of this type. 8455d4f98a2SYan Zheng */ 8465d4f98a2SYan Zheng root = find_reloc_root(rc, cur->bytenr); 84775bfb9afSJosef Bacik ASSERT(root); 8485d4f98a2SYan Zheng cur->root = root; 8495d4f98a2SYan Zheng break; 8505d4f98a2SYan Zheng } 8515d4f98a2SYan Zheng 8523fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 8535d4f98a2SYan Zheng if (!edge) { 8545d4f98a2SYan Zheng err = -ENOMEM; 8555d4f98a2SYan Zheng goto out; 8565d4f98a2SYan Zheng } 8575d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, key.offset); 8585d4f98a2SYan Zheng if (!rb_node) { 8593fd0a558SYan, Zheng upper = alloc_backref_node(cache); 8605d4f98a2SYan Zheng if (!upper) { 8613fd0a558SYan, Zheng free_backref_edge(cache, edge); 8625d4f98a2SYan Zheng err = -ENOMEM; 8635d4f98a2SYan Zheng goto out; 8645d4f98a2SYan Zheng } 8655d4f98a2SYan Zheng upper->bytenr = key.offset; 8665d4f98a2SYan Zheng upper->level = cur->level + 1; 8675d4f98a2SYan Zheng /* 8685d4f98a2SYan Zheng * backrefs for the upper level block isn't 8695d4f98a2SYan Zheng * cached, add the block to pending list 8705d4f98a2SYan Zheng */ 8715d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 8725d4f98a2SYan Zheng } else { 8735d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 8745d4f98a2SYan Zheng rb_node); 87575bfb9afSJosef Bacik ASSERT(upper->checked); 8765d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 8775d4f98a2SYan Zheng } 8783fd0a558SYan, Zheng list_add_tail(&edge->list[LOWER], &cur->upper); 8795d4f98a2SYan Zheng edge->node[LOWER] = cur; 8803fd0a558SYan, Zheng edge->node[UPPER] = upper; 8815d4f98a2SYan Zheng 8825d4f98a2SYan Zheng goto next; 8835d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 8845d4f98a2SYan Zheng goto next; 8855d4f98a2SYan Zheng } 8865d4f98a2SYan Zheng 8875d4f98a2SYan Zheng /* key.type == BTRFS_TREE_BLOCK_REF_KEY */ 8885d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, key.offset); 8895d4f98a2SYan Zheng if (IS_ERR(root)) { 8905d4f98a2SYan Zheng err = PTR_ERR(root); 8915d4f98a2SYan Zheng goto out; 8925d4f98a2SYan Zheng } 8935d4f98a2SYan Zheng 89427cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 8953fd0a558SYan, Zheng cur->cowonly = 1; 8963fd0a558SYan, Zheng 8975d4f98a2SYan Zheng if (btrfs_root_level(&root->root_item) == cur->level) { 8985d4f98a2SYan Zheng /* tree root */ 89975bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 9005d4f98a2SYan Zheng cur->bytenr); 9013fd0a558SYan, Zheng if (should_ignore_root(root)) 9023fd0a558SYan, Zheng list_add(&cur->list, &useless); 9033fd0a558SYan, Zheng else 9045d4f98a2SYan Zheng cur->root = root; 9055d4f98a2SYan Zheng break; 9065d4f98a2SYan Zheng } 9075d4f98a2SYan Zheng 9085d4f98a2SYan Zheng level = cur->level + 1; 9095d4f98a2SYan Zheng 9105d4f98a2SYan Zheng /* 9115d4f98a2SYan Zheng * searching the tree to find upper level blocks 9125d4f98a2SYan Zheng * reference the block. 9135d4f98a2SYan Zheng */ 9145d4f98a2SYan Zheng path2->search_commit_root = 1; 9155d4f98a2SYan Zheng path2->skip_locking = 1; 9165d4f98a2SYan Zheng path2->lowest_level = level; 9175d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0); 9185d4f98a2SYan Zheng path2->lowest_level = 0; 9195d4f98a2SYan Zheng if (ret < 0) { 9205d4f98a2SYan Zheng err = ret; 9215d4f98a2SYan Zheng goto out; 9225d4f98a2SYan Zheng } 92333c66f43SYan Zheng if (ret > 0 && path2->slots[level] > 0) 92433c66f43SYan Zheng path2->slots[level]--; 9255d4f98a2SYan Zheng 9265d4f98a2SYan Zheng eb = path2->nodes[level]; 9273561b9dbSLiu Bo if (btrfs_node_blockptr(eb, path2->slots[level]) != 9283561b9dbSLiu Bo cur->bytenr) { 9293561b9dbSLiu Bo btrfs_err(root->fs_info, 9303561b9dbSLiu Bo "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)", 9313561b9dbSLiu Bo cur->bytenr, level - 1, root->objectid, 9323561b9dbSLiu Bo node_key->objectid, node_key->type, 9333561b9dbSLiu Bo node_key->offset); 9343561b9dbSLiu Bo err = -ENOENT; 9353561b9dbSLiu Bo goto out; 9363561b9dbSLiu Bo } 9375d4f98a2SYan Zheng lower = cur; 938b6c60c80SJosef Bacik need_check = true; 9395d4f98a2SYan Zheng for (; level < BTRFS_MAX_LEVEL; level++) { 9405d4f98a2SYan Zheng if (!path2->nodes[level]) { 94175bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 9425d4f98a2SYan Zheng lower->bytenr); 9433fd0a558SYan, Zheng if (should_ignore_root(root)) 9443fd0a558SYan, Zheng list_add(&lower->list, &useless); 9453fd0a558SYan, Zheng else 9465d4f98a2SYan Zheng lower->root = root; 9475d4f98a2SYan Zheng break; 9485d4f98a2SYan Zheng } 9495d4f98a2SYan Zheng 9503fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 9515d4f98a2SYan Zheng if (!edge) { 9525d4f98a2SYan Zheng err = -ENOMEM; 9535d4f98a2SYan Zheng goto out; 9545d4f98a2SYan Zheng } 9555d4f98a2SYan Zheng 9565d4f98a2SYan Zheng eb = path2->nodes[level]; 9575d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, eb->start); 9585d4f98a2SYan Zheng if (!rb_node) { 9593fd0a558SYan, Zheng upper = alloc_backref_node(cache); 9605d4f98a2SYan Zheng if (!upper) { 9613fd0a558SYan, Zheng free_backref_edge(cache, edge); 9625d4f98a2SYan Zheng err = -ENOMEM; 9635d4f98a2SYan Zheng goto out; 9645d4f98a2SYan Zheng } 9655d4f98a2SYan Zheng upper->bytenr = eb->start; 9665d4f98a2SYan Zheng upper->owner = btrfs_header_owner(eb); 9675d4f98a2SYan Zheng upper->level = lower->level + 1; 96827cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, 96927cdeb70SMiao Xie &root->state)) 9703fd0a558SYan, Zheng upper->cowonly = 1; 9715d4f98a2SYan Zheng 9725d4f98a2SYan Zheng /* 9735d4f98a2SYan Zheng * if we know the block isn't shared 9745d4f98a2SYan Zheng * we can void checking its backrefs. 9755d4f98a2SYan Zheng */ 9765d4f98a2SYan Zheng if (btrfs_block_can_be_shared(root, eb)) 9775d4f98a2SYan Zheng upper->checked = 0; 9785d4f98a2SYan Zheng else 9795d4f98a2SYan Zheng upper->checked = 1; 9805d4f98a2SYan Zheng 9815d4f98a2SYan Zheng /* 9825d4f98a2SYan Zheng * add the block to pending list if we 983b6c60c80SJosef Bacik * need check its backrefs, we only do this once 984b6c60c80SJosef Bacik * while walking up a tree as we will catch 985b6c60c80SJosef Bacik * anything else later on. 9865d4f98a2SYan Zheng */ 987b6c60c80SJosef Bacik if (!upper->checked && need_check) { 988b6c60c80SJosef Bacik need_check = false; 9895d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], 9905d4f98a2SYan Zheng &list); 991bbe90514SJosef Bacik } else { 992bbe90514SJosef Bacik if (upper->checked) 993bbe90514SJosef Bacik need_check = true; 9945d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 995bbe90514SJosef Bacik } 9965d4f98a2SYan Zheng } else { 9975d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 9985d4f98a2SYan Zheng rb_node); 99975bfb9afSJosef Bacik ASSERT(upper->checked); 10005d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 10013fd0a558SYan, Zheng if (!upper->owner) 10023fd0a558SYan, Zheng upper->owner = btrfs_header_owner(eb); 10035d4f98a2SYan Zheng } 10045d4f98a2SYan Zheng list_add_tail(&edge->list[LOWER], &lower->upper); 10055d4f98a2SYan Zheng edge->node[LOWER] = lower; 10063fd0a558SYan, Zheng edge->node[UPPER] = upper; 10075d4f98a2SYan Zheng 10085d4f98a2SYan Zheng if (rb_node) 10095d4f98a2SYan Zheng break; 10105d4f98a2SYan Zheng lower = upper; 10115d4f98a2SYan Zheng upper = NULL; 10125d4f98a2SYan Zheng } 1013b3b4aa74SDavid Sterba btrfs_release_path(path2); 10145d4f98a2SYan Zheng next: 10155d4f98a2SYan Zheng if (ptr < end) { 10165d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 10175d4f98a2SYan Zheng if (ptr >= end) { 10185d4f98a2SYan Zheng WARN_ON(ptr > end); 10195d4f98a2SYan Zheng ptr = 0; 10205d4f98a2SYan Zheng end = 0; 10215d4f98a2SYan Zheng } 10225d4f98a2SYan Zheng } 10235d4f98a2SYan Zheng if (ptr >= end) 10245d4f98a2SYan Zheng path1->slots[0]++; 10255d4f98a2SYan Zheng } 1026b3b4aa74SDavid Sterba btrfs_release_path(path1); 10275d4f98a2SYan Zheng 10285d4f98a2SYan Zheng cur->checked = 1; 10295d4f98a2SYan Zheng WARN_ON(exist); 10305d4f98a2SYan Zheng 10315d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 10325d4f98a2SYan Zheng if (!list_empty(&list)) { 10335d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10345d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10355d4f98a2SYan Zheng cur = edge->node[UPPER]; 10365d4f98a2SYan Zheng goto again; 10375d4f98a2SYan Zheng } 10385d4f98a2SYan Zheng 10395d4f98a2SYan Zheng /* 10405d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 10415d4f98a2SYan Zheng * into the cache. 10425d4f98a2SYan Zheng */ 104375bfb9afSJosef Bacik ASSERT(node->checked); 10443fd0a558SYan, Zheng cowonly = node->cowonly; 10453fd0a558SYan, Zheng if (!cowonly) { 10463fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 10473fd0a558SYan, Zheng &node->rb_node); 104843c04fb1SJeff Mahoney if (rb_node) 104943c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 10503fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 10513fd0a558SYan, Zheng } 10525d4f98a2SYan Zheng 10535d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 10545d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10555d4f98a2SYan Zheng 10565d4f98a2SYan Zheng while (!list_empty(&list)) { 10575d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10585d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10595d4f98a2SYan Zheng upper = edge->node[UPPER]; 10603fd0a558SYan, Zheng if (upper->detached) { 10613fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10623fd0a558SYan, Zheng lower = edge->node[LOWER]; 10633fd0a558SYan, Zheng free_backref_edge(cache, edge); 10643fd0a558SYan, Zheng if (list_empty(&lower->upper)) 10653fd0a558SYan, Zheng list_add(&lower->list, &useless); 10663fd0a558SYan, Zheng continue; 10673fd0a558SYan, Zheng } 10685d4f98a2SYan Zheng 10695d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 10705d4f98a2SYan Zheng if (upper->lowest) { 10715d4f98a2SYan Zheng list_del_init(&upper->lower); 10725d4f98a2SYan Zheng upper->lowest = 0; 10735d4f98a2SYan Zheng } 10745d4f98a2SYan Zheng 10755d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10765d4f98a2SYan Zheng continue; 10775d4f98a2SYan Zheng } 10785d4f98a2SYan Zheng 107975bfb9afSJosef Bacik if (!upper->checked) { 108075bfb9afSJosef Bacik /* 108175bfb9afSJosef Bacik * Still want to blow up for developers since this is a 108275bfb9afSJosef Bacik * logic bug. 108375bfb9afSJosef Bacik */ 108475bfb9afSJosef Bacik ASSERT(0); 108575bfb9afSJosef Bacik err = -EINVAL; 108675bfb9afSJosef Bacik goto out; 108775bfb9afSJosef Bacik } 108875bfb9afSJosef Bacik if (cowonly != upper->cowonly) { 108975bfb9afSJosef Bacik ASSERT(0); 109075bfb9afSJosef Bacik err = -EINVAL; 109175bfb9afSJosef Bacik goto out; 109275bfb9afSJosef Bacik } 109375bfb9afSJosef Bacik 10943fd0a558SYan, Zheng if (!cowonly) { 10955d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 10965d4f98a2SYan Zheng &upper->rb_node); 109743c04fb1SJeff Mahoney if (rb_node) 109843c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 109943c04fb1SJeff Mahoney upper->bytenr); 11003fd0a558SYan, Zheng } 11015d4f98a2SYan Zheng 11025d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 11035d4f98a2SYan Zheng 11045d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 11055d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 11065d4f98a2SYan Zheng } 11073fd0a558SYan, Zheng /* 11083fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 11093fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 11103fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 11113fd0a558SYan, Zheng * lookup. 11123fd0a558SYan, Zheng */ 11133fd0a558SYan, Zheng while (!list_empty(&useless)) { 11143fd0a558SYan, Zheng upper = list_entry(useless.next, struct backref_node, list); 11153fd0a558SYan, Zheng list_del_init(&upper->list); 111675bfb9afSJosef Bacik ASSERT(list_empty(&upper->upper)); 11173fd0a558SYan, Zheng if (upper == node) 11183fd0a558SYan, Zheng node = NULL; 11193fd0a558SYan, Zheng if (upper->lowest) { 11203fd0a558SYan, Zheng list_del_init(&upper->lower); 11213fd0a558SYan, Zheng upper->lowest = 0; 11223fd0a558SYan, Zheng } 11233fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 11243fd0a558SYan, Zheng edge = list_entry(upper->lower.next, 11253fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 11263fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 11273fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11283fd0a558SYan, Zheng lower = edge->node[LOWER]; 11293fd0a558SYan, Zheng free_backref_edge(cache, edge); 11303fd0a558SYan, Zheng 11313fd0a558SYan, Zheng if (list_empty(&lower->upper)) 11323fd0a558SYan, Zheng list_add(&lower->list, &useless); 11333fd0a558SYan, Zheng } 11343fd0a558SYan, Zheng __mark_block_processed(rc, upper); 11353fd0a558SYan, Zheng if (upper->level > 0) { 11363fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 11373fd0a558SYan, Zheng upper->detached = 1; 11383fd0a558SYan, Zheng } else { 11393fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 11403fd0a558SYan, Zheng free_backref_node(cache, upper); 11413fd0a558SYan, Zheng } 11423fd0a558SYan, Zheng } 11435d4f98a2SYan Zheng out: 11445d4f98a2SYan Zheng btrfs_free_path(path1); 11455d4f98a2SYan Zheng btrfs_free_path(path2); 11465d4f98a2SYan Zheng if (err) { 11473fd0a558SYan, Zheng while (!list_empty(&useless)) { 11483fd0a558SYan, Zheng lower = list_entry(useless.next, 114975bfb9afSJosef Bacik struct backref_node, list); 115075bfb9afSJosef Bacik list_del_init(&lower->list); 11513fd0a558SYan, Zheng } 115275bfb9afSJosef Bacik while (!list_empty(&list)) { 115375bfb9afSJosef Bacik edge = list_first_entry(&list, struct backref_edge, 115475bfb9afSJosef Bacik list[UPPER]); 115575bfb9afSJosef Bacik list_del(&edge->list[UPPER]); 11563fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 115775bfb9afSJosef Bacik lower = edge->node[LOWER]; 11585d4f98a2SYan Zheng upper = edge->node[UPPER]; 11593fd0a558SYan, Zheng free_backref_edge(cache, edge); 116075bfb9afSJosef Bacik 116175bfb9afSJosef Bacik /* 116275bfb9afSJosef Bacik * Lower is no longer linked to any upper backref nodes 116375bfb9afSJosef Bacik * and isn't in the cache, we can free it ourselves. 116475bfb9afSJosef Bacik */ 116575bfb9afSJosef Bacik if (list_empty(&lower->upper) && 116675bfb9afSJosef Bacik RB_EMPTY_NODE(&lower->rb_node)) 116775bfb9afSJosef Bacik list_add(&lower->list, &useless); 116875bfb9afSJosef Bacik 116975bfb9afSJosef Bacik if (!RB_EMPTY_NODE(&upper->rb_node)) 117075bfb9afSJosef Bacik continue; 117175bfb9afSJosef Bacik 117201327610SNicholas D Steeves /* Add this guy's upper edges to the list to process */ 117375bfb9afSJosef Bacik list_for_each_entry(edge, &upper->upper, list[LOWER]) 117475bfb9afSJosef Bacik list_add_tail(&edge->list[UPPER], &list); 117575bfb9afSJosef Bacik if (list_empty(&upper->upper)) 117675bfb9afSJosef Bacik list_add(&upper->list, &useless); 117775bfb9afSJosef Bacik } 117875bfb9afSJosef Bacik 117975bfb9afSJosef Bacik while (!list_empty(&useless)) { 118075bfb9afSJosef Bacik lower = list_entry(useless.next, 118175bfb9afSJosef Bacik struct backref_node, list); 118275bfb9afSJosef Bacik list_del_init(&lower->list); 11830fd8c3daSLiu Bo if (lower == node) 11840fd8c3daSLiu Bo node = NULL; 118575bfb9afSJosef Bacik free_backref_node(cache, lower); 11865d4f98a2SYan Zheng } 11870fd8c3daSLiu Bo 11880fd8c3daSLiu Bo free_backref_node(cache, node); 11895d4f98a2SYan Zheng return ERR_PTR(err); 11905d4f98a2SYan Zheng } 119175bfb9afSJosef Bacik ASSERT(!node || !node->detached); 11925d4f98a2SYan Zheng return node; 11935d4f98a2SYan Zheng } 11945d4f98a2SYan Zheng 11955d4f98a2SYan Zheng /* 11963fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 11973fd0a558SYan, Zheng * the backref node is created by cloning backref node that 11983fd0a558SYan, Zheng * corresponds to root of source tree 11993fd0a558SYan, Zheng */ 12003fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 12013fd0a558SYan, Zheng struct reloc_control *rc, 12023fd0a558SYan, Zheng struct btrfs_root *src, 12033fd0a558SYan, Zheng struct btrfs_root *dest) 12043fd0a558SYan, Zheng { 12053fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 12063fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 12073fd0a558SYan, Zheng struct backref_node *node = NULL; 12083fd0a558SYan, Zheng struct backref_node *new_node; 12093fd0a558SYan, Zheng struct backref_edge *edge; 12103fd0a558SYan, Zheng struct backref_edge *new_edge; 12113fd0a558SYan, Zheng struct rb_node *rb_node; 12123fd0a558SYan, Zheng 12133fd0a558SYan, Zheng if (cache->last_trans > 0) 12143fd0a558SYan, Zheng update_backref_cache(trans, cache); 12153fd0a558SYan, Zheng 12163fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 12173fd0a558SYan, Zheng if (rb_node) { 12183fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 12193fd0a558SYan, Zheng if (node->detached) 12203fd0a558SYan, Zheng node = NULL; 12213fd0a558SYan, Zheng else 12223fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 12233fd0a558SYan, Zheng } 12243fd0a558SYan, Zheng 12253fd0a558SYan, Zheng if (!node) { 12263fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 12273fd0a558SYan, Zheng reloc_root->commit_root->start); 12283fd0a558SYan, Zheng if (rb_node) { 12293fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 12303fd0a558SYan, Zheng rb_node); 12313fd0a558SYan, Zheng BUG_ON(node->detached); 12323fd0a558SYan, Zheng } 12333fd0a558SYan, Zheng } 12343fd0a558SYan, Zheng 12353fd0a558SYan, Zheng if (!node) 12363fd0a558SYan, Zheng return 0; 12373fd0a558SYan, Zheng 12383fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 12393fd0a558SYan, Zheng if (!new_node) 12403fd0a558SYan, Zheng return -ENOMEM; 12413fd0a558SYan, Zheng 12423fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 12433fd0a558SYan, Zheng new_node->level = node->level; 12443fd0a558SYan, Zheng new_node->lowest = node->lowest; 12456848ad64SYan, Zheng new_node->checked = 1; 12463fd0a558SYan, Zheng new_node->root = dest; 12473fd0a558SYan, Zheng 12483fd0a558SYan, Zheng if (!node->lowest) { 12493fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 12503fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 12513fd0a558SYan, Zheng if (!new_edge) 12523fd0a558SYan, Zheng goto fail; 12533fd0a558SYan, Zheng 12543fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 12553fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 12563fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 12573fd0a558SYan, Zheng &new_node->lower); 12583fd0a558SYan, Zheng } 125976b9e23dSMiao Xie } else { 126076b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 12613fd0a558SYan, Zheng } 12623fd0a558SYan, Zheng 12633fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 12643fd0a558SYan, Zheng &new_node->rb_node); 126543c04fb1SJeff Mahoney if (rb_node) 126643c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 12673fd0a558SYan, Zheng 12683fd0a558SYan, Zheng if (!new_node->lowest) { 12693fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 12703fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 12713fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 12723fd0a558SYan, Zheng } 12733fd0a558SYan, Zheng } 12743fd0a558SYan, Zheng return 0; 12753fd0a558SYan, Zheng fail: 12763fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 12773fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 12783fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 12793fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 12803fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 12813fd0a558SYan, Zheng } 12823fd0a558SYan, Zheng free_backref_node(cache, new_node); 12833fd0a558SYan, Zheng return -ENOMEM; 12843fd0a558SYan, Zheng } 12853fd0a558SYan, Zheng 12863fd0a558SYan, Zheng /* 12875d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 12885d4f98a2SYan Zheng */ 1289ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 12905d4f98a2SYan Zheng { 12915d4f98a2SYan Zheng struct rb_node *rb_node; 12925d4f98a2SYan Zheng struct mapping_node *node; 12935d4f98a2SYan Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 12945d4f98a2SYan Zheng 12955d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1296ffd7b339SJeff Mahoney if (!node) 1297ffd7b339SJeff Mahoney return -ENOMEM; 12985d4f98a2SYan Zheng 12995d4f98a2SYan Zheng node->bytenr = root->node->start; 13005d4f98a2SYan Zheng node->data = root; 13015d4f98a2SYan Zheng 13025d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13035d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13045d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13055d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1306ffd7b339SJeff Mahoney if (rb_node) { 13075d163e0eSJeff Mahoney btrfs_panic(root->fs_info, -EEXIST, 13085d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 13095d163e0eSJeff Mahoney node->bytenr); 131023291a04SDan Carpenter kfree(node); 131123291a04SDan Carpenter return -EEXIST; 1312ffd7b339SJeff Mahoney } 13135d4f98a2SYan Zheng 13145d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 13155d4f98a2SYan Zheng return 0; 13165d4f98a2SYan Zheng } 13175d4f98a2SYan Zheng 13185d4f98a2SYan Zheng /* 1319c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 13205d4f98a2SYan Zheng * mapping 13215d4f98a2SYan Zheng */ 1322c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 13235d4f98a2SYan Zheng { 13245d4f98a2SYan Zheng struct rb_node *rb_node; 13255d4f98a2SYan Zheng struct mapping_node *node = NULL; 13265d4f98a2SYan Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 13275d4f98a2SYan Zheng 13285d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13295d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1330c974c464SWang Shilong root->node->start); 1331c974c464SWang Shilong if (rb_node) { 1332c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1333c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1334c974c464SWang Shilong } 1335c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1336c974c464SWang Shilong 1337c974c464SWang Shilong if (!node) 1338c974c464SWang Shilong return; 1339c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1340c974c464SWang Shilong 1341c974c464SWang Shilong spin_lock(&root->fs_info->trans_lock); 1342c974c464SWang Shilong list_del_init(&root->root_list); 1343c974c464SWang Shilong spin_unlock(&root->fs_info->trans_lock); 1344c974c464SWang Shilong kfree(node); 1345c974c464SWang Shilong } 1346c974c464SWang Shilong 1347c974c464SWang Shilong /* 1348c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1349c974c464SWang Shilong * mapping 1350c974c464SWang Shilong */ 1351c974c464SWang Shilong static int __update_reloc_root(struct btrfs_root *root, u64 new_bytenr) 1352c974c464SWang Shilong { 1353c974c464SWang Shilong struct rb_node *rb_node; 1354c974c464SWang Shilong struct mapping_node *node = NULL; 1355c974c464SWang Shilong struct reloc_control *rc = root->fs_info->reloc_ctl; 1356c974c464SWang Shilong 1357c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1358c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1359c974c464SWang Shilong root->node->start); 13605d4f98a2SYan Zheng if (rb_node) { 13615d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 13625d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 13635d4f98a2SYan Zheng } 13645d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 13655d4f98a2SYan Zheng 13668f71f3e0SLiu Bo if (!node) 13678f71f3e0SLiu Bo return 0; 13685d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 13695d4f98a2SYan Zheng 13705d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1371c974c464SWang Shilong node->bytenr = new_bytenr; 13725d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13735d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13745d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 137543c04fb1SJeff Mahoney if (rb_node) 137643c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 13775d4f98a2SYan Zheng return 0; 13785d4f98a2SYan Zheng } 13795d4f98a2SYan Zheng 13803fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 13813fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 13825d4f98a2SYan Zheng { 13835d4f98a2SYan Zheng struct btrfs_root *reloc_root; 13845d4f98a2SYan Zheng struct extent_buffer *eb; 13855d4f98a2SYan Zheng struct btrfs_root_item *root_item; 13865d4f98a2SYan Zheng struct btrfs_key root_key; 13875bc7247aSMiao Xie u64 last_snap = 0; 13885d4f98a2SYan Zheng int ret; 13895d4f98a2SYan Zheng 13905d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 13915d4f98a2SYan Zheng BUG_ON(!root_item); 13925d4f98a2SYan Zheng 13935d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 13945d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 13953fd0a558SYan, Zheng root_key.offset = objectid; 13965d4f98a2SYan Zheng 13973fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 13983fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 13995d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 14005d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 14015d4f98a2SYan Zheng BUG_ON(ret); 14025d4f98a2SYan Zheng 14035bc7247aSMiao Xie last_snap = btrfs_root_last_snapshot(&root->root_item); 14043fd0a558SYan, Zheng btrfs_set_root_last_snapshot(&root->root_item, 14053fd0a558SYan, Zheng trans->transid - 1); 14063fd0a558SYan, Zheng } else { 14073fd0a558SYan, Zheng /* 14083fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 14093fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 14103fd0a558SYan, Zheng * modified after it was created have RELOC flag 14113fd0a558SYan, Zheng * set in their headers. so it's OK to not update 14123fd0a558SYan, Zheng * the 'last_snapshot'. 14133fd0a558SYan, Zheng */ 14143fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 14153fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 14163fd0a558SYan, Zheng BUG_ON(ret); 14173fd0a558SYan, Zheng } 14183fd0a558SYan, Zheng 14195d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 14205d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 14215d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 14225d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 14233fd0a558SYan, Zheng 14243fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 14253fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 14263fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 14273fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 14285d4f98a2SYan Zheng root_item->drop_level = 0; 14295bc7247aSMiao Xie /* 14305bc7247aSMiao Xie * abuse rtransid, it is safe because it is impossible to 14315bc7247aSMiao Xie * receive data into a relocation tree. 14325bc7247aSMiao Xie */ 14335bc7247aSMiao Xie btrfs_set_root_rtransid(root_item, last_snap); 14345bc7247aSMiao Xie btrfs_set_root_otransid(root_item, trans->transid); 14353fd0a558SYan, Zheng } 14365d4f98a2SYan Zheng 14375d4f98a2SYan Zheng btrfs_tree_unlock(eb); 14385d4f98a2SYan Zheng free_extent_buffer(eb); 14395d4f98a2SYan Zheng 14405d4f98a2SYan Zheng ret = btrfs_insert_root(trans, root->fs_info->tree_root, 14415d4f98a2SYan Zheng &root_key, root_item); 14425d4f98a2SYan Zheng BUG_ON(ret); 14435d4f98a2SYan Zheng kfree(root_item); 14445d4f98a2SYan Zheng 1445cb517eabSMiao Xie reloc_root = btrfs_read_fs_root(root->fs_info->tree_root, &root_key); 14465d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 14475d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 14483fd0a558SYan, Zheng return reloc_root; 14493fd0a558SYan, Zheng } 14503fd0a558SYan, Zheng 14513fd0a558SYan, Zheng /* 14523fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 14533fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 14543fd0a558SYan, Zheng */ 14553fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 14563fd0a558SYan, Zheng struct btrfs_root *root) 14573fd0a558SYan, Zheng { 14583fd0a558SYan, Zheng struct btrfs_root *reloc_root; 14593fd0a558SYan, Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 146020dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 14613fd0a558SYan, Zheng int clear_rsv = 0; 1462ffd7b339SJeff Mahoney int ret; 14633fd0a558SYan, Zheng 14643fd0a558SYan, Zheng if (root->reloc_root) { 14653fd0a558SYan, Zheng reloc_root = root->reloc_root; 14663fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 14673fd0a558SYan, Zheng return 0; 14683fd0a558SYan, Zheng } 14693fd0a558SYan, Zheng 14703fd0a558SYan, Zheng if (!rc || !rc->create_reloc_tree || 14713fd0a558SYan, Zheng root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 14723fd0a558SYan, Zheng return 0; 14733fd0a558SYan, Zheng 147420dd2cbfSMiao Xie if (!trans->reloc_reserved) { 147520dd2cbfSMiao Xie rsv = trans->block_rsv; 14763fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 14773fd0a558SYan, Zheng clear_rsv = 1; 14783fd0a558SYan, Zheng } 14793fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 14803fd0a558SYan, Zheng if (clear_rsv) 148120dd2cbfSMiao Xie trans->block_rsv = rsv; 14825d4f98a2SYan Zheng 1483ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1484ffd7b339SJeff Mahoney BUG_ON(ret < 0); 14855d4f98a2SYan Zheng root->reloc_root = reloc_root; 14865d4f98a2SYan Zheng return 0; 14875d4f98a2SYan Zheng } 14885d4f98a2SYan Zheng 14895d4f98a2SYan Zheng /* 14905d4f98a2SYan Zheng * update root item of reloc tree 14915d4f98a2SYan Zheng */ 14925d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 14935d4f98a2SYan Zheng struct btrfs_root *root) 14945d4f98a2SYan Zheng { 14955d4f98a2SYan Zheng struct btrfs_root *reloc_root; 14965d4f98a2SYan Zheng struct btrfs_root_item *root_item; 14975d4f98a2SYan Zheng int ret; 14985d4f98a2SYan Zheng 14995d4f98a2SYan Zheng if (!root->reloc_root) 15007585717fSChris Mason goto out; 15015d4f98a2SYan Zheng 15025d4f98a2SYan Zheng reloc_root = root->reloc_root; 15035d4f98a2SYan Zheng root_item = &reloc_root->root_item; 15045d4f98a2SYan Zheng 15053fd0a558SYan, Zheng if (root->fs_info->reloc_ctl->merge_reloc_tree && 15063fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 15075d4f98a2SYan Zheng root->reloc_root = NULL; 1508c974c464SWang Shilong __del_reloc_root(reloc_root); 15095d4f98a2SYan Zheng } 15105d4f98a2SYan Zheng 15115d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 15125d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 15135d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 15145d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 15155d4f98a2SYan Zheng } 15165d4f98a2SYan Zheng 15175d4f98a2SYan Zheng ret = btrfs_update_root(trans, root->fs_info->tree_root, 15185d4f98a2SYan Zheng &reloc_root->root_key, root_item); 15195d4f98a2SYan Zheng BUG_ON(ret); 15207585717fSChris Mason 15217585717fSChris Mason out: 15225d4f98a2SYan Zheng return 0; 15235d4f98a2SYan Zheng } 15245d4f98a2SYan Zheng 15255d4f98a2SYan Zheng /* 15265d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 15275d4f98a2SYan Zheng * in a subvolume 15285d4f98a2SYan Zheng */ 15295d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 15305d4f98a2SYan Zheng { 15315d4f98a2SYan Zheng struct rb_node *node; 15325d4f98a2SYan Zheng struct rb_node *prev; 15335d4f98a2SYan Zheng struct btrfs_inode *entry; 15345d4f98a2SYan Zheng struct inode *inode; 15355d4f98a2SYan Zheng 15365d4f98a2SYan Zheng spin_lock(&root->inode_lock); 15375d4f98a2SYan Zheng again: 15385d4f98a2SYan Zheng node = root->inode_tree.rb_node; 15395d4f98a2SYan Zheng prev = NULL; 15405d4f98a2SYan Zheng while (node) { 15415d4f98a2SYan Zheng prev = node; 15425d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 15435d4f98a2SYan Zheng 154433345d01SLi Zefan if (objectid < btrfs_ino(&entry->vfs_inode)) 15455d4f98a2SYan Zheng node = node->rb_left; 154633345d01SLi Zefan else if (objectid > btrfs_ino(&entry->vfs_inode)) 15475d4f98a2SYan Zheng node = node->rb_right; 15485d4f98a2SYan Zheng else 15495d4f98a2SYan Zheng break; 15505d4f98a2SYan Zheng } 15515d4f98a2SYan Zheng if (!node) { 15525d4f98a2SYan Zheng while (prev) { 15535d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 155433345d01SLi Zefan if (objectid <= btrfs_ino(&entry->vfs_inode)) { 15555d4f98a2SYan Zheng node = prev; 15565d4f98a2SYan Zheng break; 15575d4f98a2SYan Zheng } 15585d4f98a2SYan Zheng prev = rb_next(prev); 15595d4f98a2SYan Zheng } 15605d4f98a2SYan Zheng } 15615d4f98a2SYan Zheng while (node) { 15625d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 15635d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 15645d4f98a2SYan Zheng if (inode) { 15655d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15665d4f98a2SYan Zheng return inode; 15675d4f98a2SYan Zheng } 15685d4f98a2SYan Zheng 156933345d01SLi Zefan objectid = btrfs_ino(&entry->vfs_inode) + 1; 15705d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 15715d4f98a2SYan Zheng goto again; 15725d4f98a2SYan Zheng 15735d4f98a2SYan Zheng node = rb_next(node); 15745d4f98a2SYan Zheng } 15755d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15765d4f98a2SYan Zheng return NULL; 15775d4f98a2SYan Zheng } 15785d4f98a2SYan Zheng 15795d4f98a2SYan Zheng static int in_block_group(u64 bytenr, 15805d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group) 15815d4f98a2SYan Zheng { 15825d4f98a2SYan Zheng if (bytenr >= block_group->key.objectid && 15835d4f98a2SYan Zheng bytenr < block_group->key.objectid + block_group->key.offset) 15845d4f98a2SYan Zheng return 1; 15855d4f98a2SYan Zheng return 0; 15865d4f98a2SYan Zheng } 15875d4f98a2SYan Zheng 15885d4f98a2SYan Zheng /* 15895d4f98a2SYan Zheng * get new location of data 15905d4f98a2SYan Zheng */ 15915d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 15925d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 15935d4f98a2SYan Zheng { 15945d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 15955d4f98a2SYan Zheng struct btrfs_path *path; 15965d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 15975d4f98a2SYan Zheng struct extent_buffer *leaf; 15985d4f98a2SYan Zheng int ret; 15995d4f98a2SYan Zheng 16005d4f98a2SYan Zheng path = btrfs_alloc_path(); 16015d4f98a2SYan Zheng if (!path) 16025d4f98a2SYan Zheng return -ENOMEM; 16035d4f98a2SYan Zheng 16045d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 160533345d01SLi Zefan ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(reloc_inode), 16065d4f98a2SYan Zheng bytenr, 0); 16075d4f98a2SYan Zheng if (ret < 0) 16085d4f98a2SYan Zheng goto out; 16095d4f98a2SYan Zheng if (ret > 0) { 16105d4f98a2SYan Zheng ret = -ENOENT; 16115d4f98a2SYan Zheng goto out; 16125d4f98a2SYan Zheng } 16135d4f98a2SYan Zheng 16145d4f98a2SYan Zheng leaf = path->nodes[0]; 16155d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 16165d4f98a2SYan Zheng struct btrfs_file_extent_item); 16175d4f98a2SYan Zheng 16185d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 16195d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 16205d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 16215d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 16225d4f98a2SYan Zheng 16235d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 162483d4cfd4SJosef Bacik ret = -EINVAL; 16255d4f98a2SYan Zheng goto out; 16265d4f98a2SYan Zheng } 16275d4f98a2SYan Zheng 16285d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16295d4f98a2SYan Zheng ret = 0; 16305d4f98a2SYan Zheng out: 16315d4f98a2SYan Zheng btrfs_free_path(path); 16325d4f98a2SYan Zheng return ret; 16335d4f98a2SYan Zheng } 16345d4f98a2SYan Zheng 16355d4f98a2SYan Zheng /* 16365d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 16375d4f98a2SYan Zheng * the new locations. 16385d4f98a2SYan Zheng */ 16393fd0a558SYan, Zheng static noinline_for_stack 16403fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 16415d4f98a2SYan Zheng struct reloc_control *rc, 16425d4f98a2SYan Zheng struct btrfs_root *root, 16433fd0a558SYan, Zheng struct extent_buffer *leaf) 16445d4f98a2SYan Zheng { 16455d4f98a2SYan Zheng struct btrfs_key key; 16465d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 16475d4f98a2SYan Zheng struct inode *inode = NULL; 16485d4f98a2SYan Zheng u64 parent; 16495d4f98a2SYan Zheng u64 bytenr; 16503fd0a558SYan, Zheng u64 new_bytenr = 0; 16515d4f98a2SYan Zheng u64 num_bytes; 16525d4f98a2SYan Zheng u64 end; 16535d4f98a2SYan Zheng u32 nritems; 16545d4f98a2SYan Zheng u32 i; 165583d4cfd4SJosef Bacik int ret = 0; 16565d4f98a2SYan Zheng int first = 1; 16575d4f98a2SYan Zheng int dirty = 0; 16585d4f98a2SYan Zheng 16595d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 16605d4f98a2SYan Zheng return 0; 16615d4f98a2SYan Zheng 16625d4f98a2SYan Zheng /* reloc trees always use full backref */ 16635d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 16645d4f98a2SYan Zheng parent = leaf->start; 16655d4f98a2SYan Zheng else 16665d4f98a2SYan Zheng parent = 0; 16675d4f98a2SYan Zheng 16685d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 16695d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 16705d4f98a2SYan Zheng cond_resched(); 16715d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 16725d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 16735d4f98a2SYan Zheng continue; 16745d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 16755d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 16765d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 16775d4f98a2SYan Zheng continue; 16785d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16795d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 16805d4f98a2SYan Zheng if (bytenr == 0) 16815d4f98a2SYan Zheng continue; 16825d4f98a2SYan Zheng if (!in_block_group(bytenr, rc->block_group)) 16835d4f98a2SYan Zheng continue; 16845d4f98a2SYan Zheng 16855d4f98a2SYan Zheng /* 16865d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 16875d4f98a2SYan Zheng * to complete and drop the extent cache 16885d4f98a2SYan Zheng */ 16895d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 16905d4f98a2SYan Zheng if (first) { 16915d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16925d4f98a2SYan Zheng first = 0; 169333345d01SLi Zefan } else if (inode && btrfs_ino(inode) < key.objectid) { 16943fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 16955d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16965d4f98a2SYan Zheng } 169733345d01SLi Zefan if (inode && btrfs_ino(inode) == key.objectid) { 16985d4f98a2SYan Zheng end = key.offset + 16995d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 17005d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 17015d4f98a2SYan Zheng root->sectorsize)); 17025d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(end, root->sectorsize)); 17035d4f98a2SYan Zheng end--; 17045d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1705d0082371SJeff Mahoney key.offset, end); 17065d4f98a2SYan Zheng if (!ret) 17075d4f98a2SYan Zheng continue; 17085d4f98a2SYan Zheng 17095d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, key.offset, end, 17105d4f98a2SYan Zheng 1); 17115d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1712d0082371SJeff Mahoney key.offset, end); 17135d4f98a2SYan Zheng } 17145d4f98a2SYan Zheng } 17155d4f98a2SYan Zheng 17165d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 17175d4f98a2SYan Zheng bytenr, num_bytes); 171883d4cfd4SJosef Bacik if (ret) { 171983d4cfd4SJosef Bacik /* 172083d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 172183d4cfd4SJosef Bacik * in the file extent yet. 172283d4cfd4SJosef Bacik */ 172383d4cfd4SJosef Bacik break; 17243fd0a558SYan, Zheng } 17255d4f98a2SYan Zheng 17265d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 17275d4f98a2SYan Zheng dirty = 1; 17285d4f98a2SYan Zheng 17295d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 17305d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, root, new_bytenr, 17315d4f98a2SYan Zheng num_bytes, parent, 17325d4f98a2SYan Zheng btrfs_header_owner(leaf), 1733b06c4bf5SFilipe Manana key.objectid, key.offset); 173483d4cfd4SJosef Bacik if (ret) { 173566642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 173683d4cfd4SJosef Bacik break; 173783d4cfd4SJosef Bacik } 17385d4f98a2SYan Zheng 17395d4f98a2SYan Zheng ret = btrfs_free_extent(trans, root, bytenr, num_bytes, 17405d4f98a2SYan Zheng parent, btrfs_header_owner(leaf), 1741b06c4bf5SFilipe Manana key.objectid, key.offset); 174283d4cfd4SJosef Bacik if (ret) { 174366642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 174483d4cfd4SJosef Bacik break; 174583d4cfd4SJosef Bacik } 17465d4f98a2SYan Zheng } 17475d4f98a2SYan Zheng if (dirty) 17485d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 17493fd0a558SYan, Zheng if (inode) 17503fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 175183d4cfd4SJosef Bacik return ret; 17525d4f98a2SYan Zheng } 17535d4f98a2SYan Zheng 17545d4f98a2SYan Zheng static noinline_for_stack 17555d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 17565d4f98a2SYan Zheng struct btrfs_path *path, int level) 17575d4f98a2SYan Zheng { 17585d4f98a2SYan Zheng struct btrfs_disk_key key1; 17595d4f98a2SYan Zheng struct btrfs_disk_key key2; 17605d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 17615d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 17625d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 17635d4f98a2SYan Zheng } 17645d4f98a2SYan Zheng 17655d4f98a2SYan Zheng /* 17665d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 17675d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 17685d4f98a2SYan Zheng * reloc tree was create can be replaced. 17695d4f98a2SYan Zheng * 17705d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 17715d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 17725d4f98a2SYan Zheng * errors, a negative error number is returned. 17735d4f98a2SYan Zheng */ 17743fd0a558SYan, Zheng static noinline_for_stack 17753fd0a558SYan, Zheng int replace_path(struct btrfs_trans_handle *trans, 17765d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 17775d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 17785d4f98a2SYan Zheng int lowest_level, int max_level) 17795d4f98a2SYan Zheng { 17805d4f98a2SYan Zheng struct extent_buffer *eb; 17815d4f98a2SYan Zheng struct extent_buffer *parent; 17825d4f98a2SYan Zheng struct btrfs_key key; 17835d4f98a2SYan Zheng u64 old_bytenr; 17845d4f98a2SYan Zheng u64 new_bytenr; 17855d4f98a2SYan Zheng u64 old_ptr_gen; 17865d4f98a2SYan Zheng u64 new_ptr_gen; 17875d4f98a2SYan Zheng u64 last_snapshot; 17885d4f98a2SYan Zheng u32 blocksize; 17893fd0a558SYan, Zheng int cow = 0; 17905d4f98a2SYan Zheng int level; 17915d4f98a2SYan Zheng int ret; 17925d4f98a2SYan Zheng int slot; 17935d4f98a2SYan Zheng 17945d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 17955d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 17965d4f98a2SYan Zheng 17975d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 17983fd0a558SYan, Zheng again: 17995d4f98a2SYan Zheng slot = path->slots[lowest_level]; 18005d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 18015d4f98a2SYan Zheng 18025d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 18035d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 18045d4f98a2SYan Zheng level = btrfs_header_level(eb); 18055d4f98a2SYan Zheng 18065d4f98a2SYan Zheng if (level < lowest_level) { 18075d4f98a2SYan Zheng btrfs_tree_unlock(eb); 18085d4f98a2SYan Zheng free_extent_buffer(eb); 18095d4f98a2SYan Zheng return 0; 18105d4f98a2SYan Zheng } 18115d4f98a2SYan Zheng 18123fd0a558SYan, Zheng if (cow) { 18135d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 18145d4f98a2SYan Zheng BUG_ON(ret); 18153fd0a558SYan, Zheng } 18165d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 18175d4f98a2SYan Zheng 18185d4f98a2SYan Zheng if (next_key) { 18195d4f98a2SYan Zheng next_key->objectid = (u64)-1; 18205d4f98a2SYan Zheng next_key->type = (u8)-1; 18215d4f98a2SYan Zheng next_key->offset = (u64)-1; 18225d4f98a2SYan Zheng } 18235d4f98a2SYan Zheng 18245d4f98a2SYan Zheng parent = eb; 18255d4f98a2SYan Zheng while (1) { 18265d4f98a2SYan Zheng level = btrfs_header_level(parent); 18275d4f98a2SYan Zheng BUG_ON(level < lowest_level); 18285d4f98a2SYan Zheng 18295d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 18305d4f98a2SYan Zheng if (ret && slot > 0) 18315d4f98a2SYan Zheng slot--; 18325d4f98a2SYan Zheng 18335d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 18345d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 18355d4f98a2SYan Zheng 18365d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 1837707e8a07SDavid Sterba blocksize = dest->nodesize; 18385d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 18395d4f98a2SYan Zheng 18405d4f98a2SYan Zheng if (level <= max_level) { 18415d4f98a2SYan Zheng eb = path->nodes[level]; 18425d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 18435d4f98a2SYan Zheng path->slots[level]); 18445d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 18455d4f98a2SYan Zheng path->slots[level]); 18465d4f98a2SYan Zheng } else { 18475d4f98a2SYan Zheng new_bytenr = 0; 18485d4f98a2SYan Zheng new_ptr_gen = 0; 18495d4f98a2SYan Zheng } 18505d4f98a2SYan Zheng 1851fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 18525d4f98a2SYan Zheng ret = level; 18535d4f98a2SYan Zheng break; 18545d4f98a2SYan Zheng } 18555d4f98a2SYan Zheng 18565d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 18575d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 18583fd0a558SYan, Zheng if (level <= lowest_level) { 18595d4f98a2SYan Zheng ret = 0; 18605d4f98a2SYan Zheng break; 18615d4f98a2SYan Zheng } 18625d4f98a2SYan Zheng 1863ce86cd59SDavid Sterba eb = read_tree_block(dest, old_bytenr, old_ptr_gen); 186464c043deSLiu Bo if (IS_ERR(eb)) { 186564c043deSLiu Bo ret = PTR_ERR(eb); 1866264813acSLiu Bo break; 186764c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 186864c043deSLiu Bo ret = -EIO; 1869416bc658SJosef Bacik free_extent_buffer(eb); 1870379cde74SStefan Behrens break; 1871416bc658SJosef Bacik } 18725d4f98a2SYan Zheng btrfs_tree_lock(eb); 18733fd0a558SYan, Zheng if (cow) { 18745d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 18755d4f98a2SYan Zheng slot, &eb); 18765d4f98a2SYan Zheng BUG_ON(ret); 18775d4f98a2SYan Zheng } 18783fd0a558SYan, Zheng btrfs_set_lock_blocking(eb); 18795d4f98a2SYan Zheng 18805d4f98a2SYan Zheng btrfs_tree_unlock(parent); 18815d4f98a2SYan Zheng free_extent_buffer(parent); 18825d4f98a2SYan Zheng 18835d4f98a2SYan Zheng parent = eb; 18845d4f98a2SYan Zheng continue; 18855d4f98a2SYan Zheng } 18865d4f98a2SYan Zheng 18873fd0a558SYan, Zheng if (!cow) { 18883fd0a558SYan, Zheng btrfs_tree_unlock(parent); 18893fd0a558SYan, Zheng free_extent_buffer(parent); 18903fd0a558SYan, Zheng cow = 1; 18913fd0a558SYan, Zheng goto again; 18923fd0a558SYan, Zheng } 18933fd0a558SYan, Zheng 18945d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 18955d4f98a2SYan Zheng path->slots[level]); 1896b3b4aa74SDavid Sterba btrfs_release_path(path); 18975d4f98a2SYan Zheng 18985d4f98a2SYan Zheng path->lowest_level = level; 18995d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 19005d4f98a2SYan Zheng path->lowest_level = 0; 19015d4f98a2SYan Zheng BUG_ON(ret); 19025d4f98a2SYan Zheng 19035d4f98a2SYan Zheng /* 1904824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 1905824d8dffSQu Wenruo * 1906824d8dffSQu Wenruo * We must trace both trees. 1907824d8dffSQu Wenruo * 1) Tree reloc subtree 1908824d8dffSQu Wenruo * If not traced, we will leak data numbers 1909824d8dffSQu Wenruo * 2) Fs subtree 1910824d8dffSQu Wenruo * If not traced, we will double count old data 1911824d8dffSQu Wenruo * and tree block numbers, if current trans doesn't free 1912824d8dffSQu Wenruo * data reloc tree inode. 1913824d8dffSQu Wenruo */ 1914824d8dffSQu Wenruo ret = btrfs_qgroup_trace_subtree(trans, src, parent, 1915824d8dffSQu Wenruo btrfs_header_generation(parent), 1916824d8dffSQu Wenruo btrfs_header_level(parent)); 1917824d8dffSQu Wenruo if (ret < 0) 1918824d8dffSQu Wenruo break; 1919824d8dffSQu Wenruo ret = btrfs_qgroup_trace_subtree(trans, dest, 1920824d8dffSQu Wenruo path->nodes[level], 1921824d8dffSQu Wenruo btrfs_header_generation(path->nodes[level]), 1922824d8dffSQu Wenruo btrfs_header_level(path->nodes[level])); 1923824d8dffSQu Wenruo if (ret < 0) 1924824d8dffSQu Wenruo break; 1925824d8dffSQu Wenruo 1926824d8dffSQu Wenruo /* 19275d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 19285d4f98a2SYan Zheng */ 19295d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 19305d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 19315d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 19325d4f98a2SYan Zheng 19335d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 19345d4f98a2SYan Zheng path->slots[level], old_bytenr); 19355d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 19365d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 19375d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 19385d4f98a2SYan Zheng 19395d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, src, old_bytenr, blocksize, 19405d4f98a2SYan Zheng path->nodes[level]->start, 1941b06c4bf5SFilipe Manana src->root_key.objectid, level - 1, 0); 19425d4f98a2SYan Zheng BUG_ON(ret); 19435d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, dest, new_bytenr, blocksize, 19445d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 1945b06c4bf5SFilipe Manana 0); 19465d4f98a2SYan Zheng BUG_ON(ret); 19475d4f98a2SYan Zheng 19485d4f98a2SYan Zheng ret = btrfs_free_extent(trans, src, new_bytenr, blocksize, 19495d4f98a2SYan Zheng path->nodes[level]->start, 1950b06c4bf5SFilipe Manana src->root_key.objectid, level - 1, 0); 19515d4f98a2SYan Zheng BUG_ON(ret); 19525d4f98a2SYan Zheng 19535d4f98a2SYan Zheng ret = btrfs_free_extent(trans, dest, old_bytenr, blocksize, 19545d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 1955b06c4bf5SFilipe Manana 0); 19565d4f98a2SYan Zheng BUG_ON(ret); 19575d4f98a2SYan Zheng 19585d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 19595d4f98a2SYan Zheng 19605d4f98a2SYan Zheng ret = level; 19615d4f98a2SYan Zheng break; 19625d4f98a2SYan Zheng } 19635d4f98a2SYan Zheng btrfs_tree_unlock(parent); 19645d4f98a2SYan Zheng free_extent_buffer(parent); 19655d4f98a2SYan Zheng return ret; 19665d4f98a2SYan Zheng } 19675d4f98a2SYan Zheng 19685d4f98a2SYan Zheng /* 19695d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 19705d4f98a2SYan Zheng */ 19715d4f98a2SYan Zheng static noinline_for_stack 19725d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 19735d4f98a2SYan Zheng int *level) 19745d4f98a2SYan Zheng { 19755d4f98a2SYan Zheng struct extent_buffer *eb; 19765d4f98a2SYan Zheng int i; 19775d4f98a2SYan Zheng u64 last_snapshot; 19785d4f98a2SYan Zheng u32 nritems; 19795d4f98a2SYan Zheng 19805d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19815d4f98a2SYan Zheng 19825d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 19835d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19845d4f98a2SYan Zheng path->nodes[i] = NULL; 19855d4f98a2SYan Zheng } 19865d4f98a2SYan Zheng 19875d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 19885d4f98a2SYan Zheng eb = path->nodes[i]; 19895d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 19905d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 19915d4f98a2SYan Zheng path->slots[i]++; 19925d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 19935d4f98a2SYan Zheng last_snapshot) 19945d4f98a2SYan Zheng continue; 19955d4f98a2SYan Zheng 19965d4f98a2SYan Zheng *level = i; 19975d4f98a2SYan Zheng return 0; 19985d4f98a2SYan Zheng } 19995d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 20005d4f98a2SYan Zheng path->nodes[i] = NULL; 20015d4f98a2SYan Zheng } 20025d4f98a2SYan Zheng return 1; 20035d4f98a2SYan Zheng } 20045d4f98a2SYan Zheng 20055d4f98a2SYan Zheng /* 20065d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 20075d4f98a2SYan Zheng */ 20085d4f98a2SYan Zheng static noinline_for_stack 20095d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 20105d4f98a2SYan Zheng int *level) 20115d4f98a2SYan Zheng { 20125d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 20135d4f98a2SYan Zheng int i; 20145d4f98a2SYan Zheng u64 bytenr; 20155d4f98a2SYan Zheng u64 ptr_gen = 0; 20165d4f98a2SYan Zheng u64 last_snapshot; 20175d4f98a2SYan Zheng u32 nritems; 20185d4f98a2SYan Zheng 20195d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 20205d4f98a2SYan Zheng 20215d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 20225d4f98a2SYan Zheng eb = path->nodes[i]; 20235d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 20245d4f98a2SYan Zheng while (path->slots[i] < nritems) { 20255d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 20265d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 20275d4f98a2SYan Zheng break; 20285d4f98a2SYan Zheng path->slots[i]++; 20295d4f98a2SYan Zheng } 20305d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 20315d4f98a2SYan Zheng if (i == *level) 20325d4f98a2SYan Zheng break; 20335d4f98a2SYan Zheng *level = i + 1; 20345d4f98a2SYan Zheng return 0; 20355d4f98a2SYan Zheng } 20365d4f98a2SYan Zheng if (i == 1) { 20375d4f98a2SYan Zheng *level = i; 20385d4f98a2SYan Zheng return 0; 20395d4f98a2SYan Zheng } 20405d4f98a2SYan Zheng 20415d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 2042ce86cd59SDavid Sterba eb = read_tree_block(root, bytenr, ptr_gen); 204364c043deSLiu Bo if (IS_ERR(eb)) { 204464c043deSLiu Bo return PTR_ERR(eb); 204564c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2046416bc658SJosef Bacik free_extent_buffer(eb); 2047416bc658SJosef Bacik return -EIO; 2048416bc658SJosef Bacik } 20495d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 20505d4f98a2SYan Zheng path->nodes[i - 1] = eb; 20515d4f98a2SYan Zheng path->slots[i - 1] = 0; 20525d4f98a2SYan Zheng } 20535d4f98a2SYan Zheng return 1; 20545d4f98a2SYan Zheng } 20555d4f98a2SYan Zheng 20565d4f98a2SYan Zheng /* 20575d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 20585d4f98a2SYan Zheng * [min_key, max_key) 20595d4f98a2SYan Zheng */ 20605d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 20615d4f98a2SYan Zheng struct btrfs_key *min_key, 20625d4f98a2SYan Zheng struct btrfs_key *max_key) 20635d4f98a2SYan Zheng { 20645d4f98a2SYan Zheng struct inode *inode = NULL; 20655d4f98a2SYan Zheng u64 objectid; 20665d4f98a2SYan Zheng u64 start, end; 206733345d01SLi Zefan u64 ino; 20685d4f98a2SYan Zheng 20695d4f98a2SYan Zheng objectid = min_key->objectid; 20705d4f98a2SYan Zheng while (1) { 20715d4f98a2SYan Zheng cond_resched(); 20725d4f98a2SYan Zheng iput(inode); 20735d4f98a2SYan Zheng 20745d4f98a2SYan Zheng if (objectid > max_key->objectid) 20755d4f98a2SYan Zheng break; 20765d4f98a2SYan Zheng 20775d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 20785d4f98a2SYan Zheng if (!inode) 20795d4f98a2SYan Zheng break; 208033345d01SLi Zefan ino = btrfs_ino(inode); 20815d4f98a2SYan Zheng 208233345d01SLi Zefan if (ino > max_key->objectid) { 20835d4f98a2SYan Zheng iput(inode); 20845d4f98a2SYan Zheng break; 20855d4f98a2SYan Zheng } 20865d4f98a2SYan Zheng 208733345d01SLi Zefan objectid = ino + 1; 20885d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 20895d4f98a2SYan Zheng continue; 20905d4f98a2SYan Zheng 209133345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 20925d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 20935d4f98a2SYan Zheng continue; 20945d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 20955d4f98a2SYan Zheng start = 0; 20965d4f98a2SYan Zheng else { 20975d4f98a2SYan Zheng start = min_key->offset; 20985d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(start, root->sectorsize)); 20995d4f98a2SYan Zheng } 21005d4f98a2SYan Zheng } else { 21015d4f98a2SYan Zheng start = 0; 21025d4f98a2SYan Zheng } 21035d4f98a2SYan Zheng 210433345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 21055d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 21065d4f98a2SYan Zheng continue; 21075d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 21085d4f98a2SYan Zheng end = (u64)-1; 21095d4f98a2SYan Zheng } else { 21105d4f98a2SYan Zheng if (max_key->offset == 0) 21115d4f98a2SYan Zheng continue; 21125d4f98a2SYan Zheng end = max_key->offset; 21135d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(end, root->sectorsize)); 21145d4f98a2SYan Zheng end--; 21155d4f98a2SYan Zheng } 21165d4f98a2SYan Zheng } else { 21175d4f98a2SYan Zheng end = (u64)-1; 21185d4f98a2SYan Zheng } 21195d4f98a2SYan Zheng 21205d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2121d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 21225d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, start, end, 1); 2123d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 21245d4f98a2SYan Zheng } 21255d4f98a2SYan Zheng return 0; 21265d4f98a2SYan Zheng } 21275d4f98a2SYan Zheng 21285d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 21295d4f98a2SYan Zheng struct btrfs_key *key) 21305d4f98a2SYan Zheng 21315d4f98a2SYan Zheng { 21325d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 21335d4f98a2SYan Zheng if (!path->nodes[level]) 21345d4f98a2SYan Zheng break; 21355d4f98a2SYan Zheng if (path->slots[level] + 1 < 21365d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 21375d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 21385d4f98a2SYan Zheng path->slots[level] + 1); 21395d4f98a2SYan Zheng return 0; 21405d4f98a2SYan Zheng } 21415d4f98a2SYan Zheng level++; 21425d4f98a2SYan Zheng } 21435d4f98a2SYan Zheng return 1; 21445d4f98a2SYan Zheng } 21455d4f98a2SYan Zheng 21465d4f98a2SYan Zheng /* 21475d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 21485d4f98a2SYan Zheng * fs tree. 21495d4f98a2SYan Zheng */ 21505d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 21515d4f98a2SYan Zheng struct btrfs_root *root) 21525d4f98a2SYan Zheng { 21535d4f98a2SYan Zheng LIST_HEAD(inode_list); 21545d4f98a2SYan Zheng struct btrfs_key key; 21555d4f98a2SYan Zheng struct btrfs_key next_key; 21569e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 21575d4f98a2SYan Zheng struct btrfs_root *reloc_root; 21585d4f98a2SYan Zheng struct btrfs_root_item *root_item; 21595d4f98a2SYan Zheng struct btrfs_path *path; 21603fd0a558SYan, Zheng struct extent_buffer *leaf; 21615d4f98a2SYan Zheng int level; 21625d4f98a2SYan Zheng int max_level; 21635d4f98a2SYan Zheng int replaced = 0; 21645d4f98a2SYan Zheng int ret; 21655d4f98a2SYan Zheng int err = 0; 21663fd0a558SYan, Zheng u32 min_reserved; 21675d4f98a2SYan Zheng 21685d4f98a2SYan Zheng path = btrfs_alloc_path(); 21695d4f98a2SYan Zheng if (!path) 21705d4f98a2SYan Zheng return -ENOMEM; 2171e4058b54SDavid Sterba path->reada = READA_FORWARD; 21725d4f98a2SYan Zheng 21735d4f98a2SYan Zheng reloc_root = root->reloc_root; 21745d4f98a2SYan Zheng root_item = &reloc_root->root_item; 21755d4f98a2SYan Zheng 21765d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 21775d4f98a2SYan Zheng level = btrfs_root_level(root_item); 21785d4f98a2SYan Zheng extent_buffer_get(reloc_root->node); 21795d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 21805d4f98a2SYan Zheng path->slots[level] = 0; 21815d4f98a2SYan Zheng } else { 21825d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 21835d4f98a2SYan Zheng 21845d4f98a2SYan Zheng level = root_item->drop_level; 21855d4f98a2SYan Zheng BUG_ON(level == 0); 21865d4f98a2SYan Zheng path->lowest_level = level; 21875d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 218833c66f43SYan Zheng path->lowest_level = 0; 21895d4f98a2SYan Zheng if (ret < 0) { 21905d4f98a2SYan Zheng btrfs_free_path(path); 21915d4f98a2SYan Zheng return ret; 21925d4f98a2SYan Zheng } 21935d4f98a2SYan Zheng 21945d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 21955d4f98a2SYan Zheng path->slots[level]); 21965d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 21975d4f98a2SYan Zheng 21985d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 21995d4f98a2SYan Zheng } 22005d4f98a2SYan Zheng 22013fd0a558SYan, Zheng min_reserved = root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 22025d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 22035d4f98a2SYan Zheng 22045d4f98a2SYan Zheng while (1) { 220508e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 220608e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 22073fd0a558SYan, Zheng if (ret) { 22089e6a0c52SJosef Bacik err = ret; 22099e6a0c52SJosef Bacik goto out; 22103fd0a558SYan, Zheng } 22119e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 22129e6a0c52SJosef Bacik if (IS_ERR(trans)) { 22139e6a0c52SJosef Bacik err = PTR_ERR(trans); 22149e6a0c52SJosef Bacik trans = NULL; 22159e6a0c52SJosef Bacik goto out; 22169e6a0c52SJosef Bacik } 22179e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 22183fd0a558SYan, Zheng 22193fd0a558SYan, Zheng replaced = 0; 22205d4f98a2SYan Zheng max_level = level; 22215d4f98a2SYan Zheng 22225d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 22235d4f98a2SYan Zheng if (ret < 0) { 22245d4f98a2SYan Zheng err = ret; 22255d4f98a2SYan Zheng goto out; 22265d4f98a2SYan Zheng } 22275d4f98a2SYan Zheng if (ret > 0) 22285d4f98a2SYan Zheng break; 22295d4f98a2SYan Zheng 22305d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 22315d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 22325d4f98a2SYan Zheng ret = 0; 22335d4f98a2SYan Zheng } else { 22343fd0a558SYan, Zheng ret = replace_path(trans, root, reloc_root, path, 22353fd0a558SYan, Zheng &next_key, level, max_level); 22365d4f98a2SYan Zheng } 22375d4f98a2SYan Zheng if (ret < 0) { 22385d4f98a2SYan Zheng err = ret; 22395d4f98a2SYan Zheng goto out; 22405d4f98a2SYan Zheng } 22415d4f98a2SYan Zheng 22425d4f98a2SYan Zheng if (ret > 0) { 22435d4f98a2SYan Zheng level = ret; 22445d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 22455d4f98a2SYan Zheng path->slots[level]); 22465d4f98a2SYan Zheng replaced = 1; 22475d4f98a2SYan Zheng } 22485d4f98a2SYan Zheng 22495d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 22505d4f98a2SYan Zheng if (ret > 0) 22515d4f98a2SYan Zheng break; 22525d4f98a2SYan Zheng 22535d4f98a2SYan Zheng BUG_ON(level == 0); 22545d4f98a2SYan Zheng /* 22555d4f98a2SYan Zheng * save the merging progress in the drop_progress. 22565d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 22575d4f98a2SYan Zheng */ 22585d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 22595d4f98a2SYan Zheng path->slots[level]); 22605d4f98a2SYan Zheng root_item->drop_level = level; 22615d4f98a2SYan Zheng 22623fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, root); 22639e6a0c52SJosef Bacik trans = NULL; 22645d4f98a2SYan Zheng 2265b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 22665d4f98a2SYan Zheng 22675d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 22685d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 22695d4f98a2SYan Zheng } 22705d4f98a2SYan Zheng 22715d4f98a2SYan Zheng /* 22725d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 22735d4f98a2SYan Zheng * relocated and the block is tree root. 22745d4f98a2SYan Zheng */ 22755d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 22765d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 22775d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 22785d4f98a2SYan Zheng free_extent_buffer(leaf); 22795d4f98a2SYan Zheng if (ret < 0) 22805d4f98a2SYan Zheng err = ret; 22815d4f98a2SYan Zheng out: 22825d4f98a2SYan Zheng btrfs_free_path(path); 22835d4f98a2SYan Zheng 22845d4f98a2SYan Zheng if (err == 0) { 22855d4f98a2SYan Zheng memset(&root_item->drop_progress, 0, 22865d4f98a2SYan Zheng sizeof(root_item->drop_progress)); 22875d4f98a2SYan Zheng root_item->drop_level = 0; 22885d4f98a2SYan Zheng btrfs_set_root_refs(root_item, 0); 22893fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 22905d4f98a2SYan Zheng } 22915d4f98a2SYan Zheng 22929e6a0c52SJosef Bacik if (trans) 22933fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, root); 22945d4f98a2SYan Zheng 2295b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 22965d4f98a2SYan Zheng 22975d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 22985d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 22995d4f98a2SYan Zheng 23005d4f98a2SYan Zheng return err; 23015d4f98a2SYan Zheng } 23025d4f98a2SYan Zheng 23033fd0a558SYan, Zheng static noinline_for_stack 23043fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 23055d4f98a2SYan Zheng { 23063fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 23073fd0a558SYan, Zheng struct btrfs_root *reloc_root; 23085d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 23093fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 23103fd0a558SYan, Zheng u64 num_bytes = 0; 23113fd0a558SYan, Zheng int ret; 23123fd0a558SYan, Zheng 23137585717fSChris Mason mutex_lock(&root->fs_info->reloc_mutex); 23143fd0a558SYan, Zheng rc->merging_rsv_size += root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 23153fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 23167585717fSChris Mason mutex_unlock(&root->fs_info->reloc_mutex); 23177585717fSChris Mason 23183fd0a558SYan, Zheng again: 23193fd0a558SYan, Zheng if (!err) { 23203fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 232108e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 232208e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 23233fd0a558SYan, Zheng if (ret) 23243fd0a558SYan, Zheng err = ret; 23253fd0a558SYan, Zheng } 23263fd0a558SYan, Zheng 23277a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 23283612b495STsutomu Itoh if (IS_ERR(trans)) { 23293612b495STsutomu Itoh if (!err) 23303612b495STsutomu Itoh btrfs_block_rsv_release(rc->extent_root, 23313612b495STsutomu Itoh rc->block_rsv, num_bytes); 23323612b495STsutomu Itoh return PTR_ERR(trans); 23333612b495STsutomu Itoh } 23343fd0a558SYan, Zheng 23353fd0a558SYan, Zheng if (!err) { 23363fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 23373fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 23383fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, 23393fd0a558SYan, Zheng rc->block_rsv, num_bytes); 23403fd0a558SYan, Zheng goto again; 23413fd0a558SYan, Zheng } 23423fd0a558SYan, Zheng } 23433fd0a558SYan, Zheng 23443fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 23453fd0a558SYan, Zheng 23463fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 23473fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 23483fd0a558SYan, Zheng struct btrfs_root, root_list); 23493fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 23503fd0a558SYan, Zheng 23513fd0a558SYan, Zheng root = read_fs_root(reloc_root->fs_info, 23523fd0a558SYan, Zheng reloc_root->root_key.offset); 23533fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 23543fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 23553fd0a558SYan, Zheng 23563fd0a558SYan, Zheng /* 23573fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 23583fd0a558SYan, Zheng * knows it should resumes merging 23593fd0a558SYan, Zheng */ 23603fd0a558SYan, Zheng if (!err) 23613fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 23623fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 23633fd0a558SYan, Zheng 23643fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 23653fd0a558SYan, Zheng } 23663fd0a558SYan, Zheng 23673fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 23683fd0a558SYan, Zheng 23693fd0a558SYan, Zheng if (!err) 23703fd0a558SYan, Zheng btrfs_commit_transaction(trans, rc->extent_root); 23713fd0a558SYan, Zheng else 23723fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 23733fd0a558SYan, Zheng return err; 23743fd0a558SYan, Zheng } 23753fd0a558SYan, Zheng 23763fd0a558SYan, Zheng static noinline_for_stack 2377aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2378aca1bba6SLiu Bo { 2379aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2380aca1bba6SLiu Bo 2381aca1bba6SLiu Bo while (!list_empty(list)) { 2382aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2383aca1bba6SLiu Bo root_list); 23846bdf131fSJosef Bacik free_extent_buffer(reloc_root->node); 23856bdf131fSJosef Bacik free_extent_buffer(reloc_root->commit_root); 23866bdf131fSJosef Bacik reloc_root->node = NULL; 23876bdf131fSJosef Bacik reloc_root->commit_root = NULL; 2388c974c464SWang Shilong __del_reloc_root(reloc_root); 2389aca1bba6SLiu Bo } 2390aca1bba6SLiu Bo } 2391aca1bba6SLiu Bo 2392aca1bba6SLiu Bo static noinline_for_stack 239394404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 23943fd0a558SYan, Zheng { 23955d4f98a2SYan Zheng struct btrfs_root *root; 23965d4f98a2SYan Zheng struct btrfs_root *reloc_root; 23975bc7247aSMiao Xie u64 last_snap; 23985bc7247aSMiao Xie u64 otransid; 23995bc7247aSMiao Xie u64 objectid; 24003fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 24013fd0a558SYan, Zheng int found = 0; 2402aca1bba6SLiu Bo int ret = 0; 24033fd0a558SYan, Zheng again: 24043fd0a558SYan, Zheng root = rc->extent_root; 24057585717fSChris Mason 24067585717fSChris Mason /* 24077585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 24087585717fSChris Mason * we have to make sure nobody is in the middle of 24097585717fSChris Mason * adding their roots to the list while we are 24107585717fSChris Mason * doing this splice 24117585717fSChris Mason */ 24127585717fSChris Mason mutex_lock(&root->fs_info->reloc_mutex); 24133fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 24147585717fSChris Mason mutex_unlock(&root->fs_info->reloc_mutex); 24155d4f98a2SYan Zheng 24163fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 24173fd0a558SYan, Zheng found = 1; 24183fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 24193fd0a558SYan, Zheng struct btrfs_root, root_list); 24205d4f98a2SYan Zheng 24215d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 24225d4f98a2SYan Zheng root = read_fs_root(reloc_root->fs_info, 24235d4f98a2SYan Zheng reloc_root->root_key.offset); 24245d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 24255d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 24265d4f98a2SYan Zheng 24273fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 2428b37b39cdSJosef Bacik if (ret) { 242925e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 243025e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 243125e293c2SWang Shilong &reloc_roots); 2432aca1bba6SLiu Bo goto out; 2433b37b39cdSJosef Bacik } 24343fd0a558SYan, Zheng } else { 24353fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 24363fd0a558SYan, Zheng } 24375bc7247aSMiao Xie 24385bc7247aSMiao Xie /* 243901327610SNicholas D Steeves * we keep the old last snapshot transid in rtranid when we 24405bc7247aSMiao Xie * created the relocation tree. 24415bc7247aSMiao Xie */ 24425bc7247aSMiao Xie last_snap = btrfs_root_rtransid(&reloc_root->root_item); 24435bc7247aSMiao Xie otransid = btrfs_root_otransid(&reloc_root->root_item); 24445bc7247aSMiao Xie objectid = reloc_root->root_key.offset; 24455bc7247aSMiao Xie 24462c536799SJeff Mahoney ret = btrfs_drop_snapshot(reloc_root, rc->block_rsv, 0, 1); 2447aca1bba6SLiu Bo if (ret < 0) { 2448aca1bba6SLiu Bo if (list_empty(&reloc_root->root_list)) 2449aca1bba6SLiu Bo list_add_tail(&reloc_root->root_list, 2450aca1bba6SLiu Bo &reloc_roots); 2451aca1bba6SLiu Bo goto out; 2452aca1bba6SLiu Bo } 24535d4f98a2SYan Zheng } 24545d4f98a2SYan Zheng 24553fd0a558SYan, Zheng if (found) { 24563fd0a558SYan, Zheng found = 0; 24573fd0a558SYan, Zheng goto again; 24585d4f98a2SYan Zheng } 2459aca1bba6SLiu Bo out: 2460aca1bba6SLiu Bo if (ret) { 246134d97007SAnand Jain btrfs_handle_fs_error(root->fs_info, ret, NULL); 2462aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2463aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2464467bb1d2SWang Shilong 2465467bb1d2SWang Shilong /* new reloc root may be added */ 2466467bb1d2SWang Shilong mutex_lock(&root->fs_info->reloc_mutex); 2467467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 2468467bb1d2SWang Shilong mutex_unlock(&root->fs_info->reloc_mutex); 2469467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2470467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2471aca1bba6SLiu Bo } 2472aca1bba6SLiu Bo 24735d4f98a2SYan Zheng BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 24745d4f98a2SYan Zheng } 24755d4f98a2SYan Zheng 24765d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 24775d4f98a2SYan Zheng { 24785d4f98a2SYan Zheng struct tree_block *block; 24795d4f98a2SYan Zheng struct rb_node *rb_node; 24805d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 24815d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 24825d4f98a2SYan Zheng rb_erase(rb_node, blocks); 24835d4f98a2SYan Zheng kfree(block); 24845d4f98a2SYan Zheng } 24855d4f98a2SYan Zheng } 24865d4f98a2SYan Zheng 24875d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 24885d4f98a2SYan Zheng struct btrfs_root *reloc_root) 24895d4f98a2SYan Zheng { 24905d4f98a2SYan Zheng struct btrfs_root *root; 24915d4f98a2SYan Zheng 24925d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 24935d4f98a2SYan Zheng return 0; 24945d4f98a2SYan Zheng 24955d4f98a2SYan Zheng root = read_fs_root(reloc_root->fs_info, reloc_root->root_key.offset); 24965d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 24975d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 24985d4f98a2SYan Zheng 24995d4f98a2SYan Zheng return btrfs_record_root_in_trans(trans, root); 25005d4f98a2SYan Zheng } 25015d4f98a2SYan Zheng 25023fd0a558SYan, Zheng static noinline_for_stack 25033fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 25043fd0a558SYan, Zheng struct reloc_control *rc, 25055d4f98a2SYan Zheng struct backref_node *node, 2506dc4103f9SWang Shilong struct backref_edge *edges[]) 25075d4f98a2SYan Zheng { 25085d4f98a2SYan Zheng struct backref_node *next; 25095d4f98a2SYan Zheng struct btrfs_root *root; 25103fd0a558SYan, Zheng int index = 0; 25113fd0a558SYan, Zheng 25125d4f98a2SYan Zheng next = node; 25135d4f98a2SYan Zheng while (1) { 25145d4f98a2SYan Zheng cond_resched(); 25155d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 25165d4f98a2SYan Zheng root = next->root; 25173fd0a558SYan, Zheng BUG_ON(!root); 251827cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 25195d4f98a2SYan Zheng 25205d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 25215d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 25225d4f98a2SYan Zheng break; 25235d4f98a2SYan Zheng } 25245d4f98a2SYan Zheng 25255d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 25263fd0a558SYan, Zheng root = root->reloc_root; 25273fd0a558SYan, Zheng 25283fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 25293fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 25303fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 25313fd0a558SYan, Zheng next->new_bytenr = root->node->start; 25323fd0a558SYan, Zheng next->root = root; 25333fd0a558SYan, Zheng list_add_tail(&next->list, 25343fd0a558SYan, Zheng &rc->backref_cache.changed); 25353fd0a558SYan, Zheng __mark_block_processed(rc, next); 25365d4f98a2SYan Zheng break; 25375d4f98a2SYan Zheng } 25385d4f98a2SYan Zheng 25393fd0a558SYan, Zheng WARN_ON(1); 25405d4f98a2SYan Zheng root = NULL; 25415d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 25425d4f98a2SYan Zheng if (!next || next->level <= node->level) 25435d4f98a2SYan Zheng break; 25445d4f98a2SYan Zheng } 25453fd0a558SYan, Zheng if (!root) 25463fd0a558SYan, Zheng return NULL; 25475d4f98a2SYan Zheng 25483fd0a558SYan, Zheng next = node; 25493fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 25503fd0a558SYan, Zheng while (1) { 25513fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 25523fd0a558SYan, Zheng if (--index < 0) 25533fd0a558SYan, Zheng break; 25543fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 25553fd0a558SYan, Zheng } 25565d4f98a2SYan Zheng return root; 25575d4f98a2SYan Zheng } 25585d4f98a2SYan Zheng 25593fd0a558SYan, Zheng /* 25603fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 25613fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 25623fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 25633fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 25643fd0a558SYan, Zheng */ 25655d4f98a2SYan Zheng static noinline_for_stack 2566147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 25675d4f98a2SYan Zheng { 25683fd0a558SYan, Zheng struct backref_node *next; 25693fd0a558SYan, Zheng struct btrfs_root *root; 25703fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 25715d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25723fd0a558SYan, Zheng int index = 0; 25733fd0a558SYan, Zheng 25743fd0a558SYan, Zheng next = node; 25753fd0a558SYan, Zheng while (1) { 25763fd0a558SYan, Zheng cond_resched(); 25773fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 25783fd0a558SYan, Zheng root = next->root; 25793fd0a558SYan, Zheng BUG_ON(!root); 25803fd0a558SYan, Zheng 258125985edcSLucas De Marchi /* no other choice for non-references counted tree */ 258227cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 25833fd0a558SYan, Zheng return root; 25843fd0a558SYan, Zheng 25853fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 25863fd0a558SYan, Zheng fs_root = root; 25873fd0a558SYan, Zheng 25883fd0a558SYan, Zheng if (next != node) 25893fd0a558SYan, Zheng return NULL; 25903fd0a558SYan, Zheng 25913fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 25923fd0a558SYan, Zheng if (!next || next->level <= node->level) 25933fd0a558SYan, Zheng break; 25943fd0a558SYan, Zheng } 25953fd0a558SYan, Zheng 25963fd0a558SYan, Zheng if (!fs_root) 25973fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 25983fd0a558SYan, Zheng return fs_root; 25995d4f98a2SYan Zheng } 26005d4f98a2SYan Zheng 26015d4f98a2SYan Zheng static noinline_for_stack 26023fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 26033fd0a558SYan, Zheng struct backref_node *node, int reserve) 26045d4f98a2SYan Zheng { 26053fd0a558SYan, Zheng struct backref_node *next = node; 26063fd0a558SYan, Zheng struct backref_edge *edge; 26073fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 26083fd0a558SYan, Zheng u64 num_bytes = 0; 26093fd0a558SYan, Zheng int index = 0; 26105d4f98a2SYan Zheng 26113fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 26123fd0a558SYan, Zheng 26133fd0a558SYan, Zheng while (next) { 26143fd0a558SYan, Zheng cond_resched(); 26155d4f98a2SYan Zheng while (1) { 26163fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 26175d4f98a2SYan Zheng break; 26185d4f98a2SYan Zheng 2619707e8a07SDavid Sterba num_bytes += rc->extent_root->nodesize; 26203fd0a558SYan, Zheng 26213fd0a558SYan, Zheng if (list_empty(&next->upper)) 26223fd0a558SYan, Zheng break; 26233fd0a558SYan, Zheng 26243fd0a558SYan, Zheng edge = list_entry(next->upper.next, 26253fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 26263fd0a558SYan, Zheng edges[index++] = edge; 26273fd0a558SYan, Zheng next = edge->node[UPPER]; 26285d4f98a2SYan Zheng } 26293fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 26303fd0a558SYan, Zheng } 26313fd0a558SYan, Zheng return num_bytes; 26323fd0a558SYan, Zheng } 26333fd0a558SYan, Zheng 26343fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 26353fd0a558SYan, Zheng struct reloc_control *rc, 26363fd0a558SYan, Zheng struct backref_node *node) 26373fd0a558SYan, Zheng { 26383fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 26393fd0a558SYan, Zheng u64 num_bytes; 26403fd0a558SYan, Zheng int ret; 26410647bf56SWang Shilong u64 tmp; 26423fd0a558SYan, Zheng 26433fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 26443fd0a558SYan, Zheng 26453fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 26460647bf56SWang Shilong rc->reserved_bytes += num_bytes; 26478ca17f0fSJosef Bacik 26488ca17f0fSJosef Bacik /* 26498ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 26508ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 26518ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 26528ca17f0fSJosef Bacik */ 26530647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 26548ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 26553fd0a558SYan, Zheng if (ret) { 26568ca17f0fSJosef Bacik tmp = rc->extent_root->nodesize * RELOCATION_RESERVED_NODES; 26570647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 26580647bf56SWang Shilong tmp <<= 1; 26590647bf56SWang Shilong /* 26600647bf56SWang Shilong * only one thread can access block_rsv at this point, 26610647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 26620647bf56SWang Shilong * we expand more reservation size here to allow enough 26638ca17f0fSJosef Bacik * space for relocation and we will return eailer in 26640647bf56SWang Shilong * enospc case. 26650647bf56SWang Shilong */ 26660647bf56SWang Shilong rc->block_rsv->size = tmp + rc->extent_root->nodesize * 26670647bf56SWang Shilong RELOCATION_RESERVED_NODES; 26688ca17f0fSJosef Bacik return -EAGAIN; 26693fd0a558SYan, Zheng } 26703fd0a558SYan, Zheng 26713fd0a558SYan, Zheng return 0; 26723fd0a558SYan, Zheng } 26733fd0a558SYan, Zheng 26745d4f98a2SYan Zheng /* 26755d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 26765d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 26775d4f98a2SYan Zheng * 26785d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 26795d4f98a2SYan Zheng * in that case this function just updates pointers. 26805d4f98a2SYan Zheng */ 26815d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 26823fd0a558SYan, Zheng struct reloc_control *rc, 26835d4f98a2SYan Zheng struct backref_node *node, 26845d4f98a2SYan Zheng struct btrfs_key *key, 26855d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 26865d4f98a2SYan Zheng { 26875d4f98a2SYan Zheng struct backref_node *upper; 26885d4f98a2SYan Zheng struct backref_edge *edge; 26895d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 26905d4f98a2SYan Zheng struct btrfs_root *root; 26915d4f98a2SYan Zheng struct extent_buffer *eb; 26925d4f98a2SYan Zheng u32 blocksize; 26935d4f98a2SYan Zheng u64 bytenr; 26945d4f98a2SYan Zheng u64 generation; 26955d4f98a2SYan Zheng int slot; 26965d4f98a2SYan Zheng int ret; 26975d4f98a2SYan Zheng int err = 0; 26985d4f98a2SYan Zheng 26995d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 27005d4f98a2SYan Zheng 27015d4f98a2SYan Zheng path->lowest_level = node->level + 1; 27023fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 27035d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 27045d4f98a2SYan Zheng cond_resched(); 27055d4f98a2SYan Zheng 27065d4f98a2SYan Zheng upper = edge->node[UPPER]; 2707dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 27083fd0a558SYan, Zheng BUG_ON(!root); 27095d4f98a2SYan Zheng 27103fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 27113fd0a558SYan, Zheng if (!lowest) { 27123fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 27133fd0a558SYan, Zheng upper->level, &slot); 27143fd0a558SYan, Zheng BUG_ON(ret); 27153fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 27163fd0a558SYan, Zheng if (node->eb->start == bytenr) 27173fd0a558SYan, Zheng goto next; 27183fd0a558SYan, Zheng } 27195d4f98a2SYan Zheng drop_node_buffer(upper); 27203fd0a558SYan, Zheng } 27215d4f98a2SYan Zheng 27225d4f98a2SYan Zheng if (!upper->eb) { 27235d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 27243561b9dbSLiu Bo if (ret) { 27253561b9dbSLiu Bo if (ret < 0) 27265d4f98a2SYan Zheng err = ret; 27273561b9dbSLiu Bo else 27283561b9dbSLiu Bo err = -ENOENT; 27293561b9dbSLiu Bo 27303561b9dbSLiu Bo btrfs_release_path(path); 27315d4f98a2SYan Zheng break; 27325d4f98a2SYan Zheng } 27335d4f98a2SYan Zheng 27343fd0a558SYan, Zheng if (!upper->eb) { 27353fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 27363fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 27373fd0a558SYan, Zheng } else { 27383fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 27393fd0a558SYan, Zheng } 27403fd0a558SYan, Zheng 27413fd0a558SYan, Zheng upper->locked = 1; 27423fd0a558SYan, Zheng path->locks[upper->level] = 0; 27433fd0a558SYan, Zheng 27445d4f98a2SYan Zheng slot = path->slots[upper->level]; 2745b3b4aa74SDavid Sterba btrfs_release_path(path); 27465d4f98a2SYan Zheng } else { 27475d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 27485d4f98a2SYan Zheng &slot); 27495d4f98a2SYan Zheng BUG_ON(ret); 27505d4f98a2SYan Zheng } 27515d4f98a2SYan Zheng 27525d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 27533fd0a558SYan, Zheng if (lowest) { 27544547f4d8SLiu Bo if (bytenr != node->bytenr) { 27554547f4d8SLiu Bo btrfs_err(root->fs_info, 27564547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 27574547f4d8SLiu Bo bytenr, node->bytenr, slot, 27584547f4d8SLiu Bo upper->eb->start); 27594547f4d8SLiu Bo err = -EIO; 27604547f4d8SLiu Bo goto next; 27614547f4d8SLiu Bo } 27625d4f98a2SYan Zheng } else { 27633fd0a558SYan, Zheng if (node->eb->start == bytenr) 27643fd0a558SYan, Zheng goto next; 27655d4f98a2SYan Zheng } 27665d4f98a2SYan Zheng 2767707e8a07SDavid Sterba blocksize = root->nodesize; 27685d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 2769ce86cd59SDavid Sterba eb = read_tree_block(root, bytenr, generation); 277064c043deSLiu Bo if (IS_ERR(eb)) { 277164c043deSLiu Bo err = PTR_ERR(eb); 277264c043deSLiu Bo goto next; 277364c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2774416bc658SJosef Bacik free_extent_buffer(eb); 277597d9a8a4STsutomu Itoh err = -EIO; 277697d9a8a4STsutomu Itoh goto next; 277797d9a8a4STsutomu Itoh } 27785d4f98a2SYan Zheng btrfs_tree_lock(eb); 27795d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 27805d4f98a2SYan Zheng 27815d4f98a2SYan Zheng if (!node->eb) { 27825d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 27835d4f98a2SYan Zheng slot, &eb); 27843fd0a558SYan, Zheng btrfs_tree_unlock(eb); 27853fd0a558SYan, Zheng free_extent_buffer(eb); 27865d4f98a2SYan Zheng if (ret < 0) { 27875d4f98a2SYan Zheng err = ret; 27883fd0a558SYan, Zheng goto next; 27895d4f98a2SYan Zheng } 27903fd0a558SYan, Zheng BUG_ON(node->eb != eb); 27915d4f98a2SYan Zheng } else { 27925d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 27935d4f98a2SYan Zheng node->eb->start); 27945d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 27955d4f98a2SYan Zheng trans->transid); 27965d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 27975d4f98a2SYan Zheng 27985d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, root, 27995d4f98a2SYan Zheng node->eb->start, blocksize, 28005d4f98a2SYan Zheng upper->eb->start, 28015d4f98a2SYan Zheng btrfs_header_owner(upper->eb), 2802b06c4bf5SFilipe Manana node->level, 0); 28035d4f98a2SYan Zheng BUG_ON(ret); 28045d4f98a2SYan Zheng 28055d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 28065d4f98a2SYan Zheng BUG_ON(ret); 28075d4f98a2SYan Zheng } 28083fd0a558SYan, Zheng next: 28093fd0a558SYan, Zheng if (!upper->pending) 28103fd0a558SYan, Zheng drop_node_buffer(upper); 28113fd0a558SYan, Zheng else 28123fd0a558SYan, Zheng unlock_node_buffer(upper); 28133fd0a558SYan, Zheng if (err) 28143fd0a558SYan, Zheng break; 28155d4f98a2SYan Zheng } 28163fd0a558SYan, Zheng 28173fd0a558SYan, Zheng if (!err && node->pending) { 28183fd0a558SYan, Zheng drop_node_buffer(node); 28193fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 28203fd0a558SYan, Zheng node->pending = 0; 28215d4f98a2SYan Zheng } 28223fd0a558SYan, Zheng 28235d4f98a2SYan Zheng path->lowest_level = 0; 28243fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 28255d4f98a2SYan Zheng return err; 28265d4f98a2SYan Zheng } 28275d4f98a2SYan Zheng 28285d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 28293fd0a558SYan, Zheng struct reloc_control *rc, 28305d4f98a2SYan Zheng struct backref_node *node, 28315d4f98a2SYan Zheng struct btrfs_path *path) 28325d4f98a2SYan Zheng { 28335d4f98a2SYan Zheng struct btrfs_key key; 28345d4f98a2SYan Zheng 28355d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 28363fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 28375d4f98a2SYan Zheng } 28385d4f98a2SYan Zheng 28395d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 28403fd0a558SYan, Zheng struct reloc_control *rc, 28413fd0a558SYan, Zheng struct btrfs_path *path, int err) 28425d4f98a2SYan Zheng { 28433fd0a558SYan, Zheng LIST_HEAD(list); 28443fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 28455d4f98a2SYan Zheng struct backref_node *node; 28465d4f98a2SYan Zheng int level; 28475d4f98a2SYan Zheng int ret; 28485d4f98a2SYan Zheng 28495d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 28505d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 28515d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 28523fd0a558SYan, Zheng struct backref_node, list); 28533fd0a558SYan, Zheng list_move_tail(&node->list, &list); 28543fd0a558SYan, Zheng BUG_ON(!node->pending); 28555d4f98a2SYan Zheng 28563fd0a558SYan, Zheng if (!err) { 28573fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 28585d4f98a2SYan Zheng if (ret < 0) 28595d4f98a2SYan Zheng err = ret; 28605d4f98a2SYan Zheng } 28615d4f98a2SYan Zheng } 28623fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 28633fd0a558SYan, Zheng } 28645d4f98a2SYan Zheng return err; 28655d4f98a2SYan Zheng } 28665d4f98a2SYan Zheng 28675d4f98a2SYan Zheng static void mark_block_processed(struct reloc_control *rc, 28683fd0a558SYan, Zheng u64 bytenr, u32 blocksize) 28693fd0a558SYan, Zheng { 28703fd0a558SYan, Zheng set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, 2871ceeb0ae7SDavid Sterba EXTENT_DIRTY); 28723fd0a558SYan, Zheng } 28733fd0a558SYan, Zheng 28743fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 28755d4f98a2SYan Zheng struct backref_node *node) 28765d4f98a2SYan Zheng { 28775d4f98a2SYan Zheng u32 blocksize; 28785d4f98a2SYan Zheng if (node->level == 0 || 28795d4f98a2SYan Zheng in_block_group(node->bytenr, rc->block_group)) { 2880707e8a07SDavid Sterba blocksize = rc->extent_root->nodesize; 28813fd0a558SYan, Zheng mark_block_processed(rc, node->bytenr, blocksize); 28825d4f98a2SYan Zheng } 28835d4f98a2SYan Zheng node->processed = 1; 28845d4f98a2SYan Zheng } 28855d4f98a2SYan Zheng 28865d4f98a2SYan Zheng /* 28875d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 28885d4f98a2SYan Zheng * as processed. 28895d4f98a2SYan Zheng */ 28905d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 28915d4f98a2SYan Zheng struct backref_node *node) 28925d4f98a2SYan Zheng { 28935d4f98a2SYan Zheng struct backref_node *next = node; 28945d4f98a2SYan Zheng struct backref_edge *edge; 28955d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 28965d4f98a2SYan Zheng int index = 0; 28975d4f98a2SYan Zheng 28985d4f98a2SYan Zheng while (next) { 28995d4f98a2SYan Zheng cond_resched(); 29005d4f98a2SYan Zheng while (1) { 29015d4f98a2SYan Zheng if (next->processed) 29025d4f98a2SYan Zheng break; 29035d4f98a2SYan Zheng 29043fd0a558SYan, Zheng __mark_block_processed(rc, next); 29055d4f98a2SYan Zheng 29065d4f98a2SYan Zheng if (list_empty(&next->upper)) 29075d4f98a2SYan Zheng break; 29085d4f98a2SYan Zheng 29095d4f98a2SYan Zheng edge = list_entry(next->upper.next, 29105d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 29115d4f98a2SYan Zheng edges[index++] = edge; 29125d4f98a2SYan Zheng next = edge->node[UPPER]; 29135d4f98a2SYan Zheng } 29145d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 29155d4f98a2SYan Zheng } 29165d4f98a2SYan Zheng } 29175d4f98a2SYan Zheng 29187476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 29195d4f98a2SYan Zheng { 29207476dfdaSDavid Sterba u32 blocksize = rc->extent_root->nodesize; 29217476dfdaSDavid Sterba 29225d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 29239655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 29245d4f98a2SYan Zheng return 1; 29255d4f98a2SYan Zheng return 0; 29265d4f98a2SYan Zheng } 29275d4f98a2SYan Zheng 29285d4f98a2SYan Zheng static int get_tree_block_key(struct reloc_control *rc, 29295d4f98a2SYan Zheng struct tree_block *block) 29305d4f98a2SYan Zheng { 29315d4f98a2SYan Zheng struct extent_buffer *eb; 29325d4f98a2SYan Zheng 29335d4f98a2SYan Zheng BUG_ON(block->key_ready); 29345d4f98a2SYan Zheng eb = read_tree_block(rc->extent_root, block->bytenr, 2935ce86cd59SDavid Sterba block->key.offset); 293664c043deSLiu Bo if (IS_ERR(eb)) { 293764c043deSLiu Bo return PTR_ERR(eb); 293864c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2939416bc658SJosef Bacik free_extent_buffer(eb); 2940416bc658SJosef Bacik return -EIO; 2941416bc658SJosef Bacik } 29425d4f98a2SYan Zheng WARN_ON(btrfs_header_level(eb) != block->level); 29435d4f98a2SYan Zheng if (block->level == 0) 29445d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 29455d4f98a2SYan Zheng else 29465d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 29475d4f98a2SYan Zheng free_extent_buffer(eb); 29485d4f98a2SYan Zheng block->key_ready = 1; 29495d4f98a2SYan Zheng return 0; 29505d4f98a2SYan Zheng } 29515d4f98a2SYan Zheng 29525d4f98a2SYan Zheng /* 29535d4f98a2SYan Zheng * helper function to relocate a tree block 29545d4f98a2SYan Zheng */ 29555d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 29565d4f98a2SYan Zheng struct reloc_control *rc, 29575d4f98a2SYan Zheng struct backref_node *node, 29585d4f98a2SYan Zheng struct btrfs_key *key, 29595d4f98a2SYan Zheng struct btrfs_path *path) 29605d4f98a2SYan Zheng { 29615d4f98a2SYan Zheng struct btrfs_root *root; 29623fd0a558SYan, Zheng int ret = 0; 29635d4f98a2SYan Zheng 29643fd0a558SYan, Zheng if (!node) 29655d4f98a2SYan Zheng return 0; 29663fd0a558SYan, Zheng 29673fd0a558SYan, Zheng BUG_ON(node->processed); 2968147d256eSZhaolei root = select_one_root(node); 29693fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 29703fd0a558SYan, Zheng update_processed_blocks(rc, node); 29713fd0a558SYan, Zheng goto out; 29725d4f98a2SYan Zheng } 29735d4f98a2SYan Zheng 297427cdeb70SMiao Xie if (!root || test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 29753fd0a558SYan, Zheng ret = reserve_metadata_space(trans, rc, node); 29763fd0a558SYan, Zheng if (ret) 29775d4f98a2SYan Zheng goto out; 29785d4f98a2SYan Zheng } 29793fd0a558SYan, Zheng 29803fd0a558SYan, Zheng if (root) { 298127cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 29823fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 29833fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 29843fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 29853fd0a558SYan, Zheng root = root->reloc_root; 29863fd0a558SYan, Zheng node->new_bytenr = root->node->start; 29873fd0a558SYan, Zheng node->root = root; 29883fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 29893fd0a558SYan, Zheng } else { 29905d4f98a2SYan Zheng path->lowest_level = node->level; 29915d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 2992b3b4aa74SDavid Sterba btrfs_release_path(path); 29933fd0a558SYan, Zheng if (ret > 0) 29945d4f98a2SYan Zheng ret = 0; 29953fd0a558SYan, Zheng } 29963fd0a558SYan, Zheng if (!ret) 29973fd0a558SYan, Zheng update_processed_blocks(rc, node); 29983fd0a558SYan, Zheng } else { 29993fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 30003fd0a558SYan, Zheng } 30015d4f98a2SYan Zheng out: 30020647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 30033fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 30045d4f98a2SYan Zheng return ret; 30055d4f98a2SYan Zheng } 30065d4f98a2SYan Zheng 30075d4f98a2SYan Zheng /* 30085d4f98a2SYan Zheng * relocate a list of blocks 30095d4f98a2SYan Zheng */ 30105d4f98a2SYan Zheng static noinline_for_stack 30115d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 30125d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 30135d4f98a2SYan Zheng { 30145d4f98a2SYan Zheng struct backref_node *node; 30155d4f98a2SYan Zheng struct btrfs_path *path; 30165d4f98a2SYan Zheng struct tree_block *block; 30175d4f98a2SYan Zheng struct rb_node *rb_node; 30185d4f98a2SYan Zheng int ret; 30195d4f98a2SYan Zheng int err = 0; 30205d4f98a2SYan Zheng 30215d4f98a2SYan Zheng path = btrfs_alloc_path(); 3022e1a12670SLiu Bo if (!path) { 3023e1a12670SLiu Bo err = -ENOMEM; 302434c2b290SDavid Sterba goto out_free_blocks; 3025e1a12670SLiu Bo } 30265d4f98a2SYan Zheng 30275d4f98a2SYan Zheng rb_node = rb_first(blocks); 30285d4f98a2SYan Zheng while (rb_node) { 30295d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 30305d4f98a2SYan Zheng if (!block->key_ready) 3031d3e46feaSDavid Sterba readahead_tree_block(rc->extent_root, block->bytenr); 30325d4f98a2SYan Zheng rb_node = rb_next(rb_node); 30335d4f98a2SYan Zheng } 30345d4f98a2SYan Zheng 30355d4f98a2SYan Zheng rb_node = rb_first(blocks); 30365d4f98a2SYan Zheng while (rb_node) { 30375d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 303834c2b290SDavid Sterba if (!block->key_ready) { 303934c2b290SDavid Sterba err = get_tree_block_key(rc, block); 304034c2b290SDavid Sterba if (err) 304134c2b290SDavid Sterba goto out_free_path; 304234c2b290SDavid Sterba } 30435d4f98a2SYan Zheng rb_node = rb_next(rb_node); 30445d4f98a2SYan Zheng } 30455d4f98a2SYan Zheng 30465d4f98a2SYan Zheng rb_node = rb_first(blocks); 30475d4f98a2SYan Zheng while (rb_node) { 30485d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 30495d4f98a2SYan Zheng 30503fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 30515d4f98a2SYan Zheng block->level, block->bytenr); 30525d4f98a2SYan Zheng if (IS_ERR(node)) { 30535d4f98a2SYan Zheng err = PTR_ERR(node); 30545d4f98a2SYan Zheng goto out; 30555d4f98a2SYan Zheng } 30565d4f98a2SYan Zheng 30575d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 30585d4f98a2SYan Zheng path); 30595d4f98a2SYan Zheng if (ret < 0) { 30603fd0a558SYan, Zheng if (ret != -EAGAIN || rb_node == rb_first(blocks)) 30615d4f98a2SYan Zheng err = ret; 30625d4f98a2SYan Zheng goto out; 30635d4f98a2SYan Zheng } 30645d4f98a2SYan Zheng rb_node = rb_next(rb_node); 30655d4f98a2SYan Zheng } 30665d4f98a2SYan Zheng out: 30673fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 30685d4f98a2SYan Zheng 306934c2b290SDavid Sterba out_free_path: 30705d4f98a2SYan Zheng btrfs_free_path(path); 307134c2b290SDavid Sterba out_free_blocks: 3072e1a12670SLiu Bo free_block_list(blocks); 30735d4f98a2SYan Zheng return err; 30745d4f98a2SYan Zheng } 30755d4f98a2SYan Zheng 30765d4f98a2SYan Zheng static noinline_for_stack 3077efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3078efa56464SYan, Zheng struct file_extent_cluster *cluster) 3079efa56464SYan, Zheng { 3080efa56464SYan, Zheng u64 alloc_hint = 0; 3081efa56464SYan, Zheng u64 start; 3082efa56464SYan, Zheng u64 end; 3083efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3084efa56464SYan, Zheng u64 num_bytes; 3085efa56464SYan, Zheng int nr = 0; 3086efa56464SYan, Zheng int ret = 0; 3087dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 3088dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 308918513091SWang Xiaoguang u64 cur_offset; 3090efa56464SYan, Zheng 3091efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 30925955102cSAl Viro inode_lock(inode); 3093efa56464SYan, Zheng 3094dcb40c19SWang Xiaoguang ret = btrfs_check_data_free_space(inode, prealloc_start, 3095dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 3096efa56464SYan, Zheng if (ret) 3097efa56464SYan, Zheng goto out; 3098efa56464SYan, Zheng 309918513091SWang Xiaoguang cur_offset = prealloc_start; 3100efa56464SYan, Zheng while (nr < cluster->nr) { 3101efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3102efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3103efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3104efa56464SYan, Zheng else 3105efa56464SYan, Zheng end = cluster->end - offset; 3106efa56464SYan, Zheng 3107d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3108efa56464SYan, Zheng num_bytes = end + 1 - start; 310918513091SWang Xiaoguang if (cur_offset < start) 311018513091SWang Xiaoguang btrfs_free_reserved_data_space(inode, cur_offset, 311118513091SWang Xiaoguang start - cur_offset); 3112efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3113efa56464SYan, Zheng num_bytes, num_bytes, 3114efa56464SYan, Zheng end + 1, &alloc_hint); 311518513091SWang Xiaoguang cur_offset = end + 1; 3116d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3117efa56464SYan, Zheng if (ret) 3118efa56464SYan, Zheng break; 3119efa56464SYan, Zheng nr++; 3120efa56464SYan, Zheng } 312118513091SWang Xiaoguang if (cur_offset < prealloc_end) 312218513091SWang Xiaoguang btrfs_free_reserved_data_space(inode, cur_offset, 312318513091SWang Xiaoguang prealloc_end + 1 - cur_offset); 3124efa56464SYan, Zheng out: 31255955102cSAl Viro inode_unlock(inode); 3126efa56464SYan, Zheng return ret; 3127efa56464SYan, Zheng } 3128efa56464SYan, Zheng 3129efa56464SYan, Zheng static noinline_for_stack 31300257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 31310257bb82SYan, Zheng u64 block_start) 31325d4f98a2SYan Zheng { 31335d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(inode)->root; 31345d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 31355d4f98a2SYan Zheng struct extent_map *em; 31360257bb82SYan, Zheng int ret = 0; 31375d4f98a2SYan Zheng 3138172ddd60SDavid Sterba em = alloc_extent_map(); 31390257bb82SYan, Zheng if (!em) 31400257bb82SYan, Zheng return -ENOMEM; 31410257bb82SYan, Zheng 31425d4f98a2SYan Zheng em->start = start; 31430257bb82SYan, Zheng em->len = end + 1 - start; 31440257bb82SYan, Zheng em->block_len = em->len; 31450257bb82SYan, Zheng em->block_start = block_start; 31465d4f98a2SYan Zheng em->bdev = root->fs_info->fs_devices->latest_bdev; 31475d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 31485d4f98a2SYan Zheng 3149d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 31505d4f98a2SYan Zheng while (1) { 3151890871beSChris Mason write_lock(&em_tree->lock); 315209a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3153890871beSChris Mason write_unlock(&em_tree->lock); 31545d4f98a2SYan Zheng if (ret != -EEXIST) { 31555d4f98a2SYan Zheng free_extent_map(em); 31565d4f98a2SYan Zheng break; 31575d4f98a2SYan Zheng } 31585d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, start, end, 0); 31595d4f98a2SYan Zheng } 3160d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 31610257bb82SYan, Zheng return ret; 31620257bb82SYan, Zheng } 31635d4f98a2SYan Zheng 31640257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 31650257bb82SYan, Zheng struct file_extent_cluster *cluster) 31660257bb82SYan, Zheng { 31670257bb82SYan, Zheng u64 page_start; 31680257bb82SYan, Zheng u64 page_end; 31690257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 31700257bb82SYan, Zheng unsigned long index; 31710257bb82SYan, Zheng unsigned long last_index; 31720257bb82SYan, Zheng struct page *page; 31730257bb82SYan, Zheng struct file_ra_state *ra; 31743b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 31750257bb82SYan, Zheng int nr = 0; 31760257bb82SYan, Zheng int ret = 0; 31770257bb82SYan, Zheng 31780257bb82SYan, Zheng if (!cluster->nr) 31790257bb82SYan, Zheng return 0; 31800257bb82SYan, Zheng 31810257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 31820257bb82SYan, Zheng if (!ra) 31830257bb82SYan, Zheng return -ENOMEM; 31840257bb82SYan, Zheng 3185efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 31860257bb82SYan, Zheng if (ret) 3187efa56464SYan, Zheng goto out; 31880257bb82SYan, Zheng 31890257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 31900257bb82SYan, Zheng 3191efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3192efa56464SYan, Zheng cluster->end - offset, cluster->start); 3193efa56464SYan, Zheng if (ret) 3194efa56464SYan, Zheng goto out; 3195efa56464SYan, Zheng 319609cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 319709cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 31980257bb82SYan, Zheng while (index <= last_index) { 319909cbfeafSKirill A. Shutemov ret = btrfs_delalloc_reserve_metadata(inode, PAGE_SIZE); 3200efa56464SYan, Zheng if (ret) 3201efa56464SYan, Zheng goto out; 3202efa56464SYan, Zheng 32030257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 32040257bb82SYan, Zheng if (!page) { 32050257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 32060257bb82SYan, Zheng ra, NULL, index, 32070257bb82SYan, Zheng last_index + 1 - index); 3208a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 32093b16a4e3SJosef Bacik mask); 32100257bb82SYan, Zheng if (!page) { 3211efa56464SYan, Zheng btrfs_delalloc_release_metadata(inode, 321209cbfeafSKirill A. Shutemov PAGE_SIZE); 32130257bb82SYan, Zheng ret = -ENOMEM; 3214efa56464SYan, Zheng goto out; 32150257bb82SYan, Zheng } 32160257bb82SYan, Zheng } 32170257bb82SYan, Zheng 32180257bb82SYan, Zheng if (PageReadahead(page)) { 32190257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 32200257bb82SYan, Zheng ra, NULL, page, index, 32210257bb82SYan, Zheng last_index + 1 - index); 32220257bb82SYan, Zheng } 32230257bb82SYan, Zheng 32240257bb82SYan, Zheng if (!PageUptodate(page)) { 32250257bb82SYan, Zheng btrfs_readpage(NULL, page); 32260257bb82SYan, Zheng lock_page(page); 32270257bb82SYan, Zheng if (!PageUptodate(page)) { 32280257bb82SYan, Zheng unlock_page(page); 322909cbfeafSKirill A. Shutemov put_page(page); 3230efa56464SYan, Zheng btrfs_delalloc_release_metadata(inode, 323109cbfeafSKirill A. Shutemov PAGE_SIZE); 32320257bb82SYan, Zheng ret = -EIO; 3233efa56464SYan, Zheng goto out; 32340257bb82SYan, Zheng } 32350257bb82SYan, Zheng } 32360257bb82SYan, Zheng 32374eee4fa4SMiao Xie page_start = page_offset(page); 323809cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 32390257bb82SYan, Zheng 3240d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 32410257bb82SYan, Zheng 32420257bb82SYan, Zheng set_page_extent_mapped(page); 32430257bb82SYan, Zheng 32440257bb82SYan, Zheng if (nr < cluster->nr && 32450257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 32460257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 32470257bb82SYan, Zheng page_start, page_end, 3248ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 32490257bb82SYan, Zheng nr++; 32500257bb82SYan, Zheng } 32510257bb82SYan, Zheng 3252ba8b04c1SQu Wenruo btrfs_set_extent_delalloc(inode, page_start, page_end, NULL, 0); 32530257bb82SYan, Zheng set_page_dirty(page); 32540257bb82SYan, Zheng 32550257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3256d0082371SJeff Mahoney page_start, page_end); 32570257bb82SYan, Zheng unlock_page(page); 325809cbfeafSKirill A. Shutemov put_page(page); 32590257bb82SYan, Zheng 32600257bb82SYan, Zheng index++; 3261efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 3262efa56464SYan, Zheng btrfs_throttle(BTRFS_I(inode)->root); 32630257bb82SYan, Zheng } 32640257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3265efa56464SYan, Zheng out: 32660257bb82SYan, Zheng kfree(ra); 32670257bb82SYan, Zheng return ret; 32680257bb82SYan, Zheng } 32690257bb82SYan, Zheng 32700257bb82SYan, Zheng static noinline_for_stack 32710257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 32720257bb82SYan, Zheng struct file_extent_cluster *cluster) 32730257bb82SYan, Zheng { 32740257bb82SYan, Zheng int ret; 32750257bb82SYan, Zheng 32760257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 32770257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 32780257bb82SYan, Zheng if (ret) 32790257bb82SYan, Zheng return ret; 32800257bb82SYan, Zheng cluster->nr = 0; 32810257bb82SYan, Zheng } 32820257bb82SYan, Zheng 32830257bb82SYan, Zheng if (!cluster->nr) 32840257bb82SYan, Zheng cluster->start = extent_key->objectid; 32850257bb82SYan, Zheng else 32860257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 32870257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 32880257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 32890257bb82SYan, Zheng cluster->nr++; 32900257bb82SYan, Zheng 32910257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 32920257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 32930257bb82SYan, Zheng if (ret) 32940257bb82SYan, Zheng return ret; 32950257bb82SYan, Zheng cluster->nr = 0; 32960257bb82SYan, Zheng } 32970257bb82SYan, Zheng return 0; 32985d4f98a2SYan Zheng } 32995d4f98a2SYan Zheng 33005d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 33015d4f98a2SYan Zheng static int get_ref_objectid_v0(struct reloc_control *rc, 33025d4f98a2SYan Zheng struct btrfs_path *path, 33035d4f98a2SYan Zheng struct btrfs_key *extent_key, 33045d4f98a2SYan Zheng u64 *ref_objectid, int *path_change) 33055d4f98a2SYan Zheng { 33065d4f98a2SYan Zheng struct btrfs_key key; 33075d4f98a2SYan Zheng struct extent_buffer *leaf; 33085d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 33095d4f98a2SYan Zheng int ret; 33105d4f98a2SYan Zheng int slot; 33115d4f98a2SYan Zheng 33125d4f98a2SYan Zheng leaf = path->nodes[0]; 33135d4f98a2SYan Zheng slot = path->slots[0]; 33145d4f98a2SYan Zheng while (1) { 33155d4f98a2SYan Zheng if (slot >= btrfs_header_nritems(leaf)) { 33165d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 33175d4f98a2SYan Zheng if (ret < 0) 33185d4f98a2SYan Zheng return ret; 33195d4f98a2SYan Zheng BUG_ON(ret > 0); 33205d4f98a2SYan Zheng leaf = path->nodes[0]; 33215d4f98a2SYan Zheng slot = path->slots[0]; 33225d4f98a2SYan Zheng if (path_change) 33235d4f98a2SYan Zheng *path_change = 1; 33245d4f98a2SYan Zheng } 33255d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, slot); 33265d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 33275d4f98a2SYan Zheng return -ENOENT; 33285d4f98a2SYan Zheng 33295d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_REF_V0_KEY) { 33305d4f98a2SYan Zheng slot++; 33315d4f98a2SYan Zheng continue; 33325d4f98a2SYan Zheng } 33335d4f98a2SYan Zheng ref0 = btrfs_item_ptr(leaf, slot, 33345d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 33355d4f98a2SYan Zheng *ref_objectid = btrfs_ref_objectid_v0(leaf, ref0); 33365d4f98a2SYan Zheng break; 33375d4f98a2SYan Zheng } 33385d4f98a2SYan Zheng return 0; 33395d4f98a2SYan Zheng } 33405d4f98a2SYan Zheng #endif 33415d4f98a2SYan Zheng 33425d4f98a2SYan Zheng /* 33435d4f98a2SYan Zheng * helper to add a tree block to the list. 33445d4f98a2SYan Zheng * the major work is getting the generation and level of the block 33455d4f98a2SYan Zheng */ 33465d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 33475d4f98a2SYan Zheng struct btrfs_key *extent_key, 33485d4f98a2SYan Zheng struct btrfs_path *path, 33495d4f98a2SYan Zheng struct rb_root *blocks) 33505d4f98a2SYan Zheng { 33515d4f98a2SYan Zheng struct extent_buffer *eb; 33525d4f98a2SYan Zheng struct btrfs_extent_item *ei; 33535d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 33545d4f98a2SYan Zheng struct tree_block *block; 33555d4f98a2SYan Zheng struct rb_node *rb_node; 33565d4f98a2SYan Zheng u32 item_size; 33575d4f98a2SYan Zheng int level = -1; 33587fdf4b60SWang Shilong u64 generation; 33595d4f98a2SYan Zheng 33605d4f98a2SYan Zheng eb = path->nodes[0]; 33615d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 33625d4f98a2SYan Zheng 33633173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 33643173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 33655d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 33665d4f98a2SYan Zheng struct btrfs_extent_item); 33673173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 33685d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 33695d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 33705d4f98a2SYan Zheng } else { 33713173a18fSJosef Bacik level = (int)extent_key->offset; 33723173a18fSJosef Bacik } 33733173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 33743173a18fSJosef Bacik } else { 33755d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 33765d4f98a2SYan Zheng u64 ref_owner; 33775d4f98a2SYan Zheng int ret; 33785d4f98a2SYan Zheng 33795d4f98a2SYan Zheng BUG_ON(item_size != sizeof(struct btrfs_extent_item_v0)); 33805d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, extent_key, 33815d4f98a2SYan Zheng &ref_owner, NULL); 3382411fc6bcSAndi Kleen if (ret < 0) 3383411fc6bcSAndi Kleen return ret; 33845d4f98a2SYan Zheng BUG_ON(ref_owner >= BTRFS_MAX_LEVEL); 33855d4f98a2SYan Zheng level = (int)ref_owner; 33865d4f98a2SYan Zheng /* FIXME: get real generation */ 33875d4f98a2SYan Zheng generation = 0; 33885d4f98a2SYan Zheng #else 33895d4f98a2SYan Zheng BUG(); 33905d4f98a2SYan Zheng #endif 33915d4f98a2SYan Zheng } 33925d4f98a2SYan Zheng 3393b3b4aa74SDavid Sterba btrfs_release_path(path); 33945d4f98a2SYan Zheng 33955d4f98a2SYan Zheng BUG_ON(level == -1); 33965d4f98a2SYan Zheng 33975d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 33985d4f98a2SYan Zheng if (!block) 33995d4f98a2SYan Zheng return -ENOMEM; 34005d4f98a2SYan Zheng 34015d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3402707e8a07SDavid Sterba block->key.objectid = rc->extent_root->nodesize; 34035d4f98a2SYan Zheng block->key.offset = generation; 34045d4f98a2SYan Zheng block->level = level; 34055d4f98a2SYan Zheng block->key_ready = 0; 34065d4f98a2SYan Zheng 34075d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 340843c04fb1SJeff Mahoney if (rb_node) 340943c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 34105d4f98a2SYan Zheng 34115d4f98a2SYan Zheng return 0; 34125d4f98a2SYan Zheng } 34135d4f98a2SYan Zheng 34145d4f98a2SYan Zheng /* 34155d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 34165d4f98a2SYan Zheng */ 34175d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 34185d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 34195d4f98a2SYan Zheng struct rb_root *blocks) 34205d4f98a2SYan Zheng { 34215d4f98a2SYan Zheng struct btrfs_path *path; 34225d4f98a2SYan Zheng struct btrfs_key key; 34235d4f98a2SYan Zheng int ret; 3424aee68ee5SJosef Bacik bool skinny = btrfs_fs_incompat(rc->extent_root->fs_info, 3425aee68ee5SJosef Bacik SKINNY_METADATA); 34265d4f98a2SYan Zheng 34277476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 34285d4f98a2SYan Zheng return 0; 34295d4f98a2SYan Zheng 34305d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 34315d4f98a2SYan Zheng return 0; 34325d4f98a2SYan Zheng 34335d4f98a2SYan Zheng path = btrfs_alloc_path(); 34345d4f98a2SYan Zheng if (!path) 34355d4f98a2SYan Zheng return -ENOMEM; 3436aee68ee5SJosef Bacik again: 34375d4f98a2SYan Zheng key.objectid = bytenr; 3438aee68ee5SJosef Bacik if (skinny) { 3439aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3440aee68ee5SJosef Bacik key.offset = (u64)-1; 3441aee68ee5SJosef Bacik } else { 34425d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 34435d4f98a2SYan Zheng key.offset = blocksize; 3444aee68ee5SJosef Bacik } 34455d4f98a2SYan Zheng 34465d4f98a2SYan Zheng path->search_commit_root = 1; 34475d4f98a2SYan Zheng path->skip_locking = 1; 34485d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 34495d4f98a2SYan Zheng if (ret < 0) 34505d4f98a2SYan Zheng goto out; 34515d4f98a2SYan Zheng 3452aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3453aee68ee5SJosef Bacik if (path->slots[0]) { 3454aee68ee5SJosef Bacik path->slots[0]--; 3455aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3456aee68ee5SJosef Bacik path->slots[0]); 34573173a18fSJosef Bacik if (key.objectid == bytenr && 3458aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3459aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3460aee68ee5SJosef Bacik key.offset == blocksize))) 34613173a18fSJosef Bacik ret = 0; 34623173a18fSJosef Bacik } 3463aee68ee5SJosef Bacik 3464aee68ee5SJosef Bacik if (ret) { 3465aee68ee5SJosef Bacik skinny = false; 3466aee68ee5SJosef Bacik btrfs_release_path(path); 3467aee68ee5SJosef Bacik goto again; 3468aee68ee5SJosef Bacik } 3469aee68ee5SJosef Bacik } 34703173a18fSJosef Bacik BUG_ON(ret); 34713173a18fSJosef Bacik 34725d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 34735d4f98a2SYan Zheng out: 34745d4f98a2SYan Zheng btrfs_free_path(path); 34755d4f98a2SYan Zheng return ret; 34765d4f98a2SYan Zheng } 34775d4f98a2SYan Zheng 34785d4f98a2SYan Zheng /* 34795d4f98a2SYan Zheng * helper to check if the block use full backrefs for pointers in it 34805d4f98a2SYan Zheng */ 34815d4f98a2SYan Zheng static int block_use_full_backref(struct reloc_control *rc, 34825d4f98a2SYan Zheng struct extent_buffer *eb) 34835d4f98a2SYan Zheng { 34845d4f98a2SYan Zheng u64 flags; 34855d4f98a2SYan Zheng int ret; 34865d4f98a2SYan Zheng 34875d4f98a2SYan Zheng if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) || 34885d4f98a2SYan Zheng btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV) 34895d4f98a2SYan Zheng return 1; 34905d4f98a2SYan Zheng 34913fd0a558SYan, Zheng ret = btrfs_lookup_extent_info(NULL, rc->extent_root, 34923173a18fSJosef Bacik eb->start, btrfs_header_level(eb), 1, 34933173a18fSJosef Bacik NULL, &flags); 34945d4f98a2SYan Zheng BUG_ON(ret); 34955d4f98a2SYan Zheng 34965d4f98a2SYan Zheng if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) 34975d4f98a2SYan Zheng ret = 1; 34985d4f98a2SYan Zheng else 34995d4f98a2SYan Zheng ret = 0; 35005d4f98a2SYan Zheng return ret; 35015d4f98a2SYan Zheng } 35025d4f98a2SYan Zheng 35030af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 35041bbc621eSChris Mason struct btrfs_block_group_cache *block_group, 35051bbc621eSChris Mason struct inode *inode, 35061bbc621eSChris Mason u64 ino) 35070af3d00bSJosef Bacik { 35080af3d00bSJosef Bacik struct btrfs_key key; 35090af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 35100af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 35110af3d00bSJosef Bacik int ret = 0; 35120af3d00bSJosef Bacik 35130af3d00bSJosef Bacik if (inode) 35140af3d00bSJosef Bacik goto truncate; 35150af3d00bSJosef Bacik 35160af3d00bSJosef Bacik key.objectid = ino; 35170af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 35180af3d00bSJosef Bacik key.offset = 0; 35190af3d00bSJosef Bacik 35200af3d00bSJosef Bacik inode = btrfs_iget(fs_info->sb, &key, root, NULL); 3521f54fb859STsutomu Itoh if (IS_ERR(inode) || is_bad_inode(inode)) { 3522f54fb859STsutomu Itoh if (!IS_ERR(inode)) 35230af3d00bSJosef Bacik iput(inode); 35240af3d00bSJosef Bacik return -ENOENT; 35250af3d00bSJosef Bacik } 35260af3d00bSJosef Bacik 35270af3d00bSJosef Bacik truncate: 35287b61cd92SMiao Xie ret = btrfs_check_trunc_cache_free_space(root, 35297b61cd92SMiao Xie &fs_info->global_block_rsv); 35307b61cd92SMiao Xie if (ret) 35317b61cd92SMiao Xie goto out; 35327b61cd92SMiao Xie 35337a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 35340af3d00bSJosef Bacik if (IS_ERR(trans)) { 35353612b495STsutomu Itoh ret = PTR_ERR(trans); 35360af3d00bSJosef Bacik goto out; 35370af3d00bSJosef Bacik } 35380af3d00bSJosef Bacik 35391bbc621eSChris Mason ret = btrfs_truncate_free_space_cache(root, trans, block_group, inode); 35400af3d00bSJosef Bacik 35410af3d00bSJosef Bacik btrfs_end_transaction(trans, root); 3542b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 35430af3d00bSJosef Bacik out: 35440af3d00bSJosef Bacik iput(inode); 35450af3d00bSJosef Bacik return ret; 35460af3d00bSJosef Bacik } 35470af3d00bSJosef Bacik 35485d4f98a2SYan Zheng /* 35495d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY 35505d4f98a2SYan Zheng * this function scans fs tree to find blocks reference the data extent 35515d4f98a2SYan Zheng */ 35525d4f98a2SYan Zheng static int find_data_references(struct reloc_control *rc, 35535d4f98a2SYan Zheng struct btrfs_key *extent_key, 35545d4f98a2SYan Zheng struct extent_buffer *leaf, 35555d4f98a2SYan Zheng struct btrfs_extent_data_ref *ref, 35565d4f98a2SYan Zheng struct rb_root *blocks) 35575d4f98a2SYan Zheng { 35585d4f98a2SYan Zheng struct btrfs_path *path; 35595d4f98a2SYan Zheng struct tree_block *block; 35605d4f98a2SYan Zheng struct btrfs_root *root; 35615d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 35625d4f98a2SYan Zheng struct rb_node *rb_node; 35635d4f98a2SYan Zheng struct btrfs_key key; 35645d4f98a2SYan Zheng u64 ref_root; 35655d4f98a2SYan Zheng u64 ref_objectid; 35665d4f98a2SYan Zheng u64 ref_offset; 35675d4f98a2SYan Zheng u32 ref_count; 35685d4f98a2SYan Zheng u32 nritems; 35695d4f98a2SYan Zheng int err = 0; 35705d4f98a2SYan Zheng int added = 0; 35715d4f98a2SYan Zheng int counted; 35725d4f98a2SYan Zheng int ret; 35735d4f98a2SYan Zheng 35745d4f98a2SYan Zheng ref_root = btrfs_extent_data_ref_root(leaf, ref); 35755d4f98a2SYan Zheng ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref); 35765d4f98a2SYan Zheng ref_offset = btrfs_extent_data_ref_offset(leaf, ref); 35775d4f98a2SYan Zheng ref_count = btrfs_extent_data_ref_count(leaf, ref); 35785d4f98a2SYan Zheng 35790af3d00bSJosef Bacik /* 35800af3d00bSJosef Bacik * This is an extent belonging to the free space cache, lets just delete 35810af3d00bSJosef Bacik * it and redo the search. 35820af3d00bSJosef Bacik */ 35830af3d00bSJosef Bacik if (ref_root == BTRFS_ROOT_TREE_OBJECTID) { 35840af3d00bSJosef Bacik ret = delete_block_group_cache(rc->extent_root->fs_info, 35851bbc621eSChris Mason rc->block_group, 35860af3d00bSJosef Bacik NULL, ref_objectid); 35870af3d00bSJosef Bacik if (ret != -ENOENT) 35880af3d00bSJosef Bacik return ret; 35890af3d00bSJosef Bacik ret = 0; 35900af3d00bSJosef Bacik } 35910af3d00bSJosef Bacik 35920af3d00bSJosef Bacik path = btrfs_alloc_path(); 35930af3d00bSJosef Bacik if (!path) 35940af3d00bSJosef Bacik return -ENOMEM; 3595e4058b54SDavid Sterba path->reada = READA_FORWARD; 35960af3d00bSJosef Bacik 35975d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, ref_root); 35985d4f98a2SYan Zheng if (IS_ERR(root)) { 35995d4f98a2SYan Zheng err = PTR_ERR(root); 36005d4f98a2SYan Zheng goto out; 36015d4f98a2SYan Zheng } 36025d4f98a2SYan Zheng 36035d4f98a2SYan Zheng key.objectid = ref_objectid; 36045d4f98a2SYan Zheng key.type = BTRFS_EXTENT_DATA_KEY; 360584850e8dSYan, Zheng if (ref_offset > ((u64)-1 << 32)) 360684850e8dSYan, Zheng key.offset = 0; 360784850e8dSYan, Zheng else 360884850e8dSYan, Zheng key.offset = ref_offset; 36095d4f98a2SYan Zheng 36105d4f98a2SYan Zheng path->search_commit_root = 1; 36115d4f98a2SYan Zheng path->skip_locking = 1; 36125d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 36135d4f98a2SYan Zheng if (ret < 0) { 36145d4f98a2SYan Zheng err = ret; 36155d4f98a2SYan Zheng goto out; 36165d4f98a2SYan Zheng } 36175d4f98a2SYan Zheng 36185d4f98a2SYan Zheng leaf = path->nodes[0]; 36195d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 36205d4f98a2SYan Zheng /* 36215d4f98a2SYan Zheng * the references in tree blocks that use full backrefs 36225d4f98a2SYan Zheng * are not counted in 36235d4f98a2SYan Zheng */ 36245d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 36255d4f98a2SYan Zheng counted = 0; 36265d4f98a2SYan Zheng else 36275d4f98a2SYan Zheng counted = 1; 36285d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 36295d4f98a2SYan Zheng if (rb_node) { 36305d4f98a2SYan Zheng if (counted) 36315d4f98a2SYan Zheng added = 1; 36325d4f98a2SYan Zheng else 36335d4f98a2SYan Zheng path->slots[0] = nritems; 36345d4f98a2SYan Zheng } 36355d4f98a2SYan Zheng 36365d4f98a2SYan Zheng while (ref_count > 0) { 36375d4f98a2SYan Zheng while (path->slots[0] >= nritems) { 36385d4f98a2SYan Zheng ret = btrfs_next_leaf(root, path); 36395d4f98a2SYan Zheng if (ret < 0) { 36405d4f98a2SYan Zheng err = ret; 36415d4f98a2SYan Zheng goto out; 36425d4f98a2SYan Zheng } 3643fae7f21cSDulshani Gunawardhana if (WARN_ON(ret > 0)) 36445d4f98a2SYan Zheng goto out; 36455d4f98a2SYan Zheng 36465d4f98a2SYan Zheng leaf = path->nodes[0]; 36475d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 36485d4f98a2SYan Zheng added = 0; 36495d4f98a2SYan Zheng 36505d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 36515d4f98a2SYan Zheng counted = 0; 36525d4f98a2SYan Zheng else 36535d4f98a2SYan Zheng counted = 1; 36545d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 36555d4f98a2SYan Zheng if (rb_node) { 36565d4f98a2SYan Zheng if (counted) 36575d4f98a2SYan Zheng added = 1; 36585d4f98a2SYan Zheng else 36595d4f98a2SYan Zheng path->slots[0] = nritems; 36605d4f98a2SYan Zheng } 36615d4f98a2SYan Zheng } 36625d4f98a2SYan Zheng 36635d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 3664fae7f21cSDulshani Gunawardhana if (WARN_ON(key.objectid != ref_objectid || 3665fae7f21cSDulshani Gunawardhana key.type != BTRFS_EXTENT_DATA_KEY)) 36665d4f98a2SYan Zheng break; 36675d4f98a2SYan Zheng 36685d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 36695d4f98a2SYan Zheng struct btrfs_file_extent_item); 36705d4f98a2SYan Zheng 36715d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 36725d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 36735d4f98a2SYan Zheng goto next; 36745d4f98a2SYan Zheng 36755d4f98a2SYan Zheng if (btrfs_file_extent_disk_bytenr(leaf, fi) != 36765d4f98a2SYan Zheng extent_key->objectid) 36775d4f98a2SYan Zheng goto next; 36785d4f98a2SYan Zheng 36795d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 36805d4f98a2SYan Zheng if (key.offset != ref_offset) 36815d4f98a2SYan Zheng goto next; 36825d4f98a2SYan Zheng 36835d4f98a2SYan Zheng if (counted) 36845d4f98a2SYan Zheng ref_count--; 36855d4f98a2SYan Zheng if (added) 36865d4f98a2SYan Zheng goto next; 36875d4f98a2SYan Zheng 36887476dfdaSDavid Sterba if (!tree_block_processed(leaf->start, rc)) { 36895d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 36905d4f98a2SYan Zheng if (!block) { 36915d4f98a2SYan Zheng err = -ENOMEM; 36925d4f98a2SYan Zheng break; 36935d4f98a2SYan Zheng } 36945d4f98a2SYan Zheng block->bytenr = leaf->start; 36955d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &block->key, 0); 36965d4f98a2SYan Zheng block->level = 0; 36975d4f98a2SYan Zheng block->key_ready = 1; 36985d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, 36995d4f98a2SYan Zheng &block->rb_node); 370043c04fb1SJeff Mahoney if (rb_node) 370143c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 370243c04fb1SJeff Mahoney block->bytenr); 37035d4f98a2SYan Zheng } 37045d4f98a2SYan Zheng if (counted) 37055d4f98a2SYan Zheng added = 1; 37065d4f98a2SYan Zheng else 37075d4f98a2SYan Zheng path->slots[0] = nritems; 37085d4f98a2SYan Zheng next: 37095d4f98a2SYan Zheng path->slots[0]++; 37105d4f98a2SYan Zheng 37115d4f98a2SYan Zheng } 37125d4f98a2SYan Zheng out: 37135d4f98a2SYan Zheng btrfs_free_path(path); 37145d4f98a2SYan Zheng return err; 37155d4f98a2SYan Zheng } 37165d4f98a2SYan Zheng 37175d4f98a2SYan Zheng /* 37182c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 37195d4f98a2SYan Zheng */ 37205d4f98a2SYan Zheng static noinline_for_stack 37215d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 37225d4f98a2SYan Zheng struct btrfs_key *extent_key, 37235d4f98a2SYan Zheng struct btrfs_path *path, 37245d4f98a2SYan Zheng struct rb_root *blocks) 37255d4f98a2SYan Zheng { 37265d4f98a2SYan Zheng struct btrfs_key key; 37275d4f98a2SYan Zheng struct extent_buffer *eb; 37285d4f98a2SYan Zheng struct btrfs_extent_data_ref *dref; 37295d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 37305d4f98a2SYan Zheng unsigned long ptr; 37315d4f98a2SYan Zheng unsigned long end; 3732707e8a07SDavid Sterba u32 blocksize = rc->extent_root->nodesize; 3733647f63bdSFilipe David Borba Manana int ret = 0; 37345d4f98a2SYan Zheng int err = 0; 37355d4f98a2SYan Zheng 37365d4f98a2SYan Zheng eb = path->nodes[0]; 37375d4f98a2SYan Zheng ptr = btrfs_item_ptr_offset(eb, path->slots[0]); 37385d4f98a2SYan Zheng end = ptr + btrfs_item_size_nr(eb, path->slots[0]); 37395d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 37405d4f98a2SYan Zheng if (ptr + sizeof(struct btrfs_extent_item_v0) == end) 37415d4f98a2SYan Zheng ptr = end; 37425d4f98a2SYan Zheng else 37435d4f98a2SYan Zheng #endif 37445d4f98a2SYan Zheng ptr += sizeof(struct btrfs_extent_item); 37455d4f98a2SYan Zheng 37465d4f98a2SYan Zheng while (ptr < end) { 37475d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 37485d4f98a2SYan Zheng key.type = btrfs_extent_inline_ref_type(eb, iref); 37495d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 37505d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 37515d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 37525d4f98a2SYan Zheng blocks); 37535d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 37545d4f98a2SYan Zheng dref = (struct btrfs_extent_data_ref *)(&iref->offset); 37555d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 37565d4f98a2SYan Zheng eb, dref, blocks); 37575d4f98a2SYan Zheng } else { 37585d4f98a2SYan Zheng BUG(); 37595d4f98a2SYan Zheng } 3760647f63bdSFilipe David Borba Manana if (ret) { 3761647f63bdSFilipe David Borba Manana err = ret; 3762647f63bdSFilipe David Borba Manana goto out; 3763647f63bdSFilipe David Borba Manana } 37645d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 37655d4f98a2SYan Zheng } 37665d4f98a2SYan Zheng WARN_ON(ptr > end); 37675d4f98a2SYan Zheng 37685d4f98a2SYan Zheng while (1) { 37695d4f98a2SYan Zheng cond_resched(); 37705d4f98a2SYan Zheng eb = path->nodes[0]; 37715d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(eb)) { 37725d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 37735d4f98a2SYan Zheng if (ret < 0) { 37745d4f98a2SYan Zheng err = ret; 37755d4f98a2SYan Zheng break; 37765d4f98a2SYan Zheng } 37775d4f98a2SYan Zheng if (ret > 0) 37785d4f98a2SYan Zheng break; 37795d4f98a2SYan Zheng eb = path->nodes[0]; 37805d4f98a2SYan Zheng } 37815d4f98a2SYan Zheng 37825d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path->slots[0]); 37835d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 37845d4f98a2SYan Zheng break; 37855d4f98a2SYan Zheng 37865d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 37875d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY || 37885d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 37895d4f98a2SYan Zheng #else 37905d4f98a2SYan Zheng BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY); 37915d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 37925d4f98a2SYan Zheng #endif 37935d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 37945d4f98a2SYan Zheng blocks); 37955d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 37965d4f98a2SYan Zheng dref = btrfs_item_ptr(eb, path->slots[0], 37975d4f98a2SYan Zheng struct btrfs_extent_data_ref); 37985d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 37995d4f98a2SYan Zheng eb, dref, blocks); 38005d4f98a2SYan Zheng } else { 38015d4f98a2SYan Zheng ret = 0; 38025d4f98a2SYan Zheng } 38035d4f98a2SYan Zheng if (ret) { 38045d4f98a2SYan Zheng err = ret; 38055d4f98a2SYan Zheng break; 38065d4f98a2SYan Zheng } 38075d4f98a2SYan Zheng path->slots[0]++; 38085d4f98a2SYan Zheng } 3809647f63bdSFilipe David Borba Manana out: 3810b3b4aa74SDavid Sterba btrfs_release_path(path); 38115d4f98a2SYan Zheng if (err) 38125d4f98a2SYan Zheng free_block_list(blocks); 38135d4f98a2SYan Zheng return err; 38145d4f98a2SYan Zheng } 38155d4f98a2SYan Zheng 38165d4f98a2SYan Zheng /* 38172c016dc2SLiu Bo * helper to find next unprocessed extent 38185d4f98a2SYan Zheng */ 38195d4f98a2SYan Zheng static noinline_for_stack 3820147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 38213fd0a558SYan, Zheng struct btrfs_key *extent_key) 38225d4f98a2SYan Zheng { 38235d4f98a2SYan Zheng struct btrfs_key key; 38245d4f98a2SYan Zheng struct extent_buffer *leaf; 38255d4f98a2SYan Zheng u64 start, end, last; 38265d4f98a2SYan Zheng int ret; 38275d4f98a2SYan Zheng 38285d4f98a2SYan Zheng last = rc->block_group->key.objectid + rc->block_group->key.offset; 38295d4f98a2SYan Zheng while (1) { 38305d4f98a2SYan Zheng cond_resched(); 38315d4f98a2SYan Zheng if (rc->search_start >= last) { 38325d4f98a2SYan Zheng ret = 1; 38335d4f98a2SYan Zheng break; 38345d4f98a2SYan Zheng } 38355d4f98a2SYan Zheng 38365d4f98a2SYan Zheng key.objectid = rc->search_start; 38375d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 38385d4f98a2SYan Zheng key.offset = 0; 38395d4f98a2SYan Zheng 38405d4f98a2SYan Zheng path->search_commit_root = 1; 38415d4f98a2SYan Zheng path->skip_locking = 1; 38425d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 38435d4f98a2SYan Zheng 0, 0); 38445d4f98a2SYan Zheng if (ret < 0) 38455d4f98a2SYan Zheng break; 38465d4f98a2SYan Zheng next: 38475d4f98a2SYan Zheng leaf = path->nodes[0]; 38485d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 38495d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 38505d4f98a2SYan Zheng if (ret != 0) 38515d4f98a2SYan Zheng break; 38525d4f98a2SYan Zheng leaf = path->nodes[0]; 38535d4f98a2SYan Zheng } 38545d4f98a2SYan Zheng 38555d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 38565d4f98a2SYan Zheng if (key.objectid >= last) { 38575d4f98a2SYan Zheng ret = 1; 38585d4f98a2SYan Zheng break; 38595d4f98a2SYan Zheng } 38605d4f98a2SYan Zheng 38613173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 38623173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 38633173a18fSJosef Bacik path->slots[0]++; 38643173a18fSJosef Bacik goto next; 38653173a18fSJosef Bacik } 38663173a18fSJosef Bacik 38673173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 38685d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 38695d4f98a2SYan Zheng path->slots[0]++; 38705d4f98a2SYan Zheng goto next; 38715d4f98a2SYan Zheng } 38725d4f98a2SYan Zheng 38733173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 3874707e8a07SDavid Sterba key.objectid + rc->extent_root->nodesize <= 38753173a18fSJosef Bacik rc->search_start) { 38763173a18fSJosef Bacik path->slots[0]++; 38773173a18fSJosef Bacik goto next; 38783173a18fSJosef Bacik } 38793173a18fSJosef Bacik 38805d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 38815d4f98a2SYan Zheng key.objectid, &start, &end, 3882e6138876SJosef Bacik EXTENT_DIRTY, NULL); 38835d4f98a2SYan Zheng 38845d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3885b3b4aa74SDavid Sterba btrfs_release_path(path); 38865d4f98a2SYan Zheng rc->search_start = end + 1; 38875d4f98a2SYan Zheng } else { 38883173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 38895d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 38903173a18fSJosef Bacik else 38913173a18fSJosef Bacik rc->search_start = key.objectid + 3892707e8a07SDavid Sterba rc->extent_root->nodesize; 38933fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 38945d4f98a2SYan Zheng return 0; 38955d4f98a2SYan Zheng } 38965d4f98a2SYan Zheng } 3897b3b4aa74SDavid Sterba btrfs_release_path(path); 38985d4f98a2SYan Zheng return ret; 38995d4f98a2SYan Zheng } 39005d4f98a2SYan Zheng 39015d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 39025d4f98a2SYan Zheng { 39035d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39047585717fSChris Mason 39057585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39065d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 39077585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39085d4f98a2SYan Zheng } 39095d4f98a2SYan Zheng 39105d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 39115d4f98a2SYan Zheng { 39125d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39137585717fSChris Mason 39147585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39155d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 39167585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39175d4f98a2SYan Zheng } 39185d4f98a2SYan Zheng 39195d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 39205d4f98a2SYan Zheng { 39215d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39225d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39235d4f98a2SYan Zheng return 1; 39245d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 39255d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39265d4f98a2SYan Zheng return 1; 39275d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39285d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 39295d4f98a2SYan Zheng return 1; 39305d4f98a2SYan Zheng return 0; 39315d4f98a2SYan Zheng } 39325d4f98a2SYan Zheng 39333fd0a558SYan, Zheng static noinline_for_stack 39343fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 39353fd0a558SYan, Zheng { 39363fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3937ac2fabacSJosef Bacik int ret; 39383fd0a558SYan, Zheng 393966d8f3ddSMiao Xie rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root, 394066d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 39413fd0a558SYan, Zheng if (!rc->block_rsv) 39423fd0a558SYan, Zheng return -ENOMEM; 39433fd0a558SYan, Zheng 39443fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 39453fd0a558SYan, Zheng rc->search_start = rc->block_group->key.objectid; 39463fd0a558SYan, Zheng rc->extents_found = 0; 39473fd0a558SYan, Zheng rc->nodes_relocated = 0; 39483fd0a558SYan, Zheng rc->merging_rsv_size = 0; 39490647bf56SWang Shilong rc->reserved_bytes = 0; 39500647bf56SWang Shilong rc->block_rsv->size = rc->extent_root->nodesize * 39510647bf56SWang Shilong RELOCATION_RESERVED_NODES; 3952ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 3953ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3954ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3955ac2fabacSJosef Bacik if (ret) 3956ac2fabacSJosef Bacik return ret; 39573fd0a558SYan, Zheng 39583fd0a558SYan, Zheng rc->create_reloc_tree = 1; 39593fd0a558SYan, Zheng set_reloc_control(rc); 39603fd0a558SYan, Zheng 39617a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 396228818947SLiu Bo if (IS_ERR(trans)) { 396328818947SLiu Bo unset_reloc_control(rc); 396428818947SLiu Bo /* 396528818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 396628818947SLiu Bo * cleanup. And callers are responsible to free the above 396728818947SLiu Bo * block rsv. 396828818947SLiu Bo */ 396928818947SLiu Bo return PTR_ERR(trans); 397028818947SLiu Bo } 39713fd0a558SYan, Zheng btrfs_commit_transaction(trans, rc->extent_root); 39723fd0a558SYan, Zheng return 0; 39733fd0a558SYan, Zheng } 397476dda93cSYan, Zheng 39755d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 39765d4f98a2SYan Zheng { 39775d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 39785d4f98a2SYan Zheng struct btrfs_key key; 39795d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 39805d4f98a2SYan Zheng struct btrfs_path *path; 39815d4f98a2SYan Zheng struct btrfs_extent_item *ei; 39825d4f98a2SYan Zheng u64 flags; 39835d4f98a2SYan Zheng u32 item_size; 39845d4f98a2SYan Zheng int ret; 39855d4f98a2SYan Zheng int err = 0; 3986c87f08caSChris Mason int progress = 0; 39875d4f98a2SYan Zheng 39885d4f98a2SYan Zheng path = btrfs_alloc_path(); 39893fd0a558SYan, Zheng if (!path) 39905d4f98a2SYan Zheng return -ENOMEM; 3991e4058b54SDavid Sterba path->reada = READA_FORWARD; 39923fd0a558SYan, Zheng 39933fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 39943fd0a558SYan, Zheng if (ret) { 39953fd0a558SYan, Zheng err = ret; 39963fd0a558SYan, Zheng goto out_free; 39972423fdfbSJiri Slaby } 39985d4f98a2SYan Zheng 39995d4f98a2SYan Zheng while (1) { 40000647bf56SWang Shilong rc->reserved_bytes = 0; 40010647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 40020647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 40030647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 40040647bf56SWang Shilong if (ret) { 40050647bf56SWang Shilong err = ret; 40060647bf56SWang Shilong break; 40070647bf56SWang Shilong } 4008c87f08caSChris Mason progress++; 4009a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 40100f788c58SLiu Bo if (IS_ERR(trans)) { 40110f788c58SLiu Bo err = PTR_ERR(trans); 40120f788c58SLiu Bo trans = NULL; 40130f788c58SLiu Bo break; 40140f788c58SLiu Bo } 4015c87f08caSChris Mason restart: 40163fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 40173fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 40183fd0a558SYan, Zheng continue; 40193fd0a558SYan, Zheng } 40203fd0a558SYan, Zheng 4021147d256eSZhaolei ret = find_next_extent(rc, path, &key); 40225d4f98a2SYan Zheng if (ret < 0) 40235d4f98a2SYan Zheng err = ret; 40245d4f98a2SYan Zheng if (ret != 0) 40255d4f98a2SYan Zheng break; 40265d4f98a2SYan Zheng 40275d4f98a2SYan Zheng rc->extents_found++; 40285d4f98a2SYan Zheng 40295d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 40305d4f98a2SYan Zheng struct btrfs_extent_item); 40313fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 40325d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 40335d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 40345d4f98a2SYan Zheng ret = check_extent_flags(flags); 40355d4f98a2SYan Zheng BUG_ON(ret); 40365d4f98a2SYan Zheng 40375d4f98a2SYan Zheng } else { 40385d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 40395d4f98a2SYan Zheng u64 ref_owner; 40405d4f98a2SYan Zheng int path_change = 0; 40415d4f98a2SYan Zheng 40425d4f98a2SYan Zheng BUG_ON(item_size != 40435d4f98a2SYan Zheng sizeof(struct btrfs_extent_item_v0)); 40445d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, &key, &ref_owner, 40455d4f98a2SYan Zheng &path_change); 40464b3576e4SZhaolei if (ret < 0) { 40474b3576e4SZhaolei err = ret; 40484b3576e4SZhaolei break; 40494b3576e4SZhaolei } 40505d4f98a2SYan Zheng if (ref_owner < BTRFS_FIRST_FREE_OBJECTID) 40515d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_TREE_BLOCK; 40525d4f98a2SYan Zheng else 40535d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_DATA; 40545d4f98a2SYan Zheng 40555d4f98a2SYan Zheng if (path_change) { 4056b3b4aa74SDavid Sterba btrfs_release_path(path); 40575d4f98a2SYan Zheng 40585d4f98a2SYan Zheng path->search_commit_root = 1; 40595d4f98a2SYan Zheng path->skip_locking = 1; 40605d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, 40615d4f98a2SYan Zheng &key, path, 0, 0); 40625d4f98a2SYan Zheng if (ret < 0) { 40635d4f98a2SYan Zheng err = ret; 40645d4f98a2SYan Zheng break; 40655d4f98a2SYan Zheng } 40665d4f98a2SYan Zheng BUG_ON(ret > 0); 40675d4f98a2SYan Zheng } 40685d4f98a2SYan Zheng #else 40695d4f98a2SYan Zheng BUG(); 40705d4f98a2SYan Zheng #endif 40715d4f98a2SYan Zheng } 40725d4f98a2SYan Zheng 40735d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 40745d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 40755d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 40765d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40775d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 40785d4f98a2SYan Zheng } else { 4079b3b4aa74SDavid Sterba btrfs_release_path(path); 40805d4f98a2SYan Zheng ret = 0; 40815d4f98a2SYan Zheng } 40825d4f98a2SYan Zheng if (ret < 0) { 40833fd0a558SYan, Zheng err = ret; 40845d4f98a2SYan Zheng break; 40855d4f98a2SYan Zheng } 40865d4f98a2SYan Zheng 40875d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 40885d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 40895d4f98a2SYan Zheng if (ret < 0) { 40901708cc57SWang Shilong /* 40911708cc57SWang Shilong * if we fail to relocate tree blocks, force to update 40921708cc57SWang Shilong * backref cache when committing transaction. 40931708cc57SWang Shilong */ 40941708cc57SWang Shilong rc->backref_cache.last_trans = trans->transid - 1; 40951708cc57SWang Shilong 40963fd0a558SYan, Zheng if (ret != -EAGAIN) { 40975d4f98a2SYan Zheng err = ret; 40985d4f98a2SYan Zheng break; 40995d4f98a2SYan Zheng } 41003fd0a558SYan, Zheng rc->extents_found--; 41013fd0a558SYan, Zheng rc->search_start = key.objectid; 41023fd0a558SYan, Zheng } 41035d4f98a2SYan Zheng } 41045d4f98a2SYan Zheng 41053fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, rc->extent_root); 4106b53d3f5dSLiu Bo btrfs_btree_balance_dirty(rc->extent_root); 41073fd0a558SYan, Zheng trans = NULL; 41085d4f98a2SYan Zheng 41095d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 41105d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 41115d4f98a2SYan Zheng rc->found_file_extent = 1; 41120257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 41133fd0a558SYan, Zheng &key, &rc->cluster); 41145d4f98a2SYan Zheng if (ret < 0) { 41155d4f98a2SYan Zheng err = ret; 41165d4f98a2SYan Zheng break; 41175d4f98a2SYan Zheng } 41185d4f98a2SYan Zheng } 41195d4f98a2SYan Zheng } 4120c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 4121c87f08caSChris Mason ret = btrfs_force_chunk_alloc(trans, rc->extent_root, 4122c87f08caSChris Mason rc->block_group->flags); 41239689457bSShilong Wang if (ret == 1) { 4124c87f08caSChris Mason err = 0; 4125c87f08caSChris Mason progress = 0; 4126c87f08caSChris Mason goto restart; 4127c87f08caSChris Mason } 4128c87f08caSChris Mason } 41293fd0a558SYan, Zheng 4130b3b4aa74SDavid Sterba btrfs_release_path(path); 413191166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 41325d4f98a2SYan Zheng 41335d4f98a2SYan Zheng if (trans) { 41343fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, rc->extent_root); 4135b53d3f5dSLiu Bo btrfs_btree_balance_dirty(rc->extent_root); 41365d4f98a2SYan Zheng } 41375d4f98a2SYan Zheng 41380257bb82SYan, Zheng if (!err) { 41393fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 41403fd0a558SYan, Zheng &rc->cluster); 41410257bb82SYan, Zheng if (ret < 0) 41420257bb82SYan, Zheng err = ret; 41430257bb82SYan, Zheng } 41440257bb82SYan, Zheng 41453fd0a558SYan, Zheng rc->create_reloc_tree = 0; 41463fd0a558SYan, Zheng set_reloc_control(rc); 41470257bb82SYan, Zheng 41483fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 41493fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1); 41505d4f98a2SYan Zheng 41513fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 41525d4f98a2SYan Zheng 41535d4f98a2SYan Zheng merge_reloc_roots(rc); 41545d4f98a2SYan Zheng 41553fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 41565d4f98a2SYan Zheng unset_reloc_control(rc); 41573fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1); 41585d4f98a2SYan Zheng 41595d4f98a2SYan Zheng /* get rid of pinned extents */ 41607a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 416162b99540SQu Wenruo if (IS_ERR(trans)) { 41623612b495STsutomu Itoh err = PTR_ERR(trans); 416362b99540SQu Wenruo goto out_free; 416462b99540SQu Wenruo } 41655d4f98a2SYan Zheng btrfs_commit_transaction(trans, rc->extent_root); 41663fd0a558SYan, Zheng out_free: 41673fd0a558SYan, Zheng btrfs_free_block_rsv(rc->extent_root, rc->block_rsv); 41683fd0a558SYan, Zheng btrfs_free_path(path); 41695d4f98a2SYan Zheng return err; 41705d4f98a2SYan Zheng } 41715d4f98a2SYan Zheng 41725d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 41730257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 41745d4f98a2SYan Zheng { 41755d4f98a2SYan Zheng struct btrfs_path *path; 41765d4f98a2SYan Zheng struct btrfs_inode_item *item; 41775d4f98a2SYan Zheng struct extent_buffer *leaf; 41785d4f98a2SYan Zheng int ret; 41795d4f98a2SYan Zheng 41805d4f98a2SYan Zheng path = btrfs_alloc_path(); 41815d4f98a2SYan Zheng if (!path) 41825d4f98a2SYan Zheng return -ENOMEM; 41835d4f98a2SYan Zheng 41845d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 41855d4f98a2SYan Zheng if (ret) 41865d4f98a2SYan Zheng goto out; 41875d4f98a2SYan Zheng 41885d4f98a2SYan Zheng leaf = path->nodes[0]; 41895d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 4190b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 41915d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 41920257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 41935d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 41943fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 41953fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 41965d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 41975d4f98a2SYan Zheng out: 41985d4f98a2SYan Zheng btrfs_free_path(path); 41995d4f98a2SYan Zheng return ret; 42005d4f98a2SYan Zheng } 42015d4f98a2SYan Zheng 42025d4f98a2SYan Zheng /* 42035d4f98a2SYan Zheng * helper to create inode for data relocation. 42045d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 42055d4f98a2SYan Zheng */ 42063fd0a558SYan, Zheng static noinline_for_stack 42073fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 42085d4f98a2SYan Zheng struct btrfs_block_group_cache *group) 42095d4f98a2SYan Zheng { 42105d4f98a2SYan Zheng struct inode *inode = NULL; 42115d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 42125d4f98a2SYan Zheng struct btrfs_root *root; 42135d4f98a2SYan Zheng struct btrfs_key key; 42144624900dSZhaolei u64 objectid; 42155d4f98a2SYan Zheng int err = 0; 42165d4f98a2SYan Zheng 42175d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 42185d4f98a2SYan Zheng if (IS_ERR(root)) 42195d4f98a2SYan Zheng return ERR_CAST(root); 42205d4f98a2SYan Zheng 4221a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 42223fd0a558SYan, Zheng if (IS_ERR(trans)) 42233fd0a558SYan, Zheng return ERR_CAST(trans); 42245d4f98a2SYan Zheng 4225581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 42265d4f98a2SYan Zheng if (err) 42275d4f98a2SYan Zheng goto out; 42285d4f98a2SYan Zheng 42290257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 42305d4f98a2SYan Zheng BUG_ON(err); 42315d4f98a2SYan Zheng 42325d4f98a2SYan Zheng key.objectid = objectid; 42335d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 42345d4f98a2SYan Zheng key.offset = 0; 423573f73415SJosef Bacik inode = btrfs_iget(root->fs_info->sb, &key, root, NULL); 42365d4f98a2SYan Zheng BUG_ON(IS_ERR(inode) || is_bad_inode(inode)); 42375d4f98a2SYan Zheng BTRFS_I(inode)->index_cnt = group->key.objectid; 42385d4f98a2SYan Zheng 42395d4f98a2SYan Zheng err = btrfs_orphan_add(trans, inode); 42405d4f98a2SYan Zheng out: 42415d4f98a2SYan Zheng btrfs_end_transaction(trans, root); 4242b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 42435d4f98a2SYan Zheng if (err) { 42445d4f98a2SYan Zheng if (inode) 42455d4f98a2SYan Zheng iput(inode); 42465d4f98a2SYan Zheng inode = ERR_PTR(err); 42475d4f98a2SYan Zheng } 42485d4f98a2SYan Zheng return inode; 42495d4f98a2SYan Zheng } 42505d4f98a2SYan Zheng 4251a9995eecSJosef Bacik static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 42523fd0a558SYan, Zheng { 42533fd0a558SYan, Zheng struct reloc_control *rc; 42543fd0a558SYan, Zheng 42553fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 42563fd0a558SYan, Zheng if (!rc) 42573fd0a558SYan, Zheng return NULL; 42583fd0a558SYan, Zheng 42593fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 42603fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 42613fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 4262a9995eecSJosef Bacik extent_io_tree_init(&rc->processed_blocks, 4263a9995eecSJosef Bacik fs_info->btree_inode->i_mapping); 42643fd0a558SYan, Zheng return rc; 42653fd0a558SYan, Zheng } 42663fd0a558SYan, Zheng 42675d4f98a2SYan Zheng /* 4268ebce0e01SAdam Borowski * Print the block group being relocated 4269ebce0e01SAdam Borowski */ 4270ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 4271ebce0e01SAdam Borowski struct btrfs_block_group_cache *block_group) 4272ebce0e01SAdam Borowski { 4273ebce0e01SAdam Borowski char buf[128]; /* prefixed by a '|' that'll be dropped */ 4274ebce0e01SAdam Borowski u64 flags = block_group->flags; 4275ebce0e01SAdam Borowski 4276ebce0e01SAdam Borowski /* Shouldn't happen */ 4277ebce0e01SAdam Borowski if (!flags) { 4278ebce0e01SAdam Borowski strcpy(buf, "|NONE"); 4279ebce0e01SAdam Borowski } else { 4280ebce0e01SAdam Borowski char *bp = buf; 4281ebce0e01SAdam Borowski 4282ebce0e01SAdam Borowski #define DESCRIBE_FLAG(f, d) \ 4283ebce0e01SAdam Borowski if (flags & BTRFS_BLOCK_GROUP_##f) { \ 4284ebce0e01SAdam Borowski bp += snprintf(bp, buf - bp + sizeof(buf), "|%s", d); \ 4285ebce0e01SAdam Borowski flags &= ~BTRFS_BLOCK_GROUP_##f; \ 4286ebce0e01SAdam Borowski } 4287ebce0e01SAdam Borowski DESCRIBE_FLAG(DATA, "data"); 4288ebce0e01SAdam Borowski DESCRIBE_FLAG(SYSTEM, "system"); 4289ebce0e01SAdam Borowski DESCRIBE_FLAG(METADATA, "metadata"); 4290ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID0, "raid0"); 4291ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID1, "raid1"); 4292ebce0e01SAdam Borowski DESCRIBE_FLAG(DUP, "dup"); 4293ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID10, "raid10"); 4294ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID5, "raid5"); 4295ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID6, "raid6"); 4296ebce0e01SAdam Borowski if (flags) 4297ebce0e01SAdam Borowski snprintf(buf, buf - bp + sizeof(buf), "|0x%llx", flags); 4298ebce0e01SAdam Borowski #undef DESCRIBE_FLAG 4299ebce0e01SAdam Borowski } 4300ebce0e01SAdam Borowski 4301ebce0e01SAdam Borowski btrfs_info(fs_info, 4302ebce0e01SAdam Borowski "relocating block group %llu flags %s", 4303ebce0e01SAdam Borowski block_group->key.objectid, buf + 1); 4304ebce0e01SAdam Borowski } 4305ebce0e01SAdam Borowski 4306ebce0e01SAdam Borowski /* 43075d4f98a2SYan Zheng * function to relocate all extents in a block group. 43085d4f98a2SYan Zheng */ 4309*6bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 43105d4f98a2SYan Zheng { 4311*6bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 43125d4f98a2SYan Zheng struct reloc_control *rc; 43130af3d00bSJosef Bacik struct inode *inode; 43140af3d00bSJosef Bacik struct btrfs_path *path; 43155d4f98a2SYan Zheng int ret; 4316f0486c68SYan, Zheng int rw = 0; 43175d4f98a2SYan Zheng int err = 0; 43185d4f98a2SYan Zheng 4319a9995eecSJosef Bacik rc = alloc_reloc_control(fs_info); 43205d4f98a2SYan Zheng if (!rc) 43215d4f98a2SYan Zheng return -ENOMEM; 43225d4f98a2SYan Zheng 4323f0486c68SYan, Zheng rc->extent_root = extent_root; 43243fd0a558SYan, Zheng 43255d4f98a2SYan Zheng rc->block_group = btrfs_lookup_block_group(fs_info, group_start); 43265d4f98a2SYan Zheng BUG_ON(!rc->block_group); 43275d4f98a2SYan Zheng 4328868f401aSZhaolei ret = btrfs_inc_block_group_ro(extent_root, rc->block_group); 4329f0486c68SYan, Zheng if (ret) { 4330f0486c68SYan, Zheng err = ret; 4331f0486c68SYan, Zheng goto out; 4332f0486c68SYan, Zheng } 4333f0486c68SYan, Zheng rw = 1; 4334f0486c68SYan, Zheng 43350af3d00bSJosef Bacik path = btrfs_alloc_path(); 43360af3d00bSJosef Bacik if (!path) { 43370af3d00bSJosef Bacik err = -ENOMEM; 43380af3d00bSJosef Bacik goto out; 43390af3d00bSJosef Bacik } 43400af3d00bSJosef Bacik 43410af3d00bSJosef Bacik inode = lookup_free_space_inode(fs_info->tree_root, rc->block_group, 43420af3d00bSJosef Bacik path); 43430af3d00bSJosef Bacik btrfs_free_path(path); 43440af3d00bSJosef Bacik 43450af3d00bSJosef Bacik if (!IS_ERR(inode)) 43461bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 43470af3d00bSJosef Bacik else 43480af3d00bSJosef Bacik ret = PTR_ERR(inode); 43490af3d00bSJosef Bacik 43500af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 43510af3d00bSJosef Bacik err = ret; 43520af3d00bSJosef Bacik goto out; 43530af3d00bSJosef Bacik } 43540af3d00bSJosef Bacik 43555d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 43565d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 43575d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 43585d4f98a2SYan Zheng rc->data_inode = NULL; 43595d4f98a2SYan Zheng goto out; 43605d4f98a2SYan Zheng } 43615d4f98a2SYan Zheng 4362ebce0e01SAdam Borowski describe_relocation(extent_root->fs_info, rc->block_group); 43635d4f98a2SYan Zheng 43649cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4365f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 4366578def7cSFilipe Manana btrfs_wait_ordered_roots(fs_info, -1, 4367578def7cSFilipe Manana rc->block_group->key.objectid, 4368578def7cSFilipe Manana rc->block_group->key.offset); 43695d4f98a2SYan Zheng 43705d4f98a2SYan Zheng while (1) { 437176dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 43725d4f98a2SYan Zheng ret = relocate_block_group(rc); 437376dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 43745d4f98a2SYan Zheng if (ret < 0) { 43755d4f98a2SYan Zheng err = ret; 43763fd0a558SYan, Zheng goto out; 43775d4f98a2SYan Zheng } 43785d4f98a2SYan Zheng 43795d4f98a2SYan Zheng if (rc->extents_found == 0) 43805d4f98a2SYan Zheng break; 43815d4f98a2SYan Zheng 4382efe120a0SFrank Holton btrfs_info(extent_root->fs_info, "found %llu extents", 4383c1c9ff7cSGeert Uytterhoeven rc->extents_found); 43845d4f98a2SYan Zheng 43855d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 43860ef8b726SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 43870ef8b726SJosef Bacik (u64)-1); 43880ef8b726SJosef Bacik if (ret) { 43890ef8b726SJosef Bacik err = ret; 43900ef8b726SJosef Bacik goto out; 43910ef8b726SJosef Bacik } 43925d4f98a2SYan Zheng invalidate_mapping_pages(rc->data_inode->i_mapping, 43935d4f98a2SYan Zheng 0, -1); 43945d4f98a2SYan Zheng rc->stage = UPDATE_DATA_PTRS; 43955d4f98a2SYan Zheng } 43965d4f98a2SYan Zheng } 43975d4f98a2SYan Zheng 43985d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 43995d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 44005d4f98a2SYan Zheng WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0); 44015d4f98a2SYan Zheng out: 4402f0486c68SYan, Zheng if (err && rw) 4403868f401aSZhaolei btrfs_dec_block_group_ro(extent_root, rc->block_group); 44045d4f98a2SYan Zheng iput(rc->data_inode); 44055d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 44065d4f98a2SYan Zheng kfree(rc); 44075d4f98a2SYan Zheng return err; 44085d4f98a2SYan Zheng } 44095d4f98a2SYan Zheng 441076dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 441176dda93cSYan, Zheng { 441276dda93cSYan, Zheng struct btrfs_trans_handle *trans; 441379787eaaSJeff Mahoney int ret, err; 441476dda93cSYan, Zheng 4415a22285a6SYan, Zheng trans = btrfs_start_transaction(root->fs_info->tree_root, 0); 441679787eaaSJeff Mahoney if (IS_ERR(trans)) 441779787eaaSJeff Mahoney return PTR_ERR(trans); 441876dda93cSYan, Zheng 441976dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 442076dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 442176dda93cSYan, Zheng root->root_item.drop_level = 0; 442276dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 442376dda93cSYan, Zheng ret = btrfs_update_root(trans, root->fs_info->tree_root, 442476dda93cSYan, Zheng &root->root_key, &root->root_item); 442576dda93cSYan, Zheng 442679787eaaSJeff Mahoney err = btrfs_end_transaction(trans, root->fs_info->tree_root); 442779787eaaSJeff Mahoney if (err) 442879787eaaSJeff Mahoney return err; 442979787eaaSJeff Mahoney return ret; 443076dda93cSYan, Zheng } 443176dda93cSYan, Zheng 44325d4f98a2SYan Zheng /* 44335d4f98a2SYan Zheng * recover relocation interrupted by system crash. 44345d4f98a2SYan Zheng * 44355d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 44365d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 44375d4f98a2SYan Zheng */ 44385d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 44395d4f98a2SYan Zheng { 44405d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 44415d4f98a2SYan Zheng struct btrfs_key key; 44425d4f98a2SYan Zheng struct btrfs_root *fs_root; 44435d4f98a2SYan Zheng struct btrfs_root *reloc_root; 44445d4f98a2SYan Zheng struct btrfs_path *path; 44455d4f98a2SYan Zheng struct extent_buffer *leaf; 44465d4f98a2SYan Zheng struct reloc_control *rc = NULL; 44475d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 44485d4f98a2SYan Zheng int ret; 44495d4f98a2SYan Zheng int err = 0; 44505d4f98a2SYan Zheng 44515d4f98a2SYan Zheng path = btrfs_alloc_path(); 44525d4f98a2SYan Zheng if (!path) 44535d4f98a2SYan Zheng return -ENOMEM; 4454e4058b54SDavid Sterba path->reada = READA_BACK; 44555d4f98a2SYan Zheng 44565d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 44575d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 44585d4f98a2SYan Zheng key.offset = (u64)-1; 44595d4f98a2SYan Zheng 44605d4f98a2SYan Zheng while (1) { 44615d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key, 44625d4f98a2SYan Zheng path, 0, 0); 44635d4f98a2SYan Zheng if (ret < 0) { 44645d4f98a2SYan Zheng err = ret; 44655d4f98a2SYan Zheng goto out; 44665d4f98a2SYan Zheng } 44675d4f98a2SYan Zheng if (ret > 0) { 44685d4f98a2SYan Zheng if (path->slots[0] == 0) 44695d4f98a2SYan Zheng break; 44705d4f98a2SYan Zheng path->slots[0]--; 44715d4f98a2SYan Zheng } 44725d4f98a2SYan Zheng leaf = path->nodes[0]; 44735d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4474b3b4aa74SDavid Sterba btrfs_release_path(path); 44755d4f98a2SYan Zheng 44765d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 44775d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 44785d4f98a2SYan Zheng break; 44795d4f98a2SYan Zheng 4480cb517eabSMiao Xie reloc_root = btrfs_read_fs_root(root, &key); 44815d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 44825d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 44835d4f98a2SYan Zheng goto out; 44845d4f98a2SYan Zheng } 44855d4f98a2SYan Zheng 44865d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 44875d4f98a2SYan Zheng 44885d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 44895d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 44905d4f98a2SYan Zheng reloc_root->root_key.offset); 44915d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 449276dda93cSYan, Zheng ret = PTR_ERR(fs_root); 449376dda93cSYan, Zheng if (ret != -ENOENT) { 449476dda93cSYan, Zheng err = ret; 44955d4f98a2SYan Zheng goto out; 44965d4f98a2SYan Zheng } 449779787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 449879787eaaSJeff Mahoney if (ret < 0) { 449979787eaaSJeff Mahoney err = ret; 450079787eaaSJeff Mahoney goto out; 450179787eaaSJeff Mahoney } 450276dda93cSYan, Zheng } 45035d4f98a2SYan Zheng } 45045d4f98a2SYan Zheng 45055d4f98a2SYan Zheng if (key.offset == 0) 45065d4f98a2SYan Zheng break; 45075d4f98a2SYan Zheng 45085d4f98a2SYan Zheng key.offset--; 45095d4f98a2SYan Zheng } 4510b3b4aa74SDavid Sterba btrfs_release_path(path); 45115d4f98a2SYan Zheng 45125d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 45135d4f98a2SYan Zheng goto out; 45145d4f98a2SYan Zheng 4515a9995eecSJosef Bacik rc = alloc_reloc_control(root->fs_info); 45165d4f98a2SYan Zheng if (!rc) { 45175d4f98a2SYan Zheng err = -ENOMEM; 45185d4f98a2SYan Zheng goto out; 45195d4f98a2SYan Zheng } 45205d4f98a2SYan Zheng 45215d4f98a2SYan Zheng rc->extent_root = root->fs_info->extent_root; 45225d4f98a2SYan Zheng 45235d4f98a2SYan Zheng set_reloc_control(rc); 45245d4f98a2SYan Zheng 45257a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 45263612b495STsutomu Itoh if (IS_ERR(trans)) { 45273612b495STsutomu Itoh unset_reloc_control(rc); 45283612b495STsutomu Itoh err = PTR_ERR(trans); 45293612b495STsutomu Itoh goto out_free; 45303612b495STsutomu Itoh } 45313fd0a558SYan, Zheng 45323fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 45333fd0a558SYan, Zheng 45345d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 45355d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 45365d4f98a2SYan Zheng struct btrfs_root, root_list); 45375d4f98a2SYan Zheng list_del(&reloc_root->root_list); 45385d4f98a2SYan Zheng 45395d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 45405d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 45415d4f98a2SYan Zheng &rc->reloc_roots); 45425d4f98a2SYan Zheng continue; 45435d4f98a2SYan Zheng } 45445d4f98a2SYan Zheng 45455d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 45465d4f98a2SYan Zheng reloc_root->root_key.offset); 454779787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 454879787eaaSJeff Mahoney err = PTR_ERR(fs_root); 454979787eaaSJeff Mahoney goto out_free; 455079787eaaSJeff Mahoney } 45515d4f98a2SYan Zheng 4552ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 455379787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 45545d4f98a2SYan Zheng fs_root->reloc_root = reloc_root; 45555d4f98a2SYan Zheng } 45565d4f98a2SYan Zheng 455779787eaaSJeff Mahoney err = btrfs_commit_transaction(trans, rc->extent_root); 455879787eaaSJeff Mahoney if (err) 455979787eaaSJeff Mahoney goto out_free; 45605d4f98a2SYan Zheng 45615d4f98a2SYan Zheng merge_reloc_roots(rc); 45625d4f98a2SYan Zheng 45635d4f98a2SYan Zheng unset_reloc_control(rc); 45645d4f98a2SYan Zheng 45657a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 456662b99540SQu Wenruo if (IS_ERR(trans)) { 45673612b495STsutomu Itoh err = PTR_ERR(trans); 456862b99540SQu Wenruo goto out_free; 456962b99540SQu Wenruo } 457079787eaaSJeff Mahoney err = btrfs_commit_transaction(trans, rc->extent_root); 45713612b495STsutomu Itoh out_free: 45725d4f98a2SYan Zheng kfree(rc); 45733612b495STsutomu Itoh out: 4574aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4575aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4576aca1bba6SLiu Bo 45775d4f98a2SYan Zheng btrfs_free_path(path); 45785d4f98a2SYan Zheng 45795d4f98a2SYan Zheng if (err == 0) { 45805d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 45815d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 45825d4f98a2SYan Zheng BTRFS_DATA_RELOC_TREE_OBJECTID); 45835d4f98a2SYan Zheng if (IS_ERR(fs_root)) 45845d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4585d7ce5843SMiao Xie else 458666b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 45875d4f98a2SYan Zheng } 45885d4f98a2SYan Zheng return err; 45895d4f98a2SYan Zheng } 45905d4f98a2SYan Zheng 45915d4f98a2SYan Zheng /* 45925d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 45935d4f98a2SYan Zheng * 45945d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 45955d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 45965d4f98a2SYan Zheng */ 45975d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 45985d4f98a2SYan Zheng { 45995d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 46005d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 46015d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(inode)->root; 46025d4f98a2SYan Zheng int ret; 46035d4f98a2SYan Zheng u64 disk_bytenr; 46044577b014SJosef Bacik u64 new_bytenr; 46055d4f98a2SYan Zheng LIST_HEAD(list); 46065d4f98a2SYan Zheng 46075d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 46085d4f98a2SYan Zheng BUG_ON(ordered->file_offset != file_pos || ordered->len != len); 46095d4f98a2SYan Zheng 46105d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 46115d4f98a2SYan Zheng ret = btrfs_lookup_csums_range(root->fs_info->csum_root, disk_bytenr, 4612a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 461379787eaaSJeff Mahoney if (ret) 461479787eaaSJeff Mahoney goto out; 46155d4f98a2SYan Zheng 46165d4f98a2SYan Zheng while (!list_empty(&list)) { 46175d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 46185d4f98a2SYan Zheng list_del_init(&sums->list); 46195d4f98a2SYan Zheng 46204577b014SJosef Bacik /* 46214577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 46224577b014SJosef Bacik * We need to do this because we will read in entire prealloc 46234577b014SJosef Bacik * extents but we may have written to say the middle of the 46244577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 46254577b014SJosef Bacik * the right disk offset. 46264577b014SJosef Bacik * 46274577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 46284577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 46294577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 46304577b014SJosef Bacik * disk length. 46314577b014SJosef Bacik */ 46324577b014SJosef Bacik new_bytenr = ordered->start + (sums->bytenr - disk_bytenr); 46334577b014SJosef Bacik sums->bytenr = new_bytenr; 46345d4f98a2SYan Zheng 46355d4f98a2SYan Zheng btrfs_add_ordered_sum(inode, ordered, sums); 46365d4f98a2SYan Zheng } 463779787eaaSJeff Mahoney out: 46385d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4639411fc6bcSAndi Kleen return ret; 46405d4f98a2SYan Zheng } 46413fd0a558SYan, Zheng 464283d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 46433fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 46443fd0a558SYan, Zheng struct extent_buffer *cow) 46453fd0a558SYan, Zheng { 46463fd0a558SYan, Zheng struct reloc_control *rc; 46473fd0a558SYan, Zheng struct backref_node *node; 46483fd0a558SYan, Zheng int first_cow = 0; 46493fd0a558SYan, Zheng int level; 465083d4cfd4SJosef Bacik int ret = 0; 46513fd0a558SYan, Zheng 46523fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 46533fd0a558SYan, Zheng if (!rc) 465483d4cfd4SJosef Bacik return 0; 46553fd0a558SYan, Zheng 46563fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 46573fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 46583fd0a558SYan, Zheng 4659c974c464SWang Shilong if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 4660c974c464SWang Shilong if (buf == root->node) 4661c974c464SWang Shilong __update_reloc_root(root, cow->start); 4662c974c464SWang Shilong } 4663c974c464SWang Shilong 46643fd0a558SYan, Zheng level = btrfs_header_level(buf); 46653fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 46663fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 46673fd0a558SYan, Zheng first_cow = 1; 46683fd0a558SYan, Zheng 46693fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 46703fd0a558SYan, Zheng rc->create_reloc_tree) { 46713fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 46723fd0a558SYan, Zheng 46733fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 46743fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 46753fd0a558SYan, Zheng node->new_bytenr != buf->start); 46763fd0a558SYan, Zheng 46773fd0a558SYan, Zheng drop_node_buffer(node); 46783fd0a558SYan, Zheng extent_buffer_get(cow); 46793fd0a558SYan, Zheng node->eb = cow; 46803fd0a558SYan, Zheng node->new_bytenr = cow->start; 46813fd0a558SYan, Zheng 46823fd0a558SYan, Zheng if (!node->pending) { 46833fd0a558SYan, Zheng list_move_tail(&node->list, 46843fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 46853fd0a558SYan, Zheng node->pending = 1; 46863fd0a558SYan, Zheng } 46873fd0a558SYan, Zheng 46883fd0a558SYan, Zheng if (first_cow) 46893fd0a558SYan, Zheng __mark_block_processed(rc, node); 46903fd0a558SYan, Zheng 46913fd0a558SYan, Zheng if (first_cow && level > 0) 46923fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 46933fd0a558SYan, Zheng } 46943fd0a558SYan, Zheng 469583d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 46963fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 469783d4cfd4SJosef Bacik return ret; 46983fd0a558SYan, Zheng } 46993fd0a558SYan, Zheng 47003fd0a558SYan, Zheng /* 47013fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 470201327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 47033fd0a558SYan, Zheng */ 4704147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 47053fd0a558SYan, Zheng u64 *bytes_to_reserve) 47063fd0a558SYan, Zheng { 47073fd0a558SYan, Zheng struct btrfs_root *root; 47083fd0a558SYan, Zheng struct reloc_control *rc; 47093fd0a558SYan, Zheng 47103fd0a558SYan, Zheng root = pending->root; 47113fd0a558SYan, Zheng if (!root->reloc_root) 47123fd0a558SYan, Zheng return; 47133fd0a558SYan, Zheng 47143fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 47153fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 47163fd0a558SYan, Zheng return; 47173fd0a558SYan, Zheng 47183fd0a558SYan, Zheng root = root->reloc_root; 47193fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 47203fd0a558SYan, Zheng /* 47213fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 47223fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 47233fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 47243fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 47253fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 47263fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 47273fd0a558SYan, Zheng * tree may use more space than it frees. so we need 47283fd0a558SYan, Zheng * reserve extra space. 47293fd0a558SYan, Zheng */ 47303fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 47313fd0a558SYan, Zheng } 47323fd0a558SYan, Zheng 47333fd0a558SYan, Zheng /* 47343fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 47353fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 47363fd0a558SYan, Zheng */ 473749b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 47383fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 47393fd0a558SYan, Zheng { 47403fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 47413fd0a558SYan, Zheng struct btrfs_root *reloc_root; 47423fd0a558SYan, Zheng struct btrfs_root *new_root; 47433fd0a558SYan, Zheng struct reloc_control *rc; 47443fd0a558SYan, Zheng int ret; 47453fd0a558SYan, Zheng 47463fd0a558SYan, Zheng if (!root->reloc_root) 474749b25e05SJeff Mahoney return 0; 47483fd0a558SYan, Zheng 47493fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 47503fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 47513fd0a558SYan, Zheng 47523fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 47533fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 47543fd0a558SYan, Zheng rc->block_rsv, 475525d609f8SJosef Bacik rc->nodes_relocated, 1); 475649b25e05SJeff Mahoney if (ret) 475749b25e05SJeff Mahoney return ret; 47583fd0a558SYan, Zheng } 47593fd0a558SYan, Zheng 47603fd0a558SYan, Zheng new_root = pending->snap; 47613fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 47623fd0a558SYan, Zheng new_root->root_key.objectid); 476349b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 476449b25e05SJeff Mahoney return PTR_ERR(reloc_root); 47653fd0a558SYan, Zheng 4766ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4767ffd7b339SJeff Mahoney BUG_ON(ret < 0); 47683fd0a558SYan, Zheng new_root->reloc_root = reloc_root; 47693fd0a558SYan, Zheng 477049b25e05SJeff Mahoney if (rc->create_reloc_tree) 47713fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 477249b25e05SJeff Mahoney return ret; 47733fd0a558SYan, Zheng } 4774