Lines Matching refs:keyp
263 __u64 *keyp, __u64 *ptrp, int ncmax) in nilfs_btree_node_delete() argument
276 if (keyp != NULL) in nilfs_btree_node_delete()
277 *keyp = key; in nilfs_btree_node_delete()
610 __u64 *keyp, __u64 *ptrp) in nilfs_btree_do_lookup_last() argument
639 if (keyp != NULL) in nilfs_btree_do_lookup_last()
640 *keyp = nilfs_btree_node_get_key(node, index); in nilfs_btree_do_lookup_last()
810 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_do_insert() argument
819 *keyp, *ptrp, ncblk); in nilfs_btree_do_insert()
830 *keyp, *ptrp, in nilfs_btree_do_insert()
837 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_carry_left() argument
878 nilfs_btree_do_insert(btree, path, level, keyp, ptrp); in nilfs_btree_carry_left()
883 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_carry_right() argument
925 nilfs_btree_do_insert(btree, path, level, keyp, ptrp); in nilfs_btree_carry_right()
930 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_split() argument
957 *keyp, *ptrp, ncblk); in nilfs_btree_split()
959 *keyp = nilfs_btree_node_get_key(right, 0); in nilfs_btree_split()
966 nilfs_btree_do_insert(btree, path, level, keyp, ptrp); in nilfs_btree_split()
968 *keyp = nilfs_btree_node_get_key(right, 0); in nilfs_btree_split()
980 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_grow() argument
1001 nilfs_btree_do_insert(btree, path, level, keyp, ptrp); in nilfs_btree_grow()
1003 *keyp = nilfs_btree_node_get_key(child, 0); in nilfs_btree_grow()
1260 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_do_delete() argument
1269 keyp, ptrp, ncblk); in nilfs_btree_do_delete()
1278 keyp, ptrp, in nilfs_btree_do_delete()
1285 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_borrow_left() argument
1290 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); in nilfs_btree_borrow_left()
1317 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_borrow_right() argument
1322 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); in nilfs_btree_borrow_right()
1350 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_concat_left() argument
1355 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); in nilfs_btree_concat_left()
1376 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_concat_right() argument
1381 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); in nilfs_btree_concat_right()
1401 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_shrink() argument
1406 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); in nilfs_btree_shrink()
1425 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_nop() argument
1611 __u64 *keyp) in nilfs_btree_seek_key() argument
1623 *keyp = start; in nilfs_btree_seek_key()
1625 ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp); in nilfs_btree_seek_key()
1631 static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp) in nilfs_btree_last_key() argument
1640 ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL); in nilfs_btree_last_key()