42 					 unsigned level)  in btree_node_locked_type()  argument
44 	return BTREE_NODE_UNLOCKED + ((path->nodes_locked >> (level << 1)) & 3);  in btree_node_locked_type()
62 static inline bool btree_node_locked(struct btree_path *path, unsigned level)  in btree_node_locked()  argument
64 	return btree_node_locked_type(path, level) != BTREE_NODE_UNLOCKED;  in btree_node_locked()
68 						  unsigned level,  in mark_btree_node_locked_noreset()  argument
75 	path->nodes_locked &= ~(3U << (level << 1));  in mark_btree_node_locked_noreset()
76 	path->nodes_locked |= (type + 1) << (level << 1);  in mark_btree_node_locked_noreset()
81 					  unsigned level,  in mark_btree_node_locked()  argument
84 	mark_btree_node_locked_noreset(path, level, (enum btree_node_locked_type) type);  in mark_btree_node_locked()
86 	path->l[level].lock_taken_time = local_clock();  in mark_btree_node_locked()
90 static inline enum six_lock_type __btree_lock_want(struct btree_path *path, int level)  in __btree_lock_want()  argument
92 	return level < path->locks_want  in __btree_lock_want()
98 btree_lock_want(struct btree_path *path, int level)  in btree_lock_want()  argument
100 	if (level < path->level)  in btree_lock_want()
102 	if (level < path->locks_want)  in btree_lock_want()
104 	if (level == path->level)  in btree_lock_want()
110 					      struct btree_path *path, unsigned level)  in btree_trans_lock_hold_time_update()  argument
114 				 path->l[level].lock_taken_time,  in btree_trans_lock_hold_time_update()
125 				     struct btree_path *path, unsigned level)  in btree_node_unlock()  argument
127 	int lock_type = btree_node_locked_type(path, level);  in btree_node_unlock()
129 	EBUG_ON(level >= BTREE_MAX_DEPTH);  in btree_node_unlock()
133 			bch2_btree_node_unlock_write(trans, path, path->l[level].b);  in btree_node_unlock()
136 		six_unlock_type(&path->l[level].b->c.lock, lock_type);  in btree_node_unlock()
137 		btree_trans_lock_hold_time_update(trans, path, level);  in btree_node_unlock()
138 		mark_btree_node_locked_noreset(path, level, BTREE_NODE_UNLOCKED);  in btree_node_unlock()
173 			linked->l[b->c.level].lock_seq++;  in __bch2_btree_node_unlock_write()
183 	EBUG_ON(path->l[b->c.level].b != b);  in bch2_btree_node_unlock_write_inlined()
184 	EBUG_ON(path->l[b->c.level].lock_seq != six_lock_seq(&b->c.lock));  in bch2_btree_node_unlock_write_inlined()
185 	EBUG_ON(btree_node_locked_type(path, b->c.level) != SIX_LOCK_write);  in bch2_btree_node_unlock_write_inlined()
187 	mark_btree_node_locked_noreset(path, b->c.level, BTREE_NODE_INTENT_LOCKED);  in bch2_btree_node_unlock_write_inlined()
263 					     unsigned level,  in btree_node_lock_increment()  argument
270 		if (&path->l[level].b->c == b &&  in btree_node_lock_increment()
271 		    btree_node_locked_type(path, level) >= want) {  in btree_node_lock_increment()
282 			unsigned level,  in btree_node_lock()  argument
288 	EBUG_ON(level >= BTREE_MAX_DEPTH);  in btree_node_lock()
292 	    btree_node_lock_increment(trans, b, level, (enum btree_node_locked_type) type) ||  in btree_node_lock()
295 		path->l[b->level].lock_taken_time = local_clock();  in btree_node_lock()
310 	EBUG_ON(&path->l[b->level].b->c != b);  in __btree_node_lock_write()
311 	EBUG_ON(path->l[b->level].lock_seq != six_lock_seq(&b->lock));  in __btree_node_lock_write()
312 	EBUG_ON(!btree_node_intent_locked(path, b->level));  in __btree_node_lock_write()
319 	mark_btree_node_locked_noreset(path, b->level, BTREE_NODE_WRITE_LOCKED);  in __btree_node_lock_write()
347 	return btree_node_locked(path, path->level)  in bch2_btree_path_relock()
355 					  struct btree_path *path, unsigned level)  in bch2_btree_node_relock()  argument
357 	EBUG_ON(btree_node_locked(path, level) &&  in bch2_btree_node_relock()
358 		!btree_node_write_locked(path, level) &&  in bch2_btree_node_relock()
359 		btree_node_locked_type(path, level) != __btree_lock_want(path, level));  in bch2_btree_node_relock()
361 	return likely(btree_node_locked(path, level)) ||  in bch2_btree_node_relock()
362 		(!IS_ERR_OR_NULL(path->l[level].b) &&  in bch2_btree_node_relock()
363 		 __bch2_btree_node_relock(trans, path, level, true));  in bch2_btree_node_relock()
367 						  struct btree_path *path, unsigned level)  in bch2_btree_node_relock_notrace()  argument
369 	EBUG_ON(btree_node_locked(path, level) &&  in bch2_btree_node_relock_notrace()
370 		!btree_node_write_locked(path, level) &&  in bch2_btree_node_relock_notrace()
371 		btree_node_locked_type(path, level) != __btree_lock_want(path, level));  in bch2_btree_node_relock_notrace()
373 	return likely(btree_node_locked(path, level)) ||  in bch2_btree_node_relock_notrace()
374 		(!IS_ERR_OR_NULL(path->l[level].b) &&  in bch2_btree_node_relock_notrace()
375 		 __bch2_btree_node_relock(trans, path, level, false));  in bch2_btree_node_relock_notrace()
411 	EBUG_ON(!btree_node_locked(path, path->level));  in btree_path_set_should_be_locked()
429 	__btree_path_set_level_up(trans, path, path->level++);  in btree_path_set_level_up()