git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/migrate.c

   1 // SPDX-License-Identifier: GPL-2.0
   2 /*
   3  * Code for moving data off a device.
   4  */
   5
   6 #include "bcachefs.h"
   7 #include "bkey_buf.h"
   8 #include "btree_update.h"
   9 #include "btree_update_interior.h"
  10 #include "buckets.h"
  11 #include "extents.h"
  12 #include "io.h"
  13 #include "journal.h"
  14 #include "keylist.h"
  15 #include "migrate.h"
  16 #include "move.h"
  17 #include "replicas.h"
  18 #include "super-io.h"
  19
  20 static int drop_dev_ptrs(struct bch_fs *c, struct bkey_s k,
  21                          unsigned dev_idx, int flags, bool metadata)
  22 {
  23         unsigned replicas = metadata ? c->opts.metadata_replicas : c->opts.data_replicas;
  24         unsigned lost = metadata ? BCH_FORCE_IF_METADATA_LOST : BCH_FORCE_IF_DATA_LOST;
  25         unsigned degraded = metadata ? BCH_FORCE_IF_METADATA_DEGRADED : BCH_FORCE_IF_DATA_DEGRADED;
  26         unsigned nr_good;
  27
  28         bch2_bkey_drop_device(k, dev_idx);
  29
  30         nr_good = bch2_bkey_durability(c, k.s_c);
  31         if ((!nr_good && !(flags & lost)) ||
  32             (nr_good < replicas && !(flags & degraded)))
  33                 return -EINVAL;
  34
  35         return 0;
  36 }
  37
  38 static int __bch2_dev_usrdata_drop(struct bch_fs *c, unsigned dev_idx, int flags,
  39                                    enum btree_id btree_id)
  40 {
  41         struct btree_trans trans;
  42         struct btree_iter *iter;
  43         struct bkey_s_c k;
  44         struct bkey_buf sk;
  45         int ret = 0;
  46
  47         bch2_bkey_buf_init(&sk);
  48         bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
  49
  50         iter = bch2_trans_get_iter(&trans, btree_id, POS_MIN,
  51                                    BTREE_ITER_PREFETCH);
  52
  53         while ((k = bch2_btree_iter_peek(iter)).k &&
  54                !(ret = bkey_err(k))) {
  55                 if (!bch2_bkey_has_device(k, dev_idx)) {
  56                         bch2_btree_iter_advance(iter);
  57                         continue;
  58                 }
  59
  60                 bch2_bkey_buf_reassemble(&sk, c, k);
  61
  62                 ret = drop_dev_ptrs(c, bkey_i_to_s(sk.k),
  63                                     dev_idx, flags, false);
  64                 if (ret)
  65                         break;
  66
  67                 /*
  68                  * If the new extent no longer has any pointers, bch2_extent_normalize()
  69                  * will do the appropriate thing with it (turning it into a
  70                  * KEY_TYPE_error key, or just a discard if it was a cached extent)
  71                  */
  72                 bch2_extent_normalize(c, bkey_i_to_s(sk.k));
  73
  74                 bch2_btree_iter_set_pos(iter, bkey_start_pos(&sk.k->k));
  75
  76                 ret   = bch2_trans_update(&trans, iter, sk.k, 0) ?:
  77                         bch2_trans_commit(&trans, NULL, NULL,
  78                                         BTREE_INSERT_NOFAIL);
  79
  80                 /*
  81                  * don't want to leave ret == -EINTR, since if we raced and
  82                  * something else overwrote the key we could spuriously return
  83                  * -EINTR below:
  84                  */
  85                 if (ret == -EINTR)
  86                         ret = 0;
  87                 if (ret)
  88                         break;
  89         }
  90         bch2_trans_iter_put(&trans, iter);
  91
  92         ret = bch2_trans_exit(&trans) ?: ret;
  93         bch2_bkey_buf_exit(&sk, c);
  94
  95         BUG_ON(ret == -EINTR);
  96
  97         return ret;
  98 }
  99
 100 static int bch2_dev_usrdata_drop(struct bch_fs *c, unsigned dev_idx, int flags)
 101 {
 102         return  __bch2_dev_usrdata_drop(c, dev_idx, flags, BTREE_ID_extents) ?:
 103                 __bch2_dev_usrdata_drop(c, dev_idx, flags, BTREE_ID_reflink);
 104 }
 105
 106 static int bch2_dev_metadata_drop(struct bch_fs *c, unsigned dev_idx, int flags)
 107 {
 108         struct btree_trans trans;
 109         struct btree_iter *iter;
 110         struct closure cl;
 111         struct btree *b;
 112         struct bkey_buf k;
 113         unsigned id;
 114         int ret;
 115
 116         /* don't handle this yet: */
 117         if (flags & BCH_FORCE_IF_METADATA_LOST)
 118                 return -EINVAL;
 119
 120         bch2_bkey_buf_init(&k);
 121         bch2_trans_init(&trans, c, 0, 0);
 122         closure_init_stack(&cl);
 123
 124         for (id = 0; id < BTREE_ID_NR; id++) {
 125                 for_each_btree_node(&trans, iter, id, POS_MIN,
 126                                     BTREE_ITER_PREFETCH, b) {
 127 retry:
 128                         if (!bch2_bkey_has_device(bkey_i_to_s_c(&b->key),
 129                                                   dev_idx))
 130                                 continue;
 131
 132                         bch2_bkey_buf_copy(&k, c, &b->key);
 133
 134                         ret = drop_dev_ptrs(c, bkey_i_to_s(k.k),
 135                                             dev_idx, flags, true);
 136                         if (ret) {
 137                                 bch_err(c, "Cannot drop device without losing data");
 138                                 break;
 139                         }
 140
 141                         ret = bch2_btree_node_update_key(c, iter, b, k.k);
 142                         if (ret == -EINTR) {
 143                                 b = bch2_btree_iter_peek_node(iter);
 144                                 ret = 0;
 145                                 goto retry;
 146                         }
 147                         if (ret) {
 148                                 bch_err(c, "Error updating btree node key: %i", ret);
 149                                 break;
 150                         }
 151                 }
 152                 bch2_trans_iter_free(&trans, iter);
 153
 154                 if (ret)
 155                         goto err;
 156         }
 157
 158         /* flush relevant btree updates */
 159         closure_wait_event(&c->btree_interior_update_wait,
 160                            !bch2_btree_interior_updates_nr_pending(c));
 161
 162         ret = 0;
 163 err:
 164         ret = bch2_trans_exit(&trans) ?: ret;
 165         bch2_bkey_buf_exit(&k, c);
 166
 167         BUG_ON(ret == -EINTR);
 168
 169         return ret;
 170 }
 171
 172 int bch2_dev_data_drop(struct bch_fs *c, unsigned dev_idx, int flags)
 173 {
 174         return bch2_dev_usrdata_drop(c, dev_idx, flags) ?:
 175                 bch2_dev_metadata_drop(c, dev_idx, flags);
 176 }