Lines Matching refs:key1
163 * Difference between key2 and key1 -- positive if key1 > key2,
164 * negative if key1 < key2, and zero if equal. If the @mask parameter
169 const union xfs_btree_key *key1,
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
191 * immediately adjacent, @key1 should be the high key of the first
197 const union xfs_btree_key *key1,
584 const union xfs_btree_key *key1,
600 const union xfs_btree_key *key1,
603 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) < 0;
609 const union xfs_btree_key *key1,
612 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) > 0;
618 const union xfs_btree_key *key1,
621 return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) == 0;
627 const union xfs_btree_key *key1,
630 return !xfs_btree_keycmp_gt(cur, key1, key2);
636 const union xfs_btree_key *key1,
639 return !xfs_btree_keycmp_lt(cur, key1, key2);
645 const union xfs_btree_key *key1,
648 return !xfs_btree_keycmp_eq(cur, key1, key2);
655 const union xfs_btree_key *key1,
659 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) < 0;
665 const union xfs_btree_key *key1,
669 return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) > 0;
675 const union xfs_btree_key *key1,
679 return !xfs_btree_masked_keycmp_lt(cur, key1, key2, mask);