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 int FN(PW,IS_ZERO)(__isl_keep PW *pw)
185 __isl_give PW *FN(PW,realign_domain)(__isl_take PW *pw,
186 __isl_take isl_reordering *exp)
194 for (i = 0; i < pw->n; ++i) {
195 pw->p[i].set = isl_set_realign(pw->p[i].set,
196 isl_reordering_copy(exp));
199 pw->p[i].FIELD = FN(EL,realign_domain)(pw->p[i].FIELD,
200 isl_reordering_copy(exp));
205 pw = FN(PW,reset_domain_space)(pw, isl_space_copy(exp->dim));
207 isl_reordering_free(exp);
210 isl_reordering_free(exp);
215 /* Align the parameters of "pw" to those of "model".
217 __isl_give PW *FN(PW,align_params)(__isl_take PW *pw, __isl_take isl_space *model)
224 ctx = isl_space_get_ctx(model);
225 if (!isl_space_has_named_params(model))
226 isl_die(ctx, isl_error_invalid,
227 "model has unnamed parameters", goto error);
228 if (!isl_space_has_named_params(pw->dim))
229 isl_die(ctx, isl_error_invalid,
230 "input has unnamed parameters", goto error);
231 if (!isl_space_match(pw->dim, isl_dim_param, model, isl_dim_param)) {
234 model = isl_space_drop_dims(model, isl_dim_in,
235 0, isl_space_dim(model, isl_dim_in));
236 model = isl_space_drop_dims(model, isl_dim_out,
237 0, isl_space_dim(model, isl_dim_out));
238 exp = isl_parameter_alignment_reordering(pw->dim, model);
239 exp = isl_reordering_extend_space(exp,
240 FN(PW,get_domain_space)(pw));
241 pw = FN(PW,realign_domain)(pw, exp);
244 isl_space_free(model);
247 isl_space_free(model);
252 static __isl_give PW *FN(PW,align_params_pw_pw_and)(__isl_take PW *pw1,
254 __isl_give PW *(*fn)(__isl_take PW *pw1, __isl_take PW *pw2))
260 if (isl_space_match(pw1->dim, isl_dim_param, pw2->dim, isl_dim_param))
262 ctx = FN(PW,get_ctx)(pw1);
263 if (!isl_space_has_named_params(pw1->dim) ||
264 !isl_space_has_named_params(pw2->dim))
265 isl_die(ctx, isl_error_invalid,
266 "unaligned unnamed parameters", goto error);
267 pw1 = FN(PW,align_params)(pw1, FN(PW,get_space)(pw2));
268 pw2 = FN(PW,align_params)(pw2, FN(PW,get_space)(pw1));
276 static __isl_give PW *FN(PW,align_params_pw_set_and)(__isl_take PW *pw,
277 __isl_take isl_set *set,
278 __isl_give PW *(*fn)(__isl_take PW *pw, __isl_take isl_set *set))
284 if (isl_space_match(pw->dim, isl_dim_param, set->dim, isl_dim_param))
286 ctx = FN(PW,get_ctx)(pw);
287 if (!isl_space_has_named_params(pw->dim) ||
288 !isl_space_has_named_params(set->dim))
289 isl_die(ctx, isl_error_invalid,
290 "unaligned unnamed parameters", goto error);
291 pw = FN(PW,align_params)(pw, isl_set_get_space(set));
292 set = isl_set_align_params(set, FN(PW,get_space)(pw));
301 static __isl_give PW *FN(PW,add_aligned)(__isl_take PW *pw1, __isl_take PW *pw2)
311 ctx = isl_space_get_ctx(pw1->dim);
313 if (pw1->type != pw2->type)
314 isl_die(ctx, isl_error_invalid,
315 "fold types don't match", goto error);
317 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
319 if (FN(PW,IS_ZERO)(pw1)) {
324 if (FN(PW,IS_ZERO)(pw2)) {
329 n = (pw1->n + 1) * (pw2->n + 1);
331 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n);
333 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n);
336 for (i = 0; i < pw1->n; ++i) {
337 set = isl_set_copy(pw1->p[i].set);
338 for (j = 0; j < pw2->n; ++j) {
339 struct isl_set *common;
341 set = isl_set_subtract(set,
342 isl_set_copy(pw2->p[j].set));
343 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
344 isl_set_copy(pw2->p[j].set));
345 if (isl_set_plain_is_empty(common)) {
346 isl_set_free(common);
350 sum = FN(EL,add_on_domain)(common,
351 FN(EL,copy)(pw1->p[i].FIELD),
352 FN(EL,copy)(pw2->p[j].FIELD));
354 res = FN(PW,add_piece)(res, common, sum);
356 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD));
359 for (j = 0; j < pw2->n; ++j) {
360 set = isl_set_copy(pw2->p[j].set);
361 for (i = 0; i < pw1->n; ++i)
362 set = isl_set_subtract(set,
363 isl_set_copy(pw1->p[i].set));
364 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD));
377 __isl_give PW *FN(PW,add)(__isl_take PW *pw1, __isl_take PW *pw2)
379 return FN(PW,align_params_pw_pw_and)(pw1, pw2, &FN(PW,add_aligned));
382 /* Make sure "pw" has room for at least "n" more pieces.
384 * If there is only one reference to pw, we extend it in place.
385 * Otherwise, we create a new PW and copy the pieces.
387 static __isl_give PW *FN(PW,grow)(__isl_take PW *pw, int n)
395 if (pw->n + n <= pw->size)
397 ctx = FN(PW,get_ctx)(pw);
400 res = isl_realloc(ctx, pw, struct PW,
401 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
403 return FN(PW,free)(pw);
408 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, n);
410 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), n);
413 return FN(PW,free)(pw);
414 for (i = 0; i < pw->n; ++i)
415 res = FN(PW,add_piece)(res, isl_set_copy(pw->p[i].set),
416 FN(EL,copy)(pw->p[i].FIELD));
421 static __isl_give PW *FN(PW,add_disjoint_aligned)(__isl_take PW *pw1,
430 if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n)
431 return FN(PW,add_disjoint_aligned)(pw2, pw1);
433 ctx = isl_space_get_ctx(pw1->dim);
435 if (pw1->type != pw2->type)
436 isl_die(ctx, isl_error_invalid,
437 "fold types don't match", goto error);
439 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
441 if (FN(PW,IS_ZERO)(pw1)) {
446 if (FN(PW,IS_ZERO)(pw2)) {
451 pw1 = FN(PW,grow)(pw1, pw2->n);
455 for (i = 0; i < pw2->n; ++i)
456 pw1 = FN(PW,add_piece)(pw1,
457 isl_set_copy(pw2->p[i].set),
458 FN(EL,copy)(pw2->p[i].FIELD));
469 __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2)
471 return FN(PW,align_params_pw_pw_and)(pw1, pw2,
472 &FN(PW,add_disjoint_aligned));
476 __isl_give PW *FN(PW,neg)(__isl_take PW *pw)
483 if (FN(PW,IS_ZERO)(pw))
490 for (i = 0; i < pw->n; ++i) {
491 pw->p[i].FIELD = FN(EL,neg)(pw->p[i].FIELD);
493 return FN(PW,free)(pw);
499 __isl_give PW *FN(PW,sub)(__isl_take PW *pw1, __isl_take PW *pw2)
501 return FN(PW,add)(pw1, FN(PW,neg)(pw2));
506 __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw,
507 __isl_take isl_point *pnt)
512 isl_space *pnt_dim = NULL;
517 ctx = isl_point_get_ctx(pnt);
518 pnt_dim = isl_point_get_space(pnt);
519 isl_assert(ctx, isl_space_is_domain(pnt_dim, pw->dim), goto error);
521 for (i = 0; i < pw->n; ++i) {
522 found = isl_set_contains_point(pw->p[i].set, pnt);
529 qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
530 isl_point_copy(pnt));
532 qp = isl_qpolynomial_zero_on_domain(FN(PW,get_domain_space)(pw));
534 isl_space_free(pnt_dim);
539 isl_space_free(pnt_dim);
545 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
553 dom = isl_set_empty(FN(PW,get_domain_space)(pw));
554 for (i = 0; i < pw->n; ++i)
555 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
562 static __isl_give PW *FN(PW,intersect_domain_aligned)(__isl_take PW *pw,
563 __isl_take isl_set *set)
579 for (i = pw->n - 1; i >= 0; --i) {
581 pw->p[i].set = isl_set_intersect(pw->p[i].set, isl_set_copy(set));
584 aff = isl_set_affine_hull(isl_set_copy(pw->p[i].set));
585 pw->p[i].FIELD = FN(EL,substitute_equalities)(pw->p[i].FIELD,
587 if (isl_set_plain_is_empty(pw->p[i].set)) {
588 isl_set_free(pw->p[i].set);
589 FN(EL,free)(pw->p[i].FIELD);
591 pw->p[i] = pw->p[pw->n - 1];
604 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw,
605 __isl_take isl_set *context)
607 return FN(PW,align_params_pw_set_and)(pw, context,
608 &FN(PW,intersect_domain_aligned));
611 static __isl_give PW *FN(PW,gist_aligned)(__isl_take PW *pw,
612 __isl_take isl_set *context)
615 isl_basic_set *hull = NULL;
621 isl_set_free(context);
625 if (!isl_space_match(pw->dim, isl_dim_param,
626 context->dim, isl_dim_param)) {
627 pw = FN(PW,align_params)(pw, isl_set_get_space(context));
628 context = isl_set_align_params(context, FN(PW,get_space)(pw));
631 context = isl_set_compute_divs(context);
632 hull = isl_set_simple_hull(isl_set_copy(context));
638 for (i = pw->n - 1; i >= 0; --i) {
639 pw->p[i].set = isl_set_intersect(pw->p[i].set,
640 isl_set_copy(context));
643 pw->p[i].FIELD = FN(EL,gist)(pw->p[i].FIELD,
644 isl_set_copy(pw->p[i].set));
645 pw->p[i].set = isl_set_gist_basic_set(pw->p[i].set,
646 isl_basic_set_copy(hull));
649 if (isl_set_plain_is_empty(pw->p[i].set)) {
650 isl_set_free(pw->p[i].set);
651 FN(EL,free)(pw->p[i].FIELD);
653 pw->p[i] = pw->p[pw->n - 1];
658 isl_basic_set_free(hull);
659 isl_set_free(context);
664 isl_basic_set_free(hull);
665 isl_set_free(context);
669 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
671 return FN(PW,align_params_pw_set_and)(pw, context, &FN(PW,gist_aligned));
674 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
683 for (i = pw->n - 1; i >= 0; --i) {
684 for (j = i - 1; j >= 0; --j) {
685 if (!FN(EL,plain_is_equal)(pw->p[i].FIELD,
688 pw->p[j].set = isl_set_union(pw->p[j].set,
690 FN(EL,free)(pw->p[i].FIELD);
692 pw->p[i] = pw->p[pw->n - 1];
698 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
709 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
711 return pw ? isl_space_get_ctx(pw->dim) : NULL;
714 #ifndef NO_INVOLVES_DIMS
715 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
716 unsigned first, unsigned n)
719 enum isl_dim_type set_type;
723 if (pw->n == 0 || n == 0)
726 set_type = type == isl_dim_in ? isl_dim_set : type;
728 for (i = 0; i < pw->n; ++i) {
729 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
731 if (involves < 0 || involves)
733 involves = isl_set_involves_dims(pw->p[i].set,
735 if (involves < 0 || involves)
742 __isl_give PW *FN(PW,set_dim_name)(__isl_take PW *pw,
743 enum isl_dim_type type, unsigned pos, const char *s)
746 enum isl_dim_type set_type;
752 set_type = type == isl_dim_in ? isl_dim_set : type;
754 pw->dim = isl_space_set_dim_name(pw->dim, type, pos, s);
758 for (i = 0; i < pw->n; ++i) {
759 pw->p[i].set = isl_set_set_dim_name(pw->p[i].set,
763 pw->p[i].FIELD = FN(EL,set_dim_name)(pw->p[i].FIELD, type, pos, s);
775 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
776 enum isl_dim_type type, unsigned first, unsigned n)
779 enum isl_dim_type set_type;
783 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
786 set_type = type == isl_dim_in ? isl_dim_set : type;
791 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
794 for (i = 0; i < pw->n; ++i) {
795 pw->p[i].set = isl_set_drop(pw->p[i].set, set_type, first, n);
798 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
809 /* This function is very similar to drop_dims.
810 * The only difference is that the cells may still involve
811 * the specified dimensions. They are removed using
812 * isl_set_project_out instead of isl_set_drop.
814 __isl_give PW *FN(PW,project_out)(__isl_take PW *pw,
815 enum isl_dim_type type, unsigned first, unsigned n)
818 enum isl_dim_type set_type;
822 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
825 set_type = type == isl_dim_in ? isl_dim_set : type;
830 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
833 for (i = 0; i < pw->n; ++i) {
834 pw->p[i].set = isl_set_project_out(pw->p[i].set,
838 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
849 /* Project the domain of pw onto its parameter space.
851 __isl_give PW *FN(PW,project_domain_on_params)(__isl_take PW *pw)
856 n = FN(PW,dim)(pw, isl_dim_in);
857 pw = FN(PW,project_out)(pw, isl_dim_in, 0, n);
858 space = FN(PW,get_domain_space)(pw);
859 space = isl_space_params(space);
860 pw = FN(PW,reset_domain_space)(pw, space);
865 #ifndef NO_INSERT_DIMS
866 __isl_give PW *FN(PW,insert_dims)(__isl_take PW *pw, enum isl_dim_type type,
867 unsigned first, unsigned n)
870 enum isl_dim_type set_type;
874 if (n == 0 && !isl_space_is_named_or_nested(pw->dim, type))
877 set_type = type == isl_dim_in ? isl_dim_set : type;
883 pw->dim = isl_space_insert_dims(pw->dim, type, first, n);
887 for (i = 0; i < pw->n; ++i) {
888 pw->p[i].set = isl_set_insert_dims(pw->p[i].set,
892 pw->p[i].FIELD = FN(EL,insert_dims)(pw->p[i].FIELD,
905 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
906 enum isl_dim_type type, unsigned pos, isl_int v)
913 if (type == isl_dim_in)
919 for (i = 0; i < pw->n; ++i) {
920 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
931 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
933 return pw ? isl_space_dim(pw->dim, type) : 0;
936 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
937 enum isl_dim_type type, unsigned first, unsigned n)
946 if (type == isl_dim_in)
954 for (i = 0; i < pw->n; ++i) {
955 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
967 /* Compute the maximal value attained by the piecewise quasipolynomial
968 * on its domain or zero if the domain is empty.
969 * In the worst case, the domain is scanned completely,
970 * so the domain is assumed to be bounded.
972 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
975 isl_qpolynomial *opt;
981 isl_space *dim = isl_space_copy(pw->dim);
983 return isl_qpolynomial_zero_on_domain(dim);
986 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
987 isl_set_copy(pw->p[0].set), max);
988 for (i = 1; i < pw->n; ++i) {
989 isl_qpolynomial *opt_i;
990 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
991 isl_set_copy(pw->p[i].set), max);
993 opt = isl_qpolynomial_max_cst(opt, opt_i);
995 opt = isl_qpolynomial_min_cst(opt, opt_i);
1002 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
1004 return FN(PW,opt)(pw, 1);
1007 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
1009 return FN(PW,opt)(pw, 0);
1013 __isl_give isl_space *FN(PW,get_space)(__isl_keep PW *pw)
1015 return pw ? isl_space_copy(pw->dim) : NULL;
1018 __isl_give isl_space *FN(PW,get_domain_space)(__isl_keep PW *pw)
1020 return pw ? isl_space_domain(isl_space_copy(pw->dim)) : NULL;
1023 #ifndef NO_RESET_DIM
1024 /* Reset the space of "pw". Since we don't know if the elements
1025 * represent the spaces themselves or their domains, we pass along
1026 * both when we call their reset_space_and_domain.
1028 static __isl_give PW *FN(PW,reset_space_and_domain)(__isl_take PW *pw,
1029 __isl_take isl_space *space, __isl_take isl_space *domain)
1033 pw = FN(PW,cow)(pw);
1034 if (!pw || !space || !domain)
1037 for (i = 0; i < pw->n; ++i) {
1038 pw->p[i].set = isl_set_reset_space(pw->p[i].set,
1039 isl_space_copy(domain));
1042 pw->p[i].FIELD = FN(EL,reset_space_and_domain)(pw->p[i].FIELD,
1043 isl_space_copy(space), isl_space_copy(domain));
1044 if (!pw->p[i].FIELD)
1048 isl_space_free(domain);
1050 isl_space_free(pw->dim);
1055 isl_space_free(domain);
1056 isl_space_free(space);
1061 __isl_give PW *FN(PW,reset_domain_space)(__isl_take PW *pw,
1062 __isl_take isl_space *domain)
1066 space = isl_space_extend_domain_with_range(isl_space_copy(domain),
1067 FN(PW,get_space)(pw));
1068 return FN(PW,reset_space_and_domain)(pw, space, domain);
1071 __isl_give PW *FN(PW,reset_space)(__isl_take PW *pw, __isl_take isl_space *dim)
1075 domain = isl_space_domain(isl_space_copy(dim));
1076 return FN(PW,reset_space_and_domain)(pw, dim, domain);
1079 __isl_give PW *FN(PW,set_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type,
1080 __isl_take isl_id *id)
1084 pw = FN(PW,cow)(pw);
1086 return isl_id_free(id);
1088 space = FN(PW,get_space)(pw);
1089 space = isl_space_set_tuple_id(space, type, id);
1091 return FN(PW,reset_space)(pw, space);
1095 int FN(PW,has_equal_space)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1100 return isl_space_is_equal(pw1->dim, pw2->dim);
1104 __isl_give PW *FN(PW,morph_domain)(__isl_take PW *pw,
1105 __isl_take isl_morph *morph)
1113 ctx = isl_space_get_ctx(pw->dim);
1114 isl_assert(ctx, isl_space_is_domain(morph->dom->dim, pw->dim),
1117 pw = FN(PW,cow)(pw);
1120 pw->dim = isl_space_extend_domain_with_range(
1121 isl_space_copy(morph->ran->dim), pw->dim);
1125 for (i = 0; i < pw->n; ++i) {
1126 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
1129 pw->p[i].FIELD = FN(EL,morph_domain)(pw->p[i].FIELD,
1130 isl_morph_copy(morph));
1131 if (!pw->p[i].FIELD)
1135 isl_morph_free(morph);
1140 isl_morph_free(morph);
1145 int FN(PW,foreach_piece)(__isl_keep PW *pw,
1146 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
1154 for (i = 0; i < pw->n; ++i)
1155 if (fn(isl_set_copy(pw->p[i].set),
1156 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
1163 static int any_divs(__isl_keep isl_set *set)
1170 for (i = 0; i < set->n; ++i)
1171 if (set->p[i]->n_div > 0)
1177 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
1178 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1179 void *user), void *user)
1186 for (i = 0; i < set->n; ++i) {
1190 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
1191 lift = isl_set_lift(lift);
1193 copy = FN(EL,copy)(el);
1194 copy = FN(EL,lift)(copy, isl_set_get_space(lift));
1196 if (fn(lift, copy, user) < 0)
1210 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
1211 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1212 void *user), void *user)
1219 for (i = 0; i < pw->n; ++i) {
1223 set = isl_set_copy(pw->p[i].set);
1224 el = FN(EL,copy)(pw->p[i].FIELD);
1225 if (!any_divs(set)) {
1226 if (fn(set, el, user) < 0)
1230 if (foreach_lifted_subset(set, el, fn, user) < 0)
1238 #ifndef NO_MOVE_DIMS
1239 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
1240 enum isl_dim_type dst_type, unsigned dst_pos,
1241 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1245 pw = FN(PW,cow)(pw);
1249 pw->dim = isl_space_move_dims(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
1253 for (i = 0; i < pw->n; ++i) {
1254 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
1255 dst_type, dst_pos, src_type, src_pos, n);
1256 if (!pw->p[i].FIELD)
1260 if (dst_type == isl_dim_in)
1261 dst_type = isl_dim_set;
1262 if (src_type == isl_dim_in)
1263 src_type = isl_dim_set;
1265 for (i = 0; i < pw->n; ++i) {
1266 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
1268 src_type, src_pos, n);
1280 __isl_give PW *FN(PW,mul_isl_int)(__isl_take PW *pw, isl_int v)
1284 if (isl_int_is_one(v))
1286 if (pw && isl_int_is_zero(v)) {
1288 isl_space *dim = FN(PW,get_space)(pw);
1290 zero = FN(PW,ZERO)(dim, pw->type);
1292 zero = FN(PW,ZERO)(dim);
1297 pw = FN(PW,cow)(pw);
1304 if (isl_int_is_neg(v))
1305 pw->type = isl_fold_type_negate(pw->type);
1307 for (i = 0; i < pw->n; ++i) {
1308 pw->p[i].FIELD = FN(EL,scale)(pw->p[i].FIELD, v);
1309 if (!pw->p[i].FIELD)
1319 __isl_give PW *FN(PW,scale)(__isl_take PW *pw, isl_int v)
1321 return FN(PW,mul_isl_int)(pw, v);
1324 static int FN(PW,qsort_set_cmp)(const void *p1, const void *p2)
1326 const isl_set *set1 = *(const isl_set **)p1;
1327 const isl_set *set2 = *(const isl_set **)p2;
1329 return isl_set_plain_cmp(set1, set2);
1332 /* We normalize in place, but if anything goes wrong we need
1333 * to return NULL, so we need to make sure we don't change the
1334 * meaning of any possible other copies of map.
1336 __isl_give PW *FN(PW,normalize)(__isl_take PW *pw)
1343 for (i = 0; i < pw->n; ++i) {
1344 set = isl_set_normalize(isl_set_copy(pw->p[i].set));
1346 return FN(PW,free)(pw);
1347 isl_set_free(pw->p[i].set);
1350 qsort(pw->p, pw->n, sizeof(pw->p[0]), &FN(PW,qsort_set_cmp));
1351 for (i = pw->n - 1; i >= 1; --i) {
1352 if (!isl_set_plain_is_equal(pw->p[i - 1].set, pw->p[i].set))
1354 if (!FN(EL,plain_is_equal)(pw->p[i - 1].FIELD, pw->p[i].FIELD))
1356 set = isl_set_union(isl_set_copy(pw->p[i - 1].set),
1357 isl_set_copy(pw->p[i].set));
1359 return FN(PW,free)(pw);
1360 isl_set_free(pw->p[i].set);
1361 FN(EL,free)(pw->p[i].FIELD);
1362 isl_set_free(pw->p[i - 1].set);
1363 pw->p[i - 1].set = set;
1364 for (j = i + 1; j < pw->n; ++j)
1365 pw->p[j - 1] = pw->p[j];
1372 /* Is pw1 obviously equal to pw2?
1373 * That is, do they have obviously identical cells and obviously identical
1374 * elements on each cell?
1376 int FN(PW,plain_is_equal)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1386 if (!isl_space_is_equal(pw1->dim, pw2->dim))
1389 pw1 = FN(PW,copy)(pw1);
1390 pw2 = FN(PW,copy)(pw2);
1391 pw1 = FN(PW,normalize)(pw1);
1392 pw2 = FN(PW,normalize)(pw2);
1396 equal = pw1->n == pw2->n;
1397 for (i = 0; equal && i < pw1->n; ++i) {
1398 equal = isl_set_plain_is_equal(pw1->p[i].set, pw2->p[i].set);
1403 equal = FN(EL,plain_is_equal)(pw1->p[i].FIELD, pw2->p[i].FIELD);