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)
6 static __isl_give PW *FN(PW,alloc_)(__isl_take isl_dim *dim, int n)
12 isl_assert(dim->ctx, n >= 0, goto error);
13 pw = isl_alloc(dim->ctx, struct PW,
14 sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
28 __isl_give PW *FN(PW,zero)(__isl_take isl_dim *dim)
30 return FN(PW,alloc_)(dim, 0);
33 __isl_give PW *FN(PW,add_piece)(__isl_take PW *pw,
34 __isl_take isl_set *set, __isl_take EL *el)
36 if (!pw || !set || !el)
39 if (isl_set_fast_is_empty(set) || FN(EL,IS_ZERO)(el)) {
45 isl_assert(set->ctx, isl_dim_equal(pw->dim, el->dim), goto error);
46 isl_assert(set->ctx, pw->n < pw->size, goto error);
48 pw->p[pw->n].set = set;
49 pw->p[pw->n].FIELD = el;
60 __isl_give PW *FN(PW,alloc)(__isl_take isl_set *set, __isl_take EL *el)
67 pw = FN(PW,alloc_)(isl_set_get_dim(set), 1);
69 return FN(PW,add_piece)(pw, set, el);
76 __isl_give PW *FN(PW,dup)(__isl_keep PW *pw)
84 dup = FN(PW,alloc_)(isl_dim_copy(pw->dim), pw->n);
88 for (i = 0; i < pw->n; ++i)
89 dup = FN(PW,add_piece)(dup, isl_set_copy(pw->p[i].set),
90 FN(EL,copy)(pw->p[i].FIELD));
98 __isl_give PW *FN(PW,cow)(__isl_take PW *pw)
106 return FN(PW,dup)(pw);
109 __isl_give PW *FN(PW,copy)(__isl_keep PW *pw)
118 void FN(PW,free)(__isl_take PW *pw)
127 for (i = 0; i < pw->n; ++i) {
128 isl_set_free(pw->p[i].set);
129 FN(EL,free)(pw->p[i].FIELD);
131 isl_dim_free(pw->dim);
135 int FN(PW,is_zero)(__isl_keep PW *pw)
143 __isl_give PW *FN(PW,add)(__isl_take PW *pw1, __isl_take PW *pw2)
152 isl_assert(pw1->dim->ctx, isl_dim_equal(pw1->dim, pw2->dim), goto error);
154 if (FN(PW,is_zero)(pw1)) {
159 if (FN(PW,is_zero)(pw2)) {
164 n = (pw1->n + 1) * (pw2->n + 1);
165 res = FN(PW,alloc_)(isl_dim_copy(pw1->dim), n);
167 for (i = 0; i < pw1->n; ++i) {
168 set = isl_set_copy(pw1->p[i].set);
169 for (j = 0; j < pw2->n; ++j) {
170 struct isl_set *common;
172 set = isl_set_subtract(set,
173 isl_set_copy(pw2->p[j].set));
174 common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
175 isl_set_copy(pw2->p[j].set));
176 if (isl_set_fast_is_empty(common)) {
177 isl_set_free(common);
181 sum = ADD(common, FN(EL,copy)(pw1->p[i].FIELD),
182 FN(EL,copy)(pw2->p[j].FIELD));
184 res = FN(PW,add_piece)(res, common, sum);
186 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD));
189 for (j = 0; j < pw2->n; ++j) {
190 set = isl_set_copy(pw2->p[j].set);
191 for (i = 0; i < pw1->n; ++i)
192 set = isl_set_subtract(set,
193 isl_set_copy(pw1->p[i].set));
194 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD));
207 __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2)
215 isl_assert(pw1->dim->ctx, isl_dim_equal(pw1->dim, pw2->dim), goto error);
217 if (FN(PW,is_zero)(pw1)) {
222 if (FN(PW,is_zero)(pw2)) {
227 res = FN(PW,alloc_)(isl_dim_copy(pw1->dim), pw1->n + pw2->n);
229 for (i = 0; i < pw1->n; ++i)
230 res = FN(PW,add_piece)(res,
231 isl_set_copy(pw1->p[i].set),
232 FN(EL,copy)(pw1->p[i].FIELD));
234 for (i = 0; i < pw2->n; ++i)
235 res = FN(PW,add_piece)(res,
236 isl_set_copy(pw2->p[i].set),
237 FN(EL,copy)(pw2->p[i].FIELD));
249 __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw,
250 __isl_take isl_point *pnt)
258 isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, pw->dim), goto error);
260 for (i = 0; i < pw->n; ++i) {
261 found = isl_set_contains_point(pw->p[i].set, pnt);
268 qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
269 isl_point_copy(pnt));
271 qp = isl_qpolynomial_zero(isl_dim_copy(pw->dim));
281 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
289 dom = isl_set_empty(isl_dim_copy(pw->dim));
290 for (i = 0; i < pw->n; ++i)
291 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
298 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw, __isl_take isl_set *set)
314 for (i = pw->n - 1; i >= 0; --i) {
316 pw->p[i].set = isl_set_intersect(pw->p[i].set, isl_set_copy(set));
319 aff = isl_set_affine_hull(isl_set_copy(pw->p[i].set));
320 pw->p[i].FIELD = FN(EL,substitute_equalities)(pw->p[i].FIELD,
322 if (isl_set_fast_is_empty(pw->p[i].set)) {
323 isl_set_free(pw->p[i].set);
324 FN(EL,free)(pw->p[i].FIELD);
326 pw->p[i] = pw->p[pw->n - 1];
339 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
342 isl_basic_set *hull = NULL;
348 isl_set_free(context);
352 hull = isl_set_simple_hull(isl_set_copy(context));
358 for (i = 0; i < pw->n; ++i) {
359 pw->p[i].set = isl_set_gist_basic_set(pw->p[i].set,
360 isl_basic_set_copy(hull));
365 isl_basic_set_free(hull);
366 isl_set_free(context);
371 isl_basic_set_free(hull);
372 isl_set_free(context);
376 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
385 for (i = pw->n - 1; i >= 0; --i) {
386 for (j = i - 1; j >= 0; --j) {
387 if (!FN(EL,is_equal)(pw->p[i].FIELD, pw->p[j].FIELD))
389 pw->p[j].set = isl_set_union(pw->p[j].set,
391 FN(EL,free)(pw->p[i].FIELD);
393 pw->p[i] = pw->p[pw->n - 1];
399 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
410 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
412 return pw ? pw->dim->ctx : NULL;
415 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
416 unsigned first, unsigned n)
422 if (pw->n == 0 || n == 0)
424 for (i = 0; i < pw->n; ++i) {
425 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
427 if (involves < 0 || involves)
433 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
434 enum isl_dim_type type, unsigned first, unsigned n)
440 if (n == 0 && !isl_dim_get_tuple_name(pw->dim, type))
446 pw->dim = isl_dim_drop(pw->dim, type, first, n);
449 for (i = 0; i < pw->n; ++i) {
450 pw->p[i].set = isl_set_drop(pw->p[i].set, type, first, n);
453 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
464 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
465 enum isl_dim_type type, unsigned pos, isl_int v)
475 for (i = 0; i < pw->n; ++i) {
476 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
487 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
489 return pw ? isl_dim_size(pw->dim, type) : 0;
492 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
493 enum isl_dim_type type, unsigned first, unsigned n)
507 for (i = 0; i < pw->n; ++i) {
508 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
519 /* Compute the maximal value attained by the piecewise quasipolynomial
520 * on its domain or zero if the domain is empty.
521 * In the worst case, the domain is scanned completely,
522 * so the domain is assumed to be bounded.
524 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
527 isl_qpolynomial *opt;
533 isl_dim *dim = isl_dim_copy(pw->dim);
535 return isl_qpolynomial_zero(dim);
538 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
539 isl_set_copy(pw->p[0].set), max);
540 for (i = 1; i < pw->n; ++i) {
541 isl_qpolynomial *opt_i;
542 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
543 isl_set_copy(pw->p[i].set), max);
545 opt = isl_qpolynomial_max_cst(opt, opt_i);
547 opt = isl_qpolynomial_min_cst(opt, opt_i);
554 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
556 return FN(PW,opt)(pw, 1);
559 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
561 return FN(PW,opt)(pw, 0);
564 __isl_give isl_dim *FN(PW,get_dim)(__isl_keep PW *pw)
566 return pw ? isl_dim_copy(pw->dim) : NULL;
569 __isl_give PW *FN(PW,reset_dim)(__isl_take PW *pw, __isl_take isl_dim *dim)
577 for (i = 0; i < pw->n; ++i) {
578 pw->p[i].set = isl_set_reset_dim(pw->p[i].set,
582 pw->p[i].FIELD = FN(EL,reset_dim)(pw->p[i].FIELD,
587 isl_dim_free(pw->dim);
597 int FN(PW,has_equal_dim)(__isl_keep PW *pw1, __isl_keep PW *pw2)
602 return isl_dim_equal(pw1->dim, pw2->dim);
605 __isl_give PW *FN(PW,morph)(__isl_take PW *pw, __isl_take isl_morph *morph)
612 isl_assert(pw->dim->ctx, isl_dim_equal(pw->dim, morph->dom->dim),
618 isl_dim_free(pw->dim);
619 pw->dim = isl_dim_copy(morph->ran->dim);
623 for (i = 0; i < pw->n; ++i) {
624 pw->p[i].set = isl_morph_set(isl_morph_copy(morph), pw->p[i].set);
627 pw->p[i].FIELD = FN(EL,morph)(pw->p[i].FIELD,
628 isl_morph_copy(morph));
633 isl_morph_free(morph);
638 isl_morph_free(morph);
642 int FN(PW,foreach_piece)(__isl_keep PW *pw,
643 int (*fn)(__isl_take isl_set *set, __isl_take EL *el, void *user),
651 for (i = 0; i < pw->n; ++i)
652 if (fn(isl_set_copy(pw->p[i].set),
653 FN(EL,copy)(pw->p[i].FIELD), user) < 0)
659 static int any_divs(__isl_keep isl_set *set)
666 for (i = 0; i < set->n; ++i)
667 if (set->p[i]->n_div > 0)
673 static int foreach_lifted_subset(__isl_take isl_set *set, __isl_take EL *el,
674 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
675 void *user), void *user)
682 for (i = 0; i < set->n; ++i) {
686 lift = isl_set_from_basic_set(isl_basic_set_copy(set->p[i]));
687 lift = isl_set_lift(lift);
689 copy = FN(EL,copy)(el);
690 copy = FN(EL,lift)(copy, isl_set_get_dim(lift));
692 if (fn(lift, copy, user) < 0)
706 int FN(PW,foreach_lifted_piece)(__isl_keep PW *pw,
707 int (*fn)(__isl_take isl_set *set, __isl_take EL *el,
708 void *user), void *user)
715 for (i = 0; i < pw->n; ++i) {
719 set = isl_set_copy(pw->p[i].set);
720 el = FN(EL,copy)(pw->p[i].FIELD);
721 if (!any_divs(set)) {
722 if (fn(set, el, user) < 0)
726 if (foreach_lifted_subset(set, el, fn, user) < 0)
733 __isl_give PW *FN(PW,move_dims)(__isl_take PW *pw,
734 enum isl_dim_type dst_type, unsigned dst_pos,
735 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
743 pw->dim = isl_dim_move(pw->dim, dst_type, dst_pos, src_type, src_pos, n);
747 for (i = 0; i < pw->n; ++i) {
748 pw->p[i].set = isl_set_move_dims(pw->p[i].set,
750 src_type, src_pos, n);
753 pw->p[i].FIELD = FN(EL,move_dims)(pw->p[i].FIELD,
754 dst_type, dst_pos, src_type, src_pos, n);