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 const char *FN(PW,get_tuple_name)(__isl_keep PW *pw, enum isl_dim_type type)
184 return pw ? isl_space_get_tuple_name(pw->dim, type) : NULL;
187 int FN(PW,has_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type)
189 return pw ? isl_space_has_tuple_id(pw->dim, type) : -1;
192 __isl_give isl_id *FN(PW,get_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type)
194 return pw ? isl_space_get_tuple_id(pw->dim, type) : NULL;
197 int FN(PW,IS_ZERO)(__isl_keep PW *pw)
206 __isl_give PW *FN(PW,realign_domain)(__isl_take PW *pw,
207 __isl_take isl_reordering *exp)
215 for (i = 0; i < pw->n; ++i) {
216 pw->p[i].set = isl_set_realign(pw->p[i].set,
217 isl_reordering_copy(exp));
220 pw->p[i].FIELD = FN(EL,realign_domain)(pw->p[i].FIELD,
221 isl_reordering_copy(exp));
226 pw = FN(PW,reset_domain_space)(pw, isl_space_copy(exp->dim));
228 isl_reordering_free(exp);
231 isl_reordering_free(exp);
236 /* Align the parameters of "pw" to those of "model".
238 __isl_give PW *FN(PW,align_params)(__isl_take PW *pw, __isl_take isl_space *model)
245 ctx = isl_space_get_ctx(model);
246 if (!isl_space_has_named_params(model))
247 isl_die(ctx, isl_error_invalid,
248 "model has unnamed parameters", goto error);
249 if (!isl_space_has_named_params(pw->dim))
250 isl_die(ctx, isl_error_invalid,
251 "input has unnamed parameters", goto error);
252 if (!isl_space_match(pw->dim, isl_dim_param, model, isl_dim_param)) {
255 model = isl_space_drop_dims(model, isl_dim_in,
256 0, isl_space_dim(model, isl_dim_in));
257 model = isl_space_drop_dims(model, isl_dim_out,
258 0, isl_space_dim(model, isl_dim_out));
259 exp = isl_parameter_alignment_reordering(pw->dim, model);
260 exp = isl_reordering_extend_space(exp,
261 FN(PW,get_domain_space)(pw));
262 pw = FN(PW,realign_domain)(pw, exp);
265 isl_space_free(model);
268 isl_space_free(model);
273 static __isl_give PW *FN(PW,align_params_pw_pw_and)(__isl_take PW *pw1,
275 __isl_give PW *(*fn)(__isl_take PW *pw1, __isl_take PW *pw2))
281 if (isl_space_match(pw1->dim, isl_dim_param, pw2->dim, isl_dim_param))
283 ctx = FN(PW,get_ctx)(pw1);
284 if (!isl_space_has_named_params(pw1->dim) ||
285 !isl_space_has_named_params(pw2->dim))
286 isl_die(ctx, isl_error_invalid,
287 "unaligned unnamed parameters", goto error);
288 pw1 = FN(PW,align_params)(pw1, FN(PW,get_space)(pw2));
289 pw2 = FN(PW,align_params)(pw2, FN(PW,get_space)(pw1));
297 static __isl_give PW *FN(PW,align_params_pw_set_and)(__isl_take PW *pw,
298 __isl_take isl_set *set,
299 __isl_give PW *(*fn)(__isl_take PW *pw, __isl_take isl_set *set))
305 if (isl_space_match(pw->dim, isl_dim_param, set->dim, isl_dim_param))
307 ctx = FN(PW,get_ctx)(pw);
308 if (!isl_space_has_named_params(pw->dim) ||
309 !isl_space_has_named_params(set->dim))
310 isl_die(ctx, isl_error_invalid,
311 "unaligned unnamed parameters", goto error);
312 pw = FN(PW,align_params)(pw, isl_set_get_space(set));
313 set = isl_set_align_params(set, FN(PW,get_space)(pw));
322 static __isl_give PW *FN(PW,add_aligned)(__isl_take PW *pw1, __isl_take PW *pw2)
332 ctx = isl_space_get_ctx(pw1->dim);
334 if (pw1->type != pw2->type)
335 isl_die(ctx, isl_error_invalid,
336 "fold types don't match", goto error);
338 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
340 if (FN(PW,IS_ZERO)(pw1)) {
345 if (FN(PW,IS_ZERO)(pw2)) {
350 n = (pw1->n + 1) * (pw2->n + 1);
352 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n);
354 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n);
357 for (i = 0; i < pw1->n; ++i) {
358 set = isl_set_copy(pw1->p[i].set);
359 for (j = 0; j < pw2->n; ++j) {
360 struct isl_set *common;
362 set = isl_set_subtract(set,
363 isl_set_copy(pw2->p[j].set));
364 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
365 isl_set_copy(pw2->p[j].set));
366 if (isl_set_plain_is_empty(common)) {
367 isl_set_free(common);
371 sum = FN(EL,add_on_domain)(common,
372 FN(EL,copy)(pw1->p[i].FIELD),
373 FN(EL,copy)(pw2->p[j].FIELD));
375 res = FN(PW,add_piece)(res, common, sum);
377 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD));
380 for (j = 0; j < pw2->n; ++j) {
381 set = isl_set_copy(pw2->p[j].set);
382 for (i = 0; i < pw1->n; ++i)
383 set = isl_set_subtract(set,
384 isl_set_copy(pw1->p[i].set));
385 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD));
398 __isl_give PW *FN(PW,add)(__isl_take PW *pw1, __isl_take PW *pw2)
400 return FN(PW,align_params_pw_pw_and)(pw1, pw2, &FN(PW,add_aligned));
403 /* Make sure "pw" has room for at least "n" more pieces.
405 * If there is only one reference to pw, we extend it in place.
406 * Otherwise, we create a new PW and copy the pieces.
408 static __isl_give PW *FN(PW,grow)(__isl_take PW *pw, int n)
416 if (pw->n + n <= pw->size)
418 ctx = FN(PW,get_ctx)(pw);
421 res = isl_realloc(ctx, pw, struct PW,
422 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
424 return FN(PW,free)(pw);
429 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, n);
431 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), n);
434 return FN(PW,free)(pw);
435 for (i = 0; i < pw->n; ++i)
436 res = FN(PW,add_piece)(res, isl_set_copy(pw->p[i].set),
437 FN(EL,copy)(pw->p[i].FIELD));
442 static __isl_give PW *FN(PW,add_disjoint_aligned)(__isl_take PW *pw1,
451 if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n)
452 return FN(PW,add_disjoint_aligned)(pw2, pw1);
454 ctx = isl_space_get_ctx(pw1->dim);
456 if (pw1->type != pw2->type)
457 isl_die(ctx, isl_error_invalid,
458 "fold types don't match", goto error);
460 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
462 if (FN(PW,IS_ZERO)(pw1)) {
467 if (FN(PW,IS_ZERO)(pw2)) {
472 pw1 = FN(PW,grow)(pw1, pw2->n);
476 for (i = 0; i < pw2->n; ++i)
477 pw1 = FN(PW,add_piece)(pw1,
478 isl_set_copy(pw2->p[i].set),
479 FN(EL,copy)(pw2->p[i].FIELD));
490 __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2)
492 return FN(PW,align_params_pw_pw_and)(pw1, pw2,
493 &FN(PW,add_disjoint_aligned));
497 __isl_give PW *FN(PW,neg)(__isl_take PW *pw)
504 if (FN(PW,IS_ZERO)(pw))
511 for (i = 0; i < pw->n; ++i) {
512 pw->p[i].FIELD = FN(EL,neg)(pw->p[i].FIELD);
514 return FN(PW,free)(pw);
520 __isl_give PW *FN(PW,sub)(__isl_take PW *pw1, __isl_take PW *pw2)
522 return FN(PW,add)(pw1, FN(PW,neg)(pw2));
527 __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw,
528 __isl_take isl_point *pnt)
533 isl_space *pnt_dim = NULL;
538 ctx = isl_point_get_ctx(pnt);
539 pnt_dim = isl_point_get_space(pnt);
540 isl_assert(ctx, isl_space_is_domain(pnt_dim, pw->dim), goto error);
542 for (i = 0; i < pw->n; ++i) {
543 found = isl_set_contains_point(pw->p[i].set, pnt);
550 qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
551 isl_point_copy(pnt));
553 qp = isl_qpolynomial_zero_on_domain(FN(PW,get_domain_space)(pw));
555 isl_space_free(pnt_dim);
560 isl_space_free(pnt_dim);
566 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
574 dom = isl_set_empty(FN(PW,get_domain_space)(pw));
575 for (i = 0; i < pw->n; ++i)
576 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
583 static __isl_give PW *FN(PW,intersect_domain_aligned)(__isl_take PW *pw,
584 __isl_take isl_set *set)
600 for (i = pw->n - 1; i >= 0; --i) {
602 pw->p[i].set = isl_set_intersect(pw->p[i].set, isl_set_copy(set));
605 aff = isl_set_affine_hull(isl_set_copy(pw->p[i].set));
606 pw->p[i].FIELD = FN(EL,substitute_equalities)(pw->p[i].FIELD,
608 if (isl_set_plain_is_empty(pw->p[i].set)) {
609 isl_set_free(pw->p[i].set);
610 FN(EL,free)(pw->p[i].FIELD);
612 pw->p[i] = pw->p[pw->n - 1];
625 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw,
626 __isl_take isl_set *context)
628 return FN(PW,align_params_pw_set_and)(pw, context,
629 &FN(PW,intersect_domain_aligned));
632 static __isl_give PW *FN(PW,gist_aligned)(__isl_take PW *pw,
633 __isl_take isl_set *context)
636 isl_basic_set *hull = NULL;
642 isl_set_free(context);
646 if (!isl_space_match(pw->dim, isl_dim_param,
647 context->dim, isl_dim_param)) {
648 pw = FN(PW,align_params)(pw, isl_set_get_space(context));
649 context = isl_set_align_params(context, FN(PW,get_space)(pw));
652 context = isl_set_compute_divs(context);
653 hull = isl_set_simple_hull(isl_set_copy(context));
659 for (i = pw->n - 1; i >= 0; --i) {
660 pw->p[i].set = isl_set_intersect(pw->p[i].set,
661 isl_set_copy(context));
664 pw->p[i].FIELD = FN(EL,gist)(pw->p[i].FIELD,
665 isl_set_copy(pw->p[i].set));
666 pw->p[i].set = isl_set_gist_basic_set(pw->p[i].set,
667 isl_basic_set_copy(hull));
670 if (isl_set_plain_is_empty(pw->p[i].set)) {
671 isl_set_free(pw->p[i].set);
672 FN(EL,free)(pw->p[i].FIELD);
674 pw->p[i] = pw->p[pw->n - 1];
679 isl_basic_set_free(hull);
680 isl_set_free(context);
685 isl_basic_set_free(hull);
686 isl_set_free(context);
690 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
692 return FN(PW,align_params_pw_set_and)(pw, context, &FN(PW,gist_aligned));
695 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
704 for (i = pw->n - 1; i >= 0; --i) {
705 for (j = i - 1; j >= 0; --j) {
706 if (!FN(EL,plain_is_equal)(pw->p[i].FIELD,
709 pw->p[j].set = isl_set_union(pw->p[j].set,
711 FN(EL,free)(pw->p[i].FIELD);
713 pw->p[i] = pw->p[pw->n - 1];
719 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
730 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
732 return pw ? isl_space_get_ctx(pw->dim) : NULL;
735 #ifndef NO_INVOLVES_DIMS
736 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
737 unsigned first, unsigned n)
740 enum isl_dim_type set_type;
744 if (pw->n == 0 || n == 0)
747 set_type = type == isl_dim_in ? isl_dim_set : type;
749 for (i = 0; i < pw->n; ++i) {
750 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
752 if (involves < 0 || involves)
754 involves = isl_set_involves_dims(pw->p[i].set,
756 if (involves < 0 || involves)
763 __isl_give PW *FN(PW,set_dim_name)(__isl_take PW *pw,
764 enum isl_dim_type type, unsigned pos, const char *s)
767 enum isl_dim_type set_type;
773 set_type = type == isl_dim_in ? isl_dim_set : type;
775 pw->dim = isl_space_set_dim_name(pw->dim, type, pos, s);
779 for (i = 0; i < pw->n; ++i) {
780 pw->p[i].set = isl_set_set_dim_name(pw->p[i].set,
784 pw->p[i].FIELD = FN(EL,set_dim_name)(pw->p[i].FIELD, type, pos, s);
796 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
797 enum isl_dim_type type, unsigned first, unsigned n)
800 enum isl_dim_type set_type;
804 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
807 set_type = type == isl_dim_in ? isl_dim_set : type;
812 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
815 for (i = 0; i < pw->n; ++i) {
816 pw->p[i].set = isl_set_drop(pw->p[i].set, set_type, first, n);
819 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
830 /* This function is very similar to drop_dims.
831 * The only difference is that the cells may still involve
832 * the specified dimensions. They are removed using
833 * isl_set_project_out instead of isl_set_drop.
835 __isl_give PW *FN(PW,project_out)(__isl_take PW *pw,
836 enum isl_dim_type type, unsigned first, unsigned n)
839 enum isl_dim_type set_type;
843 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
846 set_type = type == isl_dim_in ? isl_dim_set : type;
851 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
854 for (i = 0; i < pw->n; ++i) {
855 pw->p[i].set = isl_set_project_out(pw->p[i].set,
859 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
870 /* Project the domain of pw onto its parameter space.
872 __isl_give PW *FN(PW,project_domain_on_params)(__isl_take PW *pw)
877 n = FN(PW,dim)(pw, isl_dim_in);
878 pw = FN(PW,project_out)(pw, isl_dim_in, 0, n);
879 space = FN(PW,get_domain_space)(pw);
880 space = isl_space_params(space);
881 pw = FN(PW,reset_domain_space)(pw, space);
886 #ifndef NO_INSERT_DIMS
887 __isl_give PW *FN(PW,insert_dims)(__isl_take PW *pw, enum isl_dim_type type,
888 unsigned first, unsigned n)
891 enum isl_dim_type set_type;
895 if (n == 0 && !isl_space_is_named_or_nested(pw->dim, type))
898 set_type = type == isl_dim_in ? isl_dim_set : type;
904 pw->dim = isl_space_insert_dims(pw->dim, type, first, n);
908 for (i = 0; i < pw->n; ++i) {
909 pw->p[i].set = isl_set_insert_dims(pw->p[i].set,
913 pw->p[i].FIELD = FN(EL,insert_dims)(pw->p[i].FIELD,
926 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
927 enum isl_dim_type type, unsigned pos, isl_int v)
934 if (type == isl_dim_in)
940 for (i = 0; i < pw->n; ++i) {
941 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
952 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
954 return pw ? isl_space_dim(pw->dim, type) : 0;
957 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
958 enum isl_dim_type type, unsigned first, unsigned n)
967 if (type == isl_dim_in)
975 for (i = 0; i < pw->n; ++i) {
976 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
988 /* Compute the maximal value attained by the piecewise quasipolynomial
989 * on its domain or zero if the domain is empty.
990 * In the worst case, the domain is scanned completely,
991 * so the domain is assumed to be bounded.
993 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
996 isl_qpolynomial *opt;
1002 isl_space *dim = isl_space_copy(pw->dim);
1004 return isl_qpolynomial_zero_on_domain(dim);
1007 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
1008 isl_set_copy(pw->p[0].set), max);
1009 for (i = 1; i < pw->n; ++i) {
1010 isl_qpolynomial *opt_i;
1011 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
1012 isl_set_copy(pw->p[i].set), max);
1014 opt = isl_qpolynomial_max_cst(opt, opt_i);
1016 opt = isl_qpolynomial_min_cst(opt, opt_i);
1023 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
1025 return FN(PW,opt)(pw, 1);
1028 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
1030 return FN(PW,opt)(pw, 0);
1034 __isl_give isl_space *FN(PW,get_space)(__isl_keep PW *pw)
1036 return pw ? isl_space_copy(pw->dim) : NULL;
1039 __isl_give isl_space *FN(PW,get_domain_space)(__isl_keep PW *pw)
1041 return pw ? isl_space_domain(isl_space_copy(pw->dim)) : NULL;
1044 #ifndef NO_RESET_DIM
1045 /* Reset the space of "pw". Since we don't know if the elements
1046 * represent the spaces themselves or their domains, we pass along
1047 * both when we call their reset_space_and_domain.
1049 static __isl_give PW *FN(PW,reset_space_and_domain)(__isl_take PW *pw,
1050 __isl_take isl_space *space, __isl_take isl_space *domain)
1054 pw = FN(PW,cow)(pw);
1055 if (!pw || !space || !domain)
1058 for (i = 0; i < pw->n; ++i) {
1059 pw->p[i].set = isl_set_reset_space(pw->p[i].set,
1060 isl_space_copy(domain));
1063 pw->p[i].FIELD = FN(EL,reset_space_and_domain)(pw->p[i].FIELD,
1064 isl_space_copy(space), isl_space_copy(domain));
1065 if (!pw->p[i].FIELD)
1069 isl_space_free(domain);
1071 isl_space_free(pw->dim);
1076 isl_space_free(domain);
1077 isl_space_free(space);
1082 __isl_give PW *FN(PW,reset_domain_space)(__isl_take PW *pw,
1083 __isl_take isl_space *domain)
1087 space = isl_space_extend_domain_with_range(isl_space_copy(domain),
1088 FN(PW,get_space)(pw));
1089 return FN(PW,reset_space_and_domain)(pw, space, domain);
1092 __isl_give PW *FN(PW,reset_space)(__isl_take PW *pw, __isl_take isl_space *dim)
1096 domain = isl_space_domain(isl_space_copy(dim));
1097 return FN(PW,reset_space_and_domain)(pw, dim, domain);
1100 __isl_give PW *FN(PW,set_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type,
1101 __isl_take isl_id *id)
1105 pw = FN(PW,cow)(pw);
1107 return isl_id_free(id);
1109 space = FN(PW,get_space)(pw);
1110 space = isl_space_set_tuple_id(space, type, id);
1112 return FN(PW,reset_space)(pw, space);
1115 __isl_give PW *FN(PW,set_dim_id)(__isl_take PW *pw,
1116 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
1118 pw = FN(PW,cow)(pw);
1120 return isl_id_free(id);
1121 pw->dim = isl_space_set_dim_id(pw->dim, type, pos, id);
1122 return FN(PW,reset_space)(pw, isl_space_copy(pw->dim));
1126 int FN(PW,has_equal_space)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1131 return isl_space_is_equal(pw1->dim, pw2->dim);
1135 __isl_give PW *FN(PW,morph_domain)(__isl_take PW *pw,
1136 __isl_take isl_morph *morph)
1144 ctx = isl_space_get_ctx(pw->dim);
1145 isl_assert(ctx, isl_space_is_domain(morph->dom->dim, pw->dim),
1148 pw = FN(PW,cow)(pw);
1151 pw->dim = isl_space_extend_domain_with_range(
1152 isl_space_copy(morph->ran->dim), pw->dim);
1156 for (i = 0; i < pw->n; ++i) {
1157 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
1160 pw->p[i].FIELD = FN(EL,morph_domain)(pw->p[i].FIELD,
1161 isl_morph_copy(morph));
1162 if (!pw->p[i].FIELD)
1166 isl_morph_free(morph);
1171 isl_morph_free(morph);
1176 int FN(PW,foreach_piece)(__isl_keep PW *pw,
1177 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
1185 for (i = 0; i < pw->n; ++i)
1186 if (fn(isl_set_copy(pw->p[i].set),
1187 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
1194 static int any_divs(__isl_keep isl_set *set)
1201 for (i = 0; i < set->n; ++i)
1202 if (set->p[i]->n_div > 0)
1208 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
1209 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1210 void *user), void *user)
1217 for (i = 0; i < set->n; ++i) {
1221 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
1222 lift = isl_set_lift(lift);
1224 copy = FN(EL,copy)(el);
1225 copy = FN(EL,lift)(copy, isl_set_get_space(lift));
1227 if (fn(lift, copy, user) < 0)
1241 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
1242 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1243 void *user), void *user)
1250 for (i = 0; i < pw->n; ++i) {
1254 set = isl_set_copy(pw->p[i].set);
1255 el = FN(EL,copy)(pw->p[i].FIELD);
1256 if (!any_divs(set)) {
1257 if (fn(set, el, user) < 0)
1261 if (foreach_lifted_subset(set, el, fn, user) < 0)
1269 #ifndef NO_MOVE_DIMS
1270 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
1271 enum isl_dim_type dst_type, unsigned dst_pos,
1272 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1276 pw = FN(PW,cow)(pw);
1280 pw->dim = isl_space_move_dims(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
1284 for (i = 0; i < pw->n; ++i) {
1285 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
1286 dst_type, dst_pos, src_type, src_pos, n);
1287 if (!pw->p[i].FIELD)
1291 if (dst_type == isl_dim_in)
1292 dst_type = isl_dim_set;
1293 if (src_type == isl_dim_in)
1294 src_type = isl_dim_set;
1296 for (i = 0; i < pw->n; ++i) {
1297 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
1299 src_type, src_pos, n);
1311 __isl_give PW *FN(PW,mul_isl_int)(__isl_take PW *pw, isl_int v)
1315 if (isl_int_is_one(v))
1317 if (pw && isl_int_is_zero(v)) {
1319 isl_space *dim = FN(PW,get_space)(pw);
1321 zero = FN(PW,ZERO)(dim, pw->type);
1323 zero = FN(PW,ZERO)(dim);
1328 pw = FN(PW,cow)(pw);
1335 if (isl_int_is_neg(v))
1336 pw->type = isl_fold_type_negate(pw->type);
1338 for (i = 0; i < pw->n; ++i) {
1339 pw->p[i].FIELD = FN(EL,scale)(pw->p[i].FIELD, v);
1340 if (!pw->p[i].FIELD)
1350 __isl_give PW *FN(PW,scale)(__isl_take PW *pw, isl_int v)
1352 return FN(PW,mul_isl_int)(pw, v);
1355 static int FN(PW,qsort_set_cmp)(const void *p1, const void *p2)
1357 const isl_set *set1 = *(const isl_set **)p1;
1358 const isl_set *set2 = *(const isl_set **)p2;
1360 return isl_set_plain_cmp(set1, set2);
1363 /* We normalize in place, but if anything goes wrong we need
1364 * to return NULL, so we need to make sure we don't change the
1365 * meaning of any possible other copies of map.
1367 __isl_give PW *FN(PW,normalize)(__isl_take PW *pw)
1374 for (i = 0; i < pw->n; ++i) {
1375 set = isl_set_normalize(isl_set_copy(pw->p[i].set));
1377 return FN(PW,free)(pw);
1378 isl_set_free(pw->p[i].set);
1381 qsort(pw->p, pw->n, sizeof(pw->p[0]), &FN(PW,qsort_set_cmp));
1382 for (i = pw->n - 1; i >= 1; --i) {
1383 if (!isl_set_plain_is_equal(pw->p[i - 1].set, pw->p[i].set))
1385 if (!FN(EL,plain_is_equal)(pw->p[i - 1].FIELD, pw->p[i].FIELD))
1387 set = isl_set_union(isl_set_copy(pw->p[i - 1].set),
1388 isl_set_copy(pw->p[i].set));
1390 return FN(PW,free)(pw);
1391 isl_set_free(pw->p[i].set);
1392 FN(EL,free)(pw->p[i].FIELD);
1393 isl_set_free(pw->p[i - 1].set);
1394 pw->p[i - 1].set = set;
1395 for (j = i + 1; j < pw->n; ++j)
1396 pw->p[j - 1] = pw->p[j];
1403 /* Is pw1 obviously equal to pw2?
1404 * That is, do they have obviously identical cells and obviously identical
1405 * elements on each cell?
1407 int FN(PW,plain_is_equal)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1417 if (!isl_space_is_equal(pw1->dim, pw2->dim))
1420 pw1 = FN(PW,copy)(pw1);
1421 pw2 = FN(PW,copy)(pw2);
1422 pw1 = FN(PW,normalize)(pw1);
1423 pw2 = FN(PW,normalize)(pw2);
1427 equal = pw1->n == pw2->n;
1428 for (i = 0; equal && i < pw1->n; ++i) {
1429 equal = isl_set_plain_is_equal(pw1->p[i].set, pw2->p[i].set);
1434 equal = FN(EL,plain_is_equal)(pw1->p[i].FIELD, pw2->p[i].FIELD);