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
);
81 spin_unlock(&em_tree
->lock
);
85 em
= alloc_extent_map(GFP_NOFS
);
87 em
= ERR_PTR(-ENOMEM
);
93 em
->bdev
= inode
->i_sb
->s_bdev
;
95 spin_lock(&em_tree
->lock
);
96 ret
= add_extent_mapping(em_tree
, em
);
98 u64 failed_start
= em
->start
;
99 u64 failed_len
= em
->len
;
101 printk("failed to insert %Lu %Lu -> %Lu into tree\n",
102 em
->start
, em
->len
, em
->block_start
);
104 em
= lookup_extent_mapping(em_tree
, start
, len
);
106 printk("after failing, found %Lu %Lu %Lu\n",
107 em
->start
, em
->len
, em
->block_start
);
110 em
= lookup_extent_mapping(em_tree
, failed_start
,
113 printk("double failure lookup gives us "
114 "%Lu %Lu -> %Lu\n", em
->start
,
115 em
->len
, em
->block_start
);
124 spin_unlock(&em_tree
->lock
);
132 u32
btrfs_csum_data(struct btrfs_root
*root
, char *data
, u32 seed
, size_t len
)
134 return btrfs_crc32c(seed
, data
, len
);
137 void btrfs_csum_final(u32 crc
, char *result
)
139 *(__le32
*)result
= ~cpu_to_le32(crc
);
142 static int csum_tree_block(struct btrfs_root
*root
, struct extent_buffer
*buf
,
145 char result
[BTRFS_CRC32_SIZE
];
147 unsigned long cur_len
;
148 unsigned long offset
= BTRFS_CSUM_SIZE
;
149 char *map_token
= NULL
;
151 unsigned long map_start
;
152 unsigned long map_len
;
156 len
= buf
->len
- offset
;
158 err
= map_private_extent_buffer(buf
, offset
, 32,
160 &map_start
, &map_len
, KM_USER0
);
162 printk("failed to map extent buffer! %lu\n",
166 cur_len
= min(len
, map_len
- (offset
- map_start
));
167 crc
= btrfs_csum_data(root
, kaddr
+ offset
- map_start
,
171 unmap_extent_buffer(buf
, map_token
, KM_USER0
);
173 btrfs_csum_final(crc
, result
);
176 int from_this_trans
= 0;
178 if (root
->fs_info
->running_transaction
&&
179 btrfs_header_generation(buf
) ==
180 root
->fs_info
->running_transaction
->transid
)
183 /* FIXME, this is not good */
184 if (memcmp_extent_buffer(buf
, result
, 0, BTRFS_CRC32_SIZE
)) {
187 memcpy(&found
, result
, BTRFS_CRC32_SIZE
);
189 read_extent_buffer(buf
, &val
, 0, BTRFS_CRC32_SIZE
);
190 printk("btrfs: %s checksum verify failed on %llu "
191 "wanted %X found %X from_this_trans %d "
193 root
->fs_info
->sb
->s_id
,
194 buf
->start
, val
, found
, from_this_trans
,
195 btrfs_header_level(buf
));
199 write_extent_buffer(buf
, result
, 0, BTRFS_CRC32_SIZE
);
204 static int btree_read_extent_buffer_pages(struct btrfs_root
*root
,
205 struct extent_buffer
*eb
,
208 struct extent_io_tree
*io_tree
;
213 io_tree
= &BTRFS_I(root
->fs_info
->btree_inode
)->io_tree
;
215 ret
= read_extent_buffer_pages(io_tree
, eb
, start
, 1,
216 btree_get_extent
, mirror_num
);
220 num_copies
= btrfs_num_copies(&root
->fs_info
->mapping_tree
,
226 if (mirror_num
> num_copies
)
232 int csum_dirty_buffer(struct btrfs_root
*root
, struct page
*page
)
234 struct extent_io_tree
*tree
;
235 u64 start
= (u64
)page
->index
<< PAGE_CACHE_SHIFT
;
239 struct extent_buffer
*eb
;
242 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
244 if (page
->private == EXTENT_PAGE_PRIVATE
)
248 len
= page
->private >> 2;
252 eb
= alloc_extent_buffer(tree
, start
, len
, page
, GFP_NOFS
);
253 ret
= btree_read_extent_buffer_pages(root
, eb
, start
+ PAGE_CACHE_SIZE
);
255 btrfs_clear_buffer_defrag(eb
);
256 found_start
= btrfs_header_bytenr(eb
);
257 if (found_start
!= start
) {
258 printk("warning: eb start incorrect %Lu buffer %Lu len %lu\n",
259 start
, found_start
, len
);
263 if (eb
->first_page
!= page
) {
264 printk("bad first page %lu %lu\n", eb
->first_page
->index
,
269 if (!PageUptodate(page
)) {
270 printk("csum not up to date page %lu\n", page
->index
);
274 found_level
= btrfs_header_level(eb
);
275 spin_lock(&root
->fs_info
->hash_lock
);
276 btrfs_set_header_flag(eb
, BTRFS_HEADER_FLAG_WRITTEN
);
277 spin_unlock(&root
->fs_info
->hash_lock
);
278 csum_tree_block(root
, eb
, 0);
280 free_extent_buffer(eb
);
285 static int btree_writepage_io_hook(struct page
*page
, u64 start
, u64 end
)
287 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
289 csum_dirty_buffer(root
, page
);
293 int btree_readpage_end_io_hook(struct page
*page
, u64 start
, u64 end
,
294 struct extent_state
*state
)
296 struct extent_io_tree
*tree
;
300 struct extent_buffer
*eb
;
301 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
304 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
305 if (page
->private == EXTENT_PAGE_PRIVATE
)
309 len
= page
->private >> 2;
313 eb
= alloc_extent_buffer(tree
, start
, len
, page
, GFP_NOFS
);
315 btrfs_clear_buffer_defrag(eb
);
316 found_start
= btrfs_header_bytenr(eb
);
317 if (found_start
!= start
) {
321 if (eb
->first_page
!= page
) {
322 printk("bad first page %lu %lu\n", eb
->first_page
->index
,
328 found_level
= btrfs_header_level(eb
);
330 ret
= csum_tree_block(root
, eb
, 1);
334 end
= min_t(u64
, eb
->len
, PAGE_CACHE_SIZE
);
335 end
= eb
->start
+ end
- 1;
336 release_extent_buffer_tail_pages(eb
);
338 free_extent_buffer(eb
);
343 #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
344 static void end_workqueue_bio(struct bio
*bio
, int err
)
346 static int end_workqueue_bio(struct bio
*bio
,
347 unsigned int bytes_done
, int err
)
350 struct end_io_wq
*end_io_wq
= bio
->bi_private
;
351 struct btrfs_fs_info
*fs_info
;
354 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
359 fs_info
= end_io_wq
->info
;
360 spin_lock_irqsave(&fs_info
->end_io_work_lock
, flags
);
361 end_io_wq
->error
= err
;
362 list_add_tail(&end_io_wq
->list
, &fs_info
->end_io_work_list
);
363 spin_unlock_irqrestore(&fs_info
->end_io_work_lock
, flags
);
364 queue_work(end_io_workqueue
, &fs_info
->end_io_work
);
366 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
371 int btrfs_bio_wq_end_io(struct btrfs_fs_info
*info
, struct bio
*bio
,
374 struct end_io_wq
*end_io_wq
;
375 end_io_wq
= kmalloc(sizeof(*end_io_wq
), GFP_NOFS
);
379 end_io_wq
->private = bio
->bi_private
;
380 end_io_wq
->end_io
= bio
->bi_end_io
;
381 end_io_wq
->info
= info
;
382 end_io_wq
->error
= 0;
383 end_io_wq
->bio
= bio
;
384 end_io_wq
->metadata
= metadata
;
386 bio
->bi_private
= end_io_wq
;
387 bio
->bi_end_io
= end_workqueue_bio
;
391 int btrfs_wq_submit_bio(struct btrfs_fs_info
*fs_info
, struct inode
*inode
,
392 int rw
, struct bio
*bio
, int mirror_num
,
393 extent_submit_bio_hook_t
*submit_bio_hook
)
395 struct async_submit_bio
*async
;
398 * inline writerback should stay inline, only hop to the async
399 * queue if we're pdflush
401 if (!current_is_pdflush())
402 return submit_bio_hook(inode
, rw
, bio
, mirror_num
);
404 async
= kmalloc(sizeof(*async
), GFP_NOFS
);
408 async
->inode
= inode
;
411 async
->mirror_num
= mirror_num
;
412 async
->submit_bio_hook
= submit_bio_hook
;
414 spin_lock(&fs_info
->async_submit_work_lock
);
415 list_add_tail(&async
->list
, &fs_info
->async_submit_work_list
);
416 spin_unlock(&fs_info
->async_submit_work_lock
);
418 queue_work(async_submit_workqueue
, &fs_info
->async_submit_work
);
422 static int __btree_submit_bio_hook(struct inode
*inode
, int rw
, struct bio
*bio
,
425 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
429 offset
= bio
->bi_sector
<< 9;
431 if (rw
& (1 << BIO_RW
)) {
432 return btrfs_map_bio(BTRFS_I(inode
)->root
, rw
, bio
, mirror_num
);
435 ret
= btrfs_bio_wq_end_io(root
->fs_info
, bio
, 1);
438 if (offset
== BTRFS_SUPER_INFO_OFFSET
) {
439 bio
->bi_bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
443 return btrfs_map_bio(BTRFS_I(inode
)->root
, rw
, bio
, mirror_num
);
446 static int btree_submit_bio_hook(struct inode
*inode
, int rw
, struct bio
*bio
,
449 if (!(rw
& (1 << BIO_RW
))) {
450 return __btree_submit_bio_hook(inode
, rw
, bio
, mirror_num
);
452 return btrfs_wq_submit_bio(BTRFS_I(inode
)->root
->fs_info
,
453 inode
, rw
, bio
, mirror_num
,
454 __btree_submit_bio_hook
);
457 static int btree_writepage(struct page
*page
, struct writeback_control
*wbc
)
459 struct extent_io_tree
*tree
;
460 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
461 return extent_write_full_page(tree
, page
, btree_get_extent
, wbc
);
464 static int btree_writepages(struct address_space
*mapping
,
465 struct writeback_control
*wbc
)
467 struct extent_io_tree
*tree
;
468 tree
= &BTRFS_I(mapping
->host
)->io_tree
;
469 if (wbc
->sync_mode
== WB_SYNC_NONE
) {
472 unsigned long thresh
= 96 * 1024 * 1024;
474 if (wbc
->for_kupdate
)
477 if (current_is_pdflush()) {
478 thresh
= 96 * 1024 * 1024;
480 thresh
= 8 * 1024 * 1024;
482 num_dirty
= count_range_bits(tree
, &start
, (u64
)-1,
483 thresh
, EXTENT_DIRTY
);
484 if (num_dirty
< thresh
) {
488 return extent_writepages(tree
, mapping
, btree_get_extent
, wbc
);
491 int btree_readpage(struct file
*file
, struct page
*page
)
493 struct extent_io_tree
*tree
;
494 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
495 return extent_read_full_page(tree
, page
, btree_get_extent
);
498 static int btree_releasepage(struct page
*page
, gfp_t gfp_flags
)
500 struct extent_io_tree
*tree
;
501 struct extent_map_tree
*map
;
504 if (page_count(page
) > 3) {
505 /* once for page->private, once for the caller, once
506 * once for the page cache
510 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
511 map
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
512 ret
= try_release_extent_state(map
, tree
, page
, gfp_flags
);
514 invalidate_extent_lru(tree
, page_offset(page
), PAGE_CACHE_SIZE
);
515 ClearPagePrivate(page
);
516 set_page_private(page
, 0);
517 page_cache_release(page
);
522 static void btree_invalidatepage(struct page
*page
, unsigned long offset
)
524 struct extent_io_tree
*tree
;
525 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
526 extent_invalidatepage(tree
, page
, offset
);
527 btree_releasepage(page
, GFP_NOFS
);
528 if (PagePrivate(page
)) {
529 invalidate_extent_lru(tree
, page_offset(page
), PAGE_CACHE_SIZE
);
530 ClearPagePrivate(page
);
531 set_page_private(page
, 0);
532 page_cache_release(page
);
537 static int btree_writepage(struct page
*page
, struct writeback_control
*wbc
)
539 struct buffer_head
*bh
;
540 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
541 struct buffer_head
*head
;
542 if (!page_has_buffers(page
)) {
543 create_empty_buffers(page
, root
->fs_info
->sb
->s_blocksize
,
544 (1 << BH_Dirty
)|(1 << BH_Uptodate
));
546 head
= page_buffers(page
);
549 if (buffer_dirty(bh
))
550 csum_tree_block(root
, bh
, 0);
551 bh
= bh
->b_this_page
;
552 } while (bh
!= head
);
553 return block_write_full_page(page
, btree_get_block
, wbc
);
557 static struct address_space_operations btree_aops
= {
558 .readpage
= btree_readpage
,
559 .writepage
= btree_writepage
,
560 .writepages
= btree_writepages
,
561 .releasepage
= btree_releasepage
,
562 .invalidatepage
= btree_invalidatepage
,
563 .sync_page
= block_sync_page
,
566 int readahead_tree_block(struct btrfs_root
*root
, u64 bytenr
, u32 blocksize
)
568 struct extent_buffer
*buf
= NULL
;
569 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
572 buf
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
575 read_extent_buffer_pages(&BTRFS_I(btree_inode
)->io_tree
,
576 buf
, 0, 0, btree_get_extent
, 0);
577 free_extent_buffer(buf
);
581 static int close_all_devices(struct btrfs_fs_info
*fs_info
)
583 struct list_head
*list
;
584 struct list_head
*next
;
585 struct btrfs_device
*device
;
587 list
= &fs_info
->fs_devices
->devices
;
588 list_for_each(next
, list
) {
589 device
= list_entry(next
, struct btrfs_device
, dev_list
);
590 if (device
->bdev
&& device
->bdev
!= fs_info
->sb
->s_bdev
)
591 close_bdev_excl(device
->bdev
);
597 int btrfs_verify_block_csum(struct btrfs_root
*root
,
598 struct extent_buffer
*buf
)
600 return btrfs_buffer_uptodate(buf
);
603 struct extent_buffer
*btrfs_find_tree_block(struct btrfs_root
*root
,
604 u64 bytenr
, u32 blocksize
)
606 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
607 struct extent_buffer
*eb
;
608 eb
= find_extent_buffer(&BTRFS_I(btree_inode
)->io_tree
,
609 bytenr
, blocksize
, GFP_NOFS
);
613 struct extent_buffer
*btrfs_find_create_tree_block(struct btrfs_root
*root
,
614 u64 bytenr
, u32 blocksize
)
616 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
617 struct extent_buffer
*eb
;
619 eb
= alloc_extent_buffer(&BTRFS_I(btree_inode
)->io_tree
,
620 bytenr
, blocksize
, NULL
, GFP_NOFS
);
625 struct extent_buffer
*read_tree_block(struct btrfs_root
*root
, u64 bytenr
,
628 struct extent_buffer
*buf
= NULL
;
629 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
630 struct extent_io_tree
*io_tree
;
633 io_tree
= &BTRFS_I(btree_inode
)->io_tree
;
635 buf
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
639 ret
= btree_read_extent_buffer_pages(root
, buf
, 0);
642 buf
->flags
|= EXTENT_UPTODATE
;
648 int clean_tree_block(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
649 struct extent_buffer
*buf
)
651 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
652 if (btrfs_header_generation(buf
) ==
653 root
->fs_info
->running_transaction
->transid
)
654 clear_extent_buffer_dirty(&BTRFS_I(btree_inode
)->io_tree
,
659 int wait_on_tree_block_writeback(struct btrfs_root
*root
,
660 struct extent_buffer
*buf
)
662 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
663 wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode
)->io_tree
,
668 static int __setup_root(u32 nodesize
, u32 leafsize
, u32 sectorsize
,
669 u32 stripesize
, struct btrfs_root
*root
,
670 struct btrfs_fs_info
*fs_info
,
675 root
->commit_root
= NULL
;
676 root
->sectorsize
= sectorsize
;
677 root
->nodesize
= nodesize
;
678 root
->leafsize
= leafsize
;
679 root
->stripesize
= stripesize
;
681 root
->track_dirty
= 0;
683 root
->fs_info
= fs_info
;
684 root
->objectid
= objectid
;
685 root
->last_trans
= 0;
686 root
->highest_inode
= 0;
687 root
->last_inode_alloc
= 0;
691 INIT_LIST_HEAD(&root
->dirty_list
);
692 memset(&root
->root_key
, 0, sizeof(root
->root_key
));
693 memset(&root
->root_item
, 0, sizeof(root
->root_item
));
694 memset(&root
->defrag_progress
, 0, sizeof(root
->defrag_progress
));
695 memset(&root
->root_kobj
, 0, sizeof(root
->root_kobj
));
696 init_completion(&root
->kobj_unregister
);
697 root
->defrag_running
= 0;
698 root
->defrag_level
= 0;
699 root
->root_key
.objectid
= objectid
;
703 static int find_and_setup_root(struct btrfs_root
*tree_root
,
704 struct btrfs_fs_info
*fs_info
,
706 struct btrfs_root
*root
)
711 __setup_root(tree_root
->nodesize
, tree_root
->leafsize
,
712 tree_root
->sectorsize
, tree_root
->stripesize
,
713 root
, fs_info
, objectid
);
714 ret
= btrfs_find_last_root(tree_root
, objectid
,
715 &root
->root_item
, &root
->root_key
);
718 blocksize
= btrfs_level_size(root
, btrfs_root_level(&root
->root_item
));
719 root
->node
= read_tree_block(root
, btrfs_root_bytenr(&root
->root_item
),
725 struct btrfs_root
*btrfs_read_fs_root_no_radix(struct btrfs_fs_info
*fs_info
,
726 struct btrfs_key
*location
)
728 struct btrfs_root
*root
;
729 struct btrfs_root
*tree_root
= fs_info
->tree_root
;
730 struct btrfs_path
*path
;
731 struct extent_buffer
*l
;
736 root
= kzalloc(sizeof(*root
), GFP_NOFS
);
738 return ERR_PTR(-ENOMEM
);
739 if (location
->offset
== (u64
)-1) {
740 ret
= find_and_setup_root(tree_root
, fs_info
,
741 location
->objectid
, root
);
749 __setup_root(tree_root
->nodesize
, tree_root
->leafsize
,
750 tree_root
->sectorsize
, tree_root
->stripesize
,
751 root
, fs_info
, location
->objectid
);
753 path
= btrfs_alloc_path();
755 ret
= btrfs_search_slot(NULL
, tree_root
, location
, path
, 0, 0);
762 read_extent_buffer(l
, &root
->root_item
,
763 btrfs_item_ptr_offset(l
, path
->slots
[0]),
764 sizeof(root
->root_item
));
765 memcpy(&root
->root_key
, location
, sizeof(*location
));
768 btrfs_release_path(root
, path
);
769 btrfs_free_path(path
);
774 blocksize
= btrfs_level_size(root
, btrfs_root_level(&root
->root_item
));
775 root
->node
= read_tree_block(root
, btrfs_root_bytenr(&root
->root_item
),
780 ret
= btrfs_find_highest_inode(root
, &highest_inode
);
782 root
->highest_inode
= highest_inode
;
783 root
->last_inode_alloc
= highest_inode
;
788 struct btrfs_root
*btrfs_lookup_fs_root(struct btrfs_fs_info
*fs_info
,
791 struct btrfs_root
*root
;
793 if (root_objectid
== BTRFS_ROOT_TREE_OBJECTID
)
794 return fs_info
->tree_root
;
795 if (root_objectid
== BTRFS_EXTENT_TREE_OBJECTID
)
796 return fs_info
->extent_root
;
798 root
= radix_tree_lookup(&fs_info
->fs_roots_radix
,
799 (unsigned long)root_objectid
);
803 struct btrfs_root
*btrfs_read_fs_root_no_name(struct btrfs_fs_info
*fs_info
,
804 struct btrfs_key
*location
)
806 struct btrfs_root
*root
;
809 if (location
->objectid
== BTRFS_ROOT_TREE_OBJECTID
)
810 return fs_info
->tree_root
;
811 if (location
->objectid
== BTRFS_EXTENT_TREE_OBJECTID
)
812 return fs_info
->extent_root
;
813 if (location
->objectid
== BTRFS_CHUNK_TREE_OBJECTID
)
814 return fs_info
->chunk_root
;
815 if (location
->objectid
== BTRFS_DEV_TREE_OBJECTID
)
816 return fs_info
->dev_root
;
818 root
= radix_tree_lookup(&fs_info
->fs_roots_radix
,
819 (unsigned long)location
->objectid
);
823 root
= btrfs_read_fs_root_no_radix(fs_info
, location
);
826 ret
= radix_tree_insert(&fs_info
->fs_roots_radix
,
827 (unsigned long)root
->root_key
.objectid
,
830 free_extent_buffer(root
->node
);
834 ret
= btrfs_find_dead_roots(fs_info
->tree_root
,
835 root
->root_key
.objectid
, root
);
841 struct btrfs_root
*btrfs_read_fs_root(struct btrfs_fs_info
*fs_info
,
842 struct btrfs_key
*location
,
843 const char *name
, int namelen
)
845 struct btrfs_root
*root
;
848 root
= btrfs_read_fs_root_no_name(fs_info
, location
);
855 ret
= btrfs_set_root_name(root
, name
, namelen
);
857 free_extent_buffer(root
->node
);
862 ret
= btrfs_sysfs_add_root(root
);
864 free_extent_buffer(root
->node
);
873 static int add_hasher(struct btrfs_fs_info
*info
, char *type
) {
874 struct btrfs_hasher
*hasher
;
876 hasher
= kmalloc(sizeof(*hasher
), GFP_NOFS
);
879 hasher
->hash_tfm
= crypto_alloc_hash(type
, 0, CRYPTO_ALG_ASYNC
);
880 if (!hasher
->hash_tfm
) {
884 spin_lock(&info
->hash_lock
);
885 list_add(&hasher
->list
, &info
->hashers
);
886 spin_unlock(&info
->hash_lock
);
891 static int btrfs_congested_fn(void *congested_data
, int bdi_bits
)
893 struct btrfs_fs_info
*info
= (struct btrfs_fs_info
*)congested_data
;
895 struct list_head
*cur
;
896 struct btrfs_device
*device
;
897 struct backing_dev_info
*bdi
;
899 list_for_each(cur
, &info
->fs_devices
->devices
) {
900 device
= list_entry(cur
, struct btrfs_device
, dev_list
);
901 bdi
= blk_get_backing_dev_info(device
->bdev
);
902 if (bdi
&& bdi_congested(bdi
, bdi_bits
)) {
911 * this unplugs every device on the box, and it is only used when page
914 static void __unplug_io_fn(struct backing_dev_info
*bdi
, struct page
*page
)
916 struct list_head
*cur
;
917 struct btrfs_device
*device
;
918 struct btrfs_fs_info
*info
;
920 info
= (struct btrfs_fs_info
*)bdi
->unplug_io_data
;
921 list_for_each(cur
, &info
->fs_devices
->devices
) {
922 device
= list_entry(cur
, struct btrfs_device
, dev_list
);
923 bdi
= blk_get_backing_dev_info(device
->bdev
);
924 if (bdi
->unplug_io_fn
) {
925 bdi
->unplug_io_fn(bdi
, page
);
930 void btrfs_unplug_io_fn(struct backing_dev_info
*bdi
, struct page
*page
)
933 struct extent_map_tree
*em_tree
;
934 struct extent_map
*em
;
935 struct address_space
*mapping
;
938 /* the generic O_DIRECT read code does this */
940 __unplug_io_fn(bdi
, page
);
945 * page->mapping may change at any time. Get a consistent copy
946 * and use that for everything below
949 mapping
= page
->mapping
;
953 inode
= mapping
->host
;
954 offset
= page_offset(page
);
956 em_tree
= &BTRFS_I(inode
)->extent_tree
;
957 spin_lock(&em_tree
->lock
);
958 em
= lookup_extent_mapping(em_tree
, offset
, PAGE_CACHE_SIZE
);
959 spin_unlock(&em_tree
->lock
);
963 offset
= offset
- em
->start
;
964 btrfs_unplug_page(&BTRFS_I(inode
)->root
->fs_info
->mapping_tree
,
965 em
->block_start
+ offset
, page
);
969 static int setup_bdi(struct btrfs_fs_info
*info
, struct backing_dev_info
*bdi
)
971 #if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,23)
974 bdi
->ra_pages
= default_backing_dev_info
.ra_pages
;
976 bdi
->capabilities
= default_backing_dev_info
.capabilities
;
977 bdi
->unplug_io_fn
= btrfs_unplug_io_fn
;
978 bdi
->unplug_io_data
= info
;
979 bdi
->congested_fn
= btrfs_congested_fn
;
980 bdi
->congested_data
= info
;
984 static int bio_ready_for_csum(struct bio
*bio
)
990 struct extent_io_tree
*io_tree
= NULL
;
991 struct btrfs_fs_info
*info
= NULL
;
992 struct bio_vec
*bvec
;
996 bio_for_each_segment(bvec
, bio
, i
) {
997 page
= bvec
->bv_page
;
998 if (page
->private == EXTENT_PAGE_PRIVATE
) {
999 length
+= bvec
->bv_len
;
1002 if (!page
->private) {
1003 length
+= bvec
->bv_len
;
1006 length
= bvec
->bv_len
;
1007 buf_len
= page
->private >> 2;
1008 start
= page_offset(page
) + bvec
->bv_offset
;
1009 io_tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
1010 info
= BTRFS_I(page
->mapping
->host
)->root
->fs_info
;
1012 /* are we fully contained in this bio? */
1013 if (buf_len
<= length
)
1016 ret
= extent_range_uptodate(io_tree
, start
+ length
,
1017 start
+ buf_len
- 1);
1023 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
1024 static void btrfs_end_io_csum(void *p
)
1026 static void btrfs_end_io_csum(struct work_struct
*work
)
1029 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
1030 struct btrfs_fs_info
*fs_info
= p
;
1032 struct btrfs_fs_info
*fs_info
= container_of(work
,
1033 struct btrfs_fs_info
,
1036 unsigned long flags
;
1037 struct end_io_wq
*end_io_wq
;
1039 struct list_head
*next
;
1044 spin_lock_irqsave(&fs_info
->end_io_work_lock
, flags
);
1045 if (list_empty(&fs_info
->end_io_work_list
)) {
1046 spin_unlock_irqrestore(&fs_info
->end_io_work_lock
,
1050 next
= fs_info
->end_io_work_list
.next
;
1052 spin_unlock_irqrestore(&fs_info
->end_io_work_lock
, flags
);
1054 end_io_wq
= list_entry(next
, struct end_io_wq
, list
);
1056 bio
= end_io_wq
->bio
;
1057 if (end_io_wq
->metadata
&& !bio_ready_for_csum(bio
)) {
1058 spin_lock_irqsave(&fs_info
->end_io_work_lock
, flags
);
1059 was_empty
= list_empty(&fs_info
->end_io_work_list
);
1060 list_add_tail(&end_io_wq
->list
,
1061 &fs_info
->end_io_work_list
);
1062 spin_unlock_irqrestore(&fs_info
->end_io_work_lock
,
1068 error
= end_io_wq
->error
;
1069 bio
->bi_private
= end_io_wq
->private;
1070 bio
->bi_end_io
= end_io_wq
->end_io
;
1072 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1073 bio_endio(bio
, bio
->bi_size
, error
);
1075 bio_endio(bio
, error
);
1080 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
1081 static void btrfs_async_submit_work(void *p
)
1083 static void btrfs_async_submit_work(struct work_struct
*work
)
1086 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
1087 struct btrfs_fs_info
*fs_info
= p
;
1089 struct btrfs_fs_info
*fs_info
= container_of(work
,
1090 struct btrfs_fs_info
,
1093 struct async_submit_bio
*async
;
1094 struct list_head
*next
;
1097 spin_lock(&fs_info
->async_submit_work_lock
);
1098 if (list_empty(&fs_info
->async_submit_work_list
)) {
1099 spin_unlock(&fs_info
->async_submit_work_lock
);
1102 next
= fs_info
->async_submit_work_list
.next
;
1104 spin_unlock(&fs_info
->async_submit_work_lock
);
1106 async
= list_entry(next
, struct async_submit_bio
, list
);
1107 async
->submit_bio_hook(async
->inode
, async
->rw
, async
->bio
,
1113 struct btrfs_root
*open_ctree(struct super_block
*sb
,
1114 struct btrfs_fs_devices
*fs_devices
)
1121 struct btrfs_root
*extent_root
= kmalloc(sizeof(struct btrfs_root
),
1123 struct btrfs_root
*tree_root
= kmalloc(sizeof(struct btrfs_root
),
1125 struct btrfs_fs_info
*fs_info
= kzalloc(sizeof(*fs_info
),
1127 struct btrfs_root
*chunk_root
= kmalloc(sizeof(struct btrfs_root
),
1129 struct btrfs_root
*dev_root
= kmalloc(sizeof(struct btrfs_root
),
1133 struct btrfs_super_block
*disk_super
;
1135 if (!extent_root
|| !tree_root
|| !fs_info
) {
1139 end_io_workqueue
= create_workqueue("btrfs-end-io");
1140 BUG_ON(!end_io_workqueue
);
1141 async_submit_workqueue
= create_workqueue("btrfs-async-submit");
1143 INIT_RADIX_TREE(&fs_info
->fs_roots_radix
, GFP_NOFS
);
1144 INIT_LIST_HEAD(&fs_info
->trans_list
);
1145 INIT_LIST_HEAD(&fs_info
->dead_roots
);
1146 INIT_LIST_HEAD(&fs_info
->hashers
);
1147 INIT_LIST_HEAD(&fs_info
->end_io_work_list
);
1148 INIT_LIST_HEAD(&fs_info
->async_submit_work_list
);
1149 spin_lock_init(&fs_info
->hash_lock
);
1150 spin_lock_init(&fs_info
->end_io_work_lock
);
1151 spin_lock_init(&fs_info
->async_submit_work_lock
);
1152 spin_lock_init(&fs_info
->delalloc_lock
);
1153 spin_lock_init(&fs_info
->new_trans_lock
);
1155 init_completion(&fs_info
->kobj_unregister
);
1156 sb_set_blocksize(sb
, BTRFS_SUPER_INFO_SIZE
);
1157 fs_info
->tree_root
= tree_root
;
1158 fs_info
->extent_root
= extent_root
;
1159 fs_info
->chunk_root
= chunk_root
;
1160 fs_info
->dev_root
= dev_root
;
1161 fs_info
->fs_devices
= fs_devices
;
1162 INIT_LIST_HEAD(&fs_info
->dirty_cowonly_roots
);
1163 INIT_LIST_HEAD(&fs_info
->space_info
);
1164 btrfs_mapping_init(&fs_info
->mapping_tree
);
1166 fs_info
->max_extent
= (u64
)-1;
1167 fs_info
->max_inline
= 8192 * 1024;
1168 setup_bdi(fs_info
, &fs_info
->bdi
);
1169 fs_info
->btree_inode
= new_inode(sb
);
1170 fs_info
->btree_inode
->i_ino
= 1;
1171 fs_info
->btree_inode
->i_nlink
= 1;
1174 * we set the i_size on the btree inode to the max possible int.
1175 * the real end of the address space is determined by all of
1176 * the devices in the system
1178 fs_info
->btree_inode
->i_size
= OFFSET_MAX
;
1179 fs_info
->btree_inode
->i_mapping
->a_ops
= &btree_aops
;
1180 fs_info
->btree_inode
->i_mapping
->backing_dev_info
= &fs_info
->bdi
;
1182 extent_io_tree_init(&BTRFS_I(fs_info
->btree_inode
)->io_tree
,
1183 fs_info
->btree_inode
->i_mapping
,
1185 extent_map_tree_init(&BTRFS_I(fs_info
->btree_inode
)->extent_tree
,
1188 BTRFS_I(fs_info
->btree_inode
)->io_tree
.ops
= &btree_extent_io_ops
;
1190 extent_io_tree_init(&fs_info
->free_space_cache
,
1191 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
1192 extent_io_tree_init(&fs_info
->block_group_cache
,
1193 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
1194 extent_io_tree_init(&fs_info
->pinned_extents
,
1195 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
1196 extent_io_tree_init(&fs_info
->pending_del
,
1197 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
1198 extent_io_tree_init(&fs_info
->extent_ins
,
1199 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
1200 fs_info
->do_barriers
= 1;
1202 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
1203 INIT_WORK(&fs_info
->end_io_work
, btrfs_end_io_csum
, fs_info
);
1204 INIT_WORK(&fs_info
->async_submit_work
, btrfs_async_submit_work
,
1206 INIT_WORK(&fs_info
->trans_work
, btrfs_transaction_cleaner
, fs_info
);
1208 INIT_WORK(&fs_info
->end_io_work
, btrfs_end_io_csum
);
1209 INIT_WORK(&fs_info
->async_submit_work
, btrfs_async_submit_work
);
1210 INIT_DELAYED_WORK(&fs_info
->trans_work
, btrfs_transaction_cleaner
);
1212 BTRFS_I(fs_info
->btree_inode
)->root
= tree_root
;
1213 memset(&BTRFS_I(fs_info
->btree_inode
)->location
, 0,
1214 sizeof(struct btrfs_key
));
1215 insert_inode_hash(fs_info
->btree_inode
);
1216 mapping_set_gfp_mask(fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
1218 mutex_init(&fs_info
->trans_mutex
);
1219 mutex_init(&fs_info
->fs_mutex
);
1222 ret
= add_hasher(fs_info
, "crc32c");
1224 printk("btrfs: failed hash setup, modprobe cryptomgr?\n");
1229 __setup_root(4096, 4096, 4096, 4096, tree_root
,
1230 fs_info
, BTRFS_ROOT_TREE_OBJECTID
);
1232 fs_info
->sb_buffer
= read_tree_block(tree_root
,
1233 BTRFS_SUPER_INFO_OFFSET
,
1236 if (!fs_info
->sb_buffer
)
1239 read_extent_buffer(fs_info
->sb_buffer
, &fs_info
->super_copy
, 0,
1240 sizeof(fs_info
->super_copy
));
1242 read_extent_buffer(fs_info
->sb_buffer
, fs_info
->fsid
,
1243 (unsigned long)btrfs_super_fsid(fs_info
->sb_buffer
),
1246 disk_super
= &fs_info
->super_copy
;
1247 if (!btrfs_super_root(disk_super
))
1248 goto fail_sb_buffer
;
1250 if (btrfs_super_num_devices(disk_super
) != fs_devices
->num_devices
) {
1251 printk("Btrfs: wanted %llu devices, but found %llu\n",
1252 (unsigned long long)btrfs_super_num_devices(disk_super
),
1253 (unsigned long long)fs_devices
->num_devices
);
1254 goto fail_sb_buffer
;
1256 fs_info
->bdi
.ra_pages
*= btrfs_super_num_devices(disk_super
);
1258 nodesize
= btrfs_super_nodesize(disk_super
);
1259 leafsize
= btrfs_super_leafsize(disk_super
);
1260 sectorsize
= btrfs_super_sectorsize(disk_super
);
1261 stripesize
= btrfs_super_stripesize(disk_super
);
1262 tree_root
->nodesize
= nodesize
;
1263 tree_root
->leafsize
= leafsize
;
1264 tree_root
->sectorsize
= sectorsize
;
1265 tree_root
->stripesize
= stripesize
;
1266 sb_set_blocksize(sb
, sectorsize
);
1268 if (strncmp((char *)(&disk_super
->magic
), BTRFS_MAGIC
,
1269 sizeof(disk_super
->magic
))) {
1270 printk("btrfs: valid FS not found on %s\n", sb
->s_id
);
1271 goto fail_sb_buffer
;
1274 mutex_lock(&fs_info
->fs_mutex
);
1276 ret
= btrfs_read_sys_array(tree_root
);
1278 printk("btrfs: failed to read the system array on %s\n",
1280 goto fail_sys_array
;
1283 blocksize
= btrfs_level_size(tree_root
,
1284 btrfs_super_chunk_root_level(disk_super
));
1286 __setup_root(nodesize
, leafsize
, sectorsize
, stripesize
,
1287 chunk_root
, fs_info
, BTRFS_CHUNK_TREE_OBJECTID
);
1289 chunk_root
->node
= read_tree_block(chunk_root
,
1290 btrfs_super_chunk_root(disk_super
),
1292 BUG_ON(!chunk_root
->node
);
1294 read_extent_buffer(chunk_root
->node
, fs_info
->chunk_tree_uuid
,
1295 (unsigned long)btrfs_header_chunk_tree_uuid(chunk_root
->node
),
1298 ret
= btrfs_read_chunk_tree(chunk_root
);
1301 blocksize
= btrfs_level_size(tree_root
,
1302 btrfs_super_root_level(disk_super
));
1305 tree_root
->node
= read_tree_block(tree_root
,
1306 btrfs_super_root(disk_super
),
1308 if (!tree_root
->node
)
1309 goto fail_sb_buffer
;
1312 ret
= find_and_setup_root(tree_root
, fs_info
,
1313 BTRFS_EXTENT_TREE_OBJECTID
, extent_root
);
1315 goto fail_tree_root
;
1316 extent_root
->track_dirty
= 1;
1318 ret
= find_and_setup_root(tree_root
, fs_info
,
1319 BTRFS_DEV_TREE_OBJECTID
, dev_root
);
1320 dev_root
->track_dirty
= 1;
1323 goto fail_extent_root
;
1325 btrfs_read_block_groups(extent_root
);
1327 fs_info
->generation
= btrfs_super_generation(disk_super
) + 1;
1328 fs_info
->data_alloc_profile
= (u64
)-1;
1329 fs_info
->metadata_alloc_profile
= (u64
)-1;
1330 fs_info
->system_alloc_profile
= fs_info
->metadata_alloc_profile
;
1332 mutex_unlock(&fs_info
->fs_mutex
);
1336 free_extent_buffer(extent_root
->node
);
1338 free_extent_buffer(tree_root
->node
);
1340 mutex_unlock(&fs_info
->fs_mutex
);
1342 free_extent_buffer(fs_info
->sb_buffer
);
1343 extent_io_tree_empty_lru(&BTRFS_I(fs_info
->btree_inode
)->io_tree
);
1345 iput(fs_info
->btree_inode
);
1347 close_all_devices(fs_info
);
1348 btrfs_mapping_tree_free(&fs_info
->mapping_tree
);
1352 #if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,23)
1353 bdi_destroy(&fs_info
->bdi
);
1356 return ERR_PTR(err
);
1359 static void btrfs_end_buffer_write_sync(struct buffer_head
*bh
, int uptodate
)
1361 char b
[BDEVNAME_SIZE
];
1364 set_buffer_uptodate(bh
);
1366 if (!buffer_eopnotsupp(bh
) && printk_ratelimit()) {
1367 printk(KERN_WARNING
"lost page write due to "
1368 "I/O error on %s\n",
1369 bdevname(bh
->b_bdev
, b
));
1371 set_buffer_write_io_error(bh
);
1372 clear_buffer_uptodate(bh
);
1378 int write_all_supers(struct btrfs_root
*root
)
1380 struct list_head
*cur
;
1381 struct list_head
*head
= &root
->fs_info
->fs_devices
->devices
;
1382 struct btrfs_device
*dev
;
1383 struct extent_buffer
*sb
;
1384 struct btrfs_dev_item
*dev_item
;
1385 struct buffer_head
*bh
;
1389 int total_errors
= 0;
1391 max_errors
= btrfs_super_num_devices(&root
->fs_info
->super_copy
) - 1;
1392 do_barriers
= !btrfs_test_opt(root
, NOBARRIER
);
1394 sb
= root
->fs_info
->sb_buffer
;
1395 dev_item
= (struct btrfs_dev_item
*)offsetof(struct btrfs_super_block
,
1397 list_for_each(cur
, head
) {
1398 dev
= list_entry(cur
, struct btrfs_device
, dev_list
);
1399 btrfs_set_device_type(sb
, dev_item
, dev
->type
);
1400 btrfs_set_device_id(sb
, dev_item
, dev
->devid
);
1401 btrfs_set_device_total_bytes(sb
, dev_item
, dev
->total_bytes
);
1402 btrfs_set_device_bytes_used(sb
, dev_item
, dev
->bytes_used
);
1403 btrfs_set_device_io_align(sb
, dev_item
, dev
->io_align
);
1404 btrfs_set_device_io_width(sb
, dev_item
, dev
->io_width
);
1405 btrfs_set_device_sector_size(sb
, dev_item
, dev
->sector_size
);
1406 write_extent_buffer(sb
, dev
->uuid
,
1407 (unsigned long)btrfs_device_uuid(dev_item
),
1410 btrfs_set_header_flag(sb
, BTRFS_HEADER_FLAG_WRITTEN
);
1411 csum_tree_block(root
, sb
, 0);
1413 bh
= __getblk(dev
->bdev
, BTRFS_SUPER_INFO_OFFSET
/
1414 root
->fs_info
->sb
->s_blocksize
,
1415 BTRFS_SUPER_INFO_SIZE
);
1417 read_extent_buffer(sb
, bh
->b_data
, 0, BTRFS_SUPER_INFO_SIZE
);
1418 dev
->pending_io
= bh
;
1421 set_buffer_uptodate(bh
);
1423 bh
->b_end_io
= btrfs_end_buffer_write_sync
;
1425 if (do_barriers
&& dev
->barriers
) {
1426 ret
= submit_bh(WRITE_BARRIER
, bh
);
1427 if (ret
== -EOPNOTSUPP
) {
1428 printk("btrfs: disabling barriers on dev %s\n",
1430 set_buffer_uptodate(bh
);
1434 ret
= submit_bh(WRITE
, bh
);
1437 ret
= submit_bh(WRITE
, bh
);
1442 if (total_errors
> max_errors
) {
1443 printk("btrfs: %d errors while writing supers\n", total_errors
);
1448 list_for_each(cur
, head
) {
1449 dev
= list_entry(cur
, struct btrfs_device
, dev_list
);
1450 BUG_ON(!dev
->pending_io
);
1451 bh
= dev
->pending_io
;
1453 if (!buffer_uptodate(dev
->pending_io
)) {
1454 if (do_barriers
&& dev
->barriers
) {
1455 printk("btrfs: disabling barriers on dev %s\n",
1457 set_buffer_uptodate(bh
);
1461 ret
= submit_bh(WRITE
, bh
);
1464 BUG_ON(!buffer_uptodate(bh
));
1470 dev
->pending_io
= NULL
;
1473 if (total_errors
> max_errors
) {
1474 printk("btrfs: %d errors while writing supers\n", total_errors
);
1480 int write_ctree_super(struct btrfs_trans_handle
*trans
, struct btrfs_root
1485 ret
= write_all_supers(root
);
1487 if (!btrfs_test_opt(root
, NOBARRIER
))
1488 blkdev_issue_flush(sb
->s_bdev
, NULL
);
1489 set_extent_buffer_dirty(&BTRFS_I(btree_inode
)->io_tree
, super
);
1490 ret
= sync_page_range_nolock(btree_inode
, btree_inode
->i_mapping
,
1491 super
->start
, super
->len
);
1492 if (!btrfs_test_opt(root
, NOBARRIER
))
1493 blkdev_issue_flush(sb
->s_bdev
, NULL
);
1498 int btrfs_free_fs_root(struct btrfs_fs_info
*fs_info
, struct btrfs_root
*root
)
1500 radix_tree_delete(&fs_info
->fs_roots_radix
,
1501 (unsigned long)root
->root_key
.objectid
);
1503 btrfs_sysfs_del_root(root
);
1507 free_extent_buffer(root
->node
);
1508 if (root
->commit_root
)
1509 free_extent_buffer(root
->commit_root
);
1516 static int del_fs_roots(struct btrfs_fs_info
*fs_info
)
1519 struct btrfs_root
*gang
[8];
1523 ret
= radix_tree_gang_lookup(&fs_info
->fs_roots_radix
,
1528 for (i
= 0; i
< ret
; i
++)
1529 btrfs_free_fs_root(fs_info
, gang
[i
]);
1534 int close_ctree(struct btrfs_root
*root
)
1537 struct btrfs_trans_handle
*trans
;
1538 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
1540 fs_info
->closing
= 1;
1541 btrfs_transaction_flush_work(root
);
1542 mutex_lock(&fs_info
->fs_mutex
);
1543 btrfs_defrag_dirty_roots(root
->fs_info
);
1544 trans
= btrfs_start_transaction(root
, 1);
1545 ret
= btrfs_commit_transaction(trans
, root
);
1546 /* run commit again to drop the original snapshot */
1547 trans
= btrfs_start_transaction(root
, 1);
1548 btrfs_commit_transaction(trans
, root
);
1549 ret
= btrfs_write_and_wait_transaction(NULL
, root
);
1551 write_ctree_super(NULL
, root
);
1552 mutex_unlock(&fs_info
->fs_mutex
);
1554 btrfs_transaction_flush_work(root
);
1556 if (fs_info
->delalloc_bytes
) {
1557 printk("btrfs: at unmount delalloc count %Lu\n",
1558 fs_info
->delalloc_bytes
);
1560 if (fs_info
->extent_root
->node
)
1561 free_extent_buffer(fs_info
->extent_root
->node
);
1563 if (fs_info
->tree_root
->node
)
1564 free_extent_buffer(fs_info
->tree_root
->node
);
1566 if (root
->fs_info
->chunk_root
->node
);
1567 free_extent_buffer(root
->fs_info
->chunk_root
->node
);
1569 if (root
->fs_info
->dev_root
->node
);
1570 free_extent_buffer(root
->fs_info
->dev_root
->node
);
1572 free_extent_buffer(fs_info
->sb_buffer
);
1574 btrfs_free_block_groups(root
->fs_info
);
1575 del_fs_roots(fs_info
);
1577 filemap_write_and_wait(fs_info
->btree_inode
->i_mapping
);
1579 extent_io_tree_empty_lru(&fs_info
->free_space_cache
);
1580 extent_io_tree_empty_lru(&fs_info
->block_group_cache
);
1581 extent_io_tree_empty_lru(&fs_info
->pinned_extents
);
1582 extent_io_tree_empty_lru(&fs_info
->pending_del
);
1583 extent_io_tree_empty_lru(&fs_info
->extent_ins
);
1584 extent_io_tree_empty_lru(&BTRFS_I(fs_info
->btree_inode
)->io_tree
);
1586 flush_workqueue(end_io_workqueue
);
1587 flush_workqueue(async_submit_workqueue
);
1589 truncate_inode_pages(fs_info
->btree_inode
->i_mapping
, 0);
1591 flush_workqueue(end_io_workqueue
);
1592 destroy_workqueue(end_io_workqueue
);
1594 flush_workqueue(async_submit_workqueue
);
1595 destroy_workqueue(async_submit_workqueue
);
1597 iput(fs_info
->btree_inode
);
1599 while(!list_empty(&fs_info
->hashers
)) {
1600 struct btrfs_hasher
*hasher
;
1601 hasher
= list_entry(fs_info
->hashers
.next
, struct btrfs_hasher
,
1603 list_del(&hasher
->hashers
);
1604 crypto_free_hash(&fs_info
->hash_tfm
);
1608 close_all_devices(fs_info
);
1609 btrfs_mapping_tree_free(&fs_info
->mapping_tree
);
1611 #if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,23)
1612 bdi_destroy(&fs_info
->bdi
);
1615 kfree(fs_info
->extent_root
);
1616 kfree(fs_info
->tree_root
);
1617 kfree(fs_info
->chunk_root
);
1618 kfree(fs_info
->dev_root
);
1622 int btrfs_buffer_uptodate(struct extent_buffer
*buf
)
1624 struct inode
*btree_inode
= buf
->first_page
->mapping
->host
;
1625 return extent_buffer_uptodate(&BTRFS_I(btree_inode
)->io_tree
, buf
);
1628 int btrfs_set_buffer_uptodate(struct extent_buffer
*buf
)
1630 struct inode
*btree_inode
= buf
->first_page
->mapping
->host
;
1631 return set_extent_buffer_uptodate(&BTRFS_I(btree_inode
)->io_tree
,
1635 void btrfs_mark_buffer_dirty(struct extent_buffer
*buf
)
1637 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1638 u64 transid
= btrfs_header_generation(buf
);
1639 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1641 if (transid
!= root
->fs_info
->generation
) {
1642 printk(KERN_CRIT
"transid mismatch buffer %llu, found %Lu running %Lu\n",
1643 (unsigned long long)buf
->start
,
1644 transid
, root
->fs_info
->generation
);
1647 set_extent_buffer_dirty(&BTRFS_I(btree_inode
)->io_tree
, buf
);
1650 void btrfs_throttle(struct btrfs_root
*root
)
1652 struct backing_dev_info
*bdi
;
1654 bdi
= root
->fs_info
->sb
->s_bdev
->bd_inode
->i_mapping
->backing_dev_info
;
1655 if (root
->fs_info
->throttles
&& bdi_write_congested(bdi
)) {
1656 #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,18)
1657 congestion_wait(WRITE
, HZ
/20);
1659 blk_congestion_wait(WRITE
, HZ
/20);
1664 void btrfs_btree_balance_dirty(struct btrfs_root
*root
, unsigned long nr
)
1666 balance_dirty_pages_ratelimited_nr(
1667 root
->fs_info
->btree_inode
->i_mapping
, 1);
1670 void btrfs_set_buffer_defrag(struct extent_buffer
*buf
)
1672 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1673 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1674 set_extent_bits(&BTRFS_I(btree_inode
)->io_tree
, buf
->start
,
1675 buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG
, GFP_NOFS
);
1678 void btrfs_set_buffer_defrag_done(struct extent_buffer
*buf
)
1680 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1681 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1682 set_extent_bits(&BTRFS_I(btree_inode
)->io_tree
, buf
->start
,
1683 buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG_DONE
,
1687 int btrfs_buffer_defrag(struct extent_buffer
*buf
)
1689 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1690 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1691 return test_range_bit(&BTRFS_I(btree_inode
)->io_tree
,
1692 buf
->start
, buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG
, 0);
1695 int btrfs_buffer_defrag_done(struct extent_buffer
*buf
)
1697 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1698 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1699 return test_range_bit(&BTRFS_I(btree_inode
)->io_tree
,
1700 buf
->start
, buf
->start
+ buf
->len
- 1,
1701 EXTENT_DEFRAG_DONE
, 0);
1704 int btrfs_clear_buffer_defrag_done(struct extent_buffer
*buf
)
1706 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1707 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1708 return clear_extent_bits(&BTRFS_I(btree_inode
)->io_tree
,
1709 buf
->start
, buf
->start
+ buf
->len
- 1,
1710 EXTENT_DEFRAG_DONE
, GFP_NOFS
);
1713 int btrfs_clear_buffer_defrag(struct extent_buffer
*buf
)
1715 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1716 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
1717 return clear_extent_bits(&BTRFS_I(btree_inode
)->io_tree
,
1718 buf
->start
, buf
->start
+ buf
->len
- 1,
1719 EXTENT_DEFRAG
, GFP_NOFS
);
1722 int btrfs_read_buffer(struct extent_buffer
*buf
)
1724 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
1726 ret
= btree_read_extent_buffer_pages(root
, buf
, 0);
1728 buf
->flags
|= EXTENT_UPTODATE
;
1733 static struct extent_io_ops btree_extent_io_ops
= {
1734 .writepage_io_hook
= btree_writepage_io_hook
,
1735 .readpage_end_io_hook
= btree_readpage_end_io_hook
,
1736 .submit_bio_hook
= btree_submit_bio_hook
,
1737 /* note we're sharing with inode.c for the merge bio hook */
1738 .merge_bio_hook
= btrfs_merge_bio_hook
,