Home
last modified time | relevance | path

Searched refs:diff_two_keys (Results 1 - 15 of 15) sorted by relevance

/kernel/linux/linux-6.6/fs/xfs/libxfs/
H A Dxfs_btree.h168 int64_t (*diff_two_keys)(struct xfs_btree_cur *cur, member
603 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) < 0; in xfs_btree_keycmp_lt()
612 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) > 0; in xfs_btree_keycmp_gt()
621 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) == 0; in xfs_btree_keycmp_eq()
659 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) < 0; in xfs_btree_masked_keycmp_lt()
669 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) > 0; in xfs_btree_masked_keycmp_gt()
H A Dxfs_ialloc_btree.c417 .diff_two_keys = xfs_inobt_diff_two_keys,
439 .diff_two_keys = xfs_inobt_diff_two_keys,
H A Dxfs_alloc_btree.c463 .diff_two_keys = xfs_bnobt_diff_two_keys,
486 .diff_two_keys = xfs_cntbt_diff_two_keys,
H A Dxfs_refcount_btree.c329 .diff_two_keys = xfs_refcountbt_diff_two_keys,
H A Dxfs_rmap_btree.c495 .diff_two_keys = xfs_rmapbt_diff_two_keys,
H A Dxfs_bmap_btree.c539 .diff_two_keys = xfs_bmbt_diff_two_keys,
H A Dxfs_btree.c4723 ASSERT(cur->bc_ops->diff_two_keys); in xfs_btree_simple_query_range()
/kernel/linux/linux-5.10/fs/xfs/scrub/
H A Dbtree.c155 if (cur->bc_ops->diff_two_keys(cur, &key, keyp) < 0) in xchk_btree_rec()
164 if (cur->bc_ops->diff_two_keys(cur, keyp, &hkey) < 0) in xchk_btree_rec()
202 if (cur->bc_ops->diff_two_keys(cur, key, keyp) < 0) in xchk_btree_key()
211 if (cur->bc_ops->diff_two_keys(cur, keyp, key) < 0) in xchk_btree_key()
575 if (cur->bc_ops->diff_two_keys(cur, &block_keys, parent_keys) != 0) in xchk_btree_block_keys()
586 if (cur->bc_ops->diff_two_keys(cur, high_bk, high_pk) != 0) in xchk_btree_block_keys()
/kernel/linux/linux-5.10/fs/xfs/libxfs/
H A Dxfs_btree.c1998 if (cur->bc_ops->diff_two_keys(cur, &hkey, &max_hkey) in xfs_btree_get_leaf_keys()
2027 if (cur->bc_ops->diff_two_keys(cur, hkey, max_hkey) > 0) in xfs_btree_get_node_keys()
2114 !(cur->bc_ops->diff_two_keys(cur, nlkey, lkey) != 0 || in __xfs_btree_updkeys()
2115 cur->bc_ops->diff_two_keys(cur, nhkey, hkey) != 0)) in __xfs_btree_updkeys()
4557 ASSERT(cur->bc_ops->diff_two_keys); in xfs_btree_simple_query_range()
4585 diff = cur->bc_ops->diff_two_keys(cur, low_key, in xfs_btree_simple_query_range()
4593 diff = cur->bc_ops->diff_two_keys(cur, &rec_key, high_key); in xfs_btree_simple_query_range()
4687 ldiff = cur->bc_ops->diff_two_keys(cur, &rec_hkey, in xfs_btree_overlapped_query_range()
4691 hdiff = cur->bc_ops->diff_two_keys(cur, high_key, in xfs_btree_overlapped_query_range()
4716 ldiff = cur->bc_ops->diff_two_keys(cu in xfs_btree_overlapped_query_range()
[all...]
H A Dxfs_alloc_btree.c444 .diff_two_keys = xfs_bnobt_diff_two_keys,
466 .diff_two_keys = xfs_cntbt_diff_two_keys,
H A Dxfs_ialloc_btree.c397 .diff_two_keys = xfs_inobt_diff_two_keys,
418 .diff_two_keys = xfs_inobt_diff_two_keys,
H A Dxfs_btree.h148 int64_t (*diff_two_keys)(struct xfs_btree_cur *cur, member
H A Dxfs_rmap_btree.c446 .diff_two_keys = xfs_rmapbt_diff_two_keys,
H A Dxfs_refcount_btree.c307 .diff_two_keys = xfs_refcountbt_diff_two_keys,
H A Dxfs_bmap_btree.c535 .diff_two_keys = xfs_bmbt_diff_two_keys,

Completed in 23 milliseconds