1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_EXTENTS_H
3 #define _BCACHEFS_EXTENTS_H
7 #include "extents_types.h"
14 #define extent_entry_last(_e) \
15 ((typeof(&(_e).v->start[0])) bkey_val_end(_e))
17 #define entry_to_ptr(_entry) \
19 EBUG_ON((_entry) && !extent_entry_is_ptr(_entry)); \
21 __builtin_choose_expr( \
22 type_is_exact(_entry, const union bch_extent_entry *), \
23 (const struct bch_extent_ptr *) (_entry), \
24 (struct bch_extent_ptr *) (_entry)); \
27 /* downcast, preserves const */
28 #define to_entry(_entry) \
30 BUILD_BUG_ON(!type_is(_entry, union bch_extent_crc *) && \
31 !type_is(_entry, struct bch_extent_ptr *) && \
32 !type_is(_entry, struct bch_extent_stripe_ptr *)); \
34 __builtin_choose_expr( \
35 (type_is_exact(_entry, const union bch_extent_crc *) || \
36 type_is_exact(_entry, const struct bch_extent_ptr *) ||\
37 type_is_exact(_entry, const struct bch_extent_stripe_ptr *)),\
38 (const union bch_extent_entry *) (_entry), \
39 (union bch_extent_entry *) (_entry)); \
42 #define extent_entry_next(_entry) \
43 ((typeof(_entry)) ((void *) (_entry) + extent_entry_bytes(_entry)))
45 static inline unsigned
46 __extent_entry_type(const union bch_extent_entry *e)
48 return e->type ? __ffs(e->type) : BCH_EXTENT_ENTRY_MAX;
51 static inline enum bch_extent_entry_type
52 extent_entry_type(const union bch_extent_entry *e)
54 int ret = __ffs(e->type);
56 EBUG_ON(ret < 0 || ret >= BCH_EXTENT_ENTRY_MAX);
61 static inline size_t extent_entry_bytes(const union bch_extent_entry *entry)
63 switch (extent_entry_type(entry)) {
65 case BCH_EXTENT_ENTRY_##f: \
66 return sizeof(struct bch_extent_##f);
67 BCH_EXTENT_ENTRY_TYPES()
74 static inline size_t extent_entry_u64s(const union bch_extent_entry *entry)
76 return extent_entry_bytes(entry) / sizeof(u64);
79 static inline void __extent_entry_insert(struct bkey_i *k,
80 union bch_extent_entry *dst,
81 union bch_extent_entry *new)
83 union bch_extent_entry *end = bkey_val_end(bkey_i_to_s(k));
85 memmove_u64s_up_small((u64 *) dst + extent_entry_u64s(new),
86 dst, (u64 *) end - (u64 *) dst);
87 k->k.u64s += extent_entry_u64s(new);
88 memcpy_u64s_small(dst, new, extent_entry_u64s(new));
91 static inline bool extent_entry_is_ptr(const union bch_extent_entry *e)
93 return extent_entry_type(e) == BCH_EXTENT_ENTRY_ptr;
96 static inline bool extent_entry_is_stripe_ptr(const union bch_extent_entry *e)
98 return extent_entry_type(e) == BCH_EXTENT_ENTRY_stripe_ptr;
101 static inline bool extent_entry_is_crc(const union bch_extent_entry *e)
103 switch (extent_entry_type(e)) {
104 case BCH_EXTENT_ENTRY_crc32:
105 case BCH_EXTENT_ENTRY_crc64:
106 case BCH_EXTENT_ENTRY_crc128:
113 union bch_extent_crc {
115 struct bch_extent_crc32 crc32;
116 struct bch_extent_crc64 crc64;
117 struct bch_extent_crc128 crc128;
120 #define __entry_to_crc(_entry) \
121 __builtin_choose_expr( \
122 type_is_exact(_entry, const union bch_extent_entry *), \
123 (const union bch_extent_crc *) (_entry), \
124 (union bch_extent_crc *) (_entry))
126 #define entry_to_crc(_entry) \
128 EBUG_ON((_entry) && !extent_entry_is_crc(_entry)); \
130 __entry_to_crc(_entry); \
133 static inline struct bch_extent_crc_unpacked
134 bch2_extent_crc_unpack(const struct bkey *k, const union bch_extent_crc *crc)
136 #define common_fields(_crc) \
137 .csum_type = _crc.csum_type, \
138 .compression_type = _crc.compression_type, \
139 .compressed_size = _crc._compressed_size + 1, \
140 .uncompressed_size = _crc._uncompressed_size + 1, \
141 .offset = _crc.offset, \
145 return (struct bch_extent_crc_unpacked) {
146 .compressed_size = k->size,
147 .uncompressed_size = k->size,
148 .live_size = k->size,
151 switch (extent_entry_type(to_entry(crc))) {
152 case BCH_EXTENT_ENTRY_crc32: {
153 struct bch_extent_crc_unpacked ret = (struct bch_extent_crc_unpacked) {
154 common_fields(crc->crc32),
157 *((__le32 *) &ret.csum.lo) = crc->crc32.csum;
159 memcpy(&ret.csum.lo, &crc->crc32.csum,
160 sizeof(crc->crc32.csum));
164 case BCH_EXTENT_ENTRY_crc64: {
165 struct bch_extent_crc_unpacked ret = (struct bch_extent_crc_unpacked) {
166 common_fields(crc->crc64),
167 .nonce = crc->crc64.nonce,
168 .csum.lo = (__force __le64) crc->crc64.csum_lo,
171 *((__le16 *) &ret.csum.hi) = crc->crc64.csum_hi;
175 case BCH_EXTENT_ENTRY_crc128: {
176 struct bch_extent_crc_unpacked ret = (struct bch_extent_crc_unpacked) {
177 common_fields(crc->crc128),
178 .nonce = crc->crc128.nonce,
179 .csum = crc->crc128.csum,
190 static inline bool crc_is_compressed(struct bch_extent_crc_unpacked crc)
192 return (crc.compression_type != BCH_COMPRESSION_TYPE_none &&
193 crc.compression_type != BCH_COMPRESSION_TYPE_incompressible);
196 /* bkey_ptrs: generically over any key type that has ptrs */
199 const union bch_extent_entry *start;
200 const union bch_extent_entry *end;
204 union bch_extent_entry *start;
205 union bch_extent_entry *end;
208 static inline struct bkey_ptrs_c bch2_bkey_ptrs_c(struct bkey_s_c k)
211 case KEY_TYPE_btree_ptr: {
212 struct bkey_s_c_btree_ptr e = bkey_s_c_to_btree_ptr(k);
214 return (struct bkey_ptrs_c) {
215 to_entry(&e.v->start[0]),
216 to_entry(extent_entry_last(e))
219 case KEY_TYPE_extent: {
220 struct bkey_s_c_extent e = bkey_s_c_to_extent(k);
222 return (struct bkey_ptrs_c) {
227 case KEY_TYPE_stripe: {
228 struct bkey_s_c_stripe s = bkey_s_c_to_stripe(k);
230 return (struct bkey_ptrs_c) {
231 to_entry(&s.v->ptrs[0]),
232 to_entry(&s.v->ptrs[s.v->nr_blocks]),
235 case KEY_TYPE_reflink_v: {
236 struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(k);
238 return (struct bkey_ptrs_c) {
243 case KEY_TYPE_btree_ptr_v2: {
244 struct bkey_s_c_btree_ptr_v2 e = bkey_s_c_to_btree_ptr_v2(k);
246 return (struct bkey_ptrs_c) {
247 to_entry(&e.v->start[0]),
248 to_entry(extent_entry_last(e))
252 return (struct bkey_ptrs_c) { NULL, NULL };
256 static inline struct bkey_ptrs bch2_bkey_ptrs(struct bkey_s k)
258 struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k.s_c);
260 return (struct bkey_ptrs) {
266 #define __bkey_extent_entry_for_each_from(_start, _end, _entry) \
267 for ((_entry) = (_start); \
269 (_entry) = extent_entry_next(_entry))
271 #define __bkey_ptr_next(_ptr, _end) \
273 typeof(_end) _entry; \
275 __bkey_extent_entry_for_each_from(to_entry(_ptr), _end, _entry) \
276 if (extent_entry_is_ptr(_entry)) \
279 _entry < (_end) ? entry_to_ptr(_entry) : NULL; \
282 #define bkey_extent_entry_for_each_from(_p, _entry, _start) \
283 __bkey_extent_entry_for_each_from(_start, (_p).end, _entry)
285 #define bkey_extent_entry_for_each(_p, _entry) \
286 bkey_extent_entry_for_each_from(_p, _entry, _p.start)
288 #define __bkey_for_each_ptr(_start, _end, _ptr) \
289 for ((_ptr) = (_start); \
290 ((_ptr) = __bkey_ptr_next(_ptr, _end)); \
293 #define bkey_ptr_next(_p, _ptr) \
294 __bkey_ptr_next(_ptr, (_p).end)
296 #define bkey_for_each_ptr(_p, _ptr) \
297 __bkey_for_each_ptr(&(_p).start->ptr, (_p).end, _ptr)
299 #define __bkey_ptr_next_decode(_k, _end, _ptr, _entry) \
304 (_ptr).has_ec = false; \
306 __bkey_extent_entry_for_each_from(_entry, _end, _entry) \
307 switch (extent_entry_type(_entry)) { \
308 case BCH_EXTENT_ENTRY_ptr: \
309 (_ptr).ptr = _entry->ptr; \
311 case BCH_EXTENT_ENTRY_crc32: \
312 case BCH_EXTENT_ENTRY_crc64: \
313 case BCH_EXTENT_ENTRY_crc128: \
314 (_ptr).crc = bch2_extent_crc_unpack(_k, \
315 entry_to_crc(_entry)); \
317 case BCH_EXTENT_ENTRY_stripe_ptr: \
318 (_ptr).ec = _entry->stripe_ptr; \
319 (_ptr).has_ec = true; \
326 #define __bkey_for_each_ptr_decode(_k, _start, _end, _ptr, _entry) \
327 for ((_ptr).crc = bch2_extent_crc_unpack(_k, NULL), \
329 __bkey_ptr_next_decode(_k, _end, _ptr, _entry); \
330 (_entry) = extent_entry_next(_entry))
332 #define bkey_for_each_ptr_decode(_k, _p, _ptr, _entry) \
333 __bkey_for_each_ptr_decode(_k, (_p).start, (_p).end, \
336 #define bkey_crc_next(_k, _start, _end, _crc, _iter) \
338 __bkey_extent_entry_for_each_from(_iter, _end, _iter) \
339 if (extent_entry_is_crc(_iter)) { \
340 (_crc) = bch2_extent_crc_unpack(_k, \
341 entry_to_crc(_iter)); \
348 #define __bkey_for_each_crc(_k, _start, _end, _crc, _iter) \
349 for ((_crc) = bch2_extent_crc_unpack(_k, NULL), \
350 (_iter) = (_start); \
351 bkey_crc_next(_k, _start, _end, _crc, _iter); \
352 (_iter) = extent_entry_next(_iter))
354 #define bkey_for_each_crc(_k, _p, _crc, _iter) \
355 __bkey_for_each_crc(_k, (_p).start, (_p).end, _crc, _iter)
357 /* Iterate over pointers in KEY_TYPE_extent: */
359 #define extent_for_each_entry_from(_e, _entry, _start) \
360 __bkey_extent_entry_for_each_from(_start, \
361 extent_entry_last(_e), _entry)
363 #define extent_for_each_entry(_e, _entry) \
364 extent_for_each_entry_from(_e, _entry, (_e).v->start)
366 #define extent_ptr_next(_e, _ptr) \
367 __bkey_ptr_next(_ptr, extent_entry_last(_e))
369 #define extent_for_each_ptr(_e, _ptr) \
370 __bkey_for_each_ptr(&(_e).v->start->ptr, extent_entry_last(_e), _ptr)
372 #define extent_for_each_ptr_decode(_e, _ptr, _entry) \
373 __bkey_for_each_ptr_decode((_e).k, (_e).v->start, \
374 extent_entry_last(_e), _ptr, _entry)
376 /* utility code common to all keys with pointers: */
378 void bch2_mark_io_failure(struct bch_io_failures *,
379 struct extent_ptr_decoded *);
380 int bch2_bkey_pick_read_device(struct bch_fs *, struct bkey_s_c,
381 struct bch_io_failures *,
382 struct extent_ptr_decoded *);
384 /* KEY_TYPE_btree_ptr: */
386 int bch2_btree_ptr_invalid(const struct bch_fs *, struct bkey_s_c, unsigned, struct printbuf *);
387 void bch2_btree_ptr_to_text(struct printbuf *, struct bch_fs *,
390 int bch2_btree_ptr_v2_invalid(const struct bch_fs *, struct bkey_s_c, unsigned, struct printbuf *);
391 void bch2_btree_ptr_v2_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
392 void bch2_btree_ptr_v2_compat(enum btree_id, unsigned, unsigned,
395 #define bch2_bkey_ops_btree_ptr ((struct bkey_ops) { \
396 .key_invalid = bch2_btree_ptr_invalid, \
397 .val_to_text = bch2_btree_ptr_to_text, \
398 .swab = bch2_ptr_swab, \
399 .trans_trigger = bch2_trans_mark_extent, \
400 .atomic_trigger = bch2_mark_extent, \
403 #define bch2_bkey_ops_btree_ptr_v2 ((struct bkey_ops) { \
404 .key_invalid = bch2_btree_ptr_v2_invalid, \
405 .val_to_text = bch2_btree_ptr_v2_to_text, \
406 .swab = bch2_ptr_swab, \
407 .compat = bch2_btree_ptr_v2_compat, \
408 .trans_trigger = bch2_trans_mark_extent, \
409 .atomic_trigger = bch2_mark_extent, \
410 .min_val_size = 40, \
413 /* KEY_TYPE_extent: */
415 bool bch2_extent_merge(struct bch_fs *, struct bkey_s, struct bkey_s_c);
417 #define bch2_bkey_ops_extent ((struct bkey_ops) { \
418 .key_invalid = bch2_bkey_ptrs_invalid, \
419 .val_to_text = bch2_bkey_ptrs_to_text, \
420 .swab = bch2_ptr_swab, \
421 .key_normalize = bch2_extent_normalize, \
422 .key_merge = bch2_extent_merge, \
423 .trans_trigger = bch2_trans_mark_extent, \
424 .atomic_trigger = bch2_mark_extent, \
427 /* KEY_TYPE_reservation: */
429 int bch2_reservation_invalid(const struct bch_fs *, struct bkey_s_c,
430 unsigned, struct printbuf *);
431 void bch2_reservation_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
432 bool bch2_reservation_merge(struct bch_fs *, struct bkey_s, struct bkey_s_c);
434 #define bch2_bkey_ops_reservation ((struct bkey_ops) { \
435 .key_invalid = bch2_reservation_invalid, \
436 .val_to_text = bch2_reservation_to_text, \
437 .key_merge = bch2_reservation_merge, \
438 .trans_trigger = bch2_trans_mark_reservation, \
439 .atomic_trigger = bch2_mark_reservation, \
443 /* Extent checksum entries: */
445 bool bch2_can_narrow_extent_crcs(struct bkey_s_c,
446 struct bch_extent_crc_unpacked);
447 bool bch2_bkey_narrow_crcs(struct bkey_i *, struct bch_extent_crc_unpacked);
448 void bch2_extent_crc_append(struct bkey_i *,
449 struct bch_extent_crc_unpacked);
451 /* Generic code for keys with pointers: */
453 static inline bool bkey_is_btree_ptr(const struct bkey *k)
456 case KEY_TYPE_btree_ptr:
457 case KEY_TYPE_btree_ptr_v2:
464 static inline bool bkey_extent_is_direct_data(const struct bkey *k)
467 case KEY_TYPE_btree_ptr:
468 case KEY_TYPE_btree_ptr_v2:
469 case KEY_TYPE_extent:
470 case KEY_TYPE_reflink_v:
477 static inline bool bkey_extent_is_inline_data(const struct bkey *k)
479 return k->type == KEY_TYPE_inline_data ||
480 k->type == KEY_TYPE_indirect_inline_data;
483 static inline unsigned bkey_inline_data_offset(const struct bkey *k)
486 case KEY_TYPE_inline_data:
487 return sizeof(struct bch_inline_data);
488 case KEY_TYPE_indirect_inline_data:
489 return sizeof(struct bch_indirect_inline_data);
495 static inline unsigned bkey_inline_data_bytes(const struct bkey *k)
497 return bkey_val_bytes(k) - bkey_inline_data_offset(k);
500 #define bkey_inline_data_p(_k) (((void *) (_k).v) + bkey_inline_data_offset((_k).k))
502 static inline bool bkey_extent_is_data(const struct bkey *k)
504 return bkey_extent_is_direct_data(k) ||
505 bkey_extent_is_inline_data(k) ||
506 k->type == KEY_TYPE_reflink_p;
510 * Should extent be counted under inode->i_sectors?
512 static inline bool bkey_extent_is_allocation(const struct bkey *k)
515 case KEY_TYPE_extent:
516 case KEY_TYPE_reservation:
517 case KEY_TYPE_reflink_p:
518 case KEY_TYPE_reflink_v:
519 case KEY_TYPE_inline_data:
520 case KEY_TYPE_indirect_inline_data:
527 static inline bool bkey_extent_is_unwritten(struct bkey_s_c k)
529 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
530 const struct bch_extent_ptr *ptr;
532 bkey_for_each_ptr(ptrs, ptr)
538 static inline bool bkey_extent_is_reservation(struct bkey_s_c k)
540 return k.k->type == KEY_TYPE_reservation ||
541 bkey_extent_is_unwritten(k);
544 static inline struct bch_devs_list bch2_bkey_devs(struct bkey_s_c k)
546 struct bch_devs_list ret = (struct bch_devs_list) { 0 };
547 struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
548 const struct bch_extent_ptr *ptr;
550 bkey_for_each_ptr(p, ptr)
551 ret.devs[ret.nr++] = ptr->dev;
556 static inline struct bch_devs_list bch2_bkey_dirty_devs(struct bkey_s_c k)
558 struct bch_devs_list ret = (struct bch_devs_list) { 0 };
559 struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
560 const struct bch_extent_ptr *ptr;
562 bkey_for_each_ptr(p, ptr)
564 ret.devs[ret.nr++] = ptr->dev;
569 static inline struct bch_devs_list bch2_bkey_cached_devs(struct bkey_s_c k)
571 struct bch_devs_list ret = (struct bch_devs_list) { 0 };
572 struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
573 const struct bch_extent_ptr *ptr;
575 bkey_for_each_ptr(p, ptr)
577 ret.devs[ret.nr++] = ptr->dev;
582 static inline unsigned bch2_bkey_ptr_data_type(struct bkey_s_c k, const struct bch_extent_ptr *ptr)
585 case KEY_TYPE_btree_ptr:
586 case KEY_TYPE_btree_ptr_v2:
587 return BCH_DATA_btree;
588 case KEY_TYPE_extent:
589 case KEY_TYPE_reflink_v:
590 return BCH_DATA_user;
591 case KEY_TYPE_stripe: {
592 struct bkey_s_c_stripe s = bkey_s_c_to_stripe(k);
594 BUG_ON(ptr < s.v->ptrs ||
595 ptr >= s.v->ptrs + s.v->nr_blocks);
597 return ptr >= s.v->ptrs + s.v->nr_blocks - s.v->nr_redundant
606 unsigned bch2_bkey_nr_ptrs(struct bkey_s_c);
607 unsigned bch2_bkey_nr_ptrs_allocated(struct bkey_s_c);
608 unsigned bch2_bkey_nr_ptrs_fully_allocated(struct bkey_s_c);
609 bool bch2_bkey_is_incompressible(struct bkey_s_c);
610 unsigned bch2_bkey_sectors_compressed(struct bkey_s_c);
612 unsigned bch2_bkey_replicas(struct bch_fs *, struct bkey_s_c);
613 unsigned bch2_extent_ptr_desired_durability(struct bch_fs *, struct extent_ptr_decoded *);
614 unsigned bch2_extent_ptr_durability(struct bch_fs *, struct extent_ptr_decoded *);
615 unsigned bch2_bkey_durability(struct bch_fs *, struct bkey_s_c);
617 void bch2_bkey_drop_device(struct bkey_s, unsigned);
618 void bch2_bkey_drop_device_noerror(struct bkey_s, unsigned);
620 const struct bch_extent_ptr *bch2_bkey_has_device_c(struct bkey_s_c, unsigned);
622 static inline struct bch_extent_ptr *bch2_bkey_has_device(struct bkey_s k, unsigned dev)
624 return (void *) bch2_bkey_has_device_c(k.s_c, dev);
627 bool bch2_bkey_has_target(struct bch_fs *, struct bkey_s_c, unsigned);
629 void bch2_bkey_extent_entry_drop(struct bkey_i *, union bch_extent_entry *);
631 static inline void bch2_bkey_append_ptr(struct bkey_i *k, struct bch_extent_ptr ptr)
633 EBUG_ON(bch2_bkey_has_device(bkey_i_to_s(k), ptr.dev));
636 case KEY_TYPE_btree_ptr:
637 case KEY_TYPE_btree_ptr_v2:
638 case KEY_TYPE_extent:
639 EBUG_ON(bkey_val_u64s(&k->k) >= BKEY_EXTENT_VAL_U64s_MAX);
641 ptr.type = 1 << BCH_EXTENT_ENTRY_ptr;
643 memcpy((void *) &k->v + bkey_val_bytes(&k->k),
653 void bch2_extent_ptr_decoded_append(struct bkey_i *,
654 struct extent_ptr_decoded *);
655 union bch_extent_entry *bch2_bkey_drop_ptr_noerror(struct bkey_s,
656 struct bch_extent_ptr *);
657 union bch_extent_entry *bch2_bkey_drop_ptr(struct bkey_s,
658 struct bch_extent_ptr *);
660 #define bch2_bkey_drop_ptrs(_k, _ptr, _cond) \
662 struct bkey_ptrs _ptrs = bch2_bkey_ptrs(_k); \
664 _ptr = &_ptrs.start->ptr; \
666 while ((_ptr = bkey_ptr_next(_ptrs, _ptr))) { \
668 _ptr = (void *) bch2_bkey_drop_ptr(_k, _ptr); \
669 _ptrs = bch2_bkey_ptrs(_k); \
677 bool bch2_bkey_matches_ptr(struct bch_fs *, struct bkey_s_c,
678 struct bch_extent_ptr, u64);
679 bool bch2_extents_match(struct bkey_s_c, struct bkey_s_c);
680 struct bch_extent_ptr *
681 bch2_extent_has_ptr(struct bkey_s_c, struct extent_ptr_decoded, struct bkey_s);
683 void bch2_extent_ptr_set_cached(struct bkey_s, struct bch_extent_ptr *);
685 bool bch2_extent_normalize(struct bch_fs *, struct bkey_s);
686 void bch2_bkey_ptrs_to_text(struct printbuf *, struct bch_fs *,
688 int bch2_bkey_ptrs_invalid(const struct bch_fs *, struct bkey_s_c,
689 unsigned, struct printbuf *);
691 void bch2_ptr_swab(struct bkey_s);
693 /* Generic extent code: */
695 enum bch_extent_overlap {
696 BCH_EXTENT_OVERLAP_ALL = 0,
697 BCH_EXTENT_OVERLAP_BACK = 1,
698 BCH_EXTENT_OVERLAP_FRONT = 2,
699 BCH_EXTENT_OVERLAP_MIDDLE = 3,
702 /* Returns how k overlaps with m */
703 static inline enum bch_extent_overlap bch2_extent_overlap(const struct bkey *k,
704 const struct bkey *m)
706 int cmp1 = bkey_lt(k->p, m->p);
707 int cmp2 = bkey_gt(bkey_start_pos(k), bkey_start_pos(m));
709 return (cmp1 << 1) + cmp2;
712 int bch2_cut_front_s(struct bpos, struct bkey_s);
713 int bch2_cut_back_s(struct bpos, struct bkey_s);
715 static inline void bch2_cut_front(struct bpos where, struct bkey_i *k)
717 bch2_cut_front_s(where, bkey_i_to_s(k));
720 static inline void bch2_cut_back(struct bpos where, struct bkey_i *k)
722 bch2_cut_back_s(where, bkey_i_to_s(k));
726 * bch_key_resize - adjust size of @k
728 * bkey_start_offset(k) will be preserved, modifies where the extent ends
730 static inline void bch2_key_resize(struct bkey *k, unsigned new_size)
732 k->p.offset -= k->size;
733 k->p.offset += new_size;
738 * In extent_sort_fix_overlapping(), insert_fixup_extent(),
739 * extent_merge_inline() - we're modifying keys in place that are packed. To do
740 * that we have to unpack the key, modify the unpacked key - then this
741 * copies/repacks the unpacked to the original as necessary.
743 static inline void extent_save(struct btree *b, struct bkey_packed *dst,
746 struct bkey_format *f = &b->format;
747 struct bkey_i *dst_unpacked;
749 if ((dst_unpacked = packed_to_bkey(dst)))
750 dst_unpacked->k = *src;
752 BUG_ON(!bch2_bkey_pack_key(dst, src, f));
755 #endif /* _BCACHEFS_EXTENTS_H */