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 btree_iter iter;
  53         struct bkey_i *k;
  54         int ret = 0;
  55
  56         if (!time)
  57                 return 0;
  58
  59         k = bch2_trans_kmalloc_nomemzero(trans, sizeof(*k));
  60         ret = PTR_ERR_OR_ZERO(k);
  61         if (unlikely(ret))
  62                 return ret;
  63
  64         bkey_init(&k->k);
  65         k->k.type = key_type;
  66         k->k.p = lru_pos(lru_id, dev_bucket, time);
  67
  68         EBUG_ON(lru_pos_id(k->k.p) != lru_id);
  69         EBUG_ON(lru_pos_time(k->k.p) != time);
  70         EBUG_ON(k->k.p.offset != dev_bucket);
  71
  72         bch2_trans_iter_init(trans, &iter, BTREE_ID_lru,
  73                              k->k.p, BTREE_ITER_INTENT);
  74
  75         ret = bch2_btree_iter_traverse(&iter) ?:
  76                 bch2_trans_update(trans, &iter, k, 0);
  77         bch2_trans_iter_exit(trans, &iter);
  78         return ret;
  79 }
  80
  81 int bch2_lru_del(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
  82 {
  83         return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_deleted);
  84 }
  85
  86 int bch2_lru_set(struct btree_trans *trans, u16 lru_id, u64 dev_bucket, u64 time)
  87 {
  88         return __bch2_lru_set(trans, lru_id, dev_bucket, time, KEY_TYPE_set);
  89 }
  90
  91 int bch2_lru_change(struct btree_trans *trans,
  92                     u16 lru_id, u64 dev_bucket,
  93                     u64 old_time, u64 new_time)
  94 {
  95         if (old_time == new_time)
  96                 return 0;
  97
  98         return  bch2_lru_del(trans, lru_id, dev_bucket, old_time) ?:
  99                 bch2_lru_set(trans, lru_id, dev_bucket, new_time);
 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         struct bpos alloc_pos = u64_to_bucket(lru_k.k->p.offset);
 114         int ret;
 115
 116         if (fsck_err_on(!bch2_dev_bucket_exists(c, alloc_pos), c,
 117                         "lru key points to nonexistent device:bucket %llu:%llu",
 118                         alloc_pos.inode, alloc_pos.offset))
 119                 return bch2_btree_delete_at(trans, lru_iter, 0);
 120
 121         bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc, alloc_pos, 0);
 122         k = bch2_btree_iter_peek_slot(&iter);
 123         ret = bkey_err(k);
 124         if (ret)
 125                 goto err;
 126
 127         a = bch2_alloc_to_v4(k, &a_convert);
 128
 129         if (fsck_err_on(lru_k.k->type != KEY_TYPE_set ||
 130                         a->data_type != BCH_DATA_cached ||
 131                         a->io_time[READ] != lru_pos_time(lru_k.k->p), c,
 132                         "incorrect lru entry (time %llu) %s\n"
 133                         "  for %s",
 134                         lru_pos_time(lru_k.k->p),
 135                         (bch2_bkey_val_to_text(&buf1, c, lru_k), buf1.buf),
 136                         (bch2_bkey_val_to_text(&buf2, c, k), buf2.buf))) {
 137                 ret = bch2_btree_delete_at(trans, lru_iter, 0);
 138                 if (ret)
 139                         goto err;
 140         }
 141 err:
 142 fsck_err:
 143         bch2_trans_iter_exit(trans, &iter);
 144         printbuf_exit(&buf2);
 145         printbuf_exit(&buf1);
 146         return ret;
 147 }
 148
 149 int bch2_check_lrus(struct bch_fs *c)
 150 {
 151         struct btree_trans trans;
 152         struct btree_iter iter;
 153         struct bkey_s_c k;
 154         int ret = 0;
 155
 156         bch2_trans_init(&trans, c, 0, 0);
 157
 158         ret = for_each_btree_key_commit(&trans, iter,
 159                         BTREE_ID_lru, POS_MIN, BTREE_ITER_PREFETCH, k,
 160                         NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
 161                 bch2_check_lru_key(&trans, &iter, k));
 162
 163         bch2_trans_exit(&trans);
 164         return ret;
 165
 166 }