1 // SPDX-License-Identifier: GPL-2.0
3 * Code for moving data off a device.
7 #include "bkey_on_stack.h"
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;
44 struct bkey_on_stack sk;
47 bkey_on_stack_init(&sk);
48 bch2_trans_init(&trans, c, BTREE_ITER_MAX, 0);
50 iter = bch2_trans_get_iter(&trans, btree_id, POS_MIN,
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_next(iter);
60 bkey_on_stack_reassemble(&sk, c, k);
62 ret = drop_dev_ptrs(c, bkey_i_to_s(sk.k),
63 dev_idx, flags, false);
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)
72 bch2_extent_normalize(c, bkey_i_to_s(sk.k));
74 bch2_btree_iter_set_pos(iter, bkey_start_pos(&sk.k->k));
76 bch2_trans_update(&trans, iter, sk.k, 0);
78 ret = bch2_trans_commit(&trans, NULL, NULL,
82 * don't want to leave ret == -EINTR, since if we raced and
83 * something else overwrote the key we could spuriously return
92 ret = bch2_trans_exit(&trans) ?: ret;
93 bkey_on_stack_exit(&sk, c);
95 BUG_ON(ret == -EINTR);
100 static int bch2_dev_usrdata_drop(struct bch_fs *c, unsigned dev_idx, int flags)
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);
106 static int bch2_dev_metadata_drop(struct bch_fs *c, unsigned dev_idx, int flags)
108 struct btree_trans trans;
109 struct btree_iter *iter;
115 /* don't handle this yet: */
116 if (flags & BCH_FORCE_IF_METADATA_LOST)
119 bch2_trans_init(&trans, c, 0, 0);
120 closure_init_stack(&cl);
122 for (id = 0; id < BTREE_ID_NR; id++) {
123 for_each_btree_node(&trans, iter, id, POS_MIN,
124 BTREE_ITER_PREFETCH, b) {
125 __BKEY_PADDED(k, BKEY_BTREE_PTR_VAL_U64s_MAX) tmp;
127 if (!bch2_bkey_has_device(bkey_i_to_s_c(&b->key),
131 bkey_copy(&tmp.k, &b->key);
133 ret = drop_dev_ptrs(c, bkey_i_to_s(&tmp.k),
134 dev_idx, flags, true);
136 bch_err(c, "Cannot drop device without losing data");
140 ret = bch2_btree_node_update_key(c, iter, b, &tmp.k);
142 b = bch2_btree_iter_peek_node(iter);
146 bch_err(c, "Error updating btree node key: %i", ret);
150 bch2_trans_iter_free(&trans, iter);
153 /* flush relevant btree updates */
154 closure_wait_event(&c->btree_interior_update_wait,
155 !bch2_btree_interior_updates_nr_pending(c));
159 ret = bch2_trans_exit(&trans) ?: ret;
161 BUG_ON(ret == -EINTR);
166 int bch2_dev_data_drop(struct bch_fs *c, unsigned dev_idx, int flags)
168 return bch2_dev_usrdata_drop(c, dev_idx, flags) ?:
169 bch2_dev_metadata_drop(c, dev_idx, flags);