fs/nilfs2/btree.c

263 				    __u64 *keyp, __u64 *ptrp, int ncmax)
278 	if (ptrp != NULL)
279 		*ptrp = ptr;
548 				 __u64 key, __u64 *ptrp, int minlevel,
602 	if (ptrp != NULL)
603 		*ptrp = ptr;
610 				      __u64 *keyp, __u64 *ptrp)
641 	if (ptrp != NULL)
642 		*ptrp = ptr;
686 			      __u64 key, int level, __u64 *ptrp)
695 	ret = nilfs_btree_do_lookup(btree, path, key, ptrp, level, 0);
703 				     __u64 key, __u64 *ptrp,
779 	*ptrp = ptr;
815 				  int level, __u64 *keyp, __u64 *ptrp)
824 					*keyp, *ptrp, ncblk);
835 					*keyp, *ptrp,
842 				   int level, __u64 *keyp, __u64 *ptrp)
883 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
888 				    int level, __u64 *keyp, __u64 *ptrp)
930 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
935 			      int level, __u64 *keyp, __u64 *ptrp)
962 					*keyp, *ptrp, ncblk);
965 		*ptrp = path[level].bp_newreq.bpr_ptr;
971 		nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
974 		*ptrp = path[level].bp_newreq.bpr_ptr;
985 			     int level, __u64 *keyp, __u64 *ptrp)
1006 	nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
1009 	*ptrp = path[level].bp_newreq.bpr_ptr;
1265 				  int level, __u64 *keyp, __u64 *ptrp)
1274 					keyp, ptrp, ncblk);
1283 					keyp, ptrp,
1290 				    int level, __u64 *keyp, __u64 *ptrp)
1295 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1322 				     int level, __u64 *keyp, __u64 *ptrp)
1327 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1355 				    int level, __u64 *keyp, __u64 *ptrp)
1360 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1381 				     int level, __u64 *keyp, __u64 *ptrp)
1386 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1406 			       int level, __u64 *keyp, __u64 *ptrp)
1411 	nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1430 			    int level, __u64 *keyp, __u64 *ptrp)