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,
13 #include <isl_polynomial_private.h>
14 #include <isl_point_private.h>
16 #include <isl_map_private.h>
18 static unsigned pos(__isl_keep isl_dim *dim, enum isl_dim_type type)
21 case isl_dim_param: return 0;
22 case isl_dim_in: return dim->nparam;
23 case isl_dim_out: return dim->nparam + dim->n_in;
27 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
35 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
40 isl_assert(up->ctx, up->var < 0, return NULL);
42 return (struct isl_upoly_cst *)up;
45 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
50 isl_assert(up->ctx, up->var >= 0, return NULL);
52 return (struct isl_upoly_rec *)up;
55 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
56 __isl_keep struct isl_upoly *up2)
59 struct isl_upoly_rec *rec1, *rec2;
65 if (up1->var != up2->var)
67 if (isl_upoly_is_cst(up1)) {
68 struct isl_upoly_cst *cst1, *cst2;
69 cst1 = isl_upoly_as_cst(up1);
70 cst2 = isl_upoly_as_cst(up2);
73 return isl_int_eq(cst1->n, cst2->n) &&
74 isl_int_eq(cst1->d, cst2->d);
77 rec1 = isl_upoly_as_rec(up1);
78 rec2 = isl_upoly_as_rec(up2);
82 if (rec1->n != rec2->n)
85 for (i = 0; i < rec1->n; ++i) {
86 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
94 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
96 struct isl_upoly_cst *cst;
100 if (!isl_upoly_is_cst(up))
103 cst = isl_upoly_as_cst(up);
107 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
110 int isl_upoly_sgn(__isl_keep struct isl_upoly *up)
112 struct isl_upoly_cst *cst;
116 if (!isl_upoly_is_cst(up))
119 cst = isl_upoly_as_cst(up);
123 return isl_int_sgn(cst->n);
126 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
128 struct isl_upoly_cst *cst;
132 if (!isl_upoly_is_cst(up))
135 cst = isl_upoly_as_cst(up);
139 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
142 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
144 struct isl_upoly_cst *cst;
148 if (!isl_upoly_is_cst(up))
151 cst = isl_upoly_as_cst(up);
155 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
158 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
160 struct isl_upoly_cst *cst;
164 if (!isl_upoly_is_cst(up))
167 cst = isl_upoly_as_cst(up);
171 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
174 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
176 struct isl_upoly_cst *cst;
180 if (!isl_upoly_is_cst(up))
183 cst = isl_upoly_as_cst(up);
187 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
190 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
192 struct isl_upoly_cst *cst;
196 if (!isl_upoly_is_cst(up))
199 cst = isl_upoly_as_cst(up);
203 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
206 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
208 struct isl_upoly_cst *cst;
210 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
219 isl_int_init(cst->n);
220 isl_int_init(cst->d);
225 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
227 struct isl_upoly_cst *cst;
229 cst = isl_upoly_cst_alloc(ctx);
233 isl_int_set_si(cst->n, 0);
234 isl_int_set_si(cst->d, 1);
239 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
241 struct isl_upoly_cst *cst;
243 cst = isl_upoly_cst_alloc(ctx);
247 isl_int_set_si(cst->n, 1);
248 isl_int_set_si(cst->d, 0);
253 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
255 struct isl_upoly_cst *cst;
257 cst = isl_upoly_cst_alloc(ctx);
261 isl_int_set_si(cst->n, 0);
262 isl_int_set_si(cst->d, 0);
267 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
268 isl_int n, isl_int d)
270 struct isl_upoly_cst *cst;
272 cst = isl_upoly_cst_alloc(ctx);
276 isl_int_set(cst->n, n);
277 isl_int_set(cst->d, d);
282 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
285 struct isl_upoly_rec *rec;
287 isl_assert(ctx, var >= 0, return NULL);
288 isl_assert(ctx, size >= 0, return NULL);
289 rec = isl_calloc(dim->ctx, struct isl_upoly_rec,
290 sizeof(struct isl_upoly_rec) +
291 (size - 1) * sizeof(struct isl_upoly *));
305 isl_upoly_free(&rec->up);
309 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
311 return qp ? isl_upoly_is_zero(qp->upoly) : -1;
314 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
316 return qp ? isl_upoly_is_one(qp->upoly) : -1;
319 int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
321 return qp ? isl_upoly_is_nan(qp->upoly) : -1;
324 int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
326 return qp ? isl_upoly_is_infty(qp->upoly) : -1;
329 int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
331 return qp ? isl_upoly_is_neginfty(qp->upoly) : -1;
334 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
336 return qp ? isl_upoly_sgn(qp->upoly) : 0;
339 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
341 isl_int_clear(cst->n);
342 isl_int_clear(cst->d);
345 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
349 for (i = 0; i < rec->n; ++i)
350 isl_upoly_free(rec->p[i]);
353 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
362 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
364 struct isl_upoly_cst *cst;
365 struct isl_upoly_cst *dup;
367 cst = isl_upoly_as_cst(up);
371 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
374 isl_int_set(dup->n, cst->n);
375 isl_int_set(dup->d, cst->d);
380 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
383 struct isl_upoly_rec *rec;
384 struct isl_upoly_rec *dup;
386 rec = isl_upoly_as_rec(up);
390 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
394 for (i = 0; i < rec->n; ++i) {
395 dup->p[i] = isl_upoly_copy(rec->p[i]);
403 isl_upoly_free(&dup->up);
407 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
409 struct isl_upoly *dup;
414 if (isl_upoly_is_cst(up))
415 return isl_upoly_dup_cst(up);
417 return isl_upoly_dup_rec(up);
420 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
428 return isl_upoly_dup(up);
431 void isl_upoly_free(__isl_take struct isl_upoly *up)
440 upoly_free_cst((struct isl_upoly_cst *)up);
442 upoly_free_rec((struct isl_upoly_rec *)up);
444 isl_ctx_deref(up->ctx);
448 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
453 isl_int_gcd(gcd, cst->n, cst->d);
454 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
455 isl_int_divexact(cst->n, cst->n, gcd);
456 isl_int_divexact(cst->d, cst->d, gcd);
461 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
462 __isl_take struct isl_upoly *up2)
464 struct isl_upoly_cst *cst1;
465 struct isl_upoly_cst *cst2;
467 up1 = isl_upoly_cow(up1);
471 cst1 = isl_upoly_as_cst(up1);
472 cst2 = isl_upoly_as_cst(up2);
474 if (isl_int_eq(cst1->d, cst2->d))
475 isl_int_add(cst1->n, cst1->n, cst2->n);
477 isl_int_mul(cst1->n, cst1->n, cst2->d);
478 isl_int_addmul(cst1->n, cst2->n, cst1->d);
479 isl_int_mul(cst1->d, cst1->d, cst2->d);
482 isl_upoly_cst_reduce(cst1);
492 static __isl_give struct isl_upoly *replace_by_zero(
493 __isl_take struct isl_upoly *up)
501 return isl_upoly_zero(ctx);
504 static __isl_give struct isl_upoly *replace_by_constant_term(
505 __isl_take struct isl_upoly *up)
507 struct isl_upoly_rec *rec;
508 struct isl_upoly *cst;
513 rec = isl_upoly_as_rec(up);
516 cst = isl_upoly_copy(rec->p[0]);
524 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
525 __isl_take struct isl_upoly *up2)
528 struct isl_upoly_rec *rec1, *rec2;
533 if (isl_upoly_is_nan(up1)) {
538 if (isl_upoly_is_nan(up2)) {
543 if (isl_upoly_is_zero(up1)) {
548 if (isl_upoly_is_zero(up2)) {
553 if (up1->var < up2->var)
554 return isl_upoly_sum(up2, up1);
556 if (up2->var < up1->var) {
557 struct isl_upoly_rec *rec;
558 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
562 up1 = isl_upoly_cow(up1);
563 rec = isl_upoly_as_rec(up1);
566 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
568 up1 = replace_by_constant_term(up1);
572 if (isl_upoly_is_cst(up1))
573 return isl_upoly_sum_cst(up1, up2);
575 rec1 = isl_upoly_as_rec(up1);
576 rec2 = isl_upoly_as_rec(up2);
580 if (rec1->n < rec2->n)
581 return isl_upoly_sum(up2, up1);
583 up1 = isl_upoly_cow(up1);
584 rec1 = isl_upoly_as_rec(up1);
588 for (i = rec2->n - 1; i >= 0; --i) {
589 rec1->p[i] = isl_upoly_sum(rec1->p[i],
590 isl_upoly_copy(rec2->p[i]));
593 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
594 isl_upoly_free(rec1->p[i]);
600 up1 = replace_by_zero(up1);
601 else if (rec1->n == 1)
602 up1 = replace_by_constant_term(up1);
613 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
615 struct isl_upoly_cst *cst;
617 if (isl_upoly_is_zero(up))
620 up = isl_upoly_cow(up);
624 cst = isl_upoly_as_cst(up);
626 isl_int_neg(cst->n, cst->n);
631 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
634 struct isl_upoly_rec *rec;
639 if (isl_upoly_is_cst(up))
640 return isl_upoly_neg_cst(up);
642 up = isl_upoly_cow(up);
643 rec = isl_upoly_as_rec(up);
647 for (i = 0; i < rec->n; ++i) {
648 rec->p[i] = isl_upoly_neg(rec->p[i]);
659 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
660 __isl_take struct isl_upoly *up2)
662 struct isl_upoly_cst *cst1;
663 struct isl_upoly_cst *cst2;
665 up1 = isl_upoly_cow(up1);
669 cst1 = isl_upoly_as_cst(up1);
670 cst2 = isl_upoly_as_cst(up2);
672 isl_int_mul(cst1->n, cst1->n, cst2->n);
673 isl_int_mul(cst1->d, cst1->d, cst2->d);
675 isl_upoly_cst_reduce(cst1);
685 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
686 __isl_take struct isl_upoly *up2)
688 struct isl_upoly_rec *rec1;
689 struct isl_upoly_rec *rec2;
690 struct isl_upoly_rec *res;
694 rec1 = isl_upoly_as_rec(up1);
695 rec2 = isl_upoly_as_rec(up2);
698 size = rec1->n + rec2->n - 1;
699 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
703 for (i = 0; i < rec1->n; ++i) {
704 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
705 isl_upoly_copy(rec1->p[i]));
710 for (; i < size; ++i) {
711 res->p[i] = isl_upoly_zero(up1->ctx);
716 for (i = 0; i < rec1->n; ++i) {
717 for (j = 1; j < rec2->n; ++j) {
718 struct isl_upoly *up;
719 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
720 isl_upoly_copy(rec1->p[i]));
721 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
734 isl_upoly_free(&res->up);
738 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
739 __isl_take struct isl_upoly *up2)
744 if (isl_upoly_is_nan(up1)) {
749 if (isl_upoly_is_nan(up2)) {
754 if (isl_upoly_is_zero(up1)) {
759 if (isl_upoly_is_zero(up2)) {
764 if (isl_upoly_is_one(up1)) {
769 if (isl_upoly_is_one(up2)) {
774 if (up1->var < up2->var)
775 return isl_upoly_mul(up2, up1);
777 if (up2->var < up1->var) {
779 struct isl_upoly_rec *rec;
780 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
781 isl_ctx *ctx = up1->ctx;
784 return isl_upoly_nan(ctx);
786 up1 = isl_upoly_cow(up1);
787 rec = isl_upoly_as_rec(up1);
791 for (i = 0; i < rec->n; ++i) {
792 rec->p[i] = isl_upoly_mul(rec->p[i],
793 isl_upoly_copy(up2));
801 if (isl_upoly_is_cst(up1))
802 return isl_upoly_mul_cst(up1, up2);
804 return isl_upoly_mul_rec(up1, up2);
811 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
812 unsigned n_div, __isl_take struct isl_upoly *up)
814 struct isl_qpolynomial *qp = NULL;
820 total = isl_dim_total(dim);
822 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
827 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
838 isl_qpolynomial_free(qp);
842 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
851 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
853 struct isl_qpolynomial *dup;
858 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row,
859 isl_upoly_copy(qp->upoly));
862 isl_mat_free(dup->div);
863 dup->div = isl_mat_copy(qp->div);
869 isl_qpolynomial_free(dup);
873 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
881 return isl_qpolynomial_dup(qp);
884 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
892 isl_dim_free(qp->dim);
893 isl_mat_free(qp->div);
894 isl_upoly_free(qp->upoly);
899 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
904 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
905 div1->n_col >= div2->n_col, return -1);
907 if (div1->n_row == div2->n_row)
908 return isl_mat_is_equal(div1, div2);
912 div1->n_row = div2->n_row;
913 div1->n_col = div2->n_col;
915 equal = isl_mat_is_equal(div1, div2);
923 static void expand_row(__isl_keep isl_mat *dst, int d,
924 __isl_keep isl_mat *src, int s, int *exp)
927 unsigned c = src->n_col - src->n_row;
929 isl_seq_cpy(dst->row[d], src->row[s], c);
930 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
932 for (i = 0; i < s; ++i)
933 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
936 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
940 li = isl_seq_last_non_zero(div->row[i], div->n_col);
941 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
946 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
949 struct isl_div_sort_info {
954 static int div_sort_cmp(const void *p1, const void *p2)
956 const struct isl_div_sort_info *i1, *i2;
957 i1 = (const struct isl_div_sort_info *) p1;
958 i2 = (const struct isl_div_sort_info *) p2;
960 return cmp_row(i1->div, i1->row, i2->row);
963 static __isl_give isl_mat *sort_divs(__isl_take isl_mat *div)
966 struct isl_div_sort_info *array = NULL;
974 array = isl_alloc_array(div->ctx, struct isl_div_sort_info, div->n_row);
975 pos = isl_alloc_array(div->ctx, int, div->n_row);
979 for (i = 0; i < div->n_row; ++i) {
985 qsort(array, div->n_row, sizeof(struct isl_div_sort_info),
988 for (i = 0; i < div->n_row; ++i) {
990 if (pos[array[i].row] == i)
992 div = isl_mat_cow(div);
993 div = isl_mat_swap_rows(div, i, pos[array[i].row]);
994 t = pos[array[i].row];
995 pos[array[i].row] = pos[i];
1009 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
1010 __isl_keep isl_mat *div2, int *exp1, int *exp2)
1013 isl_mat *div = NULL;
1014 unsigned d = div1->n_col - div1->n_row;
1016 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
1017 d + div1->n_row + div2->n_row);
1021 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
1024 expand_row(div, k, div1, i, exp1);
1025 expand_row(div, k + 1, div2, j, exp2);
1027 cmp = cmp_row(div, k, k + 1);
1031 } else if (cmp < 0) {
1035 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1038 for (; i < div1->n_row; ++i, ++k) {
1039 expand_row(div, k, div1, i, exp1);
1042 for (; j < div2->n_row; ++j, ++k) {
1043 expand_row(div, k, div2, j, exp2);
1053 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1054 int *exp, int first)
1057 struct isl_upoly_rec *rec;
1059 if (isl_upoly_is_cst(up))
1062 if (up->var < first)
1065 if (exp[up->var - first] == up->var - first)
1068 up = isl_upoly_cow(up);
1072 up->var = exp[up->var - first] + first;
1074 rec = isl_upoly_as_rec(up);
1078 for (i = 0; i < rec->n; ++i) {
1079 rec->p[i] = expand(rec->p[i], exp, first);
1090 static __isl_give isl_qpolynomial *with_merged_divs(
1091 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1092 __isl_take isl_qpolynomial *qp2),
1093 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1097 isl_mat *div = NULL;
1099 qp1 = isl_qpolynomial_cow(qp1);
1100 qp2 = isl_qpolynomial_cow(qp2);
1105 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1106 qp1->div->n_col >= qp2->div->n_col, goto error);
1108 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1109 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1113 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1117 isl_mat_free(qp1->div);
1118 qp1->div = isl_mat_copy(div);
1119 isl_mat_free(qp2->div);
1120 qp2->div = isl_mat_copy(div);
1122 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1123 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1125 if (!qp1->upoly || !qp2->upoly)
1132 return fn(qp1, qp2);
1137 isl_qpolynomial_free(qp1);
1138 isl_qpolynomial_free(qp2);
1142 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1143 __isl_take isl_qpolynomial *qp2)
1145 qp1 = isl_qpolynomial_cow(qp1);
1150 if (qp1->div->n_row < qp2->div->n_row)
1151 return isl_qpolynomial_add(qp2, qp1);
1153 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1154 if (!compatible_divs(qp1->div, qp2->div))
1155 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1157 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1161 isl_qpolynomial_free(qp2);
1165 isl_qpolynomial_free(qp1);
1166 isl_qpolynomial_free(qp2);
1170 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1171 __isl_take isl_qpolynomial *qp2)
1173 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1176 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1178 qp = isl_qpolynomial_cow(qp);
1183 qp->upoly = isl_upoly_neg(qp->upoly);
1189 isl_qpolynomial_free(qp);
1193 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1194 __isl_take isl_qpolynomial *qp2)
1196 qp1 = isl_qpolynomial_cow(qp1);
1201 if (qp1->div->n_row < qp2->div->n_row)
1202 return isl_qpolynomial_mul(qp2, qp1);
1204 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1205 if (!compatible_divs(qp1->div, qp2->div))
1206 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1208 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1212 isl_qpolynomial_free(qp2);
1216 isl_qpolynomial_free(qp1);
1217 isl_qpolynomial_free(qp2);
1221 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1223 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1226 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1228 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1231 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1233 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1236 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1239 struct isl_qpolynomial *qp;
1240 struct isl_upoly_cst *cst;
1242 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1246 cst = isl_upoly_as_cst(qp->upoly);
1247 isl_int_set(cst->n, v);
1251 isl_qpolynomial_free(qp);
1255 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1256 isl_int *n, isl_int *d)
1258 struct isl_upoly_cst *cst;
1263 if (!isl_upoly_is_cst(qp->upoly))
1266 cst = isl_upoly_as_cst(qp->upoly);
1271 isl_int_set(*n, cst->n);
1273 isl_int_set(*d, cst->d);
1278 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1281 struct isl_upoly_rec *rec;
1289 rec = isl_upoly_as_rec(up);
1296 isl_assert(up->ctx, rec->n > 1, return -1);
1298 is_cst = isl_upoly_is_cst(rec->p[1]);
1304 return isl_upoly_is_affine(rec->p[0]);
1307 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1312 if (qp->div->n_row > 0)
1315 return isl_upoly_is_affine(qp->upoly);
1318 static void update_coeff(__isl_keep isl_vec *aff,
1319 __isl_keep struct isl_upoly_cst *cst, int pos)
1324 if (isl_int_is_zero(cst->n))
1329 isl_int_gcd(gcd, cst->d, aff->el[0]);
1330 isl_int_divexact(f, cst->d, gcd);
1331 isl_int_divexact(gcd, aff->el[0], gcd);
1332 isl_seq_scale(aff->el, aff->el, f, aff->size);
1333 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1338 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1339 __isl_keep isl_vec *aff)
1341 struct isl_upoly_cst *cst;
1342 struct isl_upoly_rec *rec;
1348 struct isl_upoly_cst *cst;
1350 cst = isl_upoly_as_cst(up);
1353 update_coeff(aff, cst, 0);
1357 rec = isl_upoly_as_rec(up);
1360 isl_assert(up->ctx, rec->n == 2, return -1);
1362 cst = isl_upoly_as_cst(rec->p[1]);
1365 update_coeff(aff, cst, 1 + up->var);
1367 return isl_upoly_update_affine(rec->p[0], aff);
1370 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1371 __isl_keep isl_qpolynomial *qp)
1379 isl_assert(qp->div->ctx, qp->div->n_row == 0, return NULL);
1380 d = isl_dim_total(qp->dim);
1381 aff = isl_vec_alloc(qp->div->ctx, 2 + d);
1385 isl_seq_clr(aff->el + 1, 1 + d);
1386 isl_int_set_si(aff->el[0], 1);
1388 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1397 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1398 __isl_keep isl_qpolynomial *qp2)
1403 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1406 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1409 struct isl_upoly_rec *rec;
1411 if (isl_upoly_is_cst(up)) {
1412 struct isl_upoly_cst *cst;
1413 cst = isl_upoly_as_cst(up);
1416 isl_int_lcm(*d, *d, cst->d);
1420 rec = isl_upoly_as_rec(up);
1424 for (i = 0; i < rec->n; ++i)
1425 upoly_update_den(rec->p[i], d);
1428 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1430 isl_int_set_si(*d, 1);
1433 upoly_update_den(qp->upoly, d);
1436 __isl_give struct isl_upoly *isl_upoly_pow(isl_ctx *ctx, int pos, int power)
1439 struct isl_upoly *up;
1440 struct isl_upoly_rec *rec;
1441 struct isl_upoly_cst *cst;
1443 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
1446 for (i = 0; i < 1 + power; ++i) {
1447 rec->p[i] = isl_upoly_zero(ctx);
1452 cst = isl_upoly_as_cst(rec->p[power]);
1453 isl_int_set_si(cst->n, 1);
1457 isl_upoly_free(&rec->up);
1461 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1464 struct isl_ctx *ctx;
1471 return isl_qpolynomial_alloc(dim, 0, isl_upoly_pow(ctx, pos, power));
1474 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1475 enum isl_dim_type type, unsigned pos)
1480 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1481 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1483 if (type == isl_dim_set)
1484 pos += isl_dim_size(dim, isl_dim_param);
1486 return isl_qpolynomial_pow(dim, pos, 1);
1492 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1495 struct isl_qpolynomial *qp = NULL;
1496 struct isl_upoly_rec *rec;
1497 struct isl_upoly_cst *cst;
1503 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1505 pos = isl_dim_total(div->bmap->dim);
1506 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
1507 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1,
1512 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1513 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1515 for (i = 0; i < 1 + power; ++i) {
1516 rec->p[i] = isl_upoly_zero(div->ctx);
1521 cst = isl_upoly_as_cst(rec->p[power]);
1522 isl_int_set_si(cst->n, 1);
1528 isl_qpolynomial_free(qp);
1533 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1535 return isl_qpolynomial_div_pow(div, 1);
1538 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1539 const isl_int n, const isl_int d)
1541 struct isl_qpolynomial *qp;
1542 struct isl_upoly_cst *cst;
1544 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1548 cst = isl_upoly_as_cst(qp->upoly);
1549 isl_int_set(cst->n, n);
1550 isl_int_set(cst->d, d);
1554 isl_qpolynomial_free(qp);
1558 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1560 struct isl_upoly_rec *rec;
1566 if (isl_upoly_is_cst(up))
1570 active[up->var] = 1;
1572 rec = isl_upoly_as_rec(up);
1573 for (i = 0; i < rec->n; ++i)
1574 if (up_set_active(rec->p[i], active, d) < 0)
1580 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1583 int d = isl_dim_total(qp->dim);
1588 for (i = 0; i < d; ++i)
1589 for (j = 0; j < qp->div->n_row; ++j) {
1590 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1596 return up_set_active(qp->upoly, active, d);
1599 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1600 enum isl_dim_type type, unsigned first, unsigned n)
1611 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1613 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1614 type == isl_dim_set, return -1);
1616 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1617 if (set_active(qp, active) < 0)
1620 if (type == isl_dim_set)
1621 first += isl_dim_size(qp->dim, isl_dim_param);
1622 for (i = 0; i < n; ++i)
1623 if (active[first + i]) {
1636 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1637 unsigned first, unsigned n)
1640 struct isl_upoly_rec *rec;
1644 if (n == 0 || up->var < 0 || up->var < first)
1646 if (up->var < first + n) {
1647 up = replace_by_constant_term(up);
1648 return isl_upoly_drop(up, first, n);
1650 up = isl_upoly_cow(up);
1654 rec = isl_upoly_as_rec(up);
1658 for (i = 0; i < rec->n; ++i) {
1659 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1670 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1671 __isl_take isl_qpolynomial *qp,
1672 enum isl_dim_type type, unsigned first, unsigned n)
1679 qp = isl_qpolynomial_cow(qp);
1683 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1685 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1686 type == isl_dim_set, goto error);
1688 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1692 if (type == isl_dim_set)
1693 first += isl_dim_size(qp->dim, isl_dim_param);
1695 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1699 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1705 isl_qpolynomial_free(qp);
1710 #define PW isl_pw_qpolynomial
1712 #define EL isl_qpolynomial
1714 #define IS_ZERO is_zero
1718 #define ADD(d,e1,e2) isl_qpolynomial_add(e1,e2)
1720 #include <isl_pw_templ.c>
1722 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
1730 if (!isl_set_fast_is_universe(pwqp->p[0].set))
1733 return isl_qpolynomial_is_one(pwqp->p[0].qp);
1736 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
1737 __isl_take isl_pw_qpolynomial *pwqp1,
1738 __isl_take isl_pw_qpolynomial *pwqp2)
1741 struct isl_pw_qpolynomial *res;
1744 if (!pwqp1 || !pwqp2)
1747 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
1750 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
1751 isl_pw_qpolynomial_free(pwqp2);
1755 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
1756 isl_pw_qpolynomial_free(pwqp1);
1760 if (isl_pw_qpolynomial_is_one(pwqp1)) {
1761 isl_pw_qpolynomial_free(pwqp1);
1765 if (isl_pw_qpolynomial_is_one(pwqp2)) {
1766 isl_pw_qpolynomial_free(pwqp2);
1770 n = pwqp1->n * pwqp2->n;
1771 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
1773 for (i = 0; i < pwqp1->n; ++i) {
1774 for (j = 0; j < pwqp2->n; ++j) {
1775 struct isl_set *common;
1776 struct isl_qpolynomial *prod;
1777 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
1778 isl_set_copy(pwqp2->p[j].set));
1779 if (isl_set_fast_is_empty(common)) {
1780 isl_set_free(common);
1784 prod = isl_qpolynomial_mul(
1785 isl_qpolynomial_copy(pwqp1->p[i].qp),
1786 isl_qpolynomial_copy(pwqp2->p[j].qp));
1788 res = isl_pw_qpolynomial_add_piece(res, common, prod);
1792 isl_pw_qpolynomial_free(pwqp1);
1793 isl_pw_qpolynomial_free(pwqp2);
1797 isl_pw_qpolynomial_free(pwqp1);
1798 isl_pw_qpolynomial_free(pwqp2);
1802 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
1803 __isl_take isl_pw_qpolynomial *pwqp)
1806 struct isl_pw_qpolynomial *res;
1812 if (isl_pw_qpolynomial_is_zero(pwqp))
1815 pwqp = isl_pw_qpolynomial_cow(pwqp);
1817 for (i = 0; i < pwqp->n; ++i) {
1818 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
1825 isl_pw_qpolynomial_free(pwqp);
1829 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
1830 __isl_take isl_pw_qpolynomial *pwqp1,
1831 __isl_take isl_pw_qpolynomial *pwqp2)
1833 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
1836 __isl_give struct isl_upoly *isl_upoly_eval(
1837 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
1840 struct isl_upoly_rec *rec;
1841 struct isl_upoly *res;
1842 struct isl_upoly *base;
1844 if (isl_upoly_is_cst(up)) {
1849 rec = isl_upoly_as_rec(up);
1853 isl_assert(up->ctx, rec->n >= 1, goto error);
1855 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
1857 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
1860 for (i = rec->n - 2; i >= 0; --i) {
1861 res = isl_upoly_mul(res, isl_upoly_copy(base));
1862 res = isl_upoly_sum(res,
1863 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
1864 isl_vec_copy(vec)));
1867 isl_upoly_free(base);
1877 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
1878 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
1881 struct isl_upoly *up;
1886 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
1888 if (qp->div->n_row == 0)
1889 ext = isl_vec_copy(pnt->vec);
1892 unsigned dim = isl_dim_total(qp->dim);
1893 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
1897 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
1898 for (i = 0; i < qp->div->n_row; ++i) {
1899 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
1900 1 + dim + i, &ext->el[1+dim+i]);
1901 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
1902 qp->div->row[i][0]);
1906 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
1910 dim = isl_dim_copy(qp->dim);
1911 isl_qpolynomial_free(qp);
1912 isl_point_free(pnt);
1914 return isl_qpolynomial_alloc(dim, 0, up);
1916 isl_qpolynomial_free(qp);
1917 isl_point_free(pnt);
1921 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
1922 __isl_keep struct isl_upoly_cst *cst2)
1927 isl_int_mul(t, cst1->n, cst2->d);
1928 isl_int_submul(t, cst2->n, cst1->d);
1929 cmp = isl_int_sgn(t);
1934 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
1935 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1937 struct isl_upoly_cst *cst1, *cst2;
1942 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1943 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1944 cst1 = isl_upoly_as_cst(qp1->upoly);
1945 cst2 = isl_upoly_as_cst(qp2->upoly);
1946 cmp = isl_upoly_cmp(cst1, cst2);
1949 isl_qpolynomial_free(qp2);
1951 isl_qpolynomial_free(qp1);
1956 isl_qpolynomial_free(qp1);
1957 isl_qpolynomial_free(qp2);
1961 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
1962 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1964 struct isl_upoly_cst *cst1, *cst2;
1969 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1970 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1971 cst1 = isl_upoly_as_cst(qp1->upoly);
1972 cst2 = isl_upoly_as_cst(qp2->upoly);
1973 cmp = isl_upoly_cmp(cst1, cst2);
1976 isl_qpolynomial_free(qp2);
1978 isl_qpolynomial_free(qp1);
1983 isl_qpolynomial_free(qp1);
1984 isl_qpolynomial_free(qp2);
1988 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
1989 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
1998 qp = isl_qpolynomial_cow(qp);
2002 g_pos = pos(qp->dim, type) + isl_dim_size(qp->dim, type);
2004 qp->div = isl_mat_insert_cols(qp->div, 2 + g_pos, n);
2008 total = qp->div->n_col - 2;
2009 if (total > g_pos) {
2011 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2014 for (i = 0; i < total - g_pos; ++i)
2016 qp->upoly = expand(qp->upoly, exp, g_pos);
2022 qp->dim = isl_dim_add(qp->dim, type, n);
2028 isl_qpolynomial_free(qp);
2032 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2033 __isl_take isl_pw_qpolynomial *pwqp,
2034 enum isl_dim_type type, unsigned n)
2041 pwqp = isl_pw_qpolynomial_cow(pwqp);
2045 pwqp->dim = isl_dim_add(pwqp->dim, type, n);
2049 for (i = 0; i < pwqp->n; ++i) {
2050 pwqp->p[i].set = isl_set_add(pwqp->p[i].set, type, n);
2051 if (!pwqp->p[i].set)
2053 pwqp->p[i].qp = isl_qpolynomial_add_dims(pwqp->p[i].qp, type, n);
2060 isl_pw_qpolynomial_free(pwqp);
2064 static int *reordering_move(isl_ctx *ctx,
2065 unsigned len, unsigned dst, unsigned src, unsigned n)
2070 reordering = isl_alloc_array(ctx, int, len);
2075 for (i = 0; i < dst; ++i)
2077 for (i = 0; i < n; ++i)
2078 reordering[src + i] = dst + i;
2079 for (i = 0; i < src - dst; ++i)
2080 reordering[dst + i] = dst + n + i;
2081 for (i = 0; i < len - src - n; ++i)
2082 reordering[src + n + i] = src + n + i;
2084 for (i = 0; i < src; ++i)
2086 for (i = 0; i < n; ++i)
2087 reordering[src + i] = dst + i;
2088 for (i = 0; i < dst - src; ++i)
2089 reordering[src + n + i] = src + i;
2090 for (i = 0; i < len - dst - n; ++i)
2091 reordering[dst + n + i] = dst + n + i;
2097 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
2101 struct isl_upoly_rec *rec;
2102 struct isl_upoly *base;
2103 struct isl_upoly *res;
2105 if (isl_upoly_is_cst(up))
2108 rec = isl_upoly_as_rec(up);
2112 isl_assert(up->ctx, rec->n >= 1, goto error);
2114 base = isl_upoly_pow(up->ctx, r[up->var], 1);
2115 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
2117 for (i = rec->n - 2; i >= 0; --i) {
2118 res = isl_upoly_mul(res, isl_upoly_copy(base));
2119 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
2122 isl_upoly_free(base);
2131 __isl_give isl_qpolynomial *isl_qpolynomial_move(__isl_take isl_qpolynomial *qp,
2132 enum isl_dim_type dst_type, unsigned dst_pos,
2133 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2139 qp = isl_qpolynomial_cow(qp);
2143 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2146 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2147 g_src_pos = pos(qp->dim, src_type) + src_pos;
2148 if (dst_type > src_type)
2151 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2152 qp->div = sort_divs(qp->div);
2156 reordering = reordering_move(qp->dim->ctx,
2157 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2161 qp->upoly = reorder(qp->upoly, reordering);
2166 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2172 isl_qpolynomial_free(qp);
2176 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_move(
2177 __isl_take isl_pw_qpolynomial *pwqp,
2178 enum isl_dim_type dst_type, unsigned dst_pos,
2179 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2183 pwqp = isl_pw_qpolynomial_cow(pwqp);
2187 pwqp->dim = isl_dim_move(pwqp->dim,
2188 dst_type, dst_pos, src_type, src_pos, n);
2192 for (i = 0; i < pwqp->n; ++i) {
2193 pwqp->p[i].set = isl_set_move(pwqp->p[i].set, dst_type, dst_pos,
2194 src_type, src_pos, n);
2195 if (!pwqp->p[i].set)
2197 pwqp->p[i].qp = isl_qpolynomial_move(pwqp->p[i].qp,
2198 dst_type, dst_pos, src_type, src_pos, n);
2205 isl_pw_qpolynomial_free(pwqp);
2209 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2210 __isl_take isl_mat *div)
2218 n = isl_dim_total(dim) + div->n_row;
2220 term = isl_calloc(dim->ctx, struct isl_term,
2221 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2228 isl_int_init(term->n);
2229 isl_int_init(term->d);
2238 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
2247 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
2256 total = isl_dim_total(term->dim) + term->div->n_row;
2258 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
2262 isl_int_set(dup->n, term->n);
2263 isl_int_set(dup->d, term->d);
2265 for (i = 0; i < total; ++i)
2266 dup->pow[i] = term->pow[i];
2271 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
2279 return isl_term_dup(term);
2282 void isl_term_free(__isl_take isl_term *term)
2287 if (--term->ref > 0)
2290 isl_dim_free(term->dim);
2291 isl_mat_free(term->div);
2292 isl_int_clear(term->n);
2293 isl_int_clear(term->d);
2297 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
2305 case isl_dim_out: return isl_dim_size(term->dim, type);
2306 case isl_dim_div: return term->div->n_row;
2307 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
2311 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
2313 return term ? term->dim->ctx : NULL;
2316 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
2320 isl_int_set(*n, term->n);
2323 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
2327 isl_int_set(*d, term->d);
2330 int isl_term_get_exp(__isl_keep isl_term *term,
2331 enum isl_dim_type type, unsigned pos)
2336 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
2338 if (type >= isl_dim_set)
2339 pos += isl_dim_size(term->dim, isl_dim_param);
2340 if (type >= isl_dim_div)
2341 pos += isl_dim_size(term->dim, isl_dim_set);
2343 return term->pow[pos];
2346 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
2348 isl_basic_map *bmap;
2355 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
2358 total = term->div->n_col - term->div->n_row - 2;
2359 /* No nested divs for now */
2360 isl_assert(term->dim->ctx,
2361 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
2362 term->div->n_row) == -1,
2365 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
2366 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
2369 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
2371 return isl_basic_map_div(bmap, k);
2373 isl_basic_map_free(bmap);
2377 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
2378 int (*fn)(__isl_take isl_term *term, void *user),
2379 __isl_take isl_term *term, void *user)
2382 struct isl_upoly_rec *rec;
2387 if (isl_upoly_is_zero(up))
2390 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
2391 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
2392 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
2394 if (isl_upoly_is_cst(up)) {
2395 struct isl_upoly_cst *cst;
2396 cst = isl_upoly_as_cst(up);
2399 term = isl_term_cow(term);
2402 isl_int_set(term->n, cst->n);
2403 isl_int_set(term->d, cst->d);
2404 if (fn(isl_term_copy(term), user) < 0)
2409 rec = isl_upoly_as_rec(up);
2413 for (i = 0; i < rec->n; ++i) {
2414 term = isl_term_cow(term);
2417 term->pow[up->var] = i;
2418 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
2422 term->pow[up->var] = 0;
2426 isl_term_free(term);
2430 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
2431 int (*fn)(__isl_take isl_term *term, void *user), void *user)
2438 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
2442 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
2444 isl_term_free(term);
2446 return term ? 0 : -1;
2449 int isl_pw_qpolynomial_foreach_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2450 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2451 void *user), void *user)
2458 for (i = 0; i < pwqp->n; ++i)
2459 if (fn(isl_set_copy(pwqp->p[i].set),
2460 isl_qpolynomial_copy(pwqp->p[i].qp), user) < 0)
2466 static int any_divs(__isl_keep isl_set *set)
2473 for (i = 0; i < set->n; ++i)
2474 if (set->p[i]->n_div > 0)
2480 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
2481 __isl_take isl_dim *dim)
2486 if (isl_dim_equal(qp->dim, dim)) {
2491 qp = isl_qpolynomial_cow(qp);
2495 if (qp->div->n_row) {
2501 extra = isl_dim_size(dim, isl_dim_set) -
2502 isl_dim_size(qp->dim, isl_dim_set);
2503 total = isl_dim_total(qp->dim);
2504 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
2507 for (i = 0; i < qp->div->n_row; ++i)
2509 qp->upoly = expand(qp->upoly, exp, total);
2513 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
2516 for (i = 0; i < qp->div->n_row; ++i)
2517 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
2520 isl_dim_free(qp->dim);
2526 isl_qpolynomial_free(qp);
2530 static int foreach_lifted_subset(__isl_take isl_set *set,
2531 __isl_take isl_qpolynomial *qp,
2532 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2533 void *user), void *user)
2540 for (i = 0; i < set->n; ++i) {
2542 isl_qpolynomial *copy;
2544 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
2545 lift = isl_set_lift(lift);
2547 copy = isl_qpolynomial_copy(qp);
2548 copy = isl_qpolynomial_lift(copy, isl_set_get_dim(lift));
2550 if (fn(lift, copy, user) < 0)
2555 isl_qpolynomial_free(qp);
2560 isl_qpolynomial_free(qp);
2564 int isl_pw_qpolynomial_foreach_lifted_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2565 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2566 void *user), void *user)
2573 for (i = 0; i < pwqp->n; ++i) {
2575 isl_qpolynomial *qp;
2577 set = isl_set_copy(pwqp->p[i].set);
2578 qp = isl_qpolynomial_copy(pwqp->p[i].qp);
2579 if (!any_divs(set)) {
2580 if (fn(set, qp, user) < 0)
2584 if (foreach_lifted_subset(set, qp, fn, user) < 0)
2591 /* For each parameter or variable that does not appear in qp,
2592 * first eliminate the variable from all constraints and then set it to zero.
2594 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
2595 __isl_keep isl_qpolynomial *qp)
2606 d = isl_dim_total(set->dim);
2607 active = isl_calloc_array(set->ctx, int, d);
2608 if (set_active(qp, active) < 0)
2611 for (i = 0; i < d; ++i)
2620 nparam = isl_dim_size(set->dim, isl_dim_param);
2621 nvar = isl_dim_size(set->dim, isl_dim_set);
2622 for (i = 0; i < nparam; ++i) {
2625 set = isl_set_eliminate(set, isl_dim_param, i, 1);
2626 set = isl_set_fix_si(set, isl_dim_param, i, 0);
2628 for (i = 0; i < nvar; ++i) {
2629 if (active[nparam + i])
2631 set = isl_set_eliminate(set, isl_dim_set, i, 1);
2632 set = isl_set_fix_si(set, isl_dim_set, i, 0);
2644 struct isl_opt_data {
2645 isl_qpolynomial *qp;
2647 isl_qpolynomial *opt;
2651 static int opt_fn(__isl_take isl_point *pnt, void *user)
2653 struct isl_opt_data *data = (struct isl_opt_data *)user;
2654 isl_qpolynomial *val;
2656 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
2660 } else if (data->max) {
2661 data->opt = isl_qpolynomial_max_cst(data->opt, val);
2663 data->opt = isl_qpolynomial_min_cst(data->opt, val);
2669 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
2670 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
2672 struct isl_opt_data data = { NULL, 1, NULL, max };
2677 if (isl_upoly_is_cst(qp->upoly)) {
2682 set = fix_inactive(set, qp);
2685 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
2689 isl_qpolynomial_free(qp);
2693 isl_qpolynomial_free(qp);
2694 isl_qpolynomial_free(data.opt);