2 * Copyright 2010 INRIA Saclay
4 * Use of this software is governed by the GNU LGPLv2.1 license
6 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
7 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
14 #include <isl_union_map_private.h>
15 #include <isl_polynomial_private.h>
16 #include <isl_point_private.h>
17 #include <isl_dim_private.h>
18 #include <isl_map_private.h>
20 static unsigned pos(__isl_keep isl_dim *dim, enum isl_dim_type type)
23 case isl_dim_param: return 0;
24 case isl_dim_in: return dim->nparam;
25 case isl_dim_out: return dim->nparam + dim->n_in;
30 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
38 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
43 isl_assert(up->ctx, up->var < 0, return NULL);
45 return (struct isl_upoly_cst *)up;
48 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
53 isl_assert(up->ctx, up->var >= 0, return NULL);
55 return (struct isl_upoly_rec *)up;
58 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
59 __isl_keep struct isl_upoly *up2)
62 struct isl_upoly_rec *rec1, *rec2;
68 if (up1->var != up2->var)
70 if (isl_upoly_is_cst(up1)) {
71 struct isl_upoly_cst *cst1, *cst2;
72 cst1 = isl_upoly_as_cst(up1);
73 cst2 = isl_upoly_as_cst(up2);
76 return isl_int_eq(cst1->n, cst2->n) &&
77 isl_int_eq(cst1->d, cst2->d);
80 rec1 = isl_upoly_as_rec(up1);
81 rec2 = isl_upoly_as_rec(up2);
85 if (rec1->n != rec2->n)
88 for (i = 0; i < rec1->n; ++i) {
89 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
97 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
99 struct isl_upoly_cst *cst;
103 if (!isl_upoly_is_cst(up))
106 cst = isl_upoly_as_cst(up);
110 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
113 int isl_upoly_sgn(__isl_keep struct isl_upoly *up)
115 struct isl_upoly_cst *cst;
119 if (!isl_upoly_is_cst(up))
122 cst = isl_upoly_as_cst(up);
126 return isl_int_sgn(cst->n);
129 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
131 struct isl_upoly_cst *cst;
135 if (!isl_upoly_is_cst(up))
138 cst = isl_upoly_as_cst(up);
142 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
145 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
147 struct isl_upoly_cst *cst;
151 if (!isl_upoly_is_cst(up))
154 cst = isl_upoly_as_cst(up);
158 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
161 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
163 struct isl_upoly_cst *cst;
167 if (!isl_upoly_is_cst(up))
170 cst = isl_upoly_as_cst(up);
174 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
177 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
179 struct isl_upoly_cst *cst;
183 if (!isl_upoly_is_cst(up))
186 cst = isl_upoly_as_cst(up);
190 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
193 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
195 struct isl_upoly_cst *cst;
199 if (!isl_upoly_is_cst(up))
202 cst = isl_upoly_as_cst(up);
206 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
209 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
211 struct isl_upoly_cst *cst;
213 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
222 isl_int_init(cst->n);
223 isl_int_init(cst->d);
228 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
230 struct isl_upoly_cst *cst;
232 cst = isl_upoly_cst_alloc(ctx);
236 isl_int_set_si(cst->n, 0);
237 isl_int_set_si(cst->d, 1);
242 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
244 struct isl_upoly_cst *cst;
246 cst = isl_upoly_cst_alloc(ctx);
250 isl_int_set_si(cst->n, 1);
251 isl_int_set_si(cst->d, 0);
256 __isl_give struct isl_upoly *isl_upoly_neginfty(struct isl_ctx *ctx)
258 struct isl_upoly_cst *cst;
260 cst = isl_upoly_cst_alloc(ctx);
264 isl_int_set_si(cst->n, -1);
265 isl_int_set_si(cst->d, 0);
270 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
272 struct isl_upoly_cst *cst;
274 cst = isl_upoly_cst_alloc(ctx);
278 isl_int_set_si(cst->n, 0);
279 isl_int_set_si(cst->d, 0);
284 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
285 isl_int n, isl_int d)
287 struct isl_upoly_cst *cst;
289 cst = isl_upoly_cst_alloc(ctx);
293 isl_int_set(cst->n, n);
294 isl_int_set(cst->d, d);
299 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
302 struct isl_upoly_rec *rec;
304 isl_assert(ctx, var >= 0, return NULL);
305 isl_assert(ctx, size >= 0, return NULL);
306 rec = isl_calloc(ctx, struct isl_upoly_rec,
307 sizeof(struct isl_upoly_rec) +
308 (size - 1) * sizeof(struct isl_upoly *));
323 __isl_give isl_qpolynomial *isl_qpolynomial_reset_dim(
324 __isl_take isl_qpolynomial *qp, __isl_take isl_dim *dim)
326 qp = isl_qpolynomial_cow(qp);
330 isl_dim_free(qp->dim);
335 isl_qpolynomial_free(qp);
340 isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp)
342 return qp ? qp->dim->ctx : NULL;
345 __isl_give isl_dim *isl_qpolynomial_get_dim(__isl_keep isl_qpolynomial *qp)
347 return qp ? isl_dim_copy(qp->dim) : NULL;
350 unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp,
351 enum isl_dim_type type)
353 return qp ? isl_dim_size(qp->dim, type) : 0;
356 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
358 return qp ? isl_upoly_is_zero(qp->upoly) : -1;
361 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
363 return qp ? isl_upoly_is_one(qp->upoly) : -1;
366 int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
368 return qp ? isl_upoly_is_nan(qp->upoly) : -1;
371 int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
373 return qp ? isl_upoly_is_infty(qp->upoly) : -1;
376 int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
378 return qp ? isl_upoly_is_neginfty(qp->upoly) : -1;
381 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
383 return qp ? isl_upoly_sgn(qp->upoly) : 0;
386 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
388 isl_int_clear(cst->n);
389 isl_int_clear(cst->d);
392 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
396 for (i = 0; i < rec->n; ++i)
397 isl_upoly_free(rec->p[i]);
400 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
409 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
411 struct isl_upoly_cst *cst;
412 struct isl_upoly_cst *dup;
414 cst = isl_upoly_as_cst(up);
418 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
421 isl_int_set(dup->n, cst->n);
422 isl_int_set(dup->d, cst->d);
427 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
430 struct isl_upoly_rec *rec;
431 struct isl_upoly_rec *dup;
433 rec = isl_upoly_as_rec(up);
437 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
441 for (i = 0; i < rec->n; ++i) {
442 dup->p[i] = isl_upoly_copy(rec->p[i]);
450 isl_upoly_free(&dup->up);
454 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
456 struct isl_upoly *dup;
461 if (isl_upoly_is_cst(up))
462 return isl_upoly_dup_cst(up);
464 return isl_upoly_dup_rec(up);
467 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
475 return isl_upoly_dup(up);
478 void isl_upoly_free(__isl_take struct isl_upoly *up)
487 upoly_free_cst((struct isl_upoly_cst *)up);
489 upoly_free_rec((struct isl_upoly_rec *)up);
491 isl_ctx_deref(up->ctx);
495 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
500 isl_int_gcd(gcd, cst->n, cst->d);
501 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
502 isl_int_divexact(cst->n, cst->n, gcd);
503 isl_int_divexact(cst->d, cst->d, gcd);
508 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
509 __isl_take struct isl_upoly *up2)
511 struct isl_upoly_cst *cst1;
512 struct isl_upoly_cst *cst2;
514 up1 = isl_upoly_cow(up1);
518 cst1 = isl_upoly_as_cst(up1);
519 cst2 = isl_upoly_as_cst(up2);
521 if (isl_int_eq(cst1->d, cst2->d))
522 isl_int_add(cst1->n, cst1->n, cst2->n);
524 isl_int_mul(cst1->n, cst1->n, cst2->d);
525 isl_int_addmul(cst1->n, cst2->n, cst1->d);
526 isl_int_mul(cst1->d, cst1->d, cst2->d);
529 isl_upoly_cst_reduce(cst1);
539 static __isl_give struct isl_upoly *replace_by_zero(
540 __isl_take struct isl_upoly *up)
548 return isl_upoly_zero(ctx);
551 static __isl_give struct isl_upoly *replace_by_constant_term(
552 __isl_take struct isl_upoly *up)
554 struct isl_upoly_rec *rec;
555 struct isl_upoly *cst;
560 rec = isl_upoly_as_rec(up);
563 cst = isl_upoly_copy(rec->p[0]);
571 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
572 __isl_take struct isl_upoly *up2)
575 struct isl_upoly_rec *rec1, *rec2;
580 if (isl_upoly_is_nan(up1)) {
585 if (isl_upoly_is_nan(up2)) {
590 if (isl_upoly_is_zero(up1)) {
595 if (isl_upoly_is_zero(up2)) {
600 if (up1->var < up2->var)
601 return isl_upoly_sum(up2, up1);
603 if (up2->var < up1->var) {
604 struct isl_upoly_rec *rec;
605 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
609 up1 = isl_upoly_cow(up1);
610 rec = isl_upoly_as_rec(up1);
613 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
615 up1 = replace_by_constant_term(up1);
619 if (isl_upoly_is_cst(up1))
620 return isl_upoly_sum_cst(up1, up2);
622 rec1 = isl_upoly_as_rec(up1);
623 rec2 = isl_upoly_as_rec(up2);
627 if (rec1->n < rec2->n)
628 return isl_upoly_sum(up2, up1);
630 up1 = isl_upoly_cow(up1);
631 rec1 = isl_upoly_as_rec(up1);
635 for (i = rec2->n - 1; i >= 0; --i) {
636 rec1->p[i] = isl_upoly_sum(rec1->p[i],
637 isl_upoly_copy(rec2->p[i]));
640 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
641 isl_upoly_free(rec1->p[i]);
647 up1 = replace_by_zero(up1);
648 else if (rec1->n == 1)
649 up1 = replace_by_constant_term(up1);
660 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
662 struct isl_upoly_cst *cst;
664 if (isl_upoly_is_zero(up))
667 up = isl_upoly_cow(up);
671 cst = isl_upoly_as_cst(up);
673 isl_int_neg(cst->n, cst->n);
678 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
681 struct isl_upoly_rec *rec;
686 if (isl_upoly_is_cst(up))
687 return isl_upoly_neg_cst(up);
689 up = isl_upoly_cow(up);
690 rec = isl_upoly_as_rec(up);
694 for (i = 0; i < rec->n; ++i) {
695 rec->p[i] = isl_upoly_neg(rec->p[i]);
706 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
707 __isl_take struct isl_upoly *up2)
709 struct isl_upoly_cst *cst1;
710 struct isl_upoly_cst *cst2;
712 up1 = isl_upoly_cow(up1);
716 cst1 = isl_upoly_as_cst(up1);
717 cst2 = isl_upoly_as_cst(up2);
719 isl_int_mul(cst1->n, cst1->n, cst2->n);
720 isl_int_mul(cst1->d, cst1->d, cst2->d);
722 isl_upoly_cst_reduce(cst1);
732 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
733 __isl_take struct isl_upoly *up2)
735 struct isl_upoly_rec *rec1;
736 struct isl_upoly_rec *rec2;
737 struct isl_upoly_rec *res;
741 rec1 = isl_upoly_as_rec(up1);
742 rec2 = isl_upoly_as_rec(up2);
745 size = rec1->n + rec2->n - 1;
746 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
750 for (i = 0; i < rec1->n; ++i) {
751 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
752 isl_upoly_copy(rec1->p[i]));
757 for (; i < size; ++i) {
758 res->p[i] = isl_upoly_zero(up1->ctx);
763 for (i = 0; i < rec1->n; ++i) {
764 for (j = 1; j < rec2->n; ++j) {
765 struct isl_upoly *up;
766 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
767 isl_upoly_copy(rec1->p[i]));
768 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
781 isl_upoly_free(&res->up);
785 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
786 __isl_take struct isl_upoly *up2)
791 if (isl_upoly_is_nan(up1)) {
796 if (isl_upoly_is_nan(up2)) {
801 if (isl_upoly_is_zero(up1)) {
806 if (isl_upoly_is_zero(up2)) {
811 if (isl_upoly_is_one(up1)) {
816 if (isl_upoly_is_one(up2)) {
821 if (up1->var < up2->var)
822 return isl_upoly_mul(up2, up1);
824 if (up2->var < up1->var) {
826 struct isl_upoly_rec *rec;
827 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
828 isl_ctx *ctx = up1->ctx;
831 return isl_upoly_nan(ctx);
833 up1 = isl_upoly_cow(up1);
834 rec = isl_upoly_as_rec(up1);
838 for (i = 0; i < rec->n; ++i) {
839 rec->p[i] = isl_upoly_mul(rec->p[i],
840 isl_upoly_copy(up2));
848 if (isl_upoly_is_cst(up1))
849 return isl_upoly_mul_cst(up1, up2);
851 return isl_upoly_mul_rec(up1, up2);
858 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
859 unsigned n_div, __isl_take struct isl_upoly *up)
861 struct isl_qpolynomial *qp = NULL;
867 total = isl_dim_total(dim);
869 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
874 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
885 isl_qpolynomial_free(qp);
889 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
898 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
900 struct isl_qpolynomial *dup;
905 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row,
906 isl_upoly_copy(qp->upoly));
909 isl_mat_free(dup->div);
910 dup->div = isl_mat_copy(qp->div);
916 isl_qpolynomial_free(dup);
920 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
928 return isl_qpolynomial_dup(qp);
931 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
939 isl_dim_free(qp->dim);
940 isl_mat_free(qp->div);
941 isl_upoly_free(qp->upoly);
946 __isl_give struct isl_upoly *isl_upoly_pow(isl_ctx *ctx, int pos, int power)
949 struct isl_upoly *up;
950 struct isl_upoly_rec *rec;
951 struct isl_upoly_cst *cst;
953 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
956 for (i = 0; i < 1 + power; ++i) {
957 rec->p[i] = isl_upoly_zero(ctx);
962 cst = isl_upoly_as_cst(rec->p[power]);
963 isl_int_set_si(cst->n, 1);
967 isl_upoly_free(&rec->up);
971 /* r array maps original positions to new positions.
973 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
977 struct isl_upoly_rec *rec;
978 struct isl_upoly *base;
979 struct isl_upoly *res;
981 if (isl_upoly_is_cst(up))
984 rec = isl_upoly_as_rec(up);
988 isl_assert(up->ctx, rec->n >= 1, goto error);
990 base = isl_upoly_pow(up->ctx, r[up->var], 1);
991 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
993 for (i = rec->n - 2; i >= 0; --i) {
994 res = isl_upoly_mul(res, isl_upoly_copy(base));
995 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
998 isl_upoly_free(base);
1007 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
1012 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1013 div1->n_col >= div2->n_col, return -1);
1015 if (div1->n_row == div2->n_row)
1016 return isl_mat_is_equal(div1, div2);
1018 n_row = div1->n_row;
1019 n_col = div1->n_col;
1020 div1->n_row = div2->n_row;
1021 div1->n_col = div2->n_col;
1023 equal = isl_mat_is_equal(div1, div2);
1025 div1->n_row = n_row;
1026 div1->n_col = n_col;
1031 static void expand_row(__isl_keep isl_mat *dst, int d,
1032 __isl_keep isl_mat *src, int s, int *exp)
1035 unsigned c = src->n_col - src->n_row;
1037 isl_seq_cpy(dst->row[d], src->row[s], c);
1038 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
1040 for (i = 0; i < s; ++i)
1041 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
1044 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
1048 li = isl_seq_last_non_zero(div->row[i], div->n_col);
1049 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
1054 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
1057 struct isl_div_sort_info {
1062 static int div_sort_cmp(const void *p1, const void *p2)
1064 const struct isl_div_sort_info *i1, *i2;
1065 i1 = (const struct isl_div_sort_info *) p1;
1066 i2 = (const struct isl_div_sort_info *) p2;
1068 return cmp_row(i1->div, i1->row, i2->row);
1071 /* Sort divs and remove duplicates.
1073 static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp)
1078 struct isl_div_sort_info *array = NULL;
1079 int *pos = NULL, *at = NULL;
1080 int *reordering = NULL;
1085 if (qp->div->n_row <= 1)
1088 div_pos = isl_dim_total(qp->dim);
1090 array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info,
1092 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1093 at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1094 len = qp->div->n_col - 2;
1095 reordering = isl_alloc_array(qp->div->ctx, int, len);
1096 if (!array || !pos || !at || !reordering)
1099 for (i = 0; i < qp->div->n_row; ++i) {
1100 array[i].div = qp->div;
1106 qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
1109 for (i = 0; i < div_pos; ++i)
1112 for (i = 0; i < qp->div->n_row; ++i) {
1113 if (pos[array[i].row] == i)
1115 qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]);
1116 pos[at[i]] = pos[array[i].row];
1117 at[pos[array[i].row]] = at[i];
1118 at[i] = array[i].row;
1119 pos[array[i].row] = i;
1123 for (i = 0; i < len - div_pos; ++i) {
1125 isl_seq_eq(qp->div->row[i - skip - 1],
1126 qp->div->row[i - skip], qp->div->n_col)) {
1127 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
1128 qp->div = isl_mat_drop_cols(qp->div,
1129 2 + div_pos + i - skip, 1);
1132 reordering[div_pos + array[i].row] = div_pos + i - skip;
1135 qp->upoly = reorder(qp->upoly, reordering);
1137 if (!qp->upoly || !qp->div)
1151 isl_qpolynomial_free(qp);
1155 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
1156 __isl_keep isl_mat *div2, int *exp1, int *exp2)
1159 isl_mat *div = NULL;
1160 unsigned d = div1->n_col - div1->n_row;
1162 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
1163 d + div1->n_row + div2->n_row);
1167 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
1170 expand_row(div, k, div1, i, exp1);
1171 expand_row(div, k + 1, div2, j, exp2);
1173 cmp = cmp_row(div, k, k + 1);
1177 } else if (cmp < 0) {
1181 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1184 for (; i < div1->n_row; ++i, ++k) {
1185 expand_row(div, k, div1, i, exp1);
1188 for (; j < div2->n_row; ++j, ++k) {
1189 expand_row(div, k, div2, j, exp2);
1199 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1200 int *exp, int first)
1203 struct isl_upoly_rec *rec;
1205 if (isl_upoly_is_cst(up))
1208 if (up->var < first)
1211 if (exp[up->var - first] == up->var - first)
1214 up = isl_upoly_cow(up);
1218 up->var = exp[up->var - first] + first;
1220 rec = isl_upoly_as_rec(up);
1224 for (i = 0; i < rec->n; ++i) {
1225 rec->p[i] = expand(rec->p[i], exp, first);
1236 static __isl_give isl_qpolynomial *with_merged_divs(
1237 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1238 __isl_take isl_qpolynomial *qp2),
1239 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1243 isl_mat *div = NULL;
1245 qp1 = isl_qpolynomial_cow(qp1);
1246 qp2 = isl_qpolynomial_cow(qp2);
1251 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1252 qp1->div->n_col >= qp2->div->n_col, goto error);
1254 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1255 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1259 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1263 isl_mat_free(qp1->div);
1264 qp1->div = isl_mat_copy(div);
1265 isl_mat_free(qp2->div);
1266 qp2->div = isl_mat_copy(div);
1268 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1269 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1271 if (!qp1->upoly || !qp2->upoly)
1278 return fn(qp1, qp2);
1283 isl_qpolynomial_free(qp1);
1284 isl_qpolynomial_free(qp2);
1288 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1289 __isl_take isl_qpolynomial *qp2)
1291 qp1 = isl_qpolynomial_cow(qp1);
1296 if (qp1->div->n_row < qp2->div->n_row)
1297 return isl_qpolynomial_add(qp2, qp1);
1299 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1300 if (!compatible_divs(qp1->div, qp2->div))
1301 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1303 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1307 isl_qpolynomial_free(qp2);
1311 isl_qpolynomial_free(qp1);
1312 isl_qpolynomial_free(qp2);
1316 __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain(
1317 __isl_keep isl_set *dom,
1318 __isl_take isl_qpolynomial *qp1,
1319 __isl_take isl_qpolynomial *qp2)
1321 return isl_qpolynomial_add(qp1, qp2);
1324 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1325 __isl_take isl_qpolynomial *qp2)
1327 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1330 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1332 qp = isl_qpolynomial_cow(qp);
1337 qp->upoly = isl_upoly_neg(qp->upoly);
1343 isl_qpolynomial_free(qp);
1347 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1348 __isl_take isl_qpolynomial *qp2)
1350 qp1 = isl_qpolynomial_cow(qp1);
1355 if (qp1->div->n_row < qp2->div->n_row)
1356 return isl_qpolynomial_mul(qp2, qp1);
1358 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1359 if (!compatible_divs(qp1->div, qp2->div))
1360 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1362 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1366 isl_qpolynomial_free(qp2);
1370 isl_qpolynomial_free(qp1);
1371 isl_qpolynomial_free(qp2);
1375 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1377 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1380 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1382 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1385 __isl_give isl_qpolynomial *isl_qpolynomial_neginfty(__isl_take isl_dim *dim)
1387 return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx));
1390 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1392 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1395 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1398 struct isl_qpolynomial *qp;
1399 struct isl_upoly_cst *cst;
1401 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1405 cst = isl_upoly_as_cst(qp->upoly);
1406 isl_int_set(cst->n, v);
1411 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1412 isl_int *n, isl_int *d)
1414 struct isl_upoly_cst *cst;
1419 if (!isl_upoly_is_cst(qp->upoly))
1422 cst = isl_upoly_as_cst(qp->upoly);
1427 isl_int_set(*n, cst->n);
1429 isl_int_set(*d, cst->d);
1434 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1437 struct isl_upoly_rec *rec;
1445 rec = isl_upoly_as_rec(up);
1452 isl_assert(up->ctx, rec->n > 1, return -1);
1454 is_cst = isl_upoly_is_cst(rec->p[1]);
1460 return isl_upoly_is_affine(rec->p[0]);
1463 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1468 if (qp->div->n_row > 0)
1471 return isl_upoly_is_affine(qp->upoly);
1474 static void update_coeff(__isl_keep isl_vec *aff,
1475 __isl_keep struct isl_upoly_cst *cst, int pos)
1480 if (isl_int_is_zero(cst->n))
1485 isl_int_gcd(gcd, cst->d, aff->el[0]);
1486 isl_int_divexact(f, cst->d, gcd);
1487 isl_int_divexact(gcd, aff->el[0], gcd);
1488 isl_seq_scale(aff->el, aff->el, f, aff->size);
1489 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1494 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1495 __isl_keep isl_vec *aff)
1497 struct isl_upoly_cst *cst;
1498 struct isl_upoly_rec *rec;
1504 struct isl_upoly_cst *cst;
1506 cst = isl_upoly_as_cst(up);
1509 update_coeff(aff, cst, 0);
1513 rec = isl_upoly_as_rec(up);
1516 isl_assert(up->ctx, rec->n == 2, return -1);
1518 cst = isl_upoly_as_cst(rec->p[1]);
1521 update_coeff(aff, cst, 1 + up->var);
1523 return isl_upoly_update_affine(rec->p[0], aff);
1526 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1527 __isl_keep isl_qpolynomial *qp)
1535 isl_assert(qp->div->ctx, qp->div->n_row == 0, return NULL);
1536 d = isl_dim_total(qp->dim);
1537 aff = isl_vec_alloc(qp->div->ctx, 2 + d);
1541 isl_seq_clr(aff->el + 1, 1 + d);
1542 isl_int_set_si(aff->el[0], 1);
1544 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1553 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1554 __isl_keep isl_qpolynomial *qp2)
1559 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1562 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1565 struct isl_upoly_rec *rec;
1567 if (isl_upoly_is_cst(up)) {
1568 struct isl_upoly_cst *cst;
1569 cst = isl_upoly_as_cst(up);
1572 isl_int_lcm(*d, *d, cst->d);
1576 rec = isl_upoly_as_rec(up);
1580 for (i = 0; i < rec->n; ++i)
1581 upoly_update_den(rec->p[i], d);
1584 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1586 isl_int_set_si(*d, 1);
1589 upoly_update_den(qp->upoly, d);
1592 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1595 struct isl_ctx *ctx;
1602 return isl_qpolynomial_alloc(dim, 0, isl_upoly_pow(ctx, pos, power));
1605 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1606 enum isl_dim_type type, unsigned pos)
1611 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1612 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1614 if (type == isl_dim_set)
1615 pos += isl_dim_size(dim, isl_dim_param);
1617 return isl_qpolynomial_pow(dim, pos, 1);
1623 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1626 struct isl_qpolynomial *qp = NULL;
1627 struct isl_upoly_rec *rec;
1628 struct isl_upoly_cst *cst;
1634 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1636 pos = isl_dim_total(div->bmap->dim);
1637 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
1638 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1,
1643 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1644 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1646 for (i = 0; i < 1 + power; ++i) {
1647 rec->p[i] = isl_upoly_zero(div->ctx);
1652 cst = isl_upoly_as_cst(rec->p[power]);
1653 isl_int_set_si(cst->n, 1);
1659 isl_qpolynomial_free(qp);
1664 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1666 return isl_qpolynomial_div_pow(div, 1);
1669 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1670 const isl_int n, const isl_int d)
1672 struct isl_qpolynomial *qp;
1673 struct isl_upoly_cst *cst;
1675 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1679 cst = isl_upoly_as_cst(qp->upoly);
1680 isl_int_set(cst->n, n);
1681 isl_int_set(cst->d, d);
1686 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1688 struct isl_upoly_rec *rec;
1694 if (isl_upoly_is_cst(up))
1698 active[up->var] = 1;
1700 rec = isl_upoly_as_rec(up);
1701 for (i = 0; i < rec->n; ++i)
1702 if (up_set_active(rec->p[i], active, d) < 0)
1708 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1711 int d = isl_dim_total(qp->dim);
1716 for (i = 0; i < d; ++i)
1717 for (j = 0; j < qp->div->n_row; ++j) {
1718 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1724 return up_set_active(qp->upoly, active, d);
1727 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1728 enum isl_dim_type type, unsigned first, unsigned n)
1739 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1741 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1742 type == isl_dim_set, return -1);
1744 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1745 if (set_active(qp, active) < 0)
1748 if (type == isl_dim_set)
1749 first += isl_dim_size(qp->dim, isl_dim_param);
1750 for (i = 0; i < n; ++i)
1751 if (active[first + i]) {
1764 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1765 unsigned first, unsigned n)
1768 struct isl_upoly_rec *rec;
1772 if (n == 0 || up->var < 0 || up->var < first)
1774 if (up->var < first + n) {
1775 up = replace_by_constant_term(up);
1776 return isl_upoly_drop(up, first, n);
1778 up = isl_upoly_cow(up);
1782 rec = isl_upoly_as_rec(up);
1786 for (i = 0; i < rec->n; ++i) {
1787 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1798 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1799 __isl_take isl_qpolynomial *qp,
1800 enum isl_dim_type type, unsigned first, unsigned n)
1804 if (n == 0 && !isl_dim_get_tuple_name(qp->dim, type))
1807 qp = isl_qpolynomial_cow(qp);
1811 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1813 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1814 type == isl_dim_set, goto error);
1816 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1820 if (type == isl_dim_set)
1821 first += isl_dim_size(qp->dim, isl_dim_param);
1823 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1827 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1833 isl_qpolynomial_free(qp);
1837 __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up,
1838 unsigned first, unsigned n, __isl_keep struct isl_upoly **subs)
1841 struct isl_upoly_rec *rec;
1842 struct isl_upoly *base, *res;
1847 if (isl_upoly_is_cst(up))
1850 if (up->var < first)
1853 rec = isl_upoly_as_rec(up);
1857 isl_assert(up->ctx, rec->n >= 1, goto error);
1859 if (up->var >= first + n)
1860 base = isl_upoly_pow(up->ctx, up->var, 1);
1862 base = isl_upoly_copy(subs[up->var - first]);
1864 res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs);
1865 for (i = rec->n - 2; i >= 0; --i) {
1866 struct isl_upoly *t;
1867 t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs);
1868 res = isl_upoly_mul(res, isl_upoly_copy(base));
1869 res = isl_upoly_sum(res, t);
1872 isl_upoly_free(base);
1881 __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f,
1882 isl_int denom, unsigned len)
1885 struct isl_upoly *up;
1887 isl_assert(ctx, len >= 1, return NULL);
1889 up = isl_upoly_rat_cst(ctx, f[0], denom);
1890 for (i = 0; i < len - 1; ++i) {
1891 struct isl_upoly *t;
1892 struct isl_upoly *c;
1894 if (isl_int_is_zero(f[1 + i]))
1897 c = isl_upoly_rat_cst(ctx, f[1 + i], denom);
1898 t = isl_upoly_pow(ctx, i, 1);
1899 t = isl_upoly_mul(c, t);
1900 up = isl_upoly_sum(up, t);
1906 __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities(
1907 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
1912 struct isl_upoly *up;
1916 if (eq->n_eq == 0) {
1917 isl_basic_set_free(eq);
1921 qp = isl_qpolynomial_cow(qp);
1924 qp->div = isl_mat_cow(qp->div);
1928 total = 1 + isl_dim_total(eq->dim);
1929 isl_int_init(denom);
1930 for (i = 0; i < eq->n_eq; ++i) {
1931 j = isl_seq_last_non_zero(eq->eq[i], total);
1932 if (j < 0 || j == 0)
1935 for (k = 0; k < qp->div->n_row; ++k) {
1936 if (isl_int_is_zero(qp->div->row[k][1 + j]))
1938 isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total,
1939 &qp->div->row[k][0]);
1940 isl_seq_normalize(qp->div->ctx,
1941 qp->div->row[k], 1 + total);
1944 if (isl_int_is_pos(eq->eq[i][j]))
1945 isl_seq_neg(eq->eq[i], eq->eq[i], total);
1946 isl_int_abs(denom, eq->eq[i][j]);
1947 isl_int_set_si(eq->eq[i][j], 0);
1949 up = isl_upoly_from_affine(qp->dim->ctx,
1950 eq->eq[i], denom, total);
1951 qp->upoly = isl_upoly_subs(qp->upoly, j - 1, 1, &up);
1954 isl_int_clear(denom);
1959 isl_basic_set_free(eq);
1965 isl_basic_set_free(eq);
1966 isl_qpolynomial_free(qp);
1971 #define PW isl_pw_qpolynomial
1973 #define EL isl_qpolynomial
1975 #define IS_ZERO is_zero
1979 #include <isl_pw_templ.c>
1982 #define UNION isl_union_pw_qpolynomial
1984 #define PART isl_pw_qpolynomial
1986 #define PARTS pw_qpolynomial
1988 #include <isl_union_templ.c>
1990 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
1998 if (!isl_set_fast_is_universe(pwqp->p[0].set))
2001 return isl_qpolynomial_is_one(pwqp->p[0].qp);
2004 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
2005 __isl_take isl_pw_qpolynomial *pwqp1,
2006 __isl_take isl_pw_qpolynomial *pwqp2)
2009 struct isl_pw_qpolynomial *res;
2012 if (!pwqp1 || !pwqp2)
2015 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
2018 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
2019 isl_pw_qpolynomial_free(pwqp2);
2023 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
2024 isl_pw_qpolynomial_free(pwqp1);
2028 if (isl_pw_qpolynomial_is_one(pwqp1)) {
2029 isl_pw_qpolynomial_free(pwqp1);
2033 if (isl_pw_qpolynomial_is_one(pwqp2)) {
2034 isl_pw_qpolynomial_free(pwqp2);
2038 n = pwqp1->n * pwqp2->n;
2039 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
2041 for (i = 0; i < pwqp1->n; ++i) {
2042 for (j = 0; j < pwqp2->n; ++j) {
2043 struct isl_set *common;
2044 struct isl_qpolynomial *prod;
2045 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
2046 isl_set_copy(pwqp2->p[j].set));
2047 if (isl_set_fast_is_empty(common)) {
2048 isl_set_free(common);
2052 prod = isl_qpolynomial_mul(
2053 isl_qpolynomial_copy(pwqp1->p[i].qp),
2054 isl_qpolynomial_copy(pwqp2->p[j].qp));
2056 res = isl_pw_qpolynomial_add_piece(res, common, prod);
2060 isl_pw_qpolynomial_free(pwqp1);
2061 isl_pw_qpolynomial_free(pwqp2);
2065 isl_pw_qpolynomial_free(pwqp1);
2066 isl_pw_qpolynomial_free(pwqp2);
2070 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
2071 __isl_take isl_pw_qpolynomial *pwqp)
2078 if (isl_pw_qpolynomial_is_zero(pwqp))
2081 pwqp = isl_pw_qpolynomial_cow(pwqp);
2085 for (i = 0; i < pwqp->n; ++i) {
2086 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
2093 isl_pw_qpolynomial_free(pwqp);
2097 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
2098 __isl_take isl_pw_qpolynomial *pwqp1,
2099 __isl_take isl_pw_qpolynomial *pwqp2)
2101 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
2104 __isl_give struct isl_upoly *isl_upoly_eval(
2105 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
2108 struct isl_upoly_rec *rec;
2109 struct isl_upoly *res;
2110 struct isl_upoly *base;
2112 if (isl_upoly_is_cst(up)) {
2117 rec = isl_upoly_as_rec(up);
2121 isl_assert(up->ctx, rec->n >= 1, goto error);
2123 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
2125 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
2128 for (i = rec->n - 2; i >= 0; --i) {
2129 res = isl_upoly_mul(res, isl_upoly_copy(base));
2130 res = isl_upoly_sum(res,
2131 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
2132 isl_vec_copy(vec)));
2135 isl_upoly_free(base);
2145 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
2146 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
2149 struct isl_upoly *up;
2154 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
2156 if (qp->div->n_row == 0)
2157 ext = isl_vec_copy(pnt->vec);
2160 unsigned dim = isl_dim_total(qp->dim);
2161 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
2165 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
2166 for (i = 0; i < qp->div->n_row; ++i) {
2167 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
2168 1 + dim + i, &ext->el[1+dim+i]);
2169 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
2170 qp->div->row[i][0]);
2174 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
2178 dim = isl_dim_copy(qp->dim);
2179 isl_qpolynomial_free(qp);
2180 isl_point_free(pnt);
2182 return isl_qpolynomial_alloc(dim, 0, up);
2184 isl_qpolynomial_free(qp);
2185 isl_point_free(pnt);
2189 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
2190 __isl_keep struct isl_upoly_cst *cst2)
2195 isl_int_mul(t, cst1->n, cst2->d);
2196 isl_int_submul(t, cst2->n, cst1->d);
2197 cmp = isl_int_sgn(t);
2202 int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1,
2203 __isl_keep isl_qpolynomial *qp2)
2205 struct isl_upoly_cst *cst1, *cst2;
2209 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), return -1);
2210 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), return -1);
2211 if (isl_qpolynomial_is_nan(qp1))
2213 if (isl_qpolynomial_is_nan(qp2))
2215 cst1 = isl_upoly_as_cst(qp1->upoly);
2216 cst2 = isl_upoly_as_cst(qp2->upoly);
2218 return isl_upoly_cmp(cst1, cst2) <= 0;
2221 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
2222 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2224 struct isl_upoly_cst *cst1, *cst2;
2229 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2230 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2231 cst1 = isl_upoly_as_cst(qp1->upoly);
2232 cst2 = isl_upoly_as_cst(qp2->upoly);
2233 cmp = isl_upoly_cmp(cst1, cst2);
2236 isl_qpolynomial_free(qp2);
2238 isl_qpolynomial_free(qp1);
2243 isl_qpolynomial_free(qp1);
2244 isl_qpolynomial_free(qp2);
2248 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
2249 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2251 struct isl_upoly_cst *cst1, *cst2;
2256 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2257 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2258 cst1 = isl_upoly_as_cst(qp1->upoly);
2259 cst2 = isl_upoly_as_cst(qp2->upoly);
2260 cmp = isl_upoly_cmp(cst1, cst2);
2263 isl_qpolynomial_free(qp2);
2265 isl_qpolynomial_free(qp1);
2270 isl_qpolynomial_free(qp1);
2271 isl_qpolynomial_free(qp2);
2275 __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
2276 __isl_take isl_qpolynomial *qp, enum isl_dim_type type,
2277 unsigned first, unsigned n)
2286 qp = isl_qpolynomial_cow(qp);
2290 isl_assert(qp->div->ctx, first <= isl_dim_size(qp->dim, type),
2293 g_pos = pos(qp->dim, type) + first;
2295 qp->div = isl_mat_insert_cols(qp->div, 2 + g_pos, n);
2299 total = qp->div->n_col - 2;
2300 if (total > g_pos) {
2302 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2305 for (i = 0; i < total - g_pos; ++i)
2307 qp->upoly = expand(qp->upoly, exp, g_pos);
2313 qp->dim = isl_dim_insert(qp->dim, type, first, n);
2319 isl_qpolynomial_free(qp);
2323 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
2324 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2328 pos = isl_qpolynomial_dim(qp, type);
2330 return isl_qpolynomial_insert_dims(qp, type, pos, n);
2333 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2334 __isl_take isl_pw_qpolynomial *pwqp,
2335 enum isl_dim_type type, unsigned n)
2339 pos = isl_pw_qpolynomial_dim(pwqp, type);
2341 return isl_pw_qpolynomial_insert_dims(pwqp, type, pos, n);
2344 static int *reordering_move(isl_ctx *ctx,
2345 unsigned len, unsigned dst, unsigned src, unsigned n)
2350 reordering = isl_alloc_array(ctx, int, len);
2355 for (i = 0; i < dst; ++i)
2357 for (i = 0; i < n; ++i)
2358 reordering[src + i] = dst + i;
2359 for (i = 0; i < src - dst; ++i)
2360 reordering[dst + i] = dst + n + i;
2361 for (i = 0; i < len - src - n; ++i)
2362 reordering[src + n + i] = src + n + i;
2364 for (i = 0; i < src; ++i)
2366 for (i = 0; i < n; ++i)
2367 reordering[src + i] = dst + i;
2368 for (i = 0; i < dst - src; ++i)
2369 reordering[src + n + i] = src + i;
2370 for (i = 0; i < len - dst - n; ++i)
2371 reordering[dst + n + i] = dst + n + i;
2377 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
2378 __isl_take isl_qpolynomial *qp,
2379 enum isl_dim_type dst_type, unsigned dst_pos,
2380 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2386 qp = isl_qpolynomial_cow(qp);
2390 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2393 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2394 g_src_pos = pos(qp->dim, src_type) + src_pos;
2395 if (dst_type > src_type)
2398 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2405 reordering = reordering_move(qp->dim->ctx,
2406 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2410 qp->upoly = reorder(qp->upoly, reordering);
2415 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2421 isl_qpolynomial_free(qp);
2425 __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_dim *dim,
2426 isl_int *f, isl_int denom)
2428 struct isl_upoly *up;
2433 up = isl_upoly_from_affine(dim->ctx, f, denom, 1 + isl_dim_total(dim));
2435 return isl_qpolynomial_alloc(dim, 0, up);
2438 __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
2439 __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
2443 struct isl_upoly *up;
2444 isl_qpolynomial *qp;
2450 isl_int_init(denom);
2452 isl_constraint_get_coefficient(c, type, pos, &denom);
2453 isl_constraint_set_coefficient(c, type, pos, c->ctx->zero);
2454 sgn = isl_int_sgn(denom);
2455 isl_int_abs(denom, denom);
2456 up = isl_upoly_from_affine(c->ctx, c->line[0], denom,
2457 1 + isl_constraint_dim(c, isl_dim_all));
2459 isl_int_neg(denom, denom);
2460 isl_constraint_set_coefficient(c, type, pos, denom);
2462 dim = isl_dim_copy(c->bmap->dim);
2464 isl_int_clear(denom);
2465 isl_constraint_free(c);
2467 qp = isl_qpolynomial_alloc(dim, 0, up);
2469 qp = isl_qpolynomial_neg(qp);
2473 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
2474 * in "qp" by subs[i].
2476 __isl_give isl_qpolynomial *isl_qpolynomial_substitute(
2477 __isl_take isl_qpolynomial *qp,
2478 enum isl_dim_type type, unsigned first, unsigned n,
2479 __isl_keep isl_qpolynomial **subs)
2482 struct isl_upoly **ups;
2487 qp = isl_qpolynomial_cow(qp);
2490 for (i = 0; i < n; ++i)
2494 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2497 for (i = 0; i < n; ++i)
2498 isl_assert(qp->dim->ctx, isl_dim_equal(qp->dim, subs[i]->dim),
2501 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
2502 for (i = 0; i < n; ++i)
2503 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
2505 first += pos(qp->dim, type);
2507 ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n);
2510 for (i = 0; i < n; ++i)
2511 ups[i] = subs[i]->upoly;
2513 qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups);
2522 isl_qpolynomial_free(qp);
2526 __isl_give isl_basic_set *add_div_constraints(__isl_take isl_basic_set *bset,
2527 __isl_take isl_mat *div)
2535 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2538 total = isl_basic_set_total_dim(bset);
2539 for (i = 0; i < div->n_row; ++i)
2540 if (isl_basic_set_add_div_constraints_var(bset,
2541 total - div->n_row + i, div->row[i]) < 0)
2548 isl_basic_set_free(bset);
2552 /* Extend "bset" with extra set dimensions for each integer division
2553 * in "qp" and then call "fn" with the extended bset and the polynomial
2554 * that results from replacing each of the integer divisions by the
2555 * corresponding extra set dimension.
2557 int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
2558 __isl_keep isl_basic_set *bset,
2559 int (*fn)(__isl_take isl_basic_set *bset,
2560 __isl_take isl_qpolynomial *poly, void *user), void *user)
2564 isl_qpolynomial *poly;
2568 if (qp->div->n_row == 0)
2569 return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
2572 div = isl_mat_copy(qp->div);
2573 dim = isl_dim_copy(qp->dim);
2574 dim = isl_dim_add(dim, isl_dim_set, qp->div->n_row);
2575 poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly));
2576 bset = isl_basic_set_copy(bset);
2577 bset = isl_basic_set_add(bset, isl_dim_set, qp->div->n_row);
2578 bset = add_div_constraints(bset, div);
2580 return fn(bset, poly, user);
2585 /* Return total degree in variables first (inclusive) up to last (exclusive).
2587 int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last)
2591 struct isl_upoly_rec *rec;
2595 if (isl_upoly_is_zero(up))
2597 if (isl_upoly_is_cst(up) || up->var < first)
2600 rec = isl_upoly_as_rec(up);
2604 for (i = 0; i < rec->n; ++i) {
2607 if (isl_upoly_is_zero(rec->p[i]))
2609 d = isl_upoly_degree(rec->p[i], first, last);
2619 /* Return total degree in set variables.
2621 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
2629 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2630 nvar = isl_dim_size(poly->dim, isl_dim_set);
2631 return isl_upoly_degree(poly->upoly, ovar, ovar + nvar);
2634 __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up,
2635 unsigned pos, int deg)
2638 struct isl_upoly_rec *rec;
2643 if (isl_upoly_is_cst(up) || up->var < pos) {
2645 return isl_upoly_copy(up);
2647 return isl_upoly_zero(up->ctx);
2650 rec = isl_upoly_as_rec(up);
2654 if (up->var == pos) {
2656 return isl_upoly_copy(rec->p[deg]);
2658 return isl_upoly_zero(up->ctx);
2661 up = isl_upoly_copy(up);
2662 up = isl_upoly_cow(up);
2663 rec = isl_upoly_as_rec(up);
2667 for (i = 0; i < rec->n; ++i) {
2668 struct isl_upoly *t;
2669 t = isl_upoly_coeff(rec->p[i], pos, deg);
2672 isl_upoly_free(rec->p[i]);
2682 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
2684 __isl_give isl_qpolynomial *isl_qpolynomial_coeff(
2685 __isl_keep isl_qpolynomial *qp,
2686 enum isl_dim_type type, unsigned t_pos, int deg)
2689 struct isl_upoly *up;
2695 isl_assert(qp->div->ctx, t_pos < isl_dim_size(qp->dim, type),
2698 g_pos = pos(qp->dim, type) + t_pos;
2699 up = isl_upoly_coeff(qp->upoly, g_pos, deg);
2701 c = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row, up);
2704 isl_mat_free(c->div);
2705 c->div = isl_mat_copy(qp->div);
2710 isl_qpolynomial_free(c);
2714 /* Homogenize the polynomial in the variables first (inclusive) up to
2715 * last (exclusive) by inserting powers of variable first.
2716 * Variable first is assumed not to appear in the input.
2718 __isl_give struct isl_upoly *isl_upoly_homogenize(
2719 __isl_take struct isl_upoly *up, int deg, int target,
2720 int first, int last)
2723 struct isl_upoly_rec *rec;
2727 if (isl_upoly_is_zero(up))
2731 if (isl_upoly_is_cst(up) || up->var < first) {
2732 struct isl_upoly *hom;
2734 hom = isl_upoly_pow(up->ctx, first, target - deg);
2737 rec = isl_upoly_as_rec(hom);
2738 rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up);
2743 up = isl_upoly_cow(up);
2744 rec = isl_upoly_as_rec(up);
2748 for (i = 0; i < rec->n; ++i) {
2749 if (isl_upoly_is_zero(rec->p[i]))
2751 rec->p[i] = isl_upoly_homogenize(rec->p[i],
2752 up->var < last ? deg + i : i, target,
2764 /* Homogenize the polynomial in the set variables by introducing
2765 * powers of an extra set variable at position 0.
2767 __isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
2768 __isl_take isl_qpolynomial *poly)
2772 int deg = isl_qpolynomial_degree(poly);
2777 poly = isl_qpolynomial_insert_dims(poly, isl_dim_set, 0, 1);
2778 poly = isl_qpolynomial_cow(poly);
2782 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2783 nvar = isl_dim_size(poly->dim, isl_dim_set);
2784 poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg,
2791 isl_qpolynomial_free(poly);
2795 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2796 __isl_take isl_mat *div)
2804 n = isl_dim_total(dim) + div->n_row;
2806 term = isl_calloc(dim->ctx, struct isl_term,
2807 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2814 isl_int_init(term->n);
2815 isl_int_init(term->d);
2824 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
2833 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
2842 total = isl_dim_total(term->dim) + term->div->n_row;
2844 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
2848 isl_int_set(dup->n, term->n);
2849 isl_int_set(dup->d, term->d);
2851 for (i = 0; i < total; ++i)
2852 dup->pow[i] = term->pow[i];
2857 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
2865 return isl_term_dup(term);
2868 void isl_term_free(__isl_take isl_term *term)
2873 if (--term->ref > 0)
2876 isl_dim_free(term->dim);
2877 isl_mat_free(term->div);
2878 isl_int_clear(term->n);
2879 isl_int_clear(term->d);
2883 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
2891 case isl_dim_out: return isl_dim_size(term->dim, type);
2892 case isl_dim_div: return term->div->n_row;
2893 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
2898 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
2900 return term ? term->dim->ctx : NULL;
2903 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
2907 isl_int_set(*n, term->n);
2910 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
2914 isl_int_set(*d, term->d);
2917 int isl_term_get_exp(__isl_keep isl_term *term,
2918 enum isl_dim_type type, unsigned pos)
2923 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
2925 if (type >= isl_dim_set)
2926 pos += isl_dim_size(term->dim, isl_dim_param);
2927 if (type >= isl_dim_div)
2928 pos += isl_dim_size(term->dim, isl_dim_set);
2930 return term->pow[pos];
2933 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
2935 isl_basic_map *bmap;
2942 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
2945 total = term->div->n_col - term->div->n_row - 2;
2946 /* No nested divs for now */
2947 isl_assert(term->dim->ctx,
2948 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
2949 term->div->n_row) == -1,
2952 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
2953 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
2956 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
2958 return isl_basic_map_div(bmap, k);
2960 isl_basic_map_free(bmap);
2964 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
2965 int (*fn)(__isl_take isl_term *term, void *user),
2966 __isl_take isl_term *term, void *user)
2969 struct isl_upoly_rec *rec;
2974 if (isl_upoly_is_zero(up))
2977 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
2978 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
2979 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
2981 if (isl_upoly_is_cst(up)) {
2982 struct isl_upoly_cst *cst;
2983 cst = isl_upoly_as_cst(up);
2986 term = isl_term_cow(term);
2989 isl_int_set(term->n, cst->n);
2990 isl_int_set(term->d, cst->d);
2991 if (fn(isl_term_copy(term), user) < 0)
2996 rec = isl_upoly_as_rec(up);
3000 for (i = 0; i < rec->n; ++i) {
3001 term = isl_term_cow(term);
3004 term->pow[up->var] = i;
3005 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
3009 term->pow[up->var] = 0;
3013 isl_term_free(term);
3017 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
3018 int (*fn)(__isl_take isl_term *term, void *user), void *user)
3025 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
3029 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
3031 isl_term_free(term);
3033 return term ? 0 : -1;
3036 __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
3038 struct isl_upoly *up;
3039 isl_qpolynomial *qp;
3045 n = isl_dim_total(term->dim) + term->div->n_row;
3047 up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d);
3048 for (i = 0; i < n; ++i) {
3051 up = isl_upoly_mul(up,
3052 isl_upoly_pow(term->dim->ctx, i, term->pow[i]));
3055 qp = isl_qpolynomial_alloc(isl_dim_copy(term->dim), term->div->n_row, up);
3058 isl_mat_free(qp->div);
3059 qp->div = isl_mat_copy(term->div);
3063 isl_term_free(term);
3066 isl_qpolynomial_free(qp);
3067 isl_term_free(term);
3071 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
3072 __isl_take isl_dim *dim)
3081 if (isl_dim_equal(qp->dim, dim)) {
3086 qp = isl_qpolynomial_cow(qp);
3090 extra = isl_dim_size(dim, isl_dim_set) -
3091 isl_dim_size(qp->dim, isl_dim_set);
3092 total = isl_dim_total(qp->dim);
3093 if (qp->div->n_row) {
3096 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
3099 for (i = 0; i < qp->div->n_row; ++i)
3101 qp->upoly = expand(qp->upoly, exp, total);
3106 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
3109 for (i = 0; i < qp->div->n_row; ++i)
3110 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
3112 isl_dim_free(qp->dim);
3118 isl_qpolynomial_free(qp);
3122 /* For each parameter or variable that does not appear in qp,
3123 * first eliminate the variable from all constraints and then set it to zero.
3125 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
3126 __isl_keep isl_qpolynomial *qp)
3137 d = isl_dim_total(set->dim);
3138 active = isl_calloc_array(set->ctx, int, d);
3139 if (set_active(qp, active) < 0)
3142 for (i = 0; i < d; ++i)
3151 nparam = isl_dim_size(set->dim, isl_dim_param);
3152 nvar = isl_dim_size(set->dim, isl_dim_set);
3153 for (i = 0; i < nparam; ++i) {
3156 set = isl_set_eliminate(set, isl_dim_param, i, 1);
3157 set = isl_set_fix_si(set, isl_dim_param, i, 0);
3159 for (i = 0; i < nvar; ++i) {
3160 if (active[nparam + i])
3162 set = isl_set_eliminate(set, isl_dim_set, i, 1);
3163 set = isl_set_fix_si(set, isl_dim_set, i, 0);
3175 struct isl_opt_data {
3176 isl_qpolynomial *qp;
3178 isl_qpolynomial *opt;
3182 static int opt_fn(__isl_take isl_point *pnt, void *user)
3184 struct isl_opt_data *data = (struct isl_opt_data *)user;
3185 isl_qpolynomial *val;
3187 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
3191 } else if (data->max) {
3192 data->opt = isl_qpolynomial_max_cst(data->opt, val);
3194 data->opt = isl_qpolynomial_min_cst(data->opt, val);
3200 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
3201 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
3203 struct isl_opt_data data = { NULL, 1, NULL, max };
3208 if (isl_upoly_is_cst(qp->upoly)) {
3213 set = fix_inactive(set, qp);
3216 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
3220 data.opt = isl_qpolynomial_zero(isl_qpolynomial_get_dim(qp));
3223 isl_qpolynomial_free(qp);
3227 isl_qpolynomial_free(qp);
3228 isl_qpolynomial_free(data.opt);
3232 __isl_give isl_qpolynomial *isl_qpolynomial_morph(__isl_take isl_qpolynomial *qp,
3233 __isl_take isl_morph *morph)
3237 struct isl_upoly *up;
3239 struct isl_upoly **subs;
3242 qp = isl_qpolynomial_cow(qp);
3247 isl_assert(ctx, isl_dim_equal(qp->dim, morph->dom->dim), goto error);
3249 subs = isl_calloc_array(ctx, struct isl_upoly *, morph->inv->n_row - 1);
3253 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3254 subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i],
3255 morph->inv->row[0][0], morph->inv->n_col);
3257 qp->upoly = isl_upoly_subs(qp->upoly, 0, morph->inv->n_row - 1, subs);
3259 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3260 isl_upoly_free(subs[i]);
3263 mat = isl_mat_diagonal(isl_mat_identity(ctx, 1), isl_mat_copy(morph->inv));
3264 mat = isl_mat_diagonal(mat, isl_mat_identity(ctx, qp->div->n_row));
3265 qp->div = isl_mat_product(qp->div, mat);
3266 isl_dim_free(qp->dim);
3267 qp->dim = isl_dim_copy(morph->ran->dim);
3269 if (!qp->upoly || !qp->div || !qp->dim)
3272 isl_morph_free(morph);
3276 isl_qpolynomial_free(qp);
3277 isl_morph_free(morph);
3281 static int neg_entry(void **entry, void *user)
3283 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
3285 *pwqp = isl_pw_qpolynomial_neg(*pwqp);
3287 return *pwqp ? 0 : -1;
3290 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_neg(
3291 __isl_take isl_union_pw_qpolynomial *upwqp)
3293 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
3297 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
3298 &neg_entry, NULL) < 0)
3303 isl_union_pw_qpolynomial_free(upwqp);
3307 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_sub(
3308 __isl_take isl_union_pw_qpolynomial *upwqp1,
3309 __isl_take isl_union_pw_qpolynomial *upwqp2)
3311 return isl_union_pw_qpolynomial_add(upwqp1,
3312 isl_union_pw_qpolynomial_neg(upwqp2));
3315 static int mul_entry(void **entry, void *user)
3317 struct isl_union_pw_qpolynomial_match_bin_data *data = user;
3319 struct isl_hash_table_entry *entry2;
3320 isl_pw_qpolynomial *pwpq = *entry;
3323 hash = isl_dim_get_hash(pwpq->dim);
3324 entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table,
3325 hash, &has_dim, pwpq->dim, 0);
3329 pwpq = isl_pw_qpolynomial_copy(pwpq);
3330 pwpq = isl_pw_qpolynomial_mul(pwpq,
3331 isl_pw_qpolynomial_copy(entry2->data));
3333 empty = isl_pw_qpolynomial_is_zero(pwpq);
3335 isl_pw_qpolynomial_free(pwpq);
3339 isl_pw_qpolynomial_free(pwpq);
3343 data->res = isl_union_pw_qpolynomial_add_pw_qpolynomial(data->res, pwpq);
3348 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
3349 __isl_take isl_union_pw_qpolynomial *upwqp1,
3350 __isl_take isl_union_pw_qpolynomial *upwqp2)
3352 return match_bin_op(upwqp1, upwqp2, &mul_entry);
3355 /* Reorder the columns of the given div definitions according to the
3358 static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div,
3359 __isl_take isl_reordering *r)
3368 extra = isl_dim_total(r->dim) + div->n_row - r->len;
3369 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
3373 for (i = 0; i < div->n_row; ++i) {
3374 isl_seq_cpy(mat->row[i], div->row[i], 2);
3375 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2);
3376 for (j = 0; j < r->len; ++j)
3377 isl_int_set(mat->row[i][2 + r->pos[j]],
3378 div->row[i][2 + j]);
3381 isl_reordering_free(r);
3385 isl_reordering_free(r);
3390 /* Reorder the dimension of "qp" according to the given reordering.
3392 __isl_give isl_qpolynomial *isl_qpolynomial_realign(
3393 __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r)
3395 qp = isl_qpolynomial_cow(qp);
3399 r = isl_reordering_extend(r, qp->div->n_row);
3403 qp->div = reorder_divs(qp->div, isl_reordering_copy(r));
3407 qp->upoly = reorder(qp->upoly, r->pos);
3411 qp = isl_qpolynomial_reset_dim(qp, isl_dim_copy(r->dim));
3413 isl_reordering_free(r);
3416 isl_qpolynomial_free(qp);
3417 isl_reordering_free(r);
3421 struct isl_split_periods_data {
3423 isl_pw_qpolynomial *res;
3426 /* Create a slice where the integer division "div" has the fixed value "v".
3427 * In particular, if "div" refers to floor(f/m), then create a slice
3429 * m v <= f <= m v + (m - 1)
3434 * -f + m v + (m - 1) >= 0
3436 static __isl_give isl_set *set_div_slice(__isl_take isl_dim *dim,
3437 __isl_keep isl_qpolynomial *qp, int div, isl_int v)
3440 isl_basic_set *bset = NULL;
3446 total = isl_dim_total(dim);
3447 bset = isl_basic_set_alloc_dim(isl_dim_copy(dim), 0, 0, 2);
3449 k = isl_basic_set_alloc_inequality(bset);
3452 isl_seq_cpy(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3453 isl_int_submul(bset->ineq[k][0], v, qp->div->row[div][0]);
3455 k = isl_basic_set_alloc_inequality(bset);
3458 isl_seq_neg(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3459 isl_int_addmul(bset->ineq[k][0], v, qp->div->row[div][0]);
3460 isl_int_add(bset->ineq[k][0], bset->ineq[k][0], qp->div->row[div][0]);
3461 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
3464 return isl_set_from_basic_set(bset);
3466 isl_basic_set_free(bset);
3471 static int split_periods(__isl_take isl_set *set,
3472 __isl_take isl_qpolynomial *qp, void *user);
3474 /* Create a slice of the domain "set" such that integer division "div"
3475 * has the fixed value "v" and add the results to data->res,
3476 * replacing the integer division by "v" in "qp".
3478 static int set_div(__isl_take isl_set *set,
3479 __isl_take isl_qpolynomial *qp, int div, isl_int v,
3480 struct isl_split_periods_data *data)
3485 struct isl_upoly *cst;
3488 slice = set_div_slice(isl_set_get_dim(set), qp, div, v);
3489 set = isl_set_intersect(set, slice);
3491 qp = isl_qpolynomial_cow(qp);
3495 cst = isl_upoly_rat_cst(qp->dim->ctx, v, qp->dim->ctx->one);
3498 total = isl_dim_total(qp->dim);
3499 qp->upoly = isl_upoly_subs(qp->upoly, total + div, 1, &cst);
3500 isl_upoly_free(cst);
3504 reordering = isl_alloc_array(qp->dim->ctx, int, total + qp->div->n_row);
3507 for (i = 0; i < total + div; ++i)
3509 for (i = total + div + 1; i < total + qp->div->n_row; ++i)
3510 reordering[i] = i - 1;
3511 qp->div = isl_mat_drop_rows(qp->div, div, 1);
3512 qp->div = isl_mat_drop_cols(qp->div, 2 + total + div, 1);
3513 qp->upoly = reorder(qp->upoly, reordering);
3516 if (!qp->upoly || !qp->div)
3519 return split_periods(set, qp, data);
3522 isl_qpolynomial_free(qp);
3526 /* Split the domain "set" such that integer division "div"
3527 * has a fixed value (ranging from "min" to "max") on each slice
3528 * and add the results to data->res.
3530 static int split_div(__isl_take isl_set *set,
3531 __isl_take isl_qpolynomial *qp, int div, isl_int min, isl_int max,
3532 struct isl_split_periods_data *data)
3534 for (; isl_int_le(min, max); isl_int_add_ui(min, min, 1)) {
3535 isl_set *set_i = isl_set_copy(set);
3536 isl_qpolynomial *qp_i = isl_qpolynomial_copy(qp);
3538 if (set_div(set_i, qp_i, div, min, data) < 0)
3542 isl_qpolynomial_free(qp);
3546 isl_qpolynomial_free(qp);
3550 /* If "qp" refers to any integer division
3551 * that can only attain "max_periods" distinct values on "set"
3552 * then split the domain along those distinct values.
3553 * Add the results (or the original if no splitting occurs)
3556 static int split_periods(__isl_take isl_set *set,
3557 __isl_take isl_qpolynomial *qp, void *user)
3560 isl_pw_qpolynomial *pwqp;
3561 struct isl_split_periods_data *data;
3566 data = (struct isl_split_periods_data *)user;
3571 if (qp->div->n_row == 0) {
3572 pwqp = isl_pw_qpolynomial_alloc(set, qp);
3573 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
3579 total = isl_dim_total(qp->dim);
3580 for (i = 0; i < qp->div->n_row; ++i) {
3581 enum isl_lp_result lp_res;
3583 if (isl_seq_first_non_zero(qp->div->row[i] + 2 + total,
3584 qp->div->n_row) != -1)
3587 lp_res = isl_set_solve_lp(set, 0, qp->div->row[i] + 1,
3588 set->ctx->one, &min, NULL, NULL);
3589 if (lp_res == isl_lp_error)
3591 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
3593 isl_int_fdiv_q(min, min, qp->div->row[i][0]);
3595 lp_res = isl_set_solve_lp(set, 1, qp->div->row[i] + 1,
3596 set->ctx->one, &max, NULL, NULL);
3597 if (lp_res == isl_lp_error)
3599 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
3601 isl_int_fdiv_q(max, max, qp->div->row[i][0]);
3603 isl_int_sub(max, max, min);
3604 if (isl_int_cmp_si(max, data->max_periods) < 0) {
3605 isl_int_add(max, max, min);
3610 if (i < qp->div->n_row) {
3611 r = split_div(set, qp, i, min, max, data);
3613 pwqp = isl_pw_qpolynomial_alloc(set, qp);
3614 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
3626 isl_qpolynomial_free(qp);
3630 /* If any quasi-polynomial in pwqp refers to any integer division
3631 * that can only attain "max_periods" distinct values on its domain
3632 * then split the domain along those distinct values.
3634 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_periods(
3635 __isl_take isl_pw_qpolynomial *pwqp, int max_periods)
3637 struct isl_split_periods_data data;
3639 data.max_periods = max_periods;
3640 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_dim(pwqp));
3642 if (isl_pw_qpolynomial_foreach_piece(pwqp, &split_periods, &data) < 0)
3645 isl_pw_qpolynomial_free(pwqp);
3649 isl_pw_qpolynomial_free(data.res);
3650 isl_pw_qpolynomial_free(pwqp);