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_in)(__isl_take PW *pw1,
515 __isl_take PW *pw2, __isl_take isl_space *space,
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.
520 * The result of "fn" (and therefore also of this function) lives in "space".
522 static __isl_give PW *FN(PW,on_shared_domain_in)(__isl_take PW *pw1,
523 __isl_take PW *pw2, __isl_take isl_space *space,
524 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
534 res = FN(PW,alloc_size)(space, pw1->type, n);
536 res = FN(PW,alloc_size)(space, n);
539 for (i = 0; i < pw1->n; ++i) {
540 for (j = 0; j < pw2->n; ++j) {
545 common = isl_set_intersect(
546 isl_set_copy(pw1->p[i].set),
547 isl_set_copy(pw2->p[j].set));
548 empty = isl_set_plain_is_empty(common);
549 if (empty < 0 || empty) {
550 isl_set_free(common);
556 res_ij = fn(FN(EL,copy)(pw1->p[i].FIELD),
557 FN(EL,copy)(pw2->p[j].FIELD));
558 res_ij = FN(EL,gist)(res_ij, isl_set_copy(common));
560 res = FN(PW,add_piece)(res, common, res_ij);
568 isl_space_free(space);
575 /* This function is currently only used from isl_aff.c
577 static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1,
579 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
580 __attribute__ ((unused));
582 /* Apply "fn" to pairs of elements from pw1 and pw2 on shared domains.
583 * The result of "fn" is assumed to live in the same space as "pw1" and "pw2".
585 static __isl_give PW *FN(PW,on_shared_domain)(__isl_take PW *pw1,
587 __isl_give EL *(*fn)(__isl_take EL *el1, __isl_take EL *el2))
594 space = isl_space_copy(pw1->dim);
595 return FN(PW,on_shared_domain_in)(pw1, pw2, space, fn);
603 __isl_give PW *FN(PW,neg)(__isl_take PW *pw)
610 if (FN(PW,IS_ZERO)(pw))
617 for (i = 0; i < pw->n; ++i) {
618 pw->p[i].FIELD = FN(EL,neg)(pw->p[i].FIELD);
620 return FN(PW,free)(pw);
626 __isl_give PW *FN(PW,sub)(__isl_take PW *pw1, __isl_take PW *pw2)
628 return FN(PW,add)(pw1, FN(PW,neg)(pw2));
633 __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw,
634 __isl_take isl_point *pnt)
639 isl_space *pnt_dim = NULL;
644 ctx = isl_point_get_ctx(pnt);
645 pnt_dim = isl_point_get_space(pnt);
646 isl_assert(ctx, isl_space_is_domain(pnt_dim, pw->dim), goto error);
648 for (i = 0; i < pw->n; ++i) {
649 found = isl_set_contains_point(pw->p[i].set, pnt);
656 qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
657 isl_point_copy(pnt));
659 qp = isl_qpolynomial_zero_on_domain(FN(PW,get_domain_space)(pw));
661 isl_space_free(pnt_dim);
666 isl_space_free(pnt_dim);
672 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
680 dom = isl_set_empty(FN(PW,get_domain_space)(pw));
681 for (i = 0; i < pw->n; ++i)
682 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
689 /* Restrict the domain of "pw" by combining each cell
690 * with "set" through a call to "fn", where "fn" may be
691 * isl_set_intersect or isl_set_intersect_params.
693 static __isl_give PW *FN(PW,intersect_aligned)(__isl_take PW *pw,
694 __isl_take isl_set *set,
695 __isl_give isl_set *(*fn)(__isl_take isl_set *set1,
696 __isl_take isl_set *set2))
712 for (i = pw->n - 1; i >= 0; --i) {
714 pw->p[i].set = fn(pw->p[i].set, isl_set_copy(set));
717 aff = isl_set_affine_hull(isl_set_copy(pw->p[i].set));
718 pw->p[i].FIELD = FN(EL,substitute_equalities)(pw->p[i].FIELD,
722 if (isl_set_plain_is_empty(pw->p[i].set)) {
723 isl_set_free(pw->p[i].set);
724 FN(EL,free)(pw->p[i].FIELD);
726 pw->p[i] = pw->p[pw->n - 1];
739 static __isl_give PW *FN(PW,intersect_domain_aligned)(__isl_take PW *pw,
740 __isl_take isl_set *set)
742 return FN(PW,intersect_aligned)(pw, set, &isl_set_intersect);
745 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw,
746 __isl_take isl_set *context)
748 return FN(PW,align_params_pw_set_and)(pw, context,
749 &FN(PW,intersect_domain_aligned));
752 static __isl_give PW *FN(PW,intersect_params_aligned)(__isl_take PW *pw,
753 __isl_take isl_set *set)
755 return FN(PW,intersect_aligned)(pw, set, &isl_set_intersect_params);
758 /* Intersect the domain of "pw" with the parameter domain "context".
760 __isl_give PW *FN(PW,intersect_params)(__isl_take PW *pw,
761 __isl_take isl_set *context)
763 return FN(PW,align_params_pw_set_and)(pw, context,
764 &FN(PW,intersect_params_aligned));
767 static __isl_give PW *FN(PW,gist_aligned)(__isl_take PW *pw,
768 __isl_take isl_set *context,
769 __isl_give EL *(*fn_el)(__isl_take EL *el,
770 __isl_take isl_set *set),
771 __isl_give isl_set *(*fn_dom)(__isl_take isl_set *set,
772 __isl_take isl_basic_set *bset))
775 isl_basic_set *hull = NULL;
781 isl_set_free(context);
785 if (!isl_space_match(pw->dim, isl_dim_param,
786 context->dim, isl_dim_param)) {
787 pw = FN(PW,align_params)(pw, isl_set_get_space(context));
788 context = isl_set_align_params(context, FN(PW,get_space)(pw));
791 context = isl_set_compute_divs(context);
792 hull = isl_set_simple_hull(isl_set_copy(context));
798 for (i = pw->n - 1; i >= 0; --i) {
799 pw->p[i].set = isl_set_intersect(pw->p[i].set,
800 isl_set_copy(context));
803 pw->p[i].FIELD = fn_el(pw->p[i].FIELD,
804 isl_set_copy(pw->p[i].set));
805 pw->p[i].set = fn_dom(pw->p[i].set, isl_basic_set_copy(hull));
808 if (isl_set_plain_is_empty(pw->p[i].set)) {
809 isl_set_free(pw->p[i].set);
810 FN(EL,free)(pw->p[i].FIELD);
812 pw->p[i] = pw->p[pw->n - 1];
817 isl_basic_set_free(hull);
818 isl_set_free(context);
823 isl_basic_set_free(hull);
824 isl_set_free(context);
828 static __isl_give PW *FN(PW,gist_domain_aligned)(__isl_take PW *pw,
829 __isl_take isl_set *set)
831 return FN(PW,gist_aligned)(pw, set, &FN(EL,gist),
832 &isl_set_gist_basic_set);
835 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
837 return FN(PW,align_params_pw_set_and)(pw, context,
838 &FN(PW,gist_domain_aligned));
841 static __isl_give PW *FN(PW,gist_params_aligned)(__isl_take PW *pw,
842 __isl_take isl_set *set)
844 return FN(PW,gist_aligned)(pw, set, &FN(EL,gist_params),
845 &isl_set_gist_params_basic_set);
848 __isl_give PW *FN(PW,gist_params)(__isl_take PW *pw,
849 __isl_take isl_set *context)
851 return FN(PW,align_params_pw_set_and)(pw, context,
852 &FN(PW,gist_params_aligned));
855 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
864 for (i = pw->n - 1; i >= 0; --i) {
865 for (j = i - 1; j >= 0; --j) {
866 if (!FN(EL,plain_is_equal)(pw->p[i].FIELD,
869 pw->p[j].set = isl_set_union(pw->p[j].set,
871 FN(EL,free)(pw->p[i].FIELD);
873 pw->p[i] = pw->p[pw->n - 1];
879 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
890 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
892 return pw ? isl_space_get_ctx(pw->dim) : NULL;
895 #ifndef NO_INVOLVES_DIMS
896 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
897 unsigned first, unsigned n)
900 enum isl_dim_type set_type;
904 if (pw->n == 0 || n == 0)
907 set_type = type == isl_dim_in ? isl_dim_set : type;
909 for (i = 0; i < pw->n; ++i) {
910 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
912 if (involves < 0 || involves)
914 involves = isl_set_involves_dims(pw->p[i].set,
916 if (involves < 0 || involves)
923 __isl_give PW *FN(PW,set_dim_name)(__isl_take PW *pw,
924 enum isl_dim_type type, unsigned pos, const char *s)
927 enum isl_dim_type set_type;
933 set_type = type == isl_dim_in ? isl_dim_set : type;
935 pw->dim = isl_space_set_dim_name(pw->dim, type, pos, s);
939 for (i = 0; i < pw->n; ++i) {
940 pw->p[i].set = isl_set_set_dim_name(pw->p[i].set,
944 pw->p[i].FIELD = FN(EL,set_dim_name)(pw->p[i].FIELD, type, pos, s);
956 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
957 enum isl_dim_type type, unsigned first, unsigned n)
960 enum isl_dim_type set_type;
964 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
967 set_type = type == isl_dim_in ? isl_dim_set : type;
972 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
975 for (i = 0; i < pw->n; ++i) {
976 pw->p[i].set = isl_set_drop(pw->p[i].set, set_type, first, n);
979 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
990 /* This function is very similar to drop_dims.
991 * The only difference is that the cells may still involve
992 * the specified dimensions. They are removed using
993 * isl_set_project_out instead of isl_set_drop.
995 __isl_give PW *FN(PW,project_out)(__isl_take PW *pw,
996 enum isl_dim_type type, unsigned first, unsigned n)
999 enum isl_dim_type set_type;
1003 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
1006 set_type = type == isl_dim_in ? isl_dim_set : type;
1008 pw = FN(PW,cow)(pw);
1011 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
1014 for (i = 0; i < pw->n; ++i) {
1015 pw->p[i].set = isl_set_project_out(pw->p[i].set,
1016 set_type, first, n);
1019 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
1020 if (!pw->p[i].FIELD)
1030 /* Project the domain of pw onto its parameter space.
1032 __isl_give PW *FN(PW,project_domain_on_params)(__isl_take PW *pw)
1037 n = FN(PW,dim)(pw, isl_dim_in);
1038 pw = FN(PW,project_out)(pw, isl_dim_in, 0, n);
1039 space = FN(PW,get_domain_space)(pw);
1040 space = isl_space_params(space);
1041 pw = FN(PW,reset_domain_space)(pw, space);
1046 #ifndef NO_INSERT_DIMS
1047 __isl_give PW *FN(PW,insert_dims)(__isl_take PW *pw, enum isl_dim_type type,
1048 unsigned first, unsigned n)
1051 enum isl_dim_type set_type;
1055 if (n == 0 && !isl_space_is_named_or_nested(pw->dim, type))
1058 set_type = type == isl_dim_in ? isl_dim_set : type;
1060 pw = FN(PW,cow)(pw);
1064 pw->dim = isl_space_insert_dims(pw->dim, type, first, n);
1068 for (i = 0; i < pw->n; ++i) {
1069 pw->p[i].set = isl_set_insert_dims(pw->p[i].set,
1070 set_type, first, n);
1073 pw->p[i].FIELD = FN(EL,insert_dims)(pw->p[i].FIELD,
1075 if (!pw->p[i].FIELD)
1086 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
1087 enum isl_dim_type type, unsigned pos, isl_int v)
1094 if (type == isl_dim_in)
1097 pw = FN(PW,cow)(pw);
1100 for (i = 0; i < pw->n; ++i) {
1101 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
1112 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
1114 return pw ? isl_space_dim(pw->dim, type) : 0;
1117 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
1118 enum isl_dim_type type, unsigned first, unsigned n)
1127 if (type == isl_dim_in)
1130 pw = FN(PW,cow)(pw);
1135 for (i = 0; i < pw->n; ++i) {
1136 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
1148 /* Compute the maximal value attained by the piecewise quasipolynomial
1149 * on its domain or zero if the domain is empty.
1150 * In the worst case, the domain is scanned completely,
1151 * so the domain is assumed to be bounded.
1153 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
1156 isl_qpolynomial *opt;
1162 isl_space *dim = isl_space_copy(pw->dim);
1164 return isl_qpolynomial_zero_on_domain(isl_space_domain(dim));
1167 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
1168 isl_set_copy(pw->p[0].set), max);
1169 for (i = 1; i < pw->n; ++i) {
1170 isl_qpolynomial *opt_i;
1171 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
1172 isl_set_copy(pw->p[i].set), max);
1174 opt = isl_qpolynomial_max_cst(opt, opt_i);
1176 opt = isl_qpolynomial_min_cst(opt, opt_i);
1183 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
1185 return FN(PW,opt)(pw, 1);
1188 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
1190 return FN(PW,opt)(pw, 0);
1194 __isl_give isl_space *FN(PW,get_space)(__isl_keep PW *pw)
1196 return pw ? isl_space_copy(pw->dim) : NULL;
1199 __isl_give isl_space *FN(PW,get_domain_space)(__isl_keep PW *pw)
1201 return pw ? isl_space_domain(isl_space_copy(pw->dim)) : NULL;
1204 #ifndef NO_RESET_DIM
1205 /* Reset the space of "pw". Since we don't know if the elements
1206 * represent the spaces themselves or their domains, we pass along
1207 * both when we call their reset_space_and_domain.
1209 static __isl_give PW *FN(PW,reset_space_and_domain)(__isl_take PW *pw,
1210 __isl_take isl_space *space, __isl_take isl_space *domain)
1214 pw = FN(PW,cow)(pw);
1215 if (!pw || !space || !domain)
1218 for (i = 0; i < pw->n; ++i) {
1219 pw->p[i].set = isl_set_reset_space(pw->p[i].set,
1220 isl_space_copy(domain));
1223 pw->p[i].FIELD = FN(EL,reset_space_and_domain)(pw->p[i].FIELD,
1224 isl_space_copy(space), isl_space_copy(domain));
1225 if (!pw->p[i].FIELD)
1229 isl_space_free(domain);
1231 isl_space_free(pw->dim);
1236 isl_space_free(domain);
1237 isl_space_free(space);
1242 __isl_give PW *FN(PW,reset_domain_space)(__isl_take PW *pw,
1243 __isl_take isl_space *domain)
1247 space = isl_space_extend_domain_with_range(isl_space_copy(domain),
1248 FN(PW,get_space)(pw));
1249 return FN(PW,reset_space_and_domain)(pw, space, domain);
1252 __isl_give PW *FN(PW,reset_space)(__isl_take PW *pw, __isl_take isl_space *dim)
1256 domain = isl_space_domain(isl_space_copy(dim));
1257 return FN(PW,reset_space_and_domain)(pw, dim, domain);
1260 __isl_give PW *FN(PW,set_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type,
1261 __isl_take isl_id *id)
1265 pw = FN(PW,cow)(pw);
1267 return isl_id_free(id);
1269 space = FN(PW,get_space)(pw);
1270 space = isl_space_set_tuple_id(space, type, id);
1272 return FN(PW,reset_space)(pw, space);
1275 __isl_give PW *FN(PW,set_dim_id)(__isl_take PW *pw,
1276 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
1278 pw = FN(PW,cow)(pw);
1280 return isl_id_free(id);
1281 pw->dim = isl_space_set_dim_id(pw->dim, type, pos, id);
1282 return FN(PW,reset_space)(pw, isl_space_copy(pw->dim));
1286 int FN(PW,has_equal_space)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1291 return isl_space_is_equal(pw1->dim, pw2->dim);
1295 __isl_give PW *FN(PW,morph_domain)(__isl_take PW *pw,
1296 __isl_take isl_morph *morph)
1304 ctx = isl_space_get_ctx(pw->dim);
1305 isl_assert(ctx, isl_space_is_domain(morph->dom->dim, pw->dim),
1308 pw = FN(PW,cow)(pw);
1311 pw->dim = isl_space_extend_domain_with_range(
1312 isl_space_copy(morph->ran->dim), pw->dim);
1316 for (i = 0; i < pw->n; ++i) {
1317 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
1320 pw->p[i].FIELD = FN(EL,morph_domain)(pw->p[i].FIELD,
1321 isl_morph_copy(morph));
1322 if (!pw->p[i].FIELD)
1326 isl_morph_free(morph);
1331 isl_morph_free(morph);
1336 int FN(PW,n_piece)(__isl_keep PW *pw)
1338 return pw ? pw->n : 0;
1341 int FN(PW,foreach_piece)(__isl_keep PW *pw,
1342 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
1350 for (i = 0; i < pw->n; ++i)
1351 if (fn(isl_set_copy(pw->p[i].set),
1352 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
1359 static int any_divs(__isl_keep isl_set *set)
1366 for (i = 0; i < set->n; ++i)
1367 if (set->p[i]->n_div > 0)
1373 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
1374 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1375 void *user), void *user)
1382 for (i = 0; i < set->n; ++i) {
1386 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
1387 lift = isl_set_lift(lift);
1389 copy = FN(EL,copy)(el);
1390 copy = FN(EL,lift)(copy, isl_set_get_space(lift));
1392 if (fn(lift, copy, user) < 0)
1406 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
1407 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1408 void *user), void *user)
1415 for (i = 0; i < pw->n; ++i) {
1419 set = isl_set_copy(pw->p[i].set);
1420 el = FN(EL,copy)(pw->p[i].FIELD);
1421 if (!any_divs(set)) {
1422 if (fn(set, el, user) < 0)
1426 if (foreach_lifted_subset(set, el, fn, user) < 0)
1434 #ifndef NO_MOVE_DIMS
1435 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
1436 enum isl_dim_type dst_type, unsigned dst_pos,
1437 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1441 pw = FN(PW,cow)(pw);
1445 pw->dim = isl_space_move_dims(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
1449 for (i = 0; i < pw->n; ++i) {
1450 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
1451 dst_type, dst_pos, src_type, src_pos, n);
1452 if (!pw->p[i].FIELD)
1456 if (dst_type == isl_dim_in)
1457 dst_type = isl_dim_set;
1458 if (src_type == isl_dim_in)
1459 src_type = isl_dim_set;
1461 for (i = 0; i < pw->n; ++i) {
1462 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
1464 src_type, src_pos, n);
1476 __isl_give PW *FN(PW,mul_isl_int)(__isl_take PW *pw, isl_int v)
1480 if (isl_int_is_one(v))
1482 if (pw && DEFAULT_IS_ZERO && isl_int_is_zero(v)) {
1484 isl_space *dim = FN(PW,get_space)(pw);
1486 zero = FN(PW,ZERO)(dim, pw->type);
1488 zero = FN(PW,ZERO)(dim);
1493 pw = FN(PW,cow)(pw);
1500 if (isl_int_is_neg(v))
1501 pw->type = isl_fold_type_negate(pw->type);
1503 for (i = 0; i < pw->n; ++i) {
1504 pw->p[i].FIELD = FN(EL,scale)(pw->p[i].FIELD, v);
1505 if (!pw->p[i].FIELD)
1515 __isl_give PW *FN(PW,scale)(__isl_take PW *pw, isl_int v)
1517 return FN(PW,mul_isl_int)(pw, v);
1520 static int FN(PW,qsort_set_cmp)(const void *p1, const void *p2)
1522 const isl_set *set1 = *(const isl_set **)p1;
1523 const isl_set *set2 = *(const isl_set **)p2;
1525 return isl_set_plain_cmp(set1, set2);
1528 /* We normalize in place, but if anything goes wrong we need
1529 * to return NULL, so we need to make sure we don't change the
1530 * meaning of any possible other copies of map.
1532 __isl_give PW *FN(PW,normalize)(__isl_take PW *pw)
1539 for (i = 0; i < pw->n; ++i) {
1540 set = isl_set_normalize(isl_set_copy(pw->p[i].set));
1542 return FN(PW,free)(pw);
1543 isl_set_free(pw->p[i].set);
1546 qsort(pw->p, pw->n, sizeof(pw->p[0]), &FN(PW,qsort_set_cmp));
1547 for (i = pw->n - 1; i >= 1; --i) {
1548 if (!isl_set_plain_is_equal(pw->p[i - 1].set, pw->p[i].set))
1550 if (!FN(EL,plain_is_equal)(pw->p[i - 1].FIELD, pw->p[i].FIELD))
1552 set = isl_set_union(isl_set_copy(pw->p[i - 1].set),
1553 isl_set_copy(pw->p[i].set));
1555 return FN(PW,free)(pw);
1556 isl_set_free(pw->p[i].set);
1557 FN(EL,free)(pw->p[i].FIELD);
1558 isl_set_free(pw->p[i - 1].set);
1559 pw->p[i - 1].set = set;
1560 for (j = i + 1; j < pw->n; ++j)
1561 pw->p[j - 1] = pw->p[j];
1568 /* Is pw1 obviously equal to pw2?
1569 * That is, do they have obviously identical cells and obviously identical
1570 * elements on each cell?
1572 int FN(PW,plain_is_equal)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1582 if (!isl_space_is_equal(pw1->dim, pw2->dim))
1585 pw1 = FN(PW,copy)(pw1);
1586 pw2 = FN(PW,copy)(pw2);
1587 pw1 = FN(PW,normalize)(pw1);
1588 pw2 = FN(PW,normalize)(pw2);
1592 equal = pw1->n == pw2->n;
1593 for (i = 0; equal && i < pw1->n; ++i) {
1594 equal = isl_set_plain_is_equal(pw1->p[i].set, pw2->p[i].set);
1599 equal = FN(EL,plain_is_equal)(pw1->p[i].FIELD, pw2->p[i].FIELD);