275 				    __u64 *keyp, __u64 *ptrp, int ncmax)  in nilfs_btree_node_delete()  argument
288 	if (keyp != NULL)  in nilfs_btree_node_delete()
289 		*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()
799 				  int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_do_insert()  argument
808 					*keyp, *ptrp, ncblk);  in nilfs_btree_do_insert()
819 					*keyp, *ptrp,  in nilfs_btree_do_insert()
826 				   int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_carry_left()  argument
867 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_carry_left()
872 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_carry_right()  argument
914 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_carry_right()
919 			      int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_split()  argument
946 					*keyp, *ptrp, ncblk);  in nilfs_btree_split()
948 		*keyp = nilfs_btree_node_get_key(right, 0);  in nilfs_btree_split()
955 		nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_split()
957 		*keyp = nilfs_btree_node_get_key(right, 0);  in nilfs_btree_split()
969 			     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_grow()  argument
990 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_grow()
992 	*keyp = nilfs_btree_node_get_key(child, 0);  in nilfs_btree_grow()
1249 				  int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_do_delete()  argument
1258 					keyp, ptrp, ncblk);  in nilfs_btree_do_delete()
1267 					keyp, ptrp,  in nilfs_btree_do_delete()
1274 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_borrow_left()  argument
1279 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_borrow_left()
1306 				     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_borrow_right()  argument
1311 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_borrow_right()
1339 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_concat_left()  argument
1344 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_concat_left()
1365 				     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_concat_right()  argument
1370 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_concat_right()
1390 			       int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_shrink()  argument
1395 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_shrink()
1414 			    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_nop()  argument
1600 				__u64 *keyp)  in nilfs_btree_seek_key()  argument
1612 		*keyp = start;  in nilfs_btree_seek_key()
1614 		ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp);  in nilfs_btree_seek_key()
1620 static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp)  in nilfs_btree_last_key()  argument
1629 	ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL);  in nilfs_btree_last_key()