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