2 * Copyright 2010 INRIA Saclay
4 * Use of this software is governed by the MIT license
6 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
7 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
13 #include <isl_ctx_private.h>
14 #include <isl_map_private.h>
15 #include <isl_factorization.h>
18 #include <isl_union_map_private.h>
19 #include <isl_constraint_private.h>
20 #include <isl_polynomial_private.h>
21 #include <isl_point_private.h>
22 #include <isl_space_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_val_private.h>
28 #include <isl_config.h>
30 static unsigned pos(__isl_keep isl_space *dim, enum isl_dim_type type)
33 case isl_dim_param: return 0;
34 case isl_dim_in: return dim->nparam;
35 case isl_dim_out: return dim->nparam + dim->n_in;
40 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
48 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
53 isl_assert(up->ctx, up->var < 0, return NULL);
55 return (struct isl_upoly_cst *)up;
58 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
63 isl_assert(up->ctx, up->var >= 0, return NULL);
65 return (struct isl_upoly_rec *)up;
68 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
69 __isl_keep struct isl_upoly *up2)
72 struct isl_upoly_rec *rec1, *rec2;
78 if (up1->var != up2->var)
80 if (isl_upoly_is_cst(up1)) {
81 struct isl_upoly_cst *cst1, *cst2;
82 cst1 = isl_upoly_as_cst(up1);
83 cst2 = isl_upoly_as_cst(up2);
86 return isl_int_eq(cst1->n, cst2->n) &&
87 isl_int_eq(cst1->d, cst2->d);
90 rec1 = isl_upoly_as_rec(up1);
91 rec2 = isl_upoly_as_rec(up2);
95 if (rec1->n != rec2->n)
98 for (i = 0; i < rec1->n; ++i) {
99 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
107 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
109 struct isl_upoly_cst *cst;
113 if (!isl_upoly_is_cst(up))
116 cst = isl_upoly_as_cst(up);
120 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
123 int isl_upoly_sgn(__isl_keep struct isl_upoly *up)
125 struct isl_upoly_cst *cst;
129 if (!isl_upoly_is_cst(up))
132 cst = isl_upoly_as_cst(up);
136 return isl_int_sgn(cst->n);
139 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
141 struct isl_upoly_cst *cst;
145 if (!isl_upoly_is_cst(up))
148 cst = isl_upoly_as_cst(up);
152 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
155 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
157 struct isl_upoly_cst *cst;
161 if (!isl_upoly_is_cst(up))
164 cst = isl_upoly_as_cst(up);
168 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
171 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
173 struct isl_upoly_cst *cst;
177 if (!isl_upoly_is_cst(up))
180 cst = isl_upoly_as_cst(up);
184 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
187 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
189 struct isl_upoly_cst *cst;
193 if (!isl_upoly_is_cst(up))
196 cst = isl_upoly_as_cst(up);
200 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
203 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
205 struct isl_upoly_cst *cst;
209 if (!isl_upoly_is_cst(up))
212 cst = isl_upoly_as_cst(up);
216 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
219 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
221 struct isl_upoly_cst *cst;
223 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
232 isl_int_init(cst->n);
233 isl_int_init(cst->d);
238 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
240 struct isl_upoly_cst *cst;
242 cst = isl_upoly_cst_alloc(ctx);
246 isl_int_set_si(cst->n, 0);
247 isl_int_set_si(cst->d, 1);
252 __isl_give struct isl_upoly *isl_upoly_one(struct isl_ctx *ctx)
254 struct isl_upoly_cst *cst;
256 cst = isl_upoly_cst_alloc(ctx);
260 isl_int_set_si(cst->n, 1);
261 isl_int_set_si(cst->d, 1);
266 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
268 struct isl_upoly_cst *cst;
270 cst = isl_upoly_cst_alloc(ctx);
274 isl_int_set_si(cst->n, 1);
275 isl_int_set_si(cst->d, 0);
280 __isl_give struct isl_upoly *isl_upoly_neginfty(struct isl_ctx *ctx)
282 struct isl_upoly_cst *cst;
284 cst = isl_upoly_cst_alloc(ctx);
288 isl_int_set_si(cst->n, -1);
289 isl_int_set_si(cst->d, 0);
294 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
296 struct isl_upoly_cst *cst;
298 cst = isl_upoly_cst_alloc(ctx);
302 isl_int_set_si(cst->n, 0);
303 isl_int_set_si(cst->d, 0);
308 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
309 isl_int n, isl_int d)
311 struct isl_upoly_cst *cst;
313 cst = isl_upoly_cst_alloc(ctx);
317 isl_int_set(cst->n, n);
318 isl_int_set(cst->d, d);
323 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
326 struct isl_upoly_rec *rec;
328 isl_assert(ctx, var >= 0, return NULL);
329 isl_assert(ctx, size >= 0, return NULL);
330 rec = isl_calloc(ctx, struct isl_upoly_rec,
331 sizeof(struct isl_upoly_rec) +
332 size * sizeof(struct isl_upoly *));
347 __isl_give isl_qpolynomial *isl_qpolynomial_reset_domain_space(
348 __isl_take isl_qpolynomial *qp, __isl_take isl_space *dim)
350 qp = isl_qpolynomial_cow(qp);
354 isl_space_free(qp->dim);
359 isl_qpolynomial_free(qp);
364 /* Reset the space of "qp". This function is called from isl_pw_templ.c
365 * and doesn't know if the space of an element object is represented
366 * directly or through its domain. It therefore passes along both.
368 __isl_give isl_qpolynomial *isl_qpolynomial_reset_space_and_domain(
369 __isl_take isl_qpolynomial *qp, __isl_take isl_space *space,
370 __isl_take isl_space *domain)
372 isl_space_free(space);
373 return isl_qpolynomial_reset_domain_space(qp, domain);
376 isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp)
378 return qp ? qp->dim->ctx : NULL;
381 __isl_give isl_space *isl_qpolynomial_get_domain_space(
382 __isl_keep isl_qpolynomial *qp)
384 return qp ? isl_space_copy(qp->dim) : NULL;
387 __isl_give isl_space *isl_qpolynomial_get_space(__isl_keep isl_qpolynomial *qp)
392 space = isl_space_copy(qp->dim);
393 space = isl_space_from_domain(space);
394 space = isl_space_add_dims(space, isl_dim_out, 1);
398 /* Externally, an isl_qpolynomial has a map space, but internally, the
399 * ls field corresponds to the domain of that space.
401 unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp,
402 enum isl_dim_type type)
406 if (type == isl_dim_out)
408 if (type == isl_dim_in)
410 return isl_space_dim(qp->dim, type);
413 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
415 return qp ? isl_upoly_is_zero(qp->upoly) : -1;
418 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
420 return qp ? isl_upoly_is_one(qp->upoly) : -1;
423 int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
425 return qp ? isl_upoly_is_nan(qp->upoly) : -1;
428 int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
430 return qp ? isl_upoly_is_infty(qp->upoly) : -1;
433 int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
435 return qp ? isl_upoly_is_neginfty(qp->upoly) : -1;
438 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
440 return qp ? isl_upoly_sgn(qp->upoly) : 0;
443 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
445 isl_int_clear(cst->n);
446 isl_int_clear(cst->d);
449 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
453 for (i = 0; i < rec->n; ++i)
454 isl_upoly_free(rec->p[i]);
457 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
466 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
468 struct isl_upoly_cst *cst;
469 struct isl_upoly_cst *dup;
471 cst = isl_upoly_as_cst(up);
475 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
478 isl_int_set(dup->n, cst->n);
479 isl_int_set(dup->d, cst->d);
484 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
487 struct isl_upoly_rec *rec;
488 struct isl_upoly_rec *dup;
490 rec = isl_upoly_as_rec(up);
494 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
498 for (i = 0; i < rec->n; ++i) {
499 dup->p[i] = isl_upoly_copy(rec->p[i]);
507 isl_upoly_free(&dup->up);
511 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
516 if (isl_upoly_is_cst(up))
517 return isl_upoly_dup_cst(up);
519 return isl_upoly_dup_rec(up);
522 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
530 return isl_upoly_dup(up);
533 void isl_upoly_free(__isl_take struct isl_upoly *up)
542 upoly_free_cst((struct isl_upoly_cst *)up);
544 upoly_free_rec((struct isl_upoly_rec *)up);
546 isl_ctx_deref(up->ctx);
550 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
555 isl_int_gcd(gcd, cst->n, cst->d);
556 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
557 isl_int_divexact(cst->n, cst->n, gcd);
558 isl_int_divexact(cst->d, cst->d, gcd);
563 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
564 __isl_take struct isl_upoly *up2)
566 struct isl_upoly_cst *cst1;
567 struct isl_upoly_cst *cst2;
569 up1 = isl_upoly_cow(up1);
573 cst1 = isl_upoly_as_cst(up1);
574 cst2 = isl_upoly_as_cst(up2);
576 if (isl_int_eq(cst1->d, cst2->d))
577 isl_int_add(cst1->n, cst1->n, cst2->n);
579 isl_int_mul(cst1->n, cst1->n, cst2->d);
580 isl_int_addmul(cst1->n, cst2->n, cst1->d);
581 isl_int_mul(cst1->d, cst1->d, cst2->d);
584 isl_upoly_cst_reduce(cst1);
594 static __isl_give struct isl_upoly *replace_by_zero(
595 __isl_take struct isl_upoly *up)
603 return isl_upoly_zero(ctx);
606 static __isl_give struct isl_upoly *replace_by_constant_term(
607 __isl_take struct isl_upoly *up)
609 struct isl_upoly_rec *rec;
610 struct isl_upoly *cst;
615 rec = isl_upoly_as_rec(up);
618 cst = isl_upoly_copy(rec->p[0]);
626 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
627 __isl_take struct isl_upoly *up2)
630 struct isl_upoly_rec *rec1, *rec2;
635 if (isl_upoly_is_nan(up1)) {
640 if (isl_upoly_is_nan(up2)) {
645 if (isl_upoly_is_zero(up1)) {
650 if (isl_upoly_is_zero(up2)) {
655 if (up1->var < up2->var)
656 return isl_upoly_sum(up2, up1);
658 if (up2->var < up1->var) {
659 struct isl_upoly_rec *rec;
660 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
664 up1 = isl_upoly_cow(up1);
665 rec = isl_upoly_as_rec(up1);
668 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
670 up1 = replace_by_constant_term(up1);
674 if (isl_upoly_is_cst(up1))
675 return isl_upoly_sum_cst(up1, up2);
677 rec1 = isl_upoly_as_rec(up1);
678 rec2 = isl_upoly_as_rec(up2);
682 if (rec1->n < rec2->n)
683 return isl_upoly_sum(up2, up1);
685 up1 = isl_upoly_cow(up1);
686 rec1 = isl_upoly_as_rec(up1);
690 for (i = rec2->n - 1; i >= 0; --i) {
691 rec1->p[i] = isl_upoly_sum(rec1->p[i],
692 isl_upoly_copy(rec2->p[i]));
695 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
696 isl_upoly_free(rec1->p[i]);
702 up1 = replace_by_zero(up1);
703 else if (rec1->n == 1)
704 up1 = replace_by_constant_term(up1);
715 __isl_give struct isl_upoly *isl_upoly_cst_add_isl_int(
716 __isl_take struct isl_upoly *up, isl_int v)
718 struct isl_upoly_cst *cst;
720 up = isl_upoly_cow(up);
724 cst = isl_upoly_as_cst(up);
726 isl_int_addmul(cst->n, cst->d, v);
731 __isl_give struct isl_upoly *isl_upoly_add_isl_int(
732 __isl_take struct isl_upoly *up, isl_int v)
734 struct isl_upoly_rec *rec;
739 if (isl_upoly_is_cst(up))
740 return isl_upoly_cst_add_isl_int(up, v);
742 up = isl_upoly_cow(up);
743 rec = isl_upoly_as_rec(up);
747 rec->p[0] = isl_upoly_add_isl_int(rec->p[0], v);
757 __isl_give struct isl_upoly *isl_upoly_cst_mul_isl_int(
758 __isl_take struct isl_upoly *up, isl_int v)
760 struct isl_upoly_cst *cst;
762 if (isl_upoly_is_zero(up))
765 up = isl_upoly_cow(up);
769 cst = isl_upoly_as_cst(up);
771 isl_int_mul(cst->n, cst->n, v);
776 __isl_give struct isl_upoly *isl_upoly_mul_isl_int(
777 __isl_take struct isl_upoly *up, isl_int v)
780 struct isl_upoly_rec *rec;
785 if (isl_upoly_is_cst(up))
786 return isl_upoly_cst_mul_isl_int(up, v);
788 up = isl_upoly_cow(up);
789 rec = isl_upoly_as_rec(up);
793 for (i = 0; i < rec->n; ++i) {
794 rec->p[i] = isl_upoly_mul_isl_int(rec->p[i], v);
805 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
806 __isl_take struct isl_upoly *up2)
808 struct isl_upoly_cst *cst1;
809 struct isl_upoly_cst *cst2;
811 up1 = isl_upoly_cow(up1);
815 cst1 = isl_upoly_as_cst(up1);
816 cst2 = isl_upoly_as_cst(up2);
818 isl_int_mul(cst1->n, cst1->n, cst2->n);
819 isl_int_mul(cst1->d, cst1->d, cst2->d);
821 isl_upoly_cst_reduce(cst1);
831 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
832 __isl_take struct isl_upoly *up2)
834 struct isl_upoly_rec *rec1;
835 struct isl_upoly_rec *rec2;
836 struct isl_upoly_rec *res = NULL;
840 rec1 = isl_upoly_as_rec(up1);
841 rec2 = isl_upoly_as_rec(up2);
844 size = rec1->n + rec2->n - 1;
845 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
849 for (i = 0; i < rec1->n; ++i) {
850 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
851 isl_upoly_copy(rec1->p[i]));
856 for (; i < size; ++i) {
857 res->p[i] = isl_upoly_zero(up1->ctx);
862 for (i = 0; i < rec1->n; ++i) {
863 for (j = 1; j < rec2->n; ++j) {
864 struct isl_upoly *up;
865 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
866 isl_upoly_copy(rec1->p[i]));
867 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
880 isl_upoly_free(&res->up);
884 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
885 __isl_take struct isl_upoly *up2)
890 if (isl_upoly_is_nan(up1)) {
895 if (isl_upoly_is_nan(up2)) {
900 if (isl_upoly_is_zero(up1)) {
905 if (isl_upoly_is_zero(up2)) {
910 if (isl_upoly_is_one(up1)) {
915 if (isl_upoly_is_one(up2)) {
920 if (up1->var < up2->var)
921 return isl_upoly_mul(up2, up1);
923 if (up2->var < up1->var) {
925 struct isl_upoly_rec *rec;
926 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
927 isl_ctx *ctx = up1->ctx;
930 return isl_upoly_nan(ctx);
932 up1 = isl_upoly_cow(up1);
933 rec = isl_upoly_as_rec(up1);
937 for (i = 0; i < rec->n; ++i) {
938 rec->p[i] = isl_upoly_mul(rec->p[i],
939 isl_upoly_copy(up2));
947 if (isl_upoly_is_cst(up1))
948 return isl_upoly_mul_cst(up1, up2);
950 return isl_upoly_mul_rec(up1, up2);
957 __isl_give struct isl_upoly *isl_upoly_pow(__isl_take struct isl_upoly *up,
960 struct isl_upoly *res;
968 res = isl_upoly_copy(up);
970 res = isl_upoly_one(up->ctx);
972 while (power >>= 1) {
973 up = isl_upoly_mul(up, isl_upoly_copy(up));
975 res = isl_upoly_mul(res, isl_upoly_copy(up));
982 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_space *dim,
983 unsigned n_div, __isl_take struct isl_upoly *up)
985 struct isl_qpolynomial *qp = NULL;
991 if (!isl_space_is_set(dim))
992 isl_die(isl_space_get_ctx(dim), isl_error_invalid,
993 "domain of polynomial should be a set", goto error);
995 total = isl_space_dim(dim, isl_dim_all);
997 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
1002 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
1011 isl_space_free(dim);
1013 isl_qpolynomial_free(qp);
1017 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
1026 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
1028 struct isl_qpolynomial *dup;
1033 dup = isl_qpolynomial_alloc(isl_space_copy(qp->dim), qp->div->n_row,
1034 isl_upoly_copy(qp->upoly));
1037 isl_mat_free(dup->div);
1038 dup->div = isl_mat_copy(qp->div);
1044 isl_qpolynomial_free(dup);
1048 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
1056 return isl_qpolynomial_dup(qp);
1059 void *isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
1067 isl_space_free(qp->dim);
1068 isl_mat_free(qp->div);
1069 isl_upoly_free(qp->upoly);
1075 __isl_give struct isl_upoly *isl_upoly_var_pow(isl_ctx *ctx, int pos, int power)
1078 struct isl_upoly_rec *rec;
1079 struct isl_upoly_cst *cst;
1081 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
1084 for (i = 0; i < 1 + power; ++i) {
1085 rec->p[i] = isl_upoly_zero(ctx);
1090 cst = isl_upoly_as_cst(rec->p[power]);
1091 isl_int_set_si(cst->n, 1);
1095 isl_upoly_free(&rec->up);
1099 /* r array maps original positions to new positions.
1101 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
1105 struct isl_upoly_rec *rec;
1106 struct isl_upoly *base;
1107 struct isl_upoly *res;
1109 if (isl_upoly_is_cst(up))
1112 rec = isl_upoly_as_rec(up);
1116 isl_assert(up->ctx, rec->n >= 1, goto error);
1118 base = isl_upoly_var_pow(up->ctx, r[up->var], 1);
1119 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
1121 for (i = rec->n - 2; i >= 0; --i) {
1122 res = isl_upoly_mul(res, isl_upoly_copy(base));
1123 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
1126 isl_upoly_free(base);
1135 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
1140 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1141 div1->n_col >= div2->n_col, return -1);
1143 if (div1->n_row == div2->n_row)
1144 return isl_mat_is_equal(div1, div2);
1146 n_row = div1->n_row;
1147 n_col = div1->n_col;
1148 div1->n_row = div2->n_row;
1149 div1->n_col = div2->n_col;
1151 equal = isl_mat_is_equal(div1, div2);
1153 div1->n_row = n_row;
1154 div1->n_col = n_col;
1159 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
1163 li = isl_seq_last_non_zero(div->row[i], div->n_col);
1164 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
1169 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
1172 struct isl_div_sort_info {
1177 static int div_sort_cmp(const void *p1, const void *p2)
1179 const struct isl_div_sort_info *i1, *i2;
1180 i1 = (const struct isl_div_sort_info *) p1;
1181 i2 = (const struct isl_div_sort_info *) p2;
1183 return cmp_row(i1->div, i1->row, i2->row);
1186 /* Sort divs and remove duplicates.
1188 static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp)
1193 struct isl_div_sort_info *array = NULL;
1194 int *pos = NULL, *at = NULL;
1195 int *reordering = NULL;
1200 if (qp->div->n_row <= 1)
1203 div_pos = isl_space_dim(qp->dim, isl_dim_all);
1205 array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info,
1207 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1208 at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1209 len = qp->div->n_col - 2;
1210 reordering = isl_alloc_array(qp->div->ctx, int, len);
1211 if (!array || !pos || !at || !reordering)
1214 for (i = 0; i < qp->div->n_row; ++i) {
1215 array[i].div = qp->div;
1221 qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
1224 for (i = 0; i < div_pos; ++i)
1227 for (i = 0; i < qp->div->n_row; ++i) {
1228 if (pos[array[i].row] == i)
1230 qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]);
1231 pos[at[i]] = pos[array[i].row];
1232 at[pos[array[i].row]] = at[i];
1233 at[i] = array[i].row;
1234 pos[array[i].row] = i;
1238 for (i = 0; i < len - div_pos; ++i) {
1240 isl_seq_eq(qp->div->row[i - skip - 1],
1241 qp->div->row[i - skip], qp->div->n_col)) {
1242 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
1243 isl_mat_col_add(qp->div, 2 + div_pos + i - skip - 1,
1244 2 + div_pos + i - skip);
1245 qp->div = isl_mat_drop_cols(qp->div,
1246 2 + div_pos + i - skip, 1);
1249 reordering[div_pos + array[i].row] = div_pos + i - skip;
1252 qp->upoly = reorder(qp->upoly, reordering);
1254 if (!qp->upoly || !qp->div)
1268 isl_qpolynomial_free(qp);
1272 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1273 int *exp, int first)
1276 struct isl_upoly_rec *rec;
1278 if (isl_upoly_is_cst(up))
1281 if (up->var < first)
1284 if (exp[up->var - first] == up->var - first)
1287 up = isl_upoly_cow(up);
1291 up->var = exp[up->var - first] + first;
1293 rec = isl_upoly_as_rec(up);
1297 for (i = 0; i < rec->n; ++i) {
1298 rec->p[i] = expand(rec->p[i], exp, first);
1309 static __isl_give isl_qpolynomial *with_merged_divs(
1310 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1311 __isl_take isl_qpolynomial *qp2),
1312 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1316 isl_mat *div = NULL;
1318 qp1 = isl_qpolynomial_cow(qp1);
1319 qp2 = isl_qpolynomial_cow(qp2);
1324 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1325 qp1->div->n_col >= qp2->div->n_col, goto error);
1327 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1328 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1332 div = isl_merge_divs(qp1->div, qp2->div, exp1, exp2);
1336 isl_mat_free(qp1->div);
1337 qp1->div = isl_mat_copy(div);
1338 isl_mat_free(qp2->div);
1339 qp2->div = isl_mat_copy(div);
1341 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1342 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1344 if (!qp1->upoly || !qp2->upoly)
1351 return fn(qp1, qp2);
1356 isl_qpolynomial_free(qp1);
1357 isl_qpolynomial_free(qp2);
1361 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1362 __isl_take isl_qpolynomial *qp2)
1364 qp1 = isl_qpolynomial_cow(qp1);
1369 if (qp1->div->n_row < qp2->div->n_row)
1370 return isl_qpolynomial_add(qp2, qp1);
1372 isl_assert(qp1->dim->ctx, isl_space_is_equal(qp1->dim, qp2->dim), goto error);
1373 if (!compatible_divs(qp1->div, qp2->div))
1374 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1376 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1380 isl_qpolynomial_free(qp2);
1384 isl_qpolynomial_free(qp1);
1385 isl_qpolynomial_free(qp2);
1389 __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain(
1390 __isl_keep isl_set *dom,
1391 __isl_take isl_qpolynomial *qp1,
1392 __isl_take isl_qpolynomial *qp2)
1394 qp1 = isl_qpolynomial_add(qp1, qp2);
1395 qp1 = isl_qpolynomial_gist(qp1, isl_set_copy(dom));
1399 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1400 __isl_take isl_qpolynomial *qp2)
1402 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1405 __isl_give isl_qpolynomial *isl_qpolynomial_add_isl_int(
1406 __isl_take isl_qpolynomial *qp, isl_int v)
1408 if (isl_int_is_zero(v))
1411 qp = isl_qpolynomial_cow(qp);
1415 qp->upoly = isl_upoly_add_isl_int(qp->upoly, v);
1421 isl_qpolynomial_free(qp);
1426 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1431 return isl_qpolynomial_mul_isl_int(qp, qp->dim->ctx->negone);
1434 __isl_give isl_qpolynomial *isl_qpolynomial_mul_isl_int(
1435 __isl_take isl_qpolynomial *qp, isl_int v)
1437 if (isl_int_is_one(v))
1440 if (qp && isl_int_is_zero(v)) {
1441 isl_qpolynomial *zero;
1442 zero = isl_qpolynomial_zero_on_domain(isl_space_copy(qp->dim));
1443 isl_qpolynomial_free(qp);
1447 qp = isl_qpolynomial_cow(qp);
1451 qp->upoly = isl_upoly_mul_isl_int(qp->upoly, v);
1457 isl_qpolynomial_free(qp);
1461 __isl_give isl_qpolynomial *isl_qpolynomial_scale(
1462 __isl_take isl_qpolynomial *qp, isl_int v)
1464 return isl_qpolynomial_mul_isl_int(qp, v);
1467 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1468 __isl_take isl_qpolynomial *qp2)
1470 qp1 = isl_qpolynomial_cow(qp1);
1475 if (qp1->div->n_row < qp2->div->n_row)
1476 return isl_qpolynomial_mul(qp2, qp1);
1478 isl_assert(qp1->dim->ctx, isl_space_is_equal(qp1->dim, qp2->dim), goto error);
1479 if (!compatible_divs(qp1->div, qp2->div))
1480 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1482 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1486 isl_qpolynomial_free(qp2);
1490 isl_qpolynomial_free(qp1);
1491 isl_qpolynomial_free(qp2);
1495 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_qpolynomial *qp,
1498 qp = isl_qpolynomial_cow(qp);
1503 qp->upoly = isl_upoly_pow(qp->upoly, power);
1509 isl_qpolynomial_free(qp);
1513 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_pow(
1514 __isl_take isl_pw_qpolynomial *pwqp, unsigned power)
1521 pwqp = isl_pw_qpolynomial_cow(pwqp);
1525 for (i = 0; i < pwqp->n; ++i) {
1526 pwqp->p[i].qp = isl_qpolynomial_pow(pwqp->p[i].qp, power);
1528 return isl_pw_qpolynomial_free(pwqp);
1534 __isl_give isl_qpolynomial *isl_qpolynomial_zero_on_domain(
1535 __isl_take isl_space *dim)
1539 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1542 __isl_give isl_qpolynomial *isl_qpolynomial_one_on_domain(
1543 __isl_take isl_space *dim)
1547 return isl_qpolynomial_alloc(dim, 0, isl_upoly_one(dim->ctx));
1550 __isl_give isl_qpolynomial *isl_qpolynomial_infty_on_domain(
1551 __isl_take isl_space *dim)
1555 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1558 __isl_give isl_qpolynomial *isl_qpolynomial_neginfty_on_domain(
1559 __isl_take isl_space *dim)
1563 return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx));
1566 __isl_give isl_qpolynomial *isl_qpolynomial_nan_on_domain(
1567 __isl_take isl_space *dim)
1571 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1574 __isl_give isl_qpolynomial *isl_qpolynomial_cst_on_domain(
1575 __isl_take isl_space *dim,
1578 struct isl_qpolynomial *qp;
1579 struct isl_upoly_cst *cst;
1584 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1588 cst = isl_upoly_as_cst(qp->upoly);
1589 isl_int_set(cst->n, v);
1594 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1595 isl_int *n, isl_int *d)
1597 struct isl_upoly_cst *cst;
1602 if (!isl_upoly_is_cst(qp->upoly))
1605 cst = isl_upoly_as_cst(qp->upoly);
1610 isl_int_set(*n, cst->n);
1612 isl_int_set(*d, cst->d);
1617 /* Return the constant term of "up".
1619 static __isl_give isl_val *isl_upoly_get_constant_val(
1620 __isl_keep struct isl_upoly *up)
1622 struct isl_upoly_cst *cst;
1627 while (!isl_upoly_is_cst(up)) {
1628 struct isl_upoly_rec *rec;
1630 rec = isl_upoly_as_rec(up);
1636 cst = isl_upoly_as_cst(up);
1639 return isl_val_rat_from_isl_int(cst->up.ctx, cst->n, cst->d);
1642 /* Return the constant term of "qp".
1644 __isl_give isl_val *isl_qpolynomial_get_constant_val(
1645 __isl_keep isl_qpolynomial *qp)
1650 return isl_upoly_get_constant_val(qp->upoly);
1653 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1656 struct isl_upoly_rec *rec;
1664 rec = isl_upoly_as_rec(up);
1671 isl_assert(up->ctx, rec->n > 1, return -1);
1673 is_cst = isl_upoly_is_cst(rec->p[1]);
1679 return isl_upoly_is_affine(rec->p[0]);
1682 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1687 if (qp->div->n_row > 0)
1690 return isl_upoly_is_affine(qp->upoly);
1693 static void update_coeff(__isl_keep isl_vec *aff,
1694 __isl_keep struct isl_upoly_cst *cst, int pos)
1699 if (isl_int_is_zero(cst->n))
1704 isl_int_gcd(gcd, cst->d, aff->el[0]);
1705 isl_int_divexact(f, cst->d, gcd);
1706 isl_int_divexact(gcd, aff->el[0], gcd);
1707 isl_seq_scale(aff->el, aff->el, f, aff->size);
1708 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1713 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1714 __isl_keep isl_vec *aff)
1716 struct isl_upoly_cst *cst;
1717 struct isl_upoly_rec *rec;
1723 struct isl_upoly_cst *cst;
1725 cst = isl_upoly_as_cst(up);
1728 update_coeff(aff, cst, 0);
1732 rec = isl_upoly_as_rec(up);
1735 isl_assert(up->ctx, rec->n == 2, return -1);
1737 cst = isl_upoly_as_cst(rec->p[1]);
1740 update_coeff(aff, cst, 1 + up->var);
1742 return isl_upoly_update_affine(rec->p[0], aff);
1745 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1746 __isl_keep isl_qpolynomial *qp)
1754 d = isl_space_dim(qp->dim, isl_dim_all);
1755 aff = isl_vec_alloc(qp->div->ctx, 2 + d + qp->div->n_row);
1759 isl_seq_clr(aff->el + 1, 1 + d + qp->div->n_row);
1760 isl_int_set_si(aff->el[0], 1);
1762 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1771 int isl_qpolynomial_plain_is_equal(__isl_keep isl_qpolynomial *qp1,
1772 __isl_keep isl_qpolynomial *qp2)
1779 equal = isl_space_is_equal(qp1->dim, qp2->dim);
1780 if (equal < 0 || !equal)
1783 equal = isl_mat_is_equal(qp1->div, qp2->div);
1784 if (equal < 0 || !equal)
1787 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1790 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1793 struct isl_upoly_rec *rec;
1795 if (isl_upoly_is_cst(up)) {
1796 struct isl_upoly_cst *cst;
1797 cst = isl_upoly_as_cst(up);
1800 isl_int_lcm(*d, *d, cst->d);
1804 rec = isl_upoly_as_rec(up);
1808 for (i = 0; i < rec->n; ++i)
1809 upoly_update_den(rec->p[i], d);
1812 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1814 isl_int_set_si(*d, 1);
1817 upoly_update_den(qp->upoly, d);
1820 __isl_give isl_qpolynomial *isl_qpolynomial_var_pow_on_domain(
1821 __isl_take isl_space *dim, int pos, int power)
1823 struct isl_ctx *ctx;
1830 return isl_qpolynomial_alloc(dim, 0, isl_upoly_var_pow(ctx, pos, power));
1833 __isl_give isl_qpolynomial *isl_qpolynomial_var_on_domain(__isl_take isl_space *dim,
1834 enum isl_dim_type type, unsigned pos)
1839 isl_assert(dim->ctx, isl_space_dim(dim, isl_dim_in) == 0, goto error);
1840 isl_assert(dim->ctx, pos < isl_space_dim(dim, type), goto error);
1842 if (type == isl_dim_set)
1843 pos += isl_space_dim(dim, isl_dim_param);
1845 return isl_qpolynomial_var_pow_on_domain(dim, pos, 1);
1847 isl_space_free(dim);
1851 __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up,
1852 unsigned first, unsigned n, __isl_keep struct isl_upoly **subs)
1855 struct isl_upoly_rec *rec;
1856 struct isl_upoly *base, *res;
1861 if (isl_upoly_is_cst(up))
1864 if (up->var < first)
1867 rec = isl_upoly_as_rec(up);
1871 isl_assert(up->ctx, rec->n >= 1, goto error);
1873 if (up->var >= first + n)
1874 base = isl_upoly_var_pow(up->ctx, up->var, 1);
1876 base = isl_upoly_copy(subs[up->var - first]);
1878 res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs);
1879 for (i = rec->n - 2; i >= 0; --i) {
1880 struct isl_upoly *t;
1881 t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs);
1882 res = isl_upoly_mul(res, isl_upoly_copy(base));
1883 res = isl_upoly_sum(res, t);
1886 isl_upoly_free(base);
1895 __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f,
1896 isl_int denom, unsigned len)
1899 struct isl_upoly *up;
1901 isl_assert(ctx, len >= 1, return NULL);
1903 up = isl_upoly_rat_cst(ctx, f[0], denom);
1904 for (i = 0; i < len - 1; ++i) {
1905 struct isl_upoly *t;
1906 struct isl_upoly *c;
1908 if (isl_int_is_zero(f[1 + i]))
1911 c = isl_upoly_rat_cst(ctx, f[1 + i], denom);
1912 t = isl_upoly_var_pow(ctx, i, 1);
1913 t = isl_upoly_mul(c, t);
1914 up = isl_upoly_sum(up, t);
1920 /* Remove common factor of non-constant terms and denominator.
1922 static void normalize_div(__isl_keep isl_qpolynomial *qp, int div)
1924 isl_ctx *ctx = qp->div->ctx;
1925 unsigned total = qp->div->n_col - 2;
1927 isl_seq_gcd(qp->div->row[div] + 2, total, &ctx->normalize_gcd);
1928 isl_int_gcd(ctx->normalize_gcd,
1929 ctx->normalize_gcd, qp->div->row[div][0]);
1930 if (isl_int_is_one(ctx->normalize_gcd))
1933 isl_seq_scale_down(qp->div->row[div] + 2, qp->div->row[div] + 2,
1934 ctx->normalize_gcd, total);
1935 isl_int_divexact(qp->div->row[div][0], qp->div->row[div][0],
1936 ctx->normalize_gcd);
1937 isl_int_fdiv_q(qp->div->row[div][1], qp->div->row[div][1],
1938 ctx->normalize_gcd);
1941 /* Replace the integer division identified by "div" by the polynomial "s".
1942 * The integer division is assumed not to appear in the definition
1943 * of any other integer divisions.
1945 static __isl_give isl_qpolynomial *substitute_div(
1946 __isl_take isl_qpolynomial *qp,
1947 int div, __isl_take struct isl_upoly *s)
1956 qp = isl_qpolynomial_cow(qp);
1960 total = isl_space_dim(qp->dim, isl_dim_all);
1961 qp->upoly = isl_upoly_subs(qp->upoly, total + div, 1, &s);
1965 reordering = isl_alloc_array(qp->dim->ctx, int, total + qp->div->n_row);
1968 for (i = 0; i < total + div; ++i)
1970 for (i = total + div + 1; i < total + qp->div->n_row; ++i)
1971 reordering[i] = i - 1;
1972 qp->div = isl_mat_drop_rows(qp->div, div, 1);
1973 qp->div = isl_mat_drop_cols(qp->div, 2 + total + div, 1);
1974 qp->upoly = reorder(qp->upoly, reordering);
1977 if (!qp->upoly || !qp->div)
1983 isl_qpolynomial_free(qp);
1988 /* Replace all integer divisions [e/d] that turn out to not actually be integer
1989 * divisions because d is equal to 1 by their definition, i.e., e.
1991 static __isl_give isl_qpolynomial *substitute_non_divs(
1992 __isl_take isl_qpolynomial *qp)
1996 struct isl_upoly *s;
2001 total = isl_space_dim(qp->dim, isl_dim_all);
2002 for (i = 0; qp && i < qp->div->n_row; ++i) {
2003 if (!isl_int_is_one(qp->div->row[i][0]))
2005 for (j = i + 1; j < qp->div->n_row; ++j) {
2006 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
2008 isl_seq_combine(qp->div->row[j] + 1,
2009 qp->div->ctx->one, qp->div->row[j] + 1,
2010 qp->div->row[j][2 + total + i],
2011 qp->div->row[i] + 1, 1 + total + i);
2012 isl_int_set_si(qp->div->row[j][2 + total + i], 0);
2013 normalize_div(qp, j);
2015 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
2016 qp->div->row[i][0], qp->div->n_col - 1);
2017 qp = substitute_div(qp, i, s);
2024 /* Reduce the coefficients of div "div" to lie in the interval [0, d-1],
2025 * with d the denominator. When replacing the coefficient e of x by
2026 * d * frac(e/d) = e - d * floor(e/d), we are subtracting d * floor(e/d) * x
2027 * inside the division, so we need to add floor(e/d) * x outside.
2028 * That is, we replace q by q' + floor(e/d) * x and we therefore need
2029 * to adjust the coefficient of x in each later div that depends on the
2030 * current div "div" and also in the affine expression "aff"
2031 * (if it too depends on "div").
2033 static void reduce_div(__isl_keep isl_qpolynomial *qp, int div,
2034 __isl_keep isl_vec *aff)
2038 unsigned total = qp->div->n_col - qp->div->n_row - 2;
2041 for (i = 0; i < 1 + total + div; ++i) {
2042 if (isl_int_is_nonneg(qp->div->row[div][1 + i]) &&
2043 isl_int_lt(qp->div->row[div][1 + i], qp->div->row[div][0]))
2045 isl_int_fdiv_q(v, qp->div->row[div][1 + i], qp->div->row[div][0]);
2046 isl_int_fdiv_r(qp->div->row[div][1 + i],
2047 qp->div->row[div][1 + i], qp->div->row[div][0]);
2048 if (!isl_int_is_zero(aff->el[1 + total + div]))
2049 isl_int_addmul(aff->el[i], v, aff->el[1 + total + div]);
2050 for (j = div + 1; j < qp->div->n_row; ++j) {
2051 if (isl_int_is_zero(qp->div->row[j][2 + total + div]))
2053 isl_int_addmul(qp->div->row[j][1 + i],
2054 v, qp->div->row[j][2 + total + div]);
2060 /* Check if the last non-zero coefficient is bigger that half of the
2061 * denominator. If so, we will invert the div to further reduce the number
2062 * of distinct divs that may appear.
2063 * If the last non-zero coefficient is exactly half the denominator,
2064 * then we continue looking for earlier coefficients that are bigger
2065 * than half the denominator.
2067 static int needs_invert(__isl_keep isl_mat *div, int row)
2072 for (i = div->n_col - 1; i >= 1; --i) {
2073 if (isl_int_is_zero(div->row[row][i]))
2075 isl_int_mul_ui(div->row[row][i], div->row[row][i], 2);
2076 cmp = isl_int_cmp(div->row[row][i], div->row[row][0]);
2077 isl_int_divexact_ui(div->row[row][i], div->row[row][i], 2);
2087 /* Replace div "div" q = [e/d] by -[(-e+(d-1))/d].
2088 * We only invert the coefficients of e (and the coefficient of q in
2089 * later divs and in "aff"). After calling this function, the
2090 * coefficients of e should be reduced again.
2092 static void invert_div(__isl_keep isl_qpolynomial *qp, int div,
2093 __isl_keep isl_vec *aff)
2095 unsigned total = qp->div->n_col - qp->div->n_row - 2;
2097 isl_seq_neg(qp->div->row[div] + 1,
2098 qp->div->row[div] + 1, qp->div->n_col - 1);
2099 isl_int_sub_ui(qp->div->row[div][1], qp->div->row[div][1], 1);
2100 isl_int_add(qp->div->row[div][1],
2101 qp->div->row[div][1], qp->div->row[div][0]);
2102 if (!isl_int_is_zero(aff->el[1 + total + div]))
2103 isl_int_neg(aff->el[1 + total + div], aff->el[1 + total + div]);
2104 isl_mat_col_mul(qp->div, 2 + total + div,
2105 qp->div->ctx->negone, 2 + total + div);
2108 /* Assuming "qp" is a monomial, reduce all its divs to have coefficients
2109 * in the interval [0, d-1], with d the denominator and such that the
2110 * last non-zero coefficient that is not equal to d/2 is smaller than d/2.
2112 * After the reduction, some divs may have become redundant or identical,
2113 * so we call substitute_non_divs and sort_divs. If these functions
2114 * eliminate divs or merge two or more divs into one, the coefficients
2115 * of the enclosing divs may have to be reduced again, so we call
2116 * ourselves recursively if the number of divs decreases.
2118 static __isl_give isl_qpolynomial *reduce_divs(__isl_take isl_qpolynomial *qp)
2121 isl_vec *aff = NULL;
2122 struct isl_upoly *s;
2128 aff = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);
2129 aff = isl_vec_clr(aff);
2133 isl_int_set_si(aff->el[1 + qp->upoly->var], 1);
2135 for (i = 0; i < qp->div->n_row; ++i) {
2136 normalize_div(qp, i);
2137 reduce_div(qp, i, aff);
2138 if (needs_invert(qp->div, i)) {
2139 invert_div(qp, i, aff);
2140 reduce_div(qp, i, aff);
2144 s = isl_upoly_from_affine(qp->div->ctx, aff->el,
2145 qp->div->ctx->one, aff->size);
2146 qp->upoly = isl_upoly_subs(qp->upoly, qp->upoly->var, 1, &s);
2153 n_div = qp->div->n_row;
2154 qp = substitute_non_divs(qp);
2156 if (qp && qp->div->n_row < n_div)
2157 return reduce_divs(qp);
2161 isl_qpolynomial_free(qp);
2166 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst_on_domain(
2167 __isl_take isl_space *dim, const isl_int n, const isl_int d)
2169 struct isl_qpolynomial *qp;
2170 struct isl_upoly_cst *cst;
2175 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
2179 cst = isl_upoly_as_cst(qp->upoly);
2180 isl_int_set(cst->n, n);
2181 isl_int_set(cst->d, d);
2186 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
2188 struct isl_upoly_rec *rec;
2194 if (isl_upoly_is_cst(up))
2198 active[up->var] = 1;
2200 rec = isl_upoly_as_rec(up);
2201 for (i = 0; i < rec->n; ++i)
2202 if (up_set_active(rec->p[i], active, d) < 0)
2208 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
2211 int d = isl_space_dim(qp->dim, isl_dim_all);
2216 for (i = 0; i < d; ++i)
2217 for (j = 0; j < qp->div->n_row; ++j) {
2218 if (isl_int_is_zero(qp->div->row[j][2 + i]))
2224 return up_set_active(qp->upoly, active, d);
2227 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
2228 enum isl_dim_type type, unsigned first, unsigned n)
2239 isl_assert(qp->dim->ctx,
2240 first + n <= isl_qpolynomial_dim(qp, type), return -1);
2241 isl_assert(qp->dim->ctx, type == isl_dim_param ||
2242 type == isl_dim_in, return -1);
2244 active = isl_calloc_array(qp->dim->ctx, int,
2245 isl_space_dim(qp->dim, isl_dim_all));
2246 if (set_active(qp, active) < 0)
2249 if (type == isl_dim_in)
2250 first += isl_space_dim(qp->dim, isl_dim_param);
2251 for (i = 0; i < n; ++i)
2252 if (active[first + i]) {
2265 /* Remove divs that do not appear in the quasi-polynomial, nor in any
2266 * of the divs that do appear in the quasi-polynomial.
2268 static __isl_give isl_qpolynomial *remove_redundant_divs(
2269 __isl_take isl_qpolynomial *qp)
2276 int *reordering = NULL;
2283 if (qp->div->n_row == 0)
2286 d = isl_space_dim(qp->dim, isl_dim_all);
2287 len = qp->div->n_col - 2;
2288 ctx = isl_qpolynomial_get_ctx(qp);
2289 active = isl_calloc_array(ctx, int, len);
2293 if (up_set_active(qp->upoly, active, len) < 0)
2296 for (i = qp->div->n_row - 1; i >= 0; --i) {
2297 if (!active[d + i]) {
2301 for (j = 0; j < i; ++j) {
2302 if (isl_int_is_zero(qp->div->row[i][2 + d + j]))
2314 reordering = isl_alloc_array(qp->div->ctx, int, len);
2318 for (i = 0; i < d; ++i)
2322 n_div = qp->div->n_row;
2323 for (i = 0; i < n_div; ++i) {
2324 if (!active[d + i]) {
2325 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
2326 qp->div = isl_mat_drop_cols(qp->div,
2327 2 + d + i - skip, 1);
2330 reordering[d + i] = d + i - skip;
2333 qp->upoly = reorder(qp->upoly, reordering);
2335 if (!qp->upoly || !qp->div)
2345 isl_qpolynomial_free(qp);
2349 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
2350 unsigned first, unsigned n)
2353 struct isl_upoly_rec *rec;
2357 if (n == 0 || up->var < 0 || up->var < first)
2359 if (up->var < first + n) {
2360 up = replace_by_constant_term(up);
2361 return isl_upoly_drop(up, first, n);
2363 up = isl_upoly_cow(up);
2367 rec = isl_upoly_as_rec(up);
2371 for (i = 0; i < rec->n; ++i) {
2372 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
2383 __isl_give isl_qpolynomial *isl_qpolynomial_set_dim_name(
2384 __isl_take isl_qpolynomial *qp,
2385 enum isl_dim_type type, unsigned pos, const char *s)
2387 qp = isl_qpolynomial_cow(qp);
2390 qp->dim = isl_space_set_dim_name(qp->dim, type, pos, s);
2395 isl_qpolynomial_free(qp);
2399 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
2400 __isl_take isl_qpolynomial *qp,
2401 enum isl_dim_type type, unsigned first, unsigned n)
2405 if (type == isl_dim_out)
2406 isl_die(qp->dim->ctx, isl_error_invalid,
2407 "cannot drop output/set dimension",
2409 if (type == isl_dim_in)
2411 if (n == 0 && !isl_space_is_named_or_nested(qp->dim, type))
2414 qp = isl_qpolynomial_cow(qp);
2418 isl_assert(qp->dim->ctx, first + n <= isl_space_dim(qp->dim, type),
2420 isl_assert(qp->dim->ctx, type == isl_dim_param ||
2421 type == isl_dim_set, goto error);
2423 qp->dim = isl_space_drop_dims(qp->dim, type, first, n);
2427 if (type == isl_dim_set)
2428 first += isl_space_dim(qp->dim, isl_dim_param);
2430 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
2434 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
2440 isl_qpolynomial_free(qp);
2444 /* Project the domain of the quasi-polynomial onto its parameter space.
2445 * The quasi-polynomial may not involve any of the domain dimensions.
2447 __isl_give isl_qpolynomial *isl_qpolynomial_project_domain_on_params(
2448 __isl_take isl_qpolynomial *qp)
2454 n = isl_qpolynomial_dim(qp, isl_dim_in);
2455 involves = isl_qpolynomial_involves_dims(qp, isl_dim_in, 0, n);
2457 return isl_qpolynomial_free(qp);
2459 isl_die(isl_qpolynomial_get_ctx(qp), isl_error_invalid,
2460 "polynomial involves some of the domain dimensions",
2461 return isl_qpolynomial_free(qp));
2462 qp = isl_qpolynomial_drop_dims(qp, isl_dim_in, 0, n);
2463 space = isl_qpolynomial_get_domain_space(qp);
2464 space = isl_space_params(space);
2465 qp = isl_qpolynomial_reset_domain_space(qp, space);
2469 static __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities_lifted(
2470 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
2476 struct isl_upoly *up;
2480 if (eq->n_eq == 0) {
2481 isl_basic_set_free(eq);
2485 qp = isl_qpolynomial_cow(qp);
2488 qp->div = isl_mat_cow(qp->div);
2492 total = 1 + isl_space_dim(eq->dim, isl_dim_all);
2494 isl_int_init(denom);
2495 for (i = 0; i < eq->n_eq; ++i) {
2496 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
2497 if (j < 0 || j == 0 || j >= total)
2500 for (k = 0; k < qp->div->n_row; ++k) {
2501 if (isl_int_is_zero(qp->div->row[k][1 + j]))
2503 isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total,
2504 &qp->div->row[k][0]);
2505 normalize_div(qp, k);
2508 if (isl_int_is_pos(eq->eq[i][j]))
2509 isl_seq_neg(eq->eq[i], eq->eq[i], total);
2510 isl_int_abs(denom, eq->eq[i][j]);
2511 isl_int_set_si(eq->eq[i][j], 0);
2513 up = isl_upoly_from_affine(qp->dim->ctx,
2514 eq->eq[i], denom, total);
2515 qp->upoly = isl_upoly_subs(qp->upoly, j - 1, 1, &up);
2518 isl_int_clear(denom);
2523 isl_basic_set_free(eq);
2525 qp = substitute_non_divs(qp);
2530 isl_basic_set_free(eq);
2531 isl_qpolynomial_free(qp);
2535 /* Exploit the equalities in "eq" to simplify the quasi-polynomial.
2537 __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities(
2538 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
2542 if (qp->div->n_row > 0)
2543 eq = isl_basic_set_add_dims(eq, isl_dim_set, qp->div->n_row);
2544 return isl_qpolynomial_substitute_equalities_lifted(qp, eq);
2546 isl_basic_set_free(eq);
2547 isl_qpolynomial_free(qp);
2551 static __isl_give isl_basic_set *add_div_constraints(
2552 __isl_take isl_basic_set *bset, __isl_take isl_mat *div)
2560 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2563 total = isl_basic_set_total_dim(bset);
2564 for (i = 0; i < div->n_row; ++i)
2565 if (isl_basic_set_add_div_constraints_var(bset,
2566 total - div->n_row + i, div->row[i]) < 0)
2573 isl_basic_set_free(bset);
2577 /* Look for equalities among the variables shared by context and qp
2578 * and the integer divisions of qp, if any.
2579 * The equalities are then used to eliminate variables and/or integer
2580 * divisions from qp.
2582 __isl_give isl_qpolynomial *isl_qpolynomial_gist(
2583 __isl_take isl_qpolynomial *qp, __isl_take isl_set *context)
2589 if (qp->div->n_row > 0) {
2590 isl_basic_set *bset;
2591 context = isl_set_add_dims(context, isl_dim_set,
2593 bset = isl_basic_set_universe(isl_set_get_space(context));
2594 bset = add_div_constraints(bset, isl_mat_copy(qp->div));
2595 context = isl_set_intersect(context,
2596 isl_set_from_basic_set(bset));
2599 aff = isl_set_affine_hull(context);
2600 return isl_qpolynomial_substitute_equalities_lifted(qp, aff);
2602 isl_qpolynomial_free(qp);
2603 isl_set_free(context);
2607 __isl_give isl_qpolynomial *isl_qpolynomial_gist_params(
2608 __isl_take isl_qpolynomial *qp, __isl_take isl_set *context)
2610 isl_space *space = isl_qpolynomial_get_domain_space(qp);
2611 isl_set *dom_context = isl_set_universe(space);
2612 dom_context = isl_set_intersect_params(dom_context, context);
2613 return isl_qpolynomial_gist(qp, dom_context);
2616 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_from_qpolynomial(
2617 __isl_take isl_qpolynomial *qp)
2623 if (isl_qpolynomial_is_zero(qp)) {
2624 isl_space *dim = isl_qpolynomial_get_space(qp);
2625 isl_qpolynomial_free(qp);
2626 return isl_pw_qpolynomial_zero(dim);
2629 dom = isl_set_universe(isl_qpolynomial_get_domain_space(qp));
2630 return isl_pw_qpolynomial_alloc(dom, qp);
2634 #define PW isl_pw_qpolynomial
2636 #define EL isl_qpolynomial
2638 #define EL_IS_ZERO is_zero
2642 #define IS_ZERO is_zero
2645 #undef DEFAULT_IS_ZERO
2646 #define DEFAULT_IS_ZERO 1
2650 #include <isl_pw_templ.c>
2653 #define UNION isl_union_pw_qpolynomial
2655 #define PART isl_pw_qpolynomial
2657 #define PARTS pw_qpolynomial
2658 #define ALIGN_DOMAIN
2660 #include <isl_union_templ.c>
2662 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
2670 if (!isl_set_plain_is_universe(pwqp->p[0].set))
2673 return isl_qpolynomial_is_one(pwqp->p[0].qp);
2676 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add(
2677 __isl_take isl_pw_qpolynomial *pwqp1,
2678 __isl_take isl_pw_qpolynomial *pwqp2)
2680 return isl_pw_qpolynomial_union_add_(pwqp1, pwqp2);
2683 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
2684 __isl_take isl_pw_qpolynomial *pwqp1,
2685 __isl_take isl_pw_qpolynomial *pwqp2)
2688 struct isl_pw_qpolynomial *res;
2690 if (!pwqp1 || !pwqp2)
2693 isl_assert(pwqp1->dim->ctx, isl_space_is_equal(pwqp1->dim, pwqp2->dim),
2696 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
2697 isl_pw_qpolynomial_free(pwqp2);
2701 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
2702 isl_pw_qpolynomial_free(pwqp1);
2706 if (isl_pw_qpolynomial_is_one(pwqp1)) {
2707 isl_pw_qpolynomial_free(pwqp1);
2711 if (isl_pw_qpolynomial_is_one(pwqp2)) {
2712 isl_pw_qpolynomial_free(pwqp2);
2716 n = pwqp1->n * pwqp2->n;
2717 res = isl_pw_qpolynomial_alloc_size(isl_space_copy(pwqp1->dim), n);
2719 for (i = 0; i < pwqp1->n; ++i) {
2720 for (j = 0; j < pwqp2->n; ++j) {
2721 struct isl_set *common;
2722 struct isl_qpolynomial *prod;
2723 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
2724 isl_set_copy(pwqp2->p[j].set));
2725 if (isl_set_plain_is_empty(common)) {
2726 isl_set_free(common);
2730 prod = isl_qpolynomial_mul(
2731 isl_qpolynomial_copy(pwqp1->p[i].qp),
2732 isl_qpolynomial_copy(pwqp2->p[j].qp));
2734 res = isl_pw_qpolynomial_add_piece(res, common, prod);
2738 isl_pw_qpolynomial_free(pwqp1);
2739 isl_pw_qpolynomial_free(pwqp2);
2743 isl_pw_qpolynomial_free(pwqp1);
2744 isl_pw_qpolynomial_free(pwqp2);
2748 __isl_give struct isl_upoly *isl_upoly_eval(
2749 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
2752 struct isl_upoly_rec *rec;
2753 struct isl_upoly *res;
2754 struct isl_upoly *base;
2756 if (isl_upoly_is_cst(up)) {
2761 rec = isl_upoly_as_rec(up);
2765 isl_assert(up->ctx, rec->n >= 1, goto error);
2767 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
2769 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
2772 for (i = rec->n - 2; i >= 0; --i) {
2773 res = isl_upoly_mul(res, isl_upoly_copy(base));
2774 res = isl_upoly_sum(res,
2775 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
2776 isl_vec_copy(vec)));
2779 isl_upoly_free(base);
2789 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
2790 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
2793 struct isl_upoly *up;
2798 isl_assert(pnt->dim->ctx, isl_space_is_equal(pnt->dim, qp->dim), goto error);
2800 if (qp->div->n_row == 0)
2801 ext = isl_vec_copy(pnt->vec);
2804 unsigned dim = isl_space_dim(qp->dim, isl_dim_all);
2805 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
2809 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
2810 for (i = 0; i < qp->div->n_row; ++i) {
2811 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
2812 1 + dim + i, &ext->el[1+dim+i]);
2813 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
2814 qp->div->row[i][0]);
2818 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
2822 dim = isl_space_copy(qp->dim);
2823 isl_qpolynomial_free(qp);
2824 isl_point_free(pnt);
2826 return isl_qpolynomial_alloc(dim, 0, up);
2828 isl_qpolynomial_free(qp);
2829 isl_point_free(pnt);
2833 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
2834 __isl_keep struct isl_upoly_cst *cst2)
2839 isl_int_mul(t, cst1->n, cst2->d);
2840 isl_int_submul(t, cst2->n, cst1->d);
2841 cmp = isl_int_sgn(t);
2846 int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1,
2847 __isl_keep isl_qpolynomial *qp2)
2849 struct isl_upoly_cst *cst1, *cst2;
2853 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), return -1);
2854 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), return -1);
2855 if (isl_qpolynomial_is_nan(qp1))
2857 if (isl_qpolynomial_is_nan(qp2))
2859 cst1 = isl_upoly_as_cst(qp1->upoly);
2860 cst2 = isl_upoly_as_cst(qp2->upoly);
2862 return isl_upoly_cmp(cst1, cst2) <= 0;
2865 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
2866 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2868 struct isl_upoly_cst *cst1, *cst2;
2873 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2874 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2875 cst1 = isl_upoly_as_cst(qp1->upoly);
2876 cst2 = isl_upoly_as_cst(qp2->upoly);
2877 cmp = isl_upoly_cmp(cst1, cst2);
2880 isl_qpolynomial_free(qp2);
2882 isl_qpolynomial_free(qp1);
2887 isl_qpolynomial_free(qp1);
2888 isl_qpolynomial_free(qp2);
2892 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
2893 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2895 struct isl_upoly_cst *cst1, *cst2;
2900 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2901 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2902 cst1 = isl_upoly_as_cst(qp1->upoly);
2903 cst2 = isl_upoly_as_cst(qp2->upoly);
2904 cmp = isl_upoly_cmp(cst1, cst2);
2907 isl_qpolynomial_free(qp2);
2909 isl_qpolynomial_free(qp1);
2914 isl_qpolynomial_free(qp1);
2915 isl_qpolynomial_free(qp2);
2919 __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
2920 __isl_take isl_qpolynomial *qp, enum isl_dim_type type,
2921 unsigned first, unsigned n)
2929 if (type == isl_dim_out)
2930 isl_die(qp->div->ctx, isl_error_invalid,
2931 "cannot insert output/set dimensions",
2933 if (type == isl_dim_in)
2935 if (n == 0 && !isl_space_is_named_or_nested(qp->dim, type))
2938 qp = isl_qpolynomial_cow(qp);
2942 isl_assert(qp->div->ctx, first <= isl_space_dim(qp->dim, type),
2945 g_pos = pos(qp->dim, type) + first;
2947 qp->div = isl_mat_insert_zero_cols(qp->div, 2 + g_pos, n);
2951 total = qp->div->n_col - 2;
2952 if (total > g_pos) {
2954 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2957 for (i = 0; i < total - g_pos; ++i)
2959 qp->upoly = expand(qp->upoly, exp, g_pos);
2965 qp->dim = isl_space_insert_dims(qp->dim, type, first, n);
2971 isl_qpolynomial_free(qp);
2975 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
2976 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2980 pos = isl_qpolynomial_dim(qp, type);
2982 return isl_qpolynomial_insert_dims(qp, type, pos, n);
2985 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2986 __isl_take isl_pw_qpolynomial *pwqp,
2987 enum isl_dim_type type, unsigned n)
2991 pos = isl_pw_qpolynomial_dim(pwqp, type);
2993 return isl_pw_qpolynomial_insert_dims(pwqp, type, pos, n);
2996 static int *reordering_move(isl_ctx *ctx,
2997 unsigned len, unsigned dst, unsigned src, unsigned n)
3002 reordering = isl_alloc_array(ctx, int, len);
3007 for (i = 0; i < dst; ++i)
3009 for (i = 0; i < n; ++i)
3010 reordering[src + i] = dst + i;
3011 for (i = 0; i < src - dst; ++i)
3012 reordering[dst + i] = dst + n + i;
3013 for (i = 0; i < len - src - n; ++i)
3014 reordering[src + n + i] = src + n + i;
3016 for (i = 0; i < src; ++i)
3018 for (i = 0; i < n; ++i)
3019 reordering[src + i] = dst + i;
3020 for (i = 0; i < dst - src; ++i)
3021 reordering[src + n + i] = src + i;
3022 for (i = 0; i < len - dst - n; ++i)
3023 reordering[dst + n + i] = dst + n + i;
3029 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
3030 __isl_take isl_qpolynomial *qp,
3031 enum isl_dim_type dst_type, unsigned dst_pos,
3032 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3038 qp = isl_qpolynomial_cow(qp);
3042 if (dst_type == isl_dim_out || src_type == isl_dim_out)
3043 isl_die(qp->dim->ctx, isl_error_invalid,
3044 "cannot move output/set dimension",
3046 if (dst_type == isl_dim_in)
3047 dst_type = isl_dim_set;
3048 if (src_type == isl_dim_in)
3049 src_type = isl_dim_set;
3051 isl_assert(qp->dim->ctx, src_pos + n <= isl_space_dim(qp->dim, src_type),
3054 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
3055 g_src_pos = pos(qp->dim, src_type) + src_pos;
3056 if (dst_type > src_type)
3059 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
3066 reordering = reordering_move(qp->dim->ctx,
3067 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
3071 qp->upoly = reorder(qp->upoly, reordering);
3076 qp->dim = isl_space_move_dims(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
3082 isl_qpolynomial_free(qp);
3086 __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_space *dim,
3087 isl_int *f, isl_int denom)
3089 struct isl_upoly *up;
3091 dim = isl_space_domain(dim);
3095 up = isl_upoly_from_affine(dim->ctx, f, denom,
3096 1 + isl_space_dim(dim, isl_dim_all));
3098 return isl_qpolynomial_alloc(dim, 0, up);
3101 __isl_give isl_qpolynomial *isl_qpolynomial_from_aff(__isl_take isl_aff *aff)
3104 struct isl_upoly *up;
3105 isl_qpolynomial *qp;
3110 ctx = isl_aff_get_ctx(aff);
3111 up = isl_upoly_from_affine(ctx, aff->v->el + 1, aff->v->el[0],
3114 qp = isl_qpolynomial_alloc(isl_aff_get_domain_space(aff),
3115 aff->ls->div->n_row, up);
3119 isl_mat_free(qp->div);
3120 qp->div = isl_mat_copy(aff->ls->div);
3121 qp->div = isl_mat_cow(qp->div);
3126 qp = reduce_divs(qp);
3127 qp = remove_redundant_divs(qp);
3134 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_from_pw_aff(
3135 __isl_take isl_pw_aff *pwaff)
3138 isl_pw_qpolynomial *pwqp;
3143 pwqp = isl_pw_qpolynomial_alloc_size(isl_pw_aff_get_space(pwaff),
3146 for (i = 0; i < pwaff->n; ++i) {
3148 isl_qpolynomial *qp;
3150 dom = isl_set_copy(pwaff->p[i].set);
3151 qp = isl_qpolynomial_from_aff(isl_aff_copy(pwaff->p[i].aff));
3152 pwqp = isl_pw_qpolynomial_add_piece(pwqp, dom, qp);
3155 isl_pw_aff_free(pwaff);
3159 __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
3160 __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
3164 aff = isl_constraint_get_bound(c, type, pos);
3165 isl_constraint_free(c);
3166 return isl_qpolynomial_from_aff(aff);
3169 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
3170 * in "qp" by subs[i].
3172 __isl_give isl_qpolynomial *isl_qpolynomial_substitute(
3173 __isl_take isl_qpolynomial *qp,
3174 enum isl_dim_type type, unsigned first, unsigned n,
3175 __isl_keep isl_qpolynomial **subs)
3178 struct isl_upoly **ups;
3183 qp = isl_qpolynomial_cow(qp);
3187 if (type == isl_dim_out)
3188 isl_die(qp->dim->ctx, isl_error_invalid,
3189 "cannot substitute output/set dimension",
3191 if (type == isl_dim_in)
3194 for (i = 0; i < n; ++i)
3198 isl_assert(qp->dim->ctx, first + n <= isl_space_dim(qp->dim, type),
3201 for (i = 0; i < n; ++i)
3202 isl_assert(qp->dim->ctx, isl_space_is_equal(qp->dim, subs[i]->dim),
3205 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
3206 for (i = 0; i < n; ++i)
3207 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
3209 first += pos(qp->dim, type);
3211 ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n);
3214 for (i = 0; i < n; ++i)
3215 ups[i] = subs[i]->upoly;
3217 qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups);
3226 isl_qpolynomial_free(qp);
3230 /* Extend "bset" with extra set dimensions for each integer division
3231 * in "qp" and then call "fn" with the extended bset and the polynomial
3232 * that results from replacing each of the integer divisions by the
3233 * corresponding extra set dimension.
3235 int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
3236 __isl_keep isl_basic_set *bset,
3237 int (*fn)(__isl_take isl_basic_set *bset,
3238 __isl_take isl_qpolynomial *poly, void *user), void *user)
3242 isl_qpolynomial *poly;
3246 if (qp->div->n_row == 0)
3247 return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
3250 div = isl_mat_copy(qp->div);
3251 dim = isl_space_copy(qp->dim);
3252 dim = isl_space_add_dims(dim, isl_dim_set, qp->div->n_row);
3253 poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly));
3254 bset = isl_basic_set_copy(bset);
3255 bset = isl_basic_set_add_dims(bset, isl_dim_set, qp->div->n_row);
3256 bset = add_div_constraints(bset, div);
3258 return fn(bset, poly, user);
3263 /* Return total degree in variables first (inclusive) up to last (exclusive).
3265 int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last)
3269 struct isl_upoly_rec *rec;
3273 if (isl_upoly_is_zero(up))
3275 if (isl_upoly_is_cst(up) || up->var < first)
3278 rec = isl_upoly_as_rec(up);
3282 for (i = 0; i < rec->n; ++i) {
3285 if (isl_upoly_is_zero(rec->p[i]))
3287 d = isl_upoly_degree(rec->p[i], first, last);
3297 /* Return total degree in set variables.
3299 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
3307 ovar = isl_space_offset(poly->dim, isl_dim_set);
3308 nvar = isl_space_dim(poly->dim, isl_dim_set);
3309 return isl_upoly_degree(poly->upoly, ovar, ovar + nvar);
3312 __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up,
3313 unsigned pos, int deg)
3316 struct isl_upoly_rec *rec;
3321 if (isl_upoly_is_cst(up) || up->var < pos) {
3323 return isl_upoly_copy(up);
3325 return isl_upoly_zero(up->ctx);
3328 rec = isl_upoly_as_rec(up);
3332 if (up->var == pos) {
3334 return isl_upoly_copy(rec->p[deg]);
3336 return isl_upoly_zero(up->ctx);
3339 up = isl_upoly_copy(up);
3340 up = isl_upoly_cow(up);
3341 rec = isl_upoly_as_rec(up);
3345 for (i = 0; i < rec->n; ++i) {
3346 struct isl_upoly *t;
3347 t = isl_upoly_coeff(rec->p[i], pos, deg);
3350 isl_upoly_free(rec->p[i]);
3360 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
3362 __isl_give isl_qpolynomial *isl_qpolynomial_coeff(
3363 __isl_keep isl_qpolynomial *qp,
3364 enum isl_dim_type type, unsigned t_pos, int deg)
3367 struct isl_upoly *up;
3373 if (type == isl_dim_out)
3374 isl_die(qp->div->ctx, isl_error_invalid,
3375 "output/set dimension does not have a coefficient",
3377 if (type == isl_dim_in)
3380 isl_assert(qp->div->ctx, t_pos < isl_space_dim(qp->dim, type),
3383 g_pos = pos(qp->dim, type) + t_pos;
3384 up = isl_upoly_coeff(qp->upoly, g_pos, deg);
3386 c = isl_qpolynomial_alloc(isl_space_copy(qp->dim), qp->div->n_row, up);
3389 isl_mat_free(c->div);
3390 c->div = isl_mat_copy(qp->div);
3395 isl_qpolynomial_free(c);
3399 /* Homogenize the polynomial in the variables first (inclusive) up to
3400 * last (exclusive) by inserting powers of variable first.
3401 * Variable first is assumed not to appear in the input.
3403 __isl_give struct isl_upoly *isl_upoly_homogenize(
3404 __isl_take struct isl_upoly *up, int deg, int target,
3405 int first, int last)
3408 struct isl_upoly_rec *rec;
3412 if (isl_upoly_is_zero(up))
3416 if (isl_upoly_is_cst(up) || up->var < first) {
3417 struct isl_upoly *hom;
3419 hom = isl_upoly_var_pow(up->ctx, first, target - deg);
3422 rec = isl_upoly_as_rec(hom);
3423 rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up);
3428 up = isl_upoly_cow(up);
3429 rec = isl_upoly_as_rec(up);
3433 for (i = 0; i < rec->n; ++i) {
3434 if (isl_upoly_is_zero(rec->p[i]))
3436 rec->p[i] = isl_upoly_homogenize(rec->p[i],
3437 up->var < last ? deg + i : i, target,
3449 /* Homogenize the polynomial in the set variables by introducing
3450 * powers of an extra set variable at position 0.
3452 __isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
3453 __isl_take isl_qpolynomial *poly)
3457 int deg = isl_qpolynomial_degree(poly);
3462 poly = isl_qpolynomial_insert_dims(poly, isl_dim_in, 0, 1);
3463 poly = isl_qpolynomial_cow(poly);
3467 ovar = isl_space_offset(poly->dim, isl_dim_set);
3468 nvar = isl_space_dim(poly->dim, isl_dim_set);
3469 poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg,
3476 isl_qpolynomial_free(poly);
3480 __isl_give isl_term *isl_term_alloc(__isl_take isl_space *dim,
3481 __isl_take isl_mat *div)
3489 n = isl_space_dim(dim, isl_dim_all) + div->n_row;
3491 term = isl_calloc(dim->ctx, struct isl_term,
3492 sizeof(struct isl_term) + (n - 1) * sizeof(int));
3499 isl_int_init(term->n);
3500 isl_int_init(term->d);
3504 isl_space_free(dim);
3509 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
3518 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
3527 total = isl_space_dim(term->dim, isl_dim_all) + term->div->n_row;
3529 dup = isl_term_alloc(isl_space_copy(term->dim), isl_mat_copy(term->div));
3533 isl_int_set(dup->n, term->n);
3534 isl_int_set(dup->d, term->d);
3536 for (i = 0; i < total; ++i)
3537 dup->pow[i] = term->pow[i];
3542 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
3550 return isl_term_dup(term);
3553 void isl_term_free(__isl_take isl_term *term)
3558 if (--term->ref > 0)
3561 isl_space_free(term->dim);
3562 isl_mat_free(term->div);
3563 isl_int_clear(term->n);
3564 isl_int_clear(term->d);
3568 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
3576 case isl_dim_out: return isl_space_dim(term->dim, type);
3577 case isl_dim_div: return term->div->n_row;
3578 case isl_dim_all: return isl_space_dim(term->dim, isl_dim_all) +
3584 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
3586 return term ? term->dim->ctx : NULL;
3589 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
3593 isl_int_set(*n, term->n);
3596 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
3600 isl_int_set(*d, term->d);
3603 /* Return the coefficient of the term "term".
3605 __isl_give isl_val *isl_term_get_coefficient_val(__isl_keep isl_term *term)
3610 return isl_val_rat_from_isl_int(isl_term_get_ctx(term),
3614 int isl_term_get_exp(__isl_keep isl_term *term,
3615 enum isl_dim_type type, unsigned pos)
3620 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
3622 if (type >= isl_dim_set)
3623 pos += isl_space_dim(term->dim, isl_dim_param);
3624 if (type >= isl_dim_div)
3625 pos += isl_space_dim(term->dim, isl_dim_set);
3627 return term->pow[pos];
3630 __isl_give isl_aff *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
3632 isl_local_space *ls;
3638 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
3641 ls = isl_local_space_alloc_div(isl_space_copy(term->dim),
3642 isl_mat_copy(term->div));
3643 aff = isl_aff_alloc(ls);
3647 isl_seq_cpy(aff->v->el, term->div->row[pos], aff->v->size);
3649 aff = isl_aff_normalize(aff);
3654 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
3655 int (*fn)(__isl_take isl_term *term, void *user),
3656 __isl_take isl_term *term, void *user)
3659 struct isl_upoly_rec *rec;
3664 if (isl_upoly_is_zero(up))
3667 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
3668 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
3669 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
3671 if (isl_upoly_is_cst(up)) {
3672 struct isl_upoly_cst *cst;
3673 cst = isl_upoly_as_cst(up);
3676 term = isl_term_cow(term);
3679 isl_int_set(term->n, cst->n);
3680 isl_int_set(term->d, cst->d);
3681 if (fn(isl_term_copy(term), user) < 0)
3686 rec = isl_upoly_as_rec(up);
3690 for (i = 0; i < rec->n; ++i) {
3691 term = isl_term_cow(term);
3694 term->pow[up->var] = i;
3695 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
3699 term->pow[up->var] = 0;
3703 isl_term_free(term);
3707 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
3708 int (*fn)(__isl_take isl_term *term, void *user), void *user)
3715 term = isl_term_alloc(isl_space_copy(qp->dim), isl_mat_copy(qp->div));
3719 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
3721 isl_term_free(term);
3723 return term ? 0 : -1;
3726 __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
3728 struct isl_upoly *up;
3729 isl_qpolynomial *qp;
3735 n = isl_space_dim(term->dim, isl_dim_all) + term->div->n_row;
3737 up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d);
3738 for (i = 0; i < n; ++i) {
3741 up = isl_upoly_mul(up,
3742 isl_upoly_var_pow(term->dim->ctx, i, term->pow[i]));
3745 qp = isl_qpolynomial_alloc(isl_space_copy(term->dim), term->div->n_row, up);
3748 isl_mat_free(qp->div);
3749 qp->div = isl_mat_copy(term->div);
3753 isl_term_free(term);
3756 isl_qpolynomial_free(qp);
3757 isl_term_free(term);
3761 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
3762 __isl_take isl_space *dim)
3771 if (isl_space_is_equal(qp->dim, dim)) {
3772 isl_space_free(dim);
3776 qp = isl_qpolynomial_cow(qp);
3780 extra = isl_space_dim(dim, isl_dim_set) -
3781 isl_space_dim(qp->dim, isl_dim_set);
3782 total = isl_space_dim(qp->dim, isl_dim_all);
3783 if (qp->div->n_row) {
3786 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
3789 for (i = 0; i < qp->div->n_row; ++i)
3791 qp->upoly = expand(qp->upoly, exp, total);
3796 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
3799 for (i = 0; i < qp->div->n_row; ++i)
3800 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
3802 isl_space_free(qp->dim);
3807 isl_space_free(dim);
3808 isl_qpolynomial_free(qp);
3812 /* For each parameter or variable that does not appear in qp,
3813 * first eliminate the variable from all constraints and then set it to zero.
3815 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
3816 __isl_keep isl_qpolynomial *qp)
3827 d = isl_space_dim(set->dim, isl_dim_all);
3828 active = isl_calloc_array(set->ctx, int, d);
3829 if (set_active(qp, active) < 0)
3832 for (i = 0; i < d; ++i)
3841 nparam = isl_space_dim(set->dim, isl_dim_param);
3842 nvar = isl_space_dim(set->dim, isl_dim_set);
3843 for (i = 0; i < nparam; ++i) {
3846 set = isl_set_eliminate(set, isl_dim_param, i, 1);
3847 set = isl_set_fix_si(set, isl_dim_param, i, 0);
3849 for (i = 0; i < nvar; ++i) {
3850 if (active[nparam + i])
3852 set = isl_set_eliminate(set, isl_dim_set, i, 1);
3853 set = isl_set_fix_si(set, isl_dim_set, i, 0);
3865 struct isl_opt_data {
3866 isl_qpolynomial *qp;
3868 isl_qpolynomial *opt;
3872 static int opt_fn(__isl_take isl_point *pnt, void *user)
3874 struct isl_opt_data *data = (struct isl_opt_data *)user;
3875 isl_qpolynomial *val;
3877 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
3881 } else if (data->max) {
3882 data->opt = isl_qpolynomial_max_cst(data->opt, val);
3884 data->opt = isl_qpolynomial_min_cst(data->opt, val);
3890 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
3891 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
3893 struct isl_opt_data data = { NULL, 1, NULL, max };
3898 if (isl_upoly_is_cst(qp->upoly)) {
3903 set = fix_inactive(set, qp);
3906 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
3910 isl_space *space = isl_qpolynomial_get_domain_space(qp);
3911 data.opt = isl_qpolynomial_zero_on_domain(space);
3915 isl_qpolynomial_free(qp);
3919 isl_qpolynomial_free(qp);
3920 isl_qpolynomial_free(data.opt);
3924 __isl_give isl_qpolynomial *isl_qpolynomial_morph_domain(
3925 __isl_take isl_qpolynomial *qp, __isl_take isl_morph *morph)
3930 struct isl_upoly **subs;
3931 isl_mat *mat, *diag;
3933 qp = isl_qpolynomial_cow(qp);
3938 isl_assert(ctx, isl_space_is_equal(qp->dim, morph->dom->dim), goto error);
3940 n_sub = morph->inv->n_row - 1;
3941 if (morph->inv->n_row != morph->inv->n_col)
3942 n_sub += qp->div->n_row;
3943 subs = isl_calloc_array(ctx, struct isl_upoly *, n_sub);
3947 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3948 subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i],
3949 morph->inv->row[0][0], morph->inv->n_col);
3950 if (morph->inv->n_row != morph->inv->n_col)
3951 for (i = 0; i < qp->div->n_row; ++i)
3952 subs[morph->inv->n_row - 1 + i] =
3953 isl_upoly_var_pow(ctx, morph->inv->n_col - 1 + i, 1);
3955 qp->upoly = isl_upoly_subs(qp->upoly, 0, n_sub, subs);
3957 for (i = 0; i < n_sub; ++i)
3958 isl_upoly_free(subs[i]);
3961 diag = isl_mat_diag(ctx, 1, morph->inv->row[0][0]);
3962 mat = isl_mat_diagonal(diag, isl_mat_copy(morph->inv));
3963 diag = isl_mat_diag(ctx, qp->div->n_row, morph->inv->row[0][0]);
3964 mat = isl_mat_diagonal(mat, diag);
3965 qp->div = isl_mat_product(qp->div, mat);
3966 isl_space_free(qp->dim);
3967 qp->dim = isl_space_copy(morph->ran->dim);
3969 if (!qp->upoly || !qp->div || !qp->dim)
3972 isl_morph_free(morph);
3976 isl_qpolynomial_free(qp);
3977 isl_morph_free(morph);
3981 static int neg_entry(void **entry, void *user)
3983 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
3985 *pwqp = isl_pw_qpolynomial_neg(*pwqp);
3987 return *pwqp ? 0 : -1;
3990 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_neg(
3991 __isl_take isl_union_pw_qpolynomial *upwqp)
3993 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
3997 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
3998 &neg_entry, NULL) < 0)
4003 isl_union_pw_qpolynomial_free(upwqp);
4007 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
4008 __isl_take isl_union_pw_qpolynomial *upwqp1,
4009 __isl_take isl_union_pw_qpolynomial *upwqp2)
4011 return match_bin_op(upwqp1, upwqp2, &isl_pw_qpolynomial_mul);
4014 /* Reorder the columns of the given div definitions according to the
4017 static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div,
4018 __isl_take isl_reordering *r)
4027 extra = isl_space_dim(r->dim, isl_dim_all) + div->n_row - r->len;
4028 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
4032 for (i = 0; i < div->n_row; ++i) {
4033 isl_seq_cpy(mat->row[i], div->row[i], 2);
4034 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2);
4035 for (j = 0; j < r->len; ++j)
4036 isl_int_set(mat->row[i][2 + r->pos[j]],
4037 div->row[i][2 + j]);
4040 isl_reordering_free(r);
4044 isl_reordering_free(r);
4049 /* Reorder the dimension of "qp" according to the given reordering.
4051 __isl_give isl_qpolynomial *isl_qpolynomial_realign_domain(
4052 __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r)
4054 qp = isl_qpolynomial_cow(qp);
4058 r = isl_reordering_extend(r, qp->div->n_row);
4062 qp->div = reorder_divs(qp->div, isl_reordering_copy(r));
4066 qp->upoly = reorder(qp->upoly, r->pos);
4070 qp = isl_qpolynomial_reset_domain_space(qp, isl_space_copy(r->dim));
4072 isl_reordering_free(r);
4075 isl_qpolynomial_free(qp);
4076 isl_reordering_free(r);
4080 __isl_give isl_qpolynomial *isl_qpolynomial_align_params(
4081 __isl_take isl_qpolynomial *qp, __isl_take isl_space *model)
4086 if (!isl_space_match(qp->dim, isl_dim_param, model, isl_dim_param)) {
4087 isl_reordering *exp;
4089 model = isl_space_drop_dims(model, isl_dim_in,
4090 0, isl_space_dim(model, isl_dim_in));
4091 model = isl_space_drop_dims(model, isl_dim_out,
4092 0, isl_space_dim(model, isl_dim_out));
4093 exp = isl_parameter_alignment_reordering(qp->dim, model);
4094 exp = isl_reordering_extend_space(exp,
4095 isl_qpolynomial_get_domain_space(qp));
4096 qp = isl_qpolynomial_realign_domain(qp, exp);
4099 isl_space_free(model);
4102 isl_space_free(model);
4103 isl_qpolynomial_free(qp);
4107 struct isl_split_periods_data {
4109 isl_pw_qpolynomial *res;
4112 /* Create a slice where the integer division "div" has the fixed value "v".
4113 * In particular, if "div" refers to floor(f/m), then create a slice
4115 * m v <= f <= m v + (m - 1)
4120 * -f + m v + (m - 1) >= 0
4122 static __isl_give isl_set *set_div_slice(__isl_take isl_space *dim,
4123 __isl_keep isl_qpolynomial *qp, int div, isl_int v)
4126 isl_basic_set *bset = NULL;
4132 total = isl_space_dim(dim, isl_dim_all);
4133 bset = isl_basic_set_alloc_space(isl_space_copy(dim), 0, 0, 2);
4135 k = isl_basic_set_alloc_inequality(bset);
4138 isl_seq_cpy(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
4139 isl_int_submul(bset->ineq[k][0], v, qp->div->row[div][0]);
4141 k = isl_basic_set_alloc_inequality(bset);
4144 isl_seq_neg(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
4145 isl_int_addmul(bset->ineq[k][0], v, qp->div->row[div][0]);
4146 isl_int_add(bset->ineq[k][0], bset->ineq[k][0], qp->div->row[div][0]);
4147 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
4149 isl_space_free(dim);
4150 return isl_set_from_basic_set(bset);
4152 isl_basic_set_free(bset);
4153 isl_space_free(dim);
4157 static int split_periods(__isl_take isl_set *set,
4158 __isl_take isl_qpolynomial *qp, void *user);
4160 /* Create a slice of the domain "set" such that integer division "div"
4161 * has the fixed value "v" and add the results to data->res,
4162 * replacing the integer division by "v" in "qp".
4164 static int set_div(__isl_take isl_set *set,
4165 __isl_take isl_qpolynomial *qp, int div, isl_int v,
4166 struct isl_split_periods_data *data)
4171 struct isl_upoly *cst;
4173 slice = set_div_slice(isl_set_get_space(set), qp, div, v);
4174 set = isl_set_intersect(set, slice);
4179 total = isl_space_dim(qp->dim, isl_dim_all);
4181 for (i = div + 1; i < qp->div->n_row; ++i) {
4182 if (isl_int_is_zero(qp->div->row[i][2 + total + div]))
4184 isl_int_addmul(qp->div->row[i][1],
4185 qp->div->row[i][2 + total + div], v);
4186 isl_int_set_si(qp->div->row[i][2 + total + div], 0);
4189 cst = isl_upoly_rat_cst(qp->dim->ctx, v, qp->dim->ctx->one);
4190 qp = substitute_div(qp, div, cst);
4192 return split_periods(set, qp, data);
4195 isl_qpolynomial_free(qp);
4199 /* Split the domain "set" such that integer division "div"
4200 * has a fixed value (ranging from "min" to "max") on each slice
4201 * and add the results to data->res.
4203 static int split_div(__isl_take isl_set *set,
4204 __isl_take isl_qpolynomial *qp, int div, isl_int min, isl_int max,
4205 struct isl_split_periods_data *data)
4207 for (; isl_int_le(min, max); isl_int_add_ui(min, min, 1)) {
4208 isl_set *set_i = isl_set_copy(set);
4209 isl_qpolynomial *qp_i = isl_qpolynomial_copy(qp);
4211 if (set_div(set_i, qp_i, div, min, data) < 0)
4215 isl_qpolynomial_free(qp);
4219 isl_qpolynomial_free(qp);
4223 /* If "qp" refers to any integer division
4224 * that can only attain "max_periods" distinct values on "set"
4225 * then split the domain along those distinct values.
4226 * Add the results (or the original if no splitting occurs)
4229 static int split_periods(__isl_take isl_set *set,
4230 __isl_take isl_qpolynomial *qp, void *user)
4233 isl_pw_qpolynomial *pwqp;
4234 struct isl_split_periods_data *data;
4239 data = (struct isl_split_periods_data *)user;
4244 if (qp->div->n_row == 0) {
4245 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4246 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
4252 total = isl_space_dim(qp->dim, isl_dim_all);
4253 for (i = 0; i < qp->div->n_row; ++i) {
4254 enum isl_lp_result lp_res;
4256 if (isl_seq_first_non_zero(qp->div->row[i] + 2 + total,
4257 qp->div->n_row) != -1)
4260 lp_res = isl_set_solve_lp(set, 0, qp->div->row[i] + 1,
4261 set->ctx->one, &min, NULL, NULL);
4262 if (lp_res == isl_lp_error)
4264 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
4266 isl_int_fdiv_q(min, min, qp->div->row[i][0]);
4268 lp_res = isl_set_solve_lp(set, 1, qp->div->row[i] + 1,
4269 set->ctx->one, &max, NULL, NULL);
4270 if (lp_res == isl_lp_error)
4272 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
4274 isl_int_fdiv_q(max, max, qp->div->row[i][0]);
4276 isl_int_sub(max, max, min);
4277 if (isl_int_cmp_si(max, data->max_periods) < 0) {
4278 isl_int_add(max, max, min);
4283 if (i < qp->div->n_row) {
4284 r = split_div(set, qp, i, min, max, data);
4286 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4287 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
4299 isl_qpolynomial_free(qp);
4303 /* If any quasi-polynomial in pwqp refers to any integer division
4304 * that can only attain "max_periods" distinct values on its domain
4305 * then split the domain along those distinct values.
4307 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_periods(
4308 __isl_take isl_pw_qpolynomial *pwqp, int max_periods)
4310 struct isl_split_periods_data data;
4312 data.max_periods = max_periods;
4313 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_space(pwqp));
4315 if (isl_pw_qpolynomial_foreach_piece(pwqp, &split_periods, &data) < 0)
4318 isl_pw_qpolynomial_free(pwqp);
4322 isl_pw_qpolynomial_free(data.res);
4323 isl_pw_qpolynomial_free(pwqp);
4327 /* Construct a piecewise quasipolynomial that is constant on the given
4328 * domain. In particular, it is
4331 * infinity if cst == -1
4333 static __isl_give isl_pw_qpolynomial *constant_on_domain(
4334 __isl_take isl_basic_set *bset, int cst)
4337 isl_qpolynomial *qp;
4342 bset = isl_basic_set_params(bset);
4343 dim = isl_basic_set_get_space(bset);
4345 qp = isl_qpolynomial_infty_on_domain(dim);
4347 qp = isl_qpolynomial_zero_on_domain(dim);
4349 qp = isl_qpolynomial_one_on_domain(dim);
4350 return isl_pw_qpolynomial_alloc(isl_set_from_basic_set(bset), qp);
4353 /* Factor bset, call fn on each of the factors and return the product.
4355 * If no factors can be found, simply call fn on the input.
4356 * Otherwise, construct the factors based on the factorizer,
4357 * call fn on each factor and compute the product.
4359 static __isl_give isl_pw_qpolynomial *compressed_multiplicative_call(
4360 __isl_take isl_basic_set *bset,
4361 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
4367 isl_qpolynomial *qp;
4368 isl_pw_qpolynomial *pwqp;
4372 f = isl_basic_set_factorizer(bset);
4375 if (f->n_group == 0) {
4376 isl_factorizer_free(f);
4380 nparam = isl_basic_set_dim(bset, isl_dim_param);
4381 nvar = isl_basic_set_dim(bset, isl_dim_set);
4383 dim = isl_basic_set_get_space(bset);
4384 dim = isl_space_domain(dim);
4385 set = isl_set_universe(isl_space_copy(dim));
4386 qp = isl_qpolynomial_one_on_domain(dim);
4387 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4389 bset = isl_morph_basic_set(isl_morph_copy(f->morph), bset);
4391 for (i = 0, n = 0; i < f->n_group; ++i) {
4392 isl_basic_set *bset_i;
4393 isl_pw_qpolynomial *pwqp_i;
4395 bset_i = isl_basic_set_copy(bset);
4396 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
4397 nparam + n + f->len[i], nvar - n - f->len[i]);
4398 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
4400 bset_i = isl_basic_set_drop(bset_i, isl_dim_set,
4401 n + f->len[i], nvar - n - f->len[i]);
4402 bset_i = isl_basic_set_drop(bset_i, isl_dim_set, 0, n);
4404 pwqp_i = fn(bset_i);
4405 pwqp = isl_pw_qpolynomial_mul(pwqp, pwqp_i);
4410 isl_basic_set_free(bset);
4411 isl_factorizer_free(f);
4415 isl_basic_set_free(bset);
4419 /* Factor bset, call fn on each of the factors and return the product.
4420 * The function is assumed to evaluate to zero on empty domains,
4421 * to one on zero-dimensional domains and to infinity on unbounded domains
4422 * and will not be called explicitly on zero-dimensional or unbounded domains.
4424 * We first check for some special cases and remove all equalities.
4425 * Then we hand over control to compressed_multiplicative_call.
4427 __isl_give isl_pw_qpolynomial *isl_basic_set_multiplicative_call(
4428 __isl_take isl_basic_set *bset,
4429 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
4433 isl_pw_qpolynomial *pwqp;
4438 if (isl_basic_set_plain_is_empty(bset))
4439 return constant_on_domain(bset, 0);
4441 if (isl_basic_set_dim(bset, isl_dim_set) == 0)
4442 return constant_on_domain(bset, 1);
4444 bounded = isl_basic_set_is_bounded(bset);
4448 return constant_on_domain(bset, -1);
4450 if (bset->n_eq == 0)
4451 return compressed_multiplicative_call(bset, fn);
4453 morph = isl_basic_set_full_compression(bset);
4454 bset = isl_morph_basic_set(isl_morph_copy(morph), bset);
4456 pwqp = compressed_multiplicative_call(bset, fn);
4458 morph = isl_morph_dom_params(morph);
4459 morph = isl_morph_ran_params(morph);
4460 morph = isl_morph_inverse(morph);
4462 pwqp = isl_pw_qpolynomial_morph_domain(pwqp, morph);
4466 isl_basic_set_free(bset);
4470 /* Drop all floors in "qp", turning each integer division [a/m] into
4471 * a rational division a/m. If "down" is set, then the integer division
4472 * is replaces by (a-(m-1))/m instead.
4474 static __isl_give isl_qpolynomial *qp_drop_floors(
4475 __isl_take isl_qpolynomial *qp, int down)
4478 struct isl_upoly *s;
4482 if (qp->div->n_row == 0)
4485 qp = isl_qpolynomial_cow(qp);
4489 for (i = qp->div->n_row - 1; i >= 0; --i) {
4491 isl_int_sub(qp->div->row[i][1],
4492 qp->div->row[i][1], qp->div->row[i][0]);
4493 isl_int_add_ui(qp->div->row[i][1],
4494 qp->div->row[i][1], 1);
4496 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
4497 qp->div->row[i][0], qp->div->n_col - 1);
4498 qp = substitute_div(qp, i, s);
4506 /* Drop all floors in "pwqp", turning each integer division [a/m] into
4507 * a rational division a/m.
4509 static __isl_give isl_pw_qpolynomial *pwqp_drop_floors(
4510 __isl_take isl_pw_qpolynomial *pwqp)
4517 if (isl_pw_qpolynomial_is_zero(pwqp))
4520 pwqp = isl_pw_qpolynomial_cow(pwqp);
4524 for (i = 0; i < pwqp->n; ++i) {
4525 pwqp->p[i].qp = qp_drop_floors(pwqp->p[i].qp, 0);
4532 isl_pw_qpolynomial_free(pwqp);
4536 /* Adjust all the integer divisions in "qp" such that they are at least
4537 * one over the given orthant (identified by "signs"). This ensures
4538 * that they will still be non-negative even after subtracting (m-1)/m.
4540 * In particular, f is replaced by f' + v, changing f = [a/m]
4541 * to f' = [(a - m v)/m].
4542 * If the constant term k in a is smaller than m,
4543 * the constant term of v is set to floor(k/m) - 1.
4544 * For any other term, if the coefficient c and the variable x have
4545 * the same sign, then no changes are needed.
4546 * Otherwise, if the variable is positive (and c is negative),
4547 * then the coefficient of x in v is set to floor(c/m).
4548 * If the variable is negative (and c is positive),
4549 * then the coefficient of x in v is set to ceil(c/m).
4551 static __isl_give isl_qpolynomial *make_divs_pos(__isl_take isl_qpolynomial *qp,
4557 struct isl_upoly *s;
4559 qp = isl_qpolynomial_cow(qp);
4562 qp->div = isl_mat_cow(qp->div);
4566 total = isl_space_dim(qp->dim, isl_dim_all);
4567 v = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);
4569 for (i = 0; i < qp->div->n_row; ++i) {
4570 isl_int *row = qp->div->row[i];
4574 if (isl_int_lt(row[1], row[0])) {
4575 isl_int_fdiv_q(v->el[0], row[1], row[0]);
4576 isl_int_sub_ui(v->el[0], v->el[0], 1);
4577 isl_int_submul(row[1], row[0], v->el[0]);
4579 for (j = 0; j < total; ++j) {
4580 if (isl_int_sgn(row[2 + j]) * signs[j] >= 0)
4583 isl_int_cdiv_q(v->el[1 + j], row[2 + j], row[0]);
4585 isl_int_fdiv_q(v->el[1 + j], row[2 + j], row[0]);
4586 isl_int_submul(row[2 + j], row[0], v->el[1 + j]);
4588 for (j = 0; j < i; ++j) {
4589 if (isl_int_sgn(row[2 + total + j]) >= 0)
4591 isl_int_fdiv_q(v->el[1 + total + j],
4592 row[2 + total + j], row[0]);
4593 isl_int_submul(row[2 + total + j],
4594 row[0], v->el[1 + total + j]);
4596 for (j = i + 1; j < qp->div->n_row; ++j) {
4597 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
4599 isl_seq_combine(qp->div->row[j] + 1,
4600 qp->div->ctx->one, qp->div->row[j] + 1,
4601 qp->div->row[j][2 + total + i], v->el, v->size);
4603 isl_int_set_si(v->el[1 + total + i], 1);
4604 s = isl_upoly_from_affine(qp->dim->ctx, v->el,
4605 qp->div->ctx->one, v->size);
4606 qp->upoly = isl_upoly_subs(qp->upoly, total + i, 1, &s);
4616 isl_qpolynomial_free(qp);
4620 struct isl_to_poly_data {
4622 isl_pw_qpolynomial *res;
4623 isl_qpolynomial *qp;
4626 /* Appoximate data->qp by a polynomial on the orthant identified by "signs".
4627 * We first make all integer divisions positive and then split the
4628 * quasipolynomials into terms with sign data->sign (the direction
4629 * of the requested approximation) and terms with the opposite sign.
4630 * In the first set of terms, each integer division [a/m] is
4631 * overapproximated by a/m, while in the second it is underapproximated
4634 static int to_polynomial_on_orthant(__isl_take isl_set *orthant, int *signs,
4637 struct isl_to_poly_data *data = user;
4638 isl_pw_qpolynomial *t;
4639 isl_qpolynomial *qp, *up, *down;
4641 qp = isl_qpolynomial_copy(data->qp);
4642 qp = make_divs_pos(qp, signs);
4644 up = isl_qpolynomial_terms_of_sign(qp, signs, data->sign);
4645 up = qp_drop_floors(up, 0);
4646 down = isl_qpolynomial_terms_of_sign(qp, signs, -data->sign);
4647 down = qp_drop_floors(down, 1);
4649 isl_qpolynomial_free(qp);
4650 qp = isl_qpolynomial_add(up, down);
4652 t = isl_pw_qpolynomial_alloc(orthant, qp);
4653 data->res = isl_pw_qpolynomial_add_disjoint(data->res, t);
4658 /* Approximate each quasipolynomial by a polynomial. If "sign" is positive,
4659 * the polynomial will be an overapproximation. If "sign" is negative,
4660 * it will be an underapproximation. If "sign" is zero, the approximation
4661 * will lie somewhere in between.
4663 * In particular, is sign == 0, we simply drop the floors, turning
4664 * the integer divisions into rational divisions.
4665 * Otherwise, we split the domains into orthants, make all integer divisions
4666 * positive and then approximate each [a/m] by either a/m or (a-(m-1))/m,
4667 * depending on the requested sign and the sign of the term in which
4668 * the integer division appears.
4670 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_to_polynomial(
4671 __isl_take isl_pw_qpolynomial *pwqp, int sign)
4674 struct isl_to_poly_data data;
4677 return pwqp_drop_floors(pwqp);
4683 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_space(pwqp));
4685 for (i = 0; i < pwqp->n; ++i) {
4686 if (pwqp->p[i].qp->div->n_row == 0) {
4687 isl_pw_qpolynomial *t;
4688 t = isl_pw_qpolynomial_alloc(
4689 isl_set_copy(pwqp->p[i].set),
4690 isl_qpolynomial_copy(pwqp->p[i].qp));
4691 data.res = isl_pw_qpolynomial_add_disjoint(data.res, t);
4694 data.qp = pwqp->p[i].qp;
4695 if (isl_set_foreach_orthant(pwqp->p[i].set,
4696 &to_polynomial_on_orthant, &data) < 0)
4700 isl_pw_qpolynomial_free(pwqp);
4704 isl_pw_qpolynomial_free(pwqp);
4705 isl_pw_qpolynomial_free(data.res);
4709 static int poly_entry(void **entry, void *user)
4712 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
4714 *pwqp = isl_pw_qpolynomial_to_polynomial(*pwqp, *sign);
4716 return *pwqp ? 0 : -1;
4719 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_to_polynomial(
4720 __isl_take isl_union_pw_qpolynomial *upwqp, int sign)
4722 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
4726 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
4727 &poly_entry, &sign) < 0)
4732 isl_union_pw_qpolynomial_free(upwqp);
4736 __isl_give isl_basic_map *isl_basic_map_from_qpolynomial(
4737 __isl_take isl_qpolynomial *qp)
4741 isl_vec *aff = NULL;
4742 isl_basic_map *bmap = NULL;
4748 if (!isl_upoly_is_affine(qp->upoly))
4749 isl_die(qp->dim->ctx, isl_error_invalid,
4750 "input quasi-polynomial not affine", goto error);
4751 aff = isl_qpolynomial_extract_affine(qp);
4754 dim = isl_qpolynomial_get_space(qp);
4755 pos = 1 + isl_space_offset(dim, isl_dim_out);
4756 n_div = qp->div->n_row;
4757 bmap = isl_basic_map_alloc_space(dim, n_div, 1, 2 * n_div);
4759 for (i = 0; i < n_div; ++i) {
4760 k = isl_basic_map_alloc_div(bmap);
4763 isl_seq_cpy(bmap->div[k], qp->div->row[i], qp->div->n_col);
4764 isl_int_set_si(bmap->div[k][qp->div->n_col], 0);
4765 if (isl_basic_map_add_div_constraints(bmap, k) < 0)
4768 k = isl_basic_map_alloc_equality(bmap);
4771 isl_int_neg(bmap->eq[k][pos], aff->el[0]);
4772 isl_seq_cpy(bmap->eq[k], aff->el + 1, pos);
4773 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->el + 1 + pos, n_div);
4776 isl_qpolynomial_free(qp);
4777 bmap = isl_basic_map_finalize(bmap);
4781 isl_qpolynomial_free(qp);
4782 isl_basic_map_free(bmap);