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)
7 __isl_give PW *FN(PW,alloc_size)(__isl_take isl_space *dim,
8 enum isl_fold type, int n)
10 __isl_give PW *FN(PW,alloc_size)(__isl_take isl_space *dim, int n)
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)));
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);
44 __isl_give PW *FN(PW,ZERO)(__isl_take isl_space *dim)
46 return FN(PW,alloc_size)(dim, 0);
50 __isl_give PW *FN(PW,add_piece)(__isl_take PW *pw,
51 __isl_take isl_set *set, __isl_take EL *el)
54 isl_space *el_dim = NULL;
56 if (!pw || !set || !el)
59 if (isl_set_plain_is_empty(set) || FN(EL,EL_IS_ZERO)(el)) {
65 ctx = isl_set_get_ctx(set);
67 if (pw->type != el->type)
68 isl_die(ctx, isl_error_invalid, "fold types don't match",
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;
79 isl_space_free(el_dim);
82 isl_space_free(el_dim);
90 __isl_give PW *FN(PW,alloc)(enum isl_fold type,
91 __isl_take isl_set *set, __isl_take EL *el)
93 __isl_give PW *FN(PW,alloc)(__isl_take isl_set *set, __isl_take EL *el)
102 pw = FN(PW,alloc_size)(FN(EL,get_space)(el), type, 1);
104 pw = FN(PW,alloc_size)(FN(EL,get_space)(el), 1);
107 return FN(PW,add_piece)(pw, set, el);
114 __isl_give PW *FN(PW,dup)(__isl_keep PW *pw)
123 dup = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, pw->n);
125 dup = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->n);
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));
137 __isl_give PW *FN(PW,cow)(__isl_take PW *pw)
145 return FN(PW,dup)(pw);
148 __isl_give PW *FN(PW,copy)(__isl_keep PW *pw)
157 void *FN(PW,free)(__isl_take PW *pw)
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);
176 const char *FN(PW,get_dim_name)(__isl_keep PW *pw, enum isl_dim_type type,
179 return pw ? isl_space_get_dim_name(pw->dim, type, pos) : NULL;
182 __isl_give isl_id *FN(PW,get_dim_id)(__isl_keep PW *pw, enum isl_dim_type type,
185 return pw ? isl_space_get_dim_id(pw->dim, type, pos) : NULL;
188 const char *FN(PW,get_tuple_name)(__isl_keep PW *pw, enum isl_dim_type type)
190 return pw ? isl_space_get_tuple_name(pw->dim, type) : NULL;
193 int FN(PW,has_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type)
195 return pw ? isl_space_has_tuple_id(pw->dim, type) : -1;
198 __isl_give isl_id *FN(PW,get_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type)
200 return pw ? isl_space_get_tuple_id(pw->dim, type) : NULL;
203 int FN(PW,IS_ZERO)(__isl_keep PW *pw)
212 __isl_give PW *FN(PW,realign_domain)(__isl_take PW *pw,
213 __isl_take isl_reordering *exp)
221 for (i = 0; i < pw->n; ++i) {
222 pw->p[i].set = isl_set_realign(pw->p[i].set,
223 isl_reordering_copy(exp));
226 pw->p[i].FIELD = FN(EL,realign_domain)(pw->p[i].FIELD,
227 isl_reordering_copy(exp));
232 pw = FN(PW,reset_domain_space)(pw, isl_space_copy(exp->dim));
234 isl_reordering_free(exp);
237 isl_reordering_free(exp);
242 /* Align the parameters of "pw" to those of "model".
244 __isl_give PW *FN(PW,align_params)(__isl_take PW *pw, __isl_take isl_space *model)
251 ctx = isl_space_get_ctx(model);
252 if (!isl_space_has_named_params(model))
253 isl_die(ctx, isl_error_invalid,
254 "model has unnamed parameters", goto error);
255 if (!isl_space_has_named_params(pw->dim))
256 isl_die(ctx, isl_error_invalid,
257 "input has unnamed parameters", goto error);
258 if (!isl_space_match(pw->dim, isl_dim_param, model, isl_dim_param)) {
261 model = isl_space_drop_dims(model, isl_dim_in,
262 0, isl_space_dim(model, isl_dim_in));
263 model = isl_space_drop_dims(model, isl_dim_out,
264 0, isl_space_dim(model, isl_dim_out));
265 exp = isl_parameter_alignment_reordering(pw->dim, model);
266 exp = isl_reordering_extend_space(exp,
267 FN(PW,get_domain_space)(pw));
268 pw = FN(PW,realign_domain)(pw, exp);
271 isl_space_free(model);
274 isl_space_free(model);
279 static __isl_give PW *FN(PW,align_params_pw_pw_and)(__isl_take PW *pw1,
281 __isl_give PW *(*fn)(__isl_take PW *pw1, __isl_take PW *pw2))
287 if (isl_space_match(pw1->dim, isl_dim_param, pw2->dim, isl_dim_param))
289 ctx = FN(PW,get_ctx)(pw1);
290 if (!isl_space_has_named_params(pw1->dim) ||
291 !isl_space_has_named_params(pw2->dim))
292 isl_die(ctx, isl_error_invalid,
293 "unaligned unnamed parameters", goto error);
294 pw1 = FN(PW,align_params)(pw1, FN(PW,get_space)(pw2));
295 pw2 = FN(PW,align_params)(pw2, FN(PW,get_space)(pw1));
303 static __isl_give PW *FN(PW,align_params_pw_set_and)(__isl_take PW *pw,
304 __isl_take isl_set *set,
305 __isl_give PW *(*fn)(__isl_take PW *pw, __isl_take isl_set *set))
311 if (isl_space_match(pw->dim, isl_dim_param, set->dim, isl_dim_param))
313 ctx = FN(PW,get_ctx)(pw);
314 if (!isl_space_has_named_params(pw->dim) ||
315 !isl_space_has_named_params(set->dim))
316 isl_die(ctx, isl_error_invalid,
317 "unaligned unnamed parameters", goto error);
318 pw = FN(PW,align_params)(pw, isl_set_get_space(set));
319 set = isl_set_align_params(set, FN(PW,get_space)(pw));
328 static __isl_give PW *FN(PW,union_add_aligned)(__isl_take PW *pw1,
339 ctx = isl_space_get_ctx(pw1->dim);
341 if (pw1->type != pw2->type)
342 isl_die(ctx, isl_error_invalid,
343 "fold types don't match", goto error);
345 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
347 if (FN(PW,IS_ZERO)(pw1)) {
352 if (FN(PW,IS_ZERO)(pw2)) {
357 n = (pw1->n + 1) * (pw2->n + 1);
359 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n);
361 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n);
364 for (i = 0; i < pw1->n; ++i) {
365 set = isl_set_copy(pw1->p[i].set);
366 for (j = 0; j < pw2->n; ++j) {
367 struct isl_set *common;
369 set = isl_set_subtract(set,
370 isl_set_copy(pw2->p[j].set));
371 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
372 isl_set_copy(pw2->p[j].set));
373 if (isl_set_plain_is_empty(common)) {
374 isl_set_free(common);
378 sum = FN(EL,add_on_domain)(common,
379 FN(EL,copy)(pw1->p[i].FIELD),
380 FN(EL,copy)(pw2->p[j].FIELD));
382 res = FN(PW,add_piece)(res, common, sum);
384 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD));
387 for (j = 0; j < pw2->n; ++j) {
388 set = isl_set_copy(pw2->p[j].set);
389 for (i = 0; i < pw1->n; ++i)
390 set = isl_set_subtract(set,
391 isl_set_copy(pw1->p[i].set));
392 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD));
405 /* Private version of "union_add". For isl_pw_qpolynomial and
406 * isl_pw_qpolynomial_fold, we prefer to simply call it "add".
408 static __isl_give PW *FN(PW,union_add_)(__isl_take PW *pw1, __isl_take PW *pw2)
410 return FN(PW,align_params_pw_pw_and)(pw1, pw2,
411 &FN(PW,union_add_aligned));
414 /* Make sure "pw" has room for at least "n" more pieces.
416 * If there is only one reference to pw, we extend it in place.
417 * Otherwise, we create a new PW and copy the pieces.
419 static __isl_give PW *FN(PW,grow)(__isl_take PW *pw, int n)
427 if (pw->n + n <= pw->size)
429 ctx = FN(PW,get_ctx)(pw);
432 res = isl_realloc(ctx, pw, struct PW,
433 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
435 return FN(PW,free)(pw);
440 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, n);
442 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), n);
445 return FN(PW,free)(pw);
446 for (i = 0; i < pw->n; ++i)
447 res = FN(PW,add_piece)(res, isl_set_copy(pw->p[i].set),
448 FN(EL,copy)(pw->p[i].FIELD));
453 static __isl_give PW *FN(PW,add_disjoint_aligned)(__isl_take PW *pw1,
462 if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n)
463 return FN(PW,add_disjoint_aligned)(pw2, pw1);
465 ctx = isl_space_get_ctx(pw1->dim);
467 if (pw1->type != pw2->type)
468 isl_die(ctx, isl_error_invalid,
469 "fold types don't match", goto error);
471 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
473 if (FN(PW,IS_ZERO)(pw1)) {
478 if (FN(PW,IS_ZERO)(pw2)) {
483 pw1 = FN(PW,grow)(pw1, pw2->n);
487 for (i = 0; i < pw2->n; ++i)
488 pw1 = FN(PW,add_piece)(pw1,
489 isl_set_copy(pw2->p[i].set),
490 FN(EL,copy)(pw2->p[i].FIELD));
501 __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2)
503 return FN(PW,align_params_pw_pw_and)(pw1, pw2,
504 &FN(PW,add_disjoint_aligned));
507 /* This function is currently only used from isl_aff.c
509 static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1,
511 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
512 __attribute__ ((unused));
514 /* Apply "fn" to pairs of elements from pw1 and pw2 on shared domains.
516 static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1,
518 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
528 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n);
530 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n);
533 for (i = 0; i < pw1->n; ++i) {
534 for (j = 0; j < pw2->n; ++j) {
537 common = isl_set_intersect(
538 isl_set_copy(pw1->p[i].set),
539 isl_set_copy(pw2->p[j].set));
540 if (isl_set_plain_is_empty(common)) {
541 isl_set_free(common);
545 res_ij = fn(FN(EL,copy)(pw1->p[i].FIELD),
546 FN(EL,copy)(pw2->p[j].FIELD));
548 res = FN(PW,add_piece)(res, common, res_ij);
562 __isl_give PW *FN(PW,neg)(__isl_take PW *pw)
569 if (FN(PW,IS_ZERO)(pw))
576 for (i = 0; i < pw->n; ++i) {
577 pw->p[i].FIELD = FN(EL,neg)(pw->p[i].FIELD);
579 return FN(PW,free)(pw);
585 __isl_give PW *FN(PW,sub)(__isl_take PW *pw1, __isl_take PW *pw2)
587 return FN(PW,add)(pw1, FN(PW,neg)(pw2));
592 __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw,
593 __isl_take isl_point *pnt)
598 isl_space *pnt_dim = NULL;
603 ctx = isl_point_get_ctx(pnt);
604 pnt_dim = isl_point_get_space(pnt);
605 isl_assert(ctx, isl_space_is_domain(pnt_dim, pw->dim), goto error);
607 for (i = 0; i < pw->n; ++i) {
608 found = isl_set_contains_point(pw->p[i].set, pnt);
615 qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
616 isl_point_copy(pnt));
618 qp = isl_qpolynomial_zero_on_domain(FN(PW,get_domain_space)(pw));
620 isl_space_free(pnt_dim);
625 isl_space_free(pnt_dim);
631 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
639 dom = isl_set_empty(FN(PW,get_domain_space)(pw));
640 for (i = 0; i < pw->n; ++i)
641 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
648 /* Restrict the domain of "pw" by combining each cell
649 * with "set" through a call to "fn", where "fn" may be
650 * isl_set_intersect or isl_set_intersect_params.
652 static __isl_give PW *FN(PW,intersect_aligned)(__isl_take PW *pw,
653 __isl_take isl_set *set,
654 __isl_give isl_set *(*fn)(__isl_take isl_set *set1,
655 __isl_take isl_set *set2))
671 for (i = pw->n - 1; i >= 0; --i) {
673 pw->p[i].set = fn(pw->p[i].set, isl_set_copy(set));
676 aff = isl_set_affine_hull(isl_set_copy(pw->p[i].set));
677 pw->p[i].FIELD = FN(EL,substitute_equalities)(pw->p[i].FIELD,
681 if (isl_set_plain_is_empty(pw->p[i].set)) {
682 isl_set_free(pw->p[i].set);
683 FN(EL,free)(pw->p[i].FIELD);
685 pw->p[i] = pw->p[pw->n - 1];
698 static __isl_give PW *FN(PW,intersect_domain_aligned)(__isl_take PW *pw,
699 __isl_take isl_set *set)
701 return FN(PW,intersect_aligned)(pw, set, &isl_set_intersect);
704 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw,
705 __isl_take isl_set *context)
707 return FN(PW,align_params_pw_set_and)(pw, context,
708 &FN(PW,intersect_domain_aligned));
711 static __isl_give PW *FN(PW,intersect_params_aligned)(__isl_take PW *pw,
712 __isl_take isl_set *set)
714 return FN(PW,intersect_aligned)(pw, set, &isl_set_intersect_params);
717 /* Intersect the domain of "pw" with the parameter domain "context".
719 __isl_give PW *FN(PW,intersect_params)(__isl_take PW *pw,
720 __isl_take isl_set *context)
722 return FN(PW,align_params_pw_set_and)(pw, context,
723 &FN(PW,intersect_params_aligned));
726 static __isl_give PW *FN(PW,gist_aligned)(__isl_take PW *pw,
727 __isl_take isl_set *context)
730 isl_basic_set *hull = NULL;
736 isl_set_free(context);
740 if (!isl_space_match(pw->dim, isl_dim_param,
741 context->dim, isl_dim_param)) {
742 pw = FN(PW,align_params)(pw, isl_set_get_space(context));
743 context = isl_set_align_params(context, FN(PW,get_space)(pw));
746 context = isl_set_compute_divs(context);
747 hull = isl_set_simple_hull(isl_set_copy(context));
753 for (i = pw->n - 1; i >= 0; --i) {
754 pw->p[i].set = isl_set_intersect(pw->p[i].set,
755 isl_set_copy(context));
758 pw->p[i].FIELD = FN(EL,gist)(pw->p[i].FIELD,
759 isl_set_copy(pw->p[i].set));
760 pw->p[i].set = isl_set_gist_basic_set(pw->p[i].set,
761 isl_basic_set_copy(hull));
764 if (isl_set_plain_is_empty(pw->p[i].set)) {
765 isl_set_free(pw->p[i].set);
766 FN(EL,free)(pw->p[i].FIELD);
768 pw->p[i] = pw->p[pw->n - 1];
773 isl_basic_set_free(hull);
774 isl_set_free(context);
779 isl_basic_set_free(hull);
780 isl_set_free(context);
784 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
786 return FN(PW,align_params_pw_set_and)(pw, context, &FN(PW,gist_aligned));
789 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
798 for (i = pw->n - 1; i >= 0; --i) {
799 for (j = i - 1; j >= 0; --j) {
800 if (!FN(EL,plain_is_equal)(pw->p[i].FIELD,
803 pw->p[j].set = isl_set_union(pw->p[j].set,
805 FN(EL,free)(pw->p[i].FIELD);
807 pw->p[i] = pw->p[pw->n - 1];
813 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
824 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
826 return pw ? isl_space_get_ctx(pw->dim) : NULL;
829 #ifndef NO_INVOLVES_DIMS
830 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
831 unsigned first, unsigned n)
834 enum isl_dim_type set_type;
838 if (pw->n == 0 || n == 0)
841 set_type = type == isl_dim_in ? isl_dim_set : type;
843 for (i = 0; i < pw->n; ++i) {
844 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
846 if (involves < 0 || involves)
848 involves = isl_set_involves_dims(pw->p[i].set,
850 if (involves < 0 || involves)
857 __isl_give PW *FN(PW,set_dim_name)(__isl_take PW *pw,
858 enum isl_dim_type type, unsigned pos, const char *s)
861 enum isl_dim_type set_type;
867 set_type = type == isl_dim_in ? isl_dim_set : type;
869 pw->dim = isl_space_set_dim_name(pw->dim, type, pos, s);
873 for (i = 0; i < pw->n; ++i) {
874 pw->p[i].set = isl_set_set_dim_name(pw->p[i].set,
878 pw->p[i].FIELD = FN(EL,set_dim_name)(pw->p[i].FIELD, type, pos, s);
890 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
891 enum isl_dim_type type, unsigned first, unsigned n)
894 enum isl_dim_type set_type;
898 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
901 set_type = type == isl_dim_in ? isl_dim_set : type;
906 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
909 for (i = 0; i < pw->n; ++i) {
910 pw->p[i].set = isl_set_drop(pw->p[i].set, set_type, first, n);
913 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
924 /* This function is very similar to drop_dims.
925 * The only difference is that the cells may still involve
926 * the specified dimensions. They are removed using
927 * isl_set_project_out instead of isl_set_drop.
929 __isl_give PW *FN(PW,project_out)(__isl_take PW *pw,
930 enum isl_dim_type type, unsigned first, unsigned n)
933 enum isl_dim_type set_type;
937 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
940 set_type = type == isl_dim_in ? isl_dim_set : type;
945 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
948 for (i = 0; i < pw->n; ++i) {
949 pw->p[i].set = isl_set_project_out(pw->p[i].set,
953 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
964 /* Project the domain of pw onto its parameter space.
966 __isl_give PW *FN(PW,project_domain_on_params)(__isl_take PW *pw)
971 n = FN(PW,dim)(pw, isl_dim_in);
972 pw = FN(PW,project_out)(pw, isl_dim_in, 0, n);
973 space = FN(PW,get_domain_space)(pw);
974 space = isl_space_params(space);
975 pw = FN(PW,reset_domain_space)(pw, space);
980 #ifndef NO_INSERT_DIMS
981 __isl_give PW *FN(PW,insert_dims)(__isl_take PW *pw, enum isl_dim_type type,
982 unsigned first, unsigned n)
985 enum isl_dim_type set_type;
989 if (n == 0 && !isl_space_is_named_or_nested(pw->dim, type))
992 set_type = type == isl_dim_in ? isl_dim_set : type;
998 pw->dim = isl_space_insert_dims(pw->dim, type, first, n);
1002 for (i = 0; i < pw->n; ++i) {
1003 pw->p[i].set = isl_set_insert_dims(pw->p[i].set,
1004 set_type, first, n);
1007 pw->p[i].FIELD = FN(EL,insert_dims)(pw->p[i].FIELD,
1009 if (!pw->p[i].FIELD)
1020 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
1021 enum isl_dim_type type, unsigned pos, isl_int v)
1028 if (type == isl_dim_in)
1031 pw = FN(PW,cow)(pw);
1034 for (i = 0; i < pw->n; ++i) {
1035 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
1046 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
1048 return pw ? isl_space_dim(pw->dim, type) : 0;
1051 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
1052 enum isl_dim_type type, unsigned first, unsigned n)
1061 if (type == isl_dim_in)
1064 pw = FN(PW,cow)(pw);
1069 for (i = 0; i < pw->n; ++i) {
1070 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
1082 /* Compute the maximal value attained by the piecewise quasipolynomial
1083 * on its domain or zero if the domain is empty.
1084 * In the worst case, the domain is scanned completely,
1085 * so the domain is assumed to be bounded.
1087 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
1090 isl_qpolynomial *opt;
1096 isl_space *dim = isl_space_copy(pw->dim);
1098 return isl_qpolynomial_zero_on_domain(isl_space_domain(dim));
1101 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
1102 isl_set_copy(pw->p[0].set), max);
1103 for (i = 1; i < pw->n; ++i) {
1104 isl_qpolynomial *opt_i;
1105 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
1106 isl_set_copy(pw->p[i].set), max);
1108 opt = isl_qpolynomial_max_cst(opt, opt_i);
1110 opt = isl_qpolynomial_min_cst(opt, opt_i);
1117 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
1119 return FN(PW,opt)(pw, 1);
1122 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
1124 return FN(PW,opt)(pw, 0);
1128 __isl_give isl_space *FN(PW,get_space)(__isl_keep PW *pw)
1130 return pw ? isl_space_copy(pw->dim) : NULL;
1133 __isl_give isl_space *FN(PW,get_domain_space)(__isl_keep PW *pw)
1135 return pw ? isl_space_domain(isl_space_copy(pw->dim)) : NULL;
1138 #ifndef NO_RESET_DIM
1139 /* Reset the space of "pw". Since we don't know if the elements
1140 * represent the spaces themselves or their domains, we pass along
1141 * both when we call their reset_space_and_domain.
1143 static __isl_give PW *FN(PW,reset_space_and_domain)(__isl_take PW *pw,
1144 __isl_take isl_space *space, __isl_take isl_space *domain)
1148 pw = FN(PW,cow)(pw);
1149 if (!pw || !space || !domain)
1152 for (i = 0; i < pw->n; ++i) {
1153 pw->p[i].set = isl_set_reset_space(pw->p[i].set,
1154 isl_space_copy(domain));
1157 pw->p[i].FIELD = FN(EL,reset_space_and_domain)(pw->p[i].FIELD,
1158 isl_space_copy(space), isl_space_copy(domain));
1159 if (!pw->p[i].FIELD)
1163 isl_space_free(domain);
1165 isl_space_free(pw->dim);
1170 isl_space_free(domain);
1171 isl_space_free(space);
1176 __isl_give PW *FN(PW,reset_domain_space)(__isl_take PW *pw,
1177 __isl_take isl_space *domain)
1181 space = isl_space_extend_domain_with_range(isl_space_copy(domain),
1182 FN(PW,get_space)(pw));
1183 return FN(PW,reset_space_and_domain)(pw, space, domain);
1186 __isl_give PW *FN(PW,reset_space)(__isl_take PW *pw, __isl_take isl_space *dim)
1190 domain = isl_space_domain(isl_space_copy(dim));
1191 return FN(PW,reset_space_and_domain)(pw, dim, domain);
1194 __isl_give PW *FN(PW,set_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type,
1195 __isl_take isl_id *id)
1199 pw = FN(PW,cow)(pw);
1201 return isl_id_free(id);
1203 space = FN(PW,get_space)(pw);
1204 space = isl_space_set_tuple_id(space, type, id);
1206 return FN(PW,reset_space)(pw, space);
1209 __isl_give PW *FN(PW,set_dim_id)(__isl_take PW *pw,
1210 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
1212 pw = FN(PW,cow)(pw);
1214 return isl_id_free(id);
1215 pw->dim = isl_space_set_dim_id(pw->dim, type, pos, id);
1216 return FN(PW,reset_space)(pw, isl_space_copy(pw->dim));
1220 int FN(PW,has_equal_space)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1225 return isl_space_is_equal(pw1->dim, pw2->dim);
1229 __isl_give PW *FN(PW,morph_domain)(__isl_take PW *pw,
1230 __isl_take isl_morph *morph)
1238 ctx = isl_space_get_ctx(pw->dim);
1239 isl_assert(ctx, isl_space_is_domain(morph->dom->dim, pw->dim),
1242 pw = FN(PW,cow)(pw);
1245 pw->dim = isl_space_extend_domain_with_range(
1246 isl_space_copy(morph->ran->dim), pw->dim);
1250 for (i = 0; i < pw->n; ++i) {
1251 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
1254 pw->p[i].FIELD = FN(EL,morph_domain)(pw->p[i].FIELD,
1255 isl_morph_copy(morph));
1256 if (!pw->p[i].FIELD)
1260 isl_morph_free(morph);
1265 isl_morph_free(morph);
1270 int FN(PW,foreach_piece)(__isl_keep PW *pw,
1271 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
1279 for (i = 0; i < pw->n; ++i)
1280 if (fn(isl_set_copy(pw->p[i].set),
1281 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
1288 static int any_divs(__isl_keep isl_set *set)
1295 for (i = 0; i < set->n; ++i)
1296 if (set->p[i]->n_div > 0)
1302 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
1303 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1304 void *user), void *user)
1311 for (i = 0; i < set->n; ++i) {
1315 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
1316 lift = isl_set_lift(lift);
1318 copy = FN(EL,copy)(el);
1319 copy = FN(EL,lift)(copy, isl_set_get_space(lift));
1321 if (fn(lift, copy, user) < 0)
1335 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
1336 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1337 void *user), void *user)
1344 for (i = 0; i < pw->n; ++i) {
1348 set = isl_set_copy(pw->p[i].set);
1349 el = FN(EL,copy)(pw->p[i].FIELD);
1350 if (!any_divs(set)) {
1351 if (fn(set, el, user) < 0)
1355 if (foreach_lifted_subset(set, el, fn, user) < 0)
1363 #ifndef NO_MOVE_DIMS
1364 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
1365 enum isl_dim_type dst_type, unsigned dst_pos,
1366 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1370 pw = FN(PW,cow)(pw);
1374 pw->dim = isl_space_move_dims(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
1378 for (i = 0; i < pw->n; ++i) {
1379 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
1380 dst_type, dst_pos, src_type, src_pos, n);
1381 if (!pw->p[i].FIELD)
1385 if (dst_type == isl_dim_in)
1386 dst_type = isl_dim_set;
1387 if (src_type == isl_dim_in)
1388 src_type = isl_dim_set;
1390 for (i = 0; i < pw->n; ++i) {
1391 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
1393 src_type, src_pos, n);
1405 __isl_give PW *FN(PW,mul_isl_int)(__isl_take PW *pw, isl_int v)
1409 if (isl_int_is_one(v))
1411 if (pw && isl_int_is_zero(v)) {
1413 isl_space *dim = FN(PW,get_space)(pw);
1415 zero = FN(PW,ZERO)(dim, pw->type);
1417 zero = FN(PW,ZERO)(dim);
1422 pw = FN(PW,cow)(pw);
1429 if (isl_int_is_neg(v))
1430 pw->type = isl_fold_type_negate(pw->type);
1432 for (i = 0; i < pw->n; ++i) {
1433 pw->p[i].FIELD = FN(EL,scale)(pw->p[i].FIELD, v);
1434 if (!pw->p[i].FIELD)
1444 __isl_give PW *FN(PW,scale)(__isl_take PW *pw, isl_int v)
1446 return FN(PW,mul_isl_int)(pw, v);
1449 static int FN(PW,qsort_set_cmp)(const void *p1, const void *p2)
1451 const isl_set *set1 = *(const isl_set **)p1;
1452 const isl_set *set2 = *(const isl_set **)p2;
1454 return isl_set_plain_cmp(set1, set2);
1457 /* We normalize in place, but if anything goes wrong we need
1458 * to return NULL, so we need to make sure we don't change the
1459 * meaning of any possible other copies of map.
1461 __isl_give PW *FN(PW,normalize)(__isl_take PW *pw)
1468 for (i = 0; i < pw->n; ++i) {
1469 set = isl_set_normalize(isl_set_copy(pw->p[i].set));
1471 return FN(PW,free)(pw);
1472 isl_set_free(pw->p[i].set);
1475 qsort(pw->p, pw->n, sizeof(pw->p[0]), &FN(PW,qsort_set_cmp));
1476 for (i = pw->n - 1; i >= 1; --i) {
1477 if (!isl_set_plain_is_equal(pw->p[i - 1].set, pw->p[i].set))
1479 if (!FN(EL,plain_is_equal)(pw->p[i - 1].FIELD, pw->p[i].FIELD))
1481 set = isl_set_union(isl_set_copy(pw->p[i - 1].set),
1482 isl_set_copy(pw->p[i].set));
1484 return FN(PW,free)(pw);
1485 isl_set_free(pw->p[i].set);
1486 FN(EL,free)(pw->p[i].FIELD);
1487 isl_set_free(pw->p[i - 1].set);
1488 pw->p[i - 1].set = set;
1489 for (j = i + 1; j < pw->n; ++j)
1490 pw->p[j - 1] = pw->p[j];
1497 /* Is pw1 obviously equal to pw2?
1498 * That is, do they have obviously identical cells and obviously identical
1499 * elements on each cell?
1501 int FN(PW,plain_is_equal)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1511 if (!isl_space_is_equal(pw1->dim, pw2->dim))
1514 pw1 = FN(PW,copy)(pw1);
1515 pw2 = FN(PW,copy)(pw2);
1516 pw1 = FN(PW,normalize)(pw1);
1517 pw2 = FN(PW,normalize)(pw2);
1521 equal = pw1->n == pw2->n;
1522 for (i = 0; equal && i < pw1->n; ++i) {
1523 equal = isl_set_plain_is_equal(pw1->p[i].set, pw2->p[i].set);
1528 equal = FN(EL,plain_is_equal)(pw1->p[i].FIELD, pw2->p[i].FIELD);