fs/bcachefs/btree_locking.h

26 static inline bool is_btree_node(struct btree_path *path, unsigned l)
28 	return l < BTREE_MAX_DEPTH && !IS_ERR_OR_NULL(path->l[l].b);
46 static inline int btree_node_locked_type(struct btree_path *path,
49 	return BTREE_NODE_UNLOCKED + ((path->nodes_locked >> (level << 1)) & 3);
52 static inline bool btree_node_write_locked(struct btree_path *path, unsigned l)
54 	return btree_node_locked_type(path, l) == BTREE_NODE_WRITE_LOCKED;
57 static inline bool btree_node_intent_locked(struct btree_path *path, unsigned l)
59 	return btree_node_locked_type(path, l) == BTREE_NODE_INTENT_LOCKED;
62 static inline bool btree_node_read_locked(struct btree_path *path, unsigned l)
64 	return btree_node_locked_type(path, l) == BTREE_NODE_READ_LOCKED;
67 static inline bool btree_node_locked(struct btree_path *path, unsigned level)
69 	return btree_node_locked_type(path, level) != BTREE_NODE_UNLOCKED;
72 static inline void mark_btree_node_locked_noreset(struct btree_path *path,
80 	path->nodes_locked &= ~(3U << (level << 1));
81 	path->nodes_locked |= (type + 1) << (level << 1);
84 static inline void mark_btree_node_unlocked(struct btree_path *path,
87 	EBUG_ON(btree_node_write_locked(path, level));
88 	mark_btree_node_locked_noreset(path, level, BTREE_NODE_UNLOCKED);
92 					  struct btree_path *path,
96 	mark_btree_node_locked_noreset(path, level, (enum btree_node_locked_type) type);
98 	path->l[level].lock_taken_time = local_clock();
102 static inline enum six_lock_type __btree_lock_want(struct btree_path *path, int level)
104 	return level < path->locks_want
110 btree_lock_want(struct btree_path *path, int level)
112 	if (level < path->level)
114 	if (level < path->locks_want)
116 	if (level == path->level)
122 					      struct btree_path *path, unsigned level)
126 				 path->l[level].lock_taken_time,
134 				     struct btree_path *path, unsigned level)
136 	int lock_type = btree_node_locked_type(path, level);
141 		six_unlock_type(&path->l[level].b->c.lock, lock_type);
142 		btree_trans_lock_hold_time_update(trans, path, level);
144 	mark_btree_node_unlocked(path, level);
147 static inline int btree_path_lowest_level_locked(struct btree_path *path)
149 	return __ffs(path->nodes_locked) >> 1;
152 static inline int btree_path_highest_level_locked(struct btree_path *path)
154 	return __fls(path->nodes_locked) >> 1;
158 					    struct btree_path *path)
160 	btree_path_set_dirty(path, BTREE_ITER_NEED_RELOCK);
162 	while (path->nodes_locked)
163 		btree_node_unlock(trans, path, btree_path_lowest_level_locked(path));
171 bch2_btree_node_unlock_write_inlined(struct btree_trans *trans, struct btree_path *path,
177 	EBUG_ON(path->l[b->c.level].b != b);
178 	EBUG_ON(path->l[b->c.level].lock_seq != six_lock_seq(&b->c.lock));
179 	EBUG_ON(btree_node_locked_type(path, b->c.level) != SIX_LOCK_write);
181 	mark_btree_node_locked_noreset(path, b->c.level, BTREE_NODE_INTENT_LOCKED);
242 	struct btree_path *path;
245 	trans_for_each_path(trans, path, i)
246 		if (&path->l[level].b->c == b &&
247 		    btree_node_locked_type(path, level) >= want) {
256 			struct btree_path *path,
268 	    !(ret = btree_node_lock_nopath(trans, b, type, btree_path_ip_allocated(path)))) {
270 		path->l[b->level].lock_taken_time = local_clock();
281 					  struct btree_path *path,
285 	EBUG_ON(&path->l[b->level].b->c != b);
286 	EBUG_ON(path->l[b->level].lock_seq != six_lock_seq(&b->lock));
287 	EBUG_ON(!btree_node_intent_locked(path, b->level));
294 	mark_btree_node_locked_noreset(path, b->level, BTREE_NODE_WRITE_LOCKED);
298 		: __bch2_btree_node_lock_write(trans, path, b, lock_may_not_fail);
303 			   struct btree_path *path,
306 	return __btree_node_lock_write(trans, path, b, false);
320 				struct btree_path *path, unsigned long trace_ip)
322 	return btree_node_locked(path, path->level)
324 		: __bch2_btree_path_relock(trans, path, trace_ip);
330 					  struct btree_path *path, unsigned level)
332 	EBUG_ON(btree_node_locked(path, level) &&
333 		!btree_node_write_locked(path, level) &&
334 		btree_node_locked_type(path, level) != __btree_lock_want(path, level));
336 	return likely(btree_node_locked(path, level)) ||
337 		(!IS_ERR_OR_NULL(path->l[level].b) &&
338 		 __bch2_btree_node_relock(trans, path, level, true));
342 						  struct btree_path *path, unsigned level)
344 	EBUG_ON(btree_node_locked(path, level) &&
345 		!btree_node_write_locked(path, level) &&
346 		btree_node_locked_type(path, level) != __btree_lock_want(path, level));
348 	return likely(btree_node_locked(path, level)) ||
349 		(!IS_ERR_OR_NULL(path->l[level].b) &&
350 		 __bch2_btree_node_relock(trans, path, level, false));
364 					  struct btree_path *path,
368 	unsigned old_locks_want = path->locks_want;
372 	if (path->locks_want < new_locks_want
373 	    ? __bch2_btree_path_upgrade(trans, path, new_locks_want, &f)
374 	    : path->uptodate == BTREE_ITER_UPTODATE)
377 	trace_and_count(trans->c, trans_restart_upgrade, trans, _THIS_IP_, path,
384 static inline void btree_path_set_should_be_locked(struct btree_path *path)
386 	EBUG_ON(!btree_node_locked(path, path->level));
387 	EBUG_ON(path->uptodate);
389 	path->should_be_locked = true;
393 				      struct btree_path *path,
396 	btree_node_unlock(trans, path, l);
397 	path->l[l].b = ERR_PTR(-BCH_ERR_no_btree_node_up);
401 				    struct btree_path *path)
403 	__btree_path_set_level_up(trans, path, path->level++);
404 	btree_path_set_dirty(path, BTREE_ITER_NEED_TRAVERSE);
420 static inline void bch2_btree_path_verify_locks(struct btree_path *path) {}