if (iter->uptodate == BTREE_ITER_NEED_RELOCK)
iter->uptodate = BTREE_ITER_NEED_PEEK;
- bch2_btree_trans_verify_locks(trans);
+ bch2_trans_verify_locks(trans);
return iter->uptodate < BTREE_ITER_NEED_RELOCK;
}
}
}
-void bch2_btree_trans_verify_locks(struct btree_trans *trans)
+void bch2_trans_verify_locks(struct btree_trans *trans)
{
struct btree_iter *iter;
bkey_cmp(iter->pos, iter->k.p) > 0));
}
-void bch2_btree_trans_verify_iters(struct btree_trans *trans, struct btree *b)
+void bch2_trans_verify_iters(struct btree_trans *trans, struct btree *b)
{
struct btree_iter *iter;
(_iter)->idx + 1))
#ifdef CONFIG_BCACHEFS_DEBUG
-void bch2_btree_trans_verify_iters(struct btree_trans *, struct btree *);
-void bch2_btree_trans_verify_locks(struct btree_trans *);
+void bch2_trans_verify_iters(struct btree_trans *, struct btree *);
+void bch2_trans_verify_locks(struct btree_trans *);
#else
-static inline void bch2_btree_trans_verify_iters(struct btree_trans *trans,
- struct btree *b) {}
-static inline void bch2_btree_trans_verify_locks(struct btree_trans *iter) {}
+static inline void bch2_trans_verify_iters(struct btree_trans *trans,
+ struct btree *b) {}
+static inline void bch2_trans_verify_locks(struct btree_trans *iter) {}
#endif
void bch2_btree_iter_fix_key_modified(struct btree_trans *trans,
six_unlock_intent(&n2->c.lock);
six_unlock_intent(&n1->c.lock);
- bch2_btree_trans_verify_locks(trans);
+ bch2_trans_verify_locks(trans);
bch2_time_stats_update(&c->times[BCH_TIME_btree_node_split],
start_time);
trans_for_each_iter_with_node(trans, b, linked)
bch2_btree_node_iter_peek(&linked->l[b->c.level].iter, b);
- bch2_btree_trans_verify_iters(trans, b);
+ bch2_trans_verify_iters(trans, b);
}
/**
bch2_trans_node_add(trans, n);
- bch2_btree_trans_verify_iters(trans, n);
+ bch2_trans_verify_iters(trans, n);
bch2_btree_node_free_inmem(trans, b);
bch2_btree_node_free_inmem(trans, m);
bch2_btree_update_done(as);
out:
- bch2_btree_trans_verify_locks(trans);
+ bch2_trans_verify_locks(trans);
bch2_trans_iter_free(trans, sib_iter);
/*
}
btree_insert_entry_checks(trans, i);
}
- bch2_btree_trans_verify_locks(trans);
+ bch2_trans_verify_locks(trans);
trans_for_each_update(trans, i)
if (!same_leaf_as_prev(trans, i))
ret = do_bch2_trans_commit(trans, &i, _RET_IP_);
/* make sure we didn't drop or screw up locks: */
- bch2_btree_trans_verify_locks(trans);
+ bch2_trans_verify_locks(trans);
if (ret)
goto err;