156 #define label_for_each(I, L, P)						\  argument
157 	for ((I).i = 0; ((P) = (L)->vec[(I).i]); ++((I).i))
160 #define label_for_each_cont(I, L, P)					\  argument
161 	for (++((I).i); ((P) = (L)->vec[(I).i]); ++((I).i))
163 #define next_comb(I, L1, L2)						\  argument
165 	(I).j++;							\
166 	if ((I).j >= (L2)->size) {					\
167 		(I).i++;						\
168 		(I).j = 0;						\
174 #define label_for_each_comb(I, L1, L2, P1, P2)				\  argument
175 for ((I).i = (I).j = 0;							\
176 	((P1) = (L1)->vec[(I).i]) && ((P2) = (L2)->vec[(I).j]);		\
177 	(I) = next_comb(I, L1, L2))
190 #define label_for_each_confined(I, L, P)				\  argument
191 	for ((I).i = aa_label_next_confined((L), 0);			\
192 	     ((P) = (L)->vec[(I).i]);					\
193 	     (I).i = aa_label_next_confined((L), (I).i + 1))
195 #define label_for_each_in_merge(I, A, B, P)				\  argument
196 	for ((I).i = (I).j = 0;						\
197 	     ((P) = aa_label_next_in_merge(&(I), (A), (B)));		\
200 #define label_for_each_not_in_set(I, SET, SUB, P)			\  argument
201 	for ((I).i = (I).j = 0;						\
202 	     ((P) = __aa_label_next_not_in_set(&(I), (SET), (SUB)));	\
213 #define label_for_each_in_ns(I, NS, L, P)				\  argument
214 	for ((I).i = next_in_ns(0, (NS), (L));				\
215 	     ((P) = (L)->vec[(I).i]);					\
216 	     (I).i = next_in_ns((I).i + 1, (NS), (L)))
285 struct aa_profile *__aa_label_next_not_in_set(struct label_it *I,
296 struct aa_profile *aa_label_next_in_merge(struct label_it *I,