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 return extent_writepages(tree
, mapping
, btree_get_extent
, wbc
);
216 int btree_readpage(struct file
*file
, struct page
*page
)
218 struct extent_map_tree
*tree
;
219 tree
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
220 return extent_read_full_page(tree
, page
, btree_get_extent
);
223 static int btree_releasepage(struct page
*page
, gfp_t unused_gfp_flags
)
225 struct extent_map_tree
*tree
;
228 tree
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
229 ret
= try_release_extent_mapping(tree
, page
);
231 ClearPagePrivate(page
);
232 set_page_private(page
, 0);
233 page_cache_release(page
);
238 static void btree_invalidatepage(struct page
*page
, unsigned long offset
)
240 struct extent_map_tree
*tree
;
241 tree
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
242 extent_invalidatepage(tree
, page
, offset
);
243 btree_releasepage(page
, GFP_NOFS
);
247 static int btree_writepage(struct page
*page
, struct writeback_control
*wbc
)
249 struct buffer_head
*bh
;
250 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
251 struct buffer_head
*head
;
252 if (!page_has_buffers(page
)) {
253 create_empty_buffers(page
, root
->fs_info
->sb
->s_blocksize
,
254 (1 << BH_Dirty
)|(1 << BH_Uptodate
));
256 head
= page_buffers(page
);
259 if (buffer_dirty(bh
))
260 csum_tree_block(root
, bh
, 0);
261 bh
= bh
->b_this_page
;
262 } while (bh
!= head
);
263 return block_write_full_page(page
, btree_get_block
, wbc
);
267 static struct address_space_operations btree_aops
= {
268 .readpage
= btree_readpage
,
269 .writepage
= btree_writepage
,
270 .writepages
= btree_writepages
,
271 .releasepage
= btree_releasepage
,
272 .invalidatepage
= btree_invalidatepage
,
273 .sync_page
= block_sync_page
,
276 int readahead_tree_block(struct btrfs_root
*root
, u64 bytenr
, u32 blocksize
)
278 struct extent_buffer
*buf
= NULL
;
279 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
282 buf
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
285 read_extent_buffer_pages(&BTRFS_I(btree_inode
)->extent_tree
,
287 free_extent_buffer(buf
);
291 struct extent_buffer
*read_tree_block(struct btrfs_root
*root
, u64 bytenr
,
294 struct extent_buffer
*buf
= NULL
;
295 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
296 struct extent_map_tree
*extent_tree
;
299 extent_tree
= &BTRFS_I(btree_inode
)->extent_tree
;
301 buf
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
304 read_extent_buffer_pages(&BTRFS_I(btree_inode
)->extent_tree
,
306 if (buf
->flags
& EXTENT_CSUM
) {
309 if (test_range_bit(extent_tree
, buf
->start
, buf
->start
+ buf
->len
- 1,
311 buf
->flags
|= EXTENT_CSUM
;
314 ret
= csum_tree_block(root
, buf
, 1);
315 set_extent_bits(extent_tree
, buf
->start
,
316 buf
->start
+ buf
->len
- 1,
317 EXTENT_CSUM
, GFP_NOFS
);
318 buf
->flags
|= EXTENT_CSUM
;
322 int clean_tree_block(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
323 struct extent_buffer
*buf
)
325 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
326 clear_extent_buffer_dirty(&BTRFS_I(btree_inode
)->extent_tree
, buf
);
330 int wait_on_tree_block_writeback(struct btrfs_root
*root
,
331 struct extent_buffer
*buf
)
333 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
334 wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode
)->extent_tree
,
339 static int __setup_root(u32 nodesize
, u32 leafsize
, u32 sectorsize
,
340 struct btrfs_root
*root
,
341 struct btrfs_fs_info
*fs_info
,
346 root
->commit_root
= NULL
;
347 root
->sectorsize
= sectorsize
;
348 root
->nodesize
= nodesize
;
349 root
->leafsize
= leafsize
;
351 root
->fs_info
= fs_info
;
352 root
->objectid
= objectid
;
353 root
->last_trans
= 0;
354 root
->highest_inode
= 0;
355 root
->last_inode_alloc
= 0;
357 memset(&root
->root_key
, 0, sizeof(root
->root_key
));
358 memset(&root
->root_item
, 0, sizeof(root
->root_item
));
359 memset(&root
->defrag_progress
, 0, sizeof(root
->defrag_progress
));
360 memset(&root
->root_kobj
, 0, sizeof(root
->root_kobj
));
361 init_completion(&root
->kobj_unregister
);
362 init_rwsem(&root
->snap_sem
);
363 root
->defrag_running
= 0;
364 root
->defrag_level
= 0;
365 root
->root_key
.objectid
= objectid
;
369 static int find_and_setup_root(struct btrfs_root
*tree_root
,
370 struct btrfs_fs_info
*fs_info
,
372 struct btrfs_root
*root
)
377 __setup_root(tree_root
->nodesize
, tree_root
->leafsize
,
378 tree_root
->sectorsize
, root
, fs_info
, objectid
);
379 ret
= btrfs_find_last_root(tree_root
, objectid
,
380 &root
->root_item
, &root
->root_key
);
383 blocksize
= btrfs_level_size(root
, btrfs_root_level(&root
->root_item
));
384 root
->node
= read_tree_block(root
, btrfs_root_bytenr(&root
->root_item
),
390 struct btrfs_root
*btrfs_read_fs_root_no_radix(struct btrfs_fs_info
*fs_info
,
391 struct btrfs_key
*location
)
393 struct btrfs_root
*root
;
394 struct btrfs_root
*tree_root
= fs_info
->tree_root
;
395 struct btrfs_path
*path
;
396 struct extent_buffer
*l
;
401 root
= kzalloc(sizeof(*root
), GFP_NOFS
);
403 return ERR_PTR(-ENOMEM
);
404 if (location
->offset
== (u64
)-1) {
405 ret
= find_and_setup_root(tree_root
, fs_info
,
406 location
->objectid
, root
);
414 __setup_root(tree_root
->nodesize
, tree_root
->leafsize
,
415 tree_root
->sectorsize
, root
, fs_info
,
418 path
= btrfs_alloc_path();
420 ret
= btrfs_search_slot(NULL
, tree_root
, location
, path
, 0, 0);
427 read_extent_buffer(l
, &root
->root_item
,
428 btrfs_item_ptr_offset(l
, path
->slots
[0]),
429 sizeof(root
->root_item
));
430 memcpy(&root
->root_key
, location
, sizeof(*location
));
433 btrfs_release_path(root
, path
);
434 btrfs_free_path(path
);
439 blocksize
= btrfs_level_size(root
, btrfs_root_level(&root
->root_item
));
440 root
->node
= read_tree_block(root
, btrfs_root_bytenr(&root
->root_item
),
445 ret
= btrfs_find_highest_inode(root
, &highest_inode
);
447 root
->highest_inode
= highest_inode
;
448 root
->last_inode_alloc
= highest_inode
;
453 struct btrfs_root
*btrfs_read_fs_root(struct btrfs_fs_info
*fs_info
,
454 struct btrfs_key
*location
,
455 const char *name
, int namelen
)
457 struct btrfs_root
*root
;
460 root
= radix_tree_lookup(&fs_info
->fs_roots_radix
,
461 (unsigned long)location
->objectid
);
465 root
= btrfs_read_fs_root_no_radix(fs_info
, location
);
468 ret
= radix_tree_insert(&fs_info
->fs_roots_radix
,
469 (unsigned long)root
->root_key
.objectid
,
472 free_extent_buffer(root
->node
);
477 ret
= btrfs_set_root_name(root
, name
, namelen
);
479 free_extent_buffer(root
->node
);
484 ret
= btrfs_sysfs_add_root(root
);
486 free_extent_buffer(root
->node
);
492 ret
= btrfs_find_dead_roots(fs_info
->tree_root
,
493 root
->root_key
.objectid
, root
);
499 static int add_hasher(struct btrfs_fs_info
*info
, char *type
) {
500 struct btrfs_hasher
*hasher
;
502 hasher
= kmalloc(sizeof(*hasher
), GFP_NOFS
);
505 hasher
->hash_tfm
= crypto_alloc_hash(type
, 0, CRYPTO_ALG_ASYNC
);
506 if (!hasher
->hash_tfm
) {
510 spin_lock(&info
->hash_lock
);
511 list_add(&hasher
->list
, &info
->hashers
);
512 spin_unlock(&info
->hash_lock
);
516 struct btrfs_root
*open_ctree(struct super_block
*sb
)
522 struct btrfs_root
*extent_root
= kmalloc(sizeof(struct btrfs_root
),
524 struct btrfs_root
*tree_root
= kmalloc(sizeof(struct btrfs_root
),
526 struct btrfs_fs_info
*fs_info
= kmalloc(sizeof(*fs_info
),
530 struct btrfs_super_block
*disk_super
;
532 if (!extent_root
|| !tree_root
|| !fs_info
) {
536 INIT_RADIX_TREE(&fs_info
->fs_roots_radix
, GFP_NOFS
);
537 INIT_LIST_HEAD(&fs_info
->trans_list
);
538 INIT_LIST_HEAD(&fs_info
->dead_roots
);
539 INIT_LIST_HEAD(&fs_info
->hashers
);
540 spin_lock_init(&fs_info
->hash_lock
);
542 memset(&fs_info
->super_kobj
, 0, sizeof(fs_info
->super_kobj
));
543 init_completion(&fs_info
->kobj_unregister
);
544 sb_set_blocksize(sb
, 4096);
545 fs_info
->running_transaction
= NULL
;
546 fs_info
->last_trans_committed
= 0;
547 fs_info
->tree_root
= tree_root
;
548 fs_info
->extent_root
= extent_root
;
550 fs_info
->btree_inode
= new_inode(sb
);
551 fs_info
->btree_inode
->i_ino
= 1;
552 fs_info
->btree_inode
->i_nlink
= 1;
553 fs_info
->btree_inode
->i_size
= sb
->s_bdev
->bd_inode
->i_size
;
554 fs_info
->btree_inode
->i_mapping
->a_ops
= &btree_aops
;
555 extent_map_tree_init(&BTRFS_I(fs_info
->btree_inode
)->extent_tree
,
556 fs_info
->btree_inode
->i_mapping
,
558 BTRFS_I(fs_info
->btree_inode
)->extent_tree
.ops
= &btree_extent_map_ops
;
560 extent_map_tree_init(&fs_info
->free_space_cache
,
561 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
562 extent_map_tree_init(&fs_info
->block_group_cache
,
563 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
564 extent_map_tree_init(&fs_info
->pinned_extents
,
565 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
566 extent_map_tree_init(&fs_info
->pending_del
,
567 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
568 extent_map_tree_init(&fs_info
->extent_ins
,
569 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
570 fs_info
->do_barriers
= 1;
571 fs_info
->closing
= 0;
572 fs_info
->total_pinned
= 0;
574 INIT_DELAYED_WORK(&fs_info
->trans_work
, btrfs_transaction_cleaner
);
575 BTRFS_I(fs_info
->btree_inode
)->root
= tree_root
;
576 memset(&BTRFS_I(fs_info
->btree_inode
)->location
, 0,
577 sizeof(struct btrfs_key
));
578 insert_inode_hash(fs_info
->btree_inode
);
579 mapping_set_gfp_mask(fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
581 mutex_init(&fs_info
->trans_mutex
);
582 mutex_init(&fs_info
->fs_mutex
);
585 ret
= add_hasher(fs_info
, "crc32c");
587 printk("btrfs: failed hash setup, modprobe cryptomgr?\n");
592 __setup_root(512, 512, 512, tree_root
,
593 fs_info
, BTRFS_ROOT_TREE_OBJECTID
);
595 fs_info
->sb_buffer
= read_tree_block(tree_root
,
596 BTRFS_SUPER_INFO_OFFSET
,
599 if (!fs_info
->sb_buffer
)
602 read_extent_buffer(fs_info
->sb_buffer
, &fs_info
->super_copy
, 0,
603 sizeof(fs_info
->super_copy
));
605 read_extent_buffer(fs_info
->sb_buffer
, fs_info
->fsid
,
606 (unsigned long)btrfs_super_fsid(fs_info
->sb_buffer
),
608 disk_super
= &fs_info
->super_copy
;
609 if (!btrfs_super_root(disk_super
))
612 nodesize
= btrfs_super_nodesize(disk_super
);
613 leafsize
= btrfs_super_leafsize(disk_super
);
614 sectorsize
= btrfs_super_sectorsize(disk_super
);
615 tree_root
->nodesize
= nodesize
;
616 tree_root
->leafsize
= leafsize
;
617 tree_root
->sectorsize
= sectorsize
;
618 sb_set_blocksize(sb
, sectorsize
);
620 i_size_write(fs_info
->btree_inode
,
621 btrfs_super_total_bytes(disk_super
));
623 if (strncmp((char *)(&disk_super
->magic
), BTRFS_MAGIC
,
624 sizeof(disk_super
->magic
))) {
625 printk("btrfs: valid FS not found on %s\n", sb
->s_id
);
629 blocksize
= btrfs_level_size(tree_root
,
630 btrfs_super_root_level(disk_super
));
632 tree_root
->node
= read_tree_block(tree_root
,
633 btrfs_super_root(disk_super
),
635 if (!tree_root
->node
)
638 mutex_lock(&fs_info
->fs_mutex
);
640 ret
= find_and_setup_root(tree_root
, fs_info
,
641 BTRFS_EXTENT_TREE_OBJECTID
, extent_root
);
643 mutex_unlock(&fs_info
->fs_mutex
);
647 btrfs_read_block_groups(extent_root
);
649 fs_info
->generation
= btrfs_super_generation(disk_super
) + 1;
650 mutex_unlock(&fs_info
->fs_mutex
);
654 free_extent_buffer(tree_root
->node
);
656 free_extent_buffer(fs_info
->sb_buffer
);
658 iput(fs_info
->btree_inode
);
666 int write_ctree_super(struct btrfs_trans_handle
*trans
, struct btrfs_root
670 struct extent_buffer
*super
= root
->fs_info
->sb_buffer
;
671 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
673 set_extent_buffer_dirty(&BTRFS_I(btree_inode
)->extent_tree
, super
);
674 ret
= sync_page_range_nolock(btree_inode
, btree_inode
->i_mapping
,
675 super
->start
, super
->len
);
679 int btrfs_free_fs_root(struct btrfs_fs_info
*fs_info
, struct btrfs_root
*root
)
681 radix_tree_delete(&fs_info
->fs_roots_radix
,
682 (unsigned long)root
->root_key
.objectid
);
683 btrfs_sysfs_del_root(root
);
687 free_extent_buffer(root
->node
);
688 if (root
->commit_root
)
689 free_extent_buffer(root
->commit_root
);
696 static int del_fs_roots(struct btrfs_fs_info
*fs_info
)
699 struct btrfs_root
*gang
[8];
703 ret
= radix_tree_gang_lookup(&fs_info
->fs_roots_radix
,
708 for (i
= 0; i
< ret
; i
++)
709 btrfs_free_fs_root(fs_info
, gang
[i
]);
714 int close_ctree(struct btrfs_root
*root
)
717 struct btrfs_trans_handle
*trans
;
718 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
720 fs_info
->closing
= 1;
721 btrfs_transaction_flush_work(root
);
722 mutex_lock(&fs_info
->fs_mutex
);
723 btrfs_defrag_dirty_roots(root
->fs_info
);
724 trans
= btrfs_start_transaction(root
, 1);
725 ret
= btrfs_commit_transaction(trans
, root
);
726 /* run commit again to drop the original snapshot */
727 trans
= btrfs_start_transaction(root
, 1);
728 btrfs_commit_transaction(trans
, root
);
729 ret
= btrfs_write_and_wait_transaction(NULL
, root
);
731 write_ctree_super(NULL
, root
);
732 mutex_unlock(&fs_info
->fs_mutex
);
734 if (fs_info
->extent_root
->node
)
735 free_extent_buffer(fs_info
->extent_root
->node
);
737 if (fs_info
->tree_root
->node
)
738 free_extent_buffer(fs_info
->tree_root
->node
);
740 free_extent_buffer(fs_info
->sb_buffer
);
742 btrfs_free_block_groups(root
->fs_info
);
743 del_fs_roots(fs_info
);
744 extent_map_tree_empty_lru(&BTRFS_I(fs_info
->btree_inode
)->extent_tree
);
745 truncate_inode_pages(fs_info
->btree_inode
->i_mapping
, 0);
746 iput(fs_info
->btree_inode
);
748 while(!list_empty(&fs_info
->hashers
)) {
749 struct btrfs_hasher
*hasher
;
750 hasher
= list_entry(fs_info
->hashers
.next
, struct btrfs_hasher
,
752 list_del(&hasher
->hashers
);
753 crypto_free_hash(&fs_info
->hash_tfm
);
757 kfree(fs_info
->extent_root
);
758 kfree(fs_info
->tree_root
);
762 int btrfs_buffer_uptodate(struct extent_buffer
*buf
)
764 struct inode
*btree_inode
= buf
->first_page
->mapping
->host
;
765 return extent_buffer_uptodate(&BTRFS_I(btree_inode
)->extent_tree
, buf
);
768 int btrfs_set_buffer_uptodate(struct extent_buffer
*buf
)
770 struct inode
*btree_inode
= buf
->first_page
->mapping
->host
;
771 return set_extent_buffer_uptodate(&BTRFS_I(btree_inode
)->extent_tree
,
775 void btrfs_mark_buffer_dirty(struct extent_buffer
*buf
)
777 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
778 u64 transid
= btrfs_header_generation(buf
);
779 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
781 if (transid
!= root
->fs_info
->generation
) {
782 printk(KERN_CRIT
"transid mismatch buffer %llu, found %Lu running %Lu\n",
783 (unsigned long long)buf
->start
,
784 transid
, root
->fs_info
->generation
);
787 set_extent_buffer_dirty(&BTRFS_I(btree_inode
)->extent_tree
, buf
);
790 void btrfs_btree_balance_dirty(struct btrfs_root
*root
, unsigned long nr
)
792 balance_dirty_pages_ratelimited_nr(
793 root
->fs_info
->btree_inode
->i_mapping
, 1);
796 void btrfs_set_buffer_defrag(struct extent_buffer
*buf
)
798 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
799 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
800 set_extent_bits(&BTRFS_I(btree_inode
)->extent_tree
, buf
->start
,
801 buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG
, GFP_NOFS
);
804 void btrfs_set_buffer_defrag_done(struct extent_buffer
*buf
)
806 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
807 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
808 set_extent_bits(&BTRFS_I(btree_inode
)->extent_tree
, buf
->start
,
809 buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG_DONE
,
813 int btrfs_buffer_defrag(struct extent_buffer
*buf
)
815 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
816 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
817 return test_range_bit(&BTRFS_I(btree_inode
)->extent_tree
,
818 buf
->start
, buf
->start
+ buf
->len
- 1, EXTENT_DEFRAG
, 0);
821 int btrfs_buffer_defrag_done(struct extent_buffer
*buf
)
823 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
824 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
825 return test_range_bit(&BTRFS_I(btree_inode
)->extent_tree
,
826 buf
->start
, buf
->start
+ buf
->len
- 1,
827 EXTENT_DEFRAG_DONE
, 0);
830 int btrfs_clear_buffer_defrag_done(struct extent_buffer
*buf
)
832 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
833 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
834 return clear_extent_bits(&BTRFS_I(btree_inode
)->extent_tree
,
835 buf
->start
, buf
->start
+ buf
->len
- 1,
836 EXTENT_DEFRAG_DONE
, GFP_NOFS
);
839 int btrfs_clear_buffer_defrag(struct extent_buffer
*buf
)
841 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
842 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
843 return clear_extent_bits(&BTRFS_I(btree_inode
)->extent_tree
,
844 buf
->start
, buf
->start
+ buf
->len
- 1,
845 EXTENT_DEFRAG
, GFP_NOFS
);
848 int btrfs_read_buffer(struct extent_buffer
*buf
)
850 struct btrfs_root
*root
= BTRFS_I(buf
->first_page
->mapping
->host
)->root
;
851 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
852 return read_extent_buffer_pages(&BTRFS_I(btree_inode
)->extent_tree
,
856 static struct extent_map_ops btree_extent_map_ops
= {
857 .writepage_io_hook
= btree_writepage_io_hook
,