Lines Matching refs:i
168 int i; in vec_cmp() local
177 for (i = 0; i < an && i < bn; i++) { in vec_cmp()
178 int res = profile_cmp(a[i], b[i]); in vec_cmp()
189 int i; in vec_is_stale() local
193 for (i = 0; i < n; i++) { in vec_is_stale()
194 if (profile_is_stale(vec[i])) in vec_is_stale()
204 int i; in accum_label_info() local
212 for (i = 0; i < new->size; i++) { in accum_label_info()
213 u |= new->vec[i]->label.flags & (FLAG_DEBUG1 | FLAG_DEBUG2 | in accum_label_info()
215 if (!(u & new->vec[i]->label.flags & FLAG_UNCONFINED)) in accum_label_info()
217 new->mediates |= new->vec[i]->label.mediates; in accum_label_info()
234 int i, pos, dups = 0; in unique() local
240 for (i = 1; i < n; i++) { in unique()
241 int res = profile_cmp(vec[pos], vec[i]); in unique()
246 aa_put_profile(vec[i]); in unique()
252 vec[pos] = vec[i]; in unique()
273 int i, dups = 0; in aa_vec_unique() local
286 for (i = 1; i < n; i++) { in aa_vec_unique()
287 struct aa_profile *tmp = vec[i]; in aa_vec_unique()
290 for (pos = i - 1 - dups; pos >= 0; pos--) { in aa_vec_unique()
304 for (j = i - dups; j > pos; j--) in aa_vec_unique()
327 struct label_it i; in aa_label_destroy() local
331 label_for_each(i, label, profile) { in aa_label_destroy()
333 label->vec[i.i] = (struct aa_profile *) in aa_label_destroy()
334 (LABEL_POISON + (long) i.i); in aa_label_destroy()
483 int aa_label_next_confined(struct aa_label *label, int i) in aa_label_next_confined() argument
486 AA_BUG(i < 0); in aa_label_next_confined()
488 for (; i < label->size; i++) { in aa_label_next_confined()
489 if (!profile_unconfined(label->vec[i])) in aa_label_next_confined()
490 return i; in aa_label_next_confined()
493 return i; in aa_label_next_confined()
511 AA_BUG(I->i < 0); in __aa_label_next_not_in_set()
512 AA_BUG(I->i > set->size); in __aa_label_next_not_in_set()
517 while (I->j < sub->size && I->i < set->size) { in __aa_label_next_not_in_set()
518 int res = profile_cmp(sub->vec[I->j], set->vec[I->i]); in __aa_label_next_not_in_set()
522 (I->i)++; in __aa_label_next_not_in_set()
524 (I->i)++; in __aa_label_next_not_in_set()
545 struct label_it i = { }; in aa_label_is_subset() local
553 return __aa_label_next_not_in_set(&i, set, sub) == NULL; in aa_label_is_subset()
572 struct label_it i = { }; in aa_label_is_unconfined_subset() local
582 p = __aa_label_next_not_in_set(&i, set, sub); in aa_label_is_unconfined_subset()
870 int i; in vec_create_and_insert_label() local
886 for (i = 0; i < len; i++) in vec_create_and_insert_label()
887 new->vec[i] = aa_get_profile(vec[i]); in vec_create_and_insert_label()
960 AA_BUG(I->i < 0); in aa_label_next_in_merge()
961 AA_BUG(I->i > a->size); in aa_label_next_in_merge()
965 if (I->i < a->size) { in aa_label_next_in_merge()
967 int res = profile_cmp(a->vec[I->i], b->vec[I->j]); in aa_label_next_in_merge()
975 return a->vec[(I->i)++]; in aa_label_next_in_merge()
1000 struct label_it i = { }; in label_merge_cmp() local
1008 k < z->size && (p = aa_label_next_in_merge(&i, a, b)); in label_merge_cmp()
1047 struct label_it i; in label_merge_insert() local
1059 label_for_each_in_merge(i, a, b, next) { in label_merge_insert()
1294 struct label_it i; in label_compound_match() local
1297 label_for_each(i, label, tp) { in label_compound_match()
1311 label_for_each_cont(i, label, tp) { in label_compound_match()
1354 struct label_it i; in label_components_match() local
1359 label_for_each(i, label, tp) { in label_components_match()
1375 label_for_each_cont(i, label, tp) { in label_components_match()
1547 struct label_it i; in label_modename() local
1550 label_for_each(i, label, profile) { in label_modename()
1581 struct label_it i; in display_mode() local
1583 label_for_each(i, label, profile) { in display_mode()
1618 struct label_it i; in aa_label_snxprint() local
1633 label_for_each(i, label, profile) { in aa_label_snxprint()
1865 int i, len, stack = 0, error; in aa_label_strn_parse() local
1890 for (i = 0; i < stack; i++) in aa_label_strn_parse()
1891 vec[i] = aa_get_profile(base->vec[i]); in aa_label_strn_parse()
1893 for (split = aa_label_strn_split(str, end - str), i = stack; in aa_label_strn_parse()
1894 split && i < len; i++) { in aa_label_strn_parse()
1895 vec[i] = fqlookupn_profile(base, currbase, str, split - str); in aa_label_strn_parse()
1896 if (!vec[i]) in aa_label_strn_parse()
1902 if (vec[i]->ns != labels_ns(currbase)) in aa_label_strn_parse()
1903 currbase = &vec[i]->label; in aa_label_strn_parse()
1908 if (i < len) { in aa_label_strn_parse()
1909 vec[i] = fqlookupn_profile(base, currbase, str, end - str); in aa_label_strn_parse()
1910 if (!vec[i]) in aa_label_strn_parse()
2029 int i, invcount = 0; in __label_update() local
2044 for (i = 0; i < label->size; i++) { in __label_update()
2045 AA_BUG(!label->vec[i]); in __label_update()
2046 new->vec[i] = aa_get_newest_profile(label->vec[i]); in __label_update()
2047 AA_BUG(!new->vec[i]); in __label_update()
2048 AA_BUG(!new->vec[i]->label.proxy); in __label_update()
2049 AA_BUG(!new->vec[i]->label.proxy->label); in __label_update()
2050 if (new->vec[i]->label.proxy != label->vec[i]->label.proxy) in __label_update()