1 // SPDX-License-Identifier: GPL-2.0
9 static int bch2_cpu_replicas_to_sb_replicas(struct bch_fs *,
10 struct bch_replicas_cpu *);
12 /* Replicas tracking - in memory: */
14 static void verify_replicas_entry(struct bch_replicas_entry *e)
16 #ifdef CONFIG_BCACHEFS_DEBUG
19 BUG_ON(e->data_type >= BCH_DATA_NR);
21 BUG_ON(e->nr_required > 1 &&
22 e->nr_required >= e->nr_devs);
24 for (i = 0; i + 1 < e->nr_devs; i++)
25 BUG_ON(e->devs[i] >= e->devs[i + 1]);
29 static void replicas_entry_sort(struct bch_replicas_entry *e)
31 bubble_sort(e->devs, e->nr_devs, u8_cmp);
34 static void bch2_cpu_replicas_sort(struct bch_replicas_cpu *r)
36 eytzinger0_sort(r->entries, r->nr, r->entry_size, memcmp, NULL);
39 void bch2_replicas_entry_to_text(struct printbuf *out,
40 struct bch_replicas_entry *e)
44 pr_buf(out, "%s: %u/%u [",
45 bch2_data_types[e->data_type],
49 for (i = 0; i < e->nr_devs; i++)
50 pr_buf(out, i ? " %u" : "%u", e->devs[i]);
54 void bch2_cpu_replicas_to_text(struct printbuf *out,
55 struct bch_replicas_cpu *r)
57 struct bch_replicas_entry *e;
60 for_each_cpu_replicas_entry(r, e) {
65 bch2_replicas_entry_to_text(out, e);
69 static void extent_to_replicas(struct bkey_s_c k,
70 struct bch_replicas_entry *r)
72 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
73 const union bch_extent_entry *entry;
74 struct extent_ptr_decoded p;
78 bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
83 r->devs[r->nr_devs++] = p.ptr.dev;
89 static void stripe_to_replicas(struct bkey_s_c k,
90 struct bch_replicas_entry *r)
92 struct bkey_s_c_stripe s = bkey_s_c_to_stripe(k);
93 const struct bch_extent_ptr *ptr;
95 r->nr_required = s.v->nr_blocks - s.v->nr_redundant;
98 ptr < s.v->ptrs + s.v->nr_blocks;
100 r->devs[r->nr_devs++] = ptr->dev;
103 void bch2_bkey_to_replicas(struct bch_replicas_entry *e,
109 case KEY_TYPE_btree_ptr:
110 case KEY_TYPE_btree_ptr_v2:
111 e->data_type = BCH_DATA_btree;
112 extent_to_replicas(k, e);
114 case KEY_TYPE_extent:
115 case KEY_TYPE_reflink_v:
116 e->data_type = BCH_DATA_user;
117 extent_to_replicas(k, e);
119 case KEY_TYPE_stripe:
120 e->data_type = BCH_DATA_parity;
121 stripe_to_replicas(k, e);
125 replicas_entry_sort(e);
128 void bch2_devlist_to_replicas(struct bch_replicas_entry *e,
129 enum bch_data_type data_type,
130 struct bch_devs_list devs)
135 data_type == BCH_DATA_sb ||
136 data_type >= BCH_DATA_NR);
138 e->data_type = data_type;
142 for (i = 0; i < devs.nr; i++)
143 e->devs[e->nr_devs++] = devs.devs[i];
145 replicas_entry_sort(e);
148 static struct bch_replicas_cpu
149 cpu_replicas_add_entry(struct bch_replicas_cpu *old,
150 struct bch_replicas_entry *new_entry)
153 struct bch_replicas_cpu new = {
155 .entry_size = max_t(unsigned, old->entry_size,
156 replicas_entry_bytes(new_entry)),
159 BUG_ON(!new_entry->data_type);
160 verify_replicas_entry(new_entry);
162 new.entries = kcalloc(new.nr, new.entry_size, GFP_NOIO);
166 for (i = 0; i < old->nr; i++)
167 memcpy(cpu_replicas_entry(&new, i),
168 cpu_replicas_entry(old, i),
171 memcpy(cpu_replicas_entry(&new, old->nr),
173 replicas_entry_bytes(new_entry));
175 bch2_cpu_replicas_sort(&new);
179 static inline int __replicas_entry_idx(struct bch_replicas_cpu *r,
180 struct bch_replicas_entry *search)
182 int idx, entry_size = replicas_entry_bytes(search);
184 if (unlikely(entry_size > r->entry_size))
187 verify_replicas_entry(search);
189 #define entry_cmp(_l, _r, size) memcmp(_l, _r, entry_size)
190 idx = eytzinger0_find(r->entries, r->nr, r->entry_size,
194 return idx < r->nr ? idx : -1;
197 int bch2_replicas_entry_idx(struct bch_fs *c,
198 struct bch_replicas_entry *search)
200 replicas_entry_sort(search);
202 return __replicas_entry_idx(&c->replicas, search);
205 static bool __replicas_has_entry(struct bch_replicas_cpu *r,
206 struct bch_replicas_entry *search)
208 return __replicas_entry_idx(r, search) >= 0;
211 bool bch2_replicas_marked(struct bch_fs *c,
212 struct bch_replicas_entry *search)
216 if (!search->nr_devs)
219 verify_replicas_entry(search);
221 percpu_down_read(&c->mark_lock);
222 marked = __replicas_has_entry(&c->replicas, search) &&
223 (likely((!c->replicas_gc.entries)) ||
224 __replicas_has_entry(&c->replicas_gc, search));
225 percpu_up_read(&c->mark_lock);
230 static void __replicas_table_update(struct bch_fs_usage *dst,
231 struct bch_replicas_cpu *dst_r,
232 struct bch_fs_usage *src,
233 struct bch_replicas_cpu *src_r)
235 int src_idx, dst_idx;
239 for (src_idx = 0; src_idx < src_r->nr; src_idx++) {
240 if (!src->replicas[src_idx])
243 dst_idx = __replicas_entry_idx(dst_r,
244 cpu_replicas_entry(src_r, src_idx));
247 dst->replicas[dst_idx] = src->replicas[src_idx];
251 static void __replicas_table_update_pcpu(struct bch_fs_usage __percpu *dst_p,
252 struct bch_replicas_cpu *dst_r,
253 struct bch_fs_usage __percpu *src_p,
254 struct bch_replicas_cpu *src_r)
256 unsigned src_nr = sizeof(struct bch_fs_usage) / sizeof(u64) + src_r->nr;
257 struct bch_fs_usage *dst, *src = (void *)
258 bch2_acc_percpu_u64s((void *) src_p, src_nr);
261 dst = this_cpu_ptr(dst_p);
264 __replicas_table_update(dst, dst_r, src, src_r);
268 * Resize filesystem accounting:
270 static int replicas_table_update(struct bch_fs *c,
271 struct bch_replicas_cpu *new_r)
273 struct bch_fs_usage __percpu *new_usage[JOURNAL_BUF_NR];
274 struct bch_fs_usage_online *new_scratch = NULL;
275 struct bch_fs_usage __percpu *new_gc = NULL;
276 struct bch_fs_usage *new_base = NULL;
277 unsigned i, bytes = sizeof(struct bch_fs_usage) +
278 sizeof(u64) * new_r->nr;
279 unsigned scratch_bytes = sizeof(struct bch_fs_usage_online) +
280 sizeof(u64) * new_r->nr;
283 memset(new_usage, 0, sizeof(new_usage));
285 for (i = 0; i < ARRAY_SIZE(new_usage); i++)
286 if (!(new_usage[i] = __alloc_percpu_gfp(bytes,
287 sizeof(u64), GFP_NOIO)))
290 memset(new_usage, 0, sizeof(new_usage));
292 for (i = 0; i < ARRAY_SIZE(new_usage); i++)
293 if (!(new_usage[i] = __alloc_percpu_gfp(bytes,
294 sizeof(u64), GFP_NOIO)))
297 if (!(new_base = kzalloc(bytes, GFP_NOIO)) ||
298 !(new_scratch = kmalloc(scratch_bytes, GFP_NOIO)) ||
300 !(new_gc = __alloc_percpu_gfp(bytes, sizeof(u64), GFP_NOIO))))
303 for (i = 0; i < ARRAY_SIZE(new_usage); i++)
305 __replicas_table_update_pcpu(new_usage[i], new_r,
306 c->usage[i], &c->replicas);
308 __replicas_table_update(new_base, new_r,
309 c->usage_base, &c->replicas);
311 __replicas_table_update_pcpu(new_gc, new_r,
312 c->usage_gc, &c->replicas);
314 for (i = 0; i < ARRAY_SIZE(new_usage); i++)
315 swap(c->usage[i], new_usage[i]);
316 swap(c->usage_base, new_base);
317 swap(c->usage_scratch, new_scratch);
318 swap(c->usage_gc, new_gc);
319 swap(c->replicas, *new_r);
323 free_percpu(new_usage[1]);
324 free_percpu(new_usage[0]);
328 bch_err(c, "error updating replicas table: memory allocation failure");
333 static unsigned reserve_journal_replicas(struct bch_fs *c,
334 struct bch_replicas_cpu *r)
336 struct bch_replicas_entry *e;
337 unsigned journal_res_u64s = 0;
341 DIV_ROUND_UP(sizeof(struct jset_entry_usage), sizeof(u64));
345 DIV_ROUND_UP(sizeof(struct jset_entry_usage), sizeof(u64));
347 /* persistent_reserved: */
349 DIV_ROUND_UP(sizeof(struct jset_entry_usage), sizeof(u64)) *
352 for_each_cpu_replicas_entry(r, e)
354 DIV_ROUND_UP(sizeof(struct jset_entry_data_usage) +
355 e->nr_devs, sizeof(u64));
356 return journal_res_u64s;
360 static int bch2_mark_replicas_slowpath(struct bch_fs *c,
361 struct bch_replicas_entry *new_entry)
363 struct bch_replicas_cpu new_r, new_gc;
366 verify_replicas_entry(new_entry);
368 memset(&new_r, 0, sizeof(new_r));
369 memset(&new_gc, 0, sizeof(new_gc));
371 mutex_lock(&c->sb_lock);
373 if (c->replicas_gc.entries &&
374 !__replicas_has_entry(&c->replicas_gc, new_entry)) {
375 new_gc = cpu_replicas_add_entry(&c->replicas_gc, new_entry);
380 if (!__replicas_has_entry(&c->replicas, new_entry)) {
381 new_r = cpu_replicas_add_entry(&c->replicas, new_entry);
385 ret = bch2_cpu_replicas_to_sb_replicas(c, &new_r);
389 bch2_journal_entry_res_resize(&c->journal,
390 &c->replicas_journal_res,
391 reserve_journal_replicas(c, &new_r));
394 if (!new_r.entries &&
398 /* allocations done, now commit: */
403 /* don't update in memory replicas until changes are persistent */
404 percpu_down_write(&c->mark_lock);
406 ret = replicas_table_update(c, &new_r);
408 swap(new_gc, c->replicas_gc);
409 percpu_up_write(&c->mark_lock);
411 mutex_unlock(&c->sb_lock);
413 kfree(new_r.entries);
414 kfree(new_gc.entries);
418 bch_err(c, "error adding replicas entry: memory allocation failure");
423 static int __bch2_mark_replicas(struct bch_fs *c,
424 struct bch_replicas_entry *r,
427 return likely(bch2_replicas_marked(c, r)) ? 0
429 : bch2_mark_replicas_slowpath(c, r);
432 int bch2_mark_replicas(struct bch_fs *c, struct bch_replicas_entry *r)
434 return __bch2_mark_replicas(c, r, false);
437 static int __bch2_mark_bkey_replicas(struct bch_fs *c, struct bkey_s_c k,
440 struct bch_replicas_padded search;
441 struct bch_devs_list cached = bch2_bkey_cached_devs(k);
445 for (i = 0; i < cached.nr; i++) {
446 bch2_replicas_entry_cached(&search.e, cached.devs[i]);
448 ret = __bch2_mark_replicas(c, &search.e, check);
453 bch2_bkey_to_replicas(&search.e, k);
455 ret = __bch2_mark_replicas(c, &search.e, check);
459 if (search.e.data_type == BCH_DATA_parity) {
460 search.e.data_type = BCH_DATA_cached;
461 ret = __bch2_mark_replicas(c, &search.e, check);
465 search.e.data_type = BCH_DATA_user;
466 ret = __bch2_mark_replicas(c, &search.e, check);
474 bool bch2_bkey_replicas_marked(struct bch_fs *c,
477 return __bch2_mark_bkey_replicas(c, k, true) == 0;
480 int bch2_mark_bkey_replicas(struct bch_fs *c, struct bkey_s_c k)
482 return __bch2_mark_bkey_replicas(c, k, false);
485 int bch2_replicas_gc_end(struct bch_fs *c, int ret)
489 lockdep_assert_held(&c->replicas_gc_lock);
491 mutex_lock(&c->sb_lock);
492 percpu_down_write(&c->mark_lock);
495 * this is kind of crappy; the replicas gc mechanism needs to be ripped
499 for (i = 0; i < c->replicas.nr; i++) {
500 struct bch_replicas_entry *e =
501 cpu_replicas_entry(&c->replicas, i);
502 struct bch_replicas_cpu n;
504 if (!__replicas_has_entry(&c->replicas_gc, e) &&
505 bch2_fs_usage_read_one(c, &c->usage_base->replicas[i])) {
506 n = cpu_replicas_add_entry(&c->replicas_gc, e);
512 swap(n, c->replicas_gc);
517 if (bch2_cpu_replicas_to_sb_replicas(c, &c->replicas_gc)) {
522 ret = replicas_table_update(c, &c->replicas_gc);
524 kfree(c->replicas_gc.entries);
525 c->replicas_gc.entries = NULL;
527 percpu_up_write(&c->mark_lock);
532 mutex_unlock(&c->sb_lock);
537 int bch2_replicas_gc_start(struct bch_fs *c, unsigned typemask)
539 struct bch_replicas_entry *e;
542 lockdep_assert_held(&c->replicas_gc_lock);
544 mutex_lock(&c->sb_lock);
545 BUG_ON(c->replicas_gc.entries);
547 c->replicas_gc.nr = 0;
548 c->replicas_gc.entry_size = 0;
550 for_each_cpu_replicas_entry(&c->replicas, e)
551 if (!((1 << e->data_type) & typemask)) {
553 c->replicas_gc.entry_size =
554 max_t(unsigned, c->replicas_gc.entry_size,
555 replicas_entry_bytes(e));
558 c->replicas_gc.entries = kcalloc(c->replicas_gc.nr,
559 c->replicas_gc.entry_size,
561 if (!c->replicas_gc.entries) {
562 mutex_unlock(&c->sb_lock);
563 bch_err(c, "error allocating c->replicas_gc");
567 for_each_cpu_replicas_entry(&c->replicas, e)
568 if (!((1 << e->data_type) & typemask))
569 memcpy(cpu_replicas_entry(&c->replicas_gc, i++),
570 e, c->replicas_gc.entry_size);
572 bch2_cpu_replicas_sort(&c->replicas_gc);
573 mutex_unlock(&c->sb_lock);
578 int bch2_replicas_gc2(struct bch_fs *c)
580 struct bch_replicas_cpu new = { 0 };
584 bch2_journal_meta(&c->journal);
586 nr = READ_ONCE(c->replicas.nr);
587 new.entry_size = READ_ONCE(c->replicas.entry_size);
588 new.entries = kcalloc(nr, new.entry_size, GFP_KERNEL);
590 bch_err(c, "error allocating c->replicas_gc");
594 mutex_lock(&c->sb_lock);
595 percpu_down_write(&c->mark_lock);
597 if (nr != c->replicas.nr ||
598 new.entry_size != c->replicas.entry_size) {
599 percpu_up_write(&c->mark_lock);
600 mutex_unlock(&c->sb_lock);
605 for (i = 0; i < c->replicas.nr; i++) {
606 struct bch_replicas_entry *e =
607 cpu_replicas_entry(&c->replicas, i);
609 if (e->data_type == BCH_DATA_journal ||
610 c->usage_base->replicas[i] ||
611 percpu_u64_get(&c->usage[0]->replicas[i]) ||
612 percpu_u64_get(&c->usage[1]->replicas[i]) ||
613 percpu_u64_get(&c->usage[2]->replicas[i]) ||
614 percpu_u64_get(&c->usage[3]->replicas[i]))
615 memcpy(cpu_replicas_entry(&new, new.nr++),
619 bch2_cpu_replicas_sort(&new);
621 if (bch2_cpu_replicas_to_sb_replicas(c, &new)) {
626 ret = replicas_table_update(c, &new);
630 percpu_up_write(&c->mark_lock);
635 mutex_unlock(&c->sb_lock);
640 int bch2_replicas_set_usage(struct bch_fs *c,
641 struct bch_replicas_entry *r,
644 int ret, idx = bch2_replicas_entry_idx(c, r);
647 struct bch_replicas_cpu n;
649 n = cpu_replicas_add_entry(&c->replicas, r);
653 ret = replicas_table_update(c, &n);
659 idx = bch2_replicas_entry_idx(c, r);
663 c->usage_base->replicas[idx] = sectors;
668 /* Replicas tracking - superblock: */
671 __bch2_sb_replicas_to_cpu_replicas(struct bch_sb_field_replicas *sb_r,
672 struct bch_replicas_cpu *cpu_r)
674 struct bch_replicas_entry *e, *dst;
675 unsigned nr = 0, entry_size = 0, idx = 0;
677 for_each_replicas_entry(sb_r, e) {
678 entry_size = max_t(unsigned, entry_size,
679 replicas_entry_bytes(e));
683 cpu_r->entries = kcalloc(nr, entry_size, GFP_NOIO);
688 cpu_r->entry_size = entry_size;
690 for_each_replicas_entry(sb_r, e) {
691 dst = cpu_replicas_entry(cpu_r, idx++);
692 memcpy(dst, e, replicas_entry_bytes(e));
693 replicas_entry_sort(dst);
700 __bch2_sb_replicas_v0_to_cpu_replicas(struct bch_sb_field_replicas_v0 *sb_r,
701 struct bch_replicas_cpu *cpu_r)
703 struct bch_replicas_entry_v0 *e;
704 unsigned nr = 0, entry_size = 0, idx = 0;
706 for_each_replicas_entry(sb_r, e) {
707 entry_size = max_t(unsigned, entry_size,
708 replicas_entry_bytes(e));
712 entry_size += sizeof(struct bch_replicas_entry) -
713 sizeof(struct bch_replicas_entry_v0);
715 cpu_r->entries = kcalloc(nr, entry_size, GFP_NOIO);
720 cpu_r->entry_size = entry_size;
722 for_each_replicas_entry(sb_r, e) {
723 struct bch_replicas_entry *dst =
724 cpu_replicas_entry(cpu_r, idx++);
726 dst->data_type = e->data_type;
727 dst->nr_devs = e->nr_devs;
728 dst->nr_required = 1;
729 memcpy(dst->devs, e->devs, e->nr_devs);
730 replicas_entry_sort(dst);
736 int bch2_sb_replicas_to_cpu_replicas(struct bch_fs *c)
738 struct bch_sb_field_replicas *sb_v1;
739 struct bch_sb_field_replicas_v0 *sb_v0;
740 struct bch_replicas_cpu new_r = { 0, 0, NULL };
743 if ((sb_v1 = bch2_sb_get_replicas(c->disk_sb.sb)))
744 ret = __bch2_sb_replicas_to_cpu_replicas(sb_v1, &new_r);
745 else if ((sb_v0 = bch2_sb_get_replicas_v0(c->disk_sb.sb)))
746 ret = __bch2_sb_replicas_v0_to_cpu_replicas(sb_v0, &new_r);
751 bch2_cpu_replicas_sort(&new_r);
753 percpu_down_write(&c->mark_lock);
755 ret = replicas_table_update(c, &new_r);
756 percpu_up_write(&c->mark_lock);
758 kfree(new_r.entries);
763 static int bch2_cpu_replicas_to_sb_replicas_v0(struct bch_fs *c,
764 struct bch_replicas_cpu *r)
766 struct bch_sb_field_replicas_v0 *sb_r;
767 struct bch_replicas_entry_v0 *dst;
768 struct bch_replicas_entry *src;
771 bytes = sizeof(struct bch_sb_field_replicas);
773 for_each_cpu_replicas_entry(r, src)
774 bytes += replicas_entry_bytes(src) - 1;
776 sb_r = bch2_sb_resize_replicas_v0(&c->disk_sb,
777 DIV_ROUND_UP(bytes, sizeof(u64)));
781 bch2_sb_field_delete(&c->disk_sb, BCH_SB_FIELD_replicas);
782 sb_r = bch2_sb_get_replicas_v0(c->disk_sb.sb);
784 memset(&sb_r->entries, 0,
785 vstruct_end(&sb_r->field) -
786 (void *) &sb_r->entries);
789 for_each_cpu_replicas_entry(r, src) {
790 dst->data_type = src->data_type;
791 dst->nr_devs = src->nr_devs;
792 memcpy(dst->devs, src->devs, src->nr_devs);
794 dst = replicas_entry_next(dst);
796 BUG_ON((void *) dst > vstruct_end(&sb_r->field));
802 static int bch2_cpu_replicas_to_sb_replicas(struct bch_fs *c,
803 struct bch_replicas_cpu *r)
805 struct bch_sb_field_replicas *sb_r;
806 struct bch_replicas_entry *dst, *src;
807 bool need_v1 = false;
810 bytes = sizeof(struct bch_sb_field_replicas);
812 for_each_cpu_replicas_entry(r, src) {
813 bytes += replicas_entry_bytes(src);
814 if (src->nr_required != 1)
819 return bch2_cpu_replicas_to_sb_replicas_v0(c, r);
821 sb_r = bch2_sb_resize_replicas(&c->disk_sb,
822 DIV_ROUND_UP(bytes, sizeof(u64)));
826 bch2_sb_field_delete(&c->disk_sb, BCH_SB_FIELD_replicas_v0);
827 sb_r = bch2_sb_get_replicas(c->disk_sb.sb);
829 memset(&sb_r->entries, 0,
830 vstruct_end(&sb_r->field) -
831 (void *) &sb_r->entries);
834 for_each_cpu_replicas_entry(r, src) {
835 memcpy(dst, src, replicas_entry_bytes(src));
837 dst = replicas_entry_next(dst);
839 BUG_ON((void *) dst > vstruct_end(&sb_r->field));
845 static const char *check_dup_replicas_entries(struct bch_replicas_cpu *cpu_r)
849 sort_cmp_size(cpu_r->entries,
854 for (i = 0; i + 1 < cpu_r->nr; i++) {
855 struct bch_replicas_entry *l =
856 cpu_replicas_entry(cpu_r, i);
857 struct bch_replicas_entry *r =
858 cpu_replicas_entry(cpu_r, i + 1);
860 BUG_ON(memcmp(l, r, cpu_r->entry_size) > 0);
862 if (!memcmp(l, r, cpu_r->entry_size))
863 return "duplicate replicas entry";
869 static const char *bch2_sb_validate_replicas(struct bch_sb *sb, struct bch_sb_field *f)
871 struct bch_sb_field_replicas *sb_r = field_to_type(f, replicas);
872 struct bch_sb_field_members *mi = bch2_sb_get_members(sb);
873 struct bch_replicas_cpu cpu_r = { .entries = NULL };
874 struct bch_replicas_entry *e;
878 for_each_replicas_entry(sb_r, e) {
879 err = "invalid replicas entry: invalid data type";
880 if (e->data_type >= BCH_DATA_NR)
883 err = "invalid replicas entry: no devices";
887 err = "invalid replicas entry: bad nr_required";
888 if (e->nr_required > 1 &&
889 e->nr_required >= e->nr_devs)
892 err = "invalid replicas entry: invalid device";
893 for (i = 0; i < e->nr_devs; i++)
894 if (!bch2_dev_exists(sb, mi, e->devs[i]))
898 err = "cannot allocate memory";
899 if (__bch2_sb_replicas_to_cpu_replicas(sb_r, &cpu_r))
902 err = check_dup_replicas_entries(&cpu_r);
904 kfree(cpu_r.entries);
908 static void bch2_sb_replicas_to_text(struct printbuf *out,
910 struct bch_sb_field *f)
912 struct bch_sb_field_replicas *r = field_to_type(f, replicas);
913 struct bch_replicas_entry *e;
916 for_each_replicas_entry(r, e) {
921 bch2_replicas_entry_to_text(out, e);
925 const struct bch_sb_field_ops bch_sb_field_ops_replicas = {
926 .validate = bch2_sb_validate_replicas,
927 .to_text = bch2_sb_replicas_to_text,
930 static const char *bch2_sb_validate_replicas_v0(struct bch_sb *sb, struct bch_sb_field *f)
932 struct bch_sb_field_replicas_v0 *sb_r = field_to_type(f, replicas_v0);
933 struct bch_sb_field_members *mi = bch2_sb_get_members(sb);
934 struct bch_replicas_cpu cpu_r = { .entries = NULL };
935 struct bch_replicas_entry_v0 *e;
939 for_each_replicas_entry_v0(sb_r, e) {
940 err = "invalid replicas entry: invalid data type";
941 if (e->data_type >= BCH_DATA_NR)
944 err = "invalid replicas entry: no devices";
948 err = "invalid replicas entry: invalid device";
949 for (i = 0; i < e->nr_devs; i++)
950 if (!bch2_dev_exists(sb, mi, e->devs[i]))
954 err = "cannot allocate memory";
955 if (__bch2_sb_replicas_v0_to_cpu_replicas(sb_r, &cpu_r))
958 err = check_dup_replicas_entries(&cpu_r);
960 kfree(cpu_r.entries);
964 const struct bch_sb_field_ops bch_sb_field_ops_replicas_v0 = {
965 .validate = bch2_sb_validate_replicas_v0,
968 /* Query replicas: */
970 struct replicas_status __bch2_replicas_status(struct bch_fs *c,
971 struct bch_devs_mask online_devs)
973 struct bch_sb_field_members *mi;
974 struct bch_replicas_entry *e;
975 unsigned i, nr_online, nr_offline;
976 struct replicas_status ret;
978 memset(&ret, 0, sizeof(ret));
980 for (i = 0; i < ARRAY_SIZE(ret.replicas); i++)
981 ret.replicas[i].redundancy = INT_MAX;
983 mi = bch2_sb_get_members(c->disk_sb.sb);
985 percpu_down_read(&c->mark_lock);
987 for_each_cpu_replicas_entry(&c->replicas, e) {
988 if (e->data_type >= ARRAY_SIZE(ret.replicas))
989 panic("e %p data_type %u\n", e, e->data_type);
991 nr_online = nr_offline = 0;
993 for (i = 0; i < e->nr_devs; i++) {
994 BUG_ON(!bch2_dev_exists(c->disk_sb.sb, mi,
997 if (test_bit(e->devs[i], online_devs.d))
1003 ret.replicas[e->data_type].redundancy =
1004 min(ret.replicas[e->data_type].redundancy,
1005 (int) nr_online - (int) e->nr_required);
1007 ret.replicas[e->data_type].nr_offline =
1008 max(ret.replicas[e->data_type].nr_offline,
1012 percpu_up_read(&c->mark_lock);
1014 for (i = 0; i < ARRAY_SIZE(ret.replicas); i++)
1015 if (ret.replicas[i].redundancy == INT_MAX)
1016 ret.replicas[i].redundancy = 0;
1021 struct replicas_status bch2_replicas_status(struct bch_fs *c)
1023 return __bch2_replicas_status(c, bch2_online_devs(c));
1026 static bool have_enough_devs(struct replicas_status s,
1027 enum bch_data_type type,
1028 bool force_if_degraded,
1031 return (!s.replicas[type].nr_offline || force_if_degraded) &&
1032 (s.replicas[type].redundancy >= 0 || force_if_lost);
1035 bool bch2_have_enough_devs(struct replicas_status s, unsigned flags)
1037 return (have_enough_devs(s, BCH_DATA_journal,
1038 flags & BCH_FORCE_IF_METADATA_DEGRADED,
1039 flags & BCH_FORCE_IF_METADATA_LOST) &&
1040 have_enough_devs(s, BCH_DATA_btree,
1041 flags & BCH_FORCE_IF_METADATA_DEGRADED,
1042 flags & BCH_FORCE_IF_METADATA_LOST) &&
1043 have_enough_devs(s, BCH_DATA_user,
1044 flags & BCH_FORCE_IF_DATA_DEGRADED,
1045 flags & BCH_FORCE_IF_DATA_LOST));
1048 int bch2_replicas_online(struct bch_fs *c, bool meta)
1050 struct replicas_status s = bch2_replicas_status(c);
1053 ? min(s.replicas[BCH_DATA_journal].redundancy,
1054 s.replicas[BCH_DATA_btree].redundancy)
1055 : s.replicas[BCH_DATA_user].redundancy) + 1;
1058 unsigned bch2_dev_has_data(struct bch_fs *c, struct bch_dev *ca)
1060 struct bch_replicas_entry *e;
1061 unsigned i, ret = 0;
1063 percpu_down_read(&c->mark_lock);
1065 for_each_cpu_replicas_entry(&c->replicas, e)
1066 for (i = 0; i < e->nr_devs; i++)
1067 if (e->devs[i] == ca->dev_idx)
1068 ret |= 1 << e->data_type;
1070 percpu_up_read(&c->mark_lock);
1075 int bch2_fs_replicas_init(struct bch_fs *c)
1077 c->journal.entry_u64s_reserved +=
1078 reserve_journal_replicas(c, &c->replicas);
1080 return replicas_table_update(c, &c->replicas);