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"
13 #include "btree_iter.h"
18 #include "disk_groups.h"
29 static unsigned bch2_crc_field_size_max[] = {
30 [BCH_EXTENT_ENTRY_crc32] = CRC32_SIZE_MAX,
31 [BCH_EXTENT_ENTRY_crc64] = CRC64_SIZE_MAX,
32 [BCH_EXTENT_ENTRY_crc128] = CRC128_SIZE_MAX,
35 static void bch2_extent_crc_pack(union bch_extent_crc *,
36 struct bch_extent_crc_unpacked,
37 enum bch_extent_entry_type);
39 static struct bch_dev_io_failures *dev_io_failures(struct bch_io_failures *f,
42 struct bch_dev_io_failures *i;
44 for (i = f->devs; i < f->devs + f->nr; i++)
51 void bch2_mark_io_failure(struct bch_io_failures *failed,
52 struct extent_ptr_decoded *p)
54 struct bch_dev_io_failures *f = dev_io_failures(failed, p->ptr.dev);
57 BUG_ON(failed->nr >= ARRAY_SIZE(failed->devs));
59 f = &failed->devs[failed->nr++];
64 } else if (p->idx != f->idx) {
74 * returns true if p1 is better than p2:
76 static inline bool ptr_better(struct bch_fs *c,
77 const struct extent_ptr_decoded p1,
78 const struct extent_ptr_decoded p2)
80 if (likely(!p1.idx && !p2.idx)) {
81 struct bch_dev *dev1 = bch_dev_bkey_exists(c, p1.ptr.dev);
82 struct bch_dev *dev2 = bch_dev_bkey_exists(c, p2.ptr.dev);
84 u64 l1 = atomic64_read(&dev1->cur_latency[READ]);
85 u64 l2 = atomic64_read(&dev2->cur_latency[READ]);
87 /* Pick at random, biased in favor of the faster device: */
89 return bch2_rand_range(l1 + l2) > l1;
92 if (bch2_force_reconstruct_read)
93 return p1.idx > p2.idx;
95 return p1.idx < p2.idx;
99 * This picks a non-stale pointer, preferably from a device other than @avoid.
100 * Avoid can be NULL, meaning pick any. If there are no non-stale pointers to
101 * other devices, it will still pick a pointer from avoid.
103 int bch2_bkey_pick_read_device(struct bch_fs *c, struct bkey_s_c k,
104 struct bch_io_failures *failed,
105 struct extent_ptr_decoded *pick)
107 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
108 const union bch_extent_entry *entry;
109 struct extent_ptr_decoded p;
110 struct bch_dev_io_failures *f;
114 if (k.k->type == KEY_TYPE_error)
117 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
119 * Unwritten extent: no need to actually read, treat it as a
120 * hole and return 0s:
125 ca = bch_dev_bkey_exists(c, p.ptr.dev);
128 * If there are any dirty pointers it's an error if we can't
131 if (!ret && !p.ptr.cached)
134 if (p.ptr.cached && ptr_stale(ca, &p.ptr))
137 f = failed ? dev_io_failures(failed, p.ptr.dev) : NULL;
139 p.idx = f->nr_failed < f->nr_retries
144 !bch2_dev_is_readable(ca))
147 if (bch2_force_reconstruct_read &&
151 if (p.idx >= (unsigned) p.has_ec + 1)
154 if (ret > 0 && !ptr_better(c, p, *pick))
164 /* KEY_TYPE_btree_ptr: */
166 int bch2_btree_ptr_invalid(struct bch_fs *c, struct bkey_s_c k,
167 enum bkey_invalid_flags flags,
168 struct printbuf *err)
172 bkey_fsck_err_on(bkey_val_u64s(k.k) > BCH_REPLICAS_MAX, c, err,
173 btree_ptr_val_too_big,
174 "value too big (%zu > %u)", bkey_val_u64s(k.k), BCH_REPLICAS_MAX);
176 ret = bch2_bkey_ptrs_invalid(c, k, flags, err);
181 void bch2_btree_ptr_to_text(struct printbuf *out, struct bch_fs *c,
184 bch2_bkey_ptrs_to_text(out, c, k);
187 int bch2_btree_ptr_v2_invalid(struct bch_fs *c, struct bkey_s_c k,
188 enum bkey_invalid_flags flags,
189 struct printbuf *err)
193 bkey_fsck_err_on(bkey_val_u64s(k.k) > BKEY_BTREE_PTR_VAL_U64s_MAX, c, err,
194 btree_ptr_v2_val_too_big,
195 "value too big (%zu > %zu)",
196 bkey_val_u64s(k.k), BKEY_BTREE_PTR_VAL_U64s_MAX);
198 ret = bch2_bkey_ptrs_invalid(c, k, flags, err);
203 void bch2_btree_ptr_v2_to_text(struct printbuf *out, struct bch_fs *c,
206 struct bkey_s_c_btree_ptr_v2 bp = bkey_s_c_to_btree_ptr_v2(k);
208 prt_printf(out, "seq %llx written %u min_key %s",
209 le64_to_cpu(bp.v->seq),
210 le16_to_cpu(bp.v->sectors_written),
211 BTREE_PTR_RANGE_UPDATED(bp.v) ? "R " : "");
213 bch2_bpos_to_text(out, bp.v->min_key);
214 prt_printf(out, " ");
215 bch2_bkey_ptrs_to_text(out, c, k);
218 void bch2_btree_ptr_v2_compat(enum btree_id btree_id, unsigned version,
219 unsigned big_endian, int write,
222 struct bkey_s_btree_ptr_v2 bp = bkey_s_to_btree_ptr_v2(k);
224 compat_bpos(0, btree_id, version, big_endian, write, &bp.v->min_key);
226 if (version < bcachefs_metadata_version_inode_btree_change &&
227 btree_id_is_extents(btree_id) &&
228 !bkey_eq(bp.v->min_key, POS_MIN))
229 bp.v->min_key = write
230 ? bpos_nosnap_predecessor(bp.v->min_key)
231 : bpos_nosnap_successor(bp.v->min_key);
234 /* KEY_TYPE_extent: */
236 bool bch2_extent_merge(struct bch_fs *c, struct bkey_s l, struct bkey_s_c r)
238 struct bkey_ptrs l_ptrs = bch2_bkey_ptrs(l);
239 struct bkey_ptrs_c r_ptrs = bch2_bkey_ptrs_c(r);
240 union bch_extent_entry *en_l;
241 const union bch_extent_entry *en_r;
242 struct extent_ptr_decoded lp, rp;
248 while (en_l < l_ptrs.end && en_r < r_ptrs.end) {
249 if (extent_entry_type(en_l) != extent_entry_type(en_r))
252 en_l = extent_entry_next(en_l);
253 en_r = extent_entry_next(en_r);
256 if (en_l < l_ptrs.end || en_r < r_ptrs.end)
261 lp.crc = bch2_extent_crc_unpack(l.k, NULL);
262 rp.crc = bch2_extent_crc_unpack(r.k, NULL);
264 while (__bkey_ptr_next_decode(l.k, l_ptrs.end, lp, en_l) &&
265 __bkey_ptr_next_decode(r.k, r_ptrs.end, rp, en_r)) {
266 if (lp.ptr.offset + lp.crc.offset + lp.crc.live_size !=
267 rp.ptr.offset + rp.crc.offset ||
268 lp.ptr.dev != rp.ptr.dev ||
269 lp.ptr.gen != rp.ptr.gen ||
270 lp.ptr.unwritten != rp.ptr.unwritten ||
271 lp.has_ec != rp.has_ec)
274 /* Extents may not straddle buckets: */
275 ca = bch_dev_bkey_exists(c, lp.ptr.dev);
276 if (PTR_BUCKET_NR(ca, &lp.ptr) != PTR_BUCKET_NR(ca, &rp.ptr))
279 if (lp.has_ec != rp.has_ec ||
281 (lp.ec.block != rp.ec.block ||
282 lp.ec.redundancy != rp.ec.redundancy ||
283 lp.ec.idx != rp.ec.idx)))
286 if (lp.crc.compression_type != rp.crc.compression_type ||
287 lp.crc.nonce != rp.crc.nonce)
290 if (lp.crc.offset + lp.crc.live_size + rp.crc.live_size <=
291 lp.crc.uncompressed_size) {
292 /* can use left extent's crc entry */
293 } else if (lp.crc.live_size <= rp.crc.offset) {
294 /* can use right extent's crc entry */
296 /* check if checksums can be merged: */
297 if (lp.crc.csum_type != rp.crc.csum_type ||
298 lp.crc.nonce != rp.crc.nonce ||
299 crc_is_compressed(lp.crc) ||
300 !bch2_checksum_mergeable(lp.crc.csum_type))
303 if (lp.crc.offset + lp.crc.live_size != lp.crc.compressed_size ||
307 if (lp.crc.csum_type &&
308 lp.crc.uncompressed_size +
309 rp.crc.uncompressed_size > (c->opts.encoded_extent_max >> 9))
313 en_l = extent_entry_next(en_l);
314 en_r = extent_entry_next(en_r);
319 while (en_l < l_ptrs.end && en_r < r_ptrs.end) {
320 if (extent_entry_is_crc(en_l)) {
321 struct bch_extent_crc_unpacked crc_l = bch2_extent_crc_unpack(l.k, entry_to_crc(en_l));
322 struct bch_extent_crc_unpacked crc_r = bch2_extent_crc_unpack(r.k, entry_to_crc(en_r));
324 if (crc_l.uncompressed_size + crc_r.uncompressed_size >
325 bch2_crc_field_size_max[extent_entry_type(en_l)])
329 en_l = extent_entry_next(en_l);
330 en_r = extent_entry_next(en_r);
333 use_right_ptr = false;
336 while (en_l < l_ptrs.end) {
337 if (extent_entry_type(en_l) == BCH_EXTENT_ENTRY_ptr &&
339 en_l->ptr = en_r->ptr;
341 if (extent_entry_is_crc(en_l)) {
342 struct bch_extent_crc_unpacked crc_l =
343 bch2_extent_crc_unpack(l.k, entry_to_crc(en_l));
344 struct bch_extent_crc_unpacked crc_r =
345 bch2_extent_crc_unpack(r.k, entry_to_crc(en_r));
347 use_right_ptr = false;
349 if (crc_l.offset + crc_l.live_size + crc_r.live_size <=
350 crc_l.uncompressed_size) {
351 /* can use left extent's crc entry */
352 } else if (crc_l.live_size <= crc_r.offset) {
353 /* can use right extent's crc entry */
354 crc_r.offset -= crc_l.live_size;
355 bch2_extent_crc_pack(entry_to_crc(en_l), crc_r,
356 extent_entry_type(en_l));
357 use_right_ptr = true;
359 crc_l.csum = bch2_checksum_merge(crc_l.csum_type,
362 crc_r.uncompressed_size << 9);
364 crc_l.uncompressed_size += crc_r.uncompressed_size;
365 crc_l.compressed_size += crc_r.compressed_size;
366 bch2_extent_crc_pack(entry_to_crc(en_l), crc_l,
367 extent_entry_type(en_l));
371 en_l = extent_entry_next(en_l);
372 en_r = extent_entry_next(en_r);
375 bch2_key_resize(l.k, l.k->size + r.k->size);
379 /* KEY_TYPE_reservation: */
381 int bch2_reservation_invalid(struct bch_fs *c, struct bkey_s_c k,
382 enum bkey_invalid_flags flags,
383 struct printbuf *err)
385 struct bkey_s_c_reservation r = bkey_s_c_to_reservation(k);
388 bkey_fsck_err_on(!r.v->nr_replicas || r.v->nr_replicas > BCH_REPLICAS_MAX, c, err,
389 reservation_key_nr_replicas_invalid,
390 "invalid nr_replicas (%u)", r.v->nr_replicas);
395 void bch2_reservation_to_text(struct printbuf *out, struct bch_fs *c,
398 struct bkey_s_c_reservation r = bkey_s_c_to_reservation(k);
400 prt_printf(out, "generation %u replicas %u",
401 le32_to_cpu(r.v->generation),
405 bool bch2_reservation_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r)
407 struct bkey_s_reservation l = bkey_s_to_reservation(_l);
408 struct bkey_s_c_reservation r = bkey_s_c_to_reservation(_r);
410 if (l.v->generation != r.v->generation ||
411 l.v->nr_replicas != r.v->nr_replicas)
414 bch2_key_resize(l.k, l.k->size + r.k->size);
418 /* Extent checksum entries: */
420 /* returns true if not equal */
421 static inline bool bch2_crc_unpacked_cmp(struct bch_extent_crc_unpacked l,
422 struct bch_extent_crc_unpacked r)
424 return (l.csum_type != r.csum_type ||
425 l.compression_type != r.compression_type ||
426 l.compressed_size != r.compressed_size ||
427 l.uncompressed_size != r.uncompressed_size ||
428 l.offset != r.offset ||
429 l.live_size != r.live_size ||
430 l.nonce != r.nonce ||
431 bch2_crc_cmp(l.csum, r.csum));
434 static inline bool can_narrow_crc(struct bch_extent_crc_unpacked u,
435 struct bch_extent_crc_unpacked n)
437 return !crc_is_compressed(u) &&
439 u.uncompressed_size > u.live_size &&
440 bch2_csum_type_is_encryption(u.csum_type) ==
441 bch2_csum_type_is_encryption(n.csum_type);
444 bool bch2_can_narrow_extent_crcs(struct bkey_s_c k,
445 struct bch_extent_crc_unpacked n)
447 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
448 struct bch_extent_crc_unpacked crc;
449 const union bch_extent_entry *i;
454 bkey_for_each_crc(k.k, ptrs, crc, i)
455 if (can_narrow_crc(crc, n))
462 * We're writing another replica for this extent, so while we've got the data in
463 * memory we'll be computing a new checksum for the currently live data.
465 * If there are other replicas we aren't moving, and they are checksummed but
466 * not compressed, we can modify them to point to only the data that is
467 * currently live (so that readers won't have to bounce) while we've got the
470 bool bch2_bkey_narrow_crcs(struct bkey_i *k, struct bch_extent_crc_unpacked n)
472 struct bkey_ptrs ptrs = bch2_bkey_ptrs(bkey_i_to_s(k));
473 struct bch_extent_crc_unpacked u;
474 struct extent_ptr_decoded p;
475 union bch_extent_entry *i;
478 /* Find a checksum entry that covers only live data: */
480 bkey_for_each_crc(&k->k, ptrs, u, i)
481 if (!crc_is_compressed(u) &&
483 u.live_size == u.uncompressed_size) {
490 BUG_ON(crc_is_compressed(n));
492 BUG_ON(n.live_size != k->k.size);
494 restart_narrow_pointers:
495 ptrs = bch2_bkey_ptrs(bkey_i_to_s(k));
497 bkey_for_each_ptr_decode(&k->k, ptrs, p, i)
498 if (can_narrow_crc(p.crc, n)) {
499 bch2_bkey_drop_ptr_noerror(bkey_i_to_s(k), &i->ptr);
500 p.ptr.offset += p.crc.offset;
502 bch2_extent_ptr_decoded_append(k, &p);
504 goto restart_narrow_pointers;
510 static void bch2_extent_crc_pack(union bch_extent_crc *dst,
511 struct bch_extent_crc_unpacked src,
512 enum bch_extent_entry_type type)
514 #define set_common_fields(_dst, _src) \
515 _dst.type = 1 << type; \
516 _dst.csum_type = _src.csum_type, \
517 _dst.compression_type = _src.compression_type, \
518 _dst._compressed_size = _src.compressed_size - 1, \
519 _dst._uncompressed_size = _src.uncompressed_size - 1, \
520 _dst.offset = _src.offset
523 case BCH_EXTENT_ENTRY_crc32:
524 set_common_fields(dst->crc32, src);
525 dst->crc32.csum = (u32 __force) *((__le32 *) &src.csum.lo);
527 case BCH_EXTENT_ENTRY_crc64:
528 set_common_fields(dst->crc64, src);
529 dst->crc64.nonce = src.nonce;
530 dst->crc64.csum_lo = (u64 __force) src.csum.lo;
531 dst->crc64.csum_hi = (u64 __force) *((__le16 *) &src.csum.hi);
533 case BCH_EXTENT_ENTRY_crc128:
534 set_common_fields(dst->crc128, src);
535 dst->crc128.nonce = src.nonce;
536 dst->crc128.csum = src.csum;
541 #undef set_common_fields
544 void bch2_extent_crc_append(struct bkey_i *k,
545 struct bch_extent_crc_unpacked new)
547 struct bkey_ptrs ptrs = bch2_bkey_ptrs(bkey_i_to_s(k));
548 union bch_extent_crc *crc = (void *) ptrs.end;
549 enum bch_extent_entry_type type;
551 if (bch_crc_bytes[new.csum_type] <= 4 &&
552 new.uncompressed_size <= CRC32_SIZE_MAX &&
553 new.nonce <= CRC32_NONCE_MAX)
554 type = BCH_EXTENT_ENTRY_crc32;
555 else if (bch_crc_bytes[new.csum_type] <= 10 &&
556 new.uncompressed_size <= CRC64_SIZE_MAX &&
557 new.nonce <= CRC64_NONCE_MAX)
558 type = BCH_EXTENT_ENTRY_crc64;
559 else if (bch_crc_bytes[new.csum_type] <= 16 &&
560 new.uncompressed_size <= CRC128_SIZE_MAX &&
561 new.nonce <= CRC128_NONCE_MAX)
562 type = BCH_EXTENT_ENTRY_crc128;
566 bch2_extent_crc_pack(crc, new, type);
568 k->k.u64s += extent_entry_u64s(ptrs.end);
570 EBUG_ON(bkey_val_u64s(&k->k) > BKEY_EXTENT_VAL_U64s_MAX);
573 /* Generic code for keys with pointers: */
575 unsigned bch2_bkey_nr_ptrs(struct bkey_s_c k)
577 return bch2_bkey_devs(k).nr;
580 unsigned bch2_bkey_nr_ptrs_allocated(struct bkey_s_c k)
582 return k.k->type == KEY_TYPE_reservation
583 ? bkey_s_c_to_reservation(k).v->nr_replicas
584 : bch2_bkey_dirty_devs(k).nr;
587 unsigned bch2_bkey_nr_ptrs_fully_allocated(struct bkey_s_c k)
591 if (k.k->type == KEY_TYPE_reservation) {
592 ret = bkey_s_c_to_reservation(k).v->nr_replicas;
594 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
595 const union bch_extent_entry *entry;
596 struct extent_ptr_decoded p;
598 bkey_for_each_ptr_decode(k.k, ptrs, p, entry)
599 ret += !p.ptr.cached && !crc_is_compressed(p.crc);
605 unsigned bch2_bkey_sectors_compressed(struct bkey_s_c k)
607 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
608 const union bch_extent_entry *entry;
609 struct extent_ptr_decoded p;
612 bkey_for_each_ptr_decode(k.k, ptrs, p, entry)
613 if (!p.ptr.cached && crc_is_compressed(p.crc))
614 ret += p.crc.compressed_size;
619 bool bch2_bkey_is_incompressible(struct bkey_s_c k)
621 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
622 const union bch_extent_entry *entry;
623 struct bch_extent_crc_unpacked crc;
625 bkey_for_each_crc(k.k, ptrs, crc, entry)
626 if (crc.compression_type == BCH_COMPRESSION_TYPE_incompressible)
631 unsigned bch2_bkey_replicas(struct bch_fs *c, struct bkey_s_c k)
633 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
634 const union bch_extent_entry *entry;
635 struct extent_ptr_decoded p = { 0 };
636 unsigned replicas = 0;
638 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
643 replicas += p.ec.redundancy;
652 unsigned bch2_extent_ptr_desired_durability(struct bch_fs *c, struct extent_ptr_decoded *p)
659 ca = bch_dev_bkey_exists(c, p->ptr.dev);
661 return ca->mi.durability +
667 unsigned bch2_extent_ptr_durability(struct bch_fs *c, struct extent_ptr_decoded *p)
674 ca = bch_dev_bkey_exists(c, p->ptr.dev);
676 if (ca->mi.state == BCH_MEMBER_STATE_failed)
679 return ca->mi.durability +
685 unsigned bch2_bkey_durability(struct bch_fs *c, struct bkey_s_c k)
687 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
688 const union bch_extent_entry *entry;
689 struct extent_ptr_decoded p;
690 unsigned durability = 0;
692 bkey_for_each_ptr_decode(k.k, ptrs, p, entry)
693 durability += bch2_extent_ptr_durability(c, &p);
698 static unsigned bch2_bkey_durability_safe(struct bch_fs *c, struct bkey_s_c k)
700 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
701 const union bch_extent_entry *entry;
702 struct extent_ptr_decoded p;
703 unsigned durability = 0;
705 bkey_for_each_ptr_decode(k.k, ptrs, p, entry)
706 if (p.ptr.dev < c->sb.nr_devices && c->devs[p.ptr.dev])
707 durability += bch2_extent_ptr_durability(c, &p);
712 void bch2_bkey_extent_entry_drop(struct bkey_i *k, union bch_extent_entry *entry)
714 union bch_extent_entry *end = bkey_val_end(bkey_i_to_s(k));
715 union bch_extent_entry *next = extent_entry_next(entry);
717 memmove_u64s(entry, next, (u64 *) end - (u64 *) next);
718 k->k.u64s -= extent_entry_u64s(entry);
721 void bch2_extent_ptr_decoded_append(struct bkey_i *k,
722 struct extent_ptr_decoded *p)
724 struct bkey_ptrs ptrs = bch2_bkey_ptrs(bkey_i_to_s(k));
725 struct bch_extent_crc_unpacked crc =
726 bch2_extent_crc_unpack(&k->k, NULL);
727 union bch_extent_entry *pos;
729 if (!bch2_crc_unpacked_cmp(crc, p->crc)) {
734 bkey_for_each_crc(&k->k, ptrs, crc, pos)
735 if (!bch2_crc_unpacked_cmp(crc, p->crc)) {
736 pos = extent_entry_next(pos);
740 bch2_extent_crc_append(k, p->crc);
741 pos = bkey_val_end(bkey_i_to_s(k));
743 p->ptr.type = 1 << BCH_EXTENT_ENTRY_ptr;
744 __extent_entry_insert(k, pos, to_entry(&p->ptr));
747 p->ec.type = 1 << BCH_EXTENT_ENTRY_stripe_ptr;
748 __extent_entry_insert(k, pos, to_entry(&p->ec));
752 static union bch_extent_entry *extent_entry_prev(struct bkey_ptrs ptrs,
753 union bch_extent_entry *entry)
755 union bch_extent_entry *i = ptrs.start;
760 while (extent_entry_next(i) != entry)
761 i = extent_entry_next(i);
766 * Returns pointer to the next entry after the one being dropped:
768 union bch_extent_entry *bch2_bkey_drop_ptr_noerror(struct bkey_s k,
769 struct bch_extent_ptr *ptr)
771 struct bkey_ptrs ptrs = bch2_bkey_ptrs(k);
772 union bch_extent_entry *entry = to_entry(ptr), *next;
773 union bch_extent_entry *ret = entry;
774 bool drop_crc = true;
776 EBUG_ON(ptr < &ptrs.start->ptr ||
777 ptr >= &ptrs.end->ptr);
778 EBUG_ON(ptr->type != 1 << BCH_EXTENT_ENTRY_ptr);
780 for (next = extent_entry_next(entry);
782 next = extent_entry_next(next)) {
783 if (extent_entry_is_crc(next)) {
785 } else if (extent_entry_is_ptr(next)) {
791 extent_entry_drop(k, entry);
793 while ((entry = extent_entry_prev(ptrs, entry))) {
794 if (extent_entry_is_ptr(entry))
797 if ((extent_entry_is_crc(entry) && drop_crc) ||
798 extent_entry_is_stripe_ptr(entry)) {
799 ret = (void *) ret - extent_entry_bytes(entry);
800 extent_entry_drop(k, entry);
807 union bch_extent_entry *bch2_bkey_drop_ptr(struct bkey_s k,
808 struct bch_extent_ptr *ptr)
810 bool have_dirty = bch2_bkey_dirty_devs(k.s_c).nr;
811 union bch_extent_entry *ret =
812 bch2_bkey_drop_ptr_noerror(k, ptr);
815 * If we deleted all the dirty pointers and there's still cached
816 * pointers, we could set the cached pointers to dirty if they're not
817 * stale - but to do that correctly we'd need to grab an open_bucket
818 * reference so that we don't race with bucket reuse:
821 !bch2_bkey_dirty_devs(k.s_c).nr) {
822 k.k->type = KEY_TYPE_error;
823 set_bkey_val_u64s(k.k, 0);
825 } else if (!bch2_bkey_nr_ptrs(k.s_c)) {
826 k.k->type = KEY_TYPE_deleted;
827 set_bkey_val_u64s(k.k, 0);
834 void bch2_bkey_drop_device(struct bkey_s k, unsigned dev)
836 struct bch_extent_ptr *ptr;
838 bch2_bkey_drop_ptrs(k, ptr, ptr->dev == dev);
841 void bch2_bkey_drop_device_noerror(struct bkey_s k, unsigned dev)
843 struct bch_extent_ptr *ptr = bch2_bkey_has_device(k, dev);
846 bch2_bkey_drop_ptr_noerror(k, ptr);
849 const struct bch_extent_ptr *bch2_bkey_has_device_c(struct bkey_s_c k, unsigned dev)
851 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
852 const struct bch_extent_ptr *ptr;
854 bkey_for_each_ptr(ptrs, ptr)
861 bool bch2_bkey_has_target(struct bch_fs *c, struct bkey_s_c k, unsigned target)
863 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
864 const struct bch_extent_ptr *ptr;
866 bkey_for_each_ptr(ptrs, ptr)
867 if (bch2_dev_in_target(c, ptr->dev, target) &&
869 !ptr_stale(bch_dev_bkey_exists(c, ptr->dev), ptr)))
875 bool bch2_bkey_matches_ptr(struct bch_fs *c, struct bkey_s_c k,
876 struct bch_extent_ptr m, u64 offset)
878 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
879 const union bch_extent_entry *entry;
880 struct extent_ptr_decoded p;
882 bkey_for_each_ptr_decode(k.k, ptrs, p, entry)
883 if (p.ptr.dev == m.dev &&
884 p.ptr.gen == m.gen &&
885 (s64) p.ptr.offset + p.crc.offset - bkey_start_offset(k.k) ==
886 (s64) m.offset - offset)
893 * Returns true if two extents refer to the same data:
895 bool bch2_extents_match(struct bkey_s_c k1, struct bkey_s_c k2)
897 if (k1.k->type != k2.k->type)
900 if (bkey_extent_is_direct_data(k1.k)) {
901 struct bkey_ptrs_c ptrs1 = bch2_bkey_ptrs_c(k1);
902 struct bkey_ptrs_c ptrs2 = bch2_bkey_ptrs_c(k2);
903 const union bch_extent_entry *entry1, *entry2;
904 struct extent_ptr_decoded p1, p2;
906 if (bkey_extent_is_unwritten(k1) != bkey_extent_is_unwritten(k2))
909 bkey_for_each_ptr_decode(k1.k, ptrs1, p1, entry1)
910 bkey_for_each_ptr_decode(k2.k, ptrs2, p2, entry2)
911 if (p1.ptr.dev == p2.ptr.dev &&
912 p1.ptr.gen == p2.ptr.gen &&
913 (s64) p1.ptr.offset + p1.crc.offset - bkey_start_offset(k1.k) ==
914 (s64) p2.ptr.offset + p2.crc.offset - bkey_start_offset(k2.k))
919 /* KEY_TYPE_deleted, etc. */
924 struct bch_extent_ptr *
925 bch2_extent_has_ptr(struct bkey_s_c k1, struct extent_ptr_decoded p1, struct bkey_s k2)
927 struct bkey_ptrs ptrs2 = bch2_bkey_ptrs(k2);
928 union bch_extent_entry *entry2;
929 struct extent_ptr_decoded p2;
931 bkey_for_each_ptr_decode(k2.k, ptrs2, p2, entry2)
932 if (p1.ptr.dev == p2.ptr.dev &&
933 p1.ptr.gen == p2.ptr.gen &&
934 (s64) p1.ptr.offset + p1.crc.offset - bkey_start_offset(k1.k) ==
935 (s64) p2.ptr.offset + p2.crc.offset - bkey_start_offset(k2.k))
941 void bch2_extent_ptr_set_cached(struct bkey_s k, struct bch_extent_ptr *ptr)
943 struct bkey_ptrs ptrs = bch2_bkey_ptrs(k);
944 union bch_extent_entry *entry;
945 union bch_extent_entry *ec = NULL;
947 bkey_extent_entry_for_each(ptrs, entry) {
948 if (&entry->ptr == ptr) {
951 extent_entry_drop(k, ec);
955 if (extent_entry_is_stripe_ptr(entry))
957 else if (extent_entry_is_ptr(entry))
965 * bch_extent_normalize - clean up an extent, dropping stale pointers etc.
967 * Returns true if @k should be dropped entirely
969 * For existing keys, only called when btree nodes are being rewritten, not when
970 * they're merely being compacted/resorted in memory.
972 bool bch2_extent_normalize(struct bch_fs *c, struct bkey_s k)
974 struct bch_extent_ptr *ptr;
976 bch2_bkey_drop_ptrs(k, ptr,
978 ptr_stale(bch_dev_bkey_exists(c, ptr->dev), ptr));
980 return bkey_deleted(k.k);
983 void bch2_bkey_ptrs_to_text(struct printbuf *out, struct bch_fs *c,
986 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
987 const union bch_extent_entry *entry;
991 prt_printf(out, "durability: %u ", bch2_bkey_durability_safe(c, k));
993 bkey_extent_entry_for_each(ptrs, entry) {
995 prt_printf(out, " ");
997 switch (__extent_entry_type(entry)) {
998 case BCH_EXTENT_ENTRY_ptr: {
999 const struct bch_extent_ptr *ptr = entry_to_ptr(entry);
1000 struct bch_dev *ca = c && ptr->dev < c->sb.nr_devices && c->devs[ptr->dev]
1001 ? bch_dev_bkey_exists(c, ptr->dev)
1005 prt_printf(out, "ptr: %u:%llu gen %u%s", ptr->dev,
1006 (u64) ptr->offset, ptr->gen,
1007 ptr->cached ? " cached" : "");
1010 u64 b = sector_to_bucket_and_offset(ca, ptr->offset, &offset);
1012 prt_printf(out, "ptr: %u:%llu:%u gen %u",
1013 ptr->dev, b, offset, ptr->gen);
1015 prt_str(out, " cached");
1017 prt_str(out, " unwritten");
1018 if (ca && ptr_stale(ca, ptr))
1019 prt_printf(out, " stale");
1023 case BCH_EXTENT_ENTRY_crc32:
1024 case BCH_EXTENT_ENTRY_crc64:
1025 case BCH_EXTENT_ENTRY_crc128: {
1026 struct bch_extent_crc_unpacked crc =
1027 bch2_extent_crc_unpack(k.k, entry_to_crc(entry));
1029 prt_printf(out, "crc: c_size %u size %u offset %u nonce %u csum %s compress %s",
1030 crc.compressed_size,
1031 crc.uncompressed_size,
1032 crc.offset, crc.nonce,
1033 bch2_csum_types[crc.csum_type],
1034 bch2_compression_types[crc.compression_type]);
1037 case BCH_EXTENT_ENTRY_stripe_ptr: {
1038 const struct bch_extent_stripe_ptr *ec = &entry->stripe_ptr;
1040 prt_printf(out, "ec: idx %llu block %u",
1041 (u64) ec->idx, ec->block);
1044 case BCH_EXTENT_ENTRY_rebalance: {
1045 const struct bch_extent_rebalance *r = &entry->rebalance;
1047 prt_str(out, "rebalance: target ");
1049 bch2_target_to_text(out, c, r->target);
1051 prt_printf(out, "%u", r->target);
1052 prt_str(out, " compression ");
1053 bch2_compression_opt_to_text(out, r->compression);
1057 prt_printf(out, "(invalid extent entry %.16llx)", *((u64 *) entry));
1065 static int extent_ptr_invalid(struct bch_fs *c,
1067 enum bkey_invalid_flags flags,
1068 const struct bch_extent_ptr *ptr,
1069 unsigned size_ondisk,
1071 struct printbuf *err)
1073 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
1074 const struct bch_extent_ptr *ptr2;
1080 if (!bch2_dev_exists2(c, ptr->dev)) {
1082 * If we're in the write path this key might have already been
1083 * overwritten, and we could be seeing a device that doesn't
1084 * exist anymore due to racing with device removal:
1086 if (flags & BKEY_INVALID_WRITE)
1089 bkey_fsck_err(c, err, ptr_to_invalid_device,
1090 "pointer to invalid device (%u)", ptr->dev);
1093 ca = bch_dev_bkey_exists(c, ptr->dev);
1094 bkey_for_each_ptr(ptrs, ptr2)
1095 bkey_fsck_err_on(ptr != ptr2 && ptr->dev == ptr2->dev, c, err,
1096 ptr_to_duplicate_device,
1097 "multiple pointers to same device (%u)", ptr->dev);
1099 bucket = sector_to_bucket_and_offset(ca, ptr->offset, &bucket_offset);
1101 bkey_fsck_err_on(bucket >= ca->mi.nbuckets, c, err,
1102 ptr_after_last_bucket,
1103 "pointer past last bucket (%llu > %llu)", bucket, ca->mi.nbuckets);
1104 bkey_fsck_err_on(ptr->offset < bucket_to_sector(ca, ca->mi.first_bucket), c, err,
1105 ptr_before_first_bucket,
1106 "pointer before first bucket (%llu < %u)", bucket, ca->mi.first_bucket);
1107 bkey_fsck_err_on(bucket_offset + size_ondisk > ca->mi.bucket_size, c, err,
1108 ptr_spans_multiple_buckets,
1109 "pointer spans multiple buckets (%u + %u > %u)",
1110 bucket_offset, size_ondisk, ca->mi.bucket_size);
1115 int bch2_bkey_ptrs_invalid(struct bch_fs *c, struct bkey_s_c k,
1116 enum bkey_invalid_flags flags,
1117 struct printbuf *err)
1119 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
1120 const union bch_extent_entry *entry;
1121 struct bch_extent_crc_unpacked crc;
1122 unsigned size_ondisk = k.k->size;
1123 unsigned nonce = UINT_MAX;
1124 unsigned nr_ptrs = 0;
1125 bool have_written = false, have_unwritten = false, have_ec = false, crc_since_last_ptr = false;
1128 if (bkey_is_btree_ptr(k.k))
1129 size_ondisk = btree_sectors(c);
1131 bkey_extent_entry_for_each(ptrs, entry) {
1132 bkey_fsck_err_on(__extent_entry_type(entry) >= BCH_EXTENT_ENTRY_MAX, c, err,
1133 extent_ptrs_invalid_entry,
1134 "invalid extent entry type (got %u, max %u)",
1135 __extent_entry_type(entry), BCH_EXTENT_ENTRY_MAX);
1137 bkey_fsck_err_on(bkey_is_btree_ptr(k.k) &&
1138 !extent_entry_is_ptr(entry), c, err,
1139 btree_ptr_has_non_ptr,
1140 "has non ptr field");
1142 switch (extent_entry_type(entry)) {
1143 case BCH_EXTENT_ENTRY_ptr:
1144 ret = extent_ptr_invalid(c, k, flags, &entry->ptr,
1145 size_ondisk, false, err);
1149 bkey_fsck_err_on(entry->ptr.cached && have_ec, c, err,
1150 ptr_cached_and_erasure_coded,
1151 "cached, erasure coded ptr");
1153 if (!entry->ptr.unwritten)
1154 have_written = true;
1156 have_unwritten = true;
1159 crc_since_last_ptr = false;
1162 case BCH_EXTENT_ENTRY_crc32:
1163 case BCH_EXTENT_ENTRY_crc64:
1164 case BCH_EXTENT_ENTRY_crc128:
1165 crc = bch2_extent_crc_unpack(k.k, entry_to_crc(entry));
1167 bkey_fsck_err_on(crc.offset + crc.live_size > crc.uncompressed_size, c, err,
1168 ptr_crc_uncompressed_size_too_small,
1169 "checksum offset + key size > uncompressed size");
1170 bkey_fsck_err_on(!bch2_checksum_type_valid(c, crc.csum_type), c, err,
1171 ptr_crc_csum_type_unknown,
1172 "invalid checksum type");
1173 bkey_fsck_err_on(crc.compression_type >= BCH_COMPRESSION_TYPE_NR, c, err,
1174 ptr_crc_compression_type_unknown,
1175 "invalid compression type");
1177 if (bch2_csum_type_is_encryption(crc.csum_type)) {
1178 if (nonce == UINT_MAX)
1179 nonce = crc.offset + crc.nonce;
1180 else if (nonce != crc.offset + crc.nonce)
1181 bkey_fsck_err(c, err, ptr_crc_nonce_mismatch,
1185 bkey_fsck_err_on(crc_since_last_ptr, c, err,
1187 "redundant crc entry");
1188 crc_since_last_ptr = true;
1190 bkey_fsck_err_on(crc_is_encoded(crc) &&
1191 (crc.uncompressed_size > c->opts.encoded_extent_max >> 9) &&
1192 (flags & (BKEY_INVALID_WRITE|BKEY_INVALID_COMMIT)), c, err,
1193 ptr_crc_uncompressed_size_too_big,
1194 "too large encoded extent");
1196 size_ondisk = crc.compressed_size;
1198 case BCH_EXTENT_ENTRY_stripe_ptr:
1199 bkey_fsck_err_on(have_ec, c, err,
1200 ptr_stripe_redundant,
1201 "redundant stripe entry");
1204 case BCH_EXTENT_ENTRY_rebalance: {
1205 const struct bch_extent_rebalance *r = &entry->rebalance;
1207 if (!bch2_compression_opt_valid(r->compression)) {
1208 struct bch_compression_opt opt = __bch2_compression_decode(r->compression);
1209 prt_printf(err, "invalid compression opt %u:%u",
1210 opt.type, opt.level);
1211 return -BCH_ERR_invalid_bkey;
1218 bkey_fsck_err_on(!nr_ptrs, c, err,
1219 extent_ptrs_no_ptrs,
1221 bkey_fsck_err_on(nr_ptrs > BCH_BKEY_PTRS_MAX, c, err,
1222 extent_ptrs_too_many_ptrs,
1223 "too many ptrs: %u > %u", nr_ptrs, BCH_BKEY_PTRS_MAX);
1224 bkey_fsck_err_on(have_written && have_unwritten, c, err,
1225 extent_ptrs_written_and_unwritten,
1226 "extent with unwritten and written ptrs");
1227 bkey_fsck_err_on(k.k->type != KEY_TYPE_extent && have_unwritten, c, err,
1228 extent_ptrs_unwritten,
1229 "has unwritten ptrs");
1230 bkey_fsck_err_on(crc_since_last_ptr, c, err,
1231 extent_ptrs_redundant_crc,
1232 "redundant crc entry");
1233 bkey_fsck_err_on(have_ec, c, err,
1234 extent_ptrs_redundant_stripe,
1235 "redundant stripe entry");
1240 void bch2_ptr_swab(struct bkey_s k)
1242 struct bkey_ptrs ptrs = bch2_bkey_ptrs(k);
1243 union bch_extent_entry *entry;
1246 for (d = (u64 *) ptrs.start;
1247 d != (u64 *) ptrs.end;
1251 for (entry = ptrs.start;
1253 entry = extent_entry_next(entry)) {
1254 switch (extent_entry_type(entry)) {
1255 case BCH_EXTENT_ENTRY_ptr:
1257 case BCH_EXTENT_ENTRY_crc32:
1258 entry->crc32.csum = swab32(entry->crc32.csum);
1260 case BCH_EXTENT_ENTRY_crc64:
1261 entry->crc64.csum_hi = swab16(entry->crc64.csum_hi);
1262 entry->crc64.csum_lo = swab64(entry->crc64.csum_lo);
1264 case BCH_EXTENT_ENTRY_crc128:
1265 entry->crc128.csum.hi = (__force __le64)
1266 swab64((__force u64) entry->crc128.csum.hi);
1267 entry->crc128.csum.lo = (__force __le64)
1268 swab64((__force u64) entry->crc128.csum.lo);
1270 case BCH_EXTENT_ENTRY_stripe_ptr:
1272 case BCH_EXTENT_ENTRY_rebalance:
1278 const struct bch_extent_rebalance *bch2_bkey_rebalance_opts(struct bkey_s_c k)
1280 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
1281 const union bch_extent_entry *entry;
1283 bkey_extent_entry_for_each(ptrs, entry)
1284 if (__extent_entry_type(entry) == BCH_EXTENT_ENTRY_rebalance)
1285 return &entry->rebalance;
1290 unsigned bch2_bkey_ptrs_need_rebalance(struct bch_fs *c, struct bkey_s_c k,
1291 unsigned target, unsigned compression)
1293 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
1294 unsigned rewrite_ptrs = 0;
1297 unsigned compression_type = bch2_compression_opt_to_type(compression);
1298 const union bch_extent_entry *entry;
1299 struct extent_ptr_decoded p;
1302 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
1303 if (p.crc.compression_type == BCH_COMPRESSION_TYPE_incompressible) {
1305 goto incompressible;
1308 if (!p.ptr.cached && p.crc.compression_type != compression_type)
1309 rewrite_ptrs |= 1U << i;
1314 if (target && bch2_target_accepts_data(c, BCH_DATA_user, target)) {
1315 const struct bch_extent_ptr *ptr;
1318 bkey_for_each_ptr(ptrs, ptr) {
1319 if (!ptr->cached && !bch2_dev_in_target(c, ptr->dev, target))
1320 rewrite_ptrs |= 1U << i;
1325 return rewrite_ptrs;
1328 bool bch2_bkey_needs_rebalance(struct bch_fs *c, struct bkey_s_c k)
1330 const struct bch_extent_rebalance *r = bch2_bkey_rebalance_opts(k);
1333 * If it's an indirect extent, we don't delete the rebalance entry when
1334 * done so that we know what options were applied - check if it still
1338 k.k->type == KEY_TYPE_reflink_v &&
1339 !bch2_bkey_ptrs_need_rebalance(c, k, r->target, r->compression))
1345 int bch2_bkey_set_needs_rebalance(struct bch_fs *c, struct bkey_i *_k,
1346 unsigned target, unsigned compression)
1348 struct bkey_s k = bkey_i_to_s(_k);
1349 struct bch_extent_rebalance *r;
1350 bool needs_rebalance;
1352 if (!bkey_extent_is_direct_data(k.k))
1355 /* get existing rebalance entry: */
1356 r = (struct bch_extent_rebalance *) bch2_bkey_rebalance_opts(k.s_c);
1358 if (k.k->type == KEY_TYPE_reflink_v) {
1360 * indirect extents: existing options take precedence,
1361 * so that we don't move extents back and forth if
1362 * they're referenced by different inodes with different
1368 compression = r->compression;
1372 r->compression = compression;
1375 needs_rebalance = bch2_bkey_ptrs_need_rebalance(c, k.s_c, target, compression);
1377 if (needs_rebalance && !r) {
1378 union bch_extent_entry *new = bkey_val_end(k);
1380 new->rebalance.type = 1U << BCH_EXTENT_ENTRY_rebalance;
1381 new->rebalance.compression = compression;
1382 new->rebalance.target = target;
1383 new->rebalance.unused = 0;
1384 k.k->u64s += extent_entry_u64s(new);
1385 } else if (!needs_rebalance && r && k.k->type != KEY_TYPE_reflink_v) {
1387 * For indirect extents, don't delete the rebalance entry when
1388 * we're finished so that we know we specifically moved it or
1389 * compressed it to its current location/compression type
1391 extent_entry_drop(k, (union bch_extent_entry *) r);
1397 /* Generic extent code: */
1399 int bch2_cut_front_s(struct bpos where, struct bkey_s k)
1401 unsigned new_val_u64s = bkey_val_u64s(k.k);
1405 if (bkey_le(where, bkey_start_pos(k.k)))
1408 EBUG_ON(bkey_gt(where, k.k->p));
1410 sub = where.offset - bkey_start_offset(k.k);
1415 k.k->type = KEY_TYPE_deleted;
1419 switch (k.k->type) {
1420 case KEY_TYPE_extent:
1421 case KEY_TYPE_reflink_v: {
1422 struct bkey_ptrs ptrs = bch2_bkey_ptrs(k);
1423 union bch_extent_entry *entry;
1424 bool seen_crc = false;
1426 bkey_extent_entry_for_each(ptrs, entry) {
1427 switch (extent_entry_type(entry)) {
1428 case BCH_EXTENT_ENTRY_ptr:
1430 entry->ptr.offset += sub;
1432 case BCH_EXTENT_ENTRY_crc32:
1433 entry->crc32.offset += sub;
1435 case BCH_EXTENT_ENTRY_crc64:
1436 entry->crc64.offset += sub;
1438 case BCH_EXTENT_ENTRY_crc128:
1439 entry->crc128.offset += sub;
1441 case BCH_EXTENT_ENTRY_stripe_ptr:
1443 case BCH_EXTENT_ENTRY_rebalance:
1447 if (extent_entry_is_crc(entry))
1453 case KEY_TYPE_reflink_p: {
1454 struct bkey_s_reflink_p p = bkey_s_to_reflink_p(k);
1456 le64_add_cpu(&p.v->idx, sub);
1459 case KEY_TYPE_inline_data:
1460 case KEY_TYPE_indirect_inline_data: {
1461 void *p = bkey_inline_data_p(k);
1462 unsigned bytes = bkey_inline_data_bytes(k.k);
1464 sub = min_t(u64, sub << 9, bytes);
1466 memmove(p, p + sub, bytes - sub);
1468 new_val_u64s -= sub >> 3;
1473 val_u64s_delta = bkey_val_u64s(k.k) - new_val_u64s;
1474 BUG_ON(val_u64s_delta < 0);
1476 set_bkey_val_u64s(k.k, new_val_u64s);
1477 memset(bkey_val_end(k), 0, val_u64s_delta * sizeof(u64));
1478 return -val_u64s_delta;
1481 int bch2_cut_back_s(struct bpos where, struct bkey_s k)
1483 unsigned new_val_u64s = bkey_val_u64s(k.k);
1487 if (bkey_ge(where, k.k->p))
1490 EBUG_ON(bkey_lt(where, bkey_start_pos(k.k)));
1492 len = where.offset - bkey_start_offset(k.k);
1494 k.k->p.offset = where.offset;
1498 k.k->type = KEY_TYPE_deleted;
1502 switch (k.k->type) {
1503 case KEY_TYPE_inline_data:
1504 case KEY_TYPE_indirect_inline_data:
1505 new_val_u64s = (bkey_inline_data_offset(k.k) +
1506 min(bkey_inline_data_bytes(k.k), k.k->size << 9)) >> 3;
1510 val_u64s_delta = bkey_val_u64s(k.k) - new_val_u64s;
1511 BUG_ON(val_u64s_delta < 0);
1513 set_bkey_val_u64s(k.k, new_val_u64s);
1514 memset(bkey_val_end(k), 0, val_u64s_delta * sizeof(u64));
1515 return -val_u64s_delta;