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/crc32c.h>
30 #include <linux/slab.h>
31 #include <linux/migrate.h>
32 #include <linux/ratelimit.h>
33 #include <linux/uuid.h>
34 #include <asm/unaligned.h>
38 #include "transaction.h"
39 #include "btrfs_inode.h"
41 #include "print-tree.h"
42 #include "async-thread.h"
45 #include "free-space-cache.h"
46 #include "inode-map.h"
47 #include "check-integrity.h"
48 #include "rcu-string.h"
49 #include "dev-replace.h"
53 #include <asm/cpufeature.h>
56 static struct extent_io_ops btree_extent_io_ops;
57 static void end_workqueue_fn(struct btrfs_work *work);
58 static void free_fs_root(struct btrfs_root *root);
59 static int btrfs_check_super_valid(struct btrfs_fs_info *fs_info,
61 static void btrfs_destroy_ordered_operations(struct btrfs_transaction *t,
62 struct btrfs_root *root);
63 static void btrfs_destroy_ordered_extents(struct btrfs_root *root);
64 static int btrfs_destroy_delayed_refs(struct btrfs_transaction *trans,
65 struct btrfs_root *root);
66 static void btrfs_evict_pending_snapshots(struct btrfs_transaction *t);
67 static void btrfs_destroy_delalloc_inodes(struct btrfs_root *root);
68 static int btrfs_destroy_marked_extents(struct btrfs_root *root,
69 struct extent_io_tree *dirty_pages,
71 static int btrfs_destroy_pinned_extent(struct btrfs_root *root,
72 struct extent_io_tree *pinned_extents);
75 * end_io_wq structs are used to do processing in task context when an IO is
76 * 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.
83 struct btrfs_fs_info *info;
86 struct list_head list;
87 struct btrfs_work work;
91 * async submit bios are used to offload expensive checksumming
92 * onto the worker threads. They checksum file and metadata bios
93 * just before they are sent down the IO stack.
95 struct async_submit_bio {
98 struct list_head list;
99 extent_submit_bio_hook_t *submit_bio_start;
100 extent_submit_bio_hook_t *submit_bio_done;
103 unsigned long bio_flags;
105 * bio_offset is optional, can be used if the pages in the bio
106 * can't tell us where in the file the bio should go
109 struct btrfs_work work;
114 * Lockdep class keys for extent_buffer->lock's in this root. For a given
115 * eb, the lockdep key is determined by the btrfs_root it belongs to and
116 * the level the eb occupies in the tree.
118 * Different roots are used for different purposes and may nest inside each
119 * other and they require separate keysets. As lockdep keys should be
120 * static, assign keysets according to the purpose of the root as indicated
121 * by btrfs_root->objectid. This ensures that all special purpose roots
122 * have separate keysets.
124 * Lock-nesting across peer nodes is always done with the immediate parent
125 * node locked thus preventing deadlock. As lockdep doesn't know this, use
126 * subclass to avoid triggering lockdep warning in such cases.
128 * The key is set by the readpage_end_io_hook after the buffer has passed
129 * csum validation but before the pages are unlocked. It is also set by
130 * btrfs_init_new_buffer on freshly allocated blocks.
132 * We also add a check to make sure the highest level of the tree is the
133 * same as our lockdep setup here. If BTRFS_MAX_LEVEL changes, this code
134 * needs update as well.
136 #ifdef CONFIG_DEBUG_LOCK_ALLOC
137 # if BTRFS_MAX_LEVEL != 8
141 static struct btrfs_lockdep_keyset {
142 u64 id; /* root objectid */
143 const char *name_stem; /* lock name stem */
144 char names[BTRFS_MAX_LEVEL + 1][20];
145 struct lock_class_key keys[BTRFS_MAX_LEVEL + 1];
146 } btrfs_lockdep_keysets[] = {
147 { .id = BTRFS_ROOT_TREE_OBJECTID, .name_stem = "root" },
148 { .id = BTRFS_EXTENT_TREE_OBJECTID, .name_stem = "extent" },
149 { .id = BTRFS_CHUNK_TREE_OBJECTID, .name_stem = "chunk" },
150 { .id = BTRFS_DEV_TREE_OBJECTID, .name_stem = "dev" },
151 { .id = BTRFS_FS_TREE_OBJECTID, .name_stem = "fs" },
152 { .id = BTRFS_CSUM_TREE_OBJECTID, .name_stem = "csum" },
153 { .id = BTRFS_ORPHAN_OBJECTID, .name_stem = "orphan" },
154 { .id = BTRFS_TREE_LOG_OBJECTID, .name_stem = "log" },
155 { .id = BTRFS_TREE_RELOC_OBJECTID, .name_stem = "treloc" },
156 { .id = BTRFS_DATA_RELOC_TREE_OBJECTID, .name_stem = "dreloc" },
157 { .id = 0, .name_stem = "tree" },
160 void __init btrfs_init_lockdep(void)
164 /* initialize lockdep class names */
165 for (i = 0; i < ARRAY_SIZE(btrfs_lockdep_keysets); i++) {
166 struct btrfs_lockdep_keyset *ks = &btrfs_lockdep_keysets[i];
168 for (j = 0; j < ARRAY_SIZE(ks->names); j++)
169 snprintf(ks->names[j], sizeof(ks->names[j]),
170 "btrfs-%s-%02d", ks->name_stem, j);
174 void btrfs_set_buffer_lockdep_class(u64 objectid, struct extent_buffer *eb,
177 struct btrfs_lockdep_keyset *ks;
179 BUG_ON(level >= ARRAY_SIZE(ks->keys));
181 /* find the matching keyset, id 0 is the default entry */
182 for (ks = btrfs_lockdep_keysets; ks->id; ks++)
183 if (ks->id == objectid)
186 lockdep_set_class_and_name(&eb->lock,
187 &ks->keys[level], ks->names[level]);
193 * extents on the btree inode are pretty simple, there's one extent
194 * that covers the entire device
196 static struct extent_map *btree_get_extent(struct inode *inode,
197 struct page *page, size_t pg_offset, u64 start, u64 len,
200 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
201 struct extent_map *em;
204 read_lock(&em_tree->lock);
205 em = lookup_extent_mapping(em_tree, start, len);
208 BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev;
209 read_unlock(&em_tree->lock);
212 read_unlock(&em_tree->lock);
214 em = alloc_extent_map();
216 em = ERR_PTR(-ENOMEM);
221 em->block_len = (u64)-1;
223 em->bdev = BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev;
225 write_lock(&em_tree->lock);
226 ret = add_extent_mapping(em_tree, em, 0);
227 if (ret == -EEXIST) {
229 em = lookup_extent_mapping(em_tree, start, len);
236 write_unlock(&em_tree->lock);
242 u32 btrfs_csum_data(char *data, u32 seed, size_t len)
244 return crc32c(seed, data, len);
247 void btrfs_csum_final(u32 crc, char *result)
249 put_unaligned_le32(~crc, result);
253 * compute the csum for a btree block, and either verify it or write it
254 * into the csum field of the block.
256 static int csum_tree_block(struct btrfs_root *root, struct extent_buffer *buf,
259 u16 csum_size = btrfs_super_csum_size(root->fs_info->super_copy);
262 unsigned long cur_len;
263 unsigned long offset = BTRFS_CSUM_SIZE;
265 unsigned long map_start;
266 unsigned long map_len;
269 unsigned long inline_result;
271 len = buf->len - offset;
273 err = map_private_extent_buffer(buf, offset, 32,
274 &kaddr, &map_start, &map_len);
277 cur_len = min(len, map_len - (offset - map_start));
278 crc = btrfs_csum_data(kaddr + offset - map_start,
283 if (csum_size > sizeof(inline_result)) {
284 result = kzalloc(csum_size * sizeof(char), GFP_NOFS);
288 result = (char *)&inline_result;
291 btrfs_csum_final(crc, result);
294 if (memcmp_extent_buffer(buf, result, 0, csum_size)) {
297 memcpy(&found, result, csum_size);
299 read_extent_buffer(buf, &val, 0, csum_size);
300 printk_ratelimited(KERN_INFO "btrfs: %s checksum verify "
301 "failed on %llu wanted %X found %X "
303 root->fs_info->sb->s_id,
304 (unsigned long long)buf->start, val, found,
305 btrfs_header_level(buf));
306 if (result != (char *)&inline_result)
311 write_extent_buffer(buf, result, 0, csum_size);
313 if (result != (char *)&inline_result)
319 * we can't consider a given block up to date unless the transid of the
320 * block matches the transid in the parent node's pointer. This is how we
321 * detect blocks that either didn't get written at all or got written
322 * in the wrong place.
324 static int verify_parent_transid(struct extent_io_tree *io_tree,
325 struct extent_buffer *eb, u64 parent_transid,
328 struct extent_state *cached_state = NULL;
331 if (!parent_transid || btrfs_header_generation(eb) == parent_transid)
337 lock_extent_bits(io_tree, eb->start, eb->start + eb->len - 1,
339 if (extent_buffer_uptodate(eb) &&
340 btrfs_header_generation(eb) == parent_transid) {
344 printk_ratelimited("parent transid verify failed on %llu wanted %llu "
346 (unsigned long long)eb->start,
347 (unsigned long long)parent_transid,
348 (unsigned long long)btrfs_header_generation(eb));
350 clear_extent_buffer_uptodate(eb);
352 unlock_extent_cached(io_tree, eb->start, eb->start + eb->len - 1,
353 &cached_state, GFP_NOFS);
358 * helper to read a given tree block, doing retries as required when
359 * the checksums don't match and we have alternate mirrors to try.
361 static int btree_read_extent_buffer_pages(struct btrfs_root *root,
362 struct extent_buffer *eb,
363 u64 start, u64 parent_transid)
365 struct extent_io_tree *io_tree;
370 int failed_mirror = 0;
372 clear_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags);
373 io_tree = &BTRFS_I(root->fs_info->btree_inode)->io_tree;
375 ret = read_extent_buffer_pages(io_tree, eb, start,
377 btree_get_extent, mirror_num);
379 if (!verify_parent_transid(io_tree, eb,
387 * This buffer's crc is fine, but its contents are corrupted, so
388 * there is no reason to read the other copies, they won't be
391 if (test_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags))
394 num_copies = btrfs_num_copies(root->fs_info,
399 if (!failed_mirror) {
401 failed_mirror = eb->read_mirror;
405 if (mirror_num == failed_mirror)
408 if (mirror_num > num_copies)
412 if (failed && !ret && failed_mirror)
413 repair_eb_io_failure(root, eb, failed_mirror);
419 * checksum a dirty tree block before IO. This has extra checks to make sure
420 * we only fill in the checksum field in the first page of a multi-page block
423 static int csum_dirty_buffer(struct btrfs_root *root, struct page *page)
425 struct extent_io_tree *tree;
426 u64 start = page_offset(page);
428 struct extent_buffer *eb;
430 tree = &BTRFS_I(page->mapping->host)->io_tree;
432 eb = (struct extent_buffer *)page->private;
433 if (page != eb->pages[0])
435 found_start = btrfs_header_bytenr(eb);
436 if (found_start != start) {
440 if (!PageUptodate(page)) {
444 csum_tree_block(root, eb, 0);
448 static int check_tree_block_fsid(struct btrfs_root *root,
449 struct extent_buffer *eb)
451 struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices;
452 u8 fsid[BTRFS_UUID_SIZE];
455 read_extent_buffer(eb, fsid, (unsigned long)btrfs_header_fsid(eb),
458 if (!memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE)) {
462 fs_devices = fs_devices->seed;
467 #define CORRUPT(reason, eb, root, slot) \
468 printk(KERN_CRIT "btrfs: corrupt leaf, %s: block=%llu," \
469 "root=%llu, slot=%d\n", reason, \
470 (unsigned long long)btrfs_header_bytenr(eb), \
471 (unsigned long long)root->objectid, slot)
473 static noinline int check_leaf(struct btrfs_root *root,
474 struct extent_buffer *leaf)
476 struct btrfs_key key;
477 struct btrfs_key leaf_key;
478 u32 nritems = btrfs_header_nritems(leaf);
484 /* Check the 0 item */
485 if (btrfs_item_offset_nr(leaf, 0) + btrfs_item_size_nr(leaf, 0) !=
486 BTRFS_LEAF_DATA_SIZE(root)) {
487 CORRUPT("invalid item offset size pair", leaf, root, 0);
492 * Check to make sure each items keys are in the correct order and their
493 * offsets make sense. We only have to loop through nritems-1 because
494 * we check the current slot against the next slot, which verifies the
495 * next slot's offset+size makes sense and that the current's slot
498 for (slot = 0; slot < nritems - 1; slot++) {
499 btrfs_item_key_to_cpu(leaf, &leaf_key, slot);
500 btrfs_item_key_to_cpu(leaf, &key, slot + 1);
502 /* Make sure the keys are in the right order */
503 if (btrfs_comp_cpu_keys(&leaf_key, &key) >= 0) {
504 CORRUPT("bad key order", leaf, root, slot);
509 * Make sure the offset and ends are right, remember that the
510 * item data starts at the end of the leaf and grows towards the
513 if (btrfs_item_offset_nr(leaf, slot) !=
514 btrfs_item_end_nr(leaf, slot + 1)) {
515 CORRUPT("slot offset bad", leaf, root, slot);
520 * Check to make sure that we don't point outside of the leaf,
521 * just incase all the items are consistent to eachother, but
522 * all point outside of the leaf.
524 if (btrfs_item_end_nr(leaf, slot) >
525 BTRFS_LEAF_DATA_SIZE(root)) {
526 CORRUPT("slot end outside of leaf", leaf, root, slot);
534 struct extent_buffer *find_eb_for_page(struct extent_io_tree *tree,
535 struct page *page, int max_walk)
537 struct extent_buffer *eb;
538 u64 start = page_offset(page);
542 if (start < max_walk)
545 min_start = start - max_walk;
547 while (start >= min_start) {
548 eb = find_extent_buffer(tree, start, 0);
551 * we found an extent buffer and it contains our page
554 if (eb->start <= target &&
555 eb->start + eb->len > target)
558 /* we found an extent buffer that wasn't for us */
559 free_extent_buffer(eb);
564 start -= PAGE_CACHE_SIZE;
569 static int btree_readpage_end_io_hook(struct page *page, u64 start, u64 end,
570 struct extent_state *state, int mirror)
572 struct extent_io_tree *tree;
575 struct extent_buffer *eb;
576 struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
583 tree = &BTRFS_I(page->mapping->host)->io_tree;
584 eb = (struct extent_buffer *)page->private;
586 /* the pending IO might have been the only thing that kept this buffer
587 * in memory. Make sure we have a ref for all this other checks
589 extent_buffer_get(eb);
591 reads_done = atomic_dec_and_test(&eb->io_pages);
595 eb->read_mirror = mirror;
596 if (test_bit(EXTENT_BUFFER_IOERR, &eb->bflags)) {
601 found_start = btrfs_header_bytenr(eb);
602 if (found_start != eb->start) {
603 printk_ratelimited(KERN_INFO "btrfs bad tree block start "
605 (unsigned long long)found_start,
606 (unsigned long long)eb->start);
610 if (check_tree_block_fsid(root, eb)) {
611 printk_ratelimited(KERN_INFO "btrfs bad fsid on block %llu\n",
612 (unsigned long long)eb->start);
616 found_level = btrfs_header_level(eb);
617 if (found_level >= BTRFS_MAX_LEVEL) {
618 btrfs_info(root->fs_info, "bad tree block level %d\n",
619 (int)btrfs_header_level(eb));
624 btrfs_set_buffer_lockdep_class(btrfs_header_owner(eb),
627 ret = csum_tree_block(root, eb, 1);
634 * If this is a leaf block and it is corrupt, set the corrupt bit so
635 * that we don't try and read the other copies of this block, just
638 if (found_level == 0 && check_leaf(root, eb)) {
639 set_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags);
644 set_extent_buffer_uptodate(eb);
647 test_and_clear_bit(EXTENT_BUFFER_READAHEAD, &eb->bflags))
648 btree_readahead_hook(root, eb, eb->start, ret);
652 * our io error hook is going to dec the io pages
653 * again, we have to make sure it has something
656 atomic_inc(&eb->io_pages);
657 clear_extent_buffer_uptodate(eb);
659 free_extent_buffer(eb);
664 static int btree_io_failed_hook(struct page *page, int failed_mirror)
666 struct extent_buffer *eb;
667 struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
669 eb = (struct extent_buffer *)page->private;
670 set_bit(EXTENT_BUFFER_IOERR, &eb->bflags);
671 eb->read_mirror = failed_mirror;
672 atomic_dec(&eb->io_pages);
673 if (test_and_clear_bit(EXTENT_BUFFER_READAHEAD, &eb->bflags))
674 btree_readahead_hook(root, eb, eb->start, -EIO);
675 return -EIO; /* we fixed nothing */
678 static void end_workqueue_bio(struct bio *bio, int err)
680 struct end_io_wq *end_io_wq = bio->bi_private;
681 struct btrfs_fs_info *fs_info;
683 fs_info = end_io_wq->info;
684 end_io_wq->error = err;
685 end_io_wq->work.func = end_workqueue_fn;
686 end_io_wq->work.flags = 0;
688 if (bio->bi_rw & REQ_WRITE) {
689 if (end_io_wq->metadata == BTRFS_WQ_ENDIO_METADATA)
690 btrfs_queue_worker(&fs_info->endio_meta_write_workers,
692 else if (end_io_wq->metadata == BTRFS_WQ_ENDIO_FREE_SPACE)
693 btrfs_queue_worker(&fs_info->endio_freespace_worker,
695 else if (end_io_wq->metadata == BTRFS_WQ_ENDIO_RAID56)
696 btrfs_queue_worker(&fs_info->endio_raid56_workers,
699 btrfs_queue_worker(&fs_info->endio_write_workers,
702 if (end_io_wq->metadata == BTRFS_WQ_ENDIO_RAID56)
703 btrfs_queue_worker(&fs_info->endio_raid56_workers,
705 else if (end_io_wq->metadata)
706 btrfs_queue_worker(&fs_info->endio_meta_workers,
709 btrfs_queue_worker(&fs_info->endio_workers,
715 * For the metadata arg you want
718 * 1 - if normal metadta
719 * 2 - if writing to the free space cache area
720 * 3 - raid parity work
722 int btrfs_bio_wq_end_io(struct btrfs_fs_info *info, struct bio *bio,
725 struct end_io_wq *end_io_wq;
726 end_io_wq = kmalloc(sizeof(*end_io_wq), GFP_NOFS);
730 end_io_wq->private = bio->bi_private;
731 end_io_wq->end_io = bio->bi_end_io;
732 end_io_wq->info = info;
733 end_io_wq->error = 0;
734 end_io_wq->bio = bio;
735 end_io_wq->metadata = metadata;
737 bio->bi_private = end_io_wq;
738 bio->bi_end_io = end_workqueue_bio;
742 unsigned long btrfs_async_submit_limit(struct btrfs_fs_info *info)
744 unsigned long limit = min_t(unsigned long,
745 info->workers.max_workers,
746 info->fs_devices->open_devices);
750 static void run_one_async_start(struct btrfs_work *work)
752 struct async_submit_bio *async;
755 async = container_of(work, struct async_submit_bio, work);
756 ret = async->submit_bio_start(async->inode, async->rw, async->bio,
757 async->mirror_num, async->bio_flags,
763 static void run_one_async_done(struct btrfs_work *work)
765 struct btrfs_fs_info *fs_info;
766 struct async_submit_bio *async;
769 async = container_of(work, struct async_submit_bio, work);
770 fs_info = BTRFS_I(async->inode)->root->fs_info;
772 limit = btrfs_async_submit_limit(fs_info);
773 limit = limit * 2 / 3;
775 if (atomic_dec_return(&fs_info->nr_async_submits) < limit &&
776 waitqueue_active(&fs_info->async_submit_wait))
777 wake_up(&fs_info->async_submit_wait);
779 /* If an error occured we just want to clean up the bio and move on */
781 bio_endio(async->bio, async->error);
785 async->submit_bio_done(async->inode, async->rw, async->bio,
786 async->mirror_num, async->bio_flags,
790 static void run_one_async_free(struct btrfs_work *work)
792 struct async_submit_bio *async;
794 async = container_of(work, struct async_submit_bio, work);
798 int btrfs_wq_submit_bio(struct btrfs_fs_info *fs_info, struct inode *inode,
799 int rw, struct bio *bio, int mirror_num,
800 unsigned long bio_flags,
802 extent_submit_bio_hook_t *submit_bio_start,
803 extent_submit_bio_hook_t *submit_bio_done)
805 struct async_submit_bio *async;
807 async = kmalloc(sizeof(*async), GFP_NOFS);
811 async->inode = inode;
814 async->mirror_num = mirror_num;
815 async->submit_bio_start = submit_bio_start;
816 async->submit_bio_done = submit_bio_done;
818 async->work.func = run_one_async_start;
819 async->work.ordered_func = run_one_async_done;
820 async->work.ordered_free = run_one_async_free;
822 async->work.flags = 0;
823 async->bio_flags = bio_flags;
824 async->bio_offset = bio_offset;
828 atomic_inc(&fs_info->nr_async_submits);
831 btrfs_set_work_high_prio(&async->work);
833 btrfs_queue_worker(&fs_info->workers, &async->work);
835 while (atomic_read(&fs_info->async_submit_draining) &&
836 atomic_read(&fs_info->nr_async_submits)) {
837 wait_event(fs_info->async_submit_wait,
838 (atomic_read(&fs_info->nr_async_submits) == 0));
844 static int btree_csum_one_bio(struct bio *bio)
846 struct bio_vec *bvec = bio->bi_io_vec;
848 struct btrfs_root *root;
851 WARN_ON(bio->bi_vcnt <= 0);
852 while (bio_index < bio->bi_vcnt) {
853 root = BTRFS_I(bvec->bv_page->mapping->host)->root;
854 ret = csum_dirty_buffer(root, bvec->bv_page);
863 static int __btree_submit_bio_start(struct inode *inode, int rw,
864 struct bio *bio, int mirror_num,
865 unsigned long bio_flags,
869 * when we're called for a write, we're already in the async
870 * submission context. Just jump into btrfs_map_bio
872 return btree_csum_one_bio(bio);
875 static int __btree_submit_bio_done(struct inode *inode, int rw, struct bio *bio,
876 int mirror_num, unsigned long bio_flags,
882 * when we're called for a write, we're already in the async
883 * submission context. Just jump into btrfs_map_bio
885 ret = btrfs_map_bio(BTRFS_I(inode)->root, rw, bio, mirror_num, 1);
891 static int check_async_write(struct inode *inode, unsigned long bio_flags)
893 if (bio_flags & EXTENT_BIO_TREE_LOG)
902 static int btree_submit_bio_hook(struct inode *inode, int rw, struct bio *bio,
903 int mirror_num, unsigned long bio_flags,
906 int async = check_async_write(inode, bio_flags);
909 if (!(rw & REQ_WRITE)) {
911 * called for a read, do the setup so that checksum validation
912 * can happen in the async kernel threads
914 ret = btrfs_bio_wq_end_io(BTRFS_I(inode)->root->fs_info,
918 ret = btrfs_map_bio(BTRFS_I(inode)->root, rw, bio,
921 ret = btree_csum_one_bio(bio);
924 ret = btrfs_map_bio(BTRFS_I(inode)->root, rw, bio,
928 * kthread helpers are used to submit writes so that
929 * checksumming can happen in parallel across all CPUs
931 ret = btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info,
932 inode, rw, bio, mirror_num, 0,
934 __btree_submit_bio_start,
935 __btree_submit_bio_done);
945 #ifdef CONFIG_MIGRATION
946 static int btree_migratepage(struct address_space *mapping,
947 struct page *newpage, struct page *page,
948 enum migrate_mode mode)
951 * we can't safely write a btree page from here,
952 * we haven't done the locking hook
957 * Buffers may be managed in a filesystem specific way.
958 * We must have no buffers or drop them.
960 if (page_has_private(page) &&
961 !try_to_release_page(page, GFP_KERNEL))
963 return migrate_page(mapping, newpage, page, mode);
968 static int btree_writepages(struct address_space *mapping,
969 struct writeback_control *wbc)
971 struct extent_io_tree *tree;
972 struct btrfs_fs_info *fs_info;
975 tree = &BTRFS_I(mapping->host)->io_tree;
976 if (wbc->sync_mode == WB_SYNC_NONE) {
978 if (wbc->for_kupdate)
981 fs_info = BTRFS_I(mapping->host)->root->fs_info;
982 /* this is a bit racy, but that's ok */
983 ret = percpu_counter_compare(&fs_info->dirty_metadata_bytes,
984 BTRFS_DIRTY_METADATA_THRESH);
988 return btree_write_cache_pages(mapping, wbc);
991 static int btree_readpage(struct file *file, struct page *page)
993 struct extent_io_tree *tree;
994 tree = &BTRFS_I(page->mapping->host)->io_tree;
995 return extent_read_full_page(tree, page, btree_get_extent, 0);
998 static int btree_releasepage(struct page *page, gfp_t gfp_flags)
1000 if (PageWriteback(page) || PageDirty(page))
1003 * We need to mask out eg. __GFP_HIGHMEM and __GFP_DMA32 as we're doing
1004 * slab allocation from alloc_extent_state down the callchain where
1005 * it'd hit a BUG_ON as those flags are not allowed.
1007 gfp_flags &= ~GFP_SLAB_BUG_MASK;
1009 return try_release_extent_buffer(page, gfp_flags);
1012 static void btree_invalidatepage(struct page *page, unsigned long offset)
1014 struct extent_io_tree *tree;
1015 tree = &BTRFS_I(page->mapping->host)->io_tree;
1016 extent_invalidatepage(tree, page, offset);
1017 btree_releasepage(page, GFP_NOFS);
1018 if (PagePrivate(page)) {
1019 printk(KERN_WARNING "btrfs warning page private not zero "
1020 "on page %llu\n", (unsigned long long)page_offset(page));
1021 ClearPagePrivate(page);
1022 set_page_private(page, 0);
1023 page_cache_release(page);
1027 static int btree_set_page_dirty(struct page *page)
1030 struct extent_buffer *eb;
1032 BUG_ON(!PagePrivate(page));
1033 eb = (struct extent_buffer *)page->private;
1035 BUG_ON(!test_bit(EXTENT_BUFFER_DIRTY, &eb->bflags));
1036 BUG_ON(!atomic_read(&eb->refs));
1037 btrfs_assert_tree_locked(eb);
1039 return __set_page_dirty_nobuffers(page);
1042 static const struct address_space_operations btree_aops = {
1043 .readpage = btree_readpage,
1044 .writepages = btree_writepages,
1045 .releasepage = btree_releasepage,
1046 .invalidatepage = btree_invalidatepage,
1047 #ifdef CONFIG_MIGRATION
1048 .migratepage = btree_migratepage,
1050 .set_page_dirty = btree_set_page_dirty,
1053 int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize,
1056 struct extent_buffer *buf = NULL;
1057 struct inode *btree_inode = root->fs_info->btree_inode;
1060 buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
1063 read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree,
1064 buf, 0, WAIT_NONE, btree_get_extent, 0);
1065 free_extent_buffer(buf);
1069 int reada_tree_block_flagged(struct btrfs_root *root, u64 bytenr, u32 blocksize,
1070 int mirror_num, struct extent_buffer **eb)
1072 struct extent_buffer *buf = NULL;
1073 struct inode *btree_inode = root->fs_info->btree_inode;
1074 struct extent_io_tree *io_tree = &BTRFS_I(btree_inode)->io_tree;
1077 buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
1081 set_bit(EXTENT_BUFFER_READAHEAD, &buf->bflags);
1083 ret = read_extent_buffer_pages(io_tree, buf, 0, WAIT_PAGE_LOCK,
1084 btree_get_extent, mirror_num);
1086 free_extent_buffer(buf);
1090 if (test_bit(EXTENT_BUFFER_CORRUPT, &buf->bflags)) {
1091 free_extent_buffer(buf);
1093 } else if (extent_buffer_uptodate(buf)) {
1096 free_extent_buffer(buf);
1101 struct extent_buffer *btrfs_find_tree_block(struct btrfs_root *root,
1102 u64 bytenr, u32 blocksize)
1104 struct inode *btree_inode = root->fs_info->btree_inode;
1105 struct extent_buffer *eb;
1106 eb = find_extent_buffer(&BTRFS_I(btree_inode)->io_tree,
1111 struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root,
1112 u64 bytenr, u32 blocksize)
1114 struct inode *btree_inode = root->fs_info->btree_inode;
1115 struct extent_buffer *eb;
1117 eb = alloc_extent_buffer(&BTRFS_I(btree_inode)->io_tree,
1123 int btrfs_write_tree_block(struct extent_buffer *buf)
1125 return filemap_fdatawrite_range(buf->pages[0]->mapping, buf->start,
1126 buf->start + buf->len - 1);
1129 int btrfs_wait_tree_block_writeback(struct extent_buffer *buf)
1131 return filemap_fdatawait_range(buf->pages[0]->mapping,
1132 buf->start, buf->start + buf->len - 1);
1135 struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr,
1136 u32 blocksize, u64 parent_transid)
1138 struct extent_buffer *buf = NULL;
1141 buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
1145 ret = btree_read_extent_buffer_pages(root, buf, 0, parent_transid);
1150 void clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
1151 struct extent_buffer *buf)
1153 struct btrfs_fs_info *fs_info = root->fs_info;
1155 if (btrfs_header_generation(buf) ==
1156 fs_info->running_transaction->transid) {
1157 btrfs_assert_tree_locked(buf);
1159 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, &buf->bflags)) {
1160 __percpu_counter_add(&fs_info->dirty_metadata_bytes,
1162 fs_info->dirty_metadata_batch);
1163 /* ugh, clear_extent_buffer_dirty needs to lock the page */
1164 btrfs_set_lock_blocking(buf);
1165 clear_extent_buffer_dirty(buf);
1170 static void __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize,
1171 u32 stripesize, struct btrfs_root *root,
1172 struct btrfs_fs_info *fs_info,
1176 root->commit_root = NULL;
1177 root->sectorsize = sectorsize;
1178 root->nodesize = nodesize;
1179 root->leafsize = leafsize;
1180 root->stripesize = stripesize;
1182 root->track_dirty = 0;
1184 root->orphan_item_inserted = 0;
1185 root->orphan_cleanup_state = 0;
1187 root->objectid = objectid;
1188 root->last_trans = 0;
1189 root->highest_objectid = 0;
1191 root->inode_tree = RB_ROOT;
1192 INIT_RADIX_TREE(&root->delayed_nodes_tree, GFP_ATOMIC);
1193 root->block_rsv = NULL;
1194 root->orphan_block_rsv = NULL;
1196 INIT_LIST_HEAD(&root->dirty_list);
1197 INIT_LIST_HEAD(&root->root_list);
1198 INIT_LIST_HEAD(&root->logged_list[0]);
1199 INIT_LIST_HEAD(&root->logged_list[1]);
1200 spin_lock_init(&root->orphan_lock);
1201 spin_lock_init(&root->inode_lock);
1202 spin_lock_init(&root->accounting_lock);
1203 spin_lock_init(&root->log_extents_lock[0]);
1204 spin_lock_init(&root->log_extents_lock[1]);
1205 mutex_init(&root->objectid_mutex);
1206 mutex_init(&root->log_mutex);
1207 init_waitqueue_head(&root->log_writer_wait);
1208 init_waitqueue_head(&root->log_commit_wait[0]);
1209 init_waitqueue_head(&root->log_commit_wait[1]);
1210 atomic_set(&root->log_commit[0], 0);
1211 atomic_set(&root->log_commit[1], 0);
1212 atomic_set(&root->log_writers, 0);
1213 atomic_set(&root->log_batch, 0);
1214 atomic_set(&root->orphan_inodes, 0);
1215 root->log_transid = 0;
1216 root->last_log_commit = 0;
1217 extent_io_tree_init(&root->dirty_log_pages,
1218 fs_info->btree_inode->i_mapping);
1220 memset(&root->root_key, 0, sizeof(root->root_key));
1221 memset(&root->root_item, 0, sizeof(root->root_item));
1222 memset(&root->defrag_progress, 0, sizeof(root->defrag_progress));
1223 memset(&root->root_kobj, 0, sizeof(root->root_kobj));
1224 root->defrag_trans_start = fs_info->generation;
1225 init_completion(&root->kobj_unregister);
1226 root->defrag_running = 0;
1227 root->root_key.objectid = objectid;
1230 spin_lock_init(&root->root_item_lock);
1233 static int __must_check find_and_setup_root(struct btrfs_root *tree_root,
1234 struct btrfs_fs_info *fs_info,
1236 struct btrfs_root *root)
1242 __setup_root(tree_root->nodesize, tree_root->leafsize,
1243 tree_root->sectorsize, tree_root->stripesize,
1244 root, fs_info, objectid);
1245 ret = btrfs_find_last_root(tree_root, objectid,
1246 &root->root_item, &root->root_key);
1252 generation = btrfs_root_generation(&root->root_item);
1253 blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
1254 root->commit_root = NULL;
1255 root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
1256 blocksize, generation);
1257 if (!root->node || !btrfs_buffer_uptodate(root->node, generation, 0)) {
1258 free_extent_buffer(root->node);
1262 root->commit_root = btrfs_root_node(root);
1266 static struct btrfs_root *btrfs_alloc_root(struct btrfs_fs_info *fs_info)
1268 struct btrfs_root *root = kzalloc(sizeof(*root), GFP_NOFS);
1270 root->fs_info = fs_info;
1274 struct btrfs_root *btrfs_create_tree(struct btrfs_trans_handle *trans,
1275 struct btrfs_fs_info *fs_info,
1278 struct extent_buffer *leaf;
1279 struct btrfs_root *tree_root = fs_info->tree_root;
1280 struct btrfs_root *root;
1281 struct btrfs_key key;
1286 root = btrfs_alloc_root(fs_info);
1288 return ERR_PTR(-ENOMEM);
1290 __setup_root(tree_root->nodesize, tree_root->leafsize,
1291 tree_root->sectorsize, tree_root->stripesize,
1292 root, fs_info, objectid);
1293 root->root_key.objectid = objectid;
1294 root->root_key.type = BTRFS_ROOT_ITEM_KEY;
1295 root->root_key.offset = 0;
1297 leaf = btrfs_alloc_free_block(trans, root, root->leafsize,
1298 0, objectid, NULL, 0, 0, 0);
1300 ret = PTR_ERR(leaf);
1305 bytenr = leaf->start;
1306 memset_extent_buffer(leaf, 0, 0, sizeof(struct btrfs_header));
1307 btrfs_set_header_bytenr(leaf, leaf->start);
1308 btrfs_set_header_generation(leaf, trans->transid);
1309 btrfs_set_header_backref_rev(leaf, BTRFS_MIXED_BACKREF_REV);
1310 btrfs_set_header_owner(leaf, objectid);
1313 write_extent_buffer(leaf, fs_info->fsid,
1314 (unsigned long)btrfs_header_fsid(leaf),
1316 write_extent_buffer(leaf, fs_info->chunk_tree_uuid,
1317 (unsigned long)btrfs_header_chunk_tree_uuid(leaf),
1319 btrfs_mark_buffer_dirty(leaf);
1321 root->commit_root = btrfs_root_node(root);
1322 root->track_dirty = 1;
1325 root->root_item.flags = 0;
1326 root->root_item.byte_limit = 0;
1327 btrfs_set_root_bytenr(&root->root_item, leaf->start);
1328 btrfs_set_root_generation(&root->root_item, trans->transid);
1329 btrfs_set_root_level(&root->root_item, 0);
1330 btrfs_set_root_refs(&root->root_item, 1);
1331 btrfs_set_root_used(&root->root_item, leaf->len);
1332 btrfs_set_root_last_snapshot(&root->root_item, 0);
1333 btrfs_set_root_dirid(&root->root_item, 0);
1335 memcpy(root->root_item.uuid, uuid.b, BTRFS_UUID_SIZE);
1336 root->root_item.drop_level = 0;
1338 key.objectid = objectid;
1339 key.type = BTRFS_ROOT_ITEM_KEY;
1341 ret = btrfs_insert_root(trans, tree_root, &key, &root->root_item);
1345 btrfs_tree_unlock(leaf);
1351 btrfs_tree_unlock(leaf);
1352 free_extent_buffer(leaf);
1356 return ERR_PTR(ret);
1359 static struct btrfs_root *alloc_log_tree(struct btrfs_trans_handle *trans,
1360 struct btrfs_fs_info *fs_info)
1362 struct btrfs_root *root;
1363 struct btrfs_root *tree_root = fs_info->tree_root;
1364 struct extent_buffer *leaf;
1366 root = btrfs_alloc_root(fs_info);
1368 return ERR_PTR(-ENOMEM);
1370 __setup_root(tree_root->nodesize, tree_root->leafsize,
1371 tree_root->sectorsize, tree_root->stripesize,
1372 root, fs_info, BTRFS_TREE_LOG_OBJECTID);
1374 root->root_key.objectid = BTRFS_TREE_LOG_OBJECTID;
1375 root->root_key.type = BTRFS_ROOT_ITEM_KEY;
1376 root->root_key.offset = BTRFS_TREE_LOG_OBJECTID;
1378 * log trees do not get reference counted because they go away
1379 * before a real commit is actually done. They do store pointers
1380 * to file data extents, and those reference counts still get
1381 * updated (along with back refs to the log tree).
1385 leaf = btrfs_alloc_free_block(trans, root, root->leafsize, 0,
1386 BTRFS_TREE_LOG_OBJECTID, NULL,
1390 return ERR_CAST(leaf);
1393 memset_extent_buffer(leaf, 0, 0, sizeof(struct btrfs_header));
1394 btrfs_set_header_bytenr(leaf, leaf->start);
1395 btrfs_set_header_generation(leaf, trans->transid);
1396 btrfs_set_header_backref_rev(leaf, BTRFS_MIXED_BACKREF_REV);
1397 btrfs_set_header_owner(leaf, BTRFS_TREE_LOG_OBJECTID);
1400 write_extent_buffer(root->node, root->fs_info->fsid,
1401 (unsigned long)btrfs_header_fsid(root->node),
1403 btrfs_mark_buffer_dirty(root->node);
1404 btrfs_tree_unlock(root->node);
1408 int btrfs_init_log_root_tree(struct btrfs_trans_handle *trans,
1409 struct btrfs_fs_info *fs_info)
1411 struct btrfs_root *log_root;
1413 log_root = alloc_log_tree(trans, fs_info);
1414 if (IS_ERR(log_root))
1415 return PTR_ERR(log_root);
1416 WARN_ON(fs_info->log_root_tree);
1417 fs_info->log_root_tree = log_root;
1421 int btrfs_add_log_tree(struct btrfs_trans_handle *trans,
1422 struct btrfs_root *root)
1424 struct btrfs_root *log_root;
1425 struct btrfs_inode_item *inode_item;
1427 log_root = alloc_log_tree(trans, root->fs_info);
1428 if (IS_ERR(log_root))
1429 return PTR_ERR(log_root);
1431 log_root->last_trans = trans->transid;
1432 log_root->root_key.offset = root->root_key.objectid;
1434 inode_item = &log_root->root_item.inode;
1435 inode_item->generation = cpu_to_le64(1);
1436 inode_item->size = cpu_to_le64(3);
1437 inode_item->nlink = cpu_to_le32(1);
1438 inode_item->nbytes = cpu_to_le64(root->leafsize);
1439 inode_item->mode = cpu_to_le32(S_IFDIR | 0755);
1441 btrfs_set_root_node(&log_root->root_item, log_root->node);
1443 WARN_ON(root->log_root);
1444 root->log_root = log_root;
1445 root->log_transid = 0;
1446 root->last_log_commit = 0;
1450 struct btrfs_root *btrfs_read_fs_root_no_radix(struct btrfs_root *tree_root,
1451 struct btrfs_key *location)
1453 struct btrfs_root *root;
1454 struct btrfs_fs_info *fs_info = tree_root->fs_info;
1455 struct btrfs_path *path;
1456 struct extent_buffer *l;
1462 root = btrfs_alloc_root(fs_info);
1464 return ERR_PTR(-ENOMEM);
1465 if (location->offset == (u64)-1) {
1466 ret = find_and_setup_root(tree_root, fs_info,
1467 location->objectid, root);
1470 return ERR_PTR(ret);
1475 __setup_root(tree_root->nodesize, tree_root->leafsize,
1476 tree_root->sectorsize, tree_root->stripesize,
1477 root, fs_info, location->objectid);
1479 path = btrfs_alloc_path();
1482 return ERR_PTR(-ENOMEM);
1484 ret = btrfs_search_slot(NULL, tree_root, location, path, 0, 0);
1487 slot = path->slots[0];
1488 btrfs_read_root_item(l, slot, &root->root_item);
1489 memcpy(&root->root_key, location, sizeof(*location));
1491 btrfs_free_path(path);
1496 return ERR_PTR(ret);
1499 generation = btrfs_root_generation(&root->root_item);
1500 blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
1501 root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
1502 blocksize, generation);
1503 if (!root->node || !extent_buffer_uptodate(root->node)) {
1504 ret = (!root->node) ? -ENOMEM : -EIO;
1506 free_extent_buffer(root->node);
1508 return ERR_PTR(ret);
1511 root->commit_root = btrfs_root_node(root);
1512 BUG_ON(!root->node); /* -ENOMEM */
1514 if (location->objectid != BTRFS_TREE_LOG_OBJECTID) {
1516 btrfs_check_and_init_root_item(&root->root_item);
1522 struct btrfs_root *btrfs_read_fs_root_no_name(struct btrfs_fs_info *fs_info,
1523 struct btrfs_key *location)
1525 struct btrfs_root *root;
1528 if (location->objectid == BTRFS_ROOT_TREE_OBJECTID)
1529 return fs_info->tree_root;
1530 if (location->objectid == BTRFS_EXTENT_TREE_OBJECTID)
1531 return fs_info->extent_root;
1532 if (location->objectid == BTRFS_CHUNK_TREE_OBJECTID)
1533 return fs_info->chunk_root;
1534 if (location->objectid == BTRFS_DEV_TREE_OBJECTID)
1535 return fs_info->dev_root;
1536 if (location->objectid == BTRFS_CSUM_TREE_OBJECTID)
1537 return fs_info->csum_root;
1538 if (location->objectid == BTRFS_QUOTA_TREE_OBJECTID)
1539 return fs_info->quota_root ? fs_info->quota_root :
1542 spin_lock(&fs_info->fs_roots_radix_lock);
1543 root = radix_tree_lookup(&fs_info->fs_roots_radix,
1544 (unsigned long)location->objectid);
1545 spin_unlock(&fs_info->fs_roots_radix_lock);
1549 root = btrfs_read_fs_root_no_radix(fs_info->tree_root, location);
1553 root->free_ino_ctl = kzalloc(sizeof(*root->free_ino_ctl), GFP_NOFS);
1554 root->free_ino_pinned = kzalloc(sizeof(*root->free_ino_pinned),
1556 if (!root->free_ino_pinned || !root->free_ino_ctl) {
1561 btrfs_init_free_ino_ctl(root);
1562 mutex_init(&root->fs_commit_mutex);
1563 spin_lock_init(&root->cache_lock);
1564 init_waitqueue_head(&root->cache_wait);
1566 ret = get_anon_bdev(&root->anon_dev);
1570 if (btrfs_root_refs(&root->root_item) == 0) {
1575 ret = btrfs_find_orphan_item(fs_info->tree_root, location->objectid);
1579 root->orphan_item_inserted = 1;
1581 ret = radix_tree_preload(GFP_NOFS & ~__GFP_HIGHMEM);
1585 spin_lock(&fs_info->fs_roots_radix_lock);
1586 ret = radix_tree_insert(&fs_info->fs_roots_radix,
1587 (unsigned long)root->root_key.objectid,
1592 spin_unlock(&fs_info->fs_roots_radix_lock);
1593 radix_tree_preload_end();
1595 if (ret == -EEXIST) {
1602 ret = btrfs_find_dead_roots(fs_info->tree_root,
1603 root->root_key.objectid);
1608 return ERR_PTR(ret);
1611 static int btrfs_congested_fn(void *congested_data, int bdi_bits)
1613 struct btrfs_fs_info *info = (struct btrfs_fs_info *)congested_data;
1615 struct btrfs_device *device;
1616 struct backing_dev_info *bdi;
1619 list_for_each_entry_rcu(device, &info->fs_devices->devices, dev_list) {
1622 bdi = blk_get_backing_dev_info(device->bdev);
1623 if (bdi && bdi_congested(bdi, bdi_bits)) {
1633 * If this fails, caller must call bdi_destroy() to get rid of the
1636 static int setup_bdi(struct btrfs_fs_info *info, struct backing_dev_info *bdi)
1640 bdi->capabilities = BDI_CAP_MAP_COPY;
1641 err = bdi_setup_and_register(bdi, "btrfs", BDI_CAP_MAP_COPY);
1645 bdi->ra_pages = default_backing_dev_info.ra_pages;
1646 bdi->congested_fn = btrfs_congested_fn;
1647 bdi->congested_data = info;
1652 * called by the kthread helper functions to finally call the bio end_io
1653 * functions. This is where read checksum verification actually happens
1655 static void end_workqueue_fn(struct btrfs_work *work)
1658 struct end_io_wq *end_io_wq;
1659 struct btrfs_fs_info *fs_info;
1662 end_io_wq = container_of(work, struct end_io_wq, work);
1663 bio = end_io_wq->bio;
1664 fs_info = end_io_wq->info;
1666 error = end_io_wq->error;
1667 bio->bi_private = end_io_wq->private;
1668 bio->bi_end_io = end_io_wq->end_io;
1670 bio_endio(bio, error);
1673 static int cleaner_kthread(void *arg)
1675 struct btrfs_root *root = arg;
1680 if (!(root->fs_info->sb->s_flags & MS_RDONLY) &&
1681 down_read_trylock(&root->fs_info->sb->s_umount)) {
1682 if (mutex_trylock(&root->fs_info->cleaner_mutex)) {
1683 btrfs_run_delayed_iputs(root);
1684 again = btrfs_clean_one_deleted_snapshot(root);
1685 mutex_unlock(&root->fs_info->cleaner_mutex);
1687 btrfs_run_defrag_inodes(root->fs_info);
1688 up_read(&root->fs_info->sb->s_umount);
1691 if (!try_to_freeze() && !again) {
1692 set_current_state(TASK_INTERRUPTIBLE);
1693 if (!kthread_should_stop())
1695 __set_current_state(TASK_RUNNING);
1697 } while (!kthread_should_stop());
1701 static int transaction_kthread(void *arg)
1703 struct btrfs_root *root = arg;
1704 struct btrfs_trans_handle *trans;
1705 struct btrfs_transaction *cur;
1708 unsigned long delay;
1712 cannot_commit = false;
1714 mutex_lock(&root->fs_info->transaction_kthread_mutex);
1716 spin_lock(&root->fs_info->trans_lock);
1717 cur = root->fs_info->running_transaction;
1719 spin_unlock(&root->fs_info->trans_lock);
1723 now = get_seconds();
1724 if (!cur->blocked &&
1725 (now < cur->start_time || now - cur->start_time < 30)) {
1726 spin_unlock(&root->fs_info->trans_lock);
1730 transid = cur->transid;
1731 spin_unlock(&root->fs_info->trans_lock);
1733 /* If the file system is aborted, this will always fail. */
1734 trans = btrfs_attach_transaction(root);
1735 if (IS_ERR(trans)) {
1736 if (PTR_ERR(trans) != -ENOENT)
1737 cannot_commit = true;
1740 if (transid == trans->transid) {
1741 btrfs_commit_transaction(trans, root);
1743 btrfs_end_transaction(trans, root);
1746 wake_up_process(root->fs_info->cleaner_kthread);
1747 mutex_unlock(&root->fs_info->transaction_kthread_mutex);
1749 if (!try_to_freeze()) {
1750 set_current_state(TASK_INTERRUPTIBLE);
1751 if (!kthread_should_stop() &&
1752 (!btrfs_transaction_blocked(root->fs_info) ||
1754 schedule_timeout(delay);
1755 __set_current_state(TASK_RUNNING);
1757 } while (!kthread_should_stop());
1762 * this will find the highest generation in the array of
1763 * root backups. The index of the highest array is returned,
1764 * or -1 if we can't find anything.
1766 * We check to make sure the array is valid by comparing the
1767 * generation of the latest root in the array with the generation
1768 * in the super block. If they don't match we pitch it.
1770 static int find_newest_super_backup(struct btrfs_fs_info *info, u64 newest_gen)
1773 int newest_index = -1;
1774 struct btrfs_root_backup *root_backup;
1777 for (i = 0; i < BTRFS_NUM_BACKUP_ROOTS; i++) {
1778 root_backup = info->super_copy->super_roots + i;
1779 cur = btrfs_backup_tree_root_gen(root_backup);
1780 if (cur == newest_gen)
1784 /* check to see if we actually wrapped around */
1785 if (newest_index == BTRFS_NUM_BACKUP_ROOTS - 1) {
1786 root_backup = info->super_copy->super_roots;
1787 cur = btrfs_backup_tree_root_gen(root_backup);
1788 if (cur == newest_gen)
1791 return newest_index;
1796 * find the oldest backup so we know where to store new entries
1797 * in the backup array. This will set the backup_root_index
1798 * field in the fs_info struct
1800 static void find_oldest_super_backup(struct btrfs_fs_info *info,
1803 int newest_index = -1;
1805 newest_index = find_newest_super_backup(info, newest_gen);
1806 /* if there was garbage in there, just move along */
1807 if (newest_index == -1) {
1808 info->backup_root_index = 0;
1810 info->backup_root_index = (newest_index + 1) % BTRFS_NUM_BACKUP_ROOTS;
1815 * copy all the root pointers into the super backup array.
1816 * this will bump the backup pointer by one when it is
1819 static void backup_super_roots(struct btrfs_fs_info *info)
1822 struct btrfs_root_backup *root_backup;
1825 next_backup = info->backup_root_index;
1826 last_backup = (next_backup + BTRFS_NUM_BACKUP_ROOTS - 1) %
1827 BTRFS_NUM_BACKUP_ROOTS;
1830 * just overwrite the last backup if we're at the same generation
1831 * this happens only at umount
1833 root_backup = info->super_for_commit->super_roots + last_backup;
1834 if (btrfs_backup_tree_root_gen(root_backup) ==
1835 btrfs_header_generation(info->tree_root->node))
1836 next_backup = last_backup;
1838 root_backup = info->super_for_commit->super_roots + next_backup;
1841 * make sure all of our padding and empty slots get zero filled
1842 * regardless of which ones we use today
1844 memset(root_backup, 0, sizeof(*root_backup));
1846 info->backup_root_index = (next_backup + 1) % BTRFS_NUM_BACKUP_ROOTS;
1848 btrfs_set_backup_tree_root(root_backup, info->tree_root->node->start);
1849 btrfs_set_backup_tree_root_gen(root_backup,
1850 btrfs_header_generation(info->tree_root->node));
1852 btrfs_set_backup_tree_root_level(root_backup,
1853 btrfs_header_level(info->tree_root->node));
1855 btrfs_set_backup_chunk_root(root_backup, info->chunk_root->node->start);
1856 btrfs_set_backup_chunk_root_gen(root_backup,
1857 btrfs_header_generation(info->chunk_root->node));
1858 btrfs_set_backup_chunk_root_level(root_backup,
1859 btrfs_header_level(info->chunk_root->node));
1861 btrfs_set_backup_extent_root(root_backup, info->extent_root->node->start);
1862 btrfs_set_backup_extent_root_gen(root_backup,
1863 btrfs_header_generation(info->extent_root->node));
1864 btrfs_set_backup_extent_root_level(root_backup,
1865 btrfs_header_level(info->extent_root->node));
1868 * we might commit during log recovery, which happens before we set
1869 * the fs_root. Make sure it is valid before we fill it in.
1871 if (info->fs_root && info->fs_root->node) {
1872 btrfs_set_backup_fs_root(root_backup,
1873 info->fs_root->node->start);
1874 btrfs_set_backup_fs_root_gen(root_backup,
1875 btrfs_header_generation(info->fs_root->node));
1876 btrfs_set_backup_fs_root_level(root_backup,
1877 btrfs_header_level(info->fs_root->node));
1880 btrfs_set_backup_dev_root(root_backup, info->dev_root->node->start);
1881 btrfs_set_backup_dev_root_gen(root_backup,
1882 btrfs_header_generation(info->dev_root->node));
1883 btrfs_set_backup_dev_root_level(root_backup,
1884 btrfs_header_level(info->dev_root->node));
1886 btrfs_set_backup_csum_root(root_backup, info->csum_root->node->start);
1887 btrfs_set_backup_csum_root_gen(root_backup,
1888 btrfs_header_generation(info->csum_root->node));
1889 btrfs_set_backup_csum_root_level(root_backup,
1890 btrfs_header_level(info->csum_root->node));
1892 btrfs_set_backup_total_bytes(root_backup,
1893 btrfs_super_total_bytes(info->super_copy));
1894 btrfs_set_backup_bytes_used(root_backup,
1895 btrfs_super_bytes_used(info->super_copy));
1896 btrfs_set_backup_num_devices(root_backup,
1897 btrfs_super_num_devices(info->super_copy));
1900 * if we don't copy this out to the super_copy, it won't get remembered
1901 * for the next commit
1903 memcpy(&info->super_copy->super_roots,
1904 &info->super_for_commit->super_roots,
1905 sizeof(*root_backup) * BTRFS_NUM_BACKUP_ROOTS);
1909 * this copies info out of the root backup array and back into
1910 * the in-memory super block. It is meant to help iterate through
1911 * the array, so you send it the number of backups you've already
1912 * tried and the last backup index you used.
1914 * this returns -1 when it has tried all the backups
1916 static noinline int next_root_backup(struct btrfs_fs_info *info,
1917 struct btrfs_super_block *super,
1918 int *num_backups_tried, int *backup_index)
1920 struct btrfs_root_backup *root_backup;
1921 int newest = *backup_index;
1923 if (*num_backups_tried == 0) {
1924 u64 gen = btrfs_super_generation(super);
1926 newest = find_newest_super_backup(info, gen);
1930 *backup_index = newest;
1931 *num_backups_tried = 1;
1932 } else if (*num_backups_tried == BTRFS_NUM_BACKUP_ROOTS) {
1933 /* we've tried all the backups, all done */
1936 /* jump to the next oldest backup */
1937 newest = (*backup_index + BTRFS_NUM_BACKUP_ROOTS - 1) %
1938 BTRFS_NUM_BACKUP_ROOTS;
1939 *backup_index = newest;
1940 *num_backups_tried += 1;
1942 root_backup = super->super_roots + newest;
1944 btrfs_set_super_generation(super,
1945 btrfs_backup_tree_root_gen(root_backup));
1946 btrfs_set_super_root(super, btrfs_backup_tree_root(root_backup));
1947 btrfs_set_super_root_level(super,
1948 btrfs_backup_tree_root_level(root_backup));
1949 btrfs_set_super_bytes_used(super, btrfs_backup_bytes_used(root_backup));
1952 * fixme: the total bytes and num_devices need to match or we should
1955 btrfs_set_super_total_bytes(super, btrfs_backup_total_bytes(root_backup));
1956 btrfs_set_super_num_devices(super, btrfs_backup_num_devices(root_backup));
1960 /* helper to cleanup workers */
1961 static void btrfs_stop_all_workers(struct btrfs_fs_info *fs_info)
1963 btrfs_stop_workers(&fs_info->generic_worker);
1964 btrfs_stop_workers(&fs_info->fixup_workers);
1965 btrfs_stop_workers(&fs_info->delalloc_workers);
1966 btrfs_stop_workers(&fs_info->workers);
1967 btrfs_stop_workers(&fs_info->endio_workers);
1968 btrfs_stop_workers(&fs_info->endio_meta_workers);
1969 btrfs_stop_workers(&fs_info->endio_raid56_workers);
1970 btrfs_stop_workers(&fs_info->rmw_workers);
1971 btrfs_stop_workers(&fs_info->endio_meta_write_workers);
1972 btrfs_stop_workers(&fs_info->endio_write_workers);
1973 btrfs_stop_workers(&fs_info->endio_freespace_worker);
1974 btrfs_stop_workers(&fs_info->submit_workers);
1975 btrfs_stop_workers(&fs_info->delayed_workers);
1976 btrfs_stop_workers(&fs_info->caching_workers);
1977 btrfs_stop_workers(&fs_info->readahead_workers);
1978 btrfs_stop_workers(&fs_info->flush_workers);
1981 /* helper to cleanup tree roots */
1982 static void free_root_pointers(struct btrfs_fs_info *info, int chunk_root)
1984 free_extent_buffer(info->tree_root->node);
1985 free_extent_buffer(info->tree_root->commit_root);
1986 free_extent_buffer(info->dev_root->node);
1987 free_extent_buffer(info->dev_root->commit_root);
1988 free_extent_buffer(info->extent_root->node);
1989 free_extent_buffer(info->extent_root->commit_root);
1990 free_extent_buffer(info->csum_root->node);
1991 free_extent_buffer(info->csum_root->commit_root);
1992 if (info->quota_root) {
1993 free_extent_buffer(info->quota_root->node);
1994 free_extent_buffer(info->quota_root->commit_root);
1997 info->tree_root->node = NULL;
1998 info->tree_root->commit_root = NULL;
1999 info->dev_root->node = NULL;
2000 info->dev_root->commit_root = NULL;
2001 info->extent_root->node = NULL;
2002 info->extent_root->commit_root = NULL;
2003 info->csum_root->node = NULL;
2004 info->csum_root->commit_root = NULL;
2005 if (info->quota_root) {
2006 info->quota_root->node = NULL;
2007 info->quota_root->commit_root = NULL;
2011 free_extent_buffer(info->chunk_root->node);
2012 free_extent_buffer(info->chunk_root->commit_root);
2013 info->chunk_root->node = NULL;
2014 info->chunk_root->commit_root = NULL;
2018 static void del_fs_roots(struct btrfs_fs_info *fs_info)
2021 struct btrfs_root *gang[8];
2024 while (!list_empty(&fs_info->dead_roots)) {
2025 gang[0] = list_entry(fs_info->dead_roots.next,
2026 struct btrfs_root, root_list);
2027 list_del(&gang[0]->root_list);
2029 if (gang[0]->in_radix) {
2030 btrfs_free_fs_root(fs_info, gang[0]);
2032 free_extent_buffer(gang[0]->node);
2033 free_extent_buffer(gang[0]->commit_root);
2039 ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
2044 for (i = 0; i < ret; i++)
2045 btrfs_free_fs_root(fs_info, gang[i]);
2049 int open_ctree(struct super_block *sb,
2050 struct btrfs_fs_devices *fs_devices,
2060 struct btrfs_key location;
2061 struct buffer_head *bh;
2062 struct btrfs_super_block *disk_super;
2063 struct btrfs_fs_info *fs_info = btrfs_sb(sb);
2064 struct btrfs_root *tree_root;
2065 struct btrfs_root *extent_root;
2066 struct btrfs_root *csum_root;
2067 struct btrfs_root *chunk_root;
2068 struct btrfs_root *dev_root;
2069 struct btrfs_root *quota_root;
2070 struct btrfs_root *log_tree_root;
2073 int num_backups_tried = 0;
2074 int backup_index = 0;
2076 tree_root = fs_info->tree_root = btrfs_alloc_root(fs_info);
2077 extent_root = fs_info->extent_root = btrfs_alloc_root(fs_info);
2078 csum_root = fs_info->csum_root = btrfs_alloc_root(fs_info);
2079 chunk_root = fs_info->chunk_root = btrfs_alloc_root(fs_info);
2080 dev_root = fs_info->dev_root = btrfs_alloc_root(fs_info);
2081 quota_root = fs_info->quota_root = btrfs_alloc_root(fs_info);
2083 if (!tree_root || !extent_root || !csum_root ||
2084 !chunk_root || !dev_root || !quota_root) {
2089 ret = init_srcu_struct(&fs_info->subvol_srcu);
2095 ret = setup_bdi(fs_info, &fs_info->bdi);
2101 ret = percpu_counter_init(&fs_info->dirty_metadata_bytes, 0);
2106 fs_info->dirty_metadata_batch = PAGE_CACHE_SIZE *
2107 (1 + ilog2(nr_cpu_ids));
2109 ret = percpu_counter_init(&fs_info->delalloc_bytes, 0);
2112 goto fail_dirty_metadata_bytes;
2115 fs_info->btree_inode = new_inode(sb);
2116 if (!fs_info->btree_inode) {
2118 goto fail_delalloc_bytes;
2121 mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS);
2123 INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_ATOMIC);
2124 INIT_LIST_HEAD(&fs_info->trans_list);
2125 INIT_LIST_HEAD(&fs_info->dead_roots);
2126 INIT_LIST_HEAD(&fs_info->delayed_iputs);
2127 INIT_LIST_HEAD(&fs_info->delalloc_inodes);
2128 INIT_LIST_HEAD(&fs_info->caching_block_groups);
2129 spin_lock_init(&fs_info->delalloc_lock);
2130 spin_lock_init(&fs_info->trans_lock);
2131 spin_lock_init(&fs_info->fs_roots_radix_lock);
2132 spin_lock_init(&fs_info->delayed_iput_lock);
2133 spin_lock_init(&fs_info->defrag_inodes_lock);
2134 spin_lock_init(&fs_info->free_chunk_lock);
2135 spin_lock_init(&fs_info->tree_mod_seq_lock);
2136 spin_lock_init(&fs_info->super_lock);
2137 rwlock_init(&fs_info->tree_mod_log_lock);
2138 mutex_init(&fs_info->reloc_mutex);
2139 seqlock_init(&fs_info->profiles_lock);
2141 init_completion(&fs_info->kobj_unregister);
2142 INIT_LIST_HEAD(&fs_info->dirty_cowonly_roots);
2143 INIT_LIST_HEAD(&fs_info->space_info);
2144 INIT_LIST_HEAD(&fs_info->tree_mod_seq_list);
2145 btrfs_mapping_init(&fs_info->mapping_tree);
2146 btrfs_init_block_rsv(&fs_info->global_block_rsv,
2147 BTRFS_BLOCK_RSV_GLOBAL);
2148 btrfs_init_block_rsv(&fs_info->delalloc_block_rsv,
2149 BTRFS_BLOCK_RSV_DELALLOC);
2150 btrfs_init_block_rsv(&fs_info->trans_block_rsv, BTRFS_BLOCK_RSV_TRANS);
2151 btrfs_init_block_rsv(&fs_info->chunk_block_rsv, BTRFS_BLOCK_RSV_CHUNK);
2152 btrfs_init_block_rsv(&fs_info->empty_block_rsv, BTRFS_BLOCK_RSV_EMPTY);
2153 btrfs_init_block_rsv(&fs_info->delayed_block_rsv,
2154 BTRFS_BLOCK_RSV_DELOPS);
2155 atomic_set(&fs_info->nr_async_submits, 0);
2156 atomic_set(&fs_info->async_delalloc_pages, 0);
2157 atomic_set(&fs_info->async_submit_draining, 0);
2158 atomic_set(&fs_info->nr_async_bios, 0);
2159 atomic_set(&fs_info->defrag_running, 0);
2160 atomic64_set(&fs_info->tree_mod_seq, 0);
2162 fs_info->max_inline = 8192 * 1024;
2163 fs_info->metadata_ratio = 0;
2164 fs_info->defrag_inodes = RB_ROOT;
2165 fs_info->trans_no_join = 0;
2166 fs_info->free_chunk_space = 0;
2167 fs_info->tree_mod_log = RB_ROOT;
2169 /* readahead state */
2170 INIT_RADIX_TREE(&fs_info->reada_tree, GFP_NOFS & ~__GFP_WAIT);
2171 spin_lock_init(&fs_info->reada_lock);
2173 fs_info->thread_pool_size = min_t(unsigned long,
2174 num_online_cpus() + 2, 8);
2176 INIT_LIST_HEAD(&fs_info->ordered_extents);
2177 spin_lock_init(&fs_info->ordered_extent_lock);
2178 fs_info->delayed_root = kmalloc(sizeof(struct btrfs_delayed_root),
2180 if (!fs_info->delayed_root) {
2184 btrfs_init_delayed_root(fs_info->delayed_root);
2186 mutex_init(&fs_info->scrub_lock);
2187 atomic_set(&fs_info->scrubs_running, 0);
2188 atomic_set(&fs_info->scrub_pause_req, 0);
2189 atomic_set(&fs_info->scrubs_paused, 0);
2190 atomic_set(&fs_info->scrub_cancel_req, 0);
2191 init_waitqueue_head(&fs_info->scrub_pause_wait);
2192 init_rwsem(&fs_info->scrub_super_lock);
2193 fs_info->scrub_workers_refcnt = 0;
2194 #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
2195 fs_info->check_integrity_print_mask = 0;
2198 spin_lock_init(&fs_info->balance_lock);
2199 mutex_init(&fs_info->balance_mutex);
2200 atomic_set(&fs_info->balance_running, 0);
2201 atomic_set(&fs_info->balance_pause_req, 0);
2202 atomic_set(&fs_info->balance_cancel_req, 0);
2203 fs_info->balance_ctl = NULL;
2204 init_waitqueue_head(&fs_info->balance_wait_q);
2206 sb->s_blocksize = 4096;
2207 sb->s_blocksize_bits = blksize_bits(4096);
2208 sb->s_bdi = &fs_info->bdi;
2210 fs_info->btree_inode->i_ino = BTRFS_BTREE_INODE_OBJECTID;
2211 set_nlink(fs_info->btree_inode, 1);
2213 * we set the i_size on the btree inode to the max possible int.
2214 * the real end of the address space is determined by all of
2215 * the devices in the system
2217 fs_info->btree_inode->i_size = OFFSET_MAX;
2218 fs_info->btree_inode->i_mapping->a_ops = &btree_aops;
2219 fs_info->btree_inode->i_mapping->backing_dev_info = &fs_info->bdi;
2221 RB_CLEAR_NODE(&BTRFS_I(fs_info->btree_inode)->rb_node);
2222 extent_io_tree_init(&BTRFS_I(fs_info->btree_inode)->io_tree,
2223 fs_info->btree_inode->i_mapping);
2224 BTRFS_I(fs_info->btree_inode)->io_tree.track_uptodate = 0;
2225 extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree);
2227 BTRFS_I(fs_info->btree_inode)->io_tree.ops = &btree_extent_io_ops;
2229 BTRFS_I(fs_info->btree_inode)->root = tree_root;
2230 memset(&BTRFS_I(fs_info->btree_inode)->location, 0,
2231 sizeof(struct btrfs_key));
2232 set_bit(BTRFS_INODE_DUMMY,
2233 &BTRFS_I(fs_info->btree_inode)->runtime_flags);
2234 insert_inode_hash(fs_info->btree_inode);
2236 spin_lock_init(&fs_info->block_group_cache_lock);
2237 fs_info->block_group_cache_tree = RB_ROOT;
2238 fs_info->first_logical_byte = (u64)-1;
2240 extent_io_tree_init(&fs_info->freed_extents[0],
2241 fs_info->btree_inode->i_mapping);
2242 extent_io_tree_init(&fs_info->freed_extents[1],
2243 fs_info->btree_inode->i_mapping);
2244 fs_info->pinned_extents = &fs_info->freed_extents[0];
2245 fs_info->do_barriers = 1;
2248 mutex_init(&fs_info->ordered_operations_mutex);
2249 mutex_init(&fs_info->tree_log_mutex);
2250 mutex_init(&fs_info->chunk_mutex);
2251 mutex_init(&fs_info->transaction_kthread_mutex);
2252 mutex_init(&fs_info->cleaner_mutex);
2253 mutex_init(&fs_info->volume_mutex);
2254 init_rwsem(&fs_info->extent_commit_sem);
2255 init_rwsem(&fs_info->cleanup_work_sem);
2256 init_rwsem(&fs_info->subvol_sem);
2257 fs_info->dev_replace.lock_owner = 0;
2258 atomic_set(&fs_info->dev_replace.nesting_level, 0);
2259 mutex_init(&fs_info->dev_replace.lock_finishing_cancel_unmount);
2260 mutex_init(&fs_info->dev_replace.lock_management_lock);
2261 mutex_init(&fs_info->dev_replace.lock);
2263 spin_lock_init(&fs_info->qgroup_lock);
2264 mutex_init(&fs_info->qgroup_ioctl_lock);
2265 fs_info->qgroup_tree = RB_ROOT;
2266 INIT_LIST_HEAD(&fs_info->dirty_qgroups);
2267 fs_info->qgroup_seq = 1;
2268 fs_info->quota_enabled = 0;
2269 fs_info->pending_quota_state = 0;
2271 btrfs_init_free_cluster(&fs_info->meta_alloc_cluster);
2272 btrfs_init_free_cluster(&fs_info->data_alloc_cluster);
2274 init_waitqueue_head(&fs_info->transaction_throttle);
2275 init_waitqueue_head(&fs_info->transaction_wait);
2276 init_waitqueue_head(&fs_info->transaction_blocked_wait);
2277 init_waitqueue_head(&fs_info->async_submit_wait);
2279 ret = btrfs_alloc_stripe_hash_table(fs_info);
2285 __setup_root(4096, 4096, 4096, 4096, tree_root,
2286 fs_info, BTRFS_ROOT_TREE_OBJECTID);
2288 invalidate_bdev(fs_devices->latest_bdev);
2289 bh = btrfs_read_dev_super(fs_devices->latest_bdev);
2295 memcpy(fs_info->super_copy, bh->b_data, sizeof(*fs_info->super_copy));
2296 memcpy(fs_info->super_for_commit, fs_info->super_copy,
2297 sizeof(*fs_info->super_for_commit));
2300 memcpy(fs_info->fsid, fs_info->super_copy->fsid, BTRFS_FSID_SIZE);
2302 disk_super = fs_info->super_copy;
2303 if (!btrfs_super_root(disk_super))
2306 /* check FS state, whether FS is broken. */
2307 if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_ERROR)
2308 set_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state);
2310 ret = btrfs_check_super_valid(fs_info, sb->s_flags & MS_RDONLY);
2312 printk(KERN_ERR "btrfs: superblock contains fatal errors\n");
2318 * run through our array of backup supers and setup
2319 * our ring pointer to the oldest one
2321 generation = btrfs_super_generation(disk_super);
2322 find_oldest_super_backup(fs_info, generation);
2325 * In the long term, we'll store the compression type in the super
2326 * block, and it'll be used for per file compression control.
2328 fs_info->compress_type = BTRFS_COMPRESS_ZLIB;
2330 ret = btrfs_parse_options(tree_root, options);
2336 features = btrfs_super_incompat_flags(disk_super) &
2337 ~BTRFS_FEATURE_INCOMPAT_SUPP;
2339 printk(KERN_ERR "BTRFS: couldn't mount because of "
2340 "unsupported optional features (%Lx).\n",
2341 (unsigned long long)features);
2346 if (btrfs_super_leafsize(disk_super) !=
2347 btrfs_super_nodesize(disk_super)) {
2348 printk(KERN_ERR "BTRFS: couldn't mount because metadata "
2349 "blocksizes don't match. node %d leaf %d\n",
2350 btrfs_super_nodesize(disk_super),
2351 btrfs_super_leafsize(disk_super));
2355 if (btrfs_super_leafsize(disk_super) > BTRFS_MAX_METADATA_BLOCKSIZE) {
2356 printk(KERN_ERR "BTRFS: couldn't mount because metadata "
2357 "blocksize (%d) was too large\n",
2358 btrfs_super_leafsize(disk_super));
2363 features = btrfs_super_incompat_flags(disk_super);
2364 features |= BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF;
2365 if (tree_root->fs_info->compress_type == BTRFS_COMPRESS_LZO)
2366 features |= BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO;
2368 if (features & BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA)
2369 printk(KERN_ERR "btrfs: has skinny extents\n");
2372 * flag our filesystem as having big metadata blocks if
2373 * they are bigger than the page size
2375 if (btrfs_super_leafsize(disk_super) > PAGE_CACHE_SIZE) {
2376 if (!(features & BTRFS_FEATURE_INCOMPAT_BIG_METADATA))
2377 printk(KERN_INFO "btrfs flagging fs with big metadata feature\n");
2378 features |= BTRFS_FEATURE_INCOMPAT_BIG_METADATA;
2381 nodesize = btrfs_super_nodesize(disk_super);
2382 leafsize = btrfs_super_leafsize(disk_super);
2383 sectorsize = btrfs_super_sectorsize(disk_super);
2384 stripesize = btrfs_super_stripesize(disk_super);
2385 fs_info->dirty_metadata_batch = leafsize * (1 + ilog2(nr_cpu_ids));
2386 fs_info->delalloc_batch = sectorsize * 512 * (1 + ilog2(nr_cpu_ids));
2389 * mixed block groups end up with duplicate but slightly offset
2390 * extent buffers for the same range. It leads to corruptions
2392 if ((features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS) &&
2393 (sectorsize != leafsize)) {
2394 printk(KERN_WARNING "btrfs: unequal leaf/node/sector sizes "
2395 "are not allowed for mixed block groups on %s\n",
2401 * Needn't use the lock because there is no other task which will
2404 btrfs_set_super_incompat_flags(disk_super, features);
2406 features = btrfs_super_compat_ro_flags(disk_super) &
2407 ~BTRFS_FEATURE_COMPAT_RO_SUPP;
2408 if (!(sb->s_flags & MS_RDONLY) && features) {
2409 printk(KERN_ERR "BTRFS: couldn't mount RDWR because of "
2410 "unsupported option features (%Lx).\n",
2411 (unsigned long long)features);
2416 btrfs_init_workers(&fs_info->generic_worker,
2417 "genwork", 1, NULL);
2419 btrfs_init_workers(&fs_info->workers, "worker",
2420 fs_info->thread_pool_size,
2421 &fs_info->generic_worker);
2423 btrfs_init_workers(&fs_info->delalloc_workers, "delalloc",
2424 fs_info->thread_pool_size,
2425 &fs_info->generic_worker);
2427 btrfs_init_workers(&fs_info->flush_workers, "flush_delalloc",
2428 fs_info->thread_pool_size,
2429 &fs_info->generic_worker);
2431 btrfs_init_workers(&fs_info->submit_workers, "submit",
2432 min_t(u64, fs_devices->num_devices,
2433 fs_info->thread_pool_size),
2434 &fs_info->generic_worker);
2436 btrfs_init_workers(&fs_info->caching_workers, "cache",
2437 2, &fs_info->generic_worker);
2439 /* a higher idle thresh on the submit workers makes it much more
2440 * likely that bios will be send down in a sane order to the
2443 fs_info->submit_workers.idle_thresh = 64;
2445 fs_info->workers.idle_thresh = 16;
2446 fs_info->workers.ordered = 1;
2448 fs_info->delalloc_workers.idle_thresh = 2;
2449 fs_info->delalloc_workers.ordered = 1;
2451 btrfs_init_workers(&fs_info->fixup_workers, "fixup", 1,
2452 &fs_info->generic_worker);
2453 btrfs_init_workers(&fs_info->endio_workers, "endio",
2454 fs_info->thread_pool_size,
2455 &fs_info->generic_worker);
2456 btrfs_init_workers(&fs_info->endio_meta_workers, "endio-meta",
2457 fs_info->thread_pool_size,
2458 &fs_info->generic_worker);
2459 btrfs_init_workers(&fs_info->endio_meta_write_workers,
2460 "endio-meta-write", fs_info->thread_pool_size,
2461 &fs_info->generic_worker);
2462 btrfs_init_workers(&fs_info->endio_raid56_workers,
2463 "endio-raid56", fs_info->thread_pool_size,
2464 &fs_info->generic_worker);
2465 btrfs_init_workers(&fs_info->rmw_workers,
2466 "rmw", fs_info->thread_pool_size,
2467 &fs_info->generic_worker);
2468 btrfs_init_workers(&fs_info->endio_write_workers, "endio-write",
2469 fs_info->thread_pool_size,
2470 &fs_info->generic_worker);
2471 btrfs_init_workers(&fs_info->endio_freespace_worker, "freespace-write",
2472 1, &fs_info->generic_worker);
2473 btrfs_init_workers(&fs_info->delayed_workers, "delayed-meta",
2474 fs_info->thread_pool_size,
2475 &fs_info->generic_worker);
2476 btrfs_init_workers(&fs_info->readahead_workers, "readahead",
2477 fs_info->thread_pool_size,
2478 &fs_info->generic_worker);
2481 * endios are largely parallel and should have a very
2484 fs_info->endio_workers.idle_thresh = 4;
2485 fs_info->endio_meta_workers.idle_thresh = 4;
2486 fs_info->endio_raid56_workers.idle_thresh = 4;
2487 fs_info->rmw_workers.idle_thresh = 2;
2489 fs_info->endio_write_workers.idle_thresh = 2;
2490 fs_info->endio_meta_write_workers.idle_thresh = 2;
2491 fs_info->readahead_workers.idle_thresh = 2;
2494 * btrfs_start_workers can really only fail because of ENOMEM so just
2495 * return -ENOMEM if any of these fail.
2497 ret = btrfs_start_workers(&fs_info->workers);
2498 ret |= btrfs_start_workers(&fs_info->generic_worker);
2499 ret |= btrfs_start_workers(&fs_info->submit_workers);
2500 ret |= btrfs_start_workers(&fs_info->delalloc_workers);
2501 ret |= btrfs_start_workers(&fs_info->fixup_workers);
2502 ret |= btrfs_start_workers(&fs_info->endio_workers);
2503 ret |= btrfs_start_workers(&fs_info->endio_meta_workers);
2504 ret |= btrfs_start_workers(&fs_info->rmw_workers);
2505 ret |= btrfs_start_workers(&fs_info->endio_raid56_workers);
2506 ret |= btrfs_start_workers(&fs_info->endio_meta_write_workers);
2507 ret |= btrfs_start_workers(&fs_info->endio_write_workers);
2508 ret |= btrfs_start_workers(&fs_info->endio_freespace_worker);
2509 ret |= btrfs_start_workers(&fs_info->delayed_workers);
2510 ret |= btrfs_start_workers(&fs_info->caching_workers);
2511 ret |= btrfs_start_workers(&fs_info->readahead_workers);
2512 ret |= btrfs_start_workers(&fs_info->flush_workers);
2515 goto fail_sb_buffer;
2518 fs_info->bdi.ra_pages *= btrfs_super_num_devices(disk_super);
2519 fs_info->bdi.ra_pages = max(fs_info->bdi.ra_pages,
2520 4 * 1024 * 1024 / PAGE_CACHE_SIZE);
2522 tree_root->nodesize = nodesize;
2523 tree_root->leafsize = leafsize;
2524 tree_root->sectorsize = sectorsize;
2525 tree_root->stripesize = stripesize;
2527 sb->s_blocksize = sectorsize;
2528 sb->s_blocksize_bits = blksize_bits(sectorsize);
2530 if (disk_super->magic != cpu_to_le64(BTRFS_MAGIC)) {
2531 printk(KERN_INFO "btrfs: valid FS not found on %s\n", sb->s_id);
2532 goto fail_sb_buffer;
2535 if (sectorsize != PAGE_SIZE) {
2536 printk(KERN_WARNING "btrfs: Incompatible sector size(%lu) "
2537 "found on %s\n", (unsigned long)sectorsize, sb->s_id);
2538 goto fail_sb_buffer;
2541 mutex_lock(&fs_info->chunk_mutex);
2542 ret = btrfs_read_sys_array(tree_root);
2543 mutex_unlock(&fs_info->chunk_mutex);
2545 printk(KERN_WARNING "btrfs: failed to read the system "
2546 "array on %s\n", sb->s_id);
2547 goto fail_sb_buffer;
2550 blocksize = btrfs_level_size(tree_root,
2551 btrfs_super_chunk_root_level(disk_super));
2552 generation = btrfs_super_chunk_root_generation(disk_super);
2554 __setup_root(nodesize, leafsize, sectorsize, stripesize,
2555 chunk_root, fs_info, BTRFS_CHUNK_TREE_OBJECTID);
2557 chunk_root->node = read_tree_block(chunk_root,
2558 btrfs_super_chunk_root(disk_super),
2559 blocksize, generation);
2560 if (!chunk_root->node ||
2561 !test_bit(EXTENT_BUFFER_UPTODATE, &chunk_root->node->bflags)) {
2562 printk(KERN_WARNING "btrfs: failed to read chunk root on %s\n",
2564 goto fail_tree_roots;
2566 btrfs_set_root_node(&chunk_root->root_item, chunk_root->node);
2567 chunk_root->commit_root = btrfs_root_node(chunk_root);
2569 read_extent_buffer(chunk_root->node, fs_info->chunk_tree_uuid,
2570 (unsigned long)btrfs_header_chunk_tree_uuid(chunk_root->node),
2573 ret = btrfs_read_chunk_tree(chunk_root);
2575 printk(KERN_WARNING "btrfs: failed to read chunk tree on %s\n",
2577 goto fail_tree_roots;
2581 * keep the device that is marked to be the target device for the
2582 * dev_replace procedure
2584 btrfs_close_extra_devices(fs_info, fs_devices, 0);
2586 if (!fs_devices->latest_bdev) {
2587 printk(KERN_CRIT "btrfs: failed to read devices on %s\n",
2589 goto fail_tree_roots;
2593 blocksize = btrfs_level_size(tree_root,
2594 btrfs_super_root_level(disk_super));
2595 generation = btrfs_super_generation(disk_super);
2597 tree_root->node = read_tree_block(tree_root,
2598 btrfs_super_root(disk_super),
2599 blocksize, generation);
2600 if (!tree_root->node ||
2601 !test_bit(EXTENT_BUFFER_UPTODATE, &tree_root->node->bflags)) {
2602 printk(KERN_WARNING "btrfs: failed to read tree root on %s\n",
2605 goto recovery_tree_root;
2608 btrfs_set_root_node(&tree_root->root_item, tree_root->node);
2609 tree_root->commit_root = btrfs_root_node(tree_root);
2611 ret = find_and_setup_root(tree_root, fs_info,
2612 BTRFS_EXTENT_TREE_OBJECTID, extent_root);
2614 goto recovery_tree_root;
2615 extent_root->track_dirty = 1;
2617 ret = find_and_setup_root(tree_root, fs_info,
2618 BTRFS_DEV_TREE_OBJECTID, dev_root);
2620 goto recovery_tree_root;
2621 dev_root->track_dirty = 1;
2623 ret = find_and_setup_root(tree_root, fs_info,
2624 BTRFS_CSUM_TREE_OBJECTID, csum_root);
2626 goto recovery_tree_root;
2627 csum_root->track_dirty = 1;
2629 ret = find_and_setup_root(tree_root, fs_info,
2630 BTRFS_QUOTA_TREE_OBJECTID, quota_root);
2633 quota_root = fs_info->quota_root = NULL;
2635 quota_root->track_dirty = 1;
2636 fs_info->quota_enabled = 1;
2637 fs_info->pending_quota_state = 1;
2640 fs_info->generation = generation;
2641 fs_info->last_trans_committed = generation;
2643 ret = btrfs_recover_balance(fs_info);
2645 printk(KERN_WARNING "btrfs: failed to recover balance\n");
2646 goto fail_block_groups;
2649 ret = btrfs_init_dev_stats(fs_info);
2651 printk(KERN_ERR "btrfs: failed to init dev_stats: %d\n",
2653 goto fail_block_groups;
2656 ret = btrfs_init_dev_replace(fs_info);
2658 pr_err("btrfs: failed to init dev_replace: %d\n", ret);
2659 goto fail_block_groups;
2662 btrfs_close_extra_devices(fs_info, fs_devices, 1);
2664 ret = btrfs_init_space_info(fs_info);
2666 printk(KERN_ERR "Failed to initial space info: %d\n", ret);
2667 goto fail_block_groups;
2670 ret = btrfs_read_block_groups(extent_root);
2672 printk(KERN_ERR "Failed to read block groups: %d\n", ret);
2673 goto fail_block_groups;
2675 fs_info->num_tolerated_disk_barrier_failures =
2676 btrfs_calc_num_tolerated_disk_barrier_failures(fs_info);
2677 if (fs_info->fs_devices->missing_devices >
2678 fs_info->num_tolerated_disk_barrier_failures &&
2679 !(sb->s_flags & MS_RDONLY)) {
2681 "Btrfs: too many missing devices, writeable mount is not allowed\n");
2682 goto fail_block_groups;
2685 fs_info->cleaner_kthread = kthread_run(cleaner_kthread, tree_root,
2687 if (IS_ERR(fs_info->cleaner_kthread))
2688 goto fail_block_groups;
2690 fs_info->transaction_kthread = kthread_run(transaction_kthread,
2692 "btrfs-transaction");
2693 if (IS_ERR(fs_info->transaction_kthread))
2696 if (!btrfs_test_opt(tree_root, SSD) &&
2697 !btrfs_test_opt(tree_root, NOSSD) &&
2698 !fs_info->fs_devices->rotating) {
2699 printk(KERN_INFO "Btrfs detected SSD devices, enabling SSD "
2701 btrfs_set_opt(fs_info->mount_opt, SSD);
2704 #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
2705 if (btrfs_test_opt(tree_root, CHECK_INTEGRITY)) {
2706 ret = btrfsic_mount(tree_root, fs_devices,
2707 btrfs_test_opt(tree_root,
2708 CHECK_INTEGRITY_INCLUDING_EXTENT_DATA) ?
2710 fs_info->check_integrity_print_mask);
2712 printk(KERN_WARNING "btrfs: failed to initialize"
2713 " integrity check module %s\n", sb->s_id);
2716 ret = btrfs_read_qgroup_config(fs_info);
2718 goto fail_trans_kthread;
2720 /* do not make disk changes in broken FS */
2721 if (btrfs_super_log_root(disk_super) != 0) {
2722 u64 bytenr = btrfs_super_log_root(disk_super);
2724 if (fs_devices->rw_devices == 0) {
2725 printk(KERN_WARNING "Btrfs log replay required "
2731 btrfs_level_size(tree_root,
2732 btrfs_super_log_root_level(disk_super));
2734 log_tree_root = btrfs_alloc_root(fs_info);
2735 if (!log_tree_root) {
2740 __setup_root(nodesize, leafsize, sectorsize, stripesize,
2741 log_tree_root, fs_info, BTRFS_TREE_LOG_OBJECTID);
2743 log_tree_root->node = read_tree_block(tree_root, bytenr,
2746 if (!log_tree_root->node ||
2747 !extent_buffer_uptodate(log_tree_root->node)) {
2748 printk(KERN_ERR "btrfs: failed to read log tree\n");
2749 free_extent_buffer(log_tree_root->node);
2750 kfree(log_tree_root);
2751 goto fail_trans_kthread;
2753 /* returns with log_tree_root freed on success */
2754 ret = btrfs_recover_log_trees(log_tree_root);
2756 btrfs_error(tree_root->fs_info, ret,
2757 "Failed to recover log tree");
2758 free_extent_buffer(log_tree_root->node);
2759 kfree(log_tree_root);
2760 goto fail_trans_kthread;
2763 if (sb->s_flags & MS_RDONLY) {
2764 ret = btrfs_commit_super(tree_root);
2766 goto fail_trans_kthread;
2770 ret = btrfs_find_orphan_roots(tree_root);
2772 goto fail_trans_kthread;
2774 if (!(sb->s_flags & MS_RDONLY)) {
2775 ret = btrfs_cleanup_fs_roots(fs_info);
2777 goto fail_trans_kthread;
2779 ret = btrfs_recover_relocation(tree_root);
2782 "btrfs: failed to recover relocation\n");
2788 location.objectid = BTRFS_FS_TREE_OBJECTID;
2789 location.type = BTRFS_ROOT_ITEM_KEY;
2790 location.offset = (u64)-1;
2792 fs_info->fs_root = btrfs_read_fs_root_no_name(fs_info, &location);
2793 if (!fs_info->fs_root)
2795 if (IS_ERR(fs_info->fs_root)) {
2796 err = PTR_ERR(fs_info->fs_root);
2800 if (sb->s_flags & MS_RDONLY)
2803 down_read(&fs_info->cleanup_work_sem);
2804 if ((ret = btrfs_orphan_cleanup(fs_info->fs_root)) ||
2805 (ret = btrfs_orphan_cleanup(fs_info->tree_root))) {
2806 up_read(&fs_info->cleanup_work_sem);
2807 close_ctree(tree_root);
2810 up_read(&fs_info->cleanup_work_sem);
2812 ret = btrfs_resume_balance_async(fs_info);
2814 printk(KERN_WARNING "btrfs: failed to resume balance\n");
2815 close_ctree(tree_root);
2819 ret = btrfs_resume_dev_replace_async(fs_info);
2821 pr_warn("btrfs: failed to resume dev_replace\n");
2822 close_ctree(tree_root);
2829 btrfs_free_qgroup_config(fs_info);
2831 kthread_stop(fs_info->transaction_kthread);
2832 del_fs_roots(fs_info);
2833 btrfs_cleanup_transaction(fs_info->tree_root);
2835 kthread_stop(fs_info->cleaner_kthread);
2838 * make sure we're done with the btree inode before we stop our
2841 filemap_write_and_wait(fs_info->btree_inode->i_mapping);
2844 btrfs_put_block_group_cache(fs_info);
2845 btrfs_free_block_groups(fs_info);
2848 free_root_pointers(fs_info, 1);
2849 invalidate_inode_pages2(fs_info->btree_inode->i_mapping);
2852 btrfs_stop_all_workers(fs_info);
2855 btrfs_mapping_tree_free(&fs_info->mapping_tree);
2857 iput(fs_info->btree_inode);
2858 fail_delalloc_bytes:
2859 percpu_counter_destroy(&fs_info->delalloc_bytes);
2860 fail_dirty_metadata_bytes:
2861 percpu_counter_destroy(&fs_info->dirty_metadata_bytes);
2863 bdi_destroy(&fs_info->bdi);
2865 cleanup_srcu_struct(&fs_info->subvol_srcu);
2867 btrfs_free_stripe_hash_table(fs_info);
2868 btrfs_close_devices(fs_info->fs_devices);
2872 if (!btrfs_test_opt(tree_root, RECOVERY))
2873 goto fail_tree_roots;
2875 free_root_pointers(fs_info, 0);
2877 /* don't use the log in recovery mode, it won't be valid */
2878 btrfs_set_super_log_root(disk_super, 0);
2880 /* we can't trust the free space cache either */
2881 btrfs_set_opt(fs_info->mount_opt, CLEAR_CACHE);
2883 ret = next_root_backup(fs_info, fs_info->super_copy,
2884 &num_backups_tried, &backup_index);
2886 goto fail_block_groups;
2887 goto retry_root_backup;
2890 static void btrfs_end_buffer_write_sync(struct buffer_head *bh, int uptodate)
2893 set_buffer_uptodate(bh);
2895 struct btrfs_device *device = (struct btrfs_device *)
2898 printk_ratelimited_in_rcu(KERN_WARNING "lost page write due to "
2899 "I/O error on %s\n",
2900 rcu_str_deref(device->name));
2901 /* note, we dont' set_buffer_write_io_error because we have
2902 * our own ways of dealing with the IO errors
2904 clear_buffer_uptodate(bh);
2905 btrfs_dev_stat_inc_and_print(device, BTRFS_DEV_STAT_WRITE_ERRS);
2911 struct buffer_head *btrfs_read_dev_super(struct block_device *bdev)
2913 struct buffer_head *bh;
2914 struct buffer_head *latest = NULL;
2915 struct btrfs_super_block *super;
2920 /* we would like to check all the supers, but that would make
2921 * a btrfs mount succeed after a mkfs from a different FS.
2922 * So, we need to add a special mount option to scan for
2923 * later supers, using BTRFS_SUPER_MIRROR_MAX instead
2925 for (i = 0; i < 1; i++) {
2926 bytenr = btrfs_sb_offset(i);
2927 if (bytenr + 4096 >= i_size_read(bdev->bd_inode))
2929 bh = __bread(bdev, bytenr / 4096, 4096);
2933 super = (struct btrfs_super_block *)bh->b_data;
2934 if (btrfs_super_bytenr(super) != bytenr ||
2935 super->magic != cpu_to_le64(BTRFS_MAGIC)) {
2940 if (!latest || btrfs_super_generation(super) > transid) {
2943 transid = btrfs_super_generation(super);
2952 * this should be called twice, once with wait == 0 and
2953 * once with wait == 1. When wait == 0 is done, all the buffer heads
2954 * we write are pinned.
2956 * They are released when wait == 1 is done.
2957 * max_mirrors must be the same for both runs, and it indicates how
2958 * many supers on this one device should be written.
2960 * max_mirrors == 0 means to write them all.
2962 static int write_dev_supers(struct btrfs_device *device,
2963 struct btrfs_super_block *sb,
2964 int do_barriers, int wait, int max_mirrors)
2966 struct buffer_head *bh;
2973 if (max_mirrors == 0)
2974 max_mirrors = BTRFS_SUPER_MIRROR_MAX;
2976 for (i = 0; i < max_mirrors; i++) {
2977 bytenr = btrfs_sb_offset(i);
2978 if (bytenr + BTRFS_SUPER_INFO_SIZE >= device->total_bytes)
2982 bh = __find_get_block(device->bdev, bytenr / 4096,
2983 BTRFS_SUPER_INFO_SIZE);
2986 if (!buffer_uptodate(bh))
2989 /* drop our reference */
2992 /* drop the reference from the wait == 0 run */
2996 btrfs_set_super_bytenr(sb, bytenr);
2999 crc = btrfs_csum_data((char *)sb +
3000 BTRFS_CSUM_SIZE, crc,
3001 BTRFS_SUPER_INFO_SIZE -
3003 btrfs_csum_final(crc, sb->csum);
3006 * one reference for us, and we leave it for the
3009 bh = __getblk(device->bdev, bytenr / 4096,
3010 BTRFS_SUPER_INFO_SIZE);
3011 memcpy(bh->b_data, sb, BTRFS_SUPER_INFO_SIZE);
3013 /* one reference for submit_bh */
3016 set_buffer_uptodate(bh);
3018 bh->b_end_io = btrfs_end_buffer_write_sync;
3019 bh->b_private = device;
3023 * we fua the first super. The others we allow
3026 ret = btrfsic_submit_bh(WRITE_FUA, bh);
3030 return errors < i ? 0 : -1;
3034 * endio for the write_dev_flush, this will wake anyone waiting
3035 * for the barrier when it is done
3037 static void btrfs_end_empty_barrier(struct bio *bio, int err)
3040 if (err == -EOPNOTSUPP)
3041 set_bit(BIO_EOPNOTSUPP, &bio->bi_flags);
3042 clear_bit(BIO_UPTODATE, &bio->bi_flags);
3044 if (bio->bi_private)
3045 complete(bio->bi_private);
3050 * trigger flushes for one the devices. If you pass wait == 0, the flushes are
3051 * sent down. With wait == 1, it waits for the previous flush.
3053 * any device where the flush fails with eopnotsupp are flagged as not-barrier
3056 static int write_dev_flush(struct btrfs_device *device, int wait)
3061 if (device->nobarriers)
3065 bio = device->flush_bio;
3069 wait_for_completion(&device->flush_wait);
3071 if (bio_flagged(bio, BIO_EOPNOTSUPP)) {
3072 printk_in_rcu("btrfs: disabling barriers on dev %s\n",
3073 rcu_str_deref(device->name));
3074 device->nobarriers = 1;
3075 } else if (!bio_flagged(bio, BIO_UPTODATE)) {
3077 btrfs_dev_stat_inc_and_print(device,
3078 BTRFS_DEV_STAT_FLUSH_ERRS);
3081 /* drop the reference from the wait == 0 run */
3083 device->flush_bio = NULL;
3089 * one reference for us, and we leave it for the
3092 device->flush_bio = NULL;
3093 bio = bio_alloc(GFP_NOFS, 0);
3097 bio->bi_end_io = btrfs_end_empty_barrier;
3098 bio->bi_bdev = device->bdev;
3099 init_completion(&device->flush_wait);
3100 bio->bi_private = &device->flush_wait;
3101 device->flush_bio = bio;
3104 btrfsic_submit_bio(WRITE_FLUSH, bio);
3110 * send an empty flush down to each device in parallel,
3111 * then wait for them
3113 static int barrier_all_devices(struct btrfs_fs_info *info)
3115 struct list_head *head;
3116 struct btrfs_device *dev;
3117 int errors_send = 0;
3118 int errors_wait = 0;
3121 /* send down all the barriers */
3122 head = &info->fs_devices->devices;
3123 list_for_each_entry_rcu(dev, head, dev_list) {
3128 if (!dev->in_fs_metadata || !dev->writeable)
3131 ret = write_dev_flush(dev, 0);
3136 /* wait for all the barriers */
3137 list_for_each_entry_rcu(dev, head, dev_list) {
3142 if (!dev->in_fs_metadata || !dev->writeable)
3145 ret = write_dev_flush(dev, 1);
3149 if (errors_send > info->num_tolerated_disk_barrier_failures ||
3150 errors_wait > info->num_tolerated_disk_barrier_failures)
3155 int btrfs_calc_num_tolerated_disk_barrier_failures(
3156 struct btrfs_fs_info *fs_info)
3158 struct btrfs_ioctl_space_info space;
3159 struct btrfs_space_info *sinfo;
3160 u64 types[] = {BTRFS_BLOCK_GROUP_DATA,
3161 BTRFS_BLOCK_GROUP_SYSTEM,
3162 BTRFS_BLOCK_GROUP_METADATA,
3163 BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA};
3167 int num_tolerated_disk_barrier_failures =
3168 (int)fs_info->fs_devices->num_devices;
3170 for (i = 0; i < num_types; i++) {
3171 struct btrfs_space_info *tmp;
3175 list_for_each_entry_rcu(tmp, &fs_info->space_info, list) {
3176 if (tmp->flags == types[i]) {
3186 down_read(&sinfo->groups_sem);
3187 for (c = 0; c < BTRFS_NR_RAID_TYPES; c++) {
3188 if (!list_empty(&sinfo->block_groups[c])) {
3191 btrfs_get_block_group_info(
3192 &sinfo->block_groups[c], &space);
3193 if (space.total_bytes == 0 ||
3194 space.used_bytes == 0)
3196 flags = space.flags;
3199 * 0: if dup, single or RAID0 is configured for
3200 * any of metadata, system or data, else
3201 * 1: if RAID5 is configured, or if RAID1 or
3202 * RAID10 is configured and only two mirrors
3204 * 2: if RAID6 is configured, else
3205 * num_mirrors - 1: if RAID1 or RAID10 is
3206 * configured and more than
3207 * 2 mirrors are used.
3209 if (num_tolerated_disk_barrier_failures > 0 &&
3210 ((flags & (BTRFS_BLOCK_GROUP_DUP |
3211 BTRFS_BLOCK_GROUP_RAID0)) ||
3212 ((flags & BTRFS_BLOCK_GROUP_PROFILE_MASK)
3214 num_tolerated_disk_barrier_failures = 0;
3215 else if (num_tolerated_disk_barrier_failures > 1) {
3216 if (flags & (BTRFS_BLOCK_GROUP_RAID1 |
3217 BTRFS_BLOCK_GROUP_RAID5 |
3218 BTRFS_BLOCK_GROUP_RAID10)) {
3219 num_tolerated_disk_barrier_failures = 1;
3221 BTRFS_BLOCK_GROUP_RAID5) {
3222 num_tolerated_disk_barrier_failures = 2;
3227 up_read(&sinfo->groups_sem);
3230 return num_tolerated_disk_barrier_failures;
3233 int write_all_supers(struct btrfs_root *root, int max_mirrors)
3235 struct list_head *head;
3236 struct btrfs_device *dev;
3237 struct btrfs_super_block *sb;
3238 struct btrfs_dev_item *dev_item;
3242 int total_errors = 0;
3245 max_errors = btrfs_super_num_devices(root->fs_info->super_copy) - 1;
3246 do_barriers = !btrfs_test_opt(root, NOBARRIER);
3247 backup_super_roots(root->fs_info);
3249 sb = root->fs_info->super_for_commit;
3250 dev_item = &sb->dev_item;
3252 mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
3253 head = &root->fs_info->fs_devices->devices;
3256 ret = barrier_all_devices(root->fs_info);
3259 &root->fs_info->fs_devices->device_list_mutex);
3260 btrfs_error(root->fs_info, ret,
3261 "errors while submitting device barriers.");
3266 list_for_each_entry_rcu(dev, head, dev_list) {
3271 if (!dev->in_fs_metadata || !dev->writeable)
3274 btrfs_set_stack_device_generation(dev_item, 0);
3275 btrfs_set_stack_device_type(dev_item, dev->type);
3276 btrfs_set_stack_device_id(dev_item, dev->devid);
3277 btrfs_set_stack_device_total_bytes(dev_item, dev->total_bytes);
3278 btrfs_set_stack_device_bytes_used(dev_item, dev->bytes_used);
3279 btrfs_set_stack_device_io_align(dev_item, dev->io_align);
3280 btrfs_set_stack_device_io_width(dev_item, dev->io_width);
3281 btrfs_set_stack_device_sector_size(dev_item, dev->sector_size);
3282 memcpy(dev_item->uuid, dev->uuid, BTRFS_UUID_SIZE);
3283 memcpy(dev_item->fsid, dev->fs_devices->fsid, BTRFS_UUID_SIZE);
3285 flags = btrfs_super_flags(sb);
3286 btrfs_set_super_flags(sb, flags | BTRFS_HEADER_FLAG_WRITTEN);
3288 ret = write_dev_supers(dev, sb, do_barriers, 0, max_mirrors);
3292 if (total_errors > max_errors) {
3293 printk(KERN_ERR "btrfs: %d errors while writing supers\n",
3296 /* This shouldn't happen. FUA is masked off if unsupported */
3301 list_for_each_entry_rcu(dev, head, dev_list) {
3304 if (!dev->in_fs_metadata || !dev->writeable)
3307 ret = write_dev_supers(dev, sb, do_barriers, 1, max_mirrors);
3311 mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
3312 if (total_errors > max_errors) {
3313 btrfs_error(root->fs_info, -EIO,
3314 "%d errors while writing supers", total_errors);
3320 int write_ctree_super(struct btrfs_trans_handle *trans,
3321 struct btrfs_root *root, int max_mirrors)
3325 ret = write_all_supers(root, max_mirrors);
3329 void btrfs_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root)
3331 spin_lock(&fs_info->fs_roots_radix_lock);
3332 radix_tree_delete(&fs_info->fs_roots_radix,
3333 (unsigned long)root->root_key.objectid);
3334 spin_unlock(&fs_info->fs_roots_radix_lock);
3336 if (btrfs_root_refs(&root->root_item) == 0)
3337 synchronize_srcu(&fs_info->subvol_srcu);
3339 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) {
3340 btrfs_free_log(NULL, root);
3341 btrfs_free_log_root_tree(NULL, fs_info);
3344 __btrfs_remove_free_space_cache(root->free_ino_pinned);
3345 __btrfs_remove_free_space_cache(root->free_ino_ctl);
3349 static void free_fs_root(struct btrfs_root *root)
3351 iput(root->cache_inode);
3352 WARN_ON(!RB_EMPTY_ROOT(&root->inode_tree));
3354 free_anon_bdev(root->anon_dev);
3355 free_extent_buffer(root->node);
3356 free_extent_buffer(root->commit_root);
3357 kfree(root->free_ino_ctl);
3358 kfree(root->free_ino_pinned);
3363 int btrfs_cleanup_fs_roots(struct btrfs_fs_info *fs_info)
3365 u64 root_objectid = 0;
3366 struct btrfs_root *gang[8];
3371 ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
3372 (void **)gang, root_objectid,
3377 root_objectid = gang[ret - 1]->root_key.objectid + 1;
3378 for (i = 0; i < ret; i++) {
3381 root_objectid = gang[i]->root_key.objectid;
3382 err = btrfs_orphan_cleanup(gang[i]);
3391 int btrfs_commit_super(struct btrfs_root *root)
3393 struct btrfs_trans_handle *trans;
3396 mutex_lock(&root->fs_info->cleaner_mutex);
3397 btrfs_run_delayed_iputs(root);
3398 mutex_unlock(&root->fs_info->cleaner_mutex);
3399 wake_up_process(root->fs_info->cleaner_kthread);
3401 /* wait until ongoing cleanup work done */
3402 down_write(&root->fs_info->cleanup_work_sem);
3403 up_write(&root->fs_info->cleanup_work_sem);
3405 trans = btrfs_join_transaction(root);
3407 return PTR_ERR(trans);
3408 ret = btrfs_commit_transaction(trans, root);
3411 /* run commit again to drop the original snapshot */
3412 trans = btrfs_join_transaction(root);
3414 return PTR_ERR(trans);
3415 ret = btrfs_commit_transaction(trans, root);
3418 ret = btrfs_write_and_wait_transaction(NULL, root);
3420 btrfs_error(root->fs_info, ret,
3421 "Failed to sync btree inode to disk.");
3425 ret = write_ctree_super(NULL, root, 0);
3429 int close_ctree(struct btrfs_root *root)
3431 struct btrfs_fs_info *fs_info = root->fs_info;
3434 fs_info->closing = 1;
3437 /* pause restriper - we want to resume on mount */
3438 btrfs_pause_balance(fs_info);
3440 btrfs_dev_replace_suspend_for_unmount(fs_info);
3442 btrfs_scrub_cancel(fs_info);
3444 /* wait for any defraggers to finish */
3445 wait_event(fs_info->transaction_wait,
3446 (atomic_read(&fs_info->defrag_running) == 0));
3448 /* clear out the rbtree of defraggable inodes */
3449 btrfs_cleanup_defrag_inodes(fs_info);
3451 if (!(fs_info->sb->s_flags & MS_RDONLY)) {
3452 ret = btrfs_commit_super(root);
3454 printk(KERN_ERR "btrfs: commit super ret %d\n", ret);
3457 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state))
3458 btrfs_error_commit_super(root);
3460 btrfs_put_block_group_cache(fs_info);
3462 kthread_stop(fs_info->transaction_kthread);
3463 kthread_stop(fs_info->cleaner_kthread);
3465 fs_info->closing = 2;
3468 btrfs_free_qgroup_config(root->fs_info);
3470 if (percpu_counter_sum(&fs_info->delalloc_bytes)) {
3471 printk(KERN_INFO "btrfs: at unmount delalloc count %lld\n",
3472 percpu_counter_sum(&fs_info->delalloc_bytes));
3475 free_root_pointers(fs_info, 1);
3477 btrfs_free_block_groups(fs_info);
3479 del_fs_roots(fs_info);
3481 iput(fs_info->btree_inode);
3483 btrfs_stop_all_workers(fs_info);
3485 #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
3486 if (btrfs_test_opt(root, CHECK_INTEGRITY))
3487 btrfsic_unmount(root, fs_info->fs_devices);
3490 btrfs_close_devices(fs_info->fs_devices);
3491 btrfs_mapping_tree_free(&fs_info->mapping_tree);
3493 percpu_counter_destroy(&fs_info->dirty_metadata_bytes);
3494 percpu_counter_destroy(&fs_info->delalloc_bytes);
3495 bdi_destroy(&fs_info->bdi);
3496 cleanup_srcu_struct(&fs_info->subvol_srcu);
3498 btrfs_free_stripe_hash_table(fs_info);
3503 int btrfs_buffer_uptodate(struct extent_buffer *buf, u64 parent_transid,
3507 struct inode *btree_inode = buf->pages[0]->mapping->host;
3509 ret = extent_buffer_uptodate(buf);
3513 ret = verify_parent_transid(&BTRFS_I(btree_inode)->io_tree, buf,
3514 parent_transid, atomic);
3520 int btrfs_set_buffer_uptodate(struct extent_buffer *buf)
3522 return set_extent_buffer_uptodate(buf);
3525 void btrfs_mark_buffer_dirty(struct extent_buffer *buf)
3527 struct btrfs_root *root = BTRFS_I(buf->pages[0]->mapping->host)->root;
3528 u64 transid = btrfs_header_generation(buf);
3531 btrfs_assert_tree_locked(buf);
3532 if (transid != root->fs_info->generation)
3533 WARN(1, KERN_CRIT "btrfs transid mismatch buffer %llu, "
3534 "found %llu running %llu\n",
3535 (unsigned long long)buf->start,
3536 (unsigned long long)transid,
3537 (unsigned long long)root->fs_info->generation);
3538 was_dirty = set_extent_buffer_dirty(buf);
3540 __percpu_counter_add(&root->fs_info->dirty_metadata_bytes,
3542 root->fs_info->dirty_metadata_batch);
3545 static void __btrfs_btree_balance_dirty(struct btrfs_root *root,
3549 * looks as though older kernels can get into trouble with
3550 * this code, they end up stuck in balance_dirty_pages forever
3554 if (current->flags & PF_MEMALLOC)
3558 btrfs_balance_delayed_items(root);
3560 ret = percpu_counter_compare(&root->fs_info->dirty_metadata_bytes,
3561 BTRFS_DIRTY_METADATA_THRESH);
3563 balance_dirty_pages_ratelimited(
3564 root->fs_info->btree_inode->i_mapping);
3569 void btrfs_btree_balance_dirty(struct btrfs_root *root)
3571 __btrfs_btree_balance_dirty(root, 1);
3574 void btrfs_btree_balance_dirty_nodelay(struct btrfs_root *root)
3576 __btrfs_btree_balance_dirty(root, 0);
3579 int btrfs_read_buffer(struct extent_buffer *buf, u64 parent_transid)
3581 struct btrfs_root *root = BTRFS_I(buf->pages[0]->mapping->host)->root;
3582 return btree_read_extent_buffer_pages(root, buf, 0, parent_transid);
3585 static int btrfs_check_super_valid(struct btrfs_fs_info *fs_info,
3588 if (btrfs_super_csum_type(fs_info->super_copy) >= ARRAY_SIZE(btrfs_csum_sizes)) {
3589 printk(KERN_ERR "btrfs: unsupported checksum algorithm\n");
3599 void btrfs_error_commit_super(struct btrfs_root *root)
3601 mutex_lock(&root->fs_info->cleaner_mutex);
3602 btrfs_run_delayed_iputs(root);
3603 mutex_unlock(&root->fs_info->cleaner_mutex);
3605 down_write(&root->fs_info->cleanup_work_sem);
3606 up_write(&root->fs_info->cleanup_work_sem);
3608 /* cleanup FS via transaction */
3609 btrfs_cleanup_transaction(root);
3612 static void btrfs_destroy_ordered_operations(struct btrfs_transaction *t,
3613 struct btrfs_root *root)
3615 struct btrfs_inode *btrfs_inode;
3616 struct list_head splice;
3618 INIT_LIST_HEAD(&splice);
3620 mutex_lock(&root->fs_info->ordered_operations_mutex);
3621 spin_lock(&root->fs_info->ordered_extent_lock);
3623 list_splice_init(&t->ordered_operations, &splice);
3624 while (!list_empty(&splice)) {
3625 btrfs_inode = list_entry(splice.next, struct btrfs_inode,
3626 ordered_operations);
3628 list_del_init(&btrfs_inode->ordered_operations);
3630 btrfs_invalidate_inodes(btrfs_inode->root);
3633 spin_unlock(&root->fs_info->ordered_extent_lock);
3634 mutex_unlock(&root->fs_info->ordered_operations_mutex);
3637 static void btrfs_destroy_ordered_extents(struct btrfs_root *root)
3639 struct btrfs_ordered_extent *ordered;
3641 spin_lock(&root->fs_info->ordered_extent_lock);
3643 * This will just short circuit the ordered completion stuff which will
3644 * make sure the ordered extent gets properly cleaned up.
3646 list_for_each_entry(ordered, &root->fs_info->ordered_extents,
3648 set_bit(BTRFS_ORDERED_IOERR, &ordered->flags);
3649 spin_unlock(&root->fs_info->ordered_extent_lock);
3652 int btrfs_destroy_delayed_refs(struct btrfs_transaction *trans,
3653 struct btrfs_root *root)
3655 struct rb_node *node;
3656 struct btrfs_delayed_ref_root *delayed_refs;
3657 struct btrfs_delayed_ref_node *ref;
3660 delayed_refs = &trans->delayed_refs;
3662 spin_lock(&delayed_refs->lock);
3663 if (delayed_refs->num_entries == 0) {
3664 spin_unlock(&delayed_refs->lock);
3665 printk(KERN_INFO "delayed_refs has NO entry\n");
3669 while ((node = rb_first(&delayed_refs->root)) != NULL) {
3670 struct btrfs_delayed_ref_head *head = NULL;
3672 ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
3673 atomic_set(&ref->refs, 1);
3674 if (btrfs_delayed_ref_is_head(ref)) {
3676 head = btrfs_delayed_node_to_head(ref);
3677 if (!mutex_trylock(&head->mutex)) {
3678 atomic_inc(&ref->refs);
3679 spin_unlock(&delayed_refs->lock);
3681 /* Need to wait for the delayed ref to run */
3682 mutex_lock(&head->mutex);
3683 mutex_unlock(&head->mutex);
3684 btrfs_put_delayed_ref(ref);
3686 spin_lock(&delayed_refs->lock);
3690 if (head->must_insert_reserved)
3691 btrfs_pin_extent(root, ref->bytenr,
3693 btrfs_free_delayed_extent_op(head->extent_op);
3694 delayed_refs->num_heads--;
3695 if (list_empty(&head->cluster))
3696 delayed_refs->num_heads_ready--;
3697 list_del_init(&head->cluster);
3701 rb_erase(&ref->rb_node, &delayed_refs->root);
3702 delayed_refs->num_entries--;
3704 mutex_unlock(&head->mutex);
3705 spin_unlock(&delayed_refs->lock);
3706 btrfs_put_delayed_ref(ref);
3709 spin_lock(&delayed_refs->lock);
3712 spin_unlock(&delayed_refs->lock);
3717 static void btrfs_evict_pending_snapshots(struct btrfs_transaction *t)
3719 struct btrfs_pending_snapshot *snapshot;
3720 struct list_head splice;
3722 INIT_LIST_HEAD(&splice);
3724 list_splice_init(&t->pending_snapshots, &splice);
3726 while (!list_empty(&splice)) {
3727 snapshot = list_entry(splice.next,
3728 struct btrfs_pending_snapshot,
3730 snapshot->error = -ECANCELED;
3731 list_del_init(&snapshot->list);
3735 static void btrfs_destroy_delalloc_inodes(struct btrfs_root *root)
3737 struct btrfs_inode *btrfs_inode;
3738 struct list_head splice;
3740 INIT_LIST_HEAD(&splice);
3742 spin_lock(&root->fs_info->delalloc_lock);
3743 list_splice_init(&root->fs_info->delalloc_inodes, &splice);
3745 while (!list_empty(&splice)) {
3746 btrfs_inode = list_entry(splice.next, struct btrfs_inode,
3749 list_del_init(&btrfs_inode->delalloc_inodes);
3750 clear_bit(BTRFS_INODE_IN_DELALLOC_LIST,
3751 &btrfs_inode->runtime_flags);
3753 btrfs_invalidate_inodes(btrfs_inode->root);
3756 spin_unlock(&root->fs_info->delalloc_lock);
3759 static int btrfs_destroy_marked_extents(struct btrfs_root *root,
3760 struct extent_io_tree *dirty_pages,
3764 struct extent_buffer *eb;
3769 ret = find_first_extent_bit(dirty_pages, start, &start, &end,
3774 clear_extent_bits(dirty_pages, start, end, mark, GFP_NOFS);
3775 while (start <= end) {
3776 eb = btrfs_find_tree_block(root, start,
3781 wait_on_extent_buffer_writeback(eb);
3783 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY,
3785 clear_extent_buffer_dirty(eb);
3786 free_extent_buffer_stale(eb);
3793 static int btrfs_destroy_pinned_extent(struct btrfs_root *root,
3794 struct extent_io_tree *pinned_extents)
3796 struct extent_io_tree *unpin;
3802 unpin = pinned_extents;
3805 ret = find_first_extent_bit(unpin, 0, &start, &end,
3806 EXTENT_DIRTY, NULL);
3811 if (btrfs_test_opt(root, DISCARD))
3812 ret = btrfs_error_discard_extent(root, start,
3816 clear_extent_dirty(unpin, start, end, GFP_NOFS);
3817 btrfs_error_unpin_extent_range(root, start, end);
3822 if (unpin == &root->fs_info->freed_extents[0])
3823 unpin = &root->fs_info->freed_extents[1];
3825 unpin = &root->fs_info->freed_extents[0];
3833 void btrfs_cleanup_one_transaction(struct btrfs_transaction *cur_trans,
3834 struct btrfs_root *root)
3836 btrfs_destroy_delayed_refs(cur_trans, root);
3837 btrfs_block_rsv_release(root, &root->fs_info->trans_block_rsv,
3838 cur_trans->dirty_pages.dirty_bytes);
3840 /* FIXME: cleanup wait for commit */
3841 cur_trans->in_commit = 1;
3842 cur_trans->blocked = 1;
3843 wake_up(&root->fs_info->transaction_blocked_wait);
3845 btrfs_evict_pending_snapshots(cur_trans);
3847 cur_trans->blocked = 0;
3848 wake_up(&root->fs_info->transaction_wait);
3850 cur_trans->commit_done = 1;
3851 wake_up(&cur_trans->commit_wait);
3853 btrfs_destroy_delayed_inodes(root);
3854 btrfs_assert_delayed_root_empty(root);
3856 btrfs_destroy_marked_extents(root, &cur_trans->dirty_pages,
3858 btrfs_destroy_pinned_extent(root,
3859 root->fs_info->pinned_extents);
3862 memset(cur_trans, 0, sizeof(*cur_trans));
3863 kmem_cache_free(btrfs_transaction_cachep, cur_trans);
3867 int btrfs_cleanup_transaction(struct btrfs_root *root)
3869 struct btrfs_transaction *t;
3872 mutex_lock(&root->fs_info->transaction_kthread_mutex);
3874 spin_lock(&root->fs_info->trans_lock);
3875 list_splice_init(&root->fs_info->trans_list, &list);
3876 root->fs_info->trans_no_join = 1;
3877 spin_unlock(&root->fs_info->trans_lock);
3879 while (!list_empty(&list)) {
3880 t = list_entry(list.next, struct btrfs_transaction, list);
3882 btrfs_destroy_ordered_operations(t, root);
3884 btrfs_destroy_ordered_extents(root);
3886 btrfs_destroy_delayed_refs(t, root);
3888 /* FIXME: cleanup wait for commit */
3892 if (waitqueue_active(&root->fs_info->transaction_blocked_wait))
3893 wake_up(&root->fs_info->transaction_blocked_wait);
3895 btrfs_evict_pending_snapshots(t);
3899 if (waitqueue_active(&root->fs_info->transaction_wait))
3900 wake_up(&root->fs_info->transaction_wait);
3904 if (waitqueue_active(&t->commit_wait))
3905 wake_up(&t->commit_wait);
3907 btrfs_destroy_delayed_inodes(root);
3908 btrfs_assert_delayed_root_empty(root);
3910 btrfs_destroy_delalloc_inodes(root);
3912 spin_lock(&root->fs_info->trans_lock);
3913 root->fs_info->running_transaction = NULL;
3914 spin_unlock(&root->fs_info->trans_lock);
3916 btrfs_destroy_marked_extents(root, &t->dirty_pages,
3919 btrfs_destroy_pinned_extent(root,
3920 root->fs_info->pinned_extents);
3922 atomic_set(&t->use_count, 0);
3923 list_del_init(&t->list);
3924 memset(t, 0, sizeof(*t));
3925 kmem_cache_free(btrfs_transaction_cachep, t);
3928 spin_lock(&root->fs_info->trans_lock);
3929 root->fs_info->trans_no_join = 0;
3930 spin_unlock(&root->fs_info->trans_lock);
3931 mutex_unlock(&root->fs_info->transaction_kthread_mutex);
3936 static struct extent_io_ops btree_extent_io_ops = {
3937 .readpage_end_io_hook = btree_readpage_end_io_hook,
3938 .readpage_io_failed_hook = btree_io_failed_hook,
3939 .submit_bio_hook = btree_submit_bio_hook,
3940 /* note we're sharing with inode.c for the merge bio hook */
3941 .merge_bio_hook = btrfs_merge_bio_hook,