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