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_ctx *ctx = isl_space_get_ctx(dim);
 239                 isl_set *set = isl_set_universe(isl_space_copy(dim));
 240                 isl_val *val = isl_val_from_gmp(ctx, e->x.n, e->d);
 241                 isl_qpolynomial *qp = isl_qpolynomial_val_on_domain(dim, val);
 242                 return isl_pw_qpolynomial_alloc(set, qp);
 243         }
 244
 245         assert(!EVALUE_IS_NAN(*e));
 246
 247         assert(e->x.p->type == partition);
 248
 249         pw_space = isl_space_copy(dim);
 250         pw_space = isl_space_from_domain(pw_space);
 251         pw_space = isl_space_add_dims(pw_space, isl_dim_out, 1);
 252         pwqp = isl_pw_qpolynomial_zero(pw_space);
 253
 254         for (i = 0; i < e->x.p->size/2; ++i) {
 255                 Polyhedron *D = EVALUE_DOMAIN(e->x.p->arr[2 * i]);
 256                 isl_set *set = isl_set_new_from_polylib(D, isl_space_copy(dim));
 257                 isl_pw_qpolynomial *pwqp_i;
 258
 259                 pwqp_i = guarded_evalue2pwqp(set, &e->x.p->arr[2 * i + 1]);
 260
 261                 pwqp = isl_pw_qpolynomial_add_disjoint(pwqp, pwqp_i);
 262         }
 263
 264         isl_space_free(dim);
 265
 266         return pwqp;
 267 error:
 268         isl_space_free(dim);
 269         return NULL;
 270 }
 271
 272 static evalue *evalue_pow(evalue *e, int exp)
 273 {
 274         evalue *pow;
 275
 276         if (exp == 1)
 277                 return e;
 278
 279         pow = evalue_dup(e);
 280         while (--exp > 0)
 281                 emul(e, pow);
 282
 283         evalue_free(e);
 284
 285         return pow;
 286 }
 287
 288 static evalue *div2evalue(__isl_take isl_aff *div)
 289 {
 290         int i;
 291         isl_ctx *ctx;
 292         Vector *vec = NULL;
 293         unsigned dim;
 294         unsigned nparam;
 295         evalue *e;
 296         evalue *aff;
 297
 298         if (!div)
 299                 return NULL;
 300
 301         if (isl_aff_dim(div, isl_dim_div) != 0)
 302                 isl_die(isl_aff_get_ctx(div), isl_error_unsupported,
 303                         "cannot handle nested divs", goto error);
 304
 305         dim = isl_aff_dim(div, isl_dim_in);
 306         nparam = isl_aff_dim(div, isl_dim_param);
 307
 308         ctx = isl_aff_get_ctx(div);
 309         vec = Vector_Alloc(1 + dim + nparam + 1);
 310         if (!vec)
 311                 goto error;
 312         for (i = 0; i < dim; ++i)
 313                 isl_aff_get_coefficient(div, isl_dim_in, i, &vec->p[1 + i]);
 314         for (i = 0; i < nparam; ++i)
 315                 isl_aff_get_coefficient(div, isl_dim_param, i,
 316                                         &vec->p[1 + dim + i]);
 317         isl_aff_get_denominator(div, &vec->p[0]);
 318         isl_aff_get_constant(div, &vec->p[1 + dim + nparam]);
 319
 320         e = isl_alloc_type(ctx, evalue);
 321         if (!e)
 322                 goto error;
 323         value_init(e->d);
 324         value_set_si(e->d, 0);
 325         e->x.p = new_enode(flooring, 3, -1);
 326         evalue_set_si(&e->x.p->arr[1], 0, 1);
 327         evalue_set_si(&e->x.p->arr[2], 1, 1);
 328         value_clear(e->x.p->arr[0].d);
 329         aff = affine2evalue(vec->p + 1, vec->p[0], dim + nparam);
 330         e->x.p->arr[0] = *aff;
 331         free(aff);
 332         Vector_Free(vec);
 333         isl_aff_free(div);
 334         return e;
 335 error:
 336         Vector_Free(vec);
 337         isl_aff_free(div);
 338         return NULL;
 339 }
 340
 341 static int add_term(__isl_take isl_term *term, void *user)
 342 {
 343         int i;
 344         evalue *sum = (evalue *)user;
 345         unsigned nparam;
 346         unsigned dim;
 347         unsigned n_div;
 348         isl_ctx *ctx;
 349         isl_val *v;
 350         Value n, d;
 351         evalue *e;
 352
 353         if (!term)
 354                 return -1;
 355
 356         nparam = isl_term_dim(term, isl_dim_param);
 357         dim = isl_term_dim(term, isl_dim_set);
 358         n_div = isl_term_dim(term, isl_dim_div);
 359
 360         ctx = isl_term_get_ctx(term);
 361         e = isl_alloc_type(ctx, evalue);
 362         if (!e)
 363                 goto error;
 364
 365         value_init(n);
 366         value_init(d);
 367
 368         v = isl_term_get_coefficient_val(term);
 369         isl_val_get_num_gmp(v, n);
 370         isl_val_get_den_gmp(v, d);
 371         isl_val_free(v);
 372         if (!v)
 373                 goto error2;
 374         value_init(e->d);
 375         evalue_set(e, n, d);
 376
 377         for (i = 0; i < dim; ++i) {
 378                 evalue *pow;
 379                 int exp = isl_term_get_exp(term, isl_dim_set, i);
 380
 381                 if (!exp)
 382                         continue;
 383
 384                 pow = evalue_pow(evalue_var(i), exp);
 385                 emul(pow, e);
 386                 evalue_free(pow);
 387         }
 388
 389         for (i = 0; i < nparam; ++i) {
 390                 evalue *pow;
 391                 int exp = isl_term_get_exp(term, isl_dim_param, i);
 392
 393                 if (!exp)
 394                         continue;
 395
 396                 pow = evalue_pow(evalue_var(dim + i), exp);
 397                 emul(pow, e);
 398                 evalue_free(pow);
 399         }
 400
 401         for (i = 0; i < n_div; ++i) {
 402                 evalue *pow;
 403                 evalue *floor;
 404                 isl_aff *div;
 405                 int exp = isl_term_get_exp(term, isl_dim_div, i);
 406
 407                 if (!exp)
 408                         continue;
 409
 410                 div = isl_term_get_div(term, i);
 411                 floor = div2evalue(div);
 412                 if (!floor)
 413                         goto error2;
 414                 pow = evalue_pow(floor, exp);
 415                 emul(pow, e);
 416                 evalue_free(pow);
 417         }
 418
 419         eadd(e, sum);
 420         evalue_free(e);
 421
 422         value_clear(n);
 423         value_clear(d);
 424
 425         isl_term_free(term);
 426
 427         return 0;
 428 error2:
 429         evalue_free(e);
 430         value_clear(n);
 431         value_clear(d);
 432 error:
 433         isl_term_free(term);
 434         return -1;
 435 }
 436
 437 evalue *isl_qpolynomial_to_evalue(__isl_keep isl_qpolynomial *qp)
 438 {
 439         evalue *e;
 440
 441         e = evalue_zero();
 442         if (!e)
 443                 return NULL;
 444
 445         if (isl_qpolynomial_foreach_term(qp, add_term, e) < 0)
 446                 goto error;
 447
 448         return e;
 449 error:
 450         evalue_free(e);
 451         return NULL;
 452 }
 453
 454 static int add_guarded_qp(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
 455         void *user)
 456 {
 457         Polyhedron *D;
 458         evalue *e = NULL;
 459         evalue *f;
 460         evalue *sum = (evalue *)user;
 461         unsigned dim;
 462
 463         e = isl_alloc_type(isl_set_get_ctx(set), evalue);
 464         if (!e)
 465                 goto error;
 466
 467         D = isl_set_to_polylib(set);
 468         if (!D)
 469                 goto error;
 470
 471         f = isl_qpolynomial_to_evalue(qp);
 472         if (!e) {
 473                 Domain_Free(D);
 474                 goto error;
 475         }
 476
 477         dim = isl_set_dim(set, isl_dim_param) + isl_set_dim(set, isl_dim_set);
 478         value_init(e->d);
 479         e->x.p = new_enode(partition, 2, D->Dimension);
 480         EVALUE_SET_DOMAIN(e->x.p->arr[0], D);
 481
 482         value_clear(e->x.p->arr[1].d);
 483         e->x.p->arr[1] = *f;
 484         free(f);
 485
 486         eadd(e, sum);
 487         evalue_free(e);
 488
 489         isl_set_free(set);
 490         isl_qpolynomial_free(qp);
 491
 492         return 0;
 493 error:
 494         free(e);
 495         isl_set_free(set);
 496         isl_qpolynomial_free(qp);
 497         return -1;
 498 }
 499
 500 evalue *isl_pw_qpolynomial_to_evalue(__isl_keep isl_pw_qpolynomial *pwqp)
 501 {
 502         evalue *e;
 503
 504         if (!pwqp)
 505                 return NULL;
 506         e = evalue_zero();
 507
 508         if (isl_pw_qpolynomial_foreach_piece(pwqp, add_guarded_qp, e))
 509                 goto error;
 510
 511         return e;
 512 error:
 513         evalue_free(e);
 514         return NULL;
 515 }