54 /* Iterate over paths within a transaction: */
66 static inline unsigned long *trans_paths_nr(struct btree_path *paths)  in trans_paths_nr()  argument
68 	return &container_of(paths, struct btree_trans_paths, paths[0])->nr_paths;  in trans_paths_nr()
71 static inline unsigned long *trans_paths_allocated(struct btree_path *paths)  in trans_paths_allocated()  argument
73 	unsigned long *v = trans_paths_nr(paths);  in trans_paths_allocated()
95 			return trans->paths + *idx;  in __trans_next_path()
125 		? trans->paths + trans->sorted[idx]  in next_btree_path()
134 		? trans->paths + trans->sorted[idx - 1]  in prev_btree_path()
152 	      _path = (_trans)->paths + _iter.path_idx,			\
158 	     ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) >= 0;\
194 	if (trans->paths[path].ref > 1 ||  in bch2_btree_path_make_mut()
195 	    trans->paths[path].preserve)  in bch2_btree_path_make_mut()
197 	trans->paths[path].should_be_locked = false;  in bch2_btree_path_make_mut()
210 	return !bpos_eq(new_pos, trans->paths[path].pos)  in bch2_btree_path_set_pos()
222 	if (trans->paths[path].uptodate < BTREE_ITER_NEED_RELOCK)  in bch2_btree_path_traverse()