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> // for block_sync_page
26 #include <linux/workqueue.h>
30 #include "transaction.h"
31 #include "btrfs_inode.h"
33 #include "print-tree.h"
36 static int check_tree_block(struct btrfs_root
*root
, struct extent_buffer
*buf
)
38 if (extent_buffer_blocknr(buf
) != btrfs_header_blocknr(buf
)) {
39 printk(KERN_CRIT
"buf blocknr(buf) is %llu, header is %llu\n",
40 (unsigned long long)extent_buffer_blocknr(buf
),
41 (unsigned long long)btrfs_header_blocknr(buf
));
48 static struct extent_io_ops btree_extent_io_ops
;
49 static struct workqueue_struct
*end_io_workqueue
;
50 static struct workqueue_struct
*async_submit_workqueue
;
56 struct btrfs_fs_info
*info
;
59 struct list_head list
;
62 struct async_submit_bio
{
65 struct list_head list
;
66 extent_submit_bio_hook_t
*submit_bio_hook
;
71 struct extent_map
*btree_get_extent(struct inode
*inode
, struct page
*page
,
72 size_t page_offset
, u64 start
, u64 len
,
75 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
76 struct extent_map
*em
;
79 spin_lock(&em_tree
->lock
);
80 em
= lookup_extent_mapping(em_tree
, start
, len
);
83 BTRFS_I(inode
)->root
->fs_info
->fs_devices
->latest_bdev
;
84 spin_unlock(&em_tree
->lock
);
87 spin_unlock(&em_tree
->lock
);
89 em
= alloc_extent_map(GFP_NOFS
);
91 em
= ERR_PTR(-ENOMEM
);
97 em
->bdev
= BTRFS_I(inode
)->root
->fs_info
->fs_devices
->latest_bdev
;
99 spin_lock(&em_tree
->lock
);
100 ret
= add_extent_mapping(em_tree
, em
);
101 if (ret
== -EEXIST
) {
102 u64 failed_start
= em
->start
;
103 u64 failed_len
= em
->len
;
105 printk("failed to insert %Lu %Lu -> %Lu into tree\n",
106 em
->start
, em
->len
, em
->block_start
);
108 em
= lookup_extent_mapping(em_tree
, start
, len
);
110 printk("after failing, found %Lu %Lu %Lu\n",
111 em
->start
, em
->len
, em
->block_start
);
114 em
= lookup_extent_mapping(em_tree
, failed_start
,
117 printk("double failure lookup gives us "
118 "%Lu %Lu -> %Lu\n", em
->start
,
119 em
->len
, em
->block_start
);
128 spin_unlock(&em_tree
->lock
);
136 u32
btrfs_csum_data(struct btrfs_root
*root
, char *data
, u32 seed
, size_t len
)
138 return btrfs_crc32c(seed
, data
, len
);
141 void btrfs_csum_final(u32 crc
, char *result
)
143 *(__le32
*)result
= ~cpu_to_le32(crc
);
146 static int csum_tree_block(struct btrfs_root
*root
, struct extent_buffer
*buf
,
149 char result
[BTRFS_CRC32_SIZE
];
151 unsigned long cur_len
;
152 unsigned long offset
= BTRFS_CSUM_SIZE
;
153 char *map_token
= NULL
;
155 unsigned long map_start
;
156 unsigned long map_len
;
160 len
= buf
->len
- offset
;
162 err
= map_private_extent_buffer(buf
, offset
, 32,
164 &map_start
, &map_len
, KM_USER0
);
166 printk("failed to map extent buffer! %lu\n",
170 cur_len
= min(len
, map_len
- (offset
- map_start
));
171 crc
= btrfs_csum_data(root
, kaddr
+ offset
- map_start
,
175 unmap_extent_buffer(buf
, map_token
, KM_USER0
);
177 btrfs_csum_final(crc
, result
);
180 int from_this_trans
= 0;
182 if (root
->fs_info
->running_transaction
&&
183 btrfs_header_generation(buf
) ==
184 root
->fs_info
->running_transaction
->transid
)
187 /* FIXME, this is not good */
188 if (memcmp_extent_buffer(buf
, result
, 0, BTRFS_CRC32_SIZE
)) {
191 memcpy(&found
, result
, BTRFS_CRC32_SIZE
);
193 read_extent_buffer(buf
, &val
, 0, BTRFS_CRC32_SIZE
);
194 printk("btrfs: %s checksum verify failed on %llu "
195 "wanted %X found %X from_this_trans %d "
197 root
->fs_info
->sb
->s_id
,
198 buf
->start
, val
, found
, from_this_trans
,
199 btrfs_header_level(buf
));
203 write_extent_buffer(buf
, result
, 0, BTRFS_CRC32_SIZE
);
208 static int verify_parent_transid(struct extent_io_tree
*io_tree
,
209 struct extent_buffer
*eb
, u64 parent_transid
)
213 if (!parent_transid
|| btrfs_header_generation(eb
) == parent_transid
)
216 lock_extent(io_tree
, eb
->start
, eb
->start
+ eb
->len
- 1, GFP_NOFS
);
217 if (extent_buffer_uptodate(io_tree
, eb
) &&
218 btrfs_header_generation(eb
) == parent_transid
) {
222 printk("parent transid verify failed on %llu wanted %llu found %llu\n",
223 (unsigned long long)eb
->start
,
224 (unsigned long long)parent_transid
,
225 (unsigned long long)btrfs_header_generation(eb
));
228 clear_extent_buffer_uptodate(io_tree
, eb
);
229 unlock_extent(io_tree
, eb
->start
, eb
->start
+ eb
->len
- 1,
235 static int btree_read_extent_buffer_pages(struct btrfs_root
*root
,
236 struct extent_buffer
*eb
,
237 u64 start
, u64 parent_transid
)
239 struct extent_io_tree
*io_tree
;
244 io_tree
= &BTRFS_I(root
->fs_info
->btree_inode
)->io_tree
;
246 ret
= read_extent_buffer_pages(io_tree
, eb
, start
, 1,
247 btree_get_extent
, mirror_num
);
249 !verify_parent_transid(io_tree
, eb
, parent_transid
))
252 num_copies
= btrfs_num_copies(&root
->fs_info
->mapping_tree
,
258 if (mirror_num
> num_copies
)
264 int csum_dirty_buffer(struct btrfs_root
*root
, struct page
*page
)
266 struct extent_io_tree
*tree
;
267 u64 start
= (u64
)page
->index
<< PAGE_CACHE_SHIFT
;
271 struct extent_buffer
*eb
;
274 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
276 if (page
->private == EXTENT_PAGE_PRIVATE
)
280 len
= page
->private >> 2;
284 eb
= alloc_extent_buffer(tree
, start
, len
, page
, GFP_NOFS
);
285 ret
= btree_read_extent_buffer_pages(root
, eb
, start
+ PAGE_CACHE_SIZE
,
286 btrfs_header_generation(eb
));
288 btrfs_clear_buffer_defrag(eb
);
289 found_start
= btrfs_header_bytenr(eb
);
290 if (found_start
!= start
) {
291 printk("warning: eb start incorrect %Lu buffer %Lu len %lu\n",
292 start
, found_start
, len
);
296 if (eb
->first_page
!= page
) {
297 printk("bad first page %lu %lu\n", eb
->first_page
->index
,
302 if (!PageUptodate(page
)) {
303 printk("csum not up to date page %lu\n", page
->index
);
307 found_level
= btrfs_header_level(eb
);
308 spin_lock(&root
->fs_info
->hash_lock
);
309 btrfs_set_header_flag(eb
, BTRFS_HEADER_FLAG_WRITTEN
);
310 spin_unlock(&root
->fs_info
->hash_lock
);
311 csum_tree_block(root
, eb
, 0);
313 free_extent_buffer(eb
);
318 static int btree_writepage_io_hook(struct page
*page
, u64 start
, u64 end
)
320 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
322 csum_dirty_buffer(root
, page
);
326 int btree_readpage_end_io_hook(struct page
*page
, u64 start
, u64 end
,
327 struct extent_state
*state
)
329 struct extent_io_tree
*tree
;
333 struct extent_buffer
*eb
;
334 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
337 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
338 if (page
->private == EXTENT_PAGE_PRIVATE
)
342 len
= page
->private >> 2;
346 eb
= alloc_extent_buffer(tree
, start
, len
, page
, GFP_NOFS
);
348 btrfs_clear_buffer_defrag(eb
);
349 found_start
= btrfs_header_bytenr(eb
);
350 if (found_start
!= start
) {
354 if (eb
->first_page
!= page
) {
355 printk("bad first page %lu %lu\n", eb
->first_page
->index
,
361 if (memcmp_extent_buffer(eb
, root
->fs_info
->fsid
,
362 (unsigned long)btrfs_header_fsid(eb
),
364 printk("bad fsid on block %Lu\n", eb
->start
);
368 found_level
= btrfs_header_level(eb
);
370 ret
= csum_tree_block(root
, eb
, 1);
374 end
= min_t(u64
, eb
->len
, PAGE_CACHE_SIZE
);
375 end
= eb
->start
+ end
- 1;
376 release_extent_buffer_tail_pages(eb
);
378 free_extent_buffer(eb
);
383 #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
384 static void end_workqueue_bio(struct bio
*bio
, int err
)
386 static int end_workqueue_bio(struct bio
*bio
,
387 unsigned int bytes_done
, int err
)
390 struct end_io_wq
*end_io_wq
= bio
->bi_private
;
391 struct btrfs_fs_info
*fs_info
;
394 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
399 fs_info
= end_io_wq
->info
;
400 spin_lock_irqsave(&fs_info
->end_io_work_lock
, flags
);
401 end_io_wq
->error
= err
;
402 list_add_tail(&end_io_wq
->list
, &fs_info
->end_io_work_list
);
403 spin_unlock_irqrestore(&fs_info
->end_io_work_lock
, flags
);
404 queue_work(end_io_workqueue
, &fs_info
->end_io_work
);
406 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
411 int btrfs_bio_wq_end_io(struct btrfs_fs_info
*info
, struct bio
*bio
,
414 struct end_io_wq
*end_io_wq
;
415 end_io_wq
= kmalloc(sizeof(*end_io_wq
), GFP_NOFS
);
419 end_io_wq
->private = bio
->bi_private
;
420 end_io_wq
->end_io
= bio
->bi_end_io
;
421 end_io_wq
->info
= info
;
422 end_io_wq
->error
= 0;
423 end_io_wq
->bio
= bio
;
424 end_io_wq
->metadata
= metadata
;
426 bio
->bi_private
= end_io_wq
;
427 bio
->bi_end_io
= end_workqueue_bio
;
431 int btrfs_wq_submit_bio(struct btrfs_fs_info
*fs_info
, struct inode
*inode
,
432 int rw
, struct bio
*bio
, int mirror_num
,
433 extent_submit_bio_hook_t
*submit_bio_hook
)
435 struct async_submit_bio
*async
;
438 * inline writerback should stay inline, only hop to the async
439 * queue if we're pdflush
441 if (!current_is_pdflush())
442 return submit_bio_hook(inode
, rw
, bio
, mirror_num
);
444 async
= kmalloc(sizeof(*async
), GFP_NOFS
);
448 async
->inode
= inode
;
451 async
->mirror_num
= mirror_num
;
452 async
->submit_bio_hook
= submit_bio_hook
;
454 spin_lock(&fs_info
->async_submit_work_lock
);
455 list_add_tail(&async
->list
, &fs_info
->async_submit_work_list
);
456 spin_unlock(&fs_info
->async_submit_work_lock
);
458 queue_work(async_submit_workqueue
, &fs_info
->async_submit_work
);
462 static int __btree_submit_bio_hook(struct inode
*inode
, int rw
, struct bio
*bio
,
465 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
469 offset
= bio
->bi_sector
<< 9;
471 if (rw
& (1 << BIO_RW
)) {
472 return btrfs_map_bio(BTRFS_I(inode
)->root
, rw
, bio
, mirror_num
);
475 ret
= btrfs_bio_wq_end_io(root
->fs_info
, bio
, 1);
478 return btrfs_map_bio(BTRFS_I(inode
)->root
, rw
, bio
, mirror_num
);
481 static int btree_submit_bio_hook(struct inode
*inode
, int rw
, struct bio
*bio
,
484 if (!(rw
& (1 << BIO_RW
))) {
485 return __btree_submit_bio_hook(inode
, rw
, bio
, mirror_num
);
487 return btrfs_wq_submit_bio(BTRFS_I(inode
)->root
->fs_info
,
488 inode
, rw
, bio
, mirror_num
,
489 __btree_submit_bio_hook
);
492 static int btree_writepage(struct page
*page
, struct writeback_control
*wbc
)
494 struct extent_io_tree
*tree
;
495 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
496 return extent_write_full_page(tree
, page
, btree_get_extent
, wbc
);
499 static int btree_writepages(struct address_space
*mapping
,
500 struct writeback_control
*wbc
)
502 struct extent_io_tree
*tree
;
503 tree
= &BTRFS_I(mapping
->host
)->io_tree
;
504 if (wbc
->sync_mode
== WB_SYNC_NONE
) {
507 unsigned long thresh
= 96 * 1024 * 1024;
509 if (wbc
->for_kupdate
)
512 if (current_is_pdflush()) {
513 thresh
= 96 * 1024 * 1024;
515 thresh
= 8 * 1024 * 1024;
517 num_dirty
= count_range_bits(tree
, &start
, (u64
)-1,
518 thresh
, EXTENT_DIRTY
);
519 if (num_dirty
< thresh
) {
523 return extent_writepages(tree
, mapping
, btree_get_extent
, wbc
);
526 int btree_readpage(struct file
*file
, struct page
*page
)
528 struct extent_io_tree
*tree
;
529 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
530 return extent_read_full_page(tree
, page
, btree_get_extent
);
533 static int btree_releasepage(struct page
*page
, gfp_t gfp_flags
)
535 struct extent_io_tree
*tree
;
536 struct extent_map_tree
*map
;
539 if (page_count(page
) > 3) {
540 /* once for page->private, once for the caller, once
541 * once for the page cache
545 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
546 map
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
547 ret
= try_release_extent_state(map
, tree
, page
, gfp_flags
);
549 invalidate_extent_lru(tree
, page_offset(page
), PAGE_CACHE_SIZE
);
550 ClearPagePrivate(page
);
551 set_page_private(page
, 0);
552 page_cache_release(page
);
557 static void btree_invalidatepage(struct page
*page
, unsigned long offset
)
559 struct extent_io_tree
*tree
;
560 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
561 extent_invalidatepage(tree
, page
, offset
);
562 btree_releasepage(page
, GFP_NOFS
);
563 if (PagePrivate(page
)) {
564 invalidate_extent_lru(tree
, page_offset(page
), PAGE_CACHE_SIZE
);
565 ClearPagePrivate(page
);
566 set_page_private(page
, 0);
567 page_cache_release(page
);
572 static int btree_writepage(struct page
*page
, struct writeback_control
*wbc
)
574 struct buffer_head
*bh
;
575 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
576 struct buffer_head
*head
;
577 if (!page_has_buffers(page
)) {
578 create_empty_buffers(page
, root
->fs_info
->sb
->s_blocksize
,
579 (1 << BH_Dirty
)|(1 << BH_Uptodate
));
581 head
= page_buffers(page
);
584 if (buffer_dirty(bh
))
585 csum_tree_block(root
, bh
, 0);
586 bh
= bh
->b_this_page
;
587 } while (bh
!= head
);
588 return block_write_full_page(page
, btree_get_block
, wbc
);
592 static struct address_space_operations btree_aops
= {
593 .readpage
= btree_readpage
,
594 .writepage
= btree_writepage
,
595 .writepages
= btree_writepages
,
596 .releasepage
= btree_releasepage
,
597 .invalidatepage
= btree_invalidatepage
,
598 .sync_page
= block_sync_page
,
601 int readahead_tree_block(struct btrfs_root
*root
, u64 bytenr
, u32 blocksize
,
604 struct extent_buffer
*buf
= NULL
;
605 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
608 buf
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
611 read_extent_buffer_pages(&BTRFS_I(btree_inode
)->io_tree
,
612 buf
, 0, 0, btree_get_extent
, 0);
613 free_extent_buffer(buf
);
617 static int close_all_devices(struct btrfs_fs_info
*fs_info
)
619 struct list_head
*list
;
620 struct list_head
*next
;
621 struct btrfs_device
*device
;
623 list
= &fs_info
->fs_devices
->devices
;
624 list_for_each(next
, list
) {
625 device
= list_entry(next
, struct btrfs_device
, dev_list
);
626 close_bdev_excl(device
->bdev
);
632 struct extent_buffer
*btrfs_find_tree_block(struct btrfs_root
*root
,
633 u64 bytenr
, u32 blocksize
)
635 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
636 struct extent_buffer
*eb
;
637 eb
= find_extent_buffer(&BTRFS_I(btree_inode
)->io_tree
,
638 bytenr
, blocksize
, GFP_NOFS
);
642 struct extent_buffer
*btrfs_find_create_tree_block(struct btrfs_root
*root
,
643 u64 bytenr
, u32 blocksize
)
645 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
646 struct extent_buffer
*eb
;
648 eb
= alloc_extent_buffer(&BTRFS_I(btree_inode
)->io_tree
,
649 bytenr
, blocksize
, NULL
, GFP_NOFS
);
654 struct extent_buffer
*read_tree_block(struct btrfs_root
*root
, u64 bytenr
,
655 u32 blocksize
, u64 parent_transid
)
657 struct extent_buffer
*buf
= NULL
;
658 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
659 struct extent_io_tree
*io_tree
;
662 io_tree
= &BTRFS_I(btree_inode
)->io_tree
;
664 buf
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
668 ret
= btree_read_extent_buffer_pages(root
, buf
, 0, parent_transid
);
671 buf
->flags
|= EXTENT_UPTODATE
;
677 int clean_tree_block(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
678 struct extent_buffer
*buf
)
680 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
681 if (btrfs_header_generation(buf
) ==
682 root
->fs_info
->running_transaction
->transid
)
683 clear_extent_buffer_dirty(&BTRFS_I(btree_inode
)->io_tree
,
688 int wait_on_tree_block_writeback(struct btrfs_root
*root
,
689 struct extent_buffer
*buf
)
691 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
692 wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode
)->io_tree
,
697 static int __setup_root(u32 nodesize
, u32 leafsize
, u32 sectorsize
,
698 u32 stripesize
, struct btrfs_root
*root
,
699 struct btrfs_fs_info
*fs_info
,
704 root
->commit_root
= NULL
;
705 root
->sectorsize
= sectorsize
;
706 root
->nodesize
= nodesize
;
707 root
->leafsize
= leafsize
;
708 root
->stripesize
= stripesize
;
710 root
->track_dirty
= 0;
712 root
->fs_info
= fs_info
;
713 root
->objectid
= objectid
;
714 root
->last_trans
= 0;
715 root
->highest_inode
= 0;
716 root
->last_inode_alloc
= 0;
720 INIT_LIST_HEAD(&root
->dirty_list
);
721 memset(&root
->root_key
, 0, sizeof(root
->root_key
));
722 memset(&root
->root_item
, 0, sizeof(root
->root_item
));
723 memset(&root
->defrag_progress
, 0, sizeof(root
->defrag_progress
));
724 memset(&root
->root_kobj
, 0, sizeof(root
->root_kobj
));
725 init_completion(&root
->kobj_unregister
);
726 root
->defrag_running
= 0;
727 root
->defrag_level
= 0;
728 root
->root_key
.objectid
= objectid
;
732 static int find_and_setup_root(struct btrfs_root
*tree_root
,
733 struct btrfs_fs_info
*fs_info
,
735 struct btrfs_root
*root
)
740 __setup_root(tree_root
->nodesize
, tree_root
->leafsize
,
741 tree_root
->sectorsize
, tree_root
->stripesize
,
742 root
, fs_info
, objectid
);
743 ret
= btrfs_find_last_root(tree_root
, objectid
,
744 &root
->root_item
, &root
->root_key
);
747 blocksize
= btrfs_level_size(root
, btrfs_root_level(&root
->root_item
));
748 root
->node
= read_tree_block(root
, btrfs_root_bytenr(&root
->root_item
),
754 struct btrfs_root
*btrfs_read_fs_root_no_radix(struct btrfs_fs_info
*fs_info
,
755 struct btrfs_key
*location
)
757 struct btrfs_root
*root
;
758 struct btrfs_root
*tree_root
= fs_info
->tree_root
;
759 struct btrfs_path
*path
;
760 struct extent_buffer
*l
;
765 root
= kzalloc(sizeof(*root
), GFP_NOFS
);
767 return ERR_PTR(-ENOMEM
);
768 if (location
->offset
== (u64
)-1) {
769 ret
= find_and_setup_root(tree_root
, fs_info
,
770 location
->objectid
, root
);
778 __setup_root(tree_root
->nodesize
, tree_root
->leafsize
,
779 tree_root
->sectorsize
, tree_root
->stripesize
,
780 root
, fs_info
, location
->objectid
);
782 path
= btrfs_alloc_path();
784 ret
= btrfs_search_slot(NULL
, tree_root
, location
, path
, 0, 0);
791 read_extent_buffer(l
, &root
->root_item
,
792 btrfs_item_ptr_offset(l
, path
->slots
[0]),
793 sizeof(root
->root_item
));
794 memcpy(&root
->root_key
, location
, sizeof(*location
));
797 btrfs_release_path(root
, path
);
798 btrfs_free_path(path
);
803 blocksize
= btrfs_level_size(root
, btrfs_root_level(&root
->root_item
));
804 root
->node
= read_tree_block(root
, btrfs_root_bytenr(&root
->root_item
),
809 ret
= btrfs_find_highest_inode(root
, &highest_inode
);
811 root
->highest_inode
= highest_inode
;
812 root
->last_inode_alloc
= highest_inode
;
817 struct btrfs_root
*btrfs_lookup_fs_root(struct btrfs_fs_info
*fs_info
,
820 struct btrfs_root
*root
;
822 if (root_objectid
== BTRFS_ROOT_TREE_OBJECTID
)
823 return fs_info
->tree_root
;
824 if (root_objectid
== BTRFS_EXTENT_TREE_OBJECTID
)
825 return fs_info
->extent_root
;
827 root
= radix_tree_lookup(&fs_info
->fs_roots_radix
,
828 (unsigned long)root_objectid
);
832 struct btrfs_root
*btrfs_read_fs_root_no_name(struct btrfs_fs_info
*fs_info
,
833 struct btrfs_key
*location
)
835 struct btrfs_root
*root
;
838 if (location
->objectid
== BTRFS_ROOT_TREE_OBJECTID
)
839 return fs_info
->tree_root
;
840 if (location
->objectid
== BTRFS_EXTENT_TREE_OBJECTID
)
841 return fs_info
->extent_root
;
842 if (location
->objectid
== BTRFS_CHUNK_TREE_OBJECTID
)
843 return fs_info
->chunk_root
;
844 if (location
->objectid
== BTRFS_DEV_TREE_OBJECTID
)
845 return fs_info
->dev_root
;
847 root
= radix_tree_lookup(&fs_info
->fs_roots_radix
,
848 (unsigned long)location
->objectid
);
852 root
= btrfs_read_fs_root_no_radix(fs_info
, location
);
855 ret
= radix_tree_insert(&fs_info
->fs_roots_radix
,
856 (unsigned long)root
->root_key
.objectid
,
859 free_extent_buffer(root
->node
);
863 ret
= btrfs_find_dead_roots(fs_info
->tree_root
,
864 root
->root_key
.objectid
, root
);
870 struct btrfs_root
*btrfs_read_fs_root(struct btrfs_fs_info
*fs_info
,
871 struct btrfs_key
*location
,
872 const char *name
, int namelen
)
874 struct btrfs_root
*root
;
877 root
= btrfs_read_fs_root_no_name(fs_info
, location
);
884 ret
= btrfs_set_root_name(root
, name
, namelen
);
886 free_extent_buffer(root
->node
);
891 ret
= btrfs_sysfs_add_root(root
);
893 free_extent_buffer(root
->node
);
902 static int add_hasher(struct btrfs_fs_info
*info
, char *type
) {
903 struct btrfs_hasher
*hasher
;
905 hasher
= kmalloc(sizeof(*hasher
), GFP_NOFS
);
908 hasher
->hash_tfm
= crypto_alloc_hash(type
, 0, CRYPTO_ALG_ASYNC
);
909 if (!hasher
->hash_tfm
) {
913 spin_lock(&info
->hash_lock
);
914 list_add(&hasher
->list
, &info
->hashers
);
915 spin_unlock(&info
->hash_lock
);
920 static int btrfs_congested_fn(void *congested_data
, int bdi_bits
)
922 struct btrfs_fs_info
*info
= (struct btrfs_fs_info
*)congested_data
;
924 struct list_head
*cur
;
925 struct btrfs_device
*device
;
926 struct backing_dev_info
*bdi
;
928 list_for_each(cur
, &info
->fs_devices
->devices
) {
929 device
= list_entry(cur
, struct btrfs_device
, dev_list
);
930 bdi
= blk_get_backing_dev_info(device
->bdev
);
931 if (bdi
&& bdi_congested(bdi
, bdi_bits
)) {
940 * this unplugs every device on the box, and it is only used when page
943 static void __unplug_io_fn(struct backing_dev_info
*bdi
, struct page
*page
)
945 struct list_head
*cur
;
946 struct btrfs_device
*device
;
947 struct btrfs_fs_info
*info
;
949 info
= (struct btrfs_fs_info
*)bdi
->unplug_io_data
;
950 list_for_each(cur
, &info
->fs_devices
->devices
) {
951 device
= list_entry(cur
, struct btrfs_device
, dev_list
);
952 bdi
= blk_get_backing_dev_info(device
->bdev
);
953 if (bdi
->unplug_io_fn
) {
954 bdi
->unplug_io_fn(bdi
, page
);
959 void btrfs_unplug_io_fn(struct backing_dev_info
*bdi
, struct page
*page
)
962 struct extent_map_tree
*em_tree
;
963 struct extent_map
*em
;
964 struct address_space
*mapping
;
967 /* the generic O_DIRECT read code does this */
969 __unplug_io_fn(bdi
, page
);
974 * page->mapping may change at any time. Get a consistent copy
975 * and use that for everything below
978 mapping
= page
->mapping
;
982 inode
= mapping
->host
;
983 offset
= page_offset(page
);
985 em_tree
= &BTRFS_I(inode
)->extent_tree
;
986 spin_lock(&em_tree
->lock
);
987 em
= lookup_extent_mapping(em_tree
, offset
, PAGE_CACHE_SIZE
);
988 spin_unlock(&em_tree
->lock
);
992 offset
= offset
- em
->start
;
993 btrfs_unplug_page(&BTRFS_I(inode
)->root
->fs_info
->mapping_tree
,
994 em
->block_start
+ offset
, page
);
998 static int setup_bdi(struct btrfs_fs_info
*info
, struct backing_dev_info
*bdi
)
1000 #if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,23)
1003 bdi
->ra_pages
= default_backing_dev_info
.ra_pages
;
1005 bdi
->capabilities
= default_backing_dev_info
.capabilities
;
1006 bdi
->unplug_io_fn
= btrfs_unplug_io_fn
;
1007 bdi
->unplug_io_data
= info
;
1008 bdi
->congested_fn
= btrfs_congested_fn
;
1009 bdi
->congested_data
= info
;
1013 static int bio_ready_for_csum(struct bio
*bio
)
1019 struct extent_io_tree
*io_tree
= NULL
;
1020 struct btrfs_fs_info
*info
= NULL
;
1021 struct bio_vec
*bvec
;
1025 bio_for_each_segment(bvec
, bio
, i
) {
1026 page
= bvec
->bv_page
;
1027 if (page
->private == EXTENT_PAGE_PRIVATE
) {
1028 length
+= bvec
->bv_len
;
1031 if (!page
->private) {
1032 length
+= bvec
->bv_len
;
1035 length
= bvec
->bv_len
;
1036 buf_len
= page
->private >> 2;
1037 start
= page_offset(page
) + bvec
->bv_offset
;
1038 io_tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
1039 info
= BTRFS_I(page
->mapping
->host
)->root
->fs_info
;
1041 /* are we fully contained in this bio? */
1042 if (buf_len
<= length
)
1045 ret
= extent_range_uptodate(io_tree
, start
+ length
,
1046 start
+ buf_len
- 1);
1052 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
1053 static void btrfs_end_io_csum(void *p
)
1055 static void btrfs_end_io_csum(struct work_struct
*work
)
1058 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
1059 struct btrfs_fs_info
*fs_info
= p
;
1061 struct btrfs_fs_info
*fs_info
= container_of(work
,
1062 struct btrfs_fs_info
,
1065 unsigned long flags
;
1066 struct end_io_wq
*end_io_wq
;
1068 struct list_head
*next
;
1073 spin_lock_irqsave(&fs_info
->end_io_work_lock
, flags
);
1074 if (list_empty(&fs_info
->end_io_work_list
)) {
1075 spin_unlock_irqrestore(&fs_info
->end_io_work_lock
,
1079 next
= fs_info
->end_io_work_list
.next
;
1081 spin_unlock_irqrestore(&fs_info
->end_io_work_lock
, flags
);
1083 end_io_wq
= list_entry(next
, struct end_io_wq
, list
);
1085 bio
= end_io_wq
->bio
;
1086 if (end_io_wq
->metadata
&& !bio_ready_for_csum(bio
)) {
1087 spin_lock_irqsave(&fs_info
->end_io_work_lock
, flags
);
1088 was_empty
= list_empty(&fs_info
->end_io_work_list
);
1089 list_add_tail(&end_io_wq
->list
,
1090 &fs_info
->end_io_work_list
);
1091 spin_unlock_irqrestore(&fs_info
->end_io_work_lock
,
1097 error
= end_io_wq
->error
;
1098 bio
->bi_private
= end_io_wq
->private;
1099 bio
->bi_end_io
= end_io_wq
->end_io
;
1101 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1102 bio_endio(bio
, bio
->bi_size
, error
);
1104 bio_endio(bio
, error
);
1109 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
1110 static void btrfs_async_submit_work(void *p
)
1112 static void btrfs_async_submit_work(struct work_struct
*work
)
1115 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
1116 struct btrfs_fs_info
*fs_info
= p
;
1118 struct btrfs_fs_info
*fs_info
= container_of(work
,
1119 struct btrfs_fs_info
,
1122 struct async_submit_bio
*async
;
1123 struct list_head
*next
;
1126 spin_lock(&fs_info
->async_submit_work_lock
);
1127 if (list_empty(&fs_info
->async_submit_work_list
)) {
1128 spin_unlock(&fs_info
->async_submit_work_lock
);
1131 next
= fs_info
->async_submit_work_list
.next
;
1133 spin_unlock(&fs_info
->async_submit_work_lock
);
1135 async
= list_entry(next
, struct async_submit_bio
, list
);
1136 async
->submit_bio_hook(async
->inode
, async
->rw
, async
->bio
,
1142 struct btrfs_root
*open_ctree(struct super_block
*sb
,
1143 struct btrfs_fs_devices
*fs_devices
)
1150 struct buffer_head
*bh
;
1151 struct btrfs_root
*extent_root
= kmalloc(sizeof(struct btrfs_root
),
1153 struct btrfs_root
*tree_root
= kmalloc(sizeof(struct btrfs_root
),
1155 struct btrfs_fs_info
*fs_info
= kzalloc(sizeof(*fs_info
),
1157 struct btrfs_root
*chunk_root
= kmalloc(sizeof(struct btrfs_root
),
1159 struct btrfs_root
*dev_root
= kmalloc(sizeof(struct btrfs_root
),
1163 struct btrfs_super_block
*disk_super
;
1165 if (!extent_root
|| !tree_root
|| !fs_info
) {
1169 end_io_workqueue
= create_workqueue("btrfs-end-io");
1170 BUG_ON(!end_io_workqueue
);
1171 async_submit_workqueue
= create_workqueue("btrfs-async-submit");
1173 INIT_RADIX_TREE(&fs_info
->fs_roots_radix
, GFP_NOFS
);
1174 INIT_LIST_HEAD(&fs_info
->trans_list
);
1175 INIT_LIST_HEAD(&fs_info
->dead_roots
);
1176 INIT_LIST_HEAD(&fs_info
->hashers
);
1177 INIT_LIST_HEAD(&fs_info
->end_io_work_list
);
1178 INIT_LIST_HEAD(&fs_info
->async_submit_work_list
);
1179 spin_lock_init(&fs_info
->hash_lock
);
1180 spin_lock_init(&fs_info
->end_io_work_lock
);
1181 spin_lock_init(&fs_info
->async_submit_work_lock
);
1182 spin_lock_init(&fs_info
->delalloc_lock
);
1183 spin_lock_init(&fs_info
->new_trans_lock
);
1185 init_completion(&fs_info
->kobj_unregister
);
1186 fs_info
->tree_root
= tree_root
;
1187 fs_info
->extent_root
= extent_root
;
1188 fs_info
->chunk_root
= chunk_root
;
1189 fs_info
->dev_root
= dev_root
;
1190 fs_info
->fs_devices
= fs_devices
;
1191 INIT_LIST_HEAD(&fs_info
->dirty_cowonly_roots
);
1192 INIT_LIST_HEAD(&fs_info
->space_info
);
1193 btrfs_mapping_init(&fs_info
->mapping_tree
);
1195 fs_info
->max_extent
= (u64
)-1;
1196 fs_info
->max_inline
= 8192 * 1024;
1197 setup_bdi(fs_info
, &fs_info
->bdi
);
1198 fs_info
->btree_inode
= new_inode(sb
);
1199 fs_info
->btree_inode
->i_ino
= 1;
1200 fs_info
->btree_inode
->i_nlink
= 1;
1202 sb
->s_blocksize
= 4096;
1203 sb
->s_blocksize_bits
= blksize_bits(4096);
1206 * we set the i_size on the btree inode to the max possible int.
1207 * the real end of the address space is determined by all of
1208 * the devices in the system
1210 fs_info
->btree_inode
->i_size
= OFFSET_MAX
;
1211 fs_info
->btree_inode
->i_mapping
->a_ops
= &btree_aops
;
1212 fs_info
->btree_inode
->i_mapping
->backing_dev_info
= &fs_info
->bdi
;
1214 extent_io_tree_init(&BTRFS_I(fs_info
->btree_inode
)->io_tree
,
1215 fs_info
->btree_inode
->i_mapping
,
1217 extent_map_tree_init(&BTRFS_I(fs_info
->btree_inode
)->extent_tree
,
1220 BTRFS_I(fs_info
->btree_inode
)->io_tree
.ops
= &btree_extent_io_ops
;
1222 extent_io_tree_init(&fs_info
->free_space_cache
,
1223 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
1224 extent_io_tree_init(&fs_info
->block_group_cache
,
1225 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
1226 extent_io_tree_init(&fs_info
->pinned_extents
,
1227 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
1228 extent_io_tree_init(&fs_info
->pending_del
,
1229 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
1230 extent_io_tree_init(&fs_info
->extent_ins
,
1231 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
1232 fs_info
->do_barriers
= 1;
1234 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
1235 INIT_WORK(&fs_info
->end_io_work
, btrfs_end_io_csum
, fs_info
);
1236 INIT_WORK(&fs_info
->async_submit_work
, btrfs_async_submit_work
,
1238 INIT_WORK(&fs_info
->trans_work
, btrfs_transaction_cleaner
, fs_info
);
1240 INIT_WORK(&fs_info
->end_io_work
, btrfs_end_io_csum
);
1241 INIT_WORK(&fs_info
->async_submit_work
, btrfs_async_submit_work
);
1242 INIT_DELAYED_WORK(&fs_info
->trans_work
, btrfs_transaction_cleaner
);
1244 BTRFS_I(fs_info
->btree_inode
)->root
= tree_root
;
1245 memset(&BTRFS_I(fs_info
->btree_inode
)->location
, 0,
1246 sizeof(struct btrfs_key
));
1247 insert_inode_hash(fs_info
->btree_inode
);
1248 mapping_set_gfp_mask(fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
1250 mutex_init(&fs_info
->trans_mutex
);
1251 mutex_init(&fs_info
->fs_mutex
);
1254 ret
= add_hasher(fs_info
, "crc32c");
1256 printk("btrfs: failed hash setup, modprobe cryptomgr?\n");
1261 __setup_root(4096, 4096, 4096, 4096, tree_root
,
1262 fs_info
, BTRFS_ROOT_TREE_OBJECTID
);
1265 bh
= __bread(fs_devices
->latest_bdev
,
1266 BTRFS_SUPER_INFO_OFFSET
/ 4096, 4096);
1270 memcpy(&fs_info
->super_copy
, bh
->b_data
, sizeof(fs_info
->super_copy
));
1273 memcpy(fs_info
->fsid
, fs_info
->super_copy
.fsid
, BTRFS_FSID_SIZE
);
1275 disk_super
= &fs_info
->super_copy
;
1276 if (!btrfs_super_root(disk_super
))
1277 goto fail_sb_buffer
;
1279 if (btrfs_super_num_devices(disk_super
) != fs_devices
->num_devices
) {
1280 printk("Btrfs: wanted %llu devices, but found %llu\n",
1281 (unsigned long long)btrfs_super_num_devices(disk_super
),
1282 (unsigned long long)fs_devices
->num_devices
);
1283 goto fail_sb_buffer
;
1285 fs_info
->bdi
.ra_pages
*= btrfs_super_num_devices(disk_super
);
1287 nodesize
= btrfs_super_nodesize(disk_super
);
1288 leafsize
= btrfs_super_leafsize(disk_super
);
1289 sectorsize
= btrfs_super_sectorsize(disk_super
);
1290 stripesize
= btrfs_super_stripesize(disk_super
);
1291 tree_root
->nodesize
= nodesize
;
1292 tree_root
->leafsize
= leafsize
;
1293 tree_root
->sectorsize
= sectorsize
;
1294 tree_root
->stripesize
= stripesize
;
1296 sb
->s_blocksize
= sectorsize
;
1297 sb
->s_blocksize_bits
= blksize_bits(sectorsize
);
1299 if (strncmp((char *)(&disk_super
->magic
), BTRFS_MAGIC
,
1300 sizeof(disk_super
->magic
))) {
1301 printk("btrfs: valid FS not found on %s\n", sb
->s_id
);
1302 goto fail_sb_buffer
;
1305 mutex_lock(&fs_info
->fs_mutex
);
1307 ret
= btrfs_read_sys_array(tree_root
);
1309 printk("btrfs: failed to read the system array on %s\n",
1311 goto fail_sys_array
;
1314 blocksize
= btrfs_level_size(tree_root
,
1315 btrfs_super_chunk_root_level(disk_super
));
1317 __setup_root(nodesize
, leafsize
, sectorsize
, stripesize
,
1318 chunk_root
, fs_info
, BTRFS_CHUNK_TREE_OBJECTID
);
1320 chunk_root
->node
= read_tree_block(chunk_root
,
1321 btrfs_super_chunk_root(disk_super
),
1323 BUG_ON(!chunk_root
->node
);
1325 read_extent_buffer(chunk_root
->node
, fs_info
->chunk_tree_uuid
,
1326 (unsigned long)btrfs_header_chunk_tree_uuid(chunk_root
->node
),
1329 ret
= btrfs_read_chunk_tree(chunk_root
);
1332 blocksize
= btrfs_level_size(tree_root
,
1333 btrfs_super_root_level(disk_super
));
1336 tree_root
->node
= read_tree_block(tree_root
,
1337 btrfs_super_root(disk_super
),
1339 if (!tree_root
->node
)
1340 goto fail_sb_buffer
;
1343 ret
= find_and_setup_root(tree_root
, fs_info
,
1344 BTRFS_EXTENT_TREE_OBJECTID
, extent_root
);
1346 goto fail_tree_root
;
1347 extent_root
->track_dirty
= 1;
1349 ret
= find_and_setup_root(tree_root
, fs_info
,
1350 BTRFS_DEV_TREE_OBJECTID
, dev_root
);
1351 dev_root
->track_dirty
= 1;
1354 goto fail_extent_root
;
1356 btrfs_read_block_groups(extent_root
);
1358 fs_info
->generation
= btrfs_super_generation(disk_super
) + 1;
1359 fs_info
->data_alloc_profile
= (u64
)-1;
1360 fs_info
->metadata_alloc_profile
= (u64
)-1;
1361 fs_info
->system_alloc_profile
= fs_info
->metadata_alloc_profile
;
1363 mutex_unlock(&fs_info
->fs_mutex
);
1367 free_extent_buffer(extent_root
->node
);
1369 free_extent_buffer(tree_root
->node
);
1371 mutex_unlock(&fs_info
->fs_mutex
);
1373 extent_io_tree_empty_lru(&BTRFS_I(fs_info
->btree_inode
)->io_tree
);
1375 iput(fs_info
->btree_inode
);
1377 close_all_devices(fs_info
);
1378 btrfs_mapping_tree_free(&fs_info
->mapping_tree
);
1382 #if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,23)
1383 bdi_destroy(&fs_info
->bdi
);
1386 return ERR_PTR(err
);
1389 static void btrfs_end_buffer_write_sync(struct buffer_head
*bh
, int uptodate
)
1391 char b
[BDEVNAME_SIZE
];
1394 set_buffer_uptodate(bh
);
1396 if (!buffer_eopnotsupp(bh
) && printk_ratelimit()) {
1397 printk(KERN_WARNING
"lost page write due to "
1398 "I/O error on %s\n",
1399 bdevname(bh
->b_bdev
, b
));
1401 /* note, we dont' set_buffer_write_io_error because we have
1402 * our own ways of dealing with the IO errors
1404 clear_buffer_uptodate(bh
);
1410 int write_all_supers(struct btrfs_root
*root
)
1412 struct list_head
*cur
;
1413 struct list_head
*head
= &root
->fs_info
->fs_devices
->devices
;
1414 struct btrfs_device
*dev
;
1415 struct btrfs_super_block
*sb
;
1416 struct btrfs_dev_item
*dev_item
;
1417 struct buffer_head
*bh
;
1421 int total_errors
= 0;
1425 max_errors
= btrfs_super_num_devices(&root
->fs_info
->super_copy
) - 1;
1426 do_barriers
= !btrfs_test_opt(root
, NOBARRIER
);
1428 sb
= &root
->fs_info
->super_for_commit
;
1429 dev_item
= &sb
->dev_item
;
1430 list_for_each(cur
, head
) {
1431 dev
= list_entry(cur
, struct btrfs_device
, dev_list
);
1432 btrfs_set_stack_device_type(dev_item
, dev
->type
);
1433 btrfs_set_stack_device_id(dev_item
, dev
->devid
);
1434 btrfs_set_stack_device_total_bytes(dev_item
, dev
->total_bytes
);
1435 btrfs_set_stack_device_bytes_used(dev_item
, dev
->bytes_used
);
1436 btrfs_set_stack_device_io_align(dev_item
, dev
->io_align
);
1437 btrfs_set_stack_device_io_width(dev_item
, dev
->io_width
);
1438 btrfs_set_stack_device_sector_size(dev_item
, dev
->sector_size
);
1439 memcpy(dev_item
->uuid
, dev
->uuid
, BTRFS_UUID_SIZE
);
1440 flags
= btrfs_super_flags(sb
);
1441 btrfs_set_super_flags(sb
, flags
| BTRFS_HEADER_FLAG_WRITTEN
);
1445 crc
= btrfs_csum_data(root
, (char *)sb
+ BTRFS_CSUM_SIZE
, crc
,
1446 BTRFS_SUPER_INFO_SIZE
- BTRFS_CSUM_SIZE
);
1447 btrfs_csum_final(crc
, sb
->csum
);
1449 bh
= __getblk(dev
->bdev
, BTRFS_SUPER_INFO_OFFSET
/ 4096,
1450 BTRFS_SUPER_INFO_SIZE
);
1452 memcpy(bh
->b_data
, sb
, BTRFS_SUPER_INFO_SIZE
);
1453 dev
->pending_io
= bh
;
1456 set_buffer_uptodate(bh
);
1458 bh
->b_end_io
= btrfs_end_buffer_write_sync
;
1460 if (do_barriers
&& dev
->barriers
) {
1461 ret
= submit_bh(WRITE_BARRIER
, bh
);
1462 if (ret
== -EOPNOTSUPP
) {
1463 printk("btrfs: disabling barriers on dev %s\n",
1465 set_buffer_uptodate(bh
);
1469 ret
= submit_bh(WRITE
, bh
);
1472 ret
= submit_bh(WRITE
, bh
);
1477 if (total_errors
> max_errors
) {
1478 printk("btrfs: %d errors while writing supers\n", total_errors
);
1483 list_for_each(cur
, head
) {
1484 dev
= list_entry(cur
, struct btrfs_device
, dev_list
);
1485 BUG_ON(!dev
->pending_io
);
1486 bh
= dev
->pending_io
;
1488 if (!buffer_uptodate(dev
->pending_io
)) {
1489 if (do_barriers
&& dev
->barriers
) {
1490 printk("btrfs: disabling barriers on dev %s\n",
1492 set_buffer_uptodate(bh
);
1496 ret
= submit_bh(WRITE
, bh
);
1499 if (!buffer_uptodate(bh
))
1506 dev
->pending_io
= NULL
;
1509 if (total_errors
> max_errors
) {
1510 printk("btrfs: %d errors while writing supers\n", total_errors
);
1516 int write_ctree_super(struct btrfs_trans_handle
*trans
, struct btrfs_root
1521 ret
= write_all_supers(root
);
1525 int btrfs_free_fs_root(struct btrfs_fs_info
*fs_info
, struct btrfs_root
*root
)
1527 radix_tree_delete(&fs_info
->fs_roots_radix
,
1528 (unsigned long)root
->root_key
.objectid
);
1530 btrfs_sysfs_del_root(root
);
1534 free_extent_buffer(root
->node
);
1535 if (root
->commit_root
)
1536 free_extent_buffer(root
->commit_root
);
1543 static int del_fs_roots(struct btrfs_fs_info
*fs_info
)
1546 struct btrfs_root
*gang
[8];
1550 ret
= radix_tree_gang_lookup(&fs_info
->fs_roots_radix
,
1555 for (i
= 0; i
< ret
; i
++)
1556 btrfs_free_fs_root(fs_info
, gang
[i
]);
1561 int close_ctree(struct btrfs_root
*root
)
1564 struct btrfs_trans_handle
*trans
;
1565 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
1567 fs_info
->closing
= 1;
1568 btrfs_transaction_flush_work(root
);
1569 mutex_lock(&fs_info
->fs_mutex
);
1570 btrfs_defrag_dirty_roots(root
->fs_info
);
1571 trans
= btrfs_start_transaction(root
, 1);
1572 ret
= btrfs_commit_transaction(trans
, root
);
1573 /* run commit again to drop the original snapshot */
1574 trans
= btrfs_start_transaction(root
, 1);
1575 btrfs_commit_transaction(trans
, root
);
1576 ret
= btrfs_write_and_wait_transaction(NULL
, root
);
1579 write_ctree_super(NULL
, root
);
1580 mutex_unlock(&fs_info
->fs_mutex
);
1582 btrfs_transaction_flush_work(root
);
1584 if (fs_info
->delalloc_bytes
) {
1585 printk("btrfs: at unmount delalloc count %Lu\n",
1586 fs_info
->delalloc_bytes
);
1588 if (fs_info
->extent_root
->node
)
1589 free_extent_buffer(fs_info
->extent_root
->node
);
1591 if (fs_info
->tree_root
->node
)
1592 free_extent_buffer(fs_info
->tree_root
->node
);
1594 if (root
->fs_info
->chunk_root
->node
);
1595 free_extent_buffer(root
->fs_info
->chunk_root
->node
);
1597 if (root
->fs_info
->dev_root
->node
);
1598 free_extent_buffer(root
->fs_info
->dev_root
->node
);
1600 btrfs_free_block_groups(root
->fs_info
);
1601 del_fs_roots(fs_info
);
1603 filemap_write_and_wait(fs_info
->btree_inode
->i_mapping
);
1605 extent_io_tree_empty_lru(&fs_info
->free_space_cache
);
1606 extent_io_tree_empty_lru(&fs_info
->block_group_cache
);
1607 extent_io_tree_empty_lru(&fs_info
->pinned_extents
);
1608 extent_io_tree_empty_lru(&fs_info
->pending_del
);
1609 extent_io_tree_empty_lru(&fs_info
->extent_ins
);
1610 extent_io_tree_empty_lru(&BTRFS_I(fs_info
->btree_inode
)->io_tree
);
1612 flush_workqueue(async_submit_workqueue
);
1613 flush_workqueue(end_io_workqueue
);
1615 truncate_inode_pages(fs_info
->btree_inode
->i_mapping
, 0);
1617 flush_workqueue(async_submit_workqueue
);
1618 destroy_workqueue(async_submit_workqueue
);
1620 flush_workqueue(end_io_workqueue
);
1621 destroy_workqueue(end_io_workqueue
);
1623 iput(fs_info
->btree_inode
);
1625 while(!list_empty(&fs_info
->hashers
)) {
1626 struct btrfs_hasher
*hasher
;
1627 hasher
= list_entry(fs_info
->hashers
.next
, struct btrfs_hasher
,
1629 list_del(&hasher
->hashers
);
1630 crypto_free_hash(&fs_info
->hash_tfm
);
1634 close_all_devices(fs_info
);
1635 btrfs_mapping_tree_free(&fs_info
->mapping_tree
);
1637 #if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,23)
1638 bdi_destroy(&fs_info
->bdi
);
1641 kfree(fs_info
->extent_root
);
1642 kfree(fs_info
->tree_root
);
1643 kfree(fs_info
->chunk_root
);
1644 kfree(fs_info
->dev_root
);
1648 int btrfs_buffer_uptodate(struct extent_buffer
*buf
, u64 parent_transid
)
1651 struct inode
*btree_inode
= buf
->first_page
->mapping
->host
;
1653 ret
= extent_buffer_uptodate(&BTRFS_I(btree_inode
)->io_tree
, buf
);
1657 ret
= verify_parent_transid(&BTRFS_I(btree_inode
)->io_tree
, buf
,
1662 int btrfs_set_buffer_uptodate(struct extent_buffer
*buf
)
1664 struct inode
*btree_inode
= buf
->first_page
->mapping
->host
;
1665 return set_extent_buffer_uptodate(&BTRFS_I(btree_inode
)->io_tree
,
1669 void btrfs_mark_buffer_dirty(struct extent_buffer
*buf
)
1671 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1672 u64 transid
= btrfs_header_generation(buf
);
1673 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1675 if (transid
!= root
->fs_info
->generation
) {
1676 printk(KERN_CRIT
"transid mismatch buffer %llu, found %Lu running %Lu\n",
1677 (unsigned long long)buf
->start
,
1678 transid
, root
->fs_info
->generation
);
1681 set_extent_buffer_dirty(&BTRFS_I(btree_inode
)->io_tree
, buf
);
1684 void btrfs_throttle(struct btrfs_root
*root
)
1686 struct backing_dev_info
*bdi
;
1688 bdi
= &root
->fs_info
->bdi
;
1689 if (root
->fs_info
->throttles
&& bdi_write_congested(bdi
)) {
1690 #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,18)
1691 congestion_wait(WRITE
, HZ
/20);
1693 blk_congestion_wait(WRITE
, HZ
/20);
1698 void btrfs_btree_balance_dirty(struct btrfs_root
*root
, unsigned long nr
)
1701 * looks as though older kernels can get into trouble with
1702 * this code, they end up stuck in balance_dirty_pages forever
1704 #if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,23)
1705 struct extent_io_tree
*tree
;
1708 unsigned long thresh
= 16 * 1024 * 1024;
1709 tree
= &BTRFS_I(root
->fs_info
->btree_inode
)->io_tree
;
1711 if (current_is_pdflush())
1714 num_dirty
= count_range_bits(tree
, &start
, (u64
)-1,
1715 thresh
, EXTENT_DIRTY
);
1716 if (num_dirty
> thresh
) {
1717 balance_dirty_pages_ratelimited_nr(
1718 root
->fs_info
->btree_inode
->i_mapping
, 1);
1725 void btrfs_set_buffer_defrag(struct extent_buffer
*buf
)
1727 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1728 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1729 set_extent_bits(&BTRFS_I(btree_inode
)->io_tree
, buf
->start
,
1730 buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG
, GFP_NOFS
);
1733 void btrfs_set_buffer_defrag_done(struct extent_buffer
*buf
)
1735 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1736 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1737 set_extent_bits(&BTRFS_I(btree_inode
)->io_tree
, buf
->start
,
1738 buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG_DONE
,
1742 int btrfs_buffer_defrag(struct extent_buffer
*buf
)
1744 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1745 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1746 return test_range_bit(&BTRFS_I(btree_inode
)->io_tree
,
1747 buf
->start
, buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG
, 0);
1750 int btrfs_buffer_defrag_done(struct extent_buffer
*buf
)
1752 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1753 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1754 return test_range_bit(&BTRFS_I(btree_inode
)->io_tree
,
1755 buf
->start
, buf
->start
+ buf
->len
- 1,
1756 EXTENT_DEFRAG_DONE
, 0);
1759 int btrfs_clear_buffer_defrag_done(struct extent_buffer
*buf
)
1761 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1762 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1763 return clear_extent_bits(&BTRFS_I(btree_inode
)->io_tree
,
1764 buf
->start
, buf
->start
+ buf
->len
- 1,
1765 EXTENT_DEFRAG_DONE
, GFP_NOFS
);
1768 int btrfs_clear_buffer_defrag(struct extent_buffer
*buf
)
1770 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1771 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1772 return clear_extent_bits(&BTRFS_I(btree_inode
)->io_tree
,
1773 buf
->start
, buf
->start
+ buf
->len
- 1,
1774 EXTENT_DEFRAG
, GFP_NOFS
);
1777 int btrfs_read_buffer(struct extent_buffer
*buf
, u64 parent_transid
)
1779 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1781 ret
= btree_read_extent_buffer_pages(root
, buf
, 0, parent_transid
);
1783 buf
->flags
|= EXTENT_UPTODATE
;
1788 static struct extent_io_ops btree_extent_io_ops
= {
1789 .writepage_io_hook
= btree_writepage_io_hook
,
1790 .readpage_end_io_hook
= btree_readpage_end_io_hook
,
1791 .submit_bio_hook
= btree_submit_bio_hook
,
1792 /* note we're sharing with inode.c for the merge bio hook */
1793 .merge_bio_hook
= btrfs_merge_bio_hook
,