evalue_isl.c

   1 #include <isl/aff.h>
   2 #include <isl_set_polylib.h>
   3 #include <isl/constraint.h>
   4 #include <isl/seq.h>
   5 #include <barvinok/evalue.h>
   6
   7 static __isl_give isl_qpolynomial *extract_base(__isl_take isl_space *dim,
   8         const evalue *e)
   9 {
  10         int i;
  11         isl_ctx *ctx;
  12         isl_vec *v;
  13         isl_local_space *ls;
  14         isl_aff *aff;
  15         isl_qpolynomial *base, *c;
  16         unsigned nparam;
  17
  18         if (!dim)
  19                 return NULL;
  20
  21         if (e->x.p->type == polynomial)
  22                 return isl_qpolynomial_var_on_domain(dim, isl_dim_param, e->x.p->pos - 1);
  23
  24         ctx = isl_space_get_ctx(dim);
  25         nparam = isl_space_dim(dim, isl_dim_param);
  26         v = isl_vec_alloc(ctx, 2 + nparam);
  27         if (!v)
  28                 goto error;
  29
  30         isl_seq_clr(v->el + 2, nparam);
  31         evalue_extract_affine(&e->x.p->arr[0], v->el + 2, &v->el[1], &v->el[0]);
  32
  33         ls = isl_local_space_from_space(isl_space_copy(dim));
  34         aff = isl_aff_zero_on_domain(ls);
  35         aff = isl_aff_set_constant(aff, v->el[1]);
  36         aff = isl_aff_set_denominator(aff, v->el[0]);
  37
  38         for (i = 0; i < nparam; ++i)
  39                 aff = isl_aff_set_coefficient(aff, isl_dim_param, i,
  40                                                 v->el[2 + i]);
  41
  42         aff = isl_aff_floor(aff);
  43         base = isl_qpolynomial_from_aff(aff);
  44
  45         if (e->x.p->type == fractional) {
  46                 base = isl_qpolynomial_neg(base);
  47
  48                 c = isl_qpolynomial_rat_cst_on_domain(isl_space_copy(dim), v->el[1], v->el[0]);
  49                 base = isl_qpolynomial_add(base, c);
  50
  51                 for (i = 0; i < nparam; ++i) {
  52                         isl_qpolynomial *t;
  53                         c = isl_qpolynomial_rat_cst_on_domain(isl_space_copy(dim),
  54                                                         v->el[2 + i], v->el[0]);
  55                         t = isl_qpolynomial_var_on_domain(isl_space_copy(dim),
  56                                                 isl_dim_param, i);
  57                         t = isl_qpolynomial_mul(c, t);
  58                         base = isl_qpolynomial_add(base, t);
  59                 }
  60         }
  61
  62         isl_vec_free(v);
  63         isl_space_free(dim);
  64
  65         return base;
  66 error:
  67         isl_space_free(dim);
  68         return NULL;
  69 }
  70
  71 static int type_offset(enode *p)
  72 {
  73         return p->type == fractional ? 1 :
  74                p->type == flooring ? 1 : 0;
  75 }
  76
  77 __isl_give isl_qpolynomial *isl_qpolynomial_from_evalue(__isl_take isl_space *dim,
  78         const evalue *e)
  79 {
  80         int i;
  81         isl_qpolynomial *qp;
  82         isl_qpolynomial *base;
  83         int offset;
  84
  85         if (EVALUE_IS_NAN(*e))
  86                 return isl_qpolynomial_infty_on_domain(dim);
  87         if (value_notzero_p(e->d))
  88                 return isl_qpolynomial_rat_cst_on_domain(dim, e->x.n, e->d);
  89
  90         offset = type_offset(e->x.p);
  91
  92         assert(e->x.p->type == polynomial ||
  93                e->x.p->type == flooring ||
  94                e->x.p->type == fractional);
  95         assert(e->x.p->size >= 1 + offset);
  96
  97         base = extract_base(isl_space_copy(dim), e);
  98         qp = isl_qpolynomial_from_evalue(isl_space_copy(dim),
  99                                          &e->x.p->arr[e->x.p->size - 1]);
 100
 101         for (i = e->x.p->size - 2; i >= offset; --i) {
 102                 qp = isl_qpolynomial_mul(qp, isl_qpolynomial_copy(base));
 103                 qp = isl_qpolynomial_add(qp,
 104                                     isl_qpolynomial_from_evalue(isl_space_copy(dim),
 105                                     &e->x.p->arr[i]));
 106         }
 107
 108         isl_qpolynomial_free(base);
 109         isl_space_free(dim);
 110
 111         return qp;
 112 }
 113
 114 static __isl_give isl_pw_qpolynomial *guarded_evalue2pwqp(__isl_take isl_set *set,
 115         const evalue *e);
 116
 117 static __isl_give isl_pw_qpolynomial *relation2pwqp(__isl_take isl_set *set,
 118         const evalue *e)
 119 {
 120         int i;
 121         isl_vec *vec;
 122         isl_space *dim;
 123         isl_ctx *ctx;
 124         unsigned nparam;
 125         isl_pw_qpolynomial *pwqp;
 126         struct isl_constraint *c;
 127         struct isl_basic_set *bset;
 128         struct isl_set *guard;
 129         const evalue *fract;
 130
 131         if (!set || !e)
 132                 goto error;
 133
 134         if (e->x.p->size == 1) {
 135                 dim = isl_set_get_space(set);
 136                 isl_set_free(set);
 137                 return isl_pw_qpolynomial_zero(dim);
 138         }
 139
 140         ctx = isl_set_get_ctx(set);
 141         isl_assert(ctx, e->x.p->size > 0, goto error);
 142         isl_assert(ctx, e->x.p->size <= 3, goto error);
 143         isl_assert(ctx, value_zero_p(e->x.p->arr[0].d), goto error);
 144         isl_assert(ctx, e->x.p->arr[0].x.p->type == fractional, goto error);
 145         fract = &e->x.p->arr[0];
 146
 147         nparam = isl_set_dim(set, isl_dim_param);
 148         vec = isl_vec_alloc(ctx, 2 + nparam + 1);
 149         if (!vec)
 150                 goto error;
 151
 152         isl_seq_clr(vec->el + 2, nparam);
 153         evalue_extract_affine(&fract->x.p->arr[0],
 154                                 vec->el + 2, &vec->el[1], &vec->el[0]);
 155
 156         dim = isl_set_get_space(set);
 157         dim = isl_space_add_dims(dim, isl_dim_set, 1);
 158
 159         bset = isl_basic_set_universe(isl_space_copy(dim));
 160         c = isl_equality_alloc(isl_local_space_from_space(dim));
 161         isl_int_neg(vec->el[0], vec->el[0]);
 162         isl_constraint_set_coefficient(c, isl_dim_set, 0, vec->el[0]);
 163         isl_constraint_set_constant(c, vec->el[1]);
 164         for (i = 0; i < nparam; ++i)
 165                 isl_constraint_set_coefficient(c, isl_dim_param, i, vec->el[2+i]);
 166         bset = isl_basic_set_add_constraint(bset, c);
 167         bset = isl_basic_set_params(bset);
 168         guard = isl_set_from_basic_set(bset);
 169         isl_vec_free(vec);
 170
 171         pwqp = guarded_evalue2pwqp(isl_set_intersect(isl_set_copy(set),
 172                                                      isl_set_copy(guard)),
 173                                    &e->x.p->arr[1]);
 174
 175         if (e->x.p->size == 3) {
 176                 isl_pw_qpolynomial *pwqpc;
 177                 guard = isl_set_complement(guard);
 178                 pwqpc = guarded_evalue2pwqp(isl_set_intersect(isl_set_copy(set),
 179                                                               isl_set_copy(guard)),
 180                                             &e->x.p->arr[2]);
 181                 pwqp = isl_pw_qpolynomial_add_disjoint(pwqp, pwqpc);
 182         }
 183
 184         isl_set_free(set);
 185         isl_set_free(guard);
 186
 187         return pwqp;
 188 error:
 189         isl_set_free(set);
 190         return NULL;
 191 }
 192
 193 static __isl_give isl_pw_qpolynomial *guarded_evalue2pwqp(__isl_take isl_set *set,
 194         const evalue *e)
 195 {
 196         isl_qpolynomial *qp;
 197
 198         if (value_zero_p(e->d) && e->x.p->type == relation)
 199                 return relation2pwqp(set, e);
 200
 201         qp = isl_qpolynomial_from_evalue(isl_set_get_space(set), e);
 202
 203         return isl_pw_qpolynomial_alloc(set, qp);
 204 }
 205
 206 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_from_evalue(__isl_take isl_space *dim, const evalue *e)
 207 {
 208         int i;
 209         isl_space *pw_space;
 210         isl_pw_qpolynomial *pwqp;
 211
 212         if (!dim || !e)
 213                 goto error;
 214         if (EVALUE_IS_ZERO(*e)) {
 215                 dim = isl_space_from_domain(dim);
 216                 dim = isl_space_add_dims(dim, isl_dim_out, 1);
 217                 return isl_pw_qpolynomial_zero(dim);
 218         }
 219
 220         if (value_notzero_p(e->d)) {
 221                 isl_set *set = isl_set_universe(isl_space_copy(dim));
 222                 isl_qpolynomial *qp = isl_qpolynomial_rat_cst_on_domain(dim, e->x.n, e->d);
 223                 return isl_pw_qpolynomial_alloc(set, qp);
 224         }
 225
 226         assert(!EVALUE_IS_NAN(*e));
 227
 228         assert(e->x.p->type == partition);
 229
 230         pw_space = isl_space_copy(dim);
 231         pw_space = isl_space_from_domain(pw_space);
 232         pw_space = isl_space_add_dims(pw_space, isl_dim_out, 1);
 233         pwqp = isl_pw_qpolynomial_zero(pw_space);
 234
 235         for (i = 0; i < e->x.p->size/2; ++i) {
 236                 Polyhedron *D = EVALUE_DOMAIN(e->x.p->arr[2 * i]);
 237                 isl_set *set = isl_set_new_from_polylib(D, isl_space_copy(dim));
 238                 isl_pw_qpolynomial *pwqp_i;
 239
 240                 pwqp_i = guarded_evalue2pwqp(set, &e->x.p->arr[2 * i + 1]);
 241
 242                 pwqp = isl_pw_qpolynomial_add_disjoint(pwqp, pwqp_i);
 243         }
 244
 245         isl_space_free(dim);
 246
 247         return pwqp;
 248 error:
 249         isl_space_free(dim);
 250         return NULL;
 251 }
 252
 253 static evalue *evalue_pow(evalue *e, int exp)
 254 {
 255         evalue *pow;
 256
 257         if (exp == 1)
 258                 return e;
 259
 260         pow = evalue_dup(e);
 261         while (--exp > 0)
 262                 emul(e, pow);
 263
 264         evalue_free(e);
 265
 266         return pow;
 267 }
 268
 269 static evalue *div2evalue(__isl_take isl_aff *div)
 270 {
 271         int i;
 272         isl_ctx *ctx;
 273         isl_vec *vec;
 274         unsigned dim;
 275         unsigned nparam;
 276         evalue *e;
 277         evalue *aff;
 278
 279         if (!div)
 280                 return NULL;
 281
 282         dim = isl_aff_dim(div, isl_dim_in);
 283         nparam = isl_aff_dim(div, isl_dim_param);
 284
 285         ctx = isl_aff_get_ctx(div);
 286         vec = isl_vec_alloc(ctx, 1 + dim + nparam + 1);
 287         if (!vec)
 288                 goto error;
 289         for (i = 0; i < dim; ++i)
 290                 isl_aff_get_coefficient(div, isl_dim_in, i, &vec->el[1 + i]);
 291         for (i = 0; i < nparam; ++i)
 292                 isl_aff_get_coefficient(div, isl_dim_param, i,
 293                                         &vec->el[1 + dim + i]);
 294         isl_aff_get_denominator(div, &vec->el[0]);
 295         isl_aff_get_constant(div, &vec->el[1 + dim + nparam]);
 296
 297         e = isl_alloc_type(ctx, evalue);
 298         if (!e)
 299                 goto error;
 300         value_init(e->d);
 301         value_set_si(e->d, 0);
 302         e->x.p = new_enode(flooring, 3, -1);
 303         evalue_set_si(&e->x.p->arr[1], 0, 1);
 304         evalue_set_si(&e->x.p->arr[2], 1, 1);
 305         value_clear(e->x.p->arr[0].d);
 306         aff = affine2evalue(vec->el + 1, vec->el[0], dim + nparam);
 307         e->x.p->arr[0] = *aff;
 308         free(aff);
 309         isl_vec_free(vec);
 310         isl_aff_free(div);
 311         return e;
 312 error:
 313         isl_vec_free(vec);
 314         isl_aff_free(div);
 315         return NULL;
 316 }
 317
 318 static int add_term(__isl_take isl_term *term, void *user)
 319 {
 320         int i;
 321         evalue *sum = (evalue *)user;
 322         unsigned nparam;
 323         unsigned dim;
 324         unsigned n_div;
 325         isl_ctx *ctx;
 326         isl_int n, d;
 327         evalue *e;
 328
 329         if (!term)
 330                 return -1;
 331
 332         nparam = isl_term_dim(term, isl_dim_param);
 333         dim = isl_term_dim(term, isl_dim_set);
 334         n_div = isl_term_dim(term, isl_dim_div);
 335
 336         ctx = isl_term_get_ctx(term);
 337         e = isl_alloc_type(ctx, evalue);
 338         if (!e)
 339                 goto error;
 340
 341         isl_int_init(n);
 342         isl_int_init(d);
 343
 344         isl_term_get_num(term, &n);
 345         isl_term_get_den(term, &d);
 346         value_init(e->d);
 347         evalue_set(e, n, d);
 348
 349         for (i = 0; i < dim; ++i) {
 350                 evalue *pow;
 351                 int exp = isl_term_get_exp(term, isl_dim_set, i);
 352
 353                 if (!exp)
 354                         continue;
 355
 356                 pow = evalue_pow(evalue_var(i), exp);
 357                 emul(pow, e);
 358                 evalue_free(pow);
 359         }
 360
 361         for (i = 0; i < nparam; ++i) {
 362                 evalue *pow;
 363                 int exp = isl_term_get_exp(term, isl_dim_param, i);
 364
 365                 if (!exp)
 366                         continue;
 367
 368                 pow = evalue_pow(evalue_var(dim + i), exp);
 369                 emul(pow, e);
 370                 evalue_free(pow);
 371         }
 372
 373         for (i = 0; i < n_div; ++i) {
 374                 evalue *pow;
 375                 evalue *floor;
 376                 isl_aff *div;
 377                 int exp = isl_term_get_exp(term, isl_dim_div, i);
 378
 379                 if (!exp)
 380                         continue;
 381
 382                 div = isl_term_get_div(term, i);
 383                 floor = div2evalue(div);
 384                 pow = evalue_pow(floor, exp);
 385                 emul(pow, e);
 386                 evalue_free(pow);
 387         }
 388
 389         eadd(e, sum);
 390         evalue_free(e);
 391
 392         isl_int_clear(n);
 393         isl_int_clear(d);
 394
 395         isl_term_free(term);
 396
 397         return 0;
 398 error:
 399         isl_term_free(term);
 400         return -1;
 401 }
 402
 403 evalue *isl_qpolynomial_to_evalue(__isl_keep isl_qpolynomial *qp)
 404 {
 405         evalue *e;
 406
 407         e = evalue_zero();
 408         if (!e)
 409                 return NULL;
 410
 411         if (isl_qpolynomial_foreach_term(qp, add_term, e) < 0)
 412                 goto error;
 413
 414         return e;
 415 error:
 416         evalue_free(e);
 417         return NULL;
 418 }
 419
 420 static int add_guarded_qp(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
 421         void *user)
 422 {
 423         Polyhedron *D;
 424         evalue *e = NULL;
 425         evalue *f;
 426         evalue *sum = (evalue *)user;
 427         unsigned dim;
 428
 429         e = isl_alloc_type(isl_set_get_ctx(set), evalue);
 430         if (!e)
 431                 goto error;
 432
 433         D = isl_set_to_polylib(set);
 434         if (!D)
 435                 goto error;
 436
 437         f = isl_qpolynomial_to_evalue(qp);
 438         if (!e) {
 439                 Domain_Free(D);
 440                 goto error;
 441         }
 442
 443         dim = isl_set_dim(set, isl_dim_param) + isl_set_dim(set, isl_dim_set);
 444         value_init(e->d);
 445         e->x.p = new_enode(partition, 2, D->Dimension);
 446         EVALUE_SET_DOMAIN(e->x.p->arr[0], D);
 447
 448         value_clear(e->x.p->arr[1].d);
 449         e->x.p->arr[1] = *f;
 450         free(f);
 451
 452         eadd(e, sum);
 453         evalue_free(e);
 454
 455         isl_set_free(set);
 456         isl_qpolynomial_free(qp);
 457
 458         return 0;
 459 error:
 460         free(e);
 461         isl_set_free(set);
 462         isl_qpolynomial_free(qp);
 463         return -1;
 464 }
 465
 466 evalue *isl_pw_qpolynomial_to_evalue(__isl_keep isl_pw_qpolynomial *pwqp)
 467 {
 468         evalue *e;
 469
 470         if (!pwqp)
 471                 return NULL;
 472         e = evalue_zero();
 473
 474         if (isl_pw_qpolynomial_foreach_piece(pwqp, add_guarded_qp, e))
 475                 goto error;
 476
 477         return e;
 478 error:
 479         evalue_free(e);
 480         return NULL;
 481 }