275 				    __u64 *keyp, __u64 *ptrp, int ncmax)  in nilfs_btree_node_delete()  argument
290 	if (ptrp != NULL)  in nilfs_btree_node_delete()
291 		*ptrp = ptr;  in nilfs_btree_node_delete()
537 				 __u64 key, __u64 *ptrp, int minlevel,  in nilfs_btree_do_lookup()  argument
591 	if (ptrp != NULL)  in nilfs_btree_do_lookup()
592 		*ptrp = ptr;  in nilfs_btree_do_lookup()
599 				      __u64 *keyp, __u64 *ptrp)  in nilfs_btree_do_lookup_last()  argument
630 	if (ptrp != NULL)  in nilfs_btree_do_lookup_last()
631 		*ptrp = ptr;  in nilfs_btree_do_lookup_last()
675 			      __u64 key, int level, __u64 *ptrp)  in nilfs_btree_lookup()  argument
684 	ret = nilfs_btree_do_lookup(btree, path, key, ptrp, level, 0);  in nilfs_btree_lookup()
692 				     __u64 key, __u64 *ptrp, unsigned maxblocks)  in nilfs_btree_lookup_contig()  argument
768 	*ptrp = ptr;  in nilfs_btree_lookup_contig()
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
951 					*keyp, *ptrp, ncblk);  in nilfs_btree_split()
954 		*ptrp = path[level].bp_newreq.bpr_ptr;  in nilfs_btree_split()
960 		nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_split()
963 		*ptrp = path[level].bp_newreq.bpr_ptr;  in nilfs_btree_split()
974 			     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_grow()  argument
995 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);  in nilfs_btree_grow()
998 	*ptrp = path[level].bp_newreq.bpr_ptr;  in nilfs_btree_grow()
1254 				  int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_do_delete()  argument
1263 					keyp, ptrp, ncblk);  in nilfs_btree_do_delete()
1272 					keyp, ptrp,  in nilfs_btree_do_delete()
1279 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_borrow_left()  argument
1284 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_borrow_left()
1311 				     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_borrow_right()  argument
1316 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_borrow_right()
1344 				    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_concat_left()  argument
1349 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_concat_left()
1370 				     int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_concat_right()  argument
1375 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_concat_right()
1395 			       int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_shrink()  argument
1400 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);  in nilfs_btree_shrink()
1419 			    int level, __u64 *keyp, __u64 *ptrp)  in nilfs_btree_nop()  argument