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