2017-03-17 06:18:50 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
|
|
|
/*
|
|
|
|
* Code for moving data off a device.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "bcachefs.h"
|
2020-12-17 20:08:58 +00:00
|
|
|
#include "bkey_buf.h"
|
2017-03-17 06:18:50 +00:00
|
|
|
#include "btree_update.h"
|
2019-01-21 20:32:13 +00:00
|
|
|
#include "btree_update_interior.h"
|
2017-03-17 06:18:50 +00:00
|
|
|
#include "buckets.h"
|
2022-07-18 23:42:58 +00:00
|
|
|
#include "errcode.h"
|
2017-03-17 06:18:50 +00:00
|
|
|
#include "extents.h"
|
|
|
|
#include "io.h"
|
|
|
|
#include "journal.h"
|
|
|
|
#include "keylist.h"
|
|
|
|
#include "migrate.h"
|
|
|
|
#include "move.h"
|
|
|
|
#include "replicas.h"
|
|
|
|
#include "super-io.h"
|
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
static int drop_dev_ptrs(struct bch_fs *c, struct bkey_s k,
|
2017-03-17 06:18:50 +00:00
|
|
|
unsigned dev_idx, int flags, bool metadata)
|
|
|
|
{
|
|
|
|
unsigned replicas = metadata ? c->opts.metadata_replicas : c->opts.data_replicas;
|
|
|
|
unsigned lost = metadata ? BCH_FORCE_IF_METADATA_LOST : BCH_FORCE_IF_DATA_LOST;
|
|
|
|
unsigned degraded = metadata ? BCH_FORCE_IF_METADATA_DEGRADED : BCH_FORCE_IF_DATA_DEGRADED;
|
|
|
|
unsigned nr_good;
|
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
bch2_bkey_drop_device(k, dev_idx);
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
nr_good = bch2_bkey_durability(c, k.s_c);
|
2017-03-17 06:18:50 +00:00
|
|
|
if ((!nr_good && !(flags & lost)) ||
|
|
|
|
(nr_good < replicas && !(flags & degraded)))
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2022-07-17 04:31:40 +00:00
|
|
|
static int bch2_dev_usrdata_drop_key(struct btree_trans *trans,
|
|
|
|
struct btree_iter *iter,
|
|
|
|
struct bkey_s_c k,
|
|
|
|
unsigned dev_idx,
|
|
|
|
int flags)
|
|
|
|
{
|
|
|
|
struct bch_fs *c = trans->c;
|
|
|
|
struct bkey_i *n;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (!bch2_bkey_has_device(k, dev_idx))
|
|
|
|
return 0;
|
|
|
|
|
2022-11-24 03:13:19 +00:00
|
|
|
n = bch2_bkey_make_mut(trans, k);
|
2022-07-17 04:31:40 +00:00
|
|
|
ret = PTR_ERR_OR_ZERO(n);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
ret = drop_dev_ptrs(c, bkey_i_to_s(n), dev_idx, flags, false);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the new extent no longer has any pointers, bch2_extent_normalize()
|
|
|
|
* will do the appropriate thing with it (turning it into a
|
|
|
|
* KEY_TYPE_error key, or just a discard if it was a cached extent)
|
|
|
|
*/
|
|
|
|
bch2_extent_normalize(c, bkey_i_to_s(n));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Since we're not inserting through an extent iterator
|
|
|
|
* (BTREE_ITER_ALL_SNAPSHOTS iterators aren't extent iterators),
|
|
|
|
* we aren't using the extent overwrite path to delete, we're
|
|
|
|
* just using the normal key deletion path:
|
|
|
|
*/
|
|
|
|
if (bkey_deleted(&n->k))
|
|
|
|
n->k.size = 0;
|
|
|
|
|
|
|
|
return bch2_trans_update(trans, iter, n, BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int bch2_dev_usrdata_drop(struct bch_fs *c, unsigned dev_idx, int flags)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-03-14 00:49:16 +00:00
|
|
|
struct btree_trans trans;
|
2021-08-30 19:18:31 +00:00
|
|
|
struct btree_iter iter;
|
2017-03-17 06:18:50 +00:00
|
|
|
struct bkey_s_c k;
|
2022-07-17 04:31:40 +00:00
|
|
|
enum btree_id id;
|
2017-03-17 06:18:50 +00:00
|
|
|
int ret = 0;
|
|
|
|
|
2019-05-15 14:54:43 +00:00
|
|
|
bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
|
2019-03-14 00:49:16 +00:00
|
|
|
|
2022-07-17 04:31:40 +00:00
|
|
|
for (id = 0; id < BTREE_ID_NR; id++) {
|
|
|
|
if (!btree_type_has_ptrs(id))
|
2017-03-17 06:18:50 +00:00
|
|
|
continue;
|
|
|
|
|
2022-07-17 04:31:40 +00:00
|
|
|
ret = for_each_btree_key_commit(&trans, iter, id, POS_MIN,
|
|
|
|
BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS, k,
|
|
|
|
NULL, NULL, BTREE_INSERT_NOFAIL,
|
|
|
|
bch2_dev_usrdata_drop_key(&trans, &iter, k, dev_idx, flags));
|
2017-03-17 06:18:50 +00:00
|
|
|
if (ret)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2021-10-19 19:08:00 +00:00
|
|
|
bch2_trans_exit(&trans);
|
2017-03-17 06:18:50 +00:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int bch2_dev_metadata_drop(struct bch_fs *c, unsigned dev_idx, int flags)
|
|
|
|
{
|
2019-03-25 19:10:15 +00:00
|
|
|
struct btree_trans trans;
|
2021-08-30 19:18:31 +00:00
|
|
|
struct btree_iter iter;
|
2017-03-17 06:18:50 +00:00
|
|
|
struct closure cl;
|
|
|
|
struct btree *b;
|
2020-12-17 20:08:58 +00:00
|
|
|
struct bkey_buf k;
|
2017-03-17 06:18:50 +00:00
|
|
|
unsigned id;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* don't handle this yet: */
|
|
|
|
if (flags & BCH_FORCE_IF_METADATA_LOST)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2020-12-17 20:08:58 +00:00
|
|
|
bch2_bkey_buf_init(&k);
|
2019-05-15 14:54:43 +00:00
|
|
|
bch2_trans_init(&trans, c, 0, 0);
|
2017-03-17 06:18:50 +00:00
|
|
|
closure_init_stack(&cl);
|
|
|
|
|
|
|
|
for (id = 0; id < BTREE_ID_NR; id++) {
|
2021-10-07 18:59:00 +00:00
|
|
|
bch2_trans_node_iter_init(&trans, &iter, id, POS_MIN, 0, 0,
|
|
|
|
BTREE_ITER_PREFETCH);
|
2021-10-19 18:20:50 +00:00
|
|
|
retry:
|
2021-10-19 19:11:45 +00:00
|
|
|
ret = 0;
|
2021-10-07 18:59:00 +00:00
|
|
|
while (bch2_trans_begin(&trans),
|
2021-10-19 18:20:50 +00:00
|
|
|
(b = bch2_btree_iter_peek_node(&iter)) &&
|
|
|
|
!(ret = PTR_ERR_OR_ZERO(b))) {
|
2018-11-01 19:10:01 +00:00
|
|
|
if (!bch2_bkey_has_device(bkey_i_to_s_c(&b->key),
|
2020-01-04 03:38:14 +00:00
|
|
|
dev_idx))
|
2021-10-07 18:59:00 +00:00
|
|
|
goto next;
|
2020-01-04 03:38:14 +00:00
|
|
|
|
2020-12-17 20:08:58 +00:00
|
|
|
bch2_bkey_buf_copy(&k, c, &b->key);
|
2020-01-04 03:38:14 +00:00
|
|
|
|
2020-12-17 20:08:58 +00:00
|
|
|
ret = drop_dev_ptrs(c, bkey_i_to_s(k.k),
|
2020-01-04 03:38:14 +00:00
|
|
|
dev_idx, flags, true);
|
|
|
|
if (ret) {
|
|
|
|
bch_err(c, "Cannot drop device without losing data");
|
2021-03-20 00:29:11 +00:00
|
|
|
break;
|
2020-01-04 03:38:14 +00:00
|
|
|
}
|
|
|
|
|
2021-08-30 19:18:31 +00:00
|
|
|
ret = bch2_btree_node_update_key(&trans, &iter, b, k.k, false);
|
2022-07-18 03:06:38 +00:00
|
|
|
if (bch2_err_matches(ret, BCH_ERR_transaction_restart)) {
|
2021-03-20 00:29:11 +00:00
|
|
|
ret = 0;
|
2021-10-07 18:59:00 +00:00
|
|
|
continue;
|
2020-01-04 03:38:14 +00:00
|
|
|
}
|
2021-10-07 18:59:00 +00:00
|
|
|
|
2020-01-04 03:38:14 +00:00
|
|
|
if (ret) {
|
2022-07-18 23:42:58 +00:00
|
|
|
bch_err(c, "Error updating btree node key: %s",
|
|
|
|
bch2_err_str(ret));
|
2021-03-20 00:29:11 +00:00
|
|
|
break;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
2021-10-07 18:59:00 +00:00
|
|
|
next:
|
|
|
|
bch2_btree_iter_next_node(&iter);
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
2022-07-18 03:06:38 +00:00
|
|
|
if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
|
2021-10-19 18:20:50 +00:00
|
|
|
goto retry;
|
|
|
|
|
2021-08-30 19:18:31 +00:00
|
|
|
bch2_trans_iter_exit(&trans, &iter);
|
2021-03-20 00:29:11 +00:00
|
|
|
|
|
|
|
if (ret)
|
|
|
|
goto err;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2022-04-17 21:30:49 +00:00
|
|
|
bch2_btree_interior_updates_flush(c);
|
2017-03-17 06:18:50 +00:00
|
|
|
ret = 0;
|
2019-03-25 19:10:15 +00:00
|
|
|
err:
|
2021-10-19 19:08:00 +00:00
|
|
|
bch2_trans_exit(&trans);
|
2020-12-17 20:08:58 +00:00
|
|
|
bch2_bkey_buf_exit(&k, c);
|
2019-03-25 19:10:15 +00:00
|
|
|
|
2022-07-18 03:06:38 +00:00
|
|
|
BUG_ON(bch2_err_matches(ret, BCH_ERR_transaction_restart));
|
2017-03-17 06:18:50 +00:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int bch2_dev_data_drop(struct bch_fs *c, unsigned dev_idx, int flags)
|
|
|
|
{
|
|
|
|
return bch2_dev_usrdata_drop(c, dev_idx, flags) ?:
|
2020-01-04 03:38:14 +00:00
|
|
|
bch2_dev_metadata_drop(c, dev_idx, flags);
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|