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