Btrfs: Extent based page cache code. This uses an rbtree of extents and tests
[linux-2.6-block.git] / fs / btrfs / disk-io.h
CommitLineData
6cbd5570
CM
1/*
2 * Copyright (C) 2007 Oracle. All rights reserved.
3 *
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.
7 *
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.
12 *
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.
17 */
18
eb60ceac
CM
19#ifndef __DISKIO__
20#define __DISKIO__
21
e20d96d6 22#include <linux/buffer_head.h>
eb60ceac 23
e20d96d6
CM
24#define BTRFS_SUPER_INFO_OFFSET (16 * 1024)
25
090d1875
CM
26enum btrfs_bh_state_bits {
27 BH_Checked = BH_PrivateStart,
f2183bde 28 BH_Defrag,
090d1875
CM
29};
30BUFFER_FNS(Checked, checked);
f2183bde 31BUFFER_FNS(Defrag, defrag);
090d1875 32
e20d96d6
CM
33static inline struct btrfs_node *btrfs_buffer_node(struct buffer_head *bh)
34{
35 return (struct btrfs_node *)bh->b_data;
36}
37
38static inline struct btrfs_leaf *btrfs_buffer_leaf(struct buffer_head *bh)
39{
40 return (struct btrfs_leaf *)bh->b_data;
41}
42
43static inline struct btrfs_header *btrfs_buffer_header(struct buffer_head *bh)
44{
45 return &((struct btrfs_node *)bh->b_data)->header;
46}
47
48struct buffer_head *read_tree_block(struct btrfs_root *root, u64 blocknr);
090d1875 49int readahead_tree_block(struct btrfs_root *root, u64 blocknr);
d98237b3
CM
50struct buffer_head *btrfs_find_create_tree_block(struct btrfs_root *root,
51 u64 blocknr);
e089f05c 52int write_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
e20d96d6 53 struct buffer_head *buf);
e089f05c 54int dirty_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
e20d96d6 55 struct buffer_head *buf);
e089f05c 56int clean_tree_block(struct btrfs_trans_handle *trans,
e20d96d6 57 struct btrfs_root *root, struct buffer_head *buf);
79154b1b
CM
58int btrfs_commit_transaction(struct btrfs_trans_handle *trans,
59 struct btrfs_root *root);
2c90e5d6 60struct btrfs_root *open_ctree(struct super_block *sb);
e20d96d6
CM
61int close_ctree(struct btrfs_root *root);
62void btrfs_block_release(struct btrfs_root *root, struct buffer_head *buf);
79154b1b
CM
63int write_ctree_super(struct btrfs_trans_handle *trans,
64 struct btrfs_root *root);
d98237b3 65struct buffer_head *btrfs_find_tree_block(struct btrfs_root *root, u64 blocknr);
f254e52c
CM
66int btrfs_csum_data(struct btrfs_root * root, char *data, size_t len,
67 char *result);
0f7d52f4
CM
68struct btrfs_root *btrfs_read_fs_root(struct btrfs_fs_info *fs_info,
69 struct btrfs_key *location);
5eda7b5e
CM
70struct btrfs_root *btrfs_read_fs_root_no_radix(struct btrfs_fs_info *fs_info,
71 struct btrfs_key *location);
7eccb903 72u64 bh_blocknr(struct buffer_head *bh);
8352d8a4
CM
73int btrfs_insert_dev_radix(struct btrfs_root *root,
74 struct block_device *bdev,
b4100d64 75 u64 device_id,
8352d8a4
CM
76 u64 block_start,
77 u64 num_blocks);
78int btrfs_map_bh_to_logical(struct btrfs_root *root, struct buffer_head *bh,
79 u64 logical);
35b7e476 80void btrfs_btree_balance_dirty(struct btrfs_root *root);
5eda7b5e 81int btrfs_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root);
ccd467d6 82void btrfs_mark_buffer_dirty(struct buffer_head *bh);
eb60ceac 83#endif