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, u32 blocksize)
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, blocksize);
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, u32 blocksize,
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, blocksize);
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,
1128 u64 bytenr, u32 blocksize)
1130 if (btrfs_test_is_dummy_root(root))
1131 return alloc_test_extent_buffer(root->fs_info, bytenr,
1133 return alloc_extent_buffer(root->fs_info, bytenr, blocksize);
1137 int btrfs_write_tree_block(struct extent_buffer *buf)
1139 return filemap_fdatawrite_range(buf->pages[0]->mapping, buf->start,
1140 buf->start + buf->len - 1);
1143 int btrfs_wait_tree_block_writeback(struct extent_buffer *buf)
1145 return filemap_fdatawait_range(buf->pages[0]->mapping,
1146 buf->start, buf->start + buf->len - 1);
1149 struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr,
1152 struct extent_buffer *buf = NULL;
1155 buf = btrfs_find_create_tree_block(root, bytenr, root->nodesize);
1159 ret = btree_read_extent_buffer_pages(root, buf, 0, parent_transid);
1161 free_extent_buffer(buf);
1168 void clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
1169 struct extent_buffer *buf)
1171 struct btrfs_fs_info *fs_info = root->fs_info;
1173 if (btrfs_header_generation(buf) ==
1174 fs_info->running_transaction->transid) {
1175 btrfs_assert_tree_locked(buf);
1177 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, &buf->bflags)) {
1178 __percpu_counter_add(&fs_info->dirty_metadata_bytes,
1180 fs_info->dirty_metadata_batch);
1181 /* ugh, clear_extent_buffer_dirty needs to lock the page */
1182 btrfs_set_lock_blocking(buf);
1183 clear_extent_buffer_dirty(buf);
1188 static struct btrfs_subvolume_writers *btrfs_alloc_subvolume_writers(void)
1190 struct btrfs_subvolume_writers *writers;
1193 writers = kmalloc(sizeof(*writers), GFP_NOFS);
1195 return ERR_PTR(-ENOMEM);
1197 ret = percpu_counter_init(&writers->counter, 0, GFP_KERNEL);
1200 return ERR_PTR(ret);
1203 init_waitqueue_head(&writers->wait);
1208 btrfs_free_subvolume_writers(struct btrfs_subvolume_writers *writers)
1210 percpu_counter_destroy(&writers->counter);
1214 static void __setup_root(u32 nodesize, u32 sectorsize, u32 stripesize,
1215 struct btrfs_root *root, struct btrfs_fs_info *fs_info,
1219 root->commit_root = NULL;
1220 root->sectorsize = sectorsize;
1221 root->nodesize = nodesize;
1222 root->stripesize = stripesize;
1224 root->orphan_cleanup_state = 0;
1226 root->objectid = objectid;
1227 root->last_trans = 0;
1228 root->highest_objectid = 0;
1229 root->nr_delalloc_inodes = 0;
1230 root->nr_ordered_extents = 0;
1232 root->inode_tree = RB_ROOT;
1233 INIT_RADIX_TREE(&root->delayed_nodes_tree, GFP_ATOMIC);
1234 root->block_rsv = NULL;
1235 root->orphan_block_rsv = NULL;
1237 INIT_LIST_HEAD(&root->dirty_list);
1238 INIT_LIST_HEAD(&root->root_list);
1239 INIT_LIST_HEAD(&root->delalloc_inodes);
1240 INIT_LIST_HEAD(&root->delalloc_root);
1241 INIT_LIST_HEAD(&root->ordered_extents);
1242 INIT_LIST_HEAD(&root->ordered_root);
1243 INIT_LIST_HEAD(&root->logged_list[0]);
1244 INIT_LIST_HEAD(&root->logged_list[1]);
1245 spin_lock_init(&root->orphan_lock);
1246 spin_lock_init(&root->inode_lock);
1247 spin_lock_init(&root->delalloc_lock);
1248 spin_lock_init(&root->ordered_extent_lock);
1249 spin_lock_init(&root->accounting_lock);
1250 spin_lock_init(&root->log_extents_lock[0]);
1251 spin_lock_init(&root->log_extents_lock[1]);
1252 mutex_init(&root->objectid_mutex);
1253 mutex_init(&root->log_mutex);
1254 mutex_init(&root->ordered_extent_mutex);
1255 mutex_init(&root->delalloc_mutex);
1256 init_waitqueue_head(&root->log_writer_wait);
1257 init_waitqueue_head(&root->log_commit_wait[0]);
1258 init_waitqueue_head(&root->log_commit_wait[1]);
1259 INIT_LIST_HEAD(&root->log_ctxs[0]);
1260 INIT_LIST_HEAD(&root->log_ctxs[1]);
1261 atomic_set(&root->log_commit[0], 0);
1262 atomic_set(&root->log_commit[1], 0);
1263 atomic_set(&root->log_writers, 0);
1264 atomic_set(&root->log_batch, 0);
1265 atomic_set(&root->orphan_inodes, 0);
1266 atomic_set(&root->refs, 1);
1267 atomic_set(&root->will_be_snapshoted, 0);
1268 root->log_transid = 0;
1269 root->log_transid_committed = -1;
1270 root->last_log_commit = 0;
1272 extent_io_tree_init(&root->dirty_log_pages,
1273 fs_info->btree_inode->i_mapping);
1275 memset(&root->root_key, 0, sizeof(root->root_key));
1276 memset(&root->root_item, 0, sizeof(root->root_item));
1277 memset(&root->defrag_progress, 0, sizeof(root->defrag_progress));
1278 memset(&root->root_kobj, 0, sizeof(root->root_kobj));
1280 root->defrag_trans_start = fs_info->generation;
1282 root->defrag_trans_start = 0;
1283 init_completion(&root->kobj_unregister);
1284 root->root_key.objectid = objectid;
1287 spin_lock_init(&root->root_item_lock);
1290 static struct btrfs_root *btrfs_alloc_root(struct btrfs_fs_info *fs_info)
1292 struct btrfs_root *root = kzalloc(sizeof(*root), GFP_NOFS);
1294 root->fs_info = fs_info;
1298 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
1299 /* Should only be used by the testing infrastructure */
1300 struct btrfs_root *btrfs_alloc_dummy_root(void)
1302 struct btrfs_root *root;
1304 root = btrfs_alloc_root(NULL);
1306 return ERR_PTR(-ENOMEM);
1307 __setup_root(4096, 4096, 4096, root, NULL, 1);
1308 set_bit(BTRFS_ROOT_DUMMY_ROOT, &root->state);
1309 root->alloc_bytenr = 0;
1315 struct btrfs_root *btrfs_create_tree(struct btrfs_trans_handle *trans,
1316 struct btrfs_fs_info *fs_info,
1319 struct extent_buffer *leaf;
1320 struct btrfs_root *tree_root = fs_info->tree_root;
1321 struct btrfs_root *root;
1322 struct btrfs_key key;
1326 root = btrfs_alloc_root(fs_info);
1328 return ERR_PTR(-ENOMEM);
1330 __setup_root(tree_root->nodesize, tree_root->sectorsize,
1331 tree_root->stripesize, root, fs_info, objectid);
1332 root->root_key.objectid = objectid;
1333 root->root_key.type = BTRFS_ROOT_ITEM_KEY;
1334 root->root_key.offset = 0;
1336 leaf = btrfs_alloc_tree_block(trans, root, 0, objectid, NULL, 0, 0, 0);
1338 ret = PTR_ERR(leaf);
1343 memset_extent_buffer(leaf, 0, 0, sizeof(struct btrfs_header));
1344 btrfs_set_header_bytenr(leaf, leaf->start);
1345 btrfs_set_header_generation(leaf, trans->transid);
1346 btrfs_set_header_backref_rev(leaf, BTRFS_MIXED_BACKREF_REV);
1347 btrfs_set_header_owner(leaf, objectid);
1350 write_extent_buffer(leaf, fs_info->fsid, btrfs_header_fsid(),
1352 write_extent_buffer(leaf, fs_info->chunk_tree_uuid,
1353 btrfs_header_chunk_tree_uuid(leaf),
1355 btrfs_mark_buffer_dirty(leaf);
1357 root->commit_root = btrfs_root_node(root);
1358 set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state);
1360 root->root_item.flags = 0;
1361 root->root_item.byte_limit = 0;
1362 btrfs_set_root_bytenr(&root->root_item, leaf->start);
1363 btrfs_set_root_generation(&root->root_item, trans->transid);
1364 btrfs_set_root_level(&root->root_item, 0);
1365 btrfs_set_root_refs(&root->root_item, 1);
1366 btrfs_set_root_used(&root->root_item, leaf->len);
1367 btrfs_set_root_last_snapshot(&root->root_item, 0);
1368 btrfs_set_root_dirid(&root->root_item, 0);
1370 memcpy(root->root_item.uuid, uuid.b, BTRFS_UUID_SIZE);
1371 root->root_item.drop_level = 0;
1373 key.objectid = objectid;
1374 key.type = BTRFS_ROOT_ITEM_KEY;
1376 ret = btrfs_insert_root(trans, tree_root, &key, &root->root_item);
1380 btrfs_tree_unlock(leaf);
1386 btrfs_tree_unlock(leaf);
1387 free_extent_buffer(root->commit_root);
1388 free_extent_buffer(leaf);
1392 return ERR_PTR(ret);
1395 static struct btrfs_root *alloc_log_tree(struct btrfs_trans_handle *trans,
1396 struct btrfs_fs_info *fs_info)
1398 struct btrfs_root *root;
1399 struct btrfs_root *tree_root = fs_info->tree_root;
1400 struct extent_buffer *leaf;
1402 root = btrfs_alloc_root(fs_info);
1404 return ERR_PTR(-ENOMEM);
1406 __setup_root(tree_root->nodesize, tree_root->sectorsize,
1407 tree_root->stripesize, root, fs_info,
1408 BTRFS_TREE_LOG_OBJECTID);
1410 root->root_key.objectid = BTRFS_TREE_LOG_OBJECTID;
1411 root->root_key.type = BTRFS_ROOT_ITEM_KEY;
1412 root->root_key.offset = BTRFS_TREE_LOG_OBJECTID;
1415 * DON'T set REF_COWS for log trees
1417 * log trees do not get reference counted because they go away
1418 * before a real commit is actually done. They do store pointers
1419 * to file data extents, and those reference counts still get
1420 * updated (along with back refs to the log tree).
1423 leaf = btrfs_alloc_tree_block(trans, root, 0, BTRFS_TREE_LOG_OBJECTID,
1427 return ERR_CAST(leaf);
1430 memset_extent_buffer(leaf, 0, 0, sizeof(struct btrfs_header));
1431 btrfs_set_header_bytenr(leaf, leaf->start);
1432 btrfs_set_header_generation(leaf, trans->transid);
1433 btrfs_set_header_backref_rev(leaf, BTRFS_MIXED_BACKREF_REV);
1434 btrfs_set_header_owner(leaf, BTRFS_TREE_LOG_OBJECTID);
1437 write_extent_buffer(root->node, root->fs_info->fsid,
1438 btrfs_header_fsid(), BTRFS_FSID_SIZE);
1439 btrfs_mark_buffer_dirty(root->node);
1440 btrfs_tree_unlock(root->node);
1444 int btrfs_init_log_root_tree(struct btrfs_trans_handle *trans,
1445 struct btrfs_fs_info *fs_info)
1447 struct btrfs_root *log_root;
1449 log_root = alloc_log_tree(trans, fs_info);
1450 if (IS_ERR(log_root))
1451 return PTR_ERR(log_root);
1452 WARN_ON(fs_info->log_root_tree);
1453 fs_info->log_root_tree = log_root;
1457 int btrfs_add_log_tree(struct btrfs_trans_handle *trans,
1458 struct btrfs_root *root)
1460 struct btrfs_root *log_root;
1461 struct btrfs_inode_item *inode_item;
1463 log_root = alloc_log_tree(trans, root->fs_info);
1464 if (IS_ERR(log_root))
1465 return PTR_ERR(log_root);
1467 log_root->last_trans = trans->transid;
1468 log_root->root_key.offset = root->root_key.objectid;
1470 inode_item = &log_root->root_item.inode;
1471 btrfs_set_stack_inode_generation(inode_item, 1);
1472 btrfs_set_stack_inode_size(inode_item, 3);
1473 btrfs_set_stack_inode_nlink(inode_item, 1);
1474 btrfs_set_stack_inode_nbytes(inode_item, root->nodesize);
1475 btrfs_set_stack_inode_mode(inode_item, S_IFDIR | 0755);
1477 btrfs_set_root_node(&log_root->root_item, log_root->node);
1479 WARN_ON(root->log_root);
1480 root->log_root = log_root;
1481 root->log_transid = 0;
1482 root->log_transid_committed = -1;
1483 root->last_log_commit = 0;
1487 static struct btrfs_root *btrfs_read_tree_root(struct btrfs_root *tree_root,
1488 struct btrfs_key *key)
1490 struct btrfs_root *root;
1491 struct btrfs_fs_info *fs_info = tree_root->fs_info;
1492 struct btrfs_path *path;
1496 path = btrfs_alloc_path();
1498 return ERR_PTR(-ENOMEM);
1500 root = btrfs_alloc_root(fs_info);
1506 __setup_root(tree_root->nodesize, tree_root->sectorsize,
1507 tree_root->stripesize, root, fs_info, key->objectid);
1509 ret = btrfs_find_root(tree_root, key, path,
1510 &root->root_item, &root->root_key);
1517 generation = btrfs_root_generation(&root->root_item);
1518 root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
1523 } else if (!btrfs_buffer_uptodate(root->node, generation, 0)) {
1527 root->commit_root = btrfs_root_node(root);
1529 btrfs_free_path(path);
1533 free_extent_buffer(root->node);
1537 root = ERR_PTR(ret);
1541 struct btrfs_root *btrfs_read_fs_root(struct btrfs_root *tree_root,
1542 struct btrfs_key *location)
1544 struct btrfs_root *root;
1546 root = btrfs_read_tree_root(tree_root, location);
1550 if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) {
1551 set_bit(BTRFS_ROOT_REF_COWS, &root->state);
1552 btrfs_check_and_init_root_item(&root->root_item);
1558 int btrfs_init_fs_root(struct btrfs_root *root)
1561 struct btrfs_subvolume_writers *writers;
1563 root->free_ino_ctl = kzalloc(sizeof(*root->free_ino_ctl), GFP_NOFS);
1564 root->free_ino_pinned = kzalloc(sizeof(*root->free_ino_pinned),
1566 if (!root->free_ino_pinned || !root->free_ino_ctl) {
1571 writers = btrfs_alloc_subvolume_writers();
1572 if (IS_ERR(writers)) {
1573 ret = PTR_ERR(writers);
1576 root->subv_writers = writers;
1578 btrfs_init_free_ino_ctl(root);
1579 spin_lock_init(&root->ino_cache_lock);
1580 init_waitqueue_head(&root->ino_cache_wait);
1582 ret = get_anon_bdev(&root->anon_dev);
1588 btrfs_free_subvolume_writers(root->subv_writers);
1590 kfree(root->free_ino_ctl);
1591 kfree(root->free_ino_pinned);
1595 static struct btrfs_root *btrfs_lookup_fs_root(struct btrfs_fs_info *fs_info,
1598 struct btrfs_root *root;
1600 spin_lock(&fs_info->fs_roots_radix_lock);
1601 root = radix_tree_lookup(&fs_info->fs_roots_radix,
1602 (unsigned long)root_id);
1603 spin_unlock(&fs_info->fs_roots_radix_lock);
1607 int btrfs_insert_fs_root(struct btrfs_fs_info *fs_info,
1608 struct btrfs_root *root)
1612 ret = radix_tree_preload(GFP_NOFS & ~__GFP_HIGHMEM);
1616 spin_lock(&fs_info->fs_roots_radix_lock);
1617 ret = radix_tree_insert(&fs_info->fs_roots_radix,
1618 (unsigned long)root->root_key.objectid,
1621 set_bit(BTRFS_ROOT_IN_RADIX, &root->state);
1622 spin_unlock(&fs_info->fs_roots_radix_lock);
1623 radix_tree_preload_end();
1628 struct btrfs_root *btrfs_get_fs_root(struct btrfs_fs_info *fs_info,
1629 struct btrfs_key *location,
1632 struct btrfs_root *root;
1635 if (location->objectid == BTRFS_ROOT_TREE_OBJECTID)
1636 return fs_info->tree_root;
1637 if (location->objectid == BTRFS_EXTENT_TREE_OBJECTID)
1638 return fs_info->extent_root;
1639 if (location->objectid == BTRFS_CHUNK_TREE_OBJECTID)
1640 return fs_info->chunk_root;
1641 if (location->objectid == BTRFS_DEV_TREE_OBJECTID)
1642 return fs_info->dev_root;
1643 if (location->objectid == BTRFS_CSUM_TREE_OBJECTID)
1644 return fs_info->csum_root;
1645 if (location->objectid == BTRFS_QUOTA_TREE_OBJECTID)
1646 return fs_info->quota_root ? fs_info->quota_root :
1648 if (location->objectid == BTRFS_UUID_TREE_OBJECTID)
1649 return fs_info->uuid_root ? fs_info->uuid_root :
1652 root = btrfs_lookup_fs_root(fs_info, location->objectid);
1654 if (check_ref && btrfs_root_refs(&root->root_item) == 0)
1655 return ERR_PTR(-ENOENT);
1659 root = btrfs_read_fs_root(fs_info->tree_root, location);
1663 if (check_ref && btrfs_root_refs(&root->root_item) == 0) {
1668 ret = btrfs_init_fs_root(root);
1672 ret = btrfs_find_item(fs_info->tree_root, NULL, BTRFS_ORPHAN_OBJECTID,
1673 location->objectid, BTRFS_ORPHAN_ITEM_KEY, NULL);
1677 set_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state);
1679 ret = btrfs_insert_fs_root(fs_info, root);
1681 if (ret == -EEXIST) {
1690 return ERR_PTR(ret);
1693 static int btrfs_congested_fn(void *congested_data, int bdi_bits)
1695 struct btrfs_fs_info *info = (struct btrfs_fs_info *)congested_data;
1697 struct btrfs_device *device;
1698 struct backing_dev_info *bdi;
1701 list_for_each_entry_rcu(device, &info->fs_devices->devices, dev_list) {
1704 bdi = blk_get_backing_dev_info(device->bdev);
1705 if (bdi_congested(bdi, bdi_bits)) {
1714 static int setup_bdi(struct btrfs_fs_info *info, struct backing_dev_info *bdi)
1718 err = bdi_setup_and_register(bdi, "btrfs");
1722 bdi->ra_pages = VM_MAX_READAHEAD * 1024 / PAGE_CACHE_SIZE;
1723 bdi->congested_fn = btrfs_congested_fn;
1724 bdi->congested_data = info;
1729 * called by the kthread helper functions to finally call the bio end_io
1730 * functions. This is where read checksum verification actually happens
1732 static void end_workqueue_fn(struct btrfs_work *work)
1735 struct btrfs_end_io_wq *end_io_wq;
1738 end_io_wq = container_of(work, struct btrfs_end_io_wq, work);
1739 bio = end_io_wq->bio;
1741 error = end_io_wq->error;
1742 bio->bi_private = end_io_wq->private;
1743 bio->bi_end_io = end_io_wq->end_io;
1744 kmem_cache_free(btrfs_end_io_wq_cache, end_io_wq);
1745 bio_endio_nodec(bio, error);
1748 static int cleaner_kthread(void *arg)
1750 struct btrfs_root *root = arg;
1756 /* Make the cleaner go to sleep early. */
1757 if (btrfs_need_cleaner_sleep(root))
1760 if (!mutex_trylock(&root->fs_info->cleaner_mutex))
1764 * Avoid the problem that we change the status of the fs
1765 * during the above check and trylock.
1767 if (btrfs_need_cleaner_sleep(root)) {
1768 mutex_unlock(&root->fs_info->cleaner_mutex);
1772 btrfs_run_delayed_iputs(root);
1773 btrfs_delete_unused_bgs(root->fs_info);
1774 again = btrfs_clean_one_deleted_snapshot(root);
1775 mutex_unlock(&root->fs_info->cleaner_mutex);
1778 * The defragger has dealt with the R/O remount and umount,
1779 * needn't do anything special here.
1781 btrfs_run_defrag_inodes(root->fs_info);
1783 if (!try_to_freeze() && !again) {
1784 set_current_state(TASK_INTERRUPTIBLE);
1785 if (!kthread_should_stop())
1787 __set_current_state(TASK_RUNNING);
1789 } while (!kthread_should_stop());
1793 static int transaction_kthread(void *arg)
1795 struct btrfs_root *root = arg;
1796 struct btrfs_trans_handle *trans;
1797 struct btrfs_transaction *cur;
1800 unsigned long delay;
1804 cannot_commit = false;
1805 delay = HZ * root->fs_info->commit_interval;
1806 mutex_lock(&root->fs_info->transaction_kthread_mutex);
1808 spin_lock(&root->fs_info->trans_lock);
1809 cur = root->fs_info->running_transaction;
1811 spin_unlock(&root->fs_info->trans_lock);
1815 now = get_seconds();
1816 if (cur->state < TRANS_STATE_BLOCKED &&
1817 (now < cur->start_time ||
1818 now - cur->start_time < root->fs_info->commit_interval)) {
1819 spin_unlock(&root->fs_info->trans_lock);
1823 transid = cur->transid;
1824 spin_unlock(&root->fs_info->trans_lock);
1826 /* If the file system is aborted, this will always fail. */
1827 trans = btrfs_attach_transaction(root);
1828 if (IS_ERR(trans)) {
1829 if (PTR_ERR(trans) != -ENOENT)
1830 cannot_commit = true;
1833 if (transid == trans->transid) {
1834 btrfs_commit_transaction(trans, root);
1836 btrfs_end_transaction(trans, root);
1839 wake_up_process(root->fs_info->cleaner_kthread);
1840 mutex_unlock(&root->fs_info->transaction_kthread_mutex);
1842 if (unlikely(test_bit(BTRFS_FS_STATE_ERROR,
1843 &root->fs_info->fs_state)))
1844 btrfs_cleanup_transaction(root);
1845 if (!try_to_freeze()) {
1846 set_current_state(TASK_INTERRUPTIBLE);
1847 if (!kthread_should_stop() &&
1848 (!btrfs_transaction_blocked(root->fs_info) ||
1850 schedule_timeout(delay);
1851 __set_current_state(TASK_RUNNING);
1853 } while (!kthread_should_stop());
1858 * this will find the highest generation in the array of
1859 * root backups. The index of the highest array is returned,
1860 * or -1 if we can't find anything.
1862 * We check to make sure the array is valid by comparing the
1863 * generation of the latest root in the array with the generation
1864 * in the super block. If they don't match we pitch it.
1866 static int find_newest_super_backup(struct btrfs_fs_info *info, u64 newest_gen)
1869 int newest_index = -1;
1870 struct btrfs_root_backup *root_backup;
1873 for (i = 0; i < BTRFS_NUM_BACKUP_ROOTS; i++) {
1874 root_backup = info->super_copy->super_roots + i;
1875 cur = btrfs_backup_tree_root_gen(root_backup);
1876 if (cur == newest_gen)
1880 /* check to see if we actually wrapped around */
1881 if (newest_index == BTRFS_NUM_BACKUP_ROOTS - 1) {
1882 root_backup = info->super_copy->super_roots;
1883 cur = btrfs_backup_tree_root_gen(root_backup);
1884 if (cur == newest_gen)
1887 return newest_index;
1892 * find the oldest backup so we know where to store new entries
1893 * in the backup array. This will set the backup_root_index
1894 * field in the fs_info struct
1896 static void find_oldest_super_backup(struct btrfs_fs_info *info,
1899 int newest_index = -1;
1901 newest_index = find_newest_super_backup(info, newest_gen);
1902 /* if there was garbage in there, just move along */
1903 if (newest_index == -1) {
1904 info->backup_root_index = 0;
1906 info->backup_root_index = (newest_index + 1) % BTRFS_NUM_BACKUP_ROOTS;
1911 * copy all the root pointers into the super backup array.
1912 * this will bump the backup pointer by one when it is
1915 static void backup_super_roots(struct btrfs_fs_info *info)
1918 struct btrfs_root_backup *root_backup;
1921 next_backup = info->backup_root_index;
1922 last_backup = (next_backup + BTRFS_NUM_BACKUP_ROOTS - 1) %
1923 BTRFS_NUM_BACKUP_ROOTS;
1926 * just overwrite the last backup if we're at the same generation
1927 * this happens only at umount
1929 root_backup = info->super_for_commit->super_roots + last_backup;
1930 if (btrfs_backup_tree_root_gen(root_backup) ==
1931 btrfs_header_generation(info->tree_root->node))
1932 next_backup = last_backup;
1934 root_backup = info->super_for_commit->super_roots + next_backup;
1937 * make sure all of our padding and empty slots get zero filled
1938 * regardless of which ones we use today
1940 memset(root_backup, 0, sizeof(*root_backup));
1942 info->backup_root_index = (next_backup + 1) % BTRFS_NUM_BACKUP_ROOTS;
1944 btrfs_set_backup_tree_root(root_backup, info->tree_root->node->start);
1945 btrfs_set_backup_tree_root_gen(root_backup,
1946 btrfs_header_generation(info->tree_root->node));
1948 btrfs_set_backup_tree_root_level(root_backup,
1949 btrfs_header_level(info->tree_root->node));
1951 btrfs_set_backup_chunk_root(root_backup, info->chunk_root->node->start);
1952 btrfs_set_backup_chunk_root_gen(root_backup,
1953 btrfs_header_generation(info->chunk_root->node));
1954 btrfs_set_backup_chunk_root_level(root_backup,
1955 btrfs_header_level(info->chunk_root->node));
1957 btrfs_set_backup_extent_root(root_backup, info->extent_root->node->start);
1958 btrfs_set_backup_extent_root_gen(root_backup,
1959 btrfs_header_generation(info->extent_root->node));
1960 btrfs_set_backup_extent_root_level(root_backup,
1961 btrfs_header_level(info->extent_root->node));
1964 * we might commit during log recovery, which happens before we set
1965 * the fs_root. Make sure it is valid before we fill it in.
1967 if (info->fs_root && info->fs_root->node) {
1968 btrfs_set_backup_fs_root(root_backup,
1969 info->fs_root->node->start);
1970 btrfs_set_backup_fs_root_gen(root_backup,
1971 btrfs_header_generation(info->fs_root->node));
1972 btrfs_set_backup_fs_root_level(root_backup,
1973 btrfs_header_level(info->fs_root->node));
1976 btrfs_set_backup_dev_root(root_backup, info->dev_root->node->start);
1977 btrfs_set_backup_dev_root_gen(root_backup,
1978 btrfs_header_generation(info->dev_root->node));
1979 btrfs_set_backup_dev_root_level(root_backup,
1980 btrfs_header_level(info->dev_root->node));
1982 btrfs_set_backup_csum_root(root_backup, info->csum_root->node->start);
1983 btrfs_set_backup_csum_root_gen(root_backup,
1984 btrfs_header_generation(info->csum_root->node));
1985 btrfs_set_backup_csum_root_level(root_backup,
1986 btrfs_header_level(info->csum_root->node));
1988 btrfs_set_backup_total_bytes(root_backup,
1989 btrfs_super_total_bytes(info->super_copy));
1990 btrfs_set_backup_bytes_used(root_backup,
1991 btrfs_super_bytes_used(info->super_copy));
1992 btrfs_set_backup_num_devices(root_backup,
1993 btrfs_super_num_devices(info->super_copy));
1996 * if we don't copy this out to the super_copy, it won't get remembered
1997 * for the next commit
1999 memcpy(&info->super_copy->super_roots,
2000 &info->super_for_commit->super_roots,
2001 sizeof(*root_backup) * BTRFS_NUM_BACKUP_ROOTS);
2005 * this copies info out of the root backup array and back into
2006 * the in-memory super block. It is meant to help iterate through
2007 * the array, so you send it the number of backups you've already
2008 * tried and the last backup index you used.
2010 * this returns -1 when it has tried all the backups
2012 static noinline int next_root_backup(struct btrfs_fs_info *info,
2013 struct btrfs_super_block *super,
2014 int *num_backups_tried, int *backup_index)
2016 struct btrfs_root_backup *root_backup;
2017 int newest = *backup_index;
2019 if (*num_backups_tried == 0) {
2020 u64 gen = btrfs_super_generation(super);
2022 newest = find_newest_super_backup(info, gen);
2026 *backup_index = newest;
2027 *num_backups_tried = 1;
2028 } else if (*num_backups_tried == BTRFS_NUM_BACKUP_ROOTS) {
2029 /* we've tried all the backups, all done */
2032 /* jump to the next oldest backup */
2033 newest = (*backup_index + BTRFS_NUM_BACKUP_ROOTS - 1) %
2034 BTRFS_NUM_BACKUP_ROOTS;
2035 *backup_index = newest;
2036 *num_backups_tried += 1;
2038 root_backup = super->super_roots + newest;
2040 btrfs_set_super_generation(super,
2041 btrfs_backup_tree_root_gen(root_backup));
2042 btrfs_set_super_root(super, btrfs_backup_tree_root(root_backup));
2043 btrfs_set_super_root_level(super,
2044 btrfs_backup_tree_root_level(root_backup));
2045 btrfs_set_super_bytes_used(super, btrfs_backup_bytes_used(root_backup));
2048 * fixme: the total bytes and num_devices need to match or we should
2051 btrfs_set_super_total_bytes(super, btrfs_backup_total_bytes(root_backup));
2052 btrfs_set_super_num_devices(super, btrfs_backup_num_devices(root_backup));
2056 /* helper to cleanup workers */
2057 static void btrfs_stop_all_workers(struct btrfs_fs_info *fs_info)
2059 btrfs_destroy_workqueue(fs_info->fixup_workers);
2060 btrfs_destroy_workqueue(fs_info->delalloc_workers);
2061 btrfs_destroy_workqueue(fs_info->workers);
2062 btrfs_destroy_workqueue(fs_info->endio_workers);
2063 btrfs_destroy_workqueue(fs_info->endio_meta_workers);
2064 btrfs_destroy_workqueue(fs_info->endio_raid56_workers);
2065 btrfs_destroy_workqueue(fs_info->endio_repair_workers);
2066 btrfs_destroy_workqueue(fs_info->rmw_workers);
2067 btrfs_destroy_workqueue(fs_info->endio_meta_write_workers);
2068 btrfs_destroy_workqueue(fs_info->endio_write_workers);
2069 btrfs_destroy_workqueue(fs_info->endio_freespace_worker);
2070 btrfs_destroy_workqueue(fs_info->submit_workers);
2071 btrfs_destroy_workqueue(fs_info->delayed_workers);
2072 btrfs_destroy_workqueue(fs_info->caching_workers);
2073 btrfs_destroy_workqueue(fs_info->readahead_workers);
2074 btrfs_destroy_workqueue(fs_info->flush_workers);
2075 btrfs_destroy_workqueue(fs_info->qgroup_rescan_workers);
2076 btrfs_destroy_workqueue(fs_info->extent_workers);
2079 static void free_root_extent_buffers(struct btrfs_root *root)
2082 free_extent_buffer(root->node);
2083 free_extent_buffer(root->commit_root);
2085 root->commit_root = NULL;
2089 /* helper to cleanup tree roots */
2090 static void free_root_pointers(struct btrfs_fs_info *info, int chunk_root)
2092 free_root_extent_buffers(info->tree_root);
2094 free_root_extent_buffers(info->dev_root);
2095 free_root_extent_buffers(info->extent_root);
2096 free_root_extent_buffers(info->csum_root);
2097 free_root_extent_buffers(info->quota_root);
2098 free_root_extent_buffers(info->uuid_root);
2100 free_root_extent_buffers(info->chunk_root);
2103 void btrfs_free_fs_roots(struct btrfs_fs_info *fs_info)
2106 struct btrfs_root *gang[8];
2109 while (!list_empty(&fs_info->dead_roots)) {
2110 gang[0] = list_entry(fs_info->dead_roots.next,
2111 struct btrfs_root, root_list);
2112 list_del(&gang[0]->root_list);
2114 if (test_bit(BTRFS_ROOT_IN_RADIX, &gang[0]->state)) {
2115 btrfs_drop_and_free_fs_root(fs_info, gang[0]);
2117 free_extent_buffer(gang[0]->node);
2118 free_extent_buffer(gang[0]->commit_root);
2119 btrfs_put_fs_root(gang[0]);
2124 ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
2129 for (i = 0; i < ret; i++)
2130 btrfs_drop_and_free_fs_root(fs_info, gang[i]);
2133 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) {
2134 btrfs_free_log_root_tree(NULL, fs_info);
2135 btrfs_destroy_pinned_extent(fs_info->tree_root,
2136 fs_info->pinned_extents);
2140 int open_ctree(struct super_block *sb,
2141 struct btrfs_fs_devices *fs_devices,
2149 struct btrfs_key location;
2150 struct buffer_head *bh;
2151 struct btrfs_super_block *disk_super;
2152 struct btrfs_fs_info *fs_info = btrfs_sb(sb);
2153 struct btrfs_root *tree_root;
2154 struct btrfs_root *extent_root;
2155 struct btrfs_root *csum_root;
2156 struct btrfs_root *chunk_root;
2157 struct btrfs_root *dev_root;
2158 struct btrfs_root *quota_root;
2159 struct btrfs_root *uuid_root;
2160 struct btrfs_root *log_tree_root;
2163 int num_backups_tried = 0;
2164 int backup_index = 0;
2166 int flags = WQ_MEM_RECLAIM | WQ_FREEZABLE | WQ_UNBOUND;
2167 bool create_uuid_tree;
2168 bool check_uuid_tree;
2170 tree_root = fs_info->tree_root = btrfs_alloc_root(fs_info);
2171 chunk_root = fs_info->chunk_root = btrfs_alloc_root(fs_info);
2172 if (!tree_root || !chunk_root) {
2177 ret = init_srcu_struct(&fs_info->subvol_srcu);
2183 ret = setup_bdi(fs_info, &fs_info->bdi);
2189 ret = percpu_counter_init(&fs_info->dirty_metadata_bytes, 0, GFP_KERNEL);
2194 fs_info->dirty_metadata_batch = PAGE_CACHE_SIZE *
2195 (1 + ilog2(nr_cpu_ids));
2197 ret = percpu_counter_init(&fs_info->delalloc_bytes, 0, GFP_KERNEL);
2200 goto fail_dirty_metadata_bytes;
2203 ret = percpu_counter_init(&fs_info->bio_counter, 0, GFP_KERNEL);
2206 goto fail_delalloc_bytes;
2209 fs_info->btree_inode = new_inode(sb);
2210 if (!fs_info->btree_inode) {
2212 goto fail_bio_counter;
2215 mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS);
2217 INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_ATOMIC);
2218 INIT_RADIX_TREE(&fs_info->buffer_radix, GFP_ATOMIC);
2219 INIT_LIST_HEAD(&fs_info->trans_list);
2220 INIT_LIST_HEAD(&fs_info->dead_roots);
2221 INIT_LIST_HEAD(&fs_info->delayed_iputs);
2222 INIT_LIST_HEAD(&fs_info->delalloc_roots);
2223 INIT_LIST_HEAD(&fs_info->caching_block_groups);
2224 spin_lock_init(&fs_info->delalloc_root_lock);
2225 spin_lock_init(&fs_info->trans_lock);
2226 spin_lock_init(&fs_info->fs_roots_radix_lock);
2227 spin_lock_init(&fs_info->delayed_iput_lock);
2228 spin_lock_init(&fs_info->defrag_inodes_lock);
2229 spin_lock_init(&fs_info->free_chunk_lock);
2230 spin_lock_init(&fs_info->tree_mod_seq_lock);
2231 spin_lock_init(&fs_info->super_lock);
2232 spin_lock_init(&fs_info->qgroup_op_lock);
2233 spin_lock_init(&fs_info->buffer_lock);
2234 spin_lock_init(&fs_info->unused_bgs_lock);
2235 rwlock_init(&fs_info->tree_mod_log_lock);
2236 mutex_init(&fs_info->reloc_mutex);
2237 mutex_init(&fs_info->delalloc_root_mutex);
2238 seqlock_init(&fs_info->profiles_lock);
2240 init_completion(&fs_info->kobj_unregister);
2241 INIT_LIST_HEAD(&fs_info->dirty_cowonly_roots);
2242 INIT_LIST_HEAD(&fs_info->space_info);
2243 INIT_LIST_HEAD(&fs_info->tree_mod_seq_list);
2244 INIT_LIST_HEAD(&fs_info->unused_bgs);
2245 btrfs_mapping_init(&fs_info->mapping_tree);
2246 btrfs_init_block_rsv(&fs_info->global_block_rsv,
2247 BTRFS_BLOCK_RSV_GLOBAL);
2248 btrfs_init_block_rsv(&fs_info->delalloc_block_rsv,
2249 BTRFS_BLOCK_RSV_DELALLOC);
2250 btrfs_init_block_rsv(&fs_info->trans_block_rsv, BTRFS_BLOCK_RSV_TRANS);
2251 btrfs_init_block_rsv(&fs_info->chunk_block_rsv, BTRFS_BLOCK_RSV_CHUNK);
2252 btrfs_init_block_rsv(&fs_info->empty_block_rsv, BTRFS_BLOCK_RSV_EMPTY);
2253 btrfs_init_block_rsv(&fs_info->delayed_block_rsv,
2254 BTRFS_BLOCK_RSV_DELOPS);
2255 atomic_set(&fs_info->nr_async_submits, 0);
2256 atomic_set(&fs_info->async_delalloc_pages, 0);
2257 atomic_set(&fs_info->async_submit_draining, 0);
2258 atomic_set(&fs_info->nr_async_bios, 0);
2259 atomic_set(&fs_info->defrag_running, 0);
2260 atomic_set(&fs_info->qgroup_op_seq, 0);
2261 atomic64_set(&fs_info->tree_mod_seq, 0);
2263 fs_info->max_inline = BTRFS_DEFAULT_MAX_INLINE;
2264 fs_info->metadata_ratio = 0;
2265 fs_info->defrag_inodes = RB_ROOT;
2266 fs_info->free_chunk_space = 0;
2267 fs_info->tree_mod_log = RB_ROOT;
2268 fs_info->commit_interval = BTRFS_DEFAULT_COMMIT_INTERVAL;
2269 fs_info->avg_delayed_ref_runtime = div64_u64(NSEC_PER_SEC, 64);
2270 /* readahead state */
2271 INIT_RADIX_TREE(&fs_info->reada_tree, GFP_NOFS & ~__GFP_WAIT);
2272 spin_lock_init(&fs_info->reada_lock);
2274 fs_info->thread_pool_size = min_t(unsigned long,
2275 num_online_cpus() + 2, 8);
2277 INIT_LIST_HEAD(&fs_info->ordered_roots);
2278 spin_lock_init(&fs_info->ordered_root_lock);
2279 fs_info->delayed_root = kmalloc(sizeof(struct btrfs_delayed_root),
2281 if (!fs_info->delayed_root) {
2285 btrfs_init_delayed_root(fs_info->delayed_root);
2287 mutex_init(&fs_info->scrub_lock);
2288 atomic_set(&fs_info->scrubs_running, 0);
2289 atomic_set(&fs_info->scrub_pause_req, 0);
2290 atomic_set(&fs_info->scrubs_paused, 0);
2291 atomic_set(&fs_info->scrub_cancel_req, 0);
2292 init_waitqueue_head(&fs_info->replace_wait);
2293 init_waitqueue_head(&fs_info->scrub_pause_wait);
2294 fs_info->scrub_workers_refcnt = 0;
2295 #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
2296 fs_info->check_integrity_print_mask = 0;
2299 spin_lock_init(&fs_info->balance_lock);
2300 mutex_init(&fs_info->balance_mutex);
2301 atomic_set(&fs_info->balance_running, 0);
2302 atomic_set(&fs_info->balance_pause_req, 0);
2303 atomic_set(&fs_info->balance_cancel_req, 0);
2304 fs_info->balance_ctl = NULL;
2305 init_waitqueue_head(&fs_info->balance_wait_q);
2306 btrfs_init_async_reclaim_work(&fs_info->async_reclaim_work);
2308 sb->s_blocksize = 4096;
2309 sb->s_blocksize_bits = blksize_bits(4096);
2310 sb->s_bdi = &fs_info->bdi;
2312 fs_info->btree_inode->i_ino = BTRFS_BTREE_INODE_OBJECTID;
2313 set_nlink(fs_info->btree_inode, 1);
2315 * we set the i_size on the btree inode to the max possible int.
2316 * the real end of the address space is determined by all of
2317 * the devices in the system
2319 fs_info->btree_inode->i_size = OFFSET_MAX;
2320 fs_info->btree_inode->i_mapping->a_ops = &btree_aops;
2322 RB_CLEAR_NODE(&BTRFS_I(fs_info->btree_inode)->rb_node);
2323 extent_io_tree_init(&BTRFS_I(fs_info->btree_inode)->io_tree,
2324 fs_info->btree_inode->i_mapping);
2325 BTRFS_I(fs_info->btree_inode)->io_tree.track_uptodate = 0;
2326 extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree);
2328 BTRFS_I(fs_info->btree_inode)->io_tree.ops = &btree_extent_io_ops;
2330 BTRFS_I(fs_info->btree_inode)->root = tree_root;
2331 memset(&BTRFS_I(fs_info->btree_inode)->location, 0,
2332 sizeof(struct btrfs_key));
2333 set_bit(BTRFS_INODE_DUMMY,
2334 &BTRFS_I(fs_info->btree_inode)->runtime_flags);
2335 btrfs_insert_inode_hash(fs_info->btree_inode);
2337 spin_lock_init(&fs_info->block_group_cache_lock);
2338 fs_info->block_group_cache_tree = RB_ROOT;
2339 fs_info->first_logical_byte = (u64)-1;
2341 extent_io_tree_init(&fs_info->freed_extents[0],
2342 fs_info->btree_inode->i_mapping);
2343 extent_io_tree_init(&fs_info->freed_extents[1],
2344 fs_info->btree_inode->i_mapping);
2345 fs_info->pinned_extents = &fs_info->freed_extents[0];
2346 fs_info->do_barriers = 1;
2349 mutex_init(&fs_info->ordered_operations_mutex);
2350 mutex_init(&fs_info->ordered_extent_flush_mutex);
2351 mutex_init(&fs_info->tree_log_mutex);
2352 mutex_init(&fs_info->chunk_mutex);
2353 mutex_init(&fs_info->transaction_kthread_mutex);
2354 mutex_init(&fs_info->cleaner_mutex);
2355 mutex_init(&fs_info->volume_mutex);
2356 init_rwsem(&fs_info->commit_root_sem);
2357 init_rwsem(&fs_info->cleanup_work_sem);
2358 init_rwsem(&fs_info->subvol_sem);
2359 sema_init(&fs_info->uuid_tree_rescan_sem, 1);
2360 fs_info->dev_replace.lock_owner = 0;
2361 atomic_set(&fs_info->dev_replace.nesting_level, 0);
2362 mutex_init(&fs_info->dev_replace.lock_finishing_cancel_unmount);
2363 mutex_init(&fs_info->dev_replace.lock_management_lock);
2364 mutex_init(&fs_info->dev_replace.lock);
2366 spin_lock_init(&fs_info->qgroup_lock);
2367 mutex_init(&fs_info->qgroup_ioctl_lock);
2368 fs_info->qgroup_tree = RB_ROOT;
2369 fs_info->qgroup_op_tree = RB_ROOT;
2370 INIT_LIST_HEAD(&fs_info->dirty_qgroups);
2371 fs_info->qgroup_seq = 1;
2372 fs_info->quota_enabled = 0;
2373 fs_info->pending_quota_state = 0;
2374 fs_info->qgroup_ulist = NULL;
2375 mutex_init(&fs_info->qgroup_rescan_lock);
2377 btrfs_init_free_cluster(&fs_info->meta_alloc_cluster);
2378 btrfs_init_free_cluster(&fs_info->data_alloc_cluster);
2380 init_waitqueue_head(&fs_info->transaction_throttle);
2381 init_waitqueue_head(&fs_info->transaction_wait);
2382 init_waitqueue_head(&fs_info->transaction_blocked_wait);
2383 init_waitqueue_head(&fs_info->async_submit_wait);
2385 INIT_LIST_HEAD(&fs_info->pinned_chunks);
2387 ret = btrfs_alloc_stripe_hash_table(fs_info);
2393 __setup_root(4096, 4096, 4096, tree_root,
2394 fs_info, BTRFS_ROOT_TREE_OBJECTID);
2396 invalidate_bdev(fs_devices->latest_bdev);
2399 * Read super block and check the signature bytes only
2401 bh = btrfs_read_dev_super(fs_devices->latest_bdev);
2408 * We want to check superblock checksum, the type is stored inside.
2409 * Pass the whole disk block of size BTRFS_SUPER_INFO_SIZE (4k).
2411 if (btrfs_check_super_csum(bh->b_data)) {
2412 printk(KERN_ERR "BTRFS: superblock checksum mismatch\n");
2418 * super_copy is zeroed at allocation time and we never touch the
2419 * following bytes up to INFO_SIZE, the checksum is calculated from
2420 * the whole block of INFO_SIZE
2422 memcpy(fs_info->super_copy, bh->b_data, sizeof(*fs_info->super_copy));
2423 memcpy(fs_info->super_for_commit, fs_info->super_copy,
2424 sizeof(*fs_info->super_for_commit));
2427 memcpy(fs_info->fsid, fs_info->super_copy->fsid, BTRFS_FSID_SIZE);
2429 ret = btrfs_check_super_valid(fs_info, sb->s_flags & MS_RDONLY);
2431 printk(KERN_ERR "BTRFS: superblock contains fatal errors\n");
2436 disk_super = fs_info->super_copy;
2437 if (!btrfs_super_root(disk_super))
2440 /* check FS state, whether FS is broken. */
2441 if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_ERROR)
2442 set_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state);
2445 * run through our array of backup supers and setup
2446 * our ring pointer to the oldest one
2448 generation = btrfs_super_generation(disk_super);
2449 find_oldest_super_backup(fs_info, generation);
2452 * In the long term, we'll store the compression type in the super
2453 * block, and it'll be used for per file compression control.
2455 fs_info->compress_type = BTRFS_COMPRESS_ZLIB;
2457 ret = btrfs_parse_options(tree_root, options);
2463 features = btrfs_super_incompat_flags(disk_super) &
2464 ~BTRFS_FEATURE_INCOMPAT_SUPP;
2466 printk(KERN_ERR "BTRFS: couldn't mount because of "
2467 "unsupported optional features (%Lx).\n",
2474 * Leafsize and nodesize were always equal, this is only a sanity check.
2476 if (le32_to_cpu(disk_super->__unused_leafsize) !=
2477 btrfs_super_nodesize(disk_super)) {
2478 printk(KERN_ERR "BTRFS: couldn't mount because metadata "
2479 "blocksizes don't match. node %d leaf %d\n",
2480 btrfs_super_nodesize(disk_super),
2481 le32_to_cpu(disk_super->__unused_leafsize));
2485 if (btrfs_super_nodesize(disk_super) > BTRFS_MAX_METADATA_BLOCKSIZE) {
2486 printk(KERN_ERR "BTRFS: couldn't mount because metadata "
2487 "blocksize (%d) was too large\n",
2488 btrfs_super_nodesize(disk_super));
2493 features = btrfs_super_incompat_flags(disk_super);
2494 features |= BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF;
2495 if (tree_root->fs_info->compress_type == BTRFS_COMPRESS_LZO)
2496 features |= BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO;
2498 if (features & BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA)
2499 printk(KERN_ERR "BTRFS: has skinny extents\n");
2502 * flag our filesystem as having big metadata blocks if
2503 * they are bigger than the page size
2505 if (btrfs_super_nodesize(disk_super) > PAGE_CACHE_SIZE) {
2506 if (!(features & BTRFS_FEATURE_INCOMPAT_BIG_METADATA))
2507 printk(KERN_INFO "BTRFS: flagging fs with big metadata feature\n");
2508 features |= BTRFS_FEATURE_INCOMPAT_BIG_METADATA;
2511 nodesize = btrfs_super_nodesize(disk_super);
2512 sectorsize = btrfs_super_sectorsize(disk_super);
2513 stripesize = btrfs_super_stripesize(disk_super);
2514 fs_info->dirty_metadata_batch = nodesize * (1 + ilog2(nr_cpu_ids));
2515 fs_info->delalloc_batch = sectorsize * 512 * (1 + ilog2(nr_cpu_ids));
2518 * mixed block groups end up with duplicate but slightly offset
2519 * extent buffers for the same range. It leads to corruptions
2521 if ((features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS) &&
2522 (sectorsize != nodesize)) {
2523 printk(KERN_WARNING "BTRFS: unequal leaf/node/sector sizes "
2524 "are not allowed for mixed block groups on %s\n",
2530 * Needn't use the lock because there is no other task which will
2533 btrfs_set_super_incompat_flags(disk_super, features);
2535 features = btrfs_super_compat_ro_flags(disk_super) &
2536 ~BTRFS_FEATURE_COMPAT_RO_SUPP;
2537 if (!(sb->s_flags & MS_RDONLY) && features) {
2538 printk(KERN_ERR "BTRFS: couldn't mount RDWR because of "
2539 "unsupported option features (%Lx).\n",
2545 max_active = fs_info->thread_pool_size;
2548 btrfs_alloc_workqueue("worker", flags | WQ_HIGHPRI,
2551 fs_info->delalloc_workers =
2552 btrfs_alloc_workqueue("delalloc", flags, max_active, 2);
2554 fs_info->flush_workers =
2555 btrfs_alloc_workqueue("flush_delalloc", flags, max_active, 0);
2557 fs_info->caching_workers =
2558 btrfs_alloc_workqueue("cache", flags, max_active, 0);
2561 * a higher idle thresh on the submit workers makes it much more
2562 * likely that bios will be send down in a sane order to the
2565 fs_info->submit_workers =
2566 btrfs_alloc_workqueue("submit", flags,
2567 min_t(u64, fs_devices->num_devices,
2570 fs_info->fixup_workers =
2571 btrfs_alloc_workqueue("fixup", flags, 1, 0);
2574 * endios are largely parallel and should have a very
2577 fs_info->endio_workers =
2578 btrfs_alloc_workqueue("endio", flags, max_active, 4);
2579 fs_info->endio_meta_workers =
2580 btrfs_alloc_workqueue("endio-meta", flags, max_active, 4);
2581 fs_info->endio_meta_write_workers =
2582 btrfs_alloc_workqueue("endio-meta-write", flags, max_active, 2);
2583 fs_info->endio_raid56_workers =
2584 btrfs_alloc_workqueue("endio-raid56", flags, max_active, 4);
2585 fs_info->endio_repair_workers =
2586 btrfs_alloc_workqueue("endio-repair", flags, 1, 0);
2587 fs_info->rmw_workers =
2588 btrfs_alloc_workqueue("rmw", flags, max_active, 2);
2589 fs_info->endio_write_workers =
2590 btrfs_alloc_workqueue("endio-write", flags, max_active, 2);
2591 fs_info->endio_freespace_worker =
2592 btrfs_alloc_workqueue("freespace-write", flags, max_active, 0);
2593 fs_info->delayed_workers =
2594 btrfs_alloc_workqueue("delayed-meta", flags, max_active, 0);
2595 fs_info->readahead_workers =
2596 btrfs_alloc_workqueue("readahead", flags, max_active, 2);
2597 fs_info->qgroup_rescan_workers =
2598 btrfs_alloc_workqueue("qgroup-rescan", flags, 1, 0);
2599 fs_info->extent_workers =
2600 btrfs_alloc_workqueue("extent-refs", flags,
2601 min_t(u64, fs_devices->num_devices,
2604 if (!(fs_info->workers && fs_info->delalloc_workers &&
2605 fs_info->submit_workers && fs_info->flush_workers &&
2606 fs_info->endio_workers && fs_info->endio_meta_workers &&
2607 fs_info->endio_meta_write_workers &&
2608 fs_info->endio_repair_workers &&
2609 fs_info->endio_write_workers && fs_info->endio_raid56_workers &&
2610 fs_info->endio_freespace_worker && fs_info->rmw_workers &&
2611 fs_info->caching_workers && fs_info->readahead_workers &&
2612 fs_info->fixup_workers && fs_info->delayed_workers &&
2613 fs_info->extent_workers &&
2614 fs_info->qgroup_rescan_workers)) {
2616 goto fail_sb_buffer;
2619 fs_info->bdi.ra_pages *= btrfs_super_num_devices(disk_super);
2620 fs_info->bdi.ra_pages = max(fs_info->bdi.ra_pages,
2621 4 * 1024 * 1024 / PAGE_CACHE_SIZE);
2623 tree_root->nodesize = nodesize;
2624 tree_root->sectorsize = sectorsize;
2625 tree_root->stripesize = stripesize;
2627 sb->s_blocksize = sectorsize;
2628 sb->s_blocksize_bits = blksize_bits(sectorsize);
2630 if (btrfs_super_magic(disk_super) != BTRFS_MAGIC) {
2631 printk(KERN_INFO "BTRFS: valid FS not found on %s\n", sb->s_id);
2632 goto fail_sb_buffer;
2635 if (sectorsize != PAGE_SIZE) {
2636 printk(KERN_WARNING "BTRFS: Incompatible sector size(%lu) "
2637 "found on %s\n", (unsigned long)sectorsize, sb->s_id);
2638 goto fail_sb_buffer;
2641 mutex_lock(&fs_info->chunk_mutex);
2642 ret = btrfs_read_sys_array(tree_root);
2643 mutex_unlock(&fs_info->chunk_mutex);
2645 printk(KERN_WARNING "BTRFS: failed to read the system "
2646 "array on %s\n", sb->s_id);
2647 goto fail_sb_buffer;
2650 generation = btrfs_super_chunk_root_generation(disk_super);
2652 __setup_root(nodesize, sectorsize, stripesize, chunk_root,
2653 fs_info, BTRFS_CHUNK_TREE_OBJECTID);
2655 chunk_root->node = read_tree_block(chunk_root,
2656 btrfs_super_chunk_root(disk_super),
2658 if (!chunk_root->node ||
2659 !test_bit(EXTENT_BUFFER_UPTODATE, &chunk_root->node->bflags)) {
2660 printk(KERN_WARNING "BTRFS: failed to read chunk root on %s\n",
2662 goto fail_tree_roots;
2664 btrfs_set_root_node(&chunk_root->root_item, chunk_root->node);
2665 chunk_root->commit_root = btrfs_root_node(chunk_root);
2667 read_extent_buffer(chunk_root->node, fs_info->chunk_tree_uuid,
2668 btrfs_header_chunk_tree_uuid(chunk_root->node), BTRFS_UUID_SIZE);
2670 ret = btrfs_read_chunk_tree(chunk_root);
2672 printk(KERN_WARNING "BTRFS: failed to read chunk tree on %s\n",
2674 goto fail_tree_roots;
2678 * keep the device that is marked to be the target device for the
2679 * dev_replace procedure
2681 btrfs_close_extra_devices(fs_info, fs_devices, 0);
2683 if (!fs_devices->latest_bdev) {
2684 printk(KERN_CRIT "BTRFS: failed to read devices on %s\n",
2686 goto fail_tree_roots;
2690 generation = btrfs_super_generation(disk_super);
2692 tree_root->node = read_tree_block(tree_root,
2693 btrfs_super_root(disk_super),
2695 if (!tree_root->node ||
2696 !test_bit(EXTENT_BUFFER_UPTODATE, &tree_root->node->bflags)) {
2697 printk(KERN_WARNING "BTRFS: failed to read tree root on %s\n",
2700 goto recovery_tree_root;
2703 btrfs_set_root_node(&tree_root->root_item, tree_root->node);
2704 tree_root->commit_root = btrfs_root_node(tree_root);
2705 btrfs_set_root_refs(&tree_root->root_item, 1);
2707 location.objectid = BTRFS_EXTENT_TREE_OBJECTID;
2708 location.type = BTRFS_ROOT_ITEM_KEY;
2709 location.offset = 0;
2711 extent_root = btrfs_read_tree_root(tree_root, &location);
2712 if (IS_ERR(extent_root)) {
2713 ret = PTR_ERR(extent_root);
2714 goto recovery_tree_root;
2716 set_bit(BTRFS_ROOT_TRACK_DIRTY, &extent_root->state);
2717 fs_info->extent_root = extent_root;
2719 location.objectid = BTRFS_DEV_TREE_OBJECTID;
2720 dev_root = btrfs_read_tree_root(tree_root, &location);
2721 if (IS_ERR(dev_root)) {
2722 ret = PTR_ERR(dev_root);
2723 goto recovery_tree_root;
2725 set_bit(BTRFS_ROOT_TRACK_DIRTY, &dev_root->state);
2726 fs_info->dev_root = dev_root;
2727 btrfs_init_devices_late(fs_info);
2729 location.objectid = BTRFS_CSUM_TREE_OBJECTID;
2730 csum_root = btrfs_read_tree_root(tree_root, &location);
2731 if (IS_ERR(csum_root)) {
2732 ret = PTR_ERR(csum_root);
2733 goto recovery_tree_root;
2735 set_bit(BTRFS_ROOT_TRACK_DIRTY, &csum_root->state);
2736 fs_info->csum_root = csum_root;
2738 location.objectid = BTRFS_QUOTA_TREE_OBJECTID;
2739 quota_root = btrfs_read_tree_root(tree_root, &location);
2740 if (!IS_ERR(quota_root)) {
2741 set_bit(BTRFS_ROOT_TRACK_DIRTY, "a_root->state);
2742 fs_info->quota_enabled = 1;
2743 fs_info->pending_quota_state = 1;
2744 fs_info->quota_root = quota_root;
2747 location.objectid = BTRFS_UUID_TREE_OBJECTID;
2748 uuid_root = btrfs_read_tree_root(tree_root, &location);
2749 if (IS_ERR(uuid_root)) {
2750 ret = PTR_ERR(uuid_root);
2752 goto recovery_tree_root;
2753 create_uuid_tree = true;
2754 check_uuid_tree = false;
2756 set_bit(BTRFS_ROOT_TRACK_DIRTY, &uuid_root->state);
2757 fs_info->uuid_root = uuid_root;
2758 create_uuid_tree = false;
2760 generation != btrfs_super_uuid_tree_generation(disk_super);
2763 fs_info->generation = generation;
2764 fs_info->last_trans_committed = generation;
2766 ret = btrfs_recover_balance(fs_info);
2768 printk(KERN_WARNING "BTRFS: failed to recover balance\n");
2769 goto fail_block_groups;
2772 ret = btrfs_init_dev_stats(fs_info);
2774 printk(KERN_ERR "BTRFS: failed to init dev_stats: %d\n",
2776 goto fail_block_groups;
2779 ret = btrfs_init_dev_replace(fs_info);
2781 pr_err("BTRFS: failed to init dev_replace: %d\n", ret);
2782 goto fail_block_groups;
2785 btrfs_close_extra_devices(fs_info, fs_devices, 1);
2787 ret = btrfs_sysfs_add_one(fs_info);
2789 pr_err("BTRFS: failed to init sysfs interface: %d\n", ret);
2790 goto fail_block_groups;
2793 ret = btrfs_init_space_info(fs_info);
2795 printk(KERN_ERR "BTRFS: Failed to initial space info: %d\n", ret);
2799 ret = btrfs_read_block_groups(extent_root);
2801 printk(KERN_ERR "BTRFS: Failed to read block groups: %d\n", ret);
2804 fs_info->num_tolerated_disk_barrier_failures =
2805 btrfs_calc_num_tolerated_disk_barrier_failures(fs_info);
2806 if (fs_info->fs_devices->missing_devices >
2807 fs_info->num_tolerated_disk_barrier_failures &&
2808 !(sb->s_flags & MS_RDONLY)) {
2809 printk(KERN_WARNING "BTRFS: "
2810 "too many missing devices, writeable mount is not allowed\n");
2814 fs_info->cleaner_kthread = kthread_run(cleaner_kthread, tree_root,
2816 if (IS_ERR(fs_info->cleaner_kthread))
2819 fs_info->transaction_kthread = kthread_run(transaction_kthread,
2821 "btrfs-transaction");
2822 if (IS_ERR(fs_info->transaction_kthread))
2825 if (!btrfs_test_opt(tree_root, SSD) &&
2826 !btrfs_test_opt(tree_root, NOSSD) &&
2827 !fs_info->fs_devices->rotating) {
2828 printk(KERN_INFO "BTRFS: detected SSD devices, enabling SSD "
2830 btrfs_set_opt(fs_info->mount_opt, SSD);
2834 * Mount does not set all options immediatelly, we can do it now and do
2835 * not have to wait for transaction commit
2837 btrfs_apply_pending_changes(fs_info);
2839 #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
2840 if (btrfs_test_opt(tree_root, CHECK_INTEGRITY)) {
2841 ret = btrfsic_mount(tree_root, fs_devices,
2842 btrfs_test_opt(tree_root,
2843 CHECK_INTEGRITY_INCLUDING_EXTENT_DATA) ?
2845 fs_info->check_integrity_print_mask);
2847 printk(KERN_WARNING "BTRFS: failed to initialize"
2848 " integrity check module %s\n", sb->s_id);
2851 ret = btrfs_read_qgroup_config(fs_info);
2853 goto fail_trans_kthread;
2855 /* do not make disk changes in broken FS */
2856 if (btrfs_super_log_root(disk_super) != 0) {
2857 u64 bytenr = btrfs_super_log_root(disk_super);
2859 if (fs_devices->rw_devices == 0) {
2860 printk(KERN_WARNING "BTRFS: log replay required "
2866 log_tree_root = btrfs_alloc_root(fs_info);
2867 if (!log_tree_root) {
2872 __setup_root(nodesize, sectorsize, stripesize,
2873 log_tree_root, fs_info, BTRFS_TREE_LOG_OBJECTID);
2875 log_tree_root->node = read_tree_block(tree_root, bytenr,
2877 if (!log_tree_root->node ||
2878 !extent_buffer_uptodate(log_tree_root->node)) {
2879 printk(KERN_ERR "BTRFS: failed to read log tree\n");
2880 free_extent_buffer(log_tree_root->node);
2881 kfree(log_tree_root);
2884 /* returns with log_tree_root freed on success */
2885 ret = btrfs_recover_log_trees(log_tree_root);
2887 btrfs_error(tree_root->fs_info, ret,
2888 "Failed to recover log tree");
2889 free_extent_buffer(log_tree_root->node);
2890 kfree(log_tree_root);
2894 if (sb->s_flags & MS_RDONLY) {
2895 ret = btrfs_commit_super(tree_root);
2901 ret = btrfs_find_orphan_roots(tree_root);
2905 if (!(sb->s_flags & MS_RDONLY)) {
2906 ret = btrfs_cleanup_fs_roots(fs_info);
2910 mutex_lock(&fs_info->cleaner_mutex);
2911 ret = btrfs_recover_relocation(tree_root);
2912 mutex_unlock(&fs_info->cleaner_mutex);
2915 "BTRFS: failed to recover relocation\n");
2921 location.objectid = BTRFS_FS_TREE_OBJECTID;
2922 location.type = BTRFS_ROOT_ITEM_KEY;
2923 location.offset = 0;
2925 fs_info->fs_root = btrfs_read_fs_root_no_name(fs_info, &location);
2926 if (IS_ERR(fs_info->fs_root)) {
2927 err = PTR_ERR(fs_info->fs_root);
2931 if (sb->s_flags & MS_RDONLY)
2934 down_read(&fs_info->cleanup_work_sem);
2935 if ((ret = btrfs_orphan_cleanup(fs_info->fs_root)) ||
2936 (ret = btrfs_orphan_cleanup(fs_info->tree_root))) {
2937 up_read(&fs_info->cleanup_work_sem);
2938 close_ctree(tree_root);
2941 up_read(&fs_info->cleanup_work_sem);
2943 ret = btrfs_resume_balance_async(fs_info);
2945 printk(KERN_WARNING "BTRFS: failed to resume balance\n");
2946 close_ctree(tree_root);
2950 ret = btrfs_resume_dev_replace_async(fs_info);
2952 pr_warn("BTRFS: failed to resume dev_replace\n");
2953 close_ctree(tree_root);
2957 btrfs_qgroup_rescan_resume(fs_info);
2959 if (create_uuid_tree) {
2960 pr_info("BTRFS: creating UUID tree\n");
2961 ret = btrfs_create_uuid_tree(fs_info);
2963 pr_warn("BTRFS: failed to create the UUID tree %d\n",
2965 close_ctree(tree_root);
2968 } else if (check_uuid_tree ||
2969 btrfs_test_opt(tree_root, RESCAN_UUID_TREE)) {
2970 pr_info("BTRFS: checking UUID tree\n");
2971 ret = btrfs_check_uuid_tree(fs_info);
2973 pr_warn("BTRFS: failed to check the UUID tree %d\n",
2975 close_ctree(tree_root);
2979 fs_info->update_uuid_tree_gen = 1;
2987 btrfs_free_qgroup_config(fs_info);
2989 kthread_stop(fs_info->transaction_kthread);
2990 btrfs_cleanup_transaction(fs_info->tree_root);
2991 btrfs_free_fs_roots(fs_info);
2993 kthread_stop(fs_info->cleaner_kthread);
2996 * make sure we're done with the btree inode before we stop our
2999 filemap_write_and_wait(fs_info->btree_inode->i_mapping);
3002 btrfs_sysfs_remove_one(fs_info);
3005 btrfs_put_block_group_cache(fs_info);
3006 btrfs_free_block_groups(fs_info);
3009 free_root_pointers(fs_info, 1);
3010 invalidate_inode_pages2(fs_info->btree_inode->i_mapping);
3013 btrfs_stop_all_workers(fs_info);
3016 btrfs_mapping_tree_free(&fs_info->mapping_tree);
3018 iput(fs_info->btree_inode);
3020 percpu_counter_destroy(&fs_info->bio_counter);
3021 fail_delalloc_bytes:
3022 percpu_counter_destroy(&fs_info->delalloc_bytes);
3023 fail_dirty_metadata_bytes:
3024 percpu_counter_destroy(&fs_info->dirty_metadata_bytes);
3026 bdi_destroy(&fs_info->bdi);
3028 cleanup_srcu_struct(&fs_info->subvol_srcu);
3030 btrfs_free_stripe_hash_table(fs_info);
3031 btrfs_close_devices(fs_info->fs_devices);
3035 if (!btrfs_test_opt(tree_root, RECOVERY))
3036 goto fail_tree_roots;
3038 free_root_pointers(fs_info, 0);
3040 /* don't use the log in recovery mode, it won't be valid */
3041 btrfs_set_super_log_root(disk_super, 0);
3043 /* we can't trust the free space cache either */
3044 btrfs_set_opt(fs_info->mount_opt, CLEAR_CACHE);
3046 ret = next_root_backup(fs_info, fs_info->super_copy,
3047 &num_backups_tried, &backup_index);
3049 goto fail_block_groups;
3050 goto retry_root_backup;
3053 static void btrfs_end_buffer_write_sync(struct buffer_head *bh, int uptodate)
3056 set_buffer_uptodate(bh);
3058 struct btrfs_device *device = (struct btrfs_device *)
3061 printk_ratelimited_in_rcu(KERN_WARNING "BTRFS: lost page write due to "
3062 "I/O error on %s\n",
3063 rcu_str_deref(device->name));
3064 /* note, we dont' set_buffer_write_io_error because we have
3065 * our own ways of dealing with the IO errors
3067 clear_buffer_uptodate(bh);
3068 btrfs_dev_stat_inc_and_print(device, BTRFS_DEV_STAT_WRITE_ERRS);
3074 struct buffer_head *btrfs_read_dev_super(struct block_device *bdev)
3076 struct buffer_head *bh;
3077 struct buffer_head *latest = NULL;
3078 struct btrfs_super_block *super;
3083 /* we would like to check all the supers, but that would make
3084 * a btrfs mount succeed after a mkfs from a different FS.
3085 * So, we need to add a special mount option to scan for
3086 * later supers, using BTRFS_SUPER_MIRROR_MAX instead
3088 for (i = 0; i < 1; i++) {
3089 bytenr = btrfs_sb_offset(i);
3090 if (bytenr + BTRFS_SUPER_INFO_SIZE >=
3091 i_size_read(bdev->bd_inode))
3093 bh = __bread(bdev, bytenr / 4096,
3094 BTRFS_SUPER_INFO_SIZE);
3098 super = (struct btrfs_super_block *)bh->b_data;
3099 if (btrfs_super_bytenr(super) != bytenr ||
3100 btrfs_super_magic(super) != BTRFS_MAGIC) {
3105 if (!latest || btrfs_super_generation(super) > transid) {
3108 transid = btrfs_super_generation(super);
3117 * this should be called twice, once with wait == 0 and
3118 * once with wait == 1. When wait == 0 is done, all the buffer heads
3119 * we write are pinned.
3121 * They are released when wait == 1 is done.
3122 * max_mirrors must be the same for both runs, and it indicates how
3123 * many supers on this one device should be written.
3125 * max_mirrors == 0 means to write them all.
3127 static int write_dev_supers(struct btrfs_device *device,
3128 struct btrfs_super_block *sb,
3129 int do_barriers, int wait, int max_mirrors)
3131 struct buffer_head *bh;
3138 if (max_mirrors == 0)
3139 max_mirrors = BTRFS_SUPER_MIRROR_MAX;
3141 for (i = 0; i < max_mirrors; i++) {
3142 bytenr = btrfs_sb_offset(i);
3143 if (bytenr + BTRFS_SUPER_INFO_SIZE >=
3144 device->commit_total_bytes)
3148 bh = __find_get_block(device->bdev, bytenr / 4096,
3149 BTRFS_SUPER_INFO_SIZE);
3155 if (!buffer_uptodate(bh))
3158 /* drop our reference */
3161 /* drop the reference from the wait == 0 run */
3165 btrfs_set_super_bytenr(sb, bytenr);
3168 crc = btrfs_csum_data((char *)sb +
3169 BTRFS_CSUM_SIZE, crc,
3170 BTRFS_SUPER_INFO_SIZE -
3172 btrfs_csum_final(crc, sb->csum);
3175 * one reference for us, and we leave it for the
3178 bh = __getblk(device->bdev, bytenr / 4096,
3179 BTRFS_SUPER_INFO_SIZE);
3181 printk(KERN_ERR "BTRFS: couldn't get super "
3182 "buffer head for bytenr %Lu\n", bytenr);
3187 memcpy(bh->b_data, sb, BTRFS_SUPER_INFO_SIZE);
3189 /* one reference for submit_bh */
3192 set_buffer_uptodate(bh);
3194 bh->b_end_io = btrfs_end_buffer_write_sync;
3195 bh->b_private = device;
3199 * we fua the first super. The others we allow
3203 ret = btrfsic_submit_bh(WRITE_FUA, bh);
3205 ret = btrfsic_submit_bh(WRITE_SYNC, bh);
3209 return errors < i ? 0 : -1;
3213 * endio for the write_dev_flush, this will wake anyone waiting
3214 * for the barrier when it is done
3216 static void btrfs_end_empty_barrier(struct bio *bio, int err)
3219 if (err == -EOPNOTSUPP)
3220 set_bit(BIO_EOPNOTSUPP, &bio->bi_flags);
3221 clear_bit(BIO_UPTODATE, &bio->bi_flags);
3223 if (bio->bi_private)
3224 complete(bio->bi_private);
3229 * trigger flushes for one the devices. If you pass wait == 0, the flushes are
3230 * sent down. With wait == 1, it waits for the previous flush.
3232 * any device where the flush fails with eopnotsupp are flagged as not-barrier
3235 static int write_dev_flush(struct btrfs_device *device, int wait)
3240 if (device->nobarriers)
3244 bio = device->flush_bio;
3248 wait_for_completion(&device->flush_wait);
3250 if (bio_flagged(bio, BIO_EOPNOTSUPP)) {
3251 printk_in_rcu("BTRFS: disabling barriers on dev %s\n",
3252 rcu_str_deref(device->name));
3253 device->nobarriers = 1;
3254 } else if (!bio_flagged(bio, BIO_UPTODATE)) {
3256 btrfs_dev_stat_inc_and_print(device,
3257 BTRFS_DEV_STAT_FLUSH_ERRS);
3260 /* drop the reference from the wait == 0 run */
3262 device->flush_bio = NULL;
3268 * one reference for us, and we leave it for the
3271 device->flush_bio = NULL;
3272 bio = btrfs_io_bio_alloc(GFP_NOFS, 0);
3276 bio->bi_end_io = btrfs_end_empty_barrier;
3277 bio->bi_bdev = device->bdev;
3278 init_completion(&device->flush_wait);
3279 bio->bi_private = &device->flush_wait;
3280 device->flush_bio = bio;
3283 btrfsic_submit_bio(WRITE_FLUSH, bio);
3289 * send an empty flush down to each device in parallel,
3290 * then wait for them
3292 static int barrier_all_devices(struct btrfs_fs_info *info)
3294 struct list_head *head;
3295 struct btrfs_device *dev;
3296 int errors_send = 0;
3297 int errors_wait = 0;
3300 /* send down all the barriers */
3301 head = &info->fs_devices->devices;
3302 list_for_each_entry_rcu(dev, head, dev_list) {
3309 if (!dev->in_fs_metadata || !dev->writeable)
3312 ret = write_dev_flush(dev, 0);
3317 /* wait for all the barriers */
3318 list_for_each_entry_rcu(dev, head, dev_list) {
3325 if (!dev->in_fs_metadata || !dev->writeable)
3328 ret = write_dev_flush(dev, 1);
3332 if (errors_send > info->num_tolerated_disk_barrier_failures ||
3333 errors_wait > info->num_tolerated_disk_barrier_failures)
3338 int btrfs_calc_num_tolerated_disk_barrier_failures(
3339 struct btrfs_fs_info *fs_info)
3341 struct btrfs_ioctl_space_info space;
3342 struct btrfs_space_info *sinfo;
3343 u64 types[] = {BTRFS_BLOCK_GROUP_DATA,
3344 BTRFS_BLOCK_GROUP_SYSTEM,
3345 BTRFS_BLOCK_GROUP_METADATA,
3346 BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA};
3350 int num_tolerated_disk_barrier_failures =
3351 (int)fs_info->fs_devices->num_devices;
3353 for (i = 0; i < num_types; i++) {
3354 struct btrfs_space_info *tmp;
3358 list_for_each_entry_rcu(tmp, &fs_info->space_info, list) {
3359 if (tmp->flags == types[i]) {
3369 down_read(&sinfo->groups_sem);
3370 for (c = 0; c < BTRFS_NR_RAID_TYPES; c++) {
3371 if (!list_empty(&sinfo->block_groups[c])) {
3374 btrfs_get_block_group_info(
3375 &sinfo->block_groups[c], &space);
3376 if (space.total_bytes == 0 ||
3377 space.used_bytes == 0)
3379 flags = space.flags;
3382 * 0: if dup, single or RAID0 is configured for
3383 * any of metadata, system or data, else
3384 * 1: if RAID5 is configured, or if RAID1 or
3385 * RAID10 is configured and only two mirrors
3387 * 2: if RAID6 is configured, else
3388 * num_mirrors - 1: if RAID1 or RAID10 is
3389 * configured and more than
3390 * 2 mirrors are used.
3392 if (num_tolerated_disk_barrier_failures > 0 &&
3393 ((flags & (BTRFS_BLOCK_GROUP_DUP |
3394 BTRFS_BLOCK_GROUP_RAID0)) ||
3395 ((flags & BTRFS_BLOCK_GROUP_PROFILE_MASK)
3397 num_tolerated_disk_barrier_failures = 0;
3398 else if (num_tolerated_disk_barrier_failures > 1) {
3399 if (flags & (BTRFS_BLOCK_GROUP_RAID1 |
3400 BTRFS_BLOCK_GROUP_RAID5 |
3401 BTRFS_BLOCK_GROUP_RAID10)) {
3402 num_tolerated_disk_barrier_failures = 1;
3404 BTRFS_BLOCK_GROUP_RAID6) {
3405 num_tolerated_disk_barrier_failures = 2;
3410 up_read(&sinfo->groups_sem);
3413 return num_tolerated_disk_barrier_failures;
3416 static int write_all_supers(struct btrfs_root *root, int max_mirrors)
3418 struct list_head *head;
3419 struct btrfs_device *dev;
3420 struct btrfs_super_block *sb;
3421 struct btrfs_dev_item *dev_item;
3425 int total_errors = 0;
3428 do_barriers = !btrfs_test_opt(root, NOBARRIER);
3429 backup_super_roots(root->fs_info);
3431 sb = root->fs_info->super_for_commit;
3432 dev_item = &sb->dev_item;
3434 mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
3435 head = &root->fs_info->fs_devices->devices;
3436 max_errors = btrfs_super_num_devices(root->fs_info->super_copy) - 1;
3439 ret = barrier_all_devices(root->fs_info);
3442 &root->fs_info->fs_devices->device_list_mutex);
3443 btrfs_error(root->fs_info, ret,
3444 "errors while submitting device barriers.");
3449 list_for_each_entry_rcu(dev, head, dev_list) {
3454 if (!dev->in_fs_metadata || !dev->writeable)
3457 btrfs_set_stack_device_generation(dev_item, 0);
3458 btrfs_set_stack_device_type(dev_item, dev->type);
3459 btrfs_set_stack_device_id(dev_item, dev->devid);
3460 btrfs_set_stack_device_total_bytes(dev_item,
3461 dev->commit_total_bytes);
3462 btrfs_set_stack_device_bytes_used(dev_item,
3463 dev->commit_bytes_used);
3464 btrfs_set_stack_device_io_align(dev_item, dev->io_align);
3465 btrfs_set_stack_device_io_width(dev_item, dev->io_width);
3466 btrfs_set_stack_device_sector_size(dev_item, dev->sector_size);
3467 memcpy(dev_item->uuid, dev->uuid, BTRFS_UUID_SIZE);
3468 memcpy(dev_item->fsid, dev->fs_devices->fsid, BTRFS_UUID_SIZE);
3470 flags = btrfs_super_flags(sb);
3471 btrfs_set_super_flags(sb, flags | BTRFS_HEADER_FLAG_WRITTEN);
3473 ret = write_dev_supers(dev, sb, do_barriers, 0, max_mirrors);
3477 if (total_errors > max_errors) {
3478 btrfs_err(root->fs_info, "%d errors while writing supers",
3480 mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
3482 /* FUA is masked off if unsupported and can't be the reason */
3483 btrfs_error(root->fs_info, -EIO,
3484 "%d errors while writing supers", total_errors);
3489 list_for_each_entry_rcu(dev, head, dev_list) {
3492 if (!dev->in_fs_metadata || !dev->writeable)
3495 ret = write_dev_supers(dev, sb, do_barriers, 1, max_mirrors);
3499 mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
3500 if (total_errors > max_errors) {
3501 btrfs_error(root->fs_info, -EIO,
3502 "%d errors while writing supers", total_errors);
3508 int write_ctree_super(struct btrfs_trans_handle *trans,
3509 struct btrfs_root *root, int max_mirrors)
3511 return write_all_supers(root, max_mirrors);
3514 /* Drop a fs root from the radix tree and free it. */
3515 void btrfs_drop_and_free_fs_root(struct btrfs_fs_info *fs_info,
3516 struct btrfs_root *root)
3518 spin_lock(&fs_info->fs_roots_radix_lock);
3519 radix_tree_delete(&fs_info->fs_roots_radix,
3520 (unsigned long)root->root_key.objectid);
3521 spin_unlock(&fs_info->fs_roots_radix_lock);
3523 if (btrfs_root_refs(&root->root_item) == 0)
3524 synchronize_srcu(&fs_info->subvol_srcu);
3526 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state))
3527 btrfs_free_log(NULL, root);
3529 if (root->free_ino_pinned)
3530 __btrfs_remove_free_space_cache(root->free_ino_pinned);
3531 if (root->free_ino_ctl)
3532 __btrfs_remove_free_space_cache(root->free_ino_ctl);
3536 static void free_fs_root(struct btrfs_root *root)
3538 iput(root->ino_cache_inode);
3539 WARN_ON(!RB_EMPTY_ROOT(&root->inode_tree));
3540 btrfs_free_block_rsv(root, root->orphan_block_rsv);
3541 root->orphan_block_rsv = NULL;
3543 free_anon_bdev(root->anon_dev);
3544 if (root->subv_writers)
3545 btrfs_free_subvolume_writers(root->subv_writers);
3546 free_extent_buffer(root->node);
3547 free_extent_buffer(root->commit_root);
3548 kfree(root->free_ino_ctl);
3549 kfree(root->free_ino_pinned);
3551 btrfs_put_fs_root(root);
3554 void btrfs_free_fs_root(struct btrfs_root *root)
3559 int btrfs_cleanup_fs_roots(struct btrfs_fs_info *fs_info)
3561 u64 root_objectid = 0;
3562 struct btrfs_root *gang[8];
3565 unsigned int ret = 0;
3569 index = srcu_read_lock(&fs_info->subvol_srcu);
3570 ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
3571 (void **)gang, root_objectid,
3574 srcu_read_unlock(&fs_info->subvol_srcu, index);
3577 root_objectid = gang[ret - 1]->root_key.objectid + 1;
3579 for (i = 0; i < ret; i++) {
3580 /* Avoid to grab roots in dead_roots */
3581 if (btrfs_root_refs(&gang[i]->root_item) == 0) {
3585 /* grab all the search result for later use */
3586 gang[i] = btrfs_grab_fs_root(gang[i]);
3588 srcu_read_unlock(&fs_info->subvol_srcu, index);
3590 for (i = 0; i < ret; i++) {
3593 root_objectid = gang[i]->root_key.objectid;
3594 err = btrfs_orphan_cleanup(gang[i]);
3597 btrfs_put_fs_root(gang[i]);
3602 /* release the uncleaned roots due to error */
3603 for (; i < ret; i++) {
3605 btrfs_put_fs_root(gang[i]);
3610 int btrfs_commit_super(struct btrfs_root *root)
3612 struct btrfs_trans_handle *trans;
3614 mutex_lock(&root->fs_info->cleaner_mutex);
3615 btrfs_run_delayed_iputs(root);
3616 mutex_unlock(&root->fs_info->cleaner_mutex);
3617 wake_up_process(root->fs_info->cleaner_kthread);
3619 /* wait until ongoing cleanup work done */
3620 down_write(&root->fs_info->cleanup_work_sem);
3621 up_write(&root->fs_info->cleanup_work_sem);
3623 trans = btrfs_join_transaction(root);
3625 return PTR_ERR(trans);
3626 return btrfs_commit_transaction(trans, root);
3629 void close_ctree(struct btrfs_root *root)
3631 struct btrfs_fs_info *fs_info = root->fs_info;
3634 fs_info->closing = 1;
3637 /* wait for the uuid_scan task to finish */
3638 down(&fs_info->uuid_tree_rescan_sem);
3639 /* avoid complains from lockdep et al., set sem back to initial state */
3640 up(&fs_info->uuid_tree_rescan_sem);
3642 /* pause restriper - we want to resume on mount */
3643 btrfs_pause_balance(fs_info);
3645 btrfs_dev_replace_suspend_for_unmount(fs_info);
3647 btrfs_scrub_cancel(fs_info);
3649 /* wait for any defraggers to finish */
3650 wait_event(fs_info->transaction_wait,
3651 (atomic_read(&fs_info->defrag_running) == 0));
3653 /* clear out the rbtree of defraggable inodes */
3654 btrfs_cleanup_defrag_inodes(fs_info);
3656 cancel_work_sync(&fs_info->async_reclaim_work);
3658 if (!(fs_info->sb->s_flags & MS_RDONLY)) {
3659 ret = btrfs_commit_super(root);
3661 btrfs_err(root->fs_info, "commit super ret %d", ret);
3664 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state))
3665 btrfs_error_commit_super(root);
3667 kthread_stop(fs_info->transaction_kthread);
3668 kthread_stop(fs_info->cleaner_kthread);
3670 fs_info->closing = 2;
3673 btrfs_free_qgroup_config(root->fs_info);
3675 if (percpu_counter_sum(&fs_info->delalloc_bytes)) {
3676 btrfs_info(root->fs_info, "at unmount delalloc count %lld",
3677 percpu_counter_sum(&fs_info->delalloc_bytes));
3680 btrfs_sysfs_remove_one(fs_info);
3682 btrfs_free_fs_roots(fs_info);
3684 btrfs_put_block_group_cache(fs_info);
3686 btrfs_free_block_groups(fs_info);
3689 * we must make sure there is not any read request to
3690 * submit after we stopping all workers.
3692 invalidate_inode_pages2(fs_info->btree_inode->i_mapping);
3693 btrfs_stop_all_workers(fs_info);
3696 free_root_pointers(fs_info, 1);
3698 iput(fs_info->btree_inode);
3700 #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
3701 if (btrfs_test_opt(root, CHECK_INTEGRITY))
3702 btrfsic_unmount(root, fs_info->fs_devices);
3705 btrfs_close_devices(fs_info->fs_devices);
3706 btrfs_mapping_tree_free(&fs_info->mapping_tree);
3708 percpu_counter_destroy(&fs_info->dirty_metadata_bytes);
3709 percpu_counter_destroy(&fs_info->delalloc_bytes);
3710 percpu_counter_destroy(&fs_info->bio_counter);
3711 bdi_destroy(&fs_info->bdi);
3712 cleanup_srcu_struct(&fs_info->subvol_srcu);
3714 btrfs_free_stripe_hash_table(fs_info);
3716 btrfs_free_block_rsv(root, root->orphan_block_rsv);
3717 root->orphan_block_rsv = NULL;
3720 while (!list_empty(&fs_info->pinned_chunks)) {
3721 struct extent_map *em;
3723 em = list_first_entry(&fs_info->pinned_chunks,
3724 struct extent_map, list);
3725 list_del_init(&em->list);
3726 free_extent_map(em);
3728 unlock_chunks(root);
3731 int btrfs_buffer_uptodate(struct extent_buffer *buf, u64 parent_transid,
3735 struct inode *btree_inode = buf->pages[0]->mapping->host;
3737 ret = extent_buffer_uptodate(buf);
3741 ret = verify_parent_transid(&BTRFS_I(btree_inode)->io_tree, buf,
3742 parent_transid, atomic);
3748 int btrfs_set_buffer_uptodate(struct extent_buffer *buf)
3750 return set_extent_buffer_uptodate(buf);
3753 void btrfs_mark_buffer_dirty(struct extent_buffer *buf)
3755 struct btrfs_root *root;
3756 u64 transid = btrfs_header_generation(buf);
3759 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
3761 * This is a fast path so only do this check if we have sanity tests
3762 * enabled. Normal people shouldn't be marking dummy buffers as dirty
3763 * outside of the sanity tests.
3765 if (unlikely(test_bit(EXTENT_BUFFER_DUMMY, &buf->bflags)))
3768 root = BTRFS_I(buf->pages[0]->mapping->host)->root;
3769 btrfs_assert_tree_locked(buf);
3770 if (transid != root->fs_info->generation)
3771 WARN(1, KERN_CRIT "btrfs transid mismatch buffer %llu, "
3772 "found %llu running %llu\n",
3773 buf->start, transid, root->fs_info->generation);
3774 was_dirty = set_extent_buffer_dirty(buf);
3776 __percpu_counter_add(&root->fs_info->dirty_metadata_bytes,
3778 root->fs_info->dirty_metadata_batch);
3779 #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
3780 if (btrfs_header_level(buf) == 0 && check_leaf(root, buf)) {
3781 btrfs_print_leaf(root, buf);
3787 static void __btrfs_btree_balance_dirty(struct btrfs_root *root,
3791 * looks as though older kernels can get into trouble with
3792 * this code, they end up stuck in balance_dirty_pages forever
3796 if (current->flags & PF_MEMALLOC)
3800 btrfs_balance_delayed_items(root);
3802 ret = percpu_counter_compare(&root->fs_info->dirty_metadata_bytes,
3803 BTRFS_DIRTY_METADATA_THRESH);
3805 balance_dirty_pages_ratelimited(
3806 root->fs_info->btree_inode->i_mapping);
3811 void btrfs_btree_balance_dirty(struct btrfs_root *root)
3813 __btrfs_btree_balance_dirty(root, 1);
3816 void btrfs_btree_balance_dirty_nodelay(struct btrfs_root *root)
3818 __btrfs_btree_balance_dirty(root, 0);
3821 int btrfs_read_buffer(struct extent_buffer *buf, u64 parent_transid)
3823 struct btrfs_root *root = BTRFS_I(buf->pages[0]->mapping->host)->root;
3824 return btree_read_extent_buffer_pages(root, buf, 0, parent_transid);
3827 static int btrfs_check_super_valid(struct btrfs_fs_info *fs_info,
3830 struct btrfs_super_block *sb = fs_info->super_copy;
3833 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) {
3834 printk(KERN_ERR "BTRFS: tree_root level too big: %d >= %d\n",
3835 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL);
3838 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) {
3839 printk(KERN_ERR "BTRFS: chunk_root level too big: %d >= %d\n",
3840 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL);
3843 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) {
3844 printk(KERN_ERR "BTRFS: log_root level too big: %d >= %d\n",
3845 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL);
3850 * The common minimum, we don't know if we can trust the nodesize/sectorsize
3851 * items yet, they'll be verified later. Issue just a warning.
3853 if (!IS_ALIGNED(btrfs_super_root(sb), 4096))
3854 printk(KERN_WARNING "BTRFS: tree_root block unaligned: %llu\n",
3855 btrfs_super_root(sb));
3856 if (!IS_ALIGNED(btrfs_super_chunk_root(sb), 4096))
3857 printk(KERN_WARNING "BTRFS: chunk_root block unaligned: %llu\n",
3858 btrfs_super_chunk_root(sb));
3859 if (!IS_ALIGNED(btrfs_super_log_root(sb), 4096))
3860 printk(KERN_WARNING "BTRFS: log_root block unaligned: %llu\n",
3861 btrfs_super_log_root(sb));
3863 if (memcmp(fs_info->fsid, sb->dev_item.fsid, BTRFS_UUID_SIZE) != 0) {
3864 printk(KERN_ERR "BTRFS: dev_item UUID does not match fsid: %pU != %pU\n",
3865 fs_info->fsid, sb->dev_item.fsid);
3870 * Hint to catch really bogus numbers, bitflips or so, more exact checks are
3873 if (btrfs_super_num_devices(sb) > (1UL << 31))
3874 printk(KERN_WARNING "BTRFS: suspicious number of devices: %llu\n",
3875 btrfs_super_num_devices(sb));
3877 if (btrfs_super_bytenr(sb) != BTRFS_SUPER_INFO_OFFSET) {
3878 printk(KERN_ERR "BTRFS: super offset mismatch %llu != %u\n",
3879 btrfs_super_bytenr(sb), BTRFS_SUPER_INFO_OFFSET);
3884 * The generation is a global counter, we'll trust it more than the others
3885 * but it's still possible that it's the one that's wrong.
3887 if (btrfs_super_generation(sb) < btrfs_super_chunk_root_generation(sb))
3889 "BTRFS: suspicious: generation < chunk_root_generation: %llu < %llu\n",
3890 btrfs_super_generation(sb), btrfs_super_chunk_root_generation(sb));
3891 if (btrfs_super_generation(sb) < btrfs_super_cache_generation(sb)
3892 && btrfs_super_cache_generation(sb) != (u64)-1)
3894 "BTRFS: suspicious: generation < cache_generation: %llu < %llu\n",
3895 btrfs_super_generation(sb), btrfs_super_cache_generation(sb));
3900 static void btrfs_error_commit_super(struct btrfs_root *root)
3902 mutex_lock(&root->fs_info->cleaner_mutex);
3903 btrfs_run_delayed_iputs(root);
3904 mutex_unlock(&root->fs_info->cleaner_mutex);
3906 down_write(&root->fs_info->cleanup_work_sem);
3907 up_write(&root->fs_info->cleanup_work_sem);
3909 /* cleanup FS via transaction */
3910 btrfs_cleanup_transaction(root);
3913 static void btrfs_destroy_ordered_extents(struct btrfs_root *root)
3915 struct btrfs_ordered_extent *ordered;
3917 spin_lock(&root->ordered_extent_lock);
3919 * This will just short circuit the ordered completion stuff which will
3920 * make sure the ordered extent gets properly cleaned up.
3922 list_for_each_entry(ordered, &root->ordered_extents,
3924 set_bit(BTRFS_ORDERED_IOERR, &ordered->flags);
3925 spin_unlock(&root->ordered_extent_lock);
3928 static void btrfs_destroy_all_ordered_extents(struct btrfs_fs_info *fs_info)
3930 struct btrfs_root *root;
3931 struct list_head splice;
3933 INIT_LIST_HEAD(&splice);
3935 spin_lock(&fs_info->ordered_root_lock);
3936 list_splice_init(&fs_info->ordered_roots, &splice);
3937 while (!list_empty(&splice)) {
3938 root = list_first_entry(&splice, struct btrfs_root,
3940 list_move_tail(&root->ordered_root,
3941 &fs_info->ordered_roots);
3943 spin_unlock(&fs_info->ordered_root_lock);
3944 btrfs_destroy_ordered_extents(root);
3947 spin_lock(&fs_info->ordered_root_lock);
3949 spin_unlock(&fs_info->ordered_root_lock);
3952 static int btrfs_destroy_delayed_refs(struct btrfs_transaction *trans,
3953 struct btrfs_root *root)
3955 struct rb_node *node;
3956 struct btrfs_delayed_ref_root *delayed_refs;
3957 struct btrfs_delayed_ref_node *ref;
3960 delayed_refs = &trans->delayed_refs;
3962 spin_lock(&delayed_refs->lock);
3963 if (atomic_read(&delayed_refs->num_entries) == 0) {
3964 spin_unlock(&delayed_refs->lock);
3965 btrfs_info(root->fs_info, "delayed_refs has NO entry");
3969 while ((node = rb_first(&delayed_refs->href_root)) != NULL) {
3970 struct btrfs_delayed_ref_head *head;
3971 bool pin_bytes = false;
3973 head = rb_entry(node, struct btrfs_delayed_ref_head,
3975 if (!mutex_trylock(&head->mutex)) {
3976 atomic_inc(&head->node.refs);
3977 spin_unlock(&delayed_refs->lock);
3979 mutex_lock(&head->mutex);
3980 mutex_unlock(&head->mutex);
3981 btrfs_put_delayed_ref(&head->node);
3982 spin_lock(&delayed_refs->lock);
3985 spin_lock(&head->lock);
3986 while ((node = rb_first(&head->ref_root)) != NULL) {
3987 ref = rb_entry(node, struct btrfs_delayed_ref_node,
3990 rb_erase(&ref->rb_node, &head->ref_root);
3991 atomic_dec(&delayed_refs->num_entries);
3992 btrfs_put_delayed_ref(ref);
3994 if (head->must_insert_reserved)
3996 btrfs_free_delayed_extent_op(head->extent_op);
3997 delayed_refs->num_heads--;
3998 if (head->processing == 0)
3999 delayed_refs->num_heads_ready--;
4000 atomic_dec(&delayed_refs->num_entries);
4001 head->node.in_tree = 0;
4002 rb_erase(&head->href_node, &delayed_refs->href_root);
4003 spin_unlock(&head->lock);
4004 spin_unlock(&delayed_refs->lock);
4005 mutex_unlock(&head->mutex);
4008 btrfs_pin_extent(root, head->node.bytenr,
4009 head->node.num_bytes, 1);
4010 btrfs_put_delayed_ref(&head->node);
4012 spin_lock(&delayed_refs->lock);
4015 spin_unlock(&delayed_refs->lock);
4020 static void btrfs_destroy_delalloc_inodes(struct btrfs_root *root)
4022 struct btrfs_inode *btrfs_inode;
4023 struct list_head splice;
4025 INIT_LIST_HEAD(&splice);
4027 spin_lock(&root->delalloc_lock);
4028 list_splice_init(&root->delalloc_inodes, &splice);
4030 while (!list_empty(&splice)) {
4031 btrfs_inode = list_first_entry(&splice, struct btrfs_inode,
4034 list_del_init(&btrfs_inode->delalloc_inodes);
4035 clear_bit(BTRFS_INODE_IN_DELALLOC_LIST,
4036 &btrfs_inode->runtime_flags);
4037 spin_unlock(&root->delalloc_lock);
4039 btrfs_invalidate_inodes(btrfs_inode->root);
4041 spin_lock(&root->delalloc_lock);
4044 spin_unlock(&root->delalloc_lock);
4047 static void btrfs_destroy_all_delalloc_inodes(struct btrfs_fs_info *fs_info)
4049 struct btrfs_root *root;
4050 struct list_head splice;
4052 INIT_LIST_HEAD(&splice);
4054 spin_lock(&fs_info->delalloc_root_lock);
4055 list_splice_init(&fs_info->delalloc_roots, &splice);
4056 while (!list_empty(&splice)) {
4057 root = list_first_entry(&splice, struct btrfs_root,
4059 list_del_init(&root->delalloc_root);
4060 root = btrfs_grab_fs_root(root);
4062 spin_unlock(&fs_info->delalloc_root_lock);
4064 btrfs_destroy_delalloc_inodes(root);
4065 btrfs_put_fs_root(root);
4067 spin_lock(&fs_info->delalloc_root_lock);
4069 spin_unlock(&fs_info->delalloc_root_lock);
4072 static int btrfs_destroy_marked_extents(struct btrfs_root *root,
4073 struct extent_io_tree *dirty_pages,
4077 struct extent_buffer *eb;
4082 ret = find_first_extent_bit(dirty_pages, start, &start, &end,
4087 clear_extent_bits(dirty_pages, start, end, mark, GFP_NOFS);
4088 while (start <= end) {
4089 eb = btrfs_find_tree_block(root, start);
4090 start += root->nodesize;
4093 wait_on_extent_buffer_writeback(eb);
4095 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY,
4097 clear_extent_buffer_dirty(eb);
4098 free_extent_buffer_stale(eb);
4105 static int btrfs_destroy_pinned_extent(struct btrfs_root *root,
4106 struct extent_io_tree *pinned_extents)
4108 struct extent_io_tree *unpin;
4114 unpin = pinned_extents;
4117 ret = find_first_extent_bit(unpin, 0, &start, &end,
4118 EXTENT_DIRTY, NULL);
4122 clear_extent_dirty(unpin, start, end, GFP_NOFS);
4123 btrfs_error_unpin_extent_range(root, start, end);
4128 if (unpin == &root->fs_info->freed_extents[0])
4129 unpin = &root->fs_info->freed_extents[1];
4131 unpin = &root->fs_info->freed_extents[0];
4139 static void btrfs_free_pending_ordered(struct btrfs_transaction *cur_trans,
4140 struct btrfs_fs_info *fs_info)
4142 struct btrfs_ordered_extent *ordered;
4144 spin_lock(&fs_info->trans_lock);
4145 while (!list_empty(&cur_trans->pending_ordered)) {
4146 ordered = list_first_entry(&cur_trans->pending_ordered,
4147 struct btrfs_ordered_extent,
4149 list_del_init(&ordered->trans_list);
4150 spin_unlock(&fs_info->trans_lock);
4152 btrfs_put_ordered_extent(ordered);
4153 spin_lock(&fs_info->trans_lock);
4155 spin_unlock(&fs_info->trans_lock);
4158 void btrfs_cleanup_one_transaction(struct btrfs_transaction *cur_trans,
4159 struct btrfs_root *root)
4161 btrfs_destroy_delayed_refs(cur_trans, root);
4163 cur_trans->state = TRANS_STATE_COMMIT_START;
4164 wake_up(&root->fs_info->transaction_blocked_wait);
4166 cur_trans->state = TRANS_STATE_UNBLOCKED;
4167 wake_up(&root->fs_info->transaction_wait);
4169 btrfs_free_pending_ordered(cur_trans, root->fs_info);
4170 btrfs_destroy_delayed_inodes(root);
4171 btrfs_assert_delayed_root_empty(root);
4173 btrfs_destroy_marked_extents(root, &cur_trans->dirty_pages,
4175 btrfs_destroy_pinned_extent(root,
4176 root->fs_info->pinned_extents);
4178 cur_trans->state =TRANS_STATE_COMPLETED;
4179 wake_up(&cur_trans->commit_wait);
4182 memset(cur_trans, 0, sizeof(*cur_trans));
4183 kmem_cache_free(btrfs_transaction_cachep, cur_trans);
4187 static int btrfs_cleanup_transaction(struct btrfs_root *root)
4189 struct btrfs_transaction *t;
4191 mutex_lock(&root->fs_info->transaction_kthread_mutex);
4193 spin_lock(&root->fs_info->trans_lock);
4194 while (!list_empty(&root->fs_info->trans_list)) {
4195 t = list_first_entry(&root->fs_info->trans_list,
4196 struct btrfs_transaction, list);
4197 if (t->state >= TRANS_STATE_COMMIT_START) {
4198 atomic_inc(&t->use_count);
4199 spin_unlock(&root->fs_info->trans_lock);
4200 btrfs_wait_for_commit(root, t->transid);
4201 btrfs_put_transaction(t);
4202 spin_lock(&root->fs_info->trans_lock);
4205 if (t == root->fs_info->running_transaction) {
4206 t->state = TRANS_STATE_COMMIT_DOING;
4207 spin_unlock(&root->fs_info->trans_lock);
4209 * We wait for 0 num_writers since we don't hold a trans
4210 * handle open currently for this transaction.
4212 wait_event(t->writer_wait,
4213 atomic_read(&t->num_writers) == 0);
4215 spin_unlock(&root->fs_info->trans_lock);
4217 btrfs_cleanup_one_transaction(t, root);
4219 spin_lock(&root->fs_info->trans_lock);
4220 if (t == root->fs_info->running_transaction)
4221 root->fs_info->running_transaction = NULL;
4222 list_del_init(&t->list);
4223 spin_unlock(&root->fs_info->trans_lock);
4225 btrfs_put_transaction(t);
4226 trace_btrfs_transaction_commit(root);
4227 spin_lock(&root->fs_info->trans_lock);
4229 spin_unlock(&root->fs_info->trans_lock);
4230 btrfs_destroy_all_ordered_extents(root->fs_info);
4231 btrfs_destroy_delayed_inodes(root);
4232 btrfs_assert_delayed_root_empty(root);
4233 btrfs_destroy_pinned_extent(root, root->fs_info->pinned_extents);
4234 btrfs_destroy_all_delalloc_inodes(root->fs_info);
4235 mutex_unlock(&root->fs_info->transaction_kthread_mutex);
4240 static struct extent_io_ops btree_extent_io_ops = {
4241 .readpage_end_io_hook = btree_readpage_end_io_hook,
4242 .readpage_io_failed_hook = btree_io_failed_hook,
4243 .submit_bio_hook = btree_submit_bio_hook,
4244 /* note we're sharing with inode.c for the merge bio hook */
4245 .merge_bio_hook = btrfs_merge_bio_hook,