evalue_isl.c

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