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 "error.h"
   8 #include "lru.h"
   9 #include "recovery.h"
  10
  11 /* KEY_TYPE_lru is obsolete: */
  12 int bch2_lru_invalid(const struct bch_fs *c, struct bkey_s_c k,
  13                      int rw, struct printbuf *err)
  14 {
  15         const struct bch_lru *lru = bkey_s_c_to_lru(k).v;
  16
  17         if (bkey_val_bytes(k.k) < sizeof(*lru)) {
  18                 prt_printf(err, "incorrect value size (%zu < %zu)",
  19                        bkey_val_bytes(k.k), sizeof(*lru));
  20                 return -BCH_ERR_invalid_bkey;
  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 static int __bch2_lru_set(struct btree_trans *trans, u16 lru_id,
  35                         u64 dev_bucket, u64 time, unsigned key_type)
  36 {
  37         struct btree_iter iter;
  38         struct bkey_i *k;
  39         int ret = 0;
  40
  41         if (!time)
  42                 return 0;
  43
  44         k = bch2_trans_kmalloc_nomemzero(trans, sizeof(*k));
  45         ret = PTR_ERR_OR_ZERO(k);
  46         if (unlikely(ret))
  47                 return ret;
  48
  49         bkey_init(&k->k);
  50         k->k.type = key_type;
  51         k->k.p = lru_pos(lru_id, dev_bucket, time);
  52
  53         EBUG_ON(lru_pos_id(k->k.p) != lru_id);
  54         EBUG_ON(lru_pos_time(k->k.p) != time);
  55         EBUG_ON(k->k.p.offset != dev_bucket);
  56
  57         bch2_trans_iter_init(trans, &iter, BTREE_ID_lru,
  58                              k->k.p, BTREE_ITER_INTENT);
  59
  60         ret = bch2_btree_iter_traverse(&iter) ?:
  61                 bch2_btree_delete_at(trans, &iter, 0);
  62         bch2_trans_iter_exit(trans, &iter);
  63         return ret;
  64 }
  65
  66 int bch2_lru_del(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
  67 {
  68         return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_deleted);
  69 }
  70
  71 int bch2_lru_set(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
  72 {
  73         return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_set);
  74 }
  75
  76 int bch2_lru_change(struct btree_trans *trans,
  77                     u16 lru_id, u64 dev_bucket,
  78                     u64 old_time, u64 new_time)
  79 {
  80         if (old_time == new_time)
  81                 return 0;
  82
  83         return  bch2_lru_del(trans, lru_id, dev_bucket, old_time) ?:
  84                 bch2_lru_set(trans, lru_id, dev_bucket, new_time);
  85 }
  86
  87 static int bch2_check_lru_key(struct btree_trans *trans,
  88                               struct btree_iter *lru_iter,
  89                               struct bkey_s_c lru_k)
  90 {
  91         struct bch_fs *c = trans->c;
  92         struct btree_iter iter;
  93         struct bkey_s_c k;
  94         struct bch_alloc_v4 a_convert;
  95         const struct bch_alloc_v4 *a;
  96         struct printbuf buf1 = PRINTBUF;
  97         struct printbuf buf2 = PRINTBUF;
  98         struct bpos alloc_pos = u64_to_bucket(lru_k.k->p.offset);
  99         int ret;
 100
 101         if (fsck_err_on(!bch2_dev_bucket_exists(c, alloc_pos), c,
 102                         "lru key points to nonexistent device:bucket %llu:%llu",
 103                         alloc_pos.inode, alloc_pos.offset))
 104                 return bch2_btree_delete_at(trans, lru_iter, 0);
 105
 106         bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc, alloc_pos, 0);
 107         k = bch2_btree_iter_peek_slot(&iter);
 108         ret = bkey_err(k);
 109         if (ret)
 110                 goto err;
 111
 112         a = bch2_alloc_to_v4(k, &a_convert);
 113
 114         if (fsck_err_on(k.k->type != KEY_TYPE_set ||
 115                         a->data_type != BCH_DATA_cached ||
 116                         a->io_time[READ] != lru_k.k->p.offset, c,
 117                         "incorrect lru entry %s\n"
 118                         "  for %s",
 119                         (bch2_bkey_val_to_text(&buf1, c, lru_k), buf1.buf),
 120                         (bch2_bkey_val_to_text(&buf2, c, k), buf2.buf))) {
 121                 ret = bch2_btree_delete_at(trans, lru_iter, 0);
 122                 if (ret)
 123                         goto err;
 124         }
 125 err:
 126 fsck_err:
 127         bch2_trans_iter_exit(trans, &iter);
 128         printbuf_exit(&buf2);
 129         printbuf_exit(&buf1);
 130         return ret;
 131 }
 132
 133 int bch2_check_lrus(struct bch_fs *c)
 134 {
 135         struct btree_trans trans;
 136         struct btree_iter iter;
 137         struct bkey_s_c k;
 138         int ret = 0;
 139
 140         bch2_trans_init(&trans, c, 0, 0);
 141
 142         ret = for_each_btree_key_commit(&trans, iter,
 143                         BTREE_ID_lru, POS_MIN, BTREE_ITER_PREFETCH, k,
 144                         NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
 145                 bch2_check_lru_key(&trans, &iter, k));
 146
 147         bch2_trans_exit(&trans);
 148         return ret;
 149
 150 }