Home
last modified time | relevance | path

Searched refs:locks_want (Results 1 – 7 of 7) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbtree_locking.c477 } while (l < path->locks_want); in btree_path_get_locks()
582 l < path->locks_want && btree_path_node(path, l); in bch2_btree_path_relock_intent()
621 EBUG_ON(path->locks_want >= new_locks_want); in bch2_btree_path_upgrade_noupgrade_sibs()
623 path->locks_want = new_locks_want; in bch2_btree_path_upgrade_noupgrade_sibs()
666 linked->locks_want < new_locks_want) { in __bch2_btree_path_upgrade()
667 linked->locks_want = new_locks_want; in __bch2_btree_path_upgrade()
680 unsigned l, old_locks_want = path->locks_want; in __bch2_btree_path_downgrade()
685 EBUG_ON(path->locks_want < new_locks_want); in __bch2_btree_path_downgrade()
687 path->locks_want = new_locks_want; in __bch2_btree_path_downgrade()
690 (l = btree_path_highest_level_locked(path)) >= path->locks_want) { in __bch2_btree_path_downgrade()
H A Dbtree_locking.h92 return level < path->locks_want in __btree_lock_want()
102 if (level < path->locks_want) in btree_lock_want()
393 unsigned old_locks_want = path->locks_want; in bch2_btree_path_upgrade()
397 if (path->locks_want < new_locks_want in bch2_btree_path_upgrade()
H A Dtrace.h1354 __entry->new_locks_want = path->locks_want;
1610 __field(u8, locks_want )
1617 __entry->locks_want = path->locks_want;
1625 __entry->locks_want,
1639 __field(u8, locks_want )
1649 __entry->locks_want = path->locks_want;
1660 __entry->locks_want,
1726 __field(u8, locks_want )
1744 __entry->locks_want = path->locks_want;
1779 __entry->locks_want,
[all …]
H A Dbtree_iter.c1108 i < path->locks_want && btree_path_node(path, i); in __btree_path_up_until_good_node()
1381 } while (l < path->locks_want); in bch2_btree_path_can_relock()
1724 unsigned locks_want, unsigned level, in bch2_path_get() argument
1769 path->locks_want = locks_want; in bch2_path_get()
1785 locks_want = max(locks_want, level + 1); in bch2_path_get()
1795 locks_want = min(locks_want, BTREE_MAX_DEPTH); in bch2_path_get()
1796 if (locks_want > path->locks_want) in bch2_path_get()
1797 bch2_btree_path_upgrade_noupgrade_sibs(trans, path, locks_want, NULL); in bch2_path_get()
3061 unsigned locks_want, in bch2_trans_node_iter_init() argument
3072 bch2_trans_iter_init_common(trans, iter, btree_id, pos, locks_want, depth, in bch2_trans_node_iter_init()
[all …]
H A Dbtree_iter.h386 if (path->locks_want > new_locks_want) in bch2_btree_path_downgrade()
501 unsigned locks_want, in bch2_trans_iter_init_common() argument
519 locks_want, depth, flags, ip); in bch2_trans_iter_init_common()
H A Dbtree_types.h332 locks_want:3; member
H A Dbtree_update_interior.c1659 trans->paths[path2].locks_want++; in btree_split()
1915 path->locks_want++; in __btree_increase_depth()