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()
802 				  int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_do_insert()  argument
811 					*keyp, *ptrp, ncblk);  in nilfs_btree_do_insert()
822 					*keyp, *ptrp,  in nilfs_btree_do_insert()
829 				   int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_carry_left()  argument
870 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_carry_left()
875 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_carry_right()  argument
917 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_carry_right()
922 			      int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_split()  argument
949 					*keyp, *ptrp, ncblk);  in nilfs_btree_split()
951 		*keyp = nilfs_btree_node_get_key(right, 0);  in nilfs_btree_split()
958 		nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_split()
960 		*keyp = nilfs_btree_node_get_key(right, 0);  in nilfs_btree_split()
972 			     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_grow()  argument
993 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_grow()
995 	*keyp = nilfs_btree_node_get_key(child, 0);  in nilfs_btree_grow()
1252 				  int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_do_delete()  argument
1261 					keyp, ptrp, ncblk);  in nilfs_btree_do_delete()
1270 					keyp, ptrp,  in nilfs_btree_do_delete()
1277 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_borrow_left()  argument
1282 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_borrow_left()
1309 				     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_borrow_right()  argument
1314 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_borrow_right()
1342 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_concat_left()  argument
1347 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_concat_left()
1368 				     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_concat_right()  argument
1373 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_concat_right()
1393 			       int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_shrink()  argument
1398 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_shrink()
1417 			    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_nop()  argument
1603 				__u64 *keyp)  in nilfs_btree_seek_key()  argument
1615 		*keyp = start;  in nilfs_btree_seek_key()
1617 		ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp);  in nilfs_btree_seek_key()
1623 static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp)  in nilfs_btree_last_key()  argument
1632 	ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL);  in nilfs_btree_last_key()