isl_map.c

   1 #include <string.h>
   2 #include <strings.h>
   3 #include "isl_ctx.h"
   4 #include "isl_blk.h"
   5 #include "isl_dim.h"
   6 #include "isl_equalities.h"
   7 #include "isl_list.h"
   8 #include "isl_lp.h"
   9 #include "isl_seq.h"
  10 #include "isl_set.h"
  11 #include "isl_map.h"
  12 #include "isl_map_private.h"
  13 #include "isl_map_piplib.h"
  14 #include "isl_sample.h"
  15 #include "isl_vec.h"
  16
  17 /* Maps dst positions to src positions */
  18 struct isl_dim_map {
  19         unsigned len;
  20         int pos[1];
  21 };
  22
  23 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
  24 {
  25         int i;
  26         struct isl_dim_map *dim_map;
  27         dim_map = isl_alloc(ctx, struct isl_dim_map,
  28                                 sizeof(struct isl_dim_map) + len * sizeof(int));
  29         if (!dim_map)
  30                 return NULL;
  31         dim_map->len = 1 + len;
  32         dim_map->pos[0] = 0;
  33         for (i = 0; i < len; ++i)
  34                 dim_map->pos[1 + i] = -1;
  35         return dim_map;
  36 }
  37
  38 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
  39 {
  40         switch (type) {
  41         case isl_dim_param:     return dim->nparam;
  42         case isl_dim_in:        return dim->n_in;
  43         case isl_dim_out:       return dim->n_out;
  44         }
  45 }
  46
  47 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
  48 {
  49         switch (type) {
  50         case isl_dim_param:     return 1;
  51         case isl_dim_in:        return 1 + dim->nparam;
  52         case isl_dim_out:       return 1 + dim->nparam + dim->n_in;
  53         }
  54 }
  55
  56 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
  57                 enum isl_dim_type type, unsigned dst_pos)
  58 {
  59         int i;
  60         unsigned src_pos;
  61
  62         if (!dim_map || !dim)
  63                 return;
  64
  65         src_pos = pos(dim, type);
  66         for (i = 0; i < n(dim, type); ++i)
  67                 dim_map->pos[1 + dst_pos + i] = src_pos + i;
  68 }
  69
  70 static void isl_dim_map_div(struct isl_dim_map *dim_map,
  71                 struct isl_basic_map *bmap, unsigned dst_pos)
  72 {
  73         int i;
  74         unsigned src_pos;
  75
  76         if (!dim_map || !bmap)
  77                 return;
  78
  79         src_pos = 1 + isl_dim_total(bmap->dim);
  80         for (i = 0; i < bmap->n_div; ++i)
  81                 dim_map->pos[1 + dst_pos + i] = src_pos + i;
  82 }
  83
  84 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
  85 {
  86         int i;
  87
  88         for (i = 0; i < dim_map->len; ++i)
  89                 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
  90         fprintf(stderr, "\n");
  91 }
  92
  93 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
  94 {
  95         return bset->dim->n_out;
  96 }
  97
  98 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
  99 {
 100         return bset->dim->nparam;
 101 }
 102
 103 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
 104 {
 105         return isl_dim_total(bset->dim) + bset->n_div;
 106 }
 107
 108 unsigned isl_set_n_dim(const struct isl_set *set)
 109 {
 110         return set->dim->n_out;
 111 }
 112
 113 unsigned isl_set_n_param(const struct isl_set *set)
 114 {
 115         return set->dim->nparam;
 116 }
 117
 118 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
 119 {
 120         return bmap->dim->n_in;
 121 }
 122
 123 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
 124 {
 125         return bmap->dim->n_out;
 126 }
 127
 128 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
 129 {
 130         return bmap->dim->nparam;
 131 }
 132
 133 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
 134 {
 135         return bmap->n_div;
 136 }
 137
 138 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
 139 {
 140         return isl_dim_total(bmap->dim) + bmap->n_div;
 141 }
 142
 143 unsigned isl_map_n_in(const struct isl_map *map)
 144 {
 145         return map->dim->n_in;
 146 }
 147
 148 unsigned isl_map_n_out(const struct isl_map *map)
 149 {
 150         return map->dim->n_out;
 151 }
 152
 153 unsigned isl_map_n_param(const struct isl_map *map)
 154 {
 155         return map->dim->nparam;
 156 }
 157
 158 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
 159 {
 160         return map->dim->n_in == set->dim->n_out &&
 161                map->dim->nparam == set->dim->nparam;
 162 }
 163
 164 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
 165                 struct isl_basic_set *bset)
 166 {
 167         return bmap->dim->n_in == bset->dim->n_out &&
 168                bmap->dim->nparam == bset->dim->nparam;
 169 }
 170
 171 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
 172                 struct isl_basic_set *bset)
 173 {
 174         return bmap->dim->n_out == bset->dim->n_out &&
 175                bmap->dim->nparam == bset->dim->nparam;
 176 }
 177
 178 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
 179                 struct isl_basic_map *bmap, unsigned extra,
 180                 unsigned n_eq, unsigned n_ineq)
 181 {
 182         int i;
 183         size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
 184
 185         bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
 186         if (isl_blk_is_error(bmap->block)) {
 187                 free(bmap);
 188                 return NULL;
 189         }
 190
 191         bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
 192         if (!bmap->eq) {
 193                 isl_blk_free(ctx, bmap->block);
 194                 free(bmap);
 195                 return NULL;
 196         }
 197
 198         if (extra == 0) {
 199                 bmap->block2 = isl_blk_empty();
 200                 bmap->div = NULL;
 201         } else {
 202                 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
 203                 if (isl_blk_is_error(bmap->block2)) {
 204                         free(bmap->eq);
 205                         isl_blk_free(ctx, bmap->block);
 206                         free(bmap);
 207                         return NULL;
 208                 }
 209
 210                 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
 211                 if (!bmap->div) {
 212                         isl_blk_free(ctx, bmap->block2);
 213                         free(bmap->eq);
 214                         isl_blk_free(ctx, bmap->block);
 215                         free(bmap);
 216                         return NULL;
 217                 }
 218         }
 219
 220         for (i = 0; i < n_eq + n_ineq; ++i)
 221                 bmap->eq[i] = bmap->block.data + i * row_size;
 222
 223         for (i = 0; i < extra; ++i)
 224                 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
 225
 226         bmap->ctx = ctx;
 227         isl_ctx_ref(ctx);
 228         bmap->ref = 1;
 229         bmap->flags = 0;
 230         bmap->c_size = n_eq + n_ineq;
 231         bmap->ineq = bmap->eq + n_eq;
 232         bmap->extra = extra;
 233         bmap->n_eq = 0;
 234         bmap->n_ineq = 0;
 235         bmap->n_div = 0;
 236         bmap->sample = NULL;
 237
 238         return bmap;
 239 error:
 240         isl_basic_map_free(bmap);
 241         return NULL;
 242 }
 243
 244 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
 245                 unsigned nparam, unsigned dim, unsigned extra,
 246                 unsigned n_eq, unsigned n_ineq)
 247 {
 248         struct isl_basic_map *bmap;
 249         bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
 250         return (struct isl_basic_set *)bmap;
 251 }
 252
 253 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
 254                 unsigned extra, unsigned n_eq, unsigned n_ineq)
 255 {
 256         struct isl_basic_map *bmap;
 257         if (!dim)
 258                 return NULL;
 259         isl_assert(dim->ctx, dim->n_in == 0, return NULL);
 260         bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
 261         return (struct isl_basic_set *)bmap;
 262 }
 263
 264 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
 265                 unsigned extra, unsigned n_eq, unsigned n_ineq)
 266 {
 267         struct isl_basic_map *bmap;
 268
 269         if (!dim)
 270                 return NULL;
 271         bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
 272         if (!bmap)
 273                 goto error;
 274         bmap->dim = dim;
 275
 276         return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
 277 error:
 278         isl_dim_free(dim);
 279         return NULL;
 280 }
 281
 282 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
 283                 unsigned nparam, unsigned in, unsigned out, unsigned extra,
 284                 unsigned n_eq, unsigned n_ineq)
 285 {
 286         struct isl_basic_map *bmap;
 287         struct isl_dim *dim;
 288
 289         dim = isl_dim_alloc(ctx, nparam, in, out);
 290         if (!dim)
 291                 return NULL;
 292
 293         bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
 294         return bmap;
 295 }
 296
 297 static void dup_constraints(
 298                 struct isl_basic_map *dst, struct isl_basic_map *src)
 299 {
 300         int i;
 301         unsigned total = isl_basic_map_total_dim(src);
 302
 303         for (i = 0; i < src->n_eq; ++i) {
 304                 int j = isl_basic_map_alloc_equality(dst);
 305                 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
 306         }
 307
 308         for (i = 0; i < src->n_ineq; ++i) {
 309                 int j = isl_basic_map_alloc_inequality(dst);
 310                 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
 311         }
 312
 313         for (i = 0; i < src->n_div; ++i) {
 314                 int j = isl_basic_map_alloc_div(dst);
 315                 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
 316         }
 317         F_SET(dst, ISL_BASIC_SET_FINAL);
 318 }
 319
 320 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
 321 {
 322         struct isl_basic_map *dup;
 323
 324         if (!bmap)
 325                 return NULL;
 326         dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
 327                         bmap->n_div, bmap->n_eq, bmap->n_ineq);
 328         if (!dup)
 329                 return NULL;
 330         dup->flags = bmap->flags;
 331         dup_constraints(dup, bmap);
 332         dup->sample = isl_vec_copy(bmap->ctx, bmap->sample);
 333         return dup;
 334 }
 335
 336 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
 337 {
 338         struct isl_basic_map *dup;
 339
 340         dup = isl_basic_map_dup((struct isl_basic_map *)bset);
 341         return (struct isl_basic_set *)dup;
 342 }
 343
 344 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
 345 {
 346         if (!bset)
 347                 return NULL;
 348
 349         if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
 350                 bset->ref++;
 351                 return bset;
 352         }
 353         return isl_basic_set_dup(bset);
 354 }
 355
 356 struct isl_set *isl_set_copy(struct isl_set *set)
 357 {
 358         if (!set)
 359                 return NULL;
 360
 361         set->ref++;
 362         return set;
 363 }
 364
 365 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
 366 {
 367         if (!bmap)
 368                 return NULL;
 369
 370         if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
 371                 bmap->ref++;
 372                 return bmap;
 373         }
 374         return isl_basic_map_dup(bmap);
 375 }
 376
 377 struct isl_map *isl_map_copy(struct isl_map *map)
 378 {
 379         if (!map)
 380                 return NULL;
 381
 382         map->ref++;
 383         return map;
 384 }
 385
 386 void isl_basic_map_free(struct isl_basic_map *bmap)
 387 {
 388         if (!bmap)
 389                 return;
 390
 391         if (--bmap->ref > 0)
 392                 return;
 393
 394         isl_ctx_deref(bmap->ctx);
 395         free(bmap->div);
 396         isl_blk_free(bmap->ctx, bmap->block2);
 397         free(bmap->eq);
 398         isl_blk_free(bmap->ctx, bmap->block);
 399         isl_vec_free(bmap->ctx, bmap->sample);
 400         isl_dim_free(bmap->dim);
 401         free(bmap);
 402 }
 403
 404 void isl_basic_set_free(struct isl_basic_set *bset)
 405 {
 406         isl_basic_map_free((struct isl_basic_map *)bset);
 407 }
 408
 409 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
 410 {
 411         struct isl_ctx *ctx;
 412         if (!bmap)
 413                 return -1;
 414         ctx = bmap->ctx;
 415         isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
 416         isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
 417         if (bmap->eq + bmap->n_eq == bmap->ineq) {
 418                 isl_int *t;
 419                 int j = isl_basic_map_alloc_inequality(bmap);
 420                 if (j < 0)
 421                         return -1;
 422                 t = bmap->ineq[0];
 423                 bmap->ineq[0] = bmap->ineq[j];
 424                 bmap->ineq[j] = t;
 425                 bmap->n_ineq--;
 426                 bmap->ineq++;
 427         } else
 428                 isl_seq_clr(bmap->eq[bmap->n_eq] +
 429                       1 + isl_basic_map_total_dim(bmap),
 430                       bmap->extra - bmap->n_div);
 431         return bmap->n_eq++;
 432 }
 433
 434 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
 435 {
 436         return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
 437 }
 438
 439 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
 440 {
 441         if (!bmap)
 442                 return -1;
 443         isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
 444         bmap->n_eq -= n;
 445         return 0;
 446 }
 447
 448 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
 449 {
 450         isl_int *t;
 451         if (!bmap)
 452                 return -1;
 453         isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
 454
 455         if (pos != bmap->n_eq - 1) {
 456                 t = bmap->eq[pos];
 457                 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
 458                 bmap->eq[bmap->n_eq - 1] = t;
 459         }
 460         bmap->n_eq--;
 461         return 0;
 462 }
 463
 464 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
 465 {
 466         return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
 467 }
 468
 469 void isl_basic_map_inequality_to_equality(
 470                 struct isl_basic_map *bmap, unsigned pos)
 471 {
 472         isl_int *t;
 473
 474         t = bmap->ineq[pos];
 475         bmap->ineq[pos] = bmap->ineq[0];
 476         bmap->ineq[0] = bmap->eq[bmap->n_eq];
 477         bmap->eq[bmap->n_eq] = t;
 478         bmap->n_eq++;
 479         bmap->n_ineq--;
 480         bmap->ineq++;
 481         F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
 482 }
 483
 484 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
 485 {
 486         struct isl_ctx *ctx;
 487         if (!bmap)
 488                 return -1;
 489         ctx = bmap->ctx;
 490         isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
 491                         return -1);
 492         F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
 493         F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
 494         F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
 495         isl_seq_clr(bmap->ineq[bmap->n_ineq] +
 496                       1 + isl_basic_map_total_dim(bmap),
 497                       bmap->extra - bmap->n_div);
 498         return bmap->n_ineq++;
 499 }
 500
 501 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
 502 {
 503         return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
 504 }
 505
 506 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
 507 {
 508         if (!bmap)
 509                 return -1;
 510         isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
 511         bmap->n_ineq -= n;
 512         return 0;
 513 }
 514
 515 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
 516 {
 517         return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
 518 }
 519
 520 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
 521 {
 522         isl_int *t;
 523         if (!bmap)
 524                 return -1;
 525         isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
 526
 527         if (pos != bmap->n_ineq - 1) {
 528                 t = bmap->ineq[pos];
 529                 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
 530                 bmap->ineq[bmap->n_ineq - 1] = t;
 531                 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
 532         }
 533         bmap->n_ineq--;
 534         return 0;
 535 }
 536
 537 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
 538 {
 539         return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
 540 }
 541
 542 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
 543 {
 544         if (!bmap)
 545                 return -1;
 546         isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
 547         isl_seq_clr(bmap->div[bmap->n_div] +
 548                       1 + 1 + isl_basic_map_total_dim(bmap),
 549                       bmap->extra - bmap->n_div);
 550         return bmap->n_div++;
 551 }
 552
 553 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
 554 {
 555         if (!bmap)
 556                 return -1;
 557         isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
 558         bmap->n_div -= n;
 559         return 0;
 560 }
 561
 562 /* Copy constraint from src to dst, putting the vars of src at offset
 563  * dim_off in dst and the divs of src at offset div_off in dst.
 564  * If both sets are actually map, then dim_off applies to the input
 565  * variables.
 566  */
 567 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
 568                             struct isl_basic_map *src_map, isl_int *src,
 569                             unsigned in_off, unsigned out_off, unsigned div_off)
 570 {
 571         unsigned src_nparam = isl_basic_map_n_param(src_map);
 572         unsigned dst_nparam = isl_basic_map_n_param(dst_map);
 573         unsigned src_in = isl_basic_map_n_in(src_map);
 574         unsigned dst_in = isl_basic_map_n_in(dst_map);
 575         unsigned src_out = isl_basic_map_n_out(src_map);
 576         unsigned dst_out = isl_basic_map_n_out(dst_map);
 577         isl_int_set(dst[0], src[0]);
 578         isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
 579         if (dst_nparam > src_nparam)
 580                 isl_seq_clr(dst+1+src_nparam,
 581                                 dst_nparam - src_nparam);
 582         isl_seq_clr(dst+1+dst_nparam, in_off);
 583         isl_seq_cpy(dst+1+dst_nparam+in_off,
 584                     src+1+src_nparam,
 585                     isl_min(dst_in-in_off, src_in));
 586         if (dst_in-in_off > src_in)
 587                 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
 588                                 dst_in - in_off - src_in);
 589         isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
 590         isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
 591                     src+1+src_nparam+src_in,
 592                     isl_min(dst_out-out_off, src_out));
 593         if (dst_out-out_off > src_out)
 594                 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
 595                                 dst_out - out_off - src_out);
 596         isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
 597         isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
 598                     src+1+src_nparam+src_in+src_out,
 599                     isl_min(dst_map->extra-div_off, src_map->n_div));
 600         if (dst_map->n_div-div_off > src_map->n_div)
 601                 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
 602                                 div_off+src_map->n_div,
 603                                 dst_map->n_div - div_off - src_map->n_div);
 604 }
 605
 606 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
 607                      struct isl_basic_map *src_map, isl_int *src,
 608                      unsigned in_off, unsigned out_off, unsigned div_off)
 609 {
 610         isl_int_set(dst[0], src[0]);
 611         copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
 612 }
 613
 614 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
 615                 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
 616 {
 617         int i;
 618         unsigned div_off;
 619
 620         if (!bmap1 || !bmap2)
 621                 goto error;
 622
 623         div_off = bmap1->n_div;
 624
 625         for (i = 0; i < bmap2->n_eq; ++i) {
 626                 int i1 = isl_basic_map_alloc_equality(bmap1);
 627                 if (i1 < 0)
 628                         goto error;
 629                 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
 630                                 i_pos, o_pos, div_off);
 631         }
 632
 633         for (i = 0; i < bmap2->n_ineq; ++i) {
 634                 int i1 = isl_basic_map_alloc_inequality(bmap1);
 635                 if (i1 < 0)
 636                         goto error;
 637                 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
 638                                 i_pos, o_pos, div_off);
 639         }
 640
 641         for (i = 0; i < bmap2->n_div; ++i) {
 642                 int i1 = isl_basic_map_alloc_div(bmap1);
 643                 if (i1 < 0)
 644                         goto error;
 645                 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
 646                          i_pos, o_pos, div_off);
 647         }
 648
 649         isl_basic_map_free(bmap2);
 650
 651         return bmap1;
 652
 653 error:
 654         isl_basic_map_free(bmap1);
 655         isl_basic_map_free(bmap2);
 656         return NULL;
 657 }
 658
 659 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
 660                                         struct isl_dim_map *dim_map)
 661 {
 662         int i;
 663
 664         for (i = 0; i < dim_map->len; ++i) {
 665                 if (dim_map->pos[i] < 0)
 666                         isl_int_set_si(dst[i], 0);
 667                 else
 668                         isl_int_set(dst[i], src[dim_map->pos[i]]);
 669         }
 670 }
 671
 672 static void copy_div_dim_map(isl_int *dst, isl_int *src,
 673                                         struct isl_dim_map *dim_map)
 674 {
 675         isl_int_set(dst[0], src[0]);
 676         copy_constraint_dim_map(dst+1, src+1, dim_map);
 677 }
 678
 679 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
 680                 struct isl_basic_map *src, struct isl_dim_map *dim_map)
 681 {
 682         int i;
 683
 684         if (!src || !dst || !dim_map)
 685                 goto error;
 686
 687         for (i = 0; i < src->n_eq; ++i) {
 688                 int i1 = isl_basic_map_alloc_equality(dst);
 689                 if (i1 < 0)
 690                         goto error;
 691                 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
 692         }
 693
 694         for (i = 0; i < src->n_ineq; ++i) {
 695                 int i1 = isl_basic_map_alloc_inequality(dst);
 696                 if (i1 < 0)
 697                         goto error;
 698                 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
 699         }
 700
 701         for (i = 0; i < src->n_div; ++i) {
 702                 int i1 = isl_basic_map_alloc_div(dst);
 703                 if (i1 < 0)
 704                         goto error;
 705                 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
 706         }
 707
 708         free(dim_map);
 709         isl_basic_map_free(src);
 710
 711         return dst;
 712 error:
 713         free(dim_map);
 714         isl_basic_map_free(src);
 715         isl_basic_map_free(dst);
 716         return NULL;
 717 }
 718
 719 static struct isl_basic_set *set_add_constraints(struct isl_basic_set *bset1,
 720                 struct isl_basic_set *bset2, unsigned pos)
 721 {
 722         return (struct isl_basic_set *)
 723                 add_constraints((struct isl_basic_map *)bset1,
 724                                 (struct isl_basic_map *)bset2, 0, pos);
 725 }
 726
 727 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
 728                 struct isl_dim *dim, unsigned extra,
 729                 unsigned n_eq, unsigned n_ineq)
 730 {
 731         struct isl_basic_map *ext;
 732         unsigned flags;
 733         int dims_ok;
 734
 735         if (!dim)
 736                 goto error;
 737
 738         base = isl_basic_map_cow(base);
 739         if (!base)
 740                 goto error;
 741
 742         dims_ok = isl_dim_equal(base->dim, dim) &&
 743                   base->extra >= base->n_div + extra;
 744
 745         if (dims_ok && n_eq == 0 && n_ineq == 0) {
 746                 isl_dim_free(dim);
 747                 return base;
 748         }
 749
 750         isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
 751         isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
 752         isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
 753         extra += base->extra;
 754         n_eq += base->n_eq;
 755         n_ineq += base->n_ineq;
 756
 757         ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
 758         dim = NULL;
 759         if (!ext)
 760                 goto error;
 761
 762         flags = base->flags;
 763         ext = add_constraints(ext, base, 0, 0);
 764         if (ext) {
 765                 ext->flags = flags;
 766                 F_CLR(ext, ISL_BASIC_SET_FINAL);
 767         }
 768
 769         return ext;
 770
 771 error:
 772         isl_dim_free(dim);
 773         isl_basic_map_free(base);
 774         return NULL;
 775 }
 776
 777 struct isl_basic_map *isl_basic_map_extend_constraints(
 778                 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
 779 {
 780         if (!base)
 781                 return NULL;
 782         return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
 783                                         0, n_eq, n_ineq);
 784 }
 785
 786 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
 787                 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
 788                 unsigned n_eq, unsigned n_ineq)
 789 {
 790         struct isl_basic_map *bmap;
 791         struct isl_dim *dim;
 792
 793         if (!base)
 794                 return NULL;
 795         dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
 796         if (!dim)
 797                 return NULL;
 798
 799         bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
 800         return bmap;
 801 }
 802
 803 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
 804                 unsigned nparam, unsigned dim, unsigned extra,
 805                 unsigned n_eq, unsigned n_ineq)
 806 {
 807         return (struct isl_basic_set *)
 808                 isl_basic_map_extend((struct isl_basic_map *)base,
 809                                         nparam, 0, dim, extra, n_eq, n_ineq);
 810 }
 811
 812 struct isl_basic_set *isl_basic_set_extend_constraints(
 813                 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
 814 {
 815         return (struct isl_basic_set *)
 816                 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
 817                                                     n_eq, n_ineq);
 818 }
 819
 820 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
 821 {
 822         return (struct isl_basic_set *)
 823                 isl_basic_map_cow((struct isl_basic_map *)bset);
 824 }
 825
 826 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
 827 {
 828         if (!bmap)
 829                 return NULL;
 830
 831         if (bmap->ref > 1) {
 832                 bmap->ref--;
 833                 bmap = isl_basic_map_dup(bmap);
 834         }
 835         F_CLR(bmap, ISL_BASIC_SET_FINAL);
 836         return bmap;
 837 }
 838
 839 struct isl_set *isl_set_cow(struct isl_set *set)
 840 {
 841         if (!set)
 842                 return NULL;
 843
 844         if (set->ref == 1)
 845                 return set;
 846         set->ref--;
 847         return isl_set_dup(set);
 848 }
 849
 850 struct isl_map *isl_map_cow(struct isl_map *map)
 851 {
 852         if (!map)
 853                 return NULL;
 854
 855         if (map->ref == 1)
 856                 return map;
 857         map->ref--;
 858         return isl_map_dup(map);
 859 }
 860
 861 static void swap_vars(struct isl_blk blk, isl_int *a,
 862                         unsigned a_len, unsigned b_len)
 863 {
 864         isl_seq_cpy(blk.data, a+a_len, b_len);
 865         isl_seq_cpy(blk.data+b_len, a, a_len);
 866         isl_seq_cpy(a, blk.data, b_len+a_len);
 867 }
 868
 869 struct isl_basic_set *isl_basic_set_swap_vars(
 870                 struct isl_basic_set *bset, unsigned n)
 871 {
 872         int i;
 873         struct isl_blk blk;
 874         unsigned dim;
 875         unsigned nparam;
 876
 877         if (!bset)
 878                 goto error;
 879
 880         nparam = isl_basic_set_n_param(bset);
 881         dim = isl_basic_set_n_dim(bset);
 882         isl_assert(bset->ctx, n <= dim, goto error);
 883
 884         if (n == dim)
 885                 return bset;
 886
 887         bset = isl_basic_set_cow(bset);
 888         if (!bset)
 889                 return NULL;
 890
 891         blk = isl_blk_alloc(bset->ctx, dim);
 892         if (isl_blk_is_error(blk))
 893                 goto error;
 894
 895         for (i = 0; i < bset->n_eq; ++i)
 896                 swap_vars(blk,
 897                           bset->eq[i]+1+nparam, n, dim - n);
 898
 899         for (i = 0; i < bset->n_ineq; ++i)
 900                 swap_vars(blk,
 901                           bset->ineq[i]+1+nparam, n, dim - n);
 902
 903         for (i = 0; i < bset->n_div; ++i)
 904                 swap_vars(blk,
 905                           bset->div[i]+1+1+nparam, n, dim - n);
 906
 907         isl_blk_free(bset->ctx, blk);
 908
 909         F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
 910         return bset;
 911
 912 error:
 913         isl_basic_set_free(bset);
 914         return NULL;
 915 }
 916
 917 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
 918 {
 919         int i;
 920         set = isl_set_cow(set);
 921         if (!set)
 922                 return NULL;
 923
 924         for (i = 0; i < set->n; ++i) {
 925                 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
 926                 if (!set->p[i]) {
 927                         isl_set_free(set);
 928                         return NULL;
 929                 }
 930         }
 931         F_CLR(set, ISL_SET_NORMALIZED);
 932         return set;
 933 }
 934
 935 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
 936 {
 937         isl_seq_cpy(c, c + n, rem);
 938         isl_seq_clr(c + rem, n);
 939 }
 940
 941 /* Drop n dimensions starting at first.
 942  *
 943  * In principle, this frees up some extra variables as the number
 944  * of columns remains constant, but we would have to extend
 945  * the div array too as the number of rows in this array is assumed
 946  * to be equal to extra.
 947  */
 948 struct isl_basic_set *isl_basic_set_drop_dims(
 949                 struct isl_basic_set *bset, unsigned first, unsigned n)
 950 {
 951         int i;
 952
 953         if (!bset)
 954                 goto error;
 955
 956         isl_assert(bset->ctx, first + n <= bset->dim->n_out, goto error);
 957
 958         if (n == 0)
 959                 return bset;
 960
 961         bset = isl_basic_set_cow(bset);
 962         if (!bset)
 963                 return NULL;
 964
 965         for (i = 0; i < bset->n_eq; ++i)
 966                 constraint_drop_vars(bset->eq[i]+1+bset->dim->nparam+first, n,
 967                                      (bset->dim->n_out-first-n)+bset->extra);
 968
 969         for (i = 0; i < bset->n_ineq; ++i)
 970                 constraint_drop_vars(bset->ineq[i]+1+bset->dim->nparam+first, n,
 971                                      (bset->dim->n_out-first-n)+bset->extra);
 972
 973         for (i = 0; i < bset->n_div; ++i)
 974                 constraint_drop_vars(bset->div[i]+1+1+bset->dim->nparam+first, n,
 975                                      (bset->dim->n_out-first-n)+bset->extra);
 976
 977         bset->dim = isl_dim_drop_outputs(bset->dim, first, n);
 978         if (!bset->dim)
 979                 goto error;
 980
 981         F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
 982         bset = isl_basic_set_simplify(bset);
 983         return isl_basic_set_finalize(bset);
 984 error:
 985         isl_basic_set_free(bset);
 986         return NULL;
 987 }
 988
 989 static struct isl_set *isl_set_drop_dims(
 990                 struct isl_set *set, unsigned first, unsigned n)
 991 {
 992         int i;
 993
 994         if (!set)
 995                 goto error;
 996
 997         isl_assert(set->ctx, first + n <= set->dim->n_out, goto error);
 998
 999         if (n == 0)
1000                 return set;
1001         set = isl_set_cow(set);
1002         if (!set)
1003                 goto error;
1004         set->dim = isl_dim_drop_outputs(set->dim, first, n);
1005         if (!set->dim)
1006                 goto error;
1007
1008         for (i = 0; i < set->n; ++i) {
1009                 set->p[i] = isl_basic_set_drop_dims(set->p[i], first, n);
1010                 if (!set->p[i])
1011                         goto error;
1012         }
1013
1014         F_CLR(set, ISL_SET_NORMALIZED);
1015         return set;
1016 error:
1017         isl_set_free(set);
1018         return NULL;
1019 }
1020
1021 /* Drop n input dimensions starting at first.
1022  *
1023  * In principle, this frees up some extra variables as the number
1024  * of columns remains constant, but we would have to extend
1025  * the div array too as the number of rows in this array is assumed
1026  * to be equal to extra.
1027  */
1028 struct isl_basic_map *isl_basic_map_drop_inputs(
1029                 struct isl_basic_map *bmap, unsigned first, unsigned n)
1030 {
1031         int i;
1032         unsigned nparam;
1033         unsigned n_in;
1034         unsigned n_out;
1035
1036         if (!bmap)
1037                 goto error;
1038
1039         nparam = isl_basic_map_n_param(bmap);
1040         n_in = isl_basic_map_n_in(bmap);
1041         n_out = isl_basic_map_n_out(bmap);
1042         isl_assert(bmap->ctx, first + n <= n_in, goto error);
1043
1044         if (n == 0)
1045                 return bmap;
1046
1047         bmap = isl_basic_map_cow(bmap);
1048         if (!bmap)
1049                 return NULL;
1050
1051         for (i = 0; i < bmap->n_eq; ++i)
1052                 constraint_drop_vars(bmap->eq[i]+1+nparam+first, n,
1053                                  (n_in-first-n)+n_out+bmap->extra);
1054
1055         for (i = 0; i < bmap->n_ineq; ++i)
1056                 constraint_drop_vars(bmap->ineq[i]+1+nparam+first, n,
1057                                  (n_in-first-n)+n_out+bmap->extra);
1058
1059         for (i = 0; i < bmap->n_div; ++i)
1060                 constraint_drop_vars(bmap->div[i]+1+1+nparam+first, n,
1061                                  (n_in-first-n)+n_out+bmap->extra);
1062
1063         bmap->dim = isl_dim_drop_inputs(bmap->dim, first, n);
1064         if (!bmap->dim)
1065                 goto error;
1066
1067         F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1068         bmap = isl_basic_map_simplify(bmap);
1069         return isl_basic_map_finalize(bmap);
1070 error:
1071         isl_basic_map_free(bmap);
1072         return NULL;
1073 }
1074
1075 static struct isl_map *isl_map_drop_inputs(
1076                 struct isl_map *map, unsigned first, unsigned n)
1077 {
1078         int i;
1079
1080         if (!map)
1081                 goto error;
1082
1083         isl_assert(map->ctx, first + n <= map->dim->n_in, goto error);
1084
1085         if (n == 0)
1086                 return map;
1087         map = isl_map_cow(map);
1088         if (!map)
1089                 goto error;
1090         map->dim = isl_dim_drop_inputs(map->dim, first, n);
1091         if (!map->dim)
1092                 goto error;
1093
1094         for (i = 0; i < map->n; ++i) {
1095                 map->p[i] = isl_basic_map_drop_inputs(map->p[i], first, n);
1096                 if (!map->p[i])
1097                         goto error;
1098         }
1099         F_CLR(map, ISL_MAP_NORMALIZED);
1100
1101         return map;
1102 error:
1103         isl_map_free(map);
1104         return NULL;
1105 }
1106
1107 /*
1108  * We don't cow, as the div is assumed to be redundant.
1109  */
1110 static struct isl_basic_map *isl_basic_map_drop_div(
1111                 struct isl_basic_map *bmap, unsigned div)
1112 {
1113         int i;
1114         unsigned pos;
1115
1116         if (!bmap)
1117                 goto error;
1118
1119         pos = 1 + isl_dim_total(bmap->dim) + div;
1120
1121         isl_assert(bmap->ctx, div < bmap->n_div, goto error);
1122
1123         for (i = 0; i < bmap->n_eq; ++i)
1124                 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
1125
1126         for (i = 0; i < bmap->n_ineq; ++i) {
1127                 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
1128                         isl_basic_map_drop_inequality(bmap, i);
1129                         --i;
1130                         continue;
1131                 }
1132                 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
1133         }
1134
1135         for (i = 0; i < bmap->n_div; ++i)
1136                 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
1137
1138         if (div != bmap->n_div - 1) {
1139                 int j;
1140                 isl_int *t = bmap->div[div];
1141
1142                 for (j = div; j < bmap->n_div - 1; ++j)
1143                         bmap->div[j] = bmap->div[j+1];
1144
1145                 bmap->div[bmap->n_div - 1] = t;
1146         }
1147         F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1148         isl_basic_map_free_div(bmap, 1);
1149
1150         return bmap;
1151 error:
1152         isl_basic_map_free(bmap);
1153         return NULL;
1154 }
1155
1156 static void eliminate_div(struct isl_basic_map *bmap, isl_int *eq, unsigned div)
1157 {
1158         int i;
1159         unsigned pos = 1 + isl_dim_total(bmap->dim) + div;
1160         unsigned len;
1161         len = 1 + isl_basic_map_total_dim(bmap);
1162
1163         for (i = 0; i < bmap->n_eq; ++i)
1164                 if (bmap->eq[i] != eq)
1165                         isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
1166
1167         for (i = 0; i < bmap->n_ineq; ++i)
1168                 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
1169
1170         /* We need to be careful about circular definitions,
1171          * so for now we just remove the definitions of other divs that
1172          * depend on this div and (possibly) recompute them later.
1173          */
1174         for (i = 0; i < bmap->n_div; ++i)
1175                 if (!isl_int_is_zero(bmap->div[i][0]) &&
1176                     !isl_int_is_zero(bmap->div[i][1 + pos]))
1177                         isl_seq_clr(bmap->div[i], 1 + len);
1178
1179         isl_basic_map_drop_div(bmap, div);
1180 }
1181
1182 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1183 {
1184         int i = 0;
1185         unsigned total;
1186         if (!bmap)
1187                 goto error;
1188         total = isl_basic_map_total_dim(bmap);
1189         isl_basic_map_free_div(bmap, bmap->n_div);
1190         isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1191         if (bmap->n_eq > 0)
1192                 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1193         else {
1194                 isl_basic_map_alloc_equality(bmap);
1195                 if (i < 0)
1196                         goto error;
1197         }
1198         isl_int_set_si(bmap->eq[i][0], 1);
1199         isl_seq_clr(bmap->eq[i]+1, total);
1200         F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1201         return isl_basic_map_finalize(bmap);
1202 error:
1203         isl_basic_map_free(bmap);
1204         return NULL;
1205 }
1206
1207 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1208 {
1209         return (struct isl_basic_set *)
1210                 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1211 }
1212
1213 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
1214 {
1215         isl_int *t = bmap->eq[a];
1216         bmap->eq[a] = bmap->eq[b];
1217         bmap->eq[b] = t;
1218 }
1219
1220 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
1221 {
1222         if (a != b) {
1223                 isl_int *t = bmap->ineq[a];
1224                 bmap->ineq[a] = bmap->ineq[b];
1225                 bmap->ineq[b] = t;
1226         }
1227 }
1228
1229 static void set_swap_inequality(struct isl_basic_set *bset, int a, int b)
1230 {
1231         swap_inequality((struct isl_basic_map *)bset, a, b);
1232 }
1233
1234 static void swap_div(struct isl_basic_map *bmap, int a, int b)
1235 {
1236         int i;
1237         unsigned off = isl_dim_total(bmap->dim);
1238         isl_int *t = bmap->div[a];
1239         bmap->div[a] = bmap->div[b];
1240         bmap->div[b] = t;
1241
1242         for (i = 0; i < bmap->n_eq; ++i)
1243                 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1244
1245         for (i = 0; i < bmap->n_ineq; ++i)
1246                 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1247
1248         for (i = 0; i < bmap->n_div; ++i)
1249                 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1250         F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1251 }
1252
1253 static void eliminate_var_using_equality(struct isl_basic_map *bmap,
1254         unsigned pos, isl_int *eq, int *progress)
1255 {
1256         unsigned total;
1257         int k;
1258
1259         total = isl_basic_map_total_dim(bmap);
1260         for (k = 0; k < bmap->n_eq; ++k) {
1261                 if (bmap->eq[k] == eq)
1262                         continue;
1263                 if (isl_int_is_zero(bmap->eq[k][1+pos]))
1264                         continue;
1265                 if (progress)
1266                         *progress = 1;
1267                 isl_seq_elim(bmap->eq[k], eq, 1+pos, 1+total, NULL);
1268         }
1269
1270         for (k = 0; k < bmap->n_ineq; ++k) {
1271                 if (isl_int_is_zero(bmap->ineq[k][1+pos]))
1272                         continue;
1273                 if (progress)
1274                         *progress = 1;
1275                 isl_seq_elim(bmap->ineq[k], eq, 1+pos, 1+total, NULL);
1276                 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1277         }
1278
1279         for (k = 0; k < bmap->n_div; ++k) {
1280                 if (isl_int_is_zero(bmap->div[k][0]))
1281                         continue;
1282                 if (isl_int_is_zero(bmap->div[k][1+1+pos]))
1283                         continue;
1284                 if (progress)
1285                         *progress = 1;
1286                 isl_seq_elim(bmap->div[k]+1, eq,
1287                                 1+pos, 1+total, &bmap->div[k][0]);
1288                 F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1289         }
1290 }
1291
1292
1293 struct isl_basic_map *isl_basic_map_gauss(
1294         struct isl_basic_map *bmap, int *progress)
1295 {
1296         int k;
1297         int done;
1298         int last_var;
1299         unsigned total_var;
1300         unsigned total;
1301
1302         if (!bmap)
1303                 return NULL;
1304
1305         total = isl_basic_map_total_dim(bmap);
1306         total_var = total - bmap->n_div;
1307
1308         last_var = total - 1;
1309         for (done = 0; done < bmap->n_eq; ++done) {
1310                 for (; last_var >= 0; --last_var) {
1311                         for (k = done; k < bmap->n_eq; ++k)
1312                                 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
1313                                         break;
1314                         if (k < bmap->n_eq)
1315                                 break;
1316                 }
1317                 if (last_var < 0)
1318                         break;
1319                 if (k != done)
1320                         swap_equality(bmap, k, done);
1321                 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
1322                         isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
1323
1324                 eliminate_var_using_equality(bmap, last_var, bmap->eq[done],
1325                                                 progress);
1326
1327                 if (last_var >= total_var &&
1328                     isl_int_is_zero(bmap->div[last_var - total_var][0])) {
1329                         unsigned div = last_var - total_var;
1330                         isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
1331                         isl_int_set_si(bmap->div[div][1+1+last_var], 0);
1332                         isl_int_set(bmap->div[div][0],
1333                                     bmap->eq[done][1+last_var]);
1334                         F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1335                 }
1336         }
1337         if (done == bmap->n_eq)
1338                 return bmap;
1339         for (k = done; k < bmap->n_eq; ++k) {
1340                 if (isl_int_is_zero(bmap->eq[k][0]))
1341                         continue;
1342                 return isl_basic_map_set_to_empty(bmap);
1343         }
1344         isl_basic_map_free_equality(bmap, bmap->n_eq-done);
1345         return bmap;
1346 }
1347
1348 struct isl_basic_set *isl_basic_set_gauss(
1349         struct isl_basic_set *bset, int *progress)
1350 {
1351         return (struct isl_basic_set*)isl_basic_map_gauss(
1352                         (struct isl_basic_map *)bset, progress);
1353 }
1354
1355 static unsigned int round_up(unsigned int v)
1356 {
1357         int old_v = v;
1358
1359         while (v) {
1360                 old_v = v;
1361                 v ^= v & -v;
1362         }
1363         return old_v << 1;
1364 }
1365
1366 static int hash_index(isl_int ***index, unsigned int size, int bits,
1367                         struct isl_basic_map *bmap, int k)
1368 {
1369         int h;
1370         unsigned total = isl_basic_map_total_dim(bmap);
1371         uint32_t hash = isl_seq_get_hash_bits(bmap->ineq[k]+1, total, bits);
1372         for (h = hash; index[h]; h = (h+1) % size)
1373                 if (&bmap->ineq[k] != index[h] &&
1374                     isl_seq_eq(bmap->ineq[k]+1, index[h][0]+1, total))
1375                         break;
1376         return h;
1377 }
1378
1379 static int set_hash_index(isl_int ***index, unsigned int size, int bits,
1380                           struct isl_basic_set *bset, int k)
1381 {
1382         return hash_index(index, size, bits, (struct isl_basic_map *)bset, k);
1383 }
1384
1385 static struct isl_basic_map *remove_duplicate_constraints(
1386         struct isl_basic_map *bmap, int *progress)
1387 {
1388         unsigned int size;
1389         isl_int ***index;
1390         int k, l, h;
1391         int bits;
1392         unsigned total = isl_basic_map_total_dim(bmap);
1393         isl_int sum;
1394
1395         if (bmap->n_ineq <= 1)
1396                 return bmap;
1397
1398         size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
1399         bits = ffs(size) - 1;
1400         index = isl_calloc_array(ctx, isl_int **, size);
1401         if (!index)
1402                 return bmap;
1403
1404         index[isl_seq_get_hash_bits(bmap->ineq[0]+1, total, bits)] = &bmap->ineq[0];
1405         for (k = 1; k < bmap->n_ineq; ++k) {
1406                 h = hash_index(index, size, bits, bmap, k);
1407                 if (!index[h]) {
1408                         index[h] = &bmap->ineq[k];
1409                         continue;
1410                 }
1411                 if (progress)
1412                         *progress = 1;
1413                 l = index[h] - &bmap->ineq[0];
1414                 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
1415                         swap_inequality(bmap, k, l);
1416                 isl_basic_map_drop_inequality(bmap, k);
1417                 --k;
1418         }
1419         isl_int_init(sum);
1420         for (k = 0; k < bmap->n_ineq-1; ++k) {
1421                 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1422                 h = hash_index(index, size, bits, bmap, k);
1423                 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1424                 if (!index[h])
1425                         continue;
1426                 l = index[h] - &bmap->ineq[0];
1427                 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
1428                 if (isl_int_is_pos(sum))
1429                         continue;
1430                 if (isl_int_is_zero(sum)) {
1431                         /* We need to break out of the loop after these
1432                          * changes since the contents of the hash
1433                          * will no longer be valid.
1434                          * Plus, we probably we want to regauss first.
1435                          */
1436                         isl_basic_map_drop_inequality(bmap, l);
1437                         isl_basic_map_inequality_to_equality(bmap, k);
1438                 } else
1439                         bmap = isl_basic_map_set_to_empty(bmap);
1440                 break;
1441         }
1442         isl_int_clear(sum);
1443
1444         free(index);
1445         return bmap;
1446 }
1447
1448 static void compute_elimination_index(struct isl_basic_map *bmap, int *elim)
1449 {
1450         int d, i;
1451         unsigned total;
1452
1453         total = isl_dim_total(bmap->dim);
1454         for (d = 0; d < total; ++d)
1455                 elim[d] = -1;
1456         for (d = total - 1, i = 0; d >= 0 && i < bmap->n_eq; ++i) {
1457                 for (; d >= 0; --d) {
1458                         if (isl_int_is_zero(bmap->eq[i][1+d]))
1459                                 continue;
1460                         elim[d] = i;
1461                         break;
1462                 }
1463         }
1464 }
1465
1466 static void set_compute_elimination_index(struct isl_basic_set *bset, int *elim)
1467 {
1468         return compute_elimination_index((struct isl_basic_map *)bset, elim);
1469 }
1470
1471 static int reduced_using_equalities(isl_int *dst, isl_int *src,
1472         struct isl_basic_map *bmap, int *elim)
1473 {
1474         int d, i;
1475         int copied = 0;
1476         unsigned total;
1477
1478         total = isl_dim_total(bmap->dim);
1479         for (d = total - 1; d >= 0; --d) {
1480                 if (isl_int_is_zero(src[1+d]))
1481                         continue;
1482                 if (elim[d] == -1)
1483                         continue;
1484                 if (!copied) {
1485                         isl_seq_cpy(dst, src, 1 + total);
1486                         copied = 1;
1487                 }
1488                 isl_seq_elim(dst, bmap->eq[elim[d]], 1 + d, 1 + total, NULL);
1489         }
1490         return copied;
1491 }
1492
1493 static int set_reduced_using_equalities(isl_int *dst, isl_int *src,
1494         struct isl_basic_set *bset, int *elim)
1495 {
1496         return reduced_using_equalities(dst, src,
1497                                         (struct isl_basic_map *)bset, elim);
1498 }
1499
1500 /* Quick check to see if two basic maps are disjoint.
1501  * In particular, we reduce the equalities and inequalities of
1502  * one basic map in the context of the equalities of the other
1503  * basic map and check if we get a contradiction.
1504  */
1505 int isl_basic_map_fast_is_disjoint(struct isl_basic_map *bmap1,
1506         struct isl_basic_map *bmap2)
1507 {
1508         struct isl_vec *v = NULL;
1509         int *elim = NULL;
1510         unsigned total;
1511         int d, i;
1512
1513         if (!bmap1 || !bmap2)
1514                 return -1;
1515         isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
1516                         return -1);
1517         if (bmap1->n_div || bmap2->n_div)
1518                 return 0;
1519         if (!bmap1->n_eq && !bmap2->n_eq)
1520                 return 0;
1521
1522         total = isl_dim_total(bmap1->dim);
1523         if (total == 0)
1524                 return 0;
1525         v = isl_vec_alloc(bmap1->ctx, 1 + total);
1526         if (!v)
1527                 goto error;
1528         elim = isl_alloc_array(bmap1->ctx, int, total);
1529         if (!elim)
1530                 goto error;
1531         compute_elimination_index(bmap1, elim);
1532         for (i = 0; i < bmap2->n_eq; ++i) {
1533                 int reduced;
1534                 reduced = reduced_using_equalities(v->block.data, bmap2->eq[i],
1535                                                         bmap1, elim);
1536                 if (reduced && !isl_int_is_zero(v->block.data[0]) &&
1537                     isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1538                         goto disjoint;
1539         }
1540         for (i = 0; i < bmap2->n_ineq; ++i) {
1541                 int reduced;
1542                 reduced = reduced_using_equalities(v->block.data,
1543                                                 bmap2->ineq[i], bmap1, elim);
1544                 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1545                     isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1546                         goto disjoint;
1547         }
1548         compute_elimination_index(bmap2, elim);
1549         for (i = 0; i < bmap1->n_ineq; ++i) {
1550                 int reduced;
1551                 reduced = reduced_using_equalities(v->block.data,
1552                                                 bmap1->ineq[i], bmap2, elim);
1553                 if (reduced && isl_int_is_neg(v->block.data[0]) &&
1554                     isl_seq_first_non_zero(v->block.data + 1, total) == -1)
1555                         goto disjoint;
1556         }
1557         isl_vec_free(bmap1->ctx, v);
1558         free(elim);
1559         return 0;
1560 disjoint:
1561         isl_vec_free(bmap1->ctx, v);
1562         free(elim);
1563         return 1;
1564 error:
1565         isl_vec_free(bmap1->ctx, v);
1566         free(elim);
1567         return -1;
1568 }
1569
1570 int isl_basic_set_fast_is_disjoint(struct isl_basic_set *bset1,
1571         struct isl_basic_set *bset2)
1572 {
1573         return isl_basic_map_fast_is_disjoint((struct isl_basic_map *)bset1,
1574                                               (struct isl_basic_map *)bset2);
1575 }
1576
1577 int isl_map_fast_is_disjoint(struct isl_map *map1, struct isl_map *map2)
1578 {
1579         int i, j;
1580
1581         if (!map1 || !map2)
1582                 return -1;
1583
1584         if (isl_map_fast_is_equal(map1, map2))
1585                 return 0;
1586
1587         for (i = 0; i < map1->n; ++i) {
1588                 for (j = 0; j < map2->n; ++j) {
1589                         int d = isl_basic_map_fast_is_disjoint(map1->p[i],
1590                                                                map2->p[j]);
1591                         if (d != 1)
1592                                 return d;
1593                 }
1594         }
1595         return 1;
1596 }
1597
1598 int isl_set_fast_is_disjoint(struct isl_set *set1, struct isl_set *set2)
1599 {
1600         return isl_map_fast_is_disjoint((struct isl_map *)set1,
1601                                         (struct isl_map *)set2);
1602 }
1603
1604 static struct isl_basic_map *remove_duplicate_divs(
1605         struct isl_basic_map *bmap, int *progress)
1606 {
1607         unsigned int size;
1608         int *index;
1609         int k, l, h;
1610         int bits;
1611         struct isl_blk eq;
1612         unsigned total_var = isl_dim_total(bmap->dim);
1613         unsigned total = total_var + bmap->n_div;
1614         struct isl_ctx *ctx;
1615
1616         if (bmap->n_div <= 1)
1617                 return bmap;
1618
1619         ctx = bmap->ctx;
1620         for (k = bmap->n_div - 1; k >= 0; --k)
1621                 if (!isl_int_is_zero(bmap->div[k][0]))
1622                         break;
1623         if (k <= 0)
1624                 return bmap;
1625
1626         size = round_up(4 * bmap->n_div / 3 - 1);
1627         bits = ffs(size) - 1;
1628         index = isl_calloc_array(ctx, int, size);
1629         if (!index)
1630                 return bmap;
1631         eq = isl_blk_alloc(ctx, 1+total);
1632         if (isl_blk_is_error(eq))
1633                 goto out;
1634
1635         isl_seq_clr(eq.data, 1+total);
1636         index[isl_seq_get_hash_bits(bmap->div[k], 2+total, bits)] = k + 1;
1637         for (--k; k >= 0; --k) {
1638                 uint32_t hash;
1639
1640                 if (isl_int_is_zero(bmap->div[k][0]))
1641                         continue;
1642
1643                 hash = isl_seq_get_hash_bits(bmap->div[k], 2+total, bits);
1644                 for (h = hash; index[h]; h = (h+1) % size)
1645                         if (isl_seq_eq(bmap->div[k],
1646                                        bmap->div[index[h]-1], 2+total))
1647                                 break;
1648                 if (index[h]) {
1649                         *progress = 1;
1650                         l = index[h] - 1;
1651                         isl_int_set_si(eq.data[1+total_var+k], -1);
1652                         isl_int_set_si(eq.data[1+total_var+l], 1);
1653                         eliminate_div(bmap, eq.data, l);
1654                         isl_int_set_si(eq.data[1+total_var+k], 0);
1655                         isl_int_set_si(eq.data[1+total_var+l], 0);
1656                 }
1657                 index[h] = k+1;
1658         }
1659
1660         isl_blk_free(ctx, eq);
1661 out:
1662         free(index);
1663         return bmap;
1664 }
1665
1666 /* Elimininate divs based on equalities
1667  */
1668 static struct isl_basic_map *eliminate_divs_eq(
1669                 struct isl_basic_map *bmap, int *progress)
1670 {
1671         int d;
1672         int i;
1673         int modified = 0;
1674         unsigned off;
1675
1676         if (!bmap)
1677                 return NULL;
1678
1679         off = 1 + isl_dim_total(bmap->dim);
1680
1681         for (d = bmap->n_div - 1; d >= 0 ; --d) {
1682                 for (i = 0; i < bmap->n_eq; ++i) {
1683                         if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1684                             !isl_int_is_negone(bmap->eq[i][off + d]))
1685                                 continue;
1686                         modified = 1;
1687                         *progress = 1;
1688                         eliminate_div(bmap, bmap->eq[i], d);
1689                         isl_basic_map_drop_equality(bmap, i);
1690                         break;
1691                 }
1692         }
1693         if (modified)
1694                 return eliminate_divs_eq(bmap, progress);
1695         return bmap;
1696 }
1697
1698 static struct isl_basic_map *normalize_constraints(struct isl_basic_map *bmap)
1699 {
1700         int i;
1701         isl_int gcd;
1702         unsigned total = isl_basic_map_total_dim(bmap);
1703
1704         isl_int_init(gcd);
1705         for (i = bmap->n_eq - 1; i >= 0; --i) {
1706                 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1707                 if (isl_int_is_zero(gcd)) {
1708                         if (!isl_int_is_zero(bmap->eq[i][0])) {
1709                                 bmap = isl_basic_map_set_to_empty(bmap);
1710                                 break;
1711                         }
1712                         isl_basic_map_drop_equality(bmap, i);
1713                         continue;
1714                 }
1715                 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1716                         isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
1717                 if (isl_int_is_one(gcd))
1718                         continue;
1719                 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1720                         bmap = isl_basic_map_set_to_empty(bmap);
1721                         break;
1722                 }
1723                 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1724         }
1725
1726         for (i = bmap->n_ineq - 1; i >= 0; --i) {
1727                 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1728                 if (isl_int_is_zero(gcd)) {
1729                         if (isl_int_is_neg(bmap->ineq[i][0])) {
1730                                 bmap = isl_basic_map_set_to_empty(bmap);
1731                                 break;
1732                         }
1733                         isl_basic_map_drop_inequality(bmap, i);
1734                         continue;
1735                 }
1736                 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1737                         isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
1738                 if (isl_int_is_one(gcd))
1739                         continue;
1740                 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1741                 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1742         }
1743         isl_int_clear(gcd);
1744
1745         return bmap;
1746 }
1747
1748
1749 /* Remove any div that is defined in terms of the given variable.
1750  */
1751 static struct isl_basic_map *remove_dependent_vars(struct isl_basic_map *bmap,
1752                                                                         int pos)
1753 {
1754         int i;
1755         unsigned dim = isl_dim_total(bmap->dim);
1756
1757         for (i = 0; i < bmap->n_div; ++i) {
1758                 if (isl_int_is_zero(bmap->div[i][0]))
1759                         continue;
1760                 if (isl_int_is_zero(bmap->div[i][1+1+pos]))
1761                         continue;
1762                 bmap = isl_basic_map_eliminate_vars(bmap, dim + i, 1);
1763                 if (!bmap)
1764                         return NULL;
1765         }
1766         return bmap;
1767 }
1768
1769
1770 /* Eliminate the specified variables from the constraints using
1771  * Fourier-Motzkin.  The variables themselves are not removed.
1772  */
1773 struct isl_basic_map *isl_basic_map_eliminate_vars(
1774         struct isl_basic_map *bmap, unsigned pos, unsigned n)
1775 {
1776         int d;
1777         int i, j, k;
1778         unsigned total;
1779
1780         if (n == 0)
1781                 return bmap;
1782         if (!bmap)
1783                 return NULL;
1784         total = isl_basic_map_total_dim(bmap);
1785
1786         bmap = isl_basic_map_cow(bmap);
1787         for (d = pos + n - 1; d >= 0 && d >= pos; --d) {
1788                 int n_lower, n_upper;
1789                 bmap = remove_dependent_vars(bmap, d);
1790                 if (!bmap)
1791                         return NULL;
1792                 if (d >= total - bmap->n_div)
1793                         isl_seq_clr(bmap->div[d-(total-bmap->n_div)], 2+total);
1794                 for (i = 0; i < bmap->n_eq; ++i) {
1795                         if (isl_int_is_zero(bmap->eq[i][1+d]))
1796                                 continue;
1797                         eliminate_var_using_equality(bmap, d, bmap->eq[i], NULL);
1798                         isl_basic_map_drop_equality(bmap, i);
1799                         break;
1800                 }
1801                 if (i < bmap->n_eq)
1802                         continue;
1803                 n_lower = 0;
1804                 n_upper = 0;
1805                 for (i = 0; i < bmap->n_ineq; ++i) {
1806                         if (isl_int_is_pos(bmap->ineq[i][1+d]))
1807                                 n_lower++;
1808                         else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1809                                 n_upper++;
1810                 }
1811                 bmap = isl_basic_map_extend_constraints(bmap,
1812                                 0, n_lower * n_upper);
1813                 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1814                         int last;
1815                         if (isl_int_is_zero(bmap->ineq[i][1+d]))
1816                                 continue;
1817                         last = -1;
1818                         for (j = 0; j < i; ++j) {
1819                                 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1820                                         continue;
1821                                 last = j;
1822                                 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1823                                     isl_int_sgn(bmap->ineq[j][1+d]))
1824                                         continue;
1825                                 k = isl_basic_map_alloc_inequality(bmap);
1826                                 if (k < 0)
1827                                         goto error;
1828                                 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1829                                                 1+total);
1830                                 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1831                                                 1+d, 1+total, NULL);
1832                         }
1833                         isl_basic_map_drop_inequality(bmap, i);
1834                         i = last + 1;
1835                 }
1836                 if (n_lower > 0 && n_upper > 0) {
1837                         bmap = normalize_constraints(bmap);
1838                         bmap = remove_duplicate_constraints(bmap, NULL);
1839                         bmap = isl_basic_map_gauss(bmap, NULL);
1840                         bmap = isl_basic_map_convex_hull(bmap);
1841                         if (!bmap)
1842                                 goto error;
1843                         if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1844                                 break;
1845                 }
1846         }
1847         F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1848         return bmap;
1849 error:
1850         isl_basic_map_free(bmap);
1851         return NULL;
1852 }
1853
1854 struct isl_basic_set *isl_basic_set_eliminate_vars(
1855         struct isl_basic_set *bset, unsigned pos, unsigned n)
1856 {
1857         return (struct isl_basic_set *)isl_basic_map_eliminate_vars(
1858                         (struct isl_basic_map *)bset, pos, n);
1859 }
1860
1861 /* Eliminate the specified n dimensions starting at first from the
1862  * constraints using Fourier-Motzkin, The dimensions themselves
1863  * are not removed.
1864  */
1865 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1866         unsigned first, unsigned n)
1867 {
1868         int i;
1869         unsigned nparam;
1870
1871         if (!set)
1872                 return NULL;
1873         if (n == 0)
1874                 return set;
1875
1876         set = isl_set_cow(set);
1877         if (!set)
1878                 return NULL;
1879         isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1880         nparam = isl_set_n_param(set);
1881
1882         for (i = 0; i < set->n; ++i) {
1883                 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1884                                                             nparam + first, n);
1885                 if (!set->p[i])
1886                         goto error;
1887         }
1888         return set;
1889 error:
1890         isl_set_free(set);
1891         return NULL;
1892 }
1893
1894 /* Project out n dimensions starting at first using Fourier-Motzkin */
1895 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1896         unsigned first, unsigned n)
1897 {
1898         set = isl_set_eliminate_dims(set, first, n);
1899         set = isl_set_drop_dims(set, first, n);
1900         return set;
1901 }
1902
1903 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1904 {
1905         bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1906                                                 bset->n_div);
1907         if (!bset)
1908                 return NULL;
1909         bset->n_div = 0;
1910         return bset;
1911 }
1912
1913 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1914 {
1915         int i;
1916
1917         if (!set)
1918                 return NULL;
1919         if (set->n == 0)
1920                 return set;
1921
1922         set = isl_set_cow(set);
1923         if (!set)
1924                 return NULL;
1925
1926         for (i = 0; i < set->n; ++i) {
1927                 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1928                 if (!set->p[i])
1929                         goto error;
1930         }
1931         return set;
1932 error:
1933         isl_set_free(set);
1934         return NULL;
1935 }
1936
1937 /* Project out n inputs starting at first using Fourier-Motzkin */
1938 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1939         unsigned first, unsigned n)
1940 {
1941         int i;
1942         unsigned nparam;
1943
1944         if (n == 0)
1945                 return map;
1946
1947         map = isl_map_cow(map);
1948         if (!map)
1949                 return NULL;
1950         nparam = isl_map_n_param(map);
1951         isl_assert(map->ctx, first+n <= isl_map_n_in(map), goto error);
1952
1953         for (i = 0; i < map->n; ++i) {
1954                 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1955                                                             nparam + first, n);
1956                 if (!map->p[i])
1957                         goto error;
1958         }
1959         map = isl_map_drop_inputs(map, first, n);
1960         return map;
1961 error:
1962         isl_map_free(map);
1963         return NULL;
1964 }
1965
1966 /* Project out n dimensions starting at first using Fourier-Motzkin */
1967 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1968         unsigned first, unsigned n)
1969 {
1970         unsigned nparam = isl_basic_set_n_param(bset);
1971         bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1972         bset = isl_basic_set_drop_dims(bset, first, n);
1973         return bset;
1974 }
1975
1976 /* Elimininate divs based on inequalities
1977  */
1978 static struct isl_basic_map *eliminate_divs_ineq(
1979                 struct isl_basic_map *bmap, int *progress)
1980 {
1981         int d;
1982         int i;
1983         unsigned off;
1984         struct isl_ctx *ctx;
1985
1986         if (!bmap)
1987                 return NULL;
1988
1989         ctx = bmap->ctx;
1990         off = 1 + isl_dim_total(bmap->dim);
1991
1992         for (d = bmap->n_div - 1; d >= 0 ; --d) {
1993                 for (i = 0; i < bmap->n_eq; ++i)
1994                         if (!isl_int_is_zero(bmap->eq[i][off + d]))
1995                                 break;
1996                 if (i < bmap->n_eq)
1997                         continue;
1998                 for (i = 0; i < bmap->n_ineq; ++i)
1999                         if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
2000                                 break;
2001                 if (i < bmap->n_ineq)
2002                         continue;
2003                 *progress = 1;
2004                 bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1);
2005                 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2006                         break;
2007                 bmap = isl_basic_map_drop_div(bmap, d);
2008                 if (!bmap)
2009                         break;
2010         }
2011         return bmap;
2012 }
2013
2014 struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap)
2015 {
2016         int progress = 1;
2017         if (!bmap)
2018                 return NULL;
2019         while (progress) {
2020                 progress = 0;
2021                 bmap = normalize_constraints(bmap);
2022                 bmap = eliminate_divs_eq(bmap, &progress);
2023                 bmap = eliminate_divs_ineq(bmap, &progress);
2024                 bmap = isl_basic_map_gauss(bmap, &progress);
2025                 bmap = remove_duplicate_divs(bmap, &progress);
2026                 bmap = remove_duplicate_constraints(bmap, &progress);
2027         }
2028         return bmap;
2029 }
2030
2031 struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset)
2032 {
2033         return (struct isl_basic_set *)
2034                 isl_basic_map_simplify((struct isl_basic_map *)bset);
2035 }
2036
2037 static void dump_term(struct isl_basic_map *bmap,
2038                         isl_int c, int pos, FILE *out)
2039 {
2040         const char *name;
2041         unsigned in = isl_basic_map_n_in(bmap);
2042         unsigned dim = in + isl_basic_map_n_out(bmap);
2043         unsigned nparam = isl_basic_map_n_param(bmap);
2044         if (!pos)
2045                 isl_int_print(out, c, 0);
2046         else {
2047                 if (!isl_int_is_one(c))
2048                         isl_int_print(out, c, 0);
2049                 if (pos < 1 + nparam) {
2050                         name = isl_dim_get_name(bmap->dim,
2051                                                 isl_dim_param, pos - 1);
2052                         if (name)
2053                                 fprintf(out, "%s", name);
2054                         else
2055                                 fprintf(out, "p%d", pos - 1);
2056                 } else if (pos < 1 + nparam + in)
2057                         fprintf(out, "i%d", pos - 1 - nparam);
2058                 else if (pos < 1 + nparam + dim)
2059                         fprintf(out, "o%d", pos - 1 - nparam - in);
2060                 else
2061                         fprintf(out, "e%d", pos - 1 - nparam - dim);
2062         }
2063 }
2064
2065 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
2066                                 int sign, FILE *out)
2067 {
2068         int i;
2069         int first;
2070         unsigned len = 1 + isl_basic_map_total_dim(bmap);
2071         isl_int v;
2072
2073         isl_int_init(v);
2074         for (i = 0, first = 1; i < len; ++i) {
2075                 if (isl_int_sgn(c[i]) * sign <= 0)
2076                         continue;
2077                 if (!first)
2078                         fprintf(out, " + ");
2079                 first = 0;
2080                 isl_int_abs(v, c[i]);
2081                 dump_term(bmap, v, i, out);
2082         }
2083         isl_int_clear(v);
2084         if (first)
2085                 fprintf(out, "0");
2086 }
2087
2088 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
2089                                 const char *op, FILE *out, int indent)
2090 {
2091         int i;
2092
2093         fprintf(out, "%*s", indent, "");
2094
2095         dump_constraint_sign(bmap, c, 1, out);
2096         fprintf(out, " %s ", op);
2097         dump_constraint_sign(bmap, c, -1, out);
2098
2099         fprintf(out, "\n");
2100
2101         for (i = bmap->n_div; i < bmap->extra; ++i) {
2102                 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
2103                         continue;
2104                 fprintf(out, "%*s", indent, "");
2105                 fprintf(out, "ERROR: unused div coefficient not zero\n");
2106                 abort();
2107         }
2108 }
2109
2110 static void dump_constraints(struct isl_basic_map *bmap,
2111                                 isl_int **c, unsigned n,
2112                                 const char *op, FILE *out, int indent)
2113 {
2114         int i;
2115
2116         for (i = 0; i < n; ++i)
2117                 dump_constraint(bmap, c[i], op, out, indent);
2118 }
2119
2120 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2121 {
2122         int j;
2123         int first = 1;
2124         unsigned total = isl_basic_map_total_dim(bmap);
2125
2126         for (j = 0; j < 1 + total; ++j) {
2127                 if (isl_int_is_zero(exp[j]))
2128                         continue;
2129                 if (!first && isl_int_is_pos(exp[j]))
2130                         fprintf(out, "+");
2131                 dump_term(bmap, exp[j], j, out);
2132                 first = 0;
2133         }
2134 }
2135
2136 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2137 {
2138         int i;
2139
2140         dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2141         dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2142
2143         for (i = 0; i < bmap->n_div; ++i) {
2144                 fprintf(out, "%*s", indent, "");
2145                 fprintf(out, "e%d = [(", i);
2146                 dump_affine(bmap, bmap->div[i]+1, out);
2147                 fprintf(out, ")/");
2148                 isl_int_print(out, bmap->div[i][0], 0);
2149                 fprintf(out, "]\n");
2150         }
2151 }
2152
2153 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
2154 {
2155         if (!bset) {
2156                 fprintf(out, "null basic set\n");
2157                 return;
2158         }
2159
2160         fprintf(out, "%*s", indent, "");
2161         fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2162                         bset->ref, bset->dim->nparam, bset->dim->n_out,
2163                         bset->extra, bset->flags);
2164         dump((struct isl_basic_map *)bset, out, indent);
2165 }
2166
2167 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
2168 {
2169         if (!bmap) {
2170                 fprintf(out, "null basic map\n");
2171                 return;
2172         }
2173
2174         fprintf(out, "%*s", indent, "");
2175         fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2176                         "flags: %x, n_name: %d\n",
2177                 bmap->ref,
2178                 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2179                 bmap->extra, bmap->flags, bmap->dim->n_name);
2180         dump(bmap, out, indent);
2181 }
2182
2183 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2184 {
2185         unsigned total;
2186         if (!bmap)
2187                 return -1;
2188         total = isl_basic_map_total_dim(bmap);
2189         isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2190         isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2191         isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2192         F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2193         return 0;
2194 }
2195
2196 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2197 {
2198         struct isl_set *set;
2199
2200         if (!dim)
2201                 return NULL;
2202         isl_assert(dim->ctx, dim->n_in == 0, return NULL);
2203         isl_assert(dim->ctx, n >= 0, return NULL);
2204         set = isl_alloc(dim->ctx, struct isl_set,
2205                         sizeof(struct isl_set) +
2206                         n * sizeof(struct isl_basic_set *));
2207         if (!set)
2208                 goto error;
2209
2210         set->ctx = dim->ctx;
2211         isl_ctx_ref(set->ctx);
2212         set->ref = 1;
2213         set->size = n;
2214         set->n = 0;
2215         set->dim = dim;
2216         set->flags = flags;
2217         return set;
2218 error:
2219         isl_dim_free(dim);
2220         return NULL;
2221 }
2222
2223 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2224                 unsigned nparam, unsigned dim, int n, unsigned flags)
2225 {
2226         struct isl_set *set;
2227         struct isl_dim *dims;
2228
2229         dims = isl_dim_alloc(ctx, nparam, 0, dim);
2230         if (!dims)
2231                 return NULL;
2232
2233         set = isl_set_alloc_dim(dims, n, flags);
2234         return set;
2235 }
2236
2237 struct isl_set *isl_set_dup(struct isl_set *set)
2238 {
2239         int i;
2240         struct isl_set *dup;
2241
2242         if (!set)
2243                 return NULL;
2244
2245         dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
2246         if (!dup)
2247                 return NULL;
2248         for (i = 0; i < set->n; ++i)
2249                 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
2250         return dup;
2251 }
2252
2253 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2254 {
2255         struct isl_set *set;
2256
2257         if (!bset)
2258                 return NULL;
2259
2260         set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
2261         if (!set) {
2262                 isl_basic_set_free(bset);
2263                 return NULL;
2264         }
2265         return isl_set_add(set, bset);
2266 }
2267
2268 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2269 {
2270         struct isl_map *map;
2271
2272         if (!bmap)
2273                 return NULL;
2274
2275         map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2276         if (!map) {
2277                 isl_basic_map_free(bmap);
2278                 return NULL;
2279         }
2280         return isl_map_add(map, bmap);
2281 }
2282
2283 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
2284 {
2285         if (!bset || !set)
2286                 goto error;
2287         isl_assert(set->ctx, isl_dim_equal(set->dim, bset->dim), goto error);
2288         isl_assert(set->ctx, set->n < set->size, goto error);
2289         set->p[set->n] = bset;
2290         set->n++;
2291         return set;
2292 error:
2293         if (set)
2294                 isl_set_free(set);
2295         if (bset)
2296                 isl_basic_set_free(bset);
2297         return NULL;
2298 }
2299
2300 void isl_set_free(struct isl_set *set)
2301 {
2302         int i;
2303
2304         if (!set)
2305                 return;
2306
2307         if (--set->ref > 0)
2308                 return;
2309
2310         isl_ctx_deref(set->ctx);
2311         for (i = 0; i < set->n; ++i)
2312                 isl_basic_set_free(set->p[i]);
2313         isl_dim_free(set->dim);
2314         free(set);
2315 }
2316
2317 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
2318 {
2319         int i;
2320
2321         if (!set) {
2322                 fprintf(out, "null set\n");
2323                 return;
2324         }
2325
2326         fprintf(out, "%*s", indent, "");
2327         fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2328                         set->ref, set->n, set->dim->nparam, set->dim->n_out,
2329                         set->flags);
2330         for (i = 0; i < set->n; ++i) {
2331                 fprintf(out, "%*s", indent, "");
2332                 fprintf(out, "basic set %d:\n", i);
2333                 isl_basic_set_dump(set->p[i], out, indent+4);
2334         }
2335 }
2336
2337 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
2338 {
2339         int i;
2340
2341         if (!map) {
2342                 fprintf(out, "null map\n");
2343                 return;
2344         }
2345
2346         fprintf(out, "%*s", indent, "");
2347         fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2348                      "flags: %x, n_name: %d\n",
2349                         map->ref, map->n, map->dim->nparam, map->dim->n_in,
2350                         map->dim->n_out, map->flags, map->dim->n_name);
2351         for (i = 0; i < map->n; ++i) {
2352                 fprintf(out, "%*s", indent, "");
2353                 fprintf(out, "basic map %d:\n", i);
2354                 isl_basic_map_dump(map->p[i], out, indent+4);
2355         }
2356 }
2357
2358 struct isl_basic_map *isl_basic_map_intersect_domain(
2359                 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2360 {
2361         struct isl_basic_map *bmap_domain;
2362         struct isl_dim *dim;
2363
2364         if (!bmap || !bset)
2365                 goto error;
2366
2367         isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
2368                     goto error);
2369
2370         bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2371                         bset->n_div, bset->n_eq, bset->n_ineq);
2372         if (!bmap)
2373                 goto error;
2374         dim = isl_dim_reverse(isl_dim_copy(bset->dim));
2375         bmap_domain = isl_basic_map_from_basic_set(bset, dim);
2376         bmap = add_constraints(bmap, bmap_domain, 0, 0);
2377
2378         bmap = isl_basic_map_simplify(bmap);
2379         return isl_basic_map_finalize(bmap);
2380 error:
2381         isl_basic_map_free(bmap);
2382         isl_basic_set_free(bset);
2383         return NULL;
2384 }
2385
2386 struct isl_basic_map *isl_basic_map_intersect_range(
2387                 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2388 {
2389         struct isl_basic_map *bmap_range;
2390
2391         if (!bmap || !bset)
2392                 goto error;
2393
2394         isl_assert(bset->ctx, isl_basic_map_compatible_range(bmap, bset),
2395                    goto error);
2396
2397         bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2398                         bset->n_div, bset->n_eq, bset->n_ineq);
2399         if (!bmap)
2400                 goto error;
2401         bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2402         bmap = add_constraints(bmap, bmap_range, 0, 0);
2403
2404         bmap = isl_basic_map_simplify(bmap);
2405         return isl_basic_map_finalize(bmap);
2406 error:
2407         isl_basic_map_free(bmap);
2408         isl_basic_set_free(bset);
2409         return NULL;
2410 }
2411
2412 struct isl_basic_map *isl_basic_map_intersect(
2413                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2414 {
2415         if (!bmap1 || !bmap2)
2416                 goto error;
2417
2418         isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2419
2420         bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2421                         bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2422         if (!bmap1)
2423                 goto error;
2424         bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2425
2426         bmap1 = isl_basic_map_simplify(bmap1);
2427         return isl_basic_map_finalize(bmap1);
2428 error:
2429         isl_basic_map_free(bmap1);
2430         isl_basic_map_free(bmap2);
2431         return NULL;
2432 }
2433
2434 struct isl_basic_set *isl_basic_set_intersect(
2435                 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2436 {
2437         return (struct isl_basic_set *)
2438                 isl_basic_map_intersect(
2439                         (struct isl_basic_map *)bset1,
2440                         (struct isl_basic_map *)bset2);
2441 }
2442
2443 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2444 {
2445         unsigned flags = 0;
2446         struct isl_map *result;
2447         int i, j;
2448
2449         if (!map1 || !map2)
2450                 goto error;
2451
2452         if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2453             F_ISSET(map2, ISL_MAP_DISJOINT))
2454                 FL_SET(flags, ISL_MAP_DISJOINT);
2455
2456         result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2457                                 map1->n * map2->n, flags);
2458         if (!result)
2459                 goto error;
2460         for (i = 0; i < map1->n; ++i)
2461                 for (j = 0; j < map2->n; ++j) {
2462                         struct isl_basic_map *part;
2463                         part = isl_basic_map_intersect(
2464                                     isl_basic_map_copy(map1->p[i]),
2465                                     isl_basic_map_copy(map2->p[j]));
2466                         if (isl_basic_map_is_empty(part))
2467                                 isl_basic_map_free(part);
2468                         else
2469                                 result = isl_map_add(result, part);
2470                         if (!result)
2471                                 goto error;
2472                 }
2473         isl_map_free(map1);
2474         isl_map_free(map2);
2475         return result;
2476 error:
2477         isl_map_free(map1);
2478         isl_map_free(map2);
2479         return NULL;
2480 }
2481
2482 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2483 {
2484         return (struct isl_set *)
2485                 isl_map_intersect((struct isl_map *)set1,
2486                                   (struct isl_map *)set2);
2487 }
2488
2489 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2490 {
2491         struct isl_dim *dim;
2492         struct isl_basic_set *bset;
2493         unsigned in;
2494
2495         if (!bmap)
2496                 return NULL;
2497         bmap = isl_basic_map_cow(bmap);
2498         if (!bmap)
2499                 return NULL;
2500         dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2501         in = isl_basic_map_n_in(bmap);
2502         bset = isl_basic_set_from_basic_map(bmap);
2503         bset = isl_basic_set_swap_vars(bset, in);
2504         return isl_basic_map_from_basic_set(bset, dim);
2505 }
2506
2507 /* Turn final n dimensions into existentially quantified variables.
2508  */
2509 struct isl_basic_set *isl_basic_set_project_out(
2510                 struct isl_basic_set *bset, unsigned n, unsigned flags)
2511 {
2512         int i;
2513         size_t row_size;
2514         isl_int **new_div;
2515         isl_int *old;
2516
2517         if (!bset)
2518                 return NULL;
2519
2520         isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
2521
2522         if (n == 0)
2523                 return bset;
2524
2525         bset = isl_basic_set_cow(bset);
2526
2527         row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
2528         old = bset->block2.data;
2529         bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
2530                                         (bset->extra + n) * (1 + row_size));
2531         if (!bset->block2.data)
2532                 goto error;
2533         new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
2534         if (!new_div)
2535                 goto error;
2536         for (i = 0; i < n; ++i) {
2537                 new_div[i] = bset->block2.data +
2538                                 (bset->extra + i) * (1 + row_size);
2539                 isl_seq_clr(new_div[i], 1 + row_size);
2540         }
2541         for (i = 0; i < bset->extra; ++i)
2542                 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
2543         free(bset->div);
2544         bset->div = new_div;
2545         bset->n_div += n;
2546         bset->extra += n;
2547         bset->dim = isl_dim_drop_outputs(bset->dim,
2548                                             isl_basic_set_n_dim(bset) - n, n);
2549         if (!bset->dim)
2550                 goto error;
2551         bset = isl_basic_set_simplify(bset);
2552         return isl_basic_set_finalize(bset);
2553 error:
2554         isl_basic_set_free(bset);
2555         return NULL;
2556 }
2557
2558 struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2559 {
2560         int i, j;
2561
2562         for (i = 0; i < n; ++i) {
2563                 j = isl_basic_map_alloc_div(bmap);
2564                 if (j < 0)
2565                         goto error;
2566                 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2567         }
2568         return bmap;
2569 error:
2570         isl_basic_map_free(bmap);
2571         return NULL;
2572 }
2573
2574 struct isl_basic_map *isl_basic_map_apply_range(
2575                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2576 {
2577         struct isl_dim *dim_result = NULL;
2578         struct isl_basic_map *bmap;
2579         unsigned n_in, n_out, n, nparam, total, pos;
2580         struct isl_dim_map *dim_map1, *dim_map2;
2581
2582         if (!bmap1 || !bmap2)
2583                 goto error;
2584
2585         dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2586                                   isl_dim_copy(bmap2->dim));
2587
2588         n_in = isl_basic_map_n_in(bmap1);
2589         n_out = isl_basic_map_n_out(bmap2);
2590         n = isl_basic_map_n_out(bmap1);
2591         nparam = isl_basic_map_n_param(bmap1);
2592
2593         total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2594         dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2595         dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2596         isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2597         isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2598         isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2599         isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2600         isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2601         isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2602         isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2603         isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2604
2605         bmap = isl_basic_map_alloc_dim(dim_result,
2606                         bmap1->n_div + bmap2->n_div + n,
2607                         bmap1->n_eq + bmap2->n_eq,
2608                         bmap1->n_ineq + bmap2->n_ineq);
2609         bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2610         bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2611         bmap = add_divs(bmap, n);
2612         bmap = isl_basic_map_simplify(bmap);
2613         return isl_basic_map_finalize(bmap);
2614 error:
2615         isl_basic_map_free(bmap1);
2616         isl_basic_map_free(bmap2);
2617         return NULL;
2618 }
2619
2620 struct isl_basic_set *isl_basic_set_apply(
2621                 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2622 {
2623         if (!bset || !bmap)
2624                 goto error;
2625
2626         isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
2627                     goto error);
2628
2629         return (struct isl_basic_set *)
2630                 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2631 error:
2632         isl_basic_set_free(bset);
2633         isl_basic_map_free(bmap);
2634         return NULL;
2635 }
2636
2637 struct isl_basic_map *isl_basic_map_apply_domain(
2638                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2639 {
2640         if (!bmap1 || !bmap2)
2641                 goto error;
2642
2643         isl_assert(ctx,
2644             isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2645         isl_assert(ctx,
2646             isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2647             goto error);
2648
2649         bmap1 = isl_basic_map_reverse(bmap1);
2650         bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2651         return isl_basic_map_reverse(bmap1);
2652 error:
2653         isl_basic_map_free(bmap1);
2654         isl_basic_map_free(bmap2);
2655         return NULL;
2656 }
2657
2658 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
2659                 struct isl_basic_map *bmap, unsigned pos)
2660 {
2661         int i;
2662         unsigned nparam;
2663         unsigned n_in;
2664
2665         i = isl_basic_map_alloc_equality(bmap);
2666         if (i < 0)
2667                 goto error;
2668         nparam = isl_basic_map_n_param(bmap);
2669         n_in = isl_basic_map_n_in(bmap);
2670         isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2671         isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2672         isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2673         return isl_basic_map_finalize(bmap);
2674 error:
2675         isl_basic_map_free(bmap);
2676         return NULL;
2677 }
2678
2679 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
2680                 struct isl_basic_map *bmap, unsigned pos)
2681 {
2682         int i;
2683         unsigned nparam;
2684         unsigned n_in;
2685
2686         i = isl_basic_map_alloc_inequality(bmap);
2687         if (i < 0)
2688                 goto error;
2689         nparam = isl_basic_map_n_param(bmap);
2690         n_in = isl_basic_map_n_in(bmap);
2691         isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2692         isl_int_set_si(bmap->ineq[i][0], -1);
2693         isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2694         isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2695         return isl_basic_map_finalize(bmap);
2696 error:
2697         isl_basic_map_free(bmap);
2698         return NULL;
2699 }
2700
2701 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
2702                 struct isl_basic_map *bmap, unsigned pos)
2703 {
2704         int i;
2705         unsigned nparam;
2706         unsigned n_in;
2707
2708         i = isl_basic_map_alloc_inequality(bmap);
2709         if (i < 0)
2710                 goto error;
2711         nparam = isl_basic_map_n_param(bmap);
2712         n_in = isl_basic_map_n_in(bmap);
2713         isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2714         isl_int_set_si(bmap->ineq[i][0], -1);
2715         isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2716         isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2717         return isl_basic_map_finalize(bmap);
2718 error:
2719         isl_basic_map_free(bmap);
2720         return NULL;
2721 }
2722
2723 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
2724                 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
2725 {
2726         int i;
2727         struct isl_basic_map *bmap;
2728         bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
2729         if (!bmap)
2730                 return NULL;
2731         for (i = 0; i < n_equal && bmap; ++i)
2732                 bmap = var_equal(ctx, bmap, i);
2733         return isl_basic_map_finalize(bmap);
2734 }
2735
2736 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
2737                 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2738 {
2739         int i;
2740         struct isl_basic_map *bmap;
2741         bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2742         if (!bmap)
2743                 return NULL;
2744         for (i = 0; i < pos && bmap; ++i)
2745                 bmap = var_equal(ctx, bmap, i);
2746         if (bmap)
2747                 bmap = var_less(ctx, bmap, pos);
2748         return isl_basic_map_finalize(bmap);
2749 }
2750
2751 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
2752                 unsigned nparam, unsigned in, unsigned out, unsigned pos)
2753 {
2754         int i;
2755         struct isl_basic_map *bmap;
2756         bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
2757         if (!bmap)
2758                 return NULL;
2759         for (i = 0; i < pos && bmap; ++i)
2760                 bmap = var_equal(ctx, bmap, i);
2761         if (bmap)
2762                 bmap = var_more(ctx, bmap, pos);
2763         return isl_basic_map_finalize(bmap);
2764 }
2765
2766 struct isl_basic_map *isl_basic_map_from_basic_set(
2767                 struct isl_basic_set *bset, struct isl_dim *dim)
2768 {
2769         struct isl_basic_map *bmap;
2770
2771         bset = isl_basic_set_cow(bset);
2772         if (!bset || !dim)
2773                 goto error;
2774
2775         isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2776         isl_dim_free(bset->dim);
2777         bmap = (struct isl_basic_map *) bset;
2778         bmap->dim = dim;
2779         return isl_basic_map_finalize(bmap);
2780 error:
2781         isl_basic_set_free(bset);
2782         isl_dim_free(dim);
2783         return NULL;
2784 }
2785
2786 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2787 {
2788         if (!bmap)
2789                 goto error;
2790         if (bmap->dim->n_in == 0)
2791                 return (struct isl_basic_set *)bmap;
2792         bmap = isl_basic_map_cow(bmap);
2793         if (!bmap)
2794                 goto error;
2795         bmap->dim = isl_dim_cow(bmap->dim);
2796         if (!bmap->dim)
2797                 goto error;
2798         bmap->dim->n_out += bmap->dim->n_in;
2799         bmap->dim->n_in = 0;
2800         bmap = isl_basic_map_finalize(bmap);
2801         return (struct isl_basic_set *)bmap;
2802 error:
2803         isl_basic_map_free(bmap);
2804         return NULL;
2805 }
2806
2807 /* For a div d = floor(f/m), add the constraints
2808  *
2809  *              f - m d >= 0
2810  *              -(f-(n-1)) + m d >= 0
2811  *
2812  * Note that the second constraint is the negation of
2813  *
2814  *              f - m d >= n
2815  */
2816 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2817 {
2818         int i, j;
2819         unsigned total = isl_basic_map_total_dim(bmap);
2820         unsigned div_pos = 1 + total - bmap->n_div + div;
2821
2822         i = isl_basic_map_alloc_inequality(bmap);
2823         if (i < 0)
2824                 return -1;
2825         isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2826         isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2827
2828         j = isl_basic_map_alloc_inequality(bmap);
2829         if (j < 0)
2830                 return -1;
2831         isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2832         isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2833         isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2834         return j;
2835 }
2836
2837 struct isl_basic_set *isl_basic_map_underlying_set(
2838                 struct isl_basic_map *bmap)
2839 {
2840         if (!bmap)
2841                 goto error;
2842         if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2843                 return (struct isl_basic_set *)bmap;
2844         bmap = isl_basic_map_cow(bmap);
2845         if (!bmap)
2846                 goto error;
2847         bmap->dim = isl_dim_cow(bmap->dim);
2848         if (!bmap->dim)
2849                 goto error;
2850         bmap->dim->n_out += bmap->dim->nparam + bmap->dim->n_in + bmap->n_div;
2851         bmap->dim->nparam = 0;
2852         bmap->dim->n_in = 0;
2853         bmap->extra -= bmap->n_div;
2854         bmap->n_div = 0;
2855         bmap = isl_basic_map_finalize(bmap);
2856         return (struct isl_basic_set *)bmap;
2857 error:
2858         return NULL;
2859 }
2860
2861 struct isl_basic_map *isl_basic_map_overlying_set(
2862         struct isl_basic_set *bset, struct isl_basic_map *like)
2863 {
2864         struct isl_basic_map *bmap;
2865         struct isl_ctx *ctx;
2866         unsigned total;
2867         int i;
2868
2869         if (!bset || !like)
2870                 goto error;
2871         ctx = bset->ctx;
2872         isl_assert(ctx, bset->n_div == 0, goto error);
2873         isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2874         isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2875                         goto error);
2876         if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2877                 isl_basic_map_free(like);
2878                 return (struct isl_basic_map *)bset;
2879         }
2880         bset = isl_basic_set_cow(bset);
2881         if (!bset)
2882                 goto error;
2883         total = bset->dim->n_out + bset->extra;
2884         bmap = (struct isl_basic_map *)bset;
2885         isl_dim_free(bmap->dim);
2886         bmap->dim = isl_dim_copy(like->dim);
2887         if (!bmap->dim)
2888                 goto error;
2889         bmap->n_div = like->n_div;
2890         bmap->extra += like->n_div;
2891         if (bmap->extra) {
2892                 unsigned ltotal;
2893                 ltotal = total - bmap->extra + like->extra;
2894                 if (ltotal > total)
2895                         ltotal = total;
2896                 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2897                                         bmap->extra * (1 + 1 + total));
2898                 if (isl_blk_is_error(bmap->block2))
2899                         goto error;
2900                 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2901                                                 bmap->extra);
2902                 if (!bmap->div)
2903                         goto error;
2904                 for (i = 0; i < bmap->extra; ++i)
2905                         bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2906                 for (i = 0; i < like->n_div; ++i) {
2907                         isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2908                         isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2909                 }
2910                 bmap = isl_basic_map_extend_constraints(bmap,
2911                                                         0, 2 * like->n_div);
2912                 for (i = 0; i < like->n_div; ++i)
2913                         if (add_div_constraints(bmap, i) < 0)
2914                                 goto error;
2915         }
2916         isl_basic_map_free(like);
2917         bmap = isl_basic_map_simplify(bmap);
2918         bmap = isl_basic_map_finalize(bmap);
2919         return bmap;
2920 error:
2921         isl_basic_map_free(like);
2922         isl_basic_set_free(bset);
2923         return NULL;
2924 }
2925
2926 struct isl_basic_set *isl_basic_set_from_underlying_set(
2927         struct isl_basic_set *bset, struct isl_basic_set *like)
2928 {
2929         return (struct isl_basic_set *)
2930                 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2931 }
2932
2933 struct isl_set *isl_set_from_underlying_set(
2934         struct isl_set *set, struct isl_basic_set *like)
2935 {
2936         int i;
2937
2938         if (!set || !like)
2939                 goto error;
2940         isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2941                     goto error);
2942         if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2943                 isl_basic_set_free(like);
2944                 return set;
2945         }
2946         set = isl_set_cow(set);
2947         if (!set)
2948                 goto error;
2949         for (i = 0; i < set->n; ++i) {
2950                 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2951                                                       isl_basic_set_copy(like));
2952                 if (!set->p[i])
2953                         goto error;
2954         }
2955         isl_dim_free(set->dim);
2956         set->dim = isl_dim_copy(like->dim);
2957         if (!set->dim)
2958                 goto error;
2959         isl_basic_set_free(like);
2960         return set;
2961 error:
2962         isl_basic_set_free(like);
2963         isl_set_free(set);
2964         return NULL;
2965 }
2966
2967 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2968 {
2969         int i;
2970
2971         map = isl_map_cow(map);
2972         if (!map)
2973                 return NULL;
2974         map->dim = isl_dim_cow(map->dim);
2975         if (!map->dim)
2976                 goto error;
2977
2978         for (i = 1; i < map->n; ++i)
2979                 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2980                                 goto error);
2981         for (i = 0; i < map->n; ++i) {
2982                 map->p[i] = (struct isl_basic_map *)
2983                                 isl_basic_map_underlying_set(map->p[i]);
2984                 if (!map->p[i])
2985                         goto error;
2986         }
2987         if (map->n == 0)
2988                 map->dim->n_out += map->dim->nparam + map->dim->n_in;
2989         else
2990                 map->dim->n_out = map->p[0]->dim->n_out;
2991         map->dim->nparam = 0;
2992         map->dim->n_in = 0;
2993         return (struct isl_set *)map;
2994 error:
2995         isl_map_free(map);
2996         return NULL;
2997 }
2998
2999 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3000 {
3001         return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3002 }
3003
3004 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3005 {
3006         struct isl_basic_set *domain;
3007         unsigned n_out;
3008         if (!bmap)
3009                 return NULL;
3010         n_out = isl_basic_map_n_out(bmap);
3011         domain = isl_basic_set_from_basic_map(bmap);
3012         return isl_basic_set_project_out(domain, n_out, 0);
3013 }
3014
3015 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3016 {
3017         return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3018 }
3019
3020 struct isl_set *isl_map_range(struct isl_map *map)
3021 {
3022         int i;
3023         struct isl_set *set;
3024
3025         if (!map)
3026                 goto error;
3027         map = isl_map_cow(map);
3028         if (!map)
3029                 goto error;
3030
3031         set = (struct isl_set *) map;
3032         if (set->dim->n_in != 0) {
3033                 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3034                 if (!set->dim)
3035                         goto error;
3036         }
3037         for (i = 0; i < map->n; ++i) {
3038                 set->p[i] = isl_basic_map_range(map->p[i]);
3039                 if (!set->p[i])
3040                         goto error;
3041         }
3042         F_CLR(set, ISL_MAP_DISJOINT);
3043         F_CLR(set, ISL_SET_NORMALIZED);
3044         return set;
3045 error:
3046         isl_map_free(map);
3047         return NULL;
3048 }
3049
3050 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3051 {
3052         int i;
3053         struct isl_map *map = NULL;
3054
3055         set = isl_set_cow(set);
3056         if (!set || !dim)
3057                 goto error;
3058         isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3059         map = (struct isl_map *)set;
3060         for (i = 0; i < set->n; ++i) {
3061                 map->p[i] = isl_basic_map_from_basic_set(
3062                                 set->p[i], isl_dim_copy(dim));
3063                 if (!map->p[i])
3064                         goto error;
3065         }
3066         isl_dim_free(map->dim);
3067         map->dim = dim;
3068         return map;
3069 error:
3070         isl_dim_free(dim);
3071         isl_set_free(set);
3072         return NULL;
3073 }
3074
3075 struct isl_set *isl_set_from_map(struct isl_map *map)
3076 {
3077         int i;
3078         struct isl_set *set = NULL;
3079
3080         if (!map)
3081                 return NULL;
3082         map = isl_map_cow(map);
3083         if (!map)
3084                 return NULL;
3085         map->dim = isl_dim_cow(map->dim);
3086         if (!map->dim)
3087                 goto error;
3088         map->dim->n_out += map->dim->n_in;
3089         map->dim->n_in = 0;
3090         set = (struct isl_set *)map;
3091         for (i = 0; i < map->n; ++i) {
3092                 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3093                 if (!set->p[i])
3094                         goto error;
3095         }
3096         return set;
3097 error:
3098         isl_map_free(map);
3099         return NULL;
3100 }
3101
3102 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3103 {
3104         struct isl_map *map;
3105
3106         if (!dim)
3107                 return NULL;
3108         isl_assert(dim->ctx, n >= 0, return NULL);
3109         map = isl_alloc(dim->ctx, struct isl_map,
3110                         sizeof(struct isl_map) +
3111                         n * sizeof(struct isl_basic_map *));
3112         if (!map)
3113                 goto error;
3114
3115         map->ctx = dim->ctx;
3116         isl_ctx_ref(map->ctx);
3117         map->ref = 1;
3118         map->size = n;
3119         map->n = 0;
3120         map->dim = dim;
3121         map->flags = flags;
3122         return map;
3123 error:
3124         isl_dim_free(dim);
3125         return NULL;
3126 }
3127
3128 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3129                 unsigned nparam, unsigned in, unsigned out, int n,
3130                 unsigned flags)
3131 {
3132         struct isl_map *map;
3133         struct isl_dim *dims;
3134
3135         dims = isl_dim_alloc(ctx, nparam, in, out);
3136         if (!dims)
3137                 return NULL;
3138
3139         map = isl_map_alloc_dim(dims, n, flags);
3140         return map;
3141 }
3142
3143 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
3144                 unsigned nparam, unsigned in, unsigned out)
3145 {
3146         struct isl_basic_map *bmap;
3147         bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
3148         bmap = isl_basic_map_set_to_empty(bmap);
3149         return bmap;
3150 }
3151
3152 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3153 {
3154         struct isl_basic_set *bset;
3155         bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3156         bset = isl_basic_set_set_to_empty(bset);
3157         return bset;
3158 }
3159
3160 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3161 {
3162         struct isl_basic_map *bmap;
3163         if (!model)
3164                 return NULL;
3165         bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3166         bmap = isl_basic_map_set_to_empty(bmap);
3167         return bmap;
3168 }
3169
3170 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3171 {
3172         struct isl_basic_map *bmap;
3173         if (!model)
3174                 return NULL;
3175         bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3176         bmap = isl_basic_map_set_to_empty(bmap);
3177         return bmap;
3178 }
3179
3180 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3181 {
3182         struct isl_basic_set *bset;
3183         if (!model)
3184                 return NULL;
3185         bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3186         bset = isl_basic_set_set_to_empty(bset);
3187         return bset;
3188 }
3189
3190 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3191 {
3192         struct isl_basic_map *bmap;
3193         bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3194         return bmap;
3195 }
3196
3197 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3198 {
3199         struct isl_basic_set *bset;
3200         bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3201         return bset;
3202 }
3203
3204 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3205 {
3206         if (!model)
3207                 return NULL;
3208         return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3209 }
3210
3211 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
3212                 unsigned nparam, unsigned in, unsigned out)
3213 {
3214         return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
3215 }
3216
3217 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3218 {
3219         if (!model)
3220                 return NULL;
3221         return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3222 }
3223
3224 struct isl_set *isl_set_empty(struct isl_dim *dim)
3225 {
3226         return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3227 }
3228
3229 struct isl_set *isl_set_empty_like(struct isl_set *model)
3230 {
3231         if (!model)
3232                 return NULL;
3233         return isl_set_empty(isl_dim_copy(model->dim));
3234 }
3235
3236 struct isl_set *isl_set_universe(struct isl_dim *dim)
3237 {
3238         struct isl_set *set;
3239         if (!dim)
3240                 return NULL;
3241         set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3242         set = isl_set_add(set, isl_basic_set_universe(dim));
3243         return set;
3244 }
3245
3246 struct isl_map *isl_map_dup(struct isl_map *map)
3247 {
3248         int i;
3249         struct isl_map *dup;
3250
3251         if (!map)
3252                 return NULL;
3253         dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3254         for (i = 0; i < map->n; ++i)
3255                 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
3256         return dup;
3257 }
3258
3259 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
3260 {
3261         if (!bmap || !map)
3262                 goto error;
3263         isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3264         isl_assert(map->ctx, map->n < map->size, goto error);
3265         map->p[map->n] = bmap;
3266         map->n++;
3267         F_CLR(map, ISL_MAP_NORMALIZED);
3268         return map;
3269 error:
3270         if (map)
3271                 isl_map_free(map);
3272         if (bmap)
3273                 isl_basic_map_free(bmap);
3274         return NULL;
3275 }
3276
3277 void isl_map_free(struct isl_map *map)
3278 {
3279         int i;
3280
3281         if (!map)
3282                 return;
3283
3284         if (--map->ref > 0)
3285                 return;
3286
3287         isl_ctx_deref(map->ctx);
3288         for (i = 0; i < map->n; ++i)
3289                 isl_basic_map_free(map->p[i]);
3290         isl_dim_free(map->dim);
3291         free(map);
3292 }
3293
3294 struct isl_map *isl_map_extend(struct isl_map *base,
3295                 unsigned nparam, unsigned n_in, unsigned n_out)
3296 {
3297         int i;
3298
3299         base = isl_map_cow(base);
3300         if (!base)
3301                 return NULL;
3302
3303         base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3304         if (!base->dim)
3305                 goto error;
3306         for (i = 0; i < base->n; ++i) {
3307                 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3308                                 isl_dim_copy(base->dim), 0, 0, 0);
3309                 if (!base->p[i])
3310                         goto error;
3311         }
3312         return base;
3313 error:
3314         isl_map_free(base);
3315         return NULL;
3316 }
3317
3318 struct isl_set *isl_set_extend(struct isl_set *base,
3319                 unsigned nparam, unsigned dim)
3320 {
3321         return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3322                                                         nparam, 0, dim);
3323 }
3324
3325 static struct isl_basic_map *isl_basic_map_fix_var(struct isl_basic_map *bmap,
3326                 unsigned var, int value)
3327 {
3328         int j;
3329
3330         bmap = isl_basic_map_cow(bmap);
3331         bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3332         j = isl_basic_map_alloc_equality(bmap);
3333         if (j < 0)
3334                 goto error;
3335         isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3336         isl_int_set_si(bmap->eq[j][1 + var], -1);
3337         isl_int_set_si(bmap->eq[j][0], value);
3338         bmap = isl_basic_map_simplify(bmap);
3339         return isl_basic_map_finalize(bmap);
3340 error:
3341         isl_basic_map_free(bmap);
3342         return NULL;
3343 }
3344
3345 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3346                 unsigned input, int value)
3347 {
3348         if (!bmap)
3349                 return NULL;
3350         isl_assert(bmap->ctx, input < isl_basic_map_n_in(bmap), goto error);
3351         return isl_basic_map_fix_var(bmap, isl_basic_map_n_param(bmap) + input,
3352                                         value);
3353 error:
3354         isl_basic_map_free(bmap);
3355         return NULL;
3356 }
3357
3358 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3359                 unsigned dim, int value)
3360 {
3361         if (!bset)
3362                 return NULL;
3363         isl_assert(bset->ctx, dim < isl_basic_set_n_dim(bset), goto error);
3364         return (struct isl_basic_set *)
3365                 isl_basic_map_fix_var((struct isl_basic_map *)bset,
3366                                     isl_basic_set_n_param(bset) + dim, value);
3367 error:
3368         isl_basic_set_free(bset);
3369         return NULL;
3370 }
3371
3372 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3373                 unsigned input, int value)
3374 {
3375         int i;
3376
3377         map = isl_map_cow(map);
3378         if (!map)
3379                 return NULL;
3380
3381         isl_assert(ctx, input < isl_map_n_in(map), goto error);
3382         for (i = 0; i < map->n; ++i) {
3383                 map->p[i] = isl_basic_map_fix_input_si(map->p[i], input, value);
3384                 if (!map->p[i])
3385                         goto error;
3386         }
3387         F_CLR(map, ISL_MAP_NORMALIZED);
3388         return map;
3389 error:
3390         isl_map_free(map);
3391         return NULL;
3392 }
3393
3394 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3395 {
3396         int i;
3397
3398         set = isl_set_cow(set);
3399         if (!set)
3400                 return NULL;
3401
3402         isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3403         for (i = 0; i < set->n; ++i) {
3404                 set->p[i] = isl_basic_set_fix_dim_si(set->p[i], dim, value);
3405                 if (!set->p[i])
3406                         goto error;
3407         }
3408         return set;
3409 error:
3410         isl_set_free(set);
3411         return NULL;
3412 }
3413
3414 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3415         unsigned dim, isl_int value)
3416 {
3417         int j;
3418         unsigned nparam;
3419
3420         bset = isl_basic_set_cow(bset);
3421         bset = isl_basic_set_extend_constraints(bset, 0, 1);
3422         j = isl_basic_set_alloc_inequality(bset);
3423         if (j < 0)
3424                 goto error;
3425         isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3426         isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3427         isl_int_neg(bset->ineq[j][0], value);
3428         bset = isl_basic_set_simplify(bset);
3429         return isl_basic_set_finalize(bset);
3430 error:
3431         isl_basic_set_free(bset);
3432         return NULL;
3433 }
3434
3435 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3436                                         isl_int value)
3437 {
3438         int i;
3439
3440         set = isl_set_cow(set);
3441         if (!set)
3442                 return NULL;
3443
3444         isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3445         for (i = 0; i < set->n; ++i) {
3446                 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3447                 if (!set->p[i])
3448                         goto error;
3449         }
3450         return set;
3451 error:
3452         isl_set_free(set);
3453         return NULL;
3454 }
3455
3456 struct isl_map *isl_map_reverse(struct isl_map *map)
3457 {
3458         int i;
3459         unsigned t;
3460
3461         map = isl_map_cow(map);
3462         if (!map)
3463                 return NULL;
3464
3465         map->dim = isl_dim_reverse(map->dim);
3466         if (!map->dim)
3467                 goto error;
3468         for (i = 0; i < map->n; ++i) {
3469                 map->p[i] = isl_basic_map_reverse(map->p[i]);
3470                 if (!map->p[i])
3471                         goto error;
3472         }
3473         F_CLR(map, ISL_MAP_NORMALIZED);
3474         return map;
3475 error:
3476         isl_map_free(map);
3477         return NULL;
3478 }
3479
3480 struct isl_map *isl_basic_map_lexmax(
3481                 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3482                 struct isl_set **empty)
3483 {
3484         return isl_pip_basic_map_lexmax(bmap, dom, empty);
3485 }
3486
3487 struct isl_map *isl_basic_map_lexmin(
3488                 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3489                 struct isl_set **empty)
3490 {
3491         return isl_pip_basic_map_lexmin(bmap, dom, empty);
3492 }
3493
3494 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
3495 {
3496         struct isl_basic_map *bmap = NULL;
3497         struct isl_basic_set *dom = NULL;
3498         struct isl_map *min;
3499         struct isl_dim *param_dim;
3500
3501         if (!bset)
3502                 goto error;
3503         bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
3504         if (!bmap)
3505                 goto error;
3506         param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3507         dom = isl_basic_set_universe(param_dim);
3508         if (!dom)
3509                 goto error;
3510         min = isl_basic_map_lexmin(bmap, dom, NULL);
3511         return isl_map_range(min);
3512 error:
3513         isl_basic_map_free(bmap);
3514         return NULL;
3515 }
3516
3517 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3518 {
3519         int i;
3520         unsigned off;
3521
3522         if (!bmap)
3523                 return NULL;
3524         off = isl_dim_total(bmap->dim);
3525         for (i = 0; i < bmap->n_div; ++i) {
3526                 if (isl_int_is_zero(bmap->div[i][0]))
3527                         return isl_pip_basic_map_compute_divs(bmap);
3528                 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
3529                                 goto error);
3530         }
3531         return isl_map_from_basic_map(bmap);
3532 error:
3533         isl_basic_map_free(bmap);
3534         return NULL;
3535 }
3536
3537 struct isl_map *isl_map_compute_divs(struct isl_map *map)
3538 {
3539         int i;
3540         struct isl_map *res;
3541
3542         if (!map)
3543                 return NULL;
3544         if (map->n == 0)
3545                 return map;
3546         res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
3547         for (i = 1 ; i < map->n; ++i) {
3548                 struct isl_map *r2;
3549                 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
3550                 if (F_ISSET(map, ISL_MAP_DISJOINT))
3551                         res = isl_map_union_disjoint(res, r2);
3552                 else
3553                         res = isl_map_union(res, r2);
3554         }
3555         isl_map_free(map);
3556
3557         return res;
3558 }
3559
3560 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
3561 {
3562         return (struct isl_set *)
3563                 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
3564 }
3565
3566 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3567 {
3568         return (struct isl_set *)
3569                 isl_map_compute_divs((struct isl_map *)set);
3570 }
3571
3572 struct isl_set *isl_map_domain(struct isl_map *map)
3573 {
3574         int i;
3575         struct isl_set *set;
3576
3577         if (!map)
3578                 goto error;
3579
3580         map = isl_map_cow(map);
3581         if (!map)
3582                 return NULL;
3583
3584         set = (struct isl_set *)map;
3585         set->dim = isl_dim_domain(set->dim);
3586         if (!set->dim)
3587                 goto error;
3588         for (i = 0; i < map->n; ++i) {
3589                 set->p[i] = isl_basic_map_domain(map->p[i]);
3590                 if (!set->p[i])
3591                         goto error;
3592         }
3593         F_CLR(set, ISL_MAP_DISJOINT);
3594         F_CLR(set, ISL_SET_NORMALIZED);
3595         return set;
3596 error:
3597         isl_map_free(map);
3598         return NULL;
3599 }
3600
3601 struct isl_map *isl_map_union_disjoint(
3602                         struct isl_map *map1, struct isl_map *map2)
3603 {
3604         int i;
3605         unsigned flags = 0;
3606         struct isl_map *map = NULL;
3607
3608         if (!map1 || !map2)
3609                 goto error;
3610
3611         if (map1->n == 0) {
3612                 isl_map_free(map1);
3613                 return map2;
3614         }
3615         if (map2->n == 0) {
3616                 isl_map_free(map2);
3617                 return map1;
3618         }
3619
3620         isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3621
3622         if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
3623             F_ISSET(map2, ISL_MAP_DISJOINT))
3624                 FL_SET(flags, ISL_MAP_DISJOINT);
3625
3626         map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3627                                 map1->n + map2->n, flags);
3628         if (!map)
3629                 goto error;
3630         for (i = 0; i < map1->n; ++i) {
3631                 map = isl_map_add(map,
3632                                   isl_basic_map_copy(map1->p[i]));
3633                 if (!map)
3634                         goto error;
3635         }
3636         for (i = 0; i < map2->n; ++i) {
3637                 map = isl_map_add(map,
3638                                   isl_basic_map_copy(map2->p[i]));
3639                 if (!map)
3640                         goto error;
3641         }
3642         isl_map_free(map1);
3643         isl_map_free(map2);
3644         return map;
3645 error:
3646         isl_map_free(map);
3647         isl_map_free(map1);
3648         isl_map_free(map2);
3649         return NULL;
3650 }
3651
3652 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3653 {
3654         map1 = isl_map_union_disjoint(map1, map2);
3655         if (!map1)
3656                 return NULL;
3657         if (map1->n > 1)
3658                 F_CLR(map1, ISL_MAP_DISJOINT);
3659         return map1;
3660 }
3661
3662 struct isl_set *isl_set_union_disjoint(
3663                         struct isl_set *set1, struct isl_set *set2)
3664 {
3665         return (struct isl_set *)
3666                 isl_map_union_disjoint(
3667                         (struct isl_map *)set1, (struct isl_map *)set2);
3668 }
3669
3670 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3671 {
3672         return (struct isl_set *)
3673                 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3674 }
3675
3676 struct isl_map *isl_map_intersect_range(
3677                 struct isl_map *map, struct isl_set *set)
3678 {
3679         unsigned flags = 0;
3680         struct isl_map *result;
3681         int i, j;
3682
3683         if (!map || !set)
3684                 goto error;
3685
3686         if (F_ISSET(map, ISL_MAP_DISJOINT) &&
3687             F_ISSET(set, ISL_MAP_DISJOINT))
3688                 FL_SET(flags, ISL_MAP_DISJOINT);
3689
3690         result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3691                                         map->n * set->n, flags);
3692         if (!result)
3693                 goto error;
3694         for (i = 0; i < map->n; ++i)
3695                 for (j = 0; j < set->n; ++j) {
3696                         result = isl_map_add(result,
3697                             isl_basic_map_intersect_range(
3698                                 isl_basic_map_copy(map->p[i]),
3699                                 isl_basic_set_copy(set->p[j])));
3700                         if (!result)
3701                                 goto error;
3702                 }
3703         isl_map_free(map);
3704         isl_set_free(set);
3705         return result;
3706 error:
3707         isl_map_free(map);
3708         isl_set_free(set);
3709         return NULL;
3710 }
3711
3712 struct isl_map *isl_map_intersect_domain(
3713                 struct isl_map *map, struct isl_set *set)
3714 {
3715         return isl_map_reverse(
3716                 isl_map_intersect_range(isl_map_reverse(map), set));
3717 }
3718
3719 struct isl_map *isl_map_apply_domain(
3720                 struct isl_map *map1, struct isl_map *map2)
3721 {
3722         if (!map1 || !map2)
3723                 goto error;
3724         map1 = isl_map_reverse(map1);
3725         map1 = isl_map_apply_range(map1, map2);
3726         return isl_map_reverse(map1);
3727 error:
3728         isl_map_free(map1);
3729         isl_map_free(map2);
3730         return NULL;
3731 }
3732
3733 struct isl_map *isl_map_apply_range(
3734                 struct isl_map *map1, struct isl_map *map2)
3735 {
3736         struct isl_dim *dim_result;
3737         struct isl_map *result;
3738         int i, j;
3739         unsigned nparam;
3740         unsigned n_in;
3741         unsigned n_out;
3742
3743         if (!map1 || !map2)
3744                 goto error;
3745
3746         dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3747                                   isl_dim_copy(map2->dim));
3748
3749         result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3750         if (!result)
3751                 goto error;
3752         for (i = 0; i < map1->n; ++i)
3753                 for (j = 0; j < map2->n; ++j) {
3754                         result = isl_map_add(result,
3755                             isl_basic_map_apply_range(
3756                                 isl_basic_map_copy(map1->p[i]),
3757                                 isl_basic_map_copy(map2->p[j])));
3758                         if (!result)
3759                                 goto error;
3760                 }
3761         isl_map_free(map1);
3762         isl_map_free(map2);
3763         if (result && result->n <= 1)
3764                 F_SET(result, ISL_MAP_DISJOINT);
3765         return result;
3766 error:
3767         isl_map_free(map1);
3768         isl_map_free(map2);
3769         return NULL;
3770 }
3771
3772 /*
3773  * returns range - domain
3774  */
3775 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3776 {
3777         struct isl_basic_set *bset;
3778         unsigned dim;
3779         unsigned nparam;
3780         int i;
3781
3782         if (!bmap)
3783                 goto error;
3784         dim = isl_basic_map_n_in(bmap);
3785         nparam = isl_basic_map_n_param(bmap);
3786         isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3787         bset = isl_basic_set_from_basic_map(bmap);
3788         bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3789         bset = isl_basic_set_swap_vars(bset, 2*dim);
3790         for (i = 0; i < dim; ++i) {
3791                 int j = isl_basic_map_alloc_equality(
3792                                             (struct isl_basic_map *)bset);
3793                 if (j < 0)
3794                         goto error;
3795                 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3796                 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3797                 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3798                 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3799         }
3800         return isl_basic_set_project_out(bset, 2*dim, 0);
3801 error:
3802         isl_basic_map_free(bmap);
3803         return NULL;
3804 }
3805
3806 /*
3807  * returns range - domain
3808  */
3809 struct isl_set *isl_map_deltas(struct isl_map *map)
3810 {
3811         int i;
3812         struct isl_set *result;
3813
3814         if (!map)
3815                 return NULL;
3816
3817         isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3818         result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3819                                         isl_map_n_in(map), map->n, map->flags);
3820         if (!result)
3821                 goto error;
3822         for (i = 0; i < map->n; ++i)
3823                 result = isl_set_add(result,
3824                           isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3825         isl_map_free(map);
3826         return result;
3827 error:
3828         isl_map_free(map);
3829         return NULL;
3830 }
3831
3832 /* If the only constraints a div d=floor(f/m)
3833  * appears in are its two defining constraints
3834  *
3835  *      f - m d >=0
3836  *      -(f - (m - 1)) + m d >= 0
3837  *
3838  * then it can safely be removed.
3839  */
3840 static int div_is_redundant(struct isl_basic_map *bmap, int div)
3841 {
3842         int i;
3843         unsigned pos = 1 + isl_dim_total(bmap->dim) + div;
3844
3845         for (i = 0; i < bmap->n_eq; ++i)
3846                 if (!isl_int_is_zero(bmap->eq[i][pos]))
3847                         return 0;
3848
3849         for (i = 0; i < bmap->n_ineq; ++i) {
3850                 if (isl_int_is_zero(bmap->ineq[i][pos]))
3851                         continue;
3852                 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3853                         int neg;
3854                         isl_int_sub(bmap->div[div][1],
3855                                         bmap->div[div][1], bmap->div[div][0]);
3856                         isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
3857                         neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
3858                         isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
3859                         isl_int_add(bmap->div[div][1],
3860                                         bmap->div[div][1], bmap->div[div][0]);
3861                         if (!neg)
3862                                 return 0;
3863                         if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3864                                                     bmap->n_div-div-1) != -1)
3865                                 return 0;
3866                 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
3867                         if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
3868                                 return 0;
3869                         if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
3870                                                     bmap->n_div-div-1) != -1)
3871                                 return 0;
3872                 } else
3873                         return 0;
3874         }
3875
3876         for (i = 0; i < bmap->n_div; ++i)
3877                 if (!isl_int_is_zero(bmap->div[i][1+pos]))
3878                         return 0;
3879
3880         return 1;
3881 }
3882
3883 /*
3884  * Remove divs that don't occur in any of the constraints or other divs.
3885  * These can arise when dropping some of the variables in a quast
3886  * returned by piplib.
3887  */
3888 static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap)
3889 {
3890         int i;
3891
3892         if (!bmap)
3893                 return NULL;
3894
3895         for (i = bmap->n_div-1; i >= 0; --i) {
3896                 if (!div_is_redundant(bmap, i))
3897                         continue;
3898                 bmap = isl_basic_map_drop_div(bmap, i);
3899         }
3900         return bmap;
3901 }
3902
3903 struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap)
3904 {
3905         bmap = remove_redundant_divs(bmap);
3906         if (!bmap)
3907                 return NULL;
3908         F_SET(bmap, ISL_BASIC_SET_FINAL);
3909         return bmap;
3910 }
3911
3912 struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset)
3913 {
3914         return (struct isl_basic_set *)
3915                 isl_basic_map_finalize((struct isl_basic_map *)bset);
3916 }
3917
3918 struct isl_set *isl_set_finalize(struct isl_set *set)
3919 {
3920         int i;
3921
3922         if (!set)
3923                 return NULL;
3924         for (i = 0; i < set->n; ++i) {
3925                 set->p[i] = isl_basic_set_finalize(set->p[i]);
3926                 if (!set->p[i])
3927                         goto error;
3928         }
3929         return set;
3930 error:
3931         isl_set_free(set);
3932         return NULL;
3933 }
3934
3935 struct isl_map *isl_map_finalize(struct isl_map *map)
3936 {
3937         int i;
3938
3939         if (!map)
3940                 return NULL;
3941         for (i = 0; i < map->n; ++i) {
3942                 map->p[i] = isl_basic_map_finalize(map->p[i]);
3943                 if (!map->p[i])
3944                         goto error;
3945         }
3946         F_CLR(map, ISL_MAP_NORMALIZED);
3947         return map;
3948 error:
3949         isl_map_free(map);
3950         return NULL;
3951 }
3952
3953 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3954 {
3955         struct isl_basic_map *bmap;
3956         unsigned nparam;
3957         unsigned dim;
3958         int i;
3959
3960         if (!dims)
3961                 return NULL;
3962
3963         nparam = dims->nparam;
3964         dim = dims->n_out;
3965         bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3966         if (!bmap)
3967                 goto error;
3968
3969         for (i = 0; i < dim; ++i) {
3970                 int j = isl_basic_map_alloc_equality(bmap);
3971                 if (j < 0)
3972                         goto error;
3973                 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3974                 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3975                 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3976         }
3977         return isl_basic_map_finalize(bmap);
3978 error:
3979         isl_basic_map_free(bmap);
3980         return NULL;
3981 }
3982
3983 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3984 {
3985         struct isl_dim *dim = isl_dim_map(set_dim);
3986         if (!dim)
3987                 return NULL;
3988         return basic_map_identity(dim);
3989 }
3990
3991 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3992 {
3993         if (!model || !model->dim)
3994                 return NULL;
3995         isl_assert(model->ctx,
3996                         model->dim->n_in == model->dim->n_out, return NULL);
3997         return basic_map_identity(isl_dim_copy(model->dim));
3998 }
3999
4000 static struct isl_map *map_identity(struct isl_dim *dim)
4001 {
4002         struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4003         return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
4004 }
4005
4006 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4007 {
4008         struct isl_dim *dim = isl_dim_map(set_dim);
4009         if (!dim)
4010                 return NULL;
4011         return map_identity(dim);
4012 }
4013
4014 struct isl_map *isl_map_identity_like(struct isl_basic_map *model)
4015 {
4016         if (!model || !model->dim)
4017                 return NULL;
4018         isl_assert(model->ctx,
4019                         model->dim->n_in == model->dim->n_out, return NULL);
4020         return map_identity(isl_dim_copy(model->dim));
4021 }
4022
4023 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4024 {
4025         return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4026 }
4027
4028 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
4029 {
4030         return isl_map_is_subset(
4031                         (struct isl_map *)set1, (struct isl_map *)set2);
4032 }
4033
4034 int isl_basic_map_is_subset(
4035                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4036 {
4037         int is_subset;
4038         struct isl_map *map1;
4039         struct isl_map *map2;
4040
4041         if (!bmap1 || !bmap2)
4042                 return -1;
4043
4044         map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4045         map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4046
4047         is_subset = isl_map_is_subset(map1, map2);
4048
4049         isl_map_free(map1);
4050         isl_map_free(map2);
4051
4052         return is_subset;
4053 }
4054
4055 int isl_basic_map_is_equal(
4056                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4057 {
4058         int is_subset;
4059
4060         if (!bmap1 || !bmap2)
4061                 return -1;
4062         is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4063         if (is_subset != 1)
4064                 return is_subset;
4065         is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4066         return is_subset;
4067 }
4068
4069 int isl_basic_set_is_equal(
4070                 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4071 {
4072         return isl_basic_map_is_equal(
4073                 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4074 }
4075
4076 int isl_map_is_empty(struct isl_map *map)
4077 {
4078         int i;
4079         int is_empty;
4080
4081         if (!map)
4082                 return -1;
4083         for (i = 0; i < map->n; ++i) {
4084                 is_empty = isl_basic_map_is_empty(map->p[i]);
4085                 if (is_empty < 0)
4086                         return -1;
4087                 if (!is_empty)
4088                         return 0;
4089         }
4090         return 1;
4091 }
4092
4093 int isl_set_is_empty(struct isl_set *set)
4094 {
4095         return isl_map_is_empty((struct isl_map *)set);
4096 }
4097
4098 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
4099 {
4100         int i;
4101         int is_subset = 0;
4102         struct isl_map *diff;
4103
4104         if (!map1 || !map2)
4105                 return -1;
4106
4107         if (isl_map_is_empty(map1))
4108                 return 1;
4109
4110         if (isl_map_is_empty(map2))
4111                 return 0;
4112
4113         diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
4114         if (!diff)
4115                 return -1;
4116
4117         is_subset = isl_map_is_empty(diff);
4118         isl_map_free(diff);
4119
4120         return is_subset;
4121 }
4122
4123 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4124 {
4125         int is_subset;
4126
4127         if (!map1 || !map2)
4128                 return -1;
4129         is_subset = isl_map_is_subset(map1, map2);
4130         if (is_subset != 1)
4131                 return is_subset;
4132         is_subset = isl_map_is_subset(map2, map1);
4133         return is_subset;
4134 }
4135
4136 int isl_basic_map_is_strict_subset(
4137                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4138 {
4139         int is_subset;
4140
4141         if (!bmap1 || !bmap2)
4142                 return -1;
4143         is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4144         if (is_subset != 1)
4145                 return is_subset;
4146         is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4147         if (is_subset == -1)
4148                 return is_subset;
4149         return !is_subset;
4150 }
4151
4152 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
4153 {
4154         int i;
4155         unsigned total;
4156         isl_int s;
4157
4158         total = 1 + isl_basic_map_total_dim(bmap);
4159         if (total != vec->size)
4160                 return -1;
4161
4162         isl_int_init(s);
4163
4164         for (i = 0; i < bmap->n_eq; ++i) {
4165                 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
4166                 if (!isl_int_is_zero(s)) {
4167                         isl_int_clear(s);
4168                         return 0;
4169                 }
4170         }
4171
4172         for (i = 0; i < bmap->n_ineq; ++i) {
4173                 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
4174                 if (isl_int_is_neg(s)) {
4175                         isl_int_clear(s);
4176                         return 0;
4177                 }
4178         }
4179
4180         isl_int_clear(s);
4181
4182         return 1;
4183 }
4184
4185 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4186 {
4187         if (!bmap)
4188                 return -1;
4189         return bmap->n_eq == 0 && bmap->n_ineq == 0;
4190 }
4191
4192 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4193 {
4194         struct isl_basic_set *bset = NULL;
4195         struct isl_vec *sample = NULL;
4196         int empty;
4197         unsigned total;
4198
4199         if (!bmap)
4200                 return -1;
4201
4202         if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4203                 return 1;
4204
4205         if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4206                 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4207                 copy = isl_basic_map_convex_hull(copy);
4208                 empty = F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4209                 isl_basic_map_free(copy);
4210                 return empty;
4211         }
4212
4213         total = 1 + isl_basic_map_total_dim(bmap);
4214         if (bmap->sample && bmap->sample->size == total) {
4215                 int contains = basic_map_contains(bmap, bmap->sample);
4216                 if (contains < 0)
4217                         return -1;
4218                 if (contains)
4219                         return 0;
4220         }
4221         bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4222         if (!bset)
4223                 return -1;
4224         sample = isl_basic_set_sample(bset);
4225         if (!sample)
4226                 return -1;
4227         empty = sample->size == 0;
4228         if (bmap->sample)
4229                 isl_vec_free(bmap->ctx, bmap->sample);
4230         bmap->sample = sample;
4231
4232         return empty;
4233 }
4234
4235 struct isl_map *isl_basic_map_union(
4236         struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4237 {
4238         struct isl_map *map;
4239         if (!bmap1 || !bmap2)
4240                 return NULL;
4241
4242         isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4243
4244         map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4245         if (!map)
4246                 goto error;
4247         map = isl_map_add(map, bmap1);
4248         map = isl_map_add(map, bmap2);
4249         return map;
4250 error:
4251         isl_basic_map_free(bmap1);
4252         isl_basic_map_free(bmap2);
4253         return NULL;
4254 }
4255
4256 struct isl_set *isl_basic_set_union(
4257                 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4258 {
4259         return (struct isl_set *)isl_basic_map_union(
4260                                             (struct isl_basic_map *)bset1,
4261                                             (struct isl_basic_map *)bset2);
4262 }
4263
4264 /* Order divs such that any div only depends on previous divs */
4265 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
4266 {
4267         int i;
4268         unsigned off = isl_dim_total(bmap->dim);
4269
4270         for (i = 0; i < bmap->n_div; ++i) {
4271                 int pos;
4272                 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4273                                                             bmap->n_div-i);
4274                 if (pos == -1)
4275                         continue;
4276                 swap_div(bmap, i, pos);
4277                 --i;
4278         }
4279         return bmap;
4280 }
4281
4282 /* Look for a div in dst that corresponds to the div "div" in src.
4283  * The divs before "div" in src and dst are assumed to be the same.
4284  *
4285  * Returns -1 if no corresponding div was found and the position
4286  * of the corresponding div in dst otherwise.
4287  */
4288 static int find_div(struct isl_basic_map *dst,
4289                         struct isl_basic_map *src, unsigned div)
4290 {
4291         int i;
4292
4293         unsigned total = isl_dim_total(src->dim);
4294
4295         isl_assert(dst->ctx, div <= dst->n_div, return -1);
4296         for (i = div; i < dst->n_div; ++i)
4297                 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
4298                     isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
4299                                                 dst->n_div - div) == -1)
4300                         return i;
4301         return -1;
4302 }
4303
4304 struct isl_basic_map *isl_basic_map_align_divs(
4305                 struct isl_basic_map *dst, struct isl_basic_map *src)
4306 {
4307         int i;
4308         unsigned total = isl_dim_total(src->dim);
4309
4310         if (!dst || !src)
4311                 goto error;
4312
4313         if (src->n_div == 0)
4314                 return dst;
4315
4316         for (i = 0; i < src->n_div; ++i)
4317                 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
4318
4319         src = order_divs(src);
4320         dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4321                         src->n_div, 0, 2 * src->n_div);
4322         if (!dst)
4323                 return NULL;
4324         for (i = 0; i < src->n_div; ++i) {
4325                 int j = find_div(dst, src, i);
4326                 if (j < 0) {
4327                         j = isl_basic_map_alloc_div(dst);
4328                         if (j < 0)
4329                                 goto error;
4330                         isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
4331                         isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
4332                         if (add_div_constraints(dst, j) < 0)
4333                                 goto error;
4334                 }
4335                 if (j != i)
4336                         swap_div(dst, i, j);
4337         }
4338         return dst;
4339 error:
4340         isl_basic_map_free(dst);
4341         return NULL;
4342 }
4343
4344 struct isl_basic_set *isl_basic_set_align_divs(
4345                 struct isl_basic_set *dst, struct isl_basic_set *src)
4346 {
4347         return (struct isl_basic_set *)isl_basic_map_align_divs(
4348                 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4349 }
4350
4351 struct isl_map *isl_map_align_divs(struct isl_map *map)
4352 {
4353         int i;
4354
4355         map = isl_map_compute_divs(map);
4356         map = isl_map_cow(map);
4357         if (!map)
4358                 return NULL;
4359
4360         for (i = 1; i < map->n; ++i)
4361                 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
4362         for (i = 1; i < map->n; ++i)
4363                 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
4364
4365         F_CLR(map, ISL_MAP_NORMALIZED);
4366         return map;
4367 }
4368
4369 static struct isl_map *add_cut_constraint(struct isl_map *dst,
4370                 struct isl_basic_map *src, isl_int *c,
4371                 unsigned len, int oppose)
4372 {
4373         struct isl_basic_map *copy = NULL;
4374         int is_empty;
4375         int k;
4376         unsigned total;
4377
4378         copy = isl_basic_map_copy(src);
4379         copy = isl_basic_map_cow(copy);
4380         if (!copy)
4381                 goto error;
4382         copy = isl_basic_map_extend_constraints(copy, 0, 1);
4383         k = isl_basic_map_alloc_inequality(copy);
4384         if (k < 0)
4385                 goto error;
4386         if (oppose)
4387                 isl_seq_neg(copy->ineq[k], c, len);
4388         else
4389                 isl_seq_cpy(copy->ineq[k], c, len);
4390         total = 1 + isl_basic_map_total_dim(copy);
4391         isl_seq_clr(copy->ineq[k]+len, total - len);
4392         isl_inequality_negate(copy, k);
4393         copy = isl_basic_map_simplify(copy);
4394         copy = isl_basic_map_finalize(copy);
4395         is_empty = isl_basic_map_is_empty(copy);
4396         if (is_empty < 0)
4397                 goto error;
4398         if (!is_empty)
4399                 dst = isl_map_add(dst, copy);
4400         else
4401                 isl_basic_map_free(copy);
4402         return dst;
4403 error:
4404         isl_basic_map_free(copy);
4405         isl_map_free(dst);
4406         return NULL;
4407 }
4408
4409 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
4410 {
4411         int i, j, k;
4412         unsigned flags = 0;
4413         struct isl_map *rest = NULL;
4414         unsigned max;
4415         unsigned total = isl_basic_map_total_dim(bmap);
4416
4417         assert(bmap);
4418
4419         if (!map)
4420                 goto error;
4421
4422         if (F_ISSET(map, ISL_MAP_DISJOINT))
4423                 FL_SET(flags, ISL_MAP_DISJOINT);
4424
4425         max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
4426         rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
4427         if (!rest)
4428                 goto error;
4429
4430         for (i = 0; i < map->n; ++i) {
4431                 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
4432                 if (!map->p[i])
4433                         goto error;
4434         }
4435
4436         for (j = 0; j < map->n; ++j)
4437                 map->p[j] = isl_basic_map_cow(map->p[j]);
4438
4439         for (i = 0; i < bmap->n_eq; ++i) {
4440                 for (j = 0; j < map->n; ++j) {
4441                         rest = add_cut_constraint(rest,
4442                                 map->p[j], bmap->eq[i], 1+total, 0);
4443                         if (!rest)
4444                                 goto error;
4445
4446                         rest = add_cut_constraint(rest,
4447                                 map->p[j], bmap->eq[i], 1+total, 1);
4448                         if (!rest)
4449                                 goto error;
4450
4451                         map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4452                                 1, 0);
4453                         if (!map->p[j])
4454                                 goto error;
4455                         k = isl_basic_map_alloc_equality(map->p[j]);
4456                         if (k < 0)
4457                                 goto error;
4458                         isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
4459                         isl_seq_clr(map->p[j]->eq[k]+1+total,
4460                                         map->p[j]->n_div - bmap->n_div);
4461                 }
4462         }
4463
4464         for (i = 0; i < bmap->n_ineq; ++i) {
4465                 for (j = 0; j < map->n; ++j) {
4466                         rest = add_cut_constraint(rest,
4467                                 map->p[j], bmap->ineq[i], 1+total, 0);
4468                         if (!rest)
4469                                 goto error;
4470
4471                         map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4472                                 0, 1);
4473                         if (!map->p[j])
4474                                 goto error;
4475                         k = isl_basic_map_alloc_inequality(map->p[j]);
4476                         if (k < 0)
4477                                 goto error;
4478                         isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
4479                         isl_seq_clr(map->p[j]->ineq[k]+1+total,
4480                                         map->p[j]->n_div - bmap->n_div);
4481                 }
4482         }
4483
4484         isl_map_free(map);
4485         return rest;
4486 error:
4487         isl_map_free(map);
4488         isl_map_free(rest);
4489         return NULL;
4490 }
4491
4492 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
4493 {
4494         int i;
4495         if (!map1 || !map2)
4496                 goto error;
4497
4498         isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4499
4500         if (isl_map_is_empty(map2)) {
4501                 isl_map_free(map2);
4502                 return map1;
4503         }
4504
4505         map1 = isl_map_compute_divs(map1);
4506         map2 = isl_map_compute_divs(map2);
4507         if (!map1 || !map2)
4508                 goto error;
4509
4510         for (i = 0; map1 && i < map2->n; ++i)
4511                 map1 = subtract(map1, map2->p[i]);
4512
4513         isl_map_free(map2);
4514         return map1;
4515 error:
4516         isl_map_free(map1);
4517         isl_map_free(map2);
4518         return NULL;
4519 }
4520
4521 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
4522 {
4523         return (struct isl_set *)
4524                 isl_map_subtract(
4525                         (struct isl_map *)set1, (struct isl_map *)set2);
4526 }
4527
4528 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
4529 {
4530         if (!set || !map)
4531                 goto error;
4532         isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
4533         map = isl_map_intersect_domain(map, set);
4534         set = isl_map_range(map);
4535         return set;
4536 error:
4537         isl_set_free(set);
4538         isl_map_free(map);
4539         return NULL;
4540 }
4541
4542 /* There is no need to cow as removing empty parts doesn't change
4543  * the meaning of the set.
4544  */
4545 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
4546 {
4547         int i;
4548
4549         if (!map)
4550                 return NULL;
4551
4552         for (i = map->n-1; i >= 0; --i) {
4553                 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
4554                         continue;
4555                 isl_basic_map_free(map->p[i]);
4556                 if (i != map->n-1) {
4557                         F_CLR(map, ISL_MAP_NORMALIZED);
4558                         map->p[i] = map->p[map->n-1];
4559                 }
4560                 map->n--;
4561         }
4562
4563         return map;
4564 }
4565
4566 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4567 {
4568         return (struct isl_set *)
4569                 isl_map_remove_empty_parts((struct isl_map *)set);
4570 }
4571
4572 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4573 {
4574         struct isl_basic_set *bset;
4575         if (!set || set->n == 0)
4576                 return NULL;
4577         bset = set->p[set->n-1];
4578         isl_assert(set->ctx, F_ISSET(bset, ISL_BASIC_SET_FINAL), return NULL);
4579         return isl_basic_set_copy(bset);
4580 }
4581
4582 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4583                                                 struct isl_basic_set *bset)
4584 {
4585         int i;
4586
4587         if (!set || !bset)
4588                 goto error;
4589         for (i = set->n-1; i >= 0; --i) {
4590                 if (set->p[i] != bset)
4591                         continue;
4592                 set = isl_set_cow(set);
4593                 if (!set)
4594                         goto error;
4595                 isl_basic_set_free(set->p[i]);
4596                 if (i != set->n-1) {
4597                         F_CLR(set, ISL_SET_NORMALIZED);
4598                         set->p[i] = set->p[set->n-1];
4599                 }
4600                 set->n--;
4601                 return set;
4602         }
4603         isl_basic_set_free(bset);
4604         return set;
4605 error:
4606         isl_set_free(set);
4607         isl_basic_set_free(bset);
4608         return NULL;
4609 }
4610
4611 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4612  * for any common value of the parameters and dimensions preceding dim
4613  * in both basic sets, the values of dimension pos in bset1 are
4614  * smaller or larger than those in bset2.
4615  *
4616  * Returns
4617  *       1 if bset1 follows bset2
4618  *      -1 if bset1 precedes bset2
4619  *       0 if bset1 and bset2 are incomparable
4620  *      -2 if some error occurred.
4621  */
4622 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4623         struct isl_basic_set *bset2, int pos)
4624 {
4625         struct isl_dim *dims;
4626         struct isl_basic_map *bmap1 = NULL;
4627         struct isl_basic_map *bmap2 = NULL;
4628         struct isl_ctx *ctx;
4629         struct isl_vec *obj;
4630         unsigned total;
4631         unsigned nparam;
4632         unsigned dim1, dim2;
4633         isl_int num, den;
4634         enum isl_lp_result res;
4635         int cmp;
4636
4637         if (!bset1 || !bset2)
4638                 return -2;
4639
4640         nparam = isl_basic_set_n_param(bset1);
4641         dim1 = isl_basic_set_n_dim(bset1);
4642         dim2 = isl_basic_set_n_dim(bset2);
4643         dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4644         bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4645         dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4646         bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4647         if (!bmap1 || !bmap2)
4648                 goto error;
4649         bmap1 = isl_basic_map_extend(bmap1, nparam,
4650                         pos, (dim1 - pos) + (dim2 - pos),
4651                         bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4652         bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4653         if (!bmap1)
4654                 goto error;
4655         total = isl_basic_map_total_dim(bmap1);
4656         ctx = bmap1->ctx;
4657         obj = isl_vec_alloc(ctx, total);
4658         isl_seq_clr(obj->block.data, total);
4659         isl_int_set_si(obj->block.data[nparam+pos], 1);
4660         isl_int_set_si(obj->block.data[nparam+pos+(dim1-pos)], -1);
4661         if (!obj)
4662                 goto error;
4663         isl_int_init(num);
4664         isl_int_init(den);
4665         res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
4666         if (res == isl_lp_empty)
4667                 cmp = 0;
4668         else if (res == isl_lp_ok && isl_int_is_pos(num))
4669                 cmp = 1;
4670         else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4671                   res == isl_lp_unbounded)
4672                 cmp = -1;
4673         else
4674                 cmp = -2;
4675         isl_int_clear(num);
4676         isl_int_clear(den);
4677         isl_basic_map_free(bmap1);
4678         isl_vec_free(ctx, obj);
4679         return cmp;
4680 error:
4681         isl_basic_map_free(bmap1);
4682         isl_basic_map_free(bmap2);
4683         return -2;
4684 }
4685
4686 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4687         unsigned pos, isl_int *val)
4688 {
4689         int i;
4690         int d;
4691         unsigned total;
4692
4693         if (!bmap)
4694                 return -1;
4695         total = isl_basic_map_total_dim(bmap);
4696         for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4697                 for (; d+1 > pos; --d)
4698                         if (!isl_int_is_zero(bmap->eq[i][1+d]))
4699                                 break;
4700                 if (d != pos)
4701                         continue;
4702                 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4703                         return 0;
4704                 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4705                         return 0;
4706                 if (!isl_int_is_one(bmap->eq[i][1+d]))
4707                         return 0;
4708                 if (val)
4709                         isl_int_neg(*val, bmap->eq[i][0]);
4710                 return 1;
4711         }
4712         return 0;
4713 }
4714
4715 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4716         unsigned pos, isl_int *val)
4717 {
4718         int i;
4719         isl_int v;
4720         isl_int tmp;
4721         int fixed;
4722
4723         if (!map)
4724                 return -1;
4725         if (map->n == 0)
4726                 return 0;
4727         if (map->n == 1)
4728                 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
4729         isl_int_init(v);
4730         isl_int_init(tmp);
4731         fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
4732         for (i = 1; fixed == 1 && i < map->n; ++i) {
4733                 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
4734                 if (fixed == 1 && isl_int_ne(tmp, v))
4735                         fixed = 0;
4736         }
4737         if (val)
4738                 isl_int_set(*val, v);
4739         isl_int_clear(tmp);
4740         isl_int_clear(v);
4741         return fixed;
4742 }
4743
4744 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4745         isl_int *val)
4746 {
4747         return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4748 }
4749
4750 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4751  * then return this fixed value in *val.
4752  */
4753 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4754 {
4755         return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
4756 }
4757
4758 /* Check if input variable in has fixed value and if so and if val is not NULL,
4759  * then return this fixed value in *val.
4760  */
4761 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4762 {
4763         return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
4764 }
4765
4766 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4767  * and if val is not NULL, then return this lower bound in *val.
4768  */
4769 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4770         unsigned dim, isl_int *val)
4771 {
4772         int i, i_eq = -1, i_ineq = -1;
4773         isl_int *c;
4774         unsigned total;
4775         unsigned nparam;
4776
4777         if (!bset)
4778                 return -1;
4779         total = isl_basic_set_total_dim(bset);
4780         nparam = isl_basic_set_n_param(bset);
4781         for (i = 0; i < bset->n_eq; ++i) {
4782                 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4783                         continue;
4784                 if (i_eq != -1)
4785                         return 0;
4786                 i_eq = i;
4787         }
4788         for (i = 0; i < bset->n_ineq; ++i) {
4789                 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4790                         continue;
4791                 if (i_eq != -1 || i_ineq != -1)
4792                         return 0;
4793                 i_ineq = i;
4794         }
4795         if (i_eq == -1 && i_ineq == -1)
4796                 return 0;
4797         c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4798         /* The coefficient should always be one due to normalization. */
4799         if (!isl_int_is_one(c[1+nparam+dim]))
4800                 return 0;
4801         if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4802                 return 0;
4803         if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4804                                         total - nparam - dim - 1) != -1)
4805                 return 0;
4806         if (val)
4807                 isl_int_neg(*val, c[0]);
4808         return 1;
4809 }
4810
4811 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4812         unsigned dim, isl_int *val)
4813 {
4814         int i;
4815         isl_int v;
4816         isl_int tmp;
4817         int fixed;
4818
4819         if (!set)
4820                 return -1;
4821         if (set->n == 0)
4822                 return 0;
4823         if (set->n == 1)
4824                 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4825                                                                 dim, val);
4826         isl_int_init(v);
4827         isl_int_init(tmp);
4828         fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4829                                                                 dim, &v);
4830         for (i = 1; fixed == 1 && i < set->n; ++i) {
4831                 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4832                                                                 dim, &tmp);
4833                 if (fixed == 1 && isl_int_ne(tmp, v))
4834                         fixed = 0;
4835         }
4836         if (val)
4837                 isl_int_set(*val, v);
4838         isl_int_clear(tmp);
4839         isl_int_clear(v);
4840         return fixed;
4841 }
4842
4843 static struct isl_basic_set *isl_basic_set_reduce_using_equalities(
4844         struct isl_basic_set *bset, struct isl_basic_set *context)
4845 {
4846         int i;
4847         int *elim;
4848
4849         if (!bset || !context)
4850                 goto error;
4851
4852         bset = isl_basic_set_cow(bset);
4853         if (!bset)
4854                 goto error;
4855
4856         elim = isl_alloc_array(ctx, int, isl_basic_set_n_dim(bset));
4857         if (!elim)
4858                 goto error;
4859         set_compute_elimination_index(context, elim);
4860         for (i = 0; i < bset->n_eq; ++i)
4861                 set_reduced_using_equalities(bset->eq[i], bset->eq[i],
4862                                                         context, elim);
4863         for (i = 0; i < bset->n_ineq; ++i)
4864                 set_reduced_using_equalities(bset->ineq[i], bset->ineq[i],
4865                                                         context, elim);
4866         isl_basic_set_free(context);
4867         free(elim);
4868         bset = isl_basic_set_simplify(bset);
4869         bset = isl_basic_set_finalize(bset);
4870         return bset;
4871 error:
4872         isl_basic_set_free(bset);
4873         isl_basic_set_free(context);
4874         return NULL;
4875 }
4876
4877 static struct isl_basic_set *remove_shifted_constraints(
4878         struct isl_basic_set *bset, struct isl_basic_set *context)
4879 {
4880         unsigned int size;
4881         isl_int ***index;
4882         int bits;
4883         int k, h, l;
4884
4885         if (!bset)
4886                 return NULL;
4887
4888         size = round_up(4 * (context->n_ineq+1) / 3 - 1);
4889         bits = ffs(size) - 1;
4890         index = isl_calloc_array(ctx, isl_int **, size);
4891         if (!index)
4892                 return bset;
4893
4894         for (k = 0; k < context->n_ineq; ++k) {
4895                 h = set_hash_index(index, size, bits, context, k);
4896                 index[h] = &context->ineq[k];
4897         }
4898         for (k = 0; k < bset->n_ineq; ++k) {
4899                 h = set_hash_index(index, size, bits, bset, k);
4900                 if (!index[h])
4901                         continue;
4902                 l = index[h] - &context->ineq[0];
4903                 if (isl_int_lt(bset->ineq[k][0], context->ineq[l][0]))
4904                         continue;
4905                 bset = isl_basic_set_cow(bset);
4906                 if (!bset)
4907                         goto error;
4908                 isl_basic_set_drop_inequality(bset, k);
4909                 --k;
4910         }
4911         free(index);
4912         return bset;
4913 error:
4914         free(index);
4915         return bset;
4916 }
4917
4918 /* Remove all information from bset that is redundant in the context
4919  * of context.  In particular, equalities that are linear combinations
4920  * of those in context are removed.  Then the inequalities that are
4921  * redundant in the context of the equalities and inequalities of
4922  * context are removed.
4923  */
4924 static struct isl_basic_set *uset_gist(struct isl_basic_set *bset,
4925         struct isl_basic_set *context)
4926 {
4927         int i;
4928         isl_int opt;
4929         struct isl_basic_set *combined;
4930         struct isl_ctx *ctx;
4931
4932         if (!bset || !context)
4933                 goto error;
4934
4935         if (context->n_eq > 0) {
4936                 struct isl_mat *T;
4937                 struct isl_mat *T2;
4938                 struct isl_ctx *ctx = context->ctx;
4939                 struct isl_basic_set *reduced_context;
4940                 reduced_context = isl_basic_set_remove_equalities(
4941                                         isl_basic_set_copy(context), &T, &T2);
4942                 if (!reduced_context)
4943                         goto error;
4944                 bset = isl_basic_set_preimage(ctx, bset, T);
4945                 bset = uset_gist(bset, reduced_context);
4946                 bset = isl_basic_set_preimage(ctx, bset, T2);
4947                 bset = isl_basic_set_reduce_using_equalities(bset, context);
4948                 return bset;
4949         }
4950         if (!context->n_ineq)
4951                 goto done;
4952         bset = remove_shifted_constraints(bset, context);
4953         combined = isl_basic_set_extend_constraints(isl_basic_set_copy(bset),
4954                         context->n_eq, context->n_ineq);
4955         context = set_add_constraints(combined, context, 0);
4956         if (!context)
4957                 goto error;
4958         ctx = context->ctx;
4959         isl_int_init(opt);
4960         for (i = bset->n_ineq-1; i >= 0; --i) {
4961                 int redundant;
4962                 set_swap_inequality(context, i, context->n_ineq-1);
4963                 context->n_ineq--;
4964                 redundant = isl_basic_set_constraint_is_redundant(&context,
4965                                 context->ineq[context->n_ineq], &opt, NULL);
4966                 if (redundant == -1) {
4967                         isl_int_clear(opt);
4968                         goto error;
4969                 }
4970                 if (F_ISSET(context, ISL_BASIC_MAP_EMPTY)) {
4971                         bset = isl_basic_set_set_to_empty(bset);
4972                         break;
4973                 }
4974                 context->n_ineq++;
4975                 set_swap_inequality(context, i, context->n_ineq-1);
4976                 if (redundant) {
4977                         isl_basic_set_drop_inequality(context, i);
4978                         isl_basic_set_drop_inequality(bset, i);
4979                 }
4980         }
4981         isl_int_clear(opt);
4982 done:
4983         isl_basic_set_free(context);
4984         return bset;
4985 error:
4986         isl_basic_set_free(context);
4987         isl_basic_set_free(bset);
4988         return NULL;
4989 }
4990
4991 struct isl_basic_map *isl_basic_map_gist(struct isl_basic_map *bmap,
4992         struct isl_basic_map *context)
4993 {
4994         struct isl_basic_set *bset;
4995
4996         if (!bmap || !context)
4997                 goto error;
4998
4999         context = isl_basic_map_align_divs(context, bmap);
5000         bmap = isl_basic_map_align_divs(bmap, context);
5001
5002         bset = uset_gist(isl_basic_map_underlying_set(isl_basic_map_copy(bmap)),
5003                          isl_basic_map_underlying_set(context));
5004
5005         return isl_basic_map_overlying_set(bset, bmap);
5006 error:
5007         isl_basic_map_free(bmap);
5008         isl_basic_map_free(context);
5009         return NULL;
5010 }
5011
5012 /*
5013  * Assumes context has no implicit divs.
5014  */
5015 struct isl_map *isl_map_gist(struct isl_map *map, struct isl_basic_map *context)
5016 {
5017         int i;
5018
5019         map = isl_map_cow(map);
5020         if (!map || !context)
5021                 return NULL;
5022         isl_assert(map->ctx, isl_dim_equal(map->dim, context->dim), goto error);
5023         map = isl_map_compute_divs(map);
5024         for (i = 0; i < map->n; ++i)
5025                 context = isl_basic_map_align_divs(context, map->p[i]);
5026         for (i = 0; i < map->n; ++i) {
5027                 map->p[i] = isl_basic_map_gist(map->p[i],
5028                                                 isl_basic_map_copy(context));
5029                 if (!map->p[i])
5030                         goto error;
5031         }
5032         isl_basic_map_free(context);
5033         F_CLR(map, ISL_MAP_NORMALIZED);
5034         return map;
5035 error:
5036         isl_map_free(map);
5037         isl_basic_map_free(context);
5038         return NULL;
5039 }
5040
5041 struct isl_basic_set *isl_basic_set_gist(struct isl_basic_set *bset,
5042                                                 struct isl_basic_set *context)
5043 {
5044         return (struct isl_basic_set *)isl_basic_map_gist(
5045                 (struct isl_basic_map *)bset, (struct isl_basic_map *)context);
5046 }
5047
5048 struct isl_set *isl_set_gist(struct isl_set *set, struct isl_basic_set *context)
5049 {
5050         return (struct isl_set *)isl_map_gist((struct isl_map *)set,
5051                                         (struct isl_basic_map *)context);
5052 }
5053
5054 struct constraint {
5055         unsigned        size;
5056         isl_int         *c;
5057 };
5058
5059 static int qsort_constraint_cmp(const void *p1, const void *p2)
5060 {
5061         const struct constraint *c1 = (const struct constraint *)p1;
5062         const struct constraint *c2 = (const struct constraint *)p2;
5063         unsigned size = isl_min(c1->size, c2->size);
5064         return isl_seq_cmp(c1->c, c2->c, size);
5065 }
5066
5067 static struct isl_basic_map *isl_basic_map_sort_constraints(
5068         struct isl_basic_map *bmap)
5069 {
5070         int i;
5071         struct constraint *c;
5072         unsigned total;
5073
5074         if (!bmap)
5075                 return NULL;
5076         total = isl_basic_map_total_dim(bmap);
5077         c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5078         if (!c)
5079                 goto error;
5080         for (i = 0; i < bmap->n_ineq; ++i) {
5081                 c[i].size = total;
5082                 c[i].c = bmap->ineq[i];
5083         }
5084         qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5085         for (i = 0; i < bmap->n_ineq; ++i)
5086                 bmap->ineq[i] = c[i].c;
5087         free(c);
5088         return bmap;
5089 error:
5090         isl_basic_map_free(bmap);
5091         return NULL;
5092 }
5093
5094 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5095 {
5096         if (!bmap)
5097                 return NULL;
5098         if (F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5099                 return bmap;
5100         bmap = isl_basic_map_convex_hull(bmap);
5101         bmap = isl_basic_map_sort_constraints(bmap);
5102         F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5103         return bmap;
5104 }
5105
5106 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5107 {
5108         return (struct isl_basic_set *)isl_basic_map_normalize(
5109                                                 (struct isl_basic_map *)bset);
5110 }
5111
5112 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5113         const struct isl_basic_map *bmap2)
5114 {
5115         int i, cmp;
5116         unsigned total;
5117
5118         if (bmap1 == bmap2)
5119                 return 0;
5120         if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5121                 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5122         if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5123                 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5124         if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5125                 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5126         if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5127             F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5128                 return 0;
5129         if (F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5130                 return 1;
5131         if (F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5132                 return -1;
5133         if (bmap1->n_eq != bmap2->n_eq)
5134                 return bmap1->n_eq - bmap2->n_eq;
5135         if (bmap1->n_ineq != bmap2->n_ineq)
5136                 return bmap1->n_ineq - bmap2->n_ineq;
5137         if (bmap1->n_div != bmap2->n_div)
5138                 return bmap1->n_div - bmap2->n_div;
5139         total = isl_basic_map_total_dim(bmap1);
5140         for (i = 0; i < bmap1->n_eq; ++i) {
5141                 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5142                 if (cmp)
5143                         return cmp;
5144         }
5145         for (i = 0; i < bmap1->n_ineq; ++i) {
5146                 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5147                 if (cmp)
5148                         return cmp;
5149         }
5150         for (i = 0; i < bmap1->n_div; ++i) {
5151                 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5152                 if (cmp)
5153                         return cmp;
5154         }
5155         return 0;
5156 }
5157
5158 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5159         struct isl_basic_map *bmap2)
5160 {
5161         return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5162 }
5163
5164 static int qsort_bmap_cmp(const void *p1, const void *p2)
5165 {
5166         const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5167         const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5168
5169         return isl_basic_map_fast_cmp(bmap1, bmap2);
5170 }
5171
5172 /* We normalize in place, but if anything goes wrong we need
5173  * to return NULL, so we need to make sure we don't change the
5174  * meaning of any possible other copies of map.
5175  */
5176 struct isl_map *isl_map_normalize(struct isl_map *map)
5177 {
5178         int i, j;
5179         struct isl_basic_map *bmap;
5180
5181         if (!map)
5182                 return NULL;
5183         if (F_ISSET(map, ISL_MAP_NORMALIZED))
5184                 return map;
5185         for (i = 0; i < map->n; ++i) {
5186                 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5187                 if (!bmap)
5188                         goto error;
5189                 isl_basic_map_free(map->p[i]);
5190                 map->p[i] = bmap;
5191         }
5192         qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5193         F_SET(map, ISL_MAP_NORMALIZED);
5194         map = isl_map_remove_empty_parts(map);
5195         if (!map)
5196                 return NULL;
5197         for (i = map->n - 1; i >= 1; --i) {
5198                 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5199                         continue;
5200                 isl_basic_map_free(map->p[i-1]);
5201                 for (j = i; j < map->n; ++j)
5202                         map->p[j-1] = map->p[j];
5203                 map->n--;
5204         }
5205         return map;
5206 error:
5207         isl_map_free(map);
5208         return NULL;
5209
5210 }
5211
5212 struct isl_set *isl_set_normalize(struct isl_set *set)
5213 {
5214         return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5215 }
5216
5217 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5218 {
5219         int i;
5220         int equal;
5221
5222         if (!map1 || !map2)
5223                 return -1;
5224
5225         if (map1 == map2)
5226                 return 1;
5227         if (!isl_dim_equal(map1->dim, map2->dim))
5228                 return 0;
5229
5230         map1 = isl_map_copy(map1);
5231         map2 = isl_map_copy(map2);
5232         map1 = isl_map_normalize(map1);
5233         map2 = isl_map_normalize(map2);
5234         if (!map1 || !map2)
5235                 goto error;
5236         equal = map1->n == map2->n;
5237         for (i = 0; equal && i < map1->n; ++i) {
5238                 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5239                 if (equal < 0)
5240                         goto error;
5241         }
5242         isl_map_free(map1);
5243         isl_map_free(map2);
5244         return equal;
5245 error:
5246         isl_map_free(map1);
5247         isl_map_free(map2);
5248         return -1;
5249 }
5250
5251 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5252 {
5253         return isl_map_fast_is_equal((struct isl_map *)set1,
5254                                                 (struct isl_map *)set2);
5255 }
5256
5257 /* Return an interval that ranges from min to max (inclusive)
5258  */
5259 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5260         isl_int min, isl_int max)
5261 {
5262         int k;
5263         struct isl_basic_set *bset = NULL;
5264
5265         bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5266         if (!bset)
5267                 goto error;
5268
5269         k = isl_basic_set_alloc_inequality(bset);
5270         if (k < 0)
5271                 goto error;
5272         isl_int_set_si(bset->ineq[k][1], 1);
5273         isl_int_neg(bset->ineq[k][0], min);
5274
5275         k = isl_basic_set_alloc_inequality(bset);
5276         if (k < 0)
5277                 goto error;
5278         isl_int_set_si(bset->ineq[k][1], -1);
5279         isl_int_set(bset->ineq[k][0], max);
5280
5281         return bset;
5282 error:
5283         isl_basic_set_free(bset);
5284         return NULL;
5285 }
5286
5287 /* Return the Cartesian product of the basic sets in list (in the given order).
5288  */
5289 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5290 {
5291         int i;
5292         unsigned dim;
5293         unsigned nparam;
5294         unsigned extra;
5295         unsigned n_eq;
5296         unsigned n_ineq;
5297         struct isl_basic_set *product = NULL;
5298
5299         if (!list)
5300                 goto error;
5301         isl_assert(list->ctx, list->n > 0, goto error);
5302         isl_assert(list->ctx, list->p[0], goto error);
5303         nparam = isl_basic_set_n_param(list->p[0]);
5304         dim = isl_basic_set_n_dim(list->p[0]);
5305         extra = list->p[0]->n_div;
5306         n_eq = list->p[0]->n_eq;
5307         n_ineq = list->p[0]->n_ineq;
5308         for (i = 1; i < list->n; ++i) {
5309                 isl_assert(list->ctx, list->p[i], goto error);
5310                 isl_assert(list->ctx,
5311                     nparam == isl_basic_set_n_param(list->p[i]), goto error);
5312                 dim += isl_basic_set_n_dim(list->p[i]);
5313                 extra += list->p[i]->n_div;
5314                 n_eq += list->p[i]->n_eq;
5315                 n_ineq += list->p[i]->n_ineq;
5316         }
5317         product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5318                                         n_eq, n_ineq);
5319         if (!product)
5320                 goto error;
5321         dim = 0;
5322         for (i = 0; i < list->n; ++i) {
5323                 set_add_constraints(product,
5324                                         isl_basic_set_copy(list->p[i]), dim);
5325                 dim += isl_basic_set_n_dim(list->p[i]);
5326         }
5327         isl_basic_set_list_free(list);
5328         return product;
5329 error:
5330         isl_basic_set_free(product);
5331         isl_basic_set_list_free(list);
5332         return NULL;
5333 }
5334
5335 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5336 {
5337         int i;
5338         uint32_t hash;
5339         unsigned total;
5340
5341         if (!bset)
5342                 return 0;
5343         bset = isl_basic_set_copy(bset);
5344         bset = isl_basic_set_normalize(bset);
5345         if (!bset)
5346                 return 0;
5347         total = isl_basic_set_total_dim(bset);
5348         isl_hash_byte(hash, bset->n_eq & 0xFF);
5349         for (i = 0; i < bset->n_eq; ++i) {
5350                 uint32_t c_hash;
5351                 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5352                 isl_hash_hash(hash, c_hash);
5353         }
5354         isl_hash_byte(hash, bset->n_ineq & 0xFF);
5355         for (i = 0; i < bset->n_ineq; ++i) {
5356                 uint32_t c_hash;
5357                 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5358                 isl_hash_hash(hash, c_hash);
5359         }
5360         isl_hash_byte(hash, bset->n_div & 0xFF);
5361         for (i = 0; i < bset->n_div; ++i) {
5362                 uint32_t c_hash;
5363                 if (isl_int_is_zero(bset->div[i][0]))
5364                         continue;
5365                 isl_hash_byte(hash, i & 0xFF);
5366                 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5367                 isl_hash_hash(hash, c_hash);
5368         }
5369         isl_basic_set_free(bset);
5370         return hash;
5371 }
5372
5373 uint32_t isl_set_get_hash(struct isl_set *set)
5374 {
5375         int i;
5376         uint32_t hash;
5377
5378         if (!set)
5379                 return 0;
5380         set = isl_set_copy(set);
5381         set = isl_set_normalize(set);
5382         if (!set)
5383                 return 0;
5384
5385         hash = isl_hash_init();
5386         for (i = 0; i < set->n; ++i) {
5387                 uint32_t bset_hash;
5388                 bset_hash = isl_basic_set_get_hash(set->p[i]);
5389                 isl_hash_hash(hash, bset_hash);
5390         }
5391
5392         isl_set_free(set);
5393
5394         return hash;
5395 }
5396
5397 /* Check if the value for dimension dim is completely determined
5398  * by the values of the other parameters and variables.
5399  * That is, check if dimension dim is involved in an equality.
5400  */
5401 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5402 {
5403         int i;
5404         unsigned nparam;
5405
5406         if (!bset)
5407                 return -1;
5408         nparam = isl_basic_set_n_param(bset);
5409         for (i = 0; i < bset->n_eq; ++i)
5410                 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5411                         return 1;
5412         return 0;
5413 }
5414
5415 /* Check if the value for dimension dim is completely determined
5416  * by the values of the other parameters and variables.
5417  * That is, check if dimension dim is involved in an equality
5418  * for each of the subsets.
5419  */
5420 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5421 {
5422         int i;
5423
5424         if (!set)
5425                 return -1;
5426         for (i = 0; i < set->n; ++i) {
5427                 int unique;
5428                 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
5429                 if (unique != 1)
5430                         return unique;
5431         }
5432         return 1;
5433 }