| H A D | btree.c | 662 int maxlevel = nilfs_btree_height(btree) - 1; in nilfs_btree_get_next_key()
667 for (level = minlevel; level <= maxlevel; level++) { in nilfs_btree_get_next_key()
668 if (level == maxlevel) in nilfs_btree_get_next_key()
712 int ret, cnt, index, maxlevel, ncmax; in nilfs_btree_lookup_contig()
734 maxlevel = nilfs_btree_height(btree) - 1; in nilfs_btree_lookup_contig()
753 if (level == maxlevel) in nilfs_btree_lookup_contig()
1212 int maxlevel, __u64 key, __u64 ptr) in nilfs_btree_commit_insert()
1224 for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) { in nilfs_btree_commit_insert()
1571 int maxlevel, struct inode *dat) in nilfs_btree_commit_delete()
1575 for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; leve in nilfs_btree_commit_delete()
663 int maxlevel = nilfs_btree_height(btree) - 1; nilfs_btree_get_next_key() local
713 int ret, cnt, index, maxlevel, ncmax; nilfs_btree_lookup_contig() local
1213 nilfs_btree_commit_insert(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int maxlevel,__u64 key,__u64 ptr) nilfs_btree_commit_insert() argument
1572 nilfs_btree_commit_delete(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int maxlevel,struct inode * dat) nilfs_btree_commit_delete() argument
2033 nilfs_btree_commit_propagate_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int minlevel,int maxlevel,struct buffer_head * bh,struct inode * dat) nilfs_btree_commit_propagate_v() argument
2050 int maxlevel = 0, ret; nilfs_btree_propagate_v() local
[all...] |