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_constraint_private.h>
19 #include <isl_polynomial_private.h>
20 #include <isl_point_private.h>
21 #include <isl_dim_private.h>
22 #include <isl_div_private.h>
23 #include <isl_mat_private.h>
24 #include <isl_range.h>
25 #include <isl_local_space_private.h>
26 #include <isl_aff_private.h>
27 #include <isl_config.h>
29 static unsigned pos(__isl_keep isl_dim *dim, enum isl_dim_type type)
32 case isl_dim_param: return 0;
33 case isl_dim_in: return dim->nparam;
34 case isl_dim_out: return dim->nparam + dim->n_in;
39 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
47 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
52 isl_assert(up->ctx, up->var < 0, return NULL);
54 return (struct isl_upoly_cst *)up;
57 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
62 isl_assert(up->ctx, up->var >= 0, return NULL);
64 return (struct isl_upoly_rec *)up;
67 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
68 __isl_keep struct isl_upoly *up2)
71 struct isl_upoly_rec *rec1, *rec2;
77 if (up1->var != up2->var)
79 if (isl_upoly_is_cst(up1)) {
80 struct isl_upoly_cst *cst1, *cst2;
81 cst1 = isl_upoly_as_cst(up1);
82 cst2 = isl_upoly_as_cst(up2);
85 return isl_int_eq(cst1->n, cst2->n) &&
86 isl_int_eq(cst1->d, cst2->d);
89 rec1 = isl_upoly_as_rec(up1);
90 rec2 = isl_upoly_as_rec(up2);
94 if (rec1->n != rec2->n)
97 for (i = 0; i < rec1->n; ++i) {
98 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
106 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
108 struct isl_upoly_cst *cst;
112 if (!isl_upoly_is_cst(up))
115 cst = isl_upoly_as_cst(up);
119 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
122 int isl_upoly_sgn(__isl_keep struct isl_upoly *up)
124 struct isl_upoly_cst *cst;
128 if (!isl_upoly_is_cst(up))
131 cst = isl_upoly_as_cst(up);
135 return isl_int_sgn(cst->n);
138 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
140 struct isl_upoly_cst *cst;
144 if (!isl_upoly_is_cst(up))
147 cst = isl_upoly_as_cst(up);
151 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
154 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
156 struct isl_upoly_cst *cst;
160 if (!isl_upoly_is_cst(up))
163 cst = isl_upoly_as_cst(up);
167 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
170 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
172 struct isl_upoly_cst *cst;
176 if (!isl_upoly_is_cst(up))
179 cst = isl_upoly_as_cst(up);
183 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
186 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
188 struct isl_upoly_cst *cst;
192 if (!isl_upoly_is_cst(up))
195 cst = isl_upoly_as_cst(up);
199 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
202 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
204 struct isl_upoly_cst *cst;
208 if (!isl_upoly_is_cst(up))
211 cst = isl_upoly_as_cst(up);
215 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
218 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
220 struct isl_upoly_cst *cst;
222 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
231 isl_int_init(cst->n);
232 isl_int_init(cst->d);
237 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
239 struct isl_upoly_cst *cst;
241 cst = isl_upoly_cst_alloc(ctx);
245 isl_int_set_si(cst->n, 0);
246 isl_int_set_si(cst->d, 1);
251 __isl_give struct isl_upoly *isl_upoly_one(struct isl_ctx *ctx)
253 struct isl_upoly_cst *cst;
255 cst = isl_upoly_cst_alloc(ctx);
259 isl_int_set_si(cst->n, 1);
260 isl_int_set_si(cst->d, 1);
265 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
267 struct isl_upoly_cst *cst;
269 cst = isl_upoly_cst_alloc(ctx);
273 isl_int_set_si(cst->n, 1);
274 isl_int_set_si(cst->d, 0);
279 __isl_give struct isl_upoly *isl_upoly_neginfty(struct isl_ctx *ctx)
281 struct isl_upoly_cst *cst;
283 cst = isl_upoly_cst_alloc(ctx);
287 isl_int_set_si(cst->n, -1);
288 isl_int_set_si(cst->d, 0);
293 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
295 struct isl_upoly_cst *cst;
297 cst = isl_upoly_cst_alloc(ctx);
301 isl_int_set_si(cst->n, 0);
302 isl_int_set_si(cst->d, 0);
307 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
308 isl_int n, isl_int d)
310 struct isl_upoly_cst *cst;
312 cst = isl_upoly_cst_alloc(ctx);
316 isl_int_set(cst->n, n);
317 isl_int_set(cst->d, d);
322 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
325 struct isl_upoly_rec *rec;
327 isl_assert(ctx, var >= 0, return NULL);
328 isl_assert(ctx, size >= 0, return NULL);
329 rec = isl_calloc(ctx, struct isl_upoly_rec,
330 sizeof(struct isl_upoly_rec) +
331 size * sizeof(struct isl_upoly *));
346 __isl_give isl_qpolynomial *isl_qpolynomial_reset_dim(
347 __isl_take isl_qpolynomial *qp, __isl_take isl_dim *dim)
349 qp = isl_qpolynomial_cow(qp);
353 isl_dim_free(qp->dim);
358 isl_qpolynomial_free(qp);
363 isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp)
365 return qp ? qp->dim->ctx : NULL;
368 __isl_give isl_dim *isl_qpolynomial_get_dim(__isl_keep isl_qpolynomial *qp)
370 return qp ? isl_dim_copy(qp->dim) : NULL;
373 unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp,
374 enum isl_dim_type type)
376 return qp ? isl_dim_size(qp->dim, type) : 0;
379 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
381 return qp ? isl_upoly_is_zero(qp->upoly) : -1;
384 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
386 return qp ? isl_upoly_is_one(qp->upoly) : -1;
389 int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
391 return qp ? isl_upoly_is_nan(qp->upoly) : -1;
394 int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
396 return qp ? isl_upoly_is_infty(qp->upoly) : -1;
399 int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
401 return qp ? isl_upoly_is_neginfty(qp->upoly) : -1;
404 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
406 return qp ? isl_upoly_sgn(qp->upoly) : 0;
409 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
411 isl_int_clear(cst->n);
412 isl_int_clear(cst->d);
415 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
419 for (i = 0; i < rec->n; ++i)
420 isl_upoly_free(rec->p[i]);
423 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
432 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
434 struct isl_upoly_cst *cst;
435 struct isl_upoly_cst *dup;
437 cst = isl_upoly_as_cst(up);
441 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
444 isl_int_set(dup->n, cst->n);
445 isl_int_set(dup->d, cst->d);
450 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
453 struct isl_upoly_rec *rec;
454 struct isl_upoly_rec *dup;
456 rec = isl_upoly_as_rec(up);
460 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
464 for (i = 0; i < rec->n; ++i) {
465 dup->p[i] = isl_upoly_copy(rec->p[i]);
473 isl_upoly_free(&dup->up);
477 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
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 = NULL;
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_rec *rec;
1040 struct isl_upoly_cst *cst;
1042 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
1045 for (i = 0; i < 1 + power; ++i) {
1046 rec->p[i] = isl_upoly_zero(ctx);
1051 cst = isl_upoly_as_cst(rec->p[power]);
1052 isl_int_set_si(cst->n, 1);
1056 isl_upoly_free(&rec->up);
1060 /* r array maps original positions to new positions.
1062 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
1066 struct isl_upoly_rec *rec;
1067 struct isl_upoly *base;
1068 struct isl_upoly *res;
1070 if (isl_upoly_is_cst(up))
1073 rec = isl_upoly_as_rec(up);
1077 isl_assert(up->ctx, rec->n >= 1, goto error);
1079 base = isl_upoly_var_pow(up->ctx, r[up->var], 1);
1080 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
1082 for (i = rec->n - 2; i >= 0; --i) {
1083 res = isl_upoly_mul(res, isl_upoly_copy(base));
1084 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
1087 isl_upoly_free(base);
1096 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
1101 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1102 div1->n_col >= div2->n_col, return -1);
1104 if (div1->n_row == div2->n_row)
1105 return isl_mat_is_equal(div1, div2);
1107 n_row = div1->n_row;
1108 n_col = div1->n_col;
1109 div1->n_row = div2->n_row;
1110 div1->n_col = div2->n_col;
1112 equal = isl_mat_is_equal(div1, div2);
1114 div1->n_row = n_row;
1115 div1->n_col = n_col;
1120 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
1124 li = isl_seq_last_non_zero(div->row[i], div->n_col);
1125 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
1130 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
1133 struct isl_div_sort_info {
1138 static int div_sort_cmp(const void *p1, const void *p2)
1140 const struct isl_div_sort_info *i1, *i2;
1141 i1 = (const struct isl_div_sort_info *) p1;
1142 i2 = (const struct isl_div_sort_info *) p2;
1144 return cmp_row(i1->div, i1->row, i2->row);
1147 /* Sort divs and remove duplicates.
1149 static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp)
1154 struct isl_div_sort_info *array = NULL;
1155 int *pos = NULL, *at = NULL;
1156 int *reordering = NULL;
1161 if (qp->div->n_row <= 1)
1164 div_pos = isl_dim_total(qp->dim);
1166 array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info,
1168 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1169 at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1170 len = qp->div->n_col - 2;
1171 reordering = isl_alloc_array(qp->div->ctx, int, len);
1172 if (!array || !pos || !at || !reordering)
1175 for (i = 0; i < qp->div->n_row; ++i) {
1176 array[i].div = qp->div;
1182 qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
1185 for (i = 0; i < div_pos; ++i)
1188 for (i = 0; i < qp->div->n_row; ++i) {
1189 if (pos[array[i].row] == i)
1191 qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]);
1192 pos[at[i]] = pos[array[i].row];
1193 at[pos[array[i].row]] = at[i];
1194 at[i] = array[i].row;
1195 pos[array[i].row] = i;
1199 for (i = 0; i < len - div_pos; ++i) {
1201 isl_seq_eq(qp->div->row[i - skip - 1],
1202 qp->div->row[i - skip], qp->div->n_col)) {
1203 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
1204 isl_mat_col_add(qp->div, 2 + div_pos + i - skip - 1,
1205 2 + div_pos + i - skip);
1206 qp->div = isl_mat_drop_cols(qp->div,
1207 2 + div_pos + i - skip, 1);
1210 reordering[div_pos + array[i].row] = div_pos + i - skip;
1213 qp->upoly = reorder(qp->upoly, reordering);
1215 if (!qp->upoly || !qp->div)
1229 isl_qpolynomial_free(qp);
1233 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1234 int *exp, int first)
1237 struct isl_upoly_rec *rec;
1239 if (isl_upoly_is_cst(up))
1242 if (up->var < first)
1245 if (exp[up->var - first] == up->var - first)
1248 up = isl_upoly_cow(up);
1252 up->var = exp[up->var - first] + first;
1254 rec = isl_upoly_as_rec(up);
1258 for (i = 0; i < rec->n; ++i) {
1259 rec->p[i] = expand(rec->p[i], exp, first);
1270 static __isl_give isl_qpolynomial *with_merged_divs(
1271 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1272 __isl_take isl_qpolynomial *qp2),
1273 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1277 isl_mat *div = NULL;
1279 qp1 = isl_qpolynomial_cow(qp1);
1280 qp2 = isl_qpolynomial_cow(qp2);
1285 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1286 qp1->div->n_col >= qp2->div->n_col, goto error);
1288 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1289 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1293 div = isl_merge_divs(qp1->div, qp2->div, exp1, exp2);
1297 isl_mat_free(qp1->div);
1298 qp1->div = isl_mat_copy(div);
1299 isl_mat_free(qp2->div);
1300 qp2->div = isl_mat_copy(div);
1302 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1303 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1305 if (!qp1->upoly || !qp2->upoly)
1312 return fn(qp1, qp2);
1317 isl_qpolynomial_free(qp1);
1318 isl_qpolynomial_free(qp2);
1322 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1323 __isl_take isl_qpolynomial *qp2)
1325 qp1 = isl_qpolynomial_cow(qp1);
1330 if (qp1->div->n_row < qp2->div->n_row)
1331 return isl_qpolynomial_add(qp2, qp1);
1333 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1334 if (!compatible_divs(qp1->div, qp2->div))
1335 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1337 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1341 isl_qpolynomial_free(qp2);
1345 isl_qpolynomial_free(qp1);
1346 isl_qpolynomial_free(qp2);
1350 __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain(
1351 __isl_keep isl_set *dom,
1352 __isl_take isl_qpolynomial *qp1,
1353 __isl_take isl_qpolynomial *qp2)
1355 qp1 = isl_qpolynomial_add(qp1, qp2);
1356 qp1 = isl_qpolynomial_gist(qp1, isl_set_copy(dom));
1360 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1361 __isl_take isl_qpolynomial *qp2)
1363 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1366 __isl_give isl_qpolynomial *isl_qpolynomial_add_isl_int(
1367 __isl_take isl_qpolynomial *qp, isl_int v)
1369 if (isl_int_is_zero(v))
1372 qp = isl_qpolynomial_cow(qp);
1376 qp->upoly = isl_upoly_add_isl_int(qp->upoly, v);
1382 isl_qpolynomial_free(qp);
1387 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1392 return isl_qpolynomial_mul_isl_int(qp, qp->dim->ctx->negone);
1395 __isl_give isl_qpolynomial *isl_qpolynomial_mul_isl_int(
1396 __isl_take isl_qpolynomial *qp, isl_int v)
1398 if (isl_int_is_one(v))
1401 if (qp && isl_int_is_zero(v)) {
1402 isl_qpolynomial *zero;
1403 zero = isl_qpolynomial_zero(isl_dim_copy(qp->dim));
1404 isl_qpolynomial_free(qp);
1408 qp = isl_qpolynomial_cow(qp);
1412 qp->upoly = isl_upoly_mul_isl_int(qp->upoly, v);
1418 isl_qpolynomial_free(qp);
1422 __isl_give isl_qpolynomial *isl_qpolynomial_scale(
1423 __isl_take isl_qpolynomial *qp, isl_int v)
1425 return isl_qpolynomial_mul_isl_int(qp, v);
1428 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1429 __isl_take isl_qpolynomial *qp2)
1431 qp1 = isl_qpolynomial_cow(qp1);
1436 if (qp1->div->n_row < qp2->div->n_row)
1437 return isl_qpolynomial_mul(qp2, qp1);
1439 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1440 if (!compatible_divs(qp1->div, qp2->div))
1441 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1443 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1447 isl_qpolynomial_free(qp2);
1451 isl_qpolynomial_free(qp1);
1452 isl_qpolynomial_free(qp2);
1456 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_qpolynomial *qp,
1459 qp = isl_qpolynomial_cow(qp);
1464 qp->upoly = isl_upoly_pow(qp->upoly, power);
1470 isl_qpolynomial_free(qp);
1474 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1478 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1481 __isl_give isl_qpolynomial *isl_qpolynomial_one(__isl_take isl_dim *dim)
1485 return isl_qpolynomial_alloc(dim, 0, isl_upoly_one(dim->ctx));
1488 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1492 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1495 __isl_give isl_qpolynomial *isl_qpolynomial_neginfty(__isl_take isl_dim *dim)
1499 return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx));
1502 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1506 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1509 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1512 struct isl_qpolynomial *qp;
1513 struct isl_upoly_cst *cst;
1518 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1522 cst = isl_upoly_as_cst(qp->upoly);
1523 isl_int_set(cst->n, v);
1528 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1529 isl_int *n, isl_int *d)
1531 struct isl_upoly_cst *cst;
1536 if (!isl_upoly_is_cst(qp->upoly))
1539 cst = isl_upoly_as_cst(qp->upoly);
1544 isl_int_set(*n, cst->n);
1546 isl_int_set(*d, cst->d);
1551 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1554 struct isl_upoly_rec *rec;
1562 rec = isl_upoly_as_rec(up);
1569 isl_assert(up->ctx, rec->n > 1, return -1);
1571 is_cst = isl_upoly_is_cst(rec->p[1]);
1577 return isl_upoly_is_affine(rec->p[0]);
1580 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1585 if (qp->div->n_row > 0)
1588 return isl_upoly_is_affine(qp->upoly);
1591 static void update_coeff(__isl_keep isl_vec *aff,
1592 __isl_keep struct isl_upoly_cst *cst, int pos)
1597 if (isl_int_is_zero(cst->n))
1602 isl_int_gcd(gcd, cst->d, aff->el[0]);
1603 isl_int_divexact(f, cst->d, gcd);
1604 isl_int_divexact(gcd, aff->el[0], gcd);
1605 isl_seq_scale(aff->el, aff->el, f, aff->size);
1606 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1611 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1612 __isl_keep isl_vec *aff)
1614 struct isl_upoly_cst *cst;
1615 struct isl_upoly_rec *rec;
1621 struct isl_upoly_cst *cst;
1623 cst = isl_upoly_as_cst(up);
1626 update_coeff(aff, cst, 0);
1630 rec = isl_upoly_as_rec(up);
1633 isl_assert(up->ctx, rec->n == 2, return -1);
1635 cst = isl_upoly_as_cst(rec->p[1]);
1638 update_coeff(aff, cst, 1 + up->var);
1640 return isl_upoly_update_affine(rec->p[0], aff);
1643 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1644 __isl_keep isl_qpolynomial *qp)
1652 d = isl_dim_total(qp->dim);
1653 aff = isl_vec_alloc(qp->div->ctx, 2 + d + qp->div->n_row);
1657 isl_seq_clr(aff->el + 1, 1 + d + qp->div->n_row);
1658 isl_int_set_si(aff->el[0], 1);
1660 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1669 int isl_qpolynomial_plain_is_equal(__isl_keep isl_qpolynomial *qp1,
1670 __isl_keep isl_qpolynomial *qp2)
1677 equal = isl_dim_equal(qp1->dim, qp2->dim);
1678 if (equal < 0 || !equal)
1681 equal = isl_mat_is_equal(qp1->div, qp2->div);
1682 if (equal < 0 || !equal)
1685 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1688 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1691 struct isl_upoly_rec *rec;
1693 if (isl_upoly_is_cst(up)) {
1694 struct isl_upoly_cst *cst;
1695 cst = isl_upoly_as_cst(up);
1698 isl_int_lcm(*d, *d, cst->d);
1702 rec = isl_upoly_as_rec(up);
1706 for (i = 0; i < rec->n; ++i)
1707 upoly_update_den(rec->p[i], d);
1710 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1712 isl_int_set_si(*d, 1);
1715 upoly_update_den(qp->upoly, d);
1718 __isl_give isl_qpolynomial *isl_qpolynomial_var_pow(__isl_take isl_dim *dim,
1721 struct isl_ctx *ctx;
1728 return isl_qpolynomial_alloc(dim, 0, isl_upoly_var_pow(ctx, pos, power));
1731 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1732 enum isl_dim_type type, unsigned pos)
1737 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1738 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1740 if (type == isl_dim_set)
1741 pos += isl_dim_size(dim, isl_dim_param);
1743 return isl_qpolynomial_var_pow(dim, pos, 1);
1749 __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up,
1750 unsigned first, unsigned n, __isl_keep struct isl_upoly **subs)
1753 struct isl_upoly_rec *rec;
1754 struct isl_upoly *base, *res;
1759 if (isl_upoly_is_cst(up))
1762 if (up->var < first)
1765 rec = isl_upoly_as_rec(up);
1769 isl_assert(up->ctx, rec->n >= 1, goto error);
1771 if (up->var >= first + n)
1772 base = isl_upoly_var_pow(up->ctx, up->var, 1);
1774 base = isl_upoly_copy(subs[up->var - first]);
1776 res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs);
1777 for (i = rec->n - 2; i >= 0; --i) {
1778 struct isl_upoly *t;
1779 t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs);
1780 res = isl_upoly_mul(res, isl_upoly_copy(base));
1781 res = isl_upoly_sum(res, t);
1784 isl_upoly_free(base);
1793 __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f,
1794 isl_int denom, unsigned len)
1797 struct isl_upoly *up;
1799 isl_assert(ctx, len >= 1, return NULL);
1801 up = isl_upoly_rat_cst(ctx, f[0], denom);
1802 for (i = 0; i < len - 1; ++i) {
1803 struct isl_upoly *t;
1804 struct isl_upoly *c;
1806 if (isl_int_is_zero(f[1 + i]))
1809 c = isl_upoly_rat_cst(ctx, f[1 + i], denom);
1810 t = isl_upoly_var_pow(ctx, i, 1);
1811 t = isl_upoly_mul(c, t);
1812 up = isl_upoly_sum(up, t);
1818 /* Remove common factor of non-constant terms and denominator.
1820 static void normalize_div(__isl_keep isl_qpolynomial *qp, int div)
1822 isl_ctx *ctx = qp->div->ctx;
1823 unsigned total = qp->div->n_col - 2;
1825 isl_seq_gcd(qp->div->row[div] + 2, total, &ctx->normalize_gcd);
1826 isl_int_gcd(ctx->normalize_gcd,
1827 ctx->normalize_gcd, qp->div->row[div][0]);
1828 if (isl_int_is_one(ctx->normalize_gcd))
1831 isl_seq_scale_down(qp->div->row[div] + 2, qp->div->row[div] + 2,
1832 ctx->normalize_gcd, total);
1833 isl_int_divexact(qp->div->row[div][0], qp->div->row[div][0],
1834 ctx->normalize_gcd);
1835 isl_int_fdiv_q(qp->div->row[div][1], qp->div->row[div][1],
1836 ctx->normalize_gcd);
1839 /* Replace the integer division identified by "div" by the polynomial "s".
1840 * The integer division is assumed not to appear in the definition
1841 * of any other integer divisions.
1843 static __isl_give isl_qpolynomial *substitute_div(
1844 __isl_take isl_qpolynomial *qp,
1845 int div, __isl_take struct isl_upoly *s)
1854 qp = isl_qpolynomial_cow(qp);
1858 total = isl_dim_total(qp->dim);
1859 qp->upoly = isl_upoly_subs(qp->upoly, total + div, 1, &s);
1863 reordering = isl_alloc_array(qp->dim->ctx, int, total + qp->div->n_row);
1866 for (i = 0; i < total + div; ++i)
1868 for (i = total + div + 1; i < total + qp->div->n_row; ++i)
1869 reordering[i] = i - 1;
1870 qp->div = isl_mat_drop_rows(qp->div, div, 1);
1871 qp->div = isl_mat_drop_cols(qp->div, 2 + total + div, 1);
1872 qp->upoly = reorder(qp->upoly, reordering);
1875 if (!qp->upoly || !qp->div)
1881 isl_qpolynomial_free(qp);
1886 /* Replace all integer divisions [e/d] that turn out to not actually be integer
1887 * divisions because d is equal to 1 by their definition, i.e., e.
1889 static __isl_give isl_qpolynomial *substitute_non_divs(
1890 __isl_take isl_qpolynomial *qp)
1894 struct isl_upoly *s;
1899 total = isl_dim_total(qp->dim);
1900 for (i = 0; qp && i < qp->div->n_row; ++i) {
1901 if (!isl_int_is_one(qp->div->row[i][0]))
1903 for (j = i + 1; j < qp->div->n_row; ++j) {
1904 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
1906 isl_seq_combine(qp->div->row[j] + 1,
1907 qp->div->ctx->one, qp->div->row[j] + 1,
1908 qp->div->row[j][2 + total + i],
1909 qp->div->row[i] + 1, 1 + total + i);
1910 isl_int_set_si(qp->div->row[j][2 + total + i], 0);
1911 normalize_div(qp, j);
1913 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
1914 qp->div->row[i][0], qp->div->n_col - 1);
1915 qp = substitute_div(qp, i, s);
1922 /* Reduce the coefficients of div "div" to lie in the interval [0, d-1],
1923 * with d the denominator. When replacing the coefficient e of x by
1924 * d * frac(e/d) = e - d * floor(e/d), we are subtracting d * floor(e/d) * x
1925 * inside the division, so we need to add floor(e/d) * x outside.
1926 * That is, we replace q by q' + floor(e/d) * x and we therefore need
1927 * to adjust the coefficient of x in each later div that depends on the
1928 * current div "div" and also in the affine expression "aff"
1929 * (if it too depends on "div").
1931 static void reduce_div(__isl_keep isl_qpolynomial *qp, int div,
1932 __isl_keep isl_vec *aff)
1936 unsigned total = qp->div->n_col - qp->div->n_row - 2;
1939 for (i = 0; i < 1 + total + div; ++i) {
1940 if (isl_int_is_nonneg(qp->div->row[div][1 + i]) &&
1941 isl_int_lt(qp->div->row[div][1 + i], qp->div->row[div][0]))
1943 isl_int_fdiv_q(v, qp->div->row[div][1 + i], qp->div->row[div][0]);
1944 isl_int_fdiv_r(qp->div->row[div][1 + i],
1945 qp->div->row[div][1 + i], qp->div->row[div][0]);
1946 if (!isl_int_is_zero(aff->el[1 + total + div]))
1947 isl_int_addmul(aff->el[i], v, aff->el[1 + total + div]);
1948 for (j = div + 1; j < qp->div->n_row; ++j) {
1949 if (isl_int_is_zero(qp->div->row[j][2 + total + div]))
1951 isl_int_addmul(qp->div->row[j][1 + i],
1952 v, qp->div->row[j][2 + total + div]);
1958 /* Check if the last non-zero coefficient is bigger that half of the
1959 * denominator. If so, we will invert the div to further reduce the number
1960 * of distinct divs that may appear.
1961 * If the last non-zero coefficient is exactly half the denominator,
1962 * then we continue looking for earlier coefficients that are bigger
1963 * than half the denominator.
1965 static int needs_invert(__isl_keep isl_mat *div, int row)
1970 for (i = div->n_col - 1; i >= 1; --i) {
1971 if (isl_int_is_zero(div->row[row][i]))
1973 isl_int_mul_ui(div->row[row][i], div->row[row][i], 2);
1974 cmp = isl_int_cmp(div->row[row][i], div->row[row][0]);
1975 isl_int_divexact_ui(div->row[row][i], div->row[row][i], 2);
1985 /* Replace div "div" q = [e/d] by -[(-e+(d-1))/d].
1986 * We only invert the coefficients of e (and the coefficient of q in
1987 * later divs and in "aff"). After calling this function, the
1988 * coefficients of e should be reduced again.
1990 static void invert_div(__isl_keep isl_qpolynomial *qp, int div,
1991 __isl_keep isl_vec *aff)
1993 unsigned total = qp->div->n_col - qp->div->n_row - 2;
1995 isl_seq_neg(qp->div->row[div] + 1,
1996 qp->div->row[div] + 1, qp->div->n_col - 1);
1997 isl_int_sub_ui(qp->div->row[div][1], qp->div->row[div][1], 1);
1998 isl_int_add(qp->div->row[div][1],
1999 qp->div->row[div][1], qp->div->row[div][0]);
2000 if (!isl_int_is_zero(aff->el[1 + total + div]))
2001 isl_int_neg(aff->el[1 + total + div], aff->el[1 + total + div]);
2002 isl_mat_col_mul(qp->div, 2 + total + div,
2003 qp->div->ctx->negone, 2 + total + div);
2006 /* Assuming "qp" is a monomial, reduce all its divs to have coefficients
2007 * in the interval [0, d-1], with d the denominator and such that the
2008 * last non-zero coefficient that is not equal to d/2 is smaller than d/2.
2010 * After the reduction, some divs may have become redundant or identical,
2011 * so we call substitute_non_divs and sort_divs. If these functions
2012 * eliminate divs or merge two or more divs into one, the coefficients
2013 * of the enclosing divs may have to be reduced again, so we call
2014 * ourselves recursively if the number of divs decreases.
2016 static __isl_give isl_qpolynomial *reduce_divs(__isl_take isl_qpolynomial *qp)
2019 isl_vec *aff = NULL;
2020 struct isl_upoly *s;
2026 aff = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);
2027 aff = isl_vec_clr(aff);
2031 isl_int_set_si(aff->el[1 + qp->upoly->var], 1);
2033 for (i = 0; i < qp->div->n_row; ++i) {
2034 normalize_div(qp, i);
2035 reduce_div(qp, i, aff);
2036 if (needs_invert(qp->div, i)) {
2037 invert_div(qp, i, aff);
2038 reduce_div(qp, i, aff);
2042 s = isl_upoly_from_affine(qp->div->ctx, aff->el,
2043 qp->div->ctx->one, aff->size);
2044 qp->upoly = isl_upoly_subs(qp->upoly, qp->upoly->var, 1, &s);
2051 n_div = qp->div->n_row;
2052 qp = substitute_non_divs(qp);
2054 if (qp && qp->div->n_row < n_div)
2055 return reduce_divs(qp);
2059 isl_qpolynomial_free(qp);
2064 /* Assumes each div only depends on earlier divs.
2066 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
2069 struct isl_qpolynomial *qp = NULL;
2070 struct isl_upoly_rec *rec;
2071 struct isl_upoly_cst *cst;
2078 d = div->line - div->bmap->div;
2080 pos = isl_dim_total(div->bmap->dim) + d;
2081 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
2082 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap),
2083 div->bmap->n_div, &rec->up);
2087 for (i = 0; i < div->bmap->n_div; ++i)
2088 isl_seq_cpy(qp->div->row[i], div->bmap->div[i], qp->div->n_col);
2090 for (i = 0; i < 1 + power; ++i) {
2091 rec->p[i] = isl_upoly_zero(div->ctx);
2096 cst = isl_upoly_as_cst(rec->p[power]);
2097 isl_int_set_si(cst->n, 1);
2101 qp = reduce_divs(qp);
2105 isl_qpolynomial_free(qp);
2110 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
2112 return isl_qpolynomial_div_pow(div, 1);
2115 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
2116 const isl_int n, const isl_int d)
2118 struct isl_qpolynomial *qp;
2119 struct isl_upoly_cst *cst;
2124 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
2128 cst = isl_upoly_as_cst(qp->upoly);
2129 isl_int_set(cst->n, n);
2130 isl_int_set(cst->d, d);
2135 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
2137 struct isl_upoly_rec *rec;
2143 if (isl_upoly_is_cst(up))
2147 active[up->var] = 1;
2149 rec = isl_upoly_as_rec(up);
2150 for (i = 0; i < rec->n; ++i)
2151 if (up_set_active(rec->p[i], active, d) < 0)
2157 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
2160 int d = isl_dim_total(qp->dim);
2165 for (i = 0; i < d; ++i)
2166 for (j = 0; j < qp->div->n_row; ++j) {
2167 if (isl_int_is_zero(qp->div->row[j][2 + i]))
2173 return up_set_active(qp->upoly, active, d);
2176 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
2177 enum isl_dim_type type, unsigned first, unsigned n)
2188 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2190 isl_assert(qp->dim->ctx, type == isl_dim_param ||
2191 type == isl_dim_set, return -1);
2193 active = isl_calloc_array(qp->dim->ctx, int, isl_dim_total(qp->dim));
2194 if (set_active(qp, active) < 0)
2197 if (type == isl_dim_set)
2198 first += isl_dim_size(qp->dim, isl_dim_param);
2199 for (i = 0; i < n; ++i)
2200 if (active[first + i]) {
2213 /* Remove divs that do not appear in the quasi-polynomial, nor in any
2214 * of the divs that do appear in the quasi-polynomial.
2216 static __isl_give isl_qpolynomial *remove_redundant_divs(
2217 __isl_take isl_qpolynomial *qp)
2224 int *reordering = NULL;
2231 if (qp->div->n_row == 0)
2234 d = isl_dim_total(qp->dim);
2235 len = qp->div->n_col - 2;
2236 ctx = isl_qpolynomial_get_ctx(qp);
2237 active = isl_calloc_array(ctx, int, len);
2241 if (up_set_active(qp->upoly, active, len) < 0)
2244 for (i = qp->div->n_row - 1; i >= 0; --i) {
2245 if (!active[d + i]) {
2249 for (j = 0; j < i; ++j) {
2250 if (isl_int_is_zero(qp->div->row[i][2 + d + j]))
2262 reordering = isl_alloc_array(qp->div->ctx, int, len);
2266 for (i = 0; i < d; ++i)
2270 n_div = qp->div->n_row;
2271 for (i = 0; i < n_div; ++i) {
2272 if (!active[d + i]) {
2273 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
2274 qp->div = isl_mat_drop_cols(qp->div,
2275 2 + d + i - skip, 1);
2278 reordering[d + i] = d + i - skip;
2281 qp->upoly = reorder(qp->upoly, reordering);
2283 if (!qp->upoly || !qp->div)
2293 isl_qpolynomial_free(qp);
2297 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
2298 unsigned first, unsigned n)
2301 struct isl_upoly_rec *rec;
2305 if (n == 0 || up->var < 0 || up->var < first)
2307 if (up->var < first + n) {
2308 up = replace_by_constant_term(up);
2309 return isl_upoly_drop(up, first, n);
2311 up = isl_upoly_cow(up);
2315 rec = isl_upoly_as_rec(up);
2319 for (i = 0; i < rec->n; ++i) {
2320 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
2331 __isl_give isl_qpolynomial *isl_qpolynomial_set_dim_name(
2332 __isl_take isl_qpolynomial *qp,
2333 enum isl_dim_type type, unsigned pos, const char *s)
2335 qp = isl_qpolynomial_cow(qp);
2338 qp->dim = isl_dim_set_name(qp->dim, type, pos, s);
2343 isl_qpolynomial_free(qp);
2347 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
2348 __isl_take isl_qpolynomial *qp,
2349 enum isl_dim_type type, unsigned first, unsigned n)
2353 if (n == 0 && !isl_dim_is_named_or_nested(qp->dim, type))
2356 qp = isl_qpolynomial_cow(qp);
2360 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2362 isl_assert(qp->dim->ctx, type == isl_dim_param ||
2363 type == isl_dim_set, goto error);
2365 qp->dim = isl_dim_drop(qp->dim, type, first, n);
2369 if (type == isl_dim_set)
2370 first += isl_dim_size(qp->dim, isl_dim_param);
2372 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
2376 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
2382 isl_qpolynomial_free(qp);
2386 static __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities_lifted(
2387 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
2393 struct isl_upoly *up;
2397 if (eq->n_eq == 0) {
2398 isl_basic_set_free(eq);
2402 qp = isl_qpolynomial_cow(qp);
2405 qp->div = isl_mat_cow(qp->div);
2409 total = 1 + isl_dim_total(eq->dim);
2411 isl_int_init(denom);
2412 for (i = 0; i < eq->n_eq; ++i) {
2413 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
2414 if (j < 0 || j == 0 || j >= total)
2417 for (k = 0; k < qp->div->n_row; ++k) {
2418 if (isl_int_is_zero(qp->div->row[k][1 + j]))
2420 isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total,
2421 &qp->div->row[k][0]);
2422 normalize_div(qp, k);
2425 if (isl_int_is_pos(eq->eq[i][j]))
2426 isl_seq_neg(eq->eq[i], eq->eq[i], total);
2427 isl_int_abs(denom, eq->eq[i][j]);
2428 isl_int_set_si(eq->eq[i][j], 0);
2430 up = isl_upoly_from_affine(qp->dim->ctx,
2431 eq->eq[i], denom, total);
2432 qp->upoly = isl_upoly_subs(qp->upoly, j - 1, 1, &up);
2435 isl_int_clear(denom);
2440 isl_basic_set_free(eq);
2442 qp = substitute_non_divs(qp);
2447 isl_basic_set_free(eq);
2448 isl_qpolynomial_free(qp);
2452 /* Exploit the equalities in "eq" to simplify the quasi-polynomial.
2454 __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities(
2455 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
2459 if (qp->div->n_row > 0)
2460 eq = isl_basic_set_add(eq, isl_dim_set, qp->div->n_row);
2461 return isl_qpolynomial_substitute_equalities_lifted(qp, eq);
2463 isl_basic_set_free(eq);
2464 isl_qpolynomial_free(qp);
2468 static __isl_give isl_basic_set *add_div_constraints(
2469 __isl_take isl_basic_set *bset, __isl_take isl_mat *div)
2477 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2480 total = isl_basic_set_total_dim(bset);
2481 for (i = 0; i < div->n_row; ++i)
2482 if (isl_basic_set_add_div_constraints_var(bset,
2483 total - div->n_row + i, div->row[i]) < 0)
2490 isl_basic_set_free(bset);
2494 /* Look for equalities among the variables shared by context and qp
2495 * and the integer divisions of qp, if any.
2496 * The equalities are then used to eliminate variables and/or integer
2497 * divisions from qp.
2499 __isl_give isl_qpolynomial *isl_qpolynomial_gist(
2500 __isl_take isl_qpolynomial *qp, __isl_take isl_set *context)
2506 if (qp->div->n_row > 0) {
2507 isl_basic_set *bset;
2508 context = isl_set_add_dims(context, isl_dim_set,
2510 bset = isl_basic_set_universe(isl_set_get_dim(context));
2511 bset = add_div_constraints(bset, isl_mat_copy(qp->div));
2512 context = isl_set_intersect(context,
2513 isl_set_from_basic_set(bset));
2516 aff = isl_set_affine_hull(context);
2517 return isl_qpolynomial_substitute_equalities_lifted(qp, aff);
2519 isl_qpolynomial_free(qp);
2520 isl_set_free(context);
2525 #define PW isl_pw_qpolynomial
2527 #define EL isl_qpolynomial
2529 #define EL_IS_ZERO is_zero
2533 #define IS_ZERO is_zero
2537 #include <isl_pw_templ.c>
2540 #define UNION isl_union_pw_qpolynomial
2542 #define PART isl_pw_qpolynomial
2544 #define PARTS pw_qpolynomial
2546 #include <isl_union_templ.c>
2548 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
2556 if (!isl_set_plain_is_universe(pwqp->p[0].set))
2559 return isl_qpolynomial_is_one(pwqp->p[0].qp);
2562 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
2563 __isl_take isl_pw_qpolynomial *pwqp1,
2564 __isl_take isl_pw_qpolynomial *pwqp2)
2567 struct isl_pw_qpolynomial *res;
2569 if (!pwqp1 || !pwqp2)
2572 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
2575 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
2576 isl_pw_qpolynomial_free(pwqp2);
2580 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
2581 isl_pw_qpolynomial_free(pwqp1);
2585 if (isl_pw_qpolynomial_is_one(pwqp1)) {
2586 isl_pw_qpolynomial_free(pwqp1);
2590 if (isl_pw_qpolynomial_is_one(pwqp2)) {
2591 isl_pw_qpolynomial_free(pwqp2);
2595 n = pwqp1->n * pwqp2->n;
2596 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
2598 for (i = 0; i < pwqp1->n; ++i) {
2599 for (j = 0; j < pwqp2->n; ++j) {
2600 struct isl_set *common;
2601 struct isl_qpolynomial *prod;
2602 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
2603 isl_set_copy(pwqp2->p[j].set));
2604 if (isl_set_plain_is_empty(common)) {
2605 isl_set_free(common);
2609 prod = isl_qpolynomial_mul(
2610 isl_qpolynomial_copy(pwqp1->p[i].qp),
2611 isl_qpolynomial_copy(pwqp2->p[j].qp));
2613 res = isl_pw_qpolynomial_add_piece(res, common, prod);
2617 isl_pw_qpolynomial_free(pwqp1);
2618 isl_pw_qpolynomial_free(pwqp2);
2622 isl_pw_qpolynomial_free(pwqp1);
2623 isl_pw_qpolynomial_free(pwqp2);
2627 __isl_give struct isl_upoly *isl_upoly_eval(
2628 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
2631 struct isl_upoly_rec *rec;
2632 struct isl_upoly *res;
2633 struct isl_upoly *base;
2635 if (isl_upoly_is_cst(up)) {
2640 rec = isl_upoly_as_rec(up);
2644 isl_assert(up->ctx, rec->n >= 1, goto error);
2646 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
2648 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
2651 for (i = rec->n - 2; i >= 0; --i) {
2652 res = isl_upoly_mul(res, isl_upoly_copy(base));
2653 res = isl_upoly_sum(res,
2654 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
2655 isl_vec_copy(vec)));
2658 isl_upoly_free(base);
2668 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
2669 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
2672 struct isl_upoly *up;
2677 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
2679 if (qp->div->n_row == 0)
2680 ext = isl_vec_copy(pnt->vec);
2683 unsigned dim = isl_dim_total(qp->dim);
2684 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
2688 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
2689 for (i = 0; i < qp->div->n_row; ++i) {
2690 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
2691 1 + dim + i, &ext->el[1+dim+i]);
2692 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
2693 qp->div->row[i][0]);
2697 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
2701 dim = isl_dim_copy(qp->dim);
2702 isl_qpolynomial_free(qp);
2703 isl_point_free(pnt);
2705 return isl_qpolynomial_alloc(dim, 0, up);
2707 isl_qpolynomial_free(qp);
2708 isl_point_free(pnt);
2712 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
2713 __isl_keep struct isl_upoly_cst *cst2)
2718 isl_int_mul(t, cst1->n, cst2->d);
2719 isl_int_submul(t, cst2->n, cst1->d);
2720 cmp = isl_int_sgn(t);
2725 int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1,
2726 __isl_keep isl_qpolynomial *qp2)
2728 struct isl_upoly_cst *cst1, *cst2;
2732 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), return -1);
2733 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), return -1);
2734 if (isl_qpolynomial_is_nan(qp1))
2736 if (isl_qpolynomial_is_nan(qp2))
2738 cst1 = isl_upoly_as_cst(qp1->upoly);
2739 cst2 = isl_upoly_as_cst(qp2->upoly);
2741 return isl_upoly_cmp(cst1, cst2) <= 0;
2744 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
2745 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2747 struct isl_upoly_cst *cst1, *cst2;
2752 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2753 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2754 cst1 = isl_upoly_as_cst(qp1->upoly);
2755 cst2 = isl_upoly_as_cst(qp2->upoly);
2756 cmp = isl_upoly_cmp(cst1, cst2);
2759 isl_qpolynomial_free(qp2);
2761 isl_qpolynomial_free(qp1);
2766 isl_qpolynomial_free(qp1);
2767 isl_qpolynomial_free(qp2);
2771 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
2772 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2774 struct isl_upoly_cst *cst1, *cst2;
2779 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2780 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2781 cst1 = isl_upoly_as_cst(qp1->upoly);
2782 cst2 = isl_upoly_as_cst(qp2->upoly);
2783 cmp = isl_upoly_cmp(cst1, cst2);
2786 isl_qpolynomial_free(qp2);
2788 isl_qpolynomial_free(qp1);
2793 isl_qpolynomial_free(qp1);
2794 isl_qpolynomial_free(qp2);
2798 __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
2799 __isl_take isl_qpolynomial *qp, enum isl_dim_type type,
2800 unsigned first, unsigned n)
2806 if (n == 0 && !isl_dim_is_named_or_nested(qp->dim, type))
2809 qp = isl_qpolynomial_cow(qp);
2813 isl_assert(qp->div->ctx, first <= isl_dim_size(qp->dim, type),
2816 g_pos = pos(qp->dim, type) + first;
2818 qp->div = isl_mat_insert_zero_cols(qp->div, 2 + g_pos, n);
2822 total = qp->div->n_col - 2;
2823 if (total > g_pos) {
2825 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2828 for (i = 0; i < total - g_pos; ++i)
2830 qp->upoly = expand(qp->upoly, exp, g_pos);
2836 qp->dim = isl_dim_insert(qp->dim, type, first, n);
2842 isl_qpolynomial_free(qp);
2846 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
2847 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2851 pos = isl_qpolynomial_dim(qp, type);
2853 return isl_qpolynomial_insert_dims(qp, type, pos, n);
2856 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2857 __isl_take isl_pw_qpolynomial *pwqp,
2858 enum isl_dim_type type, unsigned n)
2862 pos = isl_pw_qpolynomial_dim(pwqp, type);
2864 return isl_pw_qpolynomial_insert_dims(pwqp, type, pos, n);
2867 static int *reordering_move(isl_ctx *ctx,
2868 unsigned len, unsigned dst, unsigned src, unsigned n)
2873 reordering = isl_alloc_array(ctx, int, len);
2878 for (i = 0; i < dst; ++i)
2880 for (i = 0; i < n; ++i)
2881 reordering[src + i] = dst + i;
2882 for (i = 0; i < src - dst; ++i)
2883 reordering[dst + i] = dst + n + i;
2884 for (i = 0; i < len - src - n; ++i)
2885 reordering[src + n + i] = src + n + i;
2887 for (i = 0; i < src; ++i)
2889 for (i = 0; i < n; ++i)
2890 reordering[src + i] = dst + i;
2891 for (i = 0; i < dst - src; ++i)
2892 reordering[src + n + i] = src + i;
2893 for (i = 0; i < len - dst - n; ++i)
2894 reordering[dst + n + i] = dst + n + i;
2900 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
2901 __isl_take isl_qpolynomial *qp,
2902 enum isl_dim_type dst_type, unsigned dst_pos,
2903 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2909 qp = isl_qpolynomial_cow(qp);
2913 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2916 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2917 g_src_pos = pos(qp->dim, src_type) + src_pos;
2918 if (dst_type > src_type)
2921 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2928 reordering = reordering_move(qp->dim->ctx,
2929 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2933 qp->upoly = reorder(qp->upoly, reordering);
2938 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2944 isl_qpolynomial_free(qp);
2948 __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_dim *dim,
2949 isl_int *f, isl_int denom)
2951 struct isl_upoly *up;
2956 up = isl_upoly_from_affine(dim->ctx, f, denom, 1 + isl_dim_total(dim));
2958 return isl_qpolynomial_alloc(dim, 0, up);
2961 __isl_give isl_qpolynomial *isl_qpolynomial_from_aff(__isl_take isl_aff *aff)
2964 struct isl_upoly *up;
2965 isl_qpolynomial *qp;
2970 ctx = isl_aff_get_ctx(aff);
2971 up = isl_upoly_from_affine(ctx, aff->v->el + 1, aff->v->el[0],
2974 qp = isl_qpolynomial_alloc(isl_aff_get_dim(aff),
2975 aff->ls->div->n_row, up);
2979 isl_mat_free(qp->div);
2980 qp->div = isl_mat_copy(aff->ls->div);
2981 qp->div = isl_mat_cow(qp->div);
2986 qp = reduce_divs(qp);
2987 qp = remove_redundant_divs(qp);
2994 __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
2995 __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
2999 aff = isl_constraint_get_bound(c, type, pos);
3000 isl_constraint_free(c);
3001 return isl_qpolynomial_from_aff(aff);
3004 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
3005 * in "qp" by subs[i].
3007 __isl_give isl_qpolynomial *isl_qpolynomial_substitute(
3008 __isl_take isl_qpolynomial *qp,
3009 enum isl_dim_type type, unsigned first, unsigned n,
3010 __isl_keep isl_qpolynomial **subs)
3013 struct isl_upoly **ups;
3018 qp = isl_qpolynomial_cow(qp);
3021 for (i = 0; i < n; ++i)
3025 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
3028 for (i = 0; i < n; ++i)
3029 isl_assert(qp->dim->ctx, isl_dim_equal(qp->dim, subs[i]->dim),
3032 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
3033 for (i = 0; i < n; ++i)
3034 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
3036 first += pos(qp->dim, type);
3038 ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n);
3041 for (i = 0; i < n; ++i)
3042 ups[i] = subs[i]->upoly;
3044 qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups);
3053 isl_qpolynomial_free(qp);
3057 /* Extend "bset" with extra set dimensions for each integer division
3058 * in "qp" and then call "fn" with the extended bset and the polynomial
3059 * that results from replacing each of the integer divisions by the
3060 * corresponding extra set dimension.
3062 int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
3063 __isl_keep isl_basic_set *bset,
3064 int (*fn)(__isl_take isl_basic_set *bset,
3065 __isl_take isl_qpolynomial *poly, void *user), void *user)
3069 isl_qpolynomial *poly;
3073 if (qp->div->n_row == 0)
3074 return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
3077 div = isl_mat_copy(qp->div);
3078 dim = isl_dim_copy(qp->dim);
3079 dim = isl_dim_add(dim, isl_dim_set, qp->div->n_row);
3080 poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly));
3081 bset = isl_basic_set_copy(bset);
3082 bset = isl_basic_set_add(bset, isl_dim_set, qp->div->n_row);
3083 bset = add_div_constraints(bset, div);
3085 return fn(bset, poly, user);
3090 /* Return total degree in variables first (inclusive) up to last (exclusive).
3092 int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last)
3096 struct isl_upoly_rec *rec;
3100 if (isl_upoly_is_zero(up))
3102 if (isl_upoly_is_cst(up) || up->var < first)
3105 rec = isl_upoly_as_rec(up);
3109 for (i = 0; i < rec->n; ++i) {
3112 if (isl_upoly_is_zero(rec->p[i]))
3114 d = isl_upoly_degree(rec->p[i], first, last);
3124 /* Return total degree in set variables.
3126 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
3134 ovar = isl_dim_offset(poly->dim, isl_dim_set);
3135 nvar = isl_dim_size(poly->dim, isl_dim_set);
3136 return isl_upoly_degree(poly->upoly, ovar, ovar + nvar);
3139 __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up,
3140 unsigned pos, int deg)
3143 struct isl_upoly_rec *rec;
3148 if (isl_upoly_is_cst(up) || up->var < pos) {
3150 return isl_upoly_copy(up);
3152 return isl_upoly_zero(up->ctx);
3155 rec = isl_upoly_as_rec(up);
3159 if (up->var == pos) {
3161 return isl_upoly_copy(rec->p[deg]);
3163 return isl_upoly_zero(up->ctx);
3166 up = isl_upoly_copy(up);
3167 up = isl_upoly_cow(up);
3168 rec = isl_upoly_as_rec(up);
3172 for (i = 0; i < rec->n; ++i) {
3173 struct isl_upoly *t;
3174 t = isl_upoly_coeff(rec->p[i], pos, deg);
3177 isl_upoly_free(rec->p[i]);
3187 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
3189 __isl_give isl_qpolynomial *isl_qpolynomial_coeff(
3190 __isl_keep isl_qpolynomial *qp,
3191 enum isl_dim_type type, unsigned t_pos, int deg)
3194 struct isl_upoly *up;
3200 isl_assert(qp->div->ctx, t_pos < isl_dim_size(qp->dim, type),
3203 g_pos = pos(qp->dim, type) + t_pos;
3204 up = isl_upoly_coeff(qp->upoly, g_pos, deg);
3206 c = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row, up);
3209 isl_mat_free(c->div);
3210 c->div = isl_mat_copy(qp->div);
3215 isl_qpolynomial_free(c);
3219 /* Homogenize the polynomial in the variables first (inclusive) up to
3220 * last (exclusive) by inserting powers of variable first.
3221 * Variable first is assumed not to appear in the input.
3223 __isl_give struct isl_upoly *isl_upoly_homogenize(
3224 __isl_take struct isl_upoly *up, int deg, int target,
3225 int first, int last)
3228 struct isl_upoly_rec *rec;
3232 if (isl_upoly_is_zero(up))
3236 if (isl_upoly_is_cst(up) || up->var < first) {
3237 struct isl_upoly *hom;
3239 hom = isl_upoly_var_pow(up->ctx, first, target - deg);
3242 rec = isl_upoly_as_rec(hom);
3243 rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up);
3248 up = isl_upoly_cow(up);
3249 rec = isl_upoly_as_rec(up);
3253 for (i = 0; i < rec->n; ++i) {
3254 if (isl_upoly_is_zero(rec->p[i]))
3256 rec->p[i] = isl_upoly_homogenize(rec->p[i],
3257 up->var < last ? deg + i : i, target,
3269 /* Homogenize the polynomial in the set variables by introducing
3270 * powers of an extra set variable at position 0.
3272 __isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
3273 __isl_take isl_qpolynomial *poly)
3277 int deg = isl_qpolynomial_degree(poly);
3282 poly = isl_qpolynomial_insert_dims(poly, isl_dim_set, 0, 1);
3283 poly = isl_qpolynomial_cow(poly);
3287 ovar = isl_dim_offset(poly->dim, isl_dim_set);
3288 nvar = isl_dim_size(poly->dim, isl_dim_set);
3289 poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg,
3296 isl_qpolynomial_free(poly);
3300 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
3301 __isl_take isl_mat *div)
3309 n = isl_dim_total(dim) + div->n_row;
3311 term = isl_calloc(dim->ctx, struct isl_term,
3312 sizeof(struct isl_term) + (n - 1) * sizeof(int));
3319 isl_int_init(term->n);
3320 isl_int_init(term->d);
3329 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
3338 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
3347 total = isl_dim_total(term->dim) + term->div->n_row;
3349 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
3353 isl_int_set(dup->n, term->n);
3354 isl_int_set(dup->d, term->d);
3356 for (i = 0; i < total; ++i)
3357 dup->pow[i] = term->pow[i];
3362 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
3370 return isl_term_dup(term);
3373 void isl_term_free(__isl_take isl_term *term)
3378 if (--term->ref > 0)
3381 isl_dim_free(term->dim);
3382 isl_mat_free(term->div);
3383 isl_int_clear(term->n);
3384 isl_int_clear(term->d);
3388 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
3396 case isl_dim_out: return isl_dim_size(term->dim, type);
3397 case isl_dim_div: return term->div->n_row;
3398 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
3403 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
3405 return term ? term->dim->ctx : NULL;
3408 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
3412 isl_int_set(*n, term->n);
3415 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
3419 isl_int_set(*d, term->d);
3422 int isl_term_get_exp(__isl_keep isl_term *term,
3423 enum isl_dim_type type, unsigned pos)
3428 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
3430 if (type >= isl_dim_set)
3431 pos += isl_dim_size(term->dim, isl_dim_param);
3432 if (type >= isl_dim_div)
3433 pos += isl_dim_size(term->dim, isl_dim_set);
3435 return term->pow[pos];
3438 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
3440 isl_basic_map *bmap;
3447 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
3450 total = term->div->n_col - term->div->n_row - 2;
3451 /* No nested divs for now */
3452 isl_assert(term->dim->ctx,
3453 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
3454 term->div->n_row) == -1,
3457 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
3458 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
3461 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
3463 return isl_basic_map_div(bmap, k);
3465 isl_basic_map_free(bmap);
3469 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
3470 int (*fn)(__isl_take isl_term *term, void *user),
3471 __isl_take isl_term *term, void *user)
3474 struct isl_upoly_rec *rec;
3479 if (isl_upoly_is_zero(up))
3482 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
3483 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
3484 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
3486 if (isl_upoly_is_cst(up)) {
3487 struct isl_upoly_cst *cst;
3488 cst = isl_upoly_as_cst(up);
3491 term = isl_term_cow(term);
3494 isl_int_set(term->n, cst->n);
3495 isl_int_set(term->d, cst->d);
3496 if (fn(isl_term_copy(term), user) < 0)
3501 rec = isl_upoly_as_rec(up);
3505 for (i = 0; i < rec->n; ++i) {
3506 term = isl_term_cow(term);
3509 term->pow[up->var] = i;
3510 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
3514 term->pow[up->var] = 0;
3518 isl_term_free(term);
3522 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
3523 int (*fn)(__isl_take isl_term *term, void *user), void *user)
3530 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
3534 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
3536 isl_term_free(term);
3538 return term ? 0 : -1;
3541 __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
3543 struct isl_upoly *up;
3544 isl_qpolynomial *qp;
3550 n = isl_dim_total(term->dim) + term->div->n_row;
3552 up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d);
3553 for (i = 0; i < n; ++i) {
3556 up = isl_upoly_mul(up,
3557 isl_upoly_var_pow(term->dim->ctx, i, term->pow[i]));
3560 qp = isl_qpolynomial_alloc(isl_dim_copy(term->dim), term->div->n_row, up);
3563 isl_mat_free(qp->div);
3564 qp->div = isl_mat_copy(term->div);
3568 isl_term_free(term);
3571 isl_qpolynomial_free(qp);
3572 isl_term_free(term);
3576 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
3577 __isl_take isl_dim *dim)
3586 if (isl_dim_equal(qp->dim, dim)) {
3591 qp = isl_qpolynomial_cow(qp);
3595 extra = isl_dim_size(dim, isl_dim_set) -
3596 isl_dim_size(qp->dim, isl_dim_set);
3597 total = isl_dim_total(qp->dim);
3598 if (qp->div->n_row) {
3601 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
3604 for (i = 0; i < qp->div->n_row; ++i)
3606 qp->upoly = expand(qp->upoly, exp, total);
3611 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
3614 for (i = 0; i < qp->div->n_row; ++i)
3615 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
3617 isl_dim_free(qp->dim);
3623 isl_qpolynomial_free(qp);
3627 /* For each parameter or variable that does not appear in qp,
3628 * first eliminate the variable from all constraints and then set it to zero.
3630 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
3631 __isl_keep isl_qpolynomial *qp)
3642 d = isl_dim_total(set->dim);
3643 active = isl_calloc_array(set->ctx, int, d);
3644 if (set_active(qp, active) < 0)
3647 for (i = 0; i < d; ++i)
3656 nparam = isl_dim_size(set->dim, isl_dim_param);
3657 nvar = isl_dim_size(set->dim, isl_dim_set);
3658 for (i = 0; i < nparam; ++i) {
3661 set = isl_set_eliminate(set, isl_dim_param, i, 1);
3662 set = isl_set_fix_si(set, isl_dim_param, i, 0);
3664 for (i = 0; i < nvar; ++i) {
3665 if (active[nparam + i])
3667 set = isl_set_eliminate(set, isl_dim_set, i, 1);
3668 set = isl_set_fix_si(set, isl_dim_set, i, 0);
3680 struct isl_opt_data {
3681 isl_qpolynomial *qp;
3683 isl_qpolynomial *opt;
3687 static int opt_fn(__isl_take isl_point *pnt, void *user)
3689 struct isl_opt_data *data = (struct isl_opt_data *)user;
3690 isl_qpolynomial *val;
3692 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
3696 } else if (data->max) {
3697 data->opt = isl_qpolynomial_max_cst(data->opt, val);
3699 data->opt = isl_qpolynomial_min_cst(data->opt, val);
3705 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
3706 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
3708 struct isl_opt_data data = { NULL, 1, NULL, max };
3713 if (isl_upoly_is_cst(qp->upoly)) {
3718 set = fix_inactive(set, qp);
3721 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
3725 data.opt = isl_qpolynomial_zero(isl_qpolynomial_get_dim(qp));
3728 isl_qpolynomial_free(qp);
3732 isl_qpolynomial_free(qp);
3733 isl_qpolynomial_free(data.opt);
3737 __isl_give isl_qpolynomial *isl_qpolynomial_morph(__isl_take isl_qpolynomial *qp,
3738 __isl_take isl_morph *morph)
3743 struct isl_upoly **subs;
3744 isl_mat *mat, *diag;
3746 qp = isl_qpolynomial_cow(qp);
3751 isl_assert(ctx, isl_dim_equal(qp->dim, morph->dom->dim), goto error);
3753 n_sub = morph->inv->n_row - 1;
3754 if (morph->inv->n_row != morph->inv->n_col)
3755 n_sub += qp->div->n_row;
3756 subs = isl_calloc_array(ctx, struct isl_upoly *, n_sub);
3760 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3761 subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i],
3762 morph->inv->row[0][0], morph->inv->n_col);
3763 if (morph->inv->n_row != morph->inv->n_col)
3764 for (i = 0; i < qp->div->n_row; ++i)
3765 subs[morph->inv->n_row - 1 + i] =
3766 isl_upoly_var_pow(ctx, morph->inv->n_col - 1 + i, 1);
3768 qp->upoly = isl_upoly_subs(qp->upoly, 0, n_sub, subs);
3770 for (i = 0; i < n_sub; ++i)
3771 isl_upoly_free(subs[i]);
3774 diag = isl_mat_diag(ctx, 1, morph->inv->row[0][0]);
3775 mat = isl_mat_diagonal(diag, isl_mat_copy(morph->inv));
3776 diag = isl_mat_diag(ctx, qp->div->n_row, morph->inv->row[0][0]);
3777 mat = isl_mat_diagonal(mat, diag);
3778 qp->div = isl_mat_product(qp->div, mat);
3779 isl_dim_free(qp->dim);
3780 qp->dim = isl_dim_copy(morph->ran->dim);
3782 if (!qp->upoly || !qp->div || !qp->dim)
3785 isl_morph_free(morph);
3789 isl_qpolynomial_free(qp);
3790 isl_morph_free(morph);
3794 static int neg_entry(void **entry, void *user)
3796 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
3798 *pwqp = isl_pw_qpolynomial_neg(*pwqp);
3800 return *pwqp ? 0 : -1;
3803 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_neg(
3804 __isl_take isl_union_pw_qpolynomial *upwqp)
3806 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
3810 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
3811 &neg_entry, NULL) < 0)
3816 isl_union_pw_qpolynomial_free(upwqp);
3820 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_sub(
3821 __isl_take isl_union_pw_qpolynomial *upwqp1,
3822 __isl_take isl_union_pw_qpolynomial *upwqp2)
3824 return isl_union_pw_qpolynomial_add(upwqp1,
3825 isl_union_pw_qpolynomial_neg(upwqp2));
3828 static int mul_entry(void **entry, void *user)
3830 struct isl_union_pw_qpolynomial_match_bin_data *data = user;
3832 struct isl_hash_table_entry *entry2;
3833 isl_pw_qpolynomial *pwpq = *entry;
3836 hash = isl_dim_get_hash(pwpq->dim);
3837 entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table,
3838 hash, &has_dim, pwpq->dim, 0);
3842 pwpq = isl_pw_qpolynomial_copy(pwpq);
3843 pwpq = isl_pw_qpolynomial_mul(pwpq,
3844 isl_pw_qpolynomial_copy(entry2->data));
3846 empty = isl_pw_qpolynomial_is_zero(pwpq);
3848 isl_pw_qpolynomial_free(pwpq);
3852 isl_pw_qpolynomial_free(pwpq);
3856 data->res = isl_union_pw_qpolynomial_add_pw_qpolynomial(data->res, pwpq);
3861 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
3862 __isl_take isl_union_pw_qpolynomial *upwqp1,
3863 __isl_take isl_union_pw_qpolynomial *upwqp2)
3865 return match_bin_op(upwqp1, upwqp2, &mul_entry);
3868 /* Reorder the columns of the given div definitions according to the
3871 static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div,
3872 __isl_take isl_reordering *r)
3881 extra = isl_dim_total(r->dim) + div->n_row - r->len;
3882 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
3886 for (i = 0; i < div->n_row; ++i) {
3887 isl_seq_cpy(mat->row[i], div->row[i], 2);
3888 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2);
3889 for (j = 0; j < r->len; ++j)
3890 isl_int_set(mat->row[i][2 + r->pos[j]],
3891 div->row[i][2 + j]);
3894 isl_reordering_free(r);
3898 isl_reordering_free(r);
3903 /* Reorder the dimension of "qp" according to the given reordering.
3905 __isl_give isl_qpolynomial *isl_qpolynomial_realign(
3906 __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r)
3908 qp = isl_qpolynomial_cow(qp);
3912 r = isl_reordering_extend(r, qp->div->n_row);
3916 qp->div = reorder_divs(qp->div, isl_reordering_copy(r));
3920 qp->upoly = reorder(qp->upoly, r->pos);
3924 qp = isl_qpolynomial_reset_dim(qp, isl_dim_copy(r->dim));
3926 isl_reordering_free(r);
3929 isl_qpolynomial_free(qp);
3930 isl_reordering_free(r);
3934 __isl_give isl_qpolynomial *isl_qpolynomial_align_params(
3935 __isl_take isl_qpolynomial *qp, __isl_take isl_dim *model)
3940 if (!isl_dim_match(qp->dim, isl_dim_param, model, isl_dim_param)) {
3941 isl_reordering *exp;
3943 model = isl_dim_drop(model, isl_dim_in,
3944 0, isl_dim_size(model, isl_dim_in));
3945 model = isl_dim_drop(model, isl_dim_out,
3946 0, isl_dim_size(model, isl_dim_out));
3947 exp = isl_parameter_alignment_reordering(qp->dim, model);
3948 exp = isl_reordering_extend_dim(exp,
3949 isl_qpolynomial_get_dim(qp));
3950 qp = isl_qpolynomial_realign(qp, exp);
3953 isl_dim_free(model);
3956 isl_dim_free(model);
3957 isl_qpolynomial_free(qp);
3961 struct isl_split_periods_data {
3963 isl_pw_qpolynomial *res;
3966 /* Create a slice where the integer division "div" has the fixed value "v".
3967 * In particular, if "div" refers to floor(f/m), then create a slice
3969 * m v <= f <= m v + (m - 1)
3974 * -f + m v + (m - 1) >= 0
3976 static __isl_give isl_set *set_div_slice(__isl_take isl_dim *dim,
3977 __isl_keep isl_qpolynomial *qp, int div, isl_int v)
3980 isl_basic_set *bset = NULL;
3986 total = isl_dim_total(dim);
3987 bset = isl_basic_set_alloc_dim(isl_dim_copy(dim), 0, 0, 2);
3989 k = isl_basic_set_alloc_inequality(bset);
3992 isl_seq_cpy(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3993 isl_int_submul(bset->ineq[k][0], v, qp->div->row[div][0]);
3995 k = isl_basic_set_alloc_inequality(bset);
3998 isl_seq_neg(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3999 isl_int_addmul(bset->ineq[k][0], v, qp->div->row[div][0]);
4000 isl_int_add(bset->ineq[k][0], bset->ineq[k][0], qp->div->row[div][0]);
4001 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
4004 return isl_set_from_basic_set(bset);
4006 isl_basic_set_free(bset);
4011 static int split_periods(__isl_take isl_set *set,
4012 __isl_take isl_qpolynomial *qp, void *user);
4014 /* Create a slice of the domain "set" such that integer division "div"
4015 * has the fixed value "v" and add the results to data->res,
4016 * replacing the integer division by "v" in "qp".
4018 static int set_div(__isl_take isl_set *set,
4019 __isl_take isl_qpolynomial *qp, int div, isl_int v,
4020 struct isl_split_periods_data *data)
4025 struct isl_upoly *cst;
4027 slice = set_div_slice(isl_set_get_dim(set), qp, div, v);
4028 set = isl_set_intersect(set, slice);
4033 total = isl_dim_total(qp->dim);
4035 for (i = div + 1; i < qp->div->n_row; ++i) {
4036 if (isl_int_is_zero(qp->div->row[i][2 + total + div]))
4038 isl_int_addmul(qp->div->row[i][1],
4039 qp->div->row[i][2 + total + div], v);
4040 isl_int_set_si(qp->div->row[i][2 + total + div], 0);
4043 cst = isl_upoly_rat_cst(qp->dim->ctx, v, qp->dim->ctx->one);
4044 qp = substitute_div(qp, div, cst);
4046 return split_periods(set, qp, data);
4049 isl_qpolynomial_free(qp);
4053 /* Split the domain "set" such that integer division "div"
4054 * has a fixed value (ranging from "min" to "max") on each slice
4055 * and add the results to data->res.
4057 static int split_div(__isl_take isl_set *set,
4058 __isl_take isl_qpolynomial *qp, int div, isl_int min, isl_int max,
4059 struct isl_split_periods_data *data)
4061 for (; isl_int_le(min, max); isl_int_add_ui(min, min, 1)) {
4062 isl_set *set_i = isl_set_copy(set);
4063 isl_qpolynomial *qp_i = isl_qpolynomial_copy(qp);
4065 if (set_div(set_i, qp_i, div, min, data) < 0)
4069 isl_qpolynomial_free(qp);
4073 isl_qpolynomial_free(qp);
4077 /* If "qp" refers to any integer division
4078 * that can only attain "max_periods" distinct values on "set"
4079 * then split the domain along those distinct values.
4080 * Add the results (or the original if no splitting occurs)
4083 static int split_periods(__isl_take isl_set *set,
4084 __isl_take isl_qpolynomial *qp, void *user)
4087 isl_pw_qpolynomial *pwqp;
4088 struct isl_split_periods_data *data;
4093 data = (struct isl_split_periods_data *)user;
4098 if (qp->div->n_row == 0) {
4099 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4100 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
4106 total = isl_dim_total(qp->dim);
4107 for (i = 0; i < qp->div->n_row; ++i) {
4108 enum isl_lp_result lp_res;
4110 if (isl_seq_first_non_zero(qp->div->row[i] + 2 + total,
4111 qp->div->n_row) != -1)
4114 lp_res = isl_set_solve_lp(set, 0, qp->div->row[i] + 1,
4115 set->ctx->one, &min, NULL, NULL);
4116 if (lp_res == isl_lp_error)
4118 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
4120 isl_int_fdiv_q(min, min, qp->div->row[i][0]);
4122 lp_res = isl_set_solve_lp(set, 1, qp->div->row[i] + 1,
4123 set->ctx->one, &max, NULL, NULL);
4124 if (lp_res == isl_lp_error)
4126 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
4128 isl_int_fdiv_q(max, max, qp->div->row[i][0]);
4130 isl_int_sub(max, max, min);
4131 if (isl_int_cmp_si(max, data->max_periods) < 0) {
4132 isl_int_add(max, max, min);
4137 if (i < qp->div->n_row) {
4138 r = split_div(set, qp, i, min, max, data);
4140 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4141 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
4153 isl_qpolynomial_free(qp);
4157 /* If any quasi-polynomial in pwqp refers to any integer division
4158 * that can only attain "max_periods" distinct values on its domain
4159 * then split the domain along those distinct values.
4161 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_periods(
4162 __isl_take isl_pw_qpolynomial *pwqp, int max_periods)
4164 struct isl_split_periods_data data;
4166 data.max_periods = max_periods;
4167 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_dim(pwqp));
4169 if (isl_pw_qpolynomial_foreach_piece(pwqp, &split_periods, &data) < 0)
4172 isl_pw_qpolynomial_free(pwqp);
4176 isl_pw_qpolynomial_free(data.res);
4177 isl_pw_qpolynomial_free(pwqp);
4181 /* Construct a piecewise quasipolynomial that is constant on the given
4182 * domain. In particular, it is
4185 * infinity if cst == -1
4187 static __isl_give isl_pw_qpolynomial *constant_on_domain(
4188 __isl_take isl_basic_set *bset, int cst)
4191 isl_qpolynomial *qp;
4196 bset = isl_basic_map_domain(isl_basic_map_from_range(bset));
4197 dim = isl_basic_set_get_dim(bset);
4199 qp = isl_qpolynomial_infty(dim);
4201 qp = isl_qpolynomial_zero(dim);
4203 qp = isl_qpolynomial_one(dim);
4204 return isl_pw_qpolynomial_alloc(isl_set_from_basic_set(bset), qp);
4207 /* Factor bset, call fn on each of the factors and return the product.
4209 * If no factors can be found, simply call fn on the input.
4210 * Otherwise, construct the factors based on the factorizer,
4211 * call fn on each factor and compute the product.
4213 static __isl_give isl_pw_qpolynomial *compressed_multiplicative_call(
4214 __isl_take isl_basic_set *bset,
4215 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
4221 isl_qpolynomial *qp;
4222 isl_pw_qpolynomial *pwqp;
4226 f = isl_basic_set_factorizer(bset);
4229 if (f->n_group == 0) {
4230 isl_factorizer_free(f);
4234 nparam = isl_basic_set_dim(bset, isl_dim_param);
4235 nvar = isl_basic_set_dim(bset, isl_dim_set);
4237 dim = isl_basic_set_get_dim(bset);
4238 dim = isl_dim_domain(dim);
4239 set = isl_set_universe(isl_dim_copy(dim));
4240 qp = isl_qpolynomial_one(dim);
4241 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4243 bset = isl_morph_basic_set(isl_morph_copy(f->morph), bset);
4245 for (i = 0, n = 0; i < f->n_group; ++i) {
4246 isl_basic_set *bset_i;
4247 isl_pw_qpolynomial *pwqp_i;
4249 bset_i = isl_basic_set_copy(bset);
4250 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
4251 nparam + n + f->len[i], nvar - n - f->len[i]);
4252 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
4254 bset_i = isl_basic_set_drop(bset_i, isl_dim_set,
4255 n + f->len[i], nvar - n - f->len[i]);
4256 bset_i = isl_basic_set_drop(bset_i, isl_dim_set, 0, n);
4258 pwqp_i = fn(bset_i);
4259 pwqp = isl_pw_qpolynomial_mul(pwqp, pwqp_i);
4264 isl_basic_set_free(bset);
4265 isl_factorizer_free(f);
4269 isl_basic_set_free(bset);
4273 /* Factor bset, call fn on each of the factors and return the product.
4274 * The function is assumed to evaluate to zero on empty domains,
4275 * to one on zero-dimensional domains and to infinity on unbounded domains
4276 * and will not be called explicitly on zero-dimensional or unbounded domains.
4278 * We first check for some special cases and remove all equalities.
4279 * Then we hand over control to compressed_multiplicative_call.
4281 __isl_give isl_pw_qpolynomial *isl_basic_set_multiplicative_call(
4282 __isl_take isl_basic_set *bset,
4283 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
4287 isl_pw_qpolynomial *pwqp;
4288 unsigned orig_nvar, final_nvar;
4293 if (isl_basic_set_plain_is_empty(bset))
4294 return constant_on_domain(bset, 0);
4296 orig_nvar = isl_basic_set_dim(bset, isl_dim_set);
4299 return constant_on_domain(bset, 1);
4301 bounded = isl_basic_set_is_bounded(bset);
4305 return constant_on_domain(bset, -1);
4307 if (bset->n_eq == 0)
4308 return compressed_multiplicative_call(bset, fn);
4310 morph = isl_basic_set_full_compression(bset);
4311 bset = isl_morph_basic_set(isl_morph_copy(morph), bset);
4313 final_nvar = isl_basic_set_dim(bset, isl_dim_set);
4315 pwqp = compressed_multiplicative_call(bset, fn);
4317 morph = isl_morph_remove_dom_dims(morph, isl_dim_set, 0, orig_nvar);
4318 morph = isl_morph_remove_ran_dims(morph, isl_dim_set, 0, final_nvar);
4319 morph = isl_morph_inverse(morph);
4321 pwqp = isl_pw_qpolynomial_morph(pwqp, morph);
4325 isl_basic_set_free(bset);
4329 /* Drop all floors in "qp", turning each integer division [a/m] into
4330 * a rational division a/m. If "down" is set, then the integer division
4331 * is replaces by (a-(m-1))/m instead.
4333 static __isl_give isl_qpolynomial *qp_drop_floors(
4334 __isl_take isl_qpolynomial *qp, int down)
4337 struct isl_upoly *s;
4341 if (qp->div->n_row == 0)
4344 qp = isl_qpolynomial_cow(qp);
4348 for (i = qp->div->n_row - 1; i >= 0; --i) {
4350 isl_int_sub(qp->div->row[i][1],
4351 qp->div->row[i][1], qp->div->row[i][0]);
4352 isl_int_add_ui(qp->div->row[i][1],
4353 qp->div->row[i][1], 1);
4355 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
4356 qp->div->row[i][0], qp->div->n_col - 1);
4357 qp = substitute_div(qp, i, s);
4365 /* Drop all floors in "pwqp", turning each integer division [a/m] into
4366 * a rational division a/m.
4368 static __isl_give isl_pw_qpolynomial *pwqp_drop_floors(
4369 __isl_take isl_pw_qpolynomial *pwqp)
4376 if (isl_pw_qpolynomial_is_zero(pwqp))
4379 pwqp = isl_pw_qpolynomial_cow(pwqp);
4383 for (i = 0; i < pwqp->n; ++i) {
4384 pwqp->p[i].qp = qp_drop_floors(pwqp->p[i].qp, 0);
4391 isl_pw_qpolynomial_free(pwqp);
4395 /* Adjust all the integer divisions in "qp" such that they are at least
4396 * one over the given orthant (identified by "signs"). This ensures
4397 * that they will still be non-negative even after subtracting (m-1)/m.
4399 * In particular, f is replaced by f' + v, changing f = [a/m]
4400 * to f' = [(a - m v)/m].
4401 * If the constant term k in a is smaller than m,
4402 * the constant term of v is set to floor(k/m) - 1.
4403 * For any other term, if the coefficient c and the variable x have
4404 * the same sign, then no changes are needed.
4405 * Otherwise, if the variable is positive (and c is negative),
4406 * then the coefficient of x in v is set to floor(c/m).
4407 * If the variable is negative (and c is positive),
4408 * then the coefficient of x in v is set to ceil(c/m).
4410 static __isl_give isl_qpolynomial *make_divs_pos(__isl_take isl_qpolynomial *qp,
4416 struct isl_upoly *s;
4418 qp = isl_qpolynomial_cow(qp);
4421 qp->div = isl_mat_cow(qp->div);
4425 total = isl_dim_total(qp->dim);
4426 v = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);
4428 for (i = 0; i < qp->div->n_row; ++i) {
4429 isl_int *row = qp->div->row[i];
4433 if (isl_int_lt(row[1], row[0])) {
4434 isl_int_fdiv_q(v->el[0], row[1], row[0]);
4435 isl_int_sub_ui(v->el[0], v->el[0], 1);
4436 isl_int_submul(row[1], row[0], v->el[0]);
4438 for (j = 0; j < total; ++j) {
4439 if (isl_int_sgn(row[2 + j]) * signs[j] >= 0)
4442 isl_int_cdiv_q(v->el[1 + j], row[2 + j], row[0]);
4444 isl_int_fdiv_q(v->el[1 + j], row[2 + j], row[0]);
4445 isl_int_submul(row[2 + j], row[0], v->el[1 + j]);
4447 for (j = 0; j < i; ++j) {
4448 if (isl_int_sgn(row[2 + total + j]) >= 0)
4450 isl_int_fdiv_q(v->el[1 + total + j],
4451 row[2 + total + j], row[0]);
4452 isl_int_submul(row[2 + total + j],
4453 row[0], v->el[1 + total + j]);
4455 for (j = i + 1; j < qp->div->n_row; ++j) {
4456 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
4458 isl_seq_combine(qp->div->row[j] + 1,
4459 qp->div->ctx->one, qp->div->row[j] + 1,
4460 qp->div->row[j][2 + total + i], v->el, v->size);
4462 isl_int_set_si(v->el[1 + total + i], 1);
4463 s = isl_upoly_from_affine(qp->dim->ctx, v->el,
4464 qp->div->ctx->one, v->size);
4465 qp->upoly = isl_upoly_subs(qp->upoly, total + i, 1, &s);
4475 isl_qpolynomial_free(qp);
4479 struct isl_to_poly_data {
4481 isl_pw_qpolynomial *res;
4482 isl_qpolynomial *qp;
4485 /* Appoximate data->qp by a polynomial on the orthant identified by "signs".
4486 * We first make all integer divisions positive and then split the
4487 * quasipolynomials into terms with sign data->sign (the direction
4488 * of the requested approximation) and terms with the opposite sign.
4489 * In the first set of terms, each integer division [a/m] is
4490 * overapproximated by a/m, while in the second it is underapproximated
4493 static int to_polynomial_on_orthant(__isl_take isl_set *orthant, int *signs,
4496 struct isl_to_poly_data *data = user;
4497 isl_pw_qpolynomial *t;
4498 isl_qpolynomial *qp, *up, *down;
4500 qp = isl_qpolynomial_copy(data->qp);
4501 qp = make_divs_pos(qp, signs);
4503 up = isl_qpolynomial_terms_of_sign(qp, signs, data->sign);
4504 up = qp_drop_floors(up, 0);
4505 down = isl_qpolynomial_terms_of_sign(qp, signs, -data->sign);
4506 down = qp_drop_floors(down, 1);
4508 isl_qpolynomial_free(qp);
4509 qp = isl_qpolynomial_add(up, down);
4511 t = isl_pw_qpolynomial_alloc(orthant, qp);
4512 data->res = isl_pw_qpolynomial_add_disjoint(data->res, t);
4517 /* Approximate each quasipolynomial by a polynomial. If "sign" is positive,
4518 * the polynomial will be an overapproximation. If "sign" is negative,
4519 * it will be an underapproximation. If "sign" is zero, the approximation
4520 * will lie somewhere in between.
4522 * In particular, is sign == 0, we simply drop the floors, turning
4523 * the integer divisions into rational divisions.
4524 * Otherwise, we split the domains into orthants, make all integer divisions
4525 * positive and then approximate each [a/m] by either a/m or (a-(m-1))/m,
4526 * depending on the requested sign and the sign of the term in which
4527 * the integer division appears.
4529 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_to_polynomial(
4530 __isl_take isl_pw_qpolynomial *pwqp, int sign)
4533 struct isl_to_poly_data data;
4536 return pwqp_drop_floors(pwqp);
4542 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_dim(pwqp));
4544 for (i = 0; i < pwqp->n; ++i) {
4545 if (pwqp->p[i].qp->div->n_row == 0) {
4546 isl_pw_qpolynomial *t;
4547 t = isl_pw_qpolynomial_alloc(
4548 isl_set_copy(pwqp->p[i].set),
4549 isl_qpolynomial_copy(pwqp->p[i].qp));
4550 data.res = isl_pw_qpolynomial_add_disjoint(data.res, t);
4553 data.qp = pwqp->p[i].qp;
4554 if (isl_set_foreach_orthant(pwqp->p[i].set,
4555 &to_polynomial_on_orthant, &data) < 0)
4559 isl_pw_qpolynomial_free(pwqp);
4563 isl_pw_qpolynomial_free(pwqp);
4564 isl_pw_qpolynomial_free(data.res);
4568 static int poly_entry(void **entry, void *user)
4571 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
4573 *pwqp = isl_pw_qpolynomial_to_polynomial(*pwqp, *sign);
4575 return *pwqp ? 0 : -1;
4578 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_to_polynomial(
4579 __isl_take isl_union_pw_qpolynomial *upwqp, int sign)
4581 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
4585 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
4586 &poly_entry, &sign) < 0)
4591 isl_union_pw_qpolynomial_free(upwqp);
4595 __isl_give isl_basic_map *isl_basic_map_from_qpolynomial(
4596 __isl_take isl_qpolynomial *qp)
4600 isl_vec *aff = NULL;
4601 isl_basic_map *bmap = NULL;
4607 if (!isl_upoly_is_affine(qp->upoly))
4608 isl_die(qp->dim->ctx, isl_error_invalid,
4609 "input quasi-polynomial not affine", goto error);
4610 aff = isl_qpolynomial_extract_affine(qp);
4613 dim = isl_qpolynomial_get_dim(qp);
4614 dim = isl_dim_from_domain(dim);
4615 pos = 1 + isl_dim_offset(dim, isl_dim_out);
4616 dim = isl_dim_add(dim, isl_dim_out, 1);
4617 n_div = qp->div->n_row;
4618 bmap = isl_basic_map_alloc_dim(dim, n_div, 1, 2 * n_div);
4620 for (i = 0; i < n_div; ++i) {
4621 k = isl_basic_map_alloc_div(bmap);
4624 isl_seq_cpy(bmap->div[k], qp->div->row[i], qp->div->n_col);
4625 isl_int_set_si(bmap->div[k][qp->div->n_col], 0);
4626 if (isl_basic_map_add_div_constraints(bmap, k) < 0)
4629 k = isl_basic_map_alloc_equality(bmap);
4632 isl_int_neg(bmap->eq[k][pos], aff->el[0]);
4633 isl_seq_cpy(bmap->eq[k], aff->el + 1, pos);
4634 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->el + 1 + pos, n_div);
4637 isl_qpolynomial_free(qp);
4638 bmap = isl_basic_map_finalize(bmap);
4642 isl_qpolynomial_free(qp);
4643 isl_basic_map_free(bmap);