Lines Matching refs:I
161 #define label_for_each(I, L, P) \ argument
162 for ((I).i = 0; ((P) = (L)->vec[(I).i]); ++((I).i))
165 #define label_for_each_cont(I, L, P) \ argument
166 for (++((I).i); ((P) = (L)->vec[(I).i]); ++((I).i))
168 #define next_comb(I, L1, L2) \ argument
170 (I).j++; \
171 if ((I).j >= (L2)->size) { \
172 (I).i++; \
173 (I).j = 0; \
179 #define label_for_each_comb(I, L1, L2, P1, P2) \ argument
180 for ((I).i = (I).j = 0; \
181 ((P1) = (L1)->vec[(I).i]) && ((P2) = (L2)->vec[(I).j]); \
182 (I) = next_comb(I, L1, L2))
195 #define label_for_each_confined(I, L, P) \ argument
196 for ((I).i = aa_label_next_confined((L), 0); \
197 ((P) = (L)->vec[(I).i]); \
198 (I).i = aa_label_next_confined((L), (I).i + 1))
200 #define label_for_each_in_merge(I, A, B, P) \ argument
201 for ((I).i = (I).j = 0; \
202 ((P) = aa_label_next_in_merge(&(I), (A), (B))); \
205 #define label_for_each_not_in_set(I, SET, SUB, P) \ argument
206 for ((I).i = (I).j = 0; \
207 ((P) = __aa_label_next_not_in_set(&(I), (SET), (SUB))); \
218 #define label_for_each_in_ns(I, NS, L, P) \ argument
219 for ((I).i = next_in_ns(0, (NS), (L)); \
220 ((P) = (L)->vec[(I).i]); \
221 (I).i = next_in_ns((I).i + 1, (NS), (L)))
288 struct aa_profile *__aa_label_next_not_in_set(struct label_it *I,
299 struct aa_profile *aa_label_next_in_merge(struct label_it *I,