2 * Copyright (C) 2007 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.
18 #include <linux/sched.h>
19 #include <linux/pagemap.h>
20 #include <linux/writeback.h>
21 #include <linux/blkdev.h>
22 #include <linux/sort.h>
23 #include <linux/rcupdate.h>
24 #include <linux/kthread.h>
25 #include <linux/slab.h>
30 #include "print-tree.h"
31 #include "transaction.h"
34 #include "free-space-cache.h"
36 static int update_block_group(struct btrfs_trans_handle *trans,
37 struct btrfs_root *root,
38 u64 bytenr, u64 num_bytes, int alloc);
39 static int update_reserved_bytes(struct btrfs_block_group_cache *cache,
40 u64 num_bytes, int reserve, int sinfo);
41 static int __btrfs_free_extent(struct btrfs_trans_handle *trans,
42 struct btrfs_root *root,
43 u64 bytenr, u64 num_bytes, u64 parent,
44 u64 root_objectid, u64 owner_objectid,
45 u64 owner_offset, int refs_to_drop,
46 struct btrfs_delayed_extent_op *extra_op);
47 static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op,
48 struct extent_buffer *leaf,
49 struct btrfs_extent_item *ei);
50 static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
51 struct btrfs_root *root,
52 u64 parent, u64 root_objectid,
53 u64 flags, u64 owner, u64 offset,
54 struct btrfs_key *ins, int ref_mod);
55 static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans,
56 struct btrfs_root *root,
57 u64 parent, u64 root_objectid,
58 u64 flags, struct btrfs_disk_key *key,
59 int level, struct btrfs_key *ins);
60 static int do_chunk_alloc(struct btrfs_trans_handle *trans,
61 struct btrfs_root *extent_root, u64 alloc_bytes,
62 u64 flags, int force);
63 static int find_next_key(struct btrfs_path *path, int level,
64 struct btrfs_key *key);
65 static void dump_space_info(struct btrfs_space_info *info, u64 bytes,
66 int dump_block_groups);
69 block_group_cache_done(struct btrfs_block_group_cache *cache)
72 return cache->cached == BTRFS_CACHE_FINISHED;
75 static int block_group_bits(struct btrfs_block_group_cache *cache, u64 bits)
77 return (cache->flags & bits) == bits;
80 void btrfs_get_block_group(struct btrfs_block_group_cache *cache)
82 atomic_inc(&cache->count);
85 void btrfs_put_block_group(struct btrfs_block_group_cache *cache)
87 if (atomic_dec_and_test(&cache->count)) {
88 WARN_ON(cache->pinned > 0);
89 WARN_ON(cache->reserved > 0);
90 WARN_ON(cache->reserved_pinned > 0);
96 * this adds the block group to the fs_info rb tree for the block group
99 static int btrfs_add_block_group_cache(struct btrfs_fs_info *info,
100 struct btrfs_block_group_cache *block_group)
103 struct rb_node *parent = NULL;
104 struct btrfs_block_group_cache *cache;
106 spin_lock(&info->block_group_cache_lock);
107 p = &info->block_group_cache_tree.rb_node;
111 cache = rb_entry(parent, struct btrfs_block_group_cache,
113 if (block_group->key.objectid < cache->key.objectid) {
115 } else if (block_group->key.objectid > cache->key.objectid) {
118 spin_unlock(&info->block_group_cache_lock);
123 rb_link_node(&block_group->cache_node, parent, p);
124 rb_insert_color(&block_group->cache_node,
125 &info->block_group_cache_tree);
126 spin_unlock(&info->block_group_cache_lock);
132 * This will return the block group at or after bytenr if contains is 0, else
133 * it will return the block group that contains the bytenr
135 static struct btrfs_block_group_cache *
136 block_group_cache_tree_search(struct btrfs_fs_info *info, u64 bytenr,
139 struct btrfs_block_group_cache *cache, *ret = NULL;
143 spin_lock(&info->block_group_cache_lock);
144 n = info->block_group_cache_tree.rb_node;
147 cache = rb_entry(n, struct btrfs_block_group_cache,
149 end = cache->key.objectid + cache->key.offset - 1;
150 start = cache->key.objectid;
152 if (bytenr < start) {
153 if (!contains && (!ret || start < ret->key.objectid))
156 } else if (bytenr > start) {
157 if (contains && bytenr <= end) {
168 btrfs_get_block_group(ret);
169 spin_unlock(&info->block_group_cache_lock);
174 static int add_excluded_extent(struct btrfs_root *root,
175 u64 start, u64 num_bytes)
177 u64 end = start + num_bytes - 1;
178 set_extent_bits(&root->fs_info->freed_extents[0],
179 start, end, EXTENT_UPTODATE, GFP_NOFS);
180 set_extent_bits(&root->fs_info->freed_extents[1],
181 start, end, EXTENT_UPTODATE, GFP_NOFS);
185 static void free_excluded_extents(struct btrfs_root *root,
186 struct btrfs_block_group_cache *cache)
190 start = cache->key.objectid;
191 end = start + cache->key.offset - 1;
193 clear_extent_bits(&root->fs_info->freed_extents[0],
194 start, end, EXTENT_UPTODATE, GFP_NOFS);
195 clear_extent_bits(&root->fs_info->freed_extents[1],
196 start, end, EXTENT_UPTODATE, GFP_NOFS);
199 static int exclude_super_stripes(struct btrfs_root *root,
200 struct btrfs_block_group_cache *cache)
207 if (cache->key.objectid < BTRFS_SUPER_INFO_OFFSET) {
208 stripe_len = BTRFS_SUPER_INFO_OFFSET - cache->key.objectid;
209 cache->bytes_super += stripe_len;
210 ret = add_excluded_extent(root, cache->key.objectid,
215 for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
216 bytenr = btrfs_sb_offset(i);
217 ret = btrfs_rmap_block(&root->fs_info->mapping_tree,
218 cache->key.objectid, bytenr,
219 0, &logical, &nr, &stripe_len);
223 cache->bytes_super += stripe_len;
224 ret = add_excluded_extent(root, logical[nr],
234 static struct btrfs_caching_control *
235 get_caching_control(struct btrfs_block_group_cache *cache)
237 struct btrfs_caching_control *ctl;
239 spin_lock(&cache->lock);
240 if (cache->cached != BTRFS_CACHE_STARTED) {
241 spin_unlock(&cache->lock);
245 /* We're loading it the fast way, so we don't have a caching_ctl. */
246 if (!cache->caching_ctl) {
247 spin_unlock(&cache->lock);
251 ctl = cache->caching_ctl;
252 atomic_inc(&ctl->count);
253 spin_unlock(&cache->lock);
257 static void put_caching_control(struct btrfs_caching_control *ctl)
259 if (atomic_dec_and_test(&ctl->count))
264 * this is only called by cache_block_group, since we could have freed extents
265 * we need to check the pinned_extents for any extents that can't be used yet
266 * since their free space will be released as soon as the transaction commits.
268 static u64 add_new_free_space(struct btrfs_block_group_cache *block_group,
269 struct btrfs_fs_info *info, u64 start, u64 end)
271 u64 extent_start, extent_end, size, total_added = 0;
274 while (start < end) {
275 ret = find_first_extent_bit(info->pinned_extents, start,
276 &extent_start, &extent_end,
277 EXTENT_DIRTY | EXTENT_UPTODATE);
281 if (extent_start <= start) {
282 start = extent_end + 1;
283 } else if (extent_start > start && extent_start < end) {
284 size = extent_start - start;
286 ret = btrfs_add_free_space(block_group, start,
289 start = extent_end + 1;
298 ret = btrfs_add_free_space(block_group, start, size);
305 static int caching_kthread(void *data)
307 struct btrfs_block_group_cache *block_group = data;
308 struct btrfs_fs_info *fs_info = block_group->fs_info;
309 struct btrfs_caching_control *caching_ctl = block_group->caching_ctl;
310 struct btrfs_root *extent_root = fs_info->extent_root;
311 struct btrfs_path *path;
312 struct extent_buffer *leaf;
313 struct btrfs_key key;
319 path = btrfs_alloc_path();
323 exclude_super_stripes(extent_root, block_group);
324 spin_lock(&block_group->space_info->lock);
325 block_group->space_info->bytes_readonly += block_group->bytes_super;
326 spin_unlock(&block_group->space_info->lock);
328 last = max_t(u64, block_group->key.objectid, BTRFS_SUPER_INFO_OFFSET);
331 * We don't want to deadlock with somebody trying to allocate a new
332 * extent for the extent root while also trying to search the extent
333 * root to add free space. So we skip locking and search the commit
334 * root, since its read-only
336 path->skip_locking = 1;
337 path->search_commit_root = 1;
342 key.type = BTRFS_EXTENT_ITEM_KEY;
344 mutex_lock(&caching_ctl->mutex);
345 /* need to make sure the commit_root doesn't disappear */
346 down_read(&fs_info->extent_commit_sem);
348 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
352 leaf = path->nodes[0];
353 nritems = btrfs_header_nritems(leaf);
357 if (fs_info->closing > 1) {
362 if (path->slots[0] < nritems) {
363 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
365 ret = find_next_key(path, 0, &key);
369 caching_ctl->progress = last;
370 btrfs_release_path(extent_root, path);
371 up_read(&fs_info->extent_commit_sem);
372 mutex_unlock(&caching_ctl->mutex);
373 if (btrfs_transaction_in_commit(fs_info))
380 if (key.objectid < block_group->key.objectid) {
385 if (key.objectid >= block_group->key.objectid +
386 block_group->key.offset)
389 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
390 total_found += add_new_free_space(block_group,
393 last = key.objectid + key.offset;
395 if (total_found > (1024 * 1024 * 2)) {
397 wake_up(&caching_ctl->wait);
404 total_found += add_new_free_space(block_group, fs_info, last,
405 block_group->key.objectid +
406 block_group->key.offset);
407 caching_ctl->progress = (u64)-1;
409 spin_lock(&block_group->lock);
410 block_group->caching_ctl = NULL;
411 block_group->cached = BTRFS_CACHE_FINISHED;
412 spin_unlock(&block_group->lock);
415 btrfs_free_path(path);
416 up_read(&fs_info->extent_commit_sem);
418 free_excluded_extents(extent_root, block_group);
420 mutex_unlock(&caching_ctl->mutex);
421 wake_up(&caching_ctl->wait);
423 put_caching_control(caching_ctl);
424 atomic_dec(&block_group->space_info->caching_threads);
425 btrfs_put_block_group(block_group);
430 static int cache_block_group(struct btrfs_block_group_cache *cache,
431 struct btrfs_trans_handle *trans,
432 struct btrfs_root *root,
435 struct btrfs_fs_info *fs_info = cache->fs_info;
436 struct btrfs_caching_control *caching_ctl;
437 struct task_struct *tsk;
441 if (cache->cached != BTRFS_CACHE_NO)
445 * We can't do the read from on-disk cache during a commit since we need
446 * to have the normal tree locking. Also if we are currently trying to
447 * allocate blocks for the tree root we can't do the fast caching since
448 * we likely hold important locks.
450 if (!trans->transaction->in_commit &&
451 (root && root != root->fs_info->tree_root)) {
452 spin_lock(&cache->lock);
453 if (cache->cached != BTRFS_CACHE_NO) {
454 spin_unlock(&cache->lock);
457 cache->cached = BTRFS_CACHE_STARTED;
458 spin_unlock(&cache->lock);
460 ret = load_free_space_cache(fs_info, cache);
462 spin_lock(&cache->lock);
464 cache->cached = BTRFS_CACHE_FINISHED;
465 cache->last_byte_to_unpin = (u64)-1;
467 cache->cached = BTRFS_CACHE_NO;
469 spin_unlock(&cache->lock);
477 caching_ctl = kzalloc(sizeof(*caching_ctl), GFP_KERNEL);
478 BUG_ON(!caching_ctl);
480 INIT_LIST_HEAD(&caching_ctl->list);
481 mutex_init(&caching_ctl->mutex);
482 init_waitqueue_head(&caching_ctl->wait);
483 caching_ctl->block_group = cache;
484 caching_ctl->progress = cache->key.objectid;
485 /* one for caching kthread, one for caching block group list */
486 atomic_set(&caching_ctl->count, 2);
488 spin_lock(&cache->lock);
489 if (cache->cached != BTRFS_CACHE_NO) {
490 spin_unlock(&cache->lock);
494 cache->caching_ctl = caching_ctl;
495 cache->cached = BTRFS_CACHE_STARTED;
496 spin_unlock(&cache->lock);
498 down_write(&fs_info->extent_commit_sem);
499 list_add_tail(&caching_ctl->list, &fs_info->caching_block_groups);
500 up_write(&fs_info->extent_commit_sem);
502 atomic_inc(&cache->space_info->caching_threads);
503 btrfs_get_block_group(cache);
505 tsk = kthread_run(caching_kthread, cache, "btrfs-cache-%llu\n",
506 cache->key.objectid);
509 printk(KERN_ERR "error running thread %d\n", ret);
517 * return the block group that starts at or after bytenr
519 static struct btrfs_block_group_cache *
520 btrfs_lookup_first_block_group(struct btrfs_fs_info *info, u64 bytenr)
522 struct btrfs_block_group_cache *cache;
524 cache = block_group_cache_tree_search(info, bytenr, 0);
530 * return the block group that contains the given bytenr
532 struct btrfs_block_group_cache *btrfs_lookup_block_group(
533 struct btrfs_fs_info *info,
536 struct btrfs_block_group_cache *cache;
538 cache = block_group_cache_tree_search(info, bytenr, 1);
543 static struct btrfs_space_info *__find_space_info(struct btrfs_fs_info *info,
546 struct list_head *head = &info->space_info;
547 struct btrfs_space_info *found;
549 flags &= BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_SYSTEM |
550 BTRFS_BLOCK_GROUP_METADATA;
553 list_for_each_entry_rcu(found, head, list) {
554 if (found->flags & flags) {
564 * after adding space to the filesystem, we need to clear the full flags
565 * on all the space infos.
567 void btrfs_clear_space_info_full(struct btrfs_fs_info *info)
569 struct list_head *head = &info->space_info;
570 struct btrfs_space_info *found;
573 list_for_each_entry_rcu(found, head, list)
578 static u64 div_factor(u64 num, int factor)
587 static u64 div_factor_fine(u64 num, int factor)
596 u64 btrfs_find_block_group(struct btrfs_root *root,
597 u64 search_start, u64 search_hint, int owner)
599 struct btrfs_block_group_cache *cache;
601 u64 last = max(search_hint, search_start);
608 cache = btrfs_lookup_first_block_group(root->fs_info, last);
612 spin_lock(&cache->lock);
613 last = cache->key.objectid + cache->key.offset;
614 used = btrfs_block_group_used(&cache->item);
616 if ((full_search || !cache->ro) &&
617 block_group_bits(cache, BTRFS_BLOCK_GROUP_METADATA)) {
618 if (used + cache->pinned + cache->reserved <
619 div_factor(cache->key.offset, factor)) {
620 group_start = cache->key.objectid;
621 spin_unlock(&cache->lock);
622 btrfs_put_block_group(cache);
626 spin_unlock(&cache->lock);
627 btrfs_put_block_group(cache);
635 if (!full_search && factor < 10) {
645 /* simple helper to search for an existing extent at a given offset */
646 int btrfs_lookup_extent(struct btrfs_root *root, u64 start, u64 len)
649 struct btrfs_key key;
650 struct btrfs_path *path;
652 path = btrfs_alloc_path();
654 key.objectid = start;
656 btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY);
657 ret = btrfs_search_slot(NULL, root->fs_info->extent_root, &key, path,
659 btrfs_free_path(path);
664 * helper function to lookup reference count and flags of extent.
666 * the head node for delayed ref is used to store the sum of all the
667 * reference count modifications queued up in the rbtree. the head
668 * node may also store the extent flags to set. This way you can check
669 * to see what the reference count and extent flags would be if all of
670 * the delayed refs are not processed.
672 int btrfs_lookup_extent_info(struct btrfs_trans_handle *trans,
673 struct btrfs_root *root, u64 bytenr,
674 u64 num_bytes, u64 *refs, u64 *flags)
676 struct btrfs_delayed_ref_head *head;
677 struct btrfs_delayed_ref_root *delayed_refs;
678 struct btrfs_path *path;
679 struct btrfs_extent_item *ei;
680 struct extent_buffer *leaf;
681 struct btrfs_key key;
687 path = btrfs_alloc_path();
691 key.objectid = bytenr;
692 key.type = BTRFS_EXTENT_ITEM_KEY;
693 key.offset = num_bytes;
695 path->skip_locking = 1;
696 path->search_commit_root = 1;
699 ret = btrfs_search_slot(trans, root->fs_info->extent_root,
705 leaf = path->nodes[0];
706 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
707 if (item_size >= sizeof(*ei)) {
708 ei = btrfs_item_ptr(leaf, path->slots[0],
709 struct btrfs_extent_item);
710 num_refs = btrfs_extent_refs(leaf, ei);
711 extent_flags = btrfs_extent_flags(leaf, ei);
713 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
714 struct btrfs_extent_item_v0 *ei0;
715 BUG_ON(item_size != sizeof(*ei0));
716 ei0 = btrfs_item_ptr(leaf, path->slots[0],
717 struct btrfs_extent_item_v0);
718 num_refs = btrfs_extent_refs_v0(leaf, ei0);
719 /* FIXME: this isn't correct for data */
720 extent_flags = BTRFS_BLOCK_FLAG_FULL_BACKREF;
725 BUG_ON(num_refs == 0);
735 delayed_refs = &trans->transaction->delayed_refs;
736 spin_lock(&delayed_refs->lock);
737 head = btrfs_find_delayed_ref_head(trans, bytenr);
739 if (!mutex_trylock(&head->mutex)) {
740 atomic_inc(&head->node.refs);
741 spin_unlock(&delayed_refs->lock);
743 btrfs_release_path(root->fs_info->extent_root, path);
745 mutex_lock(&head->mutex);
746 mutex_unlock(&head->mutex);
747 btrfs_put_delayed_ref(&head->node);
750 if (head->extent_op && head->extent_op->update_flags)
751 extent_flags |= head->extent_op->flags_to_set;
753 BUG_ON(num_refs == 0);
755 num_refs += head->node.ref_mod;
756 mutex_unlock(&head->mutex);
758 spin_unlock(&delayed_refs->lock);
760 WARN_ON(num_refs == 0);
764 *flags = extent_flags;
766 btrfs_free_path(path);
771 * Back reference rules. Back refs have three main goals:
773 * 1) differentiate between all holders of references to an extent so that
774 * when a reference is dropped we can make sure it was a valid reference
775 * before freeing the extent.
777 * 2) Provide enough information to quickly find the holders of an extent
778 * if we notice a given block is corrupted or bad.
780 * 3) Make it easy to migrate blocks for FS shrinking or storage pool
781 * maintenance. This is actually the same as #2, but with a slightly
782 * different use case.
784 * There are two kinds of back refs. The implicit back refs is optimized
785 * for pointers in non-shared tree blocks. For a given pointer in a block,
786 * back refs of this kind provide information about the block's owner tree
787 * and the pointer's key. These information allow us to find the block by
788 * b-tree searching. The full back refs is for pointers in tree blocks not
789 * referenced by their owner trees. The location of tree block is recorded
790 * in the back refs. Actually the full back refs is generic, and can be
791 * used in all cases the implicit back refs is used. The major shortcoming
792 * of the full back refs is its overhead. Every time a tree block gets
793 * COWed, we have to update back refs entry for all pointers in it.
795 * For a newly allocated tree block, we use implicit back refs for
796 * pointers in it. This means most tree related operations only involve
797 * implicit back refs. For a tree block created in old transaction, the
798 * only way to drop a reference to it is COW it. So we can detect the
799 * event that tree block loses its owner tree's reference and do the
800 * back refs conversion.
802 * When a tree block is COW'd through a tree, there are four cases:
804 * The reference count of the block is one and the tree is the block's
805 * owner tree. Nothing to do in this case.
807 * The reference count of the block is one and the tree is not the
808 * block's owner tree. In this case, full back refs is used for pointers
809 * in the block. Remove these full back refs, add implicit back refs for
810 * every pointers in the new block.
812 * The reference count of the block is greater than one and the tree is
813 * the block's owner tree. In this case, implicit back refs is used for
814 * pointers in the block. Add full back refs for every pointers in the
815 * block, increase lower level extents' reference counts. The original
816 * implicit back refs are entailed to the new block.
818 * The reference count of the block is greater than one and the tree is
819 * not the block's owner tree. Add implicit back refs for every pointer in
820 * the new block, increase lower level extents' reference count.
822 * Back Reference Key composing:
824 * The key objectid corresponds to the first byte in the extent,
825 * The key type is used to differentiate between types of back refs.
826 * There are different meanings of the key offset for different types
829 * File extents can be referenced by:
831 * - multiple snapshots, subvolumes, or different generations in one subvol
832 * - different files inside a single subvolume
833 * - different offsets inside a file (bookend extents in file.c)
835 * The extent ref structure for the implicit back refs has fields for:
837 * - Objectid of the subvolume root
838 * - objectid of the file holding the reference
839 * - original offset in the file
840 * - how many bookend extents
842 * The key offset for the implicit back refs is hash of the first
845 * The extent ref structure for the full back refs has field for:
847 * - number of pointers in the tree leaf
849 * The key offset for the implicit back refs is the first byte of
852 * When a file extent is allocated, The implicit back refs is used.
853 * the fields are filled in:
855 * (root_key.objectid, inode objectid, offset in file, 1)
857 * When a file extent is removed file truncation, we find the
858 * corresponding implicit back refs and check the following fields:
860 * (btrfs_header_owner(leaf), inode objectid, offset in file)
862 * Btree extents can be referenced by:
864 * - Different subvolumes
866 * Both the implicit back refs and the full back refs for tree blocks
867 * only consist of key. The key offset for the implicit back refs is
868 * objectid of block's owner tree. The key offset for the full back refs
869 * is the first byte of parent block.
871 * When implicit back refs is used, information about the lowest key and
872 * level of the tree block are required. These information are stored in
873 * tree block info structure.
876 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
877 static int convert_extent_item_v0(struct btrfs_trans_handle *trans,
878 struct btrfs_root *root,
879 struct btrfs_path *path,
880 u64 owner, u32 extra_size)
882 struct btrfs_extent_item *item;
883 struct btrfs_extent_item_v0 *ei0;
884 struct btrfs_extent_ref_v0 *ref0;
885 struct btrfs_tree_block_info *bi;
886 struct extent_buffer *leaf;
887 struct btrfs_key key;
888 struct btrfs_key found_key;
889 u32 new_size = sizeof(*item);
893 leaf = path->nodes[0];
894 BUG_ON(btrfs_item_size_nr(leaf, path->slots[0]) != sizeof(*ei0));
896 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
897 ei0 = btrfs_item_ptr(leaf, path->slots[0],
898 struct btrfs_extent_item_v0);
899 refs = btrfs_extent_refs_v0(leaf, ei0);
901 if (owner == (u64)-1) {
903 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
904 ret = btrfs_next_leaf(root, path);
908 leaf = path->nodes[0];
910 btrfs_item_key_to_cpu(leaf, &found_key,
912 BUG_ON(key.objectid != found_key.objectid);
913 if (found_key.type != BTRFS_EXTENT_REF_V0_KEY) {
917 ref0 = btrfs_item_ptr(leaf, path->slots[0],
918 struct btrfs_extent_ref_v0);
919 owner = btrfs_ref_objectid_v0(leaf, ref0);
923 btrfs_release_path(root, path);
925 if (owner < BTRFS_FIRST_FREE_OBJECTID)
926 new_size += sizeof(*bi);
928 new_size -= sizeof(*ei0);
929 ret = btrfs_search_slot(trans, root, &key, path,
930 new_size + extra_size, 1);
935 ret = btrfs_extend_item(trans, root, path, new_size);
938 leaf = path->nodes[0];
939 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
940 btrfs_set_extent_refs(leaf, item, refs);
941 /* FIXME: get real generation */
942 btrfs_set_extent_generation(leaf, item, 0);
943 if (owner < BTRFS_FIRST_FREE_OBJECTID) {
944 btrfs_set_extent_flags(leaf, item,
945 BTRFS_EXTENT_FLAG_TREE_BLOCK |
946 BTRFS_BLOCK_FLAG_FULL_BACKREF);
947 bi = (struct btrfs_tree_block_info *)(item + 1);
948 /* FIXME: get first key of the block */
949 memset_extent_buffer(leaf, 0, (unsigned long)bi, sizeof(*bi));
950 btrfs_set_tree_block_level(leaf, bi, (int)owner);
952 btrfs_set_extent_flags(leaf, item, BTRFS_EXTENT_FLAG_DATA);
954 btrfs_mark_buffer_dirty(leaf);
959 static u64 hash_extent_data_ref(u64 root_objectid, u64 owner, u64 offset)
961 u32 high_crc = ~(u32)0;
962 u32 low_crc = ~(u32)0;
965 lenum = cpu_to_le64(root_objectid);
966 high_crc = crc32c(high_crc, &lenum, sizeof(lenum));
967 lenum = cpu_to_le64(owner);
968 low_crc = crc32c(low_crc, &lenum, sizeof(lenum));
969 lenum = cpu_to_le64(offset);
970 low_crc = crc32c(low_crc, &lenum, sizeof(lenum));
972 return ((u64)high_crc << 31) ^ (u64)low_crc;
975 static u64 hash_extent_data_ref_item(struct extent_buffer *leaf,
976 struct btrfs_extent_data_ref *ref)
978 return hash_extent_data_ref(btrfs_extent_data_ref_root(leaf, ref),
979 btrfs_extent_data_ref_objectid(leaf, ref),
980 btrfs_extent_data_ref_offset(leaf, ref));
983 static int match_extent_data_ref(struct extent_buffer *leaf,
984 struct btrfs_extent_data_ref *ref,
985 u64 root_objectid, u64 owner, u64 offset)
987 if (btrfs_extent_data_ref_root(leaf, ref) != root_objectid ||
988 btrfs_extent_data_ref_objectid(leaf, ref) != owner ||
989 btrfs_extent_data_ref_offset(leaf, ref) != offset)
994 static noinline int lookup_extent_data_ref(struct btrfs_trans_handle *trans,
995 struct btrfs_root *root,
996 struct btrfs_path *path,
997 u64 bytenr, u64 parent,
999 u64 owner, u64 offset)
1001 struct btrfs_key key;
1002 struct btrfs_extent_data_ref *ref;
1003 struct extent_buffer *leaf;
1009 key.objectid = bytenr;
1011 key.type = BTRFS_SHARED_DATA_REF_KEY;
1012 key.offset = parent;
1014 key.type = BTRFS_EXTENT_DATA_REF_KEY;
1015 key.offset = hash_extent_data_ref(root_objectid,
1020 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1029 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1030 key.type = BTRFS_EXTENT_REF_V0_KEY;
1031 btrfs_release_path(root, path);
1032 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1043 leaf = path->nodes[0];
1044 nritems = btrfs_header_nritems(leaf);
1046 if (path->slots[0] >= nritems) {
1047 ret = btrfs_next_leaf(root, path);
1053 leaf = path->nodes[0];
1054 nritems = btrfs_header_nritems(leaf);
1058 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1059 if (key.objectid != bytenr ||
1060 key.type != BTRFS_EXTENT_DATA_REF_KEY)
1063 ref = btrfs_item_ptr(leaf, path->slots[0],
1064 struct btrfs_extent_data_ref);
1066 if (match_extent_data_ref(leaf, ref, root_objectid,
1069 btrfs_release_path(root, path);
1081 static noinline int insert_extent_data_ref(struct btrfs_trans_handle *trans,
1082 struct btrfs_root *root,
1083 struct btrfs_path *path,
1084 u64 bytenr, u64 parent,
1085 u64 root_objectid, u64 owner,
1086 u64 offset, int refs_to_add)
1088 struct btrfs_key key;
1089 struct extent_buffer *leaf;
1094 key.objectid = bytenr;
1096 key.type = BTRFS_SHARED_DATA_REF_KEY;
1097 key.offset = parent;
1098 size = sizeof(struct btrfs_shared_data_ref);
1100 key.type = BTRFS_EXTENT_DATA_REF_KEY;
1101 key.offset = hash_extent_data_ref(root_objectid,
1103 size = sizeof(struct btrfs_extent_data_ref);
1106 ret = btrfs_insert_empty_item(trans, root, path, &key, size);
1107 if (ret && ret != -EEXIST)
1110 leaf = path->nodes[0];
1112 struct btrfs_shared_data_ref *ref;
1113 ref = btrfs_item_ptr(leaf, path->slots[0],
1114 struct btrfs_shared_data_ref);
1116 btrfs_set_shared_data_ref_count(leaf, ref, refs_to_add);
1118 num_refs = btrfs_shared_data_ref_count(leaf, ref);
1119 num_refs += refs_to_add;
1120 btrfs_set_shared_data_ref_count(leaf, ref, num_refs);
1123 struct btrfs_extent_data_ref *ref;
1124 while (ret == -EEXIST) {
1125 ref = btrfs_item_ptr(leaf, path->slots[0],
1126 struct btrfs_extent_data_ref);
1127 if (match_extent_data_ref(leaf, ref, root_objectid,
1130 btrfs_release_path(root, path);
1132 ret = btrfs_insert_empty_item(trans, root, path, &key,
1134 if (ret && ret != -EEXIST)
1137 leaf = path->nodes[0];
1139 ref = btrfs_item_ptr(leaf, path->slots[0],
1140 struct btrfs_extent_data_ref);
1142 btrfs_set_extent_data_ref_root(leaf, ref,
1144 btrfs_set_extent_data_ref_objectid(leaf, ref, owner);
1145 btrfs_set_extent_data_ref_offset(leaf, ref, offset);
1146 btrfs_set_extent_data_ref_count(leaf, ref, refs_to_add);
1148 num_refs = btrfs_extent_data_ref_count(leaf, ref);
1149 num_refs += refs_to_add;
1150 btrfs_set_extent_data_ref_count(leaf, ref, num_refs);
1153 btrfs_mark_buffer_dirty(leaf);
1156 btrfs_release_path(root, path);
1160 static noinline int remove_extent_data_ref(struct btrfs_trans_handle *trans,
1161 struct btrfs_root *root,
1162 struct btrfs_path *path,
1165 struct btrfs_key key;
1166 struct btrfs_extent_data_ref *ref1 = NULL;
1167 struct btrfs_shared_data_ref *ref2 = NULL;
1168 struct extent_buffer *leaf;
1172 leaf = path->nodes[0];
1173 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1175 if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
1176 ref1 = btrfs_item_ptr(leaf, path->slots[0],
1177 struct btrfs_extent_data_ref);
1178 num_refs = btrfs_extent_data_ref_count(leaf, ref1);
1179 } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
1180 ref2 = btrfs_item_ptr(leaf, path->slots[0],
1181 struct btrfs_shared_data_ref);
1182 num_refs = btrfs_shared_data_ref_count(leaf, ref2);
1183 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1184 } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
1185 struct btrfs_extent_ref_v0 *ref0;
1186 ref0 = btrfs_item_ptr(leaf, path->slots[0],
1187 struct btrfs_extent_ref_v0);
1188 num_refs = btrfs_ref_count_v0(leaf, ref0);
1194 BUG_ON(num_refs < refs_to_drop);
1195 num_refs -= refs_to_drop;
1197 if (num_refs == 0) {
1198 ret = btrfs_del_item(trans, root, path);
1200 if (key.type == BTRFS_EXTENT_DATA_REF_KEY)
1201 btrfs_set_extent_data_ref_count(leaf, ref1, num_refs);
1202 else if (key.type == BTRFS_SHARED_DATA_REF_KEY)
1203 btrfs_set_shared_data_ref_count(leaf, ref2, num_refs);
1204 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1206 struct btrfs_extent_ref_v0 *ref0;
1207 ref0 = btrfs_item_ptr(leaf, path->slots[0],
1208 struct btrfs_extent_ref_v0);
1209 btrfs_set_ref_count_v0(leaf, ref0, num_refs);
1212 btrfs_mark_buffer_dirty(leaf);
1217 static noinline u32 extent_data_ref_count(struct btrfs_root *root,
1218 struct btrfs_path *path,
1219 struct btrfs_extent_inline_ref *iref)
1221 struct btrfs_key key;
1222 struct extent_buffer *leaf;
1223 struct btrfs_extent_data_ref *ref1;
1224 struct btrfs_shared_data_ref *ref2;
1227 leaf = path->nodes[0];
1228 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1230 if (btrfs_extent_inline_ref_type(leaf, iref) ==
1231 BTRFS_EXTENT_DATA_REF_KEY) {
1232 ref1 = (struct btrfs_extent_data_ref *)(&iref->offset);
1233 num_refs = btrfs_extent_data_ref_count(leaf, ref1);
1235 ref2 = (struct btrfs_shared_data_ref *)(iref + 1);
1236 num_refs = btrfs_shared_data_ref_count(leaf, ref2);
1238 } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
1239 ref1 = btrfs_item_ptr(leaf, path->slots[0],
1240 struct btrfs_extent_data_ref);
1241 num_refs = btrfs_extent_data_ref_count(leaf, ref1);
1242 } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
1243 ref2 = btrfs_item_ptr(leaf, path->slots[0],
1244 struct btrfs_shared_data_ref);
1245 num_refs = btrfs_shared_data_ref_count(leaf, ref2);
1246 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1247 } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
1248 struct btrfs_extent_ref_v0 *ref0;
1249 ref0 = btrfs_item_ptr(leaf, path->slots[0],
1250 struct btrfs_extent_ref_v0);
1251 num_refs = btrfs_ref_count_v0(leaf, ref0);
1259 static noinline int lookup_tree_block_ref(struct btrfs_trans_handle *trans,
1260 struct btrfs_root *root,
1261 struct btrfs_path *path,
1262 u64 bytenr, u64 parent,
1265 struct btrfs_key key;
1268 key.objectid = bytenr;
1270 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
1271 key.offset = parent;
1273 key.type = BTRFS_TREE_BLOCK_REF_KEY;
1274 key.offset = root_objectid;
1277 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1280 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1281 if (ret == -ENOENT && parent) {
1282 btrfs_release_path(root, path);
1283 key.type = BTRFS_EXTENT_REF_V0_KEY;
1284 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1292 static noinline int insert_tree_block_ref(struct btrfs_trans_handle *trans,
1293 struct btrfs_root *root,
1294 struct btrfs_path *path,
1295 u64 bytenr, u64 parent,
1298 struct btrfs_key key;
1301 key.objectid = bytenr;
1303 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
1304 key.offset = parent;
1306 key.type = BTRFS_TREE_BLOCK_REF_KEY;
1307 key.offset = root_objectid;
1310 ret = btrfs_insert_empty_item(trans, root, path, &key, 0);
1311 btrfs_release_path(root, path);
1315 static inline int extent_ref_type(u64 parent, u64 owner)
1318 if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1320 type = BTRFS_SHARED_BLOCK_REF_KEY;
1322 type = BTRFS_TREE_BLOCK_REF_KEY;
1325 type = BTRFS_SHARED_DATA_REF_KEY;
1327 type = BTRFS_EXTENT_DATA_REF_KEY;
1332 static int find_next_key(struct btrfs_path *path, int level,
1333 struct btrfs_key *key)
1336 for (; level < BTRFS_MAX_LEVEL; level++) {
1337 if (!path->nodes[level])
1339 if (path->slots[level] + 1 >=
1340 btrfs_header_nritems(path->nodes[level]))
1343 btrfs_item_key_to_cpu(path->nodes[level], key,
1344 path->slots[level] + 1);
1346 btrfs_node_key_to_cpu(path->nodes[level], key,
1347 path->slots[level] + 1);
1354 * look for inline back ref. if back ref is found, *ref_ret is set
1355 * to the address of inline back ref, and 0 is returned.
1357 * if back ref isn't found, *ref_ret is set to the address where it
1358 * should be inserted, and -ENOENT is returned.
1360 * if insert is true and there are too many inline back refs, the path
1361 * points to the extent item, and -EAGAIN is returned.
1363 * NOTE: inline back refs are ordered in the same way that back ref
1364 * items in the tree are ordered.
1366 static noinline_for_stack
1367 int lookup_inline_extent_backref(struct btrfs_trans_handle *trans,
1368 struct btrfs_root *root,
1369 struct btrfs_path *path,
1370 struct btrfs_extent_inline_ref **ref_ret,
1371 u64 bytenr, u64 num_bytes,
1372 u64 parent, u64 root_objectid,
1373 u64 owner, u64 offset, int insert)
1375 struct btrfs_key key;
1376 struct extent_buffer *leaf;
1377 struct btrfs_extent_item *ei;
1378 struct btrfs_extent_inline_ref *iref;
1389 key.objectid = bytenr;
1390 key.type = BTRFS_EXTENT_ITEM_KEY;
1391 key.offset = num_bytes;
1393 want = extent_ref_type(parent, owner);
1395 extra_size = btrfs_extent_inline_ref_size(want);
1396 path->keep_locks = 1;
1399 ret = btrfs_search_slot(trans, root, &key, path, extra_size, 1);
1406 leaf = path->nodes[0];
1407 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1408 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1409 if (item_size < sizeof(*ei)) {
1414 ret = convert_extent_item_v0(trans, root, path, owner,
1420 leaf = path->nodes[0];
1421 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1424 BUG_ON(item_size < sizeof(*ei));
1426 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1427 flags = btrfs_extent_flags(leaf, ei);
1429 ptr = (unsigned long)(ei + 1);
1430 end = (unsigned long)ei + item_size;
1432 if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
1433 ptr += sizeof(struct btrfs_tree_block_info);
1436 BUG_ON(!(flags & BTRFS_EXTENT_FLAG_DATA));
1445 iref = (struct btrfs_extent_inline_ref *)ptr;
1446 type = btrfs_extent_inline_ref_type(leaf, iref);
1450 ptr += btrfs_extent_inline_ref_size(type);
1454 if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1455 struct btrfs_extent_data_ref *dref;
1456 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1457 if (match_extent_data_ref(leaf, dref, root_objectid,
1462 if (hash_extent_data_ref_item(leaf, dref) <
1463 hash_extent_data_ref(root_objectid, owner, offset))
1467 ref_offset = btrfs_extent_inline_ref_offset(leaf, iref);
1469 if (parent == ref_offset) {
1473 if (ref_offset < parent)
1476 if (root_objectid == ref_offset) {
1480 if (ref_offset < root_objectid)
1484 ptr += btrfs_extent_inline_ref_size(type);
1486 if (err == -ENOENT && insert) {
1487 if (item_size + extra_size >=
1488 BTRFS_MAX_EXTENT_ITEM_SIZE(root)) {
1493 * To add new inline back ref, we have to make sure
1494 * there is no corresponding back ref item.
1495 * For simplicity, we just do not add new inline back
1496 * ref if there is any kind of item for this block
1498 if (find_next_key(path, 0, &key) == 0 &&
1499 key.objectid == bytenr &&
1500 key.type < BTRFS_BLOCK_GROUP_ITEM_KEY) {
1505 *ref_ret = (struct btrfs_extent_inline_ref *)ptr;
1508 path->keep_locks = 0;
1509 btrfs_unlock_up_safe(path, 1);
1515 * helper to add new inline back ref
1517 static noinline_for_stack
1518 int setup_inline_extent_backref(struct btrfs_trans_handle *trans,
1519 struct btrfs_root *root,
1520 struct btrfs_path *path,
1521 struct btrfs_extent_inline_ref *iref,
1522 u64 parent, u64 root_objectid,
1523 u64 owner, u64 offset, int refs_to_add,
1524 struct btrfs_delayed_extent_op *extent_op)
1526 struct extent_buffer *leaf;
1527 struct btrfs_extent_item *ei;
1530 unsigned long item_offset;
1536 leaf = path->nodes[0];
1537 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1538 item_offset = (unsigned long)iref - (unsigned long)ei;
1540 type = extent_ref_type(parent, owner);
1541 size = btrfs_extent_inline_ref_size(type);
1543 ret = btrfs_extend_item(trans, root, path, size);
1546 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1547 refs = btrfs_extent_refs(leaf, ei);
1548 refs += refs_to_add;
1549 btrfs_set_extent_refs(leaf, ei, refs);
1551 __run_delayed_extent_op(extent_op, leaf, ei);
1553 ptr = (unsigned long)ei + item_offset;
1554 end = (unsigned long)ei + btrfs_item_size_nr(leaf, path->slots[0]);
1555 if (ptr < end - size)
1556 memmove_extent_buffer(leaf, ptr + size, ptr,
1559 iref = (struct btrfs_extent_inline_ref *)ptr;
1560 btrfs_set_extent_inline_ref_type(leaf, iref, type);
1561 if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1562 struct btrfs_extent_data_ref *dref;
1563 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1564 btrfs_set_extent_data_ref_root(leaf, dref, root_objectid);
1565 btrfs_set_extent_data_ref_objectid(leaf, dref, owner);
1566 btrfs_set_extent_data_ref_offset(leaf, dref, offset);
1567 btrfs_set_extent_data_ref_count(leaf, dref, refs_to_add);
1568 } else if (type == BTRFS_SHARED_DATA_REF_KEY) {
1569 struct btrfs_shared_data_ref *sref;
1570 sref = (struct btrfs_shared_data_ref *)(iref + 1);
1571 btrfs_set_shared_data_ref_count(leaf, sref, refs_to_add);
1572 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
1573 } else if (type == BTRFS_SHARED_BLOCK_REF_KEY) {
1574 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
1576 btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid);
1578 btrfs_mark_buffer_dirty(leaf);
1582 static int lookup_extent_backref(struct btrfs_trans_handle *trans,
1583 struct btrfs_root *root,
1584 struct btrfs_path *path,
1585 struct btrfs_extent_inline_ref **ref_ret,
1586 u64 bytenr, u64 num_bytes, u64 parent,
1587 u64 root_objectid, u64 owner, u64 offset)
1591 ret = lookup_inline_extent_backref(trans, root, path, ref_ret,
1592 bytenr, num_bytes, parent,
1593 root_objectid, owner, offset, 0);
1597 btrfs_release_path(root, path);
1600 if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1601 ret = lookup_tree_block_ref(trans, root, path, bytenr, parent,
1604 ret = lookup_extent_data_ref(trans, root, path, bytenr, parent,
1605 root_objectid, owner, offset);
1611 * helper to update/remove inline back ref
1613 static noinline_for_stack
1614 int update_inline_extent_backref(struct btrfs_trans_handle *trans,
1615 struct btrfs_root *root,
1616 struct btrfs_path *path,
1617 struct btrfs_extent_inline_ref *iref,
1619 struct btrfs_delayed_extent_op *extent_op)
1621 struct extent_buffer *leaf;
1622 struct btrfs_extent_item *ei;
1623 struct btrfs_extent_data_ref *dref = NULL;
1624 struct btrfs_shared_data_ref *sref = NULL;
1633 leaf = path->nodes[0];
1634 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1635 refs = btrfs_extent_refs(leaf, ei);
1636 WARN_ON(refs_to_mod < 0 && refs + refs_to_mod <= 0);
1637 refs += refs_to_mod;
1638 btrfs_set_extent_refs(leaf, ei, refs);
1640 __run_delayed_extent_op(extent_op, leaf, ei);
1642 type = btrfs_extent_inline_ref_type(leaf, iref);
1644 if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1645 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1646 refs = btrfs_extent_data_ref_count(leaf, dref);
1647 } else if (type == BTRFS_SHARED_DATA_REF_KEY) {
1648 sref = (struct btrfs_shared_data_ref *)(iref + 1);
1649 refs = btrfs_shared_data_ref_count(leaf, sref);
1652 BUG_ON(refs_to_mod != -1);
1655 BUG_ON(refs_to_mod < 0 && refs < -refs_to_mod);
1656 refs += refs_to_mod;
1659 if (type == BTRFS_EXTENT_DATA_REF_KEY)
1660 btrfs_set_extent_data_ref_count(leaf, dref, refs);
1662 btrfs_set_shared_data_ref_count(leaf, sref, refs);
1664 size = btrfs_extent_inline_ref_size(type);
1665 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1666 ptr = (unsigned long)iref;
1667 end = (unsigned long)ei + item_size;
1668 if (ptr + size < end)
1669 memmove_extent_buffer(leaf, ptr, ptr + size,
1672 ret = btrfs_truncate_item(trans, root, path, item_size, 1);
1675 btrfs_mark_buffer_dirty(leaf);
1679 static noinline_for_stack
1680 int insert_inline_extent_backref(struct btrfs_trans_handle *trans,
1681 struct btrfs_root *root,
1682 struct btrfs_path *path,
1683 u64 bytenr, u64 num_bytes, u64 parent,
1684 u64 root_objectid, u64 owner,
1685 u64 offset, int refs_to_add,
1686 struct btrfs_delayed_extent_op *extent_op)
1688 struct btrfs_extent_inline_ref *iref;
1691 ret = lookup_inline_extent_backref(trans, root, path, &iref,
1692 bytenr, num_bytes, parent,
1693 root_objectid, owner, offset, 1);
1695 BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID);
1696 ret = update_inline_extent_backref(trans, root, path, iref,
1697 refs_to_add, extent_op);
1698 } else if (ret == -ENOENT) {
1699 ret = setup_inline_extent_backref(trans, root, path, iref,
1700 parent, root_objectid,
1701 owner, offset, refs_to_add,
1707 static int insert_extent_backref(struct btrfs_trans_handle *trans,
1708 struct btrfs_root *root,
1709 struct btrfs_path *path,
1710 u64 bytenr, u64 parent, u64 root_objectid,
1711 u64 owner, u64 offset, int refs_to_add)
1714 if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1715 BUG_ON(refs_to_add != 1);
1716 ret = insert_tree_block_ref(trans, root, path, bytenr,
1717 parent, root_objectid);
1719 ret = insert_extent_data_ref(trans, root, path, bytenr,
1720 parent, root_objectid,
1721 owner, offset, refs_to_add);
1726 static int remove_extent_backref(struct btrfs_trans_handle *trans,
1727 struct btrfs_root *root,
1728 struct btrfs_path *path,
1729 struct btrfs_extent_inline_ref *iref,
1730 int refs_to_drop, int is_data)
1734 BUG_ON(!is_data && refs_to_drop != 1);
1736 ret = update_inline_extent_backref(trans, root, path, iref,
1737 -refs_to_drop, NULL);
1738 } else if (is_data) {
1739 ret = remove_extent_data_ref(trans, root, path, refs_to_drop);
1741 ret = btrfs_del_item(trans, root, path);
1746 static void btrfs_issue_discard(struct block_device *bdev,
1749 blkdev_issue_discard(bdev, start >> 9, len >> 9, GFP_KERNEL,
1750 BLKDEV_IFL_WAIT | BLKDEV_IFL_BARRIER);
1753 static int btrfs_discard_extent(struct btrfs_root *root, u64 bytenr,
1757 u64 map_length = num_bytes;
1758 struct btrfs_multi_bio *multi = NULL;
1760 if (!btrfs_test_opt(root, DISCARD))
1763 /* Tell the block device(s) that the sectors can be discarded */
1764 ret = btrfs_map_block(&root->fs_info->mapping_tree, READ,
1765 bytenr, &map_length, &multi, 0);
1767 struct btrfs_bio_stripe *stripe = multi->stripes;
1770 if (map_length > num_bytes)
1771 map_length = num_bytes;
1773 for (i = 0; i < multi->num_stripes; i++, stripe++) {
1774 btrfs_issue_discard(stripe->dev->bdev,
1784 int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans,
1785 struct btrfs_root *root,
1786 u64 bytenr, u64 num_bytes, u64 parent,
1787 u64 root_objectid, u64 owner, u64 offset)
1790 BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID &&
1791 root_objectid == BTRFS_TREE_LOG_OBJECTID);
1793 if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1794 ret = btrfs_add_delayed_tree_ref(trans, bytenr, num_bytes,
1795 parent, root_objectid, (int)owner,
1796 BTRFS_ADD_DELAYED_REF, NULL);
1798 ret = btrfs_add_delayed_data_ref(trans, bytenr, num_bytes,
1799 parent, root_objectid, owner, offset,
1800 BTRFS_ADD_DELAYED_REF, NULL);
1805 static int __btrfs_inc_extent_ref(struct btrfs_trans_handle *trans,
1806 struct btrfs_root *root,
1807 u64 bytenr, u64 num_bytes,
1808 u64 parent, u64 root_objectid,
1809 u64 owner, u64 offset, int refs_to_add,
1810 struct btrfs_delayed_extent_op *extent_op)
1812 struct btrfs_path *path;
1813 struct extent_buffer *leaf;
1814 struct btrfs_extent_item *item;
1819 path = btrfs_alloc_path();
1824 path->leave_spinning = 1;
1825 /* this will setup the path even if it fails to insert the back ref */
1826 ret = insert_inline_extent_backref(trans, root->fs_info->extent_root,
1827 path, bytenr, num_bytes, parent,
1828 root_objectid, owner, offset,
1829 refs_to_add, extent_op);
1833 if (ret != -EAGAIN) {
1838 leaf = path->nodes[0];
1839 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1840 refs = btrfs_extent_refs(leaf, item);
1841 btrfs_set_extent_refs(leaf, item, refs + refs_to_add);
1843 __run_delayed_extent_op(extent_op, leaf, item);
1845 btrfs_mark_buffer_dirty(leaf);
1846 btrfs_release_path(root->fs_info->extent_root, path);
1849 path->leave_spinning = 1;
1851 /* now insert the actual backref */
1852 ret = insert_extent_backref(trans, root->fs_info->extent_root,
1853 path, bytenr, parent, root_objectid,
1854 owner, offset, refs_to_add);
1857 btrfs_free_path(path);
1861 static int run_delayed_data_ref(struct btrfs_trans_handle *trans,
1862 struct btrfs_root *root,
1863 struct btrfs_delayed_ref_node *node,
1864 struct btrfs_delayed_extent_op *extent_op,
1865 int insert_reserved)
1868 struct btrfs_delayed_data_ref *ref;
1869 struct btrfs_key ins;
1874 ins.objectid = node->bytenr;
1875 ins.offset = node->num_bytes;
1876 ins.type = BTRFS_EXTENT_ITEM_KEY;
1878 ref = btrfs_delayed_node_to_data_ref(node);
1879 if (node->type == BTRFS_SHARED_DATA_REF_KEY)
1880 parent = ref->parent;
1882 ref_root = ref->root;
1884 if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
1886 BUG_ON(extent_op->update_key);
1887 flags |= extent_op->flags_to_set;
1889 ret = alloc_reserved_file_extent(trans, root,
1890 parent, ref_root, flags,
1891 ref->objectid, ref->offset,
1892 &ins, node->ref_mod);
1893 } else if (node->action == BTRFS_ADD_DELAYED_REF) {
1894 ret = __btrfs_inc_extent_ref(trans, root, node->bytenr,
1895 node->num_bytes, parent,
1896 ref_root, ref->objectid,
1897 ref->offset, node->ref_mod,
1899 } else if (node->action == BTRFS_DROP_DELAYED_REF) {
1900 ret = __btrfs_free_extent(trans, root, node->bytenr,
1901 node->num_bytes, parent,
1902 ref_root, ref->objectid,
1903 ref->offset, node->ref_mod,
1911 static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op,
1912 struct extent_buffer *leaf,
1913 struct btrfs_extent_item *ei)
1915 u64 flags = btrfs_extent_flags(leaf, ei);
1916 if (extent_op->update_flags) {
1917 flags |= extent_op->flags_to_set;
1918 btrfs_set_extent_flags(leaf, ei, flags);
1921 if (extent_op->update_key) {
1922 struct btrfs_tree_block_info *bi;
1923 BUG_ON(!(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK));
1924 bi = (struct btrfs_tree_block_info *)(ei + 1);
1925 btrfs_set_tree_block_key(leaf, bi, &extent_op->key);
1929 static int run_delayed_extent_op(struct btrfs_trans_handle *trans,
1930 struct btrfs_root *root,
1931 struct btrfs_delayed_ref_node *node,
1932 struct btrfs_delayed_extent_op *extent_op)
1934 struct btrfs_key key;
1935 struct btrfs_path *path;
1936 struct btrfs_extent_item *ei;
1937 struct extent_buffer *leaf;
1942 path = btrfs_alloc_path();
1946 key.objectid = node->bytenr;
1947 key.type = BTRFS_EXTENT_ITEM_KEY;
1948 key.offset = node->num_bytes;
1951 path->leave_spinning = 1;
1952 ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key,
1963 leaf = path->nodes[0];
1964 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1965 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1966 if (item_size < sizeof(*ei)) {
1967 ret = convert_extent_item_v0(trans, root->fs_info->extent_root,
1973 leaf = path->nodes[0];
1974 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1977 BUG_ON(item_size < sizeof(*ei));
1978 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1979 __run_delayed_extent_op(extent_op, leaf, ei);
1981 btrfs_mark_buffer_dirty(leaf);
1983 btrfs_free_path(path);
1987 static int run_delayed_tree_ref(struct btrfs_trans_handle *trans,
1988 struct btrfs_root *root,
1989 struct btrfs_delayed_ref_node *node,
1990 struct btrfs_delayed_extent_op *extent_op,
1991 int insert_reserved)
1994 struct btrfs_delayed_tree_ref *ref;
1995 struct btrfs_key ins;
1999 ins.objectid = node->bytenr;
2000 ins.offset = node->num_bytes;
2001 ins.type = BTRFS_EXTENT_ITEM_KEY;
2003 ref = btrfs_delayed_node_to_tree_ref(node);
2004 if (node->type == BTRFS_SHARED_BLOCK_REF_KEY)
2005 parent = ref->parent;
2007 ref_root = ref->root;
2009 BUG_ON(node->ref_mod != 1);
2010 if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
2011 BUG_ON(!extent_op || !extent_op->update_flags ||
2012 !extent_op->update_key);
2013 ret = alloc_reserved_tree_block(trans, root,
2015 extent_op->flags_to_set,
2018 } else if (node->action == BTRFS_ADD_DELAYED_REF) {
2019 ret = __btrfs_inc_extent_ref(trans, root, node->bytenr,
2020 node->num_bytes, parent, ref_root,
2021 ref->level, 0, 1, extent_op);
2022 } else if (node->action == BTRFS_DROP_DELAYED_REF) {
2023 ret = __btrfs_free_extent(trans, root, node->bytenr,
2024 node->num_bytes, parent, ref_root,
2025 ref->level, 0, 1, extent_op);
2032 /* helper function to actually process a single delayed ref entry */
2033 static int run_one_delayed_ref(struct btrfs_trans_handle *trans,
2034 struct btrfs_root *root,
2035 struct btrfs_delayed_ref_node *node,
2036 struct btrfs_delayed_extent_op *extent_op,
2037 int insert_reserved)
2040 if (btrfs_delayed_ref_is_head(node)) {
2041 struct btrfs_delayed_ref_head *head;
2043 * we've hit the end of the chain and we were supposed
2044 * to insert this extent into the tree. But, it got
2045 * deleted before we ever needed to insert it, so all
2046 * we have to do is clean up the accounting
2049 head = btrfs_delayed_node_to_head(node);
2050 if (insert_reserved) {
2051 btrfs_pin_extent(root, node->bytenr,
2052 node->num_bytes, 1);
2053 if (head->is_data) {
2054 ret = btrfs_del_csums(trans, root,
2060 mutex_unlock(&head->mutex);
2064 if (node->type == BTRFS_TREE_BLOCK_REF_KEY ||
2065 node->type == BTRFS_SHARED_BLOCK_REF_KEY)
2066 ret = run_delayed_tree_ref(trans, root, node, extent_op,
2068 else if (node->type == BTRFS_EXTENT_DATA_REF_KEY ||
2069 node->type == BTRFS_SHARED_DATA_REF_KEY)
2070 ret = run_delayed_data_ref(trans, root, node, extent_op,
2077 static noinline struct btrfs_delayed_ref_node *
2078 select_delayed_ref(struct btrfs_delayed_ref_head *head)
2080 struct rb_node *node;
2081 struct btrfs_delayed_ref_node *ref;
2082 int action = BTRFS_ADD_DELAYED_REF;
2085 * select delayed ref of type BTRFS_ADD_DELAYED_REF first.
2086 * this prevents ref count from going down to zero when
2087 * there still are pending delayed ref.
2089 node = rb_prev(&head->node.rb_node);
2093 ref = rb_entry(node, struct btrfs_delayed_ref_node,
2095 if (ref->bytenr != head->node.bytenr)
2097 if (ref->action == action)
2099 node = rb_prev(node);
2101 if (action == BTRFS_ADD_DELAYED_REF) {
2102 action = BTRFS_DROP_DELAYED_REF;
2108 static noinline int run_clustered_refs(struct btrfs_trans_handle *trans,
2109 struct btrfs_root *root,
2110 struct list_head *cluster)
2112 struct btrfs_delayed_ref_root *delayed_refs;
2113 struct btrfs_delayed_ref_node *ref;
2114 struct btrfs_delayed_ref_head *locked_ref = NULL;
2115 struct btrfs_delayed_extent_op *extent_op;
2118 int must_insert_reserved = 0;
2120 delayed_refs = &trans->transaction->delayed_refs;
2123 /* pick a new head ref from the cluster list */
2124 if (list_empty(cluster))
2127 locked_ref = list_entry(cluster->next,
2128 struct btrfs_delayed_ref_head, cluster);
2130 /* grab the lock that says we are going to process
2131 * all the refs for this head */
2132 ret = btrfs_delayed_ref_lock(trans, locked_ref);
2135 * we may have dropped the spin lock to get the head
2136 * mutex lock, and that might have given someone else
2137 * time to free the head. If that's true, it has been
2138 * removed from our list and we can move on.
2140 if (ret == -EAGAIN) {
2148 * record the must insert reserved flag before we
2149 * drop the spin lock.
2151 must_insert_reserved = locked_ref->must_insert_reserved;
2152 locked_ref->must_insert_reserved = 0;
2154 extent_op = locked_ref->extent_op;
2155 locked_ref->extent_op = NULL;
2158 * locked_ref is the head node, so we have to go one
2159 * node back for any delayed ref updates
2161 ref = select_delayed_ref(locked_ref);
2163 /* All delayed refs have been processed, Go ahead
2164 * and send the head node to run_one_delayed_ref,
2165 * so that any accounting fixes can happen
2167 ref = &locked_ref->node;
2169 if (extent_op && must_insert_reserved) {
2175 spin_unlock(&delayed_refs->lock);
2177 ret = run_delayed_extent_op(trans, root,
2183 spin_lock(&delayed_refs->lock);
2187 list_del_init(&locked_ref->cluster);
2192 rb_erase(&ref->rb_node, &delayed_refs->root);
2193 delayed_refs->num_entries--;
2195 spin_unlock(&delayed_refs->lock);
2197 ret = run_one_delayed_ref(trans, root, ref, extent_op,
2198 must_insert_reserved);
2201 btrfs_put_delayed_ref(ref);
2206 spin_lock(&delayed_refs->lock);
2212 * this starts processing the delayed reference count updates and
2213 * extent insertions we have queued up so far. count can be
2214 * 0, which means to process everything in the tree at the start
2215 * of the run (but not newly added entries), or it can be some target
2216 * number you'd like to process.
2218 int btrfs_run_delayed_refs(struct btrfs_trans_handle *trans,
2219 struct btrfs_root *root, unsigned long count)
2221 struct rb_node *node;
2222 struct btrfs_delayed_ref_root *delayed_refs;
2223 struct btrfs_delayed_ref_node *ref;
2224 struct list_head cluster;
2226 int run_all = count == (unsigned long)-1;
2229 if (root == root->fs_info->extent_root)
2230 root = root->fs_info->tree_root;
2232 delayed_refs = &trans->transaction->delayed_refs;
2233 INIT_LIST_HEAD(&cluster);
2235 spin_lock(&delayed_refs->lock);
2237 count = delayed_refs->num_entries * 2;
2241 if (!(run_all || run_most) &&
2242 delayed_refs->num_heads_ready < 64)
2246 * go find something we can process in the rbtree. We start at
2247 * the beginning of the tree, and then build a cluster
2248 * of refs to process starting at the first one we are able to
2251 ret = btrfs_find_ref_cluster(trans, &cluster,
2252 delayed_refs->run_delayed_start);
2256 ret = run_clustered_refs(trans, root, &cluster);
2259 count -= min_t(unsigned long, ret, count);
2266 node = rb_first(&delayed_refs->root);
2269 count = (unsigned long)-1;
2272 ref = rb_entry(node, struct btrfs_delayed_ref_node,
2274 if (btrfs_delayed_ref_is_head(ref)) {
2275 struct btrfs_delayed_ref_head *head;
2277 head = btrfs_delayed_node_to_head(ref);
2278 atomic_inc(&ref->refs);
2280 spin_unlock(&delayed_refs->lock);
2281 mutex_lock(&head->mutex);
2282 mutex_unlock(&head->mutex);
2284 btrfs_put_delayed_ref(ref);
2288 node = rb_next(node);
2290 spin_unlock(&delayed_refs->lock);
2291 schedule_timeout(1);
2295 spin_unlock(&delayed_refs->lock);
2299 int btrfs_set_disk_extent_flags(struct btrfs_trans_handle *trans,
2300 struct btrfs_root *root,
2301 u64 bytenr, u64 num_bytes, u64 flags,
2304 struct btrfs_delayed_extent_op *extent_op;
2307 extent_op = kmalloc(sizeof(*extent_op), GFP_NOFS);
2311 extent_op->flags_to_set = flags;
2312 extent_op->update_flags = 1;
2313 extent_op->update_key = 0;
2314 extent_op->is_data = is_data ? 1 : 0;
2316 ret = btrfs_add_delayed_extent_op(trans, bytenr, num_bytes, extent_op);
2322 static noinline int check_delayed_ref(struct btrfs_trans_handle *trans,
2323 struct btrfs_root *root,
2324 struct btrfs_path *path,
2325 u64 objectid, u64 offset, u64 bytenr)
2327 struct btrfs_delayed_ref_head *head;
2328 struct btrfs_delayed_ref_node *ref;
2329 struct btrfs_delayed_data_ref *data_ref;
2330 struct btrfs_delayed_ref_root *delayed_refs;
2331 struct rb_node *node;
2335 delayed_refs = &trans->transaction->delayed_refs;
2336 spin_lock(&delayed_refs->lock);
2337 head = btrfs_find_delayed_ref_head(trans, bytenr);
2341 if (!mutex_trylock(&head->mutex)) {
2342 atomic_inc(&head->node.refs);
2343 spin_unlock(&delayed_refs->lock);
2345 btrfs_release_path(root->fs_info->extent_root, path);
2347 mutex_lock(&head->mutex);
2348 mutex_unlock(&head->mutex);
2349 btrfs_put_delayed_ref(&head->node);
2353 node = rb_prev(&head->node.rb_node);
2357 ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
2359 if (ref->bytenr != bytenr)
2363 if (ref->type != BTRFS_EXTENT_DATA_REF_KEY)
2366 data_ref = btrfs_delayed_node_to_data_ref(ref);
2368 node = rb_prev(node);
2370 ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
2371 if (ref->bytenr == bytenr)
2375 if (data_ref->root != root->root_key.objectid ||
2376 data_ref->objectid != objectid || data_ref->offset != offset)
2381 mutex_unlock(&head->mutex);
2383 spin_unlock(&delayed_refs->lock);
2387 static noinline int check_committed_ref(struct btrfs_trans_handle *trans,
2388 struct btrfs_root *root,
2389 struct btrfs_path *path,
2390 u64 objectid, u64 offset, u64 bytenr)
2392 struct btrfs_root *extent_root = root->fs_info->extent_root;
2393 struct extent_buffer *leaf;
2394 struct btrfs_extent_data_ref *ref;
2395 struct btrfs_extent_inline_ref *iref;
2396 struct btrfs_extent_item *ei;
2397 struct btrfs_key key;
2401 key.objectid = bytenr;
2402 key.offset = (u64)-1;
2403 key.type = BTRFS_EXTENT_ITEM_KEY;
2405 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
2411 if (path->slots[0] == 0)
2415 leaf = path->nodes[0];
2416 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2418 if (key.objectid != bytenr || key.type != BTRFS_EXTENT_ITEM_KEY)
2422 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
2423 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2424 if (item_size < sizeof(*ei)) {
2425 WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0));
2429 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
2431 if (item_size != sizeof(*ei) +
2432 btrfs_extent_inline_ref_size(BTRFS_EXTENT_DATA_REF_KEY))
2435 if (btrfs_extent_generation(leaf, ei) <=
2436 btrfs_root_last_snapshot(&root->root_item))
2439 iref = (struct btrfs_extent_inline_ref *)(ei + 1);
2440 if (btrfs_extent_inline_ref_type(leaf, iref) !=
2441 BTRFS_EXTENT_DATA_REF_KEY)
2444 ref = (struct btrfs_extent_data_ref *)(&iref->offset);
2445 if (btrfs_extent_refs(leaf, ei) !=
2446 btrfs_extent_data_ref_count(leaf, ref) ||
2447 btrfs_extent_data_ref_root(leaf, ref) !=
2448 root->root_key.objectid ||
2449 btrfs_extent_data_ref_objectid(leaf, ref) != objectid ||
2450 btrfs_extent_data_ref_offset(leaf, ref) != offset)
2458 int btrfs_cross_ref_exist(struct btrfs_trans_handle *trans,
2459 struct btrfs_root *root,
2460 u64 objectid, u64 offset, u64 bytenr)
2462 struct btrfs_path *path;
2466 path = btrfs_alloc_path();
2471 ret = check_committed_ref(trans, root, path, objectid,
2473 if (ret && ret != -ENOENT)
2476 ret2 = check_delayed_ref(trans, root, path, objectid,
2478 } while (ret2 == -EAGAIN);
2480 if (ret2 && ret2 != -ENOENT) {
2485 if (ret != -ENOENT || ret2 != -ENOENT)
2488 btrfs_free_path(path);
2489 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
2495 int btrfs_cache_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2496 struct extent_buffer *buf, u32 nr_extents)
2498 struct btrfs_key key;
2499 struct btrfs_file_extent_item *fi;
2507 if (!root->ref_cows)
2510 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) {
2512 root_gen = root->root_key.offset;
2515 root_gen = trans->transid - 1;
2518 level = btrfs_header_level(buf);
2519 nritems = btrfs_header_nritems(buf);
2522 struct btrfs_leaf_ref *ref;
2523 struct btrfs_extent_info *info;
2525 ref = btrfs_alloc_leaf_ref(root, nr_extents);
2531 ref->root_gen = root_gen;
2532 ref->bytenr = buf->start;
2533 ref->owner = btrfs_header_owner(buf);
2534 ref->generation = btrfs_header_generation(buf);
2535 ref->nritems = nr_extents;
2536 info = ref->extents;
2538 for (i = 0; nr_extents > 0 && i < nritems; i++) {
2540 btrfs_item_key_to_cpu(buf, &key, i);
2541 if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY)
2543 fi = btrfs_item_ptr(buf, i,
2544 struct btrfs_file_extent_item);
2545 if (btrfs_file_extent_type(buf, fi) ==
2546 BTRFS_FILE_EXTENT_INLINE)
2548 disk_bytenr = btrfs_file_extent_disk_bytenr(buf, fi);
2549 if (disk_bytenr == 0)
2552 info->bytenr = disk_bytenr;
2554 btrfs_file_extent_disk_num_bytes(buf, fi);
2555 info->objectid = key.objectid;
2556 info->offset = key.offset;
2560 ret = btrfs_add_leaf_ref(root, ref, shared);
2561 if (ret == -EEXIST && shared) {
2562 struct btrfs_leaf_ref *old;
2563 old = btrfs_lookup_leaf_ref(root, ref->bytenr);
2565 btrfs_remove_leaf_ref(root, old);
2566 btrfs_free_leaf_ref(root, old);
2567 ret = btrfs_add_leaf_ref(root, ref, shared);
2570 btrfs_free_leaf_ref(root, ref);
2576 /* when a block goes through cow, we update the reference counts of
2577 * everything that block points to. The internal pointers of the block
2578 * can be in just about any order, and it is likely to have clusters of
2579 * things that are close together and clusters of things that are not.
2581 * To help reduce the seeks that come with updating all of these reference
2582 * counts, sort them by byte number before actual updates are done.
2584 * struct refsort is used to match byte number to slot in the btree block.
2585 * we sort based on the byte number and then use the slot to actually
2588 * struct refsort is smaller than strcut btrfs_item and smaller than
2589 * struct btrfs_key_ptr. Since we're currently limited to the page size
2590 * for a btree block, there's no way for a kmalloc of refsorts for a
2591 * single node to be bigger than a page.
2599 * for passing into sort()
2601 static int refsort_cmp(const void *a_void, const void *b_void)
2603 const struct refsort *a = a_void;
2604 const struct refsort *b = b_void;
2606 if (a->bytenr < b->bytenr)
2608 if (a->bytenr > b->bytenr)
2614 static int __btrfs_mod_ref(struct btrfs_trans_handle *trans,
2615 struct btrfs_root *root,
2616 struct extent_buffer *buf,
2617 int full_backref, int inc)
2624 struct btrfs_key key;
2625 struct btrfs_file_extent_item *fi;
2629 int (*process_func)(struct btrfs_trans_handle *, struct btrfs_root *,
2630 u64, u64, u64, u64, u64, u64);
2632 ref_root = btrfs_header_owner(buf);
2633 nritems = btrfs_header_nritems(buf);
2634 level = btrfs_header_level(buf);
2636 if (!root->ref_cows && level == 0)
2640 process_func = btrfs_inc_extent_ref;
2642 process_func = btrfs_free_extent;
2645 parent = buf->start;
2649 for (i = 0; i < nritems; i++) {
2651 btrfs_item_key_to_cpu(buf, &key, i);
2652 if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY)
2654 fi = btrfs_item_ptr(buf, i,
2655 struct btrfs_file_extent_item);
2656 if (btrfs_file_extent_type(buf, fi) ==
2657 BTRFS_FILE_EXTENT_INLINE)
2659 bytenr = btrfs_file_extent_disk_bytenr(buf, fi);
2663 num_bytes = btrfs_file_extent_disk_num_bytes(buf, fi);
2664 key.offset -= btrfs_file_extent_offset(buf, fi);
2665 ret = process_func(trans, root, bytenr, num_bytes,
2666 parent, ref_root, key.objectid,
2671 bytenr = btrfs_node_blockptr(buf, i);
2672 num_bytes = btrfs_level_size(root, level - 1);
2673 ret = process_func(trans, root, bytenr, num_bytes,
2674 parent, ref_root, level - 1, 0);
2685 int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2686 struct extent_buffer *buf, int full_backref)
2688 return __btrfs_mod_ref(trans, root, buf, full_backref, 1);
2691 int btrfs_dec_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2692 struct extent_buffer *buf, int full_backref)
2694 return __btrfs_mod_ref(trans, root, buf, full_backref, 0);
2697 static int write_one_cache_group(struct btrfs_trans_handle *trans,
2698 struct btrfs_root *root,
2699 struct btrfs_path *path,
2700 struct btrfs_block_group_cache *cache)
2703 struct btrfs_root *extent_root = root->fs_info->extent_root;
2705 struct extent_buffer *leaf;
2707 ret = btrfs_search_slot(trans, extent_root, &cache->key, path, 0, 1);
2712 leaf = path->nodes[0];
2713 bi = btrfs_item_ptr_offset(leaf, path->slots[0]);
2714 write_extent_buffer(leaf, &cache->item, bi, sizeof(cache->item));
2715 btrfs_mark_buffer_dirty(leaf);
2716 btrfs_release_path(extent_root, path);
2724 static struct btrfs_block_group_cache *
2725 next_block_group(struct btrfs_root *root,
2726 struct btrfs_block_group_cache *cache)
2728 struct rb_node *node;
2729 spin_lock(&root->fs_info->block_group_cache_lock);
2730 node = rb_next(&cache->cache_node);
2731 btrfs_put_block_group(cache);
2733 cache = rb_entry(node, struct btrfs_block_group_cache,
2735 btrfs_get_block_group(cache);
2738 spin_unlock(&root->fs_info->block_group_cache_lock);
2742 static int cache_save_setup(struct btrfs_block_group_cache *block_group,
2743 struct btrfs_trans_handle *trans,
2744 struct btrfs_path *path)
2746 struct btrfs_root *root = block_group->fs_info->tree_root;
2747 struct inode *inode = NULL;
2749 int dcs = BTRFS_DC_ERROR;
2755 * If this block group is smaller than 100 megs don't bother caching the
2758 if (block_group->key.offset < (100 * 1024 * 1024)) {
2759 spin_lock(&block_group->lock);
2760 block_group->disk_cache_state = BTRFS_DC_WRITTEN;
2761 spin_unlock(&block_group->lock);
2766 inode = lookup_free_space_inode(root, block_group, path);
2767 if (IS_ERR(inode) && PTR_ERR(inode) != -ENOENT) {
2768 ret = PTR_ERR(inode);
2769 btrfs_release_path(root, path);
2773 if (IS_ERR(inode)) {
2777 if (block_group->ro)
2780 ret = create_free_space_inode(root, trans, block_group, path);
2787 * We want to set the generation to 0, that way if anything goes wrong
2788 * from here on out we know not to trust this cache when we load up next
2791 BTRFS_I(inode)->generation = 0;
2792 ret = btrfs_update_inode(trans, root, inode);
2795 if (i_size_read(inode) > 0) {
2796 ret = btrfs_truncate_free_space_cache(root, trans, path,
2802 spin_lock(&block_group->lock);
2803 if (block_group->cached != BTRFS_CACHE_FINISHED) {
2804 /* We're not cached, don't bother trying to write stuff out */
2805 dcs = BTRFS_DC_WRITTEN;
2806 spin_unlock(&block_group->lock);
2809 spin_unlock(&block_group->lock);
2811 num_pages = (int)div64_u64(block_group->key.offset, 1024 * 1024 * 1024);
2816 * Just to make absolutely sure we have enough space, we're going to
2817 * preallocate 12 pages worth of space for each block group. In
2818 * practice we ought to use at most 8, but we need extra space so we can
2819 * add our header and have a terminator between the extents and the
2823 num_pages *= PAGE_CACHE_SIZE;
2825 ret = btrfs_check_data_free_space(inode, num_pages);
2829 ret = btrfs_prealloc_file_range_trans(inode, trans, 0, 0, num_pages,
2830 num_pages, num_pages,
2833 dcs = BTRFS_DC_SETUP;
2834 btrfs_free_reserved_data_space(inode, num_pages);
2838 btrfs_release_path(root, path);
2840 spin_lock(&block_group->lock);
2841 block_group->disk_cache_state = dcs;
2842 spin_unlock(&block_group->lock);
2847 int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans,
2848 struct btrfs_root *root)
2850 struct btrfs_block_group_cache *cache;
2852 struct btrfs_path *path;
2855 path = btrfs_alloc_path();
2861 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2863 if (cache->disk_cache_state == BTRFS_DC_CLEAR)
2865 cache = next_block_group(root, cache);
2873 err = cache_save_setup(cache, trans, path);
2874 last = cache->key.objectid + cache->key.offset;
2875 btrfs_put_block_group(cache);
2880 err = btrfs_run_delayed_refs(trans, root,
2885 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2887 if (cache->disk_cache_state == BTRFS_DC_CLEAR) {
2888 btrfs_put_block_group(cache);
2894 cache = next_block_group(root, cache);
2903 if (cache->disk_cache_state == BTRFS_DC_SETUP)
2904 cache->disk_cache_state = BTRFS_DC_NEED_WRITE;
2906 last = cache->key.objectid + cache->key.offset;
2908 err = write_one_cache_group(trans, root, path, cache);
2910 btrfs_put_block_group(cache);
2915 * I don't think this is needed since we're just marking our
2916 * preallocated extent as written, but just in case it can't
2920 err = btrfs_run_delayed_refs(trans, root,
2925 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2928 * Really this shouldn't happen, but it could if we
2929 * couldn't write the entire preallocated extent and
2930 * splitting the extent resulted in a new block.
2933 btrfs_put_block_group(cache);
2936 if (cache->disk_cache_state == BTRFS_DC_NEED_WRITE)
2938 cache = next_block_group(root, cache);
2947 btrfs_write_out_cache(root, trans, cache, path);
2950 * If we didn't have an error then the cache state is still
2951 * NEED_WRITE, so we can set it to WRITTEN.
2953 if (cache->disk_cache_state == BTRFS_DC_NEED_WRITE)
2954 cache->disk_cache_state = BTRFS_DC_WRITTEN;
2955 last = cache->key.objectid + cache->key.offset;
2956 btrfs_put_block_group(cache);
2959 btrfs_free_path(path);
2963 int btrfs_extent_readonly(struct btrfs_root *root, u64 bytenr)
2965 struct btrfs_block_group_cache *block_group;
2968 block_group = btrfs_lookup_block_group(root->fs_info, bytenr);
2969 if (!block_group || block_group->ro)
2972 btrfs_put_block_group(block_group);
2976 static int update_space_info(struct btrfs_fs_info *info, u64 flags,
2977 u64 total_bytes, u64 bytes_used,
2978 struct btrfs_space_info **space_info)
2980 struct btrfs_space_info *found;
2984 if (flags & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1 |
2985 BTRFS_BLOCK_GROUP_RAID10))
2990 found = __find_space_info(info, flags);
2992 spin_lock(&found->lock);
2993 found->total_bytes += total_bytes;
2994 found->disk_total += total_bytes * factor;
2995 found->bytes_used += bytes_used;
2996 found->disk_used += bytes_used * factor;
2998 spin_unlock(&found->lock);
2999 *space_info = found;
3002 found = kzalloc(sizeof(*found), GFP_NOFS);
3006 for (i = 0; i < BTRFS_NR_RAID_TYPES; i++)
3007 INIT_LIST_HEAD(&found->block_groups[i]);
3008 init_rwsem(&found->groups_sem);
3009 spin_lock_init(&found->lock);
3010 found->flags = flags & (BTRFS_BLOCK_GROUP_DATA |
3011 BTRFS_BLOCK_GROUP_SYSTEM |
3012 BTRFS_BLOCK_GROUP_METADATA);
3013 found->total_bytes = total_bytes;
3014 found->disk_total = total_bytes * factor;
3015 found->bytes_used = bytes_used;
3016 found->disk_used = bytes_used * factor;
3017 found->bytes_pinned = 0;
3018 found->bytes_reserved = 0;
3019 found->bytes_readonly = 0;
3020 found->bytes_may_use = 0;
3022 found->force_alloc = 0;
3023 *space_info = found;
3024 list_add_rcu(&found->list, &info->space_info);
3025 atomic_set(&found->caching_threads, 0);
3029 static void set_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags)
3031 u64 extra_flags = flags & (BTRFS_BLOCK_GROUP_RAID0 |
3032 BTRFS_BLOCK_GROUP_RAID1 |
3033 BTRFS_BLOCK_GROUP_RAID10 |
3034 BTRFS_BLOCK_GROUP_DUP);
3036 if (flags & BTRFS_BLOCK_GROUP_DATA)
3037 fs_info->avail_data_alloc_bits |= extra_flags;
3038 if (flags & BTRFS_BLOCK_GROUP_METADATA)
3039 fs_info->avail_metadata_alloc_bits |= extra_flags;
3040 if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
3041 fs_info->avail_system_alloc_bits |= extra_flags;
3045 u64 btrfs_reduce_alloc_profile(struct btrfs_root *root, u64 flags)
3047 u64 num_devices = root->fs_info->fs_devices->rw_devices;
3049 if (num_devices == 1)
3050 flags &= ~(BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID0);
3051 if (num_devices < 4)
3052 flags &= ~BTRFS_BLOCK_GROUP_RAID10;
3054 if ((flags & BTRFS_BLOCK_GROUP_DUP) &&
3055 (flags & (BTRFS_BLOCK_GROUP_RAID1 |
3056 BTRFS_BLOCK_GROUP_RAID10))) {
3057 flags &= ~BTRFS_BLOCK_GROUP_DUP;
3060 if ((flags & BTRFS_BLOCK_GROUP_RAID1) &&
3061 (flags & BTRFS_BLOCK_GROUP_RAID10)) {
3062 flags &= ~BTRFS_BLOCK_GROUP_RAID1;
3065 if ((flags & BTRFS_BLOCK_GROUP_RAID0) &&
3066 ((flags & BTRFS_BLOCK_GROUP_RAID1) |
3067 (flags & BTRFS_BLOCK_GROUP_RAID10) |
3068 (flags & BTRFS_BLOCK_GROUP_DUP)))
3069 flags &= ~BTRFS_BLOCK_GROUP_RAID0;
3073 static u64 get_alloc_profile(struct btrfs_root *root, u64 flags)
3075 if (flags & BTRFS_BLOCK_GROUP_DATA)
3076 flags |= root->fs_info->avail_data_alloc_bits &
3077 root->fs_info->data_alloc_profile;
3078 else if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
3079 flags |= root->fs_info->avail_system_alloc_bits &
3080 root->fs_info->system_alloc_profile;
3081 else if (flags & BTRFS_BLOCK_GROUP_METADATA)
3082 flags |= root->fs_info->avail_metadata_alloc_bits &
3083 root->fs_info->metadata_alloc_profile;
3084 return btrfs_reduce_alloc_profile(root, flags);
3087 static u64 btrfs_get_alloc_profile(struct btrfs_root *root, int data)
3092 flags = BTRFS_BLOCK_GROUP_DATA;
3093 else if (root == root->fs_info->chunk_root)
3094 flags = BTRFS_BLOCK_GROUP_SYSTEM;
3096 flags = BTRFS_BLOCK_GROUP_METADATA;
3098 return get_alloc_profile(root, flags);
3101 void btrfs_set_inode_space_info(struct btrfs_root *root, struct inode *inode)
3103 BTRFS_I(inode)->space_info = __find_space_info(root->fs_info,
3104 BTRFS_BLOCK_GROUP_DATA);
3108 * This will check the space that the inode allocates from to make sure we have
3109 * enough space for bytes.
3111 int btrfs_check_data_free_space(struct inode *inode, u64 bytes)
3113 struct btrfs_space_info *data_sinfo;
3114 struct btrfs_root *root = BTRFS_I(inode)->root;
3116 int ret = 0, committed = 0, alloc_chunk = 1;
3118 /* make sure bytes are sectorsize aligned */
3119 bytes = (bytes + root->sectorsize - 1) & ~((u64)root->sectorsize - 1);
3121 if (root == root->fs_info->tree_root) {
3126 data_sinfo = BTRFS_I(inode)->space_info;
3131 /* make sure we have enough space to handle the data first */
3132 spin_lock(&data_sinfo->lock);
3133 used = data_sinfo->bytes_used + data_sinfo->bytes_reserved +
3134 data_sinfo->bytes_pinned + data_sinfo->bytes_readonly +
3135 data_sinfo->bytes_may_use;
3137 if (used + bytes > data_sinfo->total_bytes) {
3138 struct btrfs_trans_handle *trans;
3141 * if we don't have enough free bytes in this space then we need
3142 * to alloc a new chunk.
3144 if (!data_sinfo->full && alloc_chunk) {
3147 data_sinfo->force_alloc = 1;
3148 spin_unlock(&data_sinfo->lock);
3150 alloc_target = btrfs_get_alloc_profile(root, 1);
3151 trans = btrfs_join_transaction(root, 1);
3153 return PTR_ERR(trans);
3155 ret = do_chunk_alloc(trans, root->fs_info->extent_root,
3156 bytes + 2 * 1024 * 1024,
3158 btrfs_end_transaction(trans, root);
3163 btrfs_set_inode_space_info(root, inode);
3164 data_sinfo = BTRFS_I(inode)->space_info;
3168 spin_unlock(&data_sinfo->lock);
3170 /* commit the current transaction and try again */
3171 if (!committed && !root->fs_info->open_ioctl_trans) {
3173 trans = btrfs_join_transaction(root, 1);
3175 return PTR_ERR(trans);
3176 ret = btrfs_commit_transaction(trans, root);
3182 #if 0 /* I hope we never need this code again, just in case */
3183 printk(KERN_ERR "no space left, need %llu, %llu bytes_used, "
3184 "%llu bytes_reserved, " "%llu bytes_pinned, "
3185 "%llu bytes_readonly, %llu may use %llu total\n",
3186 (unsigned long long)bytes,
3187 (unsigned long long)data_sinfo->bytes_used,
3188 (unsigned long long)data_sinfo->bytes_reserved,
3189 (unsigned long long)data_sinfo->bytes_pinned,
3190 (unsigned long long)data_sinfo->bytes_readonly,
3191 (unsigned long long)data_sinfo->bytes_may_use,
3192 (unsigned long long)data_sinfo->total_bytes);
3196 data_sinfo->bytes_may_use += bytes;
3197 BTRFS_I(inode)->reserved_bytes += bytes;
3198 spin_unlock(&data_sinfo->lock);
3204 * called when we are clearing an delalloc extent from the
3205 * inode's io_tree or there was an error for whatever reason
3206 * after calling btrfs_check_data_free_space
3208 void btrfs_free_reserved_data_space(struct inode *inode, u64 bytes)
3210 struct btrfs_root *root = BTRFS_I(inode)->root;
3211 struct btrfs_space_info *data_sinfo;
3213 /* make sure bytes are sectorsize aligned */
3214 bytes = (bytes + root->sectorsize - 1) & ~((u64)root->sectorsize - 1);
3216 data_sinfo = BTRFS_I(inode)->space_info;
3217 spin_lock(&data_sinfo->lock);
3218 data_sinfo->bytes_may_use -= bytes;
3219 BTRFS_I(inode)->reserved_bytes -= bytes;
3220 spin_unlock(&data_sinfo->lock);
3223 static void force_metadata_allocation(struct btrfs_fs_info *info)
3225 struct list_head *head = &info->space_info;
3226 struct btrfs_space_info *found;
3229 list_for_each_entry_rcu(found, head, list) {
3230 if (found->flags & BTRFS_BLOCK_GROUP_METADATA)
3231 found->force_alloc = 1;
3236 static int should_alloc_chunk(struct btrfs_root *root,
3237 struct btrfs_space_info *sinfo, u64 alloc_bytes)
3239 u64 num_bytes = sinfo->total_bytes - sinfo->bytes_readonly;
3242 if (sinfo->bytes_used + sinfo->bytes_reserved +
3243 alloc_bytes + 256 * 1024 * 1024 < num_bytes)
3246 if (sinfo->bytes_used + sinfo->bytes_reserved +
3247 alloc_bytes < div_factor(num_bytes, 8))
3250 thresh = btrfs_super_total_bytes(&root->fs_info->super_copy);
3251 thresh = max_t(u64, 256 * 1024 * 1024, div_factor_fine(thresh, 5));
3253 if (num_bytes > thresh && sinfo->bytes_used < div_factor(num_bytes, 3))
3259 static int do_chunk_alloc(struct btrfs_trans_handle *trans,
3260 struct btrfs_root *extent_root, u64 alloc_bytes,
3261 u64 flags, int force)
3263 struct btrfs_space_info *space_info;
3264 struct btrfs_fs_info *fs_info = extent_root->fs_info;
3267 mutex_lock(&fs_info->chunk_mutex);
3269 flags = btrfs_reduce_alloc_profile(extent_root, flags);
3271 space_info = __find_space_info(extent_root->fs_info, flags);
3273 ret = update_space_info(extent_root->fs_info, flags,
3277 BUG_ON(!space_info);
3279 spin_lock(&space_info->lock);
3280 if (space_info->force_alloc)
3282 if (space_info->full) {
3283 spin_unlock(&space_info->lock);
3287 if (!force && !should_alloc_chunk(extent_root, space_info,
3289 spin_unlock(&space_info->lock);
3292 spin_unlock(&space_info->lock);
3295 * If we have mixed data/metadata chunks we want to make sure we keep
3296 * allocating mixed chunks instead of individual chunks.
3298 if (btrfs_mixed_space_info(space_info))
3299 flags |= (BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA);
3302 * if we're doing a data chunk, go ahead and make sure that
3303 * we keep a reasonable number of metadata chunks allocated in the
3306 if (flags & BTRFS_BLOCK_GROUP_DATA && fs_info->metadata_ratio) {
3307 fs_info->data_chunk_allocations++;
3308 if (!(fs_info->data_chunk_allocations %
3309 fs_info->metadata_ratio))
3310 force_metadata_allocation(fs_info);
3313 ret = btrfs_alloc_chunk(trans, extent_root, flags);
3314 spin_lock(&space_info->lock);
3316 space_info->full = 1;
3319 space_info->force_alloc = 0;
3320 spin_unlock(&space_info->lock);
3322 mutex_unlock(&extent_root->fs_info->chunk_mutex);
3327 * shrink metadata reservation for delalloc
3329 static int shrink_delalloc(struct btrfs_trans_handle *trans,
3330 struct btrfs_root *root, u64 to_reclaim, int sync)
3332 struct btrfs_block_rsv *block_rsv;
3333 struct btrfs_space_info *space_info;
3338 int nr_pages = (2 * 1024 * 1024) >> PAGE_CACHE_SHIFT;
3340 block_rsv = &root->fs_info->delalloc_block_rsv;
3341 space_info = block_rsv->space_info;
3344 reserved = space_info->bytes_reserved;
3349 max_reclaim = min(reserved, to_reclaim);
3352 /* have the flusher threads jump in and do some IO */
3354 nr_pages = min_t(unsigned long, nr_pages,
3355 root->fs_info->delalloc_bytes >> PAGE_CACHE_SHIFT);
3356 writeback_inodes_sb_nr_if_idle(root->fs_info->sb, nr_pages);
3358 spin_lock(&space_info->lock);
3359 if (reserved > space_info->bytes_reserved)
3360 reclaimed += reserved - space_info->bytes_reserved;
3361 reserved = space_info->bytes_reserved;
3362 spin_unlock(&space_info->lock);
3364 if (reserved == 0 || reclaimed >= max_reclaim)
3367 if (trans && trans->transaction->blocked)
3370 __set_current_state(TASK_INTERRUPTIBLE);
3371 schedule_timeout(pause);
3373 if (pause > HZ / 10)
3377 return reclaimed >= to_reclaim;
3381 * Retries tells us how many times we've called reserve_metadata_bytes. The
3382 * idea is if this is the first call (retries == 0) then we will add to our
3383 * reserved count if we can't make the allocation in order to hold our place
3384 * while we go and try and free up space. That way for retries > 1 we don't try
3385 * and add space, we just check to see if the amount of unused space is >= the
3386 * total space, meaning that our reservation is valid.
3388 * However if we don't intend to retry this reservation, pass -1 as retries so
3389 * that it short circuits this logic.
3391 static int reserve_metadata_bytes(struct btrfs_trans_handle *trans,
3392 struct btrfs_root *root,
3393 struct btrfs_block_rsv *block_rsv,
3394 u64 orig_bytes, int flush)
3396 struct btrfs_space_info *space_info = block_rsv->space_info;
3398 u64 num_bytes = orig_bytes;
3401 bool reserved = false;
3402 bool committed = false;
3409 spin_lock(&space_info->lock);
3410 unused = space_info->bytes_used + space_info->bytes_reserved +
3411 space_info->bytes_pinned + space_info->bytes_readonly +
3412 space_info->bytes_may_use;
3415 * The idea here is that we've not already over-reserved the block group
3416 * then we can go ahead and save our reservation first and then start
3417 * flushing if we need to. Otherwise if we've already overcommitted
3418 * lets start flushing stuff first and then come back and try to make
3421 if (unused <= space_info->total_bytes) {
3422 unused = space_info->total_bytes - unused;
3423 if (unused >= num_bytes) {
3425 space_info->bytes_reserved += orig_bytes;
3429 * Ok set num_bytes to orig_bytes since we aren't
3430 * overocmmitted, this way we only try and reclaim what
3433 num_bytes = orig_bytes;
3437 * Ok we're over committed, set num_bytes to the overcommitted
3438 * amount plus the amount of bytes that we need for this
3441 num_bytes = unused - space_info->total_bytes +
3442 (orig_bytes * (retries + 1));
3446 * Couldn't make our reservation, save our place so while we're trying
3447 * to reclaim space we can actually use it instead of somebody else
3448 * stealing it from us.
3450 if (ret && !reserved) {
3451 space_info->bytes_reserved += orig_bytes;
3455 spin_unlock(&space_info->lock);
3464 * We do synchronous shrinking since we don't actually unreserve
3465 * metadata until after the IO is completed.
3467 ret = shrink_delalloc(trans, root, num_bytes, 1);
3474 * So if we were overcommitted it's possible that somebody else flushed
3475 * out enough space and we simply didn't have enough space to reclaim,
3476 * so go back around and try again.
3483 spin_lock(&space_info->lock);
3485 * Not enough space to be reclaimed, don't bother committing the
3488 if (space_info->bytes_pinned < orig_bytes)
3490 spin_unlock(&space_info->lock);
3495 if (trans || committed)
3499 trans = btrfs_join_transaction(root, 1);
3502 ret = btrfs_commit_transaction(trans, root);
3511 spin_lock(&space_info->lock);
3512 space_info->bytes_reserved -= orig_bytes;
3513 spin_unlock(&space_info->lock);
3519 static struct btrfs_block_rsv *get_block_rsv(struct btrfs_trans_handle *trans,
3520 struct btrfs_root *root)
3522 struct btrfs_block_rsv *block_rsv;
3524 block_rsv = trans->block_rsv;
3526 block_rsv = root->block_rsv;
3529 block_rsv = &root->fs_info->empty_block_rsv;
3534 static int block_rsv_use_bytes(struct btrfs_block_rsv *block_rsv,
3538 spin_lock(&block_rsv->lock);
3539 if (block_rsv->reserved >= num_bytes) {
3540 block_rsv->reserved -= num_bytes;
3541 if (block_rsv->reserved < block_rsv->size)
3542 block_rsv->full = 0;
3545 spin_unlock(&block_rsv->lock);
3549 static void block_rsv_add_bytes(struct btrfs_block_rsv *block_rsv,
3550 u64 num_bytes, int update_size)
3552 spin_lock(&block_rsv->lock);
3553 block_rsv->reserved += num_bytes;
3555 block_rsv->size += num_bytes;
3556 else if (block_rsv->reserved >= block_rsv->size)
3557 block_rsv->full = 1;
3558 spin_unlock(&block_rsv->lock);
3561 void block_rsv_release_bytes(struct btrfs_block_rsv *block_rsv,
3562 struct btrfs_block_rsv *dest, u64 num_bytes)
3564 struct btrfs_space_info *space_info = block_rsv->space_info;
3566 spin_lock(&block_rsv->lock);
3567 if (num_bytes == (u64)-1)
3568 num_bytes = block_rsv->size;
3569 block_rsv->size -= num_bytes;
3570 if (block_rsv->reserved >= block_rsv->size) {
3571 num_bytes = block_rsv->reserved - block_rsv->size;
3572 block_rsv->reserved = block_rsv->size;
3573 block_rsv->full = 1;
3577 spin_unlock(&block_rsv->lock);
3579 if (num_bytes > 0) {
3581 block_rsv_add_bytes(dest, num_bytes, 0);
3583 spin_lock(&space_info->lock);
3584 space_info->bytes_reserved -= num_bytes;
3585 spin_unlock(&space_info->lock);
3590 static int block_rsv_migrate_bytes(struct btrfs_block_rsv *src,
3591 struct btrfs_block_rsv *dst, u64 num_bytes)
3595 ret = block_rsv_use_bytes(src, num_bytes);
3599 block_rsv_add_bytes(dst, num_bytes, 1);
3603 void btrfs_init_block_rsv(struct btrfs_block_rsv *rsv)
3605 memset(rsv, 0, sizeof(*rsv));
3606 spin_lock_init(&rsv->lock);
3607 atomic_set(&rsv->usage, 1);
3609 INIT_LIST_HEAD(&rsv->list);
3612 struct btrfs_block_rsv *btrfs_alloc_block_rsv(struct btrfs_root *root)
3614 struct btrfs_block_rsv *block_rsv;
3615 struct btrfs_fs_info *fs_info = root->fs_info;
3617 block_rsv = kmalloc(sizeof(*block_rsv), GFP_NOFS);
3621 btrfs_init_block_rsv(block_rsv);
3622 block_rsv->space_info = __find_space_info(fs_info,
3623 BTRFS_BLOCK_GROUP_METADATA);
3627 void btrfs_free_block_rsv(struct btrfs_root *root,
3628 struct btrfs_block_rsv *rsv)
3630 if (rsv && atomic_dec_and_test(&rsv->usage)) {
3631 btrfs_block_rsv_release(root, rsv, (u64)-1);
3638 * make the block_rsv struct be able to capture freed space.
3639 * the captured space will re-add to the the block_rsv struct
3640 * after transaction commit
3642 void btrfs_add_durable_block_rsv(struct btrfs_fs_info *fs_info,
3643 struct btrfs_block_rsv *block_rsv)
3645 block_rsv->durable = 1;
3646 mutex_lock(&fs_info->durable_block_rsv_mutex);
3647 list_add_tail(&block_rsv->list, &fs_info->durable_block_rsv_list);
3648 mutex_unlock(&fs_info->durable_block_rsv_mutex);
3651 int btrfs_block_rsv_add(struct btrfs_trans_handle *trans,
3652 struct btrfs_root *root,
3653 struct btrfs_block_rsv *block_rsv,
3661 ret = reserve_metadata_bytes(trans, root, block_rsv, num_bytes, 1);
3663 block_rsv_add_bytes(block_rsv, num_bytes, 1);
3670 int btrfs_block_rsv_check(struct btrfs_trans_handle *trans,
3671 struct btrfs_root *root,
3672 struct btrfs_block_rsv *block_rsv,
3673 u64 min_reserved, int min_factor)
3676 int commit_trans = 0;
3682 spin_lock(&block_rsv->lock);
3684 num_bytes = div_factor(block_rsv->size, min_factor);
3685 if (min_reserved > num_bytes)
3686 num_bytes = min_reserved;
3688 if (block_rsv->reserved >= num_bytes) {
3691 num_bytes -= block_rsv->reserved;
3692 if (block_rsv->durable &&
3693 block_rsv->freed[0] + block_rsv->freed[1] >= num_bytes)
3696 spin_unlock(&block_rsv->lock);
3700 if (block_rsv->refill_used) {
3701 ret = reserve_metadata_bytes(trans, root, block_rsv,
3704 block_rsv_add_bytes(block_rsv, num_bytes, 0);
3713 trans = btrfs_join_transaction(root, 1);
3714 BUG_ON(IS_ERR(trans));
3715 ret = btrfs_commit_transaction(trans, root);
3720 printk(KERN_INFO"block_rsv size %llu reserved %llu freed %llu %llu\n",
3721 block_rsv->size, block_rsv->reserved,
3722 block_rsv->freed[0], block_rsv->freed[1]);
3727 int btrfs_block_rsv_migrate(struct btrfs_block_rsv *src_rsv,
3728 struct btrfs_block_rsv *dst_rsv,
3731 return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes);
3734 void btrfs_block_rsv_release(struct btrfs_root *root,
3735 struct btrfs_block_rsv *block_rsv,
3738 struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv;
3739 if (global_rsv->full || global_rsv == block_rsv ||
3740 block_rsv->space_info != global_rsv->space_info)
3742 block_rsv_release_bytes(block_rsv, global_rsv, num_bytes);
3746 * helper to calculate size of global block reservation.
3747 * the desired value is sum of space used by extent tree,
3748 * checksum tree and root tree
3750 static u64 calc_global_metadata_size(struct btrfs_fs_info *fs_info)
3752 struct btrfs_space_info *sinfo;
3756 int csum_size = btrfs_super_csum_size(&fs_info->super_copy);
3759 * per tree used space accounting can be inaccuracy, so we
3762 spin_lock(&fs_info->extent_root->accounting_lock);
3763 num_bytes = btrfs_root_used(&fs_info->extent_root->root_item);
3764 spin_unlock(&fs_info->extent_root->accounting_lock);
3766 spin_lock(&fs_info->csum_root->accounting_lock);
3767 num_bytes += btrfs_root_used(&fs_info->csum_root->root_item);
3768 spin_unlock(&fs_info->csum_root->accounting_lock);
3770 spin_lock(&fs_info->tree_root->accounting_lock);
3771 num_bytes += btrfs_root_used(&fs_info->tree_root->root_item);
3772 spin_unlock(&fs_info->tree_root->accounting_lock);
3774 sinfo = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_DATA);
3775 spin_lock(&sinfo->lock);
3776 data_used = sinfo->bytes_used;
3777 spin_unlock(&sinfo->lock);
3779 sinfo = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA);
3780 spin_lock(&sinfo->lock);
3781 if (sinfo->flags & BTRFS_BLOCK_GROUP_DATA)
3783 meta_used = sinfo->bytes_used;
3784 spin_unlock(&sinfo->lock);
3786 num_bytes = (data_used >> fs_info->sb->s_blocksize_bits) *
3788 num_bytes += div64_u64(data_used + meta_used, 50);
3790 if (num_bytes * 3 > meta_used)
3791 num_bytes = div64_u64(meta_used, 3);
3793 return ALIGN(num_bytes, fs_info->extent_root->leafsize << 10);
3796 static void update_global_block_rsv(struct btrfs_fs_info *fs_info)
3798 struct btrfs_block_rsv *block_rsv = &fs_info->global_block_rsv;
3799 struct btrfs_space_info *sinfo = block_rsv->space_info;
3802 num_bytes = calc_global_metadata_size(fs_info);
3804 spin_lock(&block_rsv->lock);
3805 spin_lock(&sinfo->lock);
3807 block_rsv->size = num_bytes;
3809 num_bytes = sinfo->bytes_used + sinfo->bytes_pinned +
3810 sinfo->bytes_reserved + sinfo->bytes_readonly +
3811 sinfo->bytes_may_use;
3813 if (sinfo->total_bytes > num_bytes) {
3814 num_bytes = sinfo->total_bytes - num_bytes;
3815 block_rsv->reserved += num_bytes;
3816 sinfo->bytes_reserved += num_bytes;
3819 if (block_rsv->reserved >= block_rsv->size) {
3820 num_bytes = block_rsv->reserved - block_rsv->size;
3821 sinfo->bytes_reserved -= num_bytes;
3822 block_rsv->reserved = block_rsv->size;
3823 block_rsv->full = 1;
3826 printk(KERN_INFO"global block rsv size %llu reserved %llu\n",
3827 block_rsv->size, block_rsv->reserved);
3829 spin_unlock(&sinfo->lock);
3830 spin_unlock(&block_rsv->lock);
3833 static void init_global_block_rsv(struct btrfs_fs_info *fs_info)
3835 struct btrfs_space_info *space_info;
3837 space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_SYSTEM);
3838 fs_info->chunk_block_rsv.space_info = space_info;
3839 fs_info->chunk_block_rsv.priority = 10;
3841 space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA);
3842 fs_info->global_block_rsv.space_info = space_info;
3843 fs_info->global_block_rsv.priority = 10;
3844 fs_info->global_block_rsv.refill_used = 1;
3845 fs_info->delalloc_block_rsv.space_info = space_info;
3846 fs_info->trans_block_rsv.space_info = space_info;
3847 fs_info->empty_block_rsv.space_info = space_info;
3848 fs_info->empty_block_rsv.priority = 10;
3850 fs_info->extent_root->block_rsv = &fs_info->global_block_rsv;
3851 fs_info->csum_root->block_rsv = &fs_info->global_block_rsv;
3852 fs_info->dev_root->block_rsv = &fs_info->global_block_rsv;
3853 fs_info->tree_root->block_rsv = &fs_info->global_block_rsv;
3854 fs_info->chunk_root->block_rsv = &fs_info->chunk_block_rsv;
3856 btrfs_add_durable_block_rsv(fs_info, &fs_info->global_block_rsv);
3858 btrfs_add_durable_block_rsv(fs_info, &fs_info->delalloc_block_rsv);
3860 update_global_block_rsv(fs_info);
3863 static void release_global_block_rsv(struct btrfs_fs_info *fs_info)
3865 block_rsv_release_bytes(&fs_info->global_block_rsv, NULL, (u64)-1);
3866 WARN_ON(fs_info->delalloc_block_rsv.size > 0);
3867 WARN_ON(fs_info->delalloc_block_rsv.reserved > 0);
3868 WARN_ON(fs_info->trans_block_rsv.size > 0);
3869 WARN_ON(fs_info->trans_block_rsv.reserved > 0);
3870 WARN_ON(fs_info->chunk_block_rsv.size > 0);
3871 WARN_ON(fs_info->chunk_block_rsv.reserved > 0);
3874 static u64 calc_trans_metadata_size(struct btrfs_root *root, int num_items)
3876 return (root->leafsize + root->nodesize * (BTRFS_MAX_LEVEL - 1)) *
3880 int btrfs_trans_reserve_metadata(struct btrfs_trans_handle *trans,
3881 struct btrfs_root *root,
3887 if (num_items == 0 || root->fs_info->chunk_root == root)
3890 num_bytes = calc_trans_metadata_size(root, num_items);
3891 ret = btrfs_block_rsv_add(trans, root, &root->fs_info->trans_block_rsv,
3894 trans->bytes_reserved += num_bytes;
3895 trans->block_rsv = &root->fs_info->trans_block_rsv;
3900 void btrfs_trans_release_metadata(struct btrfs_trans_handle *trans,
3901 struct btrfs_root *root)
3903 if (!trans->bytes_reserved)
3906 BUG_ON(trans->block_rsv != &root->fs_info->trans_block_rsv);
3907 btrfs_block_rsv_release(root, trans->block_rsv,
3908 trans->bytes_reserved);
3909 trans->bytes_reserved = 0;
3912 int btrfs_orphan_reserve_metadata(struct btrfs_trans_handle *trans,
3913 struct inode *inode)
3915 struct btrfs_root *root = BTRFS_I(inode)->root;
3916 struct btrfs_block_rsv *src_rsv = get_block_rsv(trans, root);
3917 struct btrfs_block_rsv *dst_rsv = root->orphan_block_rsv;
3920 * one for deleting orphan item, one for updating inode and
3921 * two for calling btrfs_truncate_inode_items.
3923 * btrfs_truncate_inode_items is a delete operation, it frees
3924 * more space than it uses in most cases. So two units of
3925 * metadata space should be enough for calling it many times.
3926 * If all of the metadata space is used, we can commit
3927 * transaction and use space it freed.
3929 u64 num_bytes = calc_trans_metadata_size(root, 4);
3930 return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes);
3933 void btrfs_orphan_release_metadata(struct inode *inode)
3935 struct btrfs_root *root = BTRFS_I(inode)->root;
3936 u64 num_bytes = calc_trans_metadata_size(root, 4);
3937 btrfs_block_rsv_release(root, root->orphan_block_rsv, num_bytes);
3940 int btrfs_snap_reserve_metadata(struct btrfs_trans_handle *trans,
3941 struct btrfs_pending_snapshot *pending)
3943 struct btrfs_root *root = pending->root;
3944 struct btrfs_block_rsv *src_rsv = get_block_rsv(trans, root);
3945 struct btrfs_block_rsv *dst_rsv = &pending->block_rsv;
3947 * two for root back/forward refs, two for directory entries
3948 * and one for root of the snapshot.
3950 u64 num_bytes = calc_trans_metadata_size(root, 5);
3951 dst_rsv->space_info = src_rsv->space_info;
3952 return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes);
3955 static u64 calc_csum_metadata_size(struct inode *inode, u64 num_bytes)
3957 return num_bytes >>= 3;
3960 int btrfs_delalloc_reserve_metadata(struct inode *inode, u64 num_bytes)
3962 struct btrfs_root *root = BTRFS_I(inode)->root;
3963 struct btrfs_block_rsv *block_rsv = &root->fs_info->delalloc_block_rsv;
3968 if (btrfs_transaction_in_commit(root->fs_info))
3969 schedule_timeout(1);
3971 num_bytes = ALIGN(num_bytes, root->sectorsize);
3973 spin_lock(&BTRFS_I(inode)->accounting_lock);
3974 nr_extents = atomic_read(&BTRFS_I(inode)->outstanding_extents) + 1;
3975 if (nr_extents > BTRFS_I(inode)->reserved_extents) {
3976 nr_extents -= BTRFS_I(inode)->reserved_extents;
3977 to_reserve = calc_trans_metadata_size(root, nr_extents);
3982 spin_unlock(&BTRFS_I(inode)->accounting_lock);
3984 to_reserve += calc_csum_metadata_size(inode, num_bytes);
3985 ret = reserve_metadata_bytes(NULL, root, block_rsv, to_reserve, 1);
3989 spin_lock(&BTRFS_I(inode)->accounting_lock);
3990 BTRFS_I(inode)->reserved_extents += nr_extents;
3991 atomic_inc(&BTRFS_I(inode)->outstanding_extents);
3992 spin_unlock(&BTRFS_I(inode)->accounting_lock);
3994 block_rsv_add_bytes(block_rsv, to_reserve, 1);
3996 if (block_rsv->size > 512 * 1024 * 1024)
3997 shrink_delalloc(NULL, root, to_reserve, 0);
4002 void btrfs_delalloc_release_metadata(struct inode *inode, u64 num_bytes)
4004 struct btrfs_root *root = BTRFS_I(inode)->root;
4008 num_bytes = ALIGN(num_bytes, root->sectorsize);
4009 atomic_dec(&BTRFS_I(inode)->outstanding_extents);
4011 spin_lock(&BTRFS_I(inode)->accounting_lock);
4012 nr_extents = atomic_read(&BTRFS_I(inode)->outstanding_extents);
4013 if (nr_extents < BTRFS_I(inode)->reserved_extents) {
4014 nr_extents = BTRFS_I(inode)->reserved_extents - nr_extents;
4015 BTRFS_I(inode)->reserved_extents -= nr_extents;
4019 spin_unlock(&BTRFS_I(inode)->accounting_lock);
4021 to_free = calc_csum_metadata_size(inode, num_bytes);
4023 to_free += calc_trans_metadata_size(root, nr_extents);
4025 btrfs_block_rsv_release(root, &root->fs_info->delalloc_block_rsv,
4029 int btrfs_delalloc_reserve_space(struct inode *inode, u64 num_bytes)
4033 ret = btrfs_check_data_free_space(inode, num_bytes);
4037 ret = btrfs_delalloc_reserve_metadata(inode, num_bytes);
4039 btrfs_free_reserved_data_space(inode, num_bytes);
4046 void btrfs_delalloc_release_space(struct inode *inode, u64 num_bytes)
4048 btrfs_delalloc_release_metadata(inode, num_bytes);
4049 btrfs_free_reserved_data_space(inode, num_bytes);
4052 static int update_block_group(struct btrfs_trans_handle *trans,
4053 struct btrfs_root *root,
4054 u64 bytenr, u64 num_bytes, int alloc)
4056 struct btrfs_block_group_cache *cache = NULL;
4057 struct btrfs_fs_info *info = root->fs_info;
4058 u64 total = num_bytes;
4063 /* block accounting for super block */
4064 spin_lock(&info->delalloc_lock);
4065 old_val = btrfs_super_bytes_used(&info->super_copy);
4067 old_val += num_bytes;
4069 old_val -= num_bytes;
4070 btrfs_set_super_bytes_used(&info->super_copy, old_val);
4071 spin_unlock(&info->delalloc_lock);
4074 cache = btrfs_lookup_block_group(info, bytenr);
4077 if (cache->flags & (BTRFS_BLOCK_GROUP_DUP |
4078 BTRFS_BLOCK_GROUP_RAID1 |
4079 BTRFS_BLOCK_GROUP_RAID10))
4084 * If this block group has free space cache written out, we
4085 * need to make sure to load it if we are removing space. This
4086 * is because we need the unpinning stage to actually add the
4087 * space back to the block group, otherwise we will leak space.
4089 if (!alloc && cache->cached == BTRFS_CACHE_NO)
4090 cache_block_group(cache, trans, NULL, 1);
4092 byte_in_group = bytenr - cache->key.objectid;
4093 WARN_ON(byte_in_group > cache->key.offset);
4095 spin_lock(&cache->space_info->lock);
4096 spin_lock(&cache->lock);
4098 if (btrfs_super_cache_generation(&info->super_copy) != 0 &&
4099 cache->disk_cache_state < BTRFS_DC_CLEAR)
4100 cache->disk_cache_state = BTRFS_DC_CLEAR;
4103 old_val = btrfs_block_group_used(&cache->item);
4104 num_bytes = min(total, cache->key.offset - byte_in_group);
4106 old_val += num_bytes;
4107 btrfs_set_block_group_used(&cache->item, old_val);
4108 cache->reserved -= num_bytes;
4109 cache->space_info->bytes_reserved -= num_bytes;
4110 cache->space_info->bytes_used += num_bytes;
4111 cache->space_info->disk_used += num_bytes * factor;
4112 spin_unlock(&cache->lock);
4113 spin_unlock(&cache->space_info->lock);
4115 old_val -= num_bytes;
4116 btrfs_set_block_group_used(&cache->item, old_val);
4117 cache->pinned += num_bytes;
4118 cache->space_info->bytes_pinned += num_bytes;
4119 cache->space_info->bytes_used -= num_bytes;
4120 cache->space_info->disk_used -= num_bytes * factor;
4121 spin_unlock(&cache->lock);
4122 spin_unlock(&cache->space_info->lock);
4124 set_extent_dirty(info->pinned_extents,
4125 bytenr, bytenr + num_bytes - 1,
4126 GFP_NOFS | __GFP_NOFAIL);
4128 btrfs_put_block_group(cache);
4130 bytenr += num_bytes;
4135 static u64 first_logical_byte(struct btrfs_root *root, u64 search_start)
4137 struct btrfs_block_group_cache *cache;
4140 cache = btrfs_lookup_first_block_group(root->fs_info, search_start);
4144 bytenr = cache->key.objectid;
4145 btrfs_put_block_group(cache);
4150 static int pin_down_extent(struct btrfs_root *root,
4151 struct btrfs_block_group_cache *cache,
4152 u64 bytenr, u64 num_bytes, int reserved)
4154 spin_lock(&cache->space_info->lock);
4155 spin_lock(&cache->lock);
4156 cache->pinned += num_bytes;
4157 cache->space_info->bytes_pinned += num_bytes;
4159 cache->reserved -= num_bytes;
4160 cache->space_info->bytes_reserved -= num_bytes;
4162 spin_unlock(&cache->lock);
4163 spin_unlock(&cache->space_info->lock);
4165 set_extent_dirty(root->fs_info->pinned_extents, bytenr,
4166 bytenr + num_bytes - 1, GFP_NOFS | __GFP_NOFAIL);
4171 * this function must be called within transaction
4173 int btrfs_pin_extent(struct btrfs_root *root,
4174 u64 bytenr, u64 num_bytes, int reserved)
4176 struct btrfs_block_group_cache *cache;
4178 cache = btrfs_lookup_block_group(root->fs_info, bytenr);
4181 pin_down_extent(root, cache, bytenr, num_bytes, reserved);
4183 btrfs_put_block_group(cache);
4188 * update size of reserved extents. this function may return -EAGAIN
4189 * if 'reserve' is true or 'sinfo' is false.
4191 static int update_reserved_bytes(struct btrfs_block_group_cache *cache,
4192 u64 num_bytes, int reserve, int sinfo)
4196 struct btrfs_space_info *space_info = cache->space_info;
4197 spin_lock(&space_info->lock);
4198 spin_lock(&cache->lock);
4203 cache->reserved += num_bytes;
4204 space_info->bytes_reserved += num_bytes;
4208 space_info->bytes_readonly += num_bytes;
4209 cache->reserved -= num_bytes;
4210 space_info->bytes_reserved -= num_bytes;
4212 spin_unlock(&cache->lock);
4213 spin_unlock(&space_info->lock);
4215 spin_lock(&cache->lock);
4220 cache->reserved += num_bytes;
4222 cache->reserved -= num_bytes;
4224 spin_unlock(&cache->lock);
4229 int btrfs_prepare_extent_commit(struct btrfs_trans_handle *trans,
4230 struct btrfs_root *root)
4232 struct btrfs_fs_info *fs_info = root->fs_info;
4233 struct btrfs_caching_control *next;
4234 struct btrfs_caching_control *caching_ctl;
4235 struct btrfs_block_group_cache *cache;
4237 down_write(&fs_info->extent_commit_sem);
4239 list_for_each_entry_safe(caching_ctl, next,
4240 &fs_info->caching_block_groups, list) {
4241 cache = caching_ctl->block_group;
4242 if (block_group_cache_done(cache)) {
4243 cache->last_byte_to_unpin = (u64)-1;
4244 list_del_init(&caching_ctl->list);
4245 put_caching_control(caching_ctl);
4247 cache->last_byte_to_unpin = caching_ctl->progress;
4251 if (fs_info->pinned_extents == &fs_info->freed_extents[0])
4252 fs_info->pinned_extents = &fs_info->freed_extents[1];
4254 fs_info->pinned_extents = &fs_info->freed_extents[0];
4256 up_write(&fs_info->extent_commit_sem);
4258 update_global_block_rsv(fs_info);
4262 static int unpin_extent_range(struct btrfs_root *root, u64 start, u64 end)
4264 struct btrfs_fs_info *fs_info = root->fs_info;
4265 struct btrfs_block_group_cache *cache = NULL;
4268 while (start <= end) {
4270 start >= cache->key.objectid + cache->key.offset) {
4272 btrfs_put_block_group(cache);
4273 cache = btrfs_lookup_block_group(fs_info, start);
4277 len = cache->key.objectid + cache->key.offset - start;
4278 len = min(len, end + 1 - start);
4280 if (start < cache->last_byte_to_unpin) {
4281 len = min(len, cache->last_byte_to_unpin - start);
4282 btrfs_add_free_space(cache, start, len);
4287 spin_lock(&cache->space_info->lock);
4288 spin_lock(&cache->lock);
4289 cache->pinned -= len;
4290 cache->space_info->bytes_pinned -= len;
4292 cache->space_info->bytes_readonly += len;
4293 } else if (cache->reserved_pinned > 0) {
4294 len = min(len, cache->reserved_pinned);
4295 cache->reserved_pinned -= len;
4296 cache->space_info->bytes_reserved += len;
4298 spin_unlock(&cache->lock);
4299 spin_unlock(&cache->space_info->lock);
4303 btrfs_put_block_group(cache);
4307 int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans,
4308 struct btrfs_root *root)
4310 struct btrfs_fs_info *fs_info = root->fs_info;
4311 struct extent_io_tree *unpin;
4312 struct btrfs_block_rsv *block_rsv;
4313 struct btrfs_block_rsv *next_rsv;
4319 if (fs_info->pinned_extents == &fs_info->freed_extents[0])
4320 unpin = &fs_info->freed_extents[1];
4322 unpin = &fs_info->freed_extents[0];
4325 ret = find_first_extent_bit(unpin, 0, &start, &end,
4330 ret = btrfs_discard_extent(root, start, end + 1 - start);
4332 clear_extent_dirty(unpin, start, end, GFP_NOFS);
4333 unpin_extent_range(root, start, end);
4337 mutex_lock(&fs_info->durable_block_rsv_mutex);
4338 list_for_each_entry_safe(block_rsv, next_rsv,
4339 &fs_info->durable_block_rsv_list, list) {
4341 idx = trans->transid & 0x1;
4342 if (block_rsv->freed[idx] > 0) {
4343 block_rsv_add_bytes(block_rsv,
4344 block_rsv->freed[idx], 0);
4345 block_rsv->freed[idx] = 0;
4347 if (atomic_read(&block_rsv->usage) == 0) {
4348 btrfs_block_rsv_release(root, block_rsv, (u64)-1);
4350 if (block_rsv->freed[0] == 0 &&
4351 block_rsv->freed[1] == 0) {
4352 list_del_init(&block_rsv->list);
4356 btrfs_block_rsv_release(root, block_rsv, 0);
4359 mutex_unlock(&fs_info->durable_block_rsv_mutex);
4364 static int __btrfs_free_extent(struct btrfs_trans_handle *trans,
4365 struct btrfs_root *root,
4366 u64 bytenr, u64 num_bytes, u64 parent,
4367 u64 root_objectid, u64 owner_objectid,
4368 u64 owner_offset, int refs_to_drop,
4369 struct btrfs_delayed_extent_op *extent_op)
4371 struct btrfs_key key;
4372 struct btrfs_path *path;
4373 struct btrfs_fs_info *info = root->fs_info;
4374 struct btrfs_root *extent_root = info->extent_root;
4375 struct extent_buffer *leaf;
4376 struct btrfs_extent_item *ei;
4377 struct btrfs_extent_inline_ref *iref;
4380 int extent_slot = 0;
4381 int found_extent = 0;
4386 path = btrfs_alloc_path();
4391 path->leave_spinning = 1;
4393 is_data = owner_objectid >= BTRFS_FIRST_FREE_OBJECTID;
4394 BUG_ON(!is_data && refs_to_drop != 1);
4396 ret = lookup_extent_backref(trans, extent_root, path, &iref,
4397 bytenr, num_bytes, parent,
4398 root_objectid, owner_objectid,
4401 extent_slot = path->slots[0];
4402 while (extent_slot >= 0) {
4403 btrfs_item_key_to_cpu(path->nodes[0], &key,
4405 if (key.objectid != bytenr)
4407 if (key.type == BTRFS_EXTENT_ITEM_KEY &&
4408 key.offset == num_bytes) {
4412 if (path->slots[0] - extent_slot > 5)
4416 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
4417 item_size = btrfs_item_size_nr(path->nodes[0], extent_slot);
4418 if (found_extent && item_size < sizeof(*ei))
4421 if (!found_extent) {
4423 ret = remove_extent_backref(trans, extent_root, path,
4427 btrfs_release_path(extent_root, path);
4428 path->leave_spinning = 1;
4430 key.objectid = bytenr;
4431 key.type = BTRFS_EXTENT_ITEM_KEY;
4432 key.offset = num_bytes;
4434 ret = btrfs_search_slot(trans, extent_root,
4437 printk(KERN_ERR "umm, got %d back from search"
4438 ", was looking for %llu\n", ret,
4439 (unsigned long long)bytenr);
4440 btrfs_print_leaf(extent_root, path->nodes[0]);
4443 extent_slot = path->slots[0];
4446 btrfs_print_leaf(extent_root, path->nodes[0]);
4448 printk(KERN_ERR "btrfs unable to find ref byte nr %llu "
4449 "parent %llu root %llu owner %llu offset %llu\n",
4450 (unsigned long long)bytenr,
4451 (unsigned long long)parent,
4452 (unsigned long long)root_objectid,
4453 (unsigned long long)owner_objectid,
4454 (unsigned long long)owner_offset);
4457 leaf = path->nodes[0];
4458 item_size = btrfs_item_size_nr(leaf, extent_slot);
4459 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
4460 if (item_size < sizeof(*ei)) {
4461 BUG_ON(found_extent || extent_slot != path->slots[0]);
4462 ret = convert_extent_item_v0(trans, extent_root, path,
4466 btrfs_release_path(extent_root, path);
4467 path->leave_spinning = 1;
4469 key.objectid = bytenr;
4470 key.type = BTRFS_EXTENT_ITEM_KEY;
4471 key.offset = num_bytes;
4473 ret = btrfs_search_slot(trans, extent_root, &key, path,
4476 printk(KERN_ERR "umm, got %d back from search"
4477 ", was looking for %llu\n", ret,
4478 (unsigned long long)bytenr);
4479 btrfs_print_leaf(extent_root, path->nodes[0]);
4482 extent_slot = path->slots[0];
4483 leaf = path->nodes[0];
4484 item_size = btrfs_item_size_nr(leaf, extent_slot);
4487 BUG_ON(item_size < sizeof(*ei));
4488 ei = btrfs_item_ptr(leaf, extent_slot,
4489 struct btrfs_extent_item);
4490 if (owner_objectid < BTRFS_FIRST_FREE_OBJECTID) {
4491 struct btrfs_tree_block_info *bi;
4492 BUG_ON(item_size < sizeof(*ei) + sizeof(*bi));
4493 bi = (struct btrfs_tree_block_info *)(ei + 1);
4494 WARN_ON(owner_objectid != btrfs_tree_block_level(leaf, bi));
4497 refs = btrfs_extent_refs(leaf, ei);
4498 BUG_ON(refs < refs_to_drop);
4499 refs -= refs_to_drop;
4503 __run_delayed_extent_op(extent_op, leaf, ei);
4505 * In the case of inline back ref, reference count will
4506 * be updated by remove_extent_backref
4509 BUG_ON(!found_extent);
4511 btrfs_set_extent_refs(leaf, ei, refs);
4512 btrfs_mark_buffer_dirty(leaf);
4515 ret = remove_extent_backref(trans, extent_root, path,
4522 BUG_ON(is_data && refs_to_drop !=
4523 extent_data_ref_count(root, path, iref));
4525 BUG_ON(path->slots[0] != extent_slot);
4527 BUG_ON(path->slots[0] != extent_slot + 1);
4528 path->slots[0] = extent_slot;
4533 ret = btrfs_del_items(trans, extent_root, path, path->slots[0],
4536 btrfs_release_path(extent_root, path);
4539 ret = btrfs_del_csums(trans, root, bytenr, num_bytes);
4542 invalidate_mapping_pages(info->btree_inode->i_mapping,
4543 bytenr >> PAGE_CACHE_SHIFT,
4544 (bytenr + num_bytes - 1) >> PAGE_CACHE_SHIFT);
4547 ret = update_block_group(trans, root, bytenr, num_bytes, 0);
4550 btrfs_free_path(path);
4555 * when we free an block, it is possible (and likely) that we free the last
4556 * delayed ref for that extent as well. This searches the delayed ref tree for
4557 * a given extent, and if there are no other delayed refs to be processed, it
4558 * removes it from the tree.
4560 static noinline int check_ref_cleanup(struct btrfs_trans_handle *trans,
4561 struct btrfs_root *root, u64 bytenr)
4563 struct btrfs_delayed_ref_head *head;
4564 struct btrfs_delayed_ref_root *delayed_refs;
4565 struct btrfs_delayed_ref_node *ref;
4566 struct rb_node *node;
4569 delayed_refs = &trans->transaction->delayed_refs;
4570 spin_lock(&delayed_refs->lock);
4571 head = btrfs_find_delayed_ref_head(trans, bytenr);
4575 node = rb_prev(&head->node.rb_node);
4579 ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
4581 /* there are still entries for this ref, we can't drop it */
4582 if (ref->bytenr == bytenr)
4585 if (head->extent_op) {
4586 if (!head->must_insert_reserved)
4588 kfree(head->extent_op);
4589 head->extent_op = NULL;
4593 * waiting for the lock here would deadlock. If someone else has it
4594 * locked they are already in the process of dropping it anyway
4596 if (!mutex_trylock(&head->mutex))
4600 * at this point we have a head with no other entries. Go
4601 * ahead and process it.
4603 head->node.in_tree = 0;
4604 rb_erase(&head->node.rb_node, &delayed_refs->root);
4606 delayed_refs->num_entries--;
4609 * we don't take a ref on the node because we're removing it from the
4610 * tree, so we just steal the ref the tree was holding.
4612 delayed_refs->num_heads--;
4613 if (list_empty(&head->cluster))
4614 delayed_refs->num_heads_ready--;
4616 list_del_init(&head->cluster);
4617 spin_unlock(&delayed_refs->lock);
4619 BUG_ON(head->extent_op);
4620 if (head->must_insert_reserved)
4623 mutex_unlock(&head->mutex);
4624 btrfs_put_delayed_ref(&head->node);
4627 spin_unlock(&delayed_refs->lock);
4631 void btrfs_free_tree_block(struct btrfs_trans_handle *trans,
4632 struct btrfs_root *root,
4633 struct extent_buffer *buf,
4634 u64 parent, int last_ref)
4636 struct btrfs_block_rsv *block_rsv;
4637 struct btrfs_block_group_cache *cache = NULL;
4640 if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) {
4641 ret = btrfs_add_delayed_tree_ref(trans, buf->start, buf->len,
4642 parent, root->root_key.objectid,
4643 btrfs_header_level(buf),
4644 BTRFS_DROP_DELAYED_REF, NULL);
4651 block_rsv = get_block_rsv(trans, root);
4652 cache = btrfs_lookup_block_group(root->fs_info, buf->start);
4653 if (block_rsv->space_info != cache->space_info)
4656 if (btrfs_header_generation(buf) == trans->transid) {
4657 if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) {
4658 ret = check_ref_cleanup(trans, root, buf->start);
4663 if (btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN)) {
4664 pin_down_extent(root, cache, buf->start, buf->len, 1);
4668 WARN_ON(test_bit(EXTENT_BUFFER_DIRTY, &buf->bflags));
4670 btrfs_add_free_space(cache, buf->start, buf->len);
4671 ret = update_reserved_bytes(cache, buf->len, 0, 0);
4672 if (ret == -EAGAIN) {
4673 /* block group became read-only */
4674 update_reserved_bytes(cache, buf->len, 0, 1);
4679 spin_lock(&block_rsv->lock);
4680 if (block_rsv->reserved < block_rsv->size) {
4681 block_rsv->reserved += buf->len;
4684 spin_unlock(&block_rsv->lock);
4687 spin_lock(&cache->space_info->lock);
4688 cache->space_info->bytes_reserved -= buf->len;
4689 spin_unlock(&cache->space_info->lock);
4694 if (block_rsv->durable && !cache->ro) {
4696 spin_lock(&cache->lock);
4698 cache->reserved_pinned += buf->len;
4701 spin_unlock(&cache->lock);
4704 spin_lock(&block_rsv->lock);
4705 block_rsv->freed[trans->transid & 0x1] += buf->len;
4706 spin_unlock(&block_rsv->lock);
4710 btrfs_put_block_group(cache);
4713 int btrfs_free_extent(struct btrfs_trans_handle *trans,
4714 struct btrfs_root *root,
4715 u64 bytenr, u64 num_bytes, u64 parent,
4716 u64 root_objectid, u64 owner, u64 offset)
4721 * tree log blocks never actually go into the extent allocation
4722 * tree, just update pinning info and exit early.
4724 if (root_objectid == BTRFS_TREE_LOG_OBJECTID) {
4725 WARN_ON(owner >= BTRFS_FIRST_FREE_OBJECTID);
4726 /* unlocks the pinned mutex */
4727 btrfs_pin_extent(root, bytenr, num_bytes, 1);
4729 } else if (owner < BTRFS_FIRST_FREE_OBJECTID) {
4730 ret = btrfs_add_delayed_tree_ref(trans, bytenr, num_bytes,
4731 parent, root_objectid, (int)owner,
4732 BTRFS_DROP_DELAYED_REF, NULL);
4735 ret = btrfs_add_delayed_data_ref(trans, bytenr, num_bytes,
4736 parent, root_objectid, owner,
4737 offset, BTRFS_DROP_DELAYED_REF, NULL);
4743 static u64 stripe_align(struct btrfs_root *root, u64 val)
4745 u64 mask = ((u64)root->stripesize - 1);
4746 u64 ret = (val + mask) & ~mask;
4751 * when we wait for progress in the block group caching, its because
4752 * our allocation attempt failed at least once. So, we must sleep
4753 * and let some progress happen before we try again.
4755 * This function will sleep at least once waiting for new free space to
4756 * show up, and then it will check the block group free space numbers
4757 * for our min num_bytes. Another option is to have it go ahead
4758 * and look in the rbtree for a free extent of a given size, but this
4762 wait_block_group_cache_progress(struct btrfs_block_group_cache *cache,
4765 struct btrfs_caching_control *caching_ctl;
4768 caching_ctl = get_caching_control(cache);
4772 wait_event(caching_ctl->wait, block_group_cache_done(cache) ||
4773 (cache->free_space >= num_bytes));
4775 put_caching_control(caching_ctl);
4780 wait_block_group_cache_done(struct btrfs_block_group_cache *cache)
4782 struct btrfs_caching_control *caching_ctl;
4785 caching_ctl = get_caching_control(cache);
4789 wait_event(caching_ctl->wait, block_group_cache_done(cache));
4791 put_caching_control(caching_ctl);
4795 static int get_block_group_index(struct btrfs_block_group_cache *cache)
4798 if (cache->flags & BTRFS_BLOCK_GROUP_RAID10)
4800 else if (cache->flags & BTRFS_BLOCK_GROUP_RAID1)
4802 else if (cache->flags & BTRFS_BLOCK_GROUP_DUP)
4804 else if (cache->flags & BTRFS_BLOCK_GROUP_RAID0)
4811 enum btrfs_loop_type {
4812 LOOP_FIND_IDEAL = 0,
4813 LOOP_CACHING_NOWAIT = 1,
4814 LOOP_CACHING_WAIT = 2,
4815 LOOP_ALLOC_CHUNK = 3,
4816 LOOP_NO_EMPTY_SIZE = 4,
4820 * walks the btree of allocated extents and find a hole of a given size.
4821 * The key ins is changed to record the hole:
4822 * ins->objectid == block start
4823 * ins->flags = BTRFS_EXTENT_ITEM_KEY
4824 * ins->offset == number of blocks
4825 * Any available blocks before search_start are skipped.
4827 static noinline int find_free_extent(struct btrfs_trans_handle *trans,
4828 struct btrfs_root *orig_root,
4829 u64 num_bytes, u64 empty_size,
4830 u64 search_start, u64 search_end,
4831 u64 hint_byte, struct btrfs_key *ins,
4835 struct btrfs_root *root = orig_root->fs_info->extent_root;
4836 struct btrfs_free_cluster *last_ptr = NULL;
4837 struct btrfs_block_group_cache *block_group = NULL;
4838 int empty_cluster = 2 * 1024 * 1024;
4839 int allowed_chunk_alloc = 0;
4840 int done_chunk_alloc = 0;
4841 struct btrfs_space_info *space_info;
4842 int last_ptr_loop = 0;
4845 bool found_uncached_bg = false;
4846 bool failed_cluster_refill = false;
4847 bool failed_alloc = false;
4848 bool use_cluster = true;
4849 u64 ideal_cache_percent = 0;
4850 u64 ideal_cache_offset = 0;
4852 WARN_ON(num_bytes < root->sectorsize);
4853 btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY);
4857 space_info = __find_space_info(root->fs_info, data);
4859 printk(KERN_ERR "No space info for %d\n", data);
4864 * If the space info is for both data and metadata it means we have a
4865 * small filesystem and we can't use the clustering stuff.
4867 if (btrfs_mixed_space_info(space_info))
4868 use_cluster = false;
4870 if (orig_root->ref_cows || empty_size)
4871 allowed_chunk_alloc = 1;
4873 if (data & BTRFS_BLOCK_GROUP_METADATA && use_cluster) {
4874 last_ptr = &root->fs_info->meta_alloc_cluster;
4875 if (!btrfs_test_opt(root, SSD))
4876 empty_cluster = 64 * 1024;
4879 if ((data & BTRFS_BLOCK_GROUP_DATA) && use_cluster &&
4880 btrfs_test_opt(root, SSD)) {
4881 last_ptr = &root->fs_info->data_alloc_cluster;
4885 spin_lock(&last_ptr->lock);
4886 if (last_ptr->block_group)
4887 hint_byte = last_ptr->window_start;
4888 spin_unlock(&last_ptr->lock);
4891 search_start = max(search_start, first_logical_byte(root, 0));
4892 search_start = max(search_start, hint_byte);
4897 if (search_start == hint_byte) {
4899 block_group = btrfs_lookup_block_group(root->fs_info,
4902 * we don't want to use the block group if it doesn't match our
4903 * allocation bits, or if its not cached.
4905 * However if we are re-searching with an ideal block group
4906 * picked out then we don't care that the block group is cached.
4908 if (block_group && block_group_bits(block_group, data) &&
4909 (block_group->cached != BTRFS_CACHE_NO ||
4910 search_start == ideal_cache_offset)) {
4911 down_read(&space_info->groups_sem);
4912 if (list_empty(&block_group->list) ||
4915 * someone is removing this block group,
4916 * we can't jump into the have_block_group
4917 * target because our list pointers are not
4920 btrfs_put_block_group(block_group);
4921 up_read(&space_info->groups_sem);
4923 index = get_block_group_index(block_group);
4924 goto have_block_group;
4926 } else if (block_group) {
4927 btrfs_put_block_group(block_group);
4931 down_read(&space_info->groups_sem);
4932 list_for_each_entry(block_group, &space_info->block_groups[index],
4937 btrfs_get_block_group(block_group);
4938 search_start = block_group->key.objectid;
4941 if (unlikely(block_group->cached == BTRFS_CACHE_NO)) {
4944 ret = cache_block_group(block_group, trans,
4946 if (block_group->cached == BTRFS_CACHE_FINISHED)
4947 goto have_block_group;
4949 free_percent = btrfs_block_group_used(&block_group->item);
4950 free_percent *= 100;
4951 free_percent = div64_u64(free_percent,
4952 block_group->key.offset);
4953 free_percent = 100 - free_percent;
4954 if (free_percent > ideal_cache_percent &&
4955 likely(!block_group->ro)) {
4956 ideal_cache_offset = block_group->key.objectid;
4957 ideal_cache_percent = free_percent;
4961 * We only want to start kthread caching if we are at
4962 * the point where we will wait for caching to make
4963 * progress, or if our ideal search is over and we've
4964 * found somebody to start caching.
4966 if (loop > LOOP_CACHING_NOWAIT ||
4967 (loop > LOOP_FIND_IDEAL &&
4968 atomic_read(&space_info->caching_threads) < 2)) {
4969 ret = cache_block_group(block_group, trans,
4973 found_uncached_bg = true;
4976 * If loop is set for cached only, try the next block
4979 if (loop == LOOP_FIND_IDEAL)
4983 cached = block_group_cache_done(block_group);
4984 if (unlikely(!cached))
4985 found_uncached_bg = true;
4987 if (unlikely(block_group->ro))
4991 * Ok we want to try and use the cluster allocator, so lets look
4992 * there, unless we are on LOOP_NO_EMPTY_SIZE, since we will
4993 * have tried the cluster allocator plenty of times at this
4994 * point and not have found anything, so we are likely way too
4995 * fragmented for the clustering stuff to find anything, so lets
4996 * just skip it and let the allocator find whatever block it can
4999 if (last_ptr && loop < LOOP_NO_EMPTY_SIZE) {
5001 * the refill lock keeps out other
5002 * people trying to start a new cluster
5004 spin_lock(&last_ptr->refill_lock);
5005 if (last_ptr->block_group &&
5006 (last_ptr->block_group->ro ||
5007 !block_group_bits(last_ptr->block_group, data))) {
5009 goto refill_cluster;
5012 offset = btrfs_alloc_from_cluster(block_group, last_ptr,
5013 num_bytes, search_start);
5015 /* we have a block, we're done */
5016 spin_unlock(&last_ptr->refill_lock);
5020 spin_lock(&last_ptr->lock);
5022 * whoops, this cluster doesn't actually point to
5023 * this block group. Get a ref on the block
5024 * group is does point to and try again
5026 if (!last_ptr_loop && last_ptr->block_group &&
5027 last_ptr->block_group != block_group) {
5029 btrfs_put_block_group(block_group);
5030 block_group = last_ptr->block_group;
5031 btrfs_get_block_group(block_group);
5032 spin_unlock(&last_ptr->lock);
5033 spin_unlock(&last_ptr->refill_lock);
5036 search_start = block_group->key.objectid;
5038 * we know this block group is properly
5039 * in the list because
5040 * btrfs_remove_block_group, drops the
5041 * cluster before it removes the block
5042 * group from the list
5044 goto have_block_group;
5046 spin_unlock(&last_ptr->lock);
5049 * this cluster didn't work out, free it and
5052 btrfs_return_cluster_to_free_space(NULL, last_ptr);
5056 /* allocate a cluster in this block group */
5057 ret = btrfs_find_space_cluster(trans, root,
5058 block_group, last_ptr,
5060 empty_cluster + empty_size);
5063 * now pull our allocation out of this
5066 offset = btrfs_alloc_from_cluster(block_group,
5067 last_ptr, num_bytes,
5070 /* we found one, proceed */
5071 spin_unlock(&last_ptr->refill_lock);
5074 } else if (!cached && loop > LOOP_CACHING_NOWAIT
5075 && !failed_cluster_refill) {
5076 spin_unlock(&last_ptr->refill_lock);
5078 failed_cluster_refill = true;
5079 wait_block_group_cache_progress(block_group,
5080 num_bytes + empty_cluster + empty_size);
5081 goto have_block_group;
5085 * at this point we either didn't find a cluster
5086 * or we weren't able to allocate a block from our
5087 * cluster. Free the cluster we've been trying
5088 * to use, and go to the next block group
5090 btrfs_return_cluster_to_free_space(NULL, last_ptr);
5091 spin_unlock(&last_ptr->refill_lock);
5095 offset = btrfs_find_space_for_alloc(block_group, search_start,
5096 num_bytes, empty_size);
5098 * If we didn't find a chunk, and we haven't failed on this
5099 * block group before, and this block group is in the middle of
5100 * caching and we are ok with waiting, then go ahead and wait
5101 * for progress to be made, and set failed_alloc to true.
5103 * If failed_alloc is true then we've already waited on this
5104 * block group once and should move on to the next block group.
5106 if (!offset && !failed_alloc && !cached &&
5107 loop > LOOP_CACHING_NOWAIT) {
5108 wait_block_group_cache_progress(block_group,
5109 num_bytes + empty_size);
5110 failed_alloc = true;
5111 goto have_block_group;
5112 } else if (!offset) {
5116 search_start = stripe_align(root, offset);
5117 /* move on to the next group */
5118 if (search_start + num_bytes >= search_end) {
5119 btrfs_add_free_space(block_group, offset, num_bytes);
5123 /* move on to the next group */
5124 if (search_start + num_bytes >
5125 block_group->key.objectid + block_group->key.offset) {
5126 btrfs_add_free_space(block_group, offset, num_bytes);
5130 ins->objectid = search_start;
5131 ins->offset = num_bytes;
5133 if (offset < search_start)
5134 btrfs_add_free_space(block_group, offset,
5135 search_start - offset);
5136 BUG_ON(offset > search_start);
5138 ret = update_reserved_bytes(block_group, num_bytes, 1,
5139 (data & BTRFS_BLOCK_GROUP_DATA));
5140 if (ret == -EAGAIN) {
5141 btrfs_add_free_space(block_group, offset, num_bytes);
5145 /* we are all good, lets return */
5146 ins->objectid = search_start;
5147 ins->offset = num_bytes;
5149 if (offset < search_start)
5150 btrfs_add_free_space(block_group, offset,
5151 search_start - offset);
5152 BUG_ON(offset > search_start);
5155 failed_cluster_refill = false;
5156 failed_alloc = false;
5157 BUG_ON(index != get_block_group_index(block_group));
5158 btrfs_put_block_group(block_group);
5160 up_read(&space_info->groups_sem);
5162 if (!ins->objectid && ++index < BTRFS_NR_RAID_TYPES)
5165 /* LOOP_FIND_IDEAL, only search caching/cached bg's, and don't wait for
5166 * for them to make caching progress. Also
5167 * determine the best possible bg to cache
5168 * LOOP_CACHING_NOWAIT, search partially cached block groups, kicking
5169 * caching kthreads as we move along
5170 * LOOP_CACHING_WAIT, search everything, and wait if our bg is caching
5171 * LOOP_ALLOC_CHUNK, force a chunk allocation and try again
5172 * LOOP_NO_EMPTY_SIZE, set empty_size and empty_cluster to 0 and try
5175 if (!ins->objectid && loop < LOOP_NO_EMPTY_SIZE &&
5176 (found_uncached_bg || empty_size || empty_cluster ||
5177 allowed_chunk_alloc)) {
5179 if (loop == LOOP_FIND_IDEAL && found_uncached_bg) {
5180 found_uncached_bg = false;
5182 if (!ideal_cache_percent &&
5183 atomic_read(&space_info->caching_threads))
5187 * 1 of the following 2 things have happened so far
5189 * 1) We found an ideal block group for caching that
5190 * is mostly full and will cache quickly, so we might
5191 * as well wait for it.
5193 * 2) We searched for cached only and we didn't find
5194 * anything, and we didn't start any caching kthreads
5195 * either, so chances are we will loop through and
5196 * start a couple caching kthreads, and then come back
5197 * around and just wait for them. This will be slower
5198 * because we will have 2 caching kthreads reading at
5199 * the same time when we could have just started one
5200 * and waited for it to get far enough to give us an
5201 * allocation, so go ahead and go to the wait caching
5204 loop = LOOP_CACHING_WAIT;
5205 search_start = ideal_cache_offset;
5206 ideal_cache_percent = 0;
5208 } else if (loop == LOOP_FIND_IDEAL) {
5210 * Didn't find a uncached bg, wait on anything we find
5213 loop = LOOP_CACHING_WAIT;
5217 if (loop < LOOP_CACHING_WAIT) {
5222 if (loop == LOOP_ALLOC_CHUNK) {
5227 if (allowed_chunk_alloc) {
5228 ret = do_chunk_alloc(trans, root, num_bytes +
5229 2 * 1024 * 1024, data, 1);
5230 allowed_chunk_alloc = 0;
5231 done_chunk_alloc = 1;
5232 } else if (!done_chunk_alloc) {
5233 space_info->force_alloc = 1;
5236 if (loop < LOOP_NO_EMPTY_SIZE) {
5241 } else if (!ins->objectid) {
5245 /* we found what we needed */
5246 if (ins->objectid) {
5247 if (!(data & BTRFS_BLOCK_GROUP_DATA))
5248 trans->block_group = block_group->key.objectid;
5250 btrfs_put_block_group(block_group);
5257 static void dump_space_info(struct btrfs_space_info *info, u64 bytes,
5258 int dump_block_groups)
5260 struct btrfs_block_group_cache *cache;
5263 spin_lock(&info->lock);
5264 printk(KERN_INFO "space_info has %llu free, is %sfull\n",
5265 (unsigned long long)(info->total_bytes - info->bytes_used -
5266 info->bytes_pinned - info->bytes_reserved -
5267 info->bytes_readonly),
5268 (info->full) ? "" : "not ");
5269 printk(KERN_INFO "space_info total=%llu, used=%llu, pinned=%llu, "
5270 "reserved=%llu, may_use=%llu, readonly=%llu\n",
5271 (unsigned long long)info->total_bytes,
5272 (unsigned long long)info->bytes_used,
5273 (unsigned long long)info->bytes_pinned,
5274 (unsigned long long)info->bytes_reserved,
5275 (unsigned long long)info->bytes_may_use,
5276 (unsigned long long)info->bytes_readonly);
5277 spin_unlock(&info->lock);
5279 if (!dump_block_groups)
5282 down_read(&info->groups_sem);
5284 list_for_each_entry(cache, &info->block_groups[index], list) {
5285 spin_lock(&cache->lock);
5286 printk(KERN_INFO "block group %llu has %llu bytes, %llu used "
5287 "%llu pinned %llu reserved\n",
5288 (unsigned long long)cache->key.objectid,
5289 (unsigned long long)cache->key.offset,
5290 (unsigned long long)btrfs_block_group_used(&cache->item),
5291 (unsigned long long)cache->pinned,
5292 (unsigned long long)cache->reserved);
5293 btrfs_dump_free_space(cache, bytes);
5294 spin_unlock(&cache->lock);
5296 if (++index < BTRFS_NR_RAID_TYPES)
5298 up_read(&info->groups_sem);
5301 int btrfs_reserve_extent(struct btrfs_trans_handle *trans,
5302 struct btrfs_root *root,
5303 u64 num_bytes, u64 min_alloc_size,
5304 u64 empty_size, u64 hint_byte,
5305 u64 search_end, struct btrfs_key *ins,
5309 u64 search_start = 0;
5311 data = btrfs_get_alloc_profile(root, data);
5314 * the only place that sets empty_size is btrfs_realloc_node, which
5315 * is not called recursively on allocations
5317 if (empty_size || root->ref_cows)
5318 ret = do_chunk_alloc(trans, root->fs_info->extent_root,
5319 num_bytes + 2 * 1024 * 1024, data, 0);
5321 WARN_ON(num_bytes < root->sectorsize);
5322 ret = find_free_extent(trans, root, num_bytes, empty_size,
5323 search_start, search_end, hint_byte,
5326 if (ret == -ENOSPC && num_bytes > min_alloc_size) {
5327 num_bytes = num_bytes >> 1;
5328 num_bytes = num_bytes & ~(root->sectorsize - 1);
5329 num_bytes = max(num_bytes, min_alloc_size);
5330 do_chunk_alloc(trans, root->fs_info->extent_root,
5331 num_bytes, data, 1);
5334 if (ret == -ENOSPC) {
5335 struct btrfs_space_info *sinfo;
5337 sinfo = __find_space_info(root->fs_info, data);
5338 printk(KERN_ERR "btrfs allocation failed flags %llu, "
5339 "wanted %llu\n", (unsigned long long)data,
5340 (unsigned long long)num_bytes);
5341 dump_space_info(sinfo, num_bytes, 1);
5347 int btrfs_free_reserved_extent(struct btrfs_root *root, u64 start, u64 len)
5349 struct btrfs_block_group_cache *cache;
5352 cache = btrfs_lookup_block_group(root->fs_info, start);
5354 printk(KERN_ERR "Unable to find block group for %llu\n",
5355 (unsigned long long)start);
5359 ret = btrfs_discard_extent(root, start, len);
5361 btrfs_add_free_space(cache, start, len);
5362 update_reserved_bytes(cache, len, 0, 1);
5363 btrfs_put_block_group(cache);
5368 static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
5369 struct btrfs_root *root,
5370 u64 parent, u64 root_objectid,
5371 u64 flags, u64 owner, u64 offset,
5372 struct btrfs_key *ins, int ref_mod)
5375 struct btrfs_fs_info *fs_info = root->fs_info;
5376 struct btrfs_extent_item *extent_item;
5377 struct btrfs_extent_inline_ref *iref;
5378 struct btrfs_path *path;
5379 struct extent_buffer *leaf;
5384 type = BTRFS_SHARED_DATA_REF_KEY;
5386 type = BTRFS_EXTENT_DATA_REF_KEY;
5388 size = sizeof(*extent_item) + btrfs_extent_inline_ref_size(type);
5390 path = btrfs_alloc_path();
5393 path->leave_spinning = 1;
5394 ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path,
5398 leaf = path->nodes[0];
5399 extent_item = btrfs_item_ptr(leaf, path->slots[0],
5400 struct btrfs_extent_item);
5401 btrfs_set_extent_refs(leaf, extent_item, ref_mod);
5402 btrfs_set_extent_generation(leaf, extent_item, trans->transid);
5403 btrfs_set_extent_flags(leaf, extent_item,
5404 flags | BTRFS_EXTENT_FLAG_DATA);
5406 iref = (struct btrfs_extent_inline_ref *)(extent_item + 1);
5407 btrfs_set_extent_inline_ref_type(leaf, iref, type);
5409 struct btrfs_shared_data_ref *ref;
5410 ref = (struct btrfs_shared_data_ref *)(iref + 1);
5411 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
5412 btrfs_set_shared_data_ref_count(leaf, ref, ref_mod);
5414 struct btrfs_extent_data_ref *ref;
5415 ref = (struct btrfs_extent_data_ref *)(&iref->offset);
5416 btrfs_set_extent_data_ref_root(leaf, ref, root_objectid);
5417 btrfs_set_extent_data_ref_objectid(leaf, ref, owner);
5418 btrfs_set_extent_data_ref_offset(leaf, ref, offset);
5419 btrfs_set_extent_data_ref_count(leaf, ref, ref_mod);
5422 btrfs_mark_buffer_dirty(path->nodes[0]);
5423 btrfs_free_path(path);
5425 ret = update_block_group(trans, root, ins->objectid, ins->offset, 1);
5427 printk(KERN_ERR "btrfs update block group failed for %llu "
5428 "%llu\n", (unsigned long long)ins->objectid,
5429 (unsigned long long)ins->offset);
5435 static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans,
5436 struct btrfs_root *root,
5437 u64 parent, u64 root_objectid,
5438 u64 flags, struct btrfs_disk_key *key,
5439 int level, struct btrfs_key *ins)
5442 struct btrfs_fs_info *fs_info = root->fs_info;
5443 struct btrfs_extent_item *extent_item;
5444 struct btrfs_tree_block_info *block_info;
5445 struct btrfs_extent_inline_ref *iref;
5446 struct btrfs_path *path;
5447 struct extent_buffer *leaf;
5448 u32 size = sizeof(*extent_item) + sizeof(*block_info) + sizeof(*iref);
5450 path = btrfs_alloc_path();
5453 path->leave_spinning = 1;
5454 ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path,
5458 leaf = path->nodes[0];
5459 extent_item = btrfs_item_ptr(leaf, path->slots[0],
5460 struct btrfs_extent_item);
5461 btrfs_set_extent_refs(leaf, extent_item, 1);
5462 btrfs_set_extent_generation(leaf, extent_item, trans->transid);
5463 btrfs_set_extent_flags(leaf, extent_item,
5464 flags | BTRFS_EXTENT_FLAG_TREE_BLOCK);
5465 block_info = (struct btrfs_tree_block_info *)(extent_item + 1);
5467 btrfs_set_tree_block_key(leaf, block_info, key);
5468 btrfs_set_tree_block_level(leaf, block_info, level);
5470 iref = (struct btrfs_extent_inline_ref *)(block_info + 1);
5472 BUG_ON(!(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF));
5473 btrfs_set_extent_inline_ref_type(leaf, iref,
5474 BTRFS_SHARED_BLOCK_REF_KEY);
5475 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
5477 btrfs_set_extent_inline_ref_type(leaf, iref,
5478 BTRFS_TREE_BLOCK_REF_KEY);
5479 btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid);
5482 btrfs_mark_buffer_dirty(leaf);
5483 btrfs_free_path(path);
5485 ret = update_block_group(trans, root, ins->objectid, ins->offset, 1);
5487 printk(KERN_ERR "btrfs update block group failed for %llu "
5488 "%llu\n", (unsigned long long)ins->objectid,
5489 (unsigned long long)ins->offset);
5495 int btrfs_alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
5496 struct btrfs_root *root,
5497 u64 root_objectid, u64 owner,
5498 u64 offset, struct btrfs_key *ins)
5502 BUG_ON(root_objectid == BTRFS_TREE_LOG_OBJECTID);
5504 ret = btrfs_add_delayed_data_ref(trans, ins->objectid, ins->offset,
5505 0, root_objectid, owner, offset,
5506 BTRFS_ADD_DELAYED_EXTENT, NULL);
5511 * this is used by the tree logging recovery code. It records that
5512 * an extent has been allocated and makes sure to clear the free
5513 * space cache bits as well
5515 int btrfs_alloc_logged_file_extent(struct btrfs_trans_handle *trans,
5516 struct btrfs_root *root,
5517 u64 root_objectid, u64 owner, u64 offset,
5518 struct btrfs_key *ins)
5521 struct btrfs_block_group_cache *block_group;
5522 struct btrfs_caching_control *caching_ctl;
5523 u64 start = ins->objectid;
5524 u64 num_bytes = ins->offset;
5526 block_group = btrfs_lookup_block_group(root->fs_info, ins->objectid);
5527 cache_block_group(block_group, trans, NULL, 0);
5528 caching_ctl = get_caching_control(block_group);
5531 BUG_ON(!block_group_cache_done(block_group));
5532 ret = btrfs_remove_free_space(block_group, start, num_bytes);
5535 mutex_lock(&caching_ctl->mutex);
5537 if (start >= caching_ctl->progress) {
5538 ret = add_excluded_extent(root, start, num_bytes);
5540 } else if (start + num_bytes <= caching_ctl->progress) {
5541 ret = btrfs_remove_free_space(block_group,
5545 num_bytes = caching_ctl->progress - start;
5546 ret = btrfs_remove_free_space(block_group,
5550 start = caching_ctl->progress;
5551 num_bytes = ins->objectid + ins->offset -
5552 caching_ctl->progress;
5553 ret = add_excluded_extent(root, start, num_bytes);
5557 mutex_unlock(&caching_ctl->mutex);
5558 put_caching_control(caching_ctl);
5561 ret = update_reserved_bytes(block_group, ins->offset, 1, 1);
5563 btrfs_put_block_group(block_group);
5564 ret = alloc_reserved_file_extent(trans, root, 0, root_objectid,
5565 0, owner, offset, ins, 1);
5569 struct extent_buffer *btrfs_init_new_buffer(struct btrfs_trans_handle *trans,
5570 struct btrfs_root *root,
5571 u64 bytenr, u32 blocksize,
5574 struct extent_buffer *buf;
5576 buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
5578 return ERR_PTR(-ENOMEM);
5579 btrfs_set_header_generation(buf, trans->transid);
5580 btrfs_set_buffer_lockdep_class(buf, level);
5581 btrfs_tree_lock(buf);
5582 clean_tree_block(trans, root, buf);
5584 btrfs_set_lock_blocking(buf);
5585 btrfs_set_buffer_uptodate(buf);
5587 if (root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID) {
5589 * we allow two log transactions at a time, use different
5590 * EXENT bit to differentiate dirty pages.
5592 if (root->log_transid % 2 == 0)
5593 set_extent_dirty(&root->dirty_log_pages, buf->start,
5594 buf->start + buf->len - 1, GFP_NOFS);
5596 set_extent_new(&root->dirty_log_pages, buf->start,
5597 buf->start + buf->len - 1, GFP_NOFS);
5599 set_extent_dirty(&trans->transaction->dirty_pages, buf->start,
5600 buf->start + buf->len - 1, GFP_NOFS);
5602 trans->blocks_used++;
5603 /* this returns a buffer locked for blocking */
5607 static struct btrfs_block_rsv *
5608 use_block_rsv(struct btrfs_trans_handle *trans,
5609 struct btrfs_root *root, u32 blocksize)
5611 struct btrfs_block_rsv *block_rsv;
5614 block_rsv = get_block_rsv(trans, root);
5616 if (block_rsv->size == 0) {
5617 ret = reserve_metadata_bytes(trans, root, block_rsv,
5620 return ERR_PTR(ret);
5624 ret = block_rsv_use_bytes(block_rsv, blocksize);
5628 return ERR_PTR(-ENOSPC);
5631 static void unuse_block_rsv(struct btrfs_block_rsv *block_rsv, u32 blocksize)
5633 block_rsv_add_bytes(block_rsv, blocksize, 0);
5634 block_rsv_release_bytes(block_rsv, NULL, 0);
5638 * finds a free extent and does all the dirty work required for allocation
5639 * returns the key for the extent through ins, and a tree buffer for
5640 * the first block of the extent through buf.
5642 * returns the tree buffer or NULL.
5644 struct extent_buffer *btrfs_alloc_free_block(struct btrfs_trans_handle *trans,
5645 struct btrfs_root *root, u32 blocksize,
5646 u64 parent, u64 root_objectid,
5647 struct btrfs_disk_key *key, int level,
5648 u64 hint, u64 empty_size)
5650 struct btrfs_key ins;
5651 struct btrfs_block_rsv *block_rsv;
5652 struct extent_buffer *buf;
5657 block_rsv = use_block_rsv(trans, root, blocksize);
5658 if (IS_ERR(block_rsv))
5659 return ERR_CAST(block_rsv);
5661 ret = btrfs_reserve_extent(trans, root, blocksize, blocksize,
5662 empty_size, hint, (u64)-1, &ins, 0);
5664 unuse_block_rsv(block_rsv, blocksize);
5665 return ERR_PTR(ret);
5668 buf = btrfs_init_new_buffer(trans, root, ins.objectid,
5670 BUG_ON(IS_ERR(buf));
5672 if (root_objectid == BTRFS_TREE_RELOC_OBJECTID) {
5674 parent = ins.objectid;
5675 flags |= BTRFS_BLOCK_FLAG_FULL_BACKREF;
5679 if (root_objectid != BTRFS_TREE_LOG_OBJECTID) {
5680 struct btrfs_delayed_extent_op *extent_op;
5681 extent_op = kmalloc(sizeof(*extent_op), GFP_NOFS);
5684 memcpy(&extent_op->key, key, sizeof(extent_op->key));
5686 memset(&extent_op->key, 0, sizeof(extent_op->key));
5687 extent_op->flags_to_set = flags;
5688 extent_op->update_key = 1;
5689 extent_op->update_flags = 1;
5690 extent_op->is_data = 0;
5692 ret = btrfs_add_delayed_tree_ref(trans, ins.objectid,
5693 ins.offset, parent, root_objectid,
5694 level, BTRFS_ADD_DELAYED_EXTENT,
5701 struct walk_control {
5702 u64 refs[BTRFS_MAX_LEVEL];
5703 u64 flags[BTRFS_MAX_LEVEL];
5704 struct btrfs_key update_progress;
5714 #define DROP_REFERENCE 1
5715 #define UPDATE_BACKREF 2
5717 static noinline void reada_walk_down(struct btrfs_trans_handle *trans,
5718 struct btrfs_root *root,
5719 struct walk_control *wc,
5720 struct btrfs_path *path)
5728 struct btrfs_key key;
5729 struct extent_buffer *eb;
5734 if (path->slots[wc->level] < wc->reada_slot) {
5735 wc->reada_count = wc->reada_count * 2 / 3;
5736 wc->reada_count = max(wc->reada_count, 2);
5738 wc->reada_count = wc->reada_count * 3 / 2;
5739 wc->reada_count = min_t(int, wc->reada_count,
5740 BTRFS_NODEPTRS_PER_BLOCK(root));
5743 eb = path->nodes[wc->level];
5744 nritems = btrfs_header_nritems(eb);
5745 blocksize = btrfs_level_size(root, wc->level - 1);
5747 for (slot = path->slots[wc->level]; slot < nritems; slot++) {
5748 if (nread >= wc->reada_count)
5752 bytenr = btrfs_node_blockptr(eb, slot);
5753 generation = btrfs_node_ptr_generation(eb, slot);
5755 if (slot == path->slots[wc->level])
5758 if (wc->stage == UPDATE_BACKREF &&
5759 generation <= root->root_key.offset)
5762 /* We don't lock the tree block, it's OK to be racy here */
5763 ret = btrfs_lookup_extent_info(trans, root, bytenr, blocksize,
5768 if (wc->stage == DROP_REFERENCE) {
5772 if (wc->level == 1 &&
5773 (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF))
5775 if (!wc->update_ref ||
5776 generation <= root->root_key.offset)
5778 btrfs_node_key_to_cpu(eb, &key, slot);
5779 ret = btrfs_comp_cpu_keys(&key,
5780 &wc->update_progress);
5784 if (wc->level == 1 &&
5785 (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF))
5789 ret = readahead_tree_block(root, bytenr, blocksize,
5795 wc->reada_slot = slot;
5799 * hepler to process tree block while walking down the tree.
5801 * when wc->stage == UPDATE_BACKREF, this function updates
5802 * back refs for pointers in the block.
5804 * NOTE: return value 1 means we should stop walking down.
5806 static noinline int walk_down_proc(struct btrfs_trans_handle *trans,
5807 struct btrfs_root *root,
5808 struct btrfs_path *path,
5809 struct walk_control *wc, int lookup_info)
5811 int level = wc->level;
5812 struct extent_buffer *eb = path->nodes[level];
5813 u64 flag = BTRFS_BLOCK_FLAG_FULL_BACKREF;
5816 if (wc->stage == UPDATE_BACKREF &&
5817 btrfs_header_owner(eb) != root->root_key.objectid)
5821 * when reference count of tree block is 1, it won't increase
5822 * again. once full backref flag is set, we never clear it.
5825 ((wc->stage == DROP_REFERENCE && wc->refs[level] != 1) ||
5826 (wc->stage == UPDATE_BACKREF && !(wc->flags[level] & flag)))) {
5827 BUG_ON(!path->locks[level]);
5828 ret = btrfs_lookup_extent_info(trans, root,
5833 BUG_ON(wc->refs[level] == 0);
5836 if (wc->stage == DROP_REFERENCE) {
5837 if (wc->refs[level] > 1)
5840 if (path->locks[level] && !wc->keep_locks) {
5841 btrfs_tree_unlock(eb);
5842 path->locks[level] = 0;
5847 /* wc->stage == UPDATE_BACKREF */
5848 if (!(wc->flags[level] & flag)) {
5849 BUG_ON(!path->locks[level]);
5850 ret = btrfs_inc_ref(trans, root, eb, 1);
5852 ret = btrfs_dec_ref(trans, root, eb, 0);
5854 ret = btrfs_set_disk_extent_flags(trans, root, eb->start,
5857 wc->flags[level] |= flag;
5861 * the block is shared by multiple trees, so it's not good to
5862 * keep the tree lock
5864 if (path->locks[level] && level > 0) {
5865 btrfs_tree_unlock(eb);
5866 path->locks[level] = 0;
5872 * hepler to process tree block pointer.
5874 * when wc->stage == DROP_REFERENCE, this function checks
5875 * reference count of the block pointed to. if the block
5876 * is shared and we need update back refs for the subtree
5877 * rooted at the block, this function changes wc->stage to
5878 * UPDATE_BACKREF. if the block is shared and there is no
5879 * need to update back, this function drops the reference
5882 * NOTE: return value 1 means we should stop walking down.
5884 static noinline int do_walk_down(struct btrfs_trans_handle *trans,
5885 struct btrfs_root *root,
5886 struct btrfs_path *path,
5887 struct walk_control *wc, int *lookup_info)
5893 struct btrfs_key key;
5894 struct extent_buffer *next;
5895 int level = wc->level;
5899 generation = btrfs_node_ptr_generation(path->nodes[level],
5900 path->slots[level]);
5902 * if the lower level block was created before the snapshot
5903 * was created, we know there is no need to update back refs
5906 if (wc->stage == UPDATE_BACKREF &&
5907 generation <= root->root_key.offset) {
5912 bytenr = btrfs_node_blockptr(path->nodes[level], path->slots[level]);
5913 blocksize = btrfs_level_size(root, level - 1);
5915 next = btrfs_find_tree_block(root, bytenr, blocksize);
5917 next = btrfs_find_create_tree_block(root, bytenr, blocksize);
5922 btrfs_tree_lock(next);
5923 btrfs_set_lock_blocking(next);
5925 ret = btrfs_lookup_extent_info(trans, root, bytenr, blocksize,
5926 &wc->refs[level - 1],
5927 &wc->flags[level - 1]);
5929 BUG_ON(wc->refs[level - 1] == 0);
5932 if (wc->stage == DROP_REFERENCE) {
5933 if (wc->refs[level - 1] > 1) {
5935 (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF))
5938 if (!wc->update_ref ||
5939 generation <= root->root_key.offset)
5942 btrfs_node_key_to_cpu(path->nodes[level], &key,
5943 path->slots[level]);
5944 ret = btrfs_comp_cpu_keys(&key, &wc->update_progress);
5948 wc->stage = UPDATE_BACKREF;
5949 wc->shared_level = level - 1;
5953 (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF))
5957 if (!btrfs_buffer_uptodate(next, generation)) {
5958 btrfs_tree_unlock(next);
5959 free_extent_buffer(next);
5965 if (reada && level == 1)
5966 reada_walk_down(trans, root, wc, path);
5967 next = read_tree_block(root, bytenr, blocksize, generation);
5968 btrfs_tree_lock(next);
5969 btrfs_set_lock_blocking(next);
5973 BUG_ON(level != btrfs_header_level(next));
5974 path->nodes[level] = next;
5975 path->slots[level] = 0;
5976 path->locks[level] = 1;
5982 wc->refs[level - 1] = 0;
5983 wc->flags[level - 1] = 0;
5984 if (wc->stage == DROP_REFERENCE) {
5985 if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) {
5986 parent = path->nodes[level]->start;
5988 BUG_ON(root->root_key.objectid !=
5989 btrfs_header_owner(path->nodes[level]));
5993 ret = btrfs_free_extent(trans, root, bytenr, blocksize, parent,
5994 root->root_key.objectid, level - 1, 0);
5997 btrfs_tree_unlock(next);
5998 free_extent_buffer(next);
6004 * hepler to process tree block while walking up the tree.
6006 * when wc->stage == DROP_REFERENCE, this function drops
6007 * reference count on the block.
6009 * when wc->stage == UPDATE_BACKREF, this function changes
6010 * wc->stage back to DROP_REFERENCE if we changed wc->stage
6011 * to UPDATE_BACKREF previously while processing the block.
6013 * NOTE: return value 1 means we should stop walking up.
6015 static noinline int walk_up_proc(struct btrfs_trans_handle *trans,
6016 struct btrfs_root *root,
6017 struct btrfs_path *path,
6018 struct walk_control *wc)
6021 int level = wc->level;
6022 struct extent_buffer *eb = path->nodes[level];
6025 if (wc->stage == UPDATE_BACKREF) {
6026 BUG_ON(wc->shared_level < level);
6027 if (level < wc->shared_level)
6030 ret = find_next_key(path, level + 1, &wc->update_progress);
6034 wc->stage = DROP_REFERENCE;
6035 wc->shared_level = -1;
6036 path->slots[level] = 0;
6039 * check reference count again if the block isn't locked.
6040 * we should start walking down the tree again if reference
6043 if (!path->locks[level]) {
6045 btrfs_tree_lock(eb);
6046 btrfs_set_lock_blocking(eb);
6047 path->locks[level] = 1;
6049 ret = btrfs_lookup_extent_info(trans, root,
6054 BUG_ON(wc->refs[level] == 0);
6055 if (wc->refs[level] == 1) {
6056 btrfs_tree_unlock(eb);
6057 path->locks[level] = 0;
6063 /* wc->stage == DROP_REFERENCE */
6064 BUG_ON(wc->refs[level] > 1 && !path->locks[level]);
6066 if (wc->refs[level] == 1) {
6068 if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF)
6069 ret = btrfs_dec_ref(trans, root, eb, 1);
6071 ret = btrfs_dec_ref(trans, root, eb, 0);
6074 /* make block locked assertion in clean_tree_block happy */
6075 if (!path->locks[level] &&
6076 btrfs_header_generation(eb) == trans->transid) {
6077 btrfs_tree_lock(eb);
6078 btrfs_set_lock_blocking(eb);
6079 path->locks[level] = 1;
6081 clean_tree_block(trans, root, eb);
6084 if (eb == root->node) {
6085 if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF)
6088 BUG_ON(root->root_key.objectid !=
6089 btrfs_header_owner(eb));
6091 if (wc->flags[level + 1] & BTRFS_BLOCK_FLAG_FULL_BACKREF)
6092 parent = path->nodes[level + 1]->start;
6094 BUG_ON(root->root_key.objectid !=
6095 btrfs_header_owner(path->nodes[level + 1]));
6098 btrfs_free_tree_block(trans, root, eb, parent, wc->refs[level] == 1);
6100 wc->refs[level] = 0;
6101 wc->flags[level] = 0;
6105 static noinline int walk_down_tree(struct btrfs_trans_handle *trans,
6106 struct btrfs_root *root,
6107 struct btrfs_path *path,
6108 struct walk_control *wc)
6110 int level = wc->level;
6111 int lookup_info = 1;
6114 while (level >= 0) {
6115 ret = walk_down_proc(trans, root, path, wc, lookup_info);
6122 if (path->slots[level] >=
6123 btrfs_header_nritems(path->nodes[level]))
6126 ret = do_walk_down(trans, root, path, wc, &lookup_info);
6128 path->slots[level]++;
6137 static noinline int walk_up_tree(struct btrfs_trans_handle *trans,
6138 struct btrfs_root *root,
6139 struct btrfs_path *path,
6140 struct walk_control *wc, int max_level)
6142 int level = wc->level;
6145 path->slots[level] = btrfs_header_nritems(path->nodes[level]);
6146 while (level < max_level && path->nodes[level]) {
6148 if (path->slots[level] + 1 <
6149 btrfs_header_nritems(path->nodes[level])) {
6150 path->slots[level]++;
6153 ret = walk_up_proc(trans, root, path, wc);
6157 if (path->locks[level]) {
6158 btrfs_tree_unlock(path->nodes[level]);
6159 path->locks[level] = 0;
6161 free_extent_buffer(path->nodes[level]);
6162 path->nodes[level] = NULL;
6170 * drop a subvolume tree.
6172 * this function traverses the tree freeing any blocks that only
6173 * referenced by the tree.
6175 * when a shared tree block is found. this function decreases its
6176 * reference count by one. if update_ref is true, this function
6177 * also make sure backrefs for the shared block and all lower level
6178 * blocks are properly updated.
6180 int btrfs_drop_snapshot(struct btrfs_root *root,
6181 struct btrfs_block_rsv *block_rsv, int update_ref)
6183 struct btrfs_path *path;
6184 struct btrfs_trans_handle *trans;
6185 struct btrfs_root *tree_root = root->fs_info->tree_root;
6186 struct btrfs_root_item *root_item = &root->root_item;
6187 struct walk_control *wc;
6188 struct btrfs_key key;
6193 path = btrfs_alloc_path();
6196 wc = kzalloc(sizeof(*wc), GFP_NOFS);
6199 trans = btrfs_start_transaction(tree_root, 0);
6201 trans->block_rsv = block_rsv;
6203 if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) {
6204 level = btrfs_header_level(root->node);
6205 path->nodes[level] = btrfs_lock_root_node(root);
6206 btrfs_set_lock_blocking(path->nodes[level]);
6207 path->slots[level] = 0;
6208 path->locks[level] = 1;
6209 memset(&wc->update_progress, 0,
6210 sizeof(wc->update_progress));
6212 btrfs_disk_key_to_cpu(&key, &root_item->drop_progress);
6213 memcpy(&wc->update_progress, &key,
6214 sizeof(wc->update_progress));
6216 level = root_item->drop_level;
6218 path->lowest_level = level;
6219 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
6220 path->lowest_level = 0;
6228 * unlock our path, this is safe because only this
6229 * function is allowed to delete this snapshot
6231 btrfs_unlock_up_safe(path, 0);
6233 level = btrfs_header_level(root->node);
6235 btrfs_tree_lock(path->nodes[level]);
6236 btrfs_set_lock_blocking(path->nodes[level]);
6238 ret = btrfs_lookup_extent_info(trans, root,
6239 path->nodes[level]->start,
6240 path->nodes[level]->len,
6244 BUG_ON(wc->refs[level] == 0);
6246 if (level == root_item->drop_level)
6249 btrfs_tree_unlock(path->nodes[level]);
6250 WARN_ON(wc->refs[level] != 1);
6256 wc->shared_level = -1;
6257 wc->stage = DROP_REFERENCE;
6258 wc->update_ref = update_ref;
6260 wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(root);
6263 ret = walk_down_tree(trans, root, path, wc);
6269 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL);
6276 BUG_ON(wc->stage != DROP_REFERENCE);
6280 if (wc->stage == DROP_REFERENCE) {
6282 btrfs_node_key(path->nodes[level],
6283 &root_item->drop_progress,
6284 path->slots[level]);
6285 root_item->drop_level = level;
6288 BUG_ON(wc->level == 0);
6289 if (btrfs_should_end_transaction(trans, tree_root)) {
6290 ret = btrfs_update_root(trans, tree_root,
6295 btrfs_end_transaction_throttle(trans, tree_root);
6296 trans = btrfs_start_transaction(tree_root, 0);
6298 trans->block_rsv = block_rsv;
6301 btrfs_release_path(root, path);
6304 ret = btrfs_del_root(trans, tree_root, &root->root_key);
6307 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) {
6308 ret = btrfs_find_last_root(tree_root, root->root_key.objectid,
6312 ret = btrfs_del_orphan_item(trans, tree_root,
6313 root->root_key.objectid);
6318 if (root->in_radix) {
6319 btrfs_free_fs_root(tree_root->fs_info, root);
6321 free_extent_buffer(root->node);
6322 free_extent_buffer(root->commit_root);
6326 btrfs_end_transaction_throttle(trans, tree_root);
6328 btrfs_free_path(path);
6333 * drop subtree rooted at tree block 'node'.
6335 * NOTE: this function will unlock and release tree block 'node'
6337 int btrfs_drop_subtree(struct btrfs_trans_handle *trans,
6338 struct btrfs_root *root,
6339 struct extent_buffer *node,
6340 struct extent_buffer *parent)
6342 struct btrfs_path *path;
6343 struct walk_control *wc;
6349 BUG_ON(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID);
6351 path = btrfs_alloc_path();
6354 wc = kzalloc(sizeof(*wc), GFP_NOFS);
6357 btrfs_assert_tree_locked(parent);
6358 parent_level = btrfs_header_level(parent);
6359 extent_buffer_get(parent);
6360 path->nodes[parent_level] = parent;
6361 path->slots[parent_level] = btrfs_header_nritems(parent);
6363 btrfs_assert_tree_locked(node);
6364 level = btrfs_header_level(node);
6365 path->nodes[level] = node;
6366 path->slots[level] = 0;
6367 path->locks[level] = 1;
6369 wc->refs[parent_level] = 1;
6370 wc->flags[parent_level] = BTRFS_BLOCK_FLAG_FULL_BACKREF;
6372 wc->shared_level = -1;
6373 wc->stage = DROP_REFERENCE;
6376 wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(root);
6379 wret = walk_down_tree(trans, root, path, wc);
6385 wret = walk_up_tree(trans, root, path, wc, parent_level);
6393 btrfs_free_path(path);
6398 static unsigned long calc_ra(unsigned long start, unsigned long last,
6401 return min(last, start + nr - 1);
6404 static noinline int relocate_inode_pages(struct inode *inode, u64 start,
6409 unsigned long first_index;
6410 unsigned long last_index;
6413 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
6414 struct file_ra_state *ra;
6415 struct btrfs_ordered_extent *ordered;
6416 unsigned int total_read = 0;
6417 unsigned int total_dirty = 0;
6420 ra = kzalloc(sizeof(*ra), GFP_NOFS);
6422 mutex_lock(&inode->i_mutex);
6423 first_index = start >> PAGE_CACHE_SHIFT;
6424 last_index = (start + len - 1) >> PAGE_CACHE_SHIFT;
6426 /* make sure the dirty trick played by the caller work */
6427 ret = invalidate_inode_pages2_range(inode->i_mapping,
6428 first_index, last_index);
6432 file_ra_state_init(ra, inode->i_mapping);
6434 for (i = first_index ; i <= last_index; i++) {
6435 if (total_read % ra->ra_pages == 0) {
6436 btrfs_force_ra(inode->i_mapping, ra, NULL, i,
6437 calc_ra(i, last_index, ra->ra_pages));
6441 if (((u64)i << PAGE_CACHE_SHIFT) > i_size_read(inode))
6443 page = grab_cache_page(inode->i_mapping, i);
6448 if (!PageUptodate(page)) {
6449 btrfs_readpage(NULL, page);
6451 if (!PageUptodate(page)) {
6453 page_cache_release(page);
6458 wait_on_page_writeback(page);
6460 page_start = (u64)page->index << PAGE_CACHE_SHIFT;
6461 page_end = page_start + PAGE_CACHE_SIZE - 1;
6462 lock_extent(io_tree, page_start, page_end, GFP_NOFS);
6464 ordered = btrfs_lookup_ordered_extent(inode, page_start);
6466 unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
6468 page_cache_release(page);
6469 btrfs_start_ordered_extent(inode, ordered, 1);
6470 btrfs_put_ordered_extent(ordered);
6473 set_page_extent_mapped(page);
6475 if (i == first_index)
6476 set_extent_bits(io_tree, page_start, page_end,
6477 EXTENT_BOUNDARY, GFP_NOFS);
6478 btrfs_set_extent_delalloc(inode, page_start, page_end);
6480 set_page_dirty(page);
6483 unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
6485 page_cache_release(page);
6490 mutex_unlock(&inode->i_mutex);
6491 balance_dirty_pages_ratelimited_nr(inode->i_mapping, total_dirty);
6495 static noinline int relocate_data_extent(struct inode *reloc_inode,
6496 struct btrfs_key *extent_key,
6499 struct btrfs_root *root = BTRFS_I(reloc_inode)->root;
6500 struct extent_map_tree *em_tree = &BTRFS_I(reloc_inode)->extent_tree;
6501 struct extent_map *em;
6502 u64 start = extent_key->objectid - offset;
6503 u64 end = start + extent_key->offset - 1;
6505 em = alloc_extent_map(GFP_NOFS);
6506 BUG_ON(!em || IS_ERR(em));
6509 em->len = extent_key->offset;
6510 em->block_len = extent_key->offset;
6511 em->block_start = extent_key->objectid;
6512 em->bdev = root->fs_info->fs_devices->latest_bdev;
6513 set_bit(EXTENT_FLAG_PINNED, &em->flags);
6515 /* setup extent map to cheat btrfs_readpage */
6516 lock_extent(&BTRFS_I(reloc_inode)->io_tree, start, end, GFP_NOFS);
6519 write_lock(&em_tree->lock);
6520 ret = add_extent_mapping(em_tree, em);
6521 write_unlock(&em_tree->lock);
6522 if (ret != -EEXIST) {
6523 free_extent_map(em);
6526 btrfs_drop_extent_cache(reloc_inode, start, end, 0);
6528 unlock_extent(&BTRFS_I(reloc_inode)->io_tree, start, end, GFP_NOFS);
6530 return relocate_inode_pages(reloc_inode, start, extent_key->offset);
6533 struct btrfs_ref_path {
6535 u64 nodes[BTRFS_MAX_LEVEL];
6537 u64 root_generation;
6544 struct btrfs_key node_keys[BTRFS_MAX_LEVEL];
6545 u64 new_nodes[BTRFS_MAX_LEVEL];
6548 struct disk_extent {
6559 static int is_cowonly_root(u64 root_objectid)
6561 if (root_objectid == BTRFS_ROOT_TREE_OBJECTID ||
6562 root_objectid == BTRFS_EXTENT_TREE_OBJECTID ||
6563 root_objectid == BTRFS_CHUNK_TREE_OBJECTID ||
6564 root_objectid == BTRFS_DEV_TREE_OBJECTID ||
6565 root_objectid == BTRFS_TREE_LOG_OBJECTID ||
6566 root_objectid == BTRFS_CSUM_TREE_OBJECTID)
6571 static noinline int __next_ref_path(struct btrfs_trans_handle *trans,
6572 struct btrfs_root *extent_root,
6573 struct btrfs_ref_path *ref_path,
6576 struct extent_buffer *leaf;
6577 struct btrfs_path *path;
6578 struct btrfs_extent_ref *ref;
6579 struct btrfs_key key;
6580 struct btrfs_key found_key;
6586 path = btrfs_alloc_path();
6591 ref_path->lowest_level = -1;
6592 ref_path->current_level = -1;
6593 ref_path->shared_level = -1;
6597 level = ref_path->current_level - 1;
6598 while (level >= -1) {
6600 if (level < ref_path->lowest_level)
6604 bytenr = ref_path->nodes[level];
6606 bytenr = ref_path->extent_start;
6607 BUG_ON(bytenr == 0);
6609 parent = ref_path->nodes[level + 1];
6610 ref_path->nodes[level + 1] = 0;
6611 ref_path->current_level = level;
6612 BUG_ON(parent == 0);
6614 key.objectid = bytenr;
6615 key.offset = parent + 1;
6616 key.type = BTRFS_EXTENT_REF_KEY;
6618 ret = btrfs_search_slot(trans, extent_root, &key, path, 0, 0);
6623 leaf = path->nodes[0];
6624 nritems = btrfs_header_nritems(leaf);
6625 if (path->slots[0] >= nritems) {
6626 ret = btrfs_next_leaf(extent_root, path);
6631 leaf = path->nodes[0];
6634 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6635 if (found_key.objectid == bytenr &&
6636 found_key.type == BTRFS_EXTENT_REF_KEY) {
6637 if (level < ref_path->shared_level)
6638 ref_path->shared_level = level;
6643 btrfs_release_path(extent_root, path);
6646 /* reached lowest level */
6650 level = ref_path->current_level;
6651 while (level < BTRFS_MAX_LEVEL - 1) {
6655 bytenr = ref_path->nodes[level];
6657 bytenr = ref_path->extent_start;
6659 BUG_ON(bytenr == 0);
6661 key.objectid = bytenr;
6663 key.type = BTRFS_EXTENT_REF_KEY;
6665 ret = btrfs_search_slot(trans, extent_root, &key, path, 0, 0);
6669 leaf = path->nodes[0];
6670 nritems = btrfs_header_nritems(leaf);
6671 if (path->slots[0] >= nritems) {
6672 ret = btrfs_next_leaf(extent_root, path);
6676 /* the extent was freed by someone */
6677 if (ref_path->lowest_level == level)
6679 btrfs_release_path(extent_root, path);
6682 leaf = path->nodes[0];
6685 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6686 if (found_key.objectid != bytenr ||
6687 found_key.type != BTRFS_EXTENT_REF_KEY) {
6688 /* the extent was freed by someone */
6689 if (ref_path->lowest_level == level) {
6693 btrfs_release_path(extent_root, path);
6697 ref = btrfs_item_ptr(leaf, path->slots[0],
6698 struct btrfs_extent_ref);
6699 ref_objectid = btrfs_ref_objectid(leaf, ref);
6700 if (ref_objectid < BTRFS_FIRST_FREE_OBJECTID) {
6702 level = (int)ref_objectid;
6703 BUG_ON(level >= BTRFS_MAX_LEVEL);
6704 ref_path->lowest_level = level;
6705 ref_path->current_level = level;
6706 ref_path->nodes[level] = bytenr;
6708 WARN_ON(ref_objectid != level);
6711 WARN_ON(level != -1);
6715 if (ref_path->lowest_level == level) {
6716 ref_path->owner_objectid = ref_objectid;
6717 ref_path->num_refs = btrfs_ref_num_refs(leaf, ref);
6721 * the block is tree root or the block isn't in reference
6724 if (found_key.objectid == found_key.offset ||
6725 is_cowonly_root(btrfs_ref_root(leaf, ref))) {
6726 ref_path->root_objectid = btrfs_ref_root(leaf, ref);
6727 ref_path->root_generation =
6728 btrfs_ref_generation(leaf, ref);
6730 /* special reference from the tree log */
6731 ref_path->nodes[0] = found_key.offset;
6732 ref_path->current_level = 0;
6739 BUG_ON(ref_path->nodes[level] != 0);
6740 ref_path->nodes[level] = found_key.offset;
6741 ref_path->current_level = level;
6744 * the reference was created in the running transaction,
6745 * no need to continue walking up.
6747 if (btrfs_ref_generation(leaf, ref) == trans->transid) {
6748 ref_path->root_objectid = btrfs_ref_root(leaf, ref);
6749 ref_path->root_generation =
6750 btrfs_ref_generation(leaf, ref);
6755 btrfs_release_path(extent_root, path);
6758 /* reached max tree level, but no tree root found. */
6761 btrfs_free_path(path);
6765 static int btrfs_first_ref_path(struct btrfs_trans_handle *trans,
6766 struct btrfs_root *extent_root,
6767 struct btrfs_ref_path *ref_path,
6770 memset(ref_path, 0, sizeof(*ref_path));
6771 ref_path->extent_start = extent_start;
6773 return __next_ref_path(trans, extent_root, ref_path, 1);
6776 static int btrfs_next_ref_path(struct btrfs_trans_handle *trans,
6777 struct btrfs_root *extent_root,
6778 struct btrfs_ref_path *ref_path)
6780 return __next_ref_path(trans, extent_root, ref_path, 0);
6783 static noinline int get_new_locations(struct inode *reloc_inode,
6784 struct btrfs_key *extent_key,
6785 u64 offset, int no_fragment,
6786 struct disk_extent **extents,
6789 struct btrfs_root *root = BTRFS_I(reloc_inode)->root;
6790 struct btrfs_path *path;
6791 struct btrfs_file_extent_item *fi;
6792 struct extent_buffer *leaf;
6793 struct disk_extent *exts = *extents;
6794 struct btrfs_key found_key;
6799 int max = *nr_extents;
6802 WARN_ON(!no_fragment && *extents);
6805 exts = kmalloc(sizeof(*exts) * max, GFP_NOFS);
6810 path = btrfs_alloc_path();
6813 cur_pos = extent_key->objectid - offset;
6814 last_byte = extent_key->objectid + extent_key->offset;
6815 ret = btrfs_lookup_file_extent(NULL, root, path, reloc_inode->i_ino,
6825 leaf = path->nodes[0];
6826 nritems = btrfs_header_nritems(leaf);
6827 if (path->slots[0] >= nritems) {
6828 ret = btrfs_next_leaf(root, path);
6833 leaf = path->nodes[0];
6836 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6837 if (found_key.offset != cur_pos ||
6838 found_key.type != BTRFS_EXTENT_DATA_KEY ||
6839 found_key.objectid != reloc_inode->i_ino)
6842 fi = btrfs_item_ptr(leaf, path->slots[0],
6843 struct btrfs_file_extent_item);
6844 if (btrfs_file_extent_type(leaf, fi) !=
6845 BTRFS_FILE_EXTENT_REG ||
6846 btrfs_file_extent_disk_bytenr(leaf, fi) == 0)
6850 struct disk_extent *old = exts;
6852 exts = kzalloc(sizeof(*exts) * max, GFP_NOFS);
6853 memcpy(exts, old, sizeof(*exts) * nr);
6854 if (old != *extents)
6858 exts[nr].disk_bytenr =
6859 btrfs_file_extent_disk_bytenr(leaf, fi);
6860 exts[nr].disk_num_bytes =
6861 btrfs_file_extent_disk_num_bytes(leaf, fi);
6862 exts[nr].offset = btrfs_file_extent_offset(leaf, fi);
6863 exts[nr].num_bytes = btrfs_file_extent_num_bytes(leaf, fi);
6864 exts[nr].ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
6865 exts[nr].compression = btrfs_file_extent_compression(leaf, fi);
6866 exts[nr].encryption = btrfs_file_extent_encryption(leaf, fi);
6867 exts[nr].other_encoding = btrfs_file_extent_other_encoding(leaf,
6869 BUG_ON(exts[nr].offset > 0);
6870 BUG_ON(exts[nr].compression || exts[nr].encryption);
6871 BUG_ON(exts[nr].num_bytes != exts[nr].disk_num_bytes);
6873 cur_pos += exts[nr].num_bytes;
6876 if (cur_pos + offset >= last_byte)
6886 BUG_ON(cur_pos + offset > last_byte);
6887 if (cur_pos + offset < last_byte) {
6893 btrfs_free_path(path);
6895 if (exts != *extents)
6904 static noinline int replace_one_extent(struct btrfs_trans_handle *trans,
6905 struct btrfs_root *root,
6906 struct btrfs_path *path,
6907 struct btrfs_key *extent_key,
6908 struct btrfs_key *leaf_key,
6909 struct btrfs_ref_path *ref_path,
6910 struct disk_extent *new_extents,
6913 struct extent_buffer *leaf;
6914 struct btrfs_file_extent_item *fi;
6915 struct inode *inode = NULL;
6916 struct btrfs_key key;
6921 u64 search_end = (u64)-1;
6924 int extent_locked = 0;
6928 memcpy(&key, leaf_key, sizeof(key));
6929 if (ref_path->owner_objectid != BTRFS_MULTIPLE_OBJECTIDS) {
6930 if (key.objectid < ref_path->owner_objectid ||
6931 (key.objectid == ref_path->owner_objectid &&
6932 key.type < BTRFS_EXTENT_DATA_KEY)) {
6933 key.objectid = ref_path->owner_objectid;
6934 key.type = BTRFS_EXTENT_DATA_KEY;
6940 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
6944 leaf = path->nodes[0];
6945 nritems = btrfs_header_nritems(leaf);
6947 if (extent_locked && ret > 0) {
6949 * the file extent item was modified by someone
6950 * before the extent got locked.
6952 unlock_extent(&BTRFS_I(inode)->io_tree, lock_start,
6953 lock_end, GFP_NOFS);
6957 if (path->slots[0] >= nritems) {
6958 if (++nr_scaned > 2)
6961 BUG_ON(extent_locked);
6962 ret = btrfs_next_leaf(root, path);
6967 leaf = path->nodes[0];
6968 nritems = btrfs_header_nritems(leaf);
6971 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
6973 if (ref_path->owner_objectid != BTRFS_MULTIPLE_OBJECTIDS) {
6974 if ((key.objectid > ref_path->owner_objectid) ||
6975 (key.objectid == ref_path->owner_objectid &&
6976 key.type > BTRFS_EXTENT_DATA_KEY) ||
6977 key.offset >= search_end)
6981 if (inode && key.objectid != inode->i_ino) {
6982 BUG_ON(extent_locked);
6983 btrfs_release_path(root, path);
6984 mutex_unlock(&inode->i_mutex);
6990 if (key.type != BTRFS_EXTENT_DATA_KEY) {
6995 fi = btrfs_item_ptr(leaf, path->slots[0],
6996 struct btrfs_file_extent_item);
6997 extent_type = btrfs_file_extent_type(leaf, fi);
6998 if ((extent_type != BTRFS_FILE_EXTENT_REG &&
6999 extent_type != BTRFS_FILE_EXTENT_PREALLOC) ||
7000 (btrfs_file_extent_disk_bytenr(leaf, fi) !=
7001 extent_key->objectid)) {
7007 num_bytes = btrfs_file_extent_num_bytes(leaf, fi);
7008 ext_offset = btrfs_file_extent_offset(leaf, fi);
7010 if (search_end == (u64)-1) {
7011 search_end = key.offset - ext_offset +
7012 btrfs_file_extent_ram_bytes(leaf, fi);
7015 if (!extent_locked) {
7016 lock_start = key.offset;
7017 lock_end = lock_start + num_bytes - 1;
7019 if (lock_start > key.offset ||
7020 lock_end + 1 < key.offset + num_bytes) {
7021 unlock_extent(&BTRFS_I(inode)->io_tree,
7022 lock_start, lock_end, GFP_NOFS);
7028 btrfs_release_path(root, path);
7030 inode = btrfs_iget_locked(root->fs_info->sb,
7031 key.objectid, root);
7032 if (inode->i_state & I_NEW) {
7033 BTRFS_I(inode)->root = root;
7034 BTRFS_I(inode)->location.objectid =
7036 BTRFS_I(inode)->location.type =
7037 BTRFS_INODE_ITEM_KEY;
7038 BTRFS_I(inode)->location.offset = 0;
7039 btrfs_read_locked_inode(inode);
7040 unlock_new_inode(inode);
7043 * some code call btrfs_commit_transaction while
7044 * holding the i_mutex, so we can't use mutex_lock
7047 if (is_bad_inode(inode) ||
7048 !mutex_trylock(&inode->i_mutex)) {
7051 key.offset = (u64)-1;
7056 if (!extent_locked) {
7057 struct btrfs_ordered_extent *ordered;
7059 btrfs_release_path(root, path);
7061 lock_extent(&BTRFS_I(inode)->io_tree, lock_start,
7062 lock_end, GFP_NOFS);
7063 ordered = btrfs_lookup_first_ordered_extent(inode,
7066 ordered->file_offset <= lock_end &&
7067 ordered->file_offset + ordered->len > lock_start) {
7068 unlock_extent(&BTRFS_I(inode)->io_tree,
7069 lock_start, lock_end, GFP_NOFS);
7070 btrfs_start_ordered_extent(inode, ordered, 1);
7071 btrfs_put_ordered_extent(ordered);
7072 key.offset += num_bytes;
7076 btrfs_put_ordered_extent(ordered);
7082 if (nr_extents == 1) {
7083 /* update extent pointer in place */
7084 btrfs_set_file_extent_disk_bytenr(leaf, fi,
7085 new_extents[0].disk_bytenr);
7086 btrfs_set_file_extent_disk_num_bytes(leaf, fi,
7087 new_extents[0].disk_num_bytes);
7088 btrfs_mark_buffer_dirty(leaf);
7090 btrfs_drop_extent_cache(inode, key.offset,
7091 key.offset + num_bytes - 1, 0);
7093 ret = btrfs_inc_extent_ref(trans, root,
7094 new_extents[0].disk_bytenr,
7095 new_extents[0].disk_num_bytes,
7097 root->root_key.objectid,
7102 ret = btrfs_free_extent(trans, root,
7103 extent_key->objectid,
7106 btrfs_header_owner(leaf),
7107 btrfs_header_generation(leaf),
7111 btrfs_release_path(root, path);
7112 key.offset += num_bytes;
7120 * drop old extent pointer at first, then insert the
7121 * new pointers one bye one
7123 btrfs_release_path(root, path);
7124 ret = btrfs_drop_extents(trans, root, inode, key.offset,
7125 key.offset + num_bytes,
7126 key.offset, &alloc_hint);
7129 for (i = 0; i < nr_extents; i++) {
7130 if (ext_offset >= new_extents[i].num_bytes) {
7131 ext_offset -= new_extents[i].num_bytes;
7134 extent_len = min(new_extents[i].num_bytes -
7135 ext_offset, num_bytes);
7137 ret = btrfs_insert_empty_item(trans, root,
7142 leaf = path->nodes[0];
7143 fi = btrfs_item_ptr(leaf, path->slots[0],
7144 struct btrfs_file_extent_item);
7145 btrfs_set_file_extent_generation(leaf, fi,
7147 btrfs_set_file_extent_type(leaf, fi,
7148 BTRFS_FILE_EXTENT_REG);
7149 btrfs_set_file_extent_disk_bytenr(leaf, fi,
7150 new_extents[i].disk_bytenr);
7151 btrfs_set_file_extent_disk_num_bytes(leaf, fi,
7152 new_extents[i].disk_num_bytes);
7153 btrfs_set_file_extent_ram_bytes(leaf, fi,
7154 new_extents[i].ram_bytes);
7156 btrfs_set_file_extent_compression(leaf, fi,
7157 new_extents[i].compression);
7158 btrfs_set_file_extent_encryption(leaf, fi,
7159 new_extents[i].encryption);
7160 btrfs_set_file_extent_other_encoding(leaf, fi,
7161 new_extents[i].other_encoding);
7163 btrfs_set_file_extent_num_bytes(leaf, fi,
7165 ext_offset += new_extents[i].offset;
7166 btrfs_set_file_extent_offset(leaf, fi,
7168 btrfs_mark_buffer_dirty(leaf);
7170 btrfs_drop_extent_cache(inode, key.offset,
7171 key.offset + extent_len - 1, 0);
7173 ret = btrfs_inc_extent_ref(trans, root,
7174 new_extents[i].disk_bytenr,
7175 new_extents[i].disk_num_bytes,
7177 root->root_key.objectid,
7178 trans->transid, key.objectid);
7180 btrfs_release_path(root, path);
7182 inode_add_bytes(inode, extent_len);
7185 num_bytes -= extent_len;
7186 key.offset += extent_len;
7191 BUG_ON(i >= nr_extents);
7195 if (extent_locked) {
7196 unlock_extent(&BTRFS_I(inode)->io_tree, lock_start,
7197 lock_end, GFP_NOFS);
7201 if (ref_path->owner_objectid != BTRFS_MULTIPLE_OBJECTIDS &&
7202 key.offset >= search_end)
7209 btrfs_release_path(root, path);
7211 mutex_unlock(&inode->i_mutex);
7212 if (extent_locked) {
7213 unlock_extent(&BTRFS_I(inode)->io_tree, lock_start,
7214 lock_end, GFP_NOFS);
7221 int btrfs_reloc_tree_cache_ref(struct btrfs_trans_handle *trans,
7222 struct btrfs_root *root,
7223 struct extent_buffer *buf, u64 orig_start)
7228 BUG_ON(btrfs_header_generation(buf) != trans->transid);
7229 BUG_ON(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID);
7231 level = btrfs_header_level(buf);
7233 struct btrfs_leaf_ref *ref;
7234 struct btrfs_leaf_ref *orig_ref;
7236 orig_ref = btrfs_lookup_leaf_ref(root, orig_start);
7240 ref = btrfs_alloc_leaf_ref(root, orig_ref->nritems);
7242 btrfs_free_leaf_ref(root, orig_ref);
7246 ref->nritems = orig_ref->nritems;
7247 memcpy(ref->extents, orig_ref->extents,
7248 sizeof(ref->extents[0]) * ref->nritems);
7250 btrfs_free_leaf_ref(root, orig_ref);
7252 ref->root_gen = trans->transid;
7253 ref->bytenr = buf->start;
7254 ref->owner = btrfs_header_owner(buf);
7255 ref->generation = btrfs_header_generation(buf);
7257 ret = btrfs_add_leaf_ref(root, ref, 0);
7259 btrfs_free_leaf_ref(root, ref);
7264 static noinline int invalidate_extent_cache(struct btrfs_root *root,
7265 struct extent_buffer *leaf,
7266 struct btrfs_block_group_cache *group,
7267 struct btrfs_root *target_root)
7269 struct btrfs_key key;
7270 struct inode *inode = NULL;
7271 struct btrfs_file_extent_item *fi;
7272 struct extent_state *cached_state = NULL;
7274 u64 skip_objectid = 0;
7278 nritems = btrfs_header_nritems(leaf);
7279 for (i = 0; i < nritems; i++) {
7280 btrfs_item_key_to_cpu(leaf, &key, i);
7281 if (key.objectid == skip_objectid ||
7282 key.type != BTRFS_EXTENT_DATA_KEY)
7284 fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item);
7285 if (btrfs_file_extent_type(leaf, fi) ==
7286 BTRFS_FILE_EXTENT_INLINE)
7288 if (btrfs_file_extent_disk_bytenr(leaf, fi) == 0)
7290 if (!inode || inode->i_ino != key.objectid) {
7292 inode = btrfs_ilookup(target_root->fs_info->sb,
7293 key.objectid, target_root, 1);
7296 skip_objectid = key.objectid;
7299 num_bytes = btrfs_file_extent_num_bytes(leaf, fi);
7301 lock_extent_bits(&BTRFS_I(inode)->io_tree, key.offset,
7302 key.offset + num_bytes - 1, 0, &cached_state,
7304 btrfs_drop_extent_cache(inode, key.offset,
7305 key.offset + num_bytes - 1, 1);
7306 unlock_extent_cached(&BTRFS_I(inode)->io_tree, key.offset,
7307 key.offset + num_bytes - 1, &cached_state,
7315 static noinline int replace_extents_in_leaf(struct btrfs_trans_handle *trans,
7316 struct btrfs_root *root,
7317 struct extent_buffer *leaf,
7318 struct btrfs_block_group_cache *group,
7319 struct inode *reloc_inode)
7321 struct btrfs_key key;
7322 struct btrfs_key extent_key;
7323 struct btrfs_file_extent_item *fi;
7324 struct btrfs_leaf_ref *ref;
7325 struct disk_extent *new_extent;
7334 new_extent = kmalloc(sizeof(*new_extent), GFP_NOFS);
7335 BUG_ON(!new_extent);
7337 ref = btrfs_lookup_leaf_ref(root, leaf->start);
7341 nritems = btrfs_header_nritems(leaf);
7342 for (i = 0; i < nritems; i++) {
7343 btrfs_item_key_to_cpu(leaf, &key, i);
7344 if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY)
7346 fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item);
7347 if (btrfs_file_extent_type(leaf, fi) ==
7348 BTRFS_FILE_EXTENT_INLINE)
7350 bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
7351 num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi);
7356 if (bytenr >= group->key.objectid + group->key.offset ||
7357 bytenr + num_bytes <= group->key.objectid)
7360 extent_key.objectid = bytenr;
7361 extent_key.offset = num_bytes;
7362 extent_key.type = BTRFS_EXTENT_ITEM_KEY;
7364 ret = get_new_locations(reloc_inode, &extent_key,
7365 group->key.objectid, 1,
7366 &new_extent, &nr_extent);
7371 BUG_ON(ref->extents[ext_index].bytenr != bytenr);
7372 BUG_ON(ref->extents[ext_index].num_bytes != num_bytes);
7373 ref->extents[ext_index].bytenr = new_extent->disk_bytenr;
7374 ref->extents[ext_index].num_bytes = new_extent->disk_num_bytes;
7376 btrfs_set_file_extent_disk_bytenr(leaf, fi,
7377 new_extent->disk_bytenr);
7378 btrfs_set_file_extent_disk_num_bytes(leaf, fi,
7379 new_extent->disk_num_bytes);
7380 btrfs_mark_buffer_dirty(leaf);
7382 ret = btrfs_inc_extent_ref(trans, root,
7383 new_extent->disk_bytenr,
7384 new_extent->disk_num_bytes,
7386 root->root_key.objectid,
7387 trans->transid, key.objectid);
7390 ret = btrfs_free_extent(trans, root,
7391 bytenr, num_bytes, leaf->start,
7392 btrfs_header_owner(leaf),
7393 btrfs_header_generation(leaf),
7399 BUG_ON(ext_index + 1 != ref->nritems);
7400 btrfs_free_leaf_ref(root, ref);
7404 int btrfs_free_reloc_root(struct btrfs_trans_handle *trans,
7405 struct btrfs_root *root)
7407 struct btrfs_root *reloc_root;
7410 if (root->reloc_root) {
7411 reloc_root = root->reloc_root;
7412 root->reloc_root = NULL;
7413 list_add(&reloc_root->dead_list,
7414 &root->fs_info->dead_reloc_roots);
7416 btrfs_set_root_bytenr(&reloc_root->root_item,
7417 reloc_root->node->start);
7418 btrfs_set_root_level(&root->root_item,
7419 btrfs_header_level(reloc_root->node));
7420 memset(&reloc_root->root_item.drop_progress, 0,
7421 sizeof(struct btrfs_disk_key));
7422 reloc_root->root_item.drop_level = 0;
7424 ret = btrfs_update_root(trans, root->fs_info->tree_root,
7425 &reloc_root->root_key,
7426 &reloc_root->root_item);
7432 int btrfs_drop_dead_reloc_roots(struct btrfs_root *root)
7434 struct btrfs_trans_handle *trans;
7435 struct btrfs_root *reloc_root;
7436 struct btrfs_root *prev_root = NULL;
7437 struct list_head dead_roots;
7441 INIT_LIST_HEAD(&dead_roots);
7442 list_splice_init(&root->fs_info->dead_reloc_roots, &dead_roots);
7444 while (!list_empty(&dead_roots)) {
7445 reloc_root = list_entry(dead_roots.prev,
7446 struct btrfs_root, dead_list);
7447 list_del_init(&reloc_root->dead_list);
7449 BUG_ON(reloc_root->commit_root != NULL);
7451 trans = btrfs_join_transaction(root, 1);
7454 mutex_lock(&root->fs_info->drop_mutex);
7455 ret = btrfs_drop_snapshot(trans, reloc_root);
7458 mutex_unlock(&root->fs_info->drop_mutex);
7460 nr = trans->blocks_used;
7461 ret = btrfs_end_transaction(trans, root);
7463 btrfs_btree_balance_dirty(root, nr);
7466 free_extent_buffer(reloc_root->node);
7468 ret = btrfs_del_root(trans, root->fs_info->tree_root,
7469 &reloc_root->root_key);
7471 mutex_unlock(&root->fs_info->drop_mutex);
7473 nr = trans->blocks_used;
7474 ret = btrfs_end_transaction(trans, root);
7476 btrfs_btree_balance_dirty(root, nr);
7479 prev_root = reloc_root;
7482 btrfs_remove_leaf_refs(prev_root, (u64)-1, 0);
7488 int btrfs_add_dead_reloc_root(struct btrfs_root *root)
7490 list_add(&root->dead_list, &root->fs_info->dead_reloc_roots);
7494 int btrfs_cleanup_reloc_trees(struct btrfs_root *root)
7496 struct btrfs_root *reloc_root;
7497 struct btrfs_trans_handle *trans;
7498 struct btrfs_key location;
7502 mutex_lock(&root->fs_info->tree_reloc_mutex);
7503 ret = btrfs_find_dead_roots(root, BTRFS_TREE_RELOC_OBJECTID, NULL);
7505 found = !list_empty(&root->fs_info->dead_reloc_roots);
7506 mutex_unlock(&root->fs_info->tree_reloc_mutex);
7509 trans = btrfs_start_transaction(root, 1);
7511 ret = btrfs_commit_transaction(trans, root);
7515 location.objectid = BTRFS_DATA_RELOC_TREE_OBJECTID;
7516 location.offset = (u64)-1;
7517 location.type = BTRFS_ROOT_ITEM_KEY;
7519 reloc_root = btrfs_read_fs_root_no_name(root->fs_info, &location);
7520 BUG_ON(!reloc_root);
7521 btrfs_orphan_cleanup(reloc_root);
7525 static noinline int init_reloc_tree(struct btrfs_trans_handle *trans,
7526 struct btrfs_root *root)
7528 struct btrfs_root *reloc_root;
7529 struct extent_buffer *eb;
7530 struct btrfs_root_item *root_item;
7531 struct btrfs_key root_key;
7534 BUG_ON(!root->ref_cows);
7535 if (root->reloc_root)
7538 root_item = kmalloc(sizeof(*root_item), GFP_NOFS);
7541 ret = btrfs_copy_root(trans, root, root->commit_root,
7542 &eb, BTRFS_TREE_RELOC_OBJECTID);
7545 root_key.objectid = BTRFS_TREE_RELOC_OBJECTID;
7546 root_key.offset = root->root_key.objectid;
7547 root_key.type = BTRFS_ROOT_ITEM_KEY;
7549 memcpy(root_item, &root->root_item, sizeof(root_item));
7550 btrfs_set_root_refs(root_item, 0);
7551 btrfs_set_root_bytenr(root_item, eb->start);
7552 btrfs_set_root_level(root_item, btrfs_header_level(eb));
7553 btrfs_set_root_generation(root_item, trans->transid);
7555 btrfs_tree_unlock(eb);
7556 free_extent_buffer(eb);
7558 ret = btrfs_insert_root(trans, root->fs_info->tree_root,
7559 &root_key, root_item);
7563 reloc_root = btrfs_read_fs_root_no_radix(root->fs_info->tree_root,
7565 BUG_ON(!reloc_root);
7566 reloc_root->last_trans = trans->transid;
7567 reloc_root->commit_root = NULL;
7568 reloc_root->ref_tree = &root->fs_info->reloc_ref_tree;
7570 root->reloc_root = reloc_root;
7575 * Core function of space balance.
7577 * The idea is using reloc trees to relocate tree blocks in reference
7578 * counted roots. There is one reloc tree for each subvol, and all
7579 * reloc trees share same root key objectid. Reloc trees are snapshots
7580 * of the latest committed roots of subvols (root->commit_root).
7582 * To relocate a tree block referenced by a subvol, there are two steps.
7583 * COW the block through subvol's reloc tree, then update block pointer
7584 * in the subvol to point to the new block. Since all reloc trees share
7585 * same root key objectid, doing special handing for tree blocks owned
7586 * by them is easy. Once a tree block has been COWed in one reloc tree,
7587 * we can use the resulting new block directly when the same block is
7588 * required to COW again through other reloc trees. By this way, relocated
7589 * tree blocks are shared between reloc trees, so they are also shared
7592 static noinline int relocate_one_path(struct btrfs_trans_handle *trans,
7593 struct btrfs_root *root,
7594 struct btrfs_path *path,
7595 struct btrfs_key *first_key,
7596 struct btrfs_ref_path *ref_path,
7597 struct btrfs_block_group_cache *group,
7598 struct inode *reloc_inode)
7600 struct btrfs_root *reloc_root;
7601 struct extent_buffer *eb = NULL;
7602 struct btrfs_key *keys;
7606 int lowest_level = 0;
7609 if (ref_path->owner_objectid < BTRFS_FIRST_FREE_OBJECTID)
7610 lowest_level = ref_path->owner_objectid;
7612 if (!root->ref_cows) {
7613 path->lowest_level = lowest_level;
7614 ret = btrfs_search_slot(trans, root, first_key, path, 0, 1);
7616 path->lowest_level = 0;
7617 btrfs_release_path(root, path);
7621 mutex_lock(&root->fs_info->tree_reloc_mutex);
7622 ret = init_reloc_tree(trans, root);
7624 reloc_root = root->reloc_root;
7626 shared_level = ref_path->shared_level;
7627 ref_path->shared_level = BTRFS_MAX_LEVEL - 1;
7629 keys = ref_path->node_keys;
7630 nodes = ref_path->new_nodes;
7631 memset(&keys[shared_level + 1], 0,
7632 sizeof(*keys) * (BTRFS_MAX_LEVEL - shared_level - 1));
7633 memset(&nodes[shared_level + 1], 0,
7634 sizeof(*nodes) * (BTRFS_MAX_LEVEL - shared_level - 1));
7636 if (nodes[lowest_level] == 0) {
7637 path->lowest_level = lowest_level;
7638 ret = btrfs_search_slot(trans, reloc_root, first_key, path,
7641 for (level = lowest_level; level < BTRFS_MAX_LEVEL; level++) {
7642 eb = path->nodes[level];
7643 if (!eb || eb == reloc_root->node)
7645 nodes[level] = eb->start;
7647 btrfs_item_key_to_cpu(eb, &keys[level], 0);
7649 btrfs_node_key_to_cpu(eb, &keys[level], 0);
7652 ref_path->owner_objectid >= BTRFS_FIRST_FREE_OBJECTID) {
7653 eb = path->nodes[0];
7654 ret = replace_extents_in_leaf(trans, reloc_root, eb,
7655 group, reloc_inode);
7658 btrfs_release_path(reloc_root, path);
7660 ret = btrfs_merge_path(trans, reloc_root, keys, nodes,
7666 * replace tree blocks in the fs tree with tree blocks in
7669 ret = btrfs_merge_path(trans, root, keys, nodes, lowest_level);
7672 if (ref_path->owner_objectid >= BTRFS_FIRST_FREE_OBJECTID) {
7673 ret = btrfs_search_slot(trans, reloc_root, first_key, path,
7676 extent_buffer_get(path->nodes[0]);
7677 eb = path->nodes[0];
7678 btrfs_release_path(reloc_root, path);
7679 ret = invalidate_extent_cache(reloc_root, eb, group, root);
7681 free_extent_buffer(eb);
7684 mutex_unlock(&root->fs_info->tree_reloc_mutex);
7685 path->lowest_level = 0;
7689 static noinline int relocate_tree_block(struct btrfs_trans_handle *trans,
7690 struct btrfs_root *root,
7691 struct btrfs_path *path,
7692 struct btrfs_key *first_key,
7693 struct btrfs_ref_path *ref_path)
7697 ret = relocate_one_path(trans, root, path, first_key,
7698 ref_path, NULL, NULL);
7704 static noinline int del_extent_zero(struct btrfs_trans_handle *trans,
7705 struct btrfs_root *extent_root,
7706 struct btrfs_path *path,
7707 struct btrfs_key *extent_key)
7711 ret = btrfs_search_slot(trans, extent_root, extent_key, path, -1, 1);
7714 ret = btrfs_del_item(trans, extent_root, path);
7716 btrfs_release_path(extent_root, path);
7720 static noinline struct btrfs_root *read_ref_root(struct btrfs_fs_info *fs_info,
7721 struct btrfs_ref_path *ref_path)
7723 struct btrfs_key root_key;
7725 root_key.objectid = ref_path->root_objectid;
7726 root_key.type = BTRFS_ROOT_ITEM_KEY;
7727 if (is_cowonly_root(ref_path->root_objectid))
7728 root_key.offset = 0;
7730 root_key.offset = (u64)-1;
7732 return btrfs_read_fs_root_no_name(fs_info, &root_key);
7735 static noinline int relocate_one_extent(struct btrfs_root *extent_root,
7736 struct btrfs_path *path,
7737 struct btrfs_key *extent_key,
7738 struct btrfs_block_group_cache *group,
7739 struct inode *reloc_inode, int pass)
7741 struct btrfs_trans_handle *trans;
7742 struct btrfs_root *found_root;
7743 struct btrfs_ref_path *ref_path = NULL;
7744 struct disk_extent *new_extents = NULL;
7749 struct btrfs_key first_key;
7753 trans = btrfs_start_transaction(extent_root, 1);
7756 if (extent_key->objectid == 0) {
7757 ret = del_extent_zero(trans, extent_root, path, extent_key);
7761 ref_path = kmalloc(sizeof(*ref_path), GFP_NOFS);
7767 for (loops = 0; ; loops++) {
7769 ret = btrfs_first_ref_path(trans, extent_root, ref_path,
7770 extent_key->objectid);
7772 ret = btrfs_next_ref_path(trans, extent_root, ref_path);
7779 if (ref_path->root_objectid == BTRFS_TREE_LOG_OBJECTID ||
7780 ref_path->root_objectid == BTRFS_TREE_RELOC_OBJECTID)
7783 found_root = read_ref_root(extent_root->fs_info, ref_path);
7784 BUG_ON(!found_root);
7786 * for reference counted tree, only process reference paths
7787 * rooted at the latest committed root.
7789 if (found_root->ref_cows &&
7790 ref_path->root_generation != found_root->root_key.offset)
7793 if (ref_path->owner_objectid >= BTRFS_FIRST_FREE_OBJECTID) {
7796 * copy data extents to new locations
7798 u64 group_start = group->key.objectid;
7799 ret = relocate_data_extent(reloc_inode,
7808 level = ref_path->owner_objectid;
7811 if (prev_block != ref_path->nodes[level]) {
7812 struct extent_buffer *eb;
7813 u64 block_start = ref_path->nodes[level];
7814 u64 block_size = btrfs_level_size(found_root, level);
7816 eb = read_tree_block(found_root, block_start,
7818 btrfs_tree_lock(eb);
7819 BUG_ON(level != btrfs_header_level(eb));
7822 btrfs_item_key_to_cpu(eb, &first_key, 0);
7824 btrfs_node_key_to_cpu(eb, &first_key, 0);
7826 btrfs_tree_unlock(eb);
7827 free_extent_buffer(eb);
7828 prev_block = block_start;
7831 mutex_lock(&extent_root->fs_info->trans_mutex);
7832 btrfs_record_root_in_trans(found_root);
7833 mutex_unlock(&extent_root->fs_info->trans_mutex);
7834 if (ref_path->owner_objectid >= BTRFS_FIRST_FREE_OBJECTID) {
7836 * try to update data extent references while
7837 * keeping metadata shared between snapshots.
7840 ret = relocate_one_path(trans, found_root,
7841 path, &first_key, ref_path,
7842 group, reloc_inode);
7848 * use fallback method to process the remaining
7852 u64 group_start = group->key.objectid;
7853 new_extents = kmalloc(sizeof(*new_extents),
7856 ret = get_new_locations(reloc_inode,
7864 ret = replace_one_extent(trans, found_root,
7866 &first_key, ref_path,
7867 new_extents, nr_extents);
7869 ret = relocate_tree_block(trans, found_root, path,
7870 &first_key, ref_path);
7877 btrfs_end_transaction(trans, extent_root);
7884 static u64 update_block_group_flags(struct btrfs_root *root, u64 flags)
7887 u64 stripped = BTRFS_BLOCK_GROUP_RAID0 |
7888 BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID10;
7890 num_devices = root->fs_info->fs_devices->rw_devices;
7891 if (num_devices == 1) {
7892 stripped |= BTRFS_BLOCK_GROUP_DUP;
7893 stripped = flags & ~stripped;
7895 /* turn raid0 into single device chunks */
7896 if (flags & BTRFS_BLOCK_GROUP_RAID0)
7899 /* turn mirroring into duplication */
7900 if (flags & (BTRFS_BLOCK_GROUP_RAID1 |
7901 BTRFS_BLOCK_GROUP_RAID10))
7902 return stripped | BTRFS_BLOCK_GROUP_DUP;
7905 /* they already had raid on here, just return */
7906 if (flags & stripped)
7909 stripped |= BTRFS_BLOCK_GROUP_DUP;
7910 stripped = flags & ~stripped;
7912 /* switch duplicated blocks with raid1 */
7913 if (flags & BTRFS_BLOCK_GROUP_DUP)
7914 return stripped | BTRFS_BLOCK_GROUP_RAID1;
7916 /* turn single device chunks into raid0 */
7917 return stripped | BTRFS_BLOCK_GROUP_RAID0;
7922 static int set_block_group_ro(struct btrfs_block_group_cache *cache)
7924 struct btrfs_space_info *sinfo = cache->space_info;
7931 spin_lock(&sinfo->lock);
7932 spin_lock(&cache->lock);
7933 num_bytes = cache->key.offset - cache->reserved - cache->pinned -
7934 cache->bytes_super - btrfs_block_group_used(&cache->item);
7936 if (sinfo->bytes_used + sinfo->bytes_reserved + sinfo->bytes_pinned +
7937 sinfo->bytes_may_use + sinfo->bytes_readonly +
7938 cache->reserved_pinned + num_bytes < sinfo->total_bytes) {
7939 sinfo->bytes_readonly += num_bytes;
7940 sinfo->bytes_reserved += cache->reserved_pinned;
7941 cache->reserved_pinned = 0;
7945 spin_unlock(&cache->lock);
7946 spin_unlock(&sinfo->lock);
7950 int btrfs_set_block_group_ro(struct btrfs_root *root,
7951 struct btrfs_block_group_cache *cache)
7954 struct btrfs_trans_handle *trans;
7960 trans = btrfs_join_transaction(root, 1);
7961 BUG_ON(IS_ERR(trans));
7963 alloc_flags = update_block_group_flags(root, cache->flags);
7964 if (alloc_flags != cache->flags)
7965 do_chunk_alloc(trans, root, 2 * 1024 * 1024, alloc_flags, 1);
7967 ret = set_block_group_ro(cache);
7970 alloc_flags = get_alloc_profile(root, cache->space_info->flags);
7971 ret = do_chunk_alloc(trans, root, 2 * 1024 * 1024, alloc_flags, 1);
7974 ret = set_block_group_ro(cache);
7976 btrfs_end_transaction(trans, root);
7980 int btrfs_set_block_group_rw(struct btrfs_root *root,
7981 struct btrfs_block_group_cache *cache)
7983 struct btrfs_space_info *sinfo = cache->space_info;
7988 spin_lock(&sinfo->lock);
7989 spin_lock(&cache->lock);
7990 num_bytes = cache->key.offset - cache->reserved - cache->pinned -
7991 cache->bytes_super - btrfs_block_group_used(&cache->item);
7992 sinfo->bytes_readonly -= num_bytes;
7994 spin_unlock(&cache->lock);
7995 spin_unlock(&sinfo->lock);
8000 * checks to see if its even possible to relocate this block group.
8002 * @return - -1 if it's not a good idea to relocate this block group, 0 if its
8003 * ok to go ahead and try.
8005 int btrfs_can_relocate(struct btrfs_root *root, u64 bytenr)
8007 struct btrfs_block_group_cache *block_group;
8008 struct btrfs_space_info *space_info;
8009 struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices;
8010 struct btrfs_device *device;
8014 block_group = btrfs_lookup_block_group(root->fs_info, bytenr);
8016 /* odd, couldn't find the block group, leave it alone */
8020 /* no bytes used, we're good */
8021 if (!btrfs_block_group_used(&block_group->item))
8024 space_info = block_group->space_info;
8025 spin_lock(&space_info->lock);
8027 full = space_info->full;
8030 * if this is the last block group we have in this space, we can't
8031 * relocate it unless we're able to allocate a new chunk below.
8033 * Otherwise, we need to make sure we have room in the space to handle
8034 * all of the extents from this block group. If we can, we're good
8036 if ((space_info->total_bytes != block_group->key.offset) &&
8037 (space_info->bytes_used + space_info->bytes_reserved +
8038 space_info->bytes_pinned + space_info->bytes_readonly +
8039 btrfs_block_group_used(&block_group->item) <
8040 space_info->total_bytes)) {
8041 spin_unlock(&space_info->lock);
8044 spin_unlock(&space_info->lock);
8047 * ok we don't have enough space, but maybe we have free space on our
8048 * devices to allocate new chunks for relocation, so loop through our
8049 * alloc devices and guess if we have enough space. However, if we
8050 * were marked as full, then we know there aren't enough chunks, and we
8057 mutex_lock(&root->fs_info->chunk_mutex);
8058 list_for_each_entry(device, &fs_devices->alloc_list, dev_alloc_list) {
8059 u64 min_free = btrfs_block_group_used(&block_group->item);
8060 u64 dev_offset, max_avail;
8063 * check to make sure we can actually find a chunk with enough
8064 * space to fit our block group in.
8066 if (device->total_bytes > device->bytes_used + min_free) {
8067 ret = find_free_dev_extent(NULL, device, min_free,
8068 &dev_offset, &max_avail);
8074 mutex_unlock(&root->fs_info->chunk_mutex);
8076 btrfs_put_block_group(block_group);
8080 static int find_first_block_group(struct btrfs_root *root,
8081 struct btrfs_path *path, struct btrfs_key *key)
8084 struct btrfs_key found_key;
8085 struct extent_buffer *leaf;
8088 ret = btrfs_search_slot(NULL, root, key, path, 0, 0);
8093 slot = path->slots[0];
8094 leaf = path->nodes[0];
8095 if (slot >= btrfs_header_nritems(leaf)) {
8096 ret = btrfs_next_leaf(root, path);
8103 btrfs_item_key_to_cpu(leaf, &found_key, slot);
8105 if (found_key.objectid >= key->objectid &&
8106 found_key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) {
8116 void btrfs_put_block_group_cache(struct btrfs_fs_info *info)
8118 struct btrfs_block_group_cache *block_group;
8122 struct inode *inode;
8124 block_group = btrfs_lookup_first_block_group(info, last);
8125 while (block_group) {
8126 spin_lock(&block_group->lock);
8127 if (block_group->iref)
8129 spin_unlock(&block_group->lock);
8130 block_group = next_block_group(info->tree_root,
8140 inode = block_group->inode;
8141 block_group->iref = 0;
8142 block_group->inode = NULL;
8143 spin_unlock(&block_group->lock);
8145 last = block_group->key.objectid + block_group->key.offset;
8146 btrfs_put_block_group(block_group);
8150 int btrfs_free_block_groups(struct btrfs_fs_info *info)
8152 struct btrfs_block_group_cache *block_group;
8153 struct btrfs_space_info *space_info;
8154 struct btrfs_caching_control *caching_ctl;
8157 down_write(&info->extent_commit_sem);
8158 while (!list_empty(&info->caching_block_groups)) {
8159 caching_ctl = list_entry(info->caching_block_groups.next,
8160 struct btrfs_caching_control, list);
8161 list_del(&caching_ctl->list);
8162 put_caching_control(caching_ctl);
8164 up_write(&info->extent_commit_sem);
8166 spin_lock(&info->block_group_cache_lock);
8167 while ((n = rb_last(&info->block_group_cache_tree)) != NULL) {
8168 block_group = rb_entry(n, struct btrfs_block_group_cache,
8170 rb_erase(&block_group->cache_node,
8171 &info->block_group_cache_tree);
8172 spin_unlock(&info->block_group_cache_lock);
8174 down_write(&block_group->space_info->groups_sem);
8175 list_del(&block_group->list);
8176 up_write(&block_group->space_info->groups_sem);
8178 if (block_group->cached == BTRFS_CACHE_STARTED)
8179 wait_block_group_cache_done(block_group);
8181 btrfs_remove_free_space_cache(block_group);
8182 btrfs_put_block_group(block_group);
8184 spin_lock(&info->block_group_cache_lock);
8186 spin_unlock(&info->block_group_cache_lock);
8188 /* now that all the block groups are freed, go through and
8189 * free all the space_info structs. This is only called during
8190 * the final stages of unmount, and so we know nobody is
8191 * using them. We call synchronize_rcu() once before we start,
8192 * just to be on the safe side.
8196 release_global_block_rsv(info);
8198 while(!list_empty(&info->space_info)) {
8199 space_info = list_entry(info->space_info.next,
8200 struct btrfs_space_info,
8202 if (space_info->bytes_pinned > 0 ||
8203 space_info->bytes_reserved > 0) {
8205 dump_space_info(space_info, 0, 0);
8207 list_del(&space_info->list);
8213 static void __link_block_group(struct btrfs_space_info *space_info,
8214 struct btrfs_block_group_cache *cache)
8216 int index = get_block_group_index(cache);
8218 down_write(&space_info->groups_sem);
8219 list_add_tail(&cache->list, &space_info->block_groups[index]);
8220 up_write(&space_info->groups_sem);
8223 int btrfs_read_block_groups(struct btrfs_root *root)
8225 struct btrfs_path *path;
8227 struct btrfs_block_group_cache *cache;
8228 struct btrfs_fs_info *info = root->fs_info;
8229 struct btrfs_space_info *space_info;
8230 struct btrfs_key key;
8231 struct btrfs_key found_key;
8232 struct extent_buffer *leaf;
8236 root = info->extent_root;
8239 btrfs_set_key_type(&key, BTRFS_BLOCK_GROUP_ITEM_KEY);
8240 path = btrfs_alloc_path();
8244 cache_gen = btrfs_super_cache_generation(&root->fs_info->super_copy);
8245 if (cache_gen != 0 &&
8246 btrfs_super_generation(&root->fs_info->super_copy) != cache_gen)
8248 if (btrfs_test_opt(root, CLEAR_CACHE))
8250 if (!btrfs_test_opt(root, SPACE_CACHE) && cache_gen)
8251 printk(KERN_INFO "btrfs: disk space caching is enabled\n");
8254 ret = find_first_block_group(root, path, &key);
8260 leaf = path->nodes[0];
8261 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
8262 cache = kzalloc(sizeof(*cache), GFP_NOFS);
8268 atomic_set(&cache->count, 1);
8269 spin_lock_init(&cache->lock);
8270 spin_lock_init(&cache->tree_lock);
8271 cache->fs_info = info;
8272 INIT_LIST_HEAD(&cache->list);
8273 INIT_LIST_HEAD(&cache->cluster_list);
8276 cache->disk_cache_state = BTRFS_DC_CLEAR;
8279 * we only want to have 32k of ram per block group for keeping
8280 * track of free space, and if we pass 1/2 of that we want to
8281 * start converting things over to using bitmaps
8283 cache->extents_thresh = ((1024 * 32) / 2) /
8284 sizeof(struct btrfs_free_space);
8286 read_extent_buffer(leaf, &cache->item,
8287 btrfs_item_ptr_offset(leaf, path->slots[0]),
8288 sizeof(cache->item));
8289 memcpy(&cache->key, &found_key, sizeof(found_key));
8291 key.objectid = found_key.objectid + found_key.offset;
8292 btrfs_release_path(root, path);
8293 cache->flags = btrfs_block_group_flags(&cache->item);
8294 cache->sectorsize = root->sectorsize;
8297 * check for two cases, either we are full, and therefore
8298 * don't need to bother with the caching work since we won't
8299 * find any space, or we are empty, and we can just add all
8300 * the space in and be done with it. This saves us _alot_ of
8301 * time, particularly in the full case.
8303 if (found_key.offset == btrfs_block_group_used(&cache->item)) {
8304 exclude_super_stripes(root, cache);
8305 cache->last_byte_to_unpin = (u64)-1;
8306 cache->cached = BTRFS_CACHE_FINISHED;
8307 free_excluded_extents(root, cache);
8308 } else if (btrfs_block_group_used(&cache->item) == 0) {
8309 exclude_super_stripes(root, cache);
8310 cache->last_byte_to_unpin = (u64)-1;
8311 cache->cached = BTRFS_CACHE_FINISHED;
8312 add_new_free_space(cache, root->fs_info,
8314 found_key.objectid +
8316 free_excluded_extents(root, cache);
8319 ret = update_space_info(info, cache->flags, found_key.offset,
8320 btrfs_block_group_used(&cache->item),
8323 cache->space_info = space_info;
8324 spin_lock(&cache->space_info->lock);
8325 cache->space_info->bytes_readonly += cache->bytes_super;
8326 spin_unlock(&cache->space_info->lock);
8328 __link_block_group(space_info, cache);
8330 ret = btrfs_add_block_group_cache(root->fs_info, cache);
8333 set_avail_alloc_bits(root->fs_info, cache->flags);
8334 if (btrfs_chunk_readonly(root, cache->key.objectid))
8335 set_block_group_ro(cache);
8338 list_for_each_entry_rcu(space_info, &root->fs_info->space_info, list) {
8339 if (!(get_alloc_profile(root, space_info->flags) &
8340 (BTRFS_BLOCK_GROUP_RAID10 |
8341 BTRFS_BLOCK_GROUP_RAID1 |
8342 BTRFS_BLOCK_GROUP_DUP)))
8345 * avoid allocating from un-mirrored block group if there are
8346 * mirrored block groups.
8348 list_for_each_entry(cache, &space_info->block_groups[3], list)
8349 set_block_group_ro(cache);
8350 list_for_each_entry(cache, &space_info->block_groups[4], list)
8351 set_block_group_ro(cache);
8354 init_global_block_rsv(info);
8357 btrfs_free_path(path);
8361 int btrfs_make_block_group(struct btrfs_trans_handle *trans,
8362 struct btrfs_root *root, u64 bytes_used,
8363 u64 type, u64 chunk_objectid, u64 chunk_offset,
8367 struct btrfs_root *extent_root;
8368 struct btrfs_block_group_cache *cache;
8370 extent_root = root->fs_info->extent_root;
8372 root->fs_info->last_trans_log_full_commit = trans->transid;
8374 cache = kzalloc(sizeof(*cache), GFP_NOFS);
8378 cache->key.objectid = chunk_offset;
8379 cache->key.offset = size;
8380 cache->key.type = BTRFS_BLOCK_GROUP_ITEM_KEY;
8381 cache->sectorsize = root->sectorsize;
8382 cache->fs_info = root->fs_info;
8385 * we only want to have 32k of ram per block group for keeping track
8386 * of free space, and if we pass 1/2 of that we want to start
8387 * converting things over to using bitmaps
8389 cache->extents_thresh = ((1024 * 32) / 2) /
8390 sizeof(struct btrfs_free_space);
8391 atomic_set(&cache->count, 1);
8392 spin_lock_init(&cache->lock);
8393 spin_lock_init(&cache->tree_lock);
8394 INIT_LIST_HEAD(&cache->list);
8395 INIT_LIST_HEAD(&cache->cluster_list);
8397 btrfs_set_block_group_used(&cache->item, bytes_used);
8398 btrfs_set_block_group_chunk_objectid(&cache->item, chunk_objectid);
8399 cache->flags = type;
8400 btrfs_set_block_group_flags(&cache->item, type);
8402 cache->last_byte_to_unpin = (u64)-1;
8403 cache->cached = BTRFS_CACHE_FINISHED;
8404 exclude_super_stripes(root, cache);
8406 add_new_free_space(cache, root->fs_info, chunk_offset,
8407 chunk_offset + size);
8409 free_excluded_extents(root, cache);
8411 ret = update_space_info(root->fs_info, cache->flags, size, bytes_used,
8412 &cache->space_info);
8415 spin_lock(&cache->space_info->lock);
8416 cache->space_info->bytes_readonly += cache->bytes_super;
8417 spin_unlock(&cache->space_info->lock);
8419 __link_block_group(cache->space_info, cache);
8421 ret = btrfs_add_block_group_cache(root->fs_info, cache);
8424 ret = btrfs_insert_item(trans, extent_root, &cache->key, &cache->item,
8425 sizeof(cache->item));
8428 set_avail_alloc_bits(extent_root->fs_info, type);
8433 int btrfs_remove_block_group(struct btrfs_trans_handle *trans,
8434 struct btrfs_root *root, u64 group_start)
8436 struct btrfs_path *path;
8437 struct btrfs_block_group_cache *block_group;
8438 struct btrfs_free_cluster *cluster;
8439 struct btrfs_root *tree_root = root->fs_info->tree_root;
8440 struct btrfs_key key;
8441 struct inode *inode;
8445 root = root->fs_info->extent_root;
8447 block_group = btrfs_lookup_block_group(root->fs_info, group_start);
8448 BUG_ON(!block_group);
8449 BUG_ON(!block_group->ro);
8451 memcpy(&key, &block_group->key, sizeof(key));
8452 if (block_group->flags & (BTRFS_BLOCK_GROUP_DUP |
8453 BTRFS_BLOCK_GROUP_RAID1 |
8454 BTRFS_BLOCK_GROUP_RAID10))
8459 /* make sure this block group isn't part of an allocation cluster */
8460 cluster = &root->fs_info->data_alloc_cluster;
8461 spin_lock(&cluster->refill_lock);
8462 btrfs_return_cluster_to_free_space(block_group, cluster);
8463 spin_unlock(&cluster->refill_lock);
8466 * make sure this block group isn't part of a metadata
8467 * allocation cluster
8469 cluster = &root->fs_info->meta_alloc_cluster;
8470 spin_lock(&cluster->refill_lock);
8471 btrfs_return_cluster_to_free_space(block_group, cluster);
8472 spin_unlock(&cluster->refill_lock);
8474 path = btrfs_alloc_path();
8477 inode = lookup_free_space_inode(root, block_group, path);
8478 if (!IS_ERR(inode)) {
8479 btrfs_orphan_add(trans, inode);
8481 /* One for the block groups ref */
8482 spin_lock(&block_group->lock);
8483 if (block_group->iref) {
8484 block_group->iref = 0;
8485 block_group->inode = NULL;
8486 spin_unlock(&block_group->lock);
8489 spin_unlock(&block_group->lock);
8491 /* One for our lookup ref */
8495 key.objectid = BTRFS_FREE_SPACE_OBJECTID;
8496 key.offset = block_group->key.objectid;
8499 ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1);
8503 btrfs_release_path(tree_root, path);
8505 ret = btrfs_del_item(trans, tree_root, path);
8508 btrfs_release_path(tree_root, path);
8511 spin_lock(&root->fs_info->block_group_cache_lock);
8512 rb_erase(&block_group->cache_node,
8513 &root->fs_info->block_group_cache_tree);
8514 spin_unlock(&root->fs_info->block_group_cache_lock);
8516 down_write(&block_group->space_info->groups_sem);
8518 * we must use list_del_init so people can check to see if they
8519 * are still on the list after taking the semaphore
8521 list_del_init(&block_group->list);
8522 up_write(&block_group->space_info->groups_sem);
8524 if (block_group->cached == BTRFS_CACHE_STARTED)
8525 wait_block_group_cache_done(block_group);
8527 btrfs_remove_free_space_cache(block_group);
8529 spin_lock(&block_group->space_info->lock);
8530 block_group->space_info->total_bytes -= block_group->key.offset;
8531 block_group->space_info->bytes_readonly -= block_group->key.offset;
8532 block_group->space_info->disk_total -= block_group->key.offset * factor;
8533 spin_unlock(&block_group->space_info->lock);
8535 memcpy(&key, &block_group->key, sizeof(key));
8537 btrfs_clear_space_info_full(root->fs_info);
8539 btrfs_put_block_group(block_group);
8540 btrfs_put_block_group(block_group);
8542 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
8548 ret = btrfs_del_item(trans, root, path);
8550 btrfs_free_path(path);