1 // SPDX-License-Identifier: GPL-2.0
5 #include "bkey_methods.h"
12 #define EBUG_ON(cond) BUG_ON(cond)
17 const struct bkey_format bch2_bkey_format_current = BKEY_FORMAT_CURRENT;
19 struct bkey __bch2_bkey_unpack_key(const struct bkey_format *,
20 const struct bkey_packed *);
22 void bch2_to_binary(char *out, const u64 *p, unsigned nr_bits)
24 unsigned bit = high_bit_offset, done = 0;
28 if (done && !(done % 8))
30 *out++ = *p & (1ULL << (63 - bit)) ? '1' : '0';
33 if (done == nr_bits) {
44 #ifdef CONFIG_BCACHEFS_DEBUG
46 static void bch2_bkey_pack_verify(const struct bkey_packed *packed,
47 const struct bkey *unpacked,
48 const struct bkey_format *format)
52 BUG_ON(bkeyp_val_u64s(format, packed) !=
53 bkey_val_u64s(unpacked));
55 BUG_ON(packed->u64s < bkeyp_key_u64s(format, packed));
57 tmp = __bch2_bkey_unpack_key(format, packed);
59 if (memcmp(&tmp, unpacked, sizeof(struct bkey))) {
60 char buf1[160], buf2[160];
61 char buf3[160], buf4[160];
63 bch2_bkey_to_text(&PBUF(buf1), unpacked);
64 bch2_bkey_to_text(&PBUF(buf2), &tmp);
65 bch2_to_binary(buf3, (void *) unpacked, 80);
66 bch2_to_binary(buf4, high_word(format, packed), 80);
68 panic("keys differ: format u64s %u fields %u %u %u %u %u\n%s\n%s\n%s\n%s\n",
70 format->bits_per_field[0],
71 format->bits_per_field[1],
72 format->bits_per_field[2],
73 format->bits_per_field[3],
74 format->bits_per_field[4],
75 buf1, buf2, buf3, buf4);
80 static inline void bch2_bkey_pack_verify(const struct bkey_packed *packed,
81 const struct bkey *unpacked,
82 const struct bkey_format *format) {}
86 const struct bkey_format *format;
87 unsigned bits; /* bits remaining in current word */
88 u64 w; /* current word */
89 u64 *p; /* pointer to next word */
93 static struct pack_state pack_state_init(const struct bkey_format *format,
94 struct bkey_packed *k)
96 u64 *p = high_word(format, k);
98 return (struct pack_state) {
100 .bits = 64 - high_bit_offset,
107 static void pack_state_finish(struct pack_state *state,
108 struct bkey_packed *k)
110 EBUG_ON(state->p < k->_data);
111 EBUG_ON(state->p >= k->_data + state->format->key_u64s);
113 *state->p = state->w;
116 struct unpack_state {
117 const struct bkey_format *format;
118 unsigned bits; /* bits remaining in current word */
119 u64 w; /* current word */
120 const u64 *p; /* pointer to next word */
124 static struct unpack_state unpack_state_init(const struct bkey_format *format,
125 const struct bkey_packed *k)
127 const u64 *p = high_word(format, k);
129 return (struct unpack_state) {
131 .bits = 64 - high_bit_offset,
132 .w = *p << high_bit_offset,
138 static u64 get_inc_field(struct unpack_state *state, unsigned field)
140 unsigned bits = state->format->bits_per_field[field];
141 u64 v = 0, offset = le64_to_cpu(state->format->field_offset[field]);
143 if (bits >= state->bits) {
144 v = state->w >> (64 - bits);
147 state->p = next_word(state->p);
148 state->w = *state->p;
152 /* avoid shift by 64 if bits is 0 - bits is never 64 here: */
153 v |= (state->w >> 1) >> (63 - bits);
161 static bool set_inc_field(struct pack_state *state, unsigned field, u64 v)
163 unsigned bits = state->format->bits_per_field[field];
164 u64 offset = le64_to_cpu(state->format->field_offset[field]);
174 if (bits > state->bits) {
176 /* avoid shift by 64 if bits is 0 - bits is never 64 here: */
177 state->w |= (v >> 1) >> (bits - 1);
179 *state->p = state->w;
180 state->p = next_word(state->p);
186 state->w |= v << state->bits;
192 * Note: does NOT set out->format (we don't know what it should be here!)
194 * Also: doesn't work on extents - it doesn't preserve the invariant that
195 * if k is packed bkey_start_pos(k) will successfully pack
197 static bool bch2_bkey_transform_key(const struct bkey_format *out_f,
198 struct bkey_packed *out,
199 const struct bkey_format *in_f,
200 const struct bkey_packed *in)
202 struct pack_state out_s = pack_state_init(out_f, out);
203 struct unpack_state in_s = unpack_state_init(in_f, in);
208 for (i = 0; i < BKEY_NR_FIELDS; i++)
209 if (!set_inc_field(&out_s, i, get_inc_field(&in_s, i)))
212 /* Can't happen because the val would be too big to unpack: */
213 EBUG_ON(in->u64s - in_f->key_u64s + out_f->key_u64s > U8_MAX);
215 pack_state_finish(&out_s, out);
216 out->u64s = out_f->key_u64s + in->u64s - in_f->key_u64s;
217 out->needs_whiteout = in->needs_whiteout;
218 out->type = in->type;
223 bool bch2_bkey_transform(const struct bkey_format *out_f,
224 struct bkey_packed *out,
225 const struct bkey_format *in_f,
226 const struct bkey_packed *in)
228 if (!bch2_bkey_transform_key(out_f, out, in_f, in))
231 memcpy_u64s((u64 *) out + out_f->key_u64s,
232 (u64 *) in + in_f->key_u64s,
233 (in->u64s - in_f->key_u64s));
237 #define bkey_fields() \
238 x(BKEY_FIELD_INODE, p.inode) \
239 x(BKEY_FIELD_OFFSET, p.offset) \
240 x(BKEY_FIELD_SNAPSHOT, p.snapshot) \
241 x(BKEY_FIELD_SIZE, size) \
242 x(BKEY_FIELD_VERSION_HI, version.hi) \
243 x(BKEY_FIELD_VERSION_LO, version.lo)
245 struct bkey __bch2_bkey_unpack_key(const struct bkey_format *format,
246 const struct bkey_packed *in)
248 struct unpack_state state = unpack_state_init(format, in);
251 EBUG_ON(format->nr_fields != BKEY_NR_FIELDS);
252 EBUG_ON(in->u64s < format->key_u64s);
253 EBUG_ON(in->format != KEY_FORMAT_LOCAL_BTREE);
254 EBUG_ON(in->u64s - format->key_u64s + BKEY_U64s > U8_MAX);
256 out.u64s = BKEY_U64s + in->u64s - format->key_u64s;
257 out.format = KEY_FORMAT_CURRENT;
258 out.needs_whiteout = in->needs_whiteout;
262 #define x(id, field) out.field = get_inc_field(&state, id);
269 #ifndef HAVE_BCACHEFS_COMPILED_UNPACK
270 struct bpos __bkey_unpack_pos(const struct bkey_format *format,
271 const struct bkey_packed *in)
273 struct unpack_state state = unpack_state_init(format, in);
276 EBUG_ON(format->nr_fields != BKEY_NR_FIELDS);
277 EBUG_ON(in->u64s < format->key_u64s);
278 EBUG_ON(in->format != KEY_FORMAT_LOCAL_BTREE);
280 out.inode = get_inc_field(&state, BKEY_FIELD_INODE);
281 out.offset = get_inc_field(&state, BKEY_FIELD_OFFSET);
282 out.snapshot = get_inc_field(&state, BKEY_FIELD_SNAPSHOT);
289 * bch2_bkey_pack_key -- pack just the key, not the value
291 bool bch2_bkey_pack_key(struct bkey_packed *out, const struct bkey *in,
292 const struct bkey_format *format)
294 struct pack_state state = pack_state_init(format, out);
296 EBUG_ON((void *) in == (void *) out);
297 EBUG_ON(format->nr_fields != BKEY_NR_FIELDS);
298 EBUG_ON(in->format != KEY_FORMAT_CURRENT);
302 #define x(id, field) if (!set_inc_field(&state, id, in->field)) return false;
307 * Extents - we have to guarantee that if an extent is packed, a trimmed
308 * version will also pack:
310 if (bkey_start_offset(in) <
311 le64_to_cpu(format->field_offset[BKEY_FIELD_OFFSET]))
314 pack_state_finish(&state, out);
315 out->u64s = format->key_u64s + in->u64s - BKEY_U64s;
316 out->format = KEY_FORMAT_LOCAL_BTREE;
317 out->needs_whiteout = in->needs_whiteout;
318 out->type = in->type;
320 bch2_bkey_pack_verify(out, in, format);
325 * bch2_bkey_unpack -- unpack the key and the value
327 void bch2_bkey_unpack(const struct btree *b, struct bkey_i *dst,
328 const struct bkey_packed *src)
330 __bkey_unpack_key(b, &dst->k, src);
333 bkeyp_val(&b->format, src),
334 bkeyp_val_u64s(&b->format, src));
338 * bch2_bkey_pack -- pack the key and the value
340 bool bch2_bkey_pack(struct bkey_packed *out, const struct bkey_i *in,
341 const struct bkey_format *format)
343 struct bkey_packed tmp;
345 if (!bch2_bkey_pack_key(&tmp, &in->k, format))
348 memmove_u64s((u64 *) out + format->key_u64s,
350 bkey_val_u64s(&in->k));
351 memcpy_u64s(out, &tmp, format->key_u64s);
357 static bool set_inc_field_lossy(struct pack_state *state, unsigned field, u64 v)
359 unsigned bits = state->format->bits_per_field[field];
360 u64 offset = le64_to_cpu(state->format->field_offset[field]);
366 if (fls64(v) > bits) {
367 v = ~(~0ULL << bits);
371 if (bits > state->bits) {
373 state->w |= (v >> 1) >> (bits - 1);
375 *state->p = state->w;
376 state->p = next_word(state->p);
382 state->w |= v << state->bits;
387 #ifdef CONFIG_BCACHEFS_DEBUG
388 static bool bkey_packed_successor(struct bkey_packed *out,
389 const struct btree *b,
390 struct bkey_packed k)
392 const struct bkey_format *f = &b->format;
393 unsigned nr_key_bits = b->nr_key_bits;
394 unsigned first_bit, offset;
397 EBUG_ON(b->nr_key_bits != bkey_format_key_bits(f));
404 first_bit = high_bit_offset + nr_key_bits - 1;
405 p = nth_word(high_word(f, out), first_bit >> 6);
406 offset = 63 - (first_bit & 63);
408 while (nr_key_bits) {
409 unsigned bits = min(64 - offset, nr_key_bits);
410 u64 mask = (~0ULL >> (64 - bits)) << offset;
412 if ((*p & mask) != mask) {
413 *p += 1ULL << offset;
414 EBUG_ON(bkey_cmp_packed(b, out, &k) <= 0);
429 * Returns a packed key that compares <= in
431 * This is used in bset_search_tree(), where we need a packed pos in order to be
432 * able to compare against the keys in the auxiliary search tree - and it's
433 * legal to use a packed pos that isn't equivalent to the original pos,
434 * _provided_ it compares <= to the original pos.
436 enum bkey_pack_pos_ret bch2_bkey_pack_pos_lossy(struct bkey_packed *out,
438 const struct btree *b)
440 const struct bkey_format *f = &b->format;
441 struct pack_state state = pack_state_init(f, out);
442 #ifdef CONFIG_BCACHEFS_DEBUG
443 struct bpos orig = in;
449 if (unlikely(in.snapshot <
450 le64_to_cpu(f->field_offset[BKEY_FIELD_SNAPSHOT]))) {
453 return BKEY_PACK_POS_FAIL;
454 in.snapshot = KEY_SNAPSHOT_MAX;
458 if (unlikely(in.offset <
459 le64_to_cpu(f->field_offset[BKEY_FIELD_OFFSET]))) {
461 return BKEY_PACK_POS_FAIL;
462 in.offset = KEY_OFFSET_MAX;
463 in.snapshot = KEY_SNAPSHOT_MAX;
467 if (unlikely(in.inode <
468 le64_to_cpu(f->field_offset[BKEY_FIELD_INODE])))
469 return BKEY_PACK_POS_FAIL;
471 if (!set_inc_field_lossy(&state, BKEY_FIELD_INODE, in.inode)) {
472 in.offset = KEY_OFFSET_MAX;
473 in.snapshot = KEY_SNAPSHOT_MAX;
477 if (!set_inc_field_lossy(&state, BKEY_FIELD_OFFSET, in.offset)) {
478 in.snapshot = KEY_SNAPSHOT_MAX;
482 if (!set_inc_field_lossy(&state, BKEY_FIELD_SNAPSHOT, in.snapshot))
485 pack_state_finish(&state, out);
486 out->u64s = f->key_u64s;
487 out->format = KEY_FORMAT_LOCAL_BTREE;
488 out->type = KEY_TYPE_deleted;
490 #ifdef CONFIG_BCACHEFS_DEBUG
492 BUG_ON(bkey_cmp_left_packed(b, out, &orig));
494 struct bkey_packed successor;
496 BUG_ON(bkey_cmp_left_packed(b, out, &orig) >= 0);
497 BUG_ON(bkey_packed_successor(&successor, b, *out) &&
498 bkey_cmp_left_packed(b, &successor, &orig) < 0);
502 return exact ? BKEY_PACK_POS_EXACT : BKEY_PACK_POS_SMALLER;
505 void bch2_bkey_format_init(struct bkey_format_state *s)
509 for (i = 0; i < ARRAY_SIZE(s->field_min); i++)
510 s->field_min[i] = U64_MAX;
512 for (i = 0; i < ARRAY_SIZE(s->field_max); i++)
515 /* Make sure we can store a size of 0: */
516 s->field_min[BKEY_FIELD_SIZE] = 0;
519 static void __bkey_format_add(struct bkey_format_state *s,
520 unsigned field, u64 v)
522 s->field_min[field] = min(s->field_min[field], v);
523 s->field_max[field] = max(s->field_max[field], v);
527 * Changes @format so that @k can be successfully packed with @format
529 void bch2_bkey_format_add_key(struct bkey_format_state *s, const struct bkey *k)
531 #define x(id, field) __bkey_format_add(s, id, k->field);
534 __bkey_format_add(s, BKEY_FIELD_OFFSET, bkey_start_offset(k));
537 void bch2_bkey_format_add_pos(struct bkey_format_state *s, struct bpos p)
541 __bkey_format_add(s, field++, p.inode);
542 __bkey_format_add(s, field++, p.offset);
543 __bkey_format_add(s, field++, p.snapshot);
547 * We don't want it to be possible for the packed format to represent fields
548 * bigger than a u64... that will cause confusion and issues (like with
549 * bkey_packed_successor())
551 static void set_format_field(struct bkey_format *f, enum bch_bkey_fields i,
552 unsigned bits, u64 offset)
554 offset = bits == 64 ? 0 : min(offset, U64_MAX - ((1ULL << bits) - 1));
556 f->bits_per_field[i] = bits;
557 f->field_offset[i] = cpu_to_le64(offset);
560 struct bkey_format bch2_bkey_format_done(struct bkey_format_state *s)
562 unsigned i, bits = KEY_PACKED_BITS_START;
563 struct bkey_format ret = {
564 .nr_fields = BKEY_NR_FIELDS,
567 for (i = 0; i < ARRAY_SIZE(s->field_min); i++) {
568 s->field_min[i] = min(s->field_min[i], s->field_max[i]);
570 set_format_field(&ret, i,
571 fls64(s->field_max[i] - s->field_min[i]),
574 bits += ret.bits_per_field[i];
577 /* allow for extent merging: */
578 if (ret.bits_per_field[BKEY_FIELD_SIZE]) {
579 ret.bits_per_field[BKEY_FIELD_SIZE] += 4;
583 ret.key_u64s = DIV_ROUND_UP(bits, 64);
585 /* if we have enough spare bits, round fields up to nearest byte */
586 bits = ret.key_u64s * 64 - bits;
588 for (i = 0; i < ARRAY_SIZE(ret.bits_per_field); i++) {
589 unsigned r = round_up(ret.bits_per_field[i], 8) -
590 ret.bits_per_field[i];
593 set_format_field(&ret, i,
594 ret.bits_per_field[i] + r,
595 le64_to_cpu(ret.field_offset[i]));
600 EBUG_ON(bch2_bkey_format_validate(&ret));
604 const char *bch2_bkey_format_validate(struct bkey_format *f)
606 unsigned i, bits = KEY_PACKED_BITS_START;
608 if (f->nr_fields != BKEY_NR_FIELDS)
609 return "incorrect number of fields";
611 for (i = 0; i < f->nr_fields; i++) {
612 u64 field_offset = le64_to_cpu(f->field_offset[i]);
614 if (f->bits_per_field[i] > 64)
615 return "field too large";
618 (f->bits_per_field[i] == 64 ||
619 (field_offset + ((1ULL << f->bits_per_field[i]) - 1) <
621 return "offset + bits overflow";
623 bits += f->bits_per_field[i];
626 if (f->key_u64s != DIV_ROUND_UP(bits, 64))
627 return "incorrect key_u64s";
633 * Most significant differing bit
634 * Bits are indexed from 0 - return is [0, nr_key_bits)
637 unsigned bch2_bkey_greatest_differing_bit(const struct btree *b,
638 const struct bkey_packed *l_k,
639 const struct bkey_packed *r_k)
641 const u64 *l = high_word(&b->format, l_k);
642 const u64 *r = high_word(&b->format, r_k);
643 unsigned nr_key_bits = b->nr_key_bits;
644 unsigned word_bits = 64 - high_bit_offset;
647 EBUG_ON(b->nr_key_bits != bkey_format_key_bits(&b->format));
649 /* for big endian, skip past header */
650 l_v = *l & (~0ULL >> high_bit_offset);
651 r_v = *r & (~0ULL >> high_bit_offset);
653 while (nr_key_bits) {
654 if (nr_key_bits < word_bits) {
655 l_v >>= word_bits - nr_key_bits;
656 r_v >>= word_bits - nr_key_bits;
659 nr_key_bits -= word_bits;
663 return fls64(l_v ^ r_v) - 1 + nr_key_bits;
678 * Bits are indexed from 0 - return is [0, nr_key_bits)
681 unsigned bch2_bkey_ffs(const struct btree *b, const struct bkey_packed *k)
683 const u64 *p = high_word(&b->format, k);
684 unsigned nr_key_bits = b->nr_key_bits;
685 unsigned ret = 0, offset;
687 EBUG_ON(b->nr_key_bits != bkey_format_key_bits(&b->format));
689 offset = nr_key_bits;
690 while (offset > 64) {
695 offset = 64 - offset;
697 while (nr_key_bits) {
698 unsigned bits = nr_key_bits + offset < 64
702 u64 mask = (~0ULL >> (64 - bits)) << offset;
705 return ret + __ffs64(*p & mask) - offset;
718 static inline int __bkey_cmp_bits(const u64 *l, const u64 *r,
719 unsigned nr_key_bits)
724 /* we shouldn't need asm for this, but gcc is being retarded: */
726 asm(".intel_syntax noprefix;"
738 "lea rdi, [rdi - 8];"
739 "lea rsi, [rsi - 8];"
754 ".att_syntax prefix;"
755 : "=&D" (d0), "=&S" (d1), "=&d" (d2), "=&c" (d3), "=&a" (cmp)
756 : "0" (l), "1" (r), "3" (nr_key_bits)
757 : "r8", "r9", "cc", "memory");
762 #define I(_x) (*(out)++ = (_x))
764 #define I2(i0, i1) (I1(i0), I(i1))
765 #define I3(i0, i1, i2) (I2(i0, i1), I(i2))
766 #define I4(i0, i1, i2, i3) (I3(i0, i1, i2), I(i3))
767 #define I5(i0, i1, i2, i3, i4) (I4(i0, i1, i2, i3), I(i4))
769 static u8 *compile_bkey_field(const struct bkey_format *format, u8 *out,
770 enum bch_bkey_fields field,
771 unsigned dst_offset, unsigned dst_size,
774 unsigned bits = format->bits_per_field[field];
775 u64 offset = le64_to_cpu(format->field_offset[field]);
776 unsigned i, byte, bit_offset, align, shl, shr;
778 if (!bits && !offset) {
789 /* just return offset: */
793 if (offset > S32_MAX) {
794 /* mov [rdi + dst_offset], offset */
795 I3(0xc7, 0x47, dst_offset);
796 memcpy(out, &offset, 4);
799 I3(0xc7, 0x47, dst_offset + 4);
800 memcpy(out, (void *) &offset + 4, 4);
803 /* mov [rdi + dst_offset], offset */
805 I4(0x48, 0xc7, 0x47, dst_offset);
806 memcpy(out, &offset, 4);
811 /* mov [rdi + dst_offset], offset */
812 I3(0xc7, 0x47, dst_offset);
813 memcpy(out, &offset, 4);
823 bit_offset = format->key_u64s * 64;
824 for (i = 0; i <= field; i++)
825 bit_offset -= format->bits_per_field[i];
827 byte = bit_offset / 8;
828 bit_offset -= byte * 8;
832 if (bit_offset == 0 && bits == 8) {
833 /* movzx eax, BYTE PTR [rsi + imm8] */
834 I4(0x0f, 0xb6, 0x46, byte);
835 } else if (bit_offset == 0 && bits == 16) {
836 /* movzx eax, WORD PTR [rsi + imm8] */
837 I4(0x0f, 0xb7, 0x46, byte);
838 } else if (bit_offset + bits <= 32) {
839 align = min(4 - DIV_ROUND_UP(bit_offset + bits, 8), byte & 3);
841 bit_offset += align * 8;
843 BUG_ON(bit_offset + bits > 32);
845 /* mov eax, [rsi + imm8] */
846 I3(0x8b, 0x46, byte);
850 I3(0xc1, 0xe8, bit_offset);
853 if (bit_offset + bits < 32) {
854 unsigned mask = ~0U >> (32 - bits);
858 memcpy(out, &mask, 4);
861 } else if (bit_offset + bits <= 64) {
862 align = min(8 - DIV_ROUND_UP(bit_offset + bits, 8), byte & 7);
864 bit_offset += align * 8;
866 BUG_ON(bit_offset + bits > 64);
868 /* mov rax, [rsi + imm8] */
869 I4(0x48, 0x8b, 0x46, byte);
871 shl = 64 - bit_offset - bits;
872 shr = bit_offset + shl;
876 I4(0x48, 0xc1, 0xe0, shl);
881 I4(0x48, 0xc1, 0xe8, shr);
884 align = min(4 - DIV_ROUND_UP(bit_offset + bits, 8), byte & 3);
886 bit_offset += align * 8;
888 BUG_ON(bit_offset + bits > 96);
890 /* mov rax, [rsi + byte] */
891 I4(0x48, 0x8b, 0x46, byte);
893 /* mov edx, [rsi + byte + 8] */
894 I3(0x8b, 0x56, byte + 8);
896 /* bits from next word: */
897 shr = bit_offset + bits - 64;
898 BUG_ON(shr > bit_offset);
900 /* shr rax, bit_offset */
901 I4(0x48, 0xc1, 0xe8, shr);
904 I4(0x48, 0xc1, 0xe2, 64 - shr);
907 I3(0x48, 0x09, 0xd0);
909 shr = bit_offset - shr;
913 I4(0x48, 0xc1, 0xe8, shr);
918 if (offset > S32_MAX) {
921 memcpy(out, &offset, 8);
924 I3(0x48, 0x01, 0xd0);
925 } else if (offset + (~0ULL >> (64 - bits)) > U32_MAX) {
928 memcpy(out, &offset, 4);
933 memcpy(out, &offset, 4);
939 /* mov [rdi + dst_offset], rax */
940 I4(0x48, 0x89, 0x47, dst_offset);
943 /* mov [rdi + dst_offset], eax */
944 I3(0x89, 0x47, dst_offset);
953 int bch2_compile_bkey_format(const struct bkey_format *format, void *_out)
955 bool eax_zeroed = false;
959 * rdi: dst - unpacked key
960 * rsi: src - packed key
963 /* k->u64s, k->format, k->type */
968 /* add eax, BKEY_U64s - format->key_u64s */
969 I5(0x05, BKEY_U64s - format->key_u64s, KEY_FORMAT_CURRENT, 0, 0);
971 /* and eax, imm32: mask out k->pad: */
972 I5(0x25, 0xff, 0xff, 0xff, 0);
977 #define x(id, field) \
978 out = compile_bkey_field(format, out, id, \
979 offsetof(struct bkey, field), \
980 sizeof(((struct bkey *) NULL)->field), \
988 return (void *) out - _out;
992 static inline int __bkey_cmp_bits(const u64 *l, const u64 *r,
993 unsigned nr_key_bits)
1000 /* for big endian, skip past header */
1001 nr_key_bits += high_bit_offset;
1002 l_v = *l & (~0ULL >> high_bit_offset);
1003 r_v = *r & (~0ULL >> high_bit_offset);
1006 if (nr_key_bits < 64) {
1007 l_v >>= 64 - nr_key_bits;
1008 r_v >>= 64 - nr_key_bits;
1014 if (!nr_key_bits || l_v != r_v)
1024 return cmp_int(l_v, r_v);
1029 int __bch2_bkey_cmp_packed_format_checked(const struct bkey_packed *l,
1030 const struct bkey_packed *r,
1031 const struct btree *b)
1033 const struct bkey_format *f = &b->format;
1036 EBUG_ON(!bkey_packed(l) || !bkey_packed(r));
1037 EBUG_ON(b->nr_key_bits != bkey_format_key_bits(f));
1039 ret = __bkey_cmp_bits(high_word(f, l),
1043 EBUG_ON(ret != bkey_cmp(bkey_unpack_pos(b, l),
1044 bkey_unpack_pos(b, r)));
1049 int __bch2_bkey_cmp_left_packed_format_checked(const struct btree *b,
1050 const struct bkey_packed *l,
1051 const struct bpos *r)
1053 return bkey_cmp(bkey_unpack_pos_format_checked(b, l), *r);
1057 int __bch2_bkey_cmp_packed(const struct bkey_packed *l,
1058 const struct bkey_packed *r,
1059 const struct btree *b)
1061 int packed = bkey_lr_packed(l, r);
1063 if (likely(packed == BKEY_PACKED_BOTH))
1064 return __bch2_bkey_cmp_packed_format_checked(l, r, b);
1067 case BKEY_PACKED_NONE:
1068 return bkey_cmp(((struct bkey *) l)->p,
1069 ((struct bkey *) r)->p);
1070 case BKEY_PACKED_LEFT:
1071 return __bch2_bkey_cmp_left_packed_format_checked(b,
1072 (struct bkey_packed *) l,
1073 &((struct bkey *) r)->p);
1074 case BKEY_PACKED_RIGHT:
1075 return -__bch2_bkey_cmp_left_packed_format_checked(b,
1076 (struct bkey_packed *) r,
1077 &((struct bkey *) l)->p);
1084 int __bch2_bkey_cmp_left_packed(const struct btree *b,
1085 const struct bkey_packed *l,
1086 const struct bpos *r)
1088 const struct bkey *l_unpacked;
1090 return unlikely(l_unpacked = packed_to_bkey_c(l))
1091 ? bkey_cmp(l_unpacked->p, *r)
1092 : __bch2_bkey_cmp_left_packed_format_checked(b, l, r);
1095 void bch2_bpos_swab(struct bpos *p)
1098 u8 *h = ((u8 *) &p[1]) - 1;
1107 void bch2_bkey_swab_key(const struct bkey_format *_f, struct bkey_packed *k)
1109 const struct bkey_format *f = bkey_packed(k) ? _f : &bch2_bkey_format_current;
1110 u8 *l = k->key_start;
1111 u8 *h = (u8 *) (k->_data + f->key_u64s) - 1;
1120 #ifdef CONFIG_BCACHEFS_DEBUG
1121 void bch2_bkey_pack_test(void)
1123 struct bkey t = KEY(4134ULL, 1250629070527416633ULL, 0);
1124 struct bkey_packed p;
1126 struct bkey_format test_format = {
1128 .nr_fields = BKEY_NR_FIELDS,
1135 struct unpack_state in_s =
1136 unpack_state_init(&bch2_bkey_format_current, (void *) &t);
1137 struct pack_state out_s = pack_state_init(&test_format, &p);
1140 for (i = 0; i < out_s.format->nr_fields; i++) {
1141 u64 a, v = get_inc_field(&in_s, i);
1144 #define x(id, field) case id: a = t.field; break;
1152 panic("got %llu actual %llu i %u\n", v, a, i);
1154 if (!set_inc_field(&out_s, i, v))
1155 panic("failed at %u\n", i);
1158 BUG_ON(!bch2_bkey_pack_key(&p, &t, &test_format));