1 #include <linux/module.h>
3 #include <linux/blkdev.h>
4 #include <linux/crypto.h>
5 #include <linux/scatterlist.h>
6 #include <linux/swap.h>
7 #include <linux/radix-tree.h>
10 #include "transaction.h"
11 #include "btrfs_inode.h"
17 struct block_device
*bdev
;
20 int btrfs_insert_dev_radix(struct btrfs_root
*root
,
21 struct block_device
*bdev
,
26 struct dev_lookup
*lookup
;
27 char b
[BDEVNAME_SIZE
];
30 lookup
= kmalloc(sizeof(*lookup
), GFP_NOFS
);
33 lookup
->block_start
= block_start
;
34 lookup
->num_blocks
= num_blocks
;
36 lookup
->device_id
= device_id
;
37 printk("inserting %s into dev radix %Lu %Lu\n", bdevname(bdev
, b
), block_start
, num_blocks
);
39 ret
= radix_tree_insert(&root
->fs_info
->dev_radix
, block_start
+
40 num_blocks
- 1, lookup
);
44 u64
bh_blocknr(struct buffer_head
*bh
)
46 int blkbits
= bh
->b_page
->mapping
->host
->i_blkbits
;
47 u64 blocknr
= bh
->b_page
->index
<< (PAGE_CACHE_SHIFT
- blkbits
);
50 if (PageHighMem(bh
->b_page
))
51 offset
= (unsigned long)bh
->b_data
;
53 offset
= bh
->b_data
- (char *)page_address(bh
->b_page
);
54 blocknr
+= offset
>> (PAGE_CACHE_SHIFT
- blkbits
);
58 static int check_tree_block(struct btrfs_root
*root
, struct buffer_head
*buf
)
60 struct btrfs_node
*node
= btrfs_buffer_node(buf
);
61 if (bh_blocknr(buf
) != btrfs_header_blocknr(&node
->header
)) {
62 printk(KERN_CRIT
"bh_blocknr(buf) is %Lu, header is %Lu\n",
63 bh_blocknr(buf
), btrfs_header_blocknr(&node
->header
));
69 struct buffer_head
*btrfs_find_tree_block(struct btrfs_root
*root
, u64 blocknr
)
71 struct address_space
*mapping
= root
->fs_info
->btree_inode
->i_mapping
;
72 int blockbits
= root
->fs_info
->sb
->s_blocksize_bits
;
73 unsigned long index
= blocknr
>> (PAGE_CACHE_SHIFT
- blockbits
);
75 struct buffer_head
*bh
;
76 struct buffer_head
*head
;
77 struct buffer_head
*ret
= NULL
;
80 page
= find_lock_page(mapping
, index
);
84 if (!page_has_buffers(page
))
87 head
= page_buffers(page
);
90 if (buffer_mapped(bh
) && bh_blocknr(bh
) == blocknr
) {
102 page_cache_release(page
);
106 int btrfs_map_bh_to_logical(struct btrfs_root
*root
, struct buffer_head
*bh
,
109 struct dev_lookup
*lookup
[2];
113 root
= root
->fs_info
->dev_root
;
114 ret
= radix_tree_gang_lookup(&root
->fs_info
->dev_radix
,
116 (unsigned long)logical
,
118 if (ret
== 0 || lookup
[0]->block_start
> logical
||
119 lookup
[0]->block_start
+ lookup
[0]->num_blocks
<= logical
) {
123 bh
->b_bdev
= lookup
[0]->bdev
;
124 bh
->b_blocknr
= logical
- lookup
[0]->block_start
;
125 set_buffer_mapped(bh
);
131 struct buffer_head
*btrfs_find_create_tree_block(struct btrfs_root
*root
,
134 struct address_space
*mapping
= root
->fs_info
->btree_inode
->i_mapping
;
135 int blockbits
= root
->fs_info
->sb
->s_blocksize_bits
;
136 unsigned long index
= blocknr
>> (PAGE_CACHE_SHIFT
- blockbits
);
138 struct buffer_head
*bh
;
139 struct buffer_head
*head
;
140 struct buffer_head
*ret
= NULL
;
142 u64 first_block
= index
<< (PAGE_CACHE_SHIFT
- blockbits
);
144 page
= grab_cache_page(mapping
, index
);
148 if (!page_has_buffers(page
))
149 create_empty_buffers(page
, root
->fs_info
->sb
->s_blocksize
, 0);
150 head
= page_buffers(page
);
153 if (!buffer_mapped(bh
)) {
154 err
= btrfs_map_bh_to_logical(root
, bh
, first_block
);
157 if (bh_blocknr(bh
) == blocknr
) {
162 bh
= bh
->b_this_page
;
164 } while (bh
!= head
);
169 page_cache_release(page
);
173 static int btree_get_block(struct inode
*inode
, sector_t iblock
,
174 struct buffer_head
*bh
, int create
)
177 struct btrfs_root
*root
= BTRFS_I(bh
->b_page
->mapping
->host
)->root
;
178 err
= btrfs_map_bh_to_logical(root
, bh
, iblock
);
182 int btrfs_csum_data(struct btrfs_root
* root
, char *data
, size_t len
,
185 struct scatterlist sg
;
186 struct crypto_hash
*tfm
= root
->fs_info
->hash_tfm
;
187 struct hash_desc desc
;
192 sg_init_one(&sg
, data
, len
);
193 spin_lock(&root
->fs_info
->hash_lock
);
194 ret
= crypto_hash_digest(&desc
, &sg
, 1, result
);
195 spin_unlock(&root
->fs_info
->hash_lock
);
197 printk("sha256 digest failed\n");
201 static int csum_tree_block(struct btrfs_root
*root
, struct buffer_head
*bh
,
204 char result
[BTRFS_CSUM_SIZE
];
206 struct btrfs_node
*node
;
208 ret
= btrfs_csum_data(root
, bh
->b_data
+ BTRFS_CSUM_SIZE
,
209 bh
->b_size
- BTRFS_CSUM_SIZE
, result
);
213 if (memcmp(bh
->b_data
, result
, BTRFS_CSUM_SIZE
)) {
214 printk("checksum verify failed on %Lu\n",
219 node
= btrfs_buffer_node(bh
);
220 memcpy(node
->header
.csum
, result
, BTRFS_CSUM_SIZE
);
225 static int btree_writepage(struct page
*page
, struct writeback_control
*wbc
)
227 struct buffer_head
*bh
;
228 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
229 struct buffer_head
*head
;
230 if (!page_has_buffers(page
)) {
231 create_empty_buffers(page
, root
->fs_info
->sb
->s_blocksize
,
232 (1 << BH_Dirty
)|(1 << BH_Uptodate
));
234 head
= page_buffers(page
);
237 if (buffer_dirty(bh
))
238 csum_tree_block(root
, bh
, 0);
239 bh
= bh
->b_this_page
;
240 } while (bh
!= head
);
241 return block_write_full_page(page
, btree_get_block
, wbc
);
244 static int btree_readpage(struct file
* file
, struct page
* page
)
246 return block_read_full_page(page
, btree_get_block
);
249 static struct address_space_operations btree_aops
= {
250 .readpage
= btree_readpage
,
251 .writepage
= btree_writepage
,
252 .sync_page
= block_sync_page
,
255 struct buffer_head
*read_tree_block(struct btrfs_root
*root
, u64 blocknr
)
257 struct buffer_head
*bh
= NULL
;
259 bh
= btrfs_find_create_tree_block(root
, blocknr
);
262 if (buffer_uptodate(bh
))
265 if (!buffer_uptodate(bh
)) {
267 bh
->b_end_io
= end_buffer_read_sync
;
270 if (!buffer_uptodate(bh
))
272 csum_tree_block(root
, bh
, 1);
277 if (check_tree_block(root
, bh
))
285 int dirty_tree_block(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
286 struct buffer_head
*buf
)
288 WARN_ON(atomic_read(&buf
->b_count
) == 0);
289 mark_buffer_dirty(buf
);
293 int clean_tree_block(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
294 struct buffer_head
*buf
)
296 WARN_ON(atomic_read(&buf
->b_count
) == 0);
297 clear_buffer_dirty(buf
);
301 static int __setup_root(int blocksize
,
302 struct btrfs_root
*root
,
303 struct btrfs_fs_info
*fs_info
,
308 root
->commit_root
= NULL
;
309 root
->blocksize
= blocksize
;
311 root
->fs_info
= fs_info
;
312 root
->objectid
= objectid
;
313 root
->last_trans
= 0;
314 root
->highest_inode
= 0;
315 root
->last_inode_alloc
= 0;
316 memset(&root
->root_key
, 0, sizeof(root
->root_key
));
317 memset(&root
->root_item
, 0, sizeof(root
->root_item
));
321 static int find_and_setup_root(int blocksize
,
322 struct btrfs_root
*tree_root
,
323 struct btrfs_fs_info
*fs_info
,
325 struct btrfs_root
*root
)
329 __setup_root(blocksize
, root
, fs_info
, objectid
);
330 ret
= btrfs_find_last_root(tree_root
, objectid
,
331 &root
->root_item
, &root
->root_key
);
334 root
->node
= read_tree_block(root
,
335 btrfs_root_blocknr(&root
->root_item
));
340 struct btrfs_root
*btrfs_read_fs_root(struct btrfs_fs_info
*fs_info
,
341 struct btrfs_key
*location
)
343 struct btrfs_root
*root
;
344 struct btrfs_root
*tree_root
= fs_info
->tree_root
;
345 struct btrfs_path
*path
;
346 struct btrfs_leaf
*l
;
350 printk("read_fs_root looking for %Lu %Lu %u\n", location
->objectid
, location
->offset
, location
->flags
);
351 root
= radix_tree_lookup(&fs_info
->fs_roots_radix
,
352 (unsigned long)location
->objectid
);
354 printk("found %p in cache\n", root
);
357 root
= kmalloc(sizeof(*root
), GFP_NOFS
);
360 return ERR_PTR(-ENOMEM
);
362 if (location
->offset
== (u64
)-1) {
363 ret
= find_and_setup_root(fs_info
->sb
->s_blocksize
,
364 fs_info
->tree_root
, fs_info
,
365 location
->objectid
, root
);
374 __setup_root(fs_info
->sb
->s_blocksize
, root
, fs_info
,
377 path
= btrfs_alloc_path();
379 ret
= btrfs_search_slot(NULL
, tree_root
, location
, path
, 0, 0);
381 printk("internal search_slot gives us %d\n", ret
);
386 l
= btrfs_buffer_leaf(path
->nodes
[0]);
387 memcpy(&root
->root_item
,
388 btrfs_item_ptr(l
, path
->slots
[0], struct btrfs_root_item
),
389 sizeof(root
->root_item
));
390 memcpy(&root
->root_key
, location
, sizeof(*location
));
393 btrfs_release_path(root
, path
);
394 btrfs_free_path(path
);
399 root
->node
= read_tree_block(root
,
400 btrfs_root_blocknr(&root
->root_item
));
403 printk("inserting %p\n", root
);
405 ret
= radix_tree_insert(&fs_info
->fs_roots_radix
,
406 (unsigned long)root
->root_key
.objectid
,
409 printk("radix_tree_insert gives us %d\n", ret
);
414 ret
= btrfs_find_highest_inode(root
, &highest_inode
);
416 root
->highest_inode
= highest_inode
;
417 root
->last_inode_alloc
= highest_inode
;
418 printk("highest inode is %Lu\n", highest_inode
);
420 printk("all worked\n");
424 static int btrfs_open_disk(struct btrfs_root
*root
, u64 device_id
,
425 u64 block_start
, u64 num_blocks
,
426 char *filename
, int name_len
)
429 struct block_device
*bdev
;
432 null_filename
= kmalloc(name_len
+ 1, GFP_NOFS
);
435 memcpy(null_filename
, filename
, name_len
);
436 null_filename
[name_len
] = '\0';
438 bdev
= open_bdev_excl(null_filename
, O_RDWR
, root
->fs_info
->sb
);
443 set_blocksize(bdev
, root
->fs_info
->sb
->s_blocksize
);
444 ret
= btrfs_insert_dev_radix(root
, bdev
, device_id
,
445 block_start
, num_blocks
);
449 kfree(null_filename
);
453 static int read_device_info(struct btrfs_root
*root
)
455 struct btrfs_path
*path
;
457 struct btrfs_key key
;
458 struct btrfs_leaf
*leaf
;
459 struct btrfs_device_item
*dev_item
;
463 root
= root
->fs_info
->dev_root
;
465 path
= btrfs_alloc_path();
471 btrfs_set_key_type(&key
, BTRFS_DEV_ITEM_KEY
);
473 mutex_lock(&root
->fs_info
->fs_mutex
);
474 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
475 leaf
= btrfs_buffer_leaf(path
->nodes
[0]);
476 nritems
= btrfs_header_nritems(&leaf
->header
);
478 slot
= path
->slots
[0];
479 if (slot
>= nritems
) {
480 ret
= btrfs_next_leaf(root
, path
);
483 leaf
= btrfs_buffer_leaf(path
->nodes
[0]);
484 nritems
= btrfs_header_nritems(&leaf
->header
);
485 slot
= path
->slots
[0];
487 btrfs_disk_key_to_cpu(&key
, &leaf
->items
[slot
].key
);
488 if (btrfs_key_type(&key
) != BTRFS_DEV_ITEM_KEY
) {
492 dev_item
= btrfs_item_ptr(leaf
, slot
, struct btrfs_device_item
);
493 printk("found key %Lu %Lu\n", key
.objectid
, key
.offset
);
494 if (btrfs_device_id(dev_item
) !=
495 btrfs_super_device_id(root
->fs_info
->disk_super
)) {
496 ret
= btrfs_open_disk(root
, btrfs_device_id(dev_item
),
497 key
.objectid
, key
.offset
,
498 (char *)(dev_item
+ 1),
499 btrfs_device_pathlen(dev_item
));
504 btrfs_free_path(path
);
505 mutex_unlock(&root
->fs_info
->fs_mutex
);
509 struct btrfs_root
*open_ctree(struct super_block
*sb
)
511 struct btrfs_root
*extent_root
= kmalloc(sizeof(struct btrfs_root
),
513 struct btrfs_root
*dev_root
= kmalloc(sizeof(struct btrfs_root
),
515 struct btrfs_root
*tree_root
= kmalloc(sizeof(struct btrfs_root
),
517 struct btrfs_fs_info
*fs_info
= kmalloc(sizeof(*fs_info
),
520 struct btrfs_super_block
*disk_super
;
521 struct dev_lookup
*dev_lookup
;
523 init_bit_radix(&fs_info
->pinned_radix
);
524 init_bit_radix(&fs_info
->pending_del_radix
);
525 INIT_RADIX_TREE(&fs_info
->fs_roots_radix
, GFP_NOFS
);
526 INIT_RADIX_TREE(&fs_info
->dev_radix
, GFP_NOFS
);
527 sb_set_blocksize(sb
, 4096);
528 fs_info
->running_transaction
= NULL
;
529 fs_info
->tree_root
= tree_root
;
530 fs_info
->extent_root
= extent_root
;
531 fs_info
->dev_root
= dev_root
;
533 fs_info
->btree_inode
= new_inode(sb
);
534 fs_info
->btree_inode
->i_ino
= 1;
535 fs_info
->btree_inode
->i_nlink
= 1;
536 fs_info
->btree_inode
->i_size
= sb
->s_bdev
->bd_inode
->i_size
;
537 fs_info
->btree_inode
->i_mapping
->a_ops
= &btree_aops
;
538 BTRFS_I(fs_info
->btree_inode
)->root
= tree_root
;
539 memset(&BTRFS_I(fs_info
->btree_inode
)->location
, 0,
540 sizeof(struct btrfs_key
));
541 insert_inode_hash(fs_info
->btree_inode
);
542 mapping_set_gfp_mask(fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
543 fs_info
->hash_tfm
= crypto_alloc_hash("sha256", 0, CRYPTO_ALG_ASYNC
);
544 spin_lock_init(&fs_info
->hash_lock
);
545 if (!fs_info
->hash_tfm
|| IS_ERR(fs_info
->hash_tfm
)) {
546 printk("failed to allocate sha256 hash\n");
549 mutex_init(&fs_info
->trans_mutex
);
550 mutex_init(&fs_info
->fs_mutex
);
551 memset(&fs_info
->current_insert
, 0, sizeof(fs_info
->current_insert
));
552 memset(&fs_info
->last_insert
, 0, sizeof(fs_info
->last_insert
));
554 __setup_root(sb
->s_blocksize
, dev_root
,
555 fs_info
, BTRFS_DEV_TREE_OBJECTID
);
557 __setup_root(sb
->s_blocksize
, tree_root
,
558 fs_info
, BTRFS_ROOT_TREE_OBJECTID
);
560 dev_lookup
= kmalloc(sizeof(*dev_lookup
), GFP_NOFS
);
561 dev_lookup
->block_start
= 0;
562 dev_lookup
->num_blocks
= (u32
)-2;
563 dev_lookup
->bdev
= sb
->s_bdev
;
564 dev_lookup
->device_id
= 0;
565 ret
= radix_tree_insert(&fs_info
->dev_radix
, (u32
)-2, dev_lookup
);
567 fs_info
->sb_buffer
= read_tree_block(tree_root
,
568 BTRFS_SUPER_INFO_OFFSET
/
571 if (!fs_info
->sb_buffer
)
573 disk_super
= (struct btrfs_super_block
*)fs_info
->sb_buffer
->b_data
;
574 if (!btrfs_super_root(disk_super
))
577 i_size_write(fs_info
->btree_inode
,
578 btrfs_super_total_blocks(disk_super
) <<
579 fs_info
->btree_inode
->i_blkbits
);
581 radix_tree_delete(&fs_info
->dev_radix
, (u32
)-2);
582 dev_lookup
->block_start
= btrfs_super_device_block_start(disk_super
);
583 dev_lookup
->num_blocks
= btrfs_super_device_num_blocks(disk_super
);
584 dev_lookup
->device_id
= btrfs_super_device_id(disk_super
);
586 ret
= radix_tree_insert(&fs_info
->dev_radix
,
587 dev_lookup
->block_start
+
588 dev_lookup
->num_blocks
- 1, dev_lookup
);
591 fs_info
->disk_super
= disk_super
;
593 dev_root
->node
= read_tree_block(tree_root
,
594 btrfs_super_device_root(disk_super
));
596 ret
= read_device_info(dev_root
);
599 tree_root
->node
= read_tree_block(tree_root
,
600 btrfs_super_root(disk_super
));
601 BUG_ON(!tree_root
->node
);
603 mutex_lock(&fs_info
->fs_mutex
);
604 ret
= find_and_setup_root(sb
->s_blocksize
, tree_root
, fs_info
,
605 BTRFS_EXTENT_TREE_OBJECTID
, extent_root
);
608 fs_info
->generation
= btrfs_super_generation(disk_super
) + 1;
609 memset(&fs_info
->kobj
, 0, sizeof(fs_info
->kobj
));
610 kobj_set_kset_s(fs_info
, btrfs_subsys
);
611 kobject_set_name(&fs_info
->kobj
, "%s", sb
->s_id
);
612 kobject_register(&fs_info
->kobj
);
613 mutex_unlock(&fs_info
->fs_mutex
);
617 int write_ctree_super(struct btrfs_trans_handle
*trans
, struct btrfs_root
620 struct buffer_head
*bh
= root
->fs_info
->sb_buffer
;
622 btrfs_set_super_root(root
->fs_info
->disk_super
,
623 bh_blocknr(root
->fs_info
->tree_root
->node
));
625 WARN_ON(atomic_read(&bh
->b_count
) < 1);
626 clear_buffer_dirty(bh
);
627 csum_tree_block(root
, bh
, 0);
628 bh
->b_end_io
= end_buffer_write_sync
;
630 submit_bh(WRITE
, bh
);
632 if (!buffer_uptodate(bh
)) {
639 static int free_fs_root(struct btrfs_fs_info
*fs_info
, struct btrfs_root
*root
)
641 radix_tree_delete(&fs_info
->fs_roots_radix
,
642 (unsigned long)root
->root_key
.objectid
);
647 if (root
->commit_root
)
648 brelse(root
->commit_root
);
653 int del_fs_roots(struct btrfs_fs_info
*fs_info
)
656 struct btrfs_root
*gang
[8];
660 ret
= radix_tree_gang_lookup(&fs_info
->fs_roots_radix
,
665 for (i
= 0; i
< ret
; i
++)
666 free_fs_root(fs_info
, gang
[i
]);
671 static int free_dev_radix(struct btrfs_fs_info
*fs_info
)
673 struct dev_lookup
*lookup
[8];
674 struct block_device
*super_bdev
= fs_info
->sb
->s_bdev
;
678 ret
= radix_tree_gang_lookup(&fs_info
->dev_radix
,
683 for (i
= 0; i
< ret
; i
++) {
684 if (lookup
[i
]->bdev
!= super_bdev
)
685 close_bdev_excl(lookup
[i
]->bdev
);
686 radix_tree_delete(&fs_info
->dev_radix
,
687 lookup
[i
]->block_start
+
688 lookup
[i
]->num_blocks
- 1);
695 int close_ctree(struct btrfs_root
*root
)
698 struct btrfs_trans_handle
*trans
;
699 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
701 mutex_lock(&fs_info
->fs_mutex
);
702 trans
= btrfs_start_transaction(root
, 1);
703 btrfs_commit_transaction(trans
, root
);
704 /* run commit again to drop the original snapshot */
705 trans
= btrfs_start_transaction(root
, 1);
706 btrfs_commit_transaction(trans
, root
);
707 ret
= btrfs_write_and_wait_transaction(NULL
, root
);
709 write_ctree_super(NULL
, root
);
710 mutex_unlock(&fs_info
->fs_mutex
);
712 if (fs_info
->extent_root
->node
)
713 btrfs_block_release(fs_info
->extent_root
,
714 fs_info
->extent_root
->node
);
715 if (fs_info
->dev_root
->node
)
716 btrfs_block_release(fs_info
->dev_root
,
717 fs_info
->dev_root
->node
);
718 if (fs_info
->tree_root
->node
)
719 btrfs_block_release(fs_info
->tree_root
,
720 fs_info
->tree_root
->node
);
721 btrfs_block_release(root
, fs_info
->sb_buffer
);
722 crypto_free_hash(fs_info
->hash_tfm
);
723 truncate_inode_pages(fs_info
->btree_inode
->i_mapping
, 0);
724 iput(fs_info
->btree_inode
);
726 free_dev_radix(fs_info
);
727 del_fs_roots(fs_info
);
728 kfree(fs_info
->extent_root
);
729 kfree(fs_info
->tree_root
);
730 kobject_unregister(&fs_info
->kobj
);
734 void btrfs_block_release(struct btrfs_root
*root
, struct buffer_head
*buf
)