?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
isl_basic_map_plain_is_equal: improve error handling
[isl.git] / isl_fold.c
blob95b1d1996cabcefa57fe1ff8e23afa6d1c97347f
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 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold_on_domain(
410 __isl_keep isl_set *set,
411 __isl_take isl_qpolynomial_fold *fold1,
412 __isl_take isl_qpolynomial_fold *fold2)
413 {
414 int i, j;
415 int n1;
416 struct isl_qpolynomial_fold *res = NULL;
417 int better;
418
419 if (!fold1 || !fold2)
420 goto error;
421
422 isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error);
423 isl_assert(fold1->dim->ctx, isl_space_is_equal(fold1->dim, fold2->dim),
424 goto error);
425
426 better = fold1->type == isl_fold_max ? -1 : 1;
427
428 if (isl_qpolynomial_fold_is_empty(fold1)) {
429 isl_qpolynomial_fold_free(fold1);
430 return fold2;
431 }
432
433 if (isl_qpolynomial_fold_is_empty(fold2)) {
434 isl_qpolynomial_fold_free(fold2);
435 return fold1;
436 }
437
438 res = qpolynomial_fold_alloc(fold1->type, isl_space_copy(fold1->dim),
439 fold1->n + fold2->n);
440 if (!res)
441 goto error;
442
443 for (i = 0; i < fold1->n; ++i) {
444 res->qp[res->n] = isl_qpolynomial_copy(fold1->qp[i]);
445 if (!res->qp[res->n])
446 goto error;
447 res->n++;
448 }
449 n1 = res->n;
450
451 for (i = 0; i < fold2->n; ++i) {
452 for (j = n1 - 1; j >= 0; --j) {
453 isl_qpolynomial *d;
454 int sgn, equal;
455 equal = isl_qpolynomial_plain_is_equal(res->qp[j],
456 fold2->qp[i]);
457 if (equal < 0)
458 goto error;
459 if (equal)
460 break;
461 d = isl_qpolynomial_sub(
462 isl_qpolynomial_copy(res->qp[j]),
463 isl_qpolynomial_copy(fold2->qp[i]));
464 sgn = isl_qpolynomial_sign(set, d);
465 isl_qpolynomial_free(d);
466 if (sgn == 0)
467 continue;
468 if (sgn != better)
469 break;
470 isl_qpolynomial_free(res->qp[j]);
471 if (j != n1 - 1)
472 res->qp[j] = res->qp[n1 - 1];
473 n1--;
474 if (n1 != res->n - 1)
475 res->qp[n1] = res->qp[res->n - 1];
476 res->n--;
477 }
478 if (j >= 0)
479 continue;
480 res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]);
481 if (!res->qp[res->n])
482 goto error;
483 res->n++;
484 }
485
486 isl_qpolynomial_fold_free(fold1);
487 isl_qpolynomial_fold_free(fold2);
488
489 return res;
490 error:
491 isl_qpolynomial_fold_free(res);
492 isl_qpolynomial_fold_free(fold1);
493 isl_qpolynomial_fold_free(fold2);
494 return NULL;
495 }
496
497 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_add_qpolynomial(
498 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_qpolynomial *qp)
499 {
500 int i;
501
502 if (!fold || !qp)
503 goto error;
504
505 if (isl_qpolynomial_is_zero(qp)) {
506 isl_qpolynomial_free(qp);
507 return fold;
508 }
509
510 fold = isl_qpolynomial_fold_cow(fold);
511 if (!fold)
512 goto error;
513
514 for (i = 0; i < fold->n; ++i) {
515 fold->qp[i] = isl_qpolynomial_add(fold->qp[i],
516 isl_qpolynomial_copy(qp));
517 if (!fold->qp[i])
518 goto error;
519 }
520
521 isl_qpolynomial_free(qp);
522 return fold;
523 error:
524 isl_qpolynomial_fold_free(fold);
525 isl_qpolynomial_free(qp);
526 return NULL;
527 }
528
529 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_add_on_domain(
530 __isl_keep isl_set *dom,
531 __isl_take isl_qpolynomial_fold *fold1,
532 __isl_take isl_qpolynomial_fold *fold2)
533 {
534 int i;
535 isl_qpolynomial_fold *res = NULL;
536
537 if (!fold1 || !fold2)
538 goto error;
539
540 if (isl_qpolynomial_fold_is_empty(fold1)) {
541 isl_qpolynomial_fold_free(fold1);
542 return fold2;
543 }
544
545 if (isl_qpolynomial_fold_is_empty(fold2)) {
546 isl_qpolynomial_fold_free(fold2);
547 return fold1;
548 }
549
550 if (fold1->n == 1 && fold2->n != 1)
551 return isl_qpolynomial_fold_add_on_domain(dom, fold2, fold1);
552
553 if (fold2->n == 1) {
554 res = isl_qpolynomial_fold_add_qpolynomial(fold1,
555 isl_qpolynomial_copy(fold2->qp[0]));
556 isl_qpolynomial_fold_free(fold2);
557 return res;
558 }
559
560 res = isl_qpolynomial_fold_add_qpolynomial(
561 isl_qpolynomial_fold_copy(fold1),
562 isl_qpolynomial_copy(fold2->qp[0]));
563
564 for (i = 1; i < fold2->n; ++i) {
565 isl_qpolynomial_fold *res_i;
566 res_i = isl_qpolynomial_fold_add_qpolynomial(
567 isl_qpolynomial_fold_copy(fold1),
568 isl_qpolynomial_copy(fold2->qp[i]));
569 res = isl_qpolynomial_fold_fold_on_domain(dom, res, res_i);
570 }
571
572 isl_qpolynomial_fold_free(fold1);
573 isl_qpolynomial_fold_free(fold2);
574 return res;
575 error:
576 isl_qpolynomial_fold_free(res);
577 isl_qpolynomial_fold_free(fold1);
578 isl_qpolynomial_fold_free(fold2);
579 return NULL;
580 }
581
582 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_substitute_equalities(
583 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_basic_set *eq)
584 {
585 int i;
586
587 if (!fold || !eq)
588 goto error;
589
590 fold = isl_qpolynomial_fold_cow(fold);
591 if (!fold)
592 return NULL;
593
594 for (i = 0; i < fold->n; ++i) {
595 fold->qp[i] = isl_qpolynomial_substitute_equalities(fold->qp[i],
596 isl_basic_set_copy(eq));
597 if (!fold->qp[i])
598 goto error;
599 }
600
601 isl_basic_set_free(eq);
602 return fold;
603 error:
604 isl_basic_set_free(eq);
605 isl_qpolynomial_fold_free(fold);
606 return NULL;
607 }
608
609 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_gist(
610 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *context)
611 {
612 int i;
613
614 if (!fold || !context)
615 goto error;
616
617 fold = isl_qpolynomial_fold_cow(fold);
618 if (!fold)
619 return NULL;
620
621 for (i = 0; i < fold->n; ++i) {
622 fold->qp[i] = isl_qpolynomial_gist(fold->qp[i],
623 isl_set_copy(context));
624 if (!fold->qp[i])
625 goto error;
626 }
627
628 isl_set_free(context);
629 return fold;
630 error:
631 isl_set_free(context);
632 isl_qpolynomial_fold_free(fold);
633 return NULL;
634 }
635
636 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_gist_params(
637 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *context)
638 {
639 isl_space *space = isl_qpolynomial_fold_get_domain_space(fold);
640 isl_set *dom_context = isl_set_universe(space);
641 dom_context = isl_set_intersect_params(dom_context, context);
642 return isl_qpolynomial_fold_gist(fold, dom_context);
643 }
644
645 #define HAS_TYPE
646
647 #undef PW
648 #define PW isl_pw_qpolynomial_fold
649 #undef EL
650 #define EL isl_qpolynomial_fold
651 #undef EL_IS_ZERO
652 #define EL_IS_ZERO is_empty
653 #undef ZERO
654 #define ZERO zero
655 #undef IS_ZERO
656 #define IS_ZERO is_zero
657 #undef FIELD
658 #define FIELD fold
659 #undef DEFAULT_IS_ZERO
660 #define DEFAULT_IS_ZERO 1
661
662 #define NO_NEG
663 #define NO_PULLBACK
664
665 #include <isl_pw_templ.c>
666
667 #undef UNION
668 #define UNION isl_union_pw_qpolynomial_fold
669 #undef PART
670 #define PART isl_pw_qpolynomial_fold
671 #undef PARTS
672 #define PARTS pw_qpolynomial_fold
673 #define ALIGN_DOMAIN
674
675 #define NO_SUB
676
677 #include <isl_union_templ.c>
678
679 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_empty(enum isl_fold type,
680 __isl_take isl_space *dim)
681 {
682 return qpolynomial_fold_alloc(type, dim, 0);
683 }
684
685 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_alloc(
686 enum isl_fold type, __isl_take isl_qpolynomial *qp)
687 {
688 isl_qpolynomial_fold *fold;
689
690 if (!qp)
691 return NULL;
692
693 fold = qpolynomial_fold_alloc(type, isl_space_copy(qp->dim), 1);
694 if (!fold)
695 goto error;
696
697 fold->qp[0] = qp;
698 fold->n++;
699
700 return fold;
701 error:
702 isl_qpolynomial_fold_free(fold);
703 isl_qpolynomial_free(qp);
704 return NULL;
705 }
706
707 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_copy(
708 __isl_keep isl_qpolynomial_fold *fold)
709 {
710 if (!fold)
711 return NULL;
712
713 fold->ref++;
714 return fold;
715 }
716
717 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_dup(
718 __isl_keep isl_qpolynomial_fold *fold)
719 {
720 int i;
721 isl_qpolynomial_fold *dup;
722
723 if (!fold)
724 return NULL;
725 dup = qpolynomial_fold_alloc(fold->type,
726 isl_space_copy(fold->dim), fold->n);
727 if (!dup)
728 return NULL;
729
730 dup->n = fold->n;
731 for (i = 0; i < fold->n; ++i) {
732 dup->qp[i] = isl_qpolynomial_copy(fold->qp[i]);
733 if (!dup->qp[i])
734 goto error;
735 }
736
737 return dup;
738 error:
739 isl_qpolynomial_fold_free(dup);
740 return NULL;
741 }
742
743 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_cow(
744 __isl_take isl_qpolynomial_fold *fold)
745 {
746 if (!fold)
747 return NULL;
748
749 if (fold->ref == 1)
750 return fold;
751 fold->ref--;
752 return isl_qpolynomial_fold_dup(fold);
753 }
754
755 void isl_qpolynomial_fold_free(__isl_take isl_qpolynomial_fold *fold)
756 {
757 int i;
758
759 if (!fold)
760 return;
761 if (--fold->ref > 0)
762 return;
763
764 for (i = 0; i < fold->n; ++i)
765 isl_qpolynomial_free(fold->qp[i]);
766 isl_space_free(fold->dim);
767 free(fold);
768 }
769
770 int isl_qpolynomial_fold_is_empty(__isl_keep isl_qpolynomial_fold *fold)
771 {
772 if (!fold)
773 return -1;
774
775 return fold->n == 0;
776 }
777
778 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_fold(
779 __isl_take isl_qpolynomial_fold *fold1,
780 __isl_take isl_qpolynomial_fold *fold2)
781 {
782 int i;
783 struct isl_qpolynomial_fold *res = NULL;
784
785 if (!fold1 || !fold2)
786 goto error;
787
788 isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error);
789 isl_assert(fold1->dim->ctx, isl_space_is_equal(fold1->dim, fold2->dim),
790 goto error);
791
792 if (isl_qpolynomial_fold_is_empty(fold1)) {
793 isl_qpolynomial_fold_free(fold1);
794 return fold2;
795 }
796
797 if (isl_qpolynomial_fold_is_empty(fold2)) {
798 isl_qpolynomial_fold_free(fold2);
799 return fold1;
800 }
801
802 res = qpolynomial_fold_alloc(fold1->type, isl_space_copy(fold1->dim),
803 fold1->n + fold2->n);
804 if (!res)
805 goto error;
806
807 for (i = 0; i < fold1->n; ++i) {
808 res->qp[res->n] = isl_qpolynomial_copy(fold1->qp[i]);
809 if (!res->qp[res->n])
810 goto error;
811 res->n++;
812 }
813
814 for (i = 0; i < fold2->n; ++i) {
815 res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]);
816 if (!res->qp[res->n])
817 goto error;
818 res->n++;
819 }
820
821 isl_qpolynomial_fold_free(fold1);
822 isl_qpolynomial_fold_free(fold2);
823
824 return res;
825 error:
826 isl_qpolynomial_fold_free(res);
827 isl_qpolynomial_fold_free(fold1);
828 isl_qpolynomial_fold_free(fold2);
829 return NULL;
830 }
831
832 __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_fold(
833 __isl_take isl_pw_qpolynomial_fold *pw1,
834 __isl_take isl_pw_qpolynomial_fold *pw2)
835 {
836 int i, j, n;
837 struct isl_pw_qpolynomial_fold *res;
838 isl_set *set;
839
840 if (!pw1 || !pw2)
841 goto error;
842
843 isl_assert(pw1->dim->ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
844
845 if (isl_pw_qpolynomial_fold_is_zero(pw1)) {
846 isl_pw_qpolynomial_fold_free(pw1);
847 return pw2;
848 }
849
850 if (isl_pw_qpolynomial_fold_is_zero(pw2)) {
851 isl_pw_qpolynomial_fold_free(pw2);
852 return pw1;
853 }
854
855 if (pw1->type != pw2->type)
856 isl_die(pw1->dim->ctx, isl_error_invalid,
857 "fold types don't match", goto error);
858
859 n = (pw1->n + 1) * (pw2->n + 1);
860 res = isl_pw_qpolynomial_fold_alloc_size(isl_space_copy(pw1->dim),
861 pw1->type, n);
862
863 for (i = 0; i < pw1->n; ++i) {
864 set = isl_set_copy(pw1->p[i].set);
865 for (j = 0; j < pw2->n; ++j) {
866 struct isl_set *common;
867 isl_qpolynomial_fold *sum;
868 set = isl_set_subtract(set,
869 isl_set_copy(pw2->p[j].set));
870 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
871 isl_set_copy(pw2->p[j].set));
872 if (isl_set_plain_is_empty(common)) {
873 isl_set_free(common);
874 continue;
875 }
876
877 sum = isl_qpolynomial_fold_fold_on_domain(common,
878 isl_qpolynomial_fold_copy(pw1->p[i].fold),
879 isl_qpolynomial_fold_copy(pw2->p[j].fold));
880
881 res = isl_pw_qpolynomial_fold_add_piece(res, common, sum);
882 }
883 res = isl_pw_qpolynomial_fold_add_piece(res, set,
884 isl_qpolynomial_fold_copy(pw1->p[i].fold));
885 }
886
887 for (j = 0; j < pw2->n; ++j) {
888 set = isl_set_copy(pw2->p[j].set);
889 for (i = 0; i < pw1->n; ++i)
890 set = isl_set_subtract(set, isl_set_copy(pw1->p[i].set));
891 res = isl_pw_qpolynomial_fold_add_piece(res, set,
892 isl_qpolynomial_fold_copy(pw2->p[j].fold));
893 }
894
895 isl_pw_qpolynomial_fold_free(pw1);
896 isl_pw_qpolynomial_fold_free(pw2);
897
898 return res;
899 error:
900 isl_pw_qpolynomial_fold_free(pw1);
901 isl_pw_qpolynomial_fold_free(pw2);
902 return NULL;
903 }
904
905 __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold(
906 __isl_take isl_union_pw_qpolynomial_fold *u,
907 __isl_take isl_pw_qpolynomial_fold *part)
908 {
909 uint32_t hash;
910 struct isl_hash_table_entry *entry;
911
912 u = isl_union_pw_qpolynomial_fold_cow(u);
913
914 if (!part || !u)
915 goto error;
916
917 isl_assert(u->dim->ctx, isl_space_match(part->dim, isl_dim_param, u->dim,
918 isl_dim_param), goto error);
919
920 hash = isl_space_get_hash(part->dim);
921 entry = isl_hash_table_find(u->dim->ctx, &u->table, hash,
922 &has_dim, part->dim, 1);
923 if (!entry)
924 goto error;
925
926 if (!entry->data)
927 entry->data = part;
928 else {
929 entry->data = isl_pw_qpolynomial_fold_fold(entry->data,
930 isl_pw_qpolynomial_fold_copy(part));
931 if (!entry->data)
932 goto error;
933 isl_pw_qpolynomial_fold_free(part);
934 }
935
936 return u;
937 error:
938 isl_pw_qpolynomial_fold_free(part);
939 isl_union_pw_qpolynomial_fold_free(u);
940 return NULL;
941 }
942
943 static int fold_part(__isl_take isl_pw_qpolynomial_fold *part, void *user)
944 {
945 isl_union_pw_qpolynomial_fold **u;
946 u = (isl_union_pw_qpolynomial_fold **)user;
947
948 *u = isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold(*u, part);
949
950 return 0;
951 }
952
953 __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_fold(
954 __isl_take isl_union_pw_qpolynomial_fold *u1,
955 __isl_take isl_union_pw_qpolynomial_fold *u2)
956 {
957 u1 = isl_union_pw_qpolynomial_fold_cow(u1);
958
959 if (!u1 || !u2)
960 goto error;
961
962 if (isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold(u2,
963 &fold_part, &u1) < 0)
964 goto error;
965
966 isl_union_pw_qpolynomial_fold_free(u2);
967
968 return u1;
969 error:
970 isl_union_pw_qpolynomial_fold_free(u1);
971 isl_union_pw_qpolynomial_fold_free(u2);
972 return NULL;
973 }
974
975 __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_from_pw_qpolynomial(
976 enum isl_fold type, __isl_take isl_pw_qpolynomial *pwqp)
977 {
978 int i;
979 isl_pw_qpolynomial_fold *pwf;
980
981 if (!pwqp)
982 return NULL;
983
984 pwf = isl_pw_qpolynomial_fold_alloc_size(isl_space_copy(pwqp->dim),
985 type, pwqp->n);
986
987 for (i = 0; i < pwqp->n; ++i)
988 pwf = isl_pw_qpolynomial_fold_add_piece(pwf,
989 isl_set_copy(pwqp->p[i].set),
990 isl_qpolynomial_fold_alloc(type,
991 isl_qpolynomial_copy(pwqp->p[i].qp)));
992
993 isl_pw_qpolynomial_free(pwqp);
994
995 return pwf;
996 }
997
998 __isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_add(
999 __isl_take isl_pw_qpolynomial_fold *pwf1,
1000 __isl_take isl_pw_qpolynomial_fold *pwf2)
1001 {
1002 return isl_pw_qpolynomial_fold_union_add_(pwf1, pwf2);
1003 }
1004
1005 int isl_qpolynomial_fold_plain_is_equal(__isl_keep isl_qpolynomial_fold *fold1,
1006 __isl_keep isl_qpolynomial_fold *fold2)
1007 {
1008 int i;
1009
1010 if (!fold1 || !fold2)
1011 return -1;
1012
1013 if (fold1->n != fold2->n)
1014 return 0;
1015
1016 /* We probably want to sort the qps first... */
1017 for (i = 0; i < fold1->n; ++i) {
1018 int eq = isl_qpolynomial_plain_is_equal(fold1->qp[i], fold2->qp[i]);
1019 if (eq < 0 || !eq)
1020 return eq;
1021 }
1022
1023 return 1;
1024 }
1025
1026 __isl_give isl_val *isl_qpolynomial_fold_eval(
1027 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_point *pnt)
1028 {
1029 isl_ctx *ctx;
1030 isl_val *v;
1031
1032 if (!fold || !pnt)
1033 goto error;
1034 ctx = isl_point_get_ctx(pnt);
1035 isl_assert(pnt->dim->ctx, isl_space_is_equal(pnt->dim, fold->dim), goto error);
1036 isl_assert(pnt->dim->ctx,
1037 fold->type == isl_fold_max || fold->type == isl_fold_min,
1038 goto error);
1039
1040 if (fold->n == 0)
1041 v = isl_val_zero(ctx);
1042 else {
1043 int i;
1044 v = isl_qpolynomial_eval(isl_qpolynomial_copy(fold->qp[0]),
1045 isl_point_copy(pnt));
1046 for (i = 1; i < fold->n; ++i) {
1047 isl_val *v_i;
1048 v_i = isl_qpolynomial_eval(
1049 isl_qpolynomial_copy(fold->qp[i]),
1050 isl_point_copy(pnt));
1051 if (fold->type == isl_fold_max)
1052 v = isl_val_max(v, v_i);
1053 else
1054 v = isl_val_min(v, v_i);
1055 }
1056 }
1057 isl_qpolynomial_fold_free(fold);
1058 isl_point_free(pnt);
1059
1060 return v;
1061 error:
1062 isl_qpolynomial_fold_free(fold);
1063 isl_point_free(pnt);
1064 return NULL;
1065 }
1066
1067 size_t isl_pw_qpolynomial_fold_size(__isl_keep isl_pw_qpolynomial_fold *pwf)
1068 {
1069 int i;
1070 size_t n = 0;
1071
1072 for (i = 0; i < pwf->n; ++i)
1073 n += pwf->p[i].fold->n;
1074
1075 return n;
1076 }
1077
1078 __isl_give isl_val *isl_qpolynomial_fold_opt_on_domain(
1079 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_set *set, int max)
1080 {
1081 int i;
1082 isl_val *opt;
1083
1084 if (!set || !fold)
1085 goto error;
1086
1087 if (fold->n == 0) {
1088 opt = isl_val_zero(isl_set_get_ctx(set));
1089 isl_set_free(set);
1090 isl_qpolynomial_fold_free(fold);
1091 return opt;
1092 }
1093
1094 opt = isl_qpolynomial_opt_on_domain(isl_qpolynomial_copy(fold->qp[0]),
1095 isl_set_copy(set), max);
1096 for (i = 1; i < fold->n; ++i) {
1097 isl_val *opt_i;
1098 opt_i = isl_qpolynomial_opt_on_domain(
1099 isl_qpolynomial_copy(fold->qp[i]),
1100 isl_set_copy(set), max);
1101 if (max)
1102 opt = isl_val_max(opt, opt_i);
1103 else
1104 opt = isl_val_min(opt, opt_i);
1105 }
1106
1107 isl_set_free(set);
1108 isl_qpolynomial_fold_free(fold);
1109
1110 return opt;
1111 error:
1112 isl_set_free(set);
1113 isl_qpolynomial_fold_free(fold);
1114 return NULL;
1115 }
1116
1117 /* Check whether for each quasi-polynomial in "fold2" there is
1118 * a quasi-polynomial in "fold1" that dominates it on "set".
1119 */
1120 static int qpolynomial_fold_covers_on_domain(__isl_keep isl_set *set,
1121 __isl_keep isl_qpolynomial_fold *fold1,
1122 __isl_keep isl_qpolynomial_fold *fold2)
1123 {
1124 int i, j;
1125 int covers;
1126
1127 if (!set || !fold1 || !fold2)
1128 return -1;
1129
1130 covers = fold1->type == isl_fold_max ? 1 : -1;
1131
1132 for (i = 0; i < fold2->n; ++i) {
1133 for (j = 0; j < fold1->n; ++j) {
1134 isl_qpolynomial *d;
1135 int sgn;
1136
1137 d = isl_qpolynomial_sub(
1138 isl_qpolynomial_copy(fold1->qp[j]),
1139 isl_qpolynomial_copy(fold2->qp[i]));
1140 sgn = isl_qpolynomial_sign(set, d);
1141 isl_qpolynomial_free(d);
1142 if (sgn == covers)
1143 break;
1144 }
1145 if (j >= fold1->n)
1146 return 0;
1147 }
1148
1149 return 1;
1150 }
1151
1152 /* Check whether "pwf1" dominated "pwf2", i.e., the domain of "pwf1" contains
1153 * that of "pwf2" and on each cell, the corresponding fold from pwf1 dominates
1154 * that of pwf2.
1155 */
1156 int isl_pw_qpolynomial_fold_covers(__isl_keep isl_pw_qpolynomial_fold *pwf1,
1157 __isl_keep isl_pw_qpolynomial_fold *pwf2)
1158 {
1159 int i, j;
1160 isl_set *dom1, *dom2;
1161 int is_subset;
1162
1163 if (!pwf1 || !pwf2)
1164 return -1;
1165
1166 if (pwf2->n == 0)
1167 return 1;
1168 if (pwf1->n == 0)
1169 return 0;
1170
1171 dom1 = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf1));
1172 dom2 = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf2));
1173 is_subset = isl_set_is_subset(dom2, dom1);
1174 isl_set_free(dom1);
1175 isl_set_free(dom2);
1176
1177 if (is_subset < 0 || !is_subset)
1178 return is_subset;
1179
1180 for (i = 0; i < pwf2->n; ++i) {
1181 for (j = 0; j < pwf1->n; ++j) {
1182 int is_empty;
1183 isl_set *common;
1184 int covers;
1185
1186 common = isl_set_intersect(isl_set_copy(pwf1->p[j].set),
1187 isl_set_copy(pwf2->p[i].set));
1188 is_empty = isl_set_is_empty(common);
1189 if (is_empty < 0 || is_empty) {
1190 isl_set_free(common);
1191 if (is_empty < 0)
1192 return -1;
1193 continue;
1194 }
1195 covers = qpolynomial_fold_covers_on_domain(common,
1196 pwf1->p[j].fold, pwf2->p[i].fold);
1197 isl_set_free(common);
1198 if (covers < 0 || !covers)
1199 return covers;
1200 }
1201 }
1202
1203 return 1;
1204 }
1205
1206 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_morph_domain(
1207 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_morph *morph)
1208 {
1209 int i;
1210 isl_ctx *ctx;
1211
1212 if (!fold || !morph)
1213 goto error;
1214
1215 ctx = fold->dim->ctx;
1216 isl_assert(ctx, isl_space_is_equal(fold->dim, morph->dom->dim), goto error);
1217
1218 fold = isl_qpolynomial_fold_cow(fold);
1219 if (!fold)
1220 goto error;
1221
1222 isl_space_free(fold->dim);
1223 fold->dim = isl_space_copy(morph->ran->dim);
1224 if (!fold->dim)
1225 goto error;
1226
1227 for (i = 0; i < fold->n; ++i) {
1228 fold->qp[i] = isl_qpolynomial_morph_domain(fold->qp[i],
1229 isl_morph_copy(morph));
1230 if (!fold->qp[i])
1231 goto error;
1232 }
1233
1234 isl_morph_free(morph);
1235
1236 return fold;
1237 error:
1238 isl_qpolynomial_fold_free(fold);
1239 isl_morph_free(morph);
1240 return NULL;
1241 }
1242
1243 enum isl_fold isl_qpolynomial_fold_get_type(__isl_keep isl_qpolynomial_fold *fold)
1244 {
1245 if (!fold)
1246 return isl_fold_list;
1247 return fold->type;
1248 }
1249
1250 enum isl_fold isl_union_pw_qpolynomial_fold_get_type(
1251 __isl_keep isl_union_pw_qpolynomial_fold *upwf)
1252 {
1253 if (!upwf)
1254 return isl_fold_list;
1255 return upwf->type;
1256 }
1257
1258 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_lift(
1259 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_space *dim)
1260 {
1261 int i;
1262
1263 if (!fold || !dim)
1264 goto error;
1265
1266 if (isl_space_is_equal(fold->dim, dim)) {
1267 isl_space_free(dim);
1268 return fold;
1269 }
1270
1271 fold = isl_qpolynomial_fold_cow(fold);
1272 if (!fold)
1273 goto error;
1274
1275 isl_space_free(fold->dim);
1276 fold->dim = isl_space_copy(dim);
1277 if (!fold->dim)
1278 goto error;
1279
1280 for (i = 0; i < fold->n; ++i) {
1281 fold->qp[i] = isl_qpolynomial_lift(fold->qp[i],
1282 isl_space_copy(dim));
1283 if (!fold->qp[i])
1284 goto error;
1285 }
1286
1287 isl_space_free(dim);
1288
1289 return fold;
1290 error:
1291 isl_qpolynomial_fold_free(fold);
1292 isl_space_free(dim);
1293 return NULL;
1294 }
1295
1296 int isl_qpolynomial_fold_foreach_qpolynomial(
1297 __isl_keep isl_qpolynomial_fold *fold,
1298 int (*fn)(__isl_take isl_qpolynomial *qp, void *user), void *user)
1299 {
1300 int i;
1301
1302 if (!fold)
1303 return -1;
1304
1305 for (i = 0; i < fold->n; ++i)
1306 if (fn(isl_qpolynomial_copy(fold->qp[i]), user) < 0)
1307 return -1;
1308
1309 return 0;
1310 }
1311
1312 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_move_dims(
1313 __isl_take isl_qpolynomial_fold *fold,
1314 enum isl_dim_type dst_type, unsigned dst_pos,
1315 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1316 {
1317 int i;
1318
1319 if (n == 0)
1320 return fold;
1321
1322 fold = isl_qpolynomial_fold_cow(fold);
1323 if (!fold)
1324 return NULL;
1325
1326 fold->dim = isl_space_move_dims(fold->dim, dst_type, dst_pos,
1327 src_type, src_pos, n);
1328 if (!fold->dim)
1329 goto error;
1330
1331 for (i = 0; i < fold->n; ++i) {
1332 fold->qp[i] = isl_qpolynomial_move_dims(fold->qp[i],
1333 dst_type, dst_pos, src_type, src_pos, n);
1334 if (!fold->qp[i])
1335 goto error;
1336 }
1337
1338 return fold;
1339 error:
1340 isl_qpolynomial_fold_free(fold);
1341 return NULL;
1342 }
1343
1344 /* For each 0 <= i < "n", replace variable "first" + i of type "type"
1345 * in fold->qp[k] by subs[i].
1346 */
1347 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_substitute(
1348 __isl_take isl_qpolynomial_fold *fold,
1349 enum isl_dim_type type, unsigned first, unsigned n,
1350 __isl_keep isl_qpolynomial **subs)
1351 {
1352 int i;
1353
1354 if (n == 0)
1355 return fold;
1356
1357 fold = isl_qpolynomial_fold_cow(fold);
1358 if (!fold)
1359 return NULL;
1360
1361 for (i = 0; i < fold->n; ++i) {
1362 fold->qp[i] = isl_qpolynomial_substitute(fold->qp[i],
1363 type, first, n, subs);
1364 if (!fold->qp[i])
1365 goto error;
1366 }
1367
1368 return fold;
1369 error:
1370 isl_qpolynomial_fold_free(fold);
1371 return NULL;
1372 }
1373
1374 static int add_pwqp(__isl_take isl_pw_qpolynomial *pwqp, void *user)
1375 {
1376 isl_ctx *ctx;
1377 isl_pw_qpolynomial_fold *pwf;
1378 isl_union_pw_qpolynomial_fold **upwf;
1379 uint32_t hash;
1380 struct isl_hash_table_entry *entry;
1381
1382 upwf = (isl_union_pw_qpolynomial_fold **)user;
1383
1384 ctx = pwqp->dim->ctx;
1385 hash = isl_space_get_hash(pwqp->dim);
1386 entry = isl_hash_table_find(ctx, &(*upwf)->table,
1387 hash, &has_dim, pwqp->dim, 1);
1388 if (!entry)
1389 goto error;
1390
1391 pwf = isl_pw_qpolynomial_fold_from_pw_qpolynomial((*upwf)->type, pwqp);
1392 if (!entry->data)
1393 entry->data = pwf;
1394 else {
1395 entry->data = isl_pw_qpolynomial_fold_add(entry->data, pwf);
1396 if (!entry->data)
1397 return -1;
1398 if (isl_pw_qpolynomial_fold_is_zero(entry->data)) {
1399 isl_pw_qpolynomial_fold_free(entry->data);
1400 isl_hash_table_remove(ctx, &(*upwf)->table, entry);
1401 }
1402 }
1403
1404 return 0;
1405 error:
1406 isl_pw_qpolynomial_free(pwqp);
1407 return -1;
1408 }
1409
1410 __isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_fold_add_union_pw_qpolynomial(
1411 __isl_take isl_union_pw_qpolynomial_fold *upwf,
1412 __isl_take isl_union_pw_qpolynomial *upwqp)
1413 {
1414 upwf = isl_union_pw_qpolynomial_fold_align_params(upwf,
1415 isl_union_pw_qpolynomial_get_space(upwqp));
1416 upwqp = isl_union_pw_qpolynomial_align_params(upwqp,
1417 isl_union_pw_qpolynomial_fold_get_space(upwf));
1418
1419 upwf = isl_union_pw_qpolynomial_fold_cow(upwf);
1420 if (!upwf || !upwqp)
1421 goto error;
1422
1423 if (isl_union_pw_qpolynomial_foreach_pw_qpolynomial(upwqp, &add_pwqp,
1424 &upwf) < 0)
1425 goto error;
1426
1427 isl_union_pw_qpolynomial_free(upwqp);
1428
1429 return upwf;
1430 error:
1431 isl_union_pw_qpolynomial_fold_free(upwf);
1432 isl_union_pw_qpolynomial_free(upwqp);
1433 return NULL;
1434 }
1435
1436 static int join_compatible(__isl_keep isl_space *dim1, __isl_keep isl_space *dim2)
1437 {
1438 int m;
1439 m = isl_space_match(dim1, isl_dim_param, dim2, isl_dim_param);
1440 if (m < 0 || !m)
1441 return m;
1442 return isl_space_tuple_is_equal(dim1, isl_dim_out, dim2, isl_dim_in);
1443 }
1444
1445 /* Compute the intersection of the range of the map and the domain
1446 * of the piecewise quasipolynomial reduction and then compute a bound
1447 * on the associated quasipolynomial reduction over all elements
1448 * in this intersection.
1449 *
1450 * We first introduce some unconstrained dimensions in the
1451 * piecewise quasipolynomial, intersect the resulting domain
1452 * with the wrapped map and the compute the sum.
1453 */
1454 __isl_give isl_pw_qpolynomial_fold *isl_map_apply_pw_qpolynomial_fold(
1455 __isl_take isl_map *map, __isl_take isl_pw_qpolynomial_fold *pwf,
1456 int *tight)
1457 {
1458 isl_ctx *ctx;
1459 isl_set *dom;
1460 isl_space *map_dim;
1461 isl_space *pwf_dim;
1462 unsigned n_in;
1463 int ok;
1464
1465 ctx = isl_map_get_ctx(map);
1466 if (!ctx)
1467 goto error;
1468
1469 map_dim = isl_map_get_space(map);
1470 pwf_dim = isl_pw_qpolynomial_fold_get_space(pwf);
1471 ok = join_compatible(map_dim, pwf_dim);
1472 isl_space_free(map_dim);
1473 isl_space_free(pwf_dim);
1474 if (!ok)
1475 isl_die(ctx, isl_error_invalid, "incompatible dimensions",
1476 goto error);
1477
1478 n_in = isl_map_dim(map, isl_dim_in);
1479 pwf = isl_pw_qpolynomial_fold_insert_dims(pwf, isl_dim_in, 0, n_in);
1480
1481 dom = isl_map_wrap(map);
1482 pwf = isl_pw_qpolynomial_fold_reset_domain_space(pwf,
1483 isl_set_get_space(dom));
1484
1485 pwf = isl_pw_qpolynomial_fold_intersect_domain(pwf, dom);
1486 pwf = isl_pw_qpolynomial_fold_bound(pwf, tight);
1487
1488 return pwf;
1489 error:
1490 isl_map_free(map);
1491 isl_pw_qpolynomial_fold_free(pwf);
1492 return NULL;
1493 }
1494
1495 __isl_give isl_pw_qpolynomial_fold *isl_set_apply_pw_qpolynomial_fold(
1496 __isl_take isl_set *set, __isl_take isl_pw_qpolynomial_fold *pwf,
1497 int *tight)
1498 {
1499 return isl_map_apply_pw_qpolynomial_fold(set, pwf, tight);
1500 }
1501
1502 struct isl_apply_fold_data {
1503 isl_union_pw_qpolynomial_fold *upwf;
1504 isl_union_pw_qpolynomial_fold *res;
1505 isl_map *map;
1506 int tight;
1507 };
1508
1509 static int pw_qpolynomial_fold_apply(__isl_take isl_pw_qpolynomial_fold *pwf,
1510 void *user)
1511 {
1512 isl_space *map_dim;
1513 isl_space *pwf_dim;
1514 struct isl_apply_fold_data *data = user;
1515 int ok;
1516
1517 map_dim = isl_map_get_space(data->map);
1518 pwf_dim = isl_pw_qpolynomial_fold_get_space(pwf);
1519 ok = join_compatible(map_dim, pwf_dim);
1520 isl_space_free(map_dim);
1521 isl_space_free(pwf_dim);
1522
1523 if (ok) {
1524 pwf = isl_map_apply_pw_qpolynomial_fold(isl_map_copy(data->map),
1525 pwf, data->tight ? &data->tight : NULL);
1526 data->res = isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold(
1527 data->res, pwf);
1528 } else
1529 isl_pw_qpolynomial_fold_free(pwf);
1530
1531 return 0;
1532 }
1533
1534 static int map_apply(__isl_take isl_map *map, void *user)
1535 {
1536 struct isl_apply_fold_data *data = user;
1537 int r;
1538
1539 data->map = map;
1540 r = isl_union_pw_qpolynomial_fold_foreach_pw_qpolynomial_fold(
1541 data->upwf, &pw_qpolynomial_fold_apply, data);
1542
1543 isl_map_free(map);
1544 return r;
1545 }
1546
1547 __isl_give isl_union_pw_qpolynomial_fold *isl_union_map_apply_union_pw_qpolynomial_fold(
1548 __isl_take isl_union_map *umap,
1549 __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight)
1550 {
1551 isl_space *dim;
1552 enum isl_fold type;
1553 struct isl_apply_fold_data data;
1554
1555 upwf = isl_union_pw_qpolynomial_fold_align_params(upwf,
1556 isl_union_map_get_space(umap));
1557 umap = isl_union_map_align_params(umap,
1558 isl_union_pw_qpolynomial_fold_get_space(upwf));
1559
1560 data.upwf = upwf;
1561 data.tight = tight ? 1 : 0;
1562 dim = isl_union_pw_qpolynomial_fold_get_space(upwf);
1563 type = isl_union_pw_qpolynomial_fold_get_type(upwf);
1564 data.res = isl_union_pw_qpolynomial_fold_zero(dim, type);
1565 if (isl_union_map_foreach_map(umap, &map_apply, &data) < 0)
1566 goto error;
1567
1568 isl_union_map_free(umap);
1569 isl_union_pw_qpolynomial_fold_free(upwf);
1570
1571 if (tight)
1572 *tight = data.tight;
1573
1574 return data.res;
1575 error:
1576 isl_union_map_free(umap);
1577 isl_union_pw_qpolynomial_fold_free(upwf);
1578 isl_union_pw_qpolynomial_fold_free(data.res);
1579 return NULL;
1580 }
1581
1582 __isl_give isl_union_pw_qpolynomial_fold *isl_union_set_apply_union_pw_qpolynomial_fold(
1583 __isl_take isl_union_set *uset,
1584 __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight)
1585 {
1586 return isl_union_map_apply_union_pw_qpolynomial_fold(uset, upwf, tight);
1587 }
1588
1589 /* Reorder the dimension of "fold" according to the given reordering.
1590 */
1591 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_realign_domain(
1592 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_reordering *r)
1593 {
1594 int i;
1595
1596 fold = isl_qpolynomial_fold_cow(fold);
1597 if (!fold || !r)
1598 goto error;
1599
1600 for (i = 0; i < fold->n; ++i) {
1601 fold->qp[i] = isl_qpolynomial_realign_domain(fold->qp[i],
1602 isl_reordering_copy(r));
1603 if (!fold->qp[i])
1604 goto error;
1605 }
1606
1607 fold = isl_qpolynomial_fold_reset_domain_space(fold,
1608 isl_space_copy(r->dim));
1609
1610 isl_reordering_free(r);
1611
1612 return fold;
1613 error:
1614 isl_qpolynomial_fold_free(fold);
1615 isl_reordering_free(r);
1616 return NULL;
1617 }
1618
1619 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_mul_isl_int(
1620 __isl_take isl_qpolynomial_fold *fold, isl_int v)
1621 {
1622 int i;
1623
1624 if (isl_int_is_one(v))
1625 return fold;
1626 if (fold && isl_int_is_zero(v)) {
1627 isl_qpolynomial_fold *zero;
1628 isl_space *dim = isl_space_copy(fold->dim);
1629 zero = isl_qpolynomial_fold_empty(fold->type, dim);
1630 isl_qpolynomial_fold_free(fold);
1631 return zero;
1632 }
1633
1634 fold = isl_qpolynomial_fold_cow(fold);
1635 if (!fold)
1636 return NULL;
1637
1638 if (isl_int_is_neg(v))
1639 fold->type = isl_fold_type_negate(fold->type);
1640 for (i = 0; i < fold->n; ++i) {
1641 fold->qp[i] = isl_qpolynomial_mul_isl_int(fold->qp[i], v);
1642 if (!fold->qp[i])
1643 goto error;
1644 }
1645
1646 return fold;
1647 error:
1648 isl_qpolynomial_fold_free(fold);
1649 return NULL;
1650 }
1651
1652 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale(
1653 __isl_take isl_qpolynomial_fold *fold, isl_int v)
1654 {
1655 return isl_qpolynomial_fold_mul_isl_int(fold, v);
1656 }
1657
1658 /* Multiply "fold" by "v".
1659 */
1660 __isl_give isl_qpolynomial_fold *isl_qpolynomial_fold_scale_val(
1661 __isl_take isl_qpolynomial_fold *fold, __isl_take isl_val *v)
1662 {
1663 int i;
1664
1665 if (!fold || !v)
1666 goto error;
1667
1668 if (isl_val_is_one(v)) {
1669 isl_val_free(v);
1670 return fold;
1671 }
1672 if (isl_val_is_zero(v)) {
1673 isl_qpolynomial_fold *zero;
1674 isl_space *space = isl_qpolynomial_fold_get_domain_space(fold);
1675 zero = isl_qpolynomial_fold_empty(fold->type, space);
1676 isl_qpolynomial_fold_free(fold);
1677 isl_val_free(v);
1678 return zero;
1679 }
1680 if (!isl_val_is_rat(v))
1681 isl_die(isl_qpolynomial_fold_get_ctx(fold), isl_error_invalid,
1682 "expecting rational factor", goto error);
1683
1684 fold = isl_qpolynomial_fold_cow(fold);
1685 if (!fold)
1686 goto error;
1687
1688 if (isl_val_is_neg(v))
1689 fold->type = isl_fold_type_negate(fold->type);
1690 for (i = 0; i < fold->n; ++i) {
1691 fold->qp[i] = isl_qpolynomial_scale_val(fold->qp[i],
1692 isl_val_copy(v));
1693 if (!fold->qp[i])
1694 goto error;
1695 }
1696
1697 isl_val_free(v);
1698 return fold;
1699 error:
1700 isl_val_free(v);
1701 isl_qpolynomial_fold_free(fold);
1702 return NULL;
1703 }
Integer set library