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; 8023de28d57SLiu Bo int type; 8035d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 8043de28d57SLiu Bo type = btrfs_get_extent_inline_ref_type(eb, iref, 8053de28d57SLiu Bo BTRFS_REF_TYPE_BLOCK); 8063de28d57SLiu Bo if (type == BTRFS_REF_TYPE_INVALID) { 8073de28d57SLiu Bo err = -EINVAL; 8083de28d57SLiu Bo goto out; 8093de28d57SLiu Bo } 8103de28d57SLiu Bo key.type = type; 8115d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 8123de28d57SLiu Bo 8135d4f98a2SYan Zheng WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY && 8145d4f98a2SYan Zheng key.type != BTRFS_SHARED_BLOCK_REF_KEY); 8155d4f98a2SYan Zheng } 8165d4f98a2SYan Zheng 8175d4f98a2SYan Zheng if (exist && 8185d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 8195d4f98a2SYan Zheng exist->owner == key.offset) || 8205d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 8215d4f98a2SYan Zheng exist->bytenr == key.offset))) { 8225d4f98a2SYan Zheng exist = NULL; 8235d4f98a2SYan Zheng goto next; 8245d4f98a2SYan Zheng } 8255d4f98a2SYan Zheng 8265d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 8275d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY || 8285d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 8293fd0a558SYan, Zheng if (key.type == BTRFS_EXTENT_REF_V0_KEY) { 8305d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 8315d4f98a2SYan Zheng ref0 = btrfs_item_ptr(eb, path1->slots[0], 8325d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 8333fd0a558SYan, Zheng if (key.objectid == key.offset) { 834046f264fSYan, Zheng root = find_tree_root(rc, eb, ref0); 8353fd0a558SYan, Zheng if (root && !should_ignore_root(root)) 8365d4f98a2SYan Zheng cur->root = root; 8375d4f98a2SYan Zheng else 8383fd0a558SYan, Zheng list_add(&cur->list, &useless); 8395d4f98a2SYan Zheng break; 8405d4f98a2SYan Zheng } 841046f264fSYan, Zheng if (is_cowonly_root(btrfs_ref_root_v0(eb, 842046f264fSYan, Zheng ref0))) 843046f264fSYan, Zheng cur->cowonly = 1; 8443fd0a558SYan, Zheng } 8455d4f98a2SYan Zheng #else 84675bfb9afSJosef Bacik ASSERT(key.type != BTRFS_EXTENT_REF_V0_KEY); 8475d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 8485d4f98a2SYan Zheng #endif 8495d4f98a2SYan Zheng if (key.objectid == key.offset) { 8505d4f98a2SYan Zheng /* 8515d4f98a2SYan Zheng * only root blocks of reloc trees use 8525d4f98a2SYan Zheng * backref of this type. 8535d4f98a2SYan Zheng */ 8545d4f98a2SYan Zheng root = find_reloc_root(rc, cur->bytenr); 85575bfb9afSJosef Bacik ASSERT(root); 8565d4f98a2SYan Zheng cur->root = root; 8575d4f98a2SYan Zheng break; 8585d4f98a2SYan Zheng } 8595d4f98a2SYan Zheng 8603fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 8615d4f98a2SYan Zheng if (!edge) { 8625d4f98a2SYan Zheng err = -ENOMEM; 8635d4f98a2SYan Zheng goto out; 8645d4f98a2SYan Zheng } 8655d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, key.offset); 8665d4f98a2SYan Zheng if (!rb_node) { 8673fd0a558SYan, Zheng upper = alloc_backref_node(cache); 8685d4f98a2SYan Zheng if (!upper) { 8693fd0a558SYan, Zheng free_backref_edge(cache, edge); 8705d4f98a2SYan Zheng err = -ENOMEM; 8715d4f98a2SYan Zheng goto out; 8725d4f98a2SYan Zheng } 8735d4f98a2SYan Zheng upper->bytenr = key.offset; 8745d4f98a2SYan Zheng upper->level = cur->level + 1; 8755d4f98a2SYan Zheng /* 8765d4f98a2SYan Zheng * backrefs for the upper level block isn't 8775d4f98a2SYan Zheng * cached, add the block to pending list 8785d4f98a2SYan Zheng */ 8795d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 8805d4f98a2SYan Zheng } else { 8815d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 8825d4f98a2SYan Zheng rb_node); 88375bfb9afSJosef Bacik ASSERT(upper->checked); 8845d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 8855d4f98a2SYan Zheng } 8863fd0a558SYan, Zheng list_add_tail(&edge->list[LOWER], &cur->upper); 8875d4f98a2SYan Zheng edge->node[LOWER] = cur; 8883fd0a558SYan, Zheng edge->node[UPPER] = upper; 8895d4f98a2SYan Zheng 8905d4f98a2SYan Zheng goto next; 8915d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 8925d4f98a2SYan Zheng goto next; 8935d4f98a2SYan Zheng } 8945d4f98a2SYan Zheng 8955d4f98a2SYan Zheng /* key.type == BTRFS_TREE_BLOCK_REF_KEY */ 8965d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, key.offset); 8975d4f98a2SYan Zheng if (IS_ERR(root)) { 8985d4f98a2SYan Zheng err = PTR_ERR(root); 8995d4f98a2SYan Zheng goto out; 9005d4f98a2SYan Zheng } 9015d4f98a2SYan Zheng 90227cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 9033fd0a558SYan, Zheng cur->cowonly = 1; 9043fd0a558SYan, Zheng 9055d4f98a2SYan Zheng if (btrfs_root_level(&root->root_item) == cur->level) { 9065d4f98a2SYan Zheng /* tree root */ 90775bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 9085d4f98a2SYan Zheng cur->bytenr); 9093fd0a558SYan, Zheng if (should_ignore_root(root)) 9103fd0a558SYan, Zheng list_add(&cur->list, &useless); 9113fd0a558SYan, Zheng else 9125d4f98a2SYan Zheng cur->root = root; 9135d4f98a2SYan Zheng break; 9145d4f98a2SYan Zheng } 9155d4f98a2SYan Zheng 9165d4f98a2SYan Zheng level = cur->level + 1; 9175d4f98a2SYan Zheng 9185d4f98a2SYan Zheng /* 9195d4f98a2SYan Zheng * searching the tree to find upper level blocks 9205d4f98a2SYan Zheng * reference the block. 9215d4f98a2SYan Zheng */ 9225d4f98a2SYan Zheng path2->search_commit_root = 1; 9235d4f98a2SYan Zheng path2->skip_locking = 1; 9245d4f98a2SYan Zheng path2->lowest_level = level; 9255d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0); 9265d4f98a2SYan Zheng path2->lowest_level = 0; 9275d4f98a2SYan Zheng if (ret < 0) { 9285d4f98a2SYan Zheng err = ret; 9295d4f98a2SYan Zheng goto out; 9305d4f98a2SYan Zheng } 93133c66f43SYan Zheng if (ret > 0 && path2->slots[level] > 0) 93233c66f43SYan Zheng path2->slots[level]--; 9335d4f98a2SYan Zheng 9345d4f98a2SYan Zheng eb = path2->nodes[level]; 9353561b9dbSLiu Bo if (btrfs_node_blockptr(eb, path2->slots[level]) != 9363561b9dbSLiu Bo cur->bytenr) { 9373561b9dbSLiu Bo btrfs_err(root->fs_info, 9383561b9dbSLiu Bo "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)", 9393561b9dbSLiu Bo cur->bytenr, level - 1, root->objectid, 9403561b9dbSLiu Bo node_key->objectid, node_key->type, 9413561b9dbSLiu Bo node_key->offset); 9423561b9dbSLiu Bo err = -ENOENT; 9433561b9dbSLiu Bo goto out; 9443561b9dbSLiu Bo } 9455d4f98a2SYan Zheng lower = cur; 946b6c60c80SJosef Bacik need_check = true; 9475d4f98a2SYan Zheng for (; level < BTRFS_MAX_LEVEL; level++) { 9485d4f98a2SYan Zheng if (!path2->nodes[level]) { 94975bfb9afSJosef Bacik ASSERT(btrfs_root_bytenr(&root->root_item) == 9505d4f98a2SYan Zheng lower->bytenr); 9513fd0a558SYan, Zheng if (should_ignore_root(root)) 9523fd0a558SYan, Zheng list_add(&lower->list, &useless); 9533fd0a558SYan, Zheng else 9545d4f98a2SYan Zheng lower->root = root; 9555d4f98a2SYan Zheng break; 9565d4f98a2SYan Zheng } 9575d4f98a2SYan Zheng 9583fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 9595d4f98a2SYan Zheng if (!edge) { 9605d4f98a2SYan Zheng err = -ENOMEM; 9615d4f98a2SYan Zheng goto out; 9625d4f98a2SYan Zheng } 9635d4f98a2SYan Zheng 9645d4f98a2SYan Zheng eb = path2->nodes[level]; 9655d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, eb->start); 9665d4f98a2SYan Zheng if (!rb_node) { 9673fd0a558SYan, Zheng upper = alloc_backref_node(cache); 9685d4f98a2SYan Zheng if (!upper) { 9693fd0a558SYan, Zheng free_backref_edge(cache, edge); 9705d4f98a2SYan Zheng err = -ENOMEM; 9715d4f98a2SYan Zheng goto out; 9725d4f98a2SYan Zheng } 9735d4f98a2SYan Zheng upper->bytenr = eb->start; 9745d4f98a2SYan Zheng upper->owner = btrfs_header_owner(eb); 9755d4f98a2SYan Zheng upper->level = lower->level + 1; 97627cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, 97727cdeb70SMiao Xie &root->state)) 9783fd0a558SYan, Zheng upper->cowonly = 1; 9795d4f98a2SYan Zheng 9805d4f98a2SYan Zheng /* 9815d4f98a2SYan Zheng * if we know the block isn't shared 9825d4f98a2SYan Zheng * we can void checking its backrefs. 9835d4f98a2SYan Zheng */ 9845d4f98a2SYan Zheng if (btrfs_block_can_be_shared(root, eb)) 9855d4f98a2SYan Zheng upper->checked = 0; 9865d4f98a2SYan Zheng else 9875d4f98a2SYan Zheng upper->checked = 1; 9885d4f98a2SYan Zheng 9895d4f98a2SYan Zheng /* 9905d4f98a2SYan Zheng * add the block to pending list if we 991b6c60c80SJosef Bacik * need check its backrefs, we only do this once 992b6c60c80SJosef Bacik * while walking up a tree as we will catch 993b6c60c80SJosef Bacik * anything else later on. 9945d4f98a2SYan Zheng */ 995b6c60c80SJosef Bacik if (!upper->checked && need_check) { 996b6c60c80SJosef Bacik need_check = false; 9975d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], 9985d4f98a2SYan Zheng &list); 999bbe90514SJosef Bacik } else { 1000bbe90514SJosef Bacik if (upper->checked) 1001bbe90514SJosef Bacik need_check = true; 10025d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 1003bbe90514SJosef Bacik } 10045d4f98a2SYan Zheng } else { 10055d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 10065d4f98a2SYan Zheng rb_node); 100775bfb9afSJosef Bacik ASSERT(upper->checked); 10085d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 10093fd0a558SYan, Zheng if (!upper->owner) 10103fd0a558SYan, Zheng upper->owner = btrfs_header_owner(eb); 10115d4f98a2SYan Zheng } 10125d4f98a2SYan Zheng list_add_tail(&edge->list[LOWER], &lower->upper); 10135d4f98a2SYan Zheng edge->node[LOWER] = lower; 10143fd0a558SYan, Zheng edge->node[UPPER] = upper; 10155d4f98a2SYan Zheng 10165d4f98a2SYan Zheng if (rb_node) 10175d4f98a2SYan Zheng break; 10185d4f98a2SYan Zheng lower = upper; 10195d4f98a2SYan Zheng upper = NULL; 10205d4f98a2SYan Zheng } 1021b3b4aa74SDavid Sterba btrfs_release_path(path2); 10225d4f98a2SYan Zheng next: 10235d4f98a2SYan Zheng if (ptr < end) { 10245d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 10255d4f98a2SYan Zheng if (ptr >= end) { 10265d4f98a2SYan Zheng WARN_ON(ptr > end); 10275d4f98a2SYan Zheng ptr = 0; 10285d4f98a2SYan Zheng end = 0; 10295d4f98a2SYan Zheng } 10305d4f98a2SYan Zheng } 10315d4f98a2SYan Zheng if (ptr >= end) 10325d4f98a2SYan Zheng path1->slots[0]++; 10335d4f98a2SYan Zheng } 1034b3b4aa74SDavid Sterba btrfs_release_path(path1); 10355d4f98a2SYan Zheng 10365d4f98a2SYan Zheng cur->checked = 1; 10375d4f98a2SYan Zheng WARN_ON(exist); 10385d4f98a2SYan Zheng 10395d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 10405d4f98a2SYan Zheng if (!list_empty(&list)) { 10415d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10425d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10435d4f98a2SYan Zheng cur = edge->node[UPPER]; 10445d4f98a2SYan Zheng goto again; 10455d4f98a2SYan Zheng } 10465d4f98a2SYan Zheng 10475d4f98a2SYan Zheng /* 10485d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 10495d4f98a2SYan Zheng * into the cache. 10505d4f98a2SYan Zheng */ 105175bfb9afSJosef Bacik ASSERT(node->checked); 10523fd0a558SYan, Zheng cowonly = node->cowonly; 10533fd0a558SYan, Zheng if (!cowonly) { 10543fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 10553fd0a558SYan, Zheng &node->rb_node); 105643c04fb1SJeff Mahoney if (rb_node) 105743c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 10583fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 10593fd0a558SYan, Zheng } 10605d4f98a2SYan Zheng 10615d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 10625d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10635d4f98a2SYan Zheng 10645d4f98a2SYan Zheng while (!list_empty(&list)) { 10655d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10665d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10675d4f98a2SYan Zheng upper = edge->node[UPPER]; 10683fd0a558SYan, Zheng if (upper->detached) { 10693fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10703fd0a558SYan, Zheng lower = edge->node[LOWER]; 10713fd0a558SYan, Zheng free_backref_edge(cache, edge); 10723fd0a558SYan, Zheng if (list_empty(&lower->upper)) 10733fd0a558SYan, Zheng list_add(&lower->list, &useless); 10743fd0a558SYan, Zheng continue; 10753fd0a558SYan, Zheng } 10765d4f98a2SYan Zheng 10775d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 10785d4f98a2SYan Zheng if (upper->lowest) { 10795d4f98a2SYan Zheng list_del_init(&upper->lower); 10805d4f98a2SYan Zheng upper->lowest = 0; 10815d4f98a2SYan Zheng } 10825d4f98a2SYan Zheng 10835d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10845d4f98a2SYan Zheng continue; 10855d4f98a2SYan Zheng } 10865d4f98a2SYan Zheng 108775bfb9afSJosef Bacik if (!upper->checked) { 108875bfb9afSJosef Bacik /* 108975bfb9afSJosef Bacik * Still want to blow up for developers since this is a 109075bfb9afSJosef Bacik * logic bug. 109175bfb9afSJosef Bacik */ 109275bfb9afSJosef Bacik ASSERT(0); 109375bfb9afSJosef Bacik err = -EINVAL; 109475bfb9afSJosef Bacik goto out; 109575bfb9afSJosef Bacik } 109675bfb9afSJosef Bacik if (cowonly != upper->cowonly) { 109775bfb9afSJosef Bacik ASSERT(0); 109875bfb9afSJosef Bacik err = -EINVAL; 109975bfb9afSJosef Bacik goto out; 110075bfb9afSJosef Bacik } 110175bfb9afSJosef Bacik 11023fd0a558SYan, Zheng if (!cowonly) { 11035d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 11045d4f98a2SYan Zheng &upper->rb_node); 110543c04fb1SJeff Mahoney if (rb_node) 110643c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 110743c04fb1SJeff Mahoney upper->bytenr); 11083fd0a558SYan, Zheng } 11095d4f98a2SYan Zheng 11105d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 11115d4f98a2SYan Zheng 11125d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 11135d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 11145d4f98a2SYan Zheng } 11153fd0a558SYan, Zheng /* 11163fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 11173fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 11183fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 11193fd0a558SYan, Zheng * lookup. 11203fd0a558SYan, Zheng */ 11213fd0a558SYan, Zheng while (!list_empty(&useless)) { 11223fd0a558SYan, Zheng upper = list_entry(useless.next, struct backref_node, list); 11233fd0a558SYan, Zheng list_del_init(&upper->list); 112475bfb9afSJosef Bacik ASSERT(list_empty(&upper->upper)); 11253fd0a558SYan, Zheng if (upper == node) 11263fd0a558SYan, Zheng node = NULL; 11273fd0a558SYan, Zheng if (upper->lowest) { 11283fd0a558SYan, Zheng list_del_init(&upper->lower); 11293fd0a558SYan, Zheng upper->lowest = 0; 11303fd0a558SYan, Zheng } 11313fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 11323fd0a558SYan, Zheng edge = list_entry(upper->lower.next, 11333fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 11343fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 11353fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11363fd0a558SYan, Zheng lower = edge->node[LOWER]; 11373fd0a558SYan, Zheng free_backref_edge(cache, edge); 11383fd0a558SYan, Zheng 11393fd0a558SYan, Zheng if (list_empty(&lower->upper)) 11403fd0a558SYan, Zheng list_add(&lower->list, &useless); 11413fd0a558SYan, Zheng } 11423fd0a558SYan, Zheng __mark_block_processed(rc, upper); 11433fd0a558SYan, Zheng if (upper->level > 0) { 11443fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 11453fd0a558SYan, Zheng upper->detached = 1; 11463fd0a558SYan, Zheng } else { 11473fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 11483fd0a558SYan, Zheng free_backref_node(cache, upper); 11493fd0a558SYan, Zheng } 11503fd0a558SYan, Zheng } 11515d4f98a2SYan Zheng out: 11525d4f98a2SYan Zheng btrfs_free_path(path1); 11535d4f98a2SYan Zheng btrfs_free_path(path2); 11545d4f98a2SYan Zheng if (err) { 11553fd0a558SYan, Zheng while (!list_empty(&useless)) { 11563fd0a558SYan, Zheng lower = list_entry(useless.next, 115775bfb9afSJosef Bacik struct backref_node, list); 115875bfb9afSJosef Bacik list_del_init(&lower->list); 11593fd0a558SYan, Zheng } 116075bfb9afSJosef Bacik while (!list_empty(&list)) { 116175bfb9afSJosef Bacik edge = list_first_entry(&list, struct backref_edge, 116275bfb9afSJosef Bacik list[UPPER]); 116375bfb9afSJosef Bacik list_del(&edge->list[UPPER]); 11643fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 116575bfb9afSJosef Bacik lower = edge->node[LOWER]; 11665d4f98a2SYan Zheng upper = edge->node[UPPER]; 11673fd0a558SYan, Zheng free_backref_edge(cache, edge); 116875bfb9afSJosef Bacik 116975bfb9afSJosef Bacik /* 117075bfb9afSJosef Bacik * Lower is no longer linked to any upper backref nodes 117175bfb9afSJosef Bacik * and isn't in the cache, we can free it ourselves. 117275bfb9afSJosef Bacik */ 117375bfb9afSJosef Bacik if (list_empty(&lower->upper) && 117475bfb9afSJosef Bacik RB_EMPTY_NODE(&lower->rb_node)) 117575bfb9afSJosef Bacik list_add(&lower->list, &useless); 117675bfb9afSJosef Bacik 117775bfb9afSJosef Bacik if (!RB_EMPTY_NODE(&upper->rb_node)) 117875bfb9afSJosef Bacik continue; 117975bfb9afSJosef Bacik 118001327610SNicholas D Steeves /* Add this guy's upper edges to the list to process */ 118175bfb9afSJosef Bacik list_for_each_entry(edge, &upper->upper, list[LOWER]) 118275bfb9afSJosef Bacik list_add_tail(&edge->list[UPPER], &list); 118375bfb9afSJosef Bacik if (list_empty(&upper->upper)) 118475bfb9afSJosef Bacik list_add(&upper->list, &useless); 118575bfb9afSJosef Bacik } 118675bfb9afSJosef Bacik 118775bfb9afSJosef Bacik while (!list_empty(&useless)) { 118875bfb9afSJosef Bacik lower = list_entry(useless.next, 118975bfb9afSJosef Bacik struct backref_node, list); 119075bfb9afSJosef Bacik list_del_init(&lower->list); 11910fd8c3daSLiu Bo if (lower == node) 11920fd8c3daSLiu Bo node = NULL; 119375bfb9afSJosef Bacik free_backref_node(cache, lower); 11945d4f98a2SYan Zheng } 11950fd8c3daSLiu Bo 11960fd8c3daSLiu Bo free_backref_node(cache, node); 11975d4f98a2SYan Zheng return ERR_PTR(err); 11985d4f98a2SYan Zheng } 119975bfb9afSJosef Bacik ASSERT(!node || !node->detached); 12005d4f98a2SYan Zheng return node; 12015d4f98a2SYan Zheng } 12025d4f98a2SYan Zheng 12035d4f98a2SYan Zheng /* 12043fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 12053fd0a558SYan, Zheng * the backref node is created by cloning backref node that 12063fd0a558SYan, Zheng * corresponds to root of source tree 12073fd0a558SYan, Zheng */ 12083fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 12093fd0a558SYan, Zheng struct reloc_control *rc, 12103fd0a558SYan, Zheng struct btrfs_root *src, 12113fd0a558SYan, Zheng struct btrfs_root *dest) 12123fd0a558SYan, Zheng { 12133fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 12143fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 12153fd0a558SYan, Zheng struct backref_node *node = NULL; 12163fd0a558SYan, Zheng struct backref_node *new_node; 12173fd0a558SYan, Zheng struct backref_edge *edge; 12183fd0a558SYan, Zheng struct backref_edge *new_edge; 12193fd0a558SYan, Zheng struct rb_node *rb_node; 12203fd0a558SYan, Zheng 12213fd0a558SYan, Zheng if (cache->last_trans > 0) 12223fd0a558SYan, Zheng update_backref_cache(trans, cache); 12233fd0a558SYan, Zheng 12243fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 12253fd0a558SYan, Zheng if (rb_node) { 12263fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 12273fd0a558SYan, Zheng if (node->detached) 12283fd0a558SYan, Zheng node = NULL; 12293fd0a558SYan, Zheng else 12303fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 12313fd0a558SYan, Zheng } 12323fd0a558SYan, Zheng 12333fd0a558SYan, Zheng if (!node) { 12343fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 12353fd0a558SYan, Zheng reloc_root->commit_root->start); 12363fd0a558SYan, Zheng if (rb_node) { 12373fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 12383fd0a558SYan, Zheng rb_node); 12393fd0a558SYan, Zheng BUG_ON(node->detached); 12403fd0a558SYan, Zheng } 12413fd0a558SYan, Zheng } 12423fd0a558SYan, Zheng 12433fd0a558SYan, Zheng if (!node) 12443fd0a558SYan, Zheng return 0; 12453fd0a558SYan, Zheng 12463fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 12473fd0a558SYan, Zheng if (!new_node) 12483fd0a558SYan, Zheng return -ENOMEM; 12493fd0a558SYan, Zheng 12503fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 12513fd0a558SYan, Zheng new_node->level = node->level; 12523fd0a558SYan, Zheng new_node->lowest = node->lowest; 12536848ad64SYan, Zheng new_node->checked = 1; 12543fd0a558SYan, Zheng new_node->root = dest; 12553fd0a558SYan, Zheng 12563fd0a558SYan, Zheng if (!node->lowest) { 12573fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 12583fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 12593fd0a558SYan, Zheng if (!new_edge) 12603fd0a558SYan, Zheng goto fail; 12613fd0a558SYan, Zheng 12623fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 12633fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 12643fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 12653fd0a558SYan, Zheng &new_node->lower); 12663fd0a558SYan, Zheng } 126776b9e23dSMiao Xie } else { 126876b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 12693fd0a558SYan, Zheng } 12703fd0a558SYan, Zheng 12713fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 12723fd0a558SYan, Zheng &new_node->rb_node); 127343c04fb1SJeff Mahoney if (rb_node) 127443c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 12753fd0a558SYan, Zheng 12763fd0a558SYan, Zheng if (!new_node->lowest) { 12773fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 12783fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 12793fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 12803fd0a558SYan, Zheng } 12813fd0a558SYan, Zheng } 12823fd0a558SYan, Zheng return 0; 12833fd0a558SYan, Zheng fail: 12843fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 12853fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 12863fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 12873fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 12883fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 12893fd0a558SYan, Zheng } 12903fd0a558SYan, Zheng free_backref_node(cache, new_node); 12913fd0a558SYan, Zheng return -ENOMEM; 12923fd0a558SYan, Zheng } 12933fd0a558SYan, Zheng 12943fd0a558SYan, Zheng /* 12955d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 12965d4f98a2SYan Zheng */ 1297ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 12985d4f98a2SYan Zheng { 12990b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 13005d4f98a2SYan Zheng struct rb_node *rb_node; 13015d4f98a2SYan Zheng struct mapping_node *node; 13020b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 13035d4f98a2SYan Zheng 13045d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1305ffd7b339SJeff Mahoney if (!node) 1306ffd7b339SJeff Mahoney return -ENOMEM; 13075d4f98a2SYan Zheng 13085d4f98a2SYan Zheng node->bytenr = root->node->start; 13095d4f98a2SYan Zheng node->data = root; 13105d4f98a2SYan Zheng 13115d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13125d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13135d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13145d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1315ffd7b339SJeff Mahoney if (rb_node) { 13160b246afaSJeff Mahoney btrfs_panic(fs_info, -EEXIST, 13175d163e0eSJeff Mahoney "Duplicate root found for start=%llu while inserting into relocation tree", 13185d163e0eSJeff Mahoney node->bytenr); 1319ffd7b339SJeff Mahoney } 13205d4f98a2SYan Zheng 13215d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 13225d4f98a2SYan Zheng return 0; 13235d4f98a2SYan Zheng } 13245d4f98a2SYan Zheng 13255d4f98a2SYan Zheng /* 1326c974c464SWang Shilong * helper to delete the 'address of tree root -> reloc tree' 13275d4f98a2SYan Zheng * mapping 13285d4f98a2SYan Zheng */ 1329c974c464SWang Shilong static void __del_reloc_root(struct btrfs_root *root) 13305d4f98a2SYan Zheng { 13310b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 13325d4f98a2SYan Zheng struct rb_node *rb_node; 13335d4f98a2SYan Zheng struct mapping_node *node = NULL; 13340b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 13355d4f98a2SYan Zheng 13365d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 13375d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1338c974c464SWang Shilong root->node->start); 1339c974c464SWang Shilong if (rb_node) { 1340c974c464SWang Shilong node = rb_entry(rb_node, struct mapping_node, rb_node); 1341c974c464SWang Shilong rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 1342c974c464SWang Shilong } 1343c974c464SWang Shilong spin_unlock(&rc->reloc_root_tree.lock); 1344c974c464SWang Shilong 1345c974c464SWang Shilong if (!node) 1346c974c464SWang Shilong return; 1347c974c464SWang Shilong BUG_ON((struct btrfs_root *)node->data != root); 1348c974c464SWang Shilong 13490b246afaSJeff Mahoney spin_lock(&fs_info->trans_lock); 1350c974c464SWang Shilong list_del_init(&root->root_list); 13510b246afaSJeff Mahoney spin_unlock(&fs_info->trans_lock); 1352c974c464SWang Shilong kfree(node); 1353c974c464SWang Shilong } 1354c974c464SWang Shilong 1355c974c464SWang Shilong /* 1356c974c464SWang Shilong * helper to update the 'address of tree root -> reloc tree' 1357c974c464SWang Shilong * mapping 1358c974c464SWang Shilong */ 1359c974c464SWang Shilong static int __update_reloc_root(struct btrfs_root *root, u64 new_bytenr) 1360c974c464SWang Shilong { 13610b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 1362c974c464SWang Shilong struct rb_node *rb_node; 1363c974c464SWang Shilong struct mapping_node *node = NULL; 13640b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 1365c974c464SWang Shilong 1366c974c464SWang Shilong spin_lock(&rc->reloc_root_tree.lock); 1367c974c464SWang Shilong rb_node = tree_search(&rc->reloc_root_tree.rb_root, 1368c974c464SWang Shilong root->node->start); 13695d4f98a2SYan Zheng if (rb_node) { 13705d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 13715d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 13725d4f98a2SYan Zheng } 13735d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 13745d4f98a2SYan Zheng 13758f71f3e0SLiu Bo if (!node) 13768f71f3e0SLiu Bo return 0; 13775d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 13785d4f98a2SYan Zheng 13795d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 1380c974c464SWang Shilong node->bytenr = new_bytenr; 13815d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 13825d4f98a2SYan Zheng node->bytenr, &node->rb_node); 13835d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 138443c04fb1SJeff Mahoney if (rb_node) 138543c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 13865d4f98a2SYan Zheng return 0; 13875d4f98a2SYan Zheng } 13885d4f98a2SYan Zheng 13893fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 13903fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 13915d4f98a2SYan Zheng { 13920b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 13935d4f98a2SYan Zheng struct btrfs_root *reloc_root; 13945d4f98a2SYan Zheng struct extent_buffer *eb; 13955d4f98a2SYan Zheng struct btrfs_root_item *root_item; 13965d4f98a2SYan Zheng struct btrfs_key root_key; 13975d4f98a2SYan Zheng int ret; 13985d4f98a2SYan Zheng 13995d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 14005d4f98a2SYan Zheng BUG_ON(!root_item); 14015d4f98a2SYan Zheng 14025d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 14035d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 14043fd0a558SYan, Zheng root_key.offset = objectid; 14055d4f98a2SYan Zheng 14063fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 1407054570a1SFilipe Manana u64 commit_root_gen; 1408054570a1SFilipe Manana 14093fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 14105d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 14115d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 14125d4f98a2SYan Zheng BUG_ON(ret); 1413054570a1SFilipe Manana /* 1414054570a1SFilipe Manana * Set the last_snapshot field to the generation of the commit 1415054570a1SFilipe Manana * root - like this ctree.c:btrfs_block_can_be_shared() behaves 1416054570a1SFilipe Manana * correctly (returns true) when the relocation root is created 1417054570a1SFilipe Manana * either inside the critical section of a transaction commit 1418054570a1SFilipe Manana * (through transaction.c:qgroup_account_snapshot()) and when 1419054570a1SFilipe Manana * it's created before the transaction commit is started. 1420054570a1SFilipe Manana */ 1421054570a1SFilipe Manana commit_root_gen = btrfs_header_generation(root->commit_root); 1422054570a1SFilipe Manana btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen); 14233fd0a558SYan, Zheng } else { 14243fd0a558SYan, Zheng /* 14253fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 14263fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 14273fd0a558SYan, Zheng * modified after it was created have RELOC flag 14283fd0a558SYan, Zheng * set in their headers. so it's OK to not update 14293fd0a558SYan, Zheng * the 'last_snapshot'. 14303fd0a558SYan, Zheng */ 14313fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 14323fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 14333fd0a558SYan, Zheng BUG_ON(ret); 14343fd0a558SYan, Zheng } 14353fd0a558SYan, Zheng 14365d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 14375d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 14385d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 14395d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 14403fd0a558SYan, Zheng 14413fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 14423fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 14433fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 14443fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 14455d4f98a2SYan Zheng root_item->drop_level = 0; 14463fd0a558SYan, Zheng } 14475d4f98a2SYan Zheng 14485d4f98a2SYan Zheng btrfs_tree_unlock(eb); 14495d4f98a2SYan Zheng free_extent_buffer(eb); 14505d4f98a2SYan Zheng 14510b246afaSJeff Mahoney ret = btrfs_insert_root(trans, fs_info->tree_root, 14525d4f98a2SYan Zheng &root_key, root_item); 14535d4f98a2SYan Zheng BUG_ON(ret); 14545d4f98a2SYan Zheng kfree(root_item); 14555d4f98a2SYan Zheng 14560b246afaSJeff Mahoney reloc_root = btrfs_read_fs_root(fs_info->tree_root, &root_key); 14575d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 14585d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 14593fd0a558SYan, Zheng return reloc_root; 14603fd0a558SYan, Zheng } 14613fd0a558SYan, Zheng 14623fd0a558SYan, Zheng /* 14633fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 14643fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 14653fd0a558SYan, Zheng */ 14663fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 14673fd0a558SYan, Zheng struct btrfs_root *root) 14683fd0a558SYan, Zheng { 14690b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 14703fd0a558SYan, Zheng struct btrfs_root *reloc_root; 14710b246afaSJeff Mahoney struct reloc_control *rc = fs_info->reloc_ctl; 147220dd2cbfSMiao Xie struct btrfs_block_rsv *rsv; 14733fd0a558SYan, Zheng int clear_rsv = 0; 1474ffd7b339SJeff Mahoney int ret; 14753fd0a558SYan, Zheng 14763fd0a558SYan, Zheng if (root->reloc_root) { 14773fd0a558SYan, Zheng reloc_root = root->reloc_root; 14783fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 14793fd0a558SYan, Zheng return 0; 14803fd0a558SYan, Zheng } 14813fd0a558SYan, Zheng 14823fd0a558SYan, Zheng if (!rc || !rc->create_reloc_tree || 14833fd0a558SYan, Zheng root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 14843fd0a558SYan, Zheng return 0; 14853fd0a558SYan, Zheng 148620dd2cbfSMiao Xie if (!trans->reloc_reserved) { 148720dd2cbfSMiao Xie rsv = trans->block_rsv; 14883fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 14893fd0a558SYan, Zheng clear_rsv = 1; 14903fd0a558SYan, Zheng } 14913fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 14923fd0a558SYan, Zheng if (clear_rsv) 149320dd2cbfSMiao Xie trans->block_rsv = rsv; 14945d4f98a2SYan Zheng 1495ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1496ffd7b339SJeff Mahoney BUG_ON(ret < 0); 14975d4f98a2SYan Zheng root->reloc_root = reloc_root; 14985d4f98a2SYan Zheng return 0; 14995d4f98a2SYan Zheng } 15005d4f98a2SYan Zheng 15015d4f98a2SYan Zheng /* 15025d4f98a2SYan Zheng * update root item of reloc tree 15035d4f98a2SYan Zheng */ 15045d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 15055d4f98a2SYan Zheng struct btrfs_root *root) 15065d4f98a2SYan Zheng { 15070b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 15085d4f98a2SYan Zheng struct btrfs_root *reloc_root; 15095d4f98a2SYan Zheng struct btrfs_root_item *root_item; 15105d4f98a2SYan Zheng int ret; 15115d4f98a2SYan Zheng 15125d4f98a2SYan Zheng if (!root->reloc_root) 15137585717fSChris Mason goto out; 15145d4f98a2SYan Zheng 15155d4f98a2SYan Zheng reloc_root = root->reloc_root; 15165d4f98a2SYan Zheng root_item = &reloc_root->root_item; 15175d4f98a2SYan Zheng 15180b246afaSJeff Mahoney if (fs_info->reloc_ctl->merge_reloc_tree && 15193fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 15205d4f98a2SYan Zheng root->reloc_root = NULL; 1521c974c464SWang Shilong __del_reloc_root(reloc_root); 15225d4f98a2SYan Zheng } 15235d4f98a2SYan Zheng 15245d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 15255d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 15265d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 15275d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 15285d4f98a2SYan Zheng } 15295d4f98a2SYan Zheng 15300b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 15315d4f98a2SYan Zheng &reloc_root->root_key, root_item); 15325d4f98a2SYan Zheng BUG_ON(ret); 15337585717fSChris Mason 15347585717fSChris Mason out: 15355d4f98a2SYan Zheng return 0; 15365d4f98a2SYan Zheng } 15375d4f98a2SYan Zheng 15385d4f98a2SYan Zheng /* 15395d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 15405d4f98a2SYan Zheng * in a subvolume 15415d4f98a2SYan Zheng */ 15425d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 15435d4f98a2SYan Zheng { 15445d4f98a2SYan Zheng struct rb_node *node; 15455d4f98a2SYan Zheng struct rb_node *prev; 15465d4f98a2SYan Zheng struct btrfs_inode *entry; 15475d4f98a2SYan Zheng struct inode *inode; 15485d4f98a2SYan Zheng 15495d4f98a2SYan Zheng spin_lock(&root->inode_lock); 15505d4f98a2SYan Zheng again: 15515d4f98a2SYan Zheng node = root->inode_tree.rb_node; 15525d4f98a2SYan Zheng prev = NULL; 15535d4f98a2SYan Zheng while (node) { 15545d4f98a2SYan Zheng prev = node; 15555d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 15565d4f98a2SYan Zheng 15574a0cc7caSNikolay Borisov if (objectid < btrfs_ino(entry)) 15585d4f98a2SYan Zheng node = node->rb_left; 15594a0cc7caSNikolay Borisov else if (objectid > btrfs_ino(entry)) 15605d4f98a2SYan Zheng node = node->rb_right; 15615d4f98a2SYan Zheng else 15625d4f98a2SYan Zheng break; 15635d4f98a2SYan Zheng } 15645d4f98a2SYan Zheng if (!node) { 15655d4f98a2SYan Zheng while (prev) { 15665d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 15674a0cc7caSNikolay Borisov if (objectid <= btrfs_ino(entry)) { 15685d4f98a2SYan Zheng node = prev; 15695d4f98a2SYan Zheng break; 15705d4f98a2SYan Zheng } 15715d4f98a2SYan Zheng prev = rb_next(prev); 15725d4f98a2SYan Zheng } 15735d4f98a2SYan Zheng } 15745d4f98a2SYan Zheng while (node) { 15755d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 15765d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 15775d4f98a2SYan Zheng if (inode) { 15785d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15795d4f98a2SYan Zheng return inode; 15805d4f98a2SYan Zheng } 15815d4f98a2SYan Zheng 15824a0cc7caSNikolay Borisov objectid = btrfs_ino(entry) + 1; 15835d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 15845d4f98a2SYan Zheng goto again; 15855d4f98a2SYan Zheng 15865d4f98a2SYan Zheng node = rb_next(node); 15875d4f98a2SYan Zheng } 15885d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 15895d4f98a2SYan Zheng return NULL; 15905d4f98a2SYan Zheng } 15915d4f98a2SYan Zheng 15925d4f98a2SYan Zheng static int in_block_group(u64 bytenr, 15935d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group) 15945d4f98a2SYan Zheng { 15955d4f98a2SYan Zheng if (bytenr >= block_group->key.objectid && 15965d4f98a2SYan Zheng bytenr < block_group->key.objectid + block_group->key.offset) 15975d4f98a2SYan Zheng return 1; 15985d4f98a2SYan Zheng return 0; 15995d4f98a2SYan Zheng } 16005d4f98a2SYan Zheng 16015d4f98a2SYan Zheng /* 16025d4f98a2SYan Zheng * get new location of data 16035d4f98a2SYan Zheng */ 16045d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 16055d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 16065d4f98a2SYan Zheng { 16075d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 16085d4f98a2SYan Zheng struct btrfs_path *path; 16095d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 16105d4f98a2SYan Zheng struct extent_buffer *leaf; 16115d4f98a2SYan Zheng int ret; 16125d4f98a2SYan Zheng 16135d4f98a2SYan Zheng path = btrfs_alloc_path(); 16145d4f98a2SYan Zheng if (!path) 16155d4f98a2SYan Zheng return -ENOMEM; 16165d4f98a2SYan Zheng 16175d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 1618f85b7379SDavid Sterba ret = btrfs_lookup_file_extent(NULL, root, path, 1619f85b7379SDavid Sterba btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0); 16205d4f98a2SYan Zheng if (ret < 0) 16215d4f98a2SYan Zheng goto out; 16225d4f98a2SYan Zheng if (ret > 0) { 16235d4f98a2SYan Zheng ret = -ENOENT; 16245d4f98a2SYan Zheng goto out; 16255d4f98a2SYan Zheng } 16265d4f98a2SYan Zheng 16275d4f98a2SYan Zheng leaf = path->nodes[0]; 16285d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 16295d4f98a2SYan Zheng struct btrfs_file_extent_item); 16305d4f98a2SYan Zheng 16315d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 16325d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 16335d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 16345d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 16355d4f98a2SYan Zheng 16365d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 163783d4cfd4SJosef Bacik ret = -EINVAL; 16385d4f98a2SYan Zheng goto out; 16395d4f98a2SYan Zheng } 16405d4f98a2SYan Zheng 16415d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16425d4f98a2SYan Zheng ret = 0; 16435d4f98a2SYan Zheng out: 16445d4f98a2SYan Zheng btrfs_free_path(path); 16455d4f98a2SYan Zheng return ret; 16465d4f98a2SYan Zheng } 16475d4f98a2SYan Zheng 16485d4f98a2SYan Zheng /* 16495d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 16505d4f98a2SYan Zheng * the new locations. 16515d4f98a2SYan Zheng */ 16523fd0a558SYan, Zheng static noinline_for_stack 16533fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 16545d4f98a2SYan Zheng struct reloc_control *rc, 16555d4f98a2SYan Zheng struct btrfs_root *root, 16563fd0a558SYan, Zheng struct extent_buffer *leaf) 16575d4f98a2SYan Zheng { 16580b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 16595d4f98a2SYan Zheng struct btrfs_key key; 16605d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 16615d4f98a2SYan Zheng struct inode *inode = NULL; 16625d4f98a2SYan Zheng u64 parent; 16635d4f98a2SYan Zheng u64 bytenr; 16643fd0a558SYan, Zheng u64 new_bytenr = 0; 16655d4f98a2SYan Zheng u64 num_bytes; 16665d4f98a2SYan Zheng u64 end; 16675d4f98a2SYan Zheng u32 nritems; 16685d4f98a2SYan Zheng u32 i; 166983d4cfd4SJosef Bacik int ret = 0; 16705d4f98a2SYan Zheng int first = 1; 16715d4f98a2SYan Zheng int dirty = 0; 16725d4f98a2SYan Zheng 16735d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 16745d4f98a2SYan Zheng return 0; 16755d4f98a2SYan Zheng 16765d4f98a2SYan Zheng /* reloc trees always use full backref */ 16775d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 16785d4f98a2SYan Zheng parent = leaf->start; 16795d4f98a2SYan Zheng else 16805d4f98a2SYan Zheng parent = 0; 16815d4f98a2SYan Zheng 16825d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 16835d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 16845d4f98a2SYan Zheng cond_resched(); 16855d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 16865d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 16875d4f98a2SYan Zheng continue; 16885d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 16895d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 16905d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 16915d4f98a2SYan Zheng continue; 16925d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 16935d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 16945d4f98a2SYan Zheng if (bytenr == 0) 16955d4f98a2SYan Zheng continue; 16965d4f98a2SYan Zheng if (!in_block_group(bytenr, rc->block_group)) 16975d4f98a2SYan Zheng continue; 16985d4f98a2SYan Zheng 16995d4f98a2SYan Zheng /* 17005d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 17015d4f98a2SYan Zheng * to complete and drop the extent cache 17025d4f98a2SYan Zheng */ 17035d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 17045d4f98a2SYan Zheng if (first) { 17055d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 17065d4f98a2SYan Zheng first = 0; 17074a0cc7caSNikolay Borisov } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) { 17083fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 17095d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 17105d4f98a2SYan Zheng } 17114a0cc7caSNikolay Borisov if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) { 17125d4f98a2SYan Zheng end = key.offset + 17135d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 17145d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 17150b246afaSJeff Mahoney fs_info->sectorsize)); 17160b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 17175d4f98a2SYan Zheng end--; 17185d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1719d0082371SJeff Mahoney key.offset, end); 17205d4f98a2SYan Zheng if (!ret) 17215d4f98a2SYan Zheng continue; 17225d4f98a2SYan Zheng 1723dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), 1724dcdbc059SNikolay Borisov key.offset, end, 1); 17255d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1726d0082371SJeff Mahoney key.offset, end); 17275d4f98a2SYan Zheng } 17285d4f98a2SYan Zheng } 17295d4f98a2SYan Zheng 17305d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 17315d4f98a2SYan Zheng bytenr, num_bytes); 173283d4cfd4SJosef Bacik if (ret) { 173383d4cfd4SJosef Bacik /* 173483d4cfd4SJosef Bacik * Don't have to abort since we've not changed anything 173583d4cfd4SJosef Bacik * in the file extent yet. 173683d4cfd4SJosef Bacik */ 173783d4cfd4SJosef Bacik break; 17383fd0a558SYan, Zheng } 17395d4f98a2SYan Zheng 17405d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 17415d4f98a2SYan Zheng dirty = 1; 17425d4f98a2SYan Zheng 17435d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 17442ff7e61eSJeff Mahoney ret = btrfs_inc_extent_ref(trans, fs_info, new_bytenr, 17455d4f98a2SYan Zheng num_bytes, parent, 17465d4f98a2SYan Zheng btrfs_header_owner(leaf), 1747b06c4bf5SFilipe Manana key.objectid, key.offset); 174883d4cfd4SJosef Bacik if (ret) { 174966642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 175083d4cfd4SJosef Bacik break; 175183d4cfd4SJosef Bacik } 17525d4f98a2SYan Zheng 17532ff7e61eSJeff Mahoney ret = btrfs_free_extent(trans, fs_info, bytenr, num_bytes, 17545d4f98a2SYan Zheng parent, btrfs_header_owner(leaf), 1755b06c4bf5SFilipe Manana key.objectid, key.offset); 175683d4cfd4SJosef Bacik if (ret) { 175766642832SJeff Mahoney btrfs_abort_transaction(trans, ret); 175883d4cfd4SJosef Bacik break; 175983d4cfd4SJosef Bacik } 17605d4f98a2SYan Zheng } 17615d4f98a2SYan Zheng if (dirty) 17625d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 17633fd0a558SYan, Zheng if (inode) 17643fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 176583d4cfd4SJosef Bacik return ret; 17665d4f98a2SYan Zheng } 17675d4f98a2SYan Zheng 17685d4f98a2SYan Zheng static noinline_for_stack 17695d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 17705d4f98a2SYan Zheng struct btrfs_path *path, int level) 17715d4f98a2SYan Zheng { 17725d4f98a2SYan Zheng struct btrfs_disk_key key1; 17735d4f98a2SYan Zheng struct btrfs_disk_key key2; 17745d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 17755d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 17765d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 17775d4f98a2SYan Zheng } 17785d4f98a2SYan Zheng 17795d4f98a2SYan Zheng /* 17805d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 17815d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 17825d4f98a2SYan Zheng * reloc tree was create can be replaced. 17835d4f98a2SYan Zheng * 17845d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 17855d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 17865d4f98a2SYan Zheng * errors, a negative error number is returned. 17875d4f98a2SYan Zheng */ 17883fd0a558SYan, Zheng static noinline_for_stack 17893fd0a558SYan, Zheng int replace_path(struct btrfs_trans_handle *trans, 17905d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 17915d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 17925d4f98a2SYan Zheng int lowest_level, int max_level) 17935d4f98a2SYan Zheng { 17940b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = dest->fs_info; 17955d4f98a2SYan Zheng struct extent_buffer *eb; 17965d4f98a2SYan Zheng struct extent_buffer *parent; 17975d4f98a2SYan Zheng struct btrfs_key key; 17985d4f98a2SYan Zheng u64 old_bytenr; 17995d4f98a2SYan Zheng u64 new_bytenr; 18005d4f98a2SYan Zheng u64 old_ptr_gen; 18015d4f98a2SYan Zheng u64 new_ptr_gen; 18025d4f98a2SYan Zheng u64 last_snapshot; 18035d4f98a2SYan Zheng u32 blocksize; 18043fd0a558SYan, Zheng int cow = 0; 18055d4f98a2SYan Zheng int level; 18065d4f98a2SYan Zheng int ret; 18075d4f98a2SYan Zheng int slot; 18085d4f98a2SYan Zheng 18095d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 18105d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 18115d4f98a2SYan Zheng 18125d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 18133fd0a558SYan, Zheng again: 18145d4f98a2SYan Zheng slot = path->slots[lowest_level]; 18155d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 18165d4f98a2SYan Zheng 18175d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 18185d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 18195d4f98a2SYan Zheng level = btrfs_header_level(eb); 18205d4f98a2SYan Zheng 18215d4f98a2SYan Zheng if (level < lowest_level) { 18225d4f98a2SYan Zheng btrfs_tree_unlock(eb); 18235d4f98a2SYan Zheng free_extent_buffer(eb); 18245d4f98a2SYan Zheng return 0; 18255d4f98a2SYan Zheng } 18265d4f98a2SYan Zheng 18273fd0a558SYan, Zheng if (cow) { 18285d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 18295d4f98a2SYan Zheng BUG_ON(ret); 18303fd0a558SYan, Zheng } 18315d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 18325d4f98a2SYan Zheng 18335d4f98a2SYan Zheng if (next_key) { 18345d4f98a2SYan Zheng next_key->objectid = (u64)-1; 18355d4f98a2SYan Zheng next_key->type = (u8)-1; 18365d4f98a2SYan Zheng next_key->offset = (u64)-1; 18375d4f98a2SYan Zheng } 18385d4f98a2SYan Zheng 18395d4f98a2SYan Zheng parent = eb; 18405d4f98a2SYan Zheng while (1) { 18415d4f98a2SYan Zheng level = btrfs_header_level(parent); 18425d4f98a2SYan Zheng BUG_ON(level < lowest_level); 18435d4f98a2SYan Zheng 18445d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 18455d4f98a2SYan Zheng if (ret && slot > 0) 18465d4f98a2SYan Zheng slot--; 18475d4f98a2SYan Zheng 18485d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 18495d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 18505d4f98a2SYan Zheng 18515d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 18520b246afaSJeff Mahoney blocksize = fs_info->nodesize; 18535d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 18545d4f98a2SYan Zheng 18555d4f98a2SYan Zheng if (level <= max_level) { 18565d4f98a2SYan Zheng eb = path->nodes[level]; 18575d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 18585d4f98a2SYan Zheng path->slots[level]); 18595d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 18605d4f98a2SYan Zheng path->slots[level]); 18615d4f98a2SYan Zheng } else { 18625d4f98a2SYan Zheng new_bytenr = 0; 18635d4f98a2SYan Zheng new_ptr_gen = 0; 18645d4f98a2SYan Zheng } 18655d4f98a2SYan Zheng 1866fae7f21cSDulshani Gunawardhana if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) { 18675d4f98a2SYan Zheng ret = level; 18685d4f98a2SYan Zheng break; 18695d4f98a2SYan Zheng } 18705d4f98a2SYan Zheng 18715d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 18725d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 18733fd0a558SYan, Zheng if (level <= lowest_level) { 18745d4f98a2SYan Zheng ret = 0; 18755d4f98a2SYan Zheng break; 18765d4f98a2SYan Zheng } 18775d4f98a2SYan Zheng 18782ff7e61eSJeff Mahoney eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen); 187964c043deSLiu Bo if (IS_ERR(eb)) { 188064c043deSLiu Bo ret = PTR_ERR(eb); 1881264813acSLiu Bo break; 188264c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 188364c043deSLiu Bo ret = -EIO; 1884416bc658SJosef Bacik free_extent_buffer(eb); 1885379cde74SStefan Behrens break; 1886416bc658SJosef Bacik } 18875d4f98a2SYan Zheng btrfs_tree_lock(eb); 18883fd0a558SYan, Zheng if (cow) { 18895d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 18905d4f98a2SYan Zheng slot, &eb); 18915d4f98a2SYan Zheng BUG_ON(ret); 18925d4f98a2SYan Zheng } 18933fd0a558SYan, Zheng btrfs_set_lock_blocking(eb); 18945d4f98a2SYan Zheng 18955d4f98a2SYan Zheng btrfs_tree_unlock(parent); 18965d4f98a2SYan Zheng free_extent_buffer(parent); 18975d4f98a2SYan Zheng 18985d4f98a2SYan Zheng parent = eb; 18995d4f98a2SYan Zheng continue; 19005d4f98a2SYan Zheng } 19015d4f98a2SYan Zheng 19023fd0a558SYan, Zheng if (!cow) { 19033fd0a558SYan, Zheng btrfs_tree_unlock(parent); 19043fd0a558SYan, Zheng free_extent_buffer(parent); 19053fd0a558SYan, Zheng cow = 1; 19063fd0a558SYan, Zheng goto again; 19073fd0a558SYan, Zheng } 19083fd0a558SYan, Zheng 19095d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 19105d4f98a2SYan Zheng path->slots[level]); 1911b3b4aa74SDavid Sterba btrfs_release_path(path); 19125d4f98a2SYan Zheng 19135d4f98a2SYan Zheng path->lowest_level = level; 19145d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 19155d4f98a2SYan Zheng path->lowest_level = 0; 19165d4f98a2SYan Zheng BUG_ON(ret); 19175d4f98a2SYan Zheng 19185d4f98a2SYan Zheng /* 1919824d8dffSQu Wenruo * Info qgroup to trace both subtrees. 1920824d8dffSQu Wenruo * 1921824d8dffSQu Wenruo * We must trace both trees. 1922824d8dffSQu Wenruo * 1) Tree reloc subtree 1923824d8dffSQu Wenruo * If not traced, we will leak data numbers 1924824d8dffSQu Wenruo * 2) Fs subtree 1925824d8dffSQu Wenruo * If not traced, we will double count old data 1926824d8dffSQu Wenruo * and tree block numbers, if current trans doesn't free 1927824d8dffSQu Wenruo * data reloc tree inode. 1928824d8dffSQu Wenruo */ 1929824d8dffSQu Wenruo ret = btrfs_qgroup_trace_subtree(trans, src, parent, 1930824d8dffSQu Wenruo btrfs_header_generation(parent), 1931824d8dffSQu Wenruo btrfs_header_level(parent)); 1932824d8dffSQu Wenruo if (ret < 0) 1933824d8dffSQu Wenruo break; 1934824d8dffSQu Wenruo ret = btrfs_qgroup_trace_subtree(trans, dest, 1935824d8dffSQu Wenruo path->nodes[level], 1936824d8dffSQu Wenruo btrfs_header_generation(path->nodes[level]), 1937824d8dffSQu Wenruo btrfs_header_level(path->nodes[level])); 1938824d8dffSQu Wenruo if (ret < 0) 1939824d8dffSQu Wenruo break; 1940824d8dffSQu Wenruo 1941824d8dffSQu Wenruo /* 19425d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 19435d4f98a2SYan Zheng */ 19445d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 19455d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 19465d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 19475d4f98a2SYan Zheng 19485d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 19495d4f98a2SYan Zheng path->slots[level], old_bytenr); 19505d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 19515d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 19525d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 19535d4f98a2SYan Zheng 19542ff7e61eSJeff Mahoney ret = btrfs_inc_extent_ref(trans, fs_info, old_bytenr, 19552ff7e61eSJeff Mahoney blocksize, path->nodes[level]->start, 1956b06c4bf5SFilipe Manana src->root_key.objectid, level - 1, 0); 19575d4f98a2SYan Zheng BUG_ON(ret); 19582ff7e61eSJeff Mahoney ret = btrfs_inc_extent_ref(trans, fs_info, new_bytenr, 19592ff7e61eSJeff Mahoney blocksize, 0, dest->root_key.objectid, 19602ff7e61eSJeff Mahoney level - 1, 0); 19615d4f98a2SYan Zheng BUG_ON(ret); 19625d4f98a2SYan Zheng 19632ff7e61eSJeff Mahoney ret = btrfs_free_extent(trans, fs_info, new_bytenr, blocksize, 19645d4f98a2SYan Zheng path->nodes[level]->start, 1965b06c4bf5SFilipe Manana src->root_key.objectid, level - 1, 0); 19665d4f98a2SYan Zheng BUG_ON(ret); 19675d4f98a2SYan Zheng 19682ff7e61eSJeff Mahoney ret = btrfs_free_extent(trans, fs_info, old_bytenr, blocksize, 19695d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 1970b06c4bf5SFilipe Manana 0); 19715d4f98a2SYan Zheng BUG_ON(ret); 19725d4f98a2SYan Zheng 19735d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 19745d4f98a2SYan Zheng 19755d4f98a2SYan Zheng ret = level; 19765d4f98a2SYan Zheng break; 19775d4f98a2SYan Zheng } 19785d4f98a2SYan Zheng btrfs_tree_unlock(parent); 19795d4f98a2SYan Zheng free_extent_buffer(parent); 19805d4f98a2SYan Zheng return ret; 19815d4f98a2SYan Zheng } 19825d4f98a2SYan Zheng 19835d4f98a2SYan Zheng /* 19845d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 19855d4f98a2SYan Zheng */ 19865d4f98a2SYan Zheng static noinline_for_stack 19875d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 19885d4f98a2SYan Zheng int *level) 19895d4f98a2SYan Zheng { 19905d4f98a2SYan Zheng struct extent_buffer *eb; 19915d4f98a2SYan Zheng int i; 19925d4f98a2SYan Zheng u64 last_snapshot; 19935d4f98a2SYan Zheng u32 nritems; 19945d4f98a2SYan Zheng 19955d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19965d4f98a2SYan Zheng 19975d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 19985d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 19995d4f98a2SYan Zheng path->nodes[i] = NULL; 20005d4f98a2SYan Zheng } 20015d4f98a2SYan Zheng 20025d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 20035d4f98a2SYan Zheng eb = path->nodes[i]; 20045d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 20055d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 20065d4f98a2SYan Zheng path->slots[i]++; 20075d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 20085d4f98a2SYan Zheng last_snapshot) 20095d4f98a2SYan Zheng continue; 20105d4f98a2SYan Zheng 20115d4f98a2SYan Zheng *level = i; 20125d4f98a2SYan Zheng return 0; 20135d4f98a2SYan Zheng } 20145d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 20155d4f98a2SYan Zheng path->nodes[i] = NULL; 20165d4f98a2SYan Zheng } 20175d4f98a2SYan Zheng return 1; 20185d4f98a2SYan Zheng } 20195d4f98a2SYan Zheng 20205d4f98a2SYan Zheng /* 20215d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 20225d4f98a2SYan Zheng */ 20235d4f98a2SYan Zheng static noinline_for_stack 20245d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 20255d4f98a2SYan Zheng int *level) 20265d4f98a2SYan Zheng { 20272ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 20285d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 20295d4f98a2SYan Zheng int i; 20305d4f98a2SYan Zheng u64 bytenr; 20315d4f98a2SYan Zheng u64 ptr_gen = 0; 20325d4f98a2SYan Zheng u64 last_snapshot; 20335d4f98a2SYan Zheng u32 nritems; 20345d4f98a2SYan Zheng 20355d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 20365d4f98a2SYan Zheng 20375d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 20385d4f98a2SYan Zheng eb = path->nodes[i]; 20395d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 20405d4f98a2SYan Zheng while (path->slots[i] < nritems) { 20415d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 20425d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 20435d4f98a2SYan Zheng break; 20445d4f98a2SYan Zheng path->slots[i]++; 20455d4f98a2SYan Zheng } 20465d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 20475d4f98a2SYan Zheng if (i == *level) 20485d4f98a2SYan Zheng break; 20495d4f98a2SYan Zheng *level = i + 1; 20505d4f98a2SYan Zheng return 0; 20515d4f98a2SYan Zheng } 20525d4f98a2SYan Zheng if (i == 1) { 20535d4f98a2SYan Zheng *level = i; 20545d4f98a2SYan Zheng return 0; 20555d4f98a2SYan Zheng } 20565d4f98a2SYan Zheng 20575d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 20582ff7e61eSJeff Mahoney eb = read_tree_block(fs_info, bytenr, ptr_gen); 205964c043deSLiu Bo if (IS_ERR(eb)) { 206064c043deSLiu Bo return PTR_ERR(eb); 206164c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2062416bc658SJosef Bacik free_extent_buffer(eb); 2063416bc658SJosef Bacik return -EIO; 2064416bc658SJosef Bacik } 20655d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 20665d4f98a2SYan Zheng path->nodes[i - 1] = eb; 20675d4f98a2SYan Zheng path->slots[i - 1] = 0; 20685d4f98a2SYan Zheng } 20695d4f98a2SYan Zheng return 1; 20705d4f98a2SYan Zheng } 20715d4f98a2SYan Zheng 20725d4f98a2SYan Zheng /* 20735d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 20745d4f98a2SYan Zheng * [min_key, max_key) 20755d4f98a2SYan Zheng */ 20765d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 20775d4f98a2SYan Zheng struct btrfs_key *min_key, 20785d4f98a2SYan Zheng struct btrfs_key *max_key) 20795d4f98a2SYan Zheng { 20800b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 20815d4f98a2SYan Zheng struct inode *inode = NULL; 20825d4f98a2SYan Zheng u64 objectid; 20835d4f98a2SYan Zheng u64 start, end; 208433345d01SLi Zefan u64 ino; 20855d4f98a2SYan Zheng 20865d4f98a2SYan Zheng objectid = min_key->objectid; 20875d4f98a2SYan Zheng while (1) { 20885d4f98a2SYan Zheng cond_resched(); 20895d4f98a2SYan Zheng iput(inode); 20905d4f98a2SYan Zheng 20915d4f98a2SYan Zheng if (objectid > max_key->objectid) 20925d4f98a2SYan Zheng break; 20935d4f98a2SYan Zheng 20945d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 20955d4f98a2SYan Zheng if (!inode) 20965d4f98a2SYan Zheng break; 20974a0cc7caSNikolay Borisov ino = btrfs_ino(BTRFS_I(inode)); 20985d4f98a2SYan Zheng 209933345d01SLi Zefan if (ino > max_key->objectid) { 21005d4f98a2SYan Zheng iput(inode); 21015d4f98a2SYan Zheng break; 21025d4f98a2SYan Zheng } 21035d4f98a2SYan Zheng 210433345d01SLi Zefan objectid = ino + 1; 21055d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 21065d4f98a2SYan Zheng continue; 21075d4f98a2SYan Zheng 210833345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 21095d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 21105d4f98a2SYan Zheng continue; 21115d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 21125d4f98a2SYan Zheng start = 0; 21135d4f98a2SYan Zheng else { 21145d4f98a2SYan Zheng start = min_key->offset; 21150b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize)); 21165d4f98a2SYan Zheng } 21175d4f98a2SYan Zheng } else { 21185d4f98a2SYan Zheng start = 0; 21195d4f98a2SYan Zheng } 21205d4f98a2SYan Zheng 212133345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 21225d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 21235d4f98a2SYan Zheng continue; 21245d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 21255d4f98a2SYan Zheng end = (u64)-1; 21265d4f98a2SYan Zheng } else { 21275d4f98a2SYan Zheng if (max_key->offset == 0) 21285d4f98a2SYan Zheng continue; 21295d4f98a2SYan Zheng end = max_key->offset; 21300b246afaSJeff Mahoney WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize)); 21315d4f98a2SYan Zheng end--; 21325d4f98a2SYan Zheng } 21335d4f98a2SYan Zheng } else { 21345d4f98a2SYan Zheng end = (u64)-1; 21355d4f98a2SYan Zheng } 21365d4f98a2SYan Zheng 21375d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2138d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 2139dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1); 2140d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 21415d4f98a2SYan Zheng } 21425d4f98a2SYan Zheng return 0; 21435d4f98a2SYan Zheng } 21445d4f98a2SYan Zheng 21455d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 21465d4f98a2SYan Zheng struct btrfs_key *key) 21475d4f98a2SYan Zheng 21485d4f98a2SYan Zheng { 21495d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 21505d4f98a2SYan Zheng if (!path->nodes[level]) 21515d4f98a2SYan Zheng break; 21525d4f98a2SYan Zheng if (path->slots[level] + 1 < 21535d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 21545d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 21555d4f98a2SYan Zheng path->slots[level] + 1); 21565d4f98a2SYan Zheng return 0; 21575d4f98a2SYan Zheng } 21585d4f98a2SYan Zheng level++; 21595d4f98a2SYan Zheng } 21605d4f98a2SYan Zheng return 1; 21615d4f98a2SYan Zheng } 21625d4f98a2SYan Zheng 21635d4f98a2SYan Zheng /* 21645d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 21655d4f98a2SYan Zheng * fs tree. 21665d4f98a2SYan Zheng */ 21675d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 21685d4f98a2SYan Zheng struct btrfs_root *root) 21695d4f98a2SYan Zheng { 21700b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 21715d4f98a2SYan Zheng LIST_HEAD(inode_list); 21725d4f98a2SYan Zheng struct btrfs_key key; 21735d4f98a2SYan Zheng struct btrfs_key next_key; 21749e6a0c52SJosef Bacik struct btrfs_trans_handle *trans = NULL; 21755d4f98a2SYan Zheng struct btrfs_root *reloc_root; 21765d4f98a2SYan Zheng struct btrfs_root_item *root_item; 21775d4f98a2SYan Zheng struct btrfs_path *path; 21783fd0a558SYan, Zheng struct extent_buffer *leaf; 21795d4f98a2SYan Zheng int level; 21805d4f98a2SYan Zheng int max_level; 21815d4f98a2SYan Zheng int replaced = 0; 21825d4f98a2SYan Zheng int ret; 21835d4f98a2SYan Zheng int err = 0; 21843fd0a558SYan, Zheng u32 min_reserved; 21855d4f98a2SYan Zheng 21865d4f98a2SYan Zheng path = btrfs_alloc_path(); 21875d4f98a2SYan Zheng if (!path) 21885d4f98a2SYan Zheng return -ENOMEM; 2189e4058b54SDavid Sterba path->reada = READA_FORWARD; 21905d4f98a2SYan Zheng 21915d4f98a2SYan Zheng reloc_root = root->reloc_root; 21925d4f98a2SYan Zheng root_item = &reloc_root->root_item; 21935d4f98a2SYan Zheng 21945d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 21955d4f98a2SYan Zheng level = btrfs_root_level(root_item); 21965d4f98a2SYan Zheng extent_buffer_get(reloc_root->node); 21975d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 21985d4f98a2SYan Zheng path->slots[level] = 0; 21995d4f98a2SYan Zheng } else { 22005d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 22015d4f98a2SYan Zheng 22025d4f98a2SYan Zheng level = root_item->drop_level; 22035d4f98a2SYan Zheng BUG_ON(level == 0); 22045d4f98a2SYan Zheng path->lowest_level = level; 22055d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 220633c66f43SYan Zheng path->lowest_level = 0; 22075d4f98a2SYan Zheng if (ret < 0) { 22085d4f98a2SYan Zheng btrfs_free_path(path); 22095d4f98a2SYan Zheng return ret; 22105d4f98a2SYan Zheng } 22115d4f98a2SYan Zheng 22125d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 22135d4f98a2SYan Zheng path->slots[level]); 22145d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 22155d4f98a2SYan Zheng 22165d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 22175d4f98a2SYan Zheng } 22185d4f98a2SYan Zheng 22190b246afaSJeff Mahoney min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 22205d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 22215d4f98a2SYan Zheng 22225d4f98a2SYan Zheng while (1) { 222308e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 222408e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 22253fd0a558SYan, Zheng if (ret) { 22269e6a0c52SJosef Bacik err = ret; 22279e6a0c52SJosef Bacik goto out; 22283fd0a558SYan, Zheng } 22299e6a0c52SJosef Bacik trans = btrfs_start_transaction(root, 0); 22309e6a0c52SJosef Bacik if (IS_ERR(trans)) { 22319e6a0c52SJosef Bacik err = PTR_ERR(trans); 22329e6a0c52SJosef Bacik trans = NULL; 22339e6a0c52SJosef Bacik goto out; 22349e6a0c52SJosef Bacik } 22359e6a0c52SJosef Bacik trans->block_rsv = rc->block_rsv; 22363fd0a558SYan, Zheng 22373fd0a558SYan, Zheng replaced = 0; 22385d4f98a2SYan Zheng max_level = level; 22395d4f98a2SYan Zheng 22405d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 22415d4f98a2SYan Zheng if (ret < 0) { 22425d4f98a2SYan Zheng err = ret; 22435d4f98a2SYan Zheng goto out; 22445d4f98a2SYan Zheng } 22455d4f98a2SYan Zheng if (ret > 0) 22465d4f98a2SYan Zheng break; 22475d4f98a2SYan Zheng 22485d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 22495d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 22505d4f98a2SYan Zheng ret = 0; 22515d4f98a2SYan Zheng } else { 22523fd0a558SYan, Zheng ret = replace_path(trans, root, reloc_root, path, 22533fd0a558SYan, Zheng &next_key, level, max_level); 22545d4f98a2SYan Zheng } 22555d4f98a2SYan Zheng if (ret < 0) { 22565d4f98a2SYan Zheng err = ret; 22575d4f98a2SYan Zheng goto out; 22585d4f98a2SYan Zheng } 22595d4f98a2SYan Zheng 22605d4f98a2SYan Zheng if (ret > 0) { 22615d4f98a2SYan Zheng level = ret; 22625d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 22635d4f98a2SYan Zheng path->slots[level]); 22645d4f98a2SYan Zheng replaced = 1; 22655d4f98a2SYan Zheng } 22665d4f98a2SYan Zheng 22675d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 22685d4f98a2SYan Zheng if (ret > 0) 22695d4f98a2SYan Zheng break; 22705d4f98a2SYan Zheng 22715d4f98a2SYan Zheng BUG_ON(level == 0); 22725d4f98a2SYan Zheng /* 22735d4f98a2SYan Zheng * save the merging progress in the drop_progress. 22745d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 22755d4f98a2SYan Zheng */ 22765d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 22775d4f98a2SYan Zheng path->slots[level]); 22785d4f98a2SYan Zheng root_item->drop_level = level; 22795d4f98a2SYan Zheng 22803a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 22819e6a0c52SJosef Bacik trans = NULL; 22825d4f98a2SYan Zheng 22832ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 22845d4f98a2SYan Zheng 22855d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 22865d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 22875d4f98a2SYan Zheng } 22885d4f98a2SYan Zheng 22895d4f98a2SYan Zheng /* 22905d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 22915d4f98a2SYan Zheng * relocated and the block is tree root. 22925d4f98a2SYan Zheng */ 22935d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 22945d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 22955d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 22965d4f98a2SYan Zheng free_extent_buffer(leaf); 22975d4f98a2SYan Zheng if (ret < 0) 22985d4f98a2SYan Zheng err = ret; 22995d4f98a2SYan Zheng out: 23005d4f98a2SYan Zheng btrfs_free_path(path); 23015d4f98a2SYan Zheng 23025d4f98a2SYan Zheng if (err == 0) { 23035d4f98a2SYan Zheng memset(&root_item->drop_progress, 0, 23045d4f98a2SYan Zheng sizeof(root_item->drop_progress)); 23055d4f98a2SYan Zheng root_item->drop_level = 0; 23065d4f98a2SYan Zheng btrfs_set_root_refs(root_item, 0); 23073fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 23085d4f98a2SYan Zheng } 23095d4f98a2SYan Zheng 23109e6a0c52SJosef Bacik if (trans) 23113a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 23125d4f98a2SYan Zheng 23132ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 23145d4f98a2SYan Zheng 23155d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 23165d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 23175d4f98a2SYan Zheng 23185d4f98a2SYan Zheng return err; 23195d4f98a2SYan Zheng } 23205d4f98a2SYan Zheng 23213fd0a558SYan, Zheng static noinline_for_stack 23223fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 23235d4f98a2SYan Zheng { 23243fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 23250b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 23263fd0a558SYan, Zheng struct btrfs_root *reloc_root; 23275d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 23283fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 23293fd0a558SYan, Zheng u64 num_bytes = 0; 23303fd0a558SYan, Zheng int ret; 23313fd0a558SYan, Zheng 23320b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 23330b246afaSJeff Mahoney rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 23343fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 23350b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 23367585717fSChris Mason 23373fd0a558SYan, Zheng again: 23383fd0a558SYan, Zheng if (!err) { 23393fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 234008e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 234108e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 23423fd0a558SYan, Zheng if (ret) 23433fd0a558SYan, Zheng err = ret; 23443fd0a558SYan, Zheng } 23453fd0a558SYan, Zheng 23467a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 23473612b495STsutomu Itoh if (IS_ERR(trans)) { 23483612b495STsutomu Itoh if (!err) 23492ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 23502ff7e61eSJeff Mahoney num_bytes); 23513612b495STsutomu Itoh return PTR_ERR(trans); 23523612b495STsutomu Itoh } 23533fd0a558SYan, Zheng 23543fd0a558SYan, Zheng if (!err) { 23553fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 23563a45bb20SJeff Mahoney btrfs_end_transaction(trans); 23572ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, 23582ff7e61eSJeff Mahoney num_bytes); 23593fd0a558SYan, Zheng goto again; 23603fd0a558SYan, Zheng } 23613fd0a558SYan, Zheng } 23623fd0a558SYan, Zheng 23633fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 23643fd0a558SYan, Zheng 23653fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 23663fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 23673fd0a558SYan, Zheng struct btrfs_root, root_list); 23683fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 23693fd0a558SYan, Zheng 23700b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 23713fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 23723fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 23733fd0a558SYan, Zheng 23743fd0a558SYan, Zheng /* 23753fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 23763fd0a558SYan, Zheng * knows it should resumes merging 23773fd0a558SYan, Zheng */ 23783fd0a558SYan, Zheng if (!err) 23793fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 23803fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 23813fd0a558SYan, Zheng 23823fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 23833fd0a558SYan, Zheng } 23843fd0a558SYan, Zheng 23853fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 23863fd0a558SYan, Zheng 23873fd0a558SYan, Zheng if (!err) 23883a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 23893fd0a558SYan, Zheng else 23903a45bb20SJeff Mahoney btrfs_end_transaction(trans); 23913fd0a558SYan, Zheng return err; 23923fd0a558SYan, Zheng } 23933fd0a558SYan, Zheng 23943fd0a558SYan, Zheng static noinline_for_stack 2395aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2396aca1bba6SLiu Bo { 2397aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2398aca1bba6SLiu Bo 2399aca1bba6SLiu Bo while (!list_empty(list)) { 2400aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2401aca1bba6SLiu Bo root_list); 24026bdf131fSJosef Bacik free_extent_buffer(reloc_root->node); 24036bdf131fSJosef Bacik free_extent_buffer(reloc_root->commit_root); 24046bdf131fSJosef Bacik reloc_root->node = NULL; 24056bdf131fSJosef Bacik reloc_root->commit_root = NULL; 2406c974c464SWang Shilong __del_reloc_root(reloc_root); 2407aca1bba6SLiu Bo } 2408aca1bba6SLiu Bo } 2409aca1bba6SLiu Bo 2410aca1bba6SLiu Bo static noinline_for_stack 241194404e82SDavid Sterba void merge_reloc_roots(struct reloc_control *rc) 24123fd0a558SYan, Zheng { 24130b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 24145d4f98a2SYan Zheng struct btrfs_root *root; 24155d4f98a2SYan Zheng struct btrfs_root *reloc_root; 24163fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 24173fd0a558SYan, Zheng int found = 0; 2418aca1bba6SLiu Bo int ret = 0; 24193fd0a558SYan, Zheng again: 24203fd0a558SYan, Zheng root = rc->extent_root; 24217585717fSChris Mason 24227585717fSChris Mason /* 24237585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 24247585717fSChris Mason * we have to make sure nobody is in the middle of 24257585717fSChris Mason * adding their roots to the list while we are 24267585717fSChris Mason * doing this splice 24277585717fSChris Mason */ 24280b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 24293fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 24300b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 24315d4f98a2SYan Zheng 24323fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 24333fd0a558SYan, Zheng found = 1; 24343fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 24353fd0a558SYan, Zheng struct btrfs_root, root_list); 24365d4f98a2SYan Zheng 24375d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 24380b246afaSJeff Mahoney root = read_fs_root(fs_info, 24395d4f98a2SYan Zheng reloc_root->root_key.offset); 24405d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 24415d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 24425d4f98a2SYan Zheng 24433fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 2444b37b39cdSJosef Bacik if (ret) { 244525e293c2SWang Shilong if (list_empty(&reloc_root->root_list)) 244625e293c2SWang Shilong list_add_tail(&reloc_root->root_list, 244725e293c2SWang Shilong &reloc_roots); 2448aca1bba6SLiu Bo goto out; 2449b37b39cdSJosef Bacik } 24503fd0a558SYan, Zheng } else { 24513fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 24523fd0a558SYan, Zheng } 24535bc7247aSMiao Xie 24542c536799SJeff Mahoney ret = btrfs_drop_snapshot(reloc_root, rc->block_rsv, 0, 1); 2455aca1bba6SLiu Bo if (ret < 0) { 2456aca1bba6SLiu Bo if (list_empty(&reloc_root->root_list)) 2457aca1bba6SLiu Bo list_add_tail(&reloc_root->root_list, 2458aca1bba6SLiu Bo &reloc_roots); 2459aca1bba6SLiu Bo goto out; 2460aca1bba6SLiu Bo } 24615d4f98a2SYan Zheng } 24625d4f98a2SYan Zheng 24633fd0a558SYan, Zheng if (found) { 24643fd0a558SYan, Zheng found = 0; 24653fd0a558SYan, Zheng goto again; 24665d4f98a2SYan Zheng } 2467aca1bba6SLiu Bo out: 2468aca1bba6SLiu Bo if (ret) { 24690b246afaSJeff Mahoney btrfs_handle_fs_error(fs_info, ret, NULL); 2470aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2471aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2472467bb1d2SWang Shilong 2473467bb1d2SWang Shilong /* new reloc root may be added */ 24740b246afaSJeff Mahoney mutex_lock(&fs_info->reloc_mutex); 2475467bb1d2SWang Shilong list_splice_init(&rc->reloc_roots, &reloc_roots); 24760b246afaSJeff Mahoney mutex_unlock(&fs_info->reloc_mutex); 2477467bb1d2SWang Shilong if (!list_empty(&reloc_roots)) 2478467bb1d2SWang Shilong free_reloc_roots(&reloc_roots); 2479aca1bba6SLiu Bo } 2480aca1bba6SLiu Bo 24815d4f98a2SYan Zheng BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 24825d4f98a2SYan Zheng } 24835d4f98a2SYan Zheng 24845d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 24855d4f98a2SYan Zheng { 24865d4f98a2SYan Zheng struct tree_block *block; 24875d4f98a2SYan Zheng struct rb_node *rb_node; 24885d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 24895d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 24905d4f98a2SYan Zheng rb_erase(rb_node, blocks); 24915d4f98a2SYan Zheng kfree(block); 24925d4f98a2SYan Zheng } 24935d4f98a2SYan Zheng } 24945d4f98a2SYan Zheng 24955d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 24965d4f98a2SYan Zheng struct btrfs_root *reloc_root) 24975d4f98a2SYan Zheng { 24980b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = reloc_root->fs_info; 24995d4f98a2SYan Zheng struct btrfs_root *root; 25005d4f98a2SYan Zheng 25015d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 25025d4f98a2SYan Zheng return 0; 25035d4f98a2SYan Zheng 25040b246afaSJeff Mahoney root = read_fs_root(fs_info, reloc_root->root_key.offset); 25055d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 25065d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 25075d4f98a2SYan Zheng 25085d4f98a2SYan Zheng return btrfs_record_root_in_trans(trans, root); 25095d4f98a2SYan Zheng } 25105d4f98a2SYan Zheng 25113fd0a558SYan, Zheng static noinline_for_stack 25123fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 25133fd0a558SYan, Zheng struct reloc_control *rc, 25145d4f98a2SYan Zheng struct backref_node *node, 2515dc4103f9SWang Shilong struct backref_edge *edges[]) 25165d4f98a2SYan Zheng { 25175d4f98a2SYan Zheng struct backref_node *next; 25185d4f98a2SYan Zheng struct btrfs_root *root; 25193fd0a558SYan, Zheng int index = 0; 25203fd0a558SYan, Zheng 25215d4f98a2SYan Zheng next = node; 25225d4f98a2SYan Zheng while (1) { 25235d4f98a2SYan Zheng cond_resched(); 25245d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 25255d4f98a2SYan Zheng root = next->root; 25263fd0a558SYan, Zheng BUG_ON(!root); 252727cdeb70SMiao Xie BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state)); 25285d4f98a2SYan Zheng 25295d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 25305d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 25315d4f98a2SYan Zheng break; 25325d4f98a2SYan Zheng } 25335d4f98a2SYan Zheng 25345d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 25353fd0a558SYan, Zheng root = root->reloc_root; 25363fd0a558SYan, Zheng 25373fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 25383fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 25393fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 25403fd0a558SYan, Zheng next->new_bytenr = root->node->start; 25413fd0a558SYan, Zheng next->root = root; 25423fd0a558SYan, Zheng list_add_tail(&next->list, 25433fd0a558SYan, Zheng &rc->backref_cache.changed); 25443fd0a558SYan, Zheng __mark_block_processed(rc, next); 25455d4f98a2SYan Zheng break; 25465d4f98a2SYan Zheng } 25475d4f98a2SYan Zheng 25483fd0a558SYan, Zheng WARN_ON(1); 25495d4f98a2SYan Zheng root = NULL; 25505d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 25515d4f98a2SYan Zheng if (!next || next->level <= node->level) 25525d4f98a2SYan Zheng break; 25535d4f98a2SYan Zheng } 25543fd0a558SYan, Zheng if (!root) 25553fd0a558SYan, Zheng return NULL; 25565d4f98a2SYan Zheng 25573fd0a558SYan, Zheng next = node; 25583fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 25593fd0a558SYan, Zheng while (1) { 25603fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 25613fd0a558SYan, Zheng if (--index < 0) 25623fd0a558SYan, Zheng break; 25633fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 25643fd0a558SYan, Zheng } 25655d4f98a2SYan Zheng return root; 25665d4f98a2SYan Zheng } 25675d4f98a2SYan Zheng 25683fd0a558SYan, Zheng /* 25693fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 25703fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 25713fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 25723fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 25733fd0a558SYan, Zheng */ 25745d4f98a2SYan Zheng static noinline_for_stack 2575147d256eSZhaolei struct btrfs_root *select_one_root(struct backref_node *node) 25765d4f98a2SYan Zheng { 25773fd0a558SYan, Zheng struct backref_node *next; 25783fd0a558SYan, Zheng struct btrfs_root *root; 25793fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 25805d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25813fd0a558SYan, Zheng int index = 0; 25823fd0a558SYan, Zheng 25833fd0a558SYan, Zheng next = node; 25843fd0a558SYan, Zheng while (1) { 25853fd0a558SYan, Zheng cond_resched(); 25863fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 25873fd0a558SYan, Zheng root = next->root; 25883fd0a558SYan, Zheng BUG_ON(!root); 25893fd0a558SYan, Zheng 259025985edcSLucas De Marchi /* no other choice for non-references counted tree */ 259127cdeb70SMiao Xie if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) 25923fd0a558SYan, Zheng return root; 25933fd0a558SYan, Zheng 25943fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 25953fd0a558SYan, Zheng fs_root = root; 25963fd0a558SYan, Zheng 25973fd0a558SYan, Zheng if (next != node) 25983fd0a558SYan, Zheng return NULL; 25993fd0a558SYan, Zheng 26003fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 26013fd0a558SYan, Zheng if (!next || next->level <= node->level) 26023fd0a558SYan, Zheng break; 26033fd0a558SYan, Zheng } 26043fd0a558SYan, Zheng 26053fd0a558SYan, Zheng if (!fs_root) 26063fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 26073fd0a558SYan, Zheng return fs_root; 26085d4f98a2SYan Zheng } 26095d4f98a2SYan Zheng 26105d4f98a2SYan Zheng static noinline_for_stack 26113fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 26123fd0a558SYan, Zheng struct backref_node *node, int reserve) 26135d4f98a2SYan Zheng { 26140b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 26153fd0a558SYan, Zheng struct backref_node *next = node; 26163fd0a558SYan, Zheng struct backref_edge *edge; 26173fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 26183fd0a558SYan, Zheng u64 num_bytes = 0; 26193fd0a558SYan, Zheng int index = 0; 26205d4f98a2SYan Zheng 26213fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 26223fd0a558SYan, Zheng 26233fd0a558SYan, Zheng while (next) { 26243fd0a558SYan, Zheng cond_resched(); 26255d4f98a2SYan Zheng while (1) { 26263fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 26275d4f98a2SYan Zheng break; 26285d4f98a2SYan Zheng 26290b246afaSJeff Mahoney num_bytes += fs_info->nodesize; 26303fd0a558SYan, Zheng 26313fd0a558SYan, Zheng if (list_empty(&next->upper)) 26323fd0a558SYan, Zheng break; 26333fd0a558SYan, Zheng 26343fd0a558SYan, Zheng edge = list_entry(next->upper.next, 26353fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 26363fd0a558SYan, Zheng edges[index++] = edge; 26373fd0a558SYan, Zheng next = edge->node[UPPER]; 26385d4f98a2SYan Zheng } 26393fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 26403fd0a558SYan, Zheng } 26413fd0a558SYan, Zheng return num_bytes; 26423fd0a558SYan, Zheng } 26433fd0a558SYan, Zheng 26443fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 26453fd0a558SYan, Zheng struct reloc_control *rc, 26463fd0a558SYan, Zheng struct backref_node *node) 26473fd0a558SYan, Zheng { 26483fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 2649da17066cSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 26503fd0a558SYan, Zheng u64 num_bytes; 26513fd0a558SYan, Zheng int ret; 26520647bf56SWang Shilong u64 tmp; 26533fd0a558SYan, Zheng 26543fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 26553fd0a558SYan, Zheng 26563fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 26570647bf56SWang Shilong rc->reserved_bytes += num_bytes; 26588ca17f0fSJosef Bacik 26598ca17f0fSJosef Bacik /* 26608ca17f0fSJosef Bacik * We are under a transaction here so we can only do limited flushing. 26618ca17f0fSJosef Bacik * If we get an enospc just kick back -EAGAIN so we know to drop the 26628ca17f0fSJosef Bacik * transaction and try to refill when we can flush all the things. 26638ca17f0fSJosef Bacik */ 26640647bf56SWang Shilong ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes, 26658ca17f0fSJosef Bacik BTRFS_RESERVE_FLUSH_LIMIT); 26663fd0a558SYan, Zheng if (ret) { 2667da17066cSJeff Mahoney tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES; 26680647bf56SWang Shilong while (tmp <= rc->reserved_bytes) 26690647bf56SWang Shilong tmp <<= 1; 26700647bf56SWang Shilong /* 26710647bf56SWang Shilong * only one thread can access block_rsv at this point, 26720647bf56SWang Shilong * so we don't need hold lock to protect block_rsv. 26730647bf56SWang Shilong * we expand more reservation size here to allow enough 26748ca17f0fSJosef Bacik * space for relocation and we will return eailer in 26750647bf56SWang Shilong * enospc case. 26760647bf56SWang Shilong */ 2677da17066cSJeff Mahoney rc->block_rsv->size = tmp + fs_info->nodesize * 26780647bf56SWang Shilong RELOCATION_RESERVED_NODES; 26798ca17f0fSJosef Bacik return -EAGAIN; 26803fd0a558SYan, Zheng } 26813fd0a558SYan, Zheng 26823fd0a558SYan, Zheng return 0; 26833fd0a558SYan, Zheng } 26843fd0a558SYan, Zheng 26855d4f98a2SYan Zheng /* 26865d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 26875d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 26885d4f98a2SYan Zheng * 26895d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 26905d4f98a2SYan Zheng * in that case this function just updates pointers. 26915d4f98a2SYan Zheng */ 26925d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 26933fd0a558SYan, Zheng struct reloc_control *rc, 26945d4f98a2SYan Zheng struct backref_node *node, 26955d4f98a2SYan Zheng struct btrfs_key *key, 26965d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 26975d4f98a2SYan Zheng { 26982ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 26995d4f98a2SYan Zheng struct backref_node *upper; 27005d4f98a2SYan Zheng struct backref_edge *edge; 27015d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 27025d4f98a2SYan Zheng struct btrfs_root *root; 27035d4f98a2SYan Zheng struct extent_buffer *eb; 27045d4f98a2SYan Zheng u32 blocksize; 27055d4f98a2SYan Zheng u64 bytenr; 27065d4f98a2SYan Zheng u64 generation; 27075d4f98a2SYan Zheng int slot; 27085d4f98a2SYan Zheng int ret; 27095d4f98a2SYan Zheng int err = 0; 27105d4f98a2SYan Zheng 27115d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 27125d4f98a2SYan Zheng 27135d4f98a2SYan Zheng path->lowest_level = node->level + 1; 27143fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 27155d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 27165d4f98a2SYan Zheng cond_resched(); 27175d4f98a2SYan Zheng 27185d4f98a2SYan Zheng upper = edge->node[UPPER]; 2719dc4103f9SWang Shilong root = select_reloc_root(trans, rc, upper, edges); 27203fd0a558SYan, Zheng BUG_ON(!root); 27215d4f98a2SYan Zheng 27223fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 27233fd0a558SYan, Zheng if (!lowest) { 27243fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 27253fd0a558SYan, Zheng upper->level, &slot); 27263fd0a558SYan, Zheng BUG_ON(ret); 27273fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 27283fd0a558SYan, Zheng if (node->eb->start == bytenr) 27293fd0a558SYan, Zheng goto next; 27303fd0a558SYan, Zheng } 27315d4f98a2SYan Zheng drop_node_buffer(upper); 27323fd0a558SYan, Zheng } 27335d4f98a2SYan Zheng 27345d4f98a2SYan Zheng if (!upper->eb) { 27355d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 27363561b9dbSLiu Bo if (ret) { 27373561b9dbSLiu Bo if (ret < 0) 27385d4f98a2SYan Zheng err = ret; 27393561b9dbSLiu Bo else 27403561b9dbSLiu Bo err = -ENOENT; 27413561b9dbSLiu Bo 27423561b9dbSLiu Bo btrfs_release_path(path); 27435d4f98a2SYan Zheng break; 27445d4f98a2SYan Zheng } 27455d4f98a2SYan Zheng 27463fd0a558SYan, Zheng if (!upper->eb) { 27473fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 27483fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 27493fd0a558SYan, Zheng } else { 27503fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 27513fd0a558SYan, Zheng } 27523fd0a558SYan, Zheng 27533fd0a558SYan, Zheng upper->locked = 1; 27543fd0a558SYan, Zheng path->locks[upper->level] = 0; 27553fd0a558SYan, Zheng 27565d4f98a2SYan Zheng slot = path->slots[upper->level]; 2757b3b4aa74SDavid Sterba btrfs_release_path(path); 27585d4f98a2SYan Zheng } else { 27595d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 27605d4f98a2SYan Zheng &slot); 27615d4f98a2SYan Zheng BUG_ON(ret); 27625d4f98a2SYan Zheng } 27635d4f98a2SYan Zheng 27645d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 27653fd0a558SYan, Zheng if (lowest) { 27664547f4d8SLiu Bo if (bytenr != node->bytenr) { 27674547f4d8SLiu Bo btrfs_err(root->fs_info, 27684547f4d8SLiu Bo "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu", 27694547f4d8SLiu Bo bytenr, node->bytenr, slot, 27704547f4d8SLiu Bo upper->eb->start); 27714547f4d8SLiu Bo err = -EIO; 27724547f4d8SLiu Bo goto next; 27734547f4d8SLiu Bo } 27745d4f98a2SYan Zheng } else { 27753fd0a558SYan, Zheng if (node->eb->start == bytenr) 27763fd0a558SYan, Zheng goto next; 27775d4f98a2SYan Zheng } 27785d4f98a2SYan Zheng 2779da17066cSJeff Mahoney blocksize = root->fs_info->nodesize; 27805d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 27812ff7e61eSJeff Mahoney eb = read_tree_block(fs_info, bytenr, generation); 278264c043deSLiu Bo if (IS_ERR(eb)) { 278364c043deSLiu Bo err = PTR_ERR(eb); 278464c043deSLiu Bo goto next; 278564c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2786416bc658SJosef Bacik free_extent_buffer(eb); 278797d9a8a4STsutomu Itoh err = -EIO; 278897d9a8a4STsutomu Itoh goto next; 278997d9a8a4STsutomu Itoh } 27905d4f98a2SYan Zheng btrfs_tree_lock(eb); 27915d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 27925d4f98a2SYan Zheng 27935d4f98a2SYan Zheng if (!node->eb) { 27945d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 27955d4f98a2SYan Zheng slot, &eb); 27963fd0a558SYan, Zheng btrfs_tree_unlock(eb); 27973fd0a558SYan, Zheng free_extent_buffer(eb); 27985d4f98a2SYan Zheng if (ret < 0) { 27995d4f98a2SYan Zheng err = ret; 28003fd0a558SYan, Zheng goto next; 28015d4f98a2SYan Zheng } 28023fd0a558SYan, Zheng BUG_ON(node->eb != eb); 28035d4f98a2SYan Zheng } else { 28045d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 28055d4f98a2SYan Zheng node->eb->start); 28065d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 28075d4f98a2SYan Zheng trans->transid); 28085d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 28095d4f98a2SYan Zheng 28102ff7e61eSJeff Mahoney ret = btrfs_inc_extent_ref(trans, root->fs_info, 28115d4f98a2SYan Zheng node->eb->start, blocksize, 28125d4f98a2SYan Zheng upper->eb->start, 28135d4f98a2SYan Zheng btrfs_header_owner(upper->eb), 2814b06c4bf5SFilipe Manana node->level, 0); 28155d4f98a2SYan Zheng BUG_ON(ret); 28165d4f98a2SYan Zheng 28175d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 28185d4f98a2SYan Zheng BUG_ON(ret); 28195d4f98a2SYan Zheng } 28203fd0a558SYan, Zheng next: 28213fd0a558SYan, Zheng if (!upper->pending) 28223fd0a558SYan, Zheng drop_node_buffer(upper); 28233fd0a558SYan, Zheng else 28243fd0a558SYan, Zheng unlock_node_buffer(upper); 28253fd0a558SYan, Zheng if (err) 28263fd0a558SYan, Zheng break; 28275d4f98a2SYan Zheng } 28283fd0a558SYan, Zheng 28293fd0a558SYan, Zheng if (!err && node->pending) { 28303fd0a558SYan, Zheng drop_node_buffer(node); 28313fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 28323fd0a558SYan, Zheng node->pending = 0; 28335d4f98a2SYan Zheng } 28343fd0a558SYan, Zheng 28355d4f98a2SYan Zheng path->lowest_level = 0; 28363fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 28375d4f98a2SYan Zheng return err; 28385d4f98a2SYan Zheng } 28395d4f98a2SYan Zheng 28405d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 28413fd0a558SYan, Zheng struct reloc_control *rc, 28425d4f98a2SYan Zheng struct backref_node *node, 28435d4f98a2SYan Zheng struct btrfs_path *path) 28445d4f98a2SYan Zheng { 28455d4f98a2SYan Zheng struct btrfs_key key; 28465d4f98a2SYan Zheng 28475d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 28483fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 28495d4f98a2SYan Zheng } 28505d4f98a2SYan Zheng 28515d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 28523fd0a558SYan, Zheng struct reloc_control *rc, 28533fd0a558SYan, Zheng struct btrfs_path *path, int err) 28545d4f98a2SYan Zheng { 28553fd0a558SYan, Zheng LIST_HEAD(list); 28563fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 28575d4f98a2SYan Zheng struct backref_node *node; 28585d4f98a2SYan Zheng int level; 28595d4f98a2SYan Zheng int ret; 28605d4f98a2SYan Zheng 28615d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 28625d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 28635d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 28643fd0a558SYan, Zheng struct backref_node, list); 28653fd0a558SYan, Zheng list_move_tail(&node->list, &list); 28663fd0a558SYan, Zheng BUG_ON(!node->pending); 28675d4f98a2SYan Zheng 28683fd0a558SYan, Zheng if (!err) { 28693fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 28705d4f98a2SYan Zheng if (ret < 0) 28715d4f98a2SYan Zheng err = ret; 28725d4f98a2SYan Zheng } 28735d4f98a2SYan Zheng } 28743fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 28753fd0a558SYan, Zheng } 28765d4f98a2SYan Zheng return err; 28775d4f98a2SYan Zheng } 28785d4f98a2SYan Zheng 28795d4f98a2SYan Zheng static void mark_block_processed(struct reloc_control *rc, 28803fd0a558SYan, Zheng u64 bytenr, u32 blocksize) 28813fd0a558SYan, Zheng { 28823fd0a558SYan, Zheng set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, 2883ceeb0ae7SDavid Sterba EXTENT_DIRTY); 28843fd0a558SYan, Zheng } 28853fd0a558SYan, Zheng 28863fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 28875d4f98a2SYan Zheng struct backref_node *node) 28885d4f98a2SYan Zheng { 28895d4f98a2SYan Zheng u32 blocksize; 28905d4f98a2SYan Zheng if (node->level == 0 || 28915d4f98a2SYan Zheng in_block_group(node->bytenr, rc->block_group)) { 2892da17066cSJeff Mahoney blocksize = rc->extent_root->fs_info->nodesize; 28933fd0a558SYan, Zheng mark_block_processed(rc, node->bytenr, blocksize); 28945d4f98a2SYan Zheng } 28955d4f98a2SYan Zheng node->processed = 1; 28965d4f98a2SYan Zheng } 28975d4f98a2SYan Zheng 28985d4f98a2SYan Zheng /* 28995d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 29005d4f98a2SYan Zheng * as processed. 29015d4f98a2SYan Zheng */ 29025d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 29035d4f98a2SYan Zheng struct backref_node *node) 29045d4f98a2SYan Zheng { 29055d4f98a2SYan Zheng struct backref_node *next = node; 29065d4f98a2SYan Zheng struct backref_edge *edge; 29075d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 29085d4f98a2SYan Zheng int index = 0; 29095d4f98a2SYan Zheng 29105d4f98a2SYan Zheng while (next) { 29115d4f98a2SYan Zheng cond_resched(); 29125d4f98a2SYan Zheng while (1) { 29135d4f98a2SYan Zheng if (next->processed) 29145d4f98a2SYan Zheng break; 29155d4f98a2SYan Zheng 29163fd0a558SYan, Zheng __mark_block_processed(rc, next); 29175d4f98a2SYan Zheng 29185d4f98a2SYan Zheng if (list_empty(&next->upper)) 29195d4f98a2SYan Zheng break; 29205d4f98a2SYan Zheng 29215d4f98a2SYan Zheng edge = list_entry(next->upper.next, 29225d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 29235d4f98a2SYan Zheng edges[index++] = edge; 29245d4f98a2SYan Zheng next = edge->node[UPPER]; 29255d4f98a2SYan Zheng } 29265d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 29275d4f98a2SYan Zheng } 29285d4f98a2SYan Zheng } 29295d4f98a2SYan Zheng 29307476dfdaSDavid Sterba static int tree_block_processed(u64 bytenr, struct reloc_control *rc) 29315d4f98a2SYan Zheng { 2932da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 29337476dfdaSDavid Sterba 29345d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 29359655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 29365d4f98a2SYan Zheng return 1; 29375d4f98a2SYan Zheng return 0; 29385d4f98a2SYan Zheng } 29395d4f98a2SYan Zheng 29402ff7e61eSJeff Mahoney static int get_tree_block_key(struct btrfs_fs_info *fs_info, 29415d4f98a2SYan Zheng struct tree_block *block) 29425d4f98a2SYan Zheng { 29435d4f98a2SYan Zheng struct extent_buffer *eb; 29445d4f98a2SYan Zheng 29455d4f98a2SYan Zheng BUG_ON(block->key_ready); 29462ff7e61eSJeff Mahoney eb = read_tree_block(fs_info, block->bytenr, block->key.offset); 294764c043deSLiu Bo if (IS_ERR(eb)) { 294864c043deSLiu Bo return PTR_ERR(eb); 294964c043deSLiu Bo } else if (!extent_buffer_uptodate(eb)) { 2950416bc658SJosef Bacik free_extent_buffer(eb); 2951416bc658SJosef Bacik return -EIO; 2952416bc658SJosef Bacik } 29535d4f98a2SYan Zheng WARN_ON(btrfs_header_level(eb) != block->level); 29545d4f98a2SYan Zheng if (block->level == 0) 29555d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 29565d4f98a2SYan Zheng else 29575d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 29585d4f98a2SYan Zheng free_extent_buffer(eb); 29595d4f98a2SYan Zheng block->key_ready = 1; 29605d4f98a2SYan Zheng return 0; 29615d4f98a2SYan Zheng } 29625d4f98a2SYan Zheng 29635d4f98a2SYan Zheng /* 29645d4f98a2SYan Zheng * helper function to relocate a tree block 29655d4f98a2SYan Zheng */ 29665d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 29675d4f98a2SYan Zheng struct reloc_control *rc, 29685d4f98a2SYan Zheng struct backref_node *node, 29695d4f98a2SYan Zheng struct btrfs_key *key, 29705d4f98a2SYan Zheng struct btrfs_path *path) 29715d4f98a2SYan Zheng { 29725d4f98a2SYan Zheng struct btrfs_root *root; 29733fd0a558SYan, Zheng int ret = 0; 29745d4f98a2SYan Zheng 29753fd0a558SYan, Zheng if (!node) 29765d4f98a2SYan Zheng return 0; 29773fd0a558SYan, Zheng 29783fd0a558SYan, Zheng BUG_ON(node->processed); 2979147d256eSZhaolei root = select_one_root(node); 29803fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 29813fd0a558SYan, Zheng update_processed_blocks(rc, node); 29823fd0a558SYan, Zheng goto out; 29835d4f98a2SYan Zheng } 29845d4f98a2SYan Zheng 298527cdeb70SMiao Xie if (!root || test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 29863fd0a558SYan, Zheng ret = reserve_metadata_space(trans, rc, node); 29873fd0a558SYan, Zheng if (ret) 29885d4f98a2SYan Zheng goto out; 29895d4f98a2SYan Zheng } 29903fd0a558SYan, Zheng 29913fd0a558SYan, Zheng if (root) { 299227cdeb70SMiao Xie if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { 29933fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 29943fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 29953fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 29963fd0a558SYan, Zheng root = root->reloc_root; 29973fd0a558SYan, Zheng node->new_bytenr = root->node->start; 29983fd0a558SYan, Zheng node->root = root; 29993fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 30003fd0a558SYan, Zheng } else { 30015d4f98a2SYan Zheng path->lowest_level = node->level; 30025d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 3003b3b4aa74SDavid Sterba btrfs_release_path(path); 30043fd0a558SYan, Zheng if (ret > 0) 30055d4f98a2SYan Zheng ret = 0; 30063fd0a558SYan, Zheng } 30073fd0a558SYan, Zheng if (!ret) 30083fd0a558SYan, Zheng update_processed_blocks(rc, node); 30093fd0a558SYan, Zheng } else { 30103fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 30113fd0a558SYan, Zheng } 30125d4f98a2SYan Zheng out: 30130647bf56SWang Shilong if (ret || node->level == 0 || node->cowonly) 30143fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 30155d4f98a2SYan Zheng return ret; 30165d4f98a2SYan Zheng } 30175d4f98a2SYan Zheng 30185d4f98a2SYan Zheng /* 30195d4f98a2SYan Zheng * relocate a list of blocks 30205d4f98a2SYan Zheng */ 30215d4f98a2SYan Zheng static noinline_for_stack 30225d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 30235d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 30245d4f98a2SYan Zheng { 30252ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 30265d4f98a2SYan Zheng struct backref_node *node; 30275d4f98a2SYan Zheng struct btrfs_path *path; 30285d4f98a2SYan Zheng struct tree_block *block; 30295d4f98a2SYan Zheng struct rb_node *rb_node; 30305d4f98a2SYan Zheng int ret; 30315d4f98a2SYan Zheng int err = 0; 30325d4f98a2SYan Zheng 30335d4f98a2SYan Zheng path = btrfs_alloc_path(); 3034e1a12670SLiu Bo if (!path) { 3035e1a12670SLiu Bo err = -ENOMEM; 303634c2b290SDavid Sterba goto out_free_blocks; 3037e1a12670SLiu Bo } 30385d4f98a2SYan Zheng 30395d4f98a2SYan Zheng rb_node = rb_first(blocks); 30405d4f98a2SYan Zheng while (rb_node) { 30415d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 30425d4f98a2SYan Zheng if (!block->key_ready) 30432ff7e61eSJeff Mahoney readahead_tree_block(fs_info, block->bytenr); 30445d4f98a2SYan Zheng rb_node = rb_next(rb_node); 30455d4f98a2SYan Zheng } 30465d4f98a2SYan Zheng 30475d4f98a2SYan Zheng rb_node = rb_first(blocks); 30485d4f98a2SYan Zheng while (rb_node) { 30495d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 305034c2b290SDavid Sterba if (!block->key_ready) { 30512ff7e61eSJeff Mahoney err = get_tree_block_key(fs_info, block); 305234c2b290SDavid Sterba if (err) 305334c2b290SDavid Sterba goto out_free_path; 305434c2b290SDavid Sterba } 30555d4f98a2SYan Zheng rb_node = rb_next(rb_node); 30565d4f98a2SYan Zheng } 30575d4f98a2SYan Zheng 30585d4f98a2SYan Zheng rb_node = rb_first(blocks); 30595d4f98a2SYan Zheng while (rb_node) { 30605d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 30615d4f98a2SYan Zheng 30623fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 30635d4f98a2SYan Zheng block->level, block->bytenr); 30645d4f98a2SYan Zheng if (IS_ERR(node)) { 30655d4f98a2SYan Zheng err = PTR_ERR(node); 30665d4f98a2SYan Zheng goto out; 30675d4f98a2SYan Zheng } 30685d4f98a2SYan Zheng 30695d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 30705d4f98a2SYan Zheng path); 30715d4f98a2SYan Zheng if (ret < 0) { 30723fd0a558SYan, Zheng if (ret != -EAGAIN || rb_node == rb_first(blocks)) 30735d4f98a2SYan Zheng err = ret; 30745d4f98a2SYan Zheng goto out; 30755d4f98a2SYan Zheng } 30765d4f98a2SYan Zheng rb_node = rb_next(rb_node); 30775d4f98a2SYan Zheng } 30785d4f98a2SYan Zheng out: 30793fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 30805d4f98a2SYan Zheng 308134c2b290SDavid Sterba out_free_path: 30825d4f98a2SYan Zheng btrfs_free_path(path); 308334c2b290SDavid Sterba out_free_blocks: 3084e1a12670SLiu Bo free_block_list(blocks); 30855d4f98a2SYan Zheng return err; 30865d4f98a2SYan Zheng } 30875d4f98a2SYan Zheng 30885d4f98a2SYan Zheng static noinline_for_stack 3089efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 3090efa56464SYan, Zheng struct file_extent_cluster *cluster) 3091efa56464SYan, Zheng { 3092efa56464SYan, Zheng u64 alloc_hint = 0; 3093efa56464SYan, Zheng u64 start; 3094efa56464SYan, Zheng u64 end; 3095efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 3096efa56464SYan, Zheng u64 num_bytes; 3097efa56464SYan, Zheng int nr = 0; 3098efa56464SYan, Zheng int ret = 0; 3099dcb40c19SWang Xiaoguang u64 prealloc_start = cluster->start - offset; 3100dcb40c19SWang Xiaoguang u64 prealloc_end = cluster->end - offset; 310118513091SWang Xiaoguang u64 cur_offset; 3102364ecf36SQu Wenruo struct extent_changeset *data_reserved = NULL; 3103efa56464SYan, Zheng 3104efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 31055955102cSAl Viro inode_lock(inode); 3106efa56464SYan, Zheng 3107364ecf36SQu Wenruo ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start, 3108dcb40c19SWang Xiaoguang prealloc_end + 1 - prealloc_start); 3109efa56464SYan, Zheng if (ret) 3110efa56464SYan, Zheng goto out; 3111efa56464SYan, Zheng 311218513091SWang Xiaoguang cur_offset = prealloc_start; 3113efa56464SYan, Zheng while (nr < cluster->nr) { 3114efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 3115efa56464SYan, Zheng if (nr + 1 < cluster->nr) 3116efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 3117efa56464SYan, Zheng else 3118efa56464SYan, Zheng end = cluster->end - offset; 3119efa56464SYan, Zheng 3120d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 3121efa56464SYan, Zheng num_bytes = end + 1 - start; 312218513091SWang Xiaoguang if (cur_offset < start) 3123bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3124bc42bda2SQu Wenruo cur_offset, start - cur_offset); 3125efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 3126efa56464SYan, Zheng num_bytes, num_bytes, 3127efa56464SYan, Zheng end + 1, &alloc_hint); 312818513091SWang Xiaoguang cur_offset = end + 1; 3129d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 3130efa56464SYan, Zheng if (ret) 3131efa56464SYan, Zheng break; 3132efa56464SYan, Zheng nr++; 3133efa56464SYan, Zheng } 313418513091SWang Xiaoguang if (cur_offset < prealloc_end) 3135bc42bda2SQu Wenruo btrfs_free_reserved_data_space(inode, data_reserved, 3136bc42bda2SQu Wenruo cur_offset, prealloc_end + 1 - cur_offset); 3137efa56464SYan, Zheng out: 31385955102cSAl Viro inode_unlock(inode); 3139364ecf36SQu Wenruo extent_changeset_free(data_reserved); 3140efa56464SYan, Zheng return ret; 3141efa56464SYan, Zheng } 3142efa56464SYan, Zheng 3143efa56464SYan, Zheng static noinline_for_stack 31440257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 31450257bb82SYan, Zheng u64 block_start) 31465d4f98a2SYan Zheng { 31470b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 31485d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 31495d4f98a2SYan Zheng struct extent_map *em; 31500257bb82SYan, Zheng int ret = 0; 31515d4f98a2SYan Zheng 3152172ddd60SDavid Sterba em = alloc_extent_map(); 31530257bb82SYan, Zheng if (!em) 31540257bb82SYan, Zheng return -ENOMEM; 31550257bb82SYan, Zheng 31565d4f98a2SYan Zheng em->start = start; 31570257bb82SYan, Zheng em->len = end + 1 - start; 31580257bb82SYan, Zheng em->block_len = em->len; 31590257bb82SYan, Zheng em->block_start = block_start; 31600b246afaSJeff Mahoney em->bdev = fs_info->fs_devices->latest_bdev; 31615d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 31625d4f98a2SYan Zheng 3163d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 31645d4f98a2SYan Zheng while (1) { 3165890871beSChris Mason write_lock(&em_tree->lock); 316609a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 3167890871beSChris Mason write_unlock(&em_tree->lock); 31685d4f98a2SYan Zheng if (ret != -EEXIST) { 31695d4f98a2SYan Zheng free_extent_map(em); 31705d4f98a2SYan Zheng break; 31715d4f98a2SYan Zheng } 3172dcdbc059SNikolay Borisov btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0); 31735d4f98a2SYan Zheng } 3174d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 31750257bb82SYan, Zheng return ret; 31760257bb82SYan, Zheng } 31775d4f98a2SYan Zheng 31780257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 31790257bb82SYan, Zheng struct file_extent_cluster *cluster) 31800257bb82SYan, Zheng { 31812ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 31820257bb82SYan, Zheng u64 page_start; 31830257bb82SYan, Zheng u64 page_end; 31840257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 31850257bb82SYan, Zheng unsigned long index; 31860257bb82SYan, Zheng unsigned long last_index; 31870257bb82SYan, Zheng struct page *page; 31880257bb82SYan, Zheng struct file_ra_state *ra; 31893b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 31900257bb82SYan, Zheng int nr = 0; 31910257bb82SYan, Zheng int ret = 0; 31920257bb82SYan, Zheng 31930257bb82SYan, Zheng if (!cluster->nr) 31940257bb82SYan, Zheng return 0; 31950257bb82SYan, Zheng 31960257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 31970257bb82SYan, Zheng if (!ra) 31980257bb82SYan, Zheng return -ENOMEM; 31990257bb82SYan, Zheng 3200efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 32010257bb82SYan, Zheng if (ret) 3202efa56464SYan, Zheng goto out; 32030257bb82SYan, Zheng 32040257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 32050257bb82SYan, Zheng 3206efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3207efa56464SYan, Zheng cluster->end - offset, cluster->start); 3208efa56464SYan, Zheng if (ret) 3209efa56464SYan, Zheng goto out; 3210efa56464SYan, Zheng 321109cbfeafSKirill A. Shutemov index = (cluster->start - offset) >> PAGE_SHIFT; 321209cbfeafSKirill A. Shutemov last_index = (cluster->end - offset) >> PAGE_SHIFT; 32130257bb82SYan, Zheng while (index <= last_index) { 32149f3db423SNikolay Borisov ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), 32159f3db423SNikolay Borisov PAGE_SIZE); 3216efa56464SYan, Zheng if (ret) 3217efa56464SYan, Zheng goto out; 3218efa56464SYan, Zheng 32190257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 32200257bb82SYan, Zheng if (!page) { 32210257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 32220257bb82SYan, Zheng ra, NULL, index, 32230257bb82SYan, Zheng last_index + 1 - index); 3224a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 32253b16a4e3SJosef Bacik mask); 32260257bb82SYan, Zheng if (!page) { 3227691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 322809cbfeafSKirill A. Shutemov PAGE_SIZE); 32290257bb82SYan, Zheng ret = -ENOMEM; 3230efa56464SYan, Zheng goto out; 32310257bb82SYan, Zheng } 32320257bb82SYan, Zheng } 32330257bb82SYan, Zheng 32340257bb82SYan, Zheng if (PageReadahead(page)) { 32350257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 32360257bb82SYan, Zheng ra, NULL, page, index, 32370257bb82SYan, Zheng last_index + 1 - index); 32380257bb82SYan, Zheng } 32390257bb82SYan, Zheng 32400257bb82SYan, Zheng if (!PageUptodate(page)) { 32410257bb82SYan, Zheng btrfs_readpage(NULL, page); 32420257bb82SYan, Zheng lock_page(page); 32430257bb82SYan, Zheng if (!PageUptodate(page)) { 32440257bb82SYan, Zheng unlock_page(page); 324509cbfeafSKirill A. Shutemov put_page(page); 3246691fa059SNikolay Borisov btrfs_delalloc_release_metadata(BTRFS_I(inode), 324709cbfeafSKirill A. Shutemov PAGE_SIZE); 32480257bb82SYan, Zheng ret = -EIO; 3249efa56464SYan, Zheng goto out; 32500257bb82SYan, Zheng } 32510257bb82SYan, Zheng } 32520257bb82SYan, Zheng 32534eee4fa4SMiao Xie page_start = page_offset(page); 325409cbfeafSKirill A. Shutemov page_end = page_start + PAGE_SIZE - 1; 32550257bb82SYan, Zheng 3256d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 32570257bb82SYan, Zheng 32580257bb82SYan, Zheng set_page_extent_mapped(page); 32590257bb82SYan, Zheng 32600257bb82SYan, Zheng if (nr < cluster->nr && 32610257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 32620257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 32630257bb82SYan, Zheng page_start, page_end, 3264ceeb0ae7SDavid Sterba EXTENT_BOUNDARY); 32650257bb82SYan, Zheng nr++; 32660257bb82SYan, Zheng } 32670257bb82SYan, Zheng 3268ba8b04c1SQu Wenruo btrfs_set_extent_delalloc(inode, page_start, page_end, NULL, 0); 32690257bb82SYan, Zheng set_page_dirty(page); 32700257bb82SYan, Zheng 32710257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3272d0082371SJeff Mahoney page_start, page_end); 32730257bb82SYan, Zheng unlock_page(page); 327409cbfeafSKirill A. Shutemov put_page(page); 32750257bb82SYan, Zheng 32760257bb82SYan, Zheng index++; 3277efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 32782ff7e61eSJeff Mahoney btrfs_throttle(fs_info); 32790257bb82SYan, Zheng } 32800257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3281efa56464SYan, Zheng out: 32820257bb82SYan, Zheng kfree(ra); 32830257bb82SYan, Zheng return ret; 32840257bb82SYan, Zheng } 32850257bb82SYan, Zheng 32860257bb82SYan, Zheng static noinline_for_stack 32870257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 32880257bb82SYan, Zheng struct file_extent_cluster *cluster) 32890257bb82SYan, Zheng { 32900257bb82SYan, Zheng int ret; 32910257bb82SYan, Zheng 32920257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 32930257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 32940257bb82SYan, Zheng if (ret) 32950257bb82SYan, Zheng return ret; 32960257bb82SYan, Zheng cluster->nr = 0; 32970257bb82SYan, Zheng } 32980257bb82SYan, Zheng 32990257bb82SYan, Zheng if (!cluster->nr) 33000257bb82SYan, Zheng cluster->start = extent_key->objectid; 33010257bb82SYan, Zheng else 33020257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 33030257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 33040257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 33050257bb82SYan, Zheng cluster->nr++; 33060257bb82SYan, Zheng 33070257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 33080257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 33090257bb82SYan, Zheng if (ret) 33100257bb82SYan, Zheng return ret; 33110257bb82SYan, Zheng cluster->nr = 0; 33120257bb82SYan, Zheng } 33130257bb82SYan, Zheng return 0; 33145d4f98a2SYan Zheng } 33155d4f98a2SYan Zheng 33165d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 33175d4f98a2SYan Zheng static int get_ref_objectid_v0(struct reloc_control *rc, 33185d4f98a2SYan Zheng struct btrfs_path *path, 33195d4f98a2SYan Zheng struct btrfs_key *extent_key, 33205d4f98a2SYan Zheng u64 *ref_objectid, int *path_change) 33215d4f98a2SYan Zheng { 33225d4f98a2SYan Zheng struct btrfs_key key; 33235d4f98a2SYan Zheng struct extent_buffer *leaf; 33245d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 33255d4f98a2SYan Zheng int ret; 33265d4f98a2SYan Zheng int slot; 33275d4f98a2SYan Zheng 33285d4f98a2SYan Zheng leaf = path->nodes[0]; 33295d4f98a2SYan Zheng slot = path->slots[0]; 33305d4f98a2SYan Zheng while (1) { 33315d4f98a2SYan Zheng if (slot >= btrfs_header_nritems(leaf)) { 33325d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 33335d4f98a2SYan Zheng if (ret < 0) 33345d4f98a2SYan Zheng return ret; 33355d4f98a2SYan Zheng BUG_ON(ret > 0); 33365d4f98a2SYan Zheng leaf = path->nodes[0]; 33375d4f98a2SYan Zheng slot = path->slots[0]; 33385d4f98a2SYan Zheng if (path_change) 33395d4f98a2SYan Zheng *path_change = 1; 33405d4f98a2SYan Zheng } 33415d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, slot); 33425d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 33435d4f98a2SYan Zheng return -ENOENT; 33445d4f98a2SYan Zheng 33455d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_REF_V0_KEY) { 33465d4f98a2SYan Zheng slot++; 33475d4f98a2SYan Zheng continue; 33485d4f98a2SYan Zheng } 33495d4f98a2SYan Zheng ref0 = btrfs_item_ptr(leaf, slot, 33505d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 33515d4f98a2SYan Zheng *ref_objectid = btrfs_ref_objectid_v0(leaf, ref0); 33525d4f98a2SYan Zheng break; 33535d4f98a2SYan Zheng } 33545d4f98a2SYan Zheng return 0; 33555d4f98a2SYan Zheng } 33565d4f98a2SYan Zheng #endif 33575d4f98a2SYan Zheng 33585d4f98a2SYan Zheng /* 33595d4f98a2SYan Zheng * helper to add a tree block to the list. 33605d4f98a2SYan Zheng * the major work is getting the generation and level of the block 33615d4f98a2SYan Zheng */ 33625d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 33635d4f98a2SYan Zheng struct btrfs_key *extent_key, 33645d4f98a2SYan Zheng struct btrfs_path *path, 33655d4f98a2SYan Zheng struct rb_root *blocks) 33665d4f98a2SYan Zheng { 33675d4f98a2SYan Zheng struct extent_buffer *eb; 33685d4f98a2SYan Zheng struct btrfs_extent_item *ei; 33695d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 33705d4f98a2SYan Zheng struct tree_block *block; 33715d4f98a2SYan Zheng struct rb_node *rb_node; 33725d4f98a2SYan Zheng u32 item_size; 33735d4f98a2SYan Zheng int level = -1; 33747fdf4b60SWang Shilong u64 generation; 33755d4f98a2SYan Zheng 33765d4f98a2SYan Zheng eb = path->nodes[0]; 33775d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 33785d4f98a2SYan Zheng 33793173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 33803173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 33815d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 33825d4f98a2SYan Zheng struct btrfs_extent_item); 33833173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 33845d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 33855d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 33865d4f98a2SYan Zheng } else { 33873173a18fSJosef Bacik level = (int)extent_key->offset; 33883173a18fSJosef Bacik } 33893173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 33903173a18fSJosef Bacik } else { 33915d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 33925d4f98a2SYan Zheng u64 ref_owner; 33935d4f98a2SYan Zheng int ret; 33945d4f98a2SYan Zheng 33955d4f98a2SYan Zheng BUG_ON(item_size != sizeof(struct btrfs_extent_item_v0)); 33965d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, extent_key, 33975d4f98a2SYan Zheng &ref_owner, NULL); 3398411fc6bcSAndi Kleen if (ret < 0) 3399411fc6bcSAndi Kleen return ret; 34005d4f98a2SYan Zheng BUG_ON(ref_owner >= BTRFS_MAX_LEVEL); 34015d4f98a2SYan Zheng level = (int)ref_owner; 34025d4f98a2SYan Zheng /* FIXME: get real generation */ 34035d4f98a2SYan Zheng generation = 0; 34045d4f98a2SYan Zheng #else 34055d4f98a2SYan Zheng BUG(); 34065d4f98a2SYan Zheng #endif 34075d4f98a2SYan Zheng } 34085d4f98a2SYan Zheng 3409b3b4aa74SDavid Sterba btrfs_release_path(path); 34105d4f98a2SYan Zheng 34115d4f98a2SYan Zheng BUG_ON(level == -1); 34125d4f98a2SYan Zheng 34135d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 34145d4f98a2SYan Zheng if (!block) 34155d4f98a2SYan Zheng return -ENOMEM; 34165d4f98a2SYan Zheng 34175d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 3418da17066cSJeff Mahoney block->key.objectid = rc->extent_root->fs_info->nodesize; 34195d4f98a2SYan Zheng block->key.offset = generation; 34205d4f98a2SYan Zheng block->level = level; 34215d4f98a2SYan Zheng block->key_ready = 0; 34225d4f98a2SYan Zheng 34235d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 342443c04fb1SJeff Mahoney if (rb_node) 342543c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 34265d4f98a2SYan Zheng 34275d4f98a2SYan Zheng return 0; 34285d4f98a2SYan Zheng } 34295d4f98a2SYan Zheng 34305d4f98a2SYan Zheng /* 34315d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 34325d4f98a2SYan Zheng */ 34335d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 34345d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 34355d4f98a2SYan Zheng struct rb_root *blocks) 34365d4f98a2SYan Zheng { 34370b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 34385d4f98a2SYan Zheng struct btrfs_path *path; 34395d4f98a2SYan Zheng struct btrfs_key key; 34405d4f98a2SYan Zheng int ret; 34410b246afaSJeff Mahoney bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA); 34425d4f98a2SYan Zheng 34437476dfdaSDavid Sterba if (tree_block_processed(bytenr, rc)) 34445d4f98a2SYan Zheng return 0; 34455d4f98a2SYan Zheng 34465d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 34475d4f98a2SYan Zheng return 0; 34485d4f98a2SYan Zheng 34495d4f98a2SYan Zheng path = btrfs_alloc_path(); 34505d4f98a2SYan Zheng if (!path) 34515d4f98a2SYan Zheng return -ENOMEM; 3452aee68ee5SJosef Bacik again: 34535d4f98a2SYan Zheng key.objectid = bytenr; 3454aee68ee5SJosef Bacik if (skinny) { 3455aee68ee5SJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 3456aee68ee5SJosef Bacik key.offset = (u64)-1; 3457aee68ee5SJosef Bacik } else { 34585d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 34595d4f98a2SYan Zheng key.offset = blocksize; 3460aee68ee5SJosef Bacik } 34615d4f98a2SYan Zheng 34625d4f98a2SYan Zheng path->search_commit_root = 1; 34635d4f98a2SYan Zheng path->skip_locking = 1; 34645d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 34655d4f98a2SYan Zheng if (ret < 0) 34665d4f98a2SYan Zheng goto out; 34675d4f98a2SYan Zheng 3468aee68ee5SJosef Bacik if (ret > 0 && skinny) { 3469aee68ee5SJosef Bacik if (path->slots[0]) { 3470aee68ee5SJosef Bacik path->slots[0]--; 3471aee68ee5SJosef Bacik btrfs_item_key_to_cpu(path->nodes[0], &key, 3472aee68ee5SJosef Bacik path->slots[0]); 34733173a18fSJosef Bacik if (key.objectid == bytenr && 3474aee68ee5SJosef Bacik (key.type == BTRFS_METADATA_ITEM_KEY || 3475aee68ee5SJosef Bacik (key.type == BTRFS_EXTENT_ITEM_KEY && 3476aee68ee5SJosef Bacik key.offset == blocksize))) 34773173a18fSJosef Bacik ret = 0; 34783173a18fSJosef Bacik } 3479aee68ee5SJosef Bacik 3480aee68ee5SJosef Bacik if (ret) { 3481aee68ee5SJosef Bacik skinny = false; 3482aee68ee5SJosef Bacik btrfs_release_path(path); 3483aee68ee5SJosef Bacik goto again; 3484aee68ee5SJosef Bacik } 3485aee68ee5SJosef Bacik } 34863173a18fSJosef Bacik BUG_ON(ret); 34873173a18fSJosef Bacik 34885d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 34895d4f98a2SYan Zheng out: 34905d4f98a2SYan Zheng btrfs_free_path(path); 34915d4f98a2SYan Zheng return ret; 34925d4f98a2SYan Zheng } 34935d4f98a2SYan Zheng 34945d4f98a2SYan Zheng /* 34955d4f98a2SYan Zheng * helper to check if the block use full backrefs for pointers in it 34965d4f98a2SYan Zheng */ 34975d4f98a2SYan Zheng static int block_use_full_backref(struct reloc_control *rc, 34985d4f98a2SYan Zheng struct extent_buffer *eb) 34995d4f98a2SYan Zheng { 35005d4f98a2SYan Zheng u64 flags; 35015d4f98a2SYan Zheng int ret; 35025d4f98a2SYan Zheng 35035d4f98a2SYan Zheng if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) || 35045d4f98a2SYan Zheng btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV) 35055d4f98a2SYan Zheng return 1; 35065d4f98a2SYan Zheng 35072ff7e61eSJeff Mahoney ret = btrfs_lookup_extent_info(NULL, rc->extent_root->fs_info, 35083173a18fSJosef Bacik eb->start, btrfs_header_level(eb), 1, 35093173a18fSJosef Bacik NULL, &flags); 35105d4f98a2SYan Zheng BUG_ON(ret); 35115d4f98a2SYan Zheng 35125d4f98a2SYan Zheng if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) 35135d4f98a2SYan Zheng ret = 1; 35145d4f98a2SYan Zheng else 35155d4f98a2SYan Zheng ret = 0; 35165d4f98a2SYan Zheng return ret; 35175d4f98a2SYan Zheng } 35185d4f98a2SYan Zheng 35190af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 35201bbc621eSChris Mason struct btrfs_block_group_cache *block_group, 35211bbc621eSChris Mason struct inode *inode, 35221bbc621eSChris Mason u64 ino) 35230af3d00bSJosef Bacik { 35240af3d00bSJosef Bacik struct btrfs_key key; 35250af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 35260af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 35270af3d00bSJosef Bacik int ret = 0; 35280af3d00bSJosef Bacik 35290af3d00bSJosef Bacik if (inode) 35300af3d00bSJosef Bacik goto truncate; 35310af3d00bSJosef Bacik 35320af3d00bSJosef Bacik key.objectid = ino; 35330af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 35340af3d00bSJosef Bacik key.offset = 0; 35350af3d00bSJosef Bacik 35360af3d00bSJosef Bacik inode = btrfs_iget(fs_info->sb, &key, root, NULL); 3537f54fb859STsutomu Itoh if (IS_ERR(inode) || is_bad_inode(inode)) { 3538f54fb859STsutomu Itoh if (!IS_ERR(inode)) 35390af3d00bSJosef Bacik iput(inode); 35400af3d00bSJosef Bacik return -ENOENT; 35410af3d00bSJosef Bacik } 35420af3d00bSJosef Bacik 35430af3d00bSJosef Bacik truncate: 35442ff7e61eSJeff Mahoney ret = btrfs_check_trunc_cache_free_space(fs_info, 35457b61cd92SMiao Xie &fs_info->global_block_rsv); 35467b61cd92SMiao Xie if (ret) 35477b61cd92SMiao Xie goto out; 35487b61cd92SMiao Xie 35497a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 35500af3d00bSJosef Bacik if (IS_ERR(trans)) { 35513612b495STsutomu Itoh ret = PTR_ERR(trans); 35520af3d00bSJosef Bacik goto out; 35530af3d00bSJosef Bacik } 35540af3d00bSJosef Bacik 355577ab86bfSJeff Mahoney ret = btrfs_truncate_free_space_cache(trans, block_group, inode); 35560af3d00bSJosef Bacik 35573a45bb20SJeff Mahoney btrfs_end_transaction(trans); 35582ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 35590af3d00bSJosef Bacik out: 35600af3d00bSJosef Bacik iput(inode); 35610af3d00bSJosef Bacik return ret; 35620af3d00bSJosef Bacik } 35630af3d00bSJosef Bacik 35645d4f98a2SYan Zheng /* 35655d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY 35665d4f98a2SYan Zheng * this function scans fs tree to find blocks reference the data extent 35675d4f98a2SYan Zheng */ 35685d4f98a2SYan Zheng static int find_data_references(struct reloc_control *rc, 35695d4f98a2SYan Zheng struct btrfs_key *extent_key, 35705d4f98a2SYan Zheng struct extent_buffer *leaf, 35715d4f98a2SYan Zheng struct btrfs_extent_data_ref *ref, 35725d4f98a2SYan Zheng struct rb_root *blocks) 35735d4f98a2SYan Zheng { 35740b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 35755d4f98a2SYan Zheng struct btrfs_path *path; 35765d4f98a2SYan Zheng struct tree_block *block; 35775d4f98a2SYan Zheng struct btrfs_root *root; 35785d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 35795d4f98a2SYan Zheng struct rb_node *rb_node; 35805d4f98a2SYan Zheng struct btrfs_key key; 35815d4f98a2SYan Zheng u64 ref_root; 35825d4f98a2SYan Zheng u64 ref_objectid; 35835d4f98a2SYan Zheng u64 ref_offset; 35845d4f98a2SYan Zheng u32 ref_count; 35855d4f98a2SYan Zheng u32 nritems; 35865d4f98a2SYan Zheng int err = 0; 35875d4f98a2SYan Zheng int added = 0; 35885d4f98a2SYan Zheng int counted; 35895d4f98a2SYan Zheng int ret; 35905d4f98a2SYan Zheng 35915d4f98a2SYan Zheng ref_root = btrfs_extent_data_ref_root(leaf, ref); 35925d4f98a2SYan Zheng ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref); 35935d4f98a2SYan Zheng ref_offset = btrfs_extent_data_ref_offset(leaf, ref); 35945d4f98a2SYan Zheng ref_count = btrfs_extent_data_ref_count(leaf, ref); 35955d4f98a2SYan Zheng 35960af3d00bSJosef Bacik /* 35970af3d00bSJosef Bacik * This is an extent belonging to the free space cache, lets just delete 35980af3d00bSJosef Bacik * it and redo the search. 35990af3d00bSJosef Bacik */ 36000af3d00bSJosef Bacik if (ref_root == BTRFS_ROOT_TREE_OBJECTID) { 36010b246afaSJeff Mahoney ret = delete_block_group_cache(fs_info, rc->block_group, 36020af3d00bSJosef Bacik NULL, ref_objectid); 36030af3d00bSJosef Bacik if (ret != -ENOENT) 36040af3d00bSJosef Bacik return ret; 36050af3d00bSJosef Bacik ret = 0; 36060af3d00bSJosef Bacik } 36070af3d00bSJosef Bacik 36080af3d00bSJosef Bacik path = btrfs_alloc_path(); 36090af3d00bSJosef Bacik if (!path) 36100af3d00bSJosef Bacik return -ENOMEM; 3611e4058b54SDavid Sterba path->reada = READA_FORWARD; 36120af3d00bSJosef Bacik 36130b246afaSJeff Mahoney root = read_fs_root(fs_info, ref_root); 36145d4f98a2SYan Zheng if (IS_ERR(root)) { 36155d4f98a2SYan Zheng err = PTR_ERR(root); 36165d4f98a2SYan Zheng goto out; 36175d4f98a2SYan Zheng } 36185d4f98a2SYan Zheng 36195d4f98a2SYan Zheng key.objectid = ref_objectid; 36205d4f98a2SYan Zheng key.type = BTRFS_EXTENT_DATA_KEY; 362184850e8dSYan, Zheng if (ref_offset > ((u64)-1 << 32)) 362284850e8dSYan, Zheng key.offset = 0; 362384850e8dSYan, Zheng else 362484850e8dSYan, Zheng key.offset = ref_offset; 36255d4f98a2SYan Zheng 36265d4f98a2SYan Zheng path->search_commit_root = 1; 36275d4f98a2SYan Zheng path->skip_locking = 1; 36285d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 36295d4f98a2SYan Zheng if (ret < 0) { 36305d4f98a2SYan Zheng err = ret; 36315d4f98a2SYan Zheng goto out; 36325d4f98a2SYan Zheng } 36335d4f98a2SYan Zheng 36345d4f98a2SYan Zheng leaf = path->nodes[0]; 36355d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 36365d4f98a2SYan Zheng /* 36375d4f98a2SYan Zheng * the references in tree blocks that use full backrefs 36385d4f98a2SYan Zheng * are not counted in 36395d4f98a2SYan Zheng */ 36405d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 36415d4f98a2SYan Zheng counted = 0; 36425d4f98a2SYan Zheng else 36435d4f98a2SYan Zheng counted = 1; 36445d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 36455d4f98a2SYan Zheng if (rb_node) { 36465d4f98a2SYan Zheng if (counted) 36475d4f98a2SYan Zheng added = 1; 36485d4f98a2SYan Zheng else 36495d4f98a2SYan Zheng path->slots[0] = nritems; 36505d4f98a2SYan Zheng } 36515d4f98a2SYan Zheng 36525d4f98a2SYan Zheng while (ref_count > 0) { 36535d4f98a2SYan Zheng while (path->slots[0] >= nritems) { 36545d4f98a2SYan Zheng ret = btrfs_next_leaf(root, path); 36555d4f98a2SYan Zheng if (ret < 0) { 36565d4f98a2SYan Zheng err = ret; 36575d4f98a2SYan Zheng goto out; 36585d4f98a2SYan Zheng } 3659fae7f21cSDulshani Gunawardhana if (WARN_ON(ret > 0)) 36605d4f98a2SYan Zheng goto out; 36615d4f98a2SYan Zheng 36625d4f98a2SYan Zheng leaf = path->nodes[0]; 36635d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 36645d4f98a2SYan Zheng added = 0; 36655d4f98a2SYan Zheng 36665d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 36675d4f98a2SYan Zheng counted = 0; 36685d4f98a2SYan Zheng else 36695d4f98a2SYan Zheng counted = 1; 36705d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 36715d4f98a2SYan Zheng if (rb_node) { 36725d4f98a2SYan Zheng if (counted) 36735d4f98a2SYan Zheng added = 1; 36745d4f98a2SYan Zheng else 36755d4f98a2SYan Zheng path->slots[0] = nritems; 36765d4f98a2SYan Zheng } 36775d4f98a2SYan Zheng } 36785d4f98a2SYan Zheng 36795d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 3680fae7f21cSDulshani Gunawardhana if (WARN_ON(key.objectid != ref_objectid || 3681fae7f21cSDulshani Gunawardhana key.type != BTRFS_EXTENT_DATA_KEY)) 36825d4f98a2SYan Zheng break; 36835d4f98a2SYan Zheng 36845d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 36855d4f98a2SYan Zheng struct btrfs_file_extent_item); 36865d4f98a2SYan Zheng 36875d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 36885d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 36895d4f98a2SYan Zheng goto next; 36905d4f98a2SYan Zheng 36915d4f98a2SYan Zheng if (btrfs_file_extent_disk_bytenr(leaf, fi) != 36925d4f98a2SYan Zheng extent_key->objectid) 36935d4f98a2SYan Zheng goto next; 36945d4f98a2SYan Zheng 36955d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 36965d4f98a2SYan Zheng if (key.offset != ref_offset) 36975d4f98a2SYan Zheng goto next; 36985d4f98a2SYan Zheng 36995d4f98a2SYan Zheng if (counted) 37005d4f98a2SYan Zheng ref_count--; 37015d4f98a2SYan Zheng if (added) 37025d4f98a2SYan Zheng goto next; 37035d4f98a2SYan Zheng 37047476dfdaSDavid Sterba if (!tree_block_processed(leaf->start, rc)) { 37055d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 37065d4f98a2SYan Zheng if (!block) { 37075d4f98a2SYan Zheng err = -ENOMEM; 37085d4f98a2SYan Zheng break; 37095d4f98a2SYan Zheng } 37105d4f98a2SYan Zheng block->bytenr = leaf->start; 37115d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &block->key, 0); 37125d4f98a2SYan Zheng block->level = 0; 37135d4f98a2SYan Zheng block->key_ready = 1; 37145d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, 37155d4f98a2SYan Zheng &block->rb_node); 371643c04fb1SJeff Mahoney if (rb_node) 371743c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 371843c04fb1SJeff Mahoney block->bytenr); 37195d4f98a2SYan Zheng } 37205d4f98a2SYan Zheng if (counted) 37215d4f98a2SYan Zheng added = 1; 37225d4f98a2SYan Zheng else 37235d4f98a2SYan Zheng path->slots[0] = nritems; 37245d4f98a2SYan Zheng next: 37255d4f98a2SYan Zheng path->slots[0]++; 37265d4f98a2SYan Zheng 37275d4f98a2SYan Zheng } 37285d4f98a2SYan Zheng out: 37295d4f98a2SYan Zheng btrfs_free_path(path); 37305d4f98a2SYan Zheng return err; 37315d4f98a2SYan Zheng } 37325d4f98a2SYan Zheng 37335d4f98a2SYan Zheng /* 37342c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 37355d4f98a2SYan Zheng */ 37365d4f98a2SYan Zheng static noinline_for_stack 37375d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 37385d4f98a2SYan Zheng struct btrfs_key *extent_key, 37395d4f98a2SYan Zheng struct btrfs_path *path, 37405d4f98a2SYan Zheng struct rb_root *blocks) 37415d4f98a2SYan Zheng { 37425d4f98a2SYan Zheng struct btrfs_key key; 37435d4f98a2SYan Zheng struct extent_buffer *eb; 37445d4f98a2SYan Zheng struct btrfs_extent_data_ref *dref; 37455d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 37465d4f98a2SYan Zheng unsigned long ptr; 37475d4f98a2SYan Zheng unsigned long end; 3748da17066cSJeff Mahoney u32 blocksize = rc->extent_root->fs_info->nodesize; 3749647f63bdSFilipe David Borba Manana int ret = 0; 37505d4f98a2SYan Zheng int err = 0; 37515d4f98a2SYan Zheng 37525d4f98a2SYan Zheng eb = path->nodes[0]; 37535d4f98a2SYan Zheng ptr = btrfs_item_ptr_offset(eb, path->slots[0]); 37545d4f98a2SYan Zheng end = ptr + btrfs_item_size_nr(eb, path->slots[0]); 37555d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 37565d4f98a2SYan Zheng if (ptr + sizeof(struct btrfs_extent_item_v0) == end) 37575d4f98a2SYan Zheng ptr = end; 37585d4f98a2SYan Zheng else 37595d4f98a2SYan Zheng #endif 37605d4f98a2SYan Zheng ptr += sizeof(struct btrfs_extent_item); 37615d4f98a2SYan Zheng 37625d4f98a2SYan Zheng while (ptr < end) { 37635d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 37643de28d57SLiu Bo key.type = btrfs_get_extent_inline_ref_type(eb, iref, 37653de28d57SLiu Bo BTRFS_REF_TYPE_DATA); 37665d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 37675d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 37685d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 37695d4f98a2SYan Zheng blocks); 37705d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 37715d4f98a2SYan Zheng dref = (struct btrfs_extent_data_ref *)(&iref->offset); 37725d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 37735d4f98a2SYan Zheng eb, dref, blocks); 37745d4f98a2SYan Zheng } else { 37755d4f98a2SYan Zheng BUG(); 37765d4f98a2SYan Zheng } 3777647f63bdSFilipe David Borba Manana if (ret) { 3778647f63bdSFilipe David Borba Manana err = ret; 3779647f63bdSFilipe David Borba Manana goto out; 3780647f63bdSFilipe David Borba Manana } 37815d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 37825d4f98a2SYan Zheng } 37835d4f98a2SYan Zheng WARN_ON(ptr > end); 37845d4f98a2SYan Zheng 37855d4f98a2SYan Zheng while (1) { 37865d4f98a2SYan Zheng cond_resched(); 37875d4f98a2SYan Zheng eb = path->nodes[0]; 37885d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(eb)) { 37895d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 37905d4f98a2SYan Zheng if (ret < 0) { 37915d4f98a2SYan Zheng err = ret; 37925d4f98a2SYan Zheng break; 37935d4f98a2SYan Zheng } 37945d4f98a2SYan Zheng if (ret > 0) 37955d4f98a2SYan Zheng break; 37965d4f98a2SYan Zheng eb = path->nodes[0]; 37975d4f98a2SYan Zheng } 37985d4f98a2SYan Zheng 37995d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path->slots[0]); 38005d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 38015d4f98a2SYan Zheng break; 38025d4f98a2SYan Zheng 38035d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 38045d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY || 38055d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 38065d4f98a2SYan Zheng #else 38075d4f98a2SYan Zheng BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY); 38085d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 38095d4f98a2SYan Zheng #endif 38105d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 38115d4f98a2SYan Zheng blocks); 38125d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 38135d4f98a2SYan Zheng dref = btrfs_item_ptr(eb, path->slots[0], 38145d4f98a2SYan Zheng struct btrfs_extent_data_ref); 38155d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 38165d4f98a2SYan Zheng eb, dref, blocks); 38175d4f98a2SYan Zheng } else { 38185d4f98a2SYan Zheng ret = 0; 38195d4f98a2SYan Zheng } 38205d4f98a2SYan Zheng if (ret) { 38215d4f98a2SYan Zheng err = ret; 38225d4f98a2SYan Zheng break; 38235d4f98a2SYan Zheng } 38245d4f98a2SYan Zheng path->slots[0]++; 38255d4f98a2SYan Zheng } 3826647f63bdSFilipe David Borba Manana out: 3827b3b4aa74SDavid Sterba btrfs_release_path(path); 38285d4f98a2SYan Zheng if (err) 38295d4f98a2SYan Zheng free_block_list(blocks); 38305d4f98a2SYan Zheng return err; 38315d4f98a2SYan Zheng } 38325d4f98a2SYan Zheng 38335d4f98a2SYan Zheng /* 38342c016dc2SLiu Bo * helper to find next unprocessed extent 38355d4f98a2SYan Zheng */ 38365d4f98a2SYan Zheng static noinline_for_stack 3837147d256eSZhaolei int find_next_extent(struct reloc_control *rc, struct btrfs_path *path, 38383fd0a558SYan, Zheng struct btrfs_key *extent_key) 38395d4f98a2SYan Zheng { 38400b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 38415d4f98a2SYan Zheng struct btrfs_key key; 38425d4f98a2SYan Zheng struct extent_buffer *leaf; 38435d4f98a2SYan Zheng u64 start, end, last; 38445d4f98a2SYan Zheng int ret; 38455d4f98a2SYan Zheng 38465d4f98a2SYan Zheng last = rc->block_group->key.objectid + rc->block_group->key.offset; 38475d4f98a2SYan Zheng while (1) { 38485d4f98a2SYan Zheng cond_resched(); 38495d4f98a2SYan Zheng if (rc->search_start >= last) { 38505d4f98a2SYan Zheng ret = 1; 38515d4f98a2SYan Zheng break; 38525d4f98a2SYan Zheng } 38535d4f98a2SYan Zheng 38545d4f98a2SYan Zheng key.objectid = rc->search_start; 38555d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 38565d4f98a2SYan Zheng key.offset = 0; 38575d4f98a2SYan Zheng 38585d4f98a2SYan Zheng path->search_commit_root = 1; 38595d4f98a2SYan Zheng path->skip_locking = 1; 38605d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 38615d4f98a2SYan Zheng 0, 0); 38625d4f98a2SYan Zheng if (ret < 0) 38635d4f98a2SYan Zheng break; 38645d4f98a2SYan Zheng next: 38655d4f98a2SYan Zheng leaf = path->nodes[0]; 38665d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 38675d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 38685d4f98a2SYan Zheng if (ret != 0) 38695d4f98a2SYan Zheng break; 38705d4f98a2SYan Zheng leaf = path->nodes[0]; 38715d4f98a2SYan Zheng } 38725d4f98a2SYan Zheng 38735d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 38745d4f98a2SYan Zheng if (key.objectid >= last) { 38755d4f98a2SYan Zheng ret = 1; 38765d4f98a2SYan Zheng break; 38775d4f98a2SYan Zheng } 38785d4f98a2SYan Zheng 38793173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 38803173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 38813173a18fSJosef Bacik path->slots[0]++; 38823173a18fSJosef Bacik goto next; 38833173a18fSJosef Bacik } 38843173a18fSJosef Bacik 38853173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 38865d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 38875d4f98a2SYan Zheng path->slots[0]++; 38885d4f98a2SYan Zheng goto next; 38895d4f98a2SYan Zheng } 38905d4f98a2SYan Zheng 38913173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 38920b246afaSJeff Mahoney key.objectid + fs_info->nodesize <= 38933173a18fSJosef Bacik rc->search_start) { 38943173a18fSJosef Bacik path->slots[0]++; 38953173a18fSJosef Bacik goto next; 38963173a18fSJosef Bacik } 38973173a18fSJosef Bacik 38985d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 38995d4f98a2SYan Zheng key.objectid, &start, &end, 3900e6138876SJosef Bacik EXTENT_DIRTY, NULL); 39015d4f98a2SYan Zheng 39025d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3903b3b4aa74SDavid Sterba btrfs_release_path(path); 39045d4f98a2SYan Zheng rc->search_start = end + 1; 39055d4f98a2SYan Zheng } else { 39063173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 39075d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 39083173a18fSJosef Bacik else 39093173a18fSJosef Bacik rc->search_start = key.objectid + 39100b246afaSJeff Mahoney fs_info->nodesize; 39113fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 39125d4f98a2SYan Zheng return 0; 39135d4f98a2SYan Zheng } 39145d4f98a2SYan Zheng } 3915b3b4aa74SDavid Sterba btrfs_release_path(path); 39165d4f98a2SYan Zheng return ret; 39175d4f98a2SYan Zheng } 39185d4f98a2SYan Zheng 39195d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 39205d4f98a2SYan Zheng { 39215d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39227585717fSChris Mason 39237585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39245d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 39257585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39265d4f98a2SYan Zheng } 39275d4f98a2SYan Zheng 39285d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 39295d4f98a2SYan Zheng { 39305d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39317585717fSChris Mason 39327585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 39335d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 39347585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 39355d4f98a2SYan Zheng } 39365d4f98a2SYan Zheng 39375d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 39385d4f98a2SYan Zheng { 39395d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39405d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39415d4f98a2SYan Zheng return 1; 39425d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 39435d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 39445d4f98a2SYan Zheng return 1; 39455d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 39465d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 39475d4f98a2SYan Zheng return 1; 39485d4f98a2SYan Zheng return 0; 39495d4f98a2SYan Zheng } 39505d4f98a2SYan Zheng 39513fd0a558SYan, Zheng static noinline_for_stack 39523fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 39533fd0a558SYan, Zheng { 39543fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 3955ac2fabacSJosef Bacik int ret; 39563fd0a558SYan, Zheng 39572ff7e61eSJeff Mahoney rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info, 395866d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 39593fd0a558SYan, Zheng if (!rc->block_rsv) 39603fd0a558SYan, Zheng return -ENOMEM; 39613fd0a558SYan, Zheng 39623fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 39633fd0a558SYan, Zheng rc->search_start = rc->block_group->key.objectid; 39643fd0a558SYan, Zheng rc->extents_found = 0; 39653fd0a558SYan, Zheng rc->nodes_relocated = 0; 39663fd0a558SYan, Zheng rc->merging_rsv_size = 0; 39670647bf56SWang Shilong rc->reserved_bytes = 0; 3968da17066cSJeff Mahoney rc->block_rsv->size = rc->extent_root->fs_info->nodesize * 39690647bf56SWang Shilong RELOCATION_RESERVED_NODES; 3970ac2fabacSJosef Bacik ret = btrfs_block_rsv_refill(rc->extent_root, 3971ac2fabacSJosef Bacik rc->block_rsv, rc->block_rsv->size, 3972ac2fabacSJosef Bacik BTRFS_RESERVE_FLUSH_ALL); 3973ac2fabacSJosef Bacik if (ret) 3974ac2fabacSJosef Bacik return ret; 39753fd0a558SYan, Zheng 39763fd0a558SYan, Zheng rc->create_reloc_tree = 1; 39773fd0a558SYan, Zheng set_reloc_control(rc); 39783fd0a558SYan, Zheng 39797a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 398028818947SLiu Bo if (IS_ERR(trans)) { 398128818947SLiu Bo unset_reloc_control(rc); 398228818947SLiu Bo /* 398328818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 398428818947SLiu Bo * cleanup. And callers are responsible to free the above 398528818947SLiu Bo * block rsv. 398628818947SLiu Bo */ 398728818947SLiu Bo return PTR_ERR(trans); 398828818947SLiu Bo } 39893a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 39903fd0a558SYan, Zheng return 0; 39913fd0a558SYan, Zheng } 399276dda93cSYan, Zheng 39935d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 39945d4f98a2SYan Zheng { 39952ff7e61eSJeff Mahoney struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 39965d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 39975d4f98a2SYan Zheng struct btrfs_key key; 39985d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 39995d4f98a2SYan Zheng struct btrfs_path *path; 40005d4f98a2SYan Zheng struct btrfs_extent_item *ei; 40015d4f98a2SYan Zheng u64 flags; 40025d4f98a2SYan Zheng u32 item_size; 40035d4f98a2SYan Zheng int ret; 40045d4f98a2SYan Zheng int err = 0; 4005c87f08caSChris Mason int progress = 0; 40065d4f98a2SYan Zheng 40075d4f98a2SYan Zheng path = btrfs_alloc_path(); 40083fd0a558SYan, Zheng if (!path) 40095d4f98a2SYan Zheng return -ENOMEM; 4010e4058b54SDavid Sterba path->reada = READA_FORWARD; 40113fd0a558SYan, Zheng 40123fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 40133fd0a558SYan, Zheng if (ret) { 40143fd0a558SYan, Zheng err = ret; 40153fd0a558SYan, Zheng goto out_free; 40162423fdfbSJiri Slaby } 40175d4f98a2SYan Zheng 40185d4f98a2SYan Zheng while (1) { 40190647bf56SWang Shilong rc->reserved_bytes = 0; 40200647bf56SWang Shilong ret = btrfs_block_rsv_refill(rc->extent_root, 40210647bf56SWang Shilong rc->block_rsv, rc->block_rsv->size, 40220647bf56SWang Shilong BTRFS_RESERVE_FLUSH_ALL); 40230647bf56SWang Shilong if (ret) { 40240647bf56SWang Shilong err = ret; 40250647bf56SWang Shilong break; 40260647bf56SWang Shilong } 4027c87f08caSChris Mason progress++; 4028a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 40290f788c58SLiu Bo if (IS_ERR(trans)) { 40300f788c58SLiu Bo err = PTR_ERR(trans); 40310f788c58SLiu Bo trans = NULL; 40320f788c58SLiu Bo break; 40330f788c58SLiu Bo } 4034c87f08caSChris Mason restart: 40353fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 40363a45bb20SJeff Mahoney btrfs_end_transaction(trans); 40373fd0a558SYan, Zheng continue; 40383fd0a558SYan, Zheng } 40393fd0a558SYan, Zheng 4040147d256eSZhaolei ret = find_next_extent(rc, path, &key); 40415d4f98a2SYan Zheng if (ret < 0) 40425d4f98a2SYan Zheng err = ret; 40435d4f98a2SYan Zheng if (ret != 0) 40445d4f98a2SYan Zheng break; 40455d4f98a2SYan Zheng 40465d4f98a2SYan Zheng rc->extents_found++; 40475d4f98a2SYan Zheng 40485d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 40495d4f98a2SYan Zheng struct btrfs_extent_item); 40503fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 40515d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 40525d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 40535d4f98a2SYan Zheng ret = check_extent_flags(flags); 40545d4f98a2SYan Zheng BUG_ON(ret); 40555d4f98a2SYan Zheng 40565d4f98a2SYan Zheng } else { 40575d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 40585d4f98a2SYan Zheng u64 ref_owner; 40595d4f98a2SYan Zheng int path_change = 0; 40605d4f98a2SYan Zheng 40615d4f98a2SYan Zheng BUG_ON(item_size != 40625d4f98a2SYan Zheng sizeof(struct btrfs_extent_item_v0)); 40635d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, &key, &ref_owner, 40645d4f98a2SYan Zheng &path_change); 40654b3576e4SZhaolei if (ret < 0) { 40664b3576e4SZhaolei err = ret; 40674b3576e4SZhaolei break; 40684b3576e4SZhaolei } 40695d4f98a2SYan Zheng if (ref_owner < BTRFS_FIRST_FREE_OBJECTID) 40705d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_TREE_BLOCK; 40715d4f98a2SYan Zheng else 40725d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_DATA; 40735d4f98a2SYan Zheng 40745d4f98a2SYan Zheng if (path_change) { 4075b3b4aa74SDavid Sterba btrfs_release_path(path); 40765d4f98a2SYan Zheng 40775d4f98a2SYan Zheng path->search_commit_root = 1; 40785d4f98a2SYan Zheng path->skip_locking = 1; 40795d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, 40805d4f98a2SYan Zheng &key, path, 0, 0); 40815d4f98a2SYan Zheng if (ret < 0) { 40825d4f98a2SYan Zheng err = ret; 40835d4f98a2SYan Zheng break; 40845d4f98a2SYan Zheng } 40855d4f98a2SYan Zheng BUG_ON(ret > 0); 40865d4f98a2SYan Zheng } 40875d4f98a2SYan Zheng #else 40885d4f98a2SYan Zheng BUG(); 40895d4f98a2SYan Zheng #endif 40905d4f98a2SYan Zheng } 40915d4f98a2SYan Zheng 40925d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 40935d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 40945d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 40955d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 40965d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 40975d4f98a2SYan Zheng } else { 4098b3b4aa74SDavid Sterba btrfs_release_path(path); 40995d4f98a2SYan Zheng ret = 0; 41005d4f98a2SYan Zheng } 41015d4f98a2SYan Zheng if (ret < 0) { 41023fd0a558SYan, Zheng err = ret; 41035d4f98a2SYan Zheng break; 41045d4f98a2SYan Zheng } 41055d4f98a2SYan Zheng 41065d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 41075d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 41085d4f98a2SYan Zheng if (ret < 0) { 41091708cc57SWang Shilong /* 41101708cc57SWang Shilong * if we fail to relocate tree blocks, force to update 41111708cc57SWang Shilong * backref cache when committing transaction. 41121708cc57SWang Shilong */ 41131708cc57SWang Shilong rc->backref_cache.last_trans = trans->transid - 1; 41141708cc57SWang Shilong 41153fd0a558SYan, Zheng if (ret != -EAGAIN) { 41165d4f98a2SYan Zheng err = ret; 41175d4f98a2SYan Zheng break; 41185d4f98a2SYan Zheng } 41193fd0a558SYan, Zheng rc->extents_found--; 41203fd0a558SYan, Zheng rc->search_start = key.objectid; 41213fd0a558SYan, Zheng } 41225d4f98a2SYan Zheng } 41235d4f98a2SYan Zheng 41243a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 41252ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 41263fd0a558SYan, Zheng trans = NULL; 41275d4f98a2SYan Zheng 41285d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 41295d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 41305d4f98a2SYan Zheng rc->found_file_extent = 1; 41310257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 41323fd0a558SYan, Zheng &key, &rc->cluster); 41335d4f98a2SYan Zheng if (ret < 0) { 41345d4f98a2SYan Zheng err = ret; 41355d4f98a2SYan Zheng break; 41365d4f98a2SYan Zheng } 41375d4f98a2SYan Zheng } 41385d4f98a2SYan Zheng } 4139c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 41402ff7e61eSJeff Mahoney ret = btrfs_force_chunk_alloc(trans, fs_info, 4141c87f08caSChris Mason rc->block_group->flags); 41429689457bSShilong Wang if (ret == 1) { 4143c87f08caSChris Mason err = 0; 4144c87f08caSChris Mason progress = 0; 4145c87f08caSChris Mason goto restart; 4146c87f08caSChris Mason } 4147c87f08caSChris Mason } 41483fd0a558SYan, Zheng 4149b3b4aa74SDavid Sterba btrfs_release_path(path); 415091166212SDavid Sterba clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY); 41515d4f98a2SYan Zheng 41525d4f98a2SYan Zheng if (trans) { 41533a45bb20SJeff Mahoney btrfs_end_transaction_throttle(trans); 41542ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 41555d4f98a2SYan Zheng } 41565d4f98a2SYan Zheng 41570257bb82SYan, Zheng if (!err) { 41583fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 41593fd0a558SYan, Zheng &rc->cluster); 41600257bb82SYan, Zheng if (ret < 0) 41610257bb82SYan, Zheng err = ret; 41620257bb82SYan, Zheng } 41630257bb82SYan, Zheng 41643fd0a558SYan, Zheng rc->create_reloc_tree = 0; 41653fd0a558SYan, Zheng set_reloc_control(rc); 41660257bb82SYan, Zheng 41673fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 41682ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1); 41695d4f98a2SYan Zheng 41703fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 41715d4f98a2SYan Zheng 41725d4f98a2SYan Zheng merge_reloc_roots(rc); 41735d4f98a2SYan Zheng 41743fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 41755d4f98a2SYan Zheng unset_reloc_control(rc); 41762ff7e61eSJeff Mahoney btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1); 41775d4f98a2SYan Zheng 41785d4f98a2SYan Zheng /* get rid of pinned extents */ 41797a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 418062b99540SQu Wenruo if (IS_ERR(trans)) { 41813612b495STsutomu Itoh err = PTR_ERR(trans); 418262b99540SQu Wenruo goto out_free; 418362b99540SQu Wenruo } 41843a45bb20SJeff Mahoney btrfs_commit_transaction(trans); 41853fd0a558SYan, Zheng out_free: 41862ff7e61eSJeff Mahoney btrfs_free_block_rsv(fs_info, rc->block_rsv); 41873fd0a558SYan, Zheng btrfs_free_path(path); 41885d4f98a2SYan Zheng return err; 41895d4f98a2SYan Zheng } 41905d4f98a2SYan Zheng 41915d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 41920257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 41935d4f98a2SYan Zheng { 41945d4f98a2SYan Zheng struct btrfs_path *path; 41955d4f98a2SYan Zheng struct btrfs_inode_item *item; 41965d4f98a2SYan Zheng struct extent_buffer *leaf; 41975d4f98a2SYan Zheng int ret; 41985d4f98a2SYan Zheng 41995d4f98a2SYan Zheng path = btrfs_alloc_path(); 42005d4f98a2SYan Zheng if (!path) 42015d4f98a2SYan Zheng return -ENOMEM; 42025d4f98a2SYan Zheng 42035d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 42045d4f98a2SYan Zheng if (ret) 42055d4f98a2SYan Zheng goto out; 42065d4f98a2SYan Zheng 42075d4f98a2SYan Zheng leaf = path->nodes[0]; 42085d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 4209b159fa28SDavid Sterba memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); 42105d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 42110257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 42125d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 42133fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 42143fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 42155d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 42165d4f98a2SYan Zheng out: 42175d4f98a2SYan Zheng btrfs_free_path(path); 42185d4f98a2SYan Zheng return ret; 42195d4f98a2SYan Zheng } 42205d4f98a2SYan Zheng 42215d4f98a2SYan Zheng /* 42225d4f98a2SYan Zheng * helper to create inode for data relocation. 42235d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 42245d4f98a2SYan Zheng */ 42253fd0a558SYan, Zheng static noinline_for_stack 42263fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 42275d4f98a2SYan Zheng struct btrfs_block_group_cache *group) 42285d4f98a2SYan Zheng { 42295d4f98a2SYan Zheng struct inode *inode = NULL; 42305d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 42315d4f98a2SYan Zheng struct btrfs_root *root; 42325d4f98a2SYan Zheng struct btrfs_key key; 42334624900dSZhaolei u64 objectid; 42345d4f98a2SYan Zheng int err = 0; 42355d4f98a2SYan Zheng 42365d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 42375d4f98a2SYan Zheng if (IS_ERR(root)) 42385d4f98a2SYan Zheng return ERR_CAST(root); 42395d4f98a2SYan Zheng 4240a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 42413fd0a558SYan, Zheng if (IS_ERR(trans)) 42423fd0a558SYan, Zheng return ERR_CAST(trans); 42435d4f98a2SYan Zheng 4244581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 42455d4f98a2SYan Zheng if (err) 42465d4f98a2SYan Zheng goto out; 42475d4f98a2SYan Zheng 42480257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 42495d4f98a2SYan Zheng BUG_ON(err); 42505d4f98a2SYan Zheng 42515d4f98a2SYan Zheng key.objectid = objectid; 42525d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 42535d4f98a2SYan Zheng key.offset = 0; 42540b246afaSJeff Mahoney inode = btrfs_iget(fs_info->sb, &key, root, NULL); 42555d4f98a2SYan Zheng BUG_ON(IS_ERR(inode) || is_bad_inode(inode)); 42565d4f98a2SYan Zheng BTRFS_I(inode)->index_cnt = group->key.objectid; 42575d4f98a2SYan Zheng 425873f2e545SNikolay Borisov err = btrfs_orphan_add(trans, BTRFS_I(inode)); 42595d4f98a2SYan Zheng out: 42603a45bb20SJeff Mahoney btrfs_end_transaction(trans); 42612ff7e61eSJeff Mahoney btrfs_btree_balance_dirty(fs_info); 42625d4f98a2SYan Zheng if (err) { 42635d4f98a2SYan Zheng if (inode) 42645d4f98a2SYan Zheng iput(inode); 42655d4f98a2SYan Zheng inode = ERR_PTR(err); 42665d4f98a2SYan Zheng } 42675d4f98a2SYan Zheng return inode; 42685d4f98a2SYan Zheng } 42695d4f98a2SYan Zheng 4270a9995eecSJosef Bacik static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info) 42713fd0a558SYan, Zheng { 42723fd0a558SYan, Zheng struct reloc_control *rc; 42733fd0a558SYan, Zheng 42743fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 42753fd0a558SYan, Zheng if (!rc) 42763fd0a558SYan, Zheng return NULL; 42773fd0a558SYan, Zheng 42783fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 42793fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 42803fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 4281c6100a4bSJosef Bacik extent_io_tree_init(&rc->processed_blocks, NULL); 42823fd0a558SYan, Zheng return rc; 42833fd0a558SYan, Zheng } 42843fd0a558SYan, Zheng 42855d4f98a2SYan Zheng /* 4286ebce0e01SAdam Borowski * Print the block group being relocated 4287ebce0e01SAdam Borowski */ 4288ebce0e01SAdam Borowski static void describe_relocation(struct btrfs_fs_info *fs_info, 4289ebce0e01SAdam Borowski struct btrfs_block_group_cache *block_group) 4290ebce0e01SAdam Borowski { 4291ebce0e01SAdam Borowski char buf[128]; /* prefixed by a '|' that'll be dropped */ 4292ebce0e01SAdam Borowski u64 flags = block_group->flags; 4293ebce0e01SAdam Borowski 4294ebce0e01SAdam Borowski /* Shouldn't happen */ 4295ebce0e01SAdam Borowski if (!flags) { 4296ebce0e01SAdam Borowski strcpy(buf, "|NONE"); 4297ebce0e01SAdam Borowski } else { 4298ebce0e01SAdam Borowski char *bp = buf; 4299ebce0e01SAdam Borowski 4300ebce0e01SAdam Borowski #define DESCRIBE_FLAG(f, d) \ 4301ebce0e01SAdam Borowski if (flags & BTRFS_BLOCK_GROUP_##f) { \ 4302ebce0e01SAdam Borowski bp += snprintf(bp, buf - bp + sizeof(buf), "|%s", d); \ 4303ebce0e01SAdam Borowski flags &= ~BTRFS_BLOCK_GROUP_##f; \ 4304ebce0e01SAdam Borowski } 4305ebce0e01SAdam Borowski DESCRIBE_FLAG(DATA, "data"); 4306ebce0e01SAdam Borowski DESCRIBE_FLAG(SYSTEM, "system"); 4307ebce0e01SAdam Borowski DESCRIBE_FLAG(METADATA, "metadata"); 4308ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID0, "raid0"); 4309ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID1, "raid1"); 4310ebce0e01SAdam Borowski DESCRIBE_FLAG(DUP, "dup"); 4311ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID10, "raid10"); 4312ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID5, "raid5"); 4313ebce0e01SAdam Borowski DESCRIBE_FLAG(RAID6, "raid6"); 4314ebce0e01SAdam Borowski if (flags) 4315ebce0e01SAdam Borowski snprintf(buf, buf - bp + sizeof(buf), "|0x%llx", flags); 4316ebce0e01SAdam Borowski #undef DESCRIBE_FLAG 4317ebce0e01SAdam Borowski } 4318ebce0e01SAdam Borowski 4319ebce0e01SAdam Borowski btrfs_info(fs_info, 4320ebce0e01SAdam Borowski "relocating block group %llu flags %s", 4321ebce0e01SAdam Borowski block_group->key.objectid, buf + 1); 4322ebce0e01SAdam Borowski } 4323ebce0e01SAdam Borowski 4324ebce0e01SAdam Borowski /* 43255d4f98a2SYan Zheng * function to relocate all extents in a block group. 43265d4f98a2SYan Zheng */ 43276bccf3abSJeff Mahoney int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start) 43285d4f98a2SYan Zheng { 43296bccf3abSJeff Mahoney struct btrfs_root *extent_root = fs_info->extent_root; 43305d4f98a2SYan Zheng struct reloc_control *rc; 43310af3d00bSJosef Bacik struct inode *inode; 43320af3d00bSJosef Bacik struct btrfs_path *path; 43335d4f98a2SYan Zheng int ret; 4334f0486c68SYan, Zheng int rw = 0; 43355d4f98a2SYan Zheng int err = 0; 43365d4f98a2SYan Zheng 4337a9995eecSJosef Bacik rc = alloc_reloc_control(fs_info); 43385d4f98a2SYan Zheng if (!rc) 43395d4f98a2SYan Zheng return -ENOMEM; 43405d4f98a2SYan Zheng 4341f0486c68SYan, Zheng rc->extent_root = extent_root; 43423fd0a558SYan, Zheng 43435d4f98a2SYan Zheng rc->block_group = btrfs_lookup_block_group(fs_info, group_start); 43445d4f98a2SYan Zheng BUG_ON(!rc->block_group); 43455d4f98a2SYan Zheng 43465e00f193SJeff Mahoney ret = btrfs_inc_block_group_ro(fs_info, rc->block_group); 4347f0486c68SYan, Zheng if (ret) { 4348f0486c68SYan, Zheng err = ret; 4349f0486c68SYan, Zheng goto out; 4350f0486c68SYan, Zheng } 4351f0486c68SYan, Zheng rw = 1; 4352f0486c68SYan, Zheng 43530af3d00bSJosef Bacik path = btrfs_alloc_path(); 43540af3d00bSJosef Bacik if (!path) { 43550af3d00bSJosef Bacik err = -ENOMEM; 43560af3d00bSJosef Bacik goto out; 43570af3d00bSJosef Bacik } 43580af3d00bSJosef Bacik 435977ab86bfSJeff Mahoney inode = lookup_free_space_inode(fs_info, rc->block_group, path); 43600af3d00bSJosef Bacik btrfs_free_path(path); 43610af3d00bSJosef Bacik 43620af3d00bSJosef Bacik if (!IS_ERR(inode)) 43631bbc621eSChris Mason ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0); 43640af3d00bSJosef Bacik else 43650af3d00bSJosef Bacik ret = PTR_ERR(inode); 43660af3d00bSJosef Bacik 43670af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 43680af3d00bSJosef Bacik err = ret; 43690af3d00bSJosef Bacik goto out; 43700af3d00bSJosef Bacik } 43710af3d00bSJosef Bacik 43725d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 43735d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 43745d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 43755d4f98a2SYan Zheng rc->data_inode = NULL; 43765d4f98a2SYan Zheng goto out; 43775d4f98a2SYan Zheng } 43785d4f98a2SYan Zheng 43790b246afaSJeff Mahoney describe_relocation(fs_info, rc->block_group); 43805d4f98a2SYan Zheng 43819cfa3e34SFilipe Manana btrfs_wait_block_group_reservations(rc->block_group); 4382f78c436cSFilipe Manana btrfs_wait_nocow_writers(rc->block_group); 43836374e57aSChris Mason btrfs_wait_ordered_roots(fs_info, U64_MAX, 4384578def7cSFilipe Manana rc->block_group->key.objectid, 4385578def7cSFilipe Manana rc->block_group->key.offset); 43865d4f98a2SYan Zheng 43875d4f98a2SYan Zheng while (1) { 438876dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 43895d4f98a2SYan Zheng ret = relocate_block_group(rc); 439076dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 43915d4f98a2SYan Zheng if (ret < 0) { 43925d4f98a2SYan Zheng err = ret; 43933fd0a558SYan, Zheng goto out; 43945d4f98a2SYan Zheng } 43955d4f98a2SYan Zheng 43965d4f98a2SYan Zheng if (rc->extents_found == 0) 43975d4f98a2SYan Zheng break; 43985d4f98a2SYan Zheng 43990b246afaSJeff Mahoney btrfs_info(fs_info, "found %llu extents", rc->extents_found); 44005d4f98a2SYan Zheng 44015d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 44020ef8b726SJosef Bacik ret = btrfs_wait_ordered_range(rc->data_inode, 0, 44030ef8b726SJosef Bacik (u64)-1); 44040ef8b726SJosef Bacik if (ret) { 44050ef8b726SJosef Bacik err = ret; 44060ef8b726SJosef Bacik goto out; 44070ef8b726SJosef Bacik } 44085d4f98a2SYan Zheng invalidate_mapping_pages(rc->data_inode->i_mapping, 44095d4f98a2SYan Zheng 0, -1); 44105d4f98a2SYan Zheng rc->stage = UPDATE_DATA_PTRS; 44115d4f98a2SYan Zheng } 44125d4f98a2SYan Zheng } 44135d4f98a2SYan Zheng 44145d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 44155d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 44165d4f98a2SYan Zheng WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0); 44175d4f98a2SYan Zheng out: 4418f0486c68SYan, Zheng if (err && rw) 44192ff7e61eSJeff Mahoney btrfs_dec_block_group_ro(rc->block_group); 44205d4f98a2SYan Zheng iput(rc->data_inode); 44215d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 44225d4f98a2SYan Zheng kfree(rc); 44235d4f98a2SYan Zheng return err; 44245d4f98a2SYan Zheng } 44255d4f98a2SYan Zheng 442676dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 442776dda93cSYan, Zheng { 44280b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 442976dda93cSYan, Zheng struct btrfs_trans_handle *trans; 443079787eaaSJeff Mahoney int ret, err; 443176dda93cSYan, Zheng 44320b246afaSJeff Mahoney trans = btrfs_start_transaction(fs_info->tree_root, 0); 443379787eaaSJeff Mahoney if (IS_ERR(trans)) 443479787eaaSJeff Mahoney return PTR_ERR(trans); 443576dda93cSYan, Zheng 443676dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 443776dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 443876dda93cSYan, Zheng root->root_item.drop_level = 0; 443976dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 44400b246afaSJeff Mahoney ret = btrfs_update_root(trans, fs_info->tree_root, 444176dda93cSYan, Zheng &root->root_key, &root->root_item); 444276dda93cSYan, Zheng 44433a45bb20SJeff Mahoney err = btrfs_end_transaction(trans); 444479787eaaSJeff Mahoney if (err) 444579787eaaSJeff Mahoney return err; 444679787eaaSJeff Mahoney return ret; 444776dda93cSYan, Zheng } 444876dda93cSYan, Zheng 44495d4f98a2SYan Zheng /* 44505d4f98a2SYan Zheng * recover relocation interrupted by system crash. 44515d4f98a2SYan Zheng * 44525d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 44535d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 44545d4f98a2SYan Zheng */ 44555d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 44565d4f98a2SYan Zheng { 44570b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 44585d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 44595d4f98a2SYan Zheng struct btrfs_key key; 44605d4f98a2SYan Zheng struct btrfs_root *fs_root; 44615d4f98a2SYan Zheng struct btrfs_root *reloc_root; 44625d4f98a2SYan Zheng struct btrfs_path *path; 44635d4f98a2SYan Zheng struct extent_buffer *leaf; 44645d4f98a2SYan Zheng struct reloc_control *rc = NULL; 44655d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 44665d4f98a2SYan Zheng int ret; 44675d4f98a2SYan Zheng int err = 0; 44685d4f98a2SYan Zheng 44695d4f98a2SYan Zheng path = btrfs_alloc_path(); 44705d4f98a2SYan Zheng if (!path) 44715d4f98a2SYan Zheng return -ENOMEM; 4472e4058b54SDavid Sterba path->reada = READA_BACK; 44735d4f98a2SYan Zheng 44745d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 44755d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 44765d4f98a2SYan Zheng key.offset = (u64)-1; 44775d4f98a2SYan Zheng 44785d4f98a2SYan Zheng while (1) { 44790b246afaSJeff Mahoney ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, 44805d4f98a2SYan Zheng path, 0, 0); 44815d4f98a2SYan Zheng if (ret < 0) { 44825d4f98a2SYan Zheng err = ret; 44835d4f98a2SYan Zheng goto out; 44845d4f98a2SYan Zheng } 44855d4f98a2SYan Zheng if (ret > 0) { 44865d4f98a2SYan Zheng if (path->slots[0] == 0) 44875d4f98a2SYan Zheng break; 44885d4f98a2SYan Zheng path->slots[0]--; 44895d4f98a2SYan Zheng } 44905d4f98a2SYan Zheng leaf = path->nodes[0]; 44915d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4492b3b4aa74SDavid Sterba btrfs_release_path(path); 44935d4f98a2SYan Zheng 44945d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 44955d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 44965d4f98a2SYan Zheng break; 44975d4f98a2SYan Zheng 4498cb517eabSMiao Xie reloc_root = btrfs_read_fs_root(root, &key); 44995d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 45005d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 45015d4f98a2SYan Zheng goto out; 45025d4f98a2SYan Zheng } 45035d4f98a2SYan Zheng 45045d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 45055d4f98a2SYan Zheng 45065d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 45070b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, 45085d4f98a2SYan Zheng reloc_root->root_key.offset); 45095d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 451076dda93cSYan, Zheng ret = PTR_ERR(fs_root); 451176dda93cSYan, Zheng if (ret != -ENOENT) { 451276dda93cSYan, Zheng err = ret; 45135d4f98a2SYan Zheng goto out; 45145d4f98a2SYan Zheng } 451579787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 451679787eaaSJeff Mahoney if (ret < 0) { 451779787eaaSJeff Mahoney err = ret; 451879787eaaSJeff Mahoney goto out; 451979787eaaSJeff Mahoney } 452076dda93cSYan, Zheng } 45215d4f98a2SYan Zheng } 45225d4f98a2SYan Zheng 45235d4f98a2SYan Zheng if (key.offset == 0) 45245d4f98a2SYan Zheng break; 45255d4f98a2SYan Zheng 45265d4f98a2SYan Zheng key.offset--; 45275d4f98a2SYan Zheng } 4528b3b4aa74SDavid Sterba btrfs_release_path(path); 45295d4f98a2SYan Zheng 45305d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 45315d4f98a2SYan Zheng goto out; 45325d4f98a2SYan Zheng 45330b246afaSJeff Mahoney rc = alloc_reloc_control(fs_info); 45345d4f98a2SYan Zheng if (!rc) { 45355d4f98a2SYan Zheng err = -ENOMEM; 45365d4f98a2SYan Zheng goto out; 45375d4f98a2SYan Zheng } 45385d4f98a2SYan Zheng 45390b246afaSJeff Mahoney rc->extent_root = fs_info->extent_root; 45405d4f98a2SYan Zheng 45415d4f98a2SYan Zheng set_reloc_control(rc); 45425d4f98a2SYan Zheng 45437a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 45443612b495STsutomu Itoh if (IS_ERR(trans)) { 45453612b495STsutomu Itoh unset_reloc_control(rc); 45463612b495STsutomu Itoh err = PTR_ERR(trans); 45473612b495STsutomu Itoh goto out_free; 45483612b495STsutomu Itoh } 45493fd0a558SYan, Zheng 45503fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 45513fd0a558SYan, Zheng 45525d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 45535d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 45545d4f98a2SYan Zheng struct btrfs_root, root_list); 45555d4f98a2SYan Zheng list_del(&reloc_root->root_list); 45565d4f98a2SYan Zheng 45575d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 45585d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 45595d4f98a2SYan Zheng &rc->reloc_roots); 45605d4f98a2SYan Zheng continue; 45615d4f98a2SYan Zheng } 45625d4f98a2SYan Zheng 45630b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, reloc_root->root_key.offset); 456479787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 456579787eaaSJeff Mahoney err = PTR_ERR(fs_root); 456679787eaaSJeff Mahoney goto out_free; 456779787eaaSJeff Mahoney } 45685d4f98a2SYan Zheng 4569ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 457079787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 45715d4f98a2SYan Zheng fs_root->reloc_root = reloc_root; 45725d4f98a2SYan Zheng } 45735d4f98a2SYan Zheng 45743a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 457579787eaaSJeff Mahoney if (err) 457679787eaaSJeff Mahoney goto out_free; 45775d4f98a2SYan Zheng 45785d4f98a2SYan Zheng merge_reloc_roots(rc); 45795d4f98a2SYan Zheng 45805d4f98a2SYan Zheng unset_reloc_control(rc); 45815d4f98a2SYan Zheng 45827a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 458362b99540SQu Wenruo if (IS_ERR(trans)) { 45843612b495STsutomu Itoh err = PTR_ERR(trans); 458562b99540SQu Wenruo goto out_free; 458662b99540SQu Wenruo } 45873a45bb20SJeff Mahoney err = btrfs_commit_transaction(trans); 45883612b495STsutomu Itoh out_free: 45895d4f98a2SYan Zheng kfree(rc); 45903612b495STsutomu Itoh out: 4591aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4592aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4593aca1bba6SLiu Bo 45945d4f98a2SYan Zheng btrfs_free_path(path); 45955d4f98a2SYan Zheng 45965d4f98a2SYan Zheng if (err == 0) { 45975d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 45980b246afaSJeff Mahoney fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 45995d4f98a2SYan Zheng if (IS_ERR(fs_root)) 46005d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4601d7ce5843SMiao Xie else 460266b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 46035d4f98a2SYan Zheng } 46045d4f98a2SYan Zheng return err; 46055d4f98a2SYan Zheng } 46065d4f98a2SYan Zheng 46075d4f98a2SYan Zheng /* 46085d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 46095d4f98a2SYan Zheng * 46105d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 46115d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 46125d4f98a2SYan Zheng */ 46135d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 46145d4f98a2SYan Zheng { 46150b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); 46165d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 46175d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 46185d4f98a2SYan Zheng int ret; 46195d4f98a2SYan Zheng u64 disk_bytenr; 46204577b014SJosef Bacik u64 new_bytenr; 46215d4f98a2SYan Zheng LIST_HEAD(list); 46225d4f98a2SYan Zheng 46235d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 46245d4f98a2SYan Zheng BUG_ON(ordered->file_offset != file_pos || ordered->len != len); 46255d4f98a2SYan Zheng 46265d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 46270b246afaSJeff Mahoney ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr, 4628a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 462979787eaaSJeff Mahoney if (ret) 463079787eaaSJeff Mahoney goto out; 46315d4f98a2SYan Zheng 46325d4f98a2SYan Zheng while (!list_empty(&list)) { 46335d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 46345d4f98a2SYan Zheng list_del_init(&sums->list); 46355d4f98a2SYan Zheng 46364577b014SJosef Bacik /* 46374577b014SJosef Bacik * We need to offset the new_bytenr based on where the csum is. 46384577b014SJosef Bacik * We need to do this because we will read in entire prealloc 46394577b014SJosef Bacik * extents but we may have written to say the middle of the 46404577b014SJosef Bacik * prealloc extent, so we need to make sure the csum goes with 46414577b014SJosef Bacik * the right disk offset. 46424577b014SJosef Bacik * 46434577b014SJosef Bacik * We can do this because the data reloc inode refers strictly 46444577b014SJosef Bacik * to the on disk bytes, so we don't have to worry about 46454577b014SJosef Bacik * disk_len vs real len like with real inodes since it's all 46464577b014SJosef Bacik * disk length. 46474577b014SJosef Bacik */ 46484577b014SJosef Bacik new_bytenr = ordered->start + (sums->bytenr - disk_bytenr); 46494577b014SJosef Bacik sums->bytenr = new_bytenr; 46505d4f98a2SYan Zheng 46515d4f98a2SYan Zheng btrfs_add_ordered_sum(inode, ordered, sums); 46525d4f98a2SYan Zheng } 465379787eaaSJeff Mahoney out: 46545d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4655411fc6bcSAndi Kleen return ret; 46565d4f98a2SYan Zheng } 46573fd0a558SYan, Zheng 465883d4cfd4SJosef Bacik int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 46593fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 46603fd0a558SYan, Zheng struct extent_buffer *cow) 46613fd0a558SYan, Zheng { 46620b246afaSJeff Mahoney struct btrfs_fs_info *fs_info = root->fs_info; 46633fd0a558SYan, Zheng struct reloc_control *rc; 46643fd0a558SYan, Zheng struct backref_node *node; 46653fd0a558SYan, Zheng int first_cow = 0; 46663fd0a558SYan, Zheng int level; 466783d4cfd4SJosef Bacik int ret = 0; 46683fd0a558SYan, Zheng 46690b246afaSJeff Mahoney rc = fs_info->reloc_ctl; 46703fd0a558SYan, Zheng if (!rc) 467183d4cfd4SJosef Bacik return 0; 46723fd0a558SYan, Zheng 46733fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 46743fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 46753fd0a558SYan, Zheng 4676c974c464SWang Shilong if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 4677c974c464SWang Shilong if (buf == root->node) 4678c974c464SWang Shilong __update_reloc_root(root, cow->start); 4679c974c464SWang Shilong } 4680c974c464SWang Shilong 46813fd0a558SYan, Zheng level = btrfs_header_level(buf); 46823fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 46833fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 46843fd0a558SYan, Zheng first_cow = 1; 46853fd0a558SYan, Zheng 46863fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 46873fd0a558SYan, Zheng rc->create_reloc_tree) { 46883fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 46893fd0a558SYan, Zheng 46903fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 46913fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 46923fd0a558SYan, Zheng node->new_bytenr != buf->start); 46933fd0a558SYan, Zheng 46943fd0a558SYan, Zheng drop_node_buffer(node); 46953fd0a558SYan, Zheng extent_buffer_get(cow); 46963fd0a558SYan, Zheng node->eb = cow; 46973fd0a558SYan, Zheng node->new_bytenr = cow->start; 46983fd0a558SYan, Zheng 46993fd0a558SYan, Zheng if (!node->pending) { 47003fd0a558SYan, Zheng list_move_tail(&node->list, 47013fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 47023fd0a558SYan, Zheng node->pending = 1; 47033fd0a558SYan, Zheng } 47043fd0a558SYan, Zheng 47053fd0a558SYan, Zheng if (first_cow) 47063fd0a558SYan, Zheng __mark_block_processed(rc, node); 47073fd0a558SYan, Zheng 47083fd0a558SYan, Zheng if (first_cow && level > 0) 47093fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 47103fd0a558SYan, Zheng } 47113fd0a558SYan, Zheng 471283d4cfd4SJosef Bacik if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) 47133fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 471483d4cfd4SJosef Bacik return ret; 47153fd0a558SYan, Zheng } 47163fd0a558SYan, Zheng 47173fd0a558SYan, Zheng /* 47183fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 471901327610SNicholas D Steeves * required for relocating tree blocks in the snapshot 47203fd0a558SYan, Zheng */ 4721147d256eSZhaolei void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending, 47223fd0a558SYan, Zheng u64 *bytes_to_reserve) 47233fd0a558SYan, Zheng { 47243fd0a558SYan, Zheng struct btrfs_root *root; 47253fd0a558SYan, Zheng struct reloc_control *rc; 47263fd0a558SYan, Zheng 47273fd0a558SYan, Zheng root = pending->root; 47283fd0a558SYan, Zheng if (!root->reloc_root) 47293fd0a558SYan, Zheng return; 47303fd0a558SYan, Zheng 47313fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 47323fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 47333fd0a558SYan, Zheng return; 47343fd0a558SYan, Zheng 47353fd0a558SYan, Zheng root = root->reloc_root; 47363fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 47373fd0a558SYan, Zheng /* 47383fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 47393fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 47403fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 47413fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 47423fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 47433fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 47443fd0a558SYan, Zheng * tree may use more space than it frees. so we need 47453fd0a558SYan, Zheng * reserve extra space. 47463fd0a558SYan, Zheng */ 47473fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 47483fd0a558SYan, Zheng } 47493fd0a558SYan, Zheng 47503fd0a558SYan, Zheng /* 47513fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 47523fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 47533fd0a558SYan, Zheng */ 475449b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 47553fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 47563fd0a558SYan, Zheng { 47573fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 47583fd0a558SYan, Zheng struct btrfs_root *reloc_root; 47593fd0a558SYan, Zheng struct btrfs_root *new_root; 47603fd0a558SYan, Zheng struct reloc_control *rc; 47613fd0a558SYan, Zheng int ret; 47623fd0a558SYan, Zheng 47633fd0a558SYan, Zheng if (!root->reloc_root) 476449b25e05SJeff Mahoney return 0; 47653fd0a558SYan, Zheng 47663fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 47673fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 47683fd0a558SYan, Zheng 47693fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 47703fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 47713fd0a558SYan, Zheng rc->block_rsv, 477225d609f8SJosef Bacik rc->nodes_relocated, 1); 477349b25e05SJeff Mahoney if (ret) 477449b25e05SJeff Mahoney return ret; 47753fd0a558SYan, Zheng } 47763fd0a558SYan, Zheng 47773fd0a558SYan, Zheng new_root = pending->snap; 47783fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 47793fd0a558SYan, Zheng new_root->root_key.objectid); 478049b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 478149b25e05SJeff Mahoney return PTR_ERR(reloc_root); 47823fd0a558SYan, Zheng 4783ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4784ffd7b339SJeff Mahoney BUG_ON(ret < 0); 47853fd0a558SYan, Zheng new_root->reloc_root = reloc_root; 47863fd0a558SYan, Zheng 478749b25e05SJeff Mahoney if (rc->create_reloc_tree) 47883fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 478949b25e05SJeff Mahoney return ret; 47903fd0a558SYan, Zheng } 4791