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/crc32c.h>
22 #include <linux/scatterlist.h>
23 #include <linux/swap.h>
24 #include <linux/radix-tree.h>
25 #include <linux/writeback.h>
26 #include <linux/buffer_head.h> // for block_sync_page
29 #include "transaction.h"
30 #include "btrfs_inode.h"
31 #include "print-tree.h"
34 static int check_tree_block(struct btrfs_root
*root
, struct extent_buffer
*buf
)
36 if (extent_buffer_blocknr(buf
) != btrfs_header_blocknr(buf
)) {
37 printk(KERN_CRIT
"buf blocknr(buf) is %llu, header is %llu\n",
38 (unsigned long long)extent_buffer_blocknr(buf
),
39 (unsigned long long)btrfs_header_blocknr(buf
));
46 static struct extent_io_ops btree_extent_io_ops
;
48 struct extent_buffer
*btrfs_find_tree_block(struct btrfs_root
*root
,
49 u64 bytenr
, u32 blocksize
)
51 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
52 struct extent_buffer
*eb
;
53 eb
= find_extent_buffer(&BTRFS_I(btree_inode
)->io_tree
,
54 bytenr
, blocksize
, GFP_NOFS
);
58 struct extent_buffer
*btrfs_find_create_tree_block(struct btrfs_root
*root
,
59 u64 bytenr
, u32 blocksize
)
61 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
62 struct extent_buffer
*eb
;
64 eb
= alloc_extent_buffer(&BTRFS_I(btree_inode
)->io_tree
,
65 bytenr
, blocksize
, NULL
, GFP_NOFS
);
69 struct extent_map
*btree_get_extent(struct inode
*inode
, struct page
*page
,
70 size_t page_offset
, u64 start
, u64 len
,
73 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
74 struct extent_map
*em
;
78 spin_lock(&em_tree
->lock
);
79 em
= lookup_extent_mapping(em_tree
, start
, len
);
80 spin_unlock(&em_tree
->lock
);
84 em
= alloc_extent_map(GFP_NOFS
);
86 em
= ERR_PTR(-ENOMEM
);
90 em
->len
= i_size_read(inode
);
92 em
->bdev
= inode
->i_sb
->s_bdev
;
94 spin_lock(&em_tree
->lock
);
95 ret
= add_extent_mapping(em_tree
, em
);
96 spin_unlock(&em_tree
->lock
);
109 u32
btrfs_csum_data(struct btrfs_root
*root
, char *data
, u32 seed
, size_t len
)
111 return crc32c(seed
, data
, len
);
114 void btrfs_csum_final(u32 crc
, char *result
)
116 *(__le32
*)result
= ~cpu_to_le32(crc
);
119 static int csum_tree_block(struct btrfs_root
*root
, struct extent_buffer
*buf
,
122 char result
[BTRFS_CRC32_SIZE
];
124 unsigned long cur_len
;
125 unsigned long offset
= BTRFS_CSUM_SIZE
;
126 char *map_token
= NULL
;
128 unsigned long map_start
;
129 unsigned long map_len
;
133 len
= buf
->len
- offset
;
135 err
= map_private_extent_buffer(buf
, offset
, 32,
137 &map_start
, &map_len
, KM_USER0
);
139 printk("failed to map extent buffer! %lu\n",
143 cur_len
= min(len
, map_len
- (offset
- map_start
));
144 crc
= btrfs_csum_data(root
, kaddr
+ offset
- map_start
,
148 unmap_extent_buffer(buf
, map_token
, KM_USER0
);
150 btrfs_csum_final(crc
, result
);
153 int from_this_trans
= 0;
155 if (root
->fs_info
->running_transaction
&&
156 btrfs_header_generation(buf
) ==
157 root
->fs_info
->running_transaction
->transid
)
160 /* FIXME, this is not good */
161 if (from_this_trans
== 0 &&
162 memcmp_extent_buffer(buf
, result
, 0, BTRFS_CRC32_SIZE
)) {
165 memcpy(&found
, result
, BTRFS_CRC32_SIZE
);
167 read_extent_buffer(buf
, &val
, 0, BTRFS_CRC32_SIZE
);
168 printk("btrfs: %s checksum verify failed on %llu "
169 "wanted %X found %X from_this_trans %d\n",
170 root
->fs_info
->sb
->s_id
,
171 buf
->start
, val
, found
, from_this_trans
);
175 write_extent_buffer(buf
, result
, 0, BTRFS_CRC32_SIZE
);
181 int csum_dirty_buffer(struct btrfs_root
*root
, struct page
*page
)
183 struct extent_io_tree
*tree
;
184 u64 start
= (u64
)page
->index
<< PAGE_CACHE_SHIFT
;
188 struct extent_buffer
*eb
;
189 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
191 if (page
->private == EXTENT_PAGE_PRIVATE
)
195 len
= page
->private >> 2;
199 eb
= alloc_extent_buffer(tree
, start
, len
, page
, GFP_NOFS
);
200 read_extent_buffer_pages(tree
, eb
, start
+ PAGE_CACHE_SIZE
, 1);
201 btrfs_clear_buffer_defrag(eb
);
202 found_start
= btrfs_header_bytenr(eb
);
203 if (found_start
!= start
) {
204 printk("warning: eb start incorrect %Lu buffer %Lu len %lu\n",
205 start
, found_start
, len
);
209 if (eb
->first_page
!= page
) {
210 printk("bad first page %lu %lu\n", eb
->first_page
->index
,
215 if (!PageUptodate(page
)) {
216 printk("csum not up to date page %lu\n", page
->index
);
220 found_level
= btrfs_header_level(eb
);
221 csum_tree_block(root
, eb
, 0);
223 free_extent_buffer(eb
);
228 static int btree_writepage_io_hook(struct page
*page
, u64 start
, u64 end
)
230 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
232 csum_dirty_buffer(root
, page
);
236 static int btree_writepage(struct page
*page
, struct writeback_control
*wbc
)
238 struct extent_io_tree
*tree
;
239 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
240 return extent_write_full_page(tree
, page
, btree_get_extent
, wbc
);
243 static int btree_writepages(struct address_space
*mapping
,
244 struct writeback_control
*wbc
)
246 struct extent_io_tree
*tree
;
247 tree
= &BTRFS_I(mapping
->host
)->io_tree
;
248 if (wbc
->sync_mode
== WB_SYNC_NONE
) {
251 unsigned long thresh
= 96 * 1024 * 1024;
253 if (wbc
->for_kupdate
)
256 if (current_is_pdflush()) {
257 thresh
= 96 * 1024 * 1024;
259 thresh
= 8 * 1024 * 1024;
261 num_dirty
= count_range_bits(tree
, &start
, (u64
)-1,
262 thresh
, EXTENT_DIRTY
);
263 if (num_dirty
< thresh
) {
267 return extent_writepages(tree
, mapping
, btree_get_extent
, wbc
);
270 int btree_readpage(struct file
*file
, struct page
*page
)
272 struct extent_io_tree
*tree
;
273 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
274 return extent_read_full_page(tree
, page
, btree_get_extent
);
277 static int btree_releasepage(struct page
*page
, gfp_t gfp_flags
)
279 struct extent_io_tree
*tree
;
280 struct extent_map_tree
*map
;
283 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
284 map
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
285 ret
= try_release_extent_mapping(map
, tree
, page
, gfp_flags
);
287 ClearPagePrivate(page
);
288 set_page_private(page
, 0);
289 page_cache_release(page
);
294 static void btree_invalidatepage(struct page
*page
, unsigned long offset
)
296 struct extent_io_tree
*tree
;
297 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
298 extent_invalidatepage(tree
, page
, offset
);
299 btree_releasepage(page
, GFP_NOFS
);
303 static int btree_writepage(struct page
*page
, struct writeback_control
*wbc
)
305 struct buffer_head
*bh
;
306 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
307 struct buffer_head
*head
;
308 if (!page_has_buffers(page
)) {
309 create_empty_buffers(page
, root
->fs_info
->sb
->s_blocksize
,
310 (1 << BH_Dirty
)|(1 << BH_Uptodate
));
312 head
= page_buffers(page
);
315 if (buffer_dirty(bh
))
316 csum_tree_block(root
, bh
, 0);
317 bh
= bh
->b_this_page
;
318 } while (bh
!= head
);
319 return block_write_full_page(page
, btree_get_block
, wbc
);
323 static struct address_space_operations btree_aops
= {
324 .readpage
= btree_readpage
,
325 .writepage
= btree_writepage
,
326 .writepages
= btree_writepages
,
327 .releasepage
= btree_releasepage
,
328 .invalidatepage
= btree_invalidatepage
,
329 .sync_page
= block_sync_page
,
332 int readahead_tree_block(struct btrfs_root
*root
, u64 bytenr
, u32 blocksize
)
334 struct extent_buffer
*buf
= NULL
;
335 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
338 buf
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
341 read_extent_buffer_pages(&BTRFS_I(btree_inode
)->io_tree
,
343 free_extent_buffer(buf
);
347 struct extent_buffer
*read_tree_block(struct btrfs_root
*root
, u64 bytenr
,
350 struct extent_buffer
*buf
= NULL
;
351 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
352 struct extent_io_tree
*io_tree
;
356 io_tree
= &BTRFS_I(btree_inode
)->io_tree
;
358 buf
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
361 read_extent_buffer_pages(&BTRFS_I(btree_inode
)->io_tree
, buf
, 0, 1);
363 if (buf
->flags
& EXTENT_CSUM
)
366 end
= buf
->start
+ PAGE_CACHE_SIZE
- 1;
367 if (test_range_bit(io_tree
, buf
->start
, end
, EXTENT_CSUM
, 1)) {
368 buf
->flags
|= EXTENT_CSUM
;
372 lock_extent(io_tree
, buf
->start
, end
, GFP_NOFS
);
374 if (test_range_bit(io_tree
, buf
->start
, end
, EXTENT_CSUM
, 1)) {
375 buf
->flags
|= EXTENT_CSUM
;
379 ret
= csum_tree_block(root
, buf
, 1);
380 set_extent_bits(io_tree
, buf
->start
, end
, EXTENT_CSUM
, GFP_NOFS
);
381 buf
->flags
|= EXTENT_CSUM
;
384 unlock_extent(io_tree
, buf
->start
, end
, GFP_NOFS
);
388 int clean_tree_block(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
389 struct extent_buffer
*buf
)
391 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
392 if (btrfs_header_generation(buf
) ==
393 root
->fs_info
->running_transaction
->transid
)
394 clear_extent_buffer_dirty(&BTRFS_I(btree_inode
)->io_tree
,
399 int wait_on_tree_block_writeback(struct btrfs_root
*root
,
400 struct extent_buffer
*buf
)
402 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
403 wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode
)->io_tree
,
408 static int __setup_root(u32 nodesize
, u32 leafsize
, u32 sectorsize
,
409 u32 stripesize
, struct btrfs_root
*root
,
410 struct btrfs_fs_info
*fs_info
,
415 root
->commit_root
= NULL
;
416 root
->sectorsize
= sectorsize
;
417 root
->nodesize
= nodesize
;
418 root
->leafsize
= leafsize
;
419 root
->stripesize
= stripesize
;
421 root
->fs_info
= fs_info
;
422 root
->objectid
= objectid
;
423 root
->last_trans
= 0;
424 root
->highest_inode
= 0;
425 root
->last_inode_alloc
= 0;
428 memset(&root
->root_key
, 0, sizeof(root
->root_key
));
429 memset(&root
->root_item
, 0, sizeof(root
->root_item
));
430 memset(&root
->defrag_progress
, 0, sizeof(root
->defrag_progress
));
431 memset(&root
->root_kobj
, 0, sizeof(root
->root_kobj
));
432 init_completion(&root
->kobj_unregister
);
433 root
->defrag_running
= 0;
434 root
->defrag_level
= 0;
435 root
->root_key
.objectid
= objectid
;
439 static int find_and_setup_root(struct btrfs_root
*tree_root
,
440 struct btrfs_fs_info
*fs_info
,
442 struct btrfs_root
*root
)
447 __setup_root(tree_root
->nodesize
, tree_root
->leafsize
,
448 tree_root
->sectorsize
, tree_root
->stripesize
,
449 root
, fs_info
, objectid
);
450 ret
= btrfs_find_last_root(tree_root
, objectid
,
451 &root
->root_item
, &root
->root_key
);
454 blocksize
= btrfs_level_size(root
, btrfs_root_level(&root
->root_item
));
455 root
->node
= read_tree_block(root
, btrfs_root_bytenr(&root
->root_item
),
461 struct btrfs_root
*btrfs_read_fs_root_no_radix(struct btrfs_fs_info
*fs_info
,
462 struct btrfs_key
*location
)
464 struct btrfs_root
*root
;
465 struct btrfs_root
*tree_root
= fs_info
->tree_root
;
466 struct btrfs_path
*path
;
467 struct extent_buffer
*l
;
472 root
= kzalloc(sizeof(*root
), GFP_NOFS
);
474 return ERR_PTR(-ENOMEM
);
475 if (location
->offset
== (u64
)-1) {
476 ret
= find_and_setup_root(tree_root
, fs_info
,
477 location
->objectid
, root
);
485 __setup_root(tree_root
->nodesize
, tree_root
->leafsize
,
486 tree_root
->sectorsize
, tree_root
->stripesize
,
487 root
, fs_info
, location
->objectid
);
489 path
= btrfs_alloc_path();
491 ret
= btrfs_search_slot(NULL
, tree_root
, location
, path
, 0, 0);
498 read_extent_buffer(l
, &root
->root_item
,
499 btrfs_item_ptr_offset(l
, path
->slots
[0]),
500 sizeof(root
->root_item
));
501 memcpy(&root
->root_key
, location
, sizeof(*location
));
504 btrfs_release_path(root
, path
);
505 btrfs_free_path(path
);
510 blocksize
= btrfs_level_size(root
, btrfs_root_level(&root
->root_item
));
511 root
->node
= read_tree_block(root
, btrfs_root_bytenr(&root
->root_item
),
516 ret
= btrfs_find_highest_inode(root
, &highest_inode
);
518 root
->highest_inode
= highest_inode
;
519 root
->last_inode_alloc
= highest_inode
;
524 struct btrfs_root
*btrfs_lookup_fs_root(struct btrfs_fs_info
*fs_info
,
527 struct btrfs_root
*root
;
529 if (root_objectid
== BTRFS_ROOT_TREE_OBJECTID
)
530 return fs_info
->tree_root
;
531 if (root_objectid
== BTRFS_EXTENT_TREE_OBJECTID
)
532 return fs_info
->extent_root
;
534 root
= radix_tree_lookup(&fs_info
->fs_roots_radix
,
535 (unsigned long)root_objectid
);
539 struct btrfs_root
*btrfs_read_fs_root_no_name(struct btrfs_fs_info
*fs_info
,
540 struct btrfs_key
*location
)
542 struct btrfs_root
*root
;
545 if (location
->objectid
== BTRFS_ROOT_TREE_OBJECTID
)
546 return fs_info
->tree_root
;
547 if (location
->objectid
== BTRFS_EXTENT_TREE_OBJECTID
)
548 return fs_info
->extent_root
;
550 root
= radix_tree_lookup(&fs_info
->fs_roots_radix
,
551 (unsigned long)location
->objectid
);
555 root
= btrfs_read_fs_root_no_radix(fs_info
, location
);
558 ret
= radix_tree_insert(&fs_info
->fs_roots_radix
,
559 (unsigned long)root
->root_key
.objectid
,
562 free_extent_buffer(root
->node
);
566 ret
= btrfs_find_dead_roots(fs_info
->tree_root
,
567 root
->root_key
.objectid
, root
);
573 struct btrfs_root
*btrfs_read_fs_root(struct btrfs_fs_info
*fs_info
,
574 struct btrfs_key
*location
,
575 const char *name
, int namelen
)
577 struct btrfs_root
*root
;
580 root
= btrfs_read_fs_root_no_name(fs_info
, location
);
587 ret
= btrfs_set_root_name(root
, name
, namelen
);
589 free_extent_buffer(root
->node
);
594 ret
= btrfs_sysfs_add_root(root
);
596 free_extent_buffer(root
->node
);
605 static int add_hasher(struct btrfs_fs_info
*info
, char *type
) {
606 struct btrfs_hasher
*hasher
;
608 hasher
= kmalloc(sizeof(*hasher
), GFP_NOFS
);
611 hasher
->hash_tfm
= crypto_alloc_hash(type
, 0, CRYPTO_ALG_ASYNC
);
612 if (!hasher
->hash_tfm
) {
616 spin_lock(&info
->hash_lock
);
617 list_add(&hasher
->list
, &info
->hashers
);
618 spin_unlock(&info
->hash_lock
);
622 struct btrfs_root
*open_ctree(struct super_block
*sb
)
629 struct btrfs_root
*extent_root
= kmalloc(sizeof(struct btrfs_root
),
631 struct btrfs_root
*tree_root
= kmalloc(sizeof(struct btrfs_root
),
633 struct btrfs_fs_info
*fs_info
= kmalloc(sizeof(*fs_info
),
637 struct btrfs_super_block
*disk_super
;
639 if (!extent_root
|| !tree_root
|| !fs_info
) {
643 INIT_RADIX_TREE(&fs_info
->fs_roots_radix
, GFP_NOFS
);
644 INIT_LIST_HEAD(&fs_info
->trans_list
);
645 INIT_LIST_HEAD(&fs_info
->dead_roots
);
646 INIT_LIST_HEAD(&fs_info
->hashers
);
647 spin_lock_init(&fs_info
->hash_lock
);
648 spin_lock_init(&fs_info
->delalloc_lock
);
649 spin_lock_init(&fs_info
->new_trans_lock
);
651 memset(&fs_info
->super_kobj
, 0, sizeof(fs_info
->super_kobj
));
652 init_completion(&fs_info
->kobj_unregister
);
653 sb_set_blocksize(sb
, 4096);
654 fs_info
->running_transaction
= NULL
;
655 fs_info
->last_trans_committed
= 0;
656 fs_info
->tree_root
= tree_root
;
657 fs_info
->extent_root
= extent_root
;
659 fs_info
->throttles
= 0;
660 fs_info
->mount_opt
= 0;
661 fs_info
->max_extent
= (u64
)-1;
662 fs_info
->max_inline
= 8192 * 1024;
663 fs_info
->delalloc_bytes
= 0;
664 fs_info
->btree_inode
= new_inode(sb
);
665 fs_info
->btree_inode
->i_ino
= 1;
666 fs_info
->btree_inode
->i_nlink
= 1;
667 fs_info
->btree_inode
->i_size
= sb
->s_bdev
->bd_inode
->i_size
;
668 fs_info
->btree_inode
->i_mapping
->a_ops
= &btree_aops
;
669 extent_io_tree_init(&BTRFS_I(fs_info
->btree_inode
)->io_tree
,
670 fs_info
->btree_inode
->i_mapping
,
672 extent_map_tree_init(&BTRFS_I(fs_info
->btree_inode
)->extent_tree
,
675 BTRFS_I(fs_info
->btree_inode
)->io_tree
.ops
= &btree_extent_io_ops
;
677 extent_io_tree_init(&fs_info
->free_space_cache
,
678 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
679 extent_io_tree_init(&fs_info
->block_group_cache
,
680 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
681 extent_io_tree_init(&fs_info
->pinned_extents
,
682 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
683 extent_io_tree_init(&fs_info
->pending_del
,
684 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
685 extent_io_tree_init(&fs_info
->extent_ins
,
686 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
687 fs_info
->do_barriers
= 1;
688 fs_info
->closing
= 0;
689 fs_info
->total_pinned
= 0;
690 fs_info
->last_alloc
= 0;
691 fs_info
->last_data_alloc
= 0;
693 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
694 INIT_WORK(&fs_info
->trans_work
, btrfs_transaction_cleaner
, fs_info
);
696 INIT_DELAYED_WORK(&fs_info
->trans_work
, btrfs_transaction_cleaner
);
698 BTRFS_I(fs_info
->btree_inode
)->root
= tree_root
;
699 memset(&BTRFS_I(fs_info
->btree_inode
)->location
, 0,
700 sizeof(struct btrfs_key
));
701 insert_inode_hash(fs_info
->btree_inode
);
702 mapping_set_gfp_mask(fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
704 mutex_init(&fs_info
->trans_mutex
);
705 mutex_init(&fs_info
->fs_mutex
);
708 ret
= add_hasher(fs_info
, "crc32c");
710 printk("btrfs: failed hash setup, modprobe cryptomgr?\n");
715 __setup_root(512, 512, 512, 512, tree_root
,
716 fs_info
, BTRFS_ROOT_TREE_OBJECTID
);
718 fs_info
->sb_buffer
= read_tree_block(tree_root
,
719 BTRFS_SUPER_INFO_OFFSET
,
722 if (!fs_info
->sb_buffer
)
725 read_extent_buffer(fs_info
->sb_buffer
, &fs_info
->super_copy
, 0,
726 sizeof(fs_info
->super_copy
));
728 read_extent_buffer(fs_info
->sb_buffer
, fs_info
->fsid
,
729 (unsigned long)btrfs_super_fsid(fs_info
->sb_buffer
),
731 disk_super
= &fs_info
->super_copy
;
732 if (!btrfs_super_root(disk_super
))
735 nodesize
= btrfs_super_nodesize(disk_super
);
736 leafsize
= btrfs_super_leafsize(disk_super
);
737 sectorsize
= btrfs_super_sectorsize(disk_super
);
738 stripesize
= btrfs_super_stripesize(disk_super
);
739 tree_root
->nodesize
= nodesize
;
740 tree_root
->leafsize
= leafsize
;
741 tree_root
->sectorsize
= sectorsize
;
742 tree_root
->stripesize
= stripesize
;
743 sb_set_blocksize(sb
, sectorsize
);
745 i_size_write(fs_info
->btree_inode
,
746 btrfs_super_total_bytes(disk_super
));
748 if (strncmp((char *)(&disk_super
->magic
), BTRFS_MAGIC
,
749 sizeof(disk_super
->magic
))) {
750 printk("btrfs: valid FS not found on %s\n", sb
->s_id
);
754 blocksize
= btrfs_level_size(tree_root
,
755 btrfs_super_root_level(disk_super
));
757 tree_root
->node
= read_tree_block(tree_root
,
758 btrfs_super_root(disk_super
),
760 if (!tree_root
->node
)
763 mutex_lock(&fs_info
->fs_mutex
);
765 ret
= find_and_setup_root(tree_root
, fs_info
,
766 BTRFS_EXTENT_TREE_OBJECTID
, extent_root
);
768 mutex_unlock(&fs_info
->fs_mutex
);
772 btrfs_read_block_groups(extent_root
);
774 fs_info
->generation
= btrfs_super_generation(disk_super
) + 1;
775 mutex_unlock(&fs_info
->fs_mutex
);
779 free_extent_buffer(tree_root
->node
);
781 free_extent_buffer(fs_info
->sb_buffer
);
783 iput(fs_info
->btree_inode
);
791 int write_ctree_super(struct btrfs_trans_handle
*trans
, struct btrfs_root
795 struct extent_buffer
*super
= root
->fs_info
->sb_buffer
;
796 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
797 struct super_block
*sb
= root
->fs_info
->sb
;
799 if (!btrfs_test_opt(root
, NOBARRIER
))
800 blkdev_issue_flush(sb
->s_bdev
, NULL
);
801 set_extent_buffer_dirty(&BTRFS_I(btree_inode
)->io_tree
, super
);
802 ret
= sync_page_range_nolock(btree_inode
, btree_inode
->i_mapping
,
803 super
->start
, super
->len
);
804 if (!btrfs_test_opt(root
, NOBARRIER
))
805 blkdev_issue_flush(sb
->s_bdev
, NULL
);
809 int btrfs_free_fs_root(struct btrfs_fs_info
*fs_info
, struct btrfs_root
*root
)
811 radix_tree_delete(&fs_info
->fs_roots_radix
,
812 (unsigned long)root
->root_key
.objectid
);
814 btrfs_sysfs_del_root(root
);
818 free_extent_buffer(root
->node
);
819 if (root
->commit_root
)
820 free_extent_buffer(root
->commit_root
);
827 static int del_fs_roots(struct btrfs_fs_info
*fs_info
)
830 struct btrfs_root
*gang
[8];
834 ret
= radix_tree_gang_lookup(&fs_info
->fs_roots_radix
,
839 for (i
= 0; i
< ret
; i
++)
840 btrfs_free_fs_root(fs_info
, gang
[i
]);
845 int close_ctree(struct btrfs_root
*root
)
848 struct btrfs_trans_handle
*trans
;
849 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
851 fs_info
->closing
= 1;
852 btrfs_transaction_flush_work(root
);
853 mutex_lock(&fs_info
->fs_mutex
);
854 btrfs_defrag_dirty_roots(root
->fs_info
);
855 trans
= btrfs_start_transaction(root
, 1);
856 ret
= btrfs_commit_transaction(trans
, root
);
857 /* run commit again to drop the original snapshot */
858 trans
= btrfs_start_transaction(root
, 1);
859 btrfs_commit_transaction(trans
, root
);
860 ret
= btrfs_write_and_wait_transaction(NULL
, root
);
862 write_ctree_super(NULL
, root
);
863 mutex_unlock(&fs_info
->fs_mutex
);
865 if (fs_info
->delalloc_bytes
) {
866 printk("btrfs: at unmount delalloc count %Lu\n",
867 fs_info
->delalloc_bytes
);
869 if (fs_info
->extent_root
->node
)
870 free_extent_buffer(fs_info
->extent_root
->node
);
872 if (fs_info
->tree_root
->node
)
873 free_extent_buffer(fs_info
->tree_root
->node
);
875 free_extent_buffer(fs_info
->sb_buffer
);
877 btrfs_free_block_groups(root
->fs_info
);
878 del_fs_roots(fs_info
);
880 filemap_write_and_wait(fs_info
->btree_inode
->i_mapping
);
882 extent_io_tree_empty_lru(&fs_info
->free_space_cache
);
883 extent_io_tree_empty_lru(&fs_info
->block_group_cache
);
884 extent_io_tree_empty_lru(&fs_info
->pinned_extents
);
885 extent_io_tree_empty_lru(&fs_info
->pending_del
);
886 extent_io_tree_empty_lru(&fs_info
->extent_ins
);
887 extent_io_tree_empty_lru(&BTRFS_I(fs_info
->btree_inode
)->io_tree
);
889 truncate_inode_pages(fs_info
->btree_inode
->i_mapping
, 0);
891 iput(fs_info
->btree_inode
);
893 while(!list_empty(&fs_info
->hashers
)) {
894 struct btrfs_hasher
*hasher
;
895 hasher
= list_entry(fs_info
->hashers
.next
, struct btrfs_hasher
,
897 list_del(&hasher
->hashers
);
898 crypto_free_hash(&fs_info
->hash_tfm
);
902 kfree(fs_info
->extent_root
);
903 kfree(fs_info
->tree_root
);
907 int btrfs_buffer_uptodate(struct extent_buffer
*buf
)
909 struct inode
*btree_inode
= buf
->first_page
->mapping
->host
;
910 return extent_buffer_uptodate(&BTRFS_I(btree_inode
)->io_tree
, buf
);
913 int btrfs_set_buffer_uptodate(struct extent_buffer
*buf
)
915 struct inode
*btree_inode
= buf
->first_page
->mapping
->host
;
916 return set_extent_buffer_uptodate(&BTRFS_I(btree_inode
)->io_tree
,
920 void btrfs_mark_buffer_dirty(struct extent_buffer
*buf
)
922 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
923 u64 transid
= btrfs_header_generation(buf
);
924 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
926 if (transid
!= root
->fs_info
->generation
) {
927 printk(KERN_CRIT
"transid mismatch buffer %llu, found %Lu running %Lu\n",
928 (unsigned long long)buf
->start
,
929 transid
, root
->fs_info
->generation
);
932 set_extent_buffer_dirty(&BTRFS_I(btree_inode
)->io_tree
, buf
);
935 void btrfs_throttle(struct btrfs_root
*root
)
937 struct backing_dev_info
*bdi
;
939 bdi
= root
->fs_info
->sb
->s_bdev
->bd_inode
->i_mapping
->backing_dev_info
;
940 if (root
->fs_info
->throttles
&& bdi_write_congested(bdi
)) {
941 #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,18)
942 congestion_wait(WRITE
, HZ
/20);
944 blk_congestion_wait(WRITE
, HZ
/20);
949 void btrfs_btree_balance_dirty(struct btrfs_root
*root
, unsigned long nr
)
951 balance_dirty_pages_ratelimited_nr(
952 root
->fs_info
->btree_inode
->i_mapping
, 1);
955 void btrfs_set_buffer_defrag(struct extent_buffer
*buf
)
957 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
958 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
959 set_extent_bits(&BTRFS_I(btree_inode
)->io_tree
, buf
->start
,
960 buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG
, GFP_NOFS
);
963 void btrfs_set_buffer_defrag_done(struct extent_buffer
*buf
)
965 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
966 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
967 set_extent_bits(&BTRFS_I(btree_inode
)->io_tree
, buf
->start
,
968 buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG_DONE
,
972 int btrfs_buffer_defrag(struct extent_buffer
*buf
)
974 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
975 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
976 return test_range_bit(&BTRFS_I(btree_inode
)->io_tree
,
977 buf
->start
, buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG
, 0);
980 int btrfs_buffer_defrag_done(struct extent_buffer
*buf
)
982 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
983 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
984 return test_range_bit(&BTRFS_I(btree_inode
)->io_tree
,
985 buf
->start
, buf
->start
+ buf
->len
- 1,
986 EXTENT_DEFRAG_DONE
, 0);
989 int btrfs_clear_buffer_defrag_done(struct extent_buffer
*buf
)
991 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
992 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
993 return clear_extent_bits(&BTRFS_I(btree_inode
)->io_tree
,
994 buf
->start
, buf
->start
+ buf
->len
- 1,
995 EXTENT_DEFRAG_DONE
, GFP_NOFS
);
998 int btrfs_clear_buffer_defrag(struct extent_buffer
*buf
)
1000 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1001 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1002 return clear_extent_bits(&BTRFS_I(btree_inode
)->io_tree
,
1003 buf
->start
, buf
->start
+ buf
->len
- 1,
1004 EXTENT_DEFRAG
, GFP_NOFS
);
1007 int btrfs_read_buffer(struct extent_buffer
*buf
)
1009 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1010 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1011 return read_extent_buffer_pages(&BTRFS_I(btree_inode
)->io_tree
,
1015 static struct extent_io_ops btree_extent_io_ops
= {
1016 .writepage_io_hook
= btree_writepage_io_hook
,