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
,
2273 list_del_init(&locked_ref
->cluster
);
2278 rb_erase(&ref
->rb_node
, &delayed_refs
->root
);
2279 delayed_refs
->num_entries
--;
2281 spin_unlock(&delayed_refs
->lock
);
2283 ret
= run_one_delayed_ref(trans
, root
, ref
, extent_op
,
2284 must_insert_reserved
);
2287 btrfs_put_delayed_ref(ref
);
2291 do_chunk_alloc(trans
, root
->fs_info
->extent_root
,
2293 btrfs_get_alloc_profile(root
, 0),
2294 CHUNK_ALLOC_NO_FORCE
);
2296 spin_lock(&delayed_refs
->lock
);
2302 * this starts processing the delayed reference count updates and
2303 * extent insertions we have queued up so far. count can be
2304 * 0, which means to process everything in the tree at the start
2305 * of the run (but not newly added entries), or it can be some target
2306 * number you'd like to process.
2308 int btrfs_run_delayed_refs(struct btrfs_trans_handle
*trans
,
2309 struct btrfs_root
*root
, unsigned long count
)
2311 struct rb_node
*node
;
2312 struct btrfs_delayed_ref_root
*delayed_refs
;
2313 struct btrfs_delayed_ref_node
*ref
;
2314 struct list_head cluster
;
2316 int run_all
= count
== (unsigned long)-1;
2319 if (root
== root
->fs_info
->extent_root
)
2320 root
= root
->fs_info
->tree_root
;
2322 do_chunk_alloc(trans
, root
->fs_info
->extent_root
,
2323 2 * 1024 * 1024, btrfs_get_alloc_profile(root
, 0),
2324 CHUNK_ALLOC_NO_FORCE
);
2326 delayed_refs
= &trans
->transaction
->delayed_refs
;
2327 INIT_LIST_HEAD(&cluster
);
2329 spin_lock(&delayed_refs
->lock
);
2331 count
= delayed_refs
->num_entries
* 2;
2335 if (!(run_all
|| run_most
) &&
2336 delayed_refs
->num_heads_ready
< 64)
2340 * go find something we can process in the rbtree. We start at
2341 * the beginning of the tree, and then build a cluster
2342 * of refs to process starting at the first one we are able to
2345 ret
= btrfs_find_ref_cluster(trans
, &cluster
,
2346 delayed_refs
->run_delayed_start
);
2350 ret
= run_clustered_refs(trans
, root
, &cluster
);
2353 count
-= min_t(unsigned long, ret
, count
);
2360 node
= rb_first(&delayed_refs
->root
);
2363 count
= (unsigned long)-1;
2366 ref
= rb_entry(node
, struct btrfs_delayed_ref_node
,
2368 if (btrfs_delayed_ref_is_head(ref
)) {
2369 struct btrfs_delayed_ref_head
*head
;
2371 head
= btrfs_delayed_node_to_head(ref
);
2372 atomic_inc(&ref
->refs
);
2374 spin_unlock(&delayed_refs
->lock
);
2376 * Mutex was contended, block until it's
2377 * released and try again
2379 mutex_lock(&head
->mutex
);
2380 mutex_unlock(&head
->mutex
);
2382 btrfs_put_delayed_ref(ref
);
2386 node
= rb_next(node
);
2388 spin_unlock(&delayed_refs
->lock
);
2389 schedule_timeout(1);
2393 spin_unlock(&delayed_refs
->lock
);
2397 int btrfs_set_disk_extent_flags(struct btrfs_trans_handle
*trans
,
2398 struct btrfs_root
*root
,
2399 u64 bytenr
, u64 num_bytes
, u64 flags
,
2402 struct btrfs_delayed_extent_op
*extent_op
;
2405 extent_op
= kmalloc(sizeof(*extent_op
), GFP_NOFS
);
2409 extent_op
->flags_to_set
= flags
;
2410 extent_op
->update_flags
= 1;
2411 extent_op
->update_key
= 0;
2412 extent_op
->is_data
= is_data
? 1 : 0;
2414 ret
= btrfs_add_delayed_extent_op(trans
, bytenr
, num_bytes
, extent_op
);
2420 static noinline
int check_delayed_ref(struct btrfs_trans_handle
*trans
,
2421 struct btrfs_root
*root
,
2422 struct btrfs_path
*path
,
2423 u64 objectid
, u64 offset
, u64 bytenr
)
2425 struct btrfs_delayed_ref_head
*head
;
2426 struct btrfs_delayed_ref_node
*ref
;
2427 struct btrfs_delayed_data_ref
*data_ref
;
2428 struct btrfs_delayed_ref_root
*delayed_refs
;
2429 struct rb_node
*node
;
2433 delayed_refs
= &trans
->transaction
->delayed_refs
;
2434 spin_lock(&delayed_refs
->lock
);
2435 head
= btrfs_find_delayed_ref_head(trans
, bytenr
);
2439 if (!mutex_trylock(&head
->mutex
)) {
2440 atomic_inc(&head
->node
.refs
);
2441 spin_unlock(&delayed_refs
->lock
);
2443 btrfs_release_path(path
);
2446 * Mutex was contended, block until it's released and let
2449 mutex_lock(&head
->mutex
);
2450 mutex_unlock(&head
->mutex
);
2451 btrfs_put_delayed_ref(&head
->node
);
2455 node
= rb_prev(&head
->node
.rb_node
);
2459 ref
= rb_entry(node
, struct btrfs_delayed_ref_node
, rb_node
);
2461 if (ref
->bytenr
!= bytenr
)
2465 if (ref
->type
!= BTRFS_EXTENT_DATA_REF_KEY
)
2468 data_ref
= btrfs_delayed_node_to_data_ref(ref
);
2470 node
= rb_prev(node
);
2472 ref
= rb_entry(node
, struct btrfs_delayed_ref_node
, rb_node
);
2473 if (ref
->bytenr
== bytenr
)
2477 if (data_ref
->root
!= root
->root_key
.objectid
||
2478 data_ref
->objectid
!= objectid
|| data_ref
->offset
!= offset
)
2483 mutex_unlock(&head
->mutex
);
2485 spin_unlock(&delayed_refs
->lock
);
2489 static noinline
int check_committed_ref(struct btrfs_trans_handle
*trans
,
2490 struct btrfs_root
*root
,
2491 struct btrfs_path
*path
,
2492 u64 objectid
, u64 offset
, u64 bytenr
)
2494 struct btrfs_root
*extent_root
= root
->fs_info
->extent_root
;
2495 struct extent_buffer
*leaf
;
2496 struct btrfs_extent_data_ref
*ref
;
2497 struct btrfs_extent_inline_ref
*iref
;
2498 struct btrfs_extent_item
*ei
;
2499 struct btrfs_key key
;
2503 key
.objectid
= bytenr
;
2504 key
.offset
= (u64
)-1;
2505 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
2507 ret
= btrfs_search_slot(NULL
, extent_root
, &key
, path
, 0, 0);
2513 if (path
->slots
[0] == 0)
2517 leaf
= path
->nodes
[0];
2518 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
2520 if (key
.objectid
!= bytenr
|| key
.type
!= BTRFS_EXTENT_ITEM_KEY
)
2524 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
2525 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2526 if (item_size
< sizeof(*ei
)) {
2527 WARN_ON(item_size
!= sizeof(struct btrfs_extent_item_v0
));
2531 ei
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
2533 if (item_size
!= sizeof(*ei
) +
2534 btrfs_extent_inline_ref_size(BTRFS_EXTENT_DATA_REF_KEY
))
2537 if (btrfs_extent_generation(leaf
, ei
) <=
2538 btrfs_root_last_snapshot(&root
->root_item
))
2541 iref
= (struct btrfs_extent_inline_ref
*)(ei
+ 1);
2542 if (btrfs_extent_inline_ref_type(leaf
, iref
) !=
2543 BTRFS_EXTENT_DATA_REF_KEY
)
2546 ref
= (struct btrfs_extent_data_ref
*)(&iref
->offset
);
2547 if (btrfs_extent_refs(leaf
, ei
) !=
2548 btrfs_extent_data_ref_count(leaf
, ref
) ||
2549 btrfs_extent_data_ref_root(leaf
, ref
) !=
2550 root
->root_key
.objectid
||
2551 btrfs_extent_data_ref_objectid(leaf
, ref
) != objectid
||
2552 btrfs_extent_data_ref_offset(leaf
, ref
) != offset
)
2560 int btrfs_cross_ref_exist(struct btrfs_trans_handle
*trans
,
2561 struct btrfs_root
*root
,
2562 u64 objectid
, u64 offset
, u64 bytenr
)
2564 struct btrfs_path
*path
;
2568 path
= btrfs_alloc_path();
2573 ret
= check_committed_ref(trans
, root
, path
, objectid
,
2575 if (ret
&& ret
!= -ENOENT
)
2578 ret2
= check_delayed_ref(trans
, root
, path
, objectid
,
2580 } while (ret2
== -EAGAIN
);
2582 if (ret2
&& ret2
!= -ENOENT
) {
2587 if (ret
!= -ENOENT
|| ret2
!= -ENOENT
)
2590 btrfs_free_path(path
);
2591 if (root
->root_key
.objectid
== BTRFS_DATA_RELOC_TREE_OBJECTID
)
2596 static int __btrfs_mod_ref(struct btrfs_trans_handle
*trans
,
2597 struct btrfs_root
*root
,
2598 struct extent_buffer
*buf
,
2599 int full_backref
, int inc
)
2606 struct btrfs_key key
;
2607 struct btrfs_file_extent_item
*fi
;
2611 int (*process_func
)(struct btrfs_trans_handle
*, struct btrfs_root
*,
2612 u64
, u64
, u64
, u64
, u64
, u64
);
2614 ref_root
= btrfs_header_owner(buf
);
2615 nritems
= btrfs_header_nritems(buf
);
2616 level
= btrfs_header_level(buf
);
2618 if (!root
->ref_cows
&& level
== 0)
2622 process_func
= btrfs_inc_extent_ref
;
2624 process_func
= btrfs_free_extent
;
2627 parent
= buf
->start
;
2631 for (i
= 0; i
< nritems
; i
++) {
2633 btrfs_item_key_to_cpu(buf
, &key
, i
);
2634 if (btrfs_key_type(&key
) != BTRFS_EXTENT_DATA_KEY
)
2636 fi
= btrfs_item_ptr(buf
, i
,
2637 struct btrfs_file_extent_item
);
2638 if (btrfs_file_extent_type(buf
, fi
) ==
2639 BTRFS_FILE_EXTENT_INLINE
)
2641 bytenr
= btrfs_file_extent_disk_bytenr(buf
, fi
);
2645 num_bytes
= btrfs_file_extent_disk_num_bytes(buf
, fi
);
2646 key
.offset
-= btrfs_file_extent_offset(buf
, fi
);
2647 ret
= process_func(trans
, root
, bytenr
, num_bytes
,
2648 parent
, ref_root
, key
.objectid
,
2653 bytenr
= btrfs_node_blockptr(buf
, i
);
2654 num_bytes
= btrfs_level_size(root
, level
- 1);
2655 ret
= process_func(trans
, root
, bytenr
, num_bytes
,
2656 parent
, ref_root
, level
- 1, 0);
2667 int btrfs_inc_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
, 1);
2673 int btrfs_dec_ref(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
2674 struct extent_buffer
*buf
, int full_backref
)
2676 return __btrfs_mod_ref(trans
, root
, buf
, full_backref
, 0);
2679 static int write_one_cache_group(struct btrfs_trans_handle
*trans
,
2680 struct btrfs_root
*root
,
2681 struct btrfs_path
*path
,
2682 struct btrfs_block_group_cache
*cache
)
2685 struct btrfs_root
*extent_root
= root
->fs_info
->extent_root
;
2687 struct extent_buffer
*leaf
;
2689 ret
= btrfs_search_slot(trans
, extent_root
, &cache
->key
, path
, 0, 1);
2694 leaf
= path
->nodes
[0];
2695 bi
= btrfs_item_ptr_offset(leaf
, path
->slots
[0]);
2696 write_extent_buffer(leaf
, &cache
->item
, bi
, sizeof(cache
->item
));
2697 btrfs_mark_buffer_dirty(leaf
);
2698 btrfs_release_path(path
);
2706 static struct btrfs_block_group_cache
*
2707 next_block_group(struct btrfs_root
*root
,
2708 struct btrfs_block_group_cache
*cache
)
2710 struct rb_node
*node
;
2711 spin_lock(&root
->fs_info
->block_group_cache_lock
);
2712 node
= rb_next(&cache
->cache_node
);
2713 btrfs_put_block_group(cache
);
2715 cache
= rb_entry(node
, struct btrfs_block_group_cache
,
2717 btrfs_get_block_group(cache
);
2720 spin_unlock(&root
->fs_info
->block_group_cache_lock
);
2724 static int cache_save_setup(struct btrfs_block_group_cache
*block_group
,
2725 struct btrfs_trans_handle
*trans
,
2726 struct btrfs_path
*path
)
2728 struct btrfs_root
*root
= block_group
->fs_info
->tree_root
;
2729 struct inode
*inode
= NULL
;
2731 int dcs
= BTRFS_DC_ERROR
;
2737 * If this block group is smaller than 100 megs don't bother caching the
2740 if (block_group
->key
.offset
< (100 * 1024 * 1024)) {
2741 spin_lock(&block_group
->lock
);
2742 block_group
->disk_cache_state
= BTRFS_DC_WRITTEN
;
2743 spin_unlock(&block_group
->lock
);
2748 inode
= lookup_free_space_inode(root
, block_group
, path
);
2749 if (IS_ERR(inode
) && PTR_ERR(inode
) != -ENOENT
) {
2750 ret
= PTR_ERR(inode
);
2751 btrfs_release_path(path
);
2755 if (IS_ERR(inode
)) {
2759 if (block_group
->ro
)
2762 ret
= create_free_space_inode(root
, trans
, block_group
, path
);
2768 /* We've already setup this transaction, go ahead and exit */
2769 if (block_group
->cache_generation
== trans
->transid
&&
2770 i_size_read(inode
)) {
2771 dcs
= BTRFS_DC_SETUP
;
2776 * We want to set the generation to 0, that way if anything goes wrong
2777 * from here on out we know not to trust this cache when we load up next
2780 BTRFS_I(inode
)->generation
= 0;
2781 ret
= btrfs_update_inode(trans
, root
, inode
);
2784 if (i_size_read(inode
) > 0) {
2785 ret
= btrfs_truncate_free_space_cache(root
, trans
, path
,
2791 spin_lock(&block_group
->lock
);
2792 if (block_group
->cached
!= BTRFS_CACHE_FINISHED
) {
2793 /* We're not cached, don't bother trying to write stuff out */
2794 dcs
= BTRFS_DC_WRITTEN
;
2795 spin_unlock(&block_group
->lock
);
2798 spin_unlock(&block_group
->lock
);
2800 num_pages
= (int)div64_u64(block_group
->key
.offset
, 1024 * 1024 * 1024);
2805 * Just to make absolutely sure we have enough space, we're going to
2806 * preallocate 12 pages worth of space for each block group. In
2807 * practice we ought to use at most 8, but we need extra space so we can
2808 * add our header and have a terminator between the extents and the
2812 num_pages
*= PAGE_CACHE_SIZE
;
2814 ret
= btrfs_check_data_free_space(inode
, num_pages
);
2818 ret
= btrfs_prealloc_file_range_trans(inode
, trans
, 0, 0, num_pages
,
2819 num_pages
, num_pages
,
2822 dcs
= BTRFS_DC_SETUP
;
2823 btrfs_free_reserved_data_space(inode
, num_pages
);
2828 btrfs_release_path(path
);
2830 spin_lock(&block_group
->lock
);
2831 if (!ret
&& dcs
== BTRFS_DC_SETUP
)
2832 block_group
->cache_generation
= trans
->transid
;
2833 block_group
->disk_cache_state
= dcs
;
2834 spin_unlock(&block_group
->lock
);
2839 int btrfs_write_dirty_block_groups(struct btrfs_trans_handle
*trans
,
2840 struct btrfs_root
*root
)
2842 struct btrfs_block_group_cache
*cache
;
2844 struct btrfs_path
*path
;
2847 path
= btrfs_alloc_path();
2853 cache
= btrfs_lookup_first_block_group(root
->fs_info
, last
);
2855 if (cache
->disk_cache_state
== BTRFS_DC_CLEAR
)
2857 cache
= next_block_group(root
, cache
);
2865 err
= cache_save_setup(cache
, trans
, path
);
2866 last
= cache
->key
.objectid
+ cache
->key
.offset
;
2867 btrfs_put_block_group(cache
);
2872 err
= btrfs_run_delayed_refs(trans
, root
,
2877 cache
= btrfs_lookup_first_block_group(root
->fs_info
, last
);
2879 if (cache
->disk_cache_state
== BTRFS_DC_CLEAR
) {
2880 btrfs_put_block_group(cache
);
2886 cache
= next_block_group(root
, cache
);
2895 if (cache
->disk_cache_state
== BTRFS_DC_SETUP
)
2896 cache
->disk_cache_state
= BTRFS_DC_NEED_WRITE
;
2898 last
= cache
->key
.objectid
+ cache
->key
.offset
;
2900 err
= write_one_cache_group(trans
, root
, path
, cache
);
2902 btrfs_put_block_group(cache
);
2907 * I don't think this is needed since we're just marking our
2908 * preallocated extent as written, but just in case it can't
2912 err
= btrfs_run_delayed_refs(trans
, root
,
2917 cache
= btrfs_lookup_first_block_group(root
->fs_info
, last
);
2920 * Really this shouldn't happen, but it could if we
2921 * couldn't write the entire preallocated extent and
2922 * splitting the extent resulted in a new block.
2925 btrfs_put_block_group(cache
);
2928 if (cache
->disk_cache_state
== BTRFS_DC_NEED_WRITE
)
2930 cache
= next_block_group(root
, cache
);
2939 btrfs_write_out_cache(root
, trans
, cache
, path
);
2942 * If we didn't have an error then the cache state is still
2943 * NEED_WRITE, so we can set it to WRITTEN.
2945 if (cache
->disk_cache_state
== BTRFS_DC_NEED_WRITE
)
2946 cache
->disk_cache_state
= BTRFS_DC_WRITTEN
;
2947 last
= cache
->key
.objectid
+ cache
->key
.offset
;
2948 btrfs_put_block_group(cache
);
2951 btrfs_free_path(path
);
2955 int btrfs_extent_readonly(struct btrfs_root
*root
, u64 bytenr
)
2957 struct btrfs_block_group_cache
*block_group
;
2960 block_group
= btrfs_lookup_block_group(root
->fs_info
, bytenr
);
2961 if (!block_group
|| block_group
->ro
)
2964 btrfs_put_block_group(block_group
);
2968 static int update_space_info(struct btrfs_fs_info
*info
, u64 flags
,
2969 u64 total_bytes
, u64 bytes_used
,
2970 struct btrfs_space_info
**space_info
)
2972 struct btrfs_space_info
*found
;
2976 if (flags
& (BTRFS_BLOCK_GROUP_DUP
| BTRFS_BLOCK_GROUP_RAID1
|
2977 BTRFS_BLOCK_GROUP_RAID10
))
2982 found
= __find_space_info(info
, flags
);
2984 spin_lock(&found
->lock
);
2985 found
->total_bytes
+= total_bytes
;
2986 found
->disk_total
+= total_bytes
* factor
;
2987 found
->bytes_used
+= bytes_used
;
2988 found
->disk_used
+= bytes_used
* factor
;
2990 spin_unlock(&found
->lock
);
2991 *space_info
= found
;
2994 found
= kzalloc(sizeof(*found
), GFP_NOFS
);
2998 for (i
= 0; i
< BTRFS_NR_RAID_TYPES
; i
++)
2999 INIT_LIST_HEAD(&found
->block_groups
[i
]);
3000 init_rwsem(&found
->groups_sem
);
3001 spin_lock_init(&found
->lock
);
3002 found
->flags
= flags
& (BTRFS_BLOCK_GROUP_DATA
|
3003 BTRFS_BLOCK_GROUP_SYSTEM
|
3004 BTRFS_BLOCK_GROUP_METADATA
);
3005 found
->total_bytes
= total_bytes
;
3006 found
->disk_total
= total_bytes
* factor
;
3007 found
->bytes_used
= bytes_used
;
3008 found
->disk_used
= bytes_used
* factor
;
3009 found
->bytes_pinned
= 0;
3010 found
->bytes_reserved
= 0;
3011 found
->bytes_readonly
= 0;
3012 found
->bytes_may_use
= 0;
3014 found
->force_alloc
= CHUNK_ALLOC_NO_FORCE
;
3015 found
->chunk_alloc
= 0;
3017 init_waitqueue_head(&found
->wait
);
3018 *space_info
= found
;
3019 list_add_rcu(&found
->list
, &info
->space_info
);
3023 static void set_avail_alloc_bits(struct btrfs_fs_info
*fs_info
, u64 flags
)
3025 u64 extra_flags
= flags
& (BTRFS_BLOCK_GROUP_RAID0
|
3026 BTRFS_BLOCK_GROUP_RAID1
|
3027 BTRFS_BLOCK_GROUP_RAID10
|
3028 BTRFS_BLOCK_GROUP_DUP
);
3030 if (flags
& BTRFS_BLOCK_GROUP_DATA
)
3031 fs_info
->avail_data_alloc_bits
|= extra_flags
;
3032 if (flags
& BTRFS_BLOCK_GROUP_METADATA
)
3033 fs_info
->avail_metadata_alloc_bits
|= extra_flags
;
3034 if (flags
& BTRFS_BLOCK_GROUP_SYSTEM
)
3035 fs_info
->avail_system_alloc_bits
|= extra_flags
;
3039 u64
btrfs_reduce_alloc_profile(struct btrfs_root
*root
, u64 flags
)
3042 * we add in the count of missing devices because we want
3043 * to make sure that any RAID levels on a degraded FS
3044 * continue to be honored.
3046 u64 num_devices
= root
->fs_info
->fs_devices
->rw_devices
+
3047 root
->fs_info
->fs_devices
->missing_devices
;
3049 if (num_devices
== 1)
3050 flags
&= ~(BTRFS_BLOCK_GROUP_RAID1
| BTRFS_BLOCK_GROUP_RAID0
);
3051 if (num_devices
< 4)
3052 flags
&= ~BTRFS_BLOCK_GROUP_RAID10
;
3054 if ((flags
& BTRFS_BLOCK_GROUP_DUP
) &&
3055 (flags
& (BTRFS_BLOCK_GROUP_RAID1
|
3056 BTRFS_BLOCK_GROUP_RAID10
))) {
3057 flags
&= ~BTRFS_BLOCK_GROUP_DUP
;
3060 if ((flags
& BTRFS_BLOCK_GROUP_RAID1
) &&
3061 (flags
& BTRFS_BLOCK_GROUP_RAID10
)) {
3062 flags
&= ~BTRFS_BLOCK_GROUP_RAID1
;
3065 if ((flags
& BTRFS_BLOCK_GROUP_RAID0
) &&
3066 ((flags
& BTRFS_BLOCK_GROUP_RAID1
) |
3067 (flags
& BTRFS_BLOCK_GROUP_RAID10
) |
3068 (flags
& BTRFS_BLOCK_GROUP_DUP
)))
3069 flags
&= ~BTRFS_BLOCK_GROUP_RAID0
;
3073 static u64
get_alloc_profile(struct btrfs_root
*root
, u64 flags
)
3075 if (flags
& BTRFS_BLOCK_GROUP_DATA
)
3076 flags
|= root
->fs_info
->avail_data_alloc_bits
&
3077 root
->fs_info
->data_alloc_profile
;
3078 else if (flags
& BTRFS_BLOCK_GROUP_SYSTEM
)
3079 flags
|= root
->fs_info
->avail_system_alloc_bits
&
3080 root
->fs_info
->system_alloc_profile
;
3081 else if (flags
& BTRFS_BLOCK_GROUP_METADATA
)
3082 flags
|= root
->fs_info
->avail_metadata_alloc_bits
&
3083 root
->fs_info
->metadata_alloc_profile
;
3084 return btrfs_reduce_alloc_profile(root
, flags
);
3087 u64
btrfs_get_alloc_profile(struct btrfs_root
*root
, int data
)
3092 flags
= BTRFS_BLOCK_GROUP_DATA
;
3093 else if (root
== root
->fs_info
->chunk_root
)
3094 flags
= BTRFS_BLOCK_GROUP_SYSTEM
;
3096 flags
= BTRFS_BLOCK_GROUP_METADATA
;
3098 return get_alloc_profile(root
, flags
);
3101 void btrfs_set_inode_space_info(struct btrfs_root
*root
, struct inode
*inode
)
3103 BTRFS_I(inode
)->space_info
= __find_space_info(root
->fs_info
,
3104 BTRFS_BLOCK_GROUP_DATA
);
3108 * This will check the space that the inode allocates from to make sure we have
3109 * enough space for bytes.
3111 int btrfs_check_data_free_space(struct inode
*inode
, u64 bytes
)
3113 struct btrfs_space_info
*data_sinfo
;
3114 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3116 int ret
= 0, committed
= 0, alloc_chunk
= 1;
3118 /* make sure bytes are sectorsize aligned */
3119 bytes
= (bytes
+ root
->sectorsize
- 1) & ~((u64
)root
->sectorsize
- 1);
3121 if (root
== root
->fs_info
->tree_root
||
3122 BTRFS_I(inode
)->location
.objectid
== BTRFS_FREE_INO_OBJECTID
) {
3127 data_sinfo
= BTRFS_I(inode
)->space_info
;
3132 /* make sure we have enough space to handle the data first */
3133 spin_lock(&data_sinfo
->lock
);
3134 used
= data_sinfo
->bytes_used
+ data_sinfo
->bytes_reserved
+
3135 data_sinfo
->bytes_pinned
+ data_sinfo
->bytes_readonly
+
3136 data_sinfo
->bytes_may_use
;
3138 if (used
+ bytes
> data_sinfo
->total_bytes
) {
3139 struct btrfs_trans_handle
*trans
;
3142 * if we don't have enough free bytes in this space then we need
3143 * to alloc a new chunk.
3145 if (!data_sinfo
->full
&& alloc_chunk
) {
3148 data_sinfo
->force_alloc
= CHUNK_ALLOC_FORCE
;
3149 spin_unlock(&data_sinfo
->lock
);
3151 alloc_target
= btrfs_get_alloc_profile(root
, 1);
3152 trans
= btrfs_join_transaction(root
);
3154 return PTR_ERR(trans
);
3156 ret
= do_chunk_alloc(trans
, root
->fs_info
->extent_root
,
3157 bytes
+ 2 * 1024 * 1024,
3159 CHUNK_ALLOC_NO_FORCE
);
3160 btrfs_end_transaction(trans
, root
);
3169 btrfs_set_inode_space_info(root
, inode
);
3170 data_sinfo
= BTRFS_I(inode
)->space_info
;
3176 * If we have less pinned bytes than we want to allocate then
3177 * don't bother committing the transaction, it won't help us.
3179 if (data_sinfo
->bytes_pinned
< bytes
)
3181 spin_unlock(&data_sinfo
->lock
);
3183 /* commit the current transaction and try again */
3186 !atomic_read(&root
->fs_info
->open_ioctl_trans
)) {
3188 trans
= btrfs_join_transaction(root
);
3190 return PTR_ERR(trans
);
3191 ret
= btrfs_commit_transaction(trans
, root
);
3199 data_sinfo
->bytes_may_use
+= bytes
;
3200 spin_unlock(&data_sinfo
->lock
);
3206 * Called if we need to clear a data reservation for this inode.
3208 void btrfs_free_reserved_data_space(struct inode
*inode
, u64 bytes
)
3210 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3211 struct btrfs_space_info
*data_sinfo
;
3213 /* make sure bytes are sectorsize aligned */
3214 bytes
= (bytes
+ root
->sectorsize
- 1) & ~((u64
)root
->sectorsize
- 1);
3216 data_sinfo
= BTRFS_I(inode
)->space_info
;
3217 spin_lock(&data_sinfo
->lock
);
3218 data_sinfo
->bytes_may_use
-= bytes
;
3219 spin_unlock(&data_sinfo
->lock
);
3222 static void force_metadata_allocation(struct btrfs_fs_info
*info
)
3224 struct list_head
*head
= &info
->space_info
;
3225 struct btrfs_space_info
*found
;
3228 list_for_each_entry_rcu(found
, head
, list
) {
3229 if (found
->flags
& BTRFS_BLOCK_GROUP_METADATA
)
3230 found
->force_alloc
= CHUNK_ALLOC_FORCE
;
3235 static int should_alloc_chunk(struct btrfs_root
*root
,
3236 struct btrfs_space_info
*sinfo
, u64 alloc_bytes
,
3239 struct btrfs_block_rsv
*global_rsv
= &root
->fs_info
->global_block_rsv
;
3240 u64 num_bytes
= sinfo
->total_bytes
- sinfo
->bytes_readonly
;
3241 u64 num_allocated
= sinfo
->bytes_used
+ sinfo
->bytes_reserved
;
3244 if (force
== CHUNK_ALLOC_FORCE
)
3248 * We need to take into account the global rsv because for all intents
3249 * and purposes it's used space. Don't worry about locking the
3250 * global_rsv, it doesn't change except when the transaction commits.
3252 num_allocated
+= global_rsv
->size
;
3255 * in limited mode, we want to have some free space up to
3256 * about 1% of the FS size.
3258 if (force
== CHUNK_ALLOC_LIMITED
) {
3259 thresh
= btrfs_super_total_bytes(root
->fs_info
->super_copy
);
3260 thresh
= max_t(u64
, 64 * 1024 * 1024,
3261 div_factor_fine(thresh
, 1));
3263 if (num_bytes
- num_allocated
< thresh
)
3268 * we have two similar checks here, one based on percentage
3269 * and once based on a hard number of 256MB. The idea
3270 * is that if we have a good amount of free
3271 * room, don't allocate a chunk. A good mount is
3272 * less than 80% utilized of the chunks we have allocated,
3273 * or more than 256MB free
3275 if (num_allocated
+ alloc_bytes
+ 256 * 1024 * 1024 < num_bytes
)
3278 if (num_allocated
+ alloc_bytes
< div_factor(num_bytes
, 8))
3281 thresh
= btrfs_super_total_bytes(root
->fs_info
->super_copy
);
3283 /* 256MB or 5% of the FS */
3284 thresh
= max_t(u64
, 256 * 1024 * 1024, div_factor_fine(thresh
, 5));
3286 if (num_bytes
> thresh
&& sinfo
->bytes_used
< div_factor(num_bytes
, 3))
3291 static int do_chunk_alloc(struct btrfs_trans_handle
*trans
,
3292 struct btrfs_root
*extent_root
, u64 alloc_bytes
,
3293 u64 flags
, int force
)
3295 struct btrfs_space_info
*space_info
;
3296 struct btrfs_fs_info
*fs_info
= extent_root
->fs_info
;
3297 int wait_for_alloc
= 0;
3300 flags
= btrfs_reduce_alloc_profile(extent_root
, flags
);
3302 space_info
= __find_space_info(extent_root
->fs_info
, flags
);
3304 ret
= update_space_info(extent_root
->fs_info
, flags
,
3308 BUG_ON(!space_info
);
3311 spin_lock(&space_info
->lock
);
3312 if (space_info
->force_alloc
)
3313 force
= space_info
->force_alloc
;
3314 if (space_info
->full
) {
3315 spin_unlock(&space_info
->lock
);
3319 if (!should_alloc_chunk(extent_root
, space_info
, alloc_bytes
, force
)) {
3320 spin_unlock(&space_info
->lock
);
3322 } else if (space_info
->chunk_alloc
) {
3325 space_info
->chunk_alloc
= 1;
3328 spin_unlock(&space_info
->lock
);
3330 mutex_lock(&fs_info
->chunk_mutex
);
3333 * The chunk_mutex is held throughout the entirety of a chunk
3334 * allocation, so once we've acquired the chunk_mutex we know that the
3335 * other guy is done and we need to recheck and see if we should
3338 if (wait_for_alloc
) {
3339 mutex_unlock(&fs_info
->chunk_mutex
);
3345 * If we have mixed data/metadata chunks we want to make sure we keep
3346 * allocating mixed chunks instead of individual chunks.
3348 if (btrfs_mixed_space_info(space_info
))
3349 flags
|= (BTRFS_BLOCK_GROUP_DATA
| BTRFS_BLOCK_GROUP_METADATA
);
3352 * if we're doing a data chunk, go ahead and make sure that
3353 * we keep a reasonable number of metadata chunks allocated in the
3356 if (flags
& BTRFS_BLOCK_GROUP_DATA
&& fs_info
->metadata_ratio
) {
3357 fs_info
->data_chunk_allocations
++;
3358 if (!(fs_info
->data_chunk_allocations
%
3359 fs_info
->metadata_ratio
))
3360 force_metadata_allocation(fs_info
);
3363 ret
= btrfs_alloc_chunk(trans
, extent_root
, flags
);
3364 if (ret
< 0 && ret
!= -ENOSPC
)
3367 spin_lock(&space_info
->lock
);
3369 space_info
->full
= 1;
3373 space_info
->force_alloc
= CHUNK_ALLOC_NO_FORCE
;
3374 space_info
->chunk_alloc
= 0;
3375 spin_unlock(&space_info
->lock
);
3377 mutex_unlock(&extent_root
->fs_info
->chunk_mutex
);
3382 * shrink metadata reservation for delalloc
3384 static int shrink_delalloc(struct btrfs_root
*root
, u64 to_reclaim
,
3387 struct btrfs_block_rsv
*block_rsv
;
3388 struct btrfs_space_info
*space_info
;
3389 struct btrfs_trans_handle
*trans
;
3394 unsigned long nr_pages
= (2 * 1024 * 1024) >> PAGE_CACHE_SHIFT
;
3396 unsigned long progress
;
3398 trans
= (struct btrfs_trans_handle
*)current
->journal_info
;
3399 block_rsv
= &root
->fs_info
->delalloc_block_rsv
;
3400 space_info
= block_rsv
->space_info
;
3403 reserved
= space_info
->bytes_may_use
;
3404 progress
= space_info
->reservation_progress
;
3410 if (root
->fs_info
->delalloc_bytes
== 0) {
3413 btrfs_wait_ordered_extents(root
, 0, 0);
3417 max_reclaim
= min(reserved
, to_reclaim
);
3418 nr_pages
= max_t(unsigned long, nr_pages
,
3419 max_reclaim
>> PAGE_CACHE_SHIFT
);
3420 while (loops
< 1024) {
3421 /* have the flusher threads jump in and do some IO */
3423 nr_pages
= min_t(unsigned long, nr_pages
,
3424 root
->fs_info
->delalloc_bytes
>> PAGE_CACHE_SHIFT
);
3425 writeback_inodes_sb_nr_if_idle(root
->fs_info
->sb
, nr_pages
,
3426 WB_REASON_FS_FREE_SPACE
);
3428 spin_lock(&space_info
->lock
);
3429 if (reserved
> space_info
->bytes_may_use
)
3430 reclaimed
+= reserved
- space_info
->bytes_may_use
;
3431 reserved
= space_info
->bytes_may_use
;
3432 spin_unlock(&space_info
->lock
);
3436 if (reserved
== 0 || reclaimed
>= max_reclaim
)
3439 if (trans
&& trans
->transaction
->blocked
)
3442 if (wait_ordered
&& !trans
) {
3443 btrfs_wait_ordered_extents(root
, 0, 0);
3445 time_left
= schedule_timeout_interruptible(1);
3447 /* We were interrupted, exit */
3452 /* we've kicked the IO a few times, if anything has been freed,
3453 * exit. There is no sense in looping here for a long time
3454 * when we really need to commit the transaction, or there are
3455 * just too many writers without enough free space
3460 if (progress
!= space_info
->reservation_progress
)
3466 return reclaimed
>= to_reclaim
;
3470 * maybe_commit_transaction - possibly commit the transaction if its ok to
3471 * @root - the root we're allocating for
3472 * @bytes - the number of bytes we want to reserve
3473 * @force - force the commit
3475 * This will check to make sure that committing the transaction will actually
3476 * get us somewhere and then commit the transaction if it does. Otherwise it
3477 * will return -ENOSPC.
3479 static int may_commit_transaction(struct btrfs_root
*root
,
3480 struct btrfs_space_info
*space_info
,
3481 u64 bytes
, int force
)
3483 struct btrfs_block_rsv
*delayed_rsv
= &root
->fs_info
->delayed_block_rsv
;
3484 struct btrfs_trans_handle
*trans
;
3486 trans
= (struct btrfs_trans_handle
*)current
->journal_info
;
3493 /* See if there is enough pinned space to make this reservation */
3494 spin_lock(&space_info
->lock
);
3495 if (space_info
->bytes_pinned
>= bytes
) {
3496 spin_unlock(&space_info
->lock
);
3499 spin_unlock(&space_info
->lock
);
3502 * See if there is some space in the delayed insertion reservation for
3505 if (space_info
!= delayed_rsv
->space_info
)
3508 spin_lock(&delayed_rsv
->lock
);
3509 if (delayed_rsv
->size
< bytes
) {
3510 spin_unlock(&delayed_rsv
->lock
);
3513 spin_unlock(&delayed_rsv
->lock
);
3516 trans
= btrfs_join_transaction(root
);
3520 return btrfs_commit_transaction(trans
, root
);
3524 * reserve_metadata_bytes - try to reserve bytes from the block_rsv's space
3525 * @root - the root we're allocating for
3526 * @block_rsv - the block_rsv we're allocating for
3527 * @orig_bytes - the number of bytes we want
3528 * @flush - wether or not we can flush to make our reservation
3530 * This will reserve orgi_bytes number of bytes from the space info associated
3531 * with the block_rsv. If there is not enough space it will make an attempt to
3532 * flush out space to make room. It will do this by flushing delalloc if
3533 * possible or committing the transaction. If flush is 0 then no attempts to
3534 * regain reservations will be made and this will fail if there is not enough
3537 static int reserve_metadata_bytes(struct btrfs_root
*root
,
3538 struct btrfs_block_rsv
*block_rsv
,
3539 u64 orig_bytes
, int flush
)
3541 struct btrfs_space_info
*space_info
= block_rsv
->space_info
;
3543 u64 num_bytes
= orig_bytes
;
3546 bool committed
= false;
3547 bool flushing
= false;
3548 bool wait_ordered
= false;
3552 spin_lock(&space_info
->lock
);
3554 * We only want to wait if somebody other than us is flushing and we are
3555 * actually alloed to flush.
3557 while (flush
&& !flushing
&& space_info
->flush
) {
3558 spin_unlock(&space_info
->lock
);
3560 * If we have a trans handle we can't wait because the flusher
3561 * may have to commit the transaction, which would mean we would
3562 * deadlock since we are waiting for the flusher to finish, but
3563 * hold the current transaction open.
3565 if (current
->journal_info
)
3567 ret
= wait_event_interruptible(space_info
->wait
,
3568 !space_info
->flush
);
3569 /* Must have been interrupted, return */
3573 spin_lock(&space_info
->lock
);
3577 used
= space_info
->bytes_used
+ space_info
->bytes_reserved
+
3578 space_info
->bytes_pinned
+ space_info
->bytes_readonly
+
3579 space_info
->bytes_may_use
;
3582 * The idea here is that we've not already over-reserved the block group
3583 * then we can go ahead and save our reservation first and then start
3584 * flushing if we need to. Otherwise if we've already overcommitted
3585 * lets start flushing stuff first and then come back and try to make
3588 if (used
<= space_info
->total_bytes
) {
3589 if (used
+ orig_bytes
<= space_info
->total_bytes
) {
3590 space_info
->bytes_may_use
+= orig_bytes
;
3594 * Ok set num_bytes to orig_bytes since we aren't
3595 * overocmmitted, this way we only try and reclaim what
3598 num_bytes
= orig_bytes
;
3602 * Ok we're over committed, set num_bytes to the overcommitted
3603 * amount plus the amount of bytes that we need for this
3606 wait_ordered
= true;
3607 num_bytes
= used
- space_info
->total_bytes
+
3608 (orig_bytes
* (retries
+ 1));
3612 u64 profile
= btrfs_get_alloc_profile(root
, 0);
3616 * If we have a lot of space that's pinned, don't bother doing
3617 * the overcommit dance yet and just commit the transaction.
3619 avail
= (space_info
->total_bytes
- space_info
->bytes_used
) * 8;
3621 if (space_info
->bytes_pinned
>= avail
&& flush
&& !committed
) {
3622 space_info
->flush
= 1;
3624 spin_unlock(&space_info
->lock
);
3625 ret
= may_commit_transaction(root
, space_info
,
3633 spin_lock(&root
->fs_info
->free_chunk_lock
);
3634 avail
= root
->fs_info
->free_chunk_space
;
3637 * If we have dup, raid1 or raid10 then only half of the free
3638 * space is actually useable.
3640 if (profile
& (BTRFS_BLOCK_GROUP_DUP
|
3641 BTRFS_BLOCK_GROUP_RAID1
|
3642 BTRFS_BLOCK_GROUP_RAID10
))
3646 * If we aren't flushing don't let us overcommit too much, say
3647 * 1/8th of the space. If we can flush, let it overcommit up to
3654 spin_unlock(&root
->fs_info
->free_chunk_lock
);
3656 if (used
+ num_bytes
< space_info
->total_bytes
+ avail
) {
3657 space_info
->bytes_may_use
+= orig_bytes
;
3660 wait_ordered
= true;
3665 * Couldn't make our reservation, save our place so while we're trying
3666 * to reclaim space we can actually use it instead of somebody else
3667 * stealing it from us.
3671 space_info
->flush
= 1;
3674 spin_unlock(&space_info
->lock
);
3680 * We do synchronous shrinking since we don't actually unreserve
3681 * metadata until after the IO is completed.
3683 ret
= shrink_delalloc(root
, num_bytes
, wait_ordered
);
3690 * So if we were overcommitted it's possible that somebody else flushed
3691 * out enough space and we simply didn't have enough space to reclaim,
3692 * so go back around and try again.
3695 wait_ordered
= true;
3704 ret
= may_commit_transaction(root
, space_info
, orig_bytes
, 0);
3712 spin_lock(&space_info
->lock
);
3713 space_info
->flush
= 0;
3714 wake_up_all(&space_info
->wait
);
3715 spin_unlock(&space_info
->lock
);
3720 static struct btrfs_block_rsv
*get_block_rsv(struct btrfs_trans_handle
*trans
,
3721 struct btrfs_root
*root
)
3723 struct btrfs_block_rsv
*block_rsv
= NULL
;
3725 if (root
->ref_cows
|| root
== root
->fs_info
->csum_root
)
3726 block_rsv
= trans
->block_rsv
;
3729 block_rsv
= root
->block_rsv
;
3732 block_rsv
= &root
->fs_info
->empty_block_rsv
;
3737 static int block_rsv_use_bytes(struct btrfs_block_rsv
*block_rsv
,
3741 spin_lock(&block_rsv
->lock
);
3742 if (block_rsv
->reserved
>= num_bytes
) {
3743 block_rsv
->reserved
-= num_bytes
;
3744 if (block_rsv
->reserved
< block_rsv
->size
)
3745 block_rsv
->full
= 0;
3748 spin_unlock(&block_rsv
->lock
);
3752 static void block_rsv_add_bytes(struct btrfs_block_rsv
*block_rsv
,
3753 u64 num_bytes
, int update_size
)
3755 spin_lock(&block_rsv
->lock
);
3756 block_rsv
->reserved
+= num_bytes
;
3758 block_rsv
->size
+= num_bytes
;
3759 else if (block_rsv
->reserved
>= block_rsv
->size
)
3760 block_rsv
->full
= 1;
3761 spin_unlock(&block_rsv
->lock
);
3764 static void block_rsv_release_bytes(struct btrfs_block_rsv
*block_rsv
,
3765 struct btrfs_block_rsv
*dest
, u64 num_bytes
)
3767 struct btrfs_space_info
*space_info
= block_rsv
->space_info
;
3769 spin_lock(&block_rsv
->lock
);
3770 if (num_bytes
== (u64
)-1)
3771 num_bytes
= block_rsv
->size
;
3772 block_rsv
->size
-= num_bytes
;
3773 if (block_rsv
->reserved
>= block_rsv
->size
) {
3774 num_bytes
= block_rsv
->reserved
- block_rsv
->size
;
3775 block_rsv
->reserved
= block_rsv
->size
;
3776 block_rsv
->full
= 1;
3780 spin_unlock(&block_rsv
->lock
);
3782 if (num_bytes
> 0) {
3784 spin_lock(&dest
->lock
);
3788 bytes_to_add
= dest
->size
- dest
->reserved
;
3789 bytes_to_add
= min(num_bytes
, bytes_to_add
);
3790 dest
->reserved
+= bytes_to_add
;
3791 if (dest
->reserved
>= dest
->size
)
3793 num_bytes
-= bytes_to_add
;
3795 spin_unlock(&dest
->lock
);
3798 spin_lock(&space_info
->lock
);
3799 space_info
->bytes_may_use
-= num_bytes
;
3800 space_info
->reservation_progress
++;
3801 spin_unlock(&space_info
->lock
);
3806 static int block_rsv_migrate_bytes(struct btrfs_block_rsv
*src
,
3807 struct btrfs_block_rsv
*dst
, u64 num_bytes
)
3811 ret
= block_rsv_use_bytes(src
, num_bytes
);
3815 block_rsv_add_bytes(dst
, num_bytes
, 1);
3819 void btrfs_init_block_rsv(struct btrfs_block_rsv
*rsv
)
3821 memset(rsv
, 0, sizeof(*rsv
));
3822 spin_lock_init(&rsv
->lock
);
3825 struct btrfs_block_rsv
*btrfs_alloc_block_rsv(struct btrfs_root
*root
)
3827 struct btrfs_block_rsv
*block_rsv
;
3828 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
3830 block_rsv
= kmalloc(sizeof(*block_rsv
), GFP_NOFS
);
3834 btrfs_init_block_rsv(block_rsv
);
3835 block_rsv
->space_info
= __find_space_info(fs_info
,
3836 BTRFS_BLOCK_GROUP_METADATA
);
3840 void btrfs_free_block_rsv(struct btrfs_root
*root
,
3841 struct btrfs_block_rsv
*rsv
)
3843 btrfs_block_rsv_release(root
, rsv
, (u64
)-1);
3847 static inline int __block_rsv_add(struct btrfs_root
*root
,
3848 struct btrfs_block_rsv
*block_rsv
,
3849 u64 num_bytes
, int flush
)
3856 ret
= reserve_metadata_bytes(root
, block_rsv
, num_bytes
, flush
);
3858 block_rsv_add_bytes(block_rsv
, num_bytes
, 1);
3865 int btrfs_block_rsv_add(struct btrfs_root
*root
,
3866 struct btrfs_block_rsv
*block_rsv
,
3869 return __block_rsv_add(root
, block_rsv
, num_bytes
, 1);
3872 int btrfs_block_rsv_add_noflush(struct btrfs_root
*root
,
3873 struct btrfs_block_rsv
*block_rsv
,
3876 return __block_rsv_add(root
, block_rsv
, num_bytes
, 0);
3879 int btrfs_block_rsv_check(struct btrfs_root
*root
,
3880 struct btrfs_block_rsv
*block_rsv
, int min_factor
)
3888 spin_lock(&block_rsv
->lock
);
3889 num_bytes
= div_factor(block_rsv
->size
, min_factor
);
3890 if (block_rsv
->reserved
>= num_bytes
)
3892 spin_unlock(&block_rsv
->lock
);
3897 static inline int __btrfs_block_rsv_refill(struct btrfs_root
*root
,
3898 struct btrfs_block_rsv
*block_rsv
,
3899 u64 min_reserved
, int flush
)
3907 spin_lock(&block_rsv
->lock
);
3908 num_bytes
= min_reserved
;
3909 if (block_rsv
->reserved
>= num_bytes
)
3912 num_bytes
-= block_rsv
->reserved
;
3913 spin_unlock(&block_rsv
->lock
);
3918 ret
= reserve_metadata_bytes(root
, block_rsv
, num_bytes
, flush
);
3920 block_rsv_add_bytes(block_rsv
, num_bytes
, 0);
3927 int btrfs_block_rsv_refill(struct btrfs_root
*root
,
3928 struct btrfs_block_rsv
*block_rsv
,
3931 return __btrfs_block_rsv_refill(root
, block_rsv
, min_reserved
, 1);
3934 int btrfs_block_rsv_refill_noflush(struct btrfs_root
*root
,
3935 struct btrfs_block_rsv
*block_rsv
,
3938 return __btrfs_block_rsv_refill(root
, block_rsv
, min_reserved
, 0);
3941 int btrfs_block_rsv_migrate(struct btrfs_block_rsv
*src_rsv
,
3942 struct btrfs_block_rsv
*dst_rsv
,
3945 return block_rsv_migrate_bytes(src_rsv
, dst_rsv
, num_bytes
);
3948 void btrfs_block_rsv_release(struct btrfs_root
*root
,
3949 struct btrfs_block_rsv
*block_rsv
,
3952 struct btrfs_block_rsv
*global_rsv
= &root
->fs_info
->global_block_rsv
;
3953 if (global_rsv
->full
|| global_rsv
== block_rsv
||
3954 block_rsv
->space_info
!= global_rsv
->space_info
)
3956 block_rsv_release_bytes(block_rsv
, global_rsv
, num_bytes
);
3960 * helper to calculate size of global block reservation.
3961 * the desired value is sum of space used by extent tree,
3962 * checksum tree and root tree
3964 static u64
calc_global_metadata_size(struct btrfs_fs_info
*fs_info
)
3966 struct btrfs_space_info
*sinfo
;
3970 int csum_size
= btrfs_super_csum_size(fs_info
->super_copy
);
3972 sinfo
= __find_space_info(fs_info
, BTRFS_BLOCK_GROUP_DATA
);
3973 spin_lock(&sinfo
->lock
);
3974 data_used
= sinfo
->bytes_used
;
3975 spin_unlock(&sinfo
->lock
);
3977 sinfo
= __find_space_info(fs_info
, BTRFS_BLOCK_GROUP_METADATA
);
3978 spin_lock(&sinfo
->lock
);
3979 if (sinfo
->flags
& BTRFS_BLOCK_GROUP_DATA
)
3981 meta_used
= sinfo
->bytes_used
;
3982 spin_unlock(&sinfo
->lock
);
3984 num_bytes
= (data_used
>> fs_info
->sb
->s_blocksize_bits
) *
3986 num_bytes
+= div64_u64(data_used
+ meta_used
, 50);
3988 if (num_bytes
* 3 > meta_used
)
3989 num_bytes
= div64_u64(meta_used
, 3);
3991 return ALIGN(num_bytes
, fs_info
->extent_root
->leafsize
<< 10);
3994 static void update_global_block_rsv(struct btrfs_fs_info
*fs_info
)
3996 struct btrfs_block_rsv
*block_rsv
= &fs_info
->global_block_rsv
;
3997 struct btrfs_space_info
*sinfo
= block_rsv
->space_info
;
4000 num_bytes
= calc_global_metadata_size(fs_info
);
4002 spin_lock(&block_rsv
->lock
);
4003 spin_lock(&sinfo
->lock
);
4005 block_rsv
->size
= num_bytes
;
4007 num_bytes
= sinfo
->bytes_used
+ sinfo
->bytes_pinned
+
4008 sinfo
->bytes_reserved
+ sinfo
->bytes_readonly
+
4009 sinfo
->bytes_may_use
;
4011 if (sinfo
->total_bytes
> num_bytes
) {
4012 num_bytes
= sinfo
->total_bytes
- num_bytes
;
4013 block_rsv
->reserved
+= num_bytes
;
4014 sinfo
->bytes_may_use
+= num_bytes
;
4017 if (block_rsv
->reserved
>= block_rsv
->size
) {
4018 num_bytes
= block_rsv
->reserved
- block_rsv
->size
;
4019 sinfo
->bytes_may_use
-= num_bytes
;
4020 sinfo
->reservation_progress
++;
4021 block_rsv
->reserved
= block_rsv
->size
;
4022 block_rsv
->full
= 1;
4025 spin_unlock(&sinfo
->lock
);
4026 spin_unlock(&block_rsv
->lock
);
4029 static void init_global_block_rsv(struct btrfs_fs_info
*fs_info
)
4031 struct btrfs_space_info
*space_info
;
4033 space_info
= __find_space_info(fs_info
, BTRFS_BLOCK_GROUP_SYSTEM
);
4034 fs_info
->chunk_block_rsv
.space_info
= space_info
;
4036 space_info
= __find_space_info(fs_info
, BTRFS_BLOCK_GROUP_METADATA
);
4037 fs_info
->global_block_rsv
.space_info
= space_info
;
4038 fs_info
->delalloc_block_rsv
.space_info
= space_info
;
4039 fs_info
->trans_block_rsv
.space_info
= space_info
;
4040 fs_info
->empty_block_rsv
.space_info
= space_info
;
4041 fs_info
->delayed_block_rsv
.space_info
= space_info
;
4043 fs_info
->extent_root
->block_rsv
= &fs_info
->global_block_rsv
;
4044 fs_info
->csum_root
->block_rsv
= &fs_info
->global_block_rsv
;
4045 fs_info
->dev_root
->block_rsv
= &fs_info
->global_block_rsv
;
4046 fs_info
->tree_root
->block_rsv
= &fs_info
->global_block_rsv
;
4047 fs_info
->chunk_root
->block_rsv
= &fs_info
->chunk_block_rsv
;
4049 update_global_block_rsv(fs_info
);
4052 static void release_global_block_rsv(struct btrfs_fs_info
*fs_info
)
4054 block_rsv_release_bytes(&fs_info
->global_block_rsv
, NULL
, (u64
)-1);
4055 WARN_ON(fs_info
->delalloc_block_rsv
.size
> 0);
4056 WARN_ON(fs_info
->delalloc_block_rsv
.reserved
> 0);
4057 WARN_ON(fs_info
->trans_block_rsv
.size
> 0);
4058 WARN_ON(fs_info
->trans_block_rsv
.reserved
> 0);
4059 WARN_ON(fs_info
->chunk_block_rsv
.size
> 0);
4060 WARN_ON(fs_info
->chunk_block_rsv
.reserved
> 0);
4061 WARN_ON(fs_info
->delayed_block_rsv
.size
> 0);
4062 WARN_ON(fs_info
->delayed_block_rsv
.reserved
> 0);
4065 void btrfs_trans_release_metadata(struct btrfs_trans_handle
*trans
,
4066 struct btrfs_root
*root
)
4068 if (!trans
->bytes_reserved
)
4071 btrfs_block_rsv_release(root
, trans
->block_rsv
, trans
->bytes_reserved
);
4072 trans
->bytes_reserved
= 0;
4075 int btrfs_orphan_reserve_metadata(struct btrfs_trans_handle
*trans
,
4076 struct inode
*inode
)
4078 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4079 struct btrfs_block_rsv
*src_rsv
= get_block_rsv(trans
, root
);
4080 struct btrfs_block_rsv
*dst_rsv
= root
->orphan_block_rsv
;
4083 * We need to hold space in order to delete our orphan item once we've
4084 * added it, so this takes the reservation so we can release it later
4085 * when we are truly done with the orphan item.
4087 u64 num_bytes
= btrfs_calc_trans_metadata_size(root
, 1);
4088 return block_rsv_migrate_bytes(src_rsv
, dst_rsv
, num_bytes
);
4091 void btrfs_orphan_release_metadata(struct inode
*inode
)
4093 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4094 u64 num_bytes
= btrfs_calc_trans_metadata_size(root
, 1);
4095 btrfs_block_rsv_release(root
, root
->orphan_block_rsv
, num_bytes
);
4098 int btrfs_snap_reserve_metadata(struct btrfs_trans_handle
*trans
,
4099 struct btrfs_pending_snapshot
*pending
)
4101 struct btrfs_root
*root
= pending
->root
;
4102 struct btrfs_block_rsv
*src_rsv
= get_block_rsv(trans
, root
);
4103 struct btrfs_block_rsv
*dst_rsv
= &pending
->block_rsv
;
4105 * two for root back/forward refs, two for directory entries
4106 * and one for root of the snapshot.
4108 u64 num_bytes
= btrfs_calc_trans_metadata_size(root
, 5);
4109 dst_rsv
->space_info
= src_rsv
->space_info
;
4110 return block_rsv_migrate_bytes(src_rsv
, dst_rsv
, num_bytes
);
4114 * drop_outstanding_extent - drop an outstanding extent
4115 * @inode: the inode we're dropping the extent for
4117 * This is called when we are freeing up an outstanding extent, either called
4118 * after an error or after an extent is written. This will return the number of
4119 * reserved extents that need to be freed. This must be called with
4120 * BTRFS_I(inode)->lock held.
4122 static unsigned drop_outstanding_extent(struct inode
*inode
)
4124 unsigned drop_inode_space
= 0;
4125 unsigned dropped_extents
= 0;
4127 BUG_ON(!BTRFS_I(inode
)->outstanding_extents
);
4128 BTRFS_I(inode
)->outstanding_extents
--;
4130 if (BTRFS_I(inode
)->outstanding_extents
== 0 &&
4131 BTRFS_I(inode
)->delalloc_meta_reserved
) {
4132 drop_inode_space
= 1;
4133 BTRFS_I(inode
)->delalloc_meta_reserved
= 0;
4137 * If we have more or the same amount of outsanding extents than we have
4138 * reserved then we need to leave the reserved extents count alone.
4140 if (BTRFS_I(inode
)->outstanding_extents
>=
4141 BTRFS_I(inode
)->reserved_extents
)
4142 return drop_inode_space
;
4144 dropped_extents
= BTRFS_I(inode
)->reserved_extents
-
4145 BTRFS_I(inode
)->outstanding_extents
;
4146 BTRFS_I(inode
)->reserved_extents
-= dropped_extents
;
4147 return dropped_extents
+ drop_inode_space
;
4151 * calc_csum_metadata_size - return the amount of metada space that must be
4152 * reserved/free'd for the given bytes.
4153 * @inode: the inode we're manipulating
4154 * @num_bytes: the number of bytes in question
4155 * @reserve: 1 if we are reserving space, 0 if we are freeing space
4157 * This adjusts the number of csum_bytes in the inode and then returns the
4158 * correct amount of metadata that must either be reserved or freed. We
4159 * calculate how many checksums we can fit into one leaf and then divide the
4160 * number of bytes that will need to be checksumed by this value to figure out
4161 * how many checksums will be required. If we are adding bytes then the number
4162 * may go up and we will return the number of additional bytes that must be
4163 * reserved. If it is going down we will return the number of bytes that must
4166 * This must be called with BTRFS_I(inode)->lock held.
4168 static u64
calc_csum_metadata_size(struct inode
*inode
, u64 num_bytes
,
4171 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4173 int num_csums_per_leaf
;
4177 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
&&
4178 BTRFS_I(inode
)->csum_bytes
== 0)
4181 old_csums
= (int)div64_u64(BTRFS_I(inode
)->csum_bytes
, root
->sectorsize
);
4183 BTRFS_I(inode
)->csum_bytes
+= num_bytes
;
4185 BTRFS_I(inode
)->csum_bytes
-= num_bytes
;
4186 csum_size
= BTRFS_LEAF_DATA_SIZE(root
) - sizeof(struct btrfs_item
);
4187 num_csums_per_leaf
= (int)div64_u64(csum_size
,
4188 sizeof(struct btrfs_csum_item
) +
4189 sizeof(struct btrfs_disk_key
));
4190 num_csums
= (int)div64_u64(BTRFS_I(inode
)->csum_bytes
, root
->sectorsize
);
4191 num_csums
= num_csums
+ num_csums_per_leaf
- 1;
4192 num_csums
= num_csums
/ num_csums_per_leaf
;
4194 old_csums
= old_csums
+ num_csums_per_leaf
- 1;
4195 old_csums
= old_csums
/ num_csums_per_leaf
;
4197 /* No change, no need to reserve more */
4198 if (old_csums
== num_csums
)
4202 return btrfs_calc_trans_metadata_size(root
,
4203 num_csums
- old_csums
);
4205 return btrfs_calc_trans_metadata_size(root
, old_csums
- num_csums
);
4208 int btrfs_delalloc_reserve_metadata(struct inode
*inode
, u64 num_bytes
)
4210 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4211 struct btrfs_block_rsv
*block_rsv
= &root
->fs_info
->delalloc_block_rsv
;
4214 unsigned nr_extents
= 0;
4215 int extra_reserve
= 0;
4219 /* Need to be holding the i_mutex here if we aren't free space cache */
4220 if (btrfs_is_free_space_inode(root
, inode
))
4223 WARN_ON(!mutex_is_locked(&inode
->i_mutex
));
4225 if (flush
&& btrfs_transaction_in_commit(root
->fs_info
))
4226 schedule_timeout(1);
4228 num_bytes
= ALIGN(num_bytes
, root
->sectorsize
);
4230 spin_lock(&BTRFS_I(inode
)->lock
);
4231 BTRFS_I(inode
)->outstanding_extents
++;
4233 if (BTRFS_I(inode
)->outstanding_extents
>
4234 BTRFS_I(inode
)->reserved_extents
)
4235 nr_extents
= BTRFS_I(inode
)->outstanding_extents
-
4236 BTRFS_I(inode
)->reserved_extents
;
4239 * Add an item to reserve for updating the inode when we complete the
4242 if (!BTRFS_I(inode
)->delalloc_meta_reserved
) {
4247 to_reserve
= btrfs_calc_trans_metadata_size(root
, nr_extents
);
4248 to_reserve
+= calc_csum_metadata_size(inode
, num_bytes
, 1);
4249 csum_bytes
= BTRFS_I(inode
)->csum_bytes
;
4250 spin_unlock(&BTRFS_I(inode
)->lock
);
4252 ret
= reserve_metadata_bytes(root
, block_rsv
, to_reserve
, flush
);
4257 spin_lock(&BTRFS_I(inode
)->lock
);
4258 dropped
= drop_outstanding_extent(inode
);
4260 * If the inodes csum_bytes is the same as the original
4261 * csum_bytes then we know we haven't raced with any free()ers
4262 * so we can just reduce our inodes csum bytes and carry on.
4263 * Otherwise we have to do the normal free thing to account for
4264 * the case that the free side didn't free up its reserve
4265 * because of this outstanding reservation.
4267 if (BTRFS_I(inode
)->csum_bytes
== csum_bytes
)
4268 calc_csum_metadata_size(inode
, num_bytes
, 0);
4270 to_free
= calc_csum_metadata_size(inode
, num_bytes
, 0);
4271 spin_unlock(&BTRFS_I(inode
)->lock
);
4273 to_free
+= btrfs_calc_trans_metadata_size(root
, dropped
);
4276 btrfs_block_rsv_release(root
, block_rsv
, to_free
);
4280 spin_lock(&BTRFS_I(inode
)->lock
);
4281 if (extra_reserve
) {
4282 BTRFS_I(inode
)->delalloc_meta_reserved
= 1;
4285 BTRFS_I(inode
)->reserved_extents
+= nr_extents
;
4286 spin_unlock(&BTRFS_I(inode
)->lock
);
4288 block_rsv_add_bytes(block_rsv
, to_reserve
, 1);
4294 * btrfs_delalloc_release_metadata - release a metadata reservation for an inode
4295 * @inode: the inode to release the reservation for
4296 * @num_bytes: the number of bytes we're releasing
4298 * This will release the metadata reservation for an inode. This can be called
4299 * once we complete IO for a given set of bytes to release their metadata
4302 void btrfs_delalloc_release_metadata(struct inode
*inode
, u64 num_bytes
)
4304 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4308 num_bytes
= ALIGN(num_bytes
, root
->sectorsize
);
4309 spin_lock(&BTRFS_I(inode
)->lock
);
4310 dropped
= drop_outstanding_extent(inode
);
4312 to_free
= calc_csum_metadata_size(inode
, num_bytes
, 0);
4313 spin_unlock(&BTRFS_I(inode
)->lock
);
4315 to_free
+= btrfs_calc_trans_metadata_size(root
, dropped
);
4317 btrfs_block_rsv_release(root
, &root
->fs_info
->delalloc_block_rsv
,
4322 * btrfs_delalloc_reserve_space - reserve data and metadata space for delalloc
4323 * @inode: inode we're writing to
4324 * @num_bytes: the number of bytes we want to allocate
4326 * This will do the following things
4328 * o reserve space in the data space info for num_bytes
4329 * o reserve space in the metadata space info based on number of outstanding
4330 * extents and how much csums will be needed
4331 * o add to the inodes ->delalloc_bytes
4332 * o add it to the fs_info's delalloc inodes list.
4334 * This will return 0 for success and -ENOSPC if there is no space left.
4336 int btrfs_delalloc_reserve_space(struct inode
*inode
, u64 num_bytes
)
4340 ret
= btrfs_check_data_free_space(inode
, num_bytes
);
4344 ret
= btrfs_delalloc_reserve_metadata(inode
, num_bytes
);
4346 btrfs_free_reserved_data_space(inode
, num_bytes
);
4354 * btrfs_delalloc_release_space - release data and metadata space for delalloc
4355 * @inode: inode we're releasing space for
4356 * @num_bytes: the number of bytes we want to free up
4358 * This must be matched with a call to btrfs_delalloc_reserve_space. This is
4359 * called in the case that we don't need the metadata AND data reservations
4360 * anymore. So if there is an error or we insert an inline extent.
4362 * This function will release the metadata space that was not used and will
4363 * decrement ->delalloc_bytes and remove it from the fs_info delalloc_inodes
4364 * list if there are no delalloc bytes left.
4366 void btrfs_delalloc_release_space(struct inode
*inode
, u64 num_bytes
)
4368 btrfs_delalloc_release_metadata(inode
, num_bytes
);
4369 btrfs_free_reserved_data_space(inode
, num_bytes
);
4372 static int update_block_group(struct btrfs_trans_handle
*trans
,
4373 struct btrfs_root
*root
,
4374 u64 bytenr
, u64 num_bytes
, int alloc
)
4376 struct btrfs_block_group_cache
*cache
= NULL
;
4377 struct btrfs_fs_info
*info
= root
->fs_info
;
4378 u64 total
= num_bytes
;
4383 /* block accounting for super block */
4384 spin_lock(&info
->delalloc_lock
);
4385 old_val
= btrfs_super_bytes_used(info
->super_copy
);
4387 old_val
+= num_bytes
;
4389 old_val
-= num_bytes
;
4390 btrfs_set_super_bytes_used(info
->super_copy
, old_val
);
4391 spin_unlock(&info
->delalloc_lock
);
4394 cache
= btrfs_lookup_block_group(info
, bytenr
);
4397 if (cache
->flags
& (BTRFS_BLOCK_GROUP_DUP
|
4398 BTRFS_BLOCK_GROUP_RAID1
|
4399 BTRFS_BLOCK_GROUP_RAID10
))
4404 * If this block group has free space cache written out, we
4405 * need to make sure to load it if we are removing space. This
4406 * is because we need the unpinning stage to actually add the
4407 * space back to the block group, otherwise we will leak space.
4409 if (!alloc
&& cache
->cached
== BTRFS_CACHE_NO
)
4410 cache_block_group(cache
, trans
, NULL
, 1);
4412 byte_in_group
= bytenr
- cache
->key
.objectid
;
4413 WARN_ON(byte_in_group
> cache
->key
.offset
);
4415 spin_lock(&cache
->space_info
->lock
);
4416 spin_lock(&cache
->lock
);
4418 if (btrfs_test_opt(root
, SPACE_CACHE
) &&
4419 cache
->disk_cache_state
< BTRFS_DC_CLEAR
)
4420 cache
->disk_cache_state
= BTRFS_DC_CLEAR
;
4423 old_val
= btrfs_block_group_used(&cache
->item
);
4424 num_bytes
= min(total
, cache
->key
.offset
- byte_in_group
);
4426 old_val
+= num_bytes
;
4427 btrfs_set_block_group_used(&cache
->item
, old_val
);
4428 cache
->reserved
-= num_bytes
;
4429 cache
->space_info
->bytes_reserved
-= num_bytes
;
4430 cache
->space_info
->bytes_used
+= num_bytes
;
4431 cache
->space_info
->disk_used
+= num_bytes
* factor
;
4432 spin_unlock(&cache
->lock
);
4433 spin_unlock(&cache
->space_info
->lock
);
4435 old_val
-= num_bytes
;
4436 btrfs_set_block_group_used(&cache
->item
, old_val
);
4437 cache
->pinned
+= num_bytes
;
4438 cache
->space_info
->bytes_pinned
+= num_bytes
;
4439 cache
->space_info
->bytes_used
-= num_bytes
;
4440 cache
->space_info
->disk_used
-= num_bytes
* factor
;
4441 spin_unlock(&cache
->lock
);
4442 spin_unlock(&cache
->space_info
->lock
);
4444 set_extent_dirty(info
->pinned_extents
,
4445 bytenr
, bytenr
+ num_bytes
- 1,
4446 GFP_NOFS
| __GFP_NOFAIL
);
4448 btrfs_put_block_group(cache
);
4450 bytenr
+= num_bytes
;
4455 static u64
first_logical_byte(struct btrfs_root
*root
, u64 search_start
)
4457 struct btrfs_block_group_cache
*cache
;
4460 cache
= btrfs_lookup_first_block_group(root
->fs_info
, search_start
);
4464 bytenr
= cache
->key
.objectid
;
4465 btrfs_put_block_group(cache
);
4470 static int pin_down_extent(struct btrfs_root
*root
,
4471 struct btrfs_block_group_cache
*cache
,
4472 u64 bytenr
, u64 num_bytes
, int reserved
)
4474 spin_lock(&cache
->space_info
->lock
);
4475 spin_lock(&cache
->lock
);
4476 cache
->pinned
+= num_bytes
;
4477 cache
->space_info
->bytes_pinned
+= num_bytes
;
4479 cache
->reserved
-= num_bytes
;
4480 cache
->space_info
->bytes_reserved
-= num_bytes
;
4482 spin_unlock(&cache
->lock
);
4483 spin_unlock(&cache
->space_info
->lock
);
4485 set_extent_dirty(root
->fs_info
->pinned_extents
, bytenr
,
4486 bytenr
+ num_bytes
- 1, GFP_NOFS
| __GFP_NOFAIL
);
4491 * this function must be called within transaction
4493 int btrfs_pin_extent(struct btrfs_root
*root
,
4494 u64 bytenr
, u64 num_bytes
, int reserved
)
4496 struct btrfs_block_group_cache
*cache
;
4498 cache
= btrfs_lookup_block_group(root
->fs_info
, bytenr
);
4501 pin_down_extent(root
, cache
, bytenr
, num_bytes
, reserved
);
4503 btrfs_put_block_group(cache
);
4508 * this function must be called within transaction
4510 int btrfs_pin_extent_for_log_replay(struct btrfs_trans_handle
*trans
,
4511 struct btrfs_root
*root
,
4512 u64 bytenr
, u64 num_bytes
)
4514 struct btrfs_block_group_cache
*cache
;
4516 cache
= btrfs_lookup_block_group(root
->fs_info
, bytenr
);
4520 * pull in the free space cache (if any) so that our pin
4521 * removes the free space from the cache. We have load_only set
4522 * to one because the slow code to read in the free extents does check
4523 * the pinned extents.
4525 cache_block_group(cache
, trans
, root
, 1);
4527 pin_down_extent(root
, cache
, bytenr
, num_bytes
, 0);
4529 /* remove us from the free space cache (if we're there at all) */
4530 btrfs_remove_free_space(cache
, bytenr
, num_bytes
);
4531 btrfs_put_block_group(cache
);
4536 * btrfs_update_reserved_bytes - update the block_group and space info counters
4537 * @cache: The cache we are manipulating
4538 * @num_bytes: The number of bytes in question
4539 * @reserve: One of the reservation enums
4541 * This is called by the allocator when it reserves space, or by somebody who is
4542 * freeing space that was never actually used on disk. For example if you
4543 * reserve some space for a new leaf in transaction A and before transaction A
4544 * commits you free that leaf, you call this with reserve set to 0 in order to
4545 * clear the reservation.
4547 * Metadata reservations should be called with RESERVE_ALLOC so we do the proper
4548 * ENOSPC accounting. For data we handle the reservation through clearing the
4549 * delalloc bits in the io_tree. We have to do this since we could end up
4550 * allocating less disk space for the amount of data we have reserved in the
4551 * case of compression.
4553 * If this is a reservation and the block group has become read only we cannot
4554 * make the reservation and return -EAGAIN, otherwise this function always
4557 static int btrfs_update_reserved_bytes(struct btrfs_block_group_cache
*cache
,
4558 u64 num_bytes
, int reserve
)
4560 struct btrfs_space_info
*space_info
= cache
->space_info
;
4562 spin_lock(&space_info
->lock
);
4563 spin_lock(&cache
->lock
);
4564 if (reserve
!= RESERVE_FREE
) {
4568 cache
->reserved
+= num_bytes
;
4569 space_info
->bytes_reserved
+= num_bytes
;
4570 if (reserve
== RESERVE_ALLOC
) {
4571 BUG_ON(space_info
->bytes_may_use
< num_bytes
);
4572 space_info
->bytes_may_use
-= num_bytes
;
4577 space_info
->bytes_readonly
+= num_bytes
;
4578 cache
->reserved
-= num_bytes
;
4579 space_info
->bytes_reserved
-= num_bytes
;
4580 space_info
->reservation_progress
++;
4582 spin_unlock(&cache
->lock
);
4583 spin_unlock(&space_info
->lock
);
4587 int btrfs_prepare_extent_commit(struct btrfs_trans_handle
*trans
,
4588 struct btrfs_root
*root
)
4590 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
4591 struct btrfs_caching_control
*next
;
4592 struct btrfs_caching_control
*caching_ctl
;
4593 struct btrfs_block_group_cache
*cache
;
4595 down_write(&fs_info
->extent_commit_sem
);
4597 list_for_each_entry_safe(caching_ctl
, next
,
4598 &fs_info
->caching_block_groups
, list
) {
4599 cache
= caching_ctl
->block_group
;
4600 if (block_group_cache_done(cache
)) {
4601 cache
->last_byte_to_unpin
= (u64
)-1;
4602 list_del_init(&caching_ctl
->list
);
4603 put_caching_control(caching_ctl
);
4605 cache
->last_byte_to_unpin
= caching_ctl
->progress
;
4609 if (fs_info
->pinned_extents
== &fs_info
->freed_extents
[0])
4610 fs_info
->pinned_extents
= &fs_info
->freed_extents
[1];
4612 fs_info
->pinned_extents
= &fs_info
->freed_extents
[0];
4614 up_write(&fs_info
->extent_commit_sem
);
4616 update_global_block_rsv(fs_info
);
4620 static int unpin_extent_range(struct btrfs_root
*root
, u64 start
, u64 end
)
4622 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
4623 struct btrfs_block_group_cache
*cache
= NULL
;
4626 while (start
<= end
) {
4628 start
>= cache
->key
.objectid
+ cache
->key
.offset
) {
4630 btrfs_put_block_group(cache
);
4631 cache
= btrfs_lookup_block_group(fs_info
, start
);
4635 len
= cache
->key
.objectid
+ cache
->key
.offset
- start
;
4636 len
= min(len
, end
+ 1 - start
);
4638 if (start
< cache
->last_byte_to_unpin
) {
4639 len
= min(len
, cache
->last_byte_to_unpin
- start
);
4640 btrfs_add_free_space(cache
, start
, len
);
4645 spin_lock(&cache
->space_info
->lock
);
4646 spin_lock(&cache
->lock
);
4647 cache
->pinned
-= len
;
4648 cache
->space_info
->bytes_pinned
-= len
;
4650 cache
->space_info
->bytes_readonly
+= len
;
4651 spin_unlock(&cache
->lock
);
4652 spin_unlock(&cache
->space_info
->lock
);
4656 btrfs_put_block_group(cache
);
4660 int btrfs_finish_extent_commit(struct btrfs_trans_handle
*trans
,
4661 struct btrfs_root
*root
)
4663 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
4664 struct extent_io_tree
*unpin
;
4669 if (fs_info
->pinned_extents
== &fs_info
->freed_extents
[0])
4670 unpin
= &fs_info
->freed_extents
[1];
4672 unpin
= &fs_info
->freed_extents
[0];
4675 ret
= find_first_extent_bit(unpin
, 0, &start
, &end
,
4680 if (btrfs_test_opt(root
, DISCARD
))
4681 ret
= btrfs_discard_extent(root
, start
,
4682 end
+ 1 - start
, NULL
);
4684 clear_extent_dirty(unpin
, start
, end
, GFP_NOFS
);
4685 unpin_extent_range(root
, start
, end
);
4692 static int __btrfs_free_extent(struct btrfs_trans_handle
*trans
,
4693 struct btrfs_root
*root
,
4694 u64 bytenr
, u64 num_bytes
, u64 parent
,
4695 u64 root_objectid
, u64 owner_objectid
,
4696 u64 owner_offset
, int refs_to_drop
,
4697 struct btrfs_delayed_extent_op
*extent_op
)
4699 struct btrfs_key key
;
4700 struct btrfs_path
*path
;
4701 struct btrfs_fs_info
*info
= root
->fs_info
;
4702 struct btrfs_root
*extent_root
= info
->extent_root
;
4703 struct extent_buffer
*leaf
;
4704 struct btrfs_extent_item
*ei
;
4705 struct btrfs_extent_inline_ref
*iref
;
4708 int extent_slot
= 0;
4709 int found_extent
= 0;
4714 path
= btrfs_alloc_path();
4719 path
->leave_spinning
= 1;
4721 is_data
= owner_objectid
>= BTRFS_FIRST_FREE_OBJECTID
;
4722 BUG_ON(!is_data
&& refs_to_drop
!= 1);
4724 ret
= lookup_extent_backref(trans
, extent_root
, path
, &iref
,
4725 bytenr
, num_bytes
, parent
,
4726 root_objectid
, owner_objectid
,
4729 extent_slot
= path
->slots
[0];
4730 while (extent_slot
>= 0) {
4731 btrfs_item_key_to_cpu(path
->nodes
[0], &key
,
4733 if (key
.objectid
!= bytenr
)
4735 if (key
.type
== BTRFS_EXTENT_ITEM_KEY
&&
4736 key
.offset
== num_bytes
) {
4740 if (path
->slots
[0] - extent_slot
> 5)
4744 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
4745 item_size
= btrfs_item_size_nr(path
->nodes
[0], extent_slot
);
4746 if (found_extent
&& item_size
< sizeof(*ei
))
4749 if (!found_extent
) {
4751 ret
= remove_extent_backref(trans
, extent_root
, path
,
4755 btrfs_release_path(path
);
4756 path
->leave_spinning
= 1;
4758 key
.objectid
= bytenr
;
4759 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
4760 key
.offset
= num_bytes
;
4762 ret
= btrfs_search_slot(trans
, extent_root
,
4765 printk(KERN_ERR
"umm, got %d back from search"
4766 ", was looking for %llu\n", ret
,
4767 (unsigned long long)bytenr
);
4769 btrfs_print_leaf(extent_root
,
4773 extent_slot
= path
->slots
[0];
4776 btrfs_print_leaf(extent_root
, path
->nodes
[0]);
4778 printk(KERN_ERR
"btrfs unable to find ref byte nr %llu "
4779 "parent %llu root %llu owner %llu offset %llu\n",
4780 (unsigned long long)bytenr
,
4781 (unsigned long long)parent
,
4782 (unsigned long long)root_objectid
,
4783 (unsigned long long)owner_objectid
,
4784 (unsigned long long)owner_offset
);
4787 leaf
= path
->nodes
[0];
4788 item_size
= btrfs_item_size_nr(leaf
, extent_slot
);
4789 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
4790 if (item_size
< sizeof(*ei
)) {
4791 BUG_ON(found_extent
|| extent_slot
!= path
->slots
[0]);
4792 ret
= convert_extent_item_v0(trans
, extent_root
, path
,
4796 btrfs_release_path(path
);
4797 path
->leave_spinning
= 1;
4799 key
.objectid
= bytenr
;
4800 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
4801 key
.offset
= num_bytes
;
4803 ret
= btrfs_search_slot(trans
, extent_root
, &key
, path
,
4806 printk(KERN_ERR
"umm, got %d back from search"
4807 ", was looking for %llu\n", ret
,
4808 (unsigned long long)bytenr
);
4809 btrfs_print_leaf(extent_root
, path
->nodes
[0]);
4812 extent_slot
= path
->slots
[0];
4813 leaf
= path
->nodes
[0];
4814 item_size
= btrfs_item_size_nr(leaf
, extent_slot
);
4817 BUG_ON(item_size
< sizeof(*ei
));
4818 ei
= btrfs_item_ptr(leaf
, extent_slot
,
4819 struct btrfs_extent_item
);
4820 if (owner_objectid
< BTRFS_FIRST_FREE_OBJECTID
) {
4821 struct btrfs_tree_block_info
*bi
;
4822 BUG_ON(item_size
< sizeof(*ei
) + sizeof(*bi
));
4823 bi
= (struct btrfs_tree_block_info
*)(ei
+ 1);
4824 WARN_ON(owner_objectid
!= btrfs_tree_block_level(leaf
, bi
));
4827 refs
= btrfs_extent_refs(leaf
, ei
);
4828 BUG_ON(refs
< refs_to_drop
);
4829 refs
-= refs_to_drop
;
4833 __run_delayed_extent_op(extent_op
, leaf
, ei
);
4835 * In the case of inline back ref, reference count will
4836 * be updated by remove_extent_backref
4839 BUG_ON(!found_extent
);
4841 btrfs_set_extent_refs(leaf
, ei
, refs
);
4842 btrfs_mark_buffer_dirty(leaf
);
4845 ret
= remove_extent_backref(trans
, extent_root
, path
,
4852 BUG_ON(is_data
&& refs_to_drop
!=
4853 extent_data_ref_count(root
, path
, iref
));
4855 BUG_ON(path
->slots
[0] != extent_slot
);
4857 BUG_ON(path
->slots
[0] != extent_slot
+ 1);
4858 path
->slots
[0] = extent_slot
;
4863 ret
= btrfs_del_items(trans
, extent_root
, path
, path
->slots
[0],
4866 btrfs_release_path(path
);
4869 ret
= btrfs_del_csums(trans
, root
, bytenr
, num_bytes
);
4872 invalidate_mapping_pages(info
->btree_inode
->i_mapping
,
4873 bytenr
>> PAGE_CACHE_SHIFT
,
4874 (bytenr
+ num_bytes
- 1) >> PAGE_CACHE_SHIFT
);
4877 ret
= update_block_group(trans
, root
, bytenr
, num_bytes
, 0);
4880 btrfs_free_path(path
);
4885 * when we free an block, it is possible (and likely) that we free the last
4886 * delayed ref for that extent as well. This searches the delayed ref tree for
4887 * a given extent, and if there are no other delayed refs to be processed, it
4888 * removes it from the tree.
4890 static noinline
int check_ref_cleanup(struct btrfs_trans_handle
*trans
,
4891 struct btrfs_root
*root
, u64 bytenr
)
4893 struct btrfs_delayed_ref_head
*head
;
4894 struct btrfs_delayed_ref_root
*delayed_refs
;
4895 struct btrfs_delayed_ref_node
*ref
;
4896 struct rb_node
*node
;
4899 delayed_refs
= &trans
->transaction
->delayed_refs
;
4900 spin_lock(&delayed_refs
->lock
);
4901 head
= btrfs_find_delayed_ref_head(trans
, bytenr
);
4905 node
= rb_prev(&head
->node
.rb_node
);
4909 ref
= rb_entry(node
, struct btrfs_delayed_ref_node
, rb_node
);
4911 /* there are still entries for this ref, we can't drop it */
4912 if (ref
->bytenr
== bytenr
)
4915 if (head
->extent_op
) {
4916 if (!head
->must_insert_reserved
)
4918 kfree(head
->extent_op
);
4919 head
->extent_op
= NULL
;
4923 * waiting for the lock here would deadlock. If someone else has it
4924 * locked they are already in the process of dropping it anyway
4926 if (!mutex_trylock(&head
->mutex
))
4930 * at this point we have a head with no other entries. Go
4931 * ahead and process it.
4933 head
->node
.in_tree
= 0;
4934 rb_erase(&head
->node
.rb_node
, &delayed_refs
->root
);
4936 delayed_refs
->num_entries
--;
4939 * we don't take a ref on the node because we're removing it from the
4940 * tree, so we just steal the ref the tree was holding.
4942 delayed_refs
->num_heads
--;
4943 if (list_empty(&head
->cluster
))
4944 delayed_refs
->num_heads_ready
--;
4946 list_del_init(&head
->cluster
);
4947 spin_unlock(&delayed_refs
->lock
);
4949 BUG_ON(head
->extent_op
);
4950 if (head
->must_insert_reserved
)
4953 mutex_unlock(&head
->mutex
);
4954 btrfs_put_delayed_ref(&head
->node
);
4957 spin_unlock(&delayed_refs
->lock
);
4961 void btrfs_free_tree_block(struct btrfs_trans_handle
*trans
,
4962 struct btrfs_root
*root
,
4963 struct extent_buffer
*buf
,
4964 u64 parent
, int last_ref
)
4966 struct btrfs_block_group_cache
*cache
= NULL
;
4969 if (root
->root_key
.objectid
!= BTRFS_TREE_LOG_OBJECTID
) {
4970 ret
= btrfs_add_delayed_tree_ref(trans
, buf
->start
, buf
->len
,
4971 parent
, root
->root_key
.objectid
,
4972 btrfs_header_level(buf
),
4973 BTRFS_DROP_DELAYED_REF
, NULL
);
4980 cache
= btrfs_lookup_block_group(root
->fs_info
, buf
->start
);
4982 if (btrfs_header_generation(buf
) == trans
->transid
) {
4983 if (root
->root_key
.objectid
!= BTRFS_TREE_LOG_OBJECTID
) {
4984 ret
= check_ref_cleanup(trans
, root
, buf
->start
);
4989 if (btrfs_header_flag(buf
, BTRFS_HEADER_FLAG_WRITTEN
)) {
4990 pin_down_extent(root
, cache
, buf
->start
, buf
->len
, 1);
4994 WARN_ON(test_bit(EXTENT_BUFFER_DIRTY
, &buf
->bflags
));
4996 btrfs_add_free_space(cache
, buf
->start
, buf
->len
);
4997 btrfs_update_reserved_bytes(cache
, buf
->len
, RESERVE_FREE
);
5001 * Deleting the buffer, clear the corrupt flag since it doesn't matter
5004 clear_bit(EXTENT_BUFFER_CORRUPT
, &buf
->bflags
);
5005 btrfs_put_block_group(cache
);
5008 int btrfs_free_extent(struct btrfs_trans_handle
*trans
,
5009 struct btrfs_root
*root
,
5010 u64 bytenr
, u64 num_bytes
, u64 parent
,
5011 u64 root_objectid
, u64 owner
, u64 offset
)
5016 * tree log blocks never actually go into the extent allocation
5017 * tree, just update pinning info and exit early.
5019 if (root_objectid
== BTRFS_TREE_LOG_OBJECTID
) {
5020 WARN_ON(owner
>= BTRFS_FIRST_FREE_OBJECTID
);
5021 /* unlocks the pinned mutex */
5022 btrfs_pin_extent(root
, bytenr
, num_bytes
, 1);
5024 } else if (owner
< BTRFS_FIRST_FREE_OBJECTID
) {
5025 ret
= btrfs_add_delayed_tree_ref(trans
, bytenr
, num_bytes
,
5026 parent
, root_objectid
, (int)owner
,
5027 BTRFS_DROP_DELAYED_REF
, NULL
);
5030 ret
= btrfs_add_delayed_data_ref(trans
, bytenr
, num_bytes
,
5031 parent
, root_objectid
, owner
,
5032 offset
, BTRFS_DROP_DELAYED_REF
, NULL
);
5038 static u64
stripe_align(struct btrfs_root
*root
, u64 val
)
5040 u64 mask
= ((u64
)root
->stripesize
- 1);
5041 u64 ret
= (val
+ mask
) & ~mask
;
5046 * when we wait for progress in the block group caching, its because
5047 * our allocation attempt failed at least once. So, we must sleep
5048 * and let some progress happen before we try again.
5050 * This function will sleep at least once waiting for new free space to
5051 * show up, and then it will check the block group free space numbers
5052 * for our min num_bytes. Another option is to have it go ahead
5053 * and look in the rbtree for a free extent of a given size, but this
5057 wait_block_group_cache_progress(struct btrfs_block_group_cache
*cache
,
5060 struct btrfs_caching_control
*caching_ctl
;
5063 caching_ctl
= get_caching_control(cache
);
5067 wait_event(caching_ctl
->wait
, block_group_cache_done(cache
) ||
5068 (cache
->free_space_ctl
->free_space
>= num_bytes
));
5070 put_caching_control(caching_ctl
);
5075 wait_block_group_cache_done(struct btrfs_block_group_cache
*cache
)
5077 struct btrfs_caching_control
*caching_ctl
;
5080 caching_ctl
= get_caching_control(cache
);
5084 wait_event(caching_ctl
->wait
, block_group_cache_done(cache
));
5086 put_caching_control(caching_ctl
);
5090 static int get_block_group_index(struct btrfs_block_group_cache
*cache
)
5093 if (cache
->flags
& BTRFS_BLOCK_GROUP_RAID10
)
5095 else if (cache
->flags
& BTRFS_BLOCK_GROUP_RAID1
)
5097 else if (cache
->flags
& BTRFS_BLOCK_GROUP_DUP
)
5099 else if (cache
->flags
& BTRFS_BLOCK_GROUP_RAID0
)
5106 enum btrfs_loop_type
{
5107 LOOP_FIND_IDEAL
= 0,
5108 LOOP_CACHING_NOWAIT
= 1,
5109 LOOP_CACHING_WAIT
= 2,
5110 LOOP_ALLOC_CHUNK
= 3,
5111 LOOP_NO_EMPTY_SIZE
= 4,
5115 * walks the btree of allocated extents and find a hole of a given size.
5116 * The key ins is changed to record the hole:
5117 * ins->objectid == block start
5118 * ins->flags = BTRFS_EXTENT_ITEM_KEY
5119 * ins->offset == number of blocks
5120 * Any available blocks before search_start are skipped.
5122 static noinline
int find_free_extent(struct btrfs_trans_handle
*trans
,
5123 struct btrfs_root
*orig_root
,
5124 u64 num_bytes
, u64 empty_size
,
5125 u64 search_start
, u64 search_end
,
5126 u64 hint_byte
, struct btrfs_key
*ins
,
5130 struct btrfs_root
*root
= orig_root
->fs_info
->extent_root
;
5131 struct btrfs_free_cluster
*last_ptr
= NULL
;
5132 struct btrfs_block_group_cache
*block_group
= NULL
;
5133 struct btrfs_block_group_cache
*used_block_group
;
5134 int empty_cluster
= 2 * 1024 * 1024;
5135 int allowed_chunk_alloc
= 0;
5136 int done_chunk_alloc
= 0;
5137 struct btrfs_space_info
*space_info
;
5140 int alloc_type
= (data
& BTRFS_BLOCK_GROUP_DATA
) ?
5141 RESERVE_ALLOC_NO_ACCOUNT
: RESERVE_ALLOC
;
5142 bool found_uncached_bg
= false;
5143 bool failed_cluster_refill
= false;
5144 bool failed_alloc
= false;
5145 bool use_cluster
= true;
5146 bool have_caching_bg
= false;
5147 u64 ideal_cache_percent
= 0;
5148 u64 ideal_cache_offset
= 0;
5150 WARN_ON(num_bytes
< root
->sectorsize
);
5151 btrfs_set_key_type(ins
, BTRFS_EXTENT_ITEM_KEY
);
5155 space_info
= __find_space_info(root
->fs_info
, data
);
5157 printk(KERN_ERR
"No space info for %llu\n", data
);
5162 * If the space info is for both data and metadata it means we have a
5163 * small filesystem and we can't use the clustering stuff.
5165 if (btrfs_mixed_space_info(space_info
))
5166 use_cluster
= false;
5168 if (orig_root
->ref_cows
|| empty_size
)
5169 allowed_chunk_alloc
= 1;
5171 if (data
& BTRFS_BLOCK_GROUP_METADATA
&& use_cluster
) {
5172 last_ptr
= &root
->fs_info
->meta_alloc_cluster
;
5173 if (!btrfs_test_opt(root
, SSD
))
5174 empty_cluster
= 64 * 1024;
5177 if ((data
& BTRFS_BLOCK_GROUP_DATA
) && use_cluster
&&
5178 btrfs_test_opt(root
, SSD
)) {
5179 last_ptr
= &root
->fs_info
->data_alloc_cluster
;
5183 spin_lock(&last_ptr
->lock
);
5184 if (last_ptr
->block_group
)
5185 hint_byte
= last_ptr
->window_start
;
5186 spin_unlock(&last_ptr
->lock
);
5189 search_start
= max(search_start
, first_logical_byte(root
, 0));
5190 search_start
= max(search_start
, hint_byte
);
5195 if (search_start
== hint_byte
) {
5197 block_group
= btrfs_lookup_block_group(root
->fs_info
,
5199 used_block_group
= block_group
;
5201 * we don't want to use the block group if it doesn't match our
5202 * allocation bits, or if its not cached.
5204 * However if we are re-searching with an ideal block group
5205 * picked out then we don't care that the block group is cached.
5207 if (block_group
&& block_group_bits(block_group
, data
) &&
5208 (block_group
->cached
!= BTRFS_CACHE_NO
||
5209 search_start
== ideal_cache_offset
)) {
5210 down_read(&space_info
->groups_sem
);
5211 if (list_empty(&block_group
->list
) ||
5214 * someone is removing this block group,
5215 * we can't jump into the have_block_group
5216 * target because our list pointers are not
5219 btrfs_put_block_group(block_group
);
5220 up_read(&space_info
->groups_sem
);
5222 index
= get_block_group_index(block_group
);
5223 goto have_block_group
;
5225 } else if (block_group
) {
5226 btrfs_put_block_group(block_group
);
5230 have_caching_bg
= false;
5231 down_read(&space_info
->groups_sem
);
5232 list_for_each_entry(block_group
, &space_info
->block_groups
[index
],
5237 used_block_group
= block_group
;
5238 btrfs_get_block_group(block_group
);
5239 search_start
= block_group
->key
.objectid
;
5242 * this can happen if we end up cycling through all the
5243 * raid types, but we want to make sure we only allocate
5244 * for the proper type.
5246 if (!block_group_bits(block_group
, data
)) {
5247 u64 extra
= BTRFS_BLOCK_GROUP_DUP
|
5248 BTRFS_BLOCK_GROUP_RAID1
|
5249 BTRFS_BLOCK_GROUP_RAID10
;
5252 * if they asked for extra copies and this block group
5253 * doesn't provide them, bail. This does allow us to
5254 * fill raid0 from raid1.
5256 if ((data
& extra
) && !(block_group
->flags
& extra
))
5261 cached
= block_group_cache_done(block_group
);
5262 if (unlikely(!cached
)) {
5265 found_uncached_bg
= true;
5266 ret
= cache_block_group(block_group
, trans
,
5268 if (block_group
->cached
== BTRFS_CACHE_FINISHED
)
5271 free_percent
= btrfs_block_group_used(&block_group
->item
);
5272 free_percent
*= 100;
5273 free_percent
= div64_u64(free_percent
,
5274 block_group
->key
.offset
);
5275 free_percent
= 100 - free_percent
;
5276 if (free_percent
> ideal_cache_percent
&&
5277 likely(!block_group
->ro
)) {
5278 ideal_cache_offset
= block_group
->key
.objectid
;
5279 ideal_cache_percent
= free_percent
;
5283 * The caching workers are limited to 2 threads, so we
5284 * can queue as much work as we care to.
5286 if (loop
> LOOP_FIND_IDEAL
) {
5287 ret
= cache_block_group(block_group
, trans
,
5293 * If loop is set for cached only, try the next block
5296 if (loop
== LOOP_FIND_IDEAL
)
5301 if (unlikely(block_group
->ro
))
5304 spin_lock(&block_group
->free_space_ctl
->tree_lock
);
5306 block_group
->free_space_ctl
->free_space
<
5307 num_bytes
+ empty_cluster
+ empty_size
) {
5308 spin_unlock(&block_group
->free_space_ctl
->tree_lock
);
5311 spin_unlock(&block_group
->free_space_ctl
->tree_lock
);
5314 * Ok we want to try and use the cluster allocator, so
5319 * the refill lock keeps out other
5320 * people trying to start a new cluster
5322 spin_lock(&last_ptr
->refill_lock
);
5323 used_block_group
= last_ptr
->block_group
;
5324 if (used_block_group
!= block_group
&&
5325 (!used_block_group
||
5326 used_block_group
->ro
||
5327 !block_group_bits(used_block_group
, data
))) {
5328 used_block_group
= block_group
;
5329 goto refill_cluster
;
5332 if (used_block_group
!= block_group
)
5333 btrfs_get_block_group(used_block_group
);
5335 offset
= btrfs_alloc_from_cluster(used_block_group
,
5336 last_ptr
, num_bytes
, used_block_group
->key
.objectid
);
5338 /* we have a block, we're done */
5339 spin_unlock(&last_ptr
->refill_lock
);
5343 WARN_ON(last_ptr
->block_group
!= used_block_group
);
5344 if (used_block_group
!= block_group
) {
5345 btrfs_put_block_group(used_block_group
);
5346 used_block_group
= block_group
;
5349 BUG_ON(used_block_group
!= block_group
);
5350 /* If we are on LOOP_NO_EMPTY_SIZE, we can't
5351 * set up a new clusters, so lets just skip it
5352 * and let the allocator find whatever block
5353 * it can find. If we reach this point, we
5354 * will have tried the cluster allocator
5355 * plenty of times and not have found
5356 * anything, so we are likely way too
5357 * fragmented for the clustering stuff to find
5359 if (loop
>= LOOP_NO_EMPTY_SIZE
) {
5360 spin_unlock(&last_ptr
->refill_lock
);
5361 goto unclustered_alloc
;
5365 * this cluster didn't work out, free it and
5368 btrfs_return_cluster_to_free_space(NULL
, last_ptr
);
5370 /* allocate a cluster in this block group */
5371 ret
= btrfs_find_space_cluster(trans
, root
,
5372 block_group
, last_ptr
,
5373 search_start
, num_bytes
,
5374 empty_cluster
+ empty_size
);
5377 * now pull our allocation out of this
5380 offset
= btrfs_alloc_from_cluster(block_group
,
5381 last_ptr
, num_bytes
,
5384 /* we found one, proceed */
5385 spin_unlock(&last_ptr
->refill_lock
);
5388 } else if (!cached
&& loop
> LOOP_CACHING_NOWAIT
5389 && !failed_cluster_refill
) {
5390 spin_unlock(&last_ptr
->refill_lock
);
5392 failed_cluster_refill
= true;
5393 wait_block_group_cache_progress(block_group
,
5394 num_bytes
+ empty_cluster
+ empty_size
);
5395 goto have_block_group
;
5399 * at this point we either didn't find a cluster
5400 * or we weren't able to allocate a block from our
5401 * cluster. Free the cluster we've been trying
5402 * to use, and go to the next block group
5404 btrfs_return_cluster_to_free_space(NULL
, last_ptr
);
5405 spin_unlock(&last_ptr
->refill_lock
);
5410 offset
= btrfs_find_space_for_alloc(block_group
, search_start
,
5411 num_bytes
, empty_size
);
5413 * If we didn't find a chunk, and we haven't failed on this
5414 * block group before, and this block group is in the middle of
5415 * caching and we are ok with waiting, then go ahead and wait
5416 * for progress to be made, and set failed_alloc to true.
5418 * If failed_alloc is true then we've already waited on this
5419 * block group once and should move on to the next block group.
5421 if (!offset
&& !failed_alloc
&& !cached
&&
5422 loop
> LOOP_CACHING_NOWAIT
) {
5423 wait_block_group_cache_progress(block_group
,
5424 num_bytes
+ empty_size
);
5425 failed_alloc
= true;
5426 goto have_block_group
;
5427 } else if (!offset
) {
5429 have_caching_bg
= true;
5433 search_start
= stripe_align(root
, offset
);
5434 /* move on to the next group */
5435 if (search_start
+ num_bytes
>= search_end
) {
5436 btrfs_add_free_space(used_block_group
, offset
, num_bytes
);
5440 /* move on to the next group */
5441 if (search_start
+ num_bytes
>
5442 used_block_group
->key
.objectid
+ used_block_group
->key
.offset
) {
5443 btrfs_add_free_space(used_block_group
, offset
, num_bytes
);
5447 ins
->objectid
= search_start
;
5448 ins
->offset
= num_bytes
;
5450 if (offset
< search_start
)
5451 btrfs_add_free_space(used_block_group
, offset
,
5452 search_start
- offset
);
5453 BUG_ON(offset
> search_start
);
5455 ret
= btrfs_update_reserved_bytes(used_block_group
, num_bytes
,
5457 if (ret
== -EAGAIN
) {
5458 btrfs_add_free_space(used_block_group
, offset
, num_bytes
);
5462 /* we are all good, lets return */
5463 ins
->objectid
= search_start
;
5464 ins
->offset
= num_bytes
;
5466 if (offset
< search_start
)
5467 btrfs_add_free_space(used_block_group
, offset
,
5468 search_start
- offset
);
5469 BUG_ON(offset
> search_start
);
5470 if (used_block_group
!= block_group
)
5471 btrfs_put_block_group(used_block_group
);
5472 btrfs_put_block_group(block_group
);
5475 failed_cluster_refill
= false;
5476 failed_alloc
= false;
5477 BUG_ON(index
!= get_block_group_index(block_group
));
5478 if (used_block_group
!= block_group
)
5479 btrfs_put_block_group(used_block_group
);
5480 btrfs_put_block_group(block_group
);
5482 up_read(&space_info
->groups_sem
);
5484 if (!ins
->objectid
&& loop
>= LOOP_CACHING_WAIT
&& have_caching_bg
)
5487 if (!ins
->objectid
&& ++index
< BTRFS_NR_RAID_TYPES
)
5490 /* LOOP_FIND_IDEAL, only search caching/cached bg's, and don't wait for
5491 * for them to make caching progress. Also
5492 * determine the best possible bg to cache
5493 * LOOP_CACHING_NOWAIT, search partially cached block groups, kicking
5494 * caching kthreads as we move along
5495 * LOOP_CACHING_WAIT, search everything, and wait if our bg is caching
5496 * LOOP_ALLOC_CHUNK, force a chunk allocation and try again
5497 * LOOP_NO_EMPTY_SIZE, set empty_size and empty_cluster to 0 and try
5500 if (!ins
->objectid
&& loop
< LOOP_NO_EMPTY_SIZE
) {
5502 if (loop
== LOOP_FIND_IDEAL
&& found_uncached_bg
) {
5503 found_uncached_bg
= false;
5505 if (!ideal_cache_percent
)
5509 * 1 of the following 2 things have happened so far
5511 * 1) We found an ideal block group for caching that
5512 * is mostly full and will cache quickly, so we might
5513 * as well wait for it.
5515 * 2) We searched for cached only and we didn't find
5516 * anything, and we didn't start any caching kthreads
5517 * either, so chances are we will loop through and
5518 * start a couple caching kthreads, and then come back
5519 * around and just wait for them. This will be slower
5520 * because we will have 2 caching kthreads reading at
5521 * the same time when we could have just started one
5522 * and waited for it to get far enough to give us an
5523 * allocation, so go ahead and go to the wait caching
5526 loop
= LOOP_CACHING_WAIT
;
5527 search_start
= ideal_cache_offset
;
5528 ideal_cache_percent
= 0;
5530 } else if (loop
== LOOP_FIND_IDEAL
) {
5532 * Didn't find a uncached bg, wait on anything we find
5535 loop
= LOOP_CACHING_WAIT
;
5541 if (loop
== LOOP_ALLOC_CHUNK
) {
5542 if (allowed_chunk_alloc
) {
5543 ret
= do_chunk_alloc(trans
, root
, num_bytes
+
5544 2 * 1024 * 1024, data
,
5545 CHUNK_ALLOC_LIMITED
);
5546 allowed_chunk_alloc
= 0;
5548 done_chunk_alloc
= 1;
5549 } else if (!done_chunk_alloc
&&
5550 space_info
->force_alloc
==
5551 CHUNK_ALLOC_NO_FORCE
) {
5552 space_info
->force_alloc
= CHUNK_ALLOC_LIMITED
;
5556 * We didn't allocate a chunk, go ahead and drop the
5557 * empty size and loop again.
5559 if (!done_chunk_alloc
)
5560 loop
= LOOP_NO_EMPTY_SIZE
;
5563 if (loop
== LOOP_NO_EMPTY_SIZE
) {
5569 } else if (!ins
->objectid
) {
5571 } else if (ins
->objectid
) {
5578 static void dump_space_info(struct btrfs_space_info
*info
, u64 bytes
,
5579 int dump_block_groups
)
5581 struct btrfs_block_group_cache
*cache
;
5584 spin_lock(&info
->lock
);
5585 printk(KERN_INFO
"space_info %llu has %llu free, is %sfull\n",
5586 (unsigned long long)info
->flags
,
5587 (unsigned long long)(info
->total_bytes
- info
->bytes_used
-
5588 info
->bytes_pinned
- info
->bytes_reserved
-
5589 info
->bytes_readonly
),
5590 (info
->full
) ? "" : "not ");
5591 printk(KERN_INFO
"space_info total=%llu, used=%llu, pinned=%llu, "
5592 "reserved=%llu, may_use=%llu, readonly=%llu\n",
5593 (unsigned long long)info
->total_bytes
,
5594 (unsigned long long)info
->bytes_used
,
5595 (unsigned long long)info
->bytes_pinned
,
5596 (unsigned long long)info
->bytes_reserved
,
5597 (unsigned long long)info
->bytes_may_use
,
5598 (unsigned long long)info
->bytes_readonly
);
5599 spin_unlock(&info
->lock
);
5601 if (!dump_block_groups
)
5604 down_read(&info
->groups_sem
);
5606 list_for_each_entry(cache
, &info
->block_groups
[index
], list
) {
5607 spin_lock(&cache
->lock
);
5608 printk(KERN_INFO
"block group %llu has %llu bytes, %llu used "
5609 "%llu pinned %llu reserved\n",
5610 (unsigned long long)cache
->key
.objectid
,
5611 (unsigned long long)cache
->key
.offset
,
5612 (unsigned long long)btrfs_block_group_used(&cache
->item
),
5613 (unsigned long long)cache
->pinned
,
5614 (unsigned long long)cache
->reserved
);
5615 btrfs_dump_free_space(cache
, bytes
);
5616 spin_unlock(&cache
->lock
);
5618 if (++index
< BTRFS_NR_RAID_TYPES
)
5620 up_read(&info
->groups_sem
);
5623 int btrfs_reserve_extent(struct btrfs_trans_handle
*trans
,
5624 struct btrfs_root
*root
,
5625 u64 num_bytes
, u64 min_alloc_size
,
5626 u64 empty_size
, u64 hint_byte
,
5627 u64 search_end
, struct btrfs_key
*ins
,
5631 u64 search_start
= 0;
5633 data
= btrfs_get_alloc_profile(root
, data
);
5636 * the only place that sets empty_size is btrfs_realloc_node, which
5637 * is not called recursively on allocations
5639 if (empty_size
|| root
->ref_cows
)
5640 ret
= do_chunk_alloc(trans
, root
->fs_info
->extent_root
,
5641 num_bytes
+ 2 * 1024 * 1024, data
,
5642 CHUNK_ALLOC_NO_FORCE
);
5644 WARN_ON(num_bytes
< root
->sectorsize
);
5645 ret
= find_free_extent(trans
, root
, num_bytes
, empty_size
,
5646 search_start
, search_end
, hint_byte
,
5649 if (ret
== -ENOSPC
&& num_bytes
> min_alloc_size
) {
5650 num_bytes
= num_bytes
>> 1;
5651 num_bytes
= num_bytes
& ~(root
->sectorsize
- 1);
5652 num_bytes
= max(num_bytes
, min_alloc_size
);
5653 do_chunk_alloc(trans
, root
->fs_info
->extent_root
,
5654 num_bytes
, data
, CHUNK_ALLOC_FORCE
);
5657 if (ret
== -ENOSPC
&& btrfs_test_opt(root
, ENOSPC_DEBUG
)) {
5658 struct btrfs_space_info
*sinfo
;
5660 sinfo
= __find_space_info(root
->fs_info
, data
);
5661 printk(KERN_ERR
"btrfs allocation failed flags %llu, "
5662 "wanted %llu\n", (unsigned long long)data
,
5663 (unsigned long long)num_bytes
);
5664 dump_space_info(sinfo
, num_bytes
, 1);
5667 trace_btrfs_reserved_extent_alloc(root
, ins
->objectid
, ins
->offset
);
5672 static int __btrfs_free_reserved_extent(struct btrfs_root
*root
,
5673 u64 start
, u64 len
, int pin
)
5675 struct btrfs_block_group_cache
*cache
;
5678 cache
= btrfs_lookup_block_group(root
->fs_info
, start
);
5680 printk(KERN_ERR
"Unable to find block group for %llu\n",
5681 (unsigned long long)start
);
5685 if (btrfs_test_opt(root
, DISCARD
))
5686 ret
= btrfs_discard_extent(root
, start
, len
, NULL
);
5689 pin_down_extent(root
, cache
, start
, len
, 1);
5691 btrfs_add_free_space(cache
, start
, len
);
5692 btrfs_update_reserved_bytes(cache
, len
, RESERVE_FREE
);
5694 btrfs_put_block_group(cache
);
5696 trace_btrfs_reserved_extent_free(root
, start
, len
);
5701 int btrfs_free_reserved_extent(struct btrfs_root
*root
,
5704 return __btrfs_free_reserved_extent(root
, start
, len
, 0);
5707 int btrfs_free_and_pin_reserved_extent(struct btrfs_root
*root
,
5710 return __btrfs_free_reserved_extent(root
, start
, len
, 1);
5713 static int alloc_reserved_file_extent(struct btrfs_trans_handle
*trans
,
5714 struct btrfs_root
*root
,
5715 u64 parent
, u64 root_objectid
,
5716 u64 flags
, u64 owner
, u64 offset
,
5717 struct btrfs_key
*ins
, int ref_mod
)
5720 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
5721 struct btrfs_extent_item
*extent_item
;
5722 struct btrfs_extent_inline_ref
*iref
;
5723 struct btrfs_path
*path
;
5724 struct extent_buffer
*leaf
;
5729 type
= BTRFS_SHARED_DATA_REF_KEY
;
5731 type
= BTRFS_EXTENT_DATA_REF_KEY
;
5733 size
= sizeof(*extent_item
) + btrfs_extent_inline_ref_size(type
);
5735 path
= btrfs_alloc_path();
5739 path
->leave_spinning
= 1;
5740 ret
= btrfs_insert_empty_item(trans
, fs_info
->extent_root
, path
,
5744 leaf
= path
->nodes
[0];
5745 extent_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
5746 struct btrfs_extent_item
);
5747 btrfs_set_extent_refs(leaf
, extent_item
, ref_mod
);
5748 btrfs_set_extent_generation(leaf
, extent_item
, trans
->transid
);
5749 btrfs_set_extent_flags(leaf
, extent_item
,
5750 flags
| BTRFS_EXTENT_FLAG_DATA
);
5752 iref
= (struct btrfs_extent_inline_ref
*)(extent_item
+ 1);
5753 btrfs_set_extent_inline_ref_type(leaf
, iref
, type
);
5755 struct btrfs_shared_data_ref
*ref
;
5756 ref
= (struct btrfs_shared_data_ref
*)(iref
+ 1);
5757 btrfs_set_extent_inline_ref_offset(leaf
, iref
, parent
);
5758 btrfs_set_shared_data_ref_count(leaf
, ref
, ref_mod
);
5760 struct btrfs_extent_data_ref
*ref
;
5761 ref
= (struct btrfs_extent_data_ref
*)(&iref
->offset
);
5762 btrfs_set_extent_data_ref_root(leaf
, ref
, root_objectid
);
5763 btrfs_set_extent_data_ref_objectid(leaf
, ref
, owner
);
5764 btrfs_set_extent_data_ref_offset(leaf
, ref
, offset
);
5765 btrfs_set_extent_data_ref_count(leaf
, ref
, ref_mod
);
5768 btrfs_mark_buffer_dirty(path
->nodes
[0]);
5769 btrfs_free_path(path
);
5771 ret
= update_block_group(trans
, root
, ins
->objectid
, ins
->offset
, 1);
5773 printk(KERN_ERR
"btrfs update block group failed for %llu "
5774 "%llu\n", (unsigned long long)ins
->objectid
,
5775 (unsigned long long)ins
->offset
);
5781 static int alloc_reserved_tree_block(struct btrfs_trans_handle
*trans
,
5782 struct btrfs_root
*root
,
5783 u64 parent
, u64 root_objectid
,
5784 u64 flags
, struct btrfs_disk_key
*key
,
5785 int level
, struct btrfs_key
*ins
)
5788 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
5789 struct btrfs_extent_item
*extent_item
;
5790 struct btrfs_tree_block_info
*block_info
;
5791 struct btrfs_extent_inline_ref
*iref
;
5792 struct btrfs_path
*path
;
5793 struct extent_buffer
*leaf
;
5794 u32 size
= sizeof(*extent_item
) + sizeof(*block_info
) + sizeof(*iref
);
5796 path
= btrfs_alloc_path();
5800 path
->leave_spinning
= 1;
5801 ret
= btrfs_insert_empty_item(trans
, fs_info
->extent_root
, path
,
5805 leaf
= path
->nodes
[0];
5806 extent_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
5807 struct btrfs_extent_item
);
5808 btrfs_set_extent_refs(leaf
, extent_item
, 1);
5809 btrfs_set_extent_generation(leaf
, extent_item
, trans
->transid
);
5810 btrfs_set_extent_flags(leaf
, extent_item
,
5811 flags
| BTRFS_EXTENT_FLAG_TREE_BLOCK
);
5812 block_info
= (struct btrfs_tree_block_info
*)(extent_item
+ 1);
5814 btrfs_set_tree_block_key(leaf
, block_info
, key
);
5815 btrfs_set_tree_block_level(leaf
, block_info
, level
);
5817 iref
= (struct btrfs_extent_inline_ref
*)(block_info
+ 1);
5819 BUG_ON(!(flags
& BTRFS_BLOCK_FLAG_FULL_BACKREF
));
5820 btrfs_set_extent_inline_ref_type(leaf
, iref
,
5821 BTRFS_SHARED_BLOCK_REF_KEY
);
5822 btrfs_set_extent_inline_ref_offset(leaf
, iref
, parent
);
5824 btrfs_set_extent_inline_ref_type(leaf
, iref
,
5825 BTRFS_TREE_BLOCK_REF_KEY
);
5826 btrfs_set_extent_inline_ref_offset(leaf
, iref
, root_objectid
);
5829 btrfs_mark_buffer_dirty(leaf
);
5830 btrfs_free_path(path
);
5832 ret
= update_block_group(trans
, root
, ins
->objectid
, ins
->offset
, 1);
5834 printk(KERN_ERR
"btrfs update block group failed for %llu "
5835 "%llu\n", (unsigned long long)ins
->objectid
,
5836 (unsigned long long)ins
->offset
);
5842 int btrfs_alloc_reserved_file_extent(struct btrfs_trans_handle
*trans
,
5843 struct btrfs_root
*root
,
5844 u64 root_objectid
, u64 owner
,
5845 u64 offset
, struct btrfs_key
*ins
)
5849 BUG_ON(root_objectid
== BTRFS_TREE_LOG_OBJECTID
);
5851 ret
= btrfs_add_delayed_data_ref(trans
, ins
->objectid
, ins
->offset
,
5852 0, root_objectid
, owner
, offset
,
5853 BTRFS_ADD_DELAYED_EXTENT
, NULL
);
5858 * this is used by the tree logging recovery code. It records that
5859 * an extent has been allocated and makes sure to clear the free
5860 * space cache bits as well
5862 int btrfs_alloc_logged_file_extent(struct btrfs_trans_handle
*trans
,
5863 struct btrfs_root
*root
,
5864 u64 root_objectid
, u64 owner
, u64 offset
,
5865 struct btrfs_key
*ins
)
5868 struct btrfs_block_group_cache
*block_group
;
5869 struct btrfs_caching_control
*caching_ctl
;
5870 u64 start
= ins
->objectid
;
5871 u64 num_bytes
= ins
->offset
;
5873 block_group
= btrfs_lookup_block_group(root
->fs_info
, ins
->objectid
);
5874 cache_block_group(block_group
, trans
, NULL
, 0);
5875 caching_ctl
= get_caching_control(block_group
);
5878 BUG_ON(!block_group_cache_done(block_group
));
5879 ret
= btrfs_remove_free_space(block_group
, start
, num_bytes
);
5882 mutex_lock(&caching_ctl
->mutex
);
5884 if (start
>= caching_ctl
->progress
) {
5885 ret
= add_excluded_extent(root
, start
, num_bytes
);
5887 } else if (start
+ num_bytes
<= caching_ctl
->progress
) {
5888 ret
= btrfs_remove_free_space(block_group
,
5892 num_bytes
= caching_ctl
->progress
- start
;
5893 ret
= btrfs_remove_free_space(block_group
,
5897 start
= caching_ctl
->progress
;
5898 num_bytes
= ins
->objectid
+ ins
->offset
-
5899 caching_ctl
->progress
;
5900 ret
= add_excluded_extent(root
, start
, num_bytes
);
5904 mutex_unlock(&caching_ctl
->mutex
);
5905 put_caching_control(caching_ctl
);
5908 ret
= btrfs_update_reserved_bytes(block_group
, ins
->offset
,
5909 RESERVE_ALLOC_NO_ACCOUNT
);
5911 btrfs_put_block_group(block_group
);
5912 ret
= alloc_reserved_file_extent(trans
, root
, 0, root_objectid
,
5913 0, owner
, offset
, ins
, 1);
5917 struct extent_buffer
*btrfs_init_new_buffer(struct btrfs_trans_handle
*trans
,
5918 struct btrfs_root
*root
,
5919 u64 bytenr
, u32 blocksize
,
5922 struct extent_buffer
*buf
;
5924 buf
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
5926 return ERR_PTR(-ENOMEM
);
5927 btrfs_set_header_generation(buf
, trans
->transid
);
5928 btrfs_set_buffer_lockdep_class(root
->root_key
.objectid
, buf
, level
);
5929 btrfs_tree_lock(buf
);
5930 clean_tree_block(trans
, root
, buf
);
5932 btrfs_set_lock_blocking(buf
);
5933 btrfs_set_buffer_uptodate(buf
);
5935 if (root
->root_key
.objectid
== BTRFS_TREE_LOG_OBJECTID
) {
5937 * we allow two log transactions at a time, use different
5938 * EXENT bit to differentiate dirty pages.
5940 if (root
->log_transid
% 2 == 0)
5941 set_extent_dirty(&root
->dirty_log_pages
, buf
->start
,
5942 buf
->start
+ buf
->len
- 1, GFP_NOFS
);
5944 set_extent_new(&root
->dirty_log_pages
, buf
->start
,
5945 buf
->start
+ buf
->len
- 1, GFP_NOFS
);
5947 set_extent_dirty(&trans
->transaction
->dirty_pages
, buf
->start
,
5948 buf
->start
+ buf
->len
- 1, GFP_NOFS
);
5950 trans
->blocks_used
++;
5951 /* this returns a buffer locked for blocking */
5955 static struct btrfs_block_rsv
*
5956 use_block_rsv(struct btrfs_trans_handle
*trans
,
5957 struct btrfs_root
*root
, u32 blocksize
)
5959 struct btrfs_block_rsv
*block_rsv
;
5960 struct btrfs_block_rsv
*global_rsv
= &root
->fs_info
->global_block_rsv
;
5963 block_rsv
= get_block_rsv(trans
, root
);
5965 if (block_rsv
->size
== 0) {
5966 ret
= reserve_metadata_bytes(root
, block_rsv
, blocksize
, 0);
5968 * If we couldn't reserve metadata bytes try and use some from
5969 * the global reserve.
5971 if (ret
&& block_rsv
!= global_rsv
) {
5972 ret
= block_rsv_use_bytes(global_rsv
, blocksize
);
5975 return ERR_PTR(ret
);
5977 return ERR_PTR(ret
);
5982 ret
= block_rsv_use_bytes(block_rsv
, blocksize
);
5986 static DEFINE_RATELIMIT_STATE(_rs
,
5987 DEFAULT_RATELIMIT_INTERVAL
,
5988 /*DEFAULT_RATELIMIT_BURST*/ 2);
5989 if (__ratelimit(&_rs
)) {
5990 printk(KERN_DEBUG
"btrfs: block rsv returned %d\n", ret
);
5993 ret
= reserve_metadata_bytes(root
, block_rsv
, blocksize
, 0);
5996 } else if (ret
&& block_rsv
!= global_rsv
) {
5997 ret
= block_rsv_use_bytes(global_rsv
, blocksize
);
6003 return ERR_PTR(-ENOSPC
);
6006 static void unuse_block_rsv(struct btrfs_block_rsv
*block_rsv
, u32 blocksize
)
6008 block_rsv_add_bytes(block_rsv
, blocksize
, 0);
6009 block_rsv_release_bytes(block_rsv
, NULL
, 0);
6013 * finds a free extent and does all the dirty work required for allocation
6014 * returns the key for the extent through ins, and a tree buffer for
6015 * the first block of the extent through buf.
6017 * returns the tree buffer or NULL.
6019 struct extent_buffer
*btrfs_alloc_free_block(struct btrfs_trans_handle
*trans
,
6020 struct btrfs_root
*root
, u32 blocksize
,
6021 u64 parent
, u64 root_objectid
,
6022 struct btrfs_disk_key
*key
, int level
,
6023 u64 hint
, u64 empty_size
)
6025 struct btrfs_key ins
;
6026 struct btrfs_block_rsv
*block_rsv
;
6027 struct extent_buffer
*buf
;
6032 block_rsv
= use_block_rsv(trans
, root
, blocksize
);
6033 if (IS_ERR(block_rsv
))
6034 return ERR_CAST(block_rsv
);
6036 ret
= btrfs_reserve_extent(trans
, root
, blocksize
, blocksize
,
6037 empty_size
, hint
, (u64
)-1, &ins
, 0);
6039 unuse_block_rsv(block_rsv
, blocksize
);
6040 return ERR_PTR(ret
);
6043 buf
= btrfs_init_new_buffer(trans
, root
, ins
.objectid
,
6045 BUG_ON(IS_ERR(buf
));
6047 if (root_objectid
== BTRFS_TREE_RELOC_OBJECTID
) {
6049 parent
= ins
.objectid
;
6050 flags
|= BTRFS_BLOCK_FLAG_FULL_BACKREF
;
6054 if (root_objectid
!= BTRFS_TREE_LOG_OBJECTID
) {
6055 struct btrfs_delayed_extent_op
*extent_op
;
6056 extent_op
= kmalloc(sizeof(*extent_op
), GFP_NOFS
);
6059 memcpy(&extent_op
->key
, key
, sizeof(extent_op
->key
));
6061 memset(&extent_op
->key
, 0, sizeof(extent_op
->key
));
6062 extent_op
->flags_to_set
= flags
;
6063 extent_op
->update_key
= 1;
6064 extent_op
->update_flags
= 1;
6065 extent_op
->is_data
= 0;
6067 ret
= btrfs_add_delayed_tree_ref(trans
, ins
.objectid
,
6068 ins
.offset
, parent
, root_objectid
,
6069 level
, BTRFS_ADD_DELAYED_EXTENT
,
6076 struct walk_control
{
6077 u64 refs
[BTRFS_MAX_LEVEL
];
6078 u64 flags
[BTRFS_MAX_LEVEL
];
6079 struct btrfs_key update_progress
;
6089 #define DROP_REFERENCE 1
6090 #define UPDATE_BACKREF 2
6092 static noinline
void reada_walk_down(struct btrfs_trans_handle
*trans
,
6093 struct btrfs_root
*root
,
6094 struct walk_control
*wc
,
6095 struct btrfs_path
*path
)
6103 struct btrfs_key key
;
6104 struct extent_buffer
*eb
;
6109 if (path
->slots
[wc
->level
] < wc
->reada_slot
) {
6110 wc
->reada_count
= wc
->reada_count
* 2 / 3;
6111 wc
->reada_count
= max(wc
->reada_count
, 2);
6113 wc
->reada_count
= wc
->reada_count
* 3 / 2;
6114 wc
->reada_count
= min_t(int, wc
->reada_count
,
6115 BTRFS_NODEPTRS_PER_BLOCK(root
));
6118 eb
= path
->nodes
[wc
->level
];
6119 nritems
= btrfs_header_nritems(eb
);
6120 blocksize
= btrfs_level_size(root
, wc
->level
- 1);
6122 for (slot
= path
->slots
[wc
->level
]; slot
< nritems
; slot
++) {
6123 if (nread
>= wc
->reada_count
)
6127 bytenr
= btrfs_node_blockptr(eb
, slot
);
6128 generation
= btrfs_node_ptr_generation(eb
, slot
);
6130 if (slot
== path
->slots
[wc
->level
])
6133 if (wc
->stage
== UPDATE_BACKREF
&&
6134 generation
<= root
->root_key
.offset
)
6137 /* We don't lock the tree block, it's OK to be racy here */
6138 ret
= btrfs_lookup_extent_info(trans
, root
, bytenr
, blocksize
,
6143 if (wc
->stage
== DROP_REFERENCE
) {
6147 if (wc
->level
== 1 &&
6148 (flags
& BTRFS_BLOCK_FLAG_FULL_BACKREF
))
6150 if (!wc
->update_ref
||
6151 generation
<= root
->root_key
.offset
)
6153 btrfs_node_key_to_cpu(eb
, &key
, slot
);
6154 ret
= btrfs_comp_cpu_keys(&key
,
6155 &wc
->update_progress
);
6159 if (wc
->level
== 1 &&
6160 (flags
& BTRFS_BLOCK_FLAG_FULL_BACKREF
))
6164 ret
= readahead_tree_block(root
, bytenr
, blocksize
,
6170 wc
->reada_slot
= slot
;
6174 * hepler to process tree block while walking down the tree.
6176 * when wc->stage == UPDATE_BACKREF, this function updates
6177 * back refs for pointers in the block.
6179 * NOTE: return value 1 means we should stop walking down.
6181 static noinline
int walk_down_proc(struct btrfs_trans_handle
*trans
,
6182 struct btrfs_root
*root
,
6183 struct btrfs_path
*path
,
6184 struct walk_control
*wc
, int lookup_info
)
6186 int level
= wc
->level
;
6187 struct extent_buffer
*eb
= path
->nodes
[level
];
6188 u64 flag
= BTRFS_BLOCK_FLAG_FULL_BACKREF
;
6191 if (wc
->stage
== UPDATE_BACKREF
&&
6192 btrfs_header_owner(eb
) != root
->root_key
.objectid
)
6196 * when reference count of tree block is 1, it won't increase
6197 * again. once full backref flag is set, we never clear it.
6200 ((wc
->stage
== DROP_REFERENCE
&& wc
->refs
[level
] != 1) ||
6201 (wc
->stage
== UPDATE_BACKREF
&& !(wc
->flags
[level
] & flag
)))) {
6202 BUG_ON(!path
->locks
[level
]);
6203 ret
= btrfs_lookup_extent_info(trans
, root
,
6208 BUG_ON(wc
->refs
[level
] == 0);
6211 if (wc
->stage
== DROP_REFERENCE
) {
6212 if (wc
->refs
[level
] > 1)
6215 if (path
->locks
[level
] && !wc
->keep_locks
) {
6216 btrfs_tree_unlock_rw(eb
, path
->locks
[level
]);
6217 path
->locks
[level
] = 0;
6222 /* wc->stage == UPDATE_BACKREF */
6223 if (!(wc
->flags
[level
] & flag
)) {
6224 BUG_ON(!path
->locks
[level
]);
6225 ret
= btrfs_inc_ref(trans
, root
, eb
, 1);
6227 ret
= btrfs_dec_ref(trans
, root
, eb
, 0);
6229 ret
= btrfs_set_disk_extent_flags(trans
, root
, eb
->start
,
6232 wc
->flags
[level
] |= flag
;
6236 * the block is shared by multiple trees, so it's not good to
6237 * keep the tree lock
6239 if (path
->locks
[level
] && level
> 0) {
6240 btrfs_tree_unlock_rw(eb
, path
->locks
[level
]);
6241 path
->locks
[level
] = 0;
6247 * hepler to process tree block pointer.
6249 * when wc->stage == DROP_REFERENCE, this function checks
6250 * reference count of the block pointed to. if the block
6251 * is shared and we need update back refs for the subtree
6252 * rooted at the block, this function changes wc->stage to
6253 * UPDATE_BACKREF. if the block is shared and there is no
6254 * need to update back, this function drops the reference
6257 * NOTE: return value 1 means we should stop walking down.
6259 static noinline
int do_walk_down(struct btrfs_trans_handle
*trans
,
6260 struct btrfs_root
*root
,
6261 struct btrfs_path
*path
,
6262 struct walk_control
*wc
, int *lookup_info
)
6268 struct btrfs_key key
;
6269 struct extent_buffer
*next
;
6270 int level
= wc
->level
;
6274 generation
= btrfs_node_ptr_generation(path
->nodes
[level
],
6275 path
->slots
[level
]);
6277 * if the lower level block was created before the snapshot
6278 * was created, we know there is no need to update back refs
6281 if (wc
->stage
== UPDATE_BACKREF
&&
6282 generation
<= root
->root_key
.offset
) {
6287 bytenr
= btrfs_node_blockptr(path
->nodes
[level
], path
->slots
[level
]);
6288 blocksize
= btrfs_level_size(root
, level
- 1);
6290 next
= btrfs_find_tree_block(root
, bytenr
, blocksize
);
6292 next
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
6297 btrfs_tree_lock(next
);
6298 btrfs_set_lock_blocking(next
);
6300 ret
= btrfs_lookup_extent_info(trans
, root
, bytenr
, blocksize
,
6301 &wc
->refs
[level
- 1],
6302 &wc
->flags
[level
- 1]);
6304 BUG_ON(wc
->refs
[level
- 1] == 0);
6307 if (wc
->stage
== DROP_REFERENCE
) {
6308 if (wc
->refs
[level
- 1] > 1) {
6310 (wc
->flags
[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF
))
6313 if (!wc
->update_ref
||
6314 generation
<= root
->root_key
.offset
)
6317 btrfs_node_key_to_cpu(path
->nodes
[level
], &key
,
6318 path
->slots
[level
]);
6319 ret
= btrfs_comp_cpu_keys(&key
, &wc
->update_progress
);
6323 wc
->stage
= UPDATE_BACKREF
;
6324 wc
->shared_level
= level
- 1;
6328 (wc
->flags
[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF
))
6332 if (!btrfs_buffer_uptodate(next
, generation
)) {
6333 btrfs_tree_unlock(next
);
6334 free_extent_buffer(next
);
6340 if (reada
&& level
== 1)
6341 reada_walk_down(trans
, root
, wc
, path
);
6342 next
= read_tree_block(root
, bytenr
, blocksize
, generation
);
6345 btrfs_tree_lock(next
);
6346 btrfs_set_lock_blocking(next
);
6350 BUG_ON(level
!= btrfs_header_level(next
));
6351 path
->nodes
[level
] = next
;
6352 path
->slots
[level
] = 0;
6353 path
->locks
[level
] = BTRFS_WRITE_LOCK_BLOCKING
;
6359 wc
->refs
[level
- 1] = 0;
6360 wc
->flags
[level
- 1] = 0;
6361 if (wc
->stage
== DROP_REFERENCE
) {
6362 if (wc
->flags
[level
] & BTRFS_BLOCK_FLAG_FULL_BACKREF
) {
6363 parent
= path
->nodes
[level
]->start
;
6365 BUG_ON(root
->root_key
.objectid
!=
6366 btrfs_header_owner(path
->nodes
[level
]));
6370 ret
= btrfs_free_extent(trans
, root
, bytenr
, blocksize
, parent
,
6371 root
->root_key
.objectid
, level
- 1, 0);
6374 btrfs_tree_unlock(next
);
6375 free_extent_buffer(next
);
6381 * hepler to process tree block while walking up the tree.
6383 * when wc->stage == DROP_REFERENCE, this function drops
6384 * reference count on the block.
6386 * when wc->stage == UPDATE_BACKREF, this function changes
6387 * wc->stage back to DROP_REFERENCE if we changed wc->stage
6388 * to UPDATE_BACKREF previously while processing the block.
6390 * NOTE: return value 1 means we should stop walking up.
6392 static noinline
int walk_up_proc(struct btrfs_trans_handle
*trans
,
6393 struct btrfs_root
*root
,
6394 struct btrfs_path
*path
,
6395 struct walk_control
*wc
)
6398 int level
= wc
->level
;
6399 struct extent_buffer
*eb
= path
->nodes
[level
];
6402 if (wc
->stage
== UPDATE_BACKREF
) {
6403 BUG_ON(wc
->shared_level
< level
);
6404 if (level
< wc
->shared_level
)
6407 ret
= find_next_key(path
, level
+ 1, &wc
->update_progress
);
6411 wc
->stage
= DROP_REFERENCE
;
6412 wc
->shared_level
= -1;
6413 path
->slots
[level
] = 0;
6416 * check reference count again if the block isn't locked.
6417 * we should start walking down the tree again if reference
6420 if (!path
->locks
[level
]) {
6422 btrfs_tree_lock(eb
);
6423 btrfs_set_lock_blocking(eb
);
6424 path
->locks
[level
] = BTRFS_WRITE_LOCK_BLOCKING
;
6426 ret
= btrfs_lookup_extent_info(trans
, root
,
6431 BUG_ON(wc
->refs
[level
] == 0);
6432 if (wc
->refs
[level
] == 1) {
6433 btrfs_tree_unlock_rw(eb
, path
->locks
[level
]);
6439 /* wc->stage == DROP_REFERENCE */
6440 BUG_ON(wc
->refs
[level
] > 1 && !path
->locks
[level
]);
6442 if (wc
->refs
[level
] == 1) {
6444 if (wc
->flags
[level
] & BTRFS_BLOCK_FLAG_FULL_BACKREF
)
6445 ret
= btrfs_dec_ref(trans
, root
, eb
, 1);
6447 ret
= btrfs_dec_ref(trans
, root
, eb
, 0);
6450 /* make block locked assertion in clean_tree_block happy */
6451 if (!path
->locks
[level
] &&
6452 btrfs_header_generation(eb
) == trans
->transid
) {
6453 btrfs_tree_lock(eb
);
6454 btrfs_set_lock_blocking(eb
);
6455 path
->locks
[level
] = BTRFS_WRITE_LOCK_BLOCKING
;
6457 clean_tree_block(trans
, root
, eb
);
6460 if (eb
== root
->node
) {
6461 if (wc
->flags
[level
] & BTRFS_BLOCK_FLAG_FULL_BACKREF
)
6464 BUG_ON(root
->root_key
.objectid
!=
6465 btrfs_header_owner(eb
));
6467 if (wc
->flags
[level
+ 1] & BTRFS_BLOCK_FLAG_FULL_BACKREF
)
6468 parent
= path
->nodes
[level
+ 1]->start
;
6470 BUG_ON(root
->root_key
.objectid
!=
6471 btrfs_header_owner(path
->nodes
[level
+ 1]));
6474 btrfs_free_tree_block(trans
, root
, eb
, parent
, wc
->refs
[level
] == 1);
6476 wc
->refs
[level
] = 0;
6477 wc
->flags
[level
] = 0;
6481 static noinline
int walk_down_tree(struct btrfs_trans_handle
*trans
,
6482 struct btrfs_root
*root
,
6483 struct btrfs_path
*path
,
6484 struct walk_control
*wc
)
6486 int level
= wc
->level
;
6487 int lookup_info
= 1;
6490 while (level
>= 0) {
6491 ret
= walk_down_proc(trans
, root
, path
, wc
, lookup_info
);
6498 if (path
->slots
[level
] >=
6499 btrfs_header_nritems(path
->nodes
[level
]))
6502 ret
= do_walk_down(trans
, root
, path
, wc
, &lookup_info
);
6504 path
->slots
[level
]++;
6513 static noinline
int walk_up_tree(struct btrfs_trans_handle
*trans
,
6514 struct btrfs_root
*root
,
6515 struct btrfs_path
*path
,
6516 struct walk_control
*wc
, int max_level
)
6518 int level
= wc
->level
;
6521 path
->slots
[level
] = btrfs_header_nritems(path
->nodes
[level
]);
6522 while (level
< max_level
&& path
->nodes
[level
]) {
6524 if (path
->slots
[level
] + 1 <
6525 btrfs_header_nritems(path
->nodes
[level
])) {
6526 path
->slots
[level
]++;
6529 ret
= walk_up_proc(trans
, root
, path
, wc
);
6533 if (path
->locks
[level
]) {
6534 btrfs_tree_unlock_rw(path
->nodes
[level
],
6535 path
->locks
[level
]);
6536 path
->locks
[level
] = 0;
6538 free_extent_buffer(path
->nodes
[level
]);
6539 path
->nodes
[level
] = NULL
;
6547 * drop a subvolume tree.
6549 * this function traverses the tree freeing any blocks that only
6550 * referenced by the tree.
6552 * when a shared tree block is found. this function decreases its
6553 * reference count by one. if update_ref is true, this function
6554 * also make sure backrefs for the shared block and all lower level
6555 * blocks are properly updated.
6557 void btrfs_drop_snapshot(struct btrfs_root
*root
,
6558 struct btrfs_block_rsv
*block_rsv
, int update_ref
)
6560 struct btrfs_path
*path
;
6561 struct btrfs_trans_handle
*trans
;
6562 struct btrfs_root
*tree_root
= root
->fs_info
->tree_root
;
6563 struct btrfs_root_item
*root_item
= &root
->root_item
;
6564 struct walk_control
*wc
;
6565 struct btrfs_key key
;
6570 path
= btrfs_alloc_path();
6576 wc
= kzalloc(sizeof(*wc
), GFP_NOFS
);
6578 btrfs_free_path(path
);
6583 trans
= btrfs_start_transaction(tree_root
, 0);
6584 BUG_ON(IS_ERR(trans
));
6587 trans
->block_rsv
= block_rsv
;
6589 if (btrfs_disk_key_objectid(&root_item
->drop_progress
) == 0) {
6590 level
= btrfs_header_level(root
->node
);
6591 path
->nodes
[level
] = btrfs_lock_root_node(root
);
6592 btrfs_set_lock_blocking(path
->nodes
[level
]);
6593 path
->slots
[level
] = 0;
6594 path
->locks
[level
] = BTRFS_WRITE_LOCK_BLOCKING
;
6595 memset(&wc
->update_progress
, 0,
6596 sizeof(wc
->update_progress
));
6598 btrfs_disk_key_to_cpu(&key
, &root_item
->drop_progress
);
6599 memcpy(&wc
->update_progress
, &key
,
6600 sizeof(wc
->update_progress
));
6602 level
= root_item
->drop_level
;
6604 path
->lowest_level
= level
;
6605 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
6606 path
->lowest_level
= 0;
6614 * unlock our path, this is safe because only this
6615 * function is allowed to delete this snapshot
6617 btrfs_unlock_up_safe(path
, 0);
6619 level
= btrfs_header_level(root
->node
);
6621 btrfs_tree_lock(path
->nodes
[level
]);
6622 btrfs_set_lock_blocking(path
->nodes
[level
]);
6624 ret
= btrfs_lookup_extent_info(trans
, root
,
6625 path
->nodes
[level
]->start
,
6626 path
->nodes
[level
]->len
,
6630 BUG_ON(wc
->refs
[level
] == 0);
6632 if (level
== root_item
->drop_level
)
6635 btrfs_tree_unlock(path
->nodes
[level
]);
6636 WARN_ON(wc
->refs
[level
] != 1);
6642 wc
->shared_level
= -1;
6643 wc
->stage
= DROP_REFERENCE
;
6644 wc
->update_ref
= update_ref
;
6646 wc
->reada_count
= BTRFS_NODEPTRS_PER_BLOCK(root
);
6649 ret
= walk_down_tree(trans
, root
, path
, wc
);
6655 ret
= walk_up_tree(trans
, root
, path
, wc
, BTRFS_MAX_LEVEL
);
6662 BUG_ON(wc
->stage
!= DROP_REFERENCE
);
6666 if (wc
->stage
== DROP_REFERENCE
) {
6668 btrfs_node_key(path
->nodes
[level
],
6669 &root_item
->drop_progress
,
6670 path
->slots
[level
]);
6671 root_item
->drop_level
= level
;
6674 BUG_ON(wc
->level
== 0);
6675 if (btrfs_should_end_transaction(trans
, tree_root
)) {
6676 ret
= btrfs_update_root(trans
, tree_root
,
6681 btrfs_end_transaction_throttle(trans
, tree_root
);
6682 trans
= btrfs_start_transaction(tree_root
, 0);
6683 BUG_ON(IS_ERR(trans
));
6685 trans
->block_rsv
= block_rsv
;
6688 btrfs_release_path(path
);
6691 ret
= btrfs_del_root(trans
, tree_root
, &root
->root_key
);
6694 if (root
->root_key
.objectid
!= BTRFS_TREE_RELOC_OBJECTID
) {
6695 ret
= btrfs_find_last_root(tree_root
, root
->root_key
.objectid
,
6699 /* if we fail to delete the orphan item this time
6700 * around, it'll get picked up the next time.
6702 * The most common failure here is just -ENOENT.
6704 btrfs_del_orphan_item(trans
, tree_root
,
6705 root
->root_key
.objectid
);
6709 if (root
->in_radix
) {
6710 btrfs_free_fs_root(tree_root
->fs_info
, root
);
6712 free_extent_buffer(root
->node
);
6713 free_extent_buffer(root
->commit_root
);
6717 btrfs_end_transaction_throttle(trans
, tree_root
);
6719 btrfs_free_path(path
);
6722 btrfs_std_error(root
->fs_info
, err
);
6727 * drop subtree rooted at tree block 'node'.
6729 * NOTE: this function will unlock and release tree block 'node'
6731 int btrfs_drop_subtree(struct btrfs_trans_handle
*trans
,
6732 struct btrfs_root
*root
,
6733 struct extent_buffer
*node
,
6734 struct extent_buffer
*parent
)
6736 struct btrfs_path
*path
;
6737 struct walk_control
*wc
;
6743 BUG_ON(root
->root_key
.objectid
!= BTRFS_TREE_RELOC_OBJECTID
);
6745 path
= btrfs_alloc_path();
6749 wc
= kzalloc(sizeof(*wc
), GFP_NOFS
);
6751 btrfs_free_path(path
);
6755 btrfs_assert_tree_locked(parent
);
6756 parent_level
= btrfs_header_level(parent
);
6757 extent_buffer_get(parent
);
6758 path
->nodes
[parent_level
] = parent
;
6759 path
->slots
[parent_level
] = btrfs_header_nritems(parent
);
6761 btrfs_assert_tree_locked(node
);
6762 level
= btrfs_header_level(node
);
6763 path
->nodes
[level
] = node
;
6764 path
->slots
[level
] = 0;
6765 path
->locks
[level
] = BTRFS_WRITE_LOCK_BLOCKING
;
6767 wc
->refs
[parent_level
] = 1;
6768 wc
->flags
[parent_level
] = BTRFS_BLOCK_FLAG_FULL_BACKREF
;
6770 wc
->shared_level
= -1;
6771 wc
->stage
= DROP_REFERENCE
;
6774 wc
->reada_count
= BTRFS_NODEPTRS_PER_BLOCK(root
);
6777 wret
= walk_down_tree(trans
, root
, path
, wc
);
6783 wret
= walk_up_tree(trans
, root
, path
, wc
, parent_level
);
6791 btrfs_free_path(path
);
6795 static u64
update_block_group_flags(struct btrfs_root
*root
, u64 flags
)
6798 u64 stripped
= BTRFS_BLOCK_GROUP_RAID0
|
6799 BTRFS_BLOCK_GROUP_RAID1
| BTRFS_BLOCK_GROUP_RAID10
;
6802 * we add in the count of missing devices because we want
6803 * to make sure that any RAID levels on a degraded FS
6804 * continue to be honored.
6806 num_devices
= root
->fs_info
->fs_devices
->rw_devices
+
6807 root
->fs_info
->fs_devices
->missing_devices
;
6809 if (num_devices
== 1) {
6810 stripped
|= BTRFS_BLOCK_GROUP_DUP
;
6811 stripped
= flags
& ~stripped
;
6813 /* turn raid0 into single device chunks */
6814 if (flags
& BTRFS_BLOCK_GROUP_RAID0
)
6817 /* turn mirroring into duplication */
6818 if (flags
& (BTRFS_BLOCK_GROUP_RAID1
|
6819 BTRFS_BLOCK_GROUP_RAID10
))
6820 return stripped
| BTRFS_BLOCK_GROUP_DUP
;
6823 /* they already had raid on here, just return */
6824 if (flags
& stripped
)
6827 stripped
|= BTRFS_BLOCK_GROUP_DUP
;
6828 stripped
= flags
& ~stripped
;
6830 /* switch duplicated blocks with raid1 */
6831 if (flags
& BTRFS_BLOCK_GROUP_DUP
)
6832 return stripped
| BTRFS_BLOCK_GROUP_RAID1
;
6834 /* turn single device chunks into raid0 */
6835 return stripped
| BTRFS_BLOCK_GROUP_RAID0
;
6840 static int set_block_group_ro(struct btrfs_block_group_cache
*cache
, int force
)
6842 struct btrfs_space_info
*sinfo
= cache
->space_info
;
6844 u64 min_allocable_bytes
;
6849 * We need some metadata space and system metadata space for
6850 * allocating chunks in some corner cases until we force to set
6851 * it to be readonly.
6854 (BTRFS_BLOCK_GROUP_SYSTEM
| BTRFS_BLOCK_GROUP_METADATA
)) &&
6856 min_allocable_bytes
= 1 * 1024 * 1024;
6858 min_allocable_bytes
= 0;
6860 spin_lock(&sinfo
->lock
);
6861 spin_lock(&cache
->lock
);
6868 num_bytes
= cache
->key
.offset
- cache
->reserved
- cache
->pinned
-
6869 cache
->bytes_super
- btrfs_block_group_used(&cache
->item
);
6871 if (sinfo
->bytes_used
+ sinfo
->bytes_reserved
+ sinfo
->bytes_pinned
+
6872 sinfo
->bytes_may_use
+ sinfo
->bytes_readonly
+ num_bytes
+
6873 min_allocable_bytes
<= sinfo
->total_bytes
) {
6874 sinfo
->bytes_readonly
+= num_bytes
;
6879 spin_unlock(&cache
->lock
);
6880 spin_unlock(&sinfo
->lock
);
6884 int btrfs_set_block_group_ro(struct btrfs_root
*root
,
6885 struct btrfs_block_group_cache
*cache
)
6888 struct btrfs_trans_handle
*trans
;
6894 trans
= btrfs_join_transaction(root
);
6895 BUG_ON(IS_ERR(trans
));
6897 alloc_flags
= update_block_group_flags(root
, cache
->flags
);
6898 if (alloc_flags
!= cache
->flags
)
6899 do_chunk_alloc(trans
, root
, 2 * 1024 * 1024, alloc_flags
,
6902 ret
= set_block_group_ro(cache
, 0);
6905 alloc_flags
= get_alloc_profile(root
, cache
->space_info
->flags
);
6906 ret
= do_chunk_alloc(trans
, root
, 2 * 1024 * 1024, alloc_flags
,
6910 ret
= set_block_group_ro(cache
, 0);
6912 btrfs_end_transaction(trans
, root
);
6916 int btrfs_force_chunk_alloc(struct btrfs_trans_handle
*trans
,
6917 struct btrfs_root
*root
, u64 type
)
6919 u64 alloc_flags
= get_alloc_profile(root
, type
);
6920 return do_chunk_alloc(trans
, root
, 2 * 1024 * 1024, alloc_flags
,
6925 * helper to account the unused space of all the readonly block group in the
6926 * list. takes mirrors into account.
6928 static u64
__btrfs_get_ro_block_group_free_space(struct list_head
*groups_list
)
6930 struct btrfs_block_group_cache
*block_group
;
6934 list_for_each_entry(block_group
, groups_list
, list
) {
6935 spin_lock(&block_group
->lock
);
6937 if (!block_group
->ro
) {
6938 spin_unlock(&block_group
->lock
);
6942 if (block_group
->flags
& (BTRFS_BLOCK_GROUP_RAID1
|
6943 BTRFS_BLOCK_GROUP_RAID10
|
6944 BTRFS_BLOCK_GROUP_DUP
))
6949 free_bytes
+= (block_group
->key
.offset
-
6950 btrfs_block_group_used(&block_group
->item
)) *
6953 spin_unlock(&block_group
->lock
);
6960 * helper to account the unused space of all the readonly block group in the
6961 * space_info. takes mirrors into account.
6963 u64
btrfs_account_ro_block_groups_free_space(struct btrfs_space_info
*sinfo
)
6968 spin_lock(&sinfo
->lock
);
6970 for(i
= 0; i
< BTRFS_NR_RAID_TYPES
; i
++)
6971 if (!list_empty(&sinfo
->block_groups
[i
]))
6972 free_bytes
+= __btrfs_get_ro_block_group_free_space(
6973 &sinfo
->block_groups
[i
]);
6975 spin_unlock(&sinfo
->lock
);
6980 int btrfs_set_block_group_rw(struct btrfs_root
*root
,
6981 struct btrfs_block_group_cache
*cache
)
6983 struct btrfs_space_info
*sinfo
= cache
->space_info
;
6988 spin_lock(&sinfo
->lock
);
6989 spin_lock(&cache
->lock
);
6990 num_bytes
= cache
->key
.offset
- cache
->reserved
- cache
->pinned
-
6991 cache
->bytes_super
- btrfs_block_group_used(&cache
->item
);
6992 sinfo
->bytes_readonly
-= num_bytes
;
6994 spin_unlock(&cache
->lock
);
6995 spin_unlock(&sinfo
->lock
);
7000 * checks to see if its even possible to relocate this block group.
7002 * @return - -1 if it's not a good idea to relocate this block group, 0 if its
7003 * ok to go ahead and try.
7005 int btrfs_can_relocate(struct btrfs_root
*root
, u64 bytenr
)
7007 struct btrfs_block_group_cache
*block_group
;
7008 struct btrfs_space_info
*space_info
;
7009 struct btrfs_fs_devices
*fs_devices
= root
->fs_info
->fs_devices
;
7010 struct btrfs_device
*device
;
7018 block_group
= btrfs_lookup_block_group(root
->fs_info
, bytenr
);
7020 /* odd, couldn't find the block group, leave it alone */
7024 min_free
= btrfs_block_group_used(&block_group
->item
);
7026 /* no bytes used, we're good */
7030 space_info
= block_group
->space_info
;
7031 spin_lock(&space_info
->lock
);
7033 full
= space_info
->full
;
7036 * if this is the last block group we have in this space, we can't
7037 * relocate it unless we're able to allocate a new chunk below.
7039 * Otherwise, we need to make sure we have room in the space to handle
7040 * all of the extents from this block group. If we can, we're good
7042 if ((space_info
->total_bytes
!= block_group
->key
.offset
) &&
7043 (space_info
->bytes_used
+ space_info
->bytes_reserved
+
7044 space_info
->bytes_pinned
+ space_info
->bytes_readonly
+
7045 min_free
< space_info
->total_bytes
)) {
7046 spin_unlock(&space_info
->lock
);
7049 spin_unlock(&space_info
->lock
);
7052 * ok we don't have enough space, but maybe we have free space on our
7053 * devices to allocate new chunks for relocation, so loop through our
7054 * alloc devices and guess if we have enough space. However, if we
7055 * were marked as full, then we know there aren't enough chunks, and we
7070 index
= get_block_group_index(block_group
);
7075 } else if (index
== 1) {
7077 } else if (index
== 2) {
7080 } else if (index
== 3) {
7081 dev_min
= fs_devices
->rw_devices
;
7082 do_div(min_free
, dev_min
);
7085 mutex_lock(&root
->fs_info
->chunk_mutex
);
7086 list_for_each_entry(device
, &fs_devices
->alloc_list
, dev_alloc_list
) {
7090 * check to make sure we can actually find a chunk with enough
7091 * space to fit our block group in.
7093 if (device
->total_bytes
> device
->bytes_used
+ min_free
) {
7094 ret
= find_free_dev_extent(NULL
, device
, min_free
,
7099 if (dev_nr
>= dev_min
)
7105 mutex_unlock(&root
->fs_info
->chunk_mutex
);
7107 btrfs_put_block_group(block_group
);
7111 static int find_first_block_group(struct btrfs_root
*root
,
7112 struct btrfs_path
*path
, struct btrfs_key
*key
)
7115 struct btrfs_key found_key
;
7116 struct extent_buffer
*leaf
;
7119 ret
= btrfs_search_slot(NULL
, root
, key
, path
, 0, 0);
7124 slot
= path
->slots
[0];
7125 leaf
= path
->nodes
[0];
7126 if (slot
>= btrfs_header_nritems(leaf
)) {
7127 ret
= btrfs_next_leaf(root
, path
);
7134 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
7136 if (found_key
.objectid
>= key
->objectid
&&
7137 found_key
.type
== BTRFS_BLOCK_GROUP_ITEM_KEY
) {
7147 void btrfs_put_block_group_cache(struct btrfs_fs_info
*info
)
7149 struct btrfs_block_group_cache
*block_group
;
7153 struct inode
*inode
;
7155 block_group
= btrfs_lookup_first_block_group(info
, last
);
7156 while (block_group
) {
7157 spin_lock(&block_group
->lock
);
7158 if (block_group
->iref
)
7160 spin_unlock(&block_group
->lock
);
7161 block_group
= next_block_group(info
->tree_root
,
7171 inode
= block_group
->inode
;
7172 block_group
->iref
= 0;
7173 block_group
->inode
= NULL
;
7174 spin_unlock(&block_group
->lock
);
7176 last
= block_group
->key
.objectid
+ block_group
->key
.offset
;
7177 btrfs_put_block_group(block_group
);
7181 int btrfs_free_block_groups(struct btrfs_fs_info
*info
)
7183 struct btrfs_block_group_cache
*block_group
;
7184 struct btrfs_space_info
*space_info
;
7185 struct btrfs_caching_control
*caching_ctl
;
7188 down_write(&info
->extent_commit_sem
);
7189 while (!list_empty(&info
->caching_block_groups
)) {
7190 caching_ctl
= list_entry(info
->caching_block_groups
.next
,
7191 struct btrfs_caching_control
, list
);
7192 list_del(&caching_ctl
->list
);
7193 put_caching_control(caching_ctl
);
7195 up_write(&info
->extent_commit_sem
);
7197 spin_lock(&info
->block_group_cache_lock
);
7198 while ((n
= rb_last(&info
->block_group_cache_tree
)) != NULL
) {
7199 block_group
= rb_entry(n
, struct btrfs_block_group_cache
,
7201 rb_erase(&block_group
->cache_node
,
7202 &info
->block_group_cache_tree
);
7203 spin_unlock(&info
->block_group_cache_lock
);
7205 down_write(&block_group
->space_info
->groups_sem
);
7206 list_del(&block_group
->list
);
7207 up_write(&block_group
->space_info
->groups_sem
);
7209 if (block_group
->cached
== BTRFS_CACHE_STARTED
)
7210 wait_block_group_cache_done(block_group
);
7213 * We haven't cached this block group, which means we could
7214 * possibly have excluded extents on this block group.
7216 if (block_group
->cached
== BTRFS_CACHE_NO
)
7217 free_excluded_extents(info
->extent_root
, block_group
);
7219 btrfs_remove_free_space_cache(block_group
);
7220 btrfs_put_block_group(block_group
);
7222 spin_lock(&info
->block_group_cache_lock
);
7224 spin_unlock(&info
->block_group_cache_lock
);
7226 /* now that all the block groups are freed, go through and
7227 * free all the space_info structs. This is only called during
7228 * the final stages of unmount, and so we know nobody is
7229 * using them. We call synchronize_rcu() once before we start,
7230 * just to be on the safe side.
7234 release_global_block_rsv(info
);
7236 while(!list_empty(&info
->space_info
)) {
7237 space_info
= list_entry(info
->space_info
.next
,
7238 struct btrfs_space_info
,
7240 if (space_info
->bytes_pinned
> 0 ||
7241 space_info
->bytes_reserved
> 0 ||
7242 space_info
->bytes_may_use
> 0) {
7244 dump_space_info(space_info
, 0, 0);
7246 list_del(&space_info
->list
);
7252 static void __link_block_group(struct btrfs_space_info
*space_info
,
7253 struct btrfs_block_group_cache
*cache
)
7255 int index
= get_block_group_index(cache
);
7257 down_write(&space_info
->groups_sem
);
7258 list_add_tail(&cache
->list
, &space_info
->block_groups
[index
]);
7259 up_write(&space_info
->groups_sem
);
7262 int btrfs_read_block_groups(struct btrfs_root
*root
)
7264 struct btrfs_path
*path
;
7266 struct btrfs_block_group_cache
*cache
;
7267 struct btrfs_fs_info
*info
= root
->fs_info
;
7268 struct btrfs_space_info
*space_info
;
7269 struct btrfs_key key
;
7270 struct btrfs_key found_key
;
7271 struct extent_buffer
*leaf
;
7275 root
= info
->extent_root
;
7278 btrfs_set_key_type(&key
, BTRFS_BLOCK_GROUP_ITEM_KEY
);
7279 path
= btrfs_alloc_path();
7284 cache_gen
= btrfs_super_cache_generation(root
->fs_info
->super_copy
);
7285 if (btrfs_test_opt(root
, SPACE_CACHE
) &&
7286 btrfs_super_generation(root
->fs_info
->super_copy
) != cache_gen
)
7288 if (btrfs_test_opt(root
, CLEAR_CACHE
))
7292 ret
= find_first_block_group(root
, path
, &key
);
7297 leaf
= path
->nodes
[0];
7298 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
7299 cache
= kzalloc(sizeof(*cache
), GFP_NOFS
);
7304 cache
->free_space_ctl
= kzalloc(sizeof(*cache
->free_space_ctl
),
7306 if (!cache
->free_space_ctl
) {
7312 atomic_set(&cache
->count
, 1);
7313 spin_lock_init(&cache
->lock
);
7314 cache
->fs_info
= info
;
7315 INIT_LIST_HEAD(&cache
->list
);
7316 INIT_LIST_HEAD(&cache
->cluster_list
);
7319 cache
->disk_cache_state
= BTRFS_DC_CLEAR
;
7321 read_extent_buffer(leaf
, &cache
->item
,
7322 btrfs_item_ptr_offset(leaf
, path
->slots
[0]),
7323 sizeof(cache
->item
));
7324 memcpy(&cache
->key
, &found_key
, sizeof(found_key
));
7326 key
.objectid
= found_key
.objectid
+ found_key
.offset
;
7327 btrfs_release_path(path
);
7328 cache
->flags
= btrfs_block_group_flags(&cache
->item
);
7329 cache
->sectorsize
= root
->sectorsize
;
7331 btrfs_init_free_space_ctl(cache
);
7334 * We need to exclude the super stripes now so that the space
7335 * info has super bytes accounted for, otherwise we'll think
7336 * we have more space than we actually do.
7338 exclude_super_stripes(root
, cache
);
7341 * check for two cases, either we are full, and therefore
7342 * don't need to bother with the caching work since we won't
7343 * find any space, or we are empty, and we can just add all
7344 * the space in and be done with it. This saves us _alot_ of
7345 * time, particularly in the full case.
7347 if (found_key
.offset
== btrfs_block_group_used(&cache
->item
)) {
7348 cache
->last_byte_to_unpin
= (u64
)-1;
7349 cache
->cached
= BTRFS_CACHE_FINISHED
;
7350 free_excluded_extents(root
, cache
);
7351 } else if (btrfs_block_group_used(&cache
->item
) == 0) {
7352 cache
->last_byte_to_unpin
= (u64
)-1;
7353 cache
->cached
= BTRFS_CACHE_FINISHED
;
7354 add_new_free_space(cache
, root
->fs_info
,
7356 found_key
.objectid
+
7358 free_excluded_extents(root
, cache
);
7361 ret
= update_space_info(info
, cache
->flags
, found_key
.offset
,
7362 btrfs_block_group_used(&cache
->item
),
7365 cache
->space_info
= space_info
;
7366 spin_lock(&cache
->space_info
->lock
);
7367 cache
->space_info
->bytes_readonly
+= cache
->bytes_super
;
7368 spin_unlock(&cache
->space_info
->lock
);
7370 __link_block_group(space_info
, cache
);
7372 ret
= btrfs_add_block_group_cache(root
->fs_info
, cache
);
7375 set_avail_alloc_bits(root
->fs_info
, cache
->flags
);
7376 if (btrfs_chunk_readonly(root
, cache
->key
.objectid
))
7377 set_block_group_ro(cache
, 1);
7380 list_for_each_entry_rcu(space_info
, &root
->fs_info
->space_info
, list
) {
7381 if (!(get_alloc_profile(root
, space_info
->flags
) &
7382 (BTRFS_BLOCK_GROUP_RAID10
|
7383 BTRFS_BLOCK_GROUP_RAID1
|
7384 BTRFS_BLOCK_GROUP_DUP
)))
7387 * avoid allocating from un-mirrored block group if there are
7388 * mirrored block groups.
7390 list_for_each_entry(cache
, &space_info
->block_groups
[3], list
)
7391 set_block_group_ro(cache
, 1);
7392 list_for_each_entry(cache
, &space_info
->block_groups
[4], list
)
7393 set_block_group_ro(cache
, 1);
7396 init_global_block_rsv(info
);
7399 btrfs_free_path(path
);
7403 int btrfs_make_block_group(struct btrfs_trans_handle
*trans
,
7404 struct btrfs_root
*root
, u64 bytes_used
,
7405 u64 type
, u64 chunk_objectid
, u64 chunk_offset
,
7409 struct btrfs_root
*extent_root
;
7410 struct btrfs_block_group_cache
*cache
;
7412 extent_root
= root
->fs_info
->extent_root
;
7414 root
->fs_info
->last_trans_log_full_commit
= trans
->transid
;
7416 cache
= kzalloc(sizeof(*cache
), GFP_NOFS
);
7419 cache
->free_space_ctl
= kzalloc(sizeof(*cache
->free_space_ctl
),
7421 if (!cache
->free_space_ctl
) {
7426 cache
->key
.objectid
= chunk_offset
;
7427 cache
->key
.offset
= size
;
7428 cache
->key
.type
= BTRFS_BLOCK_GROUP_ITEM_KEY
;
7429 cache
->sectorsize
= root
->sectorsize
;
7430 cache
->fs_info
= root
->fs_info
;
7432 atomic_set(&cache
->count
, 1);
7433 spin_lock_init(&cache
->lock
);
7434 INIT_LIST_HEAD(&cache
->list
);
7435 INIT_LIST_HEAD(&cache
->cluster_list
);
7437 btrfs_init_free_space_ctl(cache
);
7439 btrfs_set_block_group_used(&cache
->item
, bytes_used
);
7440 btrfs_set_block_group_chunk_objectid(&cache
->item
, chunk_objectid
);
7441 cache
->flags
= type
;
7442 btrfs_set_block_group_flags(&cache
->item
, type
);
7444 cache
->last_byte_to_unpin
= (u64
)-1;
7445 cache
->cached
= BTRFS_CACHE_FINISHED
;
7446 exclude_super_stripes(root
, cache
);
7448 add_new_free_space(cache
, root
->fs_info
, chunk_offset
,
7449 chunk_offset
+ size
);
7451 free_excluded_extents(root
, cache
);
7453 ret
= update_space_info(root
->fs_info
, cache
->flags
, size
, bytes_used
,
7454 &cache
->space_info
);
7457 spin_lock(&cache
->space_info
->lock
);
7458 cache
->space_info
->bytes_readonly
+= cache
->bytes_super
;
7459 spin_unlock(&cache
->space_info
->lock
);
7461 __link_block_group(cache
->space_info
, cache
);
7463 ret
= btrfs_add_block_group_cache(root
->fs_info
, cache
);
7466 ret
= btrfs_insert_item(trans
, extent_root
, &cache
->key
, &cache
->item
,
7467 sizeof(cache
->item
));
7470 set_avail_alloc_bits(extent_root
->fs_info
, type
);
7475 int btrfs_remove_block_group(struct btrfs_trans_handle
*trans
,
7476 struct btrfs_root
*root
, u64 group_start
)
7478 struct btrfs_path
*path
;
7479 struct btrfs_block_group_cache
*block_group
;
7480 struct btrfs_free_cluster
*cluster
;
7481 struct btrfs_root
*tree_root
= root
->fs_info
->tree_root
;
7482 struct btrfs_key key
;
7483 struct inode
*inode
;
7487 root
= root
->fs_info
->extent_root
;
7489 block_group
= btrfs_lookup_block_group(root
->fs_info
, group_start
);
7490 BUG_ON(!block_group
);
7491 BUG_ON(!block_group
->ro
);
7494 * Free the reserved super bytes from this block group before
7497 free_excluded_extents(root
, block_group
);
7499 memcpy(&key
, &block_group
->key
, sizeof(key
));
7500 if (block_group
->flags
& (BTRFS_BLOCK_GROUP_DUP
|
7501 BTRFS_BLOCK_GROUP_RAID1
|
7502 BTRFS_BLOCK_GROUP_RAID10
))
7507 /* make sure this block group isn't part of an allocation cluster */
7508 cluster
= &root
->fs_info
->data_alloc_cluster
;
7509 spin_lock(&cluster
->refill_lock
);
7510 btrfs_return_cluster_to_free_space(block_group
, cluster
);
7511 spin_unlock(&cluster
->refill_lock
);
7514 * make sure this block group isn't part of a metadata
7515 * allocation cluster
7517 cluster
= &root
->fs_info
->meta_alloc_cluster
;
7518 spin_lock(&cluster
->refill_lock
);
7519 btrfs_return_cluster_to_free_space(block_group
, cluster
);
7520 spin_unlock(&cluster
->refill_lock
);
7522 path
= btrfs_alloc_path();
7528 inode
= lookup_free_space_inode(tree_root
, block_group
, path
);
7529 if (!IS_ERR(inode
)) {
7530 ret
= btrfs_orphan_add(trans
, inode
);
7533 /* One for the block groups ref */
7534 spin_lock(&block_group
->lock
);
7535 if (block_group
->iref
) {
7536 block_group
->iref
= 0;
7537 block_group
->inode
= NULL
;
7538 spin_unlock(&block_group
->lock
);
7541 spin_unlock(&block_group
->lock
);
7543 /* One for our lookup ref */
7544 btrfs_add_delayed_iput(inode
);
7547 key
.objectid
= BTRFS_FREE_SPACE_OBJECTID
;
7548 key
.offset
= block_group
->key
.objectid
;
7551 ret
= btrfs_search_slot(trans
, tree_root
, &key
, path
, -1, 1);
7555 btrfs_release_path(path
);
7557 ret
= btrfs_del_item(trans
, tree_root
, path
);
7560 btrfs_release_path(path
);
7563 spin_lock(&root
->fs_info
->block_group_cache_lock
);
7564 rb_erase(&block_group
->cache_node
,
7565 &root
->fs_info
->block_group_cache_tree
);
7566 spin_unlock(&root
->fs_info
->block_group_cache_lock
);
7568 down_write(&block_group
->space_info
->groups_sem
);
7570 * we must use list_del_init so people can check to see if they
7571 * are still on the list after taking the semaphore
7573 list_del_init(&block_group
->list
);
7574 up_write(&block_group
->space_info
->groups_sem
);
7576 if (block_group
->cached
== BTRFS_CACHE_STARTED
)
7577 wait_block_group_cache_done(block_group
);
7579 btrfs_remove_free_space_cache(block_group
);
7581 spin_lock(&block_group
->space_info
->lock
);
7582 block_group
->space_info
->total_bytes
-= block_group
->key
.offset
;
7583 block_group
->space_info
->bytes_readonly
-= block_group
->key
.offset
;
7584 block_group
->space_info
->disk_total
-= block_group
->key
.offset
* factor
;
7585 spin_unlock(&block_group
->space_info
->lock
);
7587 memcpy(&key
, &block_group
->key
, sizeof(key
));
7589 btrfs_clear_space_info_full(root
->fs_info
);
7591 btrfs_put_block_group(block_group
);
7592 btrfs_put_block_group(block_group
);
7594 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
7600 ret
= btrfs_del_item(trans
, root
, path
);
7602 btrfs_free_path(path
);
7606 int btrfs_init_space_info(struct btrfs_fs_info
*fs_info
)
7608 struct btrfs_space_info
*space_info
;
7609 struct btrfs_super_block
*disk_super
;
7615 disk_super
= fs_info
->super_copy
;
7616 if (!btrfs_super_root(disk_super
))
7619 features
= btrfs_super_incompat_flags(disk_super
);
7620 if (features
& BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS
)
7623 flags
= BTRFS_BLOCK_GROUP_SYSTEM
;
7624 ret
= update_space_info(fs_info
, flags
, 0, 0, &space_info
);
7629 flags
= BTRFS_BLOCK_GROUP_METADATA
| BTRFS_BLOCK_GROUP_DATA
;
7630 ret
= update_space_info(fs_info
, flags
, 0, 0, &space_info
);
7632 flags
= BTRFS_BLOCK_GROUP_METADATA
;
7633 ret
= update_space_info(fs_info
, flags
, 0, 0, &space_info
);
7637 flags
= BTRFS_BLOCK_GROUP_DATA
;
7638 ret
= update_space_info(fs_info
, flags
, 0, 0, &space_info
);
7644 int btrfs_error_unpin_extent_range(struct btrfs_root
*root
, u64 start
, u64 end
)
7646 return unpin_extent_range(root
, start
, end
);
7649 int btrfs_error_discard_extent(struct btrfs_root
*root
, u64 bytenr
,
7650 u64 num_bytes
, u64
*actual_bytes
)
7652 return btrfs_discard_extent(root
, bytenr
, num_bytes
, actual_bytes
);
7655 int btrfs_trim_fs(struct btrfs_root
*root
, struct fstrim_range
*range
)
7657 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
7658 struct btrfs_block_group_cache
*cache
= NULL
;
7665 cache
= btrfs_lookup_block_group(fs_info
, range
->start
);
7668 if (cache
->key
.objectid
>= (range
->start
+ range
->len
)) {
7669 btrfs_put_block_group(cache
);
7673 start
= max(range
->start
, cache
->key
.objectid
);
7674 end
= min(range
->start
+ range
->len
,
7675 cache
->key
.objectid
+ cache
->key
.offset
);
7677 if (end
- start
>= range
->minlen
) {
7678 if (!block_group_cache_done(cache
)) {
7679 ret
= cache_block_group(cache
, NULL
, root
, 0);
7681 wait_block_group_cache_done(cache
);
7683 ret
= btrfs_trim_block_group(cache
,
7689 trimmed
+= group_trimmed
;
7691 btrfs_put_block_group(cache
);
7696 cache
= next_block_group(fs_info
->tree_root
, cache
);
7699 range
->len
= trimmed
;