Lines Matching refs:I
157 #define label_for_each(I, L, P) \ argument
158 for ((I).i = 0; ((P) = (L)->vec[(I).i]); ++((I).i))
161 #define label_for_each_cont(I, L, P) \ argument
162 for (++((I).i); ((P) = (L)->vec[(I).i]); ++((I).i))
164 #define next_comb(I, L1, L2) \ argument
166 (I).j++; \
167 if ((I).j >= (L2)->size) { \
168 (I).i++; \
169 (I).j = 0; \
175 #define label_for_each_comb(I, L1, L2, P1, P2) \ argument
176 for ((I).i = (I).j = 0; \
177 ((P1) = (L1)->vec[(I).i]) && ((P2) = (L2)->vec[(I).j]); \
178 (I) = next_comb(I, L1, L2))
191 #define label_for_each_confined(I, L, P) \ argument
192 for ((I).i = aa_label_next_confined((L), 0); \
193 ((P) = (L)->vec[(I).i]); \
194 (I).i = aa_label_next_confined((L), (I).i + 1))
196 #define label_for_each_in_merge(I, A, B, P) \ argument
197 for ((I).i = (I).j = 0; \
198 ((P) = aa_label_next_in_merge(&(I), (A), (B))); \
201 #define label_for_each_not_in_set(I, SET, SUB, P) \ argument
202 for ((I).i = (I).j = 0; \
203 ((P) = __aa_label_next_not_in_set(&(I), (SET), (SUB))); \
214 #define label_for_each_in_ns(I, NS, L, P) \ argument
215 for ((I).i = next_in_ns(0, (NS), (L)); \
216 ((P) = (L)->vec[(I).i]); \
217 (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,