?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
isl_qpolynomial_alloc: take initial struct isl_upoly as argument
[isl.git] / isl_polynomial.c
blob0509bc1429869f65c1b4d204b6a3fe733e346521
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_seq.h>
13 #include <isl_polynomial_private.h>
14 #include <isl_point_private.h>
15 #include <isl_dim_private.h>
16 #include <isl_map_private.h>
17
18 static unsigned pos(__isl_keep isl_dim *dim, enum isl_dim_type type)
19 {
20 switch (type) {
21 case isl_dim_param: return 0;
22 case isl_dim_in: return dim->nparam;
23 case isl_dim_out: return dim->nparam + dim->n_in;
24 }
25 }
26
27 int isl_upoly_is_cst(__isl_keep struct isl_upoly *up)
28 {
29 if (!up)
30 return -1;
31
32 return up->var < 0;
33 }
34
35 __isl_keep struct isl_upoly_cst *isl_upoly_as_cst(__isl_keep struct isl_upoly *up)
36 {
37 if (!up)
38 return NULL;
39
40 isl_assert(up->ctx, up->var < 0, return NULL);
41
42 return (struct isl_upoly_cst *)up;
43 }
44
45 __isl_keep struct isl_upoly_rec *isl_upoly_as_rec(__isl_keep struct isl_upoly *up)
46 {
47 if (!up)
48 return NULL;
49
50 isl_assert(up->ctx, up->var >= 0, return NULL);
51
52 return (struct isl_upoly_rec *)up;
53 }
54
55 int isl_upoly_is_equal(__isl_keep struct isl_upoly *up1,
56 __isl_keep struct isl_upoly *up2)
57 {
58 int i;
59 struct isl_upoly_rec *rec1, *rec2;
60
61 if (!up1 || !up2)
62 return -1;
63 if (up1 == up2)
64 return 1;
65 if (up1->var != up2->var)
66 return 0;
67 if (isl_upoly_is_cst(up1)) {
68 struct isl_upoly_cst *cst1, *cst2;
69 cst1 = isl_upoly_as_cst(up1);
70 cst2 = isl_upoly_as_cst(up2);
71 if (!cst1 || !cst2)
72 return -1;
73 return isl_int_eq(cst1->n, cst2->n) &&
74 isl_int_eq(cst1->d, cst2->d);
75 }
76
77 rec1 = isl_upoly_as_rec(up1);
78 rec2 = isl_upoly_as_rec(up2);
79 if (!rec1 || !rec2)
80 return -1;
81
82 if (rec1->n != rec2->n)
83 return 0;
84
85 for (i = 0; i < rec1->n; ++i) {
86 int eq = isl_upoly_is_equal(rec1->p[i], rec2->p[i]);
87 if (eq < 0 || !eq)
88 return eq;
89 }
90
91 return 1;
92 }
93
94 int isl_upoly_is_zero(__isl_keep struct isl_upoly *up)
95 {
96 struct isl_upoly_cst *cst;
97
98 if (!up)
99 return -1;
100 if (!isl_upoly_is_cst(up))
101 return 0;
102
103 cst = isl_upoly_as_cst(up);
104 if (!cst)
105 return -1;
106
107 return isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d);
108 }
109
110 int isl_upoly_is_nan(__isl_keep struct isl_upoly *up)
111 {
112 struct isl_upoly_cst *cst;
113
114 if (!up)
115 return -1;
116 if (!isl_upoly_is_cst(up))
117 return 0;
118
119 cst = isl_upoly_as_cst(up);
120 if (!cst)
121 return -1;
122
123 return isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d);
124 }
125
126 int isl_upoly_is_infty(__isl_keep struct isl_upoly *up)
127 {
128 struct isl_upoly_cst *cst;
129
130 if (!up)
131 return -1;
132 if (!isl_upoly_is_cst(up))
133 return 0;
134
135 cst = isl_upoly_as_cst(up);
136 if (!cst)
137 return -1;
138
139 return isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d);
140 }
141
142 int isl_upoly_is_neginfty(__isl_keep struct isl_upoly *up)
143 {
144 struct isl_upoly_cst *cst;
145
146 if (!up)
147 return -1;
148 if (!isl_upoly_is_cst(up))
149 return 0;
150
151 cst = isl_upoly_as_cst(up);
152 if (!cst)
153 return -1;
154
155 return isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d);
156 }
157
158 int isl_upoly_is_one(__isl_keep struct isl_upoly *up)
159 {
160 struct isl_upoly_cst *cst;
161
162 if (!up)
163 return -1;
164 if (!isl_upoly_is_cst(up))
165 return 0;
166
167 cst = isl_upoly_as_cst(up);
168 if (!cst)
169 return -1;
170
171 return isl_int_eq(cst->n, cst->d) && isl_int_is_pos(cst->d);
172 }
173
174 int isl_upoly_is_negone(__isl_keep struct isl_upoly *up)
175 {
176 struct isl_upoly_cst *cst;
177
178 if (!up)
179 return -1;
180 if (!isl_upoly_is_cst(up))
181 return 0;
182
183 cst = isl_upoly_as_cst(up);
184 if (!cst)
185 return -1;
186
187 return isl_int_is_negone(cst->n) && isl_int_is_one(cst->d);
188 }
189
190 __isl_give struct isl_upoly_cst *isl_upoly_cst_alloc(struct isl_ctx *ctx)
191 {
192 struct isl_upoly_cst *cst;
193
194 cst = isl_alloc_type(ctx, struct isl_upoly_cst);
195 if (!cst)
196 return NULL;
197
198 cst->up.ref = 1;
199 cst->up.ctx = ctx;
200 isl_ctx_ref(ctx);
201 cst->up.var = -1;
202
203 isl_int_init(cst->n);
204 isl_int_init(cst->d);
205
206 return cst;
207 }
208
209 __isl_give struct isl_upoly *isl_upoly_zero(struct isl_ctx *ctx)
210 {
211 struct isl_upoly_cst *cst;
212
213 cst = isl_upoly_cst_alloc(ctx);
214 if (!cst)
215 return NULL;
216
217 isl_int_set_si(cst->n, 0);
218 isl_int_set_si(cst->d, 1);
219
220 return &cst->up;
221 }
222
223 __isl_give struct isl_upoly *isl_upoly_infty(struct isl_ctx *ctx)
224 {
225 struct isl_upoly_cst *cst;
226
227 cst = isl_upoly_cst_alloc(ctx);
228 if (!cst)
229 return NULL;
230
231 isl_int_set_si(cst->n, 1);
232 isl_int_set_si(cst->d, 0);
233
234 return &cst->up;
235 }
236
237 __isl_give struct isl_upoly *isl_upoly_nan(struct isl_ctx *ctx)
238 {
239 struct isl_upoly_cst *cst;
240
241 cst = isl_upoly_cst_alloc(ctx);
242 if (!cst)
243 return NULL;
244
245 isl_int_set_si(cst->n, 0);
246 isl_int_set_si(cst->d, 0);
247
248 return &cst->up;
249 }
250
251 __isl_give struct isl_upoly *isl_upoly_rat_cst(struct isl_ctx *ctx,
252 isl_int n, isl_int d)
253 {
254 struct isl_upoly_cst *cst;
255
256 cst = isl_upoly_cst_alloc(ctx);
257 if (!cst)
258 return NULL;
259
260 isl_int_set(cst->n, n);
261 isl_int_set(cst->d, d);
262
263 return &cst->up;
264 }
265
266 __isl_give struct isl_upoly_rec *isl_upoly_alloc_rec(struct isl_ctx *ctx,
267 int var, int size)
268 {
269 struct isl_upoly_rec *rec;
270
271 isl_assert(ctx, var >= 0, return NULL);
272 isl_assert(ctx, size >= 0, return NULL);
273 rec = isl_calloc(dim->ctx, struct isl_upoly_rec,
274 sizeof(struct isl_upoly_rec) +
275 (size - 1) * sizeof(struct isl_upoly *));
276 if (!rec)
277 return NULL;
278
279 rec->up.ref = 1;
280 rec->up.ctx = ctx;
281 isl_ctx_ref(ctx);
282 rec->up.var = var;
283
284 rec->n = 0;
285 rec->size = size;
286
287 return rec;
288 error:
289 isl_upoly_free(&rec->up);
290 return NULL;
291 }
292
293 int isl_qpolynomial_is_zero(__isl_keep isl_qpolynomial *qp)
294 {
295 struct isl_upoly_cst *cst;
296
297 if (!qp)
298 return -1;
299
300 return isl_upoly_is_zero(qp->upoly);
301 }
302
303 int isl_qpolynomial_is_one(__isl_keep isl_qpolynomial *qp)
304 {
305 struct isl_upoly_cst *cst;
306
307 if (!qp)
308 return -1;
309
310 return isl_upoly_is_one(qp->upoly);
311 }
312
313 static void upoly_free_cst(__isl_take struct isl_upoly_cst *cst)
314 {
315 isl_int_clear(cst->n);
316 isl_int_clear(cst->d);
317 }
318
319 static void upoly_free_rec(__isl_take struct isl_upoly_rec *rec)
320 {
321 int i;
322
323 for (i = 0; i < rec->n; ++i)
324 isl_upoly_free(rec->p[i]);
325 }
326
327 __isl_give struct isl_upoly *isl_upoly_copy(__isl_keep struct isl_upoly *up)
328 {
329 if (!up)
330 return NULL;
331
332 up->ref++;
333 return up;
334 }
335
336 __isl_give struct isl_upoly *isl_upoly_dup_cst(__isl_keep struct isl_upoly *up)
337 {
338 struct isl_upoly_cst *cst;
339 struct isl_upoly_cst *dup;
340
341 cst = isl_upoly_as_cst(up);
342 if (!cst)
343 return NULL;
344
345 dup = isl_upoly_as_cst(isl_upoly_zero(up->ctx));
346 if (!dup)
347 return NULL;
348 isl_int_set(dup->n, cst->n);
349 isl_int_set(dup->d, cst->d);
350
351 return &dup->up;
352 }
353
354 __isl_give struct isl_upoly *isl_upoly_dup_rec(__isl_keep struct isl_upoly *up)
355 {
356 int i;
357 struct isl_upoly_rec *rec;
358 struct isl_upoly_rec *dup;
359
360 rec = isl_upoly_as_rec(up);
361 if (!rec)
362 return NULL;
363
364 dup = isl_upoly_alloc_rec(up->ctx, up->var, rec->n);
365 if (!dup)
366 return NULL;
367
368 for (i = 0; i < rec->n; ++i) {
369 dup->p[i] = isl_upoly_copy(rec->p[i]);
370 if (!dup->p[i])
371 goto error;
372 dup->n++;
373 }
374
375 return &dup->up;
376 error:
377 isl_upoly_free(&dup->up);
378 return NULL;
379 }
380
381 __isl_give struct isl_upoly *isl_upoly_dup(__isl_keep struct isl_upoly *up)
382 {
383 struct isl_upoly *dup;
384
385 if (!up)
386 return NULL;
387
388 if (isl_upoly_is_cst(up))
389 return isl_upoly_dup_cst(up);
390 else
391 return isl_upoly_dup_rec(up);
392 }
393
394 __isl_give struct isl_upoly *isl_upoly_cow(__isl_take struct isl_upoly *up)
395 {
396 if (!up)
397 return NULL;
398
399 if (up->ref == 1)
400 return up;
401 up->ref--;
402 return isl_upoly_dup(up);
403 }
404
405 void isl_upoly_free(__isl_take struct isl_upoly *up)
406 {
407 if (!up)
408 return;
409
410 if (--up->ref > 0)
411 return;
412
413 if (up->var < 0)
414 upoly_free_cst((struct isl_upoly_cst *)up);
415 else
416 upoly_free_rec((struct isl_upoly_rec *)up);
417
418 isl_ctx_deref(up->ctx);
419 free(up);
420 }
421
422 static void isl_upoly_cst_reduce(__isl_keep struct isl_upoly_cst *cst)
423 {
424 isl_int gcd;
425
426 isl_int_init(gcd);
427 isl_int_gcd(gcd, cst->n, cst->d);
428 if (!isl_int_is_zero(gcd) && !isl_int_is_one(gcd)) {
429 isl_int_divexact(cst->n, cst->n, gcd);
430 isl_int_divexact(cst->d, cst->d, gcd);
431 }
432 isl_int_clear(gcd);
433 }
434
435 __isl_give struct isl_upoly *isl_upoly_sum_cst(__isl_take struct isl_upoly *up1,
436 __isl_take struct isl_upoly *up2)
437 {
438 struct isl_upoly_cst *cst1;
439 struct isl_upoly_cst *cst2;
440
441 up1 = isl_upoly_cow(up1);
442 if (!up1 || !up2)
443 goto error;
444
445 cst1 = isl_upoly_as_cst(up1);
446 cst2 = isl_upoly_as_cst(up2);
447
448 if (isl_int_eq(cst1->d, cst2->d))
449 isl_int_add(cst1->n, cst1->n, cst2->n);
450 else {
451 isl_int_mul(cst1->n, cst1->n, cst2->d);
452 isl_int_addmul(cst1->n, cst2->n, cst1->d);
453 isl_int_mul(cst1->d, cst1->d, cst2->d);
454 }
455
456 isl_upoly_cst_reduce(cst1);
457
458 isl_upoly_free(up2);
459 return up1;
460 error:
461 isl_upoly_free(up1);
462 isl_upoly_free(up2);
463 return NULL;
464 }
465
466 static __isl_give struct isl_upoly *replace_by_zero(
467 __isl_take struct isl_upoly *up)
468 {
469 struct isl_ctx *ctx;
470
471 if (!up)
472 return NULL;
473 ctx = up->ctx;
474 isl_upoly_free(up);
475 return isl_upoly_zero(ctx);
476 }
477
478 static __isl_give struct isl_upoly *replace_by_constant_term(
479 __isl_take struct isl_upoly *up)
480 {
481 struct isl_upoly_rec *rec;
482 struct isl_upoly *cst;
483
484 if (!up)
485 return NULL;
486
487 rec = isl_upoly_as_rec(up);
488 if (!rec)
489 goto error;
490 cst = isl_upoly_copy(rec->p[0]);
491 isl_upoly_free(up);
492 return cst;
493 error:
494 isl_upoly_free(up);
495 return NULL;
496 }
497
498 __isl_give struct isl_upoly *isl_upoly_sum(__isl_take struct isl_upoly *up1,
499 __isl_take struct isl_upoly *up2)
500 {
501 int i;
502 struct isl_upoly_rec *rec1, *rec2;
503
504 if (!up1 || !up2)
505 goto error;
506
507 if (isl_upoly_is_nan(up1)) {
508 isl_upoly_free(up2);
509 return up1;
510 }
511
512 if (isl_upoly_is_nan(up2)) {
513 isl_upoly_free(up1);
514 return up2;
515 }
516
517 if (isl_upoly_is_zero(up1)) {
518 isl_upoly_free(up1);
519 return up2;
520 }
521
522 if (isl_upoly_is_zero(up2)) {
523 isl_upoly_free(up2);
524 return up1;
525 }
526
527 if (up1->var < up2->var)
528 return isl_upoly_sum(up2, up1);
529
530 if (up2->var < up1->var) {
531 struct isl_upoly_rec *rec;
532 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
533 isl_upoly_free(up1);
534 return up2;
535 }
536 up1 = isl_upoly_cow(up1);
537 rec = isl_upoly_as_rec(up1);
538 if (!rec)
539 goto error;
540 rec->p[0] = isl_upoly_sum(rec->p[0], up2);
541 if (rec->n == 1)
542 up1 = replace_by_constant_term(up1);
543 return up1;
544 }
545
546 if (isl_upoly_is_cst(up1))
547 return isl_upoly_sum_cst(up1, up2);
548
549 rec1 = isl_upoly_as_rec(up1);
550 rec2 = isl_upoly_as_rec(up2);
551 if (!rec1 || !rec2)
552 goto error;
553
554 if (rec1->n < rec2->n)
555 return isl_upoly_sum(up2, up1);
556
557 up1 = isl_upoly_cow(up1);
558 rec1 = isl_upoly_as_rec(up1);
559 if (!rec1)
560 goto error;
561
562 for (i = rec2->n - 1; i >= 0; --i) {
563 rec1->p[i] = isl_upoly_sum(rec1->p[i],
564 isl_upoly_copy(rec2->p[i]));
565 if (!rec1->p[i])
566 goto error;
567 if (i == rec1->n - 1 && isl_upoly_is_zero(rec1->p[i])) {
568 isl_upoly_free(rec1->p[i]);
569 rec1->n--;
570 }
571 }
572
573 if (rec1->n == 0)
574 up1 = replace_by_zero(up1);
575 else if (rec1->n == 1)
576 up1 = replace_by_constant_term(up1);
577
578 isl_upoly_free(up2);
579
580 return up1;
581 error:
582 isl_upoly_free(up1);
583 isl_upoly_free(up2);
584 return NULL;
585 }
586
587 __isl_give struct isl_upoly *isl_upoly_neg_cst(__isl_take struct isl_upoly *up)
588 {
589 struct isl_upoly_cst *cst;
590
591 if (isl_upoly_is_zero(up))
592 return up;
593
594 up = isl_upoly_cow(up);
595 if (!up)
596 return NULL;
597
598 cst = isl_upoly_as_cst(up);
599
600 isl_int_neg(cst->n, cst->n);
601
602 return up;
603 }
604
605 __isl_give struct isl_upoly *isl_upoly_neg(__isl_take struct isl_upoly *up)
606 {
607 int i;
608 struct isl_upoly_rec *rec;
609
610 if (!up)
611 return NULL;
612
613 if (isl_upoly_is_cst(up))
614 return isl_upoly_neg_cst(up);
615
616 up = isl_upoly_cow(up);
617 rec = isl_upoly_as_rec(up);
618 if (!rec)
619 goto error;
620
621 for (i = 0; i < rec->n; ++i) {
622 rec->p[i] = isl_upoly_neg(rec->p[i]);
623 if (!rec->p[i])
624 goto error;
625 }
626
627 return up;
628 error:
629 isl_upoly_free(up);
630 return NULL;
631 }
632
633 __isl_give struct isl_upoly *isl_upoly_mul_cst(__isl_take struct isl_upoly *up1,
634 __isl_take struct isl_upoly *up2)
635 {
636 struct isl_upoly_cst *cst1;
637 struct isl_upoly_cst *cst2;
638
639 up1 = isl_upoly_cow(up1);
640 if (!up1 || !up2)
641 goto error;
642
643 cst1 = isl_upoly_as_cst(up1);
644 cst2 = isl_upoly_as_cst(up2);
645
646 isl_int_mul(cst1->n, cst1->n, cst2->n);
647 isl_int_mul(cst1->d, cst1->d, cst2->d);
648
649 isl_upoly_cst_reduce(cst1);
650
651 isl_upoly_free(up2);
652 return up1;
653 error:
654 isl_upoly_free(up1);
655 isl_upoly_free(up2);
656 return NULL;
657 }
658
659 __isl_give struct isl_upoly *isl_upoly_mul_rec(__isl_take struct isl_upoly *up1,
660 __isl_take struct isl_upoly *up2)
661 {
662 struct isl_upoly_rec *rec1;
663 struct isl_upoly_rec *rec2;
664 struct isl_upoly_rec *res;
665 int i, j;
666 int size;
667
668 rec1 = isl_upoly_as_rec(up1);
669 rec2 = isl_upoly_as_rec(up2);
670 if (!rec1 || !rec2)
671 goto error;
672 size = rec1->n + rec2->n - 1;
673 res = isl_upoly_alloc_rec(up1->ctx, up1->var, size);
674 if (!res)
675 goto error;
676
677 for (i = 0; i < rec1->n; ++i) {
678 res->p[i] = isl_upoly_mul(isl_upoly_copy(rec2->p[0]),
679 isl_upoly_copy(rec1->p[i]));
680 if (!res->p[i])
681 goto error;
682 res->n++;
683 }
684 for (; i < size; ++i) {
685 res->p[i] = isl_upoly_zero(up1->ctx);
686 if (!res->p[i])
687 goto error;
688 res->n++;
689 }
690 for (i = 0; i < rec1->n; ++i) {
691 for (j = 1; j < rec2->n; ++j) {
692 struct isl_upoly *up;
693 up = isl_upoly_mul(isl_upoly_copy(rec2->p[j]),
694 isl_upoly_copy(rec1->p[i]));
695 res->p[i + j] = isl_upoly_sum(res->p[i + j], up);
696 if (!res->p[i + j])
697 goto error;
698 }
699 }
700
701 isl_upoly_free(up1);
702 isl_upoly_free(up2);
703
704 return &res->up;
705 error:
706 isl_upoly_free(up1);
707 isl_upoly_free(up2);
708 isl_upoly_free(&res->up);
709 return NULL;
710 }
711
712 __isl_give struct isl_upoly *isl_upoly_mul(__isl_take struct isl_upoly *up1,
713 __isl_take struct isl_upoly *up2)
714 {
715 if (!up1 || !up2)
716 goto error;
717
718 if (isl_upoly_is_nan(up1)) {
719 isl_upoly_free(up2);
720 return up1;
721 }
722
723 if (isl_upoly_is_nan(up2)) {
724 isl_upoly_free(up1);
725 return up2;
726 }
727
728 if (isl_upoly_is_zero(up1)) {
729 isl_upoly_free(up2);
730 return up1;
731 }
732
733 if (isl_upoly_is_zero(up2)) {
734 isl_upoly_free(up1);
735 return up2;
736 }
737
738 if (isl_upoly_is_one(up1)) {
739 isl_upoly_free(up1);
740 return up2;
741 }
742
743 if (isl_upoly_is_one(up2)) {
744 isl_upoly_free(up2);
745 return up1;
746 }
747
748 if (up1->var < up2->var)
749 return isl_upoly_mul(up2, up1);
750
751 if (up2->var < up1->var) {
752 int i;
753 struct isl_upoly_rec *rec;
754 if (isl_upoly_is_infty(up2) || isl_upoly_is_neginfty(up2)) {
755 isl_ctx *ctx = up1->ctx;
756 isl_upoly_free(up1);
757 isl_upoly_free(up2);
758 return isl_upoly_nan(ctx);
759 }
760 up1 = isl_upoly_cow(up1);
761 rec = isl_upoly_as_rec(up1);
762 if (!rec)
763 goto error;
764
765 for (i = 0; i < rec->n; ++i) {
766 rec->p[i] = isl_upoly_mul(rec->p[i],
767 isl_upoly_copy(up2));
768 if (!rec->p[i])
769 goto error;
770 }
771 isl_upoly_free(up2);
772 return up1;
773 }
774
775 if (isl_upoly_is_cst(up1))
776 return isl_upoly_mul_cst(up1, up2);
777
778 return isl_upoly_mul_rec(up1, up2);
779 error:
780 isl_upoly_free(up1);
781 isl_upoly_free(up2);
782 return NULL;
783 }
784
785 __isl_give isl_qpolynomial *isl_qpolynomial_alloc(__isl_take isl_dim *dim,
786 unsigned n_div, __isl_take struct isl_upoly *up)
787 {
788 struct isl_qpolynomial *qp = NULL;
789 unsigned total;
790
791 if (!dim || !up)
792 goto error;
793
794 total = isl_dim_total(dim);
795
796 qp = isl_calloc_type(dim->ctx, struct isl_qpolynomial);
797 if (!qp)
798 goto error;
799
800 qp->ref = 1;
801 qp->div = isl_mat_alloc(dim->ctx, n_div, 1 + 1 + total + n_div);
802 if (!qp->div)
803 goto error;
804
805 qp->dim = dim;
806 qp->upoly = up;
807
808 return qp;
809 error:
810 isl_dim_free(dim);
811 isl_upoly_free(up);
812 isl_qpolynomial_free(qp);
813 return NULL;
814 }
815
816 __isl_give isl_qpolynomial *isl_qpolynomial_copy(__isl_keep isl_qpolynomial *qp)
817 {
818 if (!qp)
819 return NULL;
820
821 qp->ref++;
822 return qp;
823 }
824
825 __isl_give isl_qpolynomial *isl_qpolynomial_dup(__isl_keep isl_qpolynomial *qp)
826 {
827 struct isl_qpolynomial *dup;
828
829 if (!qp)
830 return NULL;
831
832 dup = isl_qpolynomial_alloc(isl_dim_copy(qp->dim), qp->div->n_row,
833 isl_upoly_copy(qp->upoly));
834 if (!dup)
835 return NULL;
836 isl_mat_free(dup->div);
837 dup->div = isl_mat_copy(qp->div);
838 if (!dup->div)
839 goto error;
840
841 return dup;
842 error:
843 isl_qpolynomial_free(dup);
844 return NULL;
845 }
846
847 __isl_give isl_qpolynomial *isl_qpolynomial_cow(__isl_take isl_qpolynomial *qp)
848 {
849 if (!qp)
850 return NULL;
851
852 if (qp->ref == 1)
853 return qp;
854 qp->ref--;
855 return isl_qpolynomial_dup(qp);
856 }
857
858 void isl_qpolynomial_free(__isl_take isl_qpolynomial *qp)
859 {
860 if (!qp)
861 return;
862
863 if (--qp->ref > 0)
864 return;
865
866 isl_dim_free(qp->dim);
867 isl_mat_free(qp->div);
868 isl_upoly_free(qp->upoly);
869
870 free(qp);
871 }
872
873 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2)
874 {
875 int n_row, n_col;
876 int equal;
877
878 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
879 div1->n_col >= div2->n_col, return -1);
880
881 if (div1->n_row == div2->n_row)
882 return isl_mat_is_equal(div1, div2);
883
884 n_row = div1->n_row;
885 n_col = div1->n_col;
886 div1->n_row = div2->n_row;
887 div1->n_col = div2->n_col;
888
889 equal = isl_mat_is_equal(div1, div2);
890
891 div1->n_row = n_row;
892 div1->n_col = n_col;
893
894 return equal;
895 }
896
897 static void expand_row(__isl_keep isl_mat *dst, int d,
898 __isl_keep isl_mat *src, int s, int *exp)
899 {
900 int i;
901 unsigned c = src->n_col - src->n_row;
902
903 isl_seq_cpy(dst->row[d], src->row[s], c);
904 isl_seq_clr(dst->row[d] + c, dst->n_col - c);
905
906 for (i = 0; i < s; ++i)
907 isl_int_set(dst->row[d][c + exp[i]], src->row[s][c + i]);
908 }
909
910 static int cmp_row(__isl_keep isl_mat *div, int i, int j)
911 {
912 int li, lj;
913
914 li = isl_seq_last_non_zero(div->row[i], div->n_col);
915 lj = isl_seq_last_non_zero(div->row[j], div->n_col);
916
917 if (li != lj)
918 return li - lj;
919
920 return isl_seq_cmp(div->row[i], div->row[j], div->n_col);
921 }
922
923 struct isl_div_sort_info {
924 isl_mat *div;
925 int row;
926 };
927
928 static int div_sort_cmp(const void *p1, const void *p2)
929 {
930 const struct isl_div_sort_info *i1, *i2;
931 i1 = (const struct isl_div_sort_info *) p1;
932 i2 = (const struct isl_div_sort_info *) p2;
933
934 return cmp_row(i1->div, i1->row, i2->row);
935 }
936
937 static __isl_give isl_mat *sort_divs(__isl_take isl_mat *div)
938 {
939 int i;
940 struct isl_div_sort_info *array = NULL;
941 int *pos = NULL;
942
943 if (!div)
944 return NULL;
945 if (div->n_row <= 1)
946 return div;
947
948 array = isl_alloc_array(div->ctx, struct isl_div_sort_info, div->n_row);
949 pos = isl_alloc_array(div->ctx, int, div->n_row);
950 if (!array || !pos)
951 goto error;
952
953 for (i = 0; i < div->n_row; ++i) {
954 array[i].div = div;
955 array[i].row = i;
956 pos[i] = i;
957 }
958
959 qsort(array, div->n_row, sizeof(struct isl_div_sort_info),
960 div_sort_cmp);
961
962 for (i = 0; i < div->n_row; ++i) {
963 int t;
964 if (pos[array[i].row] == i)
965 continue;
966 div = isl_mat_cow(div);
967 div = isl_mat_swap_rows(div, i, pos[array[i].row]);
968 t = pos[array[i].row];
969 pos[array[i].row] = pos[i];
970 pos[i] = t;
971 }
972
973 free(array);
974
975 return div;
976 error:
977 free(pos);
978 free(array);
979 isl_mat_free(div);
980 return NULL;
981 }
982
983 static __isl_give isl_mat *merge_divs(__isl_keep isl_mat *div1,
984 __isl_keep isl_mat *div2, int *exp1, int *exp2)
985 {
986 int i, j, k;
987 isl_mat *div = NULL;
988 unsigned d = div1->n_col - div1->n_row;
989
990 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
991 d + div1->n_row + div2->n_row);
992 if (!div)
993 return NULL;
994
995 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
996 int cmp;
997
998 expand_row(div, k, div1, i, exp1);
999 expand_row(div, k + 1, div2, j, exp2);
1000
1001 cmp = cmp_row(div, k, k + 1);
1002 if (cmp == 0) {
1003 exp1[i++] = k;
1004 exp2[j++] = k;
1005 } else if (cmp < 0) {
1006 exp1[i++] = k;
1007 } else {
1008 exp2[j++] = k;
1009 isl_seq_cpy(div->row[k], div->row[k + 1], div->n_col);
1010 }
1011 }
1012 for (; i < div1->n_row; ++i, ++k) {
1013 expand_row(div, k, div1, i, exp1);
1014 exp1[i] = k;
1015 }
1016 for (; j < div2->n_row; ++j, ++k) {
1017 expand_row(div, k, div2, j, exp2);
1018 exp2[j] = k;
1019 }
1020
1021 div->n_row = k;
1022 div->n_col = d + k;
1023
1024 return div;
1025 }
1026
1027 static __isl_give struct isl_upoly *expand(__isl_take struct isl_upoly *up,
1028 int *exp, int first)
1029 {
1030 int i;
1031 struct isl_upoly_rec *rec;
1032
1033 if (isl_upoly_is_cst(up))
1034 return up;
1035
1036 if (up->var < first)
1037 return up;
1038
1039 if (exp[up->var - first] == up->var - first)
1040 return up;
1041
1042 up = isl_upoly_cow(up);
1043 if (!up)
1044 goto error;
1045
1046 up->var = exp[up->var - first] + first;
1047
1048 rec = isl_upoly_as_rec(up);
1049 if (!rec)
1050 goto error;
1051
1052 for (i = 0; i < rec->n; ++i) {
1053 rec->p[i] = expand(rec->p[i], exp, first);
1054 if (!rec->p[i])
1055 goto error;
1056 }
1057
1058 return up;
1059 error:
1060 isl_upoly_free(up);
1061 return NULL;
1062 }
1063
1064 static __isl_give isl_qpolynomial *with_merged_divs(
1065 __isl_give isl_qpolynomial *(*fn)(__isl_take isl_qpolynomial *qp1,
1066 __isl_take isl_qpolynomial *qp2),
1067 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1068 {
1069 int *exp1 = NULL;
1070 int *exp2 = NULL;
1071 isl_mat *div = NULL;
1072
1073 qp1 = isl_qpolynomial_cow(qp1);
1074 qp2 = isl_qpolynomial_cow(qp2);
1075
1076 if (!qp1 || !qp2)
1077 goto error;
1078
1079 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1080 qp1->div->n_col >= qp2->div->n_col, goto error);
1081
1082 exp1 = isl_alloc_array(qp1->div->ctx, int, qp1->div->n_row);
1083 exp2 = isl_alloc_array(qp2->div->ctx, int, qp2->div->n_row);
1084 if (!exp1 || !exp2)
1085 goto error;
1086
1087 div = merge_divs(qp1->div, qp2->div, exp1, exp2);
1088 if (!div)
1089 goto error;
1090
1091 isl_mat_free(qp1->div);
1092 qp1->div = isl_mat_copy(div);
1093 isl_mat_free(qp2->div);
1094 qp2->div = isl_mat_copy(div);
1095
1096 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1097 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1098
1099 if (!qp1->upoly || !qp2->upoly)
1100 goto error;
1101
1102 isl_mat_free(div);
1103 free(exp1);
1104 free(exp2);
1105
1106 return fn(qp1, qp2);
1107 error:
1108 isl_mat_free(div);
1109 free(exp1);
1110 free(exp2);
1111 isl_qpolynomial_free(qp1);
1112 isl_qpolynomial_free(qp2);
1113 return NULL;
1114 }
1115
1116 __isl_give isl_qpolynomial *isl_qpolynomial_add(__isl_take isl_qpolynomial *qp1,
1117 __isl_take isl_qpolynomial *qp2)
1118 {
1119 qp1 = isl_qpolynomial_cow(qp1);
1120
1121 if (!qp1 || !qp2)
1122 goto error;
1123
1124 if (qp1->div->n_row < qp2->div->n_row)
1125 return isl_qpolynomial_add(qp2, qp1);
1126
1127 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1128 if (!compatible_divs(qp1->div, qp2->div))
1129 return with_merged_divs(isl_qpolynomial_add, qp1, qp2);
1130
1131 qp1->upoly = isl_upoly_sum(qp1->upoly, isl_upoly_copy(qp2->upoly));
1132 if (!qp1->upoly)
1133 goto error;
1134
1135 isl_qpolynomial_free(qp2);
1136
1137 return qp1;
1138 error:
1139 isl_qpolynomial_free(qp1);
1140 isl_qpolynomial_free(qp2);
1141 return NULL;
1142 }
1143
1144 __isl_give isl_qpolynomial *isl_qpolynomial_sub(__isl_take isl_qpolynomial *qp1,
1145 __isl_take isl_qpolynomial *qp2)
1146 {
1147 return isl_qpolynomial_add(qp1, isl_qpolynomial_neg(qp2));
1148 }
1149
1150 __isl_give isl_qpolynomial *isl_qpolynomial_neg(__isl_take isl_qpolynomial *qp)
1151 {
1152 qp = isl_qpolynomial_cow(qp);
1153
1154 if (!qp)
1155 return NULL;
1156
1157 qp->upoly = isl_upoly_neg(qp->upoly);
1158 if (!qp->upoly)
1159 goto error;
1160
1161 return qp;
1162 error:
1163 isl_qpolynomial_free(qp);
1164 return NULL;
1165 }
1166
1167 __isl_give isl_qpolynomial *isl_qpolynomial_mul(__isl_take isl_qpolynomial *qp1,
1168 __isl_take isl_qpolynomial *qp2)
1169 {
1170 qp1 = isl_qpolynomial_cow(qp1);
1171
1172 if (!qp1 || !qp2)
1173 goto error;
1174
1175 if (qp1->div->n_row < qp2->div->n_row)
1176 return isl_qpolynomial_mul(qp2, qp1);
1177
1178 isl_assert(qp1->dim->ctx, isl_dim_equal(qp1->dim, qp2->dim), goto error);
1179 if (!compatible_divs(qp1->div, qp2->div))
1180 return with_merged_divs(isl_qpolynomial_mul, qp1, qp2);
1181
1182 qp1->upoly = isl_upoly_mul(qp1->upoly, isl_upoly_copy(qp2->upoly));
1183 if (!qp1->upoly)
1184 goto error;
1185
1186 isl_qpolynomial_free(qp2);
1187
1188 return qp1;
1189 error:
1190 isl_qpolynomial_free(qp1);
1191 isl_qpolynomial_free(qp2);
1192 return NULL;
1193 }
1194
1195 __isl_give isl_qpolynomial *isl_qpolynomial_zero(__isl_take isl_dim *dim)
1196 {
1197 return isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1198 }
1199
1200 __isl_give isl_qpolynomial *isl_qpolynomial_infty(__isl_take isl_dim *dim)
1201 {
1202 return isl_qpolynomial_alloc(dim, 0, isl_upoly_infty(dim->ctx));
1203 }
1204
1205 __isl_give isl_qpolynomial *isl_qpolynomial_nan(__isl_take isl_dim *dim)
1206 {
1207 return isl_qpolynomial_alloc(dim, 0, isl_upoly_nan(dim->ctx));
1208 }
1209
1210 __isl_give isl_qpolynomial *isl_qpolynomial_cst(__isl_take isl_dim *dim,
1211 isl_int v)
1212 {
1213 struct isl_qpolynomial *qp;
1214 struct isl_upoly_cst *cst;
1215
1216 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1217 if (!qp)
1218 return NULL;
1219
1220 cst = isl_upoly_as_cst(qp->upoly);
1221 isl_int_set(cst->n, v);
1222
1223 return qp;
1224 error:
1225 isl_qpolynomial_free(qp);
1226 return NULL;
1227 }
1228
1229 int isl_qpolynomial_is_cst(__isl_keep isl_qpolynomial *qp,
1230 isl_int *n, isl_int *d)
1231 {
1232 struct isl_upoly_cst *cst;
1233
1234 if (!qp)
1235 return -1;
1236
1237 if (!isl_upoly_is_cst(qp->upoly))
1238 return 0;
1239
1240 cst = isl_upoly_as_cst(qp->upoly);
1241 if (!cst)
1242 return -1;
1243
1244 if (n)
1245 isl_int_set(*n, cst->n);
1246 if (d)
1247 isl_int_set(*d, cst->d);
1248
1249 return 1;
1250 }
1251
1252 int isl_qpolynomial_is_equal(__isl_keep isl_qpolynomial *qp1,
1253 __isl_keep isl_qpolynomial *qp2)
1254 {
1255 if (!qp1 || !qp2)
1256 return -1;
1257
1258 return isl_upoly_is_equal(qp1->upoly, qp2->upoly);
1259 }
1260
1261 static void upoly_update_den(__isl_keep struct isl_upoly *up, isl_int *d)
1262 {
1263 int i;
1264 struct isl_upoly_rec *rec;
1265
1266 if (isl_upoly_is_cst(up)) {
1267 struct isl_upoly_cst *cst;
1268 cst = isl_upoly_as_cst(up);
1269 if (!cst)
1270 return;
1271 isl_int_lcm(*d, *d, cst->d);
1272 return;
1273 }
1274
1275 rec = isl_upoly_as_rec(up);
1276 if (!rec)
1277 return;
1278
1279 for (i = 0; i < rec->n; ++i)
1280 upoly_update_den(rec->p[i], d);
1281 }
1282
1283 void isl_qpolynomial_get_den(__isl_keep isl_qpolynomial *qp, isl_int *d)
1284 {
1285 isl_int_set_si(*d, 1);
1286 if (!qp)
1287 return;
1288 upoly_update_den(qp->upoly, d);
1289 }
1290
1291 __isl_give struct isl_upoly *isl_upoly_pow(isl_ctx *ctx, int pos, int power)
1292 {
1293 int i;
1294 struct isl_upoly *up;
1295 struct isl_upoly_rec *rec;
1296 struct isl_upoly_cst *cst;
1297
1298 rec = isl_upoly_alloc_rec(ctx, pos, 1 + power);
1299 if (!rec)
1300 return NULL;
1301 for (i = 0; i < 1 + power; ++i) {
1302 rec->p[i] = isl_upoly_zero(ctx);
1303 if (!rec->p[i])
1304 goto error;
1305 rec->n++;
1306 }
1307 cst = isl_upoly_as_cst(rec->p[power]);
1308 isl_int_set_si(cst->n, 1);
1309
1310 return &rec->up;
1311 error:
1312 isl_upoly_free(&rec->up);
1313 return NULL;
1314 }
1315
1316 __isl_give isl_qpolynomial *isl_qpolynomial_pow(__isl_take isl_dim *dim,
1317 int pos, int power)
1318 {
1319 struct isl_ctx *ctx;
1320
1321 if (!dim)
1322 return NULL;
1323
1324 ctx = dim->ctx;
1325
1326 return isl_qpolynomial_alloc(dim, 0, isl_upoly_pow(ctx, pos, power));
1327 }
1328
1329 __isl_give isl_qpolynomial *isl_qpolynomial_var(__isl_take isl_dim *dim,
1330 enum isl_dim_type type, unsigned pos)
1331 {
1332 if (!dim)
1333 return NULL;
1334
1335 isl_assert(dim->ctx, isl_dim_size(dim, isl_dim_in) == 0, goto error);
1336 isl_assert(dim->ctx, pos < isl_dim_size(dim, type), goto error);
1337
1338 if (type == isl_dim_set)
1339 pos += isl_dim_size(dim, isl_dim_param);
1340
1341 return isl_qpolynomial_pow(dim, pos, 1);
1342 error:
1343 isl_dim_free(dim);
1344 return NULL;
1345 }
1346
1347 __isl_give isl_qpolynomial *isl_qpolynomial_div_pow(__isl_take isl_div *div,
1348 int power)
1349 {
1350 struct isl_qpolynomial *qp = NULL;
1351 struct isl_upoly_rec *rec;
1352 struct isl_upoly_cst *cst;
1353 int i;
1354 int pos;
1355
1356 if (!div)
1357 return NULL;
1358 isl_assert(div->ctx, div->bmap->n_div == 1, goto error);
1359
1360 pos = isl_dim_total(div->bmap->dim);
1361 rec = isl_upoly_alloc_rec(div->ctx, pos, 1 + power);
1362 qp = isl_qpolynomial_alloc(isl_basic_map_get_dim(div->bmap), 1,
1363 &rec->up);
1364 if (!qp)
1365 goto error;
1366
1367 isl_seq_cpy(qp->div->row[0], div->line[0], qp->div->n_col - 1);
1368 isl_int_set_si(qp->div->row[0][qp->div->n_col - 1], 0);
1369
1370 for (i = 0; i < 1 + power; ++i) {
1371 rec->p[i] = isl_upoly_zero(div->ctx);
1372 if (!rec->p[i])
1373 goto error;
1374 rec->n++;
1375 }
1376 cst = isl_upoly_as_cst(rec->p[power]);
1377 isl_int_set_si(cst->n, 1);
1378
1379 isl_div_free(div);
1380
1381 return qp;
1382 error:
1383 isl_qpolynomial_free(qp);
1384 isl_div_free(div);
1385 return NULL;
1386 }
1387
1388 __isl_give isl_qpolynomial *isl_qpolynomial_div(__isl_take isl_div *div)
1389 {
1390 return isl_qpolynomial_div_pow(div, 1);
1391 }
1392
1393 __isl_give isl_qpolynomial *isl_qpolynomial_rat_cst(__isl_take isl_dim *dim,
1394 const isl_int n, const isl_int d)
1395 {
1396 struct isl_qpolynomial *qp;
1397 struct isl_upoly_cst *cst;
1398
1399 qp = isl_qpolynomial_alloc(dim, 0, isl_upoly_zero(dim->ctx));
1400 if (!qp)
1401 return NULL;
1402
1403 cst = isl_upoly_as_cst(qp->upoly);
1404 isl_int_set(cst->n, n);
1405 isl_int_set(cst->d, d);
1406
1407 return qp;
1408 error:
1409 isl_qpolynomial_free(qp);
1410 return NULL;
1411 }
1412
1413 static int up_set_active(__isl_keep struct isl_upoly *up, int *active, int d)
1414 {
1415 struct isl_upoly_rec *rec;
1416 int i;
1417
1418 if (!up)
1419 return -1;
1420
1421 if (isl_upoly_is_cst(up))
1422 return 0;
1423
1424 if (up->var < d)
1425 active[up->var] = 1;
1426
1427 rec = isl_upoly_as_rec(up);
1428 for (i = 0; i < rec->n; ++i)
1429 if (up_set_active(rec->p[i], active, d) < 0)
1430 return -1;
1431
1432 return 0;
1433 }
1434
1435 static int set_active(__isl_keep isl_qpolynomial *qp, int *active)
1436 {
1437 int i, j;
1438 int d = isl_dim_total(qp->dim);
1439
1440 if (!qp || !active)
1441 return -1;
1442
1443 for (i = 0; i < d; ++i)
1444 for (j = 0; j < qp->div->n_row; ++j) {
1445 if (isl_int_is_zero(qp->div->row[j][2 + i]))
1446 continue;
1447 active[i] = 1;
1448 break;
1449 }
1450
1451 return up_set_active(qp->upoly, active, d);
1452 }
1453
1454 int isl_qpolynomial_involves_dims(__isl_keep isl_qpolynomial *qp,
1455 enum isl_dim_type type, unsigned first, unsigned n)
1456 {
1457 int i;
1458 int *active = NULL;
1459 int involves = 0;
1460
1461 if (!qp)
1462 return -1;
1463 if (n == 0)
1464 return 0;
1465
1466 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1467 return -1);
1468 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1469 type == isl_dim_set, return -1);
1470
1471 active = isl_calloc_array(set->ctx, int, isl_dim_total(qp->dim));
1472 if (set_active(qp, active) < 0)
1473 goto error;
1474
1475 if (type == isl_dim_set)
1476 first += isl_dim_size(qp->dim, isl_dim_param);
1477 for (i = 0; i < n; ++i)
1478 if (active[first + i]) {
1479 involves = 1;
1480 break;
1481 }
1482
1483 free(active);
1484
1485 return involves;
1486 error:
1487 free(active);
1488 return -1;
1489 }
1490
1491 __isl_give struct isl_upoly *isl_upoly_drop(__isl_take struct isl_upoly *up,
1492 unsigned first, unsigned n)
1493 {
1494 int i;
1495 struct isl_upoly_rec *rec;
1496
1497 if (!up)
1498 return NULL;
1499 if (n == 0 || up->var < 0 || up->var < first)
1500 return up;
1501 if (up->var < first + n) {
1502 up = replace_by_constant_term(up);
1503 return isl_upoly_drop(up, first, n);
1504 }
1505 up = isl_upoly_cow(up);
1506 if (!up)
1507 return NULL;
1508 up->var -= n;
1509 rec = isl_upoly_as_rec(up);
1510 if (!rec)
1511 goto error;
1512
1513 for (i = 0; i < rec->n; ++i) {
1514 rec->p[i] = isl_upoly_drop(rec->p[i], first, n);
1515 if (!rec->p[i])
1516 goto error;
1517 }
1518
1519 return up;
1520 error:
1521 isl_upoly_free(up);
1522 return NULL;
1523 }
1524
1525 __isl_give isl_qpolynomial *isl_qpolynomial_drop_dims(
1526 __isl_take isl_qpolynomial *qp,
1527 enum isl_dim_type type, unsigned first, unsigned n)
1528 {
1529 if (!qp)
1530 return NULL;
1531 if (n == 0)
1532 return qp;
1533
1534 qp = isl_qpolynomial_cow(qp);
1535 if (!qp)
1536 return NULL;
1537
1538 isl_assert(qp->dim->ctx, first + n <= isl_dim_size(qp->dim, type),
1539 goto error);
1540 isl_assert(qp->dim->ctx, type == isl_dim_param ||
1541 type == isl_dim_set, goto error);
1542
1543 qp->dim = isl_dim_drop(qp->dim, type, first, n);
1544 if (!qp->dim)
1545 goto error;
1546
1547 if (type == isl_dim_set)
1548 first += isl_dim_size(qp->dim, isl_dim_param);
1549
1550 qp->div = isl_mat_drop_cols(qp->div, 2 + first, n);
1551 if (!qp->div)
1552 goto error;
1553
1554 qp->upoly = isl_upoly_drop(qp->upoly, first, n);
1555 if (!qp->upoly)
1556 goto error;
1557
1558 return qp;
1559 error:
1560 isl_qpolynomial_free(qp);
1561 return NULL;
1562 }
1563
1564 #undef PW
1565 #define PW isl_pw_qpolynomial
1566 #undef EL
1567 #define EL isl_qpolynomial
1568 #undef IS_ZERO
1569 #define IS_ZERO is_zero
1570 #undef FIELD
1571 #define FIELD qp
1572 #undef ADD
1573 #define ADD add
1574
1575 #include <isl_pw_templ.c>
1576
1577 int isl_pw_qpolynomial_is_one(__isl_keep isl_pw_qpolynomial *pwqp)
1578 {
1579 if (!pwqp)
1580 return -1;
1581
1582 if (pwqp->n != -1)
1583 return 0;
1584
1585 if (!isl_set_fast_is_universe(pwqp->p[0].set))
1586 return 0;
1587
1588 return isl_qpolynomial_is_one(pwqp->p[0].qp);
1589 }
1590
1591 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_mul(
1592 __isl_take isl_pw_qpolynomial *pwqp1,
1593 __isl_take isl_pw_qpolynomial *pwqp2)
1594 {
1595 int i, j, n;
1596 struct isl_pw_qpolynomial *res;
1597 isl_set *set;
1598
1599 if (!pwqp1 || !pwqp2)
1600 goto error;
1601
1602 isl_assert(pwqp1->dim->ctx, isl_dim_equal(pwqp1->dim, pwqp2->dim),
1603 goto error);
1604
1605 if (isl_pw_qpolynomial_is_zero(pwqp1)) {
1606 isl_pw_qpolynomial_free(pwqp2);
1607 return pwqp1;
1608 }
1609
1610 if (isl_pw_qpolynomial_is_zero(pwqp2)) {
1611 isl_pw_qpolynomial_free(pwqp1);
1612 return pwqp2;
1613 }
1614
1615 if (isl_pw_qpolynomial_is_one(pwqp1)) {
1616 isl_pw_qpolynomial_free(pwqp1);
1617 return pwqp2;
1618 }
1619
1620 if (isl_pw_qpolynomial_is_one(pwqp2)) {
1621 isl_pw_qpolynomial_free(pwqp2);
1622 return pwqp1;
1623 }
1624
1625 n = pwqp1->n * pwqp2->n;
1626 res = isl_pw_qpolynomial_alloc_(isl_dim_copy(pwqp1->dim), n);
1627
1628 for (i = 0; i < pwqp1->n; ++i) {
1629 for (j = 0; j < pwqp2->n; ++j) {
1630 struct isl_set *common;
1631 struct isl_qpolynomial *prod;
1632 common = isl_set_intersect(isl_set_copy(pwqp1->p[i].set),
1633 isl_set_copy(pwqp2->p[j].set));
1634 if (isl_set_fast_is_empty(common)) {
1635 isl_set_free(common);
1636 continue;
1637 }
1638
1639 prod = isl_qpolynomial_mul(
1640 isl_qpolynomial_copy(pwqp1->p[i].qp),
1641 isl_qpolynomial_copy(pwqp2->p[j].qp));
1642
1643 res = isl_pw_qpolynomial_add_piece(res, common, prod);
1644 }
1645 }
1646
1647 isl_pw_qpolynomial_free(pwqp1);
1648 isl_pw_qpolynomial_free(pwqp2);
1649
1650 return res;
1651 error:
1652 isl_pw_qpolynomial_free(pwqp1);
1653 isl_pw_qpolynomial_free(pwqp2);
1654 return NULL;
1655 }
1656
1657 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_neg(
1658 __isl_take isl_pw_qpolynomial *pwqp)
1659 {
1660 int i, j, n;
1661 struct isl_pw_qpolynomial *res;
1662 isl_set *set;
1663
1664 if (!pwqp)
1665 return NULL;
1666
1667 if (isl_pw_qpolynomial_is_zero(pwqp))
1668 return pwqp;
1669
1670 pwqp = isl_pw_qpolynomial_cow(pwqp);
1671
1672 for (i = 0; i < pwqp->n; ++i) {
1673 pwqp->p[i].qp = isl_qpolynomial_neg(pwqp->p[i].qp);
1674 if (!pwqp->p[i].qp)
1675 goto error;
1676 }
1677
1678 return pwqp;
1679 error:
1680 isl_pw_qpolynomial_free(pwqp);
1681 return NULL;
1682 }
1683
1684 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_sub(
1685 __isl_take isl_pw_qpolynomial *pwqp1,
1686 __isl_take isl_pw_qpolynomial *pwqp2)
1687 {
1688 return isl_pw_qpolynomial_add(pwqp1, isl_pw_qpolynomial_neg(pwqp2));
1689 }
1690
1691 __isl_give struct isl_upoly *isl_upoly_eval(
1692 __isl_take struct isl_upoly *up, __isl_take isl_vec *vec)
1693 {
1694 int i;
1695 struct isl_upoly_rec *rec;
1696 struct isl_upoly *res;
1697 struct isl_upoly *base;
1698
1699 if (isl_upoly_is_cst(up)) {
1700 isl_vec_free(vec);
1701 return up;
1702 }
1703
1704 rec = isl_upoly_as_rec(up);
1705 if (!rec)
1706 goto error;
1707
1708 isl_assert(up->ctx, rec->n >= 1, goto error);
1709
1710 base = isl_upoly_rat_cst(up->ctx, vec->el[1 + up->var], vec->el[0]);
1711
1712 res = isl_upoly_eval(isl_upoly_copy(rec->p[rec->n - 1]),
1713 isl_vec_copy(vec));
1714
1715 for (i = rec->n - 2; i >= 0; --i) {
1716 res = isl_upoly_mul(res, isl_upoly_copy(base));
1717 res = isl_upoly_sum(res,
1718 isl_upoly_eval(isl_upoly_copy(rec->p[i]),
1719 isl_vec_copy(vec)));
1720 }
1721
1722 isl_upoly_free(base);
1723 isl_upoly_free(up);
1724 isl_vec_free(vec);
1725 return res;
1726 error:
1727 isl_upoly_free(up);
1728 isl_vec_free(vec);
1729 return NULL;
1730 }
1731
1732 __isl_give isl_qpolynomial *isl_qpolynomial_eval(
1733 __isl_take isl_qpolynomial *qp, __isl_take isl_point *pnt)
1734 {
1735 isl_vec *ext;
1736 struct isl_upoly *up;
1737 isl_dim *dim;
1738
1739 if (!qp || !pnt)
1740 goto error;
1741 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, qp->dim), goto error);
1742
1743 if (qp->div->n_row == 0)
1744 ext = isl_vec_copy(pnt->vec);
1745 else {
1746 int i;
1747 unsigned dim = isl_dim_total(qp->dim);
1748 ext = isl_vec_alloc(qp->dim->ctx, 1 + dim + qp->div->n_row);
1749 if (!ext)
1750 goto error;
1751
1752 isl_seq_cpy(ext->el, pnt->vec->el, pnt->vec->size);
1753 for (i = 0; i < qp->div->n_row; ++i) {
1754 isl_seq_inner_product(qp->div->row[i] + 1, ext->el,
1755 1 + dim + i, &ext->el[1+dim+i]);
1756 isl_int_fdiv_q(ext->el[1+dim+i], ext->el[1+dim+i],
1757 qp->div->row[i][0]);
1758 }
1759 }
1760
1761 up = isl_upoly_eval(isl_upoly_copy(qp->upoly), ext);
1762 if (!up)
1763 goto error;
1764
1765 dim = isl_dim_copy(qp->dim);
1766 isl_qpolynomial_free(qp);
1767 isl_point_free(pnt);
1768
1769 return isl_qpolynomial_alloc(dim, 0, up);
1770 error:
1771 isl_qpolynomial_free(qp);
1772 isl_point_free(pnt);
1773 return NULL;
1774 }
1775
1776 int isl_upoly_cmp(__isl_keep struct isl_upoly_cst *cst1,
1777 __isl_keep struct isl_upoly_cst *cst2)
1778 {
1779 int cmp;
1780 isl_int t;
1781 isl_int_init(t);
1782 isl_int_mul(t, cst1->n, cst2->d);
1783 isl_int_submul(t, cst2->n, cst1->d);
1784 cmp = isl_int_sgn(t);
1785 isl_int_clear(t);
1786 return cmp;
1787 }
1788
1789 __isl_give isl_qpolynomial *isl_qpolynomial_min_cst(
1790 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1791 {
1792 struct isl_upoly_cst *cst1, *cst2;
1793 int cmp;
1794
1795 if (!qp1 || !qp2)
1796 goto error;
1797 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1798 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1799 cst1 = isl_upoly_as_cst(qp1->upoly);
1800 cst2 = isl_upoly_as_cst(qp2->upoly);
1801 cmp = isl_upoly_cmp(cst1, cst2);
1802
1803 if (cmp <= 0) {
1804 isl_qpolynomial_free(qp2);
1805 } else {
1806 isl_qpolynomial_free(qp1);
1807 qp1 = qp2;
1808 }
1809 return qp1;
1810 error:
1811 isl_qpolynomial_free(qp1);
1812 isl_qpolynomial_free(qp2);
1813 return NULL;
1814 }
1815
1816 __isl_give isl_qpolynomial *isl_qpolynomial_max_cst(
1817 __isl_take isl_qpolynomial *qp1, __isl_take isl_qpolynomial *qp2)
1818 {
1819 struct isl_upoly_cst *cst1, *cst2;
1820 int cmp;
1821
1822 if (!qp1 || !qp2)
1823 goto error;
1824 isl_assert(qp1->dim->ctx, isl_upoly_is_cst(qp1->upoly), goto error);
1825 isl_assert(qp2->dim->ctx, isl_upoly_is_cst(qp2->upoly), goto error);
1826 cst1 = isl_upoly_as_cst(qp1->upoly);
1827 cst2 = isl_upoly_as_cst(qp2->upoly);
1828 cmp = isl_upoly_cmp(cst1, cst2);
1829
1830 if (cmp >= 0) {
1831 isl_qpolynomial_free(qp2);
1832 } else {
1833 isl_qpolynomial_free(qp1);
1834 qp1 = qp2;
1835 }
1836 return qp1;
1837 error:
1838 isl_qpolynomial_free(qp1);
1839 isl_qpolynomial_free(qp2);
1840 return NULL;
1841 }
1842
1843 static int *reordering_move(isl_ctx *ctx,
1844 unsigned len, unsigned dst, unsigned src, unsigned n)
1845 {
1846 int i;
1847 int *reordering;
1848
1849 reordering = isl_alloc_array(ctx, int, len);
1850 if (!reordering)
1851 return NULL;
1852
1853 if (dst <= src) {
1854 for (i = 0; i < dst; ++i)
1855 reordering[i] = i;
1856 for (i = 0; i < n; ++i)
1857 reordering[src + i] = dst + i;
1858 for (i = 0; i < src - dst; ++i)
1859 reordering[dst + i] = dst + n + i;
1860 for (i = 0; i < len - src - n; ++i)
1861 reordering[src + n + i] = src + n + i;
1862 } else {
1863 for (i = 0; i < src; ++i)
1864 reordering[i] = i;
1865 for (i = 0; i < n; ++i)
1866 reordering[src + i] = dst + i;
1867 for (i = 0; i < dst - src; ++i)
1868 reordering[src + n + i] = src + i;
1869 for (i = 0; i < len - dst - n; ++i)
1870 reordering[dst + n + i] = dst + n + i;
1871 }
1872
1873 return reordering;
1874 }
1875
1876 static __isl_give struct isl_upoly *reorder(__isl_take struct isl_upoly *up,
1877 int *r)
1878 {
1879 int i;
1880 struct isl_upoly_rec *rec;
1881 struct isl_upoly *base;
1882 struct isl_upoly *res;
1883
1884 if (isl_upoly_is_cst(up))
1885 return up;
1886
1887 rec = isl_upoly_as_rec(up);
1888 if (!rec)
1889 goto error;
1890
1891 isl_assert(up->ctx, rec->n >= 1, goto error);
1892
1893 base = isl_upoly_pow(up->ctx, r[up->var], 1);
1894 res = reorder(isl_upoly_copy(rec->p[rec->n - 1]), r);
1895
1896 for (i = rec->n - 2; i >= 0; --i) {
1897 res = isl_upoly_mul(res, isl_upoly_copy(base));
1898 res = isl_upoly_sum(res, reorder(isl_upoly_copy(rec->p[i]), r));
1899 }
1900
1901 isl_upoly_free(base);
1902 isl_upoly_free(up);
1903
1904 return res;
1905 error:
1906 isl_upoly_free(up);
1907 return NULL;
1908 }
1909
1910 __isl_give isl_qpolynomial *isl_qpolynomial_move(__isl_take isl_qpolynomial *qp,
1911 enum isl_dim_type dst_type, unsigned dst_pos,
1912 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1913 {
1914 unsigned g_dst_pos;
1915 unsigned g_src_pos;
1916 int *reordering;
1917
1918 qp = isl_qpolynomial_cow(qp);
1919 if (!qp)
1920 return NULL;
1921
1922 isl_assert(qp->dim->ctx, src_pos + n <= isl_dim_size(qp->dim, src_type),
1923 goto error);
1924
1925 g_dst_pos = pos(qp->dim, dst_type) + dst_pos;
1926 g_src_pos = pos(qp->dim, src_type) + src_pos;
1927 if (dst_type > src_type)
1928 g_dst_pos -= n;
1929
1930 qp->div = isl_mat_move_cols(qp->div, 2 + g_dst_pos, 2 + g_src_pos, n);
1931 qp->div = sort_divs(qp->div);
1932 if (!qp->div)
1933 goto error;
1934
1935 reordering = reordering_move(qp->dim->ctx,
1936 qp->div->n_col - 2, g_dst_pos, g_src_pos, n);
1937 if (!reordering)
1938 goto error;
1939
1940 qp->upoly = reorder(qp->upoly, reordering);
1941 free(reordering);
1942 if (!qp->upoly)
1943 goto error;
1944
1945 qp->dim = isl_dim_move(qp->dim, dst_type, dst_pos, src_type, src_pos, n);
1946 if (!qp->dim)
1947 goto error;
1948
1949 return qp;
1950 error:
1951 isl_qpolynomial_free(qp);
1952 return NULL;
1953 }
1954
1955 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_move(
1956 __isl_take isl_pw_qpolynomial *pwqp,
1957 enum isl_dim_type dst_type, unsigned dst_pos,
1958 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1959 {
1960 int i;
1961
1962 pwqp = isl_pw_qpolynomial_cow(pwqp);
1963 if (!pwqp)
1964 return NULL;
1965
1966 pwqp->dim = isl_dim_move(pwqp->dim,
1967 dst_type, dst_pos, src_type, src_pos, n);
1968 if (!pwqp->dim)
1969 goto error;
1970
1971 for (i = 0; i < pwqp->n; ++i) {
1972 pwqp->p[i].set = isl_set_move(pwqp->p[i].set, dst_type, dst_pos,
1973 src_type, src_pos, n);
1974 if (!pwqp->p[i].set)
1975 goto error;
1976 pwqp->p[i].qp = isl_qpolynomial_move(pwqp->p[i].qp,
1977 dst_type, dst_pos, src_type, src_pos, n);
1978 if (!pwqp->p[i].qp)
1979 goto error;
1980 }
1981
1982 return pwqp;
1983 error:
1984 isl_pw_qpolynomial_free(pwqp);
1985 return NULL;
1986 }
1987
1988 __isl_give isl_dim *isl_pw_qpolynomial_get_dim(
1989 __isl_keep isl_pw_qpolynomial *pwqp)
1990 {
1991 if (!pwqp)
1992 return NULL;
1993
1994 return isl_dim_copy(pwqp->dim);
1995 }
1996
1997 unsigned isl_pw_qpolynomial_dim(__isl_keep isl_pw_qpolynomial *pwqp,
1998 enum isl_dim_type type)
1999 {
2000 return pwqp ? isl_dim_size(pwqp->dim, type) : 0;
2001 }
2002
2003 __isl_give isl_term *isl_term_alloc(__isl_take isl_dim *dim,
2004 __isl_take isl_mat *div)
2005 {
2006 isl_term *term;
2007 int n;
2008
2009 if (!dim || !div)
2010 goto error;
2011
2012 n = isl_dim_total(dim) + div->n_row;
2013
2014 term = isl_calloc(dim->ctx, struct isl_term,
2015 sizeof(struct isl_term) + (n - 1) * sizeof(int));
2016 if (!term)
2017 goto error;
2018
2019 term->ref = 1;
2020 term->dim = dim;
2021 term->div = div;
2022 isl_int_init(term->n);
2023 isl_int_init(term->d);
2024
2025 return term;
2026 error:
2027 isl_dim_free(dim);
2028 isl_mat_free(div);
2029 return NULL;
2030 }
2031
2032 __isl_give isl_term *isl_term_copy(__isl_keep isl_term *term)
2033 {
2034 if (!term)
2035 return NULL;
2036
2037 term->ref++;
2038 return term;
2039 }
2040
2041 __isl_give isl_term *isl_term_dup(__isl_keep isl_term *term)
2042 {
2043 int i;
2044 isl_term *dup;
2045 unsigned total;
2046
2047 if (term)
2048 return NULL;
2049
2050 total = isl_dim_total(term->dim) + term->div->n_row;
2051
2052 dup = isl_term_alloc(isl_dim_copy(term->dim), isl_mat_copy(term->div));
2053 if (!dup)
2054 return NULL;
2055
2056 isl_int_set(dup->n, term->n);
2057 isl_int_set(dup->d, term->d);
2058
2059 for (i = 0; i < total; ++i)
2060 dup->pow[i] = term->pow[i];
2061
2062 return dup;
2063 }
2064
2065 __isl_give isl_term *isl_term_cow(__isl_take isl_term *term)
2066 {
2067 if (!term)
2068 return NULL;
2069
2070 if (term->ref == 1)
2071 return term;
2072 term->ref--;
2073 return isl_term_dup(term);
2074 }
2075
2076 void isl_term_free(__isl_take isl_term *term)
2077 {
2078 if (!term)
2079 return;
2080
2081 if (--term->ref > 0)
2082 return;
2083
2084 isl_dim_free(term->dim);
2085 isl_mat_free(term->div);
2086 isl_int_clear(term->n);
2087 isl_int_clear(term->d);
2088 free(term);
2089 }
2090
2091 unsigned isl_term_dim(__isl_keep isl_term *term, enum isl_dim_type type)
2092 {
2093 if (!term)
2094 return 0;
2095
2096 switch (type) {
2097 case isl_dim_param:
2098 case isl_dim_in:
2099 case isl_dim_out: return isl_dim_size(term->dim, type);
2100 case isl_dim_div: return term->div->n_row;
2101 case isl_dim_all: return isl_dim_total(term->dim) + term->div->n_row;
2102 }
2103 }
2104
2105 isl_ctx *isl_term_get_ctx(__isl_keep isl_term *term)
2106 {
2107 return term ? term->dim->ctx : NULL;
2108 }
2109
2110 void isl_term_get_num(__isl_keep isl_term *term, isl_int *n)
2111 {
2112 if (!term)
2113 return;
2114 isl_int_set(*n, term->n);
2115 }
2116
2117 void isl_term_get_den(__isl_keep isl_term *term, isl_int *d)
2118 {
2119 if (!term)
2120 return;
2121 isl_int_set(*d, term->d);
2122 }
2123
2124 int isl_term_get_exp(__isl_keep isl_term *term,
2125 enum isl_dim_type type, unsigned pos)
2126 {
2127 if (!term)
2128 return -1;
2129
2130 isl_assert(term->dim->ctx, pos < isl_term_dim(term, type), return -1);
2131
2132 if (type >= isl_dim_set)
2133 pos += isl_dim_size(term->dim, isl_dim_param);
2134 if (type >= isl_dim_div)
2135 pos += isl_dim_size(term->dim, isl_dim_set);
2136
2137 return term->pow[pos];
2138 }
2139
2140 __isl_give isl_div *isl_term_get_div(__isl_keep isl_term *term, unsigned pos)
2141 {
2142 isl_basic_map *bmap;
2143 unsigned total;
2144 int k;
2145
2146 if (!term)
2147 return NULL;
2148
2149 isl_assert(term->dim->ctx, pos < isl_term_dim(term, isl_dim_div),
2150 return NULL);
2151
2152 total = term->div->n_col - term->div->n_row - 2;
2153 /* No nested divs for now */
2154 isl_assert(term->dim->ctx,
2155 isl_seq_first_non_zero(term->div->row[pos] + 2 + total,
2156 term->div->n_row) == -1,
2157 return NULL);
2158
2159 bmap = isl_basic_map_alloc_dim(isl_dim_copy(term->dim), 1, 0, 0);
2160 if ((k = isl_basic_map_alloc_div(bmap)) < 0)
2161 goto error;
2162
2163 isl_seq_cpy(bmap->div[k], term->div->row[pos], 2 + total);
2164
2165 return isl_basic_map_div(bmap, k);
2166 error:
2167 isl_basic_map_free(bmap);
2168 return NULL;
2169 }
2170
2171 __isl_give isl_term *isl_upoly_foreach_term(__isl_keep struct isl_upoly *up,
2172 int (*fn)(__isl_take isl_term *term, void *user),
2173 __isl_take isl_term *term, void *user)
2174 {
2175 int i;
2176 struct isl_upoly_rec *rec;
2177
2178 if (!up || !term)
2179 goto error;
2180
2181 if (isl_upoly_is_zero(up))
2182 return term;
2183
2184 isl_assert(up->ctx, !isl_upoly_is_nan(up), goto error);
2185 isl_assert(up->ctx, !isl_upoly_is_infty(up), goto error);
2186 isl_assert(up->ctx, !isl_upoly_is_neginfty(up), goto error);
2187
2188 if (isl_upoly_is_cst(up)) {
2189 struct isl_upoly_cst *cst;
2190 cst = isl_upoly_as_cst(up);
2191 if (!cst)
2192 goto error;
2193 term = isl_term_cow(term);
2194 if (!term)
2195 goto error;
2196 isl_int_set(term->n, cst->n);
2197 isl_int_set(term->d, cst->d);
2198 if (fn(isl_term_copy(term), user) < 0)
2199 goto error;
2200 return term;
2201 }
2202
2203 rec = isl_upoly_as_rec(up);
2204 if (!rec)
2205 goto error;
2206
2207 for (i = 0; i < rec->n; ++i) {
2208 term = isl_term_cow(term);
2209 if (!term)
2210 goto error;
2211 term->pow[up->var] = i;
2212 term = isl_upoly_foreach_term(rec->p[i], fn, term, user);
2213 if (!term)
2214 goto error;
2215 }
2216 term->pow[up->var] = 0;
2217
2218 return term;
2219 error:
2220 isl_term_free(term);
2221 return NULL;
2222 }
2223
2224 int isl_qpolynomial_foreach_term(__isl_keep isl_qpolynomial *qp,
2225 int (*fn)(__isl_take isl_term *term, void *user), void *user)
2226 {
2227 isl_term *term;
2228
2229 if (!qp)
2230 return -1;
2231
2232 term = isl_term_alloc(isl_dim_copy(qp->dim), isl_mat_copy(qp->div));
2233 if (!term)
2234 return -1;
2235
2236 term = isl_upoly_foreach_term(qp->upoly, fn, term, user);
2237
2238 isl_term_free(term);
2239
2240 return term ? 0 : -1;
2241 }
2242
2243 int isl_pw_qpolynomial_foreach_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2244 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2245 void *user), void *user)
2246 {
2247 int i;
2248
2249 if (!pwqp)
2250 return -1;
2251
2252 for (i = 0; i < pwqp->n; ++i)
2253 if (fn(isl_set_copy(pwqp->p[i].set),
2254 isl_qpolynomial_copy(pwqp->p[i].qp), user) < 0)
2255 return -1;
2256
2257 return 0;
2258 }
2259
2260 static int any_divs(__isl_keep isl_set *set)
2261 {
2262 int i;
2263
2264 if (!set)
2265 return -1;
2266
2267 for (i = 0; i < set->n; ++i)
2268 if (set->p[i]->n_div > 0)
2269 return 1;
2270
2271 return 0;
2272 }
2273
2274 __isl_give isl_qpolynomial *isl_qpolynomial_lift(__isl_take isl_qpolynomial *qp,
2275 __isl_take isl_dim *dim)
2276 {
2277 if (!qp || !dim)
2278 goto error;
2279
2280 if (isl_dim_equal(qp->dim, dim)) {
2281 isl_dim_free(dim);
2282 return qp;
2283 }
2284
2285 qp = isl_qpolynomial_cow(qp);
2286 if (!qp)
2287 goto error;
2288
2289 if (qp->div->n_row) {
2290 int i;
2291 int extra;
2292 unsigned total;
2293 int *exp;
2294
2295 extra = isl_dim_size(dim, isl_dim_set) -
2296 isl_dim_size(qp->dim, isl_dim_set);
2297 total = isl_dim_total(qp->dim);
2298 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
2299 if (!exp)
2300 goto error;
2301 for (i = 0; i < qp->div->n_row; ++i)
2302 exp[i] = extra + i;
2303 qp->upoly = expand(qp->upoly, exp, total);
2304 free(exp);
2305 if (!qp->upoly)
2306 goto error;
2307 qp->div = isl_mat_insert_cols(qp->div, 2 + total, extra);
2308 if (!qp->div)
2309 goto error;
2310 for (i = 0; i < qp->div->n_row; ++i)
2311 isl_seq_clr(qp->div->row[i] + 2 + total, extra);
2312 }
2313
2314 isl_dim_free(qp->dim);
2315 qp->dim = dim;
2316
2317 return qp;
2318 error:
2319 isl_dim_free(dim);
2320 isl_qpolynomial_free(qp);
2321 return NULL;
2322 }
2323
2324 static int foreach_lifted_subset(__isl_take isl_set *set,
2325 __isl_take isl_qpolynomial *qp,
2326 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2327 void *user), void *user)
2328 {
2329 int i;
2330
2331 if (!set || !qp)
2332 goto error;
2333
2334 for (i = 0; i < set->n; ++i) {
2335 isl_set *lift;
2336 isl_qpolynomial *copy;
2337
2338 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
2339 lift = isl_set_lift(lift);
2340
2341 copy = isl_qpolynomial_copy(qp);
2342 copy = isl_qpolynomial_lift(copy, isl_set_get_dim(lift));
2343
2344 if (fn(lift, copy, user) < 0)
2345 goto error;
2346 }
2347
2348 isl_set_free(set);
2349 isl_qpolynomial_free(qp);
2350
2351 return 0;
2352 error:
2353 isl_set_free(set);
2354 isl_qpolynomial_free(qp);
2355 return -1;
2356 }
2357
2358 int isl_pw_qpolynomial_foreach_lifted_piece(__isl_keep isl_pw_qpolynomial *pwqp,
2359 int (*fn)(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
2360 void *user), void *user)
2361 {
2362 int i;
2363
2364 if (!pwqp)
2365 return -1;
2366
2367 for (i = 0; i < pwqp->n; ++i) {
2368 isl_set *set;
2369 isl_qpolynomial *qp;
2370
2371 set = isl_set_copy(pwqp->p[i].set);
2372 qp = isl_qpolynomial_copy(pwqp->p[i].qp);
2373 if (!any_divs(set)) {
2374 if (fn(set, qp, user) < 0)
2375 return -1;
2376 continue;
2377 }
2378 if (foreach_lifted_subset(set, qp, fn, user) < 0)
2379 return -1;
2380 }
2381
2382 return 0;
2383 }
2384
2385 /* For each parameter or variable that does not appear in qp,
2386 * first eliminate the variable from all constraints and then set it to zero.
2387 */
2388 static __isl_give isl_set *fix_inactive(__isl_take isl_set *set,
2389 __isl_keep isl_qpolynomial *qp)
2390 {
2391 int *active = NULL;
2392 int i;
2393 int d;
2394 unsigned nparam;
2395 unsigned nvar;
2396
2397 if (!set || !qp)
2398 goto error;
2399
2400 d = isl_dim_total(set->dim);
2401 active = isl_calloc_array(set->ctx, int, d);
2402 if (set_active(qp, active) < 0)
2403 goto error;
2404
2405 for (i = 0; i < d; ++i)
2406 if (!active[i])
2407 break;
2408
2409 if (i == d) {
2410 free(active);
2411 return set;
2412 }
2413
2414 nparam = isl_dim_size(set->dim, isl_dim_param);
2415 nvar = isl_dim_size(set->dim, isl_dim_set);
2416 for (i = 0; i < nparam; ++i) {
2417 if (active[i])
2418 continue;
2419 set = isl_set_eliminate(set, isl_dim_param, i, 1);
2420 set = isl_set_fix_si(set, isl_dim_param, i, 0);
2421 }
2422 for (i = 0; i < nvar; ++i) {
2423 if (active[i])
2424 continue;
2425 set = isl_set_eliminate(set, isl_dim_set, i, 1);
2426 set = isl_set_fix_si(set, isl_dim_set, i, 0);
2427 }
2428
2429 free(active);
2430
2431 return set;
2432 error:
2433 free(active);
2434 isl_set_free(set);
2435 return NULL;
2436 }
2437
2438 struct isl_max_data {
2439 isl_qpolynomial *qp;
2440 int first;
2441 isl_qpolynomial *max;
2442 };
2443
2444 static int max_fn(__isl_take isl_point *pnt, void *user)
2445 {
2446 struct isl_max_data *data = (struct isl_max_data *)user;
2447 isl_qpolynomial *val;
2448
2449 val = isl_qpolynomial_eval(isl_qpolynomial_copy(data->qp), pnt);
2450 if (data->first) {
2451 data->first = 0;
2452 data->max = val;
2453 } else {
2454 data->max = isl_qpolynomial_max_cst(data->max, val);
2455 }
2456
2457 return 0;
2458 }
2459
2460 static __isl_give isl_qpolynomial *guarded_qpolynomial_max(
2461 __isl_take isl_set *set, __isl_take isl_qpolynomial *qp)
2462 {
2463 struct isl_max_data data = { NULL, 1, NULL };
2464
2465 if (!set || !qp)
2466 goto error;
2467
2468 if (isl_upoly_is_cst(qp->upoly)) {
2469 isl_set_free(set);
2470 return qp;
2471 }
2472
2473 set = fix_inactive(set, qp);
2474
2475 data.qp = qp;
2476 if (isl_set_foreach_point(set, max_fn, &data) < 0)
2477 goto error;
2478
2479 isl_set_free(set);
2480 isl_qpolynomial_free(qp);
2481 return data.max;
2482 error:
2483 isl_set_free(set);
2484 isl_qpolynomial_free(qp);
2485 isl_qpolynomial_free(data.max);
2486 return NULL;
2487 }
2488
2489 /* Compute the maximal value attained by the piecewise quasipolynomial
2490 * on its domain or zero if the domain is empty.
2491 * In the worst case, the domain is scanned completely,
2492 * so the domain is assumed to be bounded.
2493 */
2494 __isl_give isl_qpolynomial *isl_pw_qpolynomial_max(
2495 __isl_take isl_pw_qpolynomial *pwqp)
2496 {
2497 int i;
2498 isl_qpolynomial *max;
2499
2500 if (!pwqp)
2501 return NULL;
2502
2503 if (pwqp->n == 0) {
2504 isl_dim *dim = isl_dim_copy(pwqp->dim);
2505 isl_pw_qpolynomial_free(pwqp);
2506 return isl_qpolynomial_zero(dim);
2507 }
2508
2509 max = guarded_qpolynomial_max(isl_set_copy(pwqp->p[0].set),
2510 isl_qpolynomial_copy(pwqp->p[0].qp));
2511 for (i = 1; i < pwqp->n; ++i) {
2512 isl_qpolynomial *max_i;
2513 max_i = guarded_qpolynomial_max(isl_set_copy(pwqp->p[i].set),
2514 isl_qpolynomial_copy(pwqp->p[i].qp));
2515 max = isl_qpolynomial_max_cst(max, max_i);
2516 }
2517
2518 isl_pw_qpolynomial_free(pwqp);
2519 return max;
2520 }
Integer set library