Lines Matching defs:ptrp
273 __u64 *keyp, __u64 *ptrp, int ncmax)
288 if (ptrp != NULL)
289 *ptrp = ptr;
507 __u64 key, __u64 *ptrp, int minlevel,
561 if (ptrp != NULL)
562 *ptrp = ptr;
569 __u64 *keyp, __u64 *ptrp)
600 if (ptrp != NULL)
601 *ptrp = ptr;
607 __u64 key, int level, __u64 *ptrp)
616 ret = nilfs_btree_do_lookup(btree, path, key, ptrp, level, 0);
624 __u64 key, __u64 *ptrp, unsigned maxblocks)
700 *ptrp = ptr;
731 int level, __u64 *keyp, __u64 *ptrp)
740 *keyp, *ptrp, ncblk);
751 *keyp, *ptrp,
758 int level, __u64 *keyp, __u64 *ptrp)
799 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
804 int level, __u64 *keyp, __u64 *ptrp)
846 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
851 int level, __u64 *keyp, __u64 *ptrp)
883 *keyp, *ptrp, ncblk);
886 *ptrp = path[level].bp_newreq.bpr_ptr;
892 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
895 *ptrp = path[level].bp_newreq.bpr_ptr;
906 int level, __u64 *keyp, __u64 *ptrp)
927 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
930 *ptrp = path[level].bp_newreq.bpr_ptr;
1186 int level, __u64 *keyp, __u64 *ptrp)
1195 keyp, ptrp, ncblk);
1204 keyp, ptrp,
1211 int level, __u64 *keyp, __u64 *ptrp)
1216 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1243 int level, __u64 *keyp, __u64 *ptrp)
1248 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1276 int level, __u64 *keyp, __u64 *ptrp)
1281 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1302 int level, __u64 *keyp, __u64 *ptrp)
1307 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1327 int level, __u64 *keyp, __u64 *ptrp)
1332 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);