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

   1 // SPDX-License-Identifier: GPL-2.0
   2
   3 /* erasure coding */
   4
   5 #include "bcachefs.h"
   6 #include "alloc_foreground.h"
   7 #include "backpointers.h"
   8 #include "bkey_buf.h"
   9 #include "bset.h"
  10 #include "btree_gc.h"
  11 #include "btree_update.h"
  12 #include "btree_write_buffer.h"
  13 #include "buckets.h"
  14 #include "disk_groups.h"
  15 #include "ec.h"
  16 #include "error.h"
  17 #include "io.h"
  18 #include "keylist.h"
  19 #include "recovery.h"
  20 #include "replicas.h"
  21 #include "super-io.h"
  22 #include "util.h"
  23
  24 #include <linux/sort.h>
  25
  26 #ifdef __KERNEL__
  27
  28 #include <linux/raid/pq.h>
  29 #include <linux/raid/xor.h>
  30
  31 static void raid5_recov(unsigned disks, unsigned failed_idx,
  32                         size_t size, void **data)
  33 {
  34         unsigned i = 2, nr;
  35
  36         BUG_ON(failed_idx >= disks);
  37
  38         swap(data[0], data[failed_idx]);
  39         memcpy(data[0], data[1], size);
  40
  41         while (i < disks) {
  42                 nr = min_t(unsigned, disks - i, MAX_XOR_BLOCKS);
  43                 xor_blocks(nr, size, data[0], data + i);
  44                 i += nr;
  45         }
  46
  47         swap(data[0], data[failed_idx]);
  48 }
  49
  50 static void raid_gen(int nd, int np, size_t size, void **v)
  51 {
  52         if (np >= 1)
  53                 raid5_recov(nd + np, nd, size, v);
  54         if (np >= 2)
  55                 raid6_call.gen_syndrome(nd + np, size, v);
  56         BUG_ON(np > 2);
  57 }
  58
  59 static void raid_rec(int nr, int *ir, int nd, int np, size_t size, void **v)
  60 {
  61         switch (nr) {
  62         case 0:
  63                 break;
  64         case 1:
  65                 if (ir[0] < nd + 1)
  66                         raid5_recov(nd + 1, ir[0], size, v);
  67                 else
  68                         raid6_call.gen_syndrome(nd + np, size, v);
  69                 break;
  70         case 2:
  71                 if (ir[1] < nd) {
  72                         /* data+data failure. */
  73                         raid6_2data_recov(nd + np, size, ir[0], ir[1], v);
  74                 } else if (ir[0] < nd) {
  75                         /* data + p/q failure */
  76
  77                         if (ir[1] == nd) /* data + p failure */
  78                                 raid6_datap_recov(nd + np, size, ir[0], v);
  79                         else { /* data + q failure */
  80                                 raid5_recov(nd + 1, ir[0], size, v);
  81                                 raid6_call.gen_syndrome(nd + np, size, v);
  82                         }
  83                 } else {
  84                         raid_gen(nd, np, size, v);
  85                 }
  86                 break;
  87         default:
  88                 BUG();
  89         }
  90 }
  91
  92 #else
  93
  94 #include <raid/raid.h>
  95
  96 #endif
  97
  98 struct ec_bio {
  99         struct bch_dev          *ca;
 100         struct ec_stripe_buf    *buf;
 101         size_t                  idx;
 102         struct bio              bio;
 103 };
 104
 105 /* Stripes btree keys: */
 106
 107 int bch2_stripe_invalid(const struct bch_fs *c, struct bkey_s_c k,
 108                         unsigned flags, struct printbuf *err)
 109 {
 110         const struct bch_stripe *s = bkey_s_c_to_stripe(k).v;
 111
 112         if (bkey_eq(k.k->p, POS_MIN)) {
 113                 prt_printf(err, "stripe at POS_MIN");
 114                 return -BCH_ERR_invalid_bkey;
 115         }
 116
 117         if (k.k->p.inode) {
 118                 prt_printf(err, "nonzero inode field");
 119                 return -BCH_ERR_invalid_bkey;
 120         }
 121
 122         if (bkey_val_bytes(k.k) < sizeof(*s)) {
 123                 prt_printf(err, "incorrect value size (%zu < %zu)",
 124                        bkey_val_bytes(k.k), sizeof(*s));
 125                 return -BCH_ERR_invalid_bkey;
 126         }
 127
 128         if (bkey_val_u64s(k.k) < stripe_val_u64s(s)) {
 129                 prt_printf(err, "incorrect value size (%zu < %u)",
 130                        bkey_val_u64s(k.k), stripe_val_u64s(s));
 131                 return -BCH_ERR_invalid_bkey;
 132         }
 133
 134         return bch2_bkey_ptrs_invalid(c, k, flags, err);
 135 }
 136
 137 void bch2_stripe_to_text(struct printbuf *out, struct bch_fs *c,
 138                          struct bkey_s_c k)
 139 {
 140         const struct bch_stripe *s = bkey_s_c_to_stripe(k).v;
 141         unsigned i, nr_data = s->nr_blocks - s->nr_redundant;
 142
 143         prt_printf(out, "algo %u sectors %u blocks %u:%u csum %u gran %u",
 144                s->algorithm,
 145                le16_to_cpu(s->sectors),
 146                nr_data,
 147                s->nr_redundant,
 148                s->csum_type,
 149                1U << s->csum_granularity_bits);
 150
 151         for (i = 0; i < s->nr_blocks; i++) {
 152                 const struct bch_extent_ptr *ptr = s->ptrs + i;
 153                 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
 154                 u32 offset;
 155                 u64 b = sector_to_bucket_and_offset(ca, ptr->offset, &offset);
 156
 157                 prt_printf(out, " %u:%llu:%u", ptr->dev, b, offset);
 158                 if (i < nr_data)
 159                         prt_printf(out, "#%u", stripe_blockcount_get(s, i));
 160                 if (ptr_stale(ca, ptr))
 161                         prt_printf(out, " stale");
 162         }
 163 }
 164
 165 /* returns blocknr in stripe that we matched: */
 166 static const struct bch_extent_ptr *bkey_matches_stripe(struct bch_stripe *s,
 167                                                 struct bkey_s_c k, unsigned *block)
 168 {
 169         struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
 170         const struct bch_extent_ptr *ptr;
 171         unsigned i, nr_data = s->nr_blocks - s->nr_redundant;
 172
 173         bkey_for_each_ptr(ptrs, ptr)
 174                 for (i = 0; i < nr_data; i++)
 175                         if (__bch2_ptr_matches_stripe(&s->ptrs[i], ptr,
 176                                                       le16_to_cpu(s->sectors))) {
 177                                 *block = i;
 178                                 return ptr;
 179                         }
 180
 181         return NULL;
 182 }
 183
 184 static bool extent_has_stripe_ptr(struct bkey_s_c k, u64 idx)
 185 {
 186         switch (k.k->type) {
 187         case KEY_TYPE_extent: {
 188                 struct bkey_s_c_extent e = bkey_s_c_to_extent(k);
 189                 const union bch_extent_entry *entry;
 190
 191                 extent_for_each_entry(e, entry)
 192                         if (extent_entry_type(entry) ==
 193                             BCH_EXTENT_ENTRY_stripe_ptr &&
 194                             entry->stripe_ptr.idx == idx)
 195                                 return true;
 196
 197                 break;
 198         }
 199         }
 200
 201         return false;
 202 }
 203
 204 /* Stripe bufs: */
 205
 206 static void ec_stripe_buf_exit(struct ec_stripe_buf *buf)
 207 {
 208         unsigned i;
 209
 210         for (i = 0; i < buf->key.v.nr_blocks; i++) {
 211                 kvpfree(buf->data[i], buf->size << 9);
 212                 buf->data[i] = NULL;
 213         }
 214 }
 215
 216 static int ec_stripe_buf_init(struct ec_stripe_buf *buf,
 217                                unsigned offset, unsigned size)
 218 {
 219         struct bch_stripe *v = &buf->key.v;
 220         unsigned csum_granularity = 1U << v->csum_granularity_bits;
 221         unsigned end = offset + size;
 222         unsigned i;
 223
 224         BUG_ON(end > le16_to_cpu(v->sectors));
 225
 226         offset  = round_down(offset, csum_granularity);
 227         end     = min_t(unsigned, le16_to_cpu(v->sectors),
 228                         round_up(end, csum_granularity));
 229
 230         buf->offset     = offset;
 231         buf->size       = end - offset;
 232
 233         memset(buf->valid, 0xFF, sizeof(buf->valid));
 234
 235         for (i = 0; i < buf->key.v.nr_blocks; i++) {
 236                 buf->data[i] = kvpmalloc(buf->size << 9, GFP_KERNEL);
 237                 if (!buf->data[i])
 238                         goto err;
 239         }
 240
 241         return 0;
 242 err:
 243         ec_stripe_buf_exit(buf);
 244         return -ENOMEM;
 245 }
 246
 247 /* Checksumming: */
 248
 249 static struct bch_csum ec_block_checksum(struct ec_stripe_buf *buf,
 250                                          unsigned block, unsigned offset)
 251 {
 252         struct bch_stripe *v = &buf->key.v;
 253         unsigned csum_granularity = 1 << v->csum_granularity_bits;
 254         unsigned end = buf->offset + buf->size;
 255         unsigned len = min(csum_granularity, end - offset);
 256
 257         BUG_ON(offset >= end);
 258         BUG_ON(offset <  buf->offset);
 259         BUG_ON(offset & (csum_granularity - 1));
 260         BUG_ON(offset + len != le16_to_cpu(v->sectors) &&
 261                (len & (csum_granularity - 1)));
 262
 263         return bch2_checksum(NULL, v->csum_type,
 264                              null_nonce(),
 265                              buf->data[block] + ((offset - buf->offset) << 9),
 266                              len << 9);
 267 }
 268
 269 static void ec_generate_checksums(struct ec_stripe_buf *buf)
 270 {
 271         struct bch_stripe *v = &buf->key.v;
 272         unsigned i, j, csums_per_device = stripe_csums_per_device(v);
 273
 274         if (!v->csum_type)
 275                 return;
 276
 277         BUG_ON(buf->offset);
 278         BUG_ON(buf->size != le16_to_cpu(v->sectors));
 279
 280         for (i = 0; i < v->nr_blocks; i++)
 281                 for (j = 0; j < csums_per_device; j++)
 282                         stripe_csum_set(v, i, j,
 283                                 ec_block_checksum(buf, i, j << v->csum_granularity_bits));
 284 }
 285
 286 static void ec_validate_checksums(struct bch_fs *c, struct ec_stripe_buf *buf)
 287 {
 288         struct bch_stripe *v = &buf->key.v;
 289         unsigned csum_granularity = 1 << v->csum_granularity_bits;
 290         unsigned i;
 291
 292         if (!v->csum_type)
 293                 return;
 294
 295         for (i = 0; i < v->nr_blocks; i++) {
 296                 unsigned offset = buf->offset;
 297                 unsigned end = buf->offset + buf->size;
 298
 299                 if (!test_bit(i, buf->valid))
 300                         continue;
 301
 302                 while (offset < end) {
 303                         unsigned j = offset >> v->csum_granularity_bits;
 304                         unsigned len = min(csum_granularity, end - offset);
 305                         struct bch_csum want = stripe_csum_get(v, i, j);
 306                         struct bch_csum got = ec_block_checksum(buf, i, offset);
 307
 308                         if (bch2_crc_cmp(want, got)) {
 309                                 struct printbuf buf2 = PRINTBUF;
 310
 311                                 bch2_bkey_val_to_text(&buf2, c, bkey_i_to_s_c(&buf->key.k_i));
 312
 313                                 bch_err_ratelimited(c,
 314                                         "stripe checksum error for %ps at %u:%u: csum type %u, expected %llx got %llx\n%s",
 315                                         (void *) _RET_IP_, i, j, v->csum_type,
 316                                         want.lo, got.lo, buf2.buf);
 317                                 printbuf_exit(&buf2);
 318                                 clear_bit(i, buf->valid);
 319                                 break;
 320                         }
 321
 322                         offset += len;
 323                 }
 324         }
 325 }
 326
 327 /* Erasure coding: */
 328
 329 static void ec_generate_ec(struct ec_stripe_buf *buf)
 330 {
 331         struct bch_stripe *v = &buf->key.v;
 332         unsigned nr_data = v->nr_blocks - v->nr_redundant;
 333         unsigned bytes = le16_to_cpu(v->sectors) << 9;
 334
 335         raid_gen(nr_data, v->nr_redundant, bytes, buf->data);
 336 }
 337
 338 static unsigned ec_nr_failed(struct ec_stripe_buf *buf)
 339 {
 340         return buf->key.v.nr_blocks -
 341                 bitmap_weight(buf->valid, buf->key.v.nr_blocks);
 342 }
 343
 344 static int ec_do_recov(struct bch_fs *c, struct ec_stripe_buf *buf)
 345 {
 346         struct bch_stripe *v = &buf->key.v;
 347         unsigned i, failed[BCH_BKEY_PTRS_MAX], nr_failed = 0;
 348         unsigned nr_data = v->nr_blocks - v->nr_redundant;
 349         unsigned bytes = buf->size << 9;
 350
 351         if (ec_nr_failed(buf) > v->nr_redundant) {
 352                 bch_err_ratelimited(c,
 353                         "error doing reconstruct read: unable to read enough blocks");
 354                 return -1;
 355         }
 356
 357         for (i = 0; i < nr_data; i++)
 358                 if (!test_bit(i, buf->valid))
 359                         failed[nr_failed++] = i;
 360
 361         raid_rec(nr_failed, failed, nr_data, v->nr_redundant, bytes, buf->data);
 362         return 0;
 363 }
 364
 365 /* IO: */
 366
 367 static void ec_block_endio(struct bio *bio)
 368 {
 369         struct ec_bio *ec_bio = container_of(bio, struct ec_bio, bio);
 370         struct bch_stripe *v = &ec_bio->buf->key.v;
 371         struct bch_extent_ptr *ptr = &v->ptrs[ec_bio->idx];
 372         struct bch_dev *ca = ec_bio->ca;
 373         struct closure *cl = bio->bi_private;
 374
 375         if (bch2_dev_io_err_on(bio->bi_status, ca, "erasure coding %s error: %s",
 376                                bio_data_dir(bio) ? "write" : "read",
 377                                bch2_blk_status_to_str(bio->bi_status)))
 378                 clear_bit(ec_bio->idx, ec_bio->buf->valid);
 379
 380         if (ptr_stale(ca, ptr)) {
 381                 bch_err_ratelimited(ca->fs,
 382                                     "error %s stripe: stale pointer after io",
 383                                     bio_data_dir(bio) == READ ? "reading from" : "writing to");
 384                 clear_bit(ec_bio->idx, ec_bio->buf->valid);
 385         }
 386
 387         bio_put(&ec_bio->bio);
 388         percpu_ref_put(&ca->io_ref);
 389         closure_put(cl);
 390 }
 391
 392 static void ec_block_io(struct bch_fs *c, struct ec_stripe_buf *buf,
 393                         unsigned rw, unsigned idx, struct closure *cl)
 394 {
 395         struct bch_stripe *v = &buf->key.v;
 396         unsigned offset = 0, bytes = buf->size << 9;
 397         struct bch_extent_ptr *ptr = &v->ptrs[idx];
 398         struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
 399         enum bch_data_type data_type = idx < buf->key.v.nr_blocks - buf->key.v.nr_redundant
 400                 ? BCH_DATA_user
 401                 : BCH_DATA_parity;
 402
 403         if (ptr_stale(ca, ptr)) {
 404                 bch_err_ratelimited(c,
 405                                     "error %s stripe: stale pointer",
 406                                     rw == READ ? "reading from" : "writing to");
 407                 clear_bit(idx, buf->valid);
 408                 return;
 409         }
 410
 411         if (!bch2_dev_get_ioref(ca, rw)) {
 412                 clear_bit(idx, buf->valid);
 413                 return;
 414         }
 415
 416         this_cpu_add(ca->io_done->sectors[rw][data_type], buf->size);
 417
 418         while (offset < bytes) {
 419                 unsigned nr_iovecs = min_t(size_t, BIO_MAX_VECS,
 420                                            DIV_ROUND_UP(bytes, PAGE_SIZE));
 421                 unsigned b = min_t(size_t, bytes - offset,
 422                                    nr_iovecs << PAGE_SHIFT);
 423                 struct ec_bio *ec_bio;
 424
 425                 ec_bio = container_of(bio_alloc_bioset(ca->disk_sb.bdev,
 426                                                        nr_iovecs,
 427                                                        rw,
 428                                                        GFP_KERNEL,
 429                                                        &c->ec_bioset),
 430                                       struct ec_bio, bio);
 431
 432                 ec_bio->ca                      = ca;
 433                 ec_bio->buf                     = buf;
 434                 ec_bio->idx                     = idx;
 435
 436                 ec_bio->bio.bi_iter.bi_sector   = ptr->offset + buf->offset + (offset >> 9);
 437                 ec_bio->bio.bi_end_io           = ec_block_endio;
 438                 ec_bio->bio.bi_private          = cl;
 439
 440                 bch2_bio_map(&ec_bio->bio, buf->data[idx] + offset, b);
 441
 442                 closure_get(cl);
 443                 percpu_ref_get(&ca->io_ref);
 444
 445                 submit_bio(&ec_bio->bio);
 446
 447                 offset += b;
 448         }
 449
 450         percpu_ref_put(&ca->io_ref);
 451 }
 452
 453 static int get_stripe_key_trans(struct btree_trans *trans, u64 idx,
 454                                 struct ec_stripe_buf *stripe)
 455 {
 456         struct btree_iter iter;
 457         struct bkey_s_c k;
 458         int ret;
 459
 460         bch2_trans_iter_init(trans, &iter, BTREE_ID_stripes,
 461                              POS(0, idx), BTREE_ITER_SLOTS);
 462         k = bch2_btree_iter_peek_slot(&iter);
 463         ret = bkey_err(k);
 464         if (ret)
 465                 goto err;
 466         if (k.k->type != KEY_TYPE_stripe) {
 467                 ret = -ENOENT;
 468                 goto err;
 469         }
 470         bkey_reassemble(&stripe->key.k_i, k);
 471 err:
 472         bch2_trans_iter_exit(trans, &iter);
 473         return ret;
 474 }
 475
 476 static int get_stripe_key(struct bch_fs *c, u64 idx, struct ec_stripe_buf *stripe)
 477 {
 478         return bch2_trans_run(c, get_stripe_key_trans(&trans, idx, stripe));
 479 }
 480
 481 /* recovery read path: */
 482 int bch2_ec_read_extent(struct bch_fs *c, struct bch_read_bio *rbio)
 483 {
 484         struct ec_stripe_buf *buf;
 485         struct closure cl;
 486         struct bch_stripe *v;
 487         unsigned i, offset;
 488         int ret = 0;
 489
 490         closure_init_stack(&cl);
 491
 492         BUG_ON(!rbio->pick.has_ec);
 493
 494         buf = kzalloc(sizeof(*buf), GFP_NOIO);
 495         if (!buf)
 496                 return -ENOMEM;
 497
 498         ret = get_stripe_key(c, rbio->pick.ec.idx, buf);
 499         if (ret) {
 500                 bch_err_ratelimited(c,
 501                         "error doing reconstruct read: error %i looking up stripe", ret);
 502                 kfree(buf);
 503                 return -EIO;
 504         }
 505
 506         v = &buf->key.v;
 507
 508         if (!bch2_ptr_matches_stripe(v, rbio->pick)) {
 509                 bch_err_ratelimited(c,
 510                         "error doing reconstruct read: pointer doesn't match stripe");
 511                 ret = -EIO;
 512                 goto err;
 513         }
 514
 515         offset = rbio->bio.bi_iter.bi_sector - v->ptrs[rbio->pick.ec.block].offset;
 516         if (offset + bio_sectors(&rbio->bio) > le16_to_cpu(v->sectors)) {
 517                 bch_err_ratelimited(c,
 518                         "error doing reconstruct read: read is bigger than stripe");
 519                 ret = -EIO;
 520                 goto err;
 521         }
 522
 523         ret = ec_stripe_buf_init(buf, offset, bio_sectors(&rbio->bio));
 524         if (ret)
 525                 goto err;
 526
 527         for (i = 0; i < v->nr_blocks; i++)
 528                 ec_block_io(c, buf, REQ_OP_READ, i, &cl);
 529
 530         closure_sync(&cl);
 531
 532         if (ec_nr_failed(buf) > v->nr_redundant) {
 533                 bch_err_ratelimited(c,
 534                         "error doing reconstruct read: unable to read enough blocks");
 535                 ret = -EIO;
 536                 goto err;
 537         }
 538
 539         ec_validate_checksums(c, buf);
 540
 541         ret = ec_do_recov(c, buf);
 542         if (ret)
 543                 goto err;
 544
 545         memcpy_to_bio(&rbio->bio, rbio->bio.bi_iter,
 546                       buf->data[rbio->pick.ec.block] + ((offset - buf->offset) << 9));
 547 err:
 548         ec_stripe_buf_exit(buf);
 549         kfree(buf);
 550         return ret;
 551 }
 552
 553 /* stripe bucket accounting: */
 554
 555 static int __ec_stripe_mem_alloc(struct bch_fs *c, size_t idx, gfp_t gfp)
 556 {
 557         ec_stripes_heap n, *h = &c->ec_stripes_heap;
 558
 559         if (idx >= h->size) {
 560                 if (!init_heap(&n, max(1024UL, roundup_pow_of_two(idx + 1)), gfp))
 561                         return -ENOMEM;
 562
 563                 mutex_lock(&c->ec_stripes_heap_lock);
 564                 if (n.size > h->size) {
 565                         memcpy(n.data, h->data, h->used * sizeof(h->data[0]));
 566                         n.used = h->used;
 567                         swap(*h, n);
 568                 }
 569                 mutex_unlock(&c->ec_stripes_heap_lock);
 570
 571                 free_heap(&n);
 572         }
 573
 574         if (!genradix_ptr_alloc(&c->stripes, idx, gfp))
 575                 return -ENOMEM;
 576
 577         if (c->gc_pos.phase != GC_PHASE_NOT_RUNNING &&
 578             !genradix_ptr_alloc(&c->gc_stripes, idx, gfp))
 579                 return -ENOMEM;
 580
 581         return 0;
 582 }
 583
 584 static int ec_stripe_mem_alloc(struct btree_trans *trans,
 585                                struct btree_iter *iter)
 586 {
 587         size_t idx = iter->pos.offset;
 588
 589         if (!__ec_stripe_mem_alloc(trans->c, idx, GFP_NOWAIT|__GFP_NOWARN))
 590                 return 0;
 591
 592         bch2_trans_unlock(trans);
 593
 594         return   __ec_stripe_mem_alloc(trans->c, idx, GFP_KERNEL) ?:
 595                 bch2_trans_relock(trans);
 596 }
 597
 598 /*
 599  * Hash table of open stripes:
 600  * Stripes that are being created or modified are kept in a hash table, so that
 601  * stripe deletion can skip them.
 602  */
 603
 604 static bool __bch2_stripe_is_open(struct bch_fs *c, u64 idx)
 605 {
 606         unsigned hash = hash_64(idx, ilog2(ARRAY_SIZE(c->ec_stripes_new)));
 607         struct ec_stripe_new *s;
 608
 609         hlist_for_each_entry(s, &c->ec_stripes_new[hash], hash)
 610                 if (s->idx == idx)
 611                         return true;
 612         return false;
 613 }
 614
 615 static bool bch2_stripe_is_open(struct bch_fs *c, u64 idx)
 616 {
 617         bool ret = false;
 618
 619         spin_lock(&c->ec_stripes_new_lock);
 620         ret = __bch2_stripe_is_open(c, idx);
 621         spin_unlock(&c->ec_stripes_new_lock);
 622
 623         return ret;
 624 }
 625
 626 static bool bch2_try_open_stripe(struct bch_fs *c,
 627                                  struct ec_stripe_new *s,
 628                                  u64 idx)
 629 {
 630         bool ret;
 631
 632         spin_lock(&c->ec_stripes_new_lock);
 633         ret = !__bch2_stripe_is_open(c, idx);
 634         if (ret) {
 635                 unsigned hash = hash_64(idx, ilog2(ARRAY_SIZE(c->ec_stripes_new)));
 636
 637                 s->idx = idx;
 638                 hlist_add_head(&s->hash, &c->ec_stripes_new[hash]);
 639         }
 640         spin_unlock(&c->ec_stripes_new_lock);
 641
 642         return ret;
 643 }
 644
 645 static void bch2_stripe_close(struct bch_fs *c, struct ec_stripe_new *s)
 646 {
 647         BUG_ON(!s->idx);
 648
 649         spin_lock(&c->ec_stripes_new_lock);
 650         hlist_del_init(&s->hash);
 651         spin_unlock(&c->ec_stripes_new_lock);
 652
 653         s->idx = 0;
 654 }
 655
 656 /* Heap of all existing stripes, ordered by blocks_nonempty */
 657
 658 static u64 stripe_idx_to_delete(struct bch_fs *c)
 659 {
 660         ec_stripes_heap *h = &c->ec_stripes_heap;
 661         size_t heap_idx;
 662
 663         lockdep_assert_held(&c->ec_stripes_heap_lock);
 664
 665         for (heap_idx = 0; heap_idx < h->used; heap_idx++)
 666                 if (h->data[heap_idx].blocks_nonempty == 0 &&
 667                     !bch2_stripe_is_open(c, h->data[heap_idx].idx))
 668                         return h->data[heap_idx].idx;
 669
 670         return 0;
 671 }
 672
 673 static inline int ec_stripes_heap_cmp(ec_stripes_heap *h,
 674                                       struct ec_stripe_heap_entry l,
 675                                       struct ec_stripe_heap_entry r)
 676 {
 677         return ((l.blocks_nonempty > r.blocks_nonempty) -
 678                 (l.blocks_nonempty < r.blocks_nonempty));
 679 }
 680
 681 static inline void ec_stripes_heap_set_backpointer(ec_stripes_heap *h,
 682                                                    size_t i)
 683 {
 684         struct bch_fs *c = container_of(h, struct bch_fs, ec_stripes_heap);
 685
 686         genradix_ptr(&c->stripes, h->data[i].idx)->heap_idx = i;
 687 }
 688
 689 static void heap_verify_backpointer(struct bch_fs *c, size_t idx)
 690 {
 691         ec_stripes_heap *h = &c->ec_stripes_heap;
 692         struct stripe *m = genradix_ptr(&c->stripes, idx);
 693
 694         BUG_ON(m->heap_idx >= h->used);
 695         BUG_ON(h->data[m->heap_idx].idx != idx);
 696 }
 697
 698 void bch2_stripes_heap_del(struct bch_fs *c,
 699                            struct stripe *m, size_t idx)
 700 {
 701         mutex_lock(&c->ec_stripes_heap_lock);
 702         heap_verify_backpointer(c, idx);
 703
 704         heap_del(&c->ec_stripes_heap, m->heap_idx,
 705                  ec_stripes_heap_cmp,
 706                  ec_stripes_heap_set_backpointer);
 707         mutex_unlock(&c->ec_stripes_heap_lock);
 708 }
 709
 710 void bch2_stripes_heap_insert(struct bch_fs *c,
 711                               struct stripe *m, size_t idx)
 712 {
 713         mutex_lock(&c->ec_stripes_heap_lock);
 714         BUG_ON(heap_full(&c->ec_stripes_heap));
 715
 716         heap_add(&c->ec_stripes_heap, ((struct ec_stripe_heap_entry) {
 717                         .idx = idx,
 718                         .blocks_nonempty = m->blocks_nonempty,
 719                 }),
 720                  ec_stripes_heap_cmp,
 721                  ec_stripes_heap_set_backpointer);
 722
 723         heap_verify_backpointer(c, idx);
 724         mutex_unlock(&c->ec_stripes_heap_lock);
 725 }
 726
 727 void bch2_stripes_heap_update(struct bch_fs *c,
 728                               struct stripe *m, size_t idx)
 729 {
 730         ec_stripes_heap *h = &c->ec_stripes_heap;
 731         bool do_deletes;
 732         size_t i;
 733
 734         mutex_lock(&c->ec_stripes_heap_lock);
 735         heap_verify_backpointer(c, idx);
 736
 737         h->data[m->heap_idx].blocks_nonempty = m->blocks_nonempty;
 738
 739         i = m->heap_idx;
 740         heap_sift_up(h,   i, ec_stripes_heap_cmp,
 741                      ec_stripes_heap_set_backpointer);
 742         heap_sift_down(h, i, ec_stripes_heap_cmp,
 743                        ec_stripes_heap_set_backpointer);
 744
 745         heap_verify_backpointer(c, idx);
 746
 747         do_deletes = stripe_idx_to_delete(c) != 0;
 748         mutex_unlock(&c->ec_stripes_heap_lock);
 749
 750         if (do_deletes)
 751                 bch2_do_stripe_deletes(c);
 752 }
 753
 754 /* stripe deletion */
 755
 756 static int ec_stripe_delete(struct btree_trans *trans, u64 idx)
 757 {
 758         struct bch_fs *c = trans->c;
 759         struct btree_iter iter;
 760         struct bkey_s_c k;
 761         struct bkey_s_c_stripe s;
 762         int ret;
 763
 764         bch2_trans_iter_init(trans, &iter, BTREE_ID_stripes, POS(0, idx),
 765                              BTREE_ITER_INTENT);
 766         k = bch2_btree_iter_peek_slot(&iter);
 767         ret = bkey_err(k);
 768         if (ret)
 769                 goto err;
 770
 771         if (k.k->type != KEY_TYPE_stripe) {
 772                 bch2_fs_inconsistent(c, "attempting to delete nonexistent stripe %llu", idx);
 773                 ret = -EINVAL;
 774                 goto err;
 775         }
 776
 777         s = bkey_s_c_to_stripe(k);
 778         for (unsigned i = 0; i < s.v->nr_blocks; i++)
 779                 if (stripe_blockcount_get(s.v, i)) {
 780                         struct printbuf buf = PRINTBUF;
 781
 782                         bch2_bkey_val_to_text(&buf, c, k);
 783                         bch2_fs_inconsistent(c, "attempting to delete nonempty stripe %s", buf.buf);
 784                         printbuf_exit(&buf);
 785                         ret = -EINVAL;
 786                         goto err;
 787                 }
 788
 789         ret = bch2_btree_delete_at(trans, &iter, 0);
 790 err:
 791         bch2_trans_iter_exit(trans, &iter);
 792         return ret;
 793 }
 794
 795 static void ec_stripe_delete_work(struct work_struct *work)
 796 {
 797         struct bch_fs *c =
 798                 container_of(work, struct bch_fs, ec_stripe_delete_work);
 799         struct btree_trans trans;
 800         int ret;
 801         u64 idx;
 802
 803         bch2_trans_init(&trans, c, 0, 0);
 804
 805         while (1) {
 806                 mutex_lock(&c->ec_stripes_heap_lock);
 807                 idx = stripe_idx_to_delete(c);
 808                 mutex_unlock(&c->ec_stripes_heap_lock);
 809
 810                 if (!idx)
 811                         break;
 812
 813                 ret = commit_do(&trans, NULL, NULL, BTREE_INSERT_NOFAIL,
 814                                 ec_stripe_delete(&trans, idx));
 815                 if (ret) {
 816                         bch_err(c, "%s: err %s", __func__, bch2_err_str(ret));
 817                         break;
 818                 }
 819         }
 820
 821         bch2_trans_exit(&trans);
 822
 823         bch2_write_ref_put(c, BCH_WRITE_REF_stripe_delete);
 824 }
 825
 826 void bch2_do_stripe_deletes(struct bch_fs *c)
 827 {
 828         if (bch2_write_ref_tryget(c, BCH_WRITE_REF_stripe_delete) &&
 829             !schedule_work(&c->ec_stripe_delete_work))
 830                 bch2_write_ref_put(c, BCH_WRITE_REF_stripe_delete);
 831 }
 832
 833 /* stripe creation: */
 834
 835 static int ec_stripe_key_update(struct btree_trans *trans,
 836                                 struct bkey_i_stripe *new,
 837                                 bool create)
 838 {
 839         struct bch_fs *c = trans->c;
 840         struct btree_iter iter;
 841         struct bkey_s_c k;
 842         int ret;
 843
 844         bch2_trans_iter_init(trans, &iter, BTREE_ID_stripes,
 845                              new->k.p, BTREE_ITER_INTENT);
 846         k = bch2_btree_iter_peek_slot(&iter);
 847         ret = bkey_err(k);
 848         if (ret)
 849                 goto err;
 850
 851         if (k.k->type != (create ? KEY_TYPE_deleted : KEY_TYPE_stripe)) {
 852                 bch2_fs_inconsistent(c, "error %s stripe: got existing key type %s",
 853                                      create ? "creating" : "updating",
 854                                      bch2_bkey_types[k.k->type]);
 855                 ret = -EINVAL;
 856                 goto err;
 857         }
 858
 859         if (k.k->type == KEY_TYPE_stripe) {
 860                 const struct bch_stripe *old = bkey_s_c_to_stripe(k).v;
 861                 unsigned i;
 862
 863                 if (old->nr_blocks != new->v.nr_blocks) {
 864                         bch_err(c, "error updating stripe: nr_blocks does not match");
 865                         ret = -EINVAL;
 866                         goto err;
 867                 }
 868
 869                 for (i = 0; i < new->v.nr_blocks; i++) {
 870                         unsigned v = stripe_blockcount_get(old, i);
 871
 872                         BUG_ON(v &&
 873                                (old->ptrs[i].dev != new->v.ptrs[i].dev ||
 874                                 old->ptrs[i].gen != new->v.ptrs[i].gen ||
 875                                 old->ptrs[i].offset != new->v.ptrs[i].offset));
 876
 877                         stripe_blockcount_set(&new->v, i, v);
 878                 }
 879         }
 880
 881         ret = bch2_trans_update(trans, &iter, &new->k_i, 0);
 882 err:
 883         bch2_trans_iter_exit(trans, &iter);
 884         return ret;
 885 }
 886
 887 static int ec_stripe_update_extent(struct btree_trans *trans,
 888                                    struct bpos bucket, u8 gen,
 889                                    struct ec_stripe_buf *s,
 890                                    u64 *bp_offset)
 891 {
 892         struct bch_fs *c = trans->c;
 893         struct bch_backpointer bp;
 894         struct btree_iter iter;
 895         struct bkey_s_c k;
 896         const struct bch_extent_ptr *ptr_c;
 897         struct bch_extent_ptr *ptr, *ec_ptr = NULL;
 898         struct bch_extent_stripe_ptr stripe_ptr;
 899         struct bkey_i *n;
 900         int ret, dev, block;
 901
 902         ret = bch2_get_next_backpointer(trans, bucket, gen,
 903                                 bp_offset, &bp, BTREE_ITER_CACHED);
 904         if (ret)
 905                 return ret;
 906         if (*bp_offset == U64_MAX)
 907                 return 0;
 908
 909         if (bp.level) {
 910                 struct printbuf buf = PRINTBUF;
 911                 struct btree_iter node_iter;
 912                 struct btree *b;
 913
 914                 b = bch2_backpointer_get_node(trans, &node_iter, bucket, *bp_offset, bp);
 915                 bch2_trans_iter_exit(trans, &node_iter);
 916
 917                 prt_printf(&buf, "found btree node in erasure coded bucket: b=%px\n", b);
 918                 bch2_backpointer_to_text(&buf, &bp);
 919
 920                 bch2_fs_inconsistent(c, "%s", buf.buf);
 921                 printbuf_exit(&buf);
 922                 return -EIO;
 923         }
 924
 925         k = bch2_backpointer_get_key(trans, &iter, bucket, *bp_offset, bp);
 926         ret = bkey_err(k);
 927         if (ret)
 928                 return ret;
 929         if (!k.k) {
 930                 /*
 931                  * extent no longer exists - we could flush the btree
 932                  * write buffer and retry to verify, but no need:
 933                  */
 934                 return 0;
 935         }
 936
 937         if (extent_has_stripe_ptr(k, s->key.k.p.offset))
 938                 goto out;
 939
 940         ptr_c = bkey_matches_stripe(&s->key.v, k, &block);
 941         /*
 942          * It doesn't generally make sense to erasure code cached ptrs:
 943          * XXX: should we be incrementing a counter?
 944          */
 945         if (!ptr_c || ptr_c->cached)
 946                 goto out;
 947
 948         dev = s->key.v.ptrs[block].dev;
 949
 950         n = bch2_trans_kmalloc(trans, bkey_bytes(k.k) + sizeof(stripe_ptr));
 951         ret = PTR_ERR_OR_ZERO(n);
 952         if (ret)
 953                 goto out;
 954
 955         bkey_reassemble(n, k);
 956
 957         bch2_bkey_drop_ptrs(bkey_i_to_s(n), ptr, ptr->dev != dev);
 958         ec_ptr = (void *) bch2_bkey_has_device(bkey_i_to_s_c(n), dev);
 959         BUG_ON(!ec_ptr);
 960
 961         stripe_ptr = (struct bch_extent_stripe_ptr) {
 962                 .type = 1 << BCH_EXTENT_ENTRY_stripe_ptr,
 963                 .block          = block,
 964                 .redundancy     = s->key.v.nr_redundant,
 965                 .idx            = s->key.k.p.offset,
 966         };
 967
 968         __extent_entry_insert(n,
 969                         (union bch_extent_entry *) ec_ptr,
 970                         (union bch_extent_entry *) &stripe_ptr);
 971
 972         ret = bch2_trans_update(trans, &iter, n, 0);
 973 out:
 974         bch2_trans_iter_exit(trans, &iter);
 975         return ret;
 976 }
 977
 978 static int ec_stripe_update_bucket(struct btree_trans *trans, struct ec_stripe_buf *s,
 979                                    unsigned block)
 980 {
 981         struct bch_fs *c = trans->c;
 982         struct bch_extent_ptr bucket = s->key.v.ptrs[block];
 983         struct bpos bucket_pos = PTR_BUCKET_POS(c, &bucket);
 984         u64 bp_offset = 0;
 985         int ret = 0;
 986
 987         while (1) {
 988                 ret = commit_do(trans, NULL, NULL,
 989                                 BTREE_INSERT_NOFAIL,
 990                         ec_stripe_update_extent(trans, bucket_pos, bucket.gen,
 991                                                 s, &bp_offset));
 992                 if (ret)
 993                         break;
 994                 if (bp_offset == U64_MAX)
 995                         break;
 996
 997                 bp_offset++;
 998         }
 999
1000         return ret;
1001 }
1002
1003 static int ec_stripe_update_extents(struct bch_fs *c, struct ec_stripe_buf *s)
1004 {
1005         struct btree_trans trans;
1006         struct bch_stripe *v = &s->key.v;
1007         unsigned i, nr_data = v->nr_blocks - v->nr_redundant;
1008         int ret = 0;
1009
1010         bch2_trans_init(&trans, c, 0, 0);
1011
1012         ret = bch2_btree_write_buffer_flush(&trans);
1013         if (ret)
1014                 goto err;
1015
1016         for (i = 0; i < nr_data; i++) {
1017                 ret = ec_stripe_update_bucket(&trans, s, i);
1018                 if (ret)
1019                         break;
1020         }
1021 err:
1022         bch2_trans_exit(&trans);
1023
1024         return ret;
1025 }
1026
1027 static void zero_out_rest_of_ec_bucket(struct bch_fs *c,
1028                                        struct ec_stripe_new *s,
1029                                        unsigned block,
1030                                        struct open_bucket *ob)
1031 {
1032         struct bch_dev *ca = bch_dev_bkey_exists(c, ob->dev);
1033         unsigned offset = ca->mi.bucket_size - ob->sectors_free;
1034         int ret;
1035
1036         if (!bch2_dev_get_ioref(ca, WRITE)) {
1037                 s->err = -EROFS;
1038                 return;
1039         }
1040
1041         memset(s->new_stripe.data[block] + (offset << 9),
1042                0,
1043                ob->sectors_free << 9);
1044
1045         ret = blkdev_issue_zeroout(ca->disk_sb.bdev,
1046                         ob->bucket * ca->mi.bucket_size + offset,
1047                         ob->sectors_free,
1048                         GFP_KERNEL, 0);
1049
1050         percpu_ref_put(&ca->io_ref);
1051
1052         if (ret)
1053                 s->err = ret;
1054 }
1055
1056 /*
1057  * data buckets of new stripe all written: create the stripe
1058  */
1059 static void ec_stripe_create(struct ec_stripe_new *s)
1060 {
1061         struct bch_fs *c = s->c;
1062         struct open_bucket *ob;
1063         struct bch_stripe *v = &s->new_stripe.key.v;
1064         unsigned i, nr_data = v->nr_blocks - v->nr_redundant;
1065         int ret;
1066
1067         BUG_ON(s->h->s == s);
1068
1069         closure_sync(&s->iodone);
1070
1071         for (i = 0; i < nr_data; i++)
1072                 if (s->blocks[i]) {
1073                         ob = c->open_buckets + s->blocks[i];
1074
1075                         if (ob->sectors_free)
1076                                 zero_out_rest_of_ec_bucket(c, s, i, ob);
1077                 }
1078
1079         if (s->err) {
1080                 if (!bch2_err_matches(s->err, EROFS))
1081                         bch_err(c, "error creating stripe: error writing data buckets");
1082                 goto err;
1083         }
1084
1085         if (s->have_existing_stripe) {
1086                 ec_validate_checksums(c, &s->existing_stripe);
1087
1088                 if (ec_do_recov(c, &s->existing_stripe)) {
1089                         bch_err(c, "error creating stripe: error reading existing stripe");
1090                         goto err;
1091                 }
1092
1093                 for (i = 0; i < nr_data; i++)
1094                         if (stripe_blockcount_get(&s->existing_stripe.key.v, i))
1095                                 swap(s->new_stripe.data[i],
1096                                      s->existing_stripe.data[i]);
1097
1098                 ec_stripe_buf_exit(&s->existing_stripe);
1099         }
1100
1101         BUG_ON(!s->allocated);
1102
1103         ec_generate_ec(&s->new_stripe);
1104
1105         ec_generate_checksums(&s->new_stripe);
1106
1107         /* write p/q: */
1108         for (i = nr_data; i < v->nr_blocks; i++)
1109                 ec_block_io(c, &s->new_stripe, REQ_OP_WRITE, i, &s->iodone);
1110         closure_sync(&s->iodone);
1111
1112         if (ec_nr_failed(&s->new_stripe)) {
1113                 bch_err(c, "error creating stripe: error writing redundancy buckets");
1114                 goto err;
1115         }
1116
1117         ret = bch2_trans_do(c, &s->res, NULL, BTREE_INSERT_NOFAIL,
1118                             ec_stripe_key_update(&trans, &s->new_stripe.key,
1119                                                  !s->have_existing_stripe));
1120         if (ret) {
1121                 bch_err(c, "error creating stripe: error creating stripe key");
1122                 goto err;
1123         }
1124
1125         ret = ec_stripe_update_extents(c, &s->new_stripe);
1126         if (ret) {
1127                 bch_err(c, "error creating stripe: error updating pointers: %s",
1128                         bch2_err_str(ret));
1129                 goto err;
1130         }
1131 err:
1132         bch2_disk_reservation_put(c, &s->res);
1133
1134         for (i = 0; i < v->nr_blocks; i++)
1135                 if (s->blocks[i]) {
1136                         ob = c->open_buckets + s->blocks[i];
1137
1138                         if (i < nr_data) {
1139                                 ob->ec = NULL;
1140                                 __bch2_open_bucket_put(c, ob);
1141                         } else {
1142                                 bch2_open_bucket_put(c, ob);
1143                         }
1144                 }
1145
1146         bch2_stripe_close(c, s);
1147
1148         ec_stripe_buf_exit(&s->existing_stripe);
1149         ec_stripe_buf_exit(&s->new_stripe);
1150         closure_debug_destroy(&s->iodone);
1151         kfree(s);
1152 }
1153
1154 static struct ec_stripe_new *get_pending_stripe(struct bch_fs *c)
1155 {
1156         struct ec_stripe_new *s;
1157
1158         mutex_lock(&c->ec_stripe_new_lock);
1159         list_for_each_entry(s, &c->ec_stripe_new_list, list)
1160                 if (!atomic_read(&s->pin)) {
1161                         list_del(&s->list);
1162                         goto out;
1163                 }
1164         s = NULL;
1165 out:
1166         mutex_unlock(&c->ec_stripe_new_lock);
1167
1168         return s;
1169 }
1170
1171 static void ec_stripe_create_work(struct work_struct *work)
1172 {
1173         struct bch_fs *c = container_of(work,
1174                 struct bch_fs, ec_stripe_create_work);
1175         struct ec_stripe_new *s;
1176
1177         while ((s = get_pending_stripe(c)))
1178                 ec_stripe_create(s);
1179
1180         bch2_write_ref_put(c, BCH_WRITE_REF_stripe_create);
1181 }
1182
1183 void bch2_ec_do_stripe_creates(struct bch_fs *c)
1184 {
1185         bch2_write_ref_get(c, BCH_WRITE_REF_stripe_create);
1186
1187         if (!queue_work(system_long_wq, &c->ec_stripe_create_work))
1188                 bch2_write_ref_put(c, BCH_WRITE_REF_stripe_create);
1189 }
1190
1191 static void ec_stripe_new_put(struct bch_fs *c, struct ec_stripe_new *s)
1192 {
1193         BUG_ON(atomic_read(&s->pin) <= 0);
1194
1195         if (atomic_dec_and_test(&s->pin))
1196                 bch2_ec_do_stripe_creates(c);
1197 }
1198
1199 static void ec_stripe_set_pending(struct bch_fs *c, struct ec_stripe_head *h)
1200 {
1201         struct ec_stripe_new *s = h->s;
1202
1203         BUG_ON(!s->allocated && !s->err);
1204
1205         h->s            = NULL;
1206         s->pending      = true;
1207
1208         mutex_lock(&c->ec_stripe_new_lock);
1209         list_add(&s->list, &c->ec_stripe_new_list);
1210         mutex_unlock(&c->ec_stripe_new_lock);
1211
1212         ec_stripe_new_put(c, s);
1213 }
1214
1215 /* have a full bucket - hand it off to be erasure coded: */
1216 void bch2_ec_bucket_written(struct bch_fs *c, struct open_bucket *ob)
1217 {
1218         struct ec_stripe_new *s = ob->ec;
1219
1220         ec_stripe_new_put(c, s);
1221 }
1222
1223 void bch2_ec_bucket_cancel(struct bch_fs *c, struct open_bucket *ob)
1224 {
1225         struct ec_stripe_new *s = ob->ec;
1226
1227         s->err = -EIO;
1228 }
1229
1230 void *bch2_writepoint_ec_buf(struct bch_fs *c, struct write_point *wp)
1231 {
1232         struct open_bucket *ob = ec_open_bucket(c, &wp->ptrs);
1233         struct bch_dev *ca;
1234         unsigned offset;
1235
1236         if (!ob)
1237                 return NULL;
1238
1239         ca      = bch_dev_bkey_exists(c, ob->dev);
1240         offset  = ca->mi.bucket_size - ob->sectors_free;
1241
1242         return ob->ec->new_stripe.data[ob->ec_idx] + (offset << 9);
1243 }
1244
1245 static int unsigned_cmp(const void *_l, const void *_r)
1246 {
1247         unsigned l = *((const unsigned *) _l);
1248         unsigned r = *((const unsigned *) _r);
1249
1250         return cmp_int(l, r);
1251 }
1252
1253 /* pick most common bucket size: */
1254 static unsigned pick_blocksize(struct bch_fs *c,
1255                                struct bch_devs_mask *devs)
1256 {
1257         struct bch_dev *ca;
1258         unsigned i, nr = 0, sizes[BCH_SB_MEMBERS_MAX];
1259         struct {
1260                 unsigned nr, size;
1261         } cur = { 0, 0 }, best = { 0, 0 };
1262
1263         for_each_member_device_rcu(ca, c, i, devs)
1264                 sizes[nr++] = ca->mi.bucket_size;
1265
1266         sort(sizes, nr, sizeof(unsigned), unsigned_cmp, NULL);
1267
1268         for (i = 0; i < nr; i++) {
1269                 if (sizes[i] != cur.size) {
1270                         if (cur.nr > best.nr)
1271                                 best = cur;
1272
1273                         cur.nr = 0;
1274                         cur.size = sizes[i];
1275                 }
1276
1277                 cur.nr++;
1278         }
1279
1280         if (cur.nr > best.nr)
1281                 best = cur;
1282
1283         return best.size;
1284 }
1285
1286 static bool may_create_new_stripe(struct bch_fs *c)
1287 {
1288         return false;
1289 }
1290
1291 static void ec_stripe_key_init(struct bch_fs *c,
1292                                struct bkey_i_stripe *s,
1293                                unsigned nr_data,
1294                                unsigned nr_parity,
1295                                unsigned stripe_size)
1296 {
1297         unsigned u64s;
1298
1299         bkey_stripe_init(&s->k_i);
1300         s->v.sectors                    = cpu_to_le16(stripe_size);
1301         s->v.algorithm                  = 0;
1302         s->v.nr_blocks                  = nr_data + nr_parity;
1303         s->v.nr_redundant               = nr_parity;
1304         s->v.csum_granularity_bits      = ilog2(c->opts.encoded_extent_max >> 9);
1305         s->v.csum_type                  = BCH_CSUM_crc32c;
1306         s->v.pad                        = 0;
1307
1308         while ((u64s = stripe_val_u64s(&s->v)) > BKEY_VAL_U64s_MAX) {
1309                 BUG_ON(1 << s->v.csum_granularity_bits >=
1310                        le16_to_cpu(s->v.sectors) ||
1311                        s->v.csum_granularity_bits == U8_MAX);
1312                 s->v.csum_granularity_bits++;
1313         }
1314
1315         set_bkey_val_u64s(&s->k, u64s);
1316 }
1317
1318 static int ec_new_stripe_alloc(struct bch_fs *c, struct ec_stripe_head *h)
1319 {
1320         struct ec_stripe_new *s;
1321
1322         lockdep_assert_held(&h->lock);
1323
1324         s = kzalloc(sizeof(*s), GFP_KERNEL);
1325         if (!s)
1326                 return -ENOMEM;
1327
1328         mutex_init(&s->lock);
1329         closure_init(&s->iodone, NULL);
1330         atomic_set(&s->pin, 1);
1331         s->c            = c;
1332         s->h            = h;
1333         s->nr_data      = min_t(unsigned, h->nr_active_devs,
1334                                 BCH_BKEY_PTRS_MAX) - h->redundancy;
1335         s->nr_parity    = h->redundancy;
1336
1337         ec_stripe_key_init(c, &s->new_stripe.key, s->nr_data,
1338                            s->nr_parity, h->blocksize);
1339
1340         h->s = s;
1341         return 0;
1342 }
1343
1344 static struct ec_stripe_head *
1345 ec_new_stripe_head_alloc(struct bch_fs *c, unsigned target,
1346                          unsigned algo, unsigned redundancy,
1347                          enum alloc_reserve reserve)
1348 {
1349         struct ec_stripe_head *h;
1350         struct bch_dev *ca;
1351         unsigned i;
1352
1353         h = kzalloc(sizeof(*h), GFP_KERNEL);
1354         if (!h)
1355                 return NULL;
1356
1357         mutex_init(&h->lock);
1358         BUG_ON(!mutex_trylock(&h->lock));
1359
1360         h->target       = target;
1361         h->algo         = algo;
1362         h->redundancy   = redundancy;
1363         h->reserve      = reserve;
1364
1365         rcu_read_lock();
1366         h->devs = target_rw_devs(c, BCH_DATA_user, target);
1367
1368         for_each_member_device_rcu(ca, c, i, &h->devs)
1369                 if (!ca->mi.durability)
1370                         __clear_bit(i, h->devs.d);
1371
1372         h->blocksize = pick_blocksize(c, &h->devs);
1373
1374         for_each_member_device_rcu(ca, c, i, &h->devs)
1375                 if (ca->mi.bucket_size == h->blocksize)
1376                         h->nr_active_devs++;
1377
1378         rcu_read_unlock();
1379         list_add(&h->list, &c->ec_stripe_head_list);
1380         return h;
1381 }
1382
1383 void bch2_ec_stripe_head_put(struct bch_fs *c, struct ec_stripe_head *h)
1384 {
1385         if (h->s &&
1386             h->s->allocated &&
1387             bitmap_weight(h->s->blocks_allocated,
1388                           h->s->nr_data) == h->s->nr_data)
1389                 ec_stripe_set_pending(c, h);
1390
1391         mutex_unlock(&h->lock);
1392 }
1393
1394 struct ec_stripe_head *__bch2_ec_stripe_head_get(struct btree_trans *trans,
1395                                                  unsigned target,
1396                                                  unsigned algo,
1397                                                  unsigned redundancy,
1398                                                  enum alloc_reserve reserve)
1399 {
1400         struct bch_fs *c = trans->c;
1401         struct ec_stripe_head *h;
1402         int ret;
1403
1404         if (!redundancy)
1405                 return NULL;
1406
1407         ret = bch2_trans_mutex_lock(trans, &c->ec_stripe_head_lock);
1408         if (ret)
1409                 return ERR_PTR(ret);
1410
1411         list_for_each_entry(h, &c->ec_stripe_head_list, list)
1412                 if (h->target           == target &&
1413                     h->algo             == algo &&
1414                     h->redundancy       == redundancy &&
1415                     h->reserve          == reserve) {
1416                         ret = bch2_trans_mutex_lock(trans, &h->lock);
1417                         if (ret)
1418                                 h = ERR_PTR(ret);
1419                         goto found;
1420                 }
1421
1422         h = ec_new_stripe_head_alloc(c, target, algo, redundancy, reserve);
1423 found:
1424         mutex_unlock(&c->ec_stripe_head_lock);
1425         return h;
1426 }
1427
1428 static int new_stripe_alloc_buckets(struct btree_trans *trans, struct ec_stripe_head *h,
1429                                     enum alloc_reserve reserve, struct closure *cl)
1430 {
1431         struct bch_fs *c = trans->c;
1432         struct bch_devs_mask devs = h->devs;
1433         struct open_bucket *ob;
1434         struct open_buckets buckets;
1435         unsigned i, j, nr_have_parity = 0, nr_have_data = 0;
1436         bool have_cache = true;
1437         int ret = 0;
1438
1439         for_each_set_bit(i, h->s->blocks_gotten, h->s->new_stripe.key.v.nr_blocks) {
1440                 __clear_bit(h->s->new_stripe.key.v.ptrs[i].dev, devs.d);
1441                 if (i < h->s->nr_data)
1442                         nr_have_data++;
1443                 else
1444                         nr_have_parity++;
1445         }
1446
1447         BUG_ON(nr_have_data     > h->s->nr_data);
1448         BUG_ON(nr_have_parity   > h->s->nr_parity);
1449
1450         buckets.nr = 0;
1451         if (nr_have_parity < h->s->nr_parity) {
1452                 ret = bch2_bucket_alloc_set_trans(trans, &buckets,
1453                                             &h->parity_stripe,
1454                                             &devs,
1455                                             h->s->nr_parity,
1456                                             &nr_have_parity,
1457                                             &have_cache,
1458                                             BCH_DATA_parity,
1459                                             reserve,
1460                                             cl);
1461
1462                 open_bucket_for_each(c, &buckets, ob, i) {
1463                         j = find_next_zero_bit(h->s->blocks_gotten,
1464                                                h->s->nr_data + h->s->nr_parity,
1465                                                h->s->nr_data);
1466                         BUG_ON(j >= h->s->nr_data + h->s->nr_parity);
1467
1468                         h->s->blocks[j] = buckets.v[i];
1469                         h->s->new_stripe.key.v.ptrs[j] = bch2_ob_ptr(c, ob);
1470                         __set_bit(j, h->s->blocks_gotten);
1471                 }
1472
1473                 if (ret)
1474                         return ret;
1475         }
1476
1477         buckets.nr = 0;
1478         if (nr_have_data < h->s->nr_data) {
1479                 ret = bch2_bucket_alloc_set_trans(trans, &buckets,
1480                                             &h->block_stripe,
1481                                             &devs,
1482                                             h->s->nr_data,
1483                                             &nr_have_data,
1484                                             &have_cache,
1485                                             BCH_DATA_user,
1486                                             reserve,
1487                                             cl);
1488
1489                 open_bucket_for_each(c, &buckets, ob, i) {
1490                         j = find_next_zero_bit(h->s->blocks_gotten,
1491                                                h->s->nr_data, 0);
1492                         BUG_ON(j >= h->s->nr_data);
1493
1494                         h->s->blocks[j] = buckets.v[i];
1495                         h->s->new_stripe.key.v.ptrs[j] = bch2_ob_ptr(c, ob);
1496                         __set_bit(j, h->s->blocks_gotten);
1497                 }
1498
1499                 if (ret)
1500                         return ret;
1501         }
1502
1503         return 0;
1504 }
1505
1506 /* XXX: doesn't obey target: */
1507 static s64 get_existing_stripe(struct bch_fs *c,
1508                                struct ec_stripe_head *head)
1509 {
1510         ec_stripes_heap *h = &c->ec_stripes_heap;
1511         struct stripe *m;
1512         size_t heap_idx;
1513         u64 stripe_idx;
1514         s64 ret = -1;
1515
1516         if (may_create_new_stripe(c))
1517                 return -1;
1518
1519         mutex_lock(&c->ec_stripes_heap_lock);
1520         for (heap_idx = 0; heap_idx < h->used; heap_idx++) {
1521                 /* No blocks worth reusing, stripe will just be deleted: */
1522                 if (!h->data[heap_idx].blocks_nonempty)
1523                         continue;
1524
1525                 stripe_idx = h->data[heap_idx].idx;
1526
1527                 m = genradix_ptr(&c->stripes, stripe_idx);
1528
1529                 if (m->algorithm        == head->algo &&
1530                     m->nr_redundant     == head->redundancy &&
1531                     m->sectors          == head->blocksize &&
1532                     m->blocks_nonempty  < m->nr_blocks - m->nr_redundant &&
1533                     bch2_try_open_stripe(c, head->s, stripe_idx)) {
1534                         ret = stripe_idx;
1535                         break;
1536                 }
1537         }
1538         mutex_unlock(&c->ec_stripes_heap_lock);
1539         return ret;
1540 }
1541
1542 static int __bch2_ec_stripe_head_reuse(struct btree_trans *trans, struct ec_stripe_head *h)
1543 {
1544         struct bch_fs *c = trans->c;
1545         unsigned i;
1546         s64 idx;
1547         int ret;
1548
1549         idx = get_existing_stripe(c, h);
1550         if (idx < 0)
1551                 return -BCH_ERR_ENOSPC_stripe_reuse;
1552
1553         ret = get_stripe_key_trans(trans, idx, &h->s->existing_stripe);
1554         if (ret) {
1555                 bch2_stripe_close(c, h->s);
1556                 if (!bch2_err_matches(ret, BCH_ERR_transaction_restart))
1557                         bch2_fs_fatal_error(c, "error reading stripe key: %s", bch2_err_str(ret));
1558                 return ret;
1559         }
1560
1561         if (ec_stripe_buf_init(&h->s->existing_stripe, 0, h->blocksize)) {
1562                 /*
1563                  * this is a problem: we have deleted from the
1564                  * stripes heap already
1565                  */
1566                 BUG();
1567         }
1568
1569         BUG_ON(h->s->existing_stripe.size != h->blocksize);
1570         BUG_ON(h->s->existing_stripe.size != h->s->existing_stripe.key.v.sectors);
1571
1572         /*
1573          * Free buckets we initially allocated - they might conflict with
1574          * blocks from the stripe we're reusing:
1575          */
1576         for_each_set_bit(i, h->s->blocks_gotten, h->s->new_stripe.key.v.nr_blocks) {
1577                 bch2_open_bucket_put(c, c->open_buckets + h->s->blocks[i]);
1578                 h->s->blocks[i] = 0;
1579         }
1580         memset(h->s->blocks_gotten, 0, sizeof(h->s->blocks_gotten));
1581         memset(h->s->blocks_allocated, 0, sizeof(h->s->blocks_allocated));
1582
1583         for (i = 0; i < h->s->existing_stripe.key.v.nr_blocks; i++) {
1584                 if (stripe_blockcount_get(&h->s->existing_stripe.key.v, i)) {
1585                         __set_bit(i, h->s->blocks_gotten);
1586                         __set_bit(i, h->s->blocks_allocated);
1587                 }
1588
1589                 ec_block_io(c, &h->s->existing_stripe, READ, i, &h->s->iodone);
1590         }
1591
1592         bkey_copy(&h->s->new_stripe.key.k_i, &h->s->existing_stripe.key.k_i);
1593         h->s->have_existing_stripe = true;
1594
1595         return 0;
1596 }
1597
1598 static int __bch2_ec_stripe_head_reserve(struct btree_trans *trans, struct ec_stripe_head *h)
1599 {
1600         struct bch_fs *c = trans->c;
1601         struct btree_iter iter;
1602         struct bkey_s_c k;
1603         struct bpos min_pos = POS(0, 1);
1604         struct bpos start_pos = bpos_max(min_pos, POS(0, c->ec_stripe_hint));
1605         int ret;
1606
1607         if (!h->s->res.sectors) {
1608                 ret = bch2_disk_reservation_get(c, &h->s->res,
1609                                         h->blocksize,
1610                                         h->s->nr_parity,
1611                                         BCH_DISK_RESERVATION_NOFAIL);
1612                 if (ret)
1613                         return ret;
1614         }
1615
1616         for_each_btree_key_norestart(trans, iter, BTREE_ID_stripes, start_pos,
1617                            BTREE_ITER_SLOTS|BTREE_ITER_INTENT, k, ret) {
1618                 if (bkey_gt(k.k->p, POS(0, U32_MAX))) {
1619                         if (start_pos.offset) {
1620                                 start_pos = min_pos;
1621                                 bch2_btree_iter_set_pos(&iter, start_pos);
1622                                 continue;
1623                         }
1624
1625                         ret = -BCH_ERR_ENOSPC_stripe_create;
1626                         break;
1627                 }
1628
1629                 if (bkey_deleted(k.k) &&
1630                     bch2_try_open_stripe(c, h->s, k.k->p.offset))
1631                         break;
1632         }
1633
1634         c->ec_stripe_hint = iter.pos.offset;
1635
1636         if (ret)
1637                 goto err;
1638
1639         ret = ec_stripe_mem_alloc(trans, &iter);
1640         if (ret) {
1641                 bch2_stripe_close(c, h->s);
1642                 goto err;
1643         }
1644
1645         h->s->new_stripe.key.k.p = iter.pos;
1646 out:
1647         bch2_trans_iter_exit(trans, &iter);
1648         return ret;
1649 err:
1650         bch2_disk_reservation_put(c, &h->s->res);
1651         goto out;
1652 }
1653
1654 struct ec_stripe_head *bch2_ec_stripe_head_get(struct btree_trans *trans,
1655                                                unsigned target,
1656                                                unsigned algo,
1657                                                unsigned redundancy,
1658                                                enum alloc_reserve reserve,
1659                                                struct closure *cl)
1660 {
1661         struct bch_fs *c = trans->c;
1662         struct ec_stripe_head *h;
1663         bool waiting = false;
1664         int ret;
1665
1666         h = __bch2_ec_stripe_head_get(trans, target, algo, redundancy, reserve);
1667         if (!h)
1668                 bch_err(c, "no stripe head");
1669         if (IS_ERR_OR_NULL(h))
1670                 return h;
1671
1672         if (!h->s) {
1673                 if (ec_new_stripe_alloc(c, h)) {
1674                         ret = -ENOMEM;
1675                         bch_err(c, "failed to allocate new stripe");
1676                         goto err;
1677                 }
1678
1679                 if (ec_stripe_buf_init(&h->s->new_stripe, 0, h->blocksize))
1680                         BUG();
1681         }
1682
1683         if (h->s->allocated)
1684                 goto allocated;
1685
1686         if (h->s->have_existing_stripe)
1687                 goto alloc_existing;
1688
1689         /* First, try to allocate a full stripe: */
1690         ret =   new_stripe_alloc_buckets(trans, h, RESERVE_stripe, NULL) ?:
1691                 __bch2_ec_stripe_head_reserve(trans, h);
1692         if (!ret)
1693                 goto allocated;
1694         if (bch2_err_matches(ret, BCH_ERR_transaction_restart) ||
1695             bch2_err_matches(ret, ENOMEM))
1696                 goto err;
1697
1698         /*
1699          * Not enough buckets available for a full stripe: we must reuse an
1700          * existing stripe:
1701          */
1702         while (1) {
1703                 ret = __bch2_ec_stripe_head_reuse(trans, h);
1704                 if (!ret)
1705                         break;
1706                 if (ret == -BCH_ERR_ENOSPC_stripe_reuse && cl)
1707                         ret = -BCH_ERR_stripe_alloc_blocked;
1708                 if (waiting || !cl || ret != -BCH_ERR_stripe_alloc_blocked)
1709                         goto err;
1710
1711                 /* XXX freelist_wait? */
1712                 closure_wait(&c->freelist_wait, cl);
1713                 waiting = true;
1714         }
1715
1716         if (waiting)
1717                 closure_wake_up(&c->freelist_wait);
1718 alloc_existing:
1719         /*
1720          * Retry allocating buckets, with the reserve watermark for this
1721          * particular write:
1722          */
1723         ret = new_stripe_alloc_buckets(trans, h, reserve, cl);
1724         if (ret)
1725                 goto err;
1726 allocated:
1727         h->s->allocated = true;
1728         BUG_ON(!h->s->idx);
1729
1730         BUG_ON(trans->restarted);
1731         return h;
1732 err:
1733         bch2_ec_stripe_head_put(c, h);
1734         return ERR_PTR(ret);
1735 }
1736
1737 void bch2_ec_stop_dev(struct bch_fs *c, struct bch_dev *ca)
1738 {
1739         struct ec_stripe_head *h;
1740         struct open_bucket *ob;
1741         unsigned i;
1742
1743         mutex_lock(&c->ec_stripe_head_lock);
1744         list_for_each_entry(h, &c->ec_stripe_head_list, list) {
1745
1746                 mutex_lock(&h->lock);
1747                 if (!h->s)
1748                         goto unlock;
1749
1750                 for (i = 0; i < h->s->new_stripe.key.v.nr_blocks; i++) {
1751                         if (!h->s->blocks[i])
1752                                 continue;
1753
1754                         ob = c->open_buckets + h->s->blocks[i];
1755                         if (ob->dev == ca->dev_idx)
1756                                 goto found;
1757                 }
1758                 goto unlock;
1759 found:
1760                 h->s->err = -EROFS;
1761                 ec_stripe_set_pending(c, h);
1762 unlock:
1763                 mutex_unlock(&h->lock);
1764         }
1765         mutex_unlock(&c->ec_stripe_head_lock);
1766 }
1767
1768 int bch2_stripes_read(struct bch_fs *c)
1769 {
1770         struct btree_trans trans;
1771         struct btree_iter iter;
1772         struct bkey_s_c k;
1773         const struct bch_stripe *s;
1774         struct stripe *m;
1775         unsigned i;
1776         int ret;
1777
1778         bch2_trans_init(&trans, c, 0, 0);
1779
1780         for_each_btree_key(&trans, iter, BTREE_ID_stripes, POS_MIN,
1781                            BTREE_ITER_PREFETCH, k, ret) {
1782                 if (k.k->type != KEY_TYPE_stripe)
1783                         continue;
1784
1785                 ret = __ec_stripe_mem_alloc(c, k.k->p.offset, GFP_KERNEL);
1786                 if (ret)
1787                         break;
1788
1789                 s = bkey_s_c_to_stripe(k).v;
1790
1791                 m = genradix_ptr(&c->stripes, k.k->p.offset);
1792                 m->sectors      = le16_to_cpu(s->sectors);
1793                 m->algorithm    = s->algorithm;
1794                 m->nr_blocks    = s->nr_blocks;
1795                 m->nr_redundant = s->nr_redundant;
1796                 m->blocks_nonempty = 0;
1797
1798                 for (i = 0; i < s->nr_blocks; i++)
1799                         m->blocks_nonempty += !!stripe_blockcount_get(s, i);
1800
1801                 bch2_stripes_heap_insert(c, m, k.k->p.offset);
1802         }
1803         bch2_trans_iter_exit(&trans, &iter);
1804
1805         bch2_trans_exit(&trans);
1806
1807         if (ret)
1808                 bch_err(c, "error reading stripes: %i", ret);
1809
1810         return ret;
1811 }
1812
1813 void bch2_stripes_heap_to_text(struct printbuf *out, struct bch_fs *c)
1814 {
1815         ec_stripes_heap *h = &c->ec_stripes_heap;
1816         struct stripe *m;
1817         size_t i;
1818
1819         mutex_lock(&c->ec_stripes_heap_lock);
1820         for (i = 0; i < min_t(size_t, h->used, 20); i++) {
1821                 m = genradix_ptr(&c->stripes, h->data[i].idx);
1822
1823                 prt_printf(out, "%zu %u/%u+%u\n", h->data[i].idx,
1824                        h->data[i].blocks_nonempty,
1825                        m->nr_blocks - m->nr_redundant,
1826                        m->nr_redundant);
1827         }
1828         mutex_unlock(&c->ec_stripes_heap_lock);
1829 }
1830
1831 void bch2_new_stripes_to_text(struct printbuf *out, struct bch_fs *c)
1832 {
1833         struct ec_stripe_head *h;
1834         struct ec_stripe_new *s;
1835
1836         mutex_lock(&c->ec_stripe_head_lock);
1837         list_for_each_entry(h, &c->ec_stripe_head_list, list) {
1838                 prt_printf(out, "target %u algo %u redundancy %u:\n",
1839                        h->target, h->algo, h->redundancy);
1840
1841                 if (h->s)
1842                         prt_printf(out, "\tpending: blocks %u+%u allocated %u\n",
1843                                h->s->nr_data, h->s->nr_parity,
1844                                bitmap_weight(h->s->blocks_allocated,
1845                                              h->s->nr_data));
1846         }
1847         mutex_unlock(&c->ec_stripe_head_lock);
1848
1849         mutex_lock(&c->ec_stripe_new_lock);
1850         list_for_each_entry(s, &c->ec_stripe_new_list, list) {
1851                 prt_printf(out, "\tin flight: blocks %u+%u pin %u\n",
1852                        s->nr_data, s->nr_parity,
1853                        atomic_read(&s->pin));
1854         }
1855         mutex_unlock(&c->ec_stripe_new_lock);
1856 }
1857
1858 void bch2_fs_ec_exit(struct bch_fs *c)
1859 {
1860         struct ec_stripe_head *h;
1861         unsigned i;
1862
1863         while (1) {
1864                 mutex_lock(&c->ec_stripe_head_lock);
1865                 h = list_first_entry_or_null(&c->ec_stripe_head_list,
1866                                              struct ec_stripe_head, list);
1867                 if (h)
1868                         list_del(&h->list);
1869                 mutex_unlock(&c->ec_stripe_head_lock);
1870                 if (!h)
1871                         break;
1872
1873                 if (h->s) {
1874                         for (i = 0; i < h->s->new_stripe.key.v.nr_blocks; i++)
1875                                 BUG_ON(h->s->blocks[i]);
1876
1877                         kfree(h->s);
1878                 }
1879                 kfree(h);
1880         }
1881
1882         BUG_ON(!list_empty(&c->ec_stripe_new_list));
1883
1884         free_heap(&c->ec_stripes_heap);
1885         genradix_free(&c->stripes);
1886         bioset_exit(&c->ec_bioset);
1887 }
1888
1889 void bch2_fs_ec_init_early(struct bch_fs *c)
1890 {
1891         INIT_WORK(&c->ec_stripe_create_work, ec_stripe_create_work);
1892         INIT_WORK(&c->ec_stripe_delete_work, ec_stripe_delete_work);
1893 }
1894
1895 int bch2_fs_ec_init(struct bch_fs *c)
1896 {
1897         spin_lock_init(&c->ec_stripes_new_lock);
1898
1899         return bioset_init(&c->ec_bioset, 1, offsetof(struct ec_bio, bio),
1900                            BIOSET_NEED_BVECS);
1901 }