Lines Matching refs:keyp
263 __u64 *keyp, __u64 *ptrp, int ncmax)
276 if (keyp != NULL)
277 *keyp = key;
610 __u64 *keyp, __u64 *ptrp)
639 if (keyp != NULL)
640 *keyp = nilfs_btree_node_get_key(node, index);
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);
959 *keyp = nilfs_btree_node_get_key(right, 0);
966 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
968 *keyp = nilfs_btree_node_get_key(right, 0);
980 int level, __u64 *keyp, __u64 *ptrp)
1001 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
1003 *keyp = nilfs_btree_node_get_key(child, 0);
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)
1611 __u64 *keyp)
1623 *keyp = start;
1625 ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp);
1631 static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp)
1640 ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL);