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

   1 // SPDX-License-Identifier: GPL-2.0
   2
   3 #include "bcachefs.h"
   4 #include "alloc_background.h"
   5 #include "btree_iter.h"
   6 #include "btree_update.h"
   7 #include "btree_write_buffer.h"
   8 #include "error.h"
   9 #include "lru.h"
  10 #include "recovery.h"
  11
  12 /* KEY_TYPE_lru is obsolete: */
  13 int bch2_lru_invalid(const struct bch_fs *c, struct bkey_s_c k,
  14                      enum bkey_invalid_flags flags,
  15                      struct printbuf *err)
  16 {
  17         if (!lru_pos_time(k.k->p)) {
  18                 prt_printf(err, "lru entry at time=0");
  19                 return -BCH_ERR_invalid_bkey;
  20
  21         }
  22
  23         return 0;
  24 }
  25
  26 void bch2_lru_to_text(struct printbuf *out, struct bch_fs *c,
  27                       struct bkey_s_c k)
  28 {
  29         const struct bch_lru *lru = bkey_s_c_to_lru(k).v;
  30
  31         prt_printf(out, "idx %llu", le64_to_cpu(lru->idx));
  32 }
  33
  34 void bch2_lru_pos_to_text(struct printbuf *out, struct bpos lru)
  35 {
  36         prt_printf(out, "%llu:%llu -> %llu:%llu",
  37                    lru_pos_id(lru),
  38                    lru_pos_time(lru),
  39                    u64_to_bucket(lru.offset).inode,
  40                    u64_to_bucket(lru.offset).offset);
  41 }
  42
  43 static int __bch2_lru_set(struct btree_trans *trans, u16 lru_id,
  44                         u64 dev_bucket, u64 time, unsigned key_type)
  45 {
  46         struct bkey_i *k;
  47         int ret = 0;
  48
  49         if (!time)
  50                 return 0;
  51
  52         k = bch2_trans_kmalloc_nomemzero(trans, sizeof(*k));
  53         ret = PTR_ERR_OR_ZERO(k);
  54         if (unlikely(ret))
  55                 return ret;
  56
  57         bkey_init(&k->k);
  58         k->k.type = key_type;
  59         k->k.p = lru_pos(lru_id, dev_bucket, time);
  60
  61         EBUG_ON(lru_pos_id(k->k.p) != lru_id);
  62         EBUG_ON(lru_pos_time(k->k.p) != time);
  63         EBUG_ON(k->k.p.offset != dev_bucket);
  64
  65         return bch2_trans_update_buffered(trans, BTREE_ID_lru, k,
  66                                           key_type == KEY_TYPE_deleted);
  67 }
  68
  69 int bch2_lru_del(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
  70 {
  71         return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_deleted);
  72 }
  73
  74 int bch2_lru_set(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
  75 {
  76         return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_set);
  77 }
  78
  79 int bch2_lru_change(struct btree_trans *trans,
  80                     u16 lru_id, u64 dev_bucket,
  81                     u64 old_time, u64 new_time)
  82 {
  83         if (old_time == new_time)
  84                 return 0;
  85
  86         return  bch2_lru_del(trans, lru_id, dev_bucket, old_time) ?:
  87                 bch2_lru_set(trans, lru_id, dev_bucket, new_time);
  88 }
  89
  90 static const char * const bch2_lru_types[] = {
  91 #define x(n) #n,
  92         BCH_LRU_TYPES()
  93 #undef x
  94         NULL
  95 };
  96
  97 static int bch2_check_lru_key(struct btree_trans *trans,
  98                               struct btree_iter *lru_iter,
  99                               struct bkey_s_c lru_k,
 100                               struct bpos *last_flushed_pos)
 101 {
 102         struct bch_fs *c = trans->c;
 103         struct btree_iter iter;
 104         struct bkey_s_c k;
 105         struct bch_alloc_v4 a_convert;
 106         const struct bch_alloc_v4 *a;
 107         struct printbuf buf1 = PRINTBUF;
 108         struct printbuf buf2 = PRINTBUF;
 109         enum bch_lru_type type = lru_type(lru_k);
 110         struct bpos alloc_pos = u64_to_bucket(lru_k.k->p.offset);
 111         u64 idx;
 112         int ret;
 113
 114         if (fsck_err_on(!bch2_dev_bucket_exists(c, alloc_pos), c,
 115                         "lru key points to nonexistent device:bucket %llu:%llu",
 116                         alloc_pos.inode, alloc_pos.offset))
 117                 return bch2_btree_delete_at(trans, lru_iter, 0);
 118
 119         k = bch2_bkey_get_iter(trans, &iter, BTREE_ID_alloc, alloc_pos, 0);
 120         ret = bkey_err(k);
 121         if (ret)
 122                 goto err;
 123
 124         a = bch2_alloc_to_v4(k, &a_convert);
 125
 126         switch (type) {
 127         case BCH_LRU_read:
 128                 idx = alloc_lru_idx_read(*a);
 129                 break;
 130         case BCH_LRU_fragmentation:
 131                 idx = a->fragmentation_lru;
 132                 break;
 133         }
 134
 135         if (lru_k.k->type != KEY_TYPE_set ||
 136             lru_pos_time(lru_k.k->p) != idx) {
 137                 if (!bpos_eq(*last_flushed_pos, lru_k.k->p)) {
 138                         *last_flushed_pos = lru_k.k->p;
 139                         ret = bch2_btree_write_buffer_flush_sync(trans) ?:
 140                                 -BCH_ERR_transaction_restart_write_buffer_flush;
 141                         goto out;
 142                 }
 143
 144                 if (c->opts.reconstruct_alloc ||
 145                     fsck_err(c, "incorrect lru entry: lru %s time %llu\n"
 146                              "  %s\n"
 147                              "  for %s",
 148                              bch2_lru_types[type],
 149                              lru_pos_time(lru_k.k->p),
 150                              (bch2_bkey_val_to_text(&buf1, c, lru_k), buf1.buf),
 151                              (bch2_bkey_val_to_text(&buf2, c, k), buf2.buf)))
 152                         ret = bch2_btree_delete_at(trans, lru_iter, 0);
 153         }
 154 out:
 155 err:
 156 fsck_err:
 157         bch2_trans_iter_exit(trans, &iter);
 158         printbuf_exit(&buf2);
 159         printbuf_exit(&buf1);
 160         return ret;
 161 }
 162
 163 int bch2_check_lrus(struct bch_fs *c)
 164 {
 165         struct btree_iter iter;
 166         struct bkey_s_c k;
 167         struct bpos last_flushed_pos = POS_MIN;
 168         int ret = 0;
 169
 170         ret = bch2_trans_run(c,
 171                 for_each_btree_key_commit(&trans, iter,
 172                                 BTREE_ID_lru, POS_MIN, BTREE_ITER_PREFETCH, k,
 173                                 NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
 174                         bch2_check_lru_key(&trans, &iter, k, &last_flushed_pos)));
 175         if (ret)
 176                 bch_err_fn(c, ret);
 177         return ret;
 178
 179 }