isl_qpolynomial_move_dims: plug memory leak and fix reordering of divs
[isl.git] / isl_pw_templ.c
blob4a61e1a292c2068994a1855112aa4e226be3284a
1 #define xFN(TYPE,NAME) TYPE ## _ ## NAME
2 #define FN(TYPE,NAME) xFN(TYPE,NAME)
3 #define xS(TYPE,NAME) struct TYPE ## _ ## NAME
4 #define S(TYPE,NAME) xS(TYPE,NAME)
6 static __isl_give PW *FN(PW,alloc_)(__isl_take isl_dim *dim, int n)
8 struct PW *pw;
10 if (!dim)
11 return NULL;
12 isl_assert(dim->ctx, n >= 0, goto error);
13 pw = isl_alloc(dim->ctx, struct PW,
14 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
15 if (!pw)
16 goto error;
18 pw->ref = 1;
19 pw->size = n;
20 pw->n = 0;
21 pw->dim = dim;
22 return pw;
23 error:
24 isl_dim_free(dim);
25 return NULL;
28 __isl_give PW *FN(PW,zero)(__isl_take isl_dim *dim)
30 return FN(PW,alloc_)(dim, 0);
33 __isl_give PW *FN(PW,add_piece)(__isl_take PW *pw,
34 __isl_take isl_set *set, __isl_take EL *el)
36 if (!pw || !set || !el)
37 goto error;
39 if (isl_set_fast_is_empty(set) || FN(EL,IS_ZERO)(el)) {
40 isl_set_free(set);
41 FN(EL,free)(el);
42 return pw;
45 isl_assert(set->ctx, isl_dim_equal(pw->dim, el->dim), goto error);
46 isl_assert(set->ctx, pw->n < pw->size, goto error);
48 pw->p[pw->n].set = set;
49 pw->p[pw->n].FIELD = el;
50 pw->n++;
52 return pw;
53 error:
54 FN(PW,free)(pw);
55 isl_set_free(set);
56 FN(EL,free)(el);
57 return NULL;
60 __isl_give PW *FN(PW,alloc)(__isl_take isl_set *set, __isl_take EL *el)
62 PW *pw;
64 if (!set || !el)
65 goto error;
67 pw = FN(PW,alloc_)(isl_set_get_dim(set), 1);
69 return FN(PW,add_piece)(pw, set, el);
70 error:
71 isl_set_free(set);
72 FN(EL,free)(el);
73 return NULL;
76 __isl_give PW *FN(PW,dup)(__isl_keep PW *pw)
78 int i;
79 PW *dup;
81 if (!pw)
82 return NULL;
84 dup = FN(PW,alloc_)(isl_dim_copy(pw->dim), pw->n);
85 if (!dup)
86 return NULL;
88 for (i = 0; i < pw->n; ++i)
89 dup = FN(PW,add_piece)(dup, isl_set_copy(pw->p[i].set),
90 FN(EL,copy)(pw->p[i].FIELD));
92 return dup;
93 error:
94 FN(PW,free)(dup);
95 return NULL;
98 __isl_give PW *FN(PW,cow)(__isl_take PW *pw)
100 if (!pw)
101 return NULL;
103 if (pw->ref == 1)
104 return pw;
105 pw->ref--;
106 return FN(PW,dup)(pw);
109 __isl_give PW *FN(PW,copy)(__isl_keep PW *pw)
111 if (!pw)
112 return NULL;
114 pw->ref++;
115 return pw;
118 void FN(PW,free)(__isl_take PW *pw)
120 int i;
122 if (!pw)
123 return;
124 if (--pw->ref > 0)
125 return;
127 for (i = 0; i < pw->n; ++i) {
128 isl_set_free(pw->p[i].set);
129 FN(EL,free)(pw->p[i].FIELD);
131 isl_dim_free(pw->dim);
132 free(pw);
135 int FN(PW,is_zero)(__isl_keep PW *pw)
137 if (!pw)
138 return -1;
140 return pw->n == 0;
143 __isl_give PW *FN(PW,add)(__isl_take PW *pw1, __isl_take PW *pw2)
145 int i, j, n;
146 struct PW *res;
147 isl_set *set;
149 if (!pw1 || !pw2)
150 goto error;
152 isl_assert(pw1->dim->ctx, isl_dim_equal(pw1->dim, pw2->dim), goto error);
154 if (FN(PW,is_zero)(pw1)) {
155 FN(PW,free)(pw1);
156 return pw2;
159 if (FN(PW,is_zero)(pw2)) {
160 FN(PW,free)(pw2);
161 return pw1;
164 n = (pw1->n + 1) * (pw2->n + 1);
165 res = FN(PW,alloc_)(isl_dim_copy(pw1->dim), n);
167 for (i = 0; i < pw1->n; ++i) {
168 set = isl_set_copy(pw1->p[i].set);
169 for (j = 0; j < pw2->n; ++j) {
170 struct isl_set *common;
171 EL *sum;
172 set = isl_set_subtract(set,
173 isl_set_copy(pw2->p[j].set));
174 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
175 isl_set_copy(pw2->p[j].set));
176 if (isl_set_fast_is_empty(common)) {
177 isl_set_free(common);
178 continue;
181 sum = ADD(common, FN(EL,copy)(pw1->p[i].FIELD),
182 FN(EL,copy)(pw2->p[j].FIELD));
184 res = FN(PW,add_piece)(res, common, sum);
186 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD));
189 for (j = 0; j < pw2->n; ++j) {
190 set = isl_set_copy(pw2->p[j].set);
191 for (i = 0; i < pw1->n; ++i)
192 set = isl_set_subtract(set,
193 isl_set_copy(pw1->p[i].set));
194 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD));
197 FN(PW,free)(pw1);
198 FN(PW,free)(pw2);
200 return res;
201 error:
202 FN(PW,free)(pw1);
203 FN(PW,free)(pw2);
204 return NULL;
207 __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2)
209 int i;
210 PW *res;
212 if (!pw1 || !pw2)
213 goto error;
215 isl_assert(pw1->dim->ctx, isl_dim_equal(pw1->dim, pw2->dim), goto error);
217 if (FN(PW,is_zero)(pw1)) {
218 FN(PW,free)(pw1);
219 return pw2;
222 if (FN(PW,is_zero)(pw2)) {
223 FN(PW,free)(pw2);
224 return pw1;
227 res = FN(PW,alloc_)(isl_dim_copy(pw1->dim), pw1->n + pw2->n);
229 for (i = 0; i < pw1->n; ++i)
230 res = FN(PW,add_piece)(res,
231 isl_set_copy(pw1->p[i].set),
232 FN(EL,copy)(pw1->p[i].FIELD));
234 for (i = 0; i < pw2->n; ++i)
235 res = FN(PW,add_piece)(res,
236 isl_set_copy(pw2->p[i].set),
237 FN(EL,copy)(pw2->p[i].FIELD));
239 FN(PW,free)(pw1);
240 FN(PW,free)(pw2);
242 return res;
243 error:
244 FN(PW,free)(pw1);
245 FN(PW,free)(pw2);
246 return NULL;
249 __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw,
250 __isl_take isl_point *pnt)
252 int i;
253 int found = 0;
254 isl_qpolynomial *qp;
256 if (!pw || !pnt)
257 goto error;
258 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, pw->dim), goto error);
260 for (i = 0; i < pw->n; ++i) {
261 found = isl_set_contains_point(pw->p[i].set, pnt);
262 if (found < 0)
263 goto error;
264 if (found)
265 break;
267 if (found)
268 qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
269 isl_point_copy(pnt));
270 else
271 qp = isl_qpolynomial_zero(isl_dim_copy(pw->dim));
272 FN(PW,free)(pw);
273 isl_point_free(pnt);
274 return qp;
275 error:
276 FN(PW,free)(pw);
277 isl_point_free(pnt);
278 return NULL;
281 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
283 int i;
284 isl_set *dom;
286 if (!pw)
287 return NULL;
289 dom = isl_set_empty(isl_dim_copy(pw->dim));
290 for (i = 0; i < pw->n; ++i)
291 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
293 FN(PW,free)(pw);
295 return dom;
298 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw, __isl_take isl_set *set)
300 int i;
302 if (!pw || !set)
303 goto error;
305 if (pw->n == 0) {
306 isl_set_free(set);
307 return pw;
310 pw = FN(PW,cow)(pw);
311 if (!pw)
312 goto error;
314 for (i = pw->n - 1; i >= 0; --i) {
315 pw->p[i].set = isl_set_intersect(pw->p[i].set, isl_set_copy(set));
316 if (!pw->p[i].set)
317 goto error;
318 if (isl_set_fast_is_empty(pw->p[i].set)) {
319 isl_set_free(pw->p[i].set);
320 FN(EL,free)(pw->p[i].FIELD);
321 if (i != pw->n - 1)
322 pw->p[i] = pw->p[pw->n - 1];
323 pw->n--;
327 isl_set_free(set);
328 return pw;
329 error:
330 isl_set_free(set);
331 FN(PW,free)(pw);
332 return NULL;
335 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
337 int i;
338 isl_basic_set *hull = NULL;
340 if (!pw || !context)
341 goto error;
343 if (pw->n == 0) {
344 isl_set_free(context);
345 return pw;
348 hull = isl_set_simple_hull(isl_set_copy(context));
350 pw = FN(PW,cow)(pw);
351 if (!pw)
352 goto error;
354 for (i = 0; i < pw->n; ++i) {
355 pw->p[i].set = isl_set_gist_basic_set(pw->p[i].set,
356 isl_basic_set_copy(hull));
357 if (!pw->p[i].set)
358 goto error;
361 isl_basic_set_free(hull);
362 isl_set_free(context);
364 return pw;
365 error:
366 FN(PW,free)(pw);
367 isl_basic_set_free(hull);
368 isl_set_free(context);
369 return NULL;
372 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
374 int i, j;
376 if (!pw)
377 return NULL;
378 if (pw->n == 0)
379 return pw;
381 for (i = pw->n - 1; i >= 0; --i) {
382 for (j = i - 1; j >= 0; --j) {
383 if (!FN(EL,is_equal)(pw->p[i].FIELD, pw->p[j].FIELD))
384 continue;
385 pw->p[j].set = isl_set_union(pw->p[j].set,
386 pw->p[i].set);
387 FN(EL,free)(pw->p[i].FIELD);
388 if (i != pw->n - 1)
389 pw->p[i] = pw->p[pw->n - 1];
390 pw->n--;
391 break;
393 if (j >= 0)
394 continue;
395 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
396 if (!pw->p[i].set)
397 goto error;
400 return pw;
401 error:
402 FN(PW,free)(pw);
403 return NULL;
406 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
408 return pw ? pw->dim->ctx : NULL;
411 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
412 unsigned first, unsigned n)
414 int i;
416 if (!pw)
417 return -1;
418 if (pw->n == 0 || n == 0)
419 return 0;
420 for (i = 0; i < pw->n; ++i) {
421 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
422 type, first, n);
423 if (involves < 0 || involves)
424 return involves;
426 return 0;
429 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
430 enum isl_dim_type type, unsigned first, unsigned n)
432 int i;
434 if (!pw)
435 return NULL;
436 if (n == 0 && !isl_dim_get_tuple_name(pw->dim, type))
437 return pw;
439 pw = FN(PW,cow)(pw);
440 if (!pw)
441 return NULL;
442 pw->dim = isl_dim_drop(pw->dim, type, first, n);
443 if (!pw->dim)
444 goto error;
445 for (i = 0; i < pw->n; ++i) {
446 pw->p[i].set = isl_set_drop(pw->p[i].set, type, first, n);
447 if (!pw->p[i].set)
448 goto error;
449 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
450 if (!pw->p[i].FIELD)
451 goto error;
454 return pw;
455 error:
456 FN(PW,free)(pw);
457 return NULL;
460 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
461 enum isl_dim_type type, unsigned pos, isl_int v)
463 int i;
465 if (!pw)
466 return NULL;
468 pw = FN(PW,cow)(pw);
469 if (!pw)
470 return NULL;
471 for (i = 0; i < pw->n; ++i) {
472 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
473 if (!pw->p[i].set)
474 goto error;
477 return pw;
478 error:
479 FN(PW,free)(pw);
480 return NULL;
483 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
485 return pw ? isl_dim_size(pw->dim, type) : 0;
488 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
489 enum isl_dim_type type, unsigned first, unsigned n)
491 int i;
493 if (!pw)
494 return NULL;
495 if (n == 0)
496 return pw;
498 pw = FN(PW,cow)(pw);
499 if (!pw)
500 return NULL;
501 if (!pw->dim)
502 goto error;
503 for (i = 0; i < pw->n; ++i) {
504 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
505 if (!pw->p[i].set)
506 goto error;
509 return pw;
510 error:
511 FN(PW,free)(pw);
512 return NULL;
515 /* Compute the maximal value attained by the piecewise quasipolynomial
516 * on its domain or zero if the domain is empty.
517 * In the worst case, the domain is scanned completely,
518 * so the domain is assumed to be bounded.
520 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
522 int i;
523 isl_qpolynomial *opt;
525 if (!pw)
526 return NULL;
528 if (pw->n == 0) {
529 isl_dim *dim = isl_dim_copy(pw->dim);
530 FN(PW,free)(pw);
531 return isl_qpolynomial_zero(dim);
534 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
535 isl_set_copy(pw->p[0].set), max);
536 for (i = 1; i < pw->n; ++i) {
537 isl_qpolynomial *opt_i;
538 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
539 isl_set_copy(pw->p[i].set), max);
540 if (max)
541 opt = isl_qpolynomial_max_cst(opt, opt_i);
542 else
543 opt = isl_qpolynomial_min_cst(opt, opt_i);
546 FN(PW,free)(pw);
547 return opt;
550 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
552 return FN(PW,opt)(pw, 1);
555 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
557 return FN(PW,opt)(pw, 0);
560 __isl_give isl_dim *FN(PW,get_dim)(__isl_keep PW *pw)
562 return pw ? isl_dim_copy(pw->dim) : NULL;
565 __isl_give PW *FN(PW,reset_dim)(__isl_take PW *pw, __isl_take isl_dim *dim)
567 int i;
569 pw = FN(PW,cow)(pw);
570 if (!pw || !dim)
571 goto error;
573 for (i = 0; i < pw->n; ++i) {
574 pw->p[i].set = isl_set_reset_dim(pw->p[i].set,
575 isl_dim_copy(dim));
576 if (!pw->p[i].set)
577 goto error;
578 pw->p[i].FIELD = FN(EL,reset_dim)(pw->p[i].FIELD,
579 isl_dim_copy(dim));
580 if (!pw->p[i].FIELD)
581 goto error;
583 isl_dim_free(pw->dim);
584 pw->dim = dim;
586 return pw;
587 error:
588 isl_dim_free(dim);
589 FN(PW,free)(pw);
590 return NULL;
593 int FN(PW,has_equal_dim)(__isl_keep PW *pw1, __isl_keep PW *pw2)
595 if (!pw1 || !pw2)
596 return -1;
598 return isl_dim_equal(pw1->dim, pw2->dim);
601 __isl_give PW *FN(PW,morph)(__isl_take PW *pw, __isl_take isl_morph *morph)
603 int i;
605 if (!pw || !morph)
606 goto error;
608 isl_assert(pw->dim->ctx, isl_dim_equal(pw->dim, morph->dom->dim),
609 goto error);
611 pw = FN(PW,cow)(pw);
612 if (!pw)
613 goto error;
614 isl_dim_free(pw->dim);
615 pw->dim = isl_dim_copy(morph->ran->dim);
616 if (!pw->dim)
617 goto error;
619 for (i = 0; i < pw->n; ++i) {
620 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
621 if (!pw->p[i].set)
622 goto error;
623 pw->p[i].FIELD = FN(EL,morph)(pw->p[i].FIELD,
624 isl_morph_copy(morph));
625 if (!pw->p[i].FIELD)
626 goto error;
629 isl_morph_free(morph);
631 return pw;
632 error:
633 FN(PW,free)(pw);
634 isl_morph_free(morph);
635 return NULL;
638 int FN(PW,foreach_piece)(__isl_keep PW *pw,
639 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
640 void *user)
642 int i;
644 if (!pw)
645 return -1;
647 for (i = 0; i < pw->n; ++i)
648 if (fn(isl_set_copy(pw->p[i].set),
649 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
650 return -1;
652 return 0;
655 static int any_divs(__isl_keep isl_set *set)
657 int i;
659 if (!set)
660 return -1;
662 for (i = 0; i < set->n; ++i)
663 if (set->p[i]->n_div > 0)
664 return 1;
666 return 0;
669 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
670 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
671 void *user), void *user)
673 int i;
675 if (!set || !el)
676 goto error;
678 for (i = 0; i < set->n; ++i) {
679 isl_set *lift;
680 EL *copy;
682 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
683 lift = isl_set_lift(lift);
685 copy = FN(EL,copy)(el);
686 copy = FN(EL,lift)(copy, isl_set_get_dim(lift));
688 if (fn(lift, copy, user) < 0)
689 goto error;
692 isl_set_free(set);
693 FN(EL,free)(el);
695 return 0;
696 error:
697 isl_set_free(set);
698 FN(EL,free)(el);
699 return -1;
702 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
703 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
704 void *user), void *user)
706 int i;
708 if (!pw)
709 return -1;
711 for (i = 0; i < pw->n; ++i) {
712 isl_set *set;
713 EL *el;
715 set = isl_set_copy(pw->p[i].set);
716 el = FN(EL,copy)(pw->p[i].FIELD);
717 if (!any_divs(set)) {
718 if (fn(set, el, user) < 0)
719 return -1;
720 continue;
722 if (foreach_lifted_subset(set, el, fn, user) < 0)
723 return -1;
726 return 0;
729 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
730 enum isl_dim_type dst_type, unsigned dst_pos,
731 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
733 int i;
735 pw = FN(PW,cow)(pw);
736 if (!pw)
737 return NULL;
739 pw->dim = isl_dim_move(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
740 if (!pw->dim)
741 goto error;
743 for (i = 0; i < pw->n; ++i) {
744 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
745 dst_type, dst_pos,
746 src_type, src_pos, n);
747 if (!pw->p[i].set)
748 goto error;
749 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
750 dst_type, dst_pos, src_type, src_pos, n);
751 if (!pw->p[i].FIELD)
752 goto error;
755 return pw;
756 error:
757 FN(PW,free)(pw);
758 return NULL;