1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2010 Kent Overstreet <kent.overstreet@gmail.com>
5 * Code for managing the extent btree and dynamically updating the writeback
10 #include "bkey_methods.h"
12 #include "btree_update.h"
13 #include "btree_update_interior.h"
18 #include "disk_groups.h"
30 unsigned bch2_bkey_nr_ptrs(struct bkey_s_c k)
32 struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
33 const struct bch_extent_ptr *ptr;
36 bkey_for_each_ptr(p, ptr)
42 unsigned bch2_bkey_nr_dirty_ptrs(struct bkey_s_c k)
47 case KEY_TYPE_btree_ptr:
48 case KEY_TYPE_extent: {
49 struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
50 const struct bch_extent_ptr *ptr;
52 bkey_for_each_ptr(p, ptr)
53 nr_ptrs += !ptr->cached;
57 case KEY_TYPE_reservation:
58 nr_ptrs = bkey_s_c_to_reservation(k).v->nr_replicas;
65 static unsigned bch2_extent_ptr_durability(struct bch_fs *c,
66 struct extent_ptr_decoded p)
68 unsigned i, durability = 0;
74 ca = bch_dev_bkey_exists(c, p.ptr.dev);
76 if (ca->mi.state != BCH_MEMBER_STATE_FAILED)
77 durability = max_t(unsigned, durability, ca->mi.durability);
79 for (i = 0; i < p.ec_nr; i++) {
81 genradix_ptr(&c->stripes[0], p.idx);
86 durability = max_t(unsigned, durability, s->nr_redundant);
92 unsigned bch2_bkey_durability(struct bch_fs *c, struct bkey_s_c k)
94 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
95 const union bch_extent_entry *entry;
96 struct extent_ptr_decoded p;
97 unsigned durability = 0;
99 bkey_for_each_ptr_decode(k.k, ptrs, p, entry)
100 durability += bch2_extent_ptr_durability(c, p);
105 static struct bch_dev_io_failures *dev_io_failures(struct bch_io_failures *f,
108 struct bch_dev_io_failures *i;
110 for (i = f->devs; i < f->devs + f->nr; i++)
117 void bch2_mark_io_failure(struct bch_io_failures *failed,
118 struct extent_ptr_decoded *p)
120 struct bch_dev_io_failures *f = dev_io_failures(failed, p->ptr.dev);
123 BUG_ON(failed->nr >= ARRAY_SIZE(failed->devs));
125 f = &failed->devs[failed->nr++];
130 } else if (p->idx != f->idx) {
140 * returns true if p1 is better than p2:
142 static inline bool ptr_better(struct bch_fs *c,
143 const struct extent_ptr_decoded p1,
144 const struct extent_ptr_decoded p2)
146 if (likely(!p1.idx && !p2.idx)) {
147 struct bch_dev *dev1 = bch_dev_bkey_exists(c, p1.ptr.dev);
148 struct bch_dev *dev2 = bch_dev_bkey_exists(c, p2.ptr.dev);
150 u64 l1 = atomic64_read(&dev1->cur_latency[READ]);
151 u64 l2 = atomic64_read(&dev2->cur_latency[READ]);
153 /* Pick at random, biased in favor of the faster device: */
155 return bch2_rand_range(l1 + l2) > l1;
158 if (force_reconstruct_read(c))
159 return p1.idx > p2.idx;
161 return p1.idx < p2.idx;
165 * This picks a non-stale pointer, preferably from a device other than @avoid.
166 * Avoid can be NULL, meaning pick any. If there are no non-stale pointers to
167 * other devices, it will still pick a pointer from avoid.
169 int bch2_bkey_pick_read_device(struct bch_fs *c, struct bkey_s_c k,
170 struct bch_io_failures *failed,
171 struct extent_ptr_decoded *pick)
173 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
174 const union bch_extent_entry *entry;
175 struct extent_ptr_decoded p;
176 struct bch_dev_io_failures *f;
180 if (k.k->type == KEY_TYPE_error)
183 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
184 ca = bch_dev_bkey_exists(c, p.ptr.dev);
187 * If there are any dirty pointers it's an error if we can't
190 if (!ret && !p.ptr.cached)
193 if (p.ptr.cached && ptr_stale(ca, &p.ptr))
196 f = failed ? dev_io_failures(failed, p.ptr.dev) : NULL;
198 p.idx = f->nr_failed < f->nr_retries
203 !bch2_dev_is_readable(ca))
206 if (force_reconstruct_read(c) &&
210 if (p.idx >= p.ec_nr + 1)
213 if (ret > 0 && !ptr_better(c, p, *pick))
223 void bch2_bkey_append_ptr(struct bkey_i *k,
224 struct bch_extent_ptr ptr)
226 EBUG_ON(bch2_bkey_has_device(bkey_i_to_s_c(k), ptr.dev));
229 case KEY_TYPE_btree_ptr:
230 case KEY_TYPE_extent:
231 EBUG_ON(bkey_val_u64s(&k->k) >= BKEY_EXTENT_VAL_U64s_MAX);
233 ptr.type = 1 << BCH_EXTENT_ENTRY_ptr;
235 memcpy((void *) &k->v + bkey_val_bytes(&k->k),
245 void bch2_bkey_drop_device(struct bkey_s k, unsigned dev)
247 struct bch_extent_ptr *ptr;
249 bch2_bkey_drop_ptrs(k, ptr, ptr->dev == dev);
252 /* extent specific utility code */
254 const struct bch_extent_ptr *
255 bch2_extent_has_device(struct bkey_s_c_extent e, unsigned dev)
257 const struct bch_extent_ptr *ptr;
259 extent_for_each_ptr(e, ptr)
266 const struct bch_extent_ptr *
267 bch2_extent_has_group(struct bch_fs *c, struct bkey_s_c_extent e, unsigned group)
269 const struct bch_extent_ptr *ptr;
271 extent_for_each_ptr(e, ptr) {
272 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
275 ca->mi.group - 1 == group)
282 const struct bch_extent_ptr *
283 bch2_extent_has_target(struct bch_fs *c, struct bkey_s_c_extent e, unsigned target)
285 const struct bch_extent_ptr *ptr;
287 extent_for_each_ptr(e, ptr)
288 if (bch2_dev_in_target(c, ptr->dev, target) &&
290 !ptr_stale(bch_dev_bkey_exists(c, ptr->dev), ptr)))
296 unsigned bch2_extent_is_compressed(struct bkey_s_c k)
301 case KEY_TYPE_extent: {
302 struct bkey_s_c_extent e = bkey_s_c_to_extent(k);
303 const union bch_extent_entry *entry;
304 struct extent_ptr_decoded p;
306 extent_for_each_ptr_decode(e, p, entry)
308 p.crc.compression_type != BCH_COMPRESSION_NONE)
309 ret += p.crc.compressed_size;
316 bool bch2_extent_matches_ptr(struct bch_fs *c, struct bkey_s_c_extent e,
317 struct bch_extent_ptr m, u64 offset)
319 const union bch_extent_entry *entry;
320 struct extent_ptr_decoded p;
322 extent_for_each_ptr_decode(e, p, entry)
323 if (p.ptr.dev == m.dev &&
324 p.ptr.gen == m.gen &&
325 (s64) p.ptr.offset + p.crc.offset - bkey_start_offset(e.k) ==
326 (s64) m.offset - offset)
332 static union bch_extent_entry *extent_entry_prev(struct bkey_ptrs ptrs,
333 union bch_extent_entry *entry)
335 union bch_extent_entry *i = ptrs.start;
340 while (extent_entry_next(i) != entry)
341 i = extent_entry_next(i);
345 union bch_extent_entry *bch2_bkey_drop_ptr(struct bkey_s k,
346 struct bch_extent_ptr *ptr)
348 struct bkey_ptrs ptrs = bch2_bkey_ptrs(k);
349 union bch_extent_entry *dst, *src, *prev;
350 bool drop_crc = true;
352 EBUG_ON(ptr < &ptrs.start->ptr ||
353 ptr >= &ptrs.end->ptr);
354 EBUG_ON(ptr->type != 1 << BCH_EXTENT_ENTRY_ptr);
356 src = extent_entry_next(to_entry(ptr));
357 if (src != ptrs.end &&
358 !extent_entry_is_crc(src))
362 while ((prev = extent_entry_prev(ptrs, dst))) {
363 if (extent_entry_is_ptr(prev))
366 if (extent_entry_is_crc(prev)) {
375 memmove_u64s_down(dst, src,
376 (u64 *) ptrs.end - (u64 *) src);
377 k.k->u64s -= (u64 *) src - (u64 *) dst;
382 static inline bool can_narrow_crc(struct bch_extent_crc_unpacked u,
383 struct bch_extent_crc_unpacked n)
385 return !u.compression_type &&
387 u.uncompressed_size > u.live_size &&
388 bch2_csum_type_is_encryption(u.csum_type) ==
389 bch2_csum_type_is_encryption(n.csum_type);
392 bool bch2_can_narrow_extent_crcs(struct bkey_s_c_extent e,
393 struct bch_extent_crc_unpacked n)
395 struct bch_extent_crc_unpacked crc;
396 const union bch_extent_entry *i;
401 extent_for_each_crc(e, crc, i)
402 if (can_narrow_crc(crc, n))
409 * We're writing another replica for this extent, so while we've got the data in
410 * memory we'll be computing a new checksum for the currently live data.
412 * If there are other replicas we aren't moving, and they are checksummed but
413 * not compressed, we can modify them to point to only the data that is
414 * currently live (so that readers won't have to bounce) while we've got the
417 bool bch2_extent_narrow_crcs(struct bkey_i_extent *e,
418 struct bch_extent_crc_unpacked n)
420 struct bch_extent_crc_unpacked u;
421 struct extent_ptr_decoded p;
422 union bch_extent_entry *i;
425 /* Find a checksum entry that covers only live data: */
427 extent_for_each_crc(extent_i_to_s(e), u, i)
428 if (!u.compression_type &&
430 u.live_size == u.uncompressed_size) {
437 BUG_ON(n.compression_type);
439 BUG_ON(n.live_size != e->k.size);
441 restart_narrow_pointers:
442 extent_for_each_ptr_decode(extent_i_to_s(e), p, i)
443 if (can_narrow_crc(p.crc, n)) {
444 bch2_bkey_drop_ptr(extent_i_to_s(e).s, &i->ptr);
445 p.ptr.offset += p.crc.offset;
447 bch2_extent_ptr_decoded_append(e, &p);
449 goto restart_narrow_pointers;
455 /* returns true if not equal */
456 static inline bool bch2_crc_unpacked_cmp(struct bch_extent_crc_unpacked l,
457 struct bch_extent_crc_unpacked r)
459 return (l.csum_type != r.csum_type ||
460 l.compression_type != r.compression_type ||
461 l.compressed_size != r.compressed_size ||
462 l.uncompressed_size != r.uncompressed_size ||
463 l.offset != r.offset ||
464 l.live_size != r.live_size ||
465 l.nonce != r.nonce ||
466 bch2_crc_cmp(l.csum, r.csum));
469 void bch2_ptr_swab(const struct bkey_format *f, struct bkey_packed *k)
471 union bch_extent_entry *entry;
472 u64 *d = (u64 *) bkeyp_val(f, k);
475 for (i = 0; i < bkeyp_val_u64s(f, k); i++)
478 for (entry = (union bch_extent_entry *) d;
479 entry < (union bch_extent_entry *) (d + bkeyp_val_u64s(f, k));
480 entry = extent_entry_next(entry)) {
481 switch (extent_entry_type(entry)) {
482 case BCH_EXTENT_ENTRY_ptr:
484 case BCH_EXTENT_ENTRY_crc32:
485 entry->crc32.csum = swab32(entry->crc32.csum);
487 case BCH_EXTENT_ENTRY_crc64:
488 entry->crc64.csum_hi = swab16(entry->crc64.csum_hi);
489 entry->crc64.csum_lo = swab64(entry->crc64.csum_lo);
491 case BCH_EXTENT_ENTRY_crc128:
492 entry->crc128.csum.hi = (__force __le64)
493 swab64((__force u64) entry->crc128.csum.hi);
494 entry->crc128.csum.lo = (__force __le64)
495 swab64((__force u64) entry->crc128.csum.lo);
497 case BCH_EXTENT_ENTRY_stripe_ptr:
503 static const char *extent_ptr_invalid(const struct bch_fs *c,
505 const struct bch_extent_ptr *ptr,
506 unsigned size_ondisk,
509 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
510 const struct bch_extent_ptr *ptr2;
513 if (ptr->dev >= c->sb.nr_devices ||
515 return "pointer to invalid device";
517 ca = bch_dev_bkey_exists(c, ptr->dev);
519 return "pointer to invalid device";
521 bkey_for_each_ptr(ptrs, ptr2)
522 if (ptr != ptr2 && ptr->dev == ptr2->dev)
523 return "multiple pointers to same device";
525 if (ptr->offset + size_ondisk > bucket_to_sector(ca, ca->mi.nbuckets))
526 return "offset past end of device";
528 if (ptr->offset < bucket_to_sector(ca, ca->mi.first_bucket))
529 return "offset before first bucket";
531 if (bucket_remainder(ca, ptr->offset) +
532 size_ondisk > ca->mi.bucket_size)
533 return "spans multiple buckets";
538 static void bkey_ptrs_to_text(struct printbuf *out, struct bch_fs *c,
541 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
542 const union bch_extent_entry *entry;
543 struct bch_extent_crc_unpacked crc;
544 const struct bch_extent_ptr *ptr;
545 const struct bch_extent_stripe_ptr *ec;
549 bkey_extent_entry_for_each(ptrs, entry) {
553 switch (__extent_entry_type(entry)) {
554 case BCH_EXTENT_ENTRY_ptr:
555 ptr = entry_to_ptr(entry);
556 ca = ptr->dev < c->sb.nr_devices && c->devs[ptr->dev]
557 ? bch_dev_bkey_exists(c, ptr->dev)
560 pr_buf(out, "ptr: %u:%llu gen %u%s%s", ptr->dev,
561 (u64) ptr->offset, ptr->gen,
562 ptr->cached ? " cached" : "",
563 ca && ptr_stale(ca, ptr)
566 case BCH_EXTENT_ENTRY_crc32:
567 case BCH_EXTENT_ENTRY_crc64:
568 case BCH_EXTENT_ENTRY_crc128:
569 crc = bch2_extent_crc_unpack(k.k, entry_to_crc(entry));
571 pr_buf(out, "crc: c_size %u size %u offset %u nonce %u csum %u compress %u",
573 crc.uncompressed_size,
574 crc.offset, crc.nonce,
576 crc.compression_type);
578 case BCH_EXTENT_ENTRY_stripe_ptr:
579 ec = &entry->stripe_ptr;
581 pr_buf(out, "ec: idx %llu block %u",
582 (u64) ec->idx, ec->block);
585 pr_buf(out, "(invalid extent entry %.16llx)", *((u64 *) entry));
595 const char *bch2_btree_ptr_invalid(const struct bch_fs *c, struct bkey_s_c k)
597 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
598 const union bch_extent_entry *entry;
599 const struct bch_extent_ptr *ptr;
602 if (bkey_val_u64s(k.k) > BKEY_BTREE_PTR_VAL_U64s_MAX)
603 return "value too big";
605 bkey_extent_entry_for_each(ptrs, entry) {
606 if (__extent_entry_type(entry) >= BCH_EXTENT_ENTRY_MAX)
607 return "invalid extent entry type";
609 if (!extent_entry_is_ptr(entry))
610 return "has non ptr field";
613 bkey_for_each_ptr(ptrs, ptr) {
614 reason = extent_ptr_invalid(c, k, ptr,
615 c->opts.btree_node_size,
624 void bch2_btree_ptr_debugcheck(struct bch_fs *c, struct btree *b,
627 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
628 const struct bch_extent_ptr *ptr;
631 struct bucket_mark mark;
634 bch2_fs_bug_on(!test_bit(BCH_FS_REBUILD_REPLICAS, &c->flags) &&
635 !bch2_bkey_replicas_marked(c, k, false), c,
636 "btree key bad (replicas not marked in superblock):\n%s",
637 (bch2_bkey_val_to_text(&PBUF(buf), c, k), buf));
639 if (!test_bit(BCH_FS_INITIAL_GC_DONE, &c->flags))
642 bkey_for_each_ptr(ptrs, ptr) {
643 ca = bch_dev_bkey_exists(c, ptr->dev);
645 mark = ptr_bucket_mark(ca, ptr);
648 if (gen_after(mark.gen, ptr->gen))
651 err = "inconsistent";
652 if (mark.data_type != BCH_DATA_BTREE ||
653 mark.dirty_sectors < c->opts.btree_node_size)
659 bch2_bkey_val_to_text(&PBUF(buf), c, k);
660 bch2_fs_bug(c, "%s btree pointer %s: bucket %zi gen %i mark %08x",
661 err, buf, PTR_BUCKET_NR(ca, ptr),
662 mark.gen, (unsigned) mark.v.counter);
665 void bch2_btree_ptr_to_text(struct printbuf *out, struct bch_fs *c,
670 bkey_ptrs_to_text(out, c, k);
672 invalid = bch2_btree_ptr_invalid(c, k);
674 pr_buf(out, " invalid: %s", invalid);
679 bool __bch2_cut_front(struct bpos where, struct bkey_s k)
683 if (bkey_cmp(where, bkey_start_pos(k.k)) <= 0)
686 EBUG_ON(bkey_cmp(where, k.k->p) > 0);
688 len = k.k->p.offset - where.offset;
690 BUG_ON(len > k.k->size);
693 * Don't readjust offset if the key size is now 0, because that could
694 * cause offset to point to the next bucket:
697 k.k->type = KEY_TYPE_deleted;
698 else if (bkey_extent_is_data(k.k)) {
699 struct bkey_s_extent e = bkey_s_to_extent(k);
700 union bch_extent_entry *entry;
701 bool seen_crc = false;
703 extent_for_each_entry(e, entry) {
704 switch (extent_entry_type(entry)) {
705 case BCH_EXTENT_ENTRY_ptr:
707 entry->ptr.offset += e.k->size - len;
709 case BCH_EXTENT_ENTRY_crc32:
710 entry->crc32.offset += e.k->size - len;
712 case BCH_EXTENT_ENTRY_crc64:
713 entry->crc64.offset += e.k->size - len;
715 case BCH_EXTENT_ENTRY_crc128:
716 entry->crc128.offset += e.k->size - len;
718 case BCH_EXTENT_ENTRY_stripe_ptr:
722 if (extent_entry_is_crc(entry))
732 bool bch2_cut_back(struct bpos where, struct bkey *k)
736 if (bkey_cmp(where, k->p) >= 0)
739 EBUG_ON(bkey_cmp(where, bkey_start_pos(k)) < 0);
741 len = where.offset - bkey_start_offset(k);
743 BUG_ON(len > k->size);
749 k->type = KEY_TYPE_deleted;
755 * bch_key_resize - adjust size of @k
757 * bkey_start_offset(k) will be preserved, modifies where the extent ends
759 void bch2_key_resize(struct bkey *k,
762 k->p.offset -= k->size;
763 k->p.offset += new_size;
767 static bool extent_i_save(struct btree *b, struct bkey_packed *dst,
770 struct bkey_format *f = &b->format;
771 struct bkey_i *dst_unpacked;
772 struct bkey_packed tmp;
774 if ((dst_unpacked = packed_to_bkey(dst)))
775 dst_unpacked->k = src->k;
776 else if (bch2_bkey_pack_key(&tmp, &src->k, f))
777 memcpy_u64s(dst, &tmp, f->key_u64s);
781 memcpy_u64s(bkeyp_val(f, dst), &src->v, bkey_val_u64s(&src->k));
785 static bool bch2_extent_merge_inline(struct bch_fs *,
787 struct bkey_packed *,
788 struct bkey_packed *,
791 static void verify_extent_nonoverlapping(struct bch_fs *c,
793 struct btree_node_iter *_iter,
794 struct bkey_i *insert)
796 #ifdef CONFIG_BCACHEFS_DEBUG
797 struct btree_node_iter iter;
798 struct bkey_packed *k;
801 if (!expensive_debug_checks(c))
805 k = bch2_btree_node_iter_prev_filter(&iter, b, KEY_TYPE_discard);
807 (uk = bkey_unpack_key(b, k),
808 bkey_cmp(uk.p, bkey_start_pos(&insert->k)) > 0));
811 k = bch2_btree_node_iter_peek_filter(&iter, b, KEY_TYPE_discard);
814 (uk = bkey_unpack_key(b, k),
815 bkey_cmp(insert->k.p, bkey_start_pos(&uk))) > 0);
818 (uk = bkey_unpack_key(b, k),
819 bkey_cmp(insert->k.p, bkey_start_pos(&uk))) > 0) {
823 bch2_bkey_to_text(&PBUF(buf1), &insert->k);
824 bch2_bkey_to_text(&PBUF(buf2), &uk);
826 bch2_dump_btree_node(b);
827 panic("insert > next :\n"
837 static void verify_modified_extent(struct btree_iter *iter,
838 struct bkey_packed *k)
840 bch2_btree_iter_verify(iter, iter->l[0].b);
841 bch2_verify_insert_pos(iter->l[0].b, k, k, k->u64s);
844 static void extent_bset_insert(struct bch_fs *c, struct btree_iter *iter,
845 struct bkey_i *insert)
847 struct btree_iter_level *l = &iter->l[0];
848 struct btree_node_iter node_iter;
849 struct bkey_packed *k;
851 BUG_ON(insert->k.u64s > bch_btree_keys_u64s_remaining(c, l->b));
853 EBUG_ON(bkey_deleted(&insert->k) || !insert->k.size);
854 verify_extent_nonoverlapping(c, l->b, &l->iter, insert);
857 k = bch2_btree_node_iter_prev_filter(&node_iter, l->b, KEY_TYPE_discard);
858 if (k && !bkey_written(l->b, k) &&
859 bch2_extent_merge_inline(c, iter, k, bkey_to_packed(insert), true))
863 k = bch2_btree_node_iter_peek_filter(&node_iter, l->b, KEY_TYPE_discard);
864 if (k && !bkey_written(l->b, k) &&
865 bch2_extent_merge_inline(c, iter, bkey_to_packed(insert), k, false))
868 k = bch2_btree_node_iter_bset_pos(&l->iter, l->b, bset_tree_last(l->b));
870 bch2_bset_insert(l->b, &l->iter, k, insert, 0);
871 bch2_btree_node_iter_fix(iter, l->b, &l->iter, k, 0, k->u64s);
872 bch2_btree_iter_verify(iter, l->b);
875 static inline struct bpos
876 bch2_extent_atomic_end(struct bkey_i *k, struct btree_iter *iter)
878 struct btree *b = iter->l[0].b;
880 BUG_ON(iter->uptodate > BTREE_ITER_NEED_PEEK);
881 BUG_ON(bkey_cmp(bkey_start_pos(&k->k), b->data->min_key) < 0);
883 return bpos_min(k->k.p, b->key.k.p);
886 void bch2_extent_trim_atomic(struct bkey_i *k, struct btree_iter *iter)
888 bch2_cut_back(bch2_extent_atomic_end(k, iter), &k->k);
891 bool bch2_extent_is_atomic(struct bkey_i *k, struct btree_iter *iter)
893 return !bkey_cmp(bch2_extent_atomic_end(k, iter), k->k.p);
896 enum btree_insert_ret
897 bch2_extent_can_insert(struct btree_trans *trans,
898 struct btree_insert_entry *insert,
901 struct btree_iter_level *l = &insert->iter->l[0];
902 struct btree_node_iter node_iter = l->iter;
903 enum bch_extent_overlap overlap;
904 struct bkey_packed *_k;
905 struct bkey unpacked;
910 * We avoid creating whiteouts whenever possible when deleting, but
911 * those optimizations mean we may potentially insert two whiteouts
912 * instead of one (when we overlap with the front of one extent and the
915 if (bkey_whiteout(&insert->k->k))
918 _k = bch2_btree_node_iter_peek_filter(&node_iter, l->b,
921 return BTREE_INSERT_OK;
923 k = bkey_disassemble(l->b, _k, &unpacked);
925 overlap = bch2_extent_overlap(&insert->k->k, k.k);
927 /* account for having to split existing extent: */
928 if (overlap == BCH_EXTENT_OVERLAP_MIDDLE)
931 if (overlap == BCH_EXTENT_OVERLAP_MIDDLE &&
932 (sectors = bch2_extent_is_compressed(k))) {
933 int flags = trans->flags & BTREE_INSERT_NOFAIL
934 ? BCH_DISK_RESERVATION_NOFAIL : 0;
936 switch (bch2_disk_reservation_add(trans->c,
942 return BTREE_INSERT_ENOSPC;
948 return BTREE_INSERT_OK;
952 extent_squash(struct bch_fs *c, struct btree_iter *iter,
953 struct bkey_i *insert,
954 struct bkey_packed *_k, struct bkey_s k,
955 enum bch_extent_overlap overlap)
957 struct btree_iter_level *l = &iter->l[0];
960 case BCH_EXTENT_OVERLAP_FRONT:
961 /* insert overlaps with start of k: */
962 __bch2_cut_front(insert->k.p, k);
963 BUG_ON(bkey_deleted(k.k));
964 extent_save(l->b, _k, k.k);
965 verify_modified_extent(iter, _k);
968 case BCH_EXTENT_OVERLAP_BACK:
969 /* insert overlaps with end of k: */
970 bch2_cut_back(bkey_start_pos(&insert->k), k.k);
971 BUG_ON(bkey_deleted(k.k));
972 extent_save(l->b, _k, k.k);
975 * As the auxiliary tree is indexed by the end of the
976 * key and we've just changed the end, update the
979 bch2_bset_fix_invalidated_key(l->b, _k);
980 bch2_btree_node_iter_fix(iter, l->b, &l->iter,
981 _k, _k->u64s, _k->u64s);
982 verify_modified_extent(iter, _k);
985 case BCH_EXTENT_OVERLAP_ALL: {
986 /* The insert key completely covers k, invalidate k */
987 if (!bkey_whiteout(k.k))
988 btree_account_key_drop(l->b, _k);
991 k.k->type = KEY_TYPE_deleted;
993 if (_k >= btree_bset_last(l->b)->start) {
994 unsigned u64s = _k->u64s;
996 bch2_bset_delete(l->b, _k, _k->u64s);
997 bch2_btree_node_iter_fix(iter, l->b, &l->iter,
999 bch2_btree_iter_verify(iter, l->b);
1001 extent_save(l->b, _k, k.k);
1002 bch2_btree_node_iter_fix(iter, l->b, &l->iter,
1003 _k, _k->u64s, _k->u64s);
1004 verify_modified_extent(iter, _k);
1009 case BCH_EXTENT_OVERLAP_MIDDLE: {
1010 BKEY_PADDED(k) split;
1012 * The insert key falls 'in the middle' of k
1013 * The insert key splits k in 3:
1014 * - start only in k, preserve
1015 * - middle common section, invalidate in k
1016 * - end only in k, preserve
1018 * We update the old key to preserve the start,
1019 * insert will be the new common section,
1020 * we manually insert the end that we are preserving.
1022 * modify k _before_ doing the insert (which will move
1025 bkey_reassemble(&split.k, k.s_c);
1026 split.k.k.needs_whiteout |= bkey_written(l->b, _k);
1028 bch2_cut_back(bkey_start_pos(&insert->k), &split.k.k);
1029 BUG_ON(bkey_deleted(&split.k.k));
1031 __bch2_cut_front(insert->k.p, k);
1032 BUG_ON(bkey_deleted(k.k));
1033 extent_save(l->b, _k, k.k);
1034 verify_modified_extent(iter, _k);
1036 extent_bset_insert(c, iter, &split.k);
1042 struct extent_insert_state {
1043 struct bkey_i whiteout;
1044 bool update_journal;
1049 static void __bch2_insert_fixup_extent(struct bch_fs *c,
1050 struct btree_iter *iter,
1051 struct bkey_i *insert,
1052 struct extent_insert_state *s)
1054 struct btree_iter_level *l = &iter->l[0];
1055 struct bkey_packed *_k;
1056 struct bkey unpacked;
1058 while ((_k = bch2_btree_node_iter_peek_filter(&l->iter, l->b,
1059 KEY_TYPE_discard))) {
1060 struct bkey_s k = __bkey_disassemble(l->b, _k, &unpacked);
1061 struct bpos cur_end = bpos_min(insert->k.p, k.k->p);
1062 enum bch_extent_overlap overlap =
1063 bch2_extent_overlap(&insert->k, k.k);
1065 if (bkey_cmp(bkey_start_pos(k.k), insert->k.p) >= 0)
1068 if (!bkey_whiteout(k.k))
1069 s->update_journal = true;
1071 if (!s->update_journal) {
1072 bch2_cut_front(cur_end, insert);
1073 bch2_cut_front(cur_end, &s->whiteout);
1074 bch2_btree_iter_set_pos_same_leaf(iter, cur_end);
1079 * When deleting, if possible just do it by switching the type
1080 * of the key we're deleting, instead of creating and inserting
1085 !bkey_cmp(insert->k.p, k.k->p) &&
1086 !bkey_cmp(bkey_start_pos(&insert->k), bkey_start_pos(k.k))) {
1087 if (!bkey_whiteout(k.k)) {
1088 btree_account_key_drop(l->b, _k);
1089 _k->type = KEY_TYPE_discard;
1090 reserve_whiteout(l->b, _k);
1095 if (k.k->needs_whiteout || bkey_written(l->b, _k)) {
1096 insert->k.needs_whiteout = true;
1097 s->update_btree = true;
1100 if (s->update_btree &&
1101 overlap == BCH_EXTENT_OVERLAP_ALL &&
1102 bkey_whiteout(k.k) &&
1103 k.k->needs_whiteout) {
1104 unreserve_whiteout(l->b, _k);
1105 _k->needs_whiteout = false;
1108 extent_squash(c, iter, insert, _k, k, overlap);
1110 if (!s->update_btree)
1111 bch2_cut_front(cur_end, insert);
1113 if (overlap == BCH_EXTENT_OVERLAP_FRONT ||
1114 overlap == BCH_EXTENT_OVERLAP_MIDDLE)
1119 * may have skipped past some deleted extents greater than the insert
1120 * key, before we got to a non deleted extent and knew we could bail out
1121 * rewind the iterator a bit if necessary:
1124 struct btree_node_iter node_iter = l->iter;
1126 while ((_k = bch2_btree_node_iter_prev_all(&node_iter, l->b)) &&
1127 bkey_cmp_left_packed(l->b, _k, &insert->k.p) > 0)
1128 l->iter = node_iter;
1133 * bch_extent_insert_fixup - insert a new extent and deal with overlaps
1135 * this may result in not actually doing the insert, or inserting some subset
1136 * of the insert key. For cmpxchg operations this is where that logic lives.
1138 * All subsets of @insert that need to be inserted are inserted using
1139 * bch2_btree_insert_and_journal(). If @b or @res fills up, this function
1140 * returns false, setting @iter->pos for the prefix of @insert that actually got
1143 * BSET INVARIANTS: this function is responsible for maintaining all the
1144 * invariants for bsets of extents in memory. things get really hairy with 0
1149 * bkey_start_pos(bkey_next(k)) >= k
1150 * or bkey_start_offset(bkey_next(k)) >= k->offset
1152 * i.e. strict ordering, no overlapping extents.
1154 * multiple bsets (i.e. full btree node):
1157 * k.size != 0 ∧ j.size != 0 →
1158 * ¬ (k > bkey_start_pos(j) ∧ k < j)
1160 * i.e. no two overlapping keys _of nonzero size_
1162 * We can't realistically maintain this invariant for zero size keys because of
1163 * the key merging done in bch2_btree_insert_key() - for two mergeable keys k, j
1164 * there may be another 0 size key between them in another bset, and it will
1165 * thus overlap with the merged key.
1167 * In addition, the end of iter->pos indicates how much has been processed.
1168 * If the end of iter->pos is not the same as the end of insert, then
1169 * key insertion needs to continue/be retried.
1171 void bch2_insert_fixup_extent(struct btree_trans *trans,
1172 struct btree_insert_entry *insert)
1174 struct bch_fs *c = trans->c;
1175 struct btree_iter *iter = insert->iter;
1176 struct extent_insert_state s = {
1177 .whiteout = *insert->k,
1178 .update_journal = !bkey_whiteout(&insert->k->k),
1179 .update_btree = !bkey_whiteout(&insert->k->k),
1180 .deleting = bkey_whiteout(&insert->k->k),
1184 EBUG_ON(iter->level);
1185 EBUG_ON(!insert->k->k.size);
1186 EBUG_ON(bkey_cmp(iter->pos, bkey_start_pos(&insert->k->k)));
1188 __bch2_insert_fixup_extent(c, iter, insert->k, &s);
1190 bch2_btree_iter_set_pos_same_leaf(iter, insert->k->k.p);
1192 if (s.update_btree) {
1193 bkey_copy(&tmp.k, insert->k);
1196 tmp.k.k.type = KEY_TYPE_discard;
1198 /* disabled due to lock recursion - mark_lock: */
1199 if (debug_check_bkeys(c))
1200 bch2_bkey_debugcheck(c, iter->l[0].b,
1201 bkey_i_to_s_c(&tmp.k));
1203 EBUG_ON(bkey_deleted(&tmp.k.k) || !tmp.k.k.size);
1205 extent_bset_insert(c, iter, &tmp.k);
1208 if (s.update_journal) {
1209 bkey_copy(&tmp.k, !s.deleting ? insert->k : &s.whiteout);
1212 tmp.k.k.type = KEY_TYPE_discard;
1214 EBUG_ON(bkey_deleted(&tmp.k.k) || !tmp.k.k.size);
1216 bch2_btree_journal_key(trans, iter, &tmp.k);
1219 bch2_cut_front(insert->k->k.p, insert->k);
1222 const char *bch2_extent_invalid(const struct bch_fs *c, struct bkey_s_c k)
1224 struct bkey_s_c_extent e = bkey_s_c_to_extent(k);
1225 const union bch_extent_entry *entry;
1226 struct bch_extent_crc_unpacked crc;
1227 const struct bch_extent_ptr *ptr;
1228 unsigned size_ondisk = e.k->size;
1230 unsigned nonce = UINT_MAX;
1232 if (bkey_val_u64s(e.k) > BKEY_EXTENT_VAL_U64s_MAX)
1233 return "value too big";
1235 extent_for_each_entry(e, entry) {
1236 if (__extent_entry_type(entry) >= BCH_EXTENT_ENTRY_MAX)
1237 return "invalid extent entry type";
1239 switch (extent_entry_type(entry)) {
1240 case BCH_EXTENT_ENTRY_ptr:
1241 ptr = entry_to_ptr(entry);
1243 reason = extent_ptr_invalid(c, e.s_c, &entry->ptr,
1244 size_ondisk, false);
1248 case BCH_EXTENT_ENTRY_crc32:
1249 case BCH_EXTENT_ENTRY_crc64:
1250 case BCH_EXTENT_ENTRY_crc128:
1251 crc = bch2_extent_crc_unpack(e.k, entry_to_crc(entry));
1253 if (crc.offset + e.k->size >
1254 crc.uncompressed_size)
1255 return "checksum offset + key size > uncompressed size";
1257 size_ondisk = crc.compressed_size;
1259 if (!bch2_checksum_type_valid(c, crc.csum_type))
1260 return "invalid checksum type";
1262 if (crc.compression_type >= BCH_COMPRESSION_NR)
1263 return "invalid compression type";
1265 if (bch2_csum_type_is_encryption(crc.csum_type)) {
1266 if (nonce == UINT_MAX)
1267 nonce = crc.offset + crc.nonce;
1268 else if (nonce != crc.offset + crc.nonce)
1269 return "incorrect nonce";
1272 case BCH_EXTENT_ENTRY_stripe_ptr:
1280 void bch2_extent_debugcheck(struct bch_fs *c, struct btree *b,
1283 struct bkey_s_c_extent e = bkey_s_c_to_extent(k);
1284 const union bch_extent_entry *entry;
1285 struct extent_ptr_decoded p;
1289 * XXX: we should be doing most/all of these checks at startup time,
1290 * where we check bch2_bkey_invalid() in btree_node_read_done()
1292 * But note that we can't check for stale pointers or incorrect gc marks
1293 * until after journal replay is done (it might be an extent that's
1294 * going to get overwritten during replay)
1297 bch2_fs_bug_on(!test_bit(BCH_FS_REBUILD_REPLICAS, &c->flags) &&
1298 !bch2_bkey_replicas_marked(c, e.s_c, false), c,
1299 "extent key bad (replicas not marked in superblock):\n%s",
1300 (bch2_bkey_val_to_text(&PBUF(buf), c, e.s_c), buf));
1303 * If journal replay hasn't finished, we might be seeing keys
1304 * that will be overwritten by the time journal replay is done:
1306 if (!test_bit(JOURNAL_REPLAY_DONE, &c->journal.flags))
1309 extent_for_each_ptr_decode(e, p, entry) {
1310 struct bch_dev *ca = bch_dev_bkey_exists(c, p.ptr.dev);
1311 struct bucket_mark mark = ptr_bucket_mark(ca, &p.ptr);
1312 unsigned stale = gen_after(mark.gen, p.ptr.gen);
1313 unsigned disk_sectors = ptr_disk_sectors(p);
1314 unsigned mark_sectors = p.ptr.cached
1315 ? mark.cached_sectors
1316 : mark.dirty_sectors;
1318 bch2_fs_bug_on(stale && !p.ptr.cached, c,
1319 "stale dirty pointer (ptr gen %u bucket %u",
1320 p.ptr.gen, mark.gen);
1322 bch2_fs_bug_on(stale > 96, c, "key too stale: %i", stale);
1324 bch2_fs_bug_on(!stale &&
1325 (mark.data_type != BCH_DATA_USER ||
1326 mark_sectors < disk_sectors), c,
1327 "extent pointer not marked: %s:\n"
1328 "type %u sectors %u < %u",
1329 (bch2_bkey_val_to_text(&PBUF(buf), c, e.s_c), buf),
1331 mark_sectors, disk_sectors);
1335 void bch2_extent_to_text(struct printbuf *out, struct bch_fs *c,
1338 const char *invalid;
1340 bkey_ptrs_to_text(out, c, k);
1342 invalid = bch2_extent_invalid(c, k);
1344 pr_buf(out, " invalid: %s", invalid);
1347 static void bch2_extent_crc_init(union bch_extent_crc *crc,
1348 struct bch_extent_crc_unpacked new)
1350 #define common_fields(_crc) \
1351 .csum_type = _crc.csum_type, \
1352 .compression_type = _crc.compression_type, \
1353 ._compressed_size = _crc.compressed_size - 1, \
1354 ._uncompressed_size = _crc.uncompressed_size - 1, \
1355 .offset = _crc.offset
1357 if (bch_crc_bytes[new.csum_type] <= 4 &&
1358 new.uncompressed_size <= CRC32_SIZE_MAX &&
1359 new.nonce <= CRC32_NONCE_MAX) {
1360 crc->crc32 = (struct bch_extent_crc32) {
1361 .type = 1 << BCH_EXTENT_ENTRY_crc32,
1363 .csum = *((__le32 *) &new.csum.lo),
1368 if (bch_crc_bytes[new.csum_type] <= 10 &&
1369 new.uncompressed_size <= CRC64_SIZE_MAX &&
1370 new.nonce <= CRC64_NONCE_MAX) {
1371 crc->crc64 = (struct bch_extent_crc64) {
1372 .type = 1 << BCH_EXTENT_ENTRY_crc64,
1375 .csum_lo = new.csum.lo,
1376 .csum_hi = *((__le16 *) &new.csum.hi),
1381 if (bch_crc_bytes[new.csum_type] <= 16 &&
1382 new.uncompressed_size <= CRC128_SIZE_MAX &&
1383 new.nonce <= CRC128_NONCE_MAX) {
1384 crc->crc128 = (struct bch_extent_crc128) {
1385 .type = 1 << BCH_EXTENT_ENTRY_crc128,
1392 #undef common_fields
1396 void bch2_extent_crc_append(struct bkey_i_extent *e,
1397 struct bch_extent_crc_unpacked new)
1399 bch2_extent_crc_init((void *) extent_entry_last(extent_i_to_s(e)), new);
1400 __extent_entry_push(e);
1403 static inline void __extent_entry_insert(struct bkey_i_extent *e,
1404 union bch_extent_entry *dst,
1405 union bch_extent_entry *new)
1407 union bch_extent_entry *end = extent_entry_last(extent_i_to_s(e));
1409 memmove_u64s_up((u64 *) dst + extent_entry_u64s(new),
1410 dst, (u64 *) end - (u64 *) dst);
1411 e->k.u64s += extent_entry_u64s(new);
1412 memcpy_u64s_small(dst, new, extent_entry_u64s(new));
1415 void bch2_extent_ptr_decoded_append(struct bkey_i_extent *e,
1416 struct extent_ptr_decoded *p)
1418 struct bch_extent_crc_unpacked crc = bch2_extent_crc_unpack(&e->k, NULL);
1419 union bch_extent_entry *pos;
1422 if (!bch2_crc_unpacked_cmp(crc, p->crc)) {
1427 extent_for_each_crc(extent_i_to_s(e), crc, pos)
1428 if (!bch2_crc_unpacked_cmp(crc, p->crc)) {
1429 pos = extent_entry_next(pos);
1433 bch2_extent_crc_append(e, p->crc);
1434 pos = extent_entry_last(extent_i_to_s(e));
1436 p->ptr.type = 1 << BCH_EXTENT_ENTRY_ptr;
1437 __extent_entry_insert(e, pos, to_entry(&p->ptr));
1439 for (i = 0; i < p->ec_nr; i++) {
1440 p->ec[i].type = 1 << BCH_EXTENT_ENTRY_stripe_ptr;
1441 __extent_entry_insert(e, pos, to_entry(&p->ec[i]));
1446 * bch_extent_normalize - clean up an extent, dropping stale pointers etc.
1448 * Returns true if @k should be dropped entirely
1450 * For existing keys, only called when btree nodes are being rewritten, not when
1451 * they're merely being compacted/resorted in memory.
1453 bool bch2_extent_normalize(struct bch_fs *c, struct bkey_s k)
1455 struct bch_extent_ptr *ptr;
1457 bch2_bkey_drop_ptrs(k, ptr,
1459 ptr_stale(bch_dev_bkey_exists(c, ptr->dev), ptr));
1461 /* will only happen if all pointers were cached: */
1462 if (!bkey_val_u64s(k.k))
1463 k.k->type = KEY_TYPE_deleted;
1468 void bch2_extent_mark_replicas_cached(struct bch_fs *c,
1469 struct bkey_s_extent e,
1471 unsigned nr_desired_replicas)
1473 union bch_extent_entry *entry;
1474 struct extent_ptr_decoded p;
1475 int extra = bch2_bkey_durability(c, e.s_c) - nr_desired_replicas;
1477 if (target && extra > 0)
1478 extent_for_each_ptr_decode(e, p, entry) {
1479 int n = bch2_extent_ptr_durability(c, p);
1481 if (n && n <= extra &&
1482 !bch2_dev_in_target(c, p.ptr.dev, target)) {
1483 entry->ptr.cached = true;
1489 extent_for_each_ptr_decode(e, p, entry) {
1490 int n = bch2_extent_ptr_durability(c, p);
1492 if (n && n <= extra) {
1493 entry->ptr.cached = true;
1499 enum merge_result bch2_extent_merge(struct bch_fs *c,
1500 struct bkey_i *l, struct bkey_i *r)
1502 struct bkey_s_extent el = bkey_i_to_s_extent(l);
1503 struct bkey_s_extent er = bkey_i_to_s_extent(r);
1504 union bch_extent_entry *en_l, *en_r;
1506 if (bkey_val_u64s(&l->k) != bkey_val_u64s(&r->k))
1507 return BCH_MERGE_NOMERGE;
1509 extent_for_each_entry(el, en_l) {
1510 struct bch_extent_ptr *lp, *rp;
1513 en_r = vstruct_idx(er.v, (u64 *) en_l - el.v->_data);
1515 if ((extent_entry_type(en_l) !=
1516 extent_entry_type(en_r)) ||
1517 !extent_entry_is_ptr(en_l))
1518 return BCH_MERGE_NOMERGE;
1523 if (lp->offset + el.k->size != rp->offset ||
1524 lp->dev != rp->dev ||
1526 return BCH_MERGE_NOMERGE;
1528 /* We don't allow extents to straddle buckets: */
1529 ca = bch_dev_bkey_exists(c, lp->dev);
1531 if (PTR_BUCKET_NR(ca, lp) != PTR_BUCKET_NR(ca, rp))
1532 return BCH_MERGE_NOMERGE;
1535 l->k.needs_whiteout |= r->k.needs_whiteout;
1537 /* Keys with no pointers aren't restricted to one bucket and could
1540 if ((u64) l->k.size + r->k.size > KEY_SIZE_MAX) {
1541 bch2_key_resize(&l->k, KEY_SIZE_MAX);
1542 bch2_cut_front(l->k.p, r);
1543 return BCH_MERGE_PARTIAL;
1546 bch2_key_resize(&l->k, l->k.size + r->k.size);
1548 return BCH_MERGE_MERGE;
1552 * When merging an extent that we're inserting into a btree node, the new merged
1553 * extent could overlap with an existing 0 size extent - if we don't fix that,
1554 * it'll break the btree node iterator so this code finds those 0 size extents
1555 * and shifts them out of the way.
1557 * Also unpacks and repacks.
1559 static bool bch2_extent_merge_inline(struct bch_fs *c,
1560 struct btree_iter *iter,
1561 struct bkey_packed *l,
1562 struct bkey_packed *r,
1565 struct btree *b = iter->l[0].b;
1566 struct btree_node_iter *node_iter = &iter->l[0].iter;
1567 BKEY_PADDED(k) li, ri;
1568 struct bkey_packed *m = back_merge ? l : r;
1569 struct bkey_i *mi = back_merge ? &li.k : &ri.k;
1570 struct bset_tree *t = bch2_bkey_to_bset(b, m);
1571 enum merge_result ret;
1573 EBUG_ON(bkey_written(b, m));
1576 * We need to save copies of both l and r, because we might get a
1577 * partial merge (which modifies both) and then fails to repack
1579 bch2_bkey_unpack(b, &li.k, l);
1580 bch2_bkey_unpack(b, &ri.k, r);
1582 ret = bch2_bkey_merge(c, &li.k, &ri.k);
1583 if (ret == BCH_MERGE_NOMERGE)
1587 * check if we overlap with deleted extents - would break the sort
1591 struct bkey_packed *n = bkey_next(m);
1593 if (n != btree_bkey_last(b, t) &&
1594 bkey_cmp_left_packed(b, n, &li.k.k.p) <= 0 &&
1597 } else if (ret == BCH_MERGE_MERGE) {
1598 struct bkey_packed *prev = bch2_bkey_prev_all(b, t, m);
1601 bkey_cmp_left_packed_byval(b, prev,
1602 bkey_start_pos(&li.k.k)) > 0)
1606 if (ret == BCH_MERGE_PARTIAL) {
1607 if (!extent_i_save(b, m, mi))
1611 bkey_copy(packed_to_bkey(l), &li.k);
1613 bkey_copy(packed_to_bkey(r), &ri.k);
1615 if (!extent_i_save(b, m, &li.k))
1619 bch2_bset_fix_invalidated_key(b, m);
1620 bch2_btree_node_iter_fix(iter, b, node_iter,
1621 m, m->u64s, m->u64s);
1622 verify_modified_extent(iter, m);
1624 return ret == BCH_MERGE_MERGE;
1627 bool bch2_check_range_allocated(struct bch_fs *c, struct bpos pos, u64 size,
1628 unsigned nr_replicas)
1630 struct btree_trans trans;
1631 struct btree_iter *iter;
1632 struct bpos end = pos;
1638 bch2_trans_init(&trans, c);
1640 for_each_btree_key(&trans, iter, BTREE_ID_EXTENTS, pos,
1641 BTREE_ITER_SLOTS, k) {
1642 if (bkey_cmp(bkey_start_pos(k.k), end) >= 0)
1645 if (nr_replicas > bch2_bkey_nr_ptrs_allocated(k)) {
1650 bch2_trans_exit(&trans);
1655 unsigned bch2_bkey_nr_ptrs_allocated(struct bkey_s_c k)
1659 switch (k.k->type) {
1660 case KEY_TYPE_extent: {
1661 struct bkey_s_c_extent e = bkey_s_c_to_extent(k);
1662 const union bch_extent_entry *entry;
1663 struct extent_ptr_decoded p;
1665 extent_for_each_ptr_decode(e, p, entry)
1666 ret += !p.ptr.cached &&
1667 p.crc.compression_type == BCH_COMPRESSION_NONE;
1670 case KEY_TYPE_reservation:
1671 ret = bkey_s_c_to_reservation(k).v->nr_replicas;
1678 /* KEY_TYPE_reservation: */
1680 const char *bch2_reservation_invalid(const struct bch_fs *c, struct bkey_s_c k)
1682 struct bkey_s_c_reservation r = bkey_s_c_to_reservation(k);
1684 if (bkey_val_bytes(k.k) != sizeof(struct bch_reservation))
1685 return "incorrect value size";
1687 if (!r.v->nr_replicas || r.v->nr_replicas > BCH_REPLICAS_MAX)
1688 return "invalid nr_replicas";
1693 void bch2_reservation_to_text(struct printbuf *out, struct bch_fs *c,
1696 struct bkey_s_c_reservation r = bkey_s_c_to_reservation(k);
1698 pr_buf(out, "generation %u replicas %u",
1699 le32_to_cpu(r.v->generation),
1703 enum merge_result bch2_reservation_merge(struct bch_fs *c,
1704 struct bkey_i *l, struct bkey_i *r)
1706 struct bkey_i_reservation *li = bkey_i_to_reservation(l);
1707 struct bkey_i_reservation *ri = bkey_i_to_reservation(r);
1709 if (li->v.generation != ri->v.generation ||
1710 li->v.nr_replicas != ri->v.nr_replicas)
1711 return BCH_MERGE_NOMERGE;
1713 l->k.needs_whiteout |= r->k.needs_whiteout;
1715 /* Keys with no pointers aren't restricted to one bucket and could
1718 if ((u64) l->k.size + r->k.size > KEY_SIZE_MAX) {
1719 bch2_key_resize(&l->k, KEY_SIZE_MAX);
1720 bch2_cut_front(l->k.p, r);
1721 return BCH_MERGE_PARTIAL;
1724 bch2_key_resize(&l->k, l->k.size + r->k.size);
1726 return BCH_MERGE_MERGE;