1 // SPDX-License-Identifier: GPL-2.0
4 #include "btree_update.h"
5 #include "btree_update_interior.h"
8 #include "btree_iter.h"
9 #include "btree_key_cache.h"
10 #include "btree_locking.h"
11 #include "btree_write_buffer.h"
16 #include "extent_update.h"
18 #include "journal_reclaim.h"
21 #include "subvolume.h"
25 #include <linux/prefetch.h>
26 #include <linux/sort.h>
29 * bch2_btree_path_peek_slot() for a cached iterator might return a key in a
32 static struct bkey_s_c bch2_btree_path_peek_slot_exact(struct btree_path *path, struct bkey *u)
34 struct bkey_s_c k = bch2_btree_path_peek_slot(path, u);
36 if (k.k && bpos_eq(path->pos, k.k->p))
41 return (struct bkey_s_c) { u, NULL };
44 static void verify_update_old_key(struct btree_trans *trans, struct btree_insert_entry *i)
46 #ifdef CONFIG_BCACHEFS_DEBUG
47 struct bch_fs *c = trans->c;
49 struct bkey_s_c k = bch2_btree_path_peek_slot_exact(i->path, &u);
51 if (unlikely(trans->journal_replay_not_finished)) {
53 bch2_journal_keys_peek_slot(c, i->btree_id, i->level, i->k->k.p);
56 k = bkey_i_to_s_c(j_k);
60 u.needs_whiteout = i->old_k.needs_whiteout;
62 BUG_ON(memcmp(&i->old_k, &u, sizeof(struct bkey)));
63 BUG_ON(i->old_v != k.v);
67 static int __must_check
68 bch2_trans_update_by_path(struct btree_trans *, struct btree_path *,
69 struct bkey_i *, enum btree_update_flags,
72 static inline int btree_insert_entry_cmp(const struct btree_insert_entry *l,
73 const struct btree_insert_entry *r)
75 return cmp_int(l->btree_id, r->btree_id) ?:
76 cmp_int(l->cached, r->cached) ?:
77 -cmp_int(l->level, r->level) ?:
78 bpos_cmp(l->k->k.p, r->k->k.p);
81 static inline struct btree_path_level *insert_l(struct btree_insert_entry *i)
83 return i->path->l + i->level;
86 static inline bool same_leaf_as_prev(struct btree_trans *trans,
87 struct btree_insert_entry *i)
89 return i != trans->updates &&
90 insert_l(&i[0])->b == insert_l(&i[-1])->b;
93 static inline bool same_leaf_as_next(struct btree_trans *trans,
94 struct btree_insert_entry *i)
96 return i + 1 < trans->updates + trans->nr_updates &&
97 insert_l(&i[0])->b == insert_l(&i[1])->b;
100 inline void bch2_btree_node_prep_for_write(struct btree_trans *trans,
101 struct btree_path *path,
104 struct bch_fs *c = trans->c;
106 if (unlikely(btree_node_just_written(b)) &&
107 bch2_btree_post_write_cleanup(c, b))
108 bch2_trans_node_reinit_iter(trans, b);
111 * If the last bset has been written, or if it's gotten too big - start
112 * a new bset to insert into:
114 if (want_new_bset(c, b))
115 bch2_btree_init_next(trans, b);
118 /* Inserting into a given leaf node (last stage of insert): */
120 /* Handle overwrites and do insert, for non extents: */
121 bool bch2_btree_bset_insert_key(struct btree_trans *trans,
122 struct btree_path *path,
124 struct btree_node_iter *node_iter,
125 struct bkey_i *insert)
127 struct bkey_packed *k;
128 unsigned clobber_u64s = 0, new_u64s = 0;
130 EBUG_ON(btree_node_just_written(b));
131 EBUG_ON(bset_written(b, btree_bset_last(b)));
132 EBUG_ON(bkey_deleted(&insert->k) && bkey_val_u64s(&insert->k));
133 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key));
134 EBUG_ON(bpos_gt(insert->k.p, b->data->max_key));
135 EBUG_ON(insert->k.u64s >
136 bch_btree_keys_u64s_remaining(trans->c, b));
138 k = bch2_btree_node_iter_peek_all(node_iter, b);
139 if (k && bkey_cmp_left_packed(b, k, &insert->k.p))
142 /* @k is the key being overwritten/deleted, if any: */
143 EBUG_ON(k && bkey_deleted(k));
145 /* Deleting, but not found? nothing to do: */
146 if (bkey_deleted(&insert->k) && !k)
149 if (bkey_deleted(&insert->k)) {
151 btree_account_key_drop(b, k);
152 k->type = KEY_TYPE_deleted;
154 if (k->needs_whiteout)
155 push_whiteout(trans->c, b, insert->k.p);
156 k->needs_whiteout = false;
158 if (k >= btree_bset_last(b)->start) {
159 clobber_u64s = k->u64s;
160 bch2_bset_delete(b, k, clobber_u64s);
163 bch2_btree_path_fix_key_modified(trans, b, k);
171 btree_account_key_drop(b, k);
172 k->type = KEY_TYPE_deleted;
174 insert->k.needs_whiteout = k->needs_whiteout;
175 k->needs_whiteout = false;
177 if (k >= btree_bset_last(b)->start) {
178 clobber_u64s = k->u64s;
181 bch2_btree_path_fix_key_modified(trans, b, k);
185 k = bch2_btree_node_iter_bset_pos(node_iter, b, bset_tree_last(b));
187 bch2_bset_insert(b, node_iter, k, insert, clobber_u64s);
190 if (clobber_u64s != new_u64s)
191 bch2_btree_node_iter_fix(trans, path, b, node_iter, k,
192 clobber_u64s, new_u64s);
196 static int __btree_node_flush(struct journal *j, struct journal_entry_pin *pin,
199 struct bch_fs *c = container_of(j, struct bch_fs, journal);
200 struct btree_write *w = container_of(pin, struct btree_write, journal);
201 struct btree *b = container_of(w, struct btree, writes[i]);
202 struct btree_trans trans;
203 unsigned long old, new, v;
204 unsigned idx = w - b->writes;
206 bch2_trans_init(&trans, c, 0, 0);
208 btree_node_lock_nopath_nofail(&trans, &b->c, SIX_LOCK_read);
209 v = READ_ONCE(b->flags);
214 if (!(old & (1 << BTREE_NODE_dirty)) ||
215 !!(old & (1 << BTREE_NODE_write_idx)) != idx ||
216 w->journal.seq != seq)
219 new &= ~BTREE_WRITE_TYPE_MASK;
220 new |= BTREE_WRITE_journal_reclaim;
221 new |= 1 << BTREE_NODE_need_write;
222 } while ((v = cmpxchg(&b->flags, old, new)) != old);
224 btree_node_write_if_need(c, b, SIX_LOCK_read);
225 six_unlock_read(&b->c.lock);
227 bch2_trans_exit(&trans);
231 int bch2_btree_node_flush0(struct journal *j, struct journal_entry_pin *pin, u64 seq)
233 return __btree_node_flush(j, pin, 0, seq);
236 int bch2_btree_node_flush1(struct journal *j, struct journal_entry_pin *pin, u64 seq)
238 return __btree_node_flush(j, pin, 1, seq);
241 inline void bch2_btree_add_journal_pin(struct bch_fs *c,
242 struct btree *b, u64 seq)
244 struct btree_write *w = btree_current_write(b);
246 bch2_journal_pin_add(&c->journal, seq, &w->journal,
247 btree_node_write_idx(b) == 0
248 ? bch2_btree_node_flush0
249 : bch2_btree_node_flush1);
253 * btree_insert_key - insert a key one key into a leaf node
255 inline void bch2_btree_insert_key_leaf(struct btree_trans *trans,
256 struct btree_path *path,
257 struct bkey_i *insert,
260 struct bch_fs *c = trans->c;
261 struct btree *b = path_l(path)->b;
262 struct bset_tree *t = bset_tree_last(b);
263 struct bset *i = bset(b, t);
264 int old_u64s = bset_u64s(t);
265 int old_live_u64s = b->nr.live_u64s;
266 int live_u64s_added, u64s_added;
268 if (unlikely(!bch2_btree_bset_insert_key(trans, path, b,
269 &path_l(path)->iter, insert)))
272 i->journal_seq = cpu_to_le64(max(journal_seq, le64_to_cpu(i->journal_seq)));
274 bch2_btree_add_journal_pin(c, b, journal_seq);
276 if (unlikely(!btree_node_dirty(b))) {
277 EBUG_ON(test_bit(BCH_FS_CLEAN_SHUTDOWN, &c->flags));
278 set_btree_node_dirty_acct(c, b);
281 live_u64s_added = (int) b->nr.live_u64s - old_live_u64s;
282 u64s_added = (int) bset_u64s(t) - old_u64s;
284 if (b->sib_u64s[0] != U16_MAX && live_u64s_added < 0)
285 b->sib_u64s[0] = max(0, (int) b->sib_u64s[0] + live_u64s_added);
286 if (b->sib_u64s[1] != U16_MAX && live_u64s_added < 0)
287 b->sib_u64s[1] = max(0, (int) b->sib_u64s[1] + live_u64s_added);
289 if (u64s_added > live_u64s_added &&
290 bch2_maybe_compact_whiteouts(c, b))
291 bch2_trans_node_reinit_iter(trans, b);
294 /* Cached btree updates: */
296 /* Normal update interface: */
298 static inline void btree_insert_entry_checks(struct btree_trans *trans,
299 struct btree_insert_entry *i)
301 BUG_ON(!bpos_eq(i->k->k.p, i->path->pos));
302 BUG_ON(i->cached != i->path->cached);
303 BUG_ON(i->level != i->path->level);
304 BUG_ON(i->btree_id != i->path->btree_id);
306 !(i->flags & BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE) &&
307 test_bit(JOURNAL_REPLAY_DONE, &trans->c->journal.flags) &&
308 i->k->k.p.snapshot &&
309 bch2_snapshot_is_internal_node(trans->c, i->k->k.p.snapshot));
313 bch2_trans_journal_preres_get_cold(struct btree_trans *trans, unsigned flags,
314 unsigned long trace_ip)
316 return drop_locks_do(trans,
317 bch2_journal_preres_get(&trans->c->journal,
318 &trans->journal_preres,
319 trans->journal_preres_u64s,
320 (flags & BCH_WATERMARK_MASK)));
323 static __always_inline int bch2_trans_journal_res_get(struct btree_trans *trans,
326 return bch2_journal_res_get(&trans->c->journal, &trans->journal_res,
327 trans->journal_u64s, flags);
330 #define JSET_ENTRY_LOG_U64s 4
332 static noinline void journal_transaction_name(struct btree_trans *trans)
334 struct bch_fs *c = trans->c;
335 struct journal *j = &c->journal;
336 struct jset_entry *entry =
337 bch2_journal_add_entry(j, &trans->journal_res,
338 BCH_JSET_ENTRY_log, 0, 0,
339 JSET_ENTRY_LOG_U64s);
340 struct jset_entry_log *l =
341 container_of(entry, struct jset_entry_log, entry);
343 strncpy(l->d, trans->fn, JSET_ENTRY_LOG_U64s * sizeof(u64));
346 static inline int btree_key_can_insert(struct btree_trans *trans,
347 struct btree *b, unsigned u64s)
349 struct bch_fs *c = trans->c;
351 if (!bch2_btree_node_insert_fits(c, b, u64s))
352 return -BCH_ERR_btree_insert_btree_node_full;
357 static int btree_key_can_insert_cached(struct btree_trans *trans, unsigned flags,
358 struct btree_path *path, unsigned u64s)
360 struct bch_fs *c = trans->c;
361 struct bkey_cached *ck = (void *) path->l[0].b;
362 struct btree_insert_entry *i;
364 struct bkey_i *new_k;
366 EBUG_ON(path->level);
368 if (!test_bit(BKEY_CACHED_DIRTY, &ck->flags) &&
369 bch2_btree_key_cache_must_wait(c) &&
370 !(flags & BTREE_INSERT_JOURNAL_RECLAIM))
371 return -BCH_ERR_btree_insert_need_journal_reclaim;
374 * bch2_varint_decode can read past the end of the buffer by at most 7
375 * bytes (it won't be used):
379 if (u64s <= ck->u64s)
382 new_u64s = roundup_pow_of_two(u64s);
383 new_k = krealloc(ck->k, new_u64s * sizeof(u64), GFP_NOFS);
385 bch_err(c, "error allocating memory for key cache key, btree %s u64s %u",
386 bch2_btree_ids[path->btree_id], new_u64s);
387 return -BCH_ERR_ENOMEM_btree_key_cache_insert;
390 trans_for_each_update(trans, i)
391 if (i->old_v == &ck->k->v)
392 i->old_v = &new_k->v;
401 static int run_one_mem_trigger(struct btree_trans *trans,
402 struct btree_insert_entry *i,
405 struct bkey_s_c old = { &i->old_k, i->old_v };
406 struct bkey_i *new = i->k;
407 const struct bkey_ops *old_ops = bch2_bkey_type_ops(old.k->type);
408 const struct bkey_ops *new_ops = bch2_bkey_type_ops(i->k->k.type);
411 verify_update_old_key(trans, i);
413 if (unlikely(flags & BTREE_TRIGGER_NORUN))
416 if (!btree_node_type_needs_gc(i->btree_id))
419 if (old_ops->atomic_trigger == new_ops->atomic_trigger &&
420 ((1U << old.k->type) & BTREE_TRIGGER_WANTS_OLD_AND_NEW)) {
421 ret = bch2_mark_key(trans, i->btree_id, i->level,
422 old, bkey_i_to_s_c(new),
423 BTREE_TRIGGER_INSERT|BTREE_TRIGGER_OVERWRITE|flags);
425 struct bkey _deleted = KEY(0, 0, 0);
426 struct bkey_s_c deleted = (struct bkey_s_c) { &_deleted, NULL };
428 _deleted.p = i->path->pos;
430 ret = bch2_mark_key(trans, i->btree_id, i->level,
431 deleted, bkey_i_to_s_c(new),
432 BTREE_TRIGGER_INSERT|flags) ?:
433 bch2_mark_key(trans, i->btree_id, i->level,
435 BTREE_TRIGGER_OVERWRITE|flags);
441 static int run_one_trans_trigger(struct btree_trans *trans, struct btree_insert_entry *i,
445 * Transactional triggers create new btree_insert_entries, so we can't
446 * pass them a pointer to a btree_insert_entry, that memory is going to
449 struct bkey old_k = i->old_k;
450 struct bkey_s_c old = { &old_k, i->old_v };
451 const struct bkey_ops *old_ops = bch2_bkey_type_ops(old.k->type);
452 const struct bkey_ops *new_ops = bch2_bkey_type_ops(i->k->k.type);
454 verify_update_old_key(trans, i);
456 if ((i->flags & BTREE_TRIGGER_NORUN) ||
457 !(BTREE_NODE_TYPE_HAS_TRANS_TRIGGERS & (1U << i->bkey_type)))
460 if (!i->insert_trigger_run &&
461 !i->overwrite_trigger_run &&
462 old_ops->trans_trigger == new_ops->trans_trigger &&
463 ((1U << old.k->type) & BTREE_TRIGGER_WANTS_OLD_AND_NEW)) {
464 i->overwrite_trigger_run = true;
465 i->insert_trigger_run = true;
466 return bch2_trans_mark_key(trans, i->btree_id, i->level, old, i->k,
467 BTREE_TRIGGER_INSERT|
468 BTREE_TRIGGER_OVERWRITE|
470 } else if (overwrite && !i->overwrite_trigger_run) {
471 i->overwrite_trigger_run = true;
472 return bch2_trans_mark_old(trans, i->btree_id, i->level, old, i->flags) ?: 1;
473 } else if (!overwrite && !i->insert_trigger_run) {
474 i->insert_trigger_run = true;
475 return bch2_trans_mark_new(trans, i->btree_id, i->level, i->k, i->flags) ?: 1;
481 static int run_btree_triggers(struct btree_trans *trans, enum btree_id btree_id,
482 struct btree_insert_entry *btree_id_start)
484 struct btree_insert_entry *i;
485 bool trans_trigger_run;
488 for (overwrite = 1; overwrite >= 0; --overwrite) {
491 * Running triggers will append more updates to the list of updates as
495 trans_trigger_run = false;
497 for (i = btree_id_start;
498 i < trans->updates + trans->nr_updates && i->btree_id <= btree_id;
500 if (i->btree_id != btree_id)
503 ret = run_one_trans_trigger(trans, i, overwrite);
507 trans_trigger_run = true;
509 } while (trans_trigger_run);
515 static int bch2_trans_commit_run_triggers(struct btree_trans *trans)
517 struct btree_insert_entry *i = NULL, *btree_id_start = trans->updates;
518 unsigned btree_id = 0;
523 * For a given btree, this algorithm runs insert triggers before
524 * overwrite triggers: this is so that when extents are being moved
525 * (e.g. by FALLOCATE_FL_INSERT_RANGE), we don't drop references before
528 for (btree_id = 0; btree_id < BTREE_ID_NR; btree_id++) {
529 if (btree_id == BTREE_ID_alloc)
532 while (btree_id_start < trans->updates + trans->nr_updates &&
533 btree_id_start->btree_id < btree_id)
536 ret = run_btree_triggers(trans, btree_id, btree_id_start);
541 trans_for_each_update(trans, i) {
542 if (i->btree_id > BTREE_ID_alloc)
544 if (i->btree_id == BTREE_ID_alloc) {
545 ret = run_btree_triggers(trans, BTREE_ID_alloc, i);
552 #ifdef CONFIG_BCACHEFS_DEBUG
553 trans_for_each_update(trans, i)
554 BUG_ON(!(i->flags & BTREE_TRIGGER_NORUN) &&
555 (BTREE_NODE_TYPE_HAS_TRANS_TRIGGERS & (1U << i->bkey_type)) &&
556 (!i->insert_trigger_run || !i->overwrite_trigger_run));
561 static noinline int bch2_trans_commit_run_gc_triggers(struct btree_trans *trans)
563 struct bch_fs *c = trans->c;
564 struct btree_insert_entry *i;
567 trans_for_each_update(trans, i) {
569 * XXX: synchronization of cached update triggers with gc
570 * XXX: synchronization of interior node updates with gc
572 BUG_ON(i->cached || i->level);
574 if (gc_visited(c, gc_pos_btree_node(insert_l(i)->b))) {
575 ret = run_one_mem_trigger(trans, i, i->flags|BTREE_TRIGGER_GC);
585 bch2_trans_commit_write_locked(struct btree_trans *trans, unsigned flags,
586 struct btree_insert_entry **stopped_at,
587 unsigned long trace_ip)
589 struct bch_fs *c = trans->c;
590 struct btree_insert_entry *i;
591 struct btree_write_buffered_key *wb;
592 struct btree_trans_commit_hook *h;
594 bool marking = false;
598 trace_and_count(c, trans_restart_fault_inject, trans, trace_ip);
599 return btree_trans_restart_nounlock(trans, BCH_ERR_transaction_restart_fault_inject);
603 * Check if the insert will fit in the leaf node with the write lock
604 * held, otherwise another thread could write the node changing the
605 * amount of space available:
608 prefetch(&trans->c->journal.flags);
610 trans_for_each_update(trans, i) {
611 /* Multiple inserts might go to same leaf: */
612 if (!same_leaf_as_prev(trans, i))
615 u64s += i->k->k.u64s;
617 ? btree_key_can_insert(trans, insert_l(i)->b, u64s)
618 : btree_key_can_insert_cached(trans, flags, i->path, u64s);
624 if (btree_node_type_needs_gc(i->bkey_type))
628 if (trans->nr_wb_updates &&
629 trans->nr_wb_updates + c->btree_write_buffer.state.nr > c->btree_write_buffer.size)
630 return -BCH_ERR_btree_insert_need_flush_buffer;
633 * Don't get journal reservation until after we know insert will
636 if (likely(!(flags & BTREE_INSERT_JOURNAL_REPLAY))) {
637 ret = bch2_trans_journal_res_get(trans,
638 (flags & BCH_WATERMARK_MASK)|
639 JOURNAL_RES_GET_NONBLOCK);
643 if (unlikely(trans->journal_transaction_names))
644 journal_transaction_name(trans);
646 trans->journal_res.seq = c->journal.replay_journal_seq;
650 * Not allowed to fail after we've gotten our journal reservation - we
654 if (IS_ENABLED(CONFIG_BCACHEFS_DEBUG) &&
655 !(flags & BTREE_INSERT_JOURNAL_REPLAY)) {
656 if (bch2_journal_seq_verify)
657 trans_for_each_update(trans, i)
658 i->k->k.version.lo = trans->journal_res.seq;
659 else if (bch2_inject_invalid_keys)
660 trans_for_each_update(trans, i)
661 i->k->k.version = MAX_VERSION;
664 if (trans->fs_usage_deltas &&
665 bch2_trans_fs_usage_apply(trans, trans->fs_usage_deltas))
666 return -BCH_ERR_btree_insert_need_mark_replicas;
668 if (trans->nr_wb_updates) {
669 EBUG_ON(flags & BTREE_INSERT_JOURNAL_REPLAY);
671 ret = bch2_btree_insert_keys_write_buffer(trans);
673 goto revert_fs_usage;
678 ret = h->fn(trans, h);
680 goto revert_fs_usage;
684 trans_for_each_update(trans, i)
685 if (BTREE_NODE_TYPE_HAS_MEM_TRIGGERS & (1U << i->bkey_type)) {
686 ret = run_one_mem_trigger(trans, i, i->flags);
691 if (unlikely(c->gc_pos.phase)) {
692 ret = bch2_trans_commit_run_gc_triggers(trans);
697 if (unlikely(trans->extra_journal_entries.nr)) {
698 memcpy_u64s_small(journal_res_entry(&c->journal, &trans->journal_res),
699 trans->extra_journal_entries.data,
700 trans->extra_journal_entries.nr);
702 trans->journal_res.offset += trans->extra_journal_entries.nr;
703 trans->journal_res.u64s -= trans->extra_journal_entries.nr;
706 if (likely(!(flags & BTREE_INSERT_JOURNAL_REPLAY))) {
707 struct journal *j = &c->journal;
708 struct jset_entry *entry;
710 trans_for_each_update(trans, i) {
711 if (i->key_cache_already_flushed)
714 if (i->flags & BTREE_UPDATE_NOJOURNAL)
717 verify_update_old_key(trans, i);
719 if (trans->journal_transaction_names) {
720 entry = bch2_journal_add_entry(j, &trans->journal_res,
721 BCH_JSET_ENTRY_overwrite,
722 i->btree_id, i->level,
724 bkey_reassemble(&entry->start[0],
725 (struct bkey_s_c) { &i->old_k, i->old_v });
728 entry = bch2_journal_add_entry(j, &trans->journal_res,
729 BCH_JSET_ENTRY_btree_keys,
730 i->btree_id, i->level,
732 bkey_copy(&entry->start[0], i->k);
735 trans_for_each_wb_update(trans, wb) {
736 entry = bch2_journal_add_entry(j, &trans->journal_res,
737 BCH_JSET_ENTRY_btree_keys,
740 bkey_copy(&entry->start[0], &wb->k);
743 if (trans->journal_seq)
744 *trans->journal_seq = trans->journal_res.seq;
747 trans_for_each_update(trans, i) {
748 i->k->k.needs_whiteout = false;
751 u64 seq = trans->journal_res.seq;
753 if (i->flags & BTREE_UPDATE_PREJOURNAL)
756 bch2_btree_insert_key_leaf(trans, i->path, i->k, seq);
757 } else if (!i->key_cache_already_flushed)
758 bch2_btree_insert_key_cached(trans, flags, i);
760 bch2_btree_key_cache_drop(trans, i->path);
761 btree_path_set_dirty(i->path, BTREE_ITER_NEED_TRAVERSE);
769 if (trans->fs_usage_deltas)
770 bch2_trans_fs_usage_revert(trans, trans->fs_usage_deltas);
774 static noinline int trans_lock_write_fail(struct btree_trans *trans, struct btree_insert_entry *i)
776 while (--i >= trans->updates) {
777 if (same_leaf_as_prev(trans, i))
780 bch2_btree_node_unlock_write(trans, i->path, insert_l(i)->b);
783 trace_and_count(trans->c, trans_restart_would_deadlock_write, trans);
784 return btree_trans_restart(trans, BCH_ERR_transaction_restart_would_deadlock_write);
787 static inline int trans_lock_write(struct btree_trans *trans)
789 struct btree_insert_entry *i;
791 trans_for_each_update(trans, i) {
792 if (same_leaf_as_prev(trans, i))
795 if (bch2_btree_node_lock_write(trans, i->path, &insert_l(i)->b->c))
796 return trans_lock_write_fail(trans, i);
799 bch2_btree_node_prep_for_write(trans, i->path, insert_l(i)->b);
805 static noinline void bch2_drop_overwrites_from_journal(struct btree_trans *trans)
807 struct btree_insert_entry *i;
808 struct btree_write_buffered_key *wb;
810 trans_for_each_update(trans, i)
811 bch2_journal_key_overwritten(trans->c, i->btree_id, i->level, i->k->k.p);
813 trans_for_each_wb_update(trans, wb)
814 bch2_journal_key_overwritten(trans->c, wb->btree, 0, wb->k.k.p);
817 #ifdef CONFIG_BCACHEFS_DEBUG
818 static noinline int bch2_trans_commit_bkey_invalid(struct btree_trans *trans, unsigned flags,
819 struct btree_insert_entry *i,
820 struct printbuf *err)
822 struct bch_fs *c = trans->c;
823 int rw = (flags & BTREE_INSERT_JOURNAL_REPLAY) ? READ : WRITE;
826 prt_printf(err, "invalid bkey on insert from %s -> %ps",
827 trans->fn, (void *) i->ip_allocated);
829 printbuf_indent_add(err, 2);
831 bch2_bkey_val_to_text(err, c, bkey_i_to_s_c(i->k));
834 bch2_bkey_invalid(c, bkey_i_to_s_c(i->k),
835 i->bkey_type, rw, err);
836 bch2_print_string_as_lines(KERN_ERR, err->buf);
838 bch2_inconsistent_error(c);
839 bch2_dump_trans_updates(trans);
847 * Get journal reservation, take write locks, and attempt to do btree update(s):
849 static inline int do_bch2_trans_commit(struct btree_trans *trans, unsigned flags,
850 struct btree_insert_entry **stopped_at,
851 unsigned long trace_ip)
853 struct bch_fs *c = trans->c;
854 struct btree_insert_entry *i;
855 int ret, u64s_delta = 0;
857 #ifdef CONFIG_BCACHEFS_DEBUG
858 struct printbuf buf = PRINTBUF;
860 trans_for_each_update(trans, i) {
861 enum bkey_invalid_flags invalid_flags = 0;
863 if (!(flags & BTREE_INSERT_JOURNAL_REPLAY))
864 invalid_flags |= BKEY_INVALID_WRITE|BKEY_INVALID_COMMIT;
866 if (unlikely(bch2_bkey_invalid(c, bkey_i_to_s_c(i->k),
867 i->bkey_type, invalid_flags, &buf)))
868 return bch2_trans_commit_bkey_invalid(trans, flags, i, &buf);
869 btree_insert_entry_checks(trans, i);
874 trans_for_each_update(trans, i) {
878 u64s_delta += !bkey_deleted(&i->k->k) ? i->k->k.u64s : 0;
879 u64s_delta -= i->old_btree_u64s;
881 if (!same_leaf_as_next(trans, i)) {
882 if (u64s_delta <= 0) {
883 ret = bch2_foreground_maybe_merge(trans, i->path,
893 ret = bch2_journal_preres_get(&c->journal,
894 &trans->journal_preres, trans->journal_preres_u64s,
895 (flags & BCH_WATERMARK_MASK)|JOURNAL_RES_GET_NONBLOCK);
896 if (unlikely(ret == -BCH_ERR_journal_preres_get_blocked))
897 ret = bch2_trans_journal_preres_get_cold(trans, flags, trace_ip);
901 ret = trans_lock_write(trans);
905 ret = bch2_trans_commit_write_locked(trans, flags, stopped_at, trace_ip);
907 if (!ret && unlikely(trans->journal_replay_not_finished))
908 bch2_drop_overwrites_from_journal(trans);
910 trans_for_each_update(trans, i)
911 if (!same_leaf_as_prev(trans, i))
912 bch2_btree_node_unlock_write_inlined(trans, i->path,
915 if (!ret && trans->journal_pin)
916 bch2_journal_pin_add(&c->journal, trans->journal_res.seq,
917 trans->journal_pin, NULL);
920 * Drop journal reservation after dropping write locks, since dropping
921 * the journal reservation may kick off a journal write:
923 bch2_journal_res_put(&c->journal, &trans->journal_res);
928 bch2_trans_downgrade(trans);
933 static int journal_reclaim_wait_done(struct bch_fs *c)
935 int ret = bch2_journal_error(&c->journal) ?:
936 !bch2_btree_key_cache_must_wait(c);
939 journal_reclaim_kick(&c->journal);
944 int bch2_trans_commit_error(struct btree_trans *trans, unsigned flags,
945 struct btree_insert_entry *i,
946 int ret, unsigned long trace_ip)
948 struct bch_fs *c = trans->c;
951 case -BCH_ERR_btree_insert_btree_node_full:
952 ret = bch2_btree_split_leaf(trans, i->path, flags);
953 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
954 trace_and_count(c, trans_restart_btree_node_split, trans, trace_ip, i->path);
956 case -BCH_ERR_btree_insert_need_mark_replicas:
957 ret = drop_locks_do(trans,
958 bch2_replicas_delta_list_mark(c, trans->fs_usage_deltas));
960 case -BCH_ERR_journal_res_get_blocked:
962 * XXX: this should probably be a separate BTREE_INSERT_NONBLOCK
965 if ((flags & BTREE_INSERT_JOURNAL_RECLAIM) &&
966 (flags & BCH_WATERMARK_MASK) != BCH_WATERMARK_reclaim) {
967 ret = -BCH_ERR_journal_reclaim_would_deadlock;
971 ret = drop_locks_do(trans,
972 bch2_trans_journal_res_get(trans,
973 (flags & BCH_WATERMARK_MASK)|
974 JOURNAL_RES_GET_CHECK));
976 case -BCH_ERR_btree_insert_need_journal_reclaim:
977 bch2_trans_unlock(trans);
979 trace_and_count(c, trans_blocked_journal_reclaim, trans, trace_ip);
981 wait_event_freezable(c->journal.reclaim_wait,
982 (ret = journal_reclaim_wait_done(c)));
986 ret = bch2_trans_relock(trans);
988 case -BCH_ERR_btree_insert_need_flush_buffer: {
989 struct btree_write_buffer *wb = &c->btree_write_buffer;
993 if (wb->state.nr > wb->size * 3 / 4) {
994 bch2_trans_unlock(trans);
995 mutex_lock(&wb->flush_lock);
997 if (wb->state.nr > wb->size * 3 / 4) {
998 bch2_trans_begin(trans);
999 ret = __bch2_btree_write_buffer_flush(trans,
1000 flags|BTREE_INSERT_NOCHECK_RW, true);
1002 trace_and_count(c, trans_restart_write_buffer_flush, trans, _THIS_IP_);
1003 ret = btree_trans_restart(trans, BCH_ERR_transaction_restart_write_buffer_flush);
1006 mutex_unlock(&wb->flush_lock);
1007 ret = bch2_trans_relock(trans);
1017 BUG_ON(bch2_err_matches(ret, BCH_ERR_transaction_restart) != !!trans->restarted);
1019 bch2_fs_inconsistent_on(bch2_err_matches(ret, ENOSPC) &&
1020 !(flags & BTREE_INSERT_NOWAIT) &&
1021 (flags & BTREE_INSERT_NOFAIL), c,
1022 "%s: incorrectly got %s\n", __func__, bch2_err_str(ret));
1028 bch2_trans_commit_get_rw_cold(struct btree_trans *trans, unsigned flags)
1030 struct bch_fs *c = trans->c;
1033 if (likely(!(flags & BTREE_INSERT_LAZY_RW)) ||
1034 test_bit(BCH_FS_STARTED, &c->flags))
1035 return -BCH_ERR_erofs_trans_commit;
1037 ret = drop_locks_do(trans, bch2_fs_read_write_early(c));
1041 bch2_write_ref_get(c, BCH_WRITE_REF_trans);
1046 * This is for updates done in the early part of fsck - btree_gc - before we've
1047 * gone RW. we only add the new key to the list of keys for journal replay to
1051 do_bch2_trans_commit_to_journal_replay(struct btree_trans *trans)
1053 struct bch_fs *c = trans->c;
1054 struct btree_insert_entry *i;
1057 trans_for_each_update(trans, i) {
1058 ret = bch2_journal_key_insert(c, i->btree_id, i->level, i->k);
1066 int __bch2_trans_commit(struct btree_trans *trans, unsigned flags)
1068 struct bch_fs *c = trans->c;
1069 struct btree_insert_entry *i = NULL;
1070 struct btree_write_buffered_key *wb;
1074 if (!trans->nr_updates &&
1075 !trans->nr_wb_updates &&
1076 !trans->extra_journal_entries.nr)
1079 if (flags & BTREE_INSERT_GC_LOCK_HELD)
1080 lockdep_assert_held(&c->gc_lock);
1082 ret = bch2_trans_commit_run_triggers(trans);
1086 if (unlikely(!test_bit(BCH_FS_MAY_GO_RW, &c->flags))) {
1087 ret = do_bch2_trans_commit_to_journal_replay(trans);
1091 if (!(flags & BTREE_INSERT_NOCHECK_RW) &&
1092 unlikely(!bch2_write_ref_tryget(c, BCH_WRITE_REF_trans))) {
1093 ret = bch2_trans_commit_get_rw_cold(trans, flags);
1098 if (c->btree_write_buffer.state.nr > c->btree_write_buffer.size / 2 &&
1099 mutex_trylock(&c->btree_write_buffer.flush_lock)) {
1100 bch2_trans_begin(trans);
1101 bch2_trans_unlock(trans);
1103 ret = __bch2_btree_write_buffer_flush(trans,
1104 flags|BTREE_INSERT_NOCHECK_RW, true);
1106 trace_and_count(c, trans_restart_write_buffer_flush, trans, _THIS_IP_);
1107 ret = btree_trans_restart(trans, BCH_ERR_transaction_restart_write_buffer_flush);
1112 EBUG_ON(test_bit(BCH_FS_CLEAN_SHUTDOWN, &c->flags));
1114 memset(&trans->journal_preres, 0, sizeof(trans->journal_preres));
1116 trans->journal_u64s = trans->extra_journal_entries.nr;
1117 trans->journal_preres_u64s = 0;
1119 trans->journal_transaction_names = READ_ONCE(c->opts.journal_transaction_names);
1121 if (trans->journal_transaction_names)
1122 trans->journal_u64s += jset_u64s(JSET_ENTRY_LOG_U64s);
1124 trans_for_each_update(trans, i) {
1125 EBUG_ON(!i->path->should_be_locked);
1127 ret = bch2_btree_path_upgrade(trans, i->path, i->level + 1);
1131 EBUG_ON(!btree_node_intent_locked(i->path, i->level));
1133 if (i->key_cache_already_flushed)
1136 /* we're going to journal the key being updated: */
1137 u64s = jset_u64s(i->k->k.u64s);
1139 likely(!(flags & BTREE_INSERT_JOURNAL_REPLAY)))
1140 trans->journal_preres_u64s += u64s;
1142 if (i->flags & BTREE_UPDATE_NOJOURNAL)
1145 trans->journal_u64s += u64s;
1147 /* and we're also going to log the overwrite: */
1148 if (trans->journal_transaction_names)
1149 trans->journal_u64s += jset_u64s(i->old_k.u64s);
1152 trans_for_each_wb_update(trans, wb)
1153 trans->journal_u64s += jset_u64s(wb->k.k.u64s);
1155 if (trans->extra_journal_res) {
1156 ret = bch2_disk_reservation_add(c, trans->disk_res,
1157 trans->extra_journal_res,
1158 (flags & BTREE_INSERT_NOFAIL)
1159 ? BCH_DISK_RESERVATION_NOFAIL : 0);
1164 bch2_trans_verify_not_in_restart(trans);
1165 memset(&trans->journal_res, 0, sizeof(trans->journal_res));
1167 ret = do_bch2_trans_commit(trans, flags, &i, _RET_IP_);
1169 /* make sure we didn't drop or screw up locks: */
1170 bch2_trans_verify_locks(trans);
1175 trace_and_count(c, transaction_commit, trans, _RET_IP_);
1177 bch2_journal_preres_put(&c->journal, &trans->journal_preres);
1179 if (likely(!(flags & BTREE_INSERT_NOCHECK_RW)))
1180 bch2_write_ref_put(c, BCH_WRITE_REF_trans);
1182 bch2_trans_reset_updates(trans);
1186 ret = bch2_trans_commit_error(trans, flags, i, ret, _RET_IP_);
1193 static noinline int __check_pos_snapshot_overwritten(struct btree_trans *trans,
1197 struct bch_fs *c = trans->c;
1198 struct btree_iter iter;
1202 bch2_trans_iter_init(trans, &iter, id, pos,
1203 BTREE_ITER_NOT_EXTENTS|
1204 BTREE_ITER_ALL_SNAPSHOTS);
1206 k = bch2_btree_iter_prev(&iter);
1214 if (!bkey_eq(pos, k.k->p))
1217 if (bch2_snapshot_is_ancestor(c, k.k->p.snapshot, pos.snapshot)) {
1222 bch2_trans_iter_exit(trans, &iter);
1227 static inline int check_pos_snapshot_overwritten(struct btree_trans *trans,
1231 if (!btree_type_has_snapshots(id) ||
1232 bch2_snapshot_is_leaf(trans->c, pos.snapshot))
1235 return __check_pos_snapshot_overwritten(trans, id, pos);
1238 static noinline int extent_front_merge(struct btree_trans *trans,
1239 struct btree_iter *iter,
1241 struct bkey_i **insert,
1242 enum btree_update_flags flags)
1244 struct bch_fs *c = trans->c;
1245 struct bkey_i *update;
1248 update = bch2_bkey_make_mut_noupdate(trans, k);
1249 ret = PTR_ERR_OR_ZERO(update);
1253 if (!bch2_bkey_merge(c, bkey_i_to_s(update), bkey_i_to_s_c(*insert)))
1256 ret = check_pos_snapshot_overwritten(trans, iter->btree_id, k.k->p) ?:
1257 check_pos_snapshot_overwritten(trans, iter->btree_id, (*insert)->k.p);
1263 ret = bch2_btree_delete_at(trans, iter, flags);
1271 static noinline int extent_back_merge(struct btree_trans *trans,
1272 struct btree_iter *iter,
1273 struct bkey_i *insert,
1276 struct bch_fs *c = trans->c;
1279 ret = check_pos_snapshot_overwritten(trans, iter->btree_id, insert->k.p) ?:
1280 check_pos_snapshot_overwritten(trans, iter->btree_id, k.k->p);
1286 bch2_bkey_merge(c, bkey_i_to_s(insert), k);
1291 * When deleting, check if we need to emit a whiteout (because we're overwriting
1292 * something in an ancestor snapshot)
1294 static int need_whiteout_for_snapshot(struct btree_trans *trans,
1295 enum btree_id btree_id, struct bpos pos)
1297 struct btree_iter iter;
1299 u32 snapshot = pos.snapshot;
1302 if (!bch2_snapshot_parent(trans->c, pos.snapshot))
1307 for_each_btree_key_norestart(trans, iter, btree_id, pos,
1308 BTREE_ITER_ALL_SNAPSHOTS|
1309 BTREE_ITER_NOPRESERVE, k, ret) {
1310 if (!bkey_eq(k.k->p, pos))
1313 if (bch2_snapshot_is_ancestor(trans->c, snapshot,
1315 ret = !bkey_whiteout(k.k);
1319 bch2_trans_iter_exit(trans, &iter);
1324 int __bch2_insert_snapshot_whiteouts(struct btree_trans *trans,
1326 struct bpos old_pos,
1327 struct bpos new_pos)
1329 struct bch_fs *c = trans->c;
1330 struct btree_iter old_iter, new_iter;
1331 struct bkey_s_c old_k, new_k;
1333 struct bkey_i *update;
1336 if (!bch2_snapshot_has_children(c, old_pos.snapshot))
1341 bch2_trans_iter_init(trans, &old_iter, id, old_pos,
1342 BTREE_ITER_NOT_EXTENTS|
1343 BTREE_ITER_ALL_SNAPSHOTS);
1344 while ((old_k = bch2_btree_iter_prev(&old_iter)).k &&
1345 !(ret = bkey_err(old_k)) &&
1346 bkey_eq(old_pos, old_k.k->p)) {
1347 struct bpos whiteout_pos =
1348 SPOS(new_pos.inode, new_pos.offset, old_k.k->p.snapshot);;
1350 if (!bch2_snapshot_is_ancestor(c, old_k.k->p.snapshot, old_pos.snapshot) ||
1351 snapshot_list_has_ancestor(c, &s, old_k.k->p.snapshot))
1354 new_k = bch2_bkey_get_iter(trans, &new_iter, id, whiteout_pos,
1355 BTREE_ITER_NOT_EXTENTS|
1357 ret = bkey_err(new_k);
1361 if (new_k.k->type == KEY_TYPE_deleted) {
1362 update = bch2_trans_kmalloc(trans, sizeof(struct bkey_i));
1363 ret = PTR_ERR_OR_ZERO(update);
1367 bkey_init(&update->k);
1368 update->k.p = whiteout_pos;
1369 update->k.type = KEY_TYPE_whiteout;
1371 ret = bch2_trans_update(trans, &new_iter, update,
1372 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
1374 bch2_trans_iter_exit(trans, &new_iter);
1376 ret = snapshot_list_add(c, &s, old_k.k->p.snapshot);
1380 bch2_trans_iter_exit(trans, &old_iter);
1386 int bch2_trans_update_extent(struct btree_trans *trans,
1387 struct btree_iter *orig_iter,
1388 struct bkey_i *insert,
1389 enum btree_update_flags flags)
1391 struct btree_iter iter;
1392 struct bpos start = bkey_start_pos(&insert->k);
1393 struct bkey_i *update;
1395 enum btree_id btree_id = orig_iter->btree_id;
1396 int ret = 0, compressed_sectors;
1398 bch2_trans_iter_init(trans, &iter, btree_id, start,
1400 BTREE_ITER_WITH_UPDATES|
1401 BTREE_ITER_NOT_EXTENTS);
1402 k = bch2_btree_iter_peek_upto(&iter, POS(insert->k.p.inode, U64_MAX));
1403 if ((ret = bkey_err(k)))
1408 if (bkey_eq(k.k->p, bkey_start_pos(&insert->k))) {
1409 if (bch2_bkey_maybe_mergable(k.k, &insert->k)) {
1410 ret = extent_front_merge(trans, &iter, k, &insert, flags);
1418 while (bkey_gt(insert->k.p, bkey_start_pos(k.k))) {
1419 bool front_split = bkey_lt(bkey_start_pos(k.k), start);
1420 bool back_split = bkey_gt(k.k->p, insert->k.p);
1423 * If we're going to be splitting a compressed extent, note it
1424 * so that __bch2_trans_commit() can increase our disk
1427 if (((front_split && back_split) ||
1428 ((front_split || back_split) && k.k->p.snapshot != insert->k.p.snapshot)) &&
1429 (compressed_sectors = bch2_bkey_sectors_compressed(k)))
1430 trans->extra_journal_res += compressed_sectors;
1433 update = bch2_bkey_make_mut_noupdate(trans, k);
1434 if ((ret = PTR_ERR_OR_ZERO(update)))
1437 bch2_cut_back(start, update);
1439 ret = bch2_insert_snapshot_whiteouts(trans, btree_id,
1440 k.k->p, update->k.p) ?:
1441 bch2_btree_insert_nonextent(trans, btree_id, update,
1442 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE|flags);
1447 if (k.k->p.snapshot != insert->k.p.snapshot &&
1448 (front_split || back_split)) {
1449 update = bch2_bkey_make_mut_noupdate(trans, k);
1450 if ((ret = PTR_ERR_OR_ZERO(update)))
1453 bch2_cut_front(start, update);
1454 bch2_cut_back(insert->k.p, update);
1456 ret = bch2_insert_snapshot_whiteouts(trans, btree_id,
1457 k.k->p, update->k.p) ?:
1458 bch2_btree_insert_nonextent(trans, btree_id, update,
1459 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE|flags);
1464 if (bkey_le(k.k->p, insert->k.p)) {
1465 update = bch2_trans_kmalloc(trans, sizeof(*update));
1466 if ((ret = PTR_ERR_OR_ZERO(update)))
1469 bkey_init(&update->k);
1470 update->k.p = k.k->p;
1471 update->k.p.snapshot = insert->k.p.snapshot;
1473 if (insert->k.p.snapshot != k.k->p.snapshot) {
1474 update->k.type = KEY_TYPE_whiteout;
1475 } else if (btree_type_has_snapshots(btree_id)) {
1476 ret = need_whiteout_for_snapshot(trans, btree_id, update->k.p);
1480 update->k.type = KEY_TYPE_whiteout;
1483 ret = bch2_btree_insert_nonextent(trans, btree_id, update,
1484 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE|flags);
1490 update = bch2_bkey_make_mut_noupdate(trans, k);
1491 if ((ret = PTR_ERR_OR_ZERO(update)))
1494 bch2_cut_front(insert->k.p, update);
1496 ret = bch2_trans_update_by_path(trans, iter.path, update,
1497 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE|
1504 bch2_btree_iter_advance(&iter);
1505 k = bch2_btree_iter_peek_upto(&iter, POS(insert->k.p.inode, U64_MAX));
1506 if ((ret = bkey_err(k)))
1512 if (bch2_bkey_maybe_mergable(&insert->k, k.k)) {
1513 ret = extent_back_merge(trans, &iter, insert, k);
1518 if (!bkey_deleted(&insert->k)) {
1520 * Rewinding iterators is expensive: get a new one and the one
1521 * that points to the start of insert will be cloned from:
1523 bch2_trans_iter_exit(trans, &iter);
1524 bch2_trans_iter_init(trans, &iter, btree_id, insert->k.p,
1525 BTREE_ITER_NOT_EXTENTS|
1527 ret = bch2_btree_iter_traverse(&iter) ?:
1528 bch2_trans_update(trans, &iter, insert, flags);
1531 bch2_trans_iter_exit(trans, &iter);
1536 static noinline int flush_new_cached_update(struct btree_trans *trans,
1537 struct btree_path *path,
1538 struct btree_insert_entry *i,
1539 enum btree_update_flags flags,
1542 struct btree_path *btree_path;
1546 btree_path = bch2_path_get(trans, path->btree_id, path->pos, 1, 0,
1547 BTREE_ITER_INTENT, _THIS_IP_);
1548 ret = bch2_btree_path_traverse(trans, btree_path, 0);
1553 * The old key in the insert entry might actually refer to an existing
1554 * key in the btree that has been deleted from cache and not yet
1555 * flushed. Check for this and skip the flush so we don't run triggers
1556 * against a stale key.
1558 bch2_btree_path_peek_slot_exact(btree_path, &k);
1559 if (!bkey_deleted(&k))
1562 i->key_cache_already_flushed = true;
1563 i->flags |= BTREE_TRIGGER_NORUN;
1565 btree_path_set_should_be_locked(btree_path);
1566 ret = bch2_trans_update_by_path(trans, btree_path, i->k, flags, ip);
1568 bch2_path_put(trans, btree_path, true);
1572 static int __must_check
1573 bch2_trans_update_by_path(struct btree_trans *trans, struct btree_path *path,
1574 struct bkey_i *k, enum btree_update_flags flags,
1577 struct bch_fs *c = trans->c;
1578 struct btree_insert_entry *i, n;
1582 EBUG_ON(!path->should_be_locked);
1583 EBUG_ON(trans->nr_updates >= BTREE_ITER_MAX);
1584 EBUG_ON(!bpos_eq(k->k.p, path->pos));
1587 * The transaction journal res hasn't been allocated at this point.
1588 * That occurs at commit time. Reuse the seq field to pass in the seq
1589 * of a prejournaled key.
1591 if (flags & BTREE_UPDATE_PREJOURNAL)
1592 seq = trans->journal_res.seq;
1594 n = (struct btree_insert_entry) {
1596 .bkey_type = __btree_node_type(path->level, path->btree_id),
1597 .btree_id = path->btree_id,
1598 .level = path->level,
1599 .cached = path->cached,
1606 #ifdef CONFIG_BCACHEFS_DEBUG
1607 trans_for_each_update(trans, i)
1608 BUG_ON(i != trans->updates &&
1609 btree_insert_entry_cmp(i - 1, i) >= 0);
1613 * Pending updates are kept sorted: first, find position of new update,
1614 * then delete/trim any updates the new update overwrites:
1616 trans_for_each_update(trans, i) {
1617 cmp = btree_insert_entry_cmp(&n, i);
1622 if (!cmp && i < trans->updates + trans->nr_updates) {
1623 EBUG_ON(i->insert_trigger_run || i->overwrite_trigger_run);
1625 bch2_path_put(trans, i->path, true);
1627 i->cached = n.cached;
1631 i->ip_allocated = n.ip_allocated;
1633 array_insert_item(trans->updates, trans->nr_updates,
1634 i - trans->updates, n);
1636 i->old_v = bch2_btree_path_peek_slot_exact(path, &i->old_k).v;
1637 i->old_btree_u64s = !bkey_deleted(&i->old_k) ? i->old_k.u64s : 0;
1639 if (unlikely(trans->journal_replay_not_finished)) {
1640 struct bkey_i *j_k =
1641 bch2_journal_keys_peek_slot(c, n.btree_id, n.level, k->k.p);
1650 __btree_path_get(i->path, true);
1653 * If a key is present in the key cache, it must also exist in the
1654 * btree - this is necessary for cache coherency. When iterating over
1655 * a btree that's cached in the key cache, the btree iter code checks
1656 * the key cache - but the key has to exist in the btree for that to
1659 if (path->cached && bkey_deleted(&i->old_k))
1660 return flush_new_cached_update(trans, path, i, flags, ip);
1665 int __must_check bch2_trans_update(struct btree_trans *trans, struct btree_iter *iter,
1666 struct bkey_i *k, enum btree_update_flags flags)
1668 struct btree_path *path = iter->update_path ?: iter->path;
1669 struct bkey_cached *ck;
1672 if (iter->flags & BTREE_ITER_IS_EXTENTS)
1673 return bch2_trans_update_extent(trans, iter, k, flags);
1675 if (bkey_deleted(&k->k) &&
1676 !(flags & BTREE_UPDATE_KEY_CACHE_RECLAIM) &&
1677 (iter->flags & BTREE_ITER_FILTER_SNAPSHOTS)) {
1678 ret = need_whiteout_for_snapshot(trans, iter->btree_id, k->k.p);
1679 if (unlikely(ret < 0))
1683 k->k.type = KEY_TYPE_whiteout;
1687 * Ensure that updates to cached btrees go to the key cache:
1689 if (!(flags & BTREE_UPDATE_KEY_CACHE_RECLAIM) &&
1692 btree_id_cached(trans->c, path->btree_id)) {
1693 if (!iter->key_cache_path ||
1694 !iter->key_cache_path->should_be_locked ||
1695 !bpos_eq(iter->key_cache_path->pos, k->k.p)) {
1696 if (!iter->key_cache_path)
1697 iter->key_cache_path =
1698 bch2_path_get(trans, path->btree_id, path->pos, 1, 0,
1700 BTREE_ITER_CACHED, _THIS_IP_);
1702 iter->key_cache_path =
1703 bch2_btree_path_set_pos(trans, iter->key_cache_path, path->pos,
1704 iter->flags & BTREE_ITER_INTENT,
1707 ret = bch2_btree_path_traverse(trans, iter->key_cache_path,
1712 ck = (void *) iter->key_cache_path->l[0].b;
1714 if (test_bit(BKEY_CACHED_DIRTY, &ck->flags)) {
1715 trace_and_count(trans->c, trans_restart_key_cache_raced, trans, _RET_IP_);
1716 return btree_trans_restart(trans, BCH_ERR_transaction_restart_key_cache_raced);
1719 btree_path_set_should_be_locked(iter->key_cache_path);
1722 path = iter->key_cache_path;
1725 return bch2_trans_update_by_path(trans, path, k, flags, _RET_IP_);
1729 * Add a transaction update for a key that has already been journaled.
1731 int __must_check bch2_trans_update_seq(struct btree_trans *trans, u64 seq,
1732 struct btree_iter *iter, struct bkey_i *k,
1733 enum btree_update_flags flags)
1735 trans->journal_res.seq = seq;
1736 return bch2_trans_update(trans, iter, k, flags|BTREE_UPDATE_NOJOURNAL|
1737 BTREE_UPDATE_PREJOURNAL);
1740 int __must_check bch2_trans_update_buffered(struct btree_trans *trans,
1741 enum btree_id btree,
1744 struct btree_write_buffered_key *i;
1747 EBUG_ON(trans->nr_wb_updates > trans->wb_updates_size);
1748 EBUG_ON(k->k.u64s > BTREE_WRITE_BUFERED_U64s_MAX);
1750 trans_for_each_wb_update(trans, i) {
1751 if (i->btree == btree && bpos_eq(i->k.k.p, k->k.p)) {
1752 bkey_copy(&i->k, k);
1757 if (!trans->wb_updates ||
1758 trans->nr_wb_updates == trans->wb_updates_size) {
1759 struct btree_write_buffered_key *u;
1761 if (trans->nr_wb_updates == trans->wb_updates_size) {
1762 struct btree_transaction_stats *s = btree_trans_stats(trans);
1764 BUG_ON(trans->wb_updates_size > U8_MAX / 2);
1765 trans->wb_updates_size = max(1, trans->wb_updates_size * 2);
1767 s->wb_updates_size = trans->wb_updates_size;
1770 u = bch2_trans_kmalloc_nomemzero(trans,
1771 trans->wb_updates_size *
1772 sizeof(struct btree_write_buffered_key));
1773 ret = PTR_ERR_OR_ZERO(u);
1777 if (trans->nr_wb_updates)
1778 memcpy(u, trans->wb_updates, trans->nr_wb_updates *
1779 sizeof(struct btree_write_buffered_key));
1780 trans->wb_updates = u;
1783 trans->wb_updates[trans->nr_wb_updates] = (struct btree_write_buffered_key) {
1787 bkey_copy(&trans->wb_updates[trans->nr_wb_updates].k, k);
1788 trans->nr_wb_updates++;
1793 int bch2_bkey_get_empty_slot(struct btree_trans *trans, struct btree_iter *iter,
1794 enum btree_id btree, struct bpos end)
1799 bch2_trans_iter_init(trans, iter, btree, POS_MAX, BTREE_ITER_INTENT);
1800 k = bch2_btree_iter_prev(iter);
1805 bch2_btree_iter_advance(iter);
1806 k = bch2_btree_iter_peek_slot(iter);
1811 BUG_ON(k.k->type != KEY_TYPE_deleted);
1813 if (bkey_gt(k.k->p, end)) {
1814 ret = -BCH_ERR_ENOSPC_btree_slot;
1820 bch2_trans_iter_exit(trans, iter);
1824 void bch2_trans_commit_hook(struct btree_trans *trans,
1825 struct btree_trans_commit_hook *h)
1827 h->next = trans->hooks;
1831 int bch2_btree_insert_nonextent(struct btree_trans *trans,
1832 enum btree_id btree, struct bkey_i *k,
1833 enum btree_update_flags flags)
1835 struct btree_iter iter;
1838 bch2_trans_iter_init(trans, &iter, btree, k->k.p,
1839 BTREE_ITER_NOT_EXTENTS|
1841 ret = bch2_btree_iter_traverse(&iter) ?:
1842 bch2_trans_update(trans, &iter, k, flags);
1843 bch2_trans_iter_exit(trans, &iter);
1847 int __bch2_btree_insert(struct btree_trans *trans, enum btree_id id,
1848 struct bkey_i *k, enum btree_update_flags flags)
1850 struct btree_iter iter;
1853 bch2_trans_iter_init(trans, &iter, id, bkey_start_pos(&k->k),
1856 ret = bch2_btree_iter_traverse(&iter) ?:
1857 bch2_trans_update(trans, &iter, k, flags);
1858 bch2_trans_iter_exit(trans, &iter);
1863 * bch2_btree_insert - insert keys into the extent btree
1864 * @c: pointer to struct bch_fs
1865 * @id: btree to insert into
1866 * @insert_keys: list of keys to insert
1867 * @hook: insert callback
1869 int bch2_btree_insert(struct bch_fs *c, enum btree_id id,
1871 struct disk_reservation *disk_res,
1872 u64 *journal_seq, int flags)
1874 return bch2_trans_do(c, disk_res, journal_seq, flags,
1875 __bch2_btree_insert(&trans, id, k, 0));
1878 int bch2_btree_delete_extent_at(struct btree_trans *trans, struct btree_iter *iter,
1879 unsigned len, unsigned update_flags)
1883 k = bch2_trans_kmalloc(trans, sizeof(*k));
1889 bch2_key_resize(&k->k, len);
1890 return bch2_trans_update(trans, iter, k, update_flags);
1893 int bch2_btree_delete_at(struct btree_trans *trans,
1894 struct btree_iter *iter, unsigned update_flags)
1896 return bch2_btree_delete_extent_at(trans, iter, 0, update_flags);
1899 int bch2_btree_delete_at_buffered(struct btree_trans *trans,
1900 enum btree_id btree, struct bpos pos)
1904 k = bch2_trans_kmalloc(trans, sizeof(*k));
1910 return bch2_trans_update_buffered(trans, btree, k);
1913 int bch2_btree_delete_range_trans(struct btree_trans *trans, enum btree_id id,
1914 struct bpos start, struct bpos end,
1915 unsigned update_flags,
1918 u32 restart_count = trans->restart_count;
1919 struct btree_iter iter;
1923 bch2_trans_iter_init(trans, &iter, id, start, BTREE_ITER_INTENT);
1924 while ((k = bch2_btree_iter_peek_upto(&iter, end)).k) {
1925 struct disk_reservation disk_res =
1926 bch2_disk_reservation_init(trans->c, 0);
1927 struct bkey_i delete;
1933 bkey_init(&delete.k);
1936 * This could probably be more efficient for extents:
1940 * For extents, iter.pos won't necessarily be the same as
1941 * bkey_start_pos(k.k) (for non extents they always will be the
1942 * same). It's important that we delete starting from iter.pos
1943 * because the range we want to delete could start in the middle
1946 * (bch2_btree_iter_peek() does guarantee that iter.pos >=
1947 * bkey_start_pos(k.k)).
1949 delete.k.p = iter.pos;
1951 if (iter.flags & BTREE_ITER_IS_EXTENTS)
1952 bch2_key_resize(&delete.k,
1953 bpos_min(end, k.k->p).offset -
1956 ret = bch2_trans_update(trans, &iter, &delete, update_flags) ?:
1957 bch2_trans_commit(trans, &disk_res, journal_seq,
1958 BTREE_INSERT_NOFAIL);
1959 bch2_disk_reservation_put(trans->c, &disk_res);
1962 * the bch2_trans_begin() call is in a weird place because we
1963 * need to call it after every transaction commit, to avoid path
1964 * overflow, but don't want to call it if the delete operation
1965 * is a no-op and we have no work to do:
1967 bch2_trans_begin(trans);
1969 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
1974 bch2_trans_iter_exit(trans, &iter);
1976 if (!ret && trans_was_restarted(trans, restart_count))
1977 ret = -BCH_ERR_transaction_restart_nested;
1982 * bch_btree_delete_range - delete everything within a given range
1984 * Range is a half open interval - [start, end)
1986 int bch2_btree_delete_range(struct bch_fs *c, enum btree_id id,
1987 struct bpos start, struct bpos end,
1988 unsigned update_flags,
1991 int ret = bch2_trans_run(c,
1992 bch2_btree_delete_range_trans(&trans, id, start, end,
1993 update_flags, journal_seq));
1994 if (ret == -BCH_ERR_transaction_restart_nested)
1999 int bch2_btree_bit_mod(struct btree_trans *trans, enum btree_id btree,
2000 struct bpos pos, bool set)
2005 k = bch2_trans_kmalloc_nomemzero(trans, sizeof(*k));
2006 ret = PTR_ERR_OR_ZERO(k);
2011 k->k.type = set ? KEY_TYPE_set : KEY_TYPE_deleted;
2014 return bch2_trans_update_buffered(trans, btree, k);
2017 static int __bch2_trans_log_msg(darray_u64 *entries, const char *fmt, va_list args)
2019 struct printbuf buf = PRINTBUF;
2020 struct jset_entry_log *l;
2024 prt_vprintf(&buf, fmt, args);
2025 ret = buf.allocation_failure ? -BCH_ERR_ENOMEM_trans_log_msg : 0;
2029 u64s = DIV_ROUND_UP(buf.pos, sizeof(u64));
2031 ret = darray_make_room(entries, jset_u64s(u64s));
2035 l = (void *) &darray_top(*entries);
2036 l->entry.u64s = cpu_to_le16(u64s);
2037 l->entry.btree_id = 0;
2039 l->entry.type = BCH_JSET_ENTRY_log;
2040 l->entry.pad[0] = 0;
2041 l->entry.pad[1] = 0;
2042 l->entry.pad[2] = 0;
2043 memcpy(l->d, buf.buf, buf.pos);
2045 l->d[buf.pos++] = '\0';
2047 entries->nr += jset_u64s(u64s);
2049 printbuf_exit(&buf);
2054 __bch2_fs_log_msg(struct bch_fs *c, unsigned commit_flags, const char *fmt,
2059 if (!test_bit(JOURNAL_STARTED, &c->journal.flags)) {
2060 ret = __bch2_trans_log_msg(&c->journal.early_journal_entries, fmt, args);
2062 ret = bch2_trans_do(c, NULL, NULL,
2063 BTREE_INSERT_LAZY_RW|commit_flags,
2064 __bch2_trans_log_msg(&trans.extra_journal_entries, fmt, args));
2070 int bch2_fs_log_msg(struct bch_fs *c, const char *fmt, ...)
2075 va_start(args, fmt);
2076 ret = __bch2_fs_log_msg(c, 0, fmt, args);
2082 * Use for logging messages during recovery to enable reserved space and avoid
2085 int bch2_journal_log_msg(struct bch_fs *c, const char *fmt, ...)
2090 va_start(args, fmt);
2091 ret = __bch2_fs_log_msg(c, BCH_WATERMARK_reclaim, fmt, args);