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/sched/signal.h>
20 #include <linux/pagemap.h>
21 #include <linux/writeback.h>
22 #include <linux/blkdev.h>
23 #include <linux/sort.h>
24 #include <linux/rcupdate.h>
25 #include <linux/kthread.h>
26 #include <linux/slab.h>
27 #include <linux/ratelimit.h>
28 #include <linux/percpu_counter.h>
29 #include <linux/lockdep.h>
33 #include "print-tree.h"
37 #include "free-space-cache.h"
38 #include "free-space-tree.h"
42 #include "ref-verify.h"
44 #undef SCRAMBLE_DELAYED_REFS
47 * control flags for do_chunk_alloc's force field
48 * CHUNK_ALLOC_NO_FORCE means to only allocate a chunk
49 * if we really need one.
51 * CHUNK_ALLOC_LIMITED means to only try and allocate one
52 * if we have very few chunks already allocated. This is
53 * used as part of the clustering code to help make sure
54 * we have a good pool of storage to cluster in, without
55 * filling the FS with empty chunks
57 * CHUNK_ALLOC_FORCE means it must try to allocate one
61 CHUNK_ALLOC_NO_FORCE
= 0,
62 CHUNK_ALLOC_LIMITED
= 1,
63 CHUNK_ALLOC_FORCE
= 2,
66 static int __btrfs_free_extent(struct btrfs_trans_handle
*trans
,
67 struct btrfs_fs_info
*fs_info
,
68 struct btrfs_delayed_ref_node
*node
, u64 parent
,
69 u64 root_objectid
, u64 owner_objectid
,
70 u64 owner_offset
, int refs_to_drop
,
71 struct btrfs_delayed_extent_op
*extra_op
);
72 static void __run_delayed_extent_op(struct btrfs_delayed_extent_op
*extent_op
,
73 struct extent_buffer
*leaf
,
74 struct btrfs_extent_item
*ei
);
75 static int alloc_reserved_file_extent(struct btrfs_trans_handle
*trans
,
76 struct btrfs_fs_info
*fs_info
,
77 u64 parent
, u64 root_objectid
,
78 u64 flags
, u64 owner
, u64 offset
,
79 struct btrfs_key
*ins
, int ref_mod
);
80 static int alloc_reserved_tree_block(struct btrfs_trans_handle
*trans
,
81 struct btrfs_fs_info
*fs_info
,
82 u64 parent
, u64 root_objectid
,
83 u64 flags
, struct btrfs_disk_key
*key
,
84 int level
, struct btrfs_key
*ins
);
85 static int do_chunk_alloc(struct btrfs_trans_handle
*trans
,
86 struct btrfs_fs_info
*fs_info
, u64 flags
,
88 static int find_next_key(struct btrfs_path
*path
, int level
,
89 struct btrfs_key
*key
);
90 static void dump_space_info(struct btrfs_fs_info
*fs_info
,
91 struct btrfs_space_info
*info
, u64 bytes
,
92 int dump_block_groups
);
93 static int block_rsv_use_bytes(struct btrfs_block_rsv
*block_rsv
,
95 static void space_info_add_new_bytes(struct btrfs_fs_info
*fs_info
,
96 struct btrfs_space_info
*space_info
,
98 static void space_info_add_old_bytes(struct btrfs_fs_info
*fs_info
,
99 struct btrfs_space_info
*space_info
,
103 block_group_cache_done(struct btrfs_block_group_cache
*cache
)
106 return cache
->cached
== BTRFS_CACHE_FINISHED
||
107 cache
->cached
== BTRFS_CACHE_ERROR
;
110 static int block_group_bits(struct btrfs_block_group_cache
*cache
, u64 bits
)
112 return (cache
->flags
& bits
) == bits
;
115 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);
127 * If not empty, someone is still holding mutex of
128 * full_stripe_lock, which can only be released by caller.
129 * And it will definitely cause use-after-free when caller
130 * tries to release full stripe lock.
132 * No better way to resolve, but only to warn.
134 WARN_ON(!RB_EMPTY_ROOT(&cache
->full_stripe_locks_root
.root
));
135 kfree(cache
->free_space_ctl
);
141 * this adds the block group to the fs_info rb tree for the block group
144 static int btrfs_add_block_group_cache(struct btrfs_fs_info
*info
,
145 struct btrfs_block_group_cache
*block_group
)
148 struct rb_node
*parent
= NULL
;
149 struct btrfs_block_group_cache
*cache
;
151 spin_lock(&info
->block_group_cache_lock
);
152 p
= &info
->block_group_cache_tree
.rb_node
;
156 cache
= rb_entry(parent
, struct btrfs_block_group_cache
,
158 if (block_group
->key
.objectid
< cache
->key
.objectid
) {
160 } else if (block_group
->key
.objectid
> cache
->key
.objectid
) {
163 spin_unlock(&info
->block_group_cache_lock
);
168 rb_link_node(&block_group
->cache_node
, parent
, p
);
169 rb_insert_color(&block_group
->cache_node
,
170 &info
->block_group_cache_tree
);
172 if (info
->first_logical_byte
> block_group
->key
.objectid
)
173 info
->first_logical_byte
= block_group
->key
.objectid
;
175 spin_unlock(&info
->block_group_cache_lock
);
181 * This will return the block group at or after bytenr if contains is 0, else
182 * it will return the block group that contains the bytenr
184 static struct btrfs_block_group_cache
*
185 block_group_cache_tree_search(struct btrfs_fs_info
*info
, u64 bytenr
,
188 struct btrfs_block_group_cache
*cache
, *ret
= NULL
;
192 spin_lock(&info
->block_group_cache_lock
);
193 n
= info
->block_group_cache_tree
.rb_node
;
196 cache
= rb_entry(n
, struct btrfs_block_group_cache
,
198 end
= cache
->key
.objectid
+ cache
->key
.offset
- 1;
199 start
= cache
->key
.objectid
;
201 if (bytenr
< start
) {
202 if (!contains
&& (!ret
|| start
< ret
->key
.objectid
))
205 } else if (bytenr
> start
) {
206 if (contains
&& bytenr
<= end
) {
217 btrfs_get_block_group(ret
);
218 if (bytenr
== 0 && info
->first_logical_byte
> ret
->key
.objectid
)
219 info
->first_logical_byte
= ret
->key
.objectid
;
221 spin_unlock(&info
->block_group_cache_lock
);
226 static int add_excluded_extent(struct btrfs_fs_info
*fs_info
,
227 u64 start
, u64 num_bytes
)
229 u64 end
= start
+ num_bytes
- 1;
230 set_extent_bits(&fs_info
->freed_extents
[0],
231 start
, end
, EXTENT_UPTODATE
);
232 set_extent_bits(&fs_info
->freed_extents
[1],
233 start
, end
, EXTENT_UPTODATE
);
237 static void free_excluded_extents(struct btrfs_fs_info
*fs_info
,
238 struct btrfs_block_group_cache
*cache
)
242 start
= cache
->key
.objectid
;
243 end
= start
+ cache
->key
.offset
- 1;
245 clear_extent_bits(&fs_info
->freed_extents
[0],
246 start
, end
, EXTENT_UPTODATE
);
247 clear_extent_bits(&fs_info
->freed_extents
[1],
248 start
, end
, EXTENT_UPTODATE
);
251 static int exclude_super_stripes(struct btrfs_fs_info
*fs_info
,
252 struct btrfs_block_group_cache
*cache
)
259 if (cache
->key
.objectid
< BTRFS_SUPER_INFO_OFFSET
) {
260 stripe_len
= BTRFS_SUPER_INFO_OFFSET
- cache
->key
.objectid
;
261 cache
->bytes_super
+= stripe_len
;
262 ret
= add_excluded_extent(fs_info
, cache
->key
.objectid
,
268 for (i
= 0; i
< BTRFS_SUPER_MIRROR_MAX
; i
++) {
269 bytenr
= btrfs_sb_offset(i
);
270 ret
= btrfs_rmap_block(fs_info
, cache
->key
.objectid
,
271 bytenr
, 0, &logical
, &nr
, &stripe_len
);
278 if (logical
[nr
] > cache
->key
.objectid
+
282 if (logical
[nr
] + stripe_len
<= cache
->key
.objectid
)
286 if (start
< cache
->key
.objectid
) {
287 start
= cache
->key
.objectid
;
288 len
= (logical
[nr
] + stripe_len
) - start
;
290 len
= min_t(u64
, stripe_len
,
291 cache
->key
.objectid
+
292 cache
->key
.offset
- start
);
295 cache
->bytes_super
+= len
;
296 ret
= add_excluded_extent(fs_info
, start
, len
);
308 static struct btrfs_caching_control
*
309 get_caching_control(struct btrfs_block_group_cache
*cache
)
311 struct btrfs_caching_control
*ctl
;
313 spin_lock(&cache
->lock
);
314 if (!cache
->caching_ctl
) {
315 spin_unlock(&cache
->lock
);
319 ctl
= cache
->caching_ctl
;
320 refcount_inc(&ctl
->count
);
321 spin_unlock(&cache
->lock
);
325 static void put_caching_control(struct btrfs_caching_control
*ctl
)
327 if (refcount_dec_and_test(&ctl
->count
))
331 #ifdef CONFIG_BTRFS_DEBUG
332 static void fragment_free_space(struct btrfs_block_group_cache
*block_group
)
334 struct btrfs_fs_info
*fs_info
= block_group
->fs_info
;
335 u64 start
= block_group
->key
.objectid
;
336 u64 len
= block_group
->key
.offset
;
337 u64 chunk
= block_group
->flags
& BTRFS_BLOCK_GROUP_METADATA
?
338 fs_info
->nodesize
: fs_info
->sectorsize
;
339 u64 step
= chunk
<< 1;
341 while (len
> chunk
) {
342 btrfs_remove_free_space(block_group
, start
, chunk
);
353 * this is only called by cache_block_group, since we could have freed extents
354 * we need to check the pinned_extents for any extents that can't be used yet
355 * since their free space will be released as soon as the transaction commits.
357 u64
add_new_free_space(struct btrfs_block_group_cache
*block_group
,
358 struct btrfs_fs_info
*info
, u64 start
, u64 end
)
360 u64 extent_start
, extent_end
, size
, total_added
= 0;
363 while (start
< end
) {
364 ret
= find_first_extent_bit(info
->pinned_extents
, start
,
365 &extent_start
, &extent_end
,
366 EXTENT_DIRTY
| EXTENT_UPTODATE
,
371 if (extent_start
<= start
) {
372 start
= extent_end
+ 1;
373 } else if (extent_start
> start
&& extent_start
< end
) {
374 size
= extent_start
- start
;
376 ret
= btrfs_add_free_space(block_group
, start
,
378 BUG_ON(ret
); /* -ENOMEM or logic error */
379 start
= extent_end
+ 1;
388 ret
= btrfs_add_free_space(block_group
, start
, size
);
389 BUG_ON(ret
); /* -ENOMEM or logic error */
395 static int load_extent_tree_free(struct btrfs_caching_control
*caching_ctl
)
397 struct btrfs_block_group_cache
*block_group
= caching_ctl
->block_group
;
398 struct btrfs_fs_info
*fs_info
= block_group
->fs_info
;
399 struct btrfs_root
*extent_root
= fs_info
->extent_root
;
400 struct btrfs_path
*path
;
401 struct extent_buffer
*leaf
;
402 struct btrfs_key key
;
409 path
= btrfs_alloc_path();
413 last
= max_t(u64
, block_group
->key
.objectid
, BTRFS_SUPER_INFO_OFFSET
);
415 #ifdef CONFIG_BTRFS_DEBUG
417 * If we're fragmenting we don't want to make anybody think we can
418 * allocate from this block group until we've had a chance to fragment
421 if (btrfs_should_fragment_free_space(block_group
))
425 * We don't want to deadlock with somebody trying to allocate a new
426 * extent for the extent root while also trying to search the extent
427 * root to add free space. So we skip locking and search the commit
428 * root, since its read-only
430 path
->skip_locking
= 1;
431 path
->search_commit_root
= 1;
432 path
->reada
= READA_FORWARD
;
436 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
439 ret
= btrfs_search_slot(NULL
, extent_root
, &key
, path
, 0, 0);
443 leaf
= path
->nodes
[0];
444 nritems
= btrfs_header_nritems(leaf
);
447 if (btrfs_fs_closing(fs_info
) > 1) {
452 if (path
->slots
[0] < nritems
) {
453 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
455 ret
= find_next_key(path
, 0, &key
);
459 if (need_resched() ||
460 rwsem_is_contended(&fs_info
->commit_root_sem
)) {
462 caching_ctl
->progress
= last
;
463 btrfs_release_path(path
);
464 up_read(&fs_info
->commit_root_sem
);
465 mutex_unlock(&caching_ctl
->mutex
);
467 mutex_lock(&caching_ctl
->mutex
);
468 down_read(&fs_info
->commit_root_sem
);
472 ret
= btrfs_next_leaf(extent_root
, path
);
477 leaf
= path
->nodes
[0];
478 nritems
= btrfs_header_nritems(leaf
);
482 if (key
.objectid
< last
) {
485 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
488 caching_ctl
->progress
= last
;
489 btrfs_release_path(path
);
493 if (key
.objectid
< block_group
->key
.objectid
) {
498 if (key
.objectid
>= block_group
->key
.objectid
+
499 block_group
->key
.offset
)
502 if (key
.type
== BTRFS_EXTENT_ITEM_KEY
||
503 key
.type
== BTRFS_METADATA_ITEM_KEY
) {
504 total_found
+= add_new_free_space(block_group
,
507 if (key
.type
== BTRFS_METADATA_ITEM_KEY
)
508 last
= key
.objectid
+
511 last
= key
.objectid
+ key
.offset
;
513 if (total_found
> CACHING_CTL_WAKE_UP
) {
516 wake_up(&caching_ctl
->wait
);
523 total_found
+= add_new_free_space(block_group
, fs_info
, last
,
524 block_group
->key
.objectid
+
525 block_group
->key
.offset
);
526 caching_ctl
->progress
= (u64
)-1;
529 btrfs_free_path(path
);
533 static noinline
void caching_thread(struct btrfs_work
*work
)
535 struct btrfs_block_group_cache
*block_group
;
536 struct btrfs_fs_info
*fs_info
;
537 struct btrfs_caching_control
*caching_ctl
;
538 struct btrfs_root
*extent_root
;
541 caching_ctl
= container_of(work
, struct btrfs_caching_control
, work
);
542 block_group
= caching_ctl
->block_group
;
543 fs_info
= block_group
->fs_info
;
544 extent_root
= fs_info
->extent_root
;
546 mutex_lock(&caching_ctl
->mutex
);
547 down_read(&fs_info
->commit_root_sem
);
549 if (btrfs_fs_compat_ro(fs_info
, FREE_SPACE_TREE
))
550 ret
= load_free_space_tree(caching_ctl
);
552 ret
= load_extent_tree_free(caching_ctl
);
554 spin_lock(&block_group
->lock
);
555 block_group
->caching_ctl
= NULL
;
556 block_group
->cached
= ret
? BTRFS_CACHE_ERROR
: BTRFS_CACHE_FINISHED
;
557 spin_unlock(&block_group
->lock
);
559 #ifdef CONFIG_BTRFS_DEBUG
560 if (btrfs_should_fragment_free_space(block_group
)) {
563 spin_lock(&block_group
->space_info
->lock
);
564 spin_lock(&block_group
->lock
);
565 bytes_used
= block_group
->key
.offset
-
566 btrfs_block_group_used(&block_group
->item
);
567 block_group
->space_info
->bytes_used
+= bytes_used
>> 1;
568 spin_unlock(&block_group
->lock
);
569 spin_unlock(&block_group
->space_info
->lock
);
570 fragment_free_space(block_group
);
574 caching_ctl
->progress
= (u64
)-1;
576 up_read(&fs_info
->commit_root_sem
);
577 free_excluded_extents(fs_info
, block_group
);
578 mutex_unlock(&caching_ctl
->mutex
);
580 wake_up(&caching_ctl
->wait
);
582 put_caching_control(caching_ctl
);
583 btrfs_put_block_group(block_group
);
586 static int cache_block_group(struct btrfs_block_group_cache
*cache
,
590 struct btrfs_fs_info
*fs_info
= cache
->fs_info
;
591 struct btrfs_caching_control
*caching_ctl
;
594 caching_ctl
= kzalloc(sizeof(*caching_ctl
), GFP_NOFS
);
598 INIT_LIST_HEAD(&caching_ctl
->list
);
599 mutex_init(&caching_ctl
->mutex
);
600 init_waitqueue_head(&caching_ctl
->wait
);
601 caching_ctl
->block_group
= cache
;
602 caching_ctl
->progress
= cache
->key
.objectid
;
603 refcount_set(&caching_ctl
->count
, 1);
604 btrfs_init_work(&caching_ctl
->work
, btrfs_cache_helper
,
605 caching_thread
, NULL
, NULL
);
607 spin_lock(&cache
->lock
);
609 * This should be a rare occasion, but this could happen I think in the
610 * case where one thread starts to load the space cache info, and then
611 * some other thread starts a transaction commit which tries to do an
612 * allocation while the other thread is still loading the space cache
613 * info. The previous loop should have kept us from choosing this block
614 * group, but if we've moved to the state where we will wait on caching
615 * block groups we need to first check if we're doing a fast load here,
616 * so we can wait for it to finish, otherwise we could end up allocating
617 * from a block group who's cache gets evicted for one reason or
620 while (cache
->cached
== BTRFS_CACHE_FAST
) {
621 struct btrfs_caching_control
*ctl
;
623 ctl
= cache
->caching_ctl
;
624 refcount_inc(&ctl
->count
);
625 prepare_to_wait(&ctl
->wait
, &wait
, TASK_UNINTERRUPTIBLE
);
626 spin_unlock(&cache
->lock
);
630 finish_wait(&ctl
->wait
, &wait
);
631 put_caching_control(ctl
);
632 spin_lock(&cache
->lock
);
635 if (cache
->cached
!= BTRFS_CACHE_NO
) {
636 spin_unlock(&cache
->lock
);
640 WARN_ON(cache
->caching_ctl
);
641 cache
->caching_ctl
= caching_ctl
;
642 cache
->cached
= BTRFS_CACHE_FAST
;
643 spin_unlock(&cache
->lock
);
645 if (btrfs_test_opt(fs_info
, SPACE_CACHE
)) {
646 mutex_lock(&caching_ctl
->mutex
);
647 ret
= load_free_space_cache(fs_info
, cache
);
649 spin_lock(&cache
->lock
);
651 cache
->caching_ctl
= NULL
;
652 cache
->cached
= BTRFS_CACHE_FINISHED
;
653 cache
->last_byte_to_unpin
= (u64
)-1;
654 caching_ctl
->progress
= (u64
)-1;
656 if (load_cache_only
) {
657 cache
->caching_ctl
= NULL
;
658 cache
->cached
= BTRFS_CACHE_NO
;
660 cache
->cached
= BTRFS_CACHE_STARTED
;
661 cache
->has_caching_ctl
= 1;
664 spin_unlock(&cache
->lock
);
665 #ifdef CONFIG_BTRFS_DEBUG
667 btrfs_should_fragment_free_space(cache
)) {
670 spin_lock(&cache
->space_info
->lock
);
671 spin_lock(&cache
->lock
);
672 bytes_used
= cache
->key
.offset
-
673 btrfs_block_group_used(&cache
->item
);
674 cache
->space_info
->bytes_used
+= bytes_used
>> 1;
675 spin_unlock(&cache
->lock
);
676 spin_unlock(&cache
->space_info
->lock
);
677 fragment_free_space(cache
);
680 mutex_unlock(&caching_ctl
->mutex
);
682 wake_up(&caching_ctl
->wait
);
684 put_caching_control(caching_ctl
);
685 free_excluded_extents(fs_info
, cache
);
690 * We're either using the free space tree or no caching at all.
691 * Set cached to the appropriate value and wakeup any waiters.
693 spin_lock(&cache
->lock
);
694 if (load_cache_only
) {
695 cache
->caching_ctl
= NULL
;
696 cache
->cached
= BTRFS_CACHE_NO
;
698 cache
->cached
= BTRFS_CACHE_STARTED
;
699 cache
->has_caching_ctl
= 1;
701 spin_unlock(&cache
->lock
);
702 wake_up(&caching_ctl
->wait
);
705 if (load_cache_only
) {
706 put_caching_control(caching_ctl
);
710 down_write(&fs_info
->commit_root_sem
);
711 refcount_inc(&caching_ctl
->count
);
712 list_add_tail(&caching_ctl
->list
, &fs_info
->caching_block_groups
);
713 up_write(&fs_info
->commit_root_sem
);
715 btrfs_get_block_group(cache
);
717 btrfs_queue_work(fs_info
->caching_workers
, &caching_ctl
->work
);
723 * return the block group that starts at or after bytenr
725 static struct btrfs_block_group_cache
*
726 btrfs_lookup_first_block_group(struct btrfs_fs_info
*info
, u64 bytenr
)
728 return block_group_cache_tree_search(info
, bytenr
, 0);
732 * return the block group that contains the given bytenr
734 struct btrfs_block_group_cache
*btrfs_lookup_block_group(
735 struct btrfs_fs_info
*info
,
738 return block_group_cache_tree_search(info
, bytenr
, 1);
741 static struct btrfs_space_info
*__find_space_info(struct btrfs_fs_info
*info
,
744 struct list_head
*head
= &info
->space_info
;
745 struct btrfs_space_info
*found
;
747 flags
&= BTRFS_BLOCK_GROUP_TYPE_MASK
;
750 list_for_each_entry_rcu(found
, head
, list
) {
751 if (found
->flags
& flags
) {
760 static void add_pinned_bytes(struct btrfs_fs_info
*fs_info
, s64 num_bytes
,
761 u64 owner
, u64 root_objectid
)
763 struct btrfs_space_info
*space_info
;
766 if (owner
< BTRFS_FIRST_FREE_OBJECTID
) {
767 if (root_objectid
== BTRFS_CHUNK_TREE_OBJECTID
)
768 flags
= BTRFS_BLOCK_GROUP_SYSTEM
;
770 flags
= BTRFS_BLOCK_GROUP_METADATA
;
772 flags
= BTRFS_BLOCK_GROUP_DATA
;
775 space_info
= __find_space_info(fs_info
, flags
);
777 percpu_counter_add(&space_info
->total_bytes_pinned
, num_bytes
);
781 * after adding space to the filesystem, we need to clear the full flags
782 * on all the space infos.
784 void btrfs_clear_space_info_full(struct btrfs_fs_info
*info
)
786 struct list_head
*head
= &info
->space_info
;
787 struct btrfs_space_info
*found
;
790 list_for_each_entry_rcu(found
, head
, list
)
795 /* simple helper to search for an existing data extent at a given offset */
796 int btrfs_lookup_data_extent(struct btrfs_fs_info
*fs_info
, u64 start
, u64 len
)
799 struct btrfs_key key
;
800 struct btrfs_path
*path
;
802 path
= btrfs_alloc_path();
806 key
.objectid
= start
;
808 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
809 ret
= btrfs_search_slot(NULL
, fs_info
->extent_root
, &key
, path
, 0, 0);
810 btrfs_free_path(path
);
815 * helper function to lookup reference count and flags of a tree block.
817 * the head node for delayed ref is used to store the sum of all the
818 * reference count modifications queued up in the rbtree. the head
819 * node may also store the extent flags to set. This way you can check
820 * to see what the reference count and extent flags would be if all of
821 * the delayed refs are not processed.
823 int btrfs_lookup_extent_info(struct btrfs_trans_handle
*trans
,
824 struct btrfs_fs_info
*fs_info
, u64 bytenr
,
825 u64 offset
, int metadata
, u64
*refs
, u64
*flags
)
827 struct btrfs_delayed_ref_head
*head
;
828 struct btrfs_delayed_ref_root
*delayed_refs
;
829 struct btrfs_path
*path
;
830 struct btrfs_extent_item
*ei
;
831 struct extent_buffer
*leaf
;
832 struct btrfs_key key
;
839 * If we don't have skinny metadata, don't bother doing anything
842 if (metadata
&& !btrfs_fs_incompat(fs_info
, SKINNY_METADATA
)) {
843 offset
= fs_info
->nodesize
;
847 path
= btrfs_alloc_path();
852 path
->skip_locking
= 1;
853 path
->search_commit_root
= 1;
857 key
.objectid
= bytenr
;
860 key
.type
= BTRFS_METADATA_ITEM_KEY
;
862 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
864 ret
= btrfs_search_slot(trans
, fs_info
->extent_root
, &key
, path
, 0, 0);
868 if (ret
> 0 && metadata
&& key
.type
== BTRFS_METADATA_ITEM_KEY
) {
869 if (path
->slots
[0]) {
871 btrfs_item_key_to_cpu(path
->nodes
[0], &key
,
873 if (key
.objectid
== bytenr
&&
874 key
.type
== BTRFS_EXTENT_ITEM_KEY
&&
875 key
.offset
== fs_info
->nodesize
)
881 leaf
= path
->nodes
[0];
882 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
883 if (item_size
>= sizeof(*ei
)) {
884 ei
= btrfs_item_ptr(leaf
, path
->slots
[0],
885 struct btrfs_extent_item
);
886 num_refs
= btrfs_extent_refs(leaf
, ei
);
887 extent_flags
= btrfs_extent_flags(leaf
, ei
);
889 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
890 struct btrfs_extent_item_v0
*ei0
;
891 BUG_ON(item_size
!= sizeof(*ei0
));
892 ei0
= btrfs_item_ptr(leaf
, path
->slots
[0],
893 struct btrfs_extent_item_v0
);
894 num_refs
= btrfs_extent_refs_v0(leaf
, ei0
);
895 /* FIXME: this isn't correct for data */
896 extent_flags
= BTRFS_BLOCK_FLAG_FULL_BACKREF
;
901 BUG_ON(num_refs
== 0);
911 delayed_refs
= &trans
->transaction
->delayed_refs
;
912 spin_lock(&delayed_refs
->lock
);
913 head
= btrfs_find_delayed_ref_head(delayed_refs
, bytenr
);
915 if (!mutex_trylock(&head
->mutex
)) {
916 refcount_inc(&head
->refs
);
917 spin_unlock(&delayed_refs
->lock
);
919 btrfs_release_path(path
);
922 * Mutex was contended, block until it's released and try
925 mutex_lock(&head
->mutex
);
926 mutex_unlock(&head
->mutex
);
927 btrfs_put_delayed_ref_head(head
);
930 spin_lock(&head
->lock
);
931 if (head
->extent_op
&& head
->extent_op
->update_flags
)
932 extent_flags
|= head
->extent_op
->flags_to_set
;
934 BUG_ON(num_refs
== 0);
936 num_refs
+= head
->ref_mod
;
937 spin_unlock(&head
->lock
);
938 mutex_unlock(&head
->mutex
);
940 spin_unlock(&delayed_refs
->lock
);
942 WARN_ON(num_refs
== 0);
946 *flags
= extent_flags
;
948 btrfs_free_path(path
);
953 * Back reference rules. Back refs have three main goals:
955 * 1) differentiate between all holders of references to an extent so that
956 * when a reference is dropped we can make sure it was a valid reference
957 * before freeing the extent.
959 * 2) Provide enough information to quickly find the holders of an extent
960 * if we notice a given block is corrupted or bad.
962 * 3) Make it easy to migrate blocks for FS shrinking or storage pool
963 * maintenance. This is actually the same as #2, but with a slightly
964 * different use case.
966 * There are two kinds of back refs. The implicit back refs is optimized
967 * for pointers in non-shared tree blocks. For a given pointer in a block,
968 * back refs of this kind provide information about the block's owner tree
969 * and the pointer's key. These information allow us to find the block by
970 * b-tree searching. The full back refs is for pointers in tree blocks not
971 * referenced by their owner trees. The location of tree block is recorded
972 * in the back refs. Actually the full back refs is generic, and can be
973 * used in all cases the implicit back refs is used. The major shortcoming
974 * of the full back refs is its overhead. Every time a tree block gets
975 * COWed, we have to update back refs entry for all pointers in it.
977 * For a newly allocated tree block, we use implicit back refs for
978 * pointers in it. This means most tree related operations only involve
979 * implicit back refs. For a tree block created in old transaction, the
980 * only way to drop a reference to it is COW it. So we can detect the
981 * event that tree block loses its owner tree's reference and do the
982 * back refs conversion.
984 * When a tree block is COWed through a tree, there are four cases:
986 * The reference count of the block is one and the tree is the block's
987 * owner tree. Nothing to do in this case.
989 * The reference count of the block is one and the tree is not the
990 * block's owner tree. In this case, full back refs is used for pointers
991 * in the block. Remove these full back refs, add implicit back refs for
992 * every pointers in the new block.
994 * The reference count of the block is greater than one and the tree is
995 * the block's owner tree. In this case, implicit back refs is used for
996 * pointers in the block. Add full back refs for every pointers in the
997 * block, increase lower level extents' reference counts. The original
998 * implicit back refs are entailed to the new block.
1000 * The reference count of the block is greater than one and the tree is
1001 * not the block's owner tree. Add implicit back refs for every pointer in
1002 * the new block, increase lower level extents' reference count.
1004 * Back Reference Key composing:
1006 * The key objectid corresponds to the first byte in the extent,
1007 * The key type is used to differentiate between types of back refs.
1008 * There are different meanings of the key offset for different types
1011 * File extents can be referenced by:
1013 * - multiple snapshots, subvolumes, or different generations in one subvol
1014 * - different files inside a single subvolume
1015 * - different offsets inside a file (bookend extents in file.c)
1017 * The extent ref structure for the implicit back refs has fields for:
1019 * - Objectid of the subvolume root
1020 * - objectid of the file holding the reference
1021 * - original offset in the file
1022 * - how many bookend extents
1024 * The key offset for the implicit back refs is hash of the first
1027 * The extent ref structure for the full back refs has field for:
1029 * - number of pointers in the tree leaf
1031 * The key offset for the implicit back refs is the first byte of
1034 * When a file extent is allocated, The implicit back refs is used.
1035 * the fields are filled in:
1037 * (root_key.objectid, inode objectid, offset in file, 1)
1039 * When a file extent is removed file truncation, we find the
1040 * corresponding implicit back refs and check the following fields:
1042 * (btrfs_header_owner(leaf), inode objectid, offset in file)
1044 * Btree extents can be referenced by:
1046 * - Different subvolumes
1048 * Both the implicit back refs and the full back refs for tree blocks
1049 * only consist of key. The key offset for the implicit back refs is
1050 * objectid of block's owner tree. The key offset for the full back refs
1051 * is the first byte of parent block.
1053 * When implicit back refs is used, information about the lowest key and
1054 * level of the tree block are required. These information are stored in
1055 * tree block info structure.
1058 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1059 static int convert_extent_item_v0(struct btrfs_trans_handle
*trans
,
1060 struct btrfs_fs_info
*fs_info
,
1061 struct btrfs_path
*path
,
1062 u64 owner
, u32 extra_size
)
1064 struct btrfs_root
*root
= fs_info
->extent_root
;
1065 struct btrfs_extent_item
*item
;
1066 struct btrfs_extent_item_v0
*ei0
;
1067 struct btrfs_extent_ref_v0
*ref0
;
1068 struct btrfs_tree_block_info
*bi
;
1069 struct extent_buffer
*leaf
;
1070 struct btrfs_key key
;
1071 struct btrfs_key found_key
;
1072 u32 new_size
= sizeof(*item
);
1076 leaf
= path
->nodes
[0];
1077 BUG_ON(btrfs_item_size_nr(leaf
, path
->slots
[0]) != sizeof(*ei0
));
1079 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
1080 ei0
= btrfs_item_ptr(leaf
, path
->slots
[0],
1081 struct btrfs_extent_item_v0
);
1082 refs
= btrfs_extent_refs_v0(leaf
, ei0
);
1084 if (owner
== (u64
)-1) {
1086 if (path
->slots
[0] >= btrfs_header_nritems(leaf
)) {
1087 ret
= btrfs_next_leaf(root
, path
);
1090 BUG_ON(ret
> 0); /* Corruption */
1091 leaf
= path
->nodes
[0];
1093 btrfs_item_key_to_cpu(leaf
, &found_key
,
1095 BUG_ON(key
.objectid
!= found_key
.objectid
);
1096 if (found_key
.type
!= BTRFS_EXTENT_REF_V0_KEY
) {
1100 ref0
= btrfs_item_ptr(leaf
, path
->slots
[0],
1101 struct btrfs_extent_ref_v0
);
1102 owner
= btrfs_ref_objectid_v0(leaf
, ref0
);
1106 btrfs_release_path(path
);
1108 if (owner
< BTRFS_FIRST_FREE_OBJECTID
)
1109 new_size
+= sizeof(*bi
);
1111 new_size
-= sizeof(*ei0
);
1112 ret
= btrfs_search_slot(trans
, root
, &key
, path
,
1113 new_size
+ extra_size
, 1);
1116 BUG_ON(ret
); /* Corruption */
1118 btrfs_extend_item(fs_info
, path
, new_size
);
1120 leaf
= path
->nodes
[0];
1121 item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
1122 btrfs_set_extent_refs(leaf
, item
, refs
);
1123 /* FIXME: get real generation */
1124 btrfs_set_extent_generation(leaf
, item
, 0);
1125 if (owner
< BTRFS_FIRST_FREE_OBJECTID
) {
1126 btrfs_set_extent_flags(leaf
, item
,
1127 BTRFS_EXTENT_FLAG_TREE_BLOCK
|
1128 BTRFS_BLOCK_FLAG_FULL_BACKREF
);
1129 bi
= (struct btrfs_tree_block_info
*)(item
+ 1);
1130 /* FIXME: get first key of the block */
1131 memzero_extent_buffer(leaf
, (unsigned long)bi
, sizeof(*bi
));
1132 btrfs_set_tree_block_level(leaf
, bi
, (int)owner
);
1134 btrfs_set_extent_flags(leaf
, item
, BTRFS_EXTENT_FLAG_DATA
);
1136 btrfs_mark_buffer_dirty(leaf
);
1142 * is_data == BTRFS_REF_TYPE_BLOCK, tree block type is required,
1143 * is_data == BTRFS_REF_TYPE_DATA, data type is requried,
1144 * is_data == BTRFS_REF_TYPE_ANY, either type is OK.
1146 int btrfs_get_extent_inline_ref_type(const struct extent_buffer
*eb
,
1147 struct btrfs_extent_inline_ref
*iref
,
1148 enum btrfs_inline_ref_type is_data
)
1150 int type
= btrfs_extent_inline_ref_type(eb
, iref
);
1151 u64 offset
= btrfs_extent_inline_ref_offset(eb
, iref
);
1153 if (type
== BTRFS_TREE_BLOCK_REF_KEY
||
1154 type
== BTRFS_SHARED_BLOCK_REF_KEY
||
1155 type
== BTRFS_SHARED_DATA_REF_KEY
||
1156 type
== BTRFS_EXTENT_DATA_REF_KEY
) {
1157 if (is_data
== BTRFS_REF_TYPE_BLOCK
) {
1158 if (type
== BTRFS_TREE_BLOCK_REF_KEY
)
1160 if (type
== BTRFS_SHARED_BLOCK_REF_KEY
) {
1161 ASSERT(eb
->fs_info
);
1163 * Every shared one has parent tree
1164 * block, which must be aligned to
1168 IS_ALIGNED(offset
, eb
->fs_info
->nodesize
))
1171 } else if (is_data
== BTRFS_REF_TYPE_DATA
) {
1172 if (type
== BTRFS_EXTENT_DATA_REF_KEY
)
1174 if (type
== BTRFS_SHARED_DATA_REF_KEY
) {
1175 ASSERT(eb
->fs_info
);
1177 * Every shared one has parent tree
1178 * block, which must be aligned to
1182 IS_ALIGNED(offset
, eb
->fs_info
->nodesize
))
1186 ASSERT(is_data
== BTRFS_REF_TYPE_ANY
);
1191 btrfs_print_leaf((struct extent_buffer
*)eb
);
1192 btrfs_err(eb
->fs_info
, "eb %llu invalid extent inline ref type %d",
1196 return BTRFS_REF_TYPE_INVALID
;
1199 static u64
hash_extent_data_ref(u64 root_objectid
, u64 owner
, u64 offset
)
1201 u32 high_crc
= ~(u32
)0;
1202 u32 low_crc
= ~(u32
)0;
1205 lenum
= cpu_to_le64(root_objectid
);
1206 high_crc
= btrfs_crc32c(high_crc
, &lenum
, sizeof(lenum
));
1207 lenum
= cpu_to_le64(owner
);
1208 low_crc
= btrfs_crc32c(low_crc
, &lenum
, sizeof(lenum
));
1209 lenum
= cpu_to_le64(offset
);
1210 low_crc
= btrfs_crc32c(low_crc
, &lenum
, sizeof(lenum
));
1212 return ((u64
)high_crc
<< 31) ^ (u64
)low_crc
;
1215 static u64
hash_extent_data_ref_item(struct extent_buffer
*leaf
,
1216 struct btrfs_extent_data_ref
*ref
)
1218 return hash_extent_data_ref(btrfs_extent_data_ref_root(leaf
, ref
),
1219 btrfs_extent_data_ref_objectid(leaf
, ref
),
1220 btrfs_extent_data_ref_offset(leaf
, ref
));
1223 static int match_extent_data_ref(struct extent_buffer
*leaf
,
1224 struct btrfs_extent_data_ref
*ref
,
1225 u64 root_objectid
, u64 owner
, u64 offset
)
1227 if (btrfs_extent_data_ref_root(leaf
, ref
) != root_objectid
||
1228 btrfs_extent_data_ref_objectid(leaf
, ref
) != owner
||
1229 btrfs_extent_data_ref_offset(leaf
, ref
) != offset
)
1234 static noinline
int lookup_extent_data_ref(struct btrfs_trans_handle
*trans
,
1235 struct btrfs_fs_info
*fs_info
,
1236 struct btrfs_path
*path
,
1237 u64 bytenr
, u64 parent
,
1239 u64 owner
, u64 offset
)
1241 struct btrfs_root
*root
= fs_info
->extent_root
;
1242 struct btrfs_key key
;
1243 struct btrfs_extent_data_ref
*ref
;
1244 struct extent_buffer
*leaf
;
1250 key
.objectid
= bytenr
;
1252 key
.type
= BTRFS_SHARED_DATA_REF_KEY
;
1253 key
.offset
= parent
;
1255 key
.type
= BTRFS_EXTENT_DATA_REF_KEY
;
1256 key
.offset
= hash_extent_data_ref(root_objectid
,
1261 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1270 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1271 key
.type
= BTRFS_EXTENT_REF_V0_KEY
;
1272 btrfs_release_path(path
);
1273 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1284 leaf
= path
->nodes
[0];
1285 nritems
= btrfs_header_nritems(leaf
);
1287 if (path
->slots
[0] >= nritems
) {
1288 ret
= btrfs_next_leaf(root
, path
);
1294 leaf
= path
->nodes
[0];
1295 nritems
= btrfs_header_nritems(leaf
);
1299 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
1300 if (key
.objectid
!= bytenr
||
1301 key
.type
!= BTRFS_EXTENT_DATA_REF_KEY
)
1304 ref
= btrfs_item_ptr(leaf
, path
->slots
[0],
1305 struct btrfs_extent_data_ref
);
1307 if (match_extent_data_ref(leaf
, ref
, root_objectid
,
1310 btrfs_release_path(path
);
1322 static noinline
int insert_extent_data_ref(struct btrfs_trans_handle
*trans
,
1323 struct btrfs_fs_info
*fs_info
,
1324 struct btrfs_path
*path
,
1325 u64 bytenr
, u64 parent
,
1326 u64 root_objectid
, u64 owner
,
1327 u64 offset
, int refs_to_add
)
1329 struct btrfs_root
*root
= fs_info
->extent_root
;
1330 struct btrfs_key key
;
1331 struct extent_buffer
*leaf
;
1336 key
.objectid
= bytenr
;
1338 key
.type
= BTRFS_SHARED_DATA_REF_KEY
;
1339 key
.offset
= parent
;
1340 size
= sizeof(struct btrfs_shared_data_ref
);
1342 key
.type
= BTRFS_EXTENT_DATA_REF_KEY
;
1343 key
.offset
= hash_extent_data_ref(root_objectid
,
1345 size
= sizeof(struct btrfs_extent_data_ref
);
1348 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
, size
);
1349 if (ret
&& ret
!= -EEXIST
)
1352 leaf
= path
->nodes
[0];
1354 struct btrfs_shared_data_ref
*ref
;
1355 ref
= btrfs_item_ptr(leaf
, path
->slots
[0],
1356 struct btrfs_shared_data_ref
);
1358 btrfs_set_shared_data_ref_count(leaf
, ref
, refs_to_add
);
1360 num_refs
= btrfs_shared_data_ref_count(leaf
, ref
);
1361 num_refs
+= refs_to_add
;
1362 btrfs_set_shared_data_ref_count(leaf
, ref
, num_refs
);
1365 struct btrfs_extent_data_ref
*ref
;
1366 while (ret
== -EEXIST
) {
1367 ref
= btrfs_item_ptr(leaf
, path
->slots
[0],
1368 struct btrfs_extent_data_ref
);
1369 if (match_extent_data_ref(leaf
, ref
, root_objectid
,
1372 btrfs_release_path(path
);
1374 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
1376 if (ret
&& ret
!= -EEXIST
)
1379 leaf
= path
->nodes
[0];
1381 ref
= btrfs_item_ptr(leaf
, path
->slots
[0],
1382 struct btrfs_extent_data_ref
);
1384 btrfs_set_extent_data_ref_root(leaf
, ref
,
1386 btrfs_set_extent_data_ref_objectid(leaf
, ref
, owner
);
1387 btrfs_set_extent_data_ref_offset(leaf
, ref
, offset
);
1388 btrfs_set_extent_data_ref_count(leaf
, ref
, refs_to_add
);
1390 num_refs
= btrfs_extent_data_ref_count(leaf
, ref
);
1391 num_refs
+= refs_to_add
;
1392 btrfs_set_extent_data_ref_count(leaf
, ref
, num_refs
);
1395 btrfs_mark_buffer_dirty(leaf
);
1398 btrfs_release_path(path
);
1402 static noinline
int remove_extent_data_ref(struct btrfs_trans_handle
*trans
,
1403 struct btrfs_fs_info
*fs_info
,
1404 struct btrfs_path
*path
,
1405 int refs_to_drop
, int *last_ref
)
1407 struct btrfs_key key
;
1408 struct btrfs_extent_data_ref
*ref1
= NULL
;
1409 struct btrfs_shared_data_ref
*ref2
= NULL
;
1410 struct extent_buffer
*leaf
;
1414 leaf
= path
->nodes
[0];
1415 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
1417 if (key
.type
== BTRFS_EXTENT_DATA_REF_KEY
) {
1418 ref1
= btrfs_item_ptr(leaf
, path
->slots
[0],
1419 struct btrfs_extent_data_ref
);
1420 num_refs
= btrfs_extent_data_ref_count(leaf
, ref1
);
1421 } else if (key
.type
== BTRFS_SHARED_DATA_REF_KEY
) {
1422 ref2
= btrfs_item_ptr(leaf
, path
->slots
[0],
1423 struct btrfs_shared_data_ref
);
1424 num_refs
= btrfs_shared_data_ref_count(leaf
, ref2
);
1425 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1426 } else if (key
.type
== BTRFS_EXTENT_REF_V0_KEY
) {
1427 struct btrfs_extent_ref_v0
*ref0
;
1428 ref0
= btrfs_item_ptr(leaf
, path
->slots
[0],
1429 struct btrfs_extent_ref_v0
);
1430 num_refs
= btrfs_ref_count_v0(leaf
, ref0
);
1436 BUG_ON(num_refs
< refs_to_drop
);
1437 num_refs
-= refs_to_drop
;
1439 if (num_refs
== 0) {
1440 ret
= btrfs_del_item(trans
, fs_info
->extent_root
, path
);
1443 if (key
.type
== BTRFS_EXTENT_DATA_REF_KEY
)
1444 btrfs_set_extent_data_ref_count(leaf
, ref1
, num_refs
);
1445 else if (key
.type
== BTRFS_SHARED_DATA_REF_KEY
)
1446 btrfs_set_shared_data_ref_count(leaf
, ref2
, num_refs
);
1447 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1449 struct btrfs_extent_ref_v0
*ref0
;
1450 ref0
= btrfs_item_ptr(leaf
, path
->slots
[0],
1451 struct btrfs_extent_ref_v0
);
1452 btrfs_set_ref_count_v0(leaf
, ref0
, num_refs
);
1455 btrfs_mark_buffer_dirty(leaf
);
1460 static noinline u32
extent_data_ref_count(struct btrfs_path
*path
,
1461 struct btrfs_extent_inline_ref
*iref
)
1463 struct btrfs_key key
;
1464 struct extent_buffer
*leaf
;
1465 struct btrfs_extent_data_ref
*ref1
;
1466 struct btrfs_shared_data_ref
*ref2
;
1470 leaf
= path
->nodes
[0];
1471 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
1474 * If type is invalid, we should have bailed out earlier than
1477 type
= btrfs_get_extent_inline_ref_type(leaf
, iref
, BTRFS_REF_TYPE_DATA
);
1478 ASSERT(type
!= BTRFS_REF_TYPE_INVALID
);
1479 if (type
== BTRFS_EXTENT_DATA_REF_KEY
) {
1480 ref1
= (struct btrfs_extent_data_ref
*)(&iref
->offset
);
1481 num_refs
= btrfs_extent_data_ref_count(leaf
, ref1
);
1483 ref2
= (struct btrfs_shared_data_ref
*)(iref
+ 1);
1484 num_refs
= btrfs_shared_data_ref_count(leaf
, ref2
);
1486 } else if (key
.type
== BTRFS_EXTENT_DATA_REF_KEY
) {
1487 ref1
= btrfs_item_ptr(leaf
, path
->slots
[0],
1488 struct btrfs_extent_data_ref
);
1489 num_refs
= btrfs_extent_data_ref_count(leaf
, ref1
);
1490 } else if (key
.type
== BTRFS_SHARED_DATA_REF_KEY
) {
1491 ref2
= btrfs_item_ptr(leaf
, path
->slots
[0],
1492 struct btrfs_shared_data_ref
);
1493 num_refs
= btrfs_shared_data_ref_count(leaf
, ref2
);
1494 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1495 } else if (key
.type
== BTRFS_EXTENT_REF_V0_KEY
) {
1496 struct btrfs_extent_ref_v0
*ref0
;
1497 ref0
= btrfs_item_ptr(leaf
, path
->slots
[0],
1498 struct btrfs_extent_ref_v0
);
1499 num_refs
= btrfs_ref_count_v0(leaf
, ref0
);
1507 static noinline
int lookup_tree_block_ref(struct btrfs_trans_handle
*trans
,
1508 struct btrfs_fs_info
*fs_info
,
1509 struct btrfs_path
*path
,
1510 u64 bytenr
, u64 parent
,
1513 struct btrfs_root
*root
= fs_info
->extent_root
;
1514 struct btrfs_key key
;
1517 key
.objectid
= bytenr
;
1519 key
.type
= BTRFS_SHARED_BLOCK_REF_KEY
;
1520 key
.offset
= parent
;
1522 key
.type
= BTRFS_TREE_BLOCK_REF_KEY
;
1523 key
.offset
= root_objectid
;
1526 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1529 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1530 if (ret
== -ENOENT
&& parent
) {
1531 btrfs_release_path(path
);
1532 key
.type
= BTRFS_EXTENT_REF_V0_KEY
;
1533 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1541 static noinline
int insert_tree_block_ref(struct btrfs_trans_handle
*trans
,
1542 struct btrfs_fs_info
*fs_info
,
1543 struct btrfs_path
*path
,
1544 u64 bytenr
, u64 parent
,
1547 struct btrfs_key key
;
1550 key
.objectid
= bytenr
;
1552 key
.type
= BTRFS_SHARED_BLOCK_REF_KEY
;
1553 key
.offset
= parent
;
1555 key
.type
= BTRFS_TREE_BLOCK_REF_KEY
;
1556 key
.offset
= root_objectid
;
1559 ret
= btrfs_insert_empty_item(trans
, fs_info
->extent_root
,
1561 btrfs_release_path(path
);
1565 static inline int extent_ref_type(u64 parent
, u64 owner
)
1568 if (owner
< BTRFS_FIRST_FREE_OBJECTID
) {
1570 type
= BTRFS_SHARED_BLOCK_REF_KEY
;
1572 type
= BTRFS_TREE_BLOCK_REF_KEY
;
1575 type
= BTRFS_SHARED_DATA_REF_KEY
;
1577 type
= BTRFS_EXTENT_DATA_REF_KEY
;
1582 static int find_next_key(struct btrfs_path
*path
, int level
,
1583 struct btrfs_key
*key
)
1586 for (; level
< BTRFS_MAX_LEVEL
; level
++) {
1587 if (!path
->nodes
[level
])
1589 if (path
->slots
[level
] + 1 >=
1590 btrfs_header_nritems(path
->nodes
[level
]))
1593 btrfs_item_key_to_cpu(path
->nodes
[level
], key
,
1594 path
->slots
[level
] + 1);
1596 btrfs_node_key_to_cpu(path
->nodes
[level
], key
,
1597 path
->slots
[level
] + 1);
1604 * look for inline back ref. if back ref is found, *ref_ret is set
1605 * to the address of inline back ref, and 0 is returned.
1607 * if back ref isn't found, *ref_ret is set to the address where it
1608 * should be inserted, and -ENOENT is returned.
1610 * if insert is true and there are too many inline back refs, the path
1611 * points to the extent item, and -EAGAIN is returned.
1613 * NOTE: inline back refs are ordered in the same way that back ref
1614 * items in the tree are ordered.
1616 static noinline_for_stack
1617 int lookup_inline_extent_backref(struct btrfs_trans_handle
*trans
,
1618 struct btrfs_fs_info
*fs_info
,
1619 struct btrfs_path
*path
,
1620 struct btrfs_extent_inline_ref
**ref_ret
,
1621 u64 bytenr
, u64 num_bytes
,
1622 u64 parent
, u64 root_objectid
,
1623 u64 owner
, u64 offset
, int insert
)
1625 struct btrfs_root
*root
= fs_info
->extent_root
;
1626 struct btrfs_key key
;
1627 struct extent_buffer
*leaf
;
1628 struct btrfs_extent_item
*ei
;
1629 struct btrfs_extent_inline_ref
*iref
;
1639 bool skinny_metadata
= btrfs_fs_incompat(fs_info
, SKINNY_METADATA
);
1642 key
.objectid
= bytenr
;
1643 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
1644 key
.offset
= num_bytes
;
1646 want
= extent_ref_type(parent
, owner
);
1648 extra_size
= btrfs_extent_inline_ref_size(want
);
1649 path
->keep_locks
= 1;
1654 * Owner is our parent level, so we can just add one to get the level
1655 * for the block we are interested in.
1657 if (skinny_metadata
&& owner
< BTRFS_FIRST_FREE_OBJECTID
) {
1658 key
.type
= BTRFS_METADATA_ITEM_KEY
;
1663 ret
= btrfs_search_slot(trans
, root
, &key
, path
, extra_size
, 1);
1670 * We may be a newly converted file system which still has the old fat
1671 * extent entries for metadata, so try and see if we have one of those.
1673 if (ret
> 0 && skinny_metadata
) {
1674 skinny_metadata
= false;
1675 if (path
->slots
[0]) {
1677 btrfs_item_key_to_cpu(path
->nodes
[0], &key
,
1679 if (key
.objectid
== bytenr
&&
1680 key
.type
== BTRFS_EXTENT_ITEM_KEY
&&
1681 key
.offset
== num_bytes
)
1685 key
.objectid
= bytenr
;
1686 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
1687 key
.offset
= num_bytes
;
1688 btrfs_release_path(path
);
1693 if (ret
&& !insert
) {
1696 } else if (WARN_ON(ret
)) {
1701 leaf
= path
->nodes
[0];
1702 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
1703 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1704 if (item_size
< sizeof(*ei
)) {
1709 ret
= convert_extent_item_v0(trans
, fs_info
, path
, owner
,
1715 leaf
= path
->nodes
[0];
1716 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
1719 BUG_ON(item_size
< sizeof(*ei
));
1721 ei
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
1722 flags
= btrfs_extent_flags(leaf
, ei
);
1724 ptr
= (unsigned long)(ei
+ 1);
1725 end
= (unsigned long)ei
+ item_size
;
1727 if (flags
& BTRFS_EXTENT_FLAG_TREE_BLOCK
&& !skinny_metadata
) {
1728 ptr
+= sizeof(struct btrfs_tree_block_info
);
1732 if (owner
>= BTRFS_FIRST_FREE_OBJECTID
)
1733 needed
= BTRFS_REF_TYPE_DATA
;
1735 needed
= BTRFS_REF_TYPE_BLOCK
;
1743 iref
= (struct btrfs_extent_inline_ref
*)ptr
;
1744 type
= btrfs_get_extent_inline_ref_type(leaf
, iref
, needed
);
1745 if (type
== BTRFS_REF_TYPE_INVALID
) {
1753 ptr
+= btrfs_extent_inline_ref_size(type
);
1757 if (type
== BTRFS_EXTENT_DATA_REF_KEY
) {
1758 struct btrfs_extent_data_ref
*dref
;
1759 dref
= (struct btrfs_extent_data_ref
*)(&iref
->offset
);
1760 if (match_extent_data_ref(leaf
, dref
, root_objectid
,
1765 if (hash_extent_data_ref_item(leaf
, dref
) <
1766 hash_extent_data_ref(root_objectid
, owner
, offset
))
1770 ref_offset
= btrfs_extent_inline_ref_offset(leaf
, iref
);
1772 if (parent
== ref_offset
) {
1776 if (ref_offset
< parent
)
1779 if (root_objectid
== ref_offset
) {
1783 if (ref_offset
< root_objectid
)
1787 ptr
+= btrfs_extent_inline_ref_size(type
);
1789 if (err
== -ENOENT
&& insert
) {
1790 if (item_size
+ extra_size
>=
1791 BTRFS_MAX_EXTENT_ITEM_SIZE(root
)) {
1796 * To add new inline back ref, we have to make sure
1797 * there is no corresponding back ref item.
1798 * For simplicity, we just do not add new inline back
1799 * ref if there is any kind of item for this block
1801 if (find_next_key(path
, 0, &key
) == 0 &&
1802 key
.objectid
== bytenr
&&
1803 key
.type
< BTRFS_BLOCK_GROUP_ITEM_KEY
) {
1808 *ref_ret
= (struct btrfs_extent_inline_ref
*)ptr
;
1811 path
->keep_locks
= 0;
1812 btrfs_unlock_up_safe(path
, 1);
1818 * helper to add new inline back ref
1820 static noinline_for_stack
1821 void setup_inline_extent_backref(struct btrfs_fs_info
*fs_info
,
1822 struct btrfs_path
*path
,
1823 struct btrfs_extent_inline_ref
*iref
,
1824 u64 parent
, u64 root_objectid
,
1825 u64 owner
, u64 offset
, int refs_to_add
,
1826 struct btrfs_delayed_extent_op
*extent_op
)
1828 struct extent_buffer
*leaf
;
1829 struct btrfs_extent_item
*ei
;
1832 unsigned long item_offset
;
1837 leaf
= path
->nodes
[0];
1838 ei
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
1839 item_offset
= (unsigned long)iref
- (unsigned long)ei
;
1841 type
= extent_ref_type(parent
, owner
);
1842 size
= btrfs_extent_inline_ref_size(type
);
1844 btrfs_extend_item(fs_info
, path
, size
);
1846 ei
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
1847 refs
= btrfs_extent_refs(leaf
, ei
);
1848 refs
+= refs_to_add
;
1849 btrfs_set_extent_refs(leaf
, ei
, refs
);
1851 __run_delayed_extent_op(extent_op
, leaf
, ei
);
1853 ptr
= (unsigned long)ei
+ item_offset
;
1854 end
= (unsigned long)ei
+ btrfs_item_size_nr(leaf
, path
->slots
[0]);
1855 if (ptr
< end
- size
)
1856 memmove_extent_buffer(leaf
, ptr
+ size
, ptr
,
1859 iref
= (struct btrfs_extent_inline_ref
*)ptr
;
1860 btrfs_set_extent_inline_ref_type(leaf
, iref
, type
);
1861 if (type
== BTRFS_EXTENT_DATA_REF_KEY
) {
1862 struct btrfs_extent_data_ref
*dref
;
1863 dref
= (struct btrfs_extent_data_ref
*)(&iref
->offset
);
1864 btrfs_set_extent_data_ref_root(leaf
, dref
, root_objectid
);
1865 btrfs_set_extent_data_ref_objectid(leaf
, dref
, owner
);
1866 btrfs_set_extent_data_ref_offset(leaf
, dref
, offset
);
1867 btrfs_set_extent_data_ref_count(leaf
, dref
, refs_to_add
);
1868 } else if (type
== BTRFS_SHARED_DATA_REF_KEY
) {
1869 struct btrfs_shared_data_ref
*sref
;
1870 sref
= (struct btrfs_shared_data_ref
*)(iref
+ 1);
1871 btrfs_set_shared_data_ref_count(leaf
, sref
, refs_to_add
);
1872 btrfs_set_extent_inline_ref_offset(leaf
, iref
, parent
);
1873 } else if (type
== BTRFS_SHARED_BLOCK_REF_KEY
) {
1874 btrfs_set_extent_inline_ref_offset(leaf
, iref
, parent
);
1876 btrfs_set_extent_inline_ref_offset(leaf
, iref
, root_objectid
);
1878 btrfs_mark_buffer_dirty(leaf
);
1881 static int lookup_extent_backref(struct btrfs_trans_handle
*trans
,
1882 struct btrfs_fs_info
*fs_info
,
1883 struct btrfs_path
*path
,
1884 struct btrfs_extent_inline_ref
**ref_ret
,
1885 u64 bytenr
, u64 num_bytes
, u64 parent
,
1886 u64 root_objectid
, u64 owner
, u64 offset
)
1890 ret
= lookup_inline_extent_backref(trans
, fs_info
, path
, ref_ret
,
1891 bytenr
, num_bytes
, parent
,
1892 root_objectid
, owner
, offset
, 0);
1896 btrfs_release_path(path
);
1899 if (owner
< BTRFS_FIRST_FREE_OBJECTID
) {
1900 ret
= lookup_tree_block_ref(trans
, fs_info
, path
, bytenr
,
1901 parent
, root_objectid
);
1903 ret
= lookup_extent_data_ref(trans
, fs_info
, path
, bytenr
,
1904 parent
, root_objectid
, owner
,
1911 * helper to update/remove inline back ref
1913 static noinline_for_stack
1914 void update_inline_extent_backref(struct btrfs_fs_info
*fs_info
,
1915 struct btrfs_path
*path
,
1916 struct btrfs_extent_inline_ref
*iref
,
1918 struct btrfs_delayed_extent_op
*extent_op
,
1921 struct extent_buffer
*leaf
;
1922 struct btrfs_extent_item
*ei
;
1923 struct btrfs_extent_data_ref
*dref
= NULL
;
1924 struct btrfs_shared_data_ref
*sref
= NULL
;
1932 leaf
= path
->nodes
[0];
1933 ei
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
1934 refs
= btrfs_extent_refs(leaf
, ei
);
1935 WARN_ON(refs_to_mod
< 0 && refs
+ refs_to_mod
<= 0);
1936 refs
+= refs_to_mod
;
1937 btrfs_set_extent_refs(leaf
, ei
, refs
);
1939 __run_delayed_extent_op(extent_op
, leaf
, ei
);
1942 * If type is invalid, we should have bailed out after
1943 * lookup_inline_extent_backref().
1945 type
= btrfs_get_extent_inline_ref_type(leaf
, iref
, BTRFS_REF_TYPE_ANY
);
1946 ASSERT(type
!= BTRFS_REF_TYPE_INVALID
);
1948 if (type
== BTRFS_EXTENT_DATA_REF_KEY
) {
1949 dref
= (struct btrfs_extent_data_ref
*)(&iref
->offset
);
1950 refs
= btrfs_extent_data_ref_count(leaf
, dref
);
1951 } else if (type
== BTRFS_SHARED_DATA_REF_KEY
) {
1952 sref
= (struct btrfs_shared_data_ref
*)(iref
+ 1);
1953 refs
= btrfs_shared_data_ref_count(leaf
, sref
);
1956 BUG_ON(refs_to_mod
!= -1);
1959 BUG_ON(refs_to_mod
< 0 && refs
< -refs_to_mod
);
1960 refs
+= refs_to_mod
;
1963 if (type
== BTRFS_EXTENT_DATA_REF_KEY
)
1964 btrfs_set_extent_data_ref_count(leaf
, dref
, refs
);
1966 btrfs_set_shared_data_ref_count(leaf
, sref
, refs
);
1969 size
= btrfs_extent_inline_ref_size(type
);
1970 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
1971 ptr
= (unsigned long)iref
;
1972 end
= (unsigned long)ei
+ item_size
;
1973 if (ptr
+ size
< end
)
1974 memmove_extent_buffer(leaf
, ptr
, ptr
+ size
,
1977 btrfs_truncate_item(fs_info
, path
, item_size
, 1);
1979 btrfs_mark_buffer_dirty(leaf
);
1982 static noinline_for_stack
1983 int insert_inline_extent_backref(struct btrfs_trans_handle
*trans
,
1984 struct btrfs_fs_info
*fs_info
,
1985 struct btrfs_path
*path
,
1986 u64 bytenr
, u64 num_bytes
, u64 parent
,
1987 u64 root_objectid
, u64 owner
,
1988 u64 offset
, int refs_to_add
,
1989 struct btrfs_delayed_extent_op
*extent_op
)
1991 struct btrfs_extent_inline_ref
*iref
;
1994 ret
= lookup_inline_extent_backref(trans
, fs_info
, path
, &iref
,
1995 bytenr
, num_bytes
, parent
,
1996 root_objectid
, owner
, offset
, 1);
1998 BUG_ON(owner
< BTRFS_FIRST_FREE_OBJECTID
);
1999 update_inline_extent_backref(fs_info
, path
, iref
,
2000 refs_to_add
, extent_op
, NULL
);
2001 } else if (ret
== -ENOENT
) {
2002 setup_inline_extent_backref(fs_info
, path
, iref
, parent
,
2003 root_objectid
, owner
, offset
,
2004 refs_to_add
, extent_op
);
2010 static int insert_extent_backref(struct btrfs_trans_handle
*trans
,
2011 struct btrfs_fs_info
*fs_info
,
2012 struct btrfs_path
*path
,
2013 u64 bytenr
, u64 parent
, u64 root_objectid
,
2014 u64 owner
, u64 offset
, int refs_to_add
)
2017 if (owner
< BTRFS_FIRST_FREE_OBJECTID
) {
2018 BUG_ON(refs_to_add
!= 1);
2019 ret
= insert_tree_block_ref(trans
, fs_info
, path
, bytenr
,
2020 parent
, root_objectid
);
2022 ret
= insert_extent_data_ref(trans
, fs_info
, path
, bytenr
,
2023 parent
, root_objectid
,
2024 owner
, offset
, refs_to_add
);
2029 static int remove_extent_backref(struct btrfs_trans_handle
*trans
,
2030 struct btrfs_fs_info
*fs_info
,
2031 struct btrfs_path
*path
,
2032 struct btrfs_extent_inline_ref
*iref
,
2033 int refs_to_drop
, int is_data
, int *last_ref
)
2037 BUG_ON(!is_data
&& refs_to_drop
!= 1);
2039 update_inline_extent_backref(fs_info
, path
, iref
,
2040 -refs_to_drop
, NULL
, last_ref
);
2041 } else if (is_data
) {
2042 ret
= remove_extent_data_ref(trans
, fs_info
, path
, refs_to_drop
,
2046 ret
= btrfs_del_item(trans
, fs_info
->extent_root
, path
);
2051 #define in_range(b, first, len) ((b) >= (first) && (b) < (first) + (len))
2052 static int btrfs_issue_discard(struct block_device
*bdev
, u64 start
, u64 len
,
2053 u64
*discarded_bytes
)
2056 u64 bytes_left
, end
;
2057 u64 aligned_start
= ALIGN(start
, 1 << 9);
2059 if (WARN_ON(start
!= aligned_start
)) {
2060 len
-= aligned_start
- start
;
2061 len
= round_down(len
, 1 << 9);
2062 start
= aligned_start
;
2065 *discarded_bytes
= 0;
2073 /* Skip any superblocks on this device. */
2074 for (j
= 0; j
< BTRFS_SUPER_MIRROR_MAX
; j
++) {
2075 u64 sb_start
= btrfs_sb_offset(j
);
2076 u64 sb_end
= sb_start
+ BTRFS_SUPER_INFO_SIZE
;
2077 u64 size
= sb_start
- start
;
2079 if (!in_range(sb_start
, start
, bytes_left
) &&
2080 !in_range(sb_end
, start
, bytes_left
) &&
2081 !in_range(start
, sb_start
, BTRFS_SUPER_INFO_SIZE
))
2085 * Superblock spans beginning of range. Adjust start and
2088 if (sb_start
<= start
) {
2089 start
+= sb_end
- start
;
2094 bytes_left
= end
- start
;
2099 ret
= blkdev_issue_discard(bdev
, start
>> 9, size
>> 9,
2102 *discarded_bytes
+= size
;
2103 else if (ret
!= -EOPNOTSUPP
)
2112 bytes_left
= end
- start
;
2116 ret
= blkdev_issue_discard(bdev
, start
>> 9, bytes_left
>> 9,
2119 *discarded_bytes
+= bytes_left
;
2124 int btrfs_discard_extent(struct btrfs_fs_info
*fs_info
, u64 bytenr
,
2125 u64 num_bytes
, u64
*actual_bytes
)
2128 u64 discarded_bytes
= 0;
2129 struct btrfs_bio
*bbio
= NULL
;
2133 * Avoid races with device replace and make sure our bbio has devices
2134 * associated to its stripes that don't go away while we are discarding.
2136 btrfs_bio_counter_inc_blocked(fs_info
);
2137 /* Tell the block device(s) that the sectors can be discarded */
2138 ret
= btrfs_map_block(fs_info
, BTRFS_MAP_DISCARD
, bytenr
, &num_bytes
,
2140 /* Error condition is -ENOMEM */
2142 struct btrfs_bio_stripe
*stripe
= bbio
->stripes
;
2146 for (i
= 0; i
< bbio
->num_stripes
; i
++, stripe
++) {
2148 if (!stripe
->dev
->can_discard
)
2151 ret
= btrfs_issue_discard(stripe
->dev
->bdev
,
2156 discarded_bytes
+= bytes
;
2157 else if (ret
!= -EOPNOTSUPP
)
2158 break; /* Logic errors or -ENOMEM, or -EIO but I don't know how that could happen JDM */
2161 * Just in case we get back EOPNOTSUPP for some reason,
2162 * just ignore the return value so we don't screw up
2163 * people calling discard_extent.
2167 btrfs_put_bbio(bbio
);
2169 btrfs_bio_counter_dec(fs_info
);
2172 *actual_bytes
= discarded_bytes
;
2175 if (ret
== -EOPNOTSUPP
)
2180 /* Can return -ENOMEM */
2181 int btrfs_inc_extent_ref(struct btrfs_trans_handle
*trans
,
2182 struct btrfs_root
*root
,
2183 u64 bytenr
, u64 num_bytes
, u64 parent
,
2184 u64 root_objectid
, u64 owner
, u64 offset
)
2186 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
2187 int old_ref_mod
, new_ref_mod
;
2190 BUG_ON(owner
< BTRFS_FIRST_FREE_OBJECTID
&&
2191 root_objectid
== BTRFS_TREE_LOG_OBJECTID
);
2193 btrfs_ref_tree_mod(root
, bytenr
, num_bytes
, parent
, root_objectid
,
2194 owner
, offset
, BTRFS_ADD_DELAYED_REF
);
2196 if (owner
< BTRFS_FIRST_FREE_OBJECTID
) {
2197 ret
= btrfs_add_delayed_tree_ref(fs_info
, trans
, bytenr
,
2199 root_objectid
, (int)owner
,
2200 BTRFS_ADD_DELAYED_REF
, NULL
,
2201 &old_ref_mod
, &new_ref_mod
);
2203 ret
= btrfs_add_delayed_data_ref(fs_info
, trans
, bytenr
,
2205 root_objectid
, owner
, offset
,
2206 0, BTRFS_ADD_DELAYED_REF
,
2207 &old_ref_mod
, &new_ref_mod
);
2210 if (ret
== 0 && old_ref_mod
< 0 && new_ref_mod
>= 0)
2211 add_pinned_bytes(fs_info
, -num_bytes
, owner
, root_objectid
);
2216 static int __btrfs_inc_extent_ref(struct btrfs_trans_handle
*trans
,
2217 struct btrfs_fs_info
*fs_info
,
2218 struct btrfs_delayed_ref_node
*node
,
2219 u64 parent
, u64 root_objectid
,
2220 u64 owner
, u64 offset
, int refs_to_add
,
2221 struct btrfs_delayed_extent_op
*extent_op
)
2223 struct btrfs_path
*path
;
2224 struct extent_buffer
*leaf
;
2225 struct btrfs_extent_item
*item
;
2226 struct btrfs_key key
;
2227 u64 bytenr
= node
->bytenr
;
2228 u64 num_bytes
= node
->num_bytes
;
2232 path
= btrfs_alloc_path();
2236 path
->reada
= READA_FORWARD
;
2237 path
->leave_spinning
= 1;
2238 /* this will setup the path even if it fails to insert the back ref */
2239 ret
= insert_inline_extent_backref(trans
, fs_info
, path
, bytenr
,
2240 num_bytes
, parent
, root_objectid
,
2242 refs_to_add
, extent_op
);
2243 if ((ret
< 0 && ret
!= -EAGAIN
) || !ret
)
2247 * Ok we had -EAGAIN which means we didn't have space to insert and
2248 * inline extent ref, so just update the reference count and add a
2251 leaf
= path
->nodes
[0];
2252 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
2253 item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
2254 refs
= btrfs_extent_refs(leaf
, item
);
2255 btrfs_set_extent_refs(leaf
, item
, refs
+ refs_to_add
);
2257 __run_delayed_extent_op(extent_op
, leaf
, item
);
2259 btrfs_mark_buffer_dirty(leaf
);
2260 btrfs_release_path(path
);
2262 path
->reada
= READA_FORWARD
;
2263 path
->leave_spinning
= 1;
2264 /* now insert the actual backref */
2265 ret
= insert_extent_backref(trans
, fs_info
, path
, bytenr
, parent
,
2266 root_objectid
, owner
, offset
, refs_to_add
);
2268 btrfs_abort_transaction(trans
, ret
);
2270 btrfs_free_path(path
);
2274 static int run_delayed_data_ref(struct btrfs_trans_handle
*trans
,
2275 struct btrfs_fs_info
*fs_info
,
2276 struct btrfs_delayed_ref_node
*node
,
2277 struct btrfs_delayed_extent_op
*extent_op
,
2278 int insert_reserved
)
2281 struct btrfs_delayed_data_ref
*ref
;
2282 struct btrfs_key ins
;
2287 ins
.objectid
= node
->bytenr
;
2288 ins
.offset
= node
->num_bytes
;
2289 ins
.type
= BTRFS_EXTENT_ITEM_KEY
;
2291 ref
= btrfs_delayed_node_to_data_ref(node
);
2292 trace_run_delayed_data_ref(fs_info
, node
, ref
, node
->action
);
2294 if (node
->type
== BTRFS_SHARED_DATA_REF_KEY
)
2295 parent
= ref
->parent
;
2296 ref_root
= ref
->root
;
2298 if (node
->action
== BTRFS_ADD_DELAYED_REF
&& insert_reserved
) {
2300 flags
|= extent_op
->flags_to_set
;
2301 ret
= alloc_reserved_file_extent(trans
, fs_info
,
2302 parent
, ref_root
, flags
,
2303 ref
->objectid
, ref
->offset
,
2304 &ins
, node
->ref_mod
);
2305 } else if (node
->action
== BTRFS_ADD_DELAYED_REF
) {
2306 ret
= __btrfs_inc_extent_ref(trans
, fs_info
, node
, parent
,
2307 ref_root
, ref
->objectid
,
2308 ref
->offset
, node
->ref_mod
,
2310 } else if (node
->action
== BTRFS_DROP_DELAYED_REF
) {
2311 ret
= __btrfs_free_extent(trans
, fs_info
, node
, parent
,
2312 ref_root
, ref
->objectid
,
2313 ref
->offset
, node
->ref_mod
,
2321 static void __run_delayed_extent_op(struct btrfs_delayed_extent_op
*extent_op
,
2322 struct extent_buffer
*leaf
,
2323 struct btrfs_extent_item
*ei
)
2325 u64 flags
= btrfs_extent_flags(leaf
, ei
);
2326 if (extent_op
->update_flags
) {
2327 flags
|= extent_op
->flags_to_set
;
2328 btrfs_set_extent_flags(leaf
, ei
, flags
);
2331 if (extent_op
->update_key
) {
2332 struct btrfs_tree_block_info
*bi
;
2333 BUG_ON(!(flags
& BTRFS_EXTENT_FLAG_TREE_BLOCK
));
2334 bi
= (struct btrfs_tree_block_info
*)(ei
+ 1);
2335 btrfs_set_tree_block_key(leaf
, bi
, &extent_op
->key
);
2339 static int run_delayed_extent_op(struct btrfs_trans_handle
*trans
,
2340 struct btrfs_fs_info
*fs_info
,
2341 struct btrfs_delayed_ref_head
*head
,
2342 struct btrfs_delayed_extent_op
*extent_op
)
2344 struct btrfs_key key
;
2345 struct btrfs_path
*path
;
2346 struct btrfs_extent_item
*ei
;
2347 struct extent_buffer
*leaf
;
2351 int metadata
= !extent_op
->is_data
;
2356 if (metadata
&& !btrfs_fs_incompat(fs_info
, SKINNY_METADATA
))
2359 path
= btrfs_alloc_path();
2363 key
.objectid
= head
->bytenr
;
2366 key
.type
= BTRFS_METADATA_ITEM_KEY
;
2367 key
.offset
= extent_op
->level
;
2369 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
2370 key
.offset
= head
->num_bytes
;
2374 path
->reada
= READA_FORWARD
;
2375 path
->leave_spinning
= 1;
2376 ret
= btrfs_search_slot(trans
, fs_info
->extent_root
, &key
, path
, 0, 1);
2383 if (path
->slots
[0] > 0) {
2385 btrfs_item_key_to_cpu(path
->nodes
[0], &key
,
2387 if (key
.objectid
== head
->bytenr
&&
2388 key
.type
== BTRFS_EXTENT_ITEM_KEY
&&
2389 key
.offset
== head
->num_bytes
)
2393 btrfs_release_path(path
);
2396 key
.objectid
= head
->bytenr
;
2397 key
.offset
= head
->num_bytes
;
2398 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
2407 leaf
= path
->nodes
[0];
2408 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
2409 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2410 if (item_size
< sizeof(*ei
)) {
2411 ret
= convert_extent_item_v0(trans
, fs_info
, path
, (u64
)-1, 0);
2416 leaf
= path
->nodes
[0];
2417 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
2420 BUG_ON(item_size
< sizeof(*ei
));
2421 ei
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
2422 __run_delayed_extent_op(extent_op
, leaf
, ei
);
2424 btrfs_mark_buffer_dirty(leaf
);
2426 btrfs_free_path(path
);
2430 static int run_delayed_tree_ref(struct btrfs_trans_handle
*trans
,
2431 struct btrfs_fs_info
*fs_info
,
2432 struct btrfs_delayed_ref_node
*node
,
2433 struct btrfs_delayed_extent_op
*extent_op
,
2434 int insert_reserved
)
2437 struct btrfs_delayed_tree_ref
*ref
;
2438 struct btrfs_key ins
;
2441 bool skinny_metadata
= btrfs_fs_incompat(fs_info
, SKINNY_METADATA
);
2443 ref
= btrfs_delayed_node_to_tree_ref(node
);
2444 trace_run_delayed_tree_ref(fs_info
, node
, ref
, node
->action
);
2446 if (node
->type
== BTRFS_SHARED_BLOCK_REF_KEY
)
2447 parent
= ref
->parent
;
2448 ref_root
= ref
->root
;
2450 ins
.objectid
= node
->bytenr
;
2451 if (skinny_metadata
) {
2452 ins
.offset
= ref
->level
;
2453 ins
.type
= BTRFS_METADATA_ITEM_KEY
;
2455 ins
.offset
= node
->num_bytes
;
2456 ins
.type
= BTRFS_EXTENT_ITEM_KEY
;
2459 if (node
->ref_mod
!= 1) {
2461 "btree block(%llu) has %d references rather than 1: action %d ref_root %llu parent %llu",
2462 node
->bytenr
, node
->ref_mod
, node
->action
, ref_root
,
2466 if (node
->action
== BTRFS_ADD_DELAYED_REF
&& insert_reserved
) {
2467 BUG_ON(!extent_op
|| !extent_op
->update_flags
);
2468 ret
= alloc_reserved_tree_block(trans
, fs_info
,
2470 extent_op
->flags_to_set
,
2473 } else if (node
->action
== BTRFS_ADD_DELAYED_REF
) {
2474 ret
= __btrfs_inc_extent_ref(trans
, fs_info
, node
,
2478 } else if (node
->action
== BTRFS_DROP_DELAYED_REF
) {
2479 ret
= __btrfs_free_extent(trans
, fs_info
, node
,
2481 ref
->level
, 0, 1, extent_op
);
2488 /* helper function to actually process a single delayed ref entry */
2489 static int run_one_delayed_ref(struct btrfs_trans_handle
*trans
,
2490 struct btrfs_fs_info
*fs_info
,
2491 struct btrfs_delayed_ref_node
*node
,
2492 struct btrfs_delayed_extent_op
*extent_op
,
2493 int insert_reserved
)
2497 if (trans
->aborted
) {
2498 if (insert_reserved
)
2499 btrfs_pin_extent(fs_info
, node
->bytenr
,
2500 node
->num_bytes
, 1);
2504 if (node
->type
== BTRFS_TREE_BLOCK_REF_KEY
||
2505 node
->type
== BTRFS_SHARED_BLOCK_REF_KEY
)
2506 ret
= run_delayed_tree_ref(trans
, fs_info
, node
, extent_op
,
2508 else if (node
->type
== BTRFS_EXTENT_DATA_REF_KEY
||
2509 node
->type
== BTRFS_SHARED_DATA_REF_KEY
)
2510 ret
= run_delayed_data_ref(trans
, fs_info
, node
, extent_op
,
2514 if (ret
&& insert_reserved
)
2515 btrfs_pin_extent(trans
->fs_info
, node
->bytenr
,
2516 node
->num_bytes
, 1);
2520 static inline struct btrfs_delayed_ref_node
*
2521 select_delayed_ref(struct btrfs_delayed_ref_head
*head
)
2523 struct btrfs_delayed_ref_node
*ref
;
2525 if (RB_EMPTY_ROOT(&head
->ref_tree
))
2529 * Select a delayed ref of type BTRFS_ADD_DELAYED_REF first.
2530 * This is to prevent a ref count from going down to zero, which deletes
2531 * the extent item from the extent tree, when there still are references
2532 * to add, which would fail because they would not find the extent item.
2534 if (!list_empty(&head
->ref_add_list
))
2535 return list_first_entry(&head
->ref_add_list
,
2536 struct btrfs_delayed_ref_node
, add_list
);
2538 ref
= rb_entry(rb_first(&head
->ref_tree
),
2539 struct btrfs_delayed_ref_node
, ref_node
);
2540 ASSERT(list_empty(&ref
->add_list
));
2544 static void unselect_delayed_ref_head(struct btrfs_delayed_ref_root
*delayed_refs
,
2545 struct btrfs_delayed_ref_head
*head
)
2547 spin_lock(&delayed_refs
->lock
);
2548 head
->processing
= 0;
2549 delayed_refs
->num_heads_ready
++;
2550 spin_unlock(&delayed_refs
->lock
);
2551 btrfs_delayed_ref_unlock(head
);
2554 static int cleanup_extent_op(struct btrfs_trans_handle
*trans
,
2555 struct btrfs_fs_info
*fs_info
,
2556 struct btrfs_delayed_ref_head
*head
)
2558 struct btrfs_delayed_extent_op
*extent_op
= head
->extent_op
;
2563 head
->extent_op
= NULL
;
2564 if (head
->must_insert_reserved
) {
2565 btrfs_free_delayed_extent_op(extent_op
);
2568 spin_unlock(&head
->lock
);
2569 ret
= run_delayed_extent_op(trans
, fs_info
, head
, extent_op
);
2570 btrfs_free_delayed_extent_op(extent_op
);
2571 return ret
? ret
: 1;
2574 static int cleanup_ref_head(struct btrfs_trans_handle
*trans
,
2575 struct btrfs_fs_info
*fs_info
,
2576 struct btrfs_delayed_ref_head
*head
)
2578 struct btrfs_delayed_ref_root
*delayed_refs
;
2581 delayed_refs
= &trans
->transaction
->delayed_refs
;
2583 ret
= cleanup_extent_op(trans
, fs_info
, head
);
2585 unselect_delayed_ref_head(delayed_refs
, head
);
2586 btrfs_debug(fs_info
, "run_delayed_extent_op returned %d", ret
);
2593 * Need to drop our head ref lock and re-acquire the delayed ref lock
2594 * and then re-check to make sure nobody got added.
2596 spin_unlock(&head
->lock
);
2597 spin_lock(&delayed_refs
->lock
);
2598 spin_lock(&head
->lock
);
2599 if (!RB_EMPTY_ROOT(&head
->ref_tree
) || head
->extent_op
) {
2600 spin_unlock(&head
->lock
);
2601 spin_unlock(&delayed_refs
->lock
);
2604 delayed_refs
->num_heads
--;
2605 rb_erase(&head
->href_node
, &delayed_refs
->href_root
);
2606 RB_CLEAR_NODE(&head
->href_node
);
2607 spin_unlock(&delayed_refs
->lock
);
2608 spin_unlock(&head
->lock
);
2609 atomic_dec(&delayed_refs
->num_entries
);
2611 trace_run_delayed_ref_head(fs_info
, head
, 0);
2613 if (head
->total_ref_mod
< 0) {
2614 struct btrfs_space_info
*space_info
;
2618 flags
= BTRFS_BLOCK_GROUP_DATA
;
2619 else if (head
->is_system
)
2620 flags
= BTRFS_BLOCK_GROUP_SYSTEM
;
2622 flags
= BTRFS_BLOCK_GROUP_METADATA
;
2623 space_info
= __find_space_info(fs_info
, flags
);
2625 percpu_counter_add(&space_info
->total_bytes_pinned
,
2628 if (head
->is_data
) {
2629 spin_lock(&delayed_refs
->lock
);
2630 delayed_refs
->pending_csums
-= head
->num_bytes
;
2631 spin_unlock(&delayed_refs
->lock
);
2635 if (head
->must_insert_reserved
) {
2636 btrfs_pin_extent(fs_info
, head
->bytenr
,
2637 head
->num_bytes
, 1);
2638 if (head
->is_data
) {
2639 ret
= btrfs_del_csums(trans
, fs_info
, head
->bytenr
,
2644 /* Also free its reserved qgroup space */
2645 btrfs_qgroup_free_delayed_ref(fs_info
, head
->qgroup_ref_root
,
2646 head
->qgroup_reserved
);
2647 btrfs_delayed_ref_unlock(head
);
2648 btrfs_put_delayed_ref_head(head
);
2653 * Returns 0 on success or if called with an already aborted transaction.
2654 * Returns -ENOMEM or -EIO on failure and will abort the transaction.
2656 static noinline
int __btrfs_run_delayed_refs(struct btrfs_trans_handle
*trans
,
2657 struct btrfs_fs_info
*fs_info
,
2660 struct btrfs_delayed_ref_root
*delayed_refs
;
2661 struct btrfs_delayed_ref_node
*ref
;
2662 struct btrfs_delayed_ref_head
*locked_ref
= NULL
;
2663 struct btrfs_delayed_extent_op
*extent_op
;
2664 ktime_t start
= ktime_get();
2666 unsigned long count
= 0;
2667 unsigned long actual_count
= 0;
2668 int must_insert_reserved
= 0;
2670 delayed_refs
= &trans
->transaction
->delayed_refs
;
2676 spin_lock(&delayed_refs
->lock
);
2677 locked_ref
= btrfs_select_ref_head(trans
);
2679 spin_unlock(&delayed_refs
->lock
);
2683 /* grab the lock that says we are going to process
2684 * all the refs for this head */
2685 ret
= btrfs_delayed_ref_lock(trans
, locked_ref
);
2686 spin_unlock(&delayed_refs
->lock
);
2688 * we may have dropped the spin lock to get the head
2689 * mutex lock, and that might have given someone else
2690 * time to free the head. If that's true, it has been
2691 * removed from our list and we can move on.
2693 if (ret
== -EAGAIN
) {
2701 * We need to try and merge add/drops of the same ref since we
2702 * can run into issues with relocate dropping the implicit ref
2703 * and then it being added back again before the drop can
2704 * finish. If we merged anything we need to re-loop so we can
2706 * Or we can get node references of the same type that weren't
2707 * merged when created due to bumps in the tree mod seq, and
2708 * we need to merge them to prevent adding an inline extent
2709 * backref before dropping it (triggering a BUG_ON at
2710 * insert_inline_extent_backref()).
2712 spin_lock(&locked_ref
->lock
);
2713 btrfs_merge_delayed_refs(trans
, fs_info
, delayed_refs
,
2717 * locked_ref is the head node, so we have to go one
2718 * node back for any delayed ref updates
2720 ref
= select_delayed_ref(locked_ref
);
2722 if (ref
&& ref
->seq
&&
2723 btrfs_check_delayed_seq(fs_info
, delayed_refs
, ref
->seq
)) {
2724 spin_unlock(&locked_ref
->lock
);
2725 unselect_delayed_ref_head(delayed_refs
, locked_ref
);
2733 * We're done processing refs in this ref_head, clean everything
2734 * up and move on to the next ref_head.
2737 ret
= cleanup_ref_head(trans
, fs_info
, locked_ref
);
2739 /* We dropped our lock, we need to loop. */
2752 rb_erase(&ref
->ref_node
, &locked_ref
->ref_tree
);
2753 RB_CLEAR_NODE(&ref
->ref_node
);
2754 if (!list_empty(&ref
->add_list
))
2755 list_del(&ref
->add_list
);
2757 * When we play the delayed ref, also correct the ref_mod on
2760 switch (ref
->action
) {
2761 case BTRFS_ADD_DELAYED_REF
:
2762 case BTRFS_ADD_DELAYED_EXTENT
:
2763 locked_ref
->ref_mod
-= ref
->ref_mod
;
2765 case BTRFS_DROP_DELAYED_REF
:
2766 locked_ref
->ref_mod
+= ref
->ref_mod
;
2771 atomic_dec(&delayed_refs
->num_entries
);
2774 * Record the must-insert_reserved flag before we drop the spin
2777 must_insert_reserved
= locked_ref
->must_insert_reserved
;
2778 locked_ref
->must_insert_reserved
= 0;
2780 extent_op
= locked_ref
->extent_op
;
2781 locked_ref
->extent_op
= NULL
;
2782 spin_unlock(&locked_ref
->lock
);
2784 ret
= run_one_delayed_ref(trans
, fs_info
, ref
, extent_op
,
2785 must_insert_reserved
);
2787 btrfs_free_delayed_extent_op(extent_op
);
2789 unselect_delayed_ref_head(delayed_refs
, locked_ref
);
2790 btrfs_put_delayed_ref(ref
);
2791 btrfs_debug(fs_info
, "run_one_delayed_ref returned %d",
2796 btrfs_put_delayed_ref(ref
);
2802 * We don't want to include ref heads since we can have empty ref heads
2803 * and those will drastically skew our runtime down since we just do
2804 * accounting, no actual extent tree updates.
2806 if (actual_count
> 0) {
2807 u64 runtime
= ktime_to_ns(ktime_sub(ktime_get(), start
));
2811 * We weigh the current average higher than our current runtime
2812 * to avoid large swings in the average.
2814 spin_lock(&delayed_refs
->lock
);
2815 avg
= fs_info
->avg_delayed_ref_runtime
* 3 + runtime
;
2816 fs_info
->avg_delayed_ref_runtime
= avg
>> 2; /* div by 4 */
2817 spin_unlock(&delayed_refs
->lock
);
2822 #ifdef SCRAMBLE_DELAYED_REFS
2824 * Normally delayed refs get processed in ascending bytenr order. This
2825 * correlates in most cases to the order added. To expose dependencies on this
2826 * order, we start to process the tree in the middle instead of the beginning
2828 static u64
find_middle(struct rb_root
*root
)
2830 struct rb_node
*n
= root
->rb_node
;
2831 struct btrfs_delayed_ref_node
*entry
;
2834 u64 first
= 0, last
= 0;
2838 entry
= rb_entry(n
, struct btrfs_delayed_ref_node
, rb_node
);
2839 first
= entry
->bytenr
;
2843 entry
= rb_entry(n
, struct btrfs_delayed_ref_node
, rb_node
);
2844 last
= entry
->bytenr
;
2849 entry
= rb_entry(n
, struct btrfs_delayed_ref_node
, rb_node
);
2850 WARN_ON(!entry
->in_tree
);
2852 middle
= entry
->bytenr
;
2865 static inline u64
heads_to_leaves(struct btrfs_fs_info
*fs_info
, u64 heads
)
2869 num_bytes
= heads
* (sizeof(struct btrfs_extent_item
) +
2870 sizeof(struct btrfs_extent_inline_ref
));
2871 if (!btrfs_fs_incompat(fs_info
, SKINNY_METADATA
))
2872 num_bytes
+= heads
* sizeof(struct btrfs_tree_block_info
);
2875 * We don't ever fill up leaves all the way so multiply by 2 just to be
2876 * closer to what we're really going to want to use.
2878 return div_u64(num_bytes
, BTRFS_LEAF_DATA_SIZE(fs_info
));
2882 * Takes the number of bytes to be csumm'ed and figures out how many leaves it
2883 * would require to store the csums for that many bytes.
2885 u64
btrfs_csum_bytes_to_leaves(struct btrfs_fs_info
*fs_info
, u64 csum_bytes
)
2888 u64 num_csums_per_leaf
;
2891 csum_size
= BTRFS_MAX_ITEM_SIZE(fs_info
);
2892 num_csums_per_leaf
= div64_u64(csum_size
,
2893 (u64
)btrfs_super_csum_size(fs_info
->super_copy
));
2894 num_csums
= div64_u64(csum_bytes
, fs_info
->sectorsize
);
2895 num_csums
+= num_csums_per_leaf
- 1;
2896 num_csums
= div64_u64(num_csums
, num_csums_per_leaf
);
2900 int btrfs_check_space_for_delayed_refs(struct btrfs_trans_handle
*trans
,
2901 struct btrfs_fs_info
*fs_info
)
2903 struct btrfs_block_rsv
*global_rsv
;
2904 u64 num_heads
= trans
->transaction
->delayed_refs
.num_heads_ready
;
2905 u64 csum_bytes
= trans
->transaction
->delayed_refs
.pending_csums
;
2906 u64 num_dirty_bgs
= trans
->transaction
->num_dirty_bgs
;
2907 u64 num_bytes
, num_dirty_bgs_bytes
;
2910 num_bytes
= btrfs_calc_trans_metadata_size(fs_info
, 1);
2911 num_heads
= heads_to_leaves(fs_info
, num_heads
);
2913 num_bytes
+= (num_heads
- 1) * fs_info
->nodesize
;
2915 num_bytes
+= btrfs_csum_bytes_to_leaves(fs_info
, csum_bytes
) *
2917 num_dirty_bgs_bytes
= btrfs_calc_trans_metadata_size(fs_info
,
2919 global_rsv
= &fs_info
->global_block_rsv
;
2922 * If we can't allocate any more chunks lets make sure we have _lots_ of
2923 * wiggle room since running delayed refs can create more delayed refs.
2925 if (global_rsv
->space_info
->full
) {
2926 num_dirty_bgs_bytes
<<= 1;
2930 spin_lock(&global_rsv
->lock
);
2931 if (global_rsv
->reserved
<= num_bytes
+ num_dirty_bgs_bytes
)
2933 spin_unlock(&global_rsv
->lock
);
2937 int btrfs_should_throttle_delayed_refs(struct btrfs_trans_handle
*trans
,
2938 struct btrfs_fs_info
*fs_info
)
2941 atomic_read(&trans
->transaction
->delayed_refs
.num_entries
);
2946 avg_runtime
= fs_info
->avg_delayed_ref_runtime
;
2947 val
= num_entries
* avg_runtime
;
2948 if (val
>= NSEC_PER_SEC
)
2950 if (val
>= NSEC_PER_SEC
/ 2)
2953 return btrfs_check_space_for_delayed_refs(trans
, fs_info
);
2956 struct async_delayed_refs
{
2957 struct btrfs_root
*root
;
2962 struct completion wait
;
2963 struct btrfs_work work
;
2966 static inline struct async_delayed_refs
*
2967 to_async_delayed_refs(struct btrfs_work
*work
)
2969 return container_of(work
, struct async_delayed_refs
, work
);
2972 static void delayed_ref_async_start(struct btrfs_work
*work
)
2974 struct async_delayed_refs
*async
= to_async_delayed_refs(work
);
2975 struct btrfs_trans_handle
*trans
;
2976 struct btrfs_fs_info
*fs_info
= async
->root
->fs_info
;
2979 /* if the commit is already started, we don't need to wait here */
2980 if (btrfs_transaction_blocked(fs_info
))
2983 trans
= btrfs_join_transaction(async
->root
);
2984 if (IS_ERR(trans
)) {
2985 async
->error
= PTR_ERR(trans
);
2990 * trans->sync means that when we call end_transaction, we won't
2991 * wait on delayed refs
2995 /* Don't bother flushing if we got into a different transaction */
2996 if (trans
->transid
> async
->transid
)
2999 ret
= btrfs_run_delayed_refs(trans
, fs_info
, async
->count
);
3003 ret
= btrfs_end_transaction(trans
);
3004 if (ret
&& !async
->error
)
3008 complete(&async
->wait
);
3013 int btrfs_async_run_delayed_refs(struct btrfs_fs_info
*fs_info
,
3014 unsigned long count
, u64 transid
, int wait
)
3016 struct async_delayed_refs
*async
;
3019 async
= kmalloc(sizeof(*async
), GFP_NOFS
);
3023 async
->root
= fs_info
->tree_root
;
3024 async
->count
= count
;
3026 async
->transid
= transid
;
3031 init_completion(&async
->wait
);
3033 btrfs_init_work(&async
->work
, btrfs_extent_refs_helper
,
3034 delayed_ref_async_start
, NULL
, NULL
);
3036 btrfs_queue_work(fs_info
->extent_workers
, &async
->work
);
3039 wait_for_completion(&async
->wait
);
3048 * this starts processing the delayed reference count updates and
3049 * extent insertions we have queued up so far. count can be
3050 * 0, which means to process everything in the tree at the start
3051 * of the run (but not newly added entries), or it can be some target
3052 * number you'd like to process.
3054 * Returns 0 on success or if called with an aborted transaction
3055 * Returns <0 on error and aborts the transaction
3057 int btrfs_run_delayed_refs(struct btrfs_trans_handle
*trans
,
3058 struct btrfs_fs_info
*fs_info
, unsigned long count
)
3060 struct rb_node
*node
;
3061 struct btrfs_delayed_ref_root
*delayed_refs
;
3062 struct btrfs_delayed_ref_head
*head
;
3064 int run_all
= count
== (unsigned long)-1;
3066 /* We'll clean this up in btrfs_cleanup_transaction */
3070 if (test_bit(BTRFS_FS_CREATING_FREE_SPACE_TREE
, &fs_info
->flags
))
3073 delayed_refs
= &trans
->transaction
->delayed_refs
;
3075 count
= atomic_read(&delayed_refs
->num_entries
) * 2;
3078 #ifdef SCRAMBLE_DELAYED_REFS
3079 delayed_refs
->run_delayed_start
= find_middle(&delayed_refs
->root
);
3081 ret
= __btrfs_run_delayed_refs(trans
, fs_info
, count
);
3083 btrfs_abort_transaction(trans
, ret
);
3088 if (!list_empty(&trans
->new_bgs
))
3089 btrfs_create_pending_block_groups(trans
, fs_info
);
3091 spin_lock(&delayed_refs
->lock
);
3092 node
= rb_first(&delayed_refs
->href_root
);
3094 spin_unlock(&delayed_refs
->lock
);
3097 head
= rb_entry(node
, struct btrfs_delayed_ref_head
,
3099 refcount_inc(&head
->refs
);
3100 spin_unlock(&delayed_refs
->lock
);
3102 /* Mutex was contended, block until it's released and retry. */
3103 mutex_lock(&head
->mutex
);
3104 mutex_unlock(&head
->mutex
);
3106 btrfs_put_delayed_ref_head(head
);
3114 int btrfs_set_disk_extent_flags(struct btrfs_trans_handle
*trans
,
3115 struct btrfs_fs_info
*fs_info
,
3116 u64 bytenr
, u64 num_bytes
, u64 flags
,
3117 int level
, int is_data
)
3119 struct btrfs_delayed_extent_op
*extent_op
;
3122 extent_op
= btrfs_alloc_delayed_extent_op();
3126 extent_op
->flags_to_set
= flags
;
3127 extent_op
->update_flags
= true;
3128 extent_op
->update_key
= false;
3129 extent_op
->is_data
= is_data
? true : false;
3130 extent_op
->level
= level
;
3132 ret
= btrfs_add_delayed_extent_op(fs_info
, trans
, bytenr
,
3133 num_bytes
, extent_op
);
3135 btrfs_free_delayed_extent_op(extent_op
);
3139 static noinline
int check_delayed_ref(struct btrfs_root
*root
,
3140 struct btrfs_path
*path
,
3141 u64 objectid
, u64 offset
, u64 bytenr
)
3143 struct btrfs_delayed_ref_head
*head
;
3144 struct btrfs_delayed_ref_node
*ref
;
3145 struct btrfs_delayed_data_ref
*data_ref
;
3146 struct btrfs_delayed_ref_root
*delayed_refs
;
3147 struct btrfs_transaction
*cur_trans
;
3148 struct rb_node
*node
;
3151 spin_lock(&root
->fs_info
->trans_lock
);
3152 cur_trans
= root
->fs_info
->running_transaction
;
3154 refcount_inc(&cur_trans
->use_count
);
3155 spin_unlock(&root
->fs_info
->trans_lock
);
3159 delayed_refs
= &cur_trans
->delayed_refs
;
3160 spin_lock(&delayed_refs
->lock
);
3161 head
= btrfs_find_delayed_ref_head(delayed_refs
, bytenr
);
3163 spin_unlock(&delayed_refs
->lock
);
3164 btrfs_put_transaction(cur_trans
);
3168 if (!mutex_trylock(&head
->mutex
)) {
3169 refcount_inc(&head
->refs
);
3170 spin_unlock(&delayed_refs
->lock
);
3172 btrfs_release_path(path
);
3175 * Mutex was contended, block until it's released and let
3178 mutex_lock(&head
->mutex
);
3179 mutex_unlock(&head
->mutex
);
3180 btrfs_put_delayed_ref_head(head
);
3181 btrfs_put_transaction(cur_trans
);
3184 spin_unlock(&delayed_refs
->lock
);
3186 spin_lock(&head
->lock
);
3188 * XXX: We should replace this with a proper search function in the
3191 for (node
= rb_first(&head
->ref_tree
); node
; node
= rb_next(node
)) {
3192 ref
= rb_entry(node
, struct btrfs_delayed_ref_node
, ref_node
);
3193 /* If it's a shared ref we know a cross reference exists */
3194 if (ref
->type
!= BTRFS_EXTENT_DATA_REF_KEY
) {
3199 data_ref
= btrfs_delayed_node_to_data_ref(ref
);
3202 * If our ref doesn't match the one we're currently looking at
3203 * then we have a cross reference.
3205 if (data_ref
->root
!= root
->root_key
.objectid
||
3206 data_ref
->objectid
!= objectid
||
3207 data_ref
->offset
!= offset
) {
3212 spin_unlock(&head
->lock
);
3213 mutex_unlock(&head
->mutex
);
3214 btrfs_put_transaction(cur_trans
);
3218 static noinline
int check_committed_ref(struct btrfs_root
*root
,
3219 struct btrfs_path
*path
,
3220 u64 objectid
, u64 offset
, u64 bytenr
)
3222 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
3223 struct btrfs_root
*extent_root
= fs_info
->extent_root
;
3224 struct extent_buffer
*leaf
;
3225 struct btrfs_extent_data_ref
*ref
;
3226 struct btrfs_extent_inline_ref
*iref
;
3227 struct btrfs_extent_item
*ei
;
3228 struct btrfs_key key
;
3233 key
.objectid
= bytenr
;
3234 key
.offset
= (u64
)-1;
3235 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
3237 ret
= btrfs_search_slot(NULL
, extent_root
, &key
, path
, 0, 0);
3240 BUG_ON(ret
== 0); /* Corruption */
3243 if (path
->slots
[0] == 0)
3247 leaf
= path
->nodes
[0];
3248 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
3250 if (key
.objectid
!= bytenr
|| key
.type
!= BTRFS_EXTENT_ITEM_KEY
)
3254 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
3255 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
3256 if (item_size
< sizeof(*ei
)) {
3257 WARN_ON(item_size
!= sizeof(struct btrfs_extent_item_v0
));
3261 ei
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
3263 if (item_size
!= sizeof(*ei
) +
3264 btrfs_extent_inline_ref_size(BTRFS_EXTENT_DATA_REF_KEY
))
3267 if (btrfs_extent_generation(leaf
, ei
) <=
3268 btrfs_root_last_snapshot(&root
->root_item
))
3271 iref
= (struct btrfs_extent_inline_ref
*)(ei
+ 1);
3273 type
= btrfs_get_extent_inline_ref_type(leaf
, iref
, BTRFS_REF_TYPE_DATA
);
3274 if (type
!= BTRFS_EXTENT_DATA_REF_KEY
)
3277 ref
= (struct btrfs_extent_data_ref
*)(&iref
->offset
);
3278 if (btrfs_extent_refs(leaf
, ei
) !=
3279 btrfs_extent_data_ref_count(leaf
, ref
) ||
3280 btrfs_extent_data_ref_root(leaf
, ref
) !=
3281 root
->root_key
.objectid
||
3282 btrfs_extent_data_ref_objectid(leaf
, ref
) != objectid
||
3283 btrfs_extent_data_ref_offset(leaf
, ref
) != offset
)
3291 int btrfs_cross_ref_exist(struct btrfs_root
*root
, u64 objectid
, u64 offset
,
3294 struct btrfs_path
*path
;
3298 path
= btrfs_alloc_path();
3303 ret
= check_committed_ref(root
, path
, objectid
,
3305 if (ret
&& ret
!= -ENOENT
)
3308 ret2
= check_delayed_ref(root
, path
, objectid
,
3310 } while (ret2
== -EAGAIN
);
3312 if (ret2
&& ret2
!= -ENOENT
) {
3317 if (ret
!= -ENOENT
|| ret2
!= -ENOENT
)
3320 btrfs_free_path(path
);
3321 if (root
->root_key
.objectid
== BTRFS_DATA_RELOC_TREE_OBJECTID
)
3326 static int __btrfs_mod_ref(struct btrfs_trans_handle
*trans
,
3327 struct btrfs_root
*root
,
3328 struct extent_buffer
*buf
,
3329 int full_backref
, int inc
)
3331 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
3337 struct btrfs_key key
;
3338 struct btrfs_file_extent_item
*fi
;
3342 int (*process_func
)(struct btrfs_trans_handle
*,
3343 struct btrfs_root
*,
3344 u64
, u64
, u64
, u64
, u64
, u64
);
3347 if (btrfs_is_testing(fs_info
))
3350 ref_root
= btrfs_header_owner(buf
);
3351 nritems
= btrfs_header_nritems(buf
);
3352 level
= btrfs_header_level(buf
);
3354 if (!test_bit(BTRFS_ROOT_REF_COWS
, &root
->state
) && level
== 0)
3358 process_func
= btrfs_inc_extent_ref
;
3360 process_func
= btrfs_free_extent
;
3363 parent
= buf
->start
;
3367 for (i
= 0; i
< nritems
; i
++) {
3369 btrfs_item_key_to_cpu(buf
, &key
, i
);
3370 if (key
.type
!= BTRFS_EXTENT_DATA_KEY
)
3372 fi
= btrfs_item_ptr(buf
, i
,
3373 struct btrfs_file_extent_item
);
3374 if (btrfs_file_extent_type(buf
, fi
) ==
3375 BTRFS_FILE_EXTENT_INLINE
)
3377 bytenr
= btrfs_file_extent_disk_bytenr(buf
, fi
);
3381 num_bytes
= btrfs_file_extent_disk_num_bytes(buf
, fi
);
3382 key
.offset
-= btrfs_file_extent_offset(buf
, fi
);
3383 ret
= process_func(trans
, root
, bytenr
, num_bytes
,
3384 parent
, ref_root
, key
.objectid
,
3389 bytenr
= btrfs_node_blockptr(buf
, i
);
3390 num_bytes
= fs_info
->nodesize
;
3391 ret
= process_func(trans
, root
, bytenr
, num_bytes
,
3392 parent
, ref_root
, level
- 1, 0);
3402 int btrfs_inc_ref(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
3403 struct extent_buffer
*buf
, int full_backref
)
3405 return __btrfs_mod_ref(trans
, root
, buf
, full_backref
, 1);
3408 int btrfs_dec_ref(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
3409 struct extent_buffer
*buf
, int full_backref
)
3411 return __btrfs_mod_ref(trans
, root
, buf
, full_backref
, 0);
3414 static int write_one_cache_group(struct btrfs_trans_handle
*trans
,
3415 struct btrfs_fs_info
*fs_info
,
3416 struct btrfs_path
*path
,
3417 struct btrfs_block_group_cache
*cache
)
3420 struct btrfs_root
*extent_root
= fs_info
->extent_root
;
3422 struct extent_buffer
*leaf
;
3424 ret
= btrfs_search_slot(trans
, extent_root
, &cache
->key
, path
, 0, 1);
3431 leaf
= path
->nodes
[0];
3432 bi
= btrfs_item_ptr_offset(leaf
, path
->slots
[0]);
3433 write_extent_buffer(leaf
, &cache
->item
, bi
, sizeof(cache
->item
));
3434 btrfs_mark_buffer_dirty(leaf
);
3436 btrfs_release_path(path
);
3441 static struct btrfs_block_group_cache
*
3442 next_block_group(struct btrfs_fs_info
*fs_info
,
3443 struct btrfs_block_group_cache
*cache
)
3445 struct rb_node
*node
;
3447 spin_lock(&fs_info
->block_group_cache_lock
);
3449 /* If our block group was removed, we need a full search. */
3450 if (RB_EMPTY_NODE(&cache
->cache_node
)) {
3451 const u64 next_bytenr
= cache
->key
.objectid
+ cache
->key
.offset
;
3453 spin_unlock(&fs_info
->block_group_cache_lock
);
3454 btrfs_put_block_group(cache
);
3455 cache
= btrfs_lookup_first_block_group(fs_info
, next_bytenr
); return cache
;
3457 node
= rb_next(&cache
->cache_node
);
3458 btrfs_put_block_group(cache
);
3460 cache
= rb_entry(node
, struct btrfs_block_group_cache
,
3462 btrfs_get_block_group(cache
);
3465 spin_unlock(&fs_info
->block_group_cache_lock
);
3469 static int cache_save_setup(struct btrfs_block_group_cache
*block_group
,
3470 struct btrfs_trans_handle
*trans
,
3471 struct btrfs_path
*path
)
3473 struct btrfs_fs_info
*fs_info
= block_group
->fs_info
;
3474 struct btrfs_root
*root
= fs_info
->tree_root
;
3475 struct inode
*inode
= NULL
;
3476 struct extent_changeset
*data_reserved
= NULL
;
3478 int dcs
= BTRFS_DC_ERROR
;
3484 * If this block group is smaller than 100 megs don't bother caching the
3487 if (block_group
->key
.offset
< (100 * SZ_1M
)) {
3488 spin_lock(&block_group
->lock
);
3489 block_group
->disk_cache_state
= BTRFS_DC_WRITTEN
;
3490 spin_unlock(&block_group
->lock
);
3497 inode
= lookup_free_space_inode(fs_info
, block_group
, path
);
3498 if (IS_ERR(inode
) && PTR_ERR(inode
) != -ENOENT
) {
3499 ret
= PTR_ERR(inode
);
3500 btrfs_release_path(path
);
3504 if (IS_ERR(inode
)) {
3508 if (block_group
->ro
)
3511 ret
= create_free_space_inode(fs_info
, trans
, block_group
,
3519 * We want to set the generation to 0, that way if anything goes wrong
3520 * from here on out we know not to trust this cache when we load up next
3523 BTRFS_I(inode
)->generation
= 0;
3524 ret
= btrfs_update_inode(trans
, root
, inode
);
3527 * So theoretically we could recover from this, simply set the
3528 * super cache generation to 0 so we know to invalidate the
3529 * cache, but then we'd have to keep track of the block groups
3530 * that fail this way so we know we _have_ to reset this cache
3531 * before the next commit or risk reading stale cache. So to
3532 * limit our exposure to horrible edge cases lets just abort the
3533 * transaction, this only happens in really bad situations
3536 btrfs_abort_transaction(trans
, ret
);
3541 /* We've already setup this transaction, go ahead and exit */
3542 if (block_group
->cache_generation
== trans
->transid
&&
3543 i_size_read(inode
)) {
3544 dcs
= BTRFS_DC_SETUP
;
3548 if (i_size_read(inode
) > 0) {
3549 ret
= btrfs_check_trunc_cache_free_space(fs_info
,
3550 &fs_info
->global_block_rsv
);
3554 ret
= btrfs_truncate_free_space_cache(trans
, NULL
, inode
);
3559 spin_lock(&block_group
->lock
);
3560 if (block_group
->cached
!= BTRFS_CACHE_FINISHED
||
3561 !btrfs_test_opt(fs_info
, SPACE_CACHE
)) {
3563 * don't bother trying to write stuff out _if_
3564 * a) we're not cached,
3565 * b) we're with nospace_cache mount option,
3566 * c) we're with v2 space_cache (FREE_SPACE_TREE).
3568 dcs
= BTRFS_DC_WRITTEN
;
3569 spin_unlock(&block_group
->lock
);
3572 spin_unlock(&block_group
->lock
);
3575 * We hit an ENOSPC when setting up the cache in this transaction, just
3576 * skip doing the setup, we've already cleared the cache so we're safe.
3578 if (test_bit(BTRFS_TRANS_CACHE_ENOSPC
, &trans
->transaction
->flags
)) {
3584 * Try to preallocate enough space based on how big the block group is.
3585 * Keep in mind this has to include any pinned space which could end up
3586 * taking up quite a bit since it's not folded into the other space
3589 num_pages
= div_u64(block_group
->key
.offset
, SZ_256M
);
3594 num_pages
*= PAGE_SIZE
;
3596 ret
= btrfs_check_data_free_space(inode
, &data_reserved
, 0, num_pages
);
3600 ret
= btrfs_prealloc_file_range_trans(inode
, trans
, 0, 0, num_pages
,
3601 num_pages
, num_pages
,
3604 * Our cache requires contiguous chunks so that we don't modify a bunch
3605 * of metadata or split extents when writing the cache out, which means
3606 * we can enospc if we are heavily fragmented in addition to just normal
3607 * out of space conditions. So if we hit this just skip setting up any
3608 * other block groups for this transaction, maybe we'll unpin enough
3609 * space the next time around.
3612 dcs
= BTRFS_DC_SETUP
;
3613 else if (ret
== -ENOSPC
)
3614 set_bit(BTRFS_TRANS_CACHE_ENOSPC
, &trans
->transaction
->flags
);
3619 btrfs_release_path(path
);
3621 spin_lock(&block_group
->lock
);
3622 if (!ret
&& dcs
== BTRFS_DC_SETUP
)
3623 block_group
->cache_generation
= trans
->transid
;
3624 block_group
->disk_cache_state
= dcs
;
3625 spin_unlock(&block_group
->lock
);
3627 extent_changeset_free(data_reserved
);
3631 int btrfs_setup_space_cache(struct btrfs_trans_handle
*trans
,
3632 struct btrfs_fs_info
*fs_info
)
3634 struct btrfs_block_group_cache
*cache
, *tmp
;
3635 struct btrfs_transaction
*cur_trans
= trans
->transaction
;
3636 struct btrfs_path
*path
;
3638 if (list_empty(&cur_trans
->dirty_bgs
) ||
3639 !btrfs_test_opt(fs_info
, SPACE_CACHE
))
3642 path
= btrfs_alloc_path();
3646 /* Could add new block groups, use _safe just in case */
3647 list_for_each_entry_safe(cache
, tmp
, &cur_trans
->dirty_bgs
,
3649 if (cache
->disk_cache_state
== BTRFS_DC_CLEAR
)
3650 cache_save_setup(cache
, trans
, path
);
3653 btrfs_free_path(path
);
3658 * transaction commit does final block group cache writeback during a
3659 * critical section where nothing is allowed to change the FS. This is
3660 * required in order for the cache to actually match the block group,
3661 * but can introduce a lot of latency into the commit.
3663 * So, btrfs_start_dirty_block_groups is here to kick off block group
3664 * cache IO. There's a chance we'll have to redo some of it if the
3665 * block group changes again during the commit, but it greatly reduces
3666 * the commit latency by getting rid of the easy block groups while
3667 * we're still allowing others to join the commit.
3669 int btrfs_start_dirty_block_groups(struct btrfs_trans_handle
*trans
,
3670 struct btrfs_fs_info
*fs_info
)
3672 struct btrfs_block_group_cache
*cache
;
3673 struct btrfs_transaction
*cur_trans
= trans
->transaction
;
3676 struct btrfs_path
*path
= NULL
;
3678 struct list_head
*io
= &cur_trans
->io_bgs
;
3679 int num_started
= 0;
3682 spin_lock(&cur_trans
->dirty_bgs_lock
);
3683 if (list_empty(&cur_trans
->dirty_bgs
)) {
3684 spin_unlock(&cur_trans
->dirty_bgs_lock
);
3687 list_splice_init(&cur_trans
->dirty_bgs
, &dirty
);
3688 spin_unlock(&cur_trans
->dirty_bgs_lock
);
3692 * make sure all the block groups on our dirty list actually
3695 btrfs_create_pending_block_groups(trans
, fs_info
);
3698 path
= btrfs_alloc_path();
3704 * cache_write_mutex is here only to save us from balance or automatic
3705 * removal of empty block groups deleting this block group while we are
3706 * writing out the cache
3708 mutex_lock(&trans
->transaction
->cache_write_mutex
);
3709 while (!list_empty(&dirty
)) {
3710 cache
= list_first_entry(&dirty
,
3711 struct btrfs_block_group_cache
,
3714 * this can happen if something re-dirties a block
3715 * group that is already under IO. Just wait for it to
3716 * finish and then do it all again
3718 if (!list_empty(&cache
->io_list
)) {
3719 list_del_init(&cache
->io_list
);
3720 btrfs_wait_cache_io(trans
, cache
, path
);
3721 btrfs_put_block_group(cache
);
3726 * btrfs_wait_cache_io uses the cache->dirty_list to decide
3727 * if it should update the cache_state. Don't delete
3728 * until after we wait.
3730 * Since we're not running in the commit critical section
3731 * we need the dirty_bgs_lock to protect from update_block_group
3733 spin_lock(&cur_trans
->dirty_bgs_lock
);
3734 list_del_init(&cache
->dirty_list
);
3735 spin_unlock(&cur_trans
->dirty_bgs_lock
);
3739 cache_save_setup(cache
, trans
, path
);
3741 if (cache
->disk_cache_state
== BTRFS_DC_SETUP
) {
3742 cache
->io_ctl
.inode
= NULL
;
3743 ret
= btrfs_write_out_cache(fs_info
, trans
,
3745 if (ret
== 0 && cache
->io_ctl
.inode
) {
3750 * the cache_write_mutex is protecting
3753 list_add_tail(&cache
->io_list
, io
);
3756 * if we failed to write the cache, the
3757 * generation will be bad and life goes on
3763 ret
= write_one_cache_group(trans
, fs_info
,
3766 * Our block group might still be attached to the list
3767 * of new block groups in the transaction handle of some
3768 * other task (struct btrfs_trans_handle->new_bgs). This
3769 * means its block group item isn't yet in the extent
3770 * tree. If this happens ignore the error, as we will
3771 * try again later in the critical section of the
3772 * transaction commit.
3774 if (ret
== -ENOENT
) {
3776 spin_lock(&cur_trans
->dirty_bgs_lock
);
3777 if (list_empty(&cache
->dirty_list
)) {
3778 list_add_tail(&cache
->dirty_list
,
3779 &cur_trans
->dirty_bgs
);
3780 btrfs_get_block_group(cache
);
3782 spin_unlock(&cur_trans
->dirty_bgs_lock
);
3784 btrfs_abort_transaction(trans
, ret
);
3788 /* if its not on the io list, we need to put the block group */
3790 btrfs_put_block_group(cache
);
3796 * Avoid blocking other tasks for too long. It might even save
3797 * us from writing caches for block groups that are going to be
3800 mutex_unlock(&trans
->transaction
->cache_write_mutex
);
3801 mutex_lock(&trans
->transaction
->cache_write_mutex
);
3803 mutex_unlock(&trans
->transaction
->cache_write_mutex
);
3806 * go through delayed refs for all the stuff we've just kicked off
3807 * and then loop back (just once)
3809 ret
= btrfs_run_delayed_refs(trans
, fs_info
, 0);
3810 if (!ret
&& loops
== 0) {
3812 spin_lock(&cur_trans
->dirty_bgs_lock
);
3813 list_splice_init(&cur_trans
->dirty_bgs
, &dirty
);
3815 * dirty_bgs_lock protects us from concurrent block group
3816 * deletes too (not just cache_write_mutex).
3818 if (!list_empty(&dirty
)) {
3819 spin_unlock(&cur_trans
->dirty_bgs_lock
);
3822 spin_unlock(&cur_trans
->dirty_bgs_lock
);
3823 } else if (ret
< 0) {
3824 btrfs_cleanup_dirty_bgs(cur_trans
, fs_info
);
3827 btrfs_free_path(path
);
3831 int btrfs_write_dirty_block_groups(struct btrfs_trans_handle
*trans
,
3832 struct btrfs_fs_info
*fs_info
)
3834 struct btrfs_block_group_cache
*cache
;
3835 struct btrfs_transaction
*cur_trans
= trans
->transaction
;
3838 struct btrfs_path
*path
;
3839 struct list_head
*io
= &cur_trans
->io_bgs
;
3840 int num_started
= 0;
3842 path
= btrfs_alloc_path();
3847 * Even though we are in the critical section of the transaction commit,
3848 * we can still have concurrent tasks adding elements to this
3849 * transaction's list of dirty block groups. These tasks correspond to
3850 * endio free space workers started when writeback finishes for a
3851 * space cache, which run inode.c:btrfs_finish_ordered_io(), and can
3852 * allocate new block groups as a result of COWing nodes of the root
3853 * tree when updating the free space inode. The writeback for the space
3854 * caches is triggered by an earlier call to
3855 * btrfs_start_dirty_block_groups() and iterations of the following
3857 * Also we want to do the cache_save_setup first and then run the
3858 * delayed refs to make sure we have the best chance at doing this all
3861 spin_lock(&cur_trans
->dirty_bgs_lock
);
3862 while (!list_empty(&cur_trans
->dirty_bgs
)) {
3863 cache
= list_first_entry(&cur_trans
->dirty_bgs
,
3864 struct btrfs_block_group_cache
,
3868 * this can happen if cache_save_setup re-dirties a block
3869 * group that is already under IO. Just wait for it to
3870 * finish and then do it all again
3872 if (!list_empty(&cache
->io_list
)) {
3873 spin_unlock(&cur_trans
->dirty_bgs_lock
);
3874 list_del_init(&cache
->io_list
);
3875 btrfs_wait_cache_io(trans
, cache
, path
);
3876 btrfs_put_block_group(cache
);
3877 spin_lock(&cur_trans
->dirty_bgs_lock
);
3881 * don't remove from the dirty list until after we've waited
3884 list_del_init(&cache
->dirty_list
);
3885 spin_unlock(&cur_trans
->dirty_bgs_lock
);
3888 cache_save_setup(cache
, trans
, path
);
3891 ret
= btrfs_run_delayed_refs(trans
, fs_info
,
3892 (unsigned long) -1);
3894 if (!ret
&& cache
->disk_cache_state
== BTRFS_DC_SETUP
) {
3895 cache
->io_ctl
.inode
= NULL
;
3896 ret
= btrfs_write_out_cache(fs_info
, trans
,
3898 if (ret
== 0 && cache
->io_ctl
.inode
) {
3901 list_add_tail(&cache
->io_list
, io
);
3904 * if we failed to write the cache, the
3905 * generation will be bad and life goes on
3911 ret
= write_one_cache_group(trans
, fs_info
,
3914 * One of the free space endio workers might have
3915 * created a new block group while updating a free space
3916 * cache's inode (at inode.c:btrfs_finish_ordered_io())
3917 * and hasn't released its transaction handle yet, in
3918 * which case the new block group is still attached to
3919 * its transaction handle and its creation has not
3920 * finished yet (no block group item in the extent tree
3921 * yet, etc). If this is the case, wait for all free
3922 * space endio workers to finish and retry. This is a
3923 * a very rare case so no need for a more efficient and
3926 if (ret
== -ENOENT
) {
3927 wait_event(cur_trans
->writer_wait
,
3928 atomic_read(&cur_trans
->num_writers
) == 1);
3929 ret
= write_one_cache_group(trans
, fs_info
,
3933 btrfs_abort_transaction(trans
, ret
);
3936 /* if its not on the io list, we need to put the block group */
3938 btrfs_put_block_group(cache
);
3939 spin_lock(&cur_trans
->dirty_bgs_lock
);
3941 spin_unlock(&cur_trans
->dirty_bgs_lock
);
3943 while (!list_empty(io
)) {
3944 cache
= list_first_entry(io
, struct btrfs_block_group_cache
,
3946 list_del_init(&cache
->io_list
);
3947 btrfs_wait_cache_io(trans
, cache
, path
);
3948 btrfs_put_block_group(cache
);
3951 btrfs_free_path(path
);
3955 int btrfs_extent_readonly(struct btrfs_fs_info
*fs_info
, u64 bytenr
)
3957 struct btrfs_block_group_cache
*block_group
;
3960 block_group
= btrfs_lookup_block_group(fs_info
, bytenr
);
3961 if (!block_group
|| block_group
->ro
)
3964 btrfs_put_block_group(block_group
);
3968 bool btrfs_inc_nocow_writers(struct btrfs_fs_info
*fs_info
, u64 bytenr
)
3970 struct btrfs_block_group_cache
*bg
;
3973 bg
= btrfs_lookup_block_group(fs_info
, bytenr
);
3977 spin_lock(&bg
->lock
);
3981 atomic_inc(&bg
->nocow_writers
);
3982 spin_unlock(&bg
->lock
);
3984 /* no put on block group, done by btrfs_dec_nocow_writers */
3986 btrfs_put_block_group(bg
);
3992 void btrfs_dec_nocow_writers(struct btrfs_fs_info
*fs_info
, u64 bytenr
)
3994 struct btrfs_block_group_cache
*bg
;
3996 bg
= btrfs_lookup_block_group(fs_info
, bytenr
);
3998 if (atomic_dec_and_test(&bg
->nocow_writers
))
3999 wake_up_atomic_t(&bg
->nocow_writers
);
4001 * Once for our lookup and once for the lookup done by a previous call
4002 * to btrfs_inc_nocow_writers()
4004 btrfs_put_block_group(bg
);
4005 btrfs_put_block_group(bg
);
4008 void btrfs_wait_nocow_writers(struct btrfs_block_group_cache
*bg
)
4010 wait_on_atomic_t(&bg
->nocow_writers
, atomic_t_wait
,
4011 TASK_UNINTERRUPTIBLE
);
4014 static const char *alloc_name(u64 flags
)
4017 case BTRFS_BLOCK_GROUP_METADATA
|BTRFS_BLOCK_GROUP_DATA
:
4019 case BTRFS_BLOCK_GROUP_METADATA
:
4021 case BTRFS_BLOCK_GROUP_DATA
:
4023 case BTRFS_BLOCK_GROUP_SYSTEM
:
4027 return "invalid-combination";
4031 static int create_space_info(struct btrfs_fs_info
*info
, u64 flags
,
4032 struct btrfs_space_info
**new)
4035 struct btrfs_space_info
*space_info
;
4039 space_info
= kzalloc(sizeof(*space_info
), GFP_NOFS
);
4043 ret
= percpu_counter_init(&space_info
->total_bytes_pinned
, 0,
4050 for (i
= 0; i
< BTRFS_NR_RAID_TYPES
; i
++)
4051 INIT_LIST_HEAD(&space_info
->block_groups
[i
]);
4052 init_rwsem(&space_info
->groups_sem
);
4053 spin_lock_init(&space_info
->lock
);
4054 space_info
->flags
= flags
& BTRFS_BLOCK_GROUP_TYPE_MASK
;
4055 space_info
->force_alloc
= CHUNK_ALLOC_NO_FORCE
;
4056 init_waitqueue_head(&space_info
->wait
);
4057 INIT_LIST_HEAD(&space_info
->ro_bgs
);
4058 INIT_LIST_HEAD(&space_info
->tickets
);
4059 INIT_LIST_HEAD(&space_info
->priority_tickets
);
4061 ret
= kobject_init_and_add(&space_info
->kobj
, &space_info_ktype
,
4062 info
->space_info_kobj
, "%s",
4063 alloc_name(space_info
->flags
));
4065 percpu_counter_destroy(&space_info
->total_bytes_pinned
);
4071 list_add_rcu(&space_info
->list
, &info
->space_info
);
4072 if (flags
& BTRFS_BLOCK_GROUP_DATA
)
4073 info
->data_sinfo
= space_info
;
4078 static void update_space_info(struct btrfs_fs_info
*info
, u64 flags
,
4079 u64 total_bytes
, u64 bytes_used
,
4081 struct btrfs_space_info
**space_info
)
4083 struct btrfs_space_info
*found
;
4086 if (flags
& (BTRFS_BLOCK_GROUP_DUP
| BTRFS_BLOCK_GROUP_RAID1
|
4087 BTRFS_BLOCK_GROUP_RAID10
))
4092 found
= __find_space_info(info
, flags
);
4094 spin_lock(&found
->lock
);
4095 found
->total_bytes
+= total_bytes
;
4096 found
->disk_total
+= total_bytes
* factor
;
4097 found
->bytes_used
+= bytes_used
;
4098 found
->disk_used
+= bytes_used
* factor
;
4099 found
->bytes_readonly
+= bytes_readonly
;
4100 if (total_bytes
> 0)
4102 space_info_add_new_bytes(info
, found
, total_bytes
-
4103 bytes_used
- bytes_readonly
);
4104 spin_unlock(&found
->lock
);
4105 *space_info
= found
;
4108 static void set_avail_alloc_bits(struct btrfs_fs_info
*fs_info
, u64 flags
)
4110 u64 extra_flags
= chunk_to_extended(flags
) &
4111 BTRFS_EXTENDED_PROFILE_MASK
;
4113 write_seqlock(&fs_info
->profiles_lock
);
4114 if (flags
& BTRFS_BLOCK_GROUP_DATA
)
4115 fs_info
->avail_data_alloc_bits
|= extra_flags
;
4116 if (flags
& BTRFS_BLOCK_GROUP_METADATA
)
4117 fs_info
->avail_metadata_alloc_bits
|= extra_flags
;
4118 if (flags
& BTRFS_BLOCK_GROUP_SYSTEM
)
4119 fs_info
->avail_system_alloc_bits
|= extra_flags
;
4120 write_sequnlock(&fs_info
->profiles_lock
);
4124 * returns target flags in extended format or 0 if restripe for this
4125 * chunk_type is not in progress
4127 * should be called with either volume_mutex or balance_lock held
4129 static u64
get_restripe_target(struct btrfs_fs_info
*fs_info
, u64 flags
)
4131 struct btrfs_balance_control
*bctl
= fs_info
->balance_ctl
;
4137 if (flags
& BTRFS_BLOCK_GROUP_DATA
&&
4138 bctl
->data
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) {
4139 target
= BTRFS_BLOCK_GROUP_DATA
| bctl
->data
.target
;
4140 } else if (flags
& BTRFS_BLOCK_GROUP_SYSTEM
&&
4141 bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) {
4142 target
= BTRFS_BLOCK_GROUP_SYSTEM
| bctl
->sys
.target
;
4143 } else if (flags
& BTRFS_BLOCK_GROUP_METADATA
&&
4144 bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) {
4145 target
= BTRFS_BLOCK_GROUP_METADATA
| bctl
->meta
.target
;
4152 * @flags: available profiles in extended format (see ctree.h)
4154 * Returns reduced profile in chunk format. If profile changing is in
4155 * progress (either running or paused) picks the target profile (if it's
4156 * already available), otherwise falls back to plain reducing.
4158 static u64
btrfs_reduce_alloc_profile(struct btrfs_fs_info
*fs_info
, u64 flags
)
4160 u64 num_devices
= fs_info
->fs_devices
->rw_devices
;
4166 * see if restripe for this chunk_type is in progress, if so
4167 * try to reduce to the target profile
4169 spin_lock(&fs_info
->balance_lock
);
4170 target
= get_restripe_target(fs_info
, flags
);
4172 /* pick target profile only if it's already available */
4173 if ((flags
& target
) & BTRFS_EXTENDED_PROFILE_MASK
) {
4174 spin_unlock(&fs_info
->balance_lock
);
4175 return extended_to_chunk(target
);
4178 spin_unlock(&fs_info
->balance_lock
);
4180 /* First, mask out the RAID levels which aren't possible */
4181 for (raid_type
= 0; raid_type
< BTRFS_NR_RAID_TYPES
; raid_type
++) {
4182 if (num_devices
>= btrfs_raid_array
[raid_type
].devs_min
)
4183 allowed
|= btrfs_raid_group
[raid_type
];
4187 if (allowed
& BTRFS_BLOCK_GROUP_RAID6
)
4188 allowed
= BTRFS_BLOCK_GROUP_RAID6
;
4189 else if (allowed
& BTRFS_BLOCK_GROUP_RAID5
)
4190 allowed
= BTRFS_BLOCK_GROUP_RAID5
;
4191 else if (allowed
& BTRFS_BLOCK_GROUP_RAID10
)
4192 allowed
= BTRFS_BLOCK_GROUP_RAID10
;
4193 else if (allowed
& BTRFS_BLOCK_GROUP_RAID1
)
4194 allowed
= BTRFS_BLOCK_GROUP_RAID1
;
4195 else if (allowed
& BTRFS_BLOCK_GROUP_RAID0
)
4196 allowed
= BTRFS_BLOCK_GROUP_RAID0
;
4198 flags
&= ~BTRFS_BLOCK_GROUP_PROFILE_MASK
;
4200 return extended_to_chunk(flags
| allowed
);
4203 static u64
get_alloc_profile(struct btrfs_fs_info
*fs_info
, u64 orig_flags
)
4210 seq
= read_seqbegin(&fs_info
->profiles_lock
);
4212 if (flags
& BTRFS_BLOCK_GROUP_DATA
)
4213 flags
|= fs_info
->avail_data_alloc_bits
;
4214 else if (flags
& BTRFS_BLOCK_GROUP_SYSTEM
)
4215 flags
|= fs_info
->avail_system_alloc_bits
;
4216 else if (flags
& BTRFS_BLOCK_GROUP_METADATA
)
4217 flags
|= fs_info
->avail_metadata_alloc_bits
;
4218 } while (read_seqretry(&fs_info
->profiles_lock
, seq
));
4220 return btrfs_reduce_alloc_profile(fs_info
, flags
);
4223 static u64
get_alloc_profile_by_root(struct btrfs_root
*root
, int data
)
4225 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
4230 flags
= BTRFS_BLOCK_GROUP_DATA
;
4231 else if (root
== fs_info
->chunk_root
)
4232 flags
= BTRFS_BLOCK_GROUP_SYSTEM
;
4234 flags
= BTRFS_BLOCK_GROUP_METADATA
;
4236 ret
= get_alloc_profile(fs_info
, flags
);
4240 u64
btrfs_data_alloc_profile(struct btrfs_fs_info
*fs_info
)
4242 return get_alloc_profile(fs_info
, BTRFS_BLOCK_GROUP_DATA
);
4245 u64
btrfs_metadata_alloc_profile(struct btrfs_fs_info
*fs_info
)
4247 return get_alloc_profile(fs_info
, BTRFS_BLOCK_GROUP_METADATA
);
4250 u64
btrfs_system_alloc_profile(struct btrfs_fs_info
*fs_info
)
4252 return get_alloc_profile(fs_info
, BTRFS_BLOCK_GROUP_SYSTEM
);
4255 static u64
btrfs_space_info_used(struct btrfs_space_info
*s_info
,
4256 bool may_use_included
)
4259 return s_info
->bytes_used
+ s_info
->bytes_reserved
+
4260 s_info
->bytes_pinned
+ s_info
->bytes_readonly
+
4261 (may_use_included
? s_info
->bytes_may_use
: 0);
4264 int btrfs_alloc_data_chunk_ondemand(struct btrfs_inode
*inode
, u64 bytes
)
4266 struct btrfs_root
*root
= inode
->root
;
4267 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
4268 struct btrfs_space_info
*data_sinfo
= fs_info
->data_sinfo
;
4271 int need_commit
= 2;
4272 int have_pinned_space
;
4274 /* make sure bytes are sectorsize aligned */
4275 bytes
= ALIGN(bytes
, fs_info
->sectorsize
);
4277 if (btrfs_is_free_space_inode(inode
)) {
4279 ASSERT(current
->journal_info
);
4283 /* make sure we have enough space to handle the data first */
4284 spin_lock(&data_sinfo
->lock
);
4285 used
= btrfs_space_info_used(data_sinfo
, true);
4287 if (used
+ bytes
> data_sinfo
->total_bytes
) {
4288 struct btrfs_trans_handle
*trans
;
4291 * if we don't have enough free bytes in this space then we need
4292 * to alloc a new chunk.
4294 if (!data_sinfo
->full
) {
4297 data_sinfo
->force_alloc
= CHUNK_ALLOC_FORCE
;
4298 spin_unlock(&data_sinfo
->lock
);
4300 alloc_target
= btrfs_data_alloc_profile(fs_info
);
4302 * It is ugly that we don't call nolock join
4303 * transaction for the free space inode case here.
4304 * But it is safe because we only do the data space
4305 * reservation for the free space cache in the
4306 * transaction context, the common join transaction
4307 * just increase the counter of the current transaction
4308 * handler, doesn't try to acquire the trans_lock of
4311 trans
= btrfs_join_transaction(root
);
4313 return PTR_ERR(trans
);
4315 ret
= do_chunk_alloc(trans
, fs_info
, alloc_target
,
4316 CHUNK_ALLOC_NO_FORCE
);
4317 btrfs_end_transaction(trans
);
4322 have_pinned_space
= 1;
4331 * If we don't have enough pinned space to deal with this
4332 * allocation, and no removed chunk in current transaction,
4333 * don't bother committing the transaction.
4335 have_pinned_space
= percpu_counter_compare(
4336 &data_sinfo
->total_bytes_pinned
,
4337 used
+ bytes
- data_sinfo
->total_bytes
);
4338 spin_unlock(&data_sinfo
->lock
);
4340 /* commit the current transaction and try again */
4343 !atomic_read(&fs_info
->open_ioctl_trans
)) {
4346 if (need_commit
> 0) {
4347 btrfs_start_delalloc_roots(fs_info
, 0, -1);
4348 btrfs_wait_ordered_roots(fs_info
, U64_MAX
, 0,
4352 trans
= btrfs_join_transaction(root
);
4354 return PTR_ERR(trans
);
4355 if (have_pinned_space
>= 0 ||
4356 test_bit(BTRFS_TRANS_HAVE_FREE_BGS
,
4357 &trans
->transaction
->flags
) ||
4359 ret
= btrfs_commit_transaction(trans
);
4363 * The cleaner kthread might still be doing iput
4364 * operations. Wait for it to finish so that
4365 * more space is released.
4367 mutex_lock(&fs_info
->cleaner_delayed_iput_mutex
);
4368 mutex_unlock(&fs_info
->cleaner_delayed_iput_mutex
);
4371 btrfs_end_transaction(trans
);
4375 trace_btrfs_space_reservation(fs_info
,
4376 "space_info:enospc",
4377 data_sinfo
->flags
, bytes
, 1);
4380 data_sinfo
->bytes_may_use
+= bytes
;
4381 trace_btrfs_space_reservation(fs_info
, "space_info",
4382 data_sinfo
->flags
, bytes
, 1);
4383 spin_unlock(&data_sinfo
->lock
);
4388 int btrfs_check_data_free_space(struct inode
*inode
,
4389 struct extent_changeset
**reserved
, u64 start
, u64 len
)
4391 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
4394 /* align the range */
4395 len
= round_up(start
+ len
, fs_info
->sectorsize
) -
4396 round_down(start
, fs_info
->sectorsize
);
4397 start
= round_down(start
, fs_info
->sectorsize
);
4399 ret
= btrfs_alloc_data_chunk_ondemand(BTRFS_I(inode
), len
);
4403 /* Use new btrfs_qgroup_reserve_data to reserve precious data space. */
4404 ret
= btrfs_qgroup_reserve_data(inode
, reserved
, start
, len
);
4406 btrfs_free_reserved_data_space_noquota(inode
, start
, len
);
4413 * Called if we need to clear a data reservation for this inode
4414 * Normally in a error case.
4416 * This one will *NOT* use accurate qgroup reserved space API, just for case
4417 * which we can't sleep and is sure it won't affect qgroup reserved space.
4418 * Like clear_bit_hook().
4420 void btrfs_free_reserved_data_space_noquota(struct inode
*inode
, u64 start
,
4423 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
4424 struct btrfs_space_info
*data_sinfo
;
4426 /* Make sure the range is aligned to sectorsize */
4427 len
= round_up(start
+ len
, fs_info
->sectorsize
) -
4428 round_down(start
, fs_info
->sectorsize
);
4429 start
= round_down(start
, fs_info
->sectorsize
);
4431 data_sinfo
= fs_info
->data_sinfo
;
4432 spin_lock(&data_sinfo
->lock
);
4433 if (WARN_ON(data_sinfo
->bytes_may_use
< len
))
4434 data_sinfo
->bytes_may_use
= 0;
4436 data_sinfo
->bytes_may_use
-= len
;
4437 trace_btrfs_space_reservation(fs_info
, "space_info",
4438 data_sinfo
->flags
, len
, 0);
4439 spin_unlock(&data_sinfo
->lock
);
4443 * Called if we need to clear a data reservation for this inode
4444 * Normally in a error case.
4446 * This one will handle the per-inode data rsv map for accurate reserved
4449 void btrfs_free_reserved_data_space(struct inode
*inode
,
4450 struct extent_changeset
*reserved
, u64 start
, u64 len
)
4452 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4454 /* Make sure the range is aligned to sectorsize */
4455 len
= round_up(start
+ len
, root
->fs_info
->sectorsize
) -
4456 round_down(start
, root
->fs_info
->sectorsize
);
4457 start
= round_down(start
, root
->fs_info
->sectorsize
);
4459 btrfs_free_reserved_data_space_noquota(inode
, start
, len
);
4460 btrfs_qgroup_free_data(inode
, reserved
, start
, len
);
4463 static void force_metadata_allocation(struct btrfs_fs_info
*info
)
4465 struct list_head
*head
= &info
->space_info
;
4466 struct btrfs_space_info
*found
;
4469 list_for_each_entry_rcu(found
, head
, list
) {
4470 if (found
->flags
& BTRFS_BLOCK_GROUP_METADATA
)
4471 found
->force_alloc
= CHUNK_ALLOC_FORCE
;
4476 static inline u64
calc_global_rsv_need_space(struct btrfs_block_rsv
*global
)
4478 return (global
->size
<< 1);
4481 static int should_alloc_chunk(struct btrfs_fs_info
*fs_info
,
4482 struct btrfs_space_info
*sinfo
, int force
)
4484 struct btrfs_block_rsv
*global_rsv
= &fs_info
->global_block_rsv
;
4485 u64 bytes_used
= btrfs_space_info_used(sinfo
, false);
4488 if (force
== CHUNK_ALLOC_FORCE
)
4492 * We need to take into account the global rsv because for all intents
4493 * and purposes it's used space. Don't worry about locking the
4494 * global_rsv, it doesn't change except when the transaction commits.
4496 if (sinfo
->flags
& BTRFS_BLOCK_GROUP_METADATA
)
4497 bytes_used
+= calc_global_rsv_need_space(global_rsv
);
4500 * in limited mode, we want to have some free space up to
4501 * about 1% of the FS size.
4503 if (force
== CHUNK_ALLOC_LIMITED
) {
4504 thresh
= btrfs_super_total_bytes(fs_info
->super_copy
);
4505 thresh
= max_t(u64
, SZ_64M
, div_factor_fine(thresh
, 1));
4507 if (sinfo
->total_bytes
- bytes_used
< thresh
)
4511 if (bytes_used
+ SZ_2M
< div_factor(sinfo
->total_bytes
, 8))
4516 static u64
get_profile_num_devs(struct btrfs_fs_info
*fs_info
, u64 type
)
4520 if (type
& (BTRFS_BLOCK_GROUP_RAID10
|
4521 BTRFS_BLOCK_GROUP_RAID0
|
4522 BTRFS_BLOCK_GROUP_RAID5
|
4523 BTRFS_BLOCK_GROUP_RAID6
))
4524 num_dev
= fs_info
->fs_devices
->rw_devices
;
4525 else if (type
& BTRFS_BLOCK_GROUP_RAID1
)
4528 num_dev
= 1; /* DUP or single */
4534 * If @is_allocation is true, reserve space in the system space info necessary
4535 * for allocating a chunk, otherwise if it's false, reserve space necessary for
4538 void check_system_chunk(struct btrfs_trans_handle
*trans
,
4539 struct btrfs_fs_info
*fs_info
, u64 type
)
4541 struct btrfs_space_info
*info
;
4548 * Needed because we can end up allocating a system chunk and for an
4549 * atomic and race free space reservation in the chunk block reserve.
4551 ASSERT(mutex_is_locked(&fs_info
->chunk_mutex
));
4553 info
= __find_space_info(fs_info
, BTRFS_BLOCK_GROUP_SYSTEM
);
4554 spin_lock(&info
->lock
);
4555 left
= info
->total_bytes
- btrfs_space_info_used(info
, true);
4556 spin_unlock(&info
->lock
);
4558 num_devs
= get_profile_num_devs(fs_info
, type
);
4560 /* num_devs device items to update and 1 chunk item to add or remove */
4561 thresh
= btrfs_calc_trunc_metadata_size(fs_info
, num_devs
) +
4562 btrfs_calc_trans_metadata_size(fs_info
, 1);
4564 if (left
< thresh
&& btrfs_test_opt(fs_info
, ENOSPC_DEBUG
)) {
4565 btrfs_info(fs_info
, "left=%llu, need=%llu, flags=%llu",
4566 left
, thresh
, type
);
4567 dump_space_info(fs_info
, info
, 0, 0);
4570 if (left
< thresh
) {
4571 u64 flags
= btrfs_system_alloc_profile(fs_info
);
4574 * Ignore failure to create system chunk. We might end up not
4575 * needing it, as we might not need to COW all nodes/leafs from
4576 * the paths we visit in the chunk tree (they were already COWed
4577 * or created in the current transaction for example).
4579 ret
= btrfs_alloc_chunk(trans
, fs_info
, flags
);
4583 ret
= btrfs_block_rsv_add(fs_info
->chunk_root
,
4584 &fs_info
->chunk_block_rsv
,
4585 thresh
, BTRFS_RESERVE_NO_FLUSH
);
4587 trans
->chunk_bytes_reserved
+= thresh
;
4592 * If force is CHUNK_ALLOC_FORCE:
4593 * - return 1 if it successfully allocates a chunk,
4594 * - return errors including -ENOSPC otherwise.
4595 * If force is NOT CHUNK_ALLOC_FORCE:
4596 * - return 0 if it doesn't need to allocate a new chunk,
4597 * - return 1 if it successfully allocates a chunk,
4598 * - return errors including -ENOSPC otherwise.
4600 static int do_chunk_alloc(struct btrfs_trans_handle
*trans
,
4601 struct btrfs_fs_info
*fs_info
, u64 flags
, int force
)
4603 struct btrfs_space_info
*space_info
;
4604 int wait_for_alloc
= 0;
4607 /* Don't re-enter if we're already allocating a chunk */
4608 if (trans
->allocating_chunk
)
4611 space_info
= __find_space_info(fs_info
, flags
);
4613 ret
= create_space_info(fs_info
, flags
, &space_info
);
4619 spin_lock(&space_info
->lock
);
4620 if (force
< space_info
->force_alloc
)
4621 force
= space_info
->force_alloc
;
4622 if (space_info
->full
) {
4623 if (should_alloc_chunk(fs_info
, space_info
, force
))
4627 spin_unlock(&space_info
->lock
);
4631 if (!should_alloc_chunk(fs_info
, space_info
, force
)) {
4632 spin_unlock(&space_info
->lock
);
4634 } else if (space_info
->chunk_alloc
) {
4637 space_info
->chunk_alloc
= 1;
4640 spin_unlock(&space_info
->lock
);
4642 mutex_lock(&fs_info
->chunk_mutex
);
4645 * The chunk_mutex is held throughout the entirety of a chunk
4646 * allocation, so once we've acquired the chunk_mutex we know that the
4647 * other guy is done and we need to recheck and see if we should
4650 if (wait_for_alloc
) {
4651 mutex_unlock(&fs_info
->chunk_mutex
);
4657 trans
->allocating_chunk
= true;
4660 * If we have mixed data/metadata chunks we want to make sure we keep
4661 * allocating mixed chunks instead of individual chunks.
4663 if (btrfs_mixed_space_info(space_info
))
4664 flags
|= (BTRFS_BLOCK_GROUP_DATA
| BTRFS_BLOCK_GROUP_METADATA
);
4667 * if we're doing a data chunk, go ahead and make sure that
4668 * we keep a reasonable number of metadata chunks allocated in the
4671 if (flags
& BTRFS_BLOCK_GROUP_DATA
&& fs_info
->metadata_ratio
) {
4672 fs_info
->data_chunk_allocations
++;
4673 if (!(fs_info
->data_chunk_allocations
%
4674 fs_info
->metadata_ratio
))
4675 force_metadata_allocation(fs_info
);
4679 * Check if we have enough space in SYSTEM chunk because we may need
4680 * to update devices.
4682 check_system_chunk(trans
, fs_info
, flags
);
4684 ret
= btrfs_alloc_chunk(trans
, fs_info
, flags
);
4685 trans
->allocating_chunk
= false;
4687 spin_lock(&space_info
->lock
);
4688 if (ret
< 0 && ret
!= -ENOSPC
)
4691 space_info
->full
= 1;
4694 space_info
->max_extent_size
= 0;
4697 space_info
->force_alloc
= CHUNK_ALLOC_NO_FORCE
;
4699 space_info
->chunk_alloc
= 0;
4700 spin_unlock(&space_info
->lock
);
4701 mutex_unlock(&fs_info
->chunk_mutex
);
4703 * When we allocate a new chunk we reserve space in the chunk block
4704 * reserve to make sure we can COW nodes/leafs in the chunk tree or
4705 * add new nodes/leafs to it if we end up needing to do it when
4706 * inserting the chunk item and updating device items as part of the
4707 * second phase of chunk allocation, performed by
4708 * btrfs_finish_chunk_alloc(). So make sure we don't accumulate a
4709 * large number of new block groups to create in our transaction
4710 * handle's new_bgs list to avoid exhausting the chunk block reserve
4711 * in extreme cases - like having a single transaction create many new
4712 * block groups when starting to write out the free space caches of all
4713 * the block groups that were made dirty during the lifetime of the
4716 if (trans
->chunk_bytes_reserved
>= (u64
)SZ_2M
)
4717 btrfs_create_pending_block_groups(trans
, fs_info
);
4722 static int can_overcommit(struct btrfs_fs_info
*fs_info
,
4723 struct btrfs_space_info
*space_info
, u64 bytes
,
4724 enum btrfs_reserve_flush_enum flush
,
4727 struct btrfs_block_rsv
*global_rsv
= &fs_info
->global_block_rsv
;
4733 /* Don't overcommit when in mixed mode. */
4734 if (space_info
->flags
& BTRFS_BLOCK_GROUP_DATA
)
4738 profile
= btrfs_system_alloc_profile(fs_info
);
4740 profile
= btrfs_metadata_alloc_profile(fs_info
);
4742 used
= btrfs_space_info_used(space_info
, false);
4745 * We only want to allow over committing if we have lots of actual space
4746 * free, but if we don't have enough space to handle the global reserve
4747 * space then we could end up having a real enospc problem when trying
4748 * to allocate a chunk or some other such important allocation.
4750 spin_lock(&global_rsv
->lock
);
4751 space_size
= calc_global_rsv_need_space(global_rsv
);
4752 spin_unlock(&global_rsv
->lock
);
4753 if (used
+ space_size
>= space_info
->total_bytes
)
4756 used
+= space_info
->bytes_may_use
;
4758 avail
= atomic64_read(&fs_info
->free_chunk_space
);
4761 * If we have dup, raid1 or raid10 then only half of the free
4762 * space is actually useable. For raid56, the space info used
4763 * doesn't include the parity drive, so we don't have to
4766 if (profile
& (BTRFS_BLOCK_GROUP_DUP
|
4767 BTRFS_BLOCK_GROUP_RAID1
|
4768 BTRFS_BLOCK_GROUP_RAID10
))
4772 * If we aren't flushing all things, let us overcommit up to
4773 * 1/2th of the space. If we can flush, don't let us overcommit
4774 * too much, let it overcommit up to 1/8 of the space.
4776 if (flush
== BTRFS_RESERVE_FLUSH_ALL
)
4781 if (used
+ bytes
< space_info
->total_bytes
+ avail
)
4786 static void btrfs_writeback_inodes_sb_nr(struct btrfs_fs_info
*fs_info
,
4787 unsigned long nr_pages
, int nr_items
)
4789 struct super_block
*sb
= fs_info
->sb
;
4791 if (down_read_trylock(&sb
->s_umount
)) {
4792 writeback_inodes_sb_nr(sb
, nr_pages
, WB_REASON_FS_FREE_SPACE
);
4793 up_read(&sb
->s_umount
);
4796 * We needn't worry the filesystem going from r/w to r/o though
4797 * we don't acquire ->s_umount mutex, because the filesystem
4798 * should guarantee the delalloc inodes list be empty after
4799 * the filesystem is readonly(all dirty pages are written to
4802 btrfs_start_delalloc_roots(fs_info
, 0, nr_items
);
4803 if (!current
->journal_info
)
4804 btrfs_wait_ordered_roots(fs_info
, nr_items
, 0, (u64
)-1);
4808 static inline u64
calc_reclaim_items_nr(struct btrfs_fs_info
*fs_info
,
4814 bytes
= btrfs_calc_trans_metadata_size(fs_info
, 1);
4815 nr
= div64_u64(to_reclaim
, bytes
);
4821 #define EXTENT_SIZE_PER_ITEM SZ_256K
4824 * shrink metadata reservation for delalloc
4826 static void shrink_delalloc(struct btrfs_fs_info
*fs_info
, u64 to_reclaim
,
4827 u64 orig
, bool wait_ordered
)
4829 struct btrfs_space_info
*space_info
;
4830 struct btrfs_trans_handle
*trans
;
4835 unsigned long nr_pages
;
4837 enum btrfs_reserve_flush_enum flush
;
4839 /* Calc the number of the pages we need flush for space reservation */
4840 items
= calc_reclaim_items_nr(fs_info
, to_reclaim
);
4841 to_reclaim
= items
* EXTENT_SIZE_PER_ITEM
;
4843 trans
= (struct btrfs_trans_handle
*)current
->journal_info
;
4844 space_info
= __find_space_info(fs_info
, BTRFS_BLOCK_GROUP_METADATA
);
4846 delalloc_bytes
= percpu_counter_sum_positive(
4847 &fs_info
->delalloc_bytes
);
4848 if (delalloc_bytes
== 0) {
4852 btrfs_wait_ordered_roots(fs_info
, items
, 0, (u64
)-1);
4857 while (delalloc_bytes
&& loops
< 3) {
4858 max_reclaim
= min(delalloc_bytes
, to_reclaim
);
4859 nr_pages
= max_reclaim
>> PAGE_SHIFT
;
4860 btrfs_writeback_inodes_sb_nr(fs_info
, nr_pages
, items
);
4862 * We need to wait for the async pages to actually start before
4865 max_reclaim
= atomic_read(&fs_info
->async_delalloc_pages
);
4869 if (max_reclaim
<= nr_pages
)
4872 max_reclaim
-= nr_pages
;
4874 wait_event(fs_info
->async_submit_wait
,
4875 atomic_read(&fs_info
->async_delalloc_pages
) <=
4879 flush
= BTRFS_RESERVE_FLUSH_ALL
;
4881 flush
= BTRFS_RESERVE_NO_FLUSH
;
4882 spin_lock(&space_info
->lock
);
4883 if (list_empty(&space_info
->tickets
) &&
4884 list_empty(&space_info
->priority_tickets
)) {
4885 spin_unlock(&space_info
->lock
);
4888 spin_unlock(&space_info
->lock
);
4891 if (wait_ordered
&& !trans
) {
4892 btrfs_wait_ordered_roots(fs_info
, items
, 0, (u64
)-1);
4894 time_left
= schedule_timeout_killable(1);
4898 delalloc_bytes
= percpu_counter_sum_positive(
4899 &fs_info
->delalloc_bytes
);
4903 struct reserve_ticket
{
4906 struct list_head list
;
4907 wait_queue_head_t wait
;
4911 * maybe_commit_transaction - possibly commit the transaction if its ok to
4912 * @root - the root we're allocating for
4913 * @bytes - the number of bytes we want to reserve
4914 * @force - force the commit
4916 * This will check to make sure that committing the transaction will actually
4917 * get us somewhere and then commit the transaction if it does. Otherwise it
4918 * will return -ENOSPC.
4920 static int may_commit_transaction(struct btrfs_fs_info
*fs_info
,
4921 struct btrfs_space_info
*space_info
)
4923 struct reserve_ticket
*ticket
= NULL
;
4924 struct btrfs_block_rsv
*delayed_rsv
= &fs_info
->delayed_block_rsv
;
4925 struct btrfs_trans_handle
*trans
;
4928 trans
= (struct btrfs_trans_handle
*)current
->journal_info
;
4932 spin_lock(&space_info
->lock
);
4933 if (!list_empty(&space_info
->priority_tickets
))
4934 ticket
= list_first_entry(&space_info
->priority_tickets
,
4935 struct reserve_ticket
, list
);
4936 else if (!list_empty(&space_info
->tickets
))
4937 ticket
= list_first_entry(&space_info
->tickets
,
4938 struct reserve_ticket
, list
);
4939 bytes
= (ticket
) ? ticket
->bytes
: 0;
4940 spin_unlock(&space_info
->lock
);
4945 /* See if there is enough pinned space to make this reservation */
4946 if (percpu_counter_compare(&space_info
->total_bytes_pinned
,
4951 * See if there is some space in the delayed insertion reservation for
4954 if (space_info
!= delayed_rsv
->space_info
)
4957 spin_lock(&delayed_rsv
->lock
);
4958 if (delayed_rsv
->size
> bytes
)
4961 bytes
-= delayed_rsv
->size
;
4962 if (percpu_counter_compare(&space_info
->total_bytes_pinned
,
4964 spin_unlock(&delayed_rsv
->lock
);
4967 spin_unlock(&delayed_rsv
->lock
);
4970 trans
= btrfs_join_transaction(fs_info
->extent_root
);
4974 return btrfs_commit_transaction(trans
);
4978 * Try to flush some data based on policy set by @state. This is only advisory
4979 * and may fail for various reasons. The caller is supposed to examine the
4980 * state of @space_info to detect the outcome.
4982 static void flush_space(struct btrfs_fs_info
*fs_info
,
4983 struct btrfs_space_info
*space_info
, u64 num_bytes
,
4986 struct btrfs_root
*root
= fs_info
->extent_root
;
4987 struct btrfs_trans_handle
*trans
;
4992 case FLUSH_DELAYED_ITEMS_NR
:
4993 case FLUSH_DELAYED_ITEMS
:
4994 if (state
== FLUSH_DELAYED_ITEMS_NR
)
4995 nr
= calc_reclaim_items_nr(fs_info
, num_bytes
) * 2;
4999 trans
= btrfs_join_transaction(root
);
5000 if (IS_ERR(trans
)) {
5001 ret
= PTR_ERR(trans
);
5004 ret
= btrfs_run_delayed_items_nr(trans
, fs_info
, nr
);
5005 btrfs_end_transaction(trans
);
5007 case FLUSH_DELALLOC
:
5008 case FLUSH_DELALLOC_WAIT
:
5009 shrink_delalloc(fs_info
, num_bytes
* 2, num_bytes
,
5010 state
== FLUSH_DELALLOC_WAIT
);
5013 trans
= btrfs_join_transaction(root
);
5014 if (IS_ERR(trans
)) {
5015 ret
= PTR_ERR(trans
);
5018 ret
= do_chunk_alloc(trans
, fs_info
,
5019 btrfs_metadata_alloc_profile(fs_info
),
5020 CHUNK_ALLOC_NO_FORCE
);
5021 btrfs_end_transaction(trans
);
5022 if (ret
> 0 || ret
== -ENOSPC
)
5026 ret
= may_commit_transaction(fs_info
, space_info
);
5033 trace_btrfs_flush_space(fs_info
, space_info
->flags
, num_bytes
, state
,
5039 btrfs_calc_reclaim_metadata_size(struct btrfs_fs_info
*fs_info
,
5040 struct btrfs_space_info
*space_info
,
5043 struct reserve_ticket
*ticket
;
5048 list_for_each_entry(ticket
, &space_info
->tickets
, list
)
5049 to_reclaim
+= ticket
->bytes
;
5050 list_for_each_entry(ticket
, &space_info
->priority_tickets
, list
)
5051 to_reclaim
+= ticket
->bytes
;
5055 to_reclaim
= min_t(u64
, num_online_cpus() * SZ_1M
, SZ_16M
);
5056 if (can_overcommit(fs_info
, space_info
, to_reclaim
,
5057 BTRFS_RESERVE_FLUSH_ALL
, system_chunk
))
5060 used
= btrfs_space_info_used(space_info
, true);
5062 if (can_overcommit(fs_info
, space_info
, SZ_1M
,
5063 BTRFS_RESERVE_FLUSH_ALL
, system_chunk
))
5064 expected
= div_factor_fine(space_info
->total_bytes
, 95);
5066 expected
= div_factor_fine(space_info
->total_bytes
, 90);
5068 if (used
> expected
)
5069 to_reclaim
= used
- expected
;
5072 to_reclaim
= min(to_reclaim
, space_info
->bytes_may_use
+
5073 space_info
->bytes_reserved
);
5077 static inline int need_do_async_reclaim(struct btrfs_fs_info
*fs_info
,
5078 struct btrfs_space_info
*space_info
,
5079 u64 used
, bool system_chunk
)
5081 u64 thresh
= div_factor_fine(space_info
->total_bytes
, 98);
5083 /* If we're just plain full then async reclaim just slows us down. */
5084 if ((space_info
->bytes_used
+ space_info
->bytes_reserved
) >= thresh
)
5087 if (!btrfs_calc_reclaim_metadata_size(fs_info
, space_info
,
5091 return (used
>= thresh
&& !btrfs_fs_closing(fs_info
) &&
5092 !test_bit(BTRFS_FS_STATE_REMOUNTING
, &fs_info
->fs_state
));
5095 static void wake_all_tickets(struct list_head
*head
)
5097 struct reserve_ticket
*ticket
;
5099 while (!list_empty(head
)) {
5100 ticket
= list_first_entry(head
, struct reserve_ticket
, list
);
5101 list_del_init(&ticket
->list
);
5102 ticket
->error
= -ENOSPC
;
5103 wake_up(&ticket
->wait
);
5108 * This is for normal flushers, we can wait all goddamned day if we want to. We
5109 * will loop and continuously try to flush as long as we are making progress.
5110 * We count progress as clearing off tickets each time we have to loop.
5112 static void btrfs_async_reclaim_metadata_space(struct work_struct
*work
)
5114 struct btrfs_fs_info
*fs_info
;
5115 struct btrfs_space_info
*space_info
;
5118 int commit_cycles
= 0;
5119 u64 last_tickets_id
;
5121 fs_info
= container_of(work
, struct btrfs_fs_info
, async_reclaim_work
);
5122 space_info
= __find_space_info(fs_info
, BTRFS_BLOCK_GROUP_METADATA
);
5124 spin_lock(&space_info
->lock
);
5125 to_reclaim
= btrfs_calc_reclaim_metadata_size(fs_info
, space_info
,
5128 space_info
->flush
= 0;
5129 spin_unlock(&space_info
->lock
);
5132 last_tickets_id
= space_info
->tickets_id
;
5133 spin_unlock(&space_info
->lock
);
5135 flush_state
= FLUSH_DELAYED_ITEMS_NR
;
5137 flush_space(fs_info
, space_info
, to_reclaim
, flush_state
);
5138 spin_lock(&space_info
->lock
);
5139 if (list_empty(&space_info
->tickets
)) {
5140 space_info
->flush
= 0;
5141 spin_unlock(&space_info
->lock
);
5144 to_reclaim
= btrfs_calc_reclaim_metadata_size(fs_info
,
5147 if (last_tickets_id
== space_info
->tickets_id
) {
5150 last_tickets_id
= space_info
->tickets_id
;
5151 flush_state
= FLUSH_DELAYED_ITEMS_NR
;
5156 if (flush_state
> COMMIT_TRANS
) {
5158 if (commit_cycles
> 2) {
5159 wake_all_tickets(&space_info
->tickets
);
5160 space_info
->flush
= 0;
5162 flush_state
= FLUSH_DELAYED_ITEMS_NR
;
5165 spin_unlock(&space_info
->lock
);
5166 } while (flush_state
<= COMMIT_TRANS
);
5169 void btrfs_init_async_reclaim_work(struct work_struct
*work
)
5171 INIT_WORK(work
, btrfs_async_reclaim_metadata_space
);
5174 static void priority_reclaim_metadata_space(struct btrfs_fs_info
*fs_info
,
5175 struct btrfs_space_info
*space_info
,
5176 struct reserve_ticket
*ticket
)
5179 int flush_state
= FLUSH_DELAYED_ITEMS_NR
;
5181 spin_lock(&space_info
->lock
);
5182 to_reclaim
= btrfs_calc_reclaim_metadata_size(fs_info
, space_info
,
5185 spin_unlock(&space_info
->lock
);
5188 spin_unlock(&space_info
->lock
);
5191 flush_space(fs_info
, space_info
, to_reclaim
, flush_state
);
5193 spin_lock(&space_info
->lock
);
5194 if (ticket
->bytes
== 0) {
5195 spin_unlock(&space_info
->lock
);
5198 spin_unlock(&space_info
->lock
);
5201 * Priority flushers can't wait on delalloc without
5204 if (flush_state
== FLUSH_DELALLOC
||
5205 flush_state
== FLUSH_DELALLOC_WAIT
)
5206 flush_state
= ALLOC_CHUNK
;
5207 } while (flush_state
< COMMIT_TRANS
);
5210 static int wait_reserve_ticket(struct btrfs_fs_info
*fs_info
,
5211 struct btrfs_space_info
*space_info
,
5212 struct reserve_ticket
*ticket
, u64 orig_bytes
)
5218 spin_lock(&space_info
->lock
);
5219 while (ticket
->bytes
> 0 && ticket
->error
== 0) {
5220 ret
= prepare_to_wait_event(&ticket
->wait
, &wait
, TASK_KILLABLE
);
5225 spin_unlock(&space_info
->lock
);
5229 finish_wait(&ticket
->wait
, &wait
);
5230 spin_lock(&space_info
->lock
);
5233 ret
= ticket
->error
;
5234 if (!list_empty(&ticket
->list
))
5235 list_del_init(&ticket
->list
);
5236 if (ticket
->bytes
&& ticket
->bytes
< orig_bytes
) {
5237 u64 num_bytes
= orig_bytes
- ticket
->bytes
;
5238 space_info
->bytes_may_use
-= num_bytes
;
5239 trace_btrfs_space_reservation(fs_info
, "space_info",
5240 space_info
->flags
, num_bytes
, 0);
5242 spin_unlock(&space_info
->lock
);
5248 * reserve_metadata_bytes - try to reserve bytes from the block_rsv's space
5249 * @root - the root we're allocating for
5250 * @space_info - the space info we want to allocate from
5251 * @orig_bytes - the number of bytes we want
5252 * @flush - whether or not we can flush to make our reservation
5254 * This will reserve orig_bytes number of bytes from the space info associated
5255 * with the block_rsv. If there is not enough space it will make an attempt to
5256 * flush out space to make room. It will do this by flushing delalloc if
5257 * possible or committing the transaction. If flush is 0 then no attempts to
5258 * regain reservations will be made and this will fail if there is not enough
5261 static int __reserve_metadata_bytes(struct btrfs_fs_info
*fs_info
,
5262 struct btrfs_space_info
*space_info
,
5264 enum btrfs_reserve_flush_enum flush
,
5267 struct reserve_ticket ticket
;
5272 ASSERT(!current
->journal_info
|| flush
!= BTRFS_RESERVE_FLUSH_ALL
);
5274 spin_lock(&space_info
->lock
);
5276 used
= btrfs_space_info_used(space_info
, true);
5279 * If we have enough space then hooray, make our reservation and carry
5280 * on. If not see if we can overcommit, and if we can, hooray carry on.
5281 * If not things get more complicated.
5283 if (used
+ orig_bytes
<= space_info
->total_bytes
) {
5284 space_info
->bytes_may_use
+= orig_bytes
;
5285 trace_btrfs_space_reservation(fs_info
, "space_info",
5286 space_info
->flags
, orig_bytes
, 1);
5288 } else if (can_overcommit(fs_info
, space_info
, orig_bytes
, flush
,
5290 space_info
->bytes_may_use
+= orig_bytes
;
5291 trace_btrfs_space_reservation(fs_info
, "space_info",
5292 space_info
->flags
, orig_bytes
, 1);
5297 * If we couldn't make a reservation then setup our reservation ticket
5298 * and kick the async worker if it's not already running.
5300 * If we are a priority flusher then we just need to add our ticket to
5301 * the list and we will do our own flushing further down.
5303 if (ret
&& flush
!= BTRFS_RESERVE_NO_FLUSH
) {
5304 ticket
.bytes
= orig_bytes
;
5306 init_waitqueue_head(&ticket
.wait
);
5307 if (flush
== BTRFS_RESERVE_FLUSH_ALL
) {
5308 list_add_tail(&ticket
.list
, &space_info
->tickets
);
5309 if (!space_info
->flush
) {
5310 space_info
->flush
= 1;
5311 trace_btrfs_trigger_flush(fs_info
,
5315 queue_work(system_unbound_wq
,
5316 &fs_info
->async_reclaim_work
);
5319 list_add_tail(&ticket
.list
,
5320 &space_info
->priority_tickets
);
5322 } else if (!ret
&& space_info
->flags
& BTRFS_BLOCK_GROUP_METADATA
) {
5325 * We will do the space reservation dance during log replay,
5326 * which means we won't have fs_info->fs_root set, so don't do
5327 * the async reclaim as we will panic.
5329 if (!test_bit(BTRFS_FS_LOG_RECOVERING
, &fs_info
->flags
) &&
5330 need_do_async_reclaim(fs_info
, space_info
,
5331 used
, system_chunk
) &&
5332 !work_busy(&fs_info
->async_reclaim_work
)) {
5333 trace_btrfs_trigger_flush(fs_info
, space_info
->flags
,
5334 orig_bytes
, flush
, "preempt");
5335 queue_work(system_unbound_wq
,
5336 &fs_info
->async_reclaim_work
);
5339 spin_unlock(&space_info
->lock
);
5340 if (!ret
|| flush
== BTRFS_RESERVE_NO_FLUSH
)
5343 if (flush
== BTRFS_RESERVE_FLUSH_ALL
)
5344 return wait_reserve_ticket(fs_info
, space_info
, &ticket
,
5348 priority_reclaim_metadata_space(fs_info
, space_info
, &ticket
);
5349 spin_lock(&space_info
->lock
);
5351 if (ticket
.bytes
< orig_bytes
) {
5352 u64 num_bytes
= orig_bytes
- ticket
.bytes
;
5353 space_info
->bytes_may_use
-= num_bytes
;
5354 trace_btrfs_space_reservation(fs_info
, "space_info",
5359 list_del_init(&ticket
.list
);
5362 spin_unlock(&space_info
->lock
);
5363 ASSERT(list_empty(&ticket
.list
));
5368 * reserve_metadata_bytes - try to reserve bytes from the block_rsv's space
5369 * @root - the root we're allocating for
5370 * @block_rsv - the block_rsv we're allocating for
5371 * @orig_bytes - the number of bytes we want
5372 * @flush - whether or not we can flush to make our reservation
5374 * This will reserve orgi_bytes number of bytes from the space info associated
5375 * with the block_rsv. If there is not enough space it will make an attempt to
5376 * flush out space to make room. It will do this by flushing delalloc if
5377 * possible or committing the transaction. If flush is 0 then no attempts to
5378 * regain reservations will be made and this will fail if there is not enough
5381 static int reserve_metadata_bytes(struct btrfs_root
*root
,
5382 struct btrfs_block_rsv
*block_rsv
,
5384 enum btrfs_reserve_flush_enum flush
)
5386 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
5387 struct btrfs_block_rsv
*global_rsv
= &fs_info
->global_block_rsv
;
5389 bool system_chunk
= (root
== fs_info
->chunk_root
);
5391 ret
= __reserve_metadata_bytes(fs_info
, block_rsv
->space_info
,
5392 orig_bytes
, flush
, system_chunk
);
5393 if (ret
== -ENOSPC
&&
5394 unlikely(root
->orphan_cleanup_state
== ORPHAN_CLEANUP_STARTED
)) {
5395 if (block_rsv
!= global_rsv
&&
5396 !block_rsv_use_bytes(global_rsv
, orig_bytes
))
5400 trace_btrfs_space_reservation(fs_info
, "space_info:enospc",
5401 block_rsv
->space_info
->flags
,
5406 static struct btrfs_block_rsv
*get_block_rsv(
5407 const struct btrfs_trans_handle
*trans
,
5408 const struct btrfs_root
*root
)
5410 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
5411 struct btrfs_block_rsv
*block_rsv
= NULL
;
5413 if (test_bit(BTRFS_ROOT_REF_COWS
, &root
->state
) ||
5414 (root
== fs_info
->csum_root
&& trans
->adding_csums
) ||
5415 (root
== fs_info
->uuid_root
))
5416 block_rsv
= trans
->block_rsv
;
5419 block_rsv
= root
->block_rsv
;
5422 block_rsv
= &fs_info
->empty_block_rsv
;
5427 static int block_rsv_use_bytes(struct btrfs_block_rsv
*block_rsv
,
5431 spin_lock(&block_rsv
->lock
);
5432 if (block_rsv
->reserved
>= num_bytes
) {
5433 block_rsv
->reserved
-= num_bytes
;
5434 if (block_rsv
->reserved
< block_rsv
->size
)
5435 block_rsv
->full
= 0;
5438 spin_unlock(&block_rsv
->lock
);
5442 static void block_rsv_add_bytes(struct btrfs_block_rsv
*block_rsv
,
5443 u64 num_bytes
, int update_size
)
5445 spin_lock(&block_rsv
->lock
);
5446 block_rsv
->reserved
+= num_bytes
;
5448 block_rsv
->size
+= num_bytes
;
5449 else if (block_rsv
->reserved
>= block_rsv
->size
)
5450 block_rsv
->full
= 1;
5451 spin_unlock(&block_rsv
->lock
);
5454 int btrfs_cond_migrate_bytes(struct btrfs_fs_info
*fs_info
,
5455 struct btrfs_block_rsv
*dest
, u64 num_bytes
,
5458 struct btrfs_block_rsv
*global_rsv
= &fs_info
->global_block_rsv
;
5461 if (global_rsv
->space_info
!= dest
->space_info
)
5464 spin_lock(&global_rsv
->lock
);
5465 min_bytes
= div_factor(global_rsv
->size
, min_factor
);
5466 if (global_rsv
->reserved
< min_bytes
+ num_bytes
) {
5467 spin_unlock(&global_rsv
->lock
);
5470 global_rsv
->reserved
-= num_bytes
;
5471 if (global_rsv
->reserved
< global_rsv
->size
)
5472 global_rsv
->full
= 0;
5473 spin_unlock(&global_rsv
->lock
);
5475 block_rsv_add_bytes(dest
, num_bytes
, 1);
5480 * This is for space we already have accounted in space_info->bytes_may_use, so
5481 * basically when we're returning space from block_rsv's.
5483 static void space_info_add_old_bytes(struct btrfs_fs_info
*fs_info
,
5484 struct btrfs_space_info
*space_info
,
5487 struct reserve_ticket
*ticket
;
5488 struct list_head
*head
;
5490 enum btrfs_reserve_flush_enum flush
= BTRFS_RESERVE_NO_FLUSH
;
5491 bool check_overcommit
= false;
5493 spin_lock(&space_info
->lock
);
5494 head
= &space_info
->priority_tickets
;
5497 * If we are over our limit then we need to check and see if we can
5498 * overcommit, and if we can't then we just need to free up our space
5499 * and not satisfy any requests.
5501 used
= btrfs_space_info_used(space_info
, true);
5502 if (used
- num_bytes
>= space_info
->total_bytes
)
5503 check_overcommit
= true;
5505 while (!list_empty(head
) && num_bytes
) {
5506 ticket
= list_first_entry(head
, struct reserve_ticket
,
5509 * We use 0 bytes because this space is already reserved, so
5510 * adding the ticket space would be a double count.
5512 if (check_overcommit
&&
5513 !can_overcommit(fs_info
, space_info
, 0, flush
, false))
5515 if (num_bytes
>= ticket
->bytes
) {
5516 list_del_init(&ticket
->list
);
5517 num_bytes
-= ticket
->bytes
;
5519 space_info
->tickets_id
++;
5520 wake_up(&ticket
->wait
);
5522 ticket
->bytes
-= num_bytes
;
5527 if (num_bytes
&& head
== &space_info
->priority_tickets
) {
5528 head
= &space_info
->tickets
;
5529 flush
= BTRFS_RESERVE_FLUSH_ALL
;
5532 space_info
->bytes_may_use
-= num_bytes
;
5533 trace_btrfs_space_reservation(fs_info
, "space_info",
5534 space_info
->flags
, num_bytes
, 0);
5535 spin_unlock(&space_info
->lock
);
5539 * This is for newly allocated space that isn't accounted in
5540 * space_info->bytes_may_use yet. So if we allocate a chunk or unpin an extent
5541 * we use this helper.
5543 static void space_info_add_new_bytes(struct btrfs_fs_info
*fs_info
,
5544 struct btrfs_space_info
*space_info
,
5547 struct reserve_ticket
*ticket
;
5548 struct list_head
*head
= &space_info
->priority_tickets
;
5551 while (!list_empty(head
) && num_bytes
) {
5552 ticket
= list_first_entry(head
, struct reserve_ticket
,
5554 if (num_bytes
>= ticket
->bytes
) {
5555 trace_btrfs_space_reservation(fs_info
, "space_info",
5558 list_del_init(&ticket
->list
);
5559 num_bytes
-= ticket
->bytes
;
5560 space_info
->bytes_may_use
+= ticket
->bytes
;
5562 space_info
->tickets_id
++;
5563 wake_up(&ticket
->wait
);
5565 trace_btrfs_space_reservation(fs_info
, "space_info",
5568 space_info
->bytes_may_use
+= num_bytes
;
5569 ticket
->bytes
-= num_bytes
;
5574 if (num_bytes
&& head
== &space_info
->priority_tickets
) {
5575 head
= &space_info
->tickets
;
5580 static u64
block_rsv_release_bytes(struct btrfs_fs_info
*fs_info
,
5581 struct btrfs_block_rsv
*block_rsv
,
5582 struct btrfs_block_rsv
*dest
, u64 num_bytes
)
5584 struct btrfs_space_info
*space_info
= block_rsv
->space_info
;
5587 spin_lock(&block_rsv
->lock
);
5588 if (num_bytes
== (u64
)-1)
5589 num_bytes
= block_rsv
->size
;
5590 block_rsv
->size
-= num_bytes
;
5591 if (block_rsv
->reserved
>= block_rsv
->size
) {
5592 num_bytes
= block_rsv
->reserved
- block_rsv
->size
;
5593 block_rsv
->reserved
= block_rsv
->size
;
5594 block_rsv
->full
= 1;
5598 spin_unlock(&block_rsv
->lock
);
5601 if (num_bytes
> 0) {
5603 spin_lock(&dest
->lock
);
5607 bytes_to_add
= dest
->size
- dest
->reserved
;
5608 bytes_to_add
= min(num_bytes
, bytes_to_add
);
5609 dest
->reserved
+= bytes_to_add
;
5610 if (dest
->reserved
>= dest
->size
)
5612 num_bytes
-= bytes_to_add
;
5614 spin_unlock(&dest
->lock
);
5617 space_info_add_old_bytes(fs_info
, space_info
,
5623 int btrfs_block_rsv_migrate(struct btrfs_block_rsv
*src
,
5624 struct btrfs_block_rsv
*dst
, u64 num_bytes
,
5629 ret
= block_rsv_use_bytes(src
, num_bytes
);
5633 block_rsv_add_bytes(dst
, num_bytes
, update_size
);
5637 void btrfs_init_block_rsv(struct btrfs_block_rsv
*rsv
, unsigned short type
)
5639 memset(rsv
, 0, sizeof(*rsv
));
5640 spin_lock_init(&rsv
->lock
);
5644 void btrfs_init_metadata_block_rsv(struct btrfs_fs_info
*fs_info
,
5645 struct btrfs_block_rsv
*rsv
,
5646 unsigned short type
)
5648 btrfs_init_block_rsv(rsv
, type
);
5649 rsv
->space_info
= __find_space_info(fs_info
,
5650 BTRFS_BLOCK_GROUP_METADATA
);
5653 struct btrfs_block_rsv
*btrfs_alloc_block_rsv(struct btrfs_fs_info
*fs_info
,
5654 unsigned short type
)
5656 struct btrfs_block_rsv
*block_rsv
;
5658 block_rsv
= kmalloc(sizeof(*block_rsv
), GFP_NOFS
);
5662 btrfs_init_metadata_block_rsv(fs_info
, block_rsv
, type
);
5666 void btrfs_free_block_rsv(struct btrfs_fs_info
*fs_info
,
5667 struct btrfs_block_rsv
*rsv
)
5671 btrfs_block_rsv_release(fs_info
, rsv
, (u64
)-1);
5675 void __btrfs_free_block_rsv(struct btrfs_block_rsv
*rsv
)
5680 int btrfs_block_rsv_add(struct btrfs_root
*root
,
5681 struct btrfs_block_rsv
*block_rsv
, u64 num_bytes
,
5682 enum btrfs_reserve_flush_enum flush
)
5689 ret
= reserve_metadata_bytes(root
, block_rsv
, num_bytes
, flush
);
5691 block_rsv_add_bytes(block_rsv
, num_bytes
, 1);
5698 int btrfs_block_rsv_check(struct btrfs_block_rsv
*block_rsv
, int min_factor
)
5706 spin_lock(&block_rsv
->lock
);
5707 num_bytes
= div_factor(block_rsv
->size
, min_factor
);
5708 if (block_rsv
->reserved
>= num_bytes
)
5710 spin_unlock(&block_rsv
->lock
);
5715 int btrfs_block_rsv_refill(struct btrfs_root
*root
,
5716 struct btrfs_block_rsv
*block_rsv
, u64 min_reserved
,
5717 enum btrfs_reserve_flush_enum flush
)
5725 spin_lock(&block_rsv
->lock
);
5726 num_bytes
= min_reserved
;
5727 if (block_rsv
->reserved
>= num_bytes
)
5730 num_bytes
-= block_rsv
->reserved
;
5731 spin_unlock(&block_rsv
->lock
);
5736 ret
= reserve_metadata_bytes(root
, block_rsv
, num_bytes
, flush
);
5738 block_rsv_add_bytes(block_rsv
, num_bytes
, 0);
5746 * btrfs_inode_rsv_refill - refill the inode block rsv.
5747 * @inode - the inode we are refilling.
5748 * @flush - the flusing restriction.
5750 * Essentially the same as btrfs_block_rsv_refill, except it uses the
5751 * block_rsv->size as the minimum size. We'll either refill the missing amount
5752 * or return if we already have enough space. This will also handle the resreve
5753 * tracepoint for the reserved amount.
5755 int btrfs_inode_rsv_refill(struct btrfs_inode
*inode
,
5756 enum btrfs_reserve_flush_enum flush
)
5758 struct btrfs_root
*root
= inode
->root
;
5759 struct btrfs_block_rsv
*block_rsv
= &inode
->block_rsv
;
5763 spin_lock(&block_rsv
->lock
);
5764 if (block_rsv
->reserved
< block_rsv
->size
)
5765 num_bytes
= block_rsv
->size
- block_rsv
->reserved
;
5766 spin_unlock(&block_rsv
->lock
);
5771 ret
= reserve_metadata_bytes(root
, block_rsv
, num_bytes
, flush
);
5773 block_rsv_add_bytes(block_rsv
, num_bytes
, 0);
5774 trace_btrfs_space_reservation(root
->fs_info
, "delalloc",
5775 btrfs_ino(inode
), num_bytes
, 1);
5781 * btrfs_inode_rsv_release - release any excessive reservation.
5782 * @inode - the inode we need to release from.
5784 * This is the same as btrfs_block_rsv_release, except that it handles the
5785 * tracepoint for the reservation.
5787 void btrfs_inode_rsv_release(struct btrfs_inode
*inode
)
5789 struct btrfs_fs_info
*fs_info
= inode
->root
->fs_info
;
5790 struct btrfs_block_rsv
*global_rsv
= &fs_info
->global_block_rsv
;
5791 struct btrfs_block_rsv
*block_rsv
= &inode
->block_rsv
;
5795 * Since we statically set the block_rsv->size we just want to say we
5796 * are releasing 0 bytes, and then we'll just get the reservation over
5799 released
= block_rsv_release_bytes(fs_info
, block_rsv
, global_rsv
, 0);
5801 trace_btrfs_space_reservation(fs_info
, "delalloc",
5802 btrfs_ino(inode
), released
, 0);
5805 void btrfs_block_rsv_release(struct btrfs_fs_info
*fs_info
,
5806 struct btrfs_block_rsv
*block_rsv
,
5809 struct btrfs_block_rsv
*global_rsv
= &fs_info
->global_block_rsv
;
5811 if (global_rsv
== block_rsv
||
5812 block_rsv
->space_info
!= global_rsv
->space_info
)
5814 block_rsv_release_bytes(fs_info
, block_rsv
, global_rsv
, num_bytes
);
5817 static void update_global_block_rsv(struct btrfs_fs_info
*fs_info
)
5819 struct btrfs_block_rsv
*block_rsv
= &fs_info
->global_block_rsv
;
5820 struct btrfs_space_info
*sinfo
= block_rsv
->space_info
;
5824 * The global block rsv is based on the size of the extent tree, the
5825 * checksum tree and the root tree. If the fs is empty we want to set
5826 * it to a minimal amount for safety.
5828 num_bytes
= btrfs_root_used(&fs_info
->extent_root
->root_item
) +
5829 btrfs_root_used(&fs_info
->csum_root
->root_item
) +
5830 btrfs_root_used(&fs_info
->tree_root
->root_item
);
5831 num_bytes
= max_t(u64
, num_bytes
, SZ_16M
);
5833 spin_lock(&sinfo
->lock
);
5834 spin_lock(&block_rsv
->lock
);
5836 block_rsv
->size
= min_t(u64
, num_bytes
, SZ_512M
);
5838 if (block_rsv
->reserved
< block_rsv
->size
) {
5839 num_bytes
= btrfs_space_info_used(sinfo
, true);
5840 if (sinfo
->total_bytes
> num_bytes
) {
5841 num_bytes
= sinfo
->total_bytes
- num_bytes
;
5842 num_bytes
= min(num_bytes
,
5843 block_rsv
->size
- block_rsv
->reserved
);
5844 block_rsv
->reserved
+= num_bytes
;
5845 sinfo
->bytes_may_use
+= num_bytes
;
5846 trace_btrfs_space_reservation(fs_info
, "space_info",
5847 sinfo
->flags
, num_bytes
,
5850 } else if (block_rsv
->reserved
> block_rsv
->size
) {
5851 num_bytes
= block_rsv
->reserved
- block_rsv
->size
;
5852 sinfo
->bytes_may_use
-= num_bytes
;
5853 trace_btrfs_space_reservation(fs_info
, "space_info",
5854 sinfo
->flags
, num_bytes
, 0);
5855 block_rsv
->reserved
= block_rsv
->size
;
5858 if (block_rsv
->reserved
== block_rsv
->size
)
5859 block_rsv
->full
= 1;
5861 block_rsv
->full
= 0;
5863 spin_unlock(&block_rsv
->lock
);
5864 spin_unlock(&sinfo
->lock
);
5867 static void init_global_block_rsv(struct btrfs_fs_info
*fs_info
)
5869 struct btrfs_space_info
*space_info
;
5871 space_info
= __find_space_info(fs_info
, BTRFS_BLOCK_GROUP_SYSTEM
);
5872 fs_info
->chunk_block_rsv
.space_info
= space_info
;
5874 space_info
= __find_space_info(fs_info
, BTRFS_BLOCK_GROUP_METADATA
);
5875 fs_info
->global_block_rsv
.space_info
= space_info
;
5876 fs_info
->trans_block_rsv
.space_info
= space_info
;
5877 fs_info
->empty_block_rsv
.space_info
= space_info
;
5878 fs_info
->delayed_block_rsv
.space_info
= space_info
;
5880 fs_info
->extent_root
->block_rsv
= &fs_info
->global_block_rsv
;
5881 fs_info
->csum_root
->block_rsv
= &fs_info
->global_block_rsv
;
5882 fs_info
->dev_root
->block_rsv
= &fs_info
->global_block_rsv
;
5883 fs_info
->tree_root
->block_rsv
= &fs_info
->global_block_rsv
;
5884 if (fs_info
->quota_root
)
5885 fs_info
->quota_root
->block_rsv
= &fs_info
->global_block_rsv
;
5886 fs_info
->chunk_root
->block_rsv
= &fs_info
->chunk_block_rsv
;
5888 update_global_block_rsv(fs_info
);
5891 static void release_global_block_rsv(struct btrfs_fs_info
*fs_info
)
5893 block_rsv_release_bytes(fs_info
, &fs_info
->global_block_rsv
, NULL
,
5895 WARN_ON(fs_info
->trans_block_rsv
.size
> 0);
5896 WARN_ON(fs_info
->trans_block_rsv
.reserved
> 0);
5897 WARN_ON(fs_info
->chunk_block_rsv
.size
> 0);
5898 WARN_ON(fs_info
->chunk_block_rsv
.reserved
> 0);
5899 WARN_ON(fs_info
->delayed_block_rsv
.size
> 0);
5900 WARN_ON(fs_info
->delayed_block_rsv
.reserved
> 0);
5903 void btrfs_trans_release_metadata(struct btrfs_trans_handle
*trans
,
5904 struct btrfs_fs_info
*fs_info
)
5906 if (!trans
->block_rsv
) {
5907 ASSERT(!trans
->bytes_reserved
);
5911 if (!trans
->bytes_reserved
)
5914 ASSERT(trans
->block_rsv
== &fs_info
->trans_block_rsv
);
5915 trace_btrfs_space_reservation(fs_info
, "transaction",
5916 trans
->transid
, trans
->bytes_reserved
, 0);
5917 btrfs_block_rsv_release(fs_info
, trans
->block_rsv
,
5918 trans
->bytes_reserved
);
5919 trans
->bytes_reserved
= 0;
5923 * To be called after all the new block groups attached to the transaction
5924 * handle have been created (btrfs_create_pending_block_groups()).
5926 void btrfs_trans_release_chunk_metadata(struct btrfs_trans_handle
*trans
)
5928 struct btrfs_fs_info
*fs_info
= trans
->fs_info
;
5930 if (!trans
->chunk_bytes_reserved
)
5933 WARN_ON_ONCE(!list_empty(&trans
->new_bgs
));
5935 block_rsv_release_bytes(fs_info
, &fs_info
->chunk_block_rsv
, NULL
,
5936 trans
->chunk_bytes_reserved
);
5937 trans
->chunk_bytes_reserved
= 0;
5940 /* Can only return 0 or -ENOSPC */
5941 int btrfs_orphan_reserve_metadata(struct btrfs_trans_handle
*trans
,
5942 struct btrfs_inode
*inode
)
5944 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->vfs_inode
.i_sb
);
5945 struct btrfs_root
*root
= inode
->root
;
5947 * We always use trans->block_rsv here as we will have reserved space
5948 * for our orphan when starting the transaction, using get_block_rsv()
5949 * here will sometimes make us choose the wrong block rsv as we could be
5950 * doing a reloc inode for a non refcounted root.
5952 struct btrfs_block_rsv
*src_rsv
= trans
->block_rsv
;
5953 struct btrfs_block_rsv
*dst_rsv
= root
->orphan_block_rsv
;
5956 * We need to hold space in order to delete our orphan item once we've
5957 * added it, so this takes the reservation so we can release it later
5958 * when we are truly done with the orphan item.
5960 u64 num_bytes
= btrfs_calc_trans_metadata_size(fs_info
, 1);
5962 trace_btrfs_space_reservation(fs_info
, "orphan", btrfs_ino(inode
),
5964 return btrfs_block_rsv_migrate(src_rsv
, dst_rsv
, num_bytes
, 1);
5967 void btrfs_orphan_release_metadata(struct btrfs_inode
*inode
)
5969 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->vfs_inode
.i_sb
);
5970 struct btrfs_root
*root
= inode
->root
;
5971 u64 num_bytes
= btrfs_calc_trans_metadata_size(fs_info
, 1);
5973 trace_btrfs_space_reservation(fs_info
, "orphan", btrfs_ino(inode
),
5975 btrfs_block_rsv_release(fs_info
, root
->orphan_block_rsv
, num_bytes
);
5979 * btrfs_subvolume_reserve_metadata() - reserve space for subvolume operation
5980 * root: the root of the parent directory
5981 * rsv: block reservation
5982 * items: the number of items that we need do reservation
5983 * qgroup_reserved: used to return the reserved size in qgroup
5985 * This function is used to reserve the space for snapshot/subvolume
5986 * creation and deletion. Those operations are different with the
5987 * common file/directory operations, they change two fs/file trees
5988 * and root tree, the number of items that the qgroup reserves is
5989 * different with the free space reservation. So we can not use
5990 * the space reservation mechanism in start_transaction().
5992 int btrfs_subvolume_reserve_metadata(struct btrfs_root
*root
,
5993 struct btrfs_block_rsv
*rsv
,
5995 u64
*qgroup_reserved
,
5996 bool use_global_rsv
)
6000 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
6001 struct btrfs_block_rsv
*global_rsv
= &fs_info
->global_block_rsv
;
6003 if (test_bit(BTRFS_FS_QUOTA_ENABLED
, &fs_info
->flags
)) {
6004 /* One for parent inode, two for dir entries */
6005 num_bytes
= 3 * fs_info
->nodesize
;
6006 ret
= btrfs_qgroup_reserve_meta(root
, num_bytes
, true);
6013 *qgroup_reserved
= num_bytes
;
6015 num_bytes
= btrfs_calc_trans_metadata_size(fs_info
, items
);
6016 rsv
->space_info
= __find_space_info(fs_info
,
6017 BTRFS_BLOCK_GROUP_METADATA
);
6018 ret
= btrfs_block_rsv_add(root
, rsv
, num_bytes
,
6019 BTRFS_RESERVE_FLUSH_ALL
);
6021 if (ret
== -ENOSPC
&& use_global_rsv
)
6022 ret
= btrfs_block_rsv_migrate(global_rsv
, rsv
, num_bytes
, 1);
6024 if (ret
&& *qgroup_reserved
)
6025 btrfs_qgroup_free_meta(root
, *qgroup_reserved
);
6030 void btrfs_subvolume_release_metadata(struct btrfs_fs_info
*fs_info
,
6031 struct btrfs_block_rsv
*rsv
)
6033 btrfs_block_rsv_release(fs_info
, rsv
, (u64
)-1);
6036 static void btrfs_calculate_inode_block_rsv_size(struct btrfs_fs_info
*fs_info
,
6037 struct btrfs_inode
*inode
)
6039 struct btrfs_block_rsv
*block_rsv
= &inode
->block_rsv
;
6040 u64 reserve_size
= 0;
6042 unsigned outstanding_extents
;
6044 lockdep_assert_held(&inode
->lock
);
6045 outstanding_extents
= inode
->outstanding_extents
;
6046 if (outstanding_extents
)
6047 reserve_size
= btrfs_calc_trans_metadata_size(fs_info
,
6048 outstanding_extents
+ 1);
6049 csum_leaves
= btrfs_csum_bytes_to_leaves(fs_info
,
6051 reserve_size
+= btrfs_calc_trans_metadata_size(fs_info
,
6054 spin_lock(&block_rsv
->lock
);
6055 block_rsv
->size
= reserve_size
;
6056 spin_unlock(&block_rsv
->lock
);
6059 int btrfs_delalloc_reserve_metadata(struct btrfs_inode
*inode
, u64 num_bytes
)
6061 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->vfs_inode
.i_sb
);
6062 struct btrfs_root
*root
= inode
->root
;
6063 unsigned nr_extents
;
6064 enum btrfs_reserve_flush_enum flush
= BTRFS_RESERVE_FLUSH_ALL
;
6066 bool delalloc_lock
= true;
6068 /* If we are a free space inode we need to not flush since we will be in
6069 * the middle of a transaction commit. We also don't need the delalloc
6070 * mutex since we won't race with anybody. We need this mostly to make
6071 * lockdep shut its filthy mouth.
6073 * If we have a transaction open (can happen if we call truncate_block
6074 * from truncate), then we need FLUSH_LIMIT so we don't deadlock.
6076 if (btrfs_is_free_space_inode(inode
)) {
6077 flush
= BTRFS_RESERVE_NO_FLUSH
;
6078 delalloc_lock
= false;
6079 } else if (current
->journal_info
) {
6080 flush
= BTRFS_RESERVE_FLUSH_LIMIT
;
6083 if (flush
!= BTRFS_RESERVE_NO_FLUSH
&&
6084 btrfs_transaction_in_commit(fs_info
))
6085 schedule_timeout(1);
6088 mutex_lock(&inode
->delalloc_mutex
);
6090 num_bytes
= ALIGN(num_bytes
, fs_info
->sectorsize
);
6092 /* Add our new extents and calculate the new rsv size. */
6093 spin_lock(&inode
->lock
);
6094 nr_extents
= count_max_extents(num_bytes
);
6095 btrfs_mod_outstanding_extents(inode
, nr_extents
);
6096 inode
->csum_bytes
+= num_bytes
;
6097 btrfs_calculate_inode_block_rsv_size(fs_info
, inode
);
6098 spin_unlock(&inode
->lock
);
6100 if (test_bit(BTRFS_FS_QUOTA_ENABLED
, &fs_info
->flags
)) {
6101 ret
= btrfs_qgroup_reserve_meta(root
,
6102 nr_extents
* fs_info
->nodesize
, true);
6107 ret
= btrfs_inode_rsv_refill(inode
, flush
);
6108 if (unlikely(ret
)) {
6109 btrfs_qgroup_free_meta(root
,
6110 nr_extents
* fs_info
->nodesize
);
6115 mutex_unlock(&inode
->delalloc_mutex
);
6119 spin_lock(&inode
->lock
);
6120 nr_extents
= count_max_extents(num_bytes
);
6121 btrfs_mod_outstanding_extents(inode
, -nr_extents
);
6122 inode
->csum_bytes
-= num_bytes
;
6123 btrfs_calculate_inode_block_rsv_size(fs_info
, inode
);
6124 spin_unlock(&inode
->lock
);
6126 btrfs_inode_rsv_release(inode
);
6128 mutex_unlock(&inode
->delalloc_mutex
);
6133 * btrfs_delalloc_release_metadata - release a metadata reservation for an inode
6134 * @inode: the inode to release the reservation for.
6135 * @num_bytes: the number of bytes we are releasing.
6137 * This will release the metadata reservation for an inode. This can be called
6138 * once we complete IO for a given set of bytes to release their metadata
6139 * reservations, or on error for the same reason.
6141 void btrfs_delalloc_release_metadata(struct btrfs_inode
*inode
, u64 num_bytes
)
6143 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->vfs_inode
.i_sb
);
6145 num_bytes
= ALIGN(num_bytes
, fs_info
->sectorsize
);
6146 spin_lock(&inode
->lock
);
6147 inode
->csum_bytes
-= num_bytes
;
6148 btrfs_calculate_inode_block_rsv_size(fs_info
, inode
);
6149 spin_unlock(&inode
->lock
);
6151 if (btrfs_is_testing(fs_info
))
6154 btrfs_inode_rsv_release(inode
);
6158 * btrfs_delalloc_release_extents - release our outstanding_extents
6159 * @inode: the inode to balance the reservation for.
6160 * @num_bytes: the number of bytes we originally reserved with
6162 * When we reserve space we increase outstanding_extents for the extents we may
6163 * add. Once we've set the range as delalloc or created our ordered extents we
6164 * have outstanding_extents to track the real usage, so we use this to free our
6165 * temporarily tracked outstanding_extents. This _must_ be used in conjunction
6166 * with btrfs_delalloc_reserve_metadata.
6168 void btrfs_delalloc_release_extents(struct btrfs_inode
*inode
, u64 num_bytes
)
6170 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->vfs_inode
.i_sb
);
6171 unsigned num_extents
;
6173 spin_lock(&inode
->lock
);
6174 num_extents
= count_max_extents(num_bytes
);
6175 btrfs_mod_outstanding_extents(inode
, -num_extents
);
6176 btrfs_calculate_inode_block_rsv_size(fs_info
, inode
);
6177 spin_unlock(&inode
->lock
);
6179 if (btrfs_is_testing(fs_info
))
6182 btrfs_inode_rsv_release(inode
);
6186 * btrfs_delalloc_reserve_space - reserve data and metadata space for
6188 * @inode: inode we're writing to
6189 * @start: start range we are writing to
6190 * @len: how long the range we are writing to
6191 * @reserved: mandatory parameter, record actually reserved qgroup ranges of
6192 * current reservation.
6194 * This will do the following things
6196 * o reserve space in data space info for num bytes
6197 * and reserve precious corresponding qgroup space
6198 * (Done in check_data_free_space)
6200 * o reserve space for metadata space, based on the number of outstanding
6201 * extents and how much csums will be needed
6202 * also reserve metadata space in a per root over-reserve method.
6203 * o add to the inodes->delalloc_bytes
6204 * o add it to the fs_info's delalloc inodes list.
6205 * (Above 3 all done in delalloc_reserve_metadata)
6207 * Return 0 for success
6208 * Return <0 for error(-ENOSPC or -EQUOT)
6210 int btrfs_delalloc_reserve_space(struct inode
*inode
,
6211 struct extent_changeset
**reserved
, u64 start
, u64 len
)
6215 ret
= btrfs_check_data_free_space(inode
, reserved
, start
, len
);
6218 ret
= btrfs_delalloc_reserve_metadata(BTRFS_I(inode
), len
);
6220 btrfs_free_reserved_data_space(inode
, *reserved
, start
, len
);
6225 * btrfs_delalloc_release_space - release data and metadata space for delalloc
6226 * @inode: inode we're releasing space for
6227 * @start: start position of the space already reserved
6228 * @len: the len of the space already reserved
6229 * @release_bytes: the len of the space we consumed or didn't use
6231 * This function will release the metadata space that was not used and will
6232 * decrement ->delalloc_bytes and remove it from the fs_info delalloc_inodes
6233 * list if there are no delalloc bytes left.
6234 * Also it will handle the qgroup reserved space.
6236 void btrfs_delalloc_release_space(struct inode
*inode
,
6237 struct extent_changeset
*reserved
,
6240 btrfs_delalloc_release_metadata(BTRFS_I(inode
), len
);
6241 btrfs_free_reserved_data_space(inode
, reserved
, start
, len
);
6244 static int update_block_group(struct btrfs_trans_handle
*trans
,
6245 struct btrfs_fs_info
*info
, u64 bytenr
,
6246 u64 num_bytes
, int alloc
)
6248 struct btrfs_block_group_cache
*cache
= NULL
;
6249 u64 total
= num_bytes
;
6254 /* block accounting for super block */
6255 spin_lock(&info
->delalloc_root_lock
);
6256 old_val
= btrfs_super_bytes_used(info
->super_copy
);
6258 old_val
+= num_bytes
;
6260 old_val
-= num_bytes
;
6261 btrfs_set_super_bytes_used(info
->super_copy
, old_val
);
6262 spin_unlock(&info
->delalloc_root_lock
);
6265 cache
= btrfs_lookup_block_group(info
, bytenr
);
6268 if (cache
->flags
& (BTRFS_BLOCK_GROUP_DUP
|
6269 BTRFS_BLOCK_GROUP_RAID1
|
6270 BTRFS_BLOCK_GROUP_RAID10
))
6275 * If this block group has free space cache written out, we
6276 * need to make sure to load it if we are removing space. This
6277 * is because we need the unpinning stage to actually add the
6278 * space back to the block group, otherwise we will leak space.
6280 if (!alloc
&& cache
->cached
== BTRFS_CACHE_NO
)
6281 cache_block_group(cache
, 1);
6283 byte_in_group
= bytenr
- cache
->key
.objectid
;
6284 WARN_ON(byte_in_group
> cache
->key
.offset
);
6286 spin_lock(&cache
->space_info
->lock
);
6287 spin_lock(&cache
->lock
);
6289 if (btrfs_test_opt(info
, SPACE_CACHE
) &&
6290 cache
->disk_cache_state
< BTRFS_DC_CLEAR
)
6291 cache
->disk_cache_state
= BTRFS_DC_CLEAR
;
6293 old_val
= btrfs_block_group_used(&cache
->item
);
6294 num_bytes
= min(total
, cache
->key
.offset
- byte_in_group
);
6296 old_val
+= num_bytes
;
6297 btrfs_set_block_group_used(&cache
->item
, old_val
);
6298 cache
->reserved
-= num_bytes
;
6299 cache
->space_info
->bytes_reserved
-= num_bytes
;
6300 cache
->space_info
->bytes_used
+= num_bytes
;
6301 cache
->space_info
->disk_used
+= num_bytes
* factor
;
6302 spin_unlock(&cache
->lock
);
6303 spin_unlock(&cache
->space_info
->lock
);
6305 old_val
-= num_bytes
;
6306 btrfs_set_block_group_used(&cache
->item
, old_val
);
6307 cache
->pinned
+= num_bytes
;
6308 cache
->space_info
->bytes_pinned
+= num_bytes
;
6309 cache
->space_info
->bytes_used
-= num_bytes
;
6310 cache
->space_info
->disk_used
-= num_bytes
* factor
;
6311 spin_unlock(&cache
->lock
);
6312 spin_unlock(&cache
->space_info
->lock
);
6314 trace_btrfs_space_reservation(info
, "pinned",
6315 cache
->space_info
->flags
,
6317 percpu_counter_add(&cache
->space_info
->total_bytes_pinned
,
6319 set_extent_dirty(info
->pinned_extents
,
6320 bytenr
, bytenr
+ num_bytes
- 1,
6321 GFP_NOFS
| __GFP_NOFAIL
);
6324 spin_lock(&trans
->transaction
->dirty_bgs_lock
);
6325 if (list_empty(&cache
->dirty_list
)) {
6326 list_add_tail(&cache
->dirty_list
,
6327 &trans
->transaction
->dirty_bgs
);
6328 trans
->transaction
->num_dirty_bgs
++;
6329 btrfs_get_block_group(cache
);
6331 spin_unlock(&trans
->transaction
->dirty_bgs_lock
);
6334 * No longer have used bytes in this block group, queue it for
6335 * deletion. We do this after adding the block group to the
6336 * dirty list to avoid races between cleaner kthread and space
6339 if (!alloc
&& old_val
== 0) {
6340 spin_lock(&info
->unused_bgs_lock
);
6341 if (list_empty(&cache
->bg_list
)) {
6342 btrfs_get_block_group(cache
);
6343 list_add_tail(&cache
->bg_list
,
6346 spin_unlock(&info
->unused_bgs_lock
);
6349 btrfs_put_block_group(cache
);
6351 bytenr
+= num_bytes
;
6356 static u64
first_logical_byte(struct btrfs_fs_info
*fs_info
, u64 search_start
)
6358 struct btrfs_block_group_cache
*cache
;
6361 spin_lock(&fs_info
->block_group_cache_lock
);
6362 bytenr
= fs_info
->first_logical_byte
;
6363 spin_unlock(&fs_info
->block_group_cache_lock
);
6365 if (bytenr
< (u64
)-1)
6368 cache
= btrfs_lookup_first_block_group(fs_info
, search_start
);
6372 bytenr
= cache
->key
.objectid
;
6373 btrfs_put_block_group(cache
);
6378 static int pin_down_extent(struct btrfs_fs_info
*fs_info
,
6379 struct btrfs_block_group_cache
*cache
,
6380 u64 bytenr
, u64 num_bytes
, int reserved
)
6382 spin_lock(&cache
->space_info
->lock
);
6383 spin_lock(&cache
->lock
);
6384 cache
->pinned
+= num_bytes
;
6385 cache
->space_info
->bytes_pinned
+= num_bytes
;
6387 cache
->reserved
-= num_bytes
;
6388 cache
->space_info
->bytes_reserved
-= num_bytes
;
6390 spin_unlock(&cache
->lock
);
6391 spin_unlock(&cache
->space_info
->lock
);
6393 trace_btrfs_space_reservation(fs_info
, "pinned",
6394 cache
->space_info
->flags
, num_bytes
, 1);
6395 percpu_counter_add(&cache
->space_info
->total_bytes_pinned
, num_bytes
);
6396 set_extent_dirty(fs_info
->pinned_extents
, bytenr
,
6397 bytenr
+ num_bytes
- 1, GFP_NOFS
| __GFP_NOFAIL
);
6402 * this function must be called within transaction
6404 int btrfs_pin_extent(struct btrfs_fs_info
*fs_info
,
6405 u64 bytenr
, u64 num_bytes
, int reserved
)
6407 struct btrfs_block_group_cache
*cache
;
6409 cache
= btrfs_lookup_block_group(fs_info
, bytenr
);
6410 BUG_ON(!cache
); /* Logic error */
6412 pin_down_extent(fs_info
, cache
, bytenr
, num_bytes
, reserved
);
6414 btrfs_put_block_group(cache
);
6419 * this function must be called within transaction
6421 int btrfs_pin_extent_for_log_replay(struct btrfs_fs_info
*fs_info
,
6422 u64 bytenr
, u64 num_bytes
)
6424 struct btrfs_block_group_cache
*cache
;
6427 cache
= btrfs_lookup_block_group(fs_info
, bytenr
);
6432 * pull in the free space cache (if any) so that our pin
6433 * removes the free space from the cache. We have load_only set
6434 * to one because the slow code to read in the free extents does check
6435 * the pinned extents.
6437 cache_block_group(cache
, 1);
6439 pin_down_extent(fs_info
, cache
, bytenr
, num_bytes
, 0);
6441 /* remove us from the free space cache (if we're there at all) */
6442 ret
= btrfs_remove_free_space(cache
, bytenr
, num_bytes
);
6443 btrfs_put_block_group(cache
);
6447 static int __exclude_logged_extent(struct btrfs_fs_info
*fs_info
,
6448 u64 start
, u64 num_bytes
)
6451 struct btrfs_block_group_cache
*block_group
;
6452 struct btrfs_caching_control
*caching_ctl
;
6454 block_group
= btrfs_lookup_block_group(fs_info
, start
);
6458 cache_block_group(block_group
, 0);
6459 caching_ctl
= get_caching_control(block_group
);
6463 BUG_ON(!block_group_cache_done(block_group
));
6464 ret
= btrfs_remove_free_space(block_group
, start
, num_bytes
);
6466 mutex_lock(&caching_ctl
->mutex
);
6468 if (start
>= caching_ctl
->progress
) {
6469 ret
= add_excluded_extent(fs_info
, start
, num_bytes
);
6470 } else if (start
+ num_bytes
<= caching_ctl
->progress
) {
6471 ret
= btrfs_remove_free_space(block_group
,
6474 num_bytes
= caching_ctl
->progress
- start
;
6475 ret
= btrfs_remove_free_space(block_group
,
6480 num_bytes
= (start
+ num_bytes
) -
6481 caching_ctl
->progress
;
6482 start
= caching_ctl
->progress
;
6483 ret
= add_excluded_extent(fs_info
, start
, num_bytes
);
6486 mutex_unlock(&caching_ctl
->mutex
);
6487 put_caching_control(caching_ctl
);
6489 btrfs_put_block_group(block_group
);
6493 int btrfs_exclude_logged_extents(struct btrfs_fs_info
*fs_info
,
6494 struct extent_buffer
*eb
)
6496 struct btrfs_file_extent_item
*item
;
6497 struct btrfs_key key
;
6501 if (!btrfs_fs_incompat(fs_info
, MIXED_GROUPS
))
6504 for (i
= 0; i
< btrfs_header_nritems(eb
); i
++) {
6505 btrfs_item_key_to_cpu(eb
, &key
, i
);
6506 if (key
.type
!= BTRFS_EXTENT_DATA_KEY
)
6508 item
= btrfs_item_ptr(eb
, i
, struct btrfs_file_extent_item
);
6509 found_type
= btrfs_file_extent_type(eb
, item
);
6510 if (found_type
== BTRFS_FILE_EXTENT_INLINE
)
6512 if (btrfs_file_extent_disk_bytenr(eb
, item
) == 0)
6514 key
.objectid
= btrfs_file_extent_disk_bytenr(eb
, item
);
6515 key
.offset
= btrfs_file_extent_disk_num_bytes(eb
, item
);
6516 __exclude_logged_extent(fs_info
, key
.objectid
, key
.offset
);
6523 btrfs_inc_block_group_reservations(struct btrfs_block_group_cache
*bg
)
6525 atomic_inc(&bg
->reservations
);
6528 void btrfs_dec_block_group_reservations(struct btrfs_fs_info
*fs_info
,
6531 struct btrfs_block_group_cache
*bg
;
6533 bg
= btrfs_lookup_block_group(fs_info
, start
);
6535 if (atomic_dec_and_test(&bg
->reservations
))
6536 wake_up_atomic_t(&bg
->reservations
);
6537 btrfs_put_block_group(bg
);
6540 void btrfs_wait_block_group_reservations(struct btrfs_block_group_cache
*bg
)
6542 struct btrfs_space_info
*space_info
= bg
->space_info
;
6546 if (!(bg
->flags
& BTRFS_BLOCK_GROUP_DATA
))
6550 * Our block group is read only but before we set it to read only,
6551 * some task might have had allocated an extent from it already, but it
6552 * has not yet created a respective ordered extent (and added it to a
6553 * root's list of ordered extents).
6554 * Therefore wait for any task currently allocating extents, since the
6555 * block group's reservations counter is incremented while a read lock
6556 * on the groups' semaphore is held and decremented after releasing
6557 * the read access on that semaphore and creating the ordered extent.
6559 down_write(&space_info
->groups_sem
);
6560 up_write(&space_info
->groups_sem
);
6562 wait_on_atomic_t(&bg
->reservations
, atomic_t_wait
,
6563 TASK_UNINTERRUPTIBLE
);
6567 * btrfs_add_reserved_bytes - update the block_group and space info counters
6568 * @cache: The cache we are manipulating
6569 * @ram_bytes: The number of bytes of file content, and will be same to
6570 * @num_bytes except for the compress path.
6571 * @num_bytes: The number of bytes in question
6572 * @delalloc: The blocks are allocated for the delalloc write
6574 * This is called by the allocator when it reserves space. If this is a
6575 * reservation and the block group has become read only we cannot make the
6576 * reservation and return -EAGAIN, otherwise this function always succeeds.
6578 static int btrfs_add_reserved_bytes(struct btrfs_block_group_cache
*cache
,
6579 u64 ram_bytes
, u64 num_bytes
, int delalloc
)
6581 struct btrfs_space_info
*space_info
= cache
->space_info
;
6584 spin_lock(&space_info
->lock
);
6585 spin_lock(&cache
->lock
);
6589 cache
->reserved
+= num_bytes
;
6590 space_info
->bytes_reserved
+= num_bytes
;
6592 trace_btrfs_space_reservation(cache
->fs_info
,
6593 "space_info", space_info
->flags
,
6595 space_info
->bytes_may_use
-= ram_bytes
;
6597 cache
->delalloc_bytes
+= num_bytes
;
6599 spin_unlock(&cache
->lock
);
6600 spin_unlock(&space_info
->lock
);
6605 * btrfs_free_reserved_bytes - update the block_group and space info counters
6606 * @cache: The cache we are manipulating
6607 * @num_bytes: The number of bytes in question
6608 * @delalloc: The blocks are allocated for the delalloc write
6610 * This is called by somebody who is freeing space that was never actually used
6611 * on disk. For example if you reserve some space for a new leaf in transaction
6612 * A and before transaction A commits you free that leaf, you call this with
6613 * reserve set to 0 in order to clear the reservation.
6616 static int btrfs_free_reserved_bytes(struct btrfs_block_group_cache
*cache
,
6617 u64 num_bytes
, int delalloc
)
6619 struct btrfs_space_info
*space_info
= cache
->space_info
;
6622 spin_lock(&space_info
->lock
);
6623 spin_lock(&cache
->lock
);
6625 space_info
->bytes_readonly
+= num_bytes
;
6626 cache
->reserved
-= num_bytes
;
6627 space_info
->bytes_reserved
-= num_bytes
;
6628 space_info
->max_extent_size
= 0;
6631 cache
->delalloc_bytes
-= num_bytes
;
6632 spin_unlock(&cache
->lock
);
6633 spin_unlock(&space_info
->lock
);
6636 void btrfs_prepare_extent_commit(struct btrfs_fs_info
*fs_info
)
6638 struct btrfs_caching_control
*next
;
6639 struct btrfs_caching_control
*caching_ctl
;
6640 struct btrfs_block_group_cache
*cache
;
6642 down_write(&fs_info
->commit_root_sem
);
6644 list_for_each_entry_safe(caching_ctl
, next
,
6645 &fs_info
->caching_block_groups
, list
) {
6646 cache
= caching_ctl
->block_group
;
6647 if (block_group_cache_done(cache
)) {
6648 cache
->last_byte_to_unpin
= (u64
)-1;
6649 list_del_init(&caching_ctl
->list
);
6650 put_caching_control(caching_ctl
);
6652 cache
->last_byte_to_unpin
= caching_ctl
->progress
;
6656 if (fs_info
->pinned_extents
== &fs_info
->freed_extents
[0])
6657 fs_info
->pinned_extents
= &fs_info
->freed_extents
[1];
6659 fs_info
->pinned_extents
= &fs_info
->freed_extents
[0];
6661 up_write(&fs_info
->commit_root_sem
);
6663 update_global_block_rsv(fs_info
);
6667 * Returns the free cluster for the given space info and sets empty_cluster to
6668 * what it should be based on the mount options.
6670 static struct btrfs_free_cluster
*
6671 fetch_cluster_info(struct btrfs_fs_info
*fs_info
,
6672 struct btrfs_space_info
*space_info
, u64
*empty_cluster
)
6674 struct btrfs_free_cluster
*ret
= NULL
;
6677 if (btrfs_mixed_space_info(space_info
))
6680 if (space_info
->flags
& BTRFS_BLOCK_GROUP_METADATA
) {
6681 ret
= &fs_info
->meta_alloc_cluster
;
6682 if (btrfs_test_opt(fs_info
, SSD
))
6683 *empty_cluster
= SZ_2M
;
6685 *empty_cluster
= SZ_64K
;
6686 } else if ((space_info
->flags
& BTRFS_BLOCK_GROUP_DATA
) &&
6687 btrfs_test_opt(fs_info
, SSD_SPREAD
)) {
6688 *empty_cluster
= SZ_2M
;
6689 ret
= &fs_info
->data_alloc_cluster
;
6695 static int unpin_extent_range(struct btrfs_fs_info
*fs_info
,
6697 const bool return_free_space
)
6699 struct btrfs_block_group_cache
*cache
= NULL
;
6700 struct btrfs_space_info
*space_info
;
6701 struct btrfs_block_rsv
*global_rsv
= &fs_info
->global_block_rsv
;
6702 struct btrfs_free_cluster
*cluster
= NULL
;
6704 u64 total_unpinned
= 0;
6705 u64 empty_cluster
= 0;
6708 while (start
<= end
) {
6711 start
>= cache
->key
.objectid
+ cache
->key
.offset
) {
6713 btrfs_put_block_group(cache
);
6715 cache
= btrfs_lookup_block_group(fs_info
, start
);
6716 BUG_ON(!cache
); /* Logic error */
6718 cluster
= fetch_cluster_info(fs_info
,
6721 empty_cluster
<<= 1;
6724 len
= cache
->key
.objectid
+ cache
->key
.offset
- start
;
6725 len
= min(len
, end
+ 1 - start
);
6727 if (start
< cache
->last_byte_to_unpin
) {
6728 len
= min(len
, cache
->last_byte_to_unpin
- start
);
6729 if (return_free_space
)
6730 btrfs_add_free_space(cache
, start
, len
);
6734 total_unpinned
+= len
;
6735 space_info
= cache
->space_info
;
6738 * If this space cluster has been marked as fragmented and we've
6739 * unpinned enough in this block group to potentially allow a
6740 * cluster to be created inside of it go ahead and clear the
6743 if (cluster
&& cluster
->fragmented
&&
6744 total_unpinned
> empty_cluster
) {
6745 spin_lock(&cluster
->lock
);
6746 cluster
->fragmented
= 0;
6747 spin_unlock(&cluster
->lock
);
6750 spin_lock(&space_info
->lock
);
6751 spin_lock(&cache
->lock
);
6752 cache
->pinned
-= len
;
6753 space_info
->bytes_pinned
-= len
;
6755 trace_btrfs_space_reservation(fs_info
, "pinned",
6756 space_info
->flags
, len
, 0);
6757 space_info
->max_extent_size
= 0;
6758 percpu_counter_add(&space_info
->total_bytes_pinned
, -len
);
6760 space_info
->bytes_readonly
+= len
;
6763 spin_unlock(&cache
->lock
);
6764 if (!readonly
&& return_free_space
&&
6765 global_rsv
->space_info
== space_info
) {
6768 spin_lock(&global_rsv
->lock
);
6769 if (!global_rsv
->full
) {
6770 to_add
= min(len
, global_rsv
->size
-
6771 global_rsv
->reserved
);
6772 global_rsv
->reserved
+= to_add
;
6773 space_info
->bytes_may_use
+= to_add
;
6774 if (global_rsv
->reserved
>= global_rsv
->size
)
6775 global_rsv
->full
= 1;
6776 trace_btrfs_space_reservation(fs_info
,
6782 spin_unlock(&global_rsv
->lock
);
6783 /* Add to any tickets we may have */
6785 space_info_add_new_bytes(fs_info
, space_info
,
6788 spin_unlock(&space_info
->lock
);
6792 btrfs_put_block_group(cache
);
6796 int btrfs_finish_extent_commit(struct btrfs_trans_handle
*trans
,
6797 struct btrfs_fs_info
*fs_info
)
6799 struct btrfs_block_group_cache
*block_group
, *tmp
;
6800 struct list_head
*deleted_bgs
;
6801 struct extent_io_tree
*unpin
;
6806 if (fs_info
->pinned_extents
== &fs_info
->freed_extents
[0])
6807 unpin
= &fs_info
->freed_extents
[1];
6809 unpin
= &fs_info
->freed_extents
[0];
6811 while (!trans
->aborted
) {
6812 mutex_lock(&fs_info
->unused_bg_unpin_mutex
);
6813 ret
= find_first_extent_bit(unpin
, 0, &start
, &end
,
6814 EXTENT_DIRTY
, NULL
);
6816 mutex_unlock(&fs_info
->unused_bg_unpin_mutex
);
6820 if (btrfs_test_opt(fs_info
, DISCARD
))
6821 ret
= btrfs_discard_extent(fs_info
, start
,
6822 end
+ 1 - start
, NULL
);
6824 clear_extent_dirty(unpin
, start
, end
);
6825 unpin_extent_range(fs_info
, start
, end
, true);
6826 mutex_unlock(&fs_info
->unused_bg_unpin_mutex
);
6831 * Transaction is finished. We don't need the lock anymore. We
6832 * do need to clean up the block groups in case of a transaction
6835 deleted_bgs
= &trans
->transaction
->deleted_bgs
;
6836 list_for_each_entry_safe(block_group
, tmp
, deleted_bgs
, bg_list
) {
6840 if (!trans
->aborted
)
6841 ret
= btrfs_discard_extent(fs_info
,
6842 block_group
->key
.objectid
,
6843 block_group
->key
.offset
,
6846 list_del_init(&block_group
->bg_list
);
6847 btrfs_put_block_group_trimming(block_group
);
6848 btrfs_put_block_group(block_group
);
6851 const char *errstr
= btrfs_decode_error(ret
);
6853 "discard failed while removing blockgroup: errno=%d %s",
6861 static int __btrfs_free_extent(struct btrfs_trans_handle
*trans
,
6862 struct btrfs_fs_info
*info
,
6863 struct btrfs_delayed_ref_node
*node
, u64 parent
,
6864 u64 root_objectid
, u64 owner_objectid
,
6865 u64 owner_offset
, int refs_to_drop
,
6866 struct btrfs_delayed_extent_op
*extent_op
)
6868 struct btrfs_key key
;
6869 struct btrfs_path
*path
;
6870 struct btrfs_root
*extent_root
= info
->extent_root
;
6871 struct extent_buffer
*leaf
;
6872 struct btrfs_extent_item
*ei
;
6873 struct btrfs_extent_inline_ref
*iref
;
6876 int extent_slot
= 0;
6877 int found_extent
= 0;
6881 u64 bytenr
= node
->bytenr
;
6882 u64 num_bytes
= node
->num_bytes
;
6884 bool skinny_metadata
= btrfs_fs_incompat(info
, SKINNY_METADATA
);
6886 path
= btrfs_alloc_path();
6890 path
->reada
= READA_FORWARD
;
6891 path
->leave_spinning
= 1;
6893 is_data
= owner_objectid
>= BTRFS_FIRST_FREE_OBJECTID
;
6894 BUG_ON(!is_data
&& refs_to_drop
!= 1);
6897 skinny_metadata
= false;
6899 ret
= lookup_extent_backref(trans
, info
, path
, &iref
,
6900 bytenr
, num_bytes
, parent
,
6901 root_objectid
, owner_objectid
,
6904 extent_slot
= path
->slots
[0];
6905 while (extent_slot
>= 0) {
6906 btrfs_item_key_to_cpu(path
->nodes
[0], &key
,
6908 if (key
.objectid
!= bytenr
)
6910 if (key
.type
== BTRFS_EXTENT_ITEM_KEY
&&
6911 key
.offset
== num_bytes
) {
6915 if (key
.type
== BTRFS_METADATA_ITEM_KEY
&&
6916 key
.offset
== owner_objectid
) {
6920 if (path
->slots
[0] - extent_slot
> 5)
6924 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
6925 item_size
= btrfs_item_size_nr(path
->nodes
[0], extent_slot
);
6926 if (found_extent
&& item_size
< sizeof(*ei
))
6929 if (!found_extent
) {
6931 ret
= remove_extent_backref(trans
, info
, path
, NULL
,
6933 is_data
, &last_ref
);
6935 btrfs_abort_transaction(trans
, ret
);
6938 btrfs_release_path(path
);
6939 path
->leave_spinning
= 1;
6941 key
.objectid
= bytenr
;
6942 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
6943 key
.offset
= num_bytes
;
6945 if (!is_data
&& skinny_metadata
) {
6946 key
.type
= BTRFS_METADATA_ITEM_KEY
;
6947 key
.offset
= owner_objectid
;
6950 ret
= btrfs_search_slot(trans
, extent_root
,
6952 if (ret
> 0 && skinny_metadata
&& path
->slots
[0]) {
6954 * Couldn't find our skinny metadata item,
6955 * see if we have ye olde extent item.
6958 btrfs_item_key_to_cpu(path
->nodes
[0], &key
,
6960 if (key
.objectid
== bytenr
&&
6961 key
.type
== BTRFS_EXTENT_ITEM_KEY
&&
6962 key
.offset
== num_bytes
)
6966 if (ret
> 0 && skinny_metadata
) {
6967 skinny_metadata
= false;
6968 key
.objectid
= bytenr
;
6969 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
6970 key
.offset
= num_bytes
;
6971 btrfs_release_path(path
);
6972 ret
= btrfs_search_slot(trans
, extent_root
,
6978 "umm, got %d back from search, was looking for %llu",
6981 btrfs_print_leaf(path
->nodes
[0]);
6984 btrfs_abort_transaction(trans
, ret
);
6987 extent_slot
= path
->slots
[0];
6989 } else if (WARN_ON(ret
== -ENOENT
)) {
6990 btrfs_print_leaf(path
->nodes
[0]);
6992 "unable to find ref byte nr %llu parent %llu root %llu owner %llu offset %llu",
6993 bytenr
, parent
, root_objectid
, owner_objectid
,
6995 btrfs_abort_transaction(trans
, ret
);
6998 btrfs_abort_transaction(trans
, ret
);
7002 leaf
= path
->nodes
[0];
7003 item_size
= btrfs_item_size_nr(leaf
, extent_slot
);
7004 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
7005 if (item_size
< sizeof(*ei
)) {
7006 BUG_ON(found_extent
|| extent_slot
!= path
->slots
[0]);
7007 ret
= convert_extent_item_v0(trans
, info
, path
, owner_objectid
,
7010 btrfs_abort_transaction(trans
, ret
);
7014 btrfs_release_path(path
);
7015 path
->leave_spinning
= 1;
7017 key
.objectid
= bytenr
;
7018 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
7019 key
.offset
= num_bytes
;
7021 ret
= btrfs_search_slot(trans
, extent_root
, &key
, path
,
7025 "umm, got %d back from search, was looking for %llu",
7027 btrfs_print_leaf(path
->nodes
[0]);
7030 btrfs_abort_transaction(trans
, ret
);
7034 extent_slot
= path
->slots
[0];
7035 leaf
= path
->nodes
[0];
7036 item_size
= btrfs_item_size_nr(leaf
, extent_slot
);
7039 BUG_ON(item_size
< sizeof(*ei
));
7040 ei
= btrfs_item_ptr(leaf
, extent_slot
,
7041 struct btrfs_extent_item
);
7042 if (owner_objectid
< BTRFS_FIRST_FREE_OBJECTID
&&
7043 key
.type
== BTRFS_EXTENT_ITEM_KEY
) {
7044 struct btrfs_tree_block_info
*bi
;
7045 BUG_ON(item_size
< sizeof(*ei
) + sizeof(*bi
));
7046 bi
= (struct btrfs_tree_block_info
*)(ei
+ 1);
7047 WARN_ON(owner_objectid
!= btrfs_tree_block_level(leaf
, bi
));
7050 refs
= btrfs_extent_refs(leaf
, ei
);
7051 if (refs
< refs_to_drop
) {
7053 "trying to drop %d refs but we only have %Lu for bytenr %Lu",
7054 refs_to_drop
, refs
, bytenr
);
7056 btrfs_abort_transaction(trans
, ret
);
7059 refs
-= refs_to_drop
;
7063 __run_delayed_extent_op(extent_op
, leaf
, ei
);
7065 * In the case of inline back ref, reference count will
7066 * be updated by remove_extent_backref
7069 BUG_ON(!found_extent
);
7071 btrfs_set_extent_refs(leaf
, ei
, refs
);
7072 btrfs_mark_buffer_dirty(leaf
);
7075 ret
= remove_extent_backref(trans
, info
, path
,
7077 is_data
, &last_ref
);
7079 btrfs_abort_transaction(trans
, ret
);
7085 BUG_ON(is_data
&& refs_to_drop
!=
7086 extent_data_ref_count(path
, iref
));
7088 BUG_ON(path
->slots
[0] != extent_slot
);
7090 BUG_ON(path
->slots
[0] != extent_slot
+ 1);
7091 path
->slots
[0] = extent_slot
;
7097 ret
= btrfs_del_items(trans
, extent_root
, path
, path
->slots
[0],
7100 btrfs_abort_transaction(trans
, ret
);
7103 btrfs_release_path(path
);
7106 ret
= btrfs_del_csums(trans
, info
, bytenr
, num_bytes
);
7108 btrfs_abort_transaction(trans
, ret
);
7113 ret
= add_to_free_space_tree(trans
, info
, bytenr
, num_bytes
);
7115 btrfs_abort_transaction(trans
, ret
);
7119 ret
= update_block_group(trans
, info
, bytenr
, num_bytes
, 0);
7121 btrfs_abort_transaction(trans
, ret
);
7125 btrfs_release_path(path
);
7128 btrfs_free_path(path
);
7133 * when we free an block, it is possible (and likely) that we free the last
7134 * delayed ref for that extent as well. This searches the delayed ref tree for
7135 * a given extent, and if there are no other delayed refs to be processed, it
7136 * removes it from the tree.
7138 static noinline
int check_ref_cleanup(struct btrfs_trans_handle
*trans
,
7141 struct btrfs_delayed_ref_head
*head
;
7142 struct btrfs_delayed_ref_root
*delayed_refs
;
7145 delayed_refs
= &trans
->transaction
->delayed_refs
;
7146 spin_lock(&delayed_refs
->lock
);
7147 head
= btrfs_find_delayed_ref_head(delayed_refs
, bytenr
);
7149 goto out_delayed_unlock
;
7151 spin_lock(&head
->lock
);
7152 if (!RB_EMPTY_ROOT(&head
->ref_tree
))
7155 if (head
->extent_op
) {
7156 if (!head
->must_insert_reserved
)
7158 btrfs_free_delayed_extent_op(head
->extent_op
);
7159 head
->extent_op
= NULL
;
7163 * waiting for the lock here would deadlock. If someone else has it
7164 * locked they are already in the process of dropping it anyway
7166 if (!mutex_trylock(&head
->mutex
))
7170 * at this point we have a head with no other entries. Go
7171 * ahead and process it.
7173 rb_erase(&head
->href_node
, &delayed_refs
->href_root
);
7174 RB_CLEAR_NODE(&head
->href_node
);
7175 atomic_dec(&delayed_refs
->num_entries
);
7178 * we don't take a ref on the node because we're removing it from the
7179 * tree, so we just steal the ref the tree was holding.
7181 delayed_refs
->num_heads
--;
7182 if (head
->processing
== 0)
7183 delayed_refs
->num_heads_ready
--;
7184 head
->processing
= 0;
7185 spin_unlock(&head
->lock
);
7186 spin_unlock(&delayed_refs
->lock
);
7188 BUG_ON(head
->extent_op
);
7189 if (head
->must_insert_reserved
)
7192 mutex_unlock(&head
->mutex
);
7193 btrfs_put_delayed_ref_head(head
);
7196 spin_unlock(&head
->lock
);
7199 spin_unlock(&delayed_refs
->lock
);
7203 void btrfs_free_tree_block(struct btrfs_trans_handle
*trans
,
7204 struct btrfs_root
*root
,
7205 struct extent_buffer
*buf
,
7206 u64 parent
, int last_ref
)
7208 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
7212 if (root
->root_key
.objectid
!= BTRFS_TREE_LOG_OBJECTID
) {
7213 int old_ref_mod
, new_ref_mod
;
7215 btrfs_ref_tree_mod(root
, buf
->start
, buf
->len
, parent
,
7216 root
->root_key
.objectid
,
7217 btrfs_header_level(buf
), 0,
7218 BTRFS_DROP_DELAYED_REF
);
7219 ret
= btrfs_add_delayed_tree_ref(fs_info
, trans
, buf
->start
,
7221 root
->root_key
.objectid
,
7222 btrfs_header_level(buf
),
7223 BTRFS_DROP_DELAYED_REF
, NULL
,
7224 &old_ref_mod
, &new_ref_mod
);
7225 BUG_ON(ret
); /* -ENOMEM */
7226 pin
= old_ref_mod
>= 0 && new_ref_mod
< 0;
7229 if (last_ref
&& btrfs_header_generation(buf
) == trans
->transid
) {
7230 struct btrfs_block_group_cache
*cache
;
7232 if (root
->root_key
.objectid
!= BTRFS_TREE_LOG_OBJECTID
) {
7233 ret
= check_ref_cleanup(trans
, buf
->start
);
7239 cache
= btrfs_lookup_block_group(fs_info
, buf
->start
);
7241 if (btrfs_header_flag(buf
, BTRFS_HEADER_FLAG_WRITTEN
)) {
7242 pin_down_extent(fs_info
, cache
, buf
->start
,
7244 btrfs_put_block_group(cache
);
7248 WARN_ON(test_bit(EXTENT_BUFFER_DIRTY
, &buf
->bflags
));
7250 btrfs_add_free_space(cache
, buf
->start
, buf
->len
);
7251 btrfs_free_reserved_bytes(cache
, buf
->len
, 0);
7252 btrfs_put_block_group(cache
);
7253 trace_btrfs_reserved_extent_free(fs_info
, buf
->start
, buf
->len
);
7257 add_pinned_bytes(fs_info
, buf
->len
, btrfs_header_level(buf
),
7258 root
->root_key
.objectid
);
7262 * Deleting the buffer, clear the corrupt flag since it doesn't
7265 clear_bit(EXTENT_BUFFER_CORRUPT
, &buf
->bflags
);
7269 /* Can return -ENOMEM */
7270 int btrfs_free_extent(struct btrfs_trans_handle
*trans
,
7271 struct btrfs_root
*root
,
7272 u64 bytenr
, u64 num_bytes
, u64 parent
, u64 root_objectid
,
7273 u64 owner
, u64 offset
)
7275 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
7276 int old_ref_mod
, new_ref_mod
;
7279 if (btrfs_is_testing(fs_info
))
7282 if (root_objectid
!= BTRFS_TREE_LOG_OBJECTID
)
7283 btrfs_ref_tree_mod(root
, bytenr
, num_bytes
, parent
,
7284 root_objectid
, owner
, offset
,
7285 BTRFS_DROP_DELAYED_REF
);
7288 * tree log blocks never actually go into the extent allocation
7289 * tree, just update pinning info and exit early.
7291 if (root_objectid
== BTRFS_TREE_LOG_OBJECTID
) {
7292 WARN_ON(owner
>= BTRFS_FIRST_FREE_OBJECTID
);
7293 /* unlocks the pinned mutex */
7294 btrfs_pin_extent(fs_info
, bytenr
, num_bytes
, 1);
7295 old_ref_mod
= new_ref_mod
= 0;
7297 } else if (owner
< BTRFS_FIRST_FREE_OBJECTID
) {
7298 ret
= btrfs_add_delayed_tree_ref(fs_info
, trans
, bytenr
,
7300 root_objectid
, (int)owner
,
7301 BTRFS_DROP_DELAYED_REF
, NULL
,
7302 &old_ref_mod
, &new_ref_mod
);
7304 ret
= btrfs_add_delayed_data_ref(fs_info
, trans
, bytenr
,
7306 root_objectid
, owner
, offset
,
7307 0, BTRFS_DROP_DELAYED_REF
,
7308 &old_ref_mod
, &new_ref_mod
);
7311 if (ret
== 0 && old_ref_mod
>= 0 && new_ref_mod
< 0)
7312 add_pinned_bytes(fs_info
, num_bytes
, owner
, root_objectid
);
7318 * when we wait for progress in the block group caching, its because
7319 * our allocation attempt failed at least once. So, we must sleep
7320 * and let some progress happen before we try again.
7322 * This function will sleep at least once waiting for new free space to
7323 * show up, and then it will check the block group free space numbers
7324 * for our min num_bytes. Another option is to have it go ahead
7325 * and look in the rbtree for a free extent of a given size, but this
7328 * Callers of this must check if cache->cached == BTRFS_CACHE_ERROR before using
7329 * any of the information in this block group.
7331 static noinline
void
7332 wait_block_group_cache_progress(struct btrfs_block_group_cache
*cache
,
7335 struct btrfs_caching_control
*caching_ctl
;
7337 caching_ctl
= get_caching_control(cache
);
7341 wait_event(caching_ctl
->wait
, block_group_cache_done(cache
) ||
7342 (cache
->free_space_ctl
->free_space
>= num_bytes
));
7344 put_caching_control(caching_ctl
);
7348 wait_block_group_cache_done(struct btrfs_block_group_cache
*cache
)
7350 struct btrfs_caching_control
*caching_ctl
;
7353 caching_ctl
= get_caching_control(cache
);
7355 return (cache
->cached
== BTRFS_CACHE_ERROR
) ? -EIO
: 0;
7357 wait_event(caching_ctl
->wait
, block_group_cache_done(cache
));
7358 if (cache
->cached
== BTRFS_CACHE_ERROR
)
7360 put_caching_control(caching_ctl
);
7364 int __get_raid_index(u64 flags
)
7366 if (flags
& BTRFS_BLOCK_GROUP_RAID10
)
7367 return BTRFS_RAID_RAID10
;
7368 else if (flags
& BTRFS_BLOCK_GROUP_RAID1
)
7369 return BTRFS_RAID_RAID1
;
7370 else if (flags
& BTRFS_BLOCK_GROUP_DUP
)
7371 return BTRFS_RAID_DUP
;
7372 else if (flags
& BTRFS_BLOCK_GROUP_RAID0
)
7373 return BTRFS_RAID_RAID0
;
7374 else if (flags
& BTRFS_BLOCK_GROUP_RAID5
)
7375 return BTRFS_RAID_RAID5
;
7376 else if (flags
& BTRFS_BLOCK_GROUP_RAID6
)
7377 return BTRFS_RAID_RAID6
;
7379 return BTRFS_RAID_SINGLE
; /* BTRFS_BLOCK_GROUP_SINGLE */
7382 int get_block_group_index(struct btrfs_block_group_cache
*cache
)
7384 return __get_raid_index(cache
->flags
);
7387 static const char *btrfs_raid_type_names
[BTRFS_NR_RAID_TYPES
] = {
7388 [BTRFS_RAID_RAID10
] = "raid10",
7389 [BTRFS_RAID_RAID1
] = "raid1",
7390 [BTRFS_RAID_DUP
] = "dup",
7391 [BTRFS_RAID_RAID0
] = "raid0",
7392 [BTRFS_RAID_SINGLE
] = "single",
7393 [BTRFS_RAID_RAID5
] = "raid5",
7394 [BTRFS_RAID_RAID6
] = "raid6",
7397 static const char *get_raid_name(enum btrfs_raid_types type
)
7399 if (type
>= BTRFS_NR_RAID_TYPES
)
7402 return btrfs_raid_type_names
[type
];
7405 enum btrfs_loop_type
{
7406 LOOP_CACHING_NOWAIT
= 0,
7407 LOOP_CACHING_WAIT
= 1,
7408 LOOP_ALLOC_CHUNK
= 2,
7409 LOOP_NO_EMPTY_SIZE
= 3,
7413 btrfs_lock_block_group(struct btrfs_block_group_cache
*cache
,
7417 down_read(&cache
->data_rwsem
);
7421 btrfs_grab_block_group(struct btrfs_block_group_cache
*cache
,
7424 btrfs_get_block_group(cache
);
7426 down_read(&cache
->data_rwsem
);
7429 static struct btrfs_block_group_cache
*
7430 btrfs_lock_cluster(struct btrfs_block_group_cache
*block_group
,
7431 struct btrfs_free_cluster
*cluster
,
7434 struct btrfs_block_group_cache
*used_bg
= NULL
;
7436 spin_lock(&cluster
->refill_lock
);
7438 used_bg
= cluster
->block_group
;
7442 if (used_bg
== block_group
)
7445 btrfs_get_block_group(used_bg
);
7450 if (down_read_trylock(&used_bg
->data_rwsem
))
7453 spin_unlock(&cluster
->refill_lock
);
7455 /* We should only have one-level nested. */
7456 down_read_nested(&used_bg
->data_rwsem
, SINGLE_DEPTH_NESTING
);
7458 spin_lock(&cluster
->refill_lock
);
7459 if (used_bg
== cluster
->block_group
)
7462 up_read(&used_bg
->data_rwsem
);
7463 btrfs_put_block_group(used_bg
);
7468 btrfs_release_block_group(struct btrfs_block_group_cache
*cache
,
7472 up_read(&cache
->data_rwsem
);
7473 btrfs_put_block_group(cache
);
7477 * walks the btree of allocated extents and find a hole of a given size.
7478 * The key ins is changed to record the hole:
7479 * ins->objectid == start position
7480 * ins->flags = BTRFS_EXTENT_ITEM_KEY
7481 * ins->offset == the size of the hole.
7482 * Any available blocks before search_start are skipped.
7484 * If there is no suitable free space, we will record the max size of
7485 * the free space extent currently.
7487 static noinline
int find_free_extent(struct btrfs_fs_info
*fs_info
,
7488 u64 ram_bytes
, u64 num_bytes
, u64 empty_size
,
7489 u64 hint_byte
, struct btrfs_key
*ins
,
7490 u64 flags
, int delalloc
)
7493 struct btrfs_root
*root
= fs_info
->extent_root
;
7494 struct btrfs_free_cluster
*last_ptr
= NULL
;
7495 struct btrfs_block_group_cache
*block_group
= NULL
;
7496 u64 search_start
= 0;
7497 u64 max_extent_size
= 0;
7498 u64 max_free_space
= 0;
7499 u64 empty_cluster
= 0;
7500 struct btrfs_space_info
*space_info
;
7502 int index
= __get_raid_index(flags
);
7503 bool failed_cluster_refill
= false;
7504 bool failed_alloc
= false;
7505 bool use_cluster
= true;
7506 bool have_caching_bg
= false;
7507 bool orig_have_caching_bg
= false;
7508 bool full_search
= false;
7510 WARN_ON(num_bytes
< fs_info
->sectorsize
);
7511 ins
->type
= BTRFS_EXTENT_ITEM_KEY
;
7515 trace_find_free_extent(fs_info
, num_bytes
, empty_size
, flags
);
7517 space_info
= __find_space_info(fs_info
, flags
);
7519 btrfs_err(fs_info
, "No space info for %llu", flags
);
7524 * If our free space is heavily fragmented we may not be able to make
7525 * big contiguous allocations, so instead of doing the expensive search
7526 * for free space, simply return ENOSPC with our max_extent_size so we
7527 * can go ahead and search for a more manageable chunk.
7529 * If our max_extent_size is large enough for our allocation simply
7530 * disable clustering since we will likely not be able to find enough
7531 * space to create a cluster and induce latency trying.
7533 if (unlikely(space_info
->max_extent_size
)) {
7534 spin_lock(&space_info
->lock
);
7535 if (space_info
->max_extent_size
&&
7536 num_bytes
> space_info
->max_extent_size
) {
7537 ins
->offset
= space_info
->max_extent_size
;
7538 spin_unlock(&space_info
->lock
);
7540 } else if (space_info
->max_extent_size
) {
7541 use_cluster
= false;
7543 spin_unlock(&space_info
->lock
);
7546 last_ptr
= fetch_cluster_info(fs_info
, space_info
, &empty_cluster
);
7548 spin_lock(&last_ptr
->lock
);
7549 if (last_ptr
->block_group
)
7550 hint_byte
= last_ptr
->window_start
;
7551 if (last_ptr
->fragmented
) {
7553 * We still set window_start so we can keep track of the
7554 * last place we found an allocation to try and save
7557 hint_byte
= last_ptr
->window_start
;
7558 use_cluster
= false;
7560 spin_unlock(&last_ptr
->lock
);
7563 search_start
= max(search_start
, first_logical_byte(fs_info
, 0));
7564 search_start
= max(search_start
, hint_byte
);
7565 if (search_start
== hint_byte
) {
7566 block_group
= btrfs_lookup_block_group(fs_info
, search_start
);
7568 * we don't want to use the block group if it doesn't match our
7569 * allocation bits, or if its not cached.
7571 * However if we are re-searching with an ideal block group
7572 * picked out then we don't care that the block group is cached.
7574 if (block_group
&& block_group_bits(block_group
, flags
) &&
7575 block_group
->cached
!= BTRFS_CACHE_NO
) {
7576 down_read(&space_info
->groups_sem
);
7577 if (list_empty(&block_group
->list
) ||
7580 * someone is removing this block group,
7581 * we can't jump into the have_block_group
7582 * target because our list pointers are not
7585 btrfs_put_block_group(block_group
);
7586 up_read(&space_info
->groups_sem
);
7588 index
= get_block_group_index(block_group
);
7589 btrfs_lock_block_group(block_group
, delalloc
);
7590 goto have_block_group
;
7592 } else if (block_group
) {
7593 btrfs_put_block_group(block_group
);
7597 have_caching_bg
= false;
7598 if (index
== 0 || index
== __get_raid_index(flags
))
7600 down_read(&space_info
->groups_sem
);
7601 list_for_each_entry(block_group
, &space_info
->block_groups
[index
],
7606 /* If the block group is read-only, we can skip it entirely. */
7607 if (unlikely(block_group
->ro
))
7610 btrfs_grab_block_group(block_group
, delalloc
);
7611 search_start
= block_group
->key
.objectid
;
7614 * this can happen if we end up cycling through all the
7615 * raid types, but we want to make sure we only allocate
7616 * for the proper type.
7618 if (!block_group_bits(block_group
, flags
)) {
7619 u64 extra
= BTRFS_BLOCK_GROUP_DUP
|
7620 BTRFS_BLOCK_GROUP_RAID1
|
7621 BTRFS_BLOCK_GROUP_RAID5
|
7622 BTRFS_BLOCK_GROUP_RAID6
|
7623 BTRFS_BLOCK_GROUP_RAID10
;
7626 * if they asked for extra copies and this block group
7627 * doesn't provide them, bail. This does allow us to
7628 * fill raid0 from raid1.
7630 if ((flags
& extra
) && !(block_group
->flags
& extra
))
7635 cached
= block_group_cache_done(block_group
);
7636 if (unlikely(!cached
)) {
7637 have_caching_bg
= true;
7638 ret
= cache_block_group(block_group
, 0);
7643 if (unlikely(block_group
->cached
== BTRFS_CACHE_ERROR
))
7647 * Ok we want to try and use the cluster allocator, so
7650 if (last_ptr
&& use_cluster
) {
7651 struct btrfs_block_group_cache
*used_block_group
;
7652 unsigned long aligned_cluster
;
7654 * the refill lock keeps out other
7655 * people trying to start a new cluster
7657 used_block_group
= btrfs_lock_cluster(block_group
,
7660 if (!used_block_group
)
7661 goto refill_cluster
;
7663 if (used_block_group
!= block_group
&&
7664 (used_block_group
->ro
||
7665 !block_group_bits(used_block_group
, flags
)))
7666 goto release_cluster
;
7668 offset
= btrfs_alloc_from_cluster(used_block_group
,
7671 used_block_group
->key
.objectid
,
7674 /* we have a block, we're done */
7675 spin_unlock(&last_ptr
->refill_lock
);
7676 trace_btrfs_reserve_extent_cluster(fs_info
,
7678 search_start
, num_bytes
);
7679 if (used_block_group
!= block_group
) {
7680 btrfs_release_block_group(block_group
,
7682 block_group
= used_block_group
;
7687 WARN_ON(last_ptr
->block_group
!= used_block_group
);
7689 /* If we are on LOOP_NO_EMPTY_SIZE, we can't
7690 * set up a new clusters, so lets just skip it
7691 * and let the allocator find whatever block
7692 * it can find. If we reach this point, we
7693 * will have tried the cluster allocator
7694 * plenty of times and not have found
7695 * anything, so we are likely way too
7696 * fragmented for the clustering stuff to find
7699 * However, if the cluster is taken from the
7700 * current block group, release the cluster
7701 * first, so that we stand a better chance of
7702 * succeeding in the unclustered
7704 if (loop
>= LOOP_NO_EMPTY_SIZE
&&
7705 used_block_group
!= block_group
) {
7706 spin_unlock(&last_ptr
->refill_lock
);
7707 btrfs_release_block_group(used_block_group
,
7709 goto unclustered_alloc
;
7713 * this cluster didn't work out, free it and
7716 btrfs_return_cluster_to_free_space(NULL
, last_ptr
);
7718 if (used_block_group
!= block_group
)
7719 btrfs_release_block_group(used_block_group
,
7722 if (loop
>= LOOP_NO_EMPTY_SIZE
) {
7723 spin_unlock(&last_ptr
->refill_lock
);
7724 goto unclustered_alloc
;
7727 aligned_cluster
= max_t(unsigned long,
7728 empty_cluster
+ empty_size
,
7729 block_group
->full_stripe_len
);
7731 /* allocate a cluster in this block group */
7732 ret
= btrfs_find_space_cluster(fs_info
, block_group
,
7733 last_ptr
, search_start
,
7738 * now pull our allocation out of this
7741 offset
= btrfs_alloc_from_cluster(block_group
,
7747 /* we found one, proceed */
7748 spin_unlock(&last_ptr
->refill_lock
);
7749 trace_btrfs_reserve_extent_cluster(fs_info
,
7750 block_group
, search_start
,
7754 } else if (!cached
&& loop
> LOOP_CACHING_NOWAIT
7755 && !failed_cluster_refill
) {
7756 spin_unlock(&last_ptr
->refill_lock
);
7758 failed_cluster_refill
= true;
7759 wait_block_group_cache_progress(block_group
,
7760 num_bytes
+ empty_cluster
+ empty_size
);
7761 goto have_block_group
;
7765 * at this point we either didn't find a cluster
7766 * or we weren't able to allocate a block from our
7767 * cluster. Free the cluster we've been trying
7768 * to use, and go to the next block group
7770 btrfs_return_cluster_to_free_space(NULL
, last_ptr
);
7771 spin_unlock(&last_ptr
->refill_lock
);
7777 * We are doing an unclustered alloc, set the fragmented flag so
7778 * we don't bother trying to setup a cluster again until we get
7781 if (unlikely(last_ptr
)) {
7782 spin_lock(&last_ptr
->lock
);
7783 last_ptr
->fragmented
= 1;
7784 spin_unlock(&last_ptr
->lock
);
7787 struct btrfs_free_space_ctl
*ctl
=
7788 block_group
->free_space_ctl
;
7790 spin_lock(&ctl
->tree_lock
);
7791 if (ctl
->free_space
<
7792 num_bytes
+ empty_cluster
+ empty_size
) {
7793 max_free_space
= max(max_free_space
,
7795 spin_unlock(&ctl
->tree_lock
);
7798 spin_unlock(&ctl
->tree_lock
);
7801 offset
= btrfs_find_space_for_alloc(block_group
, search_start
,
7802 num_bytes
, empty_size
,
7805 * If we didn't find a chunk, and we haven't failed on this
7806 * block group before, and this block group is in the middle of
7807 * caching and we are ok with waiting, then go ahead and wait
7808 * for progress to be made, and set failed_alloc to true.
7810 * If failed_alloc is true then we've already waited on this
7811 * block group once and should move on to the next block group.
7813 if (!offset
&& !failed_alloc
&& !cached
&&
7814 loop
> LOOP_CACHING_NOWAIT
) {
7815 wait_block_group_cache_progress(block_group
,
7816 num_bytes
+ empty_size
);
7817 failed_alloc
= true;
7818 goto have_block_group
;
7819 } else if (!offset
) {
7823 search_start
= ALIGN(offset
, fs_info
->stripesize
);
7825 /* move on to the next group */
7826 if (search_start
+ num_bytes
>
7827 block_group
->key
.objectid
+ block_group
->key
.offset
) {
7828 btrfs_add_free_space(block_group
, offset
, num_bytes
);
7832 if (offset
< search_start
)
7833 btrfs_add_free_space(block_group
, offset
,
7834 search_start
- offset
);
7835 BUG_ON(offset
> search_start
);
7837 ret
= btrfs_add_reserved_bytes(block_group
, ram_bytes
,
7838 num_bytes
, delalloc
);
7839 if (ret
== -EAGAIN
) {
7840 btrfs_add_free_space(block_group
, offset
, num_bytes
);
7843 btrfs_inc_block_group_reservations(block_group
);
7845 /* we are all good, lets return */
7846 ins
->objectid
= search_start
;
7847 ins
->offset
= num_bytes
;
7849 trace_btrfs_reserve_extent(fs_info
, block_group
,
7850 search_start
, num_bytes
);
7851 btrfs_release_block_group(block_group
, delalloc
);
7854 failed_cluster_refill
= false;
7855 failed_alloc
= false;
7856 BUG_ON(index
!= get_block_group_index(block_group
));
7857 btrfs_release_block_group(block_group
, delalloc
);
7860 up_read(&space_info
->groups_sem
);
7862 if ((loop
== LOOP_CACHING_NOWAIT
) && have_caching_bg
7863 && !orig_have_caching_bg
)
7864 orig_have_caching_bg
= true;
7866 if (!ins
->objectid
&& loop
>= LOOP_CACHING_WAIT
&& have_caching_bg
)
7869 if (!ins
->objectid
&& ++index
< BTRFS_NR_RAID_TYPES
)
7873 * LOOP_CACHING_NOWAIT, search partially cached block groups, kicking
7874 * caching kthreads as we move along
7875 * LOOP_CACHING_WAIT, search everything, and wait if our bg is caching
7876 * LOOP_ALLOC_CHUNK, force a chunk allocation and try again
7877 * LOOP_NO_EMPTY_SIZE, set empty_size and empty_cluster to 0 and try
7880 if (!ins
->objectid
&& loop
< LOOP_NO_EMPTY_SIZE
) {
7882 if (loop
== LOOP_CACHING_NOWAIT
) {
7884 * We want to skip the LOOP_CACHING_WAIT step if we
7885 * don't have any uncached bgs and we've already done a
7886 * full search through.
7888 if (orig_have_caching_bg
|| !full_search
)
7889 loop
= LOOP_CACHING_WAIT
;
7891 loop
= LOOP_ALLOC_CHUNK
;
7896 if (loop
== LOOP_ALLOC_CHUNK
) {
7897 struct btrfs_trans_handle
*trans
;
7900 trans
= current
->journal_info
;
7904 trans
= btrfs_join_transaction(root
);
7906 if (IS_ERR(trans
)) {
7907 ret
= PTR_ERR(trans
);
7911 ret
= do_chunk_alloc(trans
, fs_info
, flags
,
7915 * If we can't allocate a new chunk we've already looped
7916 * through at least once, move on to the NO_EMPTY_SIZE
7920 loop
= LOOP_NO_EMPTY_SIZE
;
7923 * Do not bail out on ENOSPC since we
7924 * can do more things.
7926 if (ret
< 0 && ret
!= -ENOSPC
)
7927 btrfs_abort_transaction(trans
, ret
);
7931 btrfs_end_transaction(trans
);
7936 if (loop
== LOOP_NO_EMPTY_SIZE
) {
7938 * Don't loop again if we already have no empty_size and
7941 if (empty_size
== 0 &&
7942 empty_cluster
== 0) {
7951 } else if (!ins
->objectid
) {
7953 } else if (ins
->objectid
) {
7954 if (!use_cluster
&& last_ptr
) {
7955 spin_lock(&last_ptr
->lock
);
7956 last_ptr
->window_start
= ins
->objectid
;
7957 spin_unlock(&last_ptr
->lock
);
7962 if (ret
== -ENOSPC
) {
7963 if (!max_extent_size
)
7964 max_extent_size
= max_free_space
;
7965 spin_lock(&space_info
->lock
);
7966 space_info
->max_extent_size
= max_extent_size
;
7967 spin_unlock(&space_info
->lock
);
7968 ins
->offset
= max_extent_size
;
7973 static void dump_space_info(struct btrfs_fs_info
*fs_info
,
7974 struct btrfs_space_info
*info
, u64 bytes
,
7975 int dump_block_groups
)
7977 struct btrfs_block_group_cache
*cache
;
7980 spin_lock(&info
->lock
);
7981 btrfs_info(fs_info
, "space_info %llu has %llu free, is %sfull",
7983 info
->total_bytes
- btrfs_space_info_used(info
, true),
7984 info
->full
? "" : "not ");
7986 "space_info total=%llu, used=%llu, pinned=%llu, reserved=%llu, may_use=%llu, readonly=%llu",
7987 info
->total_bytes
, info
->bytes_used
, info
->bytes_pinned
,
7988 info
->bytes_reserved
, info
->bytes_may_use
,
7989 info
->bytes_readonly
);
7990 spin_unlock(&info
->lock
);
7992 if (!dump_block_groups
)
7995 down_read(&info
->groups_sem
);
7997 list_for_each_entry(cache
, &info
->block_groups
[index
], list
) {
7998 spin_lock(&cache
->lock
);
8000 "block group %llu has %llu bytes, %llu used %llu pinned %llu reserved %s",
8001 cache
->key
.objectid
, cache
->key
.offset
,
8002 btrfs_block_group_used(&cache
->item
), cache
->pinned
,
8003 cache
->reserved
, cache
->ro
? "[readonly]" : "");
8004 btrfs_dump_free_space(cache
, bytes
);
8005 spin_unlock(&cache
->lock
);
8007 if (++index
< BTRFS_NR_RAID_TYPES
)
8009 up_read(&info
->groups_sem
);
8012 int btrfs_reserve_extent(struct btrfs_root
*root
, u64 ram_bytes
,
8013 u64 num_bytes
, u64 min_alloc_size
,
8014 u64 empty_size
, u64 hint_byte
,
8015 struct btrfs_key
*ins
, int is_data
, int delalloc
)
8017 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
8018 bool final_tried
= num_bytes
== min_alloc_size
;
8022 flags
= get_alloc_profile_by_root(root
, is_data
);
8024 WARN_ON(num_bytes
< fs_info
->sectorsize
);
8025 ret
= find_free_extent(fs_info
, ram_bytes
, num_bytes
, empty_size
,
8026 hint_byte
, ins
, flags
, delalloc
);
8027 if (!ret
&& !is_data
) {
8028 btrfs_dec_block_group_reservations(fs_info
, ins
->objectid
);
8029 } else if (ret
== -ENOSPC
) {
8030 if (!final_tried
&& ins
->offset
) {
8031 num_bytes
= min(num_bytes
>> 1, ins
->offset
);
8032 num_bytes
= round_down(num_bytes
,
8033 fs_info
->sectorsize
);
8034 num_bytes
= max(num_bytes
, min_alloc_size
);
8035 ram_bytes
= num_bytes
;
8036 if (num_bytes
== min_alloc_size
)
8039 } else if (btrfs_test_opt(fs_info
, ENOSPC_DEBUG
)) {
8040 struct btrfs_space_info
*sinfo
;
8042 sinfo
= __find_space_info(fs_info
, flags
);
8044 "allocation failed flags %llu, wanted %llu",
8047 dump_space_info(fs_info
, sinfo
, num_bytes
, 1);
8054 static int __btrfs_free_reserved_extent(struct btrfs_fs_info
*fs_info
,
8056 int pin
, int delalloc
)
8058 struct btrfs_block_group_cache
*cache
;
8061 cache
= btrfs_lookup_block_group(fs_info
, start
);
8063 btrfs_err(fs_info
, "Unable to find block group for %llu",
8069 pin_down_extent(fs_info
, cache
, start
, len
, 1);
8071 if (btrfs_test_opt(fs_info
, DISCARD
))
8072 ret
= btrfs_discard_extent(fs_info
, start
, len
, NULL
);
8073 btrfs_add_free_space(cache
, start
, len
);
8074 btrfs_free_reserved_bytes(cache
, len
, delalloc
);
8075 trace_btrfs_reserved_extent_free(fs_info
, start
, len
);
8078 btrfs_put_block_group(cache
);
8082 int btrfs_free_reserved_extent(struct btrfs_fs_info
*fs_info
,
8083 u64 start
, u64 len
, int delalloc
)
8085 return __btrfs_free_reserved_extent(fs_info
, start
, len
, 0, delalloc
);
8088 int btrfs_free_and_pin_reserved_extent(struct btrfs_fs_info
*fs_info
,
8091 return __btrfs_free_reserved_extent(fs_info
, start
, len
, 1, 0);
8094 static int alloc_reserved_file_extent(struct btrfs_trans_handle
*trans
,
8095 struct btrfs_fs_info
*fs_info
,
8096 u64 parent
, u64 root_objectid
,
8097 u64 flags
, u64 owner
, u64 offset
,
8098 struct btrfs_key
*ins
, int ref_mod
)
8101 struct btrfs_extent_item
*extent_item
;
8102 struct btrfs_extent_inline_ref
*iref
;
8103 struct btrfs_path
*path
;
8104 struct extent_buffer
*leaf
;
8109 type
= BTRFS_SHARED_DATA_REF_KEY
;
8111 type
= BTRFS_EXTENT_DATA_REF_KEY
;
8113 size
= sizeof(*extent_item
) + btrfs_extent_inline_ref_size(type
);
8115 path
= btrfs_alloc_path();
8119 path
->leave_spinning
= 1;
8120 ret
= btrfs_insert_empty_item(trans
, fs_info
->extent_root
, path
,
8123 btrfs_free_path(path
);
8127 leaf
= path
->nodes
[0];
8128 extent_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
8129 struct btrfs_extent_item
);
8130 btrfs_set_extent_refs(leaf
, extent_item
, ref_mod
);
8131 btrfs_set_extent_generation(leaf
, extent_item
, trans
->transid
);
8132 btrfs_set_extent_flags(leaf
, extent_item
,
8133 flags
| BTRFS_EXTENT_FLAG_DATA
);
8135 iref
= (struct btrfs_extent_inline_ref
*)(extent_item
+ 1);
8136 btrfs_set_extent_inline_ref_type(leaf
, iref
, type
);
8138 struct btrfs_shared_data_ref
*ref
;
8139 ref
= (struct btrfs_shared_data_ref
*)(iref
+ 1);
8140 btrfs_set_extent_inline_ref_offset(leaf
, iref
, parent
);
8141 btrfs_set_shared_data_ref_count(leaf
, ref
, ref_mod
);
8143 struct btrfs_extent_data_ref
*ref
;
8144 ref
= (struct btrfs_extent_data_ref
*)(&iref
->offset
);
8145 btrfs_set_extent_data_ref_root(leaf
, ref
, root_objectid
);
8146 btrfs_set_extent_data_ref_objectid(leaf
, ref
, owner
);
8147 btrfs_set_extent_data_ref_offset(leaf
, ref
, offset
);
8148 btrfs_set_extent_data_ref_count(leaf
, ref
, ref_mod
);
8151 btrfs_mark_buffer_dirty(path
->nodes
[0]);
8152 btrfs_free_path(path
);
8154 ret
= remove_from_free_space_tree(trans
, fs_info
, ins
->objectid
,
8159 ret
= update_block_group(trans
, fs_info
, ins
->objectid
, ins
->offset
, 1);
8160 if (ret
) { /* -ENOENT, logic error */
8161 btrfs_err(fs_info
, "update block group failed for %llu %llu",
8162 ins
->objectid
, ins
->offset
);
8165 trace_btrfs_reserved_extent_alloc(fs_info
, ins
->objectid
, ins
->offset
);
8169 static int alloc_reserved_tree_block(struct btrfs_trans_handle
*trans
,
8170 struct btrfs_fs_info
*fs_info
,
8171 u64 parent
, u64 root_objectid
,
8172 u64 flags
, struct btrfs_disk_key
*key
,
8173 int level
, struct btrfs_key
*ins
)
8176 struct btrfs_extent_item
*extent_item
;
8177 struct btrfs_tree_block_info
*block_info
;
8178 struct btrfs_extent_inline_ref
*iref
;
8179 struct btrfs_path
*path
;
8180 struct extent_buffer
*leaf
;
8181 u32 size
= sizeof(*extent_item
) + sizeof(*iref
);
8182 u64 num_bytes
= ins
->offset
;
8183 bool skinny_metadata
= btrfs_fs_incompat(fs_info
, SKINNY_METADATA
);
8185 if (!skinny_metadata
)
8186 size
+= sizeof(*block_info
);
8188 path
= btrfs_alloc_path();
8192 path
->leave_spinning
= 1;
8193 ret
= btrfs_insert_empty_item(trans
, fs_info
->extent_root
, path
,
8196 btrfs_free_path(path
);
8200 leaf
= path
->nodes
[0];
8201 extent_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
8202 struct btrfs_extent_item
);
8203 btrfs_set_extent_refs(leaf
, extent_item
, 1);
8204 btrfs_set_extent_generation(leaf
, extent_item
, trans
->transid
);
8205 btrfs_set_extent_flags(leaf
, extent_item
,
8206 flags
| BTRFS_EXTENT_FLAG_TREE_BLOCK
);
8208 if (skinny_metadata
) {
8209 iref
= (struct btrfs_extent_inline_ref
*)(extent_item
+ 1);
8210 num_bytes
= fs_info
->nodesize
;
8212 block_info
= (struct btrfs_tree_block_info
*)(extent_item
+ 1);
8213 btrfs_set_tree_block_key(leaf
, block_info
, key
);
8214 btrfs_set_tree_block_level(leaf
, block_info
, level
);
8215 iref
= (struct btrfs_extent_inline_ref
*)(block_info
+ 1);
8219 BUG_ON(!(flags
& BTRFS_BLOCK_FLAG_FULL_BACKREF
));
8220 btrfs_set_extent_inline_ref_type(leaf
, iref
,
8221 BTRFS_SHARED_BLOCK_REF_KEY
);
8222 btrfs_set_extent_inline_ref_offset(leaf
, iref
, parent
);
8224 btrfs_set_extent_inline_ref_type(leaf
, iref
,
8225 BTRFS_TREE_BLOCK_REF_KEY
);
8226 btrfs_set_extent_inline_ref_offset(leaf
, iref
, root_objectid
);
8229 btrfs_mark_buffer_dirty(leaf
);
8230 btrfs_free_path(path
);
8232 ret
= remove_from_free_space_tree(trans
, fs_info
, ins
->objectid
,
8237 ret
= update_block_group(trans
, fs_info
, ins
->objectid
,
8238 fs_info
->nodesize
, 1);
8239 if (ret
) { /* -ENOENT, logic error */
8240 btrfs_err(fs_info
, "update block group failed for %llu %llu",
8241 ins
->objectid
, ins
->offset
);
8245 trace_btrfs_reserved_extent_alloc(fs_info
, ins
->objectid
,
8250 int btrfs_alloc_reserved_file_extent(struct btrfs_trans_handle
*trans
,
8251 struct btrfs_root
*root
, u64 owner
,
8252 u64 offset
, u64 ram_bytes
,
8253 struct btrfs_key
*ins
)
8255 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
8258 BUG_ON(root
->root_key
.objectid
== BTRFS_TREE_LOG_OBJECTID
);
8260 btrfs_ref_tree_mod(root
, ins
->objectid
, ins
->offset
, 0,
8261 root
->root_key
.objectid
, owner
, offset
,
8262 BTRFS_ADD_DELAYED_EXTENT
);
8264 ret
= btrfs_add_delayed_data_ref(fs_info
, trans
, ins
->objectid
,
8266 root
->root_key
.objectid
, owner
,
8268 BTRFS_ADD_DELAYED_EXTENT
, NULL
, NULL
);
8273 * this is used by the tree logging recovery code. It records that
8274 * an extent has been allocated and makes sure to clear the free
8275 * space cache bits as well
8277 int btrfs_alloc_logged_file_extent(struct btrfs_trans_handle
*trans
,
8278 struct btrfs_fs_info
*fs_info
,
8279 u64 root_objectid
, u64 owner
, u64 offset
,
8280 struct btrfs_key
*ins
)
8283 struct btrfs_block_group_cache
*block_group
;
8284 struct btrfs_space_info
*space_info
;
8287 * Mixed block groups will exclude before processing the log so we only
8288 * need to do the exclude dance if this fs isn't mixed.
8290 if (!btrfs_fs_incompat(fs_info
, MIXED_GROUPS
)) {
8291 ret
= __exclude_logged_extent(fs_info
, ins
->objectid
,
8297 block_group
= btrfs_lookup_block_group(fs_info
, ins
->objectid
);
8301 space_info
= block_group
->space_info
;
8302 spin_lock(&space_info
->lock
);
8303 spin_lock(&block_group
->lock
);
8304 space_info
->bytes_reserved
+= ins
->offset
;
8305 block_group
->reserved
+= ins
->offset
;
8306 spin_unlock(&block_group
->lock
);
8307 spin_unlock(&space_info
->lock
);
8309 ret
= alloc_reserved_file_extent(trans
, fs_info
, 0, root_objectid
,
8310 0, owner
, offset
, ins
, 1);
8311 btrfs_put_block_group(block_group
);
8315 static struct extent_buffer
*
8316 btrfs_init_new_buffer(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
8317 u64 bytenr
, int level
)
8319 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
8320 struct extent_buffer
*buf
;
8322 buf
= btrfs_find_create_tree_block(fs_info
, bytenr
);
8327 * Extra safety check in case the extent tree is corrupted and extent
8328 * allocator chooses to use a tree block which is already used and
8331 if (buf
->lock_owner
== current
->pid
) {
8332 btrfs_err_rl(fs_info
,
8333 "tree block %llu owner %llu already locked by pid=%d, extent tree corruption detected",
8334 buf
->start
, btrfs_header_owner(buf
), current
->pid
);
8335 free_extent_buffer(buf
);
8336 return ERR_PTR(-EUCLEAN
);
8339 btrfs_set_header_generation(buf
, trans
->transid
);
8340 btrfs_set_buffer_lockdep_class(root
->root_key
.objectid
, buf
, level
);
8341 btrfs_tree_lock(buf
);
8342 clean_tree_block(fs_info
, buf
);
8343 clear_bit(EXTENT_BUFFER_STALE
, &buf
->bflags
);
8345 btrfs_set_lock_blocking(buf
);
8346 set_extent_buffer_uptodate(buf
);
8348 if (root
->root_key
.objectid
== BTRFS_TREE_LOG_OBJECTID
) {
8349 buf
->log_index
= root
->log_transid
% 2;
8351 * we allow two log transactions at a time, use different
8352 * EXENT bit to differentiate dirty pages.
8354 if (buf
->log_index
== 0)
8355 set_extent_dirty(&root
->dirty_log_pages
, buf
->start
,
8356 buf
->start
+ buf
->len
- 1, GFP_NOFS
);
8358 set_extent_new(&root
->dirty_log_pages
, buf
->start
,
8359 buf
->start
+ buf
->len
- 1);
8361 buf
->log_index
= -1;
8362 set_extent_dirty(&trans
->transaction
->dirty_pages
, buf
->start
,
8363 buf
->start
+ buf
->len
- 1, GFP_NOFS
);
8365 trans
->dirty
= true;
8366 /* this returns a buffer locked for blocking */
8370 static struct btrfs_block_rsv
*
8371 use_block_rsv(struct btrfs_trans_handle
*trans
,
8372 struct btrfs_root
*root
, u32 blocksize
)
8374 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
8375 struct btrfs_block_rsv
*block_rsv
;
8376 struct btrfs_block_rsv
*global_rsv
= &fs_info
->global_block_rsv
;
8378 bool global_updated
= false;
8380 block_rsv
= get_block_rsv(trans
, root
);
8382 if (unlikely(block_rsv
->size
== 0))
8385 ret
= block_rsv_use_bytes(block_rsv
, blocksize
);
8389 if (block_rsv
->failfast
)
8390 return ERR_PTR(ret
);
8392 if (block_rsv
->type
== BTRFS_BLOCK_RSV_GLOBAL
&& !global_updated
) {
8393 global_updated
= true;
8394 update_global_block_rsv(fs_info
);
8398 if (btrfs_test_opt(fs_info
, ENOSPC_DEBUG
)) {
8399 static DEFINE_RATELIMIT_STATE(_rs
,
8400 DEFAULT_RATELIMIT_INTERVAL
* 10,
8401 /*DEFAULT_RATELIMIT_BURST*/ 1);
8402 if (__ratelimit(&_rs
))
8404 "BTRFS: block rsv returned %d\n", ret
);
8407 ret
= reserve_metadata_bytes(root
, block_rsv
, blocksize
,
8408 BTRFS_RESERVE_NO_FLUSH
);
8412 * If we couldn't reserve metadata bytes try and use some from
8413 * the global reserve if its space type is the same as the global
8416 if (block_rsv
->type
!= BTRFS_BLOCK_RSV_GLOBAL
&&
8417 block_rsv
->space_info
== global_rsv
->space_info
) {
8418 ret
= block_rsv_use_bytes(global_rsv
, blocksize
);
8422 return ERR_PTR(ret
);
8425 static void unuse_block_rsv(struct btrfs_fs_info
*fs_info
,
8426 struct btrfs_block_rsv
*block_rsv
, u32 blocksize
)
8428 block_rsv_add_bytes(block_rsv
, blocksize
, 0);
8429 block_rsv_release_bytes(fs_info
, block_rsv
, NULL
, 0);
8433 * finds a free extent and does all the dirty work required for allocation
8434 * returns the tree buffer or an ERR_PTR on error.
8436 struct extent_buffer
*btrfs_alloc_tree_block(struct btrfs_trans_handle
*trans
,
8437 struct btrfs_root
*root
,
8438 u64 parent
, u64 root_objectid
,
8439 const struct btrfs_disk_key
*key
,
8440 int level
, u64 hint
,
8443 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
8444 struct btrfs_key ins
;
8445 struct btrfs_block_rsv
*block_rsv
;
8446 struct extent_buffer
*buf
;
8447 struct btrfs_delayed_extent_op
*extent_op
;
8450 u32 blocksize
= fs_info
->nodesize
;
8451 bool skinny_metadata
= btrfs_fs_incompat(fs_info
, SKINNY_METADATA
);
8453 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
8454 if (btrfs_is_testing(fs_info
)) {
8455 buf
= btrfs_init_new_buffer(trans
, root
, root
->alloc_bytenr
,
8458 root
->alloc_bytenr
+= blocksize
;
8463 block_rsv
= use_block_rsv(trans
, root
, blocksize
);
8464 if (IS_ERR(block_rsv
))
8465 return ERR_CAST(block_rsv
);
8467 ret
= btrfs_reserve_extent(root
, blocksize
, blocksize
, blocksize
,
8468 empty_size
, hint
, &ins
, 0, 0);
8472 buf
= btrfs_init_new_buffer(trans
, root
, ins
.objectid
, level
);
8475 goto out_free_reserved
;
8478 if (root_objectid
== BTRFS_TREE_RELOC_OBJECTID
) {
8480 parent
= ins
.objectid
;
8481 flags
|= BTRFS_BLOCK_FLAG_FULL_BACKREF
;
8485 if (root_objectid
!= BTRFS_TREE_LOG_OBJECTID
) {
8486 extent_op
= btrfs_alloc_delayed_extent_op();
8492 memcpy(&extent_op
->key
, key
, sizeof(extent_op
->key
));
8494 memset(&extent_op
->key
, 0, sizeof(extent_op
->key
));
8495 extent_op
->flags_to_set
= flags
;
8496 extent_op
->update_key
= skinny_metadata
? false : true;
8497 extent_op
->update_flags
= true;
8498 extent_op
->is_data
= false;
8499 extent_op
->level
= level
;
8501 btrfs_ref_tree_mod(root
, ins
.objectid
, ins
.offset
, parent
,
8502 root_objectid
, level
, 0,
8503 BTRFS_ADD_DELAYED_EXTENT
);
8504 ret
= btrfs_add_delayed_tree_ref(fs_info
, trans
, ins
.objectid
,
8506 root_objectid
, level
,
8507 BTRFS_ADD_DELAYED_EXTENT
,
8508 extent_op
, NULL
, NULL
);
8510 goto out_free_delayed
;
8515 btrfs_free_delayed_extent_op(extent_op
);
8517 free_extent_buffer(buf
);
8519 btrfs_free_reserved_extent(fs_info
, ins
.objectid
, ins
.offset
, 0);
8521 unuse_block_rsv(fs_info
, block_rsv
, blocksize
);
8522 return ERR_PTR(ret
);
8525 struct walk_control
{
8526 u64 refs
[BTRFS_MAX_LEVEL
];
8527 u64 flags
[BTRFS_MAX_LEVEL
];
8528 struct btrfs_key update_progress
;
8539 #define DROP_REFERENCE 1
8540 #define UPDATE_BACKREF 2
8542 static noinline
void reada_walk_down(struct btrfs_trans_handle
*trans
,
8543 struct btrfs_root
*root
,
8544 struct walk_control
*wc
,
8545 struct btrfs_path
*path
)
8547 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
8553 struct btrfs_key key
;
8554 struct extent_buffer
*eb
;
8559 if (path
->slots
[wc
->level
] < wc
->reada_slot
) {
8560 wc
->reada_count
= wc
->reada_count
* 2 / 3;
8561 wc
->reada_count
= max(wc
->reada_count
, 2);
8563 wc
->reada_count
= wc
->reada_count
* 3 / 2;
8564 wc
->reada_count
= min_t(int, wc
->reada_count
,
8565 BTRFS_NODEPTRS_PER_BLOCK(fs_info
));
8568 eb
= path
->nodes
[wc
->level
];
8569 nritems
= btrfs_header_nritems(eb
);
8571 for (slot
= path
->slots
[wc
->level
]; slot
< nritems
; slot
++) {
8572 if (nread
>= wc
->reada_count
)
8576 bytenr
= btrfs_node_blockptr(eb
, slot
);
8577 generation
= btrfs_node_ptr_generation(eb
, slot
);
8579 if (slot
== path
->slots
[wc
->level
])
8582 if (wc
->stage
== UPDATE_BACKREF
&&
8583 generation
<= root
->root_key
.offset
)
8586 /* We don't lock the tree block, it's OK to be racy here */
8587 ret
= btrfs_lookup_extent_info(trans
, fs_info
, bytenr
,
8588 wc
->level
- 1, 1, &refs
,
8590 /* We don't care about errors in readahead. */
8595 if (wc
->stage
== DROP_REFERENCE
) {
8599 if (wc
->level
== 1 &&
8600 (flags
& BTRFS_BLOCK_FLAG_FULL_BACKREF
))
8602 if (!wc
->update_ref
||
8603 generation
<= root
->root_key
.offset
)
8605 btrfs_node_key_to_cpu(eb
, &key
, slot
);
8606 ret
= btrfs_comp_cpu_keys(&key
,
8607 &wc
->update_progress
);
8611 if (wc
->level
== 1 &&
8612 (flags
& BTRFS_BLOCK_FLAG_FULL_BACKREF
))
8616 readahead_tree_block(fs_info
, bytenr
);
8619 wc
->reada_slot
= slot
;
8623 * helper to process tree block while walking down the tree.
8625 * when wc->stage == UPDATE_BACKREF, this function updates
8626 * back refs for pointers in the block.
8628 * NOTE: return value 1 means we should stop walking down.
8630 static noinline
int walk_down_proc(struct btrfs_trans_handle
*trans
,
8631 struct btrfs_root
*root
,
8632 struct btrfs_path
*path
,
8633 struct walk_control
*wc
, int lookup_info
)
8635 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
8636 int level
= wc
->level
;
8637 struct extent_buffer
*eb
= path
->nodes
[level
];
8638 u64 flag
= BTRFS_BLOCK_FLAG_FULL_BACKREF
;
8641 if (wc
->stage
== UPDATE_BACKREF
&&
8642 btrfs_header_owner(eb
) != root
->root_key
.objectid
)
8646 * when reference count of tree block is 1, it won't increase
8647 * again. once full backref flag is set, we never clear it.
8650 ((wc
->stage
== DROP_REFERENCE
&& wc
->refs
[level
] != 1) ||
8651 (wc
->stage
== UPDATE_BACKREF
&& !(wc
->flags
[level
] & flag
)))) {
8652 BUG_ON(!path
->locks
[level
]);
8653 ret
= btrfs_lookup_extent_info(trans
, fs_info
,
8654 eb
->start
, level
, 1,
8657 BUG_ON(ret
== -ENOMEM
);
8660 BUG_ON(wc
->refs
[level
] == 0);
8663 if (wc
->stage
== DROP_REFERENCE
) {
8664 if (wc
->refs
[level
] > 1)
8667 if (path
->locks
[level
] && !wc
->keep_locks
) {
8668 btrfs_tree_unlock_rw(eb
, path
->locks
[level
]);
8669 path
->locks
[level
] = 0;
8674 /* wc->stage == UPDATE_BACKREF */
8675 if (!(wc
->flags
[level
] & flag
)) {
8676 BUG_ON(!path
->locks
[level
]);
8677 ret
= btrfs_inc_ref(trans
, root
, eb
, 1);
8678 BUG_ON(ret
); /* -ENOMEM */
8679 ret
= btrfs_dec_ref(trans
, root
, eb
, 0);
8680 BUG_ON(ret
); /* -ENOMEM */
8681 ret
= btrfs_set_disk_extent_flags(trans
, fs_info
, eb
->start
,
8683 btrfs_header_level(eb
), 0);
8684 BUG_ON(ret
); /* -ENOMEM */
8685 wc
->flags
[level
] |= flag
;
8689 * the block is shared by multiple trees, so it's not good to
8690 * keep the tree lock
8692 if (path
->locks
[level
] && level
> 0) {
8693 btrfs_tree_unlock_rw(eb
, path
->locks
[level
]);
8694 path
->locks
[level
] = 0;
8700 * helper to process tree block pointer.
8702 * when wc->stage == DROP_REFERENCE, this function checks
8703 * reference count of the block pointed to. if the block
8704 * is shared and we need update back refs for the subtree
8705 * rooted at the block, this function changes wc->stage to
8706 * UPDATE_BACKREF. if the block is shared and there is no
8707 * need to update back, this function drops the reference
8710 * NOTE: return value 1 means we should stop walking down.
8712 static noinline
int do_walk_down(struct btrfs_trans_handle
*trans
,
8713 struct btrfs_root
*root
,
8714 struct btrfs_path
*path
,
8715 struct walk_control
*wc
, int *lookup_info
)
8717 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
8722 struct btrfs_key key
;
8723 struct extent_buffer
*next
;
8724 int level
= wc
->level
;
8727 bool need_account
= false;
8729 generation
= btrfs_node_ptr_generation(path
->nodes
[level
],
8730 path
->slots
[level
]);
8732 * if the lower level block was created before the snapshot
8733 * was created, we know there is no need to update back refs
8736 if (wc
->stage
== UPDATE_BACKREF
&&
8737 generation
<= root
->root_key
.offset
) {
8742 bytenr
= btrfs_node_blockptr(path
->nodes
[level
], path
->slots
[level
]);
8743 blocksize
= fs_info
->nodesize
;
8745 next
= find_extent_buffer(fs_info
, bytenr
);
8747 next
= btrfs_find_create_tree_block(fs_info
, bytenr
);
8749 return PTR_ERR(next
);
8751 btrfs_set_buffer_lockdep_class(root
->root_key
.objectid
, next
,
8755 btrfs_tree_lock(next
);
8756 btrfs_set_lock_blocking(next
);
8758 ret
= btrfs_lookup_extent_info(trans
, fs_info
, bytenr
, level
- 1, 1,
8759 &wc
->refs
[level
- 1],
8760 &wc
->flags
[level
- 1]);
8764 if (unlikely(wc
->refs
[level
- 1] == 0)) {
8765 btrfs_err(fs_info
, "Missing references.");
8771 if (wc
->stage
== DROP_REFERENCE
) {
8772 if (wc
->refs
[level
- 1] > 1) {
8773 need_account
= true;
8775 (wc
->flags
[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF
))
8778 if (!wc
->update_ref
||
8779 generation
<= root
->root_key
.offset
)
8782 btrfs_node_key_to_cpu(path
->nodes
[level
], &key
,
8783 path
->slots
[level
]);
8784 ret
= btrfs_comp_cpu_keys(&key
, &wc
->update_progress
);
8788 wc
->stage
= UPDATE_BACKREF
;
8789 wc
->shared_level
= level
- 1;
8793 (wc
->flags
[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF
))
8797 if (!btrfs_buffer_uptodate(next
, generation
, 0)) {
8798 btrfs_tree_unlock(next
);
8799 free_extent_buffer(next
);
8805 if (reada
&& level
== 1)
8806 reada_walk_down(trans
, root
, wc
, path
);
8807 next
= read_tree_block(fs_info
, bytenr
, generation
);
8809 return PTR_ERR(next
);
8810 } else if (!extent_buffer_uptodate(next
)) {
8811 free_extent_buffer(next
);
8814 btrfs_tree_lock(next
);
8815 btrfs_set_lock_blocking(next
);
8819 ASSERT(level
== btrfs_header_level(next
));
8820 if (level
!= btrfs_header_level(next
)) {
8821 btrfs_err(root
->fs_info
, "mismatched level");
8825 path
->nodes
[level
] = next
;
8826 path
->slots
[level
] = 0;
8827 path
->locks
[level
] = BTRFS_WRITE_LOCK_BLOCKING
;
8833 wc
->refs
[level
- 1] = 0;
8834 wc
->flags
[level
- 1] = 0;
8835 if (wc
->stage
== DROP_REFERENCE
) {
8836 if (wc
->flags
[level
] & BTRFS_BLOCK_FLAG_FULL_BACKREF
) {
8837 parent
= path
->nodes
[level
]->start
;
8839 ASSERT(root
->root_key
.objectid
==
8840 btrfs_header_owner(path
->nodes
[level
]));
8841 if (root
->root_key
.objectid
!=
8842 btrfs_header_owner(path
->nodes
[level
])) {
8843 btrfs_err(root
->fs_info
,
8844 "mismatched block owner");
8852 ret
= btrfs_qgroup_trace_subtree(trans
, root
, next
,
8853 generation
, level
- 1);
8855 btrfs_err_rl(fs_info
,
8856 "Error %d accounting shared subtree. Quota is out of sync, rescan required.",
8860 ret
= btrfs_free_extent(trans
, root
, bytenr
, blocksize
,
8861 parent
, root
->root_key
.objectid
,
8871 btrfs_tree_unlock(next
);
8872 free_extent_buffer(next
);
8878 * helper to process tree block while walking up the tree.
8880 * when wc->stage == DROP_REFERENCE, this function drops
8881 * reference count on the block.
8883 * when wc->stage == UPDATE_BACKREF, this function changes
8884 * wc->stage back to DROP_REFERENCE if we changed wc->stage
8885 * to UPDATE_BACKREF previously while processing the block.
8887 * NOTE: return value 1 means we should stop walking up.
8889 static noinline
int walk_up_proc(struct btrfs_trans_handle
*trans
,
8890 struct btrfs_root
*root
,
8891 struct btrfs_path
*path
,
8892 struct walk_control
*wc
)
8894 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
8896 int level
= wc
->level
;
8897 struct extent_buffer
*eb
= path
->nodes
[level
];
8900 if (wc
->stage
== UPDATE_BACKREF
) {
8901 BUG_ON(wc
->shared_level
< level
);
8902 if (level
< wc
->shared_level
)
8905 ret
= find_next_key(path
, level
+ 1, &wc
->update_progress
);
8909 wc
->stage
= DROP_REFERENCE
;
8910 wc
->shared_level
= -1;
8911 path
->slots
[level
] = 0;
8914 * check reference count again if the block isn't locked.
8915 * we should start walking down the tree again if reference
8918 if (!path
->locks
[level
]) {
8920 btrfs_tree_lock(eb
);
8921 btrfs_set_lock_blocking(eb
);
8922 path
->locks
[level
] = BTRFS_WRITE_LOCK_BLOCKING
;
8924 ret
= btrfs_lookup_extent_info(trans
, fs_info
,
8925 eb
->start
, level
, 1,
8929 btrfs_tree_unlock_rw(eb
, path
->locks
[level
]);
8930 path
->locks
[level
] = 0;
8933 BUG_ON(wc
->refs
[level
] == 0);
8934 if (wc
->refs
[level
] == 1) {
8935 btrfs_tree_unlock_rw(eb
, path
->locks
[level
]);
8936 path
->locks
[level
] = 0;
8942 /* wc->stage == DROP_REFERENCE */
8943 BUG_ON(wc
->refs
[level
] > 1 && !path
->locks
[level
]);
8945 if (wc
->refs
[level
] == 1) {
8947 if (wc
->flags
[level
] & BTRFS_BLOCK_FLAG_FULL_BACKREF
)
8948 ret
= btrfs_dec_ref(trans
, root
, eb
, 1);
8950 ret
= btrfs_dec_ref(trans
, root
, eb
, 0);
8951 BUG_ON(ret
); /* -ENOMEM */
8952 ret
= btrfs_qgroup_trace_leaf_items(trans
, fs_info
, eb
);
8954 btrfs_err_rl(fs_info
,
8955 "error %d accounting leaf items. Quota is out of sync, rescan required.",
8959 /* make block locked assertion in clean_tree_block happy */
8960 if (!path
->locks
[level
] &&
8961 btrfs_header_generation(eb
) == trans
->transid
) {
8962 btrfs_tree_lock(eb
);
8963 btrfs_set_lock_blocking(eb
);
8964 path
->locks
[level
] = BTRFS_WRITE_LOCK_BLOCKING
;
8966 clean_tree_block(fs_info
, eb
);
8969 if (eb
== root
->node
) {
8970 if (wc
->flags
[level
] & BTRFS_BLOCK_FLAG_FULL_BACKREF
)
8972 else if (root
->root_key
.objectid
!= btrfs_header_owner(eb
))
8973 goto owner_mismatch
;
8975 if (wc
->flags
[level
+ 1] & BTRFS_BLOCK_FLAG_FULL_BACKREF
)
8976 parent
= path
->nodes
[level
+ 1]->start
;
8977 else if (root
->root_key
.objectid
!=
8978 btrfs_header_owner(path
->nodes
[level
+ 1]))
8979 goto owner_mismatch
;
8982 btrfs_free_tree_block(trans
, root
, eb
, parent
, wc
->refs
[level
] == 1);
8984 wc
->refs
[level
] = 0;
8985 wc
->flags
[level
] = 0;
8989 btrfs_err_rl(fs_info
, "unexpected tree owner, have %llu expect %llu",
8990 btrfs_header_owner(eb
), root
->root_key
.objectid
);
8994 static noinline
int walk_down_tree(struct btrfs_trans_handle
*trans
,
8995 struct btrfs_root
*root
,
8996 struct btrfs_path
*path
,
8997 struct walk_control
*wc
)
8999 int level
= wc
->level
;
9000 int lookup_info
= 1;
9003 while (level
>= 0) {
9004 ret
= walk_down_proc(trans
, root
, path
, wc
, lookup_info
);
9011 if (path
->slots
[level
] >=
9012 btrfs_header_nritems(path
->nodes
[level
]))
9015 ret
= do_walk_down(trans
, root
, path
, wc
, &lookup_info
);
9017 path
->slots
[level
]++;
9026 static noinline
int walk_up_tree(struct btrfs_trans_handle
*trans
,
9027 struct btrfs_root
*root
,
9028 struct btrfs_path
*path
,
9029 struct walk_control
*wc
, int max_level
)
9031 int level
= wc
->level
;
9034 path
->slots
[level
] = btrfs_header_nritems(path
->nodes
[level
]);
9035 while (level
< max_level
&& path
->nodes
[level
]) {
9037 if (path
->slots
[level
] + 1 <
9038 btrfs_header_nritems(path
->nodes
[level
])) {
9039 path
->slots
[level
]++;
9042 ret
= walk_up_proc(trans
, root
, path
, wc
);
9048 if (path
->locks
[level
]) {
9049 btrfs_tree_unlock_rw(path
->nodes
[level
],
9050 path
->locks
[level
]);
9051 path
->locks
[level
] = 0;
9053 free_extent_buffer(path
->nodes
[level
]);
9054 path
->nodes
[level
] = NULL
;
9062 * drop a subvolume tree.
9064 * this function traverses the tree freeing any blocks that only
9065 * referenced by the tree.
9067 * when a shared tree block is found. this function decreases its
9068 * reference count by one. if update_ref is true, this function
9069 * also make sure backrefs for the shared block and all lower level
9070 * blocks are properly updated.
9072 * If called with for_reloc == 0, may exit early with -EAGAIN
9074 int btrfs_drop_snapshot(struct btrfs_root
*root
,
9075 struct btrfs_block_rsv
*block_rsv
, int update_ref
,
9078 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
9079 struct btrfs_path
*path
;
9080 struct btrfs_trans_handle
*trans
;
9081 struct btrfs_root
*tree_root
= fs_info
->tree_root
;
9082 struct btrfs_root_item
*root_item
= &root
->root_item
;
9083 struct walk_control
*wc
;
9084 struct btrfs_key key
;
9088 bool root_dropped
= false;
9090 btrfs_debug(fs_info
, "Drop subvolume %llu", root
->objectid
);
9092 path
= btrfs_alloc_path();
9098 wc
= kzalloc(sizeof(*wc
), GFP_NOFS
);
9100 btrfs_free_path(path
);
9105 trans
= btrfs_start_transaction(tree_root
, 0);
9106 if (IS_ERR(trans
)) {
9107 err
= PTR_ERR(trans
);
9112 trans
->block_rsv
= block_rsv
;
9114 if (btrfs_disk_key_objectid(&root_item
->drop_progress
) == 0) {
9115 level
= btrfs_header_level(root
->node
);
9116 path
->nodes
[level
] = btrfs_lock_root_node(root
);
9117 btrfs_set_lock_blocking(path
->nodes
[level
]);
9118 path
->slots
[level
] = 0;
9119 path
->locks
[level
] = BTRFS_WRITE_LOCK_BLOCKING
;
9120 memset(&wc
->update_progress
, 0,
9121 sizeof(wc
->update_progress
));
9123 btrfs_disk_key_to_cpu(&key
, &root_item
->drop_progress
);
9124 memcpy(&wc
->update_progress
, &key
,
9125 sizeof(wc
->update_progress
));
9127 level
= root_item
->drop_level
;
9129 path
->lowest_level
= level
;
9130 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
9131 path
->lowest_level
= 0;
9139 * unlock our path, this is safe because only this
9140 * function is allowed to delete this snapshot
9142 btrfs_unlock_up_safe(path
, 0);
9144 level
= btrfs_header_level(root
->node
);
9146 btrfs_tree_lock(path
->nodes
[level
]);
9147 btrfs_set_lock_blocking(path
->nodes
[level
]);
9148 path
->locks
[level
] = BTRFS_WRITE_LOCK_BLOCKING
;
9150 ret
= btrfs_lookup_extent_info(trans
, fs_info
,
9151 path
->nodes
[level
]->start
,
9152 level
, 1, &wc
->refs
[level
],
9158 BUG_ON(wc
->refs
[level
] == 0);
9160 if (level
== root_item
->drop_level
)
9163 btrfs_tree_unlock(path
->nodes
[level
]);
9164 path
->locks
[level
] = 0;
9165 WARN_ON(wc
->refs
[level
] != 1);
9171 wc
->shared_level
= -1;
9172 wc
->stage
= DROP_REFERENCE
;
9173 wc
->update_ref
= update_ref
;
9175 wc
->for_reloc
= for_reloc
;
9176 wc
->reada_count
= BTRFS_NODEPTRS_PER_BLOCK(fs_info
);
9180 ret
= walk_down_tree(trans
, root
, path
, wc
);
9186 ret
= walk_up_tree(trans
, root
, path
, wc
, BTRFS_MAX_LEVEL
);
9193 BUG_ON(wc
->stage
!= DROP_REFERENCE
);
9197 if (wc
->stage
== DROP_REFERENCE
) {
9199 btrfs_node_key(path
->nodes
[level
],
9200 &root_item
->drop_progress
,
9201 path
->slots
[level
]);
9202 root_item
->drop_level
= level
;
9205 BUG_ON(wc
->level
== 0);
9206 if (btrfs_should_end_transaction(trans
) ||
9207 (!for_reloc
&& btrfs_need_cleaner_sleep(fs_info
))) {
9208 ret
= btrfs_update_root(trans
, tree_root
,
9212 btrfs_abort_transaction(trans
, ret
);
9217 btrfs_end_transaction_throttle(trans
);
9218 if (!for_reloc
&& btrfs_need_cleaner_sleep(fs_info
)) {
9219 btrfs_debug(fs_info
,
9220 "drop snapshot early exit");
9225 trans
= btrfs_start_transaction(tree_root
, 0);
9226 if (IS_ERR(trans
)) {
9227 err
= PTR_ERR(trans
);
9231 trans
->block_rsv
= block_rsv
;
9234 btrfs_release_path(path
);
9238 ret
= btrfs_del_root(trans
, fs_info
, &root
->root_key
);
9240 btrfs_abort_transaction(trans
, ret
);
9245 if (root
->root_key
.objectid
!= BTRFS_TREE_RELOC_OBJECTID
) {
9246 ret
= btrfs_find_root(tree_root
, &root
->root_key
, path
,
9249 btrfs_abort_transaction(trans
, ret
);
9252 } else if (ret
> 0) {
9253 /* if we fail to delete the orphan item this time
9254 * around, it'll get picked up the next time.
9256 * The most common failure here is just -ENOENT.
9258 btrfs_del_orphan_item(trans
, tree_root
,
9259 root
->root_key
.objectid
);
9263 if (test_bit(BTRFS_ROOT_IN_RADIX
, &root
->state
)) {
9264 btrfs_add_dropped_root(trans
, root
);
9266 free_extent_buffer(root
->node
);
9267 free_extent_buffer(root
->commit_root
);
9268 btrfs_put_fs_root(root
);
9270 root_dropped
= true;
9272 btrfs_end_transaction_throttle(trans
);
9275 btrfs_free_path(path
);
9278 * So if we need to stop dropping the snapshot for whatever reason we
9279 * need to make sure to add it back to the dead root list so that we
9280 * keep trying to do the work later. This also cleans up roots if we
9281 * don't have it in the radix (like when we recover after a power fail
9282 * or unmount) so we don't leak memory.
9284 if (!for_reloc
&& !root_dropped
)
9285 btrfs_add_dead_root(root
);
9286 if (err
&& err
!= -EAGAIN
)
9287 btrfs_handle_fs_error(fs_info
, err
, NULL
);
9292 * drop subtree rooted at tree block 'node'.
9294 * NOTE: this function will unlock and release tree block 'node'
9295 * only used by relocation code
9297 int btrfs_drop_subtree(struct btrfs_trans_handle
*trans
,
9298 struct btrfs_root
*root
,
9299 struct extent_buffer
*node
,
9300 struct extent_buffer
*parent
)
9302 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
9303 struct btrfs_path
*path
;
9304 struct walk_control
*wc
;
9310 BUG_ON(root
->root_key
.objectid
!= BTRFS_TREE_RELOC_OBJECTID
);
9312 path
= btrfs_alloc_path();
9316 wc
= kzalloc(sizeof(*wc
), GFP_NOFS
);
9318 btrfs_free_path(path
);
9322 btrfs_assert_tree_locked(parent
);
9323 parent_level
= btrfs_header_level(parent
);
9324 extent_buffer_get(parent
);
9325 path
->nodes
[parent_level
] = parent
;
9326 path
->slots
[parent_level
] = btrfs_header_nritems(parent
);
9328 btrfs_assert_tree_locked(node
);
9329 level
= btrfs_header_level(node
);
9330 path
->nodes
[level
] = node
;
9331 path
->slots
[level
] = 0;
9332 path
->locks
[level
] = BTRFS_WRITE_LOCK_BLOCKING
;
9334 wc
->refs
[parent_level
] = 1;
9335 wc
->flags
[parent_level
] = BTRFS_BLOCK_FLAG_FULL_BACKREF
;
9337 wc
->shared_level
= -1;
9338 wc
->stage
= DROP_REFERENCE
;
9342 wc
->reada_count
= BTRFS_NODEPTRS_PER_BLOCK(fs_info
);
9345 wret
= walk_down_tree(trans
, root
, path
, wc
);
9351 wret
= walk_up_tree(trans
, root
, path
, wc
, parent_level
);
9359 btrfs_free_path(path
);
9363 static u64
update_block_group_flags(struct btrfs_fs_info
*fs_info
, u64 flags
)
9369 * if restripe for this chunk_type is on pick target profile and
9370 * return, otherwise do the usual balance
9372 stripped
= get_restripe_target(fs_info
, flags
);
9374 return extended_to_chunk(stripped
);
9376 num_devices
= fs_info
->fs_devices
->rw_devices
;
9378 stripped
= BTRFS_BLOCK_GROUP_RAID0
|
9379 BTRFS_BLOCK_GROUP_RAID5
| BTRFS_BLOCK_GROUP_RAID6
|
9380 BTRFS_BLOCK_GROUP_RAID1
| BTRFS_BLOCK_GROUP_RAID10
;
9382 if (num_devices
== 1) {
9383 stripped
|= BTRFS_BLOCK_GROUP_DUP
;
9384 stripped
= flags
& ~stripped
;
9386 /* turn raid0 into single device chunks */
9387 if (flags
& BTRFS_BLOCK_GROUP_RAID0
)
9390 /* turn mirroring into duplication */
9391 if (flags
& (BTRFS_BLOCK_GROUP_RAID1
|
9392 BTRFS_BLOCK_GROUP_RAID10
))
9393 return stripped
| BTRFS_BLOCK_GROUP_DUP
;
9395 /* they already had raid on here, just return */
9396 if (flags
& stripped
)
9399 stripped
|= BTRFS_BLOCK_GROUP_DUP
;
9400 stripped
= flags
& ~stripped
;
9402 /* switch duplicated blocks with raid1 */
9403 if (flags
& BTRFS_BLOCK_GROUP_DUP
)
9404 return stripped
| BTRFS_BLOCK_GROUP_RAID1
;
9406 /* this is drive concat, leave it alone */
9412 static int inc_block_group_ro(struct btrfs_block_group_cache
*cache
, int force
)
9414 struct btrfs_space_info
*sinfo
= cache
->space_info
;
9416 u64 min_allocable_bytes
;
9420 * We need some metadata space and system metadata space for
9421 * allocating chunks in some corner cases until we force to set
9422 * it to be readonly.
9425 (BTRFS_BLOCK_GROUP_SYSTEM
| BTRFS_BLOCK_GROUP_METADATA
)) &&
9427 min_allocable_bytes
= SZ_1M
;
9429 min_allocable_bytes
= 0;
9431 spin_lock(&sinfo
->lock
);
9432 spin_lock(&cache
->lock
);
9440 num_bytes
= cache
->key
.offset
- cache
->reserved
- cache
->pinned
-
9441 cache
->bytes_super
- btrfs_block_group_used(&cache
->item
);
9443 if (btrfs_space_info_used(sinfo
, true) + num_bytes
+
9444 min_allocable_bytes
<= sinfo
->total_bytes
) {
9445 sinfo
->bytes_readonly
+= num_bytes
;
9447 list_add_tail(&cache
->ro_list
, &sinfo
->ro_bgs
);
9451 spin_unlock(&cache
->lock
);
9452 spin_unlock(&sinfo
->lock
);
9456 int btrfs_inc_block_group_ro(struct btrfs_fs_info
*fs_info
,
9457 struct btrfs_block_group_cache
*cache
)
9460 struct btrfs_trans_handle
*trans
;
9465 trans
= btrfs_join_transaction(fs_info
->extent_root
);
9467 return PTR_ERR(trans
);
9470 * we're not allowed to set block groups readonly after the dirty
9471 * block groups cache has started writing. If it already started,
9472 * back off and let this transaction commit
9474 mutex_lock(&fs_info
->ro_block_group_mutex
);
9475 if (test_bit(BTRFS_TRANS_DIRTY_BG_RUN
, &trans
->transaction
->flags
)) {
9476 u64 transid
= trans
->transid
;
9478 mutex_unlock(&fs_info
->ro_block_group_mutex
);
9479 btrfs_end_transaction(trans
);
9481 ret
= btrfs_wait_for_commit(fs_info
, transid
);
9488 * if we are changing raid levels, try to allocate a corresponding
9489 * block group with the new raid level.
9491 alloc_flags
= update_block_group_flags(fs_info
, cache
->flags
);
9492 if (alloc_flags
!= cache
->flags
) {
9493 ret
= do_chunk_alloc(trans
, fs_info
, alloc_flags
,
9496 * ENOSPC is allowed here, we may have enough space
9497 * already allocated at the new raid level to
9506 ret
= inc_block_group_ro(cache
, 0);
9509 alloc_flags
= get_alloc_profile(fs_info
, cache
->space_info
->flags
);
9510 ret
= do_chunk_alloc(trans
, fs_info
, alloc_flags
,
9514 ret
= inc_block_group_ro(cache
, 0);
9516 if (cache
->flags
& BTRFS_BLOCK_GROUP_SYSTEM
) {
9517 alloc_flags
= update_block_group_flags(fs_info
, cache
->flags
);
9518 mutex_lock(&fs_info
->chunk_mutex
);
9519 check_system_chunk(trans
, fs_info
, alloc_flags
);
9520 mutex_unlock(&fs_info
->chunk_mutex
);
9522 mutex_unlock(&fs_info
->ro_block_group_mutex
);
9524 btrfs_end_transaction(trans
);
9528 int btrfs_force_chunk_alloc(struct btrfs_trans_handle
*trans
,
9529 struct btrfs_fs_info
*fs_info
, u64 type
)
9531 u64 alloc_flags
= get_alloc_profile(fs_info
, type
);
9533 return do_chunk_alloc(trans
, fs_info
, alloc_flags
, CHUNK_ALLOC_FORCE
);
9537 * helper to account the unused space of all the readonly block group in the
9538 * space_info. takes mirrors into account.
9540 u64
btrfs_account_ro_block_groups_free_space(struct btrfs_space_info
*sinfo
)
9542 struct btrfs_block_group_cache
*block_group
;
9546 /* It's df, we don't care if it's racy */
9547 if (list_empty(&sinfo
->ro_bgs
))
9550 spin_lock(&sinfo
->lock
);
9551 list_for_each_entry(block_group
, &sinfo
->ro_bgs
, ro_list
) {
9552 spin_lock(&block_group
->lock
);
9554 if (!block_group
->ro
) {
9555 spin_unlock(&block_group
->lock
);
9559 if (block_group
->flags
& (BTRFS_BLOCK_GROUP_RAID1
|
9560 BTRFS_BLOCK_GROUP_RAID10
|
9561 BTRFS_BLOCK_GROUP_DUP
))
9566 free_bytes
+= (block_group
->key
.offset
-
9567 btrfs_block_group_used(&block_group
->item
)) *
9570 spin_unlock(&block_group
->lock
);
9572 spin_unlock(&sinfo
->lock
);
9577 void btrfs_dec_block_group_ro(struct btrfs_block_group_cache
*cache
)
9579 struct btrfs_space_info
*sinfo
= cache
->space_info
;
9584 spin_lock(&sinfo
->lock
);
9585 spin_lock(&cache
->lock
);
9587 num_bytes
= cache
->key
.offset
- cache
->reserved
-
9588 cache
->pinned
- cache
->bytes_super
-
9589 btrfs_block_group_used(&cache
->item
);
9590 sinfo
->bytes_readonly
-= num_bytes
;
9591 list_del_init(&cache
->ro_list
);
9593 spin_unlock(&cache
->lock
);
9594 spin_unlock(&sinfo
->lock
);
9598 * checks to see if its even possible to relocate this block group.
9600 * @return - -1 if it's not a good idea to relocate this block group, 0 if its
9601 * ok to go ahead and try.
9603 int btrfs_can_relocate(struct btrfs_fs_info
*fs_info
, u64 bytenr
)
9605 struct btrfs_root
*root
= fs_info
->extent_root
;
9606 struct btrfs_block_group_cache
*block_group
;
9607 struct btrfs_space_info
*space_info
;
9608 struct btrfs_fs_devices
*fs_devices
= fs_info
->fs_devices
;
9609 struct btrfs_device
*device
;
9610 struct btrfs_trans_handle
*trans
;
9620 debug
= btrfs_test_opt(fs_info
, ENOSPC_DEBUG
);
9622 block_group
= btrfs_lookup_block_group(fs_info
, bytenr
);
9624 /* odd, couldn't find the block group, leave it alone */
9628 "can't find block group for bytenr %llu",
9633 min_free
= btrfs_block_group_used(&block_group
->item
);
9635 /* no bytes used, we're good */
9639 space_info
= block_group
->space_info
;
9640 spin_lock(&space_info
->lock
);
9642 full
= space_info
->full
;
9645 * if this is the last block group we have in this space, we can't
9646 * relocate it unless we're able to allocate a new chunk below.
9648 * Otherwise, we need to make sure we have room in the space to handle
9649 * all of the extents from this block group. If we can, we're good
9651 if ((space_info
->total_bytes
!= block_group
->key
.offset
) &&
9652 (btrfs_space_info_used(space_info
, false) + min_free
<
9653 space_info
->total_bytes
)) {
9654 spin_unlock(&space_info
->lock
);
9657 spin_unlock(&space_info
->lock
);
9660 * ok we don't have enough space, but maybe we have free space on our
9661 * devices to allocate new chunks for relocation, so loop through our
9662 * alloc devices and guess if we have enough space. if this block
9663 * group is going to be restriped, run checks against the target
9664 * profile instead of the current one.
9676 target
= get_restripe_target(fs_info
, block_group
->flags
);
9678 index
= __get_raid_index(extended_to_chunk(target
));
9681 * this is just a balance, so if we were marked as full
9682 * we know there is no space for a new chunk
9687 "no space to alloc new chunk for block group %llu",
9688 block_group
->key
.objectid
);
9692 index
= get_block_group_index(block_group
);
9695 if (index
== BTRFS_RAID_RAID10
) {
9699 } else if (index
== BTRFS_RAID_RAID1
) {
9701 } else if (index
== BTRFS_RAID_DUP
) {
9704 } else if (index
== BTRFS_RAID_RAID0
) {
9705 dev_min
= fs_devices
->rw_devices
;
9706 min_free
= div64_u64(min_free
, dev_min
);
9709 /* We need to do this so that we can look at pending chunks */
9710 trans
= btrfs_join_transaction(root
);
9711 if (IS_ERR(trans
)) {
9712 ret
= PTR_ERR(trans
);
9716 mutex_lock(&fs_info
->chunk_mutex
);
9717 list_for_each_entry(device
, &fs_devices
->alloc_list
, dev_alloc_list
) {
9721 * check to make sure we can actually find a chunk with enough
9722 * space to fit our block group in.
9724 if (device
->total_bytes
> device
->bytes_used
+ min_free
&&
9725 !device
->is_tgtdev_for_dev_replace
) {
9726 ret
= find_free_dev_extent(trans
, device
, min_free
,
9731 if (dev_nr
>= dev_min
)
9737 if (debug
&& ret
== -1)
9739 "no space to allocate a new chunk for block group %llu",
9740 block_group
->key
.objectid
);
9741 mutex_unlock(&fs_info
->chunk_mutex
);
9742 btrfs_end_transaction(trans
);
9744 btrfs_put_block_group(block_group
);
9748 static int find_first_block_group(struct btrfs_fs_info
*fs_info
,
9749 struct btrfs_path
*path
,
9750 struct btrfs_key
*key
)
9752 struct btrfs_root
*root
= fs_info
->extent_root
;
9754 struct btrfs_key found_key
;
9755 struct extent_buffer
*leaf
;
9758 ret
= btrfs_search_slot(NULL
, root
, key
, path
, 0, 0);
9763 slot
= path
->slots
[0];
9764 leaf
= path
->nodes
[0];
9765 if (slot
>= btrfs_header_nritems(leaf
)) {
9766 ret
= btrfs_next_leaf(root
, path
);
9773 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
9775 if (found_key
.objectid
>= key
->objectid
&&
9776 found_key
.type
== BTRFS_BLOCK_GROUP_ITEM_KEY
) {
9777 struct extent_map_tree
*em_tree
;
9778 struct extent_map
*em
;
9780 em_tree
= &root
->fs_info
->mapping_tree
.map_tree
;
9781 read_lock(&em_tree
->lock
);
9782 em
= lookup_extent_mapping(em_tree
, found_key
.objectid
,
9784 read_unlock(&em_tree
->lock
);
9787 "logical %llu len %llu found bg but no related chunk",
9788 found_key
.objectid
, found_key
.offset
);
9793 free_extent_map(em
);
9802 void btrfs_put_block_group_cache(struct btrfs_fs_info
*info
)
9804 struct btrfs_block_group_cache
*block_group
;
9808 struct inode
*inode
;
9810 block_group
= btrfs_lookup_first_block_group(info
, last
);
9811 while (block_group
) {
9812 wait_block_group_cache_done(block_group
);
9813 spin_lock(&block_group
->lock
);
9814 if (block_group
->iref
)
9816 spin_unlock(&block_group
->lock
);
9817 block_group
= next_block_group(info
, block_group
);
9826 inode
= block_group
->inode
;
9827 block_group
->iref
= 0;
9828 block_group
->inode
= NULL
;
9829 spin_unlock(&block_group
->lock
);
9830 ASSERT(block_group
->io_ctl
.inode
== NULL
);
9832 last
= block_group
->key
.objectid
+ block_group
->key
.offset
;
9833 btrfs_put_block_group(block_group
);
9838 * Must be called only after stopping all workers, since we could have block
9839 * group caching kthreads running, and therefore they could race with us if we
9840 * freed the block groups before stopping them.
9842 int btrfs_free_block_groups(struct btrfs_fs_info
*info
)
9844 struct btrfs_block_group_cache
*block_group
;
9845 struct btrfs_space_info
*space_info
;
9846 struct btrfs_caching_control
*caching_ctl
;
9849 down_write(&info
->commit_root_sem
);
9850 while (!list_empty(&info
->caching_block_groups
)) {
9851 caching_ctl
= list_entry(info
->caching_block_groups
.next
,
9852 struct btrfs_caching_control
, list
);
9853 list_del(&caching_ctl
->list
);
9854 put_caching_control(caching_ctl
);
9856 up_write(&info
->commit_root_sem
);
9858 spin_lock(&info
->unused_bgs_lock
);
9859 while (!list_empty(&info
->unused_bgs
)) {
9860 block_group
= list_first_entry(&info
->unused_bgs
,
9861 struct btrfs_block_group_cache
,
9863 list_del_init(&block_group
->bg_list
);
9864 btrfs_put_block_group(block_group
);
9866 spin_unlock(&info
->unused_bgs_lock
);
9868 spin_lock(&info
->block_group_cache_lock
);
9869 while ((n
= rb_last(&info
->block_group_cache_tree
)) != NULL
) {
9870 block_group
= rb_entry(n
, struct btrfs_block_group_cache
,
9872 rb_erase(&block_group
->cache_node
,
9873 &info
->block_group_cache_tree
);
9874 RB_CLEAR_NODE(&block_group
->cache_node
);
9875 spin_unlock(&info
->block_group_cache_lock
);
9877 down_write(&block_group
->space_info
->groups_sem
);
9878 list_del(&block_group
->list
);
9879 up_write(&block_group
->space_info
->groups_sem
);
9882 * We haven't cached this block group, which means we could
9883 * possibly have excluded extents on this block group.
9885 if (block_group
->cached
== BTRFS_CACHE_NO
||
9886 block_group
->cached
== BTRFS_CACHE_ERROR
)
9887 free_excluded_extents(info
, block_group
);
9889 btrfs_remove_free_space_cache(block_group
);
9890 ASSERT(block_group
->cached
!= BTRFS_CACHE_STARTED
);
9891 ASSERT(list_empty(&block_group
->dirty_list
));
9892 ASSERT(list_empty(&block_group
->io_list
));
9893 ASSERT(list_empty(&block_group
->bg_list
));
9894 ASSERT(atomic_read(&block_group
->count
) == 1);
9895 btrfs_put_block_group(block_group
);
9897 spin_lock(&info
->block_group_cache_lock
);
9899 spin_unlock(&info
->block_group_cache_lock
);
9901 /* now that all the block groups are freed, go through and
9902 * free all the space_info structs. This is only called during
9903 * the final stages of unmount, and so we know nobody is
9904 * using them. We call synchronize_rcu() once before we start,
9905 * just to be on the safe side.
9909 release_global_block_rsv(info
);
9911 while (!list_empty(&info
->space_info
)) {
9914 space_info
= list_entry(info
->space_info
.next
,
9915 struct btrfs_space_info
,
9919 * Do not hide this behind enospc_debug, this is actually
9920 * important and indicates a real bug if this happens.
9922 if (WARN_ON(space_info
->bytes_pinned
> 0 ||
9923 space_info
->bytes_reserved
> 0 ||
9924 space_info
->bytes_may_use
> 0))
9925 dump_space_info(info
, space_info
, 0, 0);
9926 list_del(&space_info
->list
);
9927 for (i
= 0; i
< BTRFS_NR_RAID_TYPES
; i
++) {
9928 struct kobject
*kobj
;
9929 kobj
= space_info
->block_group_kobjs
[i
];
9930 space_info
->block_group_kobjs
[i
] = NULL
;
9936 kobject_del(&space_info
->kobj
);
9937 kobject_put(&space_info
->kobj
);
9942 static void link_block_group(struct btrfs_block_group_cache
*cache
)
9944 struct btrfs_space_info
*space_info
= cache
->space_info
;
9945 int index
= get_block_group_index(cache
);
9948 down_write(&space_info
->groups_sem
);
9949 if (list_empty(&space_info
->block_groups
[index
]))
9951 list_add_tail(&cache
->list
, &space_info
->block_groups
[index
]);
9952 up_write(&space_info
->groups_sem
);
9955 struct raid_kobject
*rkobj
;
9958 rkobj
= kzalloc(sizeof(*rkobj
), GFP_NOFS
);
9961 rkobj
->raid_type
= index
;
9962 kobject_init(&rkobj
->kobj
, &btrfs_raid_ktype
);
9963 ret
= kobject_add(&rkobj
->kobj
, &space_info
->kobj
,
9964 "%s", get_raid_name(index
));
9966 kobject_put(&rkobj
->kobj
);
9969 space_info
->block_group_kobjs
[index
] = &rkobj
->kobj
;
9974 btrfs_warn(cache
->fs_info
,
9975 "failed to add kobject for block cache, ignoring");
9978 static struct btrfs_block_group_cache
*
9979 btrfs_create_block_group_cache(struct btrfs_fs_info
*fs_info
,
9980 u64 start
, u64 size
)
9982 struct btrfs_block_group_cache
*cache
;
9984 cache
= kzalloc(sizeof(*cache
), GFP_NOFS
);
9988 cache
->free_space_ctl
= kzalloc(sizeof(*cache
->free_space_ctl
),
9990 if (!cache
->free_space_ctl
) {
9995 cache
->key
.objectid
= start
;
9996 cache
->key
.offset
= size
;
9997 cache
->key
.type
= BTRFS_BLOCK_GROUP_ITEM_KEY
;
9999 cache
->fs_info
= fs_info
;
10000 cache
->full_stripe_len
= btrfs_full_stripe_len(fs_info
, start
);
10001 set_free_space_tree_thresholds(cache
);
10003 atomic_set(&cache
->count
, 1);
10004 spin_lock_init(&cache
->lock
);
10005 init_rwsem(&cache
->data_rwsem
);
10006 INIT_LIST_HEAD(&cache
->list
);
10007 INIT_LIST_HEAD(&cache
->cluster_list
);
10008 INIT_LIST_HEAD(&cache
->bg_list
);
10009 INIT_LIST_HEAD(&cache
->ro_list
);
10010 INIT_LIST_HEAD(&cache
->dirty_list
);
10011 INIT_LIST_HEAD(&cache
->io_list
);
10012 btrfs_init_free_space_ctl(cache
);
10013 atomic_set(&cache
->trimming
, 0);
10014 mutex_init(&cache
->free_space_lock
);
10015 btrfs_init_full_stripe_locks_tree(&cache
->full_stripe_locks_root
);
10022 * Iterate all chunks and verify that each of them has the corresponding block
10025 static int check_chunk_block_group_mappings(struct btrfs_fs_info
*fs_info
)
10027 struct btrfs_mapping_tree
*map_tree
= &fs_info
->mapping_tree
;
10028 struct extent_map
*em
;
10029 struct btrfs_block_group_cache
*bg
;
10034 read_lock(&map_tree
->map_tree
.lock
);
10036 * lookup_extent_mapping will return the first extent map
10037 * intersecting the range, so setting @len to 1 is enough to
10038 * get the first chunk.
10040 em
= lookup_extent_mapping(&map_tree
->map_tree
, start
, 1);
10041 read_unlock(&map_tree
->map_tree
.lock
);
10045 bg
= btrfs_lookup_block_group(fs_info
, em
->start
);
10048 "chunk start=%llu len=%llu doesn't have corresponding block group",
10049 em
->start
, em
->len
);
10051 free_extent_map(em
);
10054 if (bg
->key
.objectid
!= em
->start
||
10055 bg
->key
.offset
!= em
->len
||
10056 (bg
->flags
& BTRFS_BLOCK_GROUP_TYPE_MASK
) !=
10057 (em
->map_lookup
->type
& BTRFS_BLOCK_GROUP_TYPE_MASK
)) {
10059 "chunk start=%llu len=%llu flags=0x%llx doesn't match block group start=%llu len=%llu flags=0x%llx",
10060 em
->start
, em
->len
,
10061 em
->map_lookup
->type
& BTRFS_BLOCK_GROUP_TYPE_MASK
,
10062 bg
->key
.objectid
, bg
->key
.offset
,
10063 bg
->flags
& BTRFS_BLOCK_GROUP_TYPE_MASK
);
10065 free_extent_map(em
);
10066 btrfs_put_block_group(bg
);
10069 start
= em
->start
+ em
->len
;
10070 free_extent_map(em
);
10071 btrfs_put_block_group(bg
);
10076 int btrfs_read_block_groups(struct btrfs_fs_info
*info
)
10078 struct btrfs_path
*path
;
10080 struct btrfs_block_group_cache
*cache
;
10081 struct btrfs_space_info
*space_info
;
10082 struct btrfs_key key
;
10083 struct btrfs_key found_key
;
10084 struct extent_buffer
*leaf
;
10085 int need_clear
= 0;
10090 feature
= btrfs_super_incompat_flags(info
->super_copy
);
10091 mixed
= !!(feature
& BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS
);
10095 key
.type
= BTRFS_BLOCK_GROUP_ITEM_KEY
;
10096 path
= btrfs_alloc_path();
10099 path
->reada
= READA_FORWARD
;
10101 cache_gen
= btrfs_super_cache_generation(info
->super_copy
);
10102 if (btrfs_test_opt(info
, SPACE_CACHE
) &&
10103 btrfs_super_generation(info
->super_copy
) != cache_gen
)
10105 if (btrfs_test_opt(info
, CLEAR_CACHE
))
10109 ret
= find_first_block_group(info
, path
, &key
);
10115 leaf
= path
->nodes
[0];
10116 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
10118 cache
= btrfs_create_block_group_cache(info
, found_key
.objectid
,
10127 * When we mount with old space cache, we need to
10128 * set BTRFS_DC_CLEAR and set dirty flag.
10130 * a) Setting 'BTRFS_DC_CLEAR' makes sure that we
10131 * truncate the old free space cache inode and
10133 * b) Setting 'dirty flag' makes sure that we flush
10134 * the new space cache info onto disk.
10136 if (btrfs_test_opt(info
, SPACE_CACHE
))
10137 cache
->disk_cache_state
= BTRFS_DC_CLEAR
;
10140 read_extent_buffer(leaf
, &cache
->item
,
10141 btrfs_item_ptr_offset(leaf
, path
->slots
[0]),
10142 sizeof(cache
->item
));
10143 cache
->flags
= btrfs_block_group_flags(&cache
->item
);
10145 ((cache
->flags
& BTRFS_BLOCK_GROUP_METADATA
) &&
10146 (cache
->flags
& BTRFS_BLOCK_GROUP_DATA
))) {
10148 "bg %llu is a mixed block group but filesystem hasn't enabled mixed block groups",
10149 cache
->key
.objectid
);
10154 key
.objectid
= found_key
.objectid
+ found_key
.offset
;
10155 btrfs_release_path(path
);
10158 * We need to exclude the super stripes now so that the space
10159 * info has super bytes accounted for, otherwise we'll think
10160 * we have more space than we actually do.
10162 ret
= exclude_super_stripes(info
, cache
);
10165 * We may have excluded something, so call this just in
10168 free_excluded_extents(info
, cache
);
10169 btrfs_put_block_group(cache
);
10174 * check for two cases, either we are full, and therefore
10175 * don't need to bother with the caching work since we won't
10176 * find any space, or we are empty, and we can just add all
10177 * the space in and be done with it. This saves us _alot_ of
10178 * time, particularly in the full case.
10180 if (found_key
.offset
== btrfs_block_group_used(&cache
->item
)) {
10181 cache
->last_byte_to_unpin
= (u64
)-1;
10182 cache
->cached
= BTRFS_CACHE_FINISHED
;
10183 free_excluded_extents(info
, cache
);
10184 } else if (btrfs_block_group_used(&cache
->item
) == 0) {
10185 cache
->last_byte_to_unpin
= (u64
)-1;
10186 cache
->cached
= BTRFS_CACHE_FINISHED
;
10187 add_new_free_space(cache
, info
,
10188 found_key
.objectid
,
10189 found_key
.objectid
+
10191 free_excluded_extents(info
, cache
);
10194 ret
= btrfs_add_block_group_cache(info
, cache
);
10196 btrfs_remove_free_space_cache(cache
);
10197 btrfs_put_block_group(cache
);
10201 trace_btrfs_add_block_group(info
, cache
, 0);
10202 update_space_info(info
, cache
->flags
, found_key
.offset
,
10203 btrfs_block_group_used(&cache
->item
),
10204 cache
->bytes_super
, &space_info
);
10206 cache
->space_info
= space_info
;
10208 link_block_group(cache
);
10210 set_avail_alloc_bits(info
, cache
->flags
);
10211 if (btrfs_chunk_readonly(info
, cache
->key
.objectid
)) {
10212 inc_block_group_ro(cache
, 1);
10213 } else if (btrfs_block_group_used(&cache
->item
) == 0) {
10214 spin_lock(&info
->unused_bgs_lock
);
10215 /* Should always be true but just in case. */
10216 if (list_empty(&cache
->bg_list
)) {
10217 btrfs_get_block_group(cache
);
10218 list_add_tail(&cache
->bg_list
,
10219 &info
->unused_bgs
);
10221 spin_unlock(&info
->unused_bgs_lock
);
10225 list_for_each_entry_rcu(space_info
, &info
->space_info
, list
) {
10226 if (!(get_alloc_profile(info
, space_info
->flags
) &
10227 (BTRFS_BLOCK_GROUP_RAID10
|
10228 BTRFS_BLOCK_GROUP_RAID1
|
10229 BTRFS_BLOCK_GROUP_RAID5
|
10230 BTRFS_BLOCK_GROUP_RAID6
|
10231 BTRFS_BLOCK_GROUP_DUP
)))
10234 * avoid allocating from un-mirrored block group if there are
10235 * mirrored block groups.
10237 list_for_each_entry(cache
,
10238 &space_info
->block_groups
[BTRFS_RAID_RAID0
],
10240 inc_block_group_ro(cache
, 1);
10241 list_for_each_entry(cache
,
10242 &space_info
->block_groups
[BTRFS_RAID_SINGLE
],
10244 inc_block_group_ro(cache
, 1);
10247 init_global_block_rsv(info
);
10248 ret
= check_chunk_block_group_mappings(info
);
10250 btrfs_free_path(path
);
10254 void btrfs_create_pending_block_groups(struct btrfs_trans_handle
*trans
,
10255 struct btrfs_fs_info
*fs_info
)
10257 struct btrfs_block_group_cache
*block_group
;
10258 struct btrfs_root
*extent_root
= fs_info
->extent_root
;
10259 struct btrfs_block_group_item item
;
10260 struct btrfs_key key
;
10263 if (!trans
->can_flush_pending_bgs
)
10266 while (!list_empty(&trans
->new_bgs
)) {
10267 block_group
= list_first_entry(&trans
->new_bgs
,
10268 struct btrfs_block_group_cache
,
10273 spin_lock(&block_group
->lock
);
10274 memcpy(&item
, &block_group
->item
, sizeof(item
));
10275 memcpy(&key
, &block_group
->key
, sizeof(key
));
10276 spin_unlock(&block_group
->lock
);
10278 ret
= btrfs_insert_item(trans
, extent_root
, &key
, &item
,
10281 btrfs_abort_transaction(trans
, ret
);
10282 ret
= btrfs_finish_chunk_alloc(trans
, fs_info
, key
.objectid
,
10285 btrfs_abort_transaction(trans
, ret
);
10286 add_block_group_free_space(trans
, fs_info
, block_group
);
10287 /* already aborted the transaction if it failed. */
10289 list_del_init(&block_group
->bg_list
);
10291 btrfs_trans_release_chunk_metadata(trans
);
10294 int btrfs_make_block_group(struct btrfs_trans_handle
*trans
,
10295 struct btrfs_fs_info
*fs_info
, u64 bytes_used
,
10296 u64 type
, u64 chunk_offset
, u64 size
)
10298 struct btrfs_block_group_cache
*cache
;
10301 btrfs_set_log_full_commit(fs_info
, trans
);
10303 cache
= btrfs_create_block_group_cache(fs_info
, chunk_offset
, size
);
10307 btrfs_set_block_group_used(&cache
->item
, bytes_used
);
10308 btrfs_set_block_group_chunk_objectid(&cache
->item
,
10309 BTRFS_FIRST_CHUNK_TREE_OBJECTID
);
10310 btrfs_set_block_group_flags(&cache
->item
, type
);
10312 cache
->flags
= type
;
10313 cache
->last_byte_to_unpin
= (u64
)-1;
10314 cache
->cached
= BTRFS_CACHE_FINISHED
;
10315 cache
->needs_free_space
= 1;
10316 ret
= exclude_super_stripes(fs_info
, cache
);
10319 * We may have excluded something, so call this just in
10322 free_excluded_extents(fs_info
, cache
);
10323 btrfs_put_block_group(cache
);
10327 add_new_free_space(cache
, fs_info
, chunk_offset
, chunk_offset
+ size
);
10329 free_excluded_extents(fs_info
, cache
);
10331 #ifdef CONFIG_BTRFS_DEBUG
10332 if (btrfs_should_fragment_free_space(cache
)) {
10333 u64 new_bytes_used
= size
- bytes_used
;
10335 bytes_used
+= new_bytes_used
>> 1;
10336 fragment_free_space(cache
);
10340 * Ensure the corresponding space_info object is created and
10341 * assigned to our block group. We want our bg to be added to the rbtree
10342 * with its ->space_info set.
10344 cache
->space_info
= __find_space_info(fs_info
, cache
->flags
);
10345 if (!cache
->space_info
) {
10346 ret
= create_space_info(fs_info
, cache
->flags
,
10347 &cache
->space_info
);
10349 btrfs_remove_free_space_cache(cache
);
10350 btrfs_put_block_group(cache
);
10355 ret
= btrfs_add_block_group_cache(fs_info
, cache
);
10357 btrfs_remove_free_space_cache(cache
);
10358 btrfs_put_block_group(cache
);
10363 * Now that our block group has its ->space_info set and is inserted in
10364 * the rbtree, update the space info's counters.
10366 trace_btrfs_add_block_group(fs_info
, cache
, 1);
10367 update_space_info(fs_info
, cache
->flags
, size
, bytes_used
,
10368 cache
->bytes_super
, &cache
->space_info
);
10369 update_global_block_rsv(fs_info
);
10371 link_block_group(cache
);
10373 list_add_tail(&cache
->bg_list
, &trans
->new_bgs
);
10375 set_avail_alloc_bits(fs_info
, type
);
10379 static void clear_avail_alloc_bits(struct btrfs_fs_info
*fs_info
, u64 flags
)
10381 u64 extra_flags
= chunk_to_extended(flags
) &
10382 BTRFS_EXTENDED_PROFILE_MASK
;
10384 write_seqlock(&fs_info
->profiles_lock
);
10385 if (flags
& BTRFS_BLOCK_GROUP_DATA
)
10386 fs_info
->avail_data_alloc_bits
&= ~extra_flags
;
10387 if (flags
& BTRFS_BLOCK_GROUP_METADATA
)
10388 fs_info
->avail_metadata_alloc_bits
&= ~extra_flags
;
10389 if (flags
& BTRFS_BLOCK_GROUP_SYSTEM
)
10390 fs_info
->avail_system_alloc_bits
&= ~extra_flags
;
10391 write_sequnlock(&fs_info
->profiles_lock
);
10394 int btrfs_remove_block_group(struct btrfs_trans_handle
*trans
,
10395 struct btrfs_fs_info
*fs_info
, u64 group_start
,
10396 struct extent_map
*em
)
10398 struct btrfs_root
*root
= fs_info
->extent_root
;
10399 struct btrfs_path
*path
;
10400 struct btrfs_block_group_cache
*block_group
;
10401 struct btrfs_free_cluster
*cluster
;
10402 struct btrfs_root
*tree_root
= fs_info
->tree_root
;
10403 struct btrfs_key key
;
10404 struct inode
*inode
;
10405 struct kobject
*kobj
= NULL
;
10409 struct btrfs_caching_control
*caching_ctl
= NULL
;
10412 block_group
= btrfs_lookup_block_group(fs_info
, group_start
);
10413 BUG_ON(!block_group
);
10414 BUG_ON(!block_group
->ro
);
10417 * Free the reserved super bytes from this block group before
10420 free_excluded_extents(fs_info
, block_group
);
10421 btrfs_free_ref_tree_range(fs_info
, block_group
->key
.objectid
,
10422 block_group
->key
.offset
);
10424 memcpy(&key
, &block_group
->key
, sizeof(key
));
10425 index
= get_block_group_index(block_group
);
10426 if (block_group
->flags
& (BTRFS_BLOCK_GROUP_DUP
|
10427 BTRFS_BLOCK_GROUP_RAID1
|
10428 BTRFS_BLOCK_GROUP_RAID10
))
10433 /* make sure this block group isn't part of an allocation cluster */
10434 cluster
= &fs_info
->data_alloc_cluster
;
10435 spin_lock(&cluster
->refill_lock
);
10436 btrfs_return_cluster_to_free_space(block_group
, cluster
);
10437 spin_unlock(&cluster
->refill_lock
);
10440 * make sure this block group isn't part of a metadata
10441 * allocation cluster
10443 cluster
= &fs_info
->meta_alloc_cluster
;
10444 spin_lock(&cluster
->refill_lock
);
10445 btrfs_return_cluster_to_free_space(block_group
, cluster
);
10446 spin_unlock(&cluster
->refill_lock
);
10448 path
= btrfs_alloc_path();
10455 * get the inode first so any iput calls done for the io_list
10456 * aren't the final iput (no unlinks allowed now)
10458 inode
= lookup_free_space_inode(fs_info
, block_group
, path
);
10460 mutex_lock(&trans
->transaction
->cache_write_mutex
);
10462 * make sure our free spache cache IO is done before remove the
10465 spin_lock(&trans
->transaction
->dirty_bgs_lock
);
10466 if (!list_empty(&block_group
->io_list
)) {
10467 list_del_init(&block_group
->io_list
);
10469 WARN_ON(!IS_ERR(inode
) && inode
!= block_group
->io_ctl
.inode
);
10471 spin_unlock(&trans
->transaction
->dirty_bgs_lock
);
10472 btrfs_wait_cache_io(trans
, block_group
, path
);
10473 btrfs_put_block_group(block_group
);
10474 spin_lock(&trans
->transaction
->dirty_bgs_lock
);
10477 if (!list_empty(&block_group
->dirty_list
)) {
10478 list_del_init(&block_group
->dirty_list
);
10479 btrfs_put_block_group(block_group
);
10481 spin_unlock(&trans
->transaction
->dirty_bgs_lock
);
10482 mutex_unlock(&trans
->transaction
->cache_write_mutex
);
10484 if (!IS_ERR(inode
)) {
10485 ret
= btrfs_orphan_add(trans
, BTRFS_I(inode
));
10487 btrfs_add_delayed_iput(inode
);
10490 clear_nlink(inode
);
10491 /* One for the block groups ref */
10492 spin_lock(&block_group
->lock
);
10493 if (block_group
->iref
) {
10494 block_group
->iref
= 0;
10495 block_group
->inode
= NULL
;
10496 spin_unlock(&block_group
->lock
);
10499 spin_unlock(&block_group
->lock
);
10501 /* One for our lookup ref */
10502 btrfs_add_delayed_iput(inode
);
10505 key
.objectid
= BTRFS_FREE_SPACE_OBJECTID
;
10506 key
.offset
= block_group
->key
.objectid
;
10509 ret
= btrfs_search_slot(trans
, tree_root
, &key
, path
, -1, 1);
10513 btrfs_release_path(path
);
10515 ret
= btrfs_del_item(trans
, tree_root
, path
);
10518 btrfs_release_path(path
);
10521 spin_lock(&fs_info
->block_group_cache_lock
);
10522 rb_erase(&block_group
->cache_node
,
10523 &fs_info
->block_group_cache_tree
);
10524 RB_CLEAR_NODE(&block_group
->cache_node
);
10526 if (fs_info
->first_logical_byte
== block_group
->key
.objectid
)
10527 fs_info
->first_logical_byte
= (u64
)-1;
10528 spin_unlock(&fs_info
->block_group_cache_lock
);
10530 down_write(&block_group
->space_info
->groups_sem
);
10532 * we must use list_del_init so people can check to see if they
10533 * are still on the list after taking the semaphore
10535 list_del_init(&block_group
->list
);
10536 if (list_empty(&block_group
->space_info
->block_groups
[index
])) {
10537 kobj
= block_group
->space_info
->block_group_kobjs
[index
];
10538 block_group
->space_info
->block_group_kobjs
[index
] = NULL
;
10539 clear_avail_alloc_bits(fs_info
, block_group
->flags
);
10541 up_write(&block_group
->space_info
->groups_sem
);
10547 if (block_group
->has_caching_ctl
)
10548 caching_ctl
= get_caching_control(block_group
);
10549 if (block_group
->cached
== BTRFS_CACHE_STARTED
)
10550 wait_block_group_cache_done(block_group
);
10551 if (block_group
->has_caching_ctl
) {
10552 down_write(&fs_info
->commit_root_sem
);
10553 if (!caching_ctl
) {
10554 struct btrfs_caching_control
*ctl
;
10556 list_for_each_entry(ctl
,
10557 &fs_info
->caching_block_groups
, list
)
10558 if (ctl
->block_group
== block_group
) {
10560 refcount_inc(&caching_ctl
->count
);
10565 list_del_init(&caching_ctl
->list
);
10566 up_write(&fs_info
->commit_root_sem
);
10568 /* Once for the caching bgs list and once for us. */
10569 put_caching_control(caching_ctl
);
10570 put_caching_control(caching_ctl
);
10574 spin_lock(&trans
->transaction
->dirty_bgs_lock
);
10575 if (!list_empty(&block_group
->dirty_list
)) {
10578 if (!list_empty(&block_group
->io_list
)) {
10581 spin_unlock(&trans
->transaction
->dirty_bgs_lock
);
10582 btrfs_remove_free_space_cache(block_group
);
10584 spin_lock(&block_group
->space_info
->lock
);
10585 list_del_init(&block_group
->ro_list
);
10587 if (btrfs_test_opt(fs_info
, ENOSPC_DEBUG
)) {
10588 WARN_ON(block_group
->space_info
->total_bytes
10589 < block_group
->key
.offset
);
10590 WARN_ON(block_group
->space_info
->bytes_readonly
10591 < block_group
->key
.offset
);
10592 WARN_ON(block_group
->space_info
->disk_total
10593 < block_group
->key
.offset
* factor
);
10595 block_group
->space_info
->total_bytes
-= block_group
->key
.offset
;
10596 block_group
->space_info
->bytes_readonly
-= block_group
->key
.offset
;
10597 block_group
->space_info
->disk_total
-= block_group
->key
.offset
* factor
;
10599 spin_unlock(&block_group
->space_info
->lock
);
10601 memcpy(&key
, &block_group
->key
, sizeof(key
));
10603 mutex_lock(&fs_info
->chunk_mutex
);
10604 if (!list_empty(&em
->list
)) {
10605 /* We're in the transaction->pending_chunks list. */
10606 free_extent_map(em
);
10608 spin_lock(&block_group
->lock
);
10609 block_group
->removed
= 1;
10611 * At this point trimming can't start on this block group, because we
10612 * removed the block group from the tree fs_info->block_group_cache_tree
10613 * so no one can't find it anymore and even if someone already got this
10614 * block group before we removed it from the rbtree, they have already
10615 * incremented block_group->trimming - if they didn't, they won't find
10616 * any free space entries because we already removed them all when we
10617 * called btrfs_remove_free_space_cache().
10619 * And we must not remove the extent map from the fs_info->mapping_tree
10620 * to prevent the same logical address range and physical device space
10621 * ranges from being reused for a new block group. This is because our
10622 * fs trim operation (btrfs_trim_fs() / btrfs_ioctl_fitrim()) is
10623 * completely transactionless, so while it is trimming a range the
10624 * currently running transaction might finish and a new one start,
10625 * allowing for new block groups to be created that can reuse the same
10626 * physical device locations unless we take this special care.
10628 * There may also be an implicit trim operation if the file system
10629 * is mounted with -odiscard. The same protections must remain
10630 * in place until the extents have been discarded completely when
10631 * the transaction commit has completed.
10633 remove_em
= (atomic_read(&block_group
->trimming
) == 0);
10635 * Make sure a trimmer task always sees the em in the pinned_chunks list
10636 * if it sees block_group->removed == 1 (needs to lock block_group->lock
10637 * before checking block_group->removed).
10641 * Our em might be in trans->transaction->pending_chunks which
10642 * is protected by fs_info->chunk_mutex ([lock|unlock]_chunks),
10643 * and so is the fs_info->pinned_chunks list.
10645 * So at this point we must be holding the chunk_mutex to avoid
10646 * any races with chunk allocation (more specifically at
10647 * volumes.c:contains_pending_extent()), to ensure it always
10648 * sees the em, either in the pending_chunks list or in the
10649 * pinned_chunks list.
10651 list_move_tail(&em
->list
, &fs_info
->pinned_chunks
);
10653 spin_unlock(&block_group
->lock
);
10656 struct extent_map_tree
*em_tree
;
10658 em_tree
= &fs_info
->mapping_tree
.map_tree
;
10659 write_lock(&em_tree
->lock
);
10661 * The em might be in the pending_chunks list, so make sure the
10662 * chunk mutex is locked, since remove_extent_mapping() will
10663 * delete us from that list.
10665 remove_extent_mapping(em_tree
, em
);
10666 write_unlock(&em_tree
->lock
);
10667 /* once for the tree */
10668 free_extent_map(em
);
10671 mutex_unlock(&fs_info
->chunk_mutex
);
10673 ret
= remove_block_group_free_space(trans
, fs_info
, block_group
);
10677 btrfs_put_block_group(block_group
);
10678 btrfs_put_block_group(block_group
);
10680 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
10686 ret
= btrfs_del_item(trans
, root
, path
);
10688 btrfs_free_path(path
);
10692 struct btrfs_trans_handle
*
10693 btrfs_start_trans_remove_block_group(struct btrfs_fs_info
*fs_info
,
10694 const u64 chunk_offset
)
10696 struct extent_map_tree
*em_tree
= &fs_info
->mapping_tree
.map_tree
;
10697 struct extent_map
*em
;
10698 struct map_lookup
*map
;
10699 unsigned int num_items
;
10701 read_lock(&em_tree
->lock
);
10702 em
= lookup_extent_mapping(em_tree
, chunk_offset
, 1);
10703 read_unlock(&em_tree
->lock
);
10704 ASSERT(em
&& em
->start
== chunk_offset
);
10707 * We need to reserve 3 + N units from the metadata space info in order
10708 * to remove a block group (done at btrfs_remove_chunk() and at
10709 * btrfs_remove_block_group()), which are used for:
10711 * 1 unit for adding the free space inode's orphan (located in the tree
10713 * 1 unit for deleting the block group item (located in the extent
10715 * 1 unit for deleting the free space item (located in tree of tree
10717 * N units for deleting N device extent items corresponding to each
10718 * stripe (located in the device tree).
10720 * In order to remove a block group we also need to reserve units in the
10721 * system space info in order to update the chunk tree (update one or
10722 * more device items and remove one chunk item), but this is done at
10723 * btrfs_remove_chunk() through a call to check_system_chunk().
10725 map
= em
->map_lookup
;
10726 num_items
= 3 + map
->num_stripes
;
10727 free_extent_map(em
);
10729 return btrfs_start_transaction_fallback_global_rsv(fs_info
->extent_root
,
10734 * Process the unused_bgs list and remove any that don't have any allocated
10735 * space inside of them.
10737 void btrfs_delete_unused_bgs(struct btrfs_fs_info
*fs_info
)
10739 struct btrfs_block_group_cache
*block_group
;
10740 struct btrfs_space_info
*space_info
;
10741 struct btrfs_trans_handle
*trans
;
10744 if (!test_bit(BTRFS_FS_OPEN
, &fs_info
->flags
))
10747 spin_lock(&fs_info
->unused_bgs_lock
);
10748 while (!list_empty(&fs_info
->unused_bgs
)) {
10752 block_group
= list_first_entry(&fs_info
->unused_bgs
,
10753 struct btrfs_block_group_cache
,
10755 list_del_init(&block_group
->bg_list
);
10757 space_info
= block_group
->space_info
;
10759 if (ret
|| btrfs_mixed_space_info(space_info
)) {
10760 btrfs_put_block_group(block_group
);
10763 spin_unlock(&fs_info
->unused_bgs_lock
);
10765 mutex_lock(&fs_info
->delete_unused_bgs_mutex
);
10767 /* Don't want to race with allocators so take the groups_sem */
10768 down_write(&space_info
->groups_sem
);
10769 spin_lock(&block_group
->lock
);
10770 if (block_group
->reserved
|| block_group
->pinned
||
10771 btrfs_block_group_used(&block_group
->item
) ||
10773 list_is_singular(&block_group
->list
)) {
10775 * We want to bail if we made new allocations or have
10776 * outstanding allocations in this block group. We do
10777 * the ro check in case balance is currently acting on
10778 * this block group.
10780 spin_unlock(&block_group
->lock
);
10781 up_write(&space_info
->groups_sem
);
10784 spin_unlock(&block_group
->lock
);
10786 /* We don't want to force the issue, only flip if it's ok. */
10787 ret
= inc_block_group_ro(block_group
, 0);
10788 up_write(&space_info
->groups_sem
);
10795 * Want to do this before we do anything else so we can recover
10796 * properly if we fail to join the transaction.
10798 trans
= btrfs_start_trans_remove_block_group(fs_info
,
10799 block_group
->key
.objectid
);
10800 if (IS_ERR(trans
)) {
10801 btrfs_dec_block_group_ro(block_group
);
10802 ret
= PTR_ERR(trans
);
10807 * We could have pending pinned extents for this block group,
10808 * just delete them, we don't care about them anymore.
10810 start
= block_group
->key
.objectid
;
10811 end
= start
+ block_group
->key
.offset
- 1;
10813 * Hold the unused_bg_unpin_mutex lock to avoid racing with
10814 * btrfs_finish_extent_commit(). If we are at transaction N,
10815 * another task might be running finish_extent_commit() for the
10816 * previous transaction N - 1, and have seen a range belonging
10817 * to the block group in freed_extents[] before we were able to
10818 * clear the whole block group range from freed_extents[]. This
10819 * means that task can lookup for the block group after we
10820 * unpinned it from freed_extents[] and removed it, leading to
10821 * a BUG_ON() at btrfs_unpin_extent_range().
10823 mutex_lock(&fs_info
->unused_bg_unpin_mutex
);
10824 ret
= clear_extent_bits(&fs_info
->freed_extents
[0], start
, end
,
10827 mutex_unlock(&fs_info
->unused_bg_unpin_mutex
);
10828 btrfs_dec_block_group_ro(block_group
);
10831 ret
= clear_extent_bits(&fs_info
->freed_extents
[1], start
, end
,
10834 mutex_unlock(&fs_info
->unused_bg_unpin_mutex
);
10835 btrfs_dec_block_group_ro(block_group
);
10838 mutex_unlock(&fs_info
->unused_bg_unpin_mutex
);
10840 /* Reset pinned so btrfs_put_block_group doesn't complain */
10841 spin_lock(&space_info
->lock
);
10842 spin_lock(&block_group
->lock
);
10844 space_info
->bytes_pinned
-= block_group
->pinned
;
10845 space_info
->bytes_readonly
+= block_group
->pinned
;
10846 percpu_counter_add(&space_info
->total_bytes_pinned
,
10847 -block_group
->pinned
);
10848 block_group
->pinned
= 0;
10850 spin_unlock(&block_group
->lock
);
10851 spin_unlock(&space_info
->lock
);
10853 /* DISCARD can flip during remount */
10854 trimming
= btrfs_test_opt(fs_info
, DISCARD
);
10856 /* Implicit trim during transaction commit. */
10858 btrfs_get_block_group_trimming(block_group
);
10861 * Btrfs_remove_chunk will abort the transaction if things go
10864 ret
= btrfs_remove_chunk(trans
, fs_info
,
10865 block_group
->key
.objectid
);
10869 btrfs_put_block_group_trimming(block_group
);
10874 * If we're not mounted with -odiscard, we can just forget
10875 * about this block group. Otherwise we'll need to wait
10876 * until transaction commit to do the actual discard.
10879 spin_lock(&fs_info
->unused_bgs_lock
);
10881 * A concurrent scrub might have added us to the list
10882 * fs_info->unused_bgs, so use a list_move operation
10883 * to add the block group to the deleted_bgs list.
10885 list_move(&block_group
->bg_list
,
10886 &trans
->transaction
->deleted_bgs
);
10887 spin_unlock(&fs_info
->unused_bgs_lock
);
10888 btrfs_get_block_group(block_group
);
10891 btrfs_end_transaction(trans
);
10893 mutex_unlock(&fs_info
->delete_unused_bgs_mutex
);
10894 btrfs_put_block_group(block_group
);
10895 spin_lock(&fs_info
->unused_bgs_lock
);
10897 spin_unlock(&fs_info
->unused_bgs_lock
);
10900 int btrfs_init_space_info(struct btrfs_fs_info
*fs_info
)
10902 struct btrfs_space_info
*space_info
;
10903 struct btrfs_super_block
*disk_super
;
10909 disk_super
= fs_info
->super_copy
;
10910 if (!btrfs_super_root(disk_super
))
10913 features
= btrfs_super_incompat_flags(disk_super
);
10914 if (features
& BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS
)
10917 flags
= BTRFS_BLOCK_GROUP_SYSTEM
;
10918 ret
= create_space_info(fs_info
, flags
, &space_info
);
10923 flags
= BTRFS_BLOCK_GROUP_METADATA
| BTRFS_BLOCK_GROUP_DATA
;
10924 ret
= create_space_info(fs_info
, flags
, &space_info
);
10926 flags
= BTRFS_BLOCK_GROUP_METADATA
;
10927 ret
= create_space_info(fs_info
, flags
, &space_info
);
10931 flags
= BTRFS_BLOCK_GROUP_DATA
;
10932 ret
= create_space_info(fs_info
, flags
, &space_info
);
10938 int btrfs_error_unpin_extent_range(struct btrfs_fs_info
*fs_info
,
10939 u64 start
, u64 end
)
10941 return unpin_extent_range(fs_info
, start
, end
, false);
10945 * It used to be that old block groups would be left around forever.
10946 * Iterating over them would be enough to trim unused space. Since we
10947 * now automatically remove them, we also need to iterate over unallocated
10950 * We don't want a transaction for this since the discard may take a
10951 * substantial amount of time. We don't require that a transaction be
10952 * running, but we do need to take a running transaction into account
10953 * to ensure that we're not discarding chunks that were released or
10954 * allocated in the current transaction.
10956 * Holding the chunks lock will prevent other threads from allocating
10957 * or releasing chunks, but it won't prevent a running transaction
10958 * from committing and releasing the memory that the pending chunks
10959 * list head uses. For that, we need to take a reference to the
10960 * transaction and hold the commit root sem. We only need to hold
10961 * it while performing the free space search since we have already
10962 * held back allocations.
10964 static int btrfs_trim_free_extents(struct btrfs_device
*device
,
10965 u64 minlen
, u64
*trimmed
)
10967 u64 start
= 0, len
= 0;
10972 /* Discard not supported = nothing to do. */
10973 if (!blk_queue_discard(bdev_get_queue(device
->bdev
)))
10976 /* Not writeable = nothing to do. */
10977 if (!device
->writeable
)
10980 /* No free space = nothing to do. */
10981 if (device
->total_bytes
<= device
->bytes_used
)
10987 struct btrfs_fs_info
*fs_info
= device
->fs_info
;
10988 struct btrfs_transaction
*trans
;
10991 ret
= mutex_lock_interruptible(&fs_info
->chunk_mutex
);
10995 ret
= down_read_killable(&fs_info
->commit_root_sem
);
10997 mutex_unlock(&fs_info
->chunk_mutex
);
11001 spin_lock(&fs_info
->trans_lock
);
11002 trans
= fs_info
->running_transaction
;
11004 refcount_inc(&trans
->use_count
);
11005 spin_unlock(&fs_info
->trans_lock
);
11008 up_read(&fs_info
->commit_root_sem
);
11010 ret
= find_free_dev_extent_start(trans
, device
, minlen
, start
,
11013 up_read(&fs_info
->commit_root_sem
);
11014 btrfs_put_transaction(trans
);
11018 mutex_unlock(&fs_info
->chunk_mutex
);
11019 if (ret
== -ENOSPC
)
11024 ret
= btrfs_issue_discard(device
->bdev
, start
, len
, &bytes
);
11025 mutex_unlock(&fs_info
->chunk_mutex
);
11033 if (fatal_signal_pending(current
)) {
11034 ret
= -ERESTARTSYS
;
11045 * Trim the whole filesystem by:
11046 * 1) trimming the free space in each block group
11047 * 2) trimming the unallocated space on each device
11049 * This will also continue trimming even if a block group or device encounters
11050 * an error. The return value will be the last error, or 0 if nothing bad
11053 int btrfs_trim_fs(struct btrfs_fs_info
*fs_info
, struct fstrim_range
*range
)
11055 struct btrfs_block_group_cache
*cache
= NULL
;
11056 struct btrfs_device
*device
;
11057 struct list_head
*devices
;
11063 u64 dev_failed
= 0;
11068 cache
= btrfs_lookup_first_block_group(fs_info
, range
->start
);
11069 for (; cache
; cache
= next_block_group(fs_info
, cache
)) {
11070 if (cache
->key
.objectid
>= (range
->start
+ range
->len
)) {
11071 btrfs_put_block_group(cache
);
11075 start
= max(range
->start
, cache
->key
.objectid
);
11076 end
= min(range
->start
+ range
->len
,
11077 cache
->key
.objectid
+ cache
->key
.offset
);
11079 if (end
- start
>= range
->minlen
) {
11080 if (!block_group_cache_done(cache
)) {
11081 ret
= cache_block_group(cache
, 0);
11087 ret
= wait_block_group_cache_done(cache
);
11094 ret
= btrfs_trim_block_group(cache
,
11100 trimmed
+= group_trimmed
;
11110 btrfs_warn(fs_info
,
11111 "failed to trim %llu block group(s), last error %d",
11112 bg_failed
, bg_ret
);
11113 mutex_lock(&fs_info
->fs_devices
->device_list_mutex
);
11114 devices
= &fs_info
->fs_devices
->devices
;
11115 list_for_each_entry(device
, devices
, dev_list
) {
11116 ret
= btrfs_trim_free_extents(device
, range
->minlen
,
11124 trimmed
+= group_trimmed
;
11126 mutex_unlock(&fs_info
->fs_devices
->device_list_mutex
);
11129 btrfs_warn(fs_info
,
11130 "failed to trim %llu device(s), last error %d",
11131 dev_failed
, dev_ret
);
11132 range
->len
= trimmed
;
11139 * btrfs_{start,end}_write_no_snapshotting() are similar to
11140 * mnt_{want,drop}_write(), they are used to prevent some tasks from writing
11141 * data into the page cache through nocow before the subvolume is snapshoted,
11142 * but flush the data into disk after the snapshot creation, or to prevent
11143 * operations while snapshotting is ongoing and that cause the snapshot to be
11144 * inconsistent (writes followed by expanding truncates for example).
11146 void btrfs_end_write_no_snapshotting(struct btrfs_root
*root
)
11148 percpu_counter_dec(&root
->subv_writers
->counter
);
11150 * Make sure counter is updated before we wake up waiters.
11153 if (waitqueue_active(&root
->subv_writers
->wait
))
11154 wake_up(&root
->subv_writers
->wait
);
11157 int btrfs_start_write_no_snapshotting(struct btrfs_root
*root
)
11159 if (atomic_read(&root
->will_be_snapshotted
))
11162 percpu_counter_inc(&root
->subv_writers
->counter
);
11164 * Make sure counter is updated before we check for snapshot creation.
11167 if (atomic_read(&root
->will_be_snapshotted
)) {
11168 btrfs_end_write_no_snapshotting(root
);
11174 void btrfs_wait_for_snapshot_creation(struct btrfs_root
*root
)
11179 ret
= btrfs_start_write_no_snapshotting(root
);
11182 wait_on_atomic_t(&root
->will_be_snapshotted
, atomic_t_wait
,
11183 TASK_UNINTERRUPTIBLE
);