Lines Matching defs:pairs
1304 /* Detect all pairs of inequalities that form an equality.
3882 /* Does "test" hold for all pairs of basic maps in "map1" and "map2"?
3977 * In particular, check whether all pairs of basic maps are disjoint.
3991 * If none of these cases apply, then check if all pairs of basic maps
4150 static int div_find_coalesce(__isl_keep isl_basic_map *bmap, int *pairs,
4195 if (!pairs[i])
4381 * In particular, if all pairs of lower and upper bounds on a div
4392 __isl_take isl_basic_map *bmap, __isl_take int *pairs, int n)
4420 if (!pairs[i])
4422 if (best >= 0 && pairs[best] <= pairs[i])
4458 pairs[i] = 0;
4464 free(pairs);
4472 free(pairs);
4581 * We loop over all pairs of lower and upper bounds on a div
4587 __isl_take isl_basic_map *bmap, int *pairs, int n)
4599 if (!pairs[i])
4609 c = div_find_coalesce(bmap, pairs, i, l, u);
4614 free(pairs);
4622 free(pairs);
4626 return drop_more_redundant_divs(bmap, pairs, n);
4628 free(pairs);
4674 * Free the temporary data structure "pairs" that was associated
4678 __isl_take isl_basic_map *bmap, __isl_take int *pairs, int simplify)
4682 free(pairs);
4738 * freeing the temporary data structure "pairs" that was associated
4742 __isl_take isl_basic_map *bmap, int ineq, __isl_take int *pairs)
4746 return drop_redundant_divs_again(bmap, pairs, 1);
4752 * freeing the temporary data structure "pairs" that was associated
4757 __isl_take int *pairs)
4767 return drop_redundant_divs_again(bmap, pairs, 0);
4900 * freeing the temporary data structure "pairs" that was associated
4916 int div, int ineq, int lower, int *pairs)
4926 free(pairs);
5010 int *pairs = NULL;
5022 pairs = isl_calloc_array(bmap->ctx, int, bmap->n_div);
5023 if (!pairs)
5059 pairs[i] = pos * neg;
5060 if (pairs[i] == 0) {
5065 return drop_redundant_divs_again(bmap, pairs, 0);
5067 if (pairs[i] != 1)
5089 pairs);
5095 pairs);
5111 last_pos, last_neg, pairs);
5120 return drop_redundant_divs_again(bmap, pairs, 1);
5122 pairs[i] = 0;
5127 return coalesce_or_drop_more_redundant_divs(bmap, pairs, n);
5129 free(pairs);
5132 free(pairs);
5394 * which checks for such pairs of inequalities as well as eliminate_divs_eq
Indexes created Sun Mar 01 05:31:48 UTC 2026