Home
last modified time | relevance | path

Searched refs:SIX_LOCK_read (Results 1 – 11 of 11) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dsix.c52 [SIX_LOCK_read] = {
68 .unlock_wakeup = SIX_LOCK_read,
188 ret = -1 - SIX_LOCK_read; in __do_six_trylock()
227 if (saw_one && lock_type != SIX_LOCK_read) in __six_lock_wakeup()
575 if (type == SIX_LOCK_read && in do_six_unlock_type()
584 if (type != SIX_LOCK_read) in do_six_unlock_type()
647 six_lock_increment(lock, SIX_LOCK_read); in six_lock_downgrade()
673 new -= l[SIX_LOCK_read].lock_val; in six_lock_tryupgrade()
708 if (to == SIX_LOCK_read) { in six_trylock_convert()
735 case SIX_LOCK_read: in six_lock_increment()
[all …]
H A Dbtree_locking.h36 BTREE_NODE_READ_LOCKED = SIX_LOCK_read,
72 BUILD_BUG_ON(SIX_LOCK_read != 0); in mark_btree_node_locked_noreset()
94 : SIX_LOCK_read; in __btree_lock_want()
H A Dsix.h131 SIX_LOCK_read, enumerator
H A Dbtree_cache.c995 if (lock_type == SIX_LOCK_read) in bch2_btree_node_fill()
1262 level, SIX_LOCK_read, true); in bch2_btree_node_get_noiter()
1276 ret = btree_node_lock_nopath(trans, &b->c, SIX_LOCK_read, _THIS_IP_); in bch2_btree_node_get_noiter()
1337 level, SIX_LOCK_read, false); in bch2_btree_node_prefetch()
H A Dbtree_key_cache.c278 if (lock_want == SIX_LOCK_read) in btree_key_cache_create()
537 btree_node_lock_nopath_nofail(trans, &ck->c, SIX_LOCK_read); in bch2_btree_key_cache_journal_flush()
H A Dbtree_io.c2078 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_read); in btree_node_write_done()
2549 (lock_type_held == SIX_LOCK_read && in bch2_btree_node_write()
2560 if (lock_type_held == SIX_LOCK_read) in bch2_btree_node_write()
2577 (lock_type_held == SIX_LOCK_read && in bch2_btree_node_write_trans()
2588 if (lock_type_held == SIX_LOCK_read) in bch2_btree_node_write_trans()
H A Dtrace.h631 __entry->self_read_count = c.n[SIX_LOCK_read];
638 __entry->read_count = c.n[SIX_LOCK_read];
701 __entry->self_read_count = c.n[SIX_LOCK_read];
704 __entry->read_count = c.n[SIX_LOCK_read];
H A Dbtree_trans_commit.c237 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_read); in __btree_node_flush()
253 btree_node_write_if_need(trans, b, SIX_LOCK_read); in __btree_node_flush()
H A Dbtree_locking.c423 int readers = bch2_btree_node_lock_counts(trans, NULL, b, b->level).n[SIX_LOCK_read]; in __bch2_btree_node_lock_write()
H A Dbtree_gc.c576 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_read); in bch2_check_topology()
H A Dbtree_update_interior.c814 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_read); in btree_update_nodes_written()
815 btree_node_write_if_need(trans, b, SIX_LOCK_read); in btree_update_nodes_written()