?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
hide isl_map_add_basic_map
[isl.git] / isl_polynomial.c
blob414e7c0b23e6d9e2b700b3f5ff96b400059c6429
1 /*
2 * Copyright 2010 INRIA Saclay
3 *
4 * Use of this software is governed by the MIT license
5 *
6 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
7 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
8 * 91893 Orsay, France
9 */
10
11 #include <stdlib.h>
12 #define ISL_DIM_H
13 #include <isl_ctx_private.h>
14 #include <isl_map_private.h>
15 #include <isl_factorization.h>
16 #include <isl_lp_private.h>
17 #include <isl_seq.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_vec_private.h>
25 #include <isl_range.h>
26 #include <isl_local_space_private.h>
27 #include <isl_aff_private.h>
28 #include <isl_val_private.h>
29 #include <isl_config.h>
30 #include <isl/deprecated/polynomial_int.h>
31
32 static unsigned pos(__isl_keep isl_space *dim, enum isl_dim_type type)
33 {
34 switch (type) {
35 case isl_dim_param: return 0;
36 case isl_dim_in: return dim->nparam;
37 case isl_dim_out: return dim->nparam + dim->n_in;
38 default: return 0;
39 }
40 }
41
42 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
43 {
44 if (!up)
45 return -1;
46
47 return up->var < 0;
48 }
49
50 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
51 {
52 if (!up)
53 return NULL;
54
55 isl_assert(up->ctx, up->var < 0, return NULL);
56
57 return (struct isl_upoly_cst *)up;
58 }
59
60 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
61 {
62 if (!up)
63 return NULL;
64
65 isl_assert(up->ctx, up->var >= 0, return NULL);
66
67 return (struct isl_upoly_rec *)up;
68 }
69
70 isl_bool isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
71 __isl_keep struct isl_upoly *up2)
72 {
73 int i;
74 struct isl_upoly_rec *rec1, *rec2;
75
76 if (!up1 || !up2)
77 return isl_bool_error;
78 if (up1 == up2)
79 return isl_bool_true;
80 if (up1->var != up2->var)
81 return isl_bool_false;
82 if (isl_upoly_is_cst(up1)) {
83 struct isl_upoly_cst *cst1, *cst2;
84 cst1 = isl_upoly_as_cst(up1);
85 cst2 = isl_upoly_as_cst(up2);
86 if (!cst1 || !cst2)
87 return isl_bool_error;
88 return isl_int_eq(cst1->n, cst2->n) &&
89 isl_int_eq(cst1->d, cst2->d);
90 }
91
92 rec1 = isl_upoly_as_rec(up1);
93 rec2 = isl_upoly_as_rec(up2);
94 if (!rec1 || !rec2)
95 return isl_bool_error;
96
97 if (rec1->n != rec2->n)
98 return isl_bool_false;
99
100 for (i = 0; i < rec1->n; ++i) {
101 isl_bool eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
102 if (eq < 0 || !eq)
103 return eq;
104 }
105
106 return isl_bool_true;
107 }
108
109 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
110 {
111 struct isl_upoly_cst *cst;
112
113 if (!up)
114 return -1;
115 if (!isl_upoly_is_cst(up))
116 return 0;
117
118 cst = isl_upoly_as_cst(up);
119 if (!cst)
120 return -1;
121
122 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
123 }
124
125 int isl_upoly_sgn(__isl_keep struct isl_upoly *up)
126 {
127 struct isl_upoly_cst *cst;
128
129 if (!up)
130 return 0;
131 if (!isl_upoly_is_cst(up))
132 return 0;
133
134 cst = isl_upoly_as_cst(up);
135 if (!cst)
136 return 0;
137
138 return isl_int_sgn(cst->n);
139 }
140
141 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
142 {
143 struct isl_upoly_cst *cst;
144
145 if (!up)
146 return -1;
147 if (!isl_upoly_is_cst(up))
148 return 0;
149
150 cst = isl_upoly_as_cst(up);
151 if (!cst)
152 return -1;
153
154 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
155 }
156
157 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
158 {
159 struct isl_upoly_cst *cst;
160
161 if (!up)
162 return -1;
163 if (!isl_upoly_is_cst(up))
164 return 0;
165
166 cst = isl_upoly_as_cst(up);
167 if (!cst)
168 return -1;
169
170 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
171 }
172
173 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
174 {
175 struct isl_upoly_cst *cst;
176
177 if (!up)
178 return -1;
179 if (!isl_upoly_is_cst(up))
180 return 0;
181
182 cst = isl_upoly_as_cst(up);
183 if (!cst)
184 return -1;
185
186 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
187 }
188
189 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
190 {
191 struct isl_upoly_cst *cst;
192
193 if (!up)
194 return -1;
195 if (!isl_upoly_is_cst(up))
196 return 0;
197
198 cst = isl_upoly_as_cst(up);
199 if (!cst)
200 return -1;
201
202 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
203 }
204
205 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
206 {
207 struct isl_upoly_cst *cst;
208
209 if (!up)
210 return -1;
211 if (!isl_upoly_is_cst(up))
212 return 0;
213
214 cst = isl_upoly_as_cst(up);
215 if (!cst)
216 return -1;
217
218 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
219 }
220
221 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
222 {
223 struct isl_upoly_cst *cst;
224
225 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
226 if (!cst)
227 return NULL;
228
229 cst->up.ref = 1;
230 cst->up.ctx = ctx;
231 isl_ctx_ref(ctx);
232 cst->up.var = -1;
233
234 isl_int_init(cst->n);
235 isl_int_init(cst->d);
236
237 return cst;
238 }
239
240 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
241 {
242 struct isl_upoly_cst *cst;
243
244 cst = isl_upoly_cst_alloc(ctx);
245 if (!cst)
246 return NULL;
247
248 isl_int_set_si(cst->n, 0);
249 isl_int_set_si(cst->d, 1);
250
251 return &cst->up;
252 }
253
254 __isl_give struct isl_upoly *isl_upoly_one(struct isl_ctx *ctx)
255 {
256 struct isl_upoly_cst *cst;
257
258 cst = isl_upoly_cst_alloc(ctx);
259 if (!cst)
260 return NULL;
261
262 isl_int_set_si(cst->n, 1);
263 isl_int_set_si(cst->d, 1);
264
265 return &cst->up;
266 }
267
268 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
269 {
270 struct isl_upoly_cst *cst;
271
272 cst = isl_upoly_cst_alloc(ctx);
273 if (!cst)
274 return NULL;
275
276 isl_int_set_si(cst->n, 1);
277 isl_int_set_si(cst->d, 0);
278
279 return &cst->up;
280 }
281
282 __isl_give struct isl_upoly *isl_upoly_neginfty(struct isl_ctx *ctx)
283 {
284 struct isl_upoly_cst *cst;
285
286 cst = isl_upoly_cst_alloc(ctx);
287 if (!cst)
288 return NULL;
289
290 isl_int_set_si(cst->n, -1);
291 isl_int_set_si(cst->d, 0);
292
293 return &cst->up;
294 }
295
296 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
297 {
298 struct isl_upoly_cst *cst;
299
300 cst = isl_upoly_cst_alloc(ctx);
301 if (!cst)
302 return NULL;
303
304 isl_int_set_si(cst->n, 0);
305 isl_int_set_si(cst->d, 0);
306
307 return &cst->up;
308 }
309
310 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
311 isl_int n, isl_int d)
312 {
313 struct isl_upoly_cst *cst;
314
315 cst = isl_upoly_cst_alloc(ctx);
316 if (!cst)
317 return NULL;
318
319 isl_int_set(cst->n, n);
320 isl_int_set(cst->d, d);
321
322 return &cst->up;
323 }
324
325 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
326 int var, int size)
327 {
328 struct isl_upoly_rec *rec;
329
330 isl_assert(ctx, var >= 0, return NULL);
331 isl_assert(ctx, size >= 0, return NULL);
332 rec = isl_calloc(ctx, struct isl_upoly_rec,
333 sizeof(struct isl_upoly_rec) +
334 size * sizeof(struct isl_upoly *));
335 if (!rec)
336 return NULL;
337
338 rec->up.ref = 1;
339 rec->up.ctx = ctx;
340 isl_ctx_ref(ctx);
341 rec->up.var = var;
342
343 rec->n = 0;
344 rec->size = size;
345
346 return rec;
347 }
348
349 __isl_give isl_qpolynomial *isl_qpolynomial_reset_domain_space(
350 __isl_take isl_qpolynomial *qp, __isl_take isl_space *dim)
351 {
352 qp = isl_qpolynomial_cow(qp);
353 if (!qp || !dim)
354 goto error;
355
356 isl_space_free(qp->dim);
357 qp->dim = dim;
358
359 return qp;
360 error:
361 isl_qpolynomial_free(qp);
362 isl_space_free(dim);
363 return NULL;
364 }
365
366 /* Reset the space of "qp". This function is called from isl_pw_templ.c
367 * and doesn't know if the space of an element object is represented
368 * directly or through its domain. It therefore passes along both.
369 */
370 __isl_give isl_qpolynomial *isl_qpolynomial_reset_space_and_domain(
371 __isl_take isl_qpolynomial *qp, __isl_take isl_space *space,
372 __isl_take isl_space *domain)
373 {
374 isl_space_free(space);
375 return isl_qpolynomial_reset_domain_space(qp, domain);
376 }
377
378 isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp)
379 {
380 return qp ? qp->dim->ctx : NULL;
381 }
382
383 __isl_give isl_space *isl_qpolynomial_get_domain_space(
384 __isl_keep isl_qpolynomial *qp)
385 {
386 return qp ? isl_space_copy(qp->dim) : NULL;
387 }
388
389 __isl_give isl_space *isl_qpolynomial_get_space(__isl_keep isl_qpolynomial *qp)
390 {
391 isl_space *space;
392 if (!qp)
393 return NULL;
394 space = isl_space_copy(qp->dim);
395 space = isl_space_from_domain(space);
396 space = isl_space_add_dims(space, isl_dim_out, 1);
397 return space;
398 }
399
400 /* Externally, an isl_qpolynomial has a map space, but internally, the
401 * ls field corresponds to the domain of that space.
402 */
403 unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp,
404 enum isl_dim_type type)
405 {
406 if (!qp)
407 return 0;
408 if (type == isl_dim_out)
409 return 1;
410 if (type == isl_dim_in)
411 type = isl_dim_set;
412 return isl_space_dim(qp->dim, type);
413 }
414
415 isl_bool isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
416 {
417 return qp ? isl_upoly_is_zero(qp->upoly) : isl_bool_error;
418 }
419
420 isl_bool isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
421 {
422 return qp ? isl_upoly_is_one(qp->upoly) : isl_bool_error;
423 }
424
425 isl_bool isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
426 {
427 return qp ? isl_upoly_is_nan(qp->upoly) : isl_bool_error;
428 }
429
430 isl_bool isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
431 {
432 return qp ? isl_upoly_is_infty(qp->upoly) : isl_bool_error;
433 }
434
435 isl_bool isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
436 {
437 return qp ? isl_upoly_is_neginfty(qp->upoly) : isl_bool_error;
438 }
439
440 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
441 {
442 return qp ? isl_upoly_sgn(qp->upoly) : 0;
443 }
444
445 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
446 {
447 isl_int_clear(cst->n);
448 isl_int_clear(cst->d);
449 }
450
451 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
452 {
453 int i;
454
455 for (i = 0; i < rec->n; ++i)
456 isl_upoly_free(rec->p[i]);
457 }
458
459 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
460 {
461 if (!up)
462 return NULL;
463
464 up->ref++;
465 return up;
466 }
467
468 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
469 {
470 struct isl_upoly_cst *cst;
471 struct isl_upoly_cst *dup;
472
473 cst = isl_upoly_as_cst(up);
474 if (!cst)
475 return NULL;
476
477 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
478 if (!dup)
479 return NULL;
480 isl_int_set(dup->n, cst->n);
481 isl_int_set(dup->d, cst->d);
482
483 return &dup->up;
484 }
485
486 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
487 {
488 int i;
489 struct isl_upoly_rec *rec;
490 struct isl_upoly_rec *dup;
491
492 rec = isl_upoly_as_rec(up);
493 if (!rec)
494 return NULL;
495
496 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
497 if (!dup)
498 return NULL;
499
500 for (i = 0; i < rec->n; ++i) {
501 dup->p[i] = isl_upoly_copy(rec->p[i]);
502 if (!dup->p[i])
503 goto error;
504 dup->n++;
505 }
506
507 return &dup->up;
508 error:
509 isl_upoly_free(&dup->up);
510 return NULL;
511 }
512
513 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
514 {
515 if (!up)
516 return NULL;
517
518 if (isl_upoly_is_cst(up))
519 return isl_upoly_dup_cst(up);
520 else
521 return isl_upoly_dup_rec(up);
522 }
523
524 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
525 {
526 if (!up)
527 return NULL;
528
529 if (up->ref == 1)
530 return up;
531 up->ref--;
532 return isl_upoly_dup(up);
533 }
534
535 void isl_upoly_free(__isl_take struct isl_upoly *up)
536 {
537 if (!up)
538 return;
539
540 if (--up->ref > 0)
541 return;
542
543 if (up->var < 0)
544 upoly_free_cst((struct isl_upoly_cst *)up);
545 else
546 upoly_free_rec((struct isl_upoly_rec *)up);
547
548 isl_ctx_deref(up->ctx);
549 free(up);
550 }
551
552 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
553 {
554 isl_int gcd;
555
556 isl_int_init(gcd);
557 isl_int_gcd(gcd, cst->n, cst->d);
558 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
559 isl_int_divexact(cst->n, cst->n, gcd);
560 isl_int_divexact(cst->d, cst->d, gcd);
561 }
562 isl_int_clear(gcd);
563 }
564
565 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
566 __isl_take struct isl_upoly *up2)
567 {
568 struct isl_upoly_cst *cst1;
569 struct isl_upoly_cst *cst2;
570
571 up1 = isl_upoly_cow(up1);
572 if (!up1 || !up2)
573 goto error;
574
575 cst1 = isl_upoly_as_cst(up1);
576 cst2 = isl_upoly_as_cst(up2);
577
578 if (isl_int_eq(cst1->d, cst2->d))
579 isl_int_add(cst1->n, cst1->n, cst2->n);
580 else {
581 isl_int_mul(cst1->n, cst1->n, cst2->d);
582 isl_int_addmul(cst1->n, cst2->n, cst1->d);
583 isl_int_mul(cst1->d, cst1->d, cst2->d);
584 }
585
586 isl_upoly_cst_reduce(cst1);
587
588 isl_upoly_free(up2);
589 return up1;
590 error:
591 isl_upoly_free(up1);
592 isl_upoly_free(up2);
593 return NULL;
594 }
595
596 static __isl_give struct isl_upoly *replace_by_zero(
597 __isl_take struct isl_upoly *up)
598 {
599 struct isl_ctx *ctx;
600
601 if (!up)
602 return NULL;
603 ctx = up->ctx;
604 isl_upoly_free(up);
605 return isl_upoly_zero(ctx);
606 }
607
608 static __isl_give struct isl_upoly *replace_by_constant_term(
609 __isl_take struct isl_upoly *up)
610 {
611 struct isl_upoly_rec *rec;
612 struct isl_upoly *cst;
613
614 if (!up)
615 return NULL;
616
617 rec = isl_upoly_as_rec(up);
618 if (!rec)
619 goto error;
620 cst = isl_upoly_copy(rec->p[0]);
621 isl_upoly_free(up);
622 return cst;
623 error:
624 isl_upoly_free(up);
625 return NULL;
626 }
627
628 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
629 __isl_take struct isl_upoly *up2)
630 {
631 int i;
632 struct isl_upoly_rec *rec1, *rec2;
633
634 if (!up1 || !up2)
635 goto error;
636
637 if (isl_upoly_is_nan(up1)) {
638 isl_upoly_free(up2);
639 return up1;
640 }
641
642 if (isl_upoly_is_nan(up2)) {
643 isl_upoly_free(up1);
644 return up2;
645 }
646
647 if (isl_upoly_is_zero(up1)) {
648 isl_upoly_free(up1);
649 return up2;
650 }
651
652 if (isl_upoly_is_zero(up2)) {
653 isl_upoly_free(up2);
654 return up1;
655 }
656
657 if (up1->var < up2->var)
658 return isl_upoly_sum(up2, up1);
659
660 if (up2->var < up1->var) {
661 struct isl_upoly_rec *rec;
662 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
663 isl_upoly_free(up1);
664 return up2;
665 }
666 up1 = isl_upoly_cow(up1);
667 rec = isl_upoly_as_rec(up1);
668 if (!rec)
669 goto error;
670 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
671 if (rec->n == 1)
672 up1 = replace_by_constant_term(up1);
673 return up1;
674 }
675
676 if (isl_upoly_is_cst(up1))
677 return isl_upoly_sum_cst(up1, up2);
678
679 rec1 = isl_upoly_as_rec(up1);
680 rec2 = isl_upoly_as_rec(up2);
681 if (!rec1 || !rec2)
682 goto error;
683
684 if (rec1->n < rec2->n)
685 return isl_upoly_sum(up2, up1);
686
687 up1 = isl_upoly_cow(up1);
688 rec1 = isl_upoly_as_rec(up1);
689 if (!rec1)
690 goto error;
691
692 for (i = rec2->n - 1; i >= 0; --i) {
693 rec1->p[i] = isl_upoly_sum(rec1->p[i],
694 isl_upoly_copy(rec2->p[i]));
695 if (!rec1->p[i])
696 goto error;
697 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
698 isl_upoly_free(rec1->p[i]);
699 rec1->n--;
700 }
701 }
702
703 if (rec1->n == 0)
704 up1 = replace_by_zero(up1);
705 else if (rec1->n == 1)
706 up1 = replace_by_constant_term(up1);
707
708 isl_upoly_free(up2);
709
710 return up1;
711 error:
712 isl_upoly_free(up1);
713 isl_upoly_free(up2);
714 return NULL;
715 }
716
717 __isl_give struct isl_upoly *isl_upoly_cst_add_isl_int(
718 __isl_take struct isl_upoly *up, isl_int v)
719 {
720 struct isl_upoly_cst *cst;
721
722 up = isl_upoly_cow(up);
723 if (!up)
724 return NULL;
725
726 cst = isl_upoly_as_cst(up);
727
728 isl_int_addmul(cst->n, cst->d, v);
729
730 return up;
731 }
732
733 __isl_give struct isl_upoly *isl_upoly_add_isl_int(
734 __isl_take struct isl_upoly *up, isl_int v)
735 {
736 struct isl_upoly_rec *rec;
737
738 if (!up)
739 return NULL;
740
741 if (isl_upoly_is_cst(up))
742 return isl_upoly_cst_add_isl_int(up, v);
743
744 up = isl_upoly_cow(up);
745 rec = isl_upoly_as_rec(up);
746 if (!rec)
747 goto error;
748
749 rec->p[0] = isl_upoly_add_isl_int(rec->p[0], v);
750 if (!rec->p[0])
751 goto error;
752
753 return up;
754 error:
755 isl_upoly_free(up);
756 return NULL;
757 }
758
759 __isl_give struct isl_upoly *isl_upoly_cst_mul_isl_int(
760 __isl_take struct isl_upoly *up, isl_int v)
761 {
762 struct isl_upoly_cst *cst;
763
764 if (isl_upoly_is_zero(up))
765 return up;
766
767 up = isl_upoly_cow(up);
768 if (!up)
769 return NULL;
770
771 cst = isl_upoly_as_cst(up);
772
773 isl_int_mul(cst->n, cst->n, v);
774
775 return up;
776 }
777
778 __isl_give struct isl_upoly *isl_upoly_mul_isl_int(
779 __isl_take struct isl_upoly *up, isl_int v)
780 {
781 int i;
782 struct isl_upoly_rec *rec;
783
784 if (!up)
785 return NULL;
786
787 if (isl_upoly_is_cst(up))
788 return isl_upoly_cst_mul_isl_int(up, v);
789
790 up = isl_upoly_cow(up);
791 rec = isl_upoly_as_rec(up);
792 if (!rec)
793 goto error;
794
795 for (i = 0; i < rec->n; ++i) {
796 rec->p[i] = isl_upoly_mul_isl_int(rec->p[i], v);
797 if (!rec->p[i])
798 goto error;
799 }
800
801 return up;
802 error:
803 isl_upoly_free(up);
804 return NULL;
805 }
806
807 /* Multiply the constant polynomial "up" by "v".
808 */
809 static __isl_give struct isl_upoly *isl_upoly_cst_scale_val(
810 __isl_take struct isl_upoly *up, __isl_keep isl_val *v)
811 {
812 struct isl_upoly_cst *cst;
813
814 if (isl_upoly_is_zero(up))
815 return up;
816
817 up = isl_upoly_cow(up);
818 if (!up)
819 return NULL;
820
821 cst = isl_upoly_as_cst(up);
822
823 isl_int_mul(cst->n, cst->n, v->n);
824 isl_int_mul(cst->d, cst->d, v->d);
825 isl_upoly_cst_reduce(cst);
826
827 return up;
828 }
829
830 /* Multiply the polynomial "up" by "v".
831 */
832 static __isl_give struct isl_upoly *isl_upoly_scale_val(
833 __isl_take struct isl_upoly *up, __isl_keep isl_val *v)
834 {
835 int i;
836 struct isl_upoly_rec *rec;
837
838 if (!up)
839 return NULL;
840
841 if (isl_upoly_is_cst(up))
842 return isl_upoly_cst_scale_val(up, v);
843
844 up = isl_upoly_cow(up);
845 rec = isl_upoly_as_rec(up);
846 if (!rec)
847 goto error;
848
849 for (i = 0; i < rec->n; ++i) {
850 rec->p[i] = isl_upoly_scale_val(rec->p[i], v);
851 if (!rec->p[i])
852 goto error;
853 }
854
855 return up;
856 error:
857 isl_upoly_free(up);
858 return NULL;
859 }
860
861 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
862 __isl_take struct isl_upoly *up2)
863 {
864 struct isl_upoly_cst *cst1;
865 struct isl_upoly_cst *cst2;
866
867 up1 = isl_upoly_cow(up1);
868 if (!up1 || !up2)
869 goto error;
870
871 cst1 = isl_upoly_as_cst(up1);
872 cst2 = isl_upoly_as_cst(up2);
873
874 isl_int_mul(cst1->n, cst1->n, cst2->n);
875 isl_int_mul(cst1->d, cst1->d, cst2->d);
876
877 isl_upoly_cst_reduce(cst1);
878
879 isl_upoly_free(up2);
880 return up1;
881 error:
882 isl_upoly_free(up1);
883 isl_upoly_free(up2);
884 return NULL;
885 }
886
887 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
888 __isl_take struct isl_upoly *up2)
889 {
890 struct isl_upoly_rec *rec1;
891 struct isl_upoly_rec *rec2;
892 struct isl_upoly_rec *res = NULL;
893 int i, j;
894 int size;
895
896 rec1 = isl_upoly_as_rec(up1);
897 rec2 = isl_upoly_as_rec(up2);
898 if (!rec1 || !rec2)
899 goto error;
900 size = rec1->n + rec2->n - 1;
901 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
902 if (!res)
903 goto error;
904
905 for (i = 0; i < rec1->n; ++i) {
906 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
907 isl_upoly_copy(rec1->p[i]));
908 if (!res->p[i])
909 goto error;
910 res->n++;
911 }
912 for (; i < size; ++i) {
913 res->p[i] = isl_upoly_zero(up1->ctx);
914 if (!res->p[i])
915 goto error;
916 res->n++;
917 }
918 for (i = 0; i < rec1->n; ++i) {
919 for (j = 1; j < rec2->n; ++j) {
920 struct isl_upoly *up;
921 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
922 isl_upoly_copy(rec1->p[i]));
923 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
924 if (!res->p[i + j])
925 goto error;
926 }
927 }
928
929 isl_upoly_free(up1);
930 isl_upoly_free(up2);
931
932 return &res->up;
933 error:
934 isl_upoly_free(up1);
935 isl_upoly_free(up2);
936 isl_upoly_free(&res->up);
937 return NULL;
938 }
939
940 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
941 __isl_take struct isl_upoly *up2)
942 {
943 if (!up1 || !up2)
944 goto error;
945
946 if (isl_upoly_is_nan(up1)) {
947 isl_upoly_free(up2);
948 return up1;
949 }
950
951 if (isl_upoly_is_nan(up2)) {
952 isl_upoly_free(up1);
953 return up2;
954 }
955
956 if (isl_upoly_is_zero(up1)) {
957 isl_upoly_free(up2);
958 return up1;
959 }
960
961 if (isl_upoly_is_zero(up2)) {
962 isl_upoly_free(up1);
963 return up2;
964 }
965
966 if (isl_upoly_is_one(up1)) {
967 isl_upoly_free(up1);
968 return up2;
969 }
970
971 if (isl_upoly_is_one(up2)) {
972 isl_upoly_free(up2);
973 return up1;
974 }
975
976 if (up1->var < up2->var)
977 return isl_upoly_mul(up2, up1);
978
979 if (up2->var < up1->var) {
980 int i;
981 struct isl_upoly_rec *rec;
982 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
983 isl_ctx *ctx = up1->ctx;
984 isl_upoly_free(up1);
985 isl_upoly_free(up2);
986 return isl_upoly_nan(ctx);
987 }
988 up1 = isl_upoly_cow(up1);
989 rec = isl_upoly_as_rec(up1);
990 if (!rec)
991 goto error;
992
993 for (i = 0; i < rec->n; ++i) {
994 rec->p[i] = isl_upoly_mul(rec->p[i],
995 isl_upoly_copy(up2));
996 if (!rec->p[i])
997 goto error;
998 }
999 isl_upoly_free(up2);
1000 return up1;
1001 }
1002
1003 if (isl_upoly_is_cst(up1))
1004 return isl_upoly_mul_cst(up1, up2);
1005
1006 return isl_upoly_mul_rec(up1, up2);
1007 error:
1008 isl_upoly_free(up1);
1009 isl_upoly_free(up2);
1010 return NULL;
1011 }
1012
1013 __isl_give struct isl_upoly *isl_upoly_pow(__isl_take struct isl_upoly *up,
1014 unsigned power)
1015 {
1016 struct isl_upoly *res;
1017
1018 if (!up)
1019 return NULL;
1020 if (power == 1)
1021 return up;
1022
1023 if (power % 2)
1024 res = isl_upoly_copy(up);
1025 else
1026 res = isl_upoly_one(up->ctx);
1027
1028 while (power >>= 1) {
1029 up = isl_upoly_mul(up, isl_upoly_copy(up));
1030 if (power % 2)
1031 res = isl_upoly_mul(res, isl_upoly_copy(up));
1032 }
1033
1034 isl_upoly_free(up);
1035 return res;
1036 }
1037
1038 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_space *dim,
1039 unsigned n_div, __isl_take struct isl_upoly *up)
1040 {
1041 struct isl_qpolynomial *qp = NULL;
1042 unsigned total;
1043
1044 if (!dim || !up)
1045 goto error;
1046
1047 if (!isl_space_is_set(dim))
1048 isl_die(isl_space_get_ctx(dim), isl_error_invalid,
1049 "domain of polynomial should be a set", goto error);
1050
1051 total = isl_space_dim(dim, isl_dim_all);
1052
1053 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
1054 if (!qp)
1055 goto error;
1056
1057 qp->ref = 1;
1058 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
1059 if (!qp->div)
1060 goto error;
1061
1062 qp->dim = dim;
1063 qp->upoly = up;
1064
1065 return qp;
1066 error:
1067 isl_space_free(dim);
1068 isl_upoly_free(up);
1069 isl_qpolynomial_free(qp);
1070 return NULL;
1071 }
1072
1073 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
1074 {
1075 if (!qp)
1076 return NULL;
1077
1078 qp->ref++;
1079 return qp;
1080 }
1081
1082 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
1083 {
1084 struct isl_qpolynomial *dup;
1085
1086 if (!qp)
1087 return NULL;
1088
1089 dup = isl_qpolynomial_alloc(isl_space_copy(qp->dim), qp->div->n_row,
1090 isl_upoly_copy(qp->upoly));
1091 if (!dup)
1092 return NULL;
1093 isl_mat_free(dup->div);
1094 dup->div = isl_mat_copy(qp->div);
1095 if (!dup->div)
1096 goto error;
1097
1098 return dup;
1099 error:
1100 isl_qpolynomial_free(dup);
1101 return NULL;
1102 }
1103
1104 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
1105 {
1106 if (!qp)
1107 return NULL;
1108
1109 if (qp->ref == 1)
1110 return qp;
1111 qp->ref--;
1112 return isl_qpolynomial_dup(qp);
1113 }
1114
1115 __isl_null isl_qpolynomial *isl_qpolynomial_free(
1116 __isl_take isl_qpolynomial *qp)
1117 {
1118 if (!qp)
1119 return NULL;
1120
1121 if (--qp->ref > 0)
1122 return NULL;
1123
1124 isl_space_free(qp->dim);
1125 isl_mat_free(qp->div);
1126 isl_upoly_free(qp->upoly);
1127
1128 free(qp);
1129 return NULL;
1130 }
1131
1132 __isl_give struct isl_upoly *isl_upoly_var_pow(isl_ctx *ctx, int pos, int power)
1133 {
1134 int i;
1135 struct isl_upoly_rec *rec;
1136 struct isl_upoly_cst *cst;
1137
1138 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
1139 if (!rec)
1140 return NULL;
1141 for (i = 0; i < 1 + power; ++i) {
1142 rec->p[i] = isl_upoly_zero(ctx);
1143 if (!rec->p[i])
1144 goto error;
1145 rec->n++;
1146 }
1147 cst = isl_upoly_as_cst(rec->p[power]);
1148 isl_int_set_si(cst->n, 1);
1149
1150 return &rec->up;
1151 error:
1152 isl_upoly_free(&rec->up);
1153 return NULL;
1154 }
1155
1156 /* r array maps original positions to new positions.
1157 */
1158 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
1159 int *r)
1160 {
1161 int i;
1162 struct isl_upoly_rec *rec;
1163 struct isl_upoly *base;
1164 struct isl_upoly *res;
1165
1166 if (isl_upoly_is_cst(up))
1167 return up;
1168
1169 rec = isl_upoly_as_rec(up);
1170 if (!rec)
1171 goto error;
1172
1173 isl_assert(up->ctx, rec->n >= 1, goto error);
1174
1175 base = isl_upoly_var_pow(up->ctx, r[up->var], 1);
1176 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
1177
1178 for (i = rec->n - 2; i >= 0; --i) {
1179 res = isl_upoly_mul(res, isl_upoly_copy(base));
1180 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
1181 }
1182
1183 isl_upoly_free(base);
1184 isl_upoly_free(up);
1185
1186 return res;
1187 error:
1188 isl_upoly_free(up);
1189 return NULL;
1190 }
1191
1192 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
1193 {
1194 int n_row, n_col;
1195 int equal;
1196
1197 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1198 div1->n_col >= div2->n_col, return -1);
1199
1200 if (div1->n_row == div2->n_row)
1201 return isl_mat_is_equal(div1, div2);
1202
1203 n_row = div1->n_row;
1204 n_col = div1->n_col;
1205 div1->n_row = div2->n_row;
1206 div1->n_col = div2->n_col;
1207
1208 equal = isl_mat_is_equal(div1, div2);
1209
1210 div1->n_row = n_row;
1211 div1->n_col = n_col;
1212
1213 return equal;
1214 }
1215
1216 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
1217 {
1218 int li, lj;
1219
1220 li = isl_seq_last_non_zero(div->row[i], div->n_col);
1221 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
1222
1223 if (li != lj)
1224 return li - lj;
1225
1226 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
1227 }
1228
1229 struct isl_div_sort_info {
1230 isl_mat *div;
1231 int row;
1232 };
1233
1234 static int div_sort_cmp(const void *p1, const void *p2)
1235 {
1236 const struct isl_div_sort_info *i1, *i2;
1237 i1 = (const struct isl_div_sort_info *) p1;
1238 i2 = (const struct isl_div_sort_info *) p2;
1239
1240 return cmp_row(i1->div, i1->row, i2->row);
1241 }
1242
1243 /* Sort divs and remove duplicates.
1244 */
1245 static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp)
1246 {
1247 int i;
1248 int skip;
1249 int len;
1250 struct isl_div_sort_info *array = NULL;
1251 int *pos = NULL, *at = NULL;
1252 int *reordering = NULL;
1253 unsigned div_pos;
1254
1255 if (!qp)
1256 return NULL;
1257 if (qp->div->n_row <= 1)
1258 return qp;
1259
1260 div_pos = isl_space_dim(qp->dim, isl_dim_all);
1261
1262 array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info,
1263 qp->div->n_row);
1264 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1265 at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1266 len = qp->div->n_col - 2;
1267 reordering = isl_alloc_array(qp->div->ctx, int, len);
1268 if (!array || !pos || !at || !reordering)
1269 goto error;
1270
1271 for (i = 0; i < qp->div->n_row; ++i) {
1272 array[i].div = qp->div;
1273 array[i].row = i;
1274 pos[i] = i;
1275 at[i] = i;
1276 }
1277
1278 qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
1279 div_sort_cmp);
1280
1281 for (i = 0; i < div_pos; ++i)
1282 reordering[i] = i;
1283
1284 for (i = 0; i < qp->div->n_row; ++i) {
1285 if (pos[array[i].row] == i)
1286 continue;
1287 qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]);
1288 pos[at[i]] = pos[array[i].row];
1289 at[pos[array[i].row]] = at[i];
1290 at[i] = array[i].row;
1291 pos[array[i].row] = i;
1292 }
1293
1294 skip = 0;
1295 for (i = 0; i < len - div_pos; ++i) {
1296 if (i > 0 &&
1297 isl_seq_eq(qp->div->row[i - skip - 1],
1298 qp->div->row[i - skip], qp->div->n_col)) {
1299 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
1300 isl_mat_col_add(qp->div, 2 + div_pos + i - skip - 1,
1301 2 + div_pos + i - skip);
1302 qp->div = isl_mat_drop_cols(qp->div,
1303 2 + div_pos + i - skip, 1);
1304 skip++;
1305 }
1306 reordering[div_pos + array[i].row] = div_pos + i - skip;
1307 }
1308
1309 qp->upoly = reorder(qp->upoly, reordering);
1310
1311 if (!qp->upoly || !qp->div)
1312 goto error;
1313
1314 free(at);
1315 free(pos);
1316 free(array);
1317 free(reordering);
1318
1319 return qp;
1320 error:
1321 free(at);
1322 free(pos);
1323 free(array);
1324 free(reordering);
1325 isl_qpolynomial_free(qp);
1326 return NULL;
1327 }
1328
1329 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1330 int *exp, int first)
1331 {
1332 int i;
1333 struct isl_upoly_rec *rec;
1334
1335 if (isl_upoly_is_cst(up))
1336 return up;
1337
1338 if (up->var < first)
1339 return up;
1340
1341 if (exp[up->var - first] == up->var - first)
1342 return up;
1343
1344 up = isl_upoly_cow(up);
1345 if (!up)
1346 goto error;
1347
1348 up->var = exp[up->var - first] + first;
1349
1350 rec = isl_upoly_as_rec(up);
1351 if (!rec)
1352 goto error;
1353
1354 for (i = 0; i < rec->n; ++i) {
1355 rec->p[i] = expand(rec->p[i], exp, first);
1356 if (!rec->p[i])
1357 goto error;
1358 }
1359
1360 return up;
1361 error:
1362 isl_upoly_free(up);
1363 return NULL;
1364 }
1365
1366 static __isl_give isl_qpolynomial *with_merged_divs(
1367 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1368 __isl_take isl_qpolynomial *qp2),
1369 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1370 {
1371 int *exp1 = NULL;
1372 int *exp2 = NULL;
1373 isl_mat *div = NULL;
1374 int n_div1, n_div2;
1375
1376 qp1 = isl_qpolynomial_cow(qp1);
1377 qp2 = isl_qpolynomial_cow(qp2);
1378
1379 if (!qp1 || !qp2)
1380 goto error;
1381
1382 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1383 qp1->div->n_col >= qp2->div->n_col, goto error);
1384
1385 n_div1 = qp1->div->n_row;
1386 n_div2 = qp2->div->n_row;
1387 exp1 = isl_alloc_array(qp1->div->ctx, int, n_div1);
1388 exp2 = isl_alloc_array(qp2->div->ctx, int, n_div2);
1389 if ((n_div1 && !exp1) || (n_div2 && !exp2))
1390 goto error;
1391
1392 div = isl_merge_divs(qp1->div, qp2->div, exp1, exp2);
1393 if (!div)
1394 goto error;
1395
1396 isl_mat_free(qp1->div);
1397 qp1->div = isl_mat_copy(div);
1398 isl_mat_free(qp2->div);
1399 qp2->div = isl_mat_copy(div);
1400
1401 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1402 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1403
1404 if (!qp1->upoly || !qp2->upoly)
1405 goto error;
1406
1407 isl_mat_free(div);
1408 free(exp1);
1409 free(exp2);
1410
1411 return fn(qp1, qp2);
1412 error:
1413 isl_mat_free(div);
1414 free(exp1);
1415 free(exp2);
1416 isl_qpolynomial_free(qp1);
1417 isl_qpolynomial_free(qp2);
1418 return NULL;
1419 }
1420
1421 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1422 __isl_take isl_qpolynomial *qp2)
1423 {
1424 qp1 = isl_qpolynomial_cow(qp1);
1425
1426 if (!qp1 || !qp2)
1427 goto error;
1428
1429 if (qp1->div->n_row < qp2->div->n_row)
1430 return isl_qpolynomial_add(qp2, qp1);
1431
1432 isl_assert(qp1->dim->ctx, isl_space_is_equal(qp1->dim, qp2->dim), goto error);
1433 if (!compatible_divs(qp1->div, qp2->div))
1434 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1435
1436 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1437 if (!qp1->upoly)
1438 goto error;
1439
1440 isl_qpolynomial_free(qp2);
1441
1442 return qp1;
1443 error:
1444 isl_qpolynomial_free(qp1);
1445 isl_qpolynomial_free(qp2);
1446 return NULL;
1447 }
1448
1449 __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain(
1450 __isl_keep isl_set *dom,
1451 __isl_take isl_qpolynomial *qp1,
1452 __isl_take isl_qpolynomial *qp2)
1453 {
1454 qp1 = isl_qpolynomial_add(qp1, qp2);
1455 qp1 = isl_qpolynomial_gist(qp1, isl_set_copy(dom));
1456 return qp1;
1457 }
1458
1459 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1460 __isl_take isl_qpolynomial *qp2)
1461 {
1462 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1463 }
1464
1465 __isl_give isl_qpolynomial *isl_qpolynomial_add_isl_int(
1466 __isl_take isl_qpolynomial *qp, isl_int v)
1467 {
1468 if (isl_int_is_zero(v))
1469 return qp;
1470
1471 qp = isl_qpolynomial_cow(qp);
1472 if (!qp)
1473 return NULL;
1474
1475 qp->upoly = isl_upoly_add_isl_int(qp->upoly, v);
1476 if (!qp->upoly)
1477 goto error;
1478
1479 return qp;
1480 error:
1481 isl_qpolynomial_free(qp);
1482 return NULL;
1483
1484 }
1485
1486 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1487 {
1488 if (!qp)
1489 return NULL;
1490
1491 return isl_qpolynomial_mul_isl_int(qp, qp->dim->ctx->negone);
1492 }
1493
1494 __isl_give isl_qpolynomial *isl_qpolynomial_mul_isl_int(
1495 __isl_take isl_qpolynomial *qp, isl_int v)
1496 {
1497 if (isl_int_is_one(v))
1498 return qp;
1499
1500 if (qp && isl_int_is_zero(v)) {
1501 isl_qpolynomial *zero;
1502 zero = isl_qpolynomial_zero_on_domain(isl_space_copy(qp->dim));
1503 isl_qpolynomial_free(qp);
1504 return zero;
1505 }
1506
1507 qp = isl_qpolynomial_cow(qp);
1508 if (!qp)
1509 return NULL;
1510
1511 qp->upoly = isl_upoly_mul_isl_int(qp->upoly, v);
1512 if (!qp->upoly)
1513 goto error;
1514
1515 return qp;
1516 error:
1517 isl_qpolynomial_free(qp);
1518 return NULL;
1519 }
1520
1521 __isl_give isl_qpolynomial *isl_qpolynomial_scale(
1522 __isl_take isl_qpolynomial *qp, isl_int v)
1523 {
1524 return isl_qpolynomial_mul_isl_int(qp, v);
1525 }
1526
1527 /* Multiply "qp" by "v".
1528 */
1529 __isl_give isl_qpolynomial *isl_qpolynomial_scale_val(
1530 __isl_take isl_qpolynomial *qp, __isl_take isl_val *v)
1531 {
1532 if (!qp || !v)
1533 goto error;
1534
1535 if (!isl_val_is_rat(v))
1536 isl_die(isl_qpolynomial_get_ctx(qp), isl_error_invalid,
1537 "expecting rational factor", goto error);
1538
1539 if (isl_val_is_one(v)) {
1540 isl_val_free(v);
1541 return qp;
1542 }
1543
1544 if (isl_val_is_zero(v)) {
1545 isl_space *space;
1546
1547 space = isl_qpolynomial_get_domain_space(qp);
1548 isl_qpolynomial_free(qp);
1549 isl_val_free(v);
1550 return isl_qpolynomial_zero_on_domain(space);
1551 }
1552
1553 qp = isl_qpolynomial_cow(qp);
1554 if (!qp)
1555 goto error;
1556
1557 qp->upoly = isl_upoly_scale_val(qp->upoly, v);
1558 if (!qp->upoly)
1559 qp = isl_qpolynomial_free(qp);
1560
1561 isl_val_free(v);
1562 return qp;
1563 error:
1564 isl_val_free(v);
1565 isl_qpolynomial_free(qp);
1566 return NULL;
1567 }
1568
1569 /* Divide "qp" by "v".
1570 */
1571 __isl_give isl_qpolynomial *isl_qpolynomial_scale_down_val(
1572 __isl_take isl_qpolynomial *qp, __isl_take isl_val *v)
1573 {
1574 if (!qp || !v)
1575 goto error;
1576
1577 if (!isl_val_is_rat(v))
1578 isl_die(isl_qpolynomial_get_ctx(qp), isl_error_invalid,
1579 "expecting rational factor", goto error);
1580 if (isl_val_is_zero(v))
1581 isl_die(isl_val_get_ctx(v), isl_error_invalid,
1582 "cannot scale down by zero", goto error);
1583
1584 return isl_qpolynomial_scale_val(qp, isl_val_inv(v));
1585 error:
1586 isl_val_free(v);
1587 isl_qpolynomial_free(qp);
1588 return NULL;
1589 }
1590
1591 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1592 __isl_take isl_qpolynomial *qp2)
1593 {
1594 qp1 = isl_qpolynomial_cow(qp1);
1595
1596 if (!qp1 || !qp2)
1597 goto error;
1598
1599 if (qp1->div->n_row < qp2->div->n_row)
1600 return isl_qpolynomial_mul(qp2, qp1);
1601
1602 isl_assert(qp1->dim->ctx, isl_space_is_equal(qp1->dim, qp2->dim), goto error);
1603 if (!compatible_divs(qp1->div, qp2->div))
1604 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1605
1606 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1607 if (!qp1->upoly)
1608 goto error;
1609
1610 isl_qpolynomial_free(qp2);
1611
1612 return qp1;
1613 error:
1614 isl_qpolynomial_free(qp1);
1615 isl_qpolynomial_free(qp2);
1616 return NULL;
1617 }
1618
1619 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_qpolynomial *qp,
1620 unsigned power)
1621 {
1622 qp = isl_qpolynomial_cow(qp);
1623
1624 if (!qp)
1625 return NULL;
1626
1627 qp->upoly = isl_upoly_pow(qp->upoly, power);
1628 if (!qp->upoly)
1629 goto error;
1630
1631 return qp;
1632 error:
1633 isl_qpolynomial_free(qp);
1634 return NULL;
1635 }
1636
1637 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_pow(
1638 __isl_take isl_pw_qpolynomial *pwqp, unsigned power)
1639 {
1640 int i;
1641
1642 if (power == 1)
1643 return pwqp;
1644
1645 pwqp = isl_pw_qpolynomial_cow(pwqp);
1646 if (!pwqp)
1647 return NULL;
1648
1649 for (i = 0; i < pwqp->n; ++i) {
1650 pwqp->p[i].qp = isl_qpolynomial_pow(pwqp->p[i].qp, power);
1651 if (!pwqp->p[i].qp)
1652 return isl_pw_qpolynomial_free(pwqp);
1653 }
1654
1655 return pwqp;
1656 }
1657
1658 __isl_give isl_qpolynomial *isl_qpolynomial_zero_on_domain(
1659 __isl_take isl_space *dim)
1660 {
1661 if (!dim)
1662 return NULL;
1663 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1664 }
1665
1666 __isl_give isl_qpolynomial *isl_qpolynomial_one_on_domain(
1667 __isl_take isl_space *dim)
1668 {
1669 if (!dim)
1670 return NULL;
1671 return isl_qpolynomial_alloc(dim, 0, isl_upoly_one(dim->ctx));
1672 }
1673
1674 __isl_give isl_qpolynomial *isl_qpolynomial_infty_on_domain(
1675 __isl_take isl_space *dim)
1676 {
1677 if (!dim)
1678 return NULL;
1679 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1680 }
1681
1682 __isl_give isl_qpolynomial *isl_qpolynomial_neginfty_on_domain(
1683 __isl_take isl_space *dim)
1684 {
1685 if (!dim)
1686 return NULL;
1687 return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx));
1688 }
1689
1690 __isl_give isl_qpolynomial *isl_qpolynomial_nan_on_domain(
1691 __isl_take isl_space *dim)
1692 {
1693 if (!dim)
1694 return NULL;
1695 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1696 }
1697
1698 __isl_give isl_qpolynomial *isl_qpolynomial_cst_on_domain(
1699 __isl_take isl_space *dim,
1700 isl_int v)
1701 {
1702 struct isl_qpolynomial *qp;
1703 struct isl_upoly_cst *cst;
1704
1705 if (!dim)
1706 return NULL;
1707
1708 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1709 if (!qp)
1710 return NULL;
1711
1712 cst = isl_upoly_as_cst(qp->upoly);
1713 isl_int_set(cst->n, v);
1714
1715 return qp;
1716 }
1717
1718 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1719 isl_int *n, isl_int *d)
1720 {
1721 struct isl_upoly_cst *cst;
1722
1723 if (!qp)
1724 return -1;
1725
1726 if (!isl_upoly_is_cst(qp->upoly))
1727 return 0;
1728
1729 cst = isl_upoly_as_cst(qp->upoly);
1730 if (!cst)
1731 return -1;
1732
1733 if (n)
1734 isl_int_set(*n, cst->n);
1735 if (d)
1736 isl_int_set(*d, cst->d);
1737
1738 return 1;
1739 }
1740
1741 /* Return the constant term of "up".
1742 */
1743 static __isl_give isl_val *isl_upoly_get_constant_val(
1744 __isl_keep struct isl_upoly *up)
1745 {
1746 struct isl_upoly_cst *cst;
1747
1748 if (!up)
1749 return NULL;
1750
1751 while (!isl_upoly_is_cst(up)) {
1752 struct isl_upoly_rec *rec;
1753
1754 rec = isl_upoly_as_rec(up);
1755 if (!rec)
1756 return NULL;
1757 up = rec->p[0];
1758 }
1759
1760 cst = isl_upoly_as_cst(up);
1761 if (!cst)
1762 return NULL;
1763 return isl_val_rat_from_isl_int(cst->up.ctx, cst->n, cst->d);
1764 }
1765
1766 /* Return the constant term of "qp".
1767 */
1768 __isl_give isl_val *isl_qpolynomial_get_constant_val(
1769 __isl_keep isl_qpolynomial *qp)
1770 {
1771 if (!qp)
1772 return NULL;
1773
1774 return isl_upoly_get_constant_val(qp->upoly);
1775 }
1776
1777 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1778 {
1779 int is_cst;
1780 struct isl_upoly_rec *rec;
1781
1782 if (!up)
1783 return -1;
1784
1785 if (up->var < 0)
1786 return 1;
1787
1788 rec = isl_upoly_as_rec(up);
1789 if (!rec)
1790 return -1;
1791
1792 if (rec->n > 2)
1793 return 0;
1794
1795 isl_assert(up->ctx, rec->n > 1, return -1);
1796
1797 is_cst = isl_upoly_is_cst(rec->p[1]);
1798 if (is_cst < 0)
1799 return -1;
1800 if (!is_cst)
1801 return 0;
1802
1803 return isl_upoly_is_affine(rec->p[0]);
1804 }
1805
1806 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1807 {
1808 if (!qp)
1809 return -1;
1810
1811 if (qp->div->n_row > 0)
1812 return 0;
1813
1814 return isl_upoly_is_affine(qp->upoly);
1815 }
1816
1817 static void update_coeff(__isl_keep isl_vec *aff,
1818 __isl_keep struct isl_upoly_cst *cst, int pos)
1819 {
1820 isl_int gcd;
1821 isl_int f;
1822
1823 if (isl_int_is_zero(cst->n))
1824 return;
1825
1826 isl_int_init(gcd);
1827 isl_int_init(f);
1828 isl_int_gcd(gcd, cst->d, aff->el[0]);
1829 isl_int_divexact(f, cst->d, gcd);
1830 isl_int_divexact(gcd, aff->el[0], gcd);
1831 isl_seq_scale(aff->el, aff->el, f, aff->size);
1832 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1833 isl_int_clear(gcd);
1834 isl_int_clear(f);
1835 }
1836
1837 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1838 __isl_keep isl_vec *aff)
1839 {
1840 struct isl_upoly_cst *cst;
1841 struct isl_upoly_rec *rec;
1842
1843 if (!up || !aff)
1844 return -1;
1845
1846 if (up->var < 0) {
1847 struct isl_upoly_cst *cst;
1848
1849 cst = isl_upoly_as_cst(up);
1850 if (!cst)
1851 return -1;
1852 update_coeff(aff, cst, 0);
1853 return 0;
1854 }
1855
1856 rec = isl_upoly_as_rec(up);
1857 if (!rec)
1858 return -1;
1859 isl_assert(up->ctx, rec->n == 2, return -1);
1860
1861 cst = isl_upoly_as_cst(rec->p[1]);
1862 if (!cst)
1863 return -1;
1864 update_coeff(aff, cst, 1 + up->var);
1865
1866 return isl_upoly_update_affine(rec->p[0], aff);
1867 }
1868
1869 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1870 __isl_keep isl_qpolynomial *qp)
1871 {
1872 isl_vec *aff;
1873 unsigned d;
1874
1875 if (!qp)
1876 return NULL;
1877
1878 d = isl_space_dim(qp->dim, isl_dim_all);
1879 aff = isl_vec_alloc(qp->div->ctx, 2 + d + qp->div->n_row);
1880 if (!aff)
1881 return NULL;
1882
1883 isl_seq_clr(aff->el + 1, 1 + d + qp->div->n_row);
1884 isl_int_set_si(aff->el[0], 1);
1885
1886 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1887 goto error;
1888
1889 return aff;
1890 error:
1891 isl_vec_free(aff);
1892 return NULL;
1893 }
1894
1895 /* Is "qp1" obviously equal to "qp2"?
1896 *
1897 * NaN is not equal to anything, not even to another NaN.
1898 */
1899 isl_bool isl_qpolynomial_plain_is_equal(__isl_keep isl_qpolynomial *qp1,
1900 __isl_keep isl_qpolynomial *qp2)
1901 {
1902 isl_bool equal;
1903
1904 if (!qp1 || !qp2)
1905 return isl_bool_error;
1906
1907 if (isl_qpolynomial_is_nan(qp1) || isl_qpolynomial_is_nan(qp2))
1908 return isl_bool_false;
1909
1910 equal = isl_space_is_equal(qp1->dim, qp2->dim);
1911 if (equal < 0 || !equal)
1912 return equal;
1913
1914 equal = isl_mat_is_equal(qp1->div, qp2->div);
1915 if (equal < 0 || !equal)
1916 return equal;
1917
1918 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1919 }
1920
1921 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1922 {
1923 int i;
1924 struct isl_upoly_rec *rec;
1925
1926 if (isl_upoly_is_cst(up)) {
1927 struct isl_upoly_cst *cst;
1928 cst = isl_upoly_as_cst(up);
1929 if (!cst)
1930 return;
1931 isl_int_lcm(*d, *d, cst->d);
1932 return;
1933 }
1934
1935 rec = isl_upoly_as_rec(up);
1936 if (!rec)
1937 return;
1938
1939 for (i = 0; i < rec->n; ++i)
1940 upoly_update_den(rec->p[i], d);
1941 }
1942
1943 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1944 {
1945 isl_int_set_si(*d, 1);
1946 if (!qp)
1947 return;
1948 upoly_update_den(qp->upoly, d);
1949 }
1950
1951 __isl_give isl_qpolynomial *isl_qpolynomial_var_pow_on_domain(
1952 __isl_take isl_space *dim, int pos, int power)
1953 {
1954 struct isl_ctx *ctx;
1955
1956 if (!dim)
1957 return NULL;
1958
1959 ctx = dim->ctx;
1960
1961 return isl_qpolynomial_alloc(dim, 0, isl_upoly_var_pow(ctx, pos, power));
1962 }
1963
1964 __isl_give isl_qpolynomial *isl_qpolynomial_var_on_domain(__isl_take isl_space *dim,
1965 enum isl_dim_type type, unsigned pos)
1966 {
1967 if (!dim)
1968 return NULL;
1969
1970 isl_assert(dim->ctx, isl_space_dim(dim, isl_dim_in) == 0, goto error);
1971 isl_assert(dim->ctx, pos < isl_space_dim(dim, type), goto error);
1972
1973 if (type == isl_dim_set)
1974 pos += isl_space_dim(dim, isl_dim_param);
1975
1976 return isl_qpolynomial_var_pow_on_domain(dim, pos, 1);
1977 error:
1978 isl_space_free(dim);
1979 return NULL;
1980 }
1981
1982 __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up,
1983 unsigned first, unsigned n, __isl_keep struct isl_upoly **subs)
1984 {
1985 int i;
1986 struct isl_upoly_rec *rec;
1987 struct isl_upoly *base, *res;
1988
1989 if (!up)
1990 return NULL;
1991
1992 if (isl_upoly_is_cst(up))
1993 return up;
1994
1995 if (up->var < first)
1996 return up;
1997
1998 rec = isl_upoly_as_rec(up);
1999 if (!rec)
2000 goto error;
2001
2002 isl_assert(up->ctx, rec->n >= 1, goto error);
2003
2004 if (up->var >= first + n)
2005 base = isl_upoly_var_pow(up->ctx, up->var, 1);
2006 else
2007 base = isl_upoly_copy(subs[up->var - first]);
2008
2009 res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs);
2010 for (i = rec->n - 2; i >= 0; --i) {
2011 struct isl_upoly *t;
2012 t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs);
2013 res = isl_upoly_mul(res, isl_upoly_copy(base));
2014 res = isl_upoly_sum(res, t);
2015 }
2016
2017 isl_upoly_free(base);
2018 isl_upoly_free(up);
2019
2020 return res;
2021 error:
2022 isl_upoly_free(up);
2023 return NULL;
2024 }
2025
2026 __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f,
2027 isl_int denom, unsigned len)
2028 {
2029 int i;
2030 struct isl_upoly *up;
2031
2032 isl_assert(ctx, len >= 1, return NULL);
2033
2034 up = isl_upoly_rat_cst(ctx, f[0], denom);
2035 for (i = 0; i < len - 1; ++i) {
2036 struct isl_upoly *t;
2037 struct isl_upoly *c;
2038
2039 if (isl_int_is_zero(f[1 + i]))
2040 continue;
2041
2042 c = isl_upoly_rat_cst(ctx, f[1 + i], denom);
2043 t = isl_upoly_var_pow(ctx, i, 1);
2044 t = isl_upoly_mul(c, t);
2045 up = isl_upoly_sum(up, t);
2046 }
2047
2048 return up;
2049 }
2050
2051 /* Remove common factor of non-constant terms and denominator.
2052 */
2053 static void normalize_div(__isl_keep isl_qpolynomial *qp, int div)
2054 {
2055 isl_ctx *ctx = qp->div->ctx;
2056 unsigned total = qp->div->n_col - 2;
2057
2058 isl_seq_gcd(qp->div->row[div] + 2, total, &ctx->normalize_gcd);
2059 isl_int_gcd(ctx->normalize_gcd,
2060 ctx->normalize_gcd, qp->div->row[div][0]);
2061 if (isl_int_is_one(ctx->normalize_gcd))
2062 return;
2063
2064 isl_seq_scale_down(qp->div->row[div] + 2, qp->div->row[div] + 2,
2065 ctx->normalize_gcd, total);
2066 isl_int_divexact(qp->div->row[div][0], qp->div->row[div][0],
2067 ctx->normalize_gcd);
2068 isl_int_fdiv_q(qp->div->row[div][1], qp->div->row[div][1],
2069 ctx->normalize_gcd);
2070 }
2071
2072 /* Replace the integer division identified by "div" by the polynomial "s".
2073 * The integer division is assumed not to appear in the definition
2074 * of any other integer divisions.
2075 */
2076 static __isl_give isl_qpolynomial *substitute_div(
2077 __isl_take isl_qpolynomial *qp,
2078 int div, __isl_take struct isl_upoly *s)
2079 {
2080 int i;
2081 int total;
2082 int *reordering;
2083
2084 if (!qp || !s)
2085 goto error;
2086
2087 qp = isl_qpolynomial_cow(qp);
2088 if (!qp)
2089 goto error;
2090
2091 total = isl_space_dim(qp->dim, isl_dim_all);
2092 qp->upoly = isl_upoly_subs(qp->upoly, total + div, 1, &s);
2093 if (!qp->upoly)
2094 goto error;
2095
2096 reordering = isl_alloc_array(qp->dim->ctx, int, total + qp->div->n_row);
2097 if (!reordering)
2098 goto error;
2099 for (i = 0; i < total + div; ++i)
2100 reordering[i] = i;
2101 for (i = total + div + 1; i < total + qp->div->n_row; ++i)
2102 reordering[i] = i - 1;
2103 qp->div = isl_mat_drop_rows(qp->div, div, 1);
2104 qp->div = isl_mat_drop_cols(qp->div, 2 + total + div, 1);
2105 qp->upoly = reorder(qp->upoly, reordering);
2106 free(reordering);
2107
2108 if (!qp->upoly || !qp->div)
2109 goto error;
2110
2111 isl_upoly_free(s);
2112 return qp;
2113 error:
2114 isl_qpolynomial_free(qp);
2115 isl_upoly_free(s);
2116 return NULL;
2117 }
2118
2119 /* Replace all integer divisions [e/d] that turn out to not actually be integer
2120 * divisions because d is equal to 1 by their definition, i.e., e.
2121 */
2122 static __isl_give isl_qpolynomial *substitute_non_divs(
2123 __isl_take isl_qpolynomial *qp)
2124 {
2125 int i, j;
2126 int total;
2127 struct isl_upoly *s;
2128
2129 if (!qp)
2130 return NULL;
2131
2132 total = isl_space_dim(qp->dim, isl_dim_all);
2133 for (i = 0; qp && i < qp->div->n_row; ++i) {
2134 if (!isl_int_is_one(qp->div->row[i][0]))
2135 continue;
2136 for (j = i + 1; j < qp->div->n_row; ++j) {
2137 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
2138 continue;
2139 isl_seq_combine(qp->div->row[j] + 1,
2140 qp->div->ctx->one, qp->div->row[j] + 1,
2141 qp->div->row[j][2 + total + i],
2142 qp->div->row[i] + 1, 1 + total + i);
2143 isl_int_set_si(qp->div->row[j][2 + total + i], 0);
2144 normalize_div(qp, j);
2145 }
2146 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
2147 qp->div->row[i][0], qp->div->n_col - 1);
2148 qp = substitute_div(qp, i, s);
2149 --i;
2150 }
2151
2152 return qp;
2153 }
2154
2155 /* Reduce the coefficients of div "div" to lie in the interval [0, d-1],
2156 * with d the denominator. When replacing the coefficient e of x by
2157 * d * frac(e/d) = e - d * floor(e/d), we are subtracting d * floor(e/d) * x
2158 * inside the division, so we need to add floor(e/d) * x outside.
2159 * That is, we replace q by q' + floor(e/d) * x and we therefore need
2160 * to adjust the coefficient of x in each later div that depends on the
2161 * current div "div" and also in the affine expression "aff"
2162 * (if it too depends on "div").
2163 */
2164 static void reduce_div(__isl_keep isl_qpolynomial *qp, int div,
2165 __isl_keep isl_vec *aff)
2166 {
2167 int i, j;
2168 isl_int v;
2169 unsigned total = qp->div->n_col - qp->div->n_row - 2;
2170
2171 isl_int_init(v);
2172 for (i = 0; i < 1 + total + div; ++i) {
2173 if (isl_int_is_nonneg(qp->div->row[div][1 + i]) &&
2174 isl_int_lt(qp->div->row[div][1 + i], qp->div->row[div][0]))
2175 continue;
2176 isl_int_fdiv_q(v, qp->div->row[div][1 + i], qp->div->row[div][0]);
2177 isl_int_fdiv_r(qp->div->row[div][1 + i],
2178 qp->div->row[div][1 + i], qp->div->row[div][0]);
2179 if (!isl_int_is_zero(aff->el[1 + total + div]))
2180 isl_int_addmul(aff->el[i], v, aff->el[1 + total + div]);
2181 for (j = div + 1; j < qp->div->n_row; ++j) {
2182 if (isl_int_is_zero(qp->div->row[j][2 + total + div]))
2183 continue;
2184 isl_int_addmul(qp->div->row[j][1 + i],
2185 v, qp->div->row[j][2 + total + div]);
2186 }
2187 }
2188 isl_int_clear(v);
2189 }
2190
2191 /* Check if the last non-zero coefficient is bigger that half of the
2192 * denominator. If so, we will invert the div to further reduce the number
2193 * of distinct divs that may appear.
2194 * If the last non-zero coefficient is exactly half the denominator,
2195 * then we continue looking for earlier coefficients that are bigger
2196 * than half the denominator.
2197 */
2198 static int needs_invert(__isl_keep isl_mat *div, int row)
2199 {
2200 int i;
2201 int cmp;
2202
2203 for (i = div->n_col - 1; i >= 1; --i) {
2204 if (isl_int_is_zero(div->row[row][i]))
2205 continue;
2206 isl_int_mul_ui(div->row[row][i], div->row[row][i], 2);
2207 cmp = isl_int_cmp(div->row[row][i], div->row[row][0]);
2208 isl_int_divexact_ui(div->row[row][i], div->row[row][i], 2);
2209 if (cmp)
2210 return cmp > 0;
2211 if (i == 1)
2212 return 1;
2213 }
2214
2215 return 0;
2216 }
2217
2218 /* Replace div "div" q = [e/d] by -[(-e+(d-1))/d].
2219 * We only invert the coefficients of e (and the coefficient of q in
2220 * later divs and in "aff"). After calling this function, the
2221 * coefficients of e should be reduced again.
2222 */
2223 static void invert_div(__isl_keep isl_qpolynomial *qp, int div,
2224 __isl_keep isl_vec *aff)
2225 {
2226 unsigned total = qp->div->n_col - qp->div->n_row - 2;
2227
2228 isl_seq_neg(qp->div->row[div] + 1,
2229 qp->div->row[div] + 1, qp->div->n_col - 1);
2230 isl_int_sub_ui(qp->div->row[div][1], qp->div->row[div][1], 1);
2231 isl_int_add(qp->div->row[div][1],
2232 qp->div->row[div][1], qp->div->row[div][0]);
2233 if (!isl_int_is_zero(aff->el[1 + total + div]))
2234 isl_int_neg(aff->el[1 + total + div], aff->el[1 + total + div]);
2235 isl_mat_col_mul(qp->div, 2 + total + div,
2236 qp->div->ctx->negone, 2 + total + div);
2237 }
2238
2239 /* Assuming "qp" is a monomial, reduce all its divs to have coefficients
2240 * in the interval [0, d-1], with d the denominator and such that the
2241 * last non-zero coefficient that is not equal to d/2 is smaller than d/2.
2242 *
2243 * After the reduction, some divs may have become redundant or identical,
2244 * so we call substitute_non_divs and sort_divs. If these functions
2245 * eliminate divs or merge two or more divs into one, the coefficients
2246 * of the enclosing divs may have to be reduced again, so we call
2247 * ourselves recursively if the number of divs decreases.
2248 */
2249 static __isl_give isl_qpolynomial *reduce_divs(__isl_take isl_qpolynomial *qp)
2250 {
2251 int i;
2252 isl_vec *aff = NULL;
2253 struct isl_upoly *s;
2254 unsigned n_div;
2255
2256 if (!qp)
2257 return NULL;
2258
2259 aff = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);
2260 aff = isl_vec_clr(aff);
2261 if (!aff)
2262 goto error;
2263
2264 isl_int_set_si(aff->el[1 + qp->upoly->var], 1);
2265
2266 for (i = 0; i < qp->div->n_row; ++i) {
2267 normalize_div(qp, i);
2268 reduce_div(qp, i, aff);
2269 if (needs_invert(qp->div, i)) {
2270 invert_div(qp, i, aff);
2271 reduce_div(qp, i, aff);
2272 }
2273 }
2274
2275 s = isl_upoly_from_affine(qp->div->ctx, aff->el,
2276 qp->div->ctx->one, aff->size);
2277 qp->upoly = isl_upoly_subs(qp->upoly, qp->upoly->var, 1, &s);
2278 isl_upoly_free(s);
2279 if (!qp->upoly)
2280 goto error;
2281
2282 isl_vec_free(aff);
2283
2284 n_div = qp->div->n_row;
2285 qp = substitute_non_divs(qp);
2286 qp = sort_divs(qp);
2287 if (qp && qp->div->n_row < n_div)
2288 return reduce_divs(qp);
2289
2290 return qp;
2291 error:
2292 isl_qpolynomial_free(qp);
2293 isl_vec_free(aff);
2294 return NULL;
2295 }
2296
2297 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst_on_domain(
2298 __isl_take isl_space *dim, const isl_int n, const isl_int d)
2299 {
2300 struct isl_qpolynomial *qp;
2301 struct isl_upoly_cst *cst;
2302
2303 if (!dim)
2304 return NULL;
2305
2306 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
2307 if (!qp)
2308 return NULL;
2309
2310 cst = isl_upoly_as_cst(qp->upoly);
2311 isl_int_set(cst->n, n);
2312 isl_int_set(cst->d, d);
2313
2314 return qp;
2315 }
2316
2317 /* Return an isl_qpolynomial that is equal to "val" on domain space "domain".
2318 */
2319 __isl_give isl_qpolynomial *isl_qpolynomial_val_on_domain(
2320 __isl_take isl_space *domain, __isl_take isl_val *val)
2321 {
2322 isl_qpolynomial *qp;
2323 struct isl_upoly_cst *cst;
2324
2325 if (!domain || !val)
2326 goto error;
2327
2328 qp = isl_qpolynomial_alloc(isl_space_copy(domain), 0,
2329 isl_upoly_zero(domain->ctx));
2330 if (!qp)
2331 goto error;
2332
2333 cst = isl_upoly_as_cst(qp->upoly);
2334 isl_int_set(cst->n, val->n);
2335 isl_int_set(cst->d, val->d);
2336
2337 isl_space_free(domain);
2338 isl_val_free(val);
2339 return qp;
2340 error:
2341 isl_space_free(domain);
2342 isl_val_free(val);
2343 return NULL;
2344 }
2345
2346 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
2347 {
2348 struct isl_upoly_rec *rec;
2349 int i;
2350
2351 if (!up)
2352 return -1;
2353
2354 if (isl_upoly_is_cst(up))
2355 return 0;
2356
2357 if (up->var < d)
2358 active[up->var] = 1;
2359
2360 rec = isl_upoly_as_rec(up);
2361 for (i = 0; i < rec->n; ++i)
2362 if (up_set_active(rec->p[i], active, d) < 0)
2363 return -1;
2364
2365 return 0;
2366 }
2367
2368 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
2369 {
2370 int i, j;
2371 int d = isl_space_dim(qp->dim, isl_dim_all);
2372
2373 if (!qp || !active)
2374 return -1;
2375
2376 for (i = 0; i < d; ++i)
2377 for (j = 0; j < qp->div->n_row; ++j) {
2378 if (isl_int_is_zero(qp->div->row[j][2 + i]))
2379 continue;
2380 active[i] = 1;
2381 break;
2382 }
2383
2384 return up_set_active(qp->upoly, active, d);
2385 }
2386
2387 isl_bool isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
2388 enum isl_dim_type type, unsigned first, unsigned n)
2389 {
2390 int i;
2391 int *active = NULL;
2392 isl_bool involves = isl_bool_false;
2393
2394 if (!qp)
2395 return isl_bool_error;
2396 if (n == 0)
2397 return isl_bool_false;
2398
2399 isl_assert(qp->dim->ctx,
2400 first + n <= isl_qpolynomial_dim(qp, type),
2401 return isl_bool_error);
2402 isl_assert(qp->dim->ctx, type == isl_dim_param ||
2403 type == isl_dim_in, return isl_bool_error);
2404
2405 active = isl_calloc_array(qp->dim->ctx, int,
2406 isl_space_dim(qp->dim, isl_dim_all));
2407 if (set_active(qp, active) < 0)
2408 goto error;
2409
2410 if (type == isl_dim_in)
2411 first += isl_space_dim(qp->dim, isl_dim_param);
2412 for (i = 0; i < n; ++i)
2413 if (active[first + i]) {
2414 involves = isl_bool_true;
2415 break;
2416 }
2417
2418 free(active);
2419
2420 return involves;
2421 error:
2422 free(active);
2423 return isl_bool_error;
2424 }
2425
2426 /* Remove divs that do not appear in the quasi-polynomial, nor in any
2427 * of the divs that do appear in the quasi-polynomial.
2428 */
2429 static __isl_give isl_qpolynomial *remove_redundant_divs(
2430 __isl_take isl_qpolynomial *qp)
2431 {
2432 int i, j;
2433 int d;
2434 int len;
2435 int skip;
2436 int *active = NULL;
2437 int *reordering = NULL;
2438 int redundant = 0;
2439 int n_div;
2440 isl_ctx *ctx;
2441
2442 if (!qp)
2443 return NULL;
2444 if (qp->div->n_row == 0)
2445 return qp;
2446
2447 d = isl_space_dim(qp->dim, isl_dim_all);
2448 len = qp->div->n_col - 2;
2449 ctx = isl_qpolynomial_get_ctx(qp);
2450 active = isl_calloc_array(ctx, int, len);
2451 if (!active)
2452 goto error;
2453
2454 if (up_set_active(qp->upoly, active, len) < 0)
2455 goto error;
2456
2457 for (i = qp->div->n_row - 1; i >= 0; --i) {
2458 if (!active[d + i]) {
2459 redundant = 1;
2460 continue;
2461 }
2462 for (j = 0; j < i; ++j) {
2463 if (isl_int_is_zero(qp->div->row[i][2 + d + j]))
2464 continue;
2465 active[d + j] = 1;
2466 break;
2467 }
2468 }
2469
2470 if (!redundant) {
2471 free(active);
2472 return qp;
2473 }
2474
2475 reordering = isl_alloc_array(qp->div->ctx, int, len);
2476 if (!reordering)
2477 goto error;
2478
2479 for (i = 0; i < d; ++i)
2480 reordering[i] = i;
2481
2482 skip = 0;
2483 n_div = qp->div->n_row;
2484 for (i = 0; i < n_div; ++i) {
2485 if (!active[d + i]) {
2486 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
2487 qp->div = isl_mat_drop_cols(qp->div,
2488 2 + d + i - skip, 1);
2489 skip++;
2490 }
2491 reordering[d + i] = d + i - skip;
2492 }
2493
2494 qp->upoly = reorder(qp->upoly, reordering);
2495
2496 if (!qp->upoly || !qp->div)
2497 goto error;
2498
2499 free(active);
2500 free(reordering);
2501
2502 return qp;
2503 error:
2504 free(active);
2505 free(reordering);
2506 isl_qpolynomial_free(qp);
2507 return NULL;
2508 }
2509
2510 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
2511 unsigned first, unsigned n)
2512 {
2513 int i;
2514 struct isl_upoly_rec *rec;
2515
2516 if (!up)
2517 return NULL;
2518 if (n == 0 || up->var < 0 || up->var < first)
2519 return up;
2520 if (up->var < first + n) {
2521 up = replace_by_constant_term(up);
2522 return isl_upoly_drop(up, first, n);
2523 }
2524 up = isl_upoly_cow(up);
2525 if (!up)
2526 return NULL;
2527 up->var -= n;
2528 rec = isl_upoly_as_rec(up);
2529 if (!rec)
2530 goto error;
2531
2532 for (i = 0; i < rec->n; ++i) {
2533 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
2534 if (!rec->p[i])
2535 goto error;
2536 }
2537
2538 return up;
2539 error:
2540 isl_upoly_free(up);
2541 return NULL;
2542 }
2543
2544 __isl_give isl_qpolynomial *isl_qpolynomial_set_dim_name(
2545 __isl_take isl_qpolynomial *qp,
2546 enum isl_dim_type type, unsigned pos, const char *s)
2547 {
2548 qp = isl_qpolynomial_cow(qp);
2549 if (!qp)
2550 return NULL;
2551 qp->dim = isl_space_set_dim_name(qp->dim, type, pos, s);
2552 if (!qp->dim)
2553 goto error;
2554 return qp;
2555 error:
2556 isl_qpolynomial_free(qp);
2557 return NULL;
2558 }
2559
2560 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
2561 __isl_take isl_qpolynomial *qp,
2562 enum isl_dim_type type, unsigned first, unsigned n)
2563 {
2564 if (!qp)
2565 return NULL;
2566 if (type == isl_dim_out)
2567 isl_die(qp->dim->ctx, isl_error_invalid,
2568 "cannot drop output/set dimension",
2569 goto error);
2570 if (type == isl_dim_in)
2571 type = isl_dim_set;
2572 if (n == 0 && !isl_space_is_named_or_nested(qp->dim, type))
2573 return qp;
2574
2575 qp = isl_qpolynomial_cow(qp);
2576 if (!qp)
2577 return NULL;
2578
2579 isl_assert(qp->dim->ctx, first + n <= isl_space_dim(qp->dim, type),
2580 goto error);
2581 isl_assert(qp->dim->ctx, type == isl_dim_param ||
2582 type == isl_dim_set, goto error);
2583
2584 qp->dim = isl_space_drop_dims(qp->dim, type, first, n);
2585 if (!qp->dim)
2586 goto error;
2587
2588 if (type == isl_dim_set)
2589 first += isl_space_dim(qp->dim, isl_dim_param);
2590
2591 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
2592 if (!qp->div)
2593 goto error;
2594
2595 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
2596 if (!qp->upoly)
2597 goto error;
2598
2599 return qp;
2600 error:
2601 isl_qpolynomial_free(qp);
2602 return NULL;
2603 }
2604
2605 /* Project the domain of the quasi-polynomial onto its parameter space.
2606 * The quasi-polynomial may not involve any of the domain dimensions.
2607 */
2608 __isl_give isl_qpolynomial *isl_qpolynomial_project_domain_on_params(
2609 __isl_take isl_qpolynomial *qp)
2610 {
2611 isl_space *space;
2612 unsigned n;
2613 int involves;
2614
2615 n = isl_qpolynomial_dim(qp, isl_dim_in);
2616 involves = isl_qpolynomial_involves_dims(qp, isl_dim_in, 0, n);
2617 if (involves < 0)
2618 return isl_qpolynomial_free(qp);
2619 if (involves)
2620 isl_die(isl_qpolynomial_get_ctx(qp), isl_error_invalid,
2621 "polynomial involves some of the domain dimensions",
2622 return isl_qpolynomial_free(qp));
2623 qp = isl_qpolynomial_drop_dims(qp, isl_dim_in, 0, n);
2624 space = isl_qpolynomial_get_domain_space(qp);
2625 space = isl_space_params(space);
2626 qp = isl_qpolynomial_reset_domain_space(qp, space);
2627 return qp;
2628 }
2629
2630 static __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities_lifted(
2631 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
2632 {
2633 int i, j, k;
2634 isl_int denom;
2635 unsigned total;
2636 unsigned n_div;
2637 struct isl_upoly *up;
2638
2639 if (!eq)
2640 goto error;
2641 if (eq->n_eq == 0) {
2642 isl_basic_set_free(eq);
2643 return qp;
2644 }
2645
2646 qp = isl_qpolynomial_cow(qp);
2647 if (!qp)
2648 goto error;
2649 qp->div = isl_mat_cow(qp->div);
2650 if (!qp->div)
2651 goto error;
2652
2653 total = 1 + isl_space_dim(eq->dim, isl_dim_all);
2654 n_div = eq->n_div;
2655 isl_int_init(denom);
2656 for (i = 0; i < eq->n_eq; ++i) {
2657 j = isl_seq_last_non_zero(eq->eq[i], total + n_div);
2658 if (j < 0 || j == 0 || j >= total)
2659 continue;
2660
2661 for (k = 0; k < qp->div->n_row; ++k) {
2662 if (isl_int_is_zero(qp->div->row[k][1 + j]))
2663 continue;
2664 isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total,
2665 &qp->div->row[k][0]);
2666 normalize_div(qp, k);
2667 }
2668
2669 if (isl_int_is_pos(eq->eq[i][j]))
2670 isl_seq_neg(eq->eq[i], eq->eq[i], total);
2671 isl_int_abs(denom, eq->eq[i][j]);
2672 isl_int_set_si(eq->eq[i][j], 0);
2673
2674 up = isl_upoly_from_affine(qp->dim->ctx,
2675 eq->eq[i], denom, total);
2676 qp->upoly = isl_upoly_subs(qp->upoly, j - 1, 1, &up);
2677 isl_upoly_free(up);
2678 }
2679 isl_int_clear(denom);
2680
2681 if (!qp->upoly)
2682 goto error;
2683
2684 isl_basic_set_free(eq);
2685
2686 qp = substitute_non_divs(qp);
2687 qp = sort_divs(qp);
2688
2689 return qp;
2690 error:
2691 isl_basic_set_free(eq);
2692 isl_qpolynomial_free(qp);
2693 return NULL;
2694 }
2695
2696 /* Exploit the equalities in "eq" to simplify the quasi-polynomial.
2697 */
2698 __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities(
2699 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
2700 {
2701 if (!qp || !eq)
2702 goto error;
2703 if (qp->div->n_row > 0)
2704 eq = isl_basic_set_add_dims(eq, isl_dim_set, qp->div->n_row);
2705 return isl_qpolynomial_substitute_equalities_lifted(qp, eq);
2706 error:
2707 isl_basic_set_free(eq);
2708 isl_qpolynomial_free(qp);
2709 return NULL;
2710 }
2711
2712 static __isl_give isl_basic_set *add_div_constraints(
2713 __isl_take isl_basic_set *bset, __isl_take isl_mat *div)
2714 {
2715 int i;
2716 unsigned total;
2717
2718 if (!bset || !div)
2719 goto error;
2720
2721 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2722 if (!bset)
2723 goto error;
2724 total = isl_basic_set_total_dim(bset);
2725 for (i = 0; i < div->n_row; ++i)
2726 if (isl_basic_set_add_div_constraints_var(bset,
2727 total - div->n_row + i, div->row[i]) < 0)
2728 goto error;
2729
2730 isl_mat_free(div);
2731 return bset;
2732 error:
2733 isl_mat_free(div);
2734 isl_basic_set_free(bset);
2735 return NULL;
2736 }
2737
2738 /* Look for equalities among the variables shared by context and qp
2739 * and the integer divisions of qp, if any.
2740 * The equalities are then used to eliminate variables and/or integer
2741 * divisions from qp.
2742 */
2743 __isl_give isl_qpolynomial *isl_qpolynomial_gist(
2744 __isl_take isl_qpolynomial *qp, __isl_take isl_set *context)
2745 {
2746 isl_basic_set *aff;
2747
2748 if (!qp)
2749 goto error;
2750 if (qp->div->n_row > 0) {
2751 isl_basic_set *bset;
2752 context = isl_set_add_dims(context, isl_dim_set,
2753 qp->div->n_row);
2754 bset = isl_basic_set_universe(isl_set_get_space(context));
2755 bset = add_div_constraints(bset, isl_mat_copy(qp->div));
2756 context = isl_set_intersect(context,
2757 isl_set_from_basic_set(bset));
2758 }
2759
2760 aff = isl_set_affine_hull(context);
2761 return isl_qpolynomial_substitute_equalities_lifted(qp, aff);
2762 error:
2763 isl_qpolynomial_free(qp);
2764 isl_set_free(context);
2765 return NULL;
2766 }
2767
2768 __isl_give isl_qpolynomial *isl_qpolynomial_gist_params(
2769 __isl_take isl_qpolynomial *qp, __isl_take isl_set *context)
2770 {
2771 isl_space *space = isl_qpolynomial_get_domain_space(qp);
2772 isl_set *dom_context = isl_set_universe(space);
2773 dom_context = isl_set_intersect_params(dom_context, context);
2774 return isl_qpolynomial_gist(qp, dom_context);
2775 }
2776
2777 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_from_qpolynomial(
2778 __isl_take isl_qpolynomial *qp)
2779 {
2780 isl_set *dom;
2781
2782 if (!qp)
2783 return NULL;
2784 if (isl_qpolynomial_is_zero(qp)) {
2785 isl_space *dim = isl_qpolynomial_get_space(qp);
2786 isl_qpolynomial_free(qp);
2787 return isl_pw_qpolynomial_zero(dim);
2788 }
2789
2790 dom = isl_set_universe(isl_qpolynomial_get_domain_space(qp));
2791 return isl_pw_qpolynomial_alloc(dom, qp);
2792 }
2793
2794 #undef PW
2795 #define PW isl_pw_qpolynomial
2796 #undef EL
2797 #define EL isl_qpolynomial
2798 #undef EL_IS_ZERO
2799 #define EL_IS_ZERO is_zero
2800 #undef ZERO
2801 #define ZERO zero
2802 #undef IS_ZERO
2803 #define IS_ZERO is_zero
2804 #undef FIELD
2805 #define FIELD qp
2806 #undef DEFAULT_IS_ZERO
2807 #define DEFAULT_IS_ZERO 1
2808
2809 #define NO_PULLBACK
2810
2811 #include <isl_pw_templ.c>
2812
2813 #undef UNION
2814 #define UNION isl_union_pw_qpolynomial
2815 #undef PART
2816 #define PART isl_pw_qpolynomial
2817 #undef PARTS
2818 #define PARTS pw_qpolynomial
2819
2820 #include <isl_union_templ.c>
2821
2822 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
2823 {
2824 if (!pwqp)
2825 return -1;
2826
2827 if (pwqp->n != -1)
2828 return 0;
2829
2830 if (!isl_set_plain_is_universe(pwqp->p[0].set))
2831 return 0;
2832
2833 return isl_qpolynomial_is_one(pwqp->p[0].qp);
2834 }
2835
2836 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add(
2837 __isl_take isl_pw_qpolynomial *pwqp1,
2838 __isl_take isl_pw_qpolynomial *pwqp2)
2839 {
2840 return isl_pw_qpolynomial_union_add_(pwqp1, pwqp2);
2841 }
2842
2843 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
2844 __isl_take isl_pw_qpolynomial *pwqp1,
2845 __isl_take isl_pw_qpolynomial *pwqp2)
2846 {
2847 int i, j, n;
2848 struct isl_pw_qpolynomial *res;
2849
2850 if (!pwqp1 || !pwqp2)
2851 goto error;
2852
2853 isl_assert(pwqp1->dim->ctx, isl_space_is_equal(pwqp1->dim, pwqp2->dim),
2854 goto error);
2855
2856 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
2857 isl_pw_qpolynomial_free(pwqp2);
2858 return pwqp1;
2859 }
2860
2861 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
2862 isl_pw_qpolynomial_free(pwqp1);
2863 return pwqp2;
2864 }
2865
2866 if (isl_pw_qpolynomial_is_one(pwqp1)) {
2867 isl_pw_qpolynomial_free(pwqp1);
2868 return pwqp2;
2869 }
2870
2871 if (isl_pw_qpolynomial_is_one(pwqp2)) {
2872 isl_pw_qpolynomial_free(pwqp2);
2873 return pwqp1;
2874 }
2875
2876 n = pwqp1->n * pwqp2->n;
2877 res = isl_pw_qpolynomial_alloc_size(isl_space_copy(pwqp1->dim), n);
2878
2879 for (i = 0; i < pwqp1->n; ++i) {
2880 for (j = 0; j < pwqp2->n; ++j) {
2881 struct isl_set *common;
2882 struct isl_qpolynomial *prod;
2883 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
2884 isl_set_copy(pwqp2->p[j].set));
2885 if (isl_set_plain_is_empty(common)) {
2886 isl_set_free(common);
2887 continue;
2888 }
2889
2890 prod = isl_qpolynomial_mul(
2891 isl_qpolynomial_copy(pwqp1->p[i].qp),
2892 isl_qpolynomial_copy(pwqp2->p[j].qp));
2893
2894 res = isl_pw_qpolynomial_add_piece(res, common, prod);
2895 }
2896 }
2897
2898 isl_pw_qpolynomial_free(pwqp1);
2899 isl_pw_qpolynomial_free(pwqp2);
2900
2901 return res;
2902 error:
2903 isl_pw_qpolynomial_free(pwqp1);
2904 isl_pw_qpolynomial_free(pwqp2);
2905 return NULL;
2906 }
2907
2908 __isl_give isl_val *isl_upoly_eval(__isl_take struct isl_upoly *up,
2909 __isl_take isl_vec *vec)
2910 {
2911 int i;
2912 struct isl_upoly_rec *rec;
2913 isl_val *res;
2914 isl_val *base;
2915
2916 if (isl_upoly_is_cst(up)) {
2917 isl_vec_free(vec);
2918 res = isl_upoly_get_constant_val(up);
2919 isl_upoly_free(up);
2920 return res;
2921 }
2922
2923 rec = isl_upoly_as_rec(up);
2924 if (!rec)
2925 goto error;
2926
2927 isl_assert(up->ctx, rec->n >= 1, goto error);
2928
2929 base = isl_val_rat_from_isl_int(up->ctx,
2930 vec->el[1 + up->var], vec->el[0]);
2931
2932 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
2933 isl_vec_copy(vec));
2934
2935 for (i = rec->n - 2; i >= 0; --i) {
2936 res = isl_val_mul(res, isl_val_copy(base));
2937 res = isl_val_add(res,
2938 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
2939 isl_vec_copy(vec)));
2940 }
2941
2942 isl_val_free(base);
2943 isl_upoly_free(up);
2944 isl_vec_free(vec);
2945 return res;
2946 error:
2947 isl_upoly_free(up);
2948 isl_vec_free(vec);
2949 return NULL;
2950 }
2951
2952 __isl_give isl_val *isl_qpolynomial_eval(__isl_take isl_qpolynomial *qp,
2953 __isl_take isl_point *pnt)
2954 {
2955 isl_vec *ext;
2956 isl_val *v;
2957
2958 if (!qp || !pnt)
2959 goto error;
2960 isl_assert(pnt->dim->ctx, isl_space_is_equal(pnt->dim, qp->dim), goto error);
2961
2962 if (qp->div->n_row == 0)
2963 ext = isl_vec_copy(pnt->vec);
2964 else {
2965 int i;
2966 unsigned dim = isl_space_dim(qp->dim, isl_dim_all);
2967 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
2968 if (!ext)
2969 goto error;
2970
2971 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
2972 for (i = 0; i < qp->div->n_row; ++i) {
2973 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
2974 1 + dim + i, &ext->el[1+dim+i]);
2975 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
2976 qp->div->row[i][0]);
2977 }
2978 }
2979
2980 v = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
2981
2982 isl_qpolynomial_free(qp);
2983 isl_point_free(pnt);
2984
2985 return v;
2986 error:
2987 isl_qpolynomial_free(qp);
2988 isl_point_free(pnt);
2989 return NULL;
2990 }
2991
2992 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
2993 __isl_keep struct isl_upoly_cst *cst2)
2994 {
2995 int cmp;
2996 isl_int t;
2997 isl_int_init(t);
2998 isl_int_mul(t, cst1->n, cst2->d);
2999 isl_int_submul(t, cst2->n, cst1->d);
3000 cmp = isl_int_sgn(t);
3001 isl_int_clear(t);
3002 return cmp;
3003 }
3004
3005 __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
3006 __isl_take isl_qpolynomial *qp, enum isl_dim_type type,
3007 unsigned first, unsigned n)
3008 {
3009 unsigned total;
3010 unsigned g_pos;
3011 int *exp;
3012
3013 if (!qp)
3014 return NULL;
3015 if (type == isl_dim_out)
3016 isl_die(qp->div->ctx, isl_error_invalid,
3017 "cannot insert output/set dimensions",
3018 goto error);
3019 if (type == isl_dim_in)
3020 type = isl_dim_set;
3021 if (n == 0 && !isl_space_is_named_or_nested(qp->dim, type))
3022 return qp;
3023
3024 qp = isl_qpolynomial_cow(qp);
3025 if (!qp)
3026 return NULL;
3027
3028 isl_assert(qp->div->ctx, first <= isl_space_dim(qp->dim, type),
3029 goto error);
3030
3031 g_pos = pos(qp->dim, type) + first;
3032
3033 qp->div = isl_mat_insert_zero_cols(qp->div, 2 + g_pos, n);
3034 if (!qp->div)
3035 goto error;
3036
3037 total = qp->div->n_col - 2;
3038 if (total > g_pos) {
3039 int i;
3040 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
3041 if (!exp)
3042 goto error;
3043 for (i = 0; i < total - g_pos; ++i)
3044 exp[i] = i + n;
3045 qp->upoly = expand(qp->upoly, exp, g_pos);
3046 free(exp);
3047 if (!qp->upoly)
3048 goto error;
3049 }
3050
3051 qp->dim = isl_space_insert_dims(qp->dim, type, first, n);
3052 if (!qp->dim)
3053 goto error;
3054
3055 return qp;
3056 error:
3057 isl_qpolynomial_free(qp);
3058 return NULL;
3059 }
3060
3061 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
3062 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
3063 {
3064 unsigned pos;
3065
3066 pos = isl_qpolynomial_dim(qp, type);
3067
3068 return isl_qpolynomial_insert_dims(qp, type, pos, n);
3069 }
3070
3071 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
3072 __isl_take isl_pw_qpolynomial *pwqp,
3073 enum isl_dim_type type, unsigned n)
3074 {
3075 unsigned pos;
3076
3077 pos = isl_pw_qpolynomial_dim(pwqp, type);
3078
3079 return isl_pw_qpolynomial_insert_dims(pwqp, type, pos, n);
3080 }
3081
3082 static int *reordering_move(isl_ctx *ctx,
3083 unsigned len, unsigned dst, unsigned src, unsigned n)
3084 {
3085 int i;
3086 int *reordering;
3087
3088 reordering = isl_alloc_array(ctx, int, len);
3089 if (!reordering)
3090 return NULL;
3091
3092 if (dst <= src) {
3093 for (i = 0; i < dst; ++i)
3094 reordering[i] = i;
3095 for (i = 0; i < n; ++i)
3096 reordering[src + i] = dst + i;
3097 for (i = 0; i < src - dst; ++i)
3098 reordering[dst + i] = dst + n + i;
3099 for (i = 0; i < len - src - n; ++i)
3100 reordering[src + n + i] = src + n + i;
3101 } else {
3102 for (i = 0; i < src; ++i)
3103 reordering[i] = i;
3104 for (i = 0; i < n; ++i)
3105 reordering[src + i] = dst + i;
3106 for (i = 0; i < dst - src; ++i)
3107 reordering[src + n + i] = src + i;
3108 for (i = 0; i < len - dst - n; ++i)
3109 reordering[dst + n + i] = dst + n + i;
3110 }
3111
3112 return reordering;
3113 }
3114
3115 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
3116 __isl_take isl_qpolynomial *qp,
3117 enum isl_dim_type dst_type, unsigned dst_pos,
3118 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3119 {
3120 unsigned g_dst_pos;
3121 unsigned g_src_pos;
3122 int *reordering;
3123
3124 if (n == 0)
3125 return qp;
3126
3127 qp = isl_qpolynomial_cow(qp);
3128 if (!qp)
3129 return NULL;
3130
3131 if (dst_type == isl_dim_out || src_type == isl_dim_out)
3132 isl_die(qp->dim->ctx, isl_error_invalid,
3133 "cannot move output/set dimension",
3134 goto error);
3135 if (dst_type == isl_dim_in)
3136 dst_type = isl_dim_set;
3137 if (src_type == isl_dim_in)
3138 src_type = isl_dim_set;
3139
3140 isl_assert(qp->dim->ctx, src_pos + n <= isl_space_dim(qp->dim, src_type),
3141 goto error);
3142
3143 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
3144 g_src_pos = pos(qp->dim, src_type) + src_pos;
3145 if (dst_type > src_type)
3146 g_dst_pos -= n;
3147
3148 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
3149 if (!qp->div)
3150 goto error;
3151 qp = sort_divs(qp);
3152 if (!qp)
3153 goto error;
3154
3155 reordering = reordering_move(qp->dim->ctx,
3156 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
3157 if (!reordering)
3158 goto error;
3159
3160 qp->upoly = reorder(qp->upoly, reordering);
3161 free(reordering);
3162 if (!qp->upoly)
3163 goto error;
3164
3165 qp->dim = isl_space_move_dims(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
3166 if (!qp->dim)
3167 goto error;
3168
3169 return qp;
3170 error:
3171 isl_qpolynomial_free(qp);
3172 return NULL;
3173 }
3174
3175 __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_space *dim,
3176 isl_int *f, isl_int denom)
3177 {
3178 struct isl_upoly *up;
3179
3180 dim = isl_space_domain(dim);
3181 if (!dim)
3182 return NULL;
3183
3184 up = isl_upoly_from_affine(dim->ctx, f, denom,
3185 1 + isl_space_dim(dim, isl_dim_all));
3186
3187 return isl_qpolynomial_alloc(dim, 0, up);
3188 }
3189
3190 __isl_give isl_qpolynomial *isl_qpolynomial_from_aff(__isl_take isl_aff *aff)
3191 {
3192 isl_ctx *ctx;
3193 struct isl_upoly *up;
3194 isl_qpolynomial *qp;
3195
3196 if (!aff)
3197 return NULL;
3198
3199 ctx = isl_aff_get_ctx(aff);
3200 up = isl_upoly_from_affine(ctx, aff->v->el + 1, aff->v->el[0],
3201 aff->v->size - 1);
3202
3203 qp = isl_qpolynomial_alloc(isl_aff_get_domain_space(aff),
3204 aff->ls->div->n_row, up);
3205 if (!qp)
3206 goto error;
3207
3208 isl_mat_free(qp->div);
3209 qp->div = isl_mat_copy(aff->ls->div);
3210 qp->div = isl_mat_cow(qp->div);
3211 if (!qp->div)
3212 goto error;
3213
3214 isl_aff_free(aff);
3215 qp = reduce_divs(qp);
3216 qp = remove_redundant_divs(qp);
3217 return qp;
3218 error:
3219 isl_aff_free(aff);
3220 return isl_qpolynomial_free(qp);
3221 }
3222
3223 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_from_pw_aff(
3224 __isl_take isl_pw_aff *pwaff)
3225 {
3226 int i;
3227 isl_pw_qpolynomial *pwqp;
3228
3229 if (!pwaff)
3230 return NULL;
3231
3232 pwqp = isl_pw_qpolynomial_alloc_size(isl_pw_aff_get_space(pwaff),
3233 pwaff->n);
3234
3235 for (i = 0; i < pwaff->n; ++i) {
3236 isl_set *dom;
3237 isl_qpolynomial *qp;
3238
3239 dom = isl_set_copy(pwaff->p[i].set);
3240 qp = isl_qpolynomial_from_aff(isl_aff_copy(pwaff->p[i].aff));
3241 pwqp = isl_pw_qpolynomial_add_piece(pwqp, dom, qp);
3242 }
3243
3244 isl_pw_aff_free(pwaff);
3245 return pwqp;
3246 }
3247
3248 __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
3249 __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
3250 {
3251 isl_aff *aff;
3252
3253 aff = isl_constraint_get_bound(c, type, pos);
3254 isl_constraint_free(c);
3255 return isl_qpolynomial_from_aff(aff);
3256 }
3257
3258 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
3259 * in "qp" by subs[i].
3260 */
3261 __isl_give isl_qpolynomial *isl_qpolynomial_substitute(
3262 __isl_take isl_qpolynomial *qp,
3263 enum isl_dim_type type, unsigned first, unsigned n,
3264 __isl_keep isl_qpolynomial **subs)
3265 {
3266 int i;
3267 struct isl_upoly **ups;
3268
3269 if (n == 0)
3270 return qp;
3271
3272 qp = isl_qpolynomial_cow(qp);
3273 if (!qp)
3274 return NULL;
3275
3276 if (type == isl_dim_out)
3277 isl_die(qp->dim->ctx, isl_error_invalid,
3278 "cannot substitute output/set dimension",
3279 goto error);
3280 if (type == isl_dim_in)
3281 type = isl_dim_set;
3282
3283 for (i = 0; i < n; ++i)
3284 if (!subs[i])
3285 goto error;
3286
3287 isl_assert(qp->dim->ctx, first + n <= isl_space_dim(qp->dim, type),
3288 goto error);
3289
3290 for (i = 0; i < n; ++i)
3291 isl_assert(qp->dim->ctx, isl_space_is_equal(qp->dim, subs[i]->dim),
3292 goto error);
3293
3294 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
3295 for (i = 0; i < n; ++i)
3296 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
3297
3298 first += pos(qp->dim, type);
3299
3300 ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n);
3301 if (!ups)
3302 goto error;
3303 for (i = 0; i < n; ++i)
3304 ups[i] = subs[i]->upoly;
3305
3306 qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups);
3307
3308 free(ups);
3309
3310 if (!qp->upoly)
3311 goto error;
3312
3313 return qp;
3314 error:
3315 isl_qpolynomial_free(qp);
3316 return NULL;
3317 }
3318
3319 /* Extend "bset" with extra set dimensions for each integer division
3320 * in "qp" and then call "fn" with the extended bset and the polynomial
3321 * that results from replacing each of the integer divisions by the
3322 * corresponding extra set dimension.
3323 */
3324 int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
3325 __isl_keep isl_basic_set *bset,
3326 int (*fn)(__isl_take isl_basic_set *bset,
3327 __isl_take isl_qpolynomial *poly, void *user), void *user)
3328 {
3329 isl_space *dim;
3330 isl_mat *div;
3331 isl_qpolynomial *poly;
3332
3333 if (!qp || !bset)
3334 goto error;
3335 if (qp->div->n_row == 0)
3336 return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
3337 user);
3338
3339 div = isl_mat_copy(qp->div);
3340 dim = isl_space_copy(qp->dim);
3341 dim = isl_space_add_dims(dim, isl_dim_set, qp->div->n_row);
3342 poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly));
3343 bset = isl_basic_set_copy(bset);
3344 bset = isl_basic_set_add_dims(bset, isl_dim_set, qp->div->n_row);
3345 bset = add_div_constraints(bset, div);
3346
3347 return fn(bset, poly, user);
3348 error:
3349 return -1;
3350 }
3351
3352 /* Return total degree in variables first (inclusive) up to last (exclusive).
3353 */
3354 int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last)
3355 {
3356 int deg = -1;
3357 int i;
3358 struct isl_upoly_rec *rec;
3359
3360 if (!up)
3361 return -2;
3362 if (isl_upoly_is_zero(up))
3363 return -1;
3364 if (isl_upoly_is_cst(up) || up->var < first)
3365 return 0;
3366
3367 rec = isl_upoly_as_rec(up);
3368 if (!rec)
3369 return -2;
3370
3371 for (i = 0; i < rec->n; ++i) {
3372 int d;
3373
3374 if (isl_upoly_is_zero(rec->p[i]))
3375 continue;
3376 d = isl_upoly_degree(rec->p[i], first, last);
3377 if (up->var < last)
3378 d += i;
3379 if (d > deg)
3380 deg = d;
3381 }
3382
3383 return deg;
3384 }
3385
3386 /* Return total degree in set variables.
3387 */
3388 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
3389 {
3390 unsigned ovar;
3391 unsigned nvar;
3392
3393 if (!poly)
3394 return -2;
3395
3396 ovar = isl_space_offset(poly->dim, isl_dim_set);
3397 nvar = isl_space_dim(poly->dim, isl_dim_set);
3398 return isl_upoly_degree(poly->upoly, ovar, ovar + nvar);
3399 }
3400
3401 __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up,
3402 unsigned pos, int deg)
3403 {
3404 int i;
3405 struct isl_upoly_rec *rec;
3406
3407 if (!up)
3408 return NULL;
3409
3410 if (isl_upoly_is_cst(up) || up->var < pos) {
3411 if (deg == 0)
3412 return isl_upoly_copy(up);
3413 else
3414 return isl_upoly_zero(up->ctx);
3415 }
3416
3417 rec = isl_upoly_as_rec(up);
3418 if (!rec)
3419 return NULL;
3420
3421 if (up->var == pos) {
3422 if (deg < rec->n)
3423 return isl_upoly_copy(rec->p[deg]);
3424 else
3425 return isl_upoly_zero(up->ctx);
3426 }
3427
3428 up = isl_upoly_copy(up);
3429 up = isl_upoly_cow(up);
3430 rec = isl_upoly_as_rec(up);
3431 if (!rec)
3432 goto error;
3433
3434 for (i = 0; i < rec->n; ++i) {
3435 struct isl_upoly *t;
3436 t = isl_upoly_coeff(rec->p[i], pos, deg);
3437 if (!t)
3438 goto error;
3439 isl_upoly_free(rec->p[i]);
3440 rec->p[i] = t;
3441 }
3442
3443 return up;
3444 error:
3445 isl_upoly_free(up);
3446 return NULL;
3447 }
3448
3449 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
3450 */
3451 __isl_give isl_qpolynomial *isl_qpolynomial_coeff(
3452 __isl_keep isl_qpolynomial *qp,
3453 enum isl_dim_type type, unsigned t_pos, int deg)
3454 {
3455 unsigned g_pos;
3456 struct isl_upoly *up;
3457 isl_qpolynomial *c;
3458
3459 if (!qp)
3460 return NULL;
3461
3462 if (type == isl_dim_out)
3463 isl_die(qp->div->ctx, isl_error_invalid,
3464 "output/set dimension does not have a coefficient",
3465 return NULL);
3466 if (type == isl_dim_in)
3467 type = isl_dim_set;
3468
3469 isl_assert(qp->div->ctx, t_pos < isl_space_dim(qp->dim, type),
3470 return NULL);
3471
3472 g_pos = pos(qp->dim, type) + t_pos;
3473 up = isl_upoly_coeff(qp->upoly, g_pos, deg);
3474
3475 c = isl_qpolynomial_alloc(isl_space_copy(qp->dim), qp->div->n_row, up);
3476 if (!c)
3477 return NULL;
3478 isl_mat_free(c->div);
3479 c->div = isl_mat_copy(qp->div);
3480 if (!c->div)
3481 goto error;
3482 return c;
3483 error:
3484 isl_qpolynomial_free(c);
3485 return NULL;
3486 }
3487
3488 /* Homogenize the polynomial in the variables first (inclusive) up to
3489 * last (exclusive) by inserting powers of variable first.
3490 * Variable first is assumed not to appear in the input.
3491 */
3492 __isl_give struct isl_upoly *isl_upoly_homogenize(
3493 __isl_take struct isl_upoly *up, int deg, int target,
3494 int first, int last)
3495 {
3496 int i;
3497 struct isl_upoly_rec *rec;
3498
3499 if (!up)
3500 return NULL;
3501 if (isl_upoly_is_zero(up))
3502 return up;
3503 if (deg == target)
3504 return up;
3505 if (isl_upoly_is_cst(up) || up->var < first) {
3506 struct isl_upoly *hom;
3507
3508 hom = isl_upoly_var_pow(up->ctx, first, target - deg);
3509 if (!hom)
3510 goto error;
3511 rec = isl_upoly_as_rec(hom);
3512 rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up);
3513
3514 return hom;
3515 }
3516
3517 up = isl_upoly_cow(up);
3518 rec = isl_upoly_as_rec(up);
3519 if (!rec)
3520 goto error;
3521
3522 for (i = 0; i < rec->n; ++i) {
3523 if (isl_upoly_is_zero(rec->p[i]))
3524 continue;
3525 rec->p[i] = isl_upoly_homogenize(rec->p[i],
3526 up->var < last ? deg + i : i, target,
3527 first, last);
3528 if (!rec->p[i])
3529 goto error;
3530 }
3531
3532 return up;
3533 error:
3534 isl_upoly_free(up);
3535 return NULL;
3536 }
3537
3538 /* Homogenize the polynomial in the set variables by introducing
3539 * powers of an extra set variable at position 0.
3540 */
3541 __isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
3542 __isl_take isl_qpolynomial *poly)
3543 {
3544 unsigned ovar;
3545 unsigned nvar;
3546 int deg = isl_qpolynomial_degree(poly);
3547
3548 if (deg < -1)
3549 goto error;
3550
3551 poly = isl_qpolynomial_insert_dims(poly, isl_dim_in, 0, 1);
3552 poly = isl_qpolynomial_cow(poly);
3553 if (!poly)
3554 goto error;
3555
3556 ovar = isl_space_offset(poly->dim, isl_dim_set);
3557 nvar = isl_space_dim(poly->dim, isl_dim_set);
3558 poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg,
3559 ovar, ovar + nvar);
3560 if (!poly->upoly)
3561 goto error;
3562
3563 return poly;
3564 error:
3565 isl_qpolynomial_free(poly);
3566 return NULL;
3567 }
3568
3569 __isl_give isl_term *isl_term_alloc(__isl_take isl_space *dim,
3570 __isl_take isl_mat *div)
3571 {
3572 isl_term *term;
3573 int n;
3574
3575 if (!dim || !div)
3576 goto error;
3577
3578 n = isl_space_dim(dim, isl_dim_all) + div->n_row;
3579
3580 term = isl_calloc(dim->ctx, struct isl_term,
3581 sizeof(struct isl_term) + (n - 1) * sizeof(int));
3582 if (!term)
3583 goto error;
3584
3585 term->ref = 1;
3586 term->dim = dim;
3587 term->div = div;
3588 isl_int_init(term->n);
3589 isl_int_init(term->d);
3590
3591 return term;
3592 error:
3593 isl_space_free(dim);
3594 isl_mat_free(div);
3595 return NULL;
3596 }
3597
3598 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
3599 {
3600 if (!term)
3601 return NULL;
3602
3603 term->ref++;
3604 return term;
3605 }
3606
3607 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
3608 {
3609 int i;
3610 isl_term *dup;
3611 unsigned total;
3612
3613 if (!term)
3614 return NULL;
3615
3616 total = isl_space_dim(term->dim, isl_dim_all) + term->div->n_row;
3617
3618 dup = isl_term_alloc(isl_space_copy(term->dim), isl_mat_copy(term->div));
3619 if (!dup)
3620 return NULL;
3621
3622 isl_int_set(dup->n, term->n);
3623 isl_int_set(dup->d, term->d);
3624
3625 for (i = 0; i < total; ++i)
3626 dup->pow[i] = term->pow[i];
3627
3628 return dup;
3629 }
3630
3631 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
3632 {
3633 if (!term)
3634 return NULL;
3635
3636 if (term->ref == 1)
3637 return term;
3638 term->ref--;
3639 return isl_term_dup(term);
3640 }
3641
3642 void isl_term_free(__isl_take isl_term *term)
3643 {
3644 if (!term)
3645 return;
3646
3647 if (--term->ref > 0)
3648 return;
3649
3650 isl_space_free(term->dim);
3651 isl_mat_free(term->div);
3652 isl_int_clear(term->n);
3653 isl_int_clear(term->d);
3654 free(term);
3655 }
3656
3657 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
3658 {
3659 if (!term)
3660 return 0;
3661
3662 switch (type) {
3663 case isl_dim_param:
3664 case isl_dim_in:
3665 case isl_dim_out: return isl_space_dim(term->dim, type);
3666 case isl_dim_div: return term->div->n_row;
3667 case isl_dim_all: return isl_space_dim(term->dim, isl_dim_all) +
3668 term->div->n_row;
3669 default: return 0;
3670 }
3671 }
3672
3673 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
3674 {
3675 return term ? term->dim->ctx : NULL;
3676 }
3677
3678 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
3679 {
3680 if (!term)
3681 return;
3682 isl_int_set(*n, term->n);
3683 }
3684
3685 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
3686 {
3687 if (!term)
3688 return;
3689 isl_int_set(*d, term->d);
3690 }
3691
3692 /* Return the coefficient of the term "term".
3693 */
3694 __isl_give isl_val *isl_term_get_coefficient_val(__isl_keep isl_term *term)
3695 {
3696 if (!term)
3697 return NULL;
3698
3699 return isl_val_rat_from_isl_int(isl_term_get_ctx(term),
3700 term->n, term->d);
3701 }
3702
3703 int isl_term_get_exp(__isl_keep isl_term *term,
3704 enum isl_dim_type type, unsigned pos)
3705 {
3706 if (!term)
3707 return -1;
3708
3709 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
3710
3711 if (type >= isl_dim_set)
3712 pos += isl_space_dim(term->dim, isl_dim_param);
3713 if (type >= isl_dim_div)
3714 pos += isl_space_dim(term->dim, isl_dim_set);
3715
3716 return term->pow[pos];
3717 }
3718
3719 __isl_give isl_aff *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
3720 {
3721 isl_local_space *ls;
3722 isl_aff *aff;
3723
3724 if (!term)
3725 return NULL;
3726
3727 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
3728 return NULL);
3729
3730 ls = isl_local_space_alloc_div(isl_space_copy(term->dim),
3731 isl_mat_copy(term->div));
3732 aff = isl_aff_alloc(ls);
3733 if (!aff)
3734 return NULL;
3735
3736 isl_seq_cpy(aff->v->el, term->div->row[pos], aff->v->size);
3737
3738 aff = isl_aff_normalize(aff);
3739
3740 return aff;
3741 }
3742
3743 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
3744 isl_stat (*fn)(__isl_take isl_term *term, void *user),
3745 __isl_take isl_term *term, void *user)
3746 {
3747 int i;
3748 struct isl_upoly_rec *rec;
3749
3750 if (!up || !term)
3751 goto error;
3752
3753 if (isl_upoly_is_zero(up))
3754 return term;
3755
3756 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
3757 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
3758 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
3759
3760 if (isl_upoly_is_cst(up)) {
3761 struct isl_upoly_cst *cst;
3762 cst = isl_upoly_as_cst(up);
3763 if (!cst)
3764 goto error;
3765 term = isl_term_cow(term);
3766 if (!term)
3767 goto error;
3768 isl_int_set(term->n, cst->n);
3769 isl_int_set(term->d, cst->d);
3770 if (fn(isl_term_copy(term), user) < 0)
3771 goto error;
3772 return term;
3773 }
3774
3775 rec = isl_upoly_as_rec(up);
3776 if (!rec)
3777 goto error;
3778
3779 for (i = 0; i < rec->n; ++i) {
3780 term = isl_term_cow(term);
3781 if (!term)
3782 goto error;
3783 term->pow[up->var] = i;
3784 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
3785 if (!term)
3786 goto error;
3787 }
3788 term->pow[up->var] = 0;
3789
3790 return term;
3791 error:
3792 isl_term_free(term);
3793 return NULL;
3794 }
3795
3796 isl_stat isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
3797 isl_stat (*fn)(__isl_take isl_term *term, void *user), void *user)
3798 {
3799 isl_term *term;
3800
3801 if (!qp)
3802 return isl_stat_error;
3803
3804 term = isl_term_alloc(isl_space_copy(qp->dim), isl_mat_copy(qp->div));
3805 if (!term)
3806 return isl_stat_error;
3807
3808 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
3809
3810 isl_term_free(term);
3811
3812 return term ? isl_stat_ok : isl_stat_error;
3813 }
3814
3815 __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
3816 {
3817 struct isl_upoly *up;
3818 isl_qpolynomial *qp;
3819 int i, n;
3820
3821 if (!term)
3822 return NULL;
3823
3824 n = isl_space_dim(term->dim, isl_dim_all) + term->div->n_row;
3825
3826 up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d);
3827 for (i = 0; i < n; ++i) {
3828 if (!term->pow[i])
3829 continue;
3830 up = isl_upoly_mul(up,
3831 isl_upoly_var_pow(term->dim->ctx, i, term->pow[i]));
3832 }
3833
3834 qp = isl_qpolynomial_alloc(isl_space_copy(term->dim), term->div->n_row, up);
3835 if (!qp)
3836 goto error;
3837 isl_mat_free(qp->div);
3838 qp->div = isl_mat_copy(term->div);
3839 if (!qp->div)
3840 goto error;
3841
3842 isl_term_free(term);
3843 return qp;
3844 error:
3845 isl_qpolynomial_free(qp);
3846 isl_term_free(term);
3847 return NULL;
3848 }
3849
3850 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
3851 __isl_take isl_space *dim)
3852 {
3853 int i;
3854 int extra;
3855 unsigned total;
3856
3857 if (!qp || !dim)
3858 goto error;
3859
3860 if (isl_space_is_equal(qp->dim, dim)) {
3861 isl_space_free(dim);
3862 return qp;
3863 }
3864
3865 qp = isl_qpolynomial_cow(qp);
3866 if (!qp)
3867 goto error;
3868
3869 extra = isl_space_dim(dim, isl_dim_set) -
3870 isl_space_dim(qp->dim, isl_dim_set);
3871 total = isl_space_dim(qp->dim, isl_dim_all);
3872 if (qp->div->n_row) {
3873 int *exp;
3874
3875 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
3876 if (!exp)
3877 goto error;
3878 for (i = 0; i < qp->div->n_row; ++i)
3879 exp[i] = extra + i;
3880 qp->upoly = expand(qp->upoly, exp, total);
3881 free(exp);
3882 if (!qp->upoly)
3883 goto error;
3884 }
3885 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
3886 if (!qp->div)
3887 goto error;
3888 for (i = 0; i < qp->div->n_row; ++i)
3889 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
3890
3891 isl_space_free(qp->dim);
3892 qp->dim = dim;
3893
3894 return qp;
3895 error:
3896 isl_space_free(dim);
3897 isl_qpolynomial_free(qp);
3898 return NULL;
3899 }
3900
3901 /* For each parameter or variable that does not appear in qp,
3902 * first eliminate the variable from all constraints and then set it to zero.
3903 */
3904 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
3905 __isl_keep isl_qpolynomial *qp)
3906 {
3907 int *active = NULL;
3908 int i;
3909 int d;
3910 unsigned nparam;
3911 unsigned nvar;
3912
3913 if (!set || !qp)
3914 goto error;
3915
3916 d = isl_space_dim(set->dim, isl_dim_all);
3917 active = isl_calloc_array(set->ctx, int, d);
3918 if (set_active(qp, active) < 0)
3919 goto error;
3920
3921 for (i = 0; i < d; ++i)
3922 if (!active[i])
3923 break;
3924
3925 if (i == d) {
3926 free(active);
3927 return set;
3928 }
3929
3930 nparam = isl_space_dim(set->dim, isl_dim_param);
3931 nvar = isl_space_dim(set->dim, isl_dim_set);
3932 for (i = 0; i < nparam; ++i) {
3933 if (active[i])
3934 continue;
3935 set = isl_set_eliminate(set, isl_dim_param, i, 1);
3936 set = isl_set_fix_si(set, isl_dim_param, i, 0);
3937 }
3938 for (i = 0; i < nvar; ++i) {
3939 if (active[nparam + i])
3940 continue;
3941 set = isl_set_eliminate(set, isl_dim_set, i, 1);
3942 set = isl_set_fix_si(set, isl_dim_set, i, 0);
3943 }
3944
3945 free(active);
3946
3947 return set;
3948 error:
3949 free(active);
3950 isl_set_free(set);
3951 return NULL;
3952 }
3953
3954 struct isl_opt_data {
3955 isl_qpolynomial *qp;
3956 int first;
3957 isl_val *opt;
3958 int max;
3959 };
3960
3961 static isl_stat opt_fn(__isl_take isl_point *pnt, void *user)
3962 {
3963 struct isl_opt_data *data = (struct isl_opt_data *)user;
3964 isl_val *val;
3965
3966 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
3967 if (data->first) {
3968 data->first = 0;
3969 data->opt = val;
3970 } else if (data->max) {
3971 data->opt = isl_val_max(data->opt, val);
3972 } else {
3973 data->opt = isl_val_min(data->opt, val);
3974 }
3975
3976 return isl_stat_ok;
3977 }
3978
3979 __isl_give isl_val *isl_qpolynomial_opt_on_domain(
3980 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
3981 {
3982 struct isl_opt_data data = { NULL, 1, NULL, max };
3983
3984 if (!set || !qp)
3985 goto error;
3986
3987 if (isl_upoly_is_cst(qp->upoly)) {
3988 isl_set_free(set);
3989 data.opt = isl_qpolynomial_get_constant_val(qp);
3990 isl_qpolynomial_free(qp);
3991 return data.opt;
3992 }
3993
3994 set = fix_inactive(set, qp);
3995
3996 data.qp = qp;
3997 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
3998 goto error;
3999
4000 if (data.first)
4001 data.opt = isl_val_zero(isl_set_get_ctx(set));
4002
4003 isl_set_free(set);
4004 isl_qpolynomial_free(qp);
4005 return data.opt;
4006 error:
4007 isl_set_free(set);
4008 isl_qpolynomial_free(qp);
4009 isl_val_free(data.opt);
4010 return NULL;
4011 }
4012
4013 __isl_give isl_qpolynomial *isl_qpolynomial_morph_domain(
4014 __isl_take isl_qpolynomial *qp, __isl_take isl_morph *morph)
4015 {
4016 int i;
4017 int n_sub;
4018 isl_ctx *ctx;
4019 struct isl_upoly **subs;
4020 isl_mat *mat, *diag;
4021
4022 qp = isl_qpolynomial_cow(qp);
4023 if (!qp || !morph)
4024 goto error;
4025
4026 ctx = qp->dim->ctx;
4027 isl_assert(ctx, isl_space_is_equal(qp->dim, morph->dom->dim), goto error);
4028
4029 n_sub = morph->inv->n_row - 1;
4030 if (morph->inv->n_row != morph->inv->n_col)
4031 n_sub += qp->div->n_row;
4032 subs = isl_calloc_array(ctx, struct isl_upoly *, n_sub);
4033 if (n_sub && !subs)
4034 goto error;
4035
4036 for (i = 0; 1 + i < morph->inv->n_row; ++i)
4037 subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i],
4038 morph->inv->row[0][0], morph->inv->n_col);
4039 if (morph->inv->n_row != morph->inv->n_col)
4040 for (i = 0; i < qp->div->n_row; ++i)
4041 subs[morph->inv->n_row - 1 + i] =
4042 isl_upoly_var_pow(ctx, morph->inv->n_col - 1 + i, 1);
4043
4044 qp->upoly = isl_upoly_subs(qp->upoly, 0, n_sub, subs);
4045
4046 for (i = 0; i < n_sub; ++i)
4047 isl_upoly_free(subs[i]);
4048 free(subs);
4049
4050 diag = isl_mat_diag(ctx, 1, morph->inv->row[0][0]);
4051 mat = isl_mat_diagonal(diag, isl_mat_copy(morph->inv));
4052 diag = isl_mat_diag(ctx, qp->div->n_row, morph->inv->row[0][0]);
4053 mat = isl_mat_diagonal(mat, diag);
4054 qp->div = isl_mat_product(qp->div, mat);
4055 isl_space_free(qp->dim);
4056 qp->dim = isl_space_copy(morph->ran->dim);
4057
4058 if (!qp->upoly || !qp->div || !qp->dim)
4059 goto error;
4060
4061 isl_morph_free(morph);
4062
4063 return qp;
4064 error:
4065 isl_qpolynomial_free(qp);
4066 isl_morph_free(morph);
4067 return NULL;
4068 }
4069
4070 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
4071 __isl_take isl_union_pw_qpolynomial *upwqp1,
4072 __isl_take isl_union_pw_qpolynomial *upwqp2)
4073 {
4074 return isl_union_pw_qpolynomial_match_bin_op(upwqp1, upwqp2,
4075 &isl_pw_qpolynomial_mul);
4076 }
4077
4078 /* Reorder the columns of the given div definitions according to the
4079 * given reordering.
4080 */
4081 static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div,
4082 __isl_take isl_reordering *r)
4083 {
4084 int i, j;
4085 isl_mat *mat;
4086 int extra;
4087
4088 if (!div || !r)
4089 goto error;
4090
4091 extra = isl_space_dim(r->dim, isl_dim_all) + div->n_row - r->len;
4092 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
4093 if (!mat)
4094 goto error;
4095
4096 for (i = 0; i < div->n_row; ++i) {
4097 isl_seq_cpy(mat->row[i], div->row[i], 2);
4098 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2);
4099 for (j = 0; j < r->len; ++j)
4100 isl_int_set(mat->row[i][2 + r->pos[j]],
4101 div->row[i][2 + j]);
4102 }
4103
4104 isl_reordering_free(r);
4105 isl_mat_free(div);
4106 return mat;
4107 error:
4108 isl_reordering_free(r);
4109 isl_mat_free(div);
4110 return NULL;
4111 }
4112
4113 /* Reorder the dimension of "qp" according to the given reordering.
4114 */
4115 __isl_give isl_qpolynomial *isl_qpolynomial_realign_domain(
4116 __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r)
4117 {
4118 qp = isl_qpolynomial_cow(qp);
4119 if (!qp)
4120 goto error;
4121
4122 r = isl_reordering_extend(r, qp->div->n_row);
4123 if (!r)
4124 goto error;
4125
4126 qp->div = reorder_divs(qp->div, isl_reordering_copy(r));
4127 if (!qp->div)
4128 goto error;
4129
4130 qp->upoly = reorder(qp->upoly, r->pos);
4131 if (!qp->upoly)
4132 goto error;
4133
4134 qp = isl_qpolynomial_reset_domain_space(qp, isl_space_copy(r->dim));
4135
4136 isl_reordering_free(r);
4137 return qp;
4138 error:
4139 isl_qpolynomial_free(qp);
4140 isl_reordering_free(r);
4141 return NULL;
4142 }
4143
4144 __isl_give isl_qpolynomial *isl_qpolynomial_align_params(
4145 __isl_take isl_qpolynomial *qp, __isl_take isl_space *model)
4146 {
4147 if (!qp || !model)
4148 goto error;
4149
4150 if (!isl_space_match(qp->dim, isl_dim_param, model, isl_dim_param)) {
4151 isl_reordering *exp;
4152
4153 model = isl_space_drop_dims(model, isl_dim_in,
4154 0, isl_space_dim(model, isl_dim_in));
4155 model = isl_space_drop_dims(model, isl_dim_out,
4156 0, isl_space_dim(model, isl_dim_out));
4157 exp = isl_parameter_alignment_reordering(qp->dim, model);
4158 exp = isl_reordering_extend_space(exp,
4159 isl_qpolynomial_get_domain_space(qp));
4160 qp = isl_qpolynomial_realign_domain(qp, exp);
4161 }
4162
4163 isl_space_free(model);
4164 return qp;
4165 error:
4166 isl_space_free(model);
4167 isl_qpolynomial_free(qp);
4168 return NULL;
4169 }
4170
4171 struct isl_split_periods_data {
4172 int max_periods;
4173 isl_pw_qpolynomial *res;
4174 };
4175
4176 /* Create a slice where the integer division "div" has the fixed value "v".
4177 * In particular, if "div" refers to floor(f/m), then create a slice
4178 *
4179 * m v <= f <= m v + (m - 1)
4180 *
4181 * or
4182 *
4183 * f - m v >= 0
4184 * -f + m v + (m - 1) >= 0
4185 */
4186 static __isl_give isl_set *set_div_slice(__isl_take isl_space *dim,
4187 __isl_keep isl_qpolynomial *qp, int div, isl_int v)
4188 {
4189 int total;
4190 isl_basic_set *bset = NULL;
4191 int k;
4192
4193 if (!dim || !qp)
4194 goto error;
4195
4196 total = isl_space_dim(dim, isl_dim_all);
4197 bset = isl_basic_set_alloc_space(isl_space_copy(dim), 0, 0, 2);
4198
4199 k = isl_basic_set_alloc_inequality(bset);
4200 if (k < 0)
4201 goto error;
4202 isl_seq_cpy(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
4203 isl_int_submul(bset->ineq[k][0], v, qp->div->row[div][0]);
4204
4205 k = isl_basic_set_alloc_inequality(bset);
4206 if (k < 0)
4207 goto error;
4208 isl_seq_neg(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
4209 isl_int_addmul(bset->ineq[k][0], v, qp->div->row[div][0]);
4210 isl_int_add(bset->ineq[k][0], bset->ineq[k][0], qp->div->row[div][0]);
4211 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
4212
4213 isl_space_free(dim);
4214 return isl_set_from_basic_set(bset);
4215 error:
4216 isl_basic_set_free(bset);
4217 isl_space_free(dim);
4218 return NULL;
4219 }
4220
4221 static isl_stat split_periods(__isl_take isl_set *set,
4222 __isl_take isl_qpolynomial *qp, void *user);
4223
4224 /* Create a slice of the domain "set" such that integer division "div"
4225 * has the fixed value "v" and add the results to data->res,
4226 * replacing the integer division by "v" in "qp".
4227 */
4228 static isl_stat set_div(__isl_take isl_set *set,
4229 __isl_take isl_qpolynomial *qp, int div, isl_int v,
4230 struct isl_split_periods_data *data)
4231 {
4232 int i;
4233 int total;
4234 isl_set *slice;
4235 struct isl_upoly *cst;
4236
4237 slice = set_div_slice(isl_set_get_space(set), qp, div, v);
4238 set = isl_set_intersect(set, slice);
4239
4240 if (!qp)
4241 goto error;
4242
4243 total = isl_space_dim(qp->dim, isl_dim_all);
4244
4245 for (i = div + 1; i < qp->div->n_row; ++i) {
4246 if (isl_int_is_zero(qp->div->row[i][2 + total + div]))
4247 continue;
4248 isl_int_addmul(qp->div->row[i][1],
4249 qp->div->row[i][2 + total + div], v);
4250 isl_int_set_si(qp->div->row[i][2 + total + div], 0);
4251 }
4252
4253 cst = isl_upoly_rat_cst(qp->dim->ctx, v, qp->dim->ctx->one);
4254 qp = substitute_div(qp, div, cst);
4255
4256 return split_periods(set, qp, data);
4257 error:
4258 isl_set_free(set);
4259 isl_qpolynomial_free(qp);
4260 return -1;
4261 }
4262
4263 /* Split the domain "set" such that integer division "div"
4264 * has a fixed value (ranging from "min" to "max") on each slice
4265 * and add the results to data->res.
4266 */
4267 static isl_stat split_div(__isl_take isl_set *set,
4268 __isl_take isl_qpolynomial *qp, int div, isl_int min, isl_int max,
4269 struct isl_split_periods_data *data)
4270 {
4271 for (; isl_int_le(min, max); isl_int_add_ui(min, min, 1)) {
4272 isl_set *set_i = isl_set_copy(set);
4273 isl_qpolynomial *qp_i = isl_qpolynomial_copy(qp);
4274
4275 if (set_div(set_i, qp_i, div, min, data) < 0)
4276 goto error;
4277 }
4278 isl_set_free(set);
4279 isl_qpolynomial_free(qp);
4280 return isl_stat_ok;
4281 error:
4282 isl_set_free(set);
4283 isl_qpolynomial_free(qp);
4284 return isl_stat_error;
4285 }
4286
4287 /* If "qp" refers to any integer division
4288 * that can only attain "max_periods" distinct values on "set"
4289 * then split the domain along those distinct values.
4290 * Add the results (or the original if no splitting occurs)
4291 * to data->res.
4292 */
4293 static isl_stat split_periods(__isl_take isl_set *set,
4294 __isl_take isl_qpolynomial *qp, void *user)
4295 {
4296 int i;
4297 isl_pw_qpolynomial *pwqp;
4298 struct isl_split_periods_data *data;
4299 isl_int min, max;
4300 int total;
4301 isl_stat r = isl_stat_ok;
4302
4303 data = (struct isl_split_periods_data *)user;
4304
4305 if (!set || !qp)
4306 goto error;
4307
4308 if (qp->div->n_row == 0) {
4309 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4310 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
4311 return isl_stat_ok;
4312 }
4313
4314 isl_int_init(min);
4315 isl_int_init(max);
4316 total = isl_space_dim(qp->dim, isl_dim_all);
4317 for (i = 0; i < qp->div->n_row; ++i) {
4318 enum isl_lp_result lp_res;
4319
4320 if (isl_seq_first_non_zero(qp->div->row[i] + 2 + total,
4321 qp->div->n_row) != -1)
4322 continue;
4323
4324 lp_res = isl_set_solve_lp(set, 0, qp->div->row[i] + 1,
4325 set->ctx->one, &min, NULL, NULL);
4326 if (lp_res == isl_lp_error)
4327 goto error2;
4328 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
4329 continue;
4330 isl_int_fdiv_q(min, min, qp->div->row[i][0]);
4331
4332 lp_res = isl_set_solve_lp(set, 1, qp->div->row[i] + 1,
4333 set->ctx->one, &max, NULL, NULL);
4334 if (lp_res == isl_lp_error)
4335 goto error2;
4336 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
4337 continue;
4338 isl_int_fdiv_q(max, max, qp->div->row[i][0]);
4339
4340 isl_int_sub(max, max, min);
4341 if (isl_int_cmp_si(max, data->max_periods) < 0) {
4342 isl_int_add(max, max, min);
4343 break;
4344 }
4345 }
4346
4347 if (i < qp->div->n_row) {
4348 r = split_div(set, qp, i, min, max, data);
4349 } else {
4350 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4351 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
4352 }
4353
4354 isl_int_clear(max);
4355 isl_int_clear(min);
4356
4357 return r;
4358 error2:
4359 isl_int_clear(max);
4360 isl_int_clear(min);
4361 error:
4362 isl_set_free(set);
4363 isl_qpolynomial_free(qp);
4364 return isl_stat_error;
4365 }
4366
4367 /* If any quasi-polynomial in pwqp refers to any integer division
4368 * that can only attain "max_periods" distinct values on its domain
4369 * then split the domain along those distinct values.
4370 */
4371 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_periods(
4372 __isl_take isl_pw_qpolynomial *pwqp, int max_periods)
4373 {
4374 struct isl_split_periods_data data;
4375
4376 data.max_periods = max_periods;
4377 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_space(pwqp));
4378
4379 if (isl_pw_qpolynomial_foreach_piece(pwqp, &split_periods, &data) < 0)
4380 goto error;
4381
4382 isl_pw_qpolynomial_free(pwqp);
4383
4384 return data.res;
4385 error:
4386 isl_pw_qpolynomial_free(data.res);
4387 isl_pw_qpolynomial_free(pwqp);
4388 return NULL;
4389 }
4390
4391 /* Construct a piecewise quasipolynomial that is constant on the given
4392 * domain. In particular, it is
4393 * 0 if cst == 0
4394 * 1 if cst == 1
4395 * infinity if cst == -1
4396 */
4397 static __isl_give isl_pw_qpolynomial *constant_on_domain(
4398 __isl_take isl_basic_set *bset, int cst)
4399 {
4400 isl_space *dim;
4401 isl_qpolynomial *qp;
4402
4403 if (!bset)
4404 return NULL;
4405
4406 bset = isl_basic_set_params(bset);
4407 dim = isl_basic_set_get_space(bset);
4408 if (cst < 0)
4409 qp = isl_qpolynomial_infty_on_domain(dim);
4410 else if (cst == 0)
4411 qp = isl_qpolynomial_zero_on_domain(dim);
4412 else
4413 qp = isl_qpolynomial_one_on_domain(dim);
4414 return isl_pw_qpolynomial_alloc(isl_set_from_basic_set(bset), qp);
4415 }
4416
4417 /* Factor bset, call fn on each of the factors and return the product.
4418 *
4419 * If no factors can be found, simply call fn on the input.
4420 * Otherwise, construct the factors based on the factorizer,
4421 * call fn on each factor and compute the product.
4422 */
4423 static __isl_give isl_pw_qpolynomial *compressed_multiplicative_call(
4424 __isl_take isl_basic_set *bset,
4425 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
4426 {
4427 int i, n;
4428 isl_space *dim;
4429 isl_set *set;
4430 isl_factorizer *f;
4431 isl_qpolynomial *qp;
4432 isl_pw_qpolynomial *pwqp;
4433 unsigned nparam;
4434 unsigned nvar;
4435
4436 f = isl_basic_set_factorizer(bset);
4437 if (!f)
4438 goto error;
4439 if (f->n_group == 0) {
4440 isl_factorizer_free(f);
4441 return fn(bset);
4442 }
4443
4444 nparam = isl_basic_set_dim(bset, isl_dim_param);
4445 nvar = isl_basic_set_dim(bset, isl_dim_set);
4446
4447 dim = isl_basic_set_get_space(bset);
4448 dim = isl_space_domain(dim);
4449 set = isl_set_universe(isl_space_copy(dim));
4450 qp = isl_qpolynomial_one_on_domain(dim);
4451 pwqp = isl_pw_qpolynomial_alloc(set, qp);
4452
4453 bset = isl_morph_basic_set(isl_morph_copy(f->morph), bset);
4454
4455 for (i = 0, n = 0; i < f->n_group; ++i) {
4456 isl_basic_set *bset_i;
4457 isl_pw_qpolynomial *pwqp_i;
4458
4459 bset_i = isl_basic_set_copy(bset);
4460 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
4461 nparam + n + f->len[i], nvar - n - f->len[i]);
4462 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
4463 nparam, n);
4464 bset_i = isl_basic_set_drop(bset_i, isl_dim_set,
4465 n + f->len[i], nvar - n - f->len[i]);
4466 bset_i = isl_basic_set_drop(bset_i, isl_dim_set, 0, n);
4467
4468 pwqp_i = fn(bset_i);
4469 pwqp = isl_pw_qpolynomial_mul(pwqp, pwqp_i);
4470
4471 n += f->len[i];
4472 }
4473
4474 isl_basic_set_free(bset);
4475 isl_factorizer_free(f);
4476
4477 return pwqp;
4478 error:
4479 isl_basic_set_free(bset);
4480 return NULL;
4481 }
4482
4483 /* Factor bset, call fn on each of the factors and return the product.
4484 * The function is assumed to evaluate to zero on empty domains,
4485 * to one on zero-dimensional domains and to infinity on unbounded domains
4486 * and will not be called explicitly on zero-dimensional or unbounded domains.
4487 *
4488 * We first check for some special cases and remove all equalities.
4489 * Then we hand over control to compressed_multiplicative_call.
4490 */
4491 __isl_give isl_pw_qpolynomial *isl_basic_set_multiplicative_call(
4492 __isl_take isl_basic_set *bset,
4493 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
4494 {
4495 int bounded;
4496 isl_morph *morph;
4497 isl_pw_qpolynomial *pwqp;
4498
4499 if (!bset)
4500 return NULL;
4501
4502 if (isl_basic_set_plain_is_empty(bset))
4503 return constant_on_domain(bset, 0);
4504
4505 if (isl_basic_set_dim(bset, isl_dim_set) == 0)
4506 return constant_on_domain(bset, 1);
4507
4508 bounded = isl_basic_set_is_bounded(bset);
4509 if (bounded < 0)
4510 goto error;
4511 if (!bounded)
4512 return constant_on_domain(bset, -1);
4513
4514 if (bset->n_eq == 0)
4515 return compressed_multiplicative_call(bset, fn);
4516
4517 morph = isl_basic_set_full_compression(bset);
4518 bset = isl_morph_basic_set(isl_morph_copy(morph), bset);
4519
4520 pwqp = compressed_multiplicative_call(bset, fn);
4521
4522 morph = isl_morph_dom_params(morph);
4523 morph = isl_morph_ran_params(morph);
4524 morph = isl_morph_inverse(morph);
4525
4526 pwqp = isl_pw_qpolynomial_morph_domain(pwqp, morph);
4527
4528 return pwqp;
4529 error:
4530 isl_basic_set_free(bset);
4531 return NULL;
4532 }
4533
4534 /* Drop all floors in "qp", turning each integer division [a/m] into
4535 * a rational division a/m. If "down" is set, then the integer division
4536 * is replaced by (a-(m-1))/m instead.
4537 */
4538 static __isl_give isl_qpolynomial *qp_drop_floors(
4539 __isl_take isl_qpolynomial *qp, int down)
4540 {
4541 int i;
4542 struct isl_upoly *s;
4543
4544 if (!qp)
4545 return NULL;
4546 if (qp->div->n_row == 0)
4547 return qp;
4548
4549 qp = isl_qpolynomial_cow(qp);
4550 if (!qp)
4551 return NULL;
4552
4553 for (i = qp->div->n_row - 1; i >= 0; --i) {
4554 if (down) {
4555 isl_int_sub(qp->div->row[i][1],
4556 qp->div->row[i][1], qp->div->row[i][0]);
4557 isl_int_add_ui(qp->div->row[i][1],
4558 qp->div->row[i][1], 1);
4559 }
4560 s = isl_upoly_from_affine(qp->dim->ctx, qp->div->row[i] + 1,
4561 qp->div->row[i][0], qp->div->n_col - 1);
4562 qp = substitute_div(qp, i, s);
4563 if (!qp)
4564 return NULL;
4565 }
4566
4567 return qp;
4568 }
4569
4570 /* Drop all floors in "pwqp", turning each integer division [a/m] into
4571 * a rational division a/m.
4572 */
4573 static __isl_give isl_pw_qpolynomial *pwqp_drop_floors(
4574 __isl_take isl_pw_qpolynomial *pwqp)
4575 {
4576 int i;
4577
4578 if (!pwqp)
4579 return NULL;
4580
4581 if (isl_pw_qpolynomial_is_zero(pwqp))
4582 return pwqp;
4583
4584 pwqp = isl_pw_qpolynomial_cow(pwqp);
4585 if (!pwqp)
4586 return NULL;
4587
4588 for (i = 0; i < pwqp->n; ++i) {
4589 pwqp->p[i].qp = qp_drop_floors(pwqp->p[i].qp, 0);
4590 if (!pwqp->p[i].qp)
4591 goto error;
4592 }
4593
4594 return pwqp;
4595 error:
4596 isl_pw_qpolynomial_free(pwqp);
4597 return NULL;
4598 }
4599
4600 /* Adjust all the integer divisions in "qp" such that they are at least
4601 * one over the given orthant (identified by "signs"). This ensures
4602 * that they will still be non-negative even after subtracting (m-1)/m.
4603 *
4604 * In particular, f is replaced by f' + v, changing f = [a/m]
4605 * to f' = [(a - m v)/m].
4606 * If the constant term k in a is smaller than m,
4607 * the constant term of v is set to floor(k/m) - 1.
4608 * For any other term, if the coefficient c and the variable x have
4609 * the same sign, then no changes are needed.
4610 * Otherwise, if the variable is positive (and c is negative),
4611 * then the coefficient of x in v is set to floor(c/m).
4612 * If the variable is negative (and c is positive),
4613 * then the coefficient of x in v is set to ceil(c/m).
4614 */
4615 static __isl_give isl_qpolynomial *make_divs_pos(__isl_take isl_qpolynomial *qp,
4616 int *signs)
4617 {
4618 int i, j;
4619 int total;
4620 isl_vec *v = NULL;
4621 struct isl_upoly *s;
4622
4623 qp = isl_qpolynomial_cow(qp);
4624 if (!qp)
4625 return NULL;
4626 qp->div = isl_mat_cow(qp->div);
4627 if (!qp->div)
4628 goto error;
4629
4630 total = isl_space_dim(qp->dim, isl_dim_all);
4631 v = isl_vec_alloc(qp->div->ctx, qp->div->n_col - 1);
4632
4633 for (i = 0; i < qp->div->n_row; ++i) {
4634 isl_int *row = qp->div->row[i];
4635 v = isl_vec_clr(v);
4636 if (!v)
4637 goto error;
4638 if (isl_int_lt(row[1], row[0])) {
4639 isl_int_fdiv_q(v->el[0], row[1], row[0]);
4640 isl_int_sub_ui(v->el[0], v->el[0], 1);
4641 isl_int_submul(row[1], row[0], v->el[0]);
4642 }
4643 for (j = 0; j < total; ++j) {
4644 if (isl_int_sgn(row[2 + j]) * signs[j] >= 0)
4645 continue;
4646 if (signs[j] < 0)
4647 isl_int_cdiv_q(v->el[1 + j], row[2 + j], row[0]);
4648 else
4649 isl_int_fdiv_q(v->el[1 + j], row[2 + j], row[0]);
4650 isl_int_submul(row[2 + j], row[0], v->el[1 + j]);
4651 }
4652 for (j = 0; j < i; ++j) {
4653 if (isl_int_sgn(row[2 + total + j]) >= 0)
4654 continue;
4655 isl_int_fdiv_q(v->el[1 + total + j],
4656 row[2 + total + j], row[0]);
4657 isl_int_submul(row[2 + total + j],
4658 row[0], v->el[1 + total + j]);
4659 }
4660 for (j = i + 1; j < qp->div->n_row; ++j) {
4661 if (isl_int_is_zero(qp->div->row[j][2 + total + i]))
4662 continue;
4663 isl_seq_combine(qp->div->row[j] + 1,
4664 qp->div->ctx->one, qp->div->row[j] + 1,
4665 qp->div->row[j][2 + total + i], v->el, v->size);
4666 }
4667 isl_int_set_si(v->el[1 + total + i], 1);
4668 s = isl_upoly_from_affine(qp->dim->ctx, v->el,
4669 qp->div->ctx->one, v->size);
4670 qp->upoly = isl_upoly_subs(qp->upoly, total + i, 1, &s);
4671 isl_upoly_free(s);
4672 if (!qp->upoly)
4673 goto error;
4674 }
4675
4676 isl_vec_free(v);
4677 return qp;
4678 error:
4679 isl_vec_free(v);
4680 isl_qpolynomial_free(qp);
4681 return NULL;
4682 }
4683
4684 struct isl_to_poly_data {
4685 int sign;
4686 isl_pw_qpolynomial *res;
4687 isl_qpolynomial *qp;
4688 };
4689
4690 /* Appoximate data->qp by a polynomial on the orthant identified by "signs".
4691 * We first make all integer divisions positive and then split the
4692 * quasipolynomials into terms with sign data->sign (the direction
4693 * of the requested approximation) and terms with the opposite sign.
4694 * In the first set of terms, each integer division [a/m] is
4695 * overapproximated by a/m, while in the second it is underapproximated
4696 * by (a-(m-1))/m.
4697 */
4698 static int to_polynomial_on_orthant(__isl_take isl_set *orthant, int *signs,
4699 void *user)
4700 {
4701 struct isl_to_poly_data *data = user;
4702 isl_pw_qpolynomial *t;
4703 isl_qpolynomial *qp, *up, *down;
4704
4705 qp = isl_qpolynomial_copy(data->qp);
4706 qp = make_divs_pos(qp, signs);
4707
4708 up = isl_qpolynomial_terms_of_sign(qp, signs, data->sign);
4709 up = qp_drop_floors(up, 0);
4710 down = isl_qpolynomial_terms_of_sign(qp, signs, -data->sign);
4711 down = qp_drop_floors(down, 1);
4712
4713 isl_qpolynomial_free(qp);
4714 qp = isl_qpolynomial_add(up, down);
4715
4716 t = isl_pw_qpolynomial_alloc(orthant, qp);
4717 data->res = isl_pw_qpolynomial_add_disjoint(data->res, t);
4718
4719 return 0;
4720 }
4721
4722 /* Approximate each quasipolynomial by a polynomial. If "sign" is positive,
4723 * the polynomial will be an overapproximation. If "sign" is negative,
4724 * it will be an underapproximation. If "sign" is zero, the approximation
4725 * will lie somewhere in between.
4726 *
4727 * In particular, is sign == 0, we simply drop the floors, turning
4728 * the integer divisions into rational divisions.
4729 * Otherwise, we split the domains into orthants, make all integer divisions
4730 * positive and then approximate each [a/m] by either a/m or (a-(m-1))/m,
4731 * depending on the requested sign and the sign of the term in which
4732 * the integer division appears.
4733 */
4734 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_to_polynomial(
4735 __isl_take isl_pw_qpolynomial *pwqp, int sign)
4736 {
4737 int i;
4738 struct isl_to_poly_data data;
4739
4740 if (sign == 0)
4741 return pwqp_drop_floors(pwqp);
4742
4743 if (!pwqp)
4744 return NULL;
4745
4746 data.sign = sign;
4747 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_space(pwqp));
4748
4749 for (i = 0; i < pwqp->n; ++i) {
4750 if (pwqp->p[i].qp->div->n_row == 0) {
4751 isl_pw_qpolynomial *t;
4752 t = isl_pw_qpolynomial_alloc(
4753 isl_set_copy(pwqp->p[i].set),
4754 isl_qpolynomial_copy(pwqp->p[i].qp));
4755 data.res = isl_pw_qpolynomial_add_disjoint(data.res, t);
4756 continue;
4757 }
4758 data.qp = pwqp->p[i].qp;
4759 if (isl_set_foreach_orthant(pwqp->p[i].set,
4760 &to_polynomial_on_orthant, &data) < 0)
4761 goto error;
4762 }
4763
4764 isl_pw_qpolynomial_free(pwqp);
4765
4766 return data.res;
4767 error:
4768 isl_pw_qpolynomial_free(pwqp);
4769 isl_pw_qpolynomial_free(data.res);
4770 return NULL;
4771 }
4772
4773 static isl_stat poly_entry(void **entry, void *user)
4774 {
4775 int *sign = user;
4776 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
4777
4778 *pwqp = isl_pw_qpolynomial_to_polynomial(*pwqp, *sign);
4779
4780 return *pwqp ? isl_stat_ok : isl_stat_error;
4781 }
4782
4783 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_to_polynomial(
4784 __isl_take isl_union_pw_qpolynomial *upwqp, int sign)
4785 {
4786 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
4787 if (!upwqp)
4788 return NULL;
4789
4790 if (isl_hash_table_foreach(upwqp->space->ctx, &upwqp->table,
4791 &poly_entry, &sign) < 0)
4792 goto error;
4793
4794 return upwqp;
4795 error:
4796 isl_union_pw_qpolynomial_free(upwqp);
4797 return NULL;
4798 }
4799
4800 __isl_give isl_basic_map *isl_basic_map_from_qpolynomial(
4801 __isl_take isl_qpolynomial *qp)
4802 {
4803 int i, k;
4804 isl_space *dim;
4805 isl_vec *aff = NULL;
4806 isl_basic_map *bmap = NULL;
4807 unsigned pos;
4808 unsigned n_div;
4809
4810 if (!qp)
4811 return NULL;
4812 if (!isl_upoly_is_affine(qp->upoly))
4813 isl_die(qp->dim->ctx, isl_error_invalid,
4814 "input quasi-polynomial not affine", goto error);
4815 aff = isl_qpolynomial_extract_affine(qp);
4816 if (!aff)
4817 goto error;
4818 dim = isl_qpolynomial_get_space(qp);
4819 pos = 1 + isl_space_offset(dim, isl_dim_out);
4820 n_div = qp->div->n_row;
4821 bmap = isl_basic_map_alloc_space(dim, n_div, 1, 2 * n_div);
4822
4823 for (i = 0; i < n_div; ++i) {
4824 k = isl_basic_map_alloc_div(bmap);
4825 if (k < 0)
4826 goto error;
4827 isl_seq_cpy(bmap->div[k], qp->div->row[i], qp->div->n_col);
4828 isl_int_set_si(bmap->div[k][qp->div->n_col], 0);
4829 if (isl_basic_map_add_div_constraints(bmap, k) < 0)
4830 goto error;
4831 }
4832 k = isl_basic_map_alloc_equality(bmap);
4833 if (k < 0)
4834 goto error;
4835 isl_int_neg(bmap->eq[k][pos], aff->el[0]);
4836 isl_seq_cpy(bmap->eq[k], aff->el + 1, pos);
4837 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->el + 1 + pos, n_div);
4838
4839 isl_vec_free(aff);
4840 isl_qpolynomial_free(qp);
4841 bmap = isl_basic_map_finalize(bmap);
4842 return bmap;
4843 error:
4844 isl_vec_free(aff);
4845 isl_qpolynomial_free(qp);
4846 isl_basic_map_free(bmap);
4847 return NULL;
4848 }
Integer set library