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 = 0; i < pw->n; ++i) {
315 pw->p[i].set = isl_set_intersect(pw->p[i].set, isl_set_copy(set));
328 __isl_give PW *FN(PW,gist)(__isl_take PW *pw, __isl_take isl_set *context)
331 isl_basic_set *hull = NULL;
337 isl_set_free(context);
341 hull = isl_set_convex_hull(isl_set_copy(context));
347 for (i = 0; i < pw->n; ++i) {
348 pw->p[i].set = isl_set_gist_basic_set(pw->p[i].set,
349 isl_basic_set_copy(hull));
354 isl_basic_set_free(hull);
355 isl_set_free(context);
360 isl_basic_set_free(hull);
361 isl_set_free(context);
365 __isl_give PW *FN(PW,coalesce)(__isl_take PW *pw)
374 for (i = pw->n - 1; i >= 0; --i) {
375 for (j = i - 1; j >= 0; --j) {
376 if (!FN(EL,is_equal)(pw->p[i].FIELD, pw->p[j].FIELD))
378 pw->p[j].set = isl_set_union(pw->p[j].set,
380 FN(EL,free)(pw->p[i].FIELD);
382 pw->p[i] = pw->p[pw->n - 1];
388 pw->p[i].set = isl_set_coalesce(pw->p[i].set);
399 isl_ctx *FN(PW,get_ctx)(__isl_keep PW *pw)
401 return pw ? pw->dim->ctx : NULL;
404 int FN(PW,involves_dims)(__isl_keep PW *pw, enum isl_dim_type type,
405 unsigned first, unsigned n)
411 if (pw->n == 0 || n == 0)
413 for (i = 0; i < pw->n; ++i) {
414 int involves = FN(EL,involves_dims)(pw->p[i].FIELD,
416 if (involves < 0 || involves)
422 __isl_give PW *FN(PW,drop_dims)(__isl_take PW *pw,
423 enum isl_dim_type type, unsigned first, unsigned n)
435 pw->dim = isl_dim_drop(pw->dim, type, first, n);
438 for (i = 0; i < pw->n; ++i) {
439 pw->p[i].set = isl_set_drop(pw->p[i].set, type, first, n);
442 pw->p[i].FIELD = FN(EL,drop_dims)(pw->p[i].FIELD, type, first, n);
453 __isl_give PW *FN(PW,fix_dim)(__isl_take PW *pw,
454 enum isl_dim_type type, unsigned pos, isl_int v)
464 for (i = 0; i < pw->n; ++i) {
465 pw->p[i].set = isl_set_fix(pw->p[i].set, type, pos, v);
476 unsigned FN(PW,dim)(__isl_keep PW *pw, enum isl_dim_type type)
478 return pw ? isl_dim_size(pw->dim, type) : 0;
481 __isl_give PW *FN(PW,split_dims)(__isl_take PW *pw,
482 enum isl_dim_type type, unsigned first, unsigned n)
496 for (i = 0; i < pw->n; ++i) {
497 pw->p[i].set = isl_set_split_dims(pw->p[i].set, type, first, n);
508 /* Compute the maximal value attained by the piecewise quasipolynomial
509 * on its domain or zero if the domain is empty.
510 * In the worst case, the domain is scanned completely,
511 * so the domain is assumed to be bounded.
513 __isl_give isl_qpolynomial *FN(PW,opt)(__isl_take PW *pw, int max)
516 isl_qpolynomial *opt;
522 isl_dim *dim = isl_dim_copy(pw->dim);
524 return isl_qpolynomial_zero(dim);
527 opt = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[0].FIELD),
528 isl_set_copy(pw->p[0].set), max);
529 for (i = 1; i < pw->n; ++i) {
530 isl_qpolynomial *opt_i;
531 opt_i = FN(EL,opt_on_domain)(FN(EL,copy)(pw->p[i].FIELD),
532 isl_set_copy(pw->p[i].set), max);
534 opt = isl_qpolynomial_max_cst(opt, opt_i);
536 opt = isl_qpolynomial_min_cst(opt, opt_i);
543 __isl_give isl_qpolynomial *FN(PW,max)(__isl_take PW *pw)
545 return FN(PW,opt)(pw, 1);
548 __isl_give isl_qpolynomial *FN(PW,min)(__isl_take PW *pw)
550 return FN(PW,opt)(pw, 0);
553 __isl_give isl_dim *FN(PW,get_dim)(__isl_keep PW *pw)
555 return pw ? isl_dim_copy(pw->dim) : NULL;