add isl_pw_*_set_dim_id
[isl.git] / isl_pw_templ.c
blob1292e76876822fdd96d4b5c3f8c7ba89ae971133
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 #ifdef HAS_TYPE
7 __isl_give PW *FN(PW,alloc_size)(__isl_take isl_space *dim,
8 enum isl_fold type, int n)
9 #else
10 __isl_give PW *FN(PW,alloc_size)(__isl_take isl_space *dim, int n)
11 #endif
13 isl_ctx *ctx;
14 struct PW *pw;
16 if (!dim)
17 return NULL;
18 ctx = isl_space_get_ctx(dim);
19 isl_assert(ctx, n >= 0, goto error);
20 pw = isl_alloc(ctx, struct PW,
21 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
22 if (!pw)
23 goto error;
25 pw->ref = 1;
26 #ifdef HAS_TYPE
27 pw->type = type;
28 #endif
29 pw->size = n;
30 pw->n = 0;
31 pw->dim = dim;
32 return pw;
33 error:
34 isl_space_free(dim);
35 return NULL;
38 #ifdef HAS_TYPE
39 __isl_give PW *FN(PW,ZERO)(__isl_take isl_space *dim, enum isl_fold type)
41 return FN(PW,alloc_size)(dim, type, 0);
43 #else
44 __isl_give PW *FN(PW,ZERO)(__isl_take isl_space *dim)
46 return FN(PW,alloc_size)(dim, 0);
48 #endif
50 __isl_give PW *FN(PW,add_piece)(__isl_take PW *pw,
51 __isl_take isl_set *set, __isl_take EL *el)
53 isl_ctx *ctx;
54 isl_space *el_dim = NULL;
56 if (!pw || !set || !el)
57 goto error;
59 if (isl_set_plain_is_empty(set) || FN(EL,EL_IS_ZERO)(el)) {
60 isl_set_free(set);
61 FN(EL,free)(el);
62 return pw;
65 ctx = isl_set_get_ctx(set);
66 #ifdef HAS_TYPE
67 if (pw->type != el->type)
68 isl_die(ctx, isl_error_invalid, "fold types don't match",
69 goto error);
70 #endif
71 el_dim = FN(EL,get_space(el));
72 isl_assert(ctx, isl_space_is_equal(pw->dim, el_dim), goto error);
73 isl_assert(ctx, pw->n < pw->size, goto error);
75 pw->p[pw->n].set = set;
76 pw->p[pw->n].FIELD = el;
77 pw->n++;
79 isl_space_free(el_dim);
80 return pw;
81 error:
82 isl_space_free(el_dim);
83 FN(PW,free)(pw);
84 isl_set_free(set);
85 FN(EL,free)(el);
86 return NULL;
89 #ifdef HAS_TYPE
90 __isl_give PW *FN(PW,alloc)(enum isl_fold type,
91 __isl_take isl_set *set, __isl_take EL *el)
92 #else
93 __isl_give PW *FN(PW,alloc)(__isl_take isl_set *set, __isl_take EL *el)
94 #endif
96 PW *pw;
98 if (!set || !el)
99 goto error;
101 #ifdef HAS_TYPE
102 pw = FN(PW,alloc_size)(FN(EL,get_space)(el), type, 1);
103 #else
104 pw = FN(PW,alloc_size)(FN(EL,get_space)(el), 1);
105 #endif
107 return FN(PW,add_piece)(pw, set, el);
108 error:
109 isl_set_free(set);
110 FN(EL,free)(el);
111 return NULL;
114 __isl_give PW *FN(PW,dup)(__isl_keep PW *pw)
116 int i;
117 PW *dup;
119 if (!pw)
120 return NULL;
122 #ifdef HAS_TYPE
123 dup = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, pw->n);
124 #else
125 dup = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->n);
126 #endif
127 if (!dup)
128 return NULL;
130 for (i = 0; i < pw->n; ++i)
131 dup = FN(PW,add_piece)(dup, isl_set_copy(pw->p[i].set),
132 FN(EL,copy)(pw->p[i].FIELD));
134 return dup;
137 __isl_give PW *FN(PW,cow)(__isl_take PW *pw)
139 if (!pw)
140 return NULL;
142 if (pw->ref == 1)
143 return pw;
144 pw->ref--;
145 return FN(PW,dup)(pw);
148 __isl_give PW *FN(PW,copy)(__isl_keep PW *pw)
150 if (!pw)
151 return NULL;
153 pw->ref++;
154 return pw;
157 void *FN(PW,free)(__isl_take PW *pw)
159 int i;
161 if (!pw)
162 return NULL;
163 if (--pw->ref > 0)
164 return NULL;
166 for (i = 0; i < pw->n; ++i) {
167 isl_set_free(pw->p[i].set);
168 FN(EL,free)(pw->p[i].FIELD);
170 isl_space_free(pw->dim);
171 free(pw);
173 return NULL;
176 const char *FN(PW,get_tuple_name)(__isl_keep PW *pw, enum isl_dim_type type)
178 return pw ? isl_space_get_tuple_name(pw->dim, type) : NULL;
181 __isl_give isl_id *FN(PW,get_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type)
183 return pw ? isl_space_get_tuple_id(pw->dim, type) : NULL;
186 int FN(PW,IS_ZERO)(__isl_keep PW *pw)
188 if (!pw)
189 return -1;
191 return pw->n == 0;
194 #ifndef NO_REALIGN
195 __isl_give PW *FN(PW,realign_domain)(__isl_take PW *pw,
196 __isl_take isl_reordering *exp)
198 int i;
200 pw = FN(PW,cow)(pw);
201 if (!pw || !exp)
202 return NULL;
204 for (i = 0; i < pw->n; ++i) {
205 pw->p[i].set = isl_set_realign(pw->p[i].set,
206 isl_reordering_copy(exp));
207 if (!pw->p[i].set)
208 goto error;
209 pw->p[i].FIELD = FN(EL,realign_domain)(pw->p[i].FIELD,
210 isl_reordering_copy(exp));
211 if (!pw->p[i].FIELD)
212 goto error;
215 pw = FN(PW,reset_domain_space)(pw, isl_space_copy(exp->dim));
217 isl_reordering_free(exp);
218 return pw;
219 error:
220 isl_reordering_free(exp);
221 FN(PW,free)(pw);
222 return NULL;
225 /* Align the parameters of "pw" to those of "model".
227 __isl_give PW *FN(PW,align_params)(__isl_take PW *pw, __isl_take isl_space *model)
229 isl_ctx *ctx;
231 if (!pw || !model)
232 goto error;
234 ctx = isl_space_get_ctx(model);
235 if (!isl_space_has_named_params(model))
236 isl_die(ctx, isl_error_invalid,
237 "model has unnamed parameters", goto error);
238 if (!isl_space_has_named_params(pw->dim))
239 isl_die(ctx, isl_error_invalid,
240 "input has unnamed parameters", goto error);
241 if (!isl_space_match(pw->dim, isl_dim_param, model, isl_dim_param)) {
242 isl_reordering *exp;
244 model = isl_space_drop_dims(model, isl_dim_in,
245 0, isl_space_dim(model, isl_dim_in));
246 model = isl_space_drop_dims(model, isl_dim_out,
247 0, isl_space_dim(model, isl_dim_out));
248 exp = isl_parameter_alignment_reordering(pw->dim, model);
249 exp = isl_reordering_extend_space(exp,
250 FN(PW,get_domain_space)(pw));
251 pw = FN(PW,realign_domain)(pw, exp);
254 isl_space_free(model);
255 return pw;
256 error:
257 isl_space_free(model);
258 FN(PW,free)(pw);
259 return NULL;
262 static __isl_give PW *FN(PW,align_params_pw_pw_and)(__isl_take PW *pw1,
263 __isl_take PW *pw2,
264 __isl_give PW *(*fn)(__isl_take PW *pw1, __isl_take PW *pw2))
266 isl_ctx *ctx;
268 if (!pw1 || !pw2)
269 goto error;
270 if (isl_space_match(pw1->dim, isl_dim_param, pw2->dim, isl_dim_param))
271 return fn(pw1, pw2);
272 ctx = FN(PW,get_ctx)(pw1);
273 if (!isl_space_has_named_params(pw1->dim) ||
274 !isl_space_has_named_params(pw2->dim))
275 isl_die(ctx, isl_error_invalid,
276 "unaligned unnamed parameters", goto error);
277 pw1 = FN(PW,align_params)(pw1, FN(PW,get_space)(pw2));
278 pw2 = FN(PW,align_params)(pw2, FN(PW,get_space)(pw1));
279 return fn(pw1, pw2);
280 error:
281 FN(PW,free)(pw1);
282 FN(PW,free)(pw2);
283 return NULL;
286 static __isl_give PW *FN(PW,align_params_pw_set_and)(__isl_take PW *pw,
287 __isl_take isl_set *set,
288 __isl_give PW *(*fn)(__isl_take PW *pw, __isl_take isl_set *set))
290 isl_ctx *ctx;
292 if (!pw || !set)
293 goto error;
294 if (isl_space_match(pw->dim, isl_dim_param, set->dim, isl_dim_param))
295 return fn(pw, set);
296 ctx = FN(PW,get_ctx)(pw);
297 if (!isl_space_has_named_params(pw->dim) ||
298 !isl_space_has_named_params(set->dim))
299 isl_die(ctx, isl_error_invalid,
300 "unaligned unnamed parameters", goto error);
301 pw = FN(PW,align_params)(pw, isl_set_get_space(set));
302 set = isl_set_align_params(set, FN(PW,get_space)(pw));
303 return fn(pw, set);
304 error:
305 FN(PW,free)(pw);
306 isl_set_free(set);
307 return NULL;
309 #endif
311 static __isl_give PW *FN(PW,add_aligned)(__isl_take PW *pw1, __isl_take PW *pw2)
313 int i, j, n;
314 struct PW *res;
315 isl_ctx *ctx;
316 isl_set *set;
318 if (!pw1 || !pw2)
319 goto error;
321 ctx = isl_space_get_ctx(pw1->dim);
322 #ifdef HAS_TYPE
323 if (pw1->type != pw2->type)
324 isl_die(ctx, isl_error_invalid,
325 "fold types don't match", goto error);
326 #endif
327 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
329 if (FN(PW,IS_ZERO)(pw1)) {
330 FN(PW,free)(pw1);
331 return pw2;
334 if (FN(PW,IS_ZERO)(pw2)) {
335 FN(PW,free)(pw2);
336 return pw1;
339 n = (pw1->n + 1) * (pw2->n + 1);
340 #ifdef HAS_TYPE
341 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n);
342 #else
343 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n);
344 #endif
346 for (i = 0; i < pw1->n; ++i) {
347 set = isl_set_copy(pw1->p[i].set);
348 for (j = 0; j < pw2->n; ++j) {
349 struct isl_set *common;
350 EL *sum;
351 set = isl_set_subtract(set,
352 isl_set_copy(pw2->p[j].set));
353 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
354 isl_set_copy(pw2->p[j].set));
355 if (isl_set_plain_is_empty(common)) {
356 isl_set_free(common);
357 continue;
360 sum = FN(EL,add_on_domain)(common,
361 FN(EL,copy)(pw1->p[i].FIELD),
362 FN(EL,copy)(pw2->p[j].FIELD));
364 res = FN(PW,add_piece)(res, common, sum);
366 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD));
369 for (j = 0; j < pw2->n; ++j) {
370 set = isl_set_copy(pw2->p[j].set);
371 for (i = 0; i < pw1->n; ++i)
372 set = isl_set_subtract(set,
373 isl_set_copy(pw1->p[i].set));
374 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD));
377 FN(PW,free)(pw1);
378 FN(PW,free)(pw2);
380 return res;
381 error:
382 FN(PW,free)(pw1);
383 FN(PW,free)(pw2);
384 return NULL;
387 __isl_give PW *FN(PW,add)(__isl_take PW *pw1, __isl_take PW *pw2)
389 return FN(PW,align_params_pw_pw_and)(pw1, pw2, &FN(PW,add_aligned));
392 /* Make sure "pw" has room for at least "n" more pieces.
394 * If there is only one reference to pw, we extend it in place.
395 * Otherwise, we create a new PW and copy the pieces.
397 static __isl_give PW *FN(PW,grow)(__isl_take PW *pw, int n)
399 int i;
400 isl_ctx *ctx;
401 PW *res;
403 if (!pw)
404 return NULL;
405 if (pw->n + n <= pw->size)
406 return pw;
407 ctx = FN(PW,get_ctx)(pw);
408 n += pw->n;
409 if (pw->ref == 1) {
410 res = isl_realloc(ctx, pw, struct PW,
411 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
412 if (!res)
413 return FN(PW,free)(pw);
414 res->size = n;
415 return res;
417 #ifdef HAS_TYPE
418 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, n);
419 #else
420 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), n);
421 #endif
422 if (!res)
423 return FN(PW,free)(pw);
424 for (i = 0; i < pw->n; ++i)
425 res = FN(PW,add_piece)(res, isl_set_copy(pw->p[i].set),
426 FN(EL,copy)(pw->p[i].FIELD));
427 FN(PW,free)(pw);
428 return res;
431 static __isl_give PW *FN(PW,add_disjoint_aligned)(__isl_take PW *pw1,
432 __isl_take PW *pw2)
434 int i;
435 isl_ctx *ctx;
437 if (!pw1 || !pw2)
438 goto error;
440 if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n)
441 return FN(PW,add_disjoint_aligned)(pw2, pw1);
443 ctx = isl_space_get_ctx(pw1->dim);
444 #ifdef HAS_TYPE
445 if (pw1->type != pw2->type)
446 isl_die(ctx, isl_error_invalid,
447 "fold types don't match", goto error);
448 #endif
449 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
451 if (FN(PW,IS_ZERO)(pw1)) {
452 FN(PW,free)(pw1);
453 return pw2;
456 if (FN(PW,IS_ZERO)(pw2)) {
457 FN(PW,free)(pw2);
458 return pw1;
461 pw1 = FN(PW,grow)(pw1, pw2->n);
462 if (!pw1)
463 goto error;
465 for (i = 0; i < pw2->n; ++i)
466 pw1 = FN(PW,add_piece)(pw1,
467 isl_set_copy(pw2->p[i].set),
468 FN(EL,copy)(pw2->p[i].FIELD));
470 FN(PW,free)(pw2);
472 return pw1;
473 error:
474 FN(PW,free)(pw1);
475 FN(PW,free)(pw2);
476 return NULL;
479 __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2)
481 return FN(PW,align_params_pw_pw_and)(pw1, pw2,
482 &FN(PW,add_disjoint_aligned));
485 #ifndef NO_NEG
486 __isl_give PW *FN(PW,neg)(__isl_take PW *pw)
488 int i;
490 if (!pw)
491 return NULL;
493 if (FN(PW,IS_ZERO)(pw))
494 return pw;
496 pw = FN(PW,cow)(pw);
497 if (!pw)
498 return NULL;
500 for (i = 0; i < pw->n; ++i) {
501 pw->p[i].FIELD = FN(EL,neg)(pw->p[i].FIELD);
502 if (!pw->p[i].FIELD)
503 return FN(PW,free)(pw);
506 return pw;
509 __isl_give PW *FN(PW,sub)(__isl_take PW *pw1, __isl_take PW *pw2)
511 return FN(PW,add)(pw1, FN(PW,neg)(pw2));
513 #endif
515 #ifndef NO_EVAL
516 __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw,
517 __isl_take isl_point *pnt)
519 int i;
520 int found = 0;
521 isl_ctx *ctx;
522 isl_space *pnt_dim = NULL;
523 isl_qpolynomial *qp;
525 if (!pw || !pnt)
526 goto error;
527 ctx = isl_point_get_ctx(pnt);
528 pnt_dim = isl_point_get_space(pnt);
529 isl_assert(ctx, isl_space_is_domain(pnt_dim, pw->dim), goto error);
531 for (i = 0; i < pw->n; ++i) {
532 found = isl_set_contains_point(pw->p[i].set, pnt);
533 if (found < 0)
534 goto error;
535 if (found)
536 break;
538 if (found)
539 qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
540 isl_point_copy(pnt));
541 else
542 qp = isl_qpolynomial_zero_on_domain(FN(PW,get_domain_space)(pw));
543 FN(PW,free)(pw);
544 isl_space_free(pnt_dim);
545 isl_point_free(pnt);
546 return qp;
547 error:
548 FN(PW,free)(pw);
549 isl_space_free(pnt_dim);
550 isl_point_free(pnt);
551 return NULL;
553 #endif
555 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
557 int i;
558 isl_set *dom;
560 if (!pw)
561 return NULL;
563 dom = isl_set_empty(FN(PW,get_domain_space)(pw));
564 for (i = 0; i < pw->n; ++i)
565 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
567 FN(PW,free)(pw);
569 return dom;
572 static __isl_give PW *FN(PW,intersect_domain_aligned)(__isl_take PW *pw,
573 __isl_take isl_set *set)
575 int i;
577 if (!pw || !set)
578 goto error;
580 if (pw->n == 0) {
581 isl_set_free(set);
582 return pw;
585 pw = FN(PW,cow)(pw);
586 if (!pw)
587 goto error;
589 for (i = pw->n - 1; i >= 0; --i) {
590 isl_basic_set *aff;
591 pw->p[i].set = isl_set_intersect(pw->p[i].set, isl_set_copy(set));
592 if (!pw->p[i].set)
593 goto error;
594 aff = isl_set_affine_hull(isl_set_copy(pw->p[i].set));
595 pw->p[i].FIELD = FN(EL,substitute_equalities)(pw->p[i].FIELD,
596 aff);
597 if (isl_set_plain_is_empty(pw->p[i].set)) {
598 isl_set_free(pw->p[i].set);
599 FN(EL,free)(pw->p[i].FIELD);
600 if (i != pw->n - 1)
601 pw->p[i] = pw->p[pw->n - 1];
602 pw->n--;
606 isl_set_free(set);
607 return pw;
608 error:
609 isl_set_free(set);
610 FN(PW,free)(pw);
611 return NULL;
614 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw,
615 __isl_take isl_set *context)
617 return FN(PW,align_params_pw_set_and)(pw, context,
618 &FN(PW,intersect_domain_aligned));
621 static __isl_give PW *FN(PW,gist_aligned)(__isl_take PW *pw,
622 __isl_take isl_set *context)
624 int i;
625 isl_basic_set *hull = NULL;
627 if (!pw || !context)
628 goto error;
630 if (pw->n == 0) {
631 isl_set_free(context);
632 return pw;
635 if (!isl_space_match(pw->dim, isl_dim_param,
636 context->dim, isl_dim_param)) {
637 pw = FN(PW,align_params)(pw, isl_set_get_space(context));
638 context = isl_set_align_params(context, FN(PW,get_space)(pw));
641 context = isl_set_compute_divs(context);
642 hull = isl_set_simple_hull(isl_set_copy(context));
644 pw = FN(PW,cow)(pw);
645 if (!pw)
646 goto error;
648 for (i = pw->n - 1; i >= 0; --i) {
649 pw->p[i].set = isl_set_intersect(pw->p[i].set,
650 isl_set_copy(context));
651 if (!pw->p[i].set)
652 goto error;
653 pw->p[i].FIELD = FN(EL,gist)(pw->p[i].FIELD,
654 isl_set_copy(pw->p[i].set));
655 pw->p[i].set = isl_set_gist_basic_set(pw->p[i].set,
656 isl_basic_set_copy(hull));
657 if (!pw->p[i].set)
658 goto error;
659 if (isl_set_plain_is_empty(pw->p[i].set)) {
660 isl_set_free(pw->p[i].set);
661 FN(EL,free)(pw->p[i].FIELD);
662 if (i != pw->n - 1)
663 pw->p[i] = pw->p[pw->n - 1];
664 pw->n--;
668 isl_basic_set_free(hull);
669 isl_set_free(context);
671 return pw;
672 error:
673 FN(PW,free)(pw);
674 isl_basic_set_free(hull);
675 isl_set_free(context);
676 return NULL;
679 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
681 return FN(PW,align_params_pw_set_and)(pw, context, &FN(PW,gist_aligned));
684 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
686 int i, j;
688 if (!pw)
689 return NULL;
690 if (pw->n == 0)
691 return pw;
693 for (i = pw->n - 1; i >= 0; --i) {
694 for (j = i - 1; j >= 0; --j) {
695 if (!FN(EL,plain_is_equal)(pw->p[i].FIELD,
696 pw->p[j].FIELD))
697 continue;
698 pw->p[j].set = isl_set_union(pw->p[j].set,
699 pw->p[i].set);
700 FN(EL,free)(pw->p[i].FIELD);
701 if (i != pw->n - 1)
702 pw->p[i] = pw->p[pw->n - 1];
703 pw->n--;
704 break;
706 if (j >= 0)
707 continue;
708 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
709 if (!pw->p[i].set)
710 goto error;
713 return pw;
714 error:
715 FN(PW,free)(pw);
716 return NULL;
719 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
721 return pw ? isl_space_get_ctx(pw->dim) : NULL;
724 #ifndef NO_INVOLVES_DIMS
725 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
726 unsigned first, unsigned n)
728 int i;
729 enum isl_dim_type set_type;
731 if (!pw)
732 return -1;
733 if (pw->n == 0 || n == 0)
734 return 0;
736 set_type = type == isl_dim_in ? isl_dim_set : type;
738 for (i = 0; i < pw->n; ++i) {
739 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
740 type, first, n);
741 if (involves < 0 || involves)
742 return involves;
743 involves = isl_set_involves_dims(pw->p[i].set,
744 set_type, first, n);
745 if (involves < 0 || involves)
746 return involves;
748 return 0;
750 #endif
752 __isl_give PW *FN(PW,set_dim_name)(__isl_take PW *pw,
753 enum isl_dim_type type, unsigned pos, const char *s)
755 int i;
756 enum isl_dim_type set_type;
758 pw = FN(PW,cow)(pw);
759 if (!pw)
760 return NULL;
762 set_type = type == isl_dim_in ? isl_dim_set : type;
764 pw->dim = isl_space_set_dim_name(pw->dim, type, pos, s);
765 if (!pw->dim)
766 goto error;
768 for (i = 0; i < pw->n; ++i) {
769 pw->p[i].set = isl_set_set_dim_name(pw->p[i].set,
770 set_type, pos, s);
771 if (!pw->p[i].set)
772 goto error;
773 pw->p[i].FIELD = FN(EL,set_dim_name)(pw->p[i].FIELD, type, pos, s);
774 if (!pw->p[i].FIELD)
775 goto error;
778 return pw;
779 error:
780 FN(PW,free)(pw);
781 return NULL;
784 #ifndef NO_DROP_DIMS
785 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
786 enum isl_dim_type type, unsigned first, unsigned n)
788 int i;
789 enum isl_dim_type set_type;
791 if (!pw)
792 return NULL;
793 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
794 return pw;
796 set_type = type == isl_dim_in ? isl_dim_set : type;
798 pw = FN(PW,cow)(pw);
799 if (!pw)
800 return NULL;
801 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
802 if (!pw->dim)
803 goto error;
804 for (i = 0; i < pw->n; ++i) {
805 pw->p[i].set = isl_set_drop(pw->p[i].set, set_type, first, n);
806 if (!pw->p[i].set)
807 goto error;
808 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
809 if (!pw->p[i].FIELD)
810 goto error;
813 return pw;
814 error:
815 FN(PW,free)(pw);
816 return NULL;
819 /* This function is very similar to drop_dims.
820 * The only difference is that the cells may still involve
821 * the specified dimensions. They are removed using
822 * isl_set_project_out instead of isl_set_drop.
824 __isl_give PW *FN(PW,project_out)(__isl_take PW *pw,
825 enum isl_dim_type type, unsigned first, unsigned n)
827 int i;
828 enum isl_dim_type set_type;
830 if (!pw)
831 return NULL;
832 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
833 return pw;
835 set_type = type == isl_dim_in ? isl_dim_set : type;
837 pw = FN(PW,cow)(pw);
838 if (!pw)
839 return NULL;
840 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
841 if (!pw->dim)
842 goto error;
843 for (i = 0; i < pw->n; ++i) {
844 pw->p[i].set = isl_set_project_out(pw->p[i].set,
845 set_type, first, n);
846 if (!pw->p[i].set)
847 goto error;
848 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
849 if (!pw->p[i].FIELD)
850 goto error;
853 return pw;
854 error:
855 FN(PW,free)(pw);
856 return NULL;
859 /* Project the domain of pw onto its parameter space.
861 __isl_give PW *FN(PW,project_domain_on_params)(__isl_take PW *pw)
863 isl_space *space;
864 unsigned n;
866 n = FN(PW,dim)(pw, isl_dim_in);
867 pw = FN(PW,project_out)(pw, isl_dim_in, 0, n);
868 space = FN(PW,get_domain_space)(pw);
869 space = isl_space_params(space);
870 pw = FN(PW,reset_domain_space)(pw, space);
871 return pw;
873 #endif
875 #ifndef NO_INSERT_DIMS
876 __isl_give PW *FN(PW,insert_dims)(__isl_take PW *pw, enum isl_dim_type type,
877 unsigned first, unsigned n)
879 int i;
880 enum isl_dim_type set_type;
882 if (!pw)
883 return NULL;
884 if (n == 0 && !isl_space_is_named_or_nested(pw->dim, type))
885 return pw;
887 set_type = type == isl_dim_in ? isl_dim_set : type;
889 pw = FN(PW,cow)(pw);
890 if (!pw)
891 return NULL;
893 pw->dim = isl_space_insert_dims(pw->dim, type, first, n);
894 if (!pw->dim)
895 goto error;
897 for (i = 0; i < pw->n; ++i) {
898 pw->p[i].set = isl_set_insert_dims(pw->p[i].set,
899 set_type, first, n);
900 if (!pw->p[i].set)
901 goto error;
902 pw->p[i].FIELD = FN(EL,insert_dims)(pw->p[i].FIELD,
903 type, first, n);
904 if (!pw->p[i].FIELD)
905 goto error;
908 return pw;
909 error:
910 FN(PW,free)(pw);
911 return NULL;
913 #endif
915 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
916 enum isl_dim_type type, unsigned pos, isl_int v)
918 int i;
920 if (!pw)
921 return NULL;
923 if (type == isl_dim_in)
924 type = isl_dim_set;
926 pw = FN(PW,cow)(pw);
927 if (!pw)
928 return NULL;
929 for (i = 0; i < pw->n; ++i) {
930 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
931 if (!pw->p[i].set)
932 goto error;
935 return pw;
936 error:
937 FN(PW,free)(pw);
938 return NULL;
941 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
943 return pw ? isl_space_dim(pw->dim, type) : 0;
946 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
947 enum isl_dim_type type, unsigned first, unsigned n)
949 int i;
951 if (!pw)
952 return NULL;
953 if (n == 0)
954 return pw;
956 if (type == isl_dim_in)
957 type = isl_dim_set;
959 pw = FN(PW,cow)(pw);
960 if (!pw)
961 return NULL;
962 if (!pw->dim)
963 goto error;
964 for (i = 0; i < pw->n; ++i) {
965 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
966 if (!pw->p[i].set)
967 goto error;
970 return pw;
971 error:
972 FN(PW,free)(pw);
973 return NULL;
976 #ifndef NO_OPT
977 /* Compute the maximal value attained by the piecewise quasipolynomial
978 * on its domain or zero if the domain is empty.
979 * In the worst case, the domain is scanned completely,
980 * so the domain is assumed to be bounded.
982 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
984 int i;
985 isl_qpolynomial *opt;
987 if (!pw)
988 return NULL;
990 if (pw->n == 0) {
991 isl_space *dim = isl_space_copy(pw->dim);
992 FN(PW,free)(pw);
993 return isl_qpolynomial_zero_on_domain(dim);
996 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
997 isl_set_copy(pw->p[0].set), max);
998 for (i = 1; i < pw->n; ++i) {
999 isl_qpolynomial *opt_i;
1000 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
1001 isl_set_copy(pw->p[i].set), max);
1002 if (max)
1003 opt = isl_qpolynomial_max_cst(opt, opt_i);
1004 else
1005 opt = isl_qpolynomial_min_cst(opt, opt_i);
1008 FN(PW,free)(pw);
1009 return opt;
1012 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
1014 return FN(PW,opt)(pw, 1);
1017 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
1019 return FN(PW,opt)(pw, 0);
1021 #endif
1023 __isl_give isl_space *FN(PW,get_space)(__isl_keep PW *pw)
1025 return pw ? isl_space_copy(pw->dim) : NULL;
1028 __isl_give isl_space *FN(PW,get_domain_space)(__isl_keep PW *pw)
1030 return pw ? isl_space_domain(isl_space_copy(pw->dim)) : NULL;
1033 #ifndef NO_RESET_DIM
1034 /* Reset the space of "pw". Since we don't know if the elements
1035 * represent the spaces themselves or their domains, we pass along
1036 * both when we call their reset_space_and_domain.
1038 static __isl_give PW *FN(PW,reset_space_and_domain)(__isl_take PW *pw,
1039 __isl_take isl_space *space, __isl_take isl_space *domain)
1041 int i;
1043 pw = FN(PW,cow)(pw);
1044 if (!pw || !space || !domain)
1045 goto error;
1047 for (i = 0; i < pw->n; ++i) {
1048 pw->p[i].set = isl_set_reset_space(pw->p[i].set,
1049 isl_space_copy(domain));
1050 if (!pw->p[i].set)
1051 goto error;
1052 pw->p[i].FIELD = FN(EL,reset_space_and_domain)(pw->p[i].FIELD,
1053 isl_space_copy(space), isl_space_copy(domain));
1054 if (!pw->p[i].FIELD)
1055 goto error;
1058 isl_space_free(domain);
1060 isl_space_free(pw->dim);
1061 pw->dim = space;
1063 return pw;
1064 error:
1065 isl_space_free(domain);
1066 isl_space_free(space);
1067 FN(PW,free)(pw);
1068 return NULL;
1071 __isl_give PW *FN(PW,reset_domain_space)(__isl_take PW *pw,
1072 __isl_take isl_space *domain)
1074 isl_space *space;
1076 space = isl_space_extend_domain_with_range(isl_space_copy(domain),
1077 FN(PW,get_space)(pw));
1078 return FN(PW,reset_space_and_domain)(pw, space, domain);
1081 __isl_give PW *FN(PW,reset_space)(__isl_take PW *pw, __isl_take isl_space *dim)
1083 isl_space *domain;
1085 domain = isl_space_domain(isl_space_copy(dim));
1086 return FN(PW,reset_space_and_domain)(pw, dim, domain);
1089 __isl_give PW *FN(PW,set_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type,
1090 __isl_take isl_id *id)
1092 isl_space *space;
1094 pw = FN(PW,cow)(pw);
1095 if (!pw)
1096 return isl_id_free(id);
1098 space = FN(PW,get_space)(pw);
1099 space = isl_space_set_tuple_id(space, type, id);
1101 return FN(PW,reset_space)(pw, space);
1104 __isl_give PW *FN(PW,set_dim_id)(__isl_take PW *pw,
1105 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
1107 pw = FN(PW,cow)(pw);
1108 if (!pw)
1109 return isl_id_free(id);
1110 pw->dim = isl_space_set_dim_id(pw->dim, type, pos, id);
1111 return FN(PW,reset_space)(pw, isl_space_copy(pw->dim));
1113 #endif
1115 int FN(PW,has_equal_space)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1117 if (!pw1 || !pw2)
1118 return -1;
1120 return isl_space_is_equal(pw1->dim, pw2->dim);
1123 #ifndef NO_MORPH
1124 __isl_give PW *FN(PW,morph_domain)(__isl_take PW *pw,
1125 __isl_take isl_morph *morph)
1127 int i;
1128 isl_ctx *ctx;
1130 if (!pw || !morph)
1131 goto error;
1133 ctx = isl_space_get_ctx(pw->dim);
1134 isl_assert(ctx, isl_space_is_domain(morph->dom->dim, pw->dim),
1135 goto error);
1137 pw = FN(PW,cow)(pw);
1138 if (!pw)
1139 goto error;
1140 pw->dim = isl_space_extend_domain_with_range(
1141 isl_space_copy(morph->ran->dim), pw->dim);
1142 if (!pw->dim)
1143 goto error;
1145 for (i = 0; i < pw->n; ++i) {
1146 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
1147 if (!pw->p[i].set)
1148 goto error;
1149 pw->p[i].FIELD = FN(EL,morph_domain)(pw->p[i].FIELD,
1150 isl_morph_copy(morph));
1151 if (!pw->p[i].FIELD)
1152 goto error;
1155 isl_morph_free(morph);
1157 return pw;
1158 error:
1159 FN(PW,free)(pw);
1160 isl_morph_free(morph);
1161 return NULL;
1163 #endif
1165 int FN(PW,foreach_piece)(__isl_keep PW *pw,
1166 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
1167 void *user)
1169 int i;
1171 if (!pw)
1172 return -1;
1174 for (i = 0; i < pw->n; ++i)
1175 if (fn(isl_set_copy(pw->p[i].set),
1176 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
1177 return -1;
1179 return 0;
1182 #ifndef NO_LIFT
1183 static int any_divs(__isl_keep isl_set *set)
1185 int i;
1187 if (!set)
1188 return -1;
1190 for (i = 0; i < set->n; ++i)
1191 if (set->p[i]->n_div > 0)
1192 return 1;
1194 return 0;
1197 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
1198 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1199 void *user), void *user)
1201 int i;
1203 if (!set || !el)
1204 goto error;
1206 for (i = 0; i < set->n; ++i) {
1207 isl_set *lift;
1208 EL *copy;
1210 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
1211 lift = isl_set_lift(lift);
1213 copy = FN(EL,copy)(el);
1214 copy = FN(EL,lift)(copy, isl_set_get_space(lift));
1216 if (fn(lift, copy, user) < 0)
1217 goto error;
1220 isl_set_free(set);
1221 FN(EL,free)(el);
1223 return 0;
1224 error:
1225 isl_set_free(set);
1226 FN(EL,free)(el);
1227 return -1;
1230 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
1231 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1232 void *user), void *user)
1234 int i;
1236 if (!pw)
1237 return -1;
1239 for (i = 0; i < pw->n; ++i) {
1240 isl_set *set;
1241 EL *el;
1243 set = isl_set_copy(pw->p[i].set);
1244 el = FN(EL,copy)(pw->p[i].FIELD);
1245 if (!any_divs(set)) {
1246 if (fn(set, el, user) < 0)
1247 return -1;
1248 continue;
1250 if (foreach_lifted_subset(set, el, fn, user) < 0)
1251 return -1;
1254 return 0;
1256 #endif
1258 #ifndef NO_MOVE_DIMS
1259 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
1260 enum isl_dim_type dst_type, unsigned dst_pos,
1261 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1263 int i;
1265 pw = FN(PW,cow)(pw);
1266 if (!pw)
1267 return NULL;
1269 pw->dim = isl_space_move_dims(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
1270 if (!pw->dim)
1271 goto error;
1273 for (i = 0; i < pw->n; ++i) {
1274 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
1275 dst_type, dst_pos, src_type, src_pos, n);
1276 if (!pw->p[i].FIELD)
1277 goto error;
1280 if (dst_type == isl_dim_in)
1281 dst_type = isl_dim_set;
1282 if (src_type == isl_dim_in)
1283 src_type = isl_dim_set;
1285 for (i = 0; i < pw->n; ++i) {
1286 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
1287 dst_type, dst_pos,
1288 src_type, src_pos, n);
1289 if (!pw->p[i].set)
1290 goto error;
1293 return pw;
1294 error:
1295 FN(PW,free)(pw);
1296 return NULL;
1298 #endif
1300 __isl_give PW *FN(PW,mul_isl_int)(__isl_take PW *pw, isl_int v)
1302 int i;
1304 if (isl_int_is_one(v))
1305 return pw;
1306 if (pw && isl_int_is_zero(v)) {
1307 PW *zero;
1308 isl_space *dim = FN(PW,get_space)(pw);
1309 #ifdef HAS_TYPE
1310 zero = FN(PW,ZERO)(dim, pw->type);
1311 #else
1312 zero = FN(PW,ZERO)(dim);
1313 #endif
1314 FN(PW,free)(pw);
1315 return zero;
1317 pw = FN(PW,cow)(pw);
1318 if (!pw)
1319 return NULL;
1320 if (pw->n == 0)
1321 return pw;
1323 #ifdef HAS_TYPE
1324 if (isl_int_is_neg(v))
1325 pw->type = isl_fold_type_negate(pw->type);
1326 #endif
1327 for (i = 0; i < pw->n; ++i) {
1328 pw->p[i].FIELD = FN(EL,scale)(pw->p[i].FIELD, v);
1329 if (!pw->p[i].FIELD)
1330 goto error;
1333 return pw;
1334 error:
1335 FN(PW,free)(pw);
1336 return NULL;
1339 __isl_give PW *FN(PW,scale)(__isl_take PW *pw, isl_int v)
1341 return FN(PW,mul_isl_int)(pw, v);
1344 static int FN(PW,qsort_set_cmp)(const void *p1, const void *p2)
1346 const isl_set *set1 = *(const isl_set **)p1;
1347 const isl_set *set2 = *(const isl_set **)p2;
1349 return isl_set_plain_cmp(set1, set2);
1352 /* We normalize in place, but if anything goes wrong we need
1353 * to return NULL, so we need to make sure we don't change the
1354 * meaning of any possible other copies of map.
1356 __isl_give PW *FN(PW,normalize)(__isl_take PW *pw)
1358 int i, j;
1359 isl_set *set;
1361 if (!pw)
1362 return NULL;
1363 for (i = 0; i < pw->n; ++i) {
1364 set = isl_set_normalize(isl_set_copy(pw->p[i].set));
1365 if (!set)
1366 return FN(PW,free)(pw);
1367 isl_set_free(pw->p[i].set);
1368 pw->p[i].set = set;
1370 qsort(pw->p, pw->n, sizeof(pw->p[0]), &FN(PW,qsort_set_cmp));
1371 for (i = pw->n - 1; i >= 1; --i) {
1372 if (!isl_set_plain_is_equal(pw->p[i - 1].set, pw->p[i].set))
1373 continue;
1374 if (!FN(EL,plain_is_equal)(pw->p[i - 1].FIELD, pw->p[i].FIELD))
1375 continue;
1376 set = isl_set_union(isl_set_copy(pw->p[i - 1].set),
1377 isl_set_copy(pw->p[i].set));
1378 if (!set)
1379 return FN(PW,free)(pw);
1380 isl_set_free(pw->p[i].set);
1381 FN(EL,free)(pw->p[i].FIELD);
1382 isl_set_free(pw->p[i - 1].set);
1383 pw->p[i - 1].set = set;
1384 for (j = i + 1; j < pw->n; ++j)
1385 pw->p[j - 1] = pw->p[j];
1386 pw->n--;
1389 return pw;
1392 /* Is pw1 obviously equal to pw2?
1393 * That is, do they have obviously identical cells and obviously identical
1394 * elements on each cell?
1396 int FN(PW,plain_is_equal)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1398 int i;
1399 int equal;
1401 if (!pw1 || !pw2)
1402 return -1;
1404 if (pw1 == pw2)
1405 return 1;
1406 if (!isl_space_is_equal(pw1->dim, pw2->dim))
1407 return 0;
1409 pw1 = FN(PW,copy)(pw1);
1410 pw2 = FN(PW,copy)(pw2);
1411 pw1 = FN(PW,normalize)(pw1);
1412 pw2 = FN(PW,normalize)(pw2);
1413 if (!pw1 || !pw2)
1414 goto error;
1416 equal = pw1->n == pw2->n;
1417 for (i = 0; equal && i < pw1->n; ++i) {
1418 equal = isl_set_plain_is_equal(pw1->p[i].set, pw2->p[i].set);
1419 if (equal < 0)
1420 goto error;
1421 if (!equal)
1422 break;
1423 equal = FN(EL,plain_is_equal)(pw1->p[i].FIELD, pw2->p[i].FIELD);
1424 if (equal < 0)
1425 goto error;
1428 FN(PW,free)(pw1);
1429 FN(PW,free)(pw2);
1430 return equal;
1431 error:
1432 FN(PW,free)(pw1);
1433 FN(PW,free)(pw2);
1434 return -1;