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.
20 #include <linux/blkdev.h>
21 #include <linux/scatterlist.h>
22 #include <linux/swap.h>
23 #include <linux/radix-tree.h>
24 #include <linux/writeback.h>
25 #include <linux/buffer_head.h>
26 #include <linux/workqueue.h>
27 #include <linux/kthread.h>
28 #include <linux/freezer.h>
29 #include <linux/slab.h>
30 #include <linux/migrate.h>
31 #include <linux/ratelimit.h>
32 #include <linux/uuid.h>
33 #include <linux/semaphore.h>
34 #include <asm/unaligned.h>
38 #include "transaction.h"
39 #include "btrfs_inode.h"
41 #include "print-tree.h"
44 #include "free-space-cache.h"
45 #include "inode-map.h"
46 #include "check-integrity.h"
47 #include "rcu-string.h"
48 #include "dev-replace.h"
54 #include <asm/cpufeature.h>
57 static struct extent_io_ops btree_extent_io_ops
;
58 static void end_workqueue_fn(struct btrfs_work
*work
);
59 static void free_fs_root(struct btrfs_root
*root
);
60 static int btrfs_check_super_valid(struct btrfs_fs_info
*fs_info
,
62 static void btrfs_destroy_ordered_extents(struct btrfs_root
*root
);
63 static int btrfs_destroy_delayed_refs(struct btrfs_transaction
*trans
,
64 struct btrfs_root
*root
);
65 static void btrfs_destroy_delalloc_inodes(struct btrfs_root
*root
);
66 static int btrfs_destroy_marked_extents(struct btrfs_root
*root
,
67 struct extent_io_tree
*dirty_pages
,
69 static int btrfs_destroy_pinned_extent(struct btrfs_root
*root
,
70 struct extent_io_tree
*pinned_extents
);
71 static int btrfs_cleanup_transaction(struct btrfs_root
*root
);
72 static void btrfs_error_commit_super(struct btrfs_root
*root
);
75 * btrfs_end_io_wq structs are used to do processing in task context when an IO
76 * is complete. This is used during reads to verify checksums, and it is used
77 * by writes to insert metadata for new file extents after IO is complete.
79 struct btrfs_end_io_wq
{
83 struct btrfs_fs_info
*info
;
85 enum btrfs_wq_endio_type metadata
;
86 struct list_head list
;
87 struct btrfs_work work
;
90 static struct kmem_cache
*btrfs_end_io_wq_cache
;
92 int __init
btrfs_end_io_wq_init(void)
94 btrfs_end_io_wq_cache
= kmem_cache_create("btrfs_end_io_wq",
95 sizeof(struct btrfs_end_io_wq
),
97 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
,
99 if (!btrfs_end_io_wq_cache
)
104 void btrfs_end_io_wq_exit(void)
106 if (btrfs_end_io_wq_cache
)
107 kmem_cache_destroy(btrfs_end_io_wq_cache
);
111 * async submit bios are used to offload expensive checksumming
112 * onto the worker threads. They checksum file and metadata bios
113 * just before they are sent down the IO stack.
115 struct async_submit_bio
{
118 struct list_head list
;
119 extent_submit_bio_hook_t
*submit_bio_start
;
120 extent_submit_bio_hook_t
*submit_bio_done
;
123 unsigned long bio_flags
;
125 * bio_offset is optional, can be used if the pages in the bio
126 * can't tell us where in the file the bio should go
129 struct btrfs_work work
;
134 * Lockdep class keys for extent_buffer->lock's in this root. For a given
135 * eb, the lockdep key is determined by the btrfs_root it belongs to and
136 * the level the eb occupies in the tree.
138 * Different roots are used for different purposes and may nest inside each
139 * other and they require separate keysets. As lockdep keys should be
140 * static, assign keysets according to the purpose of the root as indicated
141 * by btrfs_root->objectid. This ensures that all special purpose roots
142 * have separate keysets.
144 * Lock-nesting across peer nodes is always done with the immediate parent
145 * node locked thus preventing deadlock. As lockdep doesn't know this, use
146 * subclass to avoid triggering lockdep warning in such cases.
148 * The key is set by the readpage_end_io_hook after the buffer has passed
149 * csum validation but before the pages are unlocked. It is also set by
150 * btrfs_init_new_buffer on freshly allocated blocks.
152 * We also add a check to make sure the highest level of the tree is the
153 * same as our lockdep setup here. If BTRFS_MAX_LEVEL changes, this code
154 * needs update as well.
156 #ifdef CONFIG_DEBUG_LOCK_ALLOC
157 # if BTRFS_MAX_LEVEL != 8
161 static struct btrfs_lockdep_keyset
{
162 u64 id
; /* root objectid */
163 const char *name_stem
; /* lock name stem */
164 char names
[BTRFS_MAX_LEVEL
+ 1][20];
165 struct lock_class_key keys
[BTRFS_MAX_LEVEL
+ 1];
166 } btrfs_lockdep_keysets
[] = {
167 { .id
= BTRFS_ROOT_TREE_OBJECTID
, .name_stem
= "root" },
168 { .id
= BTRFS_EXTENT_TREE_OBJECTID
, .name_stem
= "extent" },
169 { .id
= BTRFS_CHUNK_TREE_OBJECTID
, .name_stem
= "chunk" },
170 { .id
= BTRFS_DEV_TREE_OBJECTID
, .name_stem
= "dev" },
171 { .id
= BTRFS_FS_TREE_OBJECTID
, .name_stem
= "fs" },
172 { .id
= BTRFS_CSUM_TREE_OBJECTID
, .name_stem
= "csum" },
173 { .id
= BTRFS_QUOTA_TREE_OBJECTID
, .name_stem
= "quota" },
174 { .id
= BTRFS_TREE_LOG_OBJECTID
, .name_stem
= "log" },
175 { .id
= BTRFS_TREE_RELOC_OBJECTID
, .name_stem
= "treloc" },
176 { .id
= BTRFS_DATA_RELOC_TREE_OBJECTID
, .name_stem
= "dreloc" },
177 { .id
= BTRFS_UUID_TREE_OBJECTID
, .name_stem
= "uuid" },
178 { .id
= 0, .name_stem
= "tree" },
181 void __init
btrfs_init_lockdep(void)
185 /* initialize lockdep class names */
186 for (i
= 0; i
< ARRAY_SIZE(btrfs_lockdep_keysets
); i
++) {
187 struct btrfs_lockdep_keyset
*ks
= &btrfs_lockdep_keysets
[i
];
189 for (j
= 0; j
< ARRAY_SIZE(ks
->names
); j
++)
190 snprintf(ks
->names
[j
], sizeof(ks
->names
[j
]),
191 "btrfs-%s-%02d", ks
->name_stem
, j
);
195 void btrfs_set_buffer_lockdep_class(u64 objectid
, struct extent_buffer
*eb
,
198 struct btrfs_lockdep_keyset
*ks
;
200 BUG_ON(level
>= ARRAY_SIZE(ks
->keys
));
202 /* find the matching keyset, id 0 is the default entry */
203 for (ks
= btrfs_lockdep_keysets
; ks
->id
; ks
++)
204 if (ks
->id
== objectid
)
207 lockdep_set_class_and_name(&eb
->lock
,
208 &ks
->keys
[level
], ks
->names
[level
]);
214 * extents on the btree inode are pretty simple, there's one extent
215 * that covers the entire device
217 static struct extent_map
*btree_get_extent(struct inode
*inode
,
218 struct page
*page
, size_t pg_offset
, u64 start
, u64 len
,
221 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
222 struct extent_map
*em
;
225 read_lock(&em_tree
->lock
);
226 em
= lookup_extent_mapping(em_tree
, start
, len
);
229 BTRFS_I(inode
)->root
->fs_info
->fs_devices
->latest_bdev
;
230 read_unlock(&em_tree
->lock
);
233 read_unlock(&em_tree
->lock
);
235 em
= alloc_extent_map();
237 em
= ERR_PTR(-ENOMEM
);
242 em
->block_len
= (u64
)-1;
244 em
->bdev
= BTRFS_I(inode
)->root
->fs_info
->fs_devices
->latest_bdev
;
246 write_lock(&em_tree
->lock
);
247 ret
= add_extent_mapping(em_tree
, em
, 0);
248 if (ret
== -EEXIST
) {
250 em
= lookup_extent_mapping(em_tree
, start
, len
);
257 write_unlock(&em_tree
->lock
);
263 u32
btrfs_csum_data(char *data
, u32 seed
, size_t len
)
265 return btrfs_crc32c(seed
, data
, len
);
268 void btrfs_csum_final(u32 crc
, char *result
)
270 put_unaligned_le32(~crc
, result
);
274 * compute the csum for a btree block, and either verify it or write it
275 * into the csum field of the block.
277 static int csum_tree_block(struct btrfs_root
*root
, struct extent_buffer
*buf
,
280 u16 csum_size
= btrfs_super_csum_size(root
->fs_info
->super_copy
);
283 unsigned long cur_len
;
284 unsigned long offset
= BTRFS_CSUM_SIZE
;
286 unsigned long map_start
;
287 unsigned long map_len
;
290 unsigned long inline_result
;
292 len
= buf
->len
- offset
;
294 err
= map_private_extent_buffer(buf
, offset
, 32,
295 &kaddr
, &map_start
, &map_len
);
298 cur_len
= min(len
, map_len
- (offset
- map_start
));
299 crc
= btrfs_csum_data(kaddr
+ offset
- map_start
,
304 if (csum_size
> sizeof(inline_result
)) {
305 result
= kzalloc(csum_size
* sizeof(char), GFP_NOFS
);
309 result
= (char *)&inline_result
;
312 btrfs_csum_final(crc
, result
);
315 if (memcmp_extent_buffer(buf
, result
, 0, csum_size
)) {
318 memcpy(&found
, result
, csum_size
);
320 read_extent_buffer(buf
, &val
, 0, csum_size
);
321 printk_ratelimited(KERN_INFO
322 "BTRFS: %s checksum verify failed on %llu wanted %X found %X "
324 root
->fs_info
->sb
->s_id
, buf
->start
,
325 val
, found
, btrfs_header_level(buf
));
326 if (result
!= (char *)&inline_result
)
331 write_extent_buffer(buf
, result
, 0, csum_size
);
333 if (result
!= (char *)&inline_result
)
339 * we can't consider a given block up to date unless the transid of the
340 * block matches the transid in the parent node's pointer. This is how we
341 * detect blocks that either didn't get written at all or got written
342 * in the wrong place.
344 static int verify_parent_transid(struct extent_io_tree
*io_tree
,
345 struct extent_buffer
*eb
, u64 parent_transid
,
348 struct extent_state
*cached_state
= NULL
;
350 bool need_lock
= (current
->journal_info
== BTRFS_SEND_TRANS_STUB
);
352 if (!parent_transid
|| btrfs_header_generation(eb
) == parent_transid
)
359 btrfs_tree_read_lock(eb
);
360 btrfs_set_lock_blocking_rw(eb
, BTRFS_READ_LOCK
);
363 lock_extent_bits(io_tree
, eb
->start
, eb
->start
+ eb
->len
- 1,
365 if (extent_buffer_uptodate(eb
) &&
366 btrfs_header_generation(eb
) == parent_transid
) {
370 printk_ratelimited(KERN_INFO
"BTRFS (device %s): parent transid verify failed on %llu wanted %llu found %llu\n",
371 eb
->fs_info
->sb
->s_id
, eb
->start
,
372 parent_transid
, btrfs_header_generation(eb
));
376 * Things reading via commit roots that don't have normal protection,
377 * like send, can have a really old block in cache that may point at a
378 * block that has been free'd and re-allocated. So don't clear uptodate
379 * if we find an eb that is under IO (dirty/writeback) because we could
380 * end up reading in the stale data and then writing it back out and
381 * making everybody very sad.
383 if (!extent_buffer_under_io(eb
))
384 clear_extent_buffer_uptodate(eb
);
386 unlock_extent_cached(io_tree
, eb
->start
, eb
->start
+ eb
->len
- 1,
387 &cached_state
, GFP_NOFS
);
389 btrfs_tree_read_unlock_blocking(eb
);
394 * Return 0 if the superblock checksum type matches the checksum value of that
395 * algorithm. Pass the raw disk superblock data.
397 static int btrfs_check_super_csum(char *raw_disk_sb
)
399 struct btrfs_super_block
*disk_sb
=
400 (struct btrfs_super_block
*)raw_disk_sb
;
401 u16 csum_type
= btrfs_super_csum_type(disk_sb
);
404 if (csum_type
== BTRFS_CSUM_TYPE_CRC32
) {
406 const int csum_size
= sizeof(crc
);
407 char result
[csum_size
];
410 * The super_block structure does not span the whole
411 * BTRFS_SUPER_INFO_SIZE range, we expect that the unused space
412 * is filled with zeros and is included in the checkum.
414 crc
= btrfs_csum_data(raw_disk_sb
+ BTRFS_CSUM_SIZE
,
415 crc
, BTRFS_SUPER_INFO_SIZE
- BTRFS_CSUM_SIZE
);
416 btrfs_csum_final(crc
, result
);
418 if (memcmp(raw_disk_sb
, result
, csum_size
))
421 if (ret
&& btrfs_super_generation(disk_sb
) < 10) {
423 "BTRFS: super block crcs don't match, older mkfs detected\n");
428 if (csum_type
>= ARRAY_SIZE(btrfs_csum_sizes
)) {
429 printk(KERN_ERR
"BTRFS: unsupported checksum algorithm %u\n",
438 * helper to read a given tree block, doing retries as required when
439 * the checksums don't match and we have alternate mirrors to try.
441 static int btree_read_extent_buffer_pages(struct btrfs_root
*root
,
442 struct extent_buffer
*eb
,
443 u64 start
, u64 parent_transid
)
445 struct extent_io_tree
*io_tree
;
450 int failed_mirror
= 0;
452 clear_bit(EXTENT_BUFFER_CORRUPT
, &eb
->bflags
);
453 io_tree
= &BTRFS_I(root
->fs_info
->btree_inode
)->io_tree
;
455 ret
= read_extent_buffer_pages(io_tree
, eb
, start
,
457 btree_get_extent
, mirror_num
);
459 if (!verify_parent_transid(io_tree
, eb
,
467 * This buffer's crc is fine, but its contents are corrupted, so
468 * there is no reason to read the other copies, they won't be
471 if (test_bit(EXTENT_BUFFER_CORRUPT
, &eb
->bflags
))
474 num_copies
= btrfs_num_copies(root
->fs_info
,
479 if (!failed_mirror
) {
481 failed_mirror
= eb
->read_mirror
;
485 if (mirror_num
== failed_mirror
)
488 if (mirror_num
> num_copies
)
492 if (failed
&& !ret
&& failed_mirror
)
493 repair_eb_io_failure(root
, eb
, failed_mirror
);
499 * checksum a dirty tree block before IO. This has extra checks to make sure
500 * we only fill in the checksum field in the first page of a multi-page block
503 static int csum_dirty_buffer(struct btrfs_root
*root
, struct page
*page
)
505 u64 start
= page_offset(page
);
507 struct extent_buffer
*eb
;
509 eb
= (struct extent_buffer
*)page
->private;
510 if (page
!= eb
->pages
[0])
512 found_start
= btrfs_header_bytenr(eb
);
513 if (WARN_ON(found_start
!= start
|| !PageUptodate(page
)))
515 csum_tree_block(root
, eb
, 0);
519 static int check_tree_block_fsid(struct btrfs_root
*root
,
520 struct extent_buffer
*eb
)
522 struct btrfs_fs_devices
*fs_devices
= root
->fs_info
->fs_devices
;
523 u8 fsid
[BTRFS_UUID_SIZE
];
526 read_extent_buffer(eb
, fsid
, btrfs_header_fsid(), BTRFS_FSID_SIZE
);
528 if (!memcmp(fsid
, fs_devices
->fsid
, BTRFS_FSID_SIZE
)) {
532 fs_devices
= fs_devices
->seed
;
537 #define CORRUPT(reason, eb, root, slot) \
538 btrfs_crit(root->fs_info, "corrupt leaf, %s: block=%llu," \
539 "root=%llu, slot=%d", reason, \
540 btrfs_header_bytenr(eb), root->objectid, slot)
542 static noinline
int check_leaf(struct btrfs_root
*root
,
543 struct extent_buffer
*leaf
)
545 struct btrfs_key key
;
546 struct btrfs_key leaf_key
;
547 u32 nritems
= btrfs_header_nritems(leaf
);
553 /* Check the 0 item */
554 if (btrfs_item_offset_nr(leaf
, 0) + btrfs_item_size_nr(leaf
, 0) !=
555 BTRFS_LEAF_DATA_SIZE(root
)) {
556 CORRUPT("invalid item offset size pair", leaf
, root
, 0);
561 * Check to make sure each items keys are in the correct order and their
562 * offsets make sense. We only have to loop through nritems-1 because
563 * we check the current slot against the next slot, which verifies the
564 * next slot's offset+size makes sense and that the current's slot
567 for (slot
= 0; slot
< nritems
- 1; slot
++) {
568 btrfs_item_key_to_cpu(leaf
, &leaf_key
, slot
);
569 btrfs_item_key_to_cpu(leaf
, &key
, slot
+ 1);
571 /* Make sure the keys are in the right order */
572 if (btrfs_comp_cpu_keys(&leaf_key
, &key
) >= 0) {
573 CORRUPT("bad key order", leaf
, root
, slot
);
578 * Make sure the offset and ends are right, remember that the
579 * item data starts at the end of the leaf and grows towards the
582 if (btrfs_item_offset_nr(leaf
, slot
) !=
583 btrfs_item_end_nr(leaf
, slot
+ 1)) {
584 CORRUPT("slot offset bad", leaf
, root
, slot
);
589 * Check to make sure that we don't point outside of the leaf,
590 * just incase all the items are consistent to eachother, but
591 * all point outside of the leaf.
593 if (btrfs_item_end_nr(leaf
, slot
) >
594 BTRFS_LEAF_DATA_SIZE(root
)) {
595 CORRUPT("slot end outside of leaf", leaf
, root
, slot
);
603 static int btree_readpage_end_io_hook(struct btrfs_io_bio
*io_bio
,
604 u64 phy_offset
, struct page
*page
,
605 u64 start
, u64 end
, int mirror
)
609 struct extent_buffer
*eb
;
610 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
617 eb
= (struct extent_buffer
*)page
->private;
619 /* the pending IO might have been the only thing that kept this buffer
620 * in memory. Make sure we have a ref for all this other checks
622 extent_buffer_get(eb
);
624 reads_done
= atomic_dec_and_test(&eb
->io_pages
);
628 eb
->read_mirror
= mirror
;
629 if (test_bit(EXTENT_BUFFER_READ_ERR
, &eb
->bflags
)) {
634 found_start
= btrfs_header_bytenr(eb
);
635 if (found_start
!= eb
->start
) {
636 printk_ratelimited(KERN_INFO
"BTRFS (device %s): bad tree block start "
638 eb
->fs_info
->sb
->s_id
, found_start
, eb
->start
);
642 if (check_tree_block_fsid(root
, eb
)) {
643 printk_ratelimited(KERN_INFO
"BTRFS (device %s): bad fsid on block %llu\n",
644 eb
->fs_info
->sb
->s_id
, eb
->start
);
648 found_level
= btrfs_header_level(eb
);
649 if (found_level
>= BTRFS_MAX_LEVEL
) {
650 btrfs_info(root
->fs_info
, "bad tree block level %d",
651 (int)btrfs_header_level(eb
));
656 btrfs_set_buffer_lockdep_class(btrfs_header_owner(eb
),
659 ret
= csum_tree_block(root
, eb
, 1);
666 * If this is a leaf block and it is corrupt, set the corrupt bit so
667 * that we don't try and read the other copies of this block, just
670 if (found_level
== 0 && check_leaf(root
, eb
)) {
671 set_bit(EXTENT_BUFFER_CORRUPT
, &eb
->bflags
);
676 set_extent_buffer_uptodate(eb
);
679 test_and_clear_bit(EXTENT_BUFFER_READAHEAD
, &eb
->bflags
))
680 btree_readahead_hook(root
, eb
, eb
->start
, ret
);
684 * our io error hook is going to dec the io pages
685 * again, we have to make sure it has something
688 atomic_inc(&eb
->io_pages
);
689 clear_extent_buffer_uptodate(eb
);
691 free_extent_buffer(eb
);
696 static int btree_io_failed_hook(struct page
*page
, int failed_mirror
)
698 struct extent_buffer
*eb
;
699 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
701 eb
= (struct extent_buffer
*)page
->private;
702 set_bit(EXTENT_BUFFER_READ_ERR
, &eb
->bflags
);
703 eb
->read_mirror
= failed_mirror
;
704 atomic_dec(&eb
->io_pages
);
705 if (test_and_clear_bit(EXTENT_BUFFER_READAHEAD
, &eb
->bflags
))
706 btree_readahead_hook(root
, eb
, eb
->start
, -EIO
);
707 return -EIO
; /* we fixed nothing */
710 static void end_workqueue_bio(struct bio
*bio
, int err
)
712 struct btrfs_end_io_wq
*end_io_wq
= bio
->bi_private
;
713 struct btrfs_fs_info
*fs_info
;
714 struct btrfs_workqueue
*wq
;
715 btrfs_work_func_t func
;
717 fs_info
= end_io_wq
->info
;
718 end_io_wq
->error
= err
;
720 if (bio
->bi_rw
& REQ_WRITE
) {
721 if (end_io_wq
->metadata
== BTRFS_WQ_ENDIO_METADATA
) {
722 wq
= fs_info
->endio_meta_write_workers
;
723 func
= btrfs_endio_meta_write_helper
;
724 } else if (end_io_wq
->metadata
== BTRFS_WQ_ENDIO_FREE_SPACE
) {
725 wq
= fs_info
->endio_freespace_worker
;
726 func
= btrfs_freespace_write_helper
;
727 } else if (end_io_wq
->metadata
== BTRFS_WQ_ENDIO_RAID56
) {
728 wq
= fs_info
->endio_raid56_workers
;
729 func
= btrfs_endio_raid56_helper
;
731 wq
= fs_info
->endio_write_workers
;
732 func
= btrfs_endio_write_helper
;
735 if (unlikely(end_io_wq
->metadata
==
736 BTRFS_WQ_ENDIO_DIO_REPAIR
)) {
737 wq
= fs_info
->endio_repair_workers
;
738 func
= btrfs_endio_repair_helper
;
739 } else if (end_io_wq
->metadata
== BTRFS_WQ_ENDIO_RAID56
) {
740 wq
= fs_info
->endio_raid56_workers
;
741 func
= btrfs_endio_raid56_helper
;
742 } else if (end_io_wq
->metadata
) {
743 wq
= fs_info
->endio_meta_workers
;
744 func
= btrfs_endio_meta_helper
;
746 wq
= fs_info
->endio_workers
;
747 func
= btrfs_endio_helper
;
751 btrfs_init_work(&end_io_wq
->work
, func
, end_workqueue_fn
, NULL
, NULL
);
752 btrfs_queue_work(wq
, &end_io_wq
->work
);
755 int btrfs_bio_wq_end_io(struct btrfs_fs_info
*info
, struct bio
*bio
,
756 enum btrfs_wq_endio_type metadata
)
758 struct btrfs_end_io_wq
*end_io_wq
;
760 end_io_wq
= kmem_cache_alloc(btrfs_end_io_wq_cache
, GFP_NOFS
);
764 end_io_wq
->private = bio
->bi_private
;
765 end_io_wq
->end_io
= bio
->bi_end_io
;
766 end_io_wq
->info
= info
;
767 end_io_wq
->error
= 0;
768 end_io_wq
->bio
= bio
;
769 end_io_wq
->metadata
= metadata
;
771 bio
->bi_private
= end_io_wq
;
772 bio
->bi_end_io
= end_workqueue_bio
;
776 unsigned long btrfs_async_submit_limit(struct btrfs_fs_info
*info
)
778 unsigned long limit
= min_t(unsigned long,
779 info
->thread_pool_size
,
780 info
->fs_devices
->open_devices
);
784 static void run_one_async_start(struct btrfs_work
*work
)
786 struct async_submit_bio
*async
;
789 async
= container_of(work
, struct async_submit_bio
, work
);
790 ret
= async
->submit_bio_start(async
->inode
, async
->rw
, async
->bio
,
791 async
->mirror_num
, async
->bio_flags
,
797 static void run_one_async_done(struct btrfs_work
*work
)
799 struct btrfs_fs_info
*fs_info
;
800 struct async_submit_bio
*async
;
803 async
= container_of(work
, struct async_submit_bio
, work
);
804 fs_info
= BTRFS_I(async
->inode
)->root
->fs_info
;
806 limit
= btrfs_async_submit_limit(fs_info
);
807 limit
= limit
* 2 / 3;
809 if (atomic_dec_return(&fs_info
->nr_async_submits
) < limit
&&
810 waitqueue_active(&fs_info
->async_submit_wait
))
811 wake_up(&fs_info
->async_submit_wait
);
813 /* If an error occured we just want to clean up the bio and move on */
815 bio_endio(async
->bio
, async
->error
);
819 async
->submit_bio_done(async
->inode
, async
->rw
, async
->bio
,
820 async
->mirror_num
, async
->bio_flags
,
824 static void run_one_async_free(struct btrfs_work
*work
)
826 struct async_submit_bio
*async
;
828 async
= container_of(work
, struct async_submit_bio
, work
);
832 int btrfs_wq_submit_bio(struct btrfs_fs_info
*fs_info
, struct inode
*inode
,
833 int rw
, struct bio
*bio
, int mirror_num
,
834 unsigned long bio_flags
,
836 extent_submit_bio_hook_t
*submit_bio_start
,
837 extent_submit_bio_hook_t
*submit_bio_done
)
839 struct async_submit_bio
*async
;
841 async
= kmalloc(sizeof(*async
), GFP_NOFS
);
845 async
->inode
= inode
;
848 async
->mirror_num
= mirror_num
;
849 async
->submit_bio_start
= submit_bio_start
;
850 async
->submit_bio_done
= submit_bio_done
;
852 btrfs_init_work(&async
->work
, btrfs_worker_helper
, run_one_async_start
,
853 run_one_async_done
, run_one_async_free
);
855 async
->bio_flags
= bio_flags
;
856 async
->bio_offset
= bio_offset
;
860 atomic_inc(&fs_info
->nr_async_submits
);
863 btrfs_set_work_high_priority(&async
->work
);
865 btrfs_queue_work(fs_info
->workers
, &async
->work
);
867 while (atomic_read(&fs_info
->async_submit_draining
) &&
868 atomic_read(&fs_info
->nr_async_submits
)) {
869 wait_event(fs_info
->async_submit_wait
,
870 (atomic_read(&fs_info
->nr_async_submits
) == 0));
876 static int btree_csum_one_bio(struct bio
*bio
)
878 struct bio_vec
*bvec
;
879 struct btrfs_root
*root
;
882 bio_for_each_segment_all(bvec
, bio
, i
) {
883 root
= BTRFS_I(bvec
->bv_page
->mapping
->host
)->root
;
884 ret
= csum_dirty_buffer(root
, bvec
->bv_page
);
892 static int __btree_submit_bio_start(struct inode
*inode
, int rw
,
893 struct bio
*bio
, int mirror_num
,
894 unsigned long bio_flags
,
898 * when we're called for a write, we're already in the async
899 * submission context. Just jump into btrfs_map_bio
901 return btree_csum_one_bio(bio
);
904 static int __btree_submit_bio_done(struct inode
*inode
, int rw
, struct bio
*bio
,
905 int mirror_num
, unsigned long bio_flags
,
911 * when we're called for a write, we're already in the async
912 * submission context. Just jump into btrfs_map_bio
914 ret
= btrfs_map_bio(BTRFS_I(inode
)->root
, rw
, bio
, mirror_num
, 1);
920 static int check_async_write(struct inode
*inode
, unsigned long bio_flags
)
922 if (bio_flags
& EXTENT_BIO_TREE_LOG
)
931 static int btree_submit_bio_hook(struct inode
*inode
, int rw
, struct bio
*bio
,
932 int mirror_num
, unsigned long bio_flags
,
935 int async
= check_async_write(inode
, bio_flags
);
938 if (!(rw
& REQ_WRITE
)) {
940 * called for a read, do the setup so that checksum validation
941 * can happen in the async kernel threads
943 ret
= btrfs_bio_wq_end_io(BTRFS_I(inode
)->root
->fs_info
,
944 bio
, BTRFS_WQ_ENDIO_METADATA
);
947 ret
= btrfs_map_bio(BTRFS_I(inode
)->root
, rw
, bio
,
950 ret
= btree_csum_one_bio(bio
);
953 ret
= btrfs_map_bio(BTRFS_I(inode
)->root
, rw
, bio
,
957 * kthread helpers are used to submit writes so that
958 * checksumming can happen in parallel across all CPUs
960 ret
= btrfs_wq_submit_bio(BTRFS_I(inode
)->root
->fs_info
,
961 inode
, rw
, bio
, mirror_num
, 0,
963 __btree_submit_bio_start
,
964 __btree_submit_bio_done
);
974 #ifdef CONFIG_MIGRATION
975 static int btree_migratepage(struct address_space
*mapping
,
976 struct page
*newpage
, struct page
*page
,
977 enum migrate_mode mode
)
980 * we can't safely write a btree page from here,
981 * we haven't done the locking hook
986 * Buffers may be managed in a filesystem specific way.
987 * We must have no buffers or drop them.
989 if (page_has_private(page
) &&
990 !try_to_release_page(page
, GFP_KERNEL
))
992 return migrate_page(mapping
, newpage
, page
, mode
);
997 static int btree_writepages(struct address_space
*mapping
,
998 struct writeback_control
*wbc
)
1000 struct btrfs_fs_info
*fs_info
;
1003 if (wbc
->sync_mode
== WB_SYNC_NONE
) {
1005 if (wbc
->for_kupdate
)
1008 fs_info
= BTRFS_I(mapping
->host
)->root
->fs_info
;
1009 /* this is a bit racy, but that's ok */
1010 ret
= percpu_counter_compare(&fs_info
->dirty_metadata_bytes
,
1011 BTRFS_DIRTY_METADATA_THRESH
);
1015 return btree_write_cache_pages(mapping
, wbc
);
1018 static int btree_readpage(struct file
*file
, struct page
*page
)
1020 struct extent_io_tree
*tree
;
1021 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
1022 return extent_read_full_page(tree
, page
, btree_get_extent
, 0);
1025 static int btree_releasepage(struct page
*page
, gfp_t gfp_flags
)
1027 if (PageWriteback(page
) || PageDirty(page
))
1030 return try_release_extent_buffer(page
);
1033 static void btree_invalidatepage(struct page
*page
, unsigned int offset
,
1034 unsigned int length
)
1036 struct extent_io_tree
*tree
;
1037 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
1038 extent_invalidatepage(tree
, page
, offset
);
1039 btree_releasepage(page
, GFP_NOFS
);
1040 if (PagePrivate(page
)) {
1041 btrfs_warn(BTRFS_I(page
->mapping
->host
)->root
->fs_info
,
1042 "page private not zero on page %llu",
1043 (unsigned long long)page_offset(page
));
1044 ClearPagePrivate(page
);
1045 set_page_private(page
, 0);
1046 page_cache_release(page
);
1050 static int btree_set_page_dirty(struct page
*page
)
1053 struct extent_buffer
*eb
;
1055 BUG_ON(!PagePrivate(page
));
1056 eb
= (struct extent_buffer
*)page
->private;
1058 BUG_ON(!test_bit(EXTENT_BUFFER_DIRTY
, &eb
->bflags
));
1059 BUG_ON(!atomic_read(&eb
->refs
));
1060 btrfs_assert_tree_locked(eb
);
1062 return __set_page_dirty_nobuffers(page
);
1065 static const struct address_space_operations btree_aops
= {
1066 .readpage
= btree_readpage
,
1067 .writepages
= btree_writepages
,
1068 .releasepage
= btree_releasepage
,
1069 .invalidatepage
= btree_invalidatepage
,
1070 #ifdef CONFIG_MIGRATION
1071 .migratepage
= btree_migratepage
,
1073 .set_page_dirty
= btree_set_page_dirty
,
1076 void readahead_tree_block(struct btrfs_root
*root
, u64 bytenr
)
1078 struct extent_buffer
*buf
= NULL
;
1079 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1081 buf
= btrfs_find_create_tree_block(root
, bytenr
);
1084 read_extent_buffer_pages(&BTRFS_I(btree_inode
)->io_tree
,
1085 buf
, 0, WAIT_NONE
, btree_get_extent
, 0);
1086 free_extent_buffer(buf
);
1089 int reada_tree_block_flagged(struct btrfs_root
*root
, u64 bytenr
,
1090 int mirror_num
, struct extent_buffer
**eb
)
1092 struct extent_buffer
*buf
= NULL
;
1093 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1094 struct extent_io_tree
*io_tree
= &BTRFS_I(btree_inode
)->io_tree
;
1097 buf
= btrfs_find_create_tree_block(root
, bytenr
);
1101 set_bit(EXTENT_BUFFER_READAHEAD
, &buf
->bflags
);
1103 ret
= read_extent_buffer_pages(io_tree
, buf
, 0, WAIT_PAGE_LOCK
,
1104 btree_get_extent
, mirror_num
);
1106 free_extent_buffer(buf
);
1110 if (test_bit(EXTENT_BUFFER_CORRUPT
, &buf
->bflags
)) {
1111 free_extent_buffer(buf
);
1113 } else if (extent_buffer_uptodate(buf
)) {
1116 free_extent_buffer(buf
);
1121 struct extent_buffer
*btrfs_find_tree_block(struct btrfs_root
*root
,
1124 return find_extent_buffer(root
->fs_info
, bytenr
);
1127 struct extent_buffer
*btrfs_find_create_tree_block(struct btrfs_root
*root
,
1130 if (btrfs_test_is_dummy_root(root
))
1131 return alloc_test_extent_buffer(root
->fs_info
, bytenr
);
1132 return alloc_extent_buffer(root
->fs_info
, bytenr
);
1136 int btrfs_write_tree_block(struct extent_buffer
*buf
)
1138 return filemap_fdatawrite_range(buf
->pages
[0]->mapping
, buf
->start
,
1139 buf
->start
+ buf
->len
- 1);
1142 int btrfs_wait_tree_block_writeback(struct extent_buffer
*buf
)
1144 return filemap_fdatawait_range(buf
->pages
[0]->mapping
,
1145 buf
->start
, buf
->start
+ buf
->len
- 1);
1148 struct extent_buffer
*read_tree_block(struct btrfs_root
*root
, u64 bytenr
,
1151 struct extent_buffer
*buf
= NULL
;
1154 buf
= btrfs_find_create_tree_block(root
, bytenr
);
1158 ret
= btree_read_extent_buffer_pages(root
, buf
, 0, parent_transid
);
1160 free_extent_buffer(buf
);
1167 void clean_tree_block(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
1168 struct extent_buffer
*buf
)
1170 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
1172 if (btrfs_header_generation(buf
) ==
1173 fs_info
->running_transaction
->transid
) {
1174 btrfs_assert_tree_locked(buf
);
1176 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY
, &buf
->bflags
)) {
1177 __percpu_counter_add(&fs_info
->dirty_metadata_bytes
,
1179 fs_info
->dirty_metadata_batch
);
1180 /* ugh, clear_extent_buffer_dirty needs to lock the page */
1181 btrfs_set_lock_blocking(buf
);
1182 clear_extent_buffer_dirty(buf
);
1187 static struct btrfs_subvolume_writers
*btrfs_alloc_subvolume_writers(void)
1189 struct btrfs_subvolume_writers
*writers
;
1192 writers
= kmalloc(sizeof(*writers
), GFP_NOFS
);
1194 return ERR_PTR(-ENOMEM
);
1196 ret
= percpu_counter_init(&writers
->counter
, 0, GFP_KERNEL
);
1199 return ERR_PTR(ret
);
1202 init_waitqueue_head(&writers
->wait
);
1207 btrfs_free_subvolume_writers(struct btrfs_subvolume_writers
*writers
)
1209 percpu_counter_destroy(&writers
->counter
);
1213 static void __setup_root(u32 nodesize
, u32 sectorsize
, u32 stripesize
,
1214 struct btrfs_root
*root
, struct btrfs_fs_info
*fs_info
,
1218 root
->commit_root
= NULL
;
1219 root
->sectorsize
= sectorsize
;
1220 root
->nodesize
= nodesize
;
1221 root
->stripesize
= stripesize
;
1223 root
->orphan_cleanup_state
= 0;
1225 root
->objectid
= objectid
;
1226 root
->last_trans
= 0;
1227 root
->highest_objectid
= 0;
1228 root
->nr_delalloc_inodes
= 0;
1229 root
->nr_ordered_extents
= 0;
1231 root
->inode_tree
= RB_ROOT
;
1232 INIT_RADIX_TREE(&root
->delayed_nodes_tree
, GFP_ATOMIC
);
1233 root
->block_rsv
= NULL
;
1234 root
->orphan_block_rsv
= NULL
;
1236 INIT_LIST_HEAD(&root
->dirty_list
);
1237 INIT_LIST_HEAD(&root
->root_list
);
1238 INIT_LIST_HEAD(&root
->delalloc_inodes
);
1239 INIT_LIST_HEAD(&root
->delalloc_root
);
1240 INIT_LIST_HEAD(&root
->ordered_extents
);
1241 INIT_LIST_HEAD(&root
->ordered_root
);
1242 INIT_LIST_HEAD(&root
->logged_list
[0]);
1243 INIT_LIST_HEAD(&root
->logged_list
[1]);
1244 spin_lock_init(&root
->orphan_lock
);
1245 spin_lock_init(&root
->inode_lock
);
1246 spin_lock_init(&root
->delalloc_lock
);
1247 spin_lock_init(&root
->ordered_extent_lock
);
1248 spin_lock_init(&root
->accounting_lock
);
1249 spin_lock_init(&root
->log_extents_lock
[0]);
1250 spin_lock_init(&root
->log_extents_lock
[1]);
1251 mutex_init(&root
->objectid_mutex
);
1252 mutex_init(&root
->log_mutex
);
1253 mutex_init(&root
->ordered_extent_mutex
);
1254 mutex_init(&root
->delalloc_mutex
);
1255 init_waitqueue_head(&root
->log_writer_wait
);
1256 init_waitqueue_head(&root
->log_commit_wait
[0]);
1257 init_waitqueue_head(&root
->log_commit_wait
[1]);
1258 INIT_LIST_HEAD(&root
->log_ctxs
[0]);
1259 INIT_LIST_HEAD(&root
->log_ctxs
[1]);
1260 atomic_set(&root
->log_commit
[0], 0);
1261 atomic_set(&root
->log_commit
[1], 0);
1262 atomic_set(&root
->log_writers
, 0);
1263 atomic_set(&root
->log_batch
, 0);
1264 atomic_set(&root
->orphan_inodes
, 0);
1265 atomic_set(&root
->refs
, 1);
1266 atomic_set(&root
->will_be_snapshoted
, 0);
1267 root
->log_transid
= 0;
1268 root
->log_transid_committed
= -1;
1269 root
->last_log_commit
= 0;
1271 extent_io_tree_init(&root
->dirty_log_pages
,
1272 fs_info
->btree_inode
->i_mapping
);
1274 memset(&root
->root_key
, 0, sizeof(root
->root_key
));
1275 memset(&root
->root_item
, 0, sizeof(root
->root_item
));
1276 memset(&root
->defrag_progress
, 0, sizeof(root
->defrag_progress
));
1277 memset(&root
->root_kobj
, 0, sizeof(root
->root_kobj
));
1279 root
->defrag_trans_start
= fs_info
->generation
;
1281 root
->defrag_trans_start
= 0;
1282 init_completion(&root
->kobj_unregister
);
1283 root
->root_key
.objectid
= objectid
;
1286 spin_lock_init(&root
->root_item_lock
);
1289 static struct btrfs_root
*btrfs_alloc_root(struct btrfs_fs_info
*fs_info
)
1291 struct btrfs_root
*root
= kzalloc(sizeof(*root
), GFP_NOFS
);
1293 root
->fs_info
= fs_info
;
1297 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
1298 /* Should only be used by the testing infrastructure */
1299 struct btrfs_root
*btrfs_alloc_dummy_root(void)
1301 struct btrfs_root
*root
;
1303 root
= btrfs_alloc_root(NULL
);
1305 return ERR_PTR(-ENOMEM
);
1306 __setup_root(4096, 4096, 4096, root
, NULL
, 1);
1307 set_bit(BTRFS_ROOT_DUMMY_ROOT
, &root
->state
);
1308 root
->alloc_bytenr
= 0;
1314 struct btrfs_root
*btrfs_create_tree(struct btrfs_trans_handle
*trans
,
1315 struct btrfs_fs_info
*fs_info
,
1318 struct extent_buffer
*leaf
;
1319 struct btrfs_root
*tree_root
= fs_info
->tree_root
;
1320 struct btrfs_root
*root
;
1321 struct btrfs_key key
;
1325 root
= btrfs_alloc_root(fs_info
);
1327 return ERR_PTR(-ENOMEM
);
1329 __setup_root(tree_root
->nodesize
, tree_root
->sectorsize
,
1330 tree_root
->stripesize
, root
, fs_info
, objectid
);
1331 root
->root_key
.objectid
= objectid
;
1332 root
->root_key
.type
= BTRFS_ROOT_ITEM_KEY
;
1333 root
->root_key
.offset
= 0;
1335 leaf
= btrfs_alloc_tree_block(trans
, root
, 0, objectid
, NULL
, 0, 0, 0);
1337 ret
= PTR_ERR(leaf
);
1342 memset_extent_buffer(leaf
, 0, 0, sizeof(struct btrfs_header
));
1343 btrfs_set_header_bytenr(leaf
, leaf
->start
);
1344 btrfs_set_header_generation(leaf
, trans
->transid
);
1345 btrfs_set_header_backref_rev(leaf
, BTRFS_MIXED_BACKREF_REV
);
1346 btrfs_set_header_owner(leaf
, objectid
);
1349 write_extent_buffer(leaf
, fs_info
->fsid
, btrfs_header_fsid(),
1351 write_extent_buffer(leaf
, fs_info
->chunk_tree_uuid
,
1352 btrfs_header_chunk_tree_uuid(leaf
),
1354 btrfs_mark_buffer_dirty(leaf
);
1356 root
->commit_root
= btrfs_root_node(root
);
1357 set_bit(BTRFS_ROOT_TRACK_DIRTY
, &root
->state
);
1359 root
->root_item
.flags
= 0;
1360 root
->root_item
.byte_limit
= 0;
1361 btrfs_set_root_bytenr(&root
->root_item
, leaf
->start
);
1362 btrfs_set_root_generation(&root
->root_item
, trans
->transid
);
1363 btrfs_set_root_level(&root
->root_item
, 0);
1364 btrfs_set_root_refs(&root
->root_item
, 1);
1365 btrfs_set_root_used(&root
->root_item
, leaf
->len
);
1366 btrfs_set_root_last_snapshot(&root
->root_item
, 0);
1367 btrfs_set_root_dirid(&root
->root_item
, 0);
1369 memcpy(root
->root_item
.uuid
, uuid
.b
, BTRFS_UUID_SIZE
);
1370 root
->root_item
.drop_level
= 0;
1372 key
.objectid
= objectid
;
1373 key
.type
= BTRFS_ROOT_ITEM_KEY
;
1375 ret
= btrfs_insert_root(trans
, tree_root
, &key
, &root
->root_item
);
1379 btrfs_tree_unlock(leaf
);
1385 btrfs_tree_unlock(leaf
);
1386 free_extent_buffer(root
->commit_root
);
1387 free_extent_buffer(leaf
);
1391 return ERR_PTR(ret
);
1394 static struct btrfs_root
*alloc_log_tree(struct btrfs_trans_handle
*trans
,
1395 struct btrfs_fs_info
*fs_info
)
1397 struct btrfs_root
*root
;
1398 struct btrfs_root
*tree_root
= fs_info
->tree_root
;
1399 struct extent_buffer
*leaf
;
1401 root
= btrfs_alloc_root(fs_info
);
1403 return ERR_PTR(-ENOMEM
);
1405 __setup_root(tree_root
->nodesize
, tree_root
->sectorsize
,
1406 tree_root
->stripesize
, root
, fs_info
,
1407 BTRFS_TREE_LOG_OBJECTID
);
1409 root
->root_key
.objectid
= BTRFS_TREE_LOG_OBJECTID
;
1410 root
->root_key
.type
= BTRFS_ROOT_ITEM_KEY
;
1411 root
->root_key
.offset
= BTRFS_TREE_LOG_OBJECTID
;
1414 * DON'T set REF_COWS for log trees
1416 * log trees do not get reference counted because they go away
1417 * before a real commit is actually done. They do store pointers
1418 * to file data extents, and those reference counts still get
1419 * updated (along with back refs to the log tree).
1422 leaf
= btrfs_alloc_tree_block(trans
, root
, 0, BTRFS_TREE_LOG_OBJECTID
,
1426 return ERR_CAST(leaf
);
1429 memset_extent_buffer(leaf
, 0, 0, sizeof(struct btrfs_header
));
1430 btrfs_set_header_bytenr(leaf
, leaf
->start
);
1431 btrfs_set_header_generation(leaf
, trans
->transid
);
1432 btrfs_set_header_backref_rev(leaf
, BTRFS_MIXED_BACKREF_REV
);
1433 btrfs_set_header_owner(leaf
, BTRFS_TREE_LOG_OBJECTID
);
1436 write_extent_buffer(root
->node
, root
->fs_info
->fsid
,
1437 btrfs_header_fsid(), BTRFS_FSID_SIZE
);
1438 btrfs_mark_buffer_dirty(root
->node
);
1439 btrfs_tree_unlock(root
->node
);
1443 int btrfs_init_log_root_tree(struct btrfs_trans_handle
*trans
,
1444 struct btrfs_fs_info
*fs_info
)
1446 struct btrfs_root
*log_root
;
1448 log_root
= alloc_log_tree(trans
, fs_info
);
1449 if (IS_ERR(log_root
))
1450 return PTR_ERR(log_root
);
1451 WARN_ON(fs_info
->log_root_tree
);
1452 fs_info
->log_root_tree
= log_root
;
1456 int btrfs_add_log_tree(struct btrfs_trans_handle
*trans
,
1457 struct btrfs_root
*root
)
1459 struct btrfs_root
*log_root
;
1460 struct btrfs_inode_item
*inode_item
;
1462 log_root
= alloc_log_tree(trans
, root
->fs_info
);
1463 if (IS_ERR(log_root
))
1464 return PTR_ERR(log_root
);
1466 log_root
->last_trans
= trans
->transid
;
1467 log_root
->root_key
.offset
= root
->root_key
.objectid
;
1469 inode_item
= &log_root
->root_item
.inode
;
1470 btrfs_set_stack_inode_generation(inode_item
, 1);
1471 btrfs_set_stack_inode_size(inode_item
, 3);
1472 btrfs_set_stack_inode_nlink(inode_item
, 1);
1473 btrfs_set_stack_inode_nbytes(inode_item
, root
->nodesize
);
1474 btrfs_set_stack_inode_mode(inode_item
, S_IFDIR
| 0755);
1476 btrfs_set_root_node(&log_root
->root_item
, log_root
->node
);
1478 WARN_ON(root
->log_root
);
1479 root
->log_root
= log_root
;
1480 root
->log_transid
= 0;
1481 root
->log_transid_committed
= -1;
1482 root
->last_log_commit
= 0;
1486 static struct btrfs_root
*btrfs_read_tree_root(struct btrfs_root
*tree_root
,
1487 struct btrfs_key
*key
)
1489 struct btrfs_root
*root
;
1490 struct btrfs_fs_info
*fs_info
= tree_root
->fs_info
;
1491 struct btrfs_path
*path
;
1495 path
= btrfs_alloc_path();
1497 return ERR_PTR(-ENOMEM
);
1499 root
= btrfs_alloc_root(fs_info
);
1505 __setup_root(tree_root
->nodesize
, tree_root
->sectorsize
,
1506 tree_root
->stripesize
, root
, fs_info
, key
->objectid
);
1508 ret
= btrfs_find_root(tree_root
, key
, path
,
1509 &root
->root_item
, &root
->root_key
);
1516 generation
= btrfs_root_generation(&root
->root_item
);
1517 root
->node
= read_tree_block(root
, btrfs_root_bytenr(&root
->root_item
),
1522 } else if (!btrfs_buffer_uptodate(root
->node
, generation
, 0)) {
1526 root
->commit_root
= btrfs_root_node(root
);
1528 btrfs_free_path(path
);
1532 free_extent_buffer(root
->node
);
1536 root
= ERR_PTR(ret
);
1540 struct btrfs_root
*btrfs_read_fs_root(struct btrfs_root
*tree_root
,
1541 struct btrfs_key
*location
)
1543 struct btrfs_root
*root
;
1545 root
= btrfs_read_tree_root(tree_root
, location
);
1549 if (root
->root_key
.objectid
!= BTRFS_TREE_LOG_OBJECTID
) {
1550 set_bit(BTRFS_ROOT_REF_COWS
, &root
->state
);
1551 btrfs_check_and_init_root_item(&root
->root_item
);
1557 int btrfs_init_fs_root(struct btrfs_root
*root
)
1560 struct btrfs_subvolume_writers
*writers
;
1562 root
->free_ino_ctl
= kzalloc(sizeof(*root
->free_ino_ctl
), GFP_NOFS
);
1563 root
->free_ino_pinned
= kzalloc(sizeof(*root
->free_ino_pinned
),
1565 if (!root
->free_ino_pinned
|| !root
->free_ino_ctl
) {
1570 writers
= btrfs_alloc_subvolume_writers();
1571 if (IS_ERR(writers
)) {
1572 ret
= PTR_ERR(writers
);
1575 root
->subv_writers
= writers
;
1577 btrfs_init_free_ino_ctl(root
);
1578 spin_lock_init(&root
->ino_cache_lock
);
1579 init_waitqueue_head(&root
->ino_cache_wait
);
1581 ret
= get_anon_bdev(&root
->anon_dev
);
1587 btrfs_free_subvolume_writers(root
->subv_writers
);
1589 kfree(root
->free_ino_ctl
);
1590 kfree(root
->free_ino_pinned
);
1594 static struct btrfs_root
*btrfs_lookup_fs_root(struct btrfs_fs_info
*fs_info
,
1597 struct btrfs_root
*root
;
1599 spin_lock(&fs_info
->fs_roots_radix_lock
);
1600 root
= radix_tree_lookup(&fs_info
->fs_roots_radix
,
1601 (unsigned long)root_id
);
1602 spin_unlock(&fs_info
->fs_roots_radix_lock
);
1606 int btrfs_insert_fs_root(struct btrfs_fs_info
*fs_info
,
1607 struct btrfs_root
*root
)
1611 ret
= radix_tree_preload(GFP_NOFS
& ~__GFP_HIGHMEM
);
1615 spin_lock(&fs_info
->fs_roots_radix_lock
);
1616 ret
= radix_tree_insert(&fs_info
->fs_roots_radix
,
1617 (unsigned long)root
->root_key
.objectid
,
1620 set_bit(BTRFS_ROOT_IN_RADIX
, &root
->state
);
1621 spin_unlock(&fs_info
->fs_roots_radix_lock
);
1622 radix_tree_preload_end();
1627 struct btrfs_root
*btrfs_get_fs_root(struct btrfs_fs_info
*fs_info
,
1628 struct btrfs_key
*location
,
1631 struct btrfs_root
*root
;
1632 struct btrfs_path
*path
;
1633 struct btrfs_key key
;
1636 if (location
->objectid
== BTRFS_ROOT_TREE_OBJECTID
)
1637 return fs_info
->tree_root
;
1638 if (location
->objectid
== BTRFS_EXTENT_TREE_OBJECTID
)
1639 return fs_info
->extent_root
;
1640 if (location
->objectid
== BTRFS_CHUNK_TREE_OBJECTID
)
1641 return fs_info
->chunk_root
;
1642 if (location
->objectid
== BTRFS_DEV_TREE_OBJECTID
)
1643 return fs_info
->dev_root
;
1644 if (location
->objectid
== BTRFS_CSUM_TREE_OBJECTID
)
1645 return fs_info
->csum_root
;
1646 if (location
->objectid
== BTRFS_QUOTA_TREE_OBJECTID
)
1647 return fs_info
->quota_root
? fs_info
->quota_root
:
1649 if (location
->objectid
== BTRFS_UUID_TREE_OBJECTID
)
1650 return fs_info
->uuid_root
? fs_info
->uuid_root
:
1653 root
= btrfs_lookup_fs_root(fs_info
, location
->objectid
);
1655 if (check_ref
&& btrfs_root_refs(&root
->root_item
) == 0)
1656 return ERR_PTR(-ENOENT
);
1660 root
= btrfs_read_fs_root(fs_info
->tree_root
, location
);
1664 if (check_ref
&& btrfs_root_refs(&root
->root_item
) == 0) {
1669 ret
= btrfs_init_fs_root(root
);
1673 path
= btrfs_alloc_path();
1678 key
.objectid
= BTRFS_ORPHAN_OBJECTID
;
1679 key
.type
= BTRFS_ORPHAN_ITEM_KEY
;
1680 key
.offset
= location
->objectid
;
1682 ret
= btrfs_search_slot(NULL
, fs_info
->tree_root
, &key
, path
, 0, 0);
1683 btrfs_free_path(path
);
1687 set_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED
, &root
->state
);
1689 ret
= btrfs_insert_fs_root(fs_info
, root
);
1691 if (ret
== -EEXIST
) {
1700 return ERR_PTR(ret
);
1703 static int btrfs_congested_fn(void *congested_data
, int bdi_bits
)
1705 struct btrfs_fs_info
*info
= (struct btrfs_fs_info
*)congested_data
;
1707 struct btrfs_device
*device
;
1708 struct backing_dev_info
*bdi
;
1711 list_for_each_entry_rcu(device
, &info
->fs_devices
->devices
, dev_list
) {
1714 bdi
= blk_get_backing_dev_info(device
->bdev
);
1715 if (bdi_congested(bdi
, bdi_bits
)) {
1724 static int setup_bdi(struct btrfs_fs_info
*info
, struct backing_dev_info
*bdi
)
1728 bdi
->capabilities
= BDI_CAP_MAP_COPY
;
1729 err
= bdi_setup_and_register(bdi
, "btrfs", BDI_CAP_MAP_COPY
);
1733 bdi
->ra_pages
= default_backing_dev_info
.ra_pages
;
1734 bdi
->congested_fn
= btrfs_congested_fn
;
1735 bdi
->congested_data
= info
;
1740 * called by the kthread helper functions to finally call the bio end_io
1741 * functions. This is where read checksum verification actually happens
1743 static void end_workqueue_fn(struct btrfs_work
*work
)
1746 struct btrfs_end_io_wq
*end_io_wq
;
1749 end_io_wq
= container_of(work
, struct btrfs_end_io_wq
, work
);
1750 bio
= end_io_wq
->bio
;
1752 error
= end_io_wq
->error
;
1753 bio
->bi_private
= end_io_wq
->private;
1754 bio
->bi_end_io
= end_io_wq
->end_io
;
1755 kmem_cache_free(btrfs_end_io_wq_cache
, end_io_wq
);
1756 bio_endio_nodec(bio
, error
);
1759 static int cleaner_kthread(void *arg
)
1761 struct btrfs_root
*root
= arg
;
1767 /* Make the cleaner go to sleep early. */
1768 if (btrfs_need_cleaner_sleep(root
))
1771 if (!mutex_trylock(&root
->fs_info
->cleaner_mutex
))
1775 * Avoid the problem that we change the status of the fs
1776 * during the above check and trylock.
1778 if (btrfs_need_cleaner_sleep(root
)) {
1779 mutex_unlock(&root
->fs_info
->cleaner_mutex
);
1783 btrfs_run_delayed_iputs(root
);
1784 btrfs_delete_unused_bgs(root
->fs_info
);
1785 again
= btrfs_clean_one_deleted_snapshot(root
);
1786 mutex_unlock(&root
->fs_info
->cleaner_mutex
);
1789 * The defragger has dealt with the R/O remount and umount,
1790 * needn't do anything special here.
1792 btrfs_run_defrag_inodes(root
->fs_info
);
1794 if (!try_to_freeze() && !again
) {
1795 set_current_state(TASK_INTERRUPTIBLE
);
1796 if (!kthread_should_stop())
1798 __set_current_state(TASK_RUNNING
);
1800 } while (!kthread_should_stop());
1804 static int transaction_kthread(void *arg
)
1806 struct btrfs_root
*root
= arg
;
1807 struct btrfs_trans_handle
*trans
;
1808 struct btrfs_transaction
*cur
;
1811 unsigned long delay
;
1815 cannot_commit
= false;
1816 delay
= HZ
* root
->fs_info
->commit_interval
;
1817 mutex_lock(&root
->fs_info
->transaction_kthread_mutex
);
1819 spin_lock(&root
->fs_info
->trans_lock
);
1820 cur
= root
->fs_info
->running_transaction
;
1822 spin_unlock(&root
->fs_info
->trans_lock
);
1826 now
= get_seconds();
1827 if (cur
->state
< TRANS_STATE_BLOCKED
&&
1828 (now
< cur
->start_time
||
1829 now
- cur
->start_time
< root
->fs_info
->commit_interval
)) {
1830 spin_unlock(&root
->fs_info
->trans_lock
);
1834 transid
= cur
->transid
;
1835 spin_unlock(&root
->fs_info
->trans_lock
);
1837 /* If the file system is aborted, this will always fail. */
1838 trans
= btrfs_attach_transaction(root
);
1839 if (IS_ERR(trans
)) {
1840 if (PTR_ERR(trans
) != -ENOENT
)
1841 cannot_commit
= true;
1844 if (transid
== trans
->transid
) {
1845 btrfs_commit_transaction(trans
, root
);
1847 btrfs_end_transaction(trans
, root
);
1850 wake_up_process(root
->fs_info
->cleaner_kthread
);
1851 mutex_unlock(&root
->fs_info
->transaction_kthread_mutex
);
1853 if (unlikely(test_bit(BTRFS_FS_STATE_ERROR
,
1854 &root
->fs_info
->fs_state
)))
1855 btrfs_cleanup_transaction(root
);
1856 if (!try_to_freeze()) {
1857 set_current_state(TASK_INTERRUPTIBLE
);
1858 if (!kthread_should_stop() &&
1859 (!btrfs_transaction_blocked(root
->fs_info
) ||
1861 schedule_timeout(delay
);
1862 __set_current_state(TASK_RUNNING
);
1864 } while (!kthread_should_stop());
1869 * this will find the highest generation in the array of
1870 * root backups. The index of the highest array is returned,
1871 * or -1 if we can't find anything.
1873 * We check to make sure the array is valid by comparing the
1874 * generation of the latest root in the array with the generation
1875 * in the super block. If they don't match we pitch it.
1877 static int find_newest_super_backup(struct btrfs_fs_info
*info
, u64 newest_gen
)
1880 int newest_index
= -1;
1881 struct btrfs_root_backup
*root_backup
;
1884 for (i
= 0; i
< BTRFS_NUM_BACKUP_ROOTS
; i
++) {
1885 root_backup
= info
->super_copy
->super_roots
+ i
;
1886 cur
= btrfs_backup_tree_root_gen(root_backup
);
1887 if (cur
== newest_gen
)
1891 /* check to see if we actually wrapped around */
1892 if (newest_index
== BTRFS_NUM_BACKUP_ROOTS
- 1) {
1893 root_backup
= info
->super_copy
->super_roots
;
1894 cur
= btrfs_backup_tree_root_gen(root_backup
);
1895 if (cur
== newest_gen
)
1898 return newest_index
;
1903 * find the oldest backup so we know where to store new entries
1904 * in the backup array. This will set the backup_root_index
1905 * field in the fs_info struct
1907 static void find_oldest_super_backup(struct btrfs_fs_info
*info
,
1910 int newest_index
= -1;
1912 newest_index
= find_newest_super_backup(info
, newest_gen
);
1913 /* if there was garbage in there, just move along */
1914 if (newest_index
== -1) {
1915 info
->backup_root_index
= 0;
1917 info
->backup_root_index
= (newest_index
+ 1) % BTRFS_NUM_BACKUP_ROOTS
;
1922 * copy all the root pointers into the super backup array.
1923 * this will bump the backup pointer by one when it is
1926 static void backup_super_roots(struct btrfs_fs_info
*info
)
1929 struct btrfs_root_backup
*root_backup
;
1932 next_backup
= info
->backup_root_index
;
1933 last_backup
= (next_backup
+ BTRFS_NUM_BACKUP_ROOTS
- 1) %
1934 BTRFS_NUM_BACKUP_ROOTS
;
1937 * just overwrite the last backup if we're at the same generation
1938 * this happens only at umount
1940 root_backup
= info
->super_for_commit
->super_roots
+ last_backup
;
1941 if (btrfs_backup_tree_root_gen(root_backup
) ==
1942 btrfs_header_generation(info
->tree_root
->node
))
1943 next_backup
= last_backup
;
1945 root_backup
= info
->super_for_commit
->super_roots
+ next_backup
;
1948 * make sure all of our padding and empty slots get zero filled
1949 * regardless of which ones we use today
1951 memset(root_backup
, 0, sizeof(*root_backup
));
1953 info
->backup_root_index
= (next_backup
+ 1) % BTRFS_NUM_BACKUP_ROOTS
;
1955 btrfs_set_backup_tree_root(root_backup
, info
->tree_root
->node
->start
);
1956 btrfs_set_backup_tree_root_gen(root_backup
,
1957 btrfs_header_generation(info
->tree_root
->node
));
1959 btrfs_set_backup_tree_root_level(root_backup
,
1960 btrfs_header_level(info
->tree_root
->node
));
1962 btrfs_set_backup_chunk_root(root_backup
, info
->chunk_root
->node
->start
);
1963 btrfs_set_backup_chunk_root_gen(root_backup
,
1964 btrfs_header_generation(info
->chunk_root
->node
));
1965 btrfs_set_backup_chunk_root_level(root_backup
,
1966 btrfs_header_level(info
->chunk_root
->node
));
1968 btrfs_set_backup_extent_root(root_backup
, info
->extent_root
->node
->start
);
1969 btrfs_set_backup_extent_root_gen(root_backup
,
1970 btrfs_header_generation(info
->extent_root
->node
));
1971 btrfs_set_backup_extent_root_level(root_backup
,
1972 btrfs_header_level(info
->extent_root
->node
));
1975 * we might commit during log recovery, which happens before we set
1976 * the fs_root. Make sure it is valid before we fill it in.
1978 if (info
->fs_root
&& info
->fs_root
->node
) {
1979 btrfs_set_backup_fs_root(root_backup
,
1980 info
->fs_root
->node
->start
);
1981 btrfs_set_backup_fs_root_gen(root_backup
,
1982 btrfs_header_generation(info
->fs_root
->node
));
1983 btrfs_set_backup_fs_root_level(root_backup
,
1984 btrfs_header_level(info
->fs_root
->node
));
1987 btrfs_set_backup_dev_root(root_backup
, info
->dev_root
->node
->start
);
1988 btrfs_set_backup_dev_root_gen(root_backup
,
1989 btrfs_header_generation(info
->dev_root
->node
));
1990 btrfs_set_backup_dev_root_level(root_backup
,
1991 btrfs_header_level(info
->dev_root
->node
));
1993 btrfs_set_backup_csum_root(root_backup
, info
->csum_root
->node
->start
);
1994 btrfs_set_backup_csum_root_gen(root_backup
,
1995 btrfs_header_generation(info
->csum_root
->node
));
1996 btrfs_set_backup_csum_root_level(root_backup
,
1997 btrfs_header_level(info
->csum_root
->node
));
1999 btrfs_set_backup_total_bytes(root_backup
,
2000 btrfs_super_total_bytes(info
->super_copy
));
2001 btrfs_set_backup_bytes_used(root_backup
,
2002 btrfs_super_bytes_used(info
->super_copy
));
2003 btrfs_set_backup_num_devices(root_backup
,
2004 btrfs_super_num_devices(info
->super_copy
));
2007 * if we don't copy this out to the super_copy, it won't get remembered
2008 * for the next commit
2010 memcpy(&info
->super_copy
->super_roots
,
2011 &info
->super_for_commit
->super_roots
,
2012 sizeof(*root_backup
) * BTRFS_NUM_BACKUP_ROOTS
);
2016 * this copies info out of the root backup array and back into
2017 * the in-memory super block. It is meant to help iterate through
2018 * the array, so you send it the number of backups you've already
2019 * tried and the last backup index you used.
2021 * this returns -1 when it has tried all the backups
2023 static noinline
int next_root_backup(struct btrfs_fs_info
*info
,
2024 struct btrfs_super_block
*super
,
2025 int *num_backups_tried
, int *backup_index
)
2027 struct btrfs_root_backup
*root_backup
;
2028 int newest
= *backup_index
;
2030 if (*num_backups_tried
== 0) {
2031 u64 gen
= btrfs_super_generation(super
);
2033 newest
= find_newest_super_backup(info
, gen
);
2037 *backup_index
= newest
;
2038 *num_backups_tried
= 1;
2039 } else if (*num_backups_tried
== BTRFS_NUM_BACKUP_ROOTS
) {
2040 /* we've tried all the backups, all done */
2043 /* jump to the next oldest backup */
2044 newest
= (*backup_index
+ BTRFS_NUM_BACKUP_ROOTS
- 1) %
2045 BTRFS_NUM_BACKUP_ROOTS
;
2046 *backup_index
= newest
;
2047 *num_backups_tried
+= 1;
2049 root_backup
= super
->super_roots
+ newest
;
2051 btrfs_set_super_generation(super
,
2052 btrfs_backup_tree_root_gen(root_backup
));
2053 btrfs_set_super_root(super
, btrfs_backup_tree_root(root_backup
));
2054 btrfs_set_super_root_level(super
,
2055 btrfs_backup_tree_root_level(root_backup
));
2056 btrfs_set_super_bytes_used(super
, btrfs_backup_bytes_used(root_backup
));
2059 * fixme: the total bytes and num_devices need to match or we should
2062 btrfs_set_super_total_bytes(super
, btrfs_backup_total_bytes(root_backup
));
2063 btrfs_set_super_num_devices(super
, btrfs_backup_num_devices(root_backup
));
2067 /* helper to cleanup workers */
2068 static void btrfs_stop_all_workers(struct btrfs_fs_info
*fs_info
)
2070 btrfs_destroy_workqueue(fs_info
->fixup_workers
);
2071 btrfs_destroy_workqueue(fs_info
->delalloc_workers
);
2072 btrfs_destroy_workqueue(fs_info
->workers
);
2073 btrfs_destroy_workqueue(fs_info
->endio_workers
);
2074 btrfs_destroy_workqueue(fs_info
->endio_meta_workers
);
2075 btrfs_destroy_workqueue(fs_info
->endio_raid56_workers
);
2076 btrfs_destroy_workqueue(fs_info
->endio_repair_workers
);
2077 btrfs_destroy_workqueue(fs_info
->rmw_workers
);
2078 btrfs_destroy_workqueue(fs_info
->endio_meta_write_workers
);
2079 btrfs_destroy_workqueue(fs_info
->endio_write_workers
);
2080 btrfs_destroy_workqueue(fs_info
->endio_freespace_worker
);
2081 btrfs_destroy_workqueue(fs_info
->submit_workers
);
2082 btrfs_destroy_workqueue(fs_info
->delayed_workers
);
2083 btrfs_destroy_workqueue(fs_info
->caching_workers
);
2084 btrfs_destroy_workqueue(fs_info
->readahead_workers
);
2085 btrfs_destroy_workqueue(fs_info
->flush_workers
);
2086 btrfs_destroy_workqueue(fs_info
->qgroup_rescan_workers
);
2087 btrfs_destroy_workqueue(fs_info
->extent_workers
);
2090 static void free_root_extent_buffers(struct btrfs_root
*root
)
2093 free_extent_buffer(root
->node
);
2094 free_extent_buffer(root
->commit_root
);
2096 root
->commit_root
= NULL
;
2100 /* helper to cleanup tree roots */
2101 static void free_root_pointers(struct btrfs_fs_info
*info
, int chunk_root
)
2103 free_root_extent_buffers(info
->tree_root
);
2105 free_root_extent_buffers(info
->dev_root
);
2106 free_root_extent_buffers(info
->extent_root
);
2107 free_root_extent_buffers(info
->csum_root
);
2108 free_root_extent_buffers(info
->quota_root
);
2109 free_root_extent_buffers(info
->uuid_root
);
2111 free_root_extent_buffers(info
->chunk_root
);
2114 void btrfs_free_fs_roots(struct btrfs_fs_info
*fs_info
)
2117 struct btrfs_root
*gang
[8];
2120 while (!list_empty(&fs_info
->dead_roots
)) {
2121 gang
[0] = list_entry(fs_info
->dead_roots
.next
,
2122 struct btrfs_root
, root_list
);
2123 list_del(&gang
[0]->root_list
);
2125 if (test_bit(BTRFS_ROOT_IN_RADIX
, &gang
[0]->state
)) {
2126 btrfs_drop_and_free_fs_root(fs_info
, gang
[0]);
2128 free_extent_buffer(gang
[0]->node
);
2129 free_extent_buffer(gang
[0]->commit_root
);
2130 btrfs_put_fs_root(gang
[0]);
2135 ret
= radix_tree_gang_lookup(&fs_info
->fs_roots_radix
,
2140 for (i
= 0; i
< ret
; i
++)
2141 btrfs_drop_and_free_fs_root(fs_info
, gang
[i
]);
2144 if (test_bit(BTRFS_FS_STATE_ERROR
, &fs_info
->fs_state
)) {
2145 btrfs_free_log_root_tree(NULL
, fs_info
);
2146 btrfs_destroy_pinned_extent(fs_info
->tree_root
,
2147 fs_info
->pinned_extents
);
2151 int open_ctree(struct super_block
*sb
,
2152 struct btrfs_fs_devices
*fs_devices
,
2160 struct btrfs_key location
;
2161 struct buffer_head
*bh
;
2162 struct btrfs_super_block
*disk_super
;
2163 struct btrfs_fs_info
*fs_info
= btrfs_sb(sb
);
2164 struct btrfs_root
*tree_root
;
2165 struct btrfs_root
*extent_root
;
2166 struct btrfs_root
*csum_root
;
2167 struct btrfs_root
*chunk_root
;
2168 struct btrfs_root
*dev_root
;
2169 struct btrfs_root
*quota_root
;
2170 struct btrfs_root
*uuid_root
;
2171 struct btrfs_root
*log_tree_root
;
2174 int num_backups_tried
= 0;
2175 int backup_index
= 0;
2177 int flags
= WQ_MEM_RECLAIM
| WQ_FREEZABLE
| WQ_UNBOUND
;
2178 bool create_uuid_tree
;
2179 bool check_uuid_tree
;
2181 tree_root
= fs_info
->tree_root
= btrfs_alloc_root(fs_info
);
2182 chunk_root
= fs_info
->chunk_root
= btrfs_alloc_root(fs_info
);
2183 if (!tree_root
|| !chunk_root
) {
2188 ret
= init_srcu_struct(&fs_info
->subvol_srcu
);
2194 ret
= setup_bdi(fs_info
, &fs_info
->bdi
);
2200 ret
= percpu_counter_init(&fs_info
->dirty_metadata_bytes
, 0, GFP_KERNEL
);
2205 fs_info
->dirty_metadata_batch
= PAGE_CACHE_SIZE
*
2206 (1 + ilog2(nr_cpu_ids
));
2208 ret
= percpu_counter_init(&fs_info
->delalloc_bytes
, 0, GFP_KERNEL
);
2211 goto fail_dirty_metadata_bytes
;
2214 ret
= percpu_counter_init(&fs_info
->bio_counter
, 0, GFP_KERNEL
);
2217 goto fail_delalloc_bytes
;
2220 fs_info
->btree_inode
= new_inode(sb
);
2221 if (!fs_info
->btree_inode
) {
2223 goto fail_bio_counter
;
2226 mapping_set_gfp_mask(fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
2228 INIT_RADIX_TREE(&fs_info
->fs_roots_radix
, GFP_ATOMIC
);
2229 INIT_RADIX_TREE(&fs_info
->buffer_radix
, GFP_ATOMIC
);
2230 INIT_LIST_HEAD(&fs_info
->trans_list
);
2231 INIT_LIST_HEAD(&fs_info
->dead_roots
);
2232 INIT_LIST_HEAD(&fs_info
->delayed_iputs
);
2233 INIT_LIST_HEAD(&fs_info
->delalloc_roots
);
2234 INIT_LIST_HEAD(&fs_info
->caching_block_groups
);
2235 spin_lock_init(&fs_info
->delalloc_root_lock
);
2236 spin_lock_init(&fs_info
->trans_lock
);
2237 spin_lock_init(&fs_info
->fs_roots_radix_lock
);
2238 spin_lock_init(&fs_info
->delayed_iput_lock
);
2239 spin_lock_init(&fs_info
->defrag_inodes_lock
);
2240 spin_lock_init(&fs_info
->free_chunk_lock
);
2241 spin_lock_init(&fs_info
->tree_mod_seq_lock
);
2242 spin_lock_init(&fs_info
->super_lock
);
2243 spin_lock_init(&fs_info
->qgroup_op_lock
);
2244 spin_lock_init(&fs_info
->buffer_lock
);
2245 spin_lock_init(&fs_info
->unused_bgs_lock
);
2246 rwlock_init(&fs_info
->tree_mod_log_lock
);
2247 mutex_init(&fs_info
->reloc_mutex
);
2248 mutex_init(&fs_info
->delalloc_root_mutex
);
2249 seqlock_init(&fs_info
->profiles_lock
);
2251 init_completion(&fs_info
->kobj_unregister
);
2252 INIT_LIST_HEAD(&fs_info
->dirty_cowonly_roots
);
2253 INIT_LIST_HEAD(&fs_info
->space_info
);
2254 INIT_LIST_HEAD(&fs_info
->tree_mod_seq_list
);
2255 INIT_LIST_HEAD(&fs_info
->unused_bgs
);
2256 btrfs_mapping_init(&fs_info
->mapping_tree
);
2257 btrfs_init_block_rsv(&fs_info
->global_block_rsv
,
2258 BTRFS_BLOCK_RSV_GLOBAL
);
2259 btrfs_init_block_rsv(&fs_info
->delalloc_block_rsv
,
2260 BTRFS_BLOCK_RSV_DELALLOC
);
2261 btrfs_init_block_rsv(&fs_info
->trans_block_rsv
, BTRFS_BLOCK_RSV_TRANS
);
2262 btrfs_init_block_rsv(&fs_info
->chunk_block_rsv
, BTRFS_BLOCK_RSV_CHUNK
);
2263 btrfs_init_block_rsv(&fs_info
->empty_block_rsv
, BTRFS_BLOCK_RSV_EMPTY
);
2264 btrfs_init_block_rsv(&fs_info
->delayed_block_rsv
,
2265 BTRFS_BLOCK_RSV_DELOPS
);
2266 atomic_set(&fs_info
->nr_async_submits
, 0);
2267 atomic_set(&fs_info
->async_delalloc_pages
, 0);
2268 atomic_set(&fs_info
->async_submit_draining
, 0);
2269 atomic_set(&fs_info
->nr_async_bios
, 0);
2270 atomic_set(&fs_info
->defrag_running
, 0);
2271 atomic_set(&fs_info
->qgroup_op_seq
, 0);
2272 atomic64_set(&fs_info
->tree_mod_seq
, 0);
2274 fs_info
->max_inline
= BTRFS_DEFAULT_MAX_INLINE
;
2275 fs_info
->metadata_ratio
= 0;
2276 fs_info
->defrag_inodes
= RB_ROOT
;
2277 fs_info
->free_chunk_space
= 0;
2278 fs_info
->tree_mod_log
= RB_ROOT
;
2279 fs_info
->commit_interval
= BTRFS_DEFAULT_COMMIT_INTERVAL
;
2280 fs_info
->avg_delayed_ref_runtime
= div64_u64(NSEC_PER_SEC
, 64);
2281 /* readahead state */
2282 INIT_RADIX_TREE(&fs_info
->reada_tree
, GFP_NOFS
& ~__GFP_WAIT
);
2283 spin_lock_init(&fs_info
->reada_lock
);
2285 fs_info
->thread_pool_size
= min_t(unsigned long,
2286 num_online_cpus() + 2, 8);
2288 INIT_LIST_HEAD(&fs_info
->ordered_roots
);
2289 spin_lock_init(&fs_info
->ordered_root_lock
);
2290 fs_info
->delayed_root
= kmalloc(sizeof(struct btrfs_delayed_root
),
2292 if (!fs_info
->delayed_root
) {
2296 btrfs_init_delayed_root(fs_info
->delayed_root
);
2298 mutex_init(&fs_info
->scrub_lock
);
2299 atomic_set(&fs_info
->scrubs_running
, 0);
2300 atomic_set(&fs_info
->scrub_pause_req
, 0);
2301 atomic_set(&fs_info
->scrubs_paused
, 0);
2302 atomic_set(&fs_info
->scrub_cancel_req
, 0);
2303 init_waitqueue_head(&fs_info
->replace_wait
);
2304 init_waitqueue_head(&fs_info
->scrub_pause_wait
);
2305 fs_info
->scrub_workers_refcnt
= 0;
2306 #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
2307 fs_info
->check_integrity_print_mask
= 0;
2310 spin_lock_init(&fs_info
->balance_lock
);
2311 mutex_init(&fs_info
->balance_mutex
);
2312 atomic_set(&fs_info
->balance_running
, 0);
2313 atomic_set(&fs_info
->balance_pause_req
, 0);
2314 atomic_set(&fs_info
->balance_cancel_req
, 0);
2315 fs_info
->balance_ctl
= NULL
;
2316 init_waitqueue_head(&fs_info
->balance_wait_q
);
2317 btrfs_init_async_reclaim_work(&fs_info
->async_reclaim_work
);
2319 sb
->s_blocksize
= 4096;
2320 sb
->s_blocksize_bits
= blksize_bits(4096);
2321 sb
->s_bdi
= &fs_info
->bdi
;
2323 fs_info
->btree_inode
->i_ino
= BTRFS_BTREE_INODE_OBJECTID
;
2324 set_nlink(fs_info
->btree_inode
, 1);
2326 * we set the i_size on the btree inode to the max possible int.
2327 * the real end of the address space is determined by all of
2328 * the devices in the system
2330 fs_info
->btree_inode
->i_size
= OFFSET_MAX
;
2331 fs_info
->btree_inode
->i_mapping
->a_ops
= &btree_aops
;
2332 fs_info
->btree_inode
->i_mapping
->backing_dev_info
= &fs_info
->bdi
;
2334 RB_CLEAR_NODE(&BTRFS_I(fs_info
->btree_inode
)->rb_node
);
2335 extent_io_tree_init(&BTRFS_I(fs_info
->btree_inode
)->io_tree
,
2336 fs_info
->btree_inode
->i_mapping
);
2337 BTRFS_I(fs_info
->btree_inode
)->io_tree
.track_uptodate
= 0;
2338 extent_map_tree_init(&BTRFS_I(fs_info
->btree_inode
)->extent_tree
);
2340 BTRFS_I(fs_info
->btree_inode
)->io_tree
.ops
= &btree_extent_io_ops
;
2342 BTRFS_I(fs_info
->btree_inode
)->root
= tree_root
;
2343 memset(&BTRFS_I(fs_info
->btree_inode
)->location
, 0,
2344 sizeof(struct btrfs_key
));
2345 set_bit(BTRFS_INODE_DUMMY
,
2346 &BTRFS_I(fs_info
->btree_inode
)->runtime_flags
);
2347 btrfs_insert_inode_hash(fs_info
->btree_inode
);
2349 spin_lock_init(&fs_info
->block_group_cache_lock
);
2350 fs_info
->block_group_cache_tree
= RB_ROOT
;
2351 fs_info
->first_logical_byte
= (u64
)-1;
2353 extent_io_tree_init(&fs_info
->freed_extents
[0],
2354 fs_info
->btree_inode
->i_mapping
);
2355 extent_io_tree_init(&fs_info
->freed_extents
[1],
2356 fs_info
->btree_inode
->i_mapping
);
2357 fs_info
->pinned_extents
= &fs_info
->freed_extents
[0];
2358 fs_info
->do_barriers
= 1;
2361 mutex_init(&fs_info
->ordered_operations_mutex
);
2362 mutex_init(&fs_info
->ordered_extent_flush_mutex
);
2363 mutex_init(&fs_info
->tree_log_mutex
);
2364 mutex_init(&fs_info
->chunk_mutex
);
2365 mutex_init(&fs_info
->transaction_kthread_mutex
);
2366 mutex_init(&fs_info
->cleaner_mutex
);
2367 mutex_init(&fs_info
->volume_mutex
);
2368 init_rwsem(&fs_info
->commit_root_sem
);
2369 init_rwsem(&fs_info
->cleanup_work_sem
);
2370 init_rwsem(&fs_info
->subvol_sem
);
2371 sema_init(&fs_info
->uuid_tree_rescan_sem
, 1);
2372 fs_info
->dev_replace
.lock_owner
= 0;
2373 atomic_set(&fs_info
->dev_replace
.nesting_level
, 0);
2374 mutex_init(&fs_info
->dev_replace
.lock_finishing_cancel_unmount
);
2375 mutex_init(&fs_info
->dev_replace
.lock_management_lock
);
2376 mutex_init(&fs_info
->dev_replace
.lock
);
2378 spin_lock_init(&fs_info
->qgroup_lock
);
2379 mutex_init(&fs_info
->qgroup_ioctl_lock
);
2380 fs_info
->qgroup_tree
= RB_ROOT
;
2381 fs_info
->qgroup_op_tree
= RB_ROOT
;
2382 INIT_LIST_HEAD(&fs_info
->dirty_qgroups
);
2383 fs_info
->qgroup_seq
= 1;
2384 fs_info
->quota_enabled
= 0;
2385 fs_info
->pending_quota_state
= 0;
2386 fs_info
->qgroup_ulist
= NULL
;
2387 mutex_init(&fs_info
->qgroup_rescan_lock
);
2389 btrfs_init_free_cluster(&fs_info
->meta_alloc_cluster
);
2390 btrfs_init_free_cluster(&fs_info
->data_alloc_cluster
);
2392 init_waitqueue_head(&fs_info
->transaction_throttle
);
2393 init_waitqueue_head(&fs_info
->transaction_wait
);
2394 init_waitqueue_head(&fs_info
->transaction_blocked_wait
);
2395 init_waitqueue_head(&fs_info
->async_submit_wait
);
2397 INIT_LIST_HEAD(&fs_info
->pinned_chunks
);
2399 ret
= btrfs_alloc_stripe_hash_table(fs_info
);
2405 __setup_root(4096, 4096, 4096, tree_root
,
2406 fs_info
, BTRFS_ROOT_TREE_OBJECTID
);
2408 invalidate_bdev(fs_devices
->latest_bdev
);
2411 * Read super block and check the signature bytes only
2413 bh
= btrfs_read_dev_super(fs_devices
->latest_bdev
);
2420 * We want to check superblock checksum, the type is stored inside.
2421 * Pass the whole disk block of size BTRFS_SUPER_INFO_SIZE (4k).
2423 if (btrfs_check_super_csum(bh
->b_data
)) {
2424 printk(KERN_ERR
"BTRFS: superblock checksum mismatch\n");
2430 * super_copy is zeroed at allocation time and we never touch the
2431 * following bytes up to INFO_SIZE, the checksum is calculated from
2432 * the whole block of INFO_SIZE
2434 memcpy(fs_info
->super_copy
, bh
->b_data
, sizeof(*fs_info
->super_copy
));
2435 memcpy(fs_info
->super_for_commit
, fs_info
->super_copy
,
2436 sizeof(*fs_info
->super_for_commit
));
2439 memcpy(fs_info
->fsid
, fs_info
->super_copy
->fsid
, BTRFS_FSID_SIZE
);
2441 ret
= btrfs_check_super_valid(fs_info
, sb
->s_flags
& MS_RDONLY
);
2443 printk(KERN_ERR
"BTRFS: superblock contains fatal errors\n");
2448 disk_super
= fs_info
->super_copy
;
2449 if (!btrfs_super_root(disk_super
))
2452 /* check FS state, whether FS is broken. */
2453 if (btrfs_super_flags(disk_super
) & BTRFS_SUPER_FLAG_ERROR
)
2454 set_bit(BTRFS_FS_STATE_ERROR
, &fs_info
->fs_state
);
2457 * run through our array of backup supers and setup
2458 * our ring pointer to the oldest one
2460 generation
= btrfs_super_generation(disk_super
);
2461 find_oldest_super_backup(fs_info
, generation
);
2464 * In the long term, we'll store the compression type in the super
2465 * block, and it'll be used for per file compression control.
2467 fs_info
->compress_type
= BTRFS_COMPRESS_ZLIB
;
2469 ret
= btrfs_parse_options(tree_root
, options
);
2475 features
= btrfs_super_incompat_flags(disk_super
) &
2476 ~BTRFS_FEATURE_INCOMPAT_SUPP
;
2478 printk(KERN_ERR
"BTRFS: couldn't mount because of "
2479 "unsupported optional features (%Lx).\n",
2486 * Leafsize and nodesize were always equal, this is only a sanity check.
2488 if (le32_to_cpu(disk_super
->__unused_leafsize
) !=
2489 btrfs_super_nodesize(disk_super
)) {
2490 printk(KERN_ERR
"BTRFS: couldn't mount because metadata "
2491 "blocksizes don't match. node %d leaf %d\n",
2492 btrfs_super_nodesize(disk_super
),
2493 le32_to_cpu(disk_super
->__unused_leafsize
));
2497 if (btrfs_super_nodesize(disk_super
) > BTRFS_MAX_METADATA_BLOCKSIZE
) {
2498 printk(KERN_ERR
"BTRFS: couldn't mount because metadata "
2499 "blocksize (%d) was too large\n",
2500 btrfs_super_nodesize(disk_super
));
2505 features
= btrfs_super_incompat_flags(disk_super
);
2506 features
|= BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF
;
2507 if (tree_root
->fs_info
->compress_type
== BTRFS_COMPRESS_LZO
)
2508 features
|= BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO
;
2510 if (features
& BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA
)
2511 printk(KERN_ERR
"BTRFS: has skinny extents\n");
2514 * flag our filesystem as having big metadata blocks if
2515 * they are bigger than the page size
2517 if (btrfs_super_nodesize(disk_super
) > PAGE_CACHE_SIZE
) {
2518 if (!(features
& BTRFS_FEATURE_INCOMPAT_BIG_METADATA
))
2519 printk(KERN_INFO
"BTRFS: flagging fs with big metadata feature\n");
2520 features
|= BTRFS_FEATURE_INCOMPAT_BIG_METADATA
;
2523 nodesize
= btrfs_super_nodesize(disk_super
);
2524 sectorsize
= btrfs_super_sectorsize(disk_super
);
2525 stripesize
= btrfs_super_stripesize(disk_super
);
2526 fs_info
->dirty_metadata_batch
= nodesize
* (1 + ilog2(nr_cpu_ids
));
2527 fs_info
->delalloc_batch
= sectorsize
* 512 * (1 + ilog2(nr_cpu_ids
));
2530 * mixed block groups end up with duplicate but slightly offset
2531 * extent buffers for the same range. It leads to corruptions
2533 if ((features
& BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS
) &&
2534 (sectorsize
!= nodesize
)) {
2535 printk(KERN_WARNING
"BTRFS: unequal leaf/node/sector sizes "
2536 "are not allowed for mixed block groups on %s\n",
2542 * Needn't use the lock because there is no other task which will
2545 btrfs_set_super_incompat_flags(disk_super
, features
);
2547 features
= btrfs_super_compat_ro_flags(disk_super
) &
2548 ~BTRFS_FEATURE_COMPAT_RO_SUPP
;
2549 if (!(sb
->s_flags
& MS_RDONLY
) && features
) {
2550 printk(KERN_ERR
"BTRFS: couldn't mount RDWR because of "
2551 "unsupported option features (%Lx).\n",
2557 max_active
= fs_info
->thread_pool_size
;
2560 btrfs_alloc_workqueue("worker", flags
| WQ_HIGHPRI
,
2563 fs_info
->delalloc_workers
=
2564 btrfs_alloc_workqueue("delalloc", flags
, max_active
, 2);
2566 fs_info
->flush_workers
=
2567 btrfs_alloc_workqueue("flush_delalloc", flags
, max_active
, 0);
2569 fs_info
->caching_workers
=
2570 btrfs_alloc_workqueue("cache", flags
, max_active
, 0);
2573 * a higher idle thresh on the submit workers makes it much more
2574 * likely that bios will be send down in a sane order to the
2577 fs_info
->submit_workers
=
2578 btrfs_alloc_workqueue("submit", flags
,
2579 min_t(u64
, fs_devices
->num_devices
,
2582 fs_info
->fixup_workers
=
2583 btrfs_alloc_workqueue("fixup", flags
, 1, 0);
2586 * endios are largely parallel and should have a very
2589 fs_info
->endio_workers
=
2590 btrfs_alloc_workqueue("endio", flags
, max_active
, 4);
2591 fs_info
->endio_meta_workers
=
2592 btrfs_alloc_workqueue("endio-meta", flags
, max_active
, 4);
2593 fs_info
->endio_meta_write_workers
=
2594 btrfs_alloc_workqueue("endio-meta-write", flags
, max_active
, 2);
2595 fs_info
->endio_raid56_workers
=
2596 btrfs_alloc_workqueue("endio-raid56", flags
, max_active
, 4);
2597 fs_info
->endio_repair_workers
=
2598 btrfs_alloc_workqueue("endio-repair", flags
, 1, 0);
2599 fs_info
->rmw_workers
=
2600 btrfs_alloc_workqueue("rmw", flags
, max_active
, 2);
2601 fs_info
->endio_write_workers
=
2602 btrfs_alloc_workqueue("endio-write", flags
, max_active
, 2);
2603 fs_info
->endio_freespace_worker
=
2604 btrfs_alloc_workqueue("freespace-write", flags
, max_active
, 0);
2605 fs_info
->delayed_workers
=
2606 btrfs_alloc_workqueue("delayed-meta", flags
, max_active
, 0);
2607 fs_info
->readahead_workers
=
2608 btrfs_alloc_workqueue("readahead", flags
, max_active
, 2);
2609 fs_info
->qgroup_rescan_workers
=
2610 btrfs_alloc_workqueue("qgroup-rescan", flags
, 1, 0);
2611 fs_info
->extent_workers
=
2612 btrfs_alloc_workqueue("extent-refs", flags
,
2613 min_t(u64
, fs_devices
->num_devices
,
2616 if (!(fs_info
->workers
&& fs_info
->delalloc_workers
&&
2617 fs_info
->submit_workers
&& fs_info
->flush_workers
&&
2618 fs_info
->endio_workers
&& fs_info
->endio_meta_workers
&&
2619 fs_info
->endio_meta_write_workers
&&
2620 fs_info
->endio_repair_workers
&&
2621 fs_info
->endio_write_workers
&& fs_info
->endio_raid56_workers
&&
2622 fs_info
->endio_freespace_worker
&& fs_info
->rmw_workers
&&
2623 fs_info
->caching_workers
&& fs_info
->readahead_workers
&&
2624 fs_info
->fixup_workers
&& fs_info
->delayed_workers
&&
2625 fs_info
->extent_workers
&&
2626 fs_info
->qgroup_rescan_workers
)) {
2628 goto fail_sb_buffer
;
2631 fs_info
->bdi
.ra_pages
*= btrfs_super_num_devices(disk_super
);
2632 fs_info
->bdi
.ra_pages
= max(fs_info
->bdi
.ra_pages
,
2633 4 * 1024 * 1024 / PAGE_CACHE_SIZE
);
2635 tree_root
->nodesize
= nodesize
;
2636 tree_root
->sectorsize
= sectorsize
;
2637 tree_root
->stripesize
= stripesize
;
2639 sb
->s_blocksize
= sectorsize
;
2640 sb
->s_blocksize_bits
= blksize_bits(sectorsize
);
2642 if (btrfs_super_magic(disk_super
) != BTRFS_MAGIC
) {
2643 printk(KERN_INFO
"BTRFS: valid FS not found on %s\n", sb
->s_id
);
2644 goto fail_sb_buffer
;
2647 if (sectorsize
!= PAGE_SIZE
) {
2648 printk(KERN_WARNING
"BTRFS: Incompatible sector size(%lu) "
2649 "found on %s\n", (unsigned long)sectorsize
, sb
->s_id
);
2650 goto fail_sb_buffer
;
2653 mutex_lock(&fs_info
->chunk_mutex
);
2654 ret
= btrfs_read_sys_array(tree_root
);
2655 mutex_unlock(&fs_info
->chunk_mutex
);
2657 printk(KERN_WARNING
"BTRFS: failed to read the system "
2658 "array on %s\n", sb
->s_id
);
2659 goto fail_sb_buffer
;
2662 generation
= btrfs_super_chunk_root_generation(disk_super
);
2664 __setup_root(nodesize
, sectorsize
, stripesize
, chunk_root
,
2665 fs_info
, BTRFS_CHUNK_TREE_OBJECTID
);
2667 chunk_root
->node
= read_tree_block(chunk_root
,
2668 btrfs_super_chunk_root(disk_super
),
2670 if (!chunk_root
->node
||
2671 !test_bit(EXTENT_BUFFER_UPTODATE
, &chunk_root
->node
->bflags
)) {
2672 printk(KERN_WARNING
"BTRFS: failed to read chunk root on %s\n",
2674 goto fail_tree_roots
;
2676 btrfs_set_root_node(&chunk_root
->root_item
, chunk_root
->node
);
2677 chunk_root
->commit_root
= btrfs_root_node(chunk_root
);
2679 read_extent_buffer(chunk_root
->node
, fs_info
->chunk_tree_uuid
,
2680 btrfs_header_chunk_tree_uuid(chunk_root
->node
), BTRFS_UUID_SIZE
);
2682 ret
= btrfs_read_chunk_tree(chunk_root
);
2684 printk(KERN_WARNING
"BTRFS: failed to read chunk tree on %s\n",
2686 goto fail_tree_roots
;
2690 * keep the device that is marked to be the target device for the
2691 * dev_replace procedure
2693 btrfs_close_extra_devices(fs_info
, fs_devices
, 0);
2695 if (!fs_devices
->latest_bdev
) {
2696 printk(KERN_CRIT
"BTRFS: failed to read devices on %s\n",
2698 goto fail_tree_roots
;
2702 generation
= btrfs_super_generation(disk_super
);
2704 tree_root
->node
= read_tree_block(tree_root
,
2705 btrfs_super_root(disk_super
),
2707 if (!tree_root
->node
||
2708 !test_bit(EXTENT_BUFFER_UPTODATE
, &tree_root
->node
->bflags
)) {
2709 printk(KERN_WARNING
"BTRFS: failed to read tree root on %s\n",
2712 goto recovery_tree_root
;
2715 btrfs_set_root_node(&tree_root
->root_item
, tree_root
->node
);
2716 tree_root
->commit_root
= btrfs_root_node(tree_root
);
2717 btrfs_set_root_refs(&tree_root
->root_item
, 1);
2719 location
.objectid
= BTRFS_EXTENT_TREE_OBJECTID
;
2720 location
.type
= BTRFS_ROOT_ITEM_KEY
;
2721 location
.offset
= 0;
2723 extent_root
= btrfs_read_tree_root(tree_root
, &location
);
2724 if (IS_ERR(extent_root
)) {
2725 ret
= PTR_ERR(extent_root
);
2726 goto recovery_tree_root
;
2728 set_bit(BTRFS_ROOT_TRACK_DIRTY
, &extent_root
->state
);
2729 fs_info
->extent_root
= extent_root
;
2731 location
.objectid
= BTRFS_DEV_TREE_OBJECTID
;
2732 dev_root
= btrfs_read_tree_root(tree_root
, &location
);
2733 if (IS_ERR(dev_root
)) {
2734 ret
= PTR_ERR(dev_root
);
2735 goto recovery_tree_root
;
2737 set_bit(BTRFS_ROOT_TRACK_DIRTY
, &dev_root
->state
);
2738 fs_info
->dev_root
= dev_root
;
2739 btrfs_init_devices_late(fs_info
);
2741 location
.objectid
= BTRFS_CSUM_TREE_OBJECTID
;
2742 csum_root
= btrfs_read_tree_root(tree_root
, &location
);
2743 if (IS_ERR(csum_root
)) {
2744 ret
= PTR_ERR(csum_root
);
2745 goto recovery_tree_root
;
2747 set_bit(BTRFS_ROOT_TRACK_DIRTY
, &csum_root
->state
);
2748 fs_info
->csum_root
= csum_root
;
2750 location
.objectid
= BTRFS_QUOTA_TREE_OBJECTID
;
2751 quota_root
= btrfs_read_tree_root(tree_root
, &location
);
2752 if (!IS_ERR(quota_root
)) {
2753 set_bit(BTRFS_ROOT_TRACK_DIRTY
, "a_root
->state
);
2754 fs_info
->quota_enabled
= 1;
2755 fs_info
->pending_quota_state
= 1;
2756 fs_info
->quota_root
= quota_root
;
2759 location
.objectid
= BTRFS_UUID_TREE_OBJECTID
;
2760 uuid_root
= btrfs_read_tree_root(tree_root
, &location
);
2761 if (IS_ERR(uuid_root
)) {
2762 ret
= PTR_ERR(uuid_root
);
2764 goto recovery_tree_root
;
2765 create_uuid_tree
= true;
2766 check_uuid_tree
= false;
2768 set_bit(BTRFS_ROOT_TRACK_DIRTY
, &uuid_root
->state
);
2769 fs_info
->uuid_root
= uuid_root
;
2770 create_uuid_tree
= false;
2772 generation
!= btrfs_super_uuid_tree_generation(disk_super
);
2775 fs_info
->generation
= generation
;
2776 fs_info
->last_trans_committed
= generation
;
2778 ret
= btrfs_recover_balance(fs_info
);
2780 printk(KERN_WARNING
"BTRFS: failed to recover balance\n");
2781 goto fail_block_groups
;
2784 ret
= btrfs_init_dev_stats(fs_info
);
2786 printk(KERN_ERR
"BTRFS: failed to init dev_stats: %d\n",
2788 goto fail_block_groups
;
2791 ret
= btrfs_init_dev_replace(fs_info
);
2793 pr_err("BTRFS: failed to init dev_replace: %d\n", ret
);
2794 goto fail_block_groups
;
2797 btrfs_close_extra_devices(fs_info
, fs_devices
, 1);
2799 ret
= btrfs_sysfs_add_one(fs_info
);
2801 pr_err("BTRFS: failed to init sysfs interface: %d\n", ret
);
2802 goto fail_block_groups
;
2805 ret
= btrfs_init_space_info(fs_info
);
2807 printk(KERN_ERR
"BTRFS: Failed to initial space info: %d\n", ret
);
2811 ret
= btrfs_read_block_groups(extent_root
);
2813 printk(KERN_ERR
"BTRFS: Failed to read block groups: %d\n", ret
);
2816 fs_info
->num_tolerated_disk_barrier_failures
=
2817 btrfs_calc_num_tolerated_disk_barrier_failures(fs_info
);
2818 if (fs_info
->fs_devices
->missing_devices
>
2819 fs_info
->num_tolerated_disk_barrier_failures
&&
2820 !(sb
->s_flags
& MS_RDONLY
)) {
2821 printk(KERN_WARNING
"BTRFS: "
2822 "too many missing devices, writeable mount is not allowed\n");
2826 fs_info
->cleaner_kthread
= kthread_run(cleaner_kthread
, tree_root
,
2828 if (IS_ERR(fs_info
->cleaner_kthread
))
2831 fs_info
->transaction_kthread
= kthread_run(transaction_kthread
,
2833 "btrfs-transaction");
2834 if (IS_ERR(fs_info
->transaction_kthread
))
2837 if (!btrfs_test_opt(tree_root
, SSD
) &&
2838 !btrfs_test_opt(tree_root
, NOSSD
) &&
2839 !fs_info
->fs_devices
->rotating
) {
2840 printk(KERN_INFO
"BTRFS: detected SSD devices, enabling SSD "
2842 btrfs_set_opt(fs_info
->mount_opt
, SSD
);
2846 * Mount does not set all options immediatelly, we can do it now and do
2847 * not have to wait for transaction commit
2849 btrfs_apply_pending_changes(fs_info
);
2851 #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
2852 if (btrfs_test_opt(tree_root
, CHECK_INTEGRITY
)) {
2853 ret
= btrfsic_mount(tree_root
, fs_devices
,
2854 btrfs_test_opt(tree_root
,
2855 CHECK_INTEGRITY_INCLUDING_EXTENT_DATA
) ?
2857 fs_info
->check_integrity_print_mask
);
2859 printk(KERN_WARNING
"BTRFS: failed to initialize"
2860 " integrity check module %s\n", sb
->s_id
);
2863 ret
= btrfs_read_qgroup_config(fs_info
);
2865 goto fail_trans_kthread
;
2867 /* do not make disk changes in broken FS */
2868 if (btrfs_super_log_root(disk_super
) != 0) {
2869 u64 bytenr
= btrfs_super_log_root(disk_super
);
2871 if (fs_devices
->rw_devices
== 0) {
2872 printk(KERN_WARNING
"BTRFS: log replay required "
2878 log_tree_root
= btrfs_alloc_root(fs_info
);
2879 if (!log_tree_root
) {
2884 __setup_root(nodesize
, sectorsize
, stripesize
,
2885 log_tree_root
, fs_info
, BTRFS_TREE_LOG_OBJECTID
);
2887 log_tree_root
->node
= read_tree_block(tree_root
, bytenr
,
2889 if (!log_tree_root
->node
||
2890 !extent_buffer_uptodate(log_tree_root
->node
)) {
2891 printk(KERN_ERR
"BTRFS: failed to read log tree\n");
2892 free_extent_buffer(log_tree_root
->node
);
2893 kfree(log_tree_root
);
2896 /* returns with log_tree_root freed on success */
2897 ret
= btrfs_recover_log_trees(log_tree_root
);
2899 btrfs_error(tree_root
->fs_info
, ret
,
2900 "Failed to recover log tree");
2901 free_extent_buffer(log_tree_root
->node
);
2902 kfree(log_tree_root
);
2906 if (sb
->s_flags
& MS_RDONLY
) {
2907 ret
= btrfs_commit_super(tree_root
);
2913 ret
= btrfs_find_orphan_roots(tree_root
);
2917 if (!(sb
->s_flags
& MS_RDONLY
)) {
2918 ret
= btrfs_cleanup_fs_roots(fs_info
);
2922 mutex_lock(&fs_info
->cleaner_mutex
);
2923 ret
= btrfs_recover_relocation(tree_root
);
2924 mutex_unlock(&fs_info
->cleaner_mutex
);
2927 "BTRFS: failed to recover relocation\n");
2933 location
.objectid
= BTRFS_FS_TREE_OBJECTID
;
2934 location
.type
= BTRFS_ROOT_ITEM_KEY
;
2935 location
.offset
= 0;
2937 fs_info
->fs_root
= btrfs_read_fs_root_no_name(fs_info
, &location
);
2938 if (IS_ERR(fs_info
->fs_root
)) {
2939 err
= PTR_ERR(fs_info
->fs_root
);
2943 if (sb
->s_flags
& MS_RDONLY
)
2946 down_read(&fs_info
->cleanup_work_sem
);
2947 if ((ret
= btrfs_orphan_cleanup(fs_info
->fs_root
)) ||
2948 (ret
= btrfs_orphan_cleanup(fs_info
->tree_root
))) {
2949 up_read(&fs_info
->cleanup_work_sem
);
2950 close_ctree(tree_root
);
2953 up_read(&fs_info
->cleanup_work_sem
);
2955 ret
= btrfs_resume_balance_async(fs_info
);
2957 printk(KERN_WARNING
"BTRFS: failed to resume balance\n");
2958 close_ctree(tree_root
);
2962 ret
= btrfs_resume_dev_replace_async(fs_info
);
2964 pr_warn("BTRFS: failed to resume dev_replace\n");
2965 close_ctree(tree_root
);
2969 btrfs_qgroup_rescan_resume(fs_info
);
2971 if (create_uuid_tree
) {
2972 pr_info("BTRFS: creating UUID tree\n");
2973 ret
= btrfs_create_uuid_tree(fs_info
);
2975 pr_warn("BTRFS: failed to create the UUID tree %d\n",
2977 close_ctree(tree_root
);
2980 } else if (check_uuid_tree
||
2981 btrfs_test_opt(tree_root
, RESCAN_UUID_TREE
)) {
2982 pr_info("BTRFS: checking UUID tree\n");
2983 ret
= btrfs_check_uuid_tree(fs_info
);
2985 pr_warn("BTRFS: failed to check the UUID tree %d\n",
2987 close_ctree(tree_root
);
2991 fs_info
->update_uuid_tree_gen
= 1;
2999 btrfs_free_qgroup_config(fs_info
);
3001 kthread_stop(fs_info
->transaction_kthread
);
3002 btrfs_cleanup_transaction(fs_info
->tree_root
);
3003 btrfs_free_fs_roots(fs_info
);
3005 kthread_stop(fs_info
->cleaner_kthread
);
3008 * make sure we're done with the btree inode before we stop our
3011 filemap_write_and_wait(fs_info
->btree_inode
->i_mapping
);
3014 btrfs_sysfs_remove_one(fs_info
);
3017 btrfs_put_block_group_cache(fs_info
);
3018 btrfs_free_block_groups(fs_info
);
3021 free_root_pointers(fs_info
, 1);
3022 invalidate_inode_pages2(fs_info
->btree_inode
->i_mapping
);
3025 btrfs_stop_all_workers(fs_info
);
3028 btrfs_mapping_tree_free(&fs_info
->mapping_tree
);
3030 iput(fs_info
->btree_inode
);
3032 percpu_counter_destroy(&fs_info
->bio_counter
);
3033 fail_delalloc_bytes
:
3034 percpu_counter_destroy(&fs_info
->delalloc_bytes
);
3035 fail_dirty_metadata_bytes
:
3036 percpu_counter_destroy(&fs_info
->dirty_metadata_bytes
);
3038 bdi_destroy(&fs_info
->bdi
);
3040 cleanup_srcu_struct(&fs_info
->subvol_srcu
);
3042 btrfs_free_stripe_hash_table(fs_info
);
3043 btrfs_close_devices(fs_info
->fs_devices
);
3047 if (!btrfs_test_opt(tree_root
, RECOVERY
))
3048 goto fail_tree_roots
;
3050 free_root_pointers(fs_info
, 0);
3052 /* don't use the log in recovery mode, it won't be valid */
3053 btrfs_set_super_log_root(disk_super
, 0);
3055 /* we can't trust the free space cache either */
3056 btrfs_set_opt(fs_info
->mount_opt
, CLEAR_CACHE
);
3058 ret
= next_root_backup(fs_info
, fs_info
->super_copy
,
3059 &num_backups_tried
, &backup_index
);
3061 goto fail_block_groups
;
3062 goto retry_root_backup
;
3065 static void btrfs_end_buffer_write_sync(struct buffer_head
*bh
, int uptodate
)
3068 set_buffer_uptodate(bh
);
3070 struct btrfs_device
*device
= (struct btrfs_device
*)
3073 printk_ratelimited_in_rcu(KERN_WARNING
"BTRFS: lost page write due to "
3074 "I/O error on %s\n",
3075 rcu_str_deref(device
->name
));
3076 /* note, we dont' set_buffer_write_io_error because we have
3077 * our own ways of dealing with the IO errors
3079 clear_buffer_uptodate(bh
);
3080 btrfs_dev_stat_inc_and_print(device
, BTRFS_DEV_STAT_WRITE_ERRS
);
3086 struct buffer_head
*btrfs_read_dev_super(struct block_device
*bdev
)
3088 struct buffer_head
*bh
;
3089 struct buffer_head
*latest
= NULL
;
3090 struct btrfs_super_block
*super
;
3095 /* we would like to check all the supers, but that would make
3096 * a btrfs mount succeed after a mkfs from a different FS.
3097 * So, we need to add a special mount option to scan for
3098 * later supers, using BTRFS_SUPER_MIRROR_MAX instead
3100 for (i
= 0; i
< 1; i
++) {
3101 bytenr
= btrfs_sb_offset(i
);
3102 if (bytenr
+ BTRFS_SUPER_INFO_SIZE
>=
3103 i_size_read(bdev
->bd_inode
))
3105 bh
= __bread(bdev
, bytenr
/ 4096,
3106 BTRFS_SUPER_INFO_SIZE
);
3110 super
= (struct btrfs_super_block
*)bh
->b_data
;
3111 if (btrfs_super_bytenr(super
) != bytenr
||
3112 btrfs_super_magic(super
) != BTRFS_MAGIC
) {
3117 if (!latest
|| btrfs_super_generation(super
) > transid
) {
3120 transid
= btrfs_super_generation(super
);
3129 * this should be called twice, once with wait == 0 and
3130 * once with wait == 1. When wait == 0 is done, all the buffer heads
3131 * we write are pinned.
3133 * They are released when wait == 1 is done.
3134 * max_mirrors must be the same for both runs, and it indicates how
3135 * many supers on this one device should be written.
3137 * max_mirrors == 0 means to write them all.
3139 static int write_dev_supers(struct btrfs_device
*device
,
3140 struct btrfs_super_block
*sb
,
3141 int do_barriers
, int wait
, int max_mirrors
)
3143 struct buffer_head
*bh
;
3150 if (max_mirrors
== 0)
3151 max_mirrors
= BTRFS_SUPER_MIRROR_MAX
;
3153 for (i
= 0; i
< max_mirrors
; i
++) {
3154 bytenr
= btrfs_sb_offset(i
);
3155 if (bytenr
+ BTRFS_SUPER_INFO_SIZE
>=
3156 device
->commit_total_bytes
)
3160 bh
= __find_get_block(device
->bdev
, bytenr
/ 4096,
3161 BTRFS_SUPER_INFO_SIZE
);
3167 if (!buffer_uptodate(bh
))
3170 /* drop our reference */
3173 /* drop the reference from the wait == 0 run */
3177 btrfs_set_super_bytenr(sb
, bytenr
);
3180 crc
= btrfs_csum_data((char *)sb
+
3181 BTRFS_CSUM_SIZE
, crc
,
3182 BTRFS_SUPER_INFO_SIZE
-
3184 btrfs_csum_final(crc
, sb
->csum
);
3187 * one reference for us, and we leave it for the
3190 bh
= __getblk(device
->bdev
, bytenr
/ 4096,
3191 BTRFS_SUPER_INFO_SIZE
);
3193 printk(KERN_ERR
"BTRFS: couldn't get super "
3194 "buffer head for bytenr %Lu\n", bytenr
);
3199 memcpy(bh
->b_data
, sb
, BTRFS_SUPER_INFO_SIZE
);
3201 /* one reference for submit_bh */
3204 set_buffer_uptodate(bh
);
3206 bh
->b_end_io
= btrfs_end_buffer_write_sync
;
3207 bh
->b_private
= device
;
3211 * we fua the first super. The others we allow
3215 ret
= btrfsic_submit_bh(WRITE_FUA
, bh
);
3217 ret
= btrfsic_submit_bh(WRITE_SYNC
, bh
);
3221 return errors
< i
? 0 : -1;
3225 * endio for the write_dev_flush, this will wake anyone waiting
3226 * for the barrier when it is done
3228 static void btrfs_end_empty_barrier(struct bio
*bio
, int err
)
3231 if (err
== -EOPNOTSUPP
)
3232 set_bit(BIO_EOPNOTSUPP
, &bio
->bi_flags
);
3233 clear_bit(BIO_UPTODATE
, &bio
->bi_flags
);
3235 if (bio
->bi_private
)
3236 complete(bio
->bi_private
);
3241 * trigger flushes for one the devices. If you pass wait == 0, the flushes are
3242 * sent down. With wait == 1, it waits for the previous flush.
3244 * any device where the flush fails with eopnotsupp are flagged as not-barrier
3247 static int write_dev_flush(struct btrfs_device
*device
, int wait
)
3252 if (device
->nobarriers
)
3256 bio
= device
->flush_bio
;
3260 wait_for_completion(&device
->flush_wait
);
3262 if (bio_flagged(bio
, BIO_EOPNOTSUPP
)) {
3263 printk_in_rcu("BTRFS: disabling barriers on dev %s\n",
3264 rcu_str_deref(device
->name
));
3265 device
->nobarriers
= 1;
3266 } else if (!bio_flagged(bio
, BIO_UPTODATE
)) {
3268 btrfs_dev_stat_inc_and_print(device
,
3269 BTRFS_DEV_STAT_FLUSH_ERRS
);
3272 /* drop the reference from the wait == 0 run */
3274 device
->flush_bio
= NULL
;
3280 * one reference for us, and we leave it for the
3283 device
->flush_bio
= NULL
;
3284 bio
= btrfs_io_bio_alloc(GFP_NOFS
, 0);
3288 bio
->bi_end_io
= btrfs_end_empty_barrier
;
3289 bio
->bi_bdev
= device
->bdev
;
3290 init_completion(&device
->flush_wait
);
3291 bio
->bi_private
= &device
->flush_wait
;
3292 device
->flush_bio
= bio
;
3295 btrfsic_submit_bio(WRITE_FLUSH
, bio
);
3301 * send an empty flush down to each device in parallel,
3302 * then wait for them
3304 static int barrier_all_devices(struct btrfs_fs_info
*info
)
3306 struct list_head
*head
;
3307 struct btrfs_device
*dev
;
3308 int errors_send
= 0;
3309 int errors_wait
= 0;
3312 /* send down all the barriers */
3313 head
= &info
->fs_devices
->devices
;
3314 list_for_each_entry_rcu(dev
, head
, dev_list
) {
3321 if (!dev
->in_fs_metadata
|| !dev
->writeable
)
3324 ret
= write_dev_flush(dev
, 0);
3329 /* wait for all the barriers */
3330 list_for_each_entry_rcu(dev
, head
, dev_list
) {
3337 if (!dev
->in_fs_metadata
|| !dev
->writeable
)
3340 ret
= write_dev_flush(dev
, 1);
3344 if (errors_send
> info
->num_tolerated_disk_barrier_failures
||
3345 errors_wait
> info
->num_tolerated_disk_barrier_failures
)
3350 int btrfs_calc_num_tolerated_disk_barrier_failures(
3351 struct btrfs_fs_info
*fs_info
)
3353 struct btrfs_ioctl_space_info space
;
3354 struct btrfs_space_info
*sinfo
;
3355 u64 types
[] = {BTRFS_BLOCK_GROUP_DATA
,
3356 BTRFS_BLOCK_GROUP_SYSTEM
,
3357 BTRFS_BLOCK_GROUP_METADATA
,
3358 BTRFS_BLOCK_GROUP_DATA
| BTRFS_BLOCK_GROUP_METADATA
};
3362 int num_tolerated_disk_barrier_failures
=
3363 (int)fs_info
->fs_devices
->num_devices
;
3365 for (i
= 0; i
< num_types
; i
++) {
3366 struct btrfs_space_info
*tmp
;
3370 list_for_each_entry_rcu(tmp
, &fs_info
->space_info
, list
) {
3371 if (tmp
->flags
== types
[i
]) {
3381 down_read(&sinfo
->groups_sem
);
3382 for (c
= 0; c
< BTRFS_NR_RAID_TYPES
; c
++) {
3383 if (!list_empty(&sinfo
->block_groups
[c
])) {
3386 btrfs_get_block_group_info(
3387 &sinfo
->block_groups
[c
], &space
);
3388 if (space
.total_bytes
== 0 ||
3389 space
.used_bytes
== 0)
3391 flags
= space
.flags
;
3394 * 0: if dup, single or RAID0 is configured for
3395 * any of metadata, system or data, else
3396 * 1: if RAID5 is configured, or if RAID1 or
3397 * RAID10 is configured and only two mirrors
3399 * 2: if RAID6 is configured, else
3400 * num_mirrors - 1: if RAID1 or RAID10 is
3401 * configured and more than
3402 * 2 mirrors are used.
3404 if (num_tolerated_disk_barrier_failures
> 0 &&
3405 ((flags
& (BTRFS_BLOCK_GROUP_DUP
|
3406 BTRFS_BLOCK_GROUP_RAID0
)) ||
3407 ((flags
& BTRFS_BLOCK_GROUP_PROFILE_MASK
)
3409 num_tolerated_disk_barrier_failures
= 0;
3410 else if (num_tolerated_disk_barrier_failures
> 1) {
3411 if (flags
& (BTRFS_BLOCK_GROUP_RAID1
|
3412 BTRFS_BLOCK_GROUP_RAID5
|
3413 BTRFS_BLOCK_GROUP_RAID10
)) {
3414 num_tolerated_disk_barrier_failures
= 1;
3416 BTRFS_BLOCK_GROUP_RAID6
) {
3417 num_tolerated_disk_barrier_failures
= 2;
3422 up_read(&sinfo
->groups_sem
);
3425 return num_tolerated_disk_barrier_failures
;
3428 static int write_all_supers(struct btrfs_root
*root
, int max_mirrors
)
3430 struct list_head
*head
;
3431 struct btrfs_device
*dev
;
3432 struct btrfs_super_block
*sb
;
3433 struct btrfs_dev_item
*dev_item
;
3437 int total_errors
= 0;
3440 do_barriers
= !btrfs_test_opt(root
, NOBARRIER
);
3441 backup_super_roots(root
->fs_info
);
3443 sb
= root
->fs_info
->super_for_commit
;
3444 dev_item
= &sb
->dev_item
;
3446 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
3447 head
= &root
->fs_info
->fs_devices
->devices
;
3448 max_errors
= btrfs_super_num_devices(root
->fs_info
->super_copy
) - 1;
3451 ret
= barrier_all_devices(root
->fs_info
);
3454 &root
->fs_info
->fs_devices
->device_list_mutex
);
3455 btrfs_error(root
->fs_info
, ret
,
3456 "errors while submitting device barriers.");
3461 list_for_each_entry_rcu(dev
, head
, dev_list
) {
3466 if (!dev
->in_fs_metadata
|| !dev
->writeable
)
3469 btrfs_set_stack_device_generation(dev_item
, 0);
3470 btrfs_set_stack_device_type(dev_item
, dev
->type
);
3471 btrfs_set_stack_device_id(dev_item
, dev
->devid
);
3472 btrfs_set_stack_device_total_bytes(dev_item
,
3473 dev
->commit_total_bytes
);
3474 btrfs_set_stack_device_bytes_used(dev_item
,
3475 dev
->commit_bytes_used
);
3476 btrfs_set_stack_device_io_align(dev_item
, dev
->io_align
);
3477 btrfs_set_stack_device_io_width(dev_item
, dev
->io_width
);
3478 btrfs_set_stack_device_sector_size(dev_item
, dev
->sector_size
);
3479 memcpy(dev_item
->uuid
, dev
->uuid
, BTRFS_UUID_SIZE
);
3480 memcpy(dev_item
->fsid
, dev
->fs_devices
->fsid
, BTRFS_UUID_SIZE
);
3482 flags
= btrfs_super_flags(sb
);
3483 btrfs_set_super_flags(sb
, flags
| BTRFS_HEADER_FLAG_WRITTEN
);
3485 ret
= write_dev_supers(dev
, sb
, do_barriers
, 0, max_mirrors
);
3489 if (total_errors
> max_errors
) {
3490 btrfs_err(root
->fs_info
, "%d errors while writing supers",
3492 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
3494 /* FUA is masked off if unsupported and can't be the reason */
3495 btrfs_error(root
->fs_info
, -EIO
,
3496 "%d errors while writing supers", total_errors
);
3501 list_for_each_entry_rcu(dev
, head
, dev_list
) {
3504 if (!dev
->in_fs_metadata
|| !dev
->writeable
)
3507 ret
= write_dev_supers(dev
, sb
, do_barriers
, 1, max_mirrors
);
3511 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
3512 if (total_errors
> max_errors
) {
3513 btrfs_error(root
->fs_info
, -EIO
,
3514 "%d errors while writing supers", total_errors
);
3520 int write_ctree_super(struct btrfs_trans_handle
*trans
,
3521 struct btrfs_root
*root
, int max_mirrors
)
3523 return write_all_supers(root
, max_mirrors
);
3526 /* Drop a fs root from the radix tree and free it. */
3527 void btrfs_drop_and_free_fs_root(struct btrfs_fs_info
*fs_info
,
3528 struct btrfs_root
*root
)
3530 spin_lock(&fs_info
->fs_roots_radix_lock
);
3531 radix_tree_delete(&fs_info
->fs_roots_radix
,
3532 (unsigned long)root
->root_key
.objectid
);
3533 spin_unlock(&fs_info
->fs_roots_radix_lock
);
3535 if (btrfs_root_refs(&root
->root_item
) == 0)
3536 synchronize_srcu(&fs_info
->subvol_srcu
);
3538 if (test_bit(BTRFS_FS_STATE_ERROR
, &fs_info
->fs_state
))
3539 btrfs_free_log(NULL
, root
);
3541 if (root
->free_ino_pinned
)
3542 __btrfs_remove_free_space_cache(root
->free_ino_pinned
);
3543 if (root
->free_ino_ctl
)
3544 __btrfs_remove_free_space_cache(root
->free_ino_ctl
);
3548 static void free_fs_root(struct btrfs_root
*root
)
3550 iput(root
->ino_cache_inode
);
3551 WARN_ON(!RB_EMPTY_ROOT(&root
->inode_tree
));
3552 btrfs_free_block_rsv(root
, root
->orphan_block_rsv
);
3553 root
->orphan_block_rsv
= NULL
;
3555 free_anon_bdev(root
->anon_dev
);
3556 if (root
->subv_writers
)
3557 btrfs_free_subvolume_writers(root
->subv_writers
);
3558 free_extent_buffer(root
->node
);
3559 free_extent_buffer(root
->commit_root
);
3560 kfree(root
->free_ino_ctl
);
3561 kfree(root
->free_ino_pinned
);
3563 btrfs_put_fs_root(root
);
3566 void btrfs_free_fs_root(struct btrfs_root
*root
)
3571 int btrfs_cleanup_fs_roots(struct btrfs_fs_info
*fs_info
)
3573 u64 root_objectid
= 0;
3574 struct btrfs_root
*gang
[8];
3577 unsigned int ret
= 0;
3581 index
= srcu_read_lock(&fs_info
->subvol_srcu
);
3582 ret
= radix_tree_gang_lookup(&fs_info
->fs_roots_radix
,
3583 (void **)gang
, root_objectid
,
3586 srcu_read_unlock(&fs_info
->subvol_srcu
, index
);
3589 root_objectid
= gang
[ret
- 1]->root_key
.objectid
+ 1;
3591 for (i
= 0; i
< ret
; i
++) {
3592 /* Avoid to grab roots in dead_roots */
3593 if (btrfs_root_refs(&gang
[i
]->root_item
) == 0) {
3597 /* grab all the search result for later use */
3598 gang
[i
] = btrfs_grab_fs_root(gang
[i
]);
3600 srcu_read_unlock(&fs_info
->subvol_srcu
, index
);
3602 for (i
= 0; i
< ret
; i
++) {
3605 root_objectid
= gang
[i
]->root_key
.objectid
;
3606 err
= btrfs_orphan_cleanup(gang
[i
]);
3609 btrfs_put_fs_root(gang
[i
]);
3614 /* release the uncleaned roots due to error */
3615 for (; i
< ret
; i
++) {
3617 btrfs_put_fs_root(gang
[i
]);
3622 int btrfs_commit_super(struct btrfs_root
*root
)
3624 struct btrfs_trans_handle
*trans
;
3626 mutex_lock(&root
->fs_info
->cleaner_mutex
);
3627 btrfs_run_delayed_iputs(root
);
3628 mutex_unlock(&root
->fs_info
->cleaner_mutex
);
3629 wake_up_process(root
->fs_info
->cleaner_kthread
);
3631 /* wait until ongoing cleanup work done */
3632 down_write(&root
->fs_info
->cleanup_work_sem
);
3633 up_write(&root
->fs_info
->cleanup_work_sem
);
3635 trans
= btrfs_join_transaction(root
);
3637 return PTR_ERR(trans
);
3638 return btrfs_commit_transaction(trans
, root
);
3641 void close_ctree(struct btrfs_root
*root
)
3643 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
3646 fs_info
->closing
= 1;
3649 /* wait for the uuid_scan task to finish */
3650 down(&fs_info
->uuid_tree_rescan_sem
);
3651 /* avoid complains from lockdep et al., set sem back to initial state */
3652 up(&fs_info
->uuid_tree_rescan_sem
);
3654 /* pause restriper - we want to resume on mount */
3655 btrfs_pause_balance(fs_info
);
3657 btrfs_dev_replace_suspend_for_unmount(fs_info
);
3659 btrfs_scrub_cancel(fs_info
);
3661 /* wait for any defraggers to finish */
3662 wait_event(fs_info
->transaction_wait
,
3663 (atomic_read(&fs_info
->defrag_running
) == 0));
3665 /* clear out the rbtree of defraggable inodes */
3666 btrfs_cleanup_defrag_inodes(fs_info
);
3668 cancel_work_sync(&fs_info
->async_reclaim_work
);
3670 if (!(fs_info
->sb
->s_flags
& MS_RDONLY
)) {
3671 ret
= btrfs_commit_super(root
);
3673 btrfs_err(root
->fs_info
, "commit super ret %d", ret
);
3676 if (test_bit(BTRFS_FS_STATE_ERROR
, &fs_info
->fs_state
))
3677 btrfs_error_commit_super(root
);
3679 kthread_stop(fs_info
->transaction_kthread
);
3680 kthread_stop(fs_info
->cleaner_kthread
);
3682 fs_info
->closing
= 2;
3685 btrfs_free_qgroup_config(root
->fs_info
);
3687 if (percpu_counter_sum(&fs_info
->delalloc_bytes
)) {
3688 btrfs_info(root
->fs_info
, "at unmount delalloc count %lld",
3689 percpu_counter_sum(&fs_info
->delalloc_bytes
));
3692 btrfs_sysfs_remove_one(fs_info
);
3694 btrfs_free_fs_roots(fs_info
);
3696 btrfs_put_block_group_cache(fs_info
);
3698 btrfs_free_block_groups(fs_info
);
3701 * we must make sure there is not any read request to
3702 * submit after we stopping all workers.
3704 invalidate_inode_pages2(fs_info
->btree_inode
->i_mapping
);
3705 btrfs_stop_all_workers(fs_info
);
3708 free_root_pointers(fs_info
, 1);
3710 iput(fs_info
->btree_inode
);
3712 #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
3713 if (btrfs_test_opt(root
, CHECK_INTEGRITY
))
3714 btrfsic_unmount(root
, fs_info
->fs_devices
);
3717 btrfs_close_devices(fs_info
->fs_devices
);
3718 btrfs_mapping_tree_free(&fs_info
->mapping_tree
);
3720 percpu_counter_destroy(&fs_info
->dirty_metadata_bytes
);
3721 percpu_counter_destroy(&fs_info
->delalloc_bytes
);
3722 percpu_counter_destroy(&fs_info
->bio_counter
);
3723 bdi_destroy(&fs_info
->bdi
);
3724 cleanup_srcu_struct(&fs_info
->subvol_srcu
);
3726 btrfs_free_stripe_hash_table(fs_info
);
3728 btrfs_free_block_rsv(root
, root
->orphan_block_rsv
);
3729 root
->orphan_block_rsv
= NULL
;
3732 while (!list_empty(&fs_info
->pinned_chunks
)) {
3733 struct extent_map
*em
;
3735 em
= list_first_entry(&fs_info
->pinned_chunks
,
3736 struct extent_map
, list
);
3737 list_del_init(&em
->list
);
3738 free_extent_map(em
);
3740 unlock_chunks(root
);
3743 int btrfs_buffer_uptodate(struct extent_buffer
*buf
, u64 parent_transid
,
3747 struct inode
*btree_inode
= buf
->pages
[0]->mapping
->host
;
3749 ret
= extent_buffer_uptodate(buf
);
3753 ret
= verify_parent_transid(&BTRFS_I(btree_inode
)->io_tree
, buf
,
3754 parent_transid
, atomic
);
3760 int btrfs_set_buffer_uptodate(struct extent_buffer
*buf
)
3762 return set_extent_buffer_uptodate(buf
);
3765 void btrfs_mark_buffer_dirty(struct extent_buffer
*buf
)
3767 struct btrfs_root
*root
;
3768 u64 transid
= btrfs_header_generation(buf
);
3771 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
3773 * This is a fast path so only do this check if we have sanity tests
3774 * enabled. Normal people shouldn't be marking dummy buffers as dirty
3775 * outside of the sanity tests.
3777 if (unlikely(test_bit(EXTENT_BUFFER_DUMMY
, &buf
->bflags
)))
3780 root
= BTRFS_I(buf
->pages
[0]->mapping
->host
)->root
;
3781 btrfs_assert_tree_locked(buf
);
3782 if (transid
!= root
->fs_info
->generation
)
3783 WARN(1, KERN_CRIT
"btrfs transid mismatch buffer %llu, "
3784 "found %llu running %llu\n",
3785 buf
->start
, transid
, root
->fs_info
->generation
);
3786 was_dirty
= set_extent_buffer_dirty(buf
);
3788 __percpu_counter_add(&root
->fs_info
->dirty_metadata_bytes
,
3790 root
->fs_info
->dirty_metadata_batch
);
3791 #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
3792 if (btrfs_header_level(buf
) == 0 && check_leaf(root
, buf
)) {
3793 btrfs_print_leaf(root
, buf
);
3799 static void __btrfs_btree_balance_dirty(struct btrfs_root
*root
,
3803 * looks as though older kernels can get into trouble with
3804 * this code, they end up stuck in balance_dirty_pages forever
3808 if (current
->flags
& PF_MEMALLOC
)
3812 btrfs_balance_delayed_items(root
);
3814 ret
= percpu_counter_compare(&root
->fs_info
->dirty_metadata_bytes
,
3815 BTRFS_DIRTY_METADATA_THRESH
);
3817 balance_dirty_pages_ratelimited(
3818 root
->fs_info
->btree_inode
->i_mapping
);
3823 void btrfs_btree_balance_dirty(struct btrfs_root
*root
)
3825 __btrfs_btree_balance_dirty(root
, 1);
3828 void btrfs_btree_balance_dirty_nodelay(struct btrfs_root
*root
)
3830 __btrfs_btree_balance_dirty(root
, 0);
3833 int btrfs_read_buffer(struct extent_buffer
*buf
, u64 parent_transid
)
3835 struct btrfs_root
*root
= BTRFS_I(buf
->pages
[0]->mapping
->host
)->root
;
3836 return btree_read_extent_buffer_pages(root
, buf
, 0, parent_transid
);
3839 static int btrfs_check_super_valid(struct btrfs_fs_info
*fs_info
,
3842 struct btrfs_super_block
*sb
= fs_info
->super_copy
;
3845 if (btrfs_super_root_level(sb
) >= BTRFS_MAX_LEVEL
) {
3846 printk(KERN_ERR
"BTRFS: tree_root level too big: %d >= %d\n",
3847 btrfs_super_root_level(sb
), BTRFS_MAX_LEVEL
);
3850 if (btrfs_super_chunk_root_level(sb
) >= BTRFS_MAX_LEVEL
) {
3851 printk(KERN_ERR
"BTRFS: chunk_root level too big: %d >= %d\n",
3852 btrfs_super_chunk_root_level(sb
), BTRFS_MAX_LEVEL
);
3855 if (btrfs_super_log_root_level(sb
) >= BTRFS_MAX_LEVEL
) {
3856 printk(KERN_ERR
"BTRFS: log_root level too big: %d >= %d\n",
3857 btrfs_super_log_root_level(sb
), BTRFS_MAX_LEVEL
);
3862 * The common minimum, we don't know if we can trust the nodesize/sectorsize
3863 * items yet, they'll be verified later. Issue just a warning.
3865 if (!IS_ALIGNED(btrfs_super_root(sb
), 4096))
3866 printk(KERN_WARNING
"BTRFS: tree_root block unaligned: %llu\n",
3867 btrfs_super_root(sb
));
3868 if (!IS_ALIGNED(btrfs_super_chunk_root(sb
), 4096))
3869 printk(KERN_WARNING
"BTRFS: chunk_root block unaligned: %llu\n",
3870 btrfs_super_chunk_root(sb
));
3871 if (!IS_ALIGNED(btrfs_super_log_root(sb
), 4096))
3872 printk(KERN_WARNING
"BTRFS: log_root block unaligned: %llu\n",
3873 btrfs_super_log_root(sb
));
3875 if (memcmp(fs_info
->fsid
, sb
->dev_item
.fsid
, BTRFS_UUID_SIZE
) != 0) {
3876 printk(KERN_ERR
"BTRFS: dev_item UUID does not match fsid: %pU != %pU\n",
3877 fs_info
->fsid
, sb
->dev_item
.fsid
);
3882 * Hint to catch really bogus numbers, bitflips or so, more exact checks are
3885 if (btrfs_super_num_devices(sb
) > (1UL << 31))
3886 printk(KERN_WARNING
"BTRFS: suspicious number of devices: %llu\n",
3887 btrfs_super_num_devices(sb
));
3889 if (btrfs_super_bytenr(sb
) != BTRFS_SUPER_INFO_OFFSET
) {
3890 printk(KERN_ERR
"BTRFS: super offset mismatch %llu != %u\n",
3891 btrfs_super_bytenr(sb
), BTRFS_SUPER_INFO_OFFSET
);
3896 * The generation is a global counter, we'll trust it more than the others
3897 * but it's still possible that it's the one that's wrong.
3899 if (btrfs_super_generation(sb
) < btrfs_super_chunk_root_generation(sb
))
3901 "BTRFS: suspicious: generation < chunk_root_generation: %llu < %llu\n",
3902 btrfs_super_generation(sb
), btrfs_super_chunk_root_generation(sb
));
3903 if (btrfs_super_generation(sb
) < btrfs_super_cache_generation(sb
)
3904 && btrfs_super_cache_generation(sb
) != (u64
)-1)
3906 "BTRFS: suspicious: generation < cache_generation: %llu < %llu\n",
3907 btrfs_super_generation(sb
), btrfs_super_cache_generation(sb
));
3912 static void btrfs_error_commit_super(struct btrfs_root
*root
)
3914 mutex_lock(&root
->fs_info
->cleaner_mutex
);
3915 btrfs_run_delayed_iputs(root
);
3916 mutex_unlock(&root
->fs_info
->cleaner_mutex
);
3918 down_write(&root
->fs_info
->cleanup_work_sem
);
3919 up_write(&root
->fs_info
->cleanup_work_sem
);
3921 /* cleanup FS via transaction */
3922 btrfs_cleanup_transaction(root
);
3925 static void btrfs_destroy_ordered_extents(struct btrfs_root
*root
)
3927 struct btrfs_ordered_extent
*ordered
;
3929 spin_lock(&root
->ordered_extent_lock
);
3931 * This will just short circuit the ordered completion stuff which will
3932 * make sure the ordered extent gets properly cleaned up.
3934 list_for_each_entry(ordered
, &root
->ordered_extents
,
3936 set_bit(BTRFS_ORDERED_IOERR
, &ordered
->flags
);
3937 spin_unlock(&root
->ordered_extent_lock
);
3940 static void btrfs_destroy_all_ordered_extents(struct btrfs_fs_info
*fs_info
)
3942 struct btrfs_root
*root
;
3943 struct list_head splice
;
3945 INIT_LIST_HEAD(&splice
);
3947 spin_lock(&fs_info
->ordered_root_lock
);
3948 list_splice_init(&fs_info
->ordered_roots
, &splice
);
3949 while (!list_empty(&splice
)) {
3950 root
= list_first_entry(&splice
, struct btrfs_root
,
3952 list_move_tail(&root
->ordered_root
,
3953 &fs_info
->ordered_roots
);
3955 spin_unlock(&fs_info
->ordered_root_lock
);
3956 btrfs_destroy_ordered_extents(root
);
3959 spin_lock(&fs_info
->ordered_root_lock
);
3961 spin_unlock(&fs_info
->ordered_root_lock
);
3964 static int btrfs_destroy_delayed_refs(struct btrfs_transaction
*trans
,
3965 struct btrfs_root
*root
)
3967 struct rb_node
*node
;
3968 struct btrfs_delayed_ref_root
*delayed_refs
;
3969 struct btrfs_delayed_ref_node
*ref
;
3972 delayed_refs
= &trans
->delayed_refs
;
3974 spin_lock(&delayed_refs
->lock
);
3975 if (atomic_read(&delayed_refs
->num_entries
) == 0) {
3976 spin_unlock(&delayed_refs
->lock
);
3977 btrfs_info(root
->fs_info
, "delayed_refs has NO entry");
3981 while ((node
= rb_first(&delayed_refs
->href_root
)) != NULL
) {
3982 struct btrfs_delayed_ref_head
*head
;
3983 bool pin_bytes
= false;
3985 head
= rb_entry(node
, struct btrfs_delayed_ref_head
,
3987 if (!mutex_trylock(&head
->mutex
)) {
3988 atomic_inc(&head
->node
.refs
);
3989 spin_unlock(&delayed_refs
->lock
);
3991 mutex_lock(&head
->mutex
);
3992 mutex_unlock(&head
->mutex
);
3993 btrfs_put_delayed_ref(&head
->node
);
3994 spin_lock(&delayed_refs
->lock
);
3997 spin_lock(&head
->lock
);
3998 while ((node
= rb_first(&head
->ref_root
)) != NULL
) {
3999 ref
= rb_entry(node
, struct btrfs_delayed_ref_node
,
4002 rb_erase(&ref
->rb_node
, &head
->ref_root
);
4003 atomic_dec(&delayed_refs
->num_entries
);
4004 btrfs_put_delayed_ref(ref
);
4006 if (head
->must_insert_reserved
)
4008 btrfs_free_delayed_extent_op(head
->extent_op
);
4009 delayed_refs
->num_heads
--;
4010 if (head
->processing
== 0)
4011 delayed_refs
->num_heads_ready
--;
4012 atomic_dec(&delayed_refs
->num_entries
);
4013 head
->node
.in_tree
= 0;
4014 rb_erase(&head
->href_node
, &delayed_refs
->href_root
);
4015 spin_unlock(&head
->lock
);
4016 spin_unlock(&delayed_refs
->lock
);
4017 mutex_unlock(&head
->mutex
);
4020 btrfs_pin_extent(root
, head
->node
.bytenr
,
4021 head
->node
.num_bytes
, 1);
4022 btrfs_put_delayed_ref(&head
->node
);
4024 spin_lock(&delayed_refs
->lock
);
4027 spin_unlock(&delayed_refs
->lock
);
4032 static void btrfs_destroy_delalloc_inodes(struct btrfs_root
*root
)
4034 struct btrfs_inode
*btrfs_inode
;
4035 struct list_head splice
;
4037 INIT_LIST_HEAD(&splice
);
4039 spin_lock(&root
->delalloc_lock
);
4040 list_splice_init(&root
->delalloc_inodes
, &splice
);
4042 while (!list_empty(&splice
)) {
4043 btrfs_inode
= list_first_entry(&splice
, struct btrfs_inode
,
4046 list_del_init(&btrfs_inode
->delalloc_inodes
);
4047 clear_bit(BTRFS_INODE_IN_DELALLOC_LIST
,
4048 &btrfs_inode
->runtime_flags
);
4049 spin_unlock(&root
->delalloc_lock
);
4051 btrfs_invalidate_inodes(btrfs_inode
->root
);
4053 spin_lock(&root
->delalloc_lock
);
4056 spin_unlock(&root
->delalloc_lock
);
4059 static void btrfs_destroy_all_delalloc_inodes(struct btrfs_fs_info
*fs_info
)
4061 struct btrfs_root
*root
;
4062 struct list_head splice
;
4064 INIT_LIST_HEAD(&splice
);
4066 spin_lock(&fs_info
->delalloc_root_lock
);
4067 list_splice_init(&fs_info
->delalloc_roots
, &splice
);
4068 while (!list_empty(&splice
)) {
4069 root
= list_first_entry(&splice
, struct btrfs_root
,
4071 list_del_init(&root
->delalloc_root
);
4072 root
= btrfs_grab_fs_root(root
);
4074 spin_unlock(&fs_info
->delalloc_root_lock
);
4076 btrfs_destroy_delalloc_inodes(root
);
4077 btrfs_put_fs_root(root
);
4079 spin_lock(&fs_info
->delalloc_root_lock
);
4081 spin_unlock(&fs_info
->delalloc_root_lock
);
4084 static int btrfs_destroy_marked_extents(struct btrfs_root
*root
,
4085 struct extent_io_tree
*dirty_pages
,
4089 struct extent_buffer
*eb
;
4094 ret
= find_first_extent_bit(dirty_pages
, start
, &start
, &end
,
4099 clear_extent_bits(dirty_pages
, start
, end
, mark
, GFP_NOFS
);
4100 while (start
<= end
) {
4101 eb
= btrfs_find_tree_block(root
, start
);
4102 start
+= root
->nodesize
;
4105 wait_on_extent_buffer_writeback(eb
);
4107 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY
,
4109 clear_extent_buffer_dirty(eb
);
4110 free_extent_buffer_stale(eb
);
4117 static int btrfs_destroy_pinned_extent(struct btrfs_root
*root
,
4118 struct extent_io_tree
*pinned_extents
)
4120 struct extent_io_tree
*unpin
;
4126 unpin
= pinned_extents
;
4129 ret
= find_first_extent_bit(unpin
, 0, &start
, &end
,
4130 EXTENT_DIRTY
, NULL
);
4134 clear_extent_dirty(unpin
, start
, end
, GFP_NOFS
);
4135 btrfs_error_unpin_extent_range(root
, start
, end
);
4140 if (unpin
== &root
->fs_info
->freed_extents
[0])
4141 unpin
= &root
->fs_info
->freed_extents
[1];
4143 unpin
= &root
->fs_info
->freed_extents
[0];
4151 static void btrfs_free_pending_ordered(struct btrfs_transaction
*cur_trans
,
4152 struct btrfs_fs_info
*fs_info
)
4154 struct btrfs_ordered_extent
*ordered
;
4156 spin_lock(&fs_info
->trans_lock
);
4157 while (!list_empty(&cur_trans
->pending_ordered
)) {
4158 ordered
= list_first_entry(&cur_trans
->pending_ordered
,
4159 struct btrfs_ordered_extent
,
4161 list_del_init(&ordered
->trans_list
);
4162 spin_unlock(&fs_info
->trans_lock
);
4164 btrfs_put_ordered_extent(ordered
);
4165 spin_lock(&fs_info
->trans_lock
);
4167 spin_unlock(&fs_info
->trans_lock
);
4170 void btrfs_cleanup_one_transaction(struct btrfs_transaction
*cur_trans
,
4171 struct btrfs_root
*root
)
4173 btrfs_destroy_delayed_refs(cur_trans
, root
);
4175 cur_trans
->state
= TRANS_STATE_COMMIT_START
;
4176 wake_up(&root
->fs_info
->transaction_blocked_wait
);
4178 cur_trans
->state
= TRANS_STATE_UNBLOCKED
;
4179 wake_up(&root
->fs_info
->transaction_wait
);
4181 btrfs_free_pending_ordered(cur_trans
, root
->fs_info
);
4182 btrfs_destroy_delayed_inodes(root
);
4183 btrfs_assert_delayed_root_empty(root
);
4185 btrfs_destroy_marked_extents(root
, &cur_trans
->dirty_pages
,
4187 btrfs_destroy_pinned_extent(root
,
4188 root
->fs_info
->pinned_extents
);
4190 cur_trans
->state
=TRANS_STATE_COMPLETED
;
4191 wake_up(&cur_trans
->commit_wait
);
4194 memset(cur_trans, 0, sizeof(*cur_trans));
4195 kmem_cache_free(btrfs_transaction_cachep, cur_trans);
4199 static int btrfs_cleanup_transaction(struct btrfs_root
*root
)
4201 struct btrfs_transaction
*t
;
4203 mutex_lock(&root
->fs_info
->transaction_kthread_mutex
);
4205 spin_lock(&root
->fs_info
->trans_lock
);
4206 while (!list_empty(&root
->fs_info
->trans_list
)) {
4207 t
= list_first_entry(&root
->fs_info
->trans_list
,
4208 struct btrfs_transaction
, list
);
4209 if (t
->state
>= TRANS_STATE_COMMIT_START
) {
4210 atomic_inc(&t
->use_count
);
4211 spin_unlock(&root
->fs_info
->trans_lock
);
4212 btrfs_wait_for_commit(root
, t
->transid
);
4213 btrfs_put_transaction(t
);
4214 spin_lock(&root
->fs_info
->trans_lock
);
4217 if (t
== root
->fs_info
->running_transaction
) {
4218 t
->state
= TRANS_STATE_COMMIT_DOING
;
4219 spin_unlock(&root
->fs_info
->trans_lock
);
4221 * We wait for 0 num_writers since we don't hold a trans
4222 * handle open currently for this transaction.
4224 wait_event(t
->writer_wait
,
4225 atomic_read(&t
->num_writers
) == 0);
4227 spin_unlock(&root
->fs_info
->trans_lock
);
4229 btrfs_cleanup_one_transaction(t
, root
);
4231 spin_lock(&root
->fs_info
->trans_lock
);
4232 if (t
== root
->fs_info
->running_transaction
)
4233 root
->fs_info
->running_transaction
= NULL
;
4234 list_del_init(&t
->list
);
4235 spin_unlock(&root
->fs_info
->trans_lock
);
4237 btrfs_put_transaction(t
);
4238 trace_btrfs_transaction_commit(root
);
4239 spin_lock(&root
->fs_info
->trans_lock
);
4241 spin_unlock(&root
->fs_info
->trans_lock
);
4242 btrfs_destroy_all_ordered_extents(root
->fs_info
);
4243 btrfs_destroy_delayed_inodes(root
);
4244 btrfs_assert_delayed_root_empty(root
);
4245 btrfs_destroy_pinned_extent(root
, root
->fs_info
->pinned_extents
);
4246 btrfs_destroy_all_delalloc_inodes(root
->fs_info
);
4247 mutex_unlock(&root
->fs_info
->transaction_kthread_mutex
);
4252 static struct extent_io_ops btree_extent_io_ops
= {
4253 .readpage_end_io_hook
= btree_readpage_end_io_hook
,
4254 .readpage_io_failed_hook
= btree_io_failed_hook
,
4255 .submit_bio_hook
= btree_submit_bio_hook
,
4256 /* note we're sharing with inode.c for the merge bio hook */
4257 .merge_bio_hook
= btrfs_merge_bio_hook
,