nvar = isl_set_dim(dom, isl_dim_set);
opt = isl_qpolynomial_drop_dims(opt, isl_dim_set, 0, nvar);
if (vpb->exact && bounded)
- ok = isl_qpolynomial_is_equal(opt, bound);
+ ok = isl_qpolynomial_plain_is_equal(opt, bound);
else if (sign > 0)
ok = isl_qpolynomial_le_cst(opt, bound);
else
__isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp);
void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp);
-int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
+int isl_qpolynomial_plain_is_equal(__isl_keep isl_qpolynomial *qp1,
__isl_keep isl_qpolynomial *qp2);
int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp);
int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp);
__isl_take isl_qpolynomial_fold *fold, __isl_take isl_dim *dim);
int isl_qpolynomial_fold_is_empty(__isl_keep isl_qpolynomial_fold *fold);
-int isl_qpolynomial_fold_is_equal(__isl_keep isl_qpolynomial_fold *fold1,
+int isl_qpolynomial_fold_plain_is_equal(__isl_keep isl_qpolynomial_fold *fold1,
__isl_keep isl_qpolynomial_fold *fold2);
__isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold(
return pwf;
}
-int isl_qpolynomial_fold_is_equal(__isl_keep isl_qpolynomial_fold *fold1,
+int isl_qpolynomial_fold_plain_is_equal(__isl_keep isl_qpolynomial_fold *fold1,
__isl_keep isl_qpolynomial_fold *fold2)
{
int i;
/* We probably want to sort the qps first... */
for (i = 0; i < fold1->n; ++i) {
- int eq = isl_qpolynomial_is_equal(fold1->qp[i], fold2->qp[i]);
+ int eq = isl_qpolynomial_plain_is_equal(fold1->qp[i], fold2->qp[i]);
if (eq < 0 || !eq)
return eq;
}
return NULL;
}
-int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
+int isl_qpolynomial_plain_is_equal(__isl_keep isl_qpolynomial *qp1,
__isl_keep isl_qpolynomial *qp2)
{
int equal;
for (i = pw->n - 1; i >= 0; --i) {
for (j = i - 1; j >= 0; --j) {
- if (!FN(EL,is_equal)(pw->p[i].FIELD, pw->p[j].FIELD))
+ if (!FN(EL,plain_is_equal)(pw->p[i].FIELD,
+ pw->p[j].FIELD))
continue;
pw->p[j].set = isl_set_union(pw->p[j].set,
pw->p[i].set);