262 				    __u64 *keyp, __u64 *ptrp, int ncmax)  in nilfs_btree_node_delete()  argument
275 	if (keyp != NULL)  in nilfs_btree_node_delete()
276 		*keyp = key;  in nilfs_btree_node_delete()
599 				      __u64 *keyp, __u64 *ptrp)  in nilfs_btree_do_lookup_last()  argument
628 	if (keyp != NULL)  in nilfs_btree_do_lookup_last()
629 		*keyp = nilfs_btree_node_get_key(node, index);  in nilfs_btree_do_lookup_last()
800 				  int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_do_insert()  argument
809 					*keyp, *ptrp, ncblk);  in nilfs_btree_do_insert()
820 					*keyp, *ptrp,  in nilfs_btree_do_insert()
827 				   int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_carry_left()  argument
868 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_carry_left()
873 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_carry_right()  argument
915 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_carry_right()
920 			      int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_split()  argument
947 					*keyp, *ptrp, ncblk);  in nilfs_btree_split()
949 		*keyp = nilfs_btree_node_get_key(right, 0);  in nilfs_btree_split()
956 		nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_split()
958 		*keyp = nilfs_btree_node_get_key(right, 0);  in nilfs_btree_split()
970 			     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_grow()  argument
991 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_grow()
993 	*keyp = nilfs_btree_node_get_key(child, 0);  in nilfs_btree_grow()
1250 				  int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_do_delete()  argument
1259 					keyp, ptrp, ncblk);  in nilfs_btree_do_delete()
1268 					keyp, ptrp,  in nilfs_btree_do_delete()
1275 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_borrow_left()  argument
1280 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_borrow_left()
1307 				     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_borrow_right()  argument
1312 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_borrow_right()
1340 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_concat_left()  argument
1345 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_concat_left()
1366 				     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_concat_right()  argument
1371 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_concat_right()
1391 			       int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_shrink()  argument
1396 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_shrink()
1415 			    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_nop()  argument
1601 				__u64 *keyp)  in nilfs_btree_seek_key()  argument
1613 		*keyp = start;  in nilfs_btree_seek_key()
1615 		ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp);  in nilfs_btree_seek_key()
1621 static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp)  in nilfs_btree_last_key()  argument
1630 	ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL);  in nilfs_btree_last_key()