Lines Matching refs:key2
163 * Difference between key2 and key1 -- positive if key1 > key2,
164 * negative if key1 < key2, and zero if equal. If the @mask parameter
170 const union xfs_btree_key *key2,
188 * Given two btree keys @key1 and @key2, decide if it is impossible for
190 * @key1 < K < @key2. To determine if two btree records are
192 * record and @key2 should be the low key of the second record.
198 const union xfs_btree_key *key2,
585 const union xfs_btree_key *key2);
601 const union xfs_btree_key *key2)
603 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) < 0;
610 const union xfs_btree_key *key2)
612 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) > 0;
619 const union xfs_btree_key *key2)
621 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) == 0;
628 const union xfs_btree_key *key2)
630 return !xfs_btree_keycmp_gt(cur, key1, key2);
637 const union xfs_btree_key *key2)
639 return !xfs_btree_keycmp_lt(cur, key1, key2);
646 const union xfs_btree_key *key2)
648 return !xfs_btree_keycmp_eq(cur, key1, key2);
656 const union xfs_btree_key *key2,
659 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) < 0;
666 const union xfs_btree_key *key2,
669 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) > 0;
676 const union xfs_btree_key *key2,
679 return !xfs_btree_masked_keycmp_lt(cur, key1, key2, mask);