2 * Copyright 2010 INRIA Saclay
4 * Use of this software is governed by the MIT license
6 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
7 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
12 #include <isl_map_private.h>
13 #include <isl_union_map_private.h>
14 #include <isl_polynomial_private.h>
15 #include <isl_point_private.h>
16 #include <isl_space_private.h>
19 #include <isl_mat_private.h>
20 #include <isl_config.h>
22 enum isl_fold isl_fold_type_negate(enum isl_fold type)
33 isl_die(NULL, isl_error_internal, "unhandled isl_fold type", abort());
36 static __isl_give isl_qpolynomial_fold *qpolynomial_fold_alloc(
37 enum isl_fold type, __isl_take isl_space *dim, int n)
39 isl_qpolynomial_fold *fold;
44 isl_assert(dim->ctx, n >= 0, goto error);
45 fold = isl_calloc(dim->ctx, struct isl_qpolynomial_fold,
46 sizeof(struct isl_qpolynomial_fold) +
47 (n - 1) * sizeof(struct isl_qpolynomial *));
63 isl_ctx *isl_qpolynomial_fold_get_ctx(__isl_keep isl_qpolynomial_fold *fold)
65 return fold ? fold->dim->ctx : NULL;
68 __isl_give isl_space *isl_qpolynomial_fold_get_domain_space(
69 __isl_keep isl_qpolynomial_fold *fold)
71 return fold ? isl_space_copy(fold->dim) : NULL;
74 __isl_give isl_space *isl_qpolynomial_fold_get_space(
75 __isl_keep isl_qpolynomial_fold *fold)
80 space = isl_space_copy(fold->dim);
81 space = isl_space_from_domain(space);
82 space = isl_space_add_dims(space, isl_dim_out, 1);
86 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_reset_domain_space(
87 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_space *dim)
91 fold = isl_qpolynomial_fold_cow(fold);
95 for (i = 0; i < fold->n; ++i) {
96 fold->qp[i] = isl_qpolynomial_reset_domain_space(fold->qp[i],
102 isl_space_free(fold->dim);
107 isl_qpolynomial_fold_free(fold);
112 /* Reset the space of "fold". This function is called from isl_pw_templ.c
113 * and doesn't know if the space of an element object is represented
114 * directly or through its domain. It therefore passes along both.
116 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_reset_space_and_domain(
117 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_space *space,
118 __isl_take isl_space *domain)
120 isl_space_free(space);
121 return isl_qpolynomial_fold_reset_domain_space(fold, domain);
124 int isl_qpolynomial_fold_involves_dims(__isl_keep isl_qpolynomial_fold *fold,
125 enum isl_dim_type type, unsigned first, unsigned n)
131 if (fold->n == 0 || n == 0)
134 for (i = 0; i < fold->n; ++i) {
135 int involves = isl_qpolynomial_involves_dims(fold->qp[i],
137 if (involves < 0 || involves)
143 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_set_dim_name(
144 __isl_take isl_qpolynomial_fold *fold,
145 enum isl_dim_type type, unsigned pos, const char *s)
149 fold = isl_qpolynomial_fold_cow(fold);
152 fold->dim = isl_space_set_dim_name(fold->dim, type, pos, s);
156 for (i = 0; i < fold->n; ++i) {
157 fold->qp[i] = isl_qpolynomial_set_dim_name(fold->qp[i],
165 isl_qpolynomial_fold_free(fold);
169 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_drop_dims(
170 __isl_take isl_qpolynomial_fold *fold,
171 enum isl_dim_type type, unsigned first, unsigned n)
174 enum isl_dim_type set_type;
181 set_type = type == isl_dim_in ? isl_dim_set : type;
183 fold = isl_qpolynomial_fold_cow(fold);
186 fold->dim = isl_space_drop_dims(fold->dim, set_type, first, n);
190 for (i = 0; i < fold->n; ++i) {
191 fold->qp[i] = isl_qpolynomial_drop_dims(fold->qp[i],
199 isl_qpolynomial_fold_free(fold);
203 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_insert_dims(
204 __isl_take isl_qpolynomial_fold *fold,
205 enum isl_dim_type type, unsigned first, unsigned n)
211 if (n == 0 && !isl_space_is_named_or_nested(fold->dim, type))
214 fold = isl_qpolynomial_fold_cow(fold);
217 fold->dim = isl_space_insert_dims(fold->dim, type, first, n);
221 for (i = 0; i < fold->n; ++i) {
222 fold->qp[i] = isl_qpolynomial_insert_dims(fold->qp[i],
230 isl_qpolynomial_fold_free(fold);
234 static int isl_qpolynomial_cst_sign(__isl_keep isl_qpolynomial *qp)
236 struct isl_upoly_cst *cst;
238 cst = isl_upoly_as_cst(qp->upoly);
242 return isl_int_sgn(cst->n) < 0 ? -1 : 1;
245 static int isl_qpolynomial_aff_sign(__isl_keep isl_set *set,
246 __isl_keep isl_qpolynomial *qp)
248 enum isl_lp_result res;
253 aff = isl_qpolynomial_extract_affine(qp);
259 res = isl_set_solve_lp(set, 0, aff->el + 1, aff->el[0],
261 if (res == isl_lp_error)
263 if (res == isl_lp_empty ||
264 (res == isl_lp_ok && !isl_int_is_neg(opt))) {
269 res = isl_set_solve_lp(set, 1, aff->el + 1, aff->el[0],
271 if (res == isl_lp_ok && !isl_int_is_pos(opt))
280 /* Determine, if possible, the sign of the quasipolynomial "qp" on
283 * If qp is a constant, then the problem is trivial.
284 * If qp is linear, then we check if the minimum of the corresponding
285 * affine constraint is non-negative or if the maximum is non-positive.
287 * Otherwise, we check if the outermost variable "v" has a lower bound "l"
288 * in "set". If so, we write qp(v,v') as
290 * q(v,v') * (v - l) + r(v')
292 * if q(v,v') and r(v') have the same known sign, then the original
293 * quasipolynomial has the same sign as well.
300 static int isl_qpolynomial_sign(__isl_keep isl_set *set,
301 __isl_keep isl_qpolynomial *qp)
306 struct isl_upoly_rec *rec;
309 enum isl_lp_result res;
312 is = isl_qpolynomial_is_cst(qp, NULL, NULL);
316 return isl_qpolynomial_cst_sign(qp);
318 is = isl_qpolynomial_is_affine(qp);
322 return isl_qpolynomial_aff_sign(set, qp);
324 if (qp->div->n_row > 0)
327 rec = isl_upoly_as_rec(qp->upoly);
331 d = isl_space_dim(qp->dim, isl_dim_all);
332 v = isl_vec_alloc(set->ctx, 2 + d);
336 isl_seq_clr(v->el + 1, 1 + d);
337 isl_int_set_si(v->el[0], 1);
338 isl_int_set_si(v->el[2 + qp->upoly->var], 1);
342 res = isl_set_solve_lp(set, 0, v->el + 1, v->el[0], &l, NULL, NULL);
343 if (res == isl_lp_ok) {
344 isl_qpolynomial *min;
345 isl_qpolynomial *base;
346 isl_qpolynomial *r, *q;
349 min = isl_qpolynomial_cst_on_domain(isl_space_copy(qp->dim), l);
350 base = isl_qpolynomial_var_pow_on_domain(isl_space_copy(qp->dim),
353 r = isl_qpolynomial_alloc(isl_space_copy(qp->dim), 0,
354 isl_upoly_copy(rec->p[rec->n - 1]));
355 q = isl_qpolynomial_copy(r);
357 for (i = rec->n - 2; i >= 0; --i) {
358 r = isl_qpolynomial_mul(r, isl_qpolynomial_copy(min));
359 t = isl_qpolynomial_alloc(isl_space_copy(qp->dim), 0,
360 isl_upoly_copy(rec->p[i]));
361 r = isl_qpolynomial_add(r, t);
364 q = isl_qpolynomial_mul(q, isl_qpolynomial_copy(base));
365 q = isl_qpolynomial_add(q, isl_qpolynomial_copy(r));
368 if (isl_qpolynomial_is_zero(q))
369 sgn = isl_qpolynomial_sign(set, r);
370 else if (isl_qpolynomial_is_zero(r))
371 sgn = isl_qpolynomial_sign(set, q);
374 sgn_r = isl_qpolynomial_sign(set, r);
375 sgn_q = isl_qpolynomial_sign(set, q);
380 isl_qpolynomial_free(min);
381 isl_qpolynomial_free(base);
382 isl_qpolynomial_free(q);
383 isl_qpolynomial_free(r);
393 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold_on_domain(
394 __isl_keep isl_set *set,
395 __isl_take isl_qpolynomial_fold *fold1,
396 __isl_take isl_qpolynomial_fold *fold2)
400 struct isl_qpolynomial_fold *res = NULL;
403 if (!fold1 || !fold2)
406 isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error);
407 isl_assert(fold1->dim->ctx, isl_space_is_equal(fold1->dim, fold2->dim),
410 better = fold1->type == isl_fold_max ? -1 : 1;
412 if (isl_qpolynomial_fold_is_empty(fold1)) {
413 isl_qpolynomial_fold_free(fold1);
417 if (isl_qpolynomial_fold_is_empty(fold2)) {
418 isl_qpolynomial_fold_free(fold2);
422 res = qpolynomial_fold_alloc(fold1->type, isl_space_copy(fold1->dim),
423 fold1->n + fold2->n);
427 for (i = 0; i < fold1->n; ++i) {
428 res->qp[res->n] = isl_qpolynomial_copy(fold1->qp[i]);
429 if (!res->qp[res->n])
435 for (i = 0; i < fold2->n; ++i) {
436 for (j = n1 - 1; j >= 0; --j) {
439 d = isl_qpolynomial_sub(
440 isl_qpolynomial_copy(res->qp[j]),
441 isl_qpolynomial_copy(fold2->qp[i]));
442 sgn = isl_qpolynomial_sign(set, d);
443 isl_qpolynomial_free(d);
448 isl_qpolynomial_free(res->qp[j]);
450 res->qp[j] = res->qp[n1 - 1];
452 if (n1 != res->n - 1)
453 res->qp[n1] = res->qp[res->n - 1];
458 res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]);
459 if (!res->qp[res->n])
464 isl_qpolynomial_fold_free(fold1);
465 isl_qpolynomial_fold_free(fold2);
469 isl_qpolynomial_fold_free(res);
470 isl_qpolynomial_fold_free(fold1);
471 isl_qpolynomial_fold_free(fold2);
475 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_add_qpolynomial(
476 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_qpolynomial *qp)
483 if (isl_qpolynomial_is_zero(qp)) {
484 isl_qpolynomial_free(qp);
488 fold = isl_qpolynomial_fold_cow(fold);
492 for (i = 0; i < fold->n; ++i) {
493 fold->qp[i] = isl_qpolynomial_add(fold->qp[i],
494 isl_qpolynomial_copy(qp));
499 isl_qpolynomial_free(qp);
502 isl_qpolynomial_fold_free(fold);
503 isl_qpolynomial_free(qp);
507 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_add_on_domain(
508 __isl_keep isl_set *dom,
509 __isl_take isl_qpolynomial_fold *fold1,
510 __isl_take isl_qpolynomial_fold *fold2)
513 isl_qpolynomial_fold *res = NULL;
515 if (!fold1 || !fold2)
518 if (isl_qpolynomial_fold_is_empty(fold1)) {
519 isl_qpolynomial_fold_free(fold1);
523 if (isl_qpolynomial_fold_is_empty(fold2)) {
524 isl_qpolynomial_fold_free(fold2);
528 if (fold1->n == 1 && fold2->n != 1)
529 return isl_qpolynomial_fold_add_on_domain(dom, fold2, fold1);
532 res = isl_qpolynomial_fold_add_qpolynomial(fold1,
533 isl_qpolynomial_copy(fold2->qp[0]));
534 isl_qpolynomial_fold_free(fold2);
538 res = isl_qpolynomial_fold_add_qpolynomial(
539 isl_qpolynomial_fold_copy(fold1),
540 isl_qpolynomial_copy(fold2->qp[0]));
542 for (i = 1; i < fold2->n; ++i) {
543 isl_qpolynomial_fold *res_i;
544 res_i = isl_qpolynomial_fold_add_qpolynomial(
545 isl_qpolynomial_fold_copy(fold1),
546 isl_qpolynomial_copy(fold2->qp[i]));
547 res = isl_qpolynomial_fold_fold_on_domain(dom, res, res_i);
550 isl_qpolynomial_fold_free(fold1);
551 isl_qpolynomial_fold_free(fold2);
554 isl_qpolynomial_fold_free(res);
555 isl_qpolynomial_fold_free(fold1);
556 isl_qpolynomial_fold_free(fold2);
560 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_substitute_equalities(
561 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_basic_set *eq)
568 fold = isl_qpolynomial_fold_cow(fold);
572 for (i = 0; i < fold->n; ++i) {
573 fold->qp[i] = isl_qpolynomial_substitute_equalities(fold->qp[i],
574 isl_basic_set_copy(eq));
579 isl_basic_set_free(eq);
582 isl_basic_set_free(eq);
583 isl_qpolynomial_fold_free(fold);
587 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_gist(
588 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *context)
592 if (!fold || !context)
595 fold = isl_qpolynomial_fold_cow(fold);
599 for (i = 0; i < fold->n; ++i) {
600 fold->qp[i] = isl_qpolynomial_gist(fold->qp[i],
601 isl_set_copy(context));
606 isl_set_free(context);
609 isl_set_free(context);
610 isl_qpolynomial_fold_free(fold);
614 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_gist_params(
615 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *context)
617 isl_space *space = isl_qpolynomial_fold_get_domain_space(fold);
618 isl_set *dom_context = isl_set_universe(space);
619 dom_context = isl_set_intersect_params(dom_context, context);
620 return isl_qpolynomial_fold_gist(fold, dom_context);
626 #define PW isl_pw_qpolynomial_fold
628 #define EL isl_qpolynomial_fold
630 #define EL_IS_ZERO is_empty
634 #define IS_ZERO is_zero
637 #undef DEFAULT_IS_ZERO
638 #define DEFAULT_IS_ZERO 1
643 #include <isl_pw_templ.c>
646 #define UNION isl_union_pw_qpolynomial_fold
648 #define PART isl_pw_qpolynomial_fold
650 #define PARTS pw_qpolynomial_fold
653 #include <isl_union_templ.c>
655 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_empty(enum isl_fold type,
656 __isl_take isl_space *dim)
658 return qpolynomial_fold_alloc(type, dim, 0);
661 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_alloc(
662 enum isl_fold type, __isl_take isl_qpolynomial *qp)
664 isl_qpolynomial_fold *fold;
669 fold = qpolynomial_fold_alloc(type, isl_space_copy(qp->dim), 1);
678 isl_qpolynomial_fold_free(fold);
679 isl_qpolynomial_free(qp);
683 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_copy(
684 __isl_keep isl_qpolynomial_fold *fold)
693 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_dup(
694 __isl_keep isl_qpolynomial_fold *fold)
697 isl_qpolynomial_fold *dup;
701 dup = qpolynomial_fold_alloc(fold->type,
702 isl_space_copy(fold->dim), fold->n);
707 for (i = 0; i < fold->n; ++i) {
708 dup->qp[i] = isl_qpolynomial_copy(fold->qp[i]);
715 isl_qpolynomial_fold_free(dup);
719 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_cow(
720 __isl_take isl_qpolynomial_fold *fold)
728 return isl_qpolynomial_fold_dup(fold);
731 void isl_qpolynomial_fold_free(__isl_take isl_qpolynomial_fold *fold)
740 for (i = 0; i < fold->n; ++i)
741 isl_qpolynomial_free(fold->qp[i]);
742 isl_space_free(fold->dim);
746 int isl_qpolynomial_fold_is_empty(__isl_keep isl_qpolynomial_fold *fold)
754 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold(
755 __isl_take isl_qpolynomial_fold *fold1,
756 __isl_take isl_qpolynomial_fold *fold2)
759 struct isl_qpolynomial_fold *res = NULL;
761 if (!fold1 || !fold2)
764 isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error);
765 isl_assert(fold1->dim->ctx, isl_space_is_equal(fold1->dim, fold2->dim),
768 if (isl_qpolynomial_fold_is_empty(fold1)) {
769 isl_qpolynomial_fold_free(fold1);
773 if (isl_qpolynomial_fold_is_empty(fold2)) {
774 isl_qpolynomial_fold_free(fold2);
778 res = qpolynomial_fold_alloc(fold1->type, isl_space_copy(fold1->dim),
779 fold1->n + fold2->n);
783 for (i = 0; i < fold1->n; ++i) {
784 res->qp[res->n] = isl_qpolynomial_copy(fold1->qp[i]);
785 if (!res->qp[res->n])
790 for (i = 0; i < fold2->n; ++i) {
791 res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]);
792 if (!res->qp[res->n])
797 isl_qpolynomial_fold_free(fold1);
798 isl_qpolynomial_fold_free(fold2);
802 isl_qpolynomial_fold_free(res);
803 isl_qpolynomial_fold_free(fold1);
804 isl_qpolynomial_fold_free(fold2);
808 __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_fold(
809 __isl_take isl_pw_qpolynomial_fold *pw1,
810 __isl_take isl_pw_qpolynomial_fold *pw2)
813 struct isl_pw_qpolynomial_fold *res;
819 isl_assert(pw1->dim->ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
821 if (isl_pw_qpolynomial_fold_is_zero(pw1)) {
822 isl_pw_qpolynomial_fold_free(pw1);
826 if (isl_pw_qpolynomial_fold_is_zero(pw2)) {
827 isl_pw_qpolynomial_fold_free(pw2);
831 if (pw1->type != pw2->type)
832 isl_die(pw1->dim->ctx, isl_error_invalid,
833 "fold types don't match", goto error);
835 n = (pw1->n + 1) * (pw2->n + 1);
836 res = isl_pw_qpolynomial_fold_alloc_size(isl_space_copy(pw1->dim),
839 for (i = 0; i < pw1->n; ++i) {
840 set = isl_set_copy(pw1->p[i].set);
841 for (j = 0; j < pw2->n; ++j) {
842 struct isl_set *common;
843 isl_qpolynomial_fold *sum;
844 set = isl_set_subtract(set,
845 isl_set_copy(pw2->p[j].set));
846 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
847 isl_set_copy(pw2->p[j].set));
848 if (isl_set_plain_is_empty(common)) {
849 isl_set_free(common);
853 sum = isl_qpolynomial_fold_fold_on_domain(common,
854 isl_qpolynomial_fold_copy(pw1->p[i].fold),
855 isl_qpolynomial_fold_copy(pw2->p[j].fold));
857 res = isl_pw_qpolynomial_fold_add_piece(res, common, sum);
859 res = isl_pw_qpolynomial_fold_add_piece(res, set,
860 isl_qpolynomial_fold_copy(pw1->p[i].fold));
863 for (j = 0; j < pw2->n; ++j) {
864 set = isl_set_copy(pw2->p[j].set);
865 for (i = 0; i < pw1->n; ++i)
866 set = isl_set_subtract(set, isl_set_copy(pw1->p[i].set));
867 res = isl_pw_qpolynomial_fold_add_piece(res, set,
868 isl_qpolynomial_fold_copy(pw2->p[j].fold));
871 isl_pw_qpolynomial_fold_free(pw1);
872 isl_pw_qpolynomial_fold_free(pw2);
876 isl_pw_qpolynomial_fold_free(pw1);
877 isl_pw_qpolynomial_fold_free(pw2);
881 __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold(
882 __isl_take isl_union_pw_qpolynomial_fold *u,
883 __isl_take isl_pw_qpolynomial_fold *part)
886 struct isl_hash_table_entry *entry;
888 u = isl_union_pw_qpolynomial_fold_cow(u);
893 isl_assert(u->dim->ctx, isl_space_match(part->dim, isl_dim_param, u->dim,
894 isl_dim_param), goto error);
896 hash = isl_space_get_hash(part->dim);
897 entry = isl_hash_table_find(u->dim->ctx, &u->table, hash,
898 &has_dim, part->dim, 1);
905 entry->data = isl_pw_qpolynomial_fold_fold(entry->data,
906 isl_pw_qpolynomial_fold_copy(part));
909 isl_pw_qpolynomial_fold_free(part);
914 isl_pw_qpolynomial_fold_free(part);
915 isl_union_pw_qpolynomial_fold_free(u);
919 static int fold_part(__isl_take isl_pw_qpolynomial_fold *part, void *user)
921 isl_union_pw_qpolynomial_fold **u;
922 u = (isl_union_pw_qpolynomial_fold **)user;
924 *u = isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold(*u, part);
929 __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_fold(
930 __isl_take isl_union_pw_qpolynomial_fold *u1,
931 __isl_take isl_union_pw_qpolynomial_fold *u2)
933 u1 = isl_union_pw_qpolynomial_fold_cow(u1);
938 if (isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold(u2,
939 &fold_part, &u1) < 0)
942 isl_union_pw_qpolynomial_fold_free(u2);
946 isl_union_pw_qpolynomial_fold_free(u1);
947 isl_union_pw_qpolynomial_fold_free(u2);
951 __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_from_pw_qpolynomial(
952 enum isl_fold type, __isl_take isl_pw_qpolynomial *pwqp)
955 isl_pw_qpolynomial_fold *pwf;
960 pwf = isl_pw_qpolynomial_fold_alloc_size(isl_space_copy(pwqp->dim),
963 for (i = 0; i < pwqp->n; ++i)
964 pwf = isl_pw_qpolynomial_fold_add_piece(pwf,
965 isl_set_copy(pwqp->p[i].set),
966 isl_qpolynomial_fold_alloc(type,
967 isl_qpolynomial_copy(pwqp->p[i].qp)));
969 isl_pw_qpolynomial_free(pwqp);
974 __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_add(
975 __isl_take isl_pw_qpolynomial_fold *pwf1,
976 __isl_take isl_pw_qpolynomial_fold *pwf2)
978 return isl_pw_qpolynomial_fold_union_add_(pwf1, pwf2);
981 int isl_qpolynomial_fold_plain_is_equal(__isl_keep isl_qpolynomial_fold *fold1,
982 __isl_keep isl_qpolynomial_fold *fold2)
986 if (!fold1 || !fold2)
989 if (fold1->n != fold2->n)
992 /* We probably want to sort the qps first... */
993 for (i = 0; i < fold1->n; ++i) {
994 int eq = isl_qpolynomial_plain_is_equal(fold1->qp[i], fold2->qp[i]);
1002 __isl_give isl_qpolynomial *isl_qpolynomial_fold_eval(
1003 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_point *pnt)
1005 isl_qpolynomial *qp;
1009 isl_assert(pnt->dim->ctx, isl_space_is_equal(pnt->dim, fold->dim), goto error);
1010 isl_assert(pnt->dim->ctx,
1011 fold->type == isl_fold_max || fold->type == isl_fold_min,
1015 qp = isl_qpolynomial_zero_on_domain(isl_space_copy(fold->dim));
1018 qp = isl_qpolynomial_eval(isl_qpolynomial_copy(fold->qp[0]),
1019 isl_point_copy(pnt));
1020 for (i = 1; i < fold->n; ++i) {
1021 isl_qpolynomial *qp_i;
1022 qp_i = isl_qpolynomial_eval(
1023 isl_qpolynomial_copy(fold->qp[i]),
1024 isl_point_copy(pnt));
1025 if (fold->type == isl_fold_max)
1026 qp = isl_qpolynomial_max_cst(qp, qp_i);
1028 qp = isl_qpolynomial_min_cst(qp, qp_i);
1031 isl_qpolynomial_fold_free(fold);
1032 isl_point_free(pnt);
1036 isl_qpolynomial_fold_free(fold);
1037 isl_point_free(pnt);
1041 size_t isl_pw_qpolynomial_fold_size(__isl_keep isl_pw_qpolynomial_fold *pwf)
1046 for (i = 0; i < pwf->n; ++i)
1047 n += pwf->p[i].fold->n;
1052 __isl_give isl_qpolynomial *isl_qpolynomial_fold_opt_on_domain(
1053 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *set, int max)
1056 isl_qpolynomial *opt;
1062 isl_space *dim = isl_space_copy(fold->dim);
1064 isl_qpolynomial_fold_free(fold);
1065 return isl_qpolynomial_zero_on_domain(dim);
1068 opt = isl_qpolynomial_opt_on_domain(isl_qpolynomial_copy(fold->qp[0]),
1069 isl_set_copy(set), max);
1070 for (i = 1; i < fold->n; ++i) {
1071 isl_qpolynomial *opt_i;
1072 opt_i = isl_qpolynomial_opt_on_domain(
1073 isl_qpolynomial_copy(fold->qp[i]),
1074 isl_set_copy(set), max);
1076 opt = isl_qpolynomial_max_cst(opt, opt_i);
1078 opt = isl_qpolynomial_min_cst(opt, opt_i);
1082 isl_qpolynomial_fold_free(fold);
1087 isl_qpolynomial_fold_free(fold);
1091 /* Check whether for each quasi-polynomial in "fold2" there is
1092 * a quasi-polynomial in "fold1" that dominates it on "set".
1094 static int qpolynomial_fold_covers_on_domain(__isl_keep isl_set *set,
1095 __isl_keep isl_qpolynomial_fold *fold1,
1096 __isl_keep isl_qpolynomial_fold *fold2)
1101 if (!set || !fold1 || !fold2)
1104 covers = fold1->type == isl_fold_max ? 1 : -1;
1106 for (i = 0; i < fold2->n; ++i) {
1107 for (j = 0; j < fold1->n; ++j) {
1111 d = isl_qpolynomial_sub(
1112 isl_qpolynomial_copy(fold1->qp[j]),
1113 isl_qpolynomial_copy(fold2->qp[i]));
1114 sgn = isl_qpolynomial_sign(set, d);
1115 isl_qpolynomial_free(d);
1126 /* Check whether "pwf1" dominated "pwf2", i.e., the domain of "pwf1" contains
1127 * that of "pwf2" and on each cell, the corresponding fold from pwf1 dominates
1130 int isl_pw_qpolynomial_fold_covers(__isl_keep isl_pw_qpolynomial_fold *pwf1,
1131 __isl_keep isl_pw_qpolynomial_fold *pwf2)
1134 isl_set *dom1, *dom2;
1145 dom1 = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf1));
1146 dom2 = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf2));
1147 is_subset = isl_set_is_subset(dom2, dom1);
1151 if (is_subset < 0 || !is_subset)
1154 for (i = 0; i < pwf2->n; ++i) {
1155 for (j = 0; j < pwf1->n; ++j) {
1160 common = isl_set_intersect(isl_set_copy(pwf1->p[j].set),
1161 isl_set_copy(pwf2->p[i].set));
1162 is_empty = isl_set_is_empty(common);
1163 if (is_empty < 0 || is_empty) {
1164 isl_set_free(common);
1169 covers = qpolynomial_fold_covers_on_domain(common,
1170 pwf1->p[j].fold, pwf2->p[i].fold);
1171 isl_set_free(common);
1172 if (covers < 0 || !covers)
1180 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_morph_domain(
1181 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_morph *morph)
1186 if (!fold || !morph)
1189 ctx = fold->dim->ctx;
1190 isl_assert(ctx, isl_space_is_equal(fold->dim, morph->dom->dim), goto error);
1192 fold = isl_qpolynomial_fold_cow(fold);
1196 isl_space_free(fold->dim);
1197 fold->dim = isl_space_copy(morph->ran->dim);
1201 for (i = 0; i < fold->n; ++i) {
1202 fold->qp[i] = isl_qpolynomial_morph_domain(fold->qp[i],
1203 isl_morph_copy(morph));
1208 isl_morph_free(morph);
1212 isl_qpolynomial_fold_free(fold);
1213 isl_morph_free(morph);
1217 enum isl_fold isl_qpolynomial_fold_get_type(__isl_keep isl_qpolynomial_fold *fold)
1220 return isl_fold_list;
1224 enum isl_fold isl_union_pw_qpolynomial_fold_get_type(
1225 __isl_keep isl_union_pw_qpolynomial_fold *upwf)
1228 return isl_fold_list;
1232 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_lift(
1233 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_space *dim)
1240 if (isl_space_is_equal(fold->dim, dim)) {
1241 isl_space_free(dim);
1245 fold = isl_qpolynomial_fold_cow(fold);
1249 isl_space_free(fold->dim);
1250 fold->dim = isl_space_copy(dim);
1254 for (i = 0; i < fold->n; ++i) {
1255 fold->qp[i] = isl_qpolynomial_lift(fold->qp[i],
1256 isl_space_copy(dim));
1261 isl_space_free(dim);
1265 isl_qpolynomial_fold_free(fold);
1266 isl_space_free(dim);
1270 int isl_qpolynomial_fold_foreach_qpolynomial(
1271 __isl_keep isl_qpolynomial_fold *fold,
1272 int (*fn)(__isl_take isl_qpolynomial *qp, void *user), void *user)
1279 for (i = 0; i < fold->n; ++i)
1280 if (fn(isl_qpolynomial_copy(fold->qp[i]), user) < 0)
1286 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_move_dims(
1287 __isl_take isl_qpolynomial_fold *fold,
1288 enum isl_dim_type dst_type, unsigned dst_pos,
1289 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1296 fold = isl_qpolynomial_fold_cow(fold);
1300 fold->dim = isl_space_move_dims(fold->dim, dst_type, dst_pos,
1301 src_type, src_pos, n);
1305 for (i = 0; i < fold->n; ++i) {
1306 fold->qp[i] = isl_qpolynomial_move_dims(fold->qp[i],
1307 dst_type, dst_pos, src_type, src_pos, n);
1314 isl_qpolynomial_fold_free(fold);
1318 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
1319 * in fold->qp[k] by subs[i].
1321 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_substitute(
1322 __isl_take isl_qpolynomial_fold *fold,
1323 enum isl_dim_type type, unsigned first, unsigned n,
1324 __isl_keep isl_qpolynomial **subs)
1331 fold = isl_qpolynomial_fold_cow(fold);
1335 for (i = 0; i < fold->n; ++i) {
1336 fold->qp[i] = isl_qpolynomial_substitute(fold->qp[i],
1337 type, first, n, subs);
1344 isl_qpolynomial_fold_free(fold);
1348 static int add_pwqp(__isl_take isl_pw_qpolynomial *pwqp, void *user)
1351 isl_pw_qpolynomial_fold *pwf;
1352 isl_union_pw_qpolynomial_fold **upwf;
1354 struct isl_hash_table_entry *entry;
1356 upwf = (isl_union_pw_qpolynomial_fold **)user;
1358 ctx = pwqp->dim->ctx;
1359 hash = isl_space_get_hash(pwqp->dim);
1360 entry = isl_hash_table_find(ctx, &(*upwf)->table,
1361 hash, &has_dim, pwqp->dim, 1);
1365 pwf = isl_pw_qpolynomial_fold_from_pw_qpolynomial((*upwf)->type, pwqp);
1369 entry->data = isl_pw_qpolynomial_fold_add(entry->data, pwf);
1372 if (isl_pw_qpolynomial_fold_is_zero(entry->data)) {
1373 isl_pw_qpolynomial_fold_free(entry->data);
1374 isl_hash_table_remove(ctx, &(*upwf)->table, entry);
1380 isl_pw_qpolynomial_free(pwqp);
1384 __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_add_union_pw_qpolynomial(
1385 __isl_take isl_union_pw_qpolynomial_fold *upwf,
1386 __isl_take isl_union_pw_qpolynomial *upwqp)
1388 upwf = isl_union_pw_qpolynomial_fold_align_params(upwf,
1389 isl_union_pw_qpolynomial_get_space(upwqp));
1390 upwqp = isl_union_pw_qpolynomial_align_params(upwqp,
1391 isl_union_pw_qpolynomial_fold_get_space(upwf));
1393 upwf = isl_union_pw_qpolynomial_fold_cow(upwf);
1394 if (!upwf || !upwqp)
1397 if (isl_union_pw_qpolynomial_foreach_pw_qpolynomial(upwqp, &add_pwqp,
1401 isl_union_pw_qpolynomial_free(upwqp);
1405 isl_union_pw_qpolynomial_fold_free(upwf);
1406 isl_union_pw_qpolynomial_free(upwqp);
1410 static int join_compatible(__isl_keep isl_space *dim1, __isl_keep isl_space *dim2)
1413 m = isl_space_match(dim1, isl_dim_param, dim2, isl_dim_param);
1416 return isl_space_tuple_match(dim1, isl_dim_out, dim2, isl_dim_in);
1419 /* Compute the intersection of the range of the map and the domain
1420 * of the piecewise quasipolynomial reduction and then compute a bound
1421 * on the associated quasipolynomial reduction over all elements
1422 * in this intersection.
1424 * We first introduce some unconstrained dimensions in the
1425 * piecewise quasipolynomial, intersect the resulting domain
1426 * with the wrapped map and the compute the sum.
1428 __isl_give isl_pw_qpolynomial_fold *isl_map_apply_pw_qpolynomial_fold(
1429 __isl_take isl_map *map, __isl_take isl_pw_qpolynomial_fold *pwf,
1439 ctx = isl_map_get_ctx(map);
1443 map_dim = isl_map_get_space(map);
1444 pwf_dim = isl_pw_qpolynomial_fold_get_space(pwf);
1445 ok = join_compatible(map_dim, pwf_dim);
1446 isl_space_free(map_dim);
1447 isl_space_free(pwf_dim);
1449 isl_die(ctx, isl_error_invalid, "incompatible dimensions",
1452 n_in = isl_map_dim(map, isl_dim_in);
1453 pwf = isl_pw_qpolynomial_fold_insert_dims(pwf, isl_dim_in, 0, n_in);
1455 dom = isl_map_wrap(map);
1456 pwf = isl_pw_qpolynomial_fold_reset_domain_space(pwf,
1457 isl_set_get_space(dom));
1459 pwf = isl_pw_qpolynomial_fold_intersect_domain(pwf, dom);
1460 pwf = isl_pw_qpolynomial_fold_bound(pwf, tight);
1465 isl_pw_qpolynomial_fold_free(pwf);
1469 __isl_give isl_pw_qpolynomial_fold *isl_set_apply_pw_qpolynomial_fold(
1470 __isl_take isl_set *set, __isl_take isl_pw_qpolynomial_fold *pwf,
1473 return isl_map_apply_pw_qpolynomial_fold(set, pwf, tight);
1476 struct isl_apply_fold_data {
1477 isl_union_pw_qpolynomial_fold *upwf;
1478 isl_union_pw_qpolynomial_fold *res;
1483 static int pw_qpolynomial_fold_apply(__isl_take isl_pw_qpolynomial_fold *pwf,
1488 struct isl_apply_fold_data *data = user;
1491 map_dim = isl_map_get_space(data->map);
1492 pwf_dim = isl_pw_qpolynomial_fold_get_space(pwf);
1493 ok = join_compatible(map_dim, pwf_dim);
1494 isl_space_free(map_dim);
1495 isl_space_free(pwf_dim);
1498 pwf = isl_map_apply_pw_qpolynomial_fold(isl_map_copy(data->map),
1499 pwf, data->tight ? &data->tight : NULL);
1500 data->res = isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold(
1503 isl_pw_qpolynomial_fold_free(pwf);
1508 static int map_apply(__isl_take isl_map *map, void *user)
1510 struct isl_apply_fold_data *data = user;
1514 r = isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold(
1515 data->upwf, &pw_qpolynomial_fold_apply, data);
1521 __isl_give isl_union_pw_qpolynomial_fold *isl_union_map_apply_union_pw_qpolynomial_fold(
1522 __isl_take isl_union_map *umap,
1523 __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight)
1527 struct isl_apply_fold_data data;
1529 upwf = isl_union_pw_qpolynomial_fold_align_params(upwf,
1530 isl_union_map_get_space(umap));
1531 umap = isl_union_map_align_params(umap,
1532 isl_union_pw_qpolynomial_fold_get_space(upwf));
1535 data.tight = tight ? 1 : 0;
1536 dim = isl_union_pw_qpolynomial_fold_get_space(upwf);
1537 type = isl_union_pw_qpolynomial_fold_get_type(upwf);
1538 data.res = isl_union_pw_qpolynomial_fold_zero(dim, type);
1539 if (isl_union_map_foreach_map(umap, &map_apply, &data) < 0)
1542 isl_union_map_free(umap);
1543 isl_union_pw_qpolynomial_fold_free(upwf);
1546 *tight = data.tight;
1550 isl_union_map_free(umap);
1551 isl_union_pw_qpolynomial_fold_free(upwf);
1552 isl_union_pw_qpolynomial_fold_free(data.res);
1556 __isl_give isl_union_pw_qpolynomial_fold *isl_union_set_apply_union_pw_qpolynomial_fold(
1557 __isl_take isl_union_set *uset,
1558 __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight)
1560 return isl_union_map_apply_union_pw_qpolynomial_fold(uset, upwf, tight);
1563 /* Reorder the dimension of "fold" according to the given reordering.
1565 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_realign_domain(
1566 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_reordering *r)
1570 fold = isl_qpolynomial_fold_cow(fold);
1574 for (i = 0; i < fold->n; ++i) {
1575 fold->qp[i] = isl_qpolynomial_realign_domain(fold->qp[i],
1576 isl_reordering_copy(r));
1581 fold = isl_qpolynomial_fold_reset_domain_space(fold,
1582 isl_space_copy(r->dim));
1584 isl_reordering_free(r);
1588 isl_qpolynomial_fold_free(fold);
1589 isl_reordering_free(r);
1593 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_mul_isl_int(
1594 __isl_take isl_qpolynomial_fold *fold, isl_int v)
1598 if (isl_int_is_one(v))
1600 if (fold && isl_int_is_zero(v)) {
1601 isl_qpolynomial_fold *zero;
1602 isl_space *dim = isl_space_copy(fold->dim);
1603 zero = isl_qpolynomial_fold_empty(fold->type, dim);
1604 isl_qpolynomial_fold_free(fold);
1608 fold = isl_qpolynomial_fold_cow(fold);
1612 if (isl_int_is_neg(v))
1613 fold->type = isl_fold_type_negate(fold->type);
1614 for (i = 0; i < fold->n; ++i) {
1615 fold->qp[i] = isl_qpolynomial_mul_isl_int(fold->qp[i], v);
1622 isl_qpolynomial_fold_free(fold);
1626 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale(
1627 __isl_take isl_qpolynomial_fold *fold, isl_int v)
1629 return isl_qpolynomial_fold_mul_isl_int(fold, v);