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_tuple_name)(__isl_keep PW *pw, enum isl_dim_type type)
178 return pw ? isl_space_get_tuple_name(pw->dim, type) : NULL;
181 int FN(PW,has_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type)
183 return pw ? isl_space_has_tuple_id(pw->dim, type) : -1;
186 __isl_give isl_id *FN(PW,get_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type)
188 return pw ? isl_space_get_tuple_id(pw->dim, type) : NULL;
191 int FN(PW,IS_ZERO)(__isl_keep PW *pw)
200 __isl_give PW *FN(PW,realign_domain)(__isl_take PW *pw,
201 __isl_take isl_reordering *exp)
209 for (i = 0; i < pw->n; ++i) {
210 pw->p[i].set = isl_set_realign(pw->p[i].set,
211 isl_reordering_copy(exp));
214 pw->p[i].FIELD = FN(EL,realign_domain)(pw->p[i].FIELD,
215 isl_reordering_copy(exp));
220 pw = FN(PW,reset_domain_space)(pw, isl_space_copy(exp->dim));
222 isl_reordering_free(exp);
225 isl_reordering_free(exp);
230 /* Align the parameters of "pw" to those of "model".
232 __isl_give PW *FN(PW,align_params)(__isl_take PW *pw, __isl_take isl_space *model)
239 ctx = isl_space_get_ctx(model);
240 if (!isl_space_has_named_params(model))
241 isl_die(ctx, isl_error_invalid,
242 "model has unnamed parameters", goto error);
243 if (!isl_space_has_named_params(pw->dim))
244 isl_die(ctx, isl_error_invalid,
245 "input has unnamed parameters", goto error);
246 if (!isl_space_match(pw->dim, isl_dim_param, model, isl_dim_param)) {
249 model = isl_space_drop_dims(model, isl_dim_in,
250 0, isl_space_dim(model, isl_dim_in));
251 model = isl_space_drop_dims(model, isl_dim_out,
252 0, isl_space_dim(model, isl_dim_out));
253 exp = isl_parameter_alignment_reordering(pw->dim, model);
254 exp = isl_reordering_extend_space(exp,
255 FN(PW,get_domain_space)(pw));
256 pw = FN(PW,realign_domain)(pw, exp);
259 isl_space_free(model);
262 isl_space_free(model);
267 static __isl_give PW *FN(PW,align_params_pw_pw_and)(__isl_take PW *pw1,
269 __isl_give PW *(*fn)(__isl_take PW *pw1, __isl_take PW *pw2))
275 if (isl_space_match(pw1->dim, isl_dim_param, pw2->dim, isl_dim_param))
277 ctx = FN(PW,get_ctx)(pw1);
278 if (!isl_space_has_named_params(pw1->dim) ||
279 !isl_space_has_named_params(pw2->dim))
280 isl_die(ctx, isl_error_invalid,
281 "unaligned unnamed parameters", goto error);
282 pw1 = FN(PW,align_params)(pw1, FN(PW,get_space)(pw2));
283 pw2 = FN(PW,align_params)(pw2, FN(PW,get_space)(pw1));
291 static __isl_give PW *FN(PW,align_params_pw_set_and)(__isl_take PW *pw,
292 __isl_take isl_set *set,
293 __isl_give PW *(*fn)(__isl_take PW *pw, __isl_take isl_set *set))
299 if (isl_space_match(pw->dim, isl_dim_param, set->dim, isl_dim_param))
301 ctx = FN(PW,get_ctx)(pw);
302 if (!isl_space_has_named_params(pw->dim) ||
303 !isl_space_has_named_params(set->dim))
304 isl_die(ctx, isl_error_invalid,
305 "unaligned unnamed parameters", goto error);
306 pw = FN(PW,align_params)(pw, isl_set_get_space(set));
307 set = isl_set_align_params(set, FN(PW,get_space)(pw));
316 static __isl_give PW *FN(PW,add_aligned)(__isl_take PW *pw1, __isl_take PW *pw2)
326 ctx = isl_space_get_ctx(pw1->dim);
328 if (pw1->type != pw2->type)
329 isl_die(ctx, isl_error_invalid,
330 "fold types don't match", goto error);
332 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
334 if (FN(PW,IS_ZERO)(pw1)) {
339 if (FN(PW,IS_ZERO)(pw2)) {
344 n = (pw1->n + 1) * (pw2->n + 1);
346 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->type, n);
348 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), n);
351 for (i = 0; i < pw1->n; ++i) {
352 set = isl_set_copy(pw1->p[i].set);
353 for (j = 0; j < pw2->n; ++j) {
354 struct isl_set *common;
356 set = isl_set_subtract(set,
357 isl_set_copy(pw2->p[j].set));
358 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
359 isl_set_copy(pw2->p[j].set));
360 if (isl_set_plain_is_empty(common)) {
361 isl_set_free(common);
365 sum = FN(EL,add_on_domain)(common,
366 FN(EL,copy)(pw1->p[i].FIELD),
367 FN(EL,copy)(pw2->p[j].FIELD));
369 res = FN(PW,add_piece)(res, common, sum);
371 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD));
374 for (j = 0; j < pw2->n; ++j) {
375 set = isl_set_copy(pw2->p[j].set);
376 for (i = 0; i < pw1->n; ++i)
377 set = isl_set_subtract(set,
378 isl_set_copy(pw1->p[i].set));
379 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD));
392 __isl_give PW *FN(PW,add)(__isl_take PW *pw1, __isl_take PW *pw2)
394 return FN(PW,align_params_pw_pw_and)(pw1, pw2, &FN(PW,add_aligned));
397 /* Make sure "pw" has room for at least "n" more pieces.
399 * If there is only one reference to pw, we extend it in place.
400 * Otherwise, we create a new PW and copy the pieces.
402 static __isl_give PW *FN(PW,grow)(__isl_take PW *pw, int n)
410 if (pw->n + n <= pw->size)
412 ctx = FN(PW,get_ctx)(pw);
415 res = isl_realloc(ctx, pw, struct PW,
416 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
418 return FN(PW,free)(pw);
423 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->type, n);
425 res = FN(PW,alloc_size)(isl_space_copy(pw->dim), n);
428 return FN(PW,free)(pw);
429 for (i = 0; i < pw->n; ++i)
430 res = FN(PW,add_piece)(res, isl_set_copy(pw->p[i].set),
431 FN(EL,copy)(pw->p[i].FIELD));
436 static __isl_give PW *FN(PW,add_disjoint_aligned)(__isl_take PW *pw1,
445 if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n)
446 return FN(PW,add_disjoint_aligned)(pw2, pw1);
448 ctx = isl_space_get_ctx(pw1->dim);
450 if (pw1->type != pw2->type)
451 isl_die(ctx, isl_error_invalid,
452 "fold types don't match", goto error);
454 isl_assert(ctx, isl_space_is_equal(pw1->dim, pw2->dim), goto error);
456 if (FN(PW,IS_ZERO)(pw1)) {
461 if (FN(PW,IS_ZERO)(pw2)) {
466 pw1 = FN(PW,grow)(pw1, pw2->n);
470 for (i = 0; i < pw2->n; ++i)
471 pw1 = FN(PW,add_piece)(pw1,
472 isl_set_copy(pw2->p[i].set),
473 FN(EL,copy)(pw2->p[i].FIELD));
484 __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2)
486 return FN(PW,align_params_pw_pw_and)(pw1, pw2,
487 &FN(PW,add_disjoint_aligned));
491 __isl_give PW *FN(PW,neg)(__isl_take PW *pw)
498 if (FN(PW,IS_ZERO)(pw))
505 for (i = 0; i < pw->n; ++i) {
506 pw->p[i].FIELD = FN(EL,neg)(pw->p[i].FIELD);
508 return FN(PW,free)(pw);
514 __isl_give PW *FN(PW,sub)(__isl_take PW *pw1, __isl_take PW *pw2)
516 return FN(PW,add)(pw1, FN(PW,neg)(pw2));
521 __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw,
522 __isl_take isl_point *pnt)
527 isl_space *pnt_dim = NULL;
532 ctx = isl_point_get_ctx(pnt);
533 pnt_dim = isl_point_get_space(pnt);
534 isl_assert(ctx, isl_space_is_domain(pnt_dim, pw->dim), goto error);
536 for (i = 0; i < pw->n; ++i) {
537 found = isl_set_contains_point(pw->p[i].set, pnt);
544 qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
545 isl_point_copy(pnt));
547 qp = isl_qpolynomial_zero_on_domain(FN(PW,get_domain_space)(pw));
549 isl_space_free(pnt_dim);
554 isl_space_free(pnt_dim);
560 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
568 dom = isl_set_empty(FN(PW,get_domain_space)(pw));
569 for (i = 0; i < pw->n; ++i)
570 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
577 static __isl_give PW *FN(PW,intersect_domain_aligned)(__isl_take PW *pw,
578 __isl_take isl_set *set)
594 for (i = pw->n - 1; i >= 0; --i) {
596 pw->p[i].set = isl_set_intersect(pw->p[i].set, isl_set_copy(set));
599 aff = isl_set_affine_hull(isl_set_copy(pw->p[i].set));
600 pw->p[i].FIELD = FN(EL,substitute_equalities)(pw->p[i].FIELD,
602 if (isl_set_plain_is_empty(pw->p[i].set)) {
603 isl_set_free(pw->p[i].set);
604 FN(EL,free)(pw->p[i].FIELD);
606 pw->p[i] = pw->p[pw->n - 1];
619 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw,
620 __isl_take isl_set *context)
622 return FN(PW,align_params_pw_set_and)(pw, context,
623 &FN(PW,intersect_domain_aligned));
626 static __isl_give PW *FN(PW,gist_aligned)(__isl_take PW *pw,
627 __isl_take isl_set *context)
630 isl_basic_set *hull = NULL;
636 isl_set_free(context);
640 if (!isl_space_match(pw->dim, isl_dim_param,
641 context->dim, isl_dim_param)) {
642 pw = FN(PW,align_params)(pw, isl_set_get_space(context));
643 context = isl_set_align_params(context, FN(PW,get_space)(pw));
646 context = isl_set_compute_divs(context);
647 hull = isl_set_simple_hull(isl_set_copy(context));
653 for (i = pw->n - 1; i >= 0; --i) {
654 pw->p[i].set = isl_set_intersect(pw->p[i].set,
655 isl_set_copy(context));
658 pw->p[i].FIELD = FN(EL,gist)(pw->p[i].FIELD,
659 isl_set_copy(pw->p[i].set));
660 pw->p[i].set = isl_set_gist_basic_set(pw->p[i].set,
661 isl_basic_set_copy(hull));
664 if (isl_set_plain_is_empty(pw->p[i].set)) {
665 isl_set_free(pw->p[i].set);
666 FN(EL,free)(pw->p[i].FIELD);
668 pw->p[i] = pw->p[pw->n - 1];
673 isl_basic_set_free(hull);
674 isl_set_free(context);
679 isl_basic_set_free(hull);
680 isl_set_free(context);
684 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
686 return FN(PW,align_params_pw_set_and)(pw, context, &FN(PW,gist_aligned));
689 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
698 for (i = pw->n - 1; i >= 0; --i) {
699 for (j = i - 1; j >= 0; --j) {
700 if (!FN(EL,plain_is_equal)(pw->p[i].FIELD,
703 pw->p[j].set = isl_set_union(pw->p[j].set,
705 FN(EL,free)(pw->p[i].FIELD);
707 pw->p[i] = pw->p[pw->n - 1];
713 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
724 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
726 return pw ? isl_space_get_ctx(pw->dim) : NULL;
729 #ifndef NO_INVOLVES_DIMS
730 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
731 unsigned first, unsigned n)
734 enum isl_dim_type set_type;
738 if (pw->n == 0 || n == 0)
741 set_type = type == isl_dim_in ? isl_dim_set : type;
743 for (i = 0; i < pw->n; ++i) {
744 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
746 if (involves < 0 || involves)
748 involves = isl_set_involves_dims(pw->p[i].set,
750 if (involves < 0 || involves)
757 __isl_give PW *FN(PW,set_dim_name)(__isl_take PW *pw,
758 enum isl_dim_type type, unsigned pos, const char *s)
761 enum isl_dim_type set_type;
767 set_type = type == isl_dim_in ? isl_dim_set : type;
769 pw->dim = isl_space_set_dim_name(pw->dim, type, pos, s);
773 for (i = 0; i < pw->n; ++i) {
774 pw->p[i].set = isl_set_set_dim_name(pw->p[i].set,
778 pw->p[i].FIELD = FN(EL,set_dim_name)(pw->p[i].FIELD, type, pos, s);
790 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
791 enum isl_dim_type type, unsigned first, unsigned n)
794 enum isl_dim_type set_type;
798 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
801 set_type = type == isl_dim_in ? isl_dim_set : type;
806 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
809 for (i = 0; i < pw->n; ++i) {
810 pw->p[i].set = isl_set_drop(pw->p[i].set, set_type, first, n);
813 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
824 /* This function is very similar to drop_dims.
825 * The only difference is that the cells may still involve
826 * the specified dimensions. They are removed using
827 * isl_set_project_out instead of isl_set_drop.
829 __isl_give PW *FN(PW,project_out)(__isl_take PW *pw,
830 enum isl_dim_type type, unsigned first, unsigned n)
833 enum isl_dim_type set_type;
837 if (n == 0 && !isl_space_get_tuple_name(pw->dim, type))
840 set_type = type == isl_dim_in ? isl_dim_set : type;
845 pw->dim = isl_space_drop_dims(pw->dim, type, first, n);
848 for (i = 0; i < pw->n; ++i) {
849 pw->p[i].set = isl_set_project_out(pw->p[i].set,
853 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
864 /* Project the domain of pw onto its parameter space.
866 __isl_give PW *FN(PW,project_domain_on_params)(__isl_take PW *pw)
871 n = FN(PW,dim)(pw, isl_dim_in);
872 pw = FN(PW,project_out)(pw, isl_dim_in, 0, n);
873 space = FN(PW,get_domain_space)(pw);
874 space = isl_space_params(space);
875 pw = FN(PW,reset_domain_space)(pw, space);
880 #ifndef NO_INSERT_DIMS
881 __isl_give PW *FN(PW,insert_dims)(__isl_take PW *pw, enum isl_dim_type type,
882 unsigned first, unsigned n)
885 enum isl_dim_type set_type;
889 if (n == 0 && !isl_space_is_named_or_nested(pw->dim, type))
892 set_type = type == isl_dim_in ? isl_dim_set : type;
898 pw->dim = isl_space_insert_dims(pw->dim, type, first, n);
902 for (i = 0; i < pw->n; ++i) {
903 pw->p[i].set = isl_set_insert_dims(pw->p[i].set,
907 pw->p[i].FIELD = FN(EL,insert_dims)(pw->p[i].FIELD,
920 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
921 enum isl_dim_type type, unsigned pos, isl_int v)
928 if (type == isl_dim_in)
934 for (i = 0; i < pw->n; ++i) {
935 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
946 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
948 return pw ? isl_space_dim(pw->dim, type) : 0;
951 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
952 enum isl_dim_type type, unsigned first, unsigned n)
961 if (type == isl_dim_in)
969 for (i = 0; i < pw->n; ++i) {
970 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
982 /* Compute the maximal value attained by the piecewise quasipolynomial
983 * on its domain or zero if the domain is empty.
984 * In the worst case, the domain is scanned completely,
985 * so the domain is assumed to be bounded.
987 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
990 isl_qpolynomial *opt;
996 isl_space *dim = isl_space_copy(pw->dim);
998 return isl_qpolynomial_zero_on_domain(dim);
1001 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
1002 isl_set_copy(pw->p[0].set), max);
1003 for (i = 1; i < pw->n; ++i) {
1004 isl_qpolynomial *opt_i;
1005 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
1006 isl_set_copy(pw->p[i].set), max);
1008 opt = isl_qpolynomial_max_cst(opt, opt_i);
1010 opt = isl_qpolynomial_min_cst(opt, opt_i);
1017 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
1019 return FN(PW,opt)(pw, 1);
1022 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
1024 return FN(PW,opt)(pw, 0);
1028 __isl_give isl_space *FN(PW,get_space)(__isl_keep PW *pw)
1030 return pw ? isl_space_copy(pw->dim) : NULL;
1033 __isl_give isl_space *FN(PW,get_domain_space)(__isl_keep PW *pw)
1035 return pw ? isl_space_domain(isl_space_copy(pw->dim)) : NULL;
1038 #ifndef NO_RESET_DIM
1039 /* Reset the space of "pw". Since we don't know if the elements
1040 * represent the spaces themselves or their domains, we pass along
1041 * both when we call their reset_space_and_domain.
1043 static __isl_give PW *FN(PW,reset_space_and_domain)(__isl_take PW *pw,
1044 __isl_take isl_space *space, __isl_take isl_space *domain)
1048 pw = FN(PW,cow)(pw);
1049 if (!pw || !space || !domain)
1052 for (i = 0; i < pw->n; ++i) {
1053 pw->p[i].set = isl_set_reset_space(pw->p[i].set,
1054 isl_space_copy(domain));
1057 pw->p[i].FIELD = FN(EL,reset_space_and_domain)(pw->p[i].FIELD,
1058 isl_space_copy(space), isl_space_copy(domain));
1059 if (!pw->p[i].FIELD)
1063 isl_space_free(domain);
1065 isl_space_free(pw->dim);
1070 isl_space_free(domain);
1071 isl_space_free(space);
1076 __isl_give PW *FN(PW,reset_domain_space)(__isl_take PW *pw,
1077 __isl_take isl_space *domain)
1081 space = isl_space_extend_domain_with_range(isl_space_copy(domain),
1082 FN(PW,get_space)(pw));
1083 return FN(PW,reset_space_and_domain)(pw, space, domain);
1086 __isl_give PW *FN(PW,reset_space)(__isl_take PW *pw, __isl_take isl_space *dim)
1090 domain = isl_space_domain(isl_space_copy(dim));
1091 return FN(PW,reset_space_and_domain)(pw, dim, domain);
1094 __isl_give PW *FN(PW,set_tuple_id)(__isl_keep PW *pw, enum isl_dim_type type,
1095 __isl_take isl_id *id)
1099 pw = FN(PW,cow)(pw);
1101 return isl_id_free(id);
1103 space = FN(PW,get_space)(pw);
1104 space = isl_space_set_tuple_id(space, type, id);
1106 return FN(PW,reset_space)(pw, space);
1109 __isl_give PW *FN(PW,set_dim_id)(__isl_take PW *pw,
1110 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
1112 pw = FN(PW,cow)(pw);
1114 return isl_id_free(id);
1115 pw->dim = isl_space_set_dim_id(pw->dim, type, pos, id);
1116 return FN(PW,reset_space)(pw, isl_space_copy(pw->dim));
1120 int FN(PW,has_equal_space)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1125 return isl_space_is_equal(pw1->dim, pw2->dim);
1129 __isl_give PW *FN(PW,morph_domain)(__isl_take PW *pw,
1130 __isl_take isl_morph *morph)
1138 ctx = isl_space_get_ctx(pw->dim);
1139 isl_assert(ctx, isl_space_is_domain(morph->dom->dim, pw->dim),
1142 pw = FN(PW,cow)(pw);
1145 pw->dim = isl_space_extend_domain_with_range(
1146 isl_space_copy(morph->ran->dim), pw->dim);
1150 for (i = 0; i < pw->n; ++i) {
1151 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
1154 pw->p[i].FIELD = FN(EL,morph_domain)(pw->p[i].FIELD,
1155 isl_morph_copy(morph));
1156 if (!pw->p[i].FIELD)
1160 isl_morph_free(morph);
1165 isl_morph_free(morph);
1170 int FN(PW,foreach_piece)(__isl_keep PW *pw,
1171 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
1179 for (i = 0; i < pw->n; ++i)
1180 if (fn(isl_set_copy(pw->p[i].set),
1181 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
1188 static int any_divs(__isl_keep isl_set *set)
1195 for (i = 0; i < set->n; ++i)
1196 if (set->p[i]->n_div > 0)
1202 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
1203 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1204 void *user), void *user)
1211 for (i = 0; i < set->n; ++i) {
1215 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
1216 lift = isl_set_lift(lift);
1218 copy = FN(EL,copy)(el);
1219 copy = FN(EL,lift)(copy, isl_set_get_space(lift));
1221 if (fn(lift, copy, user) < 0)
1235 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
1236 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
1237 void *user), void *user)
1244 for (i = 0; i < pw->n; ++i) {
1248 set = isl_set_copy(pw->p[i].set);
1249 el = FN(EL,copy)(pw->p[i].FIELD);
1250 if (!any_divs(set)) {
1251 if (fn(set, el, user) < 0)
1255 if (foreach_lifted_subset(set, el, fn, user) < 0)
1263 #ifndef NO_MOVE_DIMS
1264 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
1265 enum isl_dim_type dst_type, unsigned dst_pos,
1266 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
1270 pw = FN(PW,cow)(pw);
1274 pw->dim = isl_space_move_dims(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
1278 for (i = 0; i < pw->n; ++i) {
1279 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
1280 dst_type, dst_pos, src_type, src_pos, n);
1281 if (!pw->p[i].FIELD)
1285 if (dst_type == isl_dim_in)
1286 dst_type = isl_dim_set;
1287 if (src_type == isl_dim_in)
1288 src_type = isl_dim_set;
1290 for (i = 0; i < pw->n; ++i) {
1291 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
1293 src_type, src_pos, n);
1305 __isl_give PW *FN(PW,mul_isl_int)(__isl_take PW *pw, isl_int v)
1309 if (isl_int_is_one(v))
1311 if (pw && isl_int_is_zero(v)) {
1313 isl_space *dim = FN(PW,get_space)(pw);
1315 zero = FN(PW,ZERO)(dim, pw->type);
1317 zero = FN(PW,ZERO)(dim);
1322 pw = FN(PW,cow)(pw);
1329 if (isl_int_is_neg(v))
1330 pw->type = isl_fold_type_negate(pw->type);
1332 for (i = 0; i < pw->n; ++i) {
1333 pw->p[i].FIELD = FN(EL,scale)(pw->p[i].FIELD, v);
1334 if (!pw->p[i].FIELD)
1344 __isl_give PW *FN(PW,scale)(__isl_take PW *pw, isl_int v)
1346 return FN(PW,mul_isl_int)(pw, v);
1349 static int FN(PW,qsort_set_cmp)(const void *p1, const void *p2)
1351 const isl_set *set1 = *(const isl_set **)p1;
1352 const isl_set *set2 = *(const isl_set **)p2;
1354 return isl_set_plain_cmp(set1, set2);
1357 /* We normalize in place, but if anything goes wrong we need
1358 * to return NULL, so we need to make sure we don't change the
1359 * meaning of any possible other copies of map.
1361 __isl_give PW *FN(PW,normalize)(__isl_take PW *pw)
1368 for (i = 0; i < pw->n; ++i) {
1369 set = isl_set_normalize(isl_set_copy(pw->p[i].set));
1371 return FN(PW,free)(pw);
1372 isl_set_free(pw->p[i].set);
1375 qsort(pw->p, pw->n, sizeof(pw->p[0]), &FN(PW,qsort_set_cmp));
1376 for (i = pw->n - 1; i >= 1; --i) {
1377 if (!isl_set_plain_is_equal(pw->p[i - 1].set, pw->p[i].set))
1379 if (!FN(EL,plain_is_equal)(pw->p[i - 1].FIELD, pw->p[i].FIELD))
1381 set = isl_set_union(isl_set_copy(pw->p[i - 1].set),
1382 isl_set_copy(pw->p[i].set));
1384 return FN(PW,free)(pw);
1385 isl_set_free(pw->p[i].set);
1386 FN(EL,free)(pw->p[i].FIELD);
1387 isl_set_free(pw->p[i - 1].set);
1388 pw->p[i - 1].set = set;
1389 for (j = i + 1; j < pw->n; ++j)
1390 pw->p[j - 1] = pw->p[j];
1397 /* Is pw1 obviously equal to pw2?
1398 * That is, do they have obviously identical cells and obviously identical
1399 * elements on each cell?
1401 int FN(PW,plain_is_equal)(__isl_keep PW *pw1, __isl_keep PW *pw2)
1411 if (!isl_space_is_equal(pw1->dim, pw2->dim))
1414 pw1 = FN(PW,copy)(pw1);
1415 pw2 = FN(PW,copy)(pw2);
1416 pw1 = FN(PW,normalize)(pw1);
1417 pw2 = FN(PW,normalize)(pw2);
1421 equal = pw1->n == pw2->n;
1422 for (i = 0; equal && i < pw1->n; ++i) {
1423 equal = isl_set_plain_is_equal(pw1->p[i].set, pw2->p[i].set);
1428 equal = FN(EL,plain_is_equal)(pw1->p[i].FIELD, pw2->p[i].FIELD);