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_map_ops btree_extent_map_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
)->extent_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
)->extent_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 end
,
73 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
74 struct extent_map
*em
;
78 em
= lookup_extent_mapping(em_tree
, start
, end
);
82 em
= alloc_extent_map(GFP_NOFS
);
84 em
= ERR_PTR(-ENOMEM
);
88 em
->end
= (i_size_read(inode
) & ~((u64
)PAGE_CACHE_SIZE
-1)) - 1;
90 em
->block_end
= em
->end
;
91 em
->bdev
= inode
->i_sb
->s_bdev
;
92 ret
= add_extent_mapping(em_tree
, em
);
104 u32
btrfs_csum_data(struct btrfs_root
*root
, char *data
, u32 seed
, size_t len
)
106 return crc32c(seed
, data
, len
);
109 void btrfs_csum_final(u32 crc
, char *result
)
111 *(__le32
*)result
= ~cpu_to_le32(crc
);
114 static int csum_tree_block(struct btrfs_root
*root
, struct extent_buffer
*buf
,
117 char result
[BTRFS_CRC32_SIZE
];
119 unsigned long cur_len
;
120 unsigned long offset
= BTRFS_CSUM_SIZE
;
121 char *map_token
= NULL
;
123 unsigned long map_start
;
124 unsigned long map_len
;
128 len
= buf
->len
- offset
;
130 err
= map_private_extent_buffer(buf
, offset
, 32,
132 &map_start
, &map_len
, KM_USER0
);
134 printk("failed to map extent buffer! %lu\n",
138 cur_len
= min(len
, map_len
- (offset
- map_start
));
139 crc
= btrfs_csum_data(root
, kaddr
+ offset
- map_start
,
143 unmap_extent_buffer(buf
, map_token
, KM_USER0
);
145 btrfs_csum_final(crc
, result
);
148 if (memcmp_extent_buffer(buf
, result
, 0, BTRFS_CRC32_SIZE
)) {
149 printk("btrfs: %s checksum verify failed on %llu\n",
150 root
->fs_info
->sb
->s_id
,
155 write_extent_buffer(buf
, result
, 0, BTRFS_CRC32_SIZE
);
161 int csum_dirty_buffer(struct btrfs_root
*root
, struct page
*page
)
163 struct extent_map_tree
*tree
;
164 u64 start
= (u64
)page
->index
<< PAGE_CACHE_SHIFT
;
168 struct extent_buffer
*eb
;
169 tree
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
171 if (page
->private == EXTENT_PAGE_PRIVATE
)
175 len
= page
->private >> 2;
179 eb
= alloc_extent_buffer(tree
, start
, len
, page
, GFP_NOFS
);
180 read_extent_buffer_pages(tree
, eb
, start
+ PAGE_CACHE_SIZE
, 1);
181 found_start
= btrfs_header_bytenr(eb
);
182 if (found_start
!= start
) {
183 printk("warning: eb start incorrect %Lu buffer %Lu len %lu\n",
184 start
, found_start
, len
);
186 found_level
= btrfs_header_level(eb
);
187 csum_tree_block(root
, eb
, 0);
188 free_extent_buffer(eb
);
193 static int btree_writepage_io_hook(struct page
*page
, u64 start
, u64 end
)
195 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
197 csum_dirty_buffer(root
, page
);
201 static int btree_writepage(struct page
*page
, struct writeback_control
*wbc
)
203 struct extent_map_tree
*tree
;
204 tree
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
205 return extent_write_full_page(tree
, page
, btree_get_extent
, wbc
);
208 static int btree_writepages(struct address_space
*mapping
,
209 struct writeback_control
*wbc
)
211 struct extent_map_tree
*tree
;
212 tree
= &BTRFS_I(mapping
->host
)->extent_tree
;
213 if (wbc
->sync_mode
== WB_SYNC_NONE
) {
216 unsigned long thresh
= 96 * 1024 * 1024;
218 if (wbc
->for_kupdate
)
221 if (current_is_pdflush()) {
222 thresh
= 96 * 1024 * 1024;
224 thresh
= 8 * 1024 * 1024;
226 num_dirty
= count_range_bits(tree
, &start
, thresh
, EXTENT_DIRTY
);
227 if (num_dirty
< thresh
) {
231 return extent_writepages(tree
, mapping
, btree_get_extent
, wbc
);
234 int btree_readpage(struct file
*file
, struct page
*page
)
236 struct extent_map_tree
*tree
;
237 tree
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
238 return extent_read_full_page(tree
, page
, btree_get_extent
);
241 static int btree_releasepage(struct page
*page
, gfp_t unused_gfp_flags
)
243 struct extent_map_tree
*tree
;
246 tree
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
247 ret
= try_release_extent_mapping(tree
, page
);
249 ClearPagePrivate(page
);
250 set_page_private(page
, 0);
251 page_cache_release(page
);
256 static void btree_invalidatepage(struct page
*page
, unsigned long offset
)
258 struct extent_map_tree
*tree
;
259 tree
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
260 extent_invalidatepage(tree
, page
, offset
);
261 btree_releasepage(page
, GFP_NOFS
);
265 static int btree_writepage(struct page
*page
, struct writeback_control
*wbc
)
267 struct buffer_head
*bh
;
268 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
269 struct buffer_head
*head
;
270 if (!page_has_buffers(page
)) {
271 create_empty_buffers(page
, root
->fs_info
->sb
->s_blocksize
,
272 (1 << BH_Dirty
)|(1 << BH_Uptodate
));
274 head
= page_buffers(page
);
277 if (buffer_dirty(bh
))
278 csum_tree_block(root
, bh
, 0);
279 bh
= bh
->b_this_page
;
280 } while (bh
!= head
);
281 return block_write_full_page(page
, btree_get_block
, wbc
);
285 static struct address_space_operations btree_aops
= {
286 .readpage
= btree_readpage
,
287 .writepage
= btree_writepage
,
288 .writepages
= btree_writepages
,
289 .releasepage
= btree_releasepage
,
290 .invalidatepage
= btree_invalidatepage
,
291 .sync_page
= block_sync_page
,
294 int readahead_tree_block(struct btrfs_root
*root
, u64 bytenr
, u32 blocksize
)
296 struct extent_buffer
*buf
= NULL
;
297 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
300 buf
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
303 read_extent_buffer_pages(&BTRFS_I(btree_inode
)->extent_tree
,
305 free_extent_buffer(buf
);
309 struct extent_buffer
*read_tree_block(struct btrfs_root
*root
, u64 bytenr
,
312 struct extent_buffer
*buf
= NULL
;
313 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
314 struct extent_map_tree
*extent_tree
;
317 extent_tree
= &BTRFS_I(btree_inode
)->extent_tree
;
319 buf
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
322 read_extent_buffer_pages(&BTRFS_I(btree_inode
)->extent_tree
,
324 if (buf
->flags
& EXTENT_CSUM
) {
327 if (test_range_bit(extent_tree
, buf
->start
, buf
->start
+ buf
->len
- 1,
329 buf
->flags
|= EXTENT_CSUM
;
332 ret
= csum_tree_block(root
, buf
, 1);
333 set_extent_bits(extent_tree
, buf
->start
,
334 buf
->start
+ buf
->len
- 1,
335 EXTENT_CSUM
, GFP_NOFS
);
336 buf
->flags
|= EXTENT_CSUM
;
340 int clean_tree_block(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
341 struct extent_buffer
*buf
)
343 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
344 clear_extent_buffer_dirty(&BTRFS_I(btree_inode
)->extent_tree
, buf
);
348 int wait_on_tree_block_writeback(struct btrfs_root
*root
,
349 struct extent_buffer
*buf
)
351 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
352 wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode
)->extent_tree
,
357 static int __setup_root(u32 nodesize
, u32 leafsize
, u32 sectorsize
,
358 u32 stripesize
, struct btrfs_root
*root
,
359 struct btrfs_fs_info
*fs_info
,
364 root
->commit_root
= NULL
;
365 root
->sectorsize
= sectorsize
;
366 root
->nodesize
= nodesize
;
367 root
->leafsize
= leafsize
;
368 root
->stripesize
= stripesize
;
370 root
->fs_info
= fs_info
;
371 root
->objectid
= objectid
;
372 root
->last_trans
= 0;
373 root
->highest_inode
= 0;
374 root
->last_inode_alloc
= 0;
376 memset(&root
->root_key
, 0, sizeof(root
->root_key
));
377 memset(&root
->root_item
, 0, sizeof(root
->root_item
));
378 memset(&root
->defrag_progress
, 0, sizeof(root
->defrag_progress
));
379 memset(&root
->root_kobj
, 0, sizeof(root
->root_kobj
));
380 init_completion(&root
->kobj_unregister
);
381 init_rwsem(&root
->snap_sem
);
382 root
->defrag_running
= 0;
383 root
->defrag_level
= 0;
384 root
->root_key
.objectid
= objectid
;
388 static int find_and_setup_root(struct btrfs_root
*tree_root
,
389 struct btrfs_fs_info
*fs_info
,
391 struct btrfs_root
*root
)
396 __setup_root(tree_root
->nodesize
, tree_root
->leafsize
,
397 tree_root
->sectorsize
, tree_root
->stripesize
,
398 root
, fs_info
, objectid
);
399 ret
= btrfs_find_last_root(tree_root
, objectid
,
400 &root
->root_item
, &root
->root_key
);
403 blocksize
= btrfs_level_size(root
, btrfs_root_level(&root
->root_item
));
404 root
->node
= read_tree_block(root
, btrfs_root_bytenr(&root
->root_item
),
410 struct btrfs_root
*btrfs_read_fs_root_no_radix(struct btrfs_fs_info
*fs_info
,
411 struct btrfs_key
*location
)
413 struct btrfs_root
*root
;
414 struct btrfs_root
*tree_root
= fs_info
->tree_root
;
415 struct btrfs_path
*path
;
416 struct extent_buffer
*l
;
421 root
= kzalloc(sizeof(*root
), GFP_NOFS
);
423 return ERR_PTR(-ENOMEM
);
424 if (location
->offset
== (u64
)-1) {
425 ret
= find_and_setup_root(tree_root
, fs_info
,
426 location
->objectid
, root
);
434 __setup_root(tree_root
->nodesize
, tree_root
->leafsize
,
435 tree_root
->sectorsize
, tree_root
->stripesize
,
436 root
, fs_info
, location
->objectid
);
438 path
= btrfs_alloc_path();
440 ret
= btrfs_search_slot(NULL
, tree_root
, location
, path
, 0, 0);
447 read_extent_buffer(l
, &root
->root_item
,
448 btrfs_item_ptr_offset(l
, path
->slots
[0]),
449 sizeof(root
->root_item
));
450 memcpy(&root
->root_key
, location
, sizeof(*location
));
453 btrfs_release_path(root
, path
);
454 btrfs_free_path(path
);
459 blocksize
= btrfs_level_size(root
, btrfs_root_level(&root
->root_item
));
460 root
->node
= read_tree_block(root
, btrfs_root_bytenr(&root
->root_item
),
465 ret
= btrfs_find_highest_inode(root
, &highest_inode
);
467 root
->highest_inode
= highest_inode
;
468 root
->last_inode_alloc
= highest_inode
;
473 struct btrfs_root
*btrfs_read_fs_root(struct btrfs_fs_info
*fs_info
,
474 struct btrfs_key
*location
,
475 const char *name
, int namelen
)
477 struct btrfs_root
*root
;
480 root
= radix_tree_lookup(&fs_info
->fs_roots_radix
,
481 (unsigned long)location
->objectid
);
485 root
= btrfs_read_fs_root_no_radix(fs_info
, location
);
488 ret
= radix_tree_insert(&fs_info
->fs_roots_radix
,
489 (unsigned long)root
->root_key
.objectid
,
492 free_extent_buffer(root
->node
);
497 ret
= btrfs_set_root_name(root
, name
, namelen
);
499 free_extent_buffer(root
->node
);
504 ret
= btrfs_sysfs_add_root(root
);
506 free_extent_buffer(root
->node
);
512 ret
= btrfs_find_dead_roots(fs_info
->tree_root
,
513 root
->root_key
.objectid
, root
);
519 static int add_hasher(struct btrfs_fs_info
*info
, char *type
) {
520 struct btrfs_hasher
*hasher
;
522 hasher
= kmalloc(sizeof(*hasher
), GFP_NOFS
);
525 hasher
->hash_tfm
= crypto_alloc_hash(type
, 0, CRYPTO_ALG_ASYNC
);
526 if (!hasher
->hash_tfm
) {
530 spin_lock(&info
->hash_lock
);
531 list_add(&hasher
->list
, &info
->hashers
);
532 spin_unlock(&info
->hash_lock
);
536 struct btrfs_root
*open_ctree(struct super_block
*sb
)
543 struct btrfs_root
*extent_root
= kmalloc(sizeof(struct btrfs_root
),
545 struct btrfs_root
*tree_root
= kmalloc(sizeof(struct btrfs_root
),
547 struct btrfs_fs_info
*fs_info
= kmalloc(sizeof(*fs_info
),
551 struct btrfs_super_block
*disk_super
;
553 if (!extent_root
|| !tree_root
|| !fs_info
) {
557 INIT_RADIX_TREE(&fs_info
->fs_roots_radix
, GFP_NOFS
);
558 INIT_LIST_HEAD(&fs_info
->trans_list
);
559 INIT_LIST_HEAD(&fs_info
->dead_roots
);
560 INIT_LIST_HEAD(&fs_info
->hashers
);
561 spin_lock_init(&fs_info
->hash_lock
);
563 memset(&fs_info
->super_kobj
, 0, sizeof(fs_info
->super_kobj
));
564 init_completion(&fs_info
->kobj_unregister
);
565 sb_set_blocksize(sb
, 4096);
566 fs_info
->running_transaction
= NULL
;
567 fs_info
->last_trans_committed
= 0;
568 fs_info
->tree_root
= tree_root
;
569 fs_info
->extent_root
= extent_root
;
571 fs_info
->btree_inode
= new_inode(sb
);
572 fs_info
->btree_inode
->i_ino
= 1;
573 fs_info
->btree_inode
->i_nlink
= 1;
574 fs_info
->btree_inode
->i_size
= sb
->s_bdev
->bd_inode
->i_size
;
575 fs_info
->btree_inode
->i_mapping
->a_ops
= &btree_aops
;
576 extent_map_tree_init(&BTRFS_I(fs_info
->btree_inode
)->extent_tree
,
577 fs_info
->btree_inode
->i_mapping
,
579 BTRFS_I(fs_info
->btree_inode
)->extent_tree
.ops
= &btree_extent_map_ops
;
581 extent_map_tree_init(&fs_info
->free_space_cache
,
582 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
583 extent_map_tree_init(&fs_info
->block_group_cache
,
584 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
585 extent_map_tree_init(&fs_info
->pinned_extents
,
586 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
587 extent_map_tree_init(&fs_info
->pending_del
,
588 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
589 extent_map_tree_init(&fs_info
->extent_ins
,
590 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
591 fs_info
->do_barriers
= 1;
592 fs_info
->closing
= 0;
593 fs_info
->total_pinned
= 0;
595 INIT_DELAYED_WORK(&fs_info
->trans_work
, btrfs_transaction_cleaner
);
596 BTRFS_I(fs_info
->btree_inode
)->root
= tree_root
;
597 memset(&BTRFS_I(fs_info
->btree_inode
)->location
, 0,
598 sizeof(struct btrfs_key
));
599 insert_inode_hash(fs_info
->btree_inode
);
600 mapping_set_gfp_mask(fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
602 mutex_init(&fs_info
->trans_mutex
);
603 mutex_init(&fs_info
->fs_mutex
);
606 ret
= add_hasher(fs_info
, "crc32c");
608 printk("btrfs: failed hash setup, modprobe cryptomgr?\n");
613 __setup_root(512, 512, 512, 512, tree_root
,
614 fs_info
, BTRFS_ROOT_TREE_OBJECTID
);
616 fs_info
->sb_buffer
= read_tree_block(tree_root
,
617 BTRFS_SUPER_INFO_OFFSET
,
620 if (!fs_info
->sb_buffer
)
623 read_extent_buffer(fs_info
->sb_buffer
, &fs_info
->super_copy
, 0,
624 sizeof(fs_info
->super_copy
));
626 read_extent_buffer(fs_info
->sb_buffer
, fs_info
->fsid
,
627 (unsigned long)btrfs_super_fsid(fs_info
->sb_buffer
),
629 disk_super
= &fs_info
->super_copy
;
630 if (!btrfs_super_root(disk_super
))
633 nodesize
= btrfs_super_nodesize(disk_super
);
634 leafsize
= btrfs_super_leafsize(disk_super
);
635 sectorsize
= btrfs_super_sectorsize(disk_super
);
636 stripesize
= btrfs_super_stripesize(disk_super
);
637 tree_root
->nodesize
= nodesize
;
638 tree_root
->leafsize
= leafsize
;
639 tree_root
->sectorsize
= sectorsize
;
640 tree_root
->stripesize
= stripesize
;
641 sb_set_blocksize(sb
, sectorsize
);
643 i_size_write(fs_info
->btree_inode
,
644 btrfs_super_total_bytes(disk_super
));
646 if (strncmp((char *)(&disk_super
->magic
), BTRFS_MAGIC
,
647 sizeof(disk_super
->magic
))) {
648 printk("btrfs: valid FS not found on %s\n", sb
->s_id
);
652 blocksize
= btrfs_level_size(tree_root
,
653 btrfs_super_root_level(disk_super
));
655 tree_root
->node
= read_tree_block(tree_root
,
656 btrfs_super_root(disk_super
),
658 if (!tree_root
->node
)
661 mutex_lock(&fs_info
->fs_mutex
);
663 ret
= find_and_setup_root(tree_root
, fs_info
,
664 BTRFS_EXTENT_TREE_OBJECTID
, extent_root
);
666 mutex_unlock(&fs_info
->fs_mutex
);
670 btrfs_read_block_groups(extent_root
);
672 fs_info
->generation
= btrfs_super_generation(disk_super
) + 1;
673 mutex_unlock(&fs_info
->fs_mutex
);
677 free_extent_buffer(tree_root
->node
);
679 free_extent_buffer(fs_info
->sb_buffer
);
681 iput(fs_info
->btree_inode
);
689 int write_ctree_super(struct btrfs_trans_handle
*trans
, struct btrfs_root
693 struct extent_buffer
*super
= root
->fs_info
->sb_buffer
;
694 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
696 set_extent_buffer_dirty(&BTRFS_I(btree_inode
)->extent_tree
, super
);
697 ret
= sync_page_range_nolock(btree_inode
, btree_inode
->i_mapping
,
698 super
->start
, super
->len
);
702 int btrfs_free_fs_root(struct btrfs_fs_info
*fs_info
, struct btrfs_root
*root
)
704 radix_tree_delete(&fs_info
->fs_roots_radix
,
705 (unsigned long)root
->root_key
.objectid
);
706 btrfs_sysfs_del_root(root
);
710 free_extent_buffer(root
->node
);
711 if (root
->commit_root
)
712 free_extent_buffer(root
->commit_root
);
719 static int del_fs_roots(struct btrfs_fs_info
*fs_info
)
722 struct btrfs_root
*gang
[8];
726 ret
= radix_tree_gang_lookup(&fs_info
->fs_roots_radix
,
731 for (i
= 0; i
< ret
; i
++)
732 btrfs_free_fs_root(fs_info
, gang
[i
]);
737 int close_ctree(struct btrfs_root
*root
)
740 struct btrfs_trans_handle
*trans
;
741 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
743 fs_info
->closing
= 1;
744 btrfs_transaction_flush_work(root
);
745 mutex_lock(&fs_info
->fs_mutex
);
746 btrfs_defrag_dirty_roots(root
->fs_info
);
747 trans
= btrfs_start_transaction(root
, 1);
748 ret
= btrfs_commit_transaction(trans
, root
);
749 /* run commit again to drop the original snapshot */
750 trans
= btrfs_start_transaction(root
, 1);
751 btrfs_commit_transaction(trans
, root
);
752 ret
= btrfs_write_and_wait_transaction(NULL
, root
);
754 write_ctree_super(NULL
, root
);
755 mutex_unlock(&fs_info
->fs_mutex
);
757 if (fs_info
->extent_root
->node
)
758 free_extent_buffer(fs_info
->extent_root
->node
);
760 if (fs_info
->tree_root
->node
)
761 free_extent_buffer(fs_info
->tree_root
->node
);
763 free_extent_buffer(fs_info
->sb_buffer
);
765 btrfs_free_block_groups(root
->fs_info
);
766 del_fs_roots(fs_info
);
767 extent_map_tree_empty_lru(&BTRFS_I(fs_info
->btree_inode
)->extent_tree
);
768 truncate_inode_pages(fs_info
->btree_inode
->i_mapping
, 0);
769 iput(fs_info
->btree_inode
);
771 while(!list_empty(&fs_info
->hashers
)) {
772 struct btrfs_hasher
*hasher
;
773 hasher
= list_entry(fs_info
->hashers
.next
, struct btrfs_hasher
,
775 list_del(&hasher
->hashers
);
776 crypto_free_hash(&fs_info
->hash_tfm
);
780 kfree(fs_info
->extent_root
);
781 kfree(fs_info
->tree_root
);
785 int btrfs_buffer_uptodate(struct extent_buffer
*buf
)
787 struct inode
*btree_inode
= buf
->first_page
->mapping
->host
;
788 return extent_buffer_uptodate(&BTRFS_I(btree_inode
)->extent_tree
, buf
);
791 int btrfs_set_buffer_uptodate(struct extent_buffer
*buf
)
793 struct inode
*btree_inode
= buf
->first_page
->mapping
->host
;
794 return set_extent_buffer_uptodate(&BTRFS_I(btree_inode
)->extent_tree
,
798 void btrfs_mark_buffer_dirty(struct extent_buffer
*buf
)
800 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
801 u64 transid
= btrfs_header_generation(buf
);
802 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
804 if (transid
!= root
->fs_info
->generation
) {
805 printk(KERN_CRIT
"transid mismatch buffer %llu, found %Lu running %Lu\n",
806 (unsigned long long)buf
->start
,
807 transid
, root
->fs_info
->generation
);
810 set_extent_buffer_dirty(&BTRFS_I(btree_inode
)->extent_tree
, buf
);
813 void btrfs_btree_balance_dirty(struct btrfs_root
*root
, unsigned long nr
)
815 balance_dirty_pages_ratelimited_nr(
816 root
->fs_info
->btree_inode
->i_mapping
, 1);
819 void btrfs_set_buffer_defrag(struct extent_buffer
*buf
)
821 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
822 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
823 set_extent_bits(&BTRFS_I(btree_inode
)->extent_tree
, buf
->start
,
824 buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG
, GFP_NOFS
);
827 void btrfs_set_buffer_defrag_done(struct extent_buffer
*buf
)
829 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
830 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
831 set_extent_bits(&BTRFS_I(btree_inode
)->extent_tree
, buf
->start
,
832 buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG_DONE
,
836 int btrfs_buffer_defrag(struct extent_buffer
*buf
)
838 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
839 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
840 return test_range_bit(&BTRFS_I(btree_inode
)->extent_tree
,
841 buf
->start
, buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG
, 0);
844 int btrfs_buffer_defrag_done(struct extent_buffer
*buf
)
846 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
847 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
848 return test_range_bit(&BTRFS_I(btree_inode
)->extent_tree
,
849 buf
->start
, buf
->start
+ buf
->len
- 1,
850 EXTENT_DEFRAG_DONE
, 0);
853 int btrfs_clear_buffer_defrag_done(struct extent_buffer
*buf
)
855 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
856 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
857 return clear_extent_bits(&BTRFS_I(btree_inode
)->extent_tree
,
858 buf
->start
, buf
->start
+ buf
->len
- 1,
859 EXTENT_DEFRAG_DONE
, GFP_NOFS
);
862 int btrfs_clear_buffer_defrag(struct extent_buffer
*buf
)
864 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
865 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
866 return clear_extent_bits(&BTRFS_I(btree_inode
)->extent_tree
,
867 buf
->start
, buf
->start
+ buf
->len
- 1,
868 EXTENT_DEFRAG
, GFP_NOFS
);
871 int btrfs_read_buffer(struct extent_buffer
*buf
)
873 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
874 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
875 return read_extent_buffer_pages(&BTRFS_I(btree_inode
)->extent_tree
,
879 static struct extent_map_ops btree_extent_map_ops
= {
880 .writepage_io_hook
= btree_writepage_io_hook
,