Lines Matching defs:ptrp
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;
810 int level, __u64 *keyp, __u64 *ptrp)
819 *keyp, *ptrp, ncblk);
830 *keyp, *ptrp,
837 int level, __u64 *keyp, __u64 *ptrp)
878 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
883 int level, __u64 *keyp, __u64 *ptrp)
925 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
930 int level, __u64 *keyp, __u64 *ptrp)
957 *keyp, *ptrp, ncblk);
960 *ptrp = path[level].bp_newreq.bpr_ptr;
966 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
969 *ptrp = path[level].bp_newreq.bpr_ptr;
980 int level, __u64 *keyp, __u64 *ptrp)
1001 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
1004 *ptrp = path[level].bp_newreq.bpr_ptr;
1260 int level, __u64 *keyp, __u64 *ptrp)
1269 keyp, ptrp, ncblk);
1278 keyp, ptrp,
1285 int level, __u64 *keyp, __u64 *ptrp)
1290 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1317 int level, __u64 *keyp, __u64 *ptrp)
1322 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1350 int level, __u64 *keyp, __u64 *ptrp)
1355 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1376 int level, __u64 *keyp, __u64 *ptrp)
1381 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1401 int level, __u64 *keyp, __u64 *ptrp)
1406 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1425 int level, __u64 *keyp, __u64 *ptrp)