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 int FN(PW,has_dim_id)(__isl_keep PW *pw, enum isl_dim_type type, unsigned pos)
184 return pw ? isl_space_has_dim_id(pw->dim, type, pos) : -1;
187 __isl_give isl_id *FN(PW,get_dim_id)(__isl_keep PW *pw, enum isl_dim_type type,
190 return pw ? isl_space_get_dim_id(pw->dim, type, pos) : NULL;
193 const char *FN(PW,get_tuple_name)(__isl_keep PW *pw, enum isl_dim_type type)
195 return pw ? isl_space_get_tuple_name(pw->dim, type) : NULL;
198 int FN(PW,has_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type)
200 return pw ? isl_space_has_tuple_id(pw->dim, type) : -1;
203 __isl_give isl_id *FN(PW,get_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type)
205 return pw ? isl_space_get_tuple_id(pw->dim, type) : NULL;
208 int FN(PW,IS_ZERO)(__isl_keep PW *pw)
217 __isl_give PW *FN(PW,realign_domain)(__isl_take PW *pw,
218 __isl_take isl_reordering *exp)
226 for (i = 0; i < pw->n; ++i) {
227 pw->p[i].set = isl_set_realign(pw->p[i].set,
228 isl_reordering_copy(exp));
231 pw->p[i].FIELD = FN(EL,realign_domain)(pw->p[i].FIELD,
232 isl_reordering_copy(exp));
237 pw = FN(PW,reset_domain_space)(pw, isl_space_copy(exp->dim));
239 isl_reordering_free(exp);
242 isl_reordering_free(exp);
247 /* Align the parameters of "pw" to those of "model".
249 __isl_give PW *FN(PW,align_params)(__isl_take PW *pw, __isl_take isl_space *model)
256 ctx = isl_space_get_ctx(model);
257 if (!isl_space_has_named_params(model))
258 isl_die(ctx, isl_error_invalid,
259 "model has unnamed parameters", goto error);
260 if (!isl_space_has_named_params(pw->dim))
261 isl_die(ctx, isl_error_invalid,
262 "input has unnamed parameters", goto error);
263 if (!isl_space_match(pw->dim, isl_dim_param, model, isl_dim_param)) {
266 model = isl_space_drop_dims(model, isl_dim_in,
267 0, isl_space_dim(model, isl_dim_in));
268 model = isl_space_drop_dims(model, isl_dim_out,
269 0, isl_space_dim(model, isl_dim_out));
270 exp = isl_parameter_alignment_reordering(pw->dim, model);
271 exp = isl_reordering_extend_space(exp,
272 FN(PW,get_domain_space)(pw));
273 pw = FN(PW,realign_domain)(pw, exp);
276 isl_space_free(model);
279 isl_space_free(model);
284 static __isl_give PW *FN(PW,align_params_pw_pw_and)(__isl_take PW *pw1,
286 __isl_give PW *(*fn)(__isl_take PW *pw1, __isl_take PW *pw2))
292 if (isl_space_match(pw1->dim, isl_dim_param, pw2->dim, isl_dim_param))
294 ctx = FN(PW,get_ctx)(pw1);
295 if (!isl_space_has_named_params(pw1->dim) ||
296 !isl_space_has_named_params(pw2->dim))
297 isl_die(ctx, isl_error_invalid,
298 "unaligned unnamed parameters", goto error);
299 pw1 = FN(PW,align_params)(pw1, FN(PW,get_space)(pw2));
300 pw2 = FN(PW,align_params)(pw2, FN(PW,get_space)(pw1));
308 static __isl_give PW *FN(PW,align_params_pw_set_and)(__isl_take PW *pw,
309 __isl_take isl_set *set,
310 __isl_give PW *(*fn)(__isl_take PW *pw, __isl_take isl_set *set))
316 if (isl_space_match(pw->dim, isl_dim_param, set->dim, isl_dim_param))
318 ctx = FN(PW,get_ctx)(pw);
319 if (!isl_space_has_named_params(pw->dim) ||
320 !isl_space_has_named_params(set->dim))
321 isl_die(ctx, isl_error_invalid,
322 "unaligned unnamed parameters", goto error);
323 pw = FN(PW,align_params)(pw, isl_set_get_space(set));
324 set = isl_set_align_params(set, FN(PW,get_space)(pw));
333 static __isl_give PW *FN(PW,union_add_aligned)(__isl_take PW *pw1,
344 ctx = isl_space_get_ctx(pw1->dim);
346 if (pw1->type != pw2->type)
347 isl_die(ctx, isl_error_invalid,
348 "fold types don't match", goto error);
350 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
352 if (FN(PW,IS_ZERO)(pw1)) {
357 if (FN(PW,IS_ZERO)(pw2)) {
362 n = (pw1->n + 1) * (pw2->n + 1);
364 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n);
366 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n);
369 for (i = 0; i < pw1->n; ++i) {
370 set = isl_set_copy(pw1->p[i].set);
371 for (j = 0; j < pw2->n; ++j) {
372 struct isl_set *common;
374 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
375 isl_set_copy(pw2->p[j].set));
376 if (isl_set_plain_is_empty(common)) {
377 isl_set_free(common);
380 set = isl_set_subtract(set,
381 isl_set_copy(pw2->p[j].set));
383 sum = FN(EL,add_on_domain)(common,
384 FN(EL,copy)(pw1->p[i].FIELD),
385 FN(EL,copy)(pw2->p[j].FIELD));
387 res = FN(PW,add_piece)(res, common, sum);
389 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD));
392 for (j = 0; j < pw2->n; ++j) {
393 set = isl_set_copy(pw2->p[j].set);
394 for (i = 0; i < pw1->n; ++i)
395 set = isl_set_subtract(set,
396 isl_set_copy(pw1->p[i].set));
397 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD));
410 /* Private version of "union_add". For isl_pw_qpolynomial and
411 * isl_pw_qpolynomial_fold, we prefer to simply call it "add".
413 static __isl_give PW *FN(PW,union_add_)(__isl_take PW *pw1, __isl_take PW *pw2)
415 return FN(PW,align_params_pw_pw_and)(pw1, pw2,
416 &FN(PW,union_add_aligned));
419 /* Make sure "pw" has room for at least "n" more pieces.
421 * If there is only one reference to pw, we extend it in place.
422 * Otherwise, we create a new PW and copy the pieces.
424 static __isl_give PW *FN(PW,grow)(__isl_take PW *pw, int n)
432 if (pw->n + n <= pw->size)
434 ctx = FN(PW,get_ctx)(pw);
437 res = isl_realloc(ctx, pw, struct PW,
438 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
440 return FN(PW,free)(pw);
445 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, n);
447 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), n);
450 return FN(PW,free)(pw);
451 for (i = 0; i < pw->n; ++i)
452 res = FN(PW,add_piece)(res, isl_set_copy(pw->p[i].set),
453 FN(EL,copy)(pw->p[i].FIELD));
458 static __isl_give PW *FN(PW,add_disjoint_aligned)(__isl_take PW *pw1,
467 if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n)
468 return FN(PW,add_disjoint_aligned)(pw2, pw1);
470 ctx = isl_space_get_ctx(pw1->dim);
472 if (pw1->type != pw2->type)
473 isl_die(ctx, isl_error_invalid,
474 "fold types don't match", goto error);
476 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
478 if (FN(PW,IS_ZERO)(pw1)) {
483 if (FN(PW,IS_ZERO)(pw2)) {
488 pw1 = FN(PW,grow)(pw1, pw2->n);
492 for (i = 0; i < pw2->n; ++i)
493 pw1 = FN(PW,add_piece)(pw1,
494 isl_set_copy(pw2->p[i].set),
495 FN(EL,copy)(pw2->p[i].FIELD));
506 __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2)
508 return FN(PW,align_params_pw_pw_and)(pw1, pw2,
509 &FN(PW,add_disjoint_aligned));
512 /* This function is currently only used from isl_aff.c
514 static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1,
516 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
517 __attribute__ ((unused));
519 /* Apply "fn" to pairs of elements from pw1 and pw2 on shared domains.
521 static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1,
523 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
533 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n);
535 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n);
538 for (i = 0; i < pw1->n; ++i) {
539 for (j = 0; j < pw2->n; ++j) {
542 common = isl_set_intersect(
543 isl_set_copy(pw1->p[i].set),
544 isl_set_copy(pw2->p[j].set));
545 if (isl_set_plain_is_empty(common)) {
546 isl_set_free(common);
550 res_ij = fn(FN(EL,copy)(pw1->p[i].FIELD),
551 FN(EL,copy)(pw2->p[j].FIELD));
552 res_ij = FN(EL,gist)(res_ij, isl_set_copy(common));
554 res = FN(PW,add_piece)(res, common, res_ij);
568 __isl_give PW *FN(PW,neg)(__isl_take PW *pw)
575 if (FN(PW,IS_ZERO)(pw))
582 for (i = 0; i < pw->n; ++i) {
583 pw->p[i].FIELD = FN(EL,neg)(pw->p[i].FIELD);
585 return FN(PW,free)(pw);
591 __isl_give PW *FN(PW,sub)(__isl_take PW *pw1, __isl_take PW *pw2)
593 return FN(PW,add)(pw1, FN(PW,neg)(pw2));
598 __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw,
599 __isl_take isl_point *pnt)
604 isl_space *pnt_dim = NULL;
609 ctx = isl_point_get_ctx(pnt);
610 pnt_dim = isl_point_get_space(pnt);
611 isl_assert(ctx, isl_space_is_domain(pnt_dim, pw->dim), goto error);
613 for (i = 0; i < pw->n; ++i) {
614 found = isl_set_contains_point(pw->p[i].set, pnt);
621 qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
622 isl_point_copy(pnt));
624 qp = isl_qpolynomial_zero_on_domain(FN(PW,get_domain_space)(pw));
626 isl_space_free(pnt_dim);
631 isl_space_free(pnt_dim);
637 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
645 dom = isl_set_empty(FN(PW,get_domain_space)(pw));
646 for (i = 0; i < pw->n; ++i)
647 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
654 /* Restrict the domain of "pw" by combining each cell
655 * with "set" through a call to "fn", where "fn" may be
656 * isl_set_intersect or isl_set_intersect_params.
658 static __isl_give PW *FN(PW,intersect_aligned)(__isl_take PW *pw,
659 __isl_take isl_set *set,
660 __isl_give isl_set *(*fn)(__isl_take isl_set *set1,
661 __isl_take isl_set *set2))
677 for (i = pw->n - 1; i >= 0; --i) {
679 pw->p[i].set = fn(pw->p[i].set, isl_set_copy(set));
682 aff = isl_set_affine_hull(isl_set_copy(pw->p[i].set));
683 pw->p[i].FIELD = FN(EL,substitute_equalities)(pw->p[i].FIELD,
687 if (isl_set_plain_is_empty(pw->p[i].set)) {
688 isl_set_free(pw->p[i].set);
689 FN(EL,free)(pw->p[i].FIELD);
691 pw->p[i] = pw->p[pw->n - 1];
704 static __isl_give PW *FN(PW,intersect_domain_aligned)(__isl_take PW *pw,
705 __isl_take isl_set *set)
707 return FN(PW,intersect_aligned)(pw, set, &isl_set_intersect);
710 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw,
711 __isl_take isl_set *context)
713 return FN(PW,align_params_pw_set_and)(pw, context,
714 &FN(PW,intersect_domain_aligned));
717 static __isl_give PW *FN(PW,intersect_params_aligned)(__isl_take PW *pw,
718 __isl_take isl_set *set)
720 return FN(PW,intersect_aligned)(pw, set, &isl_set_intersect_params);
723 /* Intersect the domain of "pw" with the parameter domain "context".
725 __isl_give PW *FN(PW,intersect_params)(__isl_take PW *pw,
726 __isl_take isl_set *context)
728 return FN(PW,align_params_pw_set_and)(pw, context,
729 &FN(PW,intersect_params_aligned));
732 static __isl_give PW *FN(PW,gist_aligned)(__isl_take PW *pw,
733 __isl_take isl_set *context,
734 __isl_give EL *(*fn_el)(__isl_take EL *el,
735 __isl_take isl_set *set),
736 __isl_give isl_set *(*fn_dom)(__isl_take isl_set *set,
737 __isl_take isl_basic_set *bset))
740 isl_basic_set *hull = NULL;
746 isl_set_free(context);
750 if (!isl_space_match(pw->dim, isl_dim_param,
751 context->dim, isl_dim_param)) {
752 pw = FN(PW,align_params)(pw, isl_set_get_space(context));
753 context = isl_set_align_params(context, FN(PW,get_space)(pw));
756 context = isl_set_compute_divs(context);
757 hull = isl_set_simple_hull(isl_set_copy(context));
763 for (i = pw->n - 1; i >= 0; --i) {
764 pw->p[i].set = isl_set_intersect(pw->p[i].set,
765 isl_set_copy(context));
768 pw->p[i].FIELD = fn_el(pw->p[i].FIELD,
769 isl_set_copy(pw->p[i].set));
770 pw->p[i].set = fn_dom(pw->p[i].set, isl_basic_set_copy(hull));
773 if (isl_set_plain_is_empty(pw->p[i].set)) {
774 isl_set_free(pw->p[i].set);
775 FN(EL,free)(pw->p[i].FIELD);
777 pw->p[i] = pw->p[pw->n - 1];
782 isl_basic_set_free(hull);
783 isl_set_free(context);
788 isl_basic_set_free(hull);
789 isl_set_free(context);
793 static __isl_give PW *FN(PW,gist_domain_aligned)(__isl_take PW *pw,
794 __isl_take isl_set *set)
796 return FN(PW,gist_aligned)(pw, set, &FN(EL,gist),
797 &isl_set_gist_basic_set);
800 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
802 return FN(PW,align_params_pw_set_and)(pw, context,
803 &FN(PW,gist_domain_aligned));
806 static __isl_give PW *FN(PW,gist_params_aligned)(__isl_take PW *pw,
807 __isl_take isl_set *set)
809 return FN(PW,gist_aligned)(pw, set, &FN(EL,gist_params),
810 &isl_set_gist_params_basic_set);
813 __isl_give PW *FN(PW,gist_params)(__isl_take PW *pw,
814 __isl_take isl_set *context)
816 return FN(PW,align_params_pw_set_and)(pw, context,
817 &FN(PW,gist_params_aligned));
820 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
829 for (i = pw->n - 1; i >= 0; --i) {
830 for (j = i - 1; j >= 0; --j) {
831 if (!FN(EL,plain_is_equal)(pw->p[i].FIELD,
834 pw->p[j].set = isl_set_union(pw->p[j].set,
836 FN(EL,free)(pw->p[i].FIELD);
838 pw->p[i] = pw->p[pw->n - 1];
844 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
855 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
857 return pw ? isl_space_get_ctx(pw->dim) : NULL;
860 #ifndef NO_INVOLVES_DIMS
861 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
862 unsigned first, unsigned n)
865 enum isl_dim_type set_type;
869 if (pw->n == 0 || n == 0)
872 set_type = type == isl_dim_in ? isl_dim_set : type;
874 for (i = 0; i < pw->n; ++i) {
875 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
877 if (involves < 0 || involves)
879 involves = isl_set_involves_dims(pw->p[i].set,
881 if (involves < 0 || involves)
888 __isl_give PW *FN(PW,set_dim_name)(__isl_take PW *pw,
889 enum isl_dim_type type, unsigned pos, const char *s)
892 enum isl_dim_type set_type;
898 set_type = type == isl_dim_in ? isl_dim_set : type;
900 pw->dim = isl_space_set_dim_name(pw->dim, type, pos, s);
904 for (i = 0; i < pw->n; ++i) {
905 pw->p[i].set = isl_set_set_dim_name(pw->p[i].set,
909 pw->p[i].FIELD = FN(EL,set_dim_name)(pw->p[i].FIELD, type, pos, s);
921 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
922 enum isl_dim_type type, unsigned first, unsigned n)
925 enum isl_dim_type set_type;
929 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
932 set_type = type == isl_dim_in ? isl_dim_set : type;
937 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
940 for (i = 0; i < pw->n; ++i) {
941 pw->p[i].set = isl_set_drop(pw->p[i].set, set_type, first, n);
944 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
955 /* This function is very similar to drop_dims.
956 * The only difference is that the cells may still involve
957 * the specified dimensions. They are removed using
958 * isl_set_project_out instead of isl_set_drop.
960 __isl_give PW *FN(PW,project_out)(__isl_take PW *pw,
961 enum isl_dim_type type, unsigned first, unsigned n)
964 enum isl_dim_type set_type;
968 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
971 set_type = type == isl_dim_in ? isl_dim_set : type;
976 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
979 for (i = 0; i < pw->n; ++i) {
980 pw->p[i].set = isl_set_project_out(pw->p[i].set,
984 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
995 /* Project the domain of pw onto its parameter space.
997 __isl_give PW *FN(PW,project_domain_on_params)(__isl_take PW *pw)
1002 n = FN(PW,dim)(pw, isl_dim_in);
1003 pw = FN(PW,project_out)(pw, isl_dim_in, 0, n);
1004 space = FN(PW,get_domain_space)(pw);
1005 space = isl_space_params(space);
1006 pw = FN(PW,reset_domain_space)(pw, space);
1011 #ifndef NO_INSERT_DIMS
1012 __isl_give PW *FN(PW,insert_dims)(__isl_take PW *pw, enum isl_dim_type type,
1013 unsigned first, unsigned n)
1016 enum isl_dim_type set_type;
1020 if (n == 0 && !isl_space_is_named_or_nested(pw->dim, type))
1023 set_type = type == isl_dim_in ? isl_dim_set : type;
1025 pw = FN(PW,cow)(pw);
1029 pw->dim = isl_space_insert_dims(pw->dim, type, first, n);
1033 for (i = 0; i < pw->n; ++i) {
1034 pw->p[i].set = isl_set_insert_dims(pw->p[i].set,
1035 set_type, first, n);
1038 pw->p[i].FIELD = FN(EL,insert_dims)(pw->p[i].FIELD,
1040 if (!pw->p[i].FIELD)
1051 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
1052 enum isl_dim_type type, unsigned pos, isl_int v)
1059 if (type == isl_dim_in)
1062 pw = FN(PW,cow)(pw);
1065 for (i = 0; i < pw->n; ++i) {
1066 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
1077 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
1079 return pw ? isl_space_dim(pw->dim, type) : 0;
1082 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
1083 enum isl_dim_type type, unsigned first, unsigned n)
1092 if (type == isl_dim_in)
1095 pw = FN(PW,cow)(pw);
1100 for (i = 0; i < pw->n; ++i) {
1101 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
1113 /* Compute the maximal value attained by the piecewise quasipolynomial
1114 * on its domain or zero if the domain is empty.
1115 * In the worst case, the domain is scanned completely,
1116 * so the domain is assumed to be bounded.
1118 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
1121 isl_qpolynomial *opt;
1127 isl_space *dim = isl_space_copy(pw->dim);
1129 return isl_qpolynomial_zero_on_domain(isl_space_domain(dim));
1132 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
1133 isl_set_copy(pw->p[0].set), max);
1134 for (i = 1; i < pw->n; ++i) {
1135 isl_qpolynomial *opt_i;
1136 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
1137 isl_set_copy(pw->p[i].set), max);
1139 opt = isl_qpolynomial_max_cst(opt, opt_i);
1141 opt = isl_qpolynomial_min_cst(opt, opt_i);
1148 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
1150 return FN(PW,opt)(pw, 1);
1153 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
1155 return FN(PW,opt)(pw, 0);
1159 __isl_give isl_space *FN(PW,get_space)(__isl_keep PW *pw)
1161 return pw ? isl_space_copy(pw->dim) : NULL;
1164 __isl_give isl_space *FN(PW,get_domain_space)(__isl_keep PW *pw)
1166 return pw ? isl_space_domain(isl_space_copy(pw->dim)) : NULL;
1169 #ifndef NO_RESET_DIM
1170 /* Reset the space of "pw". Since we don't know if the elements
1171 * represent the spaces themselves or their domains, we pass along
1172 * both when we call their reset_space_and_domain.
1174 static __isl_give PW *FN(PW,reset_space_and_domain)(__isl_take PW *pw,
1175 __isl_take isl_space *space, __isl_take isl_space *domain)
1179 pw = FN(PW,cow)(pw);
1180 if (!pw || !space || !domain)
1183 for (i = 0; i < pw->n; ++i) {
1184 pw->p[i].set = isl_set_reset_space(pw->p[i].set,
1185 isl_space_copy(domain));
1188 pw->p[i].FIELD = FN(EL,reset_space_and_domain)(pw->p[i].FIELD,
1189 isl_space_copy(space), isl_space_copy(domain));
1190 if (!pw->p[i].FIELD)
1194 isl_space_free(domain);
1196 isl_space_free(pw->dim);
1201 isl_space_free(domain);
1202 isl_space_free(space);
1207 __isl_give PW *FN(PW,reset_domain_space)(__isl_take PW *pw,
1208 __isl_take isl_space *domain)
1212 space = isl_space_extend_domain_with_range(isl_space_copy(domain),
1213 FN(PW,get_space)(pw));
1214 return FN(PW,reset_space_and_domain)(pw, space, domain);
1217 __isl_give PW *FN(PW,reset_space)(__isl_take PW *pw, __isl_take isl_space *dim)
1221 domain = isl_space_domain(isl_space_copy(dim));
1222 return FN(PW,reset_space_and_domain)(pw, dim, domain);
1225 __isl_give PW *FN(PW,set_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type,
1226 __isl_take isl_id *id)
1230 pw = FN(PW,cow)(pw);
1232 return isl_id_free(id);
1234 space = FN(PW,get_space)(pw);
1235 space = isl_space_set_tuple_id(space, type, id);
1237 return FN(PW,reset_space)(pw, space);
1240 __isl_give PW *FN(PW,set_dim_id)(__isl_take PW *pw,
1241 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
1243 pw = FN(PW,cow)(pw);
1245 return isl_id_free(id);
1246 pw->dim = isl_space_set_dim_id(pw->dim, type, pos, id);
1247 return FN(PW,reset_space)(pw, isl_space_copy(pw->dim));
1251 int FN(PW,has_equal_space)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1256 return isl_space_is_equal(pw1->dim, pw2->dim);
1260 __isl_give PW *FN(PW,morph_domain)(__isl_take PW *pw,
1261 __isl_take isl_morph *morph)
1269 ctx = isl_space_get_ctx(pw->dim);
1270 isl_assert(ctx, isl_space_is_domain(morph->dom->dim, pw->dim),
1273 pw = FN(PW,cow)(pw);
1276 pw->dim = isl_space_extend_domain_with_range(
1277 isl_space_copy(morph->ran->dim), pw->dim);
1281 for (i = 0; i < pw->n; ++i) {
1282 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
1285 pw->p[i].FIELD = FN(EL,morph_domain)(pw->p[i].FIELD,
1286 isl_morph_copy(morph));
1287 if (!pw->p[i].FIELD)
1291 isl_morph_free(morph);
1296 isl_morph_free(morph);
1301 int FN(PW,foreach_piece)(__isl_keep PW *pw,
1302 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
1310 for (i = 0; i < pw->n; ++i)
1311 if (fn(isl_set_copy(pw->p[i].set),
1312 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
1319 static int any_divs(__isl_keep isl_set *set)
1326 for (i = 0; i < set->n; ++i)
1327 if (set->p[i]->n_div > 0)
1333 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
1334 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1335 void *user), void *user)
1342 for (i = 0; i < set->n; ++i) {
1346 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
1347 lift = isl_set_lift(lift);
1349 copy = FN(EL,copy)(el);
1350 copy = FN(EL,lift)(copy, isl_set_get_space(lift));
1352 if (fn(lift, copy, user) < 0)
1366 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
1367 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1368 void *user), void *user)
1375 for (i = 0; i < pw->n; ++i) {
1379 set = isl_set_copy(pw->p[i].set);
1380 el = FN(EL,copy)(pw->p[i].FIELD);
1381 if (!any_divs(set)) {
1382 if (fn(set, el, user) < 0)
1386 if (foreach_lifted_subset(set, el, fn, user) < 0)
1394 #ifndef NO_MOVE_DIMS
1395 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
1396 enum isl_dim_type dst_type, unsigned dst_pos,
1397 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1401 pw = FN(PW,cow)(pw);
1405 pw->dim = isl_space_move_dims(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
1409 for (i = 0; i < pw->n; ++i) {
1410 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
1411 dst_type, dst_pos, src_type, src_pos, n);
1412 if (!pw->p[i].FIELD)
1416 if (dst_type == isl_dim_in)
1417 dst_type = isl_dim_set;
1418 if (src_type == isl_dim_in)
1419 src_type = isl_dim_set;
1421 for (i = 0; i < pw->n; ++i) {
1422 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
1424 src_type, src_pos, n);
1436 __isl_give PW *FN(PW,mul_isl_int)(__isl_take PW *pw, isl_int v)
1440 if (isl_int_is_one(v))
1442 if (pw && DEFAULT_IS_ZERO && isl_int_is_zero(v)) {
1444 isl_space *dim = FN(PW,get_space)(pw);
1446 zero = FN(PW,ZERO)(dim, pw->type);
1448 zero = FN(PW,ZERO)(dim);
1453 pw = FN(PW,cow)(pw);
1460 if (isl_int_is_neg(v))
1461 pw->type = isl_fold_type_negate(pw->type);
1463 for (i = 0; i < pw->n; ++i) {
1464 pw->p[i].FIELD = FN(EL,scale)(pw->p[i].FIELD, v);
1465 if (!pw->p[i].FIELD)
1475 __isl_give PW *FN(PW,scale)(__isl_take PW *pw, isl_int v)
1477 return FN(PW,mul_isl_int)(pw, v);
1480 static int FN(PW,qsort_set_cmp)(const void *p1, const void *p2)
1482 const isl_set *set1 = *(const isl_set **)p1;
1483 const isl_set *set2 = *(const isl_set **)p2;
1485 return isl_set_plain_cmp(set1, set2);
1488 /* We normalize in place, but if anything goes wrong we need
1489 * to return NULL, so we need to make sure we don't change the
1490 * meaning of any possible other copies of map.
1492 __isl_give PW *FN(PW,normalize)(__isl_take PW *pw)
1499 for (i = 0; i < pw->n; ++i) {
1500 set = isl_set_normalize(isl_set_copy(pw->p[i].set));
1502 return FN(PW,free)(pw);
1503 isl_set_free(pw->p[i].set);
1506 qsort(pw->p, pw->n, sizeof(pw->p[0]), &FN(PW,qsort_set_cmp));
1507 for (i = pw->n - 1; i >= 1; --i) {
1508 if (!isl_set_plain_is_equal(pw->p[i - 1].set, pw->p[i].set))
1510 if (!FN(EL,plain_is_equal)(pw->p[i - 1].FIELD, pw->p[i].FIELD))
1512 set = isl_set_union(isl_set_copy(pw->p[i - 1].set),
1513 isl_set_copy(pw->p[i].set));
1515 return FN(PW,free)(pw);
1516 isl_set_free(pw->p[i].set);
1517 FN(EL,free)(pw->p[i].FIELD);
1518 isl_set_free(pw->p[i - 1].set);
1519 pw->p[i - 1].set = set;
1520 for (j = i + 1; j < pw->n; ++j)
1521 pw->p[j - 1] = pw->p[j];
1528 /* Is pw1 obviously equal to pw2?
1529 * That is, do they have obviously identical cells and obviously identical
1530 * elements on each cell?
1532 int FN(PW,plain_is_equal)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1542 if (!isl_space_is_equal(pw1->dim, pw2->dim))
1545 pw1 = FN(PW,copy)(pw1);
1546 pw2 = FN(PW,copy)(pw2);
1547 pw1 = FN(PW,normalize)(pw1);
1548 pw2 = FN(PW,normalize)(pw2);
1552 equal = pw1->n == pw2->n;
1553 for (i = 0; equal && i < pw1->n; ++i) {
1554 equal = isl_set_plain_is_equal(pw1->p[i].set, pw2->p[i].set);
1559 equal = FN(EL,plain_is_equal)(pw1->p[i].FIELD, pw2->p[i].FIELD);