Lines Matching defs:key1
182 * Compare key1 and key2 -- positive if key1 > key2, negative if
183 * key1 < key2, and zero if equal. If the @mask parameter is non NULL,
188 const union xfs_btree_key *key1,
207 * Given two btree keys @key1 and @key2, decide if it is impossible for
209 * @key1 < K < @key2. To determine if two btree records are
210 * immediately adjacent, @key1 should be the high key of the first
216 const union xfs_btree_key *key1,
533 const union xfs_btree_key *key1,
549 const union xfs_btree_key *key1,
552 return cur->bc_ops->cmp_two_keys(cur, key1, key2, NULL) < 0;
558 const union xfs_btree_key *key1,
561 return cur->bc_ops->cmp_two_keys(cur, key1, key2, NULL) > 0;
567 const union xfs_btree_key *key1,
570 return cur->bc_ops->cmp_two_keys(cur, key1, key2, NULL) == 0;
576 const union xfs_btree_key *key1,
579 return !xfs_btree_keycmp_gt(cur, key1, key2);
585 const union xfs_btree_key *key1,
588 return !xfs_btree_keycmp_lt(cur, key1, key2);
594 const union xfs_btree_key *key1,
597 return !xfs_btree_keycmp_eq(cur, key1, key2);
604 const union xfs_btree_key *key1,
608 return cur->bc_ops->cmp_two_keys(cur, key1, key2, mask) < 0;
614 const union xfs_btree_key *key1,
618 return cur->bc_ops->cmp_two_keys(cur, key1, key2, mask) > 0;
624 const union xfs_btree_key *key1,
628 return !xfs_btree_masked_keycmp_lt(cur, key1, key2, mask);