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                 pr_buf(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         pr_buf(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, bool initial)
 134 {
 135         struct bch_fs *c = trans->c;
 136         struct btree_iter iter;
 137         struct bkey_s_c lru_k, k;
 138         struct bch_alloc_v4 a;
 139         struct printbuf buf1 = PRINTBUF;
 140         struct printbuf buf2 = PRINTBUF;
 141         struct bpos alloc_pos;
 142         int ret;
 143
 144         lru_k = bch2_btree_iter_peek(lru_iter);
 145         if (!lru_k.k)
 146                 return 0;
 147
 148         ret = bkey_err(lru_k);
 149         if (ret)
 150                 return ret;
 151
 152         alloc_pos = POS(lru_k.k->p.inode,
 153                         le64_to_cpu(bkey_s_c_to_lru(lru_k).v->idx));
 154
 155         if (fsck_err_on(!bch2_dev_bucket_exists(c, alloc_pos), c,
 156                         "lru key points to nonexistent device:bucket %llu:%llu",
 157                         alloc_pos.inode, alloc_pos.offset))
 158                 return bch2_btree_delete_at(trans, lru_iter, 0);
 159
 160         bch2_trans_iter_init(trans, &iter, BTREE_ID_alloc, alloc_pos, 0);
 161         k = bch2_btree_iter_peek_slot(&iter);
 162         ret = bkey_err(k);
 163         if (ret)
 164                 goto err;
 165
 166         bch2_alloc_to_v4(k, &a);
 167
 168         if (fsck_err_on(a.data_type != BCH_DATA_cached ||
 169                         a.io_time[READ] != lru_k.k->p.offset, c,
 170                         "incorrect lru entry %s\n"
 171                         "  for %s",
 172                         (bch2_bkey_val_to_text(&buf1, c, lru_k), buf1.buf),
 173                         (bch2_bkey_val_to_text(&buf2, c, k), buf2.buf))) {
 174                 struct bkey_i *update =
 175                         bch2_trans_kmalloc(trans, sizeof(*update));
 176
 177                 ret = PTR_ERR_OR_ZERO(update);
 178                 if (ret)
 179                         goto err;
 180
 181                 bkey_init(&update->k);
 182                 update->k.p = lru_iter->pos;
 183
 184                 ret = bch2_trans_update(trans, lru_iter, update, 0);
 185                 if (ret)
 186                         goto err;
 187         }
 188 err:
 189 fsck_err:
 190         bch2_trans_iter_exit(trans, &iter);
 191         printbuf_exit(&buf2);
 192         printbuf_exit(&buf1);
 193         return ret;
 194 }
 195
 196 int bch2_check_lrus(struct bch_fs *c, bool initial)
 197 {
 198         struct btree_trans trans;
 199         struct btree_iter iter;
 200         struct bkey_s_c k;
 201         int ret = 0;
 202
 203         bch2_trans_init(&trans, c, 0, 0);
 204
 205         for_each_btree_key(&trans, iter, BTREE_ID_lru, POS_MIN,
 206                            BTREE_ITER_PREFETCH, k, ret) {
 207                 ret = __bch2_trans_do(&trans, NULL, NULL,
 208                                       BTREE_INSERT_NOFAIL|
 209                                       BTREE_INSERT_LAZY_RW,
 210                         bch2_check_lru_key(&trans, &iter, initial));
 211                 if (ret)
 212                         break;
 213         }
 214         bch2_trans_iter_exit(&trans, &iter);
 215
 216         bch2_trans_exit(&trans);
 217         return ret;
 218
 219 }