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"
20 static int drop_dev_ptrs(struct bch_fs *c, struct bkey_s k,
21 unsigned dev_idx, int flags, bool metadata)
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;
28 bch2_bkey_drop_device(k, dev_idx);
30 nr_good = bch2_bkey_durability(c, k.s_c);
31 if ((!nr_good && !(flags & lost)) ||
32 (nr_good < replicas && !(flags & degraded)))
38 static int __bch2_dev_usrdata_drop(struct bch_fs *c, unsigned dev_idx, int flags,
39 enum btree_id btree_id)
41 struct btree_trans trans;
42 struct btree_iter iter;
47 bch2_bkey_buf_init(&sk);
48 bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
50 bch2_trans_iter_init(&trans, &iter, btree_id, POS_MIN,
52 BTREE_ITER_ALL_SNAPSHOTS);
54 while ((bch2_trans_begin(&trans),
55 (k = bch2_btree_iter_peek(&iter)).k) &&
56 !(ret = bkey_err(k))) {
57 if (!bch2_bkey_has_device(k, dev_idx)) {
58 bch2_btree_iter_advance(&iter);
62 bch2_bkey_buf_reassemble(&sk, c, k);
64 ret = drop_dev_ptrs(c, bkey_i_to_s(sk.k),
65 dev_idx, flags, false);
70 * If the new extent no longer has any pointers, bch2_extent_normalize()
71 * will do the appropriate thing with it (turning it into a
72 * KEY_TYPE_error key, or just a discard if it was a cached extent)
74 bch2_extent_normalize(c, bkey_i_to_s(sk.k));
77 * Since we're not inserting through an extent iterator
78 * (BTREE_ITER_ALL_SNAPSHOTS iterators aren't extent iterators),
79 * we aren't using the extent overwrite path to delete, we're
80 * just using the normal key deletion path:
82 if (bkey_deleted(&sk.k->k))
85 ret = bch2_btree_iter_traverse(&iter) ?:
86 bch2_trans_update(&trans, &iter, sk.k,
87 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE) ?:
88 bch2_trans_commit(&trans, NULL, NULL,
92 * don't want to leave ret == -EINTR, since if we raced and
93 * something else overwrote the key we could spuriously return
101 bch2_trans_iter_exit(&trans, &iter);
103 bch2_trans_exit(&trans);
104 bch2_bkey_buf_exit(&sk, c);
106 BUG_ON(ret == -EINTR);
111 static int bch2_dev_usrdata_drop(struct bch_fs *c, unsigned dev_idx, int flags)
113 return __bch2_dev_usrdata_drop(c, dev_idx, flags, BTREE_ID_extents) ?:
114 __bch2_dev_usrdata_drop(c, dev_idx, flags, BTREE_ID_reflink);
117 static int bch2_dev_metadata_drop(struct bch_fs *c, unsigned dev_idx, int flags)
119 struct btree_trans trans;
120 struct btree_iter iter;
127 /* don't handle this yet: */
128 if (flags & BCH_FORCE_IF_METADATA_LOST)
131 bch2_bkey_buf_init(&k);
132 bch2_trans_init(&trans, c, 0, 0);
133 closure_init_stack(&cl);
135 for (id = 0; id < BTREE_ID_NR; id++) {
136 bch2_trans_node_iter_init(&trans, &iter, id, POS_MIN, 0, 0,
137 BTREE_ITER_PREFETCH);
140 while (bch2_trans_begin(&trans),
141 (b = bch2_btree_iter_peek_node(&iter)) &&
142 !(ret = PTR_ERR_OR_ZERO(b))) {
143 if (!bch2_bkey_has_device(bkey_i_to_s_c(&b->key),
147 bch2_bkey_buf_copy(&k, c, &b->key);
149 ret = drop_dev_ptrs(c, bkey_i_to_s(k.k),
150 dev_idx, flags, true);
152 bch_err(c, "Cannot drop device without losing data");
156 ret = bch2_btree_node_update_key(&trans, &iter, b, k.k, false);
163 bch_err(c, "Error updating btree node key: %i", ret);
167 bch2_btree_iter_next_node(&iter);
172 bch2_trans_iter_exit(&trans, &iter);
178 /* flush relevant btree updates */
179 closure_wait_event(&c->btree_interior_update_wait,
180 !bch2_btree_interior_updates_nr_pending(c));
184 bch2_trans_exit(&trans);
185 bch2_bkey_buf_exit(&k, c);
187 BUG_ON(ret == -EINTR);
192 int bch2_dev_data_drop(struct bch_fs *c, unsigned dev_idx, int flags)
194 return bch2_dev_usrdata_drop(c, dev_idx, flags) ?:
195 bch2_dev_metadata_drop(c, dev_idx, flags);