Lines Matching refs:j
288 int pos, j; in aa_vec_unique() local
304 for (j = i - dups; j > pos; j--) in aa_vec_unique()
305 vec[j] = vec[j - 1]; in aa_vec_unique()
514 AA_BUG(I->j < 0); in __aa_label_next_not_in_set()
515 AA_BUG(I->j > sub->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()
521 (I->j)++; in __aa_label_next_not_in_set()
526 return sub->vec[(I->j)++]; in __aa_label_next_not_in_set()
529 if (I->j < sub->size) in __aa_label_next_not_in_set()
530 return sub->vec[(I->j)++]; in __aa_label_next_not_in_set()
962 AA_BUG(I->j < 0); in aa_label_next_in_merge()
963 AA_BUG(I->j > b->size); in aa_label_next_in_merge()
966 if (I->j < b->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()
970 return b->vec[(I->j)++]; in aa_label_next_in_merge()
972 (I->j)++; in aa_label_next_in_merge()
978 if (I->j < b->size) in aa_label_next_in_merge()
979 return b->vec[(I->j)++]; in aa_label_next_in_merge()