?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
add isl_constraint_get_ctx
[isl.git] / isl_pw_templ.c
blobda4b53e5ec2a13445b4b7bb170a66f18ca7775e9
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 = pw->n - 1; i >= 0; --i) {
412 pw->p[i].set = isl_set_intersect(pw->p[i].set,
413 isl_set_copy(context));
414 if (!pw->p[i].set)
415 goto error;
416 pw->p[i].FIELD = FN(EL,gist)(pw->p[i].FIELD,
417 isl_set_copy(pw->p[i].set));
418 pw->p[i].set = isl_set_gist_basic_set(pw->p[i].set,
419 isl_basic_set_copy(hull));
420 if (!pw->p[i].set)
421 goto error;
422 if (isl_set_fast_is_empty(pw->p[i].set)) {
423 isl_set_free(pw->p[i].set);
424 FN(EL,free)(pw->p[i].FIELD);
425 if (i != pw->n - 1)
426 pw->p[i] = pw->p[pw->n - 1];
427 pw->n--;
428 }
429 }
430
431 isl_basic_set_free(hull);
432 isl_set_free(context);
433
434 return pw;
435 error:
436 FN(PW,free)(pw);
437 isl_basic_set_free(hull);
438 isl_set_free(context);
439 return NULL;
440 }
441
442 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
443 {
444 int i, j;
445
446 if (!pw)
447 return NULL;
448 if (pw->n == 0)
449 return pw;
450
451 for (i = pw->n - 1; i >= 0; --i) {
452 for (j = i - 1; j >= 0; --j) {
453 if (!FN(EL,is_equal)(pw->p[i].FIELD, pw->p[j].FIELD))
454 continue;
455 pw->p[j].set = isl_set_union(pw->p[j].set,
456 pw->p[i].set);
457 FN(EL,free)(pw->p[i].FIELD);
458 if (i != pw->n - 1)
459 pw->p[i] = pw->p[pw->n - 1];
460 pw->n--;
461 break;
462 }
463 if (j >= 0)
464 continue;
465 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
466 if (!pw->p[i].set)
467 goto error;
468 }
469
470 return pw;
471 error:
472 FN(PW,free)(pw);
473 return NULL;
474 }
475
476 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
477 {
478 return pw ? pw->dim->ctx : NULL;
479 }
480
481 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
482 unsigned first, unsigned n)
483 {
484 int i;
485
486 if (!pw)
487 return -1;
488 if (pw->n == 0 || n == 0)
489 return 0;
490 for (i = 0; i < pw->n; ++i) {
491 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
492 type, first, n);
493 if (involves < 0 || involves)
494 return involves;
495 }
496 return 0;
497 }
498
499 __isl_give PW *FN(PW,set_dim_name)(__isl_take PW *pw,
500 enum isl_dim_type type, unsigned pos, const char *s)
501 {
502 int i;
503
504 pw = FN(PW,cow)(pw);
505 if (!pw)
506 return NULL;
507
508 pw->dim = isl_dim_set_name(pw->dim, type, pos, s);
509 if (!pw->dim)
510 goto error;
511
512 for (i = 0; i < pw->n; ++i) {
513 pw->p[i].set = isl_set_set_dim_name(pw->p[i].set, type, pos, s);
514 if (!pw->p[i].set)
515 goto error;
516 pw->p[i].FIELD = FN(EL,set_dim_name)(pw->p[i].FIELD, type, pos, s);
517 if (!pw->p[i].FIELD)
518 goto error;
519 }
520
521 return pw;
522 error:
523 FN(PW,free)(pw);
524 return NULL;
525 }
526
527 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
528 enum isl_dim_type type, unsigned first, unsigned n)
529 {
530 int i;
531
532 if (!pw)
533 return NULL;
534 if (n == 0 && !isl_dim_get_tuple_name(pw->dim, type))
535 return pw;
536
537 pw = FN(PW,cow)(pw);
538 if (!pw)
539 return NULL;
540 pw->dim = isl_dim_drop(pw->dim, type, first, n);
541 if (!pw->dim)
542 goto error;
543 for (i = 0; i < pw->n; ++i) {
544 pw->p[i].set = isl_set_drop(pw->p[i].set, type, first, n);
545 if (!pw->p[i].set)
546 goto error;
547 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
548 if (!pw->p[i].FIELD)
549 goto error;
550 }
551
552 return pw;
553 error:
554 FN(PW,free)(pw);
555 return NULL;
556 }
557
558 __isl_give PW *FN(PW,insert_dims)(__isl_take PW *pw, enum isl_dim_type type,
559 unsigned first, unsigned n)
560 {
561 int i;
562
563 if (!pw)
564 return NULL;
565 if (n == 0 && !isl_dim_is_named_or_nested(pw->dim, type))
566 return pw;
567
568 pw = FN(PW,cow)(pw);
569 if (!pw)
570 return NULL;
571
572 pw->dim = isl_dim_insert(pw->dim, type, first, n);
573 if (!pw->dim)
574 goto error;
575
576 for (i = 0; i < pw->n; ++i) {
577 pw->p[i].set = isl_set_insert(pw->p[i].set, type, first, n);
578 if (!pw->p[i].set)
579 goto error;
580 pw->p[i].FIELD = FN(EL,insert_dims)(pw->p[i].FIELD,
581 type, first, n);
582 if (!pw->p[i].FIELD)
583 goto error;
584 }
585
586 return pw;
587 error:
588 FN(PW,free)(pw);
589 return NULL;
590 }
591
592 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
593 enum isl_dim_type type, unsigned pos, isl_int v)
594 {
595 int i;
596
597 if (!pw)
598 return NULL;
599
600 pw = FN(PW,cow)(pw);
601 if (!pw)
602 return NULL;
603 for (i = 0; i < pw->n; ++i) {
604 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
605 if (!pw->p[i].set)
606 goto error;
607 }
608
609 return pw;
610 error:
611 FN(PW,free)(pw);
612 return NULL;
613 }
614
615 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
616 {
617 return pw ? isl_dim_size(pw->dim, type) : 0;
618 }
619
620 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
621 enum isl_dim_type type, unsigned first, unsigned n)
622 {
623 int i;
624
625 if (!pw)
626 return NULL;
627 if (n == 0)
628 return pw;
629
630 pw = FN(PW,cow)(pw);
631 if (!pw)
632 return NULL;
633 if (!pw->dim)
634 goto error;
635 for (i = 0; i < pw->n; ++i) {
636 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
637 if (!pw->p[i].set)
638 goto error;
639 }
640
641 return pw;
642 error:
643 FN(PW,free)(pw);
644 return NULL;
645 }
646
647 /* Compute the maximal value attained by the piecewise quasipolynomial
648 * on its domain or zero if the domain is empty.
649 * In the worst case, the domain is scanned completely,
650 * so the domain is assumed to be bounded.
651 */
652 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
653 {
654 int i;
655 isl_qpolynomial *opt;
656
657 if (!pw)
658 return NULL;
659
660 if (pw->n == 0) {
661 isl_dim *dim = isl_dim_copy(pw->dim);
662 FN(PW,free)(pw);
663 return isl_qpolynomial_zero(dim);
664 }
665
666 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
667 isl_set_copy(pw->p[0].set), max);
668 for (i = 1; i < pw->n; ++i) {
669 isl_qpolynomial *opt_i;
670 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
671 isl_set_copy(pw->p[i].set), max);
672 if (max)
673 opt = isl_qpolynomial_max_cst(opt, opt_i);
674 else
675 opt = isl_qpolynomial_min_cst(opt, opt_i);
676 }
677
678 FN(PW,free)(pw);
679 return opt;
680 }
681
682 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
683 {
684 return FN(PW,opt)(pw, 1);
685 }
686
687 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
688 {
689 return FN(PW,opt)(pw, 0);
690 }
691
692 __isl_give isl_dim *FN(PW,get_dim)(__isl_keep PW *pw)
693 {
694 return pw ? isl_dim_copy(pw->dim) : NULL;
695 }
696
697 __isl_give PW *FN(PW,reset_dim)(__isl_take PW *pw, __isl_take isl_dim *dim)
698 {
699 int i;
700
701 pw = FN(PW,cow)(pw);
702 if (!pw || !dim)
703 goto error;
704
705 for (i = 0; i < pw->n; ++i) {
706 pw->p[i].set = isl_set_reset_dim(pw->p[i].set,
707 isl_dim_copy(dim));
708 if (!pw->p[i].set)
709 goto error;
710 pw->p[i].FIELD = FN(EL,reset_dim)(pw->p[i].FIELD,
711 isl_dim_copy(dim));
712 if (!pw->p[i].FIELD)
713 goto error;
714 }
715 isl_dim_free(pw->dim);
716 pw->dim = dim;
717
718 return pw;
719 error:
720 isl_dim_free(dim);
721 FN(PW,free)(pw);
722 return NULL;
723 }
724
725 int FN(PW,has_equal_dim)(__isl_keep PW *pw1, __isl_keep PW *pw2)
726 {
727 if (!pw1 || !pw2)
728 return -1;
729
730 return isl_dim_equal(pw1->dim, pw2->dim);
731 }
732
733 __isl_give PW *FN(PW,morph)(__isl_take PW *pw, __isl_take isl_morph *morph)
734 {
735 int i;
736
737 if (!pw || !morph)
738 goto error;
739
740 isl_assert(pw->dim->ctx, isl_dim_equal(pw->dim, morph->dom->dim),
741 goto error);
742
743 pw = FN(PW,cow)(pw);
744 if (!pw)
745 goto error;
746 isl_dim_free(pw->dim);
747 pw->dim = isl_dim_copy(morph->ran->dim);
748 if (!pw->dim)
749 goto error;
750
751 for (i = 0; i < pw->n; ++i) {
752 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
753 if (!pw->p[i].set)
754 goto error;
755 pw->p[i].FIELD = FN(EL,morph)(pw->p[i].FIELD,
756 isl_morph_copy(morph));
757 if (!pw->p[i].FIELD)
758 goto error;
759 }
760
761 isl_morph_free(morph);
762
763 return pw;
764 error:
765 FN(PW,free)(pw);
766 isl_morph_free(morph);
767 return NULL;
768 }
769
770 int FN(PW,foreach_piece)(__isl_keep PW *pw,
771 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
772 void *user)
773 {
774 int i;
775
776 if (!pw)
777 return -1;
778
779 for (i = 0; i < pw->n; ++i)
780 if (fn(isl_set_copy(pw->p[i].set),
781 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
782 return -1;
783
784 return 0;
785 }
786
787 static int any_divs(__isl_keep isl_set *set)
788 {
789 int i;
790
791 if (!set)
792 return -1;
793
794 for (i = 0; i < set->n; ++i)
795 if (set->p[i]->n_div > 0)
796 return 1;
797
798 return 0;
799 }
800
801 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
802 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
803 void *user), void *user)
804 {
805 int i;
806
807 if (!set || !el)
808 goto error;
809
810 for (i = 0; i < set->n; ++i) {
811 isl_set *lift;
812 EL *copy;
813
814 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
815 lift = isl_set_lift(lift);
816
817 copy = FN(EL,copy)(el);
818 copy = FN(EL,lift)(copy, isl_set_get_dim(lift));
819
820 if (fn(lift, copy, user) < 0)
821 goto error;
822 }
823
824 isl_set_free(set);
825 FN(EL,free)(el);
826
827 return 0;
828 error:
829 isl_set_free(set);
830 FN(EL,free)(el);
831 return -1;
832 }
833
834 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
835 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
836 void *user), void *user)
837 {
838 int i;
839
840 if (!pw)
841 return -1;
842
843 for (i = 0; i < pw->n; ++i) {
844 isl_set *set;
845 EL *el;
846
847 set = isl_set_copy(pw->p[i].set);
848 el = FN(EL,copy)(pw->p[i].FIELD);
849 if (!any_divs(set)) {
850 if (fn(set, el, user) < 0)
851 return -1;
852 continue;
853 }
854 if (foreach_lifted_subset(set, el, fn, user) < 0)
855 return -1;
856 }
857
858 return 0;
859 }
860
861 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
862 enum isl_dim_type dst_type, unsigned dst_pos,
863 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
864 {
865 int i;
866
867 pw = FN(PW,cow)(pw);
868 if (!pw)
869 return NULL;
870
871 pw->dim = isl_dim_move(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
872 if (!pw->dim)
873 goto error;
874
875 for (i = 0; i < pw->n; ++i) {
876 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
877 dst_type, dst_pos,
878 src_type, src_pos, n);
879 if (!pw->p[i].set)
880 goto error;
881 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
882 dst_type, dst_pos, src_type, src_pos, n);
883 if (!pw->p[i].FIELD)
884 goto error;
885 }
886
887 return pw;
888 error:
889 FN(PW,free)(pw);
890 return NULL;
891 }
892
893 __isl_give PW *FN(PW,realign)(__isl_take PW *pw, __isl_take isl_reordering *exp)
894 {
895 int i;
896
897 pw = FN(PW,cow)(pw);
898 if (!pw || !exp)
899 return NULL;
900
901 for (i = 0; i < pw->n; ++i) {
902 pw->p[i].set = isl_set_realign(pw->p[i].set,
903 isl_reordering_copy(exp));
904 if (!pw->p[i].set)
905 goto error;
906 pw->p[i].FIELD = FN(EL,realign)(pw->p[i].FIELD,
907 isl_reordering_copy(exp));
908 if (!pw->p[i].FIELD)
909 goto error;
910 }
911
912 pw = FN(PW,reset_dim)(pw, isl_dim_copy(exp->dim));
913
914 isl_reordering_free(exp);
915 return pw;
916 error:
917 isl_reordering_free(exp);
918 FN(PW,free)(pw);
919 return NULL;
920 }
921
922 __isl_give PW *FN(PW,mul_isl_int)(__isl_take PW *pw, isl_int v)
923 {
924 int i;
925
926 if (isl_int_is_one(v))
927 return pw;
928 if (pw && isl_int_is_zero(v)) {
929 PW *zero;
930 isl_dim *dim = FN(PW,get_dim)(pw);
931 #ifdef HAS_TYPE
932 zero = FN(PW,zero)(dim, pw->type);
933 #else
934 zero = FN(PW,zero)(dim);
935 #endif
936 FN(PW,free)(pw);
937 return zero;
938 }
939 pw = FN(PW,cow)(pw);
940 if (!pw)
941 return NULL;
942 if (pw->n == 0)
943 return pw;
944
945 #ifdef HAS_TYPE
946 if (isl_int_is_neg(v))
947 pw->type = isl_fold_type_negate(pw->type);
948 #endif
949 for (i = 0; i < pw->n; ++i) {
950 pw->p[i].FIELD = FN(EL,mul_isl_int)(pw->p[i].FIELD, v);
951 if (!pw->p[i].FIELD)
952 goto error;
953 }
954
955 return pw;
956 error:
957 FN(PW,free)(pw);
958 return NULL;
959 }
Integer set library