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.
22 #include "kerncompat.h"
23 #include "radix-tree.h"
26 #include "print-tree.h"
27 #include "transaction.h"
30 #include "free-space-cache.h"
33 #define PENDING_EXTENT_INSERT 0
34 #define PENDING_EXTENT_DELETE 1
35 #define PENDING_BACKREF_UPDATE 2
37 struct pending_extent_op {
42 struct btrfs_disk_key key;
46 static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans,
47 struct btrfs_root *root,
48 u64 root_objectid, u64 generation,
49 u64 flags, struct btrfs_disk_key *key,
50 int level, struct btrfs_key *ins);
51 static int __free_extent(struct btrfs_trans_handle *trans,
52 struct btrfs_root *root,
53 u64 bytenr, u64 num_bytes, u64 parent,
54 u64 root_objectid, u64 owner_objectid,
55 u64 owner_offset, int refs_to_drop);
56 static int finish_current_insert(struct btrfs_trans_handle *trans, struct
57 btrfs_root *extent_root);
58 static int del_pending_extents(struct btrfs_trans_handle *trans, struct
59 btrfs_root *extent_root);
61 static int remove_sb_from_cache(struct btrfs_root *root,
62 struct btrfs_block_group_cache *cache)
68 struct extent_io_tree *free_space_cache;
70 free_space_cache = &root->fs_info->free_space_cache;
71 for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
72 bytenr = btrfs_sb_offset(i);
73 ret = btrfs_rmap_block(&root->fs_info->mapping_tree,
74 cache->key.objectid, bytenr, 0,
75 &logical, &nr, &stripe_len);
78 clear_extent_dirty(free_space_cache, logical[nr],
79 logical[nr] + stripe_len - 1, GFP_NOFS);
86 static int cache_block_group(struct btrfs_root *root,
87 struct btrfs_block_group_cache *block_group)
89 struct btrfs_path *path;
92 struct extent_buffer *leaf;
93 struct extent_io_tree *free_space_cache;
101 root = root->fs_info->extent_root;
102 free_space_cache = &root->fs_info->free_space_cache;
104 if (block_group->cached)
107 path = btrfs_alloc_path();
112 last = max_t(u64, block_group->key.objectid, BTRFS_SUPER_INFO_OFFSET);
117 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
122 leaf = path->nodes[0];
123 slot = path->slots[0];
124 if (slot >= btrfs_header_nritems(leaf)) {
125 ret = btrfs_next_leaf(root, path);
134 btrfs_item_key_to_cpu(leaf, &key, slot);
135 if (key.objectid < block_group->key.objectid) {
138 if (key.objectid >= block_group->key.objectid +
139 block_group->key.offset) {
143 if (key.type == BTRFS_EXTENT_ITEM_KEY ||
144 key.type == BTRFS_METADATA_ITEM_KEY) {
145 if (key.objectid > last) {
146 hole_size = key.objectid - last;
147 set_extent_dirty(free_space_cache, last,
148 last + hole_size - 1,
151 if (key.type == BTRFS_METADATA_ITEM_KEY)
152 last = key.objectid + root->leafsize;
154 last = key.objectid + key.offset;
160 if (block_group->key.objectid +
161 block_group->key.offset > last) {
162 hole_size = block_group->key.objectid +
163 block_group->key.offset - last;
164 set_extent_dirty(free_space_cache, last,
165 last + hole_size - 1, GFP_NOFS);
167 remove_sb_from_cache(root, block_group);
168 block_group->cached = 1;
170 btrfs_free_path(path);
174 struct btrfs_block_group_cache *btrfs_lookup_first_block_group(struct
178 struct extent_io_tree *block_group_cache;
179 struct btrfs_block_group_cache *block_group = NULL;
185 bytenr = max_t(u64, bytenr,
186 BTRFS_SUPER_INFO_OFFSET + BTRFS_SUPER_INFO_SIZE);
187 block_group_cache = &info->block_group_cache;
188 ret = find_first_extent_bit(block_group_cache,
189 bytenr, &start, &end,
190 BLOCK_GROUP_DATA | BLOCK_GROUP_METADATA |
195 ret = get_state_private(block_group_cache, start, &ptr);
199 block_group = (struct btrfs_block_group_cache *)(unsigned long)ptr;
203 struct btrfs_block_group_cache *btrfs_lookup_block_group(struct
207 struct extent_io_tree *block_group_cache;
208 struct btrfs_block_group_cache *block_group = NULL;
214 block_group_cache = &info->block_group_cache;
215 ret = find_first_extent_bit(block_group_cache,
216 bytenr, &start, &end,
217 BLOCK_GROUP_DATA | BLOCK_GROUP_METADATA |
222 ret = get_state_private(block_group_cache, start, &ptr);
226 block_group = (struct btrfs_block_group_cache *)(unsigned long)ptr;
227 if (block_group->key.objectid <= bytenr && bytenr <
228 block_group->key.objectid + block_group->key.offset)
233 static int block_group_bits(struct btrfs_block_group_cache *cache, u64 bits)
235 return (cache->flags & bits) == bits;
238 static int noinline find_search_start(struct btrfs_root *root,
239 struct btrfs_block_group_cache **cache_ret,
240 u64 *start_ret, int num, int data)
243 struct btrfs_block_group_cache *cache = *cache_ret;
244 u64 last = *start_ret;
247 u64 search_start = *start_ret;
253 ret = cache_block_group(root, cache);
257 last = max(search_start, cache->key.objectid);
258 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) {
281 cache = btrfs_lookup_block_group(root->fs_info, search_start);
283 printk("Unable to find block group for %llu\n",
284 (unsigned long long)search_start);
290 last = cache->key.objectid + cache->key.offset;
292 cache = btrfs_lookup_first_block_group(root->fs_info, last);
305 static int block_group_state_bits(u64 flags)
308 if (flags & BTRFS_BLOCK_GROUP_DATA)
309 bits |= BLOCK_GROUP_DATA;
310 if (flags & BTRFS_BLOCK_GROUP_METADATA)
311 bits |= BLOCK_GROUP_METADATA;
312 if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
313 bits |= BLOCK_GROUP_SYSTEM;
317 struct btrfs_block_group_cache *btrfs_find_block_group(struct btrfs_root *root,
318 struct btrfs_block_group_cache
319 *hint, u64 search_start,
322 struct btrfs_block_group_cache *cache;
323 struct extent_io_tree *block_group_cache;
324 struct btrfs_block_group_cache *found_group = NULL;
325 struct btrfs_fs_info *info = root->fs_info;
338 block_group_cache = &info->block_group_cache;
343 bit = block_group_state_bits(data);
346 struct btrfs_block_group_cache *shint;
347 shint = btrfs_lookup_block_group(info, search_start);
348 if (shint && !shint->ro && block_group_bits(shint, data)) {
349 used = btrfs_block_group_used(&shint->item);
350 if (used + shint->pinned <
351 div_factor(shint->key.offset, factor)) {
356 if (hint && !hint->ro && block_group_bits(hint, data)) {
357 used = btrfs_block_group_used(&hint->item);
358 if (used + hint->pinned <
359 div_factor(hint->key.offset, factor)) {
362 last = hint->key.objectid + hint->key.offset;
366 hint_last = max(hint->key.objectid, search_start);
368 hint_last = search_start;
374 ret = find_first_extent_bit(block_group_cache, last,
379 ret = get_state_private(block_group_cache, start, &ptr);
383 cache = (struct btrfs_block_group_cache *)(unsigned long)ptr;
384 last = cache->key.objectid + cache->key.offset;
385 used = btrfs_block_group_used(&cache->item);
387 if (!cache->ro && block_group_bits(cache, data)) {
389 free_check = cache->key.offset;
391 free_check = div_factor(cache->key.offset,
394 if (used + cache->pinned < free_check) {
411 * Back reference rules. Back refs have three main goals:
413 * 1) differentiate between all holders of references to an extent so that
414 * when a reference is dropped we can make sure it was a valid reference
415 * before freeing the extent.
417 * 2) Provide enough information to quickly find the holders of an extent
418 * if we notice a given block is corrupted or bad.
420 * 3) Make it easy to migrate blocks for FS shrinking or storage pool
421 * maintenance. This is actually the same as #2, but with a slightly
422 * different use case.
424 * There are two kinds of back refs. The implicit back refs is optimized
425 * for pointers in non-shared tree blocks. For a given pointer in a block,
426 * back refs of this kind provide information about the block's owner tree
427 * and the pointer's key. These information allow us to find the block by
428 * b-tree searching. The full back refs is for pointers in tree blocks not
429 * referenced by their owner trees. The location of tree block is recorded
430 * in the back refs. Actually the full back refs is generic, and can be
431 * used in all cases the implicit back refs is used. The major shortcoming
432 * of the full back refs is its overhead. Every time a tree block gets
433 * COWed, we have to update back refs entry for all pointers in it.
435 * For a newly allocated tree block, we use implicit back refs for
436 * pointers in it. This means most tree related operations only involve
437 * implicit back refs. For a tree block created in old transaction, the
438 * only way to drop a reference to it is COW it. So we can detect the
439 * event that tree block loses its owner tree's reference and do the
440 * back refs conversion.
442 * When a tree block is COW'd through a tree, there are four cases:
444 * The reference count of the block is one and the tree is the block's
445 * owner tree. Nothing to do in this case.
447 * The reference count of the block is one and the tree is not the
448 * block's owner tree. In this case, full back refs is used for pointers
449 * in the block. Remove these full back refs, add implicit back refs for
450 * every pointers in the new block.
452 * The reference count of the block is greater than one and the tree is
453 * the block's owner tree. In this case, implicit back refs is used for
454 * pointers in the block. Add full back refs for every pointers in the
455 * block, increase lower level extents' reference counts. The original
456 * implicit back refs are entailed to the new block.
458 * The reference count of the block is greater than one and the tree is
459 * not the block's owner tree. Add implicit back refs for every pointer in
460 * the new block, increase lower level extents' reference count.
462 * Back Reference Key composing:
464 * The key objectid corresponds to the first byte in the extent,
465 * The key type is used to differentiate between types of back refs.
466 * There are different meanings of the key offset for different types
469 * File extents can be referenced by:
471 * - multiple snapshots, subvolumes, or different generations in one subvol
472 * - different files inside a single subvolume
473 * - different offsets inside a file (bookend extents in file.c)
475 * The extent ref structure for the implicit back refs has fields for:
477 * - Objectid of the subvolume root
478 * - objectid of the file holding the reference
479 * - original offset in the file
480 * - how many bookend extents
482 * The key offset for the implicit back refs is hash of the first
485 * The extent ref structure for the full back refs has field for:
487 * - number of pointers in the tree leaf
489 * The key offset for the implicit back refs is the first byte of
492 * When a file extent is allocated, The implicit back refs is used.
493 * the fields are filled in:
495 * (root_key.objectid, inode objectid, offset in file, 1)
497 * When a file extent is removed file truncation, we find the
498 * corresponding implicit back refs and check the following fields:
500 * (btrfs_header_owner(leaf), inode objectid, offset in file)
502 * Btree extents can be referenced by:
504 * - Different subvolumes
506 * Both the implicit back refs and the full back refs for tree blocks
507 * only consist of key. The key offset for the implicit back refs is
508 * objectid of block's owner tree. The key offset for the full back refs
509 * is the first byte of parent block.
511 * When implicit back refs is used, information about the lowest key and
512 * level of the tree block are required. These information are stored in
513 * tree block info structure.
516 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
517 static int convert_extent_item_v0(struct btrfs_trans_handle *trans,
518 struct btrfs_root *root,
519 struct btrfs_path *path,
520 u64 owner, u32 extra_size)
522 struct btrfs_extent_item *item;
523 struct btrfs_extent_item_v0 *ei0;
524 struct btrfs_extent_ref_v0 *ref0;
525 struct btrfs_tree_block_info *bi;
526 struct extent_buffer *leaf;
527 struct btrfs_key key;
528 struct btrfs_key found_key;
529 u32 new_size = sizeof(*item);
533 leaf = path->nodes[0];
534 BUG_ON(btrfs_item_size_nr(leaf, path->slots[0]) != sizeof(*ei0));
536 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
537 ei0 = btrfs_item_ptr(leaf, path->slots[0],
538 struct btrfs_extent_item_v0);
539 refs = btrfs_extent_refs_v0(leaf, ei0);
541 if (owner == (u64)-1) {
543 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
544 ret = btrfs_next_leaf(root, path);
548 leaf = path->nodes[0];
550 btrfs_item_key_to_cpu(leaf, &found_key,
552 BUG_ON(key.objectid != found_key.objectid);
553 if (found_key.type != BTRFS_EXTENT_REF_V0_KEY) {
557 ref0 = btrfs_item_ptr(leaf, path->slots[0],
558 struct btrfs_extent_ref_v0);
559 owner = btrfs_ref_objectid_v0(leaf, ref0);
563 btrfs_release_path(root, path);
565 if (owner < BTRFS_FIRST_FREE_OBJECTID)
566 new_size += sizeof(*bi);
568 new_size -= sizeof(*ei0);
569 ret = btrfs_search_slot(trans, root, &key, path, new_size, 1);
574 ret = btrfs_extend_item(trans, root, path, new_size);
577 leaf = path->nodes[0];
578 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
579 btrfs_set_extent_refs(leaf, item, refs);
580 /* FIXME: get real generation */
581 btrfs_set_extent_generation(leaf, item, 0);
582 if (owner < BTRFS_FIRST_FREE_OBJECTID) {
583 btrfs_set_extent_flags(leaf, item,
584 BTRFS_EXTENT_FLAG_TREE_BLOCK |
585 BTRFS_BLOCK_FLAG_FULL_BACKREF);
586 bi = (struct btrfs_tree_block_info *)(item + 1);
587 /* FIXME: get first key of the block */
588 memset_extent_buffer(leaf, 0, (unsigned long)bi, sizeof(*bi));
589 btrfs_set_tree_block_level(leaf, bi, (int)owner);
591 btrfs_set_extent_flags(leaf, item, BTRFS_EXTENT_FLAG_DATA);
593 btrfs_mark_buffer_dirty(leaf);
598 static u64 hash_extent_data_ref(u64 root_objectid, u64 owner, u64 offset)
600 u32 high_crc = ~(u32)0;
601 u32 low_crc = ~(u32)0;
604 lenum = cpu_to_le64(root_objectid);
605 high_crc = btrfs_crc32c(high_crc, &lenum, sizeof(lenum));
606 lenum = cpu_to_le64(owner);
607 low_crc = btrfs_crc32c(low_crc, &lenum, sizeof(lenum));
608 lenum = cpu_to_le64(offset);
609 low_crc = btrfs_crc32c(low_crc, &lenum, sizeof(lenum));
611 return ((u64)high_crc << 31) ^ (u64)low_crc;
614 static u64 hash_extent_data_ref_item(struct extent_buffer *leaf,
615 struct btrfs_extent_data_ref *ref)
617 return hash_extent_data_ref(btrfs_extent_data_ref_root(leaf, ref),
618 btrfs_extent_data_ref_objectid(leaf, ref),
619 btrfs_extent_data_ref_offset(leaf, ref));
622 static int match_extent_data_ref(struct extent_buffer *leaf,
623 struct btrfs_extent_data_ref *ref,
624 u64 root_objectid, u64 owner, u64 offset)
626 if (btrfs_extent_data_ref_root(leaf, ref) != root_objectid ||
627 btrfs_extent_data_ref_objectid(leaf, ref) != owner ||
628 btrfs_extent_data_ref_offset(leaf, ref) != offset)
633 static noinline int lookup_extent_data_ref(struct btrfs_trans_handle *trans,
634 struct btrfs_root *root,
635 struct btrfs_path *path,
636 u64 bytenr, u64 parent,
638 u64 owner, u64 offset)
640 struct btrfs_key key;
641 struct btrfs_extent_data_ref *ref;
642 struct extent_buffer *leaf;
648 key.objectid = bytenr;
650 key.type = BTRFS_SHARED_DATA_REF_KEY;
653 key.type = BTRFS_EXTENT_DATA_REF_KEY;
654 key.offset = hash_extent_data_ref(root_objectid,
659 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
668 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
669 key.type = BTRFS_EXTENT_REF_V0_KEY;
670 btrfs_release_path(root, path);
671 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
682 leaf = path->nodes[0];
683 nritems = btrfs_header_nritems(leaf);
685 if (path->slots[0] >= nritems) {
686 ret = btrfs_next_leaf(root, path);
692 leaf = path->nodes[0];
693 nritems = btrfs_header_nritems(leaf);
697 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
698 if (key.objectid != bytenr ||
699 key.type != BTRFS_EXTENT_DATA_REF_KEY)
702 ref = btrfs_item_ptr(leaf, path->slots[0],
703 struct btrfs_extent_data_ref);
705 if (match_extent_data_ref(leaf, ref, root_objectid,
708 btrfs_release_path(root, path);
720 static noinline int insert_extent_data_ref(struct btrfs_trans_handle *trans,
721 struct btrfs_root *root,
722 struct btrfs_path *path,
723 u64 bytenr, u64 parent,
724 u64 root_objectid, u64 owner,
725 u64 offset, int refs_to_add)
727 struct btrfs_key key;
728 struct extent_buffer *leaf;
733 key.objectid = bytenr;
735 key.type = BTRFS_SHARED_DATA_REF_KEY;
737 size = sizeof(struct btrfs_shared_data_ref);
739 key.type = BTRFS_EXTENT_DATA_REF_KEY;
740 key.offset = hash_extent_data_ref(root_objectid,
742 size = sizeof(struct btrfs_extent_data_ref);
745 ret = btrfs_insert_empty_item(trans, root, path, &key, size);
746 if (ret && ret != -EEXIST)
749 leaf = path->nodes[0];
751 struct btrfs_shared_data_ref *ref;
752 ref = btrfs_item_ptr(leaf, path->slots[0],
753 struct btrfs_shared_data_ref);
755 btrfs_set_shared_data_ref_count(leaf, ref, refs_to_add);
757 num_refs = btrfs_shared_data_ref_count(leaf, ref);
758 num_refs += refs_to_add;
759 btrfs_set_shared_data_ref_count(leaf, ref, num_refs);
762 struct btrfs_extent_data_ref *ref;
763 while (ret == -EEXIST) {
764 ref = btrfs_item_ptr(leaf, path->slots[0],
765 struct btrfs_extent_data_ref);
766 if (match_extent_data_ref(leaf, ref, root_objectid,
769 btrfs_release_path(root, path);
772 ret = btrfs_insert_empty_item(trans, root, path, &key,
774 if (ret && ret != -EEXIST)
777 leaf = path->nodes[0];
779 ref = btrfs_item_ptr(leaf, path->slots[0],
780 struct btrfs_extent_data_ref);
782 btrfs_set_extent_data_ref_root(leaf, ref,
784 btrfs_set_extent_data_ref_objectid(leaf, ref, owner);
785 btrfs_set_extent_data_ref_offset(leaf, ref, offset);
786 btrfs_set_extent_data_ref_count(leaf, ref, refs_to_add);
788 num_refs = btrfs_extent_data_ref_count(leaf, ref);
789 num_refs += refs_to_add;
790 btrfs_set_extent_data_ref_count(leaf, ref, num_refs);
793 btrfs_mark_buffer_dirty(leaf);
796 btrfs_release_path(root, path);
800 static noinline int remove_extent_data_ref(struct btrfs_trans_handle *trans,
801 struct btrfs_root *root,
802 struct btrfs_path *path,
805 struct btrfs_key key;
806 struct btrfs_extent_data_ref *ref1 = NULL;
807 struct btrfs_shared_data_ref *ref2 = NULL;
808 struct extent_buffer *leaf;
812 leaf = path->nodes[0];
813 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
815 if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
816 ref1 = btrfs_item_ptr(leaf, path->slots[0],
817 struct btrfs_extent_data_ref);
818 num_refs = btrfs_extent_data_ref_count(leaf, ref1);
819 } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
820 ref2 = btrfs_item_ptr(leaf, path->slots[0],
821 struct btrfs_shared_data_ref);
822 num_refs = btrfs_shared_data_ref_count(leaf, ref2);
823 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
824 } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
825 struct btrfs_extent_ref_v0 *ref0;
826 ref0 = btrfs_item_ptr(leaf, path->slots[0],
827 struct btrfs_extent_ref_v0);
828 num_refs = btrfs_ref_count_v0(leaf, ref0);
834 BUG_ON(num_refs < refs_to_drop);
835 num_refs -= refs_to_drop;
838 ret = btrfs_del_item(trans, root, path);
840 if (key.type == BTRFS_EXTENT_DATA_REF_KEY)
841 btrfs_set_extent_data_ref_count(leaf, ref1, num_refs);
842 else if (key.type == BTRFS_SHARED_DATA_REF_KEY)
843 btrfs_set_shared_data_ref_count(leaf, ref2, num_refs);
844 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
846 struct btrfs_extent_ref_v0 *ref0;
847 ref0 = btrfs_item_ptr(leaf, path->slots[0],
848 struct btrfs_extent_ref_v0);
849 btrfs_set_ref_count_v0(leaf, ref0, num_refs);
852 btrfs_mark_buffer_dirty(leaf);
857 static noinline u32 extent_data_ref_count(struct btrfs_root *root,
858 struct btrfs_path *path,
859 struct btrfs_extent_inline_ref *iref)
861 struct btrfs_key key;
862 struct extent_buffer *leaf;
863 struct btrfs_extent_data_ref *ref1;
864 struct btrfs_shared_data_ref *ref2;
867 leaf = path->nodes[0];
868 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
870 if (btrfs_extent_inline_ref_type(leaf, iref) ==
871 BTRFS_EXTENT_DATA_REF_KEY) {
872 ref1 = (struct btrfs_extent_data_ref *)(&iref->offset);
873 num_refs = btrfs_extent_data_ref_count(leaf, ref1);
875 ref2 = (struct btrfs_shared_data_ref *)(iref + 1);
876 num_refs = btrfs_shared_data_ref_count(leaf, ref2);
878 } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
879 ref1 = btrfs_item_ptr(leaf, path->slots[0],
880 struct btrfs_extent_data_ref);
881 num_refs = btrfs_extent_data_ref_count(leaf, ref1);
882 } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
883 ref2 = btrfs_item_ptr(leaf, path->slots[0],
884 struct btrfs_shared_data_ref);
885 num_refs = btrfs_shared_data_ref_count(leaf, ref2);
886 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
887 } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
888 struct btrfs_extent_ref_v0 *ref0;
889 ref0 = btrfs_item_ptr(leaf, path->slots[0],
890 struct btrfs_extent_ref_v0);
891 num_refs = btrfs_ref_count_v0(leaf, ref0);
899 static noinline int lookup_tree_block_ref(struct btrfs_trans_handle *trans,
900 struct btrfs_root *root,
901 struct btrfs_path *path,
902 u64 bytenr, u64 parent,
905 struct btrfs_key key;
908 key.objectid = bytenr;
910 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
913 key.type = BTRFS_TREE_BLOCK_REF_KEY;
914 key.offset = root_objectid;
917 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
920 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
921 if (ret == -ENOENT && parent) {
922 btrfs_release_path(root, path);
923 key.type = BTRFS_EXTENT_REF_V0_KEY;
924 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
932 static noinline int insert_tree_block_ref(struct btrfs_trans_handle *trans,
933 struct btrfs_root *root,
934 struct btrfs_path *path,
935 u64 bytenr, u64 parent,
938 struct btrfs_key key;
941 key.objectid = bytenr;
943 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
946 key.type = BTRFS_TREE_BLOCK_REF_KEY;
947 key.offset = root_objectid;
950 ret = btrfs_insert_empty_item(trans, root, path, &key, 0);
952 btrfs_release_path(root, path);
956 static inline int extent_ref_type(u64 parent, u64 owner)
959 if (owner < BTRFS_FIRST_FREE_OBJECTID) {
961 type = BTRFS_SHARED_BLOCK_REF_KEY;
963 type = BTRFS_TREE_BLOCK_REF_KEY;
966 type = BTRFS_SHARED_DATA_REF_KEY;
968 type = BTRFS_EXTENT_DATA_REF_KEY;
973 static int find_next_key(struct btrfs_path *path, struct btrfs_key *key)
977 for (level = 0; level < BTRFS_MAX_LEVEL; level++) {
978 if (!path->nodes[level])
980 if (path->slots[level] + 1 >=
981 btrfs_header_nritems(path->nodes[level]))
984 btrfs_item_key_to_cpu(path->nodes[level], key,
985 path->slots[level] + 1);
987 btrfs_node_key_to_cpu(path->nodes[level], key,
988 path->slots[level] + 1);
994 static int lookup_inline_extent_backref(struct btrfs_trans_handle *trans,
995 struct btrfs_root *root,
996 struct btrfs_path *path,
997 struct btrfs_extent_inline_ref **ref_ret,
998 u64 bytenr, u64 num_bytes,
999 u64 parent, u64 root_objectid,
1000 u64 owner, u64 offset, int insert)
1002 struct btrfs_key key;
1003 struct extent_buffer *leaf;
1004 struct btrfs_extent_item *ei;
1005 struct btrfs_extent_inline_ref *iref;
1015 int skinny_metadata =
1016 btrfs_fs_incompat(root->fs_info,
1017 BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA);
1019 key.objectid = bytenr;
1020 key.type = BTRFS_EXTENT_ITEM_KEY;
1021 key.offset = num_bytes;
1023 want = extent_ref_type(parent, owner);
1025 extra_size = btrfs_extent_inline_ref_size(want);
1029 if (owner < BTRFS_FIRST_FREE_OBJECTID && skinny_metadata) {
1030 skinny_metadata = 1;
1031 key.type = BTRFS_METADATA_ITEM_KEY;
1033 } else if (skinny_metadata) {
1034 skinny_metadata = 0;
1038 ret = btrfs_search_slot(trans, root, &key, path, extra_size, 1);
1045 * We may be a newly converted file system which still has the old fat
1046 * extent entries for metadata, so try and see if we have one of those.
1048 if (ret > 0 && skinny_metadata) {
1049 skinny_metadata = 0;
1050 if (path->slots[0]) {
1052 btrfs_item_key_to_cpu(path->nodes[0], &key,
1054 if (key.objectid == bytenr &&
1055 key.type == BTRFS_EXTENT_ITEM_KEY &&
1056 key.offset == num_bytes)
1060 key.type = BTRFS_EXTENT_ITEM_KEY;
1061 key.offset = num_bytes;
1062 btrfs_release_path(root, path);
1068 printf("Failed to find [%llu, %u, %llu]\n", key.objectid, key.type, key.offset);
1074 leaf = path->nodes[0];
1075 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1076 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1077 if (item_size < sizeof(*ei)) {
1082 ret = convert_extent_item_v0(trans, root, path, owner,
1088 leaf = path->nodes[0];
1089 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1092 if (item_size < sizeof(*ei)) {
1093 printf("Size is %u, needs to be %u, slot %d\n",
1094 (unsigned)item_size,
1095 (unsigned)sizeof(*ei), path->slots[0]);
1096 btrfs_print_leaf(root, leaf);
1099 BUG_ON(item_size < sizeof(*ei));
1101 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1102 flags = btrfs_extent_flags(leaf, ei);
1104 ptr = (unsigned long)(ei + 1);
1105 end = (unsigned long)ei + item_size;
1107 if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK && !skinny_metadata) {
1108 ptr += sizeof(struct btrfs_tree_block_info);
1110 } else if (!(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) {
1111 if (!(flags & BTRFS_EXTENT_FLAG_DATA)) {
1122 iref = (struct btrfs_extent_inline_ref *)ptr;
1123 type = btrfs_extent_inline_ref_type(leaf, iref);
1127 ptr += btrfs_extent_inline_ref_size(type);
1131 if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1132 struct btrfs_extent_data_ref *dref;
1133 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1134 if (match_extent_data_ref(leaf, dref, root_objectid,
1139 if (hash_extent_data_ref_item(leaf, dref) <
1140 hash_extent_data_ref(root_objectid, owner, offset))
1144 ref_offset = btrfs_extent_inline_ref_offset(leaf, iref);
1146 if (parent == ref_offset) {
1150 if (ref_offset < parent)
1153 if (root_objectid == ref_offset) {
1157 if (ref_offset < root_objectid)
1161 ptr += btrfs_extent_inline_ref_size(type);
1163 if (err == -ENOENT && insert) {
1164 if (item_size + extra_size >=
1165 BTRFS_MAX_EXTENT_ITEM_SIZE(root)) {
1170 * To add new inline back ref, we have to make sure
1171 * there is no corresponding back ref item.
1172 * For simplicity, we just do not add new inline back
1173 * ref if there is any back ref item.
1175 if (find_next_key(path, &key) == 0 && key.objectid == bytenr &&
1176 key.type < BTRFS_BLOCK_GROUP_ITEM_KEY) {
1181 *ref_ret = (struct btrfs_extent_inline_ref *)ptr;
1186 static int setup_inline_extent_backref(struct btrfs_trans_handle *trans,
1187 struct btrfs_root *root,
1188 struct btrfs_path *path,
1189 struct btrfs_extent_inline_ref *iref,
1190 u64 parent, u64 root_objectid,
1191 u64 owner, u64 offset, int refs_to_add)
1193 struct extent_buffer *leaf;
1194 struct btrfs_extent_item *ei;
1197 unsigned long item_offset;
1203 leaf = path->nodes[0];
1204 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1205 item_offset = (unsigned long)iref - (unsigned long)ei;
1207 type = extent_ref_type(parent, owner);
1208 size = btrfs_extent_inline_ref_size(type);
1210 ret = btrfs_extend_item(trans, root, path, size);
1213 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1214 refs = btrfs_extent_refs(leaf, ei);
1215 refs += refs_to_add;
1216 btrfs_set_extent_refs(leaf, ei, refs);
1218 ptr = (unsigned long)ei + item_offset;
1219 end = (unsigned long)ei + btrfs_item_size_nr(leaf, path->slots[0]);
1220 if (ptr < end - size)
1221 memmove_extent_buffer(leaf, ptr + size, ptr,
1224 iref = (struct btrfs_extent_inline_ref *)ptr;
1225 btrfs_set_extent_inline_ref_type(leaf, iref, type);
1226 if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1227 struct btrfs_extent_data_ref *dref;
1228 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1229 btrfs_set_extent_data_ref_root(leaf, dref, root_objectid);
1230 btrfs_set_extent_data_ref_objectid(leaf, dref, owner);
1231 btrfs_set_extent_data_ref_offset(leaf, dref, offset);
1232 btrfs_set_extent_data_ref_count(leaf, dref, refs_to_add);
1233 } else if (type == BTRFS_SHARED_DATA_REF_KEY) {
1234 struct btrfs_shared_data_ref *sref;
1235 sref = (struct btrfs_shared_data_ref *)(iref + 1);
1236 btrfs_set_shared_data_ref_count(leaf, sref, refs_to_add);
1237 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
1238 } else if (type == BTRFS_SHARED_BLOCK_REF_KEY) {
1239 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
1241 btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid);
1243 btrfs_mark_buffer_dirty(leaf);
1247 static int lookup_extent_backref(struct btrfs_trans_handle *trans,
1248 struct btrfs_root *root,
1249 struct btrfs_path *path,
1250 struct btrfs_extent_inline_ref **ref_ret,
1251 u64 bytenr, u64 num_bytes, u64 parent,
1252 u64 root_objectid, u64 owner, u64 offset)
1256 ret = lookup_inline_extent_backref(trans, root, path, ref_ret,
1257 bytenr, num_bytes, parent,
1258 root_objectid, owner, offset, 0);
1262 btrfs_release_path(root, path);
1265 if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1266 ret = lookup_tree_block_ref(trans, root, path, bytenr, parent,
1269 ret = lookup_extent_data_ref(trans, root, path, bytenr, parent,
1270 root_objectid, owner, offset);
1275 static int update_inline_extent_backref(struct btrfs_trans_handle *trans,
1276 struct btrfs_root *root,
1277 struct btrfs_path *path,
1278 struct btrfs_extent_inline_ref *iref,
1281 struct extent_buffer *leaf;
1282 struct btrfs_extent_item *ei;
1283 struct btrfs_extent_data_ref *dref = NULL;
1284 struct btrfs_shared_data_ref *sref = NULL;
1293 leaf = path->nodes[0];
1294 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1295 refs = btrfs_extent_refs(leaf, ei);
1296 WARN_ON(refs_to_mod < 0 && refs + refs_to_mod <= 0);
1297 refs += refs_to_mod;
1298 btrfs_set_extent_refs(leaf, ei, refs);
1300 type = btrfs_extent_inline_ref_type(leaf, iref);
1302 if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1303 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1304 refs = btrfs_extent_data_ref_count(leaf, dref);
1305 } else if (type == BTRFS_SHARED_DATA_REF_KEY) {
1306 sref = (struct btrfs_shared_data_ref *)(iref + 1);
1307 refs = btrfs_shared_data_ref_count(leaf, sref);
1310 BUG_ON(refs_to_mod != -1);
1313 BUG_ON(refs_to_mod < 0 && refs < -refs_to_mod);
1314 refs += refs_to_mod;
1317 if (type == BTRFS_EXTENT_DATA_REF_KEY)
1318 btrfs_set_extent_data_ref_count(leaf, dref, refs);
1320 btrfs_set_shared_data_ref_count(leaf, sref, refs);
1322 size = btrfs_extent_inline_ref_size(type);
1323 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1324 ptr = (unsigned long)iref;
1325 end = (unsigned long)ei + item_size;
1326 if (ptr + size < end)
1327 memmove_extent_buffer(leaf, ptr, ptr + size,
1330 ret = btrfs_truncate_item(trans, root, path, item_size, 1);
1333 btrfs_mark_buffer_dirty(leaf);
1337 static int insert_inline_extent_backref(struct btrfs_trans_handle *trans,
1338 struct btrfs_root *root,
1339 struct btrfs_path *path,
1340 u64 bytenr, u64 num_bytes, u64 parent,
1341 u64 root_objectid, u64 owner,
1342 u64 offset, int refs_to_add)
1344 struct btrfs_extent_inline_ref *iref;
1347 ret = lookup_inline_extent_backref(trans, root, path, &iref,
1348 bytenr, num_bytes, parent,
1349 root_objectid, owner, offset, 1);
1351 BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID);
1352 ret = update_inline_extent_backref(trans, root, path, iref,
1354 } else if (ret == -ENOENT) {
1355 ret = setup_inline_extent_backref(trans, root, path, iref,
1356 parent, root_objectid,
1357 owner, offset, refs_to_add);
1362 static int insert_extent_backref(struct btrfs_trans_handle *trans,
1363 struct btrfs_root *root,
1364 struct btrfs_path *path,
1365 u64 bytenr, u64 parent, u64 root_objectid,
1366 u64 owner, u64 offset, int refs_to_add)
1370 if (owner >= BTRFS_FIRST_FREE_OBJECTID) {
1371 ret = insert_extent_data_ref(trans, root, path, bytenr,
1372 parent, root_objectid,
1373 owner, offset, refs_to_add);
1375 BUG_ON(refs_to_add != 1);
1376 ret = insert_tree_block_ref(trans, root, path, bytenr,
1377 parent, root_objectid);
1382 static int remove_extent_backref(struct btrfs_trans_handle *trans,
1383 struct btrfs_root *root,
1384 struct btrfs_path *path,
1385 struct btrfs_extent_inline_ref *iref,
1386 int refs_to_drop, int is_data)
1390 BUG_ON(!is_data && refs_to_drop != 1);
1392 ret = update_inline_extent_backref(trans, root, path, iref,
1394 } else if (is_data) {
1395 ret = remove_extent_data_ref(trans, root, path, refs_to_drop);
1397 ret = btrfs_del_item(trans, root, path);
1402 int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans,
1403 struct btrfs_root *root,
1404 u64 bytenr, u64 num_bytes, u64 parent,
1405 u64 root_objectid, u64 owner, u64 offset)
1407 struct btrfs_path *path;
1408 struct extent_buffer *leaf;
1409 struct btrfs_extent_item *item;
1414 path = btrfs_alloc_path();
1419 path->leave_spinning = 1;
1421 ret = insert_inline_extent_backref(trans, root->fs_info->extent_root,
1422 path, bytenr, num_bytes, parent,
1423 root_objectid, owner, offset, 1);
1427 if (ret != -EAGAIN) {
1432 leaf = path->nodes[0];
1433 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1434 refs = btrfs_extent_refs(leaf, item);
1435 btrfs_set_extent_refs(leaf, item, refs + 1);
1437 btrfs_mark_buffer_dirty(leaf);
1438 btrfs_release_path(root->fs_info->extent_root, path);
1441 path->leave_spinning = 1;
1443 /* now insert the actual backref */
1444 ret = insert_extent_backref(trans, root->fs_info->extent_root,
1445 path, bytenr, parent, root_objectid,
1450 btrfs_free_path(path);
1451 finish_current_insert(trans, root->fs_info->extent_root);
1452 del_pending_extents(trans, root->fs_info->extent_root);
1457 int btrfs_extent_post_op(struct btrfs_trans_handle *trans,
1458 struct btrfs_root *root)
1460 finish_current_insert(trans, root->fs_info->extent_root);
1461 del_pending_extents(trans, root->fs_info->extent_root);
1465 int btrfs_lookup_extent_info(struct btrfs_trans_handle *trans,
1466 struct btrfs_root *root, u64 bytenr,
1467 u64 offset, int metadata, u64 *refs, u64 *flags)
1469 struct btrfs_path *path;
1471 struct btrfs_key key;
1472 struct extent_buffer *l;
1473 struct btrfs_extent_item *item;
1479 !btrfs_fs_incompat(root->fs_info,
1480 BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA)) {
1481 offset = root->leafsize;
1485 path = btrfs_alloc_path();
1490 key.objectid = bytenr;
1491 key.offset = offset;
1493 key.type = BTRFS_METADATA_ITEM_KEY;
1495 key.type = BTRFS_EXTENT_ITEM_KEY;
1498 ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key, path,
1504 * Deal with the fact that we may have mixed SKINNY and normal refs. If
1505 * we didn't find what we wanted check and see if we have a normal ref
1506 * right next to us, or re-search if we are on the edge of the leaf just
1509 if (ret > 0 && metadata) {
1510 if (path->slots[0]) {
1512 btrfs_item_key_to_cpu(path->nodes[0], &key,
1514 if (key.objectid == bytenr &&
1515 key.type == BTRFS_EXTENT_ITEM_KEY &&
1516 key.offset == root->leafsize)
1521 btrfs_release_path(root, path);
1522 key.type = BTRFS_EXTENT_ITEM_KEY;
1523 key.offset = root->leafsize;
1535 item_size = btrfs_item_size_nr(l, path->slots[0]);
1536 if (item_size >= sizeof(*item)) {
1537 item = btrfs_item_ptr(l, path->slots[0],
1538 struct btrfs_extent_item);
1539 num_refs = btrfs_extent_refs(l, item);
1540 extent_flags = btrfs_extent_flags(l, item);
1542 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1543 struct btrfs_extent_item_v0 *ei0;
1544 BUG_ON(item_size != sizeof(*ei0));
1545 ei0 = btrfs_item_ptr(l, path->slots[0],
1546 struct btrfs_extent_item_v0);
1547 num_refs = btrfs_extent_refs_v0(l, ei0);
1548 /* FIXME: this isn't correct for data */
1549 extent_flags = BTRFS_BLOCK_FLAG_FULL_BACKREF;
1554 item = btrfs_item_ptr(l, path->slots[0], struct btrfs_extent_item);
1558 *flags = extent_flags;
1560 btrfs_free_path(path);
1564 int btrfs_set_block_flags(struct btrfs_trans_handle *trans,
1565 struct btrfs_root *root,
1566 u64 bytenr, int level, u64 flags)
1568 struct btrfs_path *path;
1570 struct btrfs_key key;
1571 struct extent_buffer *l;
1572 struct btrfs_extent_item *item;
1574 int skinny_metadata =
1575 btrfs_fs_incompat(root->fs_info,
1576 BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA);
1578 path = btrfs_alloc_path();
1583 key.objectid = bytenr;
1584 if (skinny_metadata) {
1586 key.type = BTRFS_METADATA_ITEM_KEY;
1588 key.offset = root->leafsize;
1589 key.type = BTRFS_EXTENT_ITEM_KEY;
1593 ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key, path,
1598 if (ret > 0 && skinny_metadata) {
1599 skinny_metadata = 0;
1600 if (path->slots[0]) {
1602 btrfs_item_key_to_cpu(path->nodes[0], &key,
1604 if (key.objectid == bytenr &&
1605 key.offset == root->leafsize &&
1606 key.type == BTRFS_EXTENT_ITEM_KEY)
1610 btrfs_release_path(root, path);
1611 key.offset = root->leafsize;
1612 key.type = BTRFS_EXTENT_ITEM_KEY;
1618 btrfs_print_leaf(root, path->nodes[0]);
1619 printk("failed to find block number %Lu\n",
1620 (unsigned long long)bytenr);
1624 item_size = btrfs_item_size_nr(l, path->slots[0]);
1625 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1626 if (item_size < sizeof(*item)) {
1627 ret = convert_extent_item_v0(trans, root->fs_info->extent_root,
1633 item_size = btrfs_item_size_nr(l, path->slots[0]);
1636 BUG_ON(item_size < sizeof(*item));
1637 item = btrfs_item_ptr(l, path->slots[0], struct btrfs_extent_item);
1638 flags |= btrfs_extent_flags(l, item);
1639 btrfs_set_extent_flags(l, item, flags);
1641 btrfs_free_path(path);
1642 finish_current_insert(trans, root->fs_info->extent_root);
1643 del_pending_extents(trans, root->fs_info->extent_root);
1647 static int __btrfs_mod_ref(struct btrfs_trans_handle *trans,
1648 struct btrfs_root *root,
1649 struct extent_buffer *buf,
1650 int record_parent, int inc)
1657 struct btrfs_key key;
1658 struct btrfs_file_extent_item *fi;
1662 int (*process_func)(struct btrfs_trans_handle *trans,
1663 struct btrfs_root *root,
1664 u64, u64, u64, u64, u64, u64);
1666 ref_root = btrfs_header_owner(buf);
1667 nritems = btrfs_header_nritems(buf);
1668 level = btrfs_header_level(buf);
1670 if (!root->ref_cows && level == 0)
1674 process_func = btrfs_inc_extent_ref;
1676 process_func = btrfs_free_extent;
1679 parent = buf->start;
1683 for (i = 0; i < nritems; i++) {
1686 btrfs_item_key_to_cpu(buf, &key, i);
1687 if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY)
1689 fi = btrfs_item_ptr(buf, i,
1690 struct btrfs_file_extent_item);
1691 if (btrfs_file_extent_type(buf, fi) ==
1692 BTRFS_FILE_EXTENT_INLINE)
1694 bytenr = btrfs_file_extent_disk_bytenr(buf, fi);
1698 num_bytes = btrfs_file_extent_disk_num_bytes(buf, fi);
1699 key.offset -= btrfs_file_extent_offset(buf, fi);
1700 ret = process_func(trans, root, bytenr, num_bytes,
1701 parent, ref_root, key.objectid,
1708 bytenr = btrfs_node_blockptr(buf, i);
1709 num_bytes = btrfs_level_size(root, level - 1);
1710 ret = process_func(trans, root, bytenr, num_bytes,
1711 parent, ref_root, level - 1, 0);
1724 int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
1725 struct extent_buffer *buf, int record_parent)
1727 return __btrfs_mod_ref(trans, root, buf, record_parent, 1);
1730 int btrfs_dec_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
1731 struct extent_buffer *buf, int record_parent)
1733 return __btrfs_mod_ref(trans, root, buf, record_parent, 0);
1736 static int write_one_cache_group(struct btrfs_trans_handle *trans,
1737 struct btrfs_root *root,
1738 struct btrfs_path *path,
1739 struct btrfs_block_group_cache *cache)
1743 struct btrfs_root *extent_root = root->fs_info->extent_root;
1745 struct extent_buffer *leaf;
1747 ret = btrfs_search_slot(trans, extent_root, &cache->key, path, 0, 1);
1752 leaf = path->nodes[0];
1753 bi = btrfs_item_ptr_offset(leaf, path->slots[0]);
1754 write_extent_buffer(leaf, &cache->item, bi, sizeof(cache->item));
1755 btrfs_mark_buffer_dirty(leaf);
1756 btrfs_release_path(extent_root, path);
1758 finish_current_insert(trans, extent_root);
1759 pending_ret = del_pending_extents(trans, extent_root);
1768 int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans,
1769 struct btrfs_root *root)
1771 struct extent_io_tree *block_group_cache;
1772 struct btrfs_block_group_cache *cache;
1774 struct btrfs_path *path;
1780 block_group_cache = &root->fs_info->block_group_cache;
1781 path = btrfs_alloc_path();
1786 ret = find_first_extent_bit(block_group_cache, last,
1787 &start, &end, BLOCK_GROUP_DIRTY);
1796 ret = get_state_private(block_group_cache, start, &ptr);
1799 clear_extent_bits(block_group_cache, start, end,
1800 BLOCK_GROUP_DIRTY, GFP_NOFS);
1802 cache = (struct btrfs_block_group_cache *)(unsigned long)ptr;
1803 ret = write_one_cache_group(trans, root, path, cache);
1805 btrfs_free_path(path);
1809 static struct btrfs_space_info *__find_space_info(struct btrfs_fs_info *info,
1812 struct list_head *head = &info->space_info;
1813 struct list_head *cur;
1814 struct btrfs_space_info *found;
1815 list_for_each(cur, head) {
1816 found = list_entry(cur, struct btrfs_space_info, list);
1817 if (found->flags & flags)
1824 static int update_space_info(struct btrfs_fs_info *info, u64 flags,
1825 u64 total_bytes, u64 bytes_used,
1826 struct btrfs_space_info **space_info)
1828 struct btrfs_space_info *found;
1830 found = __find_space_info(info, flags);
1832 found->total_bytes += total_bytes;
1833 found->bytes_used += bytes_used;
1834 if (found->total_bytes < found->bytes_used) {
1835 fprintf(stderr, "warning, bad space info total_bytes "
1837 (unsigned long long)found->total_bytes,
1838 (unsigned long long)found->bytes_used);
1840 *space_info = found;
1843 found = kmalloc(sizeof(*found), GFP_NOFS);
1847 list_add(&found->list, &info->space_info);
1848 found->flags = flags;
1849 found->total_bytes = total_bytes;
1850 found->bytes_used = bytes_used;
1851 found->bytes_pinned = 0;
1853 *space_info = found;
1858 static void set_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags)
1860 u64 extra_flags = flags & (BTRFS_BLOCK_GROUP_RAID0 |
1861 BTRFS_BLOCK_GROUP_RAID1 |
1862 BTRFS_BLOCK_GROUP_RAID10 |
1863 BTRFS_BLOCK_GROUP_RAID5 |
1864 BTRFS_BLOCK_GROUP_RAID6 |
1865 BTRFS_BLOCK_GROUP_DUP);
1867 if (flags & BTRFS_BLOCK_GROUP_DATA)
1868 fs_info->avail_data_alloc_bits |= extra_flags;
1869 if (flags & BTRFS_BLOCK_GROUP_METADATA)
1870 fs_info->avail_metadata_alloc_bits |= extra_flags;
1871 if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
1872 fs_info->avail_system_alloc_bits |= extra_flags;
1876 static int do_chunk_alloc(struct btrfs_trans_handle *trans,
1877 struct btrfs_root *extent_root, u64 alloc_bytes,
1880 struct btrfs_space_info *space_info;
1886 space_info = __find_space_info(extent_root->fs_info, flags);
1888 ret = update_space_info(extent_root->fs_info, flags,
1892 BUG_ON(!space_info);
1894 if (space_info->full)
1897 thresh = div_factor(space_info->total_bytes, 7);
1898 if ((space_info->bytes_used + space_info->bytes_pinned + alloc_bytes) <
1902 ret = btrfs_alloc_chunk(trans, extent_root, &start, &num_bytes,
1904 if (ret == -ENOSPC) {
1905 space_info->full = 1;
1911 ret = btrfs_make_block_group(trans, extent_root, 0, space_info->flags,
1912 BTRFS_FIRST_CHUNK_TREE_OBJECTID, start, num_bytes);
1917 static int update_block_group(struct btrfs_trans_handle *trans,
1918 struct btrfs_root *root,
1919 u64 bytenr, u64 num_bytes, int alloc,
1922 struct btrfs_block_group_cache *cache;
1923 struct btrfs_fs_info *info = root->fs_info;
1924 u64 total = num_bytes;
1930 /* block accounting for super block */
1931 old_val = btrfs_super_bytes_used(info->super_copy);
1933 old_val += num_bytes;
1935 old_val -= num_bytes;
1936 btrfs_set_super_bytes_used(info->super_copy, old_val);
1938 /* block accounting for root item */
1939 old_val = btrfs_root_used(&root->root_item);
1941 old_val += num_bytes;
1943 old_val -= num_bytes;
1944 btrfs_set_root_used(&root->root_item, old_val);
1947 cache = btrfs_lookup_block_group(info, bytenr);
1951 byte_in_group = bytenr - cache->key.objectid;
1952 WARN_ON(byte_in_group > cache->key.offset);
1953 start = cache->key.objectid;
1954 end = start + cache->key.offset - 1;
1955 set_extent_bits(&info->block_group_cache, start, end,
1956 BLOCK_GROUP_DIRTY, GFP_NOFS);
1958 old_val = btrfs_block_group_used(&cache->item);
1959 num_bytes = min(total, cache->key.offset - byte_in_group);
1962 old_val += num_bytes;
1963 cache->space_info->bytes_used += num_bytes;
1965 old_val -= num_bytes;
1966 cache->space_info->bytes_used -= num_bytes;
1968 set_extent_dirty(&info->free_space_cache,
1969 bytenr, bytenr + num_bytes - 1,
1973 btrfs_set_block_group_used(&cache->item, old_val);
1975 bytenr += num_bytes;
1980 static int update_pinned_extents(struct btrfs_root *root,
1981 u64 bytenr, u64 num, int pin)
1984 struct btrfs_block_group_cache *cache;
1985 struct btrfs_fs_info *fs_info = root->fs_info;
1988 set_extent_dirty(&fs_info->pinned_extents,
1989 bytenr, bytenr + num - 1, GFP_NOFS);
1991 clear_extent_dirty(&fs_info->pinned_extents,
1992 bytenr, bytenr + num - 1, GFP_NOFS);
1995 cache = btrfs_lookup_block_group(fs_info, bytenr);
1997 len = min((u64)root->sectorsize, num);
2001 len = min(num, cache->key.offset -
2002 (bytenr - cache->key.objectid));
2004 cache->pinned += len;
2005 cache->space_info->bytes_pinned += len;
2006 fs_info->total_pinned += len;
2008 cache->pinned -= len;
2009 cache->space_info->bytes_pinned -= len;
2010 fs_info->total_pinned -= len;
2019 int btrfs_copy_pinned(struct btrfs_root *root, struct extent_io_tree *copy)
2024 struct extent_io_tree *pinned_extents = &root->fs_info->pinned_extents;
2028 ret = find_first_extent_bit(pinned_extents, last,
2029 &start, &end, EXTENT_DIRTY);
2032 set_extent_dirty(copy, start, end, GFP_NOFS);
2038 int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans,
2039 struct btrfs_root *root,
2040 struct extent_io_tree *unpin)
2045 struct extent_io_tree *free_space_cache;
2046 free_space_cache = &root->fs_info->free_space_cache;
2049 ret = find_first_extent_bit(unpin, 0, &start, &end,
2053 update_pinned_extents(root, start, end + 1 - start, 0);
2054 clear_extent_dirty(unpin, start, end, GFP_NOFS);
2055 set_extent_dirty(free_space_cache, start, end, GFP_NOFS);
2060 static int extent_root_pending_ops(struct btrfs_fs_info *info)
2066 ret = find_first_extent_bit(&info->extent_ins, 0, &start,
2067 &end, EXTENT_LOCKED);
2069 ret = find_first_extent_bit(&info->pending_del, 0, &start, &end,
2075 static int finish_current_insert(struct btrfs_trans_handle *trans,
2076 struct btrfs_root *extent_root)
2081 struct btrfs_fs_info *info = extent_root->fs_info;
2082 struct pending_extent_op *extent_op;
2083 struct btrfs_key key;
2085 int skinny_metadata =
2086 btrfs_fs_incompat(extent_root->fs_info,
2087 BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA);
2090 ret = find_first_extent_bit(&info->extent_ins, 0, &start,
2091 &end, EXTENT_LOCKED);
2095 ret = get_state_private(&info->extent_ins, start, &priv);
2097 extent_op = (struct pending_extent_op *)(unsigned long)priv;
2099 if (extent_op->type == PENDING_EXTENT_INSERT) {
2100 key.objectid = start;
2101 if (skinny_metadata) {
2102 key.offset = extent_op->level;
2103 key.type = BTRFS_METADATA_ITEM_KEY;
2105 key.offset = extent_op->num_bytes;
2106 key.type = BTRFS_EXTENT_ITEM_KEY;
2108 ret = alloc_reserved_tree_block(trans, extent_root,
2109 extent_root->root_key.objectid,
2113 extent_op->level, &key);
2119 clear_extent_bits(&info->extent_ins, start, end, EXTENT_LOCKED,
2126 static int pin_down_bytes(struct btrfs_trans_handle *trans,
2127 struct btrfs_root *root,
2128 u64 bytenr, u64 num_bytes, int is_data)
2131 struct extent_buffer *buf;
2136 buf = btrfs_find_tree_block(root, bytenr, num_bytes);
2140 /* we can reuse a block if it hasn't been written
2141 * and it is from this transaction. We can't
2142 * reuse anything from the tree log root because
2143 * it has tiny sub-transactions.
2145 if (btrfs_buffer_uptodate(buf, 0)) {
2146 u64 header_owner = btrfs_header_owner(buf);
2147 u64 header_transid = btrfs_header_generation(buf);
2148 if (header_owner != BTRFS_TREE_LOG_OBJECTID &&
2149 header_transid == trans->transid &&
2150 !btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN)) {
2151 clean_tree_block(NULL, root, buf);
2152 free_extent_buffer(buf);
2156 free_extent_buffer(buf);
2158 update_pinned_extents(root, bytenr, num_bytes, 1);
2164 void btrfs_pin_extent(struct btrfs_fs_info *fs_info,
2165 u64 bytenr, u64 num_bytes)
2167 update_pinned_extents(fs_info->extent_root, bytenr, num_bytes, 1);
2170 void btrfs_unpin_extent(struct btrfs_fs_info *fs_info,
2171 u64 bytenr, u64 num_bytes)
2173 update_pinned_extents(fs_info->extent_root, bytenr, num_bytes, 0);
2177 * remove an extent from the root, returns 0 on success
2179 static int __free_extent(struct btrfs_trans_handle *trans,
2180 struct btrfs_root *root,
2181 u64 bytenr, u64 num_bytes, u64 parent,
2182 u64 root_objectid, u64 owner_objectid,
2183 u64 owner_offset, int refs_to_drop)
2186 struct btrfs_key key;
2187 struct btrfs_path *path;
2188 struct btrfs_extent_ops *ops = root->fs_info->extent_ops;
2189 struct btrfs_root *extent_root = root->fs_info->extent_root;
2190 struct extent_buffer *leaf;
2191 struct btrfs_extent_item *ei;
2192 struct btrfs_extent_inline_ref *iref;
2195 int extent_slot = 0;
2196 int found_extent = 0;
2200 int skinny_metadata =
2201 btrfs_fs_incompat(extent_root->fs_info,
2202 BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA);
2204 if (root->fs_info->free_extent_hook) {
2205 root->fs_info->free_extent_hook(trans, root, bytenr, num_bytes,
2206 parent, root_objectid, owner_objectid,
2207 owner_offset, refs_to_drop);
2210 path = btrfs_alloc_path();
2215 path->leave_spinning = 1;
2217 is_data = owner_objectid >= BTRFS_FIRST_FREE_OBJECTID;
2219 skinny_metadata = 0;
2220 BUG_ON(!is_data && refs_to_drop != 1);
2222 ret = lookup_extent_backref(trans, extent_root, path, &iref,
2223 bytenr, num_bytes, parent,
2224 root_objectid, owner_objectid,
2227 extent_slot = path->slots[0];
2228 while (extent_slot >= 0) {
2229 btrfs_item_key_to_cpu(path->nodes[0], &key,
2231 if (key.objectid != bytenr)
2233 if (key.type == BTRFS_EXTENT_ITEM_KEY &&
2234 key.offset == num_bytes) {
2238 if (key.type == BTRFS_METADATA_ITEM_KEY &&
2239 key.offset == owner_objectid) {
2243 if (path->slots[0] - extent_slot > 5)
2247 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2248 item_size = btrfs_item_size_nr(path->nodes[0], extent_slot);
2249 if (found_extent && item_size < sizeof(*ei))
2252 if (!found_extent) {
2254 ret = remove_extent_backref(trans, extent_root, path,
2258 btrfs_release_path(extent_root, path);
2259 path->leave_spinning = 1;
2261 key.objectid = bytenr;
2263 if (skinny_metadata) {
2264 key.type = BTRFS_METADATA_ITEM_KEY;
2265 key.offset = owner_objectid;
2267 key.type = BTRFS_EXTENT_ITEM_KEY;
2268 key.offset = num_bytes;
2271 ret = btrfs_search_slot(trans, extent_root,
2273 if (ret > 0 && skinny_metadata && path->slots[0]) {
2275 btrfs_item_key_to_cpu(path->nodes[0],
2278 if (key.objectid == bytenr &&
2279 key.type == BTRFS_EXTENT_ITEM_KEY &&
2280 key.offset == num_bytes)
2284 if (ret > 0 && skinny_metadata) {
2285 skinny_metadata = 0;
2286 btrfs_release_path(extent_root, path);
2287 key.type = BTRFS_EXTENT_ITEM_KEY;
2288 key.offset = num_bytes;
2289 ret = btrfs_search_slot(trans, extent_root,
2294 printk(KERN_ERR "umm, got %d back from search"
2295 ", was looking for %llu\n", ret,
2296 (unsigned long long)bytenr);
2297 btrfs_print_leaf(extent_root, path->nodes[0]);
2300 extent_slot = path->slots[0];
2303 printk(KERN_ERR "btrfs unable to find ref byte nr %llu "
2304 "parent %llu root %llu owner %llu offset %llu\n",
2305 (unsigned long long)bytenr,
2306 (unsigned long long)parent,
2307 (unsigned long long)root_objectid,
2308 (unsigned long long)owner_objectid,
2309 (unsigned long long)owner_offset);
2314 leaf = path->nodes[0];
2315 item_size = btrfs_item_size_nr(leaf, extent_slot);
2316 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2317 if (item_size < sizeof(*ei)) {
2318 BUG_ON(found_extent || extent_slot != path->slots[0]);
2319 ret = convert_extent_item_v0(trans, extent_root, path,
2323 btrfs_release_path(extent_root, path);
2324 path->leave_spinning = 1;
2326 key.objectid = bytenr;
2327 key.type = BTRFS_EXTENT_ITEM_KEY;
2328 key.offset = num_bytes;
2330 ret = btrfs_search_slot(trans, extent_root, &key, path,
2333 printk(KERN_ERR "umm, got %d back from search"
2334 ", was looking for %llu\n", ret,
2335 (unsigned long long)bytenr);
2336 btrfs_print_leaf(extent_root, path->nodes[0]);
2339 extent_slot = path->slots[0];
2340 leaf = path->nodes[0];
2341 item_size = btrfs_item_size_nr(leaf, extent_slot);
2344 BUG_ON(item_size < sizeof(*ei));
2345 ei = btrfs_item_ptr(leaf, extent_slot,
2346 struct btrfs_extent_item);
2347 if (owner_objectid < BTRFS_FIRST_FREE_OBJECTID &&
2348 key.type == BTRFS_EXTENT_ITEM_KEY) {
2349 struct btrfs_tree_block_info *bi;
2350 BUG_ON(item_size < sizeof(*ei) + sizeof(*bi));
2351 bi = (struct btrfs_tree_block_info *)(ei + 1);
2352 WARN_ON(owner_objectid != btrfs_tree_block_level(leaf, bi));
2355 refs = btrfs_extent_refs(leaf, ei);
2356 BUG_ON(refs < refs_to_drop);
2357 refs -= refs_to_drop;
2361 * In the case of inline back ref, reference count will
2362 * be updated by remove_extent_backref
2365 BUG_ON(!found_extent);
2367 btrfs_set_extent_refs(leaf, ei, refs);
2368 btrfs_mark_buffer_dirty(leaf);
2371 ret = remove_extent_backref(trans, extent_root, path,
2381 BUG_ON(is_data && refs_to_drop !=
2382 extent_data_ref_count(root, path, iref));
2384 BUG_ON(path->slots[0] != extent_slot);
2386 BUG_ON(path->slots[0] != extent_slot + 1);
2387 path->slots[0] = extent_slot;
2392 if (ops && ops->free_extent) {
2393 ret = ops->free_extent(root, bytenr, num_bytes);
2401 ret = pin_down_bytes(trans, root, bytenr, num_bytes,
2408 ret = btrfs_del_items(trans, extent_root, path, path->slots[0],
2411 btrfs_release_path(extent_root, path);
2414 ret = btrfs_del_csums(trans, root, bytenr, num_bytes);
2418 update_block_group(trans, root, bytenr, num_bytes, 0, mark_free);
2421 btrfs_free_path(path);
2422 finish_current_insert(trans, extent_root);
2427 * find all the blocks marked as pending in the radix tree and remove
2428 * them from the extent map
2430 static int del_pending_extents(struct btrfs_trans_handle *trans, struct
2431 btrfs_root *extent_root)
2438 struct extent_io_tree *pending_del;
2439 struct extent_io_tree *extent_ins;
2440 struct pending_extent_op *extent_op;
2442 extent_ins = &extent_root->fs_info->extent_ins;
2443 pending_del = &extent_root->fs_info->pending_del;
2446 ret = find_first_extent_bit(pending_del, 0, &start, &end,
2451 ret = get_state_private(pending_del, start, &priv);
2453 extent_op = (struct pending_extent_op *)(unsigned long)priv;
2455 clear_extent_bits(pending_del, start, end, EXTENT_LOCKED,
2458 if (!test_range_bit(extent_ins, start, end,
2459 EXTENT_LOCKED, 0)) {
2460 ret = __free_extent(trans, extent_root,
2461 start, end + 1 - start, 0,
2462 extent_root->root_key.objectid,
2463 extent_op->level, 0, 1);
2467 ret = get_state_private(extent_ins, start, &priv);
2469 extent_op = (struct pending_extent_op *)
2470 (unsigned long)priv;
2472 clear_extent_bits(extent_ins, start, end,
2473 EXTENT_LOCKED, GFP_NOFS);
2475 if (extent_op->type == PENDING_BACKREF_UPDATE)
2487 * remove an extent from the root, returns 0 on success
2490 int btrfs_free_extent(struct btrfs_trans_handle *trans,
2491 struct btrfs_root *root,
2492 u64 bytenr, u64 num_bytes, u64 parent,
2493 u64 root_objectid, u64 owner, u64 offset)
2495 struct btrfs_root *extent_root = root->fs_info->extent_root;
2499 WARN_ON(num_bytes < root->sectorsize);
2500 if (root == extent_root) {
2501 struct pending_extent_op *extent_op;
2503 extent_op = kmalloc(sizeof(*extent_op), GFP_NOFS);
2506 extent_op->type = PENDING_EXTENT_DELETE;
2507 extent_op->bytenr = bytenr;
2508 extent_op->num_bytes = num_bytes;
2509 extent_op->level = (int)owner;
2511 set_extent_bits(&root->fs_info->pending_del,
2512 bytenr, bytenr + num_bytes - 1,
2513 EXTENT_LOCKED, GFP_NOFS);
2514 set_state_private(&root->fs_info->pending_del,
2515 bytenr, (unsigned long)extent_op);
2518 ret = __free_extent(trans, root, bytenr, num_bytes, parent,
2519 root_objectid, owner, offset, 1);
2520 pending_ret = del_pending_extents(trans, root->fs_info->extent_root);
2521 return ret ? ret : pending_ret;
2524 static u64 stripe_align(struct btrfs_root *root, u64 val)
2526 u64 mask = ((u64)root->stripesize - 1);
2527 u64 ret = (val + mask) & ~mask;
2532 * walks the btree of allocated extents and find a hole of a given size.
2533 * The key ins is changed to record the hole:
2534 * ins->objectid == block start
2535 * ins->flags = BTRFS_EXTENT_ITEM_KEY
2536 * ins->offset == number of blocks
2537 * Any available blocks before search_start are skipped.
2539 static int noinline find_free_extent(struct btrfs_trans_handle *trans,
2540 struct btrfs_root *orig_root,
2541 u64 num_bytes, u64 empty_size,
2542 u64 search_start, u64 search_end,
2543 u64 hint_byte, struct btrfs_key *ins,
2544 u64 exclude_start, u64 exclude_nr,
2548 u64 orig_search_start = search_start;
2549 struct btrfs_root * root = orig_root->fs_info->extent_root;
2550 struct btrfs_fs_info *info = root->fs_info;
2551 u64 total_needed = num_bytes;
2552 struct btrfs_block_group_cache *block_group;
2556 WARN_ON(num_bytes < root->sectorsize);
2557 btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY);
2559 search_start = stripe_align(root, search_start);
2562 block_group = btrfs_lookup_first_block_group(info, hint_byte);
2564 hint_byte = search_start;
2565 block_group = btrfs_find_block_group(root, block_group,
2566 hint_byte, data, 1);
2568 block_group = btrfs_find_block_group(root,
2570 search_start, data, 1);
2573 total_needed += empty_size;
2576 search_start = stripe_align(root, search_start);
2578 block_group = btrfs_lookup_first_block_group(info,
2581 block_group = btrfs_lookup_first_block_group(info,
2584 ret = find_search_start(root, &block_group, &search_start,
2585 total_needed, data);
2589 ins->objectid = search_start;
2590 ins->offset = num_bytes;
2592 if (ins->objectid + num_bytes >
2593 block_group->key.objectid + block_group->key.offset) {
2594 search_start = block_group->key.objectid +
2595 block_group->key.offset;
2599 if (test_range_bit(&info->extent_ins, ins->objectid,
2600 ins->objectid + num_bytes -1, EXTENT_LOCKED, 0)) {
2601 search_start = ins->objectid + num_bytes;
2605 if (test_range_bit(&info->pinned_extents, ins->objectid,
2606 ins->objectid + num_bytes -1, EXTENT_DIRTY, 0)) {
2607 search_start = ins->objectid + num_bytes;
2611 if (exclude_nr > 0 && (ins->objectid + num_bytes > exclude_start &&
2612 ins->objectid < exclude_start + exclude_nr)) {
2613 search_start = exclude_start + exclude_nr;
2617 if (!(data & BTRFS_BLOCK_GROUP_DATA)) {
2618 block_group = btrfs_lookup_block_group(info, ins->objectid);
2620 trans->block_group = block_group;
2622 ins->offset = num_bytes;
2626 block_group = btrfs_lookup_first_block_group(info, search_start);
2628 search_start = orig_search_start;
2635 total_needed -= empty_size;
2641 block_group = btrfs_find_block_group(root, block_group,
2642 search_start, data, 0);
2649 static int btrfs_reserve_extent(struct btrfs_trans_handle *trans,
2650 struct btrfs_root *root,
2651 u64 num_bytes, u64 empty_size,
2652 u64 hint_byte, u64 search_end,
2653 struct btrfs_key *ins, int data)
2656 u64 search_start = 0;
2658 struct btrfs_fs_info *info = root->fs_info;
2660 if (info->extent_ops) {
2661 struct btrfs_extent_ops *ops = info->extent_ops;
2662 ret = ops->alloc_extent(root, num_bytes, hint_byte, ins);
2668 alloc_profile = info->avail_data_alloc_bits &
2669 info->data_alloc_profile;
2670 data = BTRFS_BLOCK_GROUP_DATA | alloc_profile;
2671 } else if ((info->system_allocs > 0 || root == info->chunk_root) &&
2672 info->system_allocs >= 0) {
2673 alloc_profile = info->avail_system_alloc_bits &
2674 info->system_alloc_profile;
2675 data = BTRFS_BLOCK_GROUP_SYSTEM | alloc_profile;
2677 alloc_profile = info->avail_metadata_alloc_bits &
2678 info->metadata_alloc_profile;
2679 data = BTRFS_BLOCK_GROUP_METADATA | alloc_profile;
2682 if (root->ref_cows) {
2683 if (!(data & BTRFS_BLOCK_GROUP_METADATA)) {
2684 ret = do_chunk_alloc(trans, root->fs_info->extent_root,
2686 BTRFS_BLOCK_GROUP_METADATA);
2689 ret = do_chunk_alloc(trans, root->fs_info->extent_root,
2690 num_bytes + 2 * 1024 * 1024, data);
2694 WARN_ON(num_bytes < root->sectorsize);
2695 ret = find_free_extent(trans, root, num_bytes, empty_size,
2696 search_start, search_end, hint_byte, ins,
2697 trans->alloc_exclude_start,
2698 trans->alloc_exclude_nr, data);
2701 clear_extent_dirty(&root->fs_info->free_space_cache,
2702 ins->objectid, ins->objectid + ins->offset - 1,
2707 static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans,
2708 struct btrfs_root *root,
2709 u64 root_objectid, u64 generation,
2710 u64 flags, struct btrfs_disk_key *key,
2711 int level, struct btrfs_key *ins)
2714 struct btrfs_fs_info *fs_info = root->fs_info;
2715 struct btrfs_extent_item *extent_item;
2716 struct btrfs_tree_block_info *block_info;
2717 struct btrfs_extent_inline_ref *iref;
2718 struct btrfs_path *path;
2719 struct extent_buffer *leaf;
2720 u32 size = sizeof(*extent_item) + sizeof(*iref);
2721 int skinny_metadata =
2722 btrfs_fs_incompat(fs_info,
2723 BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA);
2725 if (!skinny_metadata)
2726 size += sizeof(*block_info);
2728 path = btrfs_alloc_path();
2731 path->leave_spinning = 1;
2732 ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path,
2736 leaf = path->nodes[0];
2737 extent_item = btrfs_item_ptr(leaf, path->slots[0],
2738 struct btrfs_extent_item);
2739 btrfs_set_extent_refs(leaf, extent_item, 1);
2740 btrfs_set_extent_generation(leaf, extent_item, generation);
2741 btrfs_set_extent_flags(leaf, extent_item,
2742 flags | BTRFS_EXTENT_FLAG_TREE_BLOCK);
2744 if (skinny_metadata) {
2745 iref = (struct btrfs_extent_inline_ref *)(extent_item + 1);
2747 block_info = (struct btrfs_tree_block_info *)(extent_item + 1);
2748 btrfs_set_tree_block_key(leaf, block_info, key);
2749 btrfs_set_tree_block_level(leaf, block_info, level);
2750 iref = (struct btrfs_extent_inline_ref *)(block_info + 1);
2753 btrfs_set_extent_inline_ref_type(leaf, iref, BTRFS_TREE_BLOCK_REF_KEY);
2754 btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid);
2756 btrfs_mark_buffer_dirty(leaf);
2757 btrfs_free_path(path);
2759 ret = update_block_group(trans, root, ins->objectid, root->leafsize,
2764 static int alloc_tree_block(struct btrfs_trans_handle *trans,
2765 struct btrfs_root *root, u64 num_bytes,
2766 u64 root_objectid, u64 generation,
2767 u64 flags, struct btrfs_disk_key *key,
2768 int level, u64 empty_size, u64 hint_byte,
2769 u64 search_end, struct btrfs_key *ins)
2772 ret = btrfs_reserve_extent(trans, root, num_bytes, empty_size,
2773 hint_byte, search_end, ins, 0);
2776 if (root_objectid == BTRFS_EXTENT_TREE_OBJECTID) {
2777 struct pending_extent_op *extent_op;
2779 extent_op = kmalloc(sizeof(*extent_op), GFP_NOFS);
2782 extent_op->type = PENDING_EXTENT_INSERT;
2783 extent_op->bytenr = ins->objectid;
2784 extent_op->num_bytes = ins->offset;
2785 extent_op->level = level;
2786 extent_op->flags = flags;
2787 memcpy(&extent_op->key, key, sizeof(*key));
2789 set_extent_bits(&root->fs_info->extent_ins, ins->objectid,
2790 ins->objectid + ins->offset - 1,
2791 EXTENT_LOCKED, GFP_NOFS);
2792 set_state_private(&root->fs_info->extent_ins,
2793 ins->objectid, (unsigned long)extent_op);
2795 if (btrfs_fs_incompat(root->fs_info,
2796 BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA)) {
2797 ins->offset = level;
2798 ins->type = BTRFS_METADATA_ITEM_KEY;
2800 ret = alloc_reserved_tree_block(trans, root, root_objectid,
2803 finish_current_insert(trans, root->fs_info->extent_root);
2804 del_pending_extents(trans, root->fs_info->extent_root);
2810 * helper function to allocate a block for a given tree
2811 * returns the tree buffer or NULL.
2813 struct extent_buffer *btrfs_alloc_free_block(struct btrfs_trans_handle *trans,
2814 struct btrfs_root *root,
2815 u32 blocksize, u64 root_objectid,
2816 struct btrfs_disk_key *key, int level,
2817 u64 hint, u64 empty_size)
2819 struct btrfs_key ins;
2821 struct extent_buffer *buf;
2823 ret = alloc_tree_block(trans, root, blocksize, root_objectid,
2824 trans->transid, 0, key, level,
2825 empty_size, hint, (u64)-1, &ins);
2828 return ERR_PTR(ret);
2831 buf = btrfs_find_create_tree_block(root, ins.objectid, blocksize);
2833 btrfs_free_extent(trans, root, ins.objectid, ins.offset,
2834 0, root->root_key.objectid, level, 0);
2836 return ERR_PTR(-ENOMEM);
2838 btrfs_set_buffer_uptodate(buf);
2839 trans->blocks_used++;
2846 static int noinline drop_leaf_ref(struct btrfs_trans_handle *trans,
2847 struct btrfs_root *root,
2848 struct extent_buffer *leaf)
2851 u64 leaf_generation;
2852 struct btrfs_key key;
2853 struct btrfs_file_extent_item *fi;
2858 BUG_ON(!btrfs_is_leaf(leaf));
2859 nritems = btrfs_header_nritems(leaf);
2860 leaf_owner = btrfs_header_owner(leaf);
2861 leaf_generation = btrfs_header_generation(leaf);
2863 for (i = 0; i < nritems; i++) {
2866 btrfs_item_key_to_cpu(leaf, &key, i);
2867 if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY)
2869 fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item);
2870 if (btrfs_file_extent_type(leaf, fi) ==
2871 BTRFS_FILE_EXTENT_INLINE)
2874 * FIXME make sure to insert a trans record that
2875 * repeats the snapshot del on crash
2877 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
2878 if (disk_bytenr == 0)
2880 ret = btrfs_free_extent(trans, root, disk_bytenr,
2881 btrfs_file_extent_disk_num_bytes(leaf, fi),
2882 leaf->start, leaf_owner, leaf_generation,
2889 static void noinline reada_walk_down(struct btrfs_root *root,
2890 struct extent_buffer *node,
2903 nritems = btrfs_header_nritems(node);
2904 level = btrfs_header_level(node);
2908 for (i = slot; i < nritems && skipped < 32; i++) {
2909 bytenr = btrfs_node_blockptr(node, i);
2910 if (last && ((bytenr > last && bytenr - last > 32 * 1024) ||
2911 (last > bytenr && last - bytenr > 32 * 1024))) {
2915 blocksize = btrfs_level_size(root, level - 1);
2917 ret = btrfs_lookup_extent_ref(NULL, root, bytenr,
2925 mutex_unlock(&root->fs_info->fs_mutex);
2926 ret = readahead_tree_block(root, bytenr, blocksize,
2927 btrfs_node_ptr_generation(node, i));
2928 last = bytenr + blocksize;
2930 mutex_lock(&root->fs_info->fs_mutex);
2937 * helper function for drop_snapshot, this walks down the tree dropping ref
2938 * counts as it goes.
2940 static int noinline walk_down_tree(struct btrfs_trans_handle *trans,
2941 struct btrfs_root *root,
2942 struct btrfs_path *path, int *level)
2948 struct extent_buffer *next;
2949 struct extent_buffer *cur;
2950 struct extent_buffer *parent;
2955 WARN_ON(*level < 0);
2956 WARN_ON(*level >= BTRFS_MAX_LEVEL);
2957 ret = btrfs_lookup_extent_ref(trans, root,
2958 path->nodes[*level]->start,
2959 path->nodes[*level]->len, &refs);
2965 * walk down to the last node level and free all the leaves
2967 while(*level >= 0) {
2968 WARN_ON(*level < 0);
2969 WARN_ON(*level >= BTRFS_MAX_LEVEL);
2970 cur = path->nodes[*level];
2972 if (btrfs_header_level(cur) != *level)
2975 if (path->slots[*level] >=
2976 btrfs_header_nritems(cur))
2979 ret = drop_leaf_ref(trans, root, cur);
2983 bytenr = btrfs_node_blockptr(cur, path->slots[*level]);
2984 ptr_gen = btrfs_node_ptr_generation(cur, path->slots[*level]);
2985 blocksize = btrfs_level_size(root, *level - 1);
2986 ret = btrfs_lookup_extent_ref(trans, root, bytenr, blocksize,
2990 parent = path->nodes[*level];
2991 root_owner = btrfs_header_owner(parent);
2992 root_gen = btrfs_header_generation(parent);
2993 path->slots[*level]++;
2994 ret = btrfs_free_extent(trans, root, bytenr, blocksize,
2995 parent->start, root_owner,
2996 root_gen, *level - 1, 1);
3000 next = btrfs_find_tree_block(root, bytenr, blocksize);
3001 if (!next || !btrfs_buffer_uptodate(next, ptr_gen)) {
3002 free_extent_buffer(next);
3003 reada_walk_down(root, cur, path->slots[*level]);
3004 mutex_unlock(&root->fs_info->fs_mutex);
3005 next = read_tree_block(root, bytenr, blocksize,
3007 mutex_lock(&root->fs_info->fs_mutex);
3009 WARN_ON(*level <= 0);
3010 if (path->nodes[*level-1])
3011 free_extent_buffer(path->nodes[*level-1]);
3012 path->nodes[*level-1] = next;
3013 *level = btrfs_header_level(next);
3014 path->slots[*level] = 0;
3017 WARN_ON(*level < 0);
3018 WARN_ON(*level >= BTRFS_MAX_LEVEL);
3020 if (path->nodes[*level] == root->node) {
3021 root_owner = root->root_key.objectid;
3022 parent = path->nodes[*level];
3024 parent = path->nodes[*level + 1];
3025 root_owner = btrfs_header_owner(parent);
3028 root_gen = btrfs_header_generation(parent);
3029 ret = btrfs_free_extent(trans, root, path->nodes[*level]->start,
3030 path->nodes[*level]->len, parent->start,
3031 root_owner, root_gen, *level, 1);
3032 free_extent_buffer(path->nodes[*level]);
3033 path->nodes[*level] = NULL;
3040 * helper for dropping snapshots. This walks back up the tree in the path
3041 * to find the first node higher up where we haven't yet gone through
3044 static int noinline walk_up_tree(struct btrfs_trans_handle *trans,
3045 struct btrfs_root *root,
3046 struct btrfs_path *path, int *level)
3050 struct btrfs_root_item *root_item = &root->root_item;
3055 for(i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) {
3056 slot = path->slots[i];
3057 if (slot < btrfs_header_nritems(path->nodes[i]) - 1) {
3058 struct extent_buffer *node;
3059 struct btrfs_disk_key disk_key;
3060 node = path->nodes[i];
3063 WARN_ON(*level == 0);
3064 btrfs_node_key(node, &disk_key, path->slots[i]);
3065 memcpy(&root_item->drop_progress,
3066 &disk_key, sizeof(disk_key));
3067 root_item->drop_level = i;
3070 struct extent_buffer *parent;
3071 if (path->nodes[*level] == root->node)
3072 parent = path->nodes[*level];
3074 parent = path->nodes[*level + 1];
3076 root_owner = btrfs_header_owner(parent);
3077 root_gen = btrfs_header_generation(parent);
3078 ret = btrfs_free_extent(trans, root,
3079 path->nodes[*level]->start,
3080 path->nodes[*level]->len,
3081 parent->start, root_owner,
3082 root_gen, *level, 1);
3084 free_extent_buffer(path->nodes[*level]);
3085 path->nodes[*level] = NULL;
3094 int btrfs_free_block_groups(struct btrfs_fs_info *info)
3096 struct btrfs_space_info *sinfo;
3097 struct btrfs_block_group_cache *cache;
3104 ret = find_first_extent_bit(&info->block_group_cache, 0,
3105 &start, &end, (unsigned int)-1);
3108 ret = get_state_private(&info->block_group_cache, start, &ptr);
3110 cache = (struct btrfs_block_group_cache *)
3112 if (cache->free_space_ctl) {
3113 btrfs_remove_free_space_cache(cache);
3114 kfree(cache->free_space_ctl);
3118 clear_extent_bits(&info->block_group_cache, start,
3119 end, (unsigned int)-1, GFP_NOFS);
3122 ret = find_first_extent_bit(&info->free_space_cache, 0,
3123 &start, &end, EXTENT_DIRTY);
3126 clear_extent_dirty(&info->free_space_cache, start,
3130 while (!list_empty(&info->space_info)) {
3131 sinfo = list_entry(info->space_info.next,
3132 struct btrfs_space_info, list);
3133 list_del_init(&sinfo->list);
3139 int find_first_block_group(struct btrfs_root *root, struct btrfs_path *path,
3140 struct btrfs_key *key)
3143 struct btrfs_key found_key;
3144 struct extent_buffer *leaf;
3147 ret = btrfs_search_slot(NULL, root, key, path, 0, 0);
3151 slot = path->slots[0];
3152 leaf = path->nodes[0];
3153 if (slot >= btrfs_header_nritems(leaf)) {
3154 ret = btrfs_next_leaf(root, path);
3161 btrfs_item_key_to_cpu(leaf, &found_key, slot);
3163 if (found_key.objectid >= key->objectid &&
3164 found_key.type == BTRFS_BLOCK_GROUP_ITEM_KEY)
3173 int btrfs_read_block_groups(struct btrfs_root *root)
3175 struct btrfs_path *path;
3178 struct btrfs_block_group_cache *cache;
3179 struct btrfs_fs_info *info = root->fs_info;
3180 struct btrfs_space_info *space_info;
3181 struct extent_io_tree *block_group_cache;
3182 struct btrfs_key key;
3183 struct btrfs_key found_key;
3184 struct extent_buffer *leaf;
3186 block_group_cache = &info->block_group_cache;
3188 root = info->extent_root;
3191 btrfs_set_key_type(&key, BTRFS_BLOCK_GROUP_ITEM_KEY);
3192 path = btrfs_alloc_path();
3197 ret = find_first_block_group(root, path, &key);
3205 leaf = path->nodes[0];
3206 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3207 cache = kzalloc(sizeof(*cache), GFP_NOFS);
3213 read_extent_buffer(leaf, &cache->item,
3214 btrfs_item_ptr_offset(leaf, path->slots[0]),
3215 sizeof(cache->item));
3216 memcpy(&cache->key, &found_key, sizeof(found_key));
3219 key.objectid = found_key.objectid + found_key.offset;
3220 btrfs_release_path(root, path);
3221 cache->flags = btrfs_block_group_flags(&cache->item);
3223 if (cache->flags & BTRFS_BLOCK_GROUP_DATA) {
3224 bit = BLOCK_GROUP_DATA;
3225 } else if (cache->flags & BTRFS_BLOCK_GROUP_SYSTEM) {
3226 bit = BLOCK_GROUP_SYSTEM;
3227 } else if (cache->flags & BTRFS_BLOCK_GROUP_METADATA) {
3228 bit = BLOCK_GROUP_METADATA;
3230 set_avail_alloc_bits(info, cache->flags);
3231 if (btrfs_chunk_readonly(root, cache->key.objectid))
3234 ret = update_space_info(info, cache->flags, found_key.offset,
3235 btrfs_block_group_used(&cache->item),
3238 cache->space_info = space_info;
3240 /* use EXTENT_LOCKED to prevent merging */
3241 set_extent_bits(block_group_cache, found_key.objectid,
3242 found_key.objectid + found_key.offset - 1,
3243 bit | EXTENT_LOCKED, GFP_NOFS);
3244 set_state_private(block_group_cache, found_key.objectid,
3245 (unsigned long)cache);
3249 btrfs_free_path(path);
3253 struct btrfs_block_group_cache *
3254 btrfs_add_block_group(struct btrfs_fs_info *fs_info, u64 bytes_used, u64 type,
3255 u64 chunk_objectid, u64 chunk_offset, u64 size)
3259 struct btrfs_block_group_cache *cache;
3260 struct extent_io_tree *block_group_cache;
3262 block_group_cache = &fs_info->block_group_cache;
3264 cache = kzalloc(sizeof(*cache), GFP_NOFS);
3266 cache->key.objectid = chunk_offset;
3267 cache->key.offset = size;
3269 btrfs_set_key_type(&cache->key, BTRFS_BLOCK_GROUP_ITEM_KEY);
3270 btrfs_set_block_group_used(&cache->item, bytes_used);
3271 btrfs_set_block_group_chunk_objectid(&cache->item, chunk_objectid);
3272 cache->flags = type;
3273 btrfs_set_block_group_flags(&cache->item, type);
3275 ret = update_space_info(fs_info, cache->flags, size, bytes_used,
3276 &cache->space_info);
3279 bit = block_group_state_bits(type);
3280 ret = set_extent_bits(block_group_cache, chunk_offset,
3281 chunk_offset + size - 1,
3282 bit | EXTENT_LOCKED, GFP_NOFS);
3285 ret = set_state_private(block_group_cache, chunk_offset,
3286 (unsigned long)cache);
3288 set_avail_alloc_bits(fs_info, type);
3293 int btrfs_make_block_group(struct btrfs_trans_handle *trans,
3294 struct btrfs_root *root, u64 bytes_used,
3295 u64 type, u64 chunk_objectid, u64 chunk_offset,
3299 struct btrfs_root *extent_root;
3300 struct btrfs_block_group_cache *cache;
3302 cache = btrfs_add_block_group(root->fs_info, bytes_used, type,
3303 chunk_objectid, chunk_offset, size);
3304 extent_root = root->fs_info->extent_root;
3305 ret = btrfs_insert_item(trans, extent_root, &cache->key, &cache->item,
3306 sizeof(cache->item));
3309 ret = finish_current_insert(trans, extent_root);
3311 ret = del_pending_extents(trans, extent_root);
3318 * This is for converter use only.
3320 * In that case, we don't know where are free blocks located.
3321 * Therefore all block group cache entries must be setup properly
3322 * before doing any block allocation.
3324 int btrfs_make_block_groups(struct btrfs_trans_handle *trans,
3325 struct btrfs_root *root)
3333 u64 total_metadata = 0;
3337 struct btrfs_root *extent_root;
3338 struct btrfs_block_group_cache *cache;
3339 struct extent_io_tree *block_group_cache;
3341 extent_root = root->fs_info->extent_root;
3342 block_group_cache = &root->fs_info->block_group_cache;
3343 chunk_objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
3344 total_bytes = btrfs_super_total_bytes(root->fs_info->super_copy);
3345 group_align = 64 * root->sectorsize;
3348 while (cur_start < total_bytes) {
3349 group_size = total_bytes / 12;
3350 group_size = min_t(u64, group_size, total_bytes - cur_start);
3351 if (cur_start == 0) {
3352 bit = BLOCK_GROUP_SYSTEM;
3353 group_type = BTRFS_BLOCK_GROUP_SYSTEM;
3355 group_size &= ~(group_align - 1);
3356 group_size = max_t(u64, group_size, 8 * 1024 * 1024);
3357 group_size = min_t(u64, group_size, 32 * 1024 * 1024);
3359 group_size &= ~(group_align - 1);
3360 if (total_data >= total_metadata * 2) {
3361 group_type = BTRFS_BLOCK_GROUP_METADATA;
3362 group_size = min_t(u64, group_size,
3363 1ULL * 1024 * 1024 * 1024);
3364 total_metadata += group_size;
3366 group_type = BTRFS_BLOCK_GROUP_DATA;
3367 group_size = min_t(u64, group_size,
3368 5ULL * 1024 * 1024 * 1024);
3369 total_data += group_size;
3371 if ((total_bytes - cur_start) * 4 < group_size * 5)
3372 group_size = total_bytes - cur_start;
3375 cache = kzalloc(sizeof(*cache), GFP_NOFS);
3378 cache->key.objectid = cur_start;
3379 cache->key.offset = group_size;
3380 btrfs_set_key_type(&cache->key, BTRFS_BLOCK_GROUP_ITEM_KEY);
3382 btrfs_set_block_group_used(&cache->item, 0);
3383 btrfs_set_block_group_chunk_objectid(&cache->item,
3385 btrfs_set_block_group_flags(&cache->item, group_type);
3387 cache->flags = group_type;
3389 ret = update_space_info(root->fs_info, group_type, group_size,
3390 0, &cache->space_info);
3392 set_avail_alloc_bits(extent_root->fs_info, group_type);
3394 set_extent_bits(block_group_cache, cur_start,
3395 cur_start + group_size - 1,
3396 bit | EXTENT_LOCKED, GFP_NOFS);
3397 set_state_private(block_group_cache, cur_start,
3398 (unsigned long)cache);
3399 cur_start += group_size;
3401 /* then insert all the items */
3403 while(cur_start < total_bytes) {
3404 cache = btrfs_lookup_block_group(root->fs_info, cur_start);
3407 ret = btrfs_insert_item(trans, extent_root, &cache->key, &cache->item,
3408 sizeof(cache->item));
3411 finish_current_insert(trans, extent_root);
3412 ret = del_pending_extents(trans, extent_root);
3415 cur_start = cache->key.objectid + cache->key.offset;
3420 int btrfs_update_block_group(struct btrfs_trans_handle *trans,
3421 struct btrfs_root *root,
3422 u64 bytenr, u64 num_bytes, int alloc,
3425 return update_block_group(trans, root, bytenr, num_bytes,
3429 static int btrfs_count_extents_in_block_group(struct btrfs_root *root,
3430 struct btrfs_path *path, u64 start,
3434 struct btrfs_key key;
3435 struct extent_buffer *leaf;
3441 key.objectid = start;
3442 btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY);
3443 ret = btrfs_search_slot(NULL, root->fs_info->extent_root,
3448 leaf = path->nodes[0];
3449 slot = path->slots[0];
3450 if (slot >= btrfs_header_nritems(leaf)) {
3451 ret = btrfs_next_leaf(root, path);
3456 leaf = path->nodes[0];
3457 slot = path->slots[0];
3459 btrfs_item_key_to_cpu(leaf, &key, slot);
3460 if (key.objectid > start + len)
3462 if (key.type == BTRFS_EXTENT_ITEM_KEY)
3463 bytes_used += key.offset;
3464 if (key.type == BTRFS_METADATA_ITEM_KEY)
3465 bytes_used += root->leafsize;
3468 *total = bytes_used;
3469 btrfs_release_path(root, path);
3473 int btrfs_check_block_accounting(struct btrfs_root *root)
3478 struct btrfs_path path;
3479 struct btrfs_block_group_cache *cache;
3480 struct btrfs_fs_info *fs_info = root->fs_info;
3482 btrfs_init_path(&path);
3485 cache = btrfs_lookup_block_group(fs_info, start);
3489 ret = btrfs_count_extents_in_block_group(root, &path,
3490 cache->key.objectid,
3495 u64 on_disk = btrfs_block_group_used(&cache->item);
3496 if (on_disk != bytes_used) {
3497 fprintf(stderr, "bad block group accounting found %llu "
3498 "expected %llu block group %llu\n",
3499 (unsigned long long)bytes_used,
3500 (unsigned long long)on_disk,
3501 (unsigned long long)cache->key.objectid);
3504 start = cache->key.objectid + cache->key.offset;
3506 cache->space_info->bytes_used = 0;
3512 * Fixup block accounting. The initial block accounting created by
3513 * make_block_groups isn't accuracy in this case.
3515 int btrfs_fix_block_accounting(struct btrfs_trans_handle *trans,
3516 struct btrfs_root *root)
3522 struct btrfs_path path;
3523 struct btrfs_key key;
3524 struct extent_buffer *leaf;
3525 struct btrfs_block_group_cache *cache;
3526 struct btrfs_fs_info *fs_info = root->fs_info;
3528 root = root->fs_info->extent_root;
3530 while(extent_root_pending_ops(fs_info)) {
3531 ret = finish_current_insert(trans, root);
3534 ret = del_pending_extents(trans, root);
3540 cache = btrfs_lookup_first_block_group(fs_info, start);
3543 start = cache->key.objectid + cache->key.offset;
3544 btrfs_set_block_group_used(&cache->item, 0);
3545 cache->space_info->bytes_used = 0;
3546 set_extent_bits(&root->fs_info->block_group_cache,
3547 cache->key.objectid,
3548 cache->key.objectid + cache->key.offset -1,
3549 BLOCK_GROUP_DIRTY, GFP_NOFS);
3552 btrfs_init_path(&path);
3555 btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY);
3556 ret = btrfs_search_slot(trans, root->fs_info->extent_root,
3561 leaf = path.nodes[0];
3562 slot = path.slots[0];
3563 if (slot >= btrfs_header_nritems(leaf)) {
3564 ret = btrfs_next_leaf(root, &path);
3569 leaf = path.nodes[0];
3570 slot = path.slots[0];
3572 btrfs_item_key_to_cpu(leaf, &key, slot);
3573 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
3574 bytes_used += key.offset;
3575 ret = btrfs_update_block_group(trans, root,
3576 key.objectid, key.offset, 1, 0);
3578 } else if (key.type == BTRFS_METADATA_ITEM_KEY) {
3579 bytes_used += root->leafsize;
3580 ret = btrfs_update_block_group(trans, root,
3581 key.objectid, root->leafsize, 1, 0);
3586 btrfs_set_super_bytes_used(root->fs_info->super_copy, bytes_used);
3587 btrfs_release_path(root, &path);