Searched refs:six_lock_seq (Results 1 – 9 of 9) sorted by relevance
173 EBUG_ON(path->l[b->c.level].lock_seq != six_lock_seq(&b->c.lock)); 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()
191 static inline u32 six_lock_seq(const struct six_lock *lock) in six_lock_seq() function
321 if (six_lock_seq(lock) != seq || !six_trylock_ip(lock, type, ip)) in six_relock_ip()324 if (six_lock_seq(lock) != seq) { in six_relock_ip()
596 ? six_lock_seq(&path->l[level].b->c.lock)660 ? six_lock_seq(&path->l[level].b->c.lock)1507 __entry->lock_seq = six_lock_seq(&b->lock);
973 u32 seq = six_lock_seq(&b->c.lock); in bch2_btree_node_fill()1095 u32 seq = six_lock_seq(&b->c.lock); in __bch2_btree_node_get()
46 path->l[0].lock_seq = six_lock_seq(&ck->c.lock); in btree_path_cached_set()
63 return path->l[level].lock_seq == six_lock_seq(&b->c.lock); in btree_node_lock_seq_matches()
770 path->l[b->c.level].lock_seq = six_lock_seq(&b->c.lock); in btree_update_nodes_written()
633 path->l[b->c.level].lock_seq = six_lock_seq(&b->c.lock); in bch2_btree_path_level_init()
Completed in 25 milliseconds