?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
hide isl_map_add_basic_map
[isl.git] / isl_fold.c
bloba7f088ad13f9a2a9f76d63c7b7257d8874d1f2b2
1 /*
2 * Copyright 2010 INRIA Saclay
3 *
4 * Use of this software is governed by the MIT license
5 *
6 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
7 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
8 * 91893 Orsay, France
9 */
10
11 #define ISL_DIM_H
12 #include <isl_map_private.h>
13 #include <isl_union_map_private.h>
14 #include <isl_polynomial_private.h>
15 #include <isl_point_private.h>
16 #include <isl_space_private.h>
17 #include <isl_lp_private.h>
18 #include <isl_seq.h>
19 #include <isl_mat_private.h>
20 #include <isl_val_private.h>
21 #include <isl_vec_private.h>
22 #include <isl_config.h>
23 #include <isl/deprecated/polynomial_int.h>
24
25 enum isl_fold isl_fold_type_negate(enum isl_fold type)
26 {
27 switch (type) {
28 case isl_fold_min:
29 return isl_fold_max;
30 case isl_fold_max:
31 return isl_fold_min;
32 case isl_fold_list:
33 return isl_fold_list;
34 }
35
36 isl_die(NULL, isl_error_internal, "unhandled isl_fold type", abort());
37 }
38
39 static __isl_give isl_qpolynomial_fold *qpolynomial_fold_alloc(
40 enum isl_fold type, __isl_take isl_space *dim, int n)
41 {
42 isl_qpolynomial_fold *fold;
43
44 if (!dim)
45 goto error;
46
47 isl_assert(dim->ctx, n >= 0, goto error);
48 fold = isl_calloc(dim->ctx, struct isl_qpolynomial_fold,
49 sizeof(struct isl_qpolynomial_fold) +
50 (n - 1) * sizeof(struct isl_qpolynomial *));
51 if (!fold)
52 goto error;
53
54 fold->ref = 1;
55 fold->size = n;
56 fold->n = 0;
57 fold->type = type;
58 fold->dim = dim;
59
60 return fold;
61 error:
62 isl_space_free(dim);
63 return NULL;
64 }
65
66 isl_ctx *isl_qpolynomial_fold_get_ctx(__isl_keep isl_qpolynomial_fold *fold)
67 {
68 return fold ? fold->dim->ctx : NULL;
69 }
70
71 __isl_give isl_space *isl_qpolynomial_fold_get_domain_space(
72 __isl_keep isl_qpolynomial_fold *fold)
73 {
74 return fold ? isl_space_copy(fold->dim) : NULL;
75 }
76
77 __isl_give isl_space *isl_qpolynomial_fold_get_space(
78 __isl_keep isl_qpolynomial_fold *fold)
79 {
80 isl_space *space;
81 if (!fold)
82 return NULL;
83 space = isl_space_copy(fold->dim);
84 space = isl_space_from_domain(space);
85 space = isl_space_add_dims(space, isl_dim_out, 1);
86 return space;
87 }
88
89 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_reset_domain_space(
90 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_space *dim)
91 {
92 int i;
93
94 fold = isl_qpolynomial_fold_cow(fold);
95 if (!fold || !dim)
96 goto error;
97
98 for (i = 0; i < fold->n; ++i) {
99 fold->qp[i] = isl_qpolynomial_reset_domain_space(fold->qp[i],
100 isl_space_copy(dim));
101 if (!fold->qp[i])
102 goto error;
103 }
104
105 isl_space_free(fold->dim);
106 fold->dim = dim;
107
108 return fold;
109 error:
110 isl_qpolynomial_fold_free(fold);
111 isl_space_free(dim);
112 return NULL;
113 }
114
115 /* Reset the space of "fold". This function is called from isl_pw_templ.c
116 * and doesn't know if the space of an element object is represented
117 * directly or through its domain. It therefore passes along both.
118 */
119 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_reset_space_and_domain(
120 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_space *space,
121 __isl_take isl_space *domain)
122 {
123 isl_space_free(space);
124 return isl_qpolynomial_fold_reset_domain_space(fold, domain);
125 }
126
127 int isl_qpolynomial_fold_involves_dims(__isl_keep isl_qpolynomial_fold *fold,
128 enum isl_dim_type type, unsigned first, unsigned n)
129 {
130 int i;
131
132 if (!fold)
133 return -1;
134 if (fold->n == 0 || n == 0)
135 return 0;
136
137 for (i = 0; i < fold->n; ++i) {
138 int involves = isl_qpolynomial_involves_dims(fold->qp[i],
139 type, first, n);
140 if (involves < 0 || involves)
141 return involves;
142 }
143 return 0;
144 }
145
146 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_set_dim_name(
147 __isl_take isl_qpolynomial_fold *fold,
148 enum isl_dim_type type, unsigned pos, const char *s)
149 {
150 int i;
151
152 fold = isl_qpolynomial_fold_cow(fold);
153 if (!fold)
154 return NULL;
155 fold->dim = isl_space_set_dim_name(fold->dim, type, pos, s);
156 if (!fold->dim)
157 goto error;
158
159 for (i = 0; i < fold->n; ++i) {
160 fold->qp[i] = isl_qpolynomial_set_dim_name(fold->qp[i],
161 type, pos, s);
162 if (!fold->qp[i])
163 goto error;
164 }
165
166 return fold;
167 error:
168 isl_qpolynomial_fold_free(fold);
169 return NULL;
170 }
171
172 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_drop_dims(
173 __isl_take isl_qpolynomial_fold *fold,
174 enum isl_dim_type type, unsigned first, unsigned n)
175 {
176 int i;
177 enum isl_dim_type set_type;
178
179 if (!fold)
180 return NULL;
181 if (n == 0)
182 return fold;
183
184 set_type = type == isl_dim_in ? isl_dim_set : type;
185
186 fold = isl_qpolynomial_fold_cow(fold);
187 if (!fold)
188 return NULL;
189 fold->dim = isl_space_drop_dims(fold->dim, set_type, first, n);
190 if (!fold->dim)
191 goto error;
192
193 for (i = 0; i < fold->n; ++i) {
194 fold->qp[i] = isl_qpolynomial_drop_dims(fold->qp[i],
195 type, first, n);
196 if (!fold->qp[i])
197 goto error;
198 }
199
200 return fold;
201 error:
202 isl_qpolynomial_fold_free(fold);
203 return NULL;
204 }
205
206 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_insert_dims(
207 __isl_take isl_qpolynomial_fold *fold,
208 enum isl_dim_type type, unsigned first, unsigned n)
209 {
210 int i;
211
212 if (!fold)
213 return NULL;
214 if (n == 0 && !isl_space_is_named_or_nested(fold->dim, type))
215 return fold;
216
217 fold = isl_qpolynomial_fold_cow(fold);
218 if (!fold)
219 return NULL;
220 fold->dim = isl_space_insert_dims(fold->dim, type, first, n);
221 if (!fold->dim)
222 goto error;
223
224 for (i = 0; i < fold->n; ++i) {
225 fold->qp[i] = isl_qpolynomial_insert_dims(fold->qp[i],
226 type, first, n);
227 if (!fold->qp[i])
228 goto error;
229 }
230
231 return fold;
232 error:
233 isl_qpolynomial_fold_free(fold);
234 return NULL;
235 }
236
237 /* Determine the sign of the constant quasipolynomial "qp".
238 *
239 * Return
240 * -1 if qp <= 0
241 * 1 if qp >= 0
242 * 0 if unknown
243 *
244 * For qp == 0, we can return either -1 or 1. In practice, we return 1.
245 * For qp == NaN, the sign is undefined, so we return 0.
246 */
247 static int isl_qpolynomial_cst_sign(__isl_keep isl_qpolynomial *qp)
248 {
249 struct isl_upoly_cst *cst;
250
251 if (isl_qpolynomial_is_nan(qp))
252 return 0;
253
254 cst = isl_upoly_as_cst(qp->upoly);
255 if (!cst)
256 return 0;
257
258 return isl_int_sgn(cst->n) < 0 ? -1 : 1;
259 }
260
261 static int isl_qpolynomial_aff_sign(__isl_keep isl_set *set,
262 __isl_keep isl_qpolynomial *qp)
263 {
264 enum isl_lp_result res;
265 isl_vec *aff;
266 isl_int opt;
267 int sgn = 0;
268
269 aff = isl_qpolynomial_extract_affine(qp);
270 if (!aff)
271 return 0;
272
273 isl_int_init(opt);
274
275 res = isl_set_solve_lp(set, 0, aff->el + 1, aff->el[0],
276 &opt, NULL, NULL);
277 if (res == isl_lp_error)
278 goto done;
279 if (res == isl_lp_empty ||
280 (res == isl_lp_ok && !isl_int_is_neg(opt))) {
281 sgn = 1;
282 goto done;
283 }
284
285 res = isl_set_solve_lp(set, 1, aff->el + 1, aff->el[0],
286 &opt, NULL, NULL);
287 if (res == isl_lp_ok && !isl_int_is_pos(opt))
288 sgn = -1;
289
290 done:
291 isl_int_clear(opt);
292 isl_vec_free(aff);
293 return sgn;
294 }
295
296 /* Determine, if possible, the sign of the quasipolynomial "qp" on
297 * the domain "set".
298 *
299 * If qp is a constant, then the problem is trivial.
300 * If qp is linear, then we check if the minimum of the corresponding
301 * affine constraint is non-negative or if the maximum is non-positive.
302 *
303 * Otherwise, we check if the outermost variable "v" has a lower bound "l"
304 * in "set". If so, we write qp(v,v') as
305 *
306 * q(v,v') * (v - l) + r(v')
307 *
308 * if q(v,v') and r(v') have the same known sign, then the original
309 * quasipolynomial has the same sign as well.
310 *
311 * Return
312 * -1 if qp <= 0
313 * 1 if qp >= 0
314 * 0 if unknown
315 */
316 static int isl_qpolynomial_sign(__isl_keep isl_set *set,
317 __isl_keep isl_qpolynomial *qp)
318 {
319 int d;
320 int i;
321 int is;
322 struct isl_upoly_rec *rec;
323 isl_vec *v;
324 isl_int l;
325 enum isl_lp_result res;
326 int sgn = 0;
327
328 is = isl_qpolynomial_is_cst(qp, NULL, NULL);
329 if (is < 0)
330 return 0;
331 if (is)
332 return isl_qpolynomial_cst_sign(qp);
333
334 is = isl_qpolynomial_is_affine(qp);
335 if (is < 0)
336 return 0;
337 if (is)
338 return isl_qpolynomial_aff_sign(set, qp);
339
340 if (qp->div->n_row > 0)
341 return 0;
342
343 rec = isl_upoly_as_rec(qp->upoly);
344 if (!rec)
345 return 0;
346
347 d = isl_space_dim(qp->dim, isl_dim_all);
348 v = isl_vec_alloc(set->ctx, 2 + d);
349 if (!v)
350 return 0;
351
352 isl_seq_clr(v->el + 1, 1 + d);
353 isl_int_set_si(v->el[0], 1);
354 isl_int_set_si(v->el[2 + qp->upoly->var], 1);
355
356 isl_int_init(l);
357
358 res = isl_set_solve_lp(set, 0, v->el + 1, v->el[0], &l, NULL, NULL);
359 if (res == isl_lp_ok) {
360 isl_qpolynomial *min;
361 isl_qpolynomial *base;
362 isl_qpolynomial *r, *q;
363 isl_qpolynomial *t;
364
365 min = isl_qpolynomial_cst_on_domain(isl_space_copy(qp->dim), l);
366 base = isl_qpolynomial_var_pow_on_domain(isl_space_copy(qp->dim),
367 qp->upoly->var, 1);
368
369 r = isl_qpolynomial_alloc(isl_space_copy(qp->dim), 0,
370 isl_upoly_copy(rec->p[rec->n - 1]));
371 q = isl_qpolynomial_copy(r);
372
373 for (i = rec->n - 2; i >= 0; --i) {
374 r = isl_qpolynomial_mul(r, isl_qpolynomial_copy(min));
375 t = isl_qpolynomial_alloc(isl_space_copy(qp->dim), 0,
376 isl_upoly_copy(rec->p[i]));
377 r = isl_qpolynomial_add(r, t);
378 if (i == 0)
379 break;
380 q = isl_qpolynomial_mul(q, isl_qpolynomial_copy(base));
381 q = isl_qpolynomial_add(q, isl_qpolynomial_copy(r));
382 }
383
384 if (isl_qpolynomial_is_zero(q))
385 sgn = isl_qpolynomial_sign(set, r);
386 else if (isl_qpolynomial_is_zero(r))
387 sgn = isl_qpolynomial_sign(set, q);
388 else {
389 int sgn_q, sgn_r;
390 sgn_r = isl_qpolynomial_sign(set, r);
391 sgn_q = isl_qpolynomial_sign(set, q);
392 if (sgn_r == sgn_q)
393 sgn = sgn_r;
394 }
395
396 isl_qpolynomial_free(min);
397 isl_qpolynomial_free(base);
398 isl_qpolynomial_free(q);
399 isl_qpolynomial_free(r);
400 }
401
402 isl_int_clear(l);
403
404 isl_vec_free(v);
405
406 return sgn;
407 }
408
409 /* Combine "fold1" and "fold2" into a single reduction, eliminating
410 * those elements of one reduction that are already covered by the other
411 * reduction on "set".
412 *
413 * If "fold1" or "fold2" is an empty reduction, then return
414 * the other reduction.
415 * If "fold1" or "fold2" is a NaN, then return this NaN.
416 */
417 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold_on_domain(
418 __isl_keep isl_set *set,
419 __isl_take isl_qpolynomial_fold *fold1,
420 __isl_take isl_qpolynomial_fold *fold2)
421 {
422 int i, j;
423 int n1;
424 struct isl_qpolynomial_fold *res = NULL;
425 int better;
426
427 if (!fold1 || !fold2)
428 goto error;
429
430 isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error);
431 isl_assert(fold1->dim->ctx, isl_space_is_equal(fold1->dim, fold2->dim),
432 goto error);
433
434 better = fold1->type == isl_fold_max ? -1 : 1;
435
436 if (isl_qpolynomial_fold_is_empty(fold1) ||
437 isl_qpolynomial_fold_is_nan(fold2)) {
438 isl_qpolynomial_fold_free(fold1);
439 return fold2;
440 }
441
442 if (isl_qpolynomial_fold_is_empty(fold2) ||
443 isl_qpolynomial_fold_is_nan(fold1)) {
444 isl_qpolynomial_fold_free(fold2);
445 return fold1;
446 }
447
448 res = qpolynomial_fold_alloc(fold1->type, isl_space_copy(fold1->dim),
449 fold1->n + fold2->n);
450 if (!res)
451 goto error;
452
453 for (i = 0; i < fold1->n; ++i) {
454 res->qp[res->n] = isl_qpolynomial_copy(fold1->qp[i]);
455 if (!res->qp[res->n])
456 goto error;
457 res->n++;
458 }
459 n1 = res->n;
460
461 for (i = 0; i < fold2->n; ++i) {
462 for (j = n1 - 1; j >= 0; --j) {
463 isl_qpolynomial *d;
464 int sgn, equal;
465 equal = isl_qpolynomial_plain_is_equal(res->qp[j],
466 fold2->qp[i]);
467 if (equal < 0)
468 goto error;
469 if (equal)
470 break;
471 d = isl_qpolynomial_sub(
472 isl_qpolynomial_copy(res->qp[j]),
473 isl_qpolynomial_copy(fold2->qp[i]));
474 sgn = isl_qpolynomial_sign(set, d);
475 isl_qpolynomial_free(d);
476 if (sgn == 0)
477 continue;
478 if (sgn != better)
479 break;
480 isl_qpolynomial_free(res->qp[j]);
481 if (j != n1 - 1)
482 res->qp[j] = res->qp[n1 - 1];
483 n1--;
484 if (n1 != res->n - 1)
485 res->qp[n1] = res->qp[res->n - 1];
486 res->n--;
487 }
488 if (j >= 0)
489 continue;
490 res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]);
491 if (!res->qp[res->n])
492 goto error;
493 res->n++;
494 }
495
496 isl_qpolynomial_fold_free(fold1);
497 isl_qpolynomial_fold_free(fold2);
498
499 return res;
500 error:
501 isl_qpolynomial_fold_free(res);
502 isl_qpolynomial_fold_free(fold1);
503 isl_qpolynomial_fold_free(fold2);
504 return NULL;
505 }
506
507 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_add_qpolynomial(
508 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_qpolynomial *qp)
509 {
510 int i;
511
512 if (!fold || !qp)
513 goto error;
514
515 if (isl_qpolynomial_is_zero(qp)) {
516 isl_qpolynomial_free(qp);
517 return fold;
518 }
519
520 fold = isl_qpolynomial_fold_cow(fold);
521 if (!fold)
522 goto error;
523
524 for (i = 0; i < fold->n; ++i) {
525 fold->qp[i] = isl_qpolynomial_add(fold->qp[i],
526 isl_qpolynomial_copy(qp));
527 if (!fold->qp[i])
528 goto error;
529 }
530
531 isl_qpolynomial_free(qp);
532 return fold;
533 error:
534 isl_qpolynomial_fold_free(fold);
535 isl_qpolynomial_free(qp);
536 return NULL;
537 }
538
539 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_add_on_domain(
540 __isl_keep isl_set *dom,
541 __isl_take isl_qpolynomial_fold *fold1,
542 __isl_take isl_qpolynomial_fold *fold2)
543 {
544 int i;
545 isl_qpolynomial_fold *res = NULL;
546
547 if (!fold1 || !fold2)
548 goto error;
549
550 if (isl_qpolynomial_fold_is_empty(fold1)) {
551 isl_qpolynomial_fold_free(fold1);
552 return fold2;
553 }
554
555 if (isl_qpolynomial_fold_is_empty(fold2)) {
556 isl_qpolynomial_fold_free(fold2);
557 return fold1;
558 }
559
560 if (fold1->n == 1 && fold2->n != 1)
561 return isl_qpolynomial_fold_add_on_domain(dom, fold2, fold1);
562
563 if (fold2->n == 1) {
564 res = isl_qpolynomial_fold_add_qpolynomial(fold1,
565 isl_qpolynomial_copy(fold2->qp[0]));
566 isl_qpolynomial_fold_free(fold2);
567 return res;
568 }
569
570 res = isl_qpolynomial_fold_add_qpolynomial(
571 isl_qpolynomial_fold_copy(fold1),
572 isl_qpolynomial_copy(fold2->qp[0]));
573
574 for (i = 1; i < fold2->n; ++i) {
575 isl_qpolynomial_fold *res_i;
576 res_i = isl_qpolynomial_fold_add_qpolynomial(
577 isl_qpolynomial_fold_copy(fold1),
578 isl_qpolynomial_copy(fold2->qp[i]));
579 res = isl_qpolynomial_fold_fold_on_domain(dom, res, res_i);
580 }
581
582 isl_qpolynomial_fold_free(fold1);
583 isl_qpolynomial_fold_free(fold2);
584 return res;
585 error:
586 isl_qpolynomial_fold_free(res);
587 isl_qpolynomial_fold_free(fold1);
588 isl_qpolynomial_fold_free(fold2);
589 return NULL;
590 }
591
592 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_substitute_equalities(
593 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_basic_set *eq)
594 {
595 int i;
596
597 if (!fold || !eq)
598 goto error;
599
600 fold = isl_qpolynomial_fold_cow(fold);
601 if (!fold)
602 return NULL;
603
604 for (i = 0; i < fold->n; ++i) {
605 fold->qp[i] = isl_qpolynomial_substitute_equalities(fold->qp[i],
606 isl_basic_set_copy(eq));
607 if (!fold->qp[i])
608 goto error;
609 }
610
611 isl_basic_set_free(eq);
612 return fold;
613 error:
614 isl_basic_set_free(eq);
615 isl_qpolynomial_fold_free(fold);
616 return NULL;
617 }
618
619 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_gist(
620 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *context)
621 {
622 int i;
623
624 if (!fold || !context)
625 goto error;
626
627 fold = isl_qpolynomial_fold_cow(fold);
628 if (!fold)
629 return NULL;
630
631 for (i = 0; i < fold->n; ++i) {
632 fold->qp[i] = isl_qpolynomial_gist(fold->qp[i],
633 isl_set_copy(context));
634 if (!fold->qp[i])
635 goto error;
636 }
637
638 isl_set_free(context);
639 return fold;
640 error:
641 isl_set_free(context);
642 isl_qpolynomial_fold_free(fold);
643 return NULL;
644 }
645
646 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_gist_params(
647 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *context)
648 {
649 isl_space *space = isl_qpolynomial_fold_get_domain_space(fold);
650 isl_set *dom_context = isl_set_universe(space);
651 dom_context = isl_set_intersect_params(dom_context, context);
652 return isl_qpolynomial_fold_gist(fold, dom_context);
653 }
654
655 #define HAS_TYPE
656
657 #undef PW
658 #define PW isl_pw_qpolynomial_fold
659 #undef EL
660 #define EL isl_qpolynomial_fold
661 #undef EL_IS_ZERO
662 #define EL_IS_ZERO is_empty
663 #undef ZERO
664 #define ZERO zero
665 #undef IS_ZERO
666 #define IS_ZERO is_zero
667 #undef FIELD
668 #define FIELD fold
669 #undef DEFAULT_IS_ZERO
670 #define DEFAULT_IS_ZERO 1
671
672 #define NO_NEG
673 #define NO_SUB
674 #define NO_PULLBACK
675
676 #include <isl_pw_templ.c>
677
678 #undef UNION
679 #define UNION isl_union_pw_qpolynomial_fold
680 #undef PART
681 #define PART isl_pw_qpolynomial_fold
682 #undef PARTS
683 #define PARTS pw_qpolynomial_fold
684
685 #define NO_SUB
686
687 #include <isl_union_templ.c>
688
689 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_empty(enum isl_fold type,
690 __isl_take isl_space *dim)
691 {
692 return qpolynomial_fold_alloc(type, dim, 0);
693 }
694
695 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_alloc(
696 enum isl_fold type, __isl_take isl_qpolynomial *qp)
697 {
698 isl_qpolynomial_fold *fold;
699
700 if (!qp)
701 return NULL;
702
703 fold = qpolynomial_fold_alloc(type, isl_space_copy(qp->dim), 1);
704 if (!fold)
705 goto error;
706
707 fold->qp[0] = qp;
708 fold->n++;
709
710 return fold;
711 error:
712 isl_qpolynomial_fold_free(fold);
713 isl_qpolynomial_free(qp);
714 return NULL;
715 }
716
717 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_copy(
718 __isl_keep isl_qpolynomial_fold *fold)
719 {
720 if (!fold)
721 return NULL;
722
723 fold->ref++;
724 return fold;
725 }
726
727 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_dup(
728 __isl_keep isl_qpolynomial_fold *fold)
729 {
730 int i;
731 isl_qpolynomial_fold *dup;
732
733 if (!fold)
734 return NULL;
735 dup = qpolynomial_fold_alloc(fold->type,
736 isl_space_copy(fold->dim), fold->n);
737 if (!dup)
738 return NULL;
739
740 dup->n = fold->n;
741 for (i = 0; i < fold->n; ++i) {
742 dup->qp[i] = isl_qpolynomial_copy(fold->qp[i]);
743 if (!dup->qp[i])
744 goto error;
745 }
746
747 return dup;
748 error:
749 isl_qpolynomial_fold_free(dup);
750 return NULL;
751 }
752
753 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_cow(
754 __isl_take isl_qpolynomial_fold *fold)
755 {
756 if (!fold)
757 return NULL;
758
759 if (fold->ref == 1)
760 return fold;
761 fold->ref--;
762 return isl_qpolynomial_fold_dup(fold);
763 }
764
765 void isl_qpolynomial_fold_free(__isl_take isl_qpolynomial_fold *fold)
766 {
767 int i;
768
769 if (!fold)
770 return;
771 if (--fold->ref > 0)
772 return;
773
774 for (i = 0; i < fold->n; ++i)
775 isl_qpolynomial_free(fold->qp[i]);
776 isl_space_free(fold->dim);
777 free(fold);
778 }
779
780 int isl_qpolynomial_fold_is_empty(__isl_keep isl_qpolynomial_fold *fold)
781 {
782 if (!fold)
783 return -1;
784
785 return fold->n == 0;
786 }
787
788 /* Does "fold" represent max(NaN) or min(NaN)?
789 */
790 isl_bool isl_qpolynomial_fold_is_nan(__isl_keep isl_qpolynomial_fold *fold)
791 {
792 if (!fold)
793 return isl_bool_error;
794 if (fold->n != 1)
795 return isl_bool_false;
796 return isl_qpolynomial_is_nan(fold->qp[0]);
797 }
798
799 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold(
800 __isl_take isl_qpolynomial_fold *fold1,
801 __isl_take isl_qpolynomial_fold *fold2)
802 {
803 int i;
804 struct isl_qpolynomial_fold *res = NULL;
805
806 if (!fold1 || !fold2)
807 goto error;
808
809 isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error);
810 isl_assert(fold1->dim->ctx, isl_space_is_equal(fold1->dim, fold2->dim),
811 goto error);
812
813 if (isl_qpolynomial_fold_is_empty(fold1)) {
814 isl_qpolynomial_fold_free(fold1);
815 return fold2;
816 }
817
818 if (isl_qpolynomial_fold_is_empty(fold2)) {
819 isl_qpolynomial_fold_free(fold2);
820 return fold1;
821 }
822
823 res = qpolynomial_fold_alloc(fold1->type, isl_space_copy(fold1->dim),
824 fold1->n + fold2->n);
825 if (!res)
826 goto error;
827
828 for (i = 0; i < fold1->n; ++i) {
829 res->qp[res->n] = isl_qpolynomial_copy(fold1->qp[i]);
830 if (!res->qp[res->n])
831 goto error;
832 res->n++;
833 }
834
835 for (i = 0; i < fold2->n; ++i) {
836 res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]);
837 if (!res->qp[res->n])
838 goto error;
839 res->n++;
840 }
841
842 isl_qpolynomial_fold_free(fold1);
843 isl_qpolynomial_fold_free(fold2);
844
845 return res;
846 error:
847 isl_qpolynomial_fold_free(res);
848 isl_qpolynomial_fold_free(fold1);
849 isl_qpolynomial_fold_free(fold2);
850 return NULL;
851 }
852
853 __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_fold(
854 __isl_take isl_pw_qpolynomial_fold *pw1,
855 __isl_take isl_pw_qpolynomial_fold *pw2)
856 {
857 int i, j, n;
858 struct isl_pw_qpolynomial_fold *res;
859 isl_set *set;
860
861 if (!pw1 || !pw2)
862 goto error;
863
864 isl_assert(pw1->dim->ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
865
866 if (isl_pw_qpolynomial_fold_is_zero(pw1)) {
867 isl_pw_qpolynomial_fold_free(pw1);
868 return pw2;
869 }
870
871 if (isl_pw_qpolynomial_fold_is_zero(pw2)) {
872 isl_pw_qpolynomial_fold_free(pw2);
873 return pw1;
874 }
875
876 if (pw1->type != pw2->type)
877 isl_die(pw1->dim->ctx, isl_error_invalid,
878 "fold types don't match", goto error);
879
880 n = (pw1->n + 1) * (pw2->n + 1);
881 res = isl_pw_qpolynomial_fold_alloc_size(isl_space_copy(pw1->dim),
882 pw1->type, n);
883
884 for (i = 0; i < pw1->n; ++i) {
885 set = isl_set_copy(pw1->p[i].set);
886 for (j = 0; j < pw2->n; ++j) {
887 struct isl_set *common;
888 isl_qpolynomial_fold *sum;
889 set = isl_set_subtract(set,
890 isl_set_copy(pw2->p[j].set));
891 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
892 isl_set_copy(pw2->p[j].set));
893 if (isl_set_plain_is_empty(common)) {
894 isl_set_free(common);
895 continue;
896 }
897
898 sum = isl_qpolynomial_fold_fold_on_domain(common,
899 isl_qpolynomial_fold_copy(pw1->p[i].fold),
900 isl_qpolynomial_fold_copy(pw2->p[j].fold));
901
902 res = isl_pw_qpolynomial_fold_add_piece(res, common, sum);
903 }
904 res = isl_pw_qpolynomial_fold_add_piece(res, set,
905 isl_qpolynomial_fold_copy(pw1->p[i].fold));
906 }
907
908 for (j = 0; j < pw2->n; ++j) {
909 set = isl_set_copy(pw2->p[j].set);
910 for (i = 0; i < pw1->n; ++i)
911 set = isl_set_subtract(set, isl_set_copy(pw1->p[i].set));
912 res = isl_pw_qpolynomial_fold_add_piece(res, set,
913 isl_qpolynomial_fold_copy(pw2->p[j].fold));
914 }
915
916 isl_pw_qpolynomial_fold_free(pw1);
917 isl_pw_qpolynomial_fold_free(pw2);
918
919 return res;
920 error:
921 isl_pw_qpolynomial_fold_free(pw1);
922 isl_pw_qpolynomial_fold_free(pw2);
923 return NULL;
924 }
925
926 __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold(
927 __isl_take isl_union_pw_qpolynomial_fold *u,
928 __isl_take isl_pw_qpolynomial_fold *part)
929 {
930 uint32_t hash;
931 struct isl_hash_table_entry *entry;
932
933 u = isl_union_pw_qpolynomial_fold_cow(u);
934
935 if (!part || !u)
936 goto error;
937
938 isl_assert(u->space->ctx,
939 isl_space_match(part->dim, isl_dim_param, u->space, isl_dim_param),
940 goto error);
941
942 hash = isl_space_get_hash(part->dim);
943 entry = isl_hash_table_find(u->space->ctx, &u->table, hash,
944 &isl_union_pw_qpolynomial_fold_has_same_domain_space,
945 part->dim, 1);
946 if (!entry)
947 goto error;
948
949 if (!entry->data)
950 entry->data = part;
951 else {
952 entry->data = isl_pw_qpolynomial_fold_fold(entry->data,
953 isl_pw_qpolynomial_fold_copy(part));
954 if (!entry->data)
955 goto error;
956 isl_pw_qpolynomial_fold_free(part);
957 }
958
959 return u;
960 error:
961 isl_pw_qpolynomial_fold_free(part);
962 isl_union_pw_qpolynomial_fold_free(u);
963 return NULL;
964 }
965
966 static isl_stat fold_part(__isl_take isl_pw_qpolynomial_fold *part, void *user)
967 {
968 isl_union_pw_qpolynomial_fold **u;
969 u = (isl_union_pw_qpolynomial_fold **)user;
970
971 *u = isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold(*u, part);
972
973 return isl_stat_ok;
974 }
975
976 __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_fold(
977 __isl_take isl_union_pw_qpolynomial_fold *u1,
978 __isl_take isl_union_pw_qpolynomial_fold *u2)
979 {
980 u1 = isl_union_pw_qpolynomial_fold_cow(u1);
981
982 if (!u1 || !u2)
983 goto error;
984
985 if (isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold(u2,
986 &fold_part, &u1) < 0)
987 goto error;
988
989 isl_union_pw_qpolynomial_fold_free(u2);
990
991 return u1;
992 error:
993 isl_union_pw_qpolynomial_fold_free(u1);
994 isl_union_pw_qpolynomial_fold_free(u2);
995 return NULL;
996 }
997
998 __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_from_pw_qpolynomial(
999 enum isl_fold type, __isl_take isl_pw_qpolynomial *pwqp)
1000 {
1001 int i;
1002 isl_pw_qpolynomial_fold *pwf;
1003
1004 if (!pwqp)
1005 return NULL;
1006
1007 pwf = isl_pw_qpolynomial_fold_alloc_size(isl_space_copy(pwqp->dim),
1008 type, pwqp->n);
1009
1010 for (i = 0; i < pwqp->n; ++i)
1011 pwf = isl_pw_qpolynomial_fold_add_piece(pwf,
1012 isl_set_copy(pwqp->p[i].set),
1013 isl_qpolynomial_fold_alloc(type,
1014 isl_qpolynomial_copy(pwqp->p[i].qp)));
1015
1016 isl_pw_qpolynomial_free(pwqp);
1017
1018 return pwf;
1019 }
1020
1021 __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_add(
1022 __isl_take isl_pw_qpolynomial_fold *pwf1,
1023 __isl_take isl_pw_qpolynomial_fold *pwf2)
1024 {
1025 return isl_pw_qpolynomial_fold_union_add_(pwf1, pwf2);
1026 }
1027
1028 int isl_qpolynomial_fold_plain_is_equal(__isl_keep isl_qpolynomial_fold *fold1,
1029 __isl_keep isl_qpolynomial_fold *fold2)
1030 {
1031 int i;
1032
1033 if (!fold1 || !fold2)
1034 return -1;
1035
1036 if (fold1->n != fold2->n)
1037 return 0;
1038
1039 /* We probably want to sort the qps first... */
1040 for (i = 0; i < fold1->n; ++i) {
1041 int eq = isl_qpolynomial_plain_is_equal(fold1->qp[i], fold2->qp[i]);
1042 if (eq < 0 || !eq)
1043 return eq;
1044 }
1045
1046 return 1;
1047 }
1048
1049 __isl_give isl_val *isl_qpolynomial_fold_eval(
1050 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_point *pnt)
1051 {
1052 isl_ctx *ctx;
1053 isl_val *v;
1054
1055 if (!fold || !pnt)
1056 goto error;
1057 ctx = isl_point_get_ctx(pnt);
1058 isl_assert(pnt->dim->ctx, isl_space_is_equal(pnt->dim, fold->dim), goto error);
1059 isl_assert(pnt->dim->ctx,
1060 fold->type == isl_fold_max || fold->type == isl_fold_min,
1061 goto error);
1062
1063 if (fold->n == 0)
1064 v = isl_val_zero(ctx);
1065 else {
1066 int i;
1067 v = isl_qpolynomial_eval(isl_qpolynomial_copy(fold->qp[0]),
1068 isl_point_copy(pnt));
1069 for (i = 1; i < fold->n; ++i) {
1070 isl_val *v_i;
1071 v_i = isl_qpolynomial_eval(
1072 isl_qpolynomial_copy(fold->qp[i]),
1073 isl_point_copy(pnt));
1074 if (fold->type == isl_fold_max)
1075 v = isl_val_max(v, v_i);
1076 else
1077 v = isl_val_min(v, v_i);
1078 }
1079 }
1080 isl_qpolynomial_fold_free(fold);
1081 isl_point_free(pnt);
1082
1083 return v;
1084 error:
1085 isl_qpolynomial_fold_free(fold);
1086 isl_point_free(pnt);
1087 return NULL;
1088 }
1089
1090 size_t isl_pw_qpolynomial_fold_size(__isl_keep isl_pw_qpolynomial_fold *pwf)
1091 {
1092 int i;
1093 size_t n = 0;
1094
1095 for (i = 0; i < pwf->n; ++i)
1096 n += pwf->p[i].fold->n;
1097
1098 return n;
1099 }
1100
1101 __isl_give isl_val *isl_qpolynomial_fold_opt_on_domain(
1102 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *set, int max)
1103 {
1104 int i;
1105 isl_val *opt;
1106
1107 if (!set || !fold)
1108 goto error;
1109
1110 if (fold->n == 0) {
1111 opt = isl_val_zero(isl_set_get_ctx(set));
1112 isl_set_free(set);
1113 isl_qpolynomial_fold_free(fold);
1114 return opt;
1115 }
1116
1117 opt = isl_qpolynomial_opt_on_domain(isl_qpolynomial_copy(fold->qp[0]),
1118 isl_set_copy(set), max);
1119 for (i = 1; i < fold->n; ++i) {
1120 isl_val *opt_i;
1121 opt_i = isl_qpolynomial_opt_on_domain(
1122 isl_qpolynomial_copy(fold->qp[i]),
1123 isl_set_copy(set), max);
1124 if (max)
1125 opt = isl_val_max(opt, opt_i);
1126 else
1127 opt = isl_val_min(opt, opt_i);
1128 }
1129
1130 isl_set_free(set);
1131 isl_qpolynomial_fold_free(fold);
1132
1133 return opt;
1134 error:
1135 isl_set_free(set);
1136 isl_qpolynomial_fold_free(fold);
1137 return NULL;
1138 }
1139
1140 /* Check whether for each quasi-polynomial in "fold2" there is
1141 * a quasi-polynomial in "fold1" that dominates it on "set".
1142 */
1143 static int qpolynomial_fold_covers_on_domain(__isl_keep isl_set *set,
1144 __isl_keep isl_qpolynomial_fold *fold1,
1145 __isl_keep isl_qpolynomial_fold *fold2)
1146 {
1147 int i, j;
1148 int covers;
1149
1150 if (!set || !fold1 || !fold2)
1151 return -1;
1152
1153 covers = fold1->type == isl_fold_max ? 1 : -1;
1154
1155 for (i = 0; i < fold2->n; ++i) {
1156 for (j = 0; j < fold1->n; ++j) {
1157 isl_qpolynomial *d;
1158 int sgn;
1159
1160 d = isl_qpolynomial_sub(
1161 isl_qpolynomial_copy(fold1->qp[j]),
1162 isl_qpolynomial_copy(fold2->qp[i]));
1163 sgn = isl_qpolynomial_sign(set, d);
1164 isl_qpolynomial_free(d);
1165 if (sgn == covers)
1166 break;
1167 }
1168 if (j >= fold1->n)
1169 return 0;
1170 }
1171
1172 return 1;
1173 }
1174
1175 /* Check whether "pwf1" dominated "pwf2", i.e., the domain of "pwf1" contains
1176 * that of "pwf2" and on each cell, the corresponding fold from pwf1 dominates
1177 * that of pwf2.
1178 */
1179 int isl_pw_qpolynomial_fold_covers(__isl_keep isl_pw_qpolynomial_fold *pwf1,
1180 __isl_keep isl_pw_qpolynomial_fold *pwf2)
1181 {
1182 int i, j;
1183 isl_set *dom1, *dom2;
1184 int is_subset;
1185
1186 if (!pwf1 || !pwf2)
1187 return -1;
1188
1189 if (pwf2->n == 0)
1190 return 1;
1191 if (pwf1->n == 0)
1192 return 0;
1193
1194 dom1 = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf1));
1195 dom2 = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf2));
1196 is_subset = isl_set_is_subset(dom2, dom1);
1197 isl_set_free(dom1);
1198 isl_set_free(dom2);
1199
1200 if (is_subset < 0 || !is_subset)
1201 return is_subset;
1202
1203 for (i = 0; i < pwf2->n; ++i) {
1204 for (j = 0; j < pwf1->n; ++j) {
1205 int is_empty;
1206 isl_set *common;
1207 int covers;
1208
1209 common = isl_set_intersect(isl_set_copy(pwf1->p[j].set),
1210 isl_set_copy(pwf2->p[i].set));
1211 is_empty = isl_set_is_empty(common);
1212 if (is_empty < 0 || is_empty) {
1213 isl_set_free(common);
1214 if (is_empty < 0)
1215 return -1;
1216 continue;
1217 }
1218 covers = qpolynomial_fold_covers_on_domain(common,
1219 pwf1->p[j].fold, pwf2->p[i].fold);
1220 isl_set_free(common);
1221 if (covers < 0 || !covers)
1222 return covers;
1223 }
1224 }
1225
1226 return 1;
1227 }
1228
1229 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_morph_domain(
1230 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_morph *morph)
1231 {
1232 int i;
1233 isl_ctx *ctx;
1234
1235 if (!fold || !morph)
1236 goto error;
1237
1238 ctx = fold->dim->ctx;
1239 isl_assert(ctx, isl_space_is_equal(fold->dim, morph->dom->dim), goto error);
1240
1241 fold = isl_qpolynomial_fold_cow(fold);
1242 if (!fold)
1243 goto error;
1244
1245 isl_space_free(fold->dim);
1246 fold->dim = isl_space_copy(morph->ran->dim);
1247 if (!fold->dim)
1248 goto error;
1249
1250 for (i = 0; i < fold->n; ++i) {
1251 fold->qp[i] = isl_qpolynomial_morph_domain(fold->qp[i],
1252 isl_morph_copy(morph));
1253 if (!fold->qp[i])
1254 goto error;
1255 }
1256
1257 isl_morph_free(morph);
1258
1259 return fold;
1260 error:
1261 isl_qpolynomial_fold_free(fold);
1262 isl_morph_free(morph);
1263 return NULL;
1264 }
1265
1266 enum isl_fold isl_qpolynomial_fold_get_type(__isl_keep isl_qpolynomial_fold *fold)
1267 {
1268 if (!fold)
1269 return isl_fold_list;
1270 return fold->type;
1271 }
1272
1273 enum isl_fold isl_union_pw_qpolynomial_fold_get_type(
1274 __isl_keep isl_union_pw_qpolynomial_fold *upwf)
1275 {
1276 if (!upwf)
1277 return isl_fold_list;
1278 return upwf->type;
1279 }
1280
1281 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_lift(
1282 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_space *dim)
1283 {
1284 int i;
1285
1286 if (!fold || !dim)
1287 goto error;
1288
1289 if (isl_space_is_equal(fold->dim, dim)) {
1290 isl_space_free(dim);
1291 return fold;
1292 }
1293
1294 fold = isl_qpolynomial_fold_cow(fold);
1295 if (!fold)
1296 goto error;
1297
1298 isl_space_free(fold->dim);
1299 fold->dim = isl_space_copy(dim);
1300 if (!fold->dim)
1301 goto error;
1302
1303 for (i = 0; i < fold->n; ++i) {
1304 fold->qp[i] = isl_qpolynomial_lift(fold->qp[i],
1305 isl_space_copy(dim));
1306 if (!fold->qp[i])
1307 goto error;
1308 }
1309
1310 isl_space_free(dim);
1311
1312 return fold;
1313 error:
1314 isl_qpolynomial_fold_free(fold);
1315 isl_space_free(dim);
1316 return NULL;
1317 }
1318
1319 isl_stat isl_qpolynomial_fold_foreach_qpolynomial(
1320 __isl_keep isl_qpolynomial_fold *fold,
1321 isl_stat (*fn)(__isl_take isl_qpolynomial *qp, void *user), void *user)
1322 {
1323 int i;
1324
1325 if (!fold)
1326 return isl_stat_error;
1327
1328 for (i = 0; i < fold->n; ++i)
1329 if (fn(isl_qpolynomial_copy(fold->qp[i]), user) < 0)
1330 return isl_stat_error;
1331
1332 return isl_stat_ok;
1333 }
1334
1335 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_move_dims(
1336 __isl_take isl_qpolynomial_fold *fold,
1337 enum isl_dim_type dst_type, unsigned dst_pos,
1338 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1339 {
1340 int i;
1341
1342 if (n == 0)
1343 return fold;
1344
1345 fold = isl_qpolynomial_fold_cow(fold);
1346 if (!fold)
1347 return NULL;
1348
1349 fold->dim = isl_space_move_dims(fold->dim, dst_type, dst_pos,
1350 src_type, src_pos, n);
1351 if (!fold->dim)
1352 goto error;
1353
1354 for (i = 0; i < fold->n; ++i) {
1355 fold->qp[i] = isl_qpolynomial_move_dims(fold->qp[i],
1356 dst_type, dst_pos, src_type, src_pos, n);
1357 if (!fold->qp[i])
1358 goto error;
1359 }
1360
1361 return fold;
1362 error:
1363 isl_qpolynomial_fold_free(fold);
1364 return NULL;
1365 }
1366
1367 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
1368 * in fold->qp[k] by subs[i].
1369 */
1370 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_substitute(
1371 __isl_take isl_qpolynomial_fold *fold,
1372 enum isl_dim_type type, unsigned first, unsigned n,
1373 __isl_keep isl_qpolynomial **subs)
1374 {
1375 int i;
1376
1377 if (n == 0)
1378 return fold;
1379
1380 fold = isl_qpolynomial_fold_cow(fold);
1381 if (!fold)
1382 return NULL;
1383
1384 for (i = 0; i < fold->n; ++i) {
1385 fold->qp[i] = isl_qpolynomial_substitute(fold->qp[i],
1386 type, first, n, subs);
1387 if (!fold->qp[i])
1388 goto error;
1389 }
1390
1391 return fold;
1392 error:
1393 isl_qpolynomial_fold_free(fold);
1394 return NULL;
1395 }
1396
1397 static isl_stat add_pwqp(__isl_take isl_pw_qpolynomial *pwqp, void *user)
1398 {
1399 isl_ctx *ctx;
1400 isl_pw_qpolynomial_fold *pwf;
1401 isl_union_pw_qpolynomial_fold **upwf;
1402 uint32_t hash;
1403 struct isl_hash_table_entry *entry;
1404
1405 upwf = (isl_union_pw_qpolynomial_fold **)user;
1406
1407 ctx = pwqp->dim->ctx;
1408 hash = isl_space_get_hash(pwqp->dim);
1409 entry = isl_hash_table_find(ctx, &(*upwf)->table, hash,
1410 &isl_union_pw_qpolynomial_fold_has_same_domain_space,
1411 pwqp->dim, 1);
1412 if (!entry)
1413 goto error;
1414
1415 pwf = isl_pw_qpolynomial_fold_from_pw_qpolynomial((*upwf)->type, pwqp);
1416 if (!entry->data)
1417 entry->data = pwf;
1418 else {
1419 entry->data = isl_pw_qpolynomial_fold_add(entry->data, pwf);
1420 if (!entry->data)
1421 return isl_stat_error;
1422 if (isl_pw_qpolynomial_fold_is_zero(entry->data)) {
1423 isl_pw_qpolynomial_fold_free(entry->data);
1424 isl_hash_table_remove(ctx, &(*upwf)->table, entry);
1425 }
1426 }
1427
1428 return isl_stat_ok;
1429 error:
1430 isl_pw_qpolynomial_free(pwqp);
1431 return isl_stat_error;
1432 }
1433
1434 __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_add_union_pw_qpolynomial(
1435 __isl_take isl_union_pw_qpolynomial_fold *upwf,
1436 __isl_take isl_union_pw_qpolynomial *upwqp)
1437 {
1438 upwf = isl_union_pw_qpolynomial_fold_align_params(upwf,
1439 isl_union_pw_qpolynomial_get_space(upwqp));
1440 upwqp = isl_union_pw_qpolynomial_align_params(upwqp,
1441 isl_union_pw_qpolynomial_fold_get_space(upwf));
1442
1443 upwf = isl_union_pw_qpolynomial_fold_cow(upwf);
1444 if (!upwf || !upwqp)
1445 goto error;
1446
1447 if (isl_union_pw_qpolynomial_foreach_pw_qpolynomial(upwqp, &add_pwqp,
1448 &upwf) < 0)
1449 goto error;
1450
1451 isl_union_pw_qpolynomial_free(upwqp);
1452
1453 return upwf;
1454 error:
1455 isl_union_pw_qpolynomial_fold_free(upwf);
1456 isl_union_pw_qpolynomial_free(upwqp);
1457 return NULL;
1458 }
1459
1460 static int join_compatible(__isl_keep isl_space *dim1, __isl_keep isl_space *dim2)
1461 {
1462 int m;
1463 m = isl_space_match(dim1, isl_dim_param, dim2, isl_dim_param);
1464 if (m < 0 || !m)
1465 return m;
1466 return isl_space_tuple_is_equal(dim1, isl_dim_out, dim2, isl_dim_in);
1467 }
1468
1469 /* Compute the intersection of the range of the map and the domain
1470 * of the piecewise quasipolynomial reduction and then compute a bound
1471 * on the associated quasipolynomial reduction over all elements
1472 * in this intersection.
1473 *
1474 * We first introduce some unconstrained dimensions in the
1475 * piecewise quasipolynomial, intersect the resulting domain
1476 * with the wrapped map and the compute the sum.
1477 */
1478 __isl_give isl_pw_qpolynomial_fold *isl_map_apply_pw_qpolynomial_fold(
1479 __isl_take isl_map *map, __isl_take isl_pw_qpolynomial_fold *pwf,
1480 int *tight)
1481 {
1482 isl_ctx *ctx;
1483 isl_set *dom;
1484 isl_space *map_dim;
1485 isl_space *pwf_dim;
1486 unsigned n_in;
1487 int ok;
1488
1489 ctx = isl_map_get_ctx(map);
1490 if (!ctx)
1491 goto error;
1492
1493 map_dim = isl_map_get_space(map);
1494 pwf_dim = isl_pw_qpolynomial_fold_get_space(pwf);
1495 ok = join_compatible(map_dim, pwf_dim);
1496 isl_space_free(map_dim);
1497 isl_space_free(pwf_dim);
1498 if (!ok)
1499 isl_die(ctx, isl_error_invalid, "incompatible dimensions",
1500 goto error);
1501
1502 n_in = isl_map_dim(map, isl_dim_in);
1503 pwf = isl_pw_qpolynomial_fold_insert_dims(pwf, isl_dim_in, 0, n_in);
1504
1505 dom = isl_map_wrap(map);
1506 pwf = isl_pw_qpolynomial_fold_reset_domain_space(pwf,
1507 isl_set_get_space(dom));
1508
1509 pwf = isl_pw_qpolynomial_fold_intersect_domain(pwf, dom);
1510 pwf = isl_pw_qpolynomial_fold_bound(pwf, tight);
1511
1512 return pwf;
1513 error:
1514 isl_map_free(map);
1515 isl_pw_qpolynomial_fold_free(pwf);
1516 return NULL;
1517 }
1518
1519 __isl_give isl_pw_qpolynomial_fold *isl_set_apply_pw_qpolynomial_fold(
1520 __isl_take isl_set *set, __isl_take isl_pw_qpolynomial_fold *pwf,
1521 int *tight)
1522 {
1523 return isl_map_apply_pw_qpolynomial_fold(set, pwf, tight);
1524 }
1525
1526 struct isl_apply_fold_data {
1527 isl_union_pw_qpolynomial_fold *upwf;
1528 isl_union_pw_qpolynomial_fold *res;
1529 isl_map *map;
1530 int tight;
1531 };
1532
1533 static isl_stat pw_qpolynomial_fold_apply(
1534 __isl_take isl_pw_qpolynomial_fold *pwf, void *user)
1535 {
1536 isl_space *map_dim;
1537 isl_space *pwf_dim;
1538 struct isl_apply_fold_data *data = user;
1539 int ok;
1540
1541 map_dim = isl_map_get_space(data->map);
1542 pwf_dim = isl_pw_qpolynomial_fold_get_space(pwf);
1543 ok = join_compatible(map_dim, pwf_dim);
1544 isl_space_free(map_dim);
1545 isl_space_free(pwf_dim);
1546
1547 if (ok) {
1548 pwf = isl_map_apply_pw_qpolynomial_fold(isl_map_copy(data->map),
1549 pwf, data->tight ? &data->tight : NULL);
1550 data->res = isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold(
1551 data->res, pwf);
1552 } else
1553 isl_pw_qpolynomial_fold_free(pwf);
1554
1555 return isl_stat_ok;
1556 }
1557
1558 static isl_stat map_apply(__isl_take isl_map *map, void *user)
1559 {
1560 struct isl_apply_fold_data *data = user;
1561 isl_stat r;
1562
1563 data->map = map;
1564 r = isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold(
1565 data->upwf, &pw_qpolynomial_fold_apply, data);
1566
1567 isl_map_free(map);
1568 return r;
1569 }
1570
1571 __isl_give isl_union_pw_qpolynomial_fold *isl_union_map_apply_union_pw_qpolynomial_fold(
1572 __isl_take isl_union_map *umap,
1573 __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight)
1574 {
1575 isl_space *dim;
1576 enum isl_fold type;
1577 struct isl_apply_fold_data data;
1578
1579 upwf = isl_union_pw_qpolynomial_fold_align_params(upwf,
1580 isl_union_map_get_space(umap));
1581 umap = isl_union_map_align_params(umap,
1582 isl_union_pw_qpolynomial_fold_get_space(upwf));
1583
1584 data.upwf = upwf;
1585 data.tight = tight ? 1 : 0;
1586 dim = isl_union_pw_qpolynomial_fold_get_space(upwf);
1587 type = isl_union_pw_qpolynomial_fold_get_type(upwf);
1588 data.res = isl_union_pw_qpolynomial_fold_zero(dim, type);
1589 if (isl_union_map_foreach_map(umap, &map_apply, &data) < 0)
1590 goto error;
1591
1592 isl_union_map_free(umap);
1593 isl_union_pw_qpolynomial_fold_free(upwf);
1594
1595 if (tight)
1596 *tight = data.tight;
1597
1598 return data.res;
1599 error:
1600 isl_union_map_free(umap);
1601 isl_union_pw_qpolynomial_fold_free(upwf);
1602 isl_union_pw_qpolynomial_fold_free(data.res);
1603 return NULL;
1604 }
1605
1606 __isl_give isl_union_pw_qpolynomial_fold *isl_union_set_apply_union_pw_qpolynomial_fold(
1607 __isl_take isl_union_set *uset,
1608 __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight)
1609 {
1610 return isl_union_map_apply_union_pw_qpolynomial_fold(uset, upwf, tight);
1611 }
1612
1613 /* Reorder the dimension of "fold" according to the given reordering.
1614 */
1615 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_realign_domain(
1616 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_reordering *r)
1617 {
1618 int i;
1619
1620 fold = isl_qpolynomial_fold_cow(fold);
1621 if (!fold || !r)
1622 goto error;
1623
1624 for (i = 0; i < fold->n; ++i) {
1625 fold->qp[i] = isl_qpolynomial_realign_domain(fold->qp[i],
1626 isl_reordering_copy(r));
1627 if (!fold->qp[i])
1628 goto error;
1629 }
1630
1631 fold = isl_qpolynomial_fold_reset_domain_space(fold,
1632 isl_space_copy(r->dim));
1633
1634 isl_reordering_free(r);
1635
1636 return fold;
1637 error:
1638 isl_qpolynomial_fold_free(fold);
1639 isl_reordering_free(r);
1640 return NULL;
1641 }
1642
1643 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_mul_isl_int(
1644 __isl_take isl_qpolynomial_fold *fold, isl_int v)
1645 {
1646 int i;
1647
1648 if (isl_int_is_one(v))
1649 return fold;
1650 if (fold && isl_int_is_zero(v)) {
1651 isl_qpolynomial_fold *zero;
1652 isl_space *dim = isl_space_copy(fold->dim);
1653 zero = isl_qpolynomial_fold_empty(fold->type, dim);
1654 isl_qpolynomial_fold_free(fold);
1655 return zero;
1656 }
1657
1658 fold = isl_qpolynomial_fold_cow(fold);
1659 if (!fold)
1660 return NULL;
1661
1662 if (isl_int_is_neg(v))
1663 fold->type = isl_fold_type_negate(fold->type);
1664 for (i = 0; i < fold->n; ++i) {
1665 fold->qp[i] = isl_qpolynomial_mul_isl_int(fold->qp[i], v);
1666 if (!fold->qp[i])
1667 goto error;
1668 }
1669
1670 return fold;
1671 error:
1672 isl_qpolynomial_fold_free(fold);
1673 return NULL;
1674 }
1675
1676 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale(
1677 __isl_take isl_qpolynomial_fold *fold, isl_int v)
1678 {
1679 return isl_qpolynomial_fold_mul_isl_int(fold, v);
1680 }
1681
1682 /* Multiply "fold" by "v".
1683 */
1684 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale_val(
1685 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_val *v)
1686 {
1687 int i;
1688
1689 if (!fold || !v)
1690 goto error;
1691
1692 if (isl_val_is_one(v)) {
1693 isl_val_free(v);
1694 return fold;
1695 }
1696 if (isl_val_is_zero(v)) {
1697 isl_qpolynomial_fold *zero;
1698 isl_space *space = isl_qpolynomial_fold_get_domain_space(fold);
1699 zero = isl_qpolynomial_fold_empty(fold->type, space);
1700 isl_qpolynomial_fold_free(fold);
1701 isl_val_free(v);
1702 return zero;
1703 }
1704 if (!isl_val_is_rat(v))
1705 isl_die(isl_qpolynomial_fold_get_ctx(fold), isl_error_invalid,
1706 "expecting rational factor", goto error);
1707
1708 fold = isl_qpolynomial_fold_cow(fold);
1709 if (!fold)
1710 goto error;
1711
1712 if (isl_val_is_neg(v))
1713 fold->type = isl_fold_type_negate(fold->type);
1714 for (i = 0; i < fold->n; ++i) {
1715 fold->qp[i] = isl_qpolynomial_scale_val(fold->qp[i],
1716 isl_val_copy(v));
1717 if (!fold->qp[i])
1718 goto error;
1719 }
1720
1721 isl_val_free(v);
1722 return fold;
1723 error:
1724 isl_val_free(v);
1725 isl_qpolynomial_fold_free(fold);
1726 return NULL;
1727 }
1728
1729 /* Divide "fold" by "v".
1730 */
1731 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale_down_val(
1732 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_val *v)
1733 {
1734 if (!fold || !v)
1735 goto error;
1736
1737 if (isl_val_is_one(v)) {
1738 isl_val_free(v);
1739 return fold;
1740 }
1741 if (!isl_val_is_rat(v))
1742 isl_die(isl_qpolynomial_fold_get_ctx(fold), isl_error_invalid,
1743 "expecting rational factor", goto error);
1744 if (isl_val_is_zero(v))
1745 isl_die(isl_val_get_ctx(v), isl_error_invalid,
1746 "cannot scale down by zero", goto error);
1747
1748 return isl_qpolynomial_fold_scale_val(fold, isl_val_inv(v));
1749 error:
1750 isl_val_free(v);
1751 isl_qpolynomial_fold_free(fold);
1752 return NULL;
1753 }
Integer set library