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 struct extent_buffer
*btrfs_find_tree_block(struct btrfs_root
*root
,
47 u64 bytenr
, u32 blocksize
)
49 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
50 struct extent_buffer
*eb
;
51 eb
= find_extent_buffer(&BTRFS_I(btree_inode
)->extent_tree
,
52 bytenr
, blocksize
, GFP_NOFS
);
54 eb
->alloc_addr
= (unsigned long)__builtin_return_address(0);
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
, GFP_NOFS
);
66 eb
->alloc_addr
= (unsigned long)__builtin_return_address(0);
70 struct extent_map
*btree_get_extent(struct inode
*inode
, struct page
*page
,
71 size_t page_offset
, u64 start
, u64 end
,
74 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
75 struct extent_map
*em
;
79 em
= lookup_extent_mapping(em_tree
, start
, end
);
83 em
= alloc_extent_map(GFP_NOFS
);
85 em
= ERR_PTR(-ENOMEM
);
89 em
->end
= (i_size_read(inode
) & ~((u64
)PAGE_CACHE_SIZE
-1)) - 1;
91 em
->block_end
= em
->end
;
92 em
->bdev
= inode
->i_sb
->s_bdev
;
93 ret
= add_extent_mapping(em_tree
, em
);
105 static int btree_writepage(struct page
*page
, struct writeback_control
*wbc
)
107 struct extent_map_tree
*tree
;
108 tree
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
109 return extent_write_full_page(tree
, page
, btree_get_extent
, wbc
);
111 int btree_readpage(struct file
*file
, struct page
*page
)
113 struct extent_map_tree
*tree
;
114 tree
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
115 return extent_read_full_page(tree
, page
, btree_get_extent
);
118 static int btree_releasepage(struct page
*page
, gfp_t unused_gfp_flags
)
120 struct extent_map_tree
*tree
;
123 BUG_ON(page
->private != 1);
124 tree
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
125 ret
= try_release_extent_mapping(tree
, page
);
127 ClearPagePrivate(page
);
128 set_page_private(page
, 0);
129 page_cache_release(page
);
134 static void btree_invalidatepage(struct page
*page
, unsigned long offset
)
136 struct extent_map_tree
*tree
;
137 tree
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
138 extent_invalidatepage(tree
, page
, offset
);
139 btree_releasepage(page
, GFP_NOFS
);
142 int btrfs_csum_data(struct btrfs_root
* root
, char *data
, size_t len
,
148 crc
= crc32c(0, data
, len
);
149 memcpy(result
, &crc
, BTRFS_CRC32_SIZE
);
155 static int csum_tree_block(struct btrfs_root
*root
, struct extent_buffer
*buf
,
159 char result
[BTRFS_CRC32_SIZE
];
161 struct btrfs_node
*node
;
163 ret
= btrfs_csum_data(root
, bh
->b_data
+ BTRFS_CSUM_SIZE
,
164 bh
->b_size
- BTRFS_CSUM_SIZE
, result
);
168 if (memcmp(bh
->b_data
, result
, BTRFS_CRC32_SIZE
)) {
169 printk("btrfs: %s checksum verify failed on %llu\n",
170 root
->fs_info
->sb
->s_id
,
171 (unsigned long long)bh_blocknr(bh
));
175 node
= btrfs_buffer_node(bh
);
176 memcpy(node
->header
.csum
, result
, BTRFS_CRC32_SIZE
);
183 static int btree_writepage(struct page
*page
, struct writeback_control
*wbc
)
185 struct buffer_head
*bh
;
186 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
187 struct buffer_head
*head
;
188 if (!page_has_buffers(page
)) {
189 create_empty_buffers(page
, root
->fs_info
->sb
->s_blocksize
,
190 (1 << BH_Dirty
)|(1 << BH_Uptodate
));
192 head
= page_buffers(page
);
195 if (buffer_dirty(bh
))
196 csum_tree_block(root
, bh
, 0);
197 bh
= bh
->b_this_page
;
198 } while (bh
!= head
);
199 return block_write_full_page(page
, btree_get_block
, wbc
);
203 static struct address_space_operations btree_aops
= {
204 .readpage
= btree_readpage
,
205 .writepage
= btree_writepage
,
206 .releasepage
= btree_releasepage
,
207 .invalidatepage
= btree_invalidatepage
,
208 .sync_page
= block_sync_page
,
211 int readahead_tree_block(struct btrfs_root
*root
, u64 bytenr
, u32 blocksize
)
213 struct extent_buffer
*buf
= NULL
;
214 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
217 buf
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
220 read_extent_buffer_pages(&BTRFS_I(btree_inode
)->extent_tree
,
222 free_extent_buffer(buf
);
226 struct extent_buffer
*read_tree_block(struct btrfs_root
*root
, u64 bytenr
,
229 struct extent_buffer
*buf
= NULL
;
230 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
232 buf
= btrfs_find_create_tree_block(root
, bytenr
, blocksize
);
235 read_extent_buffer_pages(&BTRFS_I(btree_inode
)->extent_tree
,
237 buf
->alloc_addr
= (unsigned long)__builtin_return_address(0);
241 int clean_tree_block(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
242 struct extent_buffer
*buf
)
244 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
245 clear_extent_buffer_dirty(&BTRFS_I(btree_inode
)->extent_tree
, buf
);
249 int wait_on_tree_block_writeback(struct btrfs_root
*root
,
250 struct extent_buffer
*buf
)
252 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
253 wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode
)->extent_tree
,
258 int set_tree_block_dirty(struct btrfs_root
*root
, struct extent_buffer
*buf
)
260 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
261 set_extent_buffer_dirty(&BTRFS_I(btree_inode
)->extent_tree
, buf
);
265 static int __setup_root(u32 nodesize
, u32 leafsize
, u32 sectorsize
,
266 struct btrfs_root
*root
,
267 struct btrfs_fs_info
*fs_info
,
272 root
->commit_root
= NULL
;
273 root
->sectorsize
= sectorsize
;
274 root
->nodesize
= nodesize
;
275 root
->leafsize
= leafsize
;
277 root
->fs_info
= fs_info
;
278 root
->objectid
= objectid
;
279 root
->last_trans
= 0;
280 root
->highest_inode
= 0;
281 root
->last_inode_alloc
= 0;
283 memset(&root
->root_key
, 0, sizeof(root
->root_key
));
284 memset(&root
->root_item
, 0, sizeof(root
->root_item
));
285 memset(&root
->defrag_progress
, 0, sizeof(root
->defrag_progress
));
286 memset(&root
->root_kobj
, 0, sizeof(root
->root_kobj
));
287 init_completion(&root
->kobj_unregister
);
288 init_rwsem(&root
->snap_sem
);
289 root
->defrag_running
= 0;
290 root
->defrag_level
= 0;
291 root
->root_key
.objectid
= objectid
;
295 static int find_and_setup_root(struct btrfs_root
*tree_root
,
296 struct btrfs_fs_info
*fs_info
,
298 struct btrfs_root
*root
)
303 __setup_root(tree_root
->nodesize
, tree_root
->leafsize
,
304 tree_root
->sectorsize
, root
, fs_info
, objectid
);
305 ret
= btrfs_find_last_root(tree_root
, objectid
,
306 &root
->root_item
, &root
->root_key
);
309 blocksize
= btrfs_level_size(root
, btrfs_root_level(&root
->root_item
));
310 root
->node
= read_tree_block(root
, btrfs_root_bytenr(&root
->root_item
),
316 struct btrfs_root
*btrfs_read_fs_root_no_radix(struct btrfs_fs_info
*fs_info
,
317 struct btrfs_key
*location
)
319 struct btrfs_root
*root
;
320 struct btrfs_root
*tree_root
= fs_info
->tree_root
;
321 struct btrfs_path
*path
;
322 struct extent_buffer
*l
;
327 root
= kzalloc(sizeof(*root
), GFP_NOFS
);
329 return ERR_PTR(-ENOMEM
);
330 if (location
->offset
== (u64
)-1) {
331 ret
= find_and_setup_root(tree_root
, fs_info
,
332 location
->objectid
, root
);
340 __setup_root(tree_root
->nodesize
, tree_root
->leafsize
,
341 tree_root
->sectorsize
, root
, fs_info
,
344 path
= btrfs_alloc_path();
346 ret
= btrfs_search_slot(NULL
, tree_root
, location
, path
, 0, 0);
353 read_extent_buffer(l
, &root
->root_item
,
354 btrfs_item_ptr_offset(l
, path
->slots
[0]),
355 sizeof(root
->root_item
));
358 btrfs_release_path(root
, path
);
359 btrfs_free_path(path
);
364 blocksize
= btrfs_level_size(root
, btrfs_root_level(&root
->root_item
));
365 root
->node
= read_tree_block(root
, btrfs_root_bytenr(&root
->root_item
),
370 ret
= btrfs_find_highest_inode(root
, &highest_inode
);
372 root
->highest_inode
= highest_inode
;
373 root
->last_inode_alloc
= highest_inode
;
378 struct btrfs_root
*btrfs_read_fs_root(struct btrfs_fs_info
*fs_info
,
379 struct btrfs_key
*location
,
380 const char *name
, int namelen
)
382 struct btrfs_root
*root
;
385 root
= radix_tree_lookup(&fs_info
->fs_roots_radix
,
386 (unsigned long)location
->objectid
);
390 root
= btrfs_read_fs_root_no_radix(fs_info
, location
);
393 ret
= radix_tree_insert(&fs_info
->fs_roots_radix
,
394 (unsigned long)root
->root_key
.objectid
,
397 free_extent_buffer(root
->node
);
402 ret
= btrfs_set_root_name(root
, name
, namelen
);
404 free_extent_buffer(root
->node
);
409 ret
= btrfs_sysfs_add_root(root
);
411 free_extent_buffer(root
->node
);
417 ret
= btrfs_find_dead_roots(fs_info
->tree_root
,
418 root
->root_key
.objectid
, root
);
424 struct btrfs_root
*open_ctree(struct super_block
*sb
)
430 struct btrfs_root
*extent_root
= kmalloc(sizeof(struct btrfs_root
),
432 struct btrfs_root
*tree_root
= kmalloc(sizeof(struct btrfs_root
),
434 struct btrfs_fs_info
*fs_info
= kmalloc(sizeof(*fs_info
),
438 struct btrfs_super_block
*disk_super
;
440 if (!extent_root
|| !tree_root
|| !fs_info
) {
444 INIT_RADIX_TREE(&fs_info
->fs_roots_radix
, GFP_NOFS
);
445 INIT_LIST_HEAD(&fs_info
->trans_list
);
446 INIT_LIST_HEAD(&fs_info
->dead_roots
);
447 memset(&fs_info
->super_kobj
, 0, sizeof(fs_info
->super_kobj
));
448 init_completion(&fs_info
->kobj_unregister
);
449 sb_set_blocksize(sb
, 4096);
450 fs_info
->running_transaction
= NULL
;
451 fs_info
->last_trans_committed
= 0;
452 fs_info
->tree_root
= tree_root
;
453 fs_info
->extent_root
= extent_root
;
455 fs_info
->btree_inode
= new_inode(sb
);
456 fs_info
->btree_inode
->i_ino
= 1;
457 fs_info
->btree_inode
->i_nlink
= 1;
458 fs_info
->btree_inode
->i_size
= sb
->s_bdev
->bd_inode
->i_size
;
459 fs_info
->btree_inode
->i_mapping
->a_ops
= &btree_aops
;
460 extent_map_tree_init(&BTRFS_I(fs_info
->btree_inode
)->extent_tree
,
461 fs_info
->btree_inode
->i_mapping
,
463 extent_map_tree_init(&fs_info
->free_space_cache
,
464 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
465 extent_map_tree_init(&fs_info
->block_group_cache
,
466 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
467 extent_map_tree_init(&fs_info
->pinned_extents
,
468 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
469 extent_map_tree_init(&fs_info
->pending_del
,
470 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
471 extent_map_tree_init(&fs_info
->extent_ins
,
472 fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
473 fs_info
->do_barriers
= 1;
474 fs_info
->closing
= 0;
476 INIT_DELAYED_WORK(&fs_info
->trans_work
, btrfs_transaction_cleaner
);
477 BTRFS_I(fs_info
->btree_inode
)->root
= tree_root
;
478 memset(&BTRFS_I(fs_info
->btree_inode
)->location
, 0,
479 sizeof(struct btrfs_key
));
480 insert_inode_hash(fs_info
->btree_inode
);
481 mapping_set_gfp_mask(fs_info
->btree_inode
->i_mapping
, GFP_NOFS
);
483 mutex_init(&fs_info
->trans_mutex
);
484 mutex_init(&fs_info
->fs_mutex
);
486 __setup_root(512, 512, 512, tree_root
,
487 fs_info
, BTRFS_ROOT_TREE_OBJECTID
);
489 fs_info
->sb_buffer
= read_tree_block(tree_root
,
490 BTRFS_SUPER_INFO_OFFSET
,
493 if (!fs_info
->sb_buffer
)
496 read_extent_buffer(fs_info
->sb_buffer
, &fs_info
->super_copy
, 0,
497 sizeof(fs_info
->super_copy
));
499 read_extent_buffer(fs_info
->sb_buffer
, fs_info
->fsid
,
500 (unsigned long)btrfs_super_fsid(fs_info
->sb_buffer
),
502 disk_super
= &fs_info
->super_copy
;
503 if (!btrfs_super_root(disk_super
))
506 nodesize
= btrfs_super_nodesize(disk_super
);
507 leafsize
= btrfs_super_leafsize(disk_super
);
508 sectorsize
= btrfs_super_sectorsize(disk_super
);
509 tree_root
->nodesize
= nodesize
;
510 tree_root
->leafsize
= leafsize
;
511 tree_root
->sectorsize
= sectorsize
;
513 i_size_write(fs_info
->btree_inode
,
514 btrfs_super_total_bytes(disk_super
));
517 if (strncmp((char *)(&disk_super
->magic
), BTRFS_MAGIC
,
518 sizeof(disk_super
->magic
))) {
519 printk("btrfs: valid FS not found on %s\n", sb
->s_id
);
522 blocksize
= btrfs_level_size(tree_root
,
523 btrfs_super_root_level(disk_super
));
524 tree_root
->node
= read_tree_block(tree_root
,
525 btrfs_super_root(disk_super
),
527 if (!tree_root
->node
)
531 btrfs_print_leaf(tree_root
, tree_root
->node
);
535 mutex_lock(&fs_info
->fs_mutex
);
537 ret
= find_and_setup_root(tree_root
, fs_info
,
538 BTRFS_EXTENT_TREE_OBJECTID
, extent_root
);
540 mutex_unlock(&fs_info
->fs_mutex
);
544 btrfs_read_block_groups(extent_root
);
546 fs_info
->generation
= btrfs_super_generation(disk_super
) + 1;
547 mutex_unlock(&fs_info
->fs_mutex
);
551 free_extent_buffer(tree_root
->node
);
553 free_extent_buffer(fs_info
->sb_buffer
);
555 iput(fs_info
->btree_inode
);
563 int write_ctree_super(struct btrfs_trans_handle
*trans
, struct btrfs_root
567 struct extent_buffer
*super
= root
->fs_info
->sb_buffer
;
568 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
570 set_extent_buffer_dirty(&BTRFS_I(btree_inode
)->extent_tree
, super
);
571 ret
= sync_page_range_nolock(btree_inode
, btree_inode
->i_mapping
,
572 super
->start
, super
->len
);
576 int btrfs_free_fs_root(struct btrfs_fs_info
*fs_info
, struct btrfs_root
*root
)
578 radix_tree_delete(&fs_info
->fs_roots_radix
,
579 (unsigned long)root
->root_key
.objectid
);
580 btrfs_sysfs_del_root(root
);
584 free_extent_buffer(root
->node
);
585 if (root
->commit_root
)
586 free_extent_buffer(root
->commit_root
);
593 static int del_fs_roots(struct btrfs_fs_info
*fs_info
)
596 struct btrfs_root
*gang
[8];
600 ret
= radix_tree_gang_lookup(&fs_info
->fs_roots_radix
,
605 for (i
= 0; i
< ret
; i
++)
606 btrfs_free_fs_root(fs_info
, gang
[i
]);
611 int close_ctree(struct btrfs_root
*root
)
614 struct btrfs_trans_handle
*trans
;
615 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
617 fs_info
->closing
= 1;
618 btrfs_transaction_flush_work(root
);
619 mutex_lock(&fs_info
->fs_mutex
);
620 btrfs_defrag_dirty_roots(root
->fs_info
);
621 trans
= btrfs_start_transaction(root
, 1);
622 ret
= btrfs_commit_transaction(trans
, root
);
623 /* run commit again to drop the original snapshot */
624 trans
= btrfs_start_transaction(root
, 1);
625 btrfs_commit_transaction(trans
, root
);
626 ret
= btrfs_write_and_wait_transaction(NULL
, root
);
628 write_ctree_super(NULL
, root
);
629 mutex_unlock(&fs_info
->fs_mutex
);
631 if (fs_info
->extent_root
->node
)
632 free_extent_buffer(fs_info
->extent_root
->node
);
634 if (fs_info
->tree_root
->node
)
635 free_extent_buffer(fs_info
->tree_root
->node
);
637 free_extent_buffer(fs_info
->sb_buffer
);
639 btrfs_free_block_groups(root
->fs_info
);
640 del_fs_roots(fs_info
);
641 truncate_inode_pages(fs_info
->btree_inode
->i_mapping
, 0);
642 iput(fs_info
->btree_inode
);
643 kfree(fs_info
->extent_root
);
644 kfree(fs_info
->tree_root
);
648 int btrfs_buffer_uptodate(struct extent_buffer
*buf
)
650 struct inode
*btree_inode
= buf
->pages
[0]->mapping
->host
;
651 return extent_buffer_uptodate(&BTRFS_I(btree_inode
)->extent_tree
, buf
);
654 int btrfs_set_buffer_uptodate(struct extent_buffer
*buf
)
656 struct inode
*btree_inode
= buf
->pages
[0]->mapping
->host
;
657 return set_extent_buffer_uptodate(&BTRFS_I(btree_inode
)->extent_tree
,
661 void btrfs_mark_buffer_dirty(struct extent_buffer
*buf
)
663 struct btrfs_root
*root
= BTRFS_I(buf
->pages
[0]->mapping
->host
)->root
;
664 u64 transid
= btrfs_header_generation(buf
);
665 struct inode
*btree_inode
= root
->fs_info
->btree_inode
;
667 if (transid
!= root
->fs_info
->generation
) {
668 printk(KERN_CRIT
"transid mismatch buffer %llu, found %Lu running %Lu\n",
669 (unsigned long long)buf
->start
,
670 transid
, root
->fs_info
->generation
);
673 set_extent_buffer_dirty(&BTRFS_I(btree_inode
)->extent_tree
, buf
);
676 void btrfs_btree_balance_dirty(struct btrfs_root
*root
, unsigned long nr
)
678 balance_dirty_pages_ratelimited_nr(
679 root
->fs_info
->btree_inode
->i_mapping
, nr
);