H A D | btree.c | 26 int level = NILFS_BTREE_LEVEL_DATA; in nilfs_btree_alloc_path() local 32 for (; level < NILFS_BTREE_LEVEL_MAX; level++) { in nilfs_btree_alloc_path() 33 path[level].bp_bh = NULL; in nilfs_btree_alloc_path() 34 path[level].bp_sib_bh = NULL; in nilfs_btree_alloc_path() 35 path[level].bp_index = 0; in nilfs_btree_alloc_path() 36 path[level].bp_oldreq.bpr_ptr = NILFS_BMAP_INVALID_PTR; in nilfs_btree_alloc_path() 37 path[level].bp_newreq.bpr_ptr = NILFS_BMAP_INVALID_PTR; in nilfs_btree_alloc_path() 38 path[level].bp_op = NULL; in nilfs_btree_alloc_path() 47 int level in nilfs_btree_free_path() local 96 nilfs_btree_node_set_level(struct nilfs_btree_node * node,int level) nilfs_btree_node_set_level() argument 163 nilfs_btree_node_init(struct nilfs_btree_node * node,int flags,int level,int nchildren,int ncmax,const __u64 * keys,const __u64 * ptrs) nilfs_btree_node_init() argument 343 int level, flags, nchildren; nilfs_btree_node_broken() local 374 int level, flags, nchildren; nilfs_btree_root_broken() local 417 nilfs_btree_get_nonroot_node(const struct nilfs_btree_path * path,int level) nilfs_btree_get_nonroot_node() argument 423 nilfs_btree_get_sib_node(const struct nilfs_btree_path * path,int level) nilfs_btree_get_sib_node() argument 436 nilfs_btree_get_node(const struct nilfs_bmap * btree,const struct nilfs_btree_path * path,int level,int * ncmaxp) nilfs_btree_get_node() argument 451 nilfs_btree_bad_node(const struct nilfs_bmap * btree,struct nilfs_btree_node * node,int level) nilfs_btree_bad_node() argument 555 int level, index, found, ncmax, ret; nilfs_btree_do_lookup() local 615 int index, level, ncmax, ret; nilfs_btree_do_lookup_last() local 664 int index, next_adj, level; nilfs_btree_get_next_key() local 687 nilfs_btree_lookup(const struct nilfs_bmap * btree,__u64 key,int level,__u64 * ptrp) nilfs_btree_lookup() argument 712 int level = NILFS_BTREE_LEVEL_NODE_MIN; nilfs_btree_lookup_contig() local 794 nilfs_btree_promote_key(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 key) nilfs_btree_promote_key() argument 816 nilfs_btree_do_insert(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_do_insert() argument 843 nilfs_btree_carry_left(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_carry_left() argument 889 nilfs_btree_carry_right(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_carry_right() argument 936 nilfs_btree_split(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_split() argument 986 nilfs_btree_grow(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_grow() argument 1017 int level, ncmax; nilfs_btree_find_near() local 1070 int pindex, level, ncmax, ncblk, ret; nilfs_btree_prepare_insert() local 1216 int level; nilfs_btree_commit_insert() local 1239 int level, ret; nilfs_btree_insert() local 1266 nilfs_btree_do_delete(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_do_delete() argument 1291 nilfs_btree_borrow_left(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_borrow_left() argument 1323 nilfs_btree_borrow_right(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_borrow_right() argument 1356 nilfs_btree_concat_left(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_concat_left() argument 1382 nilfs_btree_concat_right(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_concat_right() argument 1407 nilfs_btree_shrink(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_shrink() argument 1431 nilfs_btree_nop(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_nop() argument 1444 int pindex, dindex, level, ncmin, ncmax, ncblk, ret; nilfs_btree_prepare_delete() local 1574 int level; nilfs_btree_commit_delete() local 1591 int level, ret; nilfs_btree_delete() local 1915 nilfs_btree_propagate_p(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct buffer_head * bh) nilfs_btree_propagate_p() argument 1927 nilfs_btree_prepare_update_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct inode * dat) nilfs_btree_prepare_update_v() argument 1962 nilfs_btree_commit_update_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct inode * dat) nilfs_btree_commit_update_v() argument 1986 nilfs_btree_abort_update_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct inode * dat) nilfs_btree_abort_update_v() argument 2001 int level, ret; nilfs_btree_prepare_propagate_v() local 2037 int level; nilfs_btree_commit_propagate_v() local 2048 nilfs_btree_propagate_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct buffer_head * bh) nilfs_btree_propagate_v() argument 2087 int level, ret; nilfs_btree_propagate() local 2138 int level; nilfs_btree_add_dirty_buffer() local 2174 int level, i; nilfs_btree_lookup_dirty_buffers() local 2205 nilfs_btree_assign_p(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct buffer_head ** bh,sector_t blocknr,union nilfs_binfo * binfo) nilfs_btree_assign_p() argument 2247 nilfs_btree_assign_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct buffer_head ** bh,sector_t blocknr,union nilfs_binfo * binfo) nilfs_btree_assign_v() argument 2284 int level, ret; nilfs_btree_assign() local 2342 nilfs_btree_mark(struct nilfs_bmap * btree,__u64 key,int level) nilfs_btree_mark() argument [all...] |