Lines Matching refs:f
459 struct get_locks_fail *f, in btree_path_get_locks() argument
481 if (f) { in btree_path_get_locks()
482 f->l = l; in btree_path_get_locks()
483 f->b = path->l[l].b; in btree_path_get_locks()
654 struct get_locks_fail f = {}; in __bch2_btree_path_upgrade() local
655 int ret = btree_path_get_locks(trans, path, true, &f, in __bch2_btree_path_upgrade()
701 old_locks_want, new_locks_want, f.l); in __bch2_btree_path_upgrade()
704 prt_printf(&buf, "node %s ", IS_ERR(f.b) ? bch2_err_str(PTR_ERR(f.b)) : in __bch2_btree_path_upgrade()
705 !f.b ? "(null)" : "(node)"); in __bch2_btree_path_upgrade()
707 IS_ERR_OR_NULL(f.b) ? 0 : f.b->c.lock.seq, in __bch2_btree_path_upgrade()
708 path->l[f.l].lock_seq); in __bch2_btree_path_upgrade()
774 struct get_locks_fail *f, bool trace, ulong ip) in bch2_trans_relock_fail() argument
785 f->l, path->l[f->l].lock_seq); in bch2_trans_relock_fail()
786 if (IS_ERR_OR_NULL(f->b)) { in bch2_trans_relock_fail()
787 prt_str(&buf, bch2_err_str(PTR_ERR(f->b))); in bch2_trans_relock_fail()
789 prt_printf(&buf, "%u", f->b->c.lock.seq); in bch2_trans_relock_fail()
792 bch2_btree_node_lock_counts(trans, NULL, &f->b->c, f->l); in bch2_trans_relock_fail()
795 c = six_lock_counts(&f->b->c.lock); in bch2_trans_relock_fail()
822 struct get_locks_fail f; in __bch2_trans_relock() local
826 (ret = btree_path_get_locks(trans, path, false, &f, in __bch2_trans_relock()
828 bch2_trans_relock_fail(trans, path, &f, trace, ip); in __bch2_trans_relock()