1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2009 Oracle. All rights reserved.
6 #include <linux/sched.h>
7 #include <linux/pagemap.h>
8 #include <linux/writeback.h>
9 #include <linux/blkdev.h>
10 #include <linux/rbtree.h>
11 #include <linux/slab.h>
14 #include "transaction.h"
17 #include "btrfs_inode.h"
18 #include "async-thread.h"
19 #include "free-space-cache.h"
20 #include "inode-map.h"
22 #include "print-tree.h"
25 * backref_node, mapping_node and tree_block start with this
28 struct rb_node rb_node;
33 * present a tree block in the backref cache
36 struct rb_node rb_node;
40 /* objectid of tree block owner, can be not uptodate */
42 /* link to pending, changed or detached list */
43 struct list_head list;
44 /* list of upper level blocks reference this block */
45 struct list_head upper;
46 /* list of child blocks in the cache */
47 struct list_head lower;
48 /* NULL if this node is not tree root */
49 struct btrfs_root *root;
50 /* extent buffer got by COW the block */
51 struct extent_buffer *eb;
52 /* level of tree block */
54 /* is the block in non-reference counted tree */
55 unsigned int cowonly:1;
56 /* 1 if no child node in the cache */
57 unsigned int lowest:1;
58 /* is the extent buffer locked */
59 unsigned int locked:1;
60 /* has the block been processed */
61 unsigned int processed:1;
62 /* have backrefs of this block been checked */
63 unsigned int checked:1;
65 * 1 if corresponding block has been cowed but some upper
66 * level block pointers may not point to the new location
68 unsigned int pending:1;
70 * 1 if the backref node isn't connected to any other
73 unsigned int detached:1;
77 * present a block pointer in the backref cache
80 struct list_head list[2];
81 struct backref_node *node[2];
86 #define RELOCATION_RESERVED_NODES 256
88 struct backref_cache {
89 /* red black tree of all backref nodes in the cache */
90 struct rb_root rb_root;
91 /* for passing backref nodes to btrfs_reloc_cow_block */
92 struct backref_node *path[BTRFS_MAX_LEVEL];
94 * list of blocks that have been cowed but some block
95 * pointers in upper level blocks may not reflect the
98 struct list_head pending[BTRFS_MAX_LEVEL];
99 /* list of backref nodes with no child node */
100 struct list_head leaves;
101 /* list of blocks that have been cowed in current transaction */
102 struct list_head changed;
103 /* list of detached backref node. */
104 struct list_head detached;
113 * map address of tree root to tree
115 struct mapping_node {
116 struct rb_node rb_node;
121 struct mapping_tree {
122 struct rb_root rb_root;
127 * present a tree block to process
130 struct rb_node rb_node;
132 struct btrfs_key key;
133 unsigned int level:8;
134 unsigned int key_ready:1;
137 #define MAX_EXTENTS 128
139 struct file_extent_cluster {
142 u64 boundary[MAX_EXTENTS];
146 struct reloc_control {
147 /* block group to relocate */
148 struct btrfs_block_group_cache *block_group;
150 struct btrfs_root *extent_root;
151 /* inode for moving data */
152 struct inode *data_inode;
154 struct btrfs_block_rsv *block_rsv;
156 struct backref_cache backref_cache;
158 struct file_extent_cluster cluster;
159 /* tree blocks have been processed */
160 struct extent_io_tree processed_blocks;
161 /* map start of tree root to corresponding reloc tree */
162 struct mapping_tree reloc_root_tree;
163 /* list of reloc trees */
164 struct list_head reloc_roots;
165 /* size of metadata reservation for merging reloc trees */
166 u64 merging_rsv_size;
167 /* size of relocated tree nodes */
169 /* reserved size for block group relocation*/
175 unsigned int stage:8;
176 unsigned int create_reloc_tree:1;
177 unsigned int merge_reloc_tree:1;
178 unsigned int found_file_extent:1;
181 /* stages of data relocation */
182 #define MOVE_DATA_EXTENTS 0
183 #define UPDATE_DATA_PTRS 1
185 static void remove_backref_node(struct backref_cache *cache,
186 struct backref_node *node);
187 static void __mark_block_processed(struct reloc_control *rc,
188 struct backref_node *node);
190 static void mapping_tree_init(struct mapping_tree *tree)
192 tree->rb_root = RB_ROOT;
193 spin_lock_init(&tree->lock);
196 static void backref_cache_init(struct backref_cache *cache)
199 cache->rb_root = RB_ROOT;
200 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
201 INIT_LIST_HEAD(&cache->pending[i]);
202 INIT_LIST_HEAD(&cache->changed);
203 INIT_LIST_HEAD(&cache->detached);
204 INIT_LIST_HEAD(&cache->leaves);
207 static void backref_cache_cleanup(struct backref_cache *cache)
209 struct backref_node *node;
212 while (!list_empty(&cache->detached)) {
213 node = list_entry(cache->detached.next,
214 struct backref_node, list);
215 remove_backref_node(cache, node);
218 while (!list_empty(&cache->leaves)) {
219 node = list_entry(cache->leaves.next,
220 struct backref_node, lower);
221 remove_backref_node(cache, node);
224 cache->last_trans = 0;
226 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
227 ASSERT(list_empty(&cache->pending[i]));
228 ASSERT(list_empty(&cache->changed));
229 ASSERT(list_empty(&cache->detached));
230 ASSERT(RB_EMPTY_ROOT(&cache->rb_root));
231 ASSERT(!cache->nr_nodes);
232 ASSERT(!cache->nr_edges);
235 static struct backref_node *alloc_backref_node(struct backref_cache *cache)
237 struct backref_node *node;
239 node = kzalloc(sizeof(*node), GFP_NOFS);
241 INIT_LIST_HEAD(&node->list);
242 INIT_LIST_HEAD(&node->upper);
243 INIT_LIST_HEAD(&node->lower);
244 RB_CLEAR_NODE(&node->rb_node);
250 static void free_backref_node(struct backref_cache *cache,
251 struct backref_node *node)
259 static struct backref_edge *alloc_backref_edge(struct backref_cache *cache)
261 struct backref_edge *edge;
263 edge = kzalloc(sizeof(*edge), GFP_NOFS);
269 static void free_backref_edge(struct backref_cache *cache,
270 struct backref_edge *edge)
278 static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr,
279 struct rb_node *node)
281 struct rb_node **p = &root->rb_node;
282 struct rb_node *parent = NULL;
283 struct tree_entry *entry;
287 entry = rb_entry(parent, struct tree_entry, rb_node);
289 if (bytenr < entry->bytenr)
291 else if (bytenr > entry->bytenr)
297 rb_link_node(node, parent, p);
298 rb_insert_color(node, root);
302 static struct rb_node *tree_search(struct rb_root *root, u64 bytenr)
304 struct rb_node *n = root->rb_node;
305 struct tree_entry *entry;
308 entry = rb_entry(n, struct tree_entry, rb_node);
310 if (bytenr < entry->bytenr)
312 else if (bytenr > entry->bytenr)
320 static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr)
323 struct btrfs_fs_info *fs_info = NULL;
324 struct backref_node *bnode = rb_entry(rb_node, struct backref_node,
327 fs_info = bnode->root->fs_info;
328 btrfs_panic(fs_info, errno,
329 "Inconsistency in backref cache found at offset %llu",
334 * walk up backref nodes until reach node presents tree root
336 static struct backref_node *walk_up_backref(struct backref_node *node,
337 struct backref_edge *edges[],
340 struct backref_edge *edge;
343 while (!list_empty(&node->upper)) {
344 edge = list_entry(node->upper.next,
345 struct backref_edge, list[LOWER]);
347 node = edge->node[UPPER];
349 BUG_ON(node->detached);
355 * walk down backref nodes to find start of next reference path
357 static struct backref_node *walk_down_backref(struct backref_edge *edges[],
360 struct backref_edge *edge;
361 struct backref_node *lower;
365 edge = edges[idx - 1];
366 lower = edge->node[LOWER];
367 if (list_is_last(&edge->list[LOWER], &lower->upper)) {
371 edge = list_entry(edge->list[LOWER].next,
372 struct backref_edge, list[LOWER]);
373 edges[idx - 1] = edge;
375 return edge->node[UPPER];
381 static void unlock_node_buffer(struct backref_node *node)
384 btrfs_tree_unlock(node->eb);
389 static void drop_node_buffer(struct backref_node *node)
392 unlock_node_buffer(node);
393 free_extent_buffer(node->eb);
398 static void drop_backref_node(struct backref_cache *tree,
399 struct backref_node *node)
401 BUG_ON(!list_empty(&node->upper));
403 drop_node_buffer(node);
404 list_del(&node->list);
405 list_del(&node->lower);
406 if (!RB_EMPTY_NODE(&node->rb_node))
407 rb_erase(&node->rb_node, &tree->rb_root);
408 free_backref_node(tree, node);
412 * remove a backref node from the backref cache
414 static void remove_backref_node(struct backref_cache *cache,
415 struct backref_node *node)
417 struct backref_node *upper;
418 struct backref_edge *edge;
423 BUG_ON(!node->lowest && !node->detached);
424 while (!list_empty(&node->upper)) {
425 edge = list_entry(node->upper.next, struct backref_edge,
427 upper = edge->node[UPPER];
428 list_del(&edge->list[LOWER]);
429 list_del(&edge->list[UPPER]);
430 free_backref_edge(cache, edge);
432 if (RB_EMPTY_NODE(&upper->rb_node)) {
433 BUG_ON(!list_empty(&node->upper));
434 drop_backref_node(cache, node);
440 * add the node to leaf node list if no other
441 * child block cached.
443 if (list_empty(&upper->lower)) {
444 list_add_tail(&upper->lower, &cache->leaves);
449 drop_backref_node(cache, node);
452 static void update_backref_node(struct backref_cache *cache,
453 struct backref_node *node, u64 bytenr)
455 struct rb_node *rb_node;
456 rb_erase(&node->rb_node, &cache->rb_root);
457 node->bytenr = bytenr;
458 rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node);
460 backref_tree_panic(rb_node, -EEXIST, bytenr);
464 * update backref cache after a transaction commit
466 static int update_backref_cache(struct btrfs_trans_handle *trans,
467 struct backref_cache *cache)
469 struct backref_node *node;
472 if (cache->last_trans == 0) {
473 cache->last_trans = trans->transid;
477 if (cache->last_trans == trans->transid)
481 * detached nodes are used to avoid unnecessary backref
482 * lookup. transaction commit changes the extent tree.
483 * so the detached nodes are no longer useful.
485 while (!list_empty(&cache->detached)) {
486 node = list_entry(cache->detached.next,
487 struct backref_node, list);
488 remove_backref_node(cache, node);
491 while (!list_empty(&cache->changed)) {
492 node = list_entry(cache->changed.next,
493 struct backref_node, list);
494 list_del_init(&node->list);
495 BUG_ON(node->pending);
496 update_backref_node(cache, node, node->new_bytenr);
500 * some nodes can be left in the pending list if there were
501 * errors during processing the pending nodes.
503 for (level = 0; level < BTRFS_MAX_LEVEL; level++) {
504 list_for_each_entry(node, &cache->pending[level], list) {
505 BUG_ON(!node->pending);
506 if (node->bytenr == node->new_bytenr)
508 update_backref_node(cache, node, node->new_bytenr);
512 cache->last_trans = 0;
517 static int should_ignore_root(struct btrfs_root *root)
519 struct btrfs_root *reloc_root;
521 if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state))
524 reloc_root = root->reloc_root;
528 if (btrfs_root_last_snapshot(&reloc_root->root_item) ==
529 root->fs_info->running_transaction->transid - 1)
532 * if there is reloc tree and it was created in previous
533 * transaction backref lookup can find the reloc tree,
534 * so backref node for the fs tree root is useless for
540 * find reloc tree by address of tree root
542 static struct btrfs_root *find_reloc_root(struct reloc_control *rc,
545 struct rb_node *rb_node;
546 struct mapping_node *node;
547 struct btrfs_root *root = NULL;
549 spin_lock(&rc->reloc_root_tree.lock);
550 rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr);
552 node = rb_entry(rb_node, struct mapping_node, rb_node);
553 root = (struct btrfs_root *)node->data;
555 spin_unlock(&rc->reloc_root_tree.lock);
559 static int is_cowonly_root(u64 root_objectid)
561 if (root_objectid == BTRFS_ROOT_TREE_OBJECTID ||
562 root_objectid == BTRFS_EXTENT_TREE_OBJECTID ||
563 root_objectid == BTRFS_CHUNK_TREE_OBJECTID ||
564 root_objectid == BTRFS_DEV_TREE_OBJECTID ||
565 root_objectid == BTRFS_TREE_LOG_OBJECTID ||
566 root_objectid == BTRFS_CSUM_TREE_OBJECTID ||
567 root_objectid == BTRFS_UUID_TREE_OBJECTID ||
568 root_objectid == BTRFS_QUOTA_TREE_OBJECTID ||
569 root_objectid == BTRFS_FREE_SPACE_TREE_OBJECTID)
574 static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info,
577 struct btrfs_key key;
579 key.objectid = root_objectid;
580 key.type = BTRFS_ROOT_ITEM_KEY;
581 if (is_cowonly_root(root_objectid))
584 key.offset = (u64)-1;
586 return btrfs_get_fs_root(fs_info, &key, false);
589 static noinline_for_stack
590 int find_inline_backref(struct extent_buffer *leaf, int slot,
591 unsigned long *ptr, unsigned long *end)
593 struct btrfs_key key;
594 struct btrfs_extent_item *ei;
595 struct btrfs_tree_block_info *bi;
598 btrfs_item_key_to_cpu(leaf, &key, slot);
600 item_size = btrfs_item_size_nr(leaf, slot);
601 if (item_size < sizeof(*ei)) {
602 btrfs_print_v0_err(leaf->fs_info);
603 btrfs_handle_fs_error(leaf->fs_info, -EINVAL, NULL);
606 ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item);
607 WARN_ON(!(btrfs_extent_flags(leaf, ei) &
608 BTRFS_EXTENT_FLAG_TREE_BLOCK));
610 if (key.type == BTRFS_EXTENT_ITEM_KEY &&
611 item_size <= sizeof(*ei) + sizeof(*bi)) {
612 WARN_ON(item_size < sizeof(*ei) + sizeof(*bi));
615 if (key.type == BTRFS_METADATA_ITEM_KEY &&
616 item_size <= sizeof(*ei)) {
617 WARN_ON(item_size < sizeof(*ei));
621 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
622 bi = (struct btrfs_tree_block_info *)(ei + 1);
623 *ptr = (unsigned long)(bi + 1);
625 *ptr = (unsigned long)(ei + 1);
627 *end = (unsigned long)ei + item_size;
632 * build backref tree for a given tree block. root of the backref tree
633 * corresponds the tree block, leaves of the backref tree correspond
634 * roots of b-trees that reference the tree block.
636 * the basic idea of this function is check backrefs of a given block
637 * to find upper level blocks that reference the block, and then check
638 * backrefs of these upper level blocks recursively. the recursion stop
639 * when tree root is reached or backrefs for the block is cached.
641 * NOTE: if we find backrefs for a block are cached, we know backrefs
642 * for all upper level blocks that directly/indirectly reference the
643 * block are also cached.
645 static noinline_for_stack
646 struct backref_node *build_backref_tree(struct reloc_control *rc,
647 struct btrfs_key *node_key,
648 int level, u64 bytenr)
650 struct backref_cache *cache = &rc->backref_cache;
651 struct btrfs_path *path1; /* For searching extent root */
652 struct btrfs_path *path2; /* For searching parent of TREE_BLOCK_REF */
653 struct extent_buffer *eb;
654 struct btrfs_root *root;
655 struct backref_node *cur;
656 struct backref_node *upper;
657 struct backref_node *lower;
658 struct backref_node *node = NULL;
659 struct backref_node *exist = NULL;
660 struct backref_edge *edge;
661 struct rb_node *rb_node;
662 struct btrfs_key key;
665 LIST_HEAD(list); /* Pending edge list, upper node needs to be checked */
670 bool need_check = true;
672 path1 = btrfs_alloc_path();
673 path2 = btrfs_alloc_path();
674 if (!path1 || !path2) {
678 path1->reada = READA_FORWARD;
679 path2->reada = READA_FORWARD;
681 node = alloc_backref_node(cache);
687 node->bytenr = bytenr;
694 key.objectid = cur->bytenr;
695 key.type = BTRFS_METADATA_ITEM_KEY;
696 key.offset = (u64)-1;
698 path1->search_commit_root = 1;
699 path1->skip_locking = 1;
700 ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1,
707 ASSERT(path1->slots[0]);
711 WARN_ON(cur->checked);
712 if (!list_empty(&cur->upper)) {
714 * the backref was added previously when processing
715 * backref of type BTRFS_TREE_BLOCK_REF_KEY
717 ASSERT(list_is_singular(&cur->upper));
718 edge = list_entry(cur->upper.next, struct backref_edge,
720 ASSERT(list_empty(&edge->list[UPPER]));
721 exist = edge->node[UPPER];
723 * add the upper level block to pending list if we need
727 list_add_tail(&edge->list[UPPER], &list);
734 eb = path1->nodes[0];
737 if (path1->slots[0] >= btrfs_header_nritems(eb)) {
738 ret = btrfs_next_leaf(rc->extent_root, path1);
745 eb = path1->nodes[0];
748 btrfs_item_key_to_cpu(eb, &key, path1->slots[0]);
749 if (key.objectid != cur->bytenr) {
754 if (key.type == BTRFS_EXTENT_ITEM_KEY ||
755 key.type == BTRFS_METADATA_ITEM_KEY) {
756 ret = find_inline_backref(eb, path1->slots[0],
764 /* update key for inline back ref */
765 struct btrfs_extent_inline_ref *iref;
767 iref = (struct btrfs_extent_inline_ref *)ptr;
768 type = btrfs_get_extent_inline_ref_type(eb, iref,
769 BTRFS_REF_TYPE_BLOCK);
770 if (type == BTRFS_REF_TYPE_INVALID) {
775 key.offset = btrfs_extent_inline_ref_offset(eb, iref);
777 WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY &&
778 key.type != BTRFS_SHARED_BLOCK_REF_KEY);
782 * Parent node found and matches current inline ref, no need to
783 * rebuild this node for this inline ref.
786 ((key.type == BTRFS_TREE_BLOCK_REF_KEY &&
787 exist->owner == key.offset) ||
788 (key.type == BTRFS_SHARED_BLOCK_REF_KEY &&
789 exist->bytenr == key.offset))) {
794 /* SHARED_BLOCK_REF means key.offset is the parent bytenr */
795 if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) {
796 if (key.objectid == key.offset) {
798 * Only root blocks of reloc trees use backref
799 * pointing to itself.
801 root = find_reloc_root(rc, cur->bytenr);
807 edge = alloc_backref_edge(cache);
812 rb_node = tree_search(&cache->rb_root, key.offset);
814 upper = alloc_backref_node(cache);
816 free_backref_edge(cache, edge);
820 upper->bytenr = key.offset;
821 upper->level = cur->level + 1;
823 * backrefs for the upper level block isn't
824 * cached, add the block to pending list
826 list_add_tail(&edge->list[UPPER], &list);
828 upper = rb_entry(rb_node, struct backref_node,
830 ASSERT(upper->checked);
831 INIT_LIST_HEAD(&edge->list[UPPER]);
833 list_add_tail(&edge->list[LOWER], &cur->upper);
834 edge->node[LOWER] = cur;
835 edge->node[UPPER] = upper;
838 } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) {
840 btrfs_print_v0_err(rc->extent_root->fs_info);
841 btrfs_handle_fs_error(rc->extent_root->fs_info, err,
844 } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) {
849 * key.type == BTRFS_TREE_BLOCK_REF_KEY, inline ref offset
850 * means the root objectid. We need to search the tree to get
853 root = read_fs_root(rc->extent_root->fs_info, key.offset);
859 if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state))
862 if (btrfs_root_level(&root->root_item) == cur->level) {
864 ASSERT(btrfs_root_bytenr(&root->root_item) ==
866 if (should_ignore_root(root))
867 list_add(&cur->list, &useless);
873 level = cur->level + 1;
875 /* Search the tree to find parent blocks referring the block. */
876 path2->search_commit_root = 1;
877 path2->skip_locking = 1;
878 path2->lowest_level = level;
879 ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0);
880 path2->lowest_level = 0;
885 if (ret > 0 && path2->slots[level] > 0)
886 path2->slots[level]--;
888 eb = path2->nodes[level];
889 if (btrfs_node_blockptr(eb, path2->slots[level]) !=
891 btrfs_err(root->fs_info,
892 "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)",
893 cur->bytenr, level - 1,
894 root->root_key.objectid,
895 node_key->objectid, node_key->type,
903 /* Add all nodes and edges in the path */
904 for (; level < BTRFS_MAX_LEVEL; level++) {
905 if (!path2->nodes[level]) {
906 ASSERT(btrfs_root_bytenr(&root->root_item) ==
908 if (should_ignore_root(root))
909 list_add(&lower->list, &useless);
915 edge = alloc_backref_edge(cache);
921 eb = path2->nodes[level];
922 rb_node = tree_search(&cache->rb_root, eb->start);
924 upper = alloc_backref_node(cache);
926 free_backref_edge(cache, edge);
930 upper->bytenr = eb->start;
931 upper->owner = btrfs_header_owner(eb);
932 upper->level = lower->level + 1;
933 if (!test_bit(BTRFS_ROOT_REF_COWS,
938 * if we know the block isn't shared
939 * we can void checking its backrefs.
941 if (btrfs_block_can_be_shared(root, eb))
947 * add the block to pending list if we
948 * need check its backrefs, we only do this once
949 * while walking up a tree as we will catch
950 * anything else later on.
952 if (!upper->checked && need_check) {
954 list_add_tail(&edge->list[UPPER],
959 INIT_LIST_HEAD(&edge->list[UPPER]);
962 upper = rb_entry(rb_node, struct backref_node,
964 ASSERT(upper->checked);
965 INIT_LIST_HEAD(&edge->list[UPPER]);
967 upper->owner = btrfs_header_owner(eb);
969 list_add_tail(&edge->list[LOWER], &lower->upper);
970 edge->node[LOWER] = lower;
971 edge->node[UPPER] = upper;
978 btrfs_release_path(path2);
981 ptr += btrfs_extent_inline_ref_size(key.type);
991 btrfs_release_path(path1);
996 /* the pending list isn't empty, take the first block to process */
997 if (!list_empty(&list)) {
998 edge = list_entry(list.next, struct backref_edge, list[UPPER]);
999 list_del_init(&edge->list[UPPER]);
1000 cur = edge->node[UPPER];
1005 * everything goes well, connect backref nodes and insert backref nodes
1008 ASSERT(node->checked);
1009 cowonly = node->cowonly;
1011 rb_node = tree_insert(&cache->rb_root, node->bytenr,
1014 backref_tree_panic(rb_node, -EEXIST, node->bytenr);
1015 list_add_tail(&node->lower, &cache->leaves);
1018 list_for_each_entry(edge, &node->upper, list[LOWER])
1019 list_add_tail(&edge->list[UPPER], &list);
1021 while (!list_empty(&list)) {
1022 edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1023 list_del_init(&edge->list[UPPER]);
1024 upper = edge->node[UPPER];
1025 if (upper->detached) {
1026 list_del(&edge->list[LOWER]);
1027 lower = edge->node[LOWER];
1028 free_backref_edge(cache, edge);
1029 if (list_empty(&lower->upper))
1030 list_add(&lower->list, &useless);
1034 if (!RB_EMPTY_NODE(&upper->rb_node)) {
1035 if (upper->lowest) {
1036 list_del_init(&upper->lower);
1040 list_add_tail(&edge->list[UPPER], &upper->lower);
1044 if (!upper->checked) {
1046 * Still want to blow up for developers since this is a
1053 if (cowonly != upper->cowonly) {
1060 rb_node = tree_insert(&cache->rb_root, upper->bytenr,
1063 backref_tree_panic(rb_node, -EEXIST,
1067 list_add_tail(&edge->list[UPPER], &upper->lower);
1069 list_for_each_entry(edge, &upper->upper, list[LOWER])
1070 list_add_tail(&edge->list[UPPER], &list);
1073 * process useless backref nodes. backref nodes for tree leaves
1074 * are deleted from the cache. backref nodes for upper level
1075 * tree blocks are left in the cache to avoid unnecessary backref
1078 while (!list_empty(&useless)) {
1079 upper = list_entry(useless.next, struct backref_node, list);
1080 list_del_init(&upper->list);
1081 ASSERT(list_empty(&upper->upper));
1084 if (upper->lowest) {
1085 list_del_init(&upper->lower);
1088 while (!list_empty(&upper->lower)) {
1089 edge = list_entry(upper->lower.next,
1090 struct backref_edge, list[UPPER]);
1091 list_del(&edge->list[UPPER]);
1092 list_del(&edge->list[LOWER]);
1093 lower = edge->node[LOWER];
1094 free_backref_edge(cache, edge);
1096 if (list_empty(&lower->upper))
1097 list_add(&lower->list, &useless);
1099 __mark_block_processed(rc, upper);
1100 if (upper->level > 0) {
1101 list_add(&upper->list, &cache->detached);
1102 upper->detached = 1;
1104 rb_erase(&upper->rb_node, &cache->rb_root);
1105 free_backref_node(cache, upper);
1109 btrfs_free_path(path1);
1110 btrfs_free_path(path2);
1112 while (!list_empty(&useless)) {
1113 lower = list_entry(useless.next,
1114 struct backref_node, list);
1115 list_del_init(&lower->list);
1117 while (!list_empty(&list)) {
1118 edge = list_first_entry(&list, struct backref_edge,
1120 list_del(&edge->list[UPPER]);
1121 list_del(&edge->list[LOWER]);
1122 lower = edge->node[LOWER];
1123 upper = edge->node[UPPER];
1124 free_backref_edge(cache, edge);
1127 * Lower is no longer linked to any upper backref nodes
1128 * and isn't in the cache, we can free it ourselves.
1130 if (list_empty(&lower->upper) &&
1131 RB_EMPTY_NODE(&lower->rb_node))
1132 list_add(&lower->list, &useless);
1134 if (!RB_EMPTY_NODE(&upper->rb_node))
1137 /* Add this guy's upper edges to the list to process */
1138 list_for_each_entry(edge, &upper->upper, list[LOWER])
1139 list_add_tail(&edge->list[UPPER], &list);
1140 if (list_empty(&upper->upper))
1141 list_add(&upper->list, &useless);
1144 while (!list_empty(&useless)) {
1145 lower = list_entry(useless.next,
1146 struct backref_node, list);
1147 list_del_init(&lower->list);
1150 free_backref_node(cache, lower);
1153 free_backref_node(cache, node);
1154 return ERR_PTR(err);
1156 ASSERT(!node || !node->detached);
1161 * helper to add backref node for the newly created snapshot.
1162 * the backref node is created by cloning backref node that
1163 * corresponds to root of source tree
1165 static int clone_backref_node(struct btrfs_trans_handle *trans,
1166 struct reloc_control *rc,
1167 struct btrfs_root *src,
1168 struct btrfs_root *dest)
1170 struct btrfs_root *reloc_root = src->reloc_root;
1171 struct backref_cache *cache = &rc->backref_cache;
1172 struct backref_node *node = NULL;
1173 struct backref_node *new_node;
1174 struct backref_edge *edge;
1175 struct backref_edge *new_edge;
1176 struct rb_node *rb_node;
1178 if (cache->last_trans > 0)
1179 update_backref_cache(trans, cache);
1181 rb_node = tree_search(&cache->rb_root, src->commit_root->start);
1183 node = rb_entry(rb_node, struct backref_node, rb_node);
1187 BUG_ON(node->new_bytenr != reloc_root->node->start);
1191 rb_node = tree_search(&cache->rb_root,
1192 reloc_root->commit_root->start);
1194 node = rb_entry(rb_node, struct backref_node,
1196 BUG_ON(node->detached);
1203 new_node = alloc_backref_node(cache);
1207 new_node->bytenr = dest->node->start;
1208 new_node->level = node->level;
1209 new_node->lowest = node->lowest;
1210 new_node->checked = 1;
1211 new_node->root = dest;
1213 if (!node->lowest) {
1214 list_for_each_entry(edge, &node->lower, list[UPPER]) {
1215 new_edge = alloc_backref_edge(cache);
1219 new_edge->node[UPPER] = new_node;
1220 new_edge->node[LOWER] = edge->node[LOWER];
1221 list_add_tail(&new_edge->list[UPPER],
1225 list_add_tail(&new_node->lower, &cache->leaves);
1228 rb_node = tree_insert(&cache->rb_root, new_node->bytenr,
1229 &new_node->rb_node);
1231 backref_tree_panic(rb_node, -EEXIST, new_node->bytenr);
1233 if (!new_node->lowest) {
1234 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {
1235 list_add_tail(&new_edge->list[LOWER],
1236 &new_edge->node[LOWER]->upper);
1241 while (!list_empty(&new_node->lower)) {
1242 new_edge = list_entry(new_node->lower.next,
1243 struct backref_edge, list[UPPER]);
1244 list_del(&new_edge->list[UPPER]);
1245 free_backref_edge(cache, new_edge);
1247 free_backref_node(cache, new_node);
1252 * helper to add 'address of tree root -> reloc tree' mapping
1254 static int __must_check __add_reloc_root(struct btrfs_root *root)
1256 struct btrfs_fs_info *fs_info = root->fs_info;
1257 struct rb_node *rb_node;
1258 struct mapping_node *node;
1259 struct reloc_control *rc = fs_info->reloc_ctl;
1261 node = kmalloc(sizeof(*node), GFP_NOFS);
1265 node->bytenr = root->node->start;
1268 spin_lock(&rc->reloc_root_tree.lock);
1269 rb_node = tree_insert(&rc->reloc_root_tree.rb_root,
1270 node->bytenr, &node->rb_node);
1271 spin_unlock(&rc->reloc_root_tree.lock);
1273 btrfs_panic(fs_info, -EEXIST,
1274 "Duplicate root found for start=%llu while inserting into relocation tree",
1278 list_add_tail(&root->root_list, &rc->reloc_roots);
1283 * helper to delete the 'address of tree root -> reloc tree'
1286 static void __del_reloc_root(struct btrfs_root *root)
1288 struct btrfs_fs_info *fs_info = root->fs_info;
1289 struct rb_node *rb_node;
1290 struct mapping_node *node = NULL;
1291 struct reloc_control *rc = fs_info->reloc_ctl;
1293 if (rc && root->node) {
1294 spin_lock(&rc->reloc_root_tree.lock);
1295 rb_node = tree_search(&rc->reloc_root_tree.rb_root,
1298 node = rb_entry(rb_node, struct mapping_node, rb_node);
1299 rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
1301 spin_unlock(&rc->reloc_root_tree.lock);
1304 BUG_ON((struct btrfs_root *)node->data != root);
1307 spin_lock(&fs_info->trans_lock);
1308 list_del_init(&root->root_list);
1309 spin_unlock(&fs_info->trans_lock);
1314 * helper to update the 'address of tree root -> reloc tree'
1317 static int __update_reloc_root(struct btrfs_root *root, u64 new_bytenr)
1319 struct btrfs_fs_info *fs_info = root->fs_info;
1320 struct rb_node *rb_node;
1321 struct mapping_node *node = NULL;
1322 struct reloc_control *rc = fs_info->reloc_ctl;
1324 spin_lock(&rc->reloc_root_tree.lock);
1325 rb_node = tree_search(&rc->reloc_root_tree.rb_root,
1328 node = rb_entry(rb_node, struct mapping_node, rb_node);
1329 rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
1331 spin_unlock(&rc->reloc_root_tree.lock);
1335 BUG_ON((struct btrfs_root *)node->data != root);
1337 spin_lock(&rc->reloc_root_tree.lock);
1338 node->bytenr = new_bytenr;
1339 rb_node = tree_insert(&rc->reloc_root_tree.rb_root,
1340 node->bytenr, &node->rb_node);
1341 spin_unlock(&rc->reloc_root_tree.lock);
1343 backref_tree_panic(rb_node, -EEXIST, node->bytenr);
1347 static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans,
1348 struct btrfs_root *root, u64 objectid)
1350 struct btrfs_fs_info *fs_info = root->fs_info;
1351 struct btrfs_root *reloc_root;
1352 struct extent_buffer *eb;
1353 struct btrfs_root_item *root_item;
1354 struct btrfs_key root_key;
1357 root_item = kmalloc(sizeof(*root_item), GFP_NOFS);
1360 root_key.objectid = BTRFS_TREE_RELOC_OBJECTID;
1361 root_key.type = BTRFS_ROOT_ITEM_KEY;
1362 root_key.offset = objectid;
1364 if (root->root_key.objectid == objectid) {
1365 u64 commit_root_gen;
1367 /* called by btrfs_init_reloc_root */
1368 ret = btrfs_copy_root(trans, root, root->commit_root, &eb,
1369 BTRFS_TREE_RELOC_OBJECTID);
1372 * Set the last_snapshot field to the generation of the commit
1373 * root - like this ctree.c:btrfs_block_can_be_shared() behaves
1374 * correctly (returns true) when the relocation root is created
1375 * either inside the critical section of a transaction commit
1376 * (through transaction.c:qgroup_account_snapshot()) and when
1377 * it's created before the transaction commit is started.
1379 commit_root_gen = btrfs_header_generation(root->commit_root);
1380 btrfs_set_root_last_snapshot(&root->root_item, commit_root_gen);
1383 * called by btrfs_reloc_post_snapshot_hook.
1384 * the source tree is a reloc tree, all tree blocks
1385 * modified after it was created have RELOC flag
1386 * set in their headers. so it's OK to not update
1387 * the 'last_snapshot'.
1389 ret = btrfs_copy_root(trans, root, root->node, &eb,
1390 BTRFS_TREE_RELOC_OBJECTID);
1394 memcpy(root_item, &root->root_item, sizeof(*root_item));
1395 btrfs_set_root_bytenr(root_item, eb->start);
1396 btrfs_set_root_level(root_item, btrfs_header_level(eb));
1397 btrfs_set_root_generation(root_item, trans->transid);
1399 if (root->root_key.objectid == objectid) {
1400 btrfs_set_root_refs(root_item, 0);
1401 memset(&root_item->drop_progress, 0,
1402 sizeof(struct btrfs_disk_key));
1403 root_item->drop_level = 0;
1406 btrfs_tree_unlock(eb);
1407 free_extent_buffer(eb);
1409 ret = btrfs_insert_root(trans, fs_info->tree_root,
1410 &root_key, root_item);
1414 reloc_root = btrfs_read_fs_root(fs_info->tree_root, &root_key);
1415 BUG_ON(IS_ERR(reloc_root));
1416 reloc_root->last_trans = trans->transid;
1421 * create reloc tree for a given fs tree. reloc tree is just a
1422 * snapshot of the fs tree with special root objectid.
1424 int btrfs_init_reloc_root(struct btrfs_trans_handle *trans,
1425 struct btrfs_root *root)
1427 struct btrfs_fs_info *fs_info = root->fs_info;
1428 struct btrfs_root *reloc_root;
1429 struct reloc_control *rc = fs_info->reloc_ctl;
1430 struct btrfs_block_rsv *rsv;
1434 if (root->reloc_root) {
1435 reloc_root = root->reloc_root;
1436 reloc_root->last_trans = trans->transid;
1440 if (!rc || !rc->create_reloc_tree ||
1441 root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID)
1444 if (!trans->reloc_reserved) {
1445 rsv = trans->block_rsv;
1446 trans->block_rsv = rc->block_rsv;
1449 reloc_root = create_reloc_root(trans, root, root->root_key.objectid);
1451 trans->block_rsv = rsv;
1453 ret = __add_reloc_root(reloc_root);
1455 root->reloc_root = reloc_root;
1460 * update root item of reloc tree
1462 int btrfs_update_reloc_root(struct btrfs_trans_handle *trans,
1463 struct btrfs_root *root)
1465 struct btrfs_fs_info *fs_info = root->fs_info;
1466 struct btrfs_root *reloc_root;
1467 struct btrfs_root_item *root_item;
1470 if (!root->reloc_root)
1473 reloc_root = root->reloc_root;
1474 root_item = &reloc_root->root_item;
1476 if (fs_info->reloc_ctl->merge_reloc_tree &&
1477 btrfs_root_refs(root_item) == 0) {
1478 root->reloc_root = NULL;
1479 __del_reloc_root(reloc_root);
1482 if (reloc_root->commit_root != reloc_root->node) {
1483 btrfs_set_root_node(root_item, reloc_root->node);
1484 free_extent_buffer(reloc_root->commit_root);
1485 reloc_root->commit_root = btrfs_root_node(reloc_root);
1488 ret = btrfs_update_root(trans, fs_info->tree_root,
1489 &reloc_root->root_key, root_item);
1497 * helper to find first cached inode with inode number >= objectid
1500 static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid)
1502 struct rb_node *node;
1503 struct rb_node *prev;
1504 struct btrfs_inode *entry;
1505 struct inode *inode;
1507 spin_lock(&root->inode_lock);
1509 node = root->inode_tree.rb_node;
1513 entry = rb_entry(node, struct btrfs_inode, rb_node);
1515 if (objectid < btrfs_ino(entry))
1516 node = node->rb_left;
1517 else if (objectid > btrfs_ino(entry))
1518 node = node->rb_right;
1524 entry = rb_entry(prev, struct btrfs_inode, rb_node);
1525 if (objectid <= btrfs_ino(entry)) {
1529 prev = rb_next(prev);
1533 entry = rb_entry(node, struct btrfs_inode, rb_node);
1534 inode = igrab(&entry->vfs_inode);
1536 spin_unlock(&root->inode_lock);
1540 objectid = btrfs_ino(entry) + 1;
1541 if (cond_resched_lock(&root->inode_lock))
1544 node = rb_next(node);
1546 spin_unlock(&root->inode_lock);
1550 static int in_block_group(u64 bytenr,
1551 struct btrfs_block_group_cache *block_group)
1553 if (bytenr >= block_group->key.objectid &&
1554 bytenr < block_group->key.objectid + block_group->key.offset)
1560 * get new location of data
1562 static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr,
1563 u64 bytenr, u64 num_bytes)
1565 struct btrfs_root *root = BTRFS_I(reloc_inode)->root;
1566 struct btrfs_path *path;
1567 struct btrfs_file_extent_item *fi;
1568 struct extent_buffer *leaf;
1571 path = btrfs_alloc_path();
1575 bytenr -= BTRFS_I(reloc_inode)->index_cnt;
1576 ret = btrfs_lookup_file_extent(NULL, root, path,
1577 btrfs_ino(BTRFS_I(reloc_inode)), bytenr, 0);
1585 leaf = path->nodes[0];
1586 fi = btrfs_item_ptr(leaf, path->slots[0],
1587 struct btrfs_file_extent_item);
1589 BUG_ON(btrfs_file_extent_offset(leaf, fi) ||
1590 btrfs_file_extent_compression(leaf, fi) ||
1591 btrfs_file_extent_encryption(leaf, fi) ||
1592 btrfs_file_extent_other_encoding(leaf, fi));
1594 if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) {
1599 *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1602 btrfs_free_path(path);
1607 * update file extent items in the tree leaf to point to
1608 * the new locations.
1610 static noinline_for_stack
1611 int replace_file_extents(struct btrfs_trans_handle *trans,
1612 struct reloc_control *rc,
1613 struct btrfs_root *root,
1614 struct extent_buffer *leaf)
1616 struct btrfs_fs_info *fs_info = root->fs_info;
1617 struct btrfs_key key;
1618 struct btrfs_file_extent_item *fi;
1619 struct inode *inode = NULL;
1631 if (rc->stage != UPDATE_DATA_PTRS)
1634 /* reloc trees always use full backref */
1635 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID)
1636 parent = leaf->start;
1640 nritems = btrfs_header_nritems(leaf);
1641 for (i = 0; i < nritems; i++) {
1643 btrfs_item_key_to_cpu(leaf, &key, i);
1644 if (key.type != BTRFS_EXTENT_DATA_KEY)
1646 fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item);
1647 if (btrfs_file_extent_type(leaf, fi) ==
1648 BTRFS_FILE_EXTENT_INLINE)
1650 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1651 num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi);
1654 if (!in_block_group(bytenr, rc->block_group))
1658 * if we are modifying block in fs tree, wait for readpage
1659 * to complete and drop the extent cache
1661 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) {
1663 inode = find_next_inode(root, key.objectid);
1665 } else if (inode && btrfs_ino(BTRFS_I(inode)) < key.objectid) {
1666 btrfs_add_delayed_iput(inode);
1667 inode = find_next_inode(root, key.objectid);
1669 if (inode && btrfs_ino(BTRFS_I(inode)) == key.objectid) {
1671 btrfs_file_extent_num_bytes(leaf, fi);
1672 WARN_ON(!IS_ALIGNED(key.offset,
1673 fs_info->sectorsize));
1674 WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize));
1676 ret = try_lock_extent(&BTRFS_I(inode)->io_tree,
1681 btrfs_drop_extent_cache(BTRFS_I(inode),
1682 key.offset, end, 1);
1683 unlock_extent(&BTRFS_I(inode)->io_tree,
1688 ret = get_new_location(rc->data_inode, &new_bytenr,
1692 * Don't have to abort since we've not changed anything
1693 * in the file extent yet.
1698 btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr);
1701 key.offset -= btrfs_file_extent_offset(leaf, fi);
1702 ret = btrfs_inc_extent_ref(trans, root, new_bytenr,
1704 btrfs_header_owner(leaf),
1705 key.objectid, key.offset);
1707 btrfs_abort_transaction(trans, ret);
1711 ret = btrfs_free_extent(trans, root, bytenr, num_bytes,
1712 parent, btrfs_header_owner(leaf),
1713 key.objectid, key.offset);
1715 btrfs_abort_transaction(trans, ret);
1720 btrfs_mark_buffer_dirty(leaf);
1722 btrfs_add_delayed_iput(inode);
1726 static noinline_for_stack
1727 int memcmp_node_keys(struct extent_buffer *eb, int slot,
1728 struct btrfs_path *path, int level)
1730 struct btrfs_disk_key key1;
1731 struct btrfs_disk_key key2;
1732 btrfs_node_key(eb, &key1, slot);
1733 btrfs_node_key(path->nodes[level], &key2, path->slots[level]);
1734 return memcmp(&key1, &key2, sizeof(key1));
1738 * try to replace tree blocks in fs tree with the new blocks
1739 * in reloc tree. tree blocks haven't been modified since the
1740 * reloc tree was create can be replaced.
1742 * if a block was replaced, level of the block + 1 is returned.
1743 * if no block got replaced, 0 is returned. if there are other
1744 * errors, a negative error number is returned.
1746 static noinline_for_stack
1747 int replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc,
1748 struct btrfs_root *dest, struct btrfs_root *src,
1749 struct btrfs_path *path, struct btrfs_key *next_key,
1750 int lowest_level, int max_level)
1752 struct btrfs_fs_info *fs_info = dest->fs_info;
1753 struct extent_buffer *eb;
1754 struct extent_buffer *parent;
1755 struct btrfs_key key;
1767 BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID);
1768 BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID);
1770 last_snapshot = btrfs_root_last_snapshot(&src->root_item);
1772 slot = path->slots[lowest_level];
1773 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot);
1775 eb = btrfs_lock_root_node(dest);
1776 btrfs_set_lock_blocking(eb);
1777 level = btrfs_header_level(eb);
1779 if (level < lowest_level) {
1780 btrfs_tree_unlock(eb);
1781 free_extent_buffer(eb);
1786 ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb);
1789 btrfs_set_lock_blocking(eb);
1792 next_key->objectid = (u64)-1;
1793 next_key->type = (u8)-1;
1794 next_key->offset = (u64)-1;
1799 struct btrfs_key first_key;
1801 level = btrfs_header_level(parent);
1802 BUG_ON(level < lowest_level);
1804 ret = btrfs_bin_search(parent, &key, level, &slot);
1805 if (ret && slot > 0)
1808 if (next_key && slot + 1 < btrfs_header_nritems(parent))
1809 btrfs_node_key_to_cpu(parent, next_key, slot + 1);
1811 old_bytenr = btrfs_node_blockptr(parent, slot);
1812 blocksize = fs_info->nodesize;
1813 old_ptr_gen = btrfs_node_ptr_generation(parent, slot);
1814 btrfs_node_key_to_cpu(parent, &first_key, slot);
1816 if (level <= max_level) {
1817 eb = path->nodes[level];
1818 new_bytenr = btrfs_node_blockptr(eb,
1819 path->slots[level]);
1820 new_ptr_gen = btrfs_node_ptr_generation(eb,
1821 path->slots[level]);
1827 if (WARN_ON(new_bytenr > 0 && new_bytenr == old_bytenr)) {
1832 if (new_bytenr == 0 || old_ptr_gen > last_snapshot ||
1833 memcmp_node_keys(parent, slot, path, level)) {
1834 if (level <= lowest_level) {
1839 eb = read_tree_block(fs_info, old_bytenr, old_ptr_gen,
1840 level - 1, &first_key);
1844 } else if (!extent_buffer_uptodate(eb)) {
1846 free_extent_buffer(eb);
1849 btrfs_tree_lock(eb);
1851 ret = btrfs_cow_block(trans, dest, eb, parent,
1855 btrfs_set_lock_blocking(eb);
1857 btrfs_tree_unlock(parent);
1858 free_extent_buffer(parent);
1865 btrfs_tree_unlock(parent);
1866 free_extent_buffer(parent);
1871 btrfs_node_key_to_cpu(path->nodes[level], &key,
1872 path->slots[level]);
1873 btrfs_release_path(path);
1875 path->lowest_level = level;
1876 ret = btrfs_search_slot(trans, src, &key, path, 0, 1);
1877 path->lowest_level = 0;
1881 * Info qgroup to trace both subtrees.
1883 * We must trace both trees.
1884 * 1) Tree reloc subtree
1885 * If not traced, we will leak data numbers
1887 * If not traced, we will double count old data
1888 * and tree block numbers, if current trans doesn't free
1889 * data reloc tree inode.
1891 ret = btrfs_qgroup_trace_subtree_swap(trans, rc->block_group,
1892 parent, slot, path->nodes[level],
1893 path->slots[level], last_snapshot);
1898 * swap blocks in fs tree and reloc tree.
1900 btrfs_set_node_blockptr(parent, slot, new_bytenr);
1901 btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen);
1902 btrfs_mark_buffer_dirty(parent);
1904 btrfs_set_node_blockptr(path->nodes[level],
1905 path->slots[level], old_bytenr);
1906 btrfs_set_node_ptr_generation(path->nodes[level],
1907 path->slots[level], old_ptr_gen);
1908 btrfs_mark_buffer_dirty(path->nodes[level]);
1910 ret = btrfs_inc_extent_ref(trans, src, old_bytenr,
1911 blocksize, path->nodes[level]->start,
1912 src->root_key.objectid, level - 1, 0);
1914 ret = btrfs_inc_extent_ref(trans, dest, new_bytenr,
1915 blocksize, 0, dest->root_key.objectid,
1919 ret = btrfs_free_extent(trans, src, new_bytenr, blocksize,
1920 path->nodes[level]->start,
1921 src->root_key.objectid, level - 1, 0);
1924 ret = btrfs_free_extent(trans, dest, old_bytenr, blocksize,
1925 0, dest->root_key.objectid, level - 1,
1929 btrfs_unlock_up_safe(path, 0);
1934 btrfs_tree_unlock(parent);
1935 free_extent_buffer(parent);
1940 * helper to find next relocated block in reloc tree
1942 static noinline_for_stack
1943 int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path,
1946 struct extent_buffer *eb;
1951 last_snapshot = btrfs_root_last_snapshot(&root->root_item);
1953 for (i = 0; i < *level; i++) {
1954 free_extent_buffer(path->nodes[i]);
1955 path->nodes[i] = NULL;
1958 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
1959 eb = path->nodes[i];
1960 nritems = btrfs_header_nritems(eb);
1961 while (path->slots[i] + 1 < nritems) {
1963 if (btrfs_node_ptr_generation(eb, path->slots[i]) <=
1970 free_extent_buffer(path->nodes[i]);
1971 path->nodes[i] = NULL;
1977 * walk down reloc tree to find relocated block of lowest level
1979 static noinline_for_stack
1980 int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path,
1983 struct btrfs_fs_info *fs_info = root->fs_info;
1984 struct extent_buffer *eb = NULL;
1991 last_snapshot = btrfs_root_last_snapshot(&root->root_item);
1993 for (i = *level; i > 0; i--) {
1994 struct btrfs_key first_key;
1996 eb = path->nodes[i];
1997 nritems = btrfs_header_nritems(eb);
1998 while (path->slots[i] < nritems) {
1999 ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]);
2000 if (ptr_gen > last_snapshot)
2004 if (path->slots[i] >= nritems) {
2015 bytenr = btrfs_node_blockptr(eb, path->slots[i]);
2016 btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]);
2017 eb = read_tree_block(fs_info, bytenr, ptr_gen, i - 1,
2021 } else if (!extent_buffer_uptodate(eb)) {
2022 free_extent_buffer(eb);
2025 BUG_ON(btrfs_header_level(eb) != i - 1);
2026 path->nodes[i - 1] = eb;
2027 path->slots[i - 1] = 0;
2033 * invalidate extent cache for file extents whose key in range of
2034 * [min_key, max_key)
2036 static int invalidate_extent_cache(struct btrfs_root *root,
2037 struct btrfs_key *min_key,
2038 struct btrfs_key *max_key)
2040 struct btrfs_fs_info *fs_info = root->fs_info;
2041 struct inode *inode = NULL;
2046 objectid = min_key->objectid;
2051 if (objectid > max_key->objectid)
2054 inode = find_next_inode(root, objectid);
2057 ino = btrfs_ino(BTRFS_I(inode));
2059 if (ino > max_key->objectid) {
2065 if (!S_ISREG(inode->i_mode))
2068 if (unlikely(min_key->objectid == ino)) {
2069 if (min_key->type > BTRFS_EXTENT_DATA_KEY)
2071 if (min_key->type < BTRFS_EXTENT_DATA_KEY)
2074 start = min_key->offset;
2075 WARN_ON(!IS_ALIGNED(start, fs_info->sectorsize));
2081 if (unlikely(max_key->objectid == ino)) {
2082 if (max_key->type < BTRFS_EXTENT_DATA_KEY)
2084 if (max_key->type > BTRFS_EXTENT_DATA_KEY) {
2087 if (max_key->offset == 0)
2089 end = max_key->offset;
2090 WARN_ON(!IS_ALIGNED(end, fs_info->sectorsize));
2097 /* the lock_extent waits for readpage to complete */
2098 lock_extent(&BTRFS_I(inode)->io_tree, start, end);
2099 btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 1);
2100 unlock_extent(&BTRFS_I(inode)->io_tree, start, end);
2105 static int find_next_key(struct btrfs_path *path, int level,
2106 struct btrfs_key *key)
2109 while (level < BTRFS_MAX_LEVEL) {
2110 if (!path->nodes[level])
2112 if (path->slots[level] + 1 <
2113 btrfs_header_nritems(path->nodes[level])) {
2114 btrfs_node_key_to_cpu(path->nodes[level], key,
2115 path->slots[level] + 1);
2124 * merge the relocated tree blocks in reloc tree with corresponding
2127 static noinline_for_stack int merge_reloc_root(struct reloc_control *rc,
2128 struct btrfs_root *root)
2130 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
2131 struct btrfs_key key;
2132 struct btrfs_key next_key;
2133 struct btrfs_trans_handle *trans = NULL;
2134 struct btrfs_root *reloc_root;
2135 struct btrfs_root_item *root_item;
2136 struct btrfs_path *path;
2137 struct extent_buffer *leaf;
2145 path = btrfs_alloc_path();
2148 path->reada = READA_FORWARD;
2150 reloc_root = root->reloc_root;
2151 root_item = &reloc_root->root_item;
2153 if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) {
2154 level = btrfs_root_level(root_item);
2155 extent_buffer_get(reloc_root->node);
2156 path->nodes[level] = reloc_root->node;
2157 path->slots[level] = 0;
2159 btrfs_disk_key_to_cpu(&key, &root_item->drop_progress);
2161 level = root_item->drop_level;
2163 path->lowest_level = level;
2164 ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0);
2165 path->lowest_level = 0;
2167 btrfs_free_path(path);
2171 btrfs_node_key_to_cpu(path->nodes[level], &next_key,
2172 path->slots[level]);
2173 WARN_ON(memcmp(&key, &next_key, sizeof(key)));
2175 btrfs_unlock_up_safe(path, 0);
2178 min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2;
2179 memset(&next_key, 0, sizeof(next_key));
2182 ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved,
2183 BTRFS_RESERVE_FLUSH_ALL);
2188 trans = btrfs_start_transaction(root, 0);
2189 if (IS_ERR(trans)) {
2190 err = PTR_ERR(trans);
2194 trans->block_rsv = rc->block_rsv;
2199 ret = walk_down_reloc_tree(reloc_root, path, &level);
2207 if (!find_next_key(path, level, &key) &&
2208 btrfs_comp_cpu_keys(&next_key, &key) >= 0) {
2211 ret = replace_path(trans, rc, root, reloc_root, path,
2212 &next_key, level, max_level);
2221 btrfs_node_key_to_cpu(path->nodes[level], &key,
2222 path->slots[level]);
2226 ret = walk_up_reloc_tree(reloc_root, path, &level);
2232 * save the merging progress in the drop_progress.
2233 * this is OK since root refs == 1 in this case.
2235 btrfs_node_key(path->nodes[level], &root_item->drop_progress,
2236 path->slots[level]);
2237 root_item->drop_level = level;
2239 btrfs_end_transaction_throttle(trans);
2242 btrfs_btree_balance_dirty(fs_info);
2244 if (replaced && rc->stage == UPDATE_DATA_PTRS)
2245 invalidate_extent_cache(root, &key, &next_key);
2249 * handle the case only one block in the fs tree need to be
2250 * relocated and the block is tree root.
2252 leaf = btrfs_lock_root_node(root);
2253 ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf);
2254 btrfs_tree_unlock(leaf);
2255 free_extent_buffer(leaf);
2259 btrfs_free_path(path);
2262 memset(&root_item->drop_progress, 0,
2263 sizeof(root_item->drop_progress));
2264 root_item->drop_level = 0;
2265 btrfs_set_root_refs(root_item, 0);
2266 btrfs_update_reloc_root(trans, root);
2270 btrfs_end_transaction_throttle(trans);
2272 btrfs_btree_balance_dirty(fs_info);
2274 if (replaced && rc->stage == UPDATE_DATA_PTRS)
2275 invalidate_extent_cache(root, &key, &next_key);
2280 static noinline_for_stack
2281 int prepare_to_merge(struct reloc_control *rc, int err)
2283 struct btrfs_root *root = rc->extent_root;
2284 struct btrfs_fs_info *fs_info = root->fs_info;
2285 struct btrfs_root *reloc_root;
2286 struct btrfs_trans_handle *trans;
2287 LIST_HEAD(reloc_roots);
2291 mutex_lock(&fs_info->reloc_mutex);
2292 rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2;
2293 rc->merging_rsv_size += rc->nodes_relocated * 2;
2294 mutex_unlock(&fs_info->reloc_mutex);
2298 num_bytes = rc->merging_rsv_size;
2299 ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes,
2300 BTRFS_RESERVE_FLUSH_ALL);
2305 trans = btrfs_join_transaction(rc->extent_root);
2306 if (IS_ERR(trans)) {
2308 btrfs_block_rsv_release(fs_info, rc->block_rsv,
2310 return PTR_ERR(trans);
2314 if (num_bytes != rc->merging_rsv_size) {
2315 btrfs_end_transaction(trans);
2316 btrfs_block_rsv_release(fs_info, rc->block_rsv,
2322 rc->merge_reloc_tree = 1;
2324 while (!list_empty(&rc->reloc_roots)) {
2325 reloc_root = list_entry(rc->reloc_roots.next,
2326 struct btrfs_root, root_list);
2327 list_del_init(&reloc_root->root_list);
2329 root = read_fs_root(fs_info, reloc_root->root_key.offset);
2330 BUG_ON(IS_ERR(root));
2331 BUG_ON(root->reloc_root != reloc_root);
2334 * set reference count to 1, so btrfs_recover_relocation
2335 * knows it should resumes merging
2338 btrfs_set_root_refs(&reloc_root->root_item, 1);
2339 btrfs_update_reloc_root(trans, root);
2341 list_add(&reloc_root->root_list, &reloc_roots);
2344 list_splice(&reloc_roots, &rc->reloc_roots);
2347 btrfs_commit_transaction(trans);
2349 btrfs_end_transaction(trans);
2353 static noinline_for_stack
2354 void free_reloc_roots(struct list_head *list)
2356 struct btrfs_root *reloc_root;
2358 while (!list_empty(list)) {
2359 reloc_root = list_entry(list->next, struct btrfs_root,
2361 __del_reloc_root(reloc_root);
2362 free_extent_buffer(reloc_root->node);
2363 free_extent_buffer(reloc_root->commit_root);
2364 reloc_root->node = NULL;
2365 reloc_root->commit_root = NULL;
2369 static noinline_for_stack
2370 void merge_reloc_roots(struct reloc_control *rc)
2372 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
2373 struct btrfs_root *root;
2374 struct btrfs_root *reloc_root;
2375 LIST_HEAD(reloc_roots);
2379 root = rc->extent_root;
2382 * this serializes us with btrfs_record_root_in_transaction,
2383 * we have to make sure nobody is in the middle of
2384 * adding their roots to the list while we are
2387 mutex_lock(&fs_info->reloc_mutex);
2388 list_splice_init(&rc->reloc_roots, &reloc_roots);
2389 mutex_unlock(&fs_info->reloc_mutex);
2391 while (!list_empty(&reloc_roots)) {
2393 reloc_root = list_entry(reloc_roots.next,
2394 struct btrfs_root, root_list);
2396 if (btrfs_root_refs(&reloc_root->root_item) > 0) {
2397 root = read_fs_root(fs_info,
2398 reloc_root->root_key.offset);
2399 BUG_ON(IS_ERR(root));
2400 BUG_ON(root->reloc_root != reloc_root);
2402 ret = merge_reloc_root(rc, root);
2404 if (list_empty(&reloc_root->root_list))
2405 list_add_tail(&reloc_root->root_list,
2410 list_del_init(&reloc_root->root_list);
2413 ret = btrfs_drop_snapshot(reloc_root, rc->block_rsv, 0, 1);
2415 if (list_empty(&reloc_root->root_list))
2416 list_add_tail(&reloc_root->root_list,
2428 btrfs_handle_fs_error(fs_info, ret, NULL);
2429 if (!list_empty(&reloc_roots))
2430 free_reloc_roots(&reloc_roots);
2432 /* new reloc root may be added */
2433 mutex_lock(&fs_info->reloc_mutex);
2434 list_splice_init(&rc->reloc_roots, &reloc_roots);
2435 mutex_unlock(&fs_info->reloc_mutex);
2436 if (!list_empty(&reloc_roots))
2437 free_reloc_roots(&reloc_roots);
2440 BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root));
2443 static void free_block_list(struct rb_root *blocks)
2445 struct tree_block *block;
2446 struct rb_node *rb_node;
2447 while ((rb_node = rb_first(blocks))) {
2448 block = rb_entry(rb_node, struct tree_block, rb_node);
2449 rb_erase(rb_node, blocks);
2454 static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans,
2455 struct btrfs_root *reloc_root)
2457 struct btrfs_fs_info *fs_info = reloc_root->fs_info;
2458 struct btrfs_root *root;
2460 if (reloc_root->last_trans == trans->transid)
2463 root = read_fs_root(fs_info, reloc_root->root_key.offset);
2464 BUG_ON(IS_ERR(root));
2465 BUG_ON(root->reloc_root != reloc_root);
2467 return btrfs_record_root_in_trans(trans, root);
2470 static noinline_for_stack
2471 struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans,
2472 struct reloc_control *rc,
2473 struct backref_node *node,
2474 struct backref_edge *edges[])
2476 struct backref_node *next;
2477 struct btrfs_root *root;
2483 next = walk_up_backref(next, edges, &index);
2486 BUG_ON(!test_bit(BTRFS_ROOT_REF_COWS, &root->state));
2488 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) {
2489 record_reloc_root_in_trans(trans, root);
2493 btrfs_record_root_in_trans(trans, root);
2494 root = root->reloc_root;
2496 if (next->new_bytenr != root->node->start) {
2497 BUG_ON(next->new_bytenr);
2498 BUG_ON(!list_empty(&next->list));
2499 next->new_bytenr = root->node->start;
2501 list_add_tail(&next->list,
2502 &rc->backref_cache.changed);
2503 __mark_block_processed(rc, next);
2509 next = walk_down_backref(edges, &index);
2510 if (!next || next->level <= node->level)
2517 /* setup backref node path for btrfs_reloc_cow_block */
2519 rc->backref_cache.path[next->level] = next;
2522 next = edges[index]->node[UPPER];
2528 * select a tree root for relocation. return NULL if the block
2529 * is reference counted. we should use do_relocation() in this
2530 * case. return a tree root pointer if the block isn't reference
2531 * counted. return -ENOENT if the block is root of reloc tree.
2533 static noinline_for_stack
2534 struct btrfs_root *select_one_root(struct backref_node *node)
2536 struct backref_node *next;
2537 struct btrfs_root *root;
2538 struct btrfs_root *fs_root = NULL;
2539 struct backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2545 next = walk_up_backref(next, edges, &index);
2549 /* no other choice for non-references counted tree */
2550 if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state))
2553 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID)
2559 next = walk_down_backref(edges, &index);
2560 if (!next || next->level <= node->level)
2565 return ERR_PTR(-ENOENT);
2569 static noinline_for_stack
2570 u64 calcu_metadata_size(struct reloc_control *rc,
2571 struct backref_node *node, int reserve)
2573 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
2574 struct backref_node *next = node;
2575 struct backref_edge *edge;
2576 struct backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2580 BUG_ON(reserve && node->processed);
2585 if (next->processed && (reserve || next != node))
2588 num_bytes += fs_info->nodesize;
2590 if (list_empty(&next->upper))
2593 edge = list_entry(next->upper.next,
2594 struct backref_edge, list[LOWER]);
2595 edges[index++] = edge;
2596 next = edge->node[UPPER];
2598 next = walk_down_backref(edges, &index);
2603 static int reserve_metadata_space(struct btrfs_trans_handle *trans,
2604 struct reloc_control *rc,
2605 struct backref_node *node)
2607 struct btrfs_root *root = rc->extent_root;
2608 struct btrfs_fs_info *fs_info = root->fs_info;
2613 num_bytes = calcu_metadata_size(rc, node, 1) * 2;
2615 trans->block_rsv = rc->block_rsv;
2616 rc->reserved_bytes += num_bytes;
2619 * We are under a transaction here so we can only do limited flushing.
2620 * If we get an enospc just kick back -EAGAIN so we know to drop the
2621 * transaction and try to refill when we can flush all the things.
2623 ret = btrfs_block_rsv_refill(root, rc->block_rsv, num_bytes,
2624 BTRFS_RESERVE_FLUSH_LIMIT);
2626 tmp = fs_info->nodesize * RELOCATION_RESERVED_NODES;
2627 while (tmp <= rc->reserved_bytes)
2630 * only one thread can access block_rsv at this point,
2631 * so we don't need hold lock to protect block_rsv.
2632 * we expand more reservation size here to allow enough
2633 * space for relocation and we will return earlier in
2636 rc->block_rsv->size = tmp + fs_info->nodesize *
2637 RELOCATION_RESERVED_NODES;
2645 * relocate a block tree, and then update pointers in upper level
2646 * blocks that reference the block to point to the new location.
2648 * if called by link_to_upper, the block has already been relocated.
2649 * in that case this function just updates pointers.
2651 static int do_relocation(struct btrfs_trans_handle *trans,
2652 struct reloc_control *rc,
2653 struct backref_node *node,
2654 struct btrfs_key *key,
2655 struct btrfs_path *path, int lowest)
2657 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
2658 struct backref_node *upper;
2659 struct backref_edge *edge;
2660 struct backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2661 struct btrfs_root *root;
2662 struct extent_buffer *eb;
2670 BUG_ON(lowest && node->eb);
2672 path->lowest_level = node->level + 1;
2673 rc->backref_cache.path[node->level] = node;
2674 list_for_each_entry(edge, &node->upper, list[LOWER]) {
2675 struct btrfs_key first_key;
2679 upper = edge->node[UPPER];
2680 root = select_reloc_root(trans, rc, upper, edges);
2683 if (upper->eb && !upper->locked) {
2685 ret = btrfs_bin_search(upper->eb, key,
2686 upper->level, &slot);
2688 bytenr = btrfs_node_blockptr(upper->eb, slot);
2689 if (node->eb->start == bytenr)
2692 drop_node_buffer(upper);
2696 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
2703 btrfs_release_path(path);
2708 upper->eb = path->nodes[upper->level];
2709 path->nodes[upper->level] = NULL;
2711 BUG_ON(upper->eb != path->nodes[upper->level]);
2715 path->locks[upper->level] = 0;
2717 slot = path->slots[upper->level];
2718 btrfs_release_path(path);
2720 ret = btrfs_bin_search(upper->eb, key, upper->level,
2725 bytenr = btrfs_node_blockptr(upper->eb, slot);
2727 if (bytenr != node->bytenr) {
2728 btrfs_err(root->fs_info,
2729 "lowest leaf/node mismatch: bytenr %llu node->bytenr %llu slot %d upper %llu",
2730 bytenr, node->bytenr, slot,
2736 if (node->eb->start == bytenr)
2740 blocksize = root->fs_info->nodesize;
2741 generation = btrfs_node_ptr_generation(upper->eb, slot);
2742 btrfs_node_key_to_cpu(upper->eb, &first_key, slot);
2743 eb = read_tree_block(fs_info, bytenr, generation,
2744 upper->level - 1, &first_key);
2748 } else if (!extent_buffer_uptodate(eb)) {
2749 free_extent_buffer(eb);
2753 btrfs_tree_lock(eb);
2754 btrfs_set_lock_blocking(eb);
2757 ret = btrfs_cow_block(trans, root, eb, upper->eb,
2759 btrfs_tree_unlock(eb);
2760 free_extent_buffer(eb);
2765 BUG_ON(node->eb != eb);
2767 btrfs_set_node_blockptr(upper->eb, slot,
2769 btrfs_set_node_ptr_generation(upper->eb, slot,
2771 btrfs_mark_buffer_dirty(upper->eb);
2773 ret = btrfs_inc_extent_ref(trans, root,
2774 node->eb->start, blocksize,
2776 btrfs_header_owner(upper->eb),
2780 ret = btrfs_drop_subtree(trans, root, eb, upper->eb);
2784 if (!upper->pending)
2785 drop_node_buffer(upper);
2787 unlock_node_buffer(upper);
2792 if (!err && node->pending) {
2793 drop_node_buffer(node);
2794 list_move_tail(&node->list, &rc->backref_cache.changed);
2798 path->lowest_level = 0;
2799 BUG_ON(err == -ENOSPC);
2803 static int link_to_upper(struct btrfs_trans_handle *trans,
2804 struct reloc_control *rc,
2805 struct backref_node *node,
2806 struct btrfs_path *path)
2808 struct btrfs_key key;
2810 btrfs_node_key_to_cpu(node->eb, &key, 0);
2811 return do_relocation(trans, rc, node, &key, path, 0);
2814 static int finish_pending_nodes(struct btrfs_trans_handle *trans,
2815 struct reloc_control *rc,
2816 struct btrfs_path *path, int err)
2819 struct backref_cache *cache = &rc->backref_cache;
2820 struct backref_node *node;
2824 for (level = 0; level < BTRFS_MAX_LEVEL; level++) {
2825 while (!list_empty(&cache->pending[level])) {
2826 node = list_entry(cache->pending[level].next,
2827 struct backref_node, list);
2828 list_move_tail(&node->list, &list);
2829 BUG_ON(!node->pending);
2832 ret = link_to_upper(trans, rc, node, path);
2837 list_splice_init(&list, &cache->pending[level]);
2842 static void mark_block_processed(struct reloc_control *rc,
2843 u64 bytenr, u32 blocksize)
2845 set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1,
2849 static void __mark_block_processed(struct reloc_control *rc,
2850 struct backref_node *node)
2853 if (node->level == 0 ||
2854 in_block_group(node->bytenr, rc->block_group)) {
2855 blocksize = rc->extent_root->fs_info->nodesize;
2856 mark_block_processed(rc, node->bytenr, blocksize);
2858 node->processed = 1;
2862 * mark a block and all blocks directly/indirectly reference the block
2865 static void update_processed_blocks(struct reloc_control *rc,
2866 struct backref_node *node)
2868 struct backref_node *next = node;
2869 struct backref_edge *edge;
2870 struct backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2876 if (next->processed)
2879 __mark_block_processed(rc, next);
2881 if (list_empty(&next->upper))
2884 edge = list_entry(next->upper.next,
2885 struct backref_edge, list[LOWER]);
2886 edges[index++] = edge;
2887 next = edge->node[UPPER];
2889 next = walk_down_backref(edges, &index);
2893 static int tree_block_processed(u64 bytenr, struct reloc_control *rc)
2895 u32 blocksize = rc->extent_root->fs_info->nodesize;
2897 if (test_range_bit(&rc->processed_blocks, bytenr,
2898 bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL))
2903 static int get_tree_block_key(struct btrfs_fs_info *fs_info,
2904 struct tree_block *block)
2906 struct extent_buffer *eb;
2908 BUG_ON(block->key_ready);
2909 eb = read_tree_block(fs_info, block->bytenr, block->key.offset,
2910 block->level, NULL);
2913 } else if (!extent_buffer_uptodate(eb)) {
2914 free_extent_buffer(eb);
2917 if (block->level == 0)
2918 btrfs_item_key_to_cpu(eb, &block->key, 0);
2920 btrfs_node_key_to_cpu(eb, &block->key, 0);
2921 free_extent_buffer(eb);
2922 block->key_ready = 1;
2927 * helper function to relocate a tree block
2929 static int relocate_tree_block(struct btrfs_trans_handle *trans,
2930 struct reloc_control *rc,
2931 struct backref_node *node,
2932 struct btrfs_key *key,
2933 struct btrfs_path *path)
2935 struct btrfs_root *root;
2941 BUG_ON(node->processed);
2942 root = select_one_root(node);
2943 if (root == ERR_PTR(-ENOENT)) {
2944 update_processed_blocks(rc, node);
2948 if (!root || test_bit(BTRFS_ROOT_REF_COWS, &root->state)) {
2949 ret = reserve_metadata_space(trans, rc, node);
2955 if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) {
2956 BUG_ON(node->new_bytenr);
2957 BUG_ON(!list_empty(&node->list));
2958 btrfs_record_root_in_trans(trans, root);
2959 root = root->reloc_root;
2960 node->new_bytenr = root->node->start;
2962 list_add_tail(&node->list, &rc->backref_cache.changed);
2964 path->lowest_level = node->level;
2965 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
2966 btrfs_release_path(path);
2971 update_processed_blocks(rc, node);
2973 ret = do_relocation(trans, rc, node, key, path, 1);
2976 if (ret || node->level == 0 || node->cowonly)
2977 remove_backref_node(&rc->backref_cache, node);
2982 * relocate a list of blocks
2984 static noinline_for_stack
2985 int relocate_tree_blocks(struct btrfs_trans_handle *trans,
2986 struct reloc_control *rc, struct rb_root *blocks)
2988 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
2989 struct backref_node *node;
2990 struct btrfs_path *path;
2991 struct tree_block *block;
2992 struct tree_block *next;
2996 path = btrfs_alloc_path();
2999 goto out_free_blocks;
3002 /* Kick in readahead for tree blocks with missing keys */
3003 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
3004 if (!block->key_ready)
3005 readahead_tree_block(fs_info, block->bytenr);
3008 /* Get first keys */
3009 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
3010 if (!block->key_ready) {
3011 err = get_tree_block_key(fs_info, block);
3017 /* Do tree relocation */
3018 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
3019 node = build_backref_tree(rc, &block->key,
3020 block->level, block->bytenr);
3022 err = PTR_ERR(node);
3026 ret = relocate_tree_block(trans, rc, node, &block->key,
3029 if (ret != -EAGAIN || &block->rb_node == rb_first(blocks))
3035 err = finish_pending_nodes(trans, rc, path, err);
3038 btrfs_free_path(path);
3040 free_block_list(blocks);
3044 static noinline_for_stack
3045 int prealloc_file_extent_cluster(struct inode *inode,
3046 struct file_extent_cluster *cluster)
3051 u64 offset = BTRFS_I(inode)->index_cnt;
3055 u64 prealloc_start = cluster->start - offset;
3056 u64 prealloc_end = cluster->end - offset;
3058 struct extent_changeset *data_reserved = NULL;
3060 BUG_ON(cluster->start != cluster->boundary[0]);
3063 ret = btrfs_check_data_free_space(inode, &data_reserved, prealloc_start,
3064 prealloc_end + 1 - prealloc_start);
3068 cur_offset = prealloc_start;
3069 while (nr < cluster->nr) {
3070 start = cluster->boundary[nr] - offset;
3071 if (nr + 1 < cluster->nr)
3072 end = cluster->boundary[nr + 1] - 1 - offset;
3074 end = cluster->end - offset;
3076 lock_extent(&BTRFS_I(inode)->io_tree, start, end);
3077 num_bytes = end + 1 - start;
3078 if (cur_offset < start)
3079 btrfs_free_reserved_data_space(inode, data_reserved,
3080 cur_offset, start - cur_offset);
3081 ret = btrfs_prealloc_file_range(inode, 0, start,
3082 num_bytes, num_bytes,
3083 end + 1, &alloc_hint);
3084 cur_offset = end + 1;
3085 unlock_extent(&BTRFS_I(inode)->io_tree, start, end);
3090 if (cur_offset < prealloc_end)
3091 btrfs_free_reserved_data_space(inode, data_reserved,
3092 cur_offset, prealloc_end + 1 - cur_offset);
3094 inode_unlock(inode);
3095 extent_changeset_free(data_reserved);
3099 static noinline_for_stack
3100 int setup_extent_mapping(struct inode *inode, u64 start, u64 end,
3103 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3104 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
3105 struct extent_map *em;
3108 em = alloc_extent_map();
3113 em->len = end + 1 - start;
3114 em->block_len = em->len;
3115 em->block_start = block_start;
3116 em->bdev = fs_info->fs_devices->latest_bdev;
3117 set_bit(EXTENT_FLAG_PINNED, &em->flags);
3119 lock_extent(&BTRFS_I(inode)->io_tree, start, end);
3121 write_lock(&em_tree->lock);
3122 ret = add_extent_mapping(em_tree, em, 0);
3123 write_unlock(&em_tree->lock);
3124 if (ret != -EEXIST) {
3125 free_extent_map(em);
3128 btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0);
3130 unlock_extent(&BTRFS_I(inode)->io_tree, start, end);
3134 static int relocate_file_extent_cluster(struct inode *inode,
3135 struct file_extent_cluster *cluster)
3137 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3140 u64 offset = BTRFS_I(inode)->index_cnt;
3141 unsigned long index;
3142 unsigned long last_index;
3144 struct file_ra_state *ra;
3145 gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping);
3152 ra = kzalloc(sizeof(*ra), GFP_NOFS);
3156 ret = prealloc_file_extent_cluster(inode, cluster);
3160 file_ra_state_init(ra, inode->i_mapping);
3162 ret = setup_extent_mapping(inode, cluster->start - offset,
3163 cluster->end - offset, cluster->start);
3167 index = (cluster->start - offset) >> PAGE_SHIFT;
3168 last_index = (cluster->end - offset) >> PAGE_SHIFT;
3169 while (index <= last_index) {
3170 ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode),
3175 page = find_lock_page(inode->i_mapping, index);
3177 page_cache_sync_readahead(inode->i_mapping,
3179 last_index + 1 - index);
3180 page = find_or_create_page(inode->i_mapping, index,
3183 btrfs_delalloc_release_metadata(BTRFS_I(inode),
3190 if (PageReadahead(page)) {
3191 page_cache_async_readahead(inode->i_mapping,
3192 ra, NULL, page, index,
3193 last_index + 1 - index);
3196 if (!PageUptodate(page)) {
3197 btrfs_readpage(NULL, page);
3199 if (!PageUptodate(page)) {
3202 btrfs_delalloc_release_metadata(BTRFS_I(inode),
3204 btrfs_delalloc_release_extents(BTRFS_I(inode),
3211 page_start = page_offset(page);
3212 page_end = page_start + PAGE_SIZE - 1;
3214 lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end);
3216 set_page_extent_mapped(page);
3218 if (nr < cluster->nr &&
3219 page_start + offset == cluster->boundary[nr]) {
3220 set_extent_bits(&BTRFS_I(inode)->io_tree,
3221 page_start, page_end,
3226 ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0,
3231 btrfs_delalloc_release_metadata(BTRFS_I(inode),
3233 btrfs_delalloc_release_extents(BTRFS_I(inode),
3236 clear_extent_bits(&BTRFS_I(inode)->io_tree,
3237 page_start, page_end,
3238 EXTENT_LOCKED | EXTENT_BOUNDARY);
3242 set_page_dirty(page);
3244 unlock_extent(&BTRFS_I(inode)->io_tree,
3245 page_start, page_end);
3250 btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE,
3252 balance_dirty_pages_ratelimited(inode->i_mapping);
3253 btrfs_throttle(fs_info);
3255 WARN_ON(nr != cluster->nr);
3261 static noinline_for_stack
3262 int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key,
3263 struct file_extent_cluster *cluster)
3267 if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) {
3268 ret = relocate_file_extent_cluster(inode, cluster);
3275 cluster->start = extent_key->objectid;
3277 BUG_ON(cluster->nr >= MAX_EXTENTS);
3278 cluster->end = extent_key->objectid + extent_key->offset - 1;
3279 cluster->boundary[cluster->nr] = extent_key->objectid;
3282 if (cluster->nr >= MAX_EXTENTS) {
3283 ret = relocate_file_extent_cluster(inode, cluster);
3292 * helper to add a tree block to the list.
3293 * the major work is getting the generation and level of the block
3295 static int add_tree_block(struct reloc_control *rc,
3296 struct btrfs_key *extent_key,
3297 struct btrfs_path *path,
3298 struct rb_root *blocks)
3300 struct extent_buffer *eb;
3301 struct btrfs_extent_item *ei;
3302 struct btrfs_tree_block_info *bi;
3303 struct tree_block *block;
3304 struct rb_node *rb_node;
3309 eb = path->nodes[0];
3310 item_size = btrfs_item_size_nr(eb, path->slots[0]);
3312 if (extent_key->type == BTRFS_METADATA_ITEM_KEY ||
3313 item_size >= sizeof(*ei) + sizeof(*bi)) {
3314 ei = btrfs_item_ptr(eb, path->slots[0],
3315 struct btrfs_extent_item);
3316 if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) {
3317 bi = (struct btrfs_tree_block_info *)(ei + 1);
3318 level = btrfs_tree_block_level(eb, bi);
3320 level = (int)extent_key->offset;
3322 generation = btrfs_extent_generation(eb, ei);
3323 } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) {
3324 btrfs_print_v0_err(eb->fs_info);
3325 btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL);
3331 btrfs_release_path(path);
3333 BUG_ON(level == -1);
3335 block = kmalloc(sizeof(*block), GFP_NOFS);
3339 block->bytenr = extent_key->objectid;
3340 block->key.objectid = rc->extent_root->fs_info->nodesize;
3341 block->key.offset = generation;
3342 block->level = level;
3343 block->key_ready = 0;
3345 rb_node = tree_insert(blocks, block->bytenr, &block->rb_node);
3347 backref_tree_panic(rb_node, -EEXIST, block->bytenr);
3353 * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY
3355 static int __add_tree_block(struct reloc_control *rc,
3356 u64 bytenr, u32 blocksize,
3357 struct rb_root *blocks)
3359 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
3360 struct btrfs_path *path;
3361 struct btrfs_key key;
3363 bool skinny = btrfs_fs_incompat(fs_info, SKINNY_METADATA);
3365 if (tree_block_processed(bytenr, rc))
3368 if (tree_search(blocks, bytenr))
3371 path = btrfs_alloc_path();
3375 key.objectid = bytenr;
3377 key.type = BTRFS_METADATA_ITEM_KEY;
3378 key.offset = (u64)-1;
3380 key.type = BTRFS_EXTENT_ITEM_KEY;
3381 key.offset = blocksize;
3384 path->search_commit_root = 1;
3385 path->skip_locking = 1;
3386 ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0);
3390 if (ret > 0 && skinny) {
3391 if (path->slots[0]) {
3393 btrfs_item_key_to_cpu(path->nodes[0], &key,
3395 if (key.objectid == bytenr &&
3396 (key.type == BTRFS_METADATA_ITEM_KEY ||
3397 (key.type == BTRFS_EXTENT_ITEM_KEY &&
3398 key.offset == blocksize)))
3404 btrfs_release_path(path);
3410 btrfs_print_leaf(path->nodes[0]);
3412 "tree block extent item (%llu) is not found in extent tree",
3419 ret = add_tree_block(rc, &key, path, blocks);
3421 btrfs_free_path(path);
3426 * helper to check if the block use full backrefs for pointers in it
3428 static int block_use_full_backref(struct reloc_control *rc,
3429 struct extent_buffer *eb)
3434 if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) ||
3435 btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV)
3438 ret = btrfs_lookup_extent_info(NULL, rc->extent_root->fs_info,
3439 eb->start, btrfs_header_level(eb), 1,
3443 if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)
3450 static int delete_block_group_cache(struct btrfs_fs_info *fs_info,
3451 struct btrfs_block_group_cache *block_group,
3452 struct inode *inode,
3455 struct btrfs_key key;
3456 struct btrfs_root *root = fs_info->tree_root;
3457 struct btrfs_trans_handle *trans;
3464 key.type = BTRFS_INODE_ITEM_KEY;
3467 inode = btrfs_iget(fs_info->sb, &key, root, NULL);
3472 ret = btrfs_check_trunc_cache_free_space(fs_info,
3473 &fs_info->global_block_rsv);
3477 trans = btrfs_join_transaction(root);
3478 if (IS_ERR(trans)) {
3479 ret = PTR_ERR(trans);
3483 ret = btrfs_truncate_free_space_cache(trans, block_group, inode);
3485 btrfs_end_transaction(trans);
3486 btrfs_btree_balance_dirty(fs_info);
3493 * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY
3494 * this function scans fs tree to find blocks reference the data extent
3496 static int find_data_references(struct reloc_control *rc,
3497 struct btrfs_key *extent_key,
3498 struct extent_buffer *leaf,
3499 struct btrfs_extent_data_ref *ref,
3500 struct rb_root *blocks)
3502 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
3503 struct btrfs_path *path;
3504 struct tree_block *block;
3505 struct btrfs_root *root;
3506 struct btrfs_file_extent_item *fi;
3507 struct rb_node *rb_node;
3508 struct btrfs_key key;
3519 ref_root = btrfs_extent_data_ref_root(leaf, ref);
3520 ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref);
3521 ref_offset = btrfs_extent_data_ref_offset(leaf, ref);
3522 ref_count = btrfs_extent_data_ref_count(leaf, ref);
3525 * This is an extent belonging to the free space cache, lets just delete
3526 * it and redo the search.
3528 if (ref_root == BTRFS_ROOT_TREE_OBJECTID) {
3529 ret = delete_block_group_cache(fs_info, rc->block_group,
3530 NULL, ref_objectid);
3536 path = btrfs_alloc_path();
3539 path->reada = READA_FORWARD;
3541 root = read_fs_root(fs_info, ref_root);
3543 err = PTR_ERR(root);
3547 key.objectid = ref_objectid;
3548 key.type = BTRFS_EXTENT_DATA_KEY;
3549 if (ref_offset > ((u64)-1 << 32))
3552 key.offset = ref_offset;
3554 path->search_commit_root = 1;
3555 path->skip_locking = 1;
3556 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
3562 leaf = path->nodes[0];
3563 nritems = btrfs_header_nritems(leaf);
3565 * the references in tree blocks that use full backrefs
3566 * are not counted in
3568 if (block_use_full_backref(rc, leaf))
3572 rb_node = tree_search(blocks, leaf->start);
3577 path->slots[0] = nritems;
3580 while (ref_count > 0) {
3581 while (path->slots[0] >= nritems) {
3582 ret = btrfs_next_leaf(root, path);
3587 if (WARN_ON(ret > 0))
3590 leaf = path->nodes[0];
3591 nritems = btrfs_header_nritems(leaf);
3594 if (block_use_full_backref(rc, leaf))
3598 rb_node = tree_search(blocks, leaf->start);
3603 path->slots[0] = nritems;
3607 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3608 if (WARN_ON(key.objectid != ref_objectid ||
3609 key.type != BTRFS_EXTENT_DATA_KEY))
3612 fi = btrfs_item_ptr(leaf, path->slots[0],
3613 struct btrfs_file_extent_item);
3615 if (btrfs_file_extent_type(leaf, fi) ==
3616 BTRFS_FILE_EXTENT_INLINE)
3619 if (btrfs_file_extent_disk_bytenr(leaf, fi) !=
3620 extent_key->objectid)
3623 key.offset -= btrfs_file_extent_offset(leaf, fi);
3624 if (key.offset != ref_offset)
3632 if (!tree_block_processed(leaf->start, rc)) {
3633 block = kmalloc(sizeof(*block), GFP_NOFS);
3638 block->bytenr = leaf->start;
3639 btrfs_item_key_to_cpu(leaf, &block->key, 0);
3641 block->key_ready = 1;
3642 rb_node = tree_insert(blocks, block->bytenr,
3645 backref_tree_panic(rb_node, -EEXIST,
3651 path->slots[0] = nritems;
3657 btrfs_free_path(path);
3662 * helper to find all tree blocks that reference a given data extent
3664 static noinline_for_stack
3665 int add_data_references(struct reloc_control *rc,
3666 struct btrfs_key *extent_key,
3667 struct btrfs_path *path,
3668 struct rb_root *blocks)
3670 struct btrfs_key key;
3671 struct extent_buffer *eb;
3672 struct btrfs_extent_data_ref *dref;
3673 struct btrfs_extent_inline_ref *iref;
3676 u32 blocksize = rc->extent_root->fs_info->nodesize;
3680 eb = path->nodes[0];
3681 ptr = btrfs_item_ptr_offset(eb, path->slots[0]);
3682 end = ptr + btrfs_item_size_nr(eb, path->slots[0]);
3683 ptr += sizeof(struct btrfs_extent_item);
3686 iref = (struct btrfs_extent_inline_ref *)ptr;
3687 key.type = btrfs_get_extent_inline_ref_type(eb, iref,
3688 BTRFS_REF_TYPE_DATA);
3689 if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
3690 key.offset = btrfs_extent_inline_ref_offset(eb, iref);
3691 ret = __add_tree_block(rc, key.offset, blocksize,
3693 } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
3694 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
3695 ret = find_data_references(rc, extent_key,
3699 btrfs_err(rc->extent_root->fs_info,
3700 "extent %llu slot %d has an invalid inline ref type",
3701 eb->start, path->slots[0]);
3707 ptr += btrfs_extent_inline_ref_size(key.type);
3713 eb = path->nodes[0];
3714 if (path->slots[0] >= btrfs_header_nritems(eb)) {
3715 ret = btrfs_next_leaf(rc->extent_root, path);
3722 eb = path->nodes[0];
3725 btrfs_item_key_to_cpu(eb, &key, path->slots[0]);
3726 if (key.objectid != extent_key->objectid)
3729 if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
3730 ret = __add_tree_block(rc, key.offset, blocksize,
3732 } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
3733 dref = btrfs_item_ptr(eb, path->slots[0],
3734 struct btrfs_extent_data_ref);
3735 ret = find_data_references(rc, extent_key,
3737 } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) {
3738 btrfs_print_v0_err(eb->fs_info);
3739 btrfs_handle_fs_error(eb->fs_info, -EINVAL, NULL);
3751 btrfs_release_path(path);
3753 free_block_list(blocks);
3758 * helper to find next unprocessed extent
3760 static noinline_for_stack
3761 int find_next_extent(struct reloc_control *rc, struct btrfs_path *path,
3762 struct btrfs_key *extent_key)
3764 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
3765 struct btrfs_key key;
3766 struct extent_buffer *leaf;
3767 u64 start, end, last;
3770 last = rc->block_group->key.objectid + rc->block_group->key.offset;
3773 if (rc->search_start >= last) {
3778 key.objectid = rc->search_start;
3779 key.type = BTRFS_EXTENT_ITEM_KEY;
3782 path->search_commit_root = 1;
3783 path->skip_locking = 1;
3784 ret = btrfs_search_slot(NULL, rc->extent_root, &key, path,
3789 leaf = path->nodes[0];
3790 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
3791 ret = btrfs_next_leaf(rc->extent_root, path);
3794 leaf = path->nodes[0];
3797 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3798 if (key.objectid >= last) {
3803 if (key.type != BTRFS_EXTENT_ITEM_KEY &&
3804 key.type != BTRFS_METADATA_ITEM_KEY) {
3809 if (key.type == BTRFS_EXTENT_ITEM_KEY &&
3810 key.objectid + key.offset <= rc->search_start) {
3815 if (key.type == BTRFS_METADATA_ITEM_KEY &&
3816 key.objectid + fs_info->nodesize <=
3822 ret = find_first_extent_bit(&rc->processed_blocks,
3823 key.objectid, &start, &end,
3824 EXTENT_DIRTY, NULL);
3826 if (ret == 0 && start <= key.objectid) {
3827 btrfs_release_path(path);
3828 rc->search_start = end + 1;
3830 if (key.type == BTRFS_EXTENT_ITEM_KEY)
3831 rc->search_start = key.objectid + key.offset;
3833 rc->search_start = key.objectid +
3835 memcpy(extent_key, &key, sizeof(key));
3839 btrfs_release_path(path);
3843 static void set_reloc_control(struct reloc_control *rc)
3845 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
3847 mutex_lock(&fs_info->reloc_mutex);
3848 fs_info->reloc_ctl = rc;
3849 mutex_unlock(&fs_info->reloc_mutex);
3852 static void unset_reloc_control(struct reloc_control *rc)
3854 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
3856 mutex_lock(&fs_info->reloc_mutex);
3857 fs_info->reloc_ctl = NULL;
3858 mutex_unlock(&fs_info->reloc_mutex);
3861 static int check_extent_flags(u64 flags)
3863 if ((flags & BTRFS_EXTENT_FLAG_DATA) &&
3864 (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK))
3866 if (!(flags & BTRFS_EXTENT_FLAG_DATA) &&
3867 !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK))
3869 if ((flags & BTRFS_EXTENT_FLAG_DATA) &&
3870 (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF))
3875 static noinline_for_stack
3876 int prepare_to_relocate(struct reloc_control *rc)
3878 struct btrfs_trans_handle *trans;
3881 rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root->fs_info,
3882 BTRFS_BLOCK_RSV_TEMP);
3886 memset(&rc->cluster, 0, sizeof(rc->cluster));
3887 rc->search_start = rc->block_group->key.objectid;
3888 rc->extents_found = 0;
3889 rc->nodes_relocated = 0;
3890 rc->merging_rsv_size = 0;
3891 rc->reserved_bytes = 0;
3892 rc->block_rsv->size = rc->extent_root->fs_info->nodesize *
3893 RELOCATION_RESERVED_NODES;
3894 ret = btrfs_block_rsv_refill(rc->extent_root,
3895 rc->block_rsv, rc->block_rsv->size,
3896 BTRFS_RESERVE_FLUSH_ALL);
3900 rc->create_reloc_tree = 1;
3901 set_reloc_control(rc);
3903 trans = btrfs_join_transaction(rc->extent_root);
3904 if (IS_ERR(trans)) {
3905 unset_reloc_control(rc);
3907 * extent tree is not a ref_cow tree and has no reloc_root to
3908 * cleanup. And callers are responsible to free the above
3911 return PTR_ERR(trans);
3913 btrfs_commit_transaction(trans);
3917 static noinline_for_stack int relocate_block_group(struct reloc_control *rc)
3919 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
3920 struct rb_root blocks = RB_ROOT;
3921 struct btrfs_key key;
3922 struct btrfs_trans_handle *trans = NULL;
3923 struct btrfs_path *path;
3924 struct btrfs_extent_item *ei;
3931 path = btrfs_alloc_path();
3934 path->reada = READA_FORWARD;
3936 ret = prepare_to_relocate(rc);
3943 rc->reserved_bytes = 0;
3944 ret = btrfs_block_rsv_refill(rc->extent_root,
3945 rc->block_rsv, rc->block_rsv->size,
3946 BTRFS_RESERVE_FLUSH_ALL);
3952 trans = btrfs_start_transaction(rc->extent_root, 0);
3953 if (IS_ERR(trans)) {
3954 err = PTR_ERR(trans);
3959 if (update_backref_cache(trans, &rc->backref_cache)) {
3960 btrfs_end_transaction(trans);
3965 ret = find_next_extent(rc, path, &key);
3971 rc->extents_found++;
3973 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
3974 struct btrfs_extent_item);
3975 item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]);
3976 if (item_size >= sizeof(*ei)) {
3977 flags = btrfs_extent_flags(path->nodes[0], ei);
3978 ret = check_extent_flags(flags);
3980 } else if (unlikely(item_size == sizeof(struct btrfs_extent_item_v0))) {
3982 btrfs_print_v0_err(trans->fs_info);
3983 btrfs_abort_transaction(trans, err);
3989 if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
3990 ret = add_tree_block(rc, &key, path, &blocks);
3991 } else if (rc->stage == UPDATE_DATA_PTRS &&
3992 (flags & BTRFS_EXTENT_FLAG_DATA)) {
3993 ret = add_data_references(rc, &key, path, &blocks);
3995 btrfs_release_path(path);
4003 if (!RB_EMPTY_ROOT(&blocks)) {
4004 ret = relocate_tree_blocks(trans, rc, &blocks);
4007 * if we fail to relocate tree blocks, force to update
4008 * backref cache when committing transaction.
4010 rc->backref_cache.last_trans = trans->transid - 1;
4012 if (ret != -EAGAIN) {
4016 rc->extents_found--;
4017 rc->search_start = key.objectid;
4021 btrfs_end_transaction_throttle(trans);
4022 btrfs_btree_balance_dirty(fs_info);
4025 if (rc->stage == MOVE_DATA_EXTENTS &&
4026 (flags & BTRFS_EXTENT_FLAG_DATA)) {
4027 rc->found_file_extent = 1;
4028 ret = relocate_data_extent(rc->data_inode,
4029 &key, &rc->cluster);
4036 if (trans && progress && err == -ENOSPC) {
4037 ret = btrfs_force_chunk_alloc(trans, rc->block_group->flags);
4045 btrfs_release_path(path);
4046 clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY);
4049 btrfs_end_transaction_throttle(trans);
4050 btrfs_btree_balance_dirty(fs_info);
4054 ret = relocate_file_extent_cluster(rc->data_inode,
4060 rc->create_reloc_tree = 0;
4061 set_reloc_control(rc);
4063 backref_cache_cleanup(&rc->backref_cache);
4064 btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1);
4066 err = prepare_to_merge(rc, err);
4068 merge_reloc_roots(rc);
4070 rc->merge_reloc_tree = 0;
4071 unset_reloc_control(rc);
4072 btrfs_block_rsv_release(fs_info, rc->block_rsv, (u64)-1);
4074 /* get rid of pinned extents */
4075 trans = btrfs_join_transaction(rc->extent_root);
4076 if (IS_ERR(trans)) {
4077 err = PTR_ERR(trans);
4080 btrfs_commit_transaction(trans);
4082 btrfs_free_block_rsv(fs_info, rc->block_rsv);
4083 btrfs_free_path(path);
4087 static int __insert_orphan_inode(struct btrfs_trans_handle *trans,
4088 struct btrfs_root *root, u64 objectid)
4090 struct btrfs_path *path;
4091 struct btrfs_inode_item *item;
4092 struct extent_buffer *leaf;
4095 path = btrfs_alloc_path();
4099 ret = btrfs_insert_empty_inode(trans, root, path, objectid);
4103 leaf = path->nodes[0];
4104 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item);
4105 memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item));
4106 btrfs_set_inode_generation(leaf, item, 1);
4107 btrfs_set_inode_size(leaf, item, 0);
4108 btrfs_set_inode_mode(leaf, item, S_IFREG | 0600);
4109 btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS |
4110 BTRFS_INODE_PREALLOC);
4111 btrfs_mark_buffer_dirty(leaf);
4113 btrfs_free_path(path);
4118 * helper to create inode for data relocation.
4119 * the inode is in data relocation tree and its link count is 0
4121 static noinline_for_stack
4122 struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info,
4123 struct btrfs_block_group_cache *group)
4125 struct inode *inode = NULL;
4126 struct btrfs_trans_handle *trans;
4127 struct btrfs_root *root;
4128 struct btrfs_key key;
4132 root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID);
4134 return ERR_CAST(root);
4136 trans = btrfs_start_transaction(root, 6);
4138 return ERR_CAST(trans);
4140 err = btrfs_find_free_objectid(root, &objectid);
4144 err = __insert_orphan_inode(trans, root, objectid);
4147 key.objectid = objectid;
4148 key.type = BTRFS_INODE_ITEM_KEY;
4150 inode = btrfs_iget(fs_info->sb, &key, root, NULL);
4151 BUG_ON(IS_ERR(inode));
4152 BTRFS_I(inode)->index_cnt = group->key.objectid;
4154 err = btrfs_orphan_add(trans, BTRFS_I(inode));
4156 btrfs_end_transaction(trans);
4157 btrfs_btree_balance_dirty(fs_info);
4161 inode = ERR_PTR(err);
4166 static struct reloc_control *alloc_reloc_control(void)
4168 struct reloc_control *rc;
4170 rc = kzalloc(sizeof(*rc), GFP_NOFS);
4174 INIT_LIST_HEAD(&rc->reloc_roots);
4175 backref_cache_init(&rc->backref_cache);
4176 mapping_tree_init(&rc->reloc_root_tree);
4177 extent_io_tree_init(&rc->processed_blocks, NULL);
4182 * Print the block group being relocated
4184 static void describe_relocation(struct btrfs_fs_info *fs_info,
4185 struct btrfs_block_group_cache *block_group)
4187 char buf[128] = {'\0'};
4189 btrfs_describe_block_groups(block_group->flags, buf, sizeof(buf));
4192 "relocating block group %llu flags %s",
4193 block_group->key.objectid, buf);
4197 * function to relocate all extents in a block group.
4199 int btrfs_relocate_block_group(struct btrfs_fs_info *fs_info, u64 group_start)
4201 struct btrfs_block_group_cache *bg;
4202 struct btrfs_root *extent_root = fs_info->extent_root;
4203 struct reloc_control *rc;
4204 struct inode *inode;
4205 struct btrfs_path *path;
4210 bg = btrfs_lookup_block_group(fs_info, group_start);
4214 if (btrfs_pinned_by_swapfile(fs_info, bg)) {
4215 btrfs_put_block_group(bg);
4219 rc = alloc_reloc_control();
4221 btrfs_put_block_group(bg);
4225 rc->extent_root = extent_root;
4226 rc->block_group = bg;
4228 ret = btrfs_inc_block_group_ro(rc->block_group);
4235 path = btrfs_alloc_path();
4241 inode = lookup_free_space_inode(fs_info, rc->block_group, path);
4242 btrfs_free_path(path);
4245 ret = delete_block_group_cache(fs_info, rc->block_group, inode, 0);
4247 ret = PTR_ERR(inode);
4249 if (ret && ret != -ENOENT) {
4254 rc->data_inode = create_reloc_inode(fs_info, rc->block_group);
4255 if (IS_ERR(rc->data_inode)) {
4256 err = PTR_ERR(rc->data_inode);
4257 rc->data_inode = NULL;
4261 describe_relocation(fs_info, rc->block_group);
4263 btrfs_wait_block_group_reservations(rc->block_group);
4264 btrfs_wait_nocow_writers(rc->block_group);
4265 btrfs_wait_ordered_roots(fs_info, U64_MAX,
4266 rc->block_group->key.objectid,
4267 rc->block_group->key.offset);
4270 mutex_lock(&fs_info->cleaner_mutex);
4271 ret = relocate_block_group(rc);
4272 mutex_unlock(&fs_info->cleaner_mutex);
4278 if (rc->extents_found == 0)
4281 btrfs_info(fs_info, "found %llu extents", rc->extents_found);
4283 if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) {
4284 ret = btrfs_wait_ordered_range(rc->data_inode, 0,
4290 invalidate_mapping_pages(rc->data_inode->i_mapping,
4292 rc->stage = UPDATE_DATA_PTRS;
4296 WARN_ON(rc->block_group->pinned > 0);
4297 WARN_ON(rc->block_group->reserved > 0);
4298 WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0);
4301 btrfs_dec_block_group_ro(rc->block_group);
4302 iput(rc->data_inode);
4303 btrfs_put_block_group(rc->block_group);
4308 static noinline_for_stack int mark_garbage_root(struct btrfs_root *root)
4310 struct btrfs_fs_info *fs_info = root->fs_info;
4311 struct btrfs_trans_handle *trans;
4314 trans = btrfs_start_transaction(fs_info->tree_root, 0);
4316 return PTR_ERR(trans);
4318 memset(&root->root_item.drop_progress, 0,
4319 sizeof(root->root_item.drop_progress));
4320 root->root_item.drop_level = 0;
4321 btrfs_set_root_refs(&root->root_item, 0);
4322 ret = btrfs_update_root(trans, fs_info->tree_root,
4323 &root->root_key, &root->root_item);
4325 err = btrfs_end_transaction(trans);
4332 * recover relocation interrupted by system crash.
4334 * this function resumes merging reloc trees with corresponding fs trees.
4335 * this is important for keeping the sharing of tree blocks
4337 int btrfs_recover_relocation(struct btrfs_root *root)
4339 struct btrfs_fs_info *fs_info = root->fs_info;
4340 LIST_HEAD(reloc_roots);
4341 struct btrfs_key key;
4342 struct btrfs_root *fs_root;
4343 struct btrfs_root *reloc_root;
4344 struct btrfs_path *path;
4345 struct extent_buffer *leaf;
4346 struct reloc_control *rc = NULL;
4347 struct btrfs_trans_handle *trans;
4351 path = btrfs_alloc_path();
4354 path->reada = READA_BACK;
4356 key.objectid = BTRFS_TREE_RELOC_OBJECTID;
4357 key.type = BTRFS_ROOT_ITEM_KEY;
4358 key.offset = (u64)-1;
4361 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key,
4368 if (path->slots[0] == 0)
4372 leaf = path->nodes[0];
4373 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
4374 btrfs_release_path(path);
4376 if (key.objectid != BTRFS_TREE_RELOC_OBJECTID ||
4377 key.type != BTRFS_ROOT_ITEM_KEY)
4380 reloc_root = btrfs_read_fs_root(root, &key);
4381 if (IS_ERR(reloc_root)) {
4382 err = PTR_ERR(reloc_root);
4386 list_add(&reloc_root->root_list, &reloc_roots);
4388 if (btrfs_root_refs(&reloc_root->root_item) > 0) {
4389 fs_root = read_fs_root(fs_info,
4390 reloc_root->root_key.offset);
4391 if (IS_ERR(fs_root)) {
4392 ret = PTR_ERR(fs_root);
4393 if (ret != -ENOENT) {
4397 ret = mark_garbage_root(reloc_root);
4405 if (key.offset == 0)
4410 btrfs_release_path(path);
4412 if (list_empty(&reloc_roots))
4415 rc = alloc_reloc_control();
4421 rc->extent_root = fs_info->extent_root;
4423 set_reloc_control(rc);
4425 trans = btrfs_join_transaction(rc->extent_root);
4426 if (IS_ERR(trans)) {
4427 unset_reloc_control(rc);
4428 err = PTR_ERR(trans);
4432 rc->merge_reloc_tree = 1;
4434 while (!list_empty(&reloc_roots)) {
4435 reloc_root = list_entry(reloc_roots.next,
4436 struct btrfs_root, root_list);
4437 list_del(&reloc_root->root_list);
4439 if (btrfs_root_refs(&reloc_root->root_item) == 0) {
4440 list_add_tail(&reloc_root->root_list,
4445 fs_root = read_fs_root(fs_info, reloc_root->root_key.offset);
4446 if (IS_ERR(fs_root)) {
4447 err = PTR_ERR(fs_root);
4451 err = __add_reloc_root(reloc_root);
4452 BUG_ON(err < 0); /* -ENOMEM or logic error */
4453 fs_root->reloc_root = reloc_root;
4456 err = btrfs_commit_transaction(trans);
4460 merge_reloc_roots(rc);
4462 unset_reloc_control(rc);
4464 trans = btrfs_join_transaction(rc->extent_root);
4465 if (IS_ERR(trans)) {
4466 err = PTR_ERR(trans);
4469 err = btrfs_commit_transaction(trans);
4473 if (!list_empty(&reloc_roots))
4474 free_reloc_roots(&reloc_roots);
4476 btrfs_free_path(path);
4479 /* cleanup orphan inode in data relocation tree */
4480 fs_root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID);
4481 if (IS_ERR(fs_root))
4482 err = PTR_ERR(fs_root);
4484 err = btrfs_orphan_cleanup(fs_root);
4490 * helper to add ordered checksum for data relocation.
4492 * cloning checksum properly handles the nodatasum extents.
4493 * it also saves CPU time to re-calculate the checksum.
4495 int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len)
4497 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
4498 struct btrfs_ordered_sum *sums;
4499 struct btrfs_ordered_extent *ordered;
4505 ordered = btrfs_lookup_ordered_extent(inode, file_pos);
4506 BUG_ON(ordered->file_offset != file_pos || ordered->len != len);
4508 disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt;
4509 ret = btrfs_lookup_csums_range(fs_info->csum_root, disk_bytenr,
4510 disk_bytenr + len - 1, &list, 0);
4514 while (!list_empty(&list)) {
4515 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
4516 list_del_init(&sums->list);
4519 * We need to offset the new_bytenr based on where the csum is.
4520 * We need to do this because we will read in entire prealloc
4521 * extents but we may have written to say the middle of the
4522 * prealloc extent, so we need to make sure the csum goes with
4523 * the right disk offset.
4525 * We can do this because the data reloc inode refers strictly
4526 * to the on disk bytes, so we don't have to worry about
4527 * disk_len vs real len like with real inodes since it's all
4530 new_bytenr = ordered->start + (sums->bytenr - disk_bytenr);
4531 sums->bytenr = new_bytenr;
4533 btrfs_add_ordered_sum(inode, ordered, sums);
4536 btrfs_put_ordered_extent(ordered);
4540 int btrfs_reloc_cow_block(struct btrfs_trans_handle *trans,
4541 struct btrfs_root *root, struct extent_buffer *buf,
4542 struct extent_buffer *cow)
4544 struct btrfs_fs_info *fs_info = root->fs_info;
4545 struct reloc_control *rc;
4546 struct backref_node *node;
4551 rc = fs_info->reloc_ctl;
4555 BUG_ON(rc->stage == UPDATE_DATA_PTRS &&
4556 root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID);
4558 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) {
4559 if (buf == root->node)
4560 __update_reloc_root(root, cow->start);
4563 level = btrfs_header_level(buf);
4564 if (btrfs_header_generation(buf) <=
4565 btrfs_root_last_snapshot(&root->root_item))
4568 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID &&
4569 rc->create_reloc_tree) {
4570 WARN_ON(!first_cow && level == 0);
4572 node = rc->backref_cache.path[level];
4573 BUG_ON(node->bytenr != buf->start &&
4574 node->new_bytenr != buf->start);
4576 drop_node_buffer(node);
4577 extent_buffer_get(cow);
4579 node->new_bytenr = cow->start;
4581 if (!node->pending) {
4582 list_move_tail(&node->list,
4583 &rc->backref_cache.pending[level]);
4588 __mark_block_processed(rc, node);
4590 if (first_cow && level > 0)
4591 rc->nodes_relocated += buf->len;
4594 if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS)
4595 ret = replace_file_extents(trans, rc, root, cow);
4600 * called before creating snapshot. it calculates metadata reservation
4601 * required for relocating tree blocks in the snapshot
4603 void btrfs_reloc_pre_snapshot(struct btrfs_pending_snapshot *pending,
4604 u64 *bytes_to_reserve)
4606 struct btrfs_root *root;
4607 struct reloc_control *rc;
4609 root = pending->root;
4610 if (!root->reloc_root)
4613 rc = root->fs_info->reloc_ctl;
4614 if (!rc->merge_reloc_tree)
4617 root = root->reloc_root;
4618 BUG_ON(btrfs_root_refs(&root->root_item) == 0);
4620 * relocation is in the stage of merging trees. the space
4621 * used by merging a reloc tree is twice the size of
4622 * relocated tree nodes in the worst case. half for cowing
4623 * the reloc tree, half for cowing the fs tree. the space
4624 * used by cowing the reloc tree will be freed after the
4625 * tree is dropped. if we create snapshot, cowing the fs
4626 * tree may use more space than it frees. so we need
4627 * reserve extra space.
4629 *bytes_to_reserve += rc->nodes_relocated;
4633 * called after snapshot is created. migrate block reservation
4634 * and create reloc root for the newly created snapshot
4636 int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans,
4637 struct btrfs_pending_snapshot *pending)
4639 struct btrfs_root *root = pending->root;
4640 struct btrfs_root *reloc_root;
4641 struct btrfs_root *new_root;
4642 struct reloc_control *rc;
4645 if (!root->reloc_root)
4648 rc = root->fs_info->reloc_ctl;
4649 rc->merging_rsv_size += rc->nodes_relocated;
4651 if (rc->merge_reloc_tree) {
4652 ret = btrfs_block_rsv_migrate(&pending->block_rsv,
4654 rc->nodes_relocated, true);
4659 new_root = pending->snap;
4660 reloc_root = create_reloc_root(trans, root->reloc_root,
4661 new_root->root_key.objectid);
4662 if (IS_ERR(reloc_root))
4663 return PTR_ERR(reloc_root);
4665 ret = __add_reloc_root(reloc_root);
4667 new_root->reloc_root = reloc_root;
4669 if (rc->create_reloc_tree)
4670 ret = clone_backref_node(trans, rc, root, reloc_root);