2 * Copyright (C) 2009 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #include <linux/sched.h>
20 #include <linux/pagemap.h>
21 #include <linux/writeback.h>
22 #include <linux/blkdev.h>
23 #include <linux/rbtree.h>
24 #include <linux/slab.h>
27 #include "transaction.h"
30 #include "btrfs_inode.h"
31 #include "async-thread.h"
32 #include "free-space-cache.h"
33 #include "inode-map.h"
36 * backref_node, mapping_node and tree_block start with this
39 struct rb_node rb_node;
44 * present a tree block in the backref cache
47 struct rb_node rb_node;
51 /* objectid of tree block owner, can be not uptodate */
53 /* link to pending, changed or detached list */
54 struct list_head list;
55 /* list of upper level blocks reference this block */
56 struct list_head upper;
57 /* list of child blocks in the cache */
58 struct list_head lower;
59 /* NULL if this node is not tree root */
60 struct btrfs_root *root;
61 /* extent buffer got by COW the block */
62 struct extent_buffer *eb;
63 /* level of tree block */
65 /* is the block in non-reference counted tree */
66 unsigned int cowonly:1;
67 /* 1 if no child node in the cache */
68 unsigned int lowest:1;
69 /* is the extent buffer locked */
70 unsigned int locked:1;
71 /* has the block been processed */
72 unsigned int processed:1;
73 /* have backrefs of this block been checked */
74 unsigned int checked:1;
76 * 1 if corresponding block has been cowed but some upper
77 * level block pointers may not point to the new location
79 unsigned int pending:1;
81 * 1 if the backref node isn't connected to any other
84 unsigned int detached:1;
88 * present a block pointer in the backref cache
91 struct list_head list[2];
92 struct backref_node *node[2];
98 struct backref_cache {
99 /* red black tree of all backref nodes in the cache */
100 struct rb_root rb_root;
101 /* for passing backref nodes to btrfs_reloc_cow_block */
102 struct backref_node *path[BTRFS_MAX_LEVEL];
104 * list of blocks that have been cowed but some block
105 * pointers in upper level blocks may not reflect the
108 struct list_head pending[BTRFS_MAX_LEVEL];
109 /* list of backref nodes with no child node */
110 struct list_head leaves;
111 /* list of blocks that have been cowed in current transaction */
112 struct list_head changed;
113 /* list of detached backref node. */
114 struct list_head detached;
123 * map address of tree root to tree
125 struct mapping_node {
126 struct rb_node rb_node;
131 struct mapping_tree {
132 struct rb_root rb_root;
137 * present a tree block to process
140 struct rb_node rb_node;
142 struct btrfs_key key;
143 unsigned int level:8;
144 unsigned int key_ready:1;
147 #define MAX_EXTENTS 128
149 struct file_extent_cluster {
152 u64 boundary[MAX_EXTENTS];
156 struct reloc_control {
157 /* block group to relocate */
158 struct btrfs_block_group_cache *block_group;
160 struct btrfs_root *extent_root;
161 /* inode for moving data */
162 struct inode *data_inode;
164 struct btrfs_block_rsv *block_rsv;
166 struct backref_cache backref_cache;
168 struct file_extent_cluster cluster;
169 /* tree blocks have been processed */
170 struct extent_io_tree processed_blocks;
171 /* map start of tree root to corresponding reloc tree */
172 struct mapping_tree reloc_root_tree;
173 /* list of reloc trees */
174 struct list_head reloc_roots;
175 /* size of metadata reservation for merging reloc trees */
176 u64 merging_rsv_size;
177 /* size of relocated tree nodes */
183 unsigned int stage:8;
184 unsigned int create_reloc_tree:1;
185 unsigned int merge_reloc_tree:1;
186 unsigned int found_file_extent:1;
187 unsigned int commit_transaction:1;
190 /* stages of data relocation */
191 #define MOVE_DATA_EXTENTS 0
192 #define UPDATE_DATA_PTRS 1
194 static void remove_backref_node(struct backref_cache *cache,
195 struct backref_node *node);
196 static void __mark_block_processed(struct reloc_control *rc,
197 struct backref_node *node);
199 static void mapping_tree_init(struct mapping_tree *tree)
201 tree->rb_root = RB_ROOT;
202 spin_lock_init(&tree->lock);
205 static void backref_cache_init(struct backref_cache *cache)
208 cache->rb_root = RB_ROOT;
209 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
210 INIT_LIST_HEAD(&cache->pending[i]);
211 INIT_LIST_HEAD(&cache->changed);
212 INIT_LIST_HEAD(&cache->detached);
213 INIT_LIST_HEAD(&cache->leaves);
216 static void backref_cache_cleanup(struct backref_cache *cache)
218 struct backref_node *node;
221 while (!list_empty(&cache->detached)) {
222 node = list_entry(cache->detached.next,
223 struct backref_node, list);
224 remove_backref_node(cache, node);
227 while (!list_empty(&cache->leaves)) {
228 node = list_entry(cache->leaves.next,
229 struct backref_node, lower);
230 remove_backref_node(cache, node);
233 cache->last_trans = 0;
235 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
236 BUG_ON(!list_empty(&cache->pending[i]));
237 BUG_ON(!list_empty(&cache->changed));
238 BUG_ON(!list_empty(&cache->detached));
239 BUG_ON(!RB_EMPTY_ROOT(&cache->rb_root));
240 BUG_ON(cache->nr_nodes);
241 BUG_ON(cache->nr_edges);
244 static struct backref_node *alloc_backref_node(struct backref_cache *cache)
246 struct backref_node *node;
248 node = kzalloc(sizeof(*node), GFP_NOFS);
250 INIT_LIST_HEAD(&node->list);
251 INIT_LIST_HEAD(&node->upper);
252 INIT_LIST_HEAD(&node->lower);
253 RB_CLEAR_NODE(&node->rb_node);
259 static void free_backref_node(struct backref_cache *cache,
260 struct backref_node *node)
268 static struct backref_edge *alloc_backref_edge(struct backref_cache *cache)
270 struct backref_edge *edge;
272 edge = kzalloc(sizeof(*edge), GFP_NOFS);
278 static void free_backref_edge(struct backref_cache *cache,
279 struct backref_edge *edge)
287 static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr,
288 struct rb_node *node)
290 struct rb_node **p = &root->rb_node;
291 struct rb_node *parent = NULL;
292 struct tree_entry *entry;
296 entry = rb_entry(parent, struct tree_entry, rb_node);
298 if (bytenr < entry->bytenr)
300 else if (bytenr > entry->bytenr)
306 rb_link_node(node, parent, p);
307 rb_insert_color(node, root);
311 static struct rb_node *tree_search(struct rb_root *root, u64 bytenr)
313 struct rb_node *n = root->rb_node;
314 struct tree_entry *entry;
317 entry = rb_entry(n, struct tree_entry, rb_node);
319 if (bytenr < entry->bytenr)
321 else if (bytenr > entry->bytenr)
329 static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr)
332 struct btrfs_fs_info *fs_info = NULL;
333 struct backref_node *bnode = rb_entry(rb_node, struct backref_node,
336 fs_info = bnode->root->fs_info;
337 btrfs_panic(fs_info, errno, "Inconsistency in backref cache "
338 "found at offset %llu\n", (unsigned long long)bytenr);
342 * walk up backref nodes until reach node presents tree root
344 static struct backref_node *walk_up_backref(struct backref_node *node,
345 struct backref_edge *edges[],
348 struct backref_edge *edge;
351 while (!list_empty(&node->upper)) {
352 edge = list_entry(node->upper.next,
353 struct backref_edge, list[LOWER]);
355 node = edge->node[UPPER];
357 BUG_ON(node->detached);
363 * walk down backref nodes to find start of next reference path
365 static struct backref_node *walk_down_backref(struct backref_edge *edges[],
368 struct backref_edge *edge;
369 struct backref_node *lower;
373 edge = edges[idx - 1];
374 lower = edge->node[LOWER];
375 if (list_is_last(&edge->list[LOWER], &lower->upper)) {
379 edge = list_entry(edge->list[LOWER].next,
380 struct backref_edge, list[LOWER]);
381 edges[idx - 1] = edge;
383 return edge->node[UPPER];
389 static void unlock_node_buffer(struct backref_node *node)
392 btrfs_tree_unlock(node->eb);
397 static void drop_node_buffer(struct backref_node *node)
400 unlock_node_buffer(node);
401 free_extent_buffer(node->eb);
406 static void drop_backref_node(struct backref_cache *tree,
407 struct backref_node *node)
409 BUG_ON(!list_empty(&node->upper));
411 drop_node_buffer(node);
412 list_del(&node->list);
413 list_del(&node->lower);
414 if (!RB_EMPTY_NODE(&node->rb_node))
415 rb_erase(&node->rb_node, &tree->rb_root);
416 free_backref_node(tree, node);
420 * remove a backref node from the backref cache
422 static void remove_backref_node(struct backref_cache *cache,
423 struct backref_node *node)
425 struct backref_node *upper;
426 struct backref_edge *edge;
431 BUG_ON(!node->lowest && !node->detached);
432 while (!list_empty(&node->upper)) {
433 edge = list_entry(node->upper.next, struct backref_edge,
435 upper = edge->node[UPPER];
436 list_del(&edge->list[LOWER]);
437 list_del(&edge->list[UPPER]);
438 free_backref_edge(cache, edge);
440 if (RB_EMPTY_NODE(&upper->rb_node)) {
441 BUG_ON(!list_empty(&node->upper));
442 drop_backref_node(cache, node);
448 * add the node to leaf node list if no other
449 * child block cached.
451 if (list_empty(&upper->lower)) {
452 list_add_tail(&upper->lower, &cache->leaves);
457 drop_backref_node(cache, node);
460 static void update_backref_node(struct backref_cache *cache,
461 struct backref_node *node, u64 bytenr)
463 struct rb_node *rb_node;
464 rb_erase(&node->rb_node, &cache->rb_root);
465 node->bytenr = bytenr;
466 rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node);
468 backref_tree_panic(rb_node, -EEXIST, bytenr);
472 * update backref cache after a transaction commit
474 static int update_backref_cache(struct btrfs_trans_handle *trans,
475 struct backref_cache *cache)
477 struct backref_node *node;
480 if (cache->last_trans == 0) {
481 cache->last_trans = trans->transid;
485 if (cache->last_trans == trans->transid)
489 * detached nodes are used to avoid unnecessary backref
490 * lookup. transaction commit changes the extent tree.
491 * so the detached nodes are no longer useful.
493 while (!list_empty(&cache->detached)) {
494 node = list_entry(cache->detached.next,
495 struct backref_node, list);
496 remove_backref_node(cache, node);
499 while (!list_empty(&cache->changed)) {
500 node = list_entry(cache->changed.next,
501 struct backref_node, list);
502 list_del_init(&node->list);
503 BUG_ON(node->pending);
504 update_backref_node(cache, node, node->new_bytenr);
508 * some nodes can be left in the pending list if there were
509 * errors during processing the pending nodes.
511 for (level = 0; level < BTRFS_MAX_LEVEL; level++) {
512 list_for_each_entry(node, &cache->pending[level], list) {
513 BUG_ON(!node->pending);
514 if (node->bytenr == node->new_bytenr)
516 update_backref_node(cache, node, node->new_bytenr);
520 cache->last_trans = 0;
525 static int should_ignore_root(struct btrfs_root *root)
527 struct btrfs_root *reloc_root;
532 reloc_root = root->reloc_root;
536 if (btrfs_root_last_snapshot(&reloc_root->root_item) ==
537 root->fs_info->running_transaction->transid - 1)
540 * if there is reloc tree and it was created in previous
541 * transaction backref lookup can find the reloc tree,
542 * so backref node for the fs tree root is useless for
548 * find reloc tree by address of tree root
550 static struct btrfs_root *find_reloc_root(struct reloc_control *rc,
553 struct rb_node *rb_node;
554 struct mapping_node *node;
555 struct btrfs_root *root = NULL;
557 spin_lock(&rc->reloc_root_tree.lock);
558 rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr);
560 node = rb_entry(rb_node, struct mapping_node, rb_node);
561 root = (struct btrfs_root *)node->data;
563 spin_unlock(&rc->reloc_root_tree.lock);
567 static int is_cowonly_root(u64 root_objectid)
569 if (root_objectid == BTRFS_ROOT_TREE_OBJECTID ||
570 root_objectid == BTRFS_EXTENT_TREE_OBJECTID ||
571 root_objectid == BTRFS_CHUNK_TREE_OBJECTID ||
572 root_objectid == BTRFS_DEV_TREE_OBJECTID ||
573 root_objectid == BTRFS_TREE_LOG_OBJECTID ||
574 root_objectid == BTRFS_CSUM_TREE_OBJECTID)
579 static struct btrfs_root *read_fs_root(struct btrfs_fs_info *fs_info,
582 struct btrfs_key key;
584 key.objectid = root_objectid;
585 key.type = BTRFS_ROOT_ITEM_KEY;
586 if (is_cowonly_root(root_objectid))
589 key.offset = (u64)-1;
591 return btrfs_read_fs_root_no_name(fs_info, &key);
594 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
595 static noinline_for_stack
596 struct btrfs_root *find_tree_root(struct reloc_control *rc,
597 struct extent_buffer *leaf,
598 struct btrfs_extent_ref_v0 *ref0)
600 struct btrfs_root *root;
601 u64 root_objectid = btrfs_ref_root_v0(leaf, ref0);
602 u64 generation = btrfs_ref_generation_v0(leaf, ref0);
604 BUG_ON(root_objectid == BTRFS_TREE_RELOC_OBJECTID);
606 root = read_fs_root(rc->extent_root->fs_info, root_objectid);
607 BUG_ON(IS_ERR(root));
609 if (root->ref_cows &&
610 generation != btrfs_root_generation(&root->root_item))
617 static noinline_for_stack
618 int find_inline_backref(struct extent_buffer *leaf, int slot,
619 unsigned long *ptr, unsigned long *end)
621 struct btrfs_key key;
622 struct btrfs_extent_item *ei;
623 struct btrfs_tree_block_info *bi;
626 btrfs_item_key_to_cpu(leaf, &key, slot);
628 item_size = btrfs_item_size_nr(leaf, slot);
629 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
630 if (item_size < sizeof(*ei)) {
631 WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0));
635 ei = btrfs_item_ptr(leaf, slot, struct btrfs_extent_item);
636 WARN_ON(!(btrfs_extent_flags(leaf, ei) &
637 BTRFS_EXTENT_FLAG_TREE_BLOCK));
639 if (key.type == BTRFS_EXTENT_ITEM_KEY &&
640 item_size <= sizeof(*ei) + sizeof(*bi)) {
641 WARN_ON(item_size < sizeof(*ei) + sizeof(*bi));
645 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
646 bi = (struct btrfs_tree_block_info *)(ei + 1);
647 *ptr = (unsigned long)(bi + 1);
649 *ptr = (unsigned long)(ei + 1);
651 *end = (unsigned long)ei + item_size;
656 * build backref tree for a given tree block. root of the backref tree
657 * corresponds the tree block, leaves of the backref tree correspond
658 * roots of b-trees that reference the tree block.
660 * the basic idea of this function is check backrefs of a given block
661 * to find upper level blocks that refernece the block, and then check
662 * bakcrefs of these upper level blocks recursively. the recursion stop
663 * when tree root is reached or backrefs for the block is cached.
665 * NOTE: if we find backrefs for a block are cached, we know backrefs
666 * for all upper level blocks that directly/indirectly reference the
667 * block are also cached.
669 static noinline_for_stack
670 struct backref_node *build_backref_tree(struct reloc_control *rc,
671 struct btrfs_key *node_key,
672 int level, u64 bytenr)
674 struct backref_cache *cache = &rc->backref_cache;
675 struct btrfs_path *path1;
676 struct btrfs_path *path2;
677 struct extent_buffer *eb;
678 struct btrfs_root *root;
679 struct backref_node *cur;
680 struct backref_node *upper;
681 struct backref_node *lower;
682 struct backref_node *node = NULL;
683 struct backref_node *exist = NULL;
684 struct backref_edge *edge;
685 struct rb_node *rb_node;
686 struct btrfs_key key;
695 path1 = btrfs_alloc_path();
696 path2 = btrfs_alloc_path();
697 if (!path1 || !path2) {
704 node = alloc_backref_node(cache);
710 node->bytenr = bytenr;
717 key.objectid = cur->bytenr;
718 key.type = BTRFS_METADATA_ITEM_KEY;
719 key.offset = (u64)-1;
721 path1->search_commit_root = 1;
722 path1->skip_locking = 1;
723 ret = btrfs_search_slot(NULL, rc->extent_root, &key, path1,
729 BUG_ON(!ret || !path1->slots[0]);
733 WARN_ON(cur->checked);
734 if (!list_empty(&cur->upper)) {
736 * the backref was added previously when processing
737 * backref of type BTRFS_TREE_BLOCK_REF_KEY
739 BUG_ON(!list_is_singular(&cur->upper));
740 edge = list_entry(cur->upper.next, struct backref_edge,
742 BUG_ON(!list_empty(&edge->list[UPPER]));
743 exist = edge->node[UPPER];
745 * add the upper level block to pending list if we need
749 list_add_tail(&edge->list[UPPER], &list);
756 eb = path1->nodes[0];
759 if (path1->slots[0] >= btrfs_header_nritems(eb)) {
760 ret = btrfs_next_leaf(rc->extent_root, path1);
767 eb = path1->nodes[0];
770 btrfs_item_key_to_cpu(eb, &key, path1->slots[0]);
771 if (key.objectid != cur->bytenr) {
776 if (key.type == BTRFS_EXTENT_ITEM_KEY ||
777 key.type == BTRFS_METADATA_ITEM_KEY) {
778 ret = find_inline_backref(eb, path1->slots[0],
786 /* update key for inline back ref */
787 struct btrfs_extent_inline_ref *iref;
788 iref = (struct btrfs_extent_inline_ref *)ptr;
789 key.type = btrfs_extent_inline_ref_type(eb, iref);
790 key.offset = btrfs_extent_inline_ref_offset(eb, iref);
791 WARN_ON(key.type != BTRFS_TREE_BLOCK_REF_KEY &&
792 key.type != BTRFS_SHARED_BLOCK_REF_KEY);
796 ((key.type == BTRFS_TREE_BLOCK_REF_KEY &&
797 exist->owner == key.offset) ||
798 (key.type == BTRFS_SHARED_BLOCK_REF_KEY &&
799 exist->bytenr == key.offset))) {
804 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
805 if (key.type == BTRFS_SHARED_BLOCK_REF_KEY ||
806 key.type == BTRFS_EXTENT_REF_V0_KEY) {
807 if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
808 struct btrfs_extent_ref_v0 *ref0;
809 ref0 = btrfs_item_ptr(eb, path1->slots[0],
810 struct btrfs_extent_ref_v0);
811 if (key.objectid == key.offset) {
812 root = find_tree_root(rc, eb, ref0);
813 if (root && !should_ignore_root(root))
816 list_add(&cur->list, &useless);
819 if (is_cowonly_root(btrfs_ref_root_v0(eb,
824 BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY);
825 if (key.type == BTRFS_SHARED_BLOCK_REF_KEY) {
827 if (key.objectid == key.offset) {
829 * only root blocks of reloc trees use
830 * backref of this type.
832 root = find_reloc_root(rc, cur->bytenr);
838 edge = alloc_backref_edge(cache);
843 rb_node = tree_search(&cache->rb_root, key.offset);
845 upper = alloc_backref_node(cache);
847 free_backref_edge(cache, edge);
851 upper->bytenr = key.offset;
852 upper->level = cur->level + 1;
854 * backrefs for the upper level block isn't
855 * cached, add the block to pending list
857 list_add_tail(&edge->list[UPPER], &list);
859 upper = rb_entry(rb_node, struct backref_node,
861 BUG_ON(!upper->checked);
862 INIT_LIST_HEAD(&edge->list[UPPER]);
864 list_add_tail(&edge->list[LOWER], &cur->upper);
865 edge->node[LOWER] = cur;
866 edge->node[UPPER] = upper;
869 } else if (key.type != BTRFS_TREE_BLOCK_REF_KEY) {
873 /* key.type == BTRFS_TREE_BLOCK_REF_KEY */
874 root = read_fs_root(rc->extent_root->fs_info, key.offset);
883 if (btrfs_root_level(&root->root_item) == cur->level) {
885 BUG_ON(btrfs_root_bytenr(&root->root_item) !=
887 if (should_ignore_root(root))
888 list_add(&cur->list, &useless);
894 level = cur->level + 1;
897 * searching the tree to find upper level blocks
898 * reference the block.
900 path2->search_commit_root = 1;
901 path2->skip_locking = 1;
902 path2->lowest_level = level;
903 ret = btrfs_search_slot(NULL, root, node_key, path2, 0, 0);
904 path2->lowest_level = 0;
909 if (ret > 0 && path2->slots[level] > 0)
910 path2->slots[level]--;
912 eb = path2->nodes[level];
913 WARN_ON(btrfs_node_blockptr(eb, path2->slots[level]) !=
917 for (; level < BTRFS_MAX_LEVEL; level++) {
918 if (!path2->nodes[level]) {
919 BUG_ON(btrfs_root_bytenr(&root->root_item) !=
921 if (should_ignore_root(root))
922 list_add(&lower->list, &useless);
928 edge = alloc_backref_edge(cache);
934 eb = path2->nodes[level];
935 rb_node = tree_search(&cache->rb_root, eb->start);
937 upper = alloc_backref_node(cache);
939 free_backref_edge(cache, edge);
943 upper->bytenr = eb->start;
944 upper->owner = btrfs_header_owner(eb);
945 upper->level = lower->level + 1;
950 * if we know the block isn't shared
951 * we can void checking its backrefs.
953 if (btrfs_block_can_be_shared(root, eb))
959 * add the block to pending list if we
960 * need check its backrefs. only block
961 * at 'cur->level + 1' is added to the
962 * tail of pending list. this guarantees
963 * we check backrefs from lower level
964 * blocks to upper level blocks.
966 if (!upper->checked &&
967 level == cur->level + 1) {
968 list_add_tail(&edge->list[UPPER],
971 INIT_LIST_HEAD(&edge->list[UPPER]);
973 upper = rb_entry(rb_node, struct backref_node,
975 BUG_ON(!upper->checked);
976 INIT_LIST_HEAD(&edge->list[UPPER]);
978 upper->owner = btrfs_header_owner(eb);
980 list_add_tail(&edge->list[LOWER], &lower->upper);
981 edge->node[LOWER] = lower;
982 edge->node[UPPER] = upper;
989 btrfs_release_path(path2);
992 ptr += btrfs_extent_inline_ref_size(key.type);
1002 btrfs_release_path(path1);
1007 /* the pending list isn't empty, take the first block to process */
1008 if (!list_empty(&list)) {
1009 edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1010 list_del_init(&edge->list[UPPER]);
1011 cur = edge->node[UPPER];
1016 * everything goes well, connect backref nodes and insert backref nodes
1019 BUG_ON(!node->checked);
1020 cowonly = node->cowonly;
1022 rb_node = tree_insert(&cache->rb_root, node->bytenr,
1025 backref_tree_panic(rb_node, -EEXIST, node->bytenr);
1026 list_add_tail(&node->lower, &cache->leaves);
1029 list_for_each_entry(edge, &node->upper, list[LOWER])
1030 list_add_tail(&edge->list[UPPER], &list);
1032 while (!list_empty(&list)) {
1033 edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1034 list_del_init(&edge->list[UPPER]);
1035 upper = edge->node[UPPER];
1036 if (upper->detached) {
1037 list_del(&edge->list[LOWER]);
1038 lower = edge->node[LOWER];
1039 free_backref_edge(cache, edge);
1040 if (list_empty(&lower->upper))
1041 list_add(&lower->list, &useless);
1045 if (!RB_EMPTY_NODE(&upper->rb_node)) {
1046 if (upper->lowest) {
1047 list_del_init(&upper->lower);
1051 list_add_tail(&edge->list[UPPER], &upper->lower);
1055 BUG_ON(!upper->checked);
1056 BUG_ON(cowonly != upper->cowonly);
1058 rb_node = tree_insert(&cache->rb_root, upper->bytenr,
1061 backref_tree_panic(rb_node, -EEXIST,
1065 list_add_tail(&edge->list[UPPER], &upper->lower);
1067 list_for_each_entry(edge, &upper->upper, list[LOWER])
1068 list_add_tail(&edge->list[UPPER], &list);
1071 * process useless backref nodes. backref nodes for tree leaves
1072 * are deleted from the cache. backref nodes for upper level
1073 * tree blocks are left in the cache to avoid unnecessary backref
1076 while (!list_empty(&useless)) {
1077 upper = list_entry(useless.next, struct backref_node, list);
1078 list_del_init(&upper->list);
1079 BUG_ON(!list_empty(&upper->upper));
1082 if (upper->lowest) {
1083 list_del_init(&upper->lower);
1086 while (!list_empty(&upper->lower)) {
1087 edge = list_entry(upper->lower.next,
1088 struct backref_edge, list[UPPER]);
1089 list_del(&edge->list[UPPER]);
1090 list_del(&edge->list[LOWER]);
1091 lower = edge->node[LOWER];
1092 free_backref_edge(cache, edge);
1094 if (list_empty(&lower->upper))
1095 list_add(&lower->list, &useless);
1097 __mark_block_processed(rc, upper);
1098 if (upper->level > 0) {
1099 list_add(&upper->list, &cache->detached);
1100 upper->detached = 1;
1102 rb_erase(&upper->rb_node, &cache->rb_root);
1103 free_backref_node(cache, upper);
1107 btrfs_free_path(path1);
1108 btrfs_free_path(path2);
1110 while (!list_empty(&useless)) {
1111 lower = list_entry(useless.next,
1112 struct backref_node, upper);
1113 list_del_init(&lower->upper);
1116 INIT_LIST_HEAD(&list);
1118 if (RB_EMPTY_NODE(&upper->rb_node)) {
1119 list_splice_tail(&upper->upper, &list);
1120 free_backref_node(cache, upper);
1123 if (list_empty(&list))
1126 edge = list_entry(list.next, struct backref_edge,
1128 list_del(&edge->list[LOWER]);
1129 upper = edge->node[UPPER];
1130 free_backref_edge(cache, edge);
1132 return ERR_PTR(err);
1134 BUG_ON(node && node->detached);
1139 * helper to add backref node for the newly created snapshot.
1140 * the backref node is created by cloning backref node that
1141 * corresponds to root of source tree
1143 static int clone_backref_node(struct btrfs_trans_handle *trans,
1144 struct reloc_control *rc,
1145 struct btrfs_root *src,
1146 struct btrfs_root *dest)
1148 struct btrfs_root *reloc_root = src->reloc_root;
1149 struct backref_cache *cache = &rc->backref_cache;
1150 struct backref_node *node = NULL;
1151 struct backref_node *new_node;
1152 struct backref_edge *edge;
1153 struct backref_edge *new_edge;
1154 struct rb_node *rb_node;
1156 if (cache->last_trans > 0)
1157 update_backref_cache(trans, cache);
1159 rb_node = tree_search(&cache->rb_root, src->commit_root->start);
1161 node = rb_entry(rb_node, struct backref_node, rb_node);
1165 BUG_ON(node->new_bytenr != reloc_root->node->start);
1169 rb_node = tree_search(&cache->rb_root,
1170 reloc_root->commit_root->start);
1172 node = rb_entry(rb_node, struct backref_node,
1174 BUG_ON(node->detached);
1181 new_node = alloc_backref_node(cache);
1185 new_node->bytenr = dest->node->start;
1186 new_node->level = node->level;
1187 new_node->lowest = node->lowest;
1188 new_node->checked = 1;
1189 new_node->root = dest;
1191 if (!node->lowest) {
1192 list_for_each_entry(edge, &node->lower, list[UPPER]) {
1193 new_edge = alloc_backref_edge(cache);
1197 new_edge->node[UPPER] = new_node;
1198 new_edge->node[LOWER] = edge->node[LOWER];
1199 list_add_tail(&new_edge->list[UPPER],
1203 list_add_tail(&new_node->lower, &cache->leaves);
1206 rb_node = tree_insert(&cache->rb_root, new_node->bytenr,
1207 &new_node->rb_node);
1209 backref_tree_panic(rb_node, -EEXIST, new_node->bytenr);
1211 if (!new_node->lowest) {
1212 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {
1213 list_add_tail(&new_edge->list[LOWER],
1214 &new_edge->node[LOWER]->upper);
1219 while (!list_empty(&new_node->lower)) {
1220 new_edge = list_entry(new_node->lower.next,
1221 struct backref_edge, list[UPPER]);
1222 list_del(&new_edge->list[UPPER]);
1223 free_backref_edge(cache, new_edge);
1225 free_backref_node(cache, new_node);
1230 * helper to add 'address of tree root -> reloc tree' mapping
1232 static int __must_check __add_reloc_root(struct btrfs_root *root)
1234 struct rb_node *rb_node;
1235 struct mapping_node *node;
1236 struct reloc_control *rc = root->fs_info->reloc_ctl;
1238 node = kmalloc(sizeof(*node), GFP_NOFS);
1242 node->bytenr = root->node->start;
1245 spin_lock(&rc->reloc_root_tree.lock);
1246 rb_node = tree_insert(&rc->reloc_root_tree.rb_root,
1247 node->bytenr, &node->rb_node);
1248 spin_unlock(&rc->reloc_root_tree.lock);
1250 btrfs_panic(root->fs_info, -EEXIST, "Duplicate root found "
1251 "for start=%llu while inserting into relocation "
1252 "tree\n", node->bytenr);
1257 list_add_tail(&root->root_list, &rc->reloc_roots);
1262 * helper to update/delete the 'address of tree root -> reloc tree'
1265 static int __update_reloc_root(struct btrfs_root *root, int del)
1267 struct rb_node *rb_node;
1268 struct mapping_node *node = NULL;
1269 struct reloc_control *rc = root->fs_info->reloc_ctl;
1271 spin_lock(&rc->reloc_root_tree.lock);
1272 rb_node = tree_search(&rc->reloc_root_tree.rb_root,
1273 root->commit_root->start);
1275 node = rb_entry(rb_node, struct mapping_node, rb_node);
1276 rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
1278 spin_unlock(&rc->reloc_root_tree.lock);
1282 BUG_ON((struct btrfs_root *)node->data != root);
1285 spin_lock(&rc->reloc_root_tree.lock);
1286 node->bytenr = root->node->start;
1287 rb_node = tree_insert(&rc->reloc_root_tree.rb_root,
1288 node->bytenr, &node->rb_node);
1289 spin_unlock(&rc->reloc_root_tree.lock);
1291 backref_tree_panic(rb_node, -EEXIST, node->bytenr);
1293 spin_lock(&root->fs_info->trans_lock);
1294 list_del_init(&root->root_list);
1295 spin_unlock(&root->fs_info->trans_lock);
1301 static struct btrfs_root *create_reloc_root(struct btrfs_trans_handle *trans,
1302 struct btrfs_root *root, u64 objectid)
1304 struct btrfs_root *reloc_root;
1305 struct extent_buffer *eb;
1306 struct btrfs_root_item *root_item;
1307 struct btrfs_key root_key;
1310 root_item = kmalloc(sizeof(*root_item), GFP_NOFS);
1313 root_key.objectid = BTRFS_TREE_RELOC_OBJECTID;
1314 root_key.type = BTRFS_ROOT_ITEM_KEY;
1315 root_key.offset = objectid;
1317 if (root->root_key.objectid == objectid) {
1318 /* called by btrfs_init_reloc_root */
1319 ret = btrfs_copy_root(trans, root, root->commit_root, &eb,
1320 BTRFS_TREE_RELOC_OBJECTID);
1323 btrfs_set_root_last_snapshot(&root->root_item,
1324 trans->transid - 1);
1327 * called by btrfs_reloc_post_snapshot_hook.
1328 * the source tree is a reloc tree, all tree blocks
1329 * modified after it was created have RELOC flag
1330 * set in their headers. so it's OK to not update
1331 * the 'last_snapshot'.
1333 ret = btrfs_copy_root(trans, root, root->node, &eb,
1334 BTRFS_TREE_RELOC_OBJECTID);
1338 memcpy(root_item, &root->root_item, sizeof(*root_item));
1339 btrfs_set_root_bytenr(root_item, eb->start);
1340 btrfs_set_root_level(root_item, btrfs_header_level(eb));
1341 btrfs_set_root_generation(root_item, trans->transid);
1343 if (root->root_key.objectid == objectid) {
1344 btrfs_set_root_refs(root_item, 0);
1345 memset(&root_item->drop_progress, 0,
1346 sizeof(struct btrfs_disk_key));
1347 root_item->drop_level = 0;
1350 btrfs_tree_unlock(eb);
1351 free_extent_buffer(eb);
1353 ret = btrfs_insert_root(trans, root->fs_info->tree_root,
1354 &root_key, root_item);
1358 reloc_root = btrfs_read_fs_root(root->fs_info->tree_root, &root_key);
1359 BUG_ON(IS_ERR(reloc_root));
1360 reloc_root->last_trans = trans->transid;
1365 * create reloc tree for a given fs tree. reloc tree is just a
1366 * snapshot of the fs tree with special root objectid.
1368 int btrfs_init_reloc_root(struct btrfs_trans_handle *trans,
1369 struct btrfs_root *root)
1371 struct btrfs_root *reloc_root;
1372 struct reloc_control *rc = root->fs_info->reloc_ctl;
1376 if (root->reloc_root) {
1377 reloc_root = root->reloc_root;
1378 reloc_root->last_trans = trans->transid;
1382 if (!rc || !rc->create_reloc_tree ||
1383 root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID)
1386 if (!trans->block_rsv) {
1387 trans->block_rsv = rc->block_rsv;
1390 reloc_root = create_reloc_root(trans, root, root->root_key.objectid);
1392 trans->block_rsv = NULL;
1394 ret = __add_reloc_root(reloc_root);
1396 root->reloc_root = reloc_root;
1401 * update root item of reloc tree
1403 int btrfs_update_reloc_root(struct btrfs_trans_handle *trans,
1404 struct btrfs_root *root)
1406 struct btrfs_root *reloc_root;
1407 struct btrfs_root_item *root_item;
1411 if (!root->reloc_root)
1414 reloc_root = root->reloc_root;
1415 root_item = &reloc_root->root_item;
1417 if (root->fs_info->reloc_ctl->merge_reloc_tree &&
1418 btrfs_root_refs(root_item) == 0) {
1419 root->reloc_root = NULL;
1423 __update_reloc_root(reloc_root, del);
1425 if (reloc_root->commit_root != reloc_root->node) {
1426 btrfs_set_root_node(root_item, reloc_root->node);
1427 free_extent_buffer(reloc_root->commit_root);
1428 reloc_root->commit_root = btrfs_root_node(reloc_root);
1431 ret = btrfs_update_root(trans, root->fs_info->tree_root,
1432 &reloc_root->root_key, root_item);
1440 * helper to find first cached inode with inode number >= objectid
1443 static struct inode *find_next_inode(struct btrfs_root *root, u64 objectid)
1445 struct rb_node *node;
1446 struct rb_node *prev;
1447 struct btrfs_inode *entry;
1448 struct inode *inode;
1450 spin_lock(&root->inode_lock);
1452 node = root->inode_tree.rb_node;
1456 entry = rb_entry(node, struct btrfs_inode, rb_node);
1458 if (objectid < btrfs_ino(&entry->vfs_inode))
1459 node = node->rb_left;
1460 else if (objectid > btrfs_ino(&entry->vfs_inode))
1461 node = node->rb_right;
1467 entry = rb_entry(prev, struct btrfs_inode, rb_node);
1468 if (objectid <= btrfs_ino(&entry->vfs_inode)) {
1472 prev = rb_next(prev);
1476 entry = rb_entry(node, struct btrfs_inode, rb_node);
1477 inode = igrab(&entry->vfs_inode);
1479 spin_unlock(&root->inode_lock);
1483 objectid = btrfs_ino(&entry->vfs_inode) + 1;
1484 if (cond_resched_lock(&root->inode_lock))
1487 node = rb_next(node);
1489 spin_unlock(&root->inode_lock);
1493 static int in_block_group(u64 bytenr,
1494 struct btrfs_block_group_cache *block_group)
1496 if (bytenr >= block_group->key.objectid &&
1497 bytenr < block_group->key.objectid + block_group->key.offset)
1503 * get new location of data
1505 static int get_new_location(struct inode *reloc_inode, u64 *new_bytenr,
1506 u64 bytenr, u64 num_bytes)
1508 struct btrfs_root *root = BTRFS_I(reloc_inode)->root;
1509 struct btrfs_path *path;
1510 struct btrfs_file_extent_item *fi;
1511 struct extent_buffer *leaf;
1514 path = btrfs_alloc_path();
1518 bytenr -= BTRFS_I(reloc_inode)->index_cnt;
1519 ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(reloc_inode),
1528 leaf = path->nodes[0];
1529 fi = btrfs_item_ptr(leaf, path->slots[0],
1530 struct btrfs_file_extent_item);
1532 BUG_ON(btrfs_file_extent_offset(leaf, fi) ||
1533 btrfs_file_extent_compression(leaf, fi) ||
1534 btrfs_file_extent_encryption(leaf, fi) ||
1535 btrfs_file_extent_other_encoding(leaf, fi));
1537 if (num_bytes != btrfs_file_extent_disk_num_bytes(leaf, fi)) {
1542 *new_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1545 btrfs_free_path(path);
1550 * update file extent items in the tree leaf to point to
1551 * the new locations.
1553 static noinline_for_stack
1554 int replace_file_extents(struct btrfs_trans_handle *trans,
1555 struct reloc_control *rc,
1556 struct btrfs_root *root,
1557 struct extent_buffer *leaf)
1559 struct btrfs_key key;
1560 struct btrfs_file_extent_item *fi;
1561 struct inode *inode = NULL;
1573 if (rc->stage != UPDATE_DATA_PTRS)
1576 /* reloc trees always use full backref */
1577 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID)
1578 parent = leaf->start;
1582 nritems = btrfs_header_nritems(leaf);
1583 for (i = 0; i < nritems; i++) {
1585 btrfs_item_key_to_cpu(leaf, &key, i);
1586 if (key.type != BTRFS_EXTENT_DATA_KEY)
1588 fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item);
1589 if (btrfs_file_extent_type(leaf, fi) ==
1590 BTRFS_FILE_EXTENT_INLINE)
1592 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1593 num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi);
1596 if (!in_block_group(bytenr, rc->block_group))
1600 * if we are modifying block in fs tree, wait for readpage
1601 * to complete and drop the extent cache
1603 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) {
1605 inode = find_next_inode(root, key.objectid);
1607 } else if (inode && btrfs_ino(inode) < key.objectid) {
1608 btrfs_add_delayed_iput(inode);
1609 inode = find_next_inode(root, key.objectid);
1611 if (inode && btrfs_ino(inode) == key.objectid) {
1613 btrfs_file_extent_num_bytes(leaf, fi);
1614 WARN_ON(!IS_ALIGNED(key.offset,
1616 WARN_ON(!IS_ALIGNED(end, root->sectorsize));
1618 ret = try_lock_extent(&BTRFS_I(inode)->io_tree,
1623 btrfs_drop_extent_cache(inode, key.offset, end,
1625 unlock_extent(&BTRFS_I(inode)->io_tree,
1630 ret = get_new_location(rc->data_inode, &new_bytenr,
1638 btrfs_set_file_extent_disk_bytenr(leaf, fi, new_bytenr);
1641 key.offset -= btrfs_file_extent_offset(leaf, fi);
1642 ret = btrfs_inc_extent_ref(trans, root, new_bytenr,
1644 btrfs_header_owner(leaf),
1645 key.objectid, key.offset, 1);
1648 ret = btrfs_free_extent(trans, root, bytenr, num_bytes,
1649 parent, btrfs_header_owner(leaf),
1650 key.objectid, key.offset, 1);
1654 btrfs_mark_buffer_dirty(leaf);
1656 btrfs_add_delayed_iput(inode);
1660 static noinline_for_stack
1661 int memcmp_node_keys(struct extent_buffer *eb, int slot,
1662 struct btrfs_path *path, int level)
1664 struct btrfs_disk_key key1;
1665 struct btrfs_disk_key key2;
1666 btrfs_node_key(eb, &key1, slot);
1667 btrfs_node_key(path->nodes[level], &key2, path->slots[level]);
1668 return memcmp(&key1, &key2, sizeof(key1));
1672 * try to replace tree blocks in fs tree with the new blocks
1673 * in reloc tree. tree blocks haven't been modified since the
1674 * reloc tree was create can be replaced.
1676 * if a block was replaced, level of the block + 1 is returned.
1677 * if no block got replaced, 0 is returned. if there are other
1678 * errors, a negative error number is returned.
1680 static noinline_for_stack
1681 int replace_path(struct btrfs_trans_handle *trans,
1682 struct btrfs_root *dest, struct btrfs_root *src,
1683 struct btrfs_path *path, struct btrfs_key *next_key,
1684 int lowest_level, int max_level)
1686 struct extent_buffer *eb;
1687 struct extent_buffer *parent;
1688 struct btrfs_key key;
1700 BUG_ON(src->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID);
1701 BUG_ON(dest->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID);
1703 last_snapshot = btrfs_root_last_snapshot(&src->root_item);
1705 slot = path->slots[lowest_level];
1706 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot);
1708 eb = btrfs_lock_root_node(dest);
1709 btrfs_set_lock_blocking(eb);
1710 level = btrfs_header_level(eb);
1712 if (level < lowest_level) {
1713 btrfs_tree_unlock(eb);
1714 free_extent_buffer(eb);
1719 ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb);
1722 btrfs_set_lock_blocking(eb);
1725 next_key->objectid = (u64)-1;
1726 next_key->type = (u8)-1;
1727 next_key->offset = (u64)-1;
1732 level = btrfs_header_level(parent);
1733 BUG_ON(level < lowest_level);
1735 ret = btrfs_bin_search(parent, &key, level, &slot);
1736 if (ret && slot > 0)
1739 if (next_key && slot + 1 < btrfs_header_nritems(parent))
1740 btrfs_node_key_to_cpu(parent, next_key, slot + 1);
1742 old_bytenr = btrfs_node_blockptr(parent, slot);
1743 blocksize = btrfs_level_size(dest, level - 1);
1744 old_ptr_gen = btrfs_node_ptr_generation(parent, slot);
1746 if (level <= max_level) {
1747 eb = path->nodes[level];
1748 new_bytenr = btrfs_node_blockptr(eb,
1749 path->slots[level]);
1750 new_ptr_gen = btrfs_node_ptr_generation(eb,
1751 path->slots[level]);
1757 if (new_bytenr > 0 && new_bytenr == old_bytenr) {
1763 if (new_bytenr == 0 || old_ptr_gen > last_snapshot ||
1764 memcmp_node_keys(parent, slot, path, level)) {
1765 if (level <= lowest_level) {
1770 eb = read_tree_block(dest, old_bytenr, blocksize,
1772 if (!eb || !extent_buffer_uptodate(eb)) {
1773 ret = (!eb) ? -ENOMEM : -EIO;
1774 free_extent_buffer(eb);
1777 btrfs_tree_lock(eb);
1779 ret = btrfs_cow_block(trans, dest, eb, parent,
1783 btrfs_set_lock_blocking(eb);
1785 btrfs_tree_unlock(parent);
1786 free_extent_buffer(parent);
1793 btrfs_tree_unlock(parent);
1794 free_extent_buffer(parent);
1799 btrfs_node_key_to_cpu(path->nodes[level], &key,
1800 path->slots[level]);
1801 btrfs_release_path(path);
1803 path->lowest_level = level;
1804 ret = btrfs_search_slot(trans, src, &key, path, 0, 1);
1805 path->lowest_level = 0;
1809 * swap blocks in fs tree and reloc tree.
1811 btrfs_set_node_blockptr(parent, slot, new_bytenr);
1812 btrfs_set_node_ptr_generation(parent, slot, new_ptr_gen);
1813 btrfs_mark_buffer_dirty(parent);
1815 btrfs_set_node_blockptr(path->nodes[level],
1816 path->slots[level], old_bytenr);
1817 btrfs_set_node_ptr_generation(path->nodes[level],
1818 path->slots[level], old_ptr_gen);
1819 btrfs_mark_buffer_dirty(path->nodes[level]);
1821 ret = btrfs_inc_extent_ref(trans, src, old_bytenr, blocksize,
1822 path->nodes[level]->start,
1823 src->root_key.objectid, level - 1, 0,
1826 ret = btrfs_inc_extent_ref(trans, dest, new_bytenr, blocksize,
1827 0, dest->root_key.objectid, level - 1,
1831 ret = btrfs_free_extent(trans, src, new_bytenr, blocksize,
1832 path->nodes[level]->start,
1833 src->root_key.objectid, level - 1, 0,
1837 ret = btrfs_free_extent(trans, dest, old_bytenr, blocksize,
1838 0, dest->root_key.objectid, level - 1,
1842 btrfs_unlock_up_safe(path, 0);
1847 btrfs_tree_unlock(parent);
1848 free_extent_buffer(parent);
1853 * helper to find next relocated block in reloc tree
1855 static noinline_for_stack
1856 int walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path,
1859 struct extent_buffer *eb;
1864 last_snapshot = btrfs_root_last_snapshot(&root->root_item);
1866 for (i = 0; i < *level; i++) {
1867 free_extent_buffer(path->nodes[i]);
1868 path->nodes[i] = NULL;
1871 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
1872 eb = path->nodes[i];
1873 nritems = btrfs_header_nritems(eb);
1874 while (path->slots[i] + 1 < nritems) {
1876 if (btrfs_node_ptr_generation(eb, path->slots[i]) <=
1883 free_extent_buffer(path->nodes[i]);
1884 path->nodes[i] = NULL;
1890 * walk down reloc tree to find relocated block of lowest level
1892 static noinline_for_stack
1893 int walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path,
1896 struct extent_buffer *eb = NULL;
1904 last_snapshot = btrfs_root_last_snapshot(&root->root_item);
1906 for (i = *level; i > 0; i--) {
1907 eb = path->nodes[i];
1908 nritems = btrfs_header_nritems(eb);
1909 while (path->slots[i] < nritems) {
1910 ptr_gen = btrfs_node_ptr_generation(eb, path->slots[i]);
1911 if (ptr_gen > last_snapshot)
1915 if (path->slots[i] >= nritems) {
1926 bytenr = btrfs_node_blockptr(eb, path->slots[i]);
1927 blocksize = btrfs_level_size(root, i - 1);
1928 eb = read_tree_block(root, bytenr, blocksize, ptr_gen);
1929 if (!eb || !extent_buffer_uptodate(eb)) {
1930 free_extent_buffer(eb);
1933 BUG_ON(btrfs_header_level(eb) != i - 1);
1934 path->nodes[i - 1] = eb;
1935 path->slots[i - 1] = 0;
1941 * invalidate extent cache for file extents whose key in range of
1942 * [min_key, max_key)
1944 static int invalidate_extent_cache(struct btrfs_root *root,
1945 struct btrfs_key *min_key,
1946 struct btrfs_key *max_key)
1948 struct inode *inode = NULL;
1953 objectid = min_key->objectid;
1958 if (objectid > max_key->objectid)
1961 inode = find_next_inode(root, objectid);
1964 ino = btrfs_ino(inode);
1966 if (ino > max_key->objectid) {
1972 if (!S_ISREG(inode->i_mode))
1975 if (unlikely(min_key->objectid == ino)) {
1976 if (min_key->type > BTRFS_EXTENT_DATA_KEY)
1978 if (min_key->type < BTRFS_EXTENT_DATA_KEY)
1981 start = min_key->offset;
1982 WARN_ON(!IS_ALIGNED(start, root->sectorsize));
1988 if (unlikely(max_key->objectid == ino)) {
1989 if (max_key->type < BTRFS_EXTENT_DATA_KEY)
1991 if (max_key->type > BTRFS_EXTENT_DATA_KEY) {
1994 if (max_key->offset == 0)
1996 end = max_key->offset;
1997 WARN_ON(!IS_ALIGNED(end, root->sectorsize));
2004 /* the lock_extent waits for readpage to complete */
2005 lock_extent(&BTRFS_I(inode)->io_tree, start, end);
2006 btrfs_drop_extent_cache(inode, start, end, 1);
2007 unlock_extent(&BTRFS_I(inode)->io_tree, start, end);
2012 static int find_next_key(struct btrfs_path *path, int level,
2013 struct btrfs_key *key)
2016 while (level < BTRFS_MAX_LEVEL) {
2017 if (!path->nodes[level])
2019 if (path->slots[level] + 1 <
2020 btrfs_header_nritems(path->nodes[level])) {
2021 btrfs_node_key_to_cpu(path->nodes[level], key,
2022 path->slots[level] + 1);
2031 * merge the relocated tree blocks in reloc tree with corresponding
2034 static noinline_for_stack int merge_reloc_root(struct reloc_control *rc,
2035 struct btrfs_root *root)
2037 LIST_HEAD(inode_list);
2038 struct btrfs_key key;
2039 struct btrfs_key next_key;
2040 struct btrfs_trans_handle *trans;
2041 struct btrfs_root *reloc_root;
2042 struct btrfs_root_item *root_item;
2043 struct btrfs_path *path;
2044 struct extent_buffer *leaf;
2052 path = btrfs_alloc_path();
2057 reloc_root = root->reloc_root;
2058 root_item = &reloc_root->root_item;
2060 if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) {
2061 level = btrfs_root_level(root_item);
2062 extent_buffer_get(reloc_root->node);
2063 path->nodes[level] = reloc_root->node;
2064 path->slots[level] = 0;
2066 btrfs_disk_key_to_cpu(&key, &root_item->drop_progress);
2068 level = root_item->drop_level;
2070 path->lowest_level = level;
2071 ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0);
2072 path->lowest_level = 0;
2074 btrfs_free_path(path);
2078 btrfs_node_key_to_cpu(path->nodes[level], &next_key,
2079 path->slots[level]);
2080 WARN_ON(memcmp(&key, &next_key, sizeof(key)));
2082 btrfs_unlock_up_safe(path, 0);
2085 min_reserved = root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2;
2086 memset(&next_key, 0, sizeof(next_key));
2089 trans = btrfs_start_transaction(root, 0);
2090 BUG_ON(IS_ERR(trans));
2091 trans->block_rsv = rc->block_rsv;
2093 ret = btrfs_block_rsv_refill(root, rc->block_rsv, min_reserved,
2094 BTRFS_RESERVE_FLUSH_ALL);
2096 BUG_ON(ret != -EAGAIN);
2097 ret = btrfs_commit_transaction(trans, root);
2105 ret = walk_down_reloc_tree(reloc_root, path, &level);
2113 if (!find_next_key(path, level, &key) &&
2114 btrfs_comp_cpu_keys(&next_key, &key) >= 0) {
2117 ret = replace_path(trans, root, reloc_root, path,
2118 &next_key, level, max_level);
2127 btrfs_node_key_to_cpu(path->nodes[level], &key,
2128 path->slots[level]);
2132 ret = walk_up_reloc_tree(reloc_root, path, &level);
2138 * save the merging progress in the drop_progress.
2139 * this is OK since root refs == 1 in this case.
2141 btrfs_node_key(path->nodes[level], &root_item->drop_progress,
2142 path->slots[level]);
2143 root_item->drop_level = level;
2145 btrfs_end_transaction_throttle(trans, root);
2147 btrfs_btree_balance_dirty(root);
2149 if (replaced && rc->stage == UPDATE_DATA_PTRS)
2150 invalidate_extent_cache(root, &key, &next_key);
2154 * handle the case only one block in the fs tree need to be
2155 * relocated and the block is tree root.
2157 leaf = btrfs_lock_root_node(root);
2158 ret = btrfs_cow_block(trans, root, leaf, NULL, 0, &leaf);
2159 btrfs_tree_unlock(leaf);
2160 free_extent_buffer(leaf);
2164 btrfs_free_path(path);
2167 memset(&root_item->drop_progress, 0,
2168 sizeof(root_item->drop_progress));
2169 root_item->drop_level = 0;
2170 btrfs_set_root_refs(root_item, 0);
2171 btrfs_update_reloc_root(trans, root);
2174 btrfs_end_transaction_throttle(trans, root);
2176 btrfs_btree_balance_dirty(root);
2178 if (replaced && rc->stage == UPDATE_DATA_PTRS)
2179 invalidate_extent_cache(root, &key, &next_key);
2184 static noinline_for_stack
2185 int prepare_to_merge(struct reloc_control *rc, int err)
2187 struct btrfs_root *root = rc->extent_root;
2188 struct btrfs_root *reloc_root;
2189 struct btrfs_trans_handle *trans;
2190 LIST_HEAD(reloc_roots);
2194 mutex_lock(&root->fs_info->reloc_mutex);
2195 rc->merging_rsv_size += root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2;
2196 rc->merging_rsv_size += rc->nodes_relocated * 2;
2197 mutex_unlock(&root->fs_info->reloc_mutex);
2201 num_bytes = rc->merging_rsv_size;
2202 ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes,
2203 BTRFS_RESERVE_FLUSH_ALL);
2208 trans = btrfs_join_transaction(rc->extent_root);
2209 if (IS_ERR(trans)) {
2211 btrfs_block_rsv_release(rc->extent_root,
2212 rc->block_rsv, num_bytes);
2213 return PTR_ERR(trans);
2217 if (num_bytes != rc->merging_rsv_size) {
2218 btrfs_end_transaction(trans, rc->extent_root);
2219 btrfs_block_rsv_release(rc->extent_root,
2220 rc->block_rsv, num_bytes);
2225 rc->merge_reloc_tree = 1;
2227 while (!list_empty(&rc->reloc_roots)) {
2228 reloc_root = list_entry(rc->reloc_roots.next,
2229 struct btrfs_root, root_list);
2230 list_del_init(&reloc_root->root_list);
2232 root = read_fs_root(reloc_root->fs_info,
2233 reloc_root->root_key.offset);
2234 BUG_ON(IS_ERR(root));
2235 BUG_ON(root->reloc_root != reloc_root);
2238 * set reference count to 1, so btrfs_recover_relocation
2239 * knows it should resumes merging
2242 btrfs_set_root_refs(&reloc_root->root_item, 1);
2243 btrfs_update_reloc_root(trans, root);
2245 list_add(&reloc_root->root_list, &reloc_roots);
2248 list_splice(&reloc_roots, &rc->reloc_roots);
2251 btrfs_commit_transaction(trans, rc->extent_root);
2253 btrfs_end_transaction(trans, rc->extent_root);
2257 static noinline_for_stack
2258 void free_reloc_roots(struct list_head *list)
2260 struct btrfs_root *reloc_root;
2262 while (!list_empty(list)) {
2263 reloc_root = list_entry(list->next, struct btrfs_root,
2265 __update_reloc_root(reloc_root, 1);
2266 free_extent_buffer(reloc_root->node);
2267 free_extent_buffer(reloc_root->commit_root);
2272 static noinline_for_stack
2273 int merge_reloc_roots(struct reloc_control *rc)
2275 struct btrfs_root *root;
2276 struct btrfs_root *reloc_root;
2277 LIST_HEAD(reloc_roots);
2281 root = rc->extent_root;
2284 * this serializes us with btrfs_record_root_in_transaction,
2285 * we have to make sure nobody is in the middle of
2286 * adding their roots to the list while we are
2289 mutex_lock(&root->fs_info->reloc_mutex);
2290 list_splice_init(&rc->reloc_roots, &reloc_roots);
2291 mutex_unlock(&root->fs_info->reloc_mutex);
2293 while (!list_empty(&reloc_roots)) {
2295 reloc_root = list_entry(reloc_roots.next,
2296 struct btrfs_root, root_list);
2298 if (btrfs_root_refs(&reloc_root->root_item) > 0) {
2299 root = read_fs_root(reloc_root->fs_info,
2300 reloc_root->root_key.offset);
2301 BUG_ON(IS_ERR(root));
2302 BUG_ON(root->reloc_root != reloc_root);
2304 ret = merge_reloc_root(rc, root);
2308 list_del_init(&reloc_root->root_list);
2310 ret = btrfs_drop_snapshot(reloc_root, rc->block_rsv, 0, 1);
2312 if (list_empty(&reloc_root->root_list))
2313 list_add_tail(&reloc_root->root_list,
2325 btrfs_std_error(root->fs_info, ret);
2326 if (!list_empty(&reloc_roots))
2327 free_reloc_roots(&reloc_roots);
2330 BUG_ON(!RB_EMPTY_ROOT(&rc->reloc_root_tree.rb_root));
2334 static void free_block_list(struct rb_root *blocks)
2336 struct tree_block *block;
2337 struct rb_node *rb_node;
2338 while ((rb_node = rb_first(blocks))) {
2339 block = rb_entry(rb_node, struct tree_block, rb_node);
2340 rb_erase(rb_node, blocks);
2345 static int record_reloc_root_in_trans(struct btrfs_trans_handle *trans,
2346 struct btrfs_root *reloc_root)
2348 struct btrfs_root *root;
2350 if (reloc_root->last_trans == trans->transid)
2353 root = read_fs_root(reloc_root->fs_info, reloc_root->root_key.offset);
2354 BUG_ON(IS_ERR(root));
2355 BUG_ON(root->reloc_root != reloc_root);
2357 return btrfs_record_root_in_trans(trans, root);
2360 static noinline_for_stack
2361 struct btrfs_root *select_reloc_root(struct btrfs_trans_handle *trans,
2362 struct reloc_control *rc,
2363 struct backref_node *node,
2364 struct backref_edge *edges[], int *nr)
2366 struct backref_node *next;
2367 struct btrfs_root *root;
2373 next = walk_up_backref(next, edges, &index);
2376 BUG_ON(!root->ref_cows);
2378 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) {
2379 record_reloc_root_in_trans(trans, root);
2383 btrfs_record_root_in_trans(trans, root);
2384 root = root->reloc_root;
2386 if (next->new_bytenr != root->node->start) {
2387 BUG_ON(next->new_bytenr);
2388 BUG_ON(!list_empty(&next->list));
2389 next->new_bytenr = root->node->start;
2391 list_add_tail(&next->list,
2392 &rc->backref_cache.changed);
2393 __mark_block_processed(rc, next);
2399 next = walk_down_backref(edges, &index);
2400 if (!next || next->level <= node->level)
2408 /* setup backref node path for btrfs_reloc_cow_block */
2410 rc->backref_cache.path[next->level] = next;
2413 next = edges[index]->node[UPPER];
2419 * select a tree root for relocation. return NULL if the block
2420 * is reference counted. we should use do_relocation() in this
2421 * case. return a tree root pointer if the block isn't reference
2422 * counted. return -ENOENT if the block is root of reloc tree.
2424 static noinline_for_stack
2425 struct btrfs_root *select_one_root(struct btrfs_trans_handle *trans,
2426 struct backref_node *node)
2428 struct backref_node *next;
2429 struct btrfs_root *root;
2430 struct btrfs_root *fs_root = NULL;
2431 struct backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2437 next = walk_up_backref(next, edges, &index);
2441 /* no other choice for non-references counted tree */
2442 if (!root->ref_cows)
2445 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID)
2451 next = walk_down_backref(edges, &index);
2452 if (!next || next->level <= node->level)
2457 return ERR_PTR(-ENOENT);
2461 static noinline_for_stack
2462 u64 calcu_metadata_size(struct reloc_control *rc,
2463 struct backref_node *node, int reserve)
2465 struct backref_node *next = node;
2466 struct backref_edge *edge;
2467 struct backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2471 BUG_ON(reserve && node->processed);
2476 if (next->processed && (reserve || next != node))
2479 num_bytes += btrfs_level_size(rc->extent_root,
2482 if (list_empty(&next->upper))
2485 edge = list_entry(next->upper.next,
2486 struct backref_edge, list[LOWER]);
2487 edges[index++] = edge;
2488 next = edge->node[UPPER];
2490 next = walk_down_backref(edges, &index);
2495 static int reserve_metadata_space(struct btrfs_trans_handle *trans,
2496 struct reloc_control *rc,
2497 struct backref_node *node)
2499 struct btrfs_root *root = rc->extent_root;
2503 num_bytes = calcu_metadata_size(rc, node, 1) * 2;
2505 trans->block_rsv = rc->block_rsv;
2506 ret = btrfs_block_rsv_add(root, rc->block_rsv, num_bytes,
2507 BTRFS_RESERVE_FLUSH_ALL);
2510 rc->commit_transaction = 1;
2517 static void release_metadata_space(struct reloc_control *rc,
2518 struct backref_node *node)
2520 u64 num_bytes = calcu_metadata_size(rc, node, 0) * 2;
2521 btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, num_bytes);
2525 * relocate a block tree, and then update pointers in upper level
2526 * blocks that reference the block to point to the new location.
2528 * if called by link_to_upper, the block has already been relocated.
2529 * in that case this function just updates pointers.
2531 static int do_relocation(struct btrfs_trans_handle *trans,
2532 struct reloc_control *rc,
2533 struct backref_node *node,
2534 struct btrfs_key *key,
2535 struct btrfs_path *path, int lowest)
2537 struct backref_node *upper;
2538 struct backref_edge *edge;
2539 struct backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2540 struct btrfs_root *root;
2541 struct extent_buffer *eb;
2550 BUG_ON(lowest && node->eb);
2552 path->lowest_level = node->level + 1;
2553 rc->backref_cache.path[node->level] = node;
2554 list_for_each_entry(edge, &node->upper, list[LOWER]) {
2557 upper = edge->node[UPPER];
2558 root = select_reloc_root(trans, rc, upper, edges, &nr);
2561 if (upper->eb && !upper->locked) {
2563 ret = btrfs_bin_search(upper->eb, key,
2564 upper->level, &slot);
2566 bytenr = btrfs_node_blockptr(upper->eb, slot);
2567 if (node->eb->start == bytenr)
2570 drop_node_buffer(upper);
2574 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
2582 upper->eb = path->nodes[upper->level];
2583 path->nodes[upper->level] = NULL;
2585 BUG_ON(upper->eb != path->nodes[upper->level]);
2589 path->locks[upper->level] = 0;
2591 slot = path->slots[upper->level];
2592 btrfs_release_path(path);
2594 ret = btrfs_bin_search(upper->eb, key, upper->level,
2599 bytenr = btrfs_node_blockptr(upper->eb, slot);
2601 BUG_ON(bytenr != node->bytenr);
2603 if (node->eb->start == bytenr)
2607 blocksize = btrfs_level_size(root, node->level);
2608 generation = btrfs_node_ptr_generation(upper->eb, slot);
2609 eb = read_tree_block(root, bytenr, blocksize, generation);
2610 if (!eb || !extent_buffer_uptodate(eb)) {
2611 free_extent_buffer(eb);
2615 btrfs_tree_lock(eb);
2616 btrfs_set_lock_blocking(eb);
2619 ret = btrfs_cow_block(trans, root, eb, upper->eb,
2621 btrfs_tree_unlock(eb);
2622 free_extent_buffer(eb);
2627 BUG_ON(node->eb != eb);
2629 btrfs_set_node_blockptr(upper->eb, slot,
2631 btrfs_set_node_ptr_generation(upper->eb, slot,
2633 btrfs_mark_buffer_dirty(upper->eb);
2635 ret = btrfs_inc_extent_ref(trans, root,
2636 node->eb->start, blocksize,
2638 btrfs_header_owner(upper->eb),
2642 ret = btrfs_drop_subtree(trans, root, eb, upper->eb);
2646 if (!upper->pending)
2647 drop_node_buffer(upper);
2649 unlock_node_buffer(upper);
2654 if (!err && node->pending) {
2655 drop_node_buffer(node);
2656 list_move_tail(&node->list, &rc->backref_cache.changed);
2660 path->lowest_level = 0;
2661 BUG_ON(err == -ENOSPC);
2665 static int link_to_upper(struct btrfs_trans_handle *trans,
2666 struct reloc_control *rc,
2667 struct backref_node *node,
2668 struct btrfs_path *path)
2670 struct btrfs_key key;
2672 btrfs_node_key_to_cpu(node->eb, &key, 0);
2673 return do_relocation(trans, rc, node, &key, path, 0);
2676 static int finish_pending_nodes(struct btrfs_trans_handle *trans,
2677 struct reloc_control *rc,
2678 struct btrfs_path *path, int err)
2681 struct backref_cache *cache = &rc->backref_cache;
2682 struct backref_node *node;
2686 for (level = 0; level < BTRFS_MAX_LEVEL; level++) {
2687 while (!list_empty(&cache->pending[level])) {
2688 node = list_entry(cache->pending[level].next,
2689 struct backref_node, list);
2690 list_move_tail(&node->list, &list);
2691 BUG_ON(!node->pending);
2694 ret = link_to_upper(trans, rc, node, path);
2699 list_splice_init(&list, &cache->pending[level]);
2704 static void mark_block_processed(struct reloc_control *rc,
2705 u64 bytenr, u32 blocksize)
2707 set_extent_bits(&rc->processed_blocks, bytenr, bytenr + blocksize - 1,
2708 EXTENT_DIRTY, GFP_NOFS);
2711 static void __mark_block_processed(struct reloc_control *rc,
2712 struct backref_node *node)
2715 if (node->level == 0 ||
2716 in_block_group(node->bytenr, rc->block_group)) {
2717 blocksize = btrfs_level_size(rc->extent_root, node->level);
2718 mark_block_processed(rc, node->bytenr, blocksize);
2720 node->processed = 1;
2724 * mark a block and all blocks directly/indirectly reference the block
2727 static void update_processed_blocks(struct reloc_control *rc,
2728 struct backref_node *node)
2730 struct backref_node *next = node;
2731 struct backref_edge *edge;
2732 struct backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2738 if (next->processed)
2741 __mark_block_processed(rc, next);
2743 if (list_empty(&next->upper))
2746 edge = list_entry(next->upper.next,
2747 struct backref_edge, list[LOWER]);
2748 edges[index++] = edge;
2749 next = edge->node[UPPER];
2751 next = walk_down_backref(edges, &index);
2755 static int tree_block_processed(u64 bytenr, u32 blocksize,
2756 struct reloc_control *rc)
2758 if (test_range_bit(&rc->processed_blocks, bytenr,
2759 bytenr + blocksize - 1, EXTENT_DIRTY, 1, NULL))
2764 static int get_tree_block_key(struct reloc_control *rc,
2765 struct tree_block *block)
2767 struct extent_buffer *eb;
2769 BUG_ON(block->key_ready);
2770 eb = read_tree_block(rc->extent_root, block->bytenr,
2771 block->key.objectid, block->key.offset);
2772 if (!eb || !extent_buffer_uptodate(eb)) {
2773 free_extent_buffer(eb);
2776 WARN_ON(btrfs_header_level(eb) != block->level);
2777 if (block->level == 0)
2778 btrfs_item_key_to_cpu(eb, &block->key, 0);
2780 btrfs_node_key_to_cpu(eb, &block->key, 0);
2781 free_extent_buffer(eb);
2782 block->key_ready = 1;
2786 static int reada_tree_block(struct reloc_control *rc,
2787 struct tree_block *block)
2789 BUG_ON(block->key_ready);
2790 if (block->key.type == BTRFS_METADATA_ITEM_KEY)
2791 readahead_tree_block(rc->extent_root, block->bytenr,
2792 block->key.objectid,
2793 rc->extent_root->leafsize);
2795 readahead_tree_block(rc->extent_root, block->bytenr,
2796 block->key.objectid, block->key.offset);
2801 * helper function to relocate a tree block
2803 static int relocate_tree_block(struct btrfs_trans_handle *trans,
2804 struct reloc_control *rc,
2805 struct backref_node *node,
2806 struct btrfs_key *key,
2807 struct btrfs_path *path)
2809 struct btrfs_root *root;
2816 BUG_ON(node->processed);
2817 root = select_one_root(trans, node);
2818 if (root == ERR_PTR(-ENOENT)) {
2819 update_processed_blocks(rc, node);
2823 if (!root || root->ref_cows) {
2824 ret = reserve_metadata_space(trans, rc, node);
2831 if (root->ref_cows) {
2832 BUG_ON(node->new_bytenr);
2833 BUG_ON(!list_empty(&node->list));
2834 btrfs_record_root_in_trans(trans, root);
2835 root = root->reloc_root;
2836 node->new_bytenr = root->node->start;
2838 list_add_tail(&node->list, &rc->backref_cache.changed);
2840 path->lowest_level = node->level;
2841 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
2842 btrfs_release_path(path);
2847 update_processed_blocks(rc, node);
2849 ret = do_relocation(trans, rc, node, key, path, 1);
2852 if (ret || node->level == 0 || node->cowonly) {
2854 release_metadata_space(rc, node);
2855 remove_backref_node(&rc->backref_cache, node);
2861 * relocate a list of blocks
2863 static noinline_for_stack
2864 int relocate_tree_blocks(struct btrfs_trans_handle *trans,
2865 struct reloc_control *rc, struct rb_root *blocks)
2867 struct backref_node *node;
2868 struct btrfs_path *path;
2869 struct tree_block *block;
2870 struct rb_node *rb_node;
2874 path = btrfs_alloc_path();
2877 goto out_free_blocks;
2880 rb_node = rb_first(blocks);
2882 block = rb_entry(rb_node, struct tree_block, rb_node);
2883 if (!block->key_ready)
2884 reada_tree_block(rc, block);
2885 rb_node = rb_next(rb_node);
2888 rb_node = rb_first(blocks);
2890 block = rb_entry(rb_node, struct tree_block, rb_node);
2891 if (!block->key_ready) {
2892 err = get_tree_block_key(rc, block);
2896 rb_node = rb_next(rb_node);
2899 rb_node = rb_first(blocks);
2901 block = rb_entry(rb_node, struct tree_block, rb_node);
2903 node = build_backref_tree(rc, &block->key,
2904 block->level, block->bytenr);
2906 err = PTR_ERR(node);
2910 ret = relocate_tree_block(trans, rc, node, &block->key,
2913 if (ret != -EAGAIN || rb_node == rb_first(blocks))
2917 rb_node = rb_next(rb_node);
2920 err = finish_pending_nodes(trans, rc, path, err);
2923 btrfs_free_path(path);
2925 free_block_list(blocks);
2929 static noinline_for_stack
2930 int prealloc_file_extent_cluster(struct inode *inode,
2931 struct file_extent_cluster *cluster)
2936 u64 offset = BTRFS_I(inode)->index_cnt;
2941 BUG_ON(cluster->start != cluster->boundary[0]);
2942 mutex_lock(&inode->i_mutex);
2944 ret = btrfs_check_data_free_space(inode, cluster->end +
2945 1 - cluster->start);
2949 while (nr < cluster->nr) {
2950 start = cluster->boundary[nr] - offset;
2951 if (nr + 1 < cluster->nr)
2952 end = cluster->boundary[nr + 1] - 1 - offset;
2954 end = cluster->end - offset;
2956 lock_extent(&BTRFS_I(inode)->io_tree, start, end);
2957 num_bytes = end + 1 - start;
2958 ret = btrfs_prealloc_file_range(inode, 0, start,
2959 num_bytes, num_bytes,
2960 end + 1, &alloc_hint);
2961 unlock_extent(&BTRFS_I(inode)->io_tree, start, end);
2966 btrfs_free_reserved_data_space(inode, cluster->end +
2967 1 - cluster->start);
2969 mutex_unlock(&inode->i_mutex);
2973 static noinline_for_stack
2974 int setup_extent_mapping(struct inode *inode, u64 start, u64 end,
2977 struct btrfs_root *root = BTRFS_I(inode)->root;
2978 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
2979 struct extent_map *em;
2982 em = alloc_extent_map();
2987 em->len = end + 1 - start;
2988 em->block_len = em->len;
2989 em->block_start = block_start;
2990 em->bdev = root->fs_info->fs_devices->latest_bdev;
2991 set_bit(EXTENT_FLAG_PINNED, &em->flags);
2993 lock_extent(&BTRFS_I(inode)->io_tree, start, end);
2995 write_lock(&em_tree->lock);
2996 ret = add_extent_mapping(em_tree, em, 0);
2997 write_unlock(&em_tree->lock);
2998 if (ret != -EEXIST) {
2999 free_extent_map(em);
3002 btrfs_drop_extent_cache(inode, start, end, 0);
3004 unlock_extent(&BTRFS_I(inode)->io_tree, start, end);
3008 static int relocate_file_extent_cluster(struct inode *inode,
3009 struct file_extent_cluster *cluster)
3013 u64 offset = BTRFS_I(inode)->index_cnt;
3014 unsigned long index;
3015 unsigned long last_index;
3017 struct file_ra_state *ra;
3018 gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping);
3025 ra = kzalloc(sizeof(*ra), GFP_NOFS);
3029 ret = prealloc_file_extent_cluster(inode, cluster);
3033 file_ra_state_init(ra, inode->i_mapping);
3035 ret = setup_extent_mapping(inode, cluster->start - offset,
3036 cluster->end - offset, cluster->start);
3040 index = (cluster->start - offset) >> PAGE_CACHE_SHIFT;
3041 last_index = (cluster->end - offset) >> PAGE_CACHE_SHIFT;
3042 while (index <= last_index) {
3043 ret = btrfs_delalloc_reserve_metadata(inode, PAGE_CACHE_SIZE);
3047 page = find_lock_page(inode->i_mapping, index);
3049 page_cache_sync_readahead(inode->i_mapping,
3051 last_index + 1 - index);
3052 page = find_or_create_page(inode->i_mapping, index,
3055 btrfs_delalloc_release_metadata(inode,
3062 if (PageReadahead(page)) {
3063 page_cache_async_readahead(inode->i_mapping,
3064 ra, NULL, page, index,
3065 last_index + 1 - index);
3068 if (!PageUptodate(page)) {
3069 btrfs_readpage(NULL, page);
3071 if (!PageUptodate(page)) {
3073 page_cache_release(page);
3074 btrfs_delalloc_release_metadata(inode,
3081 page_start = page_offset(page);
3082 page_end = page_start + PAGE_CACHE_SIZE - 1;
3084 lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end);
3086 set_page_extent_mapped(page);
3088 if (nr < cluster->nr &&
3089 page_start + offset == cluster->boundary[nr]) {
3090 set_extent_bits(&BTRFS_I(inode)->io_tree,
3091 page_start, page_end,
3092 EXTENT_BOUNDARY, GFP_NOFS);
3096 btrfs_set_extent_delalloc(inode, page_start, page_end, NULL);
3097 set_page_dirty(page);
3099 unlock_extent(&BTRFS_I(inode)->io_tree,
3100 page_start, page_end);
3102 page_cache_release(page);
3105 balance_dirty_pages_ratelimited(inode->i_mapping);
3106 btrfs_throttle(BTRFS_I(inode)->root);
3108 WARN_ON(nr != cluster->nr);
3114 static noinline_for_stack
3115 int relocate_data_extent(struct inode *inode, struct btrfs_key *extent_key,
3116 struct file_extent_cluster *cluster)
3120 if (cluster->nr > 0 && extent_key->objectid != cluster->end + 1) {
3121 ret = relocate_file_extent_cluster(inode, cluster);
3128 cluster->start = extent_key->objectid;
3130 BUG_ON(cluster->nr >= MAX_EXTENTS);
3131 cluster->end = extent_key->objectid + extent_key->offset - 1;
3132 cluster->boundary[cluster->nr] = extent_key->objectid;
3135 if (cluster->nr >= MAX_EXTENTS) {
3136 ret = relocate_file_extent_cluster(inode, cluster);
3144 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3145 static int get_ref_objectid_v0(struct reloc_control *rc,
3146 struct btrfs_path *path,
3147 struct btrfs_key *extent_key,
3148 u64 *ref_objectid, int *path_change)
3150 struct btrfs_key key;
3151 struct extent_buffer *leaf;
3152 struct btrfs_extent_ref_v0 *ref0;
3156 leaf = path->nodes[0];
3157 slot = path->slots[0];
3159 if (slot >= btrfs_header_nritems(leaf)) {
3160 ret = btrfs_next_leaf(rc->extent_root, path);
3164 leaf = path->nodes[0];
3165 slot = path->slots[0];
3169 btrfs_item_key_to_cpu(leaf, &key, slot);
3170 if (key.objectid != extent_key->objectid)
3173 if (key.type != BTRFS_EXTENT_REF_V0_KEY) {
3177 ref0 = btrfs_item_ptr(leaf, slot,
3178 struct btrfs_extent_ref_v0);
3179 *ref_objectid = btrfs_ref_objectid_v0(leaf, ref0);
3187 * helper to add a tree block to the list.
3188 * the major work is getting the generation and level of the block
3190 static int add_tree_block(struct reloc_control *rc,
3191 struct btrfs_key *extent_key,
3192 struct btrfs_path *path,
3193 struct rb_root *blocks)
3195 struct extent_buffer *eb;
3196 struct btrfs_extent_item *ei;
3197 struct btrfs_tree_block_info *bi;
3198 struct tree_block *block;
3199 struct rb_node *rb_node;
3204 eb = path->nodes[0];
3205 item_size = btrfs_item_size_nr(eb, path->slots[0]);
3207 if (extent_key->type == BTRFS_METADATA_ITEM_KEY ||
3208 item_size >= sizeof(*ei) + sizeof(*bi)) {
3209 ei = btrfs_item_ptr(eb, path->slots[0],
3210 struct btrfs_extent_item);
3211 if (extent_key->type == BTRFS_EXTENT_ITEM_KEY) {
3212 bi = (struct btrfs_tree_block_info *)(ei + 1);
3213 level = btrfs_tree_block_level(eb, bi);
3215 level = (int)extent_key->offset;
3217 generation = btrfs_extent_generation(eb, ei);
3219 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3223 BUG_ON(item_size != sizeof(struct btrfs_extent_item_v0));
3224 ret = get_ref_objectid_v0(rc, path, extent_key,
3228 BUG_ON(ref_owner >= BTRFS_MAX_LEVEL);
3229 level = (int)ref_owner;
3230 /* FIXME: get real generation */
3237 btrfs_release_path(path);
3239 BUG_ON(level == -1);
3241 block = kmalloc(sizeof(*block), GFP_NOFS);
3245 block->bytenr = extent_key->objectid;
3246 block->key.objectid = rc->extent_root->leafsize;
3247 block->key.offset = generation;
3248 block->level = level;
3249 block->key_ready = 0;
3251 rb_node = tree_insert(blocks, block->bytenr, &block->rb_node);
3253 backref_tree_panic(rb_node, -EEXIST, block->bytenr);
3259 * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY
3261 static int __add_tree_block(struct reloc_control *rc,
3262 u64 bytenr, u32 blocksize,
3263 struct rb_root *blocks)
3265 struct btrfs_path *path;
3266 struct btrfs_key key;
3269 if (tree_block_processed(bytenr, blocksize, rc))
3272 if (tree_search(blocks, bytenr))
3275 path = btrfs_alloc_path();
3279 key.objectid = bytenr;
3280 key.type = BTRFS_EXTENT_ITEM_KEY;
3281 key.offset = blocksize;
3283 path->search_commit_root = 1;
3284 path->skip_locking = 1;
3285 ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0);
3289 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
3291 if (key.objectid == bytenr &&
3292 key.type == BTRFS_METADATA_ITEM_KEY)
3297 ret = add_tree_block(rc, &key, path, blocks);
3299 btrfs_free_path(path);
3304 * helper to check if the block use full backrefs for pointers in it
3306 static int block_use_full_backref(struct reloc_control *rc,
3307 struct extent_buffer *eb)
3312 if (btrfs_header_flag(eb, BTRFS_HEADER_FLAG_RELOC) ||
3313 btrfs_header_backref_rev(eb) < BTRFS_MIXED_BACKREF_REV)
3316 ret = btrfs_lookup_extent_info(NULL, rc->extent_root,
3317 eb->start, btrfs_header_level(eb), 1,
3321 if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)
3328 static int delete_block_group_cache(struct btrfs_fs_info *fs_info,
3329 struct inode *inode, u64 ino)
3331 struct btrfs_key key;
3332 struct btrfs_path *path;
3333 struct btrfs_root *root = fs_info->tree_root;
3334 struct btrfs_trans_handle *trans;
3341 key.type = BTRFS_INODE_ITEM_KEY;
3344 inode = btrfs_iget(fs_info->sb, &key, root, NULL);
3345 if (IS_ERR(inode) || is_bad_inode(inode)) {
3352 ret = btrfs_check_trunc_cache_free_space(root,
3353 &fs_info->global_block_rsv);
3357 path = btrfs_alloc_path();
3363 trans = btrfs_join_transaction(root);
3364 if (IS_ERR(trans)) {
3365 btrfs_free_path(path);
3366 ret = PTR_ERR(trans);
3370 ret = btrfs_truncate_free_space_cache(root, trans, path, inode);
3372 btrfs_free_path(path);
3373 btrfs_end_transaction(trans, root);
3374 btrfs_btree_balance_dirty(root);
3381 * helper to add tree blocks for backref of type BTRFS_EXTENT_DATA_REF_KEY
3382 * this function scans fs tree to find blocks reference the data extent
3384 static int find_data_references(struct reloc_control *rc,
3385 struct btrfs_key *extent_key,
3386 struct extent_buffer *leaf,
3387 struct btrfs_extent_data_ref *ref,
3388 struct rb_root *blocks)
3390 struct btrfs_path *path;
3391 struct tree_block *block;
3392 struct btrfs_root *root;
3393 struct btrfs_file_extent_item *fi;
3394 struct rb_node *rb_node;
3395 struct btrfs_key key;
3406 ref_root = btrfs_extent_data_ref_root(leaf, ref);
3407 ref_objectid = btrfs_extent_data_ref_objectid(leaf, ref);
3408 ref_offset = btrfs_extent_data_ref_offset(leaf, ref);
3409 ref_count = btrfs_extent_data_ref_count(leaf, ref);
3412 * This is an extent belonging to the free space cache, lets just delete
3413 * it and redo the search.
3415 if (ref_root == BTRFS_ROOT_TREE_OBJECTID) {
3416 ret = delete_block_group_cache(rc->extent_root->fs_info,
3417 NULL, ref_objectid);
3423 path = btrfs_alloc_path();
3428 root = read_fs_root(rc->extent_root->fs_info, ref_root);
3430 err = PTR_ERR(root);
3434 key.objectid = ref_objectid;
3435 key.type = BTRFS_EXTENT_DATA_KEY;
3436 if (ref_offset > ((u64)-1 << 32))
3439 key.offset = ref_offset;
3441 path->search_commit_root = 1;
3442 path->skip_locking = 1;
3443 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
3449 leaf = path->nodes[0];
3450 nritems = btrfs_header_nritems(leaf);
3452 * the references in tree blocks that use full backrefs
3453 * are not counted in
3455 if (block_use_full_backref(rc, leaf))
3459 rb_node = tree_search(blocks, leaf->start);
3464 path->slots[0] = nritems;
3467 while (ref_count > 0) {
3468 while (path->slots[0] >= nritems) {
3469 ret = btrfs_next_leaf(root, path);
3479 leaf = path->nodes[0];
3480 nritems = btrfs_header_nritems(leaf);
3483 if (block_use_full_backref(rc, leaf))
3487 rb_node = tree_search(blocks, leaf->start);
3492 path->slots[0] = nritems;
3496 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3497 if (key.objectid != ref_objectid ||
3498 key.type != BTRFS_EXTENT_DATA_KEY) {
3503 fi = btrfs_item_ptr(leaf, path->slots[0],
3504 struct btrfs_file_extent_item);
3506 if (btrfs_file_extent_type(leaf, fi) ==
3507 BTRFS_FILE_EXTENT_INLINE)
3510 if (btrfs_file_extent_disk_bytenr(leaf, fi) !=
3511 extent_key->objectid)
3514 key.offset -= btrfs_file_extent_offset(leaf, fi);
3515 if (key.offset != ref_offset)
3523 if (!tree_block_processed(leaf->start, leaf->len, rc)) {
3524 block = kmalloc(sizeof(*block), GFP_NOFS);
3529 block->bytenr = leaf->start;
3530 btrfs_item_key_to_cpu(leaf, &block->key, 0);
3532 block->key_ready = 1;
3533 rb_node = tree_insert(blocks, block->bytenr,
3536 backref_tree_panic(rb_node, -EEXIST,
3542 path->slots[0] = nritems;
3548 btrfs_free_path(path);
3553 * helper to find all tree blocks that reference a given data extent
3555 static noinline_for_stack
3556 int add_data_references(struct reloc_control *rc,
3557 struct btrfs_key *extent_key,
3558 struct btrfs_path *path,
3559 struct rb_root *blocks)
3561 struct btrfs_key key;
3562 struct extent_buffer *eb;
3563 struct btrfs_extent_data_ref *dref;
3564 struct btrfs_extent_inline_ref *iref;
3567 u32 blocksize = btrfs_level_size(rc->extent_root, 0);
3571 eb = path->nodes[0];
3572 ptr = btrfs_item_ptr_offset(eb, path->slots[0]);
3573 end = ptr + btrfs_item_size_nr(eb, path->slots[0]);
3574 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3575 if (ptr + sizeof(struct btrfs_extent_item_v0) == end)
3579 ptr += sizeof(struct btrfs_extent_item);
3582 iref = (struct btrfs_extent_inline_ref *)ptr;
3583 key.type = btrfs_extent_inline_ref_type(eb, iref);
3584 if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
3585 key.offset = btrfs_extent_inline_ref_offset(eb, iref);
3586 ret = __add_tree_block(rc, key.offset, blocksize,
3588 } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
3589 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
3590 ret = find_data_references(rc, extent_key,
3595 ptr += btrfs_extent_inline_ref_size(key.type);
3601 eb = path->nodes[0];
3602 if (path->slots[0] >= btrfs_header_nritems(eb)) {
3603 ret = btrfs_next_leaf(rc->extent_root, path);
3610 eb = path->nodes[0];
3613 btrfs_item_key_to_cpu(eb, &key, path->slots[0]);
3614 if (key.objectid != extent_key->objectid)
3617 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3618 if (key.type == BTRFS_SHARED_DATA_REF_KEY ||
3619 key.type == BTRFS_EXTENT_REF_V0_KEY) {
3621 BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY);
3622 if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
3624 ret = __add_tree_block(rc, key.offset, blocksize,
3626 } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
3627 dref = btrfs_item_ptr(eb, path->slots[0],
3628 struct btrfs_extent_data_ref);
3629 ret = find_data_references(rc, extent_key,
3640 btrfs_release_path(path);
3642 free_block_list(blocks);
3647 * helper to find next unprocessed extent
3649 static noinline_for_stack
3650 int find_next_extent(struct btrfs_trans_handle *trans,
3651 struct reloc_control *rc, struct btrfs_path *path,
3652 struct btrfs_key *extent_key)
3654 struct btrfs_key key;
3655 struct extent_buffer *leaf;
3656 u64 start, end, last;
3659 last = rc->block_group->key.objectid + rc->block_group->key.offset;
3662 if (rc->search_start >= last) {
3667 key.objectid = rc->search_start;
3668 key.type = BTRFS_EXTENT_ITEM_KEY;
3671 path->search_commit_root = 1;
3672 path->skip_locking = 1;
3673 ret = btrfs_search_slot(NULL, rc->extent_root, &key, path,
3678 leaf = path->nodes[0];
3679 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
3680 ret = btrfs_next_leaf(rc->extent_root, path);
3683 leaf = path->nodes[0];
3686 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3687 if (key.objectid >= last) {
3692 if (key.type != BTRFS_EXTENT_ITEM_KEY &&
3693 key.type != BTRFS_METADATA_ITEM_KEY) {
3698 if (key.type == BTRFS_EXTENT_ITEM_KEY &&
3699 key.objectid + key.offset <= rc->search_start) {
3704 if (key.type == BTRFS_METADATA_ITEM_KEY &&
3705 key.objectid + rc->extent_root->leafsize <=
3711 ret = find_first_extent_bit(&rc->processed_blocks,
3712 key.objectid, &start, &end,
3713 EXTENT_DIRTY, NULL);
3715 if (ret == 0 && start <= key.objectid) {
3716 btrfs_release_path(path);
3717 rc->search_start = end + 1;
3719 if (key.type == BTRFS_EXTENT_ITEM_KEY)
3720 rc->search_start = key.objectid + key.offset;
3722 rc->search_start = key.objectid +
3723 rc->extent_root->leafsize;
3724 memcpy(extent_key, &key, sizeof(key));
3728 btrfs_release_path(path);
3732 static void set_reloc_control(struct reloc_control *rc)
3734 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
3736 mutex_lock(&fs_info->reloc_mutex);
3737 fs_info->reloc_ctl = rc;
3738 mutex_unlock(&fs_info->reloc_mutex);
3741 static void unset_reloc_control(struct reloc_control *rc)
3743 struct btrfs_fs_info *fs_info = rc->extent_root->fs_info;
3745 mutex_lock(&fs_info->reloc_mutex);
3746 fs_info->reloc_ctl = NULL;
3747 mutex_unlock(&fs_info->reloc_mutex);
3750 static int check_extent_flags(u64 flags)
3752 if ((flags & BTRFS_EXTENT_FLAG_DATA) &&
3753 (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK))
3755 if (!(flags & BTRFS_EXTENT_FLAG_DATA) &&
3756 !(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK))
3758 if ((flags & BTRFS_EXTENT_FLAG_DATA) &&
3759 (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF))
3764 static noinline_for_stack
3765 int prepare_to_relocate(struct reloc_control *rc)
3767 struct btrfs_trans_handle *trans;
3770 rc->block_rsv = btrfs_alloc_block_rsv(rc->extent_root,
3771 BTRFS_BLOCK_RSV_TEMP);
3776 * reserve some space for creating reloc trees.
3777 * btrfs_init_reloc_root will use them when there
3778 * is no reservation in transaction handle.
3780 ret = btrfs_block_rsv_add(rc->extent_root, rc->block_rsv,
3781 rc->extent_root->nodesize * 256,
3782 BTRFS_RESERVE_FLUSH_ALL);
3786 memset(&rc->cluster, 0, sizeof(rc->cluster));
3787 rc->search_start = rc->block_group->key.objectid;
3788 rc->extents_found = 0;
3789 rc->nodes_relocated = 0;
3790 rc->merging_rsv_size = 0;
3792 rc->create_reloc_tree = 1;
3793 set_reloc_control(rc);
3795 trans = btrfs_join_transaction(rc->extent_root);
3796 if (IS_ERR(trans)) {
3797 unset_reloc_control(rc);
3799 * extent tree is not a ref_cow tree and has no reloc_root to
3800 * cleanup. And callers are responsible to free the above
3803 return PTR_ERR(trans);
3805 btrfs_commit_transaction(trans, rc->extent_root);
3809 static noinline_for_stack int relocate_block_group(struct reloc_control *rc)
3811 struct rb_root blocks = RB_ROOT;
3812 struct btrfs_key key;
3813 struct btrfs_trans_handle *trans = NULL;
3814 struct btrfs_path *path;
3815 struct btrfs_extent_item *ei;
3822 path = btrfs_alloc_path();
3827 ret = prepare_to_relocate(rc);
3835 trans = btrfs_start_transaction(rc->extent_root, 0);
3836 if (IS_ERR(trans)) {
3837 err = PTR_ERR(trans);
3842 if (update_backref_cache(trans, &rc->backref_cache)) {
3843 btrfs_end_transaction(trans, rc->extent_root);
3847 ret = find_next_extent(trans, rc, path, &key);
3853 rc->extents_found++;
3855 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
3856 struct btrfs_extent_item);
3857 item_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]);
3858 if (item_size >= sizeof(*ei)) {
3859 flags = btrfs_extent_flags(path->nodes[0], ei);
3860 ret = check_extent_flags(flags);
3864 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3866 int path_change = 0;
3869 sizeof(struct btrfs_extent_item_v0));
3870 ret = get_ref_objectid_v0(rc, path, &key, &ref_owner,
3872 if (ref_owner < BTRFS_FIRST_FREE_OBJECTID)
3873 flags = BTRFS_EXTENT_FLAG_TREE_BLOCK;
3875 flags = BTRFS_EXTENT_FLAG_DATA;
3878 btrfs_release_path(path);
3880 path->search_commit_root = 1;
3881 path->skip_locking = 1;
3882 ret = btrfs_search_slot(NULL, rc->extent_root,
3895 if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
3896 ret = add_tree_block(rc, &key, path, &blocks);
3897 } else if (rc->stage == UPDATE_DATA_PTRS &&
3898 (flags & BTRFS_EXTENT_FLAG_DATA)) {
3899 ret = add_data_references(rc, &key, path, &blocks);
3901 btrfs_release_path(path);
3909 if (!RB_EMPTY_ROOT(&blocks)) {
3910 ret = relocate_tree_blocks(trans, rc, &blocks);
3912 if (ret != -EAGAIN) {
3916 rc->extents_found--;
3917 rc->search_start = key.objectid;
3921 ret = btrfs_block_rsv_check(rc->extent_root, rc->block_rsv, 5);
3923 if (ret != -ENOSPC) {
3928 rc->commit_transaction = 1;
3931 if (rc->commit_transaction) {
3932 rc->commit_transaction = 0;
3933 ret = btrfs_commit_transaction(trans, rc->extent_root);
3936 btrfs_end_transaction_throttle(trans, rc->extent_root);
3937 btrfs_btree_balance_dirty(rc->extent_root);
3941 if (rc->stage == MOVE_DATA_EXTENTS &&
3942 (flags & BTRFS_EXTENT_FLAG_DATA)) {
3943 rc->found_file_extent = 1;
3944 ret = relocate_data_extent(rc->data_inode,
3945 &key, &rc->cluster);
3952 if (trans && progress && err == -ENOSPC) {
3953 ret = btrfs_force_chunk_alloc(trans, rc->extent_root,
3954 rc->block_group->flags);
3962 btrfs_release_path(path);
3963 clear_extent_bits(&rc->processed_blocks, 0, (u64)-1, EXTENT_DIRTY,
3967 btrfs_end_transaction_throttle(trans, rc->extent_root);
3968 btrfs_btree_balance_dirty(rc->extent_root);
3972 ret = relocate_file_extent_cluster(rc->data_inode,
3978 rc->create_reloc_tree = 0;
3979 set_reloc_control(rc);
3981 backref_cache_cleanup(&rc->backref_cache);
3982 btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1);
3984 err = prepare_to_merge(rc, err);
3986 merge_reloc_roots(rc);
3988 rc->merge_reloc_tree = 0;
3989 unset_reloc_control(rc);
3990 btrfs_block_rsv_release(rc->extent_root, rc->block_rsv, (u64)-1);
3992 /* get rid of pinned extents */
3993 trans = btrfs_join_transaction(rc->extent_root);
3995 err = PTR_ERR(trans);
3997 btrfs_commit_transaction(trans, rc->extent_root);
3999 btrfs_free_block_rsv(rc->extent_root, rc->block_rsv);
4000 btrfs_free_path(path);
4004 static int __insert_orphan_inode(struct btrfs_trans_handle *trans,
4005 struct btrfs_root *root, u64 objectid)
4007 struct btrfs_path *path;
4008 struct btrfs_inode_item *item;
4009 struct extent_buffer *leaf;
4012 path = btrfs_alloc_path();
4016 ret = btrfs_insert_empty_inode(trans, root, path, objectid);
4020 leaf = path->nodes[0];
4021 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_inode_item);
4022 memset_extent_buffer(leaf, 0, (unsigned long)item, sizeof(*item));
4023 btrfs_set_inode_generation(leaf, item, 1);
4024 btrfs_set_inode_size(leaf, item, 0);
4025 btrfs_set_inode_mode(leaf, item, S_IFREG | 0600);
4026 btrfs_set_inode_flags(leaf, item, BTRFS_INODE_NOCOMPRESS |
4027 BTRFS_INODE_PREALLOC);
4028 btrfs_mark_buffer_dirty(leaf);
4029 btrfs_release_path(path);
4031 btrfs_free_path(path);
4036 * helper to create inode for data relocation.
4037 * the inode is in data relocation tree and its link count is 0
4039 static noinline_for_stack
4040 struct inode *create_reloc_inode(struct btrfs_fs_info *fs_info,
4041 struct btrfs_block_group_cache *group)
4043 struct inode *inode = NULL;
4044 struct btrfs_trans_handle *trans;
4045 struct btrfs_root *root;
4046 struct btrfs_key key;
4047 u64 objectid = BTRFS_FIRST_FREE_OBJECTID;
4050 root = read_fs_root(fs_info, BTRFS_DATA_RELOC_TREE_OBJECTID);
4052 return ERR_CAST(root);
4054 trans = btrfs_start_transaction(root, 6);
4056 return ERR_CAST(trans);
4058 err = btrfs_find_free_objectid(root, &objectid);
4062 err = __insert_orphan_inode(trans, root, objectid);
4065 key.objectid = objectid;
4066 key.type = BTRFS_INODE_ITEM_KEY;
4068 inode = btrfs_iget(root->fs_info->sb, &key, root, NULL);
4069 BUG_ON(IS_ERR(inode) || is_bad_inode(inode));
4070 BTRFS_I(inode)->index_cnt = group->key.objectid;
4072 err = btrfs_orphan_add(trans, inode);
4074 btrfs_end_transaction(trans, root);
4075 btrfs_btree_balance_dirty(root);
4079 inode = ERR_PTR(err);
4084 static struct reloc_control *alloc_reloc_control(struct btrfs_fs_info *fs_info)
4086 struct reloc_control *rc;
4088 rc = kzalloc(sizeof(*rc), GFP_NOFS);
4092 INIT_LIST_HEAD(&rc->reloc_roots);
4093 backref_cache_init(&rc->backref_cache);
4094 mapping_tree_init(&rc->reloc_root_tree);
4095 extent_io_tree_init(&rc->processed_blocks,
4096 fs_info->btree_inode->i_mapping);
4101 * function to relocate all extents in a block group.
4103 int btrfs_relocate_block_group(struct btrfs_root *extent_root, u64 group_start)
4105 struct btrfs_fs_info *fs_info = extent_root->fs_info;
4106 struct reloc_control *rc;
4107 struct inode *inode;
4108 struct btrfs_path *path;
4113 rc = alloc_reloc_control(fs_info);
4117 rc->extent_root = extent_root;
4119 rc->block_group = btrfs_lookup_block_group(fs_info, group_start);
4120 BUG_ON(!rc->block_group);
4122 if (!rc->block_group->ro) {
4123 ret = btrfs_set_block_group_ro(extent_root, rc->block_group);
4131 path = btrfs_alloc_path();
4137 inode = lookup_free_space_inode(fs_info->tree_root, rc->block_group,
4139 btrfs_free_path(path);
4142 ret = delete_block_group_cache(fs_info, inode, 0);
4144 ret = PTR_ERR(inode);
4146 if (ret && ret != -ENOENT) {
4151 rc->data_inode = create_reloc_inode(fs_info, rc->block_group);
4152 if (IS_ERR(rc->data_inode)) {
4153 err = PTR_ERR(rc->data_inode);
4154 rc->data_inode = NULL;
4158 printk(KERN_INFO "btrfs: relocating block group %llu flags %llu\n",
4159 (unsigned long long)rc->block_group->key.objectid,
4160 (unsigned long long)rc->block_group->flags);
4162 ret = btrfs_start_all_delalloc_inodes(fs_info, 0);
4167 btrfs_wait_ordered_extents(fs_info->tree_root, 0);
4170 mutex_lock(&fs_info->cleaner_mutex);
4171 ret = relocate_block_group(rc);
4172 mutex_unlock(&fs_info->cleaner_mutex);
4178 if (rc->extents_found == 0)
4181 printk(KERN_INFO "btrfs: found %llu extents\n",
4182 (unsigned long long)rc->extents_found);
4184 if (rc->stage == MOVE_DATA_EXTENTS && rc->found_file_extent) {
4185 btrfs_wait_ordered_range(rc->data_inode, 0, (u64)-1);
4186 invalidate_mapping_pages(rc->data_inode->i_mapping,
4188 rc->stage = UPDATE_DATA_PTRS;
4192 filemap_write_and_wait_range(fs_info->btree_inode->i_mapping,
4193 rc->block_group->key.objectid,
4194 rc->block_group->key.objectid +
4195 rc->block_group->key.offset - 1);
4197 WARN_ON(rc->block_group->pinned > 0);
4198 WARN_ON(rc->block_group->reserved > 0);
4199 WARN_ON(btrfs_block_group_used(&rc->block_group->item) > 0);
4202 btrfs_set_block_group_rw(extent_root, rc->block_group);
4203 iput(rc->data_inode);
4204 btrfs_put_block_group(rc->block_group);
4209 static noinline_for_stack int mark_garbage_root(struct btrfs_root *root)
4211 struct btrfs_trans_handle *trans;
4214 trans = btrfs_start_transaction(root->fs_info->tree_root, 0);
4216 return PTR_ERR(trans);
4218 memset(&root->root_item.drop_progress, 0,
4219 sizeof(root->root_item.drop_progress));
4220 root->root_item.drop_level = 0;
4221 btrfs_set_root_refs(&root->root_item, 0);
4222 ret = btrfs_update_root(trans, root->fs_info->tree_root,
4223 &root->root_key, &root->root_item);
4225 err = btrfs_end_transaction(trans, root->fs_info->tree_root);
4232 * recover relocation interrupted by system crash.
4234 * this function resumes merging reloc trees with corresponding fs trees.
4235 * this is important for keeping the sharing of tree blocks
4237 int btrfs_recover_relocation(struct btrfs_root *root)
4239 LIST_HEAD(reloc_roots);
4240 struct btrfs_key key;
4241 struct btrfs_root *fs_root;
4242 struct btrfs_root *reloc_root;
4243 struct btrfs_path *path;
4244 struct extent_buffer *leaf;
4245 struct reloc_control *rc = NULL;
4246 struct btrfs_trans_handle *trans;
4250 path = btrfs_alloc_path();
4255 key.objectid = BTRFS_TREE_RELOC_OBJECTID;
4256 key.type = BTRFS_ROOT_ITEM_KEY;
4257 key.offset = (u64)-1;
4260 ret = btrfs_search_slot(NULL, root->fs_info->tree_root, &key,
4267 if (path->slots[0] == 0)
4271 leaf = path->nodes[0];
4272 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
4273 btrfs_release_path(path);
4275 if (key.objectid != BTRFS_TREE_RELOC_OBJECTID ||
4276 key.type != BTRFS_ROOT_ITEM_KEY)
4279 reloc_root = btrfs_read_fs_root(root, &key);
4280 if (IS_ERR(reloc_root)) {
4281 err = PTR_ERR(reloc_root);
4285 list_add(&reloc_root->root_list, &reloc_roots);
4287 if (btrfs_root_refs(&reloc_root->root_item) > 0) {
4288 fs_root = read_fs_root(root->fs_info,
4289 reloc_root->root_key.offset);
4290 if (IS_ERR(fs_root)) {
4291 ret = PTR_ERR(fs_root);
4292 if (ret != -ENOENT) {
4296 ret = mark_garbage_root(reloc_root);
4304 if (key.offset == 0)
4309 btrfs_release_path(path);
4311 if (list_empty(&reloc_roots))
4314 rc = alloc_reloc_control(root->fs_info);
4320 rc->extent_root = root->fs_info->extent_root;
4322 set_reloc_control(rc);
4324 trans = btrfs_join_transaction(rc->extent_root);
4325 if (IS_ERR(trans)) {
4326 unset_reloc_control(rc);
4327 err = PTR_ERR(trans);
4331 rc->merge_reloc_tree = 1;
4333 while (!list_empty(&reloc_roots)) {
4334 reloc_root = list_entry(reloc_roots.next,
4335 struct btrfs_root, root_list);
4336 list_del(&reloc_root->root_list);
4338 if (btrfs_root_refs(&reloc_root->root_item) == 0) {
4339 list_add_tail(&reloc_root->root_list,
4344 fs_root = read_fs_root(root->fs_info,
4345 reloc_root->root_key.offset);
4346 if (IS_ERR(fs_root)) {
4347 err = PTR_ERR(fs_root);
4351 err = __add_reloc_root(reloc_root);
4352 BUG_ON(err < 0); /* -ENOMEM or logic error */
4353 fs_root->reloc_root = reloc_root;
4356 err = btrfs_commit_transaction(trans, rc->extent_root);
4360 merge_reloc_roots(rc);
4362 unset_reloc_control(rc);
4364 trans = btrfs_join_transaction(rc->extent_root);
4366 err = PTR_ERR(trans);
4368 err = btrfs_commit_transaction(trans, rc->extent_root);
4372 if (!list_empty(&reloc_roots))
4373 free_reloc_roots(&reloc_roots);
4375 btrfs_free_path(path);
4378 /* cleanup orphan inode in data relocation tree */
4379 fs_root = read_fs_root(root->fs_info,
4380 BTRFS_DATA_RELOC_TREE_OBJECTID);
4381 if (IS_ERR(fs_root))
4382 err = PTR_ERR(fs_root);
4384 err = btrfs_orphan_cleanup(fs_root);
4390 * helper to add ordered checksum for data relocation.
4392 * cloning checksum properly handles the nodatasum extents.
4393 * it also saves CPU time to re-calculate the checksum.
4395 int btrfs_reloc_clone_csums(struct inode *inode, u64 file_pos, u64 len)
4397 struct btrfs_ordered_sum *sums;
4398 struct btrfs_sector_sum *sector_sum;
4399 struct btrfs_ordered_extent *ordered;
4400 struct btrfs_root *root = BTRFS_I(inode)->root;
4406 ordered = btrfs_lookup_ordered_extent(inode, file_pos);
4407 BUG_ON(ordered->file_offset != file_pos || ordered->len != len);
4409 disk_bytenr = file_pos + BTRFS_I(inode)->index_cnt;
4410 ret = btrfs_lookup_csums_range(root->fs_info->csum_root, disk_bytenr,
4411 disk_bytenr + len - 1, &list, 0);
4415 while (!list_empty(&list)) {
4416 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
4417 list_del_init(&sums->list);
4419 sector_sum = sums->sums;
4420 sums->bytenr = ordered->start;
4423 while (offset < sums->len) {
4424 sector_sum->bytenr += ordered->start - disk_bytenr;
4426 offset += root->sectorsize;
4429 btrfs_add_ordered_sum(inode, ordered, sums);
4432 btrfs_put_ordered_extent(ordered);
4436 void btrfs_reloc_cow_block(struct btrfs_trans_handle *trans,
4437 struct btrfs_root *root, struct extent_buffer *buf,
4438 struct extent_buffer *cow)
4440 struct reloc_control *rc;
4441 struct backref_node *node;
4446 rc = root->fs_info->reloc_ctl;
4450 BUG_ON(rc->stage == UPDATE_DATA_PTRS &&
4451 root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID);
4453 level = btrfs_header_level(buf);
4454 if (btrfs_header_generation(buf) <=
4455 btrfs_root_last_snapshot(&root->root_item))
4458 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID &&
4459 rc->create_reloc_tree) {
4460 WARN_ON(!first_cow && level == 0);
4462 node = rc->backref_cache.path[level];
4463 BUG_ON(node->bytenr != buf->start &&
4464 node->new_bytenr != buf->start);
4466 drop_node_buffer(node);
4467 extent_buffer_get(cow);
4469 node->new_bytenr = cow->start;
4471 if (!node->pending) {
4472 list_move_tail(&node->list,
4473 &rc->backref_cache.pending[level]);
4478 __mark_block_processed(rc, node);
4480 if (first_cow && level > 0)
4481 rc->nodes_relocated += buf->len;
4484 if (level == 0 && first_cow && rc->stage == UPDATE_DATA_PTRS) {
4485 ret = replace_file_extents(trans, rc, root, cow);
4491 * called before creating snapshot. it calculates metadata reservation
4492 * requried for relocating tree blocks in the snapshot
4494 void btrfs_reloc_pre_snapshot(struct btrfs_trans_handle *trans,
4495 struct btrfs_pending_snapshot *pending,
4496 u64 *bytes_to_reserve)
4498 struct btrfs_root *root;
4499 struct reloc_control *rc;
4501 root = pending->root;
4502 if (!root->reloc_root)
4505 rc = root->fs_info->reloc_ctl;
4506 if (!rc->merge_reloc_tree)
4509 root = root->reloc_root;
4510 BUG_ON(btrfs_root_refs(&root->root_item) == 0);
4512 * relocation is in the stage of merging trees. the space
4513 * used by merging a reloc tree is twice the size of
4514 * relocated tree nodes in the worst case. half for cowing
4515 * the reloc tree, half for cowing the fs tree. the space
4516 * used by cowing the reloc tree will be freed after the
4517 * tree is dropped. if we create snapshot, cowing the fs
4518 * tree may use more space than it frees. so we need
4519 * reserve extra space.
4521 *bytes_to_reserve += rc->nodes_relocated;
4525 * called after snapshot is created. migrate block reservation
4526 * and create reloc root for the newly created snapshot
4528 int btrfs_reloc_post_snapshot(struct btrfs_trans_handle *trans,
4529 struct btrfs_pending_snapshot *pending)
4531 struct btrfs_root *root = pending->root;
4532 struct btrfs_root *reloc_root;
4533 struct btrfs_root *new_root;
4534 struct reloc_control *rc;
4537 if (!root->reloc_root)
4540 rc = root->fs_info->reloc_ctl;
4541 rc->merging_rsv_size += rc->nodes_relocated;
4543 if (rc->merge_reloc_tree) {
4544 ret = btrfs_block_rsv_migrate(&pending->block_rsv,
4546 rc->nodes_relocated);
4551 new_root = pending->snap;
4552 reloc_root = create_reloc_root(trans, root->reloc_root,
4553 new_root->root_key.objectid);
4554 if (IS_ERR(reloc_root))
4555 return PTR_ERR(reloc_root);
4557 ret = __add_reloc_root(reloc_root);
4559 new_root->reloc_root = reloc_root;
4561 if (rc->create_reloc_tree)
4562 ret = clone_backref_node(trans, rc, root, reloc_root);