Searched refs:SIX_LOCK_read (Results 1 – 11 of 11) sorted by relevance
| /linux/fs/bcachefs/ |
| A D | six.c | 52 [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() 640 six_lock_increment(lock, SIX_LOCK_read); in six_lock_downgrade() 666 new -= l[SIX_LOCK_read].lock_val; in six_lock_tryupgrade() 701 if (to == SIX_LOCK_read) { in six_trylock_convert() 728 case SIX_LOCK_read: in six_lock_increment() [all …]
|
| A D | btree_locking.h | 35 BTREE_NODE_READ_LOCKED = SIX_LOCK_read, 71 BUILD_BUG_ON(SIX_LOCK_read != 0); in mark_btree_node_locked_noreset() 100 : SIX_LOCK_read; in __btree_lock_want()
|
| A D | btree_locking.c | 408 int readers = bch2_btree_node_lock_counts(trans, NULL, b, b->level).n[SIX_LOCK_read]; in __bch2_btree_node_lock_write() 542 six_lock_readers_add(&b->c.lock, -count.n[SIX_LOCK_read]); in bch2_btree_node_upgrade() 544 six_lock_readers_add(&b->c.lock, count.n[SIX_LOCK_read]); in bch2_btree_node_upgrade()
|
| A D | six.h | 131 SIX_LOCK_read, enumerator
|
| A D | btree_cache.c | 992 if (lock_type == SIX_LOCK_read) in bch2_btree_node_fill() 1261 level, SIX_LOCK_read, true); in bch2_btree_node_get_noiter() 1275 ret = btree_node_lock_nopath(trans, &b->c, SIX_LOCK_read, _THIS_IP_); in bch2_btree_node_get_noiter() 1336 level, SIX_LOCK_read, false); in bch2_btree_node_prefetch()
|
| A D | btree_key_cache.c | 269 if (lock_want == SIX_LOCK_read) in btree_key_cache_create() 495 btree_node_lock_nopath_nofail(trans, &ck->c, SIX_LOCK_read); in bch2_btree_key_cache_journal_flush()
|
| A D | trace.h | 583 __entry->self_read_count = c.n[SIX_LOCK_read]; 590 __entry->read_count = c.n[SIX_LOCK_read]; 653 __entry->self_read_count = c.n[SIX_LOCK_read]; 656 __entry->read_count = c.n[SIX_LOCK_read];
|
| A D | btree_trans_commit.c | 236 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_read); in __btree_node_flush() 252 btree_node_write_if_need(c, b, SIX_LOCK_read); in __btree_node_flush()
|
| A D | btree_io.c | 1836 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_read); in btree_node_write_done() 2282 (lock_type_held == SIX_LOCK_read && in bch2_btree_node_write() 2293 if (lock_type_held == SIX_LOCK_read) in bch2_btree_node_write()
|
| A D | btree_update_interior.c | 701 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_read); in btree_update_nodes_written() 832 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_read); in btree_update_nodes_written() 833 btree_node_write_if_need(c, b, SIX_LOCK_read); in btree_update_nodes_written()
|
| A D | btree_gc.c | 549 btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_read); in bch2_check_topology()
|
Completed in 30 milliseconds