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