fs/bcachefs/btree_iter.h

138 #define trans_for_each_path_idx_inorder(_trans, _iter)			\
139 	for (_iter = (struct trans_for_each_path_inorder_iter) { 0 };	\
140 	     (_iter.path_idx = trans->sorted[_iter.sorted_idx],		\
141 	      _iter.sorted_idx < (_trans)->nr_sorted);			\
142 	     _iter.sorted_idx++)
149 #define trans_for_each_path_inorder(_trans, _path, _iter)		\
150 	for (_iter = (struct trans_for_each_path_inorder_iter) { 0 };	\
151 	     (_iter.path_idx = trans->sorted[_iter.sorted_idx],		\
152 	      _path = (_trans)->paths + _iter.path_idx,			\
153 	      _iter.sorted_idx < (_trans)->nr_sorted);			\
154 	     _iter.sorted_idx++)
181 #define trans_for_each_path_with_node(_trans, _b, _path, _iter)		\
182 	for (_iter = 1;							\
183 	     (_path = __trans_next_path_with_node((_trans), (_b), &_iter));\
184 	     _iter++)
566 #define bch2_bkey_get_iter_typed(_trans, _iter, _btree_id, _pos, _flags, _type)\
567 	bkey_s_c_to_##_type(__bch2_bkey_get_iter(_trans, _iter,			\
606 #define __for_each_btree_node(_trans, _iter, _btree_id, _start,		\
608 	for (bch2_trans_node_iter_init((_trans), &(_iter), (_btree_id),	\
610 	     (_b) = bch2_btree_iter_peek_node_and_restart(&(_iter)),	\
612 	     (_b) = bch2_btree_iter_next_node(&(_iter)))
614 #define for_each_btree_node(_trans, _iter, _btree_id, _start,		\
616 	__for_each_btree_node(_trans, _iter, _btree_id, _start,		\
702 #define for_each_btree_key_upto(_trans, _iter, _btree_id,		\
705 	struct btree_iter _iter;					\
709 	bch2_trans_iter_init((_trans), &(_iter), (_btree_id),		\
714 			(_k) = bch2_btree_iter_peek_upto_type(&(_iter),	\
721 	} while (!_ret3 && bch2_btree_iter_advance(&(_iter)));		\
723 	bch2_trans_iter_exit((_trans), &(_iter));			\
727 #define for_each_btree_key(_trans, _iter, _btree_id,			\
729 	for_each_btree_key_upto(_trans, _iter, _btree_id, _start,	\
732 #define for_each_btree_key_reverse(_trans, _iter, _btree_id,		\
735 	struct btree_iter _iter;					\
739 	bch2_trans_iter_init((_trans), &(_iter), (_btree_id),		\
744 			(_k) = bch2_btree_iter_peek_prev_type(&(_iter),	\
751 	} while (!_ret3 && bch2_btree_iter_rewind(&(_iter)));		\
753 	bch2_trans_iter_exit((_trans), &(_iter));			\
757 #define for_each_btree_key_commit(_trans, _iter, _btree_id,		\
761 	for_each_btree_key(_trans, _iter, _btree_id, _start, _iter_flags, _k,\
765 #define for_each_btree_key_reverse_commit(_trans, _iter, _btree_id,	\
769 	for_each_btree_key_reverse(_trans, _iter, _btree_id, _start, _iter_flags, _k,\
773 #define for_each_btree_key_upto_commit(_trans, _iter, _btree_id,	\
777 	for_each_btree_key_upto(_trans, _iter, _btree_id, _start, _end, _iter_flags, _k,\
797 #define for_each_btree_key_old(_trans, _iter, _btree_id,		\
799 	for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id),	\
801 	     (_k) = __bch2_btree_iter_peek_and_restart((_trans), &(_iter), _flags),\
803 	     bch2_btree_iter_advance(&(_iter)))
805 #define for_each_btree_key_upto_norestart(_trans, _iter, _btree_id,	\
807 	for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id),	\
809 	     (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, _flags),\
811 	     bch2_btree_iter_advance(&(_iter)))
813 #define for_each_btree_key_upto_continue_norestart(_iter, _end, _flags, _k, _ret)\
815 	     (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, _flags),	\
817 	     bch2_btree_iter_advance(&(_iter)))
819 #define for_each_btree_key_norestart(_trans, _iter, _btree_id,		\
821 	for_each_btree_key_upto_norestart(_trans, _iter, _btree_id, _start,\
824 #define for_each_btree_key_continue_norestart(_iter, _flags, _k, _ret)	\
825 	for_each_btree_key_upto_continue_norestart(_iter, SPOS_MAX, _flags, _k, _ret)