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>
19 #include <isl_mat_private.h>
21 static unsigned pos(__isl_keep isl_dim *dim, enum isl_dim_type type)
24 case isl_dim_param: return 0;
25 case isl_dim_in: return dim->nparam;
26 case isl_dim_out: return dim->nparam + dim->n_in;
31 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
39 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
44 isl_assert(up->ctx, up->var < 0, return NULL);
46 return (struct isl_upoly_cst *)up;
49 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
54 isl_assert(up->ctx, up->var >= 0, return NULL);
56 return (struct isl_upoly_rec *)up;
59 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
60 __isl_keep struct isl_upoly *up2)
63 struct isl_upoly_rec *rec1, *rec2;
69 if (up1->var != up2->var)
71 if (isl_upoly_is_cst(up1)) {
72 struct isl_upoly_cst *cst1, *cst2;
73 cst1 = isl_upoly_as_cst(up1);
74 cst2 = isl_upoly_as_cst(up2);
77 return isl_int_eq(cst1->n, cst2->n) &&
78 isl_int_eq(cst1->d, cst2->d);
81 rec1 = isl_upoly_as_rec(up1);
82 rec2 = isl_upoly_as_rec(up2);
86 if (rec1->n != rec2->n)
89 for (i = 0; i < rec1->n; ++i) {
90 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
98 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
100 struct isl_upoly_cst *cst;
104 if (!isl_upoly_is_cst(up))
107 cst = isl_upoly_as_cst(up);
111 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
114 int isl_upoly_sgn(__isl_keep struct isl_upoly *up)
116 struct isl_upoly_cst *cst;
120 if (!isl_upoly_is_cst(up))
123 cst = isl_upoly_as_cst(up);
127 return isl_int_sgn(cst->n);
130 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
132 struct isl_upoly_cst *cst;
136 if (!isl_upoly_is_cst(up))
139 cst = isl_upoly_as_cst(up);
143 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
146 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
148 struct isl_upoly_cst *cst;
152 if (!isl_upoly_is_cst(up))
155 cst = isl_upoly_as_cst(up);
159 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
162 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
164 struct isl_upoly_cst *cst;
168 if (!isl_upoly_is_cst(up))
171 cst = isl_upoly_as_cst(up);
175 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
178 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
180 struct isl_upoly_cst *cst;
184 if (!isl_upoly_is_cst(up))
187 cst = isl_upoly_as_cst(up);
191 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
194 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
196 struct isl_upoly_cst *cst;
200 if (!isl_upoly_is_cst(up))
203 cst = isl_upoly_as_cst(up);
207 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
210 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
212 struct isl_upoly_cst *cst;
214 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
223 isl_int_init(cst->n);
224 isl_int_init(cst->d);
229 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
231 struct isl_upoly_cst *cst;
233 cst = isl_upoly_cst_alloc(ctx);
237 isl_int_set_si(cst->n, 0);
238 isl_int_set_si(cst->d, 1);
243 __isl_give struct isl_upoly *isl_upoly_one(struct isl_ctx *ctx)
245 struct isl_upoly_cst *cst;
247 cst = isl_upoly_cst_alloc(ctx);
251 isl_int_set_si(cst->n, 1);
252 isl_int_set_si(cst->d, 1);
257 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
259 struct isl_upoly_cst *cst;
261 cst = isl_upoly_cst_alloc(ctx);
265 isl_int_set_si(cst->n, 1);
266 isl_int_set_si(cst->d, 0);
271 __isl_give struct isl_upoly *isl_upoly_neginfty(struct isl_ctx *ctx)
273 struct isl_upoly_cst *cst;
275 cst = isl_upoly_cst_alloc(ctx);
279 isl_int_set_si(cst->n, -1);
280 isl_int_set_si(cst->d, 0);
285 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
287 struct isl_upoly_cst *cst;
289 cst = isl_upoly_cst_alloc(ctx);
293 isl_int_set_si(cst->n, 0);
294 isl_int_set_si(cst->d, 0);
299 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
300 isl_int n, isl_int d)
302 struct isl_upoly_cst *cst;
304 cst = isl_upoly_cst_alloc(ctx);
308 isl_int_set(cst->n, n);
309 isl_int_set(cst->d, d);
314 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
317 struct isl_upoly_rec *rec;
319 isl_assert(ctx, var >= 0, return NULL);
320 isl_assert(ctx, size >= 0, return NULL);
321 rec = isl_calloc(ctx, struct isl_upoly_rec,
322 sizeof(struct isl_upoly_rec) +
323 (size - 1) * sizeof(struct isl_upoly *));
338 __isl_give isl_qpolynomial *isl_qpolynomial_reset_dim(
339 __isl_take isl_qpolynomial *qp, __isl_take isl_dim *dim)
341 qp = isl_qpolynomial_cow(qp);
345 isl_dim_free(qp->dim);
350 isl_qpolynomial_free(qp);
355 isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp)
357 return qp ? qp->dim->ctx : NULL;
360 __isl_give isl_dim *isl_qpolynomial_get_dim(__isl_keep isl_qpolynomial *qp)
362 return qp ? isl_dim_copy(qp->dim) : NULL;
365 unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp,
366 enum isl_dim_type type)
368 return qp ? isl_dim_size(qp->dim, type) : 0;
371 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
373 return qp ? isl_upoly_is_zero(qp->upoly) : -1;
376 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
378 return qp ? isl_upoly_is_one(qp->upoly) : -1;
381 int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
383 return qp ? isl_upoly_is_nan(qp->upoly) : -1;
386 int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
388 return qp ? isl_upoly_is_infty(qp->upoly) : -1;
391 int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
393 return qp ? isl_upoly_is_neginfty(qp->upoly) : -1;
396 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
398 return qp ? isl_upoly_sgn(qp->upoly) : 0;
401 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
403 isl_int_clear(cst->n);
404 isl_int_clear(cst->d);
407 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
411 for (i = 0; i < rec->n; ++i)
412 isl_upoly_free(rec->p[i]);
415 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
424 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
426 struct isl_upoly_cst *cst;
427 struct isl_upoly_cst *dup;
429 cst = isl_upoly_as_cst(up);
433 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
436 isl_int_set(dup->n, cst->n);
437 isl_int_set(dup->d, cst->d);
442 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
445 struct isl_upoly_rec *rec;
446 struct isl_upoly_rec *dup;
448 rec = isl_upoly_as_rec(up);
452 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
456 for (i = 0; i < rec->n; ++i) {
457 dup->p[i] = isl_upoly_copy(rec->p[i]);
465 isl_upoly_free(&dup->up);
469 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
471 struct isl_upoly *dup;
476 if (isl_upoly_is_cst(up))
477 return isl_upoly_dup_cst(up);
479 return isl_upoly_dup_rec(up);
482 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
490 return isl_upoly_dup(up);
493 void isl_upoly_free(__isl_take struct isl_upoly *up)
502 upoly_free_cst((struct isl_upoly_cst *)up);
504 upoly_free_rec((struct isl_upoly_rec *)up);
506 isl_ctx_deref(up->ctx);
510 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
515 isl_int_gcd(gcd, cst->n, cst->d);
516 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
517 isl_int_divexact(cst->n, cst->n, gcd);
518 isl_int_divexact(cst->d, cst->d, gcd);
523 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
524 __isl_take struct isl_upoly *up2)
526 struct isl_upoly_cst *cst1;
527 struct isl_upoly_cst *cst2;
529 up1 = isl_upoly_cow(up1);
533 cst1 = isl_upoly_as_cst(up1);
534 cst2 = isl_upoly_as_cst(up2);
536 if (isl_int_eq(cst1->d, cst2->d))
537 isl_int_add(cst1->n, cst1->n, cst2->n);
539 isl_int_mul(cst1->n, cst1->n, cst2->d);
540 isl_int_addmul(cst1->n, cst2->n, cst1->d);
541 isl_int_mul(cst1->d, cst1->d, cst2->d);
544 isl_upoly_cst_reduce(cst1);
554 static __isl_give struct isl_upoly *replace_by_zero(
555 __isl_take struct isl_upoly *up)
563 return isl_upoly_zero(ctx);
566 static __isl_give struct isl_upoly *replace_by_constant_term(
567 __isl_take struct isl_upoly *up)
569 struct isl_upoly_rec *rec;
570 struct isl_upoly *cst;
575 rec = isl_upoly_as_rec(up);
578 cst = isl_upoly_copy(rec->p[0]);
586 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
587 __isl_take struct isl_upoly *up2)
590 struct isl_upoly_rec *rec1, *rec2;
595 if (isl_upoly_is_nan(up1)) {
600 if (isl_upoly_is_nan(up2)) {
605 if (isl_upoly_is_zero(up1)) {
610 if (isl_upoly_is_zero(up2)) {
615 if (up1->var < up2->var)
616 return isl_upoly_sum(up2, up1);
618 if (up2->var < up1->var) {
619 struct isl_upoly_rec *rec;
620 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
624 up1 = isl_upoly_cow(up1);
625 rec = isl_upoly_as_rec(up1);
628 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
630 up1 = replace_by_constant_term(up1);
634 if (isl_upoly_is_cst(up1))
635 return isl_upoly_sum_cst(up1, up2);
637 rec1 = isl_upoly_as_rec(up1);
638 rec2 = isl_upoly_as_rec(up2);
642 if (rec1->n < rec2->n)
643 return isl_upoly_sum(up2, up1);
645 up1 = isl_upoly_cow(up1);
646 rec1 = isl_upoly_as_rec(up1);
650 for (i = rec2->n - 1; i >= 0; --i) {
651 rec1->p[i] = isl_upoly_sum(rec1->p[i],
652 isl_upoly_copy(rec2->p[i]));
655 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
656 isl_upoly_free(rec1->p[i]);
662 up1 = replace_by_zero(up1);
663 else if (rec1->n == 1)
664 up1 = replace_by_constant_term(up1);
675 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
677 struct isl_upoly_cst *cst;
679 if (isl_upoly_is_zero(up))
682 up = isl_upoly_cow(up);
686 cst = isl_upoly_as_cst(up);
688 isl_int_neg(cst->n, cst->n);
693 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
696 struct isl_upoly_rec *rec;
701 if (isl_upoly_is_cst(up))
702 return isl_upoly_neg_cst(up);
704 up = isl_upoly_cow(up);
705 rec = isl_upoly_as_rec(up);
709 for (i = 0; i < rec->n; ++i) {
710 rec->p[i] = isl_upoly_neg(rec->p[i]);
721 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
722 __isl_take struct isl_upoly *up2)
724 struct isl_upoly_cst *cst1;
725 struct isl_upoly_cst *cst2;
727 up1 = isl_upoly_cow(up1);
731 cst1 = isl_upoly_as_cst(up1);
732 cst2 = isl_upoly_as_cst(up2);
734 isl_int_mul(cst1->n, cst1->n, cst2->n);
735 isl_int_mul(cst1->d, cst1->d, cst2->d);
737 isl_upoly_cst_reduce(cst1);
747 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
748 __isl_take struct isl_upoly *up2)
750 struct isl_upoly_rec *rec1;
751 struct isl_upoly_rec *rec2;
752 struct isl_upoly_rec *res;
756 rec1 = isl_upoly_as_rec(up1);
757 rec2 = isl_upoly_as_rec(up2);
760 size = rec1->n + rec2->n - 1;
761 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
765 for (i = 0; i < rec1->n; ++i) {
766 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
767 isl_upoly_copy(rec1->p[i]));
772 for (; i < size; ++i) {
773 res->p[i] = isl_upoly_zero(up1->ctx);
778 for (i = 0; i < rec1->n; ++i) {
779 for (j = 1; j < rec2->n; ++j) {
780 struct isl_upoly *up;
781 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
782 isl_upoly_copy(rec1->p[i]));
783 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
796 isl_upoly_free(&res->up);
800 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
801 __isl_take struct isl_upoly *up2)
806 if (isl_upoly_is_nan(up1)) {
811 if (isl_upoly_is_nan(up2)) {
816 if (isl_upoly_is_zero(up1)) {
821 if (isl_upoly_is_zero(up2)) {
826 if (isl_upoly_is_one(up1)) {
831 if (isl_upoly_is_one(up2)) {
836 if (up1->var < up2->var)
837 return isl_upoly_mul(up2, up1);
839 if (up2->var < up1->var) {
841 struct isl_upoly_rec *rec;
842 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
843 isl_ctx *ctx = up1->ctx;
846 return isl_upoly_nan(ctx);
848 up1 = isl_upoly_cow(up1);
849 rec = isl_upoly_as_rec(up1);
853 for (i = 0; i < rec->n; ++i) {
854 rec->p[i] = isl_upoly_mul(rec->p[i],
855 isl_upoly_copy(up2));
863 if (isl_upoly_is_cst(up1))
864 return isl_upoly_mul_cst(up1, up2);
866 return isl_upoly_mul_rec(up1, up2);
873 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
874 unsigned n_div, __isl_take struct isl_upoly *up)
876 struct isl_qpolynomial *qp = NULL;
882 total = isl_dim_total(dim);
884 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
889 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
900 isl_qpolynomial_free(qp);
904 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
913 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
915 struct isl_qpolynomial *dup;
920 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row,
921 isl_upoly_copy(qp->upoly));
924 isl_mat_free(dup->div);
925 dup->div = isl_mat_copy(qp->div);
931 isl_qpolynomial_free(dup);
935 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
943 return isl_qpolynomial_dup(qp);
946 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
954 isl_dim_free(qp->dim);
955 isl_mat_free(qp->div);
956 isl_upoly_free(qp->upoly);
961 __isl_give struct isl_upoly *isl_upoly_pow(isl_ctx *ctx, int pos, int power)
964 struct isl_upoly *up;
965 struct isl_upoly_rec *rec;
966 struct isl_upoly_cst *cst;
968 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
971 for (i = 0; i < 1 + power; ++i) {
972 rec->p[i] = isl_upoly_zero(ctx);
977 cst = isl_upoly_as_cst(rec->p[power]);
978 isl_int_set_si(cst->n, 1);
982 isl_upoly_free(&rec->up);
986 /* r array maps original positions to new positions.
988 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
992 struct isl_upoly_rec *rec;
993 struct isl_upoly *base;
994 struct isl_upoly *res;
996 if (isl_upoly_is_cst(up))
999 rec = isl_upoly_as_rec(up);
1003 isl_assert(up->ctx, rec->n >= 1, goto error);
1005 base = isl_upoly_pow(up->ctx, r[up->var], 1);
1006 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
1008 for (i = rec->n - 2; i >= 0; --i) {
1009 res = isl_upoly_mul(res, isl_upoly_copy(base));
1010 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
1013 isl_upoly_free(base);
1022 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
1027 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1028 div1->n_col >= div2->n_col, return -1);
1030 if (div1->n_row == div2->n_row)
1031 return isl_mat_is_equal(div1, div2);
1033 n_row = div1->n_row;
1034 n_col = div1->n_col;
1035 div1->n_row = div2->n_row;
1036 div1->n_col = div2->n_col;
1038 equal = isl_mat_is_equal(div1, div2);
1040 div1->n_row = n_row;
1041 div1->n_col = n_col;
1046 static void expand_row(__isl_keep isl_mat *dst, int d,
1047 __isl_keep isl_mat *src, int s, int *exp)
1050 unsigned c = src->n_col - src->n_row;
1052 isl_seq_cpy(dst->row[d], src->row[s], c);
1053 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
1055 for (i = 0; i < s; ++i)
1056 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
1059 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
1063 li = isl_seq_last_non_zero(div->row[i], div->n_col);
1064 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
1069 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
1072 struct isl_div_sort_info {
1077 static int div_sort_cmp(const void *p1, const void *p2)
1079 const struct isl_div_sort_info *i1, *i2;
1080 i1 = (const struct isl_div_sort_info *) p1;
1081 i2 = (const struct isl_div_sort_info *) p2;
1083 return cmp_row(i1->div, i1->row, i2->row);
1086 /* Sort divs and remove duplicates.
1088 static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp)
1093 struct isl_div_sort_info *array = NULL;
1094 int *pos = NULL, *at = NULL;
1095 int *reordering = NULL;
1100 if (qp->div->n_row <= 1)
1103 div_pos = isl_dim_total(qp->dim);
1105 array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info,
1107 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1108 at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1109 len = qp->div->n_col - 2;
1110 reordering = isl_alloc_array(qp->div->ctx, int, len);
1111 if (!array || !pos || !at || !reordering)
1114 for (i = 0; i < qp->div->n_row; ++i) {
1115 array[i].div = qp->div;
1121 qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
1124 for (i = 0; i < div_pos; ++i)
1127 for (i = 0; i < qp->div->n_row; ++i) {
1128 if (pos[array[i].row] == i)
1130 qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]);
1131 pos[at[i]] = pos[array[i].row];
1132 at[pos[array[i].row]] = at[i];
1133 at[i] = array[i].row;
1134 pos[array[i].row] = i;
1138 for (i = 0; i < len - div_pos; ++i) {
1140 isl_seq_eq(qp->div->row[i - skip - 1],
1141 qp->div->row[i - skip], qp->div->n_col)) {
1142 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
1143 qp->div = isl_mat_drop_cols(qp->div,
1144 2 + div_pos + i - skip, 1);
1147 reordering[div_pos + array[i].row] = div_pos + i - skip;
1150 qp->upoly = reorder(qp->upoly, reordering);
1152 if (!qp->upoly || !qp->div)
1166 isl_qpolynomial_free(qp);
1170 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
1171 __isl_keep isl_mat *div2, int *exp1, int *exp2)
1174 isl_mat *div = NULL;
1175 unsigned d = div1->n_col - div1->n_row;
1177 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
1178 d + div1->n_row + div2->n_row);
1182 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
1185 expand_row(div, k, div1, i, exp1);
1186 expand_row(div, k + 1, div2, j, exp2);
1188 cmp = cmp_row(div, k, k + 1);
1192 } else if (cmp < 0) {
1196 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1199 for (; i < div1->n_row; ++i, ++k) {
1200 expand_row(div, k, div1, i, exp1);
1203 for (; j < div2->n_row; ++j, ++k) {
1204 expand_row(div, k, div2, j, exp2);
1214 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1215 int *exp, int first)
1218 struct isl_upoly_rec *rec;
1220 if (isl_upoly_is_cst(up))
1223 if (up->var < first)
1226 if (exp[up->var - first] == up->var - first)
1229 up = isl_upoly_cow(up);
1233 up->var = exp[up->var - first] + first;
1235 rec = isl_upoly_as_rec(up);
1239 for (i = 0; i < rec->n; ++i) {
1240 rec->p[i] = expand(rec->p[i], exp, first);
1251 static __isl_give isl_qpolynomial *with_merged_divs(
1252 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1253 __isl_take isl_qpolynomial *qp2),
1254 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1258 isl_mat *div = NULL;
1260 qp1 = isl_qpolynomial_cow(qp1);
1261 qp2 = isl_qpolynomial_cow(qp2);
1266 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1267 qp1->div->n_col >= qp2->div->n_col, goto error);
1269 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1270 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1274 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1278 isl_mat_free(qp1->div);
1279 qp1->div = isl_mat_copy(div);
1280 isl_mat_free(qp2->div);
1281 qp2->div = isl_mat_copy(div);
1283 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1284 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1286 if (!qp1->upoly || !qp2->upoly)
1293 return fn(qp1, qp2);
1298 isl_qpolynomial_free(qp1);
1299 isl_qpolynomial_free(qp2);
1303 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1304 __isl_take isl_qpolynomial *qp2)
1306 qp1 = isl_qpolynomial_cow(qp1);
1311 if (qp1->div->n_row < qp2->div->n_row)
1312 return isl_qpolynomial_add(qp2, qp1);
1314 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1315 if (!compatible_divs(qp1->div, qp2->div))
1316 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1318 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1322 isl_qpolynomial_free(qp2);
1326 isl_qpolynomial_free(qp1);
1327 isl_qpolynomial_free(qp2);
1331 __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain(
1332 __isl_keep isl_set *dom,
1333 __isl_take isl_qpolynomial *qp1,
1334 __isl_take isl_qpolynomial *qp2)
1336 return isl_qpolynomial_add(qp1, qp2);
1339 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1340 __isl_take isl_qpolynomial *qp2)
1342 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1345 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1347 qp = isl_qpolynomial_cow(qp);
1352 qp->upoly = isl_upoly_neg(qp->upoly);
1358 isl_qpolynomial_free(qp);
1362 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1363 __isl_take isl_qpolynomial *qp2)
1365 qp1 = isl_qpolynomial_cow(qp1);
1370 if (qp1->div->n_row < qp2->div->n_row)
1371 return isl_qpolynomial_mul(qp2, qp1);
1373 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1374 if (!compatible_divs(qp1->div, qp2->div))
1375 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1377 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1381 isl_qpolynomial_free(qp2);
1385 isl_qpolynomial_free(qp1);
1386 isl_qpolynomial_free(qp2);
1390 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1392 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1395 __isl_give isl_qpolynomial *isl_qpolynomial_one(__isl_take isl_dim *dim)
1397 return isl_qpolynomial_alloc(dim, 0, isl_upoly_one(dim->ctx));
1400 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1402 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1405 __isl_give isl_qpolynomial *isl_qpolynomial_neginfty(__isl_take isl_dim *dim)
1407 return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx));
1410 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1412 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1415 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1418 struct isl_qpolynomial *qp;
1419 struct isl_upoly_cst *cst;
1421 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1425 cst = isl_upoly_as_cst(qp->upoly);
1426 isl_int_set(cst->n, v);
1431 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1432 isl_int *n, isl_int *d)
1434 struct isl_upoly_cst *cst;
1439 if (!isl_upoly_is_cst(qp->upoly))
1442 cst = isl_upoly_as_cst(qp->upoly);
1447 isl_int_set(*n, cst->n);
1449 isl_int_set(*d, cst->d);
1454 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1457 struct isl_upoly_rec *rec;
1465 rec = isl_upoly_as_rec(up);
1472 isl_assert(up->ctx, rec->n > 1, return -1);
1474 is_cst = isl_upoly_is_cst(rec->p[1]);
1480 return isl_upoly_is_affine(rec->p[0]);
1483 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1488 if (qp->div->n_row > 0)
1491 return isl_upoly_is_affine(qp->upoly);
1494 static void update_coeff(__isl_keep isl_vec *aff,
1495 __isl_keep struct isl_upoly_cst *cst, int pos)
1500 if (isl_int_is_zero(cst->n))
1505 isl_int_gcd(gcd, cst->d, aff->el[0]);
1506 isl_int_divexact(f, cst->d, gcd);
1507 isl_int_divexact(gcd, aff->el[0], gcd);
1508 isl_seq_scale(aff->el, aff->el, f, aff->size);
1509 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1514 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1515 __isl_keep isl_vec *aff)
1517 struct isl_upoly_cst *cst;
1518 struct isl_upoly_rec *rec;
1524 struct isl_upoly_cst *cst;
1526 cst = isl_upoly_as_cst(up);
1529 update_coeff(aff, cst, 0);
1533 rec = isl_upoly_as_rec(up);
1536 isl_assert(up->ctx, rec->n == 2, return -1);
1538 cst = isl_upoly_as_cst(rec->p[1]);
1541 update_coeff(aff, cst, 1 + up->var);
1543 return isl_upoly_update_affine(rec->p[0], aff);
1546 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1547 __isl_keep isl_qpolynomial *qp)
1555 isl_assert(qp->div->ctx, qp->div->n_row == 0, return NULL);
1556 d = isl_dim_total(qp->dim);
1557 aff = isl_vec_alloc(qp->div->ctx, 2 + d);
1561 isl_seq_clr(aff->el + 1, 1 + d);
1562 isl_int_set_si(aff->el[0], 1);
1564 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1573 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1574 __isl_keep isl_qpolynomial *qp2)
1579 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1582 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1585 struct isl_upoly_rec *rec;
1587 if (isl_upoly_is_cst(up)) {
1588 struct isl_upoly_cst *cst;
1589 cst = isl_upoly_as_cst(up);
1592 isl_int_lcm(*d, *d, cst->d);
1596 rec = isl_upoly_as_rec(up);
1600 for (i = 0; i < rec->n; ++i)
1601 upoly_update_den(rec->p[i], d);
1604 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1606 isl_int_set_si(*d, 1);
1609 upoly_update_den(qp->upoly, d);
1612 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1615 struct isl_ctx *ctx;
1622 return isl_qpolynomial_alloc(dim, 0, isl_upoly_pow(ctx, pos, power));
1625 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1626 enum isl_dim_type type, unsigned pos)
1631 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1632 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1634 if (type == isl_dim_set)
1635 pos += isl_dim_size(dim, isl_dim_param);
1637 return isl_qpolynomial_pow(dim, pos, 1);
1643 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1646 struct isl_qpolynomial *qp = NULL;
1647 struct isl_upoly_rec *rec;
1648 struct isl_upoly_cst *cst;
1654 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1656 pos = isl_dim_total(div->bmap->dim);
1657 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
1658 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1,
1663 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1664 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1666 for (i = 0; i < 1 + power; ++i) {
1667 rec->p[i] = isl_upoly_zero(div->ctx);
1672 cst = isl_upoly_as_cst(rec->p[power]);
1673 isl_int_set_si(cst->n, 1);
1679 isl_qpolynomial_free(qp);
1684 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1686 return isl_qpolynomial_div_pow(div, 1);
1689 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1690 const isl_int n, const isl_int d)
1692 struct isl_qpolynomial *qp;
1693 struct isl_upoly_cst *cst;
1695 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1699 cst = isl_upoly_as_cst(qp->upoly);
1700 isl_int_set(cst->n, n);
1701 isl_int_set(cst->d, d);
1706 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1708 struct isl_upoly_rec *rec;
1714 if (isl_upoly_is_cst(up))
1718 active[up->var] = 1;
1720 rec = isl_upoly_as_rec(up);
1721 for (i = 0; i < rec->n; ++i)
1722 if (up_set_active(rec->p[i], active, d) < 0)
1728 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1731 int d = isl_dim_total(qp->dim);
1736 for (i = 0; i < d; ++i)
1737 for (j = 0; j < qp->div->n_row; ++j) {
1738 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1744 return up_set_active(qp->upoly, active, d);
1747 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1748 enum isl_dim_type type, unsigned first, unsigned n)
1759 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1761 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1762 type == isl_dim_set, return -1);
1764 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1765 if (set_active(qp, active) < 0)
1768 if (type == isl_dim_set)
1769 first += isl_dim_size(qp->dim, isl_dim_param);
1770 for (i = 0; i < n; ++i)
1771 if (active[first + i]) {
1784 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1785 unsigned first, unsigned n)
1788 struct isl_upoly_rec *rec;
1792 if (n == 0 || up->var < 0 || up->var < first)
1794 if (up->var < first + n) {
1795 up = replace_by_constant_term(up);
1796 return isl_upoly_drop(up, first, n);
1798 up = isl_upoly_cow(up);
1802 rec = isl_upoly_as_rec(up);
1806 for (i = 0; i < rec->n; ++i) {
1807 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1818 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1819 __isl_take isl_qpolynomial *qp,
1820 enum isl_dim_type type, unsigned first, unsigned n)
1824 if (n == 0 && !isl_dim_get_tuple_name(qp->dim, type))
1827 qp = isl_qpolynomial_cow(qp);
1831 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1833 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1834 type == isl_dim_set, goto error);
1836 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1840 if (type == isl_dim_set)
1841 first += isl_dim_size(qp->dim, isl_dim_param);
1843 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1847 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1853 isl_qpolynomial_free(qp);
1857 __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up,
1858 unsigned first, unsigned n, __isl_keep struct isl_upoly **subs)
1861 struct isl_upoly_rec *rec;
1862 struct isl_upoly *base, *res;
1867 if (isl_upoly_is_cst(up))
1870 if (up->var < first)
1873 rec = isl_upoly_as_rec(up);
1877 isl_assert(up->ctx, rec->n >= 1, goto error);
1879 if (up->var >= first + n)
1880 base = isl_upoly_pow(up->ctx, up->var, 1);
1882 base = isl_upoly_copy(subs[up->var - first]);
1884 res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs);
1885 for (i = rec->n - 2; i >= 0; --i) {
1886 struct isl_upoly *t;
1887 t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs);
1888 res = isl_upoly_mul(res, isl_upoly_copy(base));
1889 res = isl_upoly_sum(res, t);
1892 isl_upoly_free(base);
1901 __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f,
1902 isl_int denom, unsigned len)
1905 struct isl_upoly *up;
1907 isl_assert(ctx, len >= 1, return NULL);
1909 up = isl_upoly_rat_cst(ctx, f[0], denom);
1910 for (i = 0; i < len - 1; ++i) {
1911 struct isl_upoly *t;
1912 struct isl_upoly *c;
1914 if (isl_int_is_zero(f[1 + i]))
1917 c = isl_upoly_rat_cst(ctx, f[1 + i], denom);
1918 t = isl_upoly_pow(ctx, i, 1);
1919 t = isl_upoly_mul(c, t);
1920 up = isl_upoly_sum(up, t);
1926 __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities(
1927 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
1932 struct isl_upoly *up;
1936 if (eq->n_eq == 0) {
1937 isl_basic_set_free(eq);
1941 qp = isl_qpolynomial_cow(qp);
1944 qp->div = isl_mat_cow(qp->div);
1948 total = 1 + isl_dim_total(eq->dim);
1949 isl_int_init(denom);
1950 for (i = 0; i < eq->n_eq; ++i) {
1951 j = isl_seq_last_non_zero(eq->eq[i], total);
1952 if (j < 0 || j == 0)
1955 for (k = 0; k < qp->div->n_row; ++k) {
1956 if (isl_int_is_zero(qp->div->row[k][1 + j]))
1958 isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total,
1959 &qp->div->row[k][0]);
1960 isl_seq_normalize(qp->div->ctx,
1961 qp->div->row[k], 1 + total);
1964 if (isl_int_is_pos(eq->eq[i][j]))
1965 isl_seq_neg(eq->eq[i], eq->eq[i], total);
1966 isl_int_abs(denom, eq->eq[i][j]);
1967 isl_int_set_si(eq->eq[i][j], 0);
1969 up = isl_upoly_from_affine(qp->dim->ctx,
1970 eq->eq[i], denom, total);
1971 qp->upoly = isl_upoly_subs(qp->upoly, j - 1, 1, &up);
1974 isl_int_clear(denom);
1979 isl_basic_set_free(eq);
1985 isl_basic_set_free(eq);
1986 isl_qpolynomial_free(qp);
1991 #define PW isl_pw_qpolynomial
1993 #define EL isl_qpolynomial
1995 #define IS_ZERO is_zero
1999 #include <isl_pw_templ.c>
2002 #define UNION isl_union_pw_qpolynomial
2004 #define PART isl_pw_qpolynomial
2006 #define PARTS pw_qpolynomial
2008 #include <isl_union_templ.c>
2010 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
2018 if (!isl_set_fast_is_universe(pwqp->p[0].set))
2021 return isl_qpolynomial_is_one(pwqp->p[0].qp);
2024 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
2025 __isl_take isl_pw_qpolynomial *pwqp1,
2026 __isl_take isl_pw_qpolynomial *pwqp2)
2029 struct isl_pw_qpolynomial *res;
2032 if (!pwqp1 || !pwqp2)
2035 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
2038 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
2039 isl_pw_qpolynomial_free(pwqp2);
2043 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
2044 isl_pw_qpolynomial_free(pwqp1);
2048 if (isl_pw_qpolynomial_is_one(pwqp1)) {
2049 isl_pw_qpolynomial_free(pwqp1);
2053 if (isl_pw_qpolynomial_is_one(pwqp2)) {
2054 isl_pw_qpolynomial_free(pwqp2);
2058 n = pwqp1->n * pwqp2->n;
2059 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
2061 for (i = 0; i < pwqp1->n; ++i) {
2062 for (j = 0; j < pwqp2->n; ++j) {
2063 struct isl_set *common;
2064 struct isl_qpolynomial *prod;
2065 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
2066 isl_set_copy(pwqp2->p[j].set));
2067 if (isl_set_fast_is_empty(common)) {
2068 isl_set_free(common);
2072 prod = isl_qpolynomial_mul(
2073 isl_qpolynomial_copy(pwqp1->p[i].qp),
2074 isl_qpolynomial_copy(pwqp2->p[j].qp));
2076 res = isl_pw_qpolynomial_add_piece(res, common, prod);
2080 isl_pw_qpolynomial_free(pwqp1);
2081 isl_pw_qpolynomial_free(pwqp2);
2085 isl_pw_qpolynomial_free(pwqp1);
2086 isl_pw_qpolynomial_free(pwqp2);
2090 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
2091 __isl_take isl_pw_qpolynomial *pwqp)
2098 if (isl_pw_qpolynomial_is_zero(pwqp))
2101 pwqp = isl_pw_qpolynomial_cow(pwqp);
2105 for (i = 0; i < pwqp->n; ++i) {
2106 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
2113 isl_pw_qpolynomial_free(pwqp);
2117 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
2118 __isl_take isl_pw_qpolynomial *pwqp1,
2119 __isl_take isl_pw_qpolynomial *pwqp2)
2121 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
2124 __isl_give struct isl_upoly *isl_upoly_eval(
2125 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
2128 struct isl_upoly_rec *rec;
2129 struct isl_upoly *res;
2130 struct isl_upoly *base;
2132 if (isl_upoly_is_cst(up)) {
2137 rec = isl_upoly_as_rec(up);
2141 isl_assert(up->ctx, rec->n >= 1, goto error);
2143 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
2145 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
2148 for (i = rec->n - 2; i >= 0; --i) {
2149 res = isl_upoly_mul(res, isl_upoly_copy(base));
2150 res = isl_upoly_sum(res,
2151 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
2152 isl_vec_copy(vec)));
2155 isl_upoly_free(base);
2165 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
2166 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
2169 struct isl_upoly *up;
2174 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
2176 if (qp->div->n_row == 0)
2177 ext = isl_vec_copy(pnt->vec);
2180 unsigned dim = isl_dim_total(qp->dim);
2181 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
2185 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
2186 for (i = 0; i < qp->div->n_row; ++i) {
2187 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
2188 1 + dim + i, &ext->el[1+dim+i]);
2189 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
2190 qp->div->row[i][0]);
2194 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
2198 dim = isl_dim_copy(qp->dim);
2199 isl_qpolynomial_free(qp);
2200 isl_point_free(pnt);
2202 return isl_qpolynomial_alloc(dim, 0, up);
2204 isl_qpolynomial_free(qp);
2205 isl_point_free(pnt);
2209 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
2210 __isl_keep struct isl_upoly_cst *cst2)
2215 isl_int_mul(t, cst1->n, cst2->d);
2216 isl_int_submul(t, cst2->n, cst1->d);
2217 cmp = isl_int_sgn(t);
2222 int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1,
2223 __isl_keep isl_qpolynomial *qp2)
2225 struct isl_upoly_cst *cst1, *cst2;
2229 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), return -1);
2230 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), return -1);
2231 if (isl_qpolynomial_is_nan(qp1))
2233 if (isl_qpolynomial_is_nan(qp2))
2235 cst1 = isl_upoly_as_cst(qp1->upoly);
2236 cst2 = isl_upoly_as_cst(qp2->upoly);
2238 return isl_upoly_cmp(cst1, cst2) <= 0;
2241 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
2242 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2244 struct isl_upoly_cst *cst1, *cst2;
2249 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2250 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2251 cst1 = isl_upoly_as_cst(qp1->upoly);
2252 cst2 = isl_upoly_as_cst(qp2->upoly);
2253 cmp = isl_upoly_cmp(cst1, cst2);
2256 isl_qpolynomial_free(qp2);
2258 isl_qpolynomial_free(qp1);
2263 isl_qpolynomial_free(qp1);
2264 isl_qpolynomial_free(qp2);
2268 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
2269 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2271 struct isl_upoly_cst *cst1, *cst2;
2276 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2277 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2278 cst1 = isl_upoly_as_cst(qp1->upoly);
2279 cst2 = isl_upoly_as_cst(qp2->upoly);
2280 cmp = isl_upoly_cmp(cst1, cst2);
2283 isl_qpolynomial_free(qp2);
2285 isl_qpolynomial_free(qp1);
2290 isl_qpolynomial_free(qp1);
2291 isl_qpolynomial_free(qp2);
2295 __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
2296 __isl_take isl_qpolynomial *qp, enum isl_dim_type type,
2297 unsigned first, unsigned n)
2306 qp = isl_qpolynomial_cow(qp);
2310 isl_assert(qp->div->ctx, first <= isl_dim_size(qp->dim, type),
2313 g_pos = pos(qp->dim, type) + first;
2315 qp->div = isl_mat_insert_cols(qp->div, 2 + g_pos, n);
2319 total = qp->div->n_col - 2;
2320 if (total > g_pos) {
2322 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2325 for (i = 0; i < total - g_pos; ++i)
2327 qp->upoly = expand(qp->upoly, exp, g_pos);
2333 qp->dim = isl_dim_insert(qp->dim, type, first, n);
2339 isl_qpolynomial_free(qp);
2343 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
2344 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2348 pos = isl_qpolynomial_dim(qp, type);
2350 return isl_qpolynomial_insert_dims(qp, type, pos, n);
2353 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2354 __isl_take isl_pw_qpolynomial *pwqp,
2355 enum isl_dim_type type, unsigned n)
2359 pos = isl_pw_qpolynomial_dim(pwqp, type);
2361 return isl_pw_qpolynomial_insert_dims(pwqp, type, pos, n);
2364 static int *reordering_move(isl_ctx *ctx,
2365 unsigned len, unsigned dst, unsigned src, unsigned n)
2370 reordering = isl_alloc_array(ctx, int, len);
2375 for (i = 0; i < dst; ++i)
2377 for (i = 0; i < n; ++i)
2378 reordering[src + i] = dst + i;
2379 for (i = 0; i < src - dst; ++i)
2380 reordering[dst + i] = dst + n + i;
2381 for (i = 0; i < len - src - n; ++i)
2382 reordering[src + n + i] = src + n + i;
2384 for (i = 0; i < src; ++i)
2386 for (i = 0; i < n; ++i)
2387 reordering[src + i] = dst + i;
2388 for (i = 0; i < dst - src; ++i)
2389 reordering[src + n + i] = src + i;
2390 for (i = 0; i < len - dst - n; ++i)
2391 reordering[dst + n + i] = dst + n + i;
2397 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
2398 __isl_take isl_qpolynomial *qp,
2399 enum isl_dim_type dst_type, unsigned dst_pos,
2400 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2406 qp = isl_qpolynomial_cow(qp);
2410 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2413 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2414 g_src_pos = pos(qp->dim, src_type) + src_pos;
2415 if (dst_type > src_type)
2418 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2425 reordering = reordering_move(qp->dim->ctx,
2426 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2430 qp->upoly = reorder(qp->upoly, reordering);
2435 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2441 isl_qpolynomial_free(qp);
2445 __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_dim *dim,
2446 isl_int *f, isl_int denom)
2448 struct isl_upoly *up;
2453 up = isl_upoly_from_affine(dim->ctx, f, denom, 1 + isl_dim_total(dim));
2455 return isl_qpolynomial_alloc(dim, 0, up);
2458 __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
2459 __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
2463 struct isl_upoly *up;
2464 isl_qpolynomial *qp;
2470 isl_int_init(denom);
2472 isl_constraint_get_coefficient(c, type, pos, &denom);
2473 isl_constraint_set_coefficient(c, type, pos, c->ctx->zero);
2474 sgn = isl_int_sgn(denom);
2475 isl_int_abs(denom, denom);
2476 up = isl_upoly_from_affine(c->ctx, c->line[0], denom,
2477 1 + isl_constraint_dim(c, isl_dim_all));
2479 isl_int_neg(denom, denom);
2480 isl_constraint_set_coefficient(c, type, pos, denom);
2482 dim = isl_dim_copy(c->bmap->dim);
2484 isl_int_clear(denom);
2485 isl_constraint_free(c);
2487 qp = isl_qpolynomial_alloc(dim, 0, up);
2489 qp = isl_qpolynomial_neg(qp);
2493 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
2494 * in "qp" by subs[i].
2496 __isl_give isl_qpolynomial *isl_qpolynomial_substitute(
2497 __isl_take isl_qpolynomial *qp,
2498 enum isl_dim_type type, unsigned first, unsigned n,
2499 __isl_keep isl_qpolynomial **subs)
2502 struct isl_upoly **ups;
2507 qp = isl_qpolynomial_cow(qp);
2510 for (i = 0; i < n; ++i)
2514 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2517 for (i = 0; i < n; ++i)
2518 isl_assert(qp->dim->ctx, isl_dim_equal(qp->dim, subs[i]->dim),
2521 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
2522 for (i = 0; i < n; ++i)
2523 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
2525 first += pos(qp->dim, type);
2527 ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n);
2530 for (i = 0; i < n; ++i)
2531 ups[i] = subs[i]->upoly;
2533 qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups);
2542 isl_qpolynomial_free(qp);
2546 __isl_give isl_basic_set *add_div_constraints(__isl_take isl_basic_set *bset,
2547 __isl_take isl_mat *div)
2555 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2558 total = isl_basic_set_total_dim(bset);
2559 for (i = 0; i < div->n_row; ++i)
2560 if (isl_basic_set_add_div_constraints_var(bset,
2561 total - div->n_row + i, div->row[i]) < 0)
2568 isl_basic_set_free(bset);
2572 /* Extend "bset" with extra set dimensions for each integer division
2573 * in "qp" and then call "fn" with the extended bset and the polynomial
2574 * that results from replacing each of the integer divisions by the
2575 * corresponding extra set dimension.
2577 int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
2578 __isl_keep isl_basic_set *bset,
2579 int (*fn)(__isl_take isl_basic_set *bset,
2580 __isl_take isl_qpolynomial *poly, void *user), void *user)
2584 isl_qpolynomial *poly;
2588 if (qp->div->n_row == 0)
2589 return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
2592 div = isl_mat_copy(qp->div);
2593 dim = isl_dim_copy(qp->dim);
2594 dim = isl_dim_add(dim, isl_dim_set, qp->div->n_row);
2595 poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly));
2596 bset = isl_basic_set_copy(bset);
2597 bset = isl_basic_set_add(bset, isl_dim_set, qp->div->n_row);
2598 bset = add_div_constraints(bset, div);
2600 return fn(bset, poly, user);
2605 /* Return total degree in variables first (inclusive) up to last (exclusive).
2607 int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last)
2611 struct isl_upoly_rec *rec;
2615 if (isl_upoly_is_zero(up))
2617 if (isl_upoly_is_cst(up) || up->var < first)
2620 rec = isl_upoly_as_rec(up);
2624 for (i = 0; i < rec->n; ++i) {
2627 if (isl_upoly_is_zero(rec->p[i]))
2629 d = isl_upoly_degree(rec->p[i], first, last);
2639 /* Return total degree in set variables.
2641 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
2649 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2650 nvar = isl_dim_size(poly->dim, isl_dim_set);
2651 return isl_upoly_degree(poly->upoly, ovar, ovar + nvar);
2654 __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up,
2655 unsigned pos, int deg)
2658 struct isl_upoly_rec *rec;
2663 if (isl_upoly_is_cst(up) || up->var < pos) {
2665 return isl_upoly_copy(up);
2667 return isl_upoly_zero(up->ctx);
2670 rec = isl_upoly_as_rec(up);
2674 if (up->var == pos) {
2676 return isl_upoly_copy(rec->p[deg]);
2678 return isl_upoly_zero(up->ctx);
2681 up = isl_upoly_copy(up);
2682 up = isl_upoly_cow(up);
2683 rec = isl_upoly_as_rec(up);
2687 for (i = 0; i < rec->n; ++i) {
2688 struct isl_upoly *t;
2689 t = isl_upoly_coeff(rec->p[i], pos, deg);
2692 isl_upoly_free(rec->p[i]);
2702 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
2704 __isl_give isl_qpolynomial *isl_qpolynomial_coeff(
2705 __isl_keep isl_qpolynomial *qp,
2706 enum isl_dim_type type, unsigned t_pos, int deg)
2709 struct isl_upoly *up;
2715 isl_assert(qp->div->ctx, t_pos < isl_dim_size(qp->dim, type),
2718 g_pos = pos(qp->dim, type) + t_pos;
2719 up = isl_upoly_coeff(qp->upoly, g_pos, deg);
2721 c = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row, up);
2724 isl_mat_free(c->div);
2725 c->div = isl_mat_copy(qp->div);
2730 isl_qpolynomial_free(c);
2734 /* Homogenize the polynomial in the variables first (inclusive) up to
2735 * last (exclusive) by inserting powers of variable first.
2736 * Variable first is assumed not to appear in the input.
2738 __isl_give struct isl_upoly *isl_upoly_homogenize(
2739 __isl_take struct isl_upoly *up, int deg, int target,
2740 int first, int last)
2743 struct isl_upoly_rec *rec;
2747 if (isl_upoly_is_zero(up))
2751 if (isl_upoly_is_cst(up) || up->var < first) {
2752 struct isl_upoly *hom;
2754 hom = isl_upoly_pow(up->ctx, first, target - deg);
2757 rec = isl_upoly_as_rec(hom);
2758 rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up);
2763 up = isl_upoly_cow(up);
2764 rec = isl_upoly_as_rec(up);
2768 for (i = 0; i < rec->n; ++i) {
2769 if (isl_upoly_is_zero(rec->p[i]))
2771 rec->p[i] = isl_upoly_homogenize(rec->p[i],
2772 up->var < last ? deg + i : i, target,
2784 /* Homogenize the polynomial in the set variables by introducing
2785 * powers of an extra set variable at position 0.
2787 __isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
2788 __isl_take isl_qpolynomial *poly)
2792 int deg = isl_qpolynomial_degree(poly);
2797 poly = isl_qpolynomial_insert_dims(poly, isl_dim_set, 0, 1);
2798 poly = isl_qpolynomial_cow(poly);
2802 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2803 nvar = isl_dim_size(poly->dim, isl_dim_set);
2804 poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg,
2811 isl_qpolynomial_free(poly);
2815 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2816 __isl_take isl_mat *div)
2824 n = isl_dim_total(dim) + div->n_row;
2826 term = isl_calloc(dim->ctx, struct isl_term,
2827 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2834 isl_int_init(term->n);
2835 isl_int_init(term->d);
2844 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
2853 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
2862 total = isl_dim_total(term->dim) + term->div->n_row;
2864 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
2868 isl_int_set(dup->n, term->n);
2869 isl_int_set(dup->d, term->d);
2871 for (i = 0; i < total; ++i)
2872 dup->pow[i] = term->pow[i];
2877 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
2885 return isl_term_dup(term);
2888 void isl_term_free(__isl_take isl_term *term)
2893 if (--term->ref > 0)
2896 isl_dim_free(term->dim);
2897 isl_mat_free(term->div);
2898 isl_int_clear(term->n);
2899 isl_int_clear(term->d);
2903 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
2911 case isl_dim_out: return isl_dim_size(term->dim, type);
2912 case isl_dim_div: return term->div->n_row;
2913 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
2918 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
2920 return term ? term->dim->ctx : NULL;
2923 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
2927 isl_int_set(*n, term->n);
2930 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
2934 isl_int_set(*d, term->d);
2937 int isl_term_get_exp(__isl_keep isl_term *term,
2938 enum isl_dim_type type, unsigned pos)
2943 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
2945 if (type >= isl_dim_set)
2946 pos += isl_dim_size(term->dim, isl_dim_param);
2947 if (type >= isl_dim_div)
2948 pos += isl_dim_size(term->dim, isl_dim_set);
2950 return term->pow[pos];
2953 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
2955 isl_basic_map *bmap;
2962 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
2965 total = term->div->n_col - term->div->n_row - 2;
2966 /* No nested divs for now */
2967 isl_assert(term->dim->ctx,
2968 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
2969 term->div->n_row) == -1,
2972 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
2973 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
2976 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
2978 return isl_basic_map_div(bmap, k);
2980 isl_basic_map_free(bmap);
2984 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
2985 int (*fn)(__isl_take isl_term *term, void *user),
2986 __isl_take isl_term *term, void *user)
2989 struct isl_upoly_rec *rec;
2994 if (isl_upoly_is_zero(up))
2997 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
2998 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
2999 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
3001 if (isl_upoly_is_cst(up)) {
3002 struct isl_upoly_cst *cst;
3003 cst = isl_upoly_as_cst(up);
3006 term = isl_term_cow(term);
3009 isl_int_set(term->n, cst->n);
3010 isl_int_set(term->d, cst->d);
3011 if (fn(isl_term_copy(term), user) < 0)
3016 rec = isl_upoly_as_rec(up);
3020 for (i = 0; i < rec->n; ++i) {
3021 term = isl_term_cow(term);
3024 term->pow[up->var] = i;
3025 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
3029 term->pow[up->var] = 0;
3033 isl_term_free(term);
3037 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
3038 int (*fn)(__isl_take isl_term *term, void *user), void *user)
3045 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
3049 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
3051 isl_term_free(term);
3053 return term ? 0 : -1;
3056 __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
3058 struct isl_upoly *up;
3059 isl_qpolynomial *qp;
3065 n = isl_dim_total(term->dim) + term->div->n_row;
3067 up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d);
3068 for (i = 0; i < n; ++i) {
3071 up = isl_upoly_mul(up,
3072 isl_upoly_pow(term->dim->ctx, i, term->pow[i]));
3075 qp = isl_qpolynomial_alloc(isl_dim_copy(term->dim), term->div->n_row, up);
3078 isl_mat_free(qp->div);
3079 qp->div = isl_mat_copy(term->div);
3083 isl_term_free(term);
3086 isl_qpolynomial_free(qp);
3087 isl_term_free(term);
3091 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
3092 __isl_take isl_dim *dim)
3101 if (isl_dim_equal(qp->dim, dim)) {
3106 qp = isl_qpolynomial_cow(qp);
3110 extra = isl_dim_size(dim, isl_dim_set) -
3111 isl_dim_size(qp->dim, isl_dim_set);
3112 total = isl_dim_total(qp->dim);
3113 if (qp->div->n_row) {
3116 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
3119 for (i = 0; i < qp->div->n_row; ++i)
3121 qp->upoly = expand(qp->upoly, exp, total);
3126 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
3129 for (i = 0; i < qp->div->n_row; ++i)
3130 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
3132 isl_dim_free(qp->dim);
3138 isl_qpolynomial_free(qp);
3142 /* For each parameter or variable that does not appear in qp,
3143 * first eliminate the variable from all constraints and then set it to zero.
3145 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
3146 __isl_keep isl_qpolynomial *qp)
3157 d = isl_dim_total(set->dim);
3158 active = isl_calloc_array(set->ctx, int, d);
3159 if (set_active(qp, active) < 0)
3162 for (i = 0; i < d; ++i)
3171 nparam = isl_dim_size(set->dim, isl_dim_param);
3172 nvar = isl_dim_size(set->dim, isl_dim_set);
3173 for (i = 0; i < nparam; ++i) {
3176 set = isl_set_eliminate(set, isl_dim_param, i, 1);
3177 set = isl_set_fix_si(set, isl_dim_param, i, 0);
3179 for (i = 0; i < nvar; ++i) {
3180 if (active[nparam + i])
3182 set = isl_set_eliminate(set, isl_dim_set, i, 1);
3183 set = isl_set_fix_si(set, isl_dim_set, i, 0);
3195 struct isl_opt_data {
3196 isl_qpolynomial *qp;
3198 isl_qpolynomial *opt;
3202 static int opt_fn(__isl_take isl_point *pnt, void *user)
3204 struct isl_opt_data *data = (struct isl_opt_data *)user;
3205 isl_qpolynomial *val;
3207 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
3211 } else if (data->max) {
3212 data->opt = isl_qpolynomial_max_cst(data->opt, val);
3214 data->opt = isl_qpolynomial_min_cst(data->opt, val);
3220 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
3221 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
3223 struct isl_opt_data data = { NULL, 1, NULL, max };
3228 if (isl_upoly_is_cst(qp->upoly)) {
3233 set = fix_inactive(set, qp);
3236 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
3240 data.opt = isl_qpolynomial_zero(isl_qpolynomial_get_dim(qp));
3243 isl_qpolynomial_free(qp);
3247 isl_qpolynomial_free(qp);
3248 isl_qpolynomial_free(data.opt);
3252 __isl_give isl_qpolynomial *isl_qpolynomial_morph(__isl_take isl_qpolynomial *qp,
3253 __isl_take isl_morph *morph)
3257 struct isl_upoly *up;
3259 struct isl_upoly **subs;
3262 qp = isl_qpolynomial_cow(qp);
3267 isl_assert(ctx, isl_dim_equal(qp->dim, morph->dom->dim), goto error);
3269 subs = isl_calloc_array(ctx, struct isl_upoly *, morph->inv->n_row - 1);
3273 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3274 subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i],
3275 morph->inv->row[0][0], morph->inv->n_col);
3277 qp->upoly = isl_upoly_subs(qp->upoly, 0, morph->inv->n_row - 1, subs);
3279 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3280 isl_upoly_free(subs[i]);
3283 mat = isl_mat_diagonal(isl_mat_identity(ctx, 1), isl_mat_copy(morph->inv));
3284 mat = isl_mat_diagonal(mat, isl_mat_identity(ctx, qp->div->n_row));
3285 qp->div = isl_mat_product(qp->div, mat);
3286 isl_dim_free(qp->dim);
3287 qp->dim = isl_dim_copy(morph->ran->dim);
3289 if (!qp->upoly || !qp->div || !qp->dim)
3292 isl_morph_free(morph);
3296 isl_qpolynomial_free(qp);
3297 isl_morph_free(morph);
3301 static int neg_entry(void **entry, void *user)
3303 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
3305 *pwqp = isl_pw_qpolynomial_neg(*pwqp);
3307 return *pwqp ? 0 : -1;
3310 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_neg(
3311 __isl_take isl_union_pw_qpolynomial *upwqp)
3313 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
3317 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
3318 &neg_entry, NULL) < 0)
3323 isl_union_pw_qpolynomial_free(upwqp);
3327 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_sub(
3328 __isl_take isl_union_pw_qpolynomial *upwqp1,
3329 __isl_take isl_union_pw_qpolynomial *upwqp2)
3331 return isl_union_pw_qpolynomial_add(upwqp1,
3332 isl_union_pw_qpolynomial_neg(upwqp2));
3335 static int mul_entry(void **entry, void *user)
3337 struct isl_union_pw_qpolynomial_match_bin_data *data = user;
3339 struct isl_hash_table_entry *entry2;
3340 isl_pw_qpolynomial *pwpq = *entry;
3343 hash = isl_dim_get_hash(pwpq->dim);
3344 entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table,
3345 hash, &has_dim, pwpq->dim, 0);
3349 pwpq = isl_pw_qpolynomial_copy(pwpq);
3350 pwpq = isl_pw_qpolynomial_mul(pwpq,
3351 isl_pw_qpolynomial_copy(entry2->data));
3353 empty = isl_pw_qpolynomial_is_zero(pwpq);
3355 isl_pw_qpolynomial_free(pwpq);
3359 isl_pw_qpolynomial_free(pwpq);
3363 data->res = isl_union_pw_qpolynomial_add_pw_qpolynomial(data->res, pwpq);
3368 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
3369 __isl_take isl_union_pw_qpolynomial *upwqp1,
3370 __isl_take isl_union_pw_qpolynomial *upwqp2)
3372 return match_bin_op(upwqp1, upwqp2, &mul_entry);
3375 /* Reorder the columns of the given div definitions according to the
3378 static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div,
3379 __isl_take isl_reordering *r)
3388 extra = isl_dim_total(r->dim) + div->n_row - r->len;
3389 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
3393 for (i = 0; i < div->n_row; ++i) {
3394 isl_seq_cpy(mat->row[i], div->row[i], 2);
3395 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2);
3396 for (j = 0; j < r->len; ++j)
3397 isl_int_set(mat->row[i][2 + r->pos[j]],
3398 div->row[i][2 + j]);
3401 isl_reordering_free(r);
3405 isl_reordering_free(r);
3410 /* Reorder the dimension of "qp" according to the given reordering.
3412 __isl_give isl_qpolynomial *isl_qpolynomial_realign(
3413 __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r)
3415 qp = isl_qpolynomial_cow(qp);
3419 r = isl_reordering_extend(r, qp->div->n_row);
3423 qp->div = reorder_divs(qp->div, isl_reordering_copy(r));
3427 qp->upoly = reorder(qp->upoly, r->pos);
3431 qp = isl_qpolynomial_reset_dim(qp, isl_dim_copy(r->dim));
3433 isl_reordering_free(r);
3436 isl_qpolynomial_free(qp);
3437 isl_reordering_free(r);
3441 struct isl_split_periods_data {
3443 isl_pw_qpolynomial *res;
3446 /* Create a slice where the integer division "div" has the fixed value "v".
3447 * In particular, if "div" refers to floor(f/m), then create a slice
3449 * m v <= f <= m v + (m - 1)
3454 * -f + m v + (m - 1) >= 0
3456 static __isl_give isl_set *set_div_slice(__isl_take isl_dim *dim,
3457 __isl_keep isl_qpolynomial *qp, int div, isl_int v)
3460 isl_basic_set *bset = NULL;
3466 total = isl_dim_total(dim);
3467 bset = isl_basic_set_alloc_dim(isl_dim_copy(dim), 0, 0, 2);
3469 k = isl_basic_set_alloc_inequality(bset);
3472 isl_seq_cpy(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3473 isl_int_submul(bset->ineq[k][0], v, qp->div->row[div][0]);
3475 k = isl_basic_set_alloc_inequality(bset);
3478 isl_seq_neg(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3479 isl_int_addmul(bset->ineq[k][0], v, qp->div->row[div][0]);
3480 isl_int_add(bset->ineq[k][0], bset->ineq[k][0], qp->div->row[div][0]);
3481 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
3484 return isl_set_from_basic_set(bset);
3486 isl_basic_set_free(bset);
3491 static int split_periods(__isl_take isl_set *set,
3492 __isl_take isl_qpolynomial *qp, void *user);
3494 /* Create a slice of the domain "set" such that integer division "div"
3495 * has the fixed value "v" and add the results to data->res,
3496 * replacing the integer division by "v" in "qp".
3498 static int set_div(__isl_take isl_set *set,
3499 __isl_take isl_qpolynomial *qp, int div, isl_int v,
3500 struct isl_split_periods_data *data)
3505 struct isl_upoly *cst;
3508 slice = set_div_slice(isl_set_get_dim(set), qp, div, v);
3509 set = isl_set_intersect(set, slice);
3511 qp = isl_qpolynomial_cow(qp);
3515 cst = isl_upoly_rat_cst(qp->dim->ctx, v, qp->dim->ctx->one);
3518 total = isl_dim_total(qp->dim);
3519 qp->upoly = isl_upoly_subs(qp->upoly, total + div, 1, &cst);
3520 isl_upoly_free(cst);
3524 reordering = isl_alloc_array(qp->dim->ctx, int, total + qp->div->n_row);
3527 for (i = 0; i < total + div; ++i)
3529 for (i = total + div + 1; i < total + qp->div->n_row; ++i)
3530 reordering[i] = i - 1;
3531 qp->div = isl_mat_drop_rows(qp->div, div, 1);
3532 qp->div = isl_mat_drop_cols(qp->div, 2 + total + div, 1);
3533 qp->upoly = reorder(qp->upoly, reordering);
3536 if (!qp->upoly || !qp->div)
3539 return split_periods(set, qp, data);
3542 isl_qpolynomial_free(qp);
3546 /* Split the domain "set" such that integer division "div"
3547 * has a fixed value (ranging from "min" to "max") on each slice
3548 * and add the results to data->res.
3550 static int split_div(__isl_take isl_set *set,
3551 __isl_take isl_qpolynomial *qp, int div, isl_int min, isl_int max,
3552 struct isl_split_periods_data *data)
3554 for (; isl_int_le(min, max); isl_int_add_ui(min, min, 1)) {
3555 isl_set *set_i = isl_set_copy(set);
3556 isl_qpolynomial *qp_i = isl_qpolynomial_copy(qp);
3558 if (set_div(set_i, qp_i, div, min, data) < 0)
3562 isl_qpolynomial_free(qp);
3566 isl_qpolynomial_free(qp);
3570 /* If "qp" refers to any integer division
3571 * that can only attain "max_periods" distinct values on "set"
3572 * then split the domain along those distinct values.
3573 * Add the results (or the original if no splitting occurs)
3576 static int split_periods(__isl_take isl_set *set,
3577 __isl_take isl_qpolynomial *qp, void *user)
3580 isl_pw_qpolynomial *pwqp;
3581 struct isl_split_periods_data *data;
3586 data = (struct isl_split_periods_data *)user;
3591 if (qp->div->n_row == 0) {
3592 pwqp = isl_pw_qpolynomial_alloc(set, qp);
3593 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
3599 total = isl_dim_total(qp->dim);
3600 for (i = 0; i < qp->div->n_row; ++i) {
3601 enum isl_lp_result lp_res;
3603 if (isl_seq_first_non_zero(qp->div->row[i] + 2 + total,
3604 qp->div->n_row) != -1)
3607 lp_res = isl_set_solve_lp(set, 0, qp->div->row[i] + 1,
3608 set->ctx->one, &min, NULL, NULL);
3609 if (lp_res == isl_lp_error)
3611 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
3613 isl_int_fdiv_q(min, min, qp->div->row[i][0]);
3615 lp_res = isl_set_solve_lp(set, 1, qp->div->row[i] + 1,
3616 set->ctx->one, &max, NULL, NULL);
3617 if (lp_res == isl_lp_error)
3619 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
3621 isl_int_fdiv_q(max, max, qp->div->row[i][0]);
3623 isl_int_sub(max, max, min);
3624 if (isl_int_cmp_si(max, data->max_periods) < 0) {
3625 isl_int_add(max, max, min);
3630 if (i < qp->div->n_row) {
3631 r = split_div(set, qp, i, min, max, data);
3633 pwqp = isl_pw_qpolynomial_alloc(set, qp);
3634 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
3646 isl_qpolynomial_free(qp);
3650 /* If any quasi-polynomial in pwqp refers to any integer division
3651 * that can only attain "max_periods" distinct values on its domain
3652 * then split the domain along those distinct values.
3654 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_periods(
3655 __isl_take isl_pw_qpolynomial *pwqp, int max_periods)
3657 struct isl_split_periods_data data;
3659 data.max_periods = max_periods;
3660 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_dim(pwqp));
3662 if (isl_pw_qpolynomial_foreach_piece(pwqp, &split_periods, &data) < 0)
3665 isl_pw_qpolynomial_free(pwqp);
3669 isl_pw_qpolynomial_free(data.res);
3670 isl_pw_qpolynomial_free(pwqp);