summaryrefslogtreecommitdiffstats
path: root/fs/nilfs2/btnode.h
diff options
context:
space:
mode:
authorRyusuke Konishi <konishi.ryusuke@lab.ntt.co.jp>2009-11-13 16:04:11 +0900
committerRyusuke Konishi <konishi.ryusuke@lab.ntt.co.jp>2009-11-20 10:05:49 +0900
commitd501d7368937740e8d06671a4bfe4e236ed25bd0 (patch)
treec0abbdc89862cfdb5e85321cbc6f2959af376cd9 /fs/nilfs2/btnode.h
parentb34a65069caa56b691ebab5ae0b8e54d16406d16 (diff)
downloadlinux-d501d7368937740e8d06671a4bfe4e236ed25bd0.tar.bz2
nilfs2: separate function for creating new btree node block
Adds a separate routine for creating a btree node block. This is a preparation to reduce the depth of function calls during submitting btree node buffer. Signed-off-by: Ryusuke Konishi <konishi.ryusuke@lab.ntt.co.jp>
Diffstat (limited to 'fs/nilfs2/btnode.h')
-rw-r--r--fs/nilfs2/btnode.h2
1 files changed, 2 insertions, 0 deletions
diff --git a/fs/nilfs2/btnode.h b/fs/nilfs2/btnode.h
index 3e2275172ed6..c53644c0cf0f 100644
--- a/fs/nilfs2/btnode.h
+++ b/fs/nilfs2/btnode.h
@@ -40,6 +40,8 @@ struct nilfs_btnode_chkey_ctxt {
void nilfs_btnode_cache_init_once(struct address_space *);
void nilfs_btnode_cache_init(struct address_space *, struct backing_dev_info *);
void nilfs_btnode_cache_clear(struct address_space *);
+struct buffer_head *nilfs_btnode_create_block(struct address_space *btnc,
+ __u64 blocknr);
int nilfs_btnode_submit_block(struct address_space *, __u64, sector_t,
struct buffer_head **, int);
int nilfs_btnode_get(struct address_space *, __u64, sector_t,