Home
last modified time | relevance | path

Searched refs:lock_seq (Results 1 – 8 of 8) sorted by relevance

/linux/fs/bcachefs/
A Dbtree_locking.h173 EBUG_ON(path->l[b->c.level].lock_seq != six_lock_seq(&b->c.lock)); in bch2_btree_node_unlock_write_inlined()
179 linked->l[b->c.level].lock_seq++; in bch2_btree_node_unlock_write_inlined()
307 EBUG_ON(path->l[b->level].lock_seq != six_lock_seq(&b->lock)); in __btree_node_lock_write()
A Dbtree_locking.c497 if (six_relock_type(&b->c.lock, want, path->l[level].lock_seq) || in __bch2_btree_node_relock()
549 if (six_relock_type(&b->c.lock, SIX_LOCK_intent, path->l[level].lock_seq)) in bch2_btree_node_upgrade()
740 prt_printf(&buf, " l=%u seq=%u node seq=", f->l, path->l[f->l].lock_seq); in bch2_trans_relock_fail()
A Dtrace.h594 __entry->iter_lock_seq = path->l[level].lock_seq;
658 __entry->iter_lock_seq = path->l[level].lock_seq;
1144 __entry->path_seq = path->l[f->l].lock_seq;
1497 __field(u32, lock_seq )
1507 __entry->lock_seq = six_lock_seq(&b->lock);
1516 __entry->lock_seq)
A Dbtree_types.h338 u32 lock_seq; member
A Dbtree_key_cache.c46 path->l[0].lock_seq = six_lock_seq(&ck->c.lock); in btree_path_cached_set()
A Dbtree_iter.h63 return path->l[level].lock_seq == six_lock_seq(&b->c.lock); in btree_node_lock_seq_matches()
A Dbtree_iter.c633 path->l[b->c.level].lock_seq = six_lock_seq(&b->c.lock); in bch2_btree_path_level_init()
1371 if (path->l[l].lock_seq != path->l[l].b->c.lock.seq) in bch2_btree_path_can_relock()
1540 path->l[l].lock_seq); in bch2_btree_path_to_text()
A Dbtree_update_interior.c770 path->l[b->c.level].lock_seq = six_lock_seq(&b->c.lock); in btree_update_nodes_written()

Completed in 24 milliseconds