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,
12 #include <isl_ctx_private.h>
13 #include <isl_map_private.h>
14 #include <isl_factorization.h>
17 #include <isl_union_map_private.h>
18 #include <isl_polynomial_private.h>
19 #include <isl_point_private.h>
20 #include <isl_dim_private.h>
21 #include <isl_div_private.h>
22 #include <isl_mat_private.h>
23 #include <isl_range.h>
24 #include <isl_local_space_private.h>
25 #include <isl_aff_private.h>
27 static unsigned pos(__isl_keep isl_dim *dim, enum isl_dim_type type)
30 case isl_dim_param: return 0;
31 case isl_dim_in: return dim->nparam;
32 case isl_dim_out: return dim->nparam + dim->n_in;
37 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
45 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
50 isl_assert(up->ctx, up->var < 0, return NULL);
52 return (struct isl_upoly_cst *)up;
55 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
60 isl_assert(up->ctx, up->var >= 0, return NULL);
62 return (struct isl_upoly_rec *)up;
65 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
66 __isl_keep struct isl_upoly *up2)
69 struct isl_upoly_rec *rec1, *rec2;
75 if (up1->var != up2->var)
77 if (isl_upoly_is_cst(up1)) {
78 struct isl_upoly_cst *cst1, *cst2;
79 cst1 = isl_upoly_as_cst(up1);
80 cst2 = isl_upoly_as_cst(up2);
83 return isl_int_eq(cst1->n, cst2->n) &&
84 isl_int_eq(cst1->d, cst2->d);
87 rec1 = isl_upoly_as_rec(up1);
88 rec2 = isl_upoly_as_rec(up2);
92 if (rec1->n != rec2->n)
95 for (i = 0; i < rec1->n; ++i) {
96 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
104 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
106 struct isl_upoly_cst *cst;
110 if (!isl_upoly_is_cst(up))
113 cst = isl_upoly_as_cst(up);
117 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
120 int isl_upoly_sgn(__isl_keep struct isl_upoly *up)
122 struct isl_upoly_cst *cst;
126 if (!isl_upoly_is_cst(up))
129 cst = isl_upoly_as_cst(up);
133 return isl_int_sgn(cst->n);
136 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
138 struct isl_upoly_cst *cst;
142 if (!isl_upoly_is_cst(up))
145 cst = isl_upoly_as_cst(up);
149 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
152 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
154 struct isl_upoly_cst *cst;
158 if (!isl_upoly_is_cst(up))
161 cst = isl_upoly_as_cst(up);
165 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
168 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
170 struct isl_upoly_cst *cst;
174 if (!isl_upoly_is_cst(up))
177 cst = isl_upoly_as_cst(up);
181 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
184 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
186 struct isl_upoly_cst *cst;
190 if (!isl_upoly_is_cst(up))
193 cst = isl_upoly_as_cst(up);
197 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
200 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
202 struct isl_upoly_cst *cst;
206 if (!isl_upoly_is_cst(up))
209 cst = isl_upoly_as_cst(up);
213 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
216 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
218 struct isl_upoly_cst *cst;
220 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
229 isl_int_init(cst->n);
230 isl_int_init(cst->d);
235 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
237 struct isl_upoly_cst *cst;
239 cst = isl_upoly_cst_alloc(ctx);
243 isl_int_set_si(cst->n, 0);
244 isl_int_set_si(cst->d, 1);
249 __isl_give struct isl_upoly *isl_upoly_one(struct isl_ctx *ctx)
251 struct isl_upoly_cst *cst;
253 cst = isl_upoly_cst_alloc(ctx);
257 isl_int_set_si(cst->n, 1);
258 isl_int_set_si(cst->d, 1);
263 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
265 struct isl_upoly_cst *cst;
267 cst = isl_upoly_cst_alloc(ctx);
271 isl_int_set_si(cst->n, 1);
272 isl_int_set_si(cst->d, 0);
277 __isl_give struct isl_upoly *isl_upoly_neginfty(struct isl_ctx *ctx)
279 struct isl_upoly_cst *cst;
281 cst = isl_upoly_cst_alloc(ctx);
285 isl_int_set_si(cst->n, -1);
286 isl_int_set_si(cst->d, 0);
291 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
293 struct isl_upoly_cst *cst;
295 cst = isl_upoly_cst_alloc(ctx);
299 isl_int_set_si(cst->n, 0);
300 isl_int_set_si(cst->d, 0);
305 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
306 isl_int n, isl_int d)
308 struct isl_upoly_cst *cst;
310 cst = isl_upoly_cst_alloc(ctx);
314 isl_int_set(cst->n, n);
315 isl_int_set(cst->d, d);
320 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
323 struct isl_upoly_rec *rec;
325 isl_assert(ctx, var >= 0, return NULL);
326 isl_assert(ctx, size >= 0, return NULL);
327 rec = isl_calloc(ctx, struct isl_upoly_rec,
328 sizeof(struct isl_upoly_rec) +
329 (size - 1) * sizeof(struct isl_upoly *));
344 __isl_give isl_qpolynomial *isl_qpolynomial_reset_dim(
345 __isl_take isl_qpolynomial *qp, __isl_take isl_dim *dim)
347 qp = isl_qpolynomial_cow(qp);
351 isl_dim_free(qp->dim);
356 isl_qpolynomial_free(qp);
361 isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp)
363 return qp ? qp->dim->ctx : NULL;
366 __isl_give isl_dim *isl_qpolynomial_get_dim(__isl_keep isl_qpolynomial *qp)
368 return qp ? isl_dim_copy(qp->dim) : NULL;
371 unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp,
372 enum isl_dim_type type)
374 return qp ? isl_dim_size(qp->dim, type) : 0;
377 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
379 return qp ? isl_upoly_is_zero(qp->upoly) : -1;
382 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
384 return qp ? isl_upoly_is_one(qp->upoly) : -1;
387 int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
389 return qp ? isl_upoly_is_nan(qp->upoly) : -1;
392 int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
394 return qp ? isl_upoly_is_infty(qp->upoly) : -1;
397 int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
399 return qp ? isl_upoly_is_neginfty(qp->upoly) : -1;
402 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
404 return qp ? isl_upoly_sgn(qp->upoly) : 0;
407 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
409 isl_int_clear(cst->n);
410 isl_int_clear(cst->d);
413 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
417 for (i = 0; i < rec->n; ++i)
418 isl_upoly_free(rec->p[i]);
421 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
430 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
432 struct isl_upoly_cst *cst;
433 struct isl_upoly_cst *dup;
435 cst = isl_upoly_as_cst(up);
439 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
442 isl_int_set(dup->n, cst->n);
443 isl_int_set(dup->d, cst->d);
448 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
451 struct isl_upoly_rec *rec;
452 struct isl_upoly_rec *dup;
454 rec = isl_upoly_as_rec(up);
458 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
462 for (i = 0; i < rec->n; ++i) {
463 dup->p[i] = isl_upoly_copy(rec->p[i]);
471 isl_upoly_free(&dup->up);
475 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
477 struct isl_upoly *dup;
482 if (isl_upoly_is_cst(up))
483 return isl_upoly_dup_cst(up);
485 return isl_upoly_dup_rec(up);
488 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
496 return isl_upoly_dup(up);
499 void isl_upoly_free(__isl_take struct isl_upoly *up)
508 upoly_free_cst((struct isl_upoly_cst *)up);
510 upoly_free_rec((struct isl_upoly_rec *)up);
512 isl_ctx_deref(up->ctx);
516 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
521 isl_int_gcd(gcd, cst->n, cst->d);
522 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
523 isl_int_divexact(cst->n, cst->n, gcd);
524 isl_int_divexact(cst->d, cst->d, gcd);
529 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
530 __isl_take struct isl_upoly *up2)
532 struct isl_upoly_cst *cst1;
533 struct isl_upoly_cst *cst2;
535 up1 = isl_upoly_cow(up1);
539 cst1 = isl_upoly_as_cst(up1);
540 cst2 = isl_upoly_as_cst(up2);
542 if (isl_int_eq(cst1->d, cst2->d))
543 isl_int_add(cst1->n, cst1->n, cst2->n);
545 isl_int_mul(cst1->n, cst1->n, cst2->d);
546 isl_int_addmul(cst1->n, cst2->n, cst1->d);
547 isl_int_mul(cst1->d, cst1->d, cst2->d);
550 isl_upoly_cst_reduce(cst1);
560 static __isl_give struct isl_upoly *replace_by_zero(
561 __isl_take struct isl_upoly *up)
569 return isl_upoly_zero(ctx);
572 static __isl_give struct isl_upoly *replace_by_constant_term(
573 __isl_take struct isl_upoly *up)
575 struct isl_upoly_rec *rec;
576 struct isl_upoly *cst;
581 rec = isl_upoly_as_rec(up);
584 cst = isl_upoly_copy(rec->p[0]);
592 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
593 __isl_take struct isl_upoly *up2)
596 struct isl_upoly_rec *rec1, *rec2;
601 if (isl_upoly_is_nan(up1)) {
606 if (isl_upoly_is_nan(up2)) {
611 if (isl_upoly_is_zero(up1)) {
616 if (isl_upoly_is_zero(up2)) {
621 if (up1->var < up2->var)
622 return isl_upoly_sum(up2, up1);
624 if (up2->var < up1->var) {
625 struct isl_upoly_rec *rec;
626 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
630 up1 = isl_upoly_cow(up1);
631 rec = isl_upoly_as_rec(up1);
634 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
636 up1 = replace_by_constant_term(up1);
640 if (isl_upoly_is_cst(up1))
641 return isl_upoly_sum_cst(up1, up2);
643 rec1 = isl_upoly_as_rec(up1);
644 rec2 = isl_upoly_as_rec(up2);
648 if (rec1->n < rec2->n)
649 return isl_upoly_sum(up2, up1);
651 up1 = isl_upoly_cow(up1);
652 rec1 = isl_upoly_as_rec(up1);
656 for (i = rec2->n - 1; i >= 0; --i) {
657 rec1->p[i] = isl_upoly_sum(rec1->p[i],
658 isl_upoly_copy(rec2->p[i]));
661 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
662 isl_upoly_free(rec1->p[i]);
668 up1 = replace_by_zero(up1);
669 else if (rec1->n == 1)
670 up1 = replace_by_constant_term(up1);
681 __isl_give struct isl_upoly *isl_upoly_cst_add_isl_int(
682 __isl_take struct isl_upoly *up, isl_int v)
684 struct isl_upoly_cst *cst;
686 up = isl_upoly_cow(up);
690 cst = isl_upoly_as_cst(up);
692 isl_int_addmul(cst->n, cst->d, v);
697 __isl_give struct isl_upoly *isl_upoly_add_isl_int(
698 __isl_take struct isl_upoly *up, isl_int v)
700 struct isl_upoly_rec *rec;
705 if (isl_upoly_is_cst(up))
706 return isl_upoly_cst_add_isl_int(up, v);
708 up = isl_upoly_cow(up);
709 rec = isl_upoly_as_rec(up);
713 rec->p[0] = isl_upoly_add_isl_int(rec->p[0], v);
723 __isl_give struct isl_upoly *isl_upoly_cst_mul_isl_int(
724 __isl_take struct isl_upoly *up, isl_int v)
726 struct isl_upoly_cst *cst;
728 if (isl_upoly_is_zero(up))
731 up = isl_upoly_cow(up);
735 cst = isl_upoly_as_cst(up);
737 isl_int_mul(cst->n, cst->n, v);
742 __isl_give struct isl_upoly *isl_upoly_mul_isl_int(
743 __isl_take struct isl_upoly *up, isl_int v)
746 struct isl_upoly_rec *rec;
751 if (isl_upoly_is_cst(up))
752 return isl_upoly_cst_mul_isl_int(up, v);
754 up = isl_upoly_cow(up);
755 rec = isl_upoly_as_rec(up);
759 for (i = 0; i < rec->n; ++i) {
760 rec->p[i] = isl_upoly_mul_isl_int(rec->p[i], v);
771 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
772 __isl_take struct isl_upoly *up2)
774 struct isl_upoly_cst *cst1;
775 struct isl_upoly_cst *cst2;
777 up1 = isl_upoly_cow(up1);
781 cst1 = isl_upoly_as_cst(up1);
782 cst2 = isl_upoly_as_cst(up2);
784 isl_int_mul(cst1->n, cst1->n, cst2->n);
785 isl_int_mul(cst1->d, cst1->d, cst2->d);
787 isl_upoly_cst_reduce(cst1);
797 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
798 __isl_take struct isl_upoly *up2)
800 struct isl_upoly_rec *rec1;
801 struct isl_upoly_rec *rec2;
802 struct isl_upoly_rec *res;
806 rec1 = isl_upoly_as_rec(up1);
807 rec2 = isl_upoly_as_rec(up2);
810 size = rec1->n + rec2->n - 1;
811 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
815 for (i = 0; i < rec1->n; ++i) {
816 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
817 isl_upoly_copy(rec1->p[i]));
822 for (; i < size; ++i) {
823 res->p[i] = isl_upoly_zero(up1->ctx);
828 for (i = 0; i < rec1->n; ++i) {
829 for (j = 1; j < rec2->n; ++j) {
830 struct isl_upoly *up;
831 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
832 isl_upoly_copy(rec1->p[i]));
833 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
846 isl_upoly_free(&res->up);
850 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
851 __isl_take struct isl_upoly *up2)
856 if (isl_upoly_is_nan(up1)) {
861 if (isl_upoly_is_nan(up2)) {
866 if (isl_upoly_is_zero(up1)) {
871 if (isl_upoly_is_zero(up2)) {
876 if (isl_upoly_is_one(up1)) {
881 if (isl_upoly_is_one(up2)) {
886 if (up1->var < up2->var)
887 return isl_upoly_mul(up2, up1);
889 if (up2->var < up1->var) {
891 struct isl_upoly_rec *rec;
892 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
893 isl_ctx *ctx = up1->ctx;
896 return isl_upoly_nan(ctx);
898 up1 = isl_upoly_cow(up1);
899 rec = isl_upoly_as_rec(up1);
903 for (i = 0; i < rec->n; ++i) {
904 rec->p[i] = isl_upoly_mul(rec->p[i],
905 isl_upoly_copy(up2));
913 if (isl_upoly_is_cst(up1))
914 return isl_upoly_mul_cst(up1, up2);
916 return isl_upoly_mul_rec(up1, up2);
923 __isl_give struct isl_upoly *isl_upoly_pow(__isl_take struct isl_upoly *up,
926 struct isl_upoly *res;
934 res = isl_upoly_copy(up);
936 res = isl_upoly_one(up->ctx);
938 while (power >>= 1) {
939 up = isl_upoly_mul(up, isl_upoly_copy(up));
941 res = isl_upoly_mul(res, isl_upoly_copy(up));
948 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
949 unsigned n_div, __isl_take struct isl_upoly *up)
951 struct isl_qpolynomial *qp = NULL;
957 total = isl_dim_total(dim);
959 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
964 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
975 isl_qpolynomial_free(qp);
979 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
988 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
990 struct isl_qpolynomial *dup;
995 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row,
996 isl_upoly_copy(qp->upoly));
999 isl_mat_free(dup->div);
1000 dup->div = isl_mat_copy(qp->div);
1006 isl_qpolynomial_free(dup);
1010 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
1018 return isl_qpolynomial_dup(qp);
1021 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
1029 isl_dim_free(qp->dim);
1030 isl_mat_free(qp->div);
1031 isl_upoly_free(qp->upoly);
1036 __isl_give struct isl_upoly *isl_upoly_var_pow(isl_ctx *ctx, int pos, int power)
1039 struct isl_upoly *up;
1040 struct isl_upoly_rec *rec;
1041 struct isl_upoly_cst *cst;
1043 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
1046 for (i = 0; i < 1 + power; ++i) {
1047 rec->p[i] = isl_upoly_zero(ctx);
1052 cst = isl_upoly_as_cst(rec->p[power]);
1053 isl_int_set_si(cst->n, 1);
1057 isl_upoly_free(&rec->up);
1061 /* r array maps original positions to new positions.
1063 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
1067 struct isl_upoly_rec *rec;
1068 struct isl_upoly *base;
1069 struct isl_upoly *res;
1071 if (isl_upoly_is_cst(up))
1074 rec = isl_upoly_as_rec(up);
1078 isl_assert(up->ctx, rec->n >= 1, goto error);
1080 base = isl_upoly_var_pow(up->ctx, r[up->var], 1);
1081 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
1083 for (i = rec->n - 2; i >= 0; --i) {
1084 res = isl_upoly_mul(res, isl_upoly_copy(base));
1085 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
1088 isl_upoly_free(base);
1097 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
1102 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1103 div1->n_col >= div2->n_col, return -1);
1105 if (div1->n_row == div2->n_row)
1106 return isl_mat_is_equal(div1, div2);
1108 n_row = div1->n_row;
1109 n_col = div1->n_col;
1110 div1->n_row = div2->n_row;
1111 div1->n_col = div2->n_col;
1113 equal = isl_mat_is_equal(div1, div2);
1115 div1->n_row = n_row;
1116 div1->n_col = n_col;
1121 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
1125 li = isl_seq_last_non_zero(div->row[i], div->n_col);
1126 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
1131 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
1134 struct isl_div_sort_info {
1139 static int div_sort_cmp(const void *p1, const void *p2)
1141 const struct isl_div_sort_info *i1, *i2;
1142 i1 = (const struct isl_div_sort_info *) p1;
1143 i2 = (const struct isl_div_sort_info *) p2;
1145 return cmp_row(i1->div, i1->row, i2->row);
1148 /* Sort divs and remove duplicates.
1150 static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp)
1155 struct isl_div_sort_info *array = NULL;
1156 int *pos = NULL, *at = NULL;
1157 int *reordering = NULL;
1162 if (qp->div->n_row <= 1)
1165 div_pos = isl_dim_total(qp->dim);
1167 array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info,
1169 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1170 at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1171 len = qp->div->n_col - 2;
1172 reordering = isl_alloc_array(qp->div->ctx, int, len);
1173 if (!array || !pos || !at || !reordering)
1176 for (i = 0; i < qp->div->n_row; ++i) {
1177 array[i].div = qp->div;
1183 qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
1186 for (i = 0; i < div_pos; ++i)
1189 for (i = 0; i < qp->div->n_row; ++i) {
1190 if (pos[array[i].row] == i)
1192 qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]);
1193 pos[at[i]] = pos[array[i].row];
1194 at[pos[array[i].row]] = at[i];
1195 at[i] = array[i].row;
1196 pos[array[i].row] = i;
1200 for (i = 0; i < len - div_pos; ++i) {
1202 isl_seq_eq(qp->div->row[i - skip - 1],
1203 qp->div->row[i - skip], qp->div->n_col)) {
1204 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
1205 isl_mat_col_add(qp->div, 2 + div_pos + i - skip - 1,
1206 2 + div_pos + i - skip);
1207 qp->div = isl_mat_drop_cols(qp->div,
1208 2 + div_pos + i - skip, 1);
1211 reordering[div_pos + array[i].row] = div_pos + i - skip;
1214 qp->upoly = reorder(qp->upoly, reordering);
1216 if (!qp->upoly || !qp->div)
1230 isl_qpolynomial_free(qp);
1234 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1235 int *exp, int first)
1238 struct isl_upoly_rec *rec;
1240 if (isl_upoly_is_cst(up))
1243 if (up->var < first)
1246 if (exp[up->var - first] == up->var - first)
1249 up = isl_upoly_cow(up);
1253 up->var = exp[up->var - first] + first;
1255 rec = isl_upoly_as_rec(up);
1259 for (i = 0; i < rec->n; ++i) {
1260 rec->p[i] = expand(rec->p[i], exp, first);
1271 static __isl_give isl_qpolynomial *with_merged_divs(
1272 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1273 __isl_take isl_qpolynomial *qp2),
1274 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1278 isl_mat *div = NULL;
1280 qp1 = isl_qpolynomial_cow(qp1);
1281 qp2 = isl_qpolynomial_cow(qp2);
1286 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1287 qp1->div->n_col >= qp2->div->n_col, goto error);
1289 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1290 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1294 div = isl_merge_divs(qp1->div, qp2->div, exp1, exp2);
1298 isl_mat_free(qp1->div);
1299 qp1->div = isl_mat_copy(div);
1300 isl_mat_free(qp2->div);
1301 qp2->div = isl_mat_copy(div);
1303 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1304 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1306 if (!qp1->upoly || !qp2->upoly)
1313 return fn(qp1, qp2);
1318 isl_qpolynomial_free(qp1);
1319 isl_qpolynomial_free(qp2);
1323 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1324 __isl_take isl_qpolynomial *qp2)
1326 qp1 = isl_qpolynomial_cow(qp1);
1331 if (qp1->div->n_row < qp2->div->n_row)
1332 return isl_qpolynomial_add(qp2, qp1);
1334 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1335 if (!compatible_divs(qp1->div, qp2->div))
1336 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1338 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1342 isl_qpolynomial_free(qp2);
1346 isl_qpolynomial_free(qp1);
1347 isl_qpolynomial_free(qp2);
1351 __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain(
1352 __isl_keep isl_set *dom,
1353 __isl_take isl_qpolynomial *qp1,
1354 __isl_take isl_qpolynomial *qp2)
1356 qp1 = isl_qpolynomial_add(qp1, qp2);
1357 qp1 = isl_qpolynomial_gist(qp1, isl_set_copy(dom));
1361 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1362 __isl_take isl_qpolynomial *qp2)
1364 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1367 __isl_give isl_qpolynomial *isl_qpolynomial_add_isl_int(
1368 __isl_take isl_qpolynomial *qp, isl_int v)
1370 if (isl_int_is_zero(v))
1373 qp = isl_qpolynomial_cow(qp);
1377 qp->upoly = isl_upoly_add_isl_int(qp->upoly, v);
1383 isl_qpolynomial_free(qp);
1388 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1393 return isl_qpolynomial_mul_isl_int(qp, qp->dim->ctx->negone);
1396 __isl_give isl_qpolynomial *isl_qpolynomial_mul_isl_int(
1397 __isl_take isl_qpolynomial *qp, isl_int v)
1399 if (isl_int_is_one(v))
1402 if (qp && isl_int_is_zero(v)) {
1403 isl_qpolynomial *zero;
1404 zero = isl_qpolynomial_zero(isl_dim_copy(qp->dim));
1405 isl_qpolynomial_free(qp);
1409 qp = isl_qpolynomial_cow(qp);
1413 qp->upoly = isl_upoly_mul_isl_int(qp->upoly, v);
1419 isl_qpolynomial_free(qp);
1423 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1424 __isl_take isl_qpolynomial *qp2)
1426 qp1 = isl_qpolynomial_cow(qp1);
1431 if (qp1->div->n_row < qp2->div->n_row)
1432 return isl_qpolynomial_mul(qp2, qp1);
1434 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1435 if (!compatible_divs(qp1->div, qp2->div))
1436 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1438 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1442 isl_qpolynomial_free(qp2);
1446 isl_qpolynomial_free(qp1);
1447 isl_qpolynomial_free(qp2);
1451 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_qpolynomial *qp,
1454 qp = isl_qpolynomial_cow(qp);
1459 qp->upoly = isl_upoly_pow(qp->upoly, power);
1465 isl_qpolynomial_free(qp);
1469 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1471 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1474 __isl_give isl_qpolynomial *isl_qpolynomial_one(__isl_take isl_dim *dim)
1476 return isl_qpolynomial_alloc(dim, 0, isl_upoly_one(dim->ctx));
1479 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1481 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1484 __isl_give isl_qpolynomial *isl_qpolynomial_neginfty(__isl_take isl_dim *dim)
1486 return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx));
1489 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1491 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1494 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1497 struct isl_qpolynomial *qp;
1498 struct isl_upoly_cst *cst;
1500 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1504 cst = isl_upoly_as_cst(qp->upoly);
1505 isl_int_set(cst->n, v);
1510 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1511 isl_int *n, isl_int *d)
1513 struct isl_upoly_cst *cst;
1518 if (!isl_upoly_is_cst(qp->upoly))
1521 cst = isl_upoly_as_cst(qp->upoly);
1526 isl_int_set(*n, cst->n);
1528 isl_int_set(*d, cst->d);
1533 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1536 struct isl_upoly_rec *rec;
1544 rec = isl_upoly_as_rec(up);
1551 isl_assert(up->ctx, rec->n > 1, return -1);
1553 is_cst = isl_upoly_is_cst(rec->p[1]);
1559 return isl_upoly_is_affine(rec->p[0]);
1562 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1567 if (qp->div->n_row > 0)
1570 return isl_upoly_is_affine(qp->upoly);
1573 static void update_coeff(__isl_keep isl_vec *aff,
1574 __isl_keep struct isl_upoly_cst *cst, int pos)
1579 if (isl_int_is_zero(cst->n))
1584 isl_int_gcd(gcd, cst->d, aff->el[0]);
1585 isl_int_divexact(f, cst->d, gcd);
1586 isl_int_divexact(gcd, aff->el[0], gcd);
1587 isl_seq_scale(aff->el, aff->el, f, aff->size);
1588 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1593 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1594 __isl_keep isl_vec *aff)
1596 struct isl_upoly_cst *cst;
1597 struct isl_upoly_rec *rec;
1603 struct isl_upoly_cst *cst;
1605 cst = isl_upoly_as_cst(up);
1608 update_coeff(aff, cst, 0);
1612 rec = isl_upoly_as_rec(up);
1615 isl_assert(up->ctx, rec->n == 2, return -1);
1617 cst = isl_upoly_as_cst(rec->p[1]);
1620 update_coeff(aff, cst, 1 + up->var);
1622 return isl_upoly_update_affine(rec->p[0], aff);
1625 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1626 __isl_keep isl_qpolynomial *qp)
1634 d = isl_dim_total(qp->dim);
1635 aff = isl_vec_alloc(qp->div->ctx, 2 + d + qp->div->n_row);
1639 isl_seq_clr(aff->el + 1, 1 + d + qp->div->n_row);
1640 isl_int_set_si(aff->el[0], 1);
1642 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1651 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1652 __isl_keep isl_qpolynomial *qp2)
1657 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1660 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1663 struct isl_upoly_rec *rec;
1665 if (isl_upoly_is_cst(up)) {
1666 struct isl_upoly_cst *cst;
1667 cst = isl_upoly_as_cst(up);
1670 isl_int_lcm(*d, *d, cst->d);
1674 rec = isl_upoly_as_rec(up);
1678 for (i = 0; i < rec->n; ++i)
1679 upoly_update_den(rec->p[i], d);
1682 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1684 isl_int_set_si(*d, 1);
1687 upoly_update_den(qp->upoly, d);
1690 __isl_give isl_qpolynomial *isl_qpolynomial_var_pow(__isl_take isl_dim *dim,
1693 struct isl_ctx *ctx;
1700 return isl_qpolynomial_alloc(dim, 0, isl_upoly_var_pow(ctx, pos, power));
1703 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1704 enum isl_dim_type type, unsigned pos)
1709 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1710 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1712 if (type == isl_dim_set)
1713 pos += isl_dim_size(dim, isl_dim_param);
1715 return isl_qpolynomial_var_pow(dim, pos, 1);
1721 __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up,
1722 unsigned first, unsigned n, __isl_keep struct isl_upoly **subs)
1725 struct isl_upoly_rec *rec;
1726 struct isl_upoly *base, *res;
1731 if (isl_upoly_is_cst(up))
1734 if (up->var < first)
1737 rec = isl_upoly_as_rec(up);
1741 isl_assert(up->ctx, rec->n >= 1, goto error);
1743 if (up->var >= first + n)
1744 base = isl_upoly_var_pow(up->ctx, up->var, 1);
1746 base = isl_upoly_copy(subs[up->var - first]);
1748 res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs);
1749 for (i = rec->n - 2; i >= 0; --i) {
1750 struct isl_upoly *t;
1751 t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs);
1752 res = isl_upoly_mul(res, isl_upoly_copy(base));
1753 res = isl_upoly_sum(res, t);
1756 isl_upoly_free(base);
1765 __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f,
1766 isl_int denom, unsigned len)
1769 struct isl_upoly *up;
1771 isl_assert(ctx, len >= 1, return NULL);
1773 up = isl_upoly_rat_cst(ctx, f[0], denom);
1774 for (i = 0; i < len - 1; ++i) {
1775 struct isl_upoly *t;
1776 struct isl_upoly *c;
1778 if (isl_int_is_zero(f[1 + i]))
1781 c = isl_upoly_rat_cst(ctx, f[1 + i], denom);
1782 t = isl_upoly_var_pow(ctx, i, 1);
1783 t = isl_upoly_mul(c, t);
1784 up = isl_upoly_sum(up, t);
1790 /* Remove common factor of non-constant terms and denominator.
1792 static void normalize_div(__isl_keep isl_qpolynomial *qp, int div)
1794 isl_ctx *ctx = qp->div->ctx;
1795 unsigned total = qp->div->n_col - 2;
1797 isl_seq_gcd(qp->div->row[div] + 2, total, &ctx->normalize_gcd);
1798 isl_int_gcd(ctx->normalize_gcd,
1799 ctx->normalize_gcd, qp->div->row[div][0]);
1800 if (isl_int_is_one(ctx->normalize_gcd))
1803 isl_seq_scale_down(qp->div->row[div] + 2, qp->div->row[div] + 2,
1804 ctx->normalize_gcd, total);
1805 isl_int_divexact(qp->div->row[div][0], qp->div->row[div][0],
1806 ctx->normalize_gcd);
1807 isl_int_fdiv_q(qp->div->row[div][1], qp->div->row[div][1],
1808 ctx->normalize_gcd);
1811 /* Replace the integer division identified by "div" by the polynomial "s".
1812 * The integer division is assumed not to appear in the definition
1813 * of any other integer divisions.
1815 static __isl_give isl_qpolynomial *substitute_div(
1816 __isl_take isl_qpolynomial *qp,
1817 int div, __isl_take struct isl_upoly *s)
1826 qp = isl_qpolynomial_cow(qp);
1830 total = isl_dim_total(qp->dim);
1831 qp->upoly = isl_upoly_subs(qp->upoly, total + div, 1, &s);
1835 reordering = isl_alloc_array(qp->dim->ctx, int, total + qp->div->n_row);
1838 for (i = 0; i < total + div; ++i)
1840 for (i = total + div + 1; i < total + qp->div->n_row; ++i)
1841 reordering[i] = i - 1;
1842 qp->div = isl_mat_drop_rows(qp->div, div, 1);
1843 qp->div = isl_mat_drop_cols(qp->div, 2 + total + div, 1);
1844 qp->upoly = reorder(qp->upoly, reordering);
1847 if (!qp->upoly || !qp->div)
1853 isl_qpolynomial_free(qp);
1858 /* Replace all integer divisions [e/d] that turn out to not actually be integer
1859 * divisions because d is equal to 1 by their definition, i.e., e.
1861 static __isl_give isl_qpolynomial *substitute_non_divs(
1862 __isl_take isl_qpolynomial *qp)
1866 struct isl_upoly *s;
1871 total = isl_dim_total(qp->dim);
1872 for (i = 0; qp && i < qp->div->n_row; ++i) {
1873 if (!isl_int_is_one(qp->div->row[i][0]))
1875 for (j = i + 1; j < qp->div->n_row; ++j) {
1876 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
1878 isl_seq_combine(qp->div->row[j] + 1,
1879 qp->div->ctx->one, qp->div->row[j] + 1,
1880 qp->div->row[j][2 + total + i],
1881 qp->div->row[i] + 1, 1 + total + i);
1882 isl_int_set_si(qp->div->row[j][2 + total + i], 0);
1883 normalize_div(qp, j);
1885 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
1886 qp->div->row[i][0], qp->div->n_col - 1);
1887 qp = substitute_div(qp, i, s);
1894 /* Reduce the coefficients of div "div" to lie in the interval [0, d-1],
1895 * with d the denominator. When replacing the coefficient e of x by
1896 * d * frac(e/d) = e - d * floor(e/d), we are subtracting d * floor(e/d) * x
1897 * inside the division, so we need to add floor(e/d) * x outside.
1898 * That is, we replace q by q' + floor(e/d) * x and we therefore need
1899 * to adjust the coefficient of x in each later div that depends on the
1900 * current div "div" and also in the affine expression "aff"
1901 * (if it too depends on "div").
1903 static void reduce_div(__isl_keep isl_qpolynomial *qp, int div,
1904 __isl_keep isl_vec *aff)
1908 unsigned total = qp->div->n_col - qp->div->n_row - 2;
1911 for (i = 0; i < 1 + total + div; ++i) {
1912 if (isl_int_is_nonneg(qp->div->row[div][1 + i]) &&
1913 isl_int_lt(qp->div->row[div][1 + i], qp->div->row[div][0]))
1915 isl_int_fdiv_q(v, qp->div->row[div][1 + i], qp->div->row[div][0]);
1916 isl_int_fdiv_r(qp->div->row[div][1 + i],
1917 qp->div->row[div][1 + i], qp->div->row[div][0]);
1918 if (!isl_int_is_zero(aff->el[1 + total + div]))
1919 isl_int_addmul(aff->el[i], v, aff->el[1 + total + div]);
1920 for (j = div + 1; j < qp->div->n_row; ++j) {
1921 if (isl_int_is_zero(qp->div->row[j][2 + total + div]))
1923 isl_int_addmul(qp->div->row[j][1 + i],
1924 v, qp->div->row[j][2 + total + div]);
1930 /* Check if the last non-zero coefficient is bigger that half of the
1931 * denominator. If so, we will invert the div to further reduce the number
1932 * of distinct divs that may appear.
1933 * If the last non-zero coefficient is exactly half the denominator,
1934 * then we continue looking for earlier coefficients that are bigger
1935 * than half the denominator.
1937 static int needs_invert(__isl_keep isl_mat *div, int row)
1942 for (i = div->n_col - 1; i >= 1; --i) {
1943 if (isl_int_is_zero(div->row[row][i]))
1945 isl_int_mul_ui(div->row[row][i], div->row[row][i], 2);
1946 cmp = isl_int_cmp(div->row[row][i], div->row[row][0]);
1947 isl_int_divexact_ui(div->row[row][i], div->row[row][i], 2);
1957 /* Replace div "div" q = [e/d] by -[(-e+(d-1))/d].
1958 * We only invert the coefficients of e (and the coefficient of q in
1959 * later divs and in "aff"). After calling this function, the
1960 * coefficients of e should be reduced again.
1962 static void invert_div(__isl_keep isl_qpolynomial *qp, int div,
1963 __isl_keep isl_vec *aff)
1965 unsigned total = qp->div->n_col - qp->div->n_row - 2;
1967 isl_seq_neg(qp->div->row[div] + 1,
1968 qp->div->row[div] + 1, qp->div->n_col - 1);
1969 isl_int_sub_ui(qp->div->row[div][1], qp->div->row[div][1], 1);
1970 isl_int_add(qp->div->row[div][1],
1971 qp->div->row[div][1], qp->div->row[div][0]);
1972 if (!isl_int_is_zero(aff->el[1 + total + div]))
1973 isl_int_neg(aff->el[1 + total + div], aff->el[1 + total + div]);
1974 isl_mat_col_mul(qp->div, 2 + total + div,
1975 qp->div->ctx->negone, 2 + total + div);
1978 /* Assuming "qp" is a monomial, reduce all its divs to have coefficients
1979 * in the interval [0, d-1], with d the denominator and such that the
1980 * last non-zero coefficient that is not equal to d/2 is smaller than d/2.
1982 * After the reduction, some divs may have become redundant or identical,
1983 * so we call substitute_non_divs and sort_divs. If these functions
1984 * eliminate divs or merge two or more divs into one, the coefficients
1985 * of the enclosing divs may have to be reduced again, so we call
1986 * ourselves recursively if the number of divs decreases.
1988 static __isl_give isl_qpolynomial *reduce_divs(__isl_take isl_qpolynomial *qp)
1991 isl_vec *aff = NULL;
1992 struct isl_upoly *s;
1998 aff = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);
1999 aff = isl_vec_clr(aff);
2003 isl_int_set_si(aff->el[1 + qp->upoly->var], 1);
2005 for (i = 0; i < qp->div->n_row; ++i) {
2006 normalize_div(qp, i);
2007 reduce_div(qp, i, aff);
2008 if (needs_invert(qp->div, i)) {
2009 invert_div(qp, i, aff);
2010 reduce_div(qp, i, aff);
2014 s = isl_upoly_from_affine(qp->div->ctx, aff->el,
2015 qp->div->ctx->one, aff->size);
2016 qp->upoly = isl_upoly_subs(qp->upoly, qp->upoly->var, 1, &s);
2023 n_div = qp->div->n_row;
2024 qp = substitute_non_divs(qp);
2026 if (qp && qp->div->n_row < n_div)
2027 return reduce_divs(qp);
2031 isl_qpolynomial_free(qp);
2036 /* Assumes each div only depends on earlier divs.
2038 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
2041 struct isl_qpolynomial *qp = NULL;
2042 struct isl_upoly_rec *rec;
2043 struct isl_upoly_cst *cst;
2050 d = div->line - div->bmap->div;
2052 pos = isl_dim_total(div->bmap->dim) + d;
2053 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
2054 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap),
2055 div->bmap->n_div, &rec->up);
2059 for (i = 0; i < div->bmap->n_div; ++i)
2060 isl_seq_cpy(qp->div->row[i], div->bmap->div[i], qp->div->n_col);
2062 for (i = 0; i < 1 + power; ++i) {
2063 rec->p[i] = isl_upoly_zero(div->ctx);
2068 cst = isl_upoly_as_cst(rec->p[power]);
2069 isl_int_set_si(cst->n, 1);
2073 qp = reduce_divs(qp);
2077 isl_qpolynomial_free(qp);
2082 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
2084 return isl_qpolynomial_div_pow(div, 1);
2087 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
2088 const isl_int n, const isl_int d)
2090 struct isl_qpolynomial *qp;
2091 struct isl_upoly_cst *cst;
2093 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
2097 cst = isl_upoly_as_cst(qp->upoly);
2098 isl_int_set(cst->n, n);
2099 isl_int_set(cst->d, d);
2104 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
2106 struct isl_upoly_rec *rec;
2112 if (isl_upoly_is_cst(up))
2116 active[up->var] = 1;
2118 rec = isl_upoly_as_rec(up);
2119 for (i = 0; i < rec->n; ++i)
2120 if (up_set_active(rec->p[i], active, d) < 0)
2126 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
2129 int d = isl_dim_total(qp->dim);
2134 for (i = 0; i < d; ++i)
2135 for (j = 0; j < qp->div->n_row; ++j) {
2136 if (isl_int_is_zero(qp->div->row[j][2 + i]))
2142 return up_set_active(qp->upoly, active, d);
2145 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
2146 enum isl_dim_type type, unsigned first, unsigned n)
2157 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2159 isl_assert(qp->dim->ctx, type == isl_dim_param ||
2160 type == isl_dim_set, return -1);
2162 active = isl_calloc_array(qp->dim->ctx, int, isl_dim_total(qp->dim));
2163 if (set_active(qp, active) < 0)
2166 if (type == isl_dim_set)
2167 first += isl_dim_size(qp->dim, isl_dim_param);
2168 for (i = 0; i < n; ++i)
2169 if (active[first + i]) {
2182 /* Remove divs that do not appear in the quasi-polynomial, nor in any
2183 * of the divs that do appear in the quasi-polynomial.
2185 static __isl_give isl_qpolynomial *remove_redundant_divs(
2186 __isl_take isl_qpolynomial *qp)
2193 int *reordering = NULL;
2199 if (qp->div->n_row == 0)
2202 d = isl_dim_total(qp->dim);
2203 len = qp->div->n_col - 2;
2204 active = isl_calloc_array(qp->ctx, int, len);
2208 if (up_set_active(qp->upoly, active, len) < 0)
2211 for (i = qp->div->n_row - 1; i >= 0; --i) {
2212 if (!active[d + i]) {
2216 for (j = 0; j < i; ++j) {
2217 if (isl_int_is_zero(qp->div->row[i][2 + d + j]))
2229 reordering = isl_alloc_array(qp->div->ctx, int, len);
2233 for (i = 0; i < d; ++i)
2237 n_div = qp->div->n_row;
2238 for (i = 0; i < n_div; ++i) {
2239 if (!active[d + i]) {
2240 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
2241 qp->div = isl_mat_drop_cols(qp->div,
2242 2 + d + i - skip, 1);
2245 reordering[d + i] = d + i - skip;
2248 qp->upoly = reorder(qp->upoly, reordering);
2250 if (!qp->upoly || !qp->div)
2260 isl_qpolynomial_free(qp);
2264 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
2265 unsigned first, unsigned n)
2268 struct isl_upoly_rec *rec;
2272 if (n == 0 || up->var < 0 || up->var < first)
2274 if (up->var < first + n) {
2275 up = replace_by_constant_term(up);
2276 return isl_upoly_drop(up, first, n);
2278 up = isl_upoly_cow(up);
2282 rec = isl_upoly_as_rec(up);
2286 for (i = 0; i < rec->n; ++i) {
2287 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
2298 __isl_give isl_qpolynomial *isl_qpolynomial_set_dim_name(
2299 __isl_take isl_qpolynomial *qp,
2300 enum isl_dim_type type, unsigned pos, const char *s)
2302 qp = isl_qpolynomial_cow(qp);
2305 qp->dim = isl_dim_set_name(qp->dim, type, pos, s);
2310 isl_qpolynomial_free(qp);
2314 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
2315 __isl_take isl_qpolynomial *qp,
2316 enum isl_dim_type type, unsigned first, unsigned n)
2320 if (n == 0 && !isl_dim_get_tuple_name(qp->dim, type))
2323 qp = isl_qpolynomial_cow(qp);
2327 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2329 isl_assert(qp->dim->ctx, type == isl_dim_param ||
2330 type == isl_dim_set, goto error);
2332 qp->dim = isl_dim_drop(qp->dim, type, first, n);
2336 if (type == isl_dim_set)
2337 first += isl_dim_size(qp->dim, isl_dim_param);
2339 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
2343 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
2349 isl_qpolynomial_free(qp);
2353 __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities(
2354 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
2360 struct isl_upoly *up;
2364 if (eq->n_eq == 0) {
2365 isl_basic_set_free(eq);
2369 qp = isl_qpolynomial_cow(qp);
2372 qp->div = isl_mat_cow(qp->div);
2376 total = 1 + isl_dim_total(eq->dim);
2378 isl_int_init(denom);
2379 for (i = 0; i < eq->n_eq; ++i) {
2380 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
2381 if (j < 0 || j == 0 || j >= total)
2384 for (k = 0; k < qp->div->n_row; ++k) {
2385 if (isl_int_is_zero(qp->div->row[k][1 + j]))
2387 isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total,
2388 &qp->div->row[k][0]);
2389 normalize_div(qp, k);
2392 if (isl_int_is_pos(eq->eq[i][j]))
2393 isl_seq_neg(eq->eq[i], eq->eq[i], total);
2394 isl_int_abs(denom, eq->eq[i][j]);
2395 isl_int_set_si(eq->eq[i][j], 0);
2397 up = isl_upoly_from_affine(qp->dim->ctx,
2398 eq->eq[i], denom, total);
2399 qp->upoly = isl_upoly_subs(qp->upoly, j - 1, 1, &up);
2402 isl_int_clear(denom);
2407 isl_basic_set_free(eq);
2409 qp = substitute_non_divs(qp);
2414 isl_basic_set_free(eq);
2415 isl_qpolynomial_free(qp);
2419 static __isl_give isl_basic_set *add_div_constraints(
2420 __isl_take isl_basic_set *bset, __isl_take isl_mat *div)
2428 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2431 total = isl_basic_set_total_dim(bset);
2432 for (i = 0; i < div->n_row; ++i)
2433 if (isl_basic_set_add_div_constraints_var(bset,
2434 total - div->n_row + i, div->row[i]) < 0)
2441 isl_basic_set_free(bset);
2445 /* Look for equalities among the variables shared by context and qp
2446 * and the integer divisions of qp, if any.
2447 * The equalities are then used to eliminate variables and/or integer
2448 * divisions from qp.
2450 __isl_give isl_qpolynomial *isl_qpolynomial_gist(
2451 __isl_take isl_qpolynomial *qp, __isl_take isl_set *context)
2457 if (qp->div->n_row > 0) {
2458 isl_basic_set *bset;
2459 context = isl_set_add_dims(context, isl_dim_set,
2461 bset = isl_basic_set_universe(isl_set_get_dim(context));
2462 bset = add_div_constraints(bset, isl_mat_copy(qp->div));
2463 context = isl_set_intersect(context,
2464 isl_set_from_basic_set(bset));
2467 aff = isl_set_affine_hull(context);
2468 return isl_qpolynomial_substitute_equalities(qp, aff);
2470 isl_qpolynomial_free(qp);
2471 isl_set_free(context);
2476 #define PW isl_pw_qpolynomial
2478 #define EL isl_qpolynomial
2480 #define IS_ZERO is_zero
2484 #include <isl_pw_templ.c>
2487 #define UNION isl_union_pw_qpolynomial
2489 #define PART isl_pw_qpolynomial
2491 #define PARTS pw_qpolynomial
2493 #include <isl_union_templ.c>
2495 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
2503 if (!isl_set_plain_is_universe(pwqp->p[0].set))
2506 return isl_qpolynomial_is_one(pwqp->p[0].qp);
2509 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
2510 __isl_take isl_pw_qpolynomial *pwqp1,
2511 __isl_take isl_pw_qpolynomial *pwqp2)
2514 struct isl_pw_qpolynomial *res;
2517 if (!pwqp1 || !pwqp2)
2520 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
2523 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
2524 isl_pw_qpolynomial_free(pwqp2);
2528 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
2529 isl_pw_qpolynomial_free(pwqp1);
2533 if (isl_pw_qpolynomial_is_one(pwqp1)) {
2534 isl_pw_qpolynomial_free(pwqp1);
2538 if (isl_pw_qpolynomial_is_one(pwqp2)) {
2539 isl_pw_qpolynomial_free(pwqp2);
2543 n = pwqp1->n * pwqp2->n;
2544 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
2546 for (i = 0; i < pwqp1->n; ++i) {
2547 for (j = 0; j < pwqp2->n; ++j) {
2548 struct isl_set *common;
2549 struct isl_qpolynomial *prod;
2550 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
2551 isl_set_copy(pwqp2->p[j].set));
2552 if (isl_set_plain_is_empty(common)) {
2553 isl_set_free(common);
2557 prod = isl_qpolynomial_mul(
2558 isl_qpolynomial_copy(pwqp1->p[i].qp),
2559 isl_qpolynomial_copy(pwqp2->p[j].qp));
2561 res = isl_pw_qpolynomial_add_piece(res, common, prod);
2565 isl_pw_qpolynomial_free(pwqp1);
2566 isl_pw_qpolynomial_free(pwqp2);
2570 isl_pw_qpolynomial_free(pwqp1);
2571 isl_pw_qpolynomial_free(pwqp2);
2575 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
2576 __isl_take isl_pw_qpolynomial *pwqp)
2583 if (isl_pw_qpolynomial_is_zero(pwqp))
2586 pwqp = isl_pw_qpolynomial_cow(pwqp);
2590 for (i = 0; i < pwqp->n; ++i) {
2591 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
2598 isl_pw_qpolynomial_free(pwqp);
2602 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
2603 __isl_take isl_pw_qpolynomial *pwqp1,
2604 __isl_take isl_pw_qpolynomial *pwqp2)
2606 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
2609 __isl_give struct isl_upoly *isl_upoly_eval(
2610 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
2613 struct isl_upoly_rec *rec;
2614 struct isl_upoly *res;
2615 struct isl_upoly *base;
2617 if (isl_upoly_is_cst(up)) {
2622 rec = isl_upoly_as_rec(up);
2626 isl_assert(up->ctx, rec->n >= 1, goto error);
2628 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
2630 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
2633 for (i = rec->n - 2; i >= 0; --i) {
2634 res = isl_upoly_mul(res, isl_upoly_copy(base));
2635 res = isl_upoly_sum(res,
2636 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
2637 isl_vec_copy(vec)));
2640 isl_upoly_free(base);
2650 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
2651 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
2654 struct isl_upoly *up;
2659 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
2661 if (qp->div->n_row == 0)
2662 ext = isl_vec_copy(pnt->vec);
2665 unsigned dim = isl_dim_total(qp->dim);
2666 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
2670 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
2671 for (i = 0; i < qp->div->n_row; ++i) {
2672 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
2673 1 + dim + i, &ext->el[1+dim+i]);
2674 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
2675 qp->div->row[i][0]);
2679 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
2683 dim = isl_dim_copy(qp->dim);
2684 isl_qpolynomial_free(qp);
2685 isl_point_free(pnt);
2687 return isl_qpolynomial_alloc(dim, 0, up);
2689 isl_qpolynomial_free(qp);
2690 isl_point_free(pnt);
2694 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
2695 __isl_keep struct isl_upoly_cst *cst2)
2700 isl_int_mul(t, cst1->n, cst2->d);
2701 isl_int_submul(t, cst2->n, cst1->d);
2702 cmp = isl_int_sgn(t);
2707 int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1,
2708 __isl_keep isl_qpolynomial *qp2)
2710 struct isl_upoly_cst *cst1, *cst2;
2714 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), return -1);
2715 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), return -1);
2716 if (isl_qpolynomial_is_nan(qp1))
2718 if (isl_qpolynomial_is_nan(qp2))
2720 cst1 = isl_upoly_as_cst(qp1->upoly);
2721 cst2 = isl_upoly_as_cst(qp2->upoly);
2723 return isl_upoly_cmp(cst1, cst2) <= 0;
2726 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
2727 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2729 struct isl_upoly_cst *cst1, *cst2;
2734 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2735 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2736 cst1 = isl_upoly_as_cst(qp1->upoly);
2737 cst2 = isl_upoly_as_cst(qp2->upoly);
2738 cmp = isl_upoly_cmp(cst1, cst2);
2741 isl_qpolynomial_free(qp2);
2743 isl_qpolynomial_free(qp1);
2748 isl_qpolynomial_free(qp1);
2749 isl_qpolynomial_free(qp2);
2753 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
2754 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2756 struct isl_upoly_cst *cst1, *cst2;
2761 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2762 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2763 cst1 = isl_upoly_as_cst(qp1->upoly);
2764 cst2 = isl_upoly_as_cst(qp2->upoly);
2765 cmp = isl_upoly_cmp(cst1, cst2);
2768 isl_qpolynomial_free(qp2);
2770 isl_qpolynomial_free(qp1);
2775 isl_qpolynomial_free(qp1);
2776 isl_qpolynomial_free(qp2);
2780 __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
2781 __isl_take isl_qpolynomial *qp, enum isl_dim_type type,
2782 unsigned first, unsigned n)
2791 qp = isl_qpolynomial_cow(qp);
2795 isl_assert(qp->div->ctx, first <= isl_dim_size(qp->dim, type),
2798 g_pos = pos(qp->dim, type) + first;
2800 qp->div = isl_mat_insert_cols(qp->div, 2 + g_pos, n);
2804 total = qp->div->n_col - 2;
2805 if (total > g_pos) {
2807 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2810 for (i = 0; i < total - g_pos; ++i)
2812 qp->upoly = expand(qp->upoly, exp, g_pos);
2818 qp->dim = isl_dim_insert(qp->dim, type, first, n);
2824 isl_qpolynomial_free(qp);
2828 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
2829 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2833 pos = isl_qpolynomial_dim(qp, type);
2835 return isl_qpolynomial_insert_dims(qp, type, pos, n);
2838 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2839 __isl_take isl_pw_qpolynomial *pwqp,
2840 enum isl_dim_type type, unsigned n)
2844 pos = isl_pw_qpolynomial_dim(pwqp, type);
2846 return isl_pw_qpolynomial_insert_dims(pwqp, type, pos, n);
2849 static int *reordering_move(isl_ctx *ctx,
2850 unsigned len, unsigned dst, unsigned src, unsigned n)
2855 reordering = isl_alloc_array(ctx, int, len);
2860 for (i = 0; i < dst; ++i)
2862 for (i = 0; i < n; ++i)
2863 reordering[src + i] = dst + i;
2864 for (i = 0; i < src - dst; ++i)
2865 reordering[dst + i] = dst + n + i;
2866 for (i = 0; i < len - src - n; ++i)
2867 reordering[src + n + i] = src + n + i;
2869 for (i = 0; i < src; ++i)
2871 for (i = 0; i < n; ++i)
2872 reordering[src + i] = dst + i;
2873 for (i = 0; i < dst - src; ++i)
2874 reordering[src + n + i] = src + i;
2875 for (i = 0; i < len - dst - n; ++i)
2876 reordering[dst + n + i] = dst + n + i;
2882 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
2883 __isl_take isl_qpolynomial *qp,
2884 enum isl_dim_type dst_type, unsigned dst_pos,
2885 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2891 qp = isl_qpolynomial_cow(qp);
2895 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2898 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2899 g_src_pos = pos(qp->dim, src_type) + src_pos;
2900 if (dst_type > src_type)
2903 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2910 reordering = reordering_move(qp->dim->ctx,
2911 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2915 qp->upoly = reorder(qp->upoly, reordering);
2920 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2926 isl_qpolynomial_free(qp);
2930 __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_dim *dim,
2931 isl_int *f, isl_int denom)
2933 struct isl_upoly *up;
2938 up = isl_upoly_from_affine(dim->ctx, f, denom, 1 + isl_dim_total(dim));
2940 return isl_qpolynomial_alloc(dim, 0, up);
2943 __isl_give isl_qpolynomial *isl_qpolynomial_from_aff(__isl_take isl_aff *aff)
2946 struct isl_upoly *up;
2947 isl_qpolynomial *qp;
2952 ctx = isl_aff_get_ctx(aff);
2953 up = isl_upoly_from_affine(ctx, aff->v->el + 1, aff->v->el[0],
2956 qp = isl_qpolynomial_alloc(isl_aff_get_dim(aff),
2957 aff->ls->div->n_row, up);
2961 isl_mat_free(qp->div);
2962 qp->div = isl_mat_copy(aff->ls->div);
2967 qp = reduce_divs(qp);
2968 qp = remove_redundant_divs(qp);
2975 __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
2976 __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
2980 struct isl_upoly *up;
2981 isl_qpolynomial *qp;
2987 isl_int_init(denom);
2989 isl_constraint_get_coefficient(c, type, pos, &denom);
2990 isl_constraint_set_coefficient(c, type, pos, c->ctx->zero);
2991 sgn = isl_int_sgn(denom);
2992 isl_int_abs(denom, denom);
2993 up = isl_upoly_from_affine(c->ctx, c->line[0], denom,
2994 1 + isl_constraint_dim(c, isl_dim_all));
2996 isl_int_neg(denom, denom);
2997 isl_constraint_set_coefficient(c, type, pos, denom);
2999 dim = isl_dim_copy(c->bmap->dim);
3001 isl_int_clear(denom);
3002 isl_constraint_free(c);
3004 qp = isl_qpolynomial_alloc(dim, 0, up);
3006 qp = isl_qpolynomial_neg(qp);
3010 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
3011 * in "qp" by subs[i].
3013 __isl_give isl_qpolynomial *isl_qpolynomial_substitute(
3014 __isl_take isl_qpolynomial *qp,
3015 enum isl_dim_type type, unsigned first, unsigned n,
3016 __isl_keep isl_qpolynomial **subs)
3019 struct isl_upoly **ups;
3024 qp = isl_qpolynomial_cow(qp);
3027 for (i = 0; i < n; ++i)
3031 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
3034 for (i = 0; i < n; ++i)
3035 isl_assert(qp->dim->ctx, isl_dim_equal(qp->dim, subs[i]->dim),
3038 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
3039 for (i = 0; i < n; ++i)
3040 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
3042 first += pos(qp->dim, type);
3044 ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n);
3047 for (i = 0; i < n; ++i)
3048 ups[i] = subs[i]->upoly;
3050 qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups);
3059 isl_qpolynomial_free(qp);
3063 /* Extend "bset" with extra set dimensions for each integer division
3064 * in "qp" and then call "fn" with the extended bset and the polynomial
3065 * that results from replacing each of the integer divisions by the
3066 * corresponding extra set dimension.
3068 int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
3069 __isl_keep isl_basic_set *bset,
3070 int (*fn)(__isl_take isl_basic_set *bset,
3071 __isl_take isl_qpolynomial *poly, void *user), void *user)
3075 isl_qpolynomial *poly;
3079 if (qp->div->n_row == 0)
3080 return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
3083 div = isl_mat_copy(qp->div);
3084 dim = isl_dim_copy(qp->dim);
3085 dim = isl_dim_add(dim, isl_dim_set, qp->div->n_row);
3086 poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly));
3087 bset = isl_basic_set_copy(bset);
3088 bset = isl_basic_set_add(bset, isl_dim_set, qp->div->n_row);
3089 bset = add_div_constraints(bset, div);
3091 return fn(bset, poly, user);
3096 /* Return total degree in variables first (inclusive) up to last (exclusive).
3098 int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last)
3102 struct isl_upoly_rec *rec;
3106 if (isl_upoly_is_zero(up))
3108 if (isl_upoly_is_cst(up) || up->var < first)
3111 rec = isl_upoly_as_rec(up);
3115 for (i = 0; i < rec->n; ++i) {
3118 if (isl_upoly_is_zero(rec->p[i]))
3120 d = isl_upoly_degree(rec->p[i], first, last);
3130 /* Return total degree in set variables.
3132 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
3140 ovar = isl_dim_offset(poly->dim, isl_dim_set);
3141 nvar = isl_dim_size(poly->dim, isl_dim_set);
3142 return isl_upoly_degree(poly->upoly, ovar, ovar + nvar);
3145 __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up,
3146 unsigned pos, int deg)
3149 struct isl_upoly_rec *rec;
3154 if (isl_upoly_is_cst(up) || up->var < pos) {
3156 return isl_upoly_copy(up);
3158 return isl_upoly_zero(up->ctx);
3161 rec = isl_upoly_as_rec(up);
3165 if (up->var == pos) {
3167 return isl_upoly_copy(rec->p[deg]);
3169 return isl_upoly_zero(up->ctx);
3172 up = isl_upoly_copy(up);
3173 up = isl_upoly_cow(up);
3174 rec = isl_upoly_as_rec(up);
3178 for (i = 0; i < rec->n; ++i) {
3179 struct isl_upoly *t;
3180 t = isl_upoly_coeff(rec->p[i], pos, deg);
3183 isl_upoly_free(rec->p[i]);
3193 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
3195 __isl_give isl_qpolynomial *isl_qpolynomial_coeff(
3196 __isl_keep isl_qpolynomial *qp,
3197 enum isl_dim_type type, unsigned t_pos, int deg)
3200 struct isl_upoly *up;
3206 isl_assert(qp->div->ctx, t_pos < isl_dim_size(qp->dim, type),
3209 g_pos = pos(qp->dim, type) + t_pos;
3210 up = isl_upoly_coeff(qp->upoly, g_pos, deg);
3212 c = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row, up);
3215 isl_mat_free(c->div);
3216 c->div = isl_mat_copy(qp->div);
3221 isl_qpolynomial_free(c);
3225 /* Homogenize the polynomial in the variables first (inclusive) up to
3226 * last (exclusive) by inserting powers of variable first.
3227 * Variable first is assumed not to appear in the input.
3229 __isl_give struct isl_upoly *isl_upoly_homogenize(
3230 __isl_take struct isl_upoly *up, int deg, int target,
3231 int first, int last)
3234 struct isl_upoly_rec *rec;
3238 if (isl_upoly_is_zero(up))
3242 if (isl_upoly_is_cst(up) || up->var < first) {
3243 struct isl_upoly *hom;
3245 hom = isl_upoly_var_pow(up->ctx, first, target - deg);
3248 rec = isl_upoly_as_rec(hom);
3249 rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up);
3254 up = isl_upoly_cow(up);
3255 rec = isl_upoly_as_rec(up);
3259 for (i = 0; i < rec->n; ++i) {
3260 if (isl_upoly_is_zero(rec->p[i]))
3262 rec->p[i] = isl_upoly_homogenize(rec->p[i],
3263 up->var < last ? deg + i : i, target,
3275 /* Homogenize the polynomial in the set variables by introducing
3276 * powers of an extra set variable at position 0.
3278 __isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
3279 __isl_take isl_qpolynomial *poly)
3283 int deg = isl_qpolynomial_degree(poly);
3288 poly = isl_qpolynomial_insert_dims(poly, isl_dim_set, 0, 1);
3289 poly = isl_qpolynomial_cow(poly);
3293 ovar = isl_dim_offset(poly->dim, isl_dim_set);
3294 nvar = isl_dim_size(poly->dim, isl_dim_set);
3295 poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg,
3302 isl_qpolynomial_free(poly);
3306 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
3307 __isl_take isl_mat *div)
3315 n = isl_dim_total(dim) + div->n_row;
3317 term = isl_calloc(dim->ctx, struct isl_term,
3318 sizeof(struct isl_term) + (n - 1) * sizeof(int));
3325 isl_int_init(term->n);
3326 isl_int_init(term->d);
3335 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
3344 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
3353 total = isl_dim_total(term->dim) + term->div->n_row;
3355 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
3359 isl_int_set(dup->n, term->n);
3360 isl_int_set(dup->d, term->d);
3362 for (i = 0; i < total; ++i)
3363 dup->pow[i] = term->pow[i];
3368 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
3376 return isl_term_dup(term);
3379 void isl_term_free(__isl_take isl_term *term)
3384 if (--term->ref > 0)
3387 isl_dim_free(term->dim);
3388 isl_mat_free(term->div);
3389 isl_int_clear(term->n);
3390 isl_int_clear(term->d);
3394 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
3402 case isl_dim_out: return isl_dim_size(term->dim, type);
3403 case isl_dim_div: return term->div->n_row;
3404 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
3409 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
3411 return term ? term->dim->ctx : NULL;
3414 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
3418 isl_int_set(*n, term->n);
3421 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
3425 isl_int_set(*d, term->d);
3428 int isl_term_get_exp(__isl_keep isl_term *term,
3429 enum isl_dim_type type, unsigned pos)
3434 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
3436 if (type >= isl_dim_set)
3437 pos += isl_dim_size(term->dim, isl_dim_param);
3438 if (type >= isl_dim_div)
3439 pos += isl_dim_size(term->dim, isl_dim_set);
3441 return term->pow[pos];
3444 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
3446 isl_basic_map *bmap;
3453 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
3456 total = term->div->n_col - term->div->n_row - 2;
3457 /* No nested divs for now */
3458 isl_assert(term->dim->ctx,
3459 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
3460 term->div->n_row) == -1,
3463 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
3464 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
3467 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
3469 return isl_basic_map_div(bmap, k);
3471 isl_basic_map_free(bmap);
3475 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
3476 int (*fn)(__isl_take isl_term *term, void *user),
3477 __isl_take isl_term *term, void *user)
3480 struct isl_upoly_rec *rec;
3485 if (isl_upoly_is_zero(up))
3488 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
3489 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
3490 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
3492 if (isl_upoly_is_cst(up)) {
3493 struct isl_upoly_cst *cst;
3494 cst = isl_upoly_as_cst(up);
3497 term = isl_term_cow(term);
3500 isl_int_set(term->n, cst->n);
3501 isl_int_set(term->d, cst->d);
3502 if (fn(isl_term_copy(term), user) < 0)
3507 rec = isl_upoly_as_rec(up);
3511 for (i = 0; i < rec->n; ++i) {
3512 term = isl_term_cow(term);
3515 term->pow[up->var] = i;
3516 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
3520 term->pow[up->var] = 0;
3524 isl_term_free(term);
3528 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
3529 int (*fn)(__isl_take isl_term *term, void *user), void *user)
3536 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
3540 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
3542 isl_term_free(term);
3544 return term ? 0 : -1;
3547 __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
3549 struct isl_upoly *up;
3550 isl_qpolynomial *qp;
3556 n = isl_dim_total(term->dim) + term->div->n_row;
3558 up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d);
3559 for (i = 0; i < n; ++i) {
3562 up = isl_upoly_mul(up,
3563 isl_upoly_var_pow(term->dim->ctx, i, term->pow[i]));
3566 qp = isl_qpolynomial_alloc(isl_dim_copy(term->dim), term->div->n_row, up);
3569 isl_mat_free(qp->div);
3570 qp->div = isl_mat_copy(term->div);
3574 isl_term_free(term);
3577 isl_qpolynomial_free(qp);
3578 isl_term_free(term);
3582 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
3583 __isl_take isl_dim *dim)
3592 if (isl_dim_equal(qp->dim, dim)) {
3597 qp = isl_qpolynomial_cow(qp);
3601 extra = isl_dim_size(dim, isl_dim_set) -
3602 isl_dim_size(qp->dim, isl_dim_set);
3603 total = isl_dim_total(qp->dim);
3604 if (qp->div->n_row) {
3607 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
3610 for (i = 0; i < qp->div->n_row; ++i)
3612 qp->upoly = expand(qp->upoly, exp, total);
3617 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
3620 for (i = 0; i < qp->div->n_row; ++i)
3621 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
3623 isl_dim_free(qp->dim);
3629 isl_qpolynomial_free(qp);
3633 /* For each parameter or variable that does not appear in qp,
3634 * first eliminate the variable from all constraints and then set it to zero.
3636 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
3637 __isl_keep isl_qpolynomial *qp)
3648 d = isl_dim_total(set->dim);
3649 active = isl_calloc_array(set->ctx, int, d);
3650 if (set_active(qp, active) < 0)
3653 for (i = 0; i < d; ++i)
3662 nparam = isl_dim_size(set->dim, isl_dim_param);
3663 nvar = isl_dim_size(set->dim, isl_dim_set);
3664 for (i = 0; i < nparam; ++i) {
3667 set = isl_set_eliminate(set, isl_dim_param, i, 1);
3668 set = isl_set_fix_si(set, isl_dim_param, i, 0);
3670 for (i = 0; i < nvar; ++i) {
3671 if (active[nparam + i])
3673 set = isl_set_eliminate(set, isl_dim_set, i, 1);
3674 set = isl_set_fix_si(set, isl_dim_set, i, 0);
3686 struct isl_opt_data {
3687 isl_qpolynomial *qp;
3689 isl_qpolynomial *opt;
3693 static int opt_fn(__isl_take isl_point *pnt, void *user)
3695 struct isl_opt_data *data = (struct isl_opt_data *)user;
3696 isl_qpolynomial *val;
3698 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
3702 } else if (data->max) {
3703 data->opt = isl_qpolynomial_max_cst(data->opt, val);
3705 data->opt = isl_qpolynomial_min_cst(data->opt, val);
3711 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
3712 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
3714 struct isl_opt_data data = { NULL, 1, NULL, max };
3719 if (isl_upoly_is_cst(qp->upoly)) {
3724 set = fix_inactive(set, qp);
3727 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
3731 data.opt = isl_qpolynomial_zero(isl_qpolynomial_get_dim(qp));
3734 isl_qpolynomial_free(qp);
3738 isl_qpolynomial_free(qp);
3739 isl_qpolynomial_free(data.opt);
3743 __isl_give isl_qpolynomial *isl_qpolynomial_morph(__isl_take isl_qpolynomial *qp,
3744 __isl_take isl_morph *morph)
3749 struct isl_upoly *up;
3751 struct isl_upoly **subs;
3754 qp = isl_qpolynomial_cow(qp);
3759 isl_assert(ctx, isl_dim_equal(qp->dim, morph->dom->dim), goto error);
3761 n_sub = morph->inv->n_row - 1;
3762 if (morph->inv->n_row != morph->inv->n_col)
3763 n_sub += qp->div->n_row;
3764 subs = isl_calloc_array(ctx, struct isl_upoly *, n_sub);
3768 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3769 subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i],
3770 morph->inv->row[0][0], morph->inv->n_col);
3771 if (morph->inv->n_row != morph->inv->n_col)
3772 for (i = 0; i < qp->div->n_row; ++i)
3773 subs[morph->inv->n_row - 1 + i] =
3774 isl_upoly_var_pow(ctx, morph->inv->n_col - 1 + i, 1);
3776 qp->upoly = isl_upoly_subs(qp->upoly, 0, n_sub, subs);
3778 for (i = 0; i < n_sub; ++i)
3779 isl_upoly_free(subs[i]);
3782 mat = isl_mat_diagonal(isl_mat_identity(ctx, 1), isl_mat_copy(morph->inv));
3783 mat = isl_mat_diagonal(mat, isl_mat_identity(ctx, qp->div->n_row));
3784 qp->div = isl_mat_product(qp->div, mat);
3785 isl_dim_free(qp->dim);
3786 qp->dim = isl_dim_copy(morph->ran->dim);
3788 if (!qp->upoly || !qp->div || !qp->dim)
3791 isl_morph_free(morph);
3795 isl_qpolynomial_free(qp);
3796 isl_morph_free(morph);
3800 static int neg_entry(void **entry, void *user)
3802 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
3804 *pwqp = isl_pw_qpolynomial_neg(*pwqp);
3806 return *pwqp ? 0 : -1;
3809 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_neg(
3810 __isl_take isl_union_pw_qpolynomial *upwqp)
3812 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
3816 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
3817 &neg_entry, NULL) < 0)
3822 isl_union_pw_qpolynomial_free(upwqp);
3826 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_sub(
3827 __isl_take isl_union_pw_qpolynomial *upwqp1,
3828 __isl_take isl_union_pw_qpolynomial *upwqp2)
3830 return isl_union_pw_qpolynomial_add(upwqp1,
3831 isl_union_pw_qpolynomial_neg(upwqp2));
3834 static int mul_entry(void **entry, void *user)
3836 struct isl_union_pw_qpolynomial_match_bin_data *data = user;
3838 struct isl_hash_table_entry *entry2;
3839 isl_pw_qpolynomial *pwpq = *entry;
3842 hash = isl_dim_get_hash(pwpq->dim);
3843 entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table,
3844 hash, &has_dim, pwpq->dim, 0);
3848 pwpq = isl_pw_qpolynomial_copy(pwpq);
3849 pwpq = isl_pw_qpolynomial_mul(pwpq,
3850 isl_pw_qpolynomial_copy(entry2->data));
3852 empty = isl_pw_qpolynomial_is_zero(pwpq);
3854 isl_pw_qpolynomial_free(pwpq);
3858 isl_pw_qpolynomial_free(pwpq);
3862 data->res = isl_union_pw_qpolynomial_add_pw_qpolynomial(data->res, pwpq);
3867 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
3868 __isl_take isl_union_pw_qpolynomial *upwqp1,
3869 __isl_take isl_union_pw_qpolynomial *upwqp2)
3871 return match_bin_op(upwqp1, upwqp2, &mul_entry);
3874 /* Reorder the columns of the given div definitions according to the
3877 static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div,
3878 __isl_take isl_reordering *r)
3887 extra = isl_dim_total(r->dim) + div->n_row - r->len;
3888 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
3892 for (i = 0; i < div->n_row; ++i) {
3893 isl_seq_cpy(mat->row[i], div->row[i], 2);
3894 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2);
3895 for (j = 0; j < r->len; ++j)
3896 isl_int_set(mat->row[i][2 + r->pos[j]],
3897 div->row[i][2 + j]);
3900 isl_reordering_free(r);
3904 isl_reordering_free(r);
3909 /* Reorder the dimension of "qp" according to the given reordering.
3911 __isl_give isl_qpolynomial *isl_qpolynomial_realign(
3912 __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r)
3914 qp = isl_qpolynomial_cow(qp);
3918 r = isl_reordering_extend(r, qp->div->n_row);
3922 qp->div = reorder_divs(qp->div, isl_reordering_copy(r));
3926 qp->upoly = reorder(qp->upoly, r->pos);
3930 qp = isl_qpolynomial_reset_dim(qp, isl_dim_copy(r->dim));
3932 isl_reordering_free(r);
3935 isl_qpolynomial_free(qp);
3936 isl_reordering_free(r);
3940 __isl_give isl_qpolynomial *isl_qpolynomial_align_params(
3941 __isl_take isl_qpolynomial *qp, __isl_take isl_dim *model)
3946 if (!isl_dim_match(qp->dim, isl_dim_param, model, isl_dim_param)) {
3947 isl_reordering *exp;
3949 model = isl_dim_drop(model, isl_dim_in,
3950 0, isl_dim_size(model, isl_dim_in));
3951 model = isl_dim_drop(model, isl_dim_out,
3952 0, isl_dim_size(model, isl_dim_out));
3953 exp = isl_parameter_alignment_reordering(qp->dim, model);
3954 exp = isl_reordering_extend_dim(exp,
3955 isl_qpolynomial_get_dim(qp));
3956 qp = isl_qpolynomial_realign(qp, exp);
3959 isl_dim_free(model);
3962 isl_dim_free(model);
3963 isl_qpolynomial_free(qp);
3967 struct isl_split_periods_data {
3969 isl_pw_qpolynomial *res;
3972 /* Create a slice where the integer division "div" has the fixed value "v".
3973 * In particular, if "div" refers to floor(f/m), then create a slice
3975 * m v <= f <= m v + (m - 1)
3980 * -f + m v + (m - 1) >= 0
3982 static __isl_give isl_set *set_div_slice(__isl_take isl_dim *dim,
3983 __isl_keep isl_qpolynomial *qp, int div, isl_int v)
3986 isl_basic_set *bset = NULL;
3992 total = isl_dim_total(dim);
3993 bset = isl_basic_set_alloc_dim(isl_dim_copy(dim), 0, 0, 2);
3995 k = isl_basic_set_alloc_inequality(bset);
3998 isl_seq_cpy(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3999 isl_int_submul(bset->ineq[k][0], v, qp->div->row[div][0]);
4001 k = isl_basic_set_alloc_inequality(bset);
4004 isl_seq_neg(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
4005 isl_int_addmul(bset->ineq[k][0], v, qp->div->row[div][0]);
4006 isl_int_add(bset->ineq[k][0], bset->ineq[k][0], qp->div->row[div][0]);
4007 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
4010 return isl_set_from_basic_set(bset);
4012 isl_basic_set_free(bset);
4017 static int split_periods(__isl_take isl_set *set,
4018 __isl_take isl_qpolynomial *qp, void *user);
4020 /* Create a slice of the domain "set" such that integer division "div"
4021 * has the fixed value "v" and add the results to data->res,
4022 * replacing the integer division by "v" in "qp".
4024 static int set_div(__isl_take isl_set *set,
4025 __isl_take isl_qpolynomial *qp, int div, isl_int v,
4026 struct isl_split_periods_data *data)
4031 struct isl_upoly *cst;
4033 slice = set_div_slice(isl_set_get_dim(set), qp, div, v);
4034 set = isl_set_intersect(set, slice);
4039 total = isl_dim_total(qp->dim);
4041 for (i = div + 1; i < qp->div->n_row; ++i) {
4042 if (isl_int_is_zero(qp->div->row[i][2 + total + div]))
4044 isl_int_addmul(qp->div->row[i][1],
4045 qp->div->row[i][2 + total + div], v);
4046 isl_int_set_si(qp->div->row[i][2 + total + div], 0);
4049 cst = isl_upoly_rat_cst(qp->dim->ctx, v, qp->dim->ctx->one);
4050 qp = substitute_div(qp, div, cst);
4052 return split_periods(set, qp, data);
4055 isl_qpolynomial_free(qp);
4059 /* Split the domain "set" such that integer division "div"
4060 * has a fixed value (ranging from "min" to "max") on each slice
4061 * and add the results to data->res.
4063 static int split_div(__isl_take isl_set *set,
4064 __isl_take isl_qpolynomial *qp, int div, isl_int min, isl_int max,
4065 struct isl_split_periods_data *data)
4067 for (; isl_int_le(min, max); isl_int_add_ui(min, min, 1)) {
4068 isl_set *set_i = isl_set_copy(set);
4069 isl_qpolynomial *qp_i = isl_qpolynomial_copy(qp);
4071 if (set_div(set_i, qp_i, div, min, data) < 0)
4075 isl_qpolynomial_free(qp);
4079 isl_qpolynomial_free(qp);
4083 /* If "qp" refers to any integer division
4084 * that can only attain "max_periods" distinct values on "set"
4085 * then split the domain along those distinct values.
4086 * Add the results (or the original if no splitting occurs)
4089 static int split_periods(__isl_take isl_set *set,
4090 __isl_take isl_qpolynomial *qp, void *user)
4093 isl_pw_qpolynomial *pwqp;
4094 struct isl_split_periods_data *data;
4099 data = (struct isl_split_periods_data *)user;
4104 if (qp->div->n_row == 0) {
4105 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4106 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
4112 total = isl_dim_total(qp->dim);
4113 for (i = 0; i < qp->div->n_row; ++i) {
4114 enum isl_lp_result lp_res;
4116 if (isl_seq_first_non_zero(qp->div->row[i] + 2 + total,
4117 qp->div->n_row) != -1)
4120 lp_res = isl_set_solve_lp(set, 0, qp->div->row[i] + 1,
4121 set->ctx->one, &min, NULL, NULL);
4122 if (lp_res == isl_lp_error)
4124 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
4126 isl_int_fdiv_q(min, min, qp->div->row[i][0]);
4128 lp_res = isl_set_solve_lp(set, 1, qp->div->row[i] + 1,
4129 set->ctx->one, &max, NULL, NULL);
4130 if (lp_res == isl_lp_error)
4132 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
4134 isl_int_fdiv_q(max, max, qp->div->row[i][0]);
4136 isl_int_sub(max, max, min);
4137 if (isl_int_cmp_si(max, data->max_periods) < 0) {
4138 isl_int_add(max, max, min);
4143 if (i < qp->div->n_row) {
4144 r = split_div(set, qp, i, min, max, data);
4146 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4147 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
4159 isl_qpolynomial_free(qp);
4163 /* If any quasi-polynomial in pwqp refers to any integer division
4164 * that can only attain "max_periods" distinct values on its domain
4165 * then split the domain along those distinct values.
4167 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_periods(
4168 __isl_take isl_pw_qpolynomial *pwqp, int max_periods)
4170 struct isl_split_periods_data data;
4172 data.max_periods = max_periods;
4173 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_dim(pwqp));
4175 if (isl_pw_qpolynomial_foreach_piece(pwqp, &split_periods, &data) < 0)
4178 isl_pw_qpolynomial_free(pwqp);
4182 isl_pw_qpolynomial_free(data.res);
4183 isl_pw_qpolynomial_free(pwqp);
4187 /* Construct a piecewise quasipolynomial that is constant on the given
4188 * domain. In particular, it is
4191 * infinity if cst == -1
4193 static __isl_give isl_pw_qpolynomial *constant_on_domain(
4194 __isl_take isl_basic_set *bset, int cst)
4197 isl_qpolynomial *qp;
4202 bset = isl_basic_map_domain(isl_basic_map_from_range(bset));
4203 dim = isl_basic_set_get_dim(bset);
4205 qp = isl_qpolynomial_infty(dim);
4207 qp = isl_qpolynomial_zero(dim);
4209 qp = isl_qpolynomial_one(dim);
4210 return isl_pw_qpolynomial_alloc(isl_set_from_basic_set(bset), qp);
4213 /* Factor bset, call fn on each of the factors and return the product.
4215 * If no factors can be found, simply call fn on the input.
4216 * Otherwise, construct the factors based on the factorizer,
4217 * call fn on each factor and compute the product.
4219 static __isl_give isl_pw_qpolynomial *compressed_multiplicative_call(
4220 __isl_take isl_basic_set *bset,
4221 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
4227 isl_qpolynomial *qp;
4228 isl_pw_qpolynomial *pwqp;
4232 f = isl_basic_set_factorizer(bset);
4235 if (f->n_group == 0) {
4236 isl_factorizer_free(f);
4240 nparam = isl_basic_set_dim(bset, isl_dim_param);
4241 nvar = isl_basic_set_dim(bset, isl_dim_set);
4243 dim = isl_basic_set_get_dim(bset);
4244 dim = isl_dim_domain(dim);
4245 set = isl_set_universe(isl_dim_copy(dim));
4246 qp = isl_qpolynomial_one(dim);
4247 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4249 bset = isl_morph_basic_set(isl_morph_copy(f->morph), bset);
4251 for (i = 0, n = 0; i < f->n_group; ++i) {
4252 isl_basic_set *bset_i;
4253 isl_pw_qpolynomial *pwqp_i;
4255 bset_i = isl_basic_set_copy(bset);
4256 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
4257 nparam + n + f->len[i], nvar - n - f->len[i]);
4258 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
4260 bset_i = isl_basic_set_drop(bset_i, isl_dim_set,
4261 n + f->len[i], nvar - n - f->len[i]);
4262 bset_i = isl_basic_set_drop(bset_i, isl_dim_set, 0, n);
4264 pwqp_i = fn(bset_i);
4265 pwqp = isl_pw_qpolynomial_mul(pwqp, pwqp_i);
4270 isl_basic_set_free(bset);
4271 isl_factorizer_free(f);
4275 isl_basic_set_free(bset);
4279 /* Factor bset, call fn on each of the factors and return the product.
4280 * The function is assumed to evaluate to zero on empty domains,
4281 * to one on zero-dimensional domains and to infinity on unbounded domains
4282 * and will not be called explicitly on zero-dimensional or unbounded domains.
4284 * We first check for some special cases and remove all equalities.
4285 * Then we hand over control to compressed_multiplicative_call.
4287 __isl_give isl_pw_qpolynomial *isl_basic_set_multiplicative_call(
4288 __isl_take isl_basic_set *bset,
4289 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
4293 isl_pw_qpolynomial *pwqp;
4294 unsigned orig_nvar, final_nvar;
4299 if (isl_basic_set_plain_is_empty(bset))
4300 return constant_on_domain(bset, 0);
4302 orig_nvar = isl_basic_set_dim(bset, isl_dim_set);
4305 return constant_on_domain(bset, 1);
4307 bounded = isl_basic_set_is_bounded(bset);
4311 return constant_on_domain(bset, -1);
4313 if (bset->n_eq == 0)
4314 return compressed_multiplicative_call(bset, fn);
4316 morph = isl_basic_set_full_compression(bset);
4317 bset = isl_morph_basic_set(isl_morph_copy(morph), bset);
4319 final_nvar = isl_basic_set_dim(bset, isl_dim_set);
4321 pwqp = compressed_multiplicative_call(bset, fn);
4323 morph = isl_morph_remove_dom_dims(morph, isl_dim_set, 0, orig_nvar);
4324 morph = isl_morph_remove_ran_dims(morph, isl_dim_set, 0, final_nvar);
4325 morph = isl_morph_inverse(morph);
4327 pwqp = isl_pw_qpolynomial_morph(pwqp, morph);
4331 isl_basic_set_free(bset);
4335 /* Drop all floors in "qp", turning each integer division [a/m] into
4336 * a rational division a/m. If "down" is set, then the integer division
4337 * is replaces by (a-(m-1))/m instead.
4339 static __isl_give isl_qpolynomial *qp_drop_floors(
4340 __isl_take isl_qpolynomial *qp, int down)
4343 struct isl_upoly *s;
4347 if (qp->div->n_row == 0)
4350 qp = isl_qpolynomial_cow(qp);
4354 for (i = qp->div->n_row - 1; i >= 0; --i) {
4356 isl_int_sub(qp->div->row[i][1],
4357 qp->div->row[i][1], qp->div->row[i][0]);
4358 isl_int_add_ui(qp->div->row[i][1],
4359 qp->div->row[i][1], 1);
4361 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
4362 qp->div->row[i][0], qp->div->n_col - 1);
4363 qp = substitute_div(qp, i, s);
4371 /* Drop all floors in "pwqp", turning each integer division [a/m] into
4372 * a rational division a/m.
4374 static __isl_give isl_pw_qpolynomial *pwqp_drop_floors(
4375 __isl_take isl_pw_qpolynomial *pwqp)
4382 if (isl_pw_qpolynomial_is_zero(pwqp))
4385 pwqp = isl_pw_qpolynomial_cow(pwqp);
4389 for (i = 0; i < pwqp->n; ++i) {
4390 pwqp->p[i].qp = qp_drop_floors(pwqp->p[i].qp, 0);
4397 isl_pw_qpolynomial_free(pwqp);
4401 /* Adjust all the integer divisions in "qp" such that they are at least
4402 * one over the given orthant (identified by "signs"). This ensures
4403 * that they will still be non-negative even after subtracting (m-1)/m.
4405 * In particular, f is replaced by f' + v, changing f = [a/m]
4406 * to f' = [(a - m v)/m].
4407 * If the constant term k in a is smaller than m,
4408 * the constant term of v is set to floor(k/m) - 1.
4409 * For any other term, if the coefficient c and the variable x have
4410 * the same sign, then no changes are needed.
4411 * Otherwise, if the variable is positive (and c is negative),
4412 * then the coefficient of x in v is set to floor(c/m).
4413 * If the variable is negative (and c is positive),
4414 * then the coefficient of x in v is set to ceil(c/m).
4416 static __isl_give isl_qpolynomial *make_divs_pos(__isl_take isl_qpolynomial *qp,
4422 struct isl_upoly *s;
4424 qp = isl_qpolynomial_cow(qp);
4427 qp->div = isl_mat_cow(qp->div);
4431 total = isl_dim_total(qp->dim);
4432 v = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);
4434 for (i = 0; i < qp->div->n_row; ++i) {
4435 isl_int *row = qp->div->row[i];
4439 if (isl_int_lt(row[1], row[0])) {
4440 isl_int_fdiv_q(v->el[0], row[1], row[0]);
4441 isl_int_sub_ui(v->el[0], v->el[0], 1);
4442 isl_int_submul(row[1], row[0], v->el[0]);
4444 for (j = 0; j < total; ++j) {
4445 if (isl_int_sgn(row[2 + j]) * signs[j] >= 0)
4448 isl_int_cdiv_q(v->el[1 + j], row[2 + j], row[0]);
4450 isl_int_fdiv_q(v->el[1 + j], row[2 + j], row[0]);
4451 isl_int_submul(row[2 + j], row[0], v->el[1 + j]);
4453 for (j = 0; j < i; ++j) {
4454 if (isl_int_sgn(row[2 + total + j]) >= 0)
4456 isl_int_fdiv_q(v->el[1 + total + j],
4457 row[2 + total + j], row[0]);
4458 isl_int_submul(row[2 + total + j],
4459 row[0], v->el[1 + total + j]);
4461 for (j = i + 1; j < qp->div->n_row; ++j) {
4462 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
4464 isl_seq_combine(qp->div->row[j] + 1,
4465 qp->div->ctx->one, qp->div->row[j] + 1,
4466 qp->div->row[j][2 + total + i], v->el, v->size);
4468 isl_int_set_si(v->el[1 + total + i], 1);
4469 s = isl_upoly_from_affine(qp->dim->ctx, v->el,
4470 qp->div->ctx->one, v->size);
4471 qp->upoly = isl_upoly_subs(qp->upoly, total + i, 1, &s);
4481 isl_qpolynomial_free(qp);
4485 struct isl_to_poly_data {
4487 isl_pw_qpolynomial *res;
4488 isl_qpolynomial *qp;
4491 /* Appoximate data->qp by a polynomial on the orthant identified by "signs".
4492 * We first make all integer divisions positive and then split the
4493 * quasipolynomials into terms with sign data->sign (the direction
4494 * of the requested approximation) and terms with the opposite sign.
4495 * In the first set of terms, each integer division [a/m] is
4496 * overapproximated by a/m, while in the second it is underapproximated
4499 static int to_polynomial_on_orthant(__isl_take isl_set *orthant, int *signs,
4502 struct isl_to_poly_data *data = user;
4503 isl_pw_qpolynomial *t;
4504 isl_qpolynomial *qp, *up, *down;
4506 qp = isl_qpolynomial_copy(data->qp);
4507 qp = make_divs_pos(qp, signs);
4509 up = isl_qpolynomial_terms_of_sign(qp, signs, data->sign);
4510 up = qp_drop_floors(up, 0);
4511 down = isl_qpolynomial_terms_of_sign(qp, signs, -data->sign);
4512 down = qp_drop_floors(down, 1);
4514 isl_qpolynomial_free(qp);
4515 qp = isl_qpolynomial_add(up, down);
4517 t = isl_pw_qpolynomial_alloc(orthant, qp);
4518 data->res = isl_pw_qpolynomial_add_disjoint(data->res, t);
4523 /* Approximate each quasipolynomial by a polynomial. If "sign" is positive,
4524 * the polynomial will be an overapproximation. If "sign" is negative,
4525 * it will be an underapproximation. If "sign" is zero, the approximation
4526 * will lie somewhere in between.
4528 * In particular, is sign == 0, we simply drop the floors, turning
4529 * the integer divisions into rational divisions.
4530 * Otherwise, we split the domains into orthants, make all integer divisions
4531 * positive and then approximate each [a/m] by either a/m or (a-(m-1))/m,
4532 * depending on the requested sign and the sign of the term in which
4533 * the integer division appears.
4535 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_to_polynomial(
4536 __isl_take isl_pw_qpolynomial *pwqp, int sign)
4539 struct isl_to_poly_data data;
4542 return pwqp_drop_floors(pwqp);
4548 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_dim(pwqp));
4550 for (i = 0; i < pwqp->n; ++i) {
4551 if (pwqp->p[i].qp->div->n_row == 0) {
4552 isl_pw_qpolynomial *t;
4553 t = isl_pw_qpolynomial_alloc(
4554 isl_set_copy(pwqp->p[i].set),
4555 isl_qpolynomial_copy(pwqp->p[i].qp));
4556 data.res = isl_pw_qpolynomial_add_disjoint(data.res, t);
4559 data.qp = pwqp->p[i].qp;
4560 if (isl_set_foreach_orthant(pwqp->p[i].set,
4561 &to_polynomial_on_orthant, &data) < 0)
4565 isl_pw_qpolynomial_free(pwqp);
4569 isl_pw_qpolynomial_free(pwqp);
4570 isl_pw_qpolynomial_free(data.res);
4574 static int poly_entry(void **entry, void *user)
4577 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
4579 *pwqp = isl_pw_qpolynomial_to_polynomial(*pwqp, *sign);
4581 return *pwqp ? 0 : -1;
4584 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_to_polynomial(
4585 __isl_take isl_union_pw_qpolynomial *upwqp, int sign)
4587 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
4591 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
4592 &poly_entry, &sign) < 0)
4597 isl_union_pw_qpolynomial_free(upwqp);
4601 __isl_give isl_basic_map *isl_basic_map_from_qpolynomial(
4602 __isl_take isl_qpolynomial *qp)
4606 isl_vec *aff = NULL;
4607 isl_basic_map *bmap = NULL;
4613 if (!isl_upoly_is_affine(qp->upoly))
4614 isl_die(qp->dim->ctx, isl_error_invalid,
4615 "input quasi-polynomial not affine", goto error);
4616 aff = isl_qpolynomial_extract_affine(qp);
4619 dim = isl_qpolynomial_get_dim(qp);
4620 dim = isl_dim_from_domain(dim);
4621 pos = 1 + isl_dim_offset(dim, isl_dim_out);
4622 dim = isl_dim_add(dim, isl_dim_out, 1);
4623 n_div = qp->div->n_row;
4624 bmap = isl_basic_map_alloc_dim(dim, n_div, 1, 2 * n_div);
4626 for (i = 0; i < n_div; ++i) {
4627 k = isl_basic_map_alloc_div(bmap);
4630 isl_seq_cpy(bmap->div[k], qp->div->row[i], qp->div->n_col);
4631 isl_int_set_si(bmap->div[k][qp->div->n_col], 0);
4632 if (isl_basic_map_add_div_constraints(bmap, k) < 0)
4635 k = isl_basic_map_alloc_equality(bmap);
4638 isl_int_neg(bmap->eq[k][pos], aff->el[0]);
4639 isl_seq_cpy(bmap->eq[k], aff->el + 1, pos);
4640 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->el + 1 + pos, n_div);
4643 isl_qpolynomial_free(qp);
4644 bmap = isl_basic_map_finalize(bmap);
4648 isl_qpolynomial_free(qp);
4649 isl_basic_map_free(bmap);