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

   1 // SPDX-License-Identifier: GPL-2.0
   2 /*
   3  * Copyright (C) 2010 Kent Overstreet <kent.overstreet@gmail.com>
   4  * Copyright (C) 2014 Datera Inc.
   5  */
   6
   7 #include "bcachefs.h"
   8 #include "alloc_background.h"
   9 #include "alloc_foreground.h"
  10 #include "bkey_methods.h"
  11 #include "bkey_buf.h"
  12 #include "btree_locking.h"
  13 #include "btree_update_interior.h"
  14 #include "btree_io.h"
  15 #include "btree_gc.h"
  16 #include "buckets.h"
  17 #include "clock.h"
  18 #include "debug.h"
  19 #include "ec.h"
  20 #include "error.h"
  21 #include "extents.h"
  22 #include "journal.h"
  23 #include "keylist.h"
  24 #include "move.h"
  25 #include "recovery.h"
  26 #include "reflink.h"
  27 #include "replicas.h"
  28 #include "super-io.h"
  29
  30 #include <linux/slab.h>
  31 #include <linux/bitops.h>
  32 #include <linux/freezer.h>
  33 #include <linux/kthread.h>
  34 #include <linux/preempt.h>
  35 #include <linux/rcupdate.h>
  36 #include <linux/sched/task.h>
  37 #include <trace/events/bcachefs.h>
  38
  39 #define DROP_THIS_NODE          10
  40 #define DROP_PREV_NODE          11
  41
  42 static inline void __gc_pos_set(struct bch_fs *c, struct gc_pos new_pos)
  43 {
  44         preempt_disable();
  45         write_seqcount_begin(&c->gc_pos_lock);
  46         c->gc_pos = new_pos;
  47         write_seqcount_end(&c->gc_pos_lock);
  48         preempt_enable();
  49 }
  50
  51 static inline void gc_pos_set(struct bch_fs *c, struct gc_pos new_pos)
  52 {
  53         BUG_ON(gc_pos_cmp(new_pos, c->gc_pos) <= 0);
  54         __gc_pos_set(c, new_pos);
  55 }
  56
  57 /*
  58  * Missing: if an interior btree node is empty, we need to do something -
  59  * perhaps just kill it
  60  */
  61 static int bch2_gc_check_topology(struct bch_fs *c,
  62                                   struct btree *b,
  63                                   struct bkey_buf *prev,
  64                                   struct bkey_buf cur,
  65                                   bool is_last)
  66 {
  67         struct bpos node_start  = b->data->min_key;
  68         struct bpos node_end    = b->data->max_key;
  69         struct bpos expected_start = bkey_deleted(&prev->k->k)
  70                 ? node_start
  71                 : bpos_successor(prev->k->k.p);
  72         char buf1[200], buf2[200];
  73         int ret = 0;
  74
  75         if (cur.k->k.type == KEY_TYPE_btree_ptr_v2) {
  76                 struct bkey_i_btree_ptr_v2 *bp = bkey_i_to_btree_ptr_v2(cur.k);
  77
  78                 if (bkey_deleted(&prev->k->k)) {
  79                         struct printbuf out = PBUF(buf1);
  80                         pr_buf(&out, "start of node: ");
  81                         bch2_bpos_to_text(&out, node_start);
  82                 } else {
  83                         bch2_bkey_val_to_text(&PBUF(buf1), c, bkey_i_to_s_c(prev->k));
  84                 }
  85
  86                 if (bpos_cmp(expected_start, bp->v.min_key)) {
  87                         bch2_topology_error(c);
  88
  89                         if (__fsck_err(c,
  90                                   FSCK_CAN_FIX|
  91                                   FSCK_CAN_IGNORE|
  92                                   FSCK_NO_RATELIMIT,
  93                                   "btree node with incorrect min_key at btree %s level %u:\n"
  94                                   "  prev %s\n"
  95                                   "  cur %s",
  96                                   bch2_btree_ids[b->c.btree_id], b->c.level,
  97                                   buf1,
  98                                   (bch2_bkey_val_to_text(&PBUF(buf2), c, bkey_i_to_s_c(cur.k)), buf2)) &&
  99                             !test_bit(BCH_FS_TOPOLOGY_REPAIR_DONE, &c->flags)) {
 100                                 bch_info(c, "Halting mark and sweep to start topology repair pass");
 101                                 return FSCK_ERR_START_TOPOLOGY_REPAIR;
 102                         } else {
 103                                 set_bit(BCH_FS_INITIAL_GC_UNFIXED, &c->flags);
 104                         }
 105                 }
 106         }
 107
 108         if (is_last && bpos_cmp(cur.k->k.p, node_end)) {
 109                 bch2_topology_error(c);
 110
 111                 if (__fsck_err(c,
 112                           FSCK_CAN_FIX|
 113                           FSCK_CAN_IGNORE|
 114                           FSCK_NO_RATELIMIT,
 115                           "btree node with incorrect max_key at btree %s level %u:\n"
 116                           "  %s\n"
 117                           "  expected %s",
 118                           bch2_btree_ids[b->c.btree_id], b->c.level,
 119                           (bch2_bkey_val_to_text(&PBUF(buf1), c, bkey_i_to_s_c(cur.k)), buf1),
 120                           (bch2_bpos_to_text(&PBUF(buf2), node_end), buf2)) &&
 121                     !test_bit(BCH_FS_TOPOLOGY_REPAIR_DONE, &c->flags)) {
 122                         bch_info(c, "Halting mark and sweep to start topology repair pass");
 123                         return FSCK_ERR_START_TOPOLOGY_REPAIR;
 124                 } else {
 125                         set_bit(BCH_FS_INITIAL_GC_UNFIXED, &c->flags);
 126                 }
 127         }
 128
 129         bch2_bkey_buf_copy(prev, c, cur.k);
 130 fsck_err:
 131         return ret;
 132 }
 133
 134 static void btree_ptr_to_v2(struct btree *b, struct bkey_i_btree_ptr_v2 *dst)
 135 {
 136         switch (b->key.k.type) {
 137         case KEY_TYPE_btree_ptr: {
 138                 struct bkey_i_btree_ptr *src = bkey_i_to_btree_ptr(&b->key);
 139
 140                 dst->k.p                = src->k.p;
 141                 dst->v.mem_ptr          = 0;
 142                 dst->v.seq              = b->data->keys.seq;
 143                 dst->v.sectors_written  = 0;
 144                 dst->v.flags            = 0;
 145                 dst->v.min_key          = b->data->min_key;
 146                 set_bkey_val_bytes(&dst->k, sizeof(dst->v) + bkey_val_bytes(&src->k));
 147                 memcpy(dst->v.start, src->v.start, bkey_val_bytes(&src->k));
 148                 break;
 149         }
 150         case KEY_TYPE_btree_ptr_v2:
 151                 bkey_copy(&dst->k_i, &b->key);
 152                 break;
 153         default:
 154                 BUG();
 155         }
 156 }
 157
 158 static int set_node_min(struct bch_fs *c, struct btree *b, struct bpos new_min)
 159 {
 160         struct bkey_i_btree_ptr_v2 *new;
 161         int ret;
 162
 163         new = kmalloc(BKEY_BTREE_PTR_U64s_MAX * sizeof(u64), GFP_KERNEL);
 164         if (!new)
 165                 return -ENOMEM;
 166
 167         btree_ptr_to_v2(b, new);
 168         b->data->min_key        = new_min;
 169         new->v.min_key          = new_min;
 170         SET_BTREE_PTR_RANGE_UPDATED(&new->v, true);
 171
 172         ret = bch2_journal_key_insert(c, b->c.btree_id, b->c.level + 1, &new->k_i);
 173         if (ret) {
 174                 kfree(new);
 175                 return ret;
 176         }
 177
 178         bch2_btree_node_drop_keys_outside_node(b);
 179
 180         return 0;
 181 }
 182
 183 static int set_node_max(struct bch_fs *c, struct btree *b, struct bpos new_max)
 184 {
 185         struct bkey_i_btree_ptr_v2 *new;
 186         int ret;
 187
 188         ret = bch2_journal_key_delete(c, b->c.btree_id, b->c.level + 1, b->key.k.p);
 189         if (ret)
 190                 return ret;
 191
 192         new = kmalloc(BKEY_BTREE_PTR_U64s_MAX * sizeof(u64), GFP_KERNEL);
 193         if (!new)
 194                 return -ENOMEM;
 195
 196         btree_ptr_to_v2(b, new);
 197         b->data->max_key        = new_max;
 198         new->k.p                = new_max;
 199         SET_BTREE_PTR_RANGE_UPDATED(&new->v, true);
 200
 201         ret = bch2_journal_key_insert(c, b->c.btree_id, b->c.level + 1, &new->k_i);
 202         if (ret) {
 203                 kfree(new);
 204                 return ret;
 205         }
 206
 207         bch2_btree_node_drop_keys_outside_node(b);
 208
 209         mutex_lock(&c->btree_cache.lock);
 210         bch2_btree_node_hash_remove(&c->btree_cache, b);
 211
 212         bkey_copy(&b->key, &new->k_i);
 213         ret = __bch2_btree_node_hash_insert(&c->btree_cache, b);
 214         BUG_ON(ret);
 215         mutex_unlock(&c->btree_cache.lock);
 216         return 0;
 217 }
 218
 219 static int btree_repair_node_boundaries(struct bch_fs *c, struct btree *b,
 220                                         struct btree *prev, struct btree *cur)
 221 {
 222         struct bpos expected_start = !prev
 223                 ? b->data->min_key
 224                 : bpos_successor(prev->key.k.p);
 225         char buf1[200], buf2[200];
 226         int ret = 0;
 227
 228         if (!prev) {
 229                 struct printbuf out = PBUF(buf1);
 230                 pr_buf(&out, "start of node: ");
 231                 bch2_bpos_to_text(&out, b->data->min_key);
 232         } else {
 233                 bch2_bkey_val_to_text(&PBUF(buf1), c, bkey_i_to_s_c(&prev->key));
 234         }
 235
 236         bch2_bkey_val_to_text(&PBUF(buf2), c, bkey_i_to_s_c(&cur->key));
 237
 238         if (prev &&
 239             bpos_cmp(expected_start, cur->data->min_key) > 0 &&
 240             BTREE_NODE_SEQ(cur->data) > BTREE_NODE_SEQ(prev->data)) {
 241                 /* cur overwrites prev: */
 242
 243                 if (mustfix_fsck_err_on(bpos_cmp(prev->data->min_key,
 244                                                  cur->data->min_key) >= 0, c,
 245                                 "btree node overwritten by next node at btree %s level %u:\n"
 246                                 "  node %s\n"
 247                                 "  next %s",
 248                                 bch2_btree_ids[b->c.btree_id], b->c.level,
 249                                 buf1, buf2))
 250                         return DROP_PREV_NODE;
 251
 252                 if (mustfix_fsck_err_on(bpos_cmp(prev->key.k.p,
 253                                                  bpos_predecessor(cur->data->min_key)), c,
 254                                 "btree node with incorrect max_key at btree %s level %u:\n"
 255                                 "  node %s\n"
 256                                 "  next %s",
 257                                 bch2_btree_ids[b->c.btree_id], b->c.level,
 258                                 buf1, buf2))
 259                         ret = set_node_max(c, prev,
 260                                            bpos_predecessor(cur->data->min_key));
 261         } else {
 262                 /* prev overwrites cur: */
 263
 264                 if (mustfix_fsck_err_on(bpos_cmp(expected_start,
 265                                                  cur->data->max_key) >= 0, c,
 266                                 "btree node overwritten by prev node at btree %s level %u:\n"
 267                                 "  prev %s\n"
 268                                 "  node %s",
 269                                 bch2_btree_ids[b->c.btree_id], b->c.level,
 270                                 buf1, buf2))
 271                         return DROP_THIS_NODE;
 272
 273                 if (mustfix_fsck_err_on(bpos_cmp(expected_start, cur->data->min_key), c,
 274                                 "btree node with incorrect min_key at btree %s level %u:\n"
 275                                 "  prev %s\n"
 276                                 "  node %s",
 277                                 bch2_btree_ids[b->c.btree_id], b->c.level,
 278                                 buf1, buf2))
 279                     ret = set_node_min(c, cur, expected_start);
 280         }
 281 fsck_err:
 282         return ret;
 283 }
 284
 285 static int btree_repair_node_end(struct bch_fs *c, struct btree *b,
 286                                  struct btree *child)
 287 {
 288         char buf1[200], buf2[200];
 289         int ret = 0;
 290
 291         if (mustfix_fsck_err_on(bpos_cmp(child->key.k.p, b->key.k.p), c,
 292                         "btree node with incorrect max_key at btree %s level %u:\n"
 293                         "  %s\n"
 294                         "  expected %s",
 295                         bch2_btree_ids[b->c.btree_id], b->c.level,
 296                         (bch2_bkey_val_to_text(&PBUF(buf1), c, bkey_i_to_s_c(&child->key)), buf1),
 297                         (bch2_bpos_to_text(&PBUF(buf2), b->key.k.p), buf2))) {
 298                 ret = set_node_max(c, child, b->key.k.p);
 299                 if (ret)
 300                         return ret;
 301         }
 302 fsck_err:
 303         return ret;
 304 }
 305
 306 static int bch2_btree_repair_topology_recurse(struct bch_fs *c, struct btree *b)
 307 {
 308         struct btree_and_journal_iter iter;
 309         struct bkey_s_c k;
 310         struct bkey_buf prev_k, cur_k;
 311         struct btree *prev = NULL, *cur = NULL;
 312         bool have_child, dropped_children = false;
 313         char buf[200];
 314         int ret = 0;
 315
 316         if (!b->c.level)
 317                 return 0;
 318 again:
 319         prev = NULL;
 320         have_child = dropped_children = false;
 321         bch2_bkey_buf_init(&prev_k);
 322         bch2_bkey_buf_init(&cur_k);
 323         bch2_btree_and_journal_iter_init_node_iter(&iter, c, b);
 324
 325         while ((k = bch2_btree_and_journal_iter_peek(&iter)).k) {
 326                 BUG_ON(bpos_cmp(k.k->p, b->data->min_key) < 0);
 327                 BUG_ON(bpos_cmp(k.k->p, b->data->max_key) > 0);
 328
 329                 bch2_btree_and_journal_iter_advance(&iter);
 330                 bch2_bkey_buf_reassemble(&cur_k, c, k);
 331
 332                 cur = bch2_btree_node_get_noiter(c, cur_k.k,
 333                                         b->c.btree_id, b->c.level - 1,
 334                                         false);
 335                 ret = PTR_ERR_OR_ZERO(cur);
 336
 337                 if (mustfix_fsck_err_on(ret == -EIO, c,
 338                                 "Unreadable btree node at btree %s level %u:\n"
 339                                 "  %s",
 340                                 bch2_btree_ids[b->c.btree_id],
 341                                 b->c.level - 1,
 342                                 (bch2_bkey_val_to_text(&PBUF(buf), c, bkey_i_to_s_c(cur_k.k)), buf))) {
 343                         bch2_btree_node_evict(c, cur_k.k);
 344                         ret = bch2_journal_key_delete(c, b->c.btree_id,
 345                                                       b->c.level, cur_k.k->k.p);
 346                         if (ret)
 347                                 break;
 348                         continue;
 349                 }
 350
 351                 if (ret) {
 352                         bch_err(c, "%s: error %i getting btree node",
 353                                 __func__, ret);
 354                         break;
 355                 }
 356
 357                 ret = btree_repair_node_boundaries(c, b, prev, cur);
 358
 359                 if (ret == DROP_THIS_NODE) {
 360                         six_unlock_read(&cur->c.lock);
 361                         bch2_btree_node_evict(c, cur_k.k);
 362                         ret = bch2_journal_key_delete(c, b->c.btree_id,
 363                                                       b->c.level, cur_k.k->k.p);
 364                         if (ret)
 365                                 break;
 366                         continue;
 367                 }
 368
 369                 if (prev)
 370                         six_unlock_read(&prev->c.lock);
 371                 prev = NULL;
 372
 373                 if (ret == DROP_PREV_NODE) {
 374                         bch2_btree_node_evict(c, prev_k.k);
 375                         ret = bch2_journal_key_delete(c, b->c.btree_id,
 376                                                       b->c.level, prev_k.k->k.p);
 377                         if (ret)
 378                                 break;
 379
 380                         bch2_btree_and_journal_iter_exit(&iter);
 381                         bch2_bkey_buf_exit(&prev_k, c);
 382                         bch2_bkey_buf_exit(&cur_k, c);
 383                         goto again;
 384                 } else if (ret)
 385                         break;
 386
 387                 prev = cur;
 388                 cur = NULL;
 389                 bch2_bkey_buf_copy(&prev_k, c, cur_k.k);
 390         }
 391
 392         if (!ret && !IS_ERR_OR_NULL(prev)) {
 393                 BUG_ON(cur);
 394                 ret = btree_repair_node_end(c, b, prev);
 395         }
 396
 397         if (!IS_ERR_OR_NULL(prev))
 398                 six_unlock_read(&prev->c.lock);
 399         prev = NULL;
 400         if (!IS_ERR_OR_NULL(cur))
 401                 six_unlock_read(&cur->c.lock);
 402         cur = NULL;
 403
 404         if (ret)
 405                 goto err;
 406
 407         bch2_btree_and_journal_iter_exit(&iter);
 408         bch2_btree_and_journal_iter_init_node_iter(&iter, c, b);
 409
 410         while ((k = bch2_btree_and_journal_iter_peek(&iter)).k) {
 411                 bch2_bkey_buf_reassemble(&cur_k, c, k);
 412                 bch2_btree_and_journal_iter_advance(&iter);
 413
 414                 cur = bch2_btree_node_get_noiter(c, cur_k.k,
 415                                         b->c.btree_id, b->c.level - 1,
 416                                         false);
 417                 ret = PTR_ERR_OR_ZERO(cur);
 418
 419                 if (ret) {
 420                         bch_err(c, "%s: error %i getting btree node",
 421                                 __func__, ret);
 422                         goto err;
 423                 }
 424
 425                 ret = bch2_btree_repair_topology_recurse(c, cur);
 426                 six_unlock_read(&cur->c.lock);
 427                 cur = NULL;
 428
 429                 if (ret == DROP_THIS_NODE) {
 430                         bch2_btree_node_evict(c, cur_k.k);
 431                         ret = bch2_journal_key_delete(c, b->c.btree_id,
 432                                                       b->c.level, cur_k.k->k.p);
 433                         dropped_children = true;
 434                 }
 435
 436                 if (ret)
 437                         goto err;
 438
 439                 have_child = true;
 440         }
 441
 442         if (mustfix_fsck_err_on(!have_child, c,
 443                         "empty interior btree node at btree %s level %u\n"
 444                         "  %s",
 445                         bch2_btree_ids[b->c.btree_id],
 446                         b->c.level,
 447                         (bch2_bkey_val_to_text(&PBUF(buf), c, bkey_i_to_s_c(&b->key)), buf)))
 448                 ret = DROP_THIS_NODE;
 449 err:
 450 fsck_err:
 451         if (!IS_ERR_OR_NULL(prev))
 452                 six_unlock_read(&prev->c.lock);
 453         if (!IS_ERR_OR_NULL(cur))
 454                 six_unlock_read(&cur->c.lock);
 455
 456         bch2_btree_and_journal_iter_exit(&iter);
 457         bch2_bkey_buf_exit(&prev_k, c);
 458         bch2_bkey_buf_exit(&cur_k, c);
 459
 460         if (!ret && dropped_children)
 461                 goto again;
 462
 463         return ret;
 464 }
 465
 466 static int bch2_repair_topology(struct bch_fs *c)
 467 {
 468         struct btree *b;
 469         unsigned i;
 470         int ret = 0;
 471
 472         for (i = 0; i < BTREE_ID_NR && !ret; i++) {
 473                 b = c->btree_roots[i].b;
 474                 if (btree_node_fake(b))
 475                         continue;
 476
 477                 six_lock_read(&b->c.lock, NULL, NULL);
 478                 ret = bch2_btree_repair_topology_recurse(c, b);
 479                 six_unlock_read(&b->c.lock);
 480
 481                 if (ret == DROP_THIS_NODE) {
 482                         bch_err(c, "empty btree root - repair unimplemented");
 483                         ret = FSCK_ERR_EXIT;
 484                 }
 485         }
 486
 487         return ret;
 488 }
 489
 490 static int bch2_check_fix_ptrs(struct bch_fs *c, enum btree_id btree_id,
 491                                unsigned level, bool is_root,
 492                                struct bkey_s_c *k)
 493 {
 494         struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(*k);
 495         const union bch_extent_entry *entry;
 496         struct extent_ptr_decoded p = { 0 };
 497         bool do_update = false;
 498         char buf[200];
 499         int ret = 0;
 500
 501         bkey_for_each_ptr_decode(k->k, ptrs, p, entry) {
 502                 struct bch_dev *ca = bch_dev_bkey_exists(c, p.ptr.dev);
 503                 struct bucket *g = PTR_BUCKET(ca, &p.ptr, true);
 504                 struct bucket *g2 = PTR_BUCKET(ca, &p.ptr, false);
 505                 enum bch_data_type data_type = bch2_bkey_ptr_data_type(*k, &entry->ptr);
 506
 507                 if (fsck_err_on(!g->gen_valid, c,
 508                                 "bucket %u:%zu data type %s ptr gen %u missing in alloc btree\n"
 509                                 "while marking %s",
 510                                 p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr),
 511                                 bch2_data_types[ptr_data_type(k->k, &p.ptr)],
 512                                 p.ptr.gen,
 513                                 (bch2_bkey_val_to_text(&PBUF(buf), c, *k), buf))) {
 514                         if (!p.ptr.cached) {
 515                                 g2->_mark.gen   = g->_mark.gen          = p.ptr.gen;
 516                                 g2->gen_valid   = g->gen_valid          = true;
 517                                 set_bit(BCH_FS_NEED_ALLOC_WRITE, &c->flags);
 518                         } else {
 519                                 do_update = true;
 520                         }
 521                 }
 522
 523                 if (fsck_err_on(data_type == BCH_DATA_btree &&
 524                                 g->mark.gen != p.ptr.gen, c,
 525                                 "bucket %u:%zu data type %s has metadata but wrong gen: %u != %u\n"
 526                                 "while marking %s",
 527                                 p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr),
 528                                 bch2_data_types[ptr_data_type(k->k, &p.ptr)],
 529                                 p.ptr.gen, g->mark.gen,
 530                                 (bch2_bkey_val_to_text(&PBUF(buf), c, *k), buf))) {
 531                         g2->_mark.data_type     = g->_mark.data_type    = data_type;
 532                         g2->gen_valid           = g->gen_valid          = true;
 533                         set_bit(BCH_FS_NEED_ALLOC_WRITE, &c->flags);
 534                 }
 535
 536                 if (fsck_err_on(gen_cmp(p.ptr.gen, g->mark.gen) > 0, c,
 537                                 "bucket %u:%zu data type %s ptr gen in the future: %u > %u\n"
 538                                 "while marking %s",
 539                                 p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr),
 540                                 bch2_data_types[ptr_data_type(k->k, &p.ptr)],
 541                                 p.ptr.gen, g->mark.gen,
 542                                 (bch2_bkey_val_to_text(&PBUF(buf), c, *k), buf))) {
 543                         if (!p.ptr.cached) {
 544                                 g2->_mark.gen   = g->_mark.gen  = p.ptr.gen;
 545                                 g2->gen_valid   = g->gen_valid  = true;
 546                                 g2->_mark.data_type             = 0;
 547                                 g2->_mark.dirty_sectors         = 0;
 548                                 g2->_mark.cached_sectors        = 0;
 549                                 set_bit(BCH_FS_NEED_ANOTHER_GC, &c->flags);
 550                                 set_bit(BCH_FS_NEED_ALLOC_WRITE, &c->flags);
 551                         } else {
 552                                 do_update = true;
 553                         }
 554                 }
 555
 556                 if (fsck_err_on(!p.ptr.cached &&
 557                                 gen_cmp(p.ptr.gen, g->mark.gen) < 0, c,
 558                                 "bucket %u:%zu data type %s stale dirty ptr: %u < %u\n"
 559                                 "while marking %s",
 560                                 p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr),
 561                                 bch2_data_types[ptr_data_type(k->k, &p.ptr)],
 562                                 p.ptr.gen, g->mark.gen,
 563                                 (bch2_bkey_val_to_text(&PBUF(buf), c, *k), buf)))
 564                         do_update = true;
 565
 566                 if (p.ptr.gen != g->mark.gen)
 567                         continue;
 568
 569                 if (fsck_err_on(g->mark.data_type &&
 570                                 g->mark.data_type != data_type, c,
 571                                 "bucket %u:%zu different types of data in same bucket: %s, %s\n"
 572                                 "while marking %s",
 573                                 p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr),
 574                                 bch2_data_types[g->mark.data_type],
 575                                 bch2_data_types[data_type],
 576                                 (bch2_bkey_val_to_text(&PBUF(buf), c, *k), buf))) {
 577                         if (data_type == BCH_DATA_btree) {
 578                                 g2->_mark.data_type     = g->_mark.data_type    = data_type;
 579                                 g2->gen_valid           = g->gen_valid          = true;
 580                                 set_bit(BCH_FS_NEED_ALLOC_WRITE, &c->flags);
 581                         } else {
 582                                 do_update = true;
 583                         }
 584                 }
 585
 586                 if (p.has_ec) {
 587                         struct stripe *m = genradix_ptr(&c->stripes[true], p.ec.idx);
 588
 589                         if (fsck_err_on(!m || !m->alive, c,
 590                                         "pointer to nonexistent stripe %llu\n"
 591                                         "while marking %s",
 592                                         (u64) p.ec.idx,
 593                                         (bch2_bkey_val_to_text(&PBUF(buf), c, *k), buf)))
 594                                 do_update = true;
 595
 596                         if (fsck_err_on(!bch2_ptr_matches_stripe_m(m, p), c,
 597                                         "pointer does not match stripe %llu\n"
 598                                         "while marking %s",
 599                                         (u64) p.ec.idx,
 600                                         (bch2_bkey_val_to_text(&PBUF(buf), c, *k), buf)))
 601                                 do_update = true;
 602                 }
 603         }
 604
 605         if (do_update) {
 606                 struct bkey_ptrs ptrs;
 607                 union bch_extent_entry *entry;
 608                 struct bch_extent_ptr *ptr;
 609                 struct bkey_i *new;
 610
 611                 if (is_root) {
 612                         bch_err(c, "cannot update btree roots yet");
 613                         return -EINVAL;
 614                 }
 615
 616                 new = kmalloc(bkey_bytes(k->k), GFP_KERNEL);
 617                 if (!new) {
 618                         bch_err(c, "%s: error allocating new key", __func__);
 619                         return -ENOMEM;
 620                 }
 621
 622                 bkey_reassemble(new, *k);
 623
 624                 if (level) {
 625                         /*
 626                          * We don't want to drop btree node pointers - if the
 627                          * btree node isn't there anymore, the read path will
 628                          * sort it out:
 629                          */
 630                         ptrs = bch2_bkey_ptrs(bkey_i_to_s(new));
 631                         bkey_for_each_ptr(ptrs, ptr) {
 632                                 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
 633                                 struct bucket *g = PTR_BUCKET(ca, ptr, true);
 634
 635                                 ptr->gen = g->mark.gen;
 636                         }
 637                 } else {
 638                         bch2_bkey_drop_ptrs(bkey_i_to_s(new), ptr, ({
 639                                 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
 640                                 struct bucket *g = PTR_BUCKET(ca, ptr, true);
 641                                 enum bch_data_type data_type = bch2_bkey_ptr_data_type(*k, ptr);
 642
 643                                 (ptr->cached &&
 644                                  (!g->gen_valid || gen_cmp(ptr->gen, g->mark.gen) > 0)) ||
 645                                 (!ptr->cached &&
 646                                  gen_cmp(ptr->gen, g->mark.gen) < 0) ||
 647                                 (g->mark.data_type &&
 648                                  g->mark.data_type != data_type);
 649                         }));
 650 again:
 651                         ptrs = bch2_bkey_ptrs(bkey_i_to_s(new));
 652                         bkey_extent_entry_for_each(ptrs, entry) {
 653                                 if (extent_entry_type(entry) == BCH_EXTENT_ENTRY_stripe_ptr) {
 654                                         struct stripe *m = genradix_ptr(&c->stripes[true],
 655                                                                         entry->stripe_ptr.idx);
 656                                         union bch_extent_entry *next_ptr;
 657
 658                                         bkey_extent_entry_for_each_from(ptrs, next_ptr, entry)
 659                                                 if (extent_entry_type(next_ptr) == BCH_EXTENT_ENTRY_ptr)
 660                                                         goto found;
 661                                         next_ptr = NULL;
 662 found:
 663                                         if (!next_ptr) {
 664                                                 bch_err(c, "aieee, found stripe ptr with no data ptr");
 665                                                 continue;
 666                                         }
 667
 668                                         if (!m || !m->alive ||
 669                                             !__bch2_ptr_matches_stripe(&m->ptrs[entry->stripe_ptr.block],
 670                                                                        &next_ptr->ptr,
 671                                                                        m->sectors)) {
 672                                                 bch2_bkey_extent_entry_drop(new, entry);
 673                                                 goto again;
 674                                         }
 675                                 }
 676                         }
 677                 }
 678
 679                 ret = bch2_journal_key_insert(c, btree_id, level, new);
 680                 if (ret)
 681                         kfree(new);
 682                 else
 683                         *k = bkey_i_to_s_c(new);
 684         }
 685 fsck_err:
 686         return ret;
 687 }
 688
 689 /* marking of btree keys/nodes: */
 690
 691 static int bch2_gc_mark_key(struct bch_fs *c, enum btree_id btree_id,
 692                             unsigned level, bool is_root,
 693                             struct bkey_s_c *k,
 694                             u8 *max_stale, bool initial)
 695 {
 696         struct bkey_ptrs_c ptrs;
 697         const struct bch_extent_ptr *ptr;
 698         unsigned flags =
 699                 BTREE_TRIGGER_INSERT|
 700                 BTREE_TRIGGER_GC|
 701                 (initial ? BTREE_TRIGGER_NOATOMIC : 0);
 702         int ret = 0;
 703
 704         if (initial) {
 705                 BUG_ON(bch2_journal_seq_verify &&
 706                        k->k->version.lo > journal_cur_seq(&c->journal));
 707
 708                 ret = bch2_check_fix_ptrs(c, btree_id, level, is_root, k);
 709                 if (ret)
 710                         goto err;
 711
 712                 if (fsck_err_on(k->k->version.lo > atomic64_read(&c->key_version), c,
 713                                 "key version number higher than recorded: %llu > %llu",
 714                                 k->k->version.lo,
 715                                 atomic64_read(&c->key_version)))
 716                         atomic64_set(&c->key_version, k->k->version.lo);
 717
 718                 if (test_bit(BCH_FS_REBUILD_REPLICAS, &c->flags) ||
 719                     fsck_err_on(!bch2_bkey_replicas_marked(c, *k), c,
 720                                 "superblock not marked as containing replicas (type %u)",
 721                                 k->k->type)) {
 722                         ret = bch2_mark_bkey_replicas(c, *k);
 723                         if (ret) {
 724                                 bch_err(c, "error marking bkey replicas: %i", ret);
 725                                 goto err;
 726                         }
 727                 }
 728         }
 729
 730         ptrs = bch2_bkey_ptrs_c(*k);
 731         bkey_for_each_ptr(ptrs, ptr) {
 732                 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
 733                 struct bucket *g = PTR_BUCKET(ca, ptr, true);
 734
 735                 if (gen_after(g->oldest_gen, ptr->gen))
 736                         g->oldest_gen = ptr->gen;
 737
 738                 *max_stale = max(*max_stale, ptr_stale(ca, ptr));
 739         }
 740
 741         ret = bch2_mark_key(c, *k, flags);
 742 fsck_err:
 743 err:
 744         if (ret)
 745                 bch_err(c, "%s: ret %i", __func__, ret);
 746         return ret;
 747 }
 748
 749 static int btree_gc_mark_node(struct bch_fs *c, struct btree *b, u8 *max_stale,
 750                               bool initial)
 751 {
 752         struct btree_node_iter iter;
 753         struct bkey unpacked;
 754         struct bkey_s_c k;
 755         struct bkey_buf prev, cur;
 756         int ret = 0;
 757
 758         *max_stale = 0;
 759
 760         if (!btree_node_type_needs_gc(btree_node_type(b)))
 761                 return 0;
 762
 763         bch2_btree_node_iter_init_from_start(&iter, b);
 764         bch2_bkey_buf_init(&prev);
 765         bch2_bkey_buf_init(&cur);
 766         bkey_init(&prev.k->k);
 767
 768         while ((k = bch2_btree_node_iter_peek_unpack(&iter, b, &unpacked)).k) {
 769                 ret = bch2_gc_mark_key(c, b->c.btree_id, b->c.level, false,
 770                                        &k, max_stale, initial);
 771                 if (ret)
 772                         break;
 773
 774                 bch2_btree_node_iter_advance(&iter, b);
 775
 776                 if (b->c.level) {
 777                         bch2_bkey_buf_reassemble(&cur, c, k);
 778
 779                         ret = bch2_gc_check_topology(c, b, &prev, cur,
 780                                         bch2_btree_node_iter_end(&iter));
 781                         if (ret)
 782                                 break;
 783                 }
 784         }
 785
 786         bch2_bkey_buf_exit(&cur, c);
 787         bch2_bkey_buf_exit(&prev, c);
 788         return ret;
 789 }
 790
 791 static int bch2_gc_btree(struct bch_fs *c, enum btree_id btree_id,
 792                          bool initial, bool metadata_only)
 793 {
 794         struct btree_trans trans;
 795         struct btree_iter iter;
 796         struct btree *b;
 797         unsigned depth = metadata_only                  ? 1
 798                 : bch2_expensive_debug_checks           ? 0
 799                 : !btree_node_type_needs_gc(btree_id)   ? 1
 800                 : 0;
 801         u8 max_stale = 0;
 802         int ret = 0;
 803
 804         bch2_trans_init(&trans, c, 0, 0);
 805
 806         gc_pos_set(c, gc_pos_btree(btree_id, POS_MIN, 0));
 807
 808         __for_each_btree_node(&trans, iter, btree_id, POS_MIN,
 809                               0, depth, BTREE_ITER_PREFETCH, b, ret) {
 810                 bch2_verify_btree_nr_keys(b);
 811
 812                 gc_pos_set(c, gc_pos_btree_node(b));
 813
 814                 ret = btree_gc_mark_node(c, b, &max_stale, initial);
 815                 if (ret)
 816                         break;
 817
 818                 if (!initial) {
 819                         if (max_stale > 64)
 820                                 bch2_btree_node_rewrite(&trans, &iter,
 821                                                 b->data->keys.seq,
 822                                                 BTREE_INSERT_NOWAIT|
 823                                                 BTREE_INSERT_GC_LOCK_HELD);
 824                         else if (!bch2_btree_gc_rewrite_disabled &&
 825                                  (bch2_btree_gc_always_rewrite || max_stale > 16))
 826                                 bch2_btree_node_rewrite(&trans, &iter,
 827                                                 b->data->keys.seq,
 828                                                 BTREE_INSERT_NOWAIT|
 829                                                 BTREE_INSERT_GC_LOCK_HELD);
 830                 }
 831
 832                 bch2_trans_cond_resched(&trans);
 833         }
 834         bch2_trans_iter_exit(&trans, &iter);
 835
 836         bch2_trans_exit(&trans);
 837         if (ret)
 838                 return ret;
 839
 840         mutex_lock(&c->btree_root_lock);
 841         b = c->btree_roots[btree_id].b;
 842         if (!btree_node_fake(b)) {
 843                 struct bkey_s_c k = bkey_i_to_s_c(&b->key);
 844
 845                 ret = bch2_gc_mark_key(c, b->c.btree_id, b->c.level, true,
 846                                        &k, &max_stale, initial);
 847         }
 848         gc_pos_set(c, gc_pos_btree_root(b->c.btree_id));
 849         mutex_unlock(&c->btree_root_lock);
 850
 851         return ret;
 852 }
 853
 854 static int bch2_gc_btree_init_recurse(struct bch_fs *c, struct btree *b,
 855                                       unsigned target_depth)
 856 {
 857         struct btree_and_journal_iter iter;
 858         struct bkey_s_c k;
 859         struct bkey_buf cur, prev;
 860         u8 max_stale = 0;
 861         char buf[200];
 862         int ret = 0;
 863
 864         bch2_btree_and_journal_iter_init_node_iter(&iter, c, b);
 865         bch2_bkey_buf_init(&prev);
 866         bch2_bkey_buf_init(&cur);
 867         bkey_init(&prev.k->k);
 868
 869         while ((k = bch2_btree_and_journal_iter_peek(&iter)).k) {
 870                 BUG_ON(bpos_cmp(k.k->p, b->data->min_key) < 0);
 871                 BUG_ON(bpos_cmp(k.k->p, b->data->max_key) > 0);
 872
 873                 ret = bch2_gc_mark_key(c, b->c.btree_id, b->c.level, false,
 874                                        &k, &max_stale, true);
 875                 if (ret) {
 876                         bch_err(c, "%s: error %i from bch2_gc_mark_key", __func__, ret);
 877                         goto fsck_err;
 878                 }
 879
 880                 if (b->c.level) {
 881                         bch2_bkey_buf_reassemble(&cur, c, k);
 882                         k = bkey_i_to_s_c(cur.k);
 883
 884                         bch2_btree_and_journal_iter_advance(&iter);
 885
 886                         ret = bch2_gc_check_topology(c, b,
 887                                         &prev, cur,
 888                                         !bch2_btree_and_journal_iter_peek(&iter).k);
 889                         if (ret)
 890                                 goto fsck_err;
 891                 } else {
 892                         bch2_btree_and_journal_iter_advance(&iter);
 893                 }
 894         }
 895
 896         if (b->c.level > target_depth) {
 897                 bch2_btree_and_journal_iter_exit(&iter);
 898                 bch2_btree_and_journal_iter_init_node_iter(&iter, c, b);
 899
 900                 while ((k = bch2_btree_and_journal_iter_peek(&iter)).k) {
 901                         struct btree *child;
 902
 903                         bch2_bkey_buf_reassemble(&cur, c, k);
 904                         bch2_btree_and_journal_iter_advance(&iter);
 905
 906                         child = bch2_btree_node_get_noiter(c, cur.k,
 907                                                 b->c.btree_id, b->c.level - 1,
 908                                                 false);
 909                         ret = PTR_ERR_OR_ZERO(child);
 910
 911                         if (ret == -EIO) {
 912                                 bch2_topology_error(c);
 913
 914                                 if (__fsck_err(c,
 915                                           FSCK_CAN_FIX|
 916                                           FSCK_CAN_IGNORE|
 917                                           FSCK_NO_RATELIMIT,
 918                                           "Unreadable btree node at btree %s level %u:\n"
 919                                           "  %s",
 920                                           bch2_btree_ids[b->c.btree_id],
 921                                           b->c.level - 1,
 922                                           (bch2_bkey_val_to_text(&PBUF(buf), c, bkey_i_to_s_c(cur.k)), buf)) &&
 923                                     !test_bit(BCH_FS_TOPOLOGY_REPAIR_DONE, &c->flags)) {
 924                                         ret = FSCK_ERR_START_TOPOLOGY_REPAIR;
 925                                         bch_info(c, "Halting mark and sweep to start topology repair pass");
 926                                         goto fsck_err;
 927                                 } else {
 928                                         /* Continue marking when opted to not
 929                                          * fix the error: */
 930                                         ret = 0;
 931                                         set_bit(BCH_FS_INITIAL_GC_UNFIXED, &c->flags);
 932                                         continue;
 933                                 }
 934                         } else if (ret) {
 935                                 bch_err(c, "%s: error %i getting btree node",
 936                                         __func__, ret);
 937                                 break;
 938                         }
 939
 940                         ret = bch2_gc_btree_init_recurse(c, child,
 941                                                          target_depth);
 942                         six_unlock_read(&child->c.lock);
 943
 944                         if (ret)
 945                                 break;
 946                 }
 947         }
 948 fsck_err:
 949         bch2_bkey_buf_exit(&cur, c);
 950         bch2_bkey_buf_exit(&prev, c);
 951         bch2_btree_and_journal_iter_exit(&iter);
 952         return ret;
 953 }
 954
 955 static int bch2_gc_btree_init(struct bch_fs *c,
 956                               enum btree_id btree_id,
 957                               bool metadata_only)
 958 {
 959         struct btree *b;
 960         unsigned target_depth = metadata_only           ? 1
 961                 : bch2_expensive_debug_checks           ? 0
 962                 : !btree_node_type_needs_gc(btree_id)   ? 1
 963                 : 0;
 964         u8 max_stale = 0;
 965         char buf[100];
 966         int ret = 0;
 967
 968         b = c->btree_roots[btree_id].b;
 969
 970         if (btree_node_fake(b))
 971                 return 0;
 972
 973         six_lock_read(&b->c.lock, NULL, NULL);
 974         if (mustfix_fsck_err_on(bpos_cmp(b->data->min_key, POS_MIN), c,
 975                         "btree root with incorrect min_key: %s",
 976                         (bch2_bpos_to_text(&PBUF(buf), b->data->min_key), buf))) {
 977                 bch_err(c, "repair unimplemented");
 978                 ret = FSCK_ERR_EXIT;
 979                 goto fsck_err;
 980         }
 981
 982         if (mustfix_fsck_err_on(bpos_cmp(b->data->max_key, SPOS_MAX), c,
 983                         "btree root with incorrect max_key: %s",
 984                         (bch2_bpos_to_text(&PBUF(buf), b->data->max_key), buf))) {
 985                 bch_err(c, "repair unimplemented");
 986                 ret = FSCK_ERR_EXIT;
 987                 goto fsck_err;
 988         }
 989
 990         if (b->c.level >= target_depth)
 991                 ret = bch2_gc_btree_init_recurse(c, b, target_depth);
 992
 993         if (!ret) {
 994                 struct bkey_s_c k = bkey_i_to_s_c(&b->key);
 995
 996                 ret = bch2_gc_mark_key(c, b->c.btree_id, b->c.level, true,
 997                                        &k, &max_stale, true);
 998         }
 999 fsck_err:
1000         six_unlock_read(&b->c.lock);
1001
1002         if (ret < 0)
1003                 bch_err(c, "%s: ret %i", __func__, ret);
1004         return ret;
1005 }
1006
1007 static inline int btree_id_gc_phase_cmp(enum btree_id l, enum btree_id r)
1008 {
1009         return  (int) btree_id_to_gc_phase(l) -
1010                 (int) btree_id_to_gc_phase(r);
1011 }
1012
1013 static int bch2_gc_btrees(struct bch_fs *c, bool initial, bool metadata_only)
1014 {
1015         enum btree_id ids[BTREE_ID_NR];
1016         unsigned i;
1017         int ret = 0;
1018
1019         for (i = 0; i < BTREE_ID_NR; i++)
1020                 ids[i] = i;
1021         bubble_sort(ids, BTREE_ID_NR, btree_id_gc_phase_cmp);
1022
1023         for (i = 0; i < BTREE_ID_NR && !ret; i++)
1024                 ret = initial
1025                         ? bch2_gc_btree_init(c, ids[i], metadata_only)
1026                         : bch2_gc_btree(c, ids[i], initial, metadata_only);
1027
1028         if (ret < 0)
1029                 bch_err(c, "%s: ret %i", __func__, ret);
1030         return ret;
1031 }
1032
1033 static void mark_metadata_sectors(struct bch_fs *c, struct bch_dev *ca,
1034                                   u64 start, u64 end,
1035                                   enum bch_data_type type,
1036                                   unsigned flags)
1037 {
1038         u64 b = sector_to_bucket(ca, start);
1039
1040         do {
1041                 unsigned sectors =
1042                         min_t(u64, bucket_to_sector(ca, b + 1), end) - start;
1043
1044                 bch2_mark_metadata_bucket(c, ca, b, type, sectors,
1045                                           gc_phase(GC_PHASE_SB), flags);
1046                 b++;
1047                 start += sectors;
1048         } while (start < end);
1049 }
1050
1051 void bch2_mark_dev_superblock(struct bch_fs *c, struct bch_dev *ca,
1052                               unsigned flags)
1053 {
1054         struct bch_sb_layout *layout = &ca->disk_sb.sb->layout;
1055         unsigned i;
1056         u64 b;
1057
1058         /*
1059          * This conditional is kind of gross, but we may be called from the
1060          * device add path, before the new device has actually been added to the
1061          * running filesystem:
1062          */
1063         if (c) {
1064                 lockdep_assert_held(&c->sb_lock);
1065                 percpu_down_read(&c->mark_lock);
1066         }
1067
1068         for (i = 0; i < layout->nr_superblocks; i++) {
1069                 u64 offset = le64_to_cpu(layout->sb_offset[i]);
1070
1071                 if (offset == BCH_SB_SECTOR)
1072                         mark_metadata_sectors(c, ca, 0, BCH_SB_SECTOR,
1073                                               BCH_DATA_sb, flags);
1074
1075                 mark_metadata_sectors(c, ca, offset,
1076                                       offset + (1 << layout->sb_max_size_bits),
1077                                       BCH_DATA_sb, flags);
1078         }
1079
1080         for (i = 0; i < ca->journal.nr; i++) {
1081                 b = ca->journal.buckets[i];
1082                 bch2_mark_metadata_bucket(c, ca, b, BCH_DATA_journal,
1083                                           ca->mi.bucket_size,
1084                                           gc_phase(GC_PHASE_SB), flags);
1085         }
1086
1087         if (c)
1088                 percpu_up_read(&c->mark_lock);
1089 }
1090
1091 static void bch2_mark_superblocks(struct bch_fs *c)
1092 {
1093         struct bch_dev *ca;
1094         unsigned i;
1095
1096         mutex_lock(&c->sb_lock);
1097         gc_pos_set(c, gc_phase(GC_PHASE_SB));
1098
1099         for_each_online_member(ca, c, i)
1100                 bch2_mark_dev_superblock(c, ca, BTREE_TRIGGER_GC);
1101         mutex_unlock(&c->sb_lock);
1102 }
1103
1104 #if 0
1105 /* Also see bch2_pending_btree_node_free_insert_done() */
1106 static void bch2_mark_pending_btree_node_frees(struct bch_fs *c)
1107 {
1108         struct btree_update *as;
1109         struct pending_btree_node_free *d;
1110
1111         mutex_lock(&c->btree_interior_update_lock);
1112         gc_pos_set(c, gc_phase(GC_PHASE_PENDING_DELETE));
1113
1114         for_each_pending_btree_node_free(c, as, d)
1115                 if (d->index_update_done)
1116                         bch2_mark_key(c, bkey_i_to_s_c(&d->key),
1117                                       BTREE_TRIGGER_INSERT|BTREE_TRIGGER_GC);
1118
1119         mutex_unlock(&c->btree_interior_update_lock);
1120 }
1121 #endif
1122
1123 static void bch2_gc_free(struct bch_fs *c)
1124 {
1125         struct bch_dev *ca;
1126         unsigned i;
1127
1128         genradix_free(&c->stripes[1]);
1129
1130         for_each_member_device(ca, c, i) {
1131                 kvpfree(rcu_dereference_protected(ca->buckets[1], 1),
1132                         sizeof(struct bucket_array) +
1133                         ca->mi.nbuckets * sizeof(struct bucket));
1134                 ca->buckets[1] = NULL;
1135
1136                 free_percpu(ca->usage_gc);
1137                 ca->usage_gc = NULL;
1138         }
1139
1140         free_percpu(c->usage_gc);
1141         c->usage_gc = NULL;
1142 }
1143
1144 static int bch2_gc_done(struct bch_fs *c,
1145                         bool initial, bool metadata_only)
1146 {
1147         struct bch_dev *ca = NULL;
1148         bool verify = !metadata_only && (!initial ||
1149                        (c->sb.compat & (1ULL << BCH_COMPAT_alloc_info)));
1150         unsigned i, dev;
1151         int ret = 0;
1152
1153 #define copy_field(_f, _msg, ...)                                       \
1154         if (dst->_f != src->_f) {                                       \
1155                 if (verify)                                             \
1156                         fsck_err(c, _msg ": got %llu, should be %llu"   \
1157                                 , ##__VA_ARGS__, dst->_f, src->_f);     \
1158                 dst->_f = src->_f;                                      \
1159                 set_bit(BCH_FS_NEED_ALLOC_WRITE, &c->flags);            \
1160         }
1161 #define copy_stripe_field(_f, _msg, ...)                                \
1162         if (dst->_f != src->_f) {                                       \
1163                 if (verify)                                             \
1164                         fsck_err(c, "stripe %zu has wrong "_msg         \
1165                                 ": got %u, should be %u",               \
1166                                 iter.pos, ##__VA_ARGS__,                \
1167                                 dst->_f, src->_f);                      \
1168                 dst->_f = src->_f;                                      \
1169                 set_bit(BCH_FS_NEED_ALLOC_WRITE, &c->flags);            \
1170         }
1171 #define copy_bucket_field(_f)                                           \
1172         if (dst->b[b].mark._f != src->b[b].mark._f) {                   \
1173                 if (verify)                                             \
1174                         fsck_err(c, "bucket %u:%zu gen %u data type %s has wrong " #_f  \
1175                                 ": got %u, should be %u", dev, b,       \
1176                                 dst->b[b].mark.gen,                     \
1177                                 bch2_data_types[dst->b[b].mark.data_type],\
1178                                 dst->b[b].mark._f, src->b[b].mark._f);  \
1179                 dst->b[b]._mark._f = src->b[b].mark._f;                 \
1180                 set_bit(BCH_FS_NEED_ALLOC_WRITE, &c->flags);            \
1181         }
1182 #define copy_dev_field(_f, _msg, ...)                                   \
1183         copy_field(_f, "dev %u has wrong " _msg, dev, ##__VA_ARGS__)
1184 #define copy_fs_field(_f, _msg, ...)                                    \
1185         copy_field(_f, "fs has wrong " _msg, ##__VA_ARGS__)
1186
1187         if (!metadata_only) {
1188                 struct genradix_iter iter = genradix_iter_init(&c->stripes[1], 0);
1189                 struct stripe *dst, *src;
1190
1191                 while ((src = genradix_iter_peek(&iter, &c->stripes[1]))) {
1192                         dst = genradix_ptr_alloc(&c->stripes[0], iter.pos, GFP_KERNEL);
1193
1194                         if (dst->alive          != src->alive ||
1195                             dst->sectors        != src->sectors ||
1196                             dst->algorithm      != src->algorithm ||
1197                             dst->nr_blocks      != src->nr_blocks ||
1198                             dst->nr_redundant   != src->nr_redundant) {
1199                                 bch_err(c, "unexpected stripe inconsistency at bch2_gc_done, confused");
1200                                 ret = -EINVAL;
1201                                 goto fsck_err;
1202                         }
1203
1204                         for (i = 0; i < ARRAY_SIZE(dst->block_sectors); i++)
1205                                 copy_stripe_field(block_sectors[i],
1206                                                   "block_sectors[%u]", i);
1207
1208                         dst->blocks_nonempty = 0;
1209                         for (i = 0; i < dst->nr_blocks; i++)
1210                                 dst->blocks_nonempty += dst->block_sectors[i] != 0;
1211
1212                         genradix_iter_advance(&iter, &c->stripes[1]);
1213                 }
1214         }
1215
1216         for (i = 0; i < ARRAY_SIZE(c->usage); i++)
1217                 bch2_fs_usage_acc_to_base(c, i);
1218
1219         for_each_member_device(ca, c, dev) {
1220                 struct bucket_array *dst = __bucket_array(ca, 0);
1221                 struct bucket_array *src = __bucket_array(ca, 1);
1222                 size_t b;
1223
1224                 for (b = 0; b < src->nbuckets; b++) {
1225                         copy_bucket_field(gen);
1226                         copy_bucket_field(data_type);
1227                         copy_bucket_field(stripe);
1228                         copy_bucket_field(dirty_sectors);
1229                         copy_bucket_field(cached_sectors);
1230
1231                         dst->b[b].oldest_gen = src->b[b].oldest_gen;
1232                 }
1233
1234                 {
1235                         struct bch_dev_usage *dst = ca->usage_base;
1236                         struct bch_dev_usage *src = (void *)
1237                                 bch2_acc_percpu_u64s((void *) ca->usage_gc,
1238                                                      dev_usage_u64s());
1239
1240                         copy_dev_field(buckets_ec,              "buckets_ec");
1241                         copy_dev_field(buckets_unavailable,     "buckets_unavailable");
1242
1243                         for (i = 0; i < BCH_DATA_NR; i++) {
1244                                 copy_dev_field(d[i].buckets,    "%s buckets", bch2_data_types[i]);
1245                                 copy_dev_field(d[i].sectors,    "%s sectors", bch2_data_types[i]);
1246                                 copy_dev_field(d[i].fragmented, "%s fragmented", bch2_data_types[i]);
1247                         }
1248                 }
1249         };
1250
1251         {
1252                 unsigned nr = fs_usage_u64s(c);
1253                 struct bch_fs_usage *dst = c->usage_base;
1254                 struct bch_fs_usage *src = (void *)
1255                         bch2_acc_percpu_u64s((void *) c->usage_gc, nr);
1256
1257                 copy_fs_field(hidden,           "hidden");
1258                 copy_fs_field(btree,            "btree");
1259
1260                 if (!metadata_only) {
1261                         copy_fs_field(data,     "data");
1262                         copy_fs_field(cached,   "cached");
1263                         copy_fs_field(reserved, "reserved");
1264                         copy_fs_field(nr_inodes,"nr_inodes");
1265
1266                         for (i = 0; i < BCH_REPLICAS_MAX; i++)
1267                                 copy_fs_field(persistent_reserved[i],
1268                                               "persistent_reserved[%i]", i);
1269                 }
1270
1271                 for (i = 0; i < c->replicas.nr; i++) {
1272                         struct bch_replicas_entry *e =
1273                                 cpu_replicas_entry(&c->replicas, i);
1274                         char buf[80];
1275
1276                         if (metadata_only &&
1277                             (e->data_type == BCH_DATA_user ||
1278                              e->data_type == BCH_DATA_cached))
1279                                 continue;
1280
1281                         bch2_replicas_entry_to_text(&PBUF(buf), e);
1282
1283                         copy_fs_field(replicas[i], "%s", buf);
1284                 }
1285         }
1286
1287 #undef copy_fs_field
1288 #undef copy_dev_field
1289 #undef copy_bucket_field
1290 #undef copy_stripe_field
1291 #undef copy_field
1292 fsck_err:
1293         if (ca)
1294                 percpu_ref_put(&ca->ref);
1295         if (ret)
1296                 bch_err(c, "%s: ret %i", __func__, ret);
1297         return ret;
1298 }
1299
1300 static int bch2_gc_start(struct bch_fs *c,
1301                          bool metadata_only)
1302 {
1303         struct bch_dev *ca = NULL;
1304         unsigned i;
1305         int ret;
1306
1307         BUG_ON(c->usage_gc);
1308
1309         c->usage_gc = __alloc_percpu_gfp(fs_usage_u64s(c) * sizeof(u64),
1310                                          sizeof(u64), GFP_KERNEL);
1311         if (!c->usage_gc) {
1312                 bch_err(c, "error allocating c->usage_gc");
1313                 return -ENOMEM;
1314         }
1315
1316         for_each_member_device(ca, c, i) {
1317                 BUG_ON(ca->buckets[1]);
1318                 BUG_ON(ca->usage_gc);
1319
1320                 ca->buckets[1] = kvpmalloc(sizeof(struct bucket_array) +
1321                                 ca->mi.nbuckets * sizeof(struct bucket),
1322                                 GFP_KERNEL|__GFP_ZERO);
1323                 if (!ca->buckets[1]) {
1324                         percpu_ref_put(&ca->ref);
1325                         bch_err(c, "error allocating ca->buckets[gc]");
1326                         return -ENOMEM;
1327                 }
1328
1329                 ca->usage_gc = alloc_percpu(struct bch_dev_usage);
1330                 if (!ca->usage_gc) {
1331                         bch_err(c, "error allocating ca->usage_gc");
1332                         percpu_ref_put(&ca->ref);
1333                         return -ENOMEM;
1334                 }
1335         }
1336
1337         ret = bch2_ec_mem_alloc(c, true);
1338         if (ret) {
1339                 bch_err(c, "error allocating ec gc mem");
1340                 return ret;
1341         }
1342
1343         percpu_down_write(&c->mark_lock);
1344
1345         /*
1346          * indicate to stripe code that we need to allocate for the gc stripes
1347          * radix tree, too
1348          */
1349         gc_pos_set(c, gc_phase(GC_PHASE_START));
1350
1351         for_each_member_device(ca, c, i) {
1352                 struct bucket_array *dst = __bucket_array(ca, 1);
1353                 struct bucket_array *src = __bucket_array(ca, 0);
1354                 size_t b;
1355
1356                 dst->first_bucket       = src->first_bucket;
1357                 dst->nbuckets           = src->nbuckets;
1358
1359                 for (b = 0; b < src->nbuckets; b++) {
1360                         struct bucket *d = &dst->b[b];
1361                         struct bucket *s = &src->b[b];
1362
1363                         d->_mark.gen = dst->b[b].oldest_gen = s->mark.gen;
1364                         d->gen_valid = s->gen_valid;
1365
1366                         if (metadata_only &&
1367                             (s->mark.data_type == BCH_DATA_user ||
1368                              s->mark.data_type == BCH_DATA_cached))
1369                                 d->_mark = s->mark;
1370                 }
1371         };
1372
1373         percpu_up_write(&c->mark_lock);
1374
1375         return 0;
1376 }
1377
1378 static int bch2_gc_reflink_done_initial_fn(struct bch_fs *c, struct bkey_s_c k)
1379 {
1380         struct reflink_gc *r;
1381         const __le64 *refcount = bkey_refcount_c(k);
1382         char buf[200];
1383         int ret = 0;
1384
1385         if (!refcount)
1386                 return 0;
1387
1388         r = genradix_ptr(&c->reflink_gc_table, c->reflink_gc_idx++);
1389         if (!r)
1390                 return -ENOMEM;
1391
1392         if (!r ||
1393             r->offset != k.k->p.offset ||
1394             r->size != k.k->size) {
1395                 bch_err(c, "unexpected inconsistency walking reflink table at gc finish");
1396                 return -EINVAL;
1397         }
1398
1399         if (fsck_err_on(r->refcount != le64_to_cpu(*refcount), c,
1400                         "reflink key has wrong refcount:\n"
1401                         "  %s\n"
1402                         "  should be %u",
1403                         (bch2_bkey_val_to_text(&PBUF(buf), c, k), buf),
1404                         r->refcount)) {
1405                 struct bkey_i *new;
1406
1407                 new = kmalloc(bkey_bytes(k.k), GFP_KERNEL);
1408                 if (!new) {
1409                         ret = -ENOMEM;
1410                         goto fsck_err;
1411                 }
1412
1413                 bkey_reassemble(new, k);
1414
1415                 if (!r->refcount) {
1416                         new->k.type = KEY_TYPE_deleted;
1417                         new->k.size = 0;
1418                 } else {
1419                         *bkey_refcount(new) = cpu_to_le64(r->refcount);
1420                 }
1421
1422                 ret = bch2_journal_key_insert(c, BTREE_ID_reflink, 0, new);
1423                 if (ret)
1424                         kfree(new);
1425         }
1426 fsck_err:
1427         return ret;
1428 }
1429
1430 static int bch2_gc_reflink_done(struct bch_fs *c, bool initial,
1431                                 bool metadata_only)
1432 {
1433         struct btree_trans trans;
1434         struct btree_iter iter;
1435         struct bkey_s_c k;
1436         struct reflink_gc *r;
1437         size_t idx = 0;
1438         char buf[200];
1439         int ret = 0;
1440
1441         if (metadata_only)
1442                 return 0;
1443
1444         if (initial) {
1445                 c->reflink_gc_idx = 0;
1446
1447                 ret = bch2_btree_and_journal_walk(c, BTREE_ID_reflink,
1448                                 bch2_gc_reflink_done_initial_fn);
1449                 goto out;
1450         }
1451
1452         bch2_trans_init(&trans, c, 0, 0);
1453
1454         for_each_btree_key(&trans, iter, BTREE_ID_reflink, POS_MIN,
1455                            BTREE_ITER_PREFETCH, k, ret) {
1456                 const __le64 *refcount = bkey_refcount_c(k);
1457
1458                 if (!refcount)
1459                         continue;
1460
1461                 r = genradix_ptr(&c->reflink_gc_table, idx);
1462                 if (!r ||
1463                     r->offset != k.k->p.offset ||
1464                     r->size != k.k->size) {
1465                         bch_err(c, "unexpected inconsistency walking reflink table at gc finish");
1466                         ret = -EINVAL;
1467                         break;
1468                 }
1469
1470                 if (fsck_err_on(r->refcount != le64_to_cpu(*refcount), c,
1471                                 "reflink key has wrong refcount:\n"
1472                                 "  %s\n"
1473                                 "  should be %u",
1474                                 (bch2_bkey_val_to_text(&PBUF(buf), c, k), buf),
1475                                 r->refcount)) {
1476                         struct bkey_i *new;
1477
1478                         new = kmalloc(bkey_bytes(k.k), GFP_KERNEL);
1479                         if (!new) {
1480                                 ret = -ENOMEM;
1481                                 break;
1482                         }
1483
1484                         bkey_reassemble(new, k);
1485
1486                         if (!r->refcount)
1487                                 new->k.type = KEY_TYPE_deleted;
1488                         else
1489                                 *bkey_refcount(new) = cpu_to_le64(r->refcount);
1490
1491                         ret = __bch2_trans_do(&trans, NULL, NULL, 0,
1492                                         __bch2_btree_insert(&trans, BTREE_ID_reflink, new));
1493                         kfree(new);
1494
1495                         if (ret)
1496                                 break;
1497                 }
1498         }
1499 fsck_err:
1500         bch2_trans_iter_exit(&trans, &iter);
1501         bch2_trans_exit(&trans);
1502 out:
1503         genradix_free(&c->reflink_gc_table);
1504         c->reflink_gc_nr = 0;
1505         return ret;
1506 }
1507
1508 static int bch2_gc_reflink_start_initial_fn(struct bch_fs *c, struct bkey_s_c k)
1509 {
1510
1511         struct reflink_gc *r;
1512         const __le64 *refcount = bkey_refcount_c(k);
1513
1514         if (!refcount)
1515                 return 0;
1516
1517         r = genradix_ptr_alloc(&c->reflink_gc_table, c->reflink_gc_nr++,
1518                                GFP_KERNEL);
1519         if (!r)
1520                 return -ENOMEM;
1521
1522         r->offset       = k.k->p.offset;
1523         r->size         = k.k->size;
1524         r->refcount     = 0;
1525         return 0;
1526 }
1527
1528 static int bch2_gc_reflink_start(struct bch_fs *c, bool initial,
1529                                  bool metadata_only)
1530 {
1531         struct btree_trans trans;
1532         struct btree_iter iter;
1533         struct bkey_s_c k;
1534         struct reflink_gc *r;
1535         int ret;
1536
1537         if (metadata_only)
1538                 return 0;
1539
1540         genradix_free(&c->reflink_gc_table);
1541         c->reflink_gc_nr = 0;
1542
1543         if (initial)
1544                 return bch2_btree_and_journal_walk(c, BTREE_ID_reflink,
1545                                 bch2_gc_reflink_start_initial_fn);
1546
1547         bch2_trans_init(&trans, c, 0, 0);
1548
1549         for_each_btree_key(&trans, iter, BTREE_ID_reflink, POS_MIN,
1550                            BTREE_ITER_PREFETCH, k, ret) {
1551                 const __le64 *refcount = bkey_refcount_c(k);
1552
1553                 if (!refcount)
1554                         continue;
1555
1556                 r = genradix_ptr_alloc(&c->reflink_gc_table, c->reflink_gc_nr++,
1557                                        GFP_KERNEL);
1558                 if (!r) {
1559                         ret = -ENOMEM;
1560                         break;
1561                 }
1562
1563                 r->offset       = k.k->p.offset;
1564                 r->size         = k.k->size;
1565                 r->refcount     = 0;
1566         }
1567         bch2_trans_iter_exit(&trans, &iter);
1568
1569         bch2_trans_exit(&trans);
1570         return 0;
1571 }
1572
1573 /**
1574  * bch2_gc - walk _all_ references to buckets, and recompute them:
1575  *
1576  * Order matters here:
1577  *  - Concurrent GC relies on the fact that we have a total ordering for
1578  *    everything that GC walks - see  gc_will_visit_node(),
1579  *    gc_will_visit_root()
1580  *
1581  *  - also, references move around in the course of index updates and
1582  *    various other crap: everything needs to agree on the ordering
1583  *    references are allowed to move around in - e.g., we're allowed to
1584  *    start with a reference owned by an open_bucket (the allocator) and
1585  *    move it to the btree, but not the reverse.
1586  *
1587  *    This is necessary to ensure that gc doesn't miss references that
1588  *    move around - if references move backwards in the ordering GC
1589  *    uses, GC could skip past them
1590  */
1591 int bch2_gc(struct bch_fs *c, bool initial, bool metadata_only)
1592 {
1593         struct bch_dev *ca;
1594         u64 start_time = local_clock();
1595         unsigned i, iter = 0;
1596         int ret;
1597
1598         lockdep_assert_held(&c->state_lock);
1599         trace_gc_start(c);
1600
1601         down_write(&c->gc_lock);
1602
1603         /* flush interior btree updates: */
1604         closure_wait_event(&c->btree_interior_update_wait,
1605                            !bch2_btree_interior_updates_nr_pending(c));
1606 again:
1607         ret   = bch2_gc_start(c, metadata_only) ?:
1608                 bch2_gc_reflink_start(c, initial, metadata_only);
1609         if (ret)
1610                 goto out;
1611
1612         bch2_mark_superblocks(c);
1613
1614         if (test_bit(BCH_FS_TOPOLOGY_ERROR, &c->flags) &&
1615             !test_bit(BCH_FS_INITIAL_GC_DONE, &c->flags) &&
1616             c->opts.fix_errors != FSCK_OPT_NO) {
1617                 bch_info(c, "starting topology repair pass");
1618                 ret = bch2_repair_topology(c);
1619                 if (ret)
1620                         goto out;
1621                 bch_info(c, "topology repair pass done");
1622
1623                 set_bit(BCH_FS_TOPOLOGY_REPAIR_DONE, &c->flags);
1624         }
1625
1626         ret = bch2_gc_btrees(c, initial, metadata_only);
1627
1628         if (ret == FSCK_ERR_START_TOPOLOGY_REPAIR &&
1629             !test_bit(BCH_FS_TOPOLOGY_REPAIR_DONE, &c->flags) &&
1630             !test_bit(BCH_FS_INITIAL_GC_DONE, &c->flags)) {
1631                 set_bit(BCH_FS_NEED_ANOTHER_GC, &c->flags);
1632                 ret = 0;
1633         }
1634
1635         if (ret == FSCK_ERR_START_TOPOLOGY_REPAIR)
1636                 ret = FSCK_ERR_EXIT;
1637
1638         if (ret)
1639                 goto out;
1640
1641 #if 0
1642         bch2_mark_pending_btree_node_frees(c);
1643 #endif
1644         c->gc_count++;
1645
1646         if (test_bit(BCH_FS_NEED_ANOTHER_GC, &c->flags) ||
1647             (!iter && bch2_test_restart_gc)) {
1648                 /*
1649                  * XXX: make sure gens we fixed got saved
1650                  */
1651                 if (iter++ <= 2) {
1652                         bch_info(c, "Second GC pass needed, restarting:");
1653                         clear_bit(BCH_FS_NEED_ANOTHER_GC, &c->flags);
1654                         __gc_pos_set(c, gc_phase(GC_PHASE_NOT_RUNNING));
1655
1656                         percpu_down_write(&c->mark_lock);
1657                         bch2_gc_free(c);
1658                         percpu_up_write(&c->mark_lock);
1659                         /* flush fsck errors, reset counters */
1660                         bch2_flush_fsck_errs(c);
1661
1662                         goto again;
1663                 }
1664
1665                 bch_info(c, "Unable to fix bucket gens, looping");
1666                 ret = -EINVAL;
1667         }
1668 out:
1669         if (!ret) {
1670                 bch2_journal_block(&c->journal);
1671
1672                 percpu_down_write(&c->mark_lock);
1673                 ret   = bch2_gc_reflink_done(c, initial, metadata_only) ?:
1674                         bch2_gc_done(c, initial, metadata_only);
1675
1676                 bch2_journal_unblock(&c->journal);
1677         } else {
1678                 percpu_down_write(&c->mark_lock);
1679         }
1680
1681         /* Indicates that gc is no longer in progress: */
1682         __gc_pos_set(c, gc_phase(GC_PHASE_NOT_RUNNING));
1683
1684         bch2_gc_free(c);
1685         percpu_up_write(&c->mark_lock);
1686
1687         up_write(&c->gc_lock);
1688
1689         trace_gc_end(c);
1690         bch2_time_stats_update(&c->times[BCH_TIME_btree_gc], start_time);
1691
1692         /*
1693          * Wake up allocator in case it was waiting for buckets
1694          * because of not being able to inc gens
1695          */
1696         for_each_member_device(ca, c, i)
1697                 bch2_wake_allocator(ca);
1698
1699         /*
1700          * At startup, allocations can happen directly instead of via the
1701          * allocator thread - issue wakeup in case they blocked on gc_lock:
1702          */
1703         closure_wake_up(&c->freelist_wait);
1704         return ret;
1705 }
1706
1707 static bool gc_btree_gens_key(struct bch_fs *c, struct bkey_s_c k)
1708 {
1709         struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
1710         const struct bch_extent_ptr *ptr;
1711
1712         percpu_down_read(&c->mark_lock);
1713         bkey_for_each_ptr(ptrs, ptr) {
1714                 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
1715                 struct bucket *g = PTR_BUCKET(ca, ptr, false);
1716
1717                 if (gen_after(g->mark.gen, ptr->gen) > 16) {
1718                         percpu_up_read(&c->mark_lock);
1719                         return true;
1720                 }
1721         }
1722
1723         bkey_for_each_ptr(ptrs, ptr) {
1724                 struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev);
1725                 struct bucket *g = PTR_BUCKET(ca, ptr, false);
1726
1727                 if (gen_after(g->gc_gen, ptr->gen))
1728                         g->gc_gen = ptr->gen;
1729         }
1730         percpu_up_read(&c->mark_lock);
1731
1732         return false;
1733 }
1734
1735 /*
1736  * For recalculating oldest gen, we only need to walk keys in leaf nodes; btree
1737  * node pointers currently never have cached pointers that can become stale:
1738  */
1739 static int bch2_gc_btree_gens(struct bch_fs *c, enum btree_id btree_id)
1740 {
1741         struct btree_trans trans;
1742         struct btree_iter iter;
1743         struct bkey_s_c k;
1744         struct bkey_buf sk;
1745         int ret = 0, commit_err = 0;
1746
1747         bch2_bkey_buf_init(&sk);
1748         bch2_trans_init(&trans, c, 0, 0);
1749
1750         bch2_trans_iter_init(&trans, &iter, btree_id, POS_MIN,
1751                              BTREE_ITER_PREFETCH|
1752                              BTREE_ITER_NOT_EXTENTS|
1753                              BTREE_ITER_ALL_SNAPSHOTS);
1754
1755         while ((bch2_trans_begin(&trans),
1756                 k = bch2_btree_iter_peek(&iter)).k) {
1757                 ret = bkey_err(k);
1758
1759                 if (ret == -EINTR)
1760                         continue;
1761                 if (ret)
1762                         break;
1763
1764                 c->gc_gens_pos = iter.pos;
1765
1766                 if (gc_btree_gens_key(c, k) && !commit_err) {
1767                         bch2_bkey_buf_reassemble(&sk, c, k);
1768                         bch2_extent_normalize(c, bkey_i_to_s(sk.k));
1769
1770                         commit_err =
1771                                 bch2_trans_update(&trans, &iter, sk.k, 0) ?:
1772                                 bch2_trans_commit(&trans, NULL, NULL,
1773                                                        BTREE_INSERT_NOWAIT|
1774                                                        BTREE_INSERT_NOFAIL);
1775                         if (commit_err == -EINTR) {
1776                                 commit_err = 0;
1777                                 continue;
1778                         }
1779                 }
1780
1781                 bch2_btree_iter_advance(&iter);
1782         }
1783         bch2_trans_iter_exit(&trans, &iter);
1784
1785         bch2_trans_exit(&trans);
1786         bch2_bkey_buf_exit(&sk, c);
1787
1788         return ret;
1789 }
1790
1791 int bch2_gc_gens(struct bch_fs *c)
1792 {
1793         struct bch_dev *ca;
1794         struct bucket_array *buckets;
1795         struct bucket *g;
1796         unsigned i;
1797         int ret;
1798
1799         /*
1800          * Ideally we would be using state_lock and not gc_lock here, but that
1801          * introduces a deadlock in the RO path - we currently take the state
1802          * lock at the start of going RO, thus the gc thread may get stuck:
1803          */
1804         down_read(&c->gc_lock);
1805
1806         for_each_member_device(ca, c, i) {
1807                 down_read(&ca->bucket_lock);
1808                 buckets = bucket_array(ca);
1809
1810                 for_each_bucket(g, buckets)
1811                         g->gc_gen = g->mark.gen;
1812                 up_read(&ca->bucket_lock);
1813         }
1814
1815         for (i = 0; i < BTREE_ID_NR; i++)
1816                 if ((1 << i) & BTREE_ID_HAS_PTRS) {
1817                         c->gc_gens_btree = i;
1818                         c->gc_gens_pos = POS_MIN;
1819                         ret = bch2_gc_btree_gens(c, i);
1820                         if (ret) {
1821                                 bch_err(c, "error recalculating oldest_gen: %i", ret);
1822                                 goto err;
1823                         }
1824                 }
1825
1826         for_each_member_device(ca, c, i) {
1827                 down_read(&ca->bucket_lock);
1828                 buckets = bucket_array(ca);
1829
1830                 for_each_bucket(g, buckets)
1831                         g->oldest_gen = g->gc_gen;
1832                 up_read(&ca->bucket_lock);
1833         }
1834
1835         c->gc_gens_btree        = 0;
1836         c->gc_gens_pos          = POS_MIN;
1837
1838         c->gc_count++;
1839 err:
1840         up_read(&c->gc_lock);
1841         return ret;
1842 }
1843
1844 static int bch2_gc_thread(void *arg)
1845 {
1846         struct bch_fs *c = arg;
1847         struct io_clock *clock = &c->io_clock[WRITE];
1848         unsigned long last = atomic64_read(&clock->now);
1849         unsigned last_kick = atomic_read(&c->kick_gc);
1850         int ret;
1851
1852         set_freezable();
1853
1854         while (1) {
1855                 while (1) {
1856                         set_current_state(TASK_INTERRUPTIBLE);
1857
1858                         if (kthread_should_stop()) {
1859                                 __set_current_state(TASK_RUNNING);
1860                                 return 0;
1861                         }
1862
1863                         if (atomic_read(&c->kick_gc) != last_kick)
1864                                 break;
1865
1866                         if (c->btree_gc_periodic) {
1867                                 unsigned long next = last + c->capacity / 16;
1868
1869                                 if (atomic64_read(&clock->now) >= next)
1870                                         break;
1871
1872                                 bch2_io_clock_schedule_timeout(clock, next);
1873                         } else {
1874                                 schedule();
1875                         }
1876
1877                         try_to_freeze();
1878                 }
1879                 __set_current_state(TASK_RUNNING);
1880
1881                 last = atomic64_read(&clock->now);
1882                 last_kick = atomic_read(&c->kick_gc);
1883
1884                 /*
1885                  * Full gc is currently incompatible with btree key cache:
1886                  */
1887 #if 0
1888                 ret = bch2_gc(c, false, false);
1889 #else
1890                 ret = bch2_gc_gens(c);
1891 #endif
1892                 if (ret < 0)
1893                         bch_err(c, "btree gc failed: %i", ret);
1894
1895                 debug_check_no_locks_held();
1896         }
1897
1898         return 0;
1899 }
1900
1901 void bch2_gc_thread_stop(struct bch_fs *c)
1902 {
1903         struct task_struct *p;
1904
1905         p = c->gc_thread;
1906         c->gc_thread = NULL;
1907
1908         if (p) {
1909                 kthread_stop(p);
1910                 put_task_struct(p);
1911         }
1912 }
1913
1914 int bch2_gc_thread_start(struct bch_fs *c)
1915 {
1916         struct task_struct *p;
1917
1918         if (c->gc_thread)
1919                 return 0;
1920
1921         p = kthread_create(bch2_gc_thread, c, "bch-gc/%s", c->name);
1922         if (IS_ERR(p)) {
1923                 bch_err(c, "error creating gc thread: %li", PTR_ERR(p));
1924                 return PTR_ERR(p);
1925         }
1926
1927         get_task_struct(p);
1928         c->gc_thread = p;
1929         wake_up_process(p);
1930         return 0;
1931 }