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 int bch2_lru_invalid(const struct bch_fs *c, struct bkey_s_c k,
  12                      int rw, struct printbuf *err)
  13 {
  14         const struct bch_lru *lru = bkey_s_c_to_lru(k).v;
  15
  16         if (bkey_val_bytes(k.k) < sizeof(*lru)) {
  17                 prt_printf(err, "incorrect value size (%zu < %zu)",
  18                        bkey_val_bytes(k.k), sizeof(*lru));
  19                 return -EINVAL;
  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 int bch2_lru_delete(struct btree_trans *trans, u64 id, u64 idx, u64 time,
  34                     struct bkey_s_c orig_k)
  35 {
  36         struct btree_iter iter;
  37         struct bkey_s_c k;
  38         u64 existing_idx;
  39         struct printbuf buf = PRINTBUF;
  40         int ret = 0;
  41
  42         if (!time)
  43                 return 0;
  44
  45         bch2_trans_iter_init(trans, &iter, BTREE_ID_lru,
  46                              POS(id, time),
  47                              BTREE_ITER_INTENT|
  48                              BTREE_ITER_WITH_UPDATES);
  49         k = bch2_btree_iter_peek_slot(&iter);
  50         ret = bkey_err(k);
  51         if (ret)
  52                 goto err;
  53
  54         if (k.k->type != KEY_TYPE_lru) {
  55                 bch2_bkey_val_to_text(&buf, trans->c, orig_k);
  56                 bch2_trans_inconsistent(trans,
  57                         "pointer to nonexistent lru %llu:%llu\n%s",
  58                         id, time, buf.buf);
  59                 ret = -EIO;
  60                 goto err;
  61         }
  62
  63         existing_idx = le64_to_cpu(bkey_s_c_to_lru(k).v->idx);
  64         if (existing_idx != idx) {
  65                 bch2_bkey_val_to_text(&buf, trans->c, orig_k);
  66                 bch2_trans_inconsistent(trans,
  67                         "lru %llu:%llu with wrong backpointer: got %llu, should be %llu\n%s",
  68                         id, time, existing_idx, idx, buf.buf);
  69                 ret = -EIO;
  70                 goto err;
  71         }
  72
  73         ret = bch2_btree_delete_at(trans, &iter, 0);
  74 err:
  75         bch2_trans_iter_exit(trans, &iter);
  76         printbuf_exit(&buf);
  77         return ret;
  78 }
  79
  80 int bch2_lru_set(struct btree_trans *trans, u64 lru_id, u64 idx, u64 *time)
  81 {
  82         struct btree_iter iter;
  83         struct bkey_s_c k;
  84         struct bkey_i_lru *lru;
  85         int ret = 0;
  86
  87         if (!*time)
  88                 return 0;
  89
  90         for_each_btree_key_norestart(trans, iter, BTREE_ID_lru,
  91                         POS(lru_id, *time),
  92                         BTREE_ITER_SLOTS|
  93                         BTREE_ITER_INTENT|
  94                         BTREE_ITER_WITH_UPDATES, k, ret)
  95                 if (bkey_deleted(k.k))
  96                         break;
  97
  98         if (ret)
  99                 goto err;
 100
 101         BUG_ON(iter.pos.inode != lru_id);
 102         *time = iter.pos.offset;
 103
 104         lru = bch2_trans_kmalloc(trans, sizeof(*lru));
 105         ret = PTR_ERR_OR_ZERO(lru);
 106         if (ret)
 107                 goto err;
 108
 109         bkey_lru_init(&lru->k_i);
 110         lru->k.p        = iter.pos;
 111         lru->v.idx      = cpu_to_le64(idx);
 112
 113         ret = bch2_trans_update(trans, &iter, &lru->k_i, 0);
 114         if (ret)
 115                 goto err;
 116 err:
 117         bch2_trans_iter_exit(trans, &iter);
 118         return ret;
 119 }
 120
 121 int bch2_lru_change(struct btree_trans *trans, u64 id, u64 idx,
 122                     u64 old_time, u64 *new_time,
 123                     struct bkey_s_c k)
 124 {
 125         if (old_time == *new_time)
 126                 return 0;
 127
 128         return  bch2_lru_delete(trans, id, idx, old_time, k) ?:
 129                 bch2_lru_set(trans, id, idx, new_time);
 130 }
 131
 132 static int bch2_check_lru_key(struct btree_trans *trans,
 133                               struct btree_iter *lru_iter,
 134                               struct bkey_s_c lru_k)
 135 {
 136         struct bch_fs *c = trans->c;
 137         struct btree_iter iter;
 138         struct bkey_s_c k;
 139         struct bch_alloc_v4 a;
 140         struct printbuf buf1 = PRINTBUF;
 141         struct printbuf buf2 = PRINTBUF;
 142         struct bpos alloc_pos;
 143         int ret;
 144
 145         alloc_pos = POS(lru_k.k->p.inode,
 146                         le64_to_cpu(bkey_s_c_to_lru(lru_k).v->idx));
 147
 148         if (fsck_err_on(!bch2_dev_bucket_exists(c, alloc_pos), c,
 149                         "lru key points to nonexistent device:bucket %llu:%llu",
 150                         alloc_pos.inode, alloc_pos.offset))
 151                 return bch2_btree_delete_at(trans, lru_iter, 0);
 152
 153         bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc, alloc_pos, 0);
 154         k = bch2_btree_iter_peek_slot(&iter);
 155         ret = bkey_err(k);
 156         if (ret)
 157                 goto err;
 158
 159         bch2_alloc_to_v4(k, &a);
 160
 161         if (fsck_err_on(a.data_type != BCH_DATA_cached ||
 162                         a.io_time[READ] != lru_k.k->p.offset, c,
 163                         "incorrect lru entry %s\n"
 164                         "  for %s",
 165                         (bch2_bkey_val_to_text(&buf1, c, lru_k), buf1.buf),
 166                         (bch2_bkey_val_to_text(&buf2, c, k), buf2.buf))) {
 167                 struct bkey_i *update =
 168                         bch2_trans_kmalloc(trans, sizeof(*update));
 169
 170                 ret = PTR_ERR_OR_ZERO(update);
 171                 if (ret)
 172                         goto err;
 173
 174                 bkey_init(&update->k);
 175                 update->k.p = lru_iter->pos;
 176
 177                 ret = bch2_trans_update(trans, lru_iter, update, 0);
 178                 if (ret)
 179                         goto err;
 180         }
 181 err:
 182 fsck_err:
 183         bch2_trans_iter_exit(trans, &iter);
 184         printbuf_exit(&buf2);
 185         printbuf_exit(&buf1);
 186         return ret;
 187 }
 188
 189 int bch2_check_lrus(struct bch_fs *c)
 190 {
 191         struct btree_trans trans;
 192         struct btree_iter iter;
 193         struct bkey_s_c k;
 194         int ret = 0;
 195
 196         bch2_trans_init(&trans, c, 0, 0);
 197
 198         ret = for_each_btree_key_commit(&trans, iter,
 199                         BTREE_ID_lru, POS_MIN, BTREE_ITER_PREFETCH, k,
 200                         NULL, NULL, BTREE_INSERT_NOFAIL|BTREE_INSERT_LAZY_RW,
 201                 bch2_check_lru_key(&trans, &iter, k));
 202
 203         bch2_trans_exit(&trans);
 204         return ret;
 205
 206 }