1 // SPDX-License-Identifier: GPL-2.0
3 * Code for moving data off a device.
8 #include "btree_update.h"
9 #include "btree_update_interior.h"
21 static int drop_dev_ptrs(struct bch_fs *c, struct bkey_s k,
22 unsigned dev_idx, int flags, bool metadata)
24 unsigned replicas = metadata ? c->opts.metadata_replicas : c->opts.data_replicas;
25 unsigned lost = metadata ? BCH_FORCE_IF_METADATA_LOST : BCH_FORCE_IF_DATA_LOST;
26 unsigned degraded = metadata ? BCH_FORCE_IF_METADATA_DEGRADED : BCH_FORCE_IF_DATA_DEGRADED;
29 bch2_bkey_drop_device(k, dev_idx);
31 nr_good = bch2_bkey_durability(c, k.s_c);
32 if ((!nr_good && !(flags & lost)) ||
33 (nr_good < replicas && !(flags & degraded)))
39 static int bch2_dev_usrdata_drop_key(struct btree_trans *trans,
40 struct btree_iter *iter,
45 struct bch_fs *c = trans->c;
49 if (!bch2_bkey_has_device(k, dev_idx))
52 n = bch2_trans_kmalloc(trans, bkey_bytes(k.k));
53 ret = PTR_ERR_OR_ZERO(n);
57 bkey_reassemble(n, k);
59 ret = drop_dev_ptrs(c, bkey_i_to_s(n), dev_idx, flags, false);
64 * If the new extent no longer has any pointers, bch2_extent_normalize()
65 * will do the appropriate thing with it (turning it into a
66 * KEY_TYPE_error key, or just a discard if it was a cached extent)
68 bch2_extent_normalize(c, bkey_i_to_s(n));
71 * Since we're not inserting through an extent iterator
72 * (BTREE_ITER_ALL_SNAPSHOTS iterators aren't extent iterators),
73 * we aren't using the extent overwrite path to delete, we're
74 * just using the normal key deletion path:
76 if (bkey_deleted(&n->k))
79 return bch2_trans_update(trans, iter, n, BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
82 static int bch2_dev_usrdata_drop(struct bch_fs *c, unsigned dev_idx, int flags)
84 struct btree_trans trans;
85 struct btree_iter iter;
90 bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
92 for (id = 0; id < BTREE_ID_NR; id++) {
93 if (!btree_type_has_ptrs(id))
96 ret = for_each_btree_key_commit(&trans, iter, id, POS_MIN,
97 BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS, k,
98 NULL, NULL, BTREE_INSERT_NOFAIL,
99 bch2_dev_usrdata_drop_key(&trans, &iter, k, dev_idx, flags));
104 bch2_trans_exit(&trans);
109 static int bch2_dev_metadata_drop(struct bch_fs *c, unsigned dev_idx, int flags)
111 struct btree_trans trans;
112 struct btree_iter iter;
119 /* don't handle this yet: */
120 if (flags & BCH_FORCE_IF_METADATA_LOST)
123 bch2_bkey_buf_init(&k);
124 bch2_trans_init(&trans, c, 0, 0);
125 closure_init_stack(&cl);
127 for (id = 0; id < BTREE_ID_NR; id++) {
128 bch2_trans_node_iter_init(&trans, &iter, id, POS_MIN, 0, 0,
129 BTREE_ITER_PREFETCH);
132 while (bch2_trans_begin(&trans),
133 (b = bch2_btree_iter_peek_node(&iter)) &&
134 !(ret = PTR_ERR_OR_ZERO(b))) {
135 if (!bch2_bkey_has_device(bkey_i_to_s_c(&b->key),
139 bch2_bkey_buf_copy(&k, c, &b->key);
141 ret = drop_dev_ptrs(c, bkey_i_to_s(k.k),
142 dev_idx, flags, true);
144 bch_err(c, "Cannot drop device without losing data");
148 ret = bch2_btree_node_update_key(&trans, &iter, b, k.k, false);
149 if (bch2_err_matches(ret, BCH_ERR_transaction_restart)) {
155 bch_err(c, "Error updating btree node key: %s",
160 bch2_btree_iter_next_node(&iter);
162 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
165 bch2_trans_iter_exit(&trans, &iter);
171 bch2_btree_interior_updates_flush(c);
174 bch2_trans_exit(&trans);
175 bch2_bkey_buf_exit(&k, c);
177 BUG_ON(bch2_err_matches(ret, BCH_ERR_transaction_restart));
182 int bch2_dev_data_drop(struct bch_fs *c, unsigned dev_idx, int flags)
184 return bch2_dev_usrdata_drop(c, dev_idx, flags) ?:
185 bch2_dev_metadata_drop(c, dev_idx, flags);