?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
fix isl_union_{set,map}_lex_g{e,t}_union_map
[isl.git] / isl_pw_templ.c
bloba3cce71b3453ef71593b21b00086c0dd3b17d150
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)
5
6 #ifdef HAS_TYPE
7 static __isl_give PW *FN(PW,alloc_)(__isl_take isl_dim *dim,
8 enum isl_fold type, int n)
9 #else
10 static __isl_give PW *FN(PW,alloc_)(__isl_take isl_dim *dim, int n)
11 #endif
12 {
13 struct PW *pw;
14
15 if (!dim)
16 return NULL;
17 isl_assert(dim->ctx, n >= 0, goto error);
18 pw = isl_alloc(dim->ctx, struct PW,
19 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
20 if (!pw)
21 goto error;
22
23 pw->ref = 1;
24 #ifdef HAS_TYPE
25 pw->type = type;
26 #endif
27 pw->size = n;
28 pw->n = 0;
29 pw->dim = dim;
30 return pw;
31 error:
32 isl_dim_free(dim);
33 return NULL;
34 }
35
36 #ifdef HAS_TYPE
37 __isl_give PW *FN(PW,zero)(__isl_take isl_dim *dim, enum isl_fold type)
38 {
39 return FN(PW,alloc_)(dim, type, 0);
40 }
41 #else
42 __isl_give PW *FN(PW,zero)(__isl_take isl_dim *dim)
43 {
44 return FN(PW,alloc_)(dim, 0);
45 }
46 #endif
47
48 __isl_give PW *FN(PW,add_piece)(__isl_take PW *pw,
49 __isl_take isl_set *set, __isl_take EL *el)
50 {
51 if (!pw || !set || !el)
52 goto error;
53
54 if (isl_set_fast_is_empty(set) || FN(EL,IS_ZERO)(el)) {
55 isl_set_free(set);
56 FN(EL,free)(el);
57 return pw;
58 }
59
60 #ifdef HAS_TYPE
61 if (pw->type != el->type)
62 isl_die(set->ctx, isl_error_invalid, "fold types don't match",
63 goto error);
64 #endif
65 isl_assert(set->ctx, isl_dim_equal(pw->dim, el->dim), goto error);
66 isl_assert(set->ctx, pw->n < pw->size, goto error);
67
68 pw->p[pw->n].set = set;
69 pw->p[pw->n].FIELD = el;
70 pw->n++;
71
72 return pw;
73 error:
74 FN(PW,free)(pw);
75 isl_set_free(set);
76 FN(EL,free)(el);
77 return NULL;
78 }
79
80 #ifdef HAS_TYPE
81 __isl_give PW *FN(PW,alloc)(enum isl_fold type,
82 __isl_take isl_set *set, __isl_take EL *el)
83 #else
84 __isl_give PW *FN(PW,alloc)(__isl_take isl_set *set, __isl_take EL *el)
85 #endif
86 {
87 PW *pw;
88
89 if (!set || !el)
90 goto error;
91
92 #ifdef HAS_TYPE
93 pw = FN(PW,alloc_)(isl_set_get_dim(set), type, 1);
94 #else
95 pw = FN(PW,alloc_)(isl_set_get_dim(set), 1);
96 #endif
97
98 return FN(PW,add_piece)(pw, set, el);
99 error:
100 isl_set_free(set);
101 FN(EL,free)(el);
102 return NULL;
103 }
104
105 __isl_give PW *FN(PW,dup)(__isl_keep PW *pw)
106 {
107 int i;
108 PW *dup;
109
110 if (!pw)
111 return NULL;
112
113 #ifdef HAS_TYPE
114 dup = FN(PW,alloc_)(isl_dim_copy(pw->dim), pw->type, pw->n);
115 #else
116 dup = FN(PW,alloc_)(isl_dim_copy(pw->dim), pw->n);
117 #endif
118 if (!dup)
119 return NULL;
120
121 for (i = 0; i < pw->n; ++i)
122 dup = FN(PW,add_piece)(dup, isl_set_copy(pw->p[i].set),
123 FN(EL,copy)(pw->p[i].FIELD));
124
125 return dup;
126 error:
127 FN(PW,free)(dup);
128 return NULL;
129 }
130
131 __isl_give PW *FN(PW,cow)(__isl_take PW *pw)
132 {
133 if (!pw)
134 return NULL;
135
136 if (pw->ref == 1)
137 return pw;
138 pw->ref--;
139 return FN(PW,dup)(pw);
140 }
141
142 __isl_give PW *FN(PW,copy)(__isl_keep PW *pw)
143 {
144 if (!pw)
145 return NULL;
146
147 pw->ref++;
148 return pw;
149 }
150
151 void FN(PW,free)(__isl_take PW *pw)
152 {
153 int i;
154
155 if (!pw)
156 return;
157 if (--pw->ref > 0)
158 return;
159
160 for (i = 0; i < pw->n; ++i) {
161 isl_set_free(pw->p[i].set);
162 FN(EL,free)(pw->p[i].FIELD);
163 }
164 isl_dim_free(pw->dim);
165 free(pw);
166 }
167
168 int FN(PW,is_zero)(__isl_keep PW *pw)
169 {
170 if (!pw)
171 return -1;
172
173 return pw->n == 0;
174 }
175
176 __isl_give PW *FN(PW,add)(__isl_take PW *pw1, __isl_take PW *pw2)
177 {
178 int i, j, n;
179 struct PW *res;
180 isl_set *set;
181
182 if (!pw1 || !pw2)
183 goto error;
184
185 #ifdef HAS_TYPE
186 if (pw1->type != pw2->type)
187 isl_die(pw1->dim->ctx, isl_error_invalid,
188 "fold types don't match", goto error);
189 #endif
190 isl_assert(pw1->dim->ctx, isl_dim_equal(pw1->dim, pw2->dim), goto error);
191
192 if (FN(PW,is_zero)(pw1)) {
193 FN(PW,free)(pw1);
194 return pw2;
195 }
196
197 if (FN(PW,is_zero)(pw2)) {
198 FN(PW,free)(pw2);
199 return pw1;
200 }
201
202 n = (pw1->n + 1) * (pw2->n + 1);
203 #ifdef HAS_TYPE
204 res = FN(PW,alloc_)(isl_dim_copy(pw1->dim), pw1->type, n);
205 #else
206 res = FN(PW,alloc_)(isl_dim_copy(pw1->dim), n);
207 #endif
208
209 for (i = 0; i < pw1->n; ++i) {
210 set = isl_set_copy(pw1->p[i].set);
211 for (j = 0; j < pw2->n; ++j) {
212 struct isl_set *common;
213 EL *sum;
214 set = isl_set_subtract(set,
215 isl_set_copy(pw2->p[j].set));
216 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
217 isl_set_copy(pw2->p[j].set));
218 if (isl_set_fast_is_empty(common)) {
219 isl_set_free(common);
220 continue;
221 }
222
223 sum = FN(EL,add_on_domain)(common,
224 FN(EL,copy)(pw1->p[i].FIELD),
225 FN(EL,copy)(pw2->p[j].FIELD));
226
227 res = FN(PW,add_piece)(res, common, sum);
228 }
229 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD));
230 }
231
232 for (j = 0; j < pw2->n; ++j) {
233 set = isl_set_copy(pw2->p[j].set);
234 for (i = 0; i < pw1->n; ++i)
235 set = isl_set_subtract(set,
236 isl_set_copy(pw1->p[i].set));
237 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD));
238 }
239
240 FN(PW,free)(pw1);
241 FN(PW,free)(pw2);
242
243 return res;
244 error:
245 FN(PW,free)(pw1);
246 FN(PW,free)(pw2);
247 return NULL;
248 }
249
250 __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2)
251 {
252 int i;
253 PW *res;
254
255 if (!pw1 || !pw2)
256 goto error;
257
258 #ifdef HAS_TYPE
259 if (pw1->type != pw2->type)
260 isl_die(pw1->dim->ctx, isl_error_invalid,
261 "fold types don't match", goto error);
262 #endif
263 isl_assert(pw1->dim->ctx, isl_dim_equal(pw1->dim, pw2->dim), goto error);
264
265 if (FN(PW,is_zero)(pw1)) {
266 FN(PW,free)(pw1);
267 return pw2;
268 }
269
270 if (FN(PW,is_zero)(pw2)) {
271 FN(PW,free)(pw2);
272 return pw1;
273 }
274
275 #ifdef HAS_TYPE
276 res = FN(PW,alloc_)(isl_dim_copy(pw1->dim), pw1->type, pw1->n + pw2->n);
277 #else
278 res = FN(PW,alloc_)(isl_dim_copy(pw1->dim), pw1->n + pw2->n);
279 #endif
280
281 for (i = 0; i < pw1->n; ++i)
282 res = FN(PW,add_piece)(res,
283 isl_set_copy(pw1->p[i].set),
284 FN(EL,copy)(pw1->p[i].FIELD));
285
286 for (i = 0; i < pw2->n; ++i)
287 res = FN(PW,add_piece)(res,
288 isl_set_copy(pw2->p[i].set),
289 FN(EL,copy)(pw2->p[i].FIELD));
290
291 FN(PW,free)(pw1);
292 FN(PW,free)(pw2);
293
294 return res;
295 error:
296 FN(PW,free)(pw1);
297 FN(PW,free)(pw2);
298 return NULL;
299 }
300
301 __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw,
302 __isl_take isl_point *pnt)
303 {
304 int i;
305 int found = 0;
306 isl_qpolynomial *qp;
307
308 if (!pw || !pnt)
309 goto error;
310 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, pw->dim), goto error);
311
312 for (i = 0; i < pw->n; ++i) {
313 found = isl_set_contains_point(pw->p[i].set, pnt);
314 if (found < 0)
315 goto error;
316 if (found)
317 break;
318 }
319 if (found)
320 qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
321 isl_point_copy(pnt));
322 else
323 qp = isl_qpolynomial_zero(isl_dim_copy(pw->dim));
324 FN(PW,free)(pw);
325 isl_point_free(pnt);
326 return qp;
327 error:
328 FN(PW,free)(pw);
329 isl_point_free(pnt);
330 return NULL;
331 }
332
333 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
334 {
335 int i;
336 isl_set *dom;
337
338 if (!pw)
339 return NULL;
340
341 dom = isl_set_empty(isl_dim_copy(pw->dim));
342 for (i = 0; i < pw->n; ++i)
343 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
344
345 FN(PW,free)(pw);
346
347 return dom;
348 }
349
350 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw, __isl_take isl_set *set)
351 {
352 int i;
353
354 if (!pw || !set)
355 goto error;
356
357 if (pw->n == 0) {
358 isl_set_free(set);
359 return pw;
360 }
361
362 pw = FN(PW,cow)(pw);
363 if (!pw)
364 goto error;
365
366 for (i = pw->n - 1; i >= 0; --i) {
367 isl_basic_set *aff;
368 pw->p[i].set = isl_set_intersect(pw->p[i].set, isl_set_copy(set));
369 if (!pw->p[i].set)
370 goto error;
371 aff = isl_set_affine_hull(isl_set_copy(pw->p[i].set));
372 pw->p[i].FIELD = FN(EL,substitute_equalities)(pw->p[i].FIELD,
373 aff);
374 if (isl_set_fast_is_empty(pw->p[i].set)) {
375 isl_set_free(pw->p[i].set);
376 FN(EL,free)(pw->p[i].FIELD);
377 if (i != pw->n - 1)
378 pw->p[i] = pw->p[pw->n - 1];
379 pw->n--;
380 }
381 }
382
383 isl_set_free(set);
384 return pw;
385 error:
386 isl_set_free(set);
387 FN(PW,free)(pw);
388 return NULL;
389 }
390
391 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
392 {
393 int i;
394 isl_basic_set *hull = NULL;
395
396 if (!pw || !context)
397 goto error;
398
399 if (pw->n == 0) {
400 isl_set_free(context);
401 return pw;
402 }
403
404 context = isl_set_compute_divs(context);
405 hull = isl_set_simple_hull(isl_set_copy(context));
406
407 pw = FN(PW,cow)(pw);
408 if (!pw)
409 goto error;
410
411 for (i = 0; i < pw->n; ++i) {
412 pw->p[i].set = isl_set_gist_basic_set(pw->p[i].set,
413 isl_basic_set_copy(hull));
414 if (!pw->p[i].set)
415 goto error;
416 }
417
418 isl_basic_set_free(hull);
419 isl_set_free(context);
420
421 return pw;
422 error:
423 FN(PW,free)(pw);
424 isl_basic_set_free(hull);
425 isl_set_free(context);
426 return NULL;
427 }
428
429 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
430 {
431 int i, j;
432
433 if (!pw)
434 return NULL;
435 if (pw->n == 0)
436 return pw;
437
438 for (i = pw->n - 1; i >= 0; --i) {
439 for (j = i - 1; j >= 0; --j) {
440 if (!FN(EL,is_equal)(pw->p[i].FIELD, pw->p[j].FIELD))
441 continue;
442 pw->p[j].set = isl_set_union(pw->p[j].set,
443 pw->p[i].set);
444 FN(EL,free)(pw->p[i].FIELD);
445 if (i != pw->n - 1)
446 pw->p[i] = pw->p[pw->n - 1];
447 pw->n--;
448 break;
449 }
450 if (j >= 0)
451 continue;
452 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
453 if (!pw->p[i].set)
454 goto error;
455 }
456
457 return pw;
458 error:
459 FN(PW,free)(pw);
460 return NULL;
461 }
462
463 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
464 {
465 return pw ? pw->dim->ctx : NULL;
466 }
467
468 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
469 unsigned first, unsigned n)
470 {
471 int i;
472
473 if (!pw)
474 return -1;
475 if (pw->n == 0 || n == 0)
476 return 0;
477 for (i = 0; i < pw->n; ++i) {
478 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
479 type, first, n);
480 if (involves < 0 || involves)
481 return involves;
482 }
483 return 0;
484 }
485
486 __isl_give PW *FN(PW,set_dim_name)(__isl_take PW *pw,
487 enum isl_dim_type type, unsigned pos, const char *s)
488 {
489 int i;
490
491 pw = FN(PW,cow)(pw);
492 if (!pw)
493 return NULL;
494
495 pw->dim = isl_dim_set_name(pw->dim, type, pos, s);
496 if (!pw->dim)
497 goto error;
498
499 for (i = 0; i < pw->n; ++i) {
500 pw->p[i].set = isl_set_set_dim_name(pw->p[i].set, type, pos, s);
501 if (!pw->p[i].set)
502 goto error;
503 pw->p[i].FIELD = FN(EL,set_dim_name)(pw->p[i].FIELD, type, pos, s);
504 if (!pw->p[i].FIELD)
505 goto error;
506 }
507
508 return pw;
509 error:
510 FN(PW,free)(pw);
511 return NULL;
512 }
513
514 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
515 enum isl_dim_type type, unsigned first, unsigned n)
516 {
517 int i;
518
519 if (!pw)
520 return NULL;
521 if (n == 0 && !isl_dim_get_tuple_name(pw->dim, type))
522 return pw;
523
524 pw = FN(PW,cow)(pw);
525 if (!pw)
526 return NULL;
527 pw->dim = isl_dim_drop(pw->dim, type, first, n);
528 if (!pw->dim)
529 goto error;
530 for (i = 0; i < pw->n; ++i) {
531 pw->p[i].set = isl_set_drop(pw->p[i].set, type, first, n);
532 if (!pw->p[i].set)
533 goto error;
534 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
535 if (!pw->p[i].FIELD)
536 goto error;
537 }
538
539 return pw;
540 error:
541 FN(PW,free)(pw);
542 return NULL;
543 }
544
545 __isl_give PW *FN(PW,insert_dims)(__isl_take PW *pw, enum isl_dim_type type,
546 unsigned first, unsigned n)
547 {
548 int i;
549
550 if (!pw)
551 return NULL;
552 if (n == 0 && !isl_dim_is_named_or_nested(pw->dim, type))
553 return pw;
554
555 pw = FN(PW,cow)(pw);
556 if (!pw)
557 return NULL;
558
559 pw->dim = isl_dim_insert(pw->dim, type, first, n);
560 if (!pw->dim)
561 goto error;
562
563 for (i = 0; i < pw->n; ++i) {
564 pw->p[i].set = isl_set_insert(pw->p[i].set, type, first, n);
565 if (!pw->p[i].set)
566 goto error;
567 pw->p[i].FIELD = FN(EL,insert_dims)(pw->p[i].FIELD,
568 type, first, n);
569 if (!pw->p[i].FIELD)
570 goto error;
571 }
572
573 return pw;
574 error:
575 FN(PW,free)(pw);
576 return NULL;
577 }
578
579 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
580 enum isl_dim_type type, unsigned pos, isl_int v)
581 {
582 int i;
583
584 if (!pw)
585 return NULL;
586
587 pw = FN(PW,cow)(pw);
588 if (!pw)
589 return NULL;
590 for (i = 0; i < pw->n; ++i) {
591 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
592 if (!pw->p[i].set)
593 goto error;
594 }
595
596 return pw;
597 error:
598 FN(PW,free)(pw);
599 return NULL;
600 }
601
602 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
603 {
604 return pw ? isl_dim_size(pw->dim, type) : 0;
605 }
606
607 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
608 enum isl_dim_type type, unsigned first, unsigned n)
609 {
610 int i;
611
612 if (!pw)
613 return NULL;
614 if (n == 0)
615 return pw;
616
617 pw = FN(PW,cow)(pw);
618 if (!pw)
619 return NULL;
620 if (!pw->dim)
621 goto error;
622 for (i = 0; i < pw->n; ++i) {
623 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
624 if (!pw->p[i].set)
625 goto error;
626 }
627
628 return pw;
629 error:
630 FN(PW,free)(pw);
631 return NULL;
632 }
633
634 /* Compute the maximal value attained by the piecewise quasipolynomial
635 * on its domain or zero if the domain is empty.
636 * In the worst case, the domain is scanned completely,
637 * so the domain is assumed to be bounded.
638 */
639 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
640 {
641 int i;
642 isl_qpolynomial *opt;
643
644 if (!pw)
645 return NULL;
646
647 if (pw->n == 0) {
648 isl_dim *dim = isl_dim_copy(pw->dim);
649 FN(PW,free)(pw);
650 return isl_qpolynomial_zero(dim);
651 }
652
653 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
654 isl_set_copy(pw->p[0].set), max);
655 for (i = 1; i < pw->n; ++i) {
656 isl_qpolynomial *opt_i;
657 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
658 isl_set_copy(pw->p[i].set), max);
659 if (max)
660 opt = isl_qpolynomial_max_cst(opt, opt_i);
661 else
662 opt = isl_qpolynomial_min_cst(opt, opt_i);
663 }
664
665 FN(PW,free)(pw);
666 return opt;
667 }
668
669 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
670 {
671 return FN(PW,opt)(pw, 1);
672 }
673
674 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
675 {
676 return FN(PW,opt)(pw, 0);
677 }
678
679 __isl_give isl_dim *FN(PW,get_dim)(__isl_keep PW *pw)
680 {
681 return pw ? isl_dim_copy(pw->dim) : NULL;
682 }
683
684 __isl_give PW *FN(PW,reset_dim)(__isl_take PW *pw, __isl_take isl_dim *dim)
685 {
686 int i;
687
688 pw = FN(PW,cow)(pw);
689 if (!pw || !dim)
690 goto error;
691
692 for (i = 0; i < pw->n; ++i) {
693 pw->p[i].set = isl_set_reset_dim(pw->p[i].set,
694 isl_dim_copy(dim));
695 if (!pw->p[i].set)
696 goto error;
697 pw->p[i].FIELD = FN(EL,reset_dim)(pw->p[i].FIELD,
698 isl_dim_copy(dim));
699 if (!pw->p[i].FIELD)
700 goto error;
701 }
702 isl_dim_free(pw->dim);
703 pw->dim = dim;
704
705 return pw;
706 error:
707 isl_dim_free(dim);
708 FN(PW,free)(pw);
709 return NULL;
710 }
711
712 int FN(PW,has_equal_dim)(__isl_keep PW *pw1, __isl_keep PW *pw2)
713 {
714 if (!pw1 || !pw2)
715 return -1;
716
717 return isl_dim_equal(pw1->dim, pw2->dim);
718 }
719
720 __isl_give PW *FN(PW,morph)(__isl_take PW *pw, __isl_take isl_morph *morph)
721 {
722 int i;
723
724 if (!pw || !morph)
725 goto error;
726
727 isl_assert(pw->dim->ctx, isl_dim_equal(pw->dim, morph->dom->dim),
728 goto error);
729
730 pw = FN(PW,cow)(pw);
731 if (!pw)
732 goto error;
733 isl_dim_free(pw->dim);
734 pw->dim = isl_dim_copy(morph->ran->dim);
735 if (!pw->dim)
736 goto error;
737
738 for (i = 0; i < pw->n; ++i) {
739 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
740 if (!pw->p[i].set)
741 goto error;
742 pw->p[i].FIELD = FN(EL,morph)(pw->p[i].FIELD,
743 isl_morph_copy(morph));
744 if (!pw->p[i].FIELD)
745 goto error;
746 }
747
748 isl_morph_free(morph);
749
750 return pw;
751 error:
752 FN(PW,free)(pw);
753 isl_morph_free(morph);
754 return NULL;
755 }
756
757 int FN(PW,foreach_piece)(__isl_keep PW *pw,
758 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
759 void *user)
760 {
761 int i;
762
763 if (!pw)
764 return -1;
765
766 for (i = 0; i < pw->n; ++i)
767 if (fn(isl_set_copy(pw->p[i].set),
768 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
769 return -1;
770
771 return 0;
772 }
773
774 static int any_divs(__isl_keep isl_set *set)
775 {
776 int i;
777
778 if (!set)
779 return -1;
780
781 for (i = 0; i < set->n; ++i)
782 if (set->p[i]->n_div > 0)
783 return 1;
784
785 return 0;
786 }
787
788 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
789 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
790 void *user), void *user)
791 {
792 int i;
793
794 if (!set || !el)
795 goto error;
796
797 for (i = 0; i < set->n; ++i) {
798 isl_set *lift;
799 EL *copy;
800
801 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
802 lift = isl_set_lift(lift);
803
804 copy = FN(EL,copy)(el);
805 copy = FN(EL,lift)(copy, isl_set_get_dim(lift));
806
807 if (fn(lift, copy, user) < 0)
808 goto error;
809 }
810
811 isl_set_free(set);
812 FN(EL,free)(el);
813
814 return 0;
815 error:
816 isl_set_free(set);
817 FN(EL,free)(el);
818 return -1;
819 }
820
821 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
822 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
823 void *user), void *user)
824 {
825 int i;
826
827 if (!pw)
828 return -1;
829
830 for (i = 0; i < pw->n; ++i) {
831 isl_set *set;
832 EL *el;
833
834 set = isl_set_copy(pw->p[i].set);
835 el = FN(EL,copy)(pw->p[i].FIELD);
836 if (!any_divs(set)) {
837 if (fn(set, el, user) < 0)
838 return -1;
839 continue;
840 }
841 if (foreach_lifted_subset(set, el, fn, user) < 0)
842 return -1;
843 }
844
845 return 0;
846 }
847
848 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
849 enum isl_dim_type dst_type, unsigned dst_pos,
850 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
851 {
852 int i;
853
854 pw = FN(PW,cow)(pw);
855 if (!pw)
856 return NULL;
857
858 pw->dim = isl_dim_move(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
859 if (!pw->dim)
860 goto error;
861
862 for (i = 0; i < pw->n; ++i) {
863 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
864 dst_type, dst_pos,
865 src_type, src_pos, n);
866 if (!pw->p[i].set)
867 goto error;
868 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
869 dst_type, dst_pos, src_type, src_pos, n);
870 if (!pw->p[i].FIELD)
871 goto error;
872 }
873
874 return pw;
875 error:
876 FN(PW,free)(pw);
877 return NULL;
878 }
879
880 __isl_give PW *FN(PW,realign)(__isl_take PW *pw, __isl_take isl_reordering *exp)
881 {
882 int i;
883
884 pw = FN(PW,cow)(pw);
885 if (!pw || !exp)
886 return NULL;
887
888 for (i = 0; i < pw->n; ++i) {
889 pw->p[i].set = isl_set_realign(pw->p[i].set,
890 isl_reordering_copy(exp));
891 if (!pw->p[i].set)
892 goto error;
893 pw->p[i].FIELD = FN(EL,realign)(pw->p[i].FIELD,
894 isl_reordering_copy(exp));
895 if (!pw->p[i].FIELD)
896 goto error;
897 }
898
899 pw = FN(PW,reset_dim)(pw, isl_dim_copy(exp->dim));
900
901 isl_reordering_free(exp);
902 return pw;
903 error:
904 isl_reordering_free(exp);
905 FN(PW,free)(pw);
906 return NULL;
907 }
Integer set library