recursion free-first pass
[btrfs-progs-unstable.git] / disk-io.h
blob1c0af7c56c2114255258113fe36c1f55a1594762
1 #ifndef __DISKIO__
2 #define __DISKIO__
3 #include "list.h"
5 struct tree_buffer {
6 u64 blocknr;
7 int count;
8 union {
9 struct node node;
10 struct leaf leaf;
12 struct list_head dirty;
13 struct list_head cache;
16 struct tree_buffer *read_tree_block(struct ctree_root *root, u64 blocknr);
17 struct tree_buffer *find_tree_block(struct ctree_root *root, u64 blocknr);
18 int write_tree_block(struct ctree_root *root, struct tree_buffer *buf);
19 int dirty_tree_block(struct ctree_root *root, struct tree_buffer *buf);
20 int clean_tree_block(struct ctree_root *root, struct tree_buffer *buf);
21 int commit_transaction(struct ctree_root *root, struct ctree_super_block *s);
22 struct ctree_root *open_ctree(char *filename, struct ctree_super_block *s);
23 int close_ctree(struct ctree_root *root, struct ctree_super_block *s);
24 void tree_block_release(struct ctree_root *root, struct tree_buffer *buf);
25 int write_ctree_super(struct ctree_root *root, struct ctree_super_block *s);
26 int mkfs(int fd);
28 #define CTREE_SUPER_INFO_OFFSET(bs) (16 * (bs))
30 #endif