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);
811 int level, __u64 *keyp, __u64 *ptrp)
820 *keyp, *ptrp, ncblk);
831 *keyp, *ptrp,
838 int level, __u64 *keyp, __u64 *ptrp)
879 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
884 int level, __u64 *keyp, __u64 *ptrp)
926 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
931 int level, __u64 *keyp, __u64 *ptrp)
958 *keyp, *ptrp, ncblk);
960 *keyp = nilfs_btree_node_get_key(right, 0);
967 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
969 *keyp = nilfs_btree_node_get_key(right, 0);
981 int level, __u64 *keyp, __u64 *ptrp)
1002 nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
1004 *keyp = nilfs_btree_node_get_key(child, 0);
1261 int level, __u64 *keyp, __u64 *ptrp)
1270 keyp, ptrp, ncblk);
1279 keyp, ptrp,
1286 int level, __u64 *keyp, __u64 *ptrp)
1291 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1318 int level, __u64 *keyp, __u64 *ptrp)
1323 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1351 int level, __u64 *keyp, __u64 *ptrp)
1356 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1377 int level, __u64 *keyp, __u64 *ptrp)
1382 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1402 int level, __u64 *keyp, __u64 *ptrp)
1407 nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
1426 int level, __u64 *keyp, __u64 *ptrp)
1612 __u64 *keyp)
1624 *keyp = start;
1626 ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp);
1632 static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp)
1641 ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL);