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