git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/replicas.c

   1 // SPDX-License-Identifier: GPL-2.0
   2
   3 #include "bcachefs.h"
   4 #include "buckets.h"
   5 #include "journal.h"
   6 #include "replicas.h"
   7 #include "super-io.h"
   8
   9 static int bch2_cpu_replicas_to_sb_replicas(struct bch_fs *,
  10                                             struct bch_replicas_cpu *);
  11
  12 /* Replicas tracking - in memory: */
  13
  14 static void verify_replicas_entry(struct bch_replicas_entry *e)
  15 {
  16 #ifdef CONFIG_BCACHEFS_DEBUG
  17         unsigned i;
  18
  19         BUG_ON(e->data_type >= BCH_DATA_NR);
  20         BUG_ON(!e->nr_devs);
  21         BUG_ON(e->nr_required > 1 &&
  22                e->nr_required >= e->nr_devs);
  23
  24         for (i = 0; i + 1 < e->nr_devs; i++)
  25                 BUG_ON(e->devs[i] >= e->devs[i + 1]);
  26 #endif
  27 }
  28
  29 void bch2_replicas_entry_sort(struct bch_replicas_entry *e)
  30 {
  31         bubble_sort(e->devs, e->nr_devs, u8_cmp);
  32 }
  33
  34 static void bch2_cpu_replicas_sort(struct bch_replicas_cpu *r)
  35 {
  36         eytzinger0_sort(r->entries, r->nr, r->entry_size, memcmp, NULL);
  37 }
  38
  39 void bch2_replicas_entry_v0_to_text(struct printbuf *out,
  40                                     struct bch_replicas_entry_v0 *e)
  41 {
  42         unsigned i;
  43
  44         if (e->data_type < BCH_DATA_NR)
  45                 prt_printf(out, "%s", bch2_data_types[e->data_type]);
  46         else
  47                 prt_printf(out, "(invalid data type %u)", e->data_type);
  48
  49         prt_printf(out, ": %u [", e->nr_devs);
  50         for (i = 0; i < e->nr_devs; i++)
  51                 prt_printf(out, i ? " %u" : "%u", e->devs[i]);
  52         prt_printf(out, "]");
  53 }
  54
  55 void bch2_replicas_entry_to_text(struct printbuf *out,
  56                                  struct bch_replicas_entry *e)
  57 {
  58         unsigned i;
  59
  60         if (e->data_type < BCH_DATA_NR)
  61                 prt_printf(out, "%s", bch2_data_types[e->data_type]);
  62         else
  63                 prt_printf(out, "(invalid data type %u)", e->data_type);
  64
  65         prt_printf(out, ": %u/%u [", e->nr_required, e->nr_devs);
  66         for (i = 0; i < e->nr_devs; i++)
  67                 prt_printf(out, i ? " %u" : "%u", e->devs[i]);
  68         prt_printf(out, "]");
  69 }
  70
  71 void bch2_cpu_replicas_to_text(struct printbuf *out,
  72                                struct bch_replicas_cpu *r)
  73 {
  74         struct bch_replicas_entry *e;
  75         bool first = true;
  76
  77         for_each_cpu_replicas_entry(r, e) {
  78                 if (!first)
  79                         prt_printf(out, " ");
  80                 first = false;
  81
  82                 bch2_replicas_entry_to_text(out, e);
  83         }
  84 }
  85
  86 static void extent_to_replicas(struct bkey_s_c k,
  87                                struct bch_replicas_entry *r)
  88 {
  89         struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
  90         const union bch_extent_entry *entry;
  91         struct extent_ptr_decoded p;
  92
  93         r->nr_required  = 1;
  94
  95         bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
  96                 if (p.ptr.cached)
  97                         continue;
  98
  99                 if (!p.has_ec)
 100                         r->devs[r->nr_devs++] = p.ptr.dev;
 101                 else
 102                         r->nr_required = 0;
 103         }
 104 }
 105
 106 static void stripe_to_replicas(struct bkey_s_c k,
 107                                struct bch_replicas_entry *r)
 108 {
 109         struct bkey_s_c_stripe s = bkey_s_c_to_stripe(k);
 110         const struct bch_extent_ptr *ptr;
 111
 112         r->nr_required  = s.v->nr_blocks - s.v->nr_redundant;
 113
 114         for (ptr = s.v->ptrs;
 115              ptr < s.v->ptrs + s.v->nr_blocks;
 116              ptr++)
 117                 r->devs[r->nr_devs++] = ptr->dev;
 118 }
 119
 120 void bch2_bkey_to_replicas(struct bch_replicas_entry *e,
 121                            struct bkey_s_c k)
 122 {
 123         e->nr_devs = 0;
 124
 125         switch (k.k->type) {
 126         case KEY_TYPE_btree_ptr:
 127         case KEY_TYPE_btree_ptr_v2:
 128                 e->data_type = BCH_DATA_btree;
 129                 extent_to_replicas(k, e);
 130                 break;
 131         case KEY_TYPE_extent:
 132         case KEY_TYPE_reflink_v:
 133                 e->data_type = BCH_DATA_user;
 134                 extent_to_replicas(k, e);
 135                 break;
 136         case KEY_TYPE_stripe:
 137                 e->data_type = BCH_DATA_parity;
 138                 stripe_to_replicas(k, e);
 139                 break;
 140         }
 141
 142         bch2_replicas_entry_sort(e);
 143 }
 144
 145 void bch2_devlist_to_replicas(struct bch_replicas_entry *e,
 146                               enum bch_data_type data_type,
 147                               struct bch_devs_list devs)
 148 {
 149         unsigned i;
 150
 151         BUG_ON(!data_type ||
 152                data_type == BCH_DATA_sb ||
 153                data_type >= BCH_DATA_NR);
 154
 155         e->data_type    = data_type;
 156         e->nr_devs      = 0;
 157         e->nr_required  = 1;
 158
 159         for (i = 0; i < devs.nr; i++)
 160                 e->devs[e->nr_devs++] = devs.devs[i];
 161
 162         bch2_replicas_entry_sort(e);
 163 }
 164
 165 static struct bch_replicas_cpu
 166 cpu_replicas_add_entry(struct bch_replicas_cpu *old,
 167                        struct bch_replicas_entry *new_entry)
 168 {
 169         unsigned i;
 170         struct bch_replicas_cpu new = {
 171                 .nr             = old->nr + 1,
 172                 .entry_size     = max_t(unsigned, old->entry_size,
 173                                         replicas_entry_bytes(new_entry)),
 174         };
 175
 176         BUG_ON(!new_entry->data_type);
 177         verify_replicas_entry(new_entry);
 178
 179         new.entries = kcalloc(new.nr, new.entry_size, GFP_KERNEL);
 180         if (!new.entries)
 181                 return new;
 182
 183         for (i = 0; i < old->nr; i++)
 184                 memcpy(cpu_replicas_entry(&new, i),
 185                        cpu_replicas_entry(old, i),
 186                        old->entry_size);
 187
 188         memcpy(cpu_replicas_entry(&new, old->nr),
 189                new_entry,
 190                replicas_entry_bytes(new_entry));
 191
 192         bch2_cpu_replicas_sort(&new);
 193         return new;
 194 }
 195
 196 static inline int __replicas_entry_idx(struct bch_replicas_cpu *r,
 197                                        struct bch_replicas_entry *search)
 198 {
 199         int idx, entry_size = replicas_entry_bytes(search);
 200
 201         if (unlikely(entry_size > r->entry_size))
 202                 return -1;
 203
 204         verify_replicas_entry(search);
 205
 206 #define entry_cmp(_l, _r, size) memcmp(_l, _r, entry_size)
 207         idx = eytzinger0_find(r->entries, r->nr, r->entry_size,
 208                               entry_cmp, search);
 209 #undef entry_cmp
 210
 211         return idx < r->nr ? idx : -1;
 212 }
 213
 214 int bch2_replicas_entry_idx(struct bch_fs *c,
 215                             struct bch_replicas_entry *search)
 216 {
 217         bch2_replicas_entry_sort(search);
 218
 219         return __replicas_entry_idx(&c->replicas, search);
 220 }
 221
 222 static bool __replicas_has_entry(struct bch_replicas_cpu *r,
 223                                  struct bch_replicas_entry *search)
 224 {
 225         return __replicas_entry_idx(r, search) >= 0;
 226 }
 227
 228 bool bch2_replicas_marked(struct bch_fs *c,
 229                           struct bch_replicas_entry *search)
 230 {
 231         bool marked;
 232
 233         if (!search->nr_devs)
 234                 return true;
 235
 236         verify_replicas_entry(search);
 237
 238         percpu_down_read(&c->mark_lock);
 239         marked = __replicas_has_entry(&c->replicas, search) &&
 240                 (likely((!c->replicas_gc.entries)) ||
 241                  __replicas_has_entry(&c->replicas_gc, search));
 242         percpu_up_read(&c->mark_lock);
 243
 244         return marked;
 245 }
 246
 247 static void __replicas_table_update(struct bch_fs_usage *dst,
 248                                     struct bch_replicas_cpu *dst_r,
 249                                     struct bch_fs_usage *src,
 250                                     struct bch_replicas_cpu *src_r)
 251 {
 252         int src_idx, dst_idx;
 253
 254         *dst = *src;
 255
 256         for (src_idx = 0; src_idx < src_r->nr; src_idx++) {
 257                 if (!src->replicas[src_idx])
 258                         continue;
 259
 260                 dst_idx = __replicas_entry_idx(dst_r,
 261                                 cpu_replicas_entry(src_r, src_idx));
 262                 BUG_ON(dst_idx < 0);
 263
 264                 dst->replicas[dst_idx] = src->replicas[src_idx];
 265         }
 266 }
 267
 268 static void __replicas_table_update_pcpu(struct bch_fs_usage __percpu *dst_p,
 269                                     struct bch_replicas_cpu *dst_r,
 270                                     struct bch_fs_usage __percpu *src_p,
 271                                     struct bch_replicas_cpu *src_r)
 272 {
 273         unsigned src_nr = sizeof(struct bch_fs_usage) / sizeof(u64) + src_r->nr;
 274         struct bch_fs_usage *dst, *src = (void *)
 275                 bch2_acc_percpu_u64s((void *) src_p, src_nr);
 276
 277         preempt_disable();
 278         dst = this_cpu_ptr(dst_p);
 279         preempt_enable();
 280
 281         __replicas_table_update(dst, dst_r, src, src_r);
 282 }
 283
 284 /*
 285  * Resize filesystem accounting:
 286  */
 287 static int replicas_table_update(struct bch_fs *c,
 288                                  struct bch_replicas_cpu *new_r)
 289 {
 290         struct bch_fs_usage __percpu *new_usage[JOURNAL_BUF_NR];
 291         struct bch_fs_usage_online *new_scratch = NULL;
 292         struct bch_fs_usage __percpu *new_gc = NULL;
 293         struct bch_fs_usage *new_base = NULL;
 294         unsigned i, bytes = sizeof(struct bch_fs_usage) +
 295                 sizeof(u64) * new_r->nr;
 296         unsigned scratch_bytes = sizeof(struct bch_fs_usage_online) +
 297                 sizeof(u64) * new_r->nr;
 298         int ret = 0;
 299
 300         memset(new_usage, 0, sizeof(new_usage));
 301
 302         for (i = 0; i < ARRAY_SIZE(new_usage); i++)
 303                 if (!(new_usage[i] = __alloc_percpu_gfp(bytes,
 304                                         sizeof(u64), GFP_KERNEL)))
 305                         goto err;
 306
 307         if (!(new_base = kzalloc(bytes, GFP_KERNEL)) ||
 308             !(new_scratch  = kmalloc(scratch_bytes, GFP_KERNEL)) ||
 309             (c->usage_gc &&
 310              !(new_gc = __alloc_percpu_gfp(bytes, sizeof(u64), GFP_KERNEL))))
 311                 goto err;
 312
 313         for (i = 0; i < ARRAY_SIZE(new_usage); i++)
 314                 if (c->usage[i])
 315                         __replicas_table_update_pcpu(new_usage[i], new_r,
 316                                                      c->usage[i], &c->replicas);
 317         if (c->usage_base)
 318                 __replicas_table_update(new_base,               new_r,
 319                                         c->usage_base,          &c->replicas);
 320         if (c->usage_gc)
 321                 __replicas_table_update_pcpu(new_gc,            new_r,
 322                                              c->usage_gc,       &c->replicas);
 323
 324         for (i = 0; i < ARRAY_SIZE(new_usage); i++)
 325                 swap(c->usage[i],       new_usage[i]);
 326         swap(c->usage_base,     new_base);
 327         swap(c->usage_scratch,  new_scratch);
 328         swap(c->usage_gc,       new_gc);
 329         swap(c->replicas,       *new_r);
 330 out:
 331         free_percpu(new_gc);
 332         kfree(new_scratch);
 333         for (i = 0; i < ARRAY_SIZE(new_usage); i++)
 334                 free_percpu(new_usage[i]);
 335         kfree(new_base);
 336         return ret;
 337 err:
 338         bch_err(c, "error updating replicas table: memory allocation failure");
 339         ret = -ENOMEM;
 340         goto out;
 341 }
 342
 343 static unsigned reserve_journal_replicas(struct bch_fs *c,
 344                                      struct bch_replicas_cpu *r)
 345 {
 346         struct bch_replicas_entry *e;
 347         unsigned journal_res_u64s = 0;
 348
 349         /* nr_inodes: */
 350         journal_res_u64s +=
 351                 DIV_ROUND_UP(sizeof(struct jset_entry_usage), sizeof(u64));
 352
 353         /* key_version: */
 354         journal_res_u64s +=
 355                 DIV_ROUND_UP(sizeof(struct jset_entry_usage), sizeof(u64));
 356
 357         /* persistent_reserved: */
 358         journal_res_u64s +=
 359                 DIV_ROUND_UP(sizeof(struct jset_entry_usage), sizeof(u64)) *
 360                 BCH_REPLICAS_MAX;
 361
 362         for_each_cpu_replicas_entry(r, e)
 363                 journal_res_u64s +=
 364                         DIV_ROUND_UP(sizeof(struct jset_entry_data_usage) +
 365                                      e->nr_devs, sizeof(u64));
 366         return journal_res_u64s;
 367 }
 368
 369 noinline
 370 static int bch2_mark_replicas_slowpath(struct bch_fs *c,
 371                                 struct bch_replicas_entry *new_entry)
 372 {
 373         struct bch_replicas_cpu new_r, new_gc;
 374         int ret = 0;
 375
 376         verify_replicas_entry(new_entry);
 377
 378         memset(&new_r, 0, sizeof(new_r));
 379         memset(&new_gc, 0, sizeof(new_gc));
 380
 381         mutex_lock(&c->sb_lock);
 382
 383         if (c->replicas_gc.entries &&
 384             !__replicas_has_entry(&c->replicas_gc, new_entry)) {
 385                 new_gc = cpu_replicas_add_entry(&c->replicas_gc, new_entry);
 386                 if (!new_gc.entries)
 387                         goto err;
 388         }
 389
 390         if (!__replicas_has_entry(&c->replicas, new_entry)) {
 391                 new_r = cpu_replicas_add_entry(&c->replicas, new_entry);
 392                 if (!new_r.entries)
 393                         goto err;
 394
 395                 ret = bch2_cpu_replicas_to_sb_replicas(c, &new_r);
 396                 if (ret)
 397                         goto err;
 398
 399                 bch2_journal_entry_res_resize(&c->journal,
 400                                 &c->replicas_journal_res,
 401                                 reserve_journal_replicas(c, &new_r));
 402         }
 403
 404         if (!new_r.entries &&
 405             !new_gc.entries)
 406                 goto out;
 407
 408         /* allocations done, now commit: */
 409
 410         if (new_r.entries)
 411                 bch2_write_super(c);
 412
 413         /* don't update in memory replicas until changes are persistent */
 414         percpu_down_write(&c->mark_lock);
 415         if (new_r.entries)
 416                 ret = replicas_table_update(c, &new_r);
 417         if (new_gc.entries)
 418                 swap(new_gc, c->replicas_gc);
 419         percpu_up_write(&c->mark_lock);
 420 out:
 421         mutex_unlock(&c->sb_lock);
 422
 423         kfree(new_r.entries);
 424         kfree(new_gc.entries);
 425
 426         return ret;
 427 err:
 428         bch_err(c, "error adding replicas entry: memory allocation failure");
 429         ret = -ENOMEM;
 430         goto out;
 431 }
 432
 433 int bch2_mark_replicas(struct bch_fs *c, struct bch_replicas_entry *r)
 434 {
 435         return likely(bch2_replicas_marked(c, r))
 436                 ? 0 : bch2_mark_replicas_slowpath(c, r);
 437 }
 438
 439 /* replicas delta list: */
 440
 441 int bch2_replicas_delta_list_mark(struct bch_fs *c,
 442                                   struct replicas_delta_list *r)
 443 {
 444         struct replicas_delta *d = r->d;
 445         struct replicas_delta *top = (void *) r->d + r->used;
 446         int ret = 0;
 447
 448         for (d = r->d; !ret && d != top; d = replicas_delta_next(d))
 449                 ret = bch2_mark_replicas(c, &d->r);
 450         return ret;
 451 }
 452
 453 /*
 454  * Old replicas_gc mechanism: only used for journal replicas entries now, should
 455  * die at some point:
 456  */
 457
 458 int bch2_replicas_gc_end(struct bch_fs *c, int ret)
 459 {
 460         unsigned i;
 461
 462         lockdep_assert_held(&c->replicas_gc_lock);
 463
 464         mutex_lock(&c->sb_lock);
 465         percpu_down_write(&c->mark_lock);
 466
 467         /*
 468          * this is kind of crappy; the replicas gc mechanism needs to be ripped
 469          * out
 470          */
 471
 472         for (i = 0; i < c->replicas.nr; i++) {
 473                 struct bch_replicas_entry *e =
 474                         cpu_replicas_entry(&c->replicas, i);
 475                 struct bch_replicas_cpu n;
 476
 477                 if (!__replicas_has_entry(&c->replicas_gc, e) &&
 478                     bch2_fs_usage_read_one(c, &c->usage_base->replicas[i])) {
 479                         n = cpu_replicas_add_entry(&c->replicas_gc, e);
 480                         if (!n.entries) {
 481                                 ret = -ENOMEM;
 482                                 goto err;
 483                         }
 484
 485                         swap(n, c->replicas_gc);
 486                         kfree(n.entries);
 487                 }
 488         }
 489
 490         ret = bch2_cpu_replicas_to_sb_replicas(c, &c->replicas_gc);
 491         if (ret)
 492                 goto err;
 493
 494         ret = replicas_table_update(c, &c->replicas_gc);
 495 err:
 496         kfree(c->replicas_gc.entries);
 497         c->replicas_gc.entries = NULL;
 498
 499         percpu_up_write(&c->mark_lock);
 500
 501         if (!ret)
 502                 bch2_write_super(c);
 503
 504         mutex_unlock(&c->sb_lock);
 505
 506         return ret;
 507 }
 508
 509 int bch2_replicas_gc_start(struct bch_fs *c, unsigned typemask)
 510 {
 511         struct bch_replicas_entry *e;
 512         unsigned i = 0;
 513
 514         lockdep_assert_held(&c->replicas_gc_lock);
 515
 516         mutex_lock(&c->sb_lock);
 517         BUG_ON(c->replicas_gc.entries);
 518
 519         c->replicas_gc.nr               = 0;
 520         c->replicas_gc.entry_size       = 0;
 521
 522         for_each_cpu_replicas_entry(&c->replicas, e)
 523                 if (!((1 << e->data_type) & typemask)) {
 524                         c->replicas_gc.nr++;
 525                         c->replicas_gc.entry_size =
 526                                 max_t(unsigned, c->replicas_gc.entry_size,
 527                                       replicas_entry_bytes(e));
 528                 }
 529
 530         c->replicas_gc.entries = kcalloc(c->replicas_gc.nr,
 531                                          c->replicas_gc.entry_size,
 532                                          GFP_KERNEL);
 533         if (!c->replicas_gc.entries) {
 534                 mutex_unlock(&c->sb_lock);
 535                 bch_err(c, "error allocating c->replicas_gc");
 536                 return -ENOMEM;
 537         }
 538
 539         for_each_cpu_replicas_entry(&c->replicas, e)
 540                 if (!((1 << e->data_type) & typemask))
 541                         memcpy(cpu_replicas_entry(&c->replicas_gc, i++),
 542                                e, c->replicas_gc.entry_size);
 543
 544         bch2_cpu_replicas_sort(&c->replicas_gc);
 545         mutex_unlock(&c->sb_lock);
 546
 547         return 0;
 548 }
 549
 550 /* New much simpler mechanism for clearing out unneeded replicas entries: */
 551
 552 int bch2_replicas_gc2(struct bch_fs *c)
 553 {
 554         struct bch_replicas_cpu new = { 0 };
 555         unsigned i, nr;
 556         int ret = 0;
 557
 558         bch2_journal_meta(&c->journal);
 559 retry:
 560         nr              = READ_ONCE(c->replicas.nr);
 561         new.entry_size  = READ_ONCE(c->replicas.entry_size);
 562         new.entries     = kcalloc(nr, new.entry_size, GFP_KERNEL);
 563         if (!new.entries) {
 564                 bch_err(c, "error allocating c->replicas_gc");
 565                 return -ENOMEM;
 566         }
 567
 568         mutex_lock(&c->sb_lock);
 569         percpu_down_write(&c->mark_lock);
 570
 571         if (nr                  != c->replicas.nr ||
 572             new.entry_size      != c->replicas.entry_size) {
 573                 percpu_up_write(&c->mark_lock);
 574                 mutex_unlock(&c->sb_lock);
 575                 kfree(new.entries);
 576                 goto retry;
 577         }
 578
 579         for (i = 0; i < c->replicas.nr; i++) {
 580                 struct bch_replicas_entry *e =
 581                         cpu_replicas_entry(&c->replicas, i);
 582
 583                 if (e->data_type == BCH_DATA_journal ||
 584                     c->usage_base->replicas[i] ||
 585                     percpu_u64_get(&c->usage[0]->replicas[i]) ||
 586                     percpu_u64_get(&c->usage[1]->replicas[i]) ||
 587                     percpu_u64_get(&c->usage[2]->replicas[i]) ||
 588                     percpu_u64_get(&c->usage[3]->replicas[i]))
 589                         memcpy(cpu_replicas_entry(&new, new.nr++),
 590                                e, new.entry_size);
 591         }
 592
 593         bch2_cpu_replicas_sort(&new);
 594
 595         ret = bch2_cpu_replicas_to_sb_replicas(c, &new);
 596         if (ret)
 597                 goto err;
 598
 599         ret = replicas_table_update(c, &new);
 600 err:
 601         kfree(new.entries);
 602
 603         percpu_up_write(&c->mark_lock);
 604
 605         if (!ret)
 606                 bch2_write_super(c);
 607
 608         mutex_unlock(&c->sb_lock);
 609
 610         return ret;
 611 }
 612
 613 int bch2_replicas_set_usage(struct bch_fs *c,
 614                             struct bch_replicas_entry *r,
 615                             u64 sectors)
 616 {
 617         int ret, idx = bch2_replicas_entry_idx(c, r);
 618
 619         if (idx < 0) {
 620                 struct bch_replicas_cpu n;
 621
 622                 n = cpu_replicas_add_entry(&c->replicas, r);
 623                 if (!n.entries)
 624                         return -ENOMEM;
 625
 626                 ret = replicas_table_update(c, &n);
 627                 if (ret)
 628                         return ret;
 629
 630                 kfree(n.entries);
 631
 632                 idx = bch2_replicas_entry_idx(c, r);
 633                 BUG_ON(ret < 0);
 634         }
 635
 636         c->usage_base->replicas[idx] = sectors;
 637
 638         return 0;
 639 }
 640
 641 /* Replicas tracking - superblock: */
 642
 643 static int
 644 __bch2_sb_replicas_to_cpu_replicas(struct bch_sb_field_replicas *sb_r,
 645                                    struct bch_replicas_cpu *cpu_r)
 646 {
 647         struct bch_replicas_entry *e, *dst;
 648         unsigned nr = 0, entry_size = 0, idx = 0;
 649
 650         for_each_replicas_entry(sb_r, e) {
 651                 entry_size = max_t(unsigned, entry_size,
 652                                    replicas_entry_bytes(e));
 653                 nr++;
 654         }
 655
 656         cpu_r->entries = kcalloc(nr, entry_size, GFP_KERNEL);
 657         if (!cpu_r->entries)
 658                 return -ENOMEM;
 659
 660         cpu_r->nr               = nr;
 661         cpu_r->entry_size       = entry_size;
 662
 663         for_each_replicas_entry(sb_r, e) {
 664                 dst = cpu_replicas_entry(cpu_r, idx++);
 665                 memcpy(dst, e, replicas_entry_bytes(e));
 666                 bch2_replicas_entry_sort(dst);
 667         }
 668
 669         return 0;
 670 }
 671
 672 static int
 673 __bch2_sb_replicas_v0_to_cpu_replicas(struct bch_sb_field_replicas_v0 *sb_r,
 674                                       struct bch_replicas_cpu *cpu_r)
 675 {
 676         struct bch_replicas_entry_v0 *e;
 677         unsigned nr = 0, entry_size = 0, idx = 0;
 678
 679         for_each_replicas_entry(sb_r, e) {
 680                 entry_size = max_t(unsigned, entry_size,
 681                                    replicas_entry_bytes(e));
 682                 nr++;
 683         }
 684
 685         entry_size += sizeof(struct bch_replicas_entry) -
 686                 sizeof(struct bch_replicas_entry_v0);
 687
 688         cpu_r->entries = kcalloc(nr, entry_size, GFP_KERNEL);
 689         if (!cpu_r->entries)
 690                 return -ENOMEM;
 691
 692         cpu_r->nr               = nr;
 693         cpu_r->entry_size       = entry_size;
 694
 695         for_each_replicas_entry(sb_r, e) {
 696                 struct bch_replicas_entry *dst =
 697                         cpu_replicas_entry(cpu_r, idx++);
 698
 699                 dst->data_type  = e->data_type;
 700                 dst->nr_devs    = e->nr_devs;
 701                 dst->nr_required = 1;
 702                 memcpy(dst->devs, e->devs, e->nr_devs);
 703                 bch2_replicas_entry_sort(dst);
 704         }
 705
 706         return 0;
 707 }
 708
 709 int bch2_sb_replicas_to_cpu_replicas(struct bch_fs *c)
 710 {
 711         struct bch_sb_field_replicas *sb_v1;
 712         struct bch_sb_field_replicas_v0 *sb_v0;
 713         struct bch_replicas_cpu new_r = { 0, 0, NULL };
 714         int ret = 0;
 715
 716         if ((sb_v1 = bch2_sb_get_replicas(c->disk_sb.sb)))
 717                 ret = __bch2_sb_replicas_to_cpu_replicas(sb_v1, &new_r);
 718         else if ((sb_v0 = bch2_sb_get_replicas_v0(c->disk_sb.sb)))
 719                 ret = __bch2_sb_replicas_v0_to_cpu_replicas(sb_v0, &new_r);
 720
 721         if (ret)
 722                 return -ENOMEM;
 723
 724         bch2_cpu_replicas_sort(&new_r);
 725
 726         percpu_down_write(&c->mark_lock);
 727
 728         ret = replicas_table_update(c, &new_r);
 729         percpu_up_write(&c->mark_lock);
 730
 731         kfree(new_r.entries);
 732
 733         return 0;
 734 }
 735
 736 static int bch2_cpu_replicas_to_sb_replicas_v0(struct bch_fs *c,
 737                                                struct bch_replicas_cpu *r)
 738 {
 739         struct bch_sb_field_replicas_v0 *sb_r;
 740         struct bch_replicas_entry_v0 *dst;
 741         struct bch_replicas_entry *src;
 742         size_t bytes;
 743
 744         bytes = sizeof(struct bch_sb_field_replicas);
 745
 746         for_each_cpu_replicas_entry(r, src)
 747                 bytes += replicas_entry_bytes(src) - 1;
 748
 749         sb_r = bch2_sb_resize_replicas_v0(&c->disk_sb,
 750                         DIV_ROUND_UP(bytes, sizeof(u64)));
 751         if (!sb_r)
 752                 return -BCH_ERR_ENOSPC_sb_replicas;
 753
 754         bch2_sb_field_delete(&c->disk_sb, BCH_SB_FIELD_replicas);
 755         sb_r = bch2_sb_get_replicas_v0(c->disk_sb.sb);
 756
 757         memset(&sb_r->entries, 0,
 758                vstruct_end(&sb_r->field) -
 759                (void *) &sb_r->entries);
 760
 761         dst = sb_r->entries;
 762         for_each_cpu_replicas_entry(r, src) {
 763                 dst->data_type  = src->data_type;
 764                 dst->nr_devs    = src->nr_devs;
 765                 memcpy(dst->devs, src->devs, src->nr_devs);
 766
 767                 dst = replicas_entry_next(dst);
 768
 769                 BUG_ON((void *) dst > vstruct_end(&sb_r->field));
 770         }
 771
 772         return 0;
 773 }
 774
 775 static int bch2_cpu_replicas_to_sb_replicas(struct bch_fs *c,
 776                                             struct bch_replicas_cpu *r)
 777 {
 778         struct bch_sb_field_replicas *sb_r;
 779         struct bch_replicas_entry *dst, *src;
 780         bool need_v1 = false;
 781         size_t bytes;
 782
 783         bytes = sizeof(struct bch_sb_field_replicas);
 784
 785         for_each_cpu_replicas_entry(r, src) {
 786                 bytes += replicas_entry_bytes(src);
 787                 if (src->nr_required != 1)
 788                         need_v1 = true;
 789         }
 790
 791         if (!need_v1)
 792                 return bch2_cpu_replicas_to_sb_replicas_v0(c, r);
 793
 794         sb_r = bch2_sb_resize_replicas(&c->disk_sb,
 795                         DIV_ROUND_UP(bytes, sizeof(u64)));
 796         if (!sb_r)
 797                 return -BCH_ERR_ENOSPC_sb_replicas;
 798
 799         bch2_sb_field_delete(&c->disk_sb, BCH_SB_FIELD_replicas_v0);
 800         sb_r = bch2_sb_get_replicas(c->disk_sb.sb);
 801
 802         memset(&sb_r->entries, 0,
 803                vstruct_end(&sb_r->field) -
 804                (void *) &sb_r->entries);
 805
 806         dst = sb_r->entries;
 807         for_each_cpu_replicas_entry(r, src) {
 808                 memcpy(dst, src, replicas_entry_bytes(src));
 809
 810                 dst = replicas_entry_next(dst);
 811
 812                 BUG_ON((void *) dst > vstruct_end(&sb_r->field));
 813         }
 814
 815         return 0;
 816 }
 817
 818 static int bch2_cpu_replicas_validate(struct bch_replicas_cpu *cpu_r,
 819                                       struct bch_sb *sb,
 820                                       struct printbuf *err)
 821 {
 822         struct bch_sb_field_members *mi = bch2_sb_get_members(sb);
 823         unsigned i, j;
 824
 825         sort_cmp_size(cpu_r->entries,
 826                       cpu_r->nr,
 827                       cpu_r->entry_size,
 828                       memcmp, NULL);
 829
 830         for (i = 0; i < cpu_r->nr; i++) {
 831                 struct bch_replicas_entry *e =
 832                         cpu_replicas_entry(cpu_r, i);
 833
 834                 if (e->data_type >= BCH_DATA_NR) {
 835                         prt_printf(err, "invalid data type in entry ");
 836                         bch2_replicas_entry_to_text(err, e);
 837                         return -BCH_ERR_invalid_sb_replicas;
 838                 }
 839
 840                 if (!e->nr_devs) {
 841                         prt_printf(err, "no devices in entry ");
 842                         bch2_replicas_entry_to_text(err, e);
 843                         return -BCH_ERR_invalid_sb_replicas;
 844                 }
 845
 846                 if (e->nr_required > 1 &&
 847                     e->nr_required >= e->nr_devs) {
 848                         prt_printf(err, "bad nr_required in entry ");
 849                         bch2_replicas_entry_to_text(err, e);
 850                         return -BCH_ERR_invalid_sb_replicas;
 851                 }
 852
 853                 for (j = 0; j < e->nr_devs; j++)
 854                         if (!bch2_dev_exists(sb, mi, e->devs[j])) {
 855                                 prt_printf(err, "invalid device %u in entry ", e->devs[j]);
 856                                 bch2_replicas_entry_to_text(err, e);
 857                                 return -BCH_ERR_invalid_sb_replicas;
 858                         }
 859
 860                 if (i + 1 < cpu_r->nr) {
 861                         struct bch_replicas_entry *n =
 862                                 cpu_replicas_entry(cpu_r, i + 1);
 863
 864                         BUG_ON(memcmp(e, n, cpu_r->entry_size) > 0);
 865
 866                         if (!memcmp(e, n, cpu_r->entry_size)) {
 867                                 prt_printf(err, "duplicate replicas entry ");
 868                                 bch2_replicas_entry_to_text(err, e);
 869                                 return -BCH_ERR_invalid_sb_replicas;
 870                         }
 871                 }
 872         }
 873
 874         return 0;
 875 }
 876
 877 static int bch2_sb_replicas_validate(struct bch_sb *sb, struct bch_sb_field *f,
 878                                      struct printbuf *err)
 879 {
 880         struct bch_sb_field_replicas *sb_r = field_to_type(f, replicas);
 881         struct bch_replicas_cpu cpu_r;
 882         int ret;
 883
 884         if (__bch2_sb_replicas_to_cpu_replicas(sb_r, &cpu_r))
 885                 return -ENOMEM;
 886
 887         ret = bch2_cpu_replicas_validate(&cpu_r, sb, err);
 888         kfree(cpu_r.entries);
 889         return ret;
 890 }
 891
 892 static void bch2_sb_replicas_to_text(struct printbuf *out,
 893                                      struct bch_sb *sb,
 894                                      struct bch_sb_field *f)
 895 {
 896         struct bch_sb_field_replicas *r = field_to_type(f, replicas);
 897         struct bch_replicas_entry *e;
 898         bool first = true;
 899
 900         for_each_replicas_entry(r, e) {
 901                 if (!first)
 902                         prt_printf(out, " ");
 903                 first = false;
 904
 905                 bch2_replicas_entry_to_text(out, e);
 906         }
 907         prt_newline(out);
 908 }
 909
 910 const struct bch_sb_field_ops bch_sb_field_ops_replicas = {
 911         .validate       = bch2_sb_replicas_validate,
 912         .to_text        = bch2_sb_replicas_to_text,
 913 };
 914
 915 static int bch2_sb_replicas_v0_validate(struct bch_sb *sb, struct bch_sb_field *f,
 916                                         struct printbuf *err)
 917 {
 918         struct bch_sb_field_replicas_v0 *sb_r = field_to_type(f, replicas_v0);
 919         struct bch_replicas_cpu cpu_r;
 920         int ret;
 921
 922         if (__bch2_sb_replicas_v0_to_cpu_replicas(sb_r, &cpu_r))
 923                 return -ENOMEM;
 924
 925         ret = bch2_cpu_replicas_validate(&cpu_r, sb, err);
 926         kfree(cpu_r.entries);
 927         return ret;
 928 }
 929
 930 static void bch2_sb_replicas_v0_to_text(struct printbuf *out,
 931                                         struct bch_sb *sb,
 932                                         struct bch_sb_field *f)
 933 {
 934         struct bch_sb_field_replicas_v0 *sb_r = field_to_type(f, replicas_v0);
 935         struct bch_replicas_entry_v0 *e;
 936         bool first = true;
 937
 938         for_each_replicas_entry(sb_r, e) {
 939                 if (!first)
 940                         prt_printf(out, " ");
 941                 first = false;
 942
 943                 bch2_replicas_entry_v0_to_text(out, e);
 944         }
 945         prt_newline(out);
 946 }
 947
 948 const struct bch_sb_field_ops bch_sb_field_ops_replicas_v0 = {
 949         .validate       = bch2_sb_replicas_v0_validate,
 950         .to_text        = bch2_sb_replicas_v0_to_text,
 951 };
 952
 953 /* Query replicas: */
 954
 955 bool bch2_have_enough_devs(struct bch_fs *c, struct bch_devs_mask devs,
 956                            unsigned flags, bool print)
 957 {
 958         struct bch_replicas_entry *e;
 959         bool ret = true;
 960
 961         percpu_down_read(&c->mark_lock);
 962         for_each_cpu_replicas_entry(&c->replicas, e) {
 963                 unsigned i, nr_online = 0, nr_failed = 0, dflags = 0;
 964                 bool metadata = e->data_type < BCH_DATA_user;
 965
 966                 if (e->data_type == BCH_DATA_cached)
 967                         continue;
 968
 969                 for (i = 0; i < e->nr_devs; i++) {
 970                         struct bch_dev *ca = bch_dev_bkey_exists(c, e->devs[i]);
 971
 972                         nr_online += test_bit(e->devs[i], devs.d);
 973                         nr_failed += ca->mi.state == BCH_MEMBER_STATE_failed;
 974                 }
 975
 976                 if (nr_failed == e->nr_devs)
 977                         continue;
 978
 979                 if (nr_online < e->nr_required)
 980                         dflags |= metadata
 981                                 ? BCH_FORCE_IF_METADATA_LOST
 982                                 : BCH_FORCE_IF_DATA_LOST;
 983
 984                 if (nr_online < e->nr_devs)
 985                         dflags |= metadata
 986                                 ? BCH_FORCE_IF_METADATA_DEGRADED
 987                                 : BCH_FORCE_IF_DATA_DEGRADED;
 988
 989                 if (dflags & ~flags) {
 990                         if (print) {
 991                                 struct printbuf buf = PRINTBUF;
 992
 993                                 bch2_replicas_entry_to_text(&buf, e);
 994                                 bch_err(c, "insufficient devices online (%u) for replicas entry %s",
 995                                         nr_online, buf.buf);
 996                                 printbuf_exit(&buf);
 997                         }
 998                         ret = false;
 999                         break;
1000                 }
1001
1002         }
1003         percpu_up_read(&c->mark_lock);
1004
1005         return ret;
1006 }
1007
1008 unsigned bch2_sb_dev_has_data(struct bch_sb *sb, unsigned dev)
1009 {
1010         struct bch_sb_field_replicas *replicas;
1011         struct bch_sb_field_replicas_v0 *replicas_v0;
1012         unsigned i, data_has = 0;
1013
1014         replicas = bch2_sb_get_replicas(sb);
1015         replicas_v0 = bch2_sb_get_replicas_v0(sb);
1016
1017         if (replicas) {
1018                 struct bch_replicas_entry *r;
1019
1020                 for_each_replicas_entry(replicas, r)
1021                         for (i = 0; i < r->nr_devs; i++)
1022                                 if (r->devs[i] == dev)
1023                                         data_has |= 1 << r->data_type;
1024         } else if (replicas_v0) {
1025                 struct bch_replicas_entry_v0 *r;
1026
1027                 for_each_replicas_entry_v0(replicas_v0, r)
1028                         for (i = 0; i < r->nr_devs; i++)
1029                                 if (r->devs[i] == dev)
1030                                         data_has |= 1 << r->data_type;
1031         }
1032
1033
1034         return data_has;
1035 }
1036
1037 unsigned bch2_dev_has_data(struct bch_fs *c, struct bch_dev *ca)
1038 {
1039         unsigned ret;
1040
1041         mutex_lock(&c->sb_lock);
1042         ret = bch2_sb_dev_has_data(c->disk_sb.sb, ca->dev_idx);
1043         mutex_unlock(&c->sb_lock);
1044
1045         return ret;
1046 }
1047
1048 void bch2_fs_replicas_exit(struct bch_fs *c)
1049 {
1050         unsigned i;
1051
1052         kfree(c->usage_scratch);
1053         for (i = 0; i < ARRAY_SIZE(c->usage); i++)
1054                 free_percpu(c->usage[i]);
1055         kfree(c->usage_base);
1056         kfree(c->replicas.entries);
1057         kfree(c->replicas_gc.entries);
1058
1059         mempool_exit(&c->replicas_delta_pool);
1060 }
1061
1062 int bch2_fs_replicas_init(struct bch_fs *c)
1063 {
1064         bch2_journal_entry_res_resize(&c->journal,
1065                         &c->replicas_journal_res,
1066                         reserve_journal_replicas(c, &c->replicas));
1067
1068         return mempool_init_kmalloc_pool(&c->replicas_delta_pool, 1,
1069                                          REPLICAS_DELTA_LIST_MAX) ?:
1070                 replicas_table_update(c, &c->replicas);
1071 }