evalue_isl.c

   1 #include <isl/aff.h>
   2 #include <isl_set_polylib.h>
   3 #include <isl/constraint.h>
   4 #include <barvinok/evalue.h>
   5
   6 static __isl_give isl_qpolynomial *extract_base(__isl_take isl_space *dim,
   7         const evalue *e)
   8 {
   9         int i;
  10         Vector *v;
  11         isl_ctx *ctx;
  12         isl_local_space *ls;
  13         isl_aff *aff;
  14         isl_qpolynomial *base, *c;
  15         unsigned nparam;
  16
  17         if (!dim)
  18                 return NULL;
  19
  20         if (e->x.p->type == polynomial)
  21                 return isl_qpolynomial_var_on_domain(dim, isl_dim_param, e->x.p->pos - 1);
  22
  23         ctx = isl_space_get_ctx(dim);
  24         nparam = isl_space_dim(dim, isl_dim_param);
  25         v = Vector_Alloc(2 + nparam);
  26         if (!v)
  27                 goto error;
  28
  29         for (i = 0; i < nparam; ++i)
  30                 value_set_si(v->p[2 + i], 0);
  31         evalue_extract_affine(&e->x.p->arr[0], v->p + 2, &v->p[1], &v->p[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->p[1]);
  36         aff = isl_aff_set_denominator(aff, v->p[0]);
  37
  38         for (i = 0; i < nparam; ++i)
  39                 aff = isl_aff_set_coefficient(aff, isl_dim_param, i,
  40                                                 v->p[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->p[1], v->p[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->p[2 + i], v->p[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         Vector_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         Vector *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 = Vector_Alloc(2 + nparam + 1);
 149         if (!vec)
 150                 goto error;
 151
 152         for (i = 0; i < nparam; ++i)
 153                 value_set_si(vec->p[2 + i], 0);
 154         evalue_extract_affine(&fract->x.p->arr[0],
 155                                 vec->p + 2, &vec->p[1], &vec->p[0]);
 156
 157         dim = isl_set_get_space(set);
 158         dim = isl_space_add_dims(dim, isl_dim_set, 1);
 159
 160         bset = isl_basic_set_universe(isl_space_copy(dim));
 161         c = isl_equality_alloc(isl_local_space_from_space(dim));
 162         isl_int_neg(vec->p[0], vec->p[0]);
 163         isl_constraint_set_coefficient(c, isl_dim_set, 0, vec->p[0]);
 164         isl_constraint_set_constant(c, vec->p[1]);
 165         for (i = 0; i < nparam; ++i)
 166                 isl_constraint_set_coefficient(c, isl_dim_param, i, vec->p[2+i]);
 167         bset = isl_basic_set_add_constraint(bset, c);
 168         bset = isl_basic_set_params(bset);
 169         guard = isl_set_from_basic_set(bset);
 170         Vector_Free(vec);
 171
 172         pwqp = guarded_evalue2pwqp(isl_set_intersect(isl_set_copy(set),
 173                                                      isl_set_copy(guard)),
 174                                    &e->x.p->arr[1]);
 175
 176         if (e->x.p->size == 3) {
 177                 isl_pw_qpolynomial *pwqpc;
 178                 guard = isl_set_complement(guard);
 179                 pwqpc = guarded_evalue2pwqp(isl_set_intersect(isl_set_copy(set),
 180                                                               isl_set_copy(guard)),
 181                                             &e->x.p->arr[2]);
 182                 pwqp = isl_pw_qpolynomial_add_disjoint(pwqp, pwqpc);
 183         }
 184
 185         isl_set_free(set);
 186         isl_set_free(guard);
 187
 188         return pwqp;
 189 error:
 190         isl_set_free(set);
 191         return NULL;
 192 }
 193
 194 static __isl_give isl_pw_qpolynomial *guarded_evalue2pwqp(__isl_take isl_set *set,
 195         const evalue *e)
 196 {
 197         isl_qpolynomial *qp;
 198
 199         if (value_zero_p(e->d) && e->x.p->type == relation)
 200                 return relation2pwqp(set, e);
 201
 202         qp = isl_qpolynomial_from_evalue(isl_set_get_space(set), e);
 203
 204         return isl_pw_qpolynomial_alloc(set, qp);
 205 }
 206
 207 __isl_give isl_pw_qpolynomial *isl_pw_qpolynomial_from_evalue(__isl_take isl_space *dim, const evalue *e)
 208 {
 209         int i;
 210         isl_space *pw_space;
 211         isl_pw_qpolynomial *pwqp;
 212
 213         if (!dim || !e)
 214                 goto error;
 215         if (EVALUE_IS_ZERO(*e)) {
 216                 dim = isl_space_from_domain(dim);
 217                 dim = isl_space_add_dims(dim, isl_dim_out, 1);
 218                 return isl_pw_qpolynomial_zero(dim);
 219         }
 220
 221         if (value_notzero_p(e->d)) {
 222                 isl_set *set = isl_set_universe(isl_space_copy(dim));
 223                 isl_qpolynomial *qp = isl_qpolynomial_rat_cst_on_domain(dim, e->x.n, e->d);
 224                 return isl_pw_qpolynomial_alloc(set, qp);
 225         }
 226
 227         assert(!EVALUE_IS_NAN(*e));
 228
 229         assert(e->x.p->type == partition);
 230
 231         pw_space = isl_space_copy(dim);
 232         pw_space = isl_space_from_domain(pw_space);
 233         pw_space = isl_space_add_dims(pw_space, isl_dim_out, 1);
 234         pwqp = isl_pw_qpolynomial_zero(pw_space);
 235
 236         for (i = 0; i < e->x.p->size/2; ++i) {
 237                 Polyhedron *D = EVALUE_DOMAIN(e->x.p->arr[2 * i]);
 238                 isl_set *set = isl_set_new_from_polylib(D, isl_space_copy(dim));
 239                 isl_pw_qpolynomial *pwqp_i;
 240
 241                 pwqp_i = guarded_evalue2pwqp(set, &e->x.p->arr[2 * i + 1]);
 242
 243                 pwqp = isl_pw_qpolynomial_add_disjoint(pwqp, pwqp_i);
 244         }
 245
 246         isl_space_free(dim);
 247
 248         return pwqp;
 249 error:
 250         isl_space_free(dim);
 251         return NULL;
 252 }
 253
 254 static evalue *evalue_pow(evalue *e, int exp)
 255 {
 256         evalue *pow;
 257
 258         if (exp == 1)
 259                 return e;
 260
 261         pow = evalue_dup(e);
 262         while (--exp > 0)
 263                 emul(e, pow);
 264
 265         evalue_free(e);
 266
 267         return pow;
 268 }
 269
 270 static evalue *div2evalue(__isl_take isl_aff *div)
 271 {
 272         int i;
 273         isl_ctx *ctx;
 274         Vector *vec = NULL;
 275         unsigned dim;
 276         unsigned nparam;
 277         evalue *e;
 278         evalue *aff;
 279
 280         if (!div)
 281                 return NULL;
 282
 283         if (isl_aff_dim(div, isl_dim_div) != 0)
 284                 isl_die(isl_aff_get_ctx(div), isl_error_unsupported,
 285                         "cannot handle nested divs", goto error);
 286
 287         dim = isl_aff_dim(div, isl_dim_in);
 288         nparam = isl_aff_dim(div, isl_dim_param);
 289
 290         ctx = isl_aff_get_ctx(div);
 291         vec = Vector_Alloc(1 + dim + nparam + 1);
 292         if (!vec)
 293                 goto error;
 294         for (i = 0; i < dim; ++i)
 295                 isl_aff_get_coefficient(div, isl_dim_in, i, &vec->p[1 + i]);
 296         for (i = 0; i < nparam; ++i)
 297                 isl_aff_get_coefficient(div, isl_dim_param, i,
 298                                         &vec->p[1 + dim + i]);
 299         isl_aff_get_denominator(div, &vec->p[0]);
 300         isl_aff_get_constant(div, &vec->p[1 + dim + nparam]);
 301
 302         e = isl_alloc_type(ctx, evalue);
 303         if (!e)
 304                 goto error;
 305         value_init(e->d);
 306         value_set_si(e->d, 0);
 307         e->x.p = new_enode(flooring, 3, -1);
 308         evalue_set_si(&e->x.p->arr[1], 0, 1);
 309         evalue_set_si(&e->x.p->arr[2], 1, 1);
 310         value_clear(e->x.p->arr[0].d);
 311         aff = affine2evalue(vec->p + 1, vec->p[0], dim + nparam);
 312         e->x.p->arr[0] = *aff;
 313         free(aff);
 314         Vector_Free(vec);
 315         isl_aff_free(div);
 316         return e;
 317 error:
 318         Vector_Free(vec);
 319         isl_aff_free(div);
 320         return NULL;
 321 }
 322
 323 static int add_term(__isl_take isl_term *term, void *user)
 324 {
 325         int i;
 326         evalue *sum = (evalue *)user;
 327         unsigned nparam;
 328         unsigned dim;
 329         unsigned n_div;
 330         isl_ctx *ctx;
 331         isl_int n, d;
 332         evalue *e;
 333
 334         if (!term)
 335                 return -1;
 336
 337         nparam = isl_term_dim(term, isl_dim_param);
 338         dim = isl_term_dim(term, isl_dim_set);
 339         n_div = isl_term_dim(term, isl_dim_div);
 340
 341         ctx = isl_term_get_ctx(term);
 342         e = isl_alloc_type(ctx, evalue);
 343         if (!e)
 344                 goto error;
 345
 346         isl_int_init(n);
 347         isl_int_init(d);
 348
 349         isl_term_get_num(term, &n);
 350         isl_term_get_den(term, &d);
 351         value_init(e->d);
 352         evalue_set(e, n, d);
 353
 354         for (i = 0; i < dim; ++i) {
 355                 evalue *pow;
 356                 int exp = isl_term_get_exp(term, isl_dim_set, i);
 357
 358                 if (!exp)
 359                         continue;
 360
 361                 pow = evalue_pow(evalue_var(i), exp);
 362                 emul(pow, e);
 363                 evalue_free(pow);
 364         }
 365
 366         for (i = 0; i < nparam; ++i) {
 367                 evalue *pow;
 368                 int exp = isl_term_get_exp(term, isl_dim_param, i);
 369
 370                 if (!exp)
 371                         continue;
 372
 373                 pow = evalue_pow(evalue_var(dim + i), exp);
 374                 emul(pow, e);
 375                 evalue_free(pow);
 376         }
 377
 378         for (i = 0; i < n_div; ++i) {
 379                 evalue *pow;
 380                 evalue *floor;
 381                 isl_aff *div;
 382                 int exp = isl_term_get_exp(term, isl_dim_div, i);
 383
 384                 if (!exp)
 385                         continue;
 386
 387                 div = isl_term_get_div(term, i);
 388                 floor = div2evalue(div);
 389                 if (!floor)
 390                         goto error2;
 391                 pow = evalue_pow(floor, exp);
 392                 emul(pow, e);
 393                 evalue_free(pow);
 394         }
 395
 396         eadd(e, sum);
 397         evalue_free(e);
 398
 399         isl_int_clear(n);
 400         isl_int_clear(d);
 401
 402         isl_term_free(term);
 403
 404         return 0;
 405 error2:
 406         evalue_free(e);
 407         isl_int_clear(n);
 408         isl_int_clear(d);
 409 error:
 410         isl_term_free(term);
 411         return -1;
 412 }
 413
 414 evalue *isl_qpolynomial_to_evalue(__isl_keep isl_qpolynomial *qp)
 415 {
 416         evalue *e;
 417
 418         e = evalue_zero();
 419         if (!e)
 420                 return NULL;
 421
 422         if (isl_qpolynomial_foreach_term(qp, add_term, e) < 0)
 423                 goto error;
 424
 425         return e;
 426 error:
 427         evalue_free(e);
 428         return NULL;
 429 }
 430
 431 static int add_guarded_qp(__isl_take isl_set *set, __isl_take isl_qpolynomial *qp,
 432         void *user)
 433 {
 434         Polyhedron *D;
 435         evalue *e = NULL;
 436         evalue *f;
 437         evalue *sum = (evalue *)user;
 438         unsigned dim;
 439
 440         e = isl_alloc_type(isl_set_get_ctx(set), evalue);
 441         if (!e)
 442                 goto error;
 443
 444         D = isl_set_to_polylib(set);
 445         if (!D)
 446                 goto error;
 447
 448         f = isl_qpolynomial_to_evalue(qp);
 449         if (!e) {
 450                 Domain_Free(D);
 451                 goto error;
 452         }
 453
 454         dim = isl_set_dim(set, isl_dim_param) + isl_set_dim(set, isl_dim_set);
 455         value_init(e->d);
 456         e->x.p = new_enode(partition, 2, D->Dimension);
 457         EVALUE_SET_DOMAIN(e->x.p->arr[0], D);
 458
 459         value_clear(e->x.p->arr[1].d);
 460         e->x.p->arr[1] = *f;
 461         free(f);
 462
 463         eadd(e, sum);
 464         evalue_free(e);
 465
 466         isl_set_free(set);
 467         isl_qpolynomial_free(qp);
 468
 469         return 0;
 470 error:
 471         free(e);
 472         isl_set_free(set);
 473         isl_qpolynomial_free(qp);
 474         return -1;
 475 }
 476
 477 evalue *isl_pw_qpolynomial_to_evalue(__isl_keep isl_pw_qpolynomial *pwqp)
 478 {
 479         evalue *e;
 480
 481         if (!pwqp)
 482                 return NULL;
 483         e = evalue_zero();
 484
 485         if (isl_pw_qpolynomial_foreach_piece(pwqp, add_guarded_qp, e))
 486                 goto error;
 487
 488         return e;
 489 error:
 490         evalue_free(e);
 491         return NULL;
 492 }