| H A D | btree.c | 131 nilfs_btree_node_dptrs(const struct nilfs_btree_node *node, int ncmax) in nilfs_btree_node_dptrs() argument
133 return (__le64 *)(nilfs_btree_node_dkeys(node) + ncmax); in nilfs_btree_node_dptrs()
150 int ncmax) in nilfs_btree_node_get_ptr() argument
152 return le64_to_cpu(*(nilfs_btree_node_dptrs(node, ncmax) + index)); in nilfs_btree_node_get_ptr()
157 int ncmax) in nilfs_btree_node_set_ptr() argument
159 *(nilfs_btree_node_dptrs(node, ncmax) + index) = cpu_to_le64(ptr); in nilfs_btree_node_set_ptr()
163 int level, int nchildren, int ncmax, in nilfs_btree_node_init() argument
175 dptrs = nilfs_btree_node_dptrs(node, ncmax); in nilfs_btree_node_init()
240 __u64 key, __u64 ptr, int ncmax) in nilfs_btree_node_insert() argument
247 dptrs = nilfs_btree_node_dptrs(node, ncmax); in nilfs_btree_node_insert()
263 nilfs_btree_node_delete(struct nilfs_btree_node * node,int index,__u64 * keyp,__u64 * ptrp,int ncmax) nilfs_btree_node_delete() argument
468 int ncmax; /* nof children in the parent node */ global() member
555 int level, index, found, ncmax, ret; nilfs_btree_do_lookup() local
615 int index, level, ncmax, ret; nilfs_btree_do_lookup_last() local
713 int ret, cnt, index, maxlevel, ncmax; nilfs_btree_lookup_contig() local
1017 int level, ncmax; nilfs_btree_find_near() local
1070 int pindex, level, ncmax, ncblk, ret; nilfs_btree_prepare_insert() local
1444 int pindex, dindex, level, ncmin, ncmax, ncblk, ret; nilfs_btree_prepare_delete() local
1702 int nchildren, ncmax, i, ret; nilfs_btree_gather_data() local
1930 int ncmax, ret; nilfs_btree_prepare_update_v() local
1965 int ncmax; nilfs_btree_commit_update_v() local
2054 int ncmax; nilfs_btree_propagate_v() local
2213 int ncmax, ret; nilfs_btree_assign_p() local
2257 int ncmax, ret; nilfs_btree_assign_v() local
[all...] |