15d4f98a2SYan Zheng /* 25d4f98a2SYan Zheng * Copyright (C) 2009 Oracle. All rights reserved. 35d4f98a2SYan Zheng * 45d4f98a2SYan Zheng * This program is free software; you can redistribute it and/or 55d4f98a2SYan Zheng * modify it under the terms of the GNU General Public 65d4f98a2SYan Zheng * License v2 as published by the Free Software Foundation. 75d4f98a2SYan Zheng * 85d4f98a2SYan Zheng * This program is distributed in the hope that it will be useful, 95d4f98a2SYan Zheng * but WITHOUT ANY WARRANTY; without even the implied warranty of 105d4f98a2SYan Zheng * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 115d4f98a2SYan Zheng * General Public License for more details. 125d4f98a2SYan Zheng * 135d4f98a2SYan Zheng * You should have received a copy of the GNU General Public 145d4f98a2SYan Zheng * License along with this program; if not, write to the 155d4f98a2SYan Zheng * Free Software Foundation, Inc., 59 Temple Place - Suite 330, 165d4f98a2SYan Zheng * Boston, MA 021110-1307, USA. 175d4f98a2SYan Zheng */ 185d4f98a2SYan Zheng 195d4f98a2SYan Zheng #include <linux/sched.h> 205d4f98a2SYan Zheng #include <linux/pagemap.h> 215d4f98a2SYan Zheng #include <linux/writeback.h> 225d4f98a2SYan Zheng #include <linux/blkdev.h> 235d4f98a2SYan Zheng #include <linux/rbtree.h> 245a0e3ad6STejun Heo #include <linux/slab.h> 255d4f98a2SYan Zheng #include "ctree.h" 265d4f98a2SYan Zheng #include "disk-io.h" 275d4f98a2SYan Zheng #include "transaction.h" 285d4f98a2SYan Zheng #include "volumes.h" 295d4f98a2SYan Zheng #include "locking.h" 305d4f98a2SYan Zheng #include "btrfs_inode.h" 315d4f98a2SYan Zheng #include "async-thread.h" 320af3d00bSJosef Bacik #include "free-space-cache.h" 33581bb050SLi Zefan #include "inode-map.h" 345d4f98a2SYan Zheng 355d4f98a2SYan Zheng /* 365d4f98a2SYan Zheng * backref_node, mapping_node and tree_block start with this 375d4f98a2SYan Zheng */ 385d4f98a2SYan Zheng struct tree_entry { 395d4f98a2SYan Zheng struct rb_node rb_node; 405d4f98a2SYan Zheng u64 bytenr; 415d4f98a2SYan Zheng }; 425d4f98a2SYan Zheng 435d4f98a2SYan Zheng /* 445d4f98a2SYan Zheng * present a tree block in the backref cache 455d4f98a2SYan Zheng */ 465d4f98a2SYan Zheng struct backref_node { 475d4f98a2SYan Zheng struct rb_node rb_node; 485d4f98a2SYan Zheng u64 bytenr; 493fd0a558SYan, Zheng 503fd0a558SYan, Zheng u64 new_bytenr; 513fd0a558SYan, Zheng /* objectid of tree block owner, can be not uptodate */ 525d4f98a2SYan Zheng u64 owner; 533fd0a558SYan, Zheng /* link to pending, changed or detached list */ 543fd0a558SYan, Zheng struct list_head list; 555d4f98a2SYan Zheng /* list of upper level blocks reference this block */ 565d4f98a2SYan Zheng struct list_head upper; 575d4f98a2SYan Zheng /* list of child blocks in the cache */ 585d4f98a2SYan Zheng struct list_head lower; 595d4f98a2SYan Zheng /* NULL if this node is not tree root */ 605d4f98a2SYan Zheng struct btrfs_root *root; 615d4f98a2SYan Zheng /* extent buffer got by COW the block */ 625d4f98a2SYan Zheng struct extent_buffer *eb; 635d4f98a2SYan Zheng /* level of tree block */ 645d4f98a2SYan Zheng unsigned int level:8; 653fd0a558SYan, Zheng /* is the block in non-reference counted tree */ 663fd0a558SYan, Zheng unsigned int cowonly:1; 673fd0a558SYan, Zheng /* 1 if no child node in the cache */ 685d4f98a2SYan Zheng unsigned int lowest:1; 695d4f98a2SYan Zheng /* is the extent buffer locked */ 705d4f98a2SYan Zheng unsigned int locked:1; 715d4f98a2SYan Zheng /* has the block been processed */ 725d4f98a2SYan Zheng unsigned int processed:1; 735d4f98a2SYan Zheng /* have backrefs of this block been checked */ 745d4f98a2SYan Zheng unsigned int checked:1; 753fd0a558SYan, Zheng /* 763fd0a558SYan, Zheng * 1 if corresponding block has been cowed but some upper 773fd0a558SYan, Zheng * level block pointers may not point to the new location 783fd0a558SYan, Zheng */ 793fd0a558SYan, Zheng unsigned int pending:1; 803fd0a558SYan, Zheng /* 813fd0a558SYan, Zheng * 1 if the backref node isn't connected to any other 823fd0a558SYan, Zheng * backref node. 833fd0a558SYan, Zheng */ 843fd0a558SYan, Zheng unsigned int detached:1; 855d4f98a2SYan Zheng }; 865d4f98a2SYan Zheng 875d4f98a2SYan Zheng /* 885d4f98a2SYan Zheng * present a block pointer in the backref cache 895d4f98a2SYan Zheng */ 905d4f98a2SYan Zheng struct backref_edge { 915d4f98a2SYan Zheng struct list_head list[2]; 925d4f98a2SYan Zheng struct backref_node *node[2]; 935d4f98a2SYan Zheng }; 945d4f98a2SYan Zheng 955d4f98a2SYan Zheng #define LOWER 0 965d4f98a2SYan Zheng #define UPPER 1 975d4f98a2SYan Zheng 985d4f98a2SYan Zheng struct backref_cache { 995d4f98a2SYan Zheng /* red black tree of all backref nodes in the cache */ 1005d4f98a2SYan Zheng struct rb_root rb_root; 1013fd0a558SYan, Zheng /* for passing backref nodes to btrfs_reloc_cow_block */ 1023fd0a558SYan, Zheng struct backref_node *path[BTRFS_MAX_LEVEL]; 1033fd0a558SYan, Zheng /* 1043fd0a558SYan, Zheng * list of blocks that have been cowed but some block 1053fd0a558SYan, Zheng * pointers in upper level blocks may not reflect the 1063fd0a558SYan, Zheng * new location 1073fd0a558SYan, Zheng */ 1085d4f98a2SYan Zheng struct list_head pending[BTRFS_MAX_LEVEL]; 1093fd0a558SYan, Zheng /* list of backref nodes with no child node */ 1103fd0a558SYan, Zheng struct list_head leaves; 1113fd0a558SYan, Zheng /* list of blocks that have been cowed in current transaction */ 1123fd0a558SYan, Zheng struct list_head changed; 1133fd0a558SYan, Zheng /* list of detached backref node. */ 1143fd0a558SYan, Zheng struct list_head detached; 1153fd0a558SYan, Zheng 1163fd0a558SYan, Zheng u64 last_trans; 1173fd0a558SYan, Zheng 1183fd0a558SYan, Zheng int nr_nodes; 1193fd0a558SYan, Zheng int nr_edges; 1205d4f98a2SYan Zheng }; 1215d4f98a2SYan Zheng 1225d4f98a2SYan Zheng /* 1235d4f98a2SYan Zheng * map address of tree root to tree 1245d4f98a2SYan Zheng */ 1255d4f98a2SYan Zheng struct mapping_node { 1265d4f98a2SYan Zheng struct rb_node rb_node; 1275d4f98a2SYan Zheng u64 bytenr; 1285d4f98a2SYan Zheng void *data; 1295d4f98a2SYan Zheng }; 1305d4f98a2SYan Zheng 1315d4f98a2SYan Zheng struct mapping_tree { 1325d4f98a2SYan Zheng struct rb_root rb_root; 1335d4f98a2SYan Zheng spinlock_t lock; 1345d4f98a2SYan Zheng }; 1355d4f98a2SYan Zheng 1365d4f98a2SYan Zheng /* 1375d4f98a2SYan Zheng * present a tree block to process 1385d4f98a2SYan Zheng */ 1395d4f98a2SYan Zheng struct tree_block { 1405d4f98a2SYan Zheng struct rb_node rb_node; 1415d4f98a2SYan Zheng u64 bytenr; 1425d4f98a2SYan Zheng struct btrfs_key key; 1435d4f98a2SYan Zheng unsigned int level:8; 1445d4f98a2SYan Zheng unsigned int key_ready:1; 1455d4f98a2SYan Zheng }; 1465d4f98a2SYan Zheng 1470257bb82SYan, Zheng #define MAX_EXTENTS 128 1480257bb82SYan, Zheng 1490257bb82SYan, Zheng struct file_extent_cluster { 1500257bb82SYan, Zheng u64 start; 1510257bb82SYan, Zheng u64 end; 1520257bb82SYan, Zheng u64 boundary[MAX_EXTENTS]; 1530257bb82SYan, Zheng unsigned int nr; 1540257bb82SYan, Zheng }; 1550257bb82SYan, Zheng 1565d4f98a2SYan Zheng struct reloc_control { 1575d4f98a2SYan Zheng /* block group to relocate */ 1585d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group; 1595d4f98a2SYan Zheng /* extent tree */ 1605d4f98a2SYan Zheng struct btrfs_root *extent_root; 1615d4f98a2SYan Zheng /* inode for moving data */ 1625d4f98a2SYan Zheng struct inode *data_inode; 1633fd0a558SYan, Zheng 1643fd0a558SYan, Zheng struct btrfs_block_rsv *block_rsv; 1653fd0a558SYan, Zheng 1663fd0a558SYan, Zheng struct backref_cache backref_cache; 1673fd0a558SYan, Zheng 1683fd0a558SYan, Zheng struct file_extent_cluster cluster; 1695d4f98a2SYan Zheng /* tree blocks have been processed */ 1705d4f98a2SYan Zheng struct extent_io_tree processed_blocks; 1715d4f98a2SYan Zheng /* map start of tree root to corresponding reloc tree */ 1725d4f98a2SYan Zheng struct mapping_tree reloc_root_tree; 1735d4f98a2SYan Zheng /* list of reloc trees */ 1745d4f98a2SYan Zheng struct list_head reloc_roots; 1753fd0a558SYan, Zheng /* size of metadata reservation for merging reloc trees */ 1763fd0a558SYan, Zheng u64 merging_rsv_size; 1773fd0a558SYan, Zheng /* size of relocated tree nodes */ 1783fd0a558SYan, Zheng u64 nodes_relocated; 1793fd0a558SYan, Zheng 1805d4f98a2SYan Zheng u64 search_start; 1815d4f98a2SYan Zheng u64 extents_found; 1823fd0a558SYan, Zheng 1833fd0a558SYan, Zheng unsigned int stage:8; 1843fd0a558SYan, Zheng unsigned int create_reloc_tree:1; 1853fd0a558SYan, Zheng unsigned int merge_reloc_tree:1; 1865d4f98a2SYan Zheng unsigned int found_file_extent:1; 1873fd0a558SYan, Zheng unsigned int commit_transaction:1; 1885d4f98a2SYan Zheng }; 1895d4f98a2SYan Zheng 1905d4f98a2SYan Zheng /* stages of data relocation */ 1915d4f98a2SYan Zheng #define MOVE_DATA_EXTENTS 0 1925d4f98a2SYan Zheng #define UPDATE_DATA_PTRS 1 1935d4f98a2SYan Zheng 1943fd0a558SYan, Zheng static void remove_backref_node(struct backref_cache *cache, 1953fd0a558SYan, Zheng struct backref_node *node); 1963fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 1973fd0a558SYan, Zheng struct backref_node *node); 1985d4f98a2SYan Zheng 1995d4f98a2SYan Zheng static void mapping_tree_init(struct mapping_tree *tree) 2005d4f98a2SYan Zheng { 2016bef4d31SEric Paris tree->rb_root = RB_ROOT; 2025d4f98a2SYan Zheng spin_lock_init(&tree->lock); 2035d4f98a2SYan Zheng } 2045d4f98a2SYan Zheng 2055d4f98a2SYan Zheng static void backref_cache_init(struct backref_cache *cache) 2065d4f98a2SYan Zheng { 2075d4f98a2SYan Zheng int i; 2086bef4d31SEric Paris cache->rb_root = RB_ROOT; 2095d4f98a2SYan Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2105d4f98a2SYan Zheng INIT_LIST_HEAD(&cache->pending[i]); 2113fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->changed); 2123fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->detached); 2133fd0a558SYan, Zheng INIT_LIST_HEAD(&cache->leaves); 2145d4f98a2SYan Zheng } 2155d4f98a2SYan Zheng 2163fd0a558SYan, Zheng static void backref_cache_cleanup(struct backref_cache *cache) 2175d4f98a2SYan Zheng { 2183fd0a558SYan, Zheng struct backref_node *node; 2193fd0a558SYan, Zheng int i; 2203fd0a558SYan, Zheng 2213fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 2223fd0a558SYan, Zheng node = list_entry(cache->detached.next, 2233fd0a558SYan, Zheng struct backref_node, list); 2243fd0a558SYan, Zheng remove_backref_node(cache, node); 2253fd0a558SYan, Zheng } 2263fd0a558SYan, Zheng 2273fd0a558SYan, Zheng while (!list_empty(&cache->leaves)) { 2283fd0a558SYan, Zheng node = list_entry(cache->leaves.next, 2293fd0a558SYan, Zheng struct backref_node, lower); 2303fd0a558SYan, Zheng remove_backref_node(cache, node); 2313fd0a558SYan, Zheng } 2323fd0a558SYan, Zheng 2333fd0a558SYan, Zheng cache->last_trans = 0; 2343fd0a558SYan, Zheng 2353fd0a558SYan, Zheng for (i = 0; i < BTRFS_MAX_LEVEL; i++) 2363fd0a558SYan, Zheng BUG_ON(!list_empty(&cache->pending[i])); 2373fd0a558SYan, Zheng BUG_ON(!list_empty(&cache->changed)); 2383fd0a558SYan, Zheng BUG_ON(!list_empty(&cache->detached)); 2393fd0a558SYan, Zheng BUG_ON(!RB_EMPTY_ROOT(&cache->rb_root)); 2403fd0a558SYan, Zheng BUG_ON(cache->nr_nodes); 2413fd0a558SYan, Zheng BUG_ON(cache->nr_edges); 2423fd0a558SYan, Zheng } 2433fd0a558SYan, Zheng 2443fd0a558SYan, Zheng static struct backref_node *alloc_backref_node(struct backref_cache *cache) 2453fd0a558SYan, Zheng { 2463fd0a558SYan, Zheng struct backref_node *node; 2473fd0a558SYan, Zheng 2483fd0a558SYan, Zheng node = kzalloc(sizeof(*node), GFP_NOFS); 2493fd0a558SYan, Zheng if (node) { 2503fd0a558SYan, Zheng INIT_LIST_HEAD(&node->list); 2515d4f98a2SYan Zheng INIT_LIST_HEAD(&node->upper); 2525d4f98a2SYan Zheng INIT_LIST_HEAD(&node->lower); 2535d4f98a2SYan Zheng RB_CLEAR_NODE(&node->rb_node); 2543fd0a558SYan, Zheng cache->nr_nodes++; 2553fd0a558SYan, Zheng } 2563fd0a558SYan, Zheng return node; 2573fd0a558SYan, Zheng } 2583fd0a558SYan, Zheng 2593fd0a558SYan, Zheng static void free_backref_node(struct backref_cache *cache, 2603fd0a558SYan, Zheng struct backref_node *node) 2613fd0a558SYan, Zheng { 2623fd0a558SYan, Zheng if (node) { 2633fd0a558SYan, Zheng cache->nr_nodes--; 2643fd0a558SYan, Zheng kfree(node); 2653fd0a558SYan, Zheng } 2663fd0a558SYan, Zheng } 2673fd0a558SYan, Zheng 2683fd0a558SYan, Zheng static struct backref_edge *alloc_backref_edge(struct backref_cache *cache) 2693fd0a558SYan, Zheng { 2703fd0a558SYan, Zheng struct backref_edge *edge; 2713fd0a558SYan, Zheng 2723fd0a558SYan, Zheng edge = kzalloc(sizeof(*edge), GFP_NOFS); 2733fd0a558SYan, Zheng if (edge) 2743fd0a558SYan, Zheng cache->nr_edges++; 2753fd0a558SYan, Zheng return edge; 2763fd0a558SYan, Zheng } 2773fd0a558SYan, Zheng 2783fd0a558SYan, Zheng static void free_backref_edge(struct backref_cache *cache, 2793fd0a558SYan, Zheng struct backref_edge *edge) 2803fd0a558SYan, Zheng { 2813fd0a558SYan, Zheng if (edge) { 2823fd0a558SYan, Zheng cache->nr_edges--; 2833fd0a558SYan, Zheng kfree(edge); 2843fd0a558SYan, Zheng } 2855d4f98a2SYan Zheng } 2865d4f98a2SYan Zheng 2875d4f98a2SYan Zheng static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, 2885d4f98a2SYan Zheng struct rb_node *node) 2895d4f98a2SYan Zheng { 2905d4f98a2SYan Zheng struct rb_node **p = &root->rb_node; 2915d4f98a2SYan Zheng struct rb_node *parent = NULL; 2925d4f98a2SYan Zheng struct tree_entry *entry; 2935d4f98a2SYan Zheng 2945d4f98a2SYan Zheng while (*p) { 2955d4f98a2SYan Zheng parent = *p; 2965d4f98a2SYan Zheng entry = rb_entry(parent, struct tree_entry, rb_node); 2975d4f98a2SYan Zheng 2985d4f98a2SYan Zheng if (bytenr < entry->bytenr) 2995d4f98a2SYan Zheng p = &(*p)->rb_left; 3005d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3015d4f98a2SYan Zheng p = &(*p)->rb_right; 3025d4f98a2SYan Zheng else 3035d4f98a2SYan Zheng return parent; 3045d4f98a2SYan Zheng } 3055d4f98a2SYan Zheng 3065d4f98a2SYan Zheng rb_link_node(node, parent, p); 3075d4f98a2SYan Zheng rb_insert_color(node, root); 3085d4f98a2SYan Zheng return NULL; 3095d4f98a2SYan Zheng } 3105d4f98a2SYan Zheng 3115d4f98a2SYan Zheng static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) 3125d4f98a2SYan Zheng { 3135d4f98a2SYan Zheng struct rb_node *n = root->rb_node; 3145d4f98a2SYan Zheng struct tree_entry *entry; 3155d4f98a2SYan Zheng 3165d4f98a2SYan Zheng while (n) { 3175d4f98a2SYan Zheng entry = rb_entry(n, struct tree_entry, rb_node); 3185d4f98a2SYan Zheng 3195d4f98a2SYan Zheng if (bytenr < entry->bytenr) 3205d4f98a2SYan Zheng n = n->rb_left; 3215d4f98a2SYan Zheng else if (bytenr > entry->bytenr) 3225d4f98a2SYan Zheng n = n->rb_right; 3235d4f98a2SYan Zheng else 3245d4f98a2SYan Zheng return n; 3255d4f98a2SYan Zheng } 3265d4f98a2SYan Zheng return NULL; 3275d4f98a2SYan Zheng } 3285d4f98a2SYan Zheng 32943c04fb1SJeff Mahoney void backref_tree_panic(struct rb_node *rb_node, int errno, 33043c04fb1SJeff Mahoney u64 bytenr) 33143c04fb1SJeff Mahoney { 33243c04fb1SJeff Mahoney 33343c04fb1SJeff Mahoney struct btrfs_fs_info *fs_info = NULL; 33443c04fb1SJeff Mahoney struct backref_node *bnode = rb_entry(rb_node, struct backref_node, 33543c04fb1SJeff Mahoney rb_node); 33643c04fb1SJeff Mahoney if (bnode->root) 33743c04fb1SJeff Mahoney fs_info = bnode->root->fs_info; 33843c04fb1SJeff Mahoney btrfs_panic(fs_info, errno, "Inconsistency in backref cache " 33943c04fb1SJeff Mahoney "found at offset %llu\n", (unsigned long long)bytenr); 34043c04fb1SJeff Mahoney } 34143c04fb1SJeff Mahoney 3425d4f98a2SYan Zheng /* 3435d4f98a2SYan Zheng * walk up backref nodes until reach node presents tree root 3445d4f98a2SYan Zheng */ 3455d4f98a2SYan Zheng static struct backref_node *walk_up_backref(struct backref_node *node, 3465d4f98a2SYan Zheng struct backref_edge *edges[], 3475d4f98a2SYan Zheng int *index) 3485d4f98a2SYan Zheng { 3495d4f98a2SYan Zheng struct backref_edge *edge; 3505d4f98a2SYan Zheng int idx = *index; 3515d4f98a2SYan Zheng 3525d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 3535d4f98a2SYan Zheng edge = list_entry(node->upper.next, 3545d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3555d4f98a2SYan Zheng edges[idx++] = edge; 3565d4f98a2SYan Zheng node = edge->node[UPPER]; 3575d4f98a2SYan Zheng } 3583fd0a558SYan, Zheng BUG_ON(node->detached); 3595d4f98a2SYan Zheng *index = idx; 3605d4f98a2SYan Zheng return node; 3615d4f98a2SYan Zheng } 3625d4f98a2SYan Zheng 3635d4f98a2SYan Zheng /* 3645d4f98a2SYan Zheng * walk down backref nodes to find start of next reference path 3655d4f98a2SYan Zheng */ 3665d4f98a2SYan Zheng static struct backref_node *walk_down_backref(struct backref_edge *edges[], 3675d4f98a2SYan Zheng int *index) 3685d4f98a2SYan Zheng { 3695d4f98a2SYan Zheng struct backref_edge *edge; 3705d4f98a2SYan Zheng struct backref_node *lower; 3715d4f98a2SYan Zheng int idx = *index; 3725d4f98a2SYan Zheng 3735d4f98a2SYan Zheng while (idx > 0) { 3745d4f98a2SYan Zheng edge = edges[idx - 1]; 3755d4f98a2SYan Zheng lower = edge->node[LOWER]; 3765d4f98a2SYan Zheng if (list_is_last(&edge->list[LOWER], &lower->upper)) { 3775d4f98a2SYan Zheng idx--; 3785d4f98a2SYan Zheng continue; 3795d4f98a2SYan Zheng } 3805d4f98a2SYan Zheng edge = list_entry(edge->list[LOWER].next, 3815d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 3825d4f98a2SYan Zheng edges[idx - 1] = edge; 3835d4f98a2SYan Zheng *index = idx; 3845d4f98a2SYan Zheng return edge->node[UPPER]; 3855d4f98a2SYan Zheng } 3865d4f98a2SYan Zheng *index = 0; 3875d4f98a2SYan Zheng return NULL; 3885d4f98a2SYan Zheng } 3895d4f98a2SYan Zheng 3903fd0a558SYan, Zheng static void unlock_node_buffer(struct backref_node *node) 3915d4f98a2SYan Zheng { 3925d4f98a2SYan Zheng if (node->locked) { 3935d4f98a2SYan Zheng btrfs_tree_unlock(node->eb); 3945d4f98a2SYan Zheng node->locked = 0; 3955d4f98a2SYan Zheng } 3963fd0a558SYan, Zheng } 3973fd0a558SYan, Zheng 3983fd0a558SYan, Zheng static void drop_node_buffer(struct backref_node *node) 3993fd0a558SYan, Zheng { 4003fd0a558SYan, Zheng if (node->eb) { 4013fd0a558SYan, Zheng unlock_node_buffer(node); 4025d4f98a2SYan Zheng free_extent_buffer(node->eb); 4035d4f98a2SYan Zheng node->eb = NULL; 4045d4f98a2SYan Zheng } 4055d4f98a2SYan Zheng } 4065d4f98a2SYan Zheng 4075d4f98a2SYan Zheng static void drop_backref_node(struct backref_cache *tree, 4085d4f98a2SYan Zheng struct backref_node *node) 4095d4f98a2SYan Zheng { 4105d4f98a2SYan Zheng BUG_ON(!list_empty(&node->upper)); 4115d4f98a2SYan Zheng 4125d4f98a2SYan Zheng drop_node_buffer(node); 4133fd0a558SYan, Zheng list_del(&node->list); 4145d4f98a2SYan Zheng list_del(&node->lower); 4153fd0a558SYan, Zheng if (!RB_EMPTY_NODE(&node->rb_node)) 4165d4f98a2SYan Zheng rb_erase(&node->rb_node, &tree->rb_root); 4173fd0a558SYan, Zheng free_backref_node(tree, node); 4185d4f98a2SYan Zheng } 4195d4f98a2SYan Zheng 4205d4f98a2SYan Zheng /* 4215d4f98a2SYan Zheng * remove a backref node from the backref cache 4225d4f98a2SYan Zheng */ 4235d4f98a2SYan Zheng static void remove_backref_node(struct backref_cache *cache, 4245d4f98a2SYan Zheng struct backref_node *node) 4255d4f98a2SYan Zheng { 4265d4f98a2SYan Zheng struct backref_node *upper; 4275d4f98a2SYan Zheng struct backref_edge *edge; 4285d4f98a2SYan Zheng 4295d4f98a2SYan Zheng if (!node) 4305d4f98a2SYan Zheng return; 4315d4f98a2SYan Zheng 4323fd0a558SYan, Zheng BUG_ON(!node->lowest && !node->detached); 4335d4f98a2SYan Zheng while (!list_empty(&node->upper)) { 4345d4f98a2SYan Zheng edge = list_entry(node->upper.next, struct backref_edge, 4355d4f98a2SYan Zheng list[LOWER]); 4365d4f98a2SYan Zheng upper = edge->node[UPPER]; 4375d4f98a2SYan Zheng list_del(&edge->list[LOWER]); 4385d4f98a2SYan Zheng list_del(&edge->list[UPPER]); 4393fd0a558SYan, Zheng free_backref_edge(cache, edge); 4403fd0a558SYan, Zheng 4413fd0a558SYan, Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 4423fd0a558SYan, Zheng BUG_ON(!list_empty(&node->upper)); 4433fd0a558SYan, Zheng drop_backref_node(cache, node); 4443fd0a558SYan, Zheng node = upper; 4453fd0a558SYan, Zheng node->lowest = 1; 4463fd0a558SYan, Zheng continue; 4473fd0a558SYan, Zheng } 4485d4f98a2SYan Zheng /* 4493fd0a558SYan, Zheng * add the node to leaf node list if no other 4505d4f98a2SYan Zheng * child block cached. 4515d4f98a2SYan Zheng */ 4525d4f98a2SYan Zheng if (list_empty(&upper->lower)) { 4533fd0a558SYan, Zheng list_add_tail(&upper->lower, &cache->leaves); 4545d4f98a2SYan Zheng upper->lowest = 1; 4555d4f98a2SYan Zheng } 4565d4f98a2SYan Zheng } 4573fd0a558SYan, Zheng 4585d4f98a2SYan Zheng drop_backref_node(cache, node); 4595d4f98a2SYan Zheng } 4605d4f98a2SYan Zheng 4613fd0a558SYan, Zheng static void update_backref_node(struct backref_cache *cache, 4623fd0a558SYan, Zheng struct backref_node *node, u64 bytenr) 4633fd0a558SYan, Zheng { 4643fd0a558SYan, Zheng struct rb_node *rb_node; 4653fd0a558SYan, Zheng rb_erase(&node->rb_node, &cache->rb_root); 4663fd0a558SYan, Zheng node->bytenr = bytenr; 4673fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); 46843c04fb1SJeff Mahoney if (rb_node) 46943c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, bytenr); 4703fd0a558SYan, Zheng } 4713fd0a558SYan, Zheng 4723fd0a558SYan, Zheng /* 4733fd0a558SYan, Zheng * update backref cache after a transaction commit 4743fd0a558SYan, Zheng */ 4753fd0a558SYan, Zheng static int update_backref_cache(struct btrfs_trans_handle *trans, 4763fd0a558SYan, Zheng struct backref_cache *cache) 4773fd0a558SYan, Zheng { 4783fd0a558SYan, Zheng struct backref_node *node; 4793fd0a558SYan, Zheng int level = 0; 4803fd0a558SYan, Zheng 4813fd0a558SYan, Zheng if (cache->last_trans == 0) { 4823fd0a558SYan, Zheng cache->last_trans = trans->transid; 4833fd0a558SYan, Zheng return 0; 4843fd0a558SYan, Zheng } 4853fd0a558SYan, Zheng 4863fd0a558SYan, Zheng if (cache->last_trans == trans->transid) 4873fd0a558SYan, Zheng return 0; 4883fd0a558SYan, Zheng 4893fd0a558SYan, Zheng /* 4903fd0a558SYan, Zheng * detached nodes are used to avoid unnecessary backref 4913fd0a558SYan, Zheng * lookup. transaction commit changes the extent tree. 4923fd0a558SYan, Zheng * so the detached nodes are no longer useful. 4933fd0a558SYan, Zheng */ 4943fd0a558SYan, Zheng while (!list_empty(&cache->detached)) { 4953fd0a558SYan, Zheng node = list_entry(cache->detached.next, 4963fd0a558SYan, Zheng struct backref_node, list); 4973fd0a558SYan, Zheng remove_backref_node(cache, node); 4983fd0a558SYan, Zheng } 4993fd0a558SYan, Zheng 5003fd0a558SYan, Zheng while (!list_empty(&cache->changed)) { 5013fd0a558SYan, Zheng node = list_entry(cache->changed.next, 5023fd0a558SYan, Zheng struct backref_node, list); 5033fd0a558SYan, Zheng list_del_init(&node->list); 5043fd0a558SYan, Zheng BUG_ON(node->pending); 5053fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5063fd0a558SYan, Zheng } 5073fd0a558SYan, Zheng 5083fd0a558SYan, Zheng /* 5093fd0a558SYan, Zheng * some nodes can be left in the pending list if there were 5103fd0a558SYan, Zheng * errors during processing the pending nodes. 5113fd0a558SYan, Zheng */ 5123fd0a558SYan, Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 5133fd0a558SYan, Zheng list_for_each_entry(node, &cache->pending[level], list) { 5143fd0a558SYan, Zheng BUG_ON(!node->pending); 5153fd0a558SYan, Zheng if (node->bytenr == node->new_bytenr) 5163fd0a558SYan, Zheng continue; 5173fd0a558SYan, Zheng update_backref_node(cache, node, node->new_bytenr); 5183fd0a558SYan, Zheng } 5193fd0a558SYan, Zheng } 5203fd0a558SYan, Zheng 5213fd0a558SYan, Zheng cache->last_trans = 0; 5223fd0a558SYan, Zheng return 1; 5233fd0a558SYan, Zheng } 5243fd0a558SYan, Zheng 525f2a97a9dSDavid Sterba 5263fd0a558SYan, Zheng static int should_ignore_root(struct btrfs_root *root) 5273fd0a558SYan, Zheng { 5283fd0a558SYan, Zheng struct btrfs_root *reloc_root; 5293fd0a558SYan, Zheng 5303fd0a558SYan, Zheng if (!root->ref_cows) 5313fd0a558SYan, Zheng return 0; 5323fd0a558SYan, Zheng 5333fd0a558SYan, Zheng reloc_root = root->reloc_root; 5343fd0a558SYan, Zheng if (!reloc_root) 5353fd0a558SYan, Zheng return 0; 5363fd0a558SYan, Zheng 5373fd0a558SYan, Zheng if (btrfs_root_last_snapshot(&reloc_root->root_item) == 5383fd0a558SYan, Zheng root->fs_info->running_transaction->transid - 1) 5393fd0a558SYan, Zheng return 0; 5403fd0a558SYan, Zheng /* 5413fd0a558SYan, Zheng * if there is reloc tree and it was created in previous 5423fd0a558SYan, Zheng * transaction backref lookup can find the reloc tree, 5433fd0a558SYan, Zheng * so backref node for the fs tree root is useless for 5443fd0a558SYan, Zheng * relocation. 5453fd0a558SYan, Zheng */ 5463fd0a558SYan, Zheng return 1; 5473fd0a558SYan, Zheng } 5485d4f98a2SYan Zheng /* 5495d4f98a2SYan Zheng * find reloc tree by address of tree root 5505d4f98a2SYan Zheng */ 5515d4f98a2SYan Zheng static struct btrfs_root *find_reloc_root(struct reloc_control *rc, 5525d4f98a2SYan Zheng u64 bytenr) 5535d4f98a2SYan Zheng { 5545d4f98a2SYan Zheng struct rb_node *rb_node; 5555d4f98a2SYan Zheng struct mapping_node *node; 5565d4f98a2SYan Zheng struct btrfs_root *root = NULL; 5575d4f98a2SYan Zheng 5585d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 5595d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); 5605d4f98a2SYan Zheng if (rb_node) { 5615d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 5625d4f98a2SYan Zheng root = (struct btrfs_root *)node->data; 5635d4f98a2SYan Zheng } 5645d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 5655d4f98a2SYan Zheng return root; 5665d4f98a2SYan Zheng } 5675d4f98a2SYan Zheng 5685d4f98a2SYan Zheng static int is_cowonly_root(u64 root_objectid) 5695d4f98a2SYan Zheng { 5705d4f98a2SYan Zheng if (root_objectid == BTRFS_ROOT_TREE_OBJECTID || 5715d4f98a2SYan Zheng root_objectid == BTRFS_EXTENT_TREE_OBJECTID || 5725d4f98a2SYan Zheng root_objectid == BTRFS_CHUNK_TREE_OBJECTID || 5735d4f98a2SYan Zheng root_objectid == BTRFS_DEV_TREE_OBJECTID || 5745d4f98a2SYan Zheng root_objectid == BTRFS_TREE_LOG_OBJECTID || 5755d4f98a2SYan Zheng root_objectid == BTRFS_CSUM_TREE_OBJECTID) 5765d4f98a2SYan Zheng return 1; 5775d4f98a2SYan Zheng return 0; 5785d4f98a2SYan Zheng } 5795d4f98a2SYan Zheng 5805d4f98a2SYan Zheng static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info, 5815d4f98a2SYan Zheng u64 root_objectid) 5825d4f98a2SYan Zheng { 5835d4f98a2SYan Zheng struct btrfs_key key; 5845d4f98a2SYan Zheng 5855d4f98a2SYan Zheng key.objectid = root_objectid; 5865d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 5875d4f98a2SYan Zheng if (is_cowonly_root(root_objectid)) 5885d4f98a2SYan Zheng key.offset = 0; 5895d4f98a2SYan Zheng else 5905d4f98a2SYan Zheng key.offset = (u64)-1; 5915d4f98a2SYan Zheng 5925d4f98a2SYan Zheng return btrfs_read_fs_root_no_name(fs_info, &key); 5935d4f98a2SYan Zheng } 5945d4f98a2SYan Zheng 5955d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 5965d4f98a2SYan Zheng static noinline_for_stack 5975d4f98a2SYan Zheng struct btrfs_root *find_tree_root(struct reloc_control *rc, 5985d4f98a2SYan Zheng struct extent_buffer *leaf, 5995d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0) 6005d4f98a2SYan Zheng { 6015d4f98a2SYan Zheng struct btrfs_root *root; 6025d4f98a2SYan Zheng u64 root_objectid = btrfs_ref_root_v0(leaf, ref0); 6035d4f98a2SYan Zheng u64 generation = btrfs_ref_generation_v0(leaf, ref0); 6045d4f98a2SYan Zheng 6055d4f98a2SYan Zheng BUG_ON(root_objectid == BTRFS_TREE_RELOC_OBJECTID); 6065d4f98a2SYan Zheng 6075d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, root_objectid); 6085d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 6095d4f98a2SYan Zheng 6105d4f98a2SYan Zheng if (root->ref_cows && 6115d4f98a2SYan Zheng generation != btrfs_root_generation(&root->root_item)) 6125d4f98a2SYan Zheng return NULL; 6135d4f98a2SYan Zheng 6145d4f98a2SYan Zheng return root; 6155d4f98a2SYan Zheng } 6165d4f98a2SYan Zheng #endif 6175d4f98a2SYan Zheng 6185d4f98a2SYan Zheng static noinline_for_stack 6195d4f98a2SYan Zheng int find_inline_backref(struct extent_buffer *leaf, int slot, 6205d4f98a2SYan Zheng unsigned long *ptr, unsigned long *end) 6215d4f98a2SYan Zheng { 6223173a18fSJosef Bacik struct btrfs_key key; 6235d4f98a2SYan Zheng struct btrfs_extent_item *ei; 6245d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 6255d4f98a2SYan Zheng u32 item_size; 6265d4f98a2SYan Zheng 6273173a18fSJosef Bacik btrfs_item_key_to_cpu(leaf, &key, slot); 6283173a18fSJosef Bacik 6295d4f98a2SYan Zheng item_size = btrfs_item_size_nr(leaf, slot); 6305d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 6315d4f98a2SYan Zheng if (item_size < sizeof(*ei)) { 6325d4f98a2SYan Zheng WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0)); 6335d4f98a2SYan Zheng return 1; 6345d4f98a2SYan Zheng } 6355d4f98a2SYan Zheng #endif 6365d4f98a2SYan Zheng ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item); 6375d4f98a2SYan Zheng WARN_ON(!(btrfs_extent_flags(leaf, ei) & 6385d4f98a2SYan Zheng BTRFS_EXTENT_FLAG_TREE_BLOCK)); 6395d4f98a2SYan Zheng 6403173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 6413173a18fSJosef Bacik item_size <= sizeof(*ei) + sizeof(*bi)) { 6425d4f98a2SYan Zheng WARN_ON(item_size < sizeof(*ei) + sizeof(*bi)); 6435d4f98a2SYan Zheng return 1; 6445d4f98a2SYan Zheng } 6455d4f98a2SYan Zheng 6463173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) { 6475d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 6485d4f98a2SYan Zheng *ptr = (unsigned long)(bi + 1); 6493173a18fSJosef Bacik } else { 6503173a18fSJosef Bacik *ptr = (unsigned long)(ei + 1); 6513173a18fSJosef Bacik } 6525d4f98a2SYan Zheng *end = (unsigned long)ei + item_size; 6535d4f98a2SYan Zheng return 0; 6545d4f98a2SYan Zheng } 6555d4f98a2SYan Zheng 6565d4f98a2SYan Zheng /* 6575d4f98a2SYan Zheng * build backref tree for a given tree block. root of the backref tree 6585d4f98a2SYan Zheng * corresponds the tree block, leaves of the backref tree correspond 6595d4f98a2SYan Zheng * roots of b-trees that reference the tree block. 6605d4f98a2SYan Zheng * 6615d4f98a2SYan Zheng * the basic idea of this function is check backrefs of a given block 6625d4f98a2SYan Zheng * to find upper level blocks that refernece the block, and then check 6635d4f98a2SYan Zheng * bakcrefs of these upper level blocks recursively. the recursion stop 6645d4f98a2SYan Zheng * when tree root is reached or backrefs for the block is cached. 6655d4f98a2SYan Zheng * 6665d4f98a2SYan Zheng * NOTE: if we find backrefs for a block are cached, we know backrefs 6675d4f98a2SYan Zheng * for all upper level blocks that directly/indirectly reference the 6685d4f98a2SYan Zheng * block are also cached. 6695d4f98a2SYan Zheng */ 6703fd0a558SYan, Zheng static noinline_for_stack 6713fd0a558SYan, Zheng struct backref_node *build_backref_tree(struct reloc_control *rc, 6725d4f98a2SYan Zheng struct btrfs_key *node_key, 6735d4f98a2SYan Zheng int level, u64 bytenr) 6745d4f98a2SYan Zheng { 6753fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 6765d4f98a2SYan Zheng struct btrfs_path *path1; 6775d4f98a2SYan Zheng struct btrfs_path *path2; 6785d4f98a2SYan Zheng struct extent_buffer *eb; 6795d4f98a2SYan Zheng struct btrfs_root *root; 6805d4f98a2SYan Zheng struct backref_node *cur; 6815d4f98a2SYan Zheng struct backref_node *upper; 6825d4f98a2SYan Zheng struct backref_node *lower; 6835d4f98a2SYan Zheng struct backref_node *node = NULL; 6845d4f98a2SYan Zheng struct backref_node *exist = NULL; 6855d4f98a2SYan Zheng struct backref_edge *edge; 6865d4f98a2SYan Zheng struct rb_node *rb_node; 6875d4f98a2SYan Zheng struct btrfs_key key; 6885d4f98a2SYan Zheng unsigned long end; 6895d4f98a2SYan Zheng unsigned long ptr; 6905d4f98a2SYan Zheng LIST_HEAD(list); 6913fd0a558SYan, Zheng LIST_HEAD(useless); 6923fd0a558SYan, Zheng int cowonly; 6935d4f98a2SYan Zheng int ret; 6945d4f98a2SYan Zheng int err = 0; 6955d4f98a2SYan Zheng 6965d4f98a2SYan Zheng path1 = btrfs_alloc_path(); 6975d4f98a2SYan Zheng path2 = btrfs_alloc_path(); 6985d4f98a2SYan Zheng if (!path1 || !path2) { 6995d4f98a2SYan Zheng err = -ENOMEM; 7005d4f98a2SYan Zheng goto out; 7015d4f98a2SYan Zheng } 702026fd317SJosef Bacik path1->reada = 1; 703026fd317SJosef Bacik path2->reada = 2; 7045d4f98a2SYan Zheng 7053fd0a558SYan, Zheng node = alloc_backref_node(cache); 7065d4f98a2SYan Zheng if (!node) { 7075d4f98a2SYan Zheng err = -ENOMEM; 7085d4f98a2SYan Zheng goto out; 7095d4f98a2SYan Zheng } 7105d4f98a2SYan Zheng 7115d4f98a2SYan Zheng node->bytenr = bytenr; 7125d4f98a2SYan Zheng node->level = level; 7135d4f98a2SYan Zheng node->lowest = 1; 7145d4f98a2SYan Zheng cur = node; 7155d4f98a2SYan Zheng again: 7165d4f98a2SYan Zheng end = 0; 7175d4f98a2SYan Zheng ptr = 0; 7185d4f98a2SYan Zheng key.objectid = cur->bytenr; 7193173a18fSJosef Bacik key.type = BTRFS_METADATA_ITEM_KEY; 7205d4f98a2SYan Zheng key.offset = (u64)-1; 7215d4f98a2SYan Zheng 7225d4f98a2SYan Zheng path1->search_commit_root = 1; 7235d4f98a2SYan Zheng path1->skip_locking = 1; 7245d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1, 7255d4f98a2SYan Zheng 0, 0); 7265d4f98a2SYan Zheng if (ret < 0) { 7275d4f98a2SYan Zheng err = ret; 7285d4f98a2SYan Zheng goto out; 7295d4f98a2SYan Zheng } 7305d4f98a2SYan Zheng BUG_ON(!ret || !path1->slots[0]); 7315d4f98a2SYan Zheng 7325d4f98a2SYan Zheng path1->slots[0]--; 7335d4f98a2SYan Zheng 7345d4f98a2SYan Zheng WARN_ON(cur->checked); 7355d4f98a2SYan Zheng if (!list_empty(&cur->upper)) { 7365d4f98a2SYan Zheng /* 73770f23fd6SJustin P. Mattock * the backref was added previously when processing 7385d4f98a2SYan Zheng * backref of type BTRFS_TREE_BLOCK_REF_KEY 7395d4f98a2SYan Zheng */ 7405d4f98a2SYan Zheng BUG_ON(!list_is_singular(&cur->upper)); 7415d4f98a2SYan Zheng edge = list_entry(cur->upper.next, struct backref_edge, 7425d4f98a2SYan Zheng list[LOWER]); 7435d4f98a2SYan Zheng BUG_ON(!list_empty(&edge->list[UPPER])); 7445d4f98a2SYan Zheng exist = edge->node[UPPER]; 7455d4f98a2SYan Zheng /* 7465d4f98a2SYan Zheng * add the upper level block to pending list if we need 7475d4f98a2SYan Zheng * check its backrefs 7485d4f98a2SYan Zheng */ 7495d4f98a2SYan Zheng if (!exist->checked) 7505d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 7515d4f98a2SYan Zheng } else { 7525d4f98a2SYan Zheng exist = NULL; 7535d4f98a2SYan Zheng } 7545d4f98a2SYan Zheng 7555d4f98a2SYan Zheng while (1) { 7565d4f98a2SYan Zheng cond_resched(); 7575d4f98a2SYan Zheng eb = path1->nodes[0]; 7585d4f98a2SYan Zheng 7595d4f98a2SYan Zheng if (ptr >= end) { 7605d4f98a2SYan Zheng if (path1->slots[0] >= btrfs_header_nritems(eb)) { 7615d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path1); 7625d4f98a2SYan Zheng if (ret < 0) { 7635d4f98a2SYan Zheng err = ret; 7645d4f98a2SYan Zheng goto out; 7655d4f98a2SYan Zheng } 7665d4f98a2SYan Zheng if (ret > 0) 7675d4f98a2SYan Zheng break; 7685d4f98a2SYan Zheng eb = path1->nodes[0]; 7695d4f98a2SYan Zheng } 7705d4f98a2SYan Zheng 7715d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path1->slots[0]); 7725d4f98a2SYan Zheng if (key.objectid != cur->bytenr) { 7735d4f98a2SYan Zheng WARN_ON(exist); 7745d4f98a2SYan Zheng break; 7755d4f98a2SYan Zheng } 7765d4f98a2SYan Zheng 7773173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY || 7783173a18fSJosef Bacik key.type == BTRFS_METADATA_ITEM_KEY) { 7795d4f98a2SYan Zheng ret = find_inline_backref(eb, path1->slots[0], 7805d4f98a2SYan Zheng &ptr, &end); 7815d4f98a2SYan Zheng if (ret) 7825d4f98a2SYan Zheng goto next; 7835d4f98a2SYan Zheng } 7845d4f98a2SYan Zheng } 7855d4f98a2SYan Zheng 7865d4f98a2SYan Zheng if (ptr < end) { 7875d4f98a2SYan Zheng /* update key for inline back ref */ 7885d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 7895d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 7905d4f98a2SYan Zheng key.type = btrfs_extent_inline_ref_type(eb, iref); 7915d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 7925d4f98a2SYan Zheng WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY && 7935d4f98a2SYan Zheng key.type != BTRFS_SHARED_BLOCK_REF_KEY); 7945d4f98a2SYan Zheng } 7955d4f98a2SYan Zheng 7965d4f98a2SYan Zheng if (exist && 7975d4f98a2SYan Zheng ((key.type == BTRFS_TREE_BLOCK_REF_KEY && 7985d4f98a2SYan Zheng exist->owner == key.offset) || 7995d4f98a2SYan Zheng (key.type == BTRFS_SHARED_BLOCK_REF_KEY && 8005d4f98a2SYan Zheng exist->bytenr == key.offset))) { 8015d4f98a2SYan Zheng exist = NULL; 8025d4f98a2SYan Zheng goto next; 8035d4f98a2SYan Zheng } 8045d4f98a2SYan Zheng 8055d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 8065d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY || 8075d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 8083fd0a558SYan, Zheng if (key.type == BTRFS_EXTENT_REF_V0_KEY) { 8095d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 8105d4f98a2SYan Zheng ref0 = btrfs_item_ptr(eb, path1->slots[0], 8115d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 8123fd0a558SYan, Zheng if (key.objectid == key.offset) { 813046f264fSYan, Zheng root = find_tree_root(rc, eb, ref0); 8143fd0a558SYan, Zheng if (root && !should_ignore_root(root)) 8155d4f98a2SYan Zheng cur->root = root; 8165d4f98a2SYan Zheng else 8173fd0a558SYan, Zheng list_add(&cur->list, &useless); 8185d4f98a2SYan Zheng break; 8195d4f98a2SYan Zheng } 820046f264fSYan, Zheng if (is_cowonly_root(btrfs_ref_root_v0(eb, 821046f264fSYan, Zheng ref0))) 822046f264fSYan, Zheng cur->cowonly = 1; 8233fd0a558SYan, Zheng } 8245d4f98a2SYan Zheng #else 8255d4f98a2SYan Zheng BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY); 8265d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) { 8275d4f98a2SYan Zheng #endif 8285d4f98a2SYan Zheng if (key.objectid == key.offset) { 8295d4f98a2SYan Zheng /* 8305d4f98a2SYan Zheng * only root blocks of reloc trees use 8315d4f98a2SYan Zheng * backref of this type. 8325d4f98a2SYan Zheng */ 8335d4f98a2SYan Zheng root = find_reloc_root(rc, cur->bytenr); 8345d4f98a2SYan Zheng BUG_ON(!root); 8355d4f98a2SYan Zheng cur->root = root; 8365d4f98a2SYan Zheng break; 8375d4f98a2SYan Zheng } 8385d4f98a2SYan Zheng 8393fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 8405d4f98a2SYan Zheng if (!edge) { 8415d4f98a2SYan Zheng err = -ENOMEM; 8425d4f98a2SYan Zheng goto out; 8435d4f98a2SYan Zheng } 8445d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, key.offset); 8455d4f98a2SYan Zheng if (!rb_node) { 8463fd0a558SYan, Zheng upper = alloc_backref_node(cache); 8475d4f98a2SYan Zheng if (!upper) { 8483fd0a558SYan, Zheng free_backref_edge(cache, edge); 8495d4f98a2SYan Zheng err = -ENOMEM; 8505d4f98a2SYan Zheng goto out; 8515d4f98a2SYan Zheng } 8525d4f98a2SYan Zheng upper->bytenr = key.offset; 8535d4f98a2SYan Zheng upper->level = cur->level + 1; 8545d4f98a2SYan Zheng /* 8555d4f98a2SYan Zheng * backrefs for the upper level block isn't 8565d4f98a2SYan Zheng * cached, add the block to pending list 8575d4f98a2SYan Zheng */ 8585d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 8595d4f98a2SYan Zheng } else { 8605d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 8615d4f98a2SYan Zheng rb_node); 8623fd0a558SYan, Zheng BUG_ON(!upper->checked); 8635d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 8645d4f98a2SYan Zheng } 8653fd0a558SYan, Zheng list_add_tail(&edge->list[LOWER], &cur->upper); 8665d4f98a2SYan Zheng edge->node[LOWER] = cur; 8673fd0a558SYan, Zheng edge->node[UPPER] = upper; 8685d4f98a2SYan Zheng 8695d4f98a2SYan Zheng goto next; 8705d4f98a2SYan Zheng } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) { 8715d4f98a2SYan Zheng goto next; 8725d4f98a2SYan Zheng } 8735d4f98a2SYan Zheng 8745d4f98a2SYan Zheng /* key.type == BTRFS_TREE_BLOCK_REF_KEY */ 8755d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, key.offset); 8765d4f98a2SYan Zheng if (IS_ERR(root)) { 8775d4f98a2SYan Zheng err = PTR_ERR(root); 8785d4f98a2SYan Zheng goto out; 8795d4f98a2SYan Zheng } 8805d4f98a2SYan Zheng 8813fd0a558SYan, Zheng if (!root->ref_cows) 8823fd0a558SYan, Zheng cur->cowonly = 1; 8833fd0a558SYan, Zheng 8845d4f98a2SYan Zheng if (btrfs_root_level(&root->root_item) == cur->level) { 8855d4f98a2SYan Zheng /* tree root */ 8865d4f98a2SYan Zheng BUG_ON(btrfs_root_bytenr(&root->root_item) != 8875d4f98a2SYan Zheng cur->bytenr); 8883fd0a558SYan, Zheng if (should_ignore_root(root)) 8893fd0a558SYan, Zheng list_add(&cur->list, &useless); 8903fd0a558SYan, Zheng else 8915d4f98a2SYan Zheng cur->root = root; 8925d4f98a2SYan Zheng break; 8935d4f98a2SYan Zheng } 8945d4f98a2SYan Zheng 8955d4f98a2SYan Zheng level = cur->level + 1; 8965d4f98a2SYan Zheng 8975d4f98a2SYan Zheng /* 8985d4f98a2SYan Zheng * searching the tree to find upper level blocks 8995d4f98a2SYan Zheng * reference the block. 9005d4f98a2SYan Zheng */ 9015d4f98a2SYan Zheng path2->search_commit_root = 1; 9025d4f98a2SYan Zheng path2->skip_locking = 1; 9035d4f98a2SYan Zheng path2->lowest_level = level; 9045d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0); 9055d4f98a2SYan Zheng path2->lowest_level = 0; 9065d4f98a2SYan Zheng if (ret < 0) { 9075d4f98a2SYan Zheng err = ret; 9085d4f98a2SYan Zheng goto out; 9095d4f98a2SYan Zheng } 91033c66f43SYan Zheng if (ret > 0 && path2->slots[level] > 0) 91133c66f43SYan Zheng path2->slots[level]--; 9125d4f98a2SYan Zheng 9135d4f98a2SYan Zheng eb = path2->nodes[level]; 9145d4f98a2SYan Zheng WARN_ON(btrfs_node_blockptr(eb, path2->slots[level]) != 9155d4f98a2SYan Zheng cur->bytenr); 9165d4f98a2SYan Zheng 9175d4f98a2SYan Zheng lower = cur; 9185d4f98a2SYan Zheng for (; level < BTRFS_MAX_LEVEL; level++) { 9195d4f98a2SYan Zheng if (!path2->nodes[level]) { 9205d4f98a2SYan Zheng BUG_ON(btrfs_root_bytenr(&root->root_item) != 9215d4f98a2SYan Zheng lower->bytenr); 9223fd0a558SYan, Zheng if (should_ignore_root(root)) 9233fd0a558SYan, Zheng list_add(&lower->list, &useless); 9243fd0a558SYan, Zheng else 9255d4f98a2SYan Zheng lower->root = root; 9265d4f98a2SYan Zheng break; 9275d4f98a2SYan Zheng } 9285d4f98a2SYan Zheng 9293fd0a558SYan, Zheng edge = alloc_backref_edge(cache); 9305d4f98a2SYan Zheng if (!edge) { 9315d4f98a2SYan Zheng err = -ENOMEM; 9325d4f98a2SYan Zheng goto out; 9335d4f98a2SYan Zheng } 9345d4f98a2SYan Zheng 9355d4f98a2SYan Zheng eb = path2->nodes[level]; 9365d4f98a2SYan Zheng rb_node = tree_search(&cache->rb_root, eb->start); 9375d4f98a2SYan Zheng if (!rb_node) { 9383fd0a558SYan, Zheng upper = alloc_backref_node(cache); 9395d4f98a2SYan Zheng if (!upper) { 9403fd0a558SYan, Zheng free_backref_edge(cache, edge); 9415d4f98a2SYan Zheng err = -ENOMEM; 9425d4f98a2SYan Zheng goto out; 9435d4f98a2SYan Zheng } 9445d4f98a2SYan Zheng upper->bytenr = eb->start; 9455d4f98a2SYan Zheng upper->owner = btrfs_header_owner(eb); 9465d4f98a2SYan Zheng upper->level = lower->level + 1; 9473fd0a558SYan, Zheng if (!root->ref_cows) 9483fd0a558SYan, Zheng upper->cowonly = 1; 9495d4f98a2SYan Zheng 9505d4f98a2SYan Zheng /* 9515d4f98a2SYan Zheng * if we know the block isn't shared 9525d4f98a2SYan Zheng * we can void checking its backrefs. 9535d4f98a2SYan Zheng */ 9545d4f98a2SYan Zheng if (btrfs_block_can_be_shared(root, eb)) 9555d4f98a2SYan Zheng upper->checked = 0; 9565d4f98a2SYan Zheng else 9575d4f98a2SYan Zheng upper->checked = 1; 9585d4f98a2SYan Zheng 9595d4f98a2SYan Zheng /* 9605d4f98a2SYan Zheng * add the block to pending list if we 9615d4f98a2SYan Zheng * need check its backrefs. only block 9625d4f98a2SYan Zheng * at 'cur->level + 1' is added to the 9635d4f98a2SYan Zheng * tail of pending list. this guarantees 9645d4f98a2SYan Zheng * we check backrefs from lower level 9655d4f98a2SYan Zheng * blocks to upper level blocks. 9665d4f98a2SYan Zheng */ 9675d4f98a2SYan Zheng if (!upper->checked && 9685d4f98a2SYan Zheng level == cur->level + 1) { 9695d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], 9705d4f98a2SYan Zheng &list); 9715d4f98a2SYan Zheng } else 9725d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 9735d4f98a2SYan Zheng } else { 9745d4f98a2SYan Zheng upper = rb_entry(rb_node, struct backref_node, 9755d4f98a2SYan Zheng rb_node); 9765d4f98a2SYan Zheng BUG_ON(!upper->checked); 9775d4f98a2SYan Zheng INIT_LIST_HEAD(&edge->list[UPPER]); 9783fd0a558SYan, Zheng if (!upper->owner) 9793fd0a558SYan, Zheng upper->owner = btrfs_header_owner(eb); 9805d4f98a2SYan Zheng } 9815d4f98a2SYan Zheng list_add_tail(&edge->list[LOWER], &lower->upper); 9825d4f98a2SYan Zheng edge->node[LOWER] = lower; 9833fd0a558SYan, Zheng edge->node[UPPER] = upper; 9845d4f98a2SYan Zheng 9855d4f98a2SYan Zheng if (rb_node) 9865d4f98a2SYan Zheng break; 9875d4f98a2SYan Zheng lower = upper; 9885d4f98a2SYan Zheng upper = NULL; 9895d4f98a2SYan Zheng } 990b3b4aa74SDavid Sterba btrfs_release_path(path2); 9915d4f98a2SYan Zheng next: 9925d4f98a2SYan Zheng if (ptr < end) { 9935d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 9945d4f98a2SYan Zheng if (ptr >= end) { 9955d4f98a2SYan Zheng WARN_ON(ptr > end); 9965d4f98a2SYan Zheng ptr = 0; 9975d4f98a2SYan Zheng end = 0; 9985d4f98a2SYan Zheng } 9995d4f98a2SYan Zheng } 10005d4f98a2SYan Zheng if (ptr >= end) 10015d4f98a2SYan Zheng path1->slots[0]++; 10025d4f98a2SYan Zheng } 1003b3b4aa74SDavid Sterba btrfs_release_path(path1); 10045d4f98a2SYan Zheng 10055d4f98a2SYan Zheng cur->checked = 1; 10065d4f98a2SYan Zheng WARN_ON(exist); 10075d4f98a2SYan Zheng 10085d4f98a2SYan Zheng /* the pending list isn't empty, take the first block to process */ 10095d4f98a2SYan Zheng if (!list_empty(&list)) { 10105d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10115d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10125d4f98a2SYan Zheng cur = edge->node[UPPER]; 10135d4f98a2SYan Zheng goto again; 10145d4f98a2SYan Zheng } 10155d4f98a2SYan Zheng 10165d4f98a2SYan Zheng /* 10175d4f98a2SYan Zheng * everything goes well, connect backref nodes and insert backref nodes 10185d4f98a2SYan Zheng * into the cache. 10195d4f98a2SYan Zheng */ 10205d4f98a2SYan Zheng BUG_ON(!node->checked); 10213fd0a558SYan, Zheng cowonly = node->cowonly; 10223fd0a558SYan, Zheng if (!cowonly) { 10233fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, node->bytenr, 10243fd0a558SYan, Zheng &node->rb_node); 102543c04fb1SJeff Mahoney if (rb_node) 102643c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 10273fd0a558SYan, Zheng list_add_tail(&node->lower, &cache->leaves); 10283fd0a558SYan, Zheng } 10295d4f98a2SYan Zheng 10305d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) 10315d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10325d4f98a2SYan Zheng 10335d4f98a2SYan Zheng while (!list_empty(&list)) { 10345d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, list[UPPER]); 10355d4f98a2SYan Zheng list_del_init(&edge->list[UPPER]); 10365d4f98a2SYan Zheng upper = edge->node[UPPER]; 10373fd0a558SYan, Zheng if (upper->detached) { 10383fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10393fd0a558SYan, Zheng lower = edge->node[LOWER]; 10403fd0a558SYan, Zheng free_backref_edge(cache, edge); 10413fd0a558SYan, Zheng if (list_empty(&lower->upper)) 10423fd0a558SYan, Zheng list_add(&lower->list, &useless); 10433fd0a558SYan, Zheng continue; 10443fd0a558SYan, Zheng } 10455d4f98a2SYan Zheng 10465d4f98a2SYan Zheng if (!RB_EMPTY_NODE(&upper->rb_node)) { 10475d4f98a2SYan Zheng if (upper->lowest) { 10485d4f98a2SYan Zheng list_del_init(&upper->lower); 10495d4f98a2SYan Zheng upper->lowest = 0; 10505d4f98a2SYan Zheng } 10515d4f98a2SYan Zheng 10525d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10535d4f98a2SYan Zheng continue; 10545d4f98a2SYan Zheng } 10555d4f98a2SYan Zheng 10565d4f98a2SYan Zheng BUG_ON(!upper->checked); 10573fd0a558SYan, Zheng BUG_ON(cowonly != upper->cowonly); 10583fd0a558SYan, Zheng if (!cowonly) { 10595d4f98a2SYan Zheng rb_node = tree_insert(&cache->rb_root, upper->bytenr, 10605d4f98a2SYan Zheng &upper->rb_node); 106143c04fb1SJeff Mahoney if (rb_node) 106243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 106343c04fb1SJeff Mahoney upper->bytenr); 10643fd0a558SYan, Zheng } 10655d4f98a2SYan Zheng 10665d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &upper->lower); 10675d4f98a2SYan Zheng 10685d4f98a2SYan Zheng list_for_each_entry(edge, &upper->upper, list[LOWER]) 10695d4f98a2SYan Zheng list_add_tail(&edge->list[UPPER], &list); 10705d4f98a2SYan Zheng } 10713fd0a558SYan, Zheng /* 10723fd0a558SYan, Zheng * process useless backref nodes. backref nodes for tree leaves 10733fd0a558SYan, Zheng * are deleted from the cache. backref nodes for upper level 10743fd0a558SYan, Zheng * tree blocks are left in the cache to avoid unnecessary backref 10753fd0a558SYan, Zheng * lookup. 10763fd0a558SYan, Zheng */ 10773fd0a558SYan, Zheng while (!list_empty(&useless)) { 10783fd0a558SYan, Zheng upper = list_entry(useless.next, struct backref_node, list); 10793fd0a558SYan, Zheng list_del_init(&upper->list); 10803fd0a558SYan, Zheng BUG_ON(!list_empty(&upper->upper)); 10813fd0a558SYan, Zheng if (upper == node) 10823fd0a558SYan, Zheng node = NULL; 10833fd0a558SYan, Zheng if (upper->lowest) { 10843fd0a558SYan, Zheng list_del_init(&upper->lower); 10853fd0a558SYan, Zheng upper->lowest = 0; 10863fd0a558SYan, Zheng } 10873fd0a558SYan, Zheng while (!list_empty(&upper->lower)) { 10883fd0a558SYan, Zheng edge = list_entry(upper->lower.next, 10893fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 10903fd0a558SYan, Zheng list_del(&edge->list[UPPER]); 10913fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 10923fd0a558SYan, Zheng lower = edge->node[LOWER]; 10933fd0a558SYan, Zheng free_backref_edge(cache, edge); 10943fd0a558SYan, Zheng 10953fd0a558SYan, Zheng if (list_empty(&lower->upper)) 10963fd0a558SYan, Zheng list_add(&lower->list, &useless); 10973fd0a558SYan, Zheng } 10983fd0a558SYan, Zheng __mark_block_processed(rc, upper); 10993fd0a558SYan, Zheng if (upper->level > 0) { 11003fd0a558SYan, Zheng list_add(&upper->list, &cache->detached); 11013fd0a558SYan, Zheng upper->detached = 1; 11023fd0a558SYan, Zheng } else { 11033fd0a558SYan, Zheng rb_erase(&upper->rb_node, &cache->rb_root); 11043fd0a558SYan, Zheng free_backref_node(cache, upper); 11053fd0a558SYan, Zheng } 11063fd0a558SYan, Zheng } 11075d4f98a2SYan Zheng out: 11085d4f98a2SYan Zheng btrfs_free_path(path1); 11095d4f98a2SYan Zheng btrfs_free_path(path2); 11105d4f98a2SYan Zheng if (err) { 11113fd0a558SYan, Zheng while (!list_empty(&useless)) { 11123fd0a558SYan, Zheng lower = list_entry(useless.next, 11133fd0a558SYan, Zheng struct backref_node, upper); 11143fd0a558SYan, Zheng list_del_init(&lower->upper); 11153fd0a558SYan, Zheng } 11165d4f98a2SYan Zheng upper = node; 11173fd0a558SYan, Zheng INIT_LIST_HEAD(&list); 11185d4f98a2SYan Zheng while (upper) { 11195d4f98a2SYan Zheng if (RB_EMPTY_NODE(&upper->rb_node)) { 11205d4f98a2SYan Zheng list_splice_tail(&upper->upper, &list); 11213fd0a558SYan, Zheng free_backref_node(cache, upper); 11225d4f98a2SYan Zheng } 11235d4f98a2SYan Zheng 11245d4f98a2SYan Zheng if (list_empty(&list)) 11255d4f98a2SYan Zheng break; 11265d4f98a2SYan Zheng 11275d4f98a2SYan Zheng edge = list_entry(list.next, struct backref_edge, 11285d4f98a2SYan Zheng list[LOWER]); 11293fd0a558SYan, Zheng list_del(&edge->list[LOWER]); 11305d4f98a2SYan Zheng upper = edge->node[UPPER]; 11313fd0a558SYan, Zheng free_backref_edge(cache, edge); 11325d4f98a2SYan Zheng } 11335d4f98a2SYan Zheng return ERR_PTR(err); 11345d4f98a2SYan Zheng } 11353fd0a558SYan, Zheng BUG_ON(node && node->detached); 11365d4f98a2SYan Zheng return node; 11375d4f98a2SYan Zheng } 11385d4f98a2SYan Zheng 11395d4f98a2SYan Zheng /* 11403fd0a558SYan, Zheng * helper to add backref node for the newly created snapshot. 11413fd0a558SYan, Zheng * the backref node is created by cloning backref node that 11423fd0a558SYan, Zheng * corresponds to root of source tree 11433fd0a558SYan, Zheng */ 11443fd0a558SYan, Zheng static int clone_backref_node(struct btrfs_trans_handle *trans, 11453fd0a558SYan, Zheng struct reloc_control *rc, 11463fd0a558SYan, Zheng struct btrfs_root *src, 11473fd0a558SYan, Zheng struct btrfs_root *dest) 11483fd0a558SYan, Zheng { 11493fd0a558SYan, Zheng struct btrfs_root *reloc_root = src->reloc_root; 11503fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 11513fd0a558SYan, Zheng struct backref_node *node = NULL; 11523fd0a558SYan, Zheng struct backref_node *new_node; 11533fd0a558SYan, Zheng struct backref_edge *edge; 11543fd0a558SYan, Zheng struct backref_edge *new_edge; 11553fd0a558SYan, Zheng struct rb_node *rb_node; 11563fd0a558SYan, Zheng 11573fd0a558SYan, Zheng if (cache->last_trans > 0) 11583fd0a558SYan, Zheng update_backref_cache(trans, cache); 11593fd0a558SYan, Zheng 11603fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, src->commit_root->start); 11613fd0a558SYan, Zheng if (rb_node) { 11623fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, rb_node); 11633fd0a558SYan, Zheng if (node->detached) 11643fd0a558SYan, Zheng node = NULL; 11653fd0a558SYan, Zheng else 11663fd0a558SYan, Zheng BUG_ON(node->new_bytenr != reloc_root->node->start); 11673fd0a558SYan, Zheng } 11683fd0a558SYan, Zheng 11693fd0a558SYan, Zheng if (!node) { 11703fd0a558SYan, Zheng rb_node = tree_search(&cache->rb_root, 11713fd0a558SYan, Zheng reloc_root->commit_root->start); 11723fd0a558SYan, Zheng if (rb_node) { 11733fd0a558SYan, Zheng node = rb_entry(rb_node, struct backref_node, 11743fd0a558SYan, Zheng rb_node); 11753fd0a558SYan, Zheng BUG_ON(node->detached); 11763fd0a558SYan, Zheng } 11773fd0a558SYan, Zheng } 11783fd0a558SYan, Zheng 11793fd0a558SYan, Zheng if (!node) 11803fd0a558SYan, Zheng return 0; 11813fd0a558SYan, Zheng 11823fd0a558SYan, Zheng new_node = alloc_backref_node(cache); 11833fd0a558SYan, Zheng if (!new_node) 11843fd0a558SYan, Zheng return -ENOMEM; 11853fd0a558SYan, Zheng 11863fd0a558SYan, Zheng new_node->bytenr = dest->node->start; 11873fd0a558SYan, Zheng new_node->level = node->level; 11883fd0a558SYan, Zheng new_node->lowest = node->lowest; 11896848ad64SYan, Zheng new_node->checked = 1; 11903fd0a558SYan, Zheng new_node->root = dest; 11913fd0a558SYan, Zheng 11923fd0a558SYan, Zheng if (!node->lowest) { 11933fd0a558SYan, Zheng list_for_each_entry(edge, &node->lower, list[UPPER]) { 11943fd0a558SYan, Zheng new_edge = alloc_backref_edge(cache); 11953fd0a558SYan, Zheng if (!new_edge) 11963fd0a558SYan, Zheng goto fail; 11973fd0a558SYan, Zheng 11983fd0a558SYan, Zheng new_edge->node[UPPER] = new_node; 11993fd0a558SYan, Zheng new_edge->node[LOWER] = edge->node[LOWER]; 12003fd0a558SYan, Zheng list_add_tail(&new_edge->list[UPPER], 12013fd0a558SYan, Zheng &new_node->lower); 12023fd0a558SYan, Zheng } 120376b9e23dSMiao Xie } else { 120476b9e23dSMiao Xie list_add_tail(&new_node->lower, &cache->leaves); 12053fd0a558SYan, Zheng } 12063fd0a558SYan, Zheng 12073fd0a558SYan, Zheng rb_node = tree_insert(&cache->rb_root, new_node->bytenr, 12083fd0a558SYan, Zheng &new_node->rb_node); 120943c04fb1SJeff Mahoney if (rb_node) 121043c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); 12113fd0a558SYan, Zheng 12123fd0a558SYan, Zheng if (!new_node->lowest) { 12133fd0a558SYan, Zheng list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { 12143fd0a558SYan, Zheng list_add_tail(&new_edge->list[LOWER], 12153fd0a558SYan, Zheng &new_edge->node[LOWER]->upper); 12163fd0a558SYan, Zheng } 12173fd0a558SYan, Zheng } 12183fd0a558SYan, Zheng return 0; 12193fd0a558SYan, Zheng fail: 12203fd0a558SYan, Zheng while (!list_empty(&new_node->lower)) { 12213fd0a558SYan, Zheng new_edge = list_entry(new_node->lower.next, 12223fd0a558SYan, Zheng struct backref_edge, list[UPPER]); 12233fd0a558SYan, Zheng list_del(&new_edge->list[UPPER]); 12243fd0a558SYan, Zheng free_backref_edge(cache, new_edge); 12253fd0a558SYan, Zheng } 12263fd0a558SYan, Zheng free_backref_node(cache, new_node); 12273fd0a558SYan, Zheng return -ENOMEM; 12283fd0a558SYan, Zheng } 12293fd0a558SYan, Zheng 12303fd0a558SYan, Zheng /* 12315d4f98a2SYan Zheng * helper to add 'address of tree root -> reloc tree' mapping 12325d4f98a2SYan Zheng */ 1233ffd7b339SJeff Mahoney static int __must_check __add_reloc_root(struct btrfs_root *root) 12345d4f98a2SYan Zheng { 12355d4f98a2SYan Zheng struct rb_node *rb_node; 12365d4f98a2SYan Zheng struct mapping_node *node; 12375d4f98a2SYan Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 12385d4f98a2SYan Zheng 12395d4f98a2SYan Zheng node = kmalloc(sizeof(*node), GFP_NOFS); 1240ffd7b339SJeff Mahoney if (!node) 1241ffd7b339SJeff Mahoney return -ENOMEM; 12425d4f98a2SYan Zheng 12435d4f98a2SYan Zheng node->bytenr = root->node->start; 12445d4f98a2SYan Zheng node->data = root; 12455d4f98a2SYan Zheng 12465d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12475d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 12485d4f98a2SYan Zheng node->bytenr, &node->rb_node); 12495d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 1250ffd7b339SJeff Mahoney if (rb_node) { 1251ffd7b339SJeff Mahoney btrfs_panic(root->fs_info, -EEXIST, "Duplicate root found " 1252ffd7b339SJeff Mahoney "for start=%llu while inserting into relocation " 1253533574c6SJoe Perches "tree\n", node->bytenr); 125423291a04SDan Carpenter kfree(node); 125523291a04SDan Carpenter return -EEXIST; 1256ffd7b339SJeff Mahoney } 12575d4f98a2SYan Zheng 12585d4f98a2SYan Zheng list_add_tail(&root->root_list, &rc->reloc_roots); 12595d4f98a2SYan Zheng return 0; 12605d4f98a2SYan Zheng } 12615d4f98a2SYan Zheng 12625d4f98a2SYan Zheng /* 12635d4f98a2SYan Zheng * helper to update/delete the 'address of tree root -> reloc tree' 12645d4f98a2SYan Zheng * mapping 12655d4f98a2SYan Zheng */ 12665d4f98a2SYan Zheng static int __update_reloc_root(struct btrfs_root *root, int del) 12675d4f98a2SYan Zheng { 12685d4f98a2SYan Zheng struct rb_node *rb_node; 12695d4f98a2SYan Zheng struct mapping_node *node = NULL; 12705d4f98a2SYan Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 12715d4f98a2SYan Zheng 12725d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12735d4f98a2SYan Zheng rb_node = tree_search(&rc->reloc_root_tree.rb_root, 12745d4f98a2SYan Zheng root->commit_root->start); 12755d4f98a2SYan Zheng if (rb_node) { 12765d4f98a2SYan Zheng node = rb_entry(rb_node, struct mapping_node, rb_node); 12775d4f98a2SYan Zheng rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); 12785d4f98a2SYan Zheng } 12795d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 12805d4f98a2SYan Zheng 12818f71f3e0SLiu Bo if (!node) 12828f71f3e0SLiu Bo return 0; 12835d4f98a2SYan Zheng BUG_ON((struct btrfs_root *)node->data != root); 12845d4f98a2SYan Zheng 12855d4f98a2SYan Zheng if (!del) { 12865d4f98a2SYan Zheng spin_lock(&rc->reloc_root_tree.lock); 12875d4f98a2SYan Zheng node->bytenr = root->node->start; 12885d4f98a2SYan Zheng rb_node = tree_insert(&rc->reloc_root_tree.rb_root, 12895d4f98a2SYan Zheng node->bytenr, &node->rb_node); 12905d4f98a2SYan Zheng spin_unlock(&rc->reloc_root_tree.lock); 129143c04fb1SJeff Mahoney if (rb_node) 129243c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, node->bytenr); 12935d4f98a2SYan Zheng } else { 12941daf3540SDaniel J Blueman spin_lock(&root->fs_info->trans_lock); 12955d4f98a2SYan Zheng list_del_init(&root->root_list); 12961daf3540SDaniel J Blueman spin_unlock(&root->fs_info->trans_lock); 12975d4f98a2SYan Zheng kfree(node); 12985d4f98a2SYan Zheng } 12995d4f98a2SYan Zheng return 0; 13005d4f98a2SYan Zheng } 13015d4f98a2SYan Zheng 13023fd0a558SYan, Zheng static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans, 13033fd0a558SYan, Zheng struct btrfs_root *root, u64 objectid) 13045d4f98a2SYan Zheng { 13055d4f98a2SYan Zheng struct btrfs_root *reloc_root; 13065d4f98a2SYan Zheng struct extent_buffer *eb; 13075d4f98a2SYan Zheng struct btrfs_root_item *root_item; 13085d4f98a2SYan Zheng struct btrfs_key root_key; 13095d4f98a2SYan Zheng int ret; 13105d4f98a2SYan Zheng 13115d4f98a2SYan Zheng root_item = kmalloc(sizeof(*root_item), GFP_NOFS); 13125d4f98a2SYan Zheng BUG_ON(!root_item); 13135d4f98a2SYan Zheng 13145d4f98a2SYan Zheng root_key.objectid = BTRFS_TREE_RELOC_OBJECTID; 13155d4f98a2SYan Zheng root_key.type = BTRFS_ROOT_ITEM_KEY; 13163fd0a558SYan, Zheng root_key.offset = objectid; 13175d4f98a2SYan Zheng 13183fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 13193fd0a558SYan, Zheng /* called by btrfs_init_reloc_root */ 13205d4f98a2SYan Zheng ret = btrfs_copy_root(trans, root, root->commit_root, &eb, 13215d4f98a2SYan Zheng BTRFS_TREE_RELOC_OBJECTID); 13225d4f98a2SYan Zheng BUG_ON(ret); 13235d4f98a2SYan Zheng 13243fd0a558SYan, Zheng btrfs_set_root_last_snapshot(&root->root_item, 13253fd0a558SYan, Zheng trans->transid - 1); 13263fd0a558SYan, Zheng } else { 13273fd0a558SYan, Zheng /* 13283fd0a558SYan, Zheng * called by btrfs_reloc_post_snapshot_hook. 13293fd0a558SYan, Zheng * the source tree is a reloc tree, all tree blocks 13303fd0a558SYan, Zheng * modified after it was created have RELOC flag 13313fd0a558SYan, Zheng * set in their headers. so it's OK to not update 13323fd0a558SYan, Zheng * the 'last_snapshot'. 13333fd0a558SYan, Zheng */ 13343fd0a558SYan, Zheng ret = btrfs_copy_root(trans, root, root->node, &eb, 13353fd0a558SYan, Zheng BTRFS_TREE_RELOC_OBJECTID); 13363fd0a558SYan, Zheng BUG_ON(ret); 13373fd0a558SYan, Zheng } 13383fd0a558SYan, Zheng 13395d4f98a2SYan Zheng memcpy(root_item, &root->root_item, sizeof(*root_item)); 13405d4f98a2SYan Zheng btrfs_set_root_bytenr(root_item, eb->start); 13415d4f98a2SYan Zheng btrfs_set_root_level(root_item, btrfs_header_level(eb)); 13425d4f98a2SYan Zheng btrfs_set_root_generation(root_item, trans->transid); 13433fd0a558SYan, Zheng 13443fd0a558SYan, Zheng if (root->root_key.objectid == objectid) { 13453fd0a558SYan, Zheng btrfs_set_root_refs(root_item, 0); 13463fd0a558SYan, Zheng memset(&root_item->drop_progress, 0, 13473fd0a558SYan, Zheng sizeof(struct btrfs_disk_key)); 13485d4f98a2SYan Zheng root_item->drop_level = 0; 13493fd0a558SYan, Zheng } 13505d4f98a2SYan Zheng 13515d4f98a2SYan Zheng btrfs_tree_unlock(eb); 13525d4f98a2SYan Zheng free_extent_buffer(eb); 13535d4f98a2SYan Zheng 13545d4f98a2SYan Zheng ret = btrfs_insert_root(trans, root->fs_info->tree_root, 13555d4f98a2SYan Zheng &root_key, root_item); 13565d4f98a2SYan Zheng BUG_ON(ret); 13575d4f98a2SYan Zheng kfree(root_item); 13585d4f98a2SYan Zheng 13595d4f98a2SYan Zheng reloc_root = btrfs_read_fs_root_no_radix(root->fs_info->tree_root, 13605d4f98a2SYan Zheng &root_key); 13615d4f98a2SYan Zheng BUG_ON(IS_ERR(reloc_root)); 13625d4f98a2SYan Zheng reloc_root->last_trans = trans->transid; 13633fd0a558SYan, Zheng return reloc_root; 13643fd0a558SYan, Zheng } 13653fd0a558SYan, Zheng 13663fd0a558SYan, Zheng /* 13673fd0a558SYan, Zheng * create reloc tree for a given fs tree. reloc tree is just a 13683fd0a558SYan, Zheng * snapshot of the fs tree with special root objectid. 13693fd0a558SYan, Zheng */ 13703fd0a558SYan, Zheng int btrfs_init_reloc_root(struct btrfs_trans_handle *trans, 13713fd0a558SYan, Zheng struct btrfs_root *root) 13723fd0a558SYan, Zheng { 13733fd0a558SYan, Zheng struct btrfs_root *reloc_root; 13743fd0a558SYan, Zheng struct reloc_control *rc = root->fs_info->reloc_ctl; 13753fd0a558SYan, Zheng int clear_rsv = 0; 1376ffd7b339SJeff Mahoney int ret; 13773fd0a558SYan, Zheng 13783fd0a558SYan, Zheng if (root->reloc_root) { 13793fd0a558SYan, Zheng reloc_root = root->reloc_root; 13803fd0a558SYan, Zheng reloc_root->last_trans = trans->transid; 13813fd0a558SYan, Zheng return 0; 13823fd0a558SYan, Zheng } 13833fd0a558SYan, Zheng 13843fd0a558SYan, Zheng if (!rc || !rc->create_reloc_tree || 13853fd0a558SYan, Zheng root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 13863fd0a558SYan, Zheng return 0; 13873fd0a558SYan, Zheng 13883fd0a558SYan, Zheng if (!trans->block_rsv) { 13893fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 13903fd0a558SYan, Zheng clear_rsv = 1; 13913fd0a558SYan, Zheng } 13923fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root, root->root_key.objectid); 13933fd0a558SYan, Zheng if (clear_rsv) 13943fd0a558SYan, Zheng trans->block_rsv = NULL; 13955d4f98a2SYan Zheng 1396ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 1397ffd7b339SJeff Mahoney BUG_ON(ret < 0); 13985d4f98a2SYan Zheng root->reloc_root = reloc_root; 13995d4f98a2SYan Zheng return 0; 14005d4f98a2SYan Zheng } 14015d4f98a2SYan Zheng 14025d4f98a2SYan Zheng /* 14035d4f98a2SYan Zheng * update root item of reloc tree 14045d4f98a2SYan Zheng */ 14055d4f98a2SYan Zheng int btrfs_update_reloc_root(struct btrfs_trans_handle *trans, 14065d4f98a2SYan Zheng struct btrfs_root *root) 14075d4f98a2SYan Zheng { 14085d4f98a2SYan Zheng struct btrfs_root *reloc_root; 14095d4f98a2SYan Zheng struct btrfs_root_item *root_item; 14105d4f98a2SYan Zheng int del = 0; 14115d4f98a2SYan Zheng int ret; 14125d4f98a2SYan Zheng 14135d4f98a2SYan Zheng if (!root->reloc_root) 14147585717fSChris Mason goto out; 14155d4f98a2SYan Zheng 14165d4f98a2SYan Zheng reloc_root = root->reloc_root; 14175d4f98a2SYan Zheng root_item = &reloc_root->root_item; 14185d4f98a2SYan Zheng 14193fd0a558SYan, Zheng if (root->fs_info->reloc_ctl->merge_reloc_tree && 14203fd0a558SYan, Zheng btrfs_root_refs(root_item) == 0) { 14215d4f98a2SYan Zheng root->reloc_root = NULL; 14225d4f98a2SYan Zheng del = 1; 14235d4f98a2SYan Zheng } 14245d4f98a2SYan Zheng 14255d4f98a2SYan Zheng __update_reloc_root(reloc_root, del); 14265d4f98a2SYan Zheng 14275d4f98a2SYan Zheng if (reloc_root->commit_root != reloc_root->node) { 14285d4f98a2SYan Zheng btrfs_set_root_node(root_item, reloc_root->node); 14295d4f98a2SYan Zheng free_extent_buffer(reloc_root->commit_root); 14305d4f98a2SYan Zheng reloc_root->commit_root = btrfs_root_node(reloc_root); 14315d4f98a2SYan Zheng } 14325d4f98a2SYan Zheng 14335d4f98a2SYan Zheng ret = btrfs_update_root(trans, root->fs_info->tree_root, 14345d4f98a2SYan Zheng &reloc_root->root_key, root_item); 14355d4f98a2SYan Zheng BUG_ON(ret); 14367585717fSChris Mason 14377585717fSChris Mason out: 14385d4f98a2SYan Zheng return 0; 14395d4f98a2SYan Zheng } 14405d4f98a2SYan Zheng 14415d4f98a2SYan Zheng /* 14425d4f98a2SYan Zheng * helper to find first cached inode with inode number >= objectid 14435d4f98a2SYan Zheng * in a subvolume 14445d4f98a2SYan Zheng */ 14455d4f98a2SYan Zheng static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid) 14465d4f98a2SYan Zheng { 14475d4f98a2SYan Zheng struct rb_node *node; 14485d4f98a2SYan Zheng struct rb_node *prev; 14495d4f98a2SYan Zheng struct btrfs_inode *entry; 14505d4f98a2SYan Zheng struct inode *inode; 14515d4f98a2SYan Zheng 14525d4f98a2SYan Zheng spin_lock(&root->inode_lock); 14535d4f98a2SYan Zheng again: 14545d4f98a2SYan Zheng node = root->inode_tree.rb_node; 14555d4f98a2SYan Zheng prev = NULL; 14565d4f98a2SYan Zheng while (node) { 14575d4f98a2SYan Zheng prev = node; 14585d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 14595d4f98a2SYan Zheng 146033345d01SLi Zefan if (objectid < btrfs_ino(&entry->vfs_inode)) 14615d4f98a2SYan Zheng node = node->rb_left; 146233345d01SLi Zefan else if (objectid > btrfs_ino(&entry->vfs_inode)) 14635d4f98a2SYan Zheng node = node->rb_right; 14645d4f98a2SYan Zheng else 14655d4f98a2SYan Zheng break; 14665d4f98a2SYan Zheng } 14675d4f98a2SYan Zheng if (!node) { 14685d4f98a2SYan Zheng while (prev) { 14695d4f98a2SYan Zheng entry = rb_entry(prev, struct btrfs_inode, rb_node); 147033345d01SLi Zefan if (objectid <= btrfs_ino(&entry->vfs_inode)) { 14715d4f98a2SYan Zheng node = prev; 14725d4f98a2SYan Zheng break; 14735d4f98a2SYan Zheng } 14745d4f98a2SYan Zheng prev = rb_next(prev); 14755d4f98a2SYan Zheng } 14765d4f98a2SYan Zheng } 14775d4f98a2SYan Zheng while (node) { 14785d4f98a2SYan Zheng entry = rb_entry(node, struct btrfs_inode, rb_node); 14795d4f98a2SYan Zheng inode = igrab(&entry->vfs_inode); 14805d4f98a2SYan Zheng if (inode) { 14815d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 14825d4f98a2SYan Zheng return inode; 14835d4f98a2SYan Zheng } 14845d4f98a2SYan Zheng 148533345d01SLi Zefan objectid = btrfs_ino(&entry->vfs_inode) + 1; 14865d4f98a2SYan Zheng if (cond_resched_lock(&root->inode_lock)) 14875d4f98a2SYan Zheng goto again; 14885d4f98a2SYan Zheng 14895d4f98a2SYan Zheng node = rb_next(node); 14905d4f98a2SYan Zheng } 14915d4f98a2SYan Zheng spin_unlock(&root->inode_lock); 14925d4f98a2SYan Zheng return NULL; 14935d4f98a2SYan Zheng } 14945d4f98a2SYan Zheng 14955d4f98a2SYan Zheng static int in_block_group(u64 bytenr, 14965d4f98a2SYan Zheng struct btrfs_block_group_cache *block_group) 14975d4f98a2SYan Zheng { 14985d4f98a2SYan Zheng if (bytenr >= block_group->key.objectid && 14995d4f98a2SYan Zheng bytenr < block_group->key.objectid + block_group->key.offset) 15005d4f98a2SYan Zheng return 1; 15015d4f98a2SYan Zheng return 0; 15025d4f98a2SYan Zheng } 15035d4f98a2SYan Zheng 15045d4f98a2SYan Zheng /* 15055d4f98a2SYan Zheng * get new location of data 15065d4f98a2SYan Zheng */ 15075d4f98a2SYan Zheng static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr, 15085d4f98a2SYan Zheng u64 bytenr, u64 num_bytes) 15095d4f98a2SYan Zheng { 15105d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(reloc_inode)->root; 15115d4f98a2SYan Zheng struct btrfs_path *path; 15125d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 15135d4f98a2SYan Zheng struct extent_buffer *leaf; 15145d4f98a2SYan Zheng int ret; 15155d4f98a2SYan Zheng 15165d4f98a2SYan Zheng path = btrfs_alloc_path(); 15175d4f98a2SYan Zheng if (!path) 15185d4f98a2SYan Zheng return -ENOMEM; 15195d4f98a2SYan Zheng 15205d4f98a2SYan Zheng bytenr -= BTRFS_I(reloc_inode)->index_cnt; 152133345d01SLi Zefan ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(reloc_inode), 15225d4f98a2SYan Zheng bytenr, 0); 15235d4f98a2SYan Zheng if (ret < 0) 15245d4f98a2SYan Zheng goto out; 15255d4f98a2SYan Zheng if (ret > 0) { 15265d4f98a2SYan Zheng ret = -ENOENT; 15275d4f98a2SYan Zheng goto out; 15285d4f98a2SYan Zheng } 15295d4f98a2SYan Zheng 15305d4f98a2SYan Zheng leaf = path->nodes[0]; 15315d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 15325d4f98a2SYan Zheng struct btrfs_file_extent_item); 15335d4f98a2SYan Zheng 15345d4f98a2SYan Zheng BUG_ON(btrfs_file_extent_offset(leaf, fi) || 15355d4f98a2SYan Zheng btrfs_file_extent_compression(leaf, fi) || 15365d4f98a2SYan Zheng btrfs_file_extent_encryption(leaf, fi) || 15375d4f98a2SYan Zheng btrfs_file_extent_other_encoding(leaf, fi)); 15385d4f98a2SYan Zheng 15395d4f98a2SYan Zheng if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) { 15405d4f98a2SYan Zheng ret = 1; 15415d4f98a2SYan Zheng goto out; 15425d4f98a2SYan Zheng } 15435d4f98a2SYan Zheng 15445d4f98a2SYan Zheng *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 15455d4f98a2SYan Zheng ret = 0; 15465d4f98a2SYan Zheng out: 15475d4f98a2SYan Zheng btrfs_free_path(path); 15485d4f98a2SYan Zheng return ret; 15495d4f98a2SYan Zheng } 15505d4f98a2SYan Zheng 15515d4f98a2SYan Zheng /* 15525d4f98a2SYan Zheng * update file extent items in the tree leaf to point to 15535d4f98a2SYan Zheng * the new locations. 15545d4f98a2SYan Zheng */ 15553fd0a558SYan, Zheng static noinline_for_stack 15563fd0a558SYan, Zheng int replace_file_extents(struct btrfs_trans_handle *trans, 15575d4f98a2SYan Zheng struct reloc_control *rc, 15585d4f98a2SYan Zheng struct btrfs_root *root, 15593fd0a558SYan, Zheng struct extent_buffer *leaf) 15605d4f98a2SYan Zheng { 15615d4f98a2SYan Zheng struct btrfs_key key; 15625d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 15635d4f98a2SYan Zheng struct inode *inode = NULL; 15645d4f98a2SYan Zheng u64 parent; 15655d4f98a2SYan Zheng u64 bytenr; 15663fd0a558SYan, Zheng u64 new_bytenr = 0; 15675d4f98a2SYan Zheng u64 num_bytes; 15685d4f98a2SYan Zheng u64 end; 15695d4f98a2SYan Zheng u32 nritems; 15705d4f98a2SYan Zheng u32 i; 15715d4f98a2SYan Zheng int ret; 15725d4f98a2SYan Zheng int first = 1; 15735d4f98a2SYan Zheng int dirty = 0; 15745d4f98a2SYan Zheng 15755d4f98a2SYan Zheng if (rc->stage != UPDATE_DATA_PTRS) 15765d4f98a2SYan Zheng return 0; 15775d4f98a2SYan Zheng 15785d4f98a2SYan Zheng /* reloc trees always use full backref */ 15795d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) 15805d4f98a2SYan Zheng parent = leaf->start; 15815d4f98a2SYan Zheng else 15825d4f98a2SYan Zheng parent = 0; 15835d4f98a2SYan Zheng 15845d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 15855d4f98a2SYan Zheng for (i = 0; i < nritems; i++) { 15865d4f98a2SYan Zheng cond_resched(); 15875d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, i); 15885d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_DATA_KEY) 15895d4f98a2SYan Zheng continue; 15905d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); 15915d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 15925d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 15935d4f98a2SYan Zheng continue; 15945d4f98a2SYan Zheng bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); 15955d4f98a2SYan Zheng num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi); 15965d4f98a2SYan Zheng if (bytenr == 0) 15975d4f98a2SYan Zheng continue; 15985d4f98a2SYan Zheng if (!in_block_group(bytenr, rc->block_group)) 15995d4f98a2SYan Zheng continue; 16005d4f98a2SYan Zheng 16015d4f98a2SYan Zheng /* 16025d4f98a2SYan Zheng * if we are modifying block in fs tree, wait for readpage 16035d4f98a2SYan Zheng * to complete and drop the extent cache 16045d4f98a2SYan Zheng */ 16055d4f98a2SYan Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) { 16065d4f98a2SYan Zheng if (first) { 16075d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16085d4f98a2SYan Zheng first = 0; 160933345d01SLi Zefan } else if (inode && btrfs_ino(inode) < key.objectid) { 16103fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 16115d4f98a2SYan Zheng inode = find_next_inode(root, key.objectid); 16125d4f98a2SYan Zheng } 161333345d01SLi Zefan if (inode && btrfs_ino(inode) == key.objectid) { 16145d4f98a2SYan Zheng end = key.offset + 16155d4f98a2SYan Zheng btrfs_file_extent_num_bytes(leaf, fi); 16165d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(key.offset, 16175d4f98a2SYan Zheng root->sectorsize)); 16185d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(end, root->sectorsize)); 16195d4f98a2SYan Zheng end--; 16205d4f98a2SYan Zheng ret = try_lock_extent(&BTRFS_I(inode)->io_tree, 1621d0082371SJeff Mahoney key.offset, end); 16225d4f98a2SYan Zheng if (!ret) 16235d4f98a2SYan Zheng continue; 16245d4f98a2SYan Zheng 16255d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, key.offset, end, 16265d4f98a2SYan Zheng 1); 16275d4f98a2SYan Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 1628d0082371SJeff Mahoney key.offset, end); 16295d4f98a2SYan Zheng } 16305d4f98a2SYan Zheng } 16315d4f98a2SYan Zheng 16325d4f98a2SYan Zheng ret = get_new_location(rc->data_inode, &new_bytenr, 16335d4f98a2SYan Zheng bytenr, num_bytes); 16343fd0a558SYan, Zheng if (ret > 0) { 16353fd0a558SYan, Zheng WARN_ON(1); 16365d4f98a2SYan Zheng continue; 16373fd0a558SYan, Zheng } 16385d4f98a2SYan Zheng BUG_ON(ret < 0); 16395d4f98a2SYan Zheng 16405d4f98a2SYan Zheng btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr); 16415d4f98a2SYan Zheng dirty = 1; 16425d4f98a2SYan Zheng 16435d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 16445d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, root, new_bytenr, 16455d4f98a2SYan Zheng num_bytes, parent, 16465d4f98a2SYan Zheng btrfs_header_owner(leaf), 164766d7e7f0SArne Jansen key.objectid, key.offset, 1); 16485d4f98a2SYan Zheng BUG_ON(ret); 16495d4f98a2SYan Zheng 16505d4f98a2SYan Zheng ret = btrfs_free_extent(trans, root, bytenr, num_bytes, 16515d4f98a2SYan Zheng parent, btrfs_header_owner(leaf), 165266d7e7f0SArne Jansen key.objectid, key.offset, 1); 16535d4f98a2SYan Zheng BUG_ON(ret); 16545d4f98a2SYan Zheng } 16555d4f98a2SYan Zheng if (dirty) 16565d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 16573fd0a558SYan, Zheng if (inode) 16583fd0a558SYan, Zheng btrfs_add_delayed_iput(inode); 16595d4f98a2SYan Zheng return 0; 16605d4f98a2SYan Zheng } 16615d4f98a2SYan Zheng 16625d4f98a2SYan Zheng static noinline_for_stack 16635d4f98a2SYan Zheng int memcmp_node_keys(struct extent_buffer *eb, int slot, 16645d4f98a2SYan Zheng struct btrfs_path *path, int level) 16655d4f98a2SYan Zheng { 16665d4f98a2SYan Zheng struct btrfs_disk_key key1; 16675d4f98a2SYan Zheng struct btrfs_disk_key key2; 16685d4f98a2SYan Zheng btrfs_node_key(eb, &key1, slot); 16695d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &key2, path->slots[level]); 16705d4f98a2SYan Zheng return memcmp(&key1, &key2, sizeof(key1)); 16715d4f98a2SYan Zheng } 16725d4f98a2SYan Zheng 16735d4f98a2SYan Zheng /* 16745d4f98a2SYan Zheng * try to replace tree blocks in fs tree with the new blocks 16755d4f98a2SYan Zheng * in reloc tree. tree blocks haven't been modified since the 16765d4f98a2SYan Zheng * reloc tree was create can be replaced. 16775d4f98a2SYan Zheng * 16785d4f98a2SYan Zheng * if a block was replaced, level of the block + 1 is returned. 16795d4f98a2SYan Zheng * if no block got replaced, 0 is returned. if there are other 16805d4f98a2SYan Zheng * errors, a negative error number is returned. 16815d4f98a2SYan Zheng */ 16823fd0a558SYan, Zheng static noinline_for_stack 16833fd0a558SYan, Zheng int replace_path(struct btrfs_trans_handle *trans, 16845d4f98a2SYan Zheng struct btrfs_root *dest, struct btrfs_root *src, 16855d4f98a2SYan Zheng struct btrfs_path *path, struct btrfs_key *next_key, 16865d4f98a2SYan Zheng int lowest_level, int max_level) 16875d4f98a2SYan Zheng { 16885d4f98a2SYan Zheng struct extent_buffer *eb; 16895d4f98a2SYan Zheng struct extent_buffer *parent; 16905d4f98a2SYan Zheng struct btrfs_key key; 16915d4f98a2SYan Zheng u64 old_bytenr; 16925d4f98a2SYan Zheng u64 new_bytenr; 16935d4f98a2SYan Zheng u64 old_ptr_gen; 16945d4f98a2SYan Zheng u64 new_ptr_gen; 16955d4f98a2SYan Zheng u64 last_snapshot; 16965d4f98a2SYan Zheng u32 blocksize; 16973fd0a558SYan, Zheng int cow = 0; 16985d4f98a2SYan Zheng int level; 16995d4f98a2SYan Zheng int ret; 17005d4f98a2SYan Zheng int slot; 17015d4f98a2SYan Zheng 17025d4f98a2SYan Zheng BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID); 17035d4f98a2SYan Zheng BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID); 17045d4f98a2SYan Zheng 17055d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&src->root_item); 17063fd0a558SYan, Zheng again: 17075d4f98a2SYan Zheng slot = path->slots[lowest_level]; 17085d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 17095d4f98a2SYan Zheng 17105d4f98a2SYan Zheng eb = btrfs_lock_root_node(dest); 17115d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 17125d4f98a2SYan Zheng level = btrfs_header_level(eb); 17135d4f98a2SYan Zheng 17145d4f98a2SYan Zheng if (level < lowest_level) { 17155d4f98a2SYan Zheng btrfs_tree_unlock(eb); 17165d4f98a2SYan Zheng free_extent_buffer(eb); 17175d4f98a2SYan Zheng return 0; 17185d4f98a2SYan Zheng } 17195d4f98a2SYan Zheng 17203fd0a558SYan, Zheng if (cow) { 17215d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb); 17225d4f98a2SYan Zheng BUG_ON(ret); 17233fd0a558SYan, Zheng } 17245d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 17255d4f98a2SYan Zheng 17265d4f98a2SYan Zheng if (next_key) { 17275d4f98a2SYan Zheng next_key->objectid = (u64)-1; 17285d4f98a2SYan Zheng next_key->type = (u8)-1; 17295d4f98a2SYan Zheng next_key->offset = (u64)-1; 17305d4f98a2SYan Zheng } 17315d4f98a2SYan Zheng 17325d4f98a2SYan Zheng parent = eb; 17335d4f98a2SYan Zheng while (1) { 17345d4f98a2SYan Zheng level = btrfs_header_level(parent); 17355d4f98a2SYan Zheng BUG_ON(level < lowest_level); 17365d4f98a2SYan Zheng 17375d4f98a2SYan Zheng ret = btrfs_bin_search(parent, &key, level, &slot); 17385d4f98a2SYan Zheng if (ret && slot > 0) 17395d4f98a2SYan Zheng slot--; 17405d4f98a2SYan Zheng 17415d4f98a2SYan Zheng if (next_key && slot + 1 < btrfs_header_nritems(parent)) 17425d4f98a2SYan Zheng btrfs_node_key_to_cpu(parent, next_key, slot + 1); 17435d4f98a2SYan Zheng 17445d4f98a2SYan Zheng old_bytenr = btrfs_node_blockptr(parent, slot); 17455d4f98a2SYan Zheng blocksize = btrfs_level_size(dest, level - 1); 17465d4f98a2SYan Zheng old_ptr_gen = btrfs_node_ptr_generation(parent, slot); 17475d4f98a2SYan Zheng 17485d4f98a2SYan Zheng if (level <= max_level) { 17495d4f98a2SYan Zheng eb = path->nodes[level]; 17505d4f98a2SYan Zheng new_bytenr = btrfs_node_blockptr(eb, 17515d4f98a2SYan Zheng path->slots[level]); 17525d4f98a2SYan Zheng new_ptr_gen = btrfs_node_ptr_generation(eb, 17535d4f98a2SYan Zheng path->slots[level]); 17545d4f98a2SYan Zheng } else { 17555d4f98a2SYan Zheng new_bytenr = 0; 17565d4f98a2SYan Zheng new_ptr_gen = 0; 17575d4f98a2SYan Zheng } 17585d4f98a2SYan Zheng 17595d4f98a2SYan Zheng if (new_bytenr > 0 && new_bytenr == old_bytenr) { 17605d4f98a2SYan Zheng WARN_ON(1); 17615d4f98a2SYan Zheng ret = level; 17625d4f98a2SYan Zheng break; 17635d4f98a2SYan Zheng } 17645d4f98a2SYan Zheng 17655d4f98a2SYan Zheng if (new_bytenr == 0 || old_ptr_gen > last_snapshot || 17665d4f98a2SYan Zheng memcmp_node_keys(parent, slot, path, level)) { 17673fd0a558SYan, Zheng if (level <= lowest_level) { 17685d4f98a2SYan Zheng ret = 0; 17695d4f98a2SYan Zheng break; 17705d4f98a2SYan Zheng } 17715d4f98a2SYan Zheng 17725d4f98a2SYan Zheng eb = read_tree_block(dest, old_bytenr, blocksize, 17735d4f98a2SYan Zheng old_ptr_gen); 1774416bc658SJosef Bacik if (!eb || !extent_buffer_uptodate(eb)) { 1775416bc658SJosef Bacik ret = (!eb) ? -ENOMEM : -EIO; 1776416bc658SJosef Bacik free_extent_buffer(eb); 1777416bc658SJosef Bacik return ret; 1778416bc658SJosef Bacik } 17795d4f98a2SYan Zheng btrfs_tree_lock(eb); 17803fd0a558SYan, Zheng if (cow) { 17815d4f98a2SYan Zheng ret = btrfs_cow_block(trans, dest, eb, parent, 17825d4f98a2SYan Zheng slot, &eb); 17835d4f98a2SYan Zheng BUG_ON(ret); 17845d4f98a2SYan Zheng } 17853fd0a558SYan, Zheng btrfs_set_lock_blocking(eb); 17865d4f98a2SYan Zheng 17875d4f98a2SYan Zheng btrfs_tree_unlock(parent); 17885d4f98a2SYan Zheng free_extent_buffer(parent); 17895d4f98a2SYan Zheng 17905d4f98a2SYan Zheng parent = eb; 17915d4f98a2SYan Zheng continue; 17925d4f98a2SYan Zheng } 17935d4f98a2SYan Zheng 17943fd0a558SYan, Zheng if (!cow) { 17953fd0a558SYan, Zheng btrfs_tree_unlock(parent); 17963fd0a558SYan, Zheng free_extent_buffer(parent); 17973fd0a558SYan, Zheng cow = 1; 17983fd0a558SYan, Zheng goto again; 17993fd0a558SYan, Zheng } 18003fd0a558SYan, Zheng 18015d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 18025d4f98a2SYan Zheng path->slots[level]); 1803b3b4aa74SDavid Sterba btrfs_release_path(path); 18045d4f98a2SYan Zheng 18055d4f98a2SYan Zheng path->lowest_level = level; 18065d4f98a2SYan Zheng ret = btrfs_search_slot(trans, src, &key, path, 0, 1); 18075d4f98a2SYan Zheng path->lowest_level = 0; 18085d4f98a2SYan Zheng BUG_ON(ret); 18095d4f98a2SYan Zheng 18105d4f98a2SYan Zheng /* 18115d4f98a2SYan Zheng * swap blocks in fs tree and reloc tree. 18125d4f98a2SYan Zheng */ 18135d4f98a2SYan Zheng btrfs_set_node_blockptr(parent, slot, new_bytenr); 18145d4f98a2SYan Zheng btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen); 18155d4f98a2SYan Zheng btrfs_mark_buffer_dirty(parent); 18165d4f98a2SYan Zheng 18175d4f98a2SYan Zheng btrfs_set_node_blockptr(path->nodes[level], 18185d4f98a2SYan Zheng path->slots[level], old_bytenr); 18195d4f98a2SYan Zheng btrfs_set_node_ptr_generation(path->nodes[level], 18205d4f98a2SYan Zheng path->slots[level], old_ptr_gen); 18215d4f98a2SYan Zheng btrfs_mark_buffer_dirty(path->nodes[level]); 18225d4f98a2SYan Zheng 18235d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, src, old_bytenr, blocksize, 18245d4f98a2SYan Zheng path->nodes[level]->start, 182566d7e7f0SArne Jansen src->root_key.objectid, level - 1, 0, 182666d7e7f0SArne Jansen 1); 18275d4f98a2SYan Zheng BUG_ON(ret); 18285d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, dest, new_bytenr, blocksize, 18295d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 183066d7e7f0SArne Jansen 0, 1); 18315d4f98a2SYan Zheng BUG_ON(ret); 18325d4f98a2SYan Zheng 18335d4f98a2SYan Zheng ret = btrfs_free_extent(trans, src, new_bytenr, blocksize, 18345d4f98a2SYan Zheng path->nodes[level]->start, 183566d7e7f0SArne Jansen src->root_key.objectid, level - 1, 0, 183666d7e7f0SArne Jansen 1); 18375d4f98a2SYan Zheng BUG_ON(ret); 18385d4f98a2SYan Zheng 18395d4f98a2SYan Zheng ret = btrfs_free_extent(trans, dest, old_bytenr, blocksize, 18405d4f98a2SYan Zheng 0, dest->root_key.objectid, level - 1, 184166d7e7f0SArne Jansen 0, 1); 18425d4f98a2SYan Zheng BUG_ON(ret); 18435d4f98a2SYan Zheng 18445d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 18455d4f98a2SYan Zheng 18465d4f98a2SYan Zheng ret = level; 18475d4f98a2SYan Zheng break; 18485d4f98a2SYan Zheng } 18495d4f98a2SYan Zheng btrfs_tree_unlock(parent); 18505d4f98a2SYan Zheng free_extent_buffer(parent); 18515d4f98a2SYan Zheng return ret; 18525d4f98a2SYan Zheng } 18535d4f98a2SYan Zheng 18545d4f98a2SYan Zheng /* 18555d4f98a2SYan Zheng * helper to find next relocated block in reloc tree 18565d4f98a2SYan Zheng */ 18575d4f98a2SYan Zheng static noinline_for_stack 18585d4f98a2SYan Zheng int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 18595d4f98a2SYan Zheng int *level) 18605d4f98a2SYan Zheng { 18615d4f98a2SYan Zheng struct extent_buffer *eb; 18625d4f98a2SYan Zheng int i; 18635d4f98a2SYan Zheng u64 last_snapshot; 18645d4f98a2SYan Zheng u32 nritems; 18655d4f98a2SYan Zheng 18665d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 18675d4f98a2SYan Zheng 18685d4f98a2SYan Zheng for (i = 0; i < *level; i++) { 18695d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 18705d4f98a2SYan Zheng path->nodes[i] = NULL; 18715d4f98a2SYan Zheng } 18725d4f98a2SYan Zheng 18735d4f98a2SYan Zheng for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { 18745d4f98a2SYan Zheng eb = path->nodes[i]; 18755d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 18765d4f98a2SYan Zheng while (path->slots[i] + 1 < nritems) { 18775d4f98a2SYan Zheng path->slots[i]++; 18785d4f98a2SYan Zheng if (btrfs_node_ptr_generation(eb, path->slots[i]) <= 18795d4f98a2SYan Zheng last_snapshot) 18805d4f98a2SYan Zheng continue; 18815d4f98a2SYan Zheng 18825d4f98a2SYan Zheng *level = i; 18835d4f98a2SYan Zheng return 0; 18845d4f98a2SYan Zheng } 18855d4f98a2SYan Zheng free_extent_buffer(path->nodes[i]); 18865d4f98a2SYan Zheng path->nodes[i] = NULL; 18875d4f98a2SYan Zheng } 18885d4f98a2SYan Zheng return 1; 18895d4f98a2SYan Zheng } 18905d4f98a2SYan Zheng 18915d4f98a2SYan Zheng /* 18925d4f98a2SYan Zheng * walk down reloc tree to find relocated block of lowest level 18935d4f98a2SYan Zheng */ 18945d4f98a2SYan Zheng static noinline_for_stack 18955d4f98a2SYan Zheng int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, 18965d4f98a2SYan Zheng int *level) 18975d4f98a2SYan Zheng { 18985d4f98a2SYan Zheng struct extent_buffer *eb = NULL; 18995d4f98a2SYan Zheng int i; 19005d4f98a2SYan Zheng u64 bytenr; 19015d4f98a2SYan Zheng u64 ptr_gen = 0; 19025d4f98a2SYan Zheng u64 last_snapshot; 19035d4f98a2SYan Zheng u32 blocksize; 19045d4f98a2SYan Zheng u32 nritems; 19055d4f98a2SYan Zheng 19065d4f98a2SYan Zheng last_snapshot = btrfs_root_last_snapshot(&root->root_item); 19075d4f98a2SYan Zheng 19085d4f98a2SYan Zheng for (i = *level; i > 0; i--) { 19095d4f98a2SYan Zheng eb = path->nodes[i]; 19105d4f98a2SYan Zheng nritems = btrfs_header_nritems(eb); 19115d4f98a2SYan Zheng while (path->slots[i] < nritems) { 19125d4f98a2SYan Zheng ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]); 19135d4f98a2SYan Zheng if (ptr_gen > last_snapshot) 19145d4f98a2SYan Zheng break; 19155d4f98a2SYan Zheng path->slots[i]++; 19165d4f98a2SYan Zheng } 19175d4f98a2SYan Zheng if (path->slots[i] >= nritems) { 19185d4f98a2SYan Zheng if (i == *level) 19195d4f98a2SYan Zheng break; 19205d4f98a2SYan Zheng *level = i + 1; 19215d4f98a2SYan Zheng return 0; 19225d4f98a2SYan Zheng } 19235d4f98a2SYan Zheng if (i == 1) { 19245d4f98a2SYan Zheng *level = i; 19255d4f98a2SYan Zheng return 0; 19265d4f98a2SYan Zheng } 19275d4f98a2SYan Zheng 19285d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(eb, path->slots[i]); 19295d4f98a2SYan Zheng blocksize = btrfs_level_size(root, i - 1); 19305d4f98a2SYan Zheng eb = read_tree_block(root, bytenr, blocksize, ptr_gen); 1931416bc658SJosef Bacik if (!eb || !extent_buffer_uptodate(eb)) { 1932416bc658SJosef Bacik free_extent_buffer(eb); 1933416bc658SJosef Bacik return -EIO; 1934416bc658SJosef Bacik } 19355d4f98a2SYan Zheng BUG_ON(btrfs_header_level(eb) != i - 1); 19365d4f98a2SYan Zheng path->nodes[i - 1] = eb; 19375d4f98a2SYan Zheng path->slots[i - 1] = 0; 19385d4f98a2SYan Zheng } 19395d4f98a2SYan Zheng return 1; 19405d4f98a2SYan Zheng } 19415d4f98a2SYan Zheng 19425d4f98a2SYan Zheng /* 19435d4f98a2SYan Zheng * invalidate extent cache for file extents whose key in range of 19445d4f98a2SYan Zheng * [min_key, max_key) 19455d4f98a2SYan Zheng */ 19465d4f98a2SYan Zheng static int invalidate_extent_cache(struct btrfs_root *root, 19475d4f98a2SYan Zheng struct btrfs_key *min_key, 19485d4f98a2SYan Zheng struct btrfs_key *max_key) 19495d4f98a2SYan Zheng { 19505d4f98a2SYan Zheng struct inode *inode = NULL; 19515d4f98a2SYan Zheng u64 objectid; 19525d4f98a2SYan Zheng u64 start, end; 195333345d01SLi Zefan u64 ino; 19545d4f98a2SYan Zheng 19555d4f98a2SYan Zheng objectid = min_key->objectid; 19565d4f98a2SYan Zheng while (1) { 19575d4f98a2SYan Zheng cond_resched(); 19585d4f98a2SYan Zheng iput(inode); 19595d4f98a2SYan Zheng 19605d4f98a2SYan Zheng if (objectid > max_key->objectid) 19615d4f98a2SYan Zheng break; 19625d4f98a2SYan Zheng 19635d4f98a2SYan Zheng inode = find_next_inode(root, objectid); 19645d4f98a2SYan Zheng if (!inode) 19655d4f98a2SYan Zheng break; 196633345d01SLi Zefan ino = btrfs_ino(inode); 19675d4f98a2SYan Zheng 196833345d01SLi Zefan if (ino > max_key->objectid) { 19695d4f98a2SYan Zheng iput(inode); 19705d4f98a2SYan Zheng break; 19715d4f98a2SYan Zheng } 19725d4f98a2SYan Zheng 197333345d01SLi Zefan objectid = ino + 1; 19745d4f98a2SYan Zheng if (!S_ISREG(inode->i_mode)) 19755d4f98a2SYan Zheng continue; 19765d4f98a2SYan Zheng 197733345d01SLi Zefan if (unlikely(min_key->objectid == ino)) { 19785d4f98a2SYan Zheng if (min_key->type > BTRFS_EXTENT_DATA_KEY) 19795d4f98a2SYan Zheng continue; 19805d4f98a2SYan Zheng if (min_key->type < BTRFS_EXTENT_DATA_KEY) 19815d4f98a2SYan Zheng start = 0; 19825d4f98a2SYan Zheng else { 19835d4f98a2SYan Zheng start = min_key->offset; 19845d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(start, root->sectorsize)); 19855d4f98a2SYan Zheng } 19865d4f98a2SYan Zheng } else { 19875d4f98a2SYan Zheng start = 0; 19885d4f98a2SYan Zheng } 19895d4f98a2SYan Zheng 199033345d01SLi Zefan if (unlikely(max_key->objectid == ino)) { 19915d4f98a2SYan Zheng if (max_key->type < BTRFS_EXTENT_DATA_KEY) 19925d4f98a2SYan Zheng continue; 19935d4f98a2SYan Zheng if (max_key->type > BTRFS_EXTENT_DATA_KEY) { 19945d4f98a2SYan Zheng end = (u64)-1; 19955d4f98a2SYan Zheng } else { 19965d4f98a2SYan Zheng if (max_key->offset == 0) 19975d4f98a2SYan Zheng continue; 19985d4f98a2SYan Zheng end = max_key->offset; 19995d4f98a2SYan Zheng WARN_ON(!IS_ALIGNED(end, root->sectorsize)); 20005d4f98a2SYan Zheng end--; 20015d4f98a2SYan Zheng } 20025d4f98a2SYan Zheng } else { 20035d4f98a2SYan Zheng end = (u64)-1; 20045d4f98a2SYan Zheng } 20055d4f98a2SYan Zheng 20065d4f98a2SYan Zheng /* the lock_extent waits for readpage to complete */ 2007d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 20085d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, start, end, 1); 2009d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 20105d4f98a2SYan Zheng } 20115d4f98a2SYan Zheng return 0; 20125d4f98a2SYan Zheng } 20135d4f98a2SYan Zheng 20145d4f98a2SYan Zheng static int find_next_key(struct btrfs_path *path, int level, 20155d4f98a2SYan Zheng struct btrfs_key *key) 20165d4f98a2SYan Zheng 20175d4f98a2SYan Zheng { 20185d4f98a2SYan Zheng while (level < BTRFS_MAX_LEVEL) { 20195d4f98a2SYan Zheng if (!path->nodes[level]) 20205d4f98a2SYan Zheng break; 20215d4f98a2SYan Zheng if (path->slots[level] + 1 < 20225d4f98a2SYan Zheng btrfs_header_nritems(path->nodes[level])) { 20235d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], key, 20245d4f98a2SYan Zheng path->slots[level] + 1); 20255d4f98a2SYan Zheng return 0; 20265d4f98a2SYan Zheng } 20275d4f98a2SYan Zheng level++; 20285d4f98a2SYan Zheng } 20295d4f98a2SYan Zheng return 1; 20305d4f98a2SYan Zheng } 20315d4f98a2SYan Zheng 20325d4f98a2SYan Zheng /* 20335d4f98a2SYan Zheng * merge the relocated tree blocks in reloc tree with corresponding 20345d4f98a2SYan Zheng * fs tree. 20355d4f98a2SYan Zheng */ 20365d4f98a2SYan Zheng static noinline_for_stack int merge_reloc_root(struct reloc_control *rc, 20375d4f98a2SYan Zheng struct btrfs_root *root) 20385d4f98a2SYan Zheng { 20395d4f98a2SYan Zheng LIST_HEAD(inode_list); 20405d4f98a2SYan Zheng struct btrfs_key key; 20415d4f98a2SYan Zheng struct btrfs_key next_key; 20425d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 20435d4f98a2SYan Zheng struct btrfs_root *reloc_root; 20445d4f98a2SYan Zheng struct btrfs_root_item *root_item; 20455d4f98a2SYan Zheng struct btrfs_path *path; 20463fd0a558SYan, Zheng struct extent_buffer *leaf; 20475d4f98a2SYan Zheng int level; 20485d4f98a2SYan Zheng int max_level; 20495d4f98a2SYan Zheng int replaced = 0; 20505d4f98a2SYan Zheng int ret; 20515d4f98a2SYan Zheng int err = 0; 20523fd0a558SYan, Zheng u32 min_reserved; 20535d4f98a2SYan Zheng 20545d4f98a2SYan Zheng path = btrfs_alloc_path(); 20555d4f98a2SYan Zheng if (!path) 20565d4f98a2SYan Zheng return -ENOMEM; 2057026fd317SJosef Bacik path->reada = 1; 20585d4f98a2SYan Zheng 20595d4f98a2SYan Zheng reloc_root = root->reloc_root; 20605d4f98a2SYan Zheng root_item = &reloc_root->root_item; 20615d4f98a2SYan Zheng 20625d4f98a2SYan Zheng if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { 20635d4f98a2SYan Zheng level = btrfs_root_level(root_item); 20645d4f98a2SYan Zheng extent_buffer_get(reloc_root->node); 20655d4f98a2SYan Zheng path->nodes[level] = reloc_root->node; 20665d4f98a2SYan Zheng path->slots[level] = 0; 20675d4f98a2SYan Zheng } else { 20685d4f98a2SYan Zheng btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); 20695d4f98a2SYan Zheng 20705d4f98a2SYan Zheng level = root_item->drop_level; 20715d4f98a2SYan Zheng BUG_ON(level == 0); 20725d4f98a2SYan Zheng path->lowest_level = level; 20735d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0); 207433c66f43SYan Zheng path->lowest_level = 0; 20755d4f98a2SYan Zheng if (ret < 0) { 20765d4f98a2SYan Zheng btrfs_free_path(path); 20775d4f98a2SYan Zheng return ret; 20785d4f98a2SYan Zheng } 20795d4f98a2SYan Zheng 20805d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &next_key, 20815d4f98a2SYan Zheng path->slots[level]); 20825d4f98a2SYan Zheng WARN_ON(memcmp(&key, &next_key, sizeof(key))); 20835d4f98a2SYan Zheng 20845d4f98a2SYan Zheng btrfs_unlock_up_safe(path, 0); 20855d4f98a2SYan Zheng } 20865d4f98a2SYan Zheng 20873fd0a558SYan, Zheng min_reserved = root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 20885d4f98a2SYan Zheng memset(&next_key, 0, sizeof(next_key)); 20895d4f98a2SYan Zheng 20905d4f98a2SYan Zheng while (1) { 2091a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 0); 209298d5dc13STsutomu Itoh BUG_ON(IS_ERR(trans)); 20933fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 20943fd0a558SYan, Zheng 209508e007d2SMiao Xie ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved, 209608e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 20973fd0a558SYan, Zheng if (ret) { 20983fd0a558SYan, Zheng BUG_ON(ret != -EAGAIN); 20993fd0a558SYan, Zheng ret = btrfs_commit_transaction(trans, root); 21003fd0a558SYan, Zheng BUG_ON(ret); 21013fd0a558SYan, Zheng continue; 21023fd0a558SYan, Zheng } 21033fd0a558SYan, Zheng 21043fd0a558SYan, Zheng replaced = 0; 21055d4f98a2SYan Zheng max_level = level; 21065d4f98a2SYan Zheng 21075d4f98a2SYan Zheng ret = walk_down_reloc_tree(reloc_root, path, &level); 21085d4f98a2SYan Zheng if (ret < 0) { 21095d4f98a2SYan Zheng err = ret; 21105d4f98a2SYan Zheng goto out; 21115d4f98a2SYan Zheng } 21125d4f98a2SYan Zheng if (ret > 0) 21135d4f98a2SYan Zheng break; 21145d4f98a2SYan Zheng 21155d4f98a2SYan Zheng if (!find_next_key(path, level, &key) && 21165d4f98a2SYan Zheng btrfs_comp_cpu_keys(&next_key, &key) >= 0) { 21175d4f98a2SYan Zheng ret = 0; 21185d4f98a2SYan Zheng } else { 21193fd0a558SYan, Zheng ret = replace_path(trans, root, reloc_root, path, 21203fd0a558SYan, Zheng &next_key, level, max_level); 21215d4f98a2SYan Zheng } 21225d4f98a2SYan Zheng if (ret < 0) { 21235d4f98a2SYan Zheng err = ret; 21245d4f98a2SYan Zheng goto out; 21255d4f98a2SYan Zheng } 21265d4f98a2SYan Zheng 21275d4f98a2SYan Zheng if (ret > 0) { 21285d4f98a2SYan Zheng level = ret; 21295d4f98a2SYan Zheng btrfs_node_key_to_cpu(path->nodes[level], &key, 21305d4f98a2SYan Zheng path->slots[level]); 21315d4f98a2SYan Zheng replaced = 1; 21325d4f98a2SYan Zheng } 21335d4f98a2SYan Zheng 21345d4f98a2SYan Zheng ret = walk_up_reloc_tree(reloc_root, path, &level); 21355d4f98a2SYan Zheng if (ret > 0) 21365d4f98a2SYan Zheng break; 21375d4f98a2SYan Zheng 21385d4f98a2SYan Zheng BUG_ON(level == 0); 21395d4f98a2SYan Zheng /* 21405d4f98a2SYan Zheng * save the merging progress in the drop_progress. 21415d4f98a2SYan Zheng * this is OK since root refs == 1 in this case. 21425d4f98a2SYan Zheng */ 21435d4f98a2SYan Zheng btrfs_node_key(path->nodes[level], &root_item->drop_progress, 21445d4f98a2SYan Zheng path->slots[level]); 21455d4f98a2SYan Zheng root_item->drop_level = level; 21465d4f98a2SYan Zheng 21473fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, root); 21485d4f98a2SYan Zheng 2149b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 21505d4f98a2SYan Zheng 21515d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 21525d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 21535d4f98a2SYan Zheng } 21545d4f98a2SYan Zheng 21555d4f98a2SYan Zheng /* 21565d4f98a2SYan Zheng * handle the case only one block in the fs tree need to be 21575d4f98a2SYan Zheng * relocated and the block is tree root. 21585d4f98a2SYan Zheng */ 21595d4f98a2SYan Zheng leaf = btrfs_lock_root_node(root); 21605d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf); 21615d4f98a2SYan Zheng btrfs_tree_unlock(leaf); 21625d4f98a2SYan Zheng free_extent_buffer(leaf); 21635d4f98a2SYan Zheng if (ret < 0) 21645d4f98a2SYan Zheng err = ret; 21655d4f98a2SYan Zheng out: 21665d4f98a2SYan Zheng btrfs_free_path(path); 21675d4f98a2SYan Zheng 21685d4f98a2SYan Zheng if (err == 0) { 21695d4f98a2SYan Zheng memset(&root_item->drop_progress, 0, 21705d4f98a2SYan Zheng sizeof(root_item->drop_progress)); 21715d4f98a2SYan Zheng root_item->drop_level = 0; 21725d4f98a2SYan Zheng btrfs_set_root_refs(root_item, 0); 21733fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 21745d4f98a2SYan Zheng } 21755d4f98a2SYan Zheng 21763fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, root); 21775d4f98a2SYan Zheng 2178b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 21795d4f98a2SYan Zheng 21805d4f98a2SYan Zheng if (replaced && rc->stage == UPDATE_DATA_PTRS) 21815d4f98a2SYan Zheng invalidate_extent_cache(root, &key, &next_key); 21825d4f98a2SYan Zheng 21835d4f98a2SYan Zheng return err; 21845d4f98a2SYan Zheng } 21855d4f98a2SYan Zheng 21863fd0a558SYan, Zheng static noinline_for_stack 21873fd0a558SYan, Zheng int prepare_to_merge(struct reloc_control *rc, int err) 21885d4f98a2SYan Zheng { 21893fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 21903fd0a558SYan, Zheng struct btrfs_root *reloc_root; 21915d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 21923fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 21933fd0a558SYan, Zheng u64 num_bytes = 0; 21943fd0a558SYan, Zheng int ret; 21953fd0a558SYan, Zheng 21967585717fSChris Mason mutex_lock(&root->fs_info->reloc_mutex); 21973fd0a558SYan, Zheng rc->merging_rsv_size += root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; 21983fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated * 2; 21997585717fSChris Mason mutex_unlock(&root->fs_info->reloc_mutex); 22007585717fSChris Mason 22013fd0a558SYan, Zheng again: 22023fd0a558SYan, Zheng if (!err) { 22033fd0a558SYan, Zheng num_bytes = rc->merging_rsv_size; 220408e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 220508e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 22063fd0a558SYan, Zheng if (ret) 22073fd0a558SYan, Zheng err = ret; 22083fd0a558SYan, Zheng } 22093fd0a558SYan, Zheng 22107a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 22113612b495STsutomu Itoh if (IS_ERR(trans)) { 22123612b495STsutomu Itoh if (!err) 22133612b495STsutomu Itoh btrfs_block_rsv_release(rc->extent_root, 22143612b495STsutomu Itoh rc->block_rsv, num_bytes); 22153612b495STsutomu Itoh return PTR_ERR(trans); 22163612b495STsutomu Itoh } 22173fd0a558SYan, Zheng 22183fd0a558SYan, Zheng if (!err) { 22193fd0a558SYan, Zheng if (num_bytes != rc->merging_rsv_size) { 22203fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 22213fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, 22223fd0a558SYan, Zheng rc->block_rsv, num_bytes); 22233fd0a558SYan, Zheng goto again; 22243fd0a558SYan, Zheng } 22253fd0a558SYan, Zheng } 22263fd0a558SYan, Zheng 22273fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 22283fd0a558SYan, Zheng 22293fd0a558SYan, Zheng while (!list_empty(&rc->reloc_roots)) { 22303fd0a558SYan, Zheng reloc_root = list_entry(rc->reloc_roots.next, 22313fd0a558SYan, Zheng struct btrfs_root, root_list); 22323fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 22333fd0a558SYan, Zheng 22343fd0a558SYan, Zheng root = read_fs_root(reloc_root->fs_info, 22353fd0a558SYan, Zheng reloc_root->root_key.offset); 22363fd0a558SYan, Zheng BUG_ON(IS_ERR(root)); 22373fd0a558SYan, Zheng BUG_ON(root->reloc_root != reloc_root); 22383fd0a558SYan, Zheng 22393fd0a558SYan, Zheng /* 22403fd0a558SYan, Zheng * set reference count to 1, so btrfs_recover_relocation 22413fd0a558SYan, Zheng * knows it should resumes merging 22423fd0a558SYan, Zheng */ 22433fd0a558SYan, Zheng if (!err) 22443fd0a558SYan, Zheng btrfs_set_root_refs(&reloc_root->root_item, 1); 22453fd0a558SYan, Zheng btrfs_update_reloc_root(trans, root); 22463fd0a558SYan, Zheng 22473fd0a558SYan, Zheng list_add(&reloc_root->root_list, &reloc_roots); 22483fd0a558SYan, Zheng } 22493fd0a558SYan, Zheng 22503fd0a558SYan, Zheng list_splice(&reloc_roots, &rc->reloc_roots); 22513fd0a558SYan, Zheng 22523fd0a558SYan, Zheng if (!err) 22533fd0a558SYan, Zheng btrfs_commit_transaction(trans, rc->extent_root); 22543fd0a558SYan, Zheng else 22553fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 22563fd0a558SYan, Zheng return err; 22573fd0a558SYan, Zheng } 22583fd0a558SYan, Zheng 22593fd0a558SYan, Zheng static noinline_for_stack 2260aca1bba6SLiu Bo void free_reloc_roots(struct list_head *list) 2261aca1bba6SLiu Bo { 2262aca1bba6SLiu Bo struct btrfs_root *reloc_root; 2263aca1bba6SLiu Bo 2264aca1bba6SLiu Bo while (!list_empty(list)) { 2265aca1bba6SLiu Bo reloc_root = list_entry(list->next, struct btrfs_root, 2266aca1bba6SLiu Bo root_list); 2267aca1bba6SLiu Bo __update_reloc_root(reloc_root, 1); 2268aca1bba6SLiu Bo free_extent_buffer(reloc_root->node); 2269aca1bba6SLiu Bo free_extent_buffer(reloc_root->commit_root); 2270aca1bba6SLiu Bo kfree(reloc_root); 2271aca1bba6SLiu Bo } 2272aca1bba6SLiu Bo } 2273aca1bba6SLiu Bo 2274aca1bba6SLiu Bo static noinline_for_stack 22753fd0a558SYan, Zheng int merge_reloc_roots(struct reloc_control *rc) 22763fd0a558SYan, Zheng { 22775d4f98a2SYan Zheng struct btrfs_root *root; 22785d4f98a2SYan Zheng struct btrfs_root *reloc_root; 22793fd0a558SYan, Zheng LIST_HEAD(reloc_roots); 22803fd0a558SYan, Zheng int found = 0; 2281aca1bba6SLiu Bo int ret = 0; 22823fd0a558SYan, Zheng again: 22833fd0a558SYan, Zheng root = rc->extent_root; 22847585717fSChris Mason 22857585717fSChris Mason /* 22867585717fSChris Mason * this serializes us with btrfs_record_root_in_transaction, 22877585717fSChris Mason * we have to make sure nobody is in the middle of 22887585717fSChris Mason * adding their roots to the list while we are 22897585717fSChris Mason * doing this splice 22907585717fSChris Mason */ 22917585717fSChris Mason mutex_lock(&root->fs_info->reloc_mutex); 22923fd0a558SYan, Zheng list_splice_init(&rc->reloc_roots, &reloc_roots); 22937585717fSChris Mason mutex_unlock(&root->fs_info->reloc_mutex); 22945d4f98a2SYan Zheng 22953fd0a558SYan, Zheng while (!list_empty(&reloc_roots)) { 22963fd0a558SYan, Zheng found = 1; 22973fd0a558SYan, Zheng reloc_root = list_entry(reloc_roots.next, 22983fd0a558SYan, Zheng struct btrfs_root, root_list); 22995d4f98a2SYan Zheng 23005d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 23015d4f98a2SYan Zheng root = read_fs_root(reloc_root->fs_info, 23025d4f98a2SYan Zheng reloc_root->root_key.offset); 23035d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 23045d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 23055d4f98a2SYan Zheng 23063fd0a558SYan, Zheng ret = merge_reloc_root(rc, root); 2307aca1bba6SLiu Bo if (ret) 2308aca1bba6SLiu Bo goto out; 23093fd0a558SYan, Zheng } else { 23103fd0a558SYan, Zheng list_del_init(&reloc_root->root_list); 23113fd0a558SYan, Zheng } 23122c536799SJeff Mahoney ret = btrfs_drop_snapshot(reloc_root, rc->block_rsv, 0, 1); 2313aca1bba6SLiu Bo if (ret < 0) { 2314aca1bba6SLiu Bo if (list_empty(&reloc_root->root_list)) 2315aca1bba6SLiu Bo list_add_tail(&reloc_root->root_list, 2316aca1bba6SLiu Bo &reloc_roots); 2317aca1bba6SLiu Bo goto out; 2318aca1bba6SLiu Bo } 23195d4f98a2SYan Zheng } 23205d4f98a2SYan Zheng 23213fd0a558SYan, Zheng if (found) { 23223fd0a558SYan, Zheng found = 0; 23233fd0a558SYan, Zheng goto again; 23245d4f98a2SYan Zheng } 2325aca1bba6SLiu Bo out: 2326aca1bba6SLiu Bo if (ret) { 2327aca1bba6SLiu Bo btrfs_std_error(root->fs_info, ret); 2328aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 2329aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 2330aca1bba6SLiu Bo } 2331aca1bba6SLiu Bo 23325d4f98a2SYan Zheng BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root)); 2333aca1bba6SLiu Bo return ret; 23345d4f98a2SYan Zheng } 23355d4f98a2SYan Zheng 23365d4f98a2SYan Zheng static void free_block_list(struct rb_root *blocks) 23375d4f98a2SYan Zheng { 23385d4f98a2SYan Zheng struct tree_block *block; 23395d4f98a2SYan Zheng struct rb_node *rb_node; 23405d4f98a2SYan Zheng while ((rb_node = rb_first(blocks))) { 23415d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 23425d4f98a2SYan Zheng rb_erase(rb_node, blocks); 23435d4f98a2SYan Zheng kfree(block); 23445d4f98a2SYan Zheng } 23455d4f98a2SYan Zheng } 23465d4f98a2SYan Zheng 23475d4f98a2SYan Zheng static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans, 23485d4f98a2SYan Zheng struct btrfs_root *reloc_root) 23495d4f98a2SYan Zheng { 23505d4f98a2SYan Zheng struct btrfs_root *root; 23515d4f98a2SYan Zheng 23525d4f98a2SYan Zheng if (reloc_root->last_trans == trans->transid) 23535d4f98a2SYan Zheng return 0; 23545d4f98a2SYan Zheng 23555d4f98a2SYan Zheng root = read_fs_root(reloc_root->fs_info, reloc_root->root_key.offset); 23565d4f98a2SYan Zheng BUG_ON(IS_ERR(root)); 23575d4f98a2SYan Zheng BUG_ON(root->reloc_root != reloc_root); 23585d4f98a2SYan Zheng 23595d4f98a2SYan Zheng return btrfs_record_root_in_trans(trans, root); 23605d4f98a2SYan Zheng } 23615d4f98a2SYan Zheng 23623fd0a558SYan, Zheng static noinline_for_stack 23633fd0a558SYan, Zheng struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans, 23643fd0a558SYan, Zheng struct reloc_control *rc, 23655d4f98a2SYan Zheng struct backref_node *node, 23663fd0a558SYan, Zheng struct backref_edge *edges[], int *nr) 23675d4f98a2SYan Zheng { 23685d4f98a2SYan Zheng struct backref_node *next; 23695d4f98a2SYan Zheng struct btrfs_root *root; 23703fd0a558SYan, Zheng int index = 0; 23713fd0a558SYan, Zheng 23725d4f98a2SYan Zheng next = node; 23735d4f98a2SYan Zheng while (1) { 23745d4f98a2SYan Zheng cond_resched(); 23755d4f98a2SYan Zheng next = walk_up_backref(next, edges, &index); 23765d4f98a2SYan Zheng root = next->root; 23773fd0a558SYan, Zheng BUG_ON(!root); 23783fd0a558SYan, Zheng BUG_ON(!root->ref_cows); 23795d4f98a2SYan Zheng 23805d4f98a2SYan Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { 23815d4f98a2SYan Zheng record_reloc_root_in_trans(trans, root); 23825d4f98a2SYan Zheng break; 23835d4f98a2SYan Zheng } 23845d4f98a2SYan Zheng 23855d4f98a2SYan Zheng btrfs_record_root_in_trans(trans, root); 23863fd0a558SYan, Zheng root = root->reloc_root; 23873fd0a558SYan, Zheng 23883fd0a558SYan, Zheng if (next->new_bytenr != root->node->start) { 23893fd0a558SYan, Zheng BUG_ON(next->new_bytenr); 23903fd0a558SYan, Zheng BUG_ON(!list_empty(&next->list)); 23913fd0a558SYan, Zheng next->new_bytenr = root->node->start; 23923fd0a558SYan, Zheng next->root = root; 23933fd0a558SYan, Zheng list_add_tail(&next->list, 23943fd0a558SYan, Zheng &rc->backref_cache.changed); 23953fd0a558SYan, Zheng __mark_block_processed(rc, next); 23965d4f98a2SYan Zheng break; 23975d4f98a2SYan Zheng } 23985d4f98a2SYan Zheng 23993fd0a558SYan, Zheng WARN_ON(1); 24005d4f98a2SYan Zheng root = NULL; 24015d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 24025d4f98a2SYan Zheng if (!next || next->level <= node->level) 24035d4f98a2SYan Zheng break; 24045d4f98a2SYan Zheng } 24053fd0a558SYan, Zheng if (!root) 24063fd0a558SYan, Zheng return NULL; 24075d4f98a2SYan Zheng 24085d4f98a2SYan Zheng *nr = index; 24093fd0a558SYan, Zheng next = node; 24103fd0a558SYan, Zheng /* setup backref node path for btrfs_reloc_cow_block */ 24113fd0a558SYan, Zheng while (1) { 24123fd0a558SYan, Zheng rc->backref_cache.path[next->level] = next; 24133fd0a558SYan, Zheng if (--index < 0) 24143fd0a558SYan, Zheng break; 24153fd0a558SYan, Zheng next = edges[index]->node[UPPER]; 24163fd0a558SYan, Zheng } 24175d4f98a2SYan Zheng return root; 24185d4f98a2SYan Zheng } 24195d4f98a2SYan Zheng 24203fd0a558SYan, Zheng /* 24213fd0a558SYan, Zheng * select a tree root for relocation. return NULL if the block 24223fd0a558SYan, Zheng * is reference counted. we should use do_relocation() in this 24233fd0a558SYan, Zheng * case. return a tree root pointer if the block isn't reference 24243fd0a558SYan, Zheng * counted. return -ENOENT if the block is root of reloc tree. 24253fd0a558SYan, Zheng */ 24265d4f98a2SYan Zheng static noinline_for_stack 24275d4f98a2SYan Zheng struct btrfs_root *select_one_root(struct btrfs_trans_handle *trans, 24285d4f98a2SYan Zheng struct backref_node *node) 24295d4f98a2SYan Zheng { 24303fd0a558SYan, Zheng struct backref_node *next; 24313fd0a558SYan, Zheng struct btrfs_root *root; 24323fd0a558SYan, Zheng struct btrfs_root *fs_root = NULL; 24335d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 24343fd0a558SYan, Zheng int index = 0; 24353fd0a558SYan, Zheng 24363fd0a558SYan, Zheng next = node; 24373fd0a558SYan, Zheng while (1) { 24383fd0a558SYan, Zheng cond_resched(); 24393fd0a558SYan, Zheng next = walk_up_backref(next, edges, &index); 24403fd0a558SYan, Zheng root = next->root; 24413fd0a558SYan, Zheng BUG_ON(!root); 24423fd0a558SYan, Zheng 244325985edcSLucas De Marchi /* no other choice for non-references counted tree */ 24443fd0a558SYan, Zheng if (!root->ref_cows) 24453fd0a558SYan, Zheng return root; 24463fd0a558SYan, Zheng 24473fd0a558SYan, Zheng if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) 24483fd0a558SYan, Zheng fs_root = root; 24493fd0a558SYan, Zheng 24503fd0a558SYan, Zheng if (next != node) 24513fd0a558SYan, Zheng return NULL; 24523fd0a558SYan, Zheng 24533fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 24543fd0a558SYan, Zheng if (!next || next->level <= node->level) 24553fd0a558SYan, Zheng break; 24563fd0a558SYan, Zheng } 24573fd0a558SYan, Zheng 24583fd0a558SYan, Zheng if (!fs_root) 24593fd0a558SYan, Zheng return ERR_PTR(-ENOENT); 24603fd0a558SYan, Zheng return fs_root; 24615d4f98a2SYan Zheng } 24625d4f98a2SYan Zheng 24635d4f98a2SYan Zheng static noinline_for_stack 24643fd0a558SYan, Zheng u64 calcu_metadata_size(struct reloc_control *rc, 24653fd0a558SYan, Zheng struct backref_node *node, int reserve) 24665d4f98a2SYan Zheng { 24673fd0a558SYan, Zheng struct backref_node *next = node; 24683fd0a558SYan, Zheng struct backref_edge *edge; 24693fd0a558SYan, Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 24703fd0a558SYan, Zheng u64 num_bytes = 0; 24713fd0a558SYan, Zheng int index = 0; 24725d4f98a2SYan Zheng 24733fd0a558SYan, Zheng BUG_ON(reserve && node->processed); 24743fd0a558SYan, Zheng 24753fd0a558SYan, Zheng while (next) { 24763fd0a558SYan, Zheng cond_resched(); 24775d4f98a2SYan Zheng while (1) { 24783fd0a558SYan, Zheng if (next->processed && (reserve || next != node)) 24795d4f98a2SYan Zheng break; 24805d4f98a2SYan Zheng 24813fd0a558SYan, Zheng num_bytes += btrfs_level_size(rc->extent_root, 24823fd0a558SYan, Zheng next->level); 24833fd0a558SYan, Zheng 24843fd0a558SYan, Zheng if (list_empty(&next->upper)) 24853fd0a558SYan, Zheng break; 24863fd0a558SYan, Zheng 24873fd0a558SYan, Zheng edge = list_entry(next->upper.next, 24883fd0a558SYan, Zheng struct backref_edge, list[LOWER]); 24893fd0a558SYan, Zheng edges[index++] = edge; 24903fd0a558SYan, Zheng next = edge->node[UPPER]; 24915d4f98a2SYan Zheng } 24923fd0a558SYan, Zheng next = walk_down_backref(edges, &index); 24933fd0a558SYan, Zheng } 24943fd0a558SYan, Zheng return num_bytes; 24953fd0a558SYan, Zheng } 24963fd0a558SYan, Zheng 24973fd0a558SYan, Zheng static int reserve_metadata_space(struct btrfs_trans_handle *trans, 24983fd0a558SYan, Zheng struct reloc_control *rc, 24993fd0a558SYan, Zheng struct backref_node *node) 25003fd0a558SYan, Zheng { 25013fd0a558SYan, Zheng struct btrfs_root *root = rc->extent_root; 25023fd0a558SYan, Zheng u64 num_bytes; 25033fd0a558SYan, Zheng int ret; 25043fd0a558SYan, Zheng 25053fd0a558SYan, Zheng num_bytes = calcu_metadata_size(rc, node, 1) * 2; 25063fd0a558SYan, Zheng 25073fd0a558SYan, Zheng trans->block_rsv = rc->block_rsv; 250808e007d2SMiao Xie ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes, 250908e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 25103fd0a558SYan, Zheng if (ret) { 25113fd0a558SYan, Zheng if (ret == -EAGAIN) 25123fd0a558SYan, Zheng rc->commit_transaction = 1; 25133fd0a558SYan, Zheng return ret; 25143fd0a558SYan, Zheng } 25153fd0a558SYan, Zheng 25163fd0a558SYan, Zheng return 0; 25173fd0a558SYan, Zheng } 25183fd0a558SYan, Zheng 25193fd0a558SYan, Zheng static void release_metadata_space(struct reloc_control *rc, 25203fd0a558SYan, Zheng struct backref_node *node) 25213fd0a558SYan, Zheng { 25223fd0a558SYan, Zheng u64 num_bytes = calcu_metadata_size(rc, node, 0) * 2; 25233fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, num_bytes); 25245d4f98a2SYan Zheng } 25255d4f98a2SYan Zheng 25265d4f98a2SYan Zheng /* 25275d4f98a2SYan Zheng * relocate a block tree, and then update pointers in upper level 25285d4f98a2SYan Zheng * blocks that reference the block to point to the new location. 25295d4f98a2SYan Zheng * 25305d4f98a2SYan Zheng * if called by link_to_upper, the block has already been relocated. 25315d4f98a2SYan Zheng * in that case this function just updates pointers. 25325d4f98a2SYan Zheng */ 25335d4f98a2SYan Zheng static int do_relocation(struct btrfs_trans_handle *trans, 25343fd0a558SYan, Zheng struct reloc_control *rc, 25355d4f98a2SYan Zheng struct backref_node *node, 25365d4f98a2SYan Zheng struct btrfs_key *key, 25375d4f98a2SYan Zheng struct btrfs_path *path, int lowest) 25385d4f98a2SYan Zheng { 25395d4f98a2SYan Zheng struct backref_node *upper; 25405d4f98a2SYan Zheng struct backref_edge *edge; 25415d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 25425d4f98a2SYan Zheng struct btrfs_root *root; 25435d4f98a2SYan Zheng struct extent_buffer *eb; 25445d4f98a2SYan Zheng u32 blocksize; 25455d4f98a2SYan Zheng u64 bytenr; 25465d4f98a2SYan Zheng u64 generation; 25475d4f98a2SYan Zheng int nr; 25485d4f98a2SYan Zheng int slot; 25495d4f98a2SYan Zheng int ret; 25505d4f98a2SYan Zheng int err = 0; 25515d4f98a2SYan Zheng 25525d4f98a2SYan Zheng BUG_ON(lowest && node->eb); 25535d4f98a2SYan Zheng 25545d4f98a2SYan Zheng path->lowest_level = node->level + 1; 25553fd0a558SYan, Zheng rc->backref_cache.path[node->level] = node; 25565d4f98a2SYan Zheng list_for_each_entry(edge, &node->upper, list[LOWER]) { 25575d4f98a2SYan Zheng cond_resched(); 25585d4f98a2SYan Zheng 25595d4f98a2SYan Zheng upper = edge->node[UPPER]; 25603fd0a558SYan, Zheng root = select_reloc_root(trans, rc, upper, edges, &nr); 25613fd0a558SYan, Zheng BUG_ON(!root); 25625d4f98a2SYan Zheng 25633fd0a558SYan, Zheng if (upper->eb && !upper->locked) { 25643fd0a558SYan, Zheng if (!lowest) { 25653fd0a558SYan, Zheng ret = btrfs_bin_search(upper->eb, key, 25663fd0a558SYan, Zheng upper->level, &slot); 25673fd0a558SYan, Zheng BUG_ON(ret); 25683fd0a558SYan, Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 25693fd0a558SYan, Zheng if (node->eb->start == bytenr) 25703fd0a558SYan, Zheng goto next; 25713fd0a558SYan, Zheng } 25725d4f98a2SYan Zheng drop_node_buffer(upper); 25733fd0a558SYan, Zheng } 25745d4f98a2SYan Zheng 25755d4f98a2SYan Zheng if (!upper->eb) { 25765d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 25775d4f98a2SYan Zheng if (ret < 0) { 25785d4f98a2SYan Zheng err = ret; 25795d4f98a2SYan Zheng break; 25805d4f98a2SYan Zheng } 25815d4f98a2SYan Zheng BUG_ON(ret > 0); 25825d4f98a2SYan Zheng 25833fd0a558SYan, Zheng if (!upper->eb) { 25843fd0a558SYan, Zheng upper->eb = path->nodes[upper->level]; 25853fd0a558SYan, Zheng path->nodes[upper->level] = NULL; 25863fd0a558SYan, Zheng } else { 25873fd0a558SYan, Zheng BUG_ON(upper->eb != path->nodes[upper->level]); 25883fd0a558SYan, Zheng } 25893fd0a558SYan, Zheng 25903fd0a558SYan, Zheng upper->locked = 1; 25913fd0a558SYan, Zheng path->locks[upper->level] = 0; 25923fd0a558SYan, Zheng 25935d4f98a2SYan Zheng slot = path->slots[upper->level]; 2594b3b4aa74SDavid Sterba btrfs_release_path(path); 25955d4f98a2SYan Zheng } else { 25965d4f98a2SYan Zheng ret = btrfs_bin_search(upper->eb, key, upper->level, 25975d4f98a2SYan Zheng &slot); 25985d4f98a2SYan Zheng BUG_ON(ret); 25995d4f98a2SYan Zheng } 26005d4f98a2SYan Zheng 26015d4f98a2SYan Zheng bytenr = btrfs_node_blockptr(upper->eb, slot); 26023fd0a558SYan, Zheng if (lowest) { 26033fd0a558SYan, Zheng BUG_ON(bytenr != node->bytenr); 26045d4f98a2SYan Zheng } else { 26053fd0a558SYan, Zheng if (node->eb->start == bytenr) 26063fd0a558SYan, Zheng goto next; 26075d4f98a2SYan Zheng } 26085d4f98a2SYan Zheng 26095d4f98a2SYan Zheng blocksize = btrfs_level_size(root, node->level); 26105d4f98a2SYan Zheng generation = btrfs_node_ptr_generation(upper->eb, slot); 26115d4f98a2SYan Zheng eb = read_tree_block(root, bytenr, blocksize, generation); 2612416bc658SJosef Bacik if (!eb || !extent_buffer_uptodate(eb)) { 2613416bc658SJosef Bacik free_extent_buffer(eb); 261497d9a8a4STsutomu Itoh err = -EIO; 261597d9a8a4STsutomu Itoh goto next; 261697d9a8a4STsutomu Itoh } 26175d4f98a2SYan Zheng btrfs_tree_lock(eb); 26185d4f98a2SYan Zheng btrfs_set_lock_blocking(eb); 26195d4f98a2SYan Zheng 26205d4f98a2SYan Zheng if (!node->eb) { 26215d4f98a2SYan Zheng ret = btrfs_cow_block(trans, root, eb, upper->eb, 26225d4f98a2SYan Zheng slot, &eb); 26233fd0a558SYan, Zheng btrfs_tree_unlock(eb); 26243fd0a558SYan, Zheng free_extent_buffer(eb); 26255d4f98a2SYan Zheng if (ret < 0) { 26265d4f98a2SYan Zheng err = ret; 26273fd0a558SYan, Zheng goto next; 26285d4f98a2SYan Zheng } 26293fd0a558SYan, Zheng BUG_ON(node->eb != eb); 26305d4f98a2SYan Zheng } else { 26315d4f98a2SYan Zheng btrfs_set_node_blockptr(upper->eb, slot, 26325d4f98a2SYan Zheng node->eb->start); 26335d4f98a2SYan Zheng btrfs_set_node_ptr_generation(upper->eb, slot, 26345d4f98a2SYan Zheng trans->transid); 26355d4f98a2SYan Zheng btrfs_mark_buffer_dirty(upper->eb); 26365d4f98a2SYan Zheng 26375d4f98a2SYan Zheng ret = btrfs_inc_extent_ref(trans, root, 26385d4f98a2SYan Zheng node->eb->start, blocksize, 26395d4f98a2SYan Zheng upper->eb->start, 26405d4f98a2SYan Zheng btrfs_header_owner(upper->eb), 264166d7e7f0SArne Jansen node->level, 0, 1); 26425d4f98a2SYan Zheng BUG_ON(ret); 26435d4f98a2SYan Zheng 26445d4f98a2SYan Zheng ret = btrfs_drop_subtree(trans, root, eb, upper->eb); 26455d4f98a2SYan Zheng BUG_ON(ret); 26465d4f98a2SYan Zheng } 26473fd0a558SYan, Zheng next: 26483fd0a558SYan, Zheng if (!upper->pending) 26493fd0a558SYan, Zheng drop_node_buffer(upper); 26503fd0a558SYan, Zheng else 26513fd0a558SYan, Zheng unlock_node_buffer(upper); 26523fd0a558SYan, Zheng if (err) 26533fd0a558SYan, Zheng break; 26545d4f98a2SYan Zheng } 26553fd0a558SYan, Zheng 26563fd0a558SYan, Zheng if (!err && node->pending) { 26573fd0a558SYan, Zheng drop_node_buffer(node); 26583fd0a558SYan, Zheng list_move_tail(&node->list, &rc->backref_cache.changed); 26593fd0a558SYan, Zheng node->pending = 0; 26605d4f98a2SYan Zheng } 26613fd0a558SYan, Zheng 26625d4f98a2SYan Zheng path->lowest_level = 0; 26633fd0a558SYan, Zheng BUG_ON(err == -ENOSPC); 26645d4f98a2SYan Zheng return err; 26655d4f98a2SYan Zheng } 26665d4f98a2SYan Zheng 26675d4f98a2SYan Zheng static int link_to_upper(struct btrfs_trans_handle *trans, 26683fd0a558SYan, Zheng struct reloc_control *rc, 26695d4f98a2SYan Zheng struct backref_node *node, 26705d4f98a2SYan Zheng struct btrfs_path *path) 26715d4f98a2SYan Zheng { 26725d4f98a2SYan Zheng struct btrfs_key key; 26735d4f98a2SYan Zheng 26745d4f98a2SYan Zheng btrfs_node_key_to_cpu(node->eb, &key, 0); 26753fd0a558SYan, Zheng return do_relocation(trans, rc, node, &key, path, 0); 26765d4f98a2SYan Zheng } 26775d4f98a2SYan Zheng 26785d4f98a2SYan Zheng static int finish_pending_nodes(struct btrfs_trans_handle *trans, 26793fd0a558SYan, Zheng struct reloc_control *rc, 26803fd0a558SYan, Zheng struct btrfs_path *path, int err) 26815d4f98a2SYan Zheng { 26823fd0a558SYan, Zheng LIST_HEAD(list); 26833fd0a558SYan, Zheng struct backref_cache *cache = &rc->backref_cache; 26845d4f98a2SYan Zheng struct backref_node *node; 26855d4f98a2SYan Zheng int level; 26865d4f98a2SYan Zheng int ret; 26875d4f98a2SYan Zheng 26885d4f98a2SYan Zheng for (level = 0; level < BTRFS_MAX_LEVEL; level++) { 26895d4f98a2SYan Zheng while (!list_empty(&cache->pending[level])) { 26905d4f98a2SYan Zheng node = list_entry(cache->pending[level].next, 26913fd0a558SYan, Zheng struct backref_node, list); 26923fd0a558SYan, Zheng list_move_tail(&node->list, &list); 26933fd0a558SYan, Zheng BUG_ON(!node->pending); 26945d4f98a2SYan Zheng 26953fd0a558SYan, Zheng if (!err) { 26963fd0a558SYan, Zheng ret = link_to_upper(trans, rc, node, path); 26975d4f98a2SYan Zheng if (ret < 0) 26985d4f98a2SYan Zheng err = ret; 26995d4f98a2SYan Zheng } 27005d4f98a2SYan Zheng } 27013fd0a558SYan, Zheng list_splice_init(&list, &cache->pending[level]); 27023fd0a558SYan, Zheng } 27035d4f98a2SYan Zheng return err; 27045d4f98a2SYan Zheng } 27055d4f98a2SYan Zheng 27065d4f98a2SYan Zheng static void mark_block_processed(struct reloc_control *rc, 27073fd0a558SYan, Zheng u64 bytenr, u32 blocksize) 27083fd0a558SYan, Zheng { 27093fd0a558SYan, Zheng set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1, 27103fd0a558SYan, Zheng EXTENT_DIRTY, GFP_NOFS); 27113fd0a558SYan, Zheng } 27123fd0a558SYan, Zheng 27133fd0a558SYan, Zheng static void __mark_block_processed(struct reloc_control *rc, 27145d4f98a2SYan Zheng struct backref_node *node) 27155d4f98a2SYan Zheng { 27165d4f98a2SYan Zheng u32 blocksize; 27175d4f98a2SYan Zheng if (node->level == 0 || 27185d4f98a2SYan Zheng in_block_group(node->bytenr, rc->block_group)) { 27195d4f98a2SYan Zheng blocksize = btrfs_level_size(rc->extent_root, node->level); 27203fd0a558SYan, Zheng mark_block_processed(rc, node->bytenr, blocksize); 27215d4f98a2SYan Zheng } 27225d4f98a2SYan Zheng node->processed = 1; 27235d4f98a2SYan Zheng } 27245d4f98a2SYan Zheng 27255d4f98a2SYan Zheng /* 27265d4f98a2SYan Zheng * mark a block and all blocks directly/indirectly reference the block 27275d4f98a2SYan Zheng * as processed. 27285d4f98a2SYan Zheng */ 27295d4f98a2SYan Zheng static void update_processed_blocks(struct reloc_control *rc, 27305d4f98a2SYan Zheng struct backref_node *node) 27315d4f98a2SYan Zheng { 27325d4f98a2SYan Zheng struct backref_node *next = node; 27335d4f98a2SYan Zheng struct backref_edge *edge; 27345d4f98a2SYan Zheng struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; 27355d4f98a2SYan Zheng int index = 0; 27365d4f98a2SYan Zheng 27375d4f98a2SYan Zheng while (next) { 27385d4f98a2SYan Zheng cond_resched(); 27395d4f98a2SYan Zheng while (1) { 27405d4f98a2SYan Zheng if (next->processed) 27415d4f98a2SYan Zheng break; 27425d4f98a2SYan Zheng 27433fd0a558SYan, Zheng __mark_block_processed(rc, next); 27445d4f98a2SYan Zheng 27455d4f98a2SYan Zheng if (list_empty(&next->upper)) 27465d4f98a2SYan Zheng break; 27475d4f98a2SYan Zheng 27485d4f98a2SYan Zheng edge = list_entry(next->upper.next, 27495d4f98a2SYan Zheng struct backref_edge, list[LOWER]); 27505d4f98a2SYan Zheng edges[index++] = edge; 27515d4f98a2SYan Zheng next = edge->node[UPPER]; 27525d4f98a2SYan Zheng } 27535d4f98a2SYan Zheng next = walk_down_backref(edges, &index); 27545d4f98a2SYan Zheng } 27555d4f98a2SYan Zheng } 27565d4f98a2SYan Zheng 27575d4f98a2SYan Zheng static int tree_block_processed(u64 bytenr, u32 blocksize, 27585d4f98a2SYan Zheng struct reloc_control *rc) 27595d4f98a2SYan Zheng { 27605d4f98a2SYan Zheng if (test_range_bit(&rc->processed_blocks, bytenr, 27619655d298SChris Mason bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL)) 27625d4f98a2SYan Zheng return 1; 27635d4f98a2SYan Zheng return 0; 27645d4f98a2SYan Zheng } 27655d4f98a2SYan Zheng 27665d4f98a2SYan Zheng static int get_tree_block_key(struct reloc_control *rc, 27675d4f98a2SYan Zheng struct tree_block *block) 27685d4f98a2SYan Zheng { 27695d4f98a2SYan Zheng struct extent_buffer *eb; 27705d4f98a2SYan Zheng 27715d4f98a2SYan Zheng BUG_ON(block->key_ready); 27725d4f98a2SYan Zheng eb = read_tree_block(rc->extent_root, block->bytenr, 27735d4f98a2SYan Zheng block->key.objectid, block->key.offset); 2774416bc658SJosef Bacik if (!eb || !extent_buffer_uptodate(eb)) { 2775416bc658SJosef Bacik free_extent_buffer(eb); 2776416bc658SJosef Bacik return -EIO; 2777416bc658SJosef Bacik } 27785d4f98a2SYan Zheng WARN_ON(btrfs_header_level(eb) != block->level); 27795d4f98a2SYan Zheng if (block->level == 0) 27805d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &block->key, 0); 27815d4f98a2SYan Zheng else 27825d4f98a2SYan Zheng btrfs_node_key_to_cpu(eb, &block->key, 0); 27835d4f98a2SYan Zheng free_extent_buffer(eb); 27845d4f98a2SYan Zheng block->key_ready = 1; 27855d4f98a2SYan Zheng return 0; 27865d4f98a2SYan Zheng } 27875d4f98a2SYan Zheng 27885d4f98a2SYan Zheng static int reada_tree_block(struct reloc_control *rc, 27895d4f98a2SYan Zheng struct tree_block *block) 27905d4f98a2SYan Zheng { 27915d4f98a2SYan Zheng BUG_ON(block->key_ready); 27923173a18fSJosef Bacik if (block->key.type == BTRFS_METADATA_ITEM_KEY) 27933173a18fSJosef Bacik readahead_tree_block(rc->extent_root, block->bytenr, 27943173a18fSJosef Bacik block->key.objectid, 27953173a18fSJosef Bacik rc->extent_root->leafsize); 27963173a18fSJosef Bacik else 27975d4f98a2SYan Zheng readahead_tree_block(rc->extent_root, block->bytenr, 27985d4f98a2SYan Zheng block->key.objectid, block->key.offset); 27995d4f98a2SYan Zheng return 0; 28005d4f98a2SYan Zheng } 28015d4f98a2SYan Zheng 28025d4f98a2SYan Zheng /* 28035d4f98a2SYan Zheng * helper function to relocate a tree block 28045d4f98a2SYan Zheng */ 28055d4f98a2SYan Zheng static int relocate_tree_block(struct btrfs_trans_handle *trans, 28065d4f98a2SYan Zheng struct reloc_control *rc, 28075d4f98a2SYan Zheng struct backref_node *node, 28085d4f98a2SYan Zheng struct btrfs_key *key, 28095d4f98a2SYan Zheng struct btrfs_path *path) 28105d4f98a2SYan Zheng { 28115d4f98a2SYan Zheng struct btrfs_root *root; 28123fd0a558SYan, Zheng int release = 0; 28133fd0a558SYan, Zheng int ret = 0; 28145d4f98a2SYan Zheng 28153fd0a558SYan, Zheng if (!node) 28165d4f98a2SYan Zheng return 0; 28173fd0a558SYan, Zheng 28183fd0a558SYan, Zheng BUG_ON(node->processed); 28193fd0a558SYan, Zheng root = select_one_root(trans, node); 28203fd0a558SYan, Zheng if (root == ERR_PTR(-ENOENT)) { 28213fd0a558SYan, Zheng update_processed_blocks(rc, node); 28223fd0a558SYan, Zheng goto out; 28235d4f98a2SYan Zheng } 28245d4f98a2SYan Zheng 28253fd0a558SYan, Zheng if (!root || root->ref_cows) { 28263fd0a558SYan, Zheng ret = reserve_metadata_space(trans, rc, node); 28273fd0a558SYan, Zheng if (ret) 28285d4f98a2SYan Zheng goto out; 28293fd0a558SYan, Zheng release = 1; 28305d4f98a2SYan Zheng } 28313fd0a558SYan, Zheng 28323fd0a558SYan, Zheng if (root) { 28333fd0a558SYan, Zheng if (root->ref_cows) { 28343fd0a558SYan, Zheng BUG_ON(node->new_bytenr); 28353fd0a558SYan, Zheng BUG_ON(!list_empty(&node->list)); 28363fd0a558SYan, Zheng btrfs_record_root_in_trans(trans, root); 28373fd0a558SYan, Zheng root = root->reloc_root; 28383fd0a558SYan, Zheng node->new_bytenr = root->node->start; 28393fd0a558SYan, Zheng node->root = root; 28403fd0a558SYan, Zheng list_add_tail(&node->list, &rc->backref_cache.changed); 28413fd0a558SYan, Zheng } else { 28425d4f98a2SYan Zheng path->lowest_level = node->level; 28435d4f98a2SYan Zheng ret = btrfs_search_slot(trans, root, key, path, 0, 1); 2844b3b4aa74SDavid Sterba btrfs_release_path(path); 28453fd0a558SYan, Zheng if (ret > 0) 28465d4f98a2SYan Zheng ret = 0; 28473fd0a558SYan, Zheng } 28483fd0a558SYan, Zheng if (!ret) 28493fd0a558SYan, Zheng update_processed_blocks(rc, node); 28503fd0a558SYan, Zheng } else { 28513fd0a558SYan, Zheng ret = do_relocation(trans, rc, node, key, path, 1); 28523fd0a558SYan, Zheng } 28535d4f98a2SYan Zheng out: 28543fd0a558SYan, Zheng if (ret || node->level == 0 || node->cowonly) { 28553fd0a558SYan, Zheng if (release) 28563fd0a558SYan, Zheng release_metadata_space(rc, node); 28573fd0a558SYan, Zheng remove_backref_node(&rc->backref_cache, node); 28583fd0a558SYan, Zheng } 28595d4f98a2SYan Zheng return ret; 28605d4f98a2SYan Zheng } 28615d4f98a2SYan Zheng 28625d4f98a2SYan Zheng /* 28635d4f98a2SYan Zheng * relocate a list of blocks 28645d4f98a2SYan Zheng */ 28655d4f98a2SYan Zheng static noinline_for_stack 28665d4f98a2SYan Zheng int relocate_tree_blocks(struct btrfs_trans_handle *trans, 28675d4f98a2SYan Zheng struct reloc_control *rc, struct rb_root *blocks) 28685d4f98a2SYan Zheng { 28695d4f98a2SYan Zheng struct backref_node *node; 28705d4f98a2SYan Zheng struct btrfs_path *path; 28715d4f98a2SYan Zheng struct tree_block *block; 28725d4f98a2SYan Zheng struct rb_node *rb_node; 28735d4f98a2SYan Zheng int ret; 28745d4f98a2SYan Zheng int err = 0; 28755d4f98a2SYan Zheng 28765d4f98a2SYan Zheng path = btrfs_alloc_path(); 2877e1a12670SLiu Bo if (!path) { 2878e1a12670SLiu Bo err = -ENOMEM; 2879e1a12670SLiu Bo goto out_path; 2880e1a12670SLiu Bo } 28815d4f98a2SYan Zheng 28825d4f98a2SYan Zheng rb_node = rb_first(blocks); 28835d4f98a2SYan Zheng while (rb_node) { 28845d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 28855d4f98a2SYan Zheng if (!block->key_ready) 28865d4f98a2SYan Zheng reada_tree_block(rc, block); 28875d4f98a2SYan Zheng rb_node = rb_next(rb_node); 28885d4f98a2SYan Zheng } 28895d4f98a2SYan Zheng 28905d4f98a2SYan Zheng rb_node = rb_first(blocks); 28915d4f98a2SYan Zheng while (rb_node) { 28925d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 28935d4f98a2SYan Zheng if (!block->key_ready) 28945d4f98a2SYan Zheng get_tree_block_key(rc, block); 28955d4f98a2SYan Zheng rb_node = rb_next(rb_node); 28965d4f98a2SYan Zheng } 28975d4f98a2SYan Zheng 28985d4f98a2SYan Zheng rb_node = rb_first(blocks); 28995d4f98a2SYan Zheng while (rb_node) { 29005d4f98a2SYan Zheng block = rb_entry(rb_node, struct tree_block, rb_node); 29015d4f98a2SYan Zheng 29023fd0a558SYan, Zheng node = build_backref_tree(rc, &block->key, 29035d4f98a2SYan Zheng block->level, block->bytenr); 29045d4f98a2SYan Zheng if (IS_ERR(node)) { 29055d4f98a2SYan Zheng err = PTR_ERR(node); 29065d4f98a2SYan Zheng goto out; 29075d4f98a2SYan Zheng } 29085d4f98a2SYan Zheng 29095d4f98a2SYan Zheng ret = relocate_tree_block(trans, rc, node, &block->key, 29105d4f98a2SYan Zheng path); 29115d4f98a2SYan Zheng if (ret < 0) { 29123fd0a558SYan, Zheng if (ret != -EAGAIN || rb_node == rb_first(blocks)) 29135d4f98a2SYan Zheng err = ret; 29145d4f98a2SYan Zheng goto out; 29155d4f98a2SYan Zheng } 29165d4f98a2SYan Zheng rb_node = rb_next(rb_node); 29175d4f98a2SYan Zheng } 29185d4f98a2SYan Zheng out: 29193fd0a558SYan, Zheng err = finish_pending_nodes(trans, rc, path, err); 29205d4f98a2SYan Zheng 29215d4f98a2SYan Zheng btrfs_free_path(path); 2922e1a12670SLiu Bo out_path: 2923e1a12670SLiu Bo free_block_list(blocks); 29245d4f98a2SYan Zheng return err; 29255d4f98a2SYan Zheng } 29265d4f98a2SYan Zheng 29275d4f98a2SYan Zheng static noinline_for_stack 2928efa56464SYan, Zheng int prealloc_file_extent_cluster(struct inode *inode, 2929efa56464SYan, Zheng struct file_extent_cluster *cluster) 2930efa56464SYan, Zheng { 2931efa56464SYan, Zheng u64 alloc_hint = 0; 2932efa56464SYan, Zheng u64 start; 2933efa56464SYan, Zheng u64 end; 2934efa56464SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 2935efa56464SYan, Zheng u64 num_bytes; 2936efa56464SYan, Zheng int nr = 0; 2937efa56464SYan, Zheng int ret = 0; 2938efa56464SYan, Zheng 2939efa56464SYan, Zheng BUG_ON(cluster->start != cluster->boundary[0]); 2940efa56464SYan, Zheng mutex_lock(&inode->i_mutex); 2941efa56464SYan, Zheng 2942efa56464SYan, Zheng ret = btrfs_check_data_free_space(inode, cluster->end + 2943efa56464SYan, Zheng 1 - cluster->start); 2944efa56464SYan, Zheng if (ret) 2945efa56464SYan, Zheng goto out; 2946efa56464SYan, Zheng 2947efa56464SYan, Zheng while (nr < cluster->nr) { 2948efa56464SYan, Zheng start = cluster->boundary[nr] - offset; 2949efa56464SYan, Zheng if (nr + 1 < cluster->nr) 2950efa56464SYan, Zheng end = cluster->boundary[nr + 1] - 1 - offset; 2951efa56464SYan, Zheng else 2952efa56464SYan, Zheng end = cluster->end - offset; 2953efa56464SYan, Zheng 2954d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 2955efa56464SYan, Zheng num_bytes = end + 1 - start; 2956efa56464SYan, Zheng ret = btrfs_prealloc_file_range(inode, 0, start, 2957efa56464SYan, Zheng num_bytes, num_bytes, 2958efa56464SYan, Zheng end + 1, &alloc_hint); 2959d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 2960efa56464SYan, Zheng if (ret) 2961efa56464SYan, Zheng break; 2962efa56464SYan, Zheng nr++; 2963efa56464SYan, Zheng } 2964efa56464SYan, Zheng btrfs_free_reserved_data_space(inode, cluster->end + 2965efa56464SYan, Zheng 1 - cluster->start); 2966efa56464SYan, Zheng out: 2967efa56464SYan, Zheng mutex_unlock(&inode->i_mutex); 2968efa56464SYan, Zheng return ret; 2969efa56464SYan, Zheng } 2970efa56464SYan, Zheng 2971efa56464SYan, Zheng static noinline_for_stack 29720257bb82SYan, Zheng int setup_extent_mapping(struct inode *inode, u64 start, u64 end, 29730257bb82SYan, Zheng u64 block_start) 29745d4f98a2SYan Zheng { 29755d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(inode)->root; 29765d4f98a2SYan Zheng struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; 29775d4f98a2SYan Zheng struct extent_map *em; 29780257bb82SYan, Zheng int ret = 0; 29795d4f98a2SYan Zheng 2980172ddd60SDavid Sterba em = alloc_extent_map(); 29810257bb82SYan, Zheng if (!em) 29820257bb82SYan, Zheng return -ENOMEM; 29830257bb82SYan, Zheng 29845d4f98a2SYan Zheng em->start = start; 29850257bb82SYan, Zheng em->len = end + 1 - start; 29860257bb82SYan, Zheng em->block_len = em->len; 29870257bb82SYan, Zheng em->block_start = block_start; 29885d4f98a2SYan Zheng em->bdev = root->fs_info->fs_devices->latest_bdev; 29895d4f98a2SYan Zheng set_bit(EXTENT_FLAG_PINNED, &em->flags); 29905d4f98a2SYan Zheng 2991d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, start, end); 29925d4f98a2SYan Zheng while (1) { 2993890871beSChris Mason write_lock(&em_tree->lock); 299409a2a8f9SJosef Bacik ret = add_extent_mapping(em_tree, em, 0); 2995890871beSChris Mason write_unlock(&em_tree->lock); 29965d4f98a2SYan Zheng if (ret != -EEXIST) { 29975d4f98a2SYan Zheng free_extent_map(em); 29985d4f98a2SYan Zheng break; 29995d4f98a2SYan Zheng } 30005d4f98a2SYan Zheng btrfs_drop_extent_cache(inode, start, end, 0); 30015d4f98a2SYan Zheng } 3002d0082371SJeff Mahoney unlock_extent(&BTRFS_I(inode)->io_tree, start, end); 30030257bb82SYan, Zheng return ret; 30040257bb82SYan, Zheng } 30055d4f98a2SYan Zheng 30060257bb82SYan, Zheng static int relocate_file_extent_cluster(struct inode *inode, 30070257bb82SYan, Zheng struct file_extent_cluster *cluster) 30080257bb82SYan, Zheng { 30090257bb82SYan, Zheng u64 page_start; 30100257bb82SYan, Zheng u64 page_end; 30110257bb82SYan, Zheng u64 offset = BTRFS_I(inode)->index_cnt; 30120257bb82SYan, Zheng unsigned long index; 30130257bb82SYan, Zheng unsigned long last_index; 30140257bb82SYan, Zheng struct page *page; 30150257bb82SYan, Zheng struct file_ra_state *ra; 30163b16a4e3SJosef Bacik gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); 30170257bb82SYan, Zheng int nr = 0; 30180257bb82SYan, Zheng int ret = 0; 30190257bb82SYan, Zheng 30200257bb82SYan, Zheng if (!cluster->nr) 30210257bb82SYan, Zheng return 0; 30220257bb82SYan, Zheng 30230257bb82SYan, Zheng ra = kzalloc(sizeof(*ra), GFP_NOFS); 30240257bb82SYan, Zheng if (!ra) 30250257bb82SYan, Zheng return -ENOMEM; 30260257bb82SYan, Zheng 3027efa56464SYan, Zheng ret = prealloc_file_extent_cluster(inode, cluster); 30280257bb82SYan, Zheng if (ret) 3029efa56464SYan, Zheng goto out; 30300257bb82SYan, Zheng 30310257bb82SYan, Zheng file_ra_state_init(ra, inode->i_mapping); 30320257bb82SYan, Zheng 3033efa56464SYan, Zheng ret = setup_extent_mapping(inode, cluster->start - offset, 3034efa56464SYan, Zheng cluster->end - offset, cluster->start); 3035efa56464SYan, Zheng if (ret) 3036efa56464SYan, Zheng goto out; 3037efa56464SYan, Zheng 3038efa56464SYan, Zheng index = (cluster->start - offset) >> PAGE_CACHE_SHIFT; 3039efa56464SYan, Zheng last_index = (cluster->end - offset) >> PAGE_CACHE_SHIFT; 30400257bb82SYan, Zheng while (index <= last_index) { 3041efa56464SYan, Zheng ret = btrfs_delalloc_reserve_metadata(inode, PAGE_CACHE_SIZE); 3042efa56464SYan, Zheng if (ret) 3043efa56464SYan, Zheng goto out; 3044efa56464SYan, Zheng 30450257bb82SYan, Zheng page = find_lock_page(inode->i_mapping, index); 30460257bb82SYan, Zheng if (!page) { 30470257bb82SYan, Zheng page_cache_sync_readahead(inode->i_mapping, 30480257bb82SYan, Zheng ra, NULL, index, 30490257bb82SYan, Zheng last_index + 1 - index); 3050a94733d0SJosef Bacik page = find_or_create_page(inode->i_mapping, index, 30513b16a4e3SJosef Bacik mask); 30520257bb82SYan, Zheng if (!page) { 3053efa56464SYan, Zheng btrfs_delalloc_release_metadata(inode, 3054efa56464SYan, Zheng PAGE_CACHE_SIZE); 30550257bb82SYan, Zheng ret = -ENOMEM; 3056efa56464SYan, Zheng goto out; 30570257bb82SYan, Zheng } 30580257bb82SYan, Zheng } 30590257bb82SYan, Zheng 30600257bb82SYan, Zheng if (PageReadahead(page)) { 30610257bb82SYan, Zheng page_cache_async_readahead(inode->i_mapping, 30620257bb82SYan, Zheng ra, NULL, page, index, 30630257bb82SYan, Zheng last_index + 1 - index); 30640257bb82SYan, Zheng } 30650257bb82SYan, Zheng 30660257bb82SYan, Zheng if (!PageUptodate(page)) { 30670257bb82SYan, Zheng btrfs_readpage(NULL, page); 30680257bb82SYan, Zheng lock_page(page); 30690257bb82SYan, Zheng if (!PageUptodate(page)) { 30700257bb82SYan, Zheng unlock_page(page); 30710257bb82SYan, Zheng page_cache_release(page); 3072efa56464SYan, Zheng btrfs_delalloc_release_metadata(inode, 3073efa56464SYan, Zheng PAGE_CACHE_SIZE); 30740257bb82SYan, Zheng ret = -EIO; 3075efa56464SYan, Zheng goto out; 30760257bb82SYan, Zheng } 30770257bb82SYan, Zheng } 30780257bb82SYan, Zheng 30794eee4fa4SMiao Xie page_start = page_offset(page); 30800257bb82SYan, Zheng page_end = page_start + PAGE_CACHE_SIZE - 1; 30810257bb82SYan, Zheng 3082d0082371SJeff Mahoney lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end); 30830257bb82SYan, Zheng 30840257bb82SYan, Zheng set_page_extent_mapped(page); 30850257bb82SYan, Zheng 30860257bb82SYan, Zheng if (nr < cluster->nr && 30870257bb82SYan, Zheng page_start + offset == cluster->boundary[nr]) { 30880257bb82SYan, Zheng set_extent_bits(&BTRFS_I(inode)->io_tree, 30890257bb82SYan, Zheng page_start, page_end, 30900257bb82SYan, Zheng EXTENT_BOUNDARY, GFP_NOFS); 30910257bb82SYan, Zheng nr++; 30920257bb82SYan, Zheng } 30930257bb82SYan, Zheng 3094efa56464SYan, Zheng btrfs_set_extent_delalloc(inode, page_start, page_end, NULL); 30950257bb82SYan, Zheng set_page_dirty(page); 30960257bb82SYan, Zheng 30970257bb82SYan, Zheng unlock_extent(&BTRFS_I(inode)->io_tree, 3098d0082371SJeff Mahoney page_start, page_end); 30990257bb82SYan, Zheng unlock_page(page); 31000257bb82SYan, Zheng page_cache_release(page); 31010257bb82SYan, Zheng 31020257bb82SYan, Zheng index++; 3103efa56464SYan, Zheng balance_dirty_pages_ratelimited(inode->i_mapping); 3104efa56464SYan, Zheng btrfs_throttle(BTRFS_I(inode)->root); 31050257bb82SYan, Zheng } 31060257bb82SYan, Zheng WARN_ON(nr != cluster->nr); 3107efa56464SYan, Zheng out: 31080257bb82SYan, Zheng kfree(ra); 31090257bb82SYan, Zheng return ret; 31100257bb82SYan, Zheng } 31110257bb82SYan, Zheng 31120257bb82SYan, Zheng static noinline_for_stack 31130257bb82SYan, Zheng int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key, 31140257bb82SYan, Zheng struct file_extent_cluster *cluster) 31150257bb82SYan, Zheng { 31160257bb82SYan, Zheng int ret; 31170257bb82SYan, Zheng 31180257bb82SYan, Zheng if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) { 31190257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 31200257bb82SYan, Zheng if (ret) 31210257bb82SYan, Zheng return ret; 31220257bb82SYan, Zheng cluster->nr = 0; 31230257bb82SYan, Zheng } 31240257bb82SYan, Zheng 31250257bb82SYan, Zheng if (!cluster->nr) 31260257bb82SYan, Zheng cluster->start = extent_key->objectid; 31270257bb82SYan, Zheng else 31280257bb82SYan, Zheng BUG_ON(cluster->nr >= MAX_EXTENTS); 31290257bb82SYan, Zheng cluster->end = extent_key->objectid + extent_key->offset - 1; 31300257bb82SYan, Zheng cluster->boundary[cluster->nr] = extent_key->objectid; 31310257bb82SYan, Zheng cluster->nr++; 31320257bb82SYan, Zheng 31330257bb82SYan, Zheng if (cluster->nr >= MAX_EXTENTS) { 31340257bb82SYan, Zheng ret = relocate_file_extent_cluster(inode, cluster); 31350257bb82SYan, Zheng if (ret) 31360257bb82SYan, Zheng return ret; 31370257bb82SYan, Zheng cluster->nr = 0; 31380257bb82SYan, Zheng } 31390257bb82SYan, Zheng return 0; 31405d4f98a2SYan Zheng } 31415d4f98a2SYan Zheng 31425d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 31435d4f98a2SYan Zheng static int get_ref_objectid_v0(struct reloc_control *rc, 31445d4f98a2SYan Zheng struct btrfs_path *path, 31455d4f98a2SYan Zheng struct btrfs_key *extent_key, 31465d4f98a2SYan Zheng u64 *ref_objectid, int *path_change) 31475d4f98a2SYan Zheng { 31485d4f98a2SYan Zheng struct btrfs_key key; 31495d4f98a2SYan Zheng struct extent_buffer *leaf; 31505d4f98a2SYan Zheng struct btrfs_extent_ref_v0 *ref0; 31515d4f98a2SYan Zheng int ret; 31525d4f98a2SYan Zheng int slot; 31535d4f98a2SYan Zheng 31545d4f98a2SYan Zheng leaf = path->nodes[0]; 31555d4f98a2SYan Zheng slot = path->slots[0]; 31565d4f98a2SYan Zheng while (1) { 31575d4f98a2SYan Zheng if (slot >= btrfs_header_nritems(leaf)) { 31585d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 31595d4f98a2SYan Zheng if (ret < 0) 31605d4f98a2SYan Zheng return ret; 31615d4f98a2SYan Zheng BUG_ON(ret > 0); 31625d4f98a2SYan Zheng leaf = path->nodes[0]; 31635d4f98a2SYan Zheng slot = path->slots[0]; 31645d4f98a2SYan Zheng if (path_change) 31655d4f98a2SYan Zheng *path_change = 1; 31665d4f98a2SYan Zheng } 31675d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, slot); 31685d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 31695d4f98a2SYan Zheng return -ENOENT; 31705d4f98a2SYan Zheng 31715d4f98a2SYan Zheng if (key.type != BTRFS_EXTENT_REF_V0_KEY) { 31725d4f98a2SYan Zheng slot++; 31735d4f98a2SYan Zheng continue; 31745d4f98a2SYan Zheng } 31755d4f98a2SYan Zheng ref0 = btrfs_item_ptr(leaf, slot, 31765d4f98a2SYan Zheng struct btrfs_extent_ref_v0); 31775d4f98a2SYan Zheng *ref_objectid = btrfs_ref_objectid_v0(leaf, ref0); 31785d4f98a2SYan Zheng break; 31795d4f98a2SYan Zheng } 31805d4f98a2SYan Zheng return 0; 31815d4f98a2SYan Zheng } 31825d4f98a2SYan Zheng #endif 31835d4f98a2SYan Zheng 31845d4f98a2SYan Zheng /* 31855d4f98a2SYan Zheng * helper to add a tree block to the list. 31865d4f98a2SYan Zheng * the major work is getting the generation and level of the block 31875d4f98a2SYan Zheng */ 31885d4f98a2SYan Zheng static int add_tree_block(struct reloc_control *rc, 31895d4f98a2SYan Zheng struct btrfs_key *extent_key, 31905d4f98a2SYan Zheng struct btrfs_path *path, 31915d4f98a2SYan Zheng struct rb_root *blocks) 31925d4f98a2SYan Zheng { 31935d4f98a2SYan Zheng struct extent_buffer *eb; 31945d4f98a2SYan Zheng struct btrfs_extent_item *ei; 31955d4f98a2SYan Zheng struct btrfs_tree_block_info *bi; 31965d4f98a2SYan Zheng struct tree_block *block; 31975d4f98a2SYan Zheng struct rb_node *rb_node; 31985d4f98a2SYan Zheng u32 item_size; 31995d4f98a2SYan Zheng int level = -1; 32005d4f98a2SYan Zheng int generation; 32015d4f98a2SYan Zheng 32025d4f98a2SYan Zheng eb = path->nodes[0]; 32035d4f98a2SYan Zheng item_size = btrfs_item_size_nr(eb, path->slots[0]); 32045d4f98a2SYan Zheng 32053173a18fSJosef Bacik if (extent_key->type == BTRFS_METADATA_ITEM_KEY || 32063173a18fSJosef Bacik item_size >= sizeof(*ei) + sizeof(*bi)) { 32075d4f98a2SYan Zheng ei = btrfs_item_ptr(eb, path->slots[0], 32085d4f98a2SYan Zheng struct btrfs_extent_item); 32093173a18fSJosef Bacik if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) { 32105d4f98a2SYan Zheng bi = (struct btrfs_tree_block_info *)(ei + 1); 32115d4f98a2SYan Zheng level = btrfs_tree_block_level(eb, bi); 32125d4f98a2SYan Zheng } else { 32133173a18fSJosef Bacik level = (int)extent_key->offset; 32143173a18fSJosef Bacik } 32153173a18fSJosef Bacik generation = btrfs_extent_generation(eb, ei); 32163173a18fSJosef Bacik } else { 32175d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 32185d4f98a2SYan Zheng u64 ref_owner; 32195d4f98a2SYan Zheng int ret; 32205d4f98a2SYan Zheng 32215d4f98a2SYan Zheng BUG_ON(item_size != sizeof(struct btrfs_extent_item_v0)); 32225d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, extent_key, 32235d4f98a2SYan Zheng &ref_owner, NULL); 3224411fc6bcSAndi Kleen if (ret < 0) 3225411fc6bcSAndi Kleen return ret; 32265d4f98a2SYan Zheng BUG_ON(ref_owner >= BTRFS_MAX_LEVEL); 32275d4f98a2SYan Zheng level = (int)ref_owner; 32285d4f98a2SYan Zheng /* FIXME: get real generation */ 32295d4f98a2SYan Zheng generation = 0; 32305d4f98a2SYan Zheng #else 32315d4f98a2SYan Zheng BUG(); 32325d4f98a2SYan Zheng #endif 32335d4f98a2SYan Zheng } 32345d4f98a2SYan Zheng 3235b3b4aa74SDavid Sterba btrfs_release_path(path); 32365d4f98a2SYan Zheng 32375d4f98a2SYan Zheng BUG_ON(level == -1); 32385d4f98a2SYan Zheng 32395d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 32405d4f98a2SYan Zheng if (!block) 32415d4f98a2SYan Zheng return -ENOMEM; 32425d4f98a2SYan Zheng 32435d4f98a2SYan Zheng block->bytenr = extent_key->objectid; 32443173a18fSJosef Bacik block->key.objectid = rc->extent_root->leafsize; 32455d4f98a2SYan Zheng block->key.offset = generation; 32465d4f98a2SYan Zheng block->level = level; 32475d4f98a2SYan Zheng block->key_ready = 0; 32485d4f98a2SYan Zheng 32495d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); 325043c04fb1SJeff Mahoney if (rb_node) 325143c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, block->bytenr); 32525d4f98a2SYan Zheng 32535d4f98a2SYan Zheng return 0; 32545d4f98a2SYan Zheng } 32555d4f98a2SYan Zheng 32565d4f98a2SYan Zheng /* 32575d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY 32585d4f98a2SYan Zheng */ 32595d4f98a2SYan Zheng static int __add_tree_block(struct reloc_control *rc, 32605d4f98a2SYan Zheng u64 bytenr, u32 blocksize, 32615d4f98a2SYan Zheng struct rb_root *blocks) 32625d4f98a2SYan Zheng { 32635d4f98a2SYan Zheng struct btrfs_path *path; 32645d4f98a2SYan Zheng struct btrfs_key key; 32655d4f98a2SYan Zheng int ret; 32665d4f98a2SYan Zheng 32675d4f98a2SYan Zheng if (tree_block_processed(bytenr, blocksize, rc)) 32685d4f98a2SYan Zheng return 0; 32695d4f98a2SYan Zheng 32705d4f98a2SYan Zheng if (tree_search(blocks, bytenr)) 32715d4f98a2SYan Zheng return 0; 32725d4f98a2SYan Zheng 32735d4f98a2SYan Zheng path = btrfs_alloc_path(); 32745d4f98a2SYan Zheng if (!path) 32755d4f98a2SYan Zheng return -ENOMEM; 32765d4f98a2SYan Zheng 32775d4f98a2SYan Zheng key.objectid = bytenr; 32785d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 32795d4f98a2SYan Zheng key.offset = blocksize; 32805d4f98a2SYan Zheng 32815d4f98a2SYan Zheng path->search_commit_root = 1; 32825d4f98a2SYan Zheng path->skip_locking = 1; 32835d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0); 32845d4f98a2SYan Zheng if (ret < 0) 32855d4f98a2SYan Zheng goto out; 32865d4f98a2SYan Zheng 32875d4f98a2SYan Zheng btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 32883173a18fSJosef Bacik if (ret > 0) { 32893173a18fSJosef Bacik if (key.objectid == bytenr && 32903173a18fSJosef Bacik key.type == BTRFS_METADATA_ITEM_KEY) 32913173a18fSJosef Bacik ret = 0; 32923173a18fSJosef Bacik } 32933173a18fSJosef Bacik BUG_ON(ret); 32943173a18fSJosef Bacik 32955d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, blocks); 32965d4f98a2SYan Zheng out: 32975d4f98a2SYan Zheng btrfs_free_path(path); 32985d4f98a2SYan Zheng return ret; 32995d4f98a2SYan Zheng } 33005d4f98a2SYan Zheng 33015d4f98a2SYan Zheng /* 33025d4f98a2SYan Zheng * helper to check if the block use full backrefs for pointers in it 33035d4f98a2SYan Zheng */ 33045d4f98a2SYan Zheng static int block_use_full_backref(struct reloc_control *rc, 33055d4f98a2SYan Zheng struct extent_buffer *eb) 33065d4f98a2SYan Zheng { 33075d4f98a2SYan Zheng u64 flags; 33085d4f98a2SYan Zheng int ret; 33095d4f98a2SYan Zheng 33105d4f98a2SYan Zheng if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) || 33115d4f98a2SYan Zheng btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV) 33125d4f98a2SYan Zheng return 1; 33135d4f98a2SYan Zheng 33143fd0a558SYan, Zheng ret = btrfs_lookup_extent_info(NULL, rc->extent_root, 33153173a18fSJosef Bacik eb->start, btrfs_header_level(eb), 1, 33163173a18fSJosef Bacik NULL, &flags); 33175d4f98a2SYan Zheng BUG_ON(ret); 33185d4f98a2SYan Zheng 33195d4f98a2SYan Zheng if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) 33205d4f98a2SYan Zheng ret = 1; 33215d4f98a2SYan Zheng else 33225d4f98a2SYan Zheng ret = 0; 33235d4f98a2SYan Zheng return ret; 33245d4f98a2SYan Zheng } 33255d4f98a2SYan Zheng 33260af3d00bSJosef Bacik static int delete_block_group_cache(struct btrfs_fs_info *fs_info, 33270af3d00bSJosef Bacik struct inode *inode, u64 ino) 33280af3d00bSJosef Bacik { 33290af3d00bSJosef Bacik struct btrfs_key key; 33300af3d00bSJosef Bacik struct btrfs_path *path; 33310af3d00bSJosef Bacik struct btrfs_root *root = fs_info->tree_root; 33320af3d00bSJosef Bacik struct btrfs_trans_handle *trans; 33330af3d00bSJosef Bacik int ret = 0; 33340af3d00bSJosef Bacik 33350af3d00bSJosef Bacik if (inode) 33360af3d00bSJosef Bacik goto truncate; 33370af3d00bSJosef Bacik 33380af3d00bSJosef Bacik key.objectid = ino; 33390af3d00bSJosef Bacik key.type = BTRFS_INODE_ITEM_KEY; 33400af3d00bSJosef Bacik key.offset = 0; 33410af3d00bSJosef Bacik 33420af3d00bSJosef Bacik inode = btrfs_iget(fs_info->sb, &key, root, NULL); 3343f54fb859STsutomu Itoh if (IS_ERR(inode) || is_bad_inode(inode)) { 3344f54fb859STsutomu Itoh if (!IS_ERR(inode)) 33450af3d00bSJosef Bacik iput(inode); 33460af3d00bSJosef Bacik return -ENOENT; 33470af3d00bSJosef Bacik } 33480af3d00bSJosef Bacik 33490af3d00bSJosef Bacik truncate: 33500af3d00bSJosef Bacik path = btrfs_alloc_path(); 33510af3d00bSJosef Bacik if (!path) { 33520af3d00bSJosef Bacik ret = -ENOMEM; 33530af3d00bSJosef Bacik goto out; 33540af3d00bSJosef Bacik } 33550af3d00bSJosef Bacik 33567a7eaa40SJosef Bacik trans = btrfs_join_transaction(root); 33570af3d00bSJosef Bacik if (IS_ERR(trans)) { 33580af3d00bSJosef Bacik btrfs_free_path(path); 33593612b495STsutomu Itoh ret = PTR_ERR(trans); 33600af3d00bSJosef Bacik goto out; 33610af3d00bSJosef Bacik } 33620af3d00bSJosef Bacik 33630af3d00bSJosef Bacik ret = btrfs_truncate_free_space_cache(root, trans, path, inode); 33640af3d00bSJosef Bacik 33650af3d00bSJosef Bacik btrfs_free_path(path); 33660af3d00bSJosef Bacik btrfs_end_transaction(trans, root); 3367b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 33680af3d00bSJosef Bacik out: 33690af3d00bSJosef Bacik iput(inode); 33700af3d00bSJosef Bacik return ret; 33710af3d00bSJosef Bacik } 33720af3d00bSJosef Bacik 33735d4f98a2SYan Zheng /* 33745d4f98a2SYan Zheng * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY 33755d4f98a2SYan Zheng * this function scans fs tree to find blocks reference the data extent 33765d4f98a2SYan Zheng */ 33775d4f98a2SYan Zheng static int find_data_references(struct reloc_control *rc, 33785d4f98a2SYan Zheng struct btrfs_key *extent_key, 33795d4f98a2SYan Zheng struct extent_buffer *leaf, 33805d4f98a2SYan Zheng struct btrfs_extent_data_ref *ref, 33815d4f98a2SYan Zheng struct rb_root *blocks) 33825d4f98a2SYan Zheng { 33835d4f98a2SYan Zheng struct btrfs_path *path; 33845d4f98a2SYan Zheng struct tree_block *block; 33855d4f98a2SYan Zheng struct btrfs_root *root; 33865d4f98a2SYan Zheng struct btrfs_file_extent_item *fi; 33875d4f98a2SYan Zheng struct rb_node *rb_node; 33885d4f98a2SYan Zheng struct btrfs_key key; 33895d4f98a2SYan Zheng u64 ref_root; 33905d4f98a2SYan Zheng u64 ref_objectid; 33915d4f98a2SYan Zheng u64 ref_offset; 33925d4f98a2SYan Zheng u32 ref_count; 33935d4f98a2SYan Zheng u32 nritems; 33945d4f98a2SYan Zheng int err = 0; 33955d4f98a2SYan Zheng int added = 0; 33965d4f98a2SYan Zheng int counted; 33975d4f98a2SYan Zheng int ret; 33985d4f98a2SYan Zheng 33995d4f98a2SYan Zheng ref_root = btrfs_extent_data_ref_root(leaf, ref); 34005d4f98a2SYan Zheng ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref); 34015d4f98a2SYan Zheng ref_offset = btrfs_extent_data_ref_offset(leaf, ref); 34025d4f98a2SYan Zheng ref_count = btrfs_extent_data_ref_count(leaf, ref); 34035d4f98a2SYan Zheng 34040af3d00bSJosef Bacik /* 34050af3d00bSJosef Bacik * This is an extent belonging to the free space cache, lets just delete 34060af3d00bSJosef Bacik * it and redo the search. 34070af3d00bSJosef Bacik */ 34080af3d00bSJosef Bacik if (ref_root == BTRFS_ROOT_TREE_OBJECTID) { 34090af3d00bSJosef Bacik ret = delete_block_group_cache(rc->extent_root->fs_info, 34100af3d00bSJosef Bacik NULL, ref_objectid); 34110af3d00bSJosef Bacik if (ret != -ENOENT) 34120af3d00bSJosef Bacik return ret; 34130af3d00bSJosef Bacik ret = 0; 34140af3d00bSJosef Bacik } 34150af3d00bSJosef Bacik 34160af3d00bSJosef Bacik path = btrfs_alloc_path(); 34170af3d00bSJosef Bacik if (!path) 34180af3d00bSJosef Bacik return -ENOMEM; 3419026fd317SJosef Bacik path->reada = 1; 34200af3d00bSJosef Bacik 34215d4f98a2SYan Zheng root = read_fs_root(rc->extent_root->fs_info, ref_root); 34225d4f98a2SYan Zheng if (IS_ERR(root)) { 34235d4f98a2SYan Zheng err = PTR_ERR(root); 34245d4f98a2SYan Zheng goto out; 34255d4f98a2SYan Zheng } 34265d4f98a2SYan Zheng 34275d4f98a2SYan Zheng key.objectid = ref_objectid; 34285d4f98a2SYan Zheng key.type = BTRFS_EXTENT_DATA_KEY; 342984850e8dSYan, Zheng if (ref_offset > ((u64)-1 << 32)) 343084850e8dSYan, Zheng key.offset = 0; 343184850e8dSYan, Zheng else 343284850e8dSYan, Zheng key.offset = ref_offset; 34335d4f98a2SYan Zheng 34345d4f98a2SYan Zheng path->search_commit_root = 1; 34355d4f98a2SYan Zheng path->skip_locking = 1; 34365d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 34375d4f98a2SYan Zheng if (ret < 0) { 34385d4f98a2SYan Zheng err = ret; 34395d4f98a2SYan Zheng goto out; 34405d4f98a2SYan Zheng } 34415d4f98a2SYan Zheng 34425d4f98a2SYan Zheng leaf = path->nodes[0]; 34435d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 34445d4f98a2SYan Zheng /* 34455d4f98a2SYan Zheng * the references in tree blocks that use full backrefs 34465d4f98a2SYan Zheng * are not counted in 34475d4f98a2SYan Zheng */ 34485d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 34495d4f98a2SYan Zheng counted = 0; 34505d4f98a2SYan Zheng else 34515d4f98a2SYan Zheng counted = 1; 34525d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 34535d4f98a2SYan Zheng if (rb_node) { 34545d4f98a2SYan Zheng if (counted) 34555d4f98a2SYan Zheng added = 1; 34565d4f98a2SYan Zheng else 34575d4f98a2SYan Zheng path->slots[0] = nritems; 34585d4f98a2SYan Zheng } 34595d4f98a2SYan Zheng 34605d4f98a2SYan Zheng while (ref_count > 0) { 34615d4f98a2SYan Zheng while (path->slots[0] >= nritems) { 34625d4f98a2SYan Zheng ret = btrfs_next_leaf(root, path); 34635d4f98a2SYan Zheng if (ret < 0) { 34645d4f98a2SYan Zheng err = ret; 34655d4f98a2SYan Zheng goto out; 34665d4f98a2SYan Zheng } 34675d4f98a2SYan Zheng if (ret > 0) { 34685d4f98a2SYan Zheng WARN_ON(1); 34695d4f98a2SYan Zheng goto out; 34705d4f98a2SYan Zheng } 34715d4f98a2SYan Zheng 34725d4f98a2SYan Zheng leaf = path->nodes[0]; 34735d4f98a2SYan Zheng nritems = btrfs_header_nritems(leaf); 34745d4f98a2SYan Zheng added = 0; 34755d4f98a2SYan Zheng 34765d4f98a2SYan Zheng if (block_use_full_backref(rc, leaf)) 34775d4f98a2SYan Zheng counted = 0; 34785d4f98a2SYan Zheng else 34795d4f98a2SYan Zheng counted = 1; 34805d4f98a2SYan Zheng rb_node = tree_search(blocks, leaf->start); 34815d4f98a2SYan Zheng if (rb_node) { 34825d4f98a2SYan Zheng if (counted) 34835d4f98a2SYan Zheng added = 1; 34845d4f98a2SYan Zheng else 34855d4f98a2SYan Zheng path->slots[0] = nritems; 34865d4f98a2SYan Zheng } 34875d4f98a2SYan Zheng } 34885d4f98a2SYan Zheng 34895d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 34905d4f98a2SYan Zheng if (key.objectid != ref_objectid || 34915d4f98a2SYan Zheng key.type != BTRFS_EXTENT_DATA_KEY) { 34925d4f98a2SYan Zheng WARN_ON(1); 34935d4f98a2SYan Zheng break; 34945d4f98a2SYan Zheng } 34955d4f98a2SYan Zheng 34965d4f98a2SYan Zheng fi = btrfs_item_ptr(leaf, path->slots[0], 34975d4f98a2SYan Zheng struct btrfs_file_extent_item); 34985d4f98a2SYan Zheng 34995d4f98a2SYan Zheng if (btrfs_file_extent_type(leaf, fi) == 35005d4f98a2SYan Zheng BTRFS_FILE_EXTENT_INLINE) 35015d4f98a2SYan Zheng goto next; 35025d4f98a2SYan Zheng 35035d4f98a2SYan Zheng if (btrfs_file_extent_disk_bytenr(leaf, fi) != 35045d4f98a2SYan Zheng extent_key->objectid) 35055d4f98a2SYan Zheng goto next; 35065d4f98a2SYan Zheng 35075d4f98a2SYan Zheng key.offset -= btrfs_file_extent_offset(leaf, fi); 35085d4f98a2SYan Zheng if (key.offset != ref_offset) 35095d4f98a2SYan Zheng goto next; 35105d4f98a2SYan Zheng 35115d4f98a2SYan Zheng if (counted) 35125d4f98a2SYan Zheng ref_count--; 35135d4f98a2SYan Zheng if (added) 35145d4f98a2SYan Zheng goto next; 35155d4f98a2SYan Zheng 35165d4f98a2SYan Zheng if (!tree_block_processed(leaf->start, leaf->len, rc)) { 35175d4f98a2SYan Zheng block = kmalloc(sizeof(*block), GFP_NOFS); 35185d4f98a2SYan Zheng if (!block) { 35195d4f98a2SYan Zheng err = -ENOMEM; 35205d4f98a2SYan Zheng break; 35215d4f98a2SYan Zheng } 35225d4f98a2SYan Zheng block->bytenr = leaf->start; 35235d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &block->key, 0); 35245d4f98a2SYan Zheng block->level = 0; 35255d4f98a2SYan Zheng block->key_ready = 1; 35265d4f98a2SYan Zheng rb_node = tree_insert(blocks, block->bytenr, 35275d4f98a2SYan Zheng &block->rb_node); 352843c04fb1SJeff Mahoney if (rb_node) 352943c04fb1SJeff Mahoney backref_tree_panic(rb_node, -EEXIST, 353043c04fb1SJeff Mahoney block->bytenr); 35315d4f98a2SYan Zheng } 35325d4f98a2SYan Zheng if (counted) 35335d4f98a2SYan Zheng added = 1; 35345d4f98a2SYan Zheng else 35355d4f98a2SYan Zheng path->slots[0] = nritems; 35365d4f98a2SYan Zheng next: 35375d4f98a2SYan Zheng path->slots[0]++; 35385d4f98a2SYan Zheng 35395d4f98a2SYan Zheng } 35405d4f98a2SYan Zheng out: 35415d4f98a2SYan Zheng btrfs_free_path(path); 35425d4f98a2SYan Zheng return err; 35435d4f98a2SYan Zheng } 35445d4f98a2SYan Zheng 35455d4f98a2SYan Zheng /* 35462c016dc2SLiu Bo * helper to find all tree blocks that reference a given data extent 35475d4f98a2SYan Zheng */ 35485d4f98a2SYan Zheng static noinline_for_stack 35495d4f98a2SYan Zheng int add_data_references(struct reloc_control *rc, 35505d4f98a2SYan Zheng struct btrfs_key *extent_key, 35515d4f98a2SYan Zheng struct btrfs_path *path, 35525d4f98a2SYan Zheng struct rb_root *blocks) 35535d4f98a2SYan Zheng { 35545d4f98a2SYan Zheng struct btrfs_key key; 35555d4f98a2SYan Zheng struct extent_buffer *eb; 35565d4f98a2SYan Zheng struct btrfs_extent_data_ref *dref; 35575d4f98a2SYan Zheng struct btrfs_extent_inline_ref *iref; 35585d4f98a2SYan Zheng unsigned long ptr; 35595d4f98a2SYan Zheng unsigned long end; 35603fd0a558SYan, Zheng u32 blocksize = btrfs_level_size(rc->extent_root, 0); 35615d4f98a2SYan Zheng int ret; 35625d4f98a2SYan Zheng int err = 0; 35635d4f98a2SYan Zheng 35645d4f98a2SYan Zheng eb = path->nodes[0]; 35655d4f98a2SYan Zheng ptr = btrfs_item_ptr_offset(eb, path->slots[0]); 35665d4f98a2SYan Zheng end = ptr + btrfs_item_size_nr(eb, path->slots[0]); 35675d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 35685d4f98a2SYan Zheng if (ptr + sizeof(struct btrfs_extent_item_v0) == end) 35695d4f98a2SYan Zheng ptr = end; 35705d4f98a2SYan Zheng else 35715d4f98a2SYan Zheng #endif 35725d4f98a2SYan Zheng ptr += sizeof(struct btrfs_extent_item); 35735d4f98a2SYan Zheng 35745d4f98a2SYan Zheng while (ptr < end) { 35755d4f98a2SYan Zheng iref = (struct btrfs_extent_inline_ref *)ptr; 35765d4f98a2SYan Zheng key.type = btrfs_extent_inline_ref_type(eb, iref); 35775d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 35785d4f98a2SYan Zheng key.offset = btrfs_extent_inline_ref_offset(eb, iref); 35795d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 35805d4f98a2SYan Zheng blocks); 35815d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 35825d4f98a2SYan Zheng dref = (struct btrfs_extent_data_ref *)(&iref->offset); 35835d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 35845d4f98a2SYan Zheng eb, dref, blocks); 35855d4f98a2SYan Zheng } else { 35865d4f98a2SYan Zheng BUG(); 35875d4f98a2SYan Zheng } 35885d4f98a2SYan Zheng ptr += btrfs_extent_inline_ref_size(key.type); 35895d4f98a2SYan Zheng } 35905d4f98a2SYan Zheng WARN_ON(ptr > end); 35915d4f98a2SYan Zheng 35925d4f98a2SYan Zheng while (1) { 35935d4f98a2SYan Zheng cond_resched(); 35945d4f98a2SYan Zheng eb = path->nodes[0]; 35955d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(eb)) { 35965d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 35975d4f98a2SYan Zheng if (ret < 0) { 35985d4f98a2SYan Zheng err = ret; 35995d4f98a2SYan Zheng break; 36005d4f98a2SYan Zheng } 36015d4f98a2SYan Zheng if (ret > 0) 36025d4f98a2SYan Zheng break; 36035d4f98a2SYan Zheng eb = path->nodes[0]; 36045d4f98a2SYan Zheng } 36055d4f98a2SYan Zheng 36065d4f98a2SYan Zheng btrfs_item_key_to_cpu(eb, &key, path->slots[0]); 36075d4f98a2SYan Zheng if (key.objectid != extent_key->objectid) 36085d4f98a2SYan Zheng break; 36095d4f98a2SYan Zheng 36105d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 36115d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY || 36125d4f98a2SYan Zheng key.type == BTRFS_EXTENT_REF_V0_KEY) { 36135d4f98a2SYan Zheng #else 36145d4f98a2SYan Zheng BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY); 36155d4f98a2SYan Zheng if (key.type == BTRFS_SHARED_DATA_REF_KEY) { 36165d4f98a2SYan Zheng #endif 36175d4f98a2SYan Zheng ret = __add_tree_block(rc, key.offset, blocksize, 36185d4f98a2SYan Zheng blocks); 36195d4f98a2SYan Zheng } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) { 36205d4f98a2SYan Zheng dref = btrfs_item_ptr(eb, path->slots[0], 36215d4f98a2SYan Zheng struct btrfs_extent_data_ref); 36225d4f98a2SYan Zheng ret = find_data_references(rc, extent_key, 36235d4f98a2SYan Zheng eb, dref, blocks); 36245d4f98a2SYan Zheng } else { 36255d4f98a2SYan Zheng ret = 0; 36265d4f98a2SYan Zheng } 36275d4f98a2SYan Zheng if (ret) { 36285d4f98a2SYan Zheng err = ret; 36295d4f98a2SYan Zheng break; 36305d4f98a2SYan Zheng } 36315d4f98a2SYan Zheng path->slots[0]++; 36325d4f98a2SYan Zheng } 3633b3b4aa74SDavid Sterba btrfs_release_path(path); 36345d4f98a2SYan Zheng if (err) 36355d4f98a2SYan Zheng free_block_list(blocks); 36365d4f98a2SYan Zheng return err; 36375d4f98a2SYan Zheng } 36385d4f98a2SYan Zheng 36395d4f98a2SYan Zheng /* 36402c016dc2SLiu Bo * helper to find next unprocessed extent 36415d4f98a2SYan Zheng */ 36425d4f98a2SYan Zheng static noinline_for_stack 36435d4f98a2SYan Zheng int find_next_extent(struct btrfs_trans_handle *trans, 36443fd0a558SYan, Zheng struct reloc_control *rc, struct btrfs_path *path, 36453fd0a558SYan, Zheng struct btrfs_key *extent_key) 36465d4f98a2SYan Zheng { 36475d4f98a2SYan Zheng struct btrfs_key key; 36485d4f98a2SYan Zheng struct extent_buffer *leaf; 36495d4f98a2SYan Zheng u64 start, end, last; 36505d4f98a2SYan Zheng int ret; 36515d4f98a2SYan Zheng 36525d4f98a2SYan Zheng last = rc->block_group->key.objectid + rc->block_group->key.offset; 36535d4f98a2SYan Zheng while (1) { 36545d4f98a2SYan Zheng cond_resched(); 36555d4f98a2SYan Zheng if (rc->search_start >= last) { 36565d4f98a2SYan Zheng ret = 1; 36575d4f98a2SYan Zheng break; 36585d4f98a2SYan Zheng } 36595d4f98a2SYan Zheng 36605d4f98a2SYan Zheng key.objectid = rc->search_start; 36615d4f98a2SYan Zheng key.type = BTRFS_EXTENT_ITEM_KEY; 36625d4f98a2SYan Zheng key.offset = 0; 36635d4f98a2SYan Zheng 36645d4f98a2SYan Zheng path->search_commit_root = 1; 36655d4f98a2SYan Zheng path->skip_locking = 1; 36665d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 36675d4f98a2SYan Zheng 0, 0); 36685d4f98a2SYan Zheng if (ret < 0) 36695d4f98a2SYan Zheng break; 36705d4f98a2SYan Zheng next: 36715d4f98a2SYan Zheng leaf = path->nodes[0]; 36725d4f98a2SYan Zheng if (path->slots[0] >= btrfs_header_nritems(leaf)) { 36735d4f98a2SYan Zheng ret = btrfs_next_leaf(rc->extent_root, path); 36745d4f98a2SYan Zheng if (ret != 0) 36755d4f98a2SYan Zheng break; 36765d4f98a2SYan Zheng leaf = path->nodes[0]; 36775d4f98a2SYan Zheng } 36785d4f98a2SYan Zheng 36795d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 36805d4f98a2SYan Zheng if (key.objectid >= last) { 36815d4f98a2SYan Zheng ret = 1; 36825d4f98a2SYan Zheng break; 36835d4f98a2SYan Zheng } 36845d4f98a2SYan Zheng 36853173a18fSJosef Bacik if (key.type != BTRFS_EXTENT_ITEM_KEY && 36863173a18fSJosef Bacik key.type != BTRFS_METADATA_ITEM_KEY) { 36873173a18fSJosef Bacik path->slots[0]++; 36883173a18fSJosef Bacik goto next; 36893173a18fSJosef Bacik } 36903173a18fSJosef Bacik 36913173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY && 36925d4f98a2SYan Zheng key.objectid + key.offset <= rc->search_start) { 36935d4f98a2SYan Zheng path->slots[0]++; 36945d4f98a2SYan Zheng goto next; 36955d4f98a2SYan Zheng } 36965d4f98a2SYan Zheng 36973173a18fSJosef Bacik if (key.type == BTRFS_METADATA_ITEM_KEY && 36983173a18fSJosef Bacik key.objectid + rc->extent_root->leafsize <= 36993173a18fSJosef Bacik rc->search_start) { 37003173a18fSJosef Bacik path->slots[0]++; 37013173a18fSJosef Bacik goto next; 37023173a18fSJosef Bacik } 37033173a18fSJosef Bacik 37045d4f98a2SYan Zheng ret = find_first_extent_bit(&rc->processed_blocks, 37055d4f98a2SYan Zheng key.objectid, &start, &end, 3706e6138876SJosef Bacik EXTENT_DIRTY, NULL); 37075d4f98a2SYan Zheng 37085d4f98a2SYan Zheng if (ret == 0 && start <= key.objectid) { 3709b3b4aa74SDavid Sterba btrfs_release_path(path); 37105d4f98a2SYan Zheng rc->search_start = end + 1; 37115d4f98a2SYan Zheng } else { 37123173a18fSJosef Bacik if (key.type == BTRFS_EXTENT_ITEM_KEY) 37135d4f98a2SYan Zheng rc->search_start = key.objectid + key.offset; 37143173a18fSJosef Bacik else 37153173a18fSJosef Bacik rc->search_start = key.objectid + 37163173a18fSJosef Bacik rc->extent_root->leafsize; 37173fd0a558SYan, Zheng memcpy(extent_key, &key, sizeof(key)); 37185d4f98a2SYan Zheng return 0; 37195d4f98a2SYan Zheng } 37205d4f98a2SYan Zheng } 3721b3b4aa74SDavid Sterba btrfs_release_path(path); 37225d4f98a2SYan Zheng return ret; 37235d4f98a2SYan Zheng } 37245d4f98a2SYan Zheng 37255d4f98a2SYan Zheng static void set_reloc_control(struct reloc_control *rc) 37265d4f98a2SYan Zheng { 37275d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 37287585717fSChris Mason 37297585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 37305d4f98a2SYan Zheng fs_info->reloc_ctl = rc; 37317585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 37325d4f98a2SYan Zheng } 37335d4f98a2SYan Zheng 37345d4f98a2SYan Zheng static void unset_reloc_control(struct reloc_control *rc) 37355d4f98a2SYan Zheng { 37365d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = rc->extent_root->fs_info; 37377585717fSChris Mason 37387585717fSChris Mason mutex_lock(&fs_info->reloc_mutex); 37395d4f98a2SYan Zheng fs_info->reloc_ctl = NULL; 37407585717fSChris Mason mutex_unlock(&fs_info->reloc_mutex); 37415d4f98a2SYan Zheng } 37425d4f98a2SYan Zheng 37435d4f98a2SYan Zheng static int check_extent_flags(u64 flags) 37445d4f98a2SYan Zheng { 37455d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 37465d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 37475d4f98a2SYan Zheng return 1; 37485d4f98a2SYan Zheng if (!(flags & BTRFS_EXTENT_FLAG_DATA) && 37495d4f98a2SYan Zheng !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) 37505d4f98a2SYan Zheng return 1; 37515d4f98a2SYan Zheng if ((flags & BTRFS_EXTENT_FLAG_DATA) && 37525d4f98a2SYan Zheng (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) 37535d4f98a2SYan Zheng return 1; 37545d4f98a2SYan Zheng return 0; 37555d4f98a2SYan Zheng } 37565d4f98a2SYan Zheng 37573fd0a558SYan, Zheng static noinline_for_stack 37583fd0a558SYan, Zheng int prepare_to_relocate(struct reloc_control *rc) 37593fd0a558SYan, Zheng { 37603fd0a558SYan, Zheng struct btrfs_trans_handle *trans; 37613fd0a558SYan, Zheng int ret; 37623fd0a558SYan, Zheng 376366d8f3ddSMiao Xie rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root, 376466d8f3ddSMiao Xie BTRFS_BLOCK_RSV_TEMP); 37653fd0a558SYan, Zheng if (!rc->block_rsv) 37663fd0a558SYan, Zheng return -ENOMEM; 37673fd0a558SYan, Zheng 37683fd0a558SYan, Zheng /* 37693fd0a558SYan, Zheng * reserve some space for creating reloc trees. 37703fd0a558SYan, Zheng * btrfs_init_reloc_root will use them when there 37713fd0a558SYan, Zheng * is no reservation in transaction handle. 37723fd0a558SYan, Zheng */ 37734a92b1b8SJosef Bacik ret = btrfs_block_rsv_add(rc->extent_root, rc->block_rsv, 377408e007d2SMiao Xie rc->extent_root->nodesize * 256, 377508e007d2SMiao Xie BTRFS_RESERVE_FLUSH_ALL); 37763fd0a558SYan, Zheng if (ret) 37773fd0a558SYan, Zheng return ret; 37783fd0a558SYan, Zheng 37793fd0a558SYan, Zheng memset(&rc->cluster, 0, sizeof(rc->cluster)); 37803fd0a558SYan, Zheng rc->search_start = rc->block_group->key.objectid; 37813fd0a558SYan, Zheng rc->extents_found = 0; 37823fd0a558SYan, Zheng rc->nodes_relocated = 0; 37833fd0a558SYan, Zheng rc->merging_rsv_size = 0; 37843fd0a558SYan, Zheng 37853fd0a558SYan, Zheng rc->create_reloc_tree = 1; 37863fd0a558SYan, Zheng set_reloc_control(rc); 37873fd0a558SYan, Zheng 37887a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 378928818947SLiu Bo if (IS_ERR(trans)) { 379028818947SLiu Bo unset_reloc_control(rc); 379128818947SLiu Bo /* 379228818947SLiu Bo * extent tree is not a ref_cow tree and has no reloc_root to 379328818947SLiu Bo * cleanup. And callers are responsible to free the above 379428818947SLiu Bo * block rsv. 379528818947SLiu Bo */ 379628818947SLiu Bo return PTR_ERR(trans); 379728818947SLiu Bo } 37983fd0a558SYan, Zheng btrfs_commit_transaction(trans, rc->extent_root); 37993fd0a558SYan, Zheng return 0; 38003fd0a558SYan, Zheng } 380176dda93cSYan, Zheng 38025d4f98a2SYan Zheng static noinline_for_stack int relocate_block_group(struct reloc_control *rc) 38035d4f98a2SYan Zheng { 38045d4f98a2SYan Zheng struct rb_root blocks = RB_ROOT; 38055d4f98a2SYan Zheng struct btrfs_key key; 38065d4f98a2SYan Zheng struct btrfs_trans_handle *trans = NULL; 38075d4f98a2SYan Zheng struct btrfs_path *path; 38085d4f98a2SYan Zheng struct btrfs_extent_item *ei; 38095d4f98a2SYan Zheng u64 flags; 38105d4f98a2SYan Zheng u32 item_size; 38115d4f98a2SYan Zheng int ret; 38125d4f98a2SYan Zheng int err = 0; 3813c87f08caSChris Mason int progress = 0; 38145d4f98a2SYan Zheng 38155d4f98a2SYan Zheng path = btrfs_alloc_path(); 38163fd0a558SYan, Zheng if (!path) 38175d4f98a2SYan Zheng return -ENOMEM; 3818026fd317SJosef Bacik path->reada = 1; 38193fd0a558SYan, Zheng 38203fd0a558SYan, Zheng ret = prepare_to_relocate(rc); 38213fd0a558SYan, Zheng if (ret) { 38223fd0a558SYan, Zheng err = ret; 38233fd0a558SYan, Zheng goto out_free; 38242423fdfbSJiri Slaby } 38255d4f98a2SYan Zheng 38265d4f98a2SYan Zheng while (1) { 3827c87f08caSChris Mason progress++; 3828a22285a6SYan, Zheng trans = btrfs_start_transaction(rc->extent_root, 0); 38290f788c58SLiu Bo if (IS_ERR(trans)) { 38300f788c58SLiu Bo err = PTR_ERR(trans); 38310f788c58SLiu Bo trans = NULL; 38320f788c58SLiu Bo break; 38330f788c58SLiu Bo } 3834c87f08caSChris Mason restart: 38353fd0a558SYan, Zheng if (update_backref_cache(trans, &rc->backref_cache)) { 38363fd0a558SYan, Zheng btrfs_end_transaction(trans, rc->extent_root); 38373fd0a558SYan, Zheng continue; 38383fd0a558SYan, Zheng } 38393fd0a558SYan, Zheng 38403fd0a558SYan, Zheng ret = find_next_extent(trans, rc, path, &key); 38415d4f98a2SYan Zheng if (ret < 0) 38425d4f98a2SYan Zheng err = ret; 38435d4f98a2SYan Zheng if (ret != 0) 38445d4f98a2SYan Zheng break; 38455d4f98a2SYan Zheng 38465d4f98a2SYan Zheng rc->extents_found++; 38475d4f98a2SYan Zheng 38485d4f98a2SYan Zheng ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 38495d4f98a2SYan Zheng struct btrfs_extent_item); 38503fd0a558SYan, Zheng item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]); 38515d4f98a2SYan Zheng if (item_size >= sizeof(*ei)) { 38525d4f98a2SYan Zheng flags = btrfs_extent_flags(path->nodes[0], ei); 38535d4f98a2SYan Zheng ret = check_extent_flags(flags); 38545d4f98a2SYan Zheng BUG_ON(ret); 38555d4f98a2SYan Zheng 38565d4f98a2SYan Zheng } else { 38575d4f98a2SYan Zheng #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 38585d4f98a2SYan Zheng u64 ref_owner; 38595d4f98a2SYan Zheng int path_change = 0; 38605d4f98a2SYan Zheng 38615d4f98a2SYan Zheng BUG_ON(item_size != 38625d4f98a2SYan Zheng sizeof(struct btrfs_extent_item_v0)); 38635d4f98a2SYan Zheng ret = get_ref_objectid_v0(rc, path, &key, &ref_owner, 38645d4f98a2SYan Zheng &path_change); 38655d4f98a2SYan Zheng if (ref_owner < BTRFS_FIRST_FREE_OBJECTID) 38665d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_TREE_BLOCK; 38675d4f98a2SYan Zheng else 38685d4f98a2SYan Zheng flags = BTRFS_EXTENT_FLAG_DATA; 38695d4f98a2SYan Zheng 38705d4f98a2SYan Zheng if (path_change) { 3871b3b4aa74SDavid Sterba btrfs_release_path(path); 38725d4f98a2SYan Zheng 38735d4f98a2SYan Zheng path->search_commit_root = 1; 38745d4f98a2SYan Zheng path->skip_locking = 1; 38755d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, rc->extent_root, 38765d4f98a2SYan Zheng &key, path, 0, 0); 38775d4f98a2SYan Zheng if (ret < 0) { 38785d4f98a2SYan Zheng err = ret; 38795d4f98a2SYan Zheng break; 38805d4f98a2SYan Zheng } 38815d4f98a2SYan Zheng BUG_ON(ret > 0); 38825d4f98a2SYan Zheng } 38835d4f98a2SYan Zheng #else 38845d4f98a2SYan Zheng BUG(); 38855d4f98a2SYan Zheng #endif 38865d4f98a2SYan Zheng } 38875d4f98a2SYan Zheng 38885d4f98a2SYan Zheng if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { 38895d4f98a2SYan Zheng ret = add_tree_block(rc, &key, path, &blocks); 38905d4f98a2SYan Zheng } else if (rc->stage == UPDATE_DATA_PTRS && 38915d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 38925d4f98a2SYan Zheng ret = add_data_references(rc, &key, path, &blocks); 38935d4f98a2SYan Zheng } else { 3894b3b4aa74SDavid Sterba btrfs_release_path(path); 38955d4f98a2SYan Zheng ret = 0; 38965d4f98a2SYan Zheng } 38975d4f98a2SYan Zheng if (ret < 0) { 38983fd0a558SYan, Zheng err = ret; 38995d4f98a2SYan Zheng break; 39005d4f98a2SYan Zheng } 39015d4f98a2SYan Zheng 39025d4f98a2SYan Zheng if (!RB_EMPTY_ROOT(&blocks)) { 39035d4f98a2SYan Zheng ret = relocate_tree_blocks(trans, rc, &blocks); 39045d4f98a2SYan Zheng if (ret < 0) { 39053fd0a558SYan, Zheng if (ret != -EAGAIN) { 39065d4f98a2SYan Zheng err = ret; 39075d4f98a2SYan Zheng break; 39085d4f98a2SYan Zheng } 39093fd0a558SYan, Zheng rc->extents_found--; 39103fd0a558SYan, Zheng rc->search_start = key.objectid; 39113fd0a558SYan, Zheng } 39125d4f98a2SYan Zheng } 39135d4f98a2SYan Zheng 391436ba022aSJosef Bacik ret = btrfs_block_rsv_check(rc->extent_root, rc->block_rsv, 5); 39153fd0a558SYan, Zheng if (ret < 0) { 39167654b724SDaniel J Blueman if (ret != -ENOSPC) { 39173fd0a558SYan, Zheng err = ret; 39183fd0a558SYan, Zheng WARN_ON(1); 39193fd0a558SYan, Zheng break; 39203fd0a558SYan, Zheng } 39213fd0a558SYan, Zheng rc->commit_transaction = 1; 39223fd0a558SYan, Zheng } 39233fd0a558SYan, Zheng 39243fd0a558SYan, Zheng if (rc->commit_transaction) { 39253fd0a558SYan, Zheng rc->commit_transaction = 0; 39263fd0a558SYan, Zheng ret = btrfs_commit_transaction(trans, rc->extent_root); 39273fd0a558SYan, Zheng BUG_ON(ret); 39283fd0a558SYan, Zheng } else { 39293fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, rc->extent_root); 3930b53d3f5dSLiu Bo btrfs_btree_balance_dirty(rc->extent_root); 39313fd0a558SYan, Zheng } 39323fd0a558SYan, Zheng trans = NULL; 39335d4f98a2SYan Zheng 39345d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && 39355d4f98a2SYan Zheng (flags & BTRFS_EXTENT_FLAG_DATA)) { 39365d4f98a2SYan Zheng rc->found_file_extent = 1; 39370257bb82SYan, Zheng ret = relocate_data_extent(rc->data_inode, 39383fd0a558SYan, Zheng &key, &rc->cluster); 39395d4f98a2SYan Zheng if (ret < 0) { 39405d4f98a2SYan Zheng err = ret; 39415d4f98a2SYan Zheng break; 39425d4f98a2SYan Zheng } 39435d4f98a2SYan Zheng } 39445d4f98a2SYan Zheng } 3945c87f08caSChris Mason if (trans && progress && err == -ENOSPC) { 3946c87f08caSChris Mason ret = btrfs_force_chunk_alloc(trans, rc->extent_root, 3947c87f08caSChris Mason rc->block_group->flags); 3948c87f08caSChris Mason if (ret == 0) { 3949c87f08caSChris Mason err = 0; 3950c87f08caSChris Mason progress = 0; 3951c87f08caSChris Mason goto restart; 3952c87f08caSChris Mason } 3953c87f08caSChris Mason } 39543fd0a558SYan, Zheng 3955b3b4aa74SDavid Sterba btrfs_release_path(path); 39563fd0a558SYan, Zheng clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY, 39573fd0a558SYan, Zheng GFP_NOFS); 39585d4f98a2SYan Zheng 39595d4f98a2SYan Zheng if (trans) { 39603fd0a558SYan, Zheng btrfs_end_transaction_throttle(trans, rc->extent_root); 3961b53d3f5dSLiu Bo btrfs_btree_balance_dirty(rc->extent_root); 39625d4f98a2SYan Zheng } 39635d4f98a2SYan Zheng 39640257bb82SYan, Zheng if (!err) { 39653fd0a558SYan, Zheng ret = relocate_file_extent_cluster(rc->data_inode, 39663fd0a558SYan, Zheng &rc->cluster); 39670257bb82SYan, Zheng if (ret < 0) 39680257bb82SYan, Zheng err = ret; 39690257bb82SYan, Zheng } 39700257bb82SYan, Zheng 39713fd0a558SYan, Zheng rc->create_reloc_tree = 0; 39723fd0a558SYan, Zheng set_reloc_control(rc); 39730257bb82SYan, Zheng 39743fd0a558SYan, Zheng backref_cache_cleanup(&rc->backref_cache); 39753fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1); 39765d4f98a2SYan Zheng 39773fd0a558SYan, Zheng err = prepare_to_merge(rc, err); 39785d4f98a2SYan Zheng 39795d4f98a2SYan Zheng merge_reloc_roots(rc); 39805d4f98a2SYan Zheng 39813fd0a558SYan, Zheng rc->merge_reloc_tree = 0; 39825d4f98a2SYan Zheng unset_reloc_control(rc); 39833fd0a558SYan, Zheng btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1); 39845d4f98a2SYan Zheng 39855d4f98a2SYan Zheng /* get rid of pinned extents */ 39867a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 39873612b495STsutomu Itoh if (IS_ERR(trans)) 39883612b495STsutomu Itoh err = PTR_ERR(trans); 39893612b495STsutomu Itoh else 39905d4f98a2SYan Zheng btrfs_commit_transaction(trans, rc->extent_root); 39913fd0a558SYan, Zheng out_free: 39923fd0a558SYan, Zheng btrfs_free_block_rsv(rc->extent_root, rc->block_rsv); 39933fd0a558SYan, Zheng btrfs_free_path(path); 39945d4f98a2SYan Zheng return err; 39955d4f98a2SYan Zheng } 39965d4f98a2SYan Zheng 39975d4f98a2SYan Zheng static int __insert_orphan_inode(struct btrfs_trans_handle *trans, 39980257bb82SYan, Zheng struct btrfs_root *root, u64 objectid) 39995d4f98a2SYan Zheng { 40005d4f98a2SYan Zheng struct btrfs_path *path; 40015d4f98a2SYan Zheng struct btrfs_inode_item *item; 40025d4f98a2SYan Zheng struct extent_buffer *leaf; 40035d4f98a2SYan Zheng int ret; 40045d4f98a2SYan Zheng 40055d4f98a2SYan Zheng path = btrfs_alloc_path(); 40065d4f98a2SYan Zheng if (!path) 40075d4f98a2SYan Zheng return -ENOMEM; 40085d4f98a2SYan Zheng 40095d4f98a2SYan Zheng ret = btrfs_insert_empty_inode(trans, root, path, objectid); 40105d4f98a2SYan Zheng if (ret) 40115d4f98a2SYan Zheng goto out; 40125d4f98a2SYan Zheng 40135d4f98a2SYan Zheng leaf = path->nodes[0]; 40145d4f98a2SYan Zheng item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item); 40155d4f98a2SYan Zheng memset_extent_buffer(leaf, 0, (unsigned long)item, sizeof(*item)); 40165d4f98a2SYan Zheng btrfs_set_inode_generation(leaf, item, 1); 40170257bb82SYan, Zheng btrfs_set_inode_size(leaf, item, 0); 40185d4f98a2SYan Zheng btrfs_set_inode_mode(leaf, item, S_IFREG | 0600); 40193fd0a558SYan, Zheng btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS | 40203fd0a558SYan, Zheng BTRFS_INODE_PREALLOC); 40215d4f98a2SYan Zheng btrfs_mark_buffer_dirty(leaf); 4022b3b4aa74SDavid Sterba btrfs_release_path(path); 40235d4f98a2SYan Zheng out: 40245d4f98a2SYan Zheng btrfs_free_path(path); 40255d4f98a2SYan Zheng return ret; 40265d4f98a2SYan Zheng } 40275d4f98a2SYan Zheng 40285d4f98a2SYan Zheng /* 40295d4f98a2SYan Zheng * helper to create inode for data relocation. 40305d4f98a2SYan Zheng * the inode is in data relocation tree and its link count is 0 40315d4f98a2SYan Zheng */ 40323fd0a558SYan, Zheng static noinline_for_stack 40333fd0a558SYan, Zheng struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info, 40345d4f98a2SYan Zheng struct btrfs_block_group_cache *group) 40355d4f98a2SYan Zheng { 40365d4f98a2SYan Zheng struct inode *inode = NULL; 40375d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 40385d4f98a2SYan Zheng struct btrfs_root *root; 40395d4f98a2SYan Zheng struct btrfs_key key; 40405d4f98a2SYan Zheng u64 objectid = BTRFS_FIRST_FREE_OBJECTID; 40415d4f98a2SYan Zheng int err = 0; 40425d4f98a2SYan Zheng 40435d4f98a2SYan Zheng root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID); 40445d4f98a2SYan Zheng if (IS_ERR(root)) 40455d4f98a2SYan Zheng return ERR_CAST(root); 40465d4f98a2SYan Zheng 4047a22285a6SYan, Zheng trans = btrfs_start_transaction(root, 6); 40483fd0a558SYan, Zheng if (IS_ERR(trans)) 40493fd0a558SYan, Zheng return ERR_CAST(trans); 40505d4f98a2SYan Zheng 4051581bb050SLi Zefan err = btrfs_find_free_objectid(root, &objectid); 40525d4f98a2SYan Zheng if (err) 40535d4f98a2SYan Zheng goto out; 40545d4f98a2SYan Zheng 40550257bb82SYan, Zheng err = __insert_orphan_inode(trans, root, objectid); 40565d4f98a2SYan Zheng BUG_ON(err); 40575d4f98a2SYan Zheng 40585d4f98a2SYan Zheng key.objectid = objectid; 40595d4f98a2SYan Zheng key.type = BTRFS_INODE_ITEM_KEY; 40605d4f98a2SYan Zheng key.offset = 0; 406173f73415SJosef Bacik inode = btrfs_iget(root->fs_info->sb, &key, root, NULL); 40625d4f98a2SYan Zheng BUG_ON(IS_ERR(inode) || is_bad_inode(inode)); 40635d4f98a2SYan Zheng BTRFS_I(inode)->index_cnt = group->key.objectid; 40645d4f98a2SYan Zheng 40655d4f98a2SYan Zheng err = btrfs_orphan_add(trans, inode); 40665d4f98a2SYan Zheng out: 40675d4f98a2SYan Zheng btrfs_end_transaction(trans, root); 4068b53d3f5dSLiu Bo btrfs_btree_balance_dirty(root); 40695d4f98a2SYan Zheng if (err) { 40705d4f98a2SYan Zheng if (inode) 40715d4f98a2SYan Zheng iput(inode); 40725d4f98a2SYan Zheng inode = ERR_PTR(err); 40735d4f98a2SYan Zheng } 40745d4f98a2SYan Zheng return inode; 40755d4f98a2SYan Zheng } 40765d4f98a2SYan Zheng 40773fd0a558SYan, Zheng static struct reloc_control *alloc_reloc_control(void) 40783fd0a558SYan, Zheng { 40793fd0a558SYan, Zheng struct reloc_control *rc; 40803fd0a558SYan, Zheng 40813fd0a558SYan, Zheng rc = kzalloc(sizeof(*rc), GFP_NOFS); 40823fd0a558SYan, Zheng if (!rc) 40833fd0a558SYan, Zheng return NULL; 40843fd0a558SYan, Zheng 40853fd0a558SYan, Zheng INIT_LIST_HEAD(&rc->reloc_roots); 40863fd0a558SYan, Zheng backref_cache_init(&rc->backref_cache); 40873fd0a558SYan, Zheng mapping_tree_init(&rc->reloc_root_tree); 4088f993c883SDavid Sterba extent_io_tree_init(&rc->processed_blocks, NULL); 40893fd0a558SYan, Zheng return rc; 40903fd0a558SYan, Zheng } 40913fd0a558SYan, Zheng 40925d4f98a2SYan Zheng /* 40935d4f98a2SYan Zheng * function to relocate all extents in a block group. 40945d4f98a2SYan Zheng */ 40955d4f98a2SYan Zheng int btrfs_relocate_block_group(struct btrfs_root *extent_root, u64 group_start) 40965d4f98a2SYan Zheng { 40975d4f98a2SYan Zheng struct btrfs_fs_info *fs_info = extent_root->fs_info; 40985d4f98a2SYan Zheng struct reloc_control *rc; 40990af3d00bSJosef Bacik struct inode *inode; 41000af3d00bSJosef Bacik struct btrfs_path *path; 41015d4f98a2SYan Zheng int ret; 4102f0486c68SYan, Zheng int rw = 0; 41035d4f98a2SYan Zheng int err = 0; 41045d4f98a2SYan Zheng 41053fd0a558SYan, Zheng rc = alloc_reloc_control(); 41065d4f98a2SYan Zheng if (!rc) 41075d4f98a2SYan Zheng return -ENOMEM; 41085d4f98a2SYan Zheng 4109f0486c68SYan, Zheng rc->extent_root = extent_root; 41103fd0a558SYan, Zheng 41115d4f98a2SYan Zheng rc->block_group = btrfs_lookup_block_group(fs_info, group_start); 41125d4f98a2SYan Zheng BUG_ON(!rc->block_group); 41135d4f98a2SYan Zheng 4114f0486c68SYan, Zheng if (!rc->block_group->ro) { 4115f0486c68SYan, Zheng ret = btrfs_set_block_group_ro(extent_root, rc->block_group); 4116f0486c68SYan, Zheng if (ret) { 4117f0486c68SYan, Zheng err = ret; 4118f0486c68SYan, Zheng goto out; 4119f0486c68SYan, Zheng } 4120f0486c68SYan, Zheng rw = 1; 4121f0486c68SYan, Zheng } 4122f0486c68SYan, Zheng 41230af3d00bSJosef Bacik path = btrfs_alloc_path(); 41240af3d00bSJosef Bacik if (!path) { 41250af3d00bSJosef Bacik err = -ENOMEM; 41260af3d00bSJosef Bacik goto out; 41270af3d00bSJosef Bacik } 41280af3d00bSJosef Bacik 41290af3d00bSJosef Bacik inode = lookup_free_space_inode(fs_info->tree_root, rc->block_group, 41300af3d00bSJosef Bacik path); 41310af3d00bSJosef Bacik btrfs_free_path(path); 41320af3d00bSJosef Bacik 41330af3d00bSJosef Bacik if (!IS_ERR(inode)) 41340af3d00bSJosef Bacik ret = delete_block_group_cache(fs_info, inode, 0); 41350af3d00bSJosef Bacik else 41360af3d00bSJosef Bacik ret = PTR_ERR(inode); 41370af3d00bSJosef Bacik 41380af3d00bSJosef Bacik if (ret && ret != -ENOENT) { 41390af3d00bSJosef Bacik err = ret; 41400af3d00bSJosef Bacik goto out; 41410af3d00bSJosef Bacik } 41420af3d00bSJosef Bacik 41435d4f98a2SYan Zheng rc->data_inode = create_reloc_inode(fs_info, rc->block_group); 41445d4f98a2SYan Zheng if (IS_ERR(rc->data_inode)) { 41455d4f98a2SYan Zheng err = PTR_ERR(rc->data_inode); 41465d4f98a2SYan Zheng rc->data_inode = NULL; 41475d4f98a2SYan Zheng goto out; 41485d4f98a2SYan Zheng } 41495d4f98a2SYan Zheng 41505d4f98a2SYan Zheng printk(KERN_INFO "btrfs: relocating block group %llu flags %llu\n", 41515d4f98a2SYan Zheng (unsigned long long)rc->block_group->key.objectid, 41525d4f98a2SYan Zheng (unsigned long long)rc->block_group->flags); 41535d4f98a2SYan Zheng 41548ccf6f19SMiao Xie ret = btrfs_start_delalloc_inodes(fs_info->tree_root, 0); 41558ccf6f19SMiao Xie if (ret < 0) { 41568ccf6f19SMiao Xie err = ret; 41578ccf6f19SMiao Xie goto out; 41588ccf6f19SMiao Xie } 41596bbe3a9cSLiu Bo btrfs_wait_ordered_extents(fs_info->tree_root, 0); 41605d4f98a2SYan Zheng 41615d4f98a2SYan Zheng while (1) { 416276dda93cSYan, Zheng mutex_lock(&fs_info->cleaner_mutex); 41635d4f98a2SYan Zheng ret = relocate_block_group(rc); 416476dda93cSYan, Zheng mutex_unlock(&fs_info->cleaner_mutex); 41655d4f98a2SYan Zheng if (ret < 0) { 41665d4f98a2SYan Zheng err = ret; 41673fd0a558SYan, Zheng goto out; 41685d4f98a2SYan Zheng } 41695d4f98a2SYan Zheng 41705d4f98a2SYan Zheng if (rc->extents_found == 0) 41715d4f98a2SYan Zheng break; 41725d4f98a2SYan Zheng 41735d4f98a2SYan Zheng printk(KERN_INFO "btrfs: found %llu extents\n", 41745d4f98a2SYan Zheng (unsigned long long)rc->extents_found); 41755d4f98a2SYan Zheng 41765d4f98a2SYan Zheng if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) { 41775d4f98a2SYan Zheng btrfs_wait_ordered_range(rc->data_inode, 0, (u64)-1); 41785d4f98a2SYan Zheng invalidate_mapping_pages(rc->data_inode->i_mapping, 41795d4f98a2SYan Zheng 0, -1); 41805d4f98a2SYan Zheng rc->stage = UPDATE_DATA_PTRS; 41815d4f98a2SYan Zheng } 41825d4f98a2SYan Zheng } 41835d4f98a2SYan Zheng 41840257bb82SYan, Zheng filemap_write_and_wait_range(fs_info->btree_inode->i_mapping, 41855d4f98a2SYan Zheng rc->block_group->key.objectid, 41865d4f98a2SYan Zheng rc->block_group->key.objectid + 41875d4f98a2SYan Zheng rc->block_group->key.offset - 1); 41885d4f98a2SYan Zheng 41895d4f98a2SYan Zheng WARN_ON(rc->block_group->pinned > 0); 41905d4f98a2SYan Zheng WARN_ON(rc->block_group->reserved > 0); 41915d4f98a2SYan Zheng WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0); 41925d4f98a2SYan Zheng out: 4193f0486c68SYan, Zheng if (err && rw) 4194f0486c68SYan, Zheng btrfs_set_block_group_rw(extent_root, rc->block_group); 41955d4f98a2SYan Zheng iput(rc->data_inode); 41965d4f98a2SYan Zheng btrfs_put_block_group(rc->block_group); 41975d4f98a2SYan Zheng kfree(rc); 41985d4f98a2SYan Zheng return err; 41995d4f98a2SYan Zheng } 42005d4f98a2SYan Zheng 420176dda93cSYan, Zheng static noinline_for_stack int mark_garbage_root(struct btrfs_root *root) 420276dda93cSYan, Zheng { 420376dda93cSYan, Zheng struct btrfs_trans_handle *trans; 420479787eaaSJeff Mahoney int ret, err; 420576dda93cSYan, Zheng 4206a22285a6SYan, Zheng trans = btrfs_start_transaction(root->fs_info->tree_root, 0); 420779787eaaSJeff Mahoney if (IS_ERR(trans)) 420879787eaaSJeff Mahoney return PTR_ERR(trans); 420976dda93cSYan, Zheng 421076dda93cSYan, Zheng memset(&root->root_item.drop_progress, 0, 421176dda93cSYan, Zheng sizeof(root->root_item.drop_progress)); 421276dda93cSYan, Zheng root->root_item.drop_level = 0; 421376dda93cSYan, Zheng btrfs_set_root_refs(&root->root_item, 0); 421476dda93cSYan, Zheng ret = btrfs_update_root(trans, root->fs_info->tree_root, 421576dda93cSYan, Zheng &root->root_key, &root->root_item); 421676dda93cSYan, Zheng 421779787eaaSJeff Mahoney err = btrfs_end_transaction(trans, root->fs_info->tree_root); 421879787eaaSJeff Mahoney if (err) 421979787eaaSJeff Mahoney return err; 422079787eaaSJeff Mahoney return ret; 422176dda93cSYan, Zheng } 422276dda93cSYan, Zheng 42235d4f98a2SYan Zheng /* 42245d4f98a2SYan Zheng * recover relocation interrupted by system crash. 42255d4f98a2SYan Zheng * 42265d4f98a2SYan Zheng * this function resumes merging reloc trees with corresponding fs trees. 42275d4f98a2SYan Zheng * this is important for keeping the sharing of tree blocks 42285d4f98a2SYan Zheng */ 42295d4f98a2SYan Zheng int btrfs_recover_relocation(struct btrfs_root *root) 42305d4f98a2SYan Zheng { 42315d4f98a2SYan Zheng LIST_HEAD(reloc_roots); 42325d4f98a2SYan Zheng struct btrfs_key key; 42335d4f98a2SYan Zheng struct btrfs_root *fs_root; 42345d4f98a2SYan Zheng struct btrfs_root *reloc_root; 42355d4f98a2SYan Zheng struct btrfs_path *path; 42365d4f98a2SYan Zheng struct extent_buffer *leaf; 42375d4f98a2SYan Zheng struct reloc_control *rc = NULL; 42385d4f98a2SYan Zheng struct btrfs_trans_handle *trans; 42395d4f98a2SYan Zheng int ret; 42405d4f98a2SYan Zheng int err = 0; 42415d4f98a2SYan Zheng 42425d4f98a2SYan Zheng path = btrfs_alloc_path(); 42435d4f98a2SYan Zheng if (!path) 42445d4f98a2SYan Zheng return -ENOMEM; 4245026fd317SJosef Bacik path->reada = -1; 42465d4f98a2SYan Zheng 42475d4f98a2SYan Zheng key.objectid = BTRFS_TREE_RELOC_OBJECTID; 42485d4f98a2SYan Zheng key.type = BTRFS_ROOT_ITEM_KEY; 42495d4f98a2SYan Zheng key.offset = (u64)-1; 42505d4f98a2SYan Zheng 42515d4f98a2SYan Zheng while (1) { 42525d4f98a2SYan Zheng ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key, 42535d4f98a2SYan Zheng path, 0, 0); 42545d4f98a2SYan Zheng if (ret < 0) { 42555d4f98a2SYan Zheng err = ret; 42565d4f98a2SYan Zheng goto out; 42575d4f98a2SYan Zheng } 42585d4f98a2SYan Zheng if (ret > 0) { 42595d4f98a2SYan Zheng if (path->slots[0] == 0) 42605d4f98a2SYan Zheng break; 42615d4f98a2SYan Zheng path->slots[0]--; 42625d4f98a2SYan Zheng } 42635d4f98a2SYan Zheng leaf = path->nodes[0]; 42645d4f98a2SYan Zheng btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); 4265b3b4aa74SDavid Sterba btrfs_release_path(path); 42665d4f98a2SYan Zheng 42675d4f98a2SYan Zheng if (key.objectid != BTRFS_TREE_RELOC_OBJECTID || 42685d4f98a2SYan Zheng key.type != BTRFS_ROOT_ITEM_KEY) 42695d4f98a2SYan Zheng break; 42705d4f98a2SYan Zheng 42715d4f98a2SYan Zheng reloc_root = btrfs_read_fs_root_no_radix(root, &key); 42725d4f98a2SYan Zheng if (IS_ERR(reloc_root)) { 42735d4f98a2SYan Zheng err = PTR_ERR(reloc_root); 42745d4f98a2SYan Zheng goto out; 42755d4f98a2SYan Zheng } 42765d4f98a2SYan Zheng 42775d4f98a2SYan Zheng list_add(&reloc_root->root_list, &reloc_roots); 42785d4f98a2SYan Zheng 42795d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) > 0) { 42805d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 42815d4f98a2SYan Zheng reloc_root->root_key.offset); 42825d4f98a2SYan Zheng if (IS_ERR(fs_root)) { 428376dda93cSYan, Zheng ret = PTR_ERR(fs_root); 428476dda93cSYan, Zheng if (ret != -ENOENT) { 428576dda93cSYan, Zheng err = ret; 42865d4f98a2SYan Zheng goto out; 42875d4f98a2SYan Zheng } 428879787eaaSJeff Mahoney ret = mark_garbage_root(reloc_root); 428979787eaaSJeff Mahoney if (ret < 0) { 429079787eaaSJeff Mahoney err = ret; 429179787eaaSJeff Mahoney goto out; 429279787eaaSJeff Mahoney } 429376dda93cSYan, Zheng } 42945d4f98a2SYan Zheng } 42955d4f98a2SYan Zheng 42965d4f98a2SYan Zheng if (key.offset == 0) 42975d4f98a2SYan Zheng break; 42985d4f98a2SYan Zheng 42995d4f98a2SYan Zheng key.offset--; 43005d4f98a2SYan Zheng } 4301b3b4aa74SDavid Sterba btrfs_release_path(path); 43025d4f98a2SYan Zheng 43035d4f98a2SYan Zheng if (list_empty(&reloc_roots)) 43045d4f98a2SYan Zheng goto out; 43055d4f98a2SYan Zheng 43063fd0a558SYan, Zheng rc = alloc_reloc_control(); 43075d4f98a2SYan Zheng if (!rc) { 43085d4f98a2SYan Zheng err = -ENOMEM; 43095d4f98a2SYan Zheng goto out; 43105d4f98a2SYan Zheng } 43115d4f98a2SYan Zheng 43125d4f98a2SYan Zheng rc->extent_root = root->fs_info->extent_root; 43135d4f98a2SYan Zheng 43145d4f98a2SYan Zheng set_reloc_control(rc); 43155d4f98a2SYan Zheng 43167a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 43173612b495STsutomu Itoh if (IS_ERR(trans)) { 43183612b495STsutomu Itoh unset_reloc_control(rc); 43193612b495STsutomu Itoh err = PTR_ERR(trans); 43203612b495STsutomu Itoh goto out_free; 43213612b495STsutomu Itoh } 43223fd0a558SYan, Zheng 43233fd0a558SYan, Zheng rc->merge_reloc_tree = 1; 43243fd0a558SYan, Zheng 43255d4f98a2SYan Zheng while (!list_empty(&reloc_roots)) { 43265d4f98a2SYan Zheng reloc_root = list_entry(reloc_roots.next, 43275d4f98a2SYan Zheng struct btrfs_root, root_list); 43285d4f98a2SYan Zheng list_del(&reloc_root->root_list); 43295d4f98a2SYan Zheng 43305d4f98a2SYan Zheng if (btrfs_root_refs(&reloc_root->root_item) == 0) { 43315d4f98a2SYan Zheng list_add_tail(&reloc_root->root_list, 43325d4f98a2SYan Zheng &rc->reloc_roots); 43335d4f98a2SYan Zheng continue; 43345d4f98a2SYan Zheng } 43355d4f98a2SYan Zheng 43365d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 43375d4f98a2SYan Zheng reloc_root->root_key.offset); 433879787eaaSJeff Mahoney if (IS_ERR(fs_root)) { 433979787eaaSJeff Mahoney err = PTR_ERR(fs_root); 434079787eaaSJeff Mahoney goto out_free; 434179787eaaSJeff Mahoney } 43425d4f98a2SYan Zheng 4343ffd7b339SJeff Mahoney err = __add_reloc_root(reloc_root); 434479787eaaSJeff Mahoney BUG_ON(err < 0); /* -ENOMEM or logic error */ 43455d4f98a2SYan Zheng fs_root->reloc_root = reloc_root; 43465d4f98a2SYan Zheng } 43475d4f98a2SYan Zheng 434879787eaaSJeff Mahoney err = btrfs_commit_transaction(trans, rc->extent_root); 434979787eaaSJeff Mahoney if (err) 435079787eaaSJeff Mahoney goto out_free; 43515d4f98a2SYan Zheng 43525d4f98a2SYan Zheng merge_reloc_roots(rc); 43535d4f98a2SYan Zheng 43545d4f98a2SYan Zheng unset_reloc_control(rc); 43555d4f98a2SYan Zheng 43567a7eaa40SJosef Bacik trans = btrfs_join_transaction(rc->extent_root); 43573612b495STsutomu Itoh if (IS_ERR(trans)) 43583612b495STsutomu Itoh err = PTR_ERR(trans); 43593612b495STsutomu Itoh else 436079787eaaSJeff Mahoney err = btrfs_commit_transaction(trans, rc->extent_root); 43613612b495STsutomu Itoh out_free: 43625d4f98a2SYan Zheng kfree(rc); 43633612b495STsutomu Itoh out: 4364aca1bba6SLiu Bo if (!list_empty(&reloc_roots)) 4365aca1bba6SLiu Bo free_reloc_roots(&reloc_roots); 4366aca1bba6SLiu Bo 43675d4f98a2SYan Zheng btrfs_free_path(path); 43685d4f98a2SYan Zheng 43695d4f98a2SYan Zheng if (err == 0) { 43705d4f98a2SYan Zheng /* cleanup orphan inode in data relocation tree */ 43715d4f98a2SYan Zheng fs_root = read_fs_root(root->fs_info, 43725d4f98a2SYan Zheng BTRFS_DATA_RELOC_TREE_OBJECTID); 43735d4f98a2SYan Zheng if (IS_ERR(fs_root)) 43745d4f98a2SYan Zheng err = PTR_ERR(fs_root); 4375d7ce5843SMiao Xie else 437666b4ffd1SJosef Bacik err = btrfs_orphan_cleanup(fs_root); 43775d4f98a2SYan Zheng } 43785d4f98a2SYan Zheng return err; 43795d4f98a2SYan Zheng } 43805d4f98a2SYan Zheng 43815d4f98a2SYan Zheng /* 43825d4f98a2SYan Zheng * helper to add ordered checksum for data relocation. 43835d4f98a2SYan Zheng * 43845d4f98a2SYan Zheng * cloning checksum properly handles the nodatasum extents. 43855d4f98a2SYan Zheng * it also saves CPU time to re-calculate the checksum. 43865d4f98a2SYan Zheng */ 43875d4f98a2SYan Zheng int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len) 43885d4f98a2SYan Zheng { 43895d4f98a2SYan Zheng struct btrfs_ordered_sum *sums; 43905d4f98a2SYan Zheng struct btrfs_sector_sum *sector_sum; 43915d4f98a2SYan Zheng struct btrfs_ordered_extent *ordered; 43925d4f98a2SYan Zheng struct btrfs_root *root = BTRFS_I(inode)->root; 43935d4f98a2SYan Zheng size_t offset; 43945d4f98a2SYan Zheng int ret; 43955d4f98a2SYan Zheng u64 disk_bytenr; 43965d4f98a2SYan Zheng LIST_HEAD(list); 43975d4f98a2SYan Zheng 43985d4f98a2SYan Zheng ordered = btrfs_lookup_ordered_extent(inode, file_pos); 43995d4f98a2SYan Zheng BUG_ON(ordered->file_offset != file_pos || ordered->len != len); 44005d4f98a2SYan Zheng 44015d4f98a2SYan Zheng disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt; 44025d4f98a2SYan Zheng ret = btrfs_lookup_csums_range(root->fs_info->csum_root, disk_bytenr, 4403a2de733cSArne Jansen disk_bytenr + len - 1, &list, 0); 440479787eaaSJeff Mahoney if (ret) 440579787eaaSJeff Mahoney goto out; 44065d4f98a2SYan Zheng 44075d4f98a2SYan Zheng while (!list_empty(&list)) { 44085d4f98a2SYan Zheng sums = list_entry(list.next, struct btrfs_ordered_sum, list); 44095d4f98a2SYan Zheng list_del_init(&sums->list); 44105d4f98a2SYan Zheng 44115d4f98a2SYan Zheng sector_sum = sums->sums; 44125d4f98a2SYan Zheng sums->bytenr = ordered->start; 44135d4f98a2SYan Zheng 44145d4f98a2SYan Zheng offset = 0; 44155d4f98a2SYan Zheng while (offset < sums->len) { 44165d4f98a2SYan Zheng sector_sum->bytenr += ordered->start - disk_bytenr; 44175d4f98a2SYan Zheng sector_sum++; 44185d4f98a2SYan Zheng offset += root->sectorsize; 44195d4f98a2SYan Zheng } 44205d4f98a2SYan Zheng 44215d4f98a2SYan Zheng btrfs_add_ordered_sum(inode, ordered, sums); 44225d4f98a2SYan Zheng } 442379787eaaSJeff Mahoney out: 44245d4f98a2SYan Zheng btrfs_put_ordered_extent(ordered); 4425411fc6bcSAndi Kleen return ret; 44265d4f98a2SYan Zheng } 44273fd0a558SYan, Zheng 44283fd0a558SYan, Zheng void btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, 44293fd0a558SYan, Zheng struct btrfs_root *root, struct extent_buffer *buf, 44303fd0a558SYan, Zheng struct extent_buffer *cow) 44313fd0a558SYan, Zheng { 44323fd0a558SYan, Zheng struct reloc_control *rc; 44333fd0a558SYan, Zheng struct backref_node *node; 44343fd0a558SYan, Zheng int first_cow = 0; 44353fd0a558SYan, Zheng int level; 44363fd0a558SYan, Zheng int ret; 44373fd0a558SYan, Zheng 44383fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 44393fd0a558SYan, Zheng if (!rc) 44403fd0a558SYan, Zheng return; 44413fd0a558SYan, Zheng 44423fd0a558SYan, Zheng BUG_ON(rc->stage == UPDATE_DATA_PTRS && 44433fd0a558SYan, Zheng root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID); 44443fd0a558SYan, Zheng 44453fd0a558SYan, Zheng level = btrfs_header_level(buf); 44463fd0a558SYan, Zheng if (btrfs_header_generation(buf) <= 44473fd0a558SYan, Zheng btrfs_root_last_snapshot(&root->root_item)) 44483fd0a558SYan, Zheng first_cow = 1; 44493fd0a558SYan, Zheng 44503fd0a558SYan, Zheng if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID && 44513fd0a558SYan, Zheng rc->create_reloc_tree) { 44523fd0a558SYan, Zheng WARN_ON(!first_cow && level == 0); 44533fd0a558SYan, Zheng 44543fd0a558SYan, Zheng node = rc->backref_cache.path[level]; 44553fd0a558SYan, Zheng BUG_ON(node->bytenr != buf->start && 44563fd0a558SYan, Zheng node->new_bytenr != buf->start); 44573fd0a558SYan, Zheng 44583fd0a558SYan, Zheng drop_node_buffer(node); 44593fd0a558SYan, Zheng extent_buffer_get(cow); 44603fd0a558SYan, Zheng node->eb = cow; 44613fd0a558SYan, Zheng node->new_bytenr = cow->start; 44623fd0a558SYan, Zheng 44633fd0a558SYan, Zheng if (!node->pending) { 44643fd0a558SYan, Zheng list_move_tail(&node->list, 44653fd0a558SYan, Zheng &rc->backref_cache.pending[level]); 44663fd0a558SYan, Zheng node->pending = 1; 44673fd0a558SYan, Zheng } 44683fd0a558SYan, Zheng 44693fd0a558SYan, Zheng if (first_cow) 44703fd0a558SYan, Zheng __mark_block_processed(rc, node); 44713fd0a558SYan, Zheng 44723fd0a558SYan, Zheng if (first_cow && level > 0) 44733fd0a558SYan, Zheng rc->nodes_relocated += buf->len; 44743fd0a558SYan, Zheng } 44753fd0a558SYan, Zheng 44763fd0a558SYan, Zheng if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) { 44773fd0a558SYan, Zheng ret = replace_file_extents(trans, rc, root, cow); 44783fd0a558SYan, Zheng BUG_ON(ret); 44793fd0a558SYan, Zheng } 44803fd0a558SYan, Zheng } 44813fd0a558SYan, Zheng 44823fd0a558SYan, Zheng /* 44833fd0a558SYan, Zheng * called before creating snapshot. it calculates metadata reservation 44843fd0a558SYan, Zheng * requried for relocating tree blocks in the snapshot 44853fd0a558SYan, Zheng */ 44863fd0a558SYan, Zheng void btrfs_reloc_pre_snapshot(struct btrfs_trans_handle *trans, 44873fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending, 44883fd0a558SYan, Zheng u64 *bytes_to_reserve) 44893fd0a558SYan, Zheng { 44903fd0a558SYan, Zheng struct btrfs_root *root; 44913fd0a558SYan, Zheng struct reloc_control *rc; 44923fd0a558SYan, Zheng 44933fd0a558SYan, Zheng root = pending->root; 44943fd0a558SYan, Zheng if (!root->reloc_root) 44953fd0a558SYan, Zheng return; 44963fd0a558SYan, Zheng 44973fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 44983fd0a558SYan, Zheng if (!rc->merge_reloc_tree) 44993fd0a558SYan, Zheng return; 45003fd0a558SYan, Zheng 45013fd0a558SYan, Zheng root = root->reloc_root; 45023fd0a558SYan, Zheng BUG_ON(btrfs_root_refs(&root->root_item) == 0); 45033fd0a558SYan, Zheng /* 45043fd0a558SYan, Zheng * relocation is in the stage of merging trees. the space 45053fd0a558SYan, Zheng * used by merging a reloc tree is twice the size of 45063fd0a558SYan, Zheng * relocated tree nodes in the worst case. half for cowing 45073fd0a558SYan, Zheng * the reloc tree, half for cowing the fs tree. the space 45083fd0a558SYan, Zheng * used by cowing the reloc tree will be freed after the 45093fd0a558SYan, Zheng * tree is dropped. if we create snapshot, cowing the fs 45103fd0a558SYan, Zheng * tree may use more space than it frees. so we need 45113fd0a558SYan, Zheng * reserve extra space. 45123fd0a558SYan, Zheng */ 45133fd0a558SYan, Zheng *bytes_to_reserve += rc->nodes_relocated; 45143fd0a558SYan, Zheng } 45153fd0a558SYan, Zheng 45163fd0a558SYan, Zheng /* 45173fd0a558SYan, Zheng * called after snapshot is created. migrate block reservation 45183fd0a558SYan, Zheng * and create reloc root for the newly created snapshot 45193fd0a558SYan, Zheng */ 452049b25e05SJeff Mahoney int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans, 45213fd0a558SYan, Zheng struct btrfs_pending_snapshot *pending) 45223fd0a558SYan, Zheng { 45233fd0a558SYan, Zheng struct btrfs_root *root = pending->root; 45243fd0a558SYan, Zheng struct btrfs_root *reloc_root; 45253fd0a558SYan, Zheng struct btrfs_root *new_root; 45263fd0a558SYan, Zheng struct reloc_control *rc; 45273fd0a558SYan, Zheng int ret; 45283fd0a558SYan, Zheng 45293fd0a558SYan, Zheng if (!root->reloc_root) 453049b25e05SJeff Mahoney return 0; 45313fd0a558SYan, Zheng 45323fd0a558SYan, Zheng rc = root->fs_info->reloc_ctl; 45333fd0a558SYan, Zheng rc->merging_rsv_size += rc->nodes_relocated; 45343fd0a558SYan, Zheng 45353fd0a558SYan, Zheng if (rc->merge_reloc_tree) { 45363fd0a558SYan, Zheng ret = btrfs_block_rsv_migrate(&pending->block_rsv, 45373fd0a558SYan, Zheng rc->block_rsv, 45383fd0a558SYan, Zheng rc->nodes_relocated); 453949b25e05SJeff Mahoney if (ret) 454049b25e05SJeff Mahoney return ret; 45413fd0a558SYan, Zheng } 45423fd0a558SYan, Zheng 45433fd0a558SYan, Zheng new_root = pending->snap; 45443fd0a558SYan, Zheng reloc_root = create_reloc_root(trans, root->reloc_root, 45453fd0a558SYan, Zheng new_root->root_key.objectid); 454649b25e05SJeff Mahoney if (IS_ERR(reloc_root)) 454749b25e05SJeff Mahoney return PTR_ERR(reloc_root); 45483fd0a558SYan, Zheng 4549ffd7b339SJeff Mahoney ret = __add_reloc_root(reloc_root); 4550ffd7b339SJeff Mahoney BUG_ON(ret < 0); 45513fd0a558SYan, Zheng new_root->reloc_root = reloc_root; 45523fd0a558SYan, Zheng 455349b25e05SJeff Mahoney if (rc->create_reloc_tree) 45543fd0a558SYan, Zheng ret = clone_backref_node(trans, rc, root, reloc_root); 455549b25e05SJeff Mahoney return ret; 45563fd0a558SYan, Zheng } 4557