1 // SPDX-License-Identifier: GPL-2.0
3 #include "bkey_on_stack.h"
4 #include "btree_update.h"
5 #include "btree_update_interior.h"
9 #include "extent_update.h"
12 * This counts the number of iterators to the alloc & ec btrees we'll need
13 * inserting/removing this extent:
15 static unsigned bch2_bkey_nr_alloc_ptrs(struct bkey_s_c k)
17 struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
18 const union bch_extent_entry *entry;
21 bkey_extent_entry_for_each(ptrs, entry) {
22 switch (__extent_entry_type(entry)) {
23 case BCH_EXTENT_ENTRY_ptr:
24 case BCH_EXTENT_ENTRY_stripe_ptr:
32 static int count_iters_for_insert(struct btree_trans *trans,
39 int ret = 0, ret2 = 0;
41 if (*nr_iters >= max_iters) {
42 *end = bpos_min(*end, k.k->p);
48 case KEY_TYPE_reflink_v:
49 *nr_iters += bch2_bkey_nr_alloc_ptrs(k);
51 if (*nr_iters >= max_iters) {
52 *end = bpos_min(*end, k.k->p);
57 case KEY_TYPE_reflink_p: {
58 struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
59 u64 idx = le64_to_cpu(p.v->idx);
60 unsigned sectors = bpos_min(*end, p.k->p).offset -
61 bkey_start_offset(p.k);
62 struct btree_iter *iter;
65 for_each_btree_key(trans, iter,
66 BTREE_ID_REFLINK, POS(0, idx + offset),
67 BTREE_ITER_SLOTS, r_k, ret2) {
68 if (bkey_cmp(bkey_start_pos(r_k.k),
69 POS(0, idx + sectors)) >= 0)
72 /* extent_update_to_keys(), for the reflink_v update */
75 *nr_iters += 1 + bch2_bkey_nr_alloc_ptrs(r_k);
77 if (*nr_iters >= max_iters) {
78 struct bpos pos = bkey_start_pos(k.k);
79 pos.offset += min_t(u64, k.k->size,
80 r_k.k->p.offset - idx);
82 *end = bpos_min(*end, pos);
88 bch2_trans_iter_put(trans, iter);
96 #define EXTENT_ITERS_MAX (BTREE_ITER_MAX / 3)
98 int bch2_extent_atomic_end(struct btree_iter *iter,
99 struct bkey_i *insert,
102 struct btree_trans *trans = iter->trans;
104 struct btree_node_iter node_iter;
105 struct bkey_packed *_k;
106 unsigned nr_iters = 0;
109 ret = bch2_btree_iter_traverse(iter);
114 node_iter = iter->l[0].iter;
116 BUG_ON(bkey_cmp(b->data->min_key, POS_MIN) &&
117 bkey_cmp(bkey_start_pos(&insert->k),
118 bkey_predecessor(b->data->min_key)) < 0);
120 *end = bpos_min(insert->k.p, b->key.k.p);
122 /* extent_update_to_keys(): */
125 ret = count_iters_for_insert(trans, bkey_i_to_s_c(insert), 0, end,
126 &nr_iters, EXTENT_ITERS_MAX / 2);
130 while ((_k = bch2_btree_node_iter_peek(&node_iter, b))) {
131 struct bkey unpacked;
132 struct bkey_s_c k = bkey_disassemble(b, _k, &unpacked);
135 if (bkey_cmp(bkey_start_pos(k.k), *end) >= 0)
138 if (bkey_cmp(bkey_start_pos(&insert->k),
139 bkey_start_pos(k.k)) > 0)
140 offset = bkey_start_offset(&insert->k) -
141 bkey_start_offset(k.k);
143 /* extent_handle_overwrites(): */
144 switch (bch2_extent_overlap(&insert->k, k.k)) {
145 case BCH_EXTENT_OVERLAP_ALL:
146 case BCH_EXTENT_OVERLAP_FRONT:
149 case BCH_EXTENT_OVERLAP_BACK:
150 case BCH_EXTENT_OVERLAP_MIDDLE:
155 ret = count_iters_for_insert(trans, k, offset, end,
156 &nr_iters, EXTENT_ITERS_MAX);
160 bch2_btree_node_iter_advance(&node_iter, b);
163 return ret < 0 ? ret : 0;
166 int bch2_extent_trim_atomic(struct bkey_i *k, struct btree_iter *iter)
171 ret = bch2_extent_atomic_end(iter, k, &end);
175 bch2_cut_back(end, k);
179 int bch2_extent_is_atomic(struct bkey_i *k, struct btree_iter *iter)
184 ret = bch2_extent_atomic_end(iter, k, &end);
188 return !bkey_cmp(end, k->k.p);
191 enum btree_insert_ret
192 bch2_extent_can_insert(struct btree_trans *trans,
193 struct btree_iter *iter,
194 struct bkey_i *insert)
196 struct btree_iter_level *l = &iter->l[0];
197 struct btree_node_iter node_iter = l->iter;
198 struct bkey_packed *_k;
200 struct bkey unpacked;
203 _k = bch2_btree_node_iter_peek(&node_iter, l->b);
205 return BTREE_INSERT_OK;
207 k = bkey_disassemble(l->b, _k, &unpacked);
209 /* Check if we're splitting a compressed extent: */
211 if (bkey_cmp(bkey_start_pos(&insert->k), bkey_start_pos(k.k)) > 0 &&
212 bkey_cmp(insert->k.p, k.k->p) < 0 &&
213 (sectors = bch2_bkey_sectors_compressed(k))) {
214 int flags = trans->flags & BTREE_INSERT_NOFAIL
215 ? BCH_DISK_RESERVATION_NOFAIL : 0;
217 switch (bch2_disk_reservation_add(trans->c, trans->disk_res,
222 return BTREE_INSERT_ENOSPC;
228 return BTREE_INSERT_OK;