1 // SPDX-License-Identifier: GPL-2.0
3 * Code for manipulating bucket marks for garbage collection.
5 * Copyright 2014 Datera, Inc.
8 * - free bucket: mark == 0
9 * The bucket contains no data and will not be read
11 * - allocator bucket: owned_by_allocator == 1
12 * The bucket is on a free list, or it is an open bucket
14 * - cached bucket: owned_by_allocator == 0 &&
15 * dirty_sectors == 0 &&
17 * The bucket contains data but may be safely discarded as there are
18 * enough replicas of the data on other cache devices, or it has been
19 * written back to the backing device
21 * - dirty bucket: owned_by_allocator == 0 &&
23 * The bucket contains data that we must not discard (either only copy,
24 * or one of the 'main copies' for data requiring multiple replicas)
26 * - metadata bucket: owned_by_allocator == 0 && is_metadata == 1
27 * This is a btree node, journal or gen/prio bucket
31 * bucket invalidated => bucket on freelist => open bucket =>
32 * [dirty bucket =>] cached bucket => bucket invalidated => ...
34 * Note that cache promotion can skip the dirty bucket step, as data
35 * is copied from a deeper tier to a shallower tier, onto a cached
37 * Note also that a cached bucket can spontaneously become dirty --
40 * Only a traversal of the key space can determine whether a bucket is
41 * truly dirty or cached.
45 * - free => allocator: bucket was invalidated
46 * - cached => allocator: bucket was invalidated
48 * - allocator => dirty: open bucket was filled up
49 * - allocator => cached: open bucket was filled up
50 * - allocator => metadata: metadata was allocated
52 * - dirty => cached: dirty sectors were copied to a deeper tier
53 * - dirty => free: dirty sectors were overwritten or moved (copy gc)
54 * - cached => free: cached sectors were overwritten
56 * - metadata => free: metadata was freed
59 * - cached => dirty: a device was removed so formerly replicated data
60 * is no longer sufficiently replicated
61 * - free => cached: cannot happen
62 * - free => dirty: cannot happen
63 * - free => metadata: cannot happen
67 #include "alloc_background.h"
70 #include "btree_update.h"
77 #include <linux/preempt.h>
78 #include <trace/events/bcachefs.h>
81 * Clear journal_seq_valid for buckets for which it's not needed, to prevent
84 void bch2_bucket_seq_cleanup(struct bch_fs *c)
86 u64 journal_seq = atomic64_read(&c->journal.seq);
87 u16 last_seq_ondisk = c->journal.last_seq_ondisk;
89 struct bucket_array *buckets;
94 if (journal_seq - c->last_bucket_seq_cleanup <
95 (1U << (BUCKET_JOURNAL_SEQ_BITS - 2)))
98 c->last_bucket_seq_cleanup = journal_seq;
100 for_each_member_device(ca, c, i) {
101 down_read(&ca->bucket_lock);
102 buckets = bucket_array(ca);
104 for_each_bucket(g, buckets) {
105 bucket_cmpxchg(g, m, ({
106 if (!m.journal_seq_valid ||
107 bucket_needs_journal_commit(m, last_seq_ondisk))
110 m.journal_seq_valid = 0;
113 up_read(&ca->bucket_lock);
117 void bch2_fs_usage_initialize(struct bch_fs *c)
119 struct bch_fs_usage *usage;
122 percpu_down_write(&c->mark_lock);
123 usage = c->usage_base;
125 bch2_fs_usage_acc_to_base(c, 0);
126 bch2_fs_usage_acc_to_base(c, 1);
128 for (i = 0; i < BCH_REPLICAS_MAX; i++)
129 usage->reserved += usage->persistent_reserved[i];
131 for (i = 0; i < c->replicas.nr; i++) {
132 struct bch_replicas_entry *e =
133 cpu_replicas_entry(&c->replicas, i);
135 switch (e->data_type) {
137 usage->btree += usage->replicas[i];
140 usage->data += usage->replicas[i];
142 case BCH_DATA_CACHED:
143 usage->cached += usage->replicas[i];
148 percpu_up_write(&c->mark_lock);
151 void bch2_fs_usage_scratch_put(struct bch_fs *c, struct bch_fs_usage *fs_usage)
153 if (fs_usage == c->usage_scratch)
154 mutex_unlock(&c->usage_scratch_lock);
159 struct bch_fs_usage *bch2_fs_usage_scratch_get(struct bch_fs *c)
161 struct bch_fs_usage *ret;
162 unsigned bytes = fs_usage_u64s(c) * sizeof(u64);
164 ret = kzalloc(bytes, GFP_NOWAIT);
168 if (mutex_trylock(&c->usage_scratch_lock))
171 ret = kzalloc(bytes, GFP_NOFS);
175 mutex_lock(&c->usage_scratch_lock);
177 ret = c->usage_scratch;
178 memset(ret, 0, bytes);
182 struct bch_dev_usage bch2_dev_usage_read(struct bch_fs *c, struct bch_dev *ca)
184 struct bch_dev_usage ret;
186 memset(&ret, 0, sizeof(ret));
187 acc_u64s_percpu((u64 *) &ret,
188 (u64 __percpu *) ca->usage[0],
189 sizeof(ret) / sizeof(u64));
194 static inline struct bch_fs_usage *fs_usage_ptr(struct bch_fs *c,
195 unsigned journal_seq,
198 return this_cpu_ptr(gc
200 : c->usage[journal_seq & 1]);
203 u64 bch2_fs_usage_read_one(struct bch_fs *c, u64 *v)
205 ssize_t offset = v - (u64 *) c->usage_base;
209 BUG_ON(offset < 0 || offset >= fs_usage_u64s(c));
210 percpu_rwsem_assert_held(&c->mark_lock);
213 seq = read_seqcount_begin(&c->usage_lock);
215 percpu_u64_get((u64 __percpu *) c->usage[0] + offset) +
216 percpu_u64_get((u64 __percpu *) c->usage[1] + offset);
217 } while (read_seqcount_retry(&c->usage_lock, seq));
222 struct bch_fs_usage *bch2_fs_usage_read(struct bch_fs *c)
224 struct bch_fs_usage *ret;
225 unsigned seq, v, u64s = fs_usage_u64s(c);
227 ret = kmalloc(u64s * sizeof(u64), GFP_NOFS);
231 percpu_down_read(&c->mark_lock);
233 v = fs_usage_u64s(c);
234 if (unlikely(u64s != v)) {
236 percpu_up_read(&c->mark_lock);
242 seq = read_seqcount_begin(&c->usage_lock);
243 memcpy(ret, c->usage_base, u64s * sizeof(u64));
244 acc_u64s_percpu((u64 *) ret, (u64 __percpu *) c->usage[0], u64s);
245 acc_u64s_percpu((u64 *) ret, (u64 __percpu *) c->usage[1], u64s);
246 } while (read_seqcount_retry(&c->usage_lock, seq));
251 void bch2_fs_usage_acc_to_base(struct bch_fs *c, unsigned idx)
253 unsigned u64s = fs_usage_u64s(c);
257 write_seqcount_begin(&c->usage_lock);
259 acc_u64s_percpu((u64 *) c->usage_base,
260 (u64 __percpu *) c->usage[idx], u64s);
261 percpu_memset(c->usage[idx], 0, u64s * sizeof(u64));
263 write_seqcount_end(&c->usage_lock);
266 void bch2_fs_usage_to_text(struct printbuf *out,
268 struct bch_fs_usage *fs_usage)
272 pr_buf(out, "capacity:\t\t\t%llu\n", c->capacity);
274 pr_buf(out, "hidden:\t\t\t\t%llu\n",
276 pr_buf(out, "data:\t\t\t\t%llu\n",
278 pr_buf(out, "cached:\t\t\t\t%llu\n",
280 pr_buf(out, "reserved:\t\t\t%llu\n",
282 pr_buf(out, "nr_inodes:\t\t\t%llu\n",
283 fs_usage->nr_inodes);
284 pr_buf(out, "online reserved:\t\t%llu\n",
285 fs_usage->online_reserved);
288 i < ARRAY_SIZE(fs_usage->persistent_reserved);
290 pr_buf(out, "%u replicas:\n", i + 1);
291 pr_buf(out, "\treserved:\t\t%llu\n",
292 fs_usage->persistent_reserved[i]);
295 for (i = 0; i < c->replicas.nr; i++) {
296 struct bch_replicas_entry *e =
297 cpu_replicas_entry(&c->replicas, i);
300 bch2_replicas_entry_to_text(out, e);
301 pr_buf(out, ":\t%llu\n", fs_usage->replicas[i]);
305 #define RESERVE_FACTOR 6
307 static u64 reserve_factor(u64 r)
309 return r + (round_up(r, (1 << RESERVE_FACTOR)) >> RESERVE_FACTOR);
312 static u64 avail_factor(u64 r)
314 return (r << RESERVE_FACTOR) / ((1 << RESERVE_FACTOR) + 1);
317 u64 bch2_fs_sectors_used(struct bch_fs *c, struct bch_fs_usage *fs_usage)
319 return min(fs_usage->hidden +
322 reserve_factor(fs_usage->reserved +
323 fs_usage->online_reserved),
327 static struct bch_fs_usage_short
328 __bch2_fs_usage_read_short(struct bch_fs *c)
330 struct bch_fs_usage_short ret;
333 ret.capacity = c->capacity -
334 bch2_fs_usage_read_one(c, &c->usage_base->hidden);
336 data = bch2_fs_usage_read_one(c, &c->usage_base->data) +
337 bch2_fs_usage_read_one(c, &c->usage_base->btree);
338 reserved = bch2_fs_usage_read_one(c, &c->usage_base->reserved) +
339 bch2_fs_usage_read_one(c, &c->usage_base->online_reserved);
341 ret.used = min(ret.capacity, data + reserve_factor(reserved));
342 ret.free = ret.capacity - ret.used;
344 ret.nr_inodes = bch2_fs_usage_read_one(c, &c->usage_base->nr_inodes);
349 struct bch_fs_usage_short
350 bch2_fs_usage_read_short(struct bch_fs *c)
352 struct bch_fs_usage_short ret;
354 percpu_down_read(&c->mark_lock);
355 ret = __bch2_fs_usage_read_short(c);
356 percpu_up_read(&c->mark_lock);
361 static inline int is_unavailable_bucket(struct bucket_mark m)
363 return !is_available_bucket(m);
366 static inline int is_fragmented_bucket(struct bucket_mark m,
369 if (!m.owned_by_allocator &&
370 m.data_type == BCH_DATA_USER &&
371 bucket_sectors_used(m))
372 return max_t(int, 0, (int) ca->mi.bucket_size -
373 bucket_sectors_used(m));
377 static inline enum bch_data_type bucket_type(struct bucket_mark m)
379 return m.cached_sectors && !m.dirty_sectors
384 static bool bucket_became_unavailable(struct bucket_mark old,
385 struct bucket_mark new)
387 return is_available_bucket(old) &&
388 !is_available_bucket(new);
391 int bch2_fs_usage_apply(struct bch_fs *c,
392 struct bch_fs_usage *fs_usage,
393 struct disk_reservation *disk_res,
394 unsigned journal_seq)
396 s64 added = fs_usage->data + fs_usage->reserved;
397 s64 should_not_have_added;
400 percpu_rwsem_assert_held(&c->mark_lock);
403 * Not allowed to reduce sectors_available except by getting a
406 should_not_have_added = added - (s64) (disk_res ? disk_res->sectors : 0);
407 if (WARN_ONCE(should_not_have_added > 0,
408 "disk usage increased by %lli without a reservation",
409 should_not_have_added)) {
410 atomic64_sub(should_not_have_added, &c->sectors_available);
411 added -= should_not_have_added;
416 disk_res->sectors -= added;
417 fs_usage->online_reserved -= added;
421 acc_u64s((u64 *) fs_usage_ptr(c, journal_seq, false),
422 (u64 *) fs_usage, fs_usage_u64s(c));
428 static inline void account_bucket(struct bch_fs_usage *fs_usage,
429 struct bch_dev_usage *dev_usage,
430 enum bch_data_type type,
433 if (type == BCH_DATA_SB || type == BCH_DATA_JOURNAL)
434 fs_usage->hidden += size;
436 dev_usage->buckets[type] += nr;
439 static void bch2_dev_usage_update(struct bch_fs *c, struct bch_dev *ca,
440 struct bch_fs_usage *fs_usage,
441 struct bucket_mark old, struct bucket_mark new,
444 struct bch_dev_usage *dev_usage;
446 percpu_rwsem_assert_held(&c->mark_lock);
449 dev_usage = this_cpu_ptr(ca->usage[gc]);
451 if (bucket_type(old))
452 account_bucket(fs_usage, dev_usage, bucket_type(old),
453 -1, -ca->mi.bucket_size);
455 if (bucket_type(new))
456 account_bucket(fs_usage, dev_usage, bucket_type(new),
457 1, ca->mi.bucket_size);
459 dev_usage->buckets_alloc +=
460 (int) new.owned_by_allocator - (int) old.owned_by_allocator;
461 dev_usage->buckets_ec +=
462 (int) new.stripe - (int) old.stripe;
463 dev_usage->buckets_unavailable +=
464 is_unavailable_bucket(new) - is_unavailable_bucket(old);
466 dev_usage->sectors[old.data_type] -= old.dirty_sectors;
467 dev_usage->sectors[new.data_type] += new.dirty_sectors;
468 dev_usage->sectors[BCH_DATA_CACHED] +=
469 (int) new.cached_sectors - (int) old.cached_sectors;
470 dev_usage->sectors_fragmented +=
471 is_fragmented_bucket(new, ca) - is_fragmented_bucket(old, ca);
474 if (!is_available_bucket(old) && is_available_bucket(new))
475 bch2_wake_allocator(ca);
478 void bch2_dev_usage_from_buckets(struct bch_fs *c)
481 struct bucket_mark old = { .v.counter = 0 };
482 struct bucket_array *buckets;
487 c->usage_base->hidden = 0;
489 for_each_member_device(ca, c, i) {
490 for_each_possible_cpu(cpu)
491 memset(per_cpu_ptr(ca->usage[0], cpu), 0,
492 sizeof(*ca->usage[0]));
494 buckets = bucket_array(ca);
496 for_each_bucket(g, buckets)
497 bch2_dev_usage_update(c, ca, c->usage_base,
498 old, g->mark, false);
502 static inline void update_replicas(struct bch_fs *c,
503 struct bch_fs_usage *fs_usage,
504 struct bch_replicas_entry *r,
507 int idx = bch2_replicas_entry_idx(c, r);
511 switch (r->data_type) {
513 fs_usage->btree += sectors;
516 fs_usage->data += sectors;
518 case BCH_DATA_CACHED:
519 fs_usage->cached += sectors;
522 fs_usage->replicas[idx] += sectors;
525 static inline void update_cached_sectors(struct bch_fs *c,
526 struct bch_fs_usage *fs_usage,
527 unsigned dev, s64 sectors)
529 struct bch_replicas_padded r;
531 bch2_replicas_entry_cached(&r.e, dev);
533 update_replicas(c, fs_usage, &r.e, sectors);
536 static struct replicas_delta_list *
537 replicas_deltas_realloc(struct btree_trans *trans, unsigned more)
539 struct replicas_delta_list *d = trans->fs_usage_deltas;
540 unsigned new_size = d ? (d->size + more) * 2 : 128;
542 if (!d || d->used + more > d->size) {
543 d = krealloc(d, sizeof(*d) + new_size, GFP_NOIO|__GFP_ZERO);
547 trans->fs_usage_deltas = d;
552 static inline void update_replicas_list(struct btree_trans *trans,
553 struct bch_replicas_entry *r,
556 struct replicas_delta_list *d;
557 struct replicas_delta *n;
563 b = replicas_entry_bytes(r) + 8;
564 d = replicas_deltas_realloc(trans, b);
566 n = (void *) d->d + d->used;
568 memcpy(&n->r, r, replicas_entry_bytes(r));
572 static inline void update_cached_sectors_list(struct btree_trans *trans,
573 unsigned dev, s64 sectors)
575 struct bch_replicas_padded r;
577 bch2_replicas_entry_cached(&r.e, dev);
579 update_replicas_list(trans, &r.e, sectors);
582 void bch2_replicas_delta_list_apply(struct bch_fs *c,
583 struct bch_fs_usage *fs_usage,
584 struct replicas_delta_list *r)
586 struct replicas_delta *d = r->d;
587 struct replicas_delta *top = (void *) r->d + r->used;
589 acc_u64s((u64 *) fs_usage,
590 (u64 *) &r->fs_usage, sizeof(*fs_usage) / sizeof(u64));
593 BUG_ON((void *) d > (void *) top);
595 update_replicas(c, fs_usage, &d->r, d->delta);
597 d = (void *) d + replicas_entry_bytes(&d->r) + 8;
601 #define do_mark_fn(fn, c, pos, flags, ...) \
605 percpu_rwsem_assert_held(&c->mark_lock); \
607 for (gc = 0; gc < 2 && !ret; gc++) \
608 if (!gc == !(flags & BCH_BUCKET_MARK_GC) || \
609 (gc && gc_visited(c, pos))) \
610 ret = fn(c, __VA_ARGS__, gc); \
614 static int __bch2_invalidate_bucket(struct bch_fs *c, struct bch_dev *ca,
615 size_t b, struct bucket_mark *ret,
618 struct bch_fs_usage *fs_usage = fs_usage_ptr(c, 0, gc);
619 struct bucket *g = __bucket(ca, b, gc);
620 struct bucket_mark old, new;
622 old = bucket_cmpxchg(g, new, ({
623 BUG_ON(!is_available_bucket(new));
625 new.owned_by_allocator = true;
627 new.cached_sectors = 0;
628 new.dirty_sectors = 0;
632 bch2_dev_usage_update(c, ca, fs_usage, old, new, gc);
634 if (old.cached_sectors)
635 update_cached_sectors(c, fs_usage, ca->dev_idx,
636 -((s64) old.cached_sectors));
643 void bch2_invalidate_bucket(struct bch_fs *c, struct bch_dev *ca,
644 size_t b, struct bucket_mark *old)
646 do_mark_fn(__bch2_invalidate_bucket, c, gc_phase(GC_PHASE_START), 0,
649 if (!old->owned_by_allocator && old->cached_sectors)
650 trace_invalidate(ca, bucket_to_sector(ca, b),
651 old->cached_sectors);
654 static int __bch2_mark_alloc_bucket(struct bch_fs *c, struct bch_dev *ca,
655 size_t b, bool owned_by_allocator,
658 struct bch_fs_usage *fs_usage = fs_usage_ptr(c, 0, gc);
659 struct bucket *g = __bucket(ca, b, gc);
660 struct bucket_mark old, new;
662 old = bucket_cmpxchg(g, new, ({
663 new.owned_by_allocator = owned_by_allocator;
666 bch2_dev_usage_update(c, ca, fs_usage, old, new, gc);
669 !owned_by_allocator && !old.owned_by_allocator);
674 void bch2_mark_alloc_bucket(struct bch_fs *c, struct bch_dev *ca,
675 size_t b, bool owned_by_allocator,
676 struct gc_pos pos, unsigned flags)
680 do_mark_fn(__bch2_mark_alloc_bucket, c, pos, flags,
681 ca, b, owned_by_allocator);
686 static int bch2_mark_alloc(struct bch_fs *c, struct bkey_s_c k,
687 struct bch_fs_usage *fs_usage,
688 u64 journal_seq, unsigned flags)
690 bool gc = flags & BCH_BUCKET_MARK_GC;
691 struct bkey_alloc_unpacked u;
694 struct bucket_mark old, m;
697 * alloc btree is read in by bch2_alloc_read, not gc:
699 if ((flags & BCH_BUCKET_MARK_GC) &&
700 !(flags & BCH_BUCKET_MARK_BUCKET_INVALIDATE))
703 ca = bch_dev_bkey_exists(c, k.k->p.inode);
705 if (k.k->p.offset >= ca->mi.nbuckets)
708 g = __bucket(ca, k.k->p.offset, gc);
709 u = bch2_alloc_unpack(k);
711 old = bucket_cmpxchg(g, m, ({
713 m.data_type = u.data_type;
714 m.dirty_sectors = u.dirty_sectors;
715 m.cached_sectors = u.cached_sectors;
718 m.journal_seq_valid = 1;
719 m.journal_seq = journal_seq;
723 if (!(flags & BCH_BUCKET_MARK_ALLOC_READ))
724 bch2_dev_usage_update(c, ca, fs_usage, old, m, gc);
726 g->io_time[READ] = u.read_time;
727 g->io_time[WRITE] = u.write_time;
728 g->oldest_gen = u.oldest_gen;
732 * need to know if we're getting called from the invalidate path or
736 if ((flags & BCH_BUCKET_MARK_BUCKET_INVALIDATE) &&
737 old.cached_sectors) {
738 update_cached_sectors(c, fs_usage, ca->dev_idx,
739 -old.cached_sectors);
740 trace_invalidate(ca, bucket_to_sector(ca, k.k->p.offset),
747 #define checked_add(a, b) \
749 unsigned _res = (unsigned) (a) + (b); \
750 bool overflow = _res > U16_MAX; \
757 static int __bch2_mark_metadata_bucket(struct bch_fs *c, struct bch_dev *ca,
758 size_t b, enum bch_data_type type,
759 unsigned sectors, bool gc)
761 struct bucket *g = __bucket(ca, b, gc);
762 struct bucket_mark old, new;
765 BUG_ON(type != BCH_DATA_SB &&
766 type != BCH_DATA_JOURNAL);
768 old = bucket_cmpxchg(g, new, ({
769 new.data_type = type;
770 overflow = checked_add(new.dirty_sectors, sectors);
773 bch2_fs_inconsistent_on(old.data_type &&
774 old.data_type != type, c,
775 "different types of data in same bucket: %s, %s",
776 bch2_data_types[old.data_type],
777 bch2_data_types[type]);
779 bch2_fs_inconsistent_on(overflow, c,
780 "bucket sector count overflow: %u + %u > U16_MAX",
781 old.dirty_sectors, sectors);
784 bch2_dev_usage_update(c, ca, fs_usage_ptr(c, 0, gc),
790 void bch2_mark_metadata_bucket(struct bch_fs *c, struct bch_dev *ca,
791 size_t b, enum bch_data_type type,
792 unsigned sectors, struct gc_pos pos,
795 BUG_ON(type != BCH_DATA_SB &&
796 type != BCH_DATA_JOURNAL);
801 do_mark_fn(__bch2_mark_metadata_bucket, c, pos, flags,
802 ca, b, type, sectors);
804 __bch2_mark_metadata_bucket(c, ca, b, type, sectors, 0);
810 static s64 disk_sectors_scaled(unsigned n, unsigned d, unsigned sectors)
812 return DIV_ROUND_UP(sectors * n, d);
815 static s64 __ptr_disk_sectors_delta(unsigned old_size,
816 unsigned offset, s64 delta,
818 unsigned n, unsigned d)
822 if (flags & BCH_BUCKET_MARK_OVERWRITE_SPLIT) {
823 BUG_ON(offset + -delta > old_size);
825 return -disk_sectors_scaled(n, d, old_size) +
826 disk_sectors_scaled(n, d, offset) +
827 disk_sectors_scaled(n, d, old_size - offset + delta);
828 } else if (flags & BCH_BUCKET_MARK_OVERWRITE) {
829 BUG_ON(offset + -delta > old_size);
831 return -disk_sectors_scaled(n, d, old_size) +
832 disk_sectors_scaled(n, d, old_size + delta);
834 return disk_sectors_scaled(n, d, delta);
838 static s64 ptr_disk_sectors_delta(struct extent_ptr_decoded p,
839 unsigned offset, s64 delta,
842 return __ptr_disk_sectors_delta(p.crc.live_size,
843 offset, delta, flags,
844 p.crc.compressed_size,
845 p.crc.uncompressed_size);
848 static void bucket_set_stripe(struct bch_fs *c,
849 const struct bch_stripe *v,
850 struct bch_fs_usage *fs_usage,
854 bool enabled = !(flags & BCH_BUCKET_MARK_OVERWRITE);
855 bool gc = flags & BCH_BUCKET_MARK_GC;
858 for (i = 0; i < v->nr_blocks; i++) {
859 const struct bch_extent_ptr *ptr = v->ptrs + i;
860 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
861 struct bucket *g = PTR_BUCKET(ca, ptr, gc);
862 struct bucket_mark new, old;
864 old = bucket_cmpxchg(g, new, ({
865 new.stripe = enabled;
867 new.journal_seq_valid = 1;
868 new.journal_seq = journal_seq;
872 bch2_dev_usage_update(c, ca, fs_usage, old, new, gc);
875 * XXX write repair code for these, flag stripe as possibly bad
877 if (old.gen != ptr->gen)
878 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
879 "stripe with stale pointer");
882 * We'd like to check for these, but these checks don't work
885 if (old.stripe && enabled)
886 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
887 "multiple stripes using same bucket");
889 if (!old.stripe && !enabled)
890 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
891 "deleting stripe but bucket not marked as stripe bucket");
896 static bool bch2_mark_pointer(struct bch_fs *c,
897 struct extent_ptr_decoded p,
898 s64 sectors, enum bch_data_type data_type,
899 struct bch_fs_usage *fs_usage,
900 u64 journal_seq, unsigned flags)
902 bool gc = flags & BCH_BUCKET_MARK_GC;
903 struct bucket_mark old, new;
904 struct bch_dev *ca = bch_dev_bkey_exists(c, p.ptr.dev);
905 struct bucket *g = PTR_BUCKET(ca, &p.ptr, gc);
909 v = atomic64_read(&g->_mark.v);
911 new.v.counter = old.v.counter = v;
914 * Check this after reading bucket mark to guard against
915 * the allocator invalidating a bucket after we've already
918 if (gen_after(p.ptr.gen, new.gen)) {
919 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
920 "pointer gen in the future");
924 if (new.gen != p.ptr.gen) {
925 /* XXX write repair code for this */
927 test_bit(JOURNAL_REPLAY_DONE, &c->journal.flags))
928 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
929 "stale dirty pointer");
934 overflow = checked_add(new.dirty_sectors, sectors);
936 overflow = checked_add(new.cached_sectors, sectors);
938 if (!new.dirty_sectors &&
939 !new.cached_sectors) {
943 new.journal_seq_valid = 1;
944 new.journal_seq = journal_seq;
947 new.data_type = data_type;
950 if (flags & BCH_BUCKET_MARK_NOATOMIC) {
954 } while ((v = atomic64_cmpxchg(&g->_mark.v,
956 new.v.counter)) != old.v.counter);
958 if (old.data_type && old.data_type != data_type)
959 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
960 "bucket %u:%zu gen %u different types of data in same bucket: %s, %s",
961 p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr),
963 bch2_data_types[old.data_type],
964 bch2_data_types[data_type]);
966 bch2_fs_inconsistent_on(overflow, c,
967 "bucket sector count overflow: %u + %lli > U16_MAX",
970 : old.cached_sectors, sectors);
972 bch2_dev_usage_update(c, ca, fs_usage, old, new, gc);
974 BUG_ON(!gc && bucket_became_unavailable(old, new));
979 static int bch2_mark_stripe_ptr(struct bch_fs *c,
980 struct bch_extent_stripe_ptr p,
981 enum bch_data_type data_type,
982 struct bch_fs_usage *fs_usage,
983 s64 sectors, unsigned flags,
984 struct bch_replicas_padded *r,
988 bool gc = flags & BCH_BUCKET_MARK_GC;
991 int blocks_nonempty_delta;
993 m = genradix_ptr(&c->stripes[gc], p.idx);
995 spin_lock(&c->ec_stripes_heap_lock);
997 if (!m || !m->alive) {
998 spin_unlock(&c->ec_stripes_heap_lock);
999 bch_err_ratelimited(c, "pointer to nonexistent stripe %llu",
1004 BUG_ON(m->r.e.data_type != data_type);
1006 *nr_data = m->nr_blocks - m->nr_redundant;
1007 *nr_parity = m->nr_redundant;
1010 old = m->block_sectors[p.block];
1011 m->block_sectors[p.block] += sectors;
1012 new = m->block_sectors[p.block];
1014 blocks_nonempty_delta = (int) !!new - (int) !!old;
1015 if (blocks_nonempty_delta) {
1016 m->blocks_nonempty += blocks_nonempty_delta;
1019 bch2_stripes_heap_update(c, m, p.idx);
1024 spin_unlock(&c->ec_stripes_heap_lock);
1029 static int bch2_mark_extent(struct bch_fs *c, struct bkey_s_c k,
1030 unsigned offset, s64 sectors,
1031 enum bch_data_type data_type,
1032 struct bch_fs_usage *fs_usage,
1033 unsigned journal_seq, unsigned flags)
1035 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
1036 const union bch_extent_entry *entry;
1037 struct extent_ptr_decoded p;
1038 struct bch_replicas_padded r;
1039 s64 dirty_sectors = 0;
1042 r.e.data_type = data_type;
1044 r.e.nr_required = 1;
1048 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
1049 s64 disk_sectors = data_type == BCH_DATA_BTREE
1051 : ptr_disk_sectors_delta(p, offset, sectors, flags);
1052 bool stale = bch2_mark_pointer(c, p, disk_sectors, data_type,
1053 fs_usage, journal_seq, flags);
1057 update_cached_sectors(c, fs_usage, p.ptr.dev,
1059 } else if (!p.has_ec) {
1060 dirty_sectors += disk_sectors;
1061 r.e.devs[r.e.nr_devs++] = p.ptr.dev;
1063 struct bch_replicas_padded ec_r;
1064 unsigned nr_data, nr_parity;
1067 ret = bch2_mark_stripe_ptr(c, p.ec, data_type,
1068 fs_usage, disk_sectors, flags,
1069 &ec_r, &nr_data, &nr_parity);
1074 __ptr_disk_sectors_delta(p.crc.live_size,
1075 offset, sectors, flags,
1076 p.crc.compressed_size * nr_parity,
1077 p.crc.uncompressed_size * nr_data);
1079 update_replicas(c, fs_usage, &ec_r.e,
1080 disk_sectors + parity_sectors);
1083 * There may be other dirty pointers in this extent, but
1084 * if so they're not required for mounting if we have an
1085 * erasure coded pointer in this extent:
1087 r.e.nr_required = 0;
1092 update_replicas(c, fs_usage, &r.e, dirty_sectors);
1097 static int bch2_mark_stripe(struct bch_fs *c, struct bkey_s_c k,
1098 struct bch_fs_usage *fs_usage,
1099 u64 journal_seq, unsigned flags)
1101 bool gc = flags & BCH_BUCKET_MARK_GC;
1102 struct bkey_s_c_stripe s = bkey_s_c_to_stripe(k);
1103 size_t idx = s.k->p.offset;
1104 struct stripe *m = genradix_ptr(&c->stripes[gc], idx);
1107 spin_lock(&c->ec_stripes_heap_lock);
1109 if (!m || ((flags & BCH_BUCKET_MARK_OVERWRITE) && !m->alive)) {
1110 spin_unlock(&c->ec_stripes_heap_lock);
1111 bch_err_ratelimited(c, "error marking nonexistent stripe %zu",
1116 if (!(flags & BCH_BUCKET_MARK_OVERWRITE)) {
1117 m->sectors = le16_to_cpu(s.v->sectors);
1118 m->algorithm = s.v->algorithm;
1119 m->nr_blocks = s.v->nr_blocks;
1120 m->nr_redundant = s.v->nr_redundant;
1122 bch2_bkey_to_replicas(&m->r.e, k);
1125 * XXX: account for stripes somehow here
1128 update_replicas(c, fs_usage, &m->r.e, stripe_sectors);
1131 /* gc recalculates these fields: */
1132 if (!(flags & BCH_BUCKET_MARK_GC)) {
1133 for (i = 0; i < s.v->nr_blocks; i++) {
1134 m->block_sectors[i] =
1135 stripe_blockcount_get(s.v, i);
1136 m->blocks_nonempty += !!m->block_sectors[i];
1141 bch2_stripes_heap_update(c, m, idx);
1145 bch2_stripes_heap_del(c, m, idx);
1146 memset(m, 0, sizeof(*m));
1149 spin_unlock(&c->ec_stripes_heap_lock);
1151 bucket_set_stripe(c, s.v, fs_usage, 0, flags);
1155 int bch2_mark_key_locked(struct bch_fs *c,
1157 unsigned offset, s64 sectors,
1158 struct bch_fs_usage *fs_usage,
1159 u64 journal_seq, unsigned flags)
1165 if (!fs_usage || (flags & BCH_BUCKET_MARK_GC))
1166 fs_usage = fs_usage_ptr(c, journal_seq,
1167 flags & BCH_BUCKET_MARK_GC);
1169 switch (k.k->type) {
1170 case KEY_TYPE_alloc:
1171 ret = bch2_mark_alloc(c, k, fs_usage, journal_seq, flags);
1173 case KEY_TYPE_btree_ptr:
1174 sectors = !(flags & BCH_BUCKET_MARK_OVERWRITE)
1175 ? c->opts.btree_node_size
1176 : -c->opts.btree_node_size;
1178 ret = bch2_mark_extent(c, k, offset, sectors, BCH_DATA_BTREE,
1179 fs_usage, journal_seq, flags);
1181 case KEY_TYPE_extent:
1182 case KEY_TYPE_reflink_v:
1183 ret = bch2_mark_extent(c, k, offset, sectors, BCH_DATA_USER,
1184 fs_usage, journal_seq, flags);
1186 case KEY_TYPE_stripe:
1187 ret = bch2_mark_stripe(c, k, fs_usage, journal_seq, flags);
1189 case KEY_TYPE_inode:
1190 if (!(flags & BCH_BUCKET_MARK_OVERWRITE))
1191 fs_usage->nr_inodes++;
1193 fs_usage->nr_inodes--;
1195 case KEY_TYPE_reservation: {
1196 unsigned replicas = bkey_s_c_to_reservation(k).v->nr_replicas;
1198 sectors *= replicas;
1199 replicas = clamp_t(unsigned, replicas, 1,
1200 ARRAY_SIZE(fs_usage->persistent_reserved));
1202 fs_usage->reserved += sectors;
1203 fs_usage->persistent_reserved[replicas - 1] += sectors;
1213 int bch2_mark_key(struct bch_fs *c, struct bkey_s_c k,
1214 unsigned offset, s64 sectors,
1215 struct bch_fs_usage *fs_usage,
1216 u64 journal_seq, unsigned flags)
1220 percpu_down_read(&c->mark_lock);
1221 ret = bch2_mark_key_locked(c, k, offset, sectors,
1222 fs_usage, journal_seq, flags);
1223 percpu_up_read(&c->mark_lock);
1228 inline int bch2_mark_overwrite(struct btree_trans *trans,
1229 struct btree_iter *iter,
1230 struct bkey_s_c old,
1232 struct bch_fs_usage *fs_usage,
1235 struct bch_fs *c = trans->c;
1236 struct btree *b = iter->l[0].b;
1237 unsigned offset = 0;
1240 flags |= BCH_BUCKET_MARK_OVERWRITE;
1242 if (btree_node_is_extents(b)
1243 ? bkey_cmp(new->k.p, bkey_start_pos(old.k)) <= 0
1244 : bkey_cmp(new->k.p, old.k->p))
1247 if (btree_node_is_extents(b)) {
1248 switch (bch2_extent_overlap(&new->k, old.k)) {
1249 case BCH_EXTENT_OVERLAP_ALL:
1251 sectors = -((s64) old.k->size);
1253 case BCH_EXTENT_OVERLAP_BACK:
1254 offset = bkey_start_offset(&new->k) -
1255 bkey_start_offset(old.k);
1256 sectors = bkey_start_offset(&new->k) -
1259 case BCH_EXTENT_OVERLAP_FRONT:
1261 sectors = bkey_start_offset(old.k) -
1264 case BCH_EXTENT_OVERLAP_MIDDLE:
1265 offset = bkey_start_offset(&new->k) -
1266 bkey_start_offset(old.k);
1267 sectors = -((s64) new->k.size);
1268 flags |= BCH_BUCKET_MARK_OVERWRITE_SPLIT;
1272 BUG_ON(sectors >= 0);
1275 return bch2_mark_key_locked(c, old, offset, sectors, fs_usage,
1276 trans->journal_res.seq, flags) ?: 1;
1279 int bch2_mark_update(struct btree_trans *trans,
1280 struct btree_insert_entry *insert,
1281 struct bch_fs_usage *fs_usage,
1284 struct bch_fs *c = trans->c;
1285 struct btree_iter *iter = insert->iter;
1286 struct btree *b = iter->l[0].b;
1287 struct btree_node_iter node_iter = iter->l[0].iter;
1288 struct bkey_packed *_k;
1291 if (!btree_node_type_needs_gc(iter->btree_id))
1294 bch2_mark_key_locked(c, bkey_i_to_s_c(insert->k),
1295 0, insert->k->k.size,
1296 fs_usage, trans->journal_res.seq,
1297 BCH_BUCKET_MARK_INSERT|flags);
1299 if (unlikely(trans->flags & BTREE_INSERT_NOMARK_OVERWRITES))
1303 * For non extents, we only mark the new key, not the key being
1304 * overwritten - unless we're actually deleting:
1306 if ((iter->btree_id == BTREE_ID_ALLOC ||
1307 iter->btree_id == BTREE_ID_EC) &&
1308 !bkey_deleted(&insert->k->k))
1311 while ((_k = bch2_btree_node_iter_peek_filter(&node_iter, b,
1312 KEY_TYPE_discard))) {
1313 struct bkey unpacked;
1314 struct bkey_s_c k = bkey_disassemble(b, _k, &unpacked);
1316 ret = bch2_mark_overwrite(trans, iter, k, insert->k,
1321 bch2_btree_node_iter_advance(&node_iter, b);
1327 void bch2_trans_fs_usage_apply(struct btree_trans *trans,
1328 struct bch_fs_usage *fs_usage)
1330 struct bch_fs *c = trans->c;
1331 struct btree_insert_entry *i;
1332 static int warned_disk_usage = 0;
1333 u64 disk_res_sectors = trans->disk_res ? trans->disk_res->sectors : 0;
1336 if (!bch2_fs_usage_apply(c, fs_usage, trans->disk_res,
1337 trans->journal_res.seq) ||
1338 warned_disk_usage ||
1339 xchg(&warned_disk_usage, 1))
1342 bch_err(c, "disk usage increased more than %llu sectors reserved",
1345 trans_for_each_update(trans, i) {
1346 struct btree_iter *iter = i->iter;
1347 struct btree *b = iter->l[0].b;
1348 struct btree_node_iter node_iter = iter->l[0].iter;
1349 struct bkey_packed *_k;
1351 pr_err("while inserting");
1352 bch2_bkey_val_to_text(&PBUF(buf), c, bkey_i_to_s_c(i->k));
1354 pr_err("overlapping with");
1356 node_iter = iter->l[0].iter;
1357 while ((_k = bch2_btree_node_iter_peek_filter(&node_iter, b,
1358 KEY_TYPE_discard))) {
1359 struct bkey unpacked;
1362 k = bkey_disassemble(b, _k, &unpacked);
1364 if (btree_node_is_extents(b)
1365 ? bkey_cmp(i->k->k.p, bkey_start_pos(k.k)) <= 0
1366 : bkey_cmp(i->k->k.p, k.k->p))
1369 bch2_bkey_val_to_text(&PBUF(buf), c, k);
1372 bch2_btree_node_iter_advance(&node_iter, b);
1379 static int trans_get_key(struct btree_trans *trans,
1380 enum btree_id btree_id, struct bpos pos,
1381 struct btree_iter **iter,
1384 struct btree_insert_entry *i;
1387 trans_for_each_update(trans, i)
1388 if (i->iter->btree_id == btree_id &&
1389 (btree_node_type_is_extents(btree_id)
1390 ? bkey_cmp(pos, bkey_start_pos(&i->k->k)) >= 0 &&
1391 bkey_cmp(pos, i->k->k.p) < 0
1392 : !bkey_cmp(pos, i->iter->pos))) {
1394 *k = bkey_i_to_s_c(i->k);
1398 *iter = bch2_trans_get_iter(trans, btree_id, pos,
1399 BTREE_ITER_SLOTS|BTREE_ITER_INTENT);
1401 return PTR_ERR(*iter);
1403 *k = bch2_btree_iter_peek_slot(*iter);
1406 bch2_trans_iter_put(trans, *iter);
1410 static void *trans_update_key(struct btree_trans *trans,
1411 struct btree_iter *iter,
1414 struct btree_insert_entry *i;
1415 struct bkey_i *new_k;
1417 new_k = bch2_trans_kmalloc(trans, u64s * sizeof(u64));
1421 bkey_init(&new_k->k);
1422 new_k->k.p = iter->pos;
1424 trans_for_each_update(trans, i)
1425 if (i->iter == iter) {
1430 bch2_trans_update(trans, iter, new_k);
1434 static int bch2_trans_mark_pointer(struct btree_trans *trans,
1435 struct extent_ptr_decoded p,
1436 s64 sectors, enum bch_data_type data_type)
1438 struct bch_fs *c = trans->c;
1439 struct bch_dev *ca = bch_dev_bkey_exists(c, p.ptr.dev);
1440 struct btree_iter *iter;
1442 struct bkey_alloc_unpacked u;
1443 struct bkey_i_alloc *a;
1448 ret = trans_get_key(trans, BTREE_ID_ALLOC,
1449 POS(p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr)),
1456 * During journal replay, and if gc repairs alloc info at
1457 * runtime, the alloc info in the btree might not be up to date
1458 * yet - so, trust the in memory mark:
1461 struct bucket_mark m;
1463 percpu_down_read(&c->mark_lock);
1464 g = bucket(ca, iter->pos.offset);
1465 m = READ_ONCE(g->mark);
1466 u = alloc_mem_to_key(g, m);
1467 percpu_up_read(&c->mark_lock);
1470 * Unless we're already updating that key:
1472 if (k.k->type != KEY_TYPE_alloc) {
1473 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
1474 "pointer to nonexistent bucket %llu:%llu",
1475 iter->pos.inode, iter->pos.offset);
1480 u = bch2_alloc_unpack(k);
1483 if (gen_after(u.gen, p.ptr.gen)) {
1488 if (u.data_type && u.data_type != data_type) {
1489 bch2_fsck_err(c, FSCK_CAN_IGNORE|FSCK_NEED_FSCK,
1490 "bucket %llu:%llu gen %u different types of data in same bucket: %s, %s",
1491 iter->pos.inode, iter->pos.offset,
1493 bch2_data_types[u.data_type],
1494 bch2_data_types[data_type]);
1499 if (!p.ptr.cached) {
1500 old = u.dirty_sectors;
1501 overflow = checked_add(u.dirty_sectors, sectors);
1503 old = u.cached_sectors;
1504 overflow = checked_add(u.cached_sectors, sectors);
1507 u.data_type = u.dirty_sectors || u.cached_sectors
1510 bch2_fs_inconsistent_on(overflow, c,
1511 "bucket sector count overflow: %u + %lli > U16_MAX",
1515 a = trans_update_key(trans, iter, BKEY_ALLOC_U64s_MAX);
1516 ret = PTR_ERR_OR_ZERO(a);
1520 bkey_alloc_init(&a->k_i);
1522 bch2_alloc_pack(a, u);
1524 bch2_trans_iter_put(trans, iter);
1528 static int bch2_trans_mark_stripe_ptr(struct btree_trans *trans,
1529 struct bch_extent_stripe_ptr p,
1530 s64 sectors, enum bch_data_type data_type,
1531 struct bch_replicas_padded *r,
1533 unsigned *nr_parity)
1535 struct bch_fs *c = trans->c;
1536 struct btree_iter *iter;
1537 struct bkey_i *new_k;
1539 struct bkey_s_stripe s;
1542 ret = trans_get_key(trans, BTREE_ID_EC, POS(0, p.idx), &iter, &k);
1546 if (k.k->type != KEY_TYPE_stripe) {
1547 bch2_fs_inconsistent(c,
1548 "pointer to nonexistent stripe %llu",
1554 new_k = trans_update_key(trans, iter, k.k->u64s);
1555 ret = PTR_ERR_OR_ZERO(new_k);
1559 bkey_reassemble(new_k, k);
1560 s = bkey_i_to_s_stripe(new_k);
1562 stripe_blockcount_set(s.v, p.block,
1563 stripe_blockcount_get(s.v, p.block) +
1566 *nr_data = s.v->nr_blocks - s.v->nr_redundant;
1567 *nr_parity = s.v->nr_redundant;
1568 bch2_bkey_to_replicas(&r->e, s.s_c);
1570 bch2_trans_iter_put(trans, iter);
1574 static int bch2_trans_mark_extent(struct btree_trans *trans,
1575 struct bkey_s_c k, unsigned offset,
1576 s64 sectors, unsigned flags,
1577 enum bch_data_type data_type)
1579 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
1580 const union bch_extent_entry *entry;
1581 struct extent_ptr_decoded p;
1582 struct bch_replicas_padded r;
1583 s64 dirty_sectors = 0;
1587 r.e.data_type = data_type;
1589 r.e.nr_required = 1;
1593 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
1594 s64 disk_sectors = data_type == BCH_DATA_BTREE
1596 : ptr_disk_sectors_delta(p, offset, sectors, flags);
1598 ret = bch2_trans_mark_pointer(trans, p, disk_sectors,
1607 update_cached_sectors_list(trans, p.ptr.dev,
1609 } else if (!p.has_ec) {
1610 dirty_sectors += disk_sectors;
1611 r.e.devs[r.e.nr_devs++] = p.ptr.dev;
1613 struct bch_replicas_padded ec_r;
1614 unsigned nr_data, nr_parity;
1617 ret = bch2_trans_mark_stripe_ptr(trans, p.ec,
1618 disk_sectors, data_type,
1619 &ec_r, &nr_data, &nr_parity);
1624 __ptr_disk_sectors_delta(p.crc.live_size,
1625 offset, sectors, flags,
1626 p.crc.compressed_size * nr_parity,
1627 p.crc.uncompressed_size * nr_data);
1629 update_replicas_list(trans, &ec_r.e,
1630 disk_sectors + parity_sectors);
1632 r.e.nr_required = 0;
1637 update_replicas_list(trans, &r.e, dirty_sectors);
1642 static int __bch2_trans_mark_reflink_p(struct btree_trans *trans,
1643 struct bkey_s_c_reflink_p p,
1644 u64 idx, unsigned sectors,
1647 struct bch_fs *c = trans->c;
1648 struct btree_iter *iter;
1649 struct bkey_i *new_k;
1651 struct bkey_i_reflink_v *r_v;
1654 ret = trans_get_key(trans, BTREE_ID_REFLINK,
1655 POS(0, idx), &iter, &k);
1659 if (k.k->type != KEY_TYPE_reflink_v) {
1660 bch2_fs_inconsistent(c,
1661 "%llu:%llu len %u points to nonexistent indirect extent %llu",
1662 p.k->p.inode, p.k->p.offset, p.k->size, idx);
1667 if ((flags & BCH_BUCKET_MARK_OVERWRITE) &&
1668 (bkey_start_offset(k.k) < idx ||
1669 k.k->p.offset > idx + sectors))
1672 bch2_btree_iter_set_pos(iter, bkey_start_pos(k.k));
1673 BUG_ON(iter->uptodate > BTREE_ITER_NEED_PEEK);
1675 new_k = trans_update_key(trans, iter, k.k->u64s);
1676 ret = PTR_ERR_OR_ZERO(new_k);
1680 bkey_reassemble(new_k, k);
1681 r_v = bkey_i_to_reflink_v(new_k);
1683 le64_add_cpu(&r_v->v.refcount,
1684 !(flags & BCH_BUCKET_MARK_OVERWRITE) ? 1 : -1);
1686 if (!r_v->v.refcount) {
1687 r_v->k.type = KEY_TYPE_deleted;
1688 set_bkey_val_u64s(&r_v->k, 0);
1691 ret = k.k->p.offset - idx;
1693 bch2_trans_iter_put(trans, iter);
1697 static int bch2_trans_mark_reflink_p(struct btree_trans *trans,
1698 struct bkey_s_c_reflink_p p, unsigned offset,
1699 s64 sectors, unsigned flags)
1701 u64 idx = le64_to_cpu(p.v->idx) + offset;
1704 sectors = abs(sectors);
1705 BUG_ON(offset + sectors > p.k->size);
1708 ret = __bch2_trans_mark_reflink_p(trans, p, idx, sectors, flags);
1713 sectors = max_t(s64, 0LL, sectors - ret);
1720 int bch2_trans_mark_key(struct btree_trans *trans, struct bkey_s_c k,
1721 unsigned offset, s64 sectors, unsigned flags)
1723 struct replicas_delta_list *d;
1724 struct bch_fs *c = trans->c;
1726 switch (k.k->type) {
1727 case KEY_TYPE_btree_ptr:
1728 sectors = !(flags & BCH_BUCKET_MARK_OVERWRITE)
1729 ? c->opts.btree_node_size
1730 : -c->opts.btree_node_size;
1732 return bch2_trans_mark_extent(trans, k, offset, sectors,
1733 flags, BCH_DATA_BTREE);
1734 case KEY_TYPE_extent:
1735 case KEY_TYPE_reflink_v:
1736 return bch2_trans_mark_extent(trans, k, offset, sectors,
1737 flags, BCH_DATA_USER);
1738 case KEY_TYPE_inode:
1739 d = replicas_deltas_realloc(trans, 0);
1741 if (!(flags & BCH_BUCKET_MARK_OVERWRITE))
1742 d->fs_usage.nr_inodes++;
1744 d->fs_usage.nr_inodes--;
1746 case KEY_TYPE_reservation: {
1747 unsigned replicas = bkey_s_c_to_reservation(k).v->nr_replicas;
1749 d = replicas_deltas_realloc(trans, 0);
1751 sectors *= replicas;
1752 replicas = clamp_t(unsigned, replicas, 1,
1753 ARRAY_SIZE(d->fs_usage.persistent_reserved));
1755 d->fs_usage.reserved += sectors;
1756 d->fs_usage.persistent_reserved[replicas - 1] += sectors;
1759 case KEY_TYPE_reflink_p:
1760 return bch2_trans_mark_reflink_p(trans,
1761 bkey_s_c_to_reflink_p(k),
1762 offset, sectors, flags);
1768 int bch2_trans_mark_update(struct btree_trans *trans,
1769 struct btree_iter *iter,
1770 struct bkey_i *insert)
1772 struct btree *b = iter->l[0].b;
1773 struct btree_node_iter node_iter = iter->l[0].iter;
1774 struct bkey_packed *_k;
1777 if (!btree_node_type_needs_gc(iter->btree_id))
1780 ret = bch2_trans_mark_key(trans, bkey_i_to_s_c(insert),
1781 0, insert->k.size, BCH_BUCKET_MARK_INSERT);
1785 if (unlikely(trans->flags & BTREE_INSERT_NOMARK_OVERWRITES))
1788 while ((_k = bch2_btree_node_iter_peek_filter(&node_iter, b,
1789 KEY_TYPE_discard))) {
1790 struct bkey unpacked;
1792 unsigned offset = 0;
1794 unsigned flags = BCH_BUCKET_MARK_OVERWRITE;
1796 k = bkey_disassemble(b, _k, &unpacked);
1798 if (btree_node_is_extents(b)
1799 ? bkey_cmp(insert->k.p, bkey_start_pos(k.k)) <= 0
1800 : bkey_cmp(insert->k.p, k.k->p))
1803 if (btree_node_is_extents(b)) {
1804 switch (bch2_extent_overlap(&insert->k, k.k)) {
1805 case BCH_EXTENT_OVERLAP_ALL:
1807 sectors = -((s64) k.k->size);
1809 case BCH_EXTENT_OVERLAP_BACK:
1810 offset = bkey_start_offset(&insert->k) -
1811 bkey_start_offset(k.k);
1812 sectors = bkey_start_offset(&insert->k) -
1815 case BCH_EXTENT_OVERLAP_FRONT:
1817 sectors = bkey_start_offset(k.k) -
1820 case BCH_EXTENT_OVERLAP_MIDDLE:
1821 offset = bkey_start_offset(&insert->k) -
1822 bkey_start_offset(k.k);
1823 sectors = -((s64) insert->k.size);
1824 flags |= BCH_BUCKET_MARK_OVERWRITE_SPLIT;
1828 BUG_ON(sectors >= 0);
1831 ret = bch2_trans_mark_key(trans, k, offset, sectors, flags);
1835 bch2_btree_node_iter_advance(&node_iter, b);
1841 /* Disk reservations: */
1843 static u64 bch2_recalc_sectors_available(struct bch_fs *c)
1845 percpu_u64_set(&c->pcpu->sectors_available, 0);
1847 return avail_factor(__bch2_fs_usage_read_short(c).free);
1850 void __bch2_disk_reservation_put(struct bch_fs *c, struct disk_reservation *res)
1852 percpu_down_read(&c->mark_lock);
1853 this_cpu_sub(c->usage[0]->online_reserved,
1855 percpu_up_read(&c->mark_lock);
1860 #define SECTORS_CACHE 1024
1862 int bch2_disk_reservation_add(struct bch_fs *c, struct disk_reservation *res,
1863 unsigned sectors, int flags)
1865 struct bch_fs_pcpu *pcpu;
1867 s64 sectors_available;
1870 percpu_down_read(&c->mark_lock);
1872 pcpu = this_cpu_ptr(c->pcpu);
1874 if (sectors <= pcpu->sectors_available)
1877 v = atomic64_read(&c->sectors_available);
1880 get = min((u64) sectors + SECTORS_CACHE, old);
1882 if (get < sectors) {
1884 percpu_up_read(&c->mark_lock);
1887 } while ((v = atomic64_cmpxchg(&c->sectors_available,
1888 old, old - get)) != old);
1890 pcpu->sectors_available += get;
1893 pcpu->sectors_available -= sectors;
1894 this_cpu_add(c->usage[0]->online_reserved, sectors);
1895 res->sectors += sectors;
1898 percpu_up_read(&c->mark_lock);
1902 percpu_down_write(&c->mark_lock);
1904 sectors_available = bch2_recalc_sectors_available(c);
1906 if (sectors <= sectors_available ||
1907 (flags & BCH_DISK_RESERVATION_NOFAIL)) {
1908 atomic64_set(&c->sectors_available,
1909 max_t(s64, 0, sectors_available - sectors));
1910 this_cpu_add(c->usage[0]->online_reserved, sectors);
1911 res->sectors += sectors;
1914 atomic64_set(&c->sectors_available, sectors_available);
1918 percpu_up_write(&c->mark_lock);
1923 /* Startup/shutdown: */
1925 static void buckets_free_rcu(struct rcu_head *rcu)
1927 struct bucket_array *buckets =
1928 container_of(rcu, struct bucket_array, rcu);
1931 sizeof(struct bucket_array) +
1932 buckets->nbuckets * sizeof(struct bucket));
1935 int bch2_dev_buckets_resize(struct bch_fs *c, struct bch_dev *ca, u64 nbuckets)
1937 struct bucket_array *buckets = NULL, *old_buckets = NULL;
1938 unsigned long *buckets_nouse = NULL;
1939 alloc_fifo free[RESERVE_NR];
1940 alloc_fifo free_inc;
1941 alloc_heap alloc_heap;
1942 copygc_heap copygc_heap;
1944 size_t btree_reserve = DIV_ROUND_UP(BTREE_NODE_RESERVE,
1945 ca->mi.bucket_size / c->opts.btree_node_size);
1946 /* XXX: these should be tunable */
1947 size_t reserve_none = max_t(size_t, 1, nbuckets >> 9);
1948 size_t copygc_reserve = max_t(size_t, 2, nbuckets >> 7);
1949 size_t free_inc_nr = max(max_t(size_t, 1, nbuckets >> 12),
1951 bool resize = ca->buckets[0] != NULL,
1952 start_copygc = ca->copygc_thread != NULL;
1956 memset(&free, 0, sizeof(free));
1957 memset(&free_inc, 0, sizeof(free_inc));
1958 memset(&alloc_heap, 0, sizeof(alloc_heap));
1959 memset(©gc_heap, 0, sizeof(copygc_heap));
1961 if (!(buckets = kvpmalloc(sizeof(struct bucket_array) +
1962 nbuckets * sizeof(struct bucket),
1963 GFP_KERNEL|__GFP_ZERO)) ||
1964 !(buckets_nouse = kvpmalloc(BITS_TO_LONGS(nbuckets) *
1965 sizeof(unsigned long),
1966 GFP_KERNEL|__GFP_ZERO)) ||
1967 !init_fifo(&free[RESERVE_BTREE], btree_reserve, GFP_KERNEL) ||
1968 !init_fifo(&free[RESERVE_MOVINGGC],
1969 copygc_reserve, GFP_KERNEL) ||
1970 !init_fifo(&free[RESERVE_NONE], reserve_none, GFP_KERNEL) ||
1971 !init_fifo(&free_inc, free_inc_nr, GFP_KERNEL) ||
1972 !init_heap(&alloc_heap, ALLOC_SCAN_BATCH(ca) << 1, GFP_KERNEL) ||
1973 !init_heap(©gc_heap, copygc_reserve, GFP_KERNEL))
1976 buckets->first_bucket = ca->mi.first_bucket;
1977 buckets->nbuckets = nbuckets;
1979 bch2_copygc_stop(ca);
1982 down_write(&c->gc_lock);
1983 down_write(&ca->bucket_lock);
1984 percpu_down_write(&c->mark_lock);
1987 old_buckets = bucket_array(ca);
1990 size_t n = min(buckets->nbuckets, old_buckets->nbuckets);
1994 n * sizeof(struct bucket));
1995 memcpy(buckets_nouse,
1997 BITS_TO_LONGS(n) * sizeof(unsigned long));
2000 rcu_assign_pointer(ca->buckets[0], buckets);
2001 buckets = old_buckets;
2003 swap(ca->buckets_nouse, buckets_nouse);
2006 percpu_up_write(&c->mark_lock);
2008 spin_lock(&c->freelist_lock);
2009 for (i = 0; i < RESERVE_NR; i++) {
2010 fifo_move(&free[i], &ca->free[i]);
2011 swap(ca->free[i], free[i]);
2013 fifo_move(&free_inc, &ca->free_inc);
2014 swap(ca->free_inc, free_inc);
2015 spin_unlock(&c->freelist_lock);
2017 /* with gc lock held, alloc_heap can't be in use: */
2018 swap(ca->alloc_heap, alloc_heap);
2020 /* and we shut down copygc: */
2021 swap(ca->copygc_heap, copygc_heap);
2023 nbuckets = ca->mi.nbuckets;
2026 up_write(&ca->bucket_lock);
2027 up_write(&c->gc_lock);
2031 bch2_copygc_start(c, ca))
2032 bch_err(ca, "error restarting copygc thread");
2036 free_heap(©gc_heap);
2037 free_heap(&alloc_heap);
2038 free_fifo(&free_inc);
2039 for (i = 0; i < RESERVE_NR; i++)
2040 free_fifo(&free[i]);
2041 kvpfree(buckets_nouse,
2042 BITS_TO_LONGS(nbuckets) * sizeof(unsigned long));
2044 call_rcu(&old_buckets->rcu, buckets_free_rcu);
2049 void bch2_dev_buckets_free(struct bch_dev *ca)
2053 free_heap(&ca->copygc_heap);
2054 free_heap(&ca->alloc_heap);
2055 free_fifo(&ca->free_inc);
2056 for (i = 0; i < RESERVE_NR; i++)
2057 free_fifo(&ca->free[i]);
2058 kvpfree(ca->buckets_nouse,
2059 BITS_TO_LONGS(ca->mi.nbuckets) * sizeof(unsigned long));
2060 kvpfree(rcu_dereference_protected(ca->buckets[0], 1),
2061 sizeof(struct bucket_array) +
2062 ca->mi.nbuckets * sizeof(struct bucket));
2064 free_percpu(ca->usage[0]);
2067 int bch2_dev_buckets_alloc(struct bch_fs *c, struct bch_dev *ca)
2069 if (!(ca->usage[0] = alloc_percpu(struct bch_dev_usage)))
2072 return bch2_dev_buckets_resize(c, ca, ca->mi.nbuckets);;