263 				    __u64 *keyp, __u64 *ptrp, int ncmax)  in nilfs_btree_node_delete()  argument
276 	if (keyp != NULL)  in nilfs_btree_node_delete()
277 		*keyp = key;  in nilfs_btree_node_delete()
601 				      __u64 *keyp, __u64 *ptrp)  in nilfs_btree_do_lookup_last()  argument
630 	if (keyp != NULL)  in nilfs_btree_do_lookup_last()
631 		*keyp = nilfs_btree_node_get_key(node, index);  in nilfs_btree_do_lookup_last()
801 				  int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_do_insert()  argument
810 					*keyp, *ptrp, ncblk);  in nilfs_btree_do_insert()
821 					*keyp, *ptrp,  in nilfs_btree_do_insert()
828 				   int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_carry_left()  argument
869 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_carry_left()
874 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_carry_right()  argument
916 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_carry_right()
921 			      int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_split()  argument
948 					*keyp, *ptrp, ncblk);  in nilfs_btree_split()
950 		*keyp = nilfs_btree_node_get_key(right, 0);  in nilfs_btree_split()
957 		nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_split()
959 		*keyp = nilfs_btree_node_get_key(right, 0);  in nilfs_btree_split()
971 			     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_grow()  argument
992 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_grow()
994 	*keyp = nilfs_btree_node_get_key(child, 0);  in nilfs_btree_grow()
1251 				  int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_do_delete()  argument
1260 					keyp, ptrp, ncblk);  in nilfs_btree_do_delete()
1269 					keyp, ptrp,  in nilfs_btree_do_delete()
1276 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_borrow_left()  argument
1281 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_borrow_left()
1308 				     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_borrow_right()  argument
1313 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_borrow_right()
1341 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_concat_left()  argument
1346 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_concat_left()
1367 				     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_concat_right()  argument
1372 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_concat_right()
1392 			       int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_shrink()  argument
1397 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_shrink()
1416 			    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_nop()  argument
1602 				__u64 *keyp)  in nilfs_btree_seek_key()  argument
1614 		*keyp = start;  in nilfs_btree_seek_key()
1616 		ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp);  in nilfs_btree_seek_key()
1622 static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp)  in nilfs_btree_last_key()  argument
1631 	ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL);  in nilfs_btree_last_key()