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" 335d4f98a2SYan Zheng 345d4f98a2SYan Zheng /* 355d4f98a2SYan Zheng * backref_node, mapping_node and tree_block start with this 365d4f98a2SYan Zheng */ 375d4f98a2SYan Zheng struct tree_entry { 385d4f98a2SYan Zheng struct rb_node rb_node; 395d4f98a2SYan Zheng u64 bytenr; 405d4f98a2SYan Zheng }; 415d4f98a2SYan Zheng 425d4f98a2SYan Zheng /* 435d4f98a2SYan Zheng * present a tree block in the backref cache 445d4f98a2SYan Zheng */ 455d4f98a2SYan Zheng struct backref_node { 465d4f98a2SYan Zheng struct rb_node rb_node; 475d4f98a2SYan Zheng u64 bytenr; 483fd0a558SYan, Zheng 493fd0a558SYan, Zheng u64 new_bytenr; 503fd0a558SYan, Zheng /* objectid of tree block owner, can be not uptodate */ 515d4f98a2SYan Zheng u64 owner; 523fd0a558SYan, Zheng /* link to pending, changed or detached list */ 533fd0a558SYan, Zheng struct list_head list; 545d4f98a2SYan Zheng /* list of upper level blocks reference this block */ 555d4f98a2SYan Zheng struct list_head upper; 565d4f98a2SYan Zheng /* list of child blocks in the cache */ 575d4f98a2SYan Zheng struct list_head lower; 585d4f98a2SYan Zheng /* NULL if this node is not tree root */ 595d4f98a2SYan Zheng struct btrfs_root *root; 605d4f98a2SYan Zheng /* extent buffer got by COW the block */ 615d4f98a2SYan Zheng struct extent_buffer *eb; 625d4f98a2SYan Zheng /* level of tree block */ 635d4f98a2SYan Zheng unsigned int level:8; 643fd0a558SYan, Zheng /* is the block in non-reference counted tree */ 653fd0a558SYan, Zheng unsigned int cowonly:1; 663fd0a558SYan, Zheng /* 1 if no child node in the cache */ 675d4f98a2SYan Zheng unsigned int lowest:1; 685d4f98a2SYan Zheng /* is the extent buffer locked */ 695d4f98a2SYan Zheng unsigned int locked:1; 705d4f98a2SYan Zheng /* has the block been processed */ 715d4f98a2SYan Zheng unsigned int processed:1; 725d4f98a2SYan Zheng /* have backrefs of this block been checked */ 735d4f98a2SYan Zheng unsigned int checked:1; 743fd0a558SYan, Zheng /* 753fd0a558SYan, Zheng * 1 if corresponding block has been cowed but some upper 763fd0a558SYan, Zheng * level block pointers may not point to the new location 773fd0a558SYan, Zheng */ 783fd0a558SYan, Zheng unsigned int pending:1; 793fd0a558SYan, Zheng /* 803fd0a558SYan, Zheng * 1 if the backref node isn't connected to any other 813fd0a558SYan, Zheng * backref node. 823fd0a558SYan, Zheng */ 833fd0a558SYan, Zheng unsigned int detached:1; 845d4f98a2SYan Zheng }; 855d4f98a2SYan Zheng 865d4f98a2SYan Zheng /* 875d4f98a2SYan Zheng * present a block pointer in the backref cache 885d4f98a2SYan Zheng */ 895d4f98a2SYan Zheng struct backref_edge { 905d4f98a2SYan Zheng struct list_head list[2]; 915d4f98a2SYan Zheng struct backref_node *node[2]; 925d4f98a2SYan Zheng }; 935d4f98a2SYan Zheng 945d4f98a2SYan Zheng #define LOWER 0 955d4f98a2SYan Zheng #define UPPER 1 965d4f98a2SYan Zheng 975d4f98a2SYan Zheng struct backref_cache { 985d4f98a2SYan Zheng /* red black tree of all backref nodes in the cache */ 995d4f98a2SYan Zheng struct rb_root rb_root; 1003fd0a558SYan, Zheng /* for passing backref nodes to btrfs_reloc_cow_block */ 1013fd0a558SYan, Zheng struct backref_node *path[BTRFS_MAX_LEVEL]; 1023fd0a558SYan, Zheng /* 1033fd0a558SYan, Zheng * list of blocks that have been cowed but some block 1043fd0a558SYan, Zheng * pointers in upper level blocks may not reflect the 1053fd0a558SYan, Zheng * new location 1063fd0a558SYan, Zheng */ 1075d4f98a2SYan Zheng struct list_head pending[BTRFS_MAX_LEVEL]; 1083fd0a558SYan, Zheng /* list of backref nodes with no child node */ 1093fd0a558SYan, Zheng struct list_head leaves; 1103fd0a558SYan, Zheng /* list of blocks that have been cowed in current transaction */ 1113fd0a558SYan, Zheng struct list_head changed; 1123fd0a558SYan, Zheng /* list of detached backref node. */ 1133fd0a558SYan, Zheng struct list_head detached; 1143fd0a558SYan, Zheng 1153fd0a558SYan, Zheng u64 last_trans; 1163fd0a558SYan, Zheng 1173fd0a558SYan, Zheng int nr_nodes; 1183fd0a558SYan, Zheng int nr_edges; 1195d4f98a2SYan Zheng }; 1205d4f98a2SYan Zheng 1215d4f98a2SYan Zheng /* 1225d4f98a2SYan Zheng * map address of tree root to tree 1235d4f98a2SYan Zheng */ 1245d4f98a2SYan Zheng struct mapping_node { 1255d4f98a2SYan Zheng struct rb_node rb_node; 1265d4f98a2SYan Zheng u64 bytenr; 1275d4f98a2SYan Zheng void *data; 1285d4f98a2SYan Zheng }; 1295d4f98a2SYan Zheng 1305d4f98a2SYan Zheng struct mapping_tree { 1315d4f98a2SYan Zheng struct rb_root rb_root; 1325d4f98a2SYan Zheng spinlock_t lock; 1335d4f98a2SYan Zheng }; 1345d4f98a2SYan Zheng 1355d4f98a2SYan Zheng /* 1365d4f98a2SYan Zheng * present a tree block to process 1375d4f98a2SYan Zheng */ 1385d4f98a2SYan Zheng struct tree_block { 1395d4f98a2SYan Zheng struct rb_node rb_node; 1405d4f98a2SYan Zheng u64 bytenr; 1415d4f98a2SYan Zheng struct btrfs_key key; 1425d4f98a2SYan Zheng unsigned int level:8; 1435d4f98a2SYan Zheng unsigned int key_ready:1; 1445d4f98a2SYan Zheng }; 1455d4f98a2SYan Zheng 1460257bb82SYan, Zheng #define MAX_EXTENTS 128 1470257bb82SYan, Zheng 1480257bb82SYan, Zheng struct file_extent_cluster { 1490257bb82SYan, Zheng u64 start; 1500257bb82SYan, Zheng u64 end; 1510257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 1520257bb82SYan, Zheng unsigned int nr; 1530257bb82SYan, Zheng }; 1540257bb82SYan, Zheng 1555d4f98a2SYan Zheng struct reloc_control { 1565d4f98a2SYan Zheng /* block group to relocate */ 1575d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group; 1585d4f98a2SYan Zheng /* extent tree */ 1595d4f98a2SYan Zheng struct btrfs_root *extent_root; 1605d4f98a2SYan Zheng /* inode for moving data */ 1615d4f98a2SYan Zheng struct inode *data_inode; 1623fd0a558SYan, Zheng 1633fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 1643fd0a558SYan, Zheng 1653fd0a558SYan, Zheng struct backref_cache backref_cache; 1663fd0a558SYan, Zheng 1673fd0a558SYan, Zheng struct file_extent_cluster cluster; 1685d4f98a2SYan Zheng /* tree blocks have been processed */ 1695d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 1705d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 1715d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 1725d4f98a2SYan Zheng /* list of reloc trees */ 1735d4f98a2SYan Zheng struct list_head reloc_roots; 1743fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 1753fd0a558SYan, Zheng u64 merging_rsv_size; 1763fd0a558SYan, Zheng /* size of relocated tree nodes */ 1773fd0a558SYan, Zheng u64 nodes_relocated; 1783fd0a558SYan, Zheng 1795d4f98a2SYan Zheng u64 search_start; 1805d4f98a2SYan Zheng u64 extents_found; 1813fd0a558SYan, Zheng 1823fd0a558SYan, Zheng int block_rsv_retries; 1833fd0a558SYan, Zheng 1843fd0a558SYan, Zheng unsigned int stage:8; 1853fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 1863fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 1875d4f98a2SYan Zheng unsigned int found_file_extent:1; 1883fd0a558SYan, Zheng unsigned int commit_transaction:1; 1895d4f98a2SYan Zheng }; 1905d4f98a2SYan Zheng 1915d4f98a2SYan Zheng /* stages of data relocation */ 1925d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 1935d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 1945d4f98a2SYan Zheng 1953fd0a558SYan, Zheng static void remove_backref_node(struct backref_cache *cache, 1963fd0a558SYan, Zheng struct backref_node *node); 1973fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 1983fd0a558SYan, Zheng struct backref_node *node); 1995d4f98a2SYan Zheng 2005d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 2015d4f98a2SYan Zheng { 2026bef4d31SEric Paris tree->rb_root = RB_ROOT; 2035d4f98a2SYan Zheng spin_lock_init(&tree->lock); 2045d4f98a2SYan Zheng } 2055d4f98a2SYan Zheng 2065d4f98a2SYan Zheng static void backref_cache_init(struct backref_cache *cache) 2075d4f98a2SYan Zheng { 2085d4f98a2SYan Zheng int i; 2096bef4d31SEric Paris cache->rb_root = RB_ROOT; 2105d4f98a2SYan Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2115d4f98a2SYan Zheng INIT_LIST_HEAD(&cache->pending[i]); 2123fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->changed); 2133fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->detached); 2143fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->leaves); 2155d4f98a2SYan Zheng } 2165d4f98a2SYan Zheng 2173fd0a558SYan, Zheng static void backref_cache_cleanup(struct backref_cache *cache) 2185d4f98a2SYan Zheng { 2193fd0a558SYan, Zheng struct backref_node *node; 2203fd0a558SYan, Zheng int i; 2213fd0a558SYan, Zheng 2223fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2233fd0a558SYan, Zheng node = list_entry(cache->detached.next, 2243fd0a558SYan, Zheng struct backref_node, list); 2253fd0a558SYan, Zheng remove_backref_node(cache, node); 2263fd0a558SYan, Zheng } 2273fd0a558SYan, Zheng 2283fd0a558SYan, Zheng while (!list_empty(&cache->leaves)) { 2293fd0a558SYan, Zheng node = list_entry(cache->leaves.next, 2303fd0a558SYan, Zheng struct backref_node, lower); 2313fd0a558SYan, Zheng remove_backref_node(cache, node); 2323fd0a558SYan, Zheng } 2333fd0a558SYan, Zheng 2343fd0a558SYan, Zheng cache->last_trans = 0; 2353fd0a558SYan, Zheng 2363fd0a558SYan, Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2373fd0a558SYan, Zheng BUG_ON(!list_empty(&cache->pending[i])); 2383fd0a558SYan, Zheng BUG_ON(!list_empty(&cache->changed)); 2393fd0a558SYan, Zheng BUG_ON(!list_empty(&cache->detached)); 2403fd0a558SYan, Zheng BUG_ON(!RB_EMPTY_ROOT(&cache->rb_root)); 2413fd0a558SYan, Zheng BUG_ON(cache->nr_nodes); 2423fd0a558SYan, Zheng BUG_ON(cache->nr_edges); 2433fd0a558SYan, Zheng } 2443fd0a558SYan, Zheng 2453fd0a558SYan, Zheng static struct backref_node *alloc_backref_node(struct backref_cache *cache) 2463fd0a558SYan, Zheng { 2473fd0a558SYan, Zheng struct backref_node *node; 2483fd0a558SYan, Zheng 2493fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 2503fd0a558SYan, Zheng if (node) { 2513fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 2525d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 2535d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 2545d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 2553fd0a558SYan, Zheng cache->nr_nodes++; 2563fd0a558SYan, Zheng } 2573fd0a558SYan, Zheng return node; 2583fd0a558SYan, Zheng } 2593fd0a558SYan, Zheng 2603fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 2613fd0a558SYan, Zheng struct backref_node *node) 2623fd0a558SYan, Zheng { 2633fd0a558SYan, Zheng if (node) { 2643fd0a558SYan, Zheng cache->nr_nodes--; 2653fd0a558SYan, Zheng kfree(node); 2663fd0a558SYan, Zheng } 2673fd0a558SYan, Zheng } 2683fd0a558SYan, Zheng 2693fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 2703fd0a558SYan, Zheng { 2713fd0a558SYan, Zheng struct backref_edge *edge; 2723fd0a558SYan, Zheng 2733fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 2743fd0a558SYan, Zheng if (edge) 2753fd0a558SYan, Zheng cache->nr_edges++; 2763fd0a558SYan, Zheng return edge; 2773fd0a558SYan, Zheng } 2783fd0a558SYan, Zheng 2793fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 2803fd0a558SYan, Zheng struct backref_edge *edge) 2813fd0a558SYan, Zheng { 2823fd0a558SYan, Zheng if (edge) { 2833fd0a558SYan, Zheng cache->nr_edges--; 2843fd0a558SYan, Zheng kfree(edge); 2853fd0a558SYan, Zheng } 2865d4f98a2SYan Zheng } 2875d4f98a2SYan Zheng 2885d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 2895d4f98a2SYan Zheng struct rb_node *node) 2905d4f98a2SYan Zheng { 2915d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 2925d4f98a2SYan Zheng struct rb_node *parent = NULL; 2935d4f98a2SYan Zheng struct tree_entry *entry; 2945d4f98a2SYan Zheng 2955d4f98a2SYan Zheng while (*p) { 2965d4f98a2SYan Zheng parent = *p; 2975d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 2985d4f98a2SYan Zheng 2995d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3005d4f98a2SYan Zheng p = &(*p)->rb_left; 3015d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3025d4f98a2SYan Zheng p = &(*p)->rb_right; 3035d4f98a2SYan Zheng else 3045d4f98a2SYan Zheng return parent; 3055d4f98a2SYan Zheng } 3065d4f98a2SYan Zheng 3075d4f98a2SYan Zheng rb_link_node(node, parent, p); 3085d4f98a2SYan Zheng rb_insert_color(node, root); 3095d4f98a2SYan Zheng return NULL; 3105d4f98a2SYan Zheng } 3115d4f98a2SYan Zheng 3125d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 3135d4f98a2SYan Zheng { 3145d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 3155d4f98a2SYan Zheng struct tree_entry *entry; 3165d4f98a2SYan Zheng 3175d4f98a2SYan Zheng while (n) { 3185d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 3195d4f98a2SYan Zheng 3205d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3215d4f98a2SYan Zheng n = n->rb_left; 3225d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3235d4f98a2SYan Zheng n = n->rb_right; 3245d4f98a2SYan Zheng else 3255d4f98a2SYan Zheng return n; 3265d4f98a2SYan Zheng } 3275d4f98a2SYan Zheng return NULL; 3285d4f98a2SYan Zheng } 3295d4f98a2SYan Zheng 3305d4f98a2SYan Zheng /* 3315d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 3325d4f98a2SYan Zheng */ 3335d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 3345d4f98a2SYan Zheng struct backref_edge *edges[], 3355d4f98a2SYan Zheng int *index) 3365d4f98a2SYan Zheng { 3375d4f98a2SYan Zheng struct backref_edge *edge; 3385d4f98a2SYan Zheng int idx = *index; 3395d4f98a2SYan Zheng 3405d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 3415d4f98a2SYan Zheng edge = list_entry(node->upper.next, 3425d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3435d4f98a2SYan Zheng edges[idx++] = edge; 3445d4f98a2SYan Zheng node = edge->node[UPPER]; 3455d4f98a2SYan Zheng } 3463fd0a558SYan, Zheng BUG_ON(node->detached); 3475d4f98a2SYan Zheng *index = idx; 3485d4f98a2SYan Zheng return node; 3495d4f98a2SYan Zheng } 3505d4f98a2SYan Zheng 3515d4f98a2SYan Zheng /* 3525d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 3535d4f98a2SYan Zheng */ 3545d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 3555d4f98a2SYan Zheng int *index) 3565d4f98a2SYan Zheng { 3575d4f98a2SYan Zheng struct backref_edge *edge; 3585d4f98a2SYan Zheng struct backref_node *lower; 3595d4f98a2SYan Zheng int idx = *index; 3605d4f98a2SYan Zheng 3615d4f98a2SYan Zheng while (idx > 0) { 3625d4f98a2SYan Zheng edge = edges[idx - 1]; 3635d4f98a2SYan Zheng lower = edge->node[LOWER]; 3645d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 3655d4f98a2SYan Zheng idx--; 3665d4f98a2SYan Zheng continue; 3675d4f98a2SYan Zheng } 3685d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 3695d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3705d4f98a2SYan Zheng edges[idx - 1] = edge; 3715d4f98a2SYan Zheng *index = idx; 3725d4f98a2SYan Zheng return edge->node[UPPER]; 3735d4f98a2SYan Zheng } 3745d4f98a2SYan Zheng *index = 0; 3755d4f98a2SYan Zheng return NULL; 3765d4f98a2SYan Zheng } 3775d4f98a2SYan Zheng 3783fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 3795d4f98a2SYan Zheng { 3805d4f98a2SYan Zheng if (node->locked) { 3815d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 3825d4f98a2SYan Zheng node->locked = 0; 3835d4f98a2SYan Zheng } 3843fd0a558SYan, Zheng } 3853fd0a558SYan, Zheng 3863fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 3873fd0a558SYan, Zheng { 3883fd0a558SYan, Zheng if (node->eb) { 3893fd0a558SYan, Zheng unlock_node_buffer(node); 3905d4f98a2SYan Zheng free_extent_buffer(node->eb); 3915d4f98a2SYan Zheng node->eb = NULL; 3925d4f98a2SYan Zheng } 3935d4f98a2SYan Zheng } 3945d4f98a2SYan Zheng 3955d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 3965d4f98a2SYan Zheng struct backref_node *node) 3975d4f98a2SYan Zheng { 3985d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 3995d4f98a2SYan Zheng 4005d4f98a2SYan Zheng drop_node_buffer(node); 4013fd0a558SYan, Zheng list_del(&node->list); 4025d4f98a2SYan Zheng list_del(&node->lower); 4033fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 4045d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 4053fd0a558SYan, Zheng free_backref_node(tree, node); 4065d4f98a2SYan Zheng } 4075d4f98a2SYan Zheng 4085d4f98a2SYan Zheng /* 4095d4f98a2SYan Zheng * remove a backref node from the backref cache 4105d4f98a2SYan Zheng */ 4115d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 4125d4f98a2SYan Zheng struct backref_node *node) 4135d4f98a2SYan Zheng { 4145d4f98a2SYan Zheng struct backref_node *upper; 4155d4f98a2SYan Zheng struct backref_edge *edge; 4165d4f98a2SYan Zheng 4175d4f98a2SYan Zheng if (!node) 4185d4f98a2SYan Zheng return; 4195d4f98a2SYan Zheng 4203fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 4215d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4225d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 4235d4f98a2SYan Zheng list[LOWER]); 4245d4f98a2SYan Zheng upper = edge->node[UPPER]; 4255d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 4265d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 4273fd0a558SYan, Zheng free_backref_edge(cache, edge); 4283fd0a558SYan, Zheng 4293fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 4303fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 4313fd0a558SYan, Zheng drop_backref_node(cache, node); 4323fd0a558SYan, Zheng node = upper; 4333fd0a558SYan, Zheng node->lowest = 1; 4343fd0a558SYan, Zheng continue; 4353fd0a558SYan, Zheng } 4365d4f98a2SYan Zheng /* 4373fd0a558SYan, Zheng * add the node to leaf node list if no other 4385d4f98a2SYan Zheng * child block cached. 4395d4f98a2SYan Zheng */ 4405d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 4413fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 4425d4f98a2SYan Zheng upper->lowest = 1; 4435d4f98a2SYan Zheng } 4445d4f98a2SYan Zheng } 4453fd0a558SYan, Zheng 4465d4f98a2SYan Zheng drop_backref_node(cache, node); 4475d4f98a2SYan Zheng } 4485d4f98a2SYan Zheng 4493fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 4503fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 4513fd0a558SYan, Zheng { 4523fd0a558SYan, Zheng struct rb_node *rb_node; 4533fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 4543fd0a558SYan, Zheng node->bytenr = bytenr; 4553fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 4563fd0a558SYan, Zheng BUG_ON(rb_node); 4573fd0a558SYan, Zheng } 4583fd0a558SYan, Zheng 4593fd0a558SYan, Zheng /* 4603fd0a558SYan, Zheng * update backref cache after a transaction commit 4613fd0a558SYan, Zheng */ 4623fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 4633fd0a558SYan, Zheng struct backref_cache *cache) 4643fd0a558SYan, Zheng { 4653fd0a558SYan, Zheng struct backref_node *node; 4663fd0a558SYan, Zheng int level = 0; 4673fd0a558SYan, Zheng 4683fd0a558SYan, Zheng if (cache->last_trans == 0) { 4693fd0a558SYan, Zheng cache->last_trans = trans->transid; 4703fd0a558SYan, Zheng return 0; 4713fd0a558SYan, Zheng } 4723fd0a558SYan, Zheng 4733fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 4743fd0a558SYan, Zheng return 0; 4753fd0a558SYan, Zheng 4763fd0a558SYan, Zheng /* 4773fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 4783fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 4793fd0a558SYan, Zheng * so the detached nodes are no longer useful. 4803fd0a558SYan, Zheng */ 4813fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 4823fd0a558SYan, Zheng node = list_entry(cache->detached.next, 4833fd0a558SYan, Zheng struct backref_node, list); 4843fd0a558SYan, Zheng remove_backref_node(cache, node); 4853fd0a558SYan, Zheng } 4863fd0a558SYan, Zheng 4873fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 4883fd0a558SYan, Zheng node = list_entry(cache->changed.next, 4893fd0a558SYan, Zheng struct backref_node, list); 4903fd0a558SYan, Zheng list_del_init(&node->list); 4913fd0a558SYan, Zheng BUG_ON(node->pending); 4923fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 4933fd0a558SYan, Zheng } 4943fd0a558SYan, Zheng 4953fd0a558SYan, Zheng /* 4963fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 4973fd0a558SYan, Zheng * errors during processing the pending nodes. 4983fd0a558SYan, Zheng */ 4993fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 5003fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 5013fd0a558SYan, Zheng BUG_ON(!node->pending); 5023fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 5033fd0a558SYan, Zheng continue; 5043fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5053fd0a558SYan, Zheng } 5063fd0a558SYan, Zheng } 5073fd0a558SYan, Zheng 5083fd0a558SYan, Zheng cache->last_trans = 0; 5093fd0a558SYan, Zheng return 1; 5103fd0a558SYan, Zheng } 5113fd0a558SYan, Zheng 5123fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 5133fd0a558SYan, Zheng { 5143fd0a558SYan, Zheng struct btrfs_root *reloc_root; 5153fd0a558SYan, Zheng 5163fd0a558SYan, Zheng if (!root->ref_cows) 5173fd0a558SYan, Zheng return 0; 5183fd0a558SYan, Zheng 5193fd0a558SYan, Zheng reloc_root = root->reloc_root; 5203fd0a558SYan, Zheng if (!reloc_root) 5213fd0a558SYan, Zheng return 0; 5223fd0a558SYan, Zheng 5233fd0a558SYan, Zheng if (btrfs_root_last_snapshot(&reloc_root->root_item) == 5243fd0a558SYan, Zheng root->fs_info->running_transaction->transid - 1) 5253fd0a558SYan, Zheng return 0; 5263fd0a558SYan, Zheng /* 5273fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 5283fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 5293fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 5303fd0a558SYan, Zheng * relocation. 5313fd0a558SYan, Zheng */ 5323fd0a558SYan, Zheng return 1; 5333fd0a558SYan, Zheng } 5343fd0a558SYan, Zheng 5355d4f98a2SYan Zheng /* 5365d4f98a2SYan Zheng * find reloc tree by address of tree root 5375d4f98a2SYan Zheng */ 5385d4f98a2SYan Zheng static struct btrfs_root *find_reloc_root(struct reloc_control *rc, 5395d4f98a2SYan Zheng u64 bytenr) 5405d4f98a2SYan Zheng { 5415d4f98a2SYan Zheng struct rb_node *rb_node; 5425d4f98a2SYan Zheng struct mapping_node *node; 5435d4f98a2SYan Zheng struct btrfs_root *root = NULL; 5445d4f98a2SYan Zheng 5455d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 5465d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 5475d4f98a2SYan Zheng if (rb_node) { 5485d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 5495d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 5505d4f98a2SYan Zheng } 5515d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 5525d4f98a2SYan Zheng return root; 5535d4f98a2SYan Zheng } 5545d4f98a2SYan Zheng 5555d4f98a2SYan Zheng static int is_cowonly_root(u64 root_objectid) 5565d4f98a2SYan Zheng { 5575d4f98a2SYan Zheng if (root_objectid == BTRFS_ROOT_TREE_OBJECTID || 5585d4f98a2SYan Zheng root_objectid == BTRFS_EXTENT_TREE_OBJECTID || 5595d4f98a2SYan Zheng root_objectid == BTRFS_CHUNK_TREE_OBJECTID || 5605d4f98a2SYan Zheng root_objectid == BTRFS_DEV_TREE_OBJECTID || 5615d4f98a2SYan Zheng root_objectid == BTRFS_TREE_LOG_OBJECTID || 5625d4f98a2SYan Zheng root_objectid == BTRFS_CSUM_TREE_OBJECTID) 5635d4f98a2SYan Zheng return 1; 5645d4f98a2SYan Zheng return 0; 5655d4f98a2SYan Zheng } 5665d4f98a2SYan Zheng 5675d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 5685d4f98a2SYan Zheng u64 root_objectid) 5695d4f98a2SYan Zheng { 5705d4f98a2SYan Zheng struct btrfs_key key; 5715d4f98a2SYan Zheng 5725d4f98a2SYan Zheng key.objectid = root_objectid; 5735d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 5745d4f98a2SYan Zheng if (is_cowonly_root(root_objectid)) 5755d4f98a2SYan Zheng key.offset = 0; 5765d4f98a2SYan Zheng else 5775d4f98a2SYan Zheng key.offset = (u64)-1; 5785d4f98a2SYan Zheng 5795d4f98a2SYan Zheng return btrfs_read_fs_root_no_name(fs_info, &key); 5805d4f98a2SYan Zheng } 5815d4f98a2SYan Zheng 5825d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 5835d4f98a2SYan Zheng static noinline_for_stack 5845d4f98a2SYan Zheng struct btrfs_root *find_tree_root(struct reloc_control *rc, 5855d4f98a2SYan Zheng struct extent_buffer *leaf, 5865d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0) 5875d4f98a2SYan Zheng { 5885d4f98a2SYan Zheng struct btrfs_root *root; 5895d4f98a2SYan Zheng u64 root_objectid = btrfs_ref_root_v0(leaf, ref0); 5905d4f98a2SYan Zheng u64 generation = btrfs_ref_generation_v0(leaf, ref0); 5915d4f98a2SYan Zheng 5925d4f98a2SYan Zheng BUG_ON(root_objectid == BTRFS_TREE_RELOC_OBJECTID); 5935d4f98a2SYan Zheng 5945d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, root_objectid); 5955d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 5965d4f98a2SYan Zheng 5975d4f98a2SYan Zheng if (root->ref_cows && 5985d4f98a2SYan Zheng generation != btrfs_root_generation(&root->root_item)) 5995d4f98a2SYan Zheng return NULL; 6005d4f98a2SYan Zheng 6015d4f98a2SYan Zheng return root; 6025d4f98a2SYan Zheng } 6035d4f98a2SYan Zheng #endif 6045d4f98a2SYan Zheng 6055d4f98a2SYan Zheng static noinline_for_stack 6065d4f98a2SYan Zheng int find_inline_backref(struct extent_buffer *leaf, int slot, 6075d4f98a2SYan Zheng unsigned long *ptr, unsigned long *end) 6085d4f98a2SYan Zheng { 6095d4f98a2SYan Zheng struct btrfs_extent_item *ei; 6105d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 6115d4f98a2SYan Zheng u32 item_size; 6125d4f98a2SYan Zheng 6135d4f98a2SYan Zheng item_size = btrfs_item_size_nr(leaf, slot); 6145d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 6155d4f98a2SYan Zheng if (item_size < sizeof(*ei)) { 6165d4f98a2SYan Zheng WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0)); 6175d4f98a2SYan Zheng return 1; 6185d4f98a2SYan Zheng } 6195d4f98a2SYan Zheng #endif 6205d4f98a2SYan Zheng ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); 6215d4f98a2SYan Zheng WARN_ON(!(btrfs_extent_flags(leaf, ei) & 6225d4f98a2SYan Zheng BTRFS_EXTENT_FLAG_TREE_BLOCK)); 6235d4f98a2SYan Zheng 6245d4f98a2SYan Zheng if (item_size <= sizeof(*ei) + sizeof(*bi)) { 6255d4f98a2SYan Zheng WARN_ON(item_size < sizeof(*ei) + sizeof(*bi)); 6265d4f98a2SYan Zheng return 1; 6275d4f98a2SYan Zheng } 6285d4f98a2SYan Zheng 6295d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 6305d4f98a2SYan Zheng *ptr = (unsigned long)(bi + 1); 6315d4f98a2SYan Zheng *end = (unsigned long)ei + item_size; 6325d4f98a2SYan Zheng return 0; 6335d4f98a2SYan Zheng } 6345d4f98a2SYan Zheng 6355d4f98a2SYan Zheng /* 6365d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 6375d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 6385d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 6395d4f98a2SYan Zheng * 6405d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 6415d4f98a2SYan Zheng * to find upper level blocks that refernece the block, and then check 6425d4f98a2SYan Zheng * bakcrefs of these upper level blocks recursively. the recursion stop 6435d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 6445d4f98a2SYan Zheng * 6455d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 6465d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 6475d4f98a2SYan Zheng * block are also cached. 6485d4f98a2SYan Zheng */ 6493fd0a558SYan, Zheng static noinline_for_stack 6503fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 6515d4f98a2SYan Zheng struct btrfs_key *node_key, 6525d4f98a2SYan Zheng int level, u64 bytenr) 6535d4f98a2SYan Zheng { 6543fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 6555d4f98a2SYan Zheng struct btrfs_path *path1; 6565d4f98a2SYan Zheng struct btrfs_path *path2; 6575d4f98a2SYan Zheng struct extent_buffer *eb; 6585d4f98a2SYan Zheng struct btrfs_root *root; 6595d4f98a2SYan Zheng struct backref_node *cur; 6605d4f98a2SYan Zheng struct backref_node *upper; 6615d4f98a2SYan Zheng struct backref_node *lower; 6625d4f98a2SYan Zheng struct backref_node *node = NULL; 6635d4f98a2SYan Zheng struct backref_node *exist = NULL; 6645d4f98a2SYan Zheng struct backref_edge *edge; 6655d4f98a2SYan Zheng struct rb_node *rb_node; 6665d4f98a2SYan Zheng struct btrfs_key key; 6675d4f98a2SYan Zheng unsigned long end; 6685d4f98a2SYan Zheng unsigned long ptr; 6695d4f98a2SYan Zheng LIST_HEAD(list); 6703fd0a558SYan, Zheng LIST_HEAD(useless); 6713fd0a558SYan, Zheng int cowonly; 6725d4f98a2SYan Zheng int ret; 6735d4f98a2SYan Zheng int err = 0; 6745d4f98a2SYan Zheng 6755d4f98a2SYan Zheng path1 = btrfs_alloc_path(); 6765d4f98a2SYan Zheng path2 = btrfs_alloc_path(); 6775d4f98a2SYan Zheng if (!path1 || !path2) { 6785d4f98a2SYan Zheng err = -ENOMEM; 6795d4f98a2SYan Zheng goto out; 6805d4f98a2SYan Zheng } 6815d4f98a2SYan Zheng 6823fd0a558SYan, Zheng node = alloc_backref_node(cache); 6835d4f98a2SYan Zheng if (!node) { 6845d4f98a2SYan Zheng err = -ENOMEM; 6855d4f98a2SYan Zheng goto out; 6865d4f98a2SYan Zheng } 6875d4f98a2SYan Zheng 6885d4f98a2SYan Zheng node->bytenr = bytenr; 6895d4f98a2SYan Zheng node->level = level; 6905d4f98a2SYan Zheng node->lowest = 1; 6915d4f98a2SYan Zheng cur = node; 6925d4f98a2SYan Zheng again: 6935d4f98a2SYan Zheng end = 0; 6945d4f98a2SYan Zheng ptr = 0; 6955d4f98a2SYan Zheng key.objectid = cur->bytenr; 6965d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 6975d4f98a2SYan Zheng key.offset = (u64)-1; 6985d4f98a2SYan Zheng 6995d4f98a2SYan Zheng path1->search_commit_root = 1; 7005d4f98a2SYan Zheng path1->skip_locking = 1; 7015d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1, 7025d4f98a2SYan Zheng 0, 0); 7035d4f98a2SYan Zheng if (ret < 0) { 7045d4f98a2SYan Zheng err = ret; 7055d4f98a2SYan Zheng goto out; 7065d4f98a2SYan Zheng } 7075d4f98a2SYan Zheng BUG_ON(!ret || !path1->slots[0]); 7085d4f98a2SYan Zheng 7095d4f98a2SYan Zheng path1->slots[0]--; 7105d4f98a2SYan Zheng 7115d4f98a2SYan Zheng WARN_ON(cur->checked); 7125d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 7135d4f98a2SYan Zheng /* 7145d4f98a2SYan Zheng * the backref was added previously when processsing 7155d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 7165d4f98a2SYan Zheng */ 7175d4f98a2SYan Zheng BUG_ON(!list_is_singular(&cur->upper)); 7185d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 7195d4f98a2SYan Zheng list[LOWER]); 7205d4f98a2SYan Zheng BUG_ON(!list_empty(&edge->list[UPPER])); 7215d4f98a2SYan Zheng exist = edge->node[UPPER]; 7225d4f98a2SYan Zheng /* 7235d4f98a2SYan Zheng * add the upper level block to pending list if we need 7245d4f98a2SYan Zheng * check its backrefs 7255d4f98a2SYan Zheng */ 7265d4f98a2SYan Zheng if (!exist->checked) 7275d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 7285d4f98a2SYan Zheng } else { 7295d4f98a2SYan Zheng exist = NULL; 7305d4f98a2SYan Zheng } 7315d4f98a2SYan Zheng 7325d4f98a2SYan Zheng while (1) { 7335d4f98a2SYan Zheng cond_resched(); 7345d4f98a2SYan Zheng eb = path1->nodes[0]; 7355d4f98a2SYan Zheng 7365d4f98a2SYan Zheng if (ptr >= end) { 7375d4f98a2SYan Zheng if (path1->slots[0] >= btrfs_header_nritems(eb)) { 7385d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path1); 7395d4f98a2SYan Zheng if (ret < 0) { 7405d4f98a2SYan Zheng err = ret; 7415d4f98a2SYan Zheng goto out; 7425d4f98a2SYan Zheng } 7435d4f98a2SYan Zheng if (ret > 0) 7445d4f98a2SYan Zheng break; 7455d4f98a2SYan Zheng eb = path1->nodes[0]; 7465d4f98a2SYan Zheng } 7475d4f98a2SYan Zheng 7485d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path1->slots[0]); 7495d4f98a2SYan Zheng if (key.objectid != cur->bytenr) { 7505d4f98a2SYan Zheng WARN_ON(exist); 7515d4f98a2SYan Zheng break; 7525d4f98a2SYan Zheng } 7535d4f98a2SYan Zheng 7545d4f98a2SYan Zheng if (key.type == BTRFS_EXTENT_ITEM_KEY) { 7555d4f98a2SYan Zheng ret = find_inline_backref(eb, path1->slots[0], 7565d4f98a2SYan Zheng &ptr, &end); 7575d4f98a2SYan Zheng if (ret) 7585d4f98a2SYan Zheng goto next; 7595d4f98a2SYan Zheng } 7605d4f98a2SYan Zheng } 7615d4f98a2SYan Zheng 7625d4f98a2SYan Zheng if (ptr < end) { 7635d4f98a2SYan Zheng /* update key for inline back ref */ 7645d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 7655d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 7665d4f98a2SYan Zheng key.type = btrfs_extent_inline_ref_type(eb, iref); 7675d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 7685d4f98a2SYan Zheng WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY && 7695d4f98a2SYan Zheng key.type != BTRFS_SHARED_BLOCK_REF_KEY); 7705d4f98a2SYan Zheng } 7715d4f98a2SYan Zheng 7725d4f98a2SYan Zheng if (exist && 7735d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 7745d4f98a2SYan Zheng exist->owner == key.offset) || 7755d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 7765d4f98a2SYan Zheng exist->bytenr == key.offset))) { 7775d4f98a2SYan Zheng exist = NULL; 7785d4f98a2SYan Zheng goto next; 7795d4f98a2SYan Zheng } 7805d4f98a2SYan Zheng 7815d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 7825d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY || 7835d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 7843fd0a558SYan, Zheng if (key.type == BTRFS_EXTENT_REF_V0_KEY) { 7855d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 7865d4f98a2SYan Zheng ref0 = btrfs_item_ptr(eb, path1->slots[0], 7875d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 7883fd0a558SYan, Zheng if (key.objectid == key.offset) { 789046f264fSYan, Zheng root = find_tree_root(rc, eb, ref0); 7903fd0a558SYan, Zheng if (root && !should_ignore_root(root)) 7915d4f98a2SYan Zheng cur->root = root; 7925d4f98a2SYan Zheng else 7933fd0a558SYan, Zheng list_add(&cur->list, &useless); 7945d4f98a2SYan Zheng break; 7955d4f98a2SYan Zheng } 796046f264fSYan, Zheng if (is_cowonly_root(btrfs_ref_root_v0(eb, 797046f264fSYan, Zheng ref0))) 798046f264fSYan, Zheng cur->cowonly = 1; 7993fd0a558SYan, Zheng } 8005d4f98a2SYan Zheng #else 8015d4f98a2SYan Zheng BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY); 8025d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 8035d4f98a2SYan Zheng #endif 8045d4f98a2SYan Zheng if (key.objectid == key.offset) { 8055d4f98a2SYan Zheng /* 8065d4f98a2SYan Zheng * only root blocks of reloc trees use 8075d4f98a2SYan Zheng * backref of this type. 8085d4f98a2SYan Zheng */ 8095d4f98a2SYan Zheng root = find_reloc_root(rc, cur->bytenr); 8105d4f98a2SYan Zheng BUG_ON(!root); 8115d4f98a2SYan Zheng cur->root = root; 8125d4f98a2SYan Zheng break; 8135d4f98a2SYan Zheng } 8145d4f98a2SYan Zheng 8153fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 8165d4f98a2SYan Zheng if (!edge) { 8175d4f98a2SYan Zheng err = -ENOMEM; 8185d4f98a2SYan Zheng goto out; 8195d4f98a2SYan Zheng } 8205d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, key.offset); 8215d4f98a2SYan Zheng if (!rb_node) { 8223fd0a558SYan, Zheng upper = alloc_backref_node(cache); 8235d4f98a2SYan Zheng if (!upper) { 8243fd0a558SYan, Zheng free_backref_edge(cache, edge); 8255d4f98a2SYan Zheng err = -ENOMEM; 8265d4f98a2SYan Zheng goto out; 8275d4f98a2SYan Zheng } 8285d4f98a2SYan Zheng upper->bytenr = key.offset; 8295d4f98a2SYan Zheng upper->level = cur->level + 1; 8305d4f98a2SYan Zheng /* 8315d4f98a2SYan Zheng * backrefs for the upper level block isn't 8325d4f98a2SYan Zheng * cached, add the block to pending list 8335d4f98a2SYan Zheng */ 8345d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 8355d4f98a2SYan Zheng } else { 8365d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 8375d4f98a2SYan Zheng rb_node); 8383fd0a558SYan, Zheng BUG_ON(!upper->checked); 8395d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 8405d4f98a2SYan Zheng } 8413fd0a558SYan, Zheng list_add_tail(&edge->list[LOWER], &cur->upper); 8425d4f98a2SYan Zheng edge->node[LOWER] = cur; 8433fd0a558SYan, Zheng edge->node[UPPER] = upper; 8445d4f98a2SYan Zheng 8455d4f98a2SYan Zheng goto next; 8465d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 8475d4f98a2SYan Zheng goto next; 8485d4f98a2SYan Zheng } 8495d4f98a2SYan Zheng 8505d4f98a2SYan Zheng /* key.type == BTRFS_TREE_BLOCK_REF_KEY */ 8515d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, key.offset); 8525d4f98a2SYan Zheng if (IS_ERR(root)) { 8535d4f98a2SYan Zheng err = PTR_ERR(root); 8545d4f98a2SYan Zheng goto out; 8555d4f98a2SYan Zheng } 8565d4f98a2SYan Zheng 8573fd0a558SYan, Zheng if (!root->ref_cows) 8583fd0a558SYan, Zheng cur->cowonly = 1; 8593fd0a558SYan, Zheng 8605d4f98a2SYan Zheng if (btrfs_root_level(&root->root_item) == cur->level) { 8615d4f98a2SYan Zheng /* tree root */ 8625d4f98a2SYan Zheng BUG_ON(btrfs_root_bytenr(&root->root_item) != 8635d4f98a2SYan Zheng cur->bytenr); 8643fd0a558SYan, Zheng if (should_ignore_root(root)) 8653fd0a558SYan, Zheng list_add(&cur->list, &useless); 8663fd0a558SYan, Zheng else 8675d4f98a2SYan Zheng cur->root = root; 8685d4f98a2SYan Zheng break; 8695d4f98a2SYan Zheng } 8705d4f98a2SYan Zheng 8715d4f98a2SYan Zheng level = cur->level + 1; 8725d4f98a2SYan Zheng 8735d4f98a2SYan Zheng /* 8745d4f98a2SYan Zheng * searching the tree to find upper level blocks 8755d4f98a2SYan Zheng * reference the block. 8765d4f98a2SYan Zheng */ 8775d4f98a2SYan Zheng path2->search_commit_root = 1; 8785d4f98a2SYan Zheng path2->skip_locking = 1; 8795d4f98a2SYan Zheng path2->lowest_level = level; 8805d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0); 8815d4f98a2SYan Zheng path2->lowest_level = 0; 8825d4f98a2SYan Zheng if (ret < 0) { 8835d4f98a2SYan Zheng err = ret; 8845d4f98a2SYan Zheng goto out; 8855d4f98a2SYan Zheng } 88633c66f43SYan Zheng if (ret > 0 && path2->slots[level] > 0) 88733c66f43SYan Zheng path2->slots[level]--; 8885d4f98a2SYan Zheng 8895d4f98a2SYan Zheng eb = path2->nodes[level]; 8905d4f98a2SYan Zheng WARN_ON(btrfs_node_blockptr(eb, path2->slots[level]) != 8915d4f98a2SYan Zheng cur->bytenr); 8925d4f98a2SYan Zheng 8935d4f98a2SYan Zheng lower = cur; 8945d4f98a2SYan Zheng for (; level < BTRFS_MAX_LEVEL; level++) { 8955d4f98a2SYan Zheng if (!path2->nodes[level]) { 8965d4f98a2SYan Zheng BUG_ON(btrfs_root_bytenr(&root->root_item) != 8975d4f98a2SYan Zheng lower->bytenr); 8983fd0a558SYan, Zheng if (should_ignore_root(root)) 8993fd0a558SYan, Zheng list_add(&lower->list, &useless); 9003fd0a558SYan, Zheng else 9015d4f98a2SYan Zheng lower->root = root; 9025d4f98a2SYan Zheng break; 9035d4f98a2SYan Zheng } 9045d4f98a2SYan Zheng 9053fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 9065d4f98a2SYan Zheng if (!edge) { 9075d4f98a2SYan Zheng err = -ENOMEM; 9085d4f98a2SYan Zheng goto out; 9095d4f98a2SYan Zheng } 9105d4f98a2SYan Zheng 9115d4f98a2SYan Zheng eb = path2->nodes[level]; 9125d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, eb->start); 9135d4f98a2SYan Zheng if (!rb_node) { 9143fd0a558SYan, Zheng upper = alloc_backref_node(cache); 9155d4f98a2SYan Zheng if (!upper) { 9163fd0a558SYan, Zheng free_backref_edge(cache, edge); 9175d4f98a2SYan Zheng err = -ENOMEM; 9185d4f98a2SYan Zheng goto out; 9195d4f98a2SYan Zheng } 9205d4f98a2SYan Zheng upper->bytenr = eb->start; 9215d4f98a2SYan Zheng upper->owner = btrfs_header_owner(eb); 9225d4f98a2SYan Zheng upper->level = lower->level + 1; 9233fd0a558SYan, Zheng if (!root->ref_cows) 9243fd0a558SYan, Zheng upper->cowonly = 1; 9255d4f98a2SYan Zheng 9265d4f98a2SYan Zheng /* 9275d4f98a2SYan Zheng * if we know the block isn't shared 9285d4f98a2SYan Zheng * we can void checking its backrefs. 9295d4f98a2SYan Zheng */ 9305d4f98a2SYan Zheng if (btrfs_block_can_be_shared(root, eb)) 9315d4f98a2SYan Zheng upper->checked = 0; 9325d4f98a2SYan Zheng else 9335d4f98a2SYan Zheng upper->checked = 1; 9345d4f98a2SYan Zheng 9355d4f98a2SYan Zheng /* 9365d4f98a2SYan Zheng * add the block to pending list if we 9375d4f98a2SYan Zheng * need check its backrefs. only block 9385d4f98a2SYan Zheng * at 'cur->level + 1' is added to the 9395d4f98a2SYan Zheng * tail of pending list. this guarantees 9405d4f98a2SYan Zheng * we check backrefs from lower level 9415d4f98a2SYan Zheng * blocks to upper level blocks. 9425d4f98a2SYan Zheng */ 9435d4f98a2SYan Zheng if (!upper->checked && 9445d4f98a2SYan Zheng level == cur->level + 1) { 9455d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], 9465d4f98a2SYan Zheng &list); 9475d4f98a2SYan Zheng } else 9485d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 9495d4f98a2SYan Zheng } else { 9505d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 9515d4f98a2SYan Zheng rb_node); 9525d4f98a2SYan Zheng BUG_ON(!upper->checked); 9535d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 9543fd0a558SYan, Zheng if (!upper->owner) 9553fd0a558SYan, Zheng upper->owner = btrfs_header_owner(eb); 9565d4f98a2SYan Zheng } 9575d4f98a2SYan Zheng list_add_tail(&edge->list[LOWER], &lower->upper); 9585d4f98a2SYan Zheng edge->node[LOWER] = lower; 9593fd0a558SYan, Zheng edge->node[UPPER] = upper; 9605d4f98a2SYan Zheng 9615d4f98a2SYan Zheng if (rb_node) 9625d4f98a2SYan Zheng break; 9635d4f98a2SYan Zheng lower = upper; 9645d4f98a2SYan Zheng upper = NULL; 9655d4f98a2SYan Zheng } 9665d4f98a2SYan Zheng btrfs_release_path(root, path2); 9675d4f98a2SYan Zheng next: 9685d4f98a2SYan Zheng if (ptr < end) { 9695d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 9705d4f98a2SYan Zheng if (ptr >= end) { 9715d4f98a2SYan Zheng WARN_ON(ptr > end); 9725d4f98a2SYan Zheng ptr = 0; 9735d4f98a2SYan Zheng end = 0; 9745d4f98a2SYan Zheng } 9755d4f98a2SYan Zheng } 9765d4f98a2SYan Zheng if (ptr >= end) 9775d4f98a2SYan Zheng path1->slots[0]++; 9785d4f98a2SYan Zheng } 9795d4f98a2SYan Zheng btrfs_release_path(rc->extent_root, path1); 9805d4f98a2SYan Zheng 9815d4f98a2SYan Zheng cur->checked = 1; 9825d4f98a2SYan Zheng WARN_ON(exist); 9835d4f98a2SYan Zheng 9845d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 9855d4f98a2SYan Zheng if (!list_empty(&list)) { 9865d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 9875d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 9885d4f98a2SYan Zheng cur = edge->node[UPPER]; 9895d4f98a2SYan Zheng goto again; 9905d4f98a2SYan Zheng } 9915d4f98a2SYan Zheng 9925d4f98a2SYan Zheng /* 9935d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 9945d4f98a2SYan Zheng * into the cache. 9955d4f98a2SYan Zheng */ 9965d4f98a2SYan Zheng BUG_ON(!node->checked); 9973fd0a558SYan, Zheng cowonly = node->cowonly; 9983fd0a558SYan, Zheng if (!cowonly) { 9993fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 10003fd0a558SYan, Zheng &node->rb_node); 10015d4f98a2SYan Zheng BUG_ON(rb_node); 10023fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 10033fd0a558SYan, Zheng } 10045d4f98a2SYan Zheng 10055d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 10065d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10075d4f98a2SYan Zheng 10085d4f98a2SYan Zheng while (!list_empty(&list)) { 10095d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10105d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10115d4f98a2SYan Zheng upper = edge->node[UPPER]; 10123fd0a558SYan, Zheng if (upper->detached) { 10133fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10143fd0a558SYan, Zheng lower = edge->node[LOWER]; 10153fd0a558SYan, Zheng free_backref_edge(cache, edge); 10163fd0a558SYan, Zheng if (list_empty(&lower->upper)) 10173fd0a558SYan, Zheng list_add(&lower->list, &useless); 10183fd0a558SYan, Zheng continue; 10193fd0a558SYan, Zheng } 10205d4f98a2SYan Zheng 10215d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 10225d4f98a2SYan Zheng if (upper->lowest) { 10235d4f98a2SYan Zheng list_del_init(&upper->lower); 10245d4f98a2SYan Zheng upper->lowest = 0; 10255d4f98a2SYan Zheng } 10265d4f98a2SYan Zheng 10275d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10285d4f98a2SYan Zheng continue; 10295d4f98a2SYan Zheng } 10305d4f98a2SYan Zheng 10315d4f98a2SYan Zheng BUG_ON(!upper->checked); 10323fd0a558SYan, Zheng BUG_ON(cowonly != upper->cowonly); 10333fd0a558SYan, Zheng if (!cowonly) { 10345d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 10355d4f98a2SYan Zheng &upper->rb_node); 10365d4f98a2SYan Zheng BUG_ON(rb_node); 10373fd0a558SYan, Zheng } 10385d4f98a2SYan Zheng 10395d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10405d4f98a2SYan Zheng 10415d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 10425d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10435d4f98a2SYan Zheng } 10443fd0a558SYan, Zheng /* 10453fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 10463fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 10473fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 10483fd0a558SYan, Zheng * lookup. 10493fd0a558SYan, Zheng */ 10503fd0a558SYan, Zheng while (!list_empty(&useless)) { 10513fd0a558SYan, Zheng upper = list_entry(useless.next, struct backref_node, list); 10523fd0a558SYan, Zheng list_del_init(&upper->list); 10533fd0a558SYan, Zheng BUG_ON(!list_empty(&upper->upper)); 10543fd0a558SYan, Zheng if (upper == node) 10553fd0a558SYan, Zheng node = NULL; 10563fd0a558SYan, Zheng if (upper->lowest) { 10573fd0a558SYan, Zheng list_del_init(&upper->lower); 10583fd0a558SYan, Zheng upper->lowest = 0; 10593fd0a558SYan, Zheng } 10603fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 10613fd0a558SYan, Zheng edge = list_entry(upper->lower.next, 10623fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 10633fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 10643fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10653fd0a558SYan, Zheng lower = edge->node[LOWER]; 10663fd0a558SYan, Zheng free_backref_edge(cache, edge); 10673fd0a558SYan, Zheng 10683fd0a558SYan, Zheng if (list_empty(&lower->upper)) 10693fd0a558SYan, Zheng list_add(&lower->list, &useless); 10703fd0a558SYan, Zheng } 10713fd0a558SYan, Zheng __mark_block_processed(rc, upper); 10723fd0a558SYan, Zheng if (upper->level > 0) { 10733fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 10743fd0a558SYan, Zheng upper->detached = 1; 10753fd0a558SYan, Zheng } else { 10763fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 10773fd0a558SYan, Zheng free_backref_node(cache, upper); 10783fd0a558SYan, Zheng } 10793fd0a558SYan, Zheng } 10805d4f98a2SYan Zheng out: 10815d4f98a2SYan Zheng btrfs_free_path(path1); 10825d4f98a2SYan Zheng btrfs_free_path(path2); 10835d4f98a2SYan Zheng if (err) { 10843fd0a558SYan, Zheng while (!list_empty(&useless)) { 10853fd0a558SYan, Zheng lower = list_entry(useless.next, 10863fd0a558SYan, Zheng struct backref_node, upper); 10873fd0a558SYan, Zheng list_del_init(&lower->upper); 10883fd0a558SYan, Zheng } 10895d4f98a2SYan Zheng upper = node; 10903fd0a558SYan, Zheng INIT_LIST_HEAD(&list); 10915d4f98a2SYan Zheng while (upper) { 10925d4f98a2SYan Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 10935d4f98a2SYan Zheng list_splice_tail(&upper->upper, &list); 10943fd0a558SYan, Zheng free_backref_node(cache, upper); 10955d4f98a2SYan Zheng } 10965d4f98a2SYan Zheng 10975d4f98a2SYan Zheng if (list_empty(&list)) 10985d4f98a2SYan Zheng break; 10995d4f98a2SYan Zheng 11005d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, 11015d4f98a2SYan Zheng list[LOWER]); 11023fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11035d4f98a2SYan Zheng upper = edge->node[UPPER]; 11043fd0a558SYan, Zheng free_backref_edge(cache, edge); 11055d4f98a2SYan Zheng } 11065d4f98a2SYan Zheng return ERR_PTR(err); 11075d4f98a2SYan Zheng } 11083fd0a558SYan, Zheng BUG_ON(node && node->detached); 11095d4f98a2SYan Zheng return node; 11105d4f98a2SYan Zheng } 11115d4f98a2SYan Zheng 11125d4f98a2SYan Zheng /* 11133fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 11143fd0a558SYan, Zheng * the backref node is created by cloning backref node that 11153fd0a558SYan, Zheng * corresponds to root of source tree 11163fd0a558SYan, Zheng */ 11173fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 11183fd0a558SYan, Zheng struct reloc_control *rc, 11193fd0a558SYan, Zheng struct btrfs_root *src, 11203fd0a558SYan, Zheng struct btrfs_root *dest) 11213fd0a558SYan, Zheng { 11223fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 11233fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 11243fd0a558SYan, Zheng struct backref_node *node = NULL; 11253fd0a558SYan, Zheng struct backref_node *new_node; 11263fd0a558SYan, Zheng struct backref_edge *edge; 11273fd0a558SYan, Zheng struct backref_edge *new_edge; 11283fd0a558SYan, Zheng struct rb_node *rb_node; 11293fd0a558SYan, Zheng 11303fd0a558SYan, Zheng if (cache->last_trans > 0) 11313fd0a558SYan, Zheng update_backref_cache(trans, cache); 11323fd0a558SYan, Zheng 11333fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 11343fd0a558SYan, Zheng if (rb_node) { 11353fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 11363fd0a558SYan, Zheng if (node->detached) 11373fd0a558SYan, Zheng node = NULL; 11383fd0a558SYan, Zheng else 11393fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 11403fd0a558SYan, Zheng } 11413fd0a558SYan, Zheng 11423fd0a558SYan, Zheng if (!node) { 11433fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 11443fd0a558SYan, Zheng reloc_root->commit_root->start); 11453fd0a558SYan, Zheng if (rb_node) { 11463fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 11473fd0a558SYan, Zheng rb_node); 11483fd0a558SYan, Zheng BUG_ON(node->detached); 11493fd0a558SYan, Zheng } 11503fd0a558SYan, Zheng } 11513fd0a558SYan, Zheng 11523fd0a558SYan, Zheng if (!node) 11533fd0a558SYan, Zheng return 0; 11543fd0a558SYan, Zheng 11553fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 11563fd0a558SYan, Zheng if (!new_node) 11573fd0a558SYan, Zheng return -ENOMEM; 11583fd0a558SYan, Zheng 11593fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 11603fd0a558SYan, Zheng new_node->level = node->level; 11613fd0a558SYan, Zheng new_node->lowest = node->lowest; 11623fd0a558SYan, Zheng new_node->root = dest; 11633fd0a558SYan, Zheng 11643fd0a558SYan, Zheng if (!node->lowest) { 11653fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 11663fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 11673fd0a558SYan, Zheng if (!new_edge) 11683fd0a558SYan, Zheng goto fail; 11693fd0a558SYan, Zheng 11703fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 11713fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 11723fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 11733fd0a558SYan, Zheng &new_node->lower); 11743fd0a558SYan, Zheng } 11753fd0a558SYan, Zheng } 11763fd0a558SYan, Zheng 11773fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 11783fd0a558SYan, Zheng &new_node->rb_node); 11793fd0a558SYan, Zheng BUG_ON(rb_node); 11803fd0a558SYan, Zheng 11813fd0a558SYan, Zheng if (!new_node->lowest) { 11823fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 11833fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 11843fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 11853fd0a558SYan, Zheng } 11863fd0a558SYan, Zheng } 11873fd0a558SYan, Zheng return 0; 11883fd0a558SYan, Zheng fail: 11893fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 11903fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 11913fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 11923fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 11933fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 11943fd0a558SYan, Zheng } 11953fd0a558SYan, Zheng free_backref_node(cache, new_node); 11963fd0a558SYan, Zheng return -ENOMEM; 11973fd0a558SYan, Zheng } 11983fd0a558SYan, Zheng 11993fd0a558SYan, Zheng /* 12005d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 12015d4f98a2SYan Zheng */ 12025d4f98a2SYan Zheng static int __add_reloc_root(struct btrfs_root *root) 12035d4f98a2SYan Zheng { 12045d4f98a2SYan Zheng struct rb_node *rb_node; 12055d4f98a2SYan Zheng struct mapping_node *node; 12065d4f98a2SYan Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 12075d4f98a2SYan Zheng 12085d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 12095d4f98a2SYan Zheng BUG_ON(!node); 12105d4f98a2SYan Zheng 12115d4f98a2SYan Zheng node->bytenr = root->node->start; 12125d4f98a2SYan Zheng node->data = root; 12135d4f98a2SYan Zheng 12145d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12155d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 12165d4f98a2SYan Zheng node->bytenr, &node->rb_node); 12175d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 12185d4f98a2SYan Zheng BUG_ON(rb_node); 12195d4f98a2SYan Zheng 12205d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 12215d4f98a2SYan Zheng return 0; 12225d4f98a2SYan Zheng } 12235d4f98a2SYan Zheng 12245d4f98a2SYan Zheng /* 12255d4f98a2SYan Zheng * helper to update/delete the 'address of tree root -> reloc tree' 12265d4f98a2SYan Zheng * mapping 12275d4f98a2SYan Zheng */ 12285d4f98a2SYan Zheng static int __update_reloc_root(struct btrfs_root *root, int del) 12295d4f98a2SYan Zheng { 12305d4f98a2SYan Zheng struct rb_node *rb_node; 12315d4f98a2SYan Zheng struct mapping_node *node = NULL; 12325d4f98a2SYan Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 12335d4f98a2SYan Zheng 12345d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12355d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 12365d4f98a2SYan Zheng root->commit_root->start); 12375d4f98a2SYan Zheng if (rb_node) { 12385d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 12395d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 12405d4f98a2SYan Zheng } 12415d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 12425d4f98a2SYan Zheng 12435d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 12445d4f98a2SYan Zheng 12455d4f98a2SYan Zheng if (!del) { 12465d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12475d4f98a2SYan Zheng node->bytenr = root->node->start; 12485d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 12495d4f98a2SYan Zheng node->bytenr, &node->rb_node); 12505d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 12515d4f98a2SYan Zheng BUG_ON(rb_node); 12525d4f98a2SYan Zheng } else { 12535d4f98a2SYan Zheng list_del_init(&root->root_list); 12545d4f98a2SYan Zheng kfree(node); 12555d4f98a2SYan Zheng } 12565d4f98a2SYan Zheng return 0; 12575d4f98a2SYan Zheng } 12585d4f98a2SYan Zheng 12593fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 12603fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 12615d4f98a2SYan Zheng { 12625d4f98a2SYan Zheng struct btrfs_root *reloc_root; 12635d4f98a2SYan Zheng struct extent_buffer *eb; 12645d4f98a2SYan Zheng struct btrfs_root_item *root_item; 12655d4f98a2SYan Zheng struct btrfs_key root_key; 12665d4f98a2SYan Zheng int ret; 12675d4f98a2SYan Zheng 12685d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 12695d4f98a2SYan Zheng BUG_ON(!root_item); 12705d4f98a2SYan Zheng 12715d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 12725d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 12733fd0a558SYan, Zheng root_key.offset = objectid; 12745d4f98a2SYan Zheng 12753fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 12763fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 12775d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 12785d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 12795d4f98a2SYan Zheng BUG_ON(ret); 12805d4f98a2SYan Zheng 12813fd0a558SYan, Zheng btrfs_set_root_last_snapshot(&root->root_item, 12823fd0a558SYan, Zheng trans->transid - 1); 12833fd0a558SYan, Zheng } else { 12843fd0a558SYan, Zheng /* 12853fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 12863fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 12873fd0a558SYan, Zheng * modified after it was created have RELOC flag 12883fd0a558SYan, Zheng * set in their headers. so it's OK to not update 12893fd0a558SYan, Zheng * the 'last_snapshot'. 12903fd0a558SYan, Zheng */ 12913fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 12923fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 12933fd0a558SYan, Zheng BUG_ON(ret); 12943fd0a558SYan, Zheng } 12953fd0a558SYan, Zheng 12965d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 12975d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 12985d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 12995d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 13003fd0a558SYan, Zheng 13013fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 13023fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 13033fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 13043fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 13055d4f98a2SYan Zheng root_item->drop_level = 0; 13063fd0a558SYan, Zheng } 13075d4f98a2SYan Zheng 13085d4f98a2SYan Zheng btrfs_tree_unlock(eb); 13095d4f98a2SYan Zheng free_extent_buffer(eb); 13105d4f98a2SYan Zheng 13115d4f98a2SYan Zheng ret = btrfs_insert_root(trans, root->fs_info->tree_root, 13125d4f98a2SYan Zheng &root_key, root_item); 13135d4f98a2SYan Zheng BUG_ON(ret); 13145d4f98a2SYan Zheng kfree(root_item); 13155d4f98a2SYan Zheng 13165d4f98a2SYan Zheng reloc_root = btrfs_read_fs_root_no_radix(root->fs_info->tree_root, 13175d4f98a2SYan Zheng &root_key); 13185d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 13195d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 13203fd0a558SYan, Zheng return reloc_root; 13213fd0a558SYan, Zheng } 13223fd0a558SYan, Zheng 13233fd0a558SYan, Zheng /* 13243fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 13253fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 13263fd0a558SYan, Zheng */ 13273fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 13283fd0a558SYan, Zheng struct btrfs_root *root) 13293fd0a558SYan, Zheng { 13303fd0a558SYan, Zheng struct btrfs_root *reloc_root; 13313fd0a558SYan, Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 13323fd0a558SYan, Zheng int clear_rsv = 0; 13333fd0a558SYan, Zheng 13343fd0a558SYan, Zheng if (root->reloc_root) { 13353fd0a558SYan, Zheng reloc_root = root->reloc_root; 13363fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 13373fd0a558SYan, Zheng return 0; 13383fd0a558SYan, Zheng } 13393fd0a558SYan, Zheng 13403fd0a558SYan, Zheng if (!rc || !rc->create_reloc_tree || 13413fd0a558SYan, Zheng root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 13423fd0a558SYan, Zheng return 0; 13433fd0a558SYan, Zheng 13443fd0a558SYan, Zheng if (!trans->block_rsv) { 13453fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 13463fd0a558SYan, Zheng clear_rsv = 1; 13473fd0a558SYan, Zheng } 13483fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 13493fd0a558SYan, Zheng if (clear_rsv) 13503fd0a558SYan, Zheng trans->block_rsv = NULL; 13515d4f98a2SYan Zheng 13525d4f98a2SYan Zheng __add_reloc_root(reloc_root); 13535d4f98a2SYan Zheng root->reloc_root = reloc_root; 13545d4f98a2SYan Zheng return 0; 13555d4f98a2SYan Zheng } 13565d4f98a2SYan Zheng 13575d4f98a2SYan Zheng /* 13585d4f98a2SYan Zheng * update root item of reloc tree 13595d4f98a2SYan Zheng */ 13605d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 13615d4f98a2SYan Zheng struct btrfs_root *root) 13625d4f98a2SYan Zheng { 13635d4f98a2SYan Zheng struct btrfs_root *reloc_root; 13645d4f98a2SYan Zheng struct btrfs_root_item *root_item; 13655d4f98a2SYan Zheng int del = 0; 13665d4f98a2SYan Zheng int ret; 13675d4f98a2SYan Zheng 13685d4f98a2SYan Zheng if (!root->reloc_root) 13695d4f98a2SYan Zheng return 0; 13705d4f98a2SYan Zheng 13715d4f98a2SYan Zheng reloc_root = root->reloc_root; 13725d4f98a2SYan Zheng root_item = &reloc_root->root_item; 13735d4f98a2SYan Zheng 13743fd0a558SYan, Zheng if (root->fs_info->reloc_ctl->merge_reloc_tree && 13753fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 13765d4f98a2SYan Zheng root->reloc_root = NULL; 13775d4f98a2SYan Zheng del = 1; 13785d4f98a2SYan Zheng } 13795d4f98a2SYan Zheng 13805d4f98a2SYan Zheng __update_reloc_root(reloc_root, del); 13815d4f98a2SYan Zheng 13825d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 13835d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 13845d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 13855d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 13865d4f98a2SYan Zheng } 13875d4f98a2SYan Zheng 13885d4f98a2SYan Zheng ret = btrfs_update_root(trans, root->fs_info->tree_root, 13895d4f98a2SYan Zheng &reloc_root->root_key, root_item); 13905d4f98a2SYan Zheng BUG_ON(ret); 13915d4f98a2SYan Zheng return 0; 13925d4f98a2SYan Zheng } 13935d4f98a2SYan Zheng 13945d4f98a2SYan Zheng /* 13955d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 13965d4f98a2SYan Zheng * in a subvolume 13975d4f98a2SYan Zheng */ 13985d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 13995d4f98a2SYan Zheng { 14005d4f98a2SYan Zheng struct rb_node *node; 14015d4f98a2SYan Zheng struct rb_node *prev; 14025d4f98a2SYan Zheng struct btrfs_inode *entry; 14035d4f98a2SYan Zheng struct inode *inode; 14045d4f98a2SYan Zheng 14055d4f98a2SYan Zheng spin_lock(&root->inode_lock); 14065d4f98a2SYan Zheng again: 14075d4f98a2SYan Zheng node = root->inode_tree.rb_node; 14085d4f98a2SYan Zheng prev = NULL; 14095d4f98a2SYan Zheng while (node) { 14105d4f98a2SYan Zheng prev = node; 14115d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 14125d4f98a2SYan Zheng 14135d4f98a2SYan Zheng if (objectid < entry->vfs_inode.i_ino) 14145d4f98a2SYan Zheng node = node->rb_left; 14155d4f98a2SYan Zheng else if (objectid > entry->vfs_inode.i_ino) 14165d4f98a2SYan Zheng node = node->rb_right; 14175d4f98a2SYan Zheng else 14185d4f98a2SYan Zheng break; 14195d4f98a2SYan Zheng } 14205d4f98a2SYan Zheng if (!node) { 14215d4f98a2SYan Zheng while (prev) { 14225d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 14235d4f98a2SYan Zheng if (objectid <= entry->vfs_inode.i_ino) { 14245d4f98a2SYan Zheng node = prev; 14255d4f98a2SYan Zheng break; 14265d4f98a2SYan Zheng } 14275d4f98a2SYan Zheng prev = rb_next(prev); 14285d4f98a2SYan Zheng } 14295d4f98a2SYan Zheng } 14305d4f98a2SYan Zheng while (node) { 14315d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 14325d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 14335d4f98a2SYan Zheng if (inode) { 14345d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 14355d4f98a2SYan Zheng return inode; 14365d4f98a2SYan Zheng } 14375d4f98a2SYan Zheng 14385d4f98a2SYan Zheng objectid = entry->vfs_inode.i_ino + 1; 14395d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 14405d4f98a2SYan Zheng goto again; 14415d4f98a2SYan Zheng 14425d4f98a2SYan Zheng node = rb_next(node); 14435d4f98a2SYan Zheng } 14445d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 14455d4f98a2SYan Zheng return NULL; 14465d4f98a2SYan Zheng } 14475d4f98a2SYan Zheng 14485d4f98a2SYan Zheng static int in_block_group(u64 bytenr, 14495d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group) 14505d4f98a2SYan Zheng { 14515d4f98a2SYan Zheng if (bytenr >= block_group->key.objectid && 14525d4f98a2SYan Zheng bytenr < block_group->key.objectid + block_group->key.offset) 14535d4f98a2SYan Zheng return 1; 14545d4f98a2SYan Zheng return 0; 14555d4f98a2SYan Zheng } 14565d4f98a2SYan Zheng 14575d4f98a2SYan Zheng /* 14585d4f98a2SYan Zheng * get new location of data 14595d4f98a2SYan Zheng */ 14605d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 14615d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 14625d4f98a2SYan Zheng { 14635d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 14645d4f98a2SYan Zheng struct btrfs_path *path; 14655d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 14665d4f98a2SYan Zheng struct extent_buffer *leaf; 14675d4f98a2SYan Zheng int ret; 14685d4f98a2SYan Zheng 14695d4f98a2SYan Zheng path = btrfs_alloc_path(); 14705d4f98a2SYan Zheng if (!path) 14715d4f98a2SYan Zheng return -ENOMEM; 14725d4f98a2SYan Zheng 14735d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 14745d4f98a2SYan Zheng ret = btrfs_lookup_file_extent(NULL, root, path, reloc_inode->i_ino, 14755d4f98a2SYan Zheng bytenr, 0); 14765d4f98a2SYan Zheng if (ret < 0) 14775d4f98a2SYan Zheng goto out; 14785d4f98a2SYan Zheng if (ret > 0) { 14795d4f98a2SYan Zheng ret = -ENOENT; 14805d4f98a2SYan Zheng goto out; 14815d4f98a2SYan Zheng } 14825d4f98a2SYan Zheng 14835d4f98a2SYan Zheng leaf = path->nodes[0]; 14845d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 14855d4f98a2SYan Zheng struct btrfs_file_extent_item); 14865d4f98a2SYan Zheng 14875d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 14885d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 14895d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 14905d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 14915d4f98a2SYan Zheng 14925d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 14935d4f98a2SYan Zheng ret = 1; 14945d4f98a2SYan Zheng goto out; 14955d4f98a2SYan Zheng } 14965d4f98a2SYan Zheng 14975d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 14985d4f98a2SYan Zheng ret = 0; 14995d4f98a2SYan Zheng out: 15005d4f98a2SYan Zheng btrfs_free_path(path); 15015d4f98a2SYan Zheng return ret; 15025d4f98a2SYan Zheng } 15035d4f98a2SYan Zheng 15045d4f98a2SYan Zheng /* 15055d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 15065d4f98a2SYan Zheng * the new locations. 15075d4f98a2SYan Zheng */ 15083fd0a558SYan, Zheng static noinline_for_stack 15093fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 15105d4f98a2SYan Zheng struct reloc_control *rc, 15115d4f98a2SYan Zheng struct btrfs_root *root, 15123fd0a558SYan, Zheng struct extent_buffer *leaf) 15135d4f98a2SYan Zheng { 15145d4f98a2SYan Zheng struct btrfs_key key; 15155d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 15165d4f98a2SYan Zheng struct inode *inode = NULL; 15175d4f98a2SYan Zheng u64 parent; 15185d4f98a2SYan Zheng u64 bytenr; 15193fd0a558SYan, Zheng u64 new_bytenr = 0; 15205d4f98a2SYan Zheng u64 num_bytes; 15215d4f98a2SYan Zheng u64 end; 15225d4f98a2SYan Zheng u32 nritems; 15235d4f98a2SYan Zheng u32 i; 15245d4f98a2SYan Zheng int ret; 15255d4f98a2SYan Zheng int first = 1; 15265d4f98a2SYan Zheng int dirty = 0; 15275d4f98a2SYan Zheng 15285d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 15295d4f98a2SYan Zheng return 0; 15305d4f98a2SYan Zheng 15315d4f98a2SYan Zheng /* reloc trees always use full backref */ 15325d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 15335d4f98a2SYan Zheng parent = leaf->start; 15345d4f98a2SYan Zheng else 15355d4f98a2SYan Zheng parent = 0; 15365d4f98a2SYan Zheng 15375d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 15385d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 15395d4f98a2SYan Zheng cond_resched(); 15405d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 15415d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 15425d4f98a2SYan Zheng continue; 15435d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 15445d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 15455d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 15465d4f98a2SYan Zheng continue; 15475d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 15485d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 15495d4f98a2SYan Zheng if (bytenr == 0) 15505d4f98a2SYan Zheng continue; 15515d4f98a2SYan Zheng if (!in_block_group(bytenr, rc->block_group)) 15525d4f98a2SYan Zheng continue; 15535d4f98a2SYan Zheng 15545d4f98a2SYan Zheng /* 15555d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 15565d4f98a2SYan Zheng * to complete and drop the extent cache 15575d4f98a2SYan Zheng */ 15585d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 15595d4f98a2SYan Zheng if (first) { 15605d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 15615d4f98a2SYan Zheng first = 0; 15625d4f98a2SYan Zheng } else if (inode && inode->i_ino < key.objectid) { 15633fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 15645d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 15655d4f98a2SYan Zheng } 15665d4f98a2SYan Zheng if (inode && inode->i_ino == key.objectid) { 15675d4f98a2SYan Zheng end = key.offset + 15685d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 15695d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 15705d4f98a2SYan Zheng root->sectorsize)); 15715d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(end, root->sectorsize)); 15725d4f98a2SYan Zheng end--; 15735d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 15745d4f98a2SYan Zheng key.offset, end, 15755d4f98a2SYan Zheng GFP_NOFS); 15765d4f98a2SYan Zheng if (!ret) 15775d4f98a2SYan Zheng continue; 15785d4f98a2SYan Zheng 15795d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, key.offset, end, 15805d4f98a2SYan Zheng 1); 15815d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 15825d4f98a2SYan Zheng key.offset, end, GFP_NOFS); 15835d4f98a2SYan Zheng } 15845d4f98a2SYan Zheng } 15855d4f98a2SYan Zheng 15865d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 15875d4f98a2SYan Zheng bytenr, num_bytes); 15883fd0a558SYan, Zheng if (ret > 0) { 15893fd0a558SYan, Zheng WARN_ON(1); 15905d4f98a2SYan Zheng continue; 15913fd0a558SYan, Zheng } 15925d4f98a2SYan Zheng BUG_ON(ret < 0); 15935d4f98a2SYan Zheng 15945d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 15955d4f98a2SYan Zheng dirty = 1; 15965d4f98a2SYan Zheng 15975d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 15985d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, root, new_bytenr, 15995d4f98a2SYan Zheng num_bytes, parent, 16005d4f98a2SYan Zheng btrfs_header_owner(leaf), 16015d4f98a2SYan Zheng key.objectid, key.offset); 16025d4f98a2SYan Zheng BUG_ON(ret); 16035d4f98a2SYan Zheng 16045d4f98a2SYan Zheng ret = btrfs_free_extent(trans, root, bytenr, num_bytes, 16055d4f98a2SYan Zheng parent, btrfs_header_owner(leaf), 16065d4f98a2SYan Zheng key.objectid, key.offset); 16075d4f98a2SYan Zheng BUG_ON(ret); 16085d4f98a2SYan Zheng } 16095d4f98a2SYan Zheng if (dirty) 16105d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 16113fd0a558SYan, Zheng if (inode) 16123fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 16135d4f98a2SYan Zheng return 0; 16145d4f98a2SYan Zheng } 16155d4f98a2SYan Zheng 16165d4f98a2SYan Zheng static noinline_for_stack 16175d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 16185d4f98a2SYan Zheng struct btrfs_path *path, int level) 16195d4f98a2SYan Zheng { 16205d4f98a2SYan Zheng struct btrfs_disk_key key1; 16215d4f98a2SYan Zheng struct btrfs_disk_key key2; 16225d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 16235d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 16245d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 16255d4f98a2SYan Zheng } 16265d4f98a2SYan Zheng 16275d4f98a2SYan Zheng /* 16285d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 16295d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 16305d4f98a2SYan Zheng * reloc tree was create can be replaced. 16315d4f98a2SYan Zheng * 16325d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 16335d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 16345d4f98a2SYan Zheng * errors, a negative error number is returned. 16355d4f98a2SYan Zheng */ 16363fd0a558SYan, Zheng static noinline_for_stack 16373fd0a558SYan, Zheng int replace_path(struct btrfs_trans_handle *trans, 16385d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 16395d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 16405d4f98a2SYan Zheng int lowest_level, int max_level) 16415d4f98a2SYan Zheng { 16425d4f98a2SYan Zheng struct extent_buffer *eb; 16435d4f98a2SYan Zheng struct extent_buffer *parent; 16445d4f98a2SYan Zheng struct btrfs_key key; 16455d4f98a2SYan Zheng u64 old_bytenr; 16465d4f98a2SYan Zheng u64 new_bytenr; 16475d4f98a2SYan Zheng u64 old_ptr_gen; 16485d4f98a2SYan Zheng u64 new_ptr_gen; 16495d4f98a2SYan Zheng u64 last_snapshot; 16505d4f98a2SYan Zheng u32 blocksize; 16513fd0a558SYan, Zheng int cow = 0; 16525d4f98a2SYan Zheng int level; 16535d4f98a2SYan Zheng int ret; 16545d4f98a2SYan Zheng int slot; 16555d4f98a2SYan Zheng 16565d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 16575d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 16585d4f98a2SYan Zheng 16595d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 16603fd0a558SYan, Zheng again: 16615d4f98a2SYan Zheng slot = path->slots[lowest_level]; 16625d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 16635d4f98a2SYan Zheng 16645d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 16655d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 16665d4f98a2SYan Zheng level = btrfs_header_level(eb); 16675d4f98a2SYan Zheng 16685d4f98a2SYan Zheng if (level < lowest_level) { 16695d4f98a2SYan Zheng btrfs_tree_unlock(eb); 16705d4f98a2SYan Zheng free_extent_buffer(eb); 16715d4f98a2SYan Zheng return 0; 16725d4f98a2SYan Zheng } 16735d4f98a2SYan Zheng 16743fd0a558SYan, Zheng if (cow) { 16755d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 16765d4f98a2SYan Zheng BUG_ON(ret); 16773fd0a558SYan, Zheng } 16785d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 16795d4f98a2SYan Zheng 16805d4f98a2SYan Zheng if (next_key) { 16815d4f98a2SYan Zheng next_key->objectid = (u64)-1; 16825d4f98a2SYan Zheng next_key->type = (u8)-1; 16835d4f98a2SYan Zheng next_key->offset = (u64)-1; 16845d4f98a2SYan Zheng } 16855d4f98a2SYan Zheng 16865d4f98a2SYan Zheng parent = eb; 16875d4f98a2SYan Zheng while (1) { 16885d4f98a2SYan Zheng level = btrfs_header_level(parent); 16895d4f98a2SYan Zheng BUG_ON(level < lowest_level); 16905d4f98a2SYan Zheng 16915d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 16925d4f98a2SYan Zheng if (ret && slot > 0) 16935d4f98a2SYan Zheng slot--; 16945d4f98a2SYan Zheng 16955d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 16965d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 16975d4f98a2SYan Zheng 16985d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 16995d4f98a2SYan Zheng blocksize = btrfs_level_size(dest, level - 1); 17005d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 17015d4f98a2SYan Zheng 17025d4f98a2SYan Zheng if (level <= max_level) { 17035d4f98a2SYan Zheng eb = path->nodes[level]; 17045d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 17055d4f98a2SYan Zheng path->slots[level]); 17065d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 17075d4f98a2SYan Zheng path->slots[level]); 17085d4f98a2SYan Zheng } else { 17095d4f98a2SYan Zheng new_bytenr = 0; 17105d4f98a2SYan Zheng new_ptr_gen = 0; 17115d4f98a2SYan Zheng } 17125d4f98a2SYan Zheng 17135d4f98a2SYan Zheng if (new_bytenr > 0 && new_bytenr == old_bytenr) { 17145d4f98a2SYan Zheng WARN_ON(1); 17155d4f98a2SYan Zheng ret = level; 17165d4f98a2SYan Zheng break; 17175d4f98a2SYan Zheng } 17185d4f98a2SYan Zheng 17195d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 17205d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 17213fd0a558SYan, Zheng if (level <= lowest_level) { 17225d4f98a2SYan Zheng ret = 0; 17235d4f98a2SYan Zheng break; 17245d4f98a2SYan Zheng } 17255d4f98a2SYan Zheng 17265d4f98a2SYan Zheng eb = read_tree_block(dest, old_bytenr, blocksize, 17275d4f98a2SYan Zheng old_ptr_gen); 17285d4f98a2SYan Zheng btrfs_tree_lock(eb); 17293fd0a558SYan, Zheng if (cow) { 17305d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 17315d4f98a2SYan Zheng slot, &eb); 17325d4f98a2SYan Zheng BUG_ON(ret); 17335d4f98a2SYan Zheng } 17343fd0a558SYan, Zheng btrfs_set_lock_blocking(eb); 17355d4f98a2SYan Zheng 17365d4f98a2SYan Zheng btrfs_tree_unlock(parent); 17375d4f98a2SYan Zheng free_extent_buffer(parent); 17385d4f98a2SYan Zheng 17395d4f98a2SYan Zheng parent = eb; 17405d4f98a2SYan Zheng continue; 17415d4f98a2SYan Zheng } 17425d4f98a2SYan Zheng 17433fd0a558SYan, Zheng if (!cow) { 17443fd0a558SYan, Zheng btrfs_tree_unlock(parent); 17453fd0a558SYan, Zheng free_extent_buffer(parent); 17463fd0a558SYan, Zheng cow = 1; 17473fd0a558SYan, Zheng goto again; 17483fd0a558SYan, Zheng } 17493fd0a558SYan, Zheng 17505d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 17515d4f98a2SYan Zheng path->slots[level]); 17525d4f98a2SYan Zheng btrfs_release_path(src, path); 17535d4f98a2SYan Zheng 17545d4f98a2SYan Zheng path->lowest_level = level; 17555d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 17565d4f98a2SYan Zheng path->lowest_level = 0; 17575d4f98a2SYan Zheng BUG_ON(ret); 17585d4f98a2SYan Zheng 17595d4f98a2SYan Zheng /* 17605d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 17615d4f98a2SYan Zheng */ 17625d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 17635d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 17645d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 17655d4f98a2SYan Zheng 17665d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 17675d4f98a2SYan Zheng path->slots[level], old_bytenr); 17685d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 17695d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 17705d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 17715d4f98a2SYan Zheng 17725d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, src, old_bytenr, blocksize, 17735d4f98a2SYan Zheng path->nodes[level]->start, 17745d4f98a2SYan Zheng src->root_key.objectid, level - 1, 0); 17755d4f98a2SYan Zheng BUG_ON(ret); 17765d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, dest, new_bytenr, blocksize, 17775d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 17785d4f98a2SYan Zheng 0); 17795d4f98a2SYan Zheng BUG_ON(ret); 17805d4f98a2SYan Zheng 17815d4f98a2SYan Zheng ret = btrfs_free_extent(trans, src, new_bytenr, blocksize, 17825d4f98a2SYan Zheng path->nodes[level]->start, 17835d4f98a2SYan Zheng src->root_key.objectid, level - 1, 0); 17845d4f98a2SYan Zheng BUG_ON(ret); 17855d4f98a2SYan Zheng 17865d4f98a2SYan Zheng ret = btrfs_free_extent(trans, dest, old_bytenr, blocksize, 17875d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 17885d4f98a2SYan Zheng 0); 17895d4f98a2SYan Zheng BUG_ON(ret); 17905d4f98a2SYan Zheng 17915d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 17925d4f98a2SYan Zheng 17935d4f98a2SYan Zheng ret = level; 17945d4f98a2SYan Zheng break; 17955d4f98a2SYan Zheng } 17965d4f98a2SYan Zheng btrfs_tree_unlock(parent); 17975d4f98a2SYan Zheng free_extent_buffer(parent); 17985d4f98a2SYan Zheng return ret; 17995d4f98a2SYan Zheng } 18005d4f98a2SYan Zheng 18015d4f98a2SYan Zheng /* 18025d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 18035d4f98a2SYan Zheng */ 18045d4f98a2SYan Zheng static noinline_for_stack 18055d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 18065d4f98a2SYan Zheng int *level) 18075d4f98a2SYan Zheng { 18085d4f98a2SYan Zheng struct extent_buffer *eb; 18095d4f98a2SYan Zheng int i; 18105d4f98a2SYan Zheng u64 last_snapshot; 18115d4f98a2SYan Zheng u32 nritems; 18125d4f98a2SYan Zheng 18135d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 18145d4f98a2SYan Zheng 18155d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 18165d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 18175d4f98a2SYan Zheng path->nodes[i] = NULL; 18185d4f98a2SYan Zheng } 18195d4f98a2SYan Zheng 18205d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 18215d4f98a2SYan Zheng eb = path->nodes[i]; 18225d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 18235d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 18245d4f98a2SYan Zheng path->slots[i]++; 18255d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 18265d4f98a2SYan Zheng last_snapshot) 18275d4f98a2SYan Zheng continue; 18285d4f98a2SYan Zheng 18295d4f98a2SYan Zheng *level = i; 18305d4f98a2SYan Zheng return 0; 18315d4f98a2SYan Zheng } 18325d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 18335d4f98a2SYan Zheng path->nodes[i] = NULL; 18345d4f98a2SYan Zheng } 18355d4f98a2SYan Zheng return 1; 18365d4f98a2SYan Zheng } 18375d4f98a2SYan Zheng 18385d4f98a2SYan Zheng /* 18395d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 18405d4f98a2SYan Zheng */ 18415d4f98a2SYan Zheng static noinline_for_stack 18425d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 18435d4f98a2SYan Zheng int *level) 18445d4f98a2SYan Zheng { 18455d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 18465d4f98a2SYan Zheng int i; 18475d4f98a2SYan Zheng u64 bytenr; 18485d4f98a2SYan Zheng u64 ptr_gen = 0; 18495d4f98a2SYan Zheng u64 last_snapshot; 18505d4f98a2SYan Zheng u32 blocksize; 18515d4f98a2SYan Zheng u32 nritems; 18525d4f98a2SYan Zheng 18535d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 18545d4f98a2SYan Zheng 18555d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 18565d4f98a2SYan Zheng eb = path->nodes[i]; 18575d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 18585d4f98a2SYan Zheng while (path->slots[i] < nritems) { 18595d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 18605d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 18615d4f98a2SYan Zheng break; 18625d4f98a2SYan Zheng path->slots[i]++; 18635d4f98a2SYan Zheng } 18645d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 18655d4f98a2SYan Zheng if (i == *level) 18665d4f98a2SYan Zheng break; 18675d4f98a2SYan Zheng *level = i + 1; 18685d4f98a2SYan Zheng return 0; 18695d4f98a2SYan Zheng } 18705d4f98a2SYan Zheng if (i == 1) { 18715d4f98a2SYan Zheng *level = i; 18725d4f98a2SYan Zheng return 0; 18735d4f98a2SYan Zheng } 18745d4f98a2SYan Zheng 18755d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 18765d4f98a2SYan Zheng blocksize = btrfs_level_size(root, i - 1); 18775d4f98a2SYan Zheng eb = read_tree_block(root, bytenr, blocksize, ptr_gen); 18785d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 18795d4f98a2SYan Zheng path->nodes[i - 1] = eb; 18805d4f98a2SYan Zheng path->slots[i - 1] = 0; 18815d4f98a2SYan Zheng } 18825d4f98a2SYan Zheng return 1; 18835d4f98a2SYan Zheng } 18845d4f98a2SYan Zheng 18855d4f98a2SYan Zheng /* 18865d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 18875d4f98a2SYan Zheng * [min_key, max_key) 18885d4f98a2SYan Zheng */ 18895d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 18905d4f98a2SYan Zheng struct btrfs_key *min_key, 18915d4f98a2SYan Zheng struct btrfs_key *max_key) 18925d4f98a2SYan Zheng { 18935d4f98a2SYan Zheng struct inode *inode = NULL; 18945d4f98a2SYan Zheng u64 objectid; 18955d4f98a2SYan Zheng u64 start, end; 18965d4f98a2SYan Zheng 18975d4f98a2SYan Zheng objectid = min_key->objectid; 18985d4f98a2SYan Zheng while (1) { 18995d4f98a2SYan Zheng cond_resched(); 19005d4f98a2SYan Zheng iput(inode); 19015d4f98a2SYan Zheng 19025d4f98a2SYan Zheng if (objectid > max_key->objectid) 19035d4f98a2SYan Zheng break; 19045d4f98a2SYan Zheng 19055d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 19065d4f98a2SYan Zheng if (!inode) 19075d4f98a2SYan Zheng break; 19085d4f98a2SYan Zheng 19095d4f98a2SYan Zheng if (inode->i_ino > max_key->objectid) { 19105d4f98a2SYan Zheng iput(inode); 19115d4f98a2SYan Zheng break; 19125d4f98a2SYan Zheng } 19135d4f98a2SYan Zheng 19145d4f98a2SYan Zheng objectid = inode->i_ino + 1; 19155d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 19165d4f98a2SYan Zheng continue; 19175d4f98a2SYan Zheng 19185d4f98a2SYan Zheng if (unlikely(min_key->objectid == inode->i_ino)) { 19195d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 19205d4f98a2SYan Zheng continue; 19215d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 19225d4f98a2SYan Zheng start = 0; 19235d4f98a2SYan Zheng else { 19245d4f98a2SYan Zheng start = min_key->offset; 19255d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(start, root->sectorsize)); 19265d4f98a2SYan Zheng } 19275d4f98a2SYan Zheng } else { 19285d4f98a2SYan Zheng start = 0; 19295d4f98a2SYan Zheng } 19305d4f98a2SYan Zheng 19315d4f98a2SYan Zheng if (unlikely(max_key->objectid == inode->i_ino)) { 19325d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 19335d4f98a2SYan Zheng continue; 19345d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 19355d4f98a2SYan Zheng end = (u64)-1; 19365d4f98a2SYan Zheng } else { 19375d4f98a2SYan Zheng if (max_key->offset == 0) 19385d4f98a2SYan Zheng continue; 19395d4f98a2SYan Zheng end = max_key->offset; 19405d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(end, root->sectorsize)); 19415d4f98a2SYan Zheng end--; 19425d4f98a2SYan Zheng } 19435d4f98a2SYan Zheng } else { 19445d4f98a2SYan Zheng end = (u64)-1; 19455d4f98a2SYan Zheng } 19465d4f98a2SYan Zheng 19475d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 19485d4f98a2SYan Zheng lock_extent(&BTRFS_I(inode)->io_tree, start, end, GFP_NOFS); 19495d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, start, end, 1); 19505d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, start, end, GFP_NOFS); 19515d4f98a2SYan Zheng } 19525d4f98a2SYan Zheng return 0; 19535d4f98a2SYan Zheng } 19545d4f98a2SYan Zheng 19555d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 19565d4f98a2SYan Zheng struct btrfs_key *key) 19575d4f98a2SYan Zheng 19585d4f98a2SYan Zheng { 19595d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 19605d4f98a2SYan Zheng if (!path->nodes[level]) 19615d4f98a2SYan Zheng break; 19625d4f98a2SYan Zheng if (path->slots[level] + 1 < 19635d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 19645d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 19655d4f98a2SYan Zheng path->slots[level] + 1); 19665d4f98a2SYan Zheng return 0; 19675d4f98a2SYan Zheng } 19685d4f98a2SYan Zheng level++; 19695d4f98a2SYan Zheng } 19705d4f98a2SYan Zheng return 1; 19715d4f98a2SYan Zheng } 19725d4f98a2SYan Zheng 19735d4f98a2SYan Zheng /* 19745d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 19755d4f98a2SYan Zheng * fs tree. 19765d4f98a2SYan Zheng */ 19775d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 19785d4f98a2SYan Zheng struct btrfs_root *root) 19795d4f98a2SYan Zheng { 19805d4f98a2SYan Zheng LIST_HEAD(inode_list); 19815d4f98a2SYan Zheng struct btrfs_key key; 19825d4f98a2SYan Zheng struct btrfs_key next_key; 19835d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 19845d4f98a2SYan Zheng struct btrfs_root *reloc_root; 19855d4f98a2SYan Zheng struct btrfs_root_item *root_item; 19865d4f98a2SYan Zheng struct btrfs_path *path; 19873fd0a558SYan, Zheng struct extent_buffer *leaf; 19885d4f98a2SYan Zheng unsigned long nr; 19895d4f98a2SYan Zheng int level; 19905d4f98a2SYan Zheng int max_level; 19915d4f98a2SYan Zheng int replaced = 0; 19925d4f98a2SYan Zheng int ret; 19935d4f98a2SYan Zheng int err = 0; 19943fd0a558SYan, Zheng u32 min_reserved; 19955d4f98a2SYan Zheng 19965d4f98a2SYan Zheng path = btrfs_alloc_path(); 19975d4f98a2SYan Zheng if (!path) 19985d4f98a2SYan Zheng return -ENOMEM; 19995d4f98a2SYan Zheng 20005d4f98a2SYan Zheng reloc_root = root->reloc_root; 20015d4f98a2SYan Zheng root_item = &reloc_root->root_item; 20025d4f98a2SYan Zheng 20035d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 20045d4f98a2SYan Zheng level = btrfs_root_level(root_item); 20055d4f98a2SYan Zheng extent_buffer_get(reloc_root->node); 20065d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 20075d4f98a2SYan Zheng path->slots[level] = 0; 20085d4f98a2SYan Zheng } else { 20095d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 20105d4f98a2SYan Zheng 20115d4f98a2SYan Zheng level = root_item->drop_level; 20125d4f98a2SYan Zheng BUG_ON(level == 0); 20135d4f98a2SYan Zheng path->lowest_level = level; 20145d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 201533c66f43SYan Zheng path->lowest_level = 0; 20165d4f98a2SYan Zheng if (ret < 0) { 20175d4f98a2SYan Zheng btrfs_free_path(path); 20185d4f98a2SYan Zheng return ret; 20195d4f98a2SYan Zheng } 20205d4f98a2SYan Zheng 20215d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 20225d4f98a2SYan Zheng path->slots[level]); 20235d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 20245d4f98a2SYan Zheng 20255d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 20265d4f98a2SYan Zheng } 20275d4f98a2SYan Zheng 20283fd0a558SYan, Zheng min_reserved = root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 20295d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 20305d4f98a2SYan Zheng 20315d4f98a2SYan Zheng while (1) { 2032a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 0); 20333fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 20343fd0a558SYan, Zheng 20353fd0a558SYan, Zheng ret = btrfs_block_rsv_check(trans, root, rc->block_rsv, 20363fd0a558SYan, Zheng min_reserved, 0); 20373fd0a558SYan, Zheng if (ret) { 20383fd0a558SYan, Zheng BUG_ON(ret != -EAGAIN); 20393fd0a558SYan, Zheng ret = btrfs_commit_transaction(trans, root); 20403fd0a558SYan, Zheng BUG_ON(ret); 20413fd0a558SYan, Zheng continue; 20423fd0a558SYan, Zheng } 20433fd0a558SYan, Zheng 20443fd0a558SYan, Zheng replaced = 0; 20455d4f98a2SYan Zheng max_level = level; 20465d4f98a2SYan Zheng 20475d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 20485d4f98a2SYan Zheng if (ret < 0) { 20495d4f98a2SYan Zheng err = ret; 20505d4f98a2SYan Zheng goto out; 20515d4f98a2SYan Zheng } 20525d4f98a2SYan Zheng if (ret > 0) 20535d4f98a2SYan Zheng break; 20545d4f98a2SYan Zheng 20555d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 20565d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 20575d4f98a2SYan Zheng ret = 0; 20585d4f98a2SYan Zheng } else { 20593fd0a558SYan, Zheng ret = replace_path(trans, root, reloc_root, path, 20603fd0a558SYan, Zheng &next_key, level, max_level); 20615d4f98a2SYan Zheng } 20625d4f98a2SYan Zheng if (ret < 0) { 20635d4f98a2SYan Zheng err = ret; 20645d4f98a2SYan Zheng goto out; 20655d4f98a2SYan Zheng } 20665d4f98a2SYan Zheng 20675d4f98a2SYan Zheng if (ret > 0) { 20685d4f98a2SYan Zheng level = ret; 20695d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 20705d4f98a2SYan Zheng path->slots[level]); 20715d4f98a2SYan Zheng replaced = 1; 20725d4f98a2SYan Zheng } 20735d4f98a2SYan Zheng 20745d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 20755d4f98a2SYan Zheng if (ret > 0) 20765d4f98a2SYan Zheng break; 20775d4f98a2SYan Zheng 20785d4f98a2SYan Zheng BUG_ON(level == 0); 20795d4f98a2SYan Zheng /* 20805d4f98a2SYan Zheng * save the merging progress in the drop_progress. 20815d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 20825d4f98a2SYan Zheng */ 20835d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 20845d4f98a2SYan Zheng path->slots[level]); 20855d4f98a2SYan Zheng root_item->drop_level = level; 20865d4f98a2SYan Zheng 20875d4f98a2SYan Zheng nr = trans->blocks_used; 20883fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, root); 20895d4f98a2SYan Zheng 20905d4f98a2SYan Zheng btrfs_btree_balance_dirty(root, nr); 20915d4f98a2SYan Zheng 20925d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 20935d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 20945d4f98a2SYan Zheng } 20955d4f98a2SYan Zheng 20965d4f98a2SYan Zheng /* 20975d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 20985d4f98a2SYan Zheng * relocated and the block is tree root. 20995d4f98a2SYan Zheng */ 21005d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 21015d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 21025d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 21035d4f98a2SYan Zheng free_extent_buffer(leaf); 21045d4f98a2SYan Zheng if (ret < 0) 21055d4f98a2SYan Zheng err = ret; 21065d4f98a2SYan Zheng out: 21075d4f98a2SYan Zheng btrfs_free_path(path); 21085d4f98a2SYan Zheng 21095d4f98a2SYan Zheng if (err == 0) { 21105d4f98a2SYan Zheng memset(&root_item->drop_progress, 0, 21115d4f98a2SYan Zheng sizeof(root_item->drop_progress)); 21125d4f98a2SYan Zheng root_item->drop_level = 0; 21135d4f98a2SYan Zheng btrfs_set_root_refs(root_item, 0); 21143fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 21155d4f98a2SYan Zheng } 21165d4f98a2SYan Zheng 21175d4f98a2SYan Zheng nr = trans->blocks_used; 21183fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, root); 21195d4f98a2SYan Zheng 21205d4f98a2SYan Zheng btrfs_btree_balance_dirty(root, nr); 21215d4f98a2SYan Zheng 21225d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 21235d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 21245d4f98a2SYan Zheng 21255d4f98a2SYan Zheng return err; 21265d4f98a2SYan Zheng } 21275d4f98a2SYan Zheng 21283fd0a558SYan, Zheng static noinline_for_stack 21293fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 21305d4f98a2SYan Zheng { 21313fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 21323fd0a558SYan, Zheng struct btrfs_root *reloc_root; 21335d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 21343fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 21353fd0a558SYan, Zheng u64 num_bytes = 0; 21363fd0a558SYan, Zheng int ret; 21373fd0a558SYan, Zheng int retries = 0; 21383fd0a558SYan, Zheng 21393fd0a558SYan, Zheng mutex_lock(&root->fs_info->trans_mutex); 21403fd0a558SYan, Zheng rc->merging_rsv_size += root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 21413fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 21423fd0a558SYan, Zheng mutex_unlock(&root->fs_info->trans_mutex); 21433fd0a558SYan, Zheng again: 21443fd0a558SYan, Zheng if (!err) { 21453fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 21463fd0a558SYan, Zheng ret = btrfs_block_rsv_add(NULL, root, rc->block_rsv, 21473fd0a558SYan, Zheng num_bytes, &retries); 21483fd0a558SYan, Zheng if (ret) 21493fd0a558SYan, Zheng err = ret; 21503fd0a558SYan, Zheng } 21513fd0a558SYan, Zheng 21523fd0a558SYan, Zheng trans = btrfs_join_transaction(rc->extent_root, 1); 21533fd0a558SYan, Zheng 21543fd0a558SYan, Zheng if (!err) { 21553fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 21563fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 21573fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, 21583fd0a558SYan, Zheng rc->block_rsv, num_bytes); 21593fd0a558SYan, Zheng retries = 0; 21603fd0a558SYan, Zheng goto again; 21613fd0a558SYan, Zheng } 21623fd0a558SYan, Zheng } 21633fd0a558SYan, Zheng 21643fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 21653fd0a558SYan, Zheng 21663fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 21673fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 21683fd0a558SYan, Zheng struct btrfs_root, root_list); 21693fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 21703fd0a558SYan, Zheng 21713fd0a558SYan, Zheng root = read_fs_root(reloc_root->fs_info, 21723fd0a558SYan, Zheng reloc_root->root_key.offset); 21733fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 21743fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 21753fd0a558SYan, Zheng 21763fd0a558SYan, Zheng /* 21773fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 21783fd0a558SYan, Zheng * knows it should resumes merging 21793fd0a558SYan, Zheng */ 21803fd0a558SYan, Zheng if (!err) 21813fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 21823fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 21833fd0a558SYan, Zheng 21843fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 21853fd0a558SYan, Zheng } 21863fd0a558SYan, Zheng 21873fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 21883fd0a558SYan, Zheng 21893fd0a558SYan, Zheng if (!err) 21903fd0a558SYan, Zheng btrfs_commit_transaction(trans, rc->extent_root); 21913fd0a558SYan, Zheng else 21923fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 21933fd0a558SYan, Zheng return err; 21943fd0a558SYan, Zheng } 21953fd0a558SYan, Zheng 21963fd0a558SYan, Zheng static noinline_for_stack 21973fd0a558SYan, Zheng int merge_reloc_roots(struct reloc_control *rc) 21983fd0a558SYan, Zheng { 21995d4f98a2SYan Zheng struct btrfs_root *root; 22005d4f98a2SYan Zheng struct btrfs_root *reloc_root; 22013fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 22023fd0a558SYan, Zheng int found = 0; 22033fd0a558SYan, Zheng int ret; 22043fd0a558SYan, Zheng again: 22053fd0a558SYan, Zheng root = rc->extent_root; 22063fd0a558SYan, Zheng mutex_lock(&root->fs_info->trans_mutex); 22073fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 22083fd0a558SYan, Zheng mutex_unlock(&root->fs_info->trans_mutex); 22095d4f98a2SYan Zheng 22103fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 22113fd0a558SYan, Zheng found = 1; 22123fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 22133fd0a558SYan, Zheng struct btrfs_root, root_list); 22145d4f98a2SYan Zheng 22155d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 22165d4f98a2SYan Zheng root = read_fs_root(reloc_root->fs_info, 22175d4f98a2SYan Zheng reloc_root->root_key.offset); 22185d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 22195d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 22205d4f98a2SYan Zheng 22213fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 22223fd0a558SYan, Zheng BUG_ON(ret); 22233fd0a558SYan, Zheng } else { 22243fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 22253fd0a558SYan, Zheng } 22263fd0a558SYan, Zheng btrfs_drop_snapshot(reloc_root, rc->block_rsv, 0); 22275d4f98a2SYan Zheng } 22285d4f98a2SYan Zheng 22293fd0a558SYan, Zheng if (found) { 22303fd0a558SYan, Zheng found = 0; 22313fd0a558SYan, Zheng goto again; 22325d4f98a2SYan Zheng } 22335d4f98a2SYan Zheng BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 22345d4f98a2SYan Zheng return 0; 22355d4f98a2SYan Zheng } 22365d4f98a2SYan Zheng 22375d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 22385d4f98a2SYan Zheng { 22395d4f98a2SYan Zheng struct tree_block *block; 22405d4f98a2SYan Zheng struct rb_node *rb_node; 22415d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 22425d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 22435d4f98a2SYan Zheng rb_erase(rb_node, blocks); 22445d4f98a2SYan Zheng kfree(block); 22455d4f98a2SYan Zheng } 22465d4f98a2SYan Zheng } 22475d4f98a2SYan Zheng 22485d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 22495d4f98a2SYan Zheng struct btrfs_root *reloc_root) 22505d4f98a2SYan Zheng { 22515d4f98a2SYan Zheng struct btrfs_root *root; 22525d4f98a2SYan Zheng 22535d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 22545d4f98a2SYan Zheng return 0; 22555d4f98a2SYan Zheng 22565d4f98a2SYan Zheng root = read_fs_root(reloc_root->fs_info, reloc_root->root_key.offset); 22575d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 22585d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 22595d4f98a2SYan Zheng 22605d4f98a2SYan Zheng return btrfs_record_root_in_trans(trans, root); 22615d4f98a2SYan Zheng } 22625d4f98a2SYan Zheng 22633fd0a558SYan, Zheng static noinline_for_stack 22643fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 22653fd0a558SYan, Zheng struct reloc_control *rc, 22665d4f98a2SYan Zheng struct backref_node *node, 22673fd0a558SYan, Zheng struct backref_edge *edges[], int *nr) 22685d4f98a2SYan Zheng { 22695d4f98a2SYan Zheng struct backref_node *next; 22705d4f98a2SYan Zheng struct btrfs_root *root; 22713fd0a558SYan, Zheng int index = 0; 22723fd0a558SYan, Zheng 22735d4f98a2SYan Zheng next = node; 22745d4f98a2SYan Zheng while (1) { 22755d4f98a2SYan Zheng cond_resched(); 22765d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 22775d4f98a2SYan Zheng root = next->root; 22783fd0a558SYan, Zheng BUG_ON(!root); 22793fd0a558SYan, Zheng BUG_ON(!root->ref_cows); 22805d4f98a2SYan Zheng 22815d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 22825d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 22835d4f98a2SYan Zheng break; 22845d4f98a2SYan Zheng } 22855d4f98a2SYan Zheng 22865d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 22873fd0a558SYan, Zheng root = root->reloc_root; 22883fd0a558SYan, Zheng 22893fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 22903fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 22913fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 22923fd0a558SYan, Zheng next->new_bytenr = root->node->start; 22933fd0a558SYan, Zheng next->root = root; 22943fd0a558SYan, Zheng list_add_tail(&next->list, 22953fd0a558SYan, Zheng &rc->backref_cache.changed); 22963fd0a558SYan, Zheng __mark_block_processed(rc, next); 22975d4f98a2SYan Zheng break; 22985d4f98a2SYan Zheng } 22995d4f98a2SYan Zheng 23003fd0a558SYan, Zheng WARN_ON(1); 23015d4f98a2SYan Zheng root = NULL; 23025d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 23035d4f98a2SYan Zheng if (!next || next->level <= node->level) 23045d4f98a2SYan Zheng break; 23055d4f98a2SYan Zheng } 23063fd0a558SYan, Zheng if (!root) 23073fd0a558SYan, Zheng return NULL; 23085d4f98a2SYan Zheng 23095d4f98a2SYan Zheng *nr = index; 23103fd0a558SYan, Zheng next = node; 23113fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 23123fd0a558SYan, Zheng while (1) { 23133fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 23143fd0a558SYan, Zheng if (--index < 0) 23153fd0a558SYan, Zheng break; 23163fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 23173fd0a558SYan, Zheng } 23185d4f98a2SYan Zheng return root; 23195d4f98a2SYan Zheng } 23205d4f98a2SYan Zheng 23213fd0a558SYan, Zheng /* 23223fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 23233fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 23243fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 23253fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 23263fd0a558SYan, Zheng */ 23275d4f98a2SYan Zheng static noinline_for_stack 23285d4f98a2SYan Zheng struct btrfs_root *select_one_root(struct btrfs_trans_handle *trans, 23295d4f98a2SYan Zheng struct backref_node *node) 23305d4f98a2SYan Zheng { 23313fd0a558SYan, Zheng struct backref_node *next; 23323fd0a558SYan, Zheng struct btrfs_root *root; 23333fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 23345d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 23353fd0a558SYan, Zheng int index = 0; 23363fd0a558SYan, Zheng 23373fd0a558SYan, Zheng next = node; 23383fd0a558SYan, Zheng while (1) { 23393fd0a558SYan, Zheng cond_resched(); 23403fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 23413fd0a558SYan, Zheng root = next->root; 23423fd0a558SYan, Zheng BUG_ON(!root); 23433fd0a558SYan, Zheng 23443fd0a558SYan, Zheng /* no other choice for non-refernce counted tree */ 23453fd0a558SYan, Zheng if (!root->ref_cows) 23463fd0a558SYan, Zheng return root; 23473fd0a558SYan, Zheng 23483fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 23493fd0a558SYan, Zheng fs_root = root; 23503fd0a558SYan, Zheng 23513fd0a558SYan, Zheng if (next != node) 23523fd0a558SYan, Zheng return NULL; 23533fd0a558SYan, Zheng 23543fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 23553fd0a558SYan, Zheng if (!next || next->level <= node->level) 23563fd0a558SYan, Zheng break; 23573fd0a558SYan, Zheng } 23583fd0a558SYan, Zheng 23593fd0a558SYan, Zheng if (!fs_root) 23603fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 23613fd0a558SYan, Zheng return fs_root; 23625d4f98a2SYan Zheng } 23635d4f98a2SYan Zheng 23645d4f98a2SYan Zheng static noinline_for_stack 23653fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 23663fd0a558SYan, Zheng struct backref_node *node, int reserve) 23675d4f98a2SYan Zheng { 23683fd0a558SYan, Zheng struct backref_node *next = node; 23693fd0a558SYan, Zheng struct backref_edge *edge; 23703fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 23713fd0a558SYan, Zheng u64 num_bytes = 0; 23723fd0a558SYan, Zheng int index = 0; 23735d4f98a2SYan Zheng 23743fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 23753fd0a558SYan, Zheng 23763fd0a558SYan, Zheng while (next) { 23773fd0a558SYan, Zheng cond_resched(); 23785d4f98a2SYan Zheng while (1) { 23793fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 23805d4f98a2SYan Zheng break; 23815d4f98a2SYan Zheng 23823fd0a558SYan, Zheng num_bytes += btrfs_level_size(rc->extent_root, 23833fd0a558SYan, Zheng next->level); 23843fd0a558SYan, Zheng 23853fd0a558SYan, Zheng if (list_empty(&next->upper)) 23863fd0a558SYan, Zheng break; 23873fd0a558SYan, Zheng 23883fd0a558SYan, Zheng edge = list_entry(next->upper.next, 23893fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 23903fd0a558SYan, Zheng edges[index++] = edge; 23913fd0a558SYan, Zheng next = edge->node[UPPER]; 23925d4f98a2SYan Zheng } 23933fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 23943fd0a558SYan, Zheng } 23953fd0a558SYan, Zheng return num_bytes; 23963fd0a558SYan, Zheng } 23973fd0a558SYan, Zheng 23983fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 23993fd0a558SYan, Zheng struct reloc_control *rc, 24003fd0a558SYan, Zheng struct backref_node *node) 24013fd0a558SYan, Zheng { 24023fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 24033fd0a558SYan, Zheng u64 num_bytes; 24043fd0a558SYan, Zheng int ret; 24053fd0a558SYan, Zheng 24063fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 24073fd0a558SYan, Zheng 24083fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 24093fd0a558SYan, Zheng ret = btrfs_block_rsv_add(trans, root, rc->block_rsv, num_bytes, 24103fd0a558SYan, Zheng &rc->block_rsv_retries); 24113fd0a558SYan, Zheng if (ret) { 24123fd0a558SYan, Zheng if (ret == -EAGAIN) 24133fd0a558SYan, Zheng rc->commit_transaction = 1; 24143fd0a558SYan, Zheng return ret; 24153fd0a558SYan, Zheng } 24163fd0a558SYan, Zheng 24173fd0a558SYan, Zheng rc->block_rsv_retries = 0; 24183fd0a558SYan, Zheng return 0; 24193fd0a558SYan, Zheng } 24203fd0a558SYan, Zheng 24213fd0a558SYan, Zheng static void release_metadata_space(struct reloc_control *rc, 24223fd0a558SYan, Zheng struct backref_node *node) 24233fd0a558SYan, Zheng { 24243fd0a558SYan, Zheng u64 num_bytes = calcu_metadata_size(rc, node, 0) * 2; 24253fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, num_bytes); 24265d4f98a2SYan Zheng } 24275d4f98a2SYan Zheng 24285d4f98a2SYan Zheng /* 24295d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 24305d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 24315d4f98a2SYan Zheng * 24325d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 24335d4f98a2SYan Zheng * in that case this function just updates pointers. 24345d4f98a2SYan Zheng */ 24355d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 24363fd0a558SYan, Zheng struct reloc_control *rc, 24375d4f98a2SYan Zheng struct backref_node *node, 24385d4f98a2SYan Zheng struct btrfs_key *key, 24395d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 24405d4f98a2SYan Zheng { 24415d4f98a2SYan Zheng struct backref_node *upper; 24425d4f98a2SYan Zheng struct backref_edge *edge; 24435d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 24445d4f98a2SYan Zheng struct btrfs_root *root; 24455d4f98a2SYan Zheng struct extent_buffer *eb; 24465d4f98a2SYan Zheng u32 blocksize; 24475d4f98a2SYan Zheng u64 bytenr; 24485d4f98a2SYan Zheng u64 generation; 24495d4f98a2SYan Zheng int nr; 24505d4f98a2SYan Zheng int slot; 24515d4f98a2SYan Zheng int ret; 24525d4f98a2SYan Zheng int err = 0; 24535d4f98a2SYan Zheng 24545d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 24555d4f98a2SYan Zheng 24565d4f98a2SYan Zheng path->lowest_level = node->level + 1; 24573fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 24585d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 24595d4f98a2SYan Zheng cond_resched(); 24605d4f98a2SYan Zheng 24615d4f98a2SYan Zheng upper = edge->node[UPPER]; 24623fd0a558SYan, Zheng root = select_reloc_root(trans, rc, upper, edges, &nr); 24633fd0a558SYan, Zheng BUG_ON(!root); 24645d4f98a2SYan Zheng 24653fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 24663fd0a558SYan, Zheng if (!lowest) { 24673fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 24683fd0a558SYan, Zheng upper->level, &slot); 24693fd0a558SYan, Zheng BUG_ON(ret); 24703fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 24713fd0a558SYan, Zheng if (node->eb->start == bytenr) 24723fd0a558SYan, Zheng goto next; 24733fd0a558SYan, Zheng } 24745d4f98a2SYan Zheng drop_node_buffer(upper); 24753fd0a558SYan, Zheng } 24765d4f98a2SYan Zheng 24775d4f98a2SYan Zheng if (!upper->eb) { 24785d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 24795d4f98a2SYan Zheng if (ret < 0) { 24805d4f98a2SYan Zheng err = ret; 24815d4f98a2SYan Zheng break; 24825d4f98a2SYan Zheng } 24835d4f98a2SYan Zheng BUG_ON(ret > 0); 24845d4f98a2SYan Zheng 24853fd0a558SYan, Zheng if (!upper->eb) { 24863fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 24873fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 24883fd0a558SYan, Zheng } else { 24893fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 24903fd0a558SYan, Zheng } 24913fd0a558SYan, Zheng 24923fd0a558SYan, Zheng upper->locked = 1; 24933fd0a558SYan, Zheng path->locks[upper->level] = 0; 24943fd0a558SYan, Zheng 24955d4f98a2SYan Zheng slot = path->slots[upper->level]; 24965d4f98a2SYan Zheng btrfs_release_path(NULL, path); 24975d4f98a2SYan Zheng } else { 24985d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 24995d4f98a2SYan Zheng &slot); 25005d4f98a2SYan Zheng BUG_ON(ret); 25015d4f98a2SYan Zheng } 25025d4f98a2SYan Zheng 25035d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 25043fd0a558SYan, Zheng if (lowest) { 25053fd0a558SYan, Zheng BUG_ON(bytenr != node->bytenr); 25065d4f98a2SYan Zheng } else { 25073fd0a558SYan, Zheng if (node->eb->start == bytenr) 25083fd0a558SYan, Zheng goto next; 25095d4f98a2SYan Zheng } 25105d4f98a2SYan Zheng 25115d4f98a2SYan Zheng blocksize = btrfs_level_size(root, node->level); 25125d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 25135d4f98a2SYan Zheng eb = read_tree_block(root, bytenr, blocksize, generation); 25145d4f98a2SYan Zheng btrfs_tree_lock(eb); 25155d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 25165d4f98a2SYan Zheng 25175d4f98a2SYan Zheng if (!node->eb) { 25185d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 25195d4f98a2SYan Zheng slot, &eb); 25203fd0a558SYan, Zheng btrfs_tree_unlock(eb); 25213fd0a558SYan, Zheng free_extent_buffer(eb); 25225d4f98a2SYan Zheng if (ret < 0) { 25235d4f98a2SYan Zheng err = ret; 25243fd0a558SYan, Zheng goto next; 25255d4f98a2SYan Zheng } 25263fd0a558SYan, Zheng BUG_ON(node->eb != eb); 25275d4f98a2SYan Zheng } else { 25285d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 25295d4f98a2SYan Zheng node->eb->start); 25305d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 25315d4f98a2SYan Zheng trans->transid); 25325d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 25335d4f98a2SYan Zheng 25345d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, root, 25355d4f98a2SYan Zheng node->eb->start, blocksize, 25365d4f98a2SYan Zheng upper->eb->start, 25375d4f98a2SYan Zheng btrfs_header_owner(upper->eb), 25385d4f98a2SYan Zheng node->level, 0); 25395d4f98a2SYan Zheng BUG_ON(ret); 25405d4f98a2SYan Zheng 25415d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 25425d4f98a2SYan Zheng BUG_ON(ret); 25435d4f98a2SYan Zheng } 25443fd0a558SYan, Zheng next: 25453fd0a558SYan, Zheng if (!upper->pending) 25463fd0a558SYan, Zheng drop_node_buffer(upper); 25473fd0a558SYan, Zheng else 25483fd0a558SYan, Zheng unlock_node_buffer(upper); 25493fd0a558SYan, Zheng if (err) 25503fd0a558SYan, Zheng break; 25515d4f98a2SYan Zheng } 25523fd0a558SYan, Zheng 25533fd0a558SYan, Zheng if (!err && node->pending) { 25543fd0a558SYan, Zheng drop_node_buffer(node); 25553fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 25563fd0a558SYan, Zheng node->pending = 0; 25575d4f98a2SYan Zheng } 25583fd0a558SYan, Zheng 25595d4f98a2SYan Zheng path->lowest_level = 0; 25603fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 25615d4f98a2SYan Zheng return err; 25625d4f98a2SYan Zheng } 25635d4f98a2SYan Zheng 25645d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 25653fd0a558SYan, Zheng struct reloc_control *rc, 25665d4f98a2SYan Zheng struct backref_node *node, 25675d4f98a2SYan Zheng struct btrfs_path *path) 25685d4f98a2SYan Zheng { 25695d4f98a2SYan Zheng struct btrfs_key key; 25705d4f98a2SYan Zheng 25715d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 25723fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 25735d4f98a2SYan Zheng } 25745d4f98a2SYan Zheng 25755d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 25763fd0a558SYan, Zheng struct reloc_control *rc, 25773fd0a558SYan, Zheng struct btrfs_path *path, int err) 25785d4f98a2SYan Zheng { 25793fd0a558SYan, Zheng LIST_HEAD(list); 25803fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 25815d4f98a2SYan Zheng struct backref_node *node; 25825d4f98a2SYan Zheng int level; 25835d4f98a2SYan Zheng int ret; 25845d4f98a2SYan Zheng 25855d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 25865d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 25875d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 25883fd0a558SYan, Zheng struct backref_node, list); 25893fd0a558SYan, Zheng list_move_tail(&node->list, &list); 25903fd0a558SYan, Zheng BUG_ON(!node->pending); 25915d4f98a2SYan Zheng 25923fd0a558SYan, Zheng if (!err) { 25933fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 25945d4f98a2SYan Zheng if (ret < 0) 25955d4f98a2SYan Zheng err = ret; 25965d4f98a2SYan Zheng } 25975d4f98a2SYan Zheng } 25983fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 25993fd0a558SYan, Zheng } 26005d4f98a2SYan Zheng return err; 26015d4f98a2SYan Zheng } 26025d4f98a2SYan Zheng 26035d4f98a2SYan Zheng static void mark_block_processed(struct reloc_control *rc, 26043fd0a558SYan, Zheng u64 bytenr, u32 blocksize) 26053fd0a558SYan, Zheng { 26063fd0a558SYan, Zheng set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, 26073fd0a558SYan, Zheng EXTENT_DIRTY, GFP_NOFS); 26083fd0a558SYan, Zheng } 26093fd0a558SYan, Zheng 26103fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 26115d4f98a2SYan Zheng struct backref_node *node) 26125d4f98a2SYan Zheng { 26135d4f98a2SYan Zheng u32 blocksize; 26145d4f98a2SYan Zheng if (node->level == 0 || 26155d4f98a2SYan Zheng in_block_group(node->bytenr, rc->block_group)) { 26165d4f98a2SYan Zheng blocksize = btrfs_level_size(rc->extent_root, node->level); 26173fd0a558SYan, Zheng mark_block_processed(rc, node->bytenr, blocksize); 26185d4f98a2SYan Zheng } 26195d4f98a2SYan Zheng node->processed = 1; 26205d4f98a2SYan Zheng } 26215d4f98a2SYan Zheng 26225d4f98a2SYan Zheng /* 26235d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 26245d4f98a2SYan Zheng * as processed. 26255d4f98a2SYan Zheng */ 26265d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 26275d4f98a2SYan Zheng struct backref_node *node) 26285d4f98a2SYan Zheng { 26295d4f98a2SYan Zheng struct backref_node *next = node; 26305d4f98a2SYan Zheng struct backref_edge *edge; 26315d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 26325d4f98a2SYan Zheng int index = 0; 26335d4f98a2SYan Zheng 26345d4f98a2SYan Zheng while (next) { 26355d4f98a2SYan Zheng cond_resched(); 26365d4f98a2SYan Zheng while (1) { 26375d4f98a2SYan Zheng if (next->processed) 26385d4f98a2SYan Zheng break; 26395d4f98a2SYan Zheng 26403fd0a558SYan, Zheng __mark_block_processed(rc, next); 26415d4f98a2SYan Zheng 26425d4f98a2SYan Zheng if (list_empty(&next->upper)) 26435d4f98a2SYan Zheng break; 26445d4f98a2SYan Zheng 26455d4f98a2SYan Zheng edge = list_entry(next->upper.next, 26465d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 26475d4f98a2SYan Zheng edges[index++] = edge; 26485d4f98a2SYan Zheng next = edge->node[UPPER]; 26495d4f98a2SYan Zheng } 26505d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 26515d4f98a2SYan Zheng } 26525d4f98a2SYan Zheng } 26535d4f98a2SYan Zheng 26545d4f98a2SYan Zheng static int tree_block_processed(u64 bytenr, u32 blocksize, 26555d4f98a2SYan Zheng struct reloc_control *rc) 26565d4f98a2SYan Zheng { 26575d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 26589655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 26595d4f98a2SYan Zheng return 1; 26605d4f98a2SYan Zheng return 0; 26615d4f98a2SYan Zheng } 26625d4f98a2SYan Zheng 26635d4f98a2SYan Zheng static int get_tree_block_key(struct reloc_control *rc, 26645d4f98a2SYan Zheng struct tree_block *block) 26655d4f98a2SYan Zheng { 26665d4f98a2SYan Zheng struct extent_buffer *eb; 26675d4f98a2SYan Zheng 26685d4f98a2SYan Zheng BUG_ON(block->key_ready); 26695d4f98a2SYan Zheng eb = read_tree_block(rc->extent_root, block->bytenr, 26705d4f98a2SYan Zheng block->key.objectid, block->key.offset); 26715d4f98a2SYan Zheng WARN_ON(btrfs_header_level(eb) != block->level); 26725d4f98a2SYan Zheng if (block->level == 0) 26735d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 26745d4f98a2SYan Zheng else 26755d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 26765d4f98a2SYan Zheng free_extent_buffer(eb); 26775d4f98a2SYan Zheng block->key_ready = 1; 26785d4f98a2SYan Zheng return 0; 26795d4f98a2SYan Zheng } 26805d4f98a2SYan Zheng 26815d4f98a2SYan Zheng static int reada_tree_block(struct reloc_control *rc, 26825d4f98a2SYan Zheng struct tree_block *block) 26835d4f98a2SYan Zheng { 26845d4f98a2SYan Zheng BUG_ON(block->key_ready); 26855d4f98a2SYan Zheng readahead_tree_block(rc->extent_root, block->bytenr, 26865d4f98a2SYan Zheng block->key.objectid, block->key.offset); 26875d4f98a2SYan Zheng return 0; 26885d4f98a2SYan Zheng } 26895d4f98a2SYan Zheng 26905d4f98a2SYan Zheng /* 26915d4f98a2SYan Zheng * helper function to relocate a tree block 26925d4f98a2SYan Zheng */ 26935d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 26945d4f98a2SYan Zheng struct reloc_control *rc, 26955d4f98a2SYan Zheng struct backref_node *node, 26965d4f98a2SYan Zheng struct btrfs_key *key, 26975d4f98a2SYan Zheng struct btrfs_path *path) 26985d4f98a2SYan Zheng { 26995d4f98a2SYan Zheng struct btrfs_root *root; 27003fd0a558SYan, Zheng int release = 0; 27013fd0a558SYan, Zheng int ret = 0; 27025d4f98a2SYan Zheng 27033fd0a558SYan, Zheng if (!node) 27045d4f98a2SYan Zheng return 0; 27053fd0a558SYan, Zheng 27063fd0a558SYan, Zheng BUG_ON(node->processed); 27073fd0a558SYan, Zheng root = select_one_root(trans, node); 27083fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 27093fd0a558SYan, Zheng update_processed_blocks(rc, node); 27103fd0a558SYan, Zheng goto out; 27115d4f98a2SYan Zheng } 27125d4f98a2SYan Zheng 27133fd0a558SYan, Zheng if (!root || root->ref_cows) { 27143fd0a558SYan, Zheng ret = reserve_metadata_space(trans, rc, node); 27153fd0a558SYan, Zheng if (ret) 27165d4f98a2SYan Zheng goto out; 27173fd0a558SYan, Zheng release = 1; 27185d4f98a2SYan Zheng } 27193fd0a558SYan, Zheng 27203fd0a558SYan, Zheng if (root) { 27213fd0a558SYan, Zheng if (root->ref_cows) { 27223fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 27233fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 27243fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 27253fd0a558SYan, Zheng root = root->reloc_root; 27263fd0a558SYan, Zheng node->new_bytenr = root->node->start; 27273fd0a558SYan, Zheng node->root = root; 27283fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 27293fd0a558SYan, Zheng } else { 27305d4f98a2SYan Zheng path->lowest_level = node->level; 27315d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 27325d4f98a2SYan Zheng btrfs_release_path(root, path); 27333fd0a558SYan, Zheng if (ret > 0) 27345d4f98a2SYan Zheng ret = 0; 27353fd0a558SYan, Zheng } 27363fd0a558SYan, Zheng if (!ret) 27373fd0a558SYan, Zheng update_processed_blocks(rc, node); 27383fd0a558SYan, Zheng } else { 27393fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 27403fd0a558SYan, Zheng } 27415d4f98a2SYan Zheng out: 27423fd0a558SYan, Zheng if (ret || node->level == 0 || node->cowonly) { 27433fd0a558SYan, Zheng if (release) 27443fd0a558SYan, Zheng release_metadata_space(rc, node); 27453fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 27463fd0a558SYan, Zheng } 27475d4f98a2SYan Zheng return ret; 27485d4f98a2SYan Zheng } 27495d4f98a2SYan Zheng 27505d4f98a2SYan Zheng /* 27515d4f98a2SYan Zheng * relocate a list of blocks 27525d4f98a2SYan Zheng */ 27535d4f98a2SYan Zheng static noinline_for_stack 27545d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 27555d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 27565d4f98a2SYan Zheng { 27575d4f98a2SYan Zheng struct backref_node *node; 27585d4f98a2SYan Zheng struct btrfs_path *path; 27595d4f98a2SYan Zheng struct tree_block *block; 27605d4f98a2SYan Zheng struct rb_node *rb_node; 27615d4f98a2SYan Zheng int ret; 27625d4f98a2SYan Zheng int err = 0; 27635d4f98a2SYan Zheng 27645d4f98a2SYan Zheng path = btrfs_alloc_path(); 27655d4f98a2SYan Zheng if (!path) 27665d4f98a2SYan Zheng return -ENOMEM; 27675d4f98a2SYan Zheng 27685d4f98a2SYan Zheng rb_node = rb_first(blocks); 27695d4f98a2SYan Zheng while (rb_node) { 27705d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 27715d4f98a2SYan Zheng if (!block->key_ready) 27725d4f98a2SYan Zheng reada_tree_block(rc, block); 27735d4f98a2SYan Zheng rb_node = rb_next(rb_node); 27745d4f98a2SYan Zheng } 27755d4f98a2SYan Zheng 27765d4f98a2SYan Zheng rb_node = rb_first(blocks); 27775d4f98a2SYan Zheng while (rb_node) { 27785d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 27795d4f98a2SYan Zheng if (!block->key_ready) 27805d4f98a2SYan Zheng get_tree_block_key(rc, block); 27815d4f98a2SYan Zheng rb_node = rb_next(rb_node); 27825d4f98a2SYan Zheng } 27835d4f98a2SYan Zheng 27845d4f98a2SYan Zheng rb_node = rb_first(blocks); 27855d4f98a2SYan Zheng while (rb_node) { 27865d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 27875d4f98a2SYan Zheng 27883fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 27895d4f98a2SYan Zheng block->level, block->bytenr); 27905d4f98a2SYan Zheng if (IS_ERR(node)) { 27915d4f98a2SYan Zheng err = PTR_ERR(node); 27925d4f98a2SYan Zheng goto out; 27935d4f98a2SYan Zheng } 27945d4f98a2SYan Zheng 27955d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 27965d4f98a2SYan Zheng path); 27975d4f98a2SYan Zheng if (ret < 0) { 27983fd0a558SYan, Zheng if (ret != -EAGAIN || rb_node == rb_first(blocks)) 27995d4f98a2SYan Zheng err = ret; 28005d4f98a2SYan Zheng goto out; 28015d4f98a2SYan Zheng } 28025d4f98a2SYan Zheng rb_node = rb_next(rb_node); 28035d4f98a2SYan Zheng } 28045d4f98a2SYan Zheng out: 28055d4f98a2SYan Zheng free_block_list(blocks); 28063fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 28075d4f98a2SYan Zheng 28085d4f98a2SYan Zheng btrfs_free_path(path); 28095d4f98a2SYan Zheng return err; 28105d4f98a2SYan Zheng } 28115d4f98a2SYan Zheng 28125d4f98a2SYan Zheng static noinline_for_stack 2813efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 2814efa56464SYan, Zheng struct file_extent_cluster *cluster) 2815efa56464SYan, Zheng { 2816efa56464SYan, Zheng u64 alloc_hint = 0; 2817efa56464SYan, Zheng u64 start; 2818efa56464SYan, Zheng u64 end; 2819efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 2820efa56464SYan, Zheng u64 num_bytes; 2821efa56464SYan, Zheng int nr = 0; 2822efa56464SYan, Zheng int ret = 0; 2823efa56464SYan, Zheng 2824efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 2825efa56464SYan, Zheng mutex_lock(&inode->i_mutex); 2826efa56464SYan, Zheng 2827efa56464SYan, Zheng ret = btrfs_check_data_free_space(inode, cluster->end + 2828efa56464SYan, Zheng 1 - cluster->start); 2829efa56464SYan, Zheng if (ret) 2830efa56464SYan, Zheng goto out; 2831efa56464SYan, Zheng 2832efa56464SYan, Zheng while (nr < cluster->nr) { 2833efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 2834efa56464SYan, Zheng if (nr + 1 < cluster->nr) 2835efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 2836efa56464SYan, Zheng else 2837efa56464SYan, Zheng end = cluster->end - offset; 2838efa56464SYan, Zheng 2839efa56464SYan, Zheng lock_extent(&BTRFS_I(inode)->io_tree, start, end, GFP_NOFS); 2840efa56464SYan, Zheng num_bytes = end + 1 - start; 2841efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 2842efa56464SYan, Zheng num_bytes, num_bytes, 2843efa56464SYan, Zheng end + 1, &alloc_hint); 2844efa56464SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, start, end, GFP_NOFS); 2845efa56464SYan, Zheng if (ret) 2846efa56464SYan, Zheng break; 2847efa56464SYan, Zheng nr++; 2848efa56464SYan, Zheng } 2849efa56464SYan, Zheng btrfs_free_reserved_data_space(inode, cluster->end + 2850efa56464SYan, Zheng 1 - cluster->start); 2851efa56464SYan, Zheng out: 2852efa56464SYan, Zheng mutex_unlock(&inode->i_mutex); 2853efa56464SYan, Zheng return ret; 2854efa56464SYan, Zheng } 2855efa56464SYan, Zheng 2856efa56464SYan, Zheng static noinline_for_stack 28570257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 28580257bb82SYan, Zheng u64 block_start) 28595d4f98a2SYan Zheng { 28605d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(inode)->root; 28615d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 28625d4f98a2SYan Zheng struct extent_map *em; 28630257bb82SYan, Zheng int ret = 0; 28645d4f98a2SYan Zheng 28655d4f98a2SYan Zheng em = alloc_extent_map(GFP_NOFS); 28660257bb82SYan, Zheng if (!em) 28670257bb82SYan, Zheng return -ENOMEM; 28680257bb82SYan, Zheng 28695d4f98a2SYan Zheng em->start = start; 28700257bb82SYan, Zheng em->len = end + 1 - start; 28710257bb82SYan, Zheng em->block_len = em->len; 28720257bb82SYan, Zheng em->block_start = block_start; 28735d4f98a2SYan Zheng em->bdev = root->fs_info->fs_devices->latest_bdev; 28745d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 28755d4f98a2SYan Zheng 28765d4f98a2SYan Zheng lock_extent(&BTRFS_I(inode)->io_tree, start, end, GFP_NOFS); 28775d4f98a2SYan Zheng while (1) { 2878890871beSChris Mason write_lock(&em_tree->lock); 28795d4f98a2SYan Zheng ret = add_extent_mapping(em_tree, em); 2880890871beSChris Mason write_unlock(&em_tree->lock); 28815d4f98a2SYan Zheng if (ret != -EEXIST) { 28825d4f98a2SYan Zheng free_extent_map(em); 28835d4f98a2SYan Zheng break; 28845d4f98a2SYan Zheng } 28855d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, start, end, 0); 28865d4f98a2SYan Zheng } 28875d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, start, end, GFP_NOFS); 28880257bb82SYan, Zheng return ret; 28890257bb82SYan, Zheng } 28905d4f98a2SYan Zheng 28910257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 28920257bb82SYan, Zheng struct file_extent_cluster *cluster) 28930257bb82SYan, Zheng { 28940257bb82SYan, Zheng u64 page_start; 28950257bb82SYan, Zheng u64 page_end; 28960257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 28970257bb82SYan, Zheng unsigned long index; 28980257bb82SYan, Zheng unsigned long last_index; 28990257bb82SYan, Zheng struct page *page; 29000257bb82SYan, Zheng struct file_ra_state *ra; 29010257bb82SYan, Zheng int nr = 0; 29020257bb82SYan, Zheng int ret = 0; 29030257bb82SYan, Zheng 29040257bb82SYan, Zheng if (!cluster->nr) 29050257bb82SYan, Zheng return 0; 29060257bb82SYan, Zheng 29070257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 29080257bb82SYan, Zheng if (!ra) 29090257bb82SYan, Zheng return -ENOMEM; 29100257bb82SYan, Zheng 2911efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 29120257bb82SYan, Zheng if (ret) 2913efa56464SYan, Zheng goto out; 29140257bb82SYan, Zheng 29150257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 29160257bb82SYan, Zheng 2917efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 2918efa56464SYan, Zheng cluster->end - offset, cluster->start); 2919efa56464SYan, Zheng if (ret) 2920efa56464SYan, Zheng goto out; 2921efa56464SYan, Zheng 2922efa56464SYan, Zheng index = (cluster->start - offset) >> PAGE_CACHE_SHIFT; 2923efa56464SYan, Zheng last_index = (cluster->end - offset) >> PAGE_CACHE_SHIFT; 29240257bb82SYan, Zheng while (index <= last_index) { 2925efa56464SYan, Zheng ret = btrfs_delalloc_reserve_metadata(inode, PAGE_CACHE_SIZE); 2926efa56464SYan, Zheng if (ret) 2927efa56464SYan, Zheng goto out; 2928efa56464SYan, Zheng 29290257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 29300257bb82SYan, Zheng if (!page) { 29310257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 29320257bb82SYan, Zheng ra, NULL, index, 29330257bb82SYan, Zheng last_index + 1 - index); 29340257bb82SYan, Zheng page = grab_cache_page(inode->i_mapping, index); 29350257bb82SYan, Zheng if (!page) { 2936efa56464SYan, Zheng btrfs_delalloc_release_metadata(inode, 2937efa56464SYan, Zheng PAGE_CACHE_SIZE); 29380257bb82SYan, Zheng ret = -ENOMEM; 2939efa56464SYan, Zheng goto out; 29400257bb82SYan, Zheng } 29410257bb82SYan, Zheng } 29420257bb82SYan, Zheng 29430257bb82SYan, Zheng if (PageReadahead(page)) { 29440257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 29450257bb82SYan, Zheng ra, NULL, page, index, 29460257bb82SYan, Zheng last_index + 1 - index); 29470257bb82SYan, Zheng } 29480257bb82SYan, Zheng 29490257bb82SYan, Zheng if (!PageUptodate(page)) { 29500257bb82SYan, Zheng btrfs_readpage(NULL, page); 29510257bb82SYan, Zheng lock_page(page); 29520257bb82SYan, Zheng if (!PageUptodate(page)) { 29530257bb82SYan, Zheng unlock_page(page); 29540257bb82SYan, Zheng page_cache_release(page); 2955efa56464SYan, Zheng btrfs_delalloc_release_metadata(inode, 2956efa56464SYan, Zheng PAGE_CACHE_SIZE); 29570257bb82SYan, Zheng ret = -EIO; 2958efa56464SYan, Zheng goto out; 29590257bb82SYan, Zheng } 29600257bb82SYan, Zheng } 29610257bb82SYan, Zheng 29620257bb82SYan, Zheng page_start = (u64)page->index << PAGE_CACHE_SHIFT; 29630257bb82SYan, Zheng page_end = page_start + PAGE_CACHE_SIZE - 1; 29640257bb82SYan, Zheng 29650257bb82SYan, Zheng lock_extent(&BTRFS_I(inode)->io_tree, 29660257bb82SYan, Zheng page_start, page_end, GFP_NOFS); 29670257bb82SYan, Zheng 29680257bb82SYan, Zheng set_page_extent_mapped(page); 29690257bb82SYan, Zheng 29700257bb82SYan, Zheng if (nr < cluster->nr && 29710257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 29720257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 29730257bb82SYan, Zheng page_start, page_end, 29740257bb82SYan, Zheng EXTENT_BOUNDARY, GFP_NOFS); 29750257bb82SYan, Zheng nr++; 29760257bb82SYan, Zheng } 29770257bb82SYan, Zheng 2978efa56464SYan, Zheng btrfs_set_extent_delalloc(inode, page_start, page_end, NULL); 29790257bb82SYan, Zheng set_page_dirty(page); 29800257bb82SYan, Zheng 29810257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 29820257bb82SYan, Zheng page_start, page_end, GFP_NOFS); 29830257bb82SYan, Zheng unlock_page(page); 29840257bb82SYan, Zheng page_cache_release(page); 29850257bb82SYan, Zheng 29860257bb82SYan, Zheng index++; 2987efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 2988efa56464SYan, Zheng btrfs_throttle(BTRFS_I(inode)->root); 29890257bb82SYan, Zheng } 29900257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 2991efa56464SYan, Zheng out: 29920257bb82SYan, Zheng kfree(ra); 29930257bb82SYan, Zheng return ret; 29940257bb82SYan, Zheng } 29950257bb82SYan, Zheng 29960257bb82SYan, Zheng static noinline_for_stack 29970257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 29980257bb82SYan, Zheng struct file_extent_cluster *cluster) 29990257bb82SYan, Zheng { 30000257bb82SYan, Zheng int ret; 30010257bb82SYan, Zheng 30020257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 30030257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 30040257bb82SYan, Zheng if (ret) 30050257bb82SYan, Zheng return ret; 30060257bb82SYan, Zheng cluster->nr = 0; 30070257bb82SYan, Zheng } 30080257bb82SYan, Zheng 30090257bb82SYan, Zheng if (!cluster->nr) 30100257bb82SYan, Zheng cluster->start = extent_key->objectid; 30110257bb82SYan, Zheng else 30120257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 30130257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 30140257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 30150257bb82SYan, Zheng cluster->nr++; 30160257bb82SYan, Zheng 30170257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 30180257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 30190257bb82SYan, Zheng if (ret) 30200257bb82SYan, Zheng return ret; 30210257bb82SYan, Zheng cluster->nr = 0; 30220257bb82SYan, Zheng } 30230257bb82SYan, Zheng return 0; 30245d4f98a2SYan Zheng } 30255d4f98a2SYan Zheng 30265d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 30275d4f98a2SYan Zheng static int get_ref_objectid_v0(struct reloc_control *rc, 30285d4f98a2SYan Zheng struct btrfs_path *path, 30295d4f98a2SYan Zheng struct btrfs_key *extent_key, 30305d4f98a2SYan Zheng u64 *ref_objectid, int *path_change) 30315d4f98a2SYan Zheng { 30325d4f98a2SYan Zheng struct btrfs_key key; 30335d4f98a2SYan Zheng struct extent_buffer *leaf; 30345d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 30355d4f98a2SYan Zheng int ret; 30365d4f98a2SYan Zheng int slot; 30375d4f98a2SYan Zheng 30385d4f98a2SYan Zheng leaf = path->nodes[0]; 30395d4f98a2SYan Zheng slot = path->slots[0]; 30405d4f98a2SYan Zheng while (1) { 30415d4f98a2SYan Zheng if (slot >= btrfs_header_nritems(leaf)) { 30425d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 30435d4f98a2SYan Zheng if (ret < 0) 30445d4f98a2SYan Zheng return ret; 30455d4f98a2SYan Zheng BUG_ON(ret > 0); 30465d4f98a2SYan Zheng leaf = path->nodes[0]; 30475d4f98a2SYan Zheng slot = path->slots[0]; 30485d4f98a2SYan Zheng if (path_change) 30495d4f98a2SYan Zheng *path_change = 1; 30505d4f98a2SYan Zheng } 30515d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, slot); 30525d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 30535d4f98a2SYan Zheng return -ENOENT; 30545d4f98a2SYan Zheng 30555d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_REF_V0_KEY) { 30565d4f98a2SYan Zheng slot++; 30575d4f98a2SYan Zheng continue; 30585d4f98a2SYan Zheng } 30595d4f98a2SYan Zheng ref0 = btrfs_item_ptr(leaf, slot, 30605d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 30615d4f98a2SYan Zheng *ref_objectid = btrfs_ref_objectid_v0(leaf, ref0); 30625d4f98a2SYan Zheng break; 30635d4f98a2SYan Zheng } 30645d4f98a2SYan Zheng return 0; 30655d4f98a2SYan Zheng } 30665d4f98a2SYan Zheng #endif 30675d4f98a2SYan Zheng 30685d4f98a2SYan Zheng /* 30695d4f98a2SYan Zheng * helper to add a tree block to the list. 30705d4f98a2SYan Zheng * the major work is getting the generation and level of the block 30715d4f98a2SYan Zheng */ 30725d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 30735d4f98a2SYan Zheng struct btrfs_key *extent_key, 30745d4f98a2SYan Zheng struct btrfs_path *path, 30755d4f98a2SYan Zheng struct rb_root *blocks) 30765d4f98a2SYan Zheng { 30775d4f98a2SYan Zheng struct extent_buffer *eb; 30785d4f98a2SYan Zheng struct btrfs_extent_item *ei; 30795d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 30805d4f98a2SYan Zheng struct tree_block *block; 30815d4f98a2SYan Zheng struct rb_node *rb_node; 30825d4f98a2SYan Zheng u32 item_size; 30835d4f98a2SYan Zheng int level = -1; 30845d4f98a2SYan Zheng int generation; 30855d4f98a2SYan Zheng 30865d4f98a2SYan Zheng eb = path->nodes[0]; 30875d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 30885d4f98a2SYan Zheng 30895d4f98a2SYan Zheng if (item_size >= sizeof(*ei) + sizeof(*bi)) { 30905d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 30915d4f98a2SYan Zheng struct btrfs_extent_item); 30925d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 30935d4f98a2SYan Zheng generation = btrfs_extent_generation(eb, ei); 30945d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 30955d4f98a2SYan Zheng } else { 30965d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 30975d4f98a2SYan Zheng u64 ref_owner; 30985d4f98a2SYan Zheng int ret; 30995d4f98a2SYan Zheng 31005d4f98a2SYan Zheng BUG_ON(item_size != sizeof(struct btrfs_extent_item_v0)); 31015d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, extent_key, 31025d4f98a2SYan Zheng &ref_owner, NULL); 31035d4f98a2SYan Zheng BUG_ON(ref_owner >= BTRFS_MAX_LEVEL); 31045d4f98a2SYan Zheng level = (int)ref_owner; 31055d4f98a2SYan Zheng /* FIXME: get real generation */ 31065d4f98a2SYan Zheng generation = 0; 31075d4f98a2SYan Zheng #else 31085d4f98a2SYan Zheng BUG(); 31095d4f98a2SYan Zheng #endif 31105d4f98a2SYan Zheng } 31115d4f98a2SYan Zheng 31125d4f98a2SYan Zheng btrfs_release_path(rc->extent_root, path); 31135d4f98a2SYan Zheng 31145d4f98a2SYan Zheng BUG_ON(level == -1); 31155d4f98a2SYan Zheng 31165d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 31175d4f98a2SYan Zheng if (!block) 31185d4f98a2SYan Zheng return -ENOMEM; 31195d4f98a2SYan Zheng 31205d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 31215d4f98a2SYan Zheng block->key.objectid = extent_key->offset; 31225d4f98a2SYan Zheng block->key.offset = generation; 31235d4f98a2SYan Zheng block->level = level; 31245d4f98a2SYan Zheng block->key_ready = 0; 31255d4f98a2SYan Zheng 31265d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 31275d4f98a2SYan Zheng BUG_ON(rb_node); 31285d4f98a2SYan Zheng 31295d4f98a2SYan Zheng return 0; 31305d4f98a2SYan Zheng } 31315d4f98a2SYan Zheng 31325d4f98a2SYan Zheng /* 31335d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 31345d4f98a2SYan Zheng */ 31355d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 31365d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 31375d4f98a2SYan Zheng struct rb_root *blocks) 31385d4f98a2SYan Zheng { 31395d4f98a2SYan Zheng struct btrfs_path *path; 31405d4f98a2SYan Zheng struct btrfs_key key; 31415d4f98a2SYan Zheng int ret; 31425d4f98a2SYan Zheng 31435d4f98a2SYan Zheng if (tree_block_processed(bytenr, blocksize, rc)) 31445d4f98a2SYan Zheng return 0; 31455d4f98a2SYan Zheng 31465d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 31475d4f98a2SYan Zheng return 0; 31485d4f98a2SYan Zheng 31495d4f98a2SYan Zheng path = btrfs_alloc_path(); 31505d4f98a2SYan Zheng if (!path) 31515d4f98a2SYan Zheng return -ENOMEM; 31525d4f98a2SYan Zheng 31535d4f98a2SYan Zheng key.objectid = bytenr; 31545d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 31555d4f98a2SYan Zheng key.offset = blocksize; 31565d4f98a2SYan Zheng 31575d4f98a2SYan Zheng path->search_commit_root = 1; 31585d4f98a2SYan Zheng path->skip_locking = 1; 31595d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 31605d4f98a2SYan Zheng if (ret < 0) 31615d4f98a2SYan Zheng goto out; 31625d4f98a2SYan Zheng BUG_ON(ret); 31635d4f98a2SYan Zheng 31645d4f98a2SYan Zheng btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 31655d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 31665d4f98a2SYan Zheng out: 31675d4f98a2SYan Zheng btrfs_free_path(path); 31685d4f98a2SYan Zheng return ret; 31695d4f98a2SYan Zheng } 31705d4f98a2SYan Zheng 31715d4f98a2SYan Zheng /* 31725d4f98a2SYan Zheng * helper to check if the block use full backrefs for pointers in it 31735d4f98a2SYan Zheng */ 31745d4f98a2SYan Zheng static int block_use_full_backref(struct reloc_control *rc, 31755d4f98a2SYan Zheng struct extent_buffer *eb) 31765d4f98a2SYan Zheng { 31775d4f98a2SYan Zheng u64 flags; 31785d4f98a2SYan Zheng int ret; 31795d4f98a2SYan Zheng 31805d4f98a2SYan Zheng if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) || 31815d4f98a2SYan Zheng btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV) 31825d4f98a2SYan Zheng return 1; 31835d4f98a2SYan Zheng 31843fd0a558SYan, Zheng ret = btrfs_lookup_extent_info(NULL, rc->extent_root, 31853fd0a558SYan, Zheng eb->start, eb->len, NULL, &flags); 31865d4f98a2SYan Zheng BUG_ON(ret); 31875d4f98a2SYan Zheng 31885d4f98a2SYan Zheng if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) 31895d4f98a2SYan Zheng ret = 1; 31905d4f98a2SYan Zheng else 31915d4f98a2SYan Zheng ret = 0; 31925d4f98a2SYan Zheng return ret; 31935d4f98a2SYan Zheng } 31945d4f98a2SYan Zheng 31950af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 31960af3d00bSJosef Bacik struct inode *inode, u64 ino) 31970af3d00bSJosef Bacik { 31980af3d00bSJosef Bacik struct btrfs_key key; 31990af3d00bSJosef Bacik struct btrfs_path *path; 32000af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 32010af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 32020af3d00bSJosef Bacik unsigned long nr; 32030af3d00bSJosef Bacik int ret = 0; 32040af3d00bSJosef Bacik 32050af3d00bSJosef Bacik if (inode) 32060af3d00bSJosef Bacik goto truncate; 32070af3d00bSJosef Bacik 32080af3d00bSJosef Bacik key.objectid = ino; 32090af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 32100af3d00bSJosef Bacik key.offset = 0; 32110af3d00bSJosef Bacik 32120af3d00bSJosef Bacik inode = btrfs_iget(fs_info->sb, &key, root, NULL); 32130af3d00bSJosef Bacik if (!inode || IS_ERR(inode) || is_bad_inode(inode)) { 32140af3d00bSJosef Bacik if (inode && !IS_ERR(inode)) 32150af3d00bSJosef Bacik iput(inode); 32160af3d00bSJosef Bacik return -ENOENT; 32170af3d00bSJosef Bacik } 32180af3d00bSJosef Bacik 32190af3d00bSJosef Bacik truncate: 32200af3d00bSJosef Bacik path = btrfs_alloc_path(); 32210af3d00bSJosef Bacik if (!path) { 32220af3d00bSJosef Bacik ret = -ENOMEM; 32230af3d00bSJosef Bacik goto out; 32240af3d00bSJosef Bacik } 32250af3d00bSJosef Bacik 32260af3d00bSJosef Bacik trans = btrfs_join_transaction(root, 0); 32270af3d00bSJosef Bacik if (IS_ERR(trans)) { 32280af3d00bSJosef Bacik btrfs_free_path(path); 32290af3d00bSJosef Bacik goto out; 32300af3d00bSJosef Bacik } 32310af3d00bSJosef Bacik 32320af3d00bSJosef Bacik ret = btrfs_truncate_free_space_cache(root, trans, path, inode); 32330af3d00bSJosef Bacik 32340af3d00bSJosef Bacik btrfs_free_path(path); 32350af3d00bSJosef Bacik nr = trans->blocks_used; 32360af3d00bSJosef Bacik btrfs_end_transaction(trans, root); 32370af3d00bSJosef Bacik btrfs_btree_balance_dirty(root, nr); 32380af3d00bSJosef Bacik out: 32390af3d00bSJosef Bacik iput(inode); 32400af3d00bSJosef Bacik return ret; 32410af3d00bSJosef Bacik } 32420af3d00bSJosef Bacik 32435d4f98a2SYan Zheng /* 32445d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY 32455d4f98a2SYan Zheng * this function scans fs tree to find blocks reference the data extent 32465d4f98a2SYan Zheng */ 32475d4f98a2SYan Zheng static int find_data_references(struct reloc_control *rc, 32485d4f98a2SYan Zheng struct btrfs_key *extent_key, 32495d4f98a2SYan Zheng struct extent_buffer *leaf, 32505d4f98a2SYan Zheng struct btrfs_extent_data_ref *ref, 32515d4f98a2SYan Zheng struct rb_root *blocks) 32525d4f98a2SYan Zheng { 32535d4f98a2SYan Zheng struct btrfs_path *path; 32545d4f98a2SYan Zheng struct tree_block *block; 32555d4f98a2SYan Zheng struct btrfs_root *root; 32565d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 32575d4f98a2SYan Zheng struct rb_node *rb_node; 32585d4f98a2SYan Zheng struct btrfs_key key; 32595d4f98a2SYan Zheng u64 ref_root; 32605d4f98a2SYan Zheng u64 ref_objectid; 32615d4f98a2SYan Zheng u64 ref_offset; 32625d4f98a2SYan Zheng u32 ref_count; 32635d4f98a2SYan Zheng u32 nritems; 32645d4f98a2SYan Zheng int err = 0; 32655d4f98a2SYan Zheng int added = 0; 32665d4f98a2SYan Zheng int counted; 32675d4f98a2SYan Zheng int ret; 32685d4f98a2SYan Zheng 32695d4f98a2SYan Zheng ref_root = btrfs_extent_data_ref_root(leaf, ref); 32705d4f98a2SYan Zheng ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref); 32715d4f98a2SYan Zheng ref_offset = btrfs_extent_data_ref_offset(leaf, ref); 32725d4f98a2SYan Zheng ref_count = btrfs_extent_data_ref_count(leaf, ref); 32735d4f98a2SYan Zheng 32740af3d00bSJosef Bacik /* 32750af3d00bSJosef Bacik * This is an extent belonging to the free space cache, lets just delete 32760af3d00bSJosef Bacik * it and redo the search. 32770af3d00bSJosef Bacik */ 32780af3d00bSJosef Bacik if (ref_root == BTRFS_ROOT_TREE_OBJECTID) { 32790af3d00bSJosef Bacik ret = delete_block_group_cache(rc->extent_root->fs_info, 32800af3d00bSJosef Bacik NULL, ref_objectid); 32810af3d00bSJosef Bacik if (ret != -ENOENT) 32820af3d00bSJosef Bacik return ret; 32830af3d00bSJosef Bacik ret = 0; 32840af3d00bSJosef Bacik } 32850af3d00bSJosef Bacik 32860af3d00bSJosef Bacik path = btrfs_alloc_path(); 32870af3d00bSJosef Bacik if (!path) 32880af3d00bSJosef Bacik return -ENOMEM; 32890af3d00bSJosef Bacik 32905d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, ref_root); 32915d4f98a2SYan Zheng if (IS_ERR(root)) { 32925d4f98a2SYan Zheng err = PTR_ERR(root); 32935d4f98a2SYan Zheng goto out; 32945d4f98a2SYan Zheng } 32955d4f98a2SYan Zheng 32965d4f98a2SYan Zheng key.objectid = ref_objectid; 32975d4f98a2SYan Zheng key.offset = ref_offset; 32985d4f98a2SYan Zheng key.type = BTRFS_EXTENT_DATA_KEY; 32995d4f98a2SYan Zheng 33005d4f98a2SYan Zheng path->search_commit_root = 1; 33015d4f98a2SYan Zheng path->skip_locking = 1; 33025d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 33035d4f98a2SYan Zheng if (ret < 0) { 33045d4f98a2SYan Zheng err = ret; 33055d4f98a2SYan Zheng goto out; 33065d4f98a2SYan Zheng } 33075d4f98a2SYan Zheng 33085d4f98a2SYan Zheng leaf = path->nodes[0]; 33095d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 33105d4f98a2SYan Zheng /* 33115d4f98a2SYan Zheng * the references in tree blocks that use full backrefs 33125d4f98a2SYan Zheng * are not counted in 33135d4f98a2SYan Zheng */ 33145d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 33155d4f98a2SYan Zheng counted = 0; 33165d4f98a2SYan Zheng else 33175d4f98a2SYan Zheng counted = 1; 33185d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 33195d4f98a2SYan Zheng if (rb_node) { 33205d4f98a2SYan Zheng if (counted) 33215d4f98a2SYan Zheng added = 1; 33225d4f98a2SYan Zheng else 33235d4f98a2SYan Zheng path->slots[0] = nritems; 33245d4f98a2SYan Zheng } 33255d4f98a2SYan Zheng 33265d4f98a2SYan Zheng while (ref_count > 0) { 33275d4f98a2SYan Zheng while (path->slots[0] >= nritems) { 33285d4f98a2SYan Zheng ret = btrfs_next_leaf(root, path); 33295d4f98a2SYan Zheng if (ret < 0) { 33305d4f98a2SYan Zheng err = ret; 33315d4f98a2SYan Zheng goto out; 33325d4f98a2SYan Zheng } 33335d4f98a2SYan Zheng if (ret > 0) { 33345d4f98a2SYan Zheng WARN_ON(1); 33355d4f98a2SYan Zheng goto out; 33365d4f98a2SYan Zheng } 33375d4f98a2SYan Zheng 33385d4f98a2SYan Zheng leaf = path->nodes[0]; 33395d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 33405d4f98a2SYan Zheng added = 0; 33415d4f98a2SYan Zheng 33425d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 33435d4f98a2SYan Zheng counted = 0; 33445d4f98a2SYan Zheng else 33455d4f98a2SYan Zheng counted = 1; 33465d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 33475d4f98a2SYan Zheng if (rb_node) { 33485d4f98a2SYan Zheng if (counted) 33495d4f98a2SYan Zheng added = 1; 33505d4f98a2SYan Zheng else 33515d4f98a2SYan Zheng path->slots[0] = nritems; 33525d4f98a2SYan Zheng } 33535d4f98a2SYan Zheng } 33545d4f98a2SYan Zheng 33555d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 33565d4f98a2SYan Zheng if (key.objectid != ref_objectid || 33575d4f98a2SYan Zheng key.type != BTRFS_EXTENT_DATA_KEY) { 33585d4f98a2SYan Zheng WARN_ON(1); 33595d4f98a2SYan Zheng break; 33605d4f98a2SYan Zheng } 33615d4f98a2SYan Zheng 33625d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 33635d4f98a2SYan Zheng struct btrfs_file_extent_item); 33645d4f98a2SYan Zheng 33655d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 33665d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 33675d4f98a2SYan Zheng goto next; 33685d4f98a2SYan Zheng 33695d4f98a2SYan Zheng if (btrfs_file_extent_disk_bytenr(leaf, fi) != 33705d4f98a2SYan Zheng extent_key->objectid) 33715d4f98a2SYan Zheng goto next; 33725d4f98a2SYan Zheng 33735d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 33745d4f98a2SYan Zheng if (key.offset != ref_offset) 33755d4f98a2SYan Zheng goto next; 33765d4f98a2SYan Zheng 33775d4f98a2SYan Zheng if (counted) 33785d4f98a2SYan Zheng ref_count--; 33795d4f98a2SYan Zheng if (added) 33805d4f98a2SYan Zheng goto next; 33815d4f98a2SYan Zheng 33825d4f98a2SYan Zheng if (!tree_block_processed(leaf->start, leaf->len, rc)) { 33835d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 33845d4f98a2SYan Zheng if (!block) { 33855d4f98a2SYan Zheng err = -ENOMEM; 33865d4f98a2SYan Zheng break; 33875d4f98a2SYan Zheng } 33885d4f98a2SYan Zheng block->bytenr = leaf->start; 33895d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &block->key, 0); 33905d4f98a2SYan Zheng block->level = 0; 33915d4f98a2SYan Zheng block->key_ready = 1; 33925d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, 33935d4f98a2SYan Zheng &block->rb_node); 33945d4f98a2SYan Zheng BUG_ON(rb_node); 33955d4f98a2SYan Zheng } 33965d4f98a2SYan Zheng if (counted) 33975d4f98a2SYan Zheng added = 1; 33985d4f98a2SYan Zheng else 33995d4f98a2SYan Zheng path->slots[0] = nritems; 34005d4f98a2SYan Zheng next: 34015d4f98a2SYan Zheng path->slots[0]++; 34025d4f98a2SYan Zheng 34035d4f98a2SYan Zheng } 34045d4f98a2SYan Zheng out: 34055d4f98a2SYan Zheng btrfs_free_path(path); 34065d4f98a2SYan Zheng return err; 34075d4f98a2SYan Zheng } 34085d4f98a2SYan Zheng 34095d4f98a2SYan Zheng /* 34105d4f98a2SYan Zheng * hepler to find all tree blocks that reference a given data extent 34115d4f98a2SYan Zheng */ 34125d4f98a2SYan Zheng static noinline_for_stack 34135d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 34145d4f98a2SYan Zheng struct btrfs_key *extent_key, 34155d4f98a2SYan Zheng struct btrfs_path *path, 34165d4f98a2SYan Zheng struct rb_root *blocks) 34175d4f98a2SYan Zheng { 34185d4f98a2SYan Zheng struct btrfs_key key; 34195d4f98a2SYan Zheng struct extent_buffer *eb; 34205d4f98a2SYan Zheng struct btrfs_extent_data_ref *dref; 34215d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 34225d4f98a2SYan Zheng unsigned long ptr; 34235d4f98a2SYan Zheng unsigned long end; 34243fd0a558SYan, Zheng u32 blocksize = btrfs_level_size(rc->extent_root, 0); 34255d4f98a2SYan Zheng int ret; 34265d4f98a2SYan Zheng int err = 0; 34275d4f98a2SYan Zheng 34285d4f98a2SYan Zheng eb = path->nodes[0]; 34295d4f98a2SYan Zheng ptr = btrfs_item_ptr_offset(eb, path->slots[0]); 34305d4f98a2SYan Zheng end = ptr + btrfs_item_size_nr(eb, path->slots[0]); 34315d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 34325d4f98a2SYan Zheng if (ptr + sizeof(struct btrfs_extent_item_v0) == end) 34335d4f98a2SYan Zheng ptr = end; 34345d4f98a2SYan Zheng else 34355d4f98a2SYan Zheng #endif 34365d4f98a2SYan Zheng ptr += sizeof(struct btrfs_extent_item); 34375d4f98a2SYan Zheng 34385d4f98a2SYan Zheng while (ptr < end) { 34395d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 34405d4f98a2SYan Zheng key.type = btrfs_extent_inline_ref_type(eb, iref); 34415d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 34425d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 34435d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 34445d4f98a2SYan Zheng blocks); 34455d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 34465d4f98a2SYan Zheng dref = (struct btrfs_extent_data_ref *)(&iref->offset); 34475d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 34485d4f98a2SYan Zheng eb, dref, blocks); 34495d4f98a2SYan Zheng } else { 34505d4f98a2SYan Zheng BUG(); 34515d4f98a2SYan Zheng } 34525d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 34535d4f98a2SYan Zheng } 34545d4f98a2SYan Zheng WARN_ON(ptr > end); 34555d4f98a2SYan Zheng 34565d4f98a2SYan Zheng while (1) { 34575d4f98a2SYan Zheng cond_resched(); 34585d4f98a2SYan Zheng eb = path->nodes[0]; 34595d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(eb)) { 34605d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 34615d4f98a2SYan Zheng if (ret < 0) { 34625d4f98a2SYan Zheng err = ret; 34635d4f98a2SYan Zheng break; 34645d4f98a2SYan Zheng } 34655d4f98a2SYan Zheng if (ret > 0) 34665d4f98a2SYan Zheng break; 34675d4f98a2SYan Zheng eb = path->nodes[0]; 34685d4f98a2SYan Zheng } 34695d4f98a2SYan Zheng 34705d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path->slots[0]); 34715d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 34725d4f98a2SYan Zheng break; 34735d4f98a2SYan Zheng 34745d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 34755d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY || 34765d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 34775d4f98a2SYan Zheng #else 34785d4f98a2SYan Zheng BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY); 34795d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 34805d4f98a2SYan Zheng #endif 34815d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 34825d4f98a2SYan Zheng blocks); 34835d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 34845d4f98a2SYan Zheng dref = btrfs_item_ptr(eb, path->slots[0], 34855d4f98a2SYan Zheng struct btrfs_extent_data_ref); 34865d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 34875d4f98a2SYan Zheng eb, dref, blocks); 34885d4f98a2SYan Zheng } else { 34895d4f98a2SYan Zheng ret = 0; 34905d4f98a2SYan Zheng } 34915d4f98a2SYan Zheng if (ret) { 34925d4f98a2SYan Zheng err = ret; 34935d4f98a2SYan Zheng break; 34945d4f98a2SYan Zheng } 34955d4f98a2SYan Zheng path->slots[0]++; 34965d4f98a2SYan Zheng } 34975d4f98a2SYan Zheng btrfs_release_path(rc->extent_root, path); 34985d4f98a2SYan Zheng if (err) 34995d4f98a2SYan Zheng free_block_list(blocks); 35005d4f98a2SYan Zheng return err; 35015d4f98a2SYan Zheng } 35025d4f98a2SYan Zheng 35035d4f98a2SYan Zheng /* 35045d4f98a2SYan Zheng * hepler to find next unprocessed extent 35055d4f98a2SYan Zheng */ 35065d4f98a2SYan Zheng static noinline_for_stack 35075d4f98a2SYan Zheng int find_next_extent(struct btrfs_trans_handle *trans, 35083fd0a558SYan, Zheng struct reloc_control *rc, struct btrfs_path *path, 35093fd0a558SYan, Zheng struct btrfs_key *extent_key) 35105d4f98a2SYan Zheng { 35115d4f98a2SYan Zheng struct btrfs_key key; 35125d4f98a2SYan Zheng struct extent_buffer *leaf; 35135d4f98a2SYan Zheng u64 start, end, last; 35145d4f98a2SYan Zheng int ret; 35155d4f98a2SYan Zheng 35165d4f98a2SYan Zheng last = rc->block_group->key.objectid + rc->block_group->key.offset; 35175d4f98a2SYan Zheng while (1) { 35185d4f98a2SYan Zheng cond_resched(); 35195d4f98a2SYan Zheng if (rc->search_start >= last) { 35205d4f98a2SYan Zheng ret = 1; 35215d4f98a2SYan Zheng break; 35225d4f98a2SYan Zheng } 35235d4f98a2SYan Zheng 35245d4f98a2SYan Zheng key.objectid = rc->search_start; 35255d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 35265d4f98a2SYan Zheng key.offset = 0; 35275d4f98a2SYan Zheng 35285d4f98a2SYan Zheng path->search_commit_root = 1; 35295d4f98a2SYan Zheng path->skip_locking = 1; 35305d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 35315d4f98a2SYan Zheng 0, 0); 35325d4f98a2SYan Zheng if (ret < 0) 35335d4f98a2SYan Zheng break; 35345d4f98a2SYan Zheng next: 35355d4f98a2SYan Zheng leaf = path->nodes[0]; 35365d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 35375d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 35385d4f98a2SYan Zheng if (ret != 0) 35395d4f98a2SYan Zheng break; 35405d4f98a2SYan Zheng leaf = path->nodes[0]; 35415d4f98a2SYan Zheng } 35425d4f98a2SYan Zheng 35435d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 35445d4f98a2SYan Zheng if (key.objectid >= last) { 35455d4f98a2SYan Zheng ret = 1; 35465d4f98a2SYan Zheng break; 35475d4f98a2SYan Zheng } 35485d4f98a2SYan Zheng 35495d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_ITEM_KEY || 35505d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 35515d4f98a2SYan Zheng path->slots[0]++; 35525d4f98a2SYan Zheng goto next; 35535d4f98a2SYan Zheng } 35545d4f98a2SYan Zheng 35555d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 35565d4f98a2SYan Zheng key.objectid, &start, &end, 35575d4f98a2SYan Zheng EXTENT_DIRTY); 35585d4f98a2SYan Zheng 35595d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 35605d4f98a2SYan Zheng btrfs_release_path(rc->extent_root, path); 35615d4f98a2SYan Zheng rc->search_start = end + 1; 35625d4f98a2SYan Zheng } else { 35635d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 35643fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 35655d4f98a2SYan Zheng return 0; 35665d4f98a2SYan Zheng } 35675d4f98a2SYan Zheng } 35685d4f98a2SYan Zheng btrfs_release_path(rc->extent_root, path); 35695d4f98a2SYan Zheng return ret; 35705d4f98a2SYan Zheng } 35715d4f98a2SYan Zheng 35725d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 35735d4f98a2SYan Zheng { 35745d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 35755d4f98a2SYan Zheng mutex_lock(&fs_info->trans_mutex); 35765d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 35775d4f98a2SYan Zheng mutex_unlock(&fs_info->trans_mutex); 35785d4f98a2SYan Zheng } 35795d4f98a2SYan Zheng 35805d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 35815d4f98a2SYan Zheng { 35825d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 35835d4f98a2SYan Zheng mutex_lock(&fs_info->trans_mutex); 35845d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 35855d4f98a2SYan Zheng mutex_unlock(&fs_info->trans_mutex); 35865d4f98a2SYan Zheng } 35875d4f98a2SYan Zheng 35885d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 35895d4f98a2SYan Zheng { 35905d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 35915d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 35925d4f98a2SYan Zheng return 1; 35935d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 35945d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 35955d4f98a2SYan Zheng return 1; 35965d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 35975d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 35985d4f98a2SYan Zheng return 1; 35995d4f98a2SYan Zheng return 0; 36005d4f98a2SYan Zheng } 36015d4f98a2SYan Zheng 36023fd0a558SYan, Zheng static noinline_for_stack 36033fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 36043fd0a558SYan, Zheng { 36053fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 36063fd0a558SYan, Zheng int ret; 36073fd0a558SYan, Zheng 36083fd0a558SYan, Zheng rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root); 36093fd0a558SYan, Zheng if (!rc->block_rsv) 36103fd0a558SYan, Zheng return -ENOMEM; 36113fd0a558SYan, Zheng 36123fd0a558SYan, Zheng /* 36133fd0a558SYan, Zheng * reserve some space for creating reloc trees. 36143fd0a558SYan, Zheng * btrfs_init_reloc_root will use them when there 36153fd0a558SYan, Zheng * is no reservation in transaction handle. 36163fd0a558SYan, Zheng */ 36173fd0a558SYan, Zheng ret = btrfs_block_rsv_add(NULL, rc->extent_root, rc->block_rsv, 36183fd0a558SYan, Zheng rc->extent_root->nodesize * 256, 36193fd0a558SYan, Zheng &rc->block_rsv_retries); 36203fd0a558SYan, Zheng if (ret) 36213fd0a558SYan, Zheng return ret; 36223fd0a558SYan, Zheng 36233fd0a558SYan, Zheng rc->block_rsv->refill_used = 1; 36243fd0a558SYan, Zheng btrfs_add_durable_block_rsv(rc->extent_root->fs_info, rc->block_rsv); 36253fd0a558SYan, Zheng 36263fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 36273fd0a558SYan, Zheng rc->search_start = rc->block_group->key.objectid; 36283fd0a558SYan, Zheng rc->extents_found = 0; 36293fd0a558SYan, Zheng rc->nodes_relocated = 0; 36303fd0a558SYan, Zheng rc->merging_rsv_size = 0; 36313fd0a558SYan, Zheng rc->block_rsv_retries = 0; 36323fd0a558SYan, Zheng 36333fd0a558SYan, Zheng rc->create_reloc_tree = 1; 36343fd0a558SYan, Zheng set_reloc_control(rc); 36353fd0a558SYan, Zheng 36363fd0a558SYan, Zheng trans = btrfs_join_transaction(rc->extent_root, 1); 36373fd0a558SYan, Zheng btrfs_commit_transaction(trans, rc->extent_root); 36383fd0a558SYan, Zheng return 0; 36393fd0a558SYan, Zheng } 364076dda93cSYan, Zheng 36415d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 36425d4f98a2SYan Zheng { 36435d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 36445d4f98a2SYan Zheng struct btrfs_key key; 36455d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 36465d4f98a2SYan Zheng struct btrfs_path *path; 36475d4f98a2SYan Zheng struct btrfs_extent_item *ei; 36485d4f98a2SYan Zheng unsigned long nr; 36495d4f98a2SYan Zheng u64 flags; 36505d4f98a2SYan Zheng u32 item_size; 36515d4f98a2SYan Zheng int ret; 36525d4f98a2SYan Zheng int err = 0; 36535d4f98a2SYan Zheng 36545d4f98a2SYan Zheng path = btrfs_alloc_path(); 36553fd0a558SYan, Zheng if (!path) 36565d4f98a2SYan Zheng return -ENOMEM; 36573fd0a558SYan, Zheng 36583fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 36593fd0a558SYan, Zheng if (ret) { 36603fd0a558SYan, Zheng err = ret; 36613fd0a558SYan, Zheng goto out_free; 36622423fdfbSJiri Slaby } 36635d4f98a2SYan Zheng 36645d4f98a2SYan Zheng while (1) { 3665a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 36665d4f98a2SYan Zheng 36673fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 36683fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 36693fd0a558SYan, Zheng continue; 36703fd0a558SYan, Zheng } 36713fd0a558SYan, Zheng 36723fd0a558SYan, Zheng ret = find_next_extent(trans, rc, path, &key); 36735d4f98a2SYan Zheng if (ret < 0) 36745d4f98a2SYan Zheng err = ret; 36755d4f98a2SYan Zheng if (ret != 0) 36765d4f98a2SYan Zheng break; 36775d4f98a2SYan Zheng 36785d4f98a2SYan Zheng rc->extents_found++; 36795d4f98a2SYan Zheng 36805d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 36815d4f98a2SYan Zheng struct btrfs_extent_item); 36823fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 36835d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 36845d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 36855d4f98a2SYan Zheng ret = check_extent_flags(flags); 36865d4f98a2SYan Zheng BUG_ON(ret); 36875d4f98a2SYan Zheng 36885d4f98a2SYan Zheng } else { 36895d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 36905d4f98a2SYan Zheng u64 ref_owner; 36915d4f98a2SYan Zheng int path_change = 0; 36925d4f98a2SYan Zheng 36935d4f98a2SYan Zheng BUG_ON(item_size != 36945d4f98a2SYan Zheng sizeof(struct btrfs_extent_item_v0)); 36955d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, &key, &ref_owner, 36965d4f98a2SYan Zheng &path_change); 36975d4f98a2SYan Zheng if (ref_owner < BTRFS_FIRST_FREE_OBJECTID) 36985d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_TREE_BLOCK; 36995d4f98a2SYan Zheng else 37005d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_DATA; 37015d4f98a2SYan Zheng 37025d4f98a2SYan Zheng if (path_change) { 37035d4f98a2SYan Zheng btrfs_release_path(rc->extent_root, path); 37045d4f98a2SYan Zheng 37055d4f98a2SYan Zheng path->search_commit_root = 1; 37065d4f98a2SYan Zheng path->skip_locking = 1; 37075d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, 37085d4f98a2SYan Zheng &key, path, 0, 0); 37095d4f98a2SYan Zheng if (ret < 0) { 37105d4f98a2SYan Zheng err = ret; 37115d4f98a2SYan Zheng break; 37125d4f98a2SYan Zheng } 37135d4f98a2SYan Zheng BUG_ON(ret > 0); 37145d4f98a2SYan Zheng } 37155d4f98a2SYan Zheng #else 37165d4f98a2SYan Zheng BUG(); 37175d4f98a2SYan Zheng #endif 37185d4f98a2SYan Zheng } 37195d4f98a2SYan Zheng 37205d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 37215d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 37225d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 37235d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 37245d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 37255d4f98a2SYan Zheng } else { 37265d4f98a2SYan Zheng btrfs_release_path(rc->extent_root, path); 37275d4f98a2SYan Zheng ret = 0; 37285d4f98a2SYan Zheng } 37295d4f98a2SYan Zheng if (ret < 0) { 37303fd0a558SYan, Zheng err = ret; 37315d4f98a2SYan Zheng break; 37325d4f98a2SYan Zheng } 37335d4f98a2SYan Zheng 37345d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 37355d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 37365d4f98a2SYan Zheng if (ret < 0) { 37373fd0a558SYan, Zheng if (ret != -EAGAIN) { 37385d4f98a2SYan Zheng err = ret; 37395d4f98a2SYan Zheng break; 37405d4f98a2SYan Zheng } 37413fd0a558SYan, Zheng rc->extents_found--; 37423fd0a558SYan, Zheng rc->search_start = key.objectid; 37433fd0a558SYan, Zheng } 37445d4f98a2SYan Zheng } 37455d4f98a2SYan Zheng 37463fd0a558SYan, Zheng ret = btrfs_block_rsv_check(trans, rc->extent_root, 37473fd0a558SYan, Zheng rc->block_rsv, 0, 5); 37483fd0a558SYan, Zheng if (ret < 0) { 37493fd0a558SYan, Zheng if (ret != -EAGAIN) { 37503fd0a558SYan, Zheng err = ret; 37513fd0a558SYan, Zheng WARN_ON(1); 37523fd0a558SYan, Zheng break; 37533fd0a558SYan, Zheng } 37543fd0a558SYan, Zheng rc->commit_transaction = 1; 37553fd0a558SYan, Zheng } 37563fd0a558SYan, Zheng 37573fd0a558SYan, Zheng if (rc->commit_transaction) { 37583fd0a558SYan, Zheng rc->commit_transaction = 0; 37593fd0a558SYan, Zheng ret = btrfs_commit_transaction(trans, rc->extent_root); 37603fd0a558SYan, Zheng BUG_ON(ret); 37613fd0a558SYan, Zheng } else { 37625d4f98a2SYan Zheng nr = trans->blocks_used; 37633fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, rc->extent_root); 37645d4f98a2SYan Zheng btrfs_btree_balance_dirty(rc->extent_root, nr); 37653fd0a558SYan, Zheng } 37663fd0a558SYan, Zheng trans = NULL; 37675d4f98a2SYan Zheng 37685d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 37695d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 37705d4f98a2SYan Zheng rc->found_file_extent = 1; 37710257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 37723fd0a558SYan, Zheng &key, &rc->cluster); 37735d4f98a2SYan Zheng if (ret < 0) { 37745d4f98a2SYan Zheng err = ret; 37755d4f98a2SYan Zheng break; 37765d4f98a2SYan Zheng } 37775d4f98a2SYan Zheng } 37785d4f98a2SYan Zheng } 37793fd0a558SYan, Zheng 37803fd0a558SYan, Zheng btrfs_release_path(rc->extent_root, path); 37813fd0a558SYan, Zheng clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY, 37823fd0a558SYan, Zheng GFP_NOFS); 37835d4f98a2SYan Zheng 37845d4f98a2SYan Zheng if (trans) { 37855d4f98a2SYan Zheng nr = trans->blocks_used; 37863fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, rc->extent_root); 37875d4f98a2SYan Zheng btrfs_btree_balance_dirty(rc->extent_root, nr); 37885d4f98a2SYan Zheng } 37895d4f98a2SYan Zheng 37900257bb82SYan, Zheng if (!err) { 37913fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 37923fd0a558SYan, Zheng &rc->cluster); 37930257bb82SYan, Zheng if (ret < 0) 37940257bb82SYan, Zheng err = ret; 37950257bb82SYan, Zheng } 37960257bb82SYan, Zheng 37973fd0a558SYan, Zheng rc->create_reloc_tree = 0; 37983fd0a558SYan, Zheng set_reloc_control(rc); 37990257bb82SYan, Zheng 38003fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 38013fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1); 38025d4f98a2SYan Zheng 38033fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 38045d4f98a2SYan Zheng 38055d4f98a2SYan Zheng merge_reloc_roots(rc); 38065d4f98a2SYan Zheng 38073fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 38085d4f98a2SYan Zheng unset_reloc_control(rc); 38093fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1); 38105d4f98a2SYan Zheng 38115d4f98a2SYan Zheng /* get rid of pinned extents */ 3812a22285a6SYan, Zheng trans = btrfs_join_transaction(rc->extent_root, 1); 38135d4f98a2SYan Zheng btrfs_commit_transaction(trans, rc->extent_root); 38143fd0a558SYan, Zheng out_free: 38153fd0a558SYan, Zheng btrfs_free_block_rsv(rc->extent_root, rc->block_rsv); 38163fd0a558SYan, Zheng btrfs_free_path(path); 38175d4f98a2SYan Zheng return err; 38185d4f98a2SYan Zheng } 38195d4f98a2SYan Zheng 38205d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 38210257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 38225d4f98a2SYan Zheng { 38235d4f98a2SYan Zheng struct btrfs_path *path; 38245d4f98a2SYan Zheng struct btrfs_inode_item *item; 38255d4f98a2SYan Zheng struct extent_buffer *leaf; 38265d4f98a2SYan Zheng int ret; 38275d4f98a2SYan Zheng 38285d4f98a2SYan Zheng path = btrfs_alloc_path(); 38295d4f98a2SYan Zheng if (!path) 38305d4f98a2SYan Zheng return -ENOMEM; 38315d4f98a2SYan Zheng 38325d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 38335d4f98a2SYan Zheng if (ret) 38345d4f98a2SYan Zheng goto out; 38355d4f98a2SYan Zheng 38365d4f98a2SYan Zheng leaf = path->nodes[0]; 38375d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 38385d4f98a2SYan Zheng memset_extent_buffer(leaf, 0, (unsigned long)item, sizeof(*item)); 38395d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 38400257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 38415d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 38423fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 38433fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 38445d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 38455d4f98a2SYan Zheng btrfs_release_path(root, path); 38465d4f98a2SYan Zheng out: 38475d4f98a2SYan Zheng btrfs_free_path(path); 38485d4f98a2SYan Zheng return ret; 38495d4f98a2SYan Zheng } 38505d4f98a2SYan Zheng 38515d4f98a2SYan Zheng /* 38525d4f98a2SYan Zheng * helper to create inode for data relocation. 38535d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 38545d4f98a2SYan Zheng */ 38553fd0a558SYan, Zheng static noinline_for_stack 38563fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 38575d4f98a2SYan Zheng struct btrfs_block_group_cache *group) 38585d4f98a2SYan Zheng { 38595d4f98a2SYan Zheng struct inode *inode = NULL; 38605d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 38615d4f98a2SYan Zheng struct btrfs_root *root; 38625d4f98a2SYan Zheng struct btrfs_key key; 38635d4f98a2SYan Zheng unsigned long nr; 38645d4f98a2SYan Zheng u64 objectid = BTRFS_FIRST_FREE_OBJECTID; 38655d4f98a2SYan Zheng int err = 0; 38665d4f98a2SYan Zheng 38675d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 38685d4f98a2SYan Zheng if (IS_ERR(root)) 38695d4f98a2SYan Zheng return ERR_CAST(root); 38705d4f98a2SYan Zheng 3871a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 38723fd0a558SYan, Zheng if (IS_ERR(trans)) 38733fd0a558SYan, Zheng return ERR_CAST(trans); 38745d4f98a2SYan Zheng 38755d4f98a2SYan Zheng err = btrfs_find_free_objectid(trans, root, objectid, &objectid); 38765d4f98a2SYan Zheng if (err) 38775d4f98a2SYan Zheng goto out; 38785d4f98a2SYan Zheng 38790257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 38805d4f98a2SYan Zheng BUG_ON(err); 38815d4f98a2SYan Zheng 38825d4f98a2SYan Zheng key.objectid = objectid; 38835d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 38845d4f98a2SYan Zheng key.offset = 0; 388573f73415SJosef Bacik inode = btrfs_iget(root->fs_info->sb, &key, root, NULL); 38865d4f98a2SYan Zheng BUG_ON(IS_ERR(inode) || is_bad_inode(inode)); 38875d4f98a2SYan Zheng BTRFS_I(inode)->index_cnt = group->key.objectid; 38885d4f98a2SYan Zheng 38895d4f98a2SYan Zheng err = btrfs_orphan_add(trans, inode); 38905d4f98a2SYan Zheng out: 38915d4f98a2SYan Zheng nr = trans->blocks_used; 38925d4f98a2SYan Zheng btrfs_end_transaction(trans, root); 38935d4f98a2SYan Zheng btrfs_btree_balance_dirty(root, nr); 38945d4f98a2SYan Zheng if (err) { 38955d4f98a2SYan Zheng if (inode) 38965d4f98a2SYan Zheng iput(inode); 38975d4f98a2SYan Zheng inode = ERR_PTR(err); 38985d4f98a2SYan Zheng } 38995d4f98a2SYan Zheng return inode; 39005d4f98a2SYan Zheng } 39015d4f98a2SYan Zheng 39023fd0a558SYan, Zheng static struct reloc_control *alloc_reloc_control(void) 39033fd0a558SYan, Zheng { 39043fd0a558SYan, Zheng struct reloc_control *rc; 39053fd0a558SYan, Zheng 39063fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 39073fd0a558SYan, Zheng if (!rc) 39083fd0a558SYan, Zheng return NULL; 39093fd0a558SYan, Zheng 39103fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 39113fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 39123fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 39133fd0a558SYan, Zheng extent_io_tree_init(&rc->processed_blocks, NULL, GFP_NOFS); 39143fd0a558SYan, Zheng return rc; 39153fd0a558SYan, Zheng } 39163fd0a558SYan, Zheng 39175d4f98a2SYan Zheng /* 39185d4f98a2SYan Zheng * function to relocate all extents in a block group. 39195d4f98a2SYan Zheng */ 39205d4f98a2SYan Zheng int btrfs_relocate_block_group(struct btrfs_root *extent_root, u64 group_start) 39215d4f98a2SYan Zheng { 39225d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = extent_root->fs_info; 39235d4f98a2SYan Zheng struct reloc_control *rc; 39240af3d00bSJosef Bacik struct inode *inode; 39250af3d00bSJosef Bacik struct btrfs_path *path; 39265d4f98a2SYan Zheng int ret; 3927f0486c68SYan, Zheng int rw = 0; 39285d4f98a2SYan Zheng int err = 0; 39295d4f98a2SYan Zheng 39303fd0a558SYan, Zheng rc = alloc_reloc_control(); 39315d4f98a2SYan Zheng if (!rc) 39325d4f98a2SYan Zheng return -ENOMEM; 39335d4f98a2SYan Zheng 3934f0486c68SYan, Zheng rc->extent_root = extent_root; 39353fd0a558SYan, Zheng 39365d4f98a2SYan Zheng rc->block_group = btrfs_lookup_block_group(fs_info, group_start); 39375d4f98a2SYan Zheng BUG_ON(!rc->block_group); 39385d4f98a2SYan Zheng 3939f0486c68SYan, Zheng if (!rc->block_group->ro) { 3940f0486c68SYan, Zheng ret = btrfs_set_block_group_ro(extent_root, rc->block_group); 3941f0486c68SYan, Zheng if (ret) { 3942f0486c68SYan, Zheng err = ret; 3943f0486c68SYan, Zheng goto out; 3944f0486c68SYan, Zheng } 3945f0486c68SYan, Zheng rw = 1; 3946f0486c68SYan, Zheng } 3947f0486c68SYan, Zheng 39480af3d00bSJosef Bacik path = btrfs_alloc_path(); 39490af3d00bSJosef Bacik if (!path) { 39500af3d00bSJosef Bacik err = -ENOMEM; 39510af3d00bSJosef Bacik goto out; 39520af3d00bSJosef Bacik } 39530af3d00bSJosef Bacik 39540af3d00bSJosef Bacik inode = lookup_free_space_inode(fs_info->tree_root, rc->block_group, 39550af3d00bSJosef Bacik path); 39560af3d00bSJosef Bacik btrfs_free_path(path); 39570af3d00bSJosef Bacik 39580af3d00bSJosef Bacik if (!IS_ERR(inode)) 39590af3d00bSJosef Bacik ret = delete_block_group_cache(fs_info, inode, 0); 39600af3d00bSJosef Bacik else 39610af3d00bSJosef Bacik ret = PTR_ERR(inode); 39620af3d00bSJosef Bacik 39630af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 39640af3d00bSJosef Bacik err = ret; 39650af3d00bSJosef Bacik goto out; 39660af3d00bSJosef Bacik } 39670af3d00bSJosef Bacik 39685d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 39695d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 39705d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 39715d4f98a2SYan Zheng rc->data_inode = NULL; 39725d4f98a2SYan Zheng goto out; 39735d4f98a2SYan Zheng } 39745d4f98a2SYan Zheng 39755d4f98a2SYan Zheng printk(KERN_INFO "btrfs: relocating block group %llu flags %llu\n", 39765d4f98a2SYan Zheng (unsigned long long)rc->block_group->key.objectid, 39775d4f98a2SYan Zheng (unsigned long long)rc->block_group->flags); 39785d4f98a2SYan Zheng 397924bbcf04SYan, Zheng btrfs_start_delalloc_inodes(fs_info->tree_root, 0); 398024bbcf04SYan, Zheng btrfs_wait_ordered_extents(fs_info->tree_root, 0, 0); 39815d4f98a2SYan Zheng 39825d4f98a2SYan Zheng while (1) { 398376dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 398476dda93cSYan, Zheng 398576dda93cSYan, Zheng btrfs_clean_old_snapshots(fs_info->tree_root); 39865d4f98a2SYan Zheng ret = relocate_block_group(rc); 398776dda93cSYan, Zheng 398876dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 39895d4f98a2SYan Zheng if (ret < 0) { 39905d4f98a2SYan Zheng err = ret; 39913fd0a558SYan, Zheng goto out; 39925d4f98a2SYan Zheng } 39935d4f98a2SYan Zheng 39945d4f98a2SYan Zheng if (rc->extents_found == 0) 39955d4f98a2SYan Zheng break; 39965d4f98a2SYan Zheng 39975d4f98a2SYan Zheng printk(KERN_INFO "btrfs: found %llu extents\n", 39985d4f98a2SYan Zheng (unsigned long long)rc->extents_found); 39995d4f98a2SYan Zheng 40005d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 40015d4f98a2SYan Zheng btrfs_wait_ordered_range(rc->data_inode, 0, (u64)-1); 40025d4f98a2SYan Zheng invalidate_mapping_pages(rc->data_inode->i_mapping, 40035d4f98a2SYan Zheng 0, -1); 40045d4f98a2SYan Zheng rc->stage = UPDATE_DATA_PTRS; 40055d4f98a2SYan Zheng } 40065d4f98a2SYan Zheng } 40075d4f98a2SYan Zheng 40080257bb82SYan, Zheng filemap_write_and_wait_range(fs_info->btree_inode->i_mapping, 40095d4f98a2SYan Zheng rc->block_group->key.objectid, 40105d4f98a2SYan Zheng rc->block_group->key.objectid + 40115d4f98a2SYan Zheng rc->block_group->key.offset - 1); 40125d4f98a2SYan Zheng 40135d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 40145d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 40155d4f98a2SYan Zheng WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0); 40165d4f98a2SYan Zheng out: 4017f0486c68SYan, Zheng if (err && rw) 4018f0486c68SYan, Zheng btrfs_set_block_group_rw(extent_root, rc->block_group); 40195d4f98a2SYan Zheng iput(rc->data_inode); 40205d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 40215d4f98a2SYan Zheng kfree(rc); 40225d4f98a2SYan Zheng return err; 40235d4f98a2SYan Zheng } 40245d4f98a2SYan Zheng 402576dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 402676dda93cSYan, Zheng { 402776dda93cSYan, Zheng struct btrfs_trans_handle *trans; 402876dda93cSYan, Zheng int ret; 402976dda93cSYan, Zheng 4030a22285a6SYan, Zheng trans = btrfs_start_transaction(root->fs_info->tree_root, 0); 403176dda93cSYan, Zheng 403276dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 403376dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 403476dda93cSYan, Zheng root->root_item.drop_level = 0; 403576dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 403676dda93cSYan, Zheng ret = btrfs_update_root(trans, root->fs_info->tree_root, 403776dda93cSYan, Zheng &root->root_key, &root->root_item); 403876dda93cSYan, Zheng BUG_ON(ret); 403976dda93cSYan, Zheng 404076dda93cSYan, Zheng ret = btrfs_end_transaction(trans, root->fs_info->tree_root); 404176dda93cSYan, Zheng BUG_ON(ret); 404276dda93cSYan, Zheng return 0; 404376dda93cSYan, Zheng } 404476dda93cSYan, Zheng 40455d4f98a2SYan Zheng /* 40465d4f98a2SYan Zheng * recover relocation interrupted by system crash. 40475d4f98a2SYan Zheng * 40485d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 40495d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 40505d4f98a2SYan Zheng */ 40515d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 40525d4f98a2SYan Zheng { 40535d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 40545d4f98a2SYan Zheng struct btrfs_key key; 40555d4f98a2SYan Zheng struct btrfs_root *fs_root; 40565d4f98a2SYan Zheng struct btrfs_root *reloc_root; 40575d4f98a2SYan Zheng struct btrfs_path *path; 40585d4f98a2SYan Zheng struct extent_buffer *leaf; 40595d4f98a2SYan Zheng struct reloc_control *rc = NULL; 40605d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 40615d4f98a2SYan Zheng int ret; 40625d4f98a2SYan Zheng int err = 0; 40635d4f98a2SYan Zheng 40645d4f98a2SYan Zheng path = btrfs_alloc_path(); 40655d4f98a2SYan Zheng if (!path) 40665d4f98a2SYan Zheng return -ENOMEM; 40675d4f98a2SYan Zheng 40685d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 40695d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 40705d4f98a2SYan Zheng key.offset = (u64)-1; 40715d4f98a2SYan Zheng 40725d4f98a2SYan Zheng while (1) { 40735d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key, 40745d4f98a2SYan Zheng path, 0, 0); 40755d4f98a2SYan Zheng if (ret < 0) { 40765d4f98a2SYan Zheng err = ret; 40775d4f98a2SYan Zheng goto out; 40785d4f98a2SYan Zheng } 40795d4f98a2SYan Zheng if (ret > 0) { 40805d4f98a2SYan Zheng if (path->slots[0] == 0) 40815d4f98a2SYan Zheng break; 40825d4f98a2SYan Zheng path->slots[0]--; 40835d4f98a2SYan Zheng } 40845d4f98a2SYan Zheng leaf = path->nodes[0]; 40855d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 40865d4f98a2SYan Zheng btrfs_release_path(root->fs_info->tree_root, path); 40875d4f98a2SYan Zheng 40885d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 40895d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 40905d4f98a2SYan Zheng break; 40915d4f98a2SYan Zheng 40925d4f98a2SYan Zheng reloc_root = btrfs_read_fs_root_no_radix(root, &key); 40935d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 40945d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 40955d4f98a2SYan Zheng goto out; 40965d4f98a2SYan Zheng } 40975d4f98a2SYan Zheng 40985d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 40995d4f98a2SYan Zheng 41005d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 41015d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 41025d4f98a2SYan Zheng reloc_root->root_key.offset); 41035d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 410476dda93cSYan, Zheng ret = PTR_ERR(fs_root); 410576dda93cSYan, Zheng if (ret != -ENOENT) { 410676dda93cSYan, Zheng err = ret; 41075d4f98a2SYan Zheng goto out; 41085d4f98a2SYan Zheng } 410976dda93cSYan, Zheng mark_garbage_root(reloc_root); 411076dda93cSYan, Zheng } 41115d4f98a2SYan Zheng } 41125d4f98a2SYan Zheng 41135d4f98a2SYan Zheng if (key.offset == 0) 41145d4f98a2SYan Zheng break; 41155d4f98a2SYan Zheng 41165d4f98a2SYan Zheng key.offset--; 41175d4f98a2SYan Zheng } 41185d4f98a2SYan Zheng btrfs_release_path(root->fs_info->tree_root, path); 41195d4f98a2SYan Zheng 41205d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 41215d4f98a2SYan Zheng goto out; 41225d4f98a2SYan Zheng 41233fd0a558SYan, Zheng rc = alloc_reloc_control(); 41245d4f98a2SYan Zheng if (!rc) { 41255d4f98a2SYan Zheng err = -ENOMEM; 41265d4f98a2SYan Zheng goto out; 41275d4f98a2SYan Zheng } 41285d4f98a2SYan Zheng 41295d4f98a2SYan Zheng rc->extent_root = root->fs_info->extent_root; 41305d4f98a2SYan Zheng 41315d4f98a2SYan Zheng set_reloc_control(rc); 41325d4f98a2SYan Zheng 41333fd0a558SYan, Zheng trans = btrfs_join_transaction(rc->extent_root, 1); 41343fd0a558SYan, Zheng 41353fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 41363fd0a558SYan, Zheng 41375d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 41385d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 41395d4f98a2SYan Zheng struct btrfs_root, root_list); 41405d4f98a2SYan Zheng list_del(&reloc_root->root_list); 41415d4f98a2SYan Zheng 41425d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 41435d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 41445d4f98a2SYan Zheng &rc->reloc_roots); 41455d4f98a2SYan Zheng continue; 41465d4f98a2SYan Zheng } 41475d4f98a2SYan Zheng 41485d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 41495d4f98a2SYan Zheng reloc_root->root_key.offset); 41505d4f98a2SYan Zheng BUG_ON(IS_ERR(fs_root)); 41515d4f98a2SYan Zheng 41525d4f98a2SYan Zheng __add_reloc_root(reloc_root); 41535d4f98a2SYan Zheng fs_root->reloc_root = reloc_root; 41545d4f98a2SYan Zheng } 41555d4f98a2SYan Zheng 41565d4f98a2SYan Zheng btrfs_commit_transaction(trans, rc->extent_root); 41575d4f98a2SYan Zheng 41585d4f98a2SYan Zheng merge_reloc_roots(rc); 41595d4f98a2SYan Zheng 41605d4f98a2SYan Zheng unset_reloc_control(rc); 41615d4f98a2SYan Zheng 41623fd0a558SYan, Zheng trans = btrfs_join_transaction(rc->extent_root, 1); 41635d4f98a2SYan Zheng btrfs_commit_transaction(trans, rc->extent_root); 41645d4f98a2SYan Zheng out: 41655d4f98a2SYan Zheng kfree(rc); 41665d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 41675d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 41685d4f98a2SYan Zheng struct btrfs_root, root_list); 41695d4f98a2SYan Zheng list_del(&reloc_root->root_list); 41705d4f98a2SYan Zheng free_extent_buffer(reloc_root->node); 41715d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 41725d4f98a2SYan Zheng kfree(reloc_root); 41735d4f98a2SYan Zheng } 41745d4f98a2SYan Zheng btrfs_free_path(path); 41755d4f98a2SYan Zheng 41765d4f98a2SYan Zheng if (err == 0) { 41775d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 41785d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 41795d4f98a2SYan Zheng BTRFS_DATA_RELOC_TREE_OBJECTID); 41805d4f98a2SYan Zheng if (IS_ERR(fs_root)) 41815d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4182d7ce5843SMiao Xie else 4183c71bf099SYan, Zheng btrfs_orphan_cleanup(fs_root); 41845d4f98a2SYan Zheng } 41855d4f98a2SYan Zheng return err; 41865d4f98a2SYan Zheng } 41875d4f98a2SYan Zheng 41885d4f98a2SYan Zheng /* 41895d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 41905d4f98a2SYan Zheng * 41915d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 41925d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 41935d4f98a2SYan Zheng */ 41945d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 41955d4f98a2SYan Zheng { 41965d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 41975d4f98a2SYan Zheng struct btrfs_sector_sum *sector_sum; 41985d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 41995d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(inode)->root; 42005d4f98a2SYan Zheng size_t offset; 42015d4f98a2SYan Zheng int ret; 42025d4f98a2SYan Zheng u64 disk_bytenr; 42035d4f98a2SYan Zheng LIST_HEAD(list); 42045d4f98a2SYan Zheng 42055d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 42065d4f98a2SYan Zheng BUG_ON(ordered->file_offset != file_pos || ordered->len != len); 42075d4f98a2SYan Zheng 42085d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 42095d4f98a2SYan Zheng ret = btrfs_lookup_csums_range(root->fs_info->csum_root, disk_bytenr, 42105d4f98a2SYan Zheng disk_bytenr + len - 1, &list); 42115d4f98a2SYan Zheng 42125d4f98a2SYan Zheng while (!list_empty(&list)) { 42135d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 42145d4f98a2SYan Zheng list_del_init(&sums->list); 42155d4f98a2SYan Zheng 42165d4f98a2SYan Zheng sector_sum = sums->sums; 42175d4f98a2SYan Zheng sums->bytenr = ordered->start; 42185d4f98a2SYan Zheng 42195d4f98a2SYan Zheng offset = 0; 42205d4f98a2SYan Zheng while (offset < sums->len) { 42215d4f98a2SYan Zheng sector_sum->bytenr += ordered->start - disk_bytenr; 42225d4f98a2SYan Zheng sector_sum++; 42235d4f98a2SYan Zheng offset += root->sectorsize; 42245d4f98a2SYan Zheng } 42255d4f98a2SYan Zheng 42265d4f98a2SYan Zheng btrfs_add_ordered_sum(inode, ordered, sums); 42275d4f98a2SYan Zheng } 42285d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 42295d4f98a2SYan Zheng return 0; 42305d4f98a2SYan Zheng } 42313fd0a558SYan, Zheng 42323fd0a558SYan, Zheng void btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 42333fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 42343fd0a558SYan, Zheng struct extent_buffer *cow) 42353fd0a558SYan, Zheng { 42363fd0a558SYan, Zheng struct reloc_control *rc; 42373fd0a558SYan, Zheng struct backref_node *node; 42383fd0a558SYan, Zheng int first_cow = 0; 42393fd0a558SYan, Zheng int level; 42403fd0a558SYan, Zheng int ret; 42413fd0a558SYan, Zheng 42423fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 42433fd0a558SYan, Zheng if (!rc) 42443fd0a558SYan, Zheng return; 42453fd0a558SYan, Zheng 42463fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 42473fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 42483fd0a558SYan, Zheng 42493fd0a558SYan, Zheng level = btrfs_header_level(buf); 42503fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 42513fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 42523fd0a558SYan, Zheng first_cow = 1; 42533fd0a558SYan, Zheng 42543fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 42553fd0a558SYan, Zheng rc->create_reloc_tree) { 42563fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 42573fd0a558SYan, Zheng 42583fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 42593fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 42603fd0a558SYan, Zheng node->new_bytenr != buf->start); 42613fd0a558SYan, Zheng 42623fd0a558SYan, Zheng drop_node_buffer(node); 42633fd0a558SYan, Zheng extent_buffer_get(cow); 42643fd0a558SYan, Zheng node->eb = cow; 42653fd0a558SYan, Zheng node->new_bytenr = cow->start; 42663fd0a558SYan, Zheng 42673fd0a558SYan, Zheng if (!node->pending) { 42683fd0a558SYan, Zheng list_move_tail(&node->list, 42693fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 42703fd0a558SYan, Zheng node->pending = 1; 42713fd0a558SYan, Zheng } 42723fd0a558SYan, Zheng 42733fd0a558SYan, Zheng if (first_cow) 42743fd0a558SYan, Zheng __mark_block_processed(rc, node); 42753fd0a558SYan, Zheng 42763fd0a558SYan, Zheng if (first_cow && level > 0) 42773fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 42783fd0a558SYan, Zheng } 42793fd0a558SYan, Zheng 42803fd0a558SYan, Zheng if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) { 42813fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 42823fd0a558SYan, Zheng BUG_ON(ret); 42833fd0a558SYan, Zheng } 42843fd0a558SYan, Zheng } 42853fd0a558SYan, Zheng 42863fd0a558SYan, Zheng /* 42873fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 42883fd0a558SYan, Zheng * requried for relocating tree blocks in the snapshot 42893fd0a558SYan, Zheng */ 42903fd0a558SYan, Zheng void btrfs_reloc_pre_snapshot(struct btrfs_trans_handle *trans, 42913fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending, 42923fd0a558SYan, Zheng u64 *bytes_to_reserve) 42933fd0a558SYan, Zheng { 42943fd0a558SYan, Zheng struct btrfs_root *root; 42953fd0a558SYan, Zheng struct reloc_control *rc; 42963fd0a558SYan, Zheng 42973fd0a558SYan, Zheng root = pending->root; 42983fd0a558SYan, Zheng if (!root->reloc_root) 42993fd0a558SYan, Zheng return; 43003fd0a558SYan, Zheng 43013fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 43023fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 43033fd0a558SYan, Zheng return; 43043fd0a558SYan, Zheng 43053fd0a558SYan, Zheng root = root->reloc_root; 43063fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 43073fd0a558SYan, Zheng /* 43083fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 43093fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 43103fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 43113fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 43123fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 43133fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 43143fd0a558SYan, Zheng * tree may use more space than it frees. so we need 43153fd0a558SYan, Zheng * reserve extra space. 43163fd0a558SYan, Zheng */ 43173fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 43183fd0a558SYan, Zheng } 43193fd0a558SYan, Zheng 43203fd0a558SYan, Zheng /* 43213fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 43223fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 43233fd0a558SYan, Zheng */ 43243fd0a558SYan, Zheng void btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 43253fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 43263fd0a558SYan, Zheng { 43273fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 43283fd0a558SYan, Zheng struct btrfs_root *reloc_root; 43293fd0a558SYan, Zheng struct btrfs_root *new_root; 43303fd0a558SYan, Zheng struct reloc_control *rc; 43313fd0a558SYan, Zheng int ret; 43323fd0a558SYan, Zheng 43333fd0a558SYan, Zheng if (!root->reloc_root) 43343fd0a558SYan, Zheng return; 43353fd0a558SYan, Zheng 43363fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 43373fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 43383fd0a558SYan, Zheng 43393fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 43403fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 43413fd0a558SYan, Zheng rc->block_rsv, 43423fd0a558SYan, Zheng rc->nodes_relocated); 43433fd0a558SYan, Zheng BUG_ON(ret); 43443fd0a558SYan, Zheng } 43453fd0a558SYan, Zheng 43463fd0a558SYan, Zheng new_root = pending->snap; 43473fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 43483fd0a558SYan, Zheng new_root->root_key.objectid); 43493fd0a558SYan, Zheng 43503fd0a558SYan, Zheng __add_reloc_root(reloc_root); 43513fd0a558SYan, Zheng new_root->reloc_root = reloc_root; 43523fd0a558SYan, Zheng 43533fd0a558SYan, Zheng if (rc->create_reloc_tree) { 43543fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 43553fd0a558SYan, Zheng BUG_ON(ret); 43563fd0a558SYan, Zheng } 43573fd0a558SYan, Zheng } 4358