Home
last modified time | relevance | path

Searched refs:I (Results 1 – 3 of 3) sorted by relevance

/security/apparmor/include/
Dlabel.h157 #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
[all …]
Dpath.h48 #define for_each_cpu_buffer(I) for ((I) = 0; (I) < MAX_PATH_BUFFERS; (I)++) argument
/security/apparmor/
Dlabel.c502 struct aa_profile *__aa_label_next_not_in_set(struct label_it *I, in __aa_label_next_not_in_set() argument
507 AA_BUG(!I); in __aa_label_next_not_in_set()
508 AA_BUG(I->i < 0); in __aa_label_next_not_in_set()
509 AA_BUG(I->i > set->size); in __aa_label_next_not_in_set()
511 AA_BUG(I->j < 0); in __aa_label_next_not_in_set()
512 AA_BUG(I->j > sub->size); in __aa_label_next_not_in_set()
514 while (I->j < sub->size && I->i < set->size) { in __aa_label_next_not_in_set()
515 int res = profile_cmp(sub->vec[I->j], set->vec[I->i]); in __aa_label_next_not_in_set()
518 (I->j)++; in __aa_label_next_not_in_set()
519 (I->i)++; in __aa_label_next_not_in_set()
[all …]