?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
export isl_pw_qpolynomial_fold_add
[isl.git] / isl_polynomial.c
blobb9b98e1f2bb1b3b1e60b665e497bec03ed2a622a
1 /*
2 * Copyright 2010 INRIA Saclay
3 *
4 * Use of this software is governed by the GNU LGPLv2.1 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 #include <isl_factorization.h>
13 #include <isl_lp.h>
14 #include <isl_seq.h>
15 #include <isl_union_map_private.h>
16 #include <isl_polynomial_private.h>
17 #include <isl_point_private.h>
18 #include <isl_dim_private.h>
19 #include <isl_map_private.h>
20 #include <isl_mat_private.h>
21
22 static unsigned pos(__isl_keep isl_dim *dim, enum isl_dim_type type)
23 {
24 switch (type) {
25 case isl_dim_param: return 0;
26 case isl_dim_in: return dim->nparam;
27 case isl_dim_out: return dim->nparam + dim->n_in;
28 default: return 0;
29 }
30 }
31
32 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
33 {
34 if (!up)
35 return -1;
36
37 return up->var < 0;
38 }
39
40 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
41 {
42 if (!up)
43 return NULL;
44
45 isl_assert(up->ctx, up->var < 0, return NULL);
46
47 return (struct isl_upoly_cst *)up;
48 }
49
50 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__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_rec *)up;
58 }
59
60 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
61 __isl_keep struct isl_upoly *up2)
62 {
63 int i;
64 struct isl_upoly_rec *rec1, *rec2;
65
66 if (!up1 || !up2)
67 return -1;
68 if (up1 == up2)
69 return 1;
70 if (up1->var != up2->var)
71 return 0;
72 if (isl_upoly_is_cst(up1)) {
73 struct isl_upoly_cst *cst1, *cst2;
74 cst1 = isl_upoly_as_cst(up1);
75 cst2 = isl_upoly_as_cst(up2);
76 if (!cst1 || !cst2)
77 return -1;
78 return isl_int_eq(cst1->n, cst2->n) &&
79 isl_int_eq(cst1->d, cst2->d);
80 }
81
82 rec1 = isl_upoly_as_rec(up1);
83 rec2 = isl_upoly_as_rec(up2);
84 if (!rec1 || !rec2)
85 return -1;
86
87 if (rec1->n != rec2->n)
88 return 0;
89
90 for (i = 0; i < rec1->n; ++i) {
91 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
92 if (eq < 0 || !eq)
93 return eq;
94 }
95
96 return 1;
97 }
98
99 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
100 {
101 struct isl_upoly_cst *cst;
102
103 if (!up)
104 return -1;
105 if (!isl_upoly_is_cst(up))
106 return 0;
107
108 cst = isl_upoly_as_cst(up);
109 if (!cst)
110 return -1;
111
112 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
113 }
114
115 int isl_upoly_sgn(__isl_keep struct isl_upoly *up)
116 {
117 struct isl_upoly_cst *cst;
118
119 if (!up)
120 return 0;
121 if (!isl_upoly_is_cst(up))
122 return 0;
123
124 cst = isl_upoly_as_cst(up);
125 if (!cst)
126 return 0;
127
128 return isl_int_sgn(cst->n);
129 }
130
131 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
132 {
133 struct isl_upoly_cst *cst;
134
135 if (!up)
136 return -1;
137 if (!isl_upoly_is_cst(up))
138 return 0;
139
140 cst = isl_upoly_as_cst(up);
141 if (!cst)
142 return -1;
143
144 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
145 }
146
147 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
148 {
149 struct isl_upoly_cst *cst;
150
151 if (!up)
152 return -1;
153 if (!isl_upoly_is_cst(up))
154 return 0;
155
156 cst = isl_upoly_as_cst(up);
157 if (!cst)
158 return -1;
159
160 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
161 }
162
163 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
164 {
165 struct isl_upoly_cst *cst;
166
167 if (!up)
168 return -1;
169 if (!isl_upoly_is_cst(up))
170 return 0;
171
172 cst = isl_upoly_as_cst(up);
173 if (!cst)
174 return -1;
175
176 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
177 }
178
179 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
180 {
181 struct isl_upoly_cst *cst;
182
183 if (!up)
184 return -1;
185 if (!isl_upoly_is_cst(up))
186 return 0;
187
188 cst = isl_upoly_as_cst(up);
189 if (!cst)
190 return -1;
191
192 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
193 }
194
195 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
196 {
197 struct isl_upoly_cst *cst;
198
199 if (!up)
200 return -1;
201 if (!isl_upoly_is_cst(up))
202 return 0;
203
204 cst = isl_upoly_as_cst(up);
205 if (!cst)
206 return -1;
207
208 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
209 }
210
211 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
212 {
213 struct isl_upoly_cst *cst;
214
215 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
216 if (!cst)
217 return NULL;
218
219 cst->up.ref = 1;
220 cst->up.ctx = ctx;
221 isl_ctx_ref(ctx);
222 cst->up.var = -1;
223
224 isl_int_init(cst->n);
225 isl_int_init(cst->d);
226
227 return cst;
228 }
229
230 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
231 {
232 struct isl_upoly_cst *cst;
233
234 cst = isl_upoly_cst_alloc(ctx);
235 if (!cst)
236 return NULL;
237
238 isl_int_set_si(cst->n, 0);
239 isl_int_set_si(cst->d, 1);
240
241 return &cst->up;
242 }
243
244 __isl_give struct isl_upoly *isl_upoly_one(struct isl_ctx *ctx)
245 {
246 struct isl_upoly_cst *cst;
247
248 cst = isl_upoly_cst_alloc(ctx);
249 if (!cst)
250 return NULL;
251
252 isl_int_set_si(cst->n, 1);
253 isl_int_set_si(cst->d, 1);
254
255 return &cst->up;
256 }
257
258 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
259 {
260 struct isl_upoly_cst *cst;
261
262 cst = isl_upoly_cst_alloc(ctx);
263 if (!cst)
264 return NULL;
265
266 isl_int_set_si(cst->n, 1);
267 isl_int_set_si(cst->d, 0);
268
269 return &cst->up;
270 }
271
272 __isl_give struct isl_upoly *isl_upoly_neginfty(struct isl_ctx *ctx)
273 {
274 struct isl_upoly_cst *cst;
275
276 cst = isl_upoly_cst_alloc(ctx);
277 if (!cst)
278 return NULL;
279
280 isl_int_set_si(cst->n, -1);
281 isl_int_set_si(cst->d, 0);
282
283 return &cst->up;
284 }
285
286 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
287 {
288 struct isl_upoly_cst *cst;
289
290 cst = isl_upoly_cst_alloc(ctx);
291 if (!cst)
292 return NULL;
293
294 isl_int_set_si(cst->n, 0);
295 isl_int_set_si(cst->d, 0);
296
297 return &cst->up;
298 }
299
300 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
301 isl_int n, isl_int d)
302 {
303 struct isl_upoly_cst *cst;
304
305 cst = isl_upoly_cst_alloc(ctx);
306 if (!cst)
307 return NULL;
308
309 isl_int_set(cst->n, n);
310 isl_int_set(cst->d, d);
311
312 return &cst->up;
313 }
314
315 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
316 int var, int size)
317 {
318 struct isl_upoly_rec *rec;
319
320 isl_assert(ctx, var >= 0, return NULL);
321 isl_assert(ctx, size >= 0, return NULL);
322 rec = isl_calloc(ctx, struct isl_upoly_rec,
323 sizeof(struct isl_upoly_rec) +
324 (size - 1) * sizeof(struct isl_upoly *));
325 if (!rec)
326 return NULL;
327
328 rec->up.ref = 1;
329 rec->up.ctx = ctx;
330 isl_ctx_ref(ctx);
331 rec->up.var = var;
332
333 rec->n = 0;
334 rec->size = size;
335
336 return rec;
337 }
338
339 __isl_give isl_qpolynomial *isl_qpolynomial_reset_dim(
340 __isl_take isl_qpolynomial *qp, __isl_take isl_dim *dim)
341 {
342 qp = isl_qpolynomial_cow(qp);
343 if (!qp || !dim)
344 goto error;
345
346 isl_dim_free(qp->dim);
347 qp->dim = dim;
348
349 return qp;
350 error:
351 isl_qpolynomial_free(qp);
352 isl_dim_free(dim);
353 return NULL;
354 }
355
356 isl_ctx *isl_qpolynomial_get_ctx(__isl_keep isl_qpolynomial *qp)
357 {
358 return qp ? qp->dim->ctx : NULL;
359 }
360
361 __isl_give isl_dim *isl_qpolynomial_get_dim(__isl_keep isl_qpolynomial *qp)
362 {
363 return qp ? isl_dim_copy(qp->dim) : NULL;
364 }
365
366 unsigned isl_qpolynomial_dim(__isl_keep isl_qpolynomial *qp,
367 enum isl_dim_type type)
368 {
369 return qp ? isl_dim_size(qp->dim, type) : 0;
370 }
371
372 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
373 {
374 return qp ? isl_upoly_is_zero(qp->upoly) : -1;
375 }
376
377 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
378 {
379 return qp ? isl_upoly_is_one(qp->upoly) : -1;
380 }
381
382 int isl_qpolynomial_is_nan(__isl_keep isl_qpolynomial *qp)
383 {
384 return qp ? isl_upoly_is_nan(qp->upoly) : -1;
385 }
386
387 int isl_qpolynomial_is_infty(__isl_keep isl_qpolynomial *qp)
388 {
389 return qp ? isl_upoly_is_infty(qp->upoly) : -1;
390 }
391
392 int isl_qpolynomial_is_neginfty(__isl_keep isl_qpolynomial *qp)
393 {
394 return qp ? isl_upoly_is_neginfty(qp->upoly) : -1;
395 }
396
397 int isl_qpolynomial_sgn(__isl_keep isl_qpolynomial *qp)
398 {
399 return qp ? isl_upoly_sgn(qp->upoly) : 0;
400 }
401
402 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
403 {
404 isl_int_clear(cst->n);
405 isl_int_clear(cst->d);
406 }
407
408 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
409 {
410 int i;
411
412 for (i = 0; i < rec->n; ++i)
413 isl_upoly_free(rec->p[i]);
414 }
415
416 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
417 {
418 if (!up)
419 return NULL;
420
421 up->ref++;
422 return up;
423 }
424
425 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
426 {
427 struct isl_upoly_cst *cst;
428 struct isl_upoly_cst *dup;
429
430 cst = isl_upoly_as_cst(up);
431 if (!cst)
432 return NULL;
433
434 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
435 if (!dup)
436 return NULL;
437 isl_int_set(dup->n, cst->n);
438 isl_int_set(dup->d, cst->d);
439
440 return &dup->up;
441 }
442
443 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
444 {
445 int i;
446 struct isl_upoly_rec *rec;
447 struct isl_upoly_rec *dup;
448
449 rec = isl_upoly_as_rec(up);
450 if (!rec)
451 return NULL;
452
453 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
454 if (!dup)
455 return NULL;
456
457 for (i = 0; i < rec->n; ++i) {
458 dup->p[i] = isl_upoly_copy(rec->p[i]);
459 if (!dup->p[i])
460 goto error;
461 dup->n++;
462 }
463
464 return &dup->up;
465 error:
466 isl_upoly_free(&dup->up);
467 return NULL;
468 }
469
470 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
471 {
472 struct isl_upoly *dup;
473
474 if (!up)
475 return NULL;
476
477 if (isl_upoly_is_cst(up))
478 return isl_upoly_dup_cst(up);
479 else
480 return isl_upoly_dup_rec(up);
481 }
482
483 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
484 {
485 if (!up)
486 return NULL;
487
488 if (up->ref == 1)
489 return up;
490 up->ref--;
491 return isl_upoly_dup(up);
492 }
493
494 void isl_upoly_free(__isl_take struct isl_upoly *up)
495 {
496 if (!up)
497 return;
498
499 if (--up->ref > 0)
500 return;
501
502 if (up->var < 0)
503 upoly_free_cst((struct isl_upoly_cst *)up);
504 else
505 upoly_free_rec((struct isl_upoly_rec *)up);
506
507 isl_ctx_deref(up->ctx);
508 free(up);
509 }
510
511 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
512 {
513 isl_int gcd;
514
515 isl_int_init(gcd);
516 isl_int_gcd(gcd, cst->n, cst->d);
517 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
518 isl_int_divexact(cst->n, cst->n, gcd);
519 isl_int_divexact(cst->d, cst->d, gcd);
520 }
521 isl_int_clear(gcd);
522 }
523
524 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
525 __isl_take struct isl_upoly *up2)
526 {
527 struct isl_upoly_cst *cst1;
528 struct isl_upoly_cst *cst2;
529
530 up1 = isl_upoly_cow(up1);
531 if (!up1 || !up2)
532 goto error;
533
534 cst1 = isl_upoly_as_cst(up1);
535 cst2 = isl_upoly_as_cst(up2);
536
537 if (isl_int_eq(cst1->d, cst2->d))
538 isl_int_add(cst1->n, cst1->n, cst2->n);
539 else {
540 isl_int_mul(cst1->n, cst1->n, cst2->d);
541 isl_int_addmul(cst1->n, cst2->n, cst1->d);
542 isl_int_mul(cst1->d, cst1->d, cst2->d);
543 }
544
545 isl_upoly_cst_reduce(cst1);
546
547 isl_upoly_free(up2);
548 return up1;
549 error:
550 isl_upoly_free(up1);
551 isl_upoly_free(up2);
552 return NULL;
553 }
554
555 static __isl_give struct isl_upoly *replace_by_zero(
556 __isl_take struct isl_upoly *up)
557 {
558 struct isl_ctx *ctx;
559
560 if (!up)
561 return NULL;
562 ctx = up->ctx;
563 isl_upoly_free(up);
564 return isl_upoly_zero(ctx);
565 }
566
567 static __isl_give struct isl_upoly *replace_by_constant_term(
568 __isl_take struct isl_upoly *up)
569 {
570 struct isl_upoly_rec *rec;
571 struct isl_upoly *cst;
572
573 if (!up)
574 return NULL;
575
576 rec = isl_upoly_as_rec(up);
577 if (!rec)
578 goto error;
579 cst = isl_upoly_copy(rec->p[0]);
580 isl_upoly_free(up);
581 return cst;
582 error:
583 isl_upoly_free(up);
584 return NULL;
585 }
586
587 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
588 __isl_take struct isl_upoly *up2)
589 {
590 int i;
591 struct isl_upoly_rec *rec1, *rec2;
592
593 if (!up1 || !up2)
594 goto error;
595
596 if (isl_upoly_is_nan(up1)) {
597 isl_upoly_free(up2);
598 return up1;
599 }
600
601 if (isl_upoly_is_nan(up2)) {
602 isl_upoly_free(up1);
603 return up2;
604 }
605
606 if (isl_upoly_is_zero(up1)) {
607 isl_upoly_free(up1);
608 return up2;
609 }
610
611 if (isl_upoly_is_zero(up2)) {
612 isl_upoly_free(up2);
613 return up1;
614 }
615
616 if (up1->var < up2->var)
617 return isl_upoly_sum(up2, up1);
618
619 if (up2->var < up1->var) {
620 struct isl_upoly_rec *rec;
621 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
622 isl_upoly_free(up1);
623 return up2;
624 }
625 up1 = isl_upoly_cow(up1);
626 rec = isl_upoly_as_rec(up1);
627 if (!rec)
628 goto error;
629 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
630 if (rec->n == 1)
631 up1 = replace_by_constant_term(up1);
632 return up1;
633 }
634
635 if (isl_upoly_is_cst(up1))
636 return isl_upoly_sum_cst(up1, up2);
637
638 rec1 = isl_upoly_as_rec(up1);
639 rec2 = isl_upoly_as_rec(up2);
640 if (!rec1 || !rec2)
641 goto error;
642
643 if (rec1->n < rec2->n)
644 return isl_upoly_sum(up2, up1);
645
646 up1 = isl_upoly_cow(up1);
647 rec1 = isl_upoly_as_rec(up1);
648 if (!rec1)
649 goto error;
650
651 for (i = rec2->n - 1; i >= 0; --i) {
652 rec1->p[i] = isl_upoly_sum(rec1->p[i],
653 isl_upoly_copy(rec2->p[i]));
654 if (!rec1->p[i])
655 goto error;
656 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
657 isl_upoly_free(rec1->p[i]);
658 rec1->n--;
659 }
660 }
661
662 if (rec1->n == 0)
663 up1 = replace_by_zero(up1);
664 else if (rec1->n == 1)
665 up1 = replace_by_constant_term(up1);
666
667 isl_upoly_free(up2);
668
669 return up1;
670 error:
671 isl_upoly_free(up1);
672 isl_upoly_free(up2);
673 return NULL;
674 }
675
676 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
677 {
678 struct isl_upoly_cst *cst;
679
680 if (isl_upoly_is_zero(up))
681 return up;
682
683 up = isl_upoly_cow(up);
684 if (!up)
685 return NULL;
686
687 cst = isl_upoly_as_cst(up);
688
689 isl_int_neg(cst->n, cst->n);
690
691 return up;
692 }
693
694 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
695 {
696 int i;
697 struct isl_upoly_rec *rec;
698
699 if (!up)
700 return NULL;
701
702 if (isl_upoly_is_cst(up))
703 return isl_upoly_neg_cst(up);
704
705 up = isl_upoly_cow(up);
706 rec = isl_upoly_as_rec(up);
707 if (!rec)
708 goto error;
709
710 for (i = 0; i < rec->n; ++i) {
711 rec->p[i] = isl_upoly_neg(rec->p[i]);
712 if (!rec->p[i])
713 goto error;
714 }
715
716 return up;
717 error:
718 isl_upoly_free(up);
719 return NULL;
720 }
721
722 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
723 __isl_take struct isl_upoly *up2)
724 {
725 struct isl_upoly_cst *cst1;
726 struct isl_upoly_cst *cst2;
727
728 up1 = isl_upoly_cow(up1);
729 if (!up1 || !up2)
730 goto error;
731
732 cst1 = isl_upoly_as_cst(up1);
733 cst2 = isl_upoly_as_cst(up2);
734
735 isl_int_mul(cst1->n, cst1->n, cst2->n);
736 isl_int_mul(cst1->d, cst1->d, cst2->d);
737
738 isl_upoly_cst_reduce(cst1);
739
740 isl_upoly_free(up2);
741 return up1;
742 error:
743 isl_upoly_free(up1);
744 isl_upoly_free(up2);
745 return NULL;
746 }
747
748 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
749 __isl_take struct isl_upoly *up2)
750 {
751 struct isl_upoly_rec *rec1;
752 struct isl_upoly_rec *rec2;
753 struct isl_upoly_rec *res;
754 int i, j;
755 int size;
756
757 rec1 = isl_upoly_as_rec(up1);
758 rec2 = isl_upoly_as_rec(up2);
759 if (!rec1 || !rec2)
760 goto error;
761 size = rec1->n + rec2->n - 1;
762 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
763 if (!res)
764 goto error;
765
766 for (i = 0; i < rec1->n; ++i) {
767 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
768 isl_upoly_copy(rec1->p[i]));
769 if (!res->p[i])
770 goto error;
771 res->n++;
772 }
773 for (; i < size; ++i) {
774 res->p[i] = isl_upoly_zero(up1->ctx);
775 if (!res->p[i])
776 goto error;
777 res->n++;
778 }
779 for (i = 0; i < rec1->n; ++i) {
780 for (j = 1; j < rec2->n; ++j) {
781 struct isl_upoly *up;
782 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
783 isl_upoly_copy(rec1->p[i]));
784 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
785 if (!res->p[i + j])
786 goto error;
787 }
788 }
789
790 isl_upoly_free(up1);
791 isl_upoly_free(up2);
792
793 return &res->up;
794 error:
795 isl_upoly_free(up1);
796 isl_upoly_free(up2);
797 isl_upoly_free(&res->up);
798 return NULL;
799 }
800
801 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
802 __isl_take struct isl_upoly *up2)
803 {
804 if (!up1 || !up2)
805 goto error;
806
807 if (isl_upoly_is_nan(up1)) {
808 isl_upoly_free(up2);
809 return up1;
810 }
811
812 if (isl_upoly_is_nan(up2)) {
813 isl_upoly_free(up1);
814 return up2;
815 }
816
817 if (isl_upoly_is_zero(up1)) {
818 isl_upoly_free(up2);
819 return up1;
820 }
821
822 if (isl_upoly_is_zero(up2)) {
823 isl_upoly_free(up1);
824 return up2;
825 }
826
827 if (isl_upoly_is_one(up1)) {
828 isl_upoly_free(up1);
829 return up2;
830 }
831
832 if (isl_upoly_is_one(up2)) {
833 isl_upoly_free(up2);
834 return up1;
835 }
836
837 if (up1->var < up2->var)
838 return isl_upoly_mul(up2, up1);
839
840 if (up2->var < up1->var) {
841 int i;
842 struct isl_upoly_rec *rec;
843 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
844 isl_ctx *ctx = up1->ctx;
845 isl_upoly_free(up1);
846 isl_upoly_free(up2);
847 return isl_upoly_nan(ctx);
848 }
849 up1 = isl_upoly_cow(up1);
850 rec = isl_upoly_as_rec(up1);
851 if (!rec)
852 goto error;
853
854 for (i = 0; i < rec->n; ++i) {
855 rec->p[i] = isl_upoly_mul(rec->p[i],
856 isl_upoly_copy(up2));
857 if (!rec->p[i])
858 goto error;
859 }
860 isl_upoly_free(up2);
861 return up1;
862 }
863
864 if (isl_upoly_is_cst(up1))
865 return isl_upoly_mul_cst(up1, up2);
866
867 return isl_upoly_mul_rec(up1, up2);
868 error:
869 isl_upoly_free(up1);
870 isl_upoly_free(up2);
871 return NULL;
872 }
873
874 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
875 unsigned n_div, __isl_take struct isl_upoly *up)
876 {
877 struct isl_qpolynomial *qp = NULL;
878 unsigned total;
879
880 if (!dim || !up)
881 goto error;
882
883 total = isl_dim_total(dim);
884
885 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
886 if (!qp)
887 goto error;
888
889 qp->ref = 1;
890 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
891 if (!qp->div)
892 goto error;
893
894 qp->dim = dim;
895 qp->upoly = up;
896
897 return qp;
898 error:
899 isl_dim_free(dim);
900 isl_upoly_free(up);
901 isl_qpolynomial_free(qp);
902 return NULL;
903 }
904
905 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
906 {
907 if (!qp)
908 return NULL;
909
910 qp->ref++;
911 return qp;
912 }
913
914 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
915 {
916 struct isl_qpolynomial *dup;
917
918 if (!qp)
919 return NULL;
920
921 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row,
922 isl_upoly_copy(qp->upoly));
923 if (!dup)
924 return NULL;
925 isl_mat_free(dup->div);
926 dup->div = isl_mat_copy(qp->div);
927 if (!dup->div)
928 goto error;
929
930 return dup;
931 error:
932 isl_qpolynomial_free(dup);
933 return NULL;
934 }
935
936 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
937 {
938 if (!qp)
939 return NULL;
940
941 if (qp->ref == 1)
942 return qp;
943 qp->ref--;
944 return isl_qpolynomial_dup(qp);
945 }
946
947 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
948 {
949 if (!qp)
950 return;
951
952 if (--qp->ref > 0)
953 return;
954
955 isl_dim_free(qp->dim);
956 isl_mat_free(qp->div);
957 isl_upoly_free(qp->upoly);
958
959 free(qp);
960 }
961
962 __isl_give struct isl_upoly *isl_upoly_pow(isl_ctx *ctx, int pos, int power)
963 {
964 int i;
965 struct isl_upoly *up;
966 struct isl_upoly_rec *rec;
967 struct isl_upoly_cst *cst;
968
969 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
970 if (!rec)
971 return NULL;
972 for (i = 0; i < 1 + power; ++i) {
973 rec->p[i] = isl_upoly_zero(ctx);
974 if (!rec->p[i])
975 goto error;
976 rec->n++;
977 }
978 cst = isl_upoly_as_cst(rec->p[power]);
979 isl_int_set_si(cst->n, 1);
980
981 return &rec->up;
982 error:
983 isl_upoly_free(&rec->up);
984 return NULL;
985 }
986
987 /* r array maps original positions to new positions.
988 */
989 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
990 int *r)
991 {
992 int i;
993 struct isl_upoly_rec *rec;
994 struct isl_upoly *base;
995 struct isl_upoly *res;
996
997 if (isl_upoly_is_cst(up))
998 return up;
999
1000 rec = isl_upoly_as_rec(up);
1001 if (!rec)
1002 goto error;
1003
1004 isl_assert(up->ctx, rec->n >= 1, goto error);
1005
1006 base = isl_upoly_pow(up->ctx, r[up->var], 1);
1007 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
1008
1009 for (i = rec->n - 2; i >= 0; --i) {
1010 res = isl_upoly_mul(res, isl_upoly_copy(base));
1011 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
1012 }
1013
1014 isl_upoly_free(base);
1015 isl_upoly_free(up);
1016
1017 return res;
1018 error:
1019 isl_upoly_free(up);
1020 return NULL;
1021 }
1022
1023 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
1024 {
1025 int n_row, n_col;
1026 int equal;
1027
1028 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1029 div1->n_col >= div2->n_col, return -1);
1030
1031 if (div1->n_row == div2->n_row)
1032 return isl_mat_is_equal(div1, div2);
1033
1034 n_row = div1->n_row;
1035 n_col = div1->n_col;
1036 div1->n_row = div2->n_row;
1037 div1->n_col = div2->n_col;
1038
1039 equal = isl_mat_is_equal(div1, div2);
1040
1041 div1->n_row = n_row;
1042 div1->n_col = n_col;
1043
1044 return equal;
1045 }
1046
1047 static void expand_row(__isl_keep isl_mat *dst, int d,
1048 __isl_keep isl_mat *src, int s, int *exp)
1049 {
1050 int i;
1051 unsigned c = src->n_col - src->n_row;
1052
1053 isl_seq_cpy(dst->row[d], src->row[s], c);
1054 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
1055
1056 for (i = 0; i < s; ++i)
1057 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
1058 }
1059
1060 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
1061 {
1062 int li, lj;
1063
1064 li = isl_seq_last_non_zero(div->row[i], div->n_col);
1065 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
1066
1067 if (li != lj)
1068 return li - lj;
1069
1070 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
1071 }
1072
1073 struct isl_div_sort_info {
1074 isl_mat *div;
1075 int row;
1076 };
1077
1078 static int div_sort_cmp(const void *p1, const void *p2)
1079 {
1080 const struct isl_div_sort_info *i1, *i2;
1081 i1 = (const struct isl_div_sort_info *) p1;
1082 i2 = (const struct isl_div_sort_info *) p2;
1083
1084 return cmp_row(i1->div, i1->row, i2->row);
1085 }
1086
1087 /* Sort divs and remove duplicates.
1088 */
1089 static __isl_give isl_qpolynomial *sort_divs(__isl_take isl_qpolynomial *qp)
1090 {
1091 int i;
1092 int skip;
1093 int len;
1094 struct isl_div_sort_info *array = NULL;
1095 int *pos = NULL, *at = NULL;
1096 int *reordering = NULL;
1097 unsigned div_pos;
1098
1099 if (!qp)
1100 return NULL;
1101 if (qp->div->n_row <= 1)
1102 return qp;
1103
1104 div_pos = isl_dim_total(qp->dim);
1105
1106 array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info,
1107 qp->div->n_row);
1108 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1109 at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1110 len = qp->div->n_col - 2;
1111 reordering = isl_alloc_array(qp->div->ctx, int, len);
1112 if (!array || !pos || !at || !reordering)
1113 goto error;
1114
1115 for (i = 0; i < qp->div->n_row; ++i) {
1116 array[i].div = qp->div;
1117 array[i].row = i;
1118 pos[i] = i;
1119 at[i] = i;
1120 }
1121
1122 qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
1123 div_sort_cmp);
1124
1125 for (i = 0; i < div_pos; ++i)
1126 reordering[i] = i;
1127
1128 for (i = 0; i < qp->div->n_row; ++i) {
1129 if (pos[array[i].row] == i)
1130 continue;
1131 qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]);
1132 pos[at[i]] = pos[array[i].row];
1133 at[pos[array[i].row]] = at[i];
1134 at[i] = array[i].row;
1135 pos[array[i].row] = i;
1136 }
1137
1138 skip = 0;
1139 for (i = 0; i < len - div_pos; ++i) {
1140 if (i > 0 &&
1141 isl_seq_eq(qp->div->row[i - skip - 1],
1142 qp->div->row[i - skip], qp->div->n_col)) {
1143 qp->div = isl_mat_drop_rows(qp->div, i - skip, 1);
1144 qp->div = isl_mat_drop_cols(qp->div,
1145 2 + div_pos + i - skip, 1);
1146 skip++;
1147 }
1148 reordering[div_pos + array[i].row] = div_pos + i - skip;
1149 }
1150
1151 qp->upoly = reorder(qp->upoly, reordering);
1152
1153 if (!qp->upoly || !qp->div)
1154 goto error;
1155
1156 free(at);
1157 free(pos);
1158 free(array);
1159 free(reordering);
1160
1161 return qp;
1162 error:
1163 free(at);
1164 free(pos);
1165 free(array);
1166 free(reordering);
1167 isl_qpolynomial_free(qp);
1168 return NULL;
1169 }
1170
1171 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
1172 __isl_keep isl_mat *div2, int *exp1, int *exp2)
1173 {
1174 int i, j, k;
1175 isl_mat *div = NULL;
1176 unsigned d = div1->n_col - div1->n_row;
1177
1178 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
1179 d + div1->n_row + div2->n_row);
1180 if (!div)
1181 return NULL;
1182
1183 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
1184 int cmp;
1185
1186 expand_row(div, k, div1, i, exp1);
1187 expand_row(div, k + 1, div2, j, exp2);
1188
1189 cmp = cmp_row(div, k, k + 1);
1190 if (cmp == 0) {
1191 exp1[i++] = k;
1192 exp2[j++] = k;
1193 } else if (cmp < 0) {
1194 exp1[i++] = k;
1195 } else {
1196 exp2[j++] = k;
1197 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1198 }
1199 }
1200 for (; i < div1->n_row; ++i, ++k) {
1201 expand_row(div, k, div1, i, exp1);
1202 exp1[i] = k;
1203 }
1204 for (; j < div2->n_row; ++j, ++k) {
1205 expand_row(div, k, div2, j, exp2);
1206 exp2[j] = k;
1207 }
1208
1209 div->n_row = k;
1210 div->n_col = d + k;
1211
1212 return div;
1213 }
1214
1215 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1216 int *exp, int first)
1217 {
1218 int i;
1219 struct isl_upoly_rec *rec;
1220
1221 if (isl_upoly_is_cst(up))
1222 return up;
1223
1224 if (up->var < first)
1225 return up;
1226
1227 if (exp[up->var - first] == up->var - first)
1228 return up;
1229
1230 up = isl_upoly_cow(up);
1231 if (!up)
1232 goto error;
1233
1234 up->var = exp[up->var - first] + first;
1235
1236 rec = isl_upoly_as_rec(up);
1237 if (!rec)
1238 goto error;
1239
1240 for (i = 0; i < rec->n; ++i) {
1241 rec->p[i] = expand(rec->p[i], exp, first);
1242 if (!rec->p[i])
1243 goto error;
1244 }
1245
1246 return up;
1247 error:
1248 isl_upoly_free(up);
1249 return NULL;
1250 }
1251
1252 static __isl_give isl_qpolynomial *with_merged_divs(
1253 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1254 __isl_take isl_qpolynomial *qp2),
1255 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1256 {
1257 int *exp1 = NULL;
1258 int *exp2 = NULL;
1259 isl_mat *div = NULL;
1260
1261 qp1 = isl_qpolynomial_cow(qp1);
1262 qp2 = isl_qpolynomial_cow(qp2);
1263
1264 if (!qp1 || !qp2)
1265 goto error;
1266
1267 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1268 qp1->div->n_col >= qp2->div->n_col, goto error);
1269
1270 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1271 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1272 if (!exp1 || !exp2)
1273 goto error;
1274
1275 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1276 if (!div)
1277 goto error;
1278
1279 isl_mat_free(qp1->div);
1280 qp1->div = isl_mat_copy(div);
1281 isl_mat_free(qp2->div);
1282 qp2->div = isl_mat_copy(div);
1283
1284 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1285 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1286
1287 if (!qp1->upoly || !qp2->upoly)
1288 goto error;
1289
1290 isl_mat_free(div);
1291 free(exp1);
1292 free(exp2);
1293
1294 return fn(qp1, qp2);
1295 error:
1296 isl_mat_free(div);
1297 free(exp1);
1298 free(exp2);
1299 isl_qpolynomial_free(qp1);
1300 isl_qpolynomial_free(qp2);
1301 return NULL;
1302 }
1303
1304 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1305 __isl_take isl_qpolynomial *qp2)
1306 {
1307 qp1 = isl_qpolynomial_cow(qp1);
1308
1309 if (!qp1 || !qp2)
1310 goto error;
1311
1312 if (qp1->div->n_row < qp2->div->n_row)
1313 return isl_qpolynomial_add(qp2, qp1);
1314
1315 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1316 if (!compatible_divs(qp1->div, qp2->div))
1317 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1318
1319 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1320 if (!qp1->upoly)
1321 goto error;
1322
1323 isl_qpolynomial_free(qp2);
1324
1325 return qp1;
1326 error:
1327 isl_qpolynomial_free(qp1);
1328 isl_qpolynomial_free(qp2);
1329 return NULL;
1330 }
1331
1332 __isl_give isl_qpolynomial *isl_qpolynomial_add_on_domain(
1333 __isl_keep isl_set *dom,
1334 __isl_take isl_qpolynomial *qp1,
1335 __isl_take isl_qpolynomial *qp2)
1336 {
1337 return isl_qpolynomial_add(qp1, qp2);
1338 }
1339
1340 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1341 __isl_take isl_qpolynomial *qp2)
1342 {
1343 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1344 }
1345
1346 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1347 {
1348 qp = isl_qpolynomial_cow(qp);
1349
1350 if (!qp)
1351 return NULL;
1352
1353 qp->upoly = isl_upoly_neg(qp->upoly);
1354 if (!qp->upoly)
1355 goto error;
1356
1357 return qp;
1358 error:
1359 isl_qpolynomial_free(qp);
1360 return NULL;
1361 }
1362
1363 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1364 __isl_take isl_qpolynomial *qp2)
1365 {
1366 qp1 = isl_qpolynomial_cow(qp1);
1367
1368 if (!qp1 || !qp2)
1369 goto error;
1370
1371 if (qp1->div->n_row < qp2->div->n_row)
1372 return isl_qpolynomial_mul(qp2, qp1);
1373
1374 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1375 if (!compatible_divs(qp1->div, qp2->div))
1376 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1377
1378 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1379 if (!qp1->upoly)
1380 goto error;
1381
1382 isl_qpolynomial_free(qp2);
1383
1384 return qp1;
1385 error:
1386 isl_qpolynomial_free(qp1);
1387 isl_qpolynomial_free(qp2);
1388 return NULL;
1389 }
1390
1391 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1392 {
1393 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1394 }
1395
1396 __isl_give isl_qpolynomial *isl_qpolynomial_one(__isl_take isl_dim *dim)
1397 {
1398 return isl_qpolynomial_alloc(dim, 0, isl_upoly_one(dim->ctx));
1399 }
1400
1401 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1402 {
1403 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1404 }
1405
1406 __isl_give isl_qpolynomial *isl_qpolynomial_neginfty(__isl_take isl_dim *dim)
1407 {
1408 return isl_qpolynomial_alloc(dim, 0, isl_upoly_neginfty(dim->ctx));
1409 }
1410
1411 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1412 {
1413 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1414 }
1415
1416 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1417 isl_int v)
1418 {
1419 struct isl_qpolynomial *qp;
1420 struct isl_upoly_cst *cst;
1421
1422 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1423 if (!qp)
1424 return NULL;
1425
1426 cst = isl_upoly_as_cst(qp->upoly);
1427 isl_int_set(cst->n, v);
1428
1429 return qp;
1430 }
1431
1432 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1433 isl_int *n, isl_int *d)
1434 {
1435 struct isl_upoly_cst *cst;
1436
1437 if (!qp)
1438 return -1;
1439
1440 if (!isl_upoly_is_cst(qp->upoly))
1441 return 0;
1442
1443 cst = isl_upoly_as_cst(qp->upoly);
1444 if (!cst)
1445 return -1;
1446
1447 if (n)
1448 isl_int_set(*n, cst->n);
1449 if (d)
1450 isl_int_set(*d, cst->d);
1451
1452 return 1;
1453 }
1454
1455 int isl_upoly_is_affine(__isl_keep struct isl_upoly *up)
1456 {
1457 int is_cst;
1458 struct isl_upoly_rec *rec;
1459
1460 if (!up)
1461 return -1;
1462
1463 if (up->var < 0)
1464 return 1;
1465
1466 rec = isl_upoly_as_rec(up);
1467 if (!rec)
1468 return -1;
1469
1470 if (rec->n > 2)
1471 return 0;
1472
1473 isl_assert(up->ctx, rec->n > 1, return -1);
1474
1475 is_cst = isl_upoly_is_cst(rec->p[1]);
1476 if (is_cst < 0)
1477 return -1;
1478 if (!is_cst)
1479 return 0;
1480
1481 return isl_upoly_is_affine(rec->p[0]);
1482 }
1483
1484 int isl_qpolynomial_is_affine(__isl_keep isl_qpolynomial *qp)
1485 {
1486 if (!qp)
1487 return -1;
1488
1489 if (qp->div->n_row > 0)
1490 return 0;
1491
1492 return isl_upoly_is_affine(qp->upoly);
1493 }
1494
1495 static void update_coeff(__isl_keep isl_vec *aff,
1496 __isl_keep struct isl_upoly_cst *cst, int pos)
1497 {
1498 isl_int gcd;
1499 isl_int f;
1500
1501 if (isl_int_is_zero(cst->n))
1502 return;
1503
1504 isl_int_init(gcd);
1505 isl_int_init(f);
1506 isl_int_gcd(gcd, cst->d, aff->el[0]);
1507 isl_int_divexact(f, cst->d, gcd);
1508 isl_int_divexact(gcd, aff->el[0], gcd);
1509 isl_seq_scale(aff->el, aff->el, f, aff->size);
1510 isl_int_mul(aff->el[1 + pos], gcd, cst->n);
1511 isl_int_clear(gcd);
1512 isl_int_clear(f);
1513 }
1514
1515 int isl_upoly_update_affine(__isl_keep struct isl_upoly *up,
1516 __isl_keep isl_vec *aff)
1517 {
1518 struct isl_upoly_cst *cst;
1519 struct isl_upoly_rec *rec;
1520
1521 if (!up || !aff)
1522 return -1;
1523
1524 if (up->var < 0) {
1525 struct isl_upoly_cst *cst;
1526
1527 cst = isl_upoly_as_cst(up);
1528 if (!cst)
1529 return -1;
1530 update_coeff(aff, cst, 0);
1531 return 0;
1532 }
1533
1534 rec = isl_upoly_as_rec(up);
1535 if (!rec)
1536 return -1;
1537 isl_assert(up->ctx, rec->n == 2, return -1);
1538
1539 cst = isl_upoly_as_cst(rec->p[1]);
1540 if (!cst)
1541 return -1;
1542 update_coeff(aff, cst, 1 + up->var);
1543
1544 return isl_upoly_update_affine(rec->p[0], aff);
1545 }
1546
1547 __isl_give isl_vec *isl_qpolynomial_extract_affine(
1548 __isl_keep isl_qpolynomial *qp)
1549 {
1550 isl_vec *aff;
1551 unsigned d;
1552
1553 if (!qp)
1554 return NULL;
1555
1556 isl_assert(qp->div->ctx, qp->div->n_row == 0, return NULL);
1557 d = isl_dim_total(qp->dim);
1558 aff = isl_vec_alloc(qp->div->ctx, 2 + d);
1559 if (!aff)
1560 return NULL;
1561
1562 isl_seq_clr(aff->el + 1, 1 + d);
1563 isl_int_set_si(aff->el[0], 1);
1564
1565 if (isl_upoly_update_affine(qp->upoly, aff) < 0)
1566 goto error;
1567
1568 return aff;
1569 error:
1570 isl_vec_free(aff);
1571 return NULL;
1572 }
1573
1574 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1575 __isl_keep isl_qpolynomial *qp2)
1576 {
1577 if (!qp1 || !qp2)
1578 return -1;
1579
1580 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1581 }
1582
1583 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1584 {
1585 int i;
1586 struct isl_upoly_rec *rec;
1587
1588 if (isl_upoly_is_cst(up)) {
1589 struct isl_upoly_cst *cst;
1590 cst = isl_upoly_as_cst(up);
1591 if (!cst)
1592 return;
1593 isl_int_lcm(*d, *d, cst->d);
1594 return;
1595 }
1596
1597 rec = isl_upoly_as_rec(up);
1598 if (!rec)
1599 return;
1600
1601 for (i = 0; i < rec->n; ++i)
1602 upoly_update_den(rec->p[i], d);
1603 }
1604
1605 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1606 {
1607 isl_int_set_si(*d, 1);
1608 if (!qp)
1609 return;
1610 upoly_update_den(qp->upoly, d);
1611 }
1612
1613 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1614 int pos, int power)
1615 {
1616 struct isl_ctx *ctx;
1617
1618 if (!dim)
1619 return NULL;
1620
1621 ctx = dim->ctx;
1622
1623 return isl_qpolynomial_alloc(dim, 0, isl_upoly_pow(ctx, pos, power));
1624 }
1625
1626 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1627 enum isl_dim_type type, unsigned pos)
1628 {
1629 if (!dim)
1630 return NULL;
1631
1632 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1633 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1634
1635 if (type == isl_dim_set)
1636 pos += isl_dim_size(dim, isl_dim_param);
1637
1638 return isl_qpolynomial_pow(dim, pos, 1);
1639 error:
1640 isl_dim_free(dim);
1641 return NULL;
1642 }
1643
1644 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1645 int power)
1646 {
1647 struct isl_qpolynomial *qp = NULL;
1648 struct isl_upoly_rec *rec;
1649 struct isl_upoly_cst *cst;
1650 int i;
1651 int pos;
1652
1653 if (!div)
1654 return NULL;
1655 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1656
1657 pos = isl_dim_total(div->bmap->dim);
1658 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
1659 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1,
1660 &rec->up);
1661 if (!qp)
1662 goto error;
1663
1664 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1665 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1666
1667 for (i = 0; i < 1 + power; ++i) {
1668 rec->p[i] = isl_upoly_zero(div->ctx);
1669 if (!rec->p[i])
1670 goto error;
1671 rec->n++;
1672 }
1673 cst = isl_upoly_as_cst(rec->p[power]);
1674 isl_int_set_si(cst->n, 1);
1675
1676 isl_div_free(div);
1677
1678 return qp;
1679 error:
1680 isl_qpolynomial_free(qp);
1681 isl_div_free(div);
1682 return NULL;
1683 }
1684
1685 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1686 {
1687 return isl_qpolynomial_div_pow(div, 1);
1688 }
1689
1690 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1691 const isl_int n, const isl_int d)
1692 {
1693 struct isl_qpolynomial *qp;
1694 struct isl_upoly_cst *cst;
1695
1696 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1697 if (!qp)
1698 return NULL;
1699
1700 cst = isl_upoly_as_cst(qp->upoly);
1701 isl_int_set(cst->n, n);
1702 isl_int_set(cst->d, d);
1703
1704 return qp;
1705 }
1706
1707 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1708 {
1709 struct isl_upoly_rec *rec;
1710 int i;
1711
1712 if (!up)
1713 return -1;
1714
1715 if (isl_upoly_is_cst(up))
1716 return 0;
1717
1718 if (up->var < d)
1719 active[up->var] = 1;
1720
1721 rec = isl_upoly_as_rec(up);
1722 for (i = 0; i < rec->n; ++i)
1723 if (up_set_active(rec->p[i], active, d) < 0)
1724 return -1;
1725
1726 return 0;
1727 }
1728
1729 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1730 {
1731 int i, j;
1732 int d = isl_dim_total(qp->dim);
1733
1734 if (!qp || !active)
1735 return -1;
1736
1737 for (i = 0; i < d; ++i)
1738 for (j = 0; j < qp->div->n_row; ++j) {
1739 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1740 continue;
1741 active[i] = 1;
1742 break;
1743 }
1744
1745 return up_set_active(qp->upoly, active, d);
1746 }
1747
1748 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1749 enum isl_dim_type type, unsigned first, unsigned n)
1750 {
1751 int i;
1752 int *active = NULL;
1753 int involves = 0;
1754
1755 if (!qp)
1756 return -1;
1757 if (n == 0)
1758 return 0;
1759
1760 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1761 return -1);
1762 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1763 type == isl_dim_set, return -1);
1764
1765 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1766 if (set_active(qp, active) < 0)
1767 goto error;
1768
1769 if (type == isl_dim_set)
1770 first += isl_dim_size(qp->dim, isl_dim_param);
1771 for (i = 0; i < n; ++i)
1772 if (active[first + i]) {
1773 involves = 1;
1774 break;
1775 }
1776
1777 free(active);
1778
1779 return involves;
1780 error:
1781 free(active);
1782 return -1;
1783 }
1784
1785 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1786 unsigned first, unsigned n)
1787 {
1788 int i;
1789 struct isl_upoly_rec *rec;
1790
1791 if (!up)
1792 return NULL;
1793 if (n == 0 || up->var < 0 || up->var < first)
1794 return up;
1795 if (up->var < first + n) {
1796 up = replace_by_constant_term(up);
1797 return isl_upoly_drop(up, first, n);
1798 }
1799 up = isl_upoly_cow(up);
1800 if (!up)
1801 return NULL;
1802 up->var -= n;
1803 rec = isl_upoly_as_rec(up);
1804 if (!rec)
1805 goto error;
1806
1807 for (i = 0; i < rec->n; ++i) {
1808 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1809 if (!rec->p[i])
1810 goto error;
1811 }
1812
1813 return up;
1814 error:
1815 isl_upoly_free(up);
1816 return NULL;
1817 }
1818
1819 __isl_give isl_qpolynomial *isl_qpolynomial_set_dim_name(
1820 __isl_take isl_qpolynomial *qp,
1821 enum isl_dim_type type, unsigned pos, const char *s)
1822 {
1823 qp = isl_qpolynomial_cow(qp);
1824 if (!qp)
1825 return NULL;
1826 qp->dim = isl_dim_set_name(qp->dim, type, pos, s);
1827 if (!qp->dim)
1828 goto error;
1829 return qp;
1830 error:
1831 isl_qpolynomial_free(qp);
1832 return NULL;
1833 }
1834
1835 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1836 __isl_take isl_qpolynomial *qp,
1837 enum isl_dim_type type, unsigned first, unsigned n)
1838 {
1839 if (!qp)
1840 return NULL;
1841 if (n == 0 && !isl_dim_get_tuple_name(qp->dim, type))
1842 return qp;
1843
1844 qp = isl_qpolynomial_cow(qp);
1845 if (!qp)
1846 return NULL;
1847
1848 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1849 goto error);
1850 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1851 type == isl_dim_set, goto error);
1852
1853 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1854 if (!qp->dim)
1855 goto error;
1856
1857 if (type == isl_dim_set)
1858 first += isl_dim_size(qp->dim, isl_dim_param);
1859
1860 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1861 if (!qp->div)
1862 goto error;
1863
1864 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1865 if (!qp->upoly)
1866 goto error;
1867
1868 return qp;
1869 error:
1870 isl_qpolynomial_free(qp);
1871 return NULL;
1872 }
1873
1874 __isl_give struct isl_upoly *isl_upoly_subs(__isl_take struct isl_upoly *up,
1875 unsigned first, unsigned n, __isl_keep struct isl_upoly **subs)
1876 {
1877 int i;
1878 struct isl_upoly_rec *rec;
1879 struct isl_upoly *base, *res;
1880
1881 if (!up)
1882 return NULL;
1883
1884 if (isl_upoly_is_cst(up))
1885 return up;
1886
1887 if (up->var < first)
1888 return up;
1889
1890 rec = isl_upoly_as_rec(up);
1891 if (!rec)
1892 goto error;
1893
1894 isl_assert(up->ctx, rec->n >= 1, goto error);
1895
1896 if (up->var >= first + n)
1897 base = isl_upoly_pow(up->ctx, up->var, 1);
1898 else
1899 base = isl_upoly_copy(subs[up->var - first]);
1900
1901 res = isl_upoly_subs(isl_upoly_copy(rec->p[rec->n - 1]), first, n, subs);
1902 for (i = rec->n - 2; i >= 0; --i) {
1903 struct isl_upoly *t;
1904 t = isl_upoly_subs(isl_upoly_copy(rec->p[i]), first, n, subs);
1905 res = isl_upoly_mul(res, isl_upoly_copy(base));
1906 res = isl_upoly_sum(res, t);
1907 }
1908
1909 isl_upoly_free(base);
1910 isl_upoly_free(up);
1911
1912 return res;
1913 error:
1914 isl_upoly_free(up);
1915 return NULL;
1916 }
1917
1918 __isl_give struct isl_upoly *isl_upoly_from_affine(isl_ctx *ctx, isl_int *f,
1919 isl_int denom, unsigned len)
1920 {
1921 int i;
1922 struct isl_upoly *up;
1923
1924 isl_assert(ctx, len >= 1, return NULL);
1925
1926 up = isl_upoly_rat_cst(ctx, f[0], denom);
1927 for (i = 0; i < len - 1; ++i) {
1928 struct isl_upoly *t;
1929 struct isl_upoly *c;
1930
1931 if (isl_int_is_zero(f[1 + i]))
1932 continue;
1933
1934 c = isl_upoly_rat_cst(ctx, f[1 + i], denom);
1935 t = isl_upoly_pow(ctx, i, 1);
1936 t = isl_upoly_mul(c, t);
1937 up = isl_upoly_sum(up, t);
1938 }
1939
1940 return up;
1941 }
1942
1943 __isl_give isl_qpolynomial *isl_qpolynomial_substitute_equalities(
1944 __isl_take isl_qpolynomial *qp, __isl_take isl_basic_set *eq)
1945 {
1946 int i, j, k;
1947 isl_int denom;
1948 unsigned total;
1949 struct isl_upoly *up;
1950
1951 if (!eq)
1952 goto error;
1953 if (eq->n_eq == 0) {
1954 isl_basic_set_free(eq);
1955 return qp;
1956 }
1957
1958 qp = isl_qpolynomial_cow(qp);
1959 if (!qp)
1960 goto error;
1961 qp->div = isl_mat_cow(qp->div);
1962 if (!qp->div)
1963 goto error;
1964
1965 total = 1 + isl_dim_total(eq->dim);
1966 isl_int_init(denom);
1967 for (i = 0; i < eq->n_eq; ++i) {
1968 j = isl_seq_last_non_zero(eq->eq[i], total);
1969 if (j < 0 || j == 0)
1970 continue;
1971
1972 for (k = 0; k < qp->div->n_row; ++k) {
1973 if (isl_int_is_zero(qp->div->row[k][1 + j]))
1974 continue;
1975 isl_seq_elim(qp->div->row[k] + 1, eq->eq[i], j, total,
1976 &qp->div->row[k][0]);
1977 isl_seq_normalize(qp->div->ctx,
1978 qp->div->row[k], 1 + total);
1979 }
1980
1981 if (isl_int_is_pos(eq->eq[i][j]))
1982 isl_seq_neg(eq->eq[i], eq->eq[i], total);
1983 isl_int_abs(denom, eq->eq[i][j]);
1984 isl_int_set_si(eq->eq[i][j], 0);
1985
1986 up = isl_upoly_from_affine(qp->dim->ctx,
1987 eq->eq[i], denom, total);
1988 qp->upoly = isl_upoly_subs(qp->upoly, j - 1, 1, &up);
1989 isl_upoly_free(up);
1990 }
1991 isl_int_clear(denom);
1992
1993 if (!qp->upoly)
1994 goto error;
1995
1996 isl_basic_set_free(eq);
1997
1998 qp = sort_divs(qp);
1999
2000 return qp;
2001 error:
2002 isl_basic_set_free(eq);
2003 isl_qpolynomial_free(qp);
2004 return NULL;
2005 }
2006
2007 #undef PW
2008 #define PW isl_pw_qpolynomial
2009 #undef EL
2010 #define EL isl_qpolynomial
2011 #undef IS_ZERO
2012 #define IS_ZERO is_zero
2013 #undef FIELD
2014 #define FIELD qp
2015
2016 #include <isl_pw_templ.c>
2017
2018 #undef UNION
2019 #define UNION isl_union_pw_qpolynomial
2020 #undef PART
2021 #define PART isl_pw_qpolynomial
2022 #undef PARTS
2023 #define PARTS pw_qpolynomial
2024
2025 #include <isl_union_templ.c>
2026
2027 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
2028 {
2029 if (!pwqp)
2030 return -1;
2031
2032 if (pwqp->n != -1)
2033 return 0;
2034
2035 if (!isl_set_fast_is_universe(pwqp->p[0].set))
2036 return 0;
2037
2038 return isl_qpolynomial_is_one(pwqp->p[0].qp);
2039 }
2040
2041 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
2042 __isl_take isl_pw_qpolynomial *pwqp1,
2043 __isl_take isl_pw_qpolynomial *pwqp2)
2044 {
2045 int i, j, n;
2046 struct isl_pw_qpolynomial *res;
2047 isl_set *set;
2048
2049 if (!pwqp1 || !pwqp2)
2050 goto error;
2051
2052 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
2053 goto error);
2054
2055 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
2056 isl_pw_qpolynomial_free(pwqp2);
2057 return pwqp1;
2058 }
2059
2060 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
2061 isl_pw_qpolynomial_free(pwqp1);
2062 return pwqp2;
2063 }
2064
2065 if (isl_pw_qpolynomial_is_one(pwqp1)) {
2066 isl_pw_qpolynomial_free(pwqp1);
2067 return pwqp2;
2068 }
2069
2070 if (isl_pw_qpolynomial_is_one(pwqp2)) {
2071 isl_pw_qpolynomial_free(pwqp2);
2072 return pwqp1;
2073 }
2074
2075 n = pwqp1->n * pwqp2->n;
2076 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
2077
2078 for (i = 0; i < pwqp1->n; ++i) {
2079 for (j = 0; j < pwqp2->n; ++j) {
2080 struct isl_set *common;
2081 struct isl_qpolynomial *prod;
2082 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
2083 isl_set_copy(pwqp2->p[j].set));
2084 if (isl_set_fast_is_empty(common)) {
2085 isl_set_free(common);
2086 continue;
2087 }
2088
2089 prod = isl_qpolynomial_mul(
2090 isl_qpolynomial_copy(pwqp1->p[i].qp),
2091 isl_qpolynomial_copy(pwqp2->p[j].qp));
2092
2093 res = isl_pw_qpolynomial_add_piece(res, common, prod);
2094 }
2095 }
2096
2097 isl_pw_qpolynomial_free(pwqp1);
2098 isl_pw_qpolynomial_free(pwqp2);
2099
2100 return res;
2101 error:
2102 isl_pw_qpolynomial_free(pwqp1);
2103 isl_pw_qpolynomial_free(pwqp2);
2104 return NULL;
2105 }
2106
2107 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
2108 __isl_take isl_pw_qpolynomial *pwqp)
2109 {
2110 int i;
2111
2112 if (!pwqp)
2113 return NULL;
2114
2115 if (isl_pw_qpolynomial_is_zero(pwqp))
2116 return pwqp;
2117
2118 pwqp = isl_pw_qpolynomial_cow(pwqp);
2119 if (!pwqp)
2120 return NULL;
2121
2122 for (i = 0; i < pwqp->n; ++i) {
2123 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
2124 if (!pwqp->p[i].qp)
2125 goto error;
2126 }
2127
2128 return pwqp;
2129 error:
2130 isl_pw_qpolynomial_free(pwqp);
2131 return NULL;
2132 }
2133
2134 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
2135 __isl_take isl_pw_qpolynomial *pwqp1,
2136 __isl_take isl_pw_qpolynomial *pwqp2)
2137 {
2138 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
2139 }
2140
2141 __isl_give struct isl_upoly *isl_upoly_eval(
2142 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
2143 {
2144 int i;
2145 struct isl_upoly_rec *rec;
2146 struct isl_upoly *res;
2147 struct isl_upoly *base;
2148
2149 if (isl_upoly_is_cst(up)) {
2150 isl_vec_free(vec);
2151 return up;
2152 }
2153
2154 rec = isl_upoly_as_rec(up);
2155 if (!rec)
2156 goto error;
2157
2158 isl_assert(up->ctx, rec->n >= 1, goto error);
2159
2160 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
2161
2162 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
2163 isl_vec_copy(vec));
2164
2165 for (i = rec->n - 2; i >= 0; --i) {
2166 res = isl_upoly_mul(res, isl_upoly_copy(base));
2167 res = isl_upoly_sum(res,
2168 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
2169 isl_vec_copy(vec)));
2170 }
2171
2172 isl_upoly_free(base);
2173 isl_upoly_free(up);
2174 isl_vec_free(vec);
2175 return res;
2176 error:
2177 isl_upoly_free(up);
2178 isl_vec_free(vec);
2179 return NULL;
2180 }
2181
2182 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
2183 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
2184 {
2185 isl_vec *ext;
2186 struct isl_upoly *up;
2187 isl_dim *dim;
2188
2189 if (!qp || !pnt)
2190 goto error;
2191 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
2192
2193 if (qp->div->n_row == 0)
2194 ext = isl_vec_copy(pnt->vec);
2195 else {
2196 int i;
2197 unsigned dim = isl_dim_total(qp->dim);
2198 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
2199 if (!ext)
2200 goto error;
2201
2202 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
2203 for (i = 0; i < qp->div->n_row; ++i) {
2204 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
2205 1 + dim + i, &ext->el[1+dim+i]);
2206 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
2207 qp->div->row[i][0]);
2208 }
2209 }
2210
2211 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
2212 if (!up)
2213 goto error;
2214
2215 dim = isl_dim_copy(qp->dim);
2216 isl_qpolynomial_free(qp);
2217 isl_point_free(pnt);
2218
2219 return isl_qpolynomial_alloc(dim, 0, up);
2220 error:
2221 isl_qpolynomial_free(qp);
2222 isl_point_free(pnt);
2223 return NULL;
2224 }
2225
2226 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
2227 __isl_keep struct isl_upoly_cst *cst2)
2228 {
2229 int cmp;
2230 isl_int t;
2231 isl_int_init(t);
2232 isl_int_mul(t, cst1->n, cst2->d);
2233 isl_int_submul(t, cst2->n, cst1->d);
2234 cmp = isl_int_sgn(t);
2235 isl_int_clear(t);
2236 return cmp;
2237 }
2238
2239 int isl_qpolynomial_le_cst(__isl_keep isl_qpolynomial *qp1,
2240 __isl_keep isl_qpolynomial *qp2)
2241 {
2242 struct isl_upoly_cst *cst1, *cst2;
2243
2244 if (!qp1 || !qp2)
2245 return -1;
2246 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), return -1);
2247 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), return -1);
2248 if (isl_qpolynomial_is_nan(qp1))
2249 return -1;
2250 if (isl_qpolynomial_is_nan(qp2))
2251 return -1;
2252 cst1 = isl_upoly_as_cst(qp1->upoly);
2253 cst2 = isl_upoly_as_cst(qp2->upoly);
2254
2255 return isl_upoly_cmp(cst1, cst2) <= 0;
2256 }
2257
2258 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
2259 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2260 {
2261 struct isl_upoly_cst *cst1, *cst2;
2262 int cmp;
2263
2264 if (!qp1 || !qp2)
2265 goto error;
2266 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2267 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2268 cst1 = isl_upoly_as_cst(qp1->upoly);
2269 cst2 = isl_upoly_as_cst(qp2->upoly);
2270 cmp = isl_upoly_cmp(cst1, cst2);
2271
2272 if (cmp <= 0) {
2273 isl_qpolynomial_free(qp2);
2274 } else {
2275 isl_qpolynomial_free(qp1);
2276 qp1 = qp2;
2277 }
2278 return qp1;
2279 error:
2280 isl_qpolynomial_free(qp1);
2281 isl_qpolynomial_free(qp2);
2282 return NULL;
2283 }
2284
2285 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
2286 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
2287 {
2288 struct isl_upoly_cst *cst1, *cst2;
2289 int cmp;
2290
2291 if (!qp1 || !qp2)
2292 goto error;
2293 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
2294 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
2295 cst1 = isl_upoly_as_cst(qp1->upoly);
2296 cst2 = isl_upoly_as_cst(qp2->upoly);
2297 cmp = isl_upoly_cmp(cst1, cst2);
2298
2299 if (cmp >= 0) {
2300 isl_qpolynomial_free(qp2);
2301 } else {
2302 isl_qpolynomial_free(qp1);
2303 qp1 = qp2;
2304 }
2305 return qp1;
2306 error:
2307 isl_qpolynomial_free(qp1);
2308 isl_qpolynomial_free(qp2);
2309 return NULL;
2310 }
2311
2312 __isl_give isl_qpolynomial *isl_qpolynomial_insert_dims(
2313 __isl_take isl_qpolynomial *qp, enum isl_dim_type type,
2314 unsigned first, unsigned n)
2315 {
2316 unsigned total;
2317 unsigned g_pos;
2318 int *exp;
2319
2320 if (n == 0)
2321 return qp;
2322
2323 qp = isl_qpolynomial_cow(qp);
2324 if (!qp)
2325 return NULL;
2326
2327 isl_assert(qp->div->ctx, first <= isl_dim_size(qp->dim, type),
2328 goto error);
2329
2330 g_pos = pos(qp->dim, type) + first;
2331
2332 qp->div = isl_mat_insert_cols(qp->div, 2 + g_pos, n);
2333 if (!qp->div)
2334 goto error;
2335
2336 total = qp->div->n_col - 2;
2337 if (total > g_pos) {
2338 int i;
2339 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos);
2340 if (!exp)
2341 goto error;
2342 for (i = 0; i < total - g_pos; ++i)
2343 exp[i] = i + n;
2344 qp->upoly = expand(qp->upoly, exp, g_pos);
2345 free(exp);
2346 if (!qp->upoly)
2347 goto error;
2348 }
2349
2350 qp->dim = isl_dim_insert(qp->dim, type, first, n);
2351 if (!qp->dim)
2352 goto error;
2353
2354 return qp;
2355 error:
2356 isl_qpolynomial_free(qp);
2357 return NULL;
2358 }
2359
2360 __isl_give isl_qpolynomial *isl_qpolynomial_add_dims(
2361 __isl_take isl_qpolynomial *qp, enum isl_dim_type type, unsigned n)
2362 {
2363 unsigned pos;
2364
2365 pos = isl_qpolynomial_dim(qp, type);
2366
2367 return isl_qpolynomial_insert_dims(qp, type, pos, n);
2368 }
2369
2370 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_add_dims(
2371 __isl_take isl_pw_qpolynomial *pwqp,
2372 enum isl_dim_type type, unsigned n)
2373 {
2374 unsigned pos;
2375
2376 pos = isl_pw_qpolynomial_dim(pwqp, type);
2377
2378 return isl_pw_qpolynomial_insert_dims(pwqp, type, pos, n);
2379 }
2380
2381 static int *reordering_move(isl_ctx *ctx,
2382 unsigned len, unsigned dst, unsigned src, unsigned n)
2383 {
2384 int i;
2385 int *reordering;
2386
2387 reordering = isl_alloc_array(ctx, int, len);
2388 if (!reordering)
2389 return NULL;
2390
2391 if (dst <= src) {
2392 for (i = 0; i < dst; ++i)
2393 reordering[i] = i;
2394 for (i = 0; i < n; ++i)
2395 reordering[src + i] = dst + i;
2396 for (i = 0; i < src - dst; ++i)
2397 reordering[dst + i] = dst + n + i;
2398 for (i = 0; i < len - src - n; ++i)
2399 reordering[src + n + i] = src + n + i;
2400 } else {
2401 for (i = 0; i < src; ++i)
2402 reordering[i] = i;
2403 for (i = 0; i < n; ++i)
2404 reordering[src + i] = dst + i;
2405 for (i = 0; i < dst - src; ++i)
2406 reordering[src + n + i] = src + i;
2407 for (i = 0; i < len - dst - n; ++i)
2408 reordering[dst + n + i] = dst + n + i;
2409 }
2410
2411 return reordering;
2412 }
2413
2414 __isl_give isl_qpolynomial *isl_qpolynomial_move_dims(
2415 __isl_take isl_qpolynomial *qp,
2416 enum isl_dim_type dst_type, unsigned dst_pos,
2417 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2418 {
2419 unsigned g_dst_pos;
2420 unsigned g_src_pos;
2421 int *reordering;
2422
2423 qp = isl_qpolynomial_cow(qp);
2424 if (!qp)
2425 return NULL;
2426
2427 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
2428 goto error);
2429
2430 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
2431 g_src_pos = pos(qp->dim, src_type) + src_pos;
2432 if (dst_type > src_type)
2433 g_dst_pos -= n;
2434
2435 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
2436 if (!qp->div)
2437 goto error;
2438 qp = sort_divs(qp);
2439 if (!qp)
2440 goto error;
2441
2442 reordering = reordering_move(qp->dim->ctx,
2443 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
2444 if (!reordering)
2445 goto error;
2446
2447 qp->upoly = reorder(qp->upoly, reordering);
2448 free(reordering);
2449 if (!qp->upoly)
2450 goto error;
2451
2452 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
2453 if (!qp->dim)
2454 goto error;
2455
2456 return qp;
2457 error:
2458 isl_qpolynomial_free(qp);
2459 return NULL;
2460 }
2461
2462 __isl_give isl_qpolynomial *isl_qpolynomial_from_affine(__isl_take isl_dim *dim,
2463 isl_int *f, isl_int denom)
2464 {
2465 struct isl_upoly *up;
2466
2467 if (!dim)
2468 return NULL;
2469
2470 up = isl_upoly_from_affine(dim->ctx, f, denom, 1 + isl_dim_total(dim));
2471
2472 return isl_qpolynomial_alloc(dim, 0, up);
2473 }
2474
2475 __isl_give isl_qpolynomial *isl_qpolynomial_from_constraint(
2476 __isl_take isl_constraint *c, enum isl_dim_type type, unsigned pos)
2477 {
2478 isl_int denom;
2479 isl_dim *dim;
2480 struct isl_upoly *up;
2481 isl_qpolynomial *qp;
2482 int sgn;
2483
2484 if (!c)
2485 return NULL;
2486
2487 isl_int_init(denom);
2488
2489 isl_constraint_get_coefficient(c, type, pos, &denom);
2490 isl_constraint_set_coefficient(c, type, pos, c->ctx->zero);
2491 sgn = isl_int_sgn(denom);
2492 isl_int_abs(denom, denom);
2493 up = isl_upoly_from_affine(c->ctx, c->line[0], denom,
2494 1 + isl_constraint_dim(c, isl_dim_all));
2495 if (sgn < 0)
2496 isl_int_neg(denom, denom);
2497 isl_constraint_set_coefficient(c, type, pos, denom);
2498
2499 dim = isl_dim_copy(c->bmap->dim);
2500
2501 isl_int_clear(denom);
2502 isl_constraint_free(c);
2503
2504 qp = isl_qpolynomial_alloc(dim, 0, up);
2505 if (sgn > 0)
2506 qp = isl_qpolynomial_neg(qp);
2507 return qp;
2508 }
2509
2510 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
2511 * in "qp" by subs[i].
2512 */
2513 __isl_give isl_qpolynomial *isl_qpolynomial_substitute(
2514 __isl_take isl_qpolynomial *qp,
2515 enum isl_dim_type type, unsigned first, unsigned n,
2516 __isl_keep isl_qpolynomial **subs)
2517 {
2518 int i;
2519 struct isl_upoly **ups;
2520
2521 if (n == 0)
2522 return qp;
2523
2524 qp = isl_qpolynomial_cow(qp);
2525 if (!qp)
2526 return NULL;
2527 for (i = 0; i < n; ++i)
2528 if (!subs[i])
2529 goto error;
2530
2531 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
2532 goto error);
2533
2534 for (i = 0; i < n; ++i)
2535 isl_assert(qp->dim->ctx, isl_dim_equal(qp->dim, subs[i]->dim),
2536 goto error);
2537
2538 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
2539 for (i = 0; i < n; ++i)
2540 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
2541
2542 first += pos(qp->dim, type);
2543
2544 ups = isl_alloc_array(qp->dim->ctx, struct isl_upoly *, n);
2545 if (!ups)
2546 goto error;
2547 for (i = 0; i < n; ++i)
2548 ups[i] = subs[i]->upoly;
2549
2550 qp->upoly = isl_upoly_subs(qp->upoly, first, n, ups);
2551
2552 free(ups);
2553
2554 if (!qp->upoly)
2555 goto error;
2556
2557 return qp;
2558 error:
2559 isl_qpolynomial_free(qp);
2560 return NULL;
2561 }
2562
2563 __isl_give isl_basic_set *add_div_constraints(__isl_take isl_basic_set *bset,
2564 __isl_take isl_mat *div)
2565 {
2566 int i;
2567 unsigned total;
2568
2569 if (!bset || !div)
2570 goto error;
2571
2572 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2573 if (!bset)
2574 goto error;
2575 total = isl_basic_set_total_dim(bset);
2576 for (i = 0; i < div->n_row; ++i)
2577 if (isl_basic_set_add_div_constraints_var(bset,
2578 total - div->n_row + i, div->row[i]) < 0)
2579 goto error;
2580
2581 isl_mat_free(div);
2582 return bset;
2583 error:
2584 isl_mat_free(div);
2585 isl_basic_set_free(bset);
2586 return NULL;
2587 }
2588
2589 /* Extend "bset" with extra set dimensions for each integer division
2590 * in "qp" and then call "fn" with the extended bset and the polynomial
2591 * that results from replacing each of the integer divisions by the
2592 * corresponding extra set dimension.
2593 */
2594 int isl_qpolynomial_as_polynomial_on_domain(__isl_keep isl_qpolynomial *qp,
2595 __isl_keep isl_basic_set *bset,
2596 int (*fn)(__isl_take isl_basic_set *bset,
2597 __isl_take isl_qpolynomial *poly, void *user), void *user)
2598 {
2599 isl_dim *dim;
2600 isl_mat *div;
2601 isl_qpolynomial *poly;
2602
2603 if (!qp || !bset)
2604 goto error;
2605 if (qp->div->n_row == 0)
2606 return fn(isl_basic_set_copy(bset), isl_qpolynomial_copy(qp),
2607 user);
2608
2609 div = isl_mat_copy(qp->div);
2610 dim = isl_dim_copy(qp->dim);
2611 dim = isl_dim_add(dim, isl_dim_set, qp->div->n_row);
2612 poly = isl_qpolynomial_alloc(dim, 0, isl_upoly_copy(qp->upoly));
2613 bset = isl_basic_set_copy(bset);
2614 bset = isl_basic_set_add(bset, isl_dim_set, qp->div->n_row);
2615 bset = add_div_constraints(bset, div);
2616
2617 return fn(bset, poly, user);
2618 error:
2619 return -1;
2620 }
2621
2622 /* Return total degree in variables first (inclusive) up to last (exclusive).
2623 */
2624 int isl_upoly_degree(__isl_keep struct isl_upoly *up, int first, int last)
2625 {
2626 int deg = -1;
2627 int i;
2628 struct isl_upoly_rec *rec;
2629
2630 if (!up)
2631 return -2;
2632 if (isl_upoly_is_zero(up))
2633 return -1;
2634 if (isl_upoly_is_cst(up) || up->var < first)
2635 return 0;
2636
2637 rec = isl_upoly_as_rec(up);
2638 if (!rec)
2639 return -2;
2640
2641 for (i = 0; i < rec->n; ++i) {
2642 int d;
2643
2644 if (isl_upoly_is_zero(rec->p[i]))
2645 continue;
2646 d = isl_upoly_degree(rec->p[i], first, last);
2647 if (up->var < last)
2648 d += i;
2649 if (d > deg)
2650 deg = d;
2651 }
2652
2653 return deg;
2654 }
2655
2656 /* Return total degree in set variables.
2657 */
2658 int isl_qpolynomial_degree(__isl_keep isl_qpolynomial *poly)
2659 {
2660 unsigned ovar;
2661 unsigned nvar;
2662
2663 if (!poly)
2664 return -2;
2665
2666 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2667 nvar = isl_dim_size(poly->dim, isl_dim_set);
2668 return isl_upoly_degree(poly->upoly, ovar, ovar + nvar);
2669 }
2670
2671 __isl_give struct isl_upoly *isl_upoly_coeff(__isl_keep struct isl_upoly *up,
2672 unsigned pos, int deg)
2673 {
2674 int i;
2675 struct isl_upoly_rec *rec;
2676
2677 if (!up)
2678 return NULL;
2679
2680 if (isl_upoly_is_cst(up) || up->var < pos) {
2681 if (deg == 0)
2682 return isl_upoly_copy(up);
2683 else
2684 return isl_upoly_zero(up->ctx);
2685 }
2686
2687 rec = isl_upoly_as_rec(up);
2688 if (!rec)
2689 return NULL;
2690
2691 if (up->var == pos) {
2692 if (deg < rec->n)
2693 return isl_upoly_copy(rec->p[deg]);
2694 else
2695 return isl_upoly_zero(up->ctx);
2696 }
2697
2698 up = isl_upoly_copy(up);
2699 up = isl_upoly_cow(up);
2700 rec = isl_upoly_as_rec(up);
2701 if (!rec)
2702 goto error;
2703
2704 for (i = 0; i < rec->n; ++i) {
2705 struct isl_upoly *t;
2706 t = isl_upoly_coeff(rec->p[i], pos, deg);
2707 if (!t)
2708 goto error;
2709 isl_upoly_free(rec->p[i]);
2710 rec->p[i] = t;
2711 }
2712
2713 return up;
2714 error:
2715 isl_upoly_free(up);
2716 return NULL;
2717 }
2718
2719 /* Return coefficient of power "deg" of variable "t_pos" of type "type".
2720 */
2721 __isl_give isl_qpolynomial *isl_qpolynomial_coeff(
2722 __isl_keep isl_qpolynomial *qp,
2723 enum isl_dim_type type, unsigned t_pos, int deg)
2724 {
2725 unsigned g_pos;
2726 struct isl_upoly *up;
2727 isl_qpolynomial *c;
2728
2729 if (!qp)
2730 return NULL;
2731
2732 isl_assert(qp->div->ctx, t_pos < isl_dim_size(qp->dim, type),
2733 return NULL);
2734
2735 g_pos = pos(qp->dim, type) + t_pos;
2736 up = isl_upoly_coeff(qp->upoly, g_pos, deg);
2737
2738 c = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row, up);
2739 if (!c)
2740 return NULL;
2741 isl_mat_free(c->div);
2742 c->div = isl_mat_copy(qp->div);
2743 if (!c->div)
2744 goto error;
2745 return c;
2746 error:
2747 isl_qpolynomial_free(c);
2748 return NULL;
2749 }
2750
2751 /* Homogenize the polynomial in the variables first (inclusive) up to
2752 * last (exclusive) by inserting powers of variable first.
2753 * Variable first is assumed not to appear in the input.
2754 */
2755 __isl_give struct isl_upoly *isl_upoly_homogenize(
2756 __isl_take struct isl_upoly *up, int deg, int target,
2757 int first, int last)
2758 {
2759 int i;
2760 struct isl_upoly_rec *rec;
2761
2762 if (!up)
2763 return NULL;
2764 if (isl_upoly_is_zero(up))
2765 return up;
2766 if (deg == target)
2767 return up;
2768 if (isl_upoly_is_cst(up) || up->var < first) {
2769 struct isl_upoly *hom;
2770
2771 hom = isl_upoly_pow(up->ctx, first, target - deg);
2772 if (!hom)
2773 goto error;
2774 rec = isl_upoly_as_rec(hom);
2775 rec->p[target - deg] = isl_upoly_mul(rec->p[target - deg], up);
2776
2777 return hom;
2778 }
2779
2780 up = isl_upoly_cow(up);
2781 rec = isl_upoly_as_rec(up);
2782 if (!rec)
2783 goto error;
2784
2785 for (i = 0; i < rec->n; ++i) {
2786 if (isl_upoly_is_zero(rec->p[i]))
2787 continue;
2788 rec->p[i] = isl_upoly_homogenize(rec->p[i],
2789 up->var < last ? deg + i : i, target,
2790 first, last);
2791 if (!rec->p[i])
2792 goto error;
2793 }
2794
2795 return up;
2796 error:
2797 isl_upoly_free(up);
2798 return NULL;
2799 }
2800
2801 /* Homogenize the polynomial in the set variables by introducing
2802 * powers of an extra set variable at position 0.
2803 */
2804 __isl_give isl_qpolynomial *isl_qpolynomial_homogenize(
2805 __isl_take isl_qpolynomial *poly)
2806 {
2807 unsigned ovar;
2808 unsigned nvar;
2809 int deg = isl_qpolynomial_degree(poly);
2810
2811 if (deg < -1)
2812 goto error;
2813
2814 poly = isl_qpolynomial_insert_dims(poly, isl_dim_set, 0, 1);
2815 poly = isl_qpolynomial_cow(poly);
2816 if (!poly)
2817 goto error;
2818
2819 ovar = isl_dim_offset(poly->dim, isl_dim_set);
2820 nvar = isl_dim_size(poly->dim, isl_dim_set);
2821 poly->upoly = isl_upoly_homogenize(poly->upoly, 0, deg,
2822 ovar, ovar + nvar);
2823 if (!poly->upoly)
2824 goto error;
2825
2826 return poly;
2827 error:
2828 isl_qpolynomial_free(poly);
2829 return NULL;
2830 }
2831
2832 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2833 __isl_take isl_mat *div)
2834 {
2835 isl_term *term;
2836 int n;
2837
2838 if (!dim || !div)
2839 goto error;
2840
2841 n = isl_dim_total(dim) + div->n_row;
2842
2843 term = isl_calloc(dim->ctx, struct isl_term,
2844 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2845 if (!term)
2846 goto error;
2847
2848 term->ref = 1;
2849 term->dim = dim;
2850 term->div = div;
2851 isl_int_init(term->n);
2852 isl_int_init(term->d);
2853
2854 return term;
2855 error:
2856 isl_dim_free(dim);
2857 isl_mat_free(div);
2858 return NULL;
2859 }
2860
2861 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
2862 {
2863 if (!term)
2864 return NULL;
2865
2866 term->ref++;
2867 return term;
2868 }
2869
2870 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
2871 {
2872 int i;
2873 isl_term *dup;
2874 unsigned total;
2875
2876 if (term)
2877 return NULL;
2878
2879 total = isl_dim_total(term->dim) + term->div->n_row;
2880
2881 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
2882 if (!dup)
2883 return NULL;
2884
2885 isl_int_set(dup->n, term->n);
2886 isl_int_set(dup->d, term->d);
2887
2888 for (i = 0; i < total; ++i)
2889 dup->pow[i] = term->pow[i];
2890
2891 return dup;
2892 }
2893
2894 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
2895 {
2896 if (!term)
2897 return NULL;
2898
2899 if (term->ref == 1)
2900 return term;
2901 term->ref--;
2902 return isl_term_dup(term);
2903 }
2904
2905 void isl_term_free(__isl_take isl_term *term)
2906 {
2907 if (!term)
2908 return;
2909
2910 if (--term->ref > 0)
2911 return;
2912
2913 isl_dim_free(term->dim);
2914 isl_mat_free(term->div);
2915 isl_int_clear(term->n);
2916 isl_int_clear(term->d);
2917 free(term);
2918 }
2919
2920 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
2921 {
2922 if (!term)
2923 return 0;
2924
2925 switch (type) {
2926 case isl_dim_param:
2927 case isl_dim_in:
2928 case isl_dim_out: return isl_dim_size(term->dim, type);
2929 case isl_dim_div: return term->div->n_row;
2930 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
2931 default: return 0;
2932 }
2933 }
2934
2935 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
2936 {
2937 return term ? term->dim->ctx : NULL;
2938 }
2939
2940 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
2941 {
2942 if (!term)
2943 return;
2944 isl_int_set(*n, term->n);
2945 }
2946
2947 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
2948 {
2949 if (!term)
2950 return;
2951 isl_int_set(*d, term->d);
2952 }
2953
2954 int isl_term_get_exp(__isl_keep isl_term *term,
2955 enum isl_dim_type type, unsigned pos)
2956 {
2957 if (!term)
2958 return -1;
2959
2960 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
2961
2962 if (type >= isl_dim_set)
2963 pos += isl_dim_size(term->dim, isl_dim_param);
2964 if (type >= isl_dim_div)
2965 pos += isl_dim_size(term->dim, isl_dim_set);
2966
2967 return term->pow[pos];
2968 }
2969
2970 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
2971 {
2972 isl_basic_map *bmap;
2973 unsigned total;
2974 int k;
2975
2976 if (!term)
2977 return NULL;
2978
2979 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
2980 return NULL);
2981
2982 total = term->div->n_col - term->div->n_row - 2;
2983 /* No nested divs for now */
2984 isl_assert(term->dim->ctx,
2985 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
2986 term->div->n_row) == -1,
2987 return NULL);
2988
2989 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
2990 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
2991 goto error;
2992
2993 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
2994
2995 return isl_basic_map_div(bmap, k);
2996 error:
2997 isl_basic_map_free(bmap);
2998 return NULL;
2999 }
3000
3001 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
3002 int (*fn)(__isl_take isl_term *term, void *user),
3003 __isl_take isl_term *term, void *user)
3004 {
3005 int i;
3006 struct isl_upoly_rec *rec;
3007
3008 if (!up || !term)
3009 goto error;
3010
3011 if (isl_upoly_is_zero(up))
3012 return term;
3013
3014 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
3015 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
3016 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
3017
3018 if (isl_upoly_is_cst(up)) {
3019 struct isl_upoly_cst *cst;
3020 cst = isl_upoly_as_cst(up);
3021 if (!cst)
3022 goto error;
3023 term = isl_term_cow(term);
3024 if (!term)
3025 goto error;
3026 isl_int_set(term->n, cst->n);
3027 isl_int_set(term->d, cst->d);
3028 if (fn(isl_term_copy(term), user) < 0)
3029 goto error;
3030 return term;
3031 }
3032
3033 rec = isl_upoly_as_rec(up);
3034 if (!rec)
3035 goto error;
3036
3037 for (i = 0; i < rec->n; ++i) {
3038 term = isl_term_cow(term);
3039 if (!term)
3040 goto error;
3041 term->pow[up->var] = i;
3042 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
3043 if (!term)
3044 goto error;
3045 }
3046 term->pow[up->var] = 0;
3047
3048 return term;
3049 error:
3050 isl_term_free(term);
3051 return NULL;
3052 }
3053
3054 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
3055 int (*fn)(__isl_take isl_term *term, void *user), void *user)
3056 {
3057 isl_term *term;
3058
3059 if (!qp)
3060 return -1;
3061
3062 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
3063 if (!term)
3064 return -1;
3065
3066 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
3067
3068 isl_term_free(term);
3069
3070 return term ? 0 : -1;
3071 }
3072
3073 __isl_give isl_qpolynomial *isl_qpolynomial_from_term(__isl_take isl_term *term)
3074 {
3075 struct isl_upoly *up;
3076 isl_qpolynomial *qp;
3077 int i, n;
3078
3079 if (!term)
3080 return NULL;
3081
3082 n = isl_dim_total(term->dim) + term->div->n_row;
3083
3084 up = isl_upoly_rat_cst(term->dim->ctx, term->n, term->d);
3085 for (i = 0; i < n; ++i) {
3086 if (!term->pow[i])
3087 continue;
3088 up = isl_upoly_mul(up,
3089 isl_upoly_pow(term->dim->ctx, i, term->pow[i]));
3090 }
3091
3092 qp = isl_qpolynomial_alloc(isl_dim_copy(term->dim), term->div->n_row, up);
3093 if (!qp)
3094 goto error;
3095 isl_mat_free(qp->div);
3096 qp->div = isl_mat_copy(term->div);
3097 if (!qp->div)
3098 goto error;
3099
3100 isl_term_free(term);
3101 return qp;
3102 error:
3103 isl_qpolynomial_free(qp);
3104 isl_term_free(term);
3105 return NULL;
3106 }
3107
3108 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
3109 __isl_take isl_dim *dim)
3110 {
3111 int i;
3112 int extra;
3113 unsigned total;
3114
3115 if (!qp || !dim)
3116 goto error;
3117
3118 if (isl_dim_equal(qp->dim, dim)) {
3119 isl_dim_free(dim);
3120 return qp;
3121 }
3122
3123 qp = isl_qpolynomial_cow(qp);
3124 if (!qp)
3125 goto error;
3126
3127 extra = isl_dim_size(dim, isl_dim_set) -
3128 isl_dim_size(qp->dim, isl_dim_set);
3129 total = isl_dim_total(qp->dim);
3130 if (qp->div->n_row) {
3131 int *exp;
3132
3133 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
3134 if (!exp)
3135 goto error;
3136 for (i = 0; i < qp->div->n_row; ++i)
3137 exp[i] = extra + i;
3138 qp->upoly = expand(qp->upoly, exp, total);
3139 free(exp);
3140 if (!qp->upoly)
3141 goto error;
3142 }
3143 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
3144 if (!qp->div)
3145 goto error;
3146 for (i = 0; i < qp->div->n_row; ++i)
3147 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
3148
3149 isl_dim_free(qp->dim);
3150 qp->dim = dim;
3151
3152 return qp;
3153 error:
3154 isl_dim_free(dim);
3155 isl_qpolynomial_free(qp);
3156 return NULL;
3157 }
3158
3159 /* For each parameter or variable that does not appear in qp,
3160 * first eliminate the variable from all constraints and then set it to zero.
3161 */
3162 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
3163 __isl_keep isl_qpolynomial *qp)
3164 {
3165 int *active = NULL;
3166 int i;
3167 int d;
3168 unsigned nparam;
3169 unsigned nvar;
3170
3171 if (!set || !qp)
3172 goto error;
3173
3174 d = isl_dim_total(set->dim);
3175 active = isl_calloc_array(set->ctx, int, d);
3176 if (set_active(qp, active) < 0)
3177 goto error;
3178
3179 for (i = 0; i < d; ++i)
3180 if (!active[i])
3181 break;
3182
3183 if (i == d) {
3184 free(active);
3185 return set;
3186 }
3187
3188 nparam = isl_dim_size(set->dim, isl_dim_param);
3189 nvar = isl_dim_size(set->dim, isl_dim_set);
3190 for (i = 0; i < nparam; ++i) {
3191 if (active[i])
3192 continue;
3193 set = isl_set_eliminate(set, isl_dim_param, i, 1);
3194 set = isl_set_fix_si(set, isl_dim_param, i, 0);
3195 }
3196 for (i = 0; i < nvar; ++i) {
3197 if (active[nparam + i])
3198 continue;
3199 set = isl_set_eliminate(set, isl_dim_set, i, 1);
3200 set = isl_set_fix_si(set, isl_dim_set, i, 0);
3201 }
3202
3203 free(active);
3204
3205 return set;
3206 error:
3207 free(active);
3208 isl_set_free(set);
3209 return NULL;
3210 }
3211
3212 struct isl_opt_data {
3213 isl_qpolynomial *qp;
3214 int first;
3215 isl_qpolynomial *opt;
3216 int max;
3217 };
3218
3219 static int opt_fn(__isl_take isl_point *pnt, void *user)
3220 {
3221 struct isl_opt_data *data = (struct isl_opt_data *)user;
3222 isl_qpolynomial *val;
3223
3224 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
3225 if (data->first) {
3226 data->first = 0;
3227 data->opt = val;
3228 } else if (data->max) {
3229 data->opt = isl_qpolynomial_max_cst(data->opt, val);
3230 } else {
3231 data->opt = isl_qpolynomial_min_cst(data->opt, val);
3232 }
3233
3234 return 0;
3235 }
3236
3237 __isl_give isl_qpolynomial *isl_qpolynomial_opt_on_domain(
3238 __isl_take isl_qpolynomial *qp, __isl_take isl_set *set, int max)
3239 {
3240 struct isl_opt_data data = { NULL, 1, NULL, max };
3241
3242 if (!set || !qp)
3243 goto error;
3244
3245 if (isl_upoly_is_cst(qp->upoly)) {
3246 isl_set_free(set);
3247 return qp;
3248 }
3249
3250 set = fix_inactive(set, qp);
3251
3252 data.qp = qp;
3253 if (isl_set_foreach_point(set, opt_fn, &data) < 0)
3254 goto error;
3255
3256 if (data.first)
3257 data.opt = isl_qpolynomial_zero(isl_qpolynomial_get_dim(qp));
3258
3259 isl_set_free(set);
3260 isl_qpolynomial_free(qp);
3261 return data.opt;
3262 error:
3263 isl_set_free(set);
3264 isl_qpolynomial_free(qp);
3265 isl_qpolynomial_free(data.opt);
3266 return NULL;
3267 }
3268
3269 __isl_give isl_qpolynomial *isl_qpolynomial_morph(__isl_take isl_qpolynomial *qp,
3270 __isl_take isl_morph *morph)
3271 {
3272 int i;
3273 isl_ctx *ctx;
3274 struct isl_upoly *up;
3275 unsigned n_div;
3276 struct isl_upoly **subs;
3277 isl_mat *mat;
3278
3279 qp = isl_qpolynomial_cow(qp);
3280 if (!qp || !morph)
3281 goto error;
3282
3283 ctx = qp->dim->ctx;
3284 isl_assert(ctx, isl_dim_equal(qp->dim, morph->dom->dim), goto error);
3285
3286 subs = isl_calloc_array(ctx, struct isl_upoly *, morph->inv->n_row - 1);
3287 if (!subs)
3288 goto error;
3289
3290 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3291 subs[i] = isl_upoly_from_affine(ctx, morph->inv->row[1 + i],
3292 morph->inv->row[0][0], morph->inv->n_col);
3293
3294 qp->upoly = isl_upoly_subs(qp->upoly, 0, morph->inv->n_row - 1, subs);
3295
3296 for (i = 0; 1 + i < morph->inv->n_row; ++i)
3297 isl_upoly_free(subs[i]);
3298 free(subs);
3299
3300 mat = isl_mat_diagonal(isl_mat_identity(ctx, 1), isl_mat_copy(morph->inv));
3301 mat = isl_mat_diagonal(mat, isl_mat_identity(ctx, qp->div->n_row));
3302 qp->div = isl_mat_product(qp->div, mat);
3303 isl_dim_free(qp->dim);
3304 qp->dim = isl_dim_copy(morph->ran->dim);
3305
3306 if (!qp->upoly || !qp->div || !qp->dim)
3307 goto error;
3308
3309 isl_morph_free(morph);
3310
3311 return qp;
3312 error:
3313 isl_qpolynomial_free(qp);
3314 isl_morph_free(morph);
3315 return NULL;
3316 }
3317
3318 static int neg_entry(void **entry, void *user)
3319 {
3320 isl_pw_qpolynomial **pwqp = (isl_pw_qpolynomial **)entry;
3321
3322 *pwqp = isl_pw_qpolynomial_neg(*pwqp);
3323
3324 return *pwqp ? 0 : -1;
3325 }
3326
3327 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_neg(
3328 __isl_take isl_union_pw_qpolynomial *upwqp)
3329 {
3330 upwqp = isl_union_pw_qpolynomial_cow(upwqp);
3331 if (!upwqp)
3332 return NULL;
3333
3334 if (isl_hash_table_foreach(upwqp->dim->ctx, &upwqp->table,
3335 &neg_entry, NULL) < 0)
3336 goto error;
3337
3338 return upwqp;
3339 error:
3340 isl_union_pw_qpolynomial_free(upwqp);
3341 return NULL;
3342 }
3343
3344 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_sub(
3345 __isl_take isl_union_pw_qpolynomial *upwqp1,
3346 __isl_take isl_union_pw_qpolynomial *upwqp2)
3347 {
3348 return isl_union_pw_qpolynomial_add(upwqp1,
3349 isl_union_pw_qpolynomial_neg(upwqp2));
3350 }
3351
3352 static int mul_entry(void **entry, void *user)
3353 {
3354 struct isl_union_pw_qpolynomial_match_bin_data *data = user;
3355 uint32_t hash;
3356 struct isl_hash_table_entry *entry2;
3357 isl_pw_qpolynomial *pwpq = *entry;
3358 int empty;
3359
3360 hash = isl_dim_get_hash(pwpq->dim);
3361 entry2 = isl_hash_table_find(data->u2->dim->ctx, &data->u2->table,
3362 hash, &has_dim, pwpq->dim, 0);
3363 if (!entry2)
3364 return 0;
3365
3366 pwpq = isl_pw_qpolynomial_copy(pwpq);
3367 pwpq = isl_pw_qpolynomial_mul(pwpq,
3368 isl_pw_qpolynomial_copy(entry2->data));
3369
3370 empty = isl_pw_qpolynomial_is_zero(pwpq);
3371 if (empty < 0) {
3372 isl_pw_qpolynomial_free(pwpq);
3373 return -1;
3374 }
3375 if (empty) {
3376 isl_pw_qpolynomial_free(pwpq);
3377 return 0;
3378 }
3379
3380 data->res = isl_union_pw_qpolynomial_add_pw_qpolynomial(data->res, pwpq);
3381
3382 return 0;
3383 }
3384
3385 __isl_give isl_union_pw_qpolynomial *isl_union_pw_qpolynomial_mul(
3386 __isl_take isl_union_pw_qpolynomial *upwqp1,
3387 __isl_take isl_union_pw_qpolynomial *upwqp2)
3388 {
3389 return match_bin_op(upwqp1, upwqp2, &mul_entry);
3390 }
3391
3392 /* Reorder the columns of the given div definitions according to the
3393 * given reordering.
3394 */
3395 static __isl_give isl_mat *reorder_divs(__isl_take isl_mat *div,
3396 __isl_take isl_reordering *r)
3397 {
3398 int i, j;
3399 isl_mat *mat;
3400 int extra;
3401
3402 if (!div || !r)
3403 goto error;
3404
3405 extra = isl_dim_total(r->dim) + div->n_row - r->len;
3406 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
3407 if (!mat)
3408 goto error;
3409
3410 for (i = 0; i < div->n_row; ++i) {
3411 isl_seq_cpy(mat->row[i], div->row[i], 2);
3412 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2);
3413 for (j = 0; j < r->len; ++j)
3414 isl_int_set(mat->row[i][2 + r->pos[j]],
3415 div->row[i][2 + j]);
3416 }
3417
3418 isl_reordering_free(r);
3419 isl_mat_free(div);
3420 return mat;
3421 error:
3422 isl_reordering_free(r);
3423 isl_mat_free(div);
3424 return NULL;
3425 }
3426
3427 /* Reorder the dimension of "qp" according to the given reordering.
3428 */
3429 __isl_give isl_qpolynomial *isl_qpolynomial_realign(
3430 __isl_take isl_qpolynomial *qp, __isl_take isl_reordering *r)
3431 {
3432 qp = isl_qpolynomial_cow(qp);
3433 if (!qp)
3434 goto error;
3435
3436 r = isl_reordering_extend(r, qp->div->n_row);
3437 if (!r)
3438 goto error;
3439
3440 qp->div = reorder_divs(qp->div, isl_reordering_copy(r));
3441 if (!qp->div)
3442 goto error;
3443
3444 qp->upoly = reorder(qp->upoly, r->pos);
3445 if (!qp->upoly)
3446 goto error;
3447
3448 qp = isl_qpolynomial_reset_dim(qp, isl_dim_copy(r->dim));
3449
3450 isl_reordering_free(r);
3451 return qp;
3452 error:
3453 isl_qpolynomial_free(qp);
3454 isl_reordering_free(r);
3455 return NULL;
3456 }
3457
3458 struct isl_split_periods_data {
3459 int max_periods;
3460 isl_pw_qpolynomial *res;
3461 };
3462
3463 /* Create a slice where the integer division "div" has the fixed value "v".
3464 * In particular, if "div" refers to floor(f/m), then create a slice
3465 *
3466 * m v <= f <= m v + (m - 1)
3467 *
3468 * or
3469 *
3470 * f - m v >= 0
3471 * -f + m v + (m - 1) >= 0
3472 */
3473 static __isl_give isl_set *set_div_slice(__isl_take isl_dim *dim,
3474 __isl_keep isl_qpolynomial *qp, int div, isl_int v)
3475 {
3476 int total;
3477 isl_basic_set *bset = NULL;
3478 int k;
3479
3480 if (!dim || !qp)
3481 goto error;
3482
3483 total = isl_dim_total(dim);
3484 bset = isl_basic_set_alloc_dim(isl_dim_copy(dim), 0, 0, 2);
3485
3486 k = isl_basic_set_alloc_inequality(bset);
3487 if (k < 0)
3488 goto error;
3489 isl_seq_cpy(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3490 isl_int_submul(bset->ineq[k][0], v, qp->div->row[div][0]);
3491
3492 k = isl_basic_set_alloc_inequality(bset);
3493 if (k < 0)
3494 goto error;
3495 isl_seq_neg(bset->ineq[k], qp->div->row[div] + 1, 1 + total);
3496 isl_int_addmul(bset->ineq[k][0], v, qp->div->row[div][0]);
3497 isl_int_add(bset->ineq[k][0], bset->ineq[k][0], qp->div->row[div][0]);
3498 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
3499
3500 isl_dim_free(dim);
3501 return isl_set_from_basic_set(bset);
3502 error:
3503 isl_basic_set_free(bset);
3504 isl_dim_free(dim);
3505 return NULL;
3506 }
3507
3508 static int split_periods(__isl_take isl_set *set,
3509 __isl_take isl_qpolynomial *qp, void *user);
3510
3511 /* Create a slice of the domain "set" such that integer division "div"
3512 * has the fixed value "v" and add the results to data->res,
3513 * replacing the integer division by "v" in "qp".
3514 */
3515 static int set_div(__isl_take isl_set *set,
3516 __isl_take isl_qpolynomial *qp, int div, isl_int v,
3517 struct isl_split_periods_data *data)
3518 {
3519 int i;
3520 int *reordering;
3521 isl_set *slice;
3522 struct isl_upoly *cst;
3523 int total;
3524
3525 slice = set_div_slice(isl_set_get_dim(set), qp, div, v);
3526 set = isl_set_intersect(set, slice);
3527
3528 qp = isl_qpolynomial_cow(qp);
3529 if (!qp)
3530 goto error;
3531
3532 cst = isl_upoly_rat_cst(qp->dim->ctx, v, qp->dim->ctx->one);
3533 if (!cst)
3534 goto error;
3535 total = isl_dim_total(qp->dim);
3536 qp->upoly = isl_upoly_subs(qp->upoly, total + div, 1, &cst);
3537 isl_upoly_free(cst);
3538 if (!qp->upoly)
3539 goto error;
3540
3541 reordering = isl_alloc_array(qp->dim->ctx, int, total + qp->div->n_row);
3542 if (!reordering)
3543 goto error;
3544 for (i = 0; i < total + div; ++i)
3545 reordering[i] = i;
3546 for (i = total + div + 1; i < total + qp->div->n_row; ++i)
3547 reordering[i] = i - 1;
3548 qp->div = isl_mat_drop_rows(qp->div, div, 1);
3549 qp->div = isl_mat_drop_cols(qp->div, 2 + total + div, 1);
3550 qp->upoly = reorder(qp->upoly, reordering);
3551 free(reordering);
3552
3553 if (!qp->upoly || !qp->div)
3554 goto error;
3555
3556 return split_periods(set, qp, data);
3557 error:
3558 isl_set_free(set);
3559 isl_qpolynomial_free(qp);
3560 return -1;
3561 }
3562
3563 /* Split the domain "set" such that integer division "div"
3564 * has a fixed value (ranging from "min" to "max") on each slice
3565 * and add the results to data->res.
3566 */
3567 static int split_div(__isl_take isl_set *set,
3568 __isl_take isl_qpolynomial *qp, int div, isl_int min, isl_int max,
3569 struct isl_split_periods_data *data)
3570 {
3571 for (; isl_int_le(min, max); isl_int_add_ui(min, min, 1)) {
3572 isl_set *set_i = isl_set_copy(set);
3573 isl_qpolynomial *qp_i = isl_qpolynomial_copy(qp);
3574
3575 if (set_div(set_i, qp_i, div, min, data) < 0)
3576 goto error;
3577 }
3578 isl_set_free(set);
3579 isl_qpolynomial_free(qp);
3580 return 0;
3581 error:
3582 isl_set_free(set);
3583 isl_qpolynomial_free(qp);
3584 return -1;
3585 }
3586
3587 /* If "qp" refers to any integer division
3588 * that can only attain "max_periods" distinct values on "set"
3589 * then split the domain along those distinct values.
3590 * Add the results (or the original if no splitting occurs)
3591 * to data->res.
3592 */
3593 static int split_periods(__isl_take isl_set *set,
3594 __isl_take isl_qpolynomial *qp, void *user)
3595 {
3596 int i;
3597 isl_pw_qpolynomial *pwqp;
3598 struct isl_split_periods_data *data;
3599 isl_int min, max;
3600 int total;
3601 int r = 0;
3602
3603 data = (struct isl_split_periods_data *)user;
3604
3605 if (!set || !qp)
3606 goto error;
3607
3608 if (qp->div->n_row == 0) {
3609 pwqp = isl_pw_qpolynomial_alloc(set, qp);
3610 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
3611 return 0;
3612 }
3613
3614 isl_int_init(min);
3615 isl_int_init(max);
3616 total = isl_dim_total(qp->dim);
3617 for (i = 0; i < qp->div->n_row; ++i) {
3618 enum isl_lp_result lp_res;
3619
3620 if (isl_seq_first_non_zero(qp->div->row[i] + 2 + total,
3621 qp->div->n_row) != -1)
3622 continue;
3623
3624 lp_res = isl_set_solve_lp(set, 0, qp->div->row[i] + 1,
3625 set->ctx->one, &min, NULL, NULL);
3626 if (lp_res == isl_lp_error)
3627 goto error2;
3628 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
3629 continue;
3630 isl_int_fdiv_q(min, min, qp->div->row[i][0]);
3631
3632 lp_res = isl_set_solve_lp(set, 1, qp->div->row[i] + 1,
3633 set->ctx->one, &max, NULL, NULL);
3634 if (lp_res == isl_lp_error)
3635 goto error2;
3636 if (lp_res == isl_lp_unbounded || lp_res == isl_lp_empty)
3637 continue;
3638 isl_int_fdiv_q(max, max, qp->div->row[i][0]);
3639
3640 isl_int_sub(max, max, min);
3641 if (isl_int_cmp_si(max, data->max_periods) < 0) {
3642 isl_int_add(max, max, min);
3643 break;
3644 }
3645 }
3646
3647 if (i < qp->div->n_row) {
3648 r = split_div(set, qp, i, min, max, data);
3649 } else {
3650 pwqp = isl_pw_qpolynomial_alloc(set, qp);
3651 data->res = isl_pw_qpolynomial_add_disjoint(data->res, pwqp);
3652 }
3653
3654 isl_int_clear(max);
3655 isl_int_clear(min);
3656
3657 return r;
3658 error2:
3659 isl_int_clear(max);
3660 isl_int_clear(min);
3661 error:
3662 isl_set_free(set);
3663 isl_qpolynomial_free(qp);
3664 return -1;
3665 }
3666
3667 /* If any quasi-polynomial in pwqp refers to any integer division
3668 * that can only attain "max_periods" distinct values on its domain
3669 * then split the domain along those distinct values.
3670 */
3671 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_split_periods(
3672 __isl_take isl_pw_qpolynomial *pwqp, int max_periods)
3673 {
3674 struct isl_split_periods_data data;
3675
3676 data.max_periods = max_periods;
3677 data.res = isl_pw_qpolynomial_zero(isl_pw_qpolynomial_get_dim(pwqp));
3678
3679 if (isl_pw_qpolynomial_foreach_piece(pwqp, &split_periods, &data) < 0)
3680 goto error;
3681
3682 isl_pw_qpolynomial_free(pwqp);
3683
3684 return data.res;
3685 error:
3686 isl_pw_qpolynomial_free(data.res);
3687 isl_pw_qpolynomial_free(pwqp);
3688 return NULL;
3689 }
3690
3691 /* Construct a piecewise quasipolynomial that is constant on the given
3692 * domain. In particular, it is
3693 * 0 if cst == 0
3694 * 1 if cst == 1
3695 * infinity if cst == -1
3696 */
3697 static __isl_give isl_pw_qpolynomial *constant_on_domain(
3698 __isl_take isl_basic_set *bset, int cst)
3699 {
3700 isl_dim *dim;
3701 isl_qpolynomial *qp;
3702
3703 if (!bset)
3704 return NULL;
3705
3706 bset = isl_basic_map_domain(isl_basic_map_from_range(bset));
3707 dim = isl_basic_set_get_dim(bset);
3708 if (cst < 0)
3709 qp = isl_qpolynomial_infty(dim);
3710 else if (cst == 0)
3711 qp = isl_qpolynomial_zero(dim);
3712 else
3713 qp = isl_qpolynomial_one(dim);
3714 return isl_pw_qpolynomial_alloc(isl_set_from_basic_set(bset), qp);
3715 }
3716
3717 /* Factor bset, call fn on each of the factors and return the product.
3718 *
3719 * If no factors can be found, simply call fn on the input.
3720 * Otherwise, construct the factors based on the factorizer,
3721 * call fn on each factor and compute the product.
3722 */
3723 static __isl_give isl_pw_qpolynomial *compressed_multiplicative_call(
3724 __isl_take isl_basic_set *bset,
3725 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
3726 {
3727 int i, n;
3728 isl_dim *dim;
3729 isl_set *set;
3730 isl_factorizer *f;
3731 isl_qpolynomial *qp;
3732 isl_pw_qpolynomial *pwqp;
3733 unsigned nparam;
3734 unsigned nvar;
3735
3736 f = isl_basic_set_factorizer(bset);
3737 if (!f)
3738 goto error;
3739 if (f->n_group == 0) {
3740 isl_factorizer_free(f);
3741 return fn(bset);
3742 }
3743
3744 nparam = isl_basic_set_dim(bset, isl_dim_param);
3745 nvar = isl_basic_set_dim(bset, isl_dim_set);
3746
3747 dim = isl_basic_set_get_dim(bset);
3748 dim = isl_dim_domain(dim);
3749 set = isl_set_universe(isl_dim_copy(dim));
3750 qp = isl_qpolynomial_one(dim);
3751 pwqp = isl_pw_qpolynomial_alloc(set, qp);
3752
3753 bset = isl_morph_basic_set(isl_morph_copy(f->morph), bset);
3754
3755 for (i = 0, n = 0; i < f->n_group; ++i) {
3756 isl_basic_set *bset_i;
3757 isl_pw_qpolynomial *pwqp_i;
3758
3759 bset_i = isl_basic_set_copy(bset);
3760 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
3761 nparam + n + f->len[i], nvar - n - f->len[i]);
3762 bset_i = isl_basic_set_drop_constraints_involving(bset_i,
3763 nparam, n);
3764 bset_i = isl_basic_set_drop(bset_i, isl_dim_set,
3765 n + f->len[i], nvar - n - f->len[i]);
3766 bset_i = isl_basic_set_drop(bset_i, isl_dim_set, 0, n);
3767
3768 pwqp_i = fn(bset_i);
3769 pwqp = isl_pw_qpolynomial_mul(pwqp, pwqp_i);
3770
3771 n += f->len[i];
3772 }
3773
3774 isl_basic_set_free(bset);
3775 isl_factorizer_free(f);
3776
3777 return pwqp;
3778 error:
3779 isl_basic_set_free(bset);
3780 return NULL;
3781 }
3782
3783 /* Factor bset, call fn on each of the factors and return the product.
3784 * The function is assumed to evaluate to zero on empty domains,
3785 * to one on zero-dimensional domains and to infinity on unbounded domains
3786 * and will not be called explicitly on zero-dimensional or unbounded domains.
3787 *
3788 * We first check for some special cases and remove all equalities.
3789 * Then we hand over control to compressed_multiplicative_call.
3790 */
3791 __isl_give isl_pw_qpolynomial *isl_basic_set_multiplicative_call(
3792 __isl_take isl_basic_set *bset,
3793 __isl_give isl_pw_qpolynomial *(*fn)(__isl_take isl_basic_set *bset))
3794 {
3795 int bounded;
3796 isl_morph *morph;
3797 isl_pw_qpolynomial *pwqp;
3798 unsigned orig_nvar, final_nvar;
3799
3800 if (!bset)
3801 return NULL;
3802
3803 if (isl_basic_set_fast_is_empty(bset))
3804 return constant_on_domain(bset, 0);
3805
3806 orig_nvar = isl_basic_set_dim(bset, isl_dim_set);
3807
3808 if (orig_nvar == 0)
3809 return constant_on_domain(bset, 1);
3810
3811 bounded = isl_basic_set_is_bounded(bset);
3812 if (bounded < 0)
3813 goto error;
3814 if (!bounded)
3815 return constant_on_domain(bset, -1);
3816
3817 if (bset->n_eq == 0)
3818 return compressed_multiplicative_call(bset, fn);
3819
3820 morph = isl_basic_set_full_compression(bset);
3821 bset = isl_morph_basic_set(isl_morph_copy(morph), bset);
3822
3823 final_nvar = isl_basic_set_dim(bset, isl_dim_set);
3824
3825 pwqp = compressed_multiplicative_call(bset, fn);
3826
3827 morph = isl_morph_remove_dom_dims(morph, isl_dim_set, 0, orig_nvar);
3828 morph = isl_morph_remove_ran_dims(morph, isl_dim_set, 0, final_nvar);
3829 morph = isl_morph_inverse(morph);
3830
3831 pwqp = isl_pw_qpolynomial_morph(pwqp, morph);
3832
3833 return pwqp;
3834 error:
3835 isl_basic_set_free(bset);
3836 return NULL;
3837 }
Integer set library