Commit | Line | Data |
---|---|---|
1c6fdbd8 KO |
1 | // SPDX-License-Identifier: GPL-2.0 |
2 | ||
3 | #include "bcachefs.h" | |
4 | #include "btree_update.h" | |
5 | #include "btree_update_interior.h" | |
36e916e1 | 6 | #include "btree_gc.h" |
1c6fdbd8 KO |
7 | #include "btree_io.h" |
8 | #include "btree_iter.h" | |
2ca88e5a | 9 | #include "btree_key_cache.h" |
1c6fdbd8 | 10 | #include "btree_locking.h" |
b35b1925 | 11 | #include "buckets.h" |
1c6fdbd8 | 12 | #include "debug.h" |
3636ed48 | 13 | #include "error.h" |
08c07fea | 14 | #include "extent_update.h" |
1c6fdbd8 KO |
15 | #include "journal.h" |
16 | #include "journal_reclaim.h" | |
17 | #include "keylist.h" | |
1d25849c | 18 | #include "replicas.h" |
1c6fdbd8 KO |
19 | #include "trace.h" |
20 | ||
b7ba66c8 | 21 | #include <linux/prefetch.h> |
1c6fdbd8 KO |
22 | #include <linux/sort.h> |
23 | ||
36e9d698 | 24 | static inline bool same_leaf_as_prev(struct btree_trans *trans, |
24326cd1 | 25 | struct btree_insert_entry *i) |
36e9d698 | 26 | { |
e3e464ac | 27 | return i != trans->updates2 && |
e62d65f2 | 28 | iter_l(i[0].iter)->b == iter_l(i[-1].iter)->b; |
36e9d698 KO |
29 | } |
30 | ||
9623ab27 KO |
31 | inline void bch2_btree_node_lock_for_insert(struct bch_fs *c, struct btree *b, |
32 | struct btree_iter *iter) | |
33 | { | |
34 | bch2_btree_node_lock_write(b, iter); | |
35 | ||
2ca88e5a KO |
36 | if (btree_iter_type(iter) == BTREE_ITER_CACHED) |
37 | return; | |
38 | ||
fdfab313 | 39 | if (unlikely(btree_node_just_written(b)) && |
9623ab27 KO |
40 | bch2_btree_post_write_cleanup(c, b)) |
41 | bch2_btree_iter_reinit_node(iter, b); | |
42 | ||
43 | /* | |
44 | * If the last bset has been written, or if it's gotten too big - start | |
45 | * a new bset to insert into: | |
46 | */ | |
47 | if (want_new_bset(c, b)) | |
48 | bch2_btree_init_next(c, b, iter); | |
49 | } | |
50 | ||
1c6fdbd8 KO |
51 | /* Inserting into a given leaf node (last stage of insert): */ |
52 | ||
53 | /* Handle overwrites and do insert, for non extents: */ | |
54 | bool bch2_btree_bset_insert_key(struct btree_iter *iter, | |
55 | struct btree *b, | |
56 | struct btree_node_iter *node_iter, | |
57 | struct bkey_i *insert) | |
58 | { | |
1c6fdbd8 | 59 | struct bkey_packed *k; |
fdf22400 | 60 | unsigned clobber_u64s = 0, new_u64s = 0; |
1c6fdbd8 KO |
61 | |
62 | EBUG_ON(btree_node_just_written(b)); | |
63 | EBUG_ON(bset_written(b, btree_bset_last(b))); | |
64 | EBUG_ON(bkey_deleted(&insert->k) && bkey_val_u64s(&insert->k)); | |
39fb2983 KO |
65 | EBUG_ON(bkey_cmp(insert->k.p, b->data->min_key) < 0); |
66 | EBUG_ON(bkey_cmp(insert->k.p, b->data->max_key) > 0); | |
e3e464ac KO |
67 | EBUG_ON(insert->k.u64s > |
68 | bch_btree_keys_u64s_remaining(iter->trans->c, b)); | |
69 | EBUG_ON(iter->flags & BTREE_ITER_IS_EXTENTS); | |
1c6fdbd8 KO |
70 | |
71 | k = bch2_btree_node_iter_peek_all(node_iter, b); | |
811d2bcd | 72 | if (k && bkey_cmp_left_packed(b, k, &insert->k.p)) |
ae54c453 | 73 | k = NULL; |
1c6fdbd8 | 74 | |
ae54c453 | 75 | /* @k is the key being overwritten/deleted, if any: */ |
c052cf82 | 76 | EBUG_ON(k && bkey_deleted(k)); |
1c6fdbd8 | 77 | |
fdf22400 | 78 | /* Deleting, but not found? nothing to do: */ |
c052cf82 | 79 | if (bkey_deleted(&insert->k) && !k) |
fdf22400 KO |
80 | return false; |
81 | ||
c052cf82 | 82 | if (bkey_deleted(&insert->k)) { |
ae54c453 | 83 | /* Deleting: */ |
ae54c453 KO |
84 | btree_account_key_drop(b, k); |
85 | k->type = KEY_TYPE_deleted; | |
c9bebae6 | 86 | |
fdf22400 | 87 | if (k->needs_whiteout) |
e3e464ac | 88 | push_whiteout(iter->trans->c, b, insert->k.p); |
fdf22400 | 89 | k->needs_whiteout = false; |
1c6fdbd8 | 90 | |
ae54c453 KO |
91 | if (k >= btree_bset_last(b)->start) { |
92 | clobber_u64s = k->u64s; | |
ae54c453 | 93 | bch2_bset_delete(b, k, clobber_u64s); |
fdf22400 | 94 | goto fix_iter; |
ae54c453 KO |
95 | } else { |
96 | bch2_btree_iter_fix_key_modified(iter, b, k); | |
97 | } | |
98 | ||
99 | return true; | |
100 | } | |
c9bebae6 | 101 | |
ae54c453 KO |
102 | if (k) { |
103 | /* Overwriting: */ | |
ae54c453 KO |
104 | btree_account_key_drop(b, k); |
105 | k->type = KEY_TYPE_deleted; | |
106 | ||
f2e8c69f KO |
107 | insert->k.needs_whiteout = k->needs_whiteout; |
108 | k->needs_whiteout = false; | |
109 | ||
c9bebae6 KO |
110 | if (k >= btree_bset_last(b)->start) { |
111 | clobber_u64s = k->u64s; | |
1c6fdbd8 | 112 | goto overwrite; |
ae54c453 KO |
113 | } else { |
114 | bch2_btree_iter_fix_key_modified(iter, b, k); | |
1c6fdbd8 | 115 | } |
1c6fdbd8 KO |
116 | } |
117 | ||
216c9fac | 118 | k = bch2_btree_node_iter_bset_pos(node_iter, b, bset_tree_last(b)); |
1c6fdbd8 KO |
119 | overwrite: |
120 | bch2_bset_insert(b, node_iter, k, insert, clobber_u64s); | |
fdf22400 KO |
121 | new_u64s = k->u64s; |
122 | fix_iter: | |
123 | if (clobber_u64s != new_u64s) | |
124 | bch2_btree_node_iter_fix(iter, b, node_iter, k, | |
125 | clobber_u64s, new_u64s); | |
1c6fdbd8 KO |
126 | return true; |
127 | } | |
128 | ||
129 | static void __btree_node_flush(struct journal *j, struct journal_entry_pin *pin, | |
130 | unsigned i, u64 seq) | |
131 | { | |
132 | struct bch_fs *c = container_of(j, struct bch_fs, journal); | |
133 | struct btree_write *w = container_of(pin, struct btree_write, journal); | |
134 | struct btree *b = container_of(w, struct btree, writes[i]); | |
135 | ||
136 | btree_node_lock_type(c, b, SIX_LOCK_read); | |
137 | bch2_btree_node_write_cond(c, b, | |
4077991c | 138 | (btree_current_write(b) == w && w->journal.seq == seq)); |
c43a6ef9 | 139 | six_unlock_read(&b->c.lock); |
1c6fdbd8 KO |
140 | } |
141 | ||
142 | static void btree_node_flush0(struct journal *j, struct journal_entry_pin *pin, u64 seq) | |
143 | { | |
144 | return __btree_node_flush(j, pin, 0, seq); | |
145 | } | |
146 | ||
147 | static void btree_node_flush1(struct journal *j, struct journal_entry_pin *pin, u64 seq) | |
148 | { | |
149 | return __btree_node_flush(j, pin, 1, seq); | |
150 | } | |
151 | ||
6357d607 KO |
152 | inline void bch2_btree_add_journal_pin(struct bch_fs *c, |
153 | struct btree *b, u64 seq) | |
154 | { | |
155 | struct btree_write *w = btree_current_write(b); | |
156 | ||
157 | bch2_journal_pin_add(&c->journal, seq, &w->journal, | |
158 | btree_node_write_idx(b) == 0 | |
159 | ? btree_node_flush0 | |
160 | : btree_node_flush1); | |
161 | } | |
162 | ||
1c6fdbd8 KO |
163 | /** |
164 | * btree_insert_key - insert a key one key into a leaf node | |
165 | */ | |
4e8224ed | 166 | static bool btree_insert_key_leaf(struct btree_trans *trans, |
54e86b58 KO |
167 | struct btree_iter *iter, |
168 | struct bkey_i *insert) | |
1c6fdbd8 KO |
169 | { |
170 | struct bch_fs *c = trans->c; | |
e62d65f2 | 171 | struct btree *b = iter_l(iter)->b; |
2a9101a9 | 172 | struct bset_tree *t = bset_tree_last(b); |
4e8224ed | 173 | struct bset *i = bset(b, t); |
2a9101a9 | 174 | int old_u64s = bset_u64s(t); |
1c6fdbd8 KO |
175 | int old_live_u64s = b->nr.live_u64s; |
176 | int live_u64s_added, u64s_added; | |
177 | ||
5d20ba48 KO |
178 | EBUG_ON(!iter->level && |
179 | !test_bit(BCH_FS_BTREE_INTERIOR_REPLAY_DONE, &c->flags)); | |
180 | ||
4e8224ed KO |
181 | if (unlikely(!bch2_btree_bset_insert_key(iter, b, |
182 | &iter_l(iter)->iter, insert))) | |
183 | return false; | |
184 | ||
185 | i->journal_seq = cpu_to_le64(max(trans->journal_res.seq, | |
186 | le64_to_cpu(i->journal_seq))); | |
bcd6f3e0 | 187 | |
4e8224ed KO |
188 | bch2_btree_add_journal_pin(c, b, trans->journal_res.seq); |
189 | ||
190 | if (unlikely(!btree_node_dirty(b))) | |
6a747c46 | 191 | set_btree_node_dirty(c, b); |
1c6fdbd8 KO |
192 | |
193 | live_u64s_added = (int) b->nr.live_u64s - old_live_u64s; | |
2a9101a9 | 194 | u64s_added = (int) bset_u64s(t) - old_u64s; |
1c6fdbd8 KO |
195 | |
196 | if (b->sib_u64s[0] != U16_MAX && live_u64s_added < 0) | |
197 | b->sib_u64s[0] = max(0, (int) b->sib_u64s[0] + live_u64s_added); | |
198 | if (b->sib_u64s[1] != U16_MAX && live_u64s_added < 0) | |
199 | b->sib_u64s[1] = max(0, (int) b->sib_u64s[1] + live_u64s_added); | |
200 | ||
201 | if (u64s_added > live_u64s_added && | |
202 | bch2_maybe_compact_whiteouts(c, b)) | |
203 | bch2_btree_iter_reinit_node(iter, b); | |
204 | ||
54e86b58 | 205 | trace_btree_insert_key(c, b, insert); |
4e8224ed | 206 | return true; |
1c6fdbd8 KO |
207 | } |
208 | ||
2ca88e5a KO |
209 | /* Cached btree updates: */ |
210 | ||
9623ab27 | 211 | /* Normal update interface: */ |
1c6fdbd8 | 212 | |
1a470560 | 213 | static inline void btree_insert_entry_checks(struct btree_trans *trans, |
54e86b58 KO |
214 | struct btree_iter *iter, |
215 | struct bkey_i *insert) | |
1c6fdbd8 | 216 | { |
1a470560 | 217 | struct bch_fs *c = trans->c; |
a7199432 | 218 | |
7e1a3aa9 | 219 | BUG_ON(bkey_cmp(insert->k.p, iter->real_pos)); |
29364f34 | 220 | BUG_ON(bch2_debug_check_bkeys && |
2aec5955 KO |
221 | bch2_bkey_invalid(c, bkey_i_to_s_c(insert), |
222 | __btree_node_type(iter->level, iter->btree_id))); | |
9623ab27 | 223 | } |
1c6fdbd8 | 224 | |
2a9101a9 KO |
225 | static noinline int |
226 | bch2_trans_journal_preres_get_cold(struct btree_trans *trans, unsigned u64s) | |
1c6fdbd8 | 227 | { |
9623ab27 | 228 | struct bch_fs *c = trans->c; |
9623ab27 | 229 | int ret; |
1c6fdbd8 | 230 | |
58fbf808 | 231 | bch2_trans_unlock(trans); |
1c6fdbd8 | 232 | |
9623ab27 KO |
233 | ret = bch2_journal_preres_get(&c->journal, |
234 | &trans->journal_preres, u64s, 0); | |
235 | if (ret) | |
236 | return ret; | |
1c6fdbd8 | 237 | |
58fbf808 | 238 | if (!bch2_trans_relock(trans)) { |
20bceecb | 239 | trace_trans_restart_journal_preres_get(trans->ip); |
9623ab27 KO |
240 | return -EINTR; |
241 | } | |
1c6fdbd8 | 242 | |
9623ab27 | 243 | return 0; |
1c6fdbd8 KO |
244 | } |
245 | ||
2a9101a9 KO |
246 | static inline int bch2_trans_journal_res_get(struct btree_trans *trans, |
247 | unsigned flags) | |
c8cc5b3e | 248 | { |
9623ab27 | 249 | struct bch_fs *c = trans->c; |
9623ab27 | 250 | int ret; |
c8cc5b3e | 251 | |
9623ab27 KO |
252 | if (trans->flags & BTREE_INSERT_JOURNAL_RESERVED) |
253 | flags |= JOURNAL_RES_GET_RESERVED; | |
c8cc5b3e | 254 | |
9623ab27 | 255 | ret = bch2_journal_res_get(&c->journal, &trans->journal_res, |
87c3beb4 | 256 | trans->journal_u64s, flags); |
9623ab27 KO |
257 | |
258 | return ret == -EAGAIN ? BTREE_INSERT_NEED_JOURNAL_RES : ret; | |
259 | } | |
1c6fdbd8 | 260 | |
b0004d8d | 261 | static enum btree_insert_ret |
0dc17247 | 262 | btree_key_can_insert(struct btree_trans *trans, |
54e86b58 | 263 | struct btree_iter *iter, |
64f2a880 | 264 | unsigned u64s) |
b0004d8d KO |
265 | { |
266 | struct bch_fs *c = trans->c; | |
e62d65f2 | 267 | struct btree *b = iter_l(iter)->b; |
b0004d8d | 268 | |
f8058242 | 269 | if (!bch2_btree_node_insert_fits(c, b, u64s)) |
b0004d8d KO |
270 | return BTREE_INSERT_BTREE_NODE_FULL; |
271 | ||
272 | return BTREE_INSERT_OK; | |
273 | } | |
274 | ||
2ca88e5a KO |
275 | static enum btree_insert_ret |
276 | btree_key_can_insert_cached(struct btree_trans *trans, | |
277 | struct btree_iter *iter, | |
64f2a880 | 278 | unsigned u64s) |
2ca88e5a KO |
279 | { |
280 | struct bkey_cached *ck = (void *) iter->l[0].b; | |
281 | unsigned new_u64s; | |
282 | struct bkey_i *new_k; | |
283 | ||
284 | BUG_ON(iter->level); | |
285 | ||
d5425a3b | 286 | if (!test_bit(BKEY_CACHED_DIRTY, &ck->flags) && |
bcdb4b97 KO |
287 | bch2_btree_key_cache_must_wait(trans->c) && |
288 | !(trans->flags & BTREE_INSERT_JOURNAL_RECLAIM)) | |
d5425a3b KO |
289 | return BTREE_INSERT_NEED_JOURNAL_RECLAIM; |
290 | ||
64f2a880 | 291 | if (u64s <= ck->u64s) |
2ca88e5a KO |
292 | return BTREE_INSERT_OK; |
293 | ||
64f2a880 | 294 | new_u64s = roundup_pow_of_two(u64s); |
2ca88e5a KO |
295 | new_k = krealloc(ck->k, new_u64s * sizeof(u64), GFP_NOFS); |
296 | if (!new_k) | |
297 | return -ENOMEM; | |
298 | ||
299 | ck->u64s = new_u64s; | |
300 | ck->k = new_k; | |
301 | return BTREE_INSERT_OK; | |
302 | } | |
303 | ||
0dc17247 | 304 | static inline void do_btree_insert_one(struct btree_trans *trans, |
54e86b58 KO |
305 | struct btree_iter *iter, |
306 | struct bkey_i *insert) | |
3636ed48 | 307 | { |
4e8224ed KO |
308 | struct bch_fs *c = trans->c; |
309 | struct journal *j = &c->journal; | |
310 | bool did_work; | |
311 | ||
312 | EBUG_ON(trans->journal_res.ref != | |
313 | !(trans->flags & BTREE_INSERT_JOURNAL_REPLAY)); | |
314 | ||
315 | insert->k.needs_whiteout = false; | |
316 | ||
2ca88e5a KO |
317 | did_work = (btree_iter_type(iter) != BTREE_ITER_CACHED) |
318 | ? btree_insert_key_leaf(trans, iter, insert) | |
319 | : bch2_btree_insert_key_cached(trans, iter, insert); | |
4e8224ed KO |
320 | if (!did_work) |
321 | return; | |
322 | ||
323 | if (likely(!(trans->flags & BTREE_INSERT_JOURNAL_REPLAY))) { | |
324 | bch2_journal_add_keys(j, &trans->journal_res, | |
325 | iter->btree_id, insert); | |
326 | ||
327 | bch2_journal_set_has_inode(j, &trans->journal_res, | |
328 | insert->k.p.inode); | |
329 | ||
330 | if (trans->journal_seq) | |
331 | *trans->journal_seq = trans->journal_res.seq; | |
332 | } | |
3636ed48 KO |
333 | } |
334 | ||
54e86b58 | 335 | static inline bool iter_has_trans_triggers(struct btree_iter *iter) |
932aa837 | 336 | { |
54e86b58 | 337 | return BTREE_NODE_TYPE_HAS_TRANS_TRIGGERS & (1U << iter->btree_id); |
932aa837 KO |
338 | } |
339 | ||
54e86b58 | 340 | static inline bool iter_has_nontrans_triggers(struct btree_iter *iter) |
932aa837 | 341 | { |
39283c71 KO |
342 | return (((BTREE_NODE_TYPE_HAS_TRIGGERS & |
343 | ~BTREE_NODE_TYPE_HAS_TRANS_TRIGGERS)) | | |
344 | (1U << BTREE_ID_EC)) & | |
54e86b58 | 345 | (1U << iter->btree_id); |
932aa837 KO |
346 | } |
347 | ||
2a9101a9 KO |
348 | static noinline void bch2_btree_iter_unlock_noinline(struct btree_iter *iter) |
349 | { | |
350 | __bch2_btree_iter_unlock(iter); | |
351 | } | |
352 | ||
353 | static noinline void bch2_trans_mark_gc(struct btree_trans *trans) | |
1c6fdbd8 KO |
354 | { |
355 | struct bch_fs *c = trans->c; | |
356 | struct btree_insert_entry *i; | |
1c6fdbd8 | 357 | |
2ca88e5a KO |
358 | trans_for_each_update(trans, i) { |
359 | /* | |
360 | * XXX: synchronization of cached update triggers with gc | |
361 | */ | |
362 | BUG_ON(btree_iter_type(i->iter) == BTREE_ITER_CACHED); | |
363 | ||
364 | if (gc_visited(c, gc_pos_btree_node(i->iter->l[0].b))) | |
54e86b58 | 365 | bch2_mark_update(trans, i->iter, i->k, NULL, |
2d594dfb | 366 | i->trigger_flags|BTREE_TRIGGER_GC); |
2ca88e5a | 367 | } |
2a9101a9 | 368 | } |
36e9d698 | 369 | |
2a9101a9 KO |
370 | static inline int |
371 | bch2_trans_commit_write_locked(struct btree_trans *trans, | |
372 | struct btree_insert_entry **stopped_at) | |
373 | { | |
374 | struct bch_fs *c = trans->c; | |
375 | struct bch_fs_usage_online *fs_usage = NULL; | |
376 | struct btree_insert_entry *i; | |
24326cd1 | 377 | unsigned u64s = 0; |
b7ba66c8 | 378 | bool marking = false; |
2a9101a9 | 379 | int ret; |
4d8100da | 380 | |
1c6fdbd8 | 381 | if (race_fault()) { |
20bceecb | 382 | trace_trans_restart_fault_inject(trans->ip); |
2a9101a9 | 383 | return -EINTR; |
1c6fdbd8 KO |
384 | } |
385 | ||
b0004d8d KO |
386 | /* |
387 | * Check if the insert will fit in the leaf node with the write lock | |
388 | * held, otherwise another thread could write the node changing the | |
389 | * amount of space available: | |
390 | */ | |
c8cc5b3e | 391 | |
b7ba66c8 | 392 | prefetch(&trans->c->journal.flags); |
932aa837 | 393 | |
e3e464ac | 394 | trans_for_each_update2(trans, i) { |
b7ba66c8 | 395 | /* Multiple inserts might go to same leaf: */ |
24326cd1 | 396 | if (!same_leaf_as_prev(trans, i)) |
b7ba66c8 | 397 | u64s = 0; |
932aa837 | 398 | |
b7ba66c8 | 399 | u64s += i->k->k.u64s; |
2ca88e5a | 400 | ret = btree_iter_type(i->iter) != BTREE_ITER_CACHED |
f8058242 KO |
401 | ? btree_key_can_insert(trans, i->iter, u64s) |
402 | : btree_key_can_insert_cached(trans, i->iter, u64s); | |
b7ba66c8 KO |
403 | if (ret) { |
404 | *stopped_at = i; | |
405 | return ret; | |
932aa837 | 406 | } |
b7ba66c8 KO |
407 | |
408 | if (btree_node_type_needs_gc(i->iter->btree_id)) | |
409 | marking = true; | |
410 | } | |
411 | ||
412 | if (marking) { | |
413 | percpu_down_read(&c->mark_lock); | |
414 | fs_usage = bch2_fs_usage_scratch_get(c); | |
932aa837 KO |
415 | } |
416 | ||
9623ab27 KO |
417 | /* |
418 | * Don't get journal reservation until after we know insert will | |
419 | * succeed: | |
420 | */ | |
87c3beb4 | 421 | if (likely(!(trans->flags & BTREE_INSERT_JOURNAL_REPLAY))) { |
2a9101a9 KO |
422 | ret = bch2_trans_journal_res_get(trans, |
423 | JOURNAL_RES_GET_NONBLOCK); | |
87c3beb4 | 424 | if (ret) |
2a9101a9 | 425 | goto err; |
4e8224ed KO |
426 | } else { |
427 | trans->journal_res.seq = c->journal.replay_journal_seq; | |
87c3beb4 | 428 | } |
c8cc5b3e | 429 | |
96e2aa1b | 430 | if (unlikely(trans->extra_journal_entry_u64s)) { |
00b8ccf7 | 431 | memcpy_u64s_small(journal_res_entry(&c->journal, &trans->journal_res), |
96e2aa1b KO |
432 | trans->extra_journal_entries, |
433 | trans->extra_journal_entry_u64s); | |
434 | ||
435 | trans->journal_res.offset += trans->extra_journal_entry_u64s; | |
436 | trans->journal_res.u64s -= trans->extra_journal_entry_u64s; | |
437 | } | |
438 | ||
2a9101a9 KO |
439 | /* |
440 | * Not allowed to fail after we've gotten our journal reservation - we | |
441 | * have to use it: | |
442 | */ | |
443 | ||
1c6fdbd8 | 444 | if (!(trans->flags & BTREE_INSERT_JOURNAL_REPLAY)) { |
29364f34 | 445 | if (bch2_journal_seq_verify) |
e3e464ac | 446 | trans_for_each_update2(trans, i) |
1c6fdbd8 | 447 | i->k->k.version.lo = trans->journal_res.seq; |
29364f34 | 448 | else if (bch2_inject_invalid_keys) |
e3e464ac | 449 | trans_for_each_update2(trans, i) |
1c6fdbd8 KO |
450 | i->k->k.version = MAX_VERSION; |
451 | } | |
452 | ||
b7ba66c8 KO |
453 | /* Must be called under mark_lock: */ |
454 | if (marking && trans->fs_usage_deltas && | |
455 | bch2_replicas_delta_list_apply(c, &fs_usage->u, | |
456 | trans->fs_usage_deltas)) { | |
457 | ret = BTREE_INSERT_NEED_MARK_REPLICAS; | |
458 | goto err; | |
459 | } | |
460 | ||
a7199432 | 461 | trans_for_each_update(trans, i) |
2d594dfb | 462 | if (iter_has_nontrans_triggers(i->iter)) |
54e86b58 | 463 | bch2_mark_update(trans, i->iter, i->k, |
2d594dfb | 464 | &fs_usage->u, i->trigger_flags); |
932aa837 | 465 | |
b7ba66c8 | 466 | if (marking) |
932aa837 | 467 | bch2_trans_fs_usage_apply(trans, fs_usage); |
36e916e1 | 468 | |
2a9101a9 KO |
469 | if (unlikely(c->gc_pos.phase)) |
470 | bch2_trans_mark_gc(trans); | |
932aa837 | 471 | |
e3e464ac | 472 | trans_for_each_update2(trans, i) |
54e86b58 | 473 | do_btree_insert_one(trans, i->iter, i->k); |
2a9101a9 | 474 | err: |
b7ba66c8 | 475 | if (marking) { |
4d8100da KO |
476 | bch2_fs_usage_scratch_put(c, fs_usage); |
477 | percpu_up_read(&c->mark_lock); | |
478 | } | |
479 | ||
2a9101a9 KO |
480 | return ret; |
481 | } | |
482 | ||
483 | /* | |
484 | * Get journal reservation, take write locks, and attempt to do btree update(s): | |
485 | */ | |
486 | static inline int do_bch2_trans_commit(struct btree_trans *trans, | |
487 | struct btree_insert_entry **stopped_at) | |
488 | { | |
489 | struct btree_insert_entry *i; | |
490 | struct btree_iter *iter; | |
2a9101a9 KO |
491 | int ret; |
492 | ||
e3e464ac | 493 | trans_for_each_update2(trans, i) |
e62d65f2 | 494 | BUG_ON(!btree_node_intent_locked(i->iter, i->iter->level)); |
1c6fdbd8 | 495 | |
2a9101a9 | 496 | ret = bch2_journal_preres_get(&trans->c->journal, |
8b3bbe2c | 497 | &trans->journal_preres, trans->journal_preres_u64s, |
2ca88e5a KO |
498 | JOURNAL_RES_GET_NONBLOCK| |
499 | ((trans->flags & BTREE_INSERT_JOURNAL_RECLAIM) | |
500 | ? JOURNAL_RES_GET_RECLAIM : 0)); | |
2a9101a9 KO |
501 | if (unlikely(ret == -EAGAIN)) |
502 | ret = bch2_trans_journal_preres_get_cold(trans, | |
8b3bbe2c | 503 | trans->journal_preres_u64s); |
2a9101a9 KO |
504 | if (unlikely(ret)) |
505 | return ret; | |
506 | ||
507 | /* | |
508 | * Can't be holding any read locks when we go to take write locks: | |
aa8889c0 KO |
509 | * another thread could be holding an intent lock on the same node we |
510 | * have a read lock on, and it'll block trying to take a write lock | |
511 | * (because we hold a read lock) and it could be blocking us by holding | |
512 | * its own read lock (while we're trying to to take write locks). | |
2a9101a9 KO |
513 | * |
514 | * note - this must be done after bch2_trans_journal_preres_get_cold() | |
515 | * or anything else that might call bch2_trans_relock(), since that | |
516 | * would just retake the read locks: | |
517 | */ | |
515282ac | 518 | trans_for_each_iter(trans, iter) { |
2a9101a9 | 519 | if (iter->nodes_locked != iter->nodes_intent_locked) { |
aa8889c0 KO |
520 | if ((iter->flags & BTREE_ITER_KEEP_UNTIL_COMMIT) || |
521 | (trans->iters_live & (1ULL << iter->idx))) { | |
522 | if (!bch2_btree_iter_upgrade(iter, 1)) { | |
523 | trace_trans_restart_upgrade(trans->ip); | |
524 | return -EINTR; | |
525 | } | |
526 | } else { | |
527 | bch2_btree_iter_unlock_noinline(iter); | |
528 | } | |
2a9101a9 KO |
529 | } |
530 | } | |
531 | ||
532 | if (IS_ENABLED(CONFIG_BCACHEFS_DEBUG)) | |
e3e464ac | 533 | trans_for_each_update2(trans, i) |
54e86b58 | 534 | btree_insert_entry_checks(trans, i->iter, i->k); |
2a9101a9 KO |
535 | bch2_btree_trans_verify_locks(trans); |
536 | ||
e3e464ac | 537 | trans_for_each_update2(trans, i) |
24326cd1 | 538 | if (!same_leaf_as_prev(trans, i)) |
b7ba66c8 | 539 | bch2_btree_node_lock_for_insert(trans->c, |
e62d65f2 | 540 | iter_l(i->iter)->b, i->iter); |
b7ba66c8 | 541 | |
2a9101a9 | 542 | ret = bch2_trans_commit_write_locked(trans, stopped_at); |
b7ba66c8 | 543 | |
e3e464ac | 544 | trans_for_each_update2(trans, i) |
24326cd1 | 545 | if (!same_leaf_as_prev(trans, i)) |
e62d65f2 | 546 | bch2_btree_node_unlock_write_inlined(iter_l(i->iter)->b, |
b7ba66c8 | 547 | i->iter); |
2a9101a9 | 548 | |
00b8ccf7 KO |
549 | if (!ret && trans->journal_pin) |
550 | bch2_journal_pin_add(&trans->c->journal, trans->journal_res.seq, | |
551 | trans->journal_pin, NULL); | |
552 | ||
2a9101a9 KO |
553 | /* |
554 | * Drop journal reservation after dropping write locks, since dropping | |
555 | * the journal reservation may kick off a journal write: | |
556 | */ | |
557 | bch2_journal_res_put(&trans->c->journal, &trans->journal_res); | |
558 | ||
559 | if (unlikely(ret)) | |
560 | return ret; | |
561 | ||
562 | if (trans->flags & BTREE_INSERT_NOUNLOCK) | |
563 | trans->nounlock = true; | |
564 | ||
e3e464ac | 565 | trans_for_each_update2(trans, i) |
2ca88e5a KO |
566 | if (btree_iter_type(i->iter) != BTREE_ITER_CACHED && |
567 | !same_leaf_as_prev(trans, i)) | |
2a9101a9 KO |
568 | bch2_foreground_maybe_merge(trans->c, i->iter, |
569 | 0, trans->flags); | |
570 | ||
571 | trans->nounlock = false; | |
572 | ||
72545b5e | 573 | bch2_trans_downgrade(trans); |
2a9101a9 KO |
574 | |
575 | return 0; | |
1c6fdbd8 KO |
576 | } |
577 | ||
11e6f19a KO |
578 | static noinline |
579 | int bch2_trans_commit_error(struct btree_trans *trans, | |
580 | struct btree_insert_entry *i, | |
581 | int ret) | |
1c6fdbd8 KO |
582 | { |
583 | struct bch_fs *c = trans->c; | |
11e6f19a | 584 | unsigned flags = trans->flags; |
1c6fdbd8 KO |
585 | |
586 | /* | |
587 | * BTREE_INSERT_NOUNLOCK means don't unlock _after_ successful btree | |
588 | * update; if we haven't done anything yet it doesn't apply | |
589 | */ | |
94d290e4 | 590 | flags &= ~BTREE_INSERT_NOUNLOCK; |
1c6fdbd8 | 591 | |
1d25849c KO |
592 | switch (ret) { |
593 | case BTREE_INSERT_BTREE_NODE_FULL: | |
594 | ret = bch2_btree_split_leaf(c, i->iter, flags); | |
1c6fdbd8 KO |
595 | |
596 | /* | |
597 | * if the split succeeded without dropping locks the insert will | |
58e2388f KO |
598 | * still be atomic (what the caller peeked() and is overwriting |
599 | * won't have changed) | |
1c6fdbd8 KO |
600 | */ |
601 | #if 0 | |
602 | /* | |
603 | * XXX: | |
604 | * split -> btree node merging (of parent node) might still drop | |
605 | * locks when we're not passing it BTREE_INSERT_NOUNLOCK | |
94d290e4 KO |
606 | * |
607 | * we don't want to pass BTREE_INSERT_NOUNLOCK to split as that | |
608 | * will inhibit merging - but we don't have a reliable way yet | |
609 | * (do we?) of checking if we dropped locks in this path | |
1c6fdbd8 | 610 | */ |
94d290e4 | 611 | if (!ret) |
1c6fdbd8 KO |
612 | goto retry; |
613 | #endif | |
614 | ||
615 | /* | |
616 | * don't care if we got ENOSPC because we told split it | |
617 | * couldn't block: | |
618 | */ | |
ed8413fd KO |
619 | if (!ret || |
620 | ret == -EINTR || | |
621 | (flags & BTREE_INSERT_NOUNLOCK)) { | |
20bceecb | 622 | trace_trans_restart_btree_node_split(trans->ip); |
1c6fdbd8 | 623 | ret = -EINTR; |
1c7a0adf | 624 | } |
1d25849c | 625 | break; |
1d25849c KO |
626 | case BTREE_INSERT_ENOSPC: |
627 | ret = -ENOSPC; | |
628 | break; | |
629 | case BTREE_INSERT_NEED_MARK_REPLICAS: | |
0dc17247 | 630 | bch2_trans_unlock(trans); |
db8a5f0a | 631 | |
a7199432 | 632 | trans_for_each_update(trans, i) { |
11e6f19a KO |
633 | ret = bch2_mark_bkey_replicas(c, bkey_i_to_s_c(i->k)); |
634 | if (ret) | |
635 | return ret; | |
db8a5f0a | 636 | } |
11e6f19a | 637 | |
58fbf808 | 638 | if (bch2_trans_relock(trans)) |
11e6f19a KO |
639 | return 0; |
640 | ||
20bceecb | 641 | trace_trans_restart_mark_replicas(trans->ip); |
11e6f19a | 642 | ret = -EINTR; |
1d25849c | 643 | break; |
9623ab27 | 644 | case BTREE_INSERT_NEED_JOURNAL_RES: |
58fbf808 | 645 | bch2_trans_unlock(trans); |
9623ab27 KO |
646 | |
647 | ret = bch2_trans_journal_res_get(trans, JOURNAL_RES_GET_CHECK); | |
648 | if (ret) | |
11e6f19a | 649 | return ret; |
9623ab27 | 650 | |
58fbf808 | 651 | if (bch2_trans_relock(trans)) |
11e6f19a | 652 | return 0; |
9623ab27 | 653 | |
20bceecb | 654 | trace_trans_restart_journal_res_get(trans->ip); |
9623ab27 | 655 | ret = -EINTR; |
d5425a3b KO |
656 | break; |
657 | case BTREE_INSERT_NEED_JOURNAL_RECLAIM: | |
658 | bch2_trans_unlock(trans); | |
659 | ||
afa7cb0c | 660 | do { |
d5425a3b | 661 | mutex_lock(&c->journal.reclaim_lock); |
afa7cb0c | 662 | ret = bch2_journal_reclaim(&c->journal); |
d5425a3b | 663 | mutex_unlock(&c->journal.reclaim_lock); |
afa7cb0c | 664 | } while (!ret && bch2_btree_key_cache_must_wait(c)); |
d5425a3b | 665 | |
afa7cb0c | 666 | if (!ret && bch2_trans_relock(trans)) |
d5425a3b KO |
667 | return 0; |
668 | ||
669 | trace_trans_restart_journal_reclaim(trans->ip); | |
670 | ret = -EINTR; | |
9623ab27 | 671 | break; |
1d25849c KO |
672 | default: |
673 | BUG_ON(ret >= 0); | |
674 | break; | |
1c6fdbd8 KO |
675 | } |
676 | ||
11e6f19a KO |
677 | return ret; |
678 | } | |
679 | ||
2a9101a9 KO |
680 | static noinline int |
681 | bch2_trans_commit_get_rw_cold(struct btree_trans *trans) | |
11e6f19a KO |
682 | { |
683 | struct bch_fs *c = trans->c; | |
11e6f19a KO |
684 | int ret; |
685 | ||
2a9101a9 KO |
686 | if (likely(!(trans->flags & BTREE_INSERT_LAZY_RW))) |
687 | return -EROFS; | |
11e6f19a | 688 | |
2a9101a9 | 689 | bch2_trans_unlock(trans); |
60755344 | 690 | |
2a9101a9 KO |
691 | ret = bch2_fs_read_write_early(c); |
692 | if (ret) | |
693 | return ret; | |
11e6f19a | 694 | |
2a9101a9 KO |
695 | percpu_ref_get(&c->writes); |
696 | return 0; | |
1c6fdbd8 KO |
697 | } |
698 | ||
645d72aa KO |
699 | static inline int btree_iter_pos_cmp(const struct btree_iter *l, |
700 | const struct btree_iter *r) | |
701 | { | |
702 | return cmp_int(l->btree_id, r->btree_id) ?: | |
703 | bkey_cmp(l->pos, r->pos); | |
704 | } | |
705 | ||
8042b5b7 | 706 | static int bch2_trans_update2(struct btree_trans *trans, |
e3e464ac KO |
707 | struct btree_iter *iter, |
708 | struct bkey_i *insert) | |
709 | { | |
710 | struct btree_insert_entry *i, n = (struct btree_insert_entry) { | |
711 | .iter = iter, .k = insert | |
712 | }; | |
8042b5b7 | 713 | int ret; |
e3e464ac KO |
714 | |
715 | btree_insert_entry_checks(trans, n.iter, n.k); | |
716 | ||
3eb26d01 | 717 | EBUG_ON(trans->nr_updates2 >= BTREE_ITER_MAX); |
e3e464ac | 718 | |
8042b5b7 KO |
719 | ret = bch2_btree_iter_traverse(iter); |
720 | if (unlikely(ret)) | |
721 | return ret; | |
722 | ||
723 | BUG_ON(iter->uptodate > BTREE_ITER_NEED_PEEK); | |
724 | ||
e3e464ac KO |
725 | iter->flags |= BTREE_ITER_KEEP_UNTIL_COMMIT; |
726 | ||
727 | trans_for_each_update2(trans, i) { | |
645d72aa | 728 | if (btree_iter_pos_cmp(n.iter, i->iter) == 0) { |
e3e464ac | 729 | *i = n; |
8042b5b7 | 730 | return 0; |
e3e464ac KO |
731 | } |
732 | ||
645d72aa | 733 | if (btree_iter_pos_cmp(n.iter, i->iter) <= 0) |
e3e464ac KO |
734 | break; |
735 | } | |
736 | ||
737 | array_insert_item(trans->updates2, trans->nr_updates2, | |
738 | i - trans->updates2, n); | |
8042b5b7 | 739 | return 0; |
e3e464ac KO |
740 | } |
741 | ||
742 | static int extent_update_to_keys(struct btree_trans *trans, | |
743 | struct btree_iter *orig_iter, | |
744 | struct bkey_i *insert) | |
745 | { | |
746 | struct btree_iter *iter; | |
64f2a880 KO |
747 | int ret; |
748 | ||
749 | ret = bch2_extent_can_insert(trans, orig_iter, insert); | |
750 | if (ret) | |
751 | return ret; | |
e3e464ac KO |
752 | |
753 | if (bkey_deleted(&insert->k)) | |
754 | return 0; | |
755 | ||
756 | iter = bch2_trans_copy_iter(trans, orig_iter); | |
e3e464ac KO |
757 | |
758 | iter->flags |= BTREE_ITER_INTENT; | |
759 | __bch2_btree_iter_set_pos(iter, insert->k.p, false); | |
8042b5b7 | 760 | ret = bch2_trans_update2(trans, iter, insert); |
e3e464ac | 761 | bch2_trans_iter_put(trans, iter); |
8042b5b7 | 762 | return ret; |
e3e464ac KO |
763 | } |
764 | ||
765 | static int extent_handle_overwrites(struct btree_trans *trans, | |
766 | enum btree_id btree_id, | |
767 | struct bpos start, struct bpos end) | |
768 | { | |
769 | struct btree_iter *iter = NULL, *update_iter; | |
770 | struct bkey_i *update; | |
771 | struct bkey_s_c k; | |
772 | int ret = 0; | |
773 | ||
774 | iter = bch2_trans_get_iter(trans, btree_id, start, BTREE_ITER_INTENT); | |
e3e464ac KO |
775 | k = bch2_btree_iter_peek_with_updates(iter); |
776 | ||
777 | while (k.k && !(ret = bkey_err(k))) { | |
778 | if (bkey_cmp(end, bkey_start_pos(k.k)) <= 0) | |
779 | break; | |
780 | ||
781 | if (bkey_cmp(bkey_start_pos(k.k), start) < 0) { | |
782 | update_iter = bch2_trans_copy_iter(trans, iter); | |
e3e464ac KO |
783 | |
784 | update = bch2_trans_kmalloc(trans, bkey_bytes(k.k)); | |
785 | if ((ret = PTR_ERR_OR_ZERO(update))) | |
786 | goto err; | |
787 | ||
788 | bkey_reassemble(update, k); | |
789 | bch2_cut_back(start, update); | |
790 | ||
791 | __bch2_btree_iter_set_pos(update_iter, update->k.p, false); | |
8042b5b7 | 792 | ret = bch2_trans_update2(trans, update_iter, update); |
e3e464ac | 793 | bch2_trans_iter_put(trans, update_iter); |
8042b5b7 KO |
794 | if (ret) |
795 | goto err; | |
e3e464ac KO |
796 | } |
797 | ||
798 | if (bkey_cmp(k.k->p, end) > 0) { | |
799 | update_iter = bch2_trans_copy_iter(trans, iter); | |
e3e464ac KO |
800 | |
801 | update = bch2_trans_kmalloc(trans, bkey_bytes(k.k)); | |
802 | if ((ret = PTR_ERR_OR_ZERO(update))) | |
803 | goto err; | |
804 | ||
805 | bkey_reassemble(update, k); | |
806 | bch2_cut_front(end, update); | |
807 | ||
808 | __bch2_btree_iter_set_pos(update_iter, update->k.p, false); | |
8042b5b7 | 809 | ret = bch2_trans_update2(trans, update_iter, update); |
e3e464ac | 810 | bch2_trans_iter_put(trans, update_iter); |
8042b5b7 KO |
811 | if (ret) |
812 | goto err; | |
e3e464ac KO |
813 | } else { |
814 | update_iter = bch2_trans_copy_iter(trans, iter); | |
e3e464ac KO |
815 | |
816 | update = bch2_trans_kmalloc(trans, sizeof(struct bkey)); | |
817 | if ((ret = PTR_ERR_OR_ZERO(update))) | |
818 | goto err; | |
819 | ||
820 | update->k = *k.k; | |
821 | set_bkey_val_u64s(&update->k, 0); | |
822 | update->k.type = KEY_TYPE_deleted; | |
823 | update->k.size = 0; | |
824 | ||
825 | __bch2_btree_iter_set_pos(update_iter, update->k.p, false); | |
8042b5b7 | 826 | ret = bch2_trans_update2(trans, update_iter, update); |
e3e464ac | 827 | bch2_trans_iter_put(trans, update_iter); |
8042b5b7 KO |
828 | if (ret) |
829 | goto err; | |
e3e464ac KO |
830 | } |
831 | ||
832 | k = bch2_btree_iter_next_with_updates(iter); | |
833 | } | |
834 | err: | |
835 | if (!IS_ERR_OR_NULL(iter)) | |
836 | bch2_trans_iter_put(trans, iter); | |
837 | return ret; | |
838 | } | |
839 | ||
2a9101a9 | 840 | int __bch2_trans_commit(struct btree_trans *trans) |
1c6fdbd8 | 841 | { |
d9b022fe | 842 | struct btree_insert_entry *i = NULL; |
24326cd1 KO |
843 | struct btree_iter *iter; |
844 | bool trans_trigger_run; | |
8b3bbe2c | 845 | unsigned u64s; |
dc3b63dc | 846 | int ret = 0; |
1c6fdbd8 KO |
847 | |
848 | if (!trans->nr_updates) | |
b7cf4bd7 | 849 | goto out_reset; |
1c6fdbd8 | 850 | |
2a9101a9 KO |
851 | if (trans->flags & BTREE_INSERT_GC_LOCK_HELD) |
852 | lockdep_assert_held(&trans->c->gc_lock); | |
11e6f19a | 853 | |
9623ab27 | 854 | memset(&trans->journal_preres, 0, sizeof(trans->journal_preres)); |
0dc17247 | 855 | |
96e2aa1b | 856 | trans->journal_u64s = trans->extra_journal_entry_u64s; |
8b3bbe2c KO |
857 | trans->journal_preres_u64s = 0; |
858 | ||
2a9101a9 KO |
859 | if (!(trans->flags & BTREE_INSERT_NOCHECK_RW) && |
860 | unlikely(!percpu_ref_tryget(&trans->c->writes))) { | |
861 | ret = bch2_trans_commit_get_rw_cold(trans); | |
134915f3 | 862 | if (ret) |
b7cf4bd7 | 863 | goto out_reset; |
2a9101a9 | 864 | } |
8b3bbe2c | 865 | |
2ca88e5a KO |
866 | #ifdef CONFIG_BCACHEFS_DEBUG |
867 | trans_for_each_update(trans, i) | |
868 | if (btree_iter_type(i->iter) != BTREE_ITER_CACHED && | |
869 | !(i->trigger_flags & BTREE_TRIGGER_NORUN)) | |
870 | bch2_btree_key_cache_verify_clean(trans, | |
871 | i->iter->btree_id, i->iter->pos); | |
872 | #endif | |
873 | ||
8b3bbe2c | 874 | /* |
24326cd1 KO |
875 | * Running triggers will append more updates to the list of updates as |
876 | * we're walking it: | |
8b3bbe2c | 877 | */ |
24326cd1 KO |
878 | do { |
879 | trans_trigger_run = false; | |
880 | ||
881 | trans_for_each_update(trans, i) { | |
07bd4c28 KO |
882 | ret = bch2_btree_iter_traverse(i->iter); |
883 | if (unlikely(ret)) { | |
65d9f536 | 884 | trace_trans_restart_traverse(trans->ip); |
65d9f536 KO |
885 | goto out; |
886 | } | |
887 | ||
888 | /* | |
889 | * We're not using bch2_btree_iter_upgrade here because | |
890 | * we know trans->nounlock can't be set: | |
891 | */ | |
07bd4c28 KO |
892 | if (unlikely(!btree_node_intent_locked(i->iter, i->iter->level) && |
893 | !__bch2_btree_iter_upgrade(i->iter, i->iter->level + 1))) { | |
0abb2501 KO |
894 | trace_trans_restart_upgrade(trans->ip); |
895 | ret = -EINTR; | |
896 | goto out; | |
897 | } | |
898 | ||
24326cd1 KO |
899 | if (iter_has_trans_triggers(i->iter) && |
900 | !i->trans_triggers_run) { | |
901 | i->trans_triggers_run = true; | |
902 | trans_trigger_run = true; | |
903 | ||
904 | ret = bch2_trans_mark_update(trans, i->iter, i->k, | |
905 | i->trigger_flags); | |
906 | if (unlikely(ret)) { | |
907 | if (ret == -EINTR) | |
908 | trace_trans_restart_mark(trans->ip); | |
909 | goto out; | |
910 | } | |
911 | } | |
912 | } | |
913 | } while (trans_trigger_run); | |
914 | ||
e3e464ac KO |
915 | /* Turn extents updates into keys: */ |
916 | trans_for_each_update(trans, i) | |
917 | if (i->iter->flags & BTREE_ITER_IS_EXTENTS) { | |
918 | struct bpos start = bkey_start_pos(&i->k->k); | |
919 | ||
920 | while (i + 1 < trans->updates + trans->nr_updates && | |
921 | i[0].iter->btree_id == i[1].iter->btree_id && | |
922 | !bkey_cmp(i[0].k->k.p, bkey_start_pos(&i[1].k->k))) | |
923 | i++; | |
924 | ||
925 | ret = extent_handle_overwrites(trans, i->iter->btree_id, | |
926 | start, i->k->k.p); | |
927 | if (ret) | |
928 | goto out; | |
929 | } | |
930 | ||
8b3bbe2c | 931 | trans_for_each_update(trans, i) { |
e3e464ac KO |
932 | if (i->iter->flags & BTREE_ITER_IS_EXTENTS) { |
933 | ret = extent_update_to_keys(trans, i->iter, i->k); | |
e3e464ac | 934 | } else { |
8042b5b7 | 935 | ret = bch2_trans_update2(trans, i->iter, i->k); |
e3e464ac | 936 | } |
8042b5b7 KO |
937 | if (ret) |
938 | goto out; | |
e3e464ac KO |
939 | } |
940 | ||
941 | trans_for_each_update2(trans, i) { | |
e3e464ac KO |
942 | BUG_ON(i->iter->locks_want < 1); |
943 | ||
9f631dc1 KO |
944 | ret = bch2_btree_iter_traverse(i->iter); |
945 | if (unlikely(ret)) { | |
946 | trace_trans_restart_traverse(trans->ip); | |
947 | goto out; | |
948 | } | |
949 | ||
8b3bbe2c | 950 | u64s = jset_u64s(i->k->k.u64s); |
2ca88e5a KO |
951 | if (btree_iter_type(i->iter) == BTREE_ITER_CACHED && |
952 | likely(!(trans->flags & BTREE_INSERT_JOURNAL_REPLAY))) | |
8b3bbe2c KO |
953 | trans->journal_preres_u64s += u64s; |
954 | trans->journal_u64s += u64s; | |
955 | } | |
2a9101a9 KO |
956 | retry: |
957 | memset(&trans->journal_res, 0, sizeof(trans->journal_res)); | |
134915f3 | 958 | |
2a9101a9 | 959 | ret = do_bch2_trans_commit(trans, &i); |
134915f3 | 960 | |
2a9101a9 KO |
961 | /* make sure we didn't drop or screw up locks: */ |
962 | bch2_btree_trans_verify_locks(trans); | |
963 | ||
11e6f19a KO |
964 | if (ret) |
965 | goto err; | |
24326cd1 KO |
966 | |
967 | trans_for_each_iter(trans, iter) | |
968 | if ((trans->iters_live & (1ULL << iter->idx)) && | |
792e2c4c KO |
969 | (iter->flags & BTREE_ITER_SET_POS_AFTER_COMMIT)) |
970 | bch2_btree_iter_set_pos(iter, iter->pos_after_commit); | |
11e6f19a | 971 | out: |
2a9101a9 | 972 | bch2_journal_preres_put(&trans->c->journal, &trans->journal_preres); |
9623ab27 | 973 | |
2a9101a9 KO |
974 | if (likely(!(trans->flags & BTREE_INSERT_NOCHECK_RW))) |
975 | percpu_ref_put(&trans->c->writes); | |
b7cf4bd7 | 976 | out_reset: |
163e885a | 977 | bch2_trans_reset(trans, !ret ? TRANS_RESET_NOTRAVERSE : 0); |
8b3bbe2c | 978 | |
0dc17247 | 979 | return ret; |
11e6f19a KO |
980 | err: |
981 | ret = bch2_trans_commit_error(trans, i, ret); | |
2a9101a9 KO |
982 | if (ret) |
983 | goto out; | |
932aa837 | 984 | |
2a9101a9 | 985 | goto retry; |
1c6fdbd8 KO |
986 | } |
987 | ||
24326cd1 KO |
988 | int bch2_trans_update(struct btree_trans *trans, struct btree_iter *iter, |
989 | struct bkey_i *k, enum btree_trigger_flags flags) | |
990 | { | |
991 | struct btree_insert_entry *i, n = (struct btree_insert_entry) { | |
992 | .trigger_flags = flags, .iter = iter, .k = k | |
993 | }; | |
994 | ||
f9ef45ad KO |
995 | #ifdef CONFIG_BCACHEFS_DEBUG |
996 | BUG_ON(bkey_cmp(iter->pos, | |
997 | (iter->flags & BTREE_ITER_IS_EXTENTS) | |
998 | ? bkey_start_pos(&k->k) | |
999 | : k->k.p)); | |
1000 | ||
1001 | trans_for_each_update(trans, i) { | |
1002 | BUG_ON(bkey_cmp(i->iter->pos, | |
1003 | (i->iter->flags & BTREE_ITER_IS_EXTENTS) | |
1004 | ? bkey_start_pos(&i->k->k) | |
1005 | : i->k->k.p)); | |
1006 | ||
1007 | BUG_ON(i != trans->updates && | |
1008 | btree_iter_pos_cmp(i[-1].iter, i[0].iter) >= 0); | |
1009 | } | |
1010 | #endif | |
24326cd1 KO |
1011 | |
1012 | iter->flags |= BTREE_ITER_KEEP_UNTIL_COMMIT; | |
1013 | ||
c4a94ae3 | 1014 | if (btree_node_type_is_extents(iter->btree_id)) { |
24326cd1 KO |
1015 | iter->pos_after_commit = k->k.p; |
1016 | iter->flags |= BTREE_ITER_SET_POS_AFTER_COMMIT; | |
1017 | } | |
1018 | ||
1019 | /* | |
1020 | * Pending updates are kept sorted: first, find position of new update: | |
1021 | */ | |
1022 | trans_for_each_update(trans, i) | |
645d72aa | 1023 | if (btree_iter_pos_cmp(iter, i->iter) <= 0) |
24326cd1 KO |
1024 | break; |
1025 | ||
1026 | /* | |
1027 | * Now delete/trim any updates the new update overwrites: | |
1028 | */ | |
1029 | if (i > trans->updates && | |
1030 | i[-1].iter->btree_id == iter->btree_id && | |
1031 | bkey_cmp(iter->pos, i[-1].k->k.p) < 0) | |
1032 | bch2_cut_back(n.iter->pos, i[-1].k); | |
1033 | ||
1034 | while (i < trans->updates + trans->nr_updates && | |
1035 | iter->btree_id == i->iter->btree_id && | |
1036 | bkey_cmp(n.k->k.p, i->k->k.p) >= 0) | |
1037 | array_remove_item(trans->updates, trans->nr_updates, | |
1038 | i - trans->updates); | |
1039 | ||
1040 | if (i < trans->updates + trans->nr_updates && | |
1041 | iter->btree_id == i->iter->btree_id && | |
1042 | bkey_cmp(n.k->k.p, i->iter->pos) > 0) { | |
1043 | /* | |
1044 | * When we have an extent that overwrites the start of another | |
1045 | * update, trimming that extent will mean the iterator's | |
1046 | * position has to change since the iterator position has to | |
1047 | * match the extent's start pos - but we don't want to change | |
1048 | * the iterator pos if some other code is using it, so we may | |
1049 | * need to clone it: | |
1050 | */ | |
1051 | if (trans->iters_live & (1ULL << i->iter->idx)) { | |
1052 | i->iter = bch2_trans_copy_iter(trans, i->iter); | |
24326cd1 KO |
1053 | |
1054 | i->iter->flags |= BTREE_ITER_KEEP_UNTIL_COMMIT; | |
1055 | bch2_trans_iter_put(trans, i->iter); | |
1056 | } | |
1057 | ||
1058 | bch2_cut_front(n.k->k.p, i->k); | |
1059 | bch2_btree_iter_set_pos(i->iter, n.k->k.p); | |
1060 | } | |
1061 | ||
3eb26d01 | 1062 | EBUG_ON(trans->nr_updates >= BTREE_ITER_MAX); |
24326cd1 KO |
1063 | |
1064 | array_insert_item(trans->updates, trans->nr_updates, | |
1065 | i - trans->updates, n); | |
1066 | return 0; | |
1067 | } | |
1068 | ||
163e885a KO |
1069 | int __bch2_btree_insert(struct btree_trans *trans, |
1070 | enum btree_id id, struct bkey_i *k) | |
b1fd23df KO |
1071 | { |
1072 | struct btree_iter *iter; | |
163e885a | 1073 | int ret; |
b1fd23df KO |
1074 | |
1075 | iter = bch2_trans_get_iter(trans, id, bkey_start_pos(&k->k), | |
1076 | BTREE_ITER_INTENT); | |
b1fd23df | 1077 | |
163e885a KO |
1078 | ret = bch2_btree_iter_traverse(iter) ?: |
1079 | bch2_trans_update(trans, iter, k, 0); | |
1080 | bch2_trans_iter_put(trans, iter); | |
1081 | return ret; | |
b1fd23df KO |
1082 | } |
1083 | ||
1c6fdbd8 | 1084 | /** |
9623ab27 | 1085 | * bch2_btree_insert - insert keys into the extent btree |
1c6fdbd8 KO |
1086 | * @c: pointer to struct bch_fs |
1087 | * @id: btree to insert into | |
1088 | * @insert_keys: list of keys to insert | |
1089 | * @hook: insert callback | |
1090 | */ | |
1091 | int bch2_btree_insert(struct bch_fs *c, enum btree_id id, | |
b1fd23df KO |
1092 | struct bkey_i *k, |
1093 | struct disk_reservation *disk_res, | |
1094 | u64 *journal_seq, int flags) | |
1c6fdbd8 | 1095 | { |
b1fd23df KO |
1096 | return bch2_trans_do(c, disk_res, journal_seq, flags, |
1097 | __bch2_btree_insert(&trans, id, k)); | |
1c6fdbd8 KO |
1098 | } |
1099 | ||
087c2019 KO |
1100 | int bch2_btree_delete_at(struct btree_trans *trans, |
1101 | struct btree_iter *iter, unsigned flags) | |
1102 | { | |
1103 | struct bkey_i k; | |
1104 | ||
1105 | bkey_init(&k.k); | |
1106 | k.k.p = iter->pos; | |
1107 | ||
1108 | bch2_trans_update(trans, iter, &k, 0); | |
1109 | return bch2_trans_commit(trans, NULL, NULL, | |
3187aa8d | 1110 | BTREE_INSERT_NOFAIL|flags); |
087c2019 KO |
1111 | } |
1112 | ||
1113 | int bch2_btree_delete_range_trans(struct btree_trans *trans, enum btree_id id, | |
1114 | struct bpos start, struct bpos end, | |
1115 | u64 *journal_seq) | |
1c6fdbd8 | 1116 | { |
087c2019 | 1117 | struct btree_iter *iter; |
1c6fdbd8 KO |
1118 | struct bkey_s_c k; |
1119 | int ret = 0; | |
087c2019 KO |
1120 | |
1121 | iter = bch2_trans_get_iter(trans, id, start, BTREE_ITER_INTENT); | |
17758a6c | 1122 | retry: |
0564b167 | 1123 | while ((k = bch2_btree_iter_peek(iter)).k && |
0f238367 | 1124 | !(ret = bkey_err(k)) && |
0564b167 | 1125 | bkey_cmp(iter->pos, end) < 0) { |
1c6fdbd8 KO |
1126 | struct bkey_i delete; |
1127 | ||
163e885a | 1128 | bch2_trans_begin(trans); |
a8abd3a7 | 1129 | |
1c6fdbd8 KO |
1130 | bkey_init(&delete.k); |
1131 | ||
087c2019 KO |
1132 | /* |
1133 | * This could probably be more efficient for extents: | |
1134 | */ | |
1135 | ||
1c6fdbd8 KO |
1136 | /* |
1137 | * For extents, iter.pos won't necessarily be the same as | |
1138 | * bkey_start_pos(k.k) (for non extents they always will be the | |
1139 | * same). It's important that we delete starting from iter.pos | |
1140 | * because the range we want to delete could start in the middle | |
1141 | * of k. | |
1142 | * | |
1143 | * (bch2_btree_iter_peek() does guarantee that iter.pos >= | |
1144 | * bkey_start_pos(k.k)). | |
1145 | */ | |
0564b167 | 1146 | delete.k.p = iter->pos; |
1c6fdbd8 | 1147 | |
c4a94ae3 | 1148 | if (btree_node_type_is_extents(iter->btree_id)) { |
17758a6c KO |
1149 | unsigned max_sectors = |
1150 | KEY_SIZE_MAX & (~0 << trans->c->block_bits); | |
1151 | ||
1c6fdbd8 KO |
1152 | /* create the biggest key we can */ |
1153 | bch2_key_resize(&delete.k, max_sectors); | |
085ab693 | 1154 | bch2_cut_back(end, &delete); |
3c7f3b7a KO |
1155 | |
1156 | ret = bch2_extent_trim_atomic(&delete, iter); | |
1157 | if (ret) | |
1158 | break; | |
1c6fdbd8 KO |
1159 | } |
1160 | ||
2d594dfb | 1161 | bch2_trans_update(trans, iter, &delete, 0); |
17758a6c | 1162 | ret = bch2_trans_commit(trans, NULL, journal_seq, |
0564b167 | 1163 | BTREE_INSERT_NOFAIL); |
1c6fdbd8 KO |
1164 | if (ret) |
1165 | break; | |
1166 | ||
17758a6c | 1167 | bch2_trans_cond_resched(trans); |
1c6fdbd8 KO |
1168 | } |
1169 | ||
17758a6c KO |
1170 | if (ret == -EINTR) { |
1171 | ret = 0; | |
1172 | goto retry; | |
1173 | } | |
1174 | ||
087c2019 | 1175 | bch2_trans_iter_put(trans, iter); |
17758a6c | 1176 | return ret; |
17758a6c KO |
1177 | } |
1178 | ||
1179 | /* | |
1180 | * bch_btree_delete_range - delete everything within a given range | |
1181 | * | |
1182 | * Range is a half open interval - [start, end) | |
1183 | */ | |
1184 | int bch2_btree_delete_range(struct bch_fs *c, enum btree_id id, | |
1185 | struct bpos start, struct bpos end, | |
1186 | u64 *journal_seq) | |
1187 | { | |
087c2019 KO |
1188 | return bch2_trans_do(c, NULL, journal_seq, 0, |
1189 | bch2_btree_delete_range_trans(&trans, id, start, end, journal_seq)); | |
1c6fdbd8 | 1190 | } |