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>
26 #include <linux/ratelimit.h>
31 #include "print-tree.h"
32 #include "transaction.h"
35 #include "free-space-cache.h"
37 /* control flags for do_chunk_alloc's force field
38 * CHUNK_ALLOC_NO_FORCE means to only allocate a chunk
39 * if we really need one.
41 * CHUNK_ALLOC_FORCE means it must try to allocate one
43 * CHUNK_ALLOC_LIMITED means to only try and allocate one
44 * if we have very few chunks already allocated. This is
45 * used as part of the clustering code to help make sure
46 * we have a good pool of storage to cluster in, without
47 * filling the FS with empty chunks
51 CHUNK_ALLOC_NO_FORCE = 0,
52 CHUNK_ALLOC_FORCE = 1,
53 CHUNK_ALLOC_LIMITED = 2,
57 * Control how reservations are dealt with.
59 * RESERVE_FREE - freeing a reservation.
60 * RESERVE_ALLOC - allocating space and we need to update bytes_may_use for
62 * RESERVE_ALLOC_NO_ACCOUNT - allocating space and we should not update
63 * bytes_may_use as the ENOSPC accounting is done elsewhere
68 RESERVE_ALLOC_NO_ACCOUNT = 2,
71 static int update_block_group(struct btrfs_trans_handle *trans,
72 struct btrfs_root *root,
73 u64 bytenr, u64 num_bytes, int alloc);
74 static int __btrfs_free_extent(struct btrfs_trans_handle *trans,
75 struct btrfs_root *root,
76 u64 bytenr, u64 num_bytes, u64 parent,
77 u64 root_objectid, u64 owner_objectid,
78 u64 owner_offset, int refs_to_drop,
79 struct btrfs_delayed_extent_op *extra_op);
80 static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op,
81 struct extent_buffer *leaf,
82 struct btrfs_extent_item *ei);
83 static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
84 struct btrfs_root *root,
85 u64 parent, u64 root_objectid,
86 u64 flags, u64 owner, u64 offset,
87 struct btrfs_key *ins, int ref_mod);
88 static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans,
89 struct btrfs_root *root,
90 u64 parent, u64 root_objectid,
91 u64 flags, struct btrfs_disk_key *key,
92 int level, struct btrfs_key *ins);
93 static int do_chunk_alloc(struct btrfs_trans_handle *trans,
94 struct btrfs_root *extent_root, u64 alloc_bytes,
95 u64 flags, int force);
96 static int find_next_key(struct btrfs_path *path, int level,
97 struct btrfs_key *key);
98 static void dump_space_info(struct btrfs_space_info *info, u64 bytes,
99 int dump_block_groups);
100 static int btrfs_update_reserved_bytes(struct btrfs_block_group_cache *cache,
101 u64 num_bytes, int reserve);
104 block_group_cache_done(struct btrfs_block_group_cache *cache)
107 return cache->cached == BTRFS_CACHE_FINISHED;
110 static int block_group_bits(struct btrfs_block_group_cache *cache, u64 bits)
112 return (cache->flags & bits) == bits;
115 static void btrfs_get_block_group(struct btrfs_block_group_cache *cache)
117 atomic_inc(&cache->count);
120 void btrfs_put_block_group(struct btrfs_block_group_cache *cache)
122 if (atomic_dec_and_test(&cache->count)) {
123 WARN_ON(cache->pinned > 0);
124 WARN_ON(cache->reserved > 0);
125 kfree(cache->free_space_ctl);
131 * this adds the block group to the fs_info rb tree for the block group
134 static int btrfs_add_block_group_cache(struct btrfs_fs_info *info,
135 struct btrfs_block_group_cache *block_group)
138 struct rb_node *parent = NULL;
139 struct btrfs_block_group_cache *cache;
141 spin_lock(&info->block_group_cache_lock);
142 p = &info->block_group_cache_tree.rb_node;
146 cache = rb_entry(parent, struct btrfs_block_group_cache,
148 if (block_group->key.objectid < cache->key.objectid) {
150 } else if (block_group->key.objectid > cache->key.objectid) {
153 spin_unlock(&info->block_group_cache_lock);
158 rb_link_node(&block_group->cache_node, parent, p);
159 rb_insert_color(&block_group->cache_node,
160 &info->block_group_cache_tree);
161 spin_unlock(&info->block_group_cache_lock);
167 * This will return the block group at or after bytenr if contains is 0, else
168 * it will return the block group that contains the bytenr
170 static struct btrfs_block_group_cache *
171 block_group_cache_tree_search(struct btrfs_fs_info *info, u64 bytenr,
174 struct btrfs_block_group_cache *cache, *ret = NULL;
178 spin_lock(&info->block_group_cache_lock);
179 n = info->block_group_cache_tree.rb_node;
182 cache = rb_entry(n, struct btrfs_block_group_cache,
184 end = cache->key.objectid + cache->key.offset - 1;
185 start = cache->key.objectid;
187 if (bytenr < start) {
188 if (!contains && (!ret || start < ret->key.objectid))
191 } else if (bytenr > start) {
192 if (contains && bytenr <= end) {
203 btrfs_get_block_group(ret);
204 spin_unlock(&info->block_group_cache_lock);
209 static int add_excluded_extent(struct btrfs_root *root,
210 u64 start, u64 num_bytes)
212 u64 end = start + num_bytes - 1;
213 set_extent_bits(&root->fs_info->freed_extents[0],
214 start, end, EXTENT_UPTODATE, GFP_NOFS);
215 set_extent_bits(&root->fs_info->freed_extents[1],
216 start, end, EXTENT_UPTODATE, GFP_NOFS);
220 static void free_excluded_extents(struct btrfs_root *root,
221 struct btrfs_block_group_cache *cache)
225 start = cache->key.objectid;
226 end = start + cache->key.offset - 1;
228 clear_extent_bits(&root->fs_info->freed_extents[0],
229 start, end, EXTENT_UPTODATE, GFP_NOFS);
230 clear_extent_bits(&root->fs_info->freed_extents[1],
231 start, end, EXTENT_UPTODATE, GFP_NOFS);
234 static int exclude_super_stripes(struct btrfs_root *root,
235 struct btrfs_block_group_cache *cache)
242 if (cache->key.objectid < BTRFS_SUPER_INFO_OFFSET) {
243 stripe_len = BTRFS_SUPER_INFO_OFFSET - cache->key.objectid;
244 cache->bytes_super += stripe_len;
245 ret = add_excluded_extent(root, cache->key.objectid,
250 for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
251 bytenr = btrfs_sb_offset(i);
252 ret = btrfs_rmap_block(&root->fs_info->mapping_tree,
253 cache->key.objectid, bytenr,
254 0, &logical, &nr, &stripe_len);
258 cache->bytes_super += stripe_len;
259 ret = add_excluded_extent(root, logical[nr],
269 static struct btrfs_caching_control *
270 get_caching_control(struct btrfs_block_group_cache *cache)
272 struct btrfs_caching_control *ctl;
274 spin_lock(&cache->lock);
275 if (cache->cached != BTRFS_CACHE_STARTED) {
276 spin_unlock(&cache->lock);
280 /* We're loading it the fast way, so we don't have a caching_ctl. */
281 if (!cache->caching_ctl) {
282 spin_unlock(&cache->lock);
286 ctl = cache->caching_ctl;
287 atomic_inc(&ctl->count);
288 spin_unlock(&cache->lock);
292 static void put_caching_control(struct btrfs_caching_control *ctl)
294 if (atomic_dec_and_test(&ctl->count))
299 * this is only called by cache_block_group, since we could have freed extents
300 * we need to check the pinned_extents for any extents that can't be used yet
301 * since their free space will be released as soon as the transaction commits.
303 static u64 add_new_free_space(struct btrfs_block_group_cache *block_group,
304 struct btrfs_fs_info *info, u64 start, u64 end)
306 u64 extent_start, extent_end, size, total_added = 0;
309 while (start < end) {
310 ret = find_first_extent_bit(info->pinned_extents, start,
311 &extent_start, &extent_end,
312 EXTENT_DIRTY | EXTENT_UPTODATE);
316 if (extent_start <= start) {
317 start = extent_end + 1;
318 } else if (extent_start > start && extent_start < end) {
319 size = extent_start - start;
321 ret = btrfs_add_free_space(block_group, start,
324 start = extent_end + 1;
333 ret = btrfs_add_free_space(block_group, start, size);
340 static noinline void caching_thread(struct btrfs_work *work)
342 struct btrfs_block_group_cache *block_group;
343 struct btrfs_fs_info *fs_info;
344 struct btrfs_caching_control *caching_ctl;
345 struct btrfs_root *extent_root;
346 struct btrfs_path *path;
347 struct extent_buffer *leaf;
348 struct btrfs_key key;
354 caching_ctl = container_of(work, struct btrfs_caching_control, work);
355 block_group = caching_ctl->block_group;
356 fs_info = block_group->fs_info;
357 extent_root = fs_info->extent_root;
359 path = btrfs_alloc_path();
363 last = max_t(u64, block_group->key.objectid, BTRFS_SUPER_INFO_OFFSET);
366 * We don't want to deadlock with somebody trying to allocate a new
367 * extent for the extent root while also trying to search the extent
368 * root to add free space. So we skip locking and search the commit
369 * root, since its read-only
371 path->skip_locking = 1;
372 path->search_commit_root = 1;
377 key.type = BTRFS_EXTENT_ITEM_KEY;
379 mutex_lock(&caching_ctl->mutex);
380 /* need to make sure the commit_root doesn't disappear */
381 down_read(&fs_info->extent_commit_sem);
383 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
387 leaf = path->nodes[0];
388 nritems = btrfs_header_nritems(leaf);
391 if (btrfs_fs_closing(fs_info) > 1) {
396 if (path->slots[0] < nritems) {
397 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
399 ret = find_next_key(path, 0, &key);
403 if (need_resched() ||
404 btrfs_next_leaf(extent_root, path)) {
405 caching_ctl->progress = last;
406 btrfs_release_path(path);
407 up_read(&fs_info->extent_commit_sem);
408 mutex_unlock(&caching_ctl->mutex);
412 leaf = path->nodes[0];
413 nritems = btrfs_header_nritems(leaf);
417 if (key.objectid < block_group->key.objectid) {
422 if (key.objectid >= block_group->key.objectid +
423 block_group->key.offset)
426 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
427 total_found += add_new_free_space(block_group,
430 last = key.objectid + key.offset;
432 if (total_found > (1024 * 1024 * 2)) {
434 wake_up(&caching_ctl->wait);
441 total_found += add_new_free_space(block_group, fs_info, last,
442 block_group->key.objectid +
443 block_group->key.offset);
444 caching_ctl->progress = (u64)-1;
446 spin_lock(&block_group->lock);
447 block_group->caching_ctl = NULL;
448 block_group->cached = BTRFS_CACHE_FINISHED;
449 spin_unlock(&block_group->lock);
452 btrfs_free_path(path);
453 up_read(&fs_info->extent_commit_sem);
455 free_excluded_extents(extent_root, block_group);
457 mutex_unlock(&caching_ctl->mutex);
459 wake_up(&caching_ctl->wait);
461 put_caching_control(caching_ctl);
462 btrfs_put_block_group(block_group);
465 static int cache_block_group(struct btrfs_block_group_cache *cache,
466 struct btrfs_trans_handle *trans,
467 struct btrfs_root *root,
471 struct btrfs_fs_info *fs_info = cache->fs_info;
472 struct btrfs_caching_control *caching_ctl;
475 caching_ctl = kzalloc(sizeof(*caching_ctl), GFP_NOFS);
476 BUG_ON(!caching_ctl);
478 INIT_LIST_HEAD(&caching_ctl->list);
479 mutex_init(&caching_ctl->mutex);
480 init_waitqueue_head(&caching_ctl->wait);
481 caching_ctl->block_group = cache;
482 caching_ctl->progress = cache->key.objectid;
483 atomic_set(&caching_ctl->count, 1);
484 caching_ctl->work.func = caching_thread;
486 spin_lock(&cache->lock);
488 * This should be a rare occasion, but this could happen I think in the
489 * case where one thread starts to load the space cache info, and then
490 * some other thread starts a transaction commit which tries to do an
491 * allocation while the other thread is still loading the space cache
492 * info. The previous loop should have kept us from choosing this block
493 * group, but if we've moved to the state where we will wait on caching
494 * block groups we need to first check if we're doing a fast load here,
495 * so we can wait for it to finish, otherwise we could end up allocating
496 * from a block group who's cache gets evicted for one reason or
499 while (cache->cached == BTRFS_CACHE_FAST) {
500 struct btrfs_caching_control *ctl;
502 ctl = cache->caching_ctl;
503 atomic_inc(&ctl->count);
504 prepare_to_wait(&ctl->wait, &wait, TASK_UNINTERRUPTIBLE);
505 spin_unlock(&cache->lock);
509 finish_wait(&ctl->wait, &wait);
510 put_caching_control(ctl);
511 spin_lock(&cache->lock);
514 if (cache->cached != BTRFS_CACHE_NO) {
515 spin_unlock(&cache->lock);
519 WARN_ON(cache->caching_ctl);
520 cache->caching_ctl = caching_ctl;
521 cache->cached = BTRFS_CACHE_FAST;
522 spin_unlock(&cache->lock);
525 * We can't do the read from on-disk cache during a commit since we need
526 * to have the normal tree locking. Also if we are currently trying to
527 * allocate blocks for the tree root we can't do the fast caching since
528 * we likely hold important locks.
530 if (trans && (!trans->transaction->in_commit) &&
531 (root && root != root->fs_info->tree_root) &&
532 btrfs_test_opt(root, SPACE_CACHE)) {
533 ret = load_free_space_cache(fs_info, cache);
535 spin_lock(&cache->lock);
537 cache->caching_ctl = NULL;
538 cache->cached = BTRFS_CACHE_FINISHED;
539 cache->last_byte_to_unpin = (u64)-1;
541 if (load_cache_only) {
542 cache->caching_ctl = NULL;
543 cache->cached = BTRFS_CACHE_NO;
545 cache->cached = BTRFS_CACHE_STARTED;
548 spin_unlock(&cache->lock);
549 wake_up(&caching_ctl->wait);
551 put_caching_control(caching_ctl);
552 free_excluded_extents(fs_info->extent_root, cache);
557 * We are not going to do the fast caching, set cached to the
558 * appropriate value and wakeup any waiters.
560 spin_lock(&cache->lock);
561 if (load_cache_only) {
562 cache->caching_ctl = NULL;
563 cache->cached = BTRFS_CACHE_NO;
565 cache->cached = BTRFS_CACHE_STARTED;
567 spin_unlock(&cache->lock);
568 wake_up(&caching_ctl->wait);
571 if (load_cache_only) {
572 put_caching_control(caching_ctl);
576 down_write(&fs_info->extent_commit_sem);
577 atomic_inc(&caching_ctl->count);
578 list_add_tail(&caching_ctl->list, &fs_info->caching_block_groups);
579 up_write(&fs_info->extent_commit_sem);
581 btrfs_get_block_group(cache);
583 btrfs_queue_worker(&fs_info->caching_workers, &caching_ctl->work);
589 * return the block group that starts at or after bytenr
591 static struct btrfs_block_group_cache *
592 btrfs_lookup_first_block_group(struct btrfs_fs_info *info, u64 bytenr)
594 struct btrfs_block_group_cache *cache;
596 cache = block_group_cache_tree_search(info, bytenr, 0);
602 * return the block group that contains the given bytenr
604 struct btrfs_block_group_cache *btrfs_lookup_block_group(
605 struct btrfs_fs_info *info,
608 struct btrfs_block_group_cache *cache;
610 cache = block_group_cache_tree_search(info, bytenr, 1);
615 static struct btrfs_space_info *__find_space_info(struct btrfs_fs_info *info,
618 struct list_head *head = &info->space_info;
619 struct btrfs_space_info *found;
621 flags &= BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_SYSTEM |
622 BTRFS_BLOCK_GROUP_METADATA;
625 list_for_each_entry_rcu(found, head, list) {
626 if (found->flags & flags) {
636 * after adding space to the filesystem, we need to clear the full flags
637 * on all the space infos.
639 void btrfs_clear_space_info_full(struct btrfs_fs_info *info)
641 struct list_head *head = &info->space_info;
642 struct btrfs_space_info *found;
645 list_for_each_entry_rcu(found, head, list)
650 static u64 div_factor(u64 num, int factor)
659 static u64 div_factor_fine(u64 num, int factor)
668 u64 btrfs_find_block_group(struct btrfs_root *root,
669 u64 search_start, u64 search_hint, int owner)
671 struct btrfs_block_group_cache *cache;
673 u64 last = max(search_hint, search_start);
680 cache = btrfs_lookup_first_block_group(root->fs_info, last);
684 spin_lock(&cache->lock);
685 last = cache->key.objectid + cache->key.offset;
686 used = btrfs_block_group_used(&cache->item);
688 if ((full_search || !cache->ro) &&
689 block_group_bits(cache, BTRFS_BLOCK_GROUP_METADATA)) {
690 if (used + cache->pinned + cache->reserved <
691 div_factor(cache->key.offset, factor)) {
692 group_start = cache->key.objectid;
693 spin_unlock(&cache->lock);
694 btrfs_put_block_group(cache);
698 spin_unlock(&cache->lock);
699 btrfs_put_block_group(cache);
707 if (!full_search && factor < 10) {
717 /* simple helper to search for an existing extent at a given offset */
718 int btrfs_lookup_extent(struct btrfs_root *root, u64 start, u64 len)
721 struct btrfs_key key;
722 struct btrfs_path *path;
724 path = btrfs_alloc_path();
728 key.objectid = start;
730 btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY);
731 ret = btrfs_search_slot(NULL, root->fs_info->extent_root, &key, path,
733 btrfs_free_path(path);
738 * helper function to lookup reference count and flags of extent.
740 * the head node for delayed ref is used to store the sum of all the
741 * reference count modifications queued up in the rbtree. the head
742 * node may also store the extent flags to set. This way you can check
743 * to see what the reference count and extent flags would be if all of
744 * the delayed refs are not processed.
746 int btrfs_lookup_extent_info(struct btrfs_trans_handle *trans,
747 struct btrfs_root *root, u64 bytenr,
748 u64 num_bytes, u64 *refs, u64 *flags)
750 struct btrfs_delayed_ref_head *head;
751 struct btrfs_delayed_ref_root *delayed_refs;
752 struct btrfs_path *path;
753 struct btrfs_extent_item *ei;
754 struct extent_buffer *leaf;
755 struct btrfs_key key;
761 path = btrfs_alloc_path();
765 key.objectid = bytenr;
766 key.type = BTRFS_EXTENT_ITEM_KEY;
767 key.offset = num_bytes;
769 path->skip_locking = 1;
770 path->search_commit_root = 1;
773 ret = btrfs_search_slot(trans, root->fs_info->extent_root,
779 leaf = path->nodes[0];
780 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
781 if (item_size >= sizeof(*ei)) {
782 ei = btrfs_item_ptr(leaf, path->slots[0],
783 struct btrfs_extent_item);
784 num_refs = btrfs_extent_refs(leaf, ei);
785 extent_flags = btrfs_extent_flags(leaf, ei);
787 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
788 struct btrfs_extent_item_v0 *ei0;
789 BUG_ON(item_size != sizeof(*ei0));
790 ei0 = btrfs_item_ptr(leaf, path->slots[0],
791 struct btrfs_extent_item_v0);
792 num_refs = btrfs_extent_refs_v0(leaf, ei0);
793 /* FIXME: this isn't correct for data */
794 extent_flags = BTRFS_BLOCK_FLAG_FULL_BACKREF;
799 BUG_ON(num_refs == 0);
809 delayed_refs = &trans->transaction->delayed_refs;
810 spin_lock(&delayed_refs->lock);
811 head = btrfs_find_delayed_ref_head(trans, bytenr);
813 if (!mutex_trylock(&head->mutex)) {
814 atomic_inc(&head->node.refs);
815 spin_unlock(&delayed_refs->lock);
817 btrfs_release_path(path);
820 * Mutex was contended, block until it's released and try
823 mutex_lock(&head->mutex);
824 mutex_unlock(&head->mutex);
825 btrfs_put_delayed_ref(&head->node);
828 if (head->extent_op && head->extent_op->update_flags)
829 extent_flags |= head->extent_op->flags_to_set;
831 BUG_ON(num_refs == 0);
833 num_refs += head->node.ref_mod;
834 mutex_unlock(&head->mutex);
836 spin_unlock(&delayed_refs->lock);
838 WARN_ON(num_refs == 0);
842 *flags = extent_flags;
844 btrfs_free_path(path);
849 * Back reference rules. Back refs have three main goals:
851 * 1) differentiate between all holders of references to an extent so that
852 * when a reference is dropped we can make sure it was a valid reference
853 * before freeing the extent.
855 * 2) Provide enough information to quickly find the holders of an extent
856 * if we notice a given block is corrupted or bad.
858 * 3) Make it easy to migrate blocks for FS shrinking or storage pool
859 * maintenance. This is actually the same as #2, but with a slightly
860 * different use case.
862 * There are two kinds of back refs. The implicit back refs is optimized
863 * for pointers in non-shared tree blocks. For a given pointer in a block,
864 * back refs of this kind provide information about the block's owner tree
865 * and the pointer's key. These information allow us to find the block by
866 * b-tree searching. The full back refs is for pointers in tree blocks not
867 * referenced by their owner trees. The location of tree block is recorded
868 * in the back refs. Actually the full back refs is generic, and can be
869 * used in all cases the implicit back refs is used. The major shortcoming
870 * of the full back refs is its overhead. Every time a tree block gets
871 * COWed, we have to update back refs entry for all pointers in it.
873 * For a newly allocated tree block, we use implicit back refs for
874 * pointers in it. This means most tree related operations only involve
875 * implicit back refs. For a tree block created in old transaction, the
876 * only way to drop a reference to it is COW it. So we can detect the
877 * event that tree block loses its owner tree's reference and do the
878 * back refs conversion.
880 * When a tree block is COW'd through a tree, there are four cases:
882 * The reference count of the block is one and the tree is the block's
883 * owner tree. Nothing to do in this case.
885 * The reference count of the block is one and the tree is not the
886 * block's owner tree. In this case, full back refs is used for pointers
887 * in the block. Remove these full back refs, add implicit back refs for
888 * every pointers in the new block.
890 * The reference count of the block is greater than one and the tree is
891 * the block's owner tree. In this case, implicit back refs is used for
892 * pointers in the block. Add full back refs for every pointers in the
893 * block, increase lower level extents' reference counts. The original
894 * implicit back refs are entailed to the new block.
896 * The reference count of the block is greater than one and the tree is
897 * not the block's owner tree. Add implicit back refs for every pointer in
898 * the new block, increase lower level extents' reference count.
900 * Back Reference Key composing:
902 * The key objectid corresponds to the first byte in the extent,
903 * The key type is used to differentiate between types of back refs.
904 * There are different meanings of the key offset for different types
907 * File extents can be referenced by:
909 * - multiple snapshots, subvolumes, or different generations in one subvol
910 * - different files inside a single subvolume
911 * - different offsets inside a file (bookend extents in file.c)
913 * The extent ref structure for the implicit back refs has fields for:
915 * - Objectid of the subvolume root
916 * - objectid of the file holding the reference
917 * - original offset in the file
918 * - how many bookend extents
920 * The key offset for the implicit back refs is hash of the first
923 * The extent ref structure for the full back refs has field for:
925 * - number of pointers in the tree leaf
927 * The key offset for the implicit back refs is the first byte of
930 * When a file extent is allocated, The implicit back refs is used.
931 * the fields are filled in:
933 * (root_key.objectid, inode objectid, offset in file, 1)
935 * When a file extent is removed file truncation, we find the
936 * corresponding implicit back refs and check the following fields:
938 * (btrfs_header_owner(leaf), inode objectid, offset in file)
940 * Btree extents can be referenced by:
942 * - Different subvolumes
944 * Both the implicit back refs and the full back refs for tree blocks
945 * only consist of key. The key offset for the implicit back refs is
946 * objectid of block's owner tree. The key offset for the full back refs
947 * is the first byte of parent block.
949 * When implicit back refs is used, information about the lowest key and
950 * level of the tree block are required. These information are stored in
951 * tree block info structure.
954 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
955 static int convert_extent_item_v0(struct btrfs_trans_handle *trans,
956 struct btrfs_root *root,
957 struct btrfs_path *path,
958 u64 owner, u32 extra_size)
960 struct btrfs_extent_item *item;
961 struct btrfs_extent_item_v0 *ei0;
962 struct btrfs_extent_ref_v0 *ref0;
963 struct btrfs_tree_block_info *bi;
964 struct extent_buffer *leaf;
965 struct btrfs_key key;
966 struct btrfs_key found_key;
967 u32 new_size = sizeof(*item);
971 leaf = path->nodes[0];
972 BUG_ON(btrfs_item_size_nr(leaf, path->slots[0]) != sizeof(*ei0));
974 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
975 ei0 = btrfs_item_ptr(leaf, path->slots[0],
976 struct btrfs_extent_item_v0);
977 refs = btrfs_extent_refs_v0(leaf, ei0);
979 if (owner == (u64)-1) {
981 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
982 ret = btrfs_next_leaf(root, path);
986 leaf = path->nodes[0];
988 btrfs_item_key_to_cpu(leaf, &found_key,
990 BUG_ON(key.objectid != found_key.objectid);
991 if (found_key.type != BTRFS_EXTENT_REF_V0_KEY) {
995 ref0 = btrfs_item_ptr(leaf, path->slots[0],
996 struct btrfs_extent_ref_v0);
997 owner = btrfs_ref_objectid_v0(leaf, ref0);
1001 btrfs_release_path(path);
1003 if (owner < BTRFS_FIRST_FREE_OBJECTID)
1004 new_size += sizeof(*bi);
1006 new_size -= sizeof(*ei0);
1007 ret = btrfs_search_slot(trans, root, &key, path,
1008 new_size + extra_size, 1);
1013 ret = btrfs_extend_item(trans, root, path, new_size);
1015 leaf = path->nodes[0];
1016 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1017 btrfs_set_extent_refs(leaf, item, refs);
1018 /* FIXME: get real generation */
1019 btrfs_set_extent_generation(leaf, item, 0);
1020 if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1021 btrfs_set_extent_flags(leaf, item,
1022 BTRFS_EXTENT_FLAG_TREE_BLOCK |
1023 BTRFS_BLOCK_FLAG_FULL_BACKREF);
1024 bi = (struct btrfs_tree_block_info *)(item + 1);
1025 /* FIXME: get first key of the block */
1026 memset_extent_buffer(leaf, 0, (unsigned long)bi, sizeof(*bi));
1027 btrfs_set_tree_block_level(leaf, bi, (int)owner);
1029 btrfs_set_extent_flags(leaf, item, BTRFS_EXTENT_FLAG_DATA);
1031 btrfs_mark_buffer_dirty(leaf);
1036 static u64 hash_extent_data_ref(u64 root_objectid, u64 owner, u64 offset)
1038 u32 high_crc = ~(u32)0;
1039 u32 low_crc = ~(u32)0;
1042 lenum = cpu_to_le64(root_objectid);
1043 high_crc = crc32c(high_crc, &lenum, sizeof(lenum));
1044 lenum = cpu_to_le64(owner);
1045 low_crc = crc32c(low_crc, &lenum, sizeof(lenum));
1046 lenum = cpu_to_le64(offset);
1047 low_crc = crc32c(low_crc, &lenum, sizeof(lenum));
1049 return ((u64)high_crc << 31) ^ (u64)low_crc;
1052 static u64 hash_extent_data_ref_item(struct extent_buffer *leaf,
1053 struct btrfs_extent_data_ref *ref)
1055 return hash_extent_data_ref(btrfs_extent_data_ref_root(leaf, ref),
1056 btrfs_extent_data_ref_objectid(leaf, ref),
1057 btrfs_extent_data_ref_offset(leaf, ref));
1060 static int match_extent_data_ref(struct extent_buffer *leaf,
1061 struct btrfs_extent_data_ref *ref,
1062 u64 root_objectid, u64 owner, u64 offset)
1064 if (btrfs_extent_data_ref_root(leaf, ref) != root_objectid ||
1065 btrfs_extent_data_ref_objectid(leaf, ref) != owner ||
1066 btrfs_extent_data_ref_offset(leaf, ref) != offset)
1071 static noinline int lookup_extent_data_ref(struct btrfs_trans_handle *trans,
1072 struct btrfs_root *root,
1073 struct btrfs_path *path,
1074 u64 bytenr, u64 parent,
1076 u64 owner, u64 offset)
1078 struct btrfs_key key;
1079 struct btrfs_extent_data_ref *ref;
1080 struct extent_buffer *leaf;
1086 key.objectid = bytenr;
1088 key.type = BTRFS_SHARED_DATA_REF_KEY;
1089 key.offset = parent;
1091 key.type = BTRFS_EXTENT_DATA_REF_KEY;
1092 key.offset = hash_extent_data_ref(root_objectid,
1097 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1106 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1107 key.type = BTRFS_EXTENT_REF_V0_KEY;
1108 btrfs_release_path(path);
1109 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1120 leaf = path->nodes[0];
1121 nritems = btrfs_header_nritems(leaf);
1123 if (path->slots[0] >= nritems) {
1124 ret = btrfs_next_leaf(root, path);
1130 leaf = path->nodes[0];
1131 nritems = btrfs_header_nritems(leaf);
1135 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1136 if (key.objectid != bytenr ||
1137 key.type != BTRFS_EXTENT_DATA_REF_KEY)
1140 ref = btrfs_item_ptr(leaf, path->slots[0],
1141 struct btrfs_extent_data_ref);
1143 if (match_extent_data_ref(leaf, ref, root_objectid,
1146 btrfs_release_path(path);
1158 static noinline int insert_extent_data_ref(struct btrfs_trans_handle *trans,
1159 struct btrfs_root *root,
1160 struct btrfs_path *path,
1161 u64 bytenr, u64 parent,
1162 u64 root_objectid, u64 owner,
1163 u64 offset, int refs_to_add)
1165 struct btrfs_key key;
1166 struct extent_buffer *leaf;
1171 key.objectid = bytenr;
1173 key.type = BTRFS_SHARED_DATA_REF_KEY;
1174 key.offset = parent;
1175 size = sizeof(struct btrfs_shared_data_ref);
1177 key.type = BTRFS_EXTENT_DATA_REF_KEY;
1178 key.offset = hash_extent_data_ref(root_objectid,
1180 size = sizeof(struct btrfs_extent_data_ref);
1183 ret = btrfs_insert_empty_item(trans, root, path, &key, size);
1184 if (ret && ret != -EEXIST)
1187 leaf = path->nodes[0];
1189 struct btrfs_shared_data_ref *ref;
1190 ref = btrfs_item_ptr(leaf, path->slots[0],
1191 struct btrfs_shared_data_ref);
1193 btrfs_set_shared_data_ref_count(leaf, ref, refs_to_add);
1195 num_refs = btrfs_shared_data_ref_count(leaf, ref);
1196 num_refs += refs_to_add;
1197 btrfs_set_shared_data_ref_count(leaf, ref, num_refs);
1200 struct btrfs_extent_data_ref *ref;
1201 while (ret == -EEXIST) {
1202 ref = btrfs_item_ptr(leaf, path->slots[0],
1203 struct btrfs_extent_data_ref);
1204 if (match_extent_data_ref(leaf, ref, root_objectid,
1207 btrfs_release_path(path);
1209 ret = btrfs_insert_empty_item(trans, root, path, &key,
1211 if (ret && ret != -EEXIST)
1214 leaf = path->nodes[0];
1216 ref = btrfs_item_ptr(leaf, path->slots[0],
1217 struct btrfs_extent_data_ref);
1219 btrfs_set_extent_data_ref_root(leaf, ref,
1221 btrfs_set_extent_data_ref_objectid(leaf, ref, owner);
1222 btrfs_set_extent_data_ref_offset(leaf, ref, offset);
1223 btrfs_set_extent_data_ref_count(leaf, ref, refs_to_add);
1225 num_refs = btrfs_extent_data_ref_count(leaf, ref);
1226 num_refs += refs_to_add;
1227 btrfs_set_extent_data_ref_count(leaf, ref, num_refs);
1230 btrfs_mark_buffer_dirty(leaf);
1233 btrfs_release_path(path);
1237 static noinline int remove_extent_data_ref(struct btrfs_trans_handle *trans,
1238 struct btrfs_root *root,
1239 struct btrfs_path *path,
1242 struct btrfs_key key;
1243 struct btrfs_extent_data_ref *ref1 = NULL;
1244 struct btrfs_shared_data_ref *ref2 = NULL;
1245 struct extent_buffer *leaf;
1249 leaf = path->nodes[0];
1250 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1252 if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
1253 ref1 = btrfs_item_ptr(leaf, path->slots[0],
1254 struct btrfs_extent_data_ref);
1255 num_refs = btrfs_extent_data_ref_count(leaf, ref1);
1256 } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
1257 ref2 = btrfs_item_ptr(leaf, path->slots[0],
1258 struct btrfs_shared_data_ref);
1259 num_refs = btrfs_shared_data_ref_count(leaf, ref2);
1260 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1261 } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
1262 struct btrfs_extent_ref_v0 *ref0;
1263 ref0 = btrfs_item_ptr(leaf, path->slots[0],
1264 struct btrfs_extent_ref_v0);
1265 num_refs = btrfs_ref_count_v0(leaf, ref0);
1271 BUG_ON(num_refs < refs_to_drop);
1272 num_refs -= refs_to_drop;
1274 if (num_refs == 0) {
1275 ret = btrfs_del_item(trans, root, path);
1277 if (key.type == BTRFS_EXTENT_DATA_REF_KEY)
1278 btrfs_set_extent_data_ref_count(leaf, ref1, num_refs);
1279 else if (key.type == BTRFS_SHARED_DATA_REF_KEY)
1280 btrfs_set_shared_data_ref_count(leaf, ref2, num_refs);
1281 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1283 struct btrfs_extent_ref_v0 *ref0;
1284 ref0 = btrfs_item_ptr(leaf, path->slots[0],
1285 struct btrfs_extent_ref_v0);
1286 btrfs_set_ref_count_v0(leaf, ref0, num_refs);
1289 btrfs_mark_buffer_dirty(leaf);
1294 static noinline u32 extent_data_ref_count(struct btrfs_root *root,
1295 struct btrfs_path *path,
1296 struct btrfs_extent_inline_ref *iref)
1298 struct btrfs_key key;
1299 struct extent_buffer *leaf;
1300 struct btrfs_extent_data_ref *ref1;
1301 struct btrfs_shared_data_ref *ref2;
1304 leaf = path->nodes[0];
1305 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1307 if (btrfs_extent_inline_ref_type(leaf, iref) ==
1308 BTRFS_EXTENT_DATA_REF_KEY) {
1309 ref1 = (struct btrfs_extent_data_ref *)(&iref->offset);
1310 num_refs = btrfs_extent_data_ref_count(leaf, ref1);
1312 ref2 = (struct btrfs_shared_data_ref *)(iref + 1);
1313 num_refs = btrfs_shared_data_ref_count(leaf, ref2);
1315 } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
1316 ref1 = btrfs_item_ptr(leaf, path->slots[0],
1317 struct btrfs_extent_data_ref);
1318 num_refs = btrfs_extent_data_ref_count(leaf, ref1);
1319 } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
1320 ref2 = btrfs_item_ptr(leaf, path->slots[0],
1321 struct btrfs_shared_data_ref);
1322 num_refs = btrfs_shared_data_ref_count(leaf, ref2);
1323 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1324 } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
1325 struct btrfs_extent_ref_v0 *ref0;
1326 ref0 = btrfs_item_ptr(leaf, path->slots[0],
1327 struct btrfs_extent_ref_v0);
1328 num_refs = btrfs_ref_count_v0(leaf, ref0);
1336 static noinline int lookup_tree_block_ref(struct btrfs_trans_handle *trans,
1337 struct btrfs_root *root,
1338 struct btrfs_path *path,
1339 u64 bytenr, u64 parent,
1342 struct btrfs_key key;
1345 key.objectid = bytenr;
1347 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
1348 key.offset = parent;
1350 key.type = BTRFS_TREE_BLOCK_REF_KEY;
1351 key.offset = root_objectid;
1354 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1357 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1358 if (ret == -ENOENT && parent) {
1359 btrfs_release_path(path);
1360 key.type = BTRFS_EXTENT_REF_V0_KEY;
1361 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1369 static noinline int insert_tree_block_ref(struct btrfs_trans_handle *trans,
1370 struct btrfs_root *root,
1371 struct btrfs_path *path,
1372 u64 bytenr, u64 parent,
1375 struct btrfs_key key;
1378 key.objectid = bytenr;
1380 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
1381 key.offset = parent;
1383 key.type = BTRFS_TREE_BLOCK_REF_KEY;
1384 key.offset = root_objectid;
1387 ret = btrfs_insert_empty_item(trans, root, path, &key, 0);
1388 btrfs_release_path(path);
1392 static inline int extent_ref_type(u64 parent, u64 owner)
1395 if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1397 type = BTRFS_SHARED_BLOCK_REF_KEY;
1399 type = BTRFS_TREE_BLOCK_REF_KEY;
1402 type = BTRFS_SHARED_DATA_REF_KEY;
1404 type = BTRFS_EXTENT_DATA_REF_KEY;
1409 static int find_next_key(struct btrfs_path *path, int level,
1410 struct btrfs_key *key)
1413 for (; level < BTRFS_MAX_LEVEL; level++) {
1414 if (!path->nodes[level])
1416 if (path->slots[level] + 1 >=
1417 btrfs_header_nritems(path->nodes[level]))
1420 btrfs_item_key_to_cpu(path->nodes[level], key,
1421 path->slots[level] + 1);
1423 btrfs_node_key_to_cpu(path->nodes[level], key,
1424 path->slots[level] + 1);
1431 * look for inline back ref. if back ref is found, *ref_ret is set
1432 * to the address of inline back ref, and 0 is returned.
1434 * if back ref isn't found, *ref_ret is set to the address where it
1435 * should be inserted, and -ENOENT is returned.
1437 * if insert is true and there are too many inline back refs, the path
1438 * points to the extent item, and -EAGAIN is returned.
1440 * NOTE: inline back refs are ordered in the same way that back ref
1441 * items in the tree are ordered.
1443 static noinline_for_stack
1444 int lookup_inline_extent_backref(struct btrfs_trans_handle *trans,
1445 struct btrfs_root *root,
1446 struct btrfs_path *path,
1447 struct btrfs_extent_inline_ref **ref_ret,
1448 u64 bytenr, u64 num_bytes,
1449 u64 parent, u64 root_objectid,
1450 u64 owner, u64 offset, int insert)
1452 struct btrfs_key key;
1453 struct extent_buffer *leaf;
1454 struct btrfs_extent_item *ei;
1455 struct btrfs_extent_inline_ref *iref;
1466 key.objectid = bytenr;
1467 key.type = BTRFS_EXTENT_ITEM_KEY;
1468 key.offset = num_bytes;
1470 want = extent_ref_type(parent, owner);
1472 extra_size = btrfs_extent_inline_ref_size(want);
1473 path->keep_locks = 1;
1476 ret = btrfs_search_slot(trans, root, &key, path, extra_size, 1);
1483 leaf = path->nodes[0];
1484 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1485 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1486 if (item_size < sizeof(*ei)) {
1491 ret = convert_extent_item_v0(trans, root, path, owner,
1497 leaf = path->nodes[0];
1498 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1501 BUG_ON(item_size < sizeof(*ei));
1503 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1504 flags = btrfs_extent_flags(leaf, ei);
1506 ptr = (unsigned long)(ei + 1);
1507 end = (unsigned long)ei + item_size;
1509 if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
1510 ptr += sizeof(struct btrfs_tree_block_info);
1513 BUG_ON(!(flags & BTRFS_EXTENT_FLAG_DATA));
1522 iref = (struct btrfs_extent_inline_ref *)ptr;
1523 type = btrfs_extent_inline_ref_type(leaf, iref);
1527 ptr += btrfs_extent_inline_ref_size(type);
1531 if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1532 struct btrfs_extent_data_ref *dref;
1533 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1534 if (match_extent_data_ref(leaf, dref, root_objectid,
1539 if (hash_extent_data_ref_item(leaf, dref) <
1540 hash_extent_data_ref(root_objectid, owner, offset))
1544 ref_offset = btrfs_extent_inline_ref_offset(leaf, iref);
1546 if (parent == ref_offset) {
1550 if (ref_offset < parent)
1553 if (root_objectid == ref_offset) {
1557 if (ref_offset < root_objectid)
1561 ptr += btrfs_extent_inline_ref_size(type);
1563 if (err == -ENOENT && insert) {
1564 if (item_size + extra_size >=
1565 BTRFS_MAX_EXTENT_ITEM_SIZE(root)) {
1570 * To add new inline back ref, we have to make sure
1571 * there is no corresponding back ref item.
1572 * For simplicity, we just do not add new inline back
1573 * ref if there is any kind of item for this block
1575 if (find_next_key(path, 0, &key) == 0 &&
1576 key.objectid == bytenr &&
1577 key.type < BTRFS_BLOCK_GROUP_ITEM_KEY) {
1582 *ref_ret = (struct btrfs_extent_inline_ref *)ptr;
1585 path->keep_locks = 0;
1586 btrfs_unlock_up_safe(path, 1);
1592 * helper to add new inline back ref
1594 static noinline_for_stack
1595 int setup_inline_extent_backref(struct btrfs_trans_handle *trans,
1596 struct btrfs_root *root,
1597 struct btrfs_path *path,
1598 struct btrfs_extent_inline_ref *iref,
1599 u64 parent, u64 root_objectid,
1600 u64 owner, u64 offset, int refs_to_add,
1601 struct btrfs_delayed_extent_op *extent_op)
1603 struct extent_buffer *leaf;
1604 struct btrfs_extent_item *ei;
1607 unsigned long item_offset;
1613 leaf = path->nodes[0];
1614 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1615 item_offset = (unsigned long)iref - (unsigned long)ei;
1617 type = extent_ref_type(parent, owner);
1618 size = btrfs_extent_inline_ref_size(type);
1620 ret = btrfs_extend_item(trans, root, path, size);
1622 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1623 refs = btrfs_extent_refs(leaf, ei);
1624 refs += refs_to_add;
1625 btrfs_set_extent_refs(leaf, ei, refs);
1627 __run_delayed_extent_op(extent_op, leaf, ei);
1629 ptr = (unsigned long)ei + item_offset;
1630 end = (unsigned long)ei + btrfs_item_size_nr(leaf, path->slots[0]);
1631 if (ptr < end - size)
1632 memmove_extent_buffer(leaf, ptr + size, ptr,
1635 iref = (struct btrfs_extent_inline_ref *)ptr;
1636 btrfs_set_extent_inline_ref_type(leaf, iref, type);
1637 if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1638 struct btrfs_extent_data_ref *dref;
1639 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1640 btrfs_set_extent_data_ref_root(leaf, dref, root_objectid);
1641 btrfs_set_extent_data_ref_objectid(leaf, dref, owner);
1642 btrfs_set_extent_data_ref_offset(leaf, dref, offset);
1643 btrfs_set_extent_data_ref_count(leaf, dref, refs_to_add);
1644 } else if (type == BTRFS_SHARED_DATA_REF_KEY) {
1645 struct btrfs_shared_data_ref *sref;
1646 sref = (struct btrfs_shared_data_ref *)(iref + 1);
1647 btrfs_set_shared_data_ref_count(leaf, sref, refs_to_add);
1648 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
1649 } else if (type == BTRFS_SHARED_BLOCK_REF_KEY) {
1650 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
1652 btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid);
1654 btrfs_mark_buffer_dirty(leaf);
1658 static int lookup_extent_backref(struct btrfs_trans_handle *trans,
1659 struct btrfs_root *root,
1660 struct btrfs_path *path,
1661 struct btrfs_extent_inline_ref **ref_ret,
1662 u64 bytenr, u64 num_bytes, u64 parent,
1663 u64 root_objectid, u64 owner, u64 offset)
1667 ret = lookup_inline_extent_backref(trans, root, path, ref_ret,
1668 bytenr, num_bytes, parent,
1669 root_objectid, owner, offset, 0);
1673 btrfs_release_path(path);
1676 if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1677 ret = lookup_tree_block_ref(trans, root, path, bytenr, parent,
1680 ret = lookup_extent_data_ref(trans, root, path, bytenr, parent,
1681 root_objectid, owner, offset);
1687 * helper to update/remove inline back ref
1689 static noinline_for_stack
1690 int update_inline_extent_backref(struct btrfs_trans_handle *trans,
1691 struct btrfs_root *root,
1692 struct btrfs_path *path,
1693 struct btrfs_extent_inline_ref *iref,
1695 struct btrfs_delayed_extent_op *extent_op)
1697 struct extent_buffer *leaf;
1698 struct btrfs_extent_item *ei;
1699 struct btrfs_extent_data_ref *dref = NULL;
1700 struct btrfs_shared_data_ref *sref = NULL;
1709 leaf = path->nodes[0];
1710 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1711 refs = btrfs_extent_refs(leaf, ei);
1712 WARN_ON(refs_to_mod < 0 && refs + refs_to_mod <= 0);
1713 refs += refs_to_mod;
1714 btrfs_set_extent_refs(leaf, ei, refs);
1716 __run_delayed_extent_op(extent_op, leaf, ei);
1718 type = btrfs_extent_inline_ref_type(leaf, iref);
1720 if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1721 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1722 refs = btrfs_extent_data_ref_count(leaf, dref);
1723 } else if (type == BTRFS_SHARED_DATA_REF_KEY) {
1724 sref = (struct btrfs_shared_data_ref *)(iref + 1);
1725 refs = btrfs_shared_data_ref_count(leaf, sref);
1728 BUG_ON(refs_to_mod != -1);
1731 BUG_ON(refs_to_mod < 0 && refs < -refs_to_mod);
1732 refs += refs_to_mod;
1735 if (type == BTRFS_EXTENT_DATA_REF_KEY)
1736 btrfs_set_extent_data_ref_count(leaf, dref, refs);
1738 btrfs_set_shared_data_ref_count(leaf, sref, refs);
1740 size = btrfs_extent_inline_ref_size(type);
1741 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1742 ptr = (unsigned long)iref;
1743 end = (unsigned long)ei + item_size;
1744 if (ptr + size < end)
1745 memmove_extent_buffer(leaf, ptr, ptr + size,
1748 ret = btrfs_truncate_item(trans, root, path, item_size, 1);
1750 btrfs_mark_buffer_dirty(leaf);
1754 static noinline_for_stack
1755 int insert_inline_extent_backref(struct btrfs_trans_handle *trans,
1756 struct btrfs_root *root,
1757 struct btrfs_path *path,
1758 u64 bytenr, u64 num_bytes, u64 parent,
1759 u64 root_objectid, u64 owner,
1760 u64 offset, int refs_to_add,
1761 struct btrfs_delayed_extent_op *extent_op)
1763 struct btrfs_extent_inline_ref *iref;
1766 ret = lookup_inline_extent_backref(trans, root, path, &iref,
1767 bytenr, num_bytes, parent,
1768 root_objectid, owner, offset, 1);
1770 BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID);
1771 ret = update_inline_extent_backref(trans, root, path, iref,
1772 refs_to_add, extent_op);
1773 } else if (ret == -ENOENT) {
1774 ret = setup_inline_extent_backref(trans, root, path, iref,
1775 parent, root_objectid,
1776 owner, offset, refs_to_add,
1782 static int insert_extent_backref(struct btrfs_trans_handle *trans,
1783 struct btrfs_root *root,
1784 struct btrfs_path *path,
1785 u64 bytenr, u64 parent, u64 root_objectid,
1786 u64 owner, u64 offset, int refs_to_add)
1789 if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1790 BUG_ON(refs_to_add != 1);
1791 ret = insert_tree_block_ref(trans, root, path, bytenr,
1792 parent, root_objectid);
1794 ret = insert_extent_data_ref(trans, root, path, bytenr,
1795 parent, root_objectid,
1796 owner, offset, refs_to_add);
1801 static int remove_extent_backref(struct btrfs_trans_handle *trans,
1802 struct btrfs_root *root,
1803 struct btrfs_path *path,
1804 struct btrfs_extent_inline_ref *iref,
1805 int refs_to_drop, int is_data)
1809 BUG_ON(!is_data && refs_to_drop != 1);
1811 ret = update_inline_extent_backref(trans, root, path, iref,
1812 -refs_to_drop, NULL);
1813 } else if (is_data) {
1814 ret = remove_extent_data_ref(trans, root, path, refs_to_drop);
1816 ret = btrfs_del_item(trans, root, path);
1821 static int btrfs_issue_discard(struct block_device *bdev,
1824 return blkdev_issue_discard(bdev, start >> 9, len >> 9, GFP_NOFS, 0);
1827 static int btrfs_discard_extent(struct btrfs_root *root, u64 bytenr,
1828 u64 num_bytes, u64 *actual_bytes)
1831 u64 discarded_bytes = 0;
1832 struct btrfs_bio *bbio = NULL;
1835 /* Tell the block device(s) that the sectors can be discarded */
1836 ret = btrfs_map_block(&root->fs_info->mapping_tree, REQ_DISCARD,
1837 bytenr, &num_bytes, &bbio, 0);
1839 struct btrfs_bio_stripe *stripe = bbio->stripes;
1843 for (i = 0; i < bbio->num_stripes; i++, stripe++) {
1844 if (!stripe->dev->can_discard)
1847 ret = btrfs_issue_discard(stripe->dev->bdev,
1851 discarded_bytes += stripe->length;
1852 else if (ret != -EOPNOTSUPP)
1856 * Just in case we get back EOPNOTSUPP for some reason,
1857 * just ignore the return value so we don't screw up
1858 * people calling discard_extent.
1866 *actual_bytes = discarded_bytes;
1872 int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans,
1873 struct btrfs_root *root,
1874 u64 bytenr, u64 num_bytes, u64 parent,
1875 u64 root_objectid, u64 owner, u64 offset)
1878 BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID &&
1879 root_objectid == BTRFS_TREE_LOG_OBJECTID);
1881 if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1882 ret = btrfs_add_delayed_tree_ref(trans, bytenr, num_bytes,
1883 parent, root_objectid, (int)owner,
1884 BTRFS_ADD_DELAYED_REF, NULL);
1886 ret = btrfs_add_delayed_data_ref(trans, bytenr, num_bytes,
1887 parent, root_objectid, owner, offset,
1888 BTRFS_ADD_DELAYED_REF, NULL);
1893 static int __btrfs_inc_extent_ref(struct btrfs_trans_handle *trans,
1894 struct btrfs_root *root,
1895 u64 bytenr, u64 num_bytes,
1896 u64 parent, u64 root_objectid,
1897 u64 owner, u64 offset, int refs_to_add,
1898 struct btrfs_delayed_extent_op *extent_op)
1900 struct btrfs_path *path;
1901 struct extent_buffer *leaf;
1902 struct btrfs_extent_item *item;
1907 path = btrfs_alloc_path();
1912 path->leave_spinning = 1;
1913 /* this will setup the path even if it fails to insert the back ref */
1914 ret = insert_inline_extent_backref(trans, root->fs_info->extent_root,
1915 path, bytenr, num_bytes, parent,
1916 root_objectid, owner, offset,
1917 refs_to_add, extent_op);
1921 if (ret != -EAGAIN) {
1926 leaf = path->nodes[0];
1927 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1928 refs = btrfs_extent_refs(leaf, item);
1929 btrfs_set_extent_refs(leaf, item, refs + refs_to_add);
1931 __run_delayed_extent_op(extent_op, leaf, item);
1933 btrfs_mark_buffer_dirty(leaf);
1934 btrfs_release_path(path);
1937 path->leave_spinning = 1;
1939 /* now insert the actual backref */
1940 ret = insert_extent_backref(trans, root->fs_info->extent_root,
1941 path, bytenr, parent, root_objectid,
1942 owner, offset, refs_to_add);
1945 btrfs_free_path(path);
1949 static int run_delayed_data_ref(struct btrfs_trans_handle *trans,
1950 struct btrfs_root *root,
1951 struct btrfs_delayed_ref_node *node,
1952 struct btrfs_delayed_extent_op *extent_op,
1953 int insert_reserved)
1956 struct btrfs_delayed_data_ref *ref;
1957 struct btrfs_key ins;
1962 ins.objectid = node->bytenr;
1963 ins.offset = node->num_bytes;
1964 ins.type = BTRFS_EXTENT_ITEM_KEY;
1966 ref = btrfs_delayed_node_to_data_ref(node);
1967 if (node->type == BTRFS_SHARED_DATA_REF_KEY)
1968 parent = ref->parent;
1970 ref_root = ref->root;
1972 if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
1974 BUG_ON(extent_op->update_key);
1975 flags |= extent_op->flags_to_set;
1977 ret = alloc_reserved_file_extent(trans, root,
1978 parent, ref_root, flags,
1979 ref->objectid, ref->offset,
1980 &ins, node->ref_mod);
1981 } else if (node->action == BTRFS_ADD_DELAYED_REF) {
1982 ret = __btrfs_inc_extent_ref(trans, root, node->bytenr,
1983 node->num_bytes, parent,
1984 ref_root, ref->objectid,
1985 ref->offset, node->ref_mod,
1987 } else if (node->action == BTRFS_DROP_DELAYED_REF) {
1988 ret = __btrfs_free_extent(trans, root, node->bytenr,
1989 node->num_bytes, parent,
1990 ref_root, ref->objectid,
1991 ref->offset, node->ref_mod,
1999 static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op,
2000 struct extent_buffer *leaf,
2001 struct btrfs_extent_item *ei)
2003 u64 flags = btrfs_extent_flags(leaf, ei);
2004 if (extent_op->update_flags) {
2005 flags |= extent_op->flags_to_set;
2006 btrfs_set_extent_flags(leaf, ei, flags);
2009 if (extent_op->update_key) {
2010 struct btrfs_tree_block_info *bi;
2011 BUG_ON(!(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK));
2012 bi = (struct btrfs_tree_block_info *)(ei + 1);
2013 btrfs_set_tree_block_key(leaf, bi, &extent_op->key);
2017 static int run_delayed_extent_op(struct btrfs_trans_handle *trans,
2018 struct btrfs_root *root,
2019 struct btrfs_delayed_ref_node *node,
2020 struct btrfs_delayed_extent_op *extent_op)
2022 struct btrfs_key key;
2023 struct btrfs_path *path;
2024 struct btrfs_extent_item *ei;
2025 struct extent_buffer *leaf;
2030 path = btrfs_alloc_path();
2034 key.objectid = node->bytenr;
2035 key.type = BTRFS_EXTENT_ITEM_KEY;
2036 key.offset = node->num_bytes;
2039 path->leave_spinning = 1;
2040 ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key,
2051 leaf = path->nodes[0];
2052 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
2053 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2054 if (item_size < sizeof(*ei)) {
2055 ret = convert_extent_item_v0(trans, root->fs_info->extent_root,
2061 leaf = path->nodes[0];
2062 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
2065 BUG_ON(item_size < sizeof(*ei));
2066 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
2067 __run_delayed_extent_op(extent_op, leaf, ei);
2069 btrfs_mark_buffer_dirty(leaf);
2071 btrfs_free_path(path);
2075 static int run_delayed_tree_ref(struct btrfs_trans_handle *trans,
2076 struct btrfs_root *root,
2077 struct btrfs_delayed_ref_node *node,
2078 struct btrfs_delayed_extent_op *extent_op,
2079 int insert_reserved)
2082 struct btrfs_delayed_tree_ref *ref;
2083 struct btrfs_key ins;
2087 ins.objectid = node->bytenr;
2088 ins.offset = node->num_bytes;
2089 ins.type = BTRFS_EXTENT_ITEM_KEY;
2091 ref = btrfs_delayed_node_to_tree_ref(node);
2092 if (node->type == BTRFS_SHARED_BLOCK_REF_KEY)
2093 parent = ref->parent;
2095 ref_root = ref->root;
2097 BUG_ON(node->ref_mod != 1);
2098 if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
2099 BUG_ON(!extent_op || !extent_op->update_flags ||
2100 !extent_op->update_key);
2101 ret = alloc_reserved_tree_block(trans, root,
2103 extent_op->flags_to_set,
2106 } else if (node->action == BTRFS_ADD_DELAYED_REF) {
2107 ret = __btrfs_inc_extent_ref(trans, root, node->bytenr,
2108 node->num_bytes, parent, ref_root,
2109 ref->level, 0, 1, extent_op);
2110 } else if (node->action == BTRFS_DROP_DELAYED_REF) {
2111 ret = __btrfs_free_extent(trans, root, node->bytenr,
2112 node->num_bytes, parent, ref_root,
2113 ref->level, 0, 1, extent_op);
2120 /* helper function to actually process a single delayed ref entry */
2121 static int run_one_delayed_ref(struct btrfs_trans_handle *trans,
2122 struct btrfs_root *root,
2123 struct btrfs_delayed_ref_node *node,
2124 struct btrfs_delayed_extent_op *extent_op,
2125 int insert_reserved)
2128 if (btrfs_delayed_ref_is_head(node)) {
2129 struct btrfs_delayed_ref_head *head;
2131 * we've hit the end of the chain and we were supposed
2132 * to insert this extent into the tree. But, it got
2133 * deleted before we ever needed to insert it, so all
2134 * we have to do is clean up the accounting
2137 head = btrfs_delayed_node_to_head(node);
2138 if (insert_reserved) {
2139 btrfs_pin_extent(root, node->bytenr,
2140 node->num_bytes, 1);
2141 if (head->is_data) {
2142 ret = btrfs_del_csums(trans, root,
2148 mutex_unlock(&head->mutex);
2152 if (node->type == BTRFS_TREE_BLOCK_REF_KEY ||
2153 node->type == BTRFS_SHARED_BLOCK_REF_KEY)
2154 ret = run_delayed_tree_ref(trans, root, node, extent_op,
2156 else if (node->type == BTRFS_EXTENT_DATA_REF_KEY ||
2157 node->type == BTRFS_SHARED_DATA_REF_KEY)
2158 ret = run_delayed_data_ref(trans, root, node, extent_op,
2165 static noinline struct btrfs_delayed_ref_node *
2166 select_delayed_ref(struct btrfs_delayed_ref_head *head)
2168 struct rb_node *node;
2169 struct btrfs_delayed_ref_node *ref;
2170 int action = BTRFS_ADD_DELAYED_REF;
2173 * select delayed ref of type BTRFS_ADD_DELAYED_REF first.
2174 * this prevents ref count from going down to zero when
2175 * there still are pending delayed ref.
2177 node = rb_prev(&head->node.rb_node);
2181 ref = rb_entry(node, struct btrfs_delayed_ref_node,
2183 if (ref->bytenr != head->node.bytenr)
2185 if (ref->action == action)
2187 node = rb_prev(node);
2189 if (action == BTRFS_ADD_DELAYED_REF) {
2190 action = BTRFS_DROP_DELAYED_REF;
2196 static noinline int run_clustered_refs(struct btrfs_trans_handle *trans,
2197 struct btrfs_root *root,
2198 struct list_head *cluster)
2200 struct btrfs_delayed_ref_root *delayed_refs;
2201 struct btrfs_delayed_ref_node *ref;
2202 struct btrfs_delayed_ref_head *locked_ref = NULL;
2203 struct btrfs_delayed_extent_op *extent_op;
2206 int must_insert_reserved = 0;
2208 delayed_refs = &trans->transaction->delayed_refs;
2211 /* pick a new head ref from the cluster list */
2212 if (list_empty(cluster))
2215 locked_ref = list_entry(cluster->next,
2216 struct btrfs_delayed_ref_head, cluster);
2218 /* grab the lock that says we are going to process
2219 * all the refs for this head */
2220 ret = btrfs_delayed_ref_lock(trans, locked_ref);
2223 * we may have dropped the spin lock to get the head
2224 * mutex lock, and that might have given someone else
2225 * time to free the head. If that's true, it has been
2226 * removed from our list and we can move on.
2228 if (ret == -EAGAIN) {
2236 * record the must insert reserved flag before we
2237 * drop the spin lock.
2239 must_insert_reserved = locked_ref->must_insert_reserved;
2240 locked_ref->must_insert_reserved = 0;
2242 extent_op = locked_ref->extent_op;
2243 locked_ref->extent_op = NULL;
2246 * locked_ref is the head node, so we have to go one
2247 * node back for any delayed ref updates
2249 ref = select_delayed_ref(locked_ref);
2251 /* All delayed refs have been processed, Go ahead
2252 * and send the head node to run_one_delayed_ref,
2253 * so that any accounting fixes can happen
2255 ref = &locked_ref->node;
2257 if (extent_op && must_insert_reserved) {
2263 spin_unlock(&delayed_refs->lock);
2265 ret = run_delayed_extent_op(trans, root,
2271 spin_lock(&delayed_refs->lock);
2275 list_del_init(&locked_ref->cluster);
2280 rb_erase(&ref->rb_node, &delayed_refs->root);
2281 delayed_refs->num_entries--;
2283 spin_unlock(&delayed_refs->lock);
2285 ret = run_one_delayed_ref(trans, root, ref, extent_op,
2286 must_insert_reserved);
2289 btrfs_put_delayed_ref(ref);
2294 spin_lock(&delayed_refs->lock);
2300 * this starts processing the delayed reference count updates and
2301 * extent insertions we have queued up so far. count can be
2302 * 0, which means to process everything in the tree at the start
2303 * of the run (but not newly added entries), or it can be some target
2304 * number you'd like to process.
2306 int btrfs_run_delayed_refs(struct btrfs_trans_handle *trans,
2307 struct btrfs_root *root, unsigned long count)
2309 struct rb_node *node;
2310 struct btrfs_delayed_ref_root *delayed_refs;
2311 struct btrfs_delayed_ref_node *ref;
2312 struct list_head cluster;
2314 int run_all = count == (unsigned long)-1;
2317 if (root == root->fs_info->extent_root)
2318 root = root->fs_info->tree_root;
2320 delayed_refs = &trans->transaction->delayed_refs;
2321 INIT_LIST_HEAD(&cluster);
2323 spin_lock(&delayed_refs->lock);
2325 count = delayed_refs->num_entries * 2;
2329 if (!(run_all || run_most) &&
2330 delayed_refs->num_heads_ready < 64)
2334 * go find something we can process in the rbtree. We start at
2335 * the beginning of the tree, and then build a cluster
2336 * of refs to process starting at the first one we are able to
2339 ret = btrfs_find_ref_cluster(trans, &cluster,
2340 delayed_refs->run_delayed_start);
2344 ret = run_clustered_refs(trans, root, &cluster);
2347 count -= min_t(unsigned long, ret, count);
2354 node = rb_first(&delayed_refs->root);
2357 count = (unsigned long)-1;
2360 ref = rb_entry(node, struct btrfs_delayed_ref_node,
2362 if (btrfs_delayed_ref_is_head(ref)) {
2363 struct btrfs_delayed_ref_head *head;
2365 head = btrfs_delayed_node_to_head(ref);
2366 atomic_inc(&ref->refs);
2368 spin_unlock(&delayed_refs->lock);
2370 * Mutex was contended, block until it's
2371 * released and try again
2373 mutex_lock(&head->mutex);
2374 mutex_unlock(&head->mutex);
2376 btrfs_put_delayed_ref(ref);
2380 node = rb_next(node);
2382 spin_unlock(&delayed_refs->lock);
2383 schedule_timeout(1);
2387 spin_unlock(&delayed_refs->lock);
2391 int btrfs_set_disk_extent_flags(struct btrfs_trans_handle *trans,
2392 struct btrfs_root *root,
2393 u64 bytenr, u64 num_bytes, u64 flags,
2396 struct btrfs_delayed_extent_op *extent_op;
2399 extent_op = kmalloc(sizeof(*extent_op), GFP_NOFS);
2403 extent_op->flags_to_set = flags;
2404 extent_op->update_flags = 1;
2405 extent_op->update_key = 0;
2406 extent_op->is_data = is_data ? 1 : 0;
2408 ret = btrfs_add_delayed_extent_op(trans, bytenr, num_bytes, extent_op);
2414 static noinline int check_delayed_ref(struct btrfs_trans_handle *trans,
2415 struct btrfs_root *root,
2416 struct btrfs_path *path,
2417 u64 objectid, u64 offset, u64 bytenr)
2419 struct btrfs_delayed_ref_head *head;
2420 struct btrfs_delayed_ref_node *ref;
2421 struct btrfs_delayed_data_ref *data_ref;
2422 struct btrfs_delayed_ref_root *delayed_refs;
2423 struct rb_node *node;
2427 delayed_refs = &trans->transaction->delayed_refs;
2428 spin_lock(&delayed_refs->lock);
2429 head = btrfs_find_delayed_ref_head(trans, bytenr);
2433 if (!mutex_trylock(&head->mutex)) {
2434 atomic_inc(&head->node.refs);
2435 spin_unlock(&delayed_refs->lock);
2437 btrfs_release_path(path);
2440 * Mutex was contended, block until it's released and let
2443 mutex_lock(&head->mutex);
2444 mutex_unlock(&head->mutex);
2445 btrfs_put_delayed_ref(&head->node);
2449 node = rb_prev(&head->node.rb_node);
2453 ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
2455 if (ref->bytenr != bytenr)
2459 if (ref->type != BTRFS_EXTENT_DATA_REF_KEY)
2462 data_ref = btrfs_delayed_node_to_data_ref(ref);
2464 node = rb_prev(node);
2466 ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
2467 if (ref->bytenr == bytenr)
2471 if (data_ref->root != root->root_key.objectid ||
2472 data_ref->objectid != objectid || data_ref->offset != offset)
2477 mutex_unlock(&head->mutex);
2479 spin_unlock(&delayed_refs->lock);
2483 static noinline int check_committed_ref(struct btrfs_trans_handle *trans,
2484 struct btrfs_root *root,
2485 struct btrfs_path *path,
2486 u64 objectid, u64 offset, u64 bytenr)
2488 struct btrfs_root *extent_root = root->fs_info->extent_root;
2489 struct extent_buffer *leaf;
2490 struct btrfs_extent_data_ref *ref;
2491 struct btrfs_extent_inline_ref *iref;
2492 struct btrfs_extent_item *ei;
2493 struct btrfs_key key;
2497 key.objectid = bytenr;
2498 key.offset = (u64)-1;
2499 key.type = BTRFS_EXTENT_ITEM_KEY;
2501 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
2507 if (path->slots[0] == 0)
2511 leaf = path->nodes[0];
2512 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2514 if (key.objectid != bytenr || key.type != BTRFS_EXTENT_ITEM_KEY)
2518 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
2519 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2520 if (item_size < sizeof(*ei)) {
2521 WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0));
2525 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
2527 if (item_size != sizeof(*ei) +
2528 btrfs_extent_inline_ref_size(BTRFS_EXTENT_DATA_REF_KEY))
2531 if (btrfs_extent_generation(leaf, ei) <=
2532 btrfs_root_last_snapshot(&root->root_item))
2535 iref = (struct btrfs_extent_inline_ref *)(ei + 1);
2536 if (btrfs_extent_inline_ref_type(leaf, iref) !=
2537 BTRFS_EXTENT_DATA_REF_KEY)
2540 ref = (struct btrfs_extent_data_ref *)(&iref->offset);
2541 if (btrfs_extent_refs(leaf, ei) !=
2542 btrfs_extent_data_ref_count(leaf, ref) ||
2543 btrfs_extent_data_ref_root(leaf, ref) !=
2544 root->root_key.objectid ||
2545 btrfs_extent_data_ref_objectid(leaf, ref) != objectid ||
2546 btrfs_extent_data_ref_offset(leaf, ref) != offset)
2554 int btrfs_cross_ref_exist(struct btrfs_trans_handle *trans,
2555 struct btrfs_root *root,
2556 u64 objectid, u64 offset, u64 bytenr)
2558 struct btrfs_path *path;
2562 path = btrfs_alloc_path();
2567 ret = check_committed_ref(trans, root, path, objectid,
2569 if (ret && ret != -ENOENT)
2572 ret2 = check_delayed_ref(trans, root, path, objectid,
2574 } while (ret2 == -EAGAIN);
2576 if (ret2 && ret2 != -ENOENT) {
2581 if (ret != -ENOENT || ret2 != -ENOENT)
2584 btrfs_free_path(path);
2585 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
2590 static int __btrfs_mod_ref(struct btrfs_trans_handle *trans,
2591 struct btrfs_root *root,
2592 struct extent_buffer *buf,
2593 int full_backref, int inc)
2600 struct btrfs_key key;
2601 struct btrfs_file_extent_item *fi;
2605 int (*process_func)(struct btrfs_trans_handle *, struct btrfs_root *,
2606 u64, u64, u64, u64, u64, u64);
2608 ref_root = btrfs_header_owner(buf);
2609 nritems = btrfs_header_nritems(buf);
2610 level = btrfs_header_level(buf);
2612 if (!root->ref_cows && level == 0)
2616 process_func = btrfs_inc_extent_ref;
2618 process_func = btrfs_free_extent;
2621 parent = buf->start;
2625 for (i = 0; i < nritems; i++) {
2627 btrfs_item_key_to_cpu(buf, &key, i);
2628 if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY)
2630 fi = btrfs_item_ptr(buf, i,
2631 struct btrfs_file_extent_item);
2632 if (btrfs_file_extent_type(buf, fi) ==
2633 BTRFS_FILE_EXTENT_INLINE)
2635 bytenr = btrfs_file_extent_disk_bytenr(buf, fi);
2639 num_bytes = btrfs_file_extent_disk_num_bytes(buf, fi);
2640 key.offset -= btrfs_file_extent_offset(buf, fi);
2641 ret = process_func(trans, root, bytenr, num_bytes,
2642 parent, ref_root, key.objectid,
2647 bytenr = btrfs_node_blockptr(buf, i);
2648 num_bytes = btrfs_level_size(root, level - 1);
2649 ret = process_func(trans, root, bytenr, num_bytes,
2650 parent, ref_root, level - 1, 0);
2661 int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2662 struct extent_buffer *buf, int full_backref)
2664 return __btrfs_mod_ref(trans, root, buf, full_backref, 1);
2667 int btrfs_dec_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2668 struct extent_buffer *buf, int full_backref)
2670 return __btrfs_mod_ref(trans, root, buf, full_backref, 0);
2673 static int write_one_cache_group(struct btrfs_trans_handle *trans,
2674 struct btrfs_root *root,
2675 struct btrfs_path *path,
2676 struct btrfs_block_group_cache *cache)
2679 struct btrfs_root *extent_root = root->fs_info->extent_root;
2681 struct extent_buffer *leaf;
2683 ret = btrfs_search_slot(trans, extent_root, &cache->key, path, 0, 1);
2688 leaf = path->nodes[0];
2689 bi = btrfs_item_ptr_offset(leaf, path->slots[0]);
2690 write_extent_buffer(leaf, &cache->item, bi, sizeof(cache->item));
2691 btrfs_mark_buffer_dirty(leaf);
2692 btrfs_release_path(path);
2700 static struct btrfs_block_group_cache *
2701 next_block_group(struct btrfs_root *root,
2702 struct btrfs_block_group_cache *cache)
2704 struct rb_node *node;
2705 spin_lock(&root->fs_info->block_group_cache_lock);
2706 node = rb_next(&cache->cache_node);
2707 btrfs_put_block_group(cache);
2709 cache = rb_entry(node, struct btrfs_block_group_cache,
2711 btrfs_get_block_group(cache);
2714 spin_unlock(&root->fs_info->block_group_cache_lock);
2718 static int cache_save_setup(struct btrfs_block_group_cache *block_group,
2719 struct btrfs_trans_handle *trans,
2720 struct btrfs_path *path)
2722 struct btrfs_root *root = block_group->fs_info->tree_root;
2723 struct inode *inode = NULL;
2725 int dcs = BTRFS_DC_ERROR;
2731 * If this block group is smaller than 100 megs don't bother caching the
2734 if (block_group->key.offset < (100 * 1024 * 1024)) {
2735 spin_lock(&block_group->lock);
2736 block_group->disk_cache_state = BTRFS_DC_WRITTEN;
2737 spin_unlock(&block_group->lock);
2742 inode = lookup_free_space_inode(root, block_group, path);
2743 if (IS_ERR(inode) && PTR_ERR(inode) != -ENOENT) {
2744 ret = PTR_ERR(inode);
2745 btrfs_release_path(path);
2749 if (IS_ERR(inode)) {
2753 if (block_group->ro)
2756 ret = create_free_space_inode(root, trans, block_group, path);
2762 /* We've already setup this transaction, go ahead and exit */
2763 if (block_group->cache_generation == trans->transid &&
2764 i_size_read(inode)) {
2765 dcs = BTRFS_DC_SETUP;
2770 * We want to set the generation to 0, that way if anything goes wrong
2771 * from here on out we know not to trust this cache when we load up next
2774 BTRFS_I(inode)->generation = 0;
2775 ret = btrfs_update_inode(trans, root, inode);
2778 if (i_size_read(inode) > 0) {
2779 ret = btrfs_truncate_free_space_cache(root, trans, path,
2785 spin_lock(&block_group->lock);
2786 if (block_group->cached != BTRFS_CACHE_FINISHED) {
2787 /* We're not cached, don't bother trying to write stuff out */
2788 dcs = BTRFS_DC_WRITTEN;
2789 spin_unlock(&block_group->lock);
2792 spin_unlock(&block_group->lock);
2794 num_pages = (int)div64_u64(block_group->key.offset, 1024 * 1024 * 1024);
2799 * Just to make absolutely sure we have enough space, we're going to
2800 * preallocate 12 pages worth of space for each block group. In
2801 * practice we ought to use at most 8, but we need extra space so we can
2802 * add our header and have a terminator between the extents and the
2806 num_pages *= PAGE_CACHE_SIZE;
2808 ret = btrfs_check_data_free_space(inode, num_pages);
2812 ret = btrfs_prealloc_file_range_trans(inode, trans, 0, 0, num_pages,
2813 num_pages, num_pages,
2816 dcs = BTRFS_DC_SETUP;
2817 btrfs_free_reserved_data_space(inode, num_pages);
2822 btrfs_release_path(path);
2824 spin_lock(&block_group->lock);
2826 block_group->cache_generation = trans->transid;
2827 block_group->disk_cache_state = dcs;
2828 spin_unlock(&block_group->lock);
2833 int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans,
2834 struct btrfs_root *root)
2836 struct btrfs_block_group_cache *cache;
2838 struct btrfs_path *path;
2841 path = btrfs_alloc_path();
2847 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2849 if (cache->disk_cache_state == BTRFS_DC_CLEAR)
2851 cache = next_block_group(root, cache);
2859 err = cache_save_setup(cache, trans, path);
2860 last = cache->key.objectid + cache->key.offset;
2861 btrfs_put_block_group(cache);
2866 err = btrfs_run_delayed_refs(trans, root,
2871 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2873 if (cache->disk_cache_state == BTRFS_DC_CLEAR) {
2874 btrfs_put_block_group(cache);
2880 cache = next_block_group(root, cache);
2889 if (cache->disk_cache_state == BTRFS_DC_SETUP)
2890 cache->disk_cache_state = BTRFS_DC_NEED_WRITE;
2892 last = cache->key.objectid + cache->key.offset;
2894 err = write_one_cache_group(trans, root, path, cache);
2896 btrfs_put_block_group(cache);
2901 * I don't think this is needed since we're just marking our
2902 * preallocated extent as written, but just in case it can't
2906 err = btrfs_run_delayed_refs(trans, root,
2911 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2914 * Really this shouldn't happen, but it could if we
2915 * couldn't write the entire preallocated extent and
2916 * splitting the extent resulted in a new block.
2919 btrfs_put_block_group(cache);
2922 if (cache->disk_cache_state == BTRFS_DC_NEED_WRITE)
2924 cache = next_block_group(root, cache);
2933 btrfs_write_out_cache(root, trans, cache, path);
2936 * If we didn't have an error then the cache state is still
2937 * NEED_WRITE, so we can set it to WRITTEN.
2939 if (cache->disk_cache_state == BTRFS_DC_NEED_WRITE)
2940 cache->disk_cache_state = BTRFS_DC_WRITTEN;
2941 last = cache->key.objectid + cache->key.offset;
2942 btrfs_put_block_group(cache);
2945 btrfs_free_path(path);
2949 int btrfs_extent_readonly(struct btrfs_root *root, u64 bytenr)
2951 struct btrfs_block_group_cache *block_group;
2954 block_group = btrfs_lookup_block_group(root->fs_info, bytenr);
2955 if (!block_group || block_group->ro)
2958 btrfs_put_block_group(block_group);
2962 static int update_space_info(struct btrfs_fs_info *info, u64 flags,
2963 u64 total_bytes, u64 bytes_used,
2964 struct btrfs_space_info **space_info)
2966 struct btrfs_space_info *found;
2970 if (flags & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1 |
2971 BTRFS_BLOCK_GROUP_RAID10))
2976 found = __find_space_info(info, flags);
2978 spin_lock(&found->lock);
2979 found->total_bytes += total_bytes;
2980 found->disk_total += total_bytes * factor;
2981 found->bytes_used += bytes_used;
2982 found->disk_used += bytes_used * factor;
2984 spin_unlock(&found->lock);
2985 *space_info = found;
2988 found = kzalloc(sizeof(*found), GFP_NOFS);
2992 for (i = 0; i < BTRFS_NR_RAID_TYPES; i++)
2993 INIT_LIST_HEAD(&found->block_groups[i]);
2994 init_rwsem(&found->groups_sem);
2995 spin_lock_init(&found->lock);
2996 found->flags = flags & (BTRFS_BLOCK_GROUP_DATA |
2997 BTRFS_BLOCK_GROUP_SYSTEM |
2998 BTRFS_BLOCK_GROUP_METADATA);
2999 found->total_bytes = total_bytes;
3000 found->disk_total = total_bytes * factor;
3001 found->bytes_used = bytes_used;
3002 found->disk_used = bytes_used * factor;
3003 found->bytes_pinned = 0;
3004 found->bytes_reserved = 0;
3005 found->bytes_readonly = 0;
3006 found->bytes_may_use = 0;
3008 found->force_alloc = CHUNK_ALLOC_NO_FORCE;
3009 found->chunk_alloc = 0;
3011 init_waitqueue_head(&found->wait);
3012 *space_info = found;
3013 list_add_rcu(&found->list, &info->space_info);
3017 static void set_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags)
3019 u64 extra_flags = flags & (BTRFS_BLOCK_GROUP_RAID0 |
3020 BTRFS_BLOCK_GROUP_RAID1 |
3021 BTRFS_BLOCK_GROUP_RAID10 |
3022 BTRFS_BLOCK_GROUP_DUP);
3024 if (flags & BTRFS_BLOCK_GROUP_DATA)
3025 fs_info->avail_data_alloc_bits |= extra_flags;
3026 if (flags & BTRFS_BLOCK_GROUP_METADATA)
3027 fs_info->avail_metadata_alloc_bits |= extra_flags;
3028 if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
3029 fs_info->avail_system_alloc_bits |= extra_flags;
3033 u64 btrfs_reduce_alloc_profile(struct btrfs_root *root, u64 flags)
3036 * we add in the count of missing devices because we want
3037 * to make sure that any RAID levels on a degraded FS
3038 * continue to be honored.
3040 u64 num_devices = root->fs_info->fs_devices->rw_devices +
3041 root->fs_info->fs_devices->missing_devices;
3043 if (num_devices == 1)
3044 flags &= ~(BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID0);
3045 if (num_devices < 4)
3046 flags &= ~BTRFS_BLOCK_GROUP_RAID10;
3048 if ((flags & BTRFS_BLOCK_GROUP_DUP) &&
3049 (flags & (BTRFS_BLOCK_GROUP_RAID1 |
3050 BTRFS_BLOCK_GROUP_RAID10))) {
3051 flags &= ~BTRFS_BLOCK_GROUP_DUP;
3054 if ((flags & BTRFS_BLOCK_GROUP_RAID1) &&
3055 (flags & BTRFS_BLOCK_GROUP_RAID10)) {
3056 flags &= ~BTRFS_BLOCK_GROUP_RAID1;
3059 if ((flags & BTRFS_BLOCK_GROUP_RAID0) &&
3060 ((flags & BTRFS_BLOCK_GROUP_RAID1) |
3061 (flags & BTRFS_BLOCK_GROUP_RAID10) |
3062 (flags & BTRFS_BLOCK_GROUP_DUP)))
3063 flags &= ~BTRFS_BLOCK_GROUP_RAID0;
3067 static u64 get_alloc_profile(struct btrfs_root *root, u64 flags)
3069 if (flags & BTRFS_BLOCK_GROUP_DATA)
3070 flags |= root->fs_info->avail_data_alloc_bits &
3071 root->fs_info->data_alloc_profile;
3072 else if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
3073 flags |= root->fs_info->avail_system_alloc_bits &
3074 root->fs_info->system_alloc_profile;
3075 else if (flags & BTRFS_BLOCK_GROUP_METADATA)
3076 flags |= root->fs_info->avail_metadata_alloc_bits &
3077 root->fs_info->metadata_alloc_profile;
3078 return btrfs_reduce_alloc_profile(root, flags);
3081 u64 btrfs_get_alloc_profile(struct btrfs_root *root, int data)
3086 flags = BTRFS_BLOCK_GROUP_DATA;
3087 else if (root == root->fs_info->chunk_root)
3088 flags = BTRFS_BLOCK_GROUP_SYSTEM;
3090 flags = BTRFS_BLOCK_GROUP_METADATA;
3092 return get_alloc_profile(root, flags);
3095 void btrfs_set_inode_space_info(struct btrfs_root *root, struct inode *inode)
3097 BTRFS_I(inode)->space_info = __find_space_info(root->fs_info,
3098 BTRFS_BLOCK_GROUP_DATA);
3102 * This will check the space that the inode allocates from to make sure we have
3103 * enough space for bytes.
3105 int btrfs_check_data_free_space(struct inode *inode, u64 bytes)
3107 struct btrfs_space_info *data_sinfo;
3108 struct btrfs_root *root = BTRFS_I(inode)->root;
3110 int ret = 0, committed = 0, alloc_chunk = 1;
3112 /* make sure bytes are sectorsize aligned */
3113 bytes = (bytes + root->sectorsize - 1) & ~((u64)root->sectorsize - 1);
3115 if (root == root->fs_info->tree_root ||
3116 BTRFS_I(inode)->location.objectid == BTRFS_FREE_INO_OBJECTID) {
3121 data_sinfo = BTRFS_I(inode)->space_info;
3126 /* make sure we have enough space to handle the data first */
3127 spin_lock(&data_sinfo->lock);
3128 used = data_sinfo->bytes_used + data_sinfo->bytes_reserved +
3129 data_sinfo->bytes_pinned + data_sinfo->bytes_readonly +
3130 data_sinfo->bytes_may_use;
3132 if (used + bytes > data_sinfo->total_bytes) {
3133 struct btrfs_trans_handle *trans;
3136 * if we don't have enough free bytes in this space then we need
3137 * to alloc a new chunk.
3139 if (!data_sinfo->full && alloc_chunk) {
3142 data_sinfo->force_alloc = CHUNK_ALLOC_FORCE;
3143 spin_unlock(&data_sinfo->lock);
3145 alloc_target = btrfs_get_alloc_profile(root, 1);
3146 trans = btrfs_join_transaction(root);
3148 return PTR_ERR(trans);
3150 ret = do_chunk_alloc(trans, root->fs_info->extent_root,
3151 bytes + 2 * 1024 * 1024,
3153 CHUNK_ALLOC_NO_FORCE);
3154 btrfs_end_transaction(trans, root);
3163 btrfs_set_inode_space_info(root, inode);
3164 data_sinfo = BTRFS_I(inode)->space_info;
3170 * If we have less pinned bytes than we want to allocate then
3171 * don't bother committing the transaction, it won't help us.
3173 if (data_sinfo->bytes_pinned < bytes)
3175 spin_unlock(&data_sinfo->lock);
3177 /* commit the current transaction and try again */
3180 !atomic_read(&root->fs_info->open_ioctl_trans)) {
3182 trans = btrfs_join_transaction(root);
3184 return PTR_ERR(trans);
3185 ret = btrfs_commit_transaction(trans, root);
3193 data_sinfo->bytes_may_use += bytes;
3194 spin_unlock(&data_sinfo->lock);
3200 * Called if we need to clear a data reservation for this inode.
3202 void btrfs_free_reserved_data_space(struct inode *inode, u64 bytes)
3204 struct btrfs_root *root = BTRFS_I(inode)->root;
3205 struct btrfs_space_info *data_sinfo;
3207 /* make sure bytes are sectorsize aligned */
3208 bytes = (bytes + root->sectorsize - 1) & ~((u64)root->sectorsize - 1);
3210 data_sinfo = BTRFS_I(inode)->space_info;
3211 spin_lock(&data_sinfo->lock);
3212 data_sinfo->bytes_may_use -= bytes;
3213 spin_unlock(&data_sinfo->lock);
3216 static void force_metadata_allocation(struct btrfs_fs_info *info)
3218 struct list_head *head = &info->space_info;
3219 struct btrfs_space_info *found;
3222 list_for_each_entry_rcu(found, head, list) {
3223 if (found->flags & BTRFS_BLOCK_GROUP_METADATA)
3224 found->force_alloc = CHUNK_ALLOC_FORCE;
3229 static int should_alloc_chunk(struct btrfs_root *root,
3230 struct btrfs_space_info *sinfo, u64 alloc_bytes,
3233 struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv;
3234 u64 num_bytes = sinfo->total_bytes - sinfo->bytes_readonly;
3235 u64 num_allocated = sinfo->bytes_used + sinfo->bytes_reserved;
3238 if (force == CHUNK_ALLOC_FORCE)
3242 * We need to take into account the global rsv because for all intents
3243 * and purposes it's used space. Don't worry about locking the
3244 * global_rsv, it doesn't change except when the transaction commits.
3246 num_allocated += global_rsv->size;
3249 * in limited mode, we want to have some free space up to
3250 * about 1% of the FS size.
3252 if (force == CHUNK_ALLOC_LIMITED) {
3253 thresh = btrfs_super_total_bytes(root->fs_info->super_copy);
3254 thresh = max_t(u64, 64 * 1024 * 1024,
3255 div_factor_fine(thresh, 1));
3257 if (num_bytes - num_allocated < thresh)
3262 * we have two similar checks here, one based on percentage
3263 * and once based on a hard number of 256MB. The idea
3264 * is that if we have a good amount of free
3265 * room, don't allocate a chunk. A good mount is
3266 * less than 80% utilized of the chunks we have allocated,
3267 * or more than 256MB free
3269 if (num_allocated + alloc_bytes + 256 * 1024 * 1024 < num_bytes)
3272 if (num_allocated + alloc_bytes < div_factor(num_bytes, 8))
3275 thresh = btrfs_super_total_bytes(root->fs_info->super_copy);
3277 /* 256MB or 5% of the FS */
3278 thresh = max_t(u64, 256 * 1024 * 1024, div_factor_fine(thresh, 5));
3280 if (num_bytes > thresh && sinfo->bytes_used < div_factor(num_bytes, 3))
3285 static int do_chunk_alloc(struct btrfs_trans_handle *trans,
3286 struct btrfs_root *extent_root, u64 alloc_bytes,
3287 u64 flags, int force)
3289 struct btrfs_space_info *space_info;
3290 struct btrfs_fs_info *fs_info = extent_root->fs_info;
3291 int wait_for_alloc = 0;
3294 flags = btrfs_reduce_alloc_profile(extent_root, flags);
3296 space_info = __find_space_info(extent_root->fs_info, flags);
3298 ret = update_space_info(extent_root->fs_info, flags,
3302 BUG_ON(!space_info);
3305 spin_lock(&space_info->lock);
3306 if (space_info->force_alloc)
3307 force = space_info->force_alloc;
3308 if (space_info->full) {
3309 spin_unlock(&space_info->lock);
3313 if (!should_alloc_chunk(extent_root, space_info, alloc_bytes, force)) {
3314 spin_unlock(&space_info->lock);
3316 } else if (space_info->chunk_alloc) {
3319 space_info->chunk_alloc = 1;
3322 spin_unlock(&space_info->lock);
3324 mutex_lock(&fs_info->chunk_mutex);
3327 * The chunk_mutex is held throughout the entirety of a chunk
3328 * allocation, so once we've acquired the chunk_mutex we know that the
3329 * other guy is done and we need to recheck and see if we should
3332 if (wait_for_alloc) {
3333 mutex_unlock(&fs_info->chunk_mutex);
3339 * If we have mixed data/metadata chunks we want to make sure we keep
3340 * allocating mixed chunks instead of individual chunks.
3342 if (btrfs_mixed_space_info(space_info))
3343 flags |= (BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA);
3346 * if we're doing a data chunk, go ahead and make sure that
3347 * we keep a reasonable number of metadata chunks allocated in the
3350 if (flags & BTRFS_BLOCK_GROUP_DATA && fs_info->metadata_ratio) {
3351 fs_info->data_chunk_allocations++;
3352 if (!(fs_info->data_chunk_allocations %
3353 fs_info->metadata_ratio))
3354 force_metadata_allocation(fs_info);
3357 ret = btrfs_alloc_chunk(trans, extent_root, flags);
3358 if (ret < 0 && ret != -ENOSPC)
3361 spin_lock(&space_info->lock);
3363 space_info->full = 1;
3367 space_info->force_alloc = CHUNK_ALLOC_NO_FORCE;
3368 space_info->chunk_alloc = 0;
3369 spin_unlock(&space_info->lock);
3371 mutex_unlock(&extent_root->fs_info->chunk_mutex);
3376 * shrink metadata reservation for delalloc
3378 static int shrink_delalloc(struct btrfs_root *root, u64 to_reclaim,
3381 struct btrfs_block_rsv *block_rsv;
3382 struct btrfs_space_info *space_info;
3383 struct btrfs_trans_handle *trans;
3388 unsigned long nr_pages = (2 * 1024 * 1024) >> PAGE_CACHE_SHIFT;
3390 unsigned long progress;
3392 trans = (struct btrfs_trans_handle *)current->journal_info;
3393 block_rsv = &root->fs_info->delalloc_block_rsv;
3394 space_info = block_rsv->space_info;
3397 reserved = space_info->bytes_may_use;
3398 progress = space_info->reservation_progress;
3404 if (root->fs_info->delalloc_bytes == 0) {
3407 btrfs_wait_ordered_extents(root, 0, 0);
3411 max_reclaim = min(reserved, to_reclaim);
3412 nr_pages = max_t(unsigned long, nr_pages,
3413 max_reclaim >> PAGE_CACHE_SHIFT);
3414 while (loops < 1024) {
3415 /* have the flusher threads jump in and do some IO */
3417 nr_pages = min_t(unsigned long, nr_pages,
3418 root->fs_info->delalloc_bytes >> PAGE_CACHE_SHIFT);
3419 writeback_inodes_sb_nr_if_idle(root->fs_info->sb, nr_pages);
3421 spin_lock(&space_info->lock);
3422 if (reserved > space_info->bytes_may_use)
3423 reclaimed += reserved - space_info->bytes_may_use;
3424 reserved = space_info->bytes_may_use;
3425 spin_unlock(&space_info->lock);
3429 if (reserved == 0 || reclaimed >= max_reclaim)
3432 if (trans && trans->transaction->blocked)
3435 if (wait_ordered && !trans) {
3436 btrfs_wait_ordered_extents(root, 0, 0);
3438 time_left = schedule_timeout_interruptible(1);
3440 /* We were interrupted, exit */
3445 /* we've kicked the IO a few times, if anything has been freed,
3446 * exit. There is no sense in looping here for a long time
3447 * when we really need to commit the transaction, or there are
3448 * just too many writers without enough free space
3453 if (progress != space_info->reservation_progress)
3459 return reclaimed >= to_reclaim;
3463 * maybe_commit_transaction - possibly commit the transaction if its ok to
3464 * @root - the root we're allocating for
3465 * @bytes - the number of bytes we want to reserve
3466 * @force - force the commit
3468 * This will check to make sure that committing the transaction will actually
3469 * get us somewhere and then commit the transaction if it does. Otherwise it
3470 * will return -ENOSPC.
3472 static int may_commit_transaction(struct btrfs_root *root,
3473 struct btrfs_space_info *space_info,
3474 u64 bytes, int force)
3476 struct btrfs_block_rsv *delayed_rsv = &root->fs_info->delayed_block_rsv;
3477 struct btrfs_trans_handle *trans;
3479 trans = (struct btrfs_trans_handle *)current->journal_info;
3486 /* See if there is enough pinned space to make this reservation */
3487 spin_lock(&space_info->lock);
3488 if (space_info->bytes_pinned >= bytes) {
3489 spin_unlock(&space_info->lock);
3492 spin_unlock(&space_info->lock);
3495 * See if there is some space in the delayed insertion reservation for
3498 if (space_info != delayed_rsv->space_info)
3501 spin_lock(&delayed_rsv->lock);
3502 if (delayed_rsv->size < bytes) {
3503 spin_unlock(&delayed_rsv->lock);
3506 spin_unlock(&delayed_rsv->lock);
3509 trans = btrfs_join_transaction(root);
3513 return btrfs_commit_transaction(trans, root);
3517 * reserve_metadata_bytes - try to reserve bytes from the block_rsv's space
3518 * @root - the root we're allocating for
3519 * @block_rsv - the block_rsv we're allocating for
3520 * @orig_bytes - the number of bytes we want
3521 * @flush - wether or not we can flush to make our reservation
3523 * This will reserve orgi_bytes number of bytes from the space info associated
3524 * with the block_rsv. If there is not enough space it will make an attempt to
3525 * flush out space to make room. It will do this by flushing delalloc if
3526 * possible or committing the transaction. If flush is 0 then no attempts to
3527 * regain reservations will be made and this will fail if there is not enough
3530 static int reserve_metadata_bytes(struct btrfs_root *root,
3531 struct btrfs_block_rsv *block_rsv,
3532 u64 orig_bytes, int flush)
3534 struct btrfs_space_info *space_info = block_rsv->space_info;
3536 u64 num_bytes = orig_bytes;
3539 bool committed = false;
3540 bool flushing = false;
3541 bool wait_ordered = false;
3545 spin_lock(&space_info->lock);
3547 * We only want to wait if somebody other than us is flushing and we are
3548 * actually alloed to flush.
3550 while (flush && !flushing && space_info->flush) {
3551 spin_unlock(&space_info->lock);
3553 * If we have a trans handle we can't wait because the flusher
3554 * may have to commit the transaction, which would mean we would
3555 * deadlock since we are waiting for the flusher to finish, but
3556 * hold the current transaction open.
3558 if (current->journal_info)
3560 ret = wait_event_interruptible(space_info->wait,
3561 !space_info->flush);
3562 /* Must have been interrupted, return */
3566 spin_lock(&space_info->lock);
3570 used = space_info->bytes_used + space_info->bytes_reserved +
3571 space_info->bytes_pinned + space_info->bytes_readonly +
3572 space_info->bytes_may_use;
3575 * The idea here is that we've not already over-reserved the block group
3576 * then we can go ahead and save our reservation first and then start
3577 * flushing if we need to. Otherwise if we've already overcommitted
3578 * lets start flushing stuff first and then come back and try to make
3581 if (used <= space_info->total_bytes) {
3582 if (used + orig_bytes <= space_info->total_bytes) {
3583 space_info->bytes_may_use += orig_bytes;
3587 * Ok set num_bytes to orig_bytes since we aren't
3588 * overocmmitted, this way we only try and reclaim what
3591 num_bytes = orig_bytes;
3595 * Ok we're over committed, set num_bytes to the overcommitted
3596 * amount plus the amount of bytes that we need for this
3599 wait_ordered = true;
3600 num_bytes = used - space_info->total_bytes +
3601 (orig_bytes * (retries + 1));
3605 u64 profile = btrfs_get_alloc_profile(root, 0);
3609 * If we have a lot of space that's pinned, don't bother doing
3610 * the overcommit dance yet and just commit the transaction.
3612 avail = (space_info->total_bytes - space_info->bytes_used) * 8;
3614 if (space_info->bytes_pinned >= avail && flush && !committed) {
3615 space_info->flush = 1;
3617 spin_unlock(&space_info->lock);
3618 ret = may_commit_transaction(root, space_info,
3626 spin_lock(&root->fs_info->free_chunk_lock);
3627 avail = root->fs_info->free_chunk_space;
3630 * If we have dup, raid1 or raid10 then only half of the free
3631 * space is actually useable.
3633 if (profile & (BTRFS_BLOCK_GROUP_DUP |
3634 BTRFS_BLOCK_GROUP_RAID1 |
3635 BTRFS_BLOCK_GROUP_RAID10))
3639 * If we aren't flushing don't let us overcommit too much, say
3640 * 1/8th of the space. If we can flush, let it overcommit up to
3647 spin_unlock(&root->fs_info->free_chunk_lock);
3649 if (used + num_bytes < space_info->total_bytes + avail) {
3650 space_info->bytes_may_use += orig_bytes;
3653 wait_ordered = true;
3658 * Couldn't make our reservation, save our place so while we're trying
3659 * to reclaim space we can actually use it instead of somebody else
3660 * stealing it from us.
3664 space_info->flush = 1;
3667 spin_unlock(&space_info->lock);
3673 * We do synchronous shrinking since we don't actually unreserve
3674 * metadata until after the IO is completed.
3676 ret = shrink_delalloc(root, num_bytes, wait_ordered);
3683 * So if we were overcommitted it's possible that somebody else flushed
3684 * out enough space and we simply didn't have enough space to reclaim,
3685 * so go back around and try again.
3688 wait_ordered = true;
3697 ret = may_commit_transaction(root, space_info, orig_bytes, 0);
3705 spin_lock(&space_info->lock);
3706 space_info->flush = 0;
3707 wake_up_all(&space_info->wait);
3708 spin_unlock(&space_info->lock);
3713 static struct btrfs_block_rsv *get_block_rsv(struct btrfs_trans_handle *trans,
3714 struct btrfs_root *root)
3716 struct btrfs_block_rsv *block_rsv = NULL;
3718 if (root->ref_cows || root == root->fs_info->csum_root)
3719 block_rsv = trans->block_rsv;
3722 block_rsv = root->block_rsv;
3725 block_rsv = &root->fs_info->empty_block_rsv;
3730 static int block_rsv_use_bytes(struct btrfs_block_rsv *block_rsv,
3734 spin_lock(&block_rsv->lock);
3735 if (block_rsv->reserved >= num_bytes) {
3736 block_rsv->reserved -= num_bytes;
3737 if (block_rsv->reserved < block_rsv->size)
3738 block_rsv->full = 0;
3741 spin_unlock(&block_rsv->lock);
3745 static void block_rsv_add_bytes(struct btrfs_block_rsv *block_rsv,
3746 u64 num_bytes, int update_size)
3748 spin_lock(&block_rsv->lock);
3749 block_rsv->reserved += num_bytes;
3751 block_rsv->size += num_bytes;
3752 else if (block_rsv->reserved >= block_rsv->size)
3753 block_rsv->full = 1;
3754 spin_unlock(&block_rsv->lock);
3757 static void block_rsv_release_bytes(struct btrfs_block_rsv *block_rsv,
3758 struct btrfs_block_rsv *dest, u64 num_bytes)
3760 struct btrfs_space_info *space_info = block_rsv->space_info;
3762 spin_lock(&block_rsv->lock);
3763 if (num_bytes == (u64)-1)
3764 num_bytes = block_rsv->size;
3765 block_rsv->size -= num_bytes;
3766 if (block_rsv->reserved >= block_rsv->size) {
3767 num_bytes = block_rsv->reserved - block_rsv->size;
3768 block_rsv->reserved = block_rsv->size;
3769 block_rsv->full = 1;
3773 spin_unlock(&block_rsv->lock);
3775 if (num_bytes > 0) {
3777 spin_lock(&dest->lock);
3781 bytes_to_add = dest->size - dest->reserved;
3782 bytes_to_add = min(num_bytes, bytes_to_add);
3783 dest->reserved += bytes_to_add;
3784 if (dest->reserved >= dest->size)
3786 num_bytes -= bytes_to_add;
3788 spin_unlock(&dest->lock);
3791 spin_lock(&space_info->lock);
3792 space_info->bytes_may_use -= num_bytes;
3793 space_info->reservation_progress++;
3794 spin_unlock(&space_info->lock);
3799 static int block_rsv_migrate_bytes(struct btrfs_block_rsv *src,
3800 struct btrfs_block_rsv *dst, u64 num_bytes)
3804 ret = block_rsv_use_bytes(src, num_bytes);
3808 block_rsv_add_bytes(dst, num_bytes, 1);
3812 void btrfs_init_block_rsv(struct btrfs_block_rsv *rsv)
3814 memset(rsv, 0, sizeof(*rsv));
3815 spin_lock_init(&rsv->lock);
3818 struct btrfs_block_rsv *btrfs_alloc_block_rsv(struct btrfs_root *root)
3820 struct btrfs_block_rsv *block_rsv;
3821 struct btrfs_fs_info *fs_info = root->fs_info;
3823 block_rsv = kmalloc(sizeof(*block_rsv), GFP_NOFS);
3827 btrfs_init_block_rsv(block_rsv);
3828 block_rsv->space_info = __find_space_info(fs_info,
3829 BTRFS_BLOCK_GROUP_METADATA);
3833 void btrfs_free_block_rsv(struct btrfs_root *root,
3834 struct btrfs_block_rsv *rsv)
3836 btrfs_block_rsv_release(root, rsv, (u64)-1);
3840 static inline int __block_rsv_add(struct btrfs_root *root,
3841 struct btrfs_block_rsv *block_rsv,
3842 u64 num_bytes, int flush)
3849 ret = reserve_metadata_bytes(root, block_rsv, num_bytes, flush);
3851 block_rsv_add_bytes(block_rsv, num_bytes, 1);
3858 int btrfs_block_rsv_add(struct btrfs_root *root,
3859 struct btrfs_block_rsv *block_rsv,
3862 return __block_rsv_add(root, block_rsv, num_bytes, 1);
3865 int btrfs_block_rsv_add_noflush(struct btrfs_root *root,
3866 struct btrfs_block_rsv *block_rsv,
3869 return __block_rsv_add(root, block_rsv, num_bytes, 0);
3872 int btrfs_block_rsv_check(struct btrfs_root *root,
3873 struct btrfs_block_rsv *block_rsv, int min_factor)
3881 spin_lock(&block_rsv->lock);
3882 num_bytes = div_factor(block_rsv->size, min_factor);
3883 if (block_rsv->reserved >= num_bytes)
3885 spin_unlock(&block_rsv->lock);
3890 static inline int __btrfs_block_rsv_refill(struct btrfs_root *root,
3891 struct btrfs_block_rsv *block_rsv,
3892 u64 min_reserved, int flush)
3900 spin_lock(&block_rsv->lock);
3901 num_bytes = min_reserved;
3902 if (block_rsv->reserved >= num_bytes)
3905 num_bytes -= block_rsv->reserved;
3906 spin_unlock(&block_rsv->lock);
3911 ret = reserve_metadata_bytes(root, block_rsv, num_bytes, flush);
3913 block_rsv_add_bytes(block_rsv, num_bytes, 0);
3920 int btrfs_block_rsv_refill(struct btrfs_root *root,
3921 struct btrfs_block_rsv *block_rsv,
3924 return __btrfs_block_rsv_refill(root, block_rsv, min_reserved, 1);
3927 int btrfs_block_rsv_refill_noflush(struct btrfs_root *root,
3928 struct btrfs_block_rsv *block_rsv,
3931 return __btrfs_block_rsv_refill(root, block_rsv, min_reserved, 0);
3934 int btrfs_block_rsv_migrate(struct btrfs_block_rsv *src_rsv,
3935 struct btrfs_block_rsv *dst_rsv,
3938 return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes);
3941 void btrfs_block_rsv_release(struct btrfs_root *root,
3942 struct btrfs_block_rsv *block_rsv,
3945 struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv;
3946 if (global_rsv->full || global_rsv == block_rsv ||
3947 block_rsv->space_info != global_rsv->space_info)
3949 block_rsv_release_bytes(block_rsv, global_rsv, num_bytes);
3953 * helper to calculate size of global block reservation.
3954 * the desired value is sum of space used by extent tree,
3955 * checksum tree and root tree
3957 static u64 calc_global_metadata_size(struct btrfs_fs_info *fs_info)
3959 struct btrfs_space_info *sinfo;
3963 int csum_size = btrfs_super_csum_size(fs_info->super_copy);
3965 sinfo = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_DATA);
3966 spin_lock(&sinfo->lock);
3967 data_used = sinfo->bytes_used;
3968 spin_unlock(&sinfo->lock);
3970 sinfo = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA);
3971 spin_lock(&sinfo->lock);
3972 if (sinfo->flags & BTRFS_BLOCK_GROUP_DATA)
3974 meta_used = sinfo->bytes_used;
3975 spin_unlock(&sinfo->lock);
3977 num_bytes = (data_used >> fs_info->sb->s_blocksize_bits) *
3979 num_bytes += div64_u64(data_used + meta_used, 50);
3981 if (num_bytes * 3 > meta_used)
3982 num_bytes = div64_u64(meta_used, 3);
3984 return ALIGN(num_bytes, fs_info->extent_root->leafsize << 10);
3987 static void update_global_block_rsv(struct btrfs_fs_info *fs_info)
3989 struct btrfs_block_rsv *block_rsv = &fs_info->global_block_rsv;
3990 struct btrfs_space_info *sinfo = block_rsv->space_info;
3993 num_bytes = calc_global_metadata_size(fs_info);
3995 spin_lock(&block_rsv->lock);
3996 spin_lock(&sinfo->lock);
3998 block_rsv->size = num_bytes;
4000 num_bytes = sinfo->bytes_used + sinfo->bytes_pinned +
4001 sinfo->bytes_reserved + sinfo->bytes_readonly +
4002 sinfo->bytes_may_use;
4004 if (sinfo->total_bytes > num_bytes) {
4005 num_bytes = sinfo->total_bytes - num_bytes;
4006 block_rsv->reserved += num_bytes;
4007 sinfo->bytes_may_use += num_bytes;
4010 if (block_rsv->reserved >= block_rsv->size) {
4011 num_bytes = block_rsv->reserved - block_rsv->size;
4012 sinfo->bytes_may_use -= num_bytes;
4013 sinfo->reservation_progress++;
4014 block_rsv->reserved = block_rsv->size;
4015 block_rsv->full = 1;
4018 spin_unlock(&sinfo->lock);
4019 spin_unlock(&block_rsv->lock);
4022 static void init_global_block_rsv(struct btrfs_fs_info *fs_info)
4024 struct btrfs_space_info *space_info;
4026 space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_SYSTEM);
4027 fs_info->chunk_block_rsv.space_info = space_info;
4029 space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA);
4030 fs_info->global_block_rsv.space_info = space_info;
4031 fs_info->delalloc_block_rsv.space_info = space_info;
4032 fs_info->trans_block_rsv.space_info = space_info;
4033 fs_info->empty_block_rsv.space_info = space_info;
4034 fs_info->delayed_block_rsv.space_info = space_info;
4036 fs_info->extent_root->block_rsv = &fs_info->global_block_rsv;
4037 fs_info->csum_root->block_rsv = &fs_info->global_block_rsv;
4038 fs_info->dev_root->block_rsv = &fs_info->global_block_rsv;
4039 fs_info->tree_root->block_rsv = &fs_info->global_block_rsv;
4040 fs_info->chunk_root->block_rsv = &fs_info->chunk_block_rsv;
4042 update_global_block_rsv(fs_info);
4045 static void release_global_block_rsv(struct btrfs_fs_info *fs_info)
4047 block_rsv_release_bytes(&fs_info->global_block_rsv, NULL, (u64)-1);
4048 WARN_ON(fs_info->delalloc_block_rsv.size > 0);
4049 WARN_ON(fs_info->delalloc_block_rsv.reserved > 0);
4050 WARN_ON(fs_info->trans_block_rsv.size > 0);
4051 WARN_ON(fs_info->trans_block_rsv.reserved > 0);
4052 WARN_ON(fs_info->chunk_block_rsv.size > 0);
4053 WARN_ON(fs_info->chunk_block_rsv.reserved > 0);
4054 WARN_ON(fs_info->delayed_block_rsv.size > 0);
4055 WARN_ON(fs_info->delayed_block_rsv.reserved > 0);
4058 void btrfs_trans_release_metadata(struct btrfs_trans_handle *trans,
4059 struct btrfs_root *root)
4061 if (!trans->bytes_reserved)
4064 btrfs_block_rsv_release(root, trans->block_rsv, trans->bytes_reserved);
4065 trans->bytes_reserved = 0;
4068 int btrfs_orphan_reserve_metadata(struct btrfs_trans_handle *trans,
4069 struct inode *inode)
4071 struct btrfs_root *root = BTRFS_I(inode)->root;
4072 struct btrfs_block_rsv *src_rsv = get_block_rsv(trans, root);
4073 struct btrfs_block_rsv *dst_rsv = root->orphan_block_rsv;
4076 * We need to hold space in order to delete our orphan item once we've
4077 * added it, so this takes the reservation so we can release it later
4078 * when we are truly done with the orphan item.
4080 u64 num_bytes = btrfs_calc_trans_metadata_size(root, 1);
4081 return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes);
4084 void btrfs_orphan_release_metadata(struct inode *inode)
4086 struct btrfs_root *root = BTRFS_I(inode)->root;
4087 u64 num_bytes = btrfs_calc_trans_metadata_size(root, 1);
4088 btrfs_block_rsv_release(root, root->orphan_block_rsv, num_bytes);
4091 int btrfs_snap_reserve_metadata(struct btrfs_trans_handle *trans,
4092 struct btrfs_pending_snapshot *pending)
4094 struct btrfs_root *root = pending->root;
4095 struct btrfs_block_rsv *src_rsv = get_block_rsv(trans, root);
4096 struct btrfs_block_rsv *dst_rsv = &pending->block_rsv;
4098 * two for root back/forward refs, two for directory entries
4099 * and one for root of the snapshot.
4101 u64 num_bytes = btrfs_calc_trans_metadata_size(root, 5);
4102 dst_rsv->space_info = src_rsv->space_info;
4103 return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes);
4107 * drop_outstanding_extent - drop an outstanding extent
4108 * @inode: the inode we're dropping the extent for
4110 * This is called when we are freeing up an outstanding extent, either called
4111 * after an error or after an extent is written. This will return the number of
4112 * reserved extents that need to be freed. This must be called with
4113 * BTRFS_I(inode)->lock held.
4115 static unsigned drop_outstanding_extent(struct inode *inode)
4117 unsigned drop_inode_space = 0;
4118 unsigned dropped_extents = 0;
4120 BUG_ON(!BTRFS_I(inode)->outstanding_extents);
4121 BTRFS_I(inode)->outstanding_extents--;
4123 if (BTRFS_I(inode)->outstanding_extents == 0 &&
4124 BTRFS_I(inode)->delalloc_meta_reserved) {
4125 drop_inode_space = 1;
4126 BTRFS_I(inode)->delalloc_meta_reserved = 0;
4130 * If we have more or the same amount of outsanding extents than we have
4131 * reserved then we need to leave the reserved extents count alone.
4133 if (BTRFS_I(inode)->outstanding_extents >=
4134 BTRFS_I(inode)->reserved_extents)
4135 return drop_inode_space;
4137 dropped_extents = BTRFS_I(inode)->reserved_extents -
4138 BTRFS_I(inode)->outstanding_extents;
4139 BTRFS_I(inode)->reserved_extents -= dropped_extents;
4140 return dropped_extents + drop_inode_space;
4144 * calc_csum_metadata_size - return the amount of metada space that must be
4145 * reserved/free'd for the given bytes.
4146 * @inode: the inode we're manipulating
4147 * @num_bytes: the number of bytes in question
4148 * @reserve: 1 if we are reserving space, 0 if we are freeing space
4150 * This adjusts the number of csum_bytes in the inode and then returns the
4151 * correct amount of metadata that must either be reserved or freed. We
4152 * calculate how many checksums we can fit into one leaf and then divide the
4153 * number of bytes that will need to be checksumed by this value to figure out
4154 * how many checksums will be required. If we are adding bytes then the number
4155 * may go up and we will return the number of additional bytes that must be
4156 * reserved. If it is going down we will return the number of bytes that must
4159 * This must be called with BTRFS_I(inode)->lock held.
4161 static u64 calc_csum_metadata_size(struct inode *inode, u64 num_bytes,
4164 struct btrfs_root *root = BTRFS_I(inode)->root;
4166 int num_csums_per_leaf;
4170 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM &&
4171 BTRFS_I(inode)->csum_bytes == 0)
4174 old_csums = (int)div64_u64(BTRFS_I(inode)->csum_bytes, root->sectorsize);
4176 BTRFS_I(inode)->csum_bytes += num_bytes;
4178 BTRFS_I(inode)->csum_bytes -= num_bytes;
4179 csum_size = BTRFS_LEAF_DATA_SIZE(root) - sizeof(struct btrfs_item);
4180 num_csums_per_leaf = (int)div64_u64(csum_size,
4181 sizeof(struct btrfs_csum_item) +
4182 sizeof(struct btrfs_disk_key));
4183 num_csums = (int)div64_u64(BTRFS_I(inode)->csum_bytes, root->sectorsize);
4184 num_csums = num_csums + num_csums_per_leaf - 1;
4185 num_csums = num_csums / num_csums_per_leaf;
4187 old_csums = old_csums + num_csums_per_leaf - 1;
4188 old_csums = old_csums / num_csums_per_leaf;
4190 /* No change, no need to reserve more */
4191 if (old_csums == num_csums)
4195 return btrfs_calc_trans_metadata_size(root,
4196 num_csums - old_csums);
4198 return btrfs_calc_trans_metadata_size(root, old_csums - num_csums);
4201 int btrfs_delalloc_reserve_metadata(struct inode *inode, u64 num_bytes)
4203 struct btrfs_root *root = BTRFS_I(inode)->root;
4204 struct btrfs_block_rsv *block_rsv = &root->fs_info->delalloc_block_rsv;
4206 unsigned nr_extents = 0;
4210 if (btrfs_is_free_space_inode(root, inode))
4213 if (flush && btrfs_transaction_in_commit(root->fs_info))
4214 schedule_timeout(1);
4216 num_bytes = ALIGN(num_bytes, root->sectorsize);
4218 spin_lock(&BTRFS_I(inode)->lock);
4219 BTRFS_I(inode)->outstanding_extents++;
4221 if (BTRFS_I(inode)->outstanding_extents >
4222 BTRFS_I(inode)->reserved_extents) {
4223 nr_extents = BTRFS_I(inode)->outstanding_extents -
4224 BTRFS_I(inode)->reserved_extents;
4225 BTRFS_I(inode)->reserved_extents += nr_extents;
4229 * Add an item to reserve for updating the inode when we complete the
4232 if (!BTRFS_I(inode)->delalloc_meta_reserved) {
4234 BTRFS_I(inode)->delalloc_meta_reserved = 1;
4237 to_reserve = btrfs_calc_trans_metadata_size(root, nr_extents);
4238 to_reserve += calc_csum_metadata_size(inode, num_bytes, 1);
4239 spin_unlock(&BTRFS_I(inode)->lock);
4241 ret = reserve_metadata_bytes(root, block_rsv, to_reserve, flush);
4246 spin_lock(&BTRFS_I(inode)->lock);
4247 dropped = drop_outstanding_extent(inode);
4248 to_free = calc_csum_metadata_size(inode, num_bytes, 0);
4249 spin_unlock(&BTRFS_I(inode)->lock);
4250 to_free += btrfs_calc_trans_metadata_size(root, dropped);
4253 * Somebody could have come in and twiddled with the
4254 * reservation, so if we have to free more than we would have
4255 * reserved from this reservation go ahead and release those
4258 to_free -= to_reserve;
4260 btrfs_block_rsv_release(root, block_rsv, to_free);
4264 block_rsv_add_bytes(block_rsv, to_reserve, 1);
4270 * btrfs_delalloc_release_metadata - release a metadata reservation for an inode
4271 * @inode: the inode to release the reservation for
4272 * @num_bytes: the number of bytes we're releasing
4274 * This will release the metadata reservation for an inode. This can be called
4275 * once we complete IO for a given set of bytes to release their metadata
4278 void btrfs_delalloc_release_metadata(struct inode *inode, u64 num_bytes)
4280 struct btrfs_root *root = BTRFS_I(inode)->root;
4284 num_bytes = ALIGN(num_bytes, root->sectorsize);
4285 spin_lock(&BTRFS_I(inode)->lock);
4286 dropped = drop_outstanding_extent(inode);
4288 to_free = calc_csum_metadata_size(inode, num_bytes, 0);
4289 spin_unlock(&BTRFS_I(inode)->lock);
4291 to_free += btrfs_calc_trans_metadata_size(root, dropped);
4293 btrfs_block_rsv_release(root, &root->fs_info->delalloc_block_rsv,
4298 * btrfs_delalloc_reserve_space - reserve data and metadata space for delalloc
4299 * @inode: inode we're writing to
4300 * @num_bytes: the number of bytes we want to allocate
4302 * This will do the following things
4304 * o reserve space in the data space info for num_bytes
4305 * o reserve space in the metadata space info based on number of outstanding
4306 * extents and how much csums will be needed
4307 * o add to the inodes ->delalloc_bytes
4308 * o add it to the fs_info's delalloc inodes list.
4310 * This will return 0 for success and -ENOSPC if there is no space left.
4312 int btrfs_delalloc_reserve_space(struct inode *inode, u64 num_bytes)
4316 ret = btrfs_check_data_free_space(inode, num_bytes);
4320 ret = btrfs_delalloc_reserve_metadata(inode, num_bytes);
4322 btrfs_free_reserved_data_space(inode, num_bytes);
4330 * btrfs_delalloc_release_space - release data and metadata space for delalloc
4331 * @inode: inode we're releasing space for
4332 * @num_bytes: the number of bytes we want to free up
4334 * This must be matched with a call to btrfs_delalloc_reserve_space. This is
4335 * called in the case that we don't need the metadata AND data reservations
4336 * anymore. So if there is an error or we insert an inline extent.
4338 * This function will release the metadata space that was not used and will
4339 * decrement ->delalloc_bytes and remove it from the fs_info delalloc_inodes
4340 * list if there are no delalloc bytes left.
4342 void btrfs_delalloc_release_space(struct inode *inode, u64 num_bytes)
4344 btrfs_delalloc_release_metadata(inode, num_bytes);
4345 btrfs_free_reserved_data_space(inode, num_bytes);
4348 static int update_block_group(struct btrfs_trans_handle *trans,
4349 struct btrfs_root *root,
4350 u64 bytenr, u64 num_bytes, int alloc)
4352 struct btrfs_block_group_cache *cache = NULL;
4353 struct btrfs_fs_info *info = root->fs_info;
4354 u64 total = num_bytes;
4359 /* block accounting for super block */
4360 spin_lock(&info->delalloc_lock);
4361 old_val = btrfs_super_bytes_used(info->super_copy);
4363 old_val += num_bytes;
4365 old_val -= num_bytes;
4366 btrfs_set_super_bytes_used(info->super_copy, old_val);
4367 spin_unlock(&info->delalloc_lock);
4370 cache = btrfs_lookup_block_group(info, bytenr);
4373 if (cache->flags & (BTRFS_BLOCK_GROUP_DUP |
4374 BTRFS_BLOCK_GROUP_RAID1 |
4375 BTRFS_BLOCK_GROUP_RAID10))
4380 * If this block group has free space cache written out, we
4381 * need to make sure to load it if we are removing space. This
4382 * is because we need the unpinning stage to actually add the
4383 * space back to the block group, otherwise we will leak space.
4385 if (!alloc && cache->cached == BTRFS_CACHE_NO)
4386 cache_block_group(cache, trans, NULL, 1);
4388 byte_in_group = bytenr - cache->key.objectid;
4389 WARN_ON(byte_in_group > cache->key.offset);
4391 spin_lock(&cache->space_info->lock);
4392 spin_lock(&cache->lock);
4394 if (btrfs_test_opt(root, SPACE_CACHE) &&
4395 cache->disk_cache_state < BTRFS_DC_CLEAR)
4396 cache->disk_cache_state = BTRFS_DC_CLEAR;
4399 old_val = btrfs_block_group_used(&cache->item);
4400 num_bytes = min(total, cache->key.offset - byte_in_group);
4402 old_val += num_bytes;
4403 btrfs_set_block_group_used(&cache->item, old_val);
4404 cache->reserved -= num_bytes;
4405 cache->space_info->bytes_reserved -= num_bytes;
4406 cache->space_info->bytes_used += num_bytes;
4407 cache->space_info->disk_used += num_bytes * factor;
4408 spin_unlock(&cache->lock);
4409 spin_unlock(&cache->space_info->lock);
4411 old_val -= num_bytes;
4412 btrfs_set_block_group_used(&cache->item, old_val);
4413 cache->pinned += num_bytes;
4414 cache->space_info->bytes_pinned += num_bytes;
4415 cache->space_info->bytes_used -= num_bytes;
4416 cache->space_info->disk_used -= num_bytes * factor;
4417 spin_unlock(&cache->lock);
4418 spin_unlock(&cache->space_info->lock);
4420 set_extent_dirty(info->pinned_extents,
4421 bytenr, bytenr + num_bytes - 1,
4422 GFP_NOFS | __GFP_NOFAIL);
4424 btrfs_put_block_group(cache);
4426 bytenr += num_bytes;
4431 static u64 first_logical_byte(struct btrfs_root *root, u64 search_start)
4433 struct btrfs_block_group_cache *cache;
4436 cache = btrfs_lookup_first_block_group(root->fs_info, search_start);
4440 bytenr = cache->key.objectid;
4441 btrfs_put_block_group(cache);
4446 static int pin_down_extent(struct btrfs_root *root,
4447 struct btrfs_block_group_cache *cache,
4448 u64 bytenr, u64 num_bytes, int reserved)
4450 spin_lock(&cache->space_info->lock);
4451 spin_lock(&cache->lock);
4452 cache->pinned += num_bytes;
4453 cache->space_info->bytes_pinned += num_bytes;
4455 cache->reserved -= num_bytes;
4456 cache->space_info->bytes_reserved -= num_bytes;
4458 spin_unlock(&cache->lock);
4459 spin_unlock(&cache->space_info->lock);
4461 set_extent_dirty(root->fs_info->pinned_extents, bytenr,
4462 bytenr + num_bytes - 1, GFP_NOFS | __GFP_NOFAIL);
4467 * this function must be called within transaction
4469 int btrfs_pin_extent(struct btrfs_root *root,
4470 u64 bytenr, u64 num_bytes, int reserved)
4472 struct btrfs_block_group_cache *cache;
4474 cache = btrfs_lookup_block_group(root->fs_info, bytenr);
4477 pin_down_extent(root, cache, bytenr, num_bytes, reserved);
4479 btrfs_put_block_group(cache);
4484 * this function must be called within transaction
4486 int btrfs_pin_extent_for_log_replay(struct btrfs_trans_handle *trans,
4487 struct btrfs_root *root,
4488 u64 bytenr, u64 num_bytes)
4490 struct btrfs_block_group_cache *cache;
4492 cache = btrfs_lookup_block_group(root->fs_info, bytenr);
4496 * pull in the free space cache (if any) so that our pin
4497 * removes the free space from the cache. We have load_only set
4498 * to one because the slow code to read in the free extents does check
4499 * the pinned extents.
4501 cache_block_group(cache, trans, root, 1);
4503 pin_down_extent(root, cache, bytenr, num_bytes, 0);
4505 /* remove us from the free space cache (if we're there at all) */
4506 btrfs_remove_free_space(cache, bytenr, num_bytes);
4507 btrfs_put_block_group(cache);
4512 * btrfs_update_reserved_bytes - update the block_group and space info counters
4513 * @cache: The cache we are manipulating
4514 * @num_bytes: The number of bytes in question
4515 * @reserve: One of the reservation enums
4517 * This is called by the allocator when it reserves space, or by somebody who is
4518 * freeing space that was never actually used on disk. For example if you
4519 * reserve some space for a new leaf in transaction A and before transaction A
4520 * commits you free that leaf, you call this with reserve set to 0 in order to
4521 * clear the reservation.
4523 * Metadata reservations should be called with RESERVE_ALLOC so we do the proper
4524 * ENOSPC accounting. For data we handle the reservation through clearing the
4525 * delalloc bits in the io_tree. We have to do this since we could end up
4526 * allocating less disk space for the amount of data we have reserved in the
4527 * case of compression.
4529 * If this is a reservation and the block group has become read only we cannot
4530 * make the reservation and return -EAGAIN, otherwise this function always
4533 static int btrfs_update_reserved_bytes(struct btrfs_block_group_cache *cache,
4534 u64 num_bytes, int reserve)
4536 struct btrfs_space_info *space_info = cache->space_info;
4538 spin_lock(&space_info->lock);
4539 spin_lock(&cache->lock);
4540 if (reserve != RESERVE_FREE) {
4544 cache->reserved += num_bytes;
4545 space_info->bytes_reserved += num_bytes;
4546 if (reserve == RESERVE_ALLOC) {
4547 BUG_ON(space_info->bytes_may_use < num_bytes);
4548 space_info->bytes_may_use -= num_bytes;
4553 space_info->bytes_readonly += num_bytes;
4554 cache->reserved -= num_bytes;
4555 space_info->bytes_reserved -= num_bytes;
4556 space_info->reservation_progress++;
4558 spin_unlock(&cache->lock);
4559 spin_unlock(&space_info->lock);
4563 int btrfs_prepare_extent_commit(struct btrfs_trans_handle *trans,
4564 struct btrfs_root *root)
4566 struct btrfs_fs_info *fs_info = root->fs_info;
4567 struct btrfs_caching_control *next;
4568 struct btrfs_caching_control *caching_ctl;
4569 struct btrfs_block_group_cache *cache;
4571 down_write(&fs_info->extent_commit_sem);
4573 list_for_each_entry_safe(caching_ctl, next,
4574 &fs_info->caching_block_groups, list) {
4575 cache = caching_ctl->block_group;
4576 if (block_group_cache_done(cache)) {
4577 cache->last_byte_to_unpin = (u64)-1;
4578 list_del_init(&caching_ctl->list);
4579 put_caching_control(caching_ctl);
4581 cache->last_byte_to_unpin = caching_ctl->progress;
4585 if (fs_info->pinned_extents == &fs_info->freed_extents[0])
4586 fs_info->pinned_extents = &fs_info->freed_extents[1];
4588 fs_info->pinned_extents = &fs_info->freed_extents[0];
4590 up_write(&fs_info->extent_commit_sem);
4592 update_global_block_rsv(fs_info);
4596 static int unpin_extent_range(struct btrfs_root *root, u64 start, u64 end)
4598 struct btrfs_fs_info *fs_info = root->fs_info;
4599 struct btrfs_block_group_cache *cache = NULL;
4602 while (start <= end) {
4604 start >= cache->key.objectid + cache->key.offset) {
4606 btrfs_put_block_group(cache);
4607 cache = btrfs_lookup_block_group(fs_info, start);
4611 len = cache->key.objectid + cache->key.offset - start;
4612 len = min(len, end + 1 - start);
4614 if (start < cache->last_byte_to_unpin) {
4615 len = min(len, cache->last_byte_to_unpin - start);
4616 btrfs_add_free_space(cache, start, len);
4621 spin_lock(&cache->space_info->lock);
4622 spin_lock(&cache->lock);
4623 cache->pinned -= len;
4624 cache->space_info->bytes_pinned -= len;
4626 cache->space_info->bytes_readonly += len;
4627 spin_unlock(&cache->lock);
4628 spin_unlock(&cache->space_info->lock);
4632 btrfs_put_block_group(cache);
4636 int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans,
4637 struct btrfs_root *root)
4639 struct btrfs_fs_info *fs_info = root->fs_info;
4640 struct extent_io_tree *unpin;
4645 if (fs_info->pinned_extents == &fs_info->freed_extents[0])
4646 unpin = &fs_info->freed_extents[1];
4648 unpin = &fs_info->freed_extents[0];
4651 ret = find_first_extent_bit(unpin, 0, &start, &end,
4656 if (btrfs_test_opt(root, DISCARD))
4657 ret = btrfs_discard_extent(root, start,
4658 end + 1 - start, NULL);
4660 clear_extent_dirty(unpin, start, end, GFP_NOFS);
4661 unpin_extent_range(root, start, end);
4668 static int __btrfs_free_extent(struct btrfs_trans_handle *trans,
4669 struct btrfs_root *root,
4670 u64 bytenr, u64 num_bytes, u64 parent,
4671 u64 root_objectid, u64 owner_objectid,
4672 u64 owner_offset, int refs_to_drop,
4673 struct btrfs_delayed_extent_op *extent_op)
4675 struct btrfs_key key;
4676 struct btrfs_path *path;
4677 struct btrfs_fs_info *info = root->fs_info;
4678 struct btrfs_root *extent_root = info->extent_root;
4679 struct extent_buffer *leaf;
4680 struct btrfs_extent_item *ei;
4681 struct btrfs_extent_inline_ref *iref;
4684 int extent_slot = 0;
4685 int found_extent = 0;
4690 path = btrfs_alloc_path();
4695 path->leave_spinning = 1;
4697 is_data = owner_objectid >= BTRFS_FIRST_FREE_OBJECTID;
4698 BUG_ON(!is_data && refs_to_drop != 1);
4700 ret = lookup_extent_backref(trans, extent_root, path, &iref,
4701 bytenr, num_bytes, parent,
4702 root_objectid, owner_objectid,
4705 extent_slot = path->slots[0];
4706 while (extent_slot >= 0) {
4707 btrfs_item_key_to_cpu(path->nodes[0], &key,
4709 if (key.objectid != bytenr)
4711 if (key.type == BTRFS_EXTENT_ITEM_KEY &&
4712 key.offset == num_bytes) {
4716 if (path->slots[0] - extent_slot > 5)
4720 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
4721 item_size = btrfs_item_size_nr(path->nodes[0], extent_slot);
4722 if (found_extent && item_size < sizeof(*ei))
4725 if (!found_extent) {
4727 ret = remove_extent_backref(trans, extent_root, path,
4731 btrfs_release_path(path);
4732 path->leave_spinning = 1;
4734 key.objectid = bytenr;
4735 key.type = BTRFS_EXTENT_ITEM_KEY;
4736 key.offset = num_bytes;
4738 ret = btrfs_search_slot(trans, extent_root,
4741 printk(KERN_ERR "umm, got %d back from search"
4742 ", was looking for %llu\n", ret,
4743 (unsigned long long)bytenr);
4745 btrfs_print_leaf(extent_root,
4749 extent_slot = path->slots[0];
4752 btrfs_print_leaf(extent_root, path->nodes[0]);
4754 printk(KERN_ERR "btrfs unable to find ref byte nr %llu "
4755 "parent %llu root %llu owner %llu offset %llu\n",
4756 (unsigned long long)bytenr,
4757 (unsigned long long)parent,
4758 (unsigned long long)root_objectid,
4759 (unsigned long long)owner_objectid,
4760 (unsigned long long)owner_offset);
4763 leaf = path->nodes[0];
4764 item_size = btrfs_item_size_nr(leaf, extent_slot);
4765 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
4766 if (item_size < sizeof(*ei)) {
4767 BUG_ON(found_extent || extent_slot != path->slots[0]);
4768 ret = convert_extent_item_v0(trans, extent_root, path,
4772 btrfs_release_path(path);
4773 path->leave_spinning = 1;
4775 key.objectid = bytenr;
4776 key.type = BTRFS_EXTENT_ITEM_KEY;
4777 key.offset = num_bytes;
4779 ret = btrfs_search_slot(trans, extent_root, &key, path,
4782 printk(KERN_ERR "umm, got %d back from search"
4783 ", was looking for %llu\n", ret,
4784 (unsigned long long)bytenr);
4785 btrfs_print_leaf(extent_root, path->nodes[0]);
4788 extent_slot = path->slots[0];
4789 leaf = path->nodes[0];
4790 item_size = btrfs_item_size_nr(leaf, extent_slot);
4793 BUG_ON(item_size < sizeof(*ei));
4794 ei = btrfs_item_ptr(leaf, extent_slot,
4795 struct btrfs_extent_item);
4796 if (owner_objectid < BTRFS_FIRST_FREE_OBJECTID) {
4797 struct btrfs_tree_block_info *bi;
4798 BUG_ON(item_size < sizeof(*ei) + sizeof(*bi));
4799 bi = (struct btrfs_tree_block_info *)(ei + 1);
4800 WARN_ON(owner_objectid != btrfs_tree_block_level(leaf, bi));
4803 refs = btrfs_extent_refs(leaf, ei);
4804 BUG_ON(refs < refs_to_drop);
4805 refs -= refs_to_drop;
4809 __run_delayed_extent_op(extent_op, leaf, ei);
4811 * In the case of inline back ref, reference count will
4812 * be updated by remove_extent_backref
4815 BUG_ON(!found_extent);
4817 btrfs_set_extent_refs(leaf, ei, refs);
4818 btrfs_mark_buffer_dirty(leaf);
4821 ret = remove_extent_backref(trans, extent_root, path,
4828 BUG_ON(is_data && refs_to_drop !=
4829 extent_data_ref_count(root, path, iref));
4831 BUG_ON(path->slots[0] != extent_slot);
4833 BUG_ON(path->slots[0] != extent_slot + 1);
4834 path->slots[0] = extent_slot;
4839 ret = btrfs_del_items(trans, extent_root, path, path->slots[0],
4842 btrfs_release_path(path);
4845 ret = btrfs_del_csums(trans, root, bytenr, num_bytes);
4848 invalidate_mapping_pages(info->btree_inode->i_mapping,
4849 bytenr >> PAGE_CACHE_SHIFT,
4850 (bytenr + num_bytes - 1) >> PAGE_CACHE_SHIFT);
4853 ret = update_block_group(trans, root, bytenr, num_bytes, 0);
4856 btrfs_free_path(path);
4861 * when we free an block, it is possible (and likely) that we free the last
4862 * delayed ref for that extent as well. This searches the delayed ref tree for
4863 * a given extent, and if there are no other delayed refs to be processed, it
4864 * removes it from the tree.
4866 static noinline int check_ref_cleanup(struct btrfs_trans_handle *trans,
4867 struct btrfs_root *root, u64 bytenr)
4869 struct btrfs_delayed_ref_head *head;
4870 struct btrfs_delayed_ref_root *delayed_refs;
4871 struct btrfs_delayed_ref_node *ref;
4872 struct rb_node *node;
4875 delayed_refs = &trans->transaction->delayed_refs;
4876 spin_lock(&delayed_refs->lock);
4877 head = btrfs_find_delayed_ref_head(trans, bytenr);
4881 node = rb_prev(&head->node.rb_node);
4885 ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
4887 /* there are still entries for this ref, we can't drop it */
4888 if (ref->bytenr == bytenr)
4891 if (head->extent_op) {
4892 if (!head->must_insert_reserved)
4894 kfree(head->extent_op);
4895 head->extent_op = NULL;
4899 * waiting for the lock here would deadlock. If someone else has it
4900 * locked they are already in the process of dropping it anyway
4902 if (!mutex_trylock(&head->mutex))
4906 * at this point we have a head with no other entries. Go
4907 * ahead and process it.
4909 head->node.in_tree = 0;
4910 rb_erase(&head->node.rb_node, &delayed_refs->root);
4912 delayed_refs->num_entries--;
4915 * we don't take a ref on the node because we're removing it from the
4916 * tree, so we just steal the ref the tree was holding.
4918 delayed_refs->num_heads--;
4919 if (list_empty(&head->cluster))
4920 delayed_refs->num_heads_ready--;
4922 list_del_init(&head->cluster);
4923 spin_unlock(&delayed_refs->lock);
4925 BUG_ON(head->extent_op);
4926 if (head->must_insert_reserved)
4929 mutex_unlock(&head->mutex);
4930 btrfs_put_delayed_ref(&head->node);
4933 spin_unlock(&delayed_refs->lock);
4937 void btrfs_free_tree_block(struct btrfs_trans_handle *trans,
4938 struct btrfs_root *root,
4939 struct extent_buffer *buf,
4940 u64 parent, int last_ref)
4942 struct btrfs_block_group_cache *cache = NULL;
4945 if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) {
4946 ret = btrfs_add_delayed_tree_ref(trans, buf->start, buf->len,
4947 parent, root->root_key.objectid,
4948 btrfs_header_level(buf),
4949 BTRFS_DROP_DELAYED_REF, NULL);
4956 cache = btrfs_lookup_block_group(root->fs_info, buf->start);
4958 if (btrfs_header_generation(buf) == trans->transid) {
4959 if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) {
4960 ret = check_ref_cleanup(trans, root, buf->start);
4965 if (btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN)) {
4966 pin_down_extent(root, cache, buf->start, buf->len, 1);
4970 WARN_ON(test_bit(EXTENT_BUFFER_DIRTY, &buf->bflags));
4972 btrfs_add_free_space(cache, buf->start, buf->len);
4973 btrfs_update_reserved_bytes(cache, buf->len, RESERVE_FREE);
4977 * Deleting the buffer, clear the corrupt flag since it doesn't matter
4980 clear_bit(EXTENT_BUFFER_CORRUPT, &buf->bflags);
4981 btrfs_put_block_group(cache);
4984 int btrfs_free_extent(struct btrfs_trans_handle *trans,
4985 struct btrfs_root *root,
4986 u64 bytenr, u64 num_bytes, u64 parent,
4987 u64 root_objectid, u64 owner, u64 offset)
4992 * tree log blocks never actually go into the extent allocation
4993 * tree, just update pinning info and exit early.
4995 if (root_objectid == BTRFS_TREE_LOG_OBJECTID) {
4996 WARN_ON(owner >= BTRFS_FIRST_FREE_OBJECTID);
4997 /* unlocks the pinned mutex */
4998 btrfs_pin_extent(root, bytenr, num_bytes, 1);
5000 } else if (owner < BTRFS_FIRST_FREE_OBJECTID) {
5001 ret = btrfs_add_delayed_tree_ref(trans, bytenr, num_bytes,
5002 parent, root_objectid, (int)owner,
5003 BTRFS_DROP_DELAYED_REF, NULL);
5006 ret = btrfs_add_delayed_data_ref(trans, bytenr, num_bytes,
5007 parent, root_objectid, owner,
5008 offset, BTRFS_DROP_DELAYED_REF, NULL);
5014 static u64 stripe_align(struct btrfs_root *root, u64 val)
5016 u64 mask = ((u64)root->stripesize - 1);
5017 u64 ret = (val + mask) & ~mask;
5022 * when we wait for progress in the block group caching, its because
5023 * our allocation attempt failed at least once. So, we must sleep
5024 * and let some progress happen before we try again.
5026 * This function will sleep at least once waiting for new free space to
5027 * show up, and then it will check the block group free space numbers
5028 * for our min num_bytes. Another option is to have it go ahead
5029 * and look in the rbtree for a free extent of a given size, but this
5033 wait_block_group_cache_progress(struct btrfs_block_group_cache *cache,
5036 struct btrfs_caching_control *caching_ctl;
5039 caching_ctl = get_caching_control(cache);
5043 wait_event(caching_ctl->wait, block_group_cache_done(cache) ||
5044 (cache->free_space_ctl->free_space >= num_bytes));
5046 put_caching_control(caching_ctl);
5051 wait_block_group_cache_done(struct btrfs_block_group_cache *cache)
5053 struct btrfs_caching_control *caching_ctl;
5056 caching_ctl = get_caching_control(cache);
5060 wait_event(caching_ctl->wait, block_group_cache_done(cache));
5062 put_caching_control(caching_ctl);
5066 static int get_block_group_index(struct btrfs_block_group_cache *cache)
5069 if (cache->flags & BTRFS_BLOCK_GROUP_RAID10)
5071 else if (cache->flags & BTRFS_BLOCK_GROUP_RAID1)
5073 else if (cache->flags & BTRFS_BLOCK_GROUP_DUP)
5075 else if (cache->flags & BTRFS_BLOCK_GROUP_RAID0)
5082 enum btrfs_loop_type {
5083 LOOP_FIND_IDEAL = 0,
5084 LOOP_CACHING_NOWAIT = 1,
5085 LOOP_CACHING_WAIT = 2,
5086 LOOP_ALLOC_CHUNK = 3,
5087 LOOP_NO_EMPTY_SIZE = 4,
5091 * walks the btree of allocated extents and find a hole of a given size.
5092 * The key ins is changed to record the hole:
5093 * ins->objectid == block start
5094 * ins->flags = BTRFS_EXTENT_ITEM_KEY
5095 * ins->offset == number of blocks
5096 * Any available blocks before search_start are skipped.
5098 static noinline int find_free_extent(struct btrfs_trans_handle *trans,
5099 struct btrfs_root *orig_root,
5100 u64 num_bytes, u64 empty_size,
5101 u64 search_start, u64 search_end,
5102 u64 hint_byte, struct btrfs_key *ins,
5106 struct btrfs_root *root = orig_root->fs_info->extent_root;
5107 struct btrfs_free_cluster *last_ptr = NULL;
5108 struct btrfs_block_group_cache *block_group = NULL;
5109 struct btrfs_block_group_cache *used_block_group;
5110 int empty_cluster = 2 * 1024 * 1024;
5111 int allowed_chunk_alloc = 0;
5112 int done_chunk_alloc = 0;
5113 struct btrfs_space_info *space_info;
5116 int alloc_type = (data & BTRFS_BLOCK_GROUP_DATA) ?
5117 RESERVE_ALLOC_NO_ACCOUNT : RESERVE_ALLOC;
5118 bool found_uncached_bg = false;
5119 bool failed_cluster_refill = false;
5120 bool failed_alloc = false;
5121 bool use_cluster = true;
5122 bool have_caching_bg = false;
5123 u64 ideal_cache_percent = 0;
5124 u64 ideal_cache_offset = 0;
5126 WARN_ON(num_bytes < root->sectorsize);
5127 btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY);
5131 space_info = __find_space_info(root->fs_info, data);
5133 printk(KERN_ERR "No space info for %llu\n", data);
5138 * If the space info is for both data and metadata it means we have a
5139 * small filesystem and we can't use the clustering stuff.
5141 if (btrfs_mixed_space_info(space_info))
5142 use_cluster = false;
5144 if (orig_root->ref_cows || empty_size)
5145 allowed_chunk_alloc = 1;
5147 if (data & BTRFS_BLOCK_GROUP_METADATA && use_cluster) {
5148 last_ptr = &root->fs_info->meta_alloc_cluster;
5149 if (!btrfs_test_opt(root, SSD))
5150 empty_cluster = 64 * 1024;
5153 if ((data & BTRFS_BLOCK_GROUP_DATA) && use_cluster &&
5154 btrfs_test_opt(root, SSD)) {
5155 last_ptr = &root->fs_info->data_alloc_cluster;
5159 spin_lock(&last_ptr->lock);
5160 if (last_ptr->block_group)
5161 hint_byte = last_ptr->window_start;
5162 spin_unlock(&last_ptr->lock);
5165 search_start = max(search_start, first_logical_byte(root, 0));
5166 search_start = max(search_start, hint_byte);
5171 if (search_start == hint_byte) {
5173 block_group = btrfs_lookup_block_group(root->fs_info,
5175 used_block_group = block_group;
5177 * we don't want to use the block group if it doesn't match our
5178 * allocation bits, or if its not cached.
5180 * However if we are re-searching with an ideal block group
5181 * picked out then we don't care that the block group is cached.
5183 if (block_group && block_group_bits(block_group, data) &&
5184 (block_group->cached != BTRFS_CACHE_NO ||
5185 search_start == ideal_cache_offset)) {
5186 down_read(&space_info->groups_sem);
5187 if (list_empty(&block_group->list) ||
5190 * someone is removing this block group,
5191 * we can't jump into the have_block_group
5192 * target because our list pointers are not
5195 btrfs_put_block_group(block_group);
5196 up_read(&space_info->groups_sem);
5198 index = get_block_group_index(block_group);
5199 goto have_block_group;
5201 } else if (block_group) {
5202 btrfs_put_block_group(block_group);
5206 have_caching_bg = false;
5207 down_read(&space_info->groups_sem);
5208 list_for_each_entry(block_group, &space_info->block_groups[index],
5213 used_block_group = block_group;
5214 btrfs_get_block_group(block_group);
5215 search_start = block_group->key.objectid;
5218 * this can happen if we end up cycling through all the
5219 * raid types, but we want to make sure we only allocate
5220 * for the proper type.
5222 if (!block_group_bits(block_group, data)) {
5223 u64 extra = BTRFS_BLOCK_GROUP_DUP |
5224 BTRFS_BLOCK_GROUP_RAID1 |
5225 BTRFS_BLOCK_GROUP_RAID10;
5228 * if they asked for extra copies and this block group
5229 * doesn't provide them, bail. This does allow us to
5230 * fill raid0 from raid1.
5232 if ((data & extra) && !(block_group->flags & extra))
5237 cached = block_group_cache_done(block_group);
5238 if (unlikely(!cached)) {
5241 found_uncached_bg = true;
5242 ret = cache_block_group(block_group, trans,
5244 if (block_group->cached == BTRFS_CACHE_FINISHED)
5247 free_percent = btrfs_block_group_used(&block_group->item);
5248 free_percent *= 100;
5249 free_percent = div64_u64(free_percent,
5250 block_group->key.offset);
5251 free_percent = 100 - free_percent;
5252 if (free_percent > ideal_cache_percent &&
5253 likely(!block_group->ro)) {
5254 ideal_cache_offset = block_group->key.objectid;
5255 ideal_cache_percent = free_percent;
5259 * The caching workers are limited to 2 threads, so we
5260 * can queue as much work as we care to.
5262 if (loop > LOOP_FIND_IDEAL) {
5263 ret = cache_block_group(block_group, trans,
5269 * If loop is set for cached only, try the next block
5272 if (loop == LOOP_FIND_IDEAL)
5277 if (unlikely(block_group->ro))
5280 spin_lock(&block_group->free_space_ctl->tree_lock);
5282 block_group->free_space_ctl->free_space <
5283 num_bytes + empty_cluster + empty_size) {
5284 spin_unlock(&block_group->free_space_ctl->tree_lock);
5287 spin_unlock(&block_group->free_space_ctl->tree_lock);
5290 * Ok we want to try and use the cluster allocator, so
5295 * the refill lock keeps out other
5296 * people trying to start a new cluster
5298 spin_lock(&last_ptr->refill_lock);
5299 used_block_group = last_ptr->block_group;
5300 if (used_block_group != block_group &&
5301 (!used_block_group ||
5302 used_block_group->ro ||
5303 !block_group_bits(used_block_group, data))) {
5304 used_block_group = block_group;
5305 goto refill_cluster;
5308 if (used_block_group != block_group)
5309 btrfs_get_block_group(used_block_group);
5311 offset = btrfs_alloc_from_cluster(used_block_group,
5312 last_ptr, num_bytes, used_block_group->key.objectid);
5314 /* we have a block, we're done */
5315 spin_unlock(&last_ptr->refill_lock);
5319 WARN_ON(last_ptr->block_group != used_block_group);
5320 if (used_block_group != block_group) {
5321 btrfs_put_block_group(used_block_group);
5322 used_block_group = block_group;
5325 BUG_ON(used_block_group != block_group);
5326 /* If we are on LOOP_NO_EMPTY_SIZE, we can't
5327 * set up a new clusters, so lets just skip it
5328 * and let the allocator find whatever block
5329 * it can find. If we reach this point, we
5330 * will have tried the cluster allocator
5331 * plenty of times and not have found
5332 * anything, so we are likely way too
5333 * fragmented for the clustering stuff to find
5335 if (loop >= LOOP_NO_EMPTY_SIZE) {
5336 spin_unlock(&last_ptr->refill_lock);
5337 goto unclustered_alloc;
5341 * this cluster didn't work out, free it and
5344 btrfs_return_cluster_to_free_space(NULL, last_ptr);
5346 /* allocate a cluster in this block group */
5347 ret = btrfs_find_space_cluster(trans, root,
5348 block_group, last_ptr,
5349 search_start, num_bytes,
5350 empty_cluster + empty_size);
5353 * now pull our allocation out of this
5356 offset = btrfs_alloc_from_cluster(block_group,
5357 last_ptr, num_bytes,
5360 /* we found one, proceed */
5361 spin_unlock(&last_ptr->refill_lock);
5364 } else if (!cached && loop > LOOP_CACHING_NOWAIT
5365 && !failed_cluster_refill) {
5366 spin_unlock(&last_ptr->refill_lock);
5368 failed_cluster_refill = true;
5369 wait_block_group_cache_progress(block_group,
5370 num_bytes + empty_cluster + empty_size);
5371 goto have_block_group;
5375 * at this point we either didn't find a cluster
5376 * or we weren't able to allocate a block from our
5377 * cluster. Free the cluster we've been trying
5378 * to use, and go to the next block group
5380 btrfs_return_cluster_to_free_space(NULL, last_ptr);
5381 spin_unlock(&last_ptr->refill_lock);
5386 offset = btrfs_find_space_for_alloc(block_group, search_start,
5387 num_bytes, empty_size);
5389 * If we didn't find a chunk, and we haven't failed on this
5390 * block group before, and this block group is in the middle of
5391 * caching and we are ok with waiting, then go ahead and wait
5392 * for progress to be made, and set failed_alloc to true.
5394 * If failed_alloc is true then we've already waited on this
5395 * block group once and should move on to the next block group.
5397 if (!offset && !failed_alloc && !cached &&
5398 loop > LOOP_CACHING_NOWAIT) {
5399 wait_block_group_cache_progress(block_group,
5400 num_bytes + empty_size);
5401 failed_alloc = true;
5402 goto have_block_group;
5403 } else if (!offset) {
5405 have_caching_bg = true;
5409 search_start = stripe_align(root, offset);
5410 /* move on to the next group */
5411 if (search_start + num_bytes >= search_end) {
5412 btrfs_add_free_space(used_block_group, offset, num_bytes);
5416 /* move on to the next group */
5417 if (search_start + num_bytes >
5418 used_block_group->key.objectid + used_block_group->key.offset) {
5419 btrfs_add_free_space(used_block_group, offset, num_bytes);
5423 ins->objectid = search_start;
5424 ins->offset = num_bytes;
5426 if (offset < search_start)
5427 btrfs_add_free_space(used_block_group, offset,
5428 search_start - offset);
5429 BUG_ON(offset > search_start);
5431 ret = btrfs_update_reserved_bytes(used_block_group, num_bytes,
5433 if (ret == -EAGAIN) {
5434 btrfs_add_free_space(used_block_group, offset, num_bytes);
5438 /* we are all good, lets return */
5439 ins->objectid = search_start;
5440 ins->offset = num_bytes;
5442 if (offset < search_start)
5443 btrfs_add_free_space(used_block_group, offset,
5444 search_start - offset);
5445 BUG_ON(offset > search_start);
5446 if (used_block_group != block_group)
5447 btrfs_put_block_group(used_block_group);
5448 btrfs_put_block_group(block_group);
5451 failed_cluster_refill = false;
5452 failed_alloc = false;
5453 BUG_ON(index != get_block_group_index(block_group));
5454 if (used_block_group != block_group)
5455 btrfs_put_block_group(used_block_group);
5456 btrfs_put_block_group(block_group);
5458 up_read(&space_info->groups_sem);
5460 if (!ins->objectid && loop >= LOOP_CACHING_WAIT && have_caching_bg)
5463 if (!ins->objectid && ++index < BTRFS_NR_RAID_TYPES)
5466 /* LOOP_FIND_IDEAL, only search caching/cached bg's, and don't wait for
5467 * for them to make caching progress. Also
5468 * determine the best possible bg to cache
5469 * LOOP_CACHING_NOWAIT, search partially cached block groups, kicking
5470 * caching kthreads as we move along
5471 * LOOP_CACHING_WAIT, search everything, and wait if our bg is caching
5472 * LOOP_ALLOC_CHUNK, force a chunk allocation and try again
5473 * LOOP_NO_EMPTY_SIZE, set empty_size and empty_cluster to 0 and try
5476 if (!ins->objectid && loop < LOOP_NO_EMPTY_SIZE) {
5478 if (loop == LOOP_FIND_IDEAL && found_uncached_bg) {
5479 found_uncached_bg = false;
5481 if (!ideal_cache_percent)
5485 * 1 of the following 2 things have happened so far
5487 * 1) We found an ideal block group for caching that
5488 * is mostly full and will cache quickly, so we might
5489 * as well wait for it.
5491 * 2) We searched for cached only and we didn't find
5492 * anything, and we didn't start any caching kthreads
5493 * either, so chances are we will loop through and
5494 * start a couple caching kthreads, and then come back
5495 * around and just wait for them. This will be slower
5496 * because we will have 2 caching kthreads reading at
5497 * the same time when we could have just started one
5498 * and waited for it to get far enough to give us an
5499 * allocation, so go ahead and go to the wait caching
5502 loop = LOOP_CACHING_WAIT;
5503 search_start = ideal_cache_offset;
5504 ideal_cache_percent = 0;
5506 } else if (loop == LOOP_FIND_IDEAL) {
5508 * Didn't find a uncached bg, wait on anything we find
5511 loop = LOOP_CACHING_WAIT;
5517 if (loop == LOOP_ALLOC_CHUNK) {
5518 if (allowed_chunk_alloc) {
5519 ret = do_chunk_alloc(trans, root, num_bytes +
5520 2 * 1024 * 1024, data,
5521 CHUNK_ALLOC_LIMITED);
5522 allowed_chunk_alloc = 0;
5524 done_chunk_alloc = 1;
5525 } else if (!done_chunk_alloc &&
5526 space_info->force_alloc ==
5527 CHUNK_ALLOC_NO_FORCE) {
5528 space_info->force_alloc = CHUNK_ALLOC_LIMITED;
5532 * We didn't allocate a chunk, go ahead and drop the
5533 * empty size and loop again.
5535 if (!done_chunk_alloc)
5536 loop = LOOP_NO_EMPTY_SIZE;
5539 if (loop == LOOP_NO_EMPTY_SIZE) {
5545 } else if (!ins->objectid) {
5547 } else if (ins->objectid) {
5554 static void dump_space_info(struct btrfs_space_info *info, u64 bytes,
5555 int dump_block_groups)
5557 struct btrfs_block_group_cache *cache;
5560 spin_lock(&info->lock);
5561 printk(KERN_INFO "space_info %llu has %llu free, is %sfull\n",
5562 (unsigned long long)info->flags,
5563 (unsigned long long)(info->total_bytes - info->bytes_used -
5564 info->bytes_pinned - info->bytes_reserved -
5565 info->bytes_readonly),
5566 (info->full) ? "" : "not ");
5567 printk(KERN_INFO "space_info total=%llu, used=%llu, pinned=%llu, "
5568 "reserved=%llu, may_use=%llu, readonly=%llu\n",
5569 (unsigned long long)info->total_bytes,
5570 (unsigned long long)info->bytes_used,
5571 (unsigned long long)info->bytes_pinned,
5572 (unsigned long long)info->bytes_reserved,
5573 (unsigned long long)info->bytes_may_use,
5574 (unsigned long long)info->bytes_readonly);
5575 spin_unlock(&info->lock);
5577 if (!dump_block_groups)
5580 down_read(&info->groups_sem);
5582 list_for_each_entry(cache, &info->block_groups[index], list) {
5583 spin_lock(&cache->lock);
5584 printk(KERN_INFO "block group %llu has %llu bytes, %llu used "
5585 "%llu pinned %llu reserved\n",
5586 (unsigned long long)cache->key.objectid,
5587 (unsigned long long)cache->key.offset,
5588 (unsigned long long)btrfs_block_group_used(&cache->item),
5589 (unsigned long long)cache->pinned,
5590 (unsigned long long)cache->reserved);
5591 btrfs_dump_free_space(cache, bytes);
5592 spin_unlock(&cache->lock);
5594 if (++index < BTRFS_NR_RAID_TYPES)
5596 up_read(&info->groups_sem);
5599 int btrfs_reserve_extent(struct btrfs_trans_handle *trans,
5600 struct btrfs_root *root,
5601 u64 num_bytes, u64 min_alloc_size,
5602 u64 empty_size, u64 hint_byte,
5603 u64 search_end, struct btrfs_key *ins,
5607 u64 search_start = 0;
5609 data = btrfs_get_alloc_profile(root, data);
5612 * the only place that sets empty_size is btrfs_realloc_node, which
5613 * is not called recursively on allocations
5615 if (empty_size || root->ref_cows)
5616 ret = do_chunk_alloc(trans, root->fs_info->extent_root,
5617 num_bytes + 2 * 1024 * 1024, data,
5618 CHUNK_ALLOC_NO_FORCE);
5620 WARN_ON(num_bytes < root->sectorsize);
5621 ret = find_free_extent(trans, root, num_bytes, empty_size,
5622 search_start, search_end, hint_byte,
5625 if (ret == -ENOSPC && num_bytes > min_alloc_size) {
5626 num_bytes = num_bytes >> 1;
5627 num_bytes = num_bytes & ~(root->sectorsize - 1);
5628 num_bytes = max(num_bytes, min_alloc_size);
5629 do_chunk_alloc(trans, root->fs_info->extent_root,
5630 num_bytes, data, CHUNK_ALLOC_FORCE);
5633 if (ret == -ENOSPC && btrfs_test_opt(root, ENOSPC_DEBUG)) {
5634 struct btrfs_space_info *sinfo;
5636 sinfo = __find_space_info(root->fs_info, data);
5637 printk(KERN_ERR "btrfs allocation failed flags %llu, "
5638 "wanted %llu\n", (unsigned long long)data,
5639 (unsigned long long)num_bytes);
5640 dump_space_info(sinfo, num_bytes, 1);
5643 trace_btrfs_reserved_extent_alloc(root, ins->objectid, ins->offset);
5648 static int __btrfs_free_reserved_extent(struct btrfs_root *root,
5649 u64 start, u64 len, int pin)
5651 struct btrfs_block_group_cache *cache;
5654 cache = btrfs_lookup_block_group(root->fs_info, start);
5656 printk(KERN_ERR "Unable to find block group for %llu\n",
5657 (unsigned long long)start);
5661 if (btrfs_test_opt(root, DISCARD))
5662 ret = btrfs_discard_extent(root, start, len, NULL);
5665 pin_down_extent(root, cache, start, len, 1);
5667 btrfs_add_free_space(cache, start, len);
5668 btrfs_update_reserved_bytes(cache, len, RESERVE_FREE);
5670 btrfs_put_block_group(cache);
5672 trace_btrfs_reserved_extent_free(root, start, len);
5677 int btrfs_free_reserved_extent(struct btrfs_root *root,
5680 return __btrfs_free_reserved_extent(root, start, len, 0);
5683 int btrfs_free_and_pin_reserved_extent(struct btrfs_root *root,
5686 return __btrfs_free_reserved_extent(root, start, len, 1);
5689 static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
5690 struct btrfs_root *root,
5691 u64 parent, u64 root_objectid,
5692 u64 flags, u64 owner, u64 offset,
5693 struct btrfs_key *ins, int ref_mod)
5696 struct btrfs_fs_info *fs_info = root->fs_info;
5697 struct btrfs_extent_item *extent_item;
5698 struct btrfs_extent_inline_ref *iref;
5699 struct btrfs_path *path;
5700 struct extent_buffer *leaf;
5705 type = BTRFS_SHARED_DATA_REF_KEY;
5707 type = BTRFS_EXTENT_DATA_REF_KEY;
5709 size = sizeof(*extent_item) + btrfs_extent_inline_ref_size(type);
5711 path = btrfs_alloc_path();
5715 path->leave_spinning = 1;
5716 ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path,
5720 leaf = path->nodes[0];
5721 extent_item = btrfs_item_ptr(leaf, path->slots[0],
5722 struct btrfs_extent_item);
5723 btrfs_set_extent_refs(leaf, extent_item, ref_mod);
5724 btrfs_set_extent_generation(leaf, extent_item, trans->transid);
5725 btrfs_set_extent_flags(leaf, extent_item,
5726 flags | BTRFS_EXTENT_FLAG_DATA);
5728 iref = (struct btrfs_extent_inline_ref *)(extent_item + 1);
5729 btrfs_set_extent_inline_ref_type(leaf, iref, type);
5731 struct btrfs_shared_data_ref *ref;
5732 ref = (struct btrfs_shared_data_ref *)(iref + 1);
5733 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
5734 btrfs_set_shared_data_ref_count(leaf, ref, ref_mod);
5736 struct btrfs_extent_data_ref *ref;
5737 ref = (struct btrfs_extent_data_ref *)(&iref->offset);
5738 btrfs_set_extent_data_ref_root(leaf, ref, root_objectid);
5739 btrfs_set_extent_data_ref_objectid(leaf, ref, owner);
5740 btrfs_set_extent_data_ref_offset(leaf, ref, offset);
5741 btrfs_set_extent_data_ref_count(leaf, ref, ref_mod);
5744 btrfs_mark_buffer_dirty(path->nodes[0]);
5745 btrfs_free_path(path);
5747 ret = update_block_group(trans, root, ins->objectid, ins->offset, 1);
5749 printk(KERN_ERR "btrfs update block group failed for %llu "
5750 "%llu\n", (unsigned long long)ins->objectid,
5751 (unsigned long long)ins->offset);
5757 static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans,
5758 struct btrfs_root *root,
5759 u64 parent, u64 root_objectid,
5760 u64 flags, struct btrfs_disk_key *key,
5761 int level, struct btrfs_key *ins)
5764 struct btrfs_fs_info *fs_info = root->fs_info;
5765 struct btrfs_extent_item *extent_item;
5766 struct btrfs_tree_block_info *block_info;
5767 struct btrfs_extent_inline_ref *iref;
5768 struct btrfs_path *path;
5769 struct extent_buffer *leaf;
5770 u32 size = sizeof(*extent_item) + sizeof(*block_info) + sizeof(*iref);
5772 path = btrfs_alloc_path();
5776 path->leave_spinning = 1;
5777 ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path,
5781 leaf = path->nodes[0];
5782 extent_item = btrfs_item_ptr(leaf, path->slots[0],
5783 struct btrfs_extent_item);
5784 btrfs_set_extent_refs(leaf, extent_item, 1);
5785 btrfs_set_extent_generation(leaf, extent_item, trans->transid);
5786 btrfs_set_extent_flags(leaf, extent_item,
5787 flags | BTRFS_EXTENT_FLAG_TREE_BLOCK);
5788 block_info = (struct btrfs_tree_block_info *)(extent_item + 1);
5790 btrfs_set_tree_block_key(leaf, block_info, key);
5791 btrfs_set_tree_block_level(leaf, block_info, level);
5793 iref = (struct btrfs_extent_inline_ref *)(block_info + 1);
5795 BUG_ON(!(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF));
5796 btrfs_set_extent_inline_ref_type(leaf, iref,
5797 BTRFS_SHARED_BLOCK_REF_KEY);
5798 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
5800 btrfs_set_extent_inline_ref_type(leaf, iref,
5801 BTRFS_TREE_BLOCK_REF_KEY);
5802 btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid);
5805 btrfs_mark_buffer_dirty(leaf);
5806 btrfs_free_path(path);
5808 ret = update_block_group(trans, root, ins->objectid, ins->offset, 1);
5810 printk(KERN_ERR "btrfs update block group failed for %llu "
5811 "%llu\n", (unsigned long long)ins->objectid,
5812 (unsigned long long)ins->offset);
5818 int btrfs_alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
5819 struct btrfs_root *root,
5820 u64 root_objectid, u64 owner,
5821 u64 offset, struct btrfs_key *ins)
5825 BUG_ON(root_objectid == BTRFS_TREE_LOG_OBJECTID);
5827 ret = btrfs_add_delayed_data_ref(trans, ins->objectid, ins->offset,
5828 0, root_objectid, owner, offset,
5829 BTRFS_ADD_DELAYED_EXTENT, NULL);
5834 * this is used by the tree logging recovery code. It records that
5835 * an extent has been allocated and makes sure to clear the free
5836 * space cache bits as well
5838 int btrfs_alloc_logged_file_extent(struct btrfs_trans_handle *trans,
5839 struct btrfs_root *root,
5840 u64 root_objectid, u64 owner, u64 offset,
5841 struct btrfs_key *ins)
5844 struct btrfs_block_group_cache *block_group;
5845 struct btrfs_caching_control *caching_ctl;
5846 u64 start = ins->objectid;
5847 u64 num_bytes = ins->offset;
5849 block_group = btrfs_lookup_block_group(root->fs_info, ins->objectid);
5850 cache_block_group(block_group, trans, NULL, 0);
5851 caching_ctl = get_caching_control(block_group);
5854 BUG_ON(!block_group_cache_done(block_group));
5855 ret = btrfs_remove_free_space(block_group, start, num_bytes);
5858 mutex_lock(&caching_ctl->mutex);
5860 if (start >= caching_ctl->progress) {
5861 ret = add_excluded_extent(root, start, num_bytes);
5863 } else if (start + num_bytes <= caching_ctl->progress) {
5864 ret = btrfs_remove_free_space(block_group,
5868 num_bytes = caching_ctl->progress - start;
5869 ret = btrfs_remove_free_space(block_group,
5873 start = caching_ctl->progress;
5874 num_bytes = ins->objectid + ins->offset -
5875 caching_ctl->progress;
5876 ret = add_excluded_extent(root, start, num_bytes);
5880 mutex_unlock(&caching_ctl->mutex);
5881 put_caching_control(caching_ctl);
5884 ret = btrfs_update_reserved_bytes(block_group, ins->offset,
5885 RESERVE_ALLOC_NO_ACCOUNT);
5887 btrfs_put_block_group(block_group);
5888 ret = alloc_reserved_file_extent(trans, root, 0, root_objectid,
5889 0, owner, offset, ins, 1);
5893 struct extent_buffer *btrfs_init_new_buffer(struct btrfs_trans_handle *trans,
5894 struct btrfs_root *root,
5895 u64 bytenr, u32 blocksize,
5898 struct extent_buffer *buf;
5900 buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
5902 return ERR_PTR(-ENOMEM);
5903 btrfs_set_header_generation(buf, trans->transid);
5904 btrfs_set_buffer_lockdep_class(root->root_key.objectid, buf, level);
5905 btrfs_tree_lock(buf);
5906 clean_tree_block(trans, root, buf);
5908 btrfs_set_lock_blocking(buf);
5909 btrfs_set_buffer_uptodate(buf);
5911 if (root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID) {
5913 * we allow two log transactions at a time, use different
5914 * EXENT bit to differentiate dirty pages.
5916 if (root->log_transid % 2 == 0)
5917 set_extent_dirty(&root->dirty_log_pages, buf->start,
5918 buf->start + buf->len - 1, GFP_NOFS);
5920 set_extent_new(&root->dirty_log_pages, buf->start,
5921 buf->start + buf->len - 1, GFP_NOFS);
5923 set_extent_dirty(&trans->transaction->dirty_pages, buf->start,
5924 buf->start + buf->len - 1, GFP_NOFS);
5926 trans->blocks_used++;
5927 /* this returns a buffer locked for blocking */
5931 static struct btrfs_block_rsv *
5932 use_block_rsv(struct btrfs_trans_handle *trans,
5933 struct btrfs_root *root, u32 blocksize)
5935 struct btrfs_block_rsv *block_rsv;
5936 struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv;
5939 block_rsv = get_block_rsv(trans, root);
5941 if (block_rsv->size == 0) {
5942 ret = reserve_metadata_bytes(root, block_rsv, blocksize, 0);
5944 * If we couldn't reserve metadata bytes try and use some from
5945 * the global reserve.
5947 if (ret && block_rsv != global_rsv) {
5948 ret = block_rsv_use_bytes(global_rsv, blocksize);
5951 return ERR_PTR(ret);
5953 return ERR_PTR(ret);
5958 ret = block_rsv_use_bytes(block_rsv, blocksize);
5962 static DEFINE_RATELIMIT_STATE(_rs,
5963 DEFAULT_RATELIMIT_INTERVAL,
5964 /*DEFAULT_RATELIMIT_BURST*/ 2);
5965 if (__ratelimit(&_rs)) {
5966 printk(KERN_DEBUG "btrfs: block rsv returned %d\n", ret);
5969 ret = reserve_metadata_bytes(root, block_rsv, blocksize, 0);
5972 } else if (ret && block_rsv != global_rsv) {
5973 ret = block_rsv_use_bytes(global_rsv, blocksize);
5979 return ERR_PTR(-ENOSPC);
5982 static void unuse_block_rsv(struct btrfs_block_rsv *block_rsv, u32 blocksize)
5984 block_rsv_add_bytes(block_rsv, blocksize, 0);
5985 block_rsv_release_bytes(block_rsv, NULL, 0);
5989 * finds a free extent and does all the dirty work required for allocation
5990 * returns the key for the extent through ins, and a tree buffer for
5991 * the first block of the extent through buf.
5993 * returns the tree buffer or NULL.
5995 struct extent_buffer *btrfs_alloc_free_block(struct btrfs_trans_handle *trans,
5996 struct btrfs_root *root, u32 blocksize,
5997 u64 parent, u64 root_objectid,
5998 struct btrfs_disk_key *key, int level,
5999 u64 hint, u64 empty_size)
6001 struct btrfs_key ins;
6002 struct btrfs_block_rsv *block_rsv;
6003 struct extent_buffer *buf;
6008 block_rsv = use_block_rsv(trans, root, blocksize);
6009 if (IS_ERR(block_rsv))
6010 return ERR_CAST(block_rsv);
6012 ret = btrfs_reserve_extent(trans, root, blocksize, blocksize,
6013 empty_size, hint, (u64)-1, &ins, 0);
6015 unuse_block_rsv(block_rsv, blocksize);
6016 return ERR_PTR(ret);
6019 buf = btrfs_init_new_buffer(trans, root, ins.objectid,
6021 BUG_ON(IS_ERR(buf));
6023 if (root_objectid == BTRFS_TREE_RELOC_OBJECTID) {
6025 parent = ins.objectid;
6026 flags |= BTRFS_BLOCK_FLAG_FULL_BACKREF;
6030 if (root_objectid != BTRFS_TREE_LOG_OBJECTID) {
6031 struct btrfs_delayed_extent_op *extent_op;
6032 extent_op = kmalloc(sizeof(*extent_op), GFP_NOFS);
6035 memcpy(&extent_op->key, key, sizeof(extent_op->key));
6037 memset(&extent_op->key, 0, sizeof(extent_op->key));
6038 extent_op->flags_to_set = flags;
6039 extent_op->update_key = 1;
6040 extent_op->update_flags = 1;
6041 extent_op->is_data = 0;
6043 ret = btrfs_add_delayed_tree_ref(trans, ins.objectid,
6044 ins.offset, parent, root_objectid,
6045 level, BTRFS_ADD_DELAYED_EXTENT,
6052 struct walk_control {
6053 u64 refs[BTRFS_MAX_LEVEL];
6054 u64 flags[BTRFS_MAX_LEVEL];
6055 struct btrfs_key update_progress;
6065 #define DROP_REFERENCE 1
6066 #define UPDATE_BACKREF 2
6068 static noinline void reada_walk_down(struct btrfs_trans_handle *trans,
6069 struct btrfs_root *root,
6070 struct walk_control *wc,
6071 struct btrfs_path *path)
6079 struct btrfs_key key;
6080 struct extent_buffer *eb;
6085 if (path->slots[wc->level] < wc->reada_slot) {
6086 wc->reada_count = wc->reada_count * 2 / 3;
6087 wc->reada_count = max(wc->reada_count, 2);
6089 wc->reada_count = wc->reada_count * 3 / 2;
6090 wc->reada_count = min_t(int, wc->reada_count,
6091 BTRFS_NODEPTRS_PER_BLOCK(root));
6094 eb = path->nodes[wc->level];
6095 nritems = btrfs_header_nritems(eb);
6096 blocksize = btrfs_level_size(root, wc->level - 1);
6098 for (slot = path->slots[wc->level]; slot < nritems; slot++) {
6099 if (nread >= wc->reada_count)
6103 bytenr = btrfs_node_blockptr(eb, slot);
6104 generation = btrfs_node_ptr_generation(eb, slot);
6106 if (slot == path->slots[wc->level])
6109 if (wc->stage == UPDATE_BACKREF &&
6110 generation <= root->root_key.offset)
6113 /* We don't lock the tree block, it's OK to be racy here */
6114 ret = btrfs_lookup_extent_info(trans, root, bytenr, blocksize,
6119 if (wc->stage == DROP_REFERENCE) {
6123 if (wc->level == 1 &&
6124 (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF))
6126 if (!wc->update_ref ||
6127 generation <= root->root_key.offset)
6129 btrfs_node_key_to_cpu(eb, &key, slot);
6130 ret = btrfs_comp_cpu_keys(&key,
6131 &wc->update_progress);
6135 if (wc->level == 1 &&
6136 (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF))
6140 ret = readahead_tree_block(root, bytenr, blocksize,
6146 wc->reada_slot = slot;
6150 * hepler to process tree block while walking down the tree.
6152 * when wc->stage == UPDATE_BACKREF, this function updates
6153 * back refs for pointers in the block.
6155 * NOTE: return value 1 means we should stop walking down.
6157 static noinline int walk_down_proc(struct btrfs_trans_handle *trans,
6158 struct btrfs_root *root,
6159 struct btrfs_path *path,
6160 struct walk_control *wc, int lookup_info)
6162 int level = wc->level;
6163 struct extent_buffer *eb = path->nodes[level];
6164 u64 flag = BTRFS_BLOCK_FLAG_FULL_BACKREF;
6167 if (wc->stage == UPDATE_BACKREF &&
6168 btrfs_header_owner(eb) != root->root_key.objectid)
6172 * when reference count of tree block is 1, it won't increase
6173 * again. once full backref flag is set, we never clear it.
6176 ((wc->stage == DROP_REFERENCE && wc->refs[level] != 1) ||
6177 (wc->stage == UPDATE_BACKREF && !(wc->flags[level] & flag)))) {
6178 BUG_ON(!path->locks[level]);
6179 ret = btrfs_lookup_extent_info(trans, root,
6184 BUG_ON(wc->refs[level] == 0);
6187 if (wc->stage == DROP_REFERENCE) {
6188 if (wc->refs[level] > 1)
6191 if (path->locks[level] && !wc->keep_locks) {
6192 btrfs_tree_unlock_rw(eb, path->locks[level]);
6193 path->locks[level] = 0;
6198 /* wc->stage == UPDATE_BACKREF */
6199 if (!(wc->flags[level] & flag)) {
6200 BUG_ON(!path->locks[level]);
6201 ret = btrfs_inc_ref(trans, root, eb, 1);
6203 ret = btrfs_dec_ref(trans, root, eb, 0);
6205 ret = btrfs_set_disk_extent_flags(trans, root, eb->start,
6208 wc->flags[level] |= flag;
6212 * the block is shared by multiple trees, so it's not good to
6213 * keep the tree lock
6215 if (path->locks[level] && level > 0) {
6216 btrfs_tree_unlock_rw(eb, path->locks[level]);
6217 path->locks[level] = 0;
6223 * hepler to process tree block pointer.
6225 * when wc->stage == DROP_REFERENCE, this function checks
6226 * reference count of the block pointed to. if the block
6227 * is shared and we need update back refs for the subtree
6228 * rooted at the block, this function changes wc->stage to
6229 * UPDATE_BACKREF. if the block is shared and there is no
6230 * need to update back, this function drops the reference
6233 * NOTE: return value 1 means we should stop walking down.
6235 static noinline int do_walk_down(struct btrfs_trans_handle *trans,
6236 struct btrfs_root *root,
6237 struct btrfs_path *path,
6238 struct walk_control *wc, int *lookup_info)
6244 struct btrfs_key key;
6245 struct extent_buffer *next;
6246 int level = wc->level;
6250 generation = btrfs_node_ptr_generation(path->nodes[level],
6251 path->slots[level]);
6253 * if the lower level block was created before the snapshot
6254 * was created, we know there is no need to update back refs
6257 if (wc->stage == UPDATE_BACKREF &&
6258 generation <= root->root_key.offset) {
6263 bytenr = btrfs_node_blockptr(path->nodes[level], path->slots[level]);
6264 blocksize = btrfs_level_size(root, level - 1);
6266 next = btrfs_find_tree_block(root, bytenr, blocksize);
6268 next = btrfs_find_create_tree_block(root, bytenr, blocksize);
6273 btrfs_tree_lock(next);
6274 btrfs_set_lock_blocking(next);
6276 ret = btrfs_lookup_extent_info(trans, root, bytenr, blocksize,
6277 &wc->refs[level - 1],
6278 &wc->flags[level - 1]);
6280 BUG_ON(wc->refs[level - 1] == 0);
6283 if (wc->stage == DROP_REFERENCE) {
6284 if (wc->refs[level - 1] > 1) {
6286 (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF))
6289 if (!wc->update_ref ||
6290 generation <= root->root_key.offset)
6293 btrfs_node_key_to_cpu(path->nodes[level], &key,
6294 path->slots[level]);
6295 ret = btrfs_comp_cpu_keys(&key, &wc->update_progress);
6299 wc->stage = UPDATE_BACKREF;
6300 wc->shared_level = level - 1;
6304 (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF))
6308 if (!btrfs_buffer_uptodate(next, generation)) {
6309 btrfs_tree_unlock(next);
6310 free_extent_buffer(next);
6316 if (reada && level == 1)
6317 reada_walk_down(trans, root, wc, path);
6318 next = read_tree_block(root, bytenr, blocksize, generation);
6321 btrfs_tree_lock(next);
6322 btrfs_set_lock_blocking(next);
6326 BUG_ON(level != btrfs_header_level(next));
6327 path->nodes[level] = next;
6328 path->slots[level] = 0;
6329 path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING;
6335 wc->refs[level - 1] = 0;
6336 wc->flags[level - 1] = 0;
6337 if (wc->stage == DROP_REFERENCE) {
6338 if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) {
6339 parent = path->nodes[level]->start;
6341 BUG_ON(root->root_key.objectid !=
6342 btrfs_header_owner(path->nodes[level]));
6346 ret = btrfs_free_extent(trans, root, bytenr, blocksize, parent,
6347 root->root_key.objectid, level - 1, 0);
6350 btrfs_tree_unlock(next);
6351 free_extent_buffer(next);
6357 * hepler to process tree block while walking up the tree.
6359 * when wc->stage == DROP_REFERENCE, this function drops
6360 * reference count on the block.
6362 * when wc->stage == UPDATE_BACKREF, this function changes
6363 * wc->stage back to DROP_REFERENCE if we changed wc->stage
6364 * to UPDATE_BACKREF previously while processing the block.
6366 * NOTE: return value 1 means we should stop walking up.
6368 static noinline int walk_up_proc(struct btrfs_trans_handle *trans,
6369 struct btrfs_root *root,
6370 struct btrfs_path *path,
6371 struct walk_control *wc)
6374 int level = wc->level;
6375 struct extent_buffer *eb = path->nodes[level];
6378 if (wc->stage == UPDATE_BACKREF) {
6379 BUG_ON(wc->shared_level < level);
6380 if (level < wc->shared_level)
6383 ret = find_next_key(path, level + 1, &wc->update_progress);
6387 wc->stage = DROP_REFERENCE;
6388 wc->shared_level = -1;
6389 path->slots[level] = 0;
6392 * check reference count again if the block isn't locked.
6393 * we should start walking down the tree again if reference
6396 if (!path->locks[level]) {
6398 btrfs_tree_lock(eb);
6399 btrfs_set_lock_blocking(eb);
6400 path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING;
6402 ret = btrfs_lookup_extent_info(trans, root,
6407 BUG_ON(wc->refs[level] == 0);
6408 if (wc->refs[level] == 1) {
6409 btrfs_tree_unlock_rw(eb, path->locks[level]);
6415 /* wc->stage == DROP_REFERENCE */
6416 BUG_ON(wc->refs[level] > 1 && !path->locks[level]);
6418 if (wc->refs[level] == 1) {
6420 if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF)
6421 ret = btrfs_dec_ref(trans, root, eb, 1);
6423 ret = btrfs_dec_ref(trans, root, eb, 0);
6426 /* make block locked assertion in clean_tree_block happy */
6427 if (!path->locks[level] &&
6428 btrfs_header_generation(eb) == trans->transid) {
6429 btrfs_tree_lock(eb);
6430 btrfs_set_lock_blocking(eb);
6431 path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING;
6433 clean_tree_block(trans, root, eb);
6436 if (eb == root->node) {
6437 if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF)
6440 BUG_ON(root->root_key.objectid !=
6441 btrfs_header_owner(eb));
6443 if (wc->flags[level + 1] & BTRFS_BLOCK_FLAG_FULL_BACKREF)
6444 parent = path->nodes[level + 1]->start;
6446 BUG_ON(root->root_key.objectid !=
6447 btrfs_header_owner(path->nodes[level + 1]));
6450 btrfs_free_tree_block(trans, root, eb, parent, wc->refs[level] == 1);
6452 wc->refs[level] = 0;
6453 wc->flags[level] = 0;
6457 static noinline int walk_down_tree(struct btrfs_trans_handle *trans,
6458 struct btrfs_root *root,
6459 struct btrfs_path *path,
6460 struct walk_control *wc)
6462 int level = wc->level;
6463 int lookup_info = 1;
6466 while (level >= 0) {
6467 ret = walk_down_proc(trans, root, path, wc, lookup_info);
6474 if (path->slots[level] >=
6475 btrfs_header_nritems(path->nodes[level]))
6478 ret = do_walk_down(trans, root, path, wc, &lookup_info);
6480 path->slots[level]++;
6489 static noinline int walk_up_tree(struct btrfs_trans_handle *trans,
6490 struct btrfs_root *root,
6491 struct btrfs_path *path,
6492 struct walk_control *wc, int max_level)
6494 int level = wc->level;
6497 path->slots[level] = btrfs_header_nritems(path->nodes[level]);
6498 while (level < max_level && path->nodes[level]) {
6500 if (path->slots[level] + 1 <
6501 btrfs_header_nritems(path->nodes[level])) {
6502 path->slots[level]++;
6505 ret = walk_up_proc(trans, root, path, wc);
6509 if (path->locks[level]) {
6510 btrfs_tree_unlock_rw(path->nodes[level],
6511 path->locks[level]);
6512 path->locks[level] = 0;
6514 free_extent_buffer(path->nodes[level]);
6515 path->nodes[level] = NULL;
6523 * drop a subvolume tree.
6525 * this function traverses the tree freeing any blocks that only
6526 * referenced by the tree.
6528 * when a shared tree block is found. this function decreases its
6529 * reference count by one. if update_ref is true, this function
6530 * also make sure backrefs for the shared block and all lower level
6531 * blocks are properly updated.
6533 void btrfs_drop_snapshot(struct btrfs_root *root,
6534 struct btrfs_block_rsv *block_rsv, int update_ref)
6536 struct btrfs_path *path;
6537 struct btrfs_trans_handle *trans;
6538 struct btrfs_root *tree_root = root->fs_info->tree_root;
6539 struct btrfs_root_item *root_item = &root->root_item;
6540 struct walk_control *wc;
6541 struct btrfs_key key;
6546 path = btrfs_alloc_path();
6552 wc = kzalloc(sizeof(*wc), GFP_NOFS);
6554 btrfs_free_path(path);
6559 trans = btrfs_start_transaction(tree_root, 0);
6560 BUG_ON(IS_ERR(trans));
6563 trans->block_rsv = block_rsv;
6565 if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) {
6566 level = btrfs_header_level(root->node);
6567 path->nodes[level] = btrfs_lock_root_node(root);
6568 btrfs_set_lock_blocking(path->nodes[level]);
6569 path->slots[level] = 0;
6570 path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING;
6571 memset(&wc->update_progress, 0,
6572 sizeof(wc->update_progress));
6574 btrfs_disk_key_to_cpu(&key, &root_item->drop_progress);
6575 memcpy(&wc->update_progress, &key,
6576 sizeof(wc->update_progress));
6578 level = root_item->drop_level;
6580 path->lowest_level = level;
6581 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
6582 path->lowest_level = 0;
6590 * unlock our path, this is safe because only this
6591 * function is allowed to delete this snapshot
6593 btrfs_unlock_up_safe(path, 0);
6595 level = btrfs_header_level(root->node);
6597 btrfs_tree_lock(path->nodes[level]);
6598 btrfs_set_lock_blocking(path->nodes[level]);
6600 ret = btrfs_lookup_extent_info(trans, root,
6601 path->nodes[level]->start,
6602 path->nodes[level]->len,
6606 BUG_ON(wc->refs[level] == 0);
6608 if (level == root_item->drop_level)
6611 btrfs_tree_unlock(path->nodes[level]);
6612 WARN_ON(wc->refs[level] != 1);
6618 wc->shared_level = -1;
6619 wc->stage = DROP_REFERENCE;
6620 wc->update_ref = update_ref;
6622 wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(root);
6625 ret = walk_down_tree(trans, root, path, wc);
6631 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL);
6638 BUG_ON(wc->stage != DROP_REFERENCE);
6642 if (wc->stage == DROP_REFERENCE) {
6644 btrfs_node_key(path->nodes[level],
6645 &root_item->drop_progress,
6646 path->slots[level]);
6647 root_item->drop_level = level;
6650 BUG_ON(wc->level == 0);
6651 if (btrfs_should_end_transaction(trans, tree_root)) {
6652 ret = btrfs_update_root(trans, tree_root,
6657 btrfs_end_transaction_throttle(trans, tree_root);
6658 trans = btrfs_start_transaction(tree_root, 0);
6659 BUG_ON(IS_ERR(trans));
6661 trans->block_rsv = block_rsv;
6664 btrfs_release_path(path);
6667 ret = btrfs_del_root(trans, tree_root, &root->root_key);
6670 if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) {
6671 ret = btrfs_find_last_root(tree_root, root->root_key.objectid,
6675 /* if we fail to delete the orphan item this time
6676 * around, it'll get picked up the next time.
6678 * The most common failure here is just -ENOENT.
6680 btrfs_del_orphan_item(trans, tree_root,
6681 root->root_key.objectid);
6685 if (root->in_radix) {
6686 btrfs_free_fs_root(tree_root->fs_info, root);
6688 free_extent_buffer(root->node);
6689 free_extent_buffer(root->commit_root);
6693 btrfs_end_transaction_throttle(trans, tree_root);
6695 btrfs_free_path(path);
6698 btrfs_std_error(root->fs_info, err);
6703 * drop subtree rooted at tree block 'node'.
6705 * NOTE: this function will unlock and release tree block 'node'
6707 int btrfs_drop_subtree(struct btrfs_trans_handle *trans,
6708 struct btrfs_root *root,
6709 struct extent_buffer *node,
6710 struct extent_buffer *parent)
6712 struct btrfs_path *path;
6713 struct walk_control *wc;
6719 BUG_ON(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID);
6721 path = btrfs_alloc_path();
6725 wc = kzalloc(sizeof(*wc), GFP_NOFS);
6727 btrfs_free_path(path);
6731 btrfs_assert_tree_locked(parent);
6732 parent_level = btrfs_header_level(parent);
6733 extent_buffer_get(parent);
6734 path->nodes[parent_level] = parent;
6735 path->slots[parent_level] = btrfs_header_nritems(parent);
6737 btrfs_assert_tree_locked(node);
6738 level = btrfs_header_level(node);
6739 path->nodes[level] = node;
6740 path->slots[level] = 0;
6741 path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING;
6743 wc->refs[parent_level] = 1;
6744 wc->flags[parent_level] = BTRFS_BLOCK_FLAG_FULL_BACKREF;
6746 wc->shared_level = -1;
6747 wc->stage = DROP_REFERENCE;
6750 wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(root);
6753 wret = walk_down_tree(trans, root, path, wc);
6759 wret = walk_up_tree(trans, root, path, wc, parent_level);
6767 btrfs_free_path(path);
6771 static u64 update_block_group_flags(struct btrfs_root *root, u64 flags)
6774 u64 stripped = BTRFS_BLOCK_GROUP_RAID0 |
6775 BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID10;
6778 * we add in the count of missing devices because we want
6779 * to make sure that any RAID levels on a degraded FS
6780 * continue to be honored.
6782 num_devices = root->fs_info->fs_devices->rw_devices +
6783 root->fs_info->fs_devices->missing_devices;
6785 if (num_devices == 1) {
6786 stripped |= BTRFS_BLOCK_GROUP_DUP;
6787 stripped = flags & ~stripped;
6789 /* turn raid0 into single device chunks */
6790 if (flags & BTRFS_BLOCK_GROUP_RAID0)
6793 /* turn mirroring into duplication */
6794 if (flags & (BTRFS_BLOCK_GROUP_RAID1 |
6795 BTRFS_BLOCK_GROUP_RAID10))
6796 return stripped | BTRFS_BLOCK_GROUP_DUP;
6799 /* they already had raid on here, just return */
6800 if (flags & stripped)
6803 stripped |= BTRFS_BLOCK_GROUP_DUP;
6804 stripped = flags & ~stripped;
6806 /* switch duplicated blocks with raid1 */
6807 if (flags & BTRFS_BLOCK_GROUP_DUP)
6808 return stripped | BTRFS_BLOCK_GROUP_RAID1;
6810 /* turn single device chunks into raid0 */
6811 return stripped | BTRFS_BLOCK_GROUP_RAID0;
6816 static int set_block_group_ro(struct btrfs_block_group_cache *cache, int force)
6818 struct btrfs_space_info *sinfo = cache->space_info;
6820 u64 min_allocable_bytes;
6825 * We need some metadata space and system metadata space for
6826 * allocating chunks in some corner cases until we force to set
6827 * it to be readonly.
6830 (BTRFS_BLOCK_GROUP_SYSTEM | BTRFS_BLOCK_GROUP_METADATA)) &&
6832 min_allocable_bytes = 1 * 1024 * 1024;
6834 min_allocable_bytes = 0;
6836 spin_lock(&sinfo->lock);
6837 spin_lock(&cache->lock);
6844 num_bytes = cache->key.offset - cache->reserved - cache->pinned -
6845 cache->bytes_super - btrfs_block_group_used(&cache->item);
6847 if (sinfo->bytes_used + sinfo->bytes_reserved + sinfo->bytes_pinned +
6848 sinfo->bytes_may_use + sinfo->bytes_readonly + num_bytes +
6849 min_allocable_bytes <= sinfo->total_bytes) {
6850 sinfo->bytes_readonly += num_bytes;
6855 spin_unlock(&cache->lock);
6856 spin_unlock(&sinfo->lock);
6860 int btrfs_set_block_group_ro(struct btrfs_root *root,
6861 struct btrfs_block_group_cache *cache)
6864 struct btrfs_trans_handle *trans;
6870 trans = btrfs_join_transaction(root);
6871 BUG_ON(IS_ERR(trans));
6873 alloc_flags = update_block_group_flags(root, cache->flags);
6874 if (alloc_flags != cache->flags)
6875 do_chunk_alloc(trans, root, 2 * 1024 * 1024, alloc_flags,
6878 ret = set_block_group_ro(cache, 0);
6881 alloc_flags = get_alloc_profile(root, cache->space_info->flags);
6882 ret = do_chunk_alloc(trans, root, 2 * 1024 * 1024, alloc_flags,
6886 ret = set_block_group_ro(cache, 0);
6888 btrfs_end_transaction(trans, root);
6892 int btrfs_force_chunk_alloc(struct btrfs_trans_handle *trans,
6893 struct btrfs_root *root, u64 type)
6895 u64 alloc_flags = get_alloc_profile(root, type);
6896 return do_chunk_alloc(trans, root, 2 * 1024 * 1024, alloc_flags,
6901 * helper to account the unused space of all the readonly block group in the
6902 * list. takes mirrors into account.
6904 static u64 __btrfs_get_ro_block_group_free_space(struct list_head *groups_list)
6906 struct btrfs_block_group_cache *block_group;
6910 list_for_each_entry(block_group, groups_list, list) {
6911 spin_lock(&block_group->lock);
6913 if (!block_group->ro) {
6914 spin_unlock(&block_group->lock);
6918 if (block_group->flags & (BTRFS_BLOCK_GROUP_RAID1 |
6919 BTRFS_BLOCK_GROUP_RAID10 |
6920 BTRFS_BLOCK_GROUP_DUP))
6925 free_bytes += (block_group->key.offset -
6926 btrfs_block_group_used(&block_group->item)) *
6929 spin_unlock(&block_group->lock);
6936 * helper to account the unused space of all the readonly block group in the
6937 * space_info. takes mirrors into account.
6939 u64 btrfs_account_ro_block_groups_free_space(struct btrfs_space_info *sinfo)
6944 spin_lock(&sinfo->lock);
6946 for(i = 0; i < BTRFS_NR_RAID_TYPES; i++)
6947 if (!list_empty(&sinfo->block_groups[i]))
6948 free_bytes += __btrfs_get_ro_block_group_free_space(
6949 &sinfo->block_groups[i]);
6951 spin_unlock(&sinfo->lock);
6956 int btrfs_set_block_group_rw(struct btrfs_root *root,
6957 struct btrfs_block_group_cache *cache)
6959 struct btrfs_space_info *sinfo = cache->space_info;
6964 spin_lock(&sinfo->lock);
6965 spin_lock(&cache->lock);
6966 num_bytes = cache->key.offset - cache->reserved - cache->pinned -
6967 cache->bytes_super - btrfs_block_group_used(&cache->item);
6968 sinfo->bytes_readonly -= num_bytes;
6970 spin_unlock(&cache->lock);
6971 spin_unlock(&sinfo->lock);
6976 * checks to see if its even possible to relocate this block group.
6978 * @return - -1 if it's not a good idea to relocate this block group, 0 if its
6979 * ok to go ahead and try.
6981 int btrfs_can_relocate(struct btrfs_root *root, u64 bytenr)
6983 struct btrfs_block_group_cache *block_group;
6984 struct btrfs_space_info *space_info;
6985 struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices;
6986 struct btrfs_device *device;
6994 block_group = btrfs_lookup_block_group(root->fs_info, bytenr);
6996 /* odd, couldn't find the block group, leave it alone */
7000 min_free = btrfs_block_group_used(&block_group->item);
7002 /* no bytes used, we're good */
7006 space_info = block_group->space_info;
7007 spin_lock(&space_info->lock);
7009 full = space_info->full;
7012 * if this is the last block group we have in this space, we can't
7013 * relocate it unless we're able to allocate a new chunk below.
7015 * Otherwise, we need to make sure we have room in the space to handle
7016 * all of the extents from this block group. If we can, we're good
7018 if ((space_info->total_bytes != block_group->key.offset) &&
7019 (space_info->bytes_used + space_info->bytes_reserved +
7020 space_info->bytes_pinned + space_info->bytes_readonly +
7021 min_free < space_info->total_bytes)) {
7022 spin_unlock(&space_info->lock);
7025 spin_unlock(&space_info->lock);
7028 * ok we don't have enough space, but maybe we have free space on our
7029 * devices to allocate new chunks for relocation, so loop through our
7030 * alloc devices and guess if we have enough space. However, if we
7031 * were marked as full, then we know there aren't enough chunks, and we
7046 index = get_block_group_index(block_group);
7051 } else if (index == 1) {
7053 } else if (index == 2) {
7056 } else if (index == 3) {
7057 dev_min = fs_devices->rw_devices;
7058 do_div(min_free, dev_min);
7061 mutex_lock(&root->fs_info->chunk_mutex);
7062 list_for_each_entry(device, &fs_devices->alloc_list, dev_alloc_list) {
7066 * check to make sure we can actually find a chunk with enough
7067 * space to fit our block group in.
7069 if (device->total_bytes > device->bytes_used + min_free) {
7070 ret = find_free_dev_extent(NULL, device, min_free,
7075 if (dev_nr >= dev_min)
7081 mutex_unlock(&root->fs_info->chunk_mutex);
7083 btrfs_put_block_group(block_group);
7087 static int find_first_block_group(struct btrfs_root *root,
7088 struct btrfs_path *path, struct btrfs_key *key)
7091 struct btrfs_key found_key;
7092 struct extent_buffer *leaf;
7095 ret = btrfs_search_slot(NULL, root, key, path, 0, 0);
7100 slot = path->slots[0];
7101 leaf = path->nodes[0];
7102 if (slot >= btrfs_header_nritems(leaf)) {
7103 ret = btrfs_next_leaf(root, path);
7110 btrfs_item_key_to_cpu(leaf, &found_key, slot);
7112 if (found_key.objectid >= key->objectid &&
7113 found_key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) {
7123 void btrfs_put_block_group_cache(struct btrfs_fs_info *info)
7125 struct btrfs_block_group_cache *block_group;
7129 struct inode *inode;
7131 block_group = btrfs_lookup_first_block_group(info, last);
7132 while (block_group) {
7133 spin_lock(&block_group->lock);
7134 if (block_group->iref)
7136 spin_unlock(&block_group->lock);
7137 block_group = next_block_group(info->tree_root,
7147 inode = block_group->inode;
7148 block_group->iref = 0;
7149 block_group->inode = NULL;
7150 spin_unlock(&block_group->lock);
7152 last = block_group->key.objectid + block_group->key.offset;
7153 btrfs_put_block_group(block_group);
7157 int btrfs_free_block_groups(struct btrfs_fs_info *info)
7159 struct btrfs_block_group_cache *block_group;
7160 struct btrfs_space_info *space_info;
7161 struct btrfs_caching_control *caching_ctl;
7164 down_write(&info->extent_commit_sem);
7165 while (!list_empty(&info->caching_block_groups)) {
7166 caching_ctl = list_entry(info->caching_block_groups.next,
7167 struct btrfs_caching_control, list);
7168 list_del(&caching_ctl->list);
7169 put_caching_control(caching_ctl);
7171 up_write(&info->extent_commit_sem);
7173 spin_lock(&info->block_group_cache_lock);
7174 while ((n = rb_last(&info->block_group_cache_tree)) != NULL) {
7175 block_group = rb_entry(n, struct btrfs_block_group_cache,
7177 rb_erase(&block_group->cache_node,
7178 &info->block_group_cache_tree);
7179 spin_unlock(&info->block_group_cache_lock);
7181 down_write(&block_group->space_info->groups_sem);
7182 list_del(&block_group->list);
7183 up_write(&block_group->space_info->groups_sem);
7185 if (block_group->cached == BTRFS_CACHE_STARTED)
7186 wait_block_group_cache_done(block_group);
7189 * We haven't cached this block group, which means we could
7190 * possibly have excluded extents on this block group.
7192 if (block_group->cached == BTRFS_CACHE_NO)
7193 free_excluded_extents(info->extent_root, block_group);
7195 btrfs_remove_free_space_cache(block_group);
7196 btrfs_put_block_group(block_group);
7198 spin_lock(&info->block_group_cache_lock);
7200 spin_unlock(&info->block_group_cache_lock);
7202 /* now that all the block groups are freed, go through and
7203 * free all the space_info structs. This is only called during
7204 * the final stages of unmount, and so we know nobody is
7205 * using them. We call synchronize_rcu() once before we start,
7206 * just to be on the safe side.
7210 release_global_block_rsv(info);
7212 while(!list_empty(&info->space_info)) {
7213 space_info = list_entry(info->space_info.next,
7214 struct btrfs_space_info,
7216 if (space_info->bytes_pinned > 0 ||
7217 space_info->bytes_reserved > 0 ||
7218 space_info->bytes_may_use > 0) {
7220 dump_space_info(space_info, 0, 0);
7222 list_del(&space_info->list);
7228 static void __link_block_group(struct btrfs_space_info *space_info,
7229 struct btrfs_block_group_cache *cache)
7231 int index = get_block_group_index(cache);
7233 down_write(&space_info->groups_sem);
7234 list_add_tail(&cache->list, &space_info->block_groups[index]);
7235 up_write(&space_info->groups_sem);
7238 int btrfs_read_block_groups(struct btrfs_root *root)
7240 struct btrfs_path *path;
7242 struct btrfs_block_group_cache *cache;
7243 struct btrfs_fs_info *info = root->fs_info;
7244 struct btrfs_space_info *space_info;
7245 struct btrfs_key key;
7246 struct btrfs_key found_key;
7247 struct extent_buffer *leaf;
7251 root = info->extent_root;
7254 btrfs_set_key_type(&key, BTRFS_BLOCK_GROUP_ITEM_KEY);
7255 path = btrfs_alloc_path();
7260 cache_gen = btrfs_super_cache_generation(root->fs_info->super_copy);
7261 if (btrfs_test_opt(root, SPACE_CACHE) &&
7262 btrfs_super_generation(root->fs_info->super_copy) != cache_gen)
7264 if (btrfs_test_opt(root, CLEAR_CACHE))
7268 ret = find_first_block_group(root, path, &key);
7273 leaf = path->nodes[0];
7274 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
7275 cache = kzalloc(sizeof(*cache), GFP_NOFS);
7280 cache->free_space_ctl = kzalloc(sizeof(*cache->free_space_ctl),
7282 if (!cache->free_space_ctl) {
7288 atomic_set(&cache->count, 1);
7289 spin_lock_init(&cache->lock);
7290 cache->fs_info = info;
7291 INIT_LIST_HEAD(&cache->list);
7292 INIT_LIST_HEAD(&cache->cluster_list);
7295 cache->disk_cache_state = BTRFS_DC_CLEAR;
7297 read_extent_buffer(leaf, &cache->item,
7298 btrfs_item_ptr_offset(leaf, path->slots[0]),
7299 sizeof(cache->item));
7300 memcpy(&cache->key, &found_key, sizeof(found_key));
7302 key.objectid = found_key.objectid + found_key.offset;
7303 btrfs_release_path(path);
7304 cache->flags = btrfs_block_group_flags(&cache->item);
7305 cache->sectorsize = root->sectorsize;
7307 btrfs_init_free_space_ctl(cache);
7310 * We need to exclude the super stripes now so that the space
7311 * info has super bytes accounted for, otherwise we'll think
7312 * we have more space than we actually do.
7314 exclude_super_stripes(root, cache);
7317 * check for two cases, either we are full, and therefore
7318 * don't need to bother with the caching work since we won't
7319 * find any space, or we are empty, and we can just add all
7320 * the space in and be done with it. This saves us _alot_ of
7321 * time, particularly in the full case.
7323 if (found_key.offset == btrfs_block_group_used(&cache->item)) {
7324 cache->last_byte_to_unpin = (u64)-1;
7325 cache->cached = BTRFS_CACHE_FINISHED;
7326 free_excluded_extents(root, cache);
7327 } else if (btrfs_block_group_used(&cache->item) == 0) {
7328 cache->last_byte_to_unpin = (u64)-1;
7329 cache->cached = BTRFS_CACHE_FINISHED;
7330 add_new_free_space(cache, root->fs_info,
7332 found_key.objectid +
7334 free_excluded_extents(root, cache);
7337 ret = update_space_info(info, cache->flags, found_key.offset,
7338 btrfs_block_group_used(&cache->item),
7341 cache->space_info = space_info;
7342 spin_lock(&cache->space_info->lock);
7343 cache->space_info->bytes_readonly += cache->bytes_super;
7344 spin_unlock(&cache->space_info->lock);
7346 __link_block_group(space_info, cache);
7348 ret = btrfs_add_block_group_cache(root->fs_info, cache);
7351 set_avail_alloc_bits(root->fs_info, cache->flags);
7352 if (btrfs_chunk_readonly(root, cache->key.objectid))
7353 set_block_group_ro(cache, 1);
7356 list_for_each_entry_rcu(space_info, &root->fs_info->space_info, list) {
7357 if (!(get_alloc_profile(root, space_info->flags) &
7358 (BTRFS_BLOCK_GROUP_RAID10 |
7359 BTRFS_BLOCK_GROUP_RAID1 |
7360 BTRFS_BLOCK_GROUP_DUP)))
7363 * avoid allocating from un-mirrored block group if there are
7364 * mirrored block groups.
7366 list_for_each_entry(cache, &space_info->block_groups[3], list)
7367 set_block_group_ro(cache, 1);
7368 list_for_each_entry(cache, &space_info->block_groups[4], list)
7369 set_block_group_ro(cache, 1);
7372 init_global_block_rsv(info);
7375 btrfs_free_path(path);
7379 int btrfs_make_block_group(struct btrfs_trans_handle *trans,
7380 struct btrfs_root *root, u64 bytes_used,
7381 u64 type, u64 chunk_objectid, u64 chunk_offset,
7385 struct btrfs_root *extent_root;
7386 struct btrfs_block_group_cache *cache;
7388 extent_root = root->fs_info->extent_root;
7390 root->fs_info->last_trans_log_full_commit = trans->transid;
7392 cache = kzalloc(sizeof(*cache), GFP_NOFS);
7395 cache->free_space_ctl = kzalloc(sizeof(*cache->free_space_ctl),
7397 if (!cache->free_space_ctl) {
7402 cache->key.objectid = chunk_offset;
7403 cache->key.offset = size;
7404 cache->key.type = BTRFS_BLOCK_GROUP_ITEM_KEY;
7405 cache->sectorsize = root->sectorsize;
7406 cache->fs_info = root->fs_info;
7408 atomic_set(&cache->count, 1);
7409 spin_lock_init(&cache->lock);
7410 INIT_LIST_HEAD(&cache->list);
7411 INIT_LIST_HEAD(&cache->cluster_list);
7413 btrfs_init_free_space_ctl(cache);
7415 btrfs_set_block_group_used(&cache->item, bytes_used);
7416 btrfs_set_block_group_chunk_objectid(&cache->item, chunk_objectid);
7417 cache->flags = type;
7418 btrfs_set_block_group_flags(&cache->item, type);
7420 cache->last_byte_to_unpin = (u64)-1;
7421 cache->cached = BTRFS_CACHE_FINISHED;
7422 exclude_super_stripes(root, cache);
7424 add_new_free_space(cache, root->fs_info, chunk_offset,
7425 chunk_offset + size);
7427 free_excluded_extents(root, cache);
7429 ret = update_space_info(root->fs_info, cache->flags, size, bytes_used,
7430 &cache->space_info);
7433 spin_lock(&cache->space_info->lock);
7434 cache->space_info->bytes_readonly += cache->bytes_super;
7435 spin_unlock(&cache->space_info->lock);
7437 __link_block_group(cache->space_info, cache);
7439 ret = btrfs_add_block_group_cache(root->fs_info, cache);
7442 ret = btrfs_insert_item(trans, extent_root, &cache->key, &cache->item,
7443 sizeof(cache->item));
7446 set_avail_alloc_bits(extent_root->fs_info, type);
7451 int btrfs_remove_block_group(struct btrfs_trans_handle *trans,
7452 struct btrfs_root *root, u64 group_start)
7454 struct btrfs_path *path;
7455 struct btrfs_block_group_cache *block_group;
7456 struct btrfs_free_cluster *cluster;
7457 struct btrfs_root *tree_root = root->fs_info->tree_root;
7458 struct btrfs_key key;
7459 struct inode *inode;
7463 root = root->fs_info->extent_root;
7465 block_group = btrfs_lookup_block_group(root->fs_info, group_start);
7466 BUG_ON(!block_group);
7467 BUG_ON(!block_group->ro);
7470 * Free the reserved super bytes from this block group before
7473 free_excluded_extents(root, block_group);
7475 memcpy(&key, &block_group->key, sizeof(key));
7476 if (block_group->flags & (BTRFS_BLOCK_GROUP_DUP |
7477 BTRFS_BLOCK_GROUP_RAID1 |
7478 BTRFS_BLOCK_GROUP_RAID10))
7483 /* make sure this block group isn't part of an allocation cluster */
7484 cluster = &root->fs_info->data_alloc_cluster;
7485 spin_lock(&cluster->refill_lock);
7486 btrfs_return_cluster_to_free_space(block_group, cluster);
7487 spin_unlock(&cluster->refill_lock);
7490 * make sure this block group isn't part of a metadata
7491 * allocation cluster
7493 cluster = &root->fs_info->meta_alloc_cluster;
7494 spin_lock(&cluster->refill_lock);
7495 btrfs_return_cluster_to_free_space(block_group, cluster);
7496 spin_unlock(&cluster->refill_lock);
7498 path = btrfs_alloc_path();
7504 inode = lookup_free_space_inode(tree_root, block_group, path);
7505 if (!IS_ERR(inode)) {
7506 ret = btrfs_orphan_add(trans, inode);
7509 /* One for the block groups ref */
7510 spin_lock(&block_group->lock);
7511 if (block_group->iref) {
7512 block_group->iref = 0;
7513 block_group->inode = NULL;
7514 spin_unlock(&block_group->lock);
7517 spin_unlock(&block_group->lock);
7519 /* One for our lookup ref */
7520 btrfs_add_delayed_iput(inode);
7523 key.objectid = BTRFS_FREE_SPACE_OBJECTID;
7524 key.offset = block_group->key.objectid;
7527 ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1);
7531 btrfs_release_path(path);
7533 ret = btrfs_del_item(trans, tree_root, path);
7536 btrfs_release_path(path);
7539 spin_lock(&root->fs_info->block_group_cache_lock);
7540 rb_erase(&block_group->cache_node,
7541 &root->fs_info->block_group_cache_tree);
7542 spin_unlock(&root->fs_info->block_group_cache_lock);
7544 down_write(&block_group->space_info->groups_sem);
7546 * we must use list_del_init so people can check to see if they
7547 * are still on the list after taking the semaphore
7549 list_del_init(&block_group->list);
7550 up_write(&block_group->space_info->groups_sem);
7552 if (block_group->cached == BTRFS_CACHE_STARTED)
7553 wait_block_group_cache_done(block_group);
7555 btrfs_remove_free_space_cache(block_group);
7557 spin_lock(&block_group->space_info->lock);
7558 block_group->space_info->total_bytes -= block_group->key.offset;
7559 block_group->space_info->bytes_readonly -= block_group->key.offset;
7560 block_group->space_info->disk_total -= block_group->key.offset * factor;
7561 spin_unlock(&block_group->space_info->lock);
7563 memcpy(&key, &block_group->key, sizeof(key));
7565 btrfs_clear_space_info_full(root->fs_info);
7567 btrfs_put_block_group(block_group);
7568 btrfs_put_block_group(block_group);
7570 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
7576 ret = btrfs_del_item(trans, root, path);
7578 btrfs_free_path(path);
7582 int btrfs_init_space_info(struct btrfs_fs_info *fs_info)
7584 struct btrfs_space_info *space_info;
7585 struct btrfs_super_block *disk_super;
7591 disk_super = fs_info->super_copy;
7592 if (!btrfs_super_root(disk_super))
7595 features = btrfs_super_incompat_flags(disk_super);
7596 if (features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS)
7599 flags = BTRFS_BLOCK_GROUP_SYSTEM;
7600 ret = update_space_info(fs_info, flags, 0, 0, &space_info);
7605 flags = BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA;
7606 ret = update_space_info(fs_info, flags, 0, 0, &space_info);
7608 flags = BTRFS_BLOCK_GROUP_METADATA;
7609 ret = update_space_info(fs_info, flags, 0, 0, &space_info);
7613 flags = BTRFS_BLOCK_GROUP_DATA;
7614 ret = update_space_info(fs_info, flags, 0, 0, &space_info);
7620 int btrfs_error_unpin_extent_range(struct btrfs_root *root, u64 start, u64 end)
7622 return unpin_extent_range(root, start, end);
7625 int btrfs_error_discard_extent(struct btrfs_root *root, u64 bytenr,
7626 u64 num_bytes, u64 *actual_bytes)
7628 return btrfs_discard_extent(root, bytenr, num_bytes, actual_bytes);
7631 int btrfs_trim_fs(struct btrfs_root *root, struct fstrim_range *range)
7633 struct btrfs_fs_info *fs_info = root->fs_info;
7634 struct btrfs_block_group_cache *cache = NULL;
7641 cache = btrfs_lookup_block_group(fs_info, range->start);
7644 if (cache->key.objectid >= (range->start + range->len)) {
7645 btrfs_put_block_group(cache);
7649 start = max(range->start, cache->key.objectid);
7650 end = min(range->start + range->len,
7651 cache->key.objectid + cache->key.offset);
7653 if (end - start >= range->minlen) {
7654 if (!block_group_cache_done(cache)) {
7655 ret = cache_block_group(cache, NULL, root, 0);
7657 wait_block_group_cache_done(cache);
7659 ret = btrfs_trim_block_group(cache,
7665 trimmed += group_trimmed;
7667 btrfs_put_block_group(cache);
7672 cache = next_block_group(fs_info->tree_root, cache);
7675 range->len = trimmed;