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.
21 #include "kerncompat.h"
22 #include "radix-tree.h"
25 #include "print-tree.h"
26 #include "transaction.h"
30 #define BLOCK_GROUP_DATA EXTENT_WRITEBACK
31 #define BLOCK_GROUP_METADATA EXTENT_UPTODATE
32 #define BLOCK_GROUP_SYSTEM EXTENT_NEW
34 #define BLOCK_GROUP_DIRTY EXTENT_DIRTY
36 #define PENDING_EXTENT_INSERT 0
37 #define PENDING_EXTENT_DELETE 1
38 #define PENDING_BACKREF_UPDATE 2
40 struct pending_extent_op
{
45 struct btrfs_disk_key key
;
49 static int alloc_reserved_tree_block(struct btrfs_trans_handle
*trans
,
50 struct btrfs_root
*root
,
51 u64 root_objectid
, u64 generation
,
52 u64 flags
, struct btrfs_disk_key
*key
,
53 int level
, struct btrfs_key
*ins
);
54 static int __free_extent(struct btrfs_trans_handle
*trans
,
55 struct btrfs_root
*root
,
56 u64 bytenr
, u64 num_bytes
, u64 parent
,
57 u64 root_objectid
, u64 owner_objectid
,
58 u64 owner_offset
, int refs_to_drop
);
59 static int finish_current_insert(struct btrfs_trans_handle
*trans
, struct
60 btrfs_root
*extent_root
);
61 static int del_pending_extents(struct btrfs_trans_handle
*trans
, struct
62 btrfs_root
*extent_root
);
64 static int remove_sb_from_cache(struct btrfs_root
*root
,
65 struct btrfs_block_group_cache
*cache
)
71 struct extent_io_tree
*free_space_cache
;
73 free_space_cache
= &root
->fs_info
->free_space_cache
;
74 for (i
= 0; i
< BTRFS_SUPER_MIRROR_MAX
; i
++) {
75 bytenr
= btrfs_sb_offset(i
);
76 ret
= btrfs_rmap_block(&root
->fs_info
->mapping_tree
,
77 cache
->key
.objectid
, bytenr
, 0,
78 &logical
, &nr
, &stripe_len
);
81 clear_extent_dirty(free_space_cache
, logical
[nr
],
82 logical
[nr
] + stripe_len
- 1, GFP_NOFS
);
89 static int cache_block_group(struct btrfs_root
*root
,
90 struct btrfs_block_group_cache
*block_group
)
92 struct btrfs_path
*path
;
95 struct extent_buffer
*leaf
;
96 struct extent_io_tree
*free_space_cache
;
104 root
= root
->fs_info
->extent_root
;
105 free_space_cache
= &root
->fs_info
->free_space_cache
;
107 if (block_group
->cached
)
110 path
= btrfs_alloc_path();
115 last
= max_t(u64
, block_group
->key
.objectid
, BTRFS_SUPER_INFO_OFFSET
);
118 btrfs_set_key_type(&key
, BTRFS_EXTENT_ITEM_KEY
);
119 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
124 leaf
= path
->nodes
[0];
125 slot
= path
->slots
[0];
126 if (slot
>= btrfs_header_nritems(leaf
)) {
127 ret
= btrfs_next_leaf(root
, path
);
136 btrfs_item_key_to_cpu(leaf
, &key
, slot
);
137 if (key
.objectid
< block_group
->key
.objectid
) {
140 if (key
.objectid
>= block_group
->key
.objectid
+
141 block_group
->key
.offset
) {
145 if (btrfs_key_type(&key
) == BTRFS_EXTENT_ITEM_KEY
) {
146 if (key
.objectid
> last
) {
147 hole_size
= key
.objectid
- last
;
148 set_extent_dirty(free_space_cache
, last
,
149 last
+ hole_size
- 1,
152 last
= key
.objectid
+ key
.offset
;
158 if (block_group
->key
.objectid
+
159 block_group
->key
.offset
> last
) {
160 hole_size
= block_group
->key
.objectid
+
161 block_group
->key
.offset
- last
;
162 set_extent_dirty(free_space_cache
, last
,
163 last
+ hole_size
- 1, GFP_NOFS
);
165 remove_sb_from_cache(root
, block_group
);
166 block_group
->cached
= 1;
168 btrfs_free_path(path
);
172 struct btrfs_block_group_cache
*btrfs_lookup_first_block_group(struct
176 struct extent_io_tree
*block_group_cache
;
177 struct btrfs_block_group_cache
*block_group
= NULL
;
183 bytenr
= max_t(u64
, bytenr
,
184 BTRFS_SUPER_INFO_OFFSET
+ BTRFS_SUPER_INFO_SIZE
);
185 block_group_cache
= &info
->block_group_cache
;
186 ret
= find_first_extent_bit(block_group_cache
,
187 bytenr
, &start
, &end
,
188 BLOCK_GROUP_DATA
| BLOCK_GROUP_METADATA
|
193 ret
= get_state_private(block_group_cache
, start
, &ptr
);
197 block_group
= (struct btrfs_block_group_cache
*)(unsigned long)ptr
;
201 struct btrfs_block_group_cache
*btrfs_lookup_block_group(struct
205 struct extent_io_tree
*block_group_cache
;
206 struct btrfs_block_group_cache
*block_group
= NULL
;
212 block_group_cache
= &info
->block_group_cache
;
213 ret
= find_first_extent_bit(block_group_cache
,
214 bytenr
, &start
, &end
,
215 BLOCK_GROUP_DATA
| BLOCK_GROUP_METADATA
|
220 ret
= get_state_private(block_group_cache
, start
, &ptr
);
224 block_group
= (struct btrfs_block_group_cache
*)(unsigned long)ptr
;
225 if (block_group
->key
.objectid
<= bytenr
&& bytenr
<
226 block_group
->key
.objectid
+ block_group
->key
.offset
)
231 static int block_group_bits(struct btrfs_block_group_cache
*cache
, u64 bits
)
233 return (cache
->flags
& bits
) == bits
;
236 static int noinline
find_search_start(struct btrfs_root
*root
,
237 struct btrfs_block_group_cache
**cache_ret
,
238 u64
*start_ret
, int num
, int data
)
241 struct btrfs_block_group_cache
*cache
= *cache_ret
;
245 u64 search_start
= *start_ret
;
252 ret
= cache_block_group(root
, cache
);
256 last
= max(search_start
, cache
->key
.objectid
);
257 if (cache
->ro
|| !block_group_bits(cache
, data
)) {
262 ret
= find_first_extent_bit(&root
->fs_info
->free_space_cache
,
263 last
, &start
, &end
, EXTENT_DIRTY
);
268 start
= max(last
, start
);
270 if (last
- start
< num
) {
273 if (start
+ num
> cache
->key
.objectid
+ cache
->key
.offset
) {
280 cache
= btrfs_lookup_block_group(root
->fs_info
, search_start
);
282 printk("Unable to find block group for %llu\n",
283 (unsigned long long)search_start
);
289 last
= cache
->key
.objectid
+ cache
->key
.offset
;
291 cache
= btrfs_lookup_first_block_group(root
->fs_info
, last
);
301 cache
= btrfs_find_block_group(root
, cache
, last
, data
, 0);
302 cache
= btrfs_find_block_group(root
, cache
, last
, data
, 0);
310 static u64
div_factor(u64 num
, int factor
)
319 static int block_group_state_bits(u64 flags
)
322 if (flags
& BTRFS_BLOCK_GROUP_DATA
)
323 bits
|= BLOCK_GROUP_DATA
;
324 if (flags
& BTRFS_BLOCK_GROUP_METADATA
)
325 bits
|= BLOCK_GROUP_METADATA
;
326 if (flags
& BTRFS_BLOCK_GROUP_SYSTEM
)
327 bits
|= BLOCK_GROUP_SYSTEM
;
331 struct btrfs_block_group_cache
*btrfs_find_block_group(struct btrfs_root
*root
,
332 struct btrfs_block_group_cache
333 *hint
, u64 search_start
,
336 struct btrfs_block_group_cache
*cache
;
337 struct extent_io_tree
*block_group_cache
;
338 struct btrfs_block_group_cache
*found_group
= NULL
;
339 struct btrfs_fs_info
*info
= root
->fs_info
;
352 block_group_cache
= &info
->block_group_cache
;
357 bit
= block_group_state_bits(data
);
360 struct btrfs_block_group_cache
*shint
;
361 shint
= btrfs_lookup_block_group(info
, search_start
);
362 if (shint
&& !shint
->ro
&& block_group_bits(shint
, data
)) {
363 used
= btrfs_block_group_used(&shint
->item
);
364 if (used
+ shint
->pinned
<
365 div_factor(shint
->key
.offset
, factor
)) {
370 if (hint
&& !hint
->ro
&& block_group_bits(hint
, data
)) {
371 used
= btrfs_block_group_used(&hint
->item
);
372 if (used
+ hint
->pinned
<
373 div_factor(hint
->key
.offset
, factor
)) {
376 last
= hint
->key
.objectid
+ hint
->key
.offset
;
380 hint_last
= max(hint
->key
.objectid
, search_start
);
382 hint_last
= search_start
;
388 ret
= find_first_extent_bit(block_group_cache
, last
,
393 ret
= get_state_private(block_group_cache
, start
, &ptr
);
397 cache
= (struct btrfs_block_group_cache
*)(unsigned long)ptr
;
398 last
= cache
->key
.objectid
+ cache
->key
.offset
;
399 used
= btrfs_block_group_used(&cache
->item
);
401 if (!cache
->ro
&& block_group_bits(cache
, data
)) {
403 free_check
= cache
->key
.offset
;
405 free_check
= div_factor(cache
->key
.offset
,
408 if (used
+ cache
->pinned
< free_check
) {
425 * Back reference rules. Back refs have three main goals:
427 * 1) differentiate between all holders of references to an extent so that
428 * when a reference is dropped we can make sure it was a valid reference
429 * before freeing the extent.
431 * 2) Provide enough information to quickly find the holders of an extent
432 * if we notice a given block is corrupted or bad.
434 * 3) Make it easy to migrate blocks for FS shrinking or storage pool
435 * maintenance. This is actually the same as #2, but with a slightly
436 * different use case.
438 * There are two kinds of back refs. The implicit back refs is optimized
439 * for pointers in non-shared tree blocks. For a given pointer in a block,
440 * back refs of this kind provide information about the block's owner tree
441 * and the pointer's key. These information allow us to find the block by
442 * b-tree searching. The full back refs is for pointers in tree blocks not
443 * referenced by their owner trees. The location of tree block is recorded
444 * in the back refs. Actually the full back refs is generic, and can be
445 * used in all cases the implicit back refs is used. The major shortcoming
446 * of the full back refs is its overhead. Every time a tree block gets
447 * COWed, we have to update back refs entry for all pointers in it.
449 * For a newly allocated tree block, we use implicit back refs for
450 * pointers in it. This means most tree related operations only involve
451 * implicit back refs. For a tree block created in old transaction, the
452 * only way to drop a reference to it is COW it. So we can detect the
453 * event that tree block loses its owner tree's reference and do the
454 * back refs conversion.
456 * When a tree block is COW'd through a tree, there are four cases:
458 * The reference count of the block is one and the tree is the block's
459 * owner tree. Nothing to do in this case.
461 * The reference count of the block is one and the tree is not the
462 * block's owner tree. In this case, full back refs is used for pointers
463 * in the block. Remove these full back refs, add implicit back refs for
464 * every pointers in the new block.
466 * The reference count of the block is greater than one and the tree is
467 * the block's owner tree. In this case, implicit back refs is used for
468 * pointers in the block. Add full back refs for every pointers in the
469 * block, increase lower level extents' reference counts. The original
470 * implicit back refs are entailed to the new block.
472 * The reference count of the block is greater than one and the tree is
473 * not the block's owner tree. Add implicit back refs for every pointer in
474 * the new block, increase lower level extents' reference count.
476 * Back Reference Key composing:
478 * The key objectid corresponds to the first byte in the extent,
479 * The key type is used to differentiate between types of back refs.
480 * There are different meanings of the key offset for different types
483 * File extents can be referenced by:
485 * - multiple snapshots, subvolumes, or different generations in one subvol
486 * - different files inside a single subvolume
487 * - different offsets inside a file (bookend extents in file.c)
489 * The extent ref structure for the implicit back refs has fields for:
491 * - Objectid of the subvolume root
492 * - objectid of the file holding the reference
493 * - original offset in the file
494 * - how many bookend extents
496 * The key offset for the implicit back refs is hash of the first
499 * The extent ref structure for the full back refs has field for:
501 * - number of pointers in the tree leaf
503 * The key offset for the implicit back refs is the first byte of
506 * When a file extent is allocated, The implicit back refs is used.
507 * the fields are filled in:
509 * (root_key.objectid, inode objectid, offset in file, 1)
511 * When a file extent is removed file truncation, we find the
512 * corresponding implicit back refs and check the following fields:
514 * (btrfs_header_owner(leaf), inode objectid, offset in file)
516 * Btree extents can be referenced by:
518 * - Different subvolumes
520 * Both the implicit back refs and the full back refs for tree blocks
521 * only consist of key. The key offset for the implicit back refs is
522 * objectid of block's owner tree. The key offset for the full back refs
523 * is the first byte of parent block.
525 * When implicit back refs is used, information about the lowest key and
526 * level of the tree block are required. These information are stored in
527 * tree block info structure.
530 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
531 static int convert_extent_item_v0(struct btrfs_trans_handle
*trans
,
532 struct btrfs_root
*root
,
533 struct btrfs_path
*path
,
534 u64 owner
, u32 extra_size
)
536 struct btrfs_extent_item
*item
;
537 struct btrfs_extent_item_v0
*ei0
;
538 struct btrfs_extent_ref_v0
*ref0
;
539 struct btrfs_tree_block_info
*bi
;
540 struct extent_buffer
*leaf
;
541 struct btrfs_key key
;
542 struct btrfs_key found_key
;
543 u32 new_size
= sizeof(*item
);
547 leaf
= path
->nodes
[0];
548 BUG_ON(btrfs_item_size_nr(leaf
, path
->slots
[0]) != sizeof(*ei0
));
550 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
551 ei0
= btrfs_item_ptr(leaf
, path
->slots
[0],
552 struct btrfs_extent_item_v0
);
553 refs
= btrfs_extent_refs_v0(leaf
, ei0
);
555 if (owner
== (u64
)-1) {
557 if (path
->slots
[0] >= btrfs_header_nritems(leaf
)) {
558 ret
= btrfs_next_leaf(root
, path
);
562 leaf
= path
->nodes
[0];
564 btrfs_item_key_to_cpu(leaf
, &found_key
,
566 BUG_ON(key
.objectid
!= found_key
.objectid
);
567 if (found_key
.type
!= BTRFS_EXTENT_REF_V0_KEY
) {
571 ref0
= btrfs_item_ptr(leaf
, path
->slots
[0],
572 struct btrfs_extent_ref_v0
);
573 owner
= btrfs_ref_objectid_v0(leaf
, ref0
);
577 btrfs_release_path(root
, path
);
579 if (owner
< BTRFS_FIRST_FREE_OBJECTID
)
580 new_size
+= sizeof(*bi
);
582 new_size
-= sizeof(*ei0
);
583 ret
= btrfs_search_slot(trans
, root
, &key
, path
, new_size
, 1);
588 ret
= btrfs_extend_item(trans
, root
, path
, new_size
);
591 leaf
= path
->nodes
[0];
592 item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
593 btrfs_set_extent_refs(leaf
, item
, refs
);
594 /* FIXME: get real generation */
595 btrfs_set_extent_generation(leaf
, item
, 0);
596 if (owner
< BTRFS_FIRST_FREE_OBJECTID
) {
597 btrfs_set_extent_flags(leaf
, item
,
598 BTRFS_EXTENT_FLAG_TREE_BLOCK
|
599 BTRFS_BLOCK_FLAG_FULL_BACKREF
);
600 bi
= (struct btrfs_tree_block_info
*)(item
+ 1);
601 /* FIXME: get first key of the block */
602 memset_extent_buffer(leaf
, 0, (unsigned long)bi
, sizeof(*bi
));
603 btrfs_set_tree_block_level(leaf
, bi
, (int)owner
);
605 btrfs_set_extent_flags(leaf
, item
, BTRFS_EXTENT_FLAG_DATA
);
607 btrfs_mark_buffer_dirty(leaf
);
612 static u64
hash_extent_data_ref(u64 root_objectid
, u64 owner
, u64 offset
)
614 u32 high_crc
= ~(u32
)0;
615 u32 low_crc
= ~(u32
)0;
618 lenum
= cpu_to_le64(root_objectid
);
619 high_crc
= btrfs_crc32c(high_crc
, &lenum
, sizeof(lenum
));
620 lenum
= cpu_to_le64(owner
);
621 low_crc
= btrfs_crc32c(low_crc
, &lenum
, sizeof(lenum
));
622 lenum
= cpu_to_le64(offset
);
623 low_crc
= btrfs_crc32c(low_crc
, &lenum
, sizeof(lenum
));
625 return ((u64
)high_crc
<< 31) ^ (u64
)low_crc
;
628 static u64
hash_extent_data_ref_item(struct extent_buffer
*leaf
,
629 struct btrfs_extent_data_ref
*ref
)
631 return hash_extent_data_ref(btrfs_extent_data_ref_root(leaf
, ref
),
632 btrfs_extent_data_ref_objectid(leaf
, ref
),
633 btrfs_extent_data_ref_offset(leaf
, ref
));
636 static int match_extent_data_ref(struct extent_buffer
*leaf
,
637 struct btrfs_extent_data_ref
*ref
,
638 u64 root_objectid
, u64 owner
, u64 offset
)
640 if (btrfs_extent_data_ref_root(leaf
, ref
) != root_objectid
||
641 btrfs_extent_data_ref_objectid(leaf
, ref
) != owner
||
642 btrfs_extent_data_ref_offset(leaf
, ref
) != offset
)
647 static noinline
int lookup_extent_data_ref(struct btrfs_trans_handle
*trans
,
648 struct btrfs_root
*root
,
649 struct btrfs_path
*path
,
650 u64 bytenr
, u64 parent
,
652 u64 owner
, u64 offset
)
654 struct btrfs_key key
;
655 struct btrfs_extent_data_ref
*ref
;
656 struct extent_buffer
*leaf
;
662 key
.objectid
= bytenr
;
664 key
.type
= BTRFS_SHARED_DATA_REF_KEY
;
667 key
.type
= BTRFS_EXTENT_DATA_REF_KEY
;
668 key
.offset
= hash_extent_data_ref(root_objectid
,
673 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
682 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
683 key
.type
= BTRFS_EXTENT_REF_V0_KEY
;
684 btrfs_release_path(root
, path
);
685 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
696 leaf
= path
->nodes
[0];
697 nritems
= btrfs_header_nritems(leaf
);
699 if (path
->slots
[0] >= nritems
) {
700 ret
= btrfs_next_leaf(root
, path
);
706 leaf
= path
->nodes
[0];
707 nritems
= btrfs_header_nritems(leaf
);
711 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
712 if (key
.objectid
!= bytenr
||
713 key
.type
!= BTRFS_EXTENT_DATA_REF_KEY
)
716 ref
= btrfs_item_ptr(leaf
, path
->slots
[0],
717 struct btrfs_extent_data_ref
);
719 if (match_extent_data_ref(leaf
, ref
, root_objectid
,
722 btrfs_release_path(root
, path
);
734 static noinline
int insert_extent_data_ref(struct btrfs_trans_handle
*trans
,
735 struct btrfs_root
*root
,
736 struct btrfs_path
*path
,
737 u64 bytenr
, u64 parent
,
738 u64 root_objectid
, u64 owner
,
739 u64 offset
, int refs_to_add
)
741 struct btrfs_key key
;
742 struct extent_buffer
*leaf
;
747 key
.objectid
= bytenr
;
749 key
.type
= BTRFS_SHARED_DATA_REF_KEY
;
751 size
= sizeof(struct btrfs_shared_data_ref
);
753 key
.type
= BTRFS_EXTENT_DATA_REF_KEY
;
754 key
.offset
= hash_extent_data_ref(root_objectid
,
756 size
= sizeof(struct btrfs_extent_data_ref
);
759 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
, size
);
760 if (ret
&& ret
!= -EEXIST
)
763 leaf
= path
->nodes
[0];
765 struct btrfs_shared_data_ref
*ref
;
766 ref
= btrfs_item_ptr(leaf
, path
->slots
[0],
767 struct btrfs_shared_data_ref
);
769 btrfs_set_shared_data_ref_count(leaf
, ref
, refs_to_add
);
771 num_refs
= btrfs_shared_data_ref_count(leaf
, ref
);
772 num_refs
+= refs_to_add
;
773 btrfs_set_shared_data_ref_count(leaf
, ref
, num_refs
);
776 struct btrfs_extent_data_ref
*ref
;
777 while (ret
== -EEXIST
) {
778 ref
= btrfs_item_ptr(leaf
, path
->slots
[0],
779 struct btrfs_extent_data_ref
);
780 if (match_extent_data_ref(leaf
, ref
, root_objectid
,
783 btrfs_release_path(root
, path
);
786 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
788 if (ret
&& ret
!= -EEXIST
)
791 leaf
= path
->nodes
[0];
793 ref
= btrfs_item_ptr(leaf
, path
->slots
[0],
794 struct btrfs_extent_data_ref
);
796 btrfs_set_extent_data_ref_root(leaf
, ref
,
798 btrfs_set_extent_data_ref_objectid(leaf
, ref
, owner
);
799 btrfs_set_extent_data_ref_offset(leaf
, ref
, offset
);
800 btrfs_set_extent_data_ref_count(leaf
, ref
, refs_to_add
);
802 num_refs
= btrfs_extent_data_ref_count(leaf
, ref
);
803 num_refs
+= refs_to_add
;
804 btrfs_set_extent_data_ref_count(leaf
, ref
, num_refs
);
807 btrfs_mark_buffer_dirty(leaf
);
810 btrfs_release_path(root
, path
);
814 static noinline
int remove_extent_data_ref(struct btrfs_trans_handle
*trans
,
815 struct btrfs_root
*root
,
816 struct btrfs_path
*path
,
819 struct btrfs_key key
;
820 struct btrfs_extent_data_ref
*ref1
= NULL
;
821 struct btrfs_shared_data_ref
*ref2
= NULL
;
822 struct extent_buffer
*leaf
;
826 leaf
= path
->nodes
[0];
827 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
829 if (key
.type
== BTRFS_EXTENT_DATA_REF_KEY
) {
830 ref1
= btrfs_item_ptr(leaf
, path
->slots
[0],
831 struct btrfs_extent_data_ref
);
832 num_refs
= btrfs_extent_data_ref_count(leaf
, ref1
);
833 } else if (key
.type
== BTRFS_SHARED_DATA_REF_KEY
) {
834 ref2
= btrfs_item_ptr(leaf
, path
->slots
[0],
835 struct btrfs_shared_data_ref
);
836 num_refs
= btrfs_shared_data_ref_count(leaf
, ref2
);
837 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
838 } else if (key
.type
== BTRFS_EXTENT_REF_V0_KEY
) {
839 struct btrfs_extent_ref_v0
*ref0
;
840 ref0
= btrfs_item_ptr(leaf
, path
->slots
[0],
841 struct btrfs_extent_ref_v0
);
842 num_refs
= btrfs_ref_count_v0(leaf
, ref0
);
848 BUG_ON(num_refs
< refs_to_drop
);
849 num_refs
-= refs_to_drop
;
852 ret
= btrfs_del_item(trans
, root
, path
);
854 if (key
.type
== BTRFS_EXTENT_DATA_REF_KEY
)
855 btrfs_set_extent_data_ref_count(leaf
, ref1
, num_refs
);
856 else if (key
.type
== BTRFS_SHARED_DATA_REF_KEY
)
857 btrfs_set_shared_data_ref_count(leaf
, ref2
, num_refs
);
858 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
860 struct btrfs_extent_ref_v0
*ref0
;
861 ref0
= btrfs_item_ptr(leaf
, path
->slots
[0],
862 struct btrfs_extent_ref_v0
);
863 btrfs_set_ref_count_v0(leaf
, ref0
, num_refs
);
866 btrfs_mark_buffer_dirty(leaf
);
871 static noinline u32
extent_data_ref_count(struct btrfs_root
*root
,
872 struct btrfs_path
*path
,
873 struct btrfs_extent_inline_ref
*iref
)
875 struct btrfs_key key
;
876 struct extent_buffer
*leaf
;
877 struct btrfs_extent_data_ref
*ref1
;
878 struct btrfs_shared_data_ref
*ref2
;
881 leaf
= path
->nodes
[0];
882 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
884 if (btrfs_extent_inline_ref_type(leaf
, iref
) ==
885 BTRFS_EXTENT_DATA_REF_KEY
) {
886 ref1
= (struct btrfs_extent_data_ref
*)(&iref
->offset
);
887 num_refs
= btrfs_extent_data_ref_count(leaf
, ref1
);
889 ref2
= (struct btrfs_shared_data_ref
*)(iref
+ 1);
890 num_refs
= btrfs_shared_data_ref_count(leaf
, ref2
);
892 } else if (key
.type
== BTRFS_EXTENT_DATA_REF_KEY
) {
893 ref1
= btrfs_item_ptr(leaf
, path
->slots
[0],
894 struct btrfs_extent_data_ref
);
895 num_refs
= btrfs_extent_data_ref_count(leaf
, ref1
);
896 } else if (key
.type
== BTRFS_SHARED_DATA_REF_KEY
) {
897 ref2
= btrfs_item_ptr(leaf
, path
->slots
[0],
898 struct btrfs_shared_data_ref
);
899 num_refs
= btrfs_shared_data_ref_count(leaf
, ref2
);
900 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
901 } else if (key
.type
== BTRFS_EXTENT_REF_V0_KEY
) {
902 struct btrfs_extent_ref_v0
*ref0
;
903 ref0
= btrfs_item_ptr(leaf
, path
->slots
[0],
904 struct btrfs_extent_ref_v0
);
905 num_refs
= btrfs_ref_count_v0(leaf
, ref0
);
913 static noinline
int lookup_tree_block_ref(struct btrfs_trans_handle
*trans
,
914 struct btrfs_root
*root
,
915 struct btrfs_path
*path
,
916 u64 bytenr
, u64 parent
,
919 struct btrfs_key key
;
922 key
.objectid
= bytenr
;
924 key
.type
= BTRFS_SHARED_BLOCK_REF_KEY
;
927 key
.type
= BTRFS_TREE_BLOCK_REF_KEY
;
928 key
.offset
= root_objectid
;
931 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
934 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
935 if (ret
== -ENOENT
&& parent
) {
936 btrfs_release_path(root
, path
);
937 key
.type
= BTRFS_EXTENT_REF_V0_KEY
;
938 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
946 static noinline
int insert_tree_block_ref(struct btrfs_trans_handle
*trans
,
947 struct btrfs_root
*root
,
948 struct btrfs_path
*path
,
949 u64 bytenr
, u64 parent
,
952 struct btrfs_key key
;
955 key
.objectid
= bytenr
;
957 key
.type
= BTRFS_SHARED_BLOCK_REF_KEY
;
960 key
.type
= BTRFS_TREE_BLOCK_REF_KEY
;
961 key
.offset
= root_objectid
;
964 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
, 0);
966 btrfs_release_path(root
, path
);
970 static inline int extent_ref_type(u64 parent
, u64 owner
)
972 if (owner
< BTRFS_FIRST_FREE_OBJECTID
) {
974 return BTRFS_SHARED_BLOCK_REF_KEY
;
976 return BTRFS_TREE_BLOCK_REF_KEY
;
979 return BTRFS_SHARED_DATA_REF_KEY
;
981 return BTRFS_EXTENT_DATA_REF_KEY
;
985 static int find_next_key(struct btrfs_path
*path
, struct btrfs_key
*key
)
989 for (level
= 0; level
< BTRFS_MAX_LEVEL
; level
++) {
990 if (!path
->nodes
[level
])
992 if (path
->slots
[level
] + 1 >=
993 btrfs_header_nritems(path
->nodes
[level
]))
996 btrfs_item_key_to_cpu(path
->nodes
[level
], key
,
997 path
->slots
[level
] + 1);
999 btrfs_node_key_to_cpu(path
->nodes
[level
], key
,
1000 path
->slots
[level
] + 1);
1006 static int lookup_inline_extent_backref(struct btrfs_trans_handle
*trans
,
1007 struct btrfs_root
*root
,
1008 struct btrfs_path
*path
,
1009 struct btrfs_extent_inline_ref
**ref_ret
,
1010 u64 bytenr
, u64 num_bytes
,
1011 u64 parent
, u64 root_objectid
,
1012 u64 owner
, u64 offset
, int insert
)
1014 struct btrfs_key key
;
1015 struct extent_buffer
*leaf
;
1016 struct btrfs_extent_item
*ei
;
1017 struct btrfs_extent_inline_ref
*iref
;
1028 key
.objectid
= bytenr
;
1029 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
1030 key
.offset
= num_bytes
;
1032 want
= extent_ref_type(parent
, owner
);
1034 extra_size
= btrfs_extent_inline_ref_size(want
);
1037 ret
= btrfs_search_slot(trans
, root
, &key
, path
, extra_size
, 1);
1043 printf("Failed to find [%llu, %u, %llu]\n", key
.objectid
, key
.type
, key
.offset
);
1049 leaf
= path
->nodes
[0];
1050 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
1051 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1052 if (item_size
< sizeof(*ei
)) {
1057 ret
= convert_extent_item_v0(trans
, root
, path
, owner
,
1063 leaf
= path
->nodes
[0];
1064 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
1067 if (item_size
< sizeof(*ei
)) {
1068 printf("Size is %u, needs to be %u, slot %d\n",
1069 (unsigned)item_size
,
1070 (unsigned)sizeof(*ei
), path
->slots
[0]);
1071 btrfs_print_leaf(root
, leaf
);
1074 BUG_ON(item_size
< sizeof(*ei
));
1076 ei
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
1077 flags
= btrfs_extent_flags(leaf
, ei
);
1079 ptr
= (unsigned long)(ei
+ 1);
1080 end
= (unsigned long)ei
+ item_size
;
1082 if (flags
& BTRFS_EXTENT_FLAG_TREE_BLOCK
) {
1083 ptr
+= sizeof(struct btrfs_tree_block_info
);
1086 if (!(flags
& BTRFS_EXTENT_FLAG_DATA
)) {
1097 iref
= (struct btrfs_extent_inline_ref
*)ptr
;
1098 type
= btrfs_extent_inline_ref_type(leaf
, iref
);
1102 ptr
+= btrfs_extent_inline_ref_size(type
);
1106 if (type
== BTRFS_EXTENT_DATA_REF_KEY
) {
1107 struct btrfs_extent_data_ref
*dref
;
1108 dref
= (struct btrfs_extent_data_ref
*)(&iref
->offset
);
1109 if (match_extent_data_ref(leaf
, dref
, root_objectid
,
1114 if (hash_extent_data_ref_item(leaf
, dref
) <
1115 hash_extent_data_ref(root_objectid
, owner
, offset
))
1119 ref_offset
= btrfs_extent_inline_ref_offset(leaf
, iref
);
1121 if (parent
== ref_offset
) {
1125 if (ref_offset
< parent
)
1128 if (root_objectid
== ref_offset
) {
1132 if (ref_offset
< root_objectid
)
1136 ptr
+= btrfs_extent_inline_ref_size(type
);
1138 if (err
== -ENOENT
&& insert
) {
1139 if (item_size
+ extra_size
>=
1140 BTRFS_MAX_EXTENT_ITEM_SIZE(root
)) {
1145 * To add new inline back ref, we have to make sure
1146 * there is no corresponding back ref item.
1147 * For simplicity, we just do not add new inline back
1148 * ref if there is any back ref item.
1150 if (find_next_key(path
, &key
) == 0 && key
.objectid
== bytenr
&&
1151 key
.type
< BTRFS_BLOCK_GROUP_ITEM_KEY
) {
1156 *ref_ret
= (struct btrfs_extent_inline_ref
*)ptr
;
1161 static int setup_inline_extent_backref(struct btrfs_trans_handle
*trans
,
1162 struct btrfs_root
*root
,
1163 struct btrfs_path
*path
,
1164 struct btrfs_extent_inline_ref
*iref
,
1165 u64 parent
, u64 root_objectid
,
1166 u64 owner
, u64 offset
, int refs_to_add
)
1168 struct extent_buffer
*leaf
;
1169 struct btrfs_extent_item
*ei
;
1172 unsigned long item_offset
;
1178 leaf
= path
->nodes
[0];
1179 ei
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
1180 item_offset
= (unsigned long)iref
- (unsigned long)ei
;
1182 type
= extent_ref_type(parent
, owner
);
1183 size
= btrfs_extent_inline_ref_size(type
);
1185 ret
= btrfs_extend_item(trans
, root
, path
, size
);
1188 ei
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
1189 refs
= btrfs_extent_refs(leaf
, ei
);
1190 refs
+= refs_to_add
;
1191 btrfs_set_extent_refs(leaf
, ei
, refs
);
1193 ptr
= (unsigned long)ei
+ item_offset
;
1194 end
= (unsigned long)ei
+ btrfs_item_size_nr(leaf
, path
->slots
[0]);
1195 if (ptr
< end
- size
)
1196 memmove_extent_buffer(leaf
, ptr
+ size
, ptr
,
1199 iref
= (struct btrfs_extent_inline_ref
*)ptr
;
1200 btrfs_set_extent_inline_ref_type(leaf
, iref
, type
);
1201 if (type
== BTRFS_EXTENT_DATA_REF_KEY
) {
1202 struct btrfs_extent_data_ref
*dref
;
1203 dref
= (struct btrfs_extent_data_ref
*)(&iref
->offset
);
1204 btrfs_set_extent_data_ref_root(leaf
, dref
, root_objectid
);
1205 btrfs_set_extent_data_ref_objectid(leaf
, dref
, owner
);
1206 btrfs_set_extent_data_ref_offset(leaf
, dref
, offset
);
1207 btrfs_set_extent_data_ref_count(leaf
, dref
, refs_to_add
);
1208 } else if (type
== BTRFS_SHARED_DATA_REF_KEY
) {
1209 struct btrfs_shared_data_ref
*sref
;
1210 sref
= (struct btrfs_shared_data_ref
*)(iref
+ 1);
1211 btrfs_set_shared_data_ref_count(leaf
, sref
, refs_to_add
);
1212 btrfs_set_extent_inline_ref_offset(leaf
, iref
, parent
);
1213 } else if (type
== BTRFS_SHARED_BLOCK_REF_KEY
) {
1214 btrfs_set_extent_inline_ref_offset(leaf
, iref
, parent
);
1216 btrfs_set_extent_inline_ref_offset(leaf
, iref
, root_objectid
);
1218 btrfs_mark_buffer_dirty(leaf
);
1222 static int lookup_extent_backref(struct btrfs_trans_handle
*trans
,
1223 struct btrfs_root
*root
,
1224 struct btrfs_path
*path
,
1225 struct btrfs_extent_inline_ref
**ref_ret
,
1226 u64 bytenr
, u64 num_bytes
, u64 parent
,
1227 u64 root_objectid
, u64 owner
, u64 offset
)
1231 ret
= lookup_inline_extent_backref(trans
, root
, path
, ref_ret
,
1232 bytenr
, num_bytes
, parent
,
1233 root_objectid
, owner
, offset
, 0);
1237 btrfs_release_path(root
, path
);
1240 if (owner
< BTRFS_FIRST_FREE_OBJECTID
) {
1241 ret
= lookup_tree_block_ref(trans
, root
, path
, bytenr
, parent
,
1244 ret
= lookup_extent_data_ref(trans
, root
, path
, bytenr
, parent
,
1245 root_objectid
, owner
, offset
);
1250 static int update_inline_extent_backref(struct btrfs_trans_handle
*trans
,
1251 struct btrfs_root
*root
,
1252 struct btrfs_path
*path
,
1253 struct btrfs_extent_inline_ref
*iref
,
1256 struct extent_buffer
*leaf
;
1257 struct btrfs_extent_item
*ei
;
1258 struct btrfs_extent_data_ref
*dref
= NULL
;
1259 struct btrfs_shared_data_ref
*sref
= NULL
;
1268 leaf
= path
->nodes
[0];
1269 ei
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
1270 refs
= btrfs_extent_refs(leaf
, ei
);
1271 WARN_ON(refs_to_mod
< 0 && refs
+ refs_to_mod
<= 0);
1272 refs
+= refs_to_mod
;
1273 btrfs_set_extent_refs(leaf
, ei
, refs
);
1275 type
= btrfs_extent_inline_ref_type(leaf
, iref
);
1277 if (type
== BTRFS_EXTENT_DATA_REF_KEY
) {
1278 dref
= (struct btrfs_extent_data_ref
*)(&iref
->offset
);
1279 refs
= btrfs_extent_data_ref_count(leaf
, dref
);
1280 } else if (type
== BTRFS_SHARED_DATA_REF_KEY
) {
1281 sref
= (struct btrfs_shared_data_ref
*)(iref
+ 1);
1282 refs
= btrfs_shared_data_ref_count(leaf
, sref
);
1285 BUG_ON(refs_to_mod
!= -1);
1288 BUG_ON(refs_to_mod
< 0 && refs
< -refs_to_mod
);
1289 refs
+= refs_to_mod
;
1292 if (type
== BTRFS_EXTENT_DATA_REF_KEY
)
1293 btrfs_set_extent_data_ref_count(leaf
, dref
, refs
);
1295 btrfs_set_shared_data_ref_count(leaf
, sref
, refs
);
1297 size
= btrfs_extent_inline_ref_size(type
);
1298 item_size
= btrfs_item_size_nr(leaf
, path
->slots
[0]);
1299 ptr
= (unsigned long)iref
;
1300 end
= (unsigned long)ei
+ item_size
;
1301 if (ptr
+ size
< end
)
1302 memmove_extent_buffer(leaf
, ptr
, ptr
+ size
,
1305 ret
= btrfs_truncate_item(trans
, root
, path
, item_size
, 1);
1308 btrfs_mark_buffer_dirty(leaf
);
1312 static int insert_inline_extent_backref(struct btrfs_trans_handle
*trans
,
1313 struct btrfs_root
*root
,
1314 struct btrfs_path
*path
,
1315 u64 bytenr
, u64 num_bytes
, u64 parent
,
1316 u64 root_objectid
, u64 owner
,
1317 u64 offset
, int refs_to_add
)
1319 struct btrfs_extent_inline_ref
*iref
;
1322 ret
= lookup_inline_extent_backref(trans
, root
, path
, &iref
,
1323 bytenr
, num_bytes
, parent
,
1324 root_objectid
, owner
, offset
, 1);
1326 BUG_ON(owner
< BTRFS_FIRST_FREE_OBJECTID
);
1327 ret
= update_inline_extent_backref(trans
, root
, path
, iref
,
1329 } else if (ret
== -ENOENT
) {
1330 ret
= setup_inline_extent_backref(trans
, root
, path
, iref
,
1331 parent
, root_objectid
,
1332 owner
, offset
, refs_to_add
);
1337 static int insert_extent_backref(struct btrfs_trans_handle
*trans
,
1338 struct btrfs_root
*root
,
1339 struct btrfs_path
*path
,
1340 u64 bytenr
, u64 parent
, u64 root_objectid
,
1341 u64 owner
, u64 offset
, int refs_to_add
)
1345 if (owner
>= BTRFS_FIRST_FREE_OBJECTID
) {
1346 ret
= insert_extent_data_ref(trans
, root
, path
, bytenr
,
1347 parent
, root_objectid
,
1348 owner
, offset
, refs_to_add
);
1350 BUG_ON(refs_to_add
!= 1);
1351 ret
= insert_tree_block_ref(trans
, root
, path
, bytenr
,
1352 parent
, root_objectid
);
1357 static int remove_extent_backref(struct btrfs_trans_handle
*trans
,
1358 struct btrfs_root
*root
,
1359 struct btrfs_path
*path
,
1360 struct btrfs_extent_inline_ref
*iref
,
1361 int refs_to_drop
, int is_data
)
1365 BUG_ON(!is_data
&& refs_to_drop
!= 1);
1367 ret
= update_inline_extent_backref(trans
, root
, path
, iref
,
1369 } else if (is_data
) {
1370 ret
= remove_extent_data_ref(trans
, root
, path
, refs_to_drop
);
1372 ret
= btrfs_del_item(trans
, root
, path
);
1377 int btrfs_inc_extent_ref(struct btrfs_trans_handle
*trans
,
1378 struct btrfs_root
*root
,
1379 u64 bytenr
, u64 num_bytes
, u64 parent
,
1380 u64 root_objectid
, u64 owner
, u64 offset
)
1382 struct btrfs_path
*path
;
1383 struct extent_buffer
*leaf
;
1384 struct btrfs_extent_item
*item
;
1389 path
= btrfs_alloc_path();
1394 path
->leave_spinning
= 1;
1396 ret
= insert_inline_extent_backref(trans
, root
->fs_info
->extent_root
,
1397 path
, bytenr
, num_bytes
, parent
,
1398 root_objectid
, owner
, offset
, 1);
1402 if (ret
!= -EAGAIN
) {
1407 leaf
= path
->nodes
[0];
1408 item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_extent_item
);
1409 refs
= btrfs_extent_refs(leaf
, item
);
1410 btrfs_set_extent_refs(leaf
, item
, refs
+ 1);
1412 btrfs_mark_buffer_dirty(leaf
);
1413 btrfs_release_path(root
->fs_info
->extent_root
, path
);
1416 path
->leave_spinning
= 1;
1418 /* now insert the actual backref */
1419 ret
= insert_extent_backref(trans
, root
->fs_info
->extent_root
,
1420 path
, bytenr
, parent
, root_objectid
,
1425 btrfs_free_path(path
);
1426 finish_current_insert(trans
, root
->fs_info
->extent_root
);
1427 del_pending_extents(trans
, root
->fs_info
->extent_root
);
1432 int btrfs_extent_post_op(struct btrfs_trans_handle
*trans
,
1433 struct btrfs_root
*root
)
1435 finish_current_insert(trans
, root
->fs_info
->extent_root
);
1436 del_pending_extents(trans
, root
->fs_info
->extent_root
);
1440 int btrfs_lookup_extent_info(struct btrfs_trans_handle
*trans
,
1441 struct btrfs_root
*root
, u64 bytenr
,
1442 u64 num_bytes
, u64
*refs
, u64
*flags
)
1444 struct btrfs_path
*path
;
1446 struct btrfs_key key
;
1447 struct extent_buffer
*l
;
1448 struct btrfs_extent_item
*item
;
1453 WARN_ON(num_bytes
< root
->sectorsize
);
1454 path
= btrfs_alloc_path();
1456 key
.objectid
= bytenr
;
1457 key
.offset
= num_bytes
;
1458 btrfs_set_key_type(&key
, BTRFS_EXTENT_ITEM_KEY
);
1459 ret
= btrfs_search_slot(trans
, root
->fs_info
->extent_root
, &key
, path
,
1469 item_size
= btrfs_item_size_nr(l
, path
->slots
[0]);
1470 if (item_size
>= sizeof(*item
)) {
1471 item
= btrfs_item_ptr(l
, path
->slots
[0],
1472 struct btrfs_extent_item
);
1473 num_refs
= btrfs_extent_refs(l
, item
);
1474 extent_flags
= btrfs_extent_flags(l
, item
);
1476 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1477 struct btrfs_extent_item_v0
*ei0
;
1478 BUG_ON(item_size
!= sizeof(*ei0
));
1479 ei0
= btrfs_item_ptr(l
, path
->slots
[0],
1480 struct btrfs_extent_item_v0
);
1481 num_refs
= btrfs_extent_refs_v0(l
, ei0
);
1482 /* FIXME: this isn't correct for data */
1483 extent_flags
= BTRFS_BLOCK_FLAG_FULL_BACKREF
;
1488 item
= btrfs_item_ptr(l
, path
->slots
[0], struct btrfs_extent_item
);
1492 *flags
= extent_flags
;
1494 btrfs_free_path(path
);
1498 int btrfs_set_block_flags(struct btrfs_trans_handle
*trans
,
1499 struct btrfs_root
*root
,
1500 u64 bytenr
, u64 num_bytes
, u64 flags
)
1502 struct btrfs_path
*path
;
1504 struct btrfs_key key
;
1505 struct extent_buffer
*l
;
1506 struct btrfs_extent_item
*item
;
1509 WARN_ON(num_bytes
< root
->sectorsize
);
1510 path
= btrfs_alloc_path();
1512 key
.objectid
= bytenr
;
1513 key
.offset
= num_bytes
;
1514 btrfs_set_key_type(&key
, BTRFS_EXTENT_ITEM_KEY
);
1515 ret
= btrfs_search_slot(trans
, root
->fs_info
->extent_root
, &key
, path
,
1520 btrfs_print_leaf(root
, path
->nodes
[0]);
1521 printk("failed to find block number %Lu\n",
1522 (unsigned long long)bytenr
);
1526 item_size
= btrfs_item_size_nr(l
, path
->slots
[0]);
1527 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1528 if (item_size
< sizeof(*item
)) {
1529 ret
= convert_extent_item_v0(trans
, root
->fs_info
->extent_root
,
1535 item_size
= btrfs_item_size_nr(l
, path
->slots
[0]);
1538 BUG_ON(item_size
< sizeof(*item
));
1539 item
= btrfs_item_ptr(l
, path
->slots
[0], struct btrfs_extent_item
);
1540 flags
|= btrfs_extent_flags(l
, item
);
1541 btrfs_set_extent_flags(l
, item
, flags
);
1543 btrfs_free_path(path
);
1544 finish_current_insert(trans
, root
->fs_info
->extent_root
);
1545 del_pending_extents(trans
, root
->fs_info
->extent_root
);
1549 static int __btrfs_mod_ref(struct btrfs_trans_handle
*trans
,
1550 struct btrfs_root
*root
,
1551 struct extent_buffer
*buf
,
1552 int record_parent
, int inc
)
1559 struct btrfs_key key
;
1560 struct btrfs_file_extent_item
*fi
;
1564 int (*process_func
)(struct btrfs_trans_handle
*trans
,
1565 struct btrfs_root
*root
,
1566 u64
, u64
, u64
, u64
, u64
, u64
);
1568 ref_root
= btrfs_header_owner(buf
);
1569 nritems
= btrfs_header_nritems(buf
);
1570 level
= btrfs_header_level(buf
);
1572 if (!root
->ref_cows
&& level
== 0)
1576 process_func
= btrfs_inc_extent_ref
;
1578 process_func
= btrfs_free_extent
;
1581 parent
= buf
->start
;
1585 for (i
= 0; i
< nritems
; i
++) {
1588 btrfs_item_key_to_cpu(buf
, &key
, i
);
1589 if (btrfs_key_type(&key
) != BTRFS_EXTENT_DATA_KEY
)
1591 fi
= btrfs_item_ptr(buf
, i
,
1592 struct btrfs_file_extent_item
);
1593 if (btrfs_file_extent_type(buf
, fi
) ==
1594 BTRFS_FILE_EXTENT_INLINE
)
1596 bytenr
= btrfs_file_extent_disk_bytenr(buf
, fi
);
1600 num_bytes
= btrfs_file_extent_disk_num_bytes(buf
, fi
);
1601 key
.offset
-= btrfs_file_extent_offset(buf
, fi
);
1602 ret
= process_func(trans
, root
, bytenr
, num_bytes
,
1603 parent
, ref_root
, key
.objectid
,
1610 bytenr
= btrfs_node_blockptr(buf
, i
);
1611 num_bytes
= btrfs_level_size(root
, level
- 1);
1612 ret
= process_func(trans
, root
, bytenr
, num_bytes
,
1613 parent
, ref_root
, level
- 1, 0);
1626 int btrfs_inc_ref(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
1627 struct extent_buffer
*buf
, int record_parent
)
1629 return __btrfs_mod_ref(trans
, root
, buf
, record_parent
, 1);
1632 int btrfs_dec_ref(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
1633 struct extent_buffer
*buf
, int record_parent
)
1635 return __btrfs_mod_ref(trans
, root
, buf
, record_parent
, 0);
1638 static int write_one_cache_group(struct btrfs_trans_handle
*trans
,
1639 struct btrfs_root
*root
,
1640 struct btrfs_path
*path
,
1641 struct btrfs_block_group_cache
*cache
)
1645 struct btrfs_root
*extent_root
= root
->fs_info
->extent_root
;
1647 struct extent_buffer
*leaf
;
1649 ret
= btrfs_search_slot(trans
, extent_root
, &cache
->key
, path
, 0, 1);
1654 leaf
= path
->nodes
[0];
1655 bi
= btrfs_item_ptr_offset(leaf
, path
->slots
[0]);
1656 write_extent_buffer(leaf
, &cache
->item
, bi
, sizeof(cache
->item
));
1657 btrfs_mark_buffer_dirty(leaf
);
1658 btrfs_release_path(extent_root
, path
);
1660 finish_current_insert(trans
, extent_root
);
1661 pending_ret
= del_pending_extents(trans
, extent_root
);
1670 int btrfs_write_dirty_block_groups(struct btrfs_trans_handle
*trans
,
1671 struct btrfs_root
*root
)
1673 struct extent_io_tree
*block_group_cache
;
1674 struct btrfs_block_group_cache
*cache
;
1676 struct btrfs_path
*path
;
1682 block_group_cache
= &root
->fs_info
->block_group_cache
;
1683 path
= btrfs_alloc_path();
1688 ret
= find_first_extent_bit(block_group_cache
, last
,
1689 &start
, &end
, BLOCK_GROUP_DIRTY
);
1698 ret
= get_state_private(block_group_cache
, start
, &ptr
);
1701 clear_extent_bits(block_group_cache
, start
, end
,
1702 BLOCK_GROUP_DIRTY
, GFP_NOFS
);
1704 cache
= (struct btrfs_block_group_cache
*)(unsigned long)ptr
;
1705 ret
= write_one_cache_group(trans
, root
, path
, cache
);
1707 btrfs_free_path(path
);
1711 static struct btrfs_space_info
*__find_space_info(struct btrfs_fs_info
*info
,
1714 struct list_head
*head
= &info
->space_info
;
1715 struct list_head
*cur
;
1716 struct btrfs_space_info
*found
;
1717 list_for_each(cur
, head
) {
1718 found
= list_entry(cur
, struct btrfs_space_info
, list
);
1719 if (found
->flags
& flags
)
1726 static int update_space_info(struct btrfs_fs_info
*info
, u64 flags
,
1727 u64 total_bytes
, u64 bytes_used
,
1728 struct btrfs_space_info
**space_info
)
1730 struct btrfs_space_info
*found
;
1732 found
= __find_space_info(info
, flags
);
1734 found
->total_bytes
+= total_bytes
;
1735 found
->bytes_used
+= bytes_used
;
1736 if (found
->total_bytes
< found
->bytes_used
) {
1737 fprintf(stderr
, "warning, bad space info total_bytes "
1739 (unsigned long long)found
->total_bytes
,
1740 (unsigned long long)found
->bytes_used
);
1742 *space_info
= found
;
1745 found
= kmalloc(sizeof(*found
), GFP_NOFS
);
1749 list_add(&found
->list
, &info
->space_info
);
1750 found
->flags
= flags
;
1751 found
->total_bytes
= total_bytes
;
1752 found
->bytes_used
= bytes_used
;
1753 found
->bytes_pinned
= 0;
1755 *space_info
= found
;
1760 static void set_avail_alloc_bits(struct btrfs_fs_info
*fs_info
, u64 flags
)
1762 u64 extra_flags
= flags
& (BTRFS_BLOCK_GROUP_RAID0
|
1763 BTRFS_BLOCK_GROUP_RAID1
|
1764 BTRFS_BLOCK_GROUP_RAID10
|
1765 BTRFS_BLOCK_GROUP_DUP
);
1767 if (flags
& BTRFS_BLOCK_GROUP_DATA
)
1768 fs_info
->avail_data_alloc_bits
|= extra_flags
;
1769 if (flags
& BTRFS_BLOCK_GROUP_METADATA
)
1770 fs_info
->avail_metadata_alloc_bits
|= extra_flags
;
1771 if (flags
& BTRFS_BLOCK_GROUP_SYSTEM
)
1772 fs_info
->avail_system_alloc_bits
|= extra_flags
;
1776 static int do_chunk_alloc(struct btrfs_trans_handle
*trans
,
1777 struct btrfs_root
*extent_root
, u64 alloc_bytes
,
1780 struct btrfs_space_info
*space_info
;
1786 space_info
= __find_space_info(extent_root
->fs_info
, flags
);
1788 ret
= update_space_info(extent_root
->fs_info
, flags
,
1792 BUG_ON(!space_info
);
1794 if (space_info
->full
)
1797 thresh
= div_factor(space_info
->total_bytes
, 7);
1798 if ((space_info
->bytes_used
+ space_info
->bytes_pinned
+ alloc_bytes
) <
1802 ret
= btrfs_alloc_chunk(trans
, extent_root
, &start
, &num_bytes
,
1804 if (ret
== -ENOSPC
) {
1805 space_info
->full
= 1;
1811 ret
= btrfs_make_block_group(trans
, extent_root
, 0, space_info
->flags
,
1812 BTRFS_FIRST_CHUNK_TREE_OBJECTID
, start
, num_bytes
);
1817 static int update_block_group(struct btrfs_trans_handle
*trans
,
1818 struct btrfs_root
*root
,
1819 u64 bytenr
, u64 num_bytes
, int alloc
,
1822 struct btrfs_block_group_cache
*cache
;
1823 struct btrfs_fs_info
*info
= root
->fs_info
;
1824 u64 total
= num_bytes
;
1830 /* block accounting for super block */
1831 old_val
= btrfs_super_bytes_used(&info
->super_copy
);
1833 old_val
+= num_bytes
;
1835 old_val
-= num_bytes
;
1836 btrfs_set_super_bytes_used(&info
->super_copy
, old_val
);
1838 /* block accounting for root item */
1839 old_val
= btrfs_root_used(&root
->root_item
);
1841 old_val
+= num_bytes
;
1843 old_val
-= num_bytes
;
1844 btrfs_set_root_used(&root
->root_item
, old_val
);
1847 cache
= btrfs_lookup_block_group(info
, bytenr
);
1851 byte_in_group
= bytenr
- cache
->key
.objectid
;
1852 WARN_ON(byte_in_group
> cache
->key
.offset
);
1853 start
= cache
->key
.objectid
;
1854 end
= start
+ cache
->key
.offset
- 1;
1855 set_extent_bits(&info
->block_group_cache
, start
, end
,
1856 BLOCK_GROUP_DIRTY
, GFP_NOFS
);
1858 old_val
= btrfs_block_group_used(&cache
->item
);
1859 num_bytes
= min(total
, cache
->key
.offset
- byte_in_group
);
1862 old_val
+= num_bytes
;
1863 cache
->space_info
->bytes_used
+= num_bytes
;
1865 old_val
-= num_bytes
;
1866 cache
->space_info
->bytes_used
-= num_bytes
;
1868 set_extent_dirty(&info
->free_space_cache
,
1869 bytenr
, bytenr
+ num_bytes
- 1,
1873 btrfs_set_block_group_used(&cache
->item
, old_val
);
1875 bytenr
+= num_bytes
;
1880 static int update_pinned_extents(struct btrfs_root
*root
,
1881 u64 bytenr
, u64 num
, int pin
)
1884 struct btrfs_block_group_cache
*cache
;
1885 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
1888 set_extent_dirty(&fs_info
->pinned_extents
,
1889 bytenr
, bytenr
+ num
- 1, GFP_NOFS
);
1891 clear_extent_dirty(&fs_info
->pinned_extents
,
1892 bytenr
, bytenr
+ num
- 1, GFP_NOFS
);
1895 cache
= btrfs_lookup_block_group(fs_info
, bytenr
);
1897 len
= min((u64
)root
->sectorsize
, num
);
1901 len
= min(num
, cache
->key
.offset
-
1902 (bytenr
- cache
->key
.objectid
));
1904 cache
->pinned
+= len
;
1905 cache
->space_info
->bytes_pinned
+= len
;
1906 fs_info
->total_pinned
+= len
;
1908 cache
->pinned
-= len
;
1909 cache
->space_info
->bytes_pinned
-= len
;
1910 fs_info
->total_pinned
-= len
;
1919 int btrfs_copy_pinned(struct btrfs_root
*root
, struct extent_io_tree
*copy
)
1924 struct extent_io_tree
*pinned_extents
= &root
->fs_info
->pinned_extents
;
1928 ret
= find_first_extent_bit(pinned_extents
, last
,
1929 &start
, &end
, EXTENT_DIRTY
);
1932 set_extent_dirty(copy
, start
, end
, GFP_NOFS
);
1938 int btrfs_finish_extent_commit(struct btrfs_trans_handle
*trans
,
1939 struct btrfs_root
*root
,
1940 struct extent_io_tree
*unpin
)
1945 struct extent_io_tree
*free_space_cache
;
1946 free_space_cache
= &root
->fs_info
->free_space_cache
;
1949 ret
= find_first_extent_bit(unpin
, 0, &start
, &end
,
1953 update_pinned_extents(root
, start
, end
+ 1 - start
, 0);
1954 clear_extent_dirty(unpin
, start
, end
, GFP_NOFS
);
1955 set_extent_dirty(free_space_cache
, start
, end
, GFP_NOFS
);
1960 static int extent_root_pending_ops(struct btrfs_fs_info
*info
)
1966 ret
= find_first_extent_bit(&info
->extent_ins
, 0, &start
,
1967 &end
, EXTENT_LOCKED
);
1969 ret
= find_first_extent_bit(&info
->pending_del
, 0, &start
, &end
,
1975 static int finish_current_insert(struct btrfs_trans_handle
*trans
,
1976 struct btrfs_root
*extent_root
)
1981 struct btrfs_fs_info
*info
= extent_root
->fs_info
;
1982 struct btrfs_path
*path
;
1983 struct pending_extent_op
*extent_op
;
1984 struct btrfs_key key
;
1987 path
= btrfs_alloc_path();
1990 ret
= find_first_extent_bit(&info
->extent_ins
, 0, &start
,
1991 &end
, EXTENT_LOCKED
);
1995 ret
= get_state_private(&info
->extent_ins
, start
, &priv
);
1997 extent_op
= (struct pending_extent_op
*)(unsigned long)priv
;
1999 if (extent_op
->type
== PENDING_EXTENT_INSERT
) {
2000 key
.objectid
= start
;
2001 key
.offset
= end
+ 1 - start
;
2002 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
2003 ret
= alloc_reserved_tree_block(trans
, extent_root
,
2004 extent_root
->root_key
.objectid
,
2008 extent_op
->level
, &key
);
2013 clear_extent_bits(&info
->extent_ins
, start
, end
, EXTENT_LOCKED
,
2017 btrfs_free_path(path
);
2021 static int pin_down_bytes(struct btrfs_trans_handle
*trans
,
2022 struct btrfs_root
*root
,
2023 u64 bytenr
, u64 num_bytes
, int is_data
)
2026 struct extent_buffer
*buf
;
2031 buf
= btrfs_find_tree_block(root
, bytenr
, num_bytes
);
2035 /* we can reuse a block if it hasn't been written
2036 * and it is from this transaction. We can't
2037 * reuse anything from the tree log root because
2038 * it has tiny sub-transactions.
2040 if (btrfs_buffer_uptodate(buf
, 0)) {
2041 u64 header_owner
= btrfs_header_owner(buf
);
2042 u64 header_transid
= btrfs_header_generation(buf
);
2043 if (header_owner
!= BTRFS_TREE_LOG_OBJECTID
&&
2044 header_transid
== trans
->transid
&&
2045 !btrfs_header_flag(buf
, BTRFS_HEADER_FLAG_WRITTEN
)) {
2046 clean_tree_block(NULL
, root
, buf
);
2047 free_extent_buffer(buf
);
2051 free_extent_buffer(buf
);
2053 update_pinned_extents(root
, bytenr
, num_bytes
, 1);
2059 void btrfs_pin_extent(struct btrfs_fs_info
*fs_info
,
2060 u64 bytenr
, u64 num_bytes
)
2062 update_pinned_extents(fs_info
->extent_root
, bytenr
, num_bytes
, 1);
2066 * remove an extent from the root, returns 0 on success
2068 static int __free_extent(struct btrfs_trans_handle
*trans
,
2069 struct btrfs_root
*root
,
2070 u64 bytenr
, u64 num_bytes
, u64 parent
,
2071 u64 root_objectid
, u64 owner_objectid
,
2072 u64 owner_offset
, int refs_to_drop
)
2075 struct btrfs_key key
;
2076 struct btrfs_path
*path
;
2077 struct btrfs_extent_ops
*ops
= root
->fs_info
->extent_ops
;
2078 struct btrfs_root
*extent_root
= root
->fs_info
->extent_root
;
2079 struct extent_buffer
*leaf
;
2080 struct btrfs_extent_item
*ei
;
2081 struct btrfs_extent_inline_ref
*iref
;
2084 int extent_slot
= 0;
2085 int found_extent
= 0;
2090 if (root
->fs_info
->free_extent_hook
) {
2091 root
->fs_info
->free_extent_hook(trans
, root
, bytenr
, num_bytes
,
2092 parent
, root_objectid
, owner_objectid
,
2093 owner_offset
, refs_to_drop
);
2096 path
= btrfs_alloc_path();
2101 path
->leave_spinning
= 1;
2103 is_data
= owner_objectid
>= BTRFS_FIRST_FREE_OBJECTID
;
2104 BUG_ON(!is_data
&& refs_to_drop
!= 1);
2106 ret
= lookup_extent_backref(trans
, extent_root
, path
, &iref
,
2107 bytenr
, num_bytes
, parent
,
2108 root_objectid
, owner_objectid
,
2111 extent_slot
= path
->slots
[0];
2112 while (extent_slot
>= 0) {
2113 btrfs_item_key_to_cpu(path
->nodes
[0], &key
,
2115 if (key
.objectid
!= bytenr
)
2117 if (key
.type
== BTRFS_EXTENT_ITEM_KEY
&&
2118 key
.offset
== num_bytes
) {
2122 if (path
->slots
[0] - extent_slot
> 5)
2126 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2127 item_size
= btrfs_item_size_nr(path
->nodes
[0], extent_slot
);
2128 if (found_extent
&& item_size
< sizeof(*ei
))
2131 if (!found_extent
) {
2133 ret
= remove_extent_backref(trans
, extent_root
, path
,
2137 btrfs_release_path(extent_root
, path
);
2138 path
->leave_spinning
= 1;
2140 key
.objectid
= bytenr
;
2141 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
2142 key
.offset
= num_bytes
;
2144 ret
= btrfs_search_slot(trans
, extent_root
,
2147 printk(KERN_ERR
"umm, got %d back from search"
2148 ", was looking for %llu\n", ret
,
2149 (unsigned long long)bytenr
);
2150 btrfs_print_leaf(extent_root
, path
->nodes
[0]);
2153 extent_slot
= path
->slots
[0];
2156 printk(KERN_ERR
"btrfs unable to find ref byte nr %llu "
2157 "parent %llu root %llu owner %llu offset %llu\n",
2158 (unsigned long long)bytenr
,
2159 (unsigned long long)parent
,
2160 (unsigned long long)root_objectid
,
2161 (unsigned long long)owner_objectid
,
2162 (unsigned long long)owner_offset
);
2167 leaf
= path
->nodes
[0];
2168 item_size
= btrfs_item_size_nr(leaf
, extent_slot
);
2169 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2170 if (item_size
< sizeof(*ei
)) {
2171 BUG_ON(found_extent
|| extent_slot
!= path
->slots
[0]);
2172 ret
= convert_extent_item_v0(trans
, extent_root
, path
,
2176 btrfs_release_path(extent_root
, path
);
2177 path
->leave_spinning
= 1;
2179 key
.objectid
= bytenr
;
2180 key
.type
= BTRFS_EXTENT_ITEM_KEY
;
2181 key
.offset
= num_bytes
;
2183 ret
= btrfs_search_slot(trans
, extent_root
, &key
, path
,
2186 printk(KERN_ERR
"umm, got %d back from search"
2187 ", was looking for %llu\n", ret
,
2188 (unsigned long long)bytenr
);
2189 btrfs_print_leaf(extent_root
, path
->nodes
[0]);
2192 extent_slot
= path
->slots
[0];
2193 leaf
= path
->nodes
[0];
2194 item_size
= btrfs_item_size_nr(leaf
, extent_slot
);
2197 BUG_ON(item_size
< sizeof(*ei
));
2198 ei
= btrfs_item_ptr(leaf
, extent_slot
,
2199 struct btrfs_extent_item
);
2200 if (owner_objectid
< BTRFS_FIRST_FREE_OBJECTID
) {
2201 struct btrfs_tree_block_info
*bi
;
2202 BUG_ON(item_size
< sizeof(*ei
) + sizeof(*bi
));
2203 bi
= (struct btrfs_tree_block_info
*)(ei
+ 1);
2204 WARN_ON(owner_objectid
!= btrfs_tree_block_level(leaf
, bi
));
2207 refs
= btrfs_extent_refs(leaf
, ei
);
2208 BUG_ON(refs
< refs_to_drop
);
2209 refs
-= refs_to_drop
;
2213 * In the case of inline back ref, reference count will
2214 * be updated by remove_extent_backref
2217 BUG_ON(!found_extent
);
2219 btrfs_set_extent_refs(leaf
, ei
, refs
);
2220 btrfs_mark_buffer_dirty(leaf
);
2223 ret
= remove_extent_backref(trans
, extent_root
, path
,
2233 BUG_ON(is_data
&& refs_to_drop
!=
2234 extent_data_ref_count(root
, path
, iref
));
2236 BUG_ON(path
->slots
[0] != extent_slot
);
2238 BUG_ON(path
->slots
[0] != extent_slot
+ 1);
2239 path
->slots
[0] = extent_slot
;
2244 if (ops
&& ops
->free_extent
) {
2245 ret
= ops
->free_extent(root
, bytenr
, num_bytes
);
2253 ret
= pin_down_bytes(trans
, root
, bytenr
, num_bytes
,
2260 ret
= btrfs_del_items(trans
, extent_root
, path
, path
->slots
[0],
2263 btrfs_release_path(extent_root
, path
);
2266 ret
= btrfs_del_csums(trans
, root
, bytenr
, num_bytes
);
2270 update_block_group(trans
, root
, bytenr
, num_bytes
, 0, mark_free
);
2273 btrfs_free_path(path
);
2274 finish_current_insert(trans
, extent_root
);
2279 * find all the blocks marked as pending in the radix tree and remove
2280 * them from the extent map
2282 static int del_pending_extents(struct btrfs_trans_handle
*trans
, struct
2283 btrfs_root
*extent_root
)
2290 struct extent_io_tree
*pending_del
;
2291 struct extent_io_tree
*extent_ins
;
2292 struct pending_extent_op
*extent_op
;
2294 extent_ins
= &extent_root
->fs_info
->extent_ins
;
2295 pending_del
= &extent_root
->fs_info
->pending_del
;
2298 ret
= find_first_extent_bit(pending_del
, 0, &start
, &end
,
2303 ret
= get_state_private(pending_del
, start
, &priv
);
2305 extent_op
= (struct pending_extent_op
*)(unsigned long)priv
;
2307 clear_extent_bits(pending_del
, start
, end
, EXTENT_LOCKED
,
2310 if (!test_range_bit(extent_ins
, start
, end
,
2311 EXTENT_LOCKED
, 0)) {
2312 ret
= __free_extent(trans
, extent_root
,
2313 start
, end
+ 1 - start
, 0,
2314 extent_root
->root_key
.objectid
,
2315 extent_op
->level
, 0, 1);
2319 ret
= get_state_private(extent_ins
, start
, &priv
);
2321 extent_op
= (struct pending_extent_op
*)
2322 (unsigned long)priv
;
2324 clear_extent_bits(extent_ins
, start
, end
,
2325 EXTENT_LOCKED
, GFP_NOFS
);
2327 if (extent_op
->type
== PENDING_BACKREF_UPDATE
)
2339 * remove an extent from the root, returns 0 on success
2342 int btrfs_free_extent(struct btrfs_trans_handle
*trans
,
2343 struct btrfs_root
*root
,
2344 u64 bytenr
, u64 num_bytes
, u64 parent
,
2345 u64 root_objectid
, u64 owner
, u64 offset
)
2347 struct btrfs_root
*extent_root
= root
->fs_info
->extent_root
;
2351 WARN_ON(num_bytes
< root
->sectorsize
);
2352 if (root
== extent_root
) {
2353 struct pending_extent_op
*extent_op
;
2355 extent_op
= kmalloc(sizeof(*extent_op
), GFP_NOFS
);
2358 extent_op
->type
= PENDING_EXTENT_DELETE
;
2359 extent_op
->bytenr
= bytenr
;
2360 extent_op
->num_bytes
= num_bytes
;
2361 extent_op
->level
= (int)owner
;
2363 set_extent_bits(&root
->fs_info
->pending_del
,
2364 bytenr
, bytenr
+ num_bytes
- 1,
2365 EXTENT_LOCKED
, GFP_NOFS
);
2366 set_state_private(&root
->fs_info
->pending_del
,
2367 bytenr
, (unsigned long)extent_op
);
2370 ret
= __free_extent(trans
, root
, bytenr
, num_bytes
, parent
,
2371 root_objectid
, owner
, offset
, 1);
2372 pending_ret
= del_pending_extents(trans
, root
->fs_info
->extent_root
);
2373 return ret
? ret
: pending_ret
;
2376 static u64
stripe_align(struct btrfs_root
*root
, u64 val
)
2378 u64 mask
= ((u64
)root
->stripesize
- 1);
2379 u64 ret
= (val
+ mask
) & ~mask
;
2384 * walks the btree of allocated extents and find a hole of a given size.
2385 * The key ins is changed to record the hole:
2386 * ins->objectid == block start
2387 * ins->flags = BTRFS_EXTENT_ITEM_KEY
2388 * ins->offset == number of blocks
2389 * Any available blocks before search_start are skipped.
2391 static int noinline
find_free_extent(struct btrfs_trans_handle
*trans
,
2392 struct btrfs_root
*orig_root
,
2393 u64 num_bytes
, u64 empty_size
,
2394 u64 search_start
, u64 search_end
,
2395 u64 hint_byte
, struct btrfs_key
*ins
,
2396 u64 exclude_start
, u64 exclude_nr
,
2400 u64 orig_search_start
= search_start
;
2401 struct btrfs_root
* root
= orig_root
->fs_info
->extent_root
;
2402 struct btrfs_fs_info
*info
= root
->fs_info
;
2403 u64 total_needed
= num_bytes
;
2404 struct btrfs_block_group_cache
*block_group
;
2408 WARN_ON(num_bytes
< root
->sectorsize
);
2409 btrfs_set_key_type(ins
, BTRFS_EXTENT_ITEM_KEY
);
2412 block_group
= btrfs_lookup_first_block_group(info
, hint_byte
);
2414 hint_byte
= search_start
;
2415 block_group
= btrfs_find_block_group(root
, block_group
,
2416 hint_byte
, data
, 1);
2418 block_group
= btrfs_find_block_group(root
,
2420 search_start
, data
, 1);
2423 total_needed
+= empty_size
;
2427 block_group
= btrfs_lookup_first_block_group(info
,
2430 block_group
= btrfs_lookup_first_block_group(info
,
2433 ret
= find_search_start(root
, &block_group
, &search_start
,
2434 total_needed
, data
);
2438 search_start
= stripe_align(root
, search_start
);
2439 ins
->objectid
= search_start
;
2440 ins
->offset
= num_bytes
;
2442 if (ins
->objectid
+ num_bytes
>
2443 block_group
->key
.objectid
+ block_group
->key
.offset
) {
2444 search_start
= block_group
->key
.objectid
+
2445 block_group
->key
.offset
;
2449 if (test_range_bit(&info
->extent_ins
, ins
->objectid
,
2450 ins
->objectid
+ num_bytes
-1, EXTENT_LOCKED
, 0)) {
2451 search_start
= ins
->objectid
+ num_bytes
;
2455 if (test_range_bit(&info
->pinned_extents
, ins
->objectid
,
2456 ins
->objectid
+ num_bytes
-1, EXTENT_DIRTY
, 0)) {
2457 search_start
= ins
->objectid
+ num_bytes
;
2461 if (exclude_nr
> 0 && (ins
->objectid
+ num_bytes
> exclude_start
&&
2462 ins
->objectid
< exclude_start
+ exclude_nr
)) {
2463 search_start
= exclude_start
+ exclude_nr
;
2467 if (!(data
& BTRFS_BLOCK_GROUP_DATA
)) {
2468 block_group
= btrfs_lookup_block_group(info
, ins
->objectid
);
2470 trans
->block_group
= block_group
;
2472 ins
->offset
= num_bytes
;
2476 block_group
= btrfs_lookup_first_block_group(info
, search_start
);
2478 search_start
= orig_search_start
;
2485 total_needed
-= empty_size
;
2491 block_group
= btrfs_find_block_group(root
, block_group
,
2492 search_start
, data
, 0);
2499 static int btrfs_reserve_extent(struct btrfs_trans_handle
*trans
,
2500 struct btrfs_root
*root
,
2501 u64 num_bytes
, u64 empty_size
,
2502 u64 hint_byte
, u64 search_end
,
2503 struct btrfs_key
*ins
, int data
)
2506 u64 search_start
= 0;
2508 struct btrfs_fs_info
*info
= root
->fs_info
;
2510 if (info
->extent_ops
) {
2511 struct btrfs_extent_ops
*ops
= info
->extent_ops
;
2512 ret
= ops
->alloc_extent(root
, num_bytes
, hint_byte
, ins
);
2518 alloc_profile
= info
->avail_data_alloc_bits
&
2519 info
->data_alloc_profile
;
2520 data
= BTRFS_BLOCK_GROUP_DATA
| alloc_profile
;
2521 } else if ((info
->system_allocs
> 0 || root
== info
->chunk_root
) &&
2522 info
->system_allocs
>= 0) {
2523 alloc_profile
= info
->avail_system_alloc_bits
&
2524 info
->system_alloc_profile
;
2525 data
= BTRFS_BLOCK_GROUP_SYSTEM
| alloc_profile
;
2527 alloc_profile
= info
->avail_metadata_alloc_bits
&
2528 info
->metadata_alloc_profile
;
2529 data
= BTRFS_BLOCK_GROUP_METADATA
| alloc_profile
;
2532 if (root
->ref_cows
) {
2533 if (!(data
& BTRFS_BLOCK_GROUP_METADATA
)) {
2534 ret
= do_chunk_alloc(trans
, root
->fs_info
->extent_root
,
2536 BTRFS_BLOCK_GROUP_METADATA
);
2539 ret
= do_chunk_alloc(trans
, root
->fs_info
->extent_root
,
2540 num_bytes
+ 2 * 1024 * 1024, data
);
2544 WARN_ON(num_bytes
< root
->sectorsize
);
2545 ret
= find_free_extent(trans
, root
, num_bytes
, empty_size
,
2546 search_start
, search_end
, hint_byte
, ins
,
2547 trans
->alloc_exclude_start
,
2548 trans
->alloc_exclude_nr
, data
);
2551 clear_extent_dirty(&root
->fs_info
->free_space_cache
,
2552 ins
->objectid
, ins
->objectid
+ ins
->offset
- 1,
2557 static int alloc_reserved_tree_block(struct btrfs_trans_handle
*trans
,
2558 struct btrfs_root
*root
,
2559 u64 root_objectid
, u64 generation
,
2560 u64 flags
, struct btrfs_disk_key
*key
,
2561 int level
, struct btrfs_key
*ins
)
2564 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
2565 struct btrfs_extent_item
*extent_item
;
2566 struct btrfs_tree_block_info
*block_info
;
2567 struct btrfs_extent_inline_ref
*iref
;
2568 struct btrfs_path
*path
;
2569 struct extent_buffer
*leaf
;
2570 u32 size
= sizeof(*extent_item
) + sizeof(*block_info
) + sizeof(*iref
);
2572 path
= btrfs_alloc_path();
2575 path
->leave_spinning
= 1;
2576 ret
= btrfs_insert_empty_item(trans
, fs_info
->extent_root
, path
,
2580 leaf
= path
->nodes
[0];
2581 extent_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
2582 struct btrfs_extent_item
);
2583 btrfs_set_extent_refs(leaf
, extent_item
, 1);
2584 btrfs_set_extent_generation(leaf
, extent_item
, generation
);
2585 btrfs_set_extent_flags(leaf
, extent_item
,
2586 flags
| BTRFS_EXTENT_FLAG_TREE_BLOCK
);
2587 block_info
= (struct btrfs_tree_block_info
*)(extent_item
+ 1);
2589 btrfs_set_tree_block_key(leaf
, block_info
, key
);
2590 btrfs_set_tree_block_level(leaf
, block_info
, level
);
2592 iref
= (struct btrfs_extent_inline_ref
*)(block_info
+ 1);
2593 btrfs_set_extent_inline_ref_type(leaf
, iref
, BTRFS_TREE_BLOCK_REF_KEY
);
2594 btrfs_set_extent_inline_ref_offset(leaf
, iref
, root_objectid
);
2596 btrfs_mark_buffer_dirty(leaf
);
2597 btrfs_free_path(path
);
2599 ret
= update_block_group(trans
, root
, ins
->objectid
, ins
->offset
,
2604 static int alloc_tree_block(struct btrfs_trans_handle
*trans
,
2605 struct btrfs_root
*root
, u64 num_bytes
,
2606 u64 root_objectid
, u64 generation
,
2607 u64 flags
, struct btrfs_disk_key
*key
,
2608 int level
, u64 empty_size
, u64 hint_byte
,
2609 u64 search_end
, struct btrfs_key
*ins
)
2612 ret
= btrfs_reserve_extent(trans
, root
, num_bytes
, empty_size
,
2613 hint_byte
, search_end
, ins
, 0);
2616 if (root_objectid
== BTRFS_EXTENT_TREE_OBJECTID
) {
2617 struct pending_extent_op
*extent_op
;
2619 extent_op
= kmalloc(sizeof(*extent_op
), GFP_NOFS
);
2622 extent_op
->type
= PENDING_EXTENT_INSERT
;
2623 extent_op
->bytenr
= ins
->objectid
;
2624 extent_op
->num_bytes
= ins
->offset
;
2625 extent_op
->level
= level
;
2626 extent_op
->flags
= flags
;
2627 memcpy(&extent_op
->key
, key
, sizeof(*key
));
2629 set_extent_bits(&root
->fs_info
->extent_ins
, ins
->objectid
,
2630 ins
->objectid
+ ins
->offset
- 1,
2631 EXTENT_LOCKED
, GFP_NOFS
);
2632 set_state_private(&root
->fs_info
->extent_ins
,
2633 ins
->objectid
, (unsigned long)extent_op
);
2635 ret
= alloc_reserved_tree_block(trans
, root
, root_objectid
,
2638 finish_current_insert(trans
, root
->fs_info
->extent_root
);
2639 del_pending_extents(trans
, root
->fs_info
->extent_root
);
2645 * helper function to allocate a block for a given tree
2646 * returns the tree buffer or NULL.
2648 struct extent_buffer
*btrfs_alloc_free_block(struct btrfs_trans_handle
*trans
,
2649 struct btrfs_root
*root
,
2650 u32 blocksize
, u64 root_objectid
,
2651 struct btrfs_disk_key
*key
, int level
,
2652 u64 hint
, u64 empty_size
)
2654 struct btrfs_key ins
;
2656 struct extent_buffer
*buf
;
2658 ret
= alloc_tree_block(trans
, root
, blocksize
, root_objectid
,
2659 trans
->transid
, 0, key
, level
,
2660 empty_size
, hint
, (u64
)-1, &ins
);
2663 return ERR_PTR(ret
);
2666 buf
= btrfs_find_create_tree_block(root
, ins
.objectid
, blocksize
);
2668 btrfs_free_extent(trans
, root
, ins
.objectid
, ins
.offset
,
2669 0, root
->root_key
.objectid
, level
, 0);
2671 return ERR_PTR(-ENOMEM
);
2673 btrfs_set_buffer_uptodate(buf
);
2674 trans
->blocks_used
++;
2681 static int noinline
drop_leaf_ref(struct btrfs_trans_handle
*trans
,
2682 struct btrfs_root
*root
,
2683 struct extent_buffer
*leaf
)
2686 u64 leaf_generation
;
2687 struct btrfs_key key
;
2688 struct btrfs_file_extent_item
*fi
;
2693 BUG_ON(!btrfs_is_leaf(leaf
));
2694 nritems
= btrfs_header_nritems(leaf
);
2695 leaf_owner
= btrfs_header_owner(leaf
);
2696 leaf_generation
= btrfs_header_generation(leaf
);
2698 for (i
= 0; i
< nritems
; i
++) {
2701 btrfs_item_key_to_cpu(leaf
, &key
, i
);
2702 if (btrfs_key_type(&key
) != BTRFS_EXTENT_DATA_KEY
)
2704 fi
= btrfs_item_ptr(leaf
, i
, struct btrfs_file_extent_item
);
2705 if (btrfs_file_extent_type(leaf
, fi
) ==
2706 BTRFS_FILE_EXTENT_INLINE
)
2709 * FIXME make sure to insert a trans record that
2710 * repeats the snapshot del on crash
2712 disk_bytenr
= btrfs_file_extent_disk_bytenr(leaf
, fi
);
2713 if (disk_bytenr
== 0)
2715 ret
= btrfs_free_extent(trans
, root
, disk_bytenr
,
2716 btrfs_file_extent_disk_num_bytes(leaf
, fi
),
2717 leaf
->start
, leaf_owner
, leaf_generation
,
2724 static void noinline
reada_walk_down(struct btrfs_root
*root
,
2725 struct extent_buffer
*node
,
2738 nritems
= btrfs_header_nritems(node
);
2739 level
= btrfs_header_level(node
);
2743 for (i
= slot
; i
< nritems
&& skipped
< 32; i
++) {
2744 bytenr
= btrfs_node_blockptr(node
, i
);
2745 if (last
&& ((bytenr
> last
&& bytenr
- last
> 32 * 1024) ||
2746 (last
> bytenr
&& last
- bytenr
> 32 * 1024))) {
2750 blocksize
= btrfs_level_size(root
, level
- 1);
2752 ret
= btrfs_lookup_extent_ref(NULL
, root
, bytenr
,
2760 mutex_unlock(&root
->fs_info
->fs_mutex
);
2761 ret
= readahead_tree_block(root
, bytenr
, blocksize
,
2762 btrfs_node_ptr_generation(node
, i
));
2763 last
= bytenr
+ blocksize
;
2765 mutex_lock(&root
->fs_info
->fs_mutex
);
2772 * helper function for drop_snapshot, this walks down the tree dropping ref
2773 * counts as it goes.
2775 static int noinline
walk_down_tree(struct btrfs_trans_handle
*trans
,
2776 struct btrfs_root
*root
,
2777 struct btrfs_path
*path
, int *level
)
2783 struct extent_buffer
*next
;
2784 struct extent_buffer
*cur
;
2785 struct extent_buffer
*parent
;
2790 WARN_ON(*level
< 0);
2791 WARN_ON(*level
>= BTRFS_MAX_LEVEL
);
2792 ret
= btrfs_lookup_extent_ref(trans
, root
,
2793 path
->nodes
[*level
]->start
,
2794 path
->nodes
[*level
]->len
, &refs
);
2800 * walk down to the last node level and free all the leaves
2802 while(*level
>= 0) {
2803 WARN_ON(*level
< 0);
2804 WARN_ON(*level
>= BTRFS_MAX_LEVEL
);
2805 cur
= path
->nodes
[*level
];
2807 if (btrfs_header_level(cur
) != *level
)
2810 if (path
->slots
[*level
] >=
2811 btrfs_header_nritems(cur
))
2814 ret
= drop_leaf_ref(trans
, root
, cur
);
2818 bytenr
= btrfs_node_blockptr(cur
, path
->slots
[*level
]);
2819 ptr_gen
= btrfs_node_ptr_generation(cur
, path
->slots
[*level
]);
2820 blocksize
= btrfs_level_size(root
, *level
- 1);
2821 ret
= btrfs_lookup_extent_ref(trans
, root
, bytenr
, blocksize
,
2825 parent
= path
->nodes
[*level
];
2826 root_owner
= btrfs_header_owner(parent
);
2827 root_gen
= btrfs_header_generation(parent
);
2828 path
->slots
[*level
]++;
2829 ret
= btrfs_free_extent(trans
, root
, bytenr
, blocksize
,
2830 parent
->start
, root_owner
,
2831 root_gen
, *level
- 1, 1);
2835 next
= btrfs_find_tree_block(root
, bytenr
, blocksize
);
2836 if (!next
|| !btrfs_buffer_uptodate(next
, ptr_gen
)) {
2837 free_extent_buffer(next
);
2838 reada_walk_down(root
, cur
, path
->slots
[*level
]);
2839 mutex_unlock(&root
->fs_info
->fs_mutex
);
2840 next
= read_tree_block(root
, bytenr
, blocksize
,
2842 mutex_lock(&root
->fs_info
->fs_mutex
);
2844 WARN_ON(*level
<= 0);
2845 if (path
->nodes
[*level
-1])
2846 free_extent_buffer(path
->nodes
[*level
-1]);
2847 path
->nodes
[*level
-1] = next
;
2848 *level
= btrfs_header_level(next
);
2849 path
->slots
[*level
] = 0;
2852 WARN_ON(*level
< 0);
2853 WARN_ON(*level
>= BTRFS_MAX_LEVEL
);
2855 if (path
->nodes
[*level
] == root
->node
) {
2856 root_owner
= root
->root_key
.objectid
;
2857 parent
= path
->nodes
[*level
];
2859 parent
= path
->nodes
[*level
+ 1];
2860 root_owner
= btrfs_header_owner(parent
);
2863 root_gen
= btrfs_header_generation(parent
);
2864 ret
= btrfs_free_extent(trans
, root
, path
->nodes
[*level
]->start
,
2865 path
->nodes
[*level
]->len
, parent
->start
,
2866 root_owner
, root_gen
, *level
, 1);
2867 free_extent_buffer(path
->nodes
[*level
]);
2868 path
->nodes
[*level
] = NULL
;
2875 * helper for dropping snapshots. This walks back up the tree in the path
2876 * to find the first node higher up where we haven't yet gone through
2879 static int noinline
walk_up_tree(struct btrfs_trans_handle
*trans
,
2880 struct btrfs_root
*root
,
2881 struct btrfs_path
*path
, int *level
)
2885 struct btrfs_root_item
*root_item
= &root
->root_item
;
2890 for(i
= *level
; i
< BTRFS_MAX_LEVEL
- 1 && path
->nodes
[i
]; i
++) {
2891 slot
= path
->slots
[i
];
2892 if (slot
< btrfs_header_nritems(path
->nodes
[i
]) - 1) {
2893 struct extent_buffer
*node
;
2894 struct btrfs_disk_key disk_key
;
2895 node
= path
->nodes
[i
];
2898 WARN_ON(*level
== 0);
2899 btrfs_node_key(node
, &disk_key
, path
->slots
[i
]);
2900 memcpy(&root_item
->drop_progress
,
2901 &disk_key
, sizeof(disk_key
));
2902 root_item
->drop_level
= i
;
2905 struct extent_buffer
*parent
;
2906 if (path
->nodes
[*level
] == root
->node
)
2907 parent
= path
->nodes
[*level
];
2909 parent
= path
->nodes
[*level
+ 1];
2911 root_owner
= btrfs_header_owner(parent
);
2912 root_gen
= btrfs_header_generation(parent
);
2913 ret
= btrfs_free_extent(trans
, root
,
2914 path
->nodes
[*level
]->start
,
2915 path
->nodes
[*level
]->len
,
2916 parent
->start
, root_owner
,
2917 root_gen
, *level
, 1);
2919 free_extent_buffer(path
->nodes
[*level
]);
2920 path
->nodes
[*level
] = NULL
;
2928 * drop the reference count on the tree rooted at 'snap'. This traverses
2929 * the tree freeing any blocks that have a ref count of zero after being
2932 int btrfs_drop_snapshot(struct btrfs_trans_handle
*trans
, struct btrfs_root
2938 struct btrfs_path
*path
;
2941 struct btrfs_root_item
*root_item
= &root
->root_item
;
2943 path
= btrfs_alloc_path();
2946 level
= btrfs_header_level(root
->node
);
2948 if (btrfs_disk_key_objectid(&root_item
->drop_progress
) == 0) {
2949 path
->nodes
[level
] = root
->node
;
2950 extent_buffer_get(root
->node
);
2951 path
->slots
[level
] = 0;
2953 struct btrfs_key key
;
2954 struct btrfs_disk_key found_key
;
2955 struct extent_buffer
*node
;
2957 btrfs_disk_key_to_cpu(&key
, &root_item
->drop_progress
);
2958 level
= root_item
->drop_level
;
2959 path
->lowest_level
= level
;
2960 wret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
2965 node
= path
->nodes
[level
];
2966 btrfs_node_key(node
, &found_key
, path
->slots
[level
]);
2967 WARN_ON(memcmp(&found_key
, &root_item
->drop_progress
,
2968 sizeof(found_key
)));
2971 wret
= walk_down_tree(trans
, root
, path
, &level
);
2977 wret
= walk_up_tree(trans
, root
, path
, &level
);
2987 for (i
= 0; i
<= orig_level
; i
++) {
2988 if (path
->nodes
[i
]) {
2989 free_extent_buffer(path
->nodes
[i
]);
2990 path
->nodes
[i
] = NULL
;
2994 btrfs_free_path(path
);
3000 int btrfs_free_block_groups(struct btrfs_fs_info
*info
)
3007 ret
= find_first_extent_bit(&info
->block_group_cache
, 0,
3008 &start
, &end
, (unsigned int)-1);
3011 ret
= get_state_private(&info
->block_group_cache
, start
, &ptr
);
3013 kfree((void *)(unsigned long)ptr
);
3014 clear_extent_bits(&info
->block_group_cache
, start
,
3015 end
, (unsigned int)-1, GFP_NOFS
);
3018 ret
= find_first_extent_bit(&info
->free_space_cache
, 0,
3019 &start
, &end
, EXTENT_DIRTY
);
3022 clear_extent_dirty(&info
->free_space_cache
, start
,
3028 int find_first_block_group(struct btrfs_root
*root
, struct btrfs_path
*path
,
3029 struct btrfs_key
*key
)
3032 struct btrfs_key found_key
;
3033 struct extent_buffer
*leaf
;
3036 ret
= btrfs_search_slot(NULL
, root
, key
, path
, 0, 0);
3040 slot
= path
->slots
[0];
3041 leaf
= path
->nodes
[0];
3042 if (slot
>= btrfs_header_nritems(leaf
)) {
3043 ret
= btrfs_next_leaf(root
, path
);
3050 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
3052 if (found_key
.objectid
>= key
->objectid
&&
3053 found_key
.type
== BTRFS_BLOCK_GROUP_ITEM_KEY
)
3062 int btrfs_read_block_groups(struct btrfs_root
*root
)
3064 struct btrfs_path
*path
;
3067 struct btrfs_block_group_cache
*cache
;
3068 struct btrfs_fs_info
*info
= root
->fs_info
;
3069 struct btrfs_space_info
*space_info
;
3070 struct extent_io_tree
*block_group_cache
;
3071 struct btrfs_key key
;
3072 struct btrfs_key found_key
;
3073 struct extent_buffer
*leaf
;
3075 block_group_cache
= &info
->block_group_cache
;
3077 root
= info
->extent_root
;
3080 btrfs_set_key_type(&key
, BTRFS_BLOCK_GROUP_ITEM_KEY
);
3081 path
= btrfs_alloc_path();
3086 ret
= find_first_block_group(root
, path
, &key
);
3094 leaf
= path
->nodes
[0];
3095 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
3096 cache
= kzalloc(sizeof(*cache
), GFP_NOFS
);
3102 read_extent_buffer(leaf
, &cache
->item
,
3103 btrfs_item_ptr_offset(leaf
, path
->slots
[0]),
3104 sizeof(cache
->item
));
3105 memcpy(&cache
->key
, &found_key
, sizeof(found_key
));
3108 key
.objectid
= found_key
.objectid
+ found_key
.offset
;
3109 btrfs_release_path(root
, path
);
3110 cache
->flags
= btrfs_block_group_flags(&cache
->item
);
3112 if (cache
->flags
& BTRFS_BLOCK_GROUP_DATA
) {
3113 bit
= BLOCK_GROUP_DATA
;
3114 } else if (cache
->flags
& BTRFS_BLOCK_GROUP_SYSTEM
) {
3115 bit
= BLOCK_GROUP_SYSTEM
;
3116 } else if (cache
->flags
& BTRFS_BLOCK_GROUP_METADATA
) {
3117 bit
= BLOCK_GROUP_METADATA
;
3119 set_avail_alloc_bits(info
, cache
->flags
);
3120 if (btrfs_chunk_readonly(root
, cache
->key
.objectid
))
3123 ret
= update_space_info(info
, cache
->flags
, found_key
.offset
,
3124 btrfs_block_group_used(&cache
->item
),
3127 cache
->space_info
= space_info
;
3129 /* use EXTENT_LOCKED to prevent merging */
3130 set_extent_bits(block_group_cache
, found_key
.objectid
,
3131 found_key
.objectid
+ found_key
.offset
- 1,
3132 bit
| EXTENT_LOCKED
, GFP_NOFS
);
3133 set_state_private(block_group_cache
, found_key
.objectid
,
3134 (unsigned long)cache
);
3138 btrfs_free_path(path
);
3142 int btrfs_make_block_group(struct btrfs_trans_handle
*trans
,
3143 struct btrfs_root
*root
, u64 bytes_used
,
3144 u64 type
, u64 chunk_objectid
, u64 chunk_offset
,
3149 struct btrfs_root
*extent_root
;
3150 struct btrfs_block_group_cache
*cache
;
3151 struct extent_io_tree
*block_group_cache
;
3153 extent_root
= root
->fs_info
->extent_root
;
3154 block_group_cache
= &root
->fs_info
->block_group_cache
;
3156 cache
= kzalloc(sizeof(*cache
), GFP_NOFS
);
3158 cache
->key
.objectid
= chunk_offset
;
3159 cache
->key
.offset
= size
;
3161 btrfs_set_key_type(&cache
->key
, BTRFS_BLOCK_GROUP_ITEM_KEY
);
3162 btrfs_set_block_group_used(&cache
->item
, bytes_used
);
3163 btrfs_set_block_group_chunk_objectid(&cache
->item
, chunk_objectid
);
3164 cache
->flags
= type
;
3165 btrfs_set_block_group_flags(&cache
->item
, type
);
3167 ret
= update_space_info(root
->fs_info
, cache
->flags
, size
, bytes_used
,
3168 &cache
->space_info
);
3171 bit
= block_group_state_bits(type
);
3172 set_extent_bits(block_group_cache
, chunk_offset
,
3173 chunk_offset
+ size
- 1,
3174 bit
| EXTENT_LOCKED
, GFP_NOFS
);
3176 set_state_private(block_group_cache
, chunk_offset
,
3177 (unsigned long)cache
);
3178 ret
= btrfs_insert_item(trans
, extent_root
, &cache
->key
, &cache
->item
,
3179 sizeof(cache
->item
));
3182 finish_current_insert(trans
, extent_root
);
3183 ret
= del_pending_extents(trans
, extent_root
);
3184 set_avail_alloc_bits(extent_root
->fs_info
, type
);
3189 * This is for converter use only.
3191 * In that case, we don't know where are free blocks located.
3192 * Therefore all block group cache entries must be setup properly
3193 * before doing any block allocation.
3195 int btrfs_make_block_groups(struct btrfs_trans_handle
*trans
,
3196 struct btrfs_root
*root
)
3204 u64 total_metadata
= 0;
3208 struct btrfs_root
*extent_root
;
3209 struct btrfs_block_group_cache
*cache
;
3210 struct extent_io_tree
*block_group_cache
;
3212 extent_root
= root
->fs_info
->extent_root
;
3213 block_group_cache
= &root
->fs_info
->block_group_cache
;
3214 chunk_objectid
= BTRFS_FIRST_CHUNK_TREE_OBJECTID
;
3215 total_bytes
= btrfs_super_total_bytes(&root
->fs_info
->super_copy
);
3216 group_align
= 64 * root
->sectorsize
;
3219 while (cur_start
< total_bytes
) {
3220 group_size
= total_bytes
/ 12;
3221 group_size
= min_t(u64
, group_size
, total_bytes
- cur_start
);
3222 if (cur_start
== 0) {
3223 bit
= BLOCK_GROUP_SYSTEM
;
3224 group_type
= BTRFS_BLOCK_GROUP_SYSTEM
;
3226 group_size
&= ~(group_align
- 1);
3227 group_size
= max_t(u64
, group_size
, 8 * 1024 * 1024);
3228 group_size
= min_t(u64
, group_size
, 32 * 1024 * 1024);
3230 group_size
&= ~(group_align
- 1);
3231 if (total_data
>= total_metadata
* 2) {
3232 group_type
= BTRFS_BLOCK_GROUP_METADATA
;
3233 group_size
= min_t(u64
, group_size
,
3234 1ULL * 1024 * 1024 * 1024);
3235 total_metadata
+= group_size
;
3237 group_type
= BTRFS_BLOCK_GROUP_DATA
;
3238 group_size
= min_t(u64
, group_size
,
3239 5ULL * 1024 * 1024 * 1024);
3240 total_data
+= group_size
;
3242 if ((total_bytes
- cur_start
) * 4 < group_size
* 5)
3243 group_size
= total_bytes
- cur_start
;
3246 cache
= kzalloc(sizeof(*cache
), GFP_NOFS
);
3249 cache
->key
.objectid
= cur_start
;
3250 cache
->key
.offset
= group_size
;
3251 btrfs_set_key_type(&cache
->key
, BTRFS_BLOCK_GROUP_ITEM_KEY
);
3253 btrfs_set_block_group_used(&cache
->item
, 0);
3254 btrfs_set_block_group_chunk_objectid(&cache
->item
,
3256 btrfs_set_block_group_flags(&cache
->item
, group_type
);
3258 cache
->flags
= group_type
;
3260 ret
= update_space_info(root
->fs_info
, group_type
, group_size
,
3261 0, &cache
->space_info
);
3263 set_avail_alloc_bits(extent_root
->fs_info
, group_type
);
3265 set_extent_bits(block_group_cache
, cur_start
,
3266 cur_start
+ group_size
- 1,
3267 bit
| EXTENT_LOCKED
, GFP_NOFS
);
3268 set_state_private(block_group_cache
, cur_start
,
3269 (unsigned long)cache
);
3270 cur_start
+= group_size
;
3272 /* then insert all the items */
3274 while(cur_start
< total_bytes
) {
3275 cache
= btrfs_lookup_block_group(root
->fs_info
, cur_start
);
3278 ret
= btrfs_insert_item(trans
, extent_root
, &cache
->key
, &cache
->item
,
3279 sizeof(cache
->item
));
3282 finish_current_insert(trans
, extent_root
);
3283 ret
= del_pending_extents(trans
, extent_root
);
3286 cur_start
= cache
->key
.objectid
+ cache
->key
.offset
;
3291 int btrfs_update_block_group(struct btrfs_trans_handle
*trans
,
3292 struct btrfs_root
*root
,
3293 u64 bytenr
, u64 num_bytes
, int alloc
,
3296 return update_block_group(trans
, root
, bytenr
, num_bytes
,
3300 static int btrfs_count_extents_in_block_group(struct btrfs_root
*root
,
3301 struct btrfs_path
*path
, u64 start
,
3305 struct btrfs_key key
;
3306 struct extent_buffer
*leaf
;
3312 key
.objectid
= start
;
3313 btrfs_set_key_type(&key
, BTRFS_EXTENT_ITEM_KEY
);
3314 ret
= btrfs_search_slot(NULL
, root
->fs_info
->extent_root
,
3319 leaf
= path
->nodes
[0];
3320 slot
= path
->slots
[0];
3321 if (slot
>= btrfs_header_nritems(leaf
)) {
3322 ret
= btrfs_next_leaf(root
, path
);
3327 leaf
= path
->nodes
[0];
3328 slot
= path
->slots
[0];
3330 btrfs_item_key_to_cpu(leaf
, &key
, slot
);
3331 if (key
.objectid
> start
+ len
)
3333 if (key
.type
== BTRFS_EXTENT_ITEM_KEY
)
3334 bytes_used
+= key
.offset
;
3337 *total
= bytes_used
;
3338 btrfs_release_path(root
, path
);
3342 int btrfs_check_block_accounting(struct btrfs_root
*root
)
3347 struct btrfs_path path
;
3348 struct btrfs_block_group_cache
*cache
;
3349 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
3351 btrfs_init_path(&path
);
3354 cache
= btrfs_lookup_block_group(fs_info
, start
);
3358 ret
= btrfs_count_extents_in_block_group(root
, &path
,
3359 cache
->key
.objectid
,
3364 u64 on_disk
= btrfs_block_group_used(&cache
->item
);
3365 if (on_disk
!= bytes_used
) {
3366 fprintf(stderr
, "bad block group accounting found %llu "
3367 "expected %llu block group %llu\n",
3368 (unsigned long long)bytes_used
,
3369 (unsigned long long)on_disk
,
3370 (unsigned long long)cache
->key
.objectid
);
3373 start
= cache
->key
.objectid
+ cache
->key
.offset
;
3375 cache
->space_info
->bytes_used
= 0;
3381 * Fixup block accounting. The initial block accounting created by
3382 * make_block_groups isn't accuracy in this case.
3384 int btrfs_fix_block_accounting(struct btrfs_trans_handle
*trans
,
3385 struct btrfs_root
*root
)
3391 struct btrfs_path path
;
3392 struct btrfs_key key
;
3393 struct extent_buffer
*leaf
;
3394 struct btrfs_block_group_cache
*cache
;
3395 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
3397 root
= root
->fs_info
->extent_root
;
3399 while(extent_root_pending_ops(fs_info
)) {
3400 ret
= finish_current_insert(trans
, root
);
3403 ret
= del_pending_extents(trans
, root
);
3409 cache
= btrfs_lookup_block_group(fs_info
, start
);
3412 start
= cache
->key
.objectid
+ cache
->key
.offset
;
3413 btrfs_set_block_group_used(&cache
->item
, 0);
3414 cache
->space_info
->bytes_used
= 0;
3415 set_extent_bits(&root
->fs_info
->block_group_cache
,
3416 cache
->key
.objectid
,
3417 cache
->key
.objectid
+ cache
->key
.offset
-1,
3418 BLOCK_GROUP_DIRTY
, GFP_NOFS
);
3421 btrfs_init_path(&path
);
3424 btrfs_set_key_type(&key
, BTRFS_EXTENT_ITEM_KEY
);
3425 ret
= btrfs_search_slot(trans
, root
->fs_info
->extent_root
,
3430 leaf
= path
.nodes
[0];
3431 slot
= path
.slots
[0];
3432 if (slot
>= btrfs_header_nritems(leaf
)) {
3433 ret
= btrfs_next_leaf(root
, &path
);
3438 leaf
= path
.nodes
[0];
3439 slot
= path
.slots
[0];
3441 btrfs_item_key_to_cpu(leaf
, &key
, slot
);
3442 if (key
.type
== BTRFS_EXTENT_ITEM_KEY
) {
3443 bytes_used
+= key
.offset
;
3444 ret
= btrfs_update_block_group(trans
, root
,
3445 key
.objectid
, key
.offset
, 1, 0);
3450 btrfs_set_super_bytes_used(&root
->fs_info
->super_copy
, bytes_used
);
3451 btrfs_release_path(root
, &path
);