evalue_isl.c

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