1 // SPDX-License-Identifier: GPL-2.0
4 #include "bkey_methods.h"
6 #include "btree_cache.h"
7 #include "btree_iter.h"
8 #include "btree_key_cache.h"
9 #include "btree_locking.h"
10 #include "btree_update.h"
17 #include <linux/prefetch.h>
18 #include <trace/events/bcachefs.h>
20 static void btree_iter_set_search_pos(struct btree_iter *, struct bpos);
21 static struct btree_iter *btree_iter_child_alloc(struct btree_iter *, unsigned long);
22 static struct btree_iter *btree_trans_iter_alloc(struct btree_trans *);
23 static void btree_iter_copy(struct btree_iter *, struct btree_iter *);
25 static inline struct bpos bkey_successor(struct btree_iter *iter, struct bpos p)
27 EBUG_ON(btree_iter_type(iter) == BTREE_ITER_NODES);
29 /* Are we iterating over keys in all snapshots? */
30 if (iter->flags & BTREE_ITER_ALL_SNAPSHOTS) {
31 p = bpos_successor(p);
33 p = bpos_nosnap_successor(p);
34 p.snapshot = iter->snapshot;
40 static inline struct bpos bkey_predecessor(struct btree_iter *iter, struct bpos p)
42 EBUG_ON(btree_iter_type(iter) == BTREE_ITER_NODES);
44 /* Are we iterating over keys in all snapshots? */
45 if (iter->flags & BTREE_ITER_ALL_SNAPSHOTS) {
46 p = bpos_predecessor(p);
48 p = bpos_nosnap_predecessor(p);
49 p.snapshot = iter->snapshot;
55 static inline bool is_btree_node(struct btree_iter *iter, unsigned l)
57 return l < BTREE_MAX_DEPTH &&
58 (unsigned long) iter->l[l].b >= 128;
61 static inline struct bpos btree_iter_search_key(struct btree_iter *iter)
63 struct bpos pos = iter->pos;
65 if ((iter->flags & BTREE_ITER_IS_EXTENTS) &&
66 bkey_cmp(pos, POS_MAX))
67 pos = bkey_successor(iter, pos);
71 static inline bool btree_iter_pos_before_node(struct btree_iter *iter,
74 return bpos_cmp(iter->real_pos, b->data->min_key) < 0;
77 static inline bool btree_iter_pos_after_node(struct btree_iter *iter,
80 return bpos_cmp(b->key.k.p, iter->real_pos) < 0;
83 static inline bool btree_iter_pos_in_node(struct btree_iter *iter,
86 return iter->btree_id == b->c.btree_id &&
87 !btree_iter_pos_before_node(iter, b) &&
88 !btree_iter_pos_after_node(iter, b);
91 /* Btree node locking: */
93 void bch2_btree_node_unlock_write(struct btree *b, struct btree_iter *iter)
95 bch2_btree_node_unlock_write_inlined(b, iter);
98 void __bch2_btree_node_lock_write(struct btree *b, struct btree_iter *iter)
100 struct btree_iter *linked;
101 unsigned readers = 0;
103 EBUG_ON(!btree_node_intent_locked(iter, b->c.level));
105 trans_for_each_iter(iter->trans, linked)
106 if (linked->l[b->c.level].b == b &&
107 btree_node_read_locked(linked, b->c.level))
111 * Must drop our read locks before calling six_lock_write() -
112 * six_unlock() won't do wakeups until the reader count
113 * goes to 0, and it's safe because we have the node intent
116 atomic64_sub(__SIX_VAL(read_lock, readers),
117 &b->c.lock.state.counter);
118 btree_node_lock_type(iter->trans->c, b, SIX_LOCK_write);
119 atomic64_add(__SIX_VAL(read_lock, readers),
120 &b->c.lock.state.counter);
123 bool __bch2_btree_node_relock(struct btree_iter *iter, unsigned level)
125 struct btree *b = btree_iter_node(iter, level);
126 int want = __btree_lock_want(iter, level);
128 if (!is_btree_node(iter, level))
134 if (six_relock_type(&b->c.lock, want, iter->l[level].lock_seq) ||
135 (btree_node_lock_seq_matches(iter, b, level) &&
136 btree_node_lock_increment(iter->trans, b, level, want))) {
137 mark_btree_node_locked(iter, level, want);
144 static bool bch2_btree_node_upgrade(struct btree_iter *iter, unsigned level)
146 struct btree *b = iter->l[level].b;
148 EBUG_ON(btree_lock_want(iter, level) != BTREE_NODE_INTENT_LOCKED);
150 if (!is_btree_node(iter, level))
153 if (btree_node_intent_locked(iter, level))
159 if (btree_node_locked(iter, level)
160 ? six_lock_tryupgrade(&b->c.lock)
161 : six_relock_type(&b->c.lock, SIX_LOCK_intent, iter->l[level].lock_seq))
164 if (btree_node_lock_seq_matches(iter, b, level) &&
165 btree_node_lock_increment(iter->trans, b, level, BTREE_NODE_INTENT_LOCKED)) {
166 btree_node_unlock(iter, level);
172 mark_btree_node_intent_locked(iter, level);
176 static inline bool btree_iter_get_locks(struct btree_iter *iter, bool upgrade,
177 unsigned long trace_ip)
179 unsigned l = iter->level;
183 if (!btree_iter_node(iter, l))
187 ? bch2_btree_node_upgrade(iter, l)
188 : bch2_btree_node_relock(iter, l))) {
190 ? trace_node_upgrade_fail
191 : trace_node_relock_fail)(iter->trans->ip, trace_ip,
192 iter->btree_id, &iter->real_pos,
193 l, iter->l[l].lock_seq,
194 is_btree_node(iter, l)
196 : (unsigned long) iter->l[l].b,
197 is_btree_node(iter, l)
198 ? iter->l[l].b->c.lock.state.seq
202 btree_iter_set_dirty(iter, BTREE_ITER_NEED_TRAVERSE);
206 } while (l < iter->locks_want);
209 * When we fail to get a lock, we have to ensure that any child nodes
210 * can't be relocked so bch2_btree_iter_traverse has to walk back up to
211 * the node that we failed to relock:
213 while (fail_idx >= 0) {
214 btree_node_unlock(iter, fail_idx);
215 iter->l[fail_idx].b = BTREE_ITER_NO_NODE_GET_LOCKS;
219 if (iter->uptodate == BTREE_ITER_NEED_RELOCK)
220 iter->uptodate = BTREE_ITER_NEED_PEEK;
222 bch2_btree_trans_verify_locks(iter->trans);
224 return iter->uptodate < BTREE_ITER_NEED_RELOCK;
227 static struct bpos btree_node_pos(struct btree_bkey_cached_common *_b,
228 enum btree_iter_type type)
230 return type != BTREE_ITER_CACHED
231 ? container_of(_b, struct btree, c)->key.k.p
232 : container_of(_b, struct bkey_cached, c)->key.pos;
236 bool __bch2_btree_node_lock(struct btree *b, struct bpos pos,
237 unsigned level, struct btree_iter *iter,
238 enum six_lock_type type,
239 six_lock_should_sleep_fn should_sleep_fn, void *p,
242 struct btree_trans *trans = iter->trans;
243 struct btree_iter *linked, *deadlock_iter = NULL;
244 u64 start_time = local_clock();
248 /* Check if it's safe to block: */
249 trans_for_each_iter(trans, linked) {
250 if (!linked->nodes_locked)
254 * Can't block taking an intent lock if we have _any_ nodes read
257 * - Our read lock blocks another thread with an intent lock on
258 * the same node from getting a write lock, and thus from
259 * dropping its intent lock
261 * - And the other thread may have multiple nodes intent locked:
262 * both the node we want to intent lock, and the node we
263 * already have read locked - deadlock:
265 if (type == SIX_LOCK_intent &&
266 linked->nodes_locked != linked->nodes_intent_locked) {
267 deadlock_iter = linked;
271 if (linked->btree_id != iter->btree_id) {
272 if (linked->btree_id > iter->btree_id) {
273 deadlock_iter = linked;
280 * Within the same btree, cached iterators come before non
283 if (btree_iter_is_cached(linked) != btree_iter_is_cached(iter)) {
284 if (btree_iter_is_cached(iter)) {
285 deadlock_iter = linked;
292 * Interior nodes must be locked before their descendants: if
293 * another iterator has possible descendants locked of the node
294 * we're about to lock, it must have the ancestors locked too:
296 if (level > __fls(linked->nodes_locked)) {
297 deadlock_iter = linked;
301 /* Must lock btree nodes in key order: */
302 if (btree_node_locked(linked, level) &&
303 bpos_cmp(pos, btree_node_pos((void *) linked->l[level].b,
304 btree_iter_type(linked))) <= 0) {
305 deadlock_iter = linked;
307 BUG_ON(trans->in_traverse_all);
311 if (unlikely(deadlock_iter)) {
312 trace_trans_restart_would_deadlock(iter->trans->ip, ip,
313 trans->in_traverse_all, reason,
314 deadlock_iter->btree_id,
315 btree_iter_type(deadlock_iter),
316 &deadlock_iter->real_pos,
318 btree_iter_type(iter),
323 if (six_trylock_type(&b->c.lock, type))
326 #ifdef CONFIG_BCACHEFS_DEBUG
327 trans->locking_iter_idx = iter->idx;
328 trans->locking_pos = pos;
329 trans->locking_btree_id = iter->btree_id;
330 trans->locking_level = level;
334 ret = six_lock_type(&b->c.lock, type, should_sleep_fn, p) == 0;
336 #ifdef CONFIG_BCACHEFS_DEBUG
337 trans->locking = NULL;
340 bch2_time_stats_update(&trans->c->times[lock_to_time_stat(type)],
345 /* Btree iterator locking: */
347 #ifdef CONFIG_BCACHEFS_DEBUG
348 static void bch2_btree_iter_verify_locks(struct btree_iter *iter)
352 if (!(iter->trans->iters_linked & (1ULL << iter->idx))) {
353 BUG_ON(iter->nodes_locked);
357 for (l = 0; is_btree_node(iter, l); l++) {
358 if (iter->uptodate >= BTREE_ITER_NEED_RELOCK &&
359 !btree_node_locked(iter, l))
362 BUG_ON(btree_lock_want(iter, l) !=
363 btree_node_locked_type(iter, l));
367 void bch2_btree_trans_verify_locks(struct btree_trans *trans)
369 struct btree_iter *iter;
371 trans_for_each_iter(trans, iter)
372 bch2_btree_iter_verify_locks(iter);
375 static inline void bch2_btree_iter_verify_locks(struct btree_iter *iter) {}
379 static bool bch2_btree_iter_relock(struct btree_iter *iter, unsigned long trace_ip)
381 return btree_iter_get_locks(iter, false, trace_ip);
384 bool __bch2_btree_iter_upgrade(struct btree_iter *iter,
385 unsigned new_locks_want)
387 struct btree_iter *linked;
389 EBUG_ON(iter->locks_want >= new_locks_want);
391 iter->locks_want = new_locks_want;
393 if (btree_iter_get_locks(iter, true, _THIS_IP_))
397 * XXX: this is ugly - we'd prefer to not be mucking with other
398 * iterators in the btree_trans here.
400 * On failure to upgrade the iterator, setting iter->locks_want and
401 * calling get_locks() is sufficient to make bch2_btree_iter_traverse()
402 * get the locks we want on transaction restart.
404 * But if this iterator was a clone, on transaction restart what we did
405 * to this iterator isn't going to be preserved.
407 * Possibly we could add an iterator field for the parent iterator when
408 * an iterator is a copy - for now, we'll just upgrade any other
409 * iterators with the same btree id.
411 * The code below used to be needed to ensure ancestor nodes get locked
412 * before interior nodes - now that's handled by
413 * bch2_btree_iter_traverse_all().
415 trans_for_each_iter(iter->trans, linked)
416 if (linked != iter &&
417 btree_iter_type(linked) == btree_iter_type(iter) &&
418 linked->btree_id == iter->btree_id &&
419 linked->locks_want < new_locks_want) {
420 linked->locks_want = new_locks_want;
421 btree_iter_get_locks(linked, true, _THIS_IP_);
427 void __bch2_btree_iter_downgrade(struct btree_iter *iter,
428 unsigned new_locks_want)
432 EBUG_ON(iter->locks_want < new_locks_want);
434 iter->locks_want = new_locks_want;
436 while (iter->nodes_locked &&
437 (l = __fls(iter->nodes_locked)) >= iter->locks_want) {
438 if (l > iter->level) {
439 btree_node_unlock(iter, l);
441 if (btree_node_intent_locked(iter, l)) {
442 six_lock_downgrade(&iter->l[l].b->c.lock);
443 iter->nodes_intent_locked ^= 1 << l;
449 bch2_btree_trans_verify_locks(iter->trans);
452 void bch2_trans_downgrade(struct btree_trans *trans)
454 struct btree_iter *iter;
456 trans_for_each_iter(trans, iter)
457 bch2_btree_iter_downgrade(iter);
460 /* Btree transaction locking: */
462 static inline bool btree_iter_should_be_locked(struct btree_trans *trans,
463 struct btree_iter *iter)
465 return (iter->flags & BTREE_ITER_KEEP_UNTIL_COMMIT) ||
466 iter->should_be_locked;
469 bool bch2_trans_relock(struct btree_trans *trans)
471 struct btree_iter *iter;
473 trans_for_each_iter(trans, iter)
474 if (!bch2_btree_iter_relock(iter, _RET_IP_) &&
475 btree_iter_should_be_locked(trans, iter)) {
476 trace_trans_restart_relock(trans->ip, _RET_IP_,
477 iter->btree_id, &iter->real_pos);
483 void bch2_trans_unlock(struct btree_trans *trans)
485 struct btree_iter *iter;
487 trans_for_each_iter(trans, iter)
488 __bch2_btree_iter_unlock(iter);
491 /* Btree iterator: */
493 #ifdef CONFIG_BCACHEFS_DEBUG
495 static void bch2_btree_iter_verify_cached(struct btree_iter *iter)
497 struct bkey_cached *ck;
498 bool locked = btree_node_locked(iter, 0);
500 if (!bch2_btree_node_relock(iter, 0))
503 ck = (void *) iter->l[0].b;
504 BUG_ON(ck->key.btree_id != iter->btree_id ||
505 bkey_cmp(ck->key.pos, iter->pos));
508 btree_node_unlock(iter, 0);
511 static void bch2_btree_iter_verify_level(struct btree_iter *iter,
514 struct btree_iter_level *l;
515 struct btree_node_iter tmp;
517 struct bkey_packed *p, *k;
518 char buf1[100], buf2[100], buf3[100];
521 if (!bch2_debug_check_iterators)
526 locked = btree_node_locked(iter, level);
528 if (btree_iter_type(iter) == BTREE_ITER_CACHED) {
530 bch2_btree_iter_verify_cached(iter);
534 BUG_ON(iter->level < iter->min_depth);
536 if (!btree_iter_node(iter, level))
539 if (!bch2_btree_node_relock(iter, level))
542 BUG_ON(!btree_iter_pos_in_node(iter, l->b));
545 * node iterators don't use leaf node iterator:
547 if (btree_iter_type(iter) == BTREE_ITER_NODES &&
548 level <= iter->min_depth)
551 bch2_btree_node_iter_verify(&l->iter, l->b);
554 * For interior nodes, the iterator will have skipped past
557 * For extents, the iterator may have skipped past deleted keys (but not
560 p = level || btree_node_type_is_extents(iter->btree_id)
561 ? bch2_btree_node_iter_prev(&tmp, l->b)
562 : bch2_btree_node_iter_prev_all(&tmp, l->b);
563 k = bch2_btree_node_iter_peek_all(&l->iter, l->b);
565 if (p && bkey_iter_pos_cmp(l->b, p, &iter->real_pos) >= 0) {
570 if (k && bkey_iter_pos_cmp(l->b, k, &iter->real_pos) < 0) {
576 btree_node_unlock(iter, level);
579 strcpy(buf2, "(none)");
580 strcpy(buf3, "(none)");
582 bch2_bpos_to_text(&PBUF(buf1), iter->real_pos);
585 struct bkey uk = bkey_unpack_key(l->b, p);
586 bch2_bkey_to_text(&PBUF(buf2), &uk);
590 struct bkey uk = bkey_unpack_key(l->b, k);
591 bch2_bkey_to_text(&PBUF(buf3), &uk);
594 panic("iterator should be %s key at level %u:\n"
598 msg, level, buf1, buf2, buf3);
601 static void bch2_btree_iter_verify(struct btree_iter *iter)
603 enum btree_iter_type type = btree_iter_type(iter);
606 EBUG_ON(iter->btree_id >= BTREE_ID_NR);
608 BUG_ON(!(iter->flags & BTREE_ITER_ALL_SNAPSHOTS) &&
609 iter->pos.snapshot != iter->snapshot);
611 BUG_ON((iter->flags & BTREE_ITER_IS_EXTENTS) &&
612 (iter->flags & BTREE_ITER_ALL_SNAPSHOTS));
614 BUG_ON(type == BTREE_ITER_NODES &&
615 !(iter->flags & BTREE_ITER_ALL_SNAPSHOTS));
617 BUG_ON(type != BTREE_ITER_NODES &&
618 (iter->flags & BTREE_ITER_ALL_SNAPSHOTS) &&
619 !btree_type_has_snapshots(iter->btree_id));
621 bch2_btree_iter_verify_locks(iter);
623 for (i = 0; i < BTREE_MAX_DEPTH; i++)
624 bch2_btree_iter_verify_level(iter, i);
627 static void bch2_btree_iter_verify_entry_exit(struct btree_iter *iter)
629 enum btree_iter_type type = btree_iter_type(iter);
631 BUG_ON(!(iter->flags & BTREE_ITER_ALL_SNAPSHOTS) &&
632 iter->pos.snapshot != iter->snapshot);
634 BUG_ON((type == BTREE_ITER_KEYS ||
635 type == BTREE_ITER_CACHED) &&
636 (bkey_cmp(iter->pos, bkey_start_pos(&iter->k)) < 0 ||
637 bkey_cmp(iter->pos, iter->k.p) > 0));
640 void bch2_btree_trans_verify_iters(struct btree_trans *trans, struct btree *b)
642 struct btree_iter *iter;
644 if (!bch2_debug_check_iterators)
647 trans_for_each_iter_with_node(trans, b, iter)
648 bch2_btree_iter_verify_level(iter, b->c.level);
653 static inline void bch2_btree_iter_verify_level(struct btree_iter *iter, unsigned l) {}
654 static inline void bch2_btree_iter_verify(struct btree_iter *iter) {}
655 static inline void bch2_btree_iter_verify_entry_exit(struct btree_iter *iter) {}
659 static void btree_node_iter_set_set_pos(struct btree_node_iter *iter,
662 struct bkey_packed *k)
664 struct btree_node_iter_set *set;
666 btree_node_iter_for_each(iter, set)
667 if (set->end == t->end_offset) {
668 set->k = __btree_node_key_to_offset(b, k);
669 bch2_btree_node_iter_sort(iter, b);
673 bch2_btree_node_iter_push(iter, b, k, btree_bkey_last(b, t));
676 static void __bch2_btree_iter_fix_key_modified(struct btree_iter *iter,
678 struct bkey_packed *where)
680 struct btree_iter_level *l = &iter->l[b->c.level];
682 if (where != bch2_btree_node_iter_peek_all(&l->iter, l->b))
685 if (bkey_iter_pos_cmp(l->b, where, &iter->real_pos) < 0)
686 bch2_btree_node_iter_advance(&l->iter, l->b);
688 btree_iter_set_dirty(iter, BTREE_ITER_NEED_PEEK);
691 void bch2_btree_iter_fix_key_modified(struct btree_iter *iter,
693 struct bkey_packed *where)
695 struct btree_iter *linked;
697 trans_for_each_iter_with_node(iter->trans, b, linked) {
698 __bch2_btree_iter_fix_key_modified(linked, b, where);
699 bch2_btree_iter_verify_level(linked, b->c.level);
703 static void __bch2_btree_node_iter_fix(struct btree_iter *iter,
705 struct btree_node_iter *node_iter,
707 struct bkey_packed *where,
708 unsigned clobber_u64s,
711 const struct bkey_packed *end = btree_bkey_last(b, t);
712 struct btree_node_iter_set *set;
713 unsigned offset = __btree_node_key_to_offset(b, where);
714 int shift = new_u64s - clobber_u64s;
715 unsigned old_end = t->end_offset - shift;
716 unsigned orig_iter_pos = node_iter->data[0].k;
717 bool iter_current_key_modified =
718 orig_iter_pos >= offset &&
719 orig_iter_pos <= offset + clobber_u64s;
721 btree_node_iter_for_each(node_iter, set)
722 if (set->end == old_end)
725 /* didn't find the bset in the iterator - might have to readd it: */
727 bkey_iter_pos_cmp(b, where, &iter->real_pos) >= 0) {
728 bch2_btree_node_iter_push(node_iter, b, where, end);
731 /* Iterator is after key that changed */
735 set->end = t->end_offset;
737 /* Iterator hasn't gotten to the key that changed yet: */
742 bkey_iter_pos_cmp(b, where, &iter->real_pos) >= 0) {
744 } else if (set->k < offset + clobber_u64s) {
745 set->k = offset + new_u64s;
746 if (set->k == set->end)
747 bch2_btree_node_iter_set_drop(node_iter, set);
749 /* Iterator is after key that changed */
750 set->k = (int) set->k + shift;
754 bch2_btree_node_iter_sort(node_iter, b);
756 if (node_iter->data[0].k != orig_iter_pos)
757 iter_current_key_modified = true;
760 * When a new key is added, and the node iterator now points to that
761 * key, the iterator might have skipped past deleted keys that should
762 * come after the key the iterator now points to. We have to rewind to
763 * before those deleted keys - otherwise
764 * bch2_btree_node_iter_prev_all() breaks:
766 if (!bch2_btree_node_iter_end(node_iter) &&
767 iter_current_key_modified &&
769 btree_node_type_is_extents(iter->btree_id))) {
771 struct bkey_packed *k, *k2, *p;
773 k = bch2_btree_node_iter_peek_all(node_iter, b);
775 for_each_bset(b, t) {
776 bool set_pos = false;
778 if (node_iter->data[0].end == t->end_offset)
781 k2 = bch2_btree_node_iter_bset_pos(node_iter, b, t);
783 while ((p = bch2_bkey_prev_all(b, t, k2)) &&
784 bkey_iter_cmp(b, k, p) < 0) {
790 btree_node_iter_set_set_pos(node_iter,
796 node_iter == &iter->l[0].iter &&
797 iter_current_key_modified)
798 btree_iter_set_dirty(iter, BTREE_ITER_NEED_PEEK);
801 void bch2_btree_node_iter_fix(struct btree_iter *iter,
803 struct btree_node_iter *node_iter,
804 struct bkey_packed *where,
805 unsigned clobber_u64s,
808 struct bset_tree *t = bch2_bkey_to_bset(b, where);
809 struct btree_iter *linked;
811 if (node_iter != &iter->l[b->c.level].iter) {
812 __bch2_btree_node_iter_fix(iter, b, node_iter, t,
813 where, clobber_u64s, new_u64s);
815 if (bch2_debug_check_iterators)
816 bch2_btree_node_iter_verify(node_iter, b);
819 trans_for_each_iter_with_node(iter->trans, b, linked) {
820 __bch2_btree_node_iter_fix(linked, b,
821 &linked->l[b->c.level].iter, t,
822 where, clobber_u64s, new_u64s);
823 bch2_btree_iter_verify_level(linked, b->c.level);
827 static inline struct bkey_s_c __btree_iter_unpack(struct btree_iter *iter,
828 struct btree_iter_level *l,
830 struct bkey_packed *k)
836 * signal to bch2_btree_iter_peek_slot() that we're currently at
839 u->type = KEY_TYPE_deleted;
840 return bkey_s_c_null;
843 ret = bkey_disassemble(l->b, k, u);
846 * XXX: bch2_btree_bset_insert_key() generates invalid keys when we
847 * overwrite extents - it sets k->type = KEY_TYPE_deleted on the key
848 * being overwritten but doesn't change k->size. But this is ok, because
849 * those keys are never written out, we just have to avoid a spurious
852 if (bch2_debug_check_bkeys && !bkey_deleted(ret.k))
853 bch2_bkey_debugcheck(iter->trans->c, l->b, ret);
858 /* peek_all() doesn't skip deleted keys */
859 static inline struct bkey_s_c btree_iter_level_peek_all(struct btree_iter *iter,
860 struct btree_iter_level *l)
862 return __btree_iter_unpack(iter, l, &iter->k,
863 bch2_btree_node_iter_peek_all(&l->iter, l->b));
866 static inline struct bkey_s_c btree_iter_level_peek(struct btree_iter *iter,
867 struct btree_iter_level *l)
869 struct bkey_s_c k = __btree_iter_unpack(iter, l, &iter->k,
870 bch2_btree_node_iter_peek(&l->iter, l->b));
872 iter->real_pos = k.k ? k.k->p : l->b->key.k.p;
876 static inline struct bkey_s_c btree_iter_level_prev(struct btree_iter *iter,
877 struct btree_iter_level *l)
879 struct bkey_s_c k = __btree_iter_unpack(iter, l, &iter->k,
880 bch2_btree_node_iter_prev(&l->iter, l->b));
882 iter->real_pos = k.k ? k.k->p : l->b->data->min_key;
886 static inline bool btree_iter_advance_to_pos(struct btree_iter *iter,
887 struct btree_iter_level *l,
890 struct bkey_packed *k;
893 while ((k = bch2_btree_node_iter_peek_all(&l->iter, l->b)) &&
894 bkey_iter_pos_cmp(l->b, k, &iter->real_pos) < 0) {
895 if (max_advance > 0 && nr_advanced >= max_advance)
898 bch2_btree_node_iter_advance(&l->iter, l->b);
906 * Verify that iterator for parent node points to child node:
908 static void btree_iter_verify_new_node(struct btree_iter *iter, struct btree *b)
910 struct btree_iter_level *l;
913 struct bkey_packed *k;
915 if (!IS_ENABLED(CONFIG_BCACHEFS_DEBUG))
918 plevel = b->c.level + 1;
919 if (!btree_iter_node(iter, plevel))
922 parent_locked = btree_node_locked(iter, plevel);
924 if (!bch2_btree_node_relock(iter, plevel))
927 l = &iter->l[plevel];
928 k = bch2_btree_node_iter_peek_all(&l->iter, l->b);
931 bkey_cmp_left_packed(l->b, k, &b->key.k.p)) {
936 struct bkey uk = bkey_unpack_key(b, k);
938 bch2_dump_btree_node(iter->trans->c, l->b);
939 bch2_bpos_to_text(&PBUF(buf1), iter->real_pos);
940 bch2_bkey_to_text(&PBUF(buf2), &uk);
941 bch2_bpos_to_text(&PBUF(buf3), b->data->min_key);
942 bch2_bpos_to_text(&PBUF(buf3), b->data->max_key);
943 panic("parent iter doesn't point to new node:\n"
947 bch2_btree_ids[iter->btree_id], buf1,
952 btree_node_unlock(iter, b->c.level + 1);
955 static inline void __btree_iter_init(struct btree_iter *iter,
958 struct btree_iter_level *l = &iter->l[level];
960 bch2_btree_node_iter_init(&l->iter, l->b, &iter->real_pos);
963 * Iterators to interior nodes should always be pointed at the first non
967 bch2_btree_node_iter_peek(&l->iter, l->b);
969 btree_iter_set_dirty(iter, BTREE_ITER_NEED_PEEK);
972 static inline void btree_iter_node_set(struct btree_iter *iter,
975 BUG_ON(btree_iter_type(iter) == BTREE_ITER_CACHED);
977 btree_iter_verify_new_node(iter, b);
979 EBUG_ON(!btree_iter_pos_in_node(iter, b));
980 EBUG_ON(b->c.lock.state.seq & 1);
982 iter->l[b->c.level].lock_seq = b->c.lock.state.seq;
983 iter->l[b->c.level].b = b;
984 __btree_iter_init(iter, b->c.level);
988 * A btree node is being replaced - update the iterator to point to the new
991 void bch2_btree_iter_node_replace(struct btree_iter *iter, struct btree *b)
993 enum btree_node_locked_type t;
994 struct btree_iter *linked;
996 trans_for_each_iter(iter->trans, linked)
997 if (btree_iter_type(linked) != BTREE_ITER_CACHED &&
998 btree_iter_pos_in_node(linked, b)) {
1000 * bch2_btree_iter_node_drop() has already been called -
1001 * the old node we're replacing has already been
1002 * unlocked and the pointer invalidated
1004 BUG_ON(btree_node_locked(linked, b->c.level));
1006 t = btree_lock_want(linked, b->c.level);
1007 if (t != BTREE_NODE_UNLOCKED) {
1008 six_lock_increment(&b->c.lock, t);
1009 mark_btree_node_locked(linked, b->c.level, t);
1012 btree_iter_node_set(linked, b);
1016 void bch2_btree_iter_node_drop(struct btree_iter *iter, struct btree *b)
1018 struct btree_iter *linked;
1019 unsigned level = b->c.level;
1021 trans_for_each_iter(iter->trans, linked)
1022 if (linked->l[level].b == b) {
1023 btree_node_unlock(linked, level);
1024 linked->l[level].b = BTREE_ITER_NO_NODE_DROP;
1029 * A btree node has been modified in such a way as to invalidate iterators - fix
1032 void bch2_btree_iter_reinit_node(struct btree_iter *iter, struct btree *b)
1034 struct btree_iter *linked;
1036 trans_for_each_iter_with_node(iter->trans, b, linked)
1037 __btree_iter_init(linked, b->c.level);
1040 static int lock_root_check_fn(struct six_lock *lock, void *p)
1042 struct btree *b = container_of(lock, struct btree, c.lock);
1043 struct btree **rootp = p;
1045 return b == *rootp ? 0 : -1;
1048 static inline int btree_iter_lock_root(struct btree_iter *iter,
1049 unsigned depth_want,
1050 unsigned long trace_ip)
1052 struct bch_fs *c = iter->trans->c;
1053 struct btree *b, **rootp = &c->btree_roots[iter->btree_id].b;
1054 enum six_lock_type lock_type;
1057 EBUG_ON(iter->nodes_locked);
1060 b = READ_ONCE(*rootp);
1061 iter->level = READ_ONCE(b->c.level);
1063 if (unlikely(iter->level < depth_want)) {
1065 * the root is at a lower depth than the depth we want:
1066 * got to the end of the btree, or we're walking nodes
1067 * greater than some depth and there are no nodes >=
1070 iter->level = depth_want;
1071 for (i = iter->level; i < BTREE_MAX_DEPTH; i++)
1072 iter->l[i].b = NULL;
1076 lock_type = __btree_lock_want(iter, iter->level);
1077 if (unlikely(!btree_node_lock(b, POS_MAX, iter->level,
1079 lock_root_check_fn, rootp,
1083 if (likely(b == READ_ONCE(*rootp) &&
1084 b->c.level == iter->level &&
1086 for (i = 0; i < iter->level; i++)
1087 iter->l[i].b = BTREE_ITER_NO_NODE_LOCK_ROOT;
1088 iter->l[iter->level].b = b;
1089 for (i = iter->level + 1; i < BTREE_MAX_DEPTH; i++)
1090 iter->l[i].b = NULL;
1092 mark_btree_node_locked(iter, iter->level, lock_type);
1093 btree_iter_node_set(iter, b);
1097 six_unlock_type(&b->c.lock, lock_type);
1102 static void btree_iter_prefetch(struct btree_iter *iter)
1104 struct bch_fs *c = iter->trans->c;
1105 struct btree_iter_level *l = &iter->l[iter->level];
1106 struct btree_node_iter node_iter = l->iter;
1107 struct bkey_packed *k;
1108 struct bkey_buf tmp;
1109 unsigned nr = test_bit(BCH_FS_STARTED, &c->flags)
1110 ? (iter->level > 1 ? 0 : 2)
1111 : (iter->level > 1 ? 1 : 16);
1112 bool was_locked = btree_node_locked(iter, iter->level);
1114 bch2_bkey_buf_init(&tmp);
1117 if (!bch2_btree_node_relock(iter, iter->level))
1120 bch2_btree_node_iter_advance(&node_iter, l->b);
1121 k = bch2_btree_node_iter_peek(&node_iter, l->b);
1125 bch2_bkey_buf_unpack(&tmp, c, l->b, k);
1126 bch2_btree_node_prefetch(c, iter, tmp.k, iter->btree_id,
1131 btree_node_unlock(iter, iter->level);
1133 bch2_bkey_buf_exit(&tmp, c);
1136 static noinline void btree_node_mem_ptr_set(struct btree_iter *iter,
1137 unsigned plevel, struct btree *b)
1139 struct btree_iter_level *l = &iter->l[plevel];
1140 bool locked = btree_node_locked(iter, plevel);
1141 struct bkey_packed *k;
1142 struct bch_btree_ptr_v2 *bp;
1144 if (!bch2_btree_node_relock(iter, plevel))
1147 k = bch2_btree_node_iter_peek_all(&l->iter, l->b);
1148 BUG_ON(k->type != KEY_TYPE_btree_ptr_v2);
1150 bp = (void *) bkeyp_val(&l->b->format, k);
1151 bp->mem_ptr = (unsigned long)b;
1154 btree_node_unlock(iter, plevel);
1157 static __always_inline int btree_iter_down(struct btree_iter *iter,
1158 unsigned long trace_ip)
1160 struct bch_fs *c = iter->trans->c;
1161 struct btree_iter_level *l = &iter->l[iter->level];
1163 unsigned level = iter->level - 1;
1164 enum six_lock_type lock_type = __btree_lock_want(iter, level);
1165 struct bkey_buf tmp;
1168 EBUG_ON(!btree_node_locked(iter, iter->level));
1170 bch2_bkey_buf_init(&tmp);
1171 bch2_bkey_buf_unpack(&tmp, c, l->b,
1172 bch2_btree_node_iter_peek(&l->iter, l->b));
1174 b = bch2_btree_node_get(c, iter, tmp.k, level, lock_type, trace_ip);
1175 ret = PTR_ERR_OR_ZERO(b);
1179 mark_btree_node_locked(iter, level, lock_type);
1180 btree_iter_node_set(iter, b);
1182 if (tmp.k->k.type == KEY_TYPE_btree_ptr_v2 &&
1183 unlikely(b != btree_node_mem_ptr(tmp.k)))
1184 btree_node_mem_ptr_set(iter, level + 1, b);
1186 if (iter->flags & BTREE_ITER_PREFETCH)
1187 btree_iter_prefetch(iter);
1189 if (btree_node_read_locked(iter, level + 1))
1190 btree_node_unlock(iter, level + 1);
1191 iter->level = level;
1193 bch2_btree_iter_verify_locks(iter);
1195 bch2_bkey_buf_exit(&tmp, c);
1199 static int btree_iter_traverse_one(struct btree_iter *, unsigned long);
1201 static int __btree_iter_traverse_all(struct btree_trans *trans, int ret,
1202 unsigned long trace_ip)
1204 struct bch_fs *c = trans->c;
1205 struct btree_iter *iter;
1206 u8 sorted[BTREE_ITER_MAX];
1207 int i, nr_sorted = 0;
1210 if (trans->in_traverse_all)
1213 trans->in_traverse_all = true;
1216 relock_fail = false;
1218 trans_for_each_iter(trans, iter) {
1219 if (!bch2_btree_iter_relock(iter, _THIS_IP_))
1221 sorted[nr_sorted++] = iter->idx;
1225 trans->in_traverse_all = false;
1229 #define btree_iter_cmp_by_idx(_l, _r) \
1230 btree_iter_lock_cmp(&trans->iters[_l], &trans->iters[_r])
1232 bubble_sort(sorted, nr_sorted, btree_iter_cmp_by_idx);
1233 #undef btree_iter_cmp_by_idx
1235 for (i = nr_sorted - 2; i >= 0; --i) {
1236 struct btree_iter *iter1 = trans->iters + sorted[i];
1237 struct btree_iter *iter2 = trans->iters + sorted[i + 1];
1239 if (iter1->btree_id == iter2->btree_id &&
1240 iter1->locks_want < iter2->locks_want)
1241 __bch2_btree_iter_upgrade(iter1, iter2->locks_want);
1242 else if (!iter1->locks_want && iter2->locks_want)
1243 __bch2_btree_iter_upgrade(iter1, 1);
1246 bch2_trans_unlock(trans);
1249 if (unlikely(ret == -ENOMEM)) {
1252 closure_init_stack(&cl);
1255 ret = bch2_btree_cache_cannibalize_lock(c, &cl);
1260 if (unlikely(ret == -EIO)) {
1261 trans->error = true;
1265 BUG_ON(ret && ret != -EINTR);
1267 /* Now, redo traversals in correct order: */
1268 for (i = 0; i < nr_sorted; i++) {
1269 unsigned idx = sorted[i];
1272 * sucessfully traversing one iterator can cause another to be
1273 * unlinked, in btree_key_cache_fill()
1275 if (!(trans->iters_linked & (1ULL << idx)))
1278 ret = btree_iter_traverse_one(&trans->iters[idx], _THIS_IP_);
1283 if (hweight64(trans->iters_live) > 1)
1286 trans_for_each_iter(trans, iter)
1287 if (iter->flags & BTREE_ITER_KEEP_UNTIL_COMMIT) {
1292 bch2_btree_cache_cannibalize_unlock(c);
1294 trans->in_traverse_all = false;
1296 trace_trans_traverse_all(trans->ip, trace_ip);
1300 int bch2_btree_iter_traverse_all(struct btree_trans *trans)
1302 return __btree_iter_traverse_all(trans, 0, _RET_IP_);
1305 static inline bool btree_iter_good_node(struct btree_iter *iter,
1306 unsigned l, int check_pos)
1308 if (!is_btree_node(iter, l) ||
1309 !bch2_btree_node_relock(iter, l))
1312 if (check_pos < 0 && btree_iter_pos_before_node(iter, iter->l[l].b))
1314 if (check_pos > 0 && btree_iter_pos_after_node(iter, iter->l[l].b))
1319 static inline unsigned btree_iter_up_until_good_node(struct btree_iter *iter,
1322 unsigned l = iter->level;
1324 while (btree_iter_node(iter, l) &&
1325 !btree_iter_good_node(iter, l, check_pos)) {
1326 btree_node_unlock(iter, l);
1327 iter->l[l].b = BTREE_ITER_NO_NODE_UP;
1335 * This is the main state machine for walking down the btree - walks down to a
1338 * Returns 0 on success, -EIO on error (error reading in a btree node).
1340 * On error, caller (peek_node()/peek_key()) must return NULL; the error is
1341 * stashed in the iterator and returned from bch2_trans_exit().
1343 static int btree_iter_traverse_one(struct btree_iter *iter,
1344 unsigned long trace_ip)
1346 unsigned depth_want = iter->level;
1350 * if we need interior nodes locked, call btree_iter_relock() to make
1351 * sure we walk back up enough that we lock them:
1353 if (iter->uptodate == BTREE_ITER_NEED_RELOCK ||
1354 iter->locks_want > 1)
1355 bch2_btree_iter_relock(iter, _THIS_IP_);
1357 if (btree_iter_type(iter) == BTREE_ITER_CACHED) {
1358 ret = bch2_btree_iter_traverse_cached(iter);
1362 if (iter->uptodate < BTREE_ITER_NEED_RELOCK)
1365 if (unlikely(iter->level >= BTREE_MAX_DEPTH))
1368 iter->level = btree_iter_up_until_good_node(iter, 0);
1371 * Note: iter->nodes[iter->level] may be temporarily NULL here - that
1372 * would indicate to other code that we got to the end of the btree,
1373 * here it indicates that relocking the root failed - it's critical that
1374 * btree_iter_lock_root() comes next and that it can't fail
1376 while (iter->level > depth_want) {
1377 ret = btree_iter_node(iter, iter->level)
1378 ? btree_iter_down(iter, trace_ip)
1379 : btree_iter_lock_root(iter, depth_want, trace_ip);
1380 if (unlikely(ret)) {
1383 * Got to the end of the btree (in
1384 * BTREE_ITER_NODES mode)
1390 iter->level = depth_want;
1393 iter->flags |= BTREE_ITER_ERROR;
1394 iter->l[iter->level].b =
1395 BTREE_ITER_NO_NODE_ERROR;
1397 iter->l[iter->level].b =
1398 BTREE_ITER_NO_NODE_DOWN;
1404 iter->uptodate = BTREE_ITER_NEED_PEEK;
1406 trace_iter_traverse(iter->trans->ip, trace_ip,
1407 iter->btree_id, &iter->real_pos, ret);
1408 bch2_btree_iter_verify(iter);
1412 static int __must_check __bch2_btree_iter_traverse(struct btree_iter *iter)
1414 struct btree_trans *trans = iter->trans;
1417 ret = bch2_trans_cond_resched(trans) ?:
1418 btree_iter_traverse_one(iter, _RET_IP_);
1420 ret = __btree_iter_traverse_all(trans, ret, _RET_IP_);
1427 * bch2_btree_iter_traverse() is for external users, btree_iter_traverse() is
1428 * for internal btree iterator users
1430 * bch2_btree_iter_traverse sets iter->real_pos to iter->pos,
1431 * btree_iter_traverse() does not:
1433 static inline int __must_check
1434 btree_iter_traverse(struct btree_iter *iter)
1436 return iter->uptodate >= BTREE_ITER_NEED_RELOCK
1437 ? __bch2_btree_iter_traverse(iter)
1442 bch2_btree_iter_traverse(struct btree_iter *iter)
1446 btree_iter_set_search_pos(iter, btree_iter_search_key(iter));
1448 ret = btree_iter_traverse(iter);
1452 iter->should_be_locked = true;
1456 /* Iterate across nodes (leaf and interior nodes) */
1458 struct btree *bch2_btree_iter_peek_node(struct btree_iter *iter)
1463 EBUG_ON(btree_iter_type(iter) != BTREE_ITER_NODES);
1464 bch2_btree_iter_verify(iter);
1466 ret = btree_iter_traverse(iter);
1470 b = btree_iter_node(iter, iter->level);
1474 BUG_ON(bpos_cmp(b->key.k.p, iter->pos) < 0);
1476 iter->pos = iter->real_pos = b->key.k.p;
1478 bch2_btree_iter_verify(iter);
1479 iter->should_be_locked = true;
1484 struct btree *bch2_btree_iter_next_node(struct btree_iter *iter)
1489 EBUG_ON(btree_iter_type(iter) != BTREE_ITER_NODES);
1490 bch2_btree_iter_verify(iter);
1492 /* already got to end? */
1493 if (!btree_iter_node(iter, iter->level))
1496 bch2_trans_cond_resched(iter->trans);
1498 btree_node_unlock(iter, iter->level);
1499 iter->l[iter->level].b = BTREE_ITER_NO_NODE_UP;
1502 btree_iter_set_dirty(iter, BTREE_ITER_NEED_TRAVERSE);
1503 ret = btree_iter_traverse(iter);
1508 b = btree_iter_node(iter, iter->level);
1512 if (bpos_cmp(iter->pos, b->key.k.p) < 0) {
1514 * Haven't gotten to the end of the parent node: go back down to
1515 * the next child node
1517 btree_iter_set_search_pos(iter, bpos_successor(iter->pos));
1519 /* Unlock to avoid screwing up our lock invariants: */
1520 btree_node_unlock(iter, iter->level);
1522 iter->level = iter->min_depth;
1523 btree_iter_set_dirty(iter, BTREE_ITER_NEED_TRAVERSE);
1524 bch2_btree_iter_verify(iter);
1526 ret = btree_iter_traverse(iter);
1530 b = iter->l[iter->level].b;
1533 iter->pos = iter->real_pos = b->key.k.p;
1535 bch2_btree_iter_verify(iter);
1536 iter->should_be_locked = true;
1541 /* Iterate across keys (in leaf nodes only) */
1543 static void btree_iter_set_search_pos(struct btree_iter *iter, struct bpos new_pos)
1545 struct bpos old_pos = iter->real_pos;
1546 int cmp = bpos_cmp(new_pos, iter->real_pos);
1547 unsigned l = iter->level;
1552 iter->real_pos = new_pos;
1553 iter->should_be_locked = false;
1555 if (unlikely(btree_iter_type(iter) == BTREE_ITER_CACHED)) {
1556 btree_node_unlock(iter, 0);
1557 iter->l[0].b = BTREE_ITER_NO_NODE_CACHED;
1558 btree_iter_set_dirty(iter, BTREE_ITER_NEED_TRAVERSE);
1562 l = btree_iter_up_until_good_node(iter, cmp);
1564 if (btree_iter_node(iter, l)) {
1566 * We might have to skip over many keys, or just a few: try
1567 * advancing the node iterator, and if we have to skip over too
1568 * many keys just reinit it (or if we're rewinding, since that
1572 !btree_iter_advance_to_pos(iter, &iter->l[l], 8))
1573 __btree_iter_init(iter, l);
1575 /* Don't leave it locked if we're not supposed to: */
1576 if (btree_lock_want(iter, l) == BTREE_NODE_UNLOCKED)
1577 btree_node_unlock(iter, l);
1580 if (l != iter->level)
1581 btree_iter_set_dirty(iter, BTREE_ITER_NEED_TRAVERSE);
1583 btree_iter_set_dirty(iter, BTREE_ITER_NEED_PEEK);
1585 bch2_btree_iter_verify(iter);
1586 #ifdef CONFIG_BCACHEFS_DEBUG
1587 trace_iter_set_search_pos(iter->trans->ip, _RET_IP_,
1589 &old_pos, &new_pos, l);
1593 inline bool bch2_btree_iter_advance(struct btree_iter *iter)
1595 struct bpos pos = iter->k.p;
1596 bool ret = bpos_cmp(pos, POS_MAX) != 0;
1598 if (ret && !(iter->flags & BTREE_ITER_IS_EXTENTS))
1599 pos = bkey_successor(iter, pos);
1600 bch2_btree_iter_set_pos(iter, pos);
1604 inline bool bch2_btree_iter_rewind(struct btree_iter *iter)
1606 struct bpos pos = bkey_start_pos(&iter->k);
1607 bool ret = bpos_cmp(pos, POS_MIN) != 0;
1609 if (ret && !(iter->flags & BTREE_ITER_IS_EXTENTS))
1610 pos = bkey_predecessor(iter, pos);
1611 bch2_btree_iter_set_pos(iter, pos);
1615 static inline bool btree_iter_set_pos_to_next_leaf(struct btree_iter *iter)
1617 struct bpos next_pos = iter->l[0].b->key.k.p;
1618 bool ret = bpos_cmp(next_pos, POS_MAX) != 0;
1621 * Typically, we don't want to modify iter->pos here, since that
1622 * indicates where we searched from - unless we got to the end of the
1623 * btree, in that case we want iter->pos to reflect that:
1626 btree_iter_set_search_pos(iter, bpos_successor(next_pos));
1628 bch2_btree_iter_set_pos(iter, POS_MAX);
1633 static inline bool btree_iter_set_pos_to_prev_leaf(struct btree_iter *iter)
1635 struct bpos next_pos = iter->l[0].b->data->min_key;
1636 bool ret = bpos_cmp(next_pos, POS_MIN) != 0;
1639 btree_iter_set_search_pos(iter, bpos_predecessor(next_pos));
1641 bch2_btree_iter_set_pos(iter, POS_MIN);
1646 static inline struct bkey_i *btree_trans_peek_updates(struct btree_iter *iter,
1649 struct btree_insert_entry *i;
1651 if (!(iter->flags & BTREE_ITER_WITH_UPDATES))
1654 trans_for_each_update(iter->trans, i)
1655 if ((cmp_int(iter->btree_id, i->iter->btree_id) ?:
1656 bkey_cmp(pos, i->k->k.p)) <= 0) {
1657 if (iter->btree_id == i->iter->btree_id)
1666 * bch2_btree_iter_peek: returns first key greater than or equal to iterator's
1669 struct bkey_s_c bch2_btree_iter_peek(struct btree_iter *iter)
1671 struct bpos search_key = btree_iter_search_key(iter);
1672 struct bkey_i *next_update;
1676 EBUG_ON(btree_iter_type(iter) != BTREE_ITER_KEYS);
1677 bch2_btree_iter_verify(iter);
1678 bch2_btree_iter_verify_entry_exit(iter);
1680 next_update = btree_trans_peek_updates(iter, search_key);
1681 btree_iter_set_search_pos(iter, search_key);
1684 ret = btree_iter_traverse(iter);
1686 return bkey_s_c_err(ret);
1688 k = btree_iter_level_peek(iter, &iter->l[0]);
1691 bpos_cmp(next_update->k.p, iter->real_pos) <= 0) {
1692 iter->k = next_update->k;
1693 k = bkey_i_to_s_c(next_update);
1697 if (bkey_deleted(k.k)) {
1698 search_key = bkey_successor(iter, k.k->p);
1705 if (!btree_iter_set_pos_to_next_leaf(iter))
1706 return bkey_s_c_null;
1710 * iter->pos should be mononotically increasing, and always be equal to
1711 * the key we just returned - except extents can straddle iter->pos:
1713 if (!(iter->flags & BTREE_ITER_IS_EXTENTS))
1715 else if (bkey_cmp(bkey_start_pos(k.k), iter->pos) > 0)
1716 iter->pos = bkey_start_pos(k.k);
1718 bch2_btree_iter_verify_entry_exit(iter);
1719 bch2_btree_iter_verify(iter);
1720 iter->should_be_locked = true;
1725 * bch2_btree_iter_next: returns first key greater than iterator's current
1728 struct bkey_s_c bch2_btree_iter_next(struct btree_iter *iter)
1730 if (!bch2_btree_iter_advance(iter))
1731 return bkey_s_c_null;
1733 return bch2_btree_iter_peek(iter);
1737 * bch2_btree_iter_peek_prev: returns first key less than or equal to
1738 * iterator's current position
1740 struct bkey_s_c bch2_btree_iter_peek_prev(struct btree_iter *iter)
1742 struct btree_iter_level *l = &iter->l[0];
1746 EBUG_ON(btree_iter_type(iter) != BTREE_ITER_KEYS);
1747 EBUG_ON(iter->flags & BTREE_ITER_WITH_UPDATES);
1748 bch2_btree_iter_verify(iter);
1749 bch2_btree_iter_verify_entry_exit(iter);
1751 btree_iter_set_search_pos(iter, iter->pos);
1754 ret = btree_iter_traverse(iter);
1755 if (unlikely(ret)) {
1756 k = bkey_s_c_err(ret);
1760 k = btree_iter_level_peek(iter, l);
1762 ((iter->flags & BTREE_ITER_IS_EXTENTS)
1763 ? bkey_cmp(bkey_start_pos(k.k), iter->pos) >= 0
1764 : bkey_cmp(bkey_start_pos(k.k), iter->pos) > 0))
1765 k = btree_iter_level_prev(iter, l);
1770 if (!btree_iter_set_pos_to_prev_leaf(iter)) {
1776 EBUG_ON(bkey_cmp(bkey_start_pos(k.k), iter->pos) > 0);
1778 /* Extents can straddle iter->pos: */
1779 if (bkey_cmp(k.k->p, iter->pos) < 0)
1782 bch2_btree_iter_verify_entry_exit(iter);
1783 bch2_btree_iter_verify(iter);
1784 iter->should_be_locked = true;
1788 * btree_iter_level_peek() may have set iter->k to a key we didn't want, and
1789 * then we errored going to the previous leaf - make sure it's
1790 * consistent with iter->pos:
1792 bkey_init(&iter->k);
1793 iter->k.p = iter->pos;
1798 * bch2_btree_iter_prev: returns first key less than iterator's current
1801 struct bkey_s_c bch2_btree_iter_prev(struct btree_iter *iter)
1803 if (!bch2_btree_iter_rewind(iter))
1804 return bkey_s_c_null;
1806 return bch2_btree_iter_peek_prev(iter);
1809 struct bkey_s_c bch2_btree_iter_peek_slot(struct btree_iter *iter)
1811 struct bpos search_key;
1815 EBUG_ON(btree_iter_type(iter) != BTREE_ITER_KEYS &&
1816 btree_iter_type(iter) != BTREE_ITER_CACHED);
1817 bch2_btree_iter_verify(iter);
1818 bch2_btree_iter_verify_entry_exit(iter);
1820 /* extents can't span inode numbers: */
1821 if ((iter->flags & BTREE_ITER_IS_EXTENTS) &&
1822 unlikely(iter->pos.offset == KEY_OFFSET_MAX)) {
1823 if (iter->pos.inode == KEY_INODE_MAX)
1824 return bkey_s_c_null;
1826 bch2_btree_iter_set_pos(iter, bpos_nosnap_successor(iter->pos));
1829 search_key = btree_iter_search_key(iter);
1830 btree_iter_set_search_pos(iter, search_key);
1832 ret = btree_iter_traverse(iter);
1834 return bkey_s_c_err(ret);
1836 if (btree_iter_type(iter) == BTREE_ITER_CACHED ||
1837 !(iter->flags & BTREE_ITER_IS_EXTENTS)) {
1838 struct bkey_i *next_update;
1839 struct bkey_cached *ck;
1841 switch (btree_iter_type(iter)) {
1842 case BTREE_ITER_KEYS:
1843 k = btree_iter_level_peek_all(iter, &iter->l[0]);
1844 EBUG_ON(k.k && bkey_deleted(k.k) && bkey_cmp(k.k->p, iter->pos) == 0);
1846 case BTREE_ITER_CACHED:
1847 ck = (void *) iter->l[0].b;
1848 EBUG_ON(iter->btree_id != ck->key.btree_id ||
1849 bkey_cmp(iter->pos, ck->key.pos));
1852 k = bkey_i_to_s_c(ck->k);
1854 case BTREE_ITER_NODES:
1858 next_update = btree_trans_peek_updates(iter, search_key);
1860 (!k.k || bpos_cmp(next_update->k.p, k.k->p) <= 0)) {
1861 iter->k = next_update->k;
1862 k = bkey_i_to_s_c(next_update);
1865 if ((iter->flags & BTREE_ITER_INTENT)) {
1866 struct btree_iter *child =
1867 btree_iter_child_alloc(iter, _THIS_IP_);
1869 btree_iter_copy(child, iter);
1870 k = bch2_btree_iter_peek(child);
1872 if (k.k && !bkey_err(k))
1875 struct bpos pos = iter->pos;
1877 k = bch2_btree_iter_peek(iter);
1881 if (unlikely(bkey_err(k)))
1885 if (!(iter->flags & BTREE_ITER_IS_EXTENTS)) {
1887 ((iter->flags & BTREE_ITER_ALL_SNAPSHOTS)
1888 ? bpos_cmp(iter->pos, k.k->p)
1889 : bkey_cmp(iter->pos, k.k->p))) {
1890 bkey_init(&iter->k);
1891 iter->k.p = iter->pos;
1892 k = (struct bkey_s_c) { &iter->k, NULL };
1895 struct bpos next = k.k ? bkey_start_pos(k.k) : POS_MAX;
1897 if (bkey_cmp(iter->pos, next) < 0) {
1898 bkey_init(&iter->k);
1899 iter->k.p = iter->pos;
1900 bch2_key_resize(&iter->k,
1901 min_t(u64, KEY_SIZE_MAX,
1902 (next.inode == iter->pos.inode
1907 k = (struct bkey_s_c) { &iter->k, NULL };
1908 EBUG_ON(!k.k->size);
1912 bch2_btree_iter_verify_entry_exit(iter);
1913 bch2_btree_iter_verify(iter);
1914 iter->should_be_locked = true;
1919 struct bkey_s_c bch2_btree_iter_next_slot(struct btree_iter *iter)
1921 if (!bch2_btree_iter_advance(iter))
1922 return bkey_s_c_null;
1924 return bch2_btree_iter_peek_slot(iter);
1927 struct bkey_s_c bch2_btree_iter_prev_slot(struct btree_iter *iter)
1929 if (!bch2_btree_iter_rewind(iter))
1930 return bkey_s_c_null;
1932 return bch2_btree_iter_peek_slot(iter);
1935 static inline void bch2_btree_iter_init(struct btree_trans *trans,
1936 struct btree_iter *iter, enum btree_id btree_id)
1938 struct bch_fs *c = trans->c;
1941 iter->trans = trans;
1942 iter->uptodate = BTREE_ITER_NEED_TRAVERSE;
1943 iter->btree_id = btree_id;
1944 iter->real_pos = POS_MIN;
1946 iter->min_depth = 0;
1947 iter->locks_want = 0;
1948 iter->nodes_locked = 0;
1949 iter->nodes_intent_locked = 0;
1950 for (i = 0; i < ARRAY_SIZE(iter->l); i++)
1951 iter->l[i].b = BTREE_ITER_NO_NODE_INIT;
1953 prefetch(c->btree_roots[btree_id].b);
1956 /* new transactional stuff: */
1958 static void btree_iter_child_free(struct btree_iter *iter)
1960 struct btree_iter *child = btree_iter_child(iter);
1963 bch2_trans_iter_free(iter->trans, child);
1964 iter->child_idx = U8_MAX;
1968 static struct btree_iter *btree_iter_child_alloc(struct btree_iter *iter,
1971 struct btree_trans *trans = iter->trans;
1972 struct btree_iter *child = btree_iter_child(iter);
1975 child = btree_trans_iter_alloc(trans);
1976 child->ip_allocated = ip;
1977 iter->child_idx = child->idx;
1979 trans->iters_live |= 1ULL << child->idx;
1980 trans->iters_touched |= 1ULL << child->idx;
1986 static inline void __bch2_trans_iter_free(struct btree_trans *trans,
1989 btree_iter_child_free(&trans->iters[idx]);
1991 __bch2_btree_iter_unlock(&trans->iters[idx]);
1992 trans->iters_linked &= ~(1ULL << idx);
1993 trans->iters_live &= ~(1ULL << idx);
1994 trans->iters_touched &= ~(1ULL << idx);
1997 int bch2_trans_iter_put(struct btree_trans *trans,
1998 struct btree_iter *iter)
2002 if (IS_ERR_OR_NULL(iter))
2005 BUG_ON(trans->iters + iter->idx != iter);
2006 BUG_ON(!btree_iter_live(trans, iter));
2008 ret = btree_iter_err(iter);
2010 if (!(trans->iters_touched & (1ULL << iter->idx)) &&
2011 !(iter->flags & BTREE_ITER_KEEP_UNTIL_COMMIT))
2012 __bch2_trans_iter_free(trans, iter->idx);
2014 trans->iters_live &= ~(1ULL << iter->idx);
2018 int bch2_trans_iter_free(struct btree_trans *trans,
2019 struct btree_iter *iter)
2021 if (IS_ERR_OR_NULL(iter))
2024 set_btree_iter_dontneed(trans, iter);
2026 return bch2_trans_iter_put(trans, iter);
2030 static void btree_trans_iter_alloc_fail(struct btree_trans *trans)
2033 struct btree_iter *iter;
2034 struct btree_insert_entry *i;
2037 trans_for_each_iter(trans, iter)
2038 printk(KERN_ERR "iter: btree %s pos %s%s%s%s %pS\n",
2039 bch2_btree_ids[iter->btree_id],
2040 (bch2_bpos_to_text(&PBUF(buf), iter->pos), buf),
2041 btree_iter_live(trans, iter) ? " live" : "",
2042 (trans->iters_touched & (1ULL << iter->idx)) ? " touched" : "",
2043 iter->flags & BTREE_ITER_KEEP_UNTIL_COMMIT ? " keep" : "",
2044 (void *) iter->ip_allocated);
2046 trans_for_each_update(trans, i) {
2049 bch2_bkey_val_to_text(&PBUF(buf), trans->c, bkey_i_to_s_c(i->k));
2050 printk(KERN_ERR "update: btree %s %s\n",
2051 bch2_btree_ids[i->iter->btree_id], buf);
2053 panic("trans iter oveflow\n");
2056 static struct btree_iter *btree_trans_iter_alloc(struct btree_trans *trans)
2058 struct btree_iter *iter;
2061 if (unlikely(trans->iters_linked ==
2062 ~((~0ULL << 1) << (BTREE_ITER_MAX - 1))))
2063 btree_trans_iter_alloc_fail(trans);
2065 idx = __ffs64(~trans->iters_linked);
2066 iter = &trans->iters[idx];
2068 iter->trans = trans;
2070 iter->child_idx = U8_MAX;
2072 iter->nodes_locked = 0;
2073 iter->nodes_intent_locked = 0;
2074 trans->iters_linked |= 1ULL << idx;
2078 static void btree_iter_copy(struct btree_iter *dst, struct btree_iter *src)
2082 __bch2_btree_iter_unlock(dst);
2083 btree_iter_child_free(dst);
2085 memcpy(&dst->flags, &src->flags,
2086 sizeof(struct btree_iter) - offsetof(struct btree_iter, flags));
2088 for (i = 0; i < BTREE_MAX_DEPTH; i++)
2089 if (btree_node_locked(dst, i))
2090 six_lock_increment(&dst->l[i].b->c.lock,
2091 __btree_lock_want(dst, i));
2093 dst->flags &= ~BTREE_ITER_KEEP_UNTIL_COMMIT;
2094 dst->flags &= ~BTREE_ITER_SET_POS_AFTER_COMMIT;
2097 struct btree_iter *__bch2_trans_get_iter(struct btree_trans *trans,
2098 unsigned btree_id, struct bpos pos,
2099 unsigned locks_want,
2103 struct btree_iter *iter, *best = NULL;
2104 struct bpos real_pos, pos_min = POS_MIN;
2106 if ((flags & BTREE_ITER_TYPE) != BTREE_ITER_NODES &&
2107 btree_node_type_is_extents(btree_id) &&
2108 !(flags & BTREE_ITER_NOT_EXTENTS) &&
2109 !(flags & BTREE_ITER_ALL_SNAPSHOTS))
2110 flags |= BTREE_ITER_IS_EXTENTS;
2112 if ((flags & BTREE_ITER_TYPE) != BTREE_ITER_NODES &&
2113 !btree_type_has_snapshots(btree_id))
2114 flags &= ~BTREE_ITER_ALL_SNAPSHOTS;
2116 if (!(flags & BTREE_ITER_ALL_SNAPSHOTS))
2117 pos.snapshot = btree_type_has_snapshots(btree_id)
2122 if ((flags & BTREE_ITER_IS_EXTENTS) &&
2123 bkey_cmp(pos, POS_MAX))
2124 real_pos = bpos_nosnap_successor(pos);
2126 trans_for_each_iter(trans, iter) {
2127 if (btree_iter_type(iter) != (flags & BTREE_ITER_TYPE))
2130 if (iter->btree_id != btree_id)
2134 int cmp = bkey_cmp(bpos_diff(best->real_pos, real_pos),
2135 bpos_diff(iter->real_pos, real_pos));
2138 ((cmp == 0 && btree_iter_keep(trans, iter))))
2146 iter = btree_trans_iter_alloc(trans);
2147 bch2_btree_iter_init(trans, iter, btree_id);
2148 } else if (btree_iter_keep(trans, best)) {
2149 iter = btree_trans_iter_alloc(trans);
2150 btree_iter_copy(iter, best);
2155 trans->iters_live |= 1ULL << iter->idx;
2156 trans->iters_touched |= 1ULL << iter->idx;
2158 iter->flags = flags;
2160 iter->snapshot = pos.snapshot;
2163 * If the iterator has locks_want greater than requested, we explicitly
2164 * do not downgrade it here - on transaction restart because btree node
2165 * split needs to upgrade locks, we might be putting/getting the
2166 * iterator again. Downgrading iterators only happens via an explicit
2167 * bch2_trans_downgrade().
2170 locks_want = min(locks_want, BTREE_MAX_DEPTH);
2171 if (locks_want > iter->locks_want) {
2172 iter->locks_want = locks_want;
2173 btree_iter_get_locks(iter, true, _THIS_IP_);
2176 while (iter->level != depth) {
2177 btree_node_unlock(iter, iter->level);
2178 iter->l[iter->level].b = BTREE_ITER_NO_NODE_INIT;
2179 iter->uptodate = BTREE_ITER_NEED_TRAVERSE;
2180 if (iter->level < depth)
2186 iter->min_depth = depth;
2188 bch2_btree_iter_set_pos(iter, pos);
2189 btree_iter_set_search_pos(iter, real_pos);
2191 trace_trans_get_iter(_RET_IP_, trans->ip,
2193 &real_pos, locks_want, iter->uptodate,
2194 best ? &best->real_pos : &pos_min,
2195 best ? best->locks_want : U8_MAX,
2196 best ? best->uptodate : U8_MAX);
2201 struct btree_iter *bch2_trans_get_node_iter(struct btree_trans *trans,
2202 enum btree_id btree_id,
2204 unsigned locks_want,
2208 struct btree_iter *iter =
2209 __bch2_trans_get_iter(trans, btree_id, pos,
2212 BTREE_ITER_NOT_EXTENTS|
2213 BTREE_ITER_ALL_SNAPSHOTS|
2216 BUG_ON(bkey_cmp(iter->pos, pos));
2217 BUG_ON(iter->locks_want != min(locks_want, BTREE_MAX_DEPTH));
2218 BUG_ON(iter->level != depth);
2219 BUG_ON(iter->min_depth != depth);
2220 iter->ip_allocated = _RET_IP_;
2225 struct btree_iter *__bch2_trans_copy_iter(struct btree_trans *trans,
2226 struct btree_iter *src)
2228 struct btree_iter *iter;
2230 iter = btree_trans_iter_alloc(trans);
2231 btree_iter_copy(iter, src);
2233 trans->iters_live |= 1ULL << iter->idx;
2235 * We don't need to preserve this iter since it's cheap to copy it
2236 * again - this will cause trans_iter_put() to free it right away:
2238 set_btree_iter_dontneed(trans, iter);
2243 void *bch2_trans_kmalloc(struct btree_trans *trans, size_t size)
2245 size_t new_top = trans->mem_top + size;
2248 if (new_top > trans->mem_bytes) {
2249 size_t old_bytes = trans->mem_bytes;
2250 size_t new_bytes = roundup_pow_of_two(new_top);
2253 WARN_ON_ONCE(new_bytes > BTREE_TRANS_MEM_MAX);
2255 new_mem = krealloc(trans->mem, new_bytes, GFP_NOFS);
2256 if (!new_mem && new_bytes <= BTREE_TRANS_MEM_MAX) {
2257 new_mem = mempool_alloc(&trans->c->btree_trans_mem_pool, GFP_KERNEL);
2258 new_bytes = BTREE_TRANS_MEM_MAX;
2263 return ERR_PTR(-ENOMEM);
2265 trans->mem = new_mem;
2266 trans->mem_bytes = new_bytes;
2269 trace_trans_restart_mem_realloced(trans->ip, _RET_IP_, new_bytes);
2270 return ERR_PTR(-EINTR);
2274 p = trans->mem + trans->mem_top;
2275 trans->mem_top += size;
2280 inline void bch2_trans_unlink_iters(struct btree_trans *trans)
2282 u64 iters = trans->iters_linked &
2283 ~trans->iters_touched &
2287 unsigned idx = __ffs64(iters);
2289 iters &= ~(1ULL << idx);
2290 __bch2_trans_iter_free(trans, idx);
2294 void bch2_trans_reset(struct btree_trans *trans, unsigned flags)
2296 struct btree_iter *iter;
2298 trans_for_each_iter(trans, iter) {
2299 iter->flags &= ~(BTREE_ITER_KEEP_UNTIL_COMMIT|
2300 BTREE_ITER_SET_POS_AFTER_COMMIT);
2301 iter->should_be_locked = false;
2304 bch2_trans_unlink_iters(trans);
2306 trans->iters_touched &= trans->iters_live;
2308 trans->extra_journal_res = 0;
2309 trans->nr_updates = 0;
2312 trans->hooks = NULL;
2313 trans->extra_journal_entries = NULL;
2314 trans->extra_journal_entry_u64s = 0;
2316 if (trans->fs_usage_deltas) {
2317 trans->fs_usage_deltas->used = 0;
2318 memset(&trans->fs_usage_deltas->memset_start, 0,
2319 (void *) &trans->fs_usage_deltas->memset_end -
2320 (void *) &trans->fs_usage_deltas->memset_start);
2323 if (!(flags & TRANS_RESET_NOUNLOCK))
2324 bch2_trans_cond_resched(trans);
2326 if (!(flags & TRANS_RESET_NOTRAVERSE) &&
2327 trans->iters_linked)
2328 bch2_btree_iter_traverse_all(trans);
2331 static void bch2_trans_alloc_iters(struct btree_trans *trans, struct bch_fs *c)
2333 size_t iters_bytes = sizeof(struct btree_iter) * BTREE_ITER_MAX;
2334 size_t updates_bytes = sizeof(struct btree_insert_entry) * BTREE_ITER_MAX;
2337 BUG_ON(trans->used_mempool);
2340 p = this_cpu_xchg(c->btree_iters_bufs->iter, NULL);
2343 p = mempool_alloc(&trans->c->btree_iters_pool, GFP_NOFS);
2345 trans->iters = p; p += iters_bytes;
2346 trans->updates = p; p += updates_bytes;
2349 void bch2_trans_init(struct btree_trans *trans, struct bch_fs *c,
2350 unsigned expected_nr_iters,
2351 size_t expected_mem_bytes)
2352 __acquires(&c->btree_trans_barrier)
2354 memset(trans, 0, sizeof(*trans));
2356 trans->ip = _RET_IP_;
2359 * reallocating iterators currently completely breaks
2360 * bch2_trans_iter_put(), we always allocate the max:
2362 bch2_trans_alloc_iters(trans, c);
2364 if (expected_mem_bytes) {
2365 trans->mem_bytes = roundup_pow_of_two(expected_mem_bytes);
2366 trans->mem = kmalloc(trans->mem_bytes, GFP_KERNEL|__GFP_NOFAIL);
2368 if (!unlikely(trans->mem)) {
2369 trans->mem = mempool_alloc(&c->btree_trans_mem_pool, GFP_KERNEL);
2370 trans->mem_bytes = BTREE_TRANS_MEM_MAX;
2374 trans->srcu_idx = srcu_read_lock(&c->btree_trans_barrier);
2376 #ifdef CONFIG_BCACHEFS_DEBUG
2377 trans->pid = current->pid;
2378 mutex_lock(&c->btree_trans_lock);
2379 list_add(&trans->list, &c->btree_trans_list);
2380 mutex_unlock(&c->btree_trans_lock);
2384 int bch2_trans_exit(struct btree_trans *trans)
2385 __releases(&c->btree_trans_barrier)
2387 struct bch_fs *c = trans->c;
2389 bch2_trans_unlock(trans);
2391 #ifdef CONFIG_BCACHEFS_DEBUG
2392 if (trans->iters_live) {
2393 struct btree_iter *iter;
2395 trans_for_each_iter(trans, iter)
2396 btree_iter_child_free(iter);
2399 if (trans->iters_live) {
2400 struct btree_iter *iter;
2402 bch_err(c, "btree iterators leaked!");
2403 trans_for_each_iter(trans, iter)
2404 if (btree_iter_live(trans, iter))
2405 printk(KERN_ERR " btree %s allocated at %pS\n",
2406 bch2_btree_ids[iter->btree_id],
2407 (void *) iter->ip_allocated);
2408 /* Be noisy about this: */
2409 bch2_fatal_error(c);
2412 mutex_lock(&trans->c->btree_trans_lock);
2413 list_del(&trans->list);
2414 mutex_unlock(&trans->c->btree_trans_lock);
2417 srcu_read_unlock(&c->btree_trans_barrier, trans->srcu_idx);
2419 bch2_journal_preres_put(&trans->c->journal, &trans->journal_preres);
2421 if (trans->fs_usage_deltas) {
2422 if (trans->fs_usage_deltas->size + sizeof(trans->fs_usage_deltas) ==
2423 REPLICAS_DELTA_LIST_MAX)
2424 mempool_free(trans->fs_usage_deltas,
2425 &trans->c->replicas_delta_pool);
2427 kfree(trans->fs_usage_deltas);
2430 if (trans->mem_bytes == BTREE_TRANS_MEM_MAX)
2431 mempool_free(trans->mem, &trans->c->btree_trans_mem_pool);
2437 * Userspace doesn't have a real percpu implementation:
2439 trans->iters = this_cpu_xchg(c->btree_iters_bufs->iter, trans->iters);
2443 mempool_free(trans->iters, &trans->c->btree_iters_pool);
2445 trans->mem = (void *) 0x1;
2446 trans->iters = (void *) 0x1;
2448 return trans->error ? -EIO : 0;
2451 static void __maybe_unused
2452 bch2_btree_iter_node_to_text(struct printbuf *out,
2453 struct btree_bkey_cached_common *_b,
2454 enum btree_iter_type type)
2456 pr_buf(out, " l=%u %s:",
2457 _b->level, bch2_btree_ids[_b->btree_id]);
2458 bch2_bpos_to_text(out, btree_node_pos(_b, type));
2461 #ifdef CONFIG_BCACHEFS_DEBUG
2462 static bool trans_has_btree_nodes_locked(struct btree_trans *trans)
2464 struct btree_iter *iter;
2466 trans_for_each_iter(trans, iter)
2467 if (btree_iter_type(iter) != BTREE_ITER_CACHED &&
2474 void bch2_btree_trans_to_text(struct printbuf *out, struct bch_fs *c)
2476 #ifdef CONFIG_BCACHEFS_DEBUG
2477 struct btree_trans *trans;
2478 struct btree_iter *iter;
2482 mutex_lock(&c->btree_trans_lock);
2483 list_for_each_entry(trans, &c->btree_trans_list, list) {
2484 if (!trans_has_btree_nodes_locked(trans))
2487 pr_buf(out, "%i %ps\n", trans->pid, (void *) trans->ip);
2489 trans_for_each_iter(trans, iter) {
2490 if (!iter->nodes_locked)
2493 pr_buf(out, " iter %u %c %s:",
2495 btree_iter_type(iter) == BTREE_ITER_CACHED ? 'c' : 'b',
2496 bch2_btree_ids[iter->btree_id]);
2497 bch2_bpos_to_text(out, iter->pos);
2500 for (l = 0; l < BTREE_MAX_DEPTH; l++) {
2501 if (btree_node_locked(iter, l)) {
2502 pr_buf(out, " %s l=%u ",
2503 btree_node_intent_locked(iter, l) ? "i" : "r", l);
2504 bch2_btree_iter_node_to_text(out,
2505 (void *) iter->l[l].b,
2506 btree_iter_type(iter));
2512 b = READ_ONCE(trans->locking);
2514 iter = &trans->iters[trans->locking_iter_idx];
2515 pr_buf(out, " locking iter %u %c l=%u %s:",
2516 trans->locking_iter_idx,
2517 btree_iter_type(iter) == BTREE_ITER_CACHED ? 'c' : 'b',
2518 trans->locking_level,
2519 bch2_btree_ids[trans->locking_btree_id]);
2520 bch2_bpos_to_text(out, trans->locking_pos);
2522 pr_buf(out, " node ");
2523 bch2_btree_iter_node_to_text(out,
2525 btree_iter_type(iter));
2529 mutex_unlock(&c->btree_trans_lock);
2533 void bch2_fs_btree_iter_exit(struct bch_fs *c)
2535 mempool_exit(&c->btree_trans_mem_pool);
2536 mempool_exit(&c->btree_iters_pool);
2537 cleanup_srcu_struct(&c->btree_trans_barrier);
2540 int bch2_fs_btree_iter_init(struct bch_fs *c)
2542 unsigned nr = BTREE_ITER_MAX;
2544 INIT_LIST_HEAD(&c->btree_trans_list);
2545 mutex_init(&c->btree_trans_lock);
2547 return init_srcu_struct(&c->btree_trans_barrier) ?:
2548 mempool_init_kmalloc_pool(&c->btree_iters_pool, 1,
2549 sizeof(struct btree_iter) * nr +
2550 sizeof(struct btree_insert_entry) * nr) ?:
2551 mempool_init_kmalloc_pool(&c->btree_trans_mem_pool, 1,
2552 BTREE_TRANS_MEM_MAX);