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,add_aligned)(__isl_take PW *pw1, __isl_take PW *pw2)
338 ctx = isl_space_get_ctx(pw1->dim);
340 if (pw1->type != pw2->type)
341 isl_die(ctx, isl_error_invalid,
342 "fold types don't match", goto error);
344 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
346 if (FN(PW,IS_ZERO)(pw1)) {
351 if (FN(PW,IS_ZERO)(pw2)) {
356 n = (pw1->n + 1) * (pw2->n + 1);
358 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n);
360 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n);
363 for (i = 0; i < pw1->n; ++i) {
364 set = isl_set_copy(pw1->p[i].set);
365 for (j = 0; j < pw2->n; ++j) {
366 struct isl_set *common;
368 set = isl_set_subtract(set,
369 isl_set_copy(pw2->p[j].set));
370 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
371 isl_set_copy(pw2->p[j].set));
372 if (isl_set_plain_is_empty(common)) {
373 isl_set_free(common);
377 sum = FN(EL,add_on_domain)(common,
378 FN(EL,copy)(pw1->p[i].FIELD),
379 FN(EL,copy)(pw2->p[j].FIELD));
381 res = FN(PW,add_piece)(res, common, sum);
383 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD));
386 for (j = 0; j < pw2->n; ++j) {
387 set = isl_set_copy(pw2->p[j].set);
388 for (i = 0; i < pw1->n; ++i)
389 set = isl_set_subtract(set,
390 isl_set_copy(pw1->p[i].set));
391 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD));
404 __isl_give PW *FN(PW,add)(__isl_take PW *pw1, __isl_take PW *pw2)
406 return FN(PW,align_params_pw_pw_and)(pw1, pw2, &FN(PW,add_aligned));
409 /* Make sure "pw" has room for at least "n" more pieces.
411 * If there is only one reference to pw, we extend it in place.
412 * Otherwise, we create a new PW and copy the pieces.
414 static __isl_give PW *FN(PW,grow)(__isl_take PW *pw, int n)
422 if (pw->n + n <= pw->size)
424 ctx = FN(PW,get_ctx)(pw);
427 res = isl_realloc(ctx, pw, struct PW,
428 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
430 return FN(PW,free)(pw);
435 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, n);
437 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), n);
440 return FN(PW,free)(pw);
441 for (i = 0; i < pw->n; ++i)
442 res = FN(PW,add_piece)(res, isl_set_copy(pw->p[i].set),
443 FN(EL,copy)(pw->p[i].FIELD));
448 static __isl_give PW *FN(PW,add_disjoint_aligned)(__isl_take PW *pw1,
457 if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n)
458 return FN(PW,add_disjoint_aligned)(pw2, pw1);
460 ctx = isl_space_get_ctx(pw1->dim);
462 if (pw1->type != pw2->type)
463 isl_die(ctx, isl_error_invalid,
464 "fold types don't match", goto error);
466 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
468 if (FN(PW,IS_ZERO)(pw1)) {
473 if (FN(PW,IS_ZERO)(pw2)) {
478 pw1 = FN(PW,grow)(pw1, pw2->n);
482 for (i = 0; i < pw2->n; ++i)
483 pw1 = FN(PW,add_piece)(pw1,
484 isl_set_copy(pw2->p[i].set),
485 FN(EL,copy)(pw2->p[i].FIELD));
496 __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2)
498 return FN(PW,align_params_pw_pw_and)(pw1, pw2,
499 &FN(PW,add_disjoint_aligned));
502 /* This function is currently only used from isl_aff.c
504 static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1,
506 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
507 __attribute__ ((unused));
509 /* Apply "fn" to pairs of elements from pw1 and pw2 on shared domains.
511 static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1,
513 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
523 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n);
525 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n);
528 for (i = 0; i < pw1->n; ++i) {
529 for (j = 0; j < pw2->n; ++j) {
532 common = isl_set_intersect(
533 isl_set_copy(pw1->p[i].set),
534 isl_set_copy(pw2->p[j].set));
535 if (isl_set_plain_is_empty(common)) {
536 isl_set_free(common);
540 res_ij = fn(FN(EL,copy)(pw1->p[i].FIELD),
541 FN(EL,copy)(pw2->p[j].FIELD));
543 res = FN(PW,add_piece)(res, common, res_ij);
557 __isl_give PW *FN(PW,neg)(__isl_take PW *pw)
564 if (FN(PW,IS_ZERO)(pw))
571 for (i = 0; i < pw->n; ++i) {
572 pw->p[i].FIELD = FN(EL,neg)(pw->p[i].FIELD);
574 return FN(PW,free)(pw);
580 __isl_give PW *FN(PW,sub)(__isl_take PW *pw1, __isl_take PW *pw2)
582 return FN(PW,add)(pw1, FN(PW,neg)(pw2));
587 __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw,
588 __isl_take isl_point *pnt)
593 isl_space *pnt_dim = NULL;
598 ctx = isl_point_get_ctx(pnt);
599 pnt_dim = isl_point_get_space(pnt);
600 isl_assert(ctx, isl_space_is_domain(pnt_dim, pw->dim), goto error);
602 for (i = 0; i < pw->n; ++i) {
603 found = isl_set_contains_point(pw->p[i].set, pnt);
610 qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
611 isl_point_copy(pnt));
613 qp = isl_qpolynomial_zero_on_domain(FN(PW,get_domain_space)(pw));
615 isl_space_free(pnt_dim);
620 isl_space_free(pnt_dim);
626 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
634 dom = isl_set_empty(FN(PW,get_domain_space)(pw));
635 for (i = 0; i < pw->n; ++i)
636 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
643 static __isl_give PW *FN(PW,intersect_domain_aligned)(__isl_take PW *pw,
644 __isl_take isl_set *set)
660 for (i = pw->n - 1; i >= 0; --i) {
662 pw->p[i].set = isl_set_intersect(pw->p[i].set, isl_set_copy(set));
665 aff = isl_set_affine_hull(isl_set_copy(pw->p[i].set));
666 pw->p[i].FIELD = FN(EL,substitute_equalities)(pw->p[i].FIELD,
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];
687 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw,
688 __isl_take isl_set *context)
690 return FN(PW,align_params_pw_set_and)(pw, context,
691 &FN(PW,intersect_domain_aligned));
694 static __isl_give PW *FN(PW,gist_aligned)(__isl_take PW *pw,
695 __isl_take isl_set *context)
698 isl_basic_set *hull = NULL;
704 isl_set_free(context);
708 if (!isl_space_match(pw->dim, isl_dim_param,
709 context->dim, isl_dim_param)) {
710 pw = FN(PW,align_params)(pw, isl_set_get_space(context));
711 context = isl_set_align_params(context, FN(PW,get_space)(pw));
714 context = isl_set_compute_divs(context);
715 hull = isl_set_simple_hull(isl_set_copy(context));
721 for (i = pw->n - 1; i >= 0; --i) {
722 pw->p[i].set = isl_set_intersect(pw->p[i].set,
723 isl_set_copy(context));
726 pw->p[i].FIELD = FN(EL,gist)(pw->p[i].FIELD,
727 isl_set_copy(pw->p[i].set));
728 pw->p[i].set = isl_set_gist_basic_set(pw->p[i].set,
729 isl_basic_set_copy(hull));
732 if (isl_set_plain_is_empty(pw->p[i].set)) {
733 isl_set_free(pw->p[i].set);
734 FN(EL,free)(pw->p[i].FIELD);
736 pw->p[i] = pw->p[pw->n - 1];
741 isl_basic_set_free(hull);
742 isl_set_free(context);
747 isl_basic_set_free(hull);
748 isl_set_free(context);
752 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
754 return FN(PW,align_params_pw_set_and)(pw, context, &FN(PW,gist_aligned));
757 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
766 for (i = pw->n - 1; i >= 0; --i) {
767 for (j = i - 1; j >= 0; --j) {
768 if (!FN(EL,plain_is_equal)(pw->p[i].FIELD,
771 pw->p[j].set = isl_set_union(pw->p[j].set,
773 FN(EL,free)(pw->p[i].FIELD);
775 pw->p[i] = pw->p[pw->n - 1];
781 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
792 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
794 return pw ? isl_space_get_ctx(pw->dim) : NULL;
797 #ifndef NO_INVOLVES_DIMS
798 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
799 unsigned first, unsigned n)
802 enum isl_dim_type set_type;
806 if (pw->n == 0 || n == 0)
809 set_type = type == isl_dim_in ? isl_dim_set : type;
811 for (i = 0; i < pw->n; ++i) {
812 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
814 if (involves < 0 || involves)
816 involves = isl_set_involves_dims(pw->p[i].set,
818 if (involves < 0 || involves)
825 __isl_give PW *FN(PW,set_dim_name)(__isl_take PW *pw,
826 enum isl_dim_type type, unsigned pos, const char *s)
829 enum isl_dim_type set_type;
835 set_type = type == isl_dim_in ? isl_dim_set : type;
837 pw->dim = isl_space_set_dim_name(pw->dim, type, pos, s);
841 for (i = 0; i < pw->n; ++i) {
842 pw->p[i].set = isl_set_set_dim_name(pw->p[i].set,
846 pw->p[i].FIELD = FN(EL,set_dim_name)(pw->p[i].FIELD, type, pos, s);
858 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
859 enum isl_dim_type type, unsigned first, unsigned n)
862 enum isl_dim_type set_type;
866 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
869 set_type = type == isl_dim_in ? isl_dim_set : type;
874 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
877 for (i = 0; i < pw->n; ++i) {
878 pw->p[i].set = isl_set_drop(pw->p[i].set, set_type, first, n);
881 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
892 /* This function is very similar to drop_dims.
893 * The only difference is that the cells may still involve
894 * the specified dimensions. They are removed using
895 * isl_set_project_out instead of isl_set_drop.
897 __isl_give PW *FN(PW,project_out)(__isl_take PW *pw,
898 enum isl_dim_type type, unsigned first, unsigned n)
901 enum isl_dim_type set_type;
905 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
908 set_type = type == isl_dim_in ? isl_dim_set : type;
913 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
916 for (i = 0; i < pw->n; ++i) {
917 pw->p[i].set = isl_set_project_out(pw->p[i].set,
921 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
932 /* Project the domain of pw onto its parameter space.
934 __isl_give PW *FN(PW,project_domain_on_params)(__isl_take PW *pw)
939 n = FN(PW,dim)(pw, isl_dim_in);
940 pw = FN(PW,project_out)(pw, isl_dim_in, 0, n);
941 space = FN(PW,get_domain_space)(pw);
942 space = isl_space_params(space);
943 pw = FN(PW,reset_domain_space)(pw, space);
948 #ifndef NO_INSERT_DIMS
949 __isl_give PW *FN(PW,insert_dims)(__isl_take PW *pw, enum isl_dim_type type,
950 unsigned first, unsigned n)
953 enum isl_dim_type set_type;
957 if (n == 0 && !isl_space_is_named_or_nested(pw->dim, type))
960 set_type = type == isl_dim_in ? isl_dim_set : type;
966 pw->dim = isl_space_insert_dims(pw->dim, type, first, n);
970 for (i = 0; i < pw->n; ++i) {
971 pw->p[i].set = isl_set_insert_dims(pw->p[i].set,
975 pw->p[i].FIELD = FN(EL,insert_dims)(pw->p[i].FIELD,
988 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
989 enum isl_dim_type type, unsigned pos, isl_int v)
996 if (type == isl_dim_in)
1002 for (i = 0; i < pw->n; ++i) {
1003 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
1014 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
1016 return pw ? isl_space_dim(pw->dim, type) : 0;
1019 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
1020 enum isl_dim_type type, unsigned first, unsigned n)
1029 if (type == isl_dim_in)
1032 pw = FN(PW,cow)(pw);
1037 for (i = 0; i < pw->n; ++i) {
1038 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
1050 /* Compute the maximal value attained by the piecewise quasipolynomial
1051 * on its domain or zero if the domain is empty.
1052 * In the worst case, the domain is scanned completely,
1053 * so the domain is assumed to be bounded.
1055 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
1058 isl_qpolynomial *opt;
1064 isl_space *dim = isl_space_copy(pw->dim);
1066 return isl_qpolynomial_zero_on_domain(dim);
1069 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
1070 isl_set_copy(pw->p[0].set), max);
1071 for (i = 1; i < pw->n; ++i) {
1072 isl_qpolynomial *opt_i;
1073 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
1074 isl_set_copy(pw->p[i].set), max);
1076 opt = isl_qpolynomial_max_cst(opt, opt_i);
1078 opt = isl_qpolynomial_min_cst(opt, opt_i);
1085 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
1087 return FN(PW,opt)(pw, 1);
1090 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
1092 return FN(PW,opt)(pw, 0);
1096 __isl_give isl_space *FN(PW,get_space)(__isl_keep PW *pw)
1098 return pw ? isl_space_copy(pw->dim) : NULL;
1101 __isl_give isl_space *FN(PW,get_domain_space)(__isl_keep PW *pw)
1103 return pw ? isl_space_domain(isl_space_copy(pw->dim)) : NULL;
1106 #ifndef NO_RESET_DIM
1107 /* Reset the space of "pw". Since we don't know if the elements
1108 * represent the spaces themselves or their domains, we pass along
1109 * both when we call their reset_space_and_domain.
1111 static __isl_give PW *FN(PW,reset_space_and_domain)(__isl_take PW *pw,
1112 __isl_take isl_space *space, __isl_take isl_space *domain)
1116 pw = FN(PW,cow)(pw);
1117 if (!pw || !space || !domain)
1120 for (i = 0; i < pw->n; ++i) {
1121 pw->p[i].set = isl_set_reset_space(pw->p[i].set,
1122 isl_space_copy(domain));
1125 pw->p[i].FIELD = FN(EL,reset_space_and_domain)(pw->p[i].FIELD,
1126 isl_space_copy(space), isl_space_copy(domain));
1127 if (!pw->p[i].FIELD)
1131 isl_space_free(domain);
1133 isl_space_free(pw->dim);
1138 isl_space_free(domain);
1139 isl_space_free(space);
1144 __isl_give PW *FN(PW,reset_domain_space)(__isl_take PW *pw,
1145 __isl_take isl_space *domain)
1149 space = isl_space_extend_domain_with_range(isl_space_copy(domain),
1150 FN(PW,get_space)(pw));
1151 return FN(PW,reset_space_and_domain)(pw, space, domain);
1154 __isl_give PW *FN(PW,reset_space)(__isl_take PW *pw, __isl_take isl_space *dim)
1158 domain = isl_space_domain(isl_space_copy(dim));
1159 return FN(PW,reset_space_and_domain)(pw, dim, domain);
1162 __isl_give PW *FN(PW,set_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type,
1163 __isl_take isl_id *id)
1167 pw = FN(PW,cow)(pw);
1169 return isl_id_free(id);
1171 space = FN(PW,get_space)(pw);
1172 space = isl_space_set_tuple_id(space, type, id);
1174 return FN(PW,reset_space)(pw, space);
1177 __isl_give PW *FN(PW,set_dim_id)(__isl_take PW *pw,
1178 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
1180 pw = FN(PW,cow)(pw);
1182 return isl_id_free(id);
1183 pw->dim = isl_space_set_dim_id(pw->dim, type, pos, id);
1184 return FN(PW,reset_space)(pw, isl_space_copy(pw->dim));
1188 int FN(PW,has_equal_space)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1193 return isl_space_is_equal(pw1->dim, pw2->dim);
1197 __isl_give PW *FN(PW,morph_domain)(__isl_take PW *pw,
1198 __isl_take isl_morph *morph)
1206 ctx = isl_space_get_ctx(pw->dim);
1207 isl_assert(ctx, isl_space_is_domain(morph->dom->dim, pw->dim),
1210 pw = FN(PW,cow)(pw);
1213 pw->dim = isl_space_extend_domain_with_range(
1214 isl_space_copy(morph->ran->dim), pw->dim);
1218 for (i = 0; i < pw->n; ++i) {
1219 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
1222 pw->p[i].FIELD = FN(EL,morph_domain)(pw->p[i].FIELD,
1223 isl_morph_copy(morph));
1224 if (!pw->p[i].FIELD)
1228 isl_morph_free(morph);
1233 isl_morph_free(morph);
1238 int FN(PW,foreach_piece)(__isl_keep PW *pw,
1239 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
1247 for (i = 0; i < pw->n; ++i)
1248 if (fn(isl_set_copy(pw->p[i].set),
1249 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
1256 static int any_divs(__isl_keep isl_set *set)
1263 for (i = 0; i < set->n; ++i)
1264 if (set->p[i]->n_div > 0)
1270 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
1271 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1272 void *user), void *user)
1279 for (i = 0; i < set->n; ++i) {
1283 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
1284 lift = isl_set_lift(lift);
1286 copy = FN(EL,copy)(el);
1287 copy = FN(EL,lift)(copy, isl_set_get_space(lift));
1289 if (fn(lift, copy, user) < 0)
1303 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
1304 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1305 void *user), void *user)
1312 for (i = 0; i < pw->n; ++i) {
1316 set = isl_set_copy(pw->p[i].set);
1317 el = FN(EL,copy)(pw->p[i].FIELD);
1318 if (!any_divs(set)) {
1319 if (fn(set, el, user) < 0)
1323 if (foreach_lifted_subset(set, el, fn, user) < 0)
1331 #ifndef NO_MOVE_DIMS
1332 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
1333 enum isl_dim_type dst_type, unsigned dst_pos,
1334 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1338 pw = FN(PW,cow)(pw);
1342 pw->dim = isl_space_move_dims(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
1346 for (i = 0; i < pw->n; ++i) {
1347 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
1348 dst_type, dst_pos, src_type, src_pos, n);
1349 if (!pw->p[i].FIELD)
1353 if (dst_type == isl_dim_in)
1354 dst_type = isl_dim_set;
1355 if (src_type == isl_dim_in)
1356 src_type = isl_dim_set;
1358 for (i = 0; i < pw->n; ++i) {
1359 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
1361 src_type, src_pos, n);
1373 __isl_give PW *FN(PW,mul_isl_int)(__isl_take PW *pw, isl_int v)
1377 if (isl_int_is_one(v))
1379 if (pw && isl_int_is_zero(v)) {
1381 isl_space *dim = FN(PW,get_space)(pw);
1383 zero = FN(PW,ZERO)(dim, pw->type);
1385 zero = FN(PW,ZERO)(dim);
1390 pw = FN(PW,cow)(pw);
1397 if (isl_int_is_neg(v))
1398 pw->type = isl_fold_type_negate(pw->type);
1400 for (i = 0; i < pw->n; ++i) {
1401 pw->p[i].FIELD = FN(EL,scale)(pw->p[i].FIELD, v);
1402 if (!pw->p[i].FIELD)
1412 __isl_give PW *FN(PW,scale)(__isl_take PW *pw, isl_int v)
1414 return FN(PW,mul_isl_int)(pw, v);
1417 static int FN(PW,qsort_set_cmp)(const void *p1, const void *p2)
1419 const isl_set *set1 = *(const isl_set **)p1;
1420 const isl_set *set2 = *(const isl_set **)p2;
1422 return isl_set_plain_cmp(set1, set2);
1425 /* We normalize in place, but if anything goes wrong we need
1426 * to return NULL, so we need to make sure we don't change the
1427 * meaning of any possible other copies of map.
1429 __isl_give PW *FN(PW,normalize)(__isl_take PW *pw)
1436 for (i = 0; i < pw->n; ++i) {
1437 set = isl_set_normalize(isl_set_copy(pw->p[i].set));
1439 return FN(PW,free)(pw);
1440 isl_set_free(pw->p[i].set);
1443 qsort(pw->p, pw->n, sizeof(pw->p[0]), &FN(PW,qsort_set_cmp));
1444 for (i = pw->n - 1; i >= 1; --i) {
1445 if (!isl_set_plain_is_equal(pw->p[i - 1].set, pw->p[i].set))
1447 if (!FN(EL,plain_is_equal)(pw->p[i - 1].FIELD, pw->p[i].FIELD))
1449 set = isl_set_union(isl_set_copy(pw->p[i - 1].set),
1450 isl_set_copy(pw->p[i].set));
1452 return FN(PW,free)(pw);
1453 isl_set_free(pw->p[i].set);
1454 FN(EL,free)(pw->p[i].FIELD);
1455 isl_set_free(pw->p[i - 1].set);
1456 pw->p[i - 1].set = set;
1457 for (j = i + 1; j < pw->n; ++j)
1458 pw->p[j - 1] = pw->p[j];
1465 /* Is pw1 obviously equal to pw2?
1466 * That is, do they have obviously identical cells and obviously identical
1467 * elements on each cell?
1469 int FN(PW,plain_is_equal)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1479 if (!isl_space_is_equal(pw1->dim, pw2->dim))
1482 pw1 = FN(PW,copy)(pw1);
1483 pw2 = FN(PW,copy)(pw2);
1484 pw1 = FN(PW,normalize)(pw1);
1485 pw2 = FN(PW,normalize)(pw2);
1489 equal = pw1->n == pw2->n;
1490 for (i = 0; equal && i < pw1->n; ++i) {
1491 equal = isl_set_plain_is_equal(pw1->p[i].set, pw2->p[i].set);
1496 equal = FN(EL,plain_is_equal)(pw1->p[i].FIELD, pw2->p[i].FIELD);