isl_map.c

   1 #include <string.h>
   2 #include <strings.h>
   3 #include "isl_ctx.h"
   4 #include "isl_blk.h"
   5 #include "isl_seq.h"
   6 #include "isl_set.h"
   7 #include "isl_map.h"
   8 #include "isl_map_private.h"
   9 #include "isl_map_piplib.h"
  10 #include "isl_sample.h"
  11 #include "isl_vec.h"
  12
  13 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
  14                 struct isl_basic_map *bmap,
  15                 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
  16                 unsigned n_eq, unsigned n_ineq)
  17 {
  18         int i;
  19         size_t row_size = 1 + nparam + n_in + n_out + extra;
  20
  21         bmap->block = isl_blk_alloc(ctx, (n_eq + n_ineq) * row_size);
  22         if (isl_blk_is_error(bmap->block)) {
  23                 free(bmap);
  24                 return NULL;
  25         }
  26
  27         bmap->eq = isl_alloc_array(ctx, isl_int *, n_eq + n_ineq);
  28         if (!bmap->eq) {
  29                 isl_blk_free(ctx, bmap->block);
  30                 free(bmap);
  31                 return NULL;
  32         }
  33
  34         if (extra == 0) {
  35                 bmap->block2 = isl_blk_empty();
  36                 bmap->div = NULL;
  37         } else {
  38                 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
  39                 if (isl_blk_is_error(bmap->block2)) {
  40                         free(bmap->eq);
  41                         isl_blk_free(ctx, bmap->block);
  42                         free(bmap);
  43                         return NULL;
  44                 }
  45
  46                 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
  47                 if (!bmap->div) {
  48                         isl_blk_free(ctx, bmap->block2);
  49                         free(bmap->eq);
  50                         isl_blk_free(ctx, bmap->block);
  51                         free(bmap);
  52                         return NULL;
  53                 }
  54         }
  55
  56         for (i = 0; i < n_eq + n_ineq; ++i)
  57                 bmap->eq[i] = bmap->block.data + i * row_size;
  58
  59         for (i = 0; i < extra; ++i)
  60                 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
  61
  62         bmap->ctx = ctx;
  63         isl_ctx_ref(ctx);
  64         bmap->ref = 1;
  65         bmap->flags = 0;
  66         bmap->c_size = n_eq + n_ineq;
  67         bmap->ineq = bmap->eq + n_eq;
  68         bmap->nparam = nparam;
  69         bmap->n_in = n_in;
  70         bmap->n_out = n_out;
  71         bmap->extra = extra;
  72         bmap->n_eq = 0;
  73         bmap->n_ineq = 0;
  74         bmap->n_div = 0;
  75         bmap->sample = NULL;
  76
  77         return bmap;
  78 }
  79
  80 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
  81                 unsigned nparam, unsigned dim, unsigned extra,
  82                 unsigned n_eq, unsigned n_ineq)
  83 {
  84         struct isl_basic_map *bmap;
  85         bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
  86         return (struct isl_basic_set *)bmap;
  87 }
  88
  89 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
  90                 unsigned nparam, unsigned in, unsigned out, unsigned extra,
  91                 unsigned n_eq, unsigned n_ineq)
  92 {
  93         struct isl_basic_map *bmap;
  94
  95         bmap = isl_alloc_type(ctx, struct isl_basic_map);
  96         if (!bmap)
  97                 return NULL;
  98
  99         return basic_map_init(ctx, bmap,
 100                                nparam, in, out, extra, n_eq, n_ineq);
 101 }
 102
 103 static void dup_constraints(
 104                 struct isl_basic_map *dst, struct isl_basic_map *src)
 105 {
 106         int i;
 107         unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
 108
 109         for (i = 0; i < src->n_eq; ++i) {
 110                 int j = isl_basic_map_alloc_equality(dst);
 111                 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
 112         }
 113
 114         for (i = 0; i < src->n_ineq; ++i) {
 115                 int j = isl_basic_map_alloc_inequality(dst);
 116                 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
 117         }
 118
 119         for (i = 0; i < src->n_div; ++i) {
 120                 int j = isl_basic_map_alloc_div(dst);
 121                 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
 122         }
 123         F_SET(dst, ISL_BASIC_SET_FINAL);
 124 }
 125
 126 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
 127 {
 128         struct isl_basic_map *dup;
 129
 130         if (!bmap)
 131                 return NULL;
 132         dup = isl_basic_map_alloc(bmap->ctx, bmap->nparam,
 133                         bmap->n_in, bmap->n_out,
 134                         bmap->n_div, bmap->n_eq, bmap->n_ineq);
 135         if (!dup)
 136                 return NULL;
 137         dup->flags = bmap->flags;
 138         dup_constraints(dup, bmap);
 139         dup->sample = isl_vec_copy(bmap->ctx, bmap->sample);
 140         return dup;
 141 }
 142
 143 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
 144 {
 145         struct isl_basic_map *dup;
 146
 147         dup = isl_basic_map_dup((struct isl_basic_map *)bset);
 148         return (struct isl_basic_set *)dup;
 149 }
 150
 151 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
 152 {
 153         if (!bset)
 154                 return NULL;
 155
 156         if (F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
 157                 bset->ref++;
 158                 return bset;
 159         }
 160         return isl_basic_set_dup(bset);
 161 }
 162
 163 struct isl_set *isl_set_copy(struct isl_set *set)
 164 {
 165         if (!set)
 166                 return NULL;
 167
 168         set->ref++;
 169         return set;
 170 }
 171
 172 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
 173 {
 174         if (!bmap)
 175                 return NULL;
 176
 177         if (F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
 178                 bmap->ref++;
 179                 return bmap;
 180         }
 181         return isl_basic_map_dup(bmap);
 182 }
 183
 184 struct isl_map *isl_map_copy(struct isl_map *map)
 185 {
 186         if (!map)
 187                 return NULL;
 188
 189         map->ref++;
 190         return map;
 191 }
 192
 193 void isl_basic_map_free(struct isl_basic_map *bmap)
 194 {
 195         if (!bmap)
 196                 return;
 197
 198         if (--bmap->ref > 0)
 199                 return;
 200
 201         isl_ctx_deref(bmap->ctx);
 202         free(bmap->div);
 203         isl_blk_free(bmap->ctx, bmap->block2);
 204         free(bmap->eq);
 205         isl_blk_free(bmap->ctx, bmap->block);
 206         isl_vec_free(bmap->ctx, bmap->sample);
 207         free(bmap);
 208 }
 209
 210 void isl_basic_set_free(struct isl_basic_set *bset)
 211 {
 212         isl_basic_map_free((struct isl_basic_map *)bset);
 213 }
 214
 215 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
 216 {
 217         struct isl_ctx *ctx;
 218         if (!bmap)
 219                 return -1;
 220         ctx = bmap->ctx;
 221         isl_assert(ctx, bmap->n_eq + bmap->n_ineq < bmap->c_size, return -1);
 222         isl_assert(ctx, bmap->eq + bmap->n_eq <= bmap->ineq, return -1);
 223         if (bmap->eq + bmap->n_eq == bmap->ineq) {
 224                 isl_int *t;
 225                 int j = isl_basic_map_alloc_inequality(bmap);
 226                 if (j < 0)
 227                         return -1;
 228                 t = bmap->ineq[0];
 229                 bmap->ineq[0] = bmap->ineq[j];
 230                 bmap->ineq[j] = t;
 231                 bmap->n_ineq--;
 232                 bmap->ineq++;
 233         }
 234         return bmap->n_eq++;
 235 }
 236
 237 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
 238 {
 239         return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
 240 }
 241
 242 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
 243 {
 244         if (!bmap)
 245                 return -1;
 246         isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
 247         bmap->n_eq -= n;
 248         return 0;
 249 }
 250
 251 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
 252 {
 253         isl_int *t;
 254         if (!bmap)
 255                 return -1;
 256         isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
 257
 258         if (pos != bmap->n_eq - 1) {
 259                 t = bmap->eq[pos];
 260                 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
 261                 bmap->eq[bmap->n_eq - 1] = t;
 262         }
 263         bmap->n_eq--;
 264         return 0;
 265 }
 266
 267 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
 268 {
 269         return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
 270 }
 271
 272 void isl_basic_map_inequality_to_equality(
 273                 struct isl_basic_map *bmap, unsigned pos)
 274 {
 275         isl_int *t;
 276
 277         t = bmap->ineq[pos];
 278         bmap->ineq[pos] = bmap->ineq[0];
 279         bmap->ineq[0] = bmap->eq[bmap->n_eq];
 280         bmap->eq[bmap->n_eq] = t;
 281         bmap->n_eq++;
 282         bmap->n_ineq--;
 283         bmap->ineq++;
 284 }
 285
 286 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
 287 {
 288         struct isl_ctx *ctx;
 289         if (!bmap)
 290                 return -1;
 291         ctx = bmap->ctx;
 292         isl_assert(ctx, (bmap->ineq - bmap->eq) + bmap->n_ineq < bmap->c_size,
 293                         return -1);
 294         F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
 295         F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
 296         return bmap->n_ineq++;
 297 }
 298
 299 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
 300 {
 301         return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
 302 }
 303
 304 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
 305 {
 306         if (!bmap)
 307                 return -1;
 308         isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
 309         bmap->n_ineq -= n;
 310         return 0;
 311 }
 312
 313 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
 314 {
 315         return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
 316 }
 317
 318 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
 319 {
 320         isl_int *t;
 321         if (!bmap)
 322                 return -1;
 323         isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
 324
 325         if (pos != bmap->n_ineq - 1) {
 326                 t = bmap->ineq[pos];
 327                 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
 328                 bmap->ineq[bmap->n_ineq - 1] = t;
 329         }
 330         bmap->n_ineq--;
 331         return 0;
 332 }
 333
 334 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
 335 {
 336         return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
 337 }
 338
 339 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
 340 {
 341         if (!bmap)
 342                 return -1;
 343         isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
 344         return bmap->n_div++;
 345 }
 346
 347 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
 348 {
 349         if (!bmap)
 350                 return -1;
 351         isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
 352         bmap->n_div -= n;
 353         return 0;
 354 }
 355
 356 /* Copy constraint from src to dst, putting the vars of src at offset
 357  * dim_off in dst and the divs of src at offset div_off in dst.
 358  * If both sets are actually map, then dim_off applies to the input
 359  * variables.
 360  */
 361 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
 362                             struct isl_basic_map *src_map, isl_int *src,
 363                             unsigned in_off, unsigned out_off, unsigned div_off)
 364 {
 365         isl_int_set(dst[0], src[0]);
 366         isl_seq_cpy(dst+1, src+1, isl_min(dst_map->nparam, src_map->nparam));
 367         if (dst_map->nparam > src_map->nparam)
 368                 isl_seq_clr(dst+1+src_map->nparam,
 369                                 dst_map->nparam - src_map->nparam);
 370         isl_seq_clr(dst+1+dst_map->nparam, in_off);
 371         isl_seq_cpy(dst+1+dst_map->nparam+in_off,
 372                     src+1+src_map->nparam,
 373                     isl_min(dst_map->n_in-in_off, src_map->n_in));
 374         if (dst_map->n_in-in_off > src_map->n_in)
 375                 isl_seq_clr(dst+1+dst_map->nparam+in_off+src_map->n_in,
 376                                 dst_map->n_in - in_off - src_map->n_in);
 377         isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in, out_off);
 378         isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+out_off,
 379                     src+1+src_map->nparam+src_map->n_in,
 380                     isl_min(dst_map->n_out-out_off, src_map->n_out));
 381         if (dst_map->n_out-out_off > src_map->n_out)
 382                 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+out_off+src_map->n_out,
 383                                 dst_map->n_out - out_off - src_map->n_out);
 384         isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out, div_off);
 385         isl_seq_cpy(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+div_off,
 386                     src+1+src_map->nparam+src_map->n_in+src_map->n_out,
 387                     isl_min(dst_map->extra-div_off, src_map->extra));
 388         if (dst_map->extra-div_off > src_map->extra)
 389                 isl_seq_clr(dst+1+dst_map->nparam+dst_map->n_in+dst_map->n_out+
 390                                 div_off+src_map->extra,
 391                                 dst_map->extra - div_off - src_map->extra);
 392 }
 393
 394 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
 395                      struct isl_basic_map *src_map, isl_int *src,
 396                      unsigned in_off, unsigned out_off, unsigned div_off)
 397 {
 398         isl_int_set(dst[0], src[0]);
 399         copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
 400 }
 401
 402 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
 403                 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
 404 {
 405         int i;
 406         unsigned div_off = bmap1->n_div;
 407
 408         for (i = 0; i < bmap2->n_eq; ++i) {
 409                 int i1 = isl_basic_map_alloc_equality(bmap1);
 410                 if (i1 < 0)
 411                         goto error;
 412                 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
 413                                 i_pos, o_pos, div_off);
 414         }
 415
 416         for (i = 0; i < bmap2->n_ineq; ++i) {
 417                 int i1 = isl_basic_map_alloc_inequality(bmap1);
 418                 if (i1 < 0)
 419                         goto error;
 420                 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
 421                                 i_pos, o_pos, div_off);
 422         }
 423
 424         for (i = 0; i < bmap2->n_div; ++i) {
 425                 int i1 = isl_basic_map_alloc_div(bmap1);
 426                 if (i1 < 0)
 427                         goto error;
 428                 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
 429                          i_pos, o_pos, div_off);
 430         }
 431
 432         isl_basic_map_free(bmap2);
 433
 434         return bmap1;
 435
 436 error:
 437         isl_basic_map_free(bmap1);
 438         isl_basic_map_free(bmap2);
 439         return NULL;
 440 }
 441
 442 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
 443                 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
 444                 unsigned n_eq, unsigned n_ineq)
 445 {
 446         struct isl_basic_map *ext;
 447         unsigned flags;
 448         int dims_ok;
 449
 450         base = isl_basic_map_cow(base);
 451         if (!base)
 452                 goto error;
 453
 454         dims_ok = base && base->nparam == nparam &&
 455                   base->n_in == n_in && base->n_out == n_out &&
 456                   base->extra >= base->n_div + extra;
 457
 458         if (dims_ok && n_eq == 0 && n_ineq == 0)
 459                 return base;
 460
 461         isl_assert(base->ctx, base->nparam <= nparam, goto error);
 462         isl_assert(base->ctx, base->n_in <= n_in, goto error);
 463         isl_assert(base->ctx, base->n_out <= n_out, goto error);
 464         extra += base->extra;
 465         n_eq += base->n_eq;
 466         n_ineq += base->n_ineq;
 467
 468         ext = isl_basic_map_alloc(base->ctx, nparam, n_in, n_out,
 469                                         extra, n_eq, n_ineq);
 470         if (!base)
 471                 return ext;
 472         if (!ext)
 473                 goto error;
 474
 475         flags = base->flags;
 476         ext = add_constraints(ext, base, 0, 0);
 477         if (ext) {
 478                 ext->flags = flags;
 479                 F_CLR(ext, ISL_BASIC_SET_FINAL);
 480         }
 481
 482         return ext;
 483
 484 error:
 485         isl_basic_map_free(base);
 486         return NULL;
 487 }
 488
 489 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
 490                 unsigned nparam, unsigned dim, unsigned extra,
 491                 unsigned n_eq, unsigned n_ineq)
 492 {
 493         return (struct isl_basic_set *)
 494                 isl_basic_map_extend((struct isl_basic_map *)base,
 495                                         nparam, 0, dim, extra, n_eq, n_ineq);
 496 }
 497
 498 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
 499 {
 500         return (struct isl_basic_set *)
 501                 isl_basic_map_cow((struct isl_basic_map *)bset);
 502 }
 503
 504 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
 505 {
 506         if (!bmap)
 507                 return NULL;
 508
 509         if (bmap->ref > 1) {
 510                 bmap->ref--;
 511                 bmap = isl_basic_map_dup(bmap);
 512         }
 513         F_CLR(bmap, ISL_BASIC_SET_FINAL);
 514         return bmap;
 515 }
 516
 517 struct isl_set *isl_set_cow(struct isl_set *set)
 518 {
 519         if (!set)
 520                 return NULL;
 521
 522         if (set->ref == 1)
 523                 return set;
 524         set->ref--;
 525         return isl_set_dup(set);
 526 }
 527
 528 struct isl_map *isl_map_cow(struct isl_map *map)
 529 {
 530         if (!map)
 531                 return NULL;
 532
 533         if (map->ref == 1)
 534                 return map;
 535         map->ref--;
 536         return isl_map_dup(map);
 537 }
 538
 539 static void swap_vars(struct isl_blk blk, isl_int *a,
 540                         unsigned a_len, unsigned b_len)
 541 {
 542         isl_seq_cpy(blk.data, a+a_len, b_len);
 543         isl_seq_cpy(blk.data+b_len, a, a_len);
 544         isl_seq_cpy(a, blk.data, b_len+a_len);
 545 }
 546
 547 struct isl_basic_set *isl_basic_set_swap_vars(
 548                 struct isl_basic_set *bset, unsigned n)
 549 {
 550         int i;
 551         struct isl_blk blk;
 552
 553         if (!bset)
 554                 goto error;
 555
 556         isl_assert(bset->ctx, n <= bset->dim, goto error);
 557
 558         if (n == bset->dim)
 559                 return bset;
 560
 561         bset = isl_basic_set_cow(bset);
 562         if (!bset)
 563                 return NULL;
 564
 565         blk = isl_blk_alloc(bset->ctx, bset->dim);
 566         if (isl_blk_is_error(blk))
 567                 goto error;
 568
 569         for (i = 0; i < bset->n_eq; ++i)
 570                 swap_vars(blk,
 571                           bset->eq[i]+1+bset->nparam, n, bset->dim - n);
 572
 573         for (i = 0; i < bset->n_ineq; ++i)
 574                 swap_vars(blk,
 575                           bset->ineq[i]+1+bset->nparam, n, bset->dim - n);
 576
 577         for (i = 0; i < bset->n_div; ++i)
 578                 swap_vars(blk,
 579                           bset->div[i]+1+1+bset->nparam, n, bset->dim - n);
 580
 581         isl_blk_free(bset->ctx, blk);
 582
 583         return bset;
 584
 585 error:
 586         isl_basic_set_free(bset);
 587         return NULL;
 588 }
 589
 590 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
 591 {
 592         int i;
 593         set = isl_set_cow(set);
 594         if (!set)
 595                 return NULL;
 596
 597         for (i = 0; i < set->n; ++i) {
 598                 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
 599                 if (!set->p[i]) {
 600                         isl_set_free(set);
 601                         return NULL;
 602                 }
 603         }
 604         return set;
 605 }
 606
 607 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
 608 {
 609         isl_seq_cpy(c, c + n, rem);
 610         isl_seq_clr(c + rem, n);
 611 }
 612
 613 struct isl_basic_set *isl_basic_set_drop_vars(
 614                 struct isl_basic_set *bset, unsigned first, unsigned n)
 615 {
 616         int i;
 617
 618         if (!bset)
 619                 goto error;
 620
 621         isl_assert(bset->ctx, first + n <= bset->dim, goto error);
 622
 623         if (n == 0)
 624                 return bset;
 625
 626         bset = isl_basic_set_cow(bset);
 627         if (!bset)
 628                 return NULL;
 629
 630         for (i = 0; i < bset->n_eq; ++i)
 631                 constraint_drop_vars(bset->eq[i]+1+bset->nparam+first, n,
 632                                      (bset->dim-first-n)+bset->extra);
 633
 634         for (i = 0; i < bset->n_ineq; ++i)
 635                 constraint_drop_vars(bset->ineq[i]+1+bset->nparam+first, n,
 636                                      (bset->dim-first-n)+bset->extra);
 637
 638         for (i = 0; i < bset->n_div; ++i)
 639                 constraint_drop_vars(bset->div[i]+1+1+bset->nparam+first, n,
 640                                      (bset->dim-first-n)+bset->extra);
 641
 642         bset->dim -= n;
 643         bset->extra += n;
 644
 645         return isl_basic_set_finalize(bset);
 646 error:
 647         isl_basic_set_free(bset);
 648         return NULL;
 649 }
 650
 651 struct isl_set *isl_set_drop_vars(
 652                 struct isl_set *set, unsigned first, unsigned n)
 653 {
 654         int i;
 655
 656         if (!set)
 657                 goto error;
 658
 659         isl_assert(set->ctx, first + n <= set->dim, goto error);
 660
 661         if (n == 0)
 662                 return set;
 663         set = isl_set_cow(set);
 664         if (!set)
 665                 goto error;
 666
 667         for (i = 0; i < set->n; ++i) {
 668                 set->p[i] = isl_basic_set_drop_vars(set->p[i], first, n);
 669                 if (!set->p[i])
 670                         goto error;
 671         }
 672         set->dim -= n;
 673
 674         return set;
 675 error:
 676         isl_set_free(set);
 677         return NULL;
 678 }
 679
 680 /*
 681  * We don't cow, as the div is assumed to be redundant.
 682  */
 683 static struct isl_basic_map *isl_basic_map_drop_div(
 684                 struct isl_basic_map *bmap, unsigned div)
 685 {
 686         int i;
 687         unsigned pos;
 688
 689         if (!bmap)
 690                 goto error;
 691
 692         pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
 693
 694         isl_assert(bmap->ctx, div < bmap->n_div, goto error);
 695
 696         for (i = 0; i < bmap->n_eq; ++i)
 697                 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
 698
 699         for (i = 0; i < bmap->n_ineq; ++i) {
 700                 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
 701                         isl_basic_map_drop_inequality(bmap, i);
 702                         --i;
 703                         continue;
 704                 }
 705                 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
 706         }
 707
 708         for (i = 0; i < bmap->n_div; ++i)
 709                 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
 710
 711         if (div != bmap->n_div - 1) {
 712                 int j;
 713                 isl_int *t = bmap->div[div];
 714
 715                 for (j = div; j < bmap->n_div - 1; ++j)
 716                         bmap->div[j] = bmap->div[j+1];
 717
 718                 bmap->div[bmap->n_div - 1] = t;
 719         }
 720         isl_basic_map_free_div(bmap, 1);
 721
 722         return bmap;
 723 error:
 724         isl_basic_map_free(bmap);
 725         return NULL;
 726 }
 727
 728 static void eliminate_div(struct isl_basic_map *bmap, isl_int *eq, unsigned div)
 729 {
 730         int i;
 731         unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
 732         unsigned len;
 733         len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
 734
 735         for (i = 0; i < bmap->n_eq; ++i)
 736                 if (bmap->eq[i] != eq)
 737                         isl_seq_elim(bmap->eq[i], eq, pos, len, NULL);
 738
 739         for (i = 0; i < bmap->n_ineq; ++i)
 740                 isl_seq_elim(bmap->ineq[i], eq, pos, len, NULL);
 741
 742         /* We need to be careful about circular definitions,
 743          * so for now we just remove the definitions of other divs that
 744          * depend on this div and (possibly) recompute them later.
 745          */
 746         for (i = 0; i < bmap->n_div; ++i)
 747                 if (!isl_int_is_zero(bmap->div[i][0]) &&
 748                     !isl_int_is_zero(bmap->div[i][1 + pos]))
 749                         isl_seq_clr(bmap->div[i], 1 + len);
 750
 751         isl_basic_map_drop_div(bmap, div);
 752 }
 753
 754 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
 755 {
 756         int i = 0;
 757         unsigned total;
 758         if (!bmap)
 759                 goto error;
 760         total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
 761         isl_basic_map_free_div(bmap, bmap->n_div);
 762         isl_basic_map_free_inequality(bmap, bmap->n_ineq);
 763         if (bmap->n_eq > 0)
 764                 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
 765         else {
 766                 isl_basic_map_alloc_equality(bmap);
 767                 if (i < 0)
 768                         goto error;
 769         }
 770         isl_int_set_si(bmap->eq[i][0], 1);
 771         isl_seq_clr(bmap->eq[i]+1, total);
 772         F_SET(bmap, ISL_BASIC_MAP_EMPTY);
 773         return isl_basic_map_finalize(bmap);
 774 error:
 775         isl_basic_map_free(bmap);
 776         return NULL;
 777 }
 778
 779 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
 780 {
 781         return (struct isl_basic_set *)
 782                 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
 783 }
 784
 785 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
 786 {
 787         isl_int *t = bmap->eq[a];
 788         bmap->eq[a] = bmap->eq[b];
 789         bmap->eq[b] = t;
 790 }
 791
 792 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
 793 {
 794         isl_int *t = bmap->ineq[a];
 795         bmap->ineq[a] = bmap->ineq[b];
 796         bmap->ineq[b] = t;
 797 }
 798
 799 static void swap_div(struct isl_basic_map *bmap, int a, int b)
 800 {
 801         int i;
 802         unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
 803         isl_int *t = bmap->div[a];
 804         bmap->div[a] = bmap->div[b];
 805         bmap->div[b] = t;
 806
 807         for (i = 0; i < bmap->n_eq; ++i)
 808                 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
 809
 810         for (i = 0; i < bmap->n_ineq; ++i)
 811                 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
 812
 813         for (i = 0; i < bmap->n_div; ++i)
 814                 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
 815 }
 816
 817 struct isl_basic_map *isl_basic_map_gauss(
 818         struct isl_basic_map *bmap, int *progress)
 819 {
 820         int k;
 821         int done;
 822         int last_var;
 823         unsigned total_var;
 824         unsigned total;
 825
 826         if (!bmap)
 827                 return NULL;
 828
 829         total_var = bmap->nparam + bmap->n_in + bmap->n_out;
 830         total = total_var + bmap->n_div;
 831
 832         last_var = total - 1;
 833         for (done = 0; done < bmap->n_eq; ++done) {
 834                 for (; last_var >= 0; --last_var) {
 835                         for (k = done; k < bmap->n_eq; ++k)
 836                                 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
 837                                         break;
 838                         if (k < bmap->n_eq)
 839                                 break;
 840                 }
 841                 if (last_var < 0)
 842                         break;
 843                 if (k != done)
 844                         swap_equality(bmap, k, done);
 845                 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
 846                         isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
 847
 848                 for (k = 0; k < bmap->n_eq; ++k) {
 849                         if (k == done)
 850                                 continue;
 851                         if (isl_int_is_zero(bmap->eq[k][1+last_var]))
 852                                 continue;
 853                         if (progress)
 854                                 *progress = 1;
 855                         isl_seq_elim(bmap->eq[k], bmap->eq[done],
 856                                         1+last_var, 1+total, NULL);
 857                 }
 858
 859                 for (k = 0; k < bmap->n_ineq; ++k) {
 860                         if (isl_int_is_zero(bmap->ineq[k][1+last_var]))
 861                                 continue;
 862                         if (progress)
 863                                 *progress = 1;
 864                         isl_seq_elim(bmap->ineq[k], bmap->eq[done],
 865                                         1+last_var, 1+total, NULL);
 866                 }
 867
 868                 for (k = 0; k < bmap->n_div; ++k) {
 869                         if (isl_int_is_zero(bmap->div[k][0]))
 870                                 continue;
 871                         if (isl_int_is_zero(bmap->div[k][1+1+last_var]))
 872                                 continue;
 873                         if (progress)
 874                                 *progress = 1;
 875                         isl_seq_elim(bmap->div[k]+1, bmap->eq[done],
 876                                         1+last_var, 1+total, &bmap->div[k][0]);
 877                 }
 878
 879                 if (last_var >= total_var &&
 880                     isl_int_is_zero(bmap->div[last_var - total_var][0])) {
 881                         unsigned div = last_var - total_var;
 882                         isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
 883                         isl_int_set_si(bmap->div[div][1+1+last_var], 0);
 884                         isl_int_set(bmap->div[div][0],
 885                                     bmap->eq[done][1+last_var]);
 886                 }
 887         }
 888         if (done == bmap->n_eq)
 889                 return bmap;
 890         for (k = done; k < bmap->n_eq; ++k) {
 891                 if (isl_int_is_zero(bmap->eq[k][0]))
 892                         continue;
 893                 return isl_basic_map_set_to_empty(bmap);
 894         }
 895         isl_basic_map_free_equality(bmap, bmap->n_eq-done);
 896         return bmap;
 897 }
 898
 899 struct isl_basic_set *isl_basic_set_gauss(
 900         struct isl_basic_set *bset, int *progress)
 901 {
 902         return (struct isl_basic_set*)isl_basic_map_gauss(
 903                         (struct isl_basic_map *)bset, progress);
 904 }
 905
 906 static unsigned int round_up(unsigned int v)
 907 {
 908         int old_v = v;
 909
 910         while (v) {
 911                 old_v = v;
 912                 v ^= v & -v;
 913         }
 914         return old_v << 1;
 915 }
 916
 917 static int hash_index(int *index, unsigned int size, int bits,
 918                         struct isl_basic_map *bmap, int k)
 919 {
 920         int h;
 921         unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
 922         u_int32_t hash = isl_seq_hash(bmap->ineq[k]+1, total, bits);
 923         for (h = hash; index[h]; h = (h+1) % size)
 924                 if (k != index[h]-1 &&
 925                     isl_seq_eq(bmap->ineq[k]+1,
 926                                bmap->ineq[index[h]-1]+1, total))
 927                         break;
 928         return h;
 929 }
 930
 931 static struct isl_basic_map *remove_duplicate_constraints(
 932         struct isl_basic_map *bmap, int *progress)
 933 {
 934         unsigned int size;
 935         int *index;
 936         int k, l, h;
 937         int bits;
 938         unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
 939         isl_int sum;
 940
 941         if (bmap->n_ineq <= 1)
 942                 return bmap;
 943
 944         size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
 945         bits = ffs(size) - 1;
 946         index = isl_alloc_array(ctx, int, size);
 947         memset(index, 0, size * sizeof(int));
 948         if (!index)
 949                 return bmap;
 950
 951         index[isl_seq_hash(bmap->ineq[0]+1, total, bits)] = 1;
 952         for (k = 1; k < bmap->n_ineq; ++k) {
 953                 h = hash_index(index, size, bits, bmap, k);
 954                 if (!index[h]) {
 955                         index[h] = k+1;
 956                         continue;
 957                 }
 958                 *progress = 1;
 959                 l = index[h] - 1;
 960                 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
 961                         swap_inequality(bmap, k, l);
 962                 isl_basic_map_drop_inequality(bmap, k);
 963                 --k;
 964         }
 965         isl_int_init(sum);
 966         for (k = 0; k < bmap->n_ineq-1; ++k) {
 967                 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
 968                 h = hash_index(index, size, bits, bmap, k);
 969                 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
 970                 if (!index[h])
 971                         continue;
 972                 l = index[h] - 1;
 973                 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
 974                 if (isl_int_is_pos(sum))
 975                         continue;
 976                 if (isl_int_is_zero(sum)) {
 977                         /* We need to break out of the loop after these
 978                          * changes since the contents of the hash
 979                          * will no longer be valid.
 980                          * Plus, we probably we want to regauss first.
 981                          */
 982                         isl_basic_map_drop_inequality(bmap, l);
 983                         isl_basic_map_inequality_to_equality(bmap, k);
 984                 } else
 985                         bmap = isl_basic_map_set_to_empty(bmap);
 986                 break;
 987         }
 988         isl_int_clear(sum);
 989
 990         free(index);
 991         return bmap;
 992 }
 993
 994 static struct isl_basic_map *remove_duplicate_divs(
 995         struct isl_basic_map *bmap, int *progress)
 996 {
 997         unsigned int size;
 998         int *index;
 999         int k, l, h;
1000         int bits;
1001         struct isl_blk eq;
1002         unsigned total_var = bmap->nparam + bmap->n_in + bmap->n_out;
1003         unsigned total = total_var + bmap->n_div;
1004         struct isl_ctx *ctx;
1005
1006         if (bmap->n_div <= 1)
1007                 return bmap;
1008
1009         ctx = bmap->ctx;
1010         for (k = bmap->n_div - 1; k >= 0; --k)
1011                 if (!isl_int_is_zero(bmap->div[k][0]))
1012                         break;
1013         if (k <= 0)
1014                 return bmap;
1015
1016         size = round_up(4 * bmap->n_div / 3 - 1);
1017         bits = ffs(size) - 1;
1018         index = isl_alloc_array(ctx, int, size);
1019         memset(index, 0, size * sizeof(int));
1020         if (!index)
1021                 return bmap;
1022         eq = isl_blk_alloc(ctx, 1+total);
1023         if (isl_blk_is_error(eq))
1024                 goto out;
1025
1026         isl_seq_clr(eq.data, 1+total);
1027         index[isl_seq_hash(bmap->div[k], 2+total, bits)] = k + 1;
1028         for (--k; k >= 0; --k) {
1029                 u_int32_t hash;
1030
1031                 if (isl_int_is_zero(bmap->div[k][0]))
1032                         continue;
1033
1034                 hash = isl_seq_hash(bmap->div[k], 2+total, bits);
1035                 for (h = hash; index[h]; h = (h+1) % size)
1036                         if (isl_seq_eq(bmap->div[k],
1037                                        bmap->div[index[h]-1], 2+total))
1038                                 break;
1039                 if (index[h]) {
1040                         *progress = 1;
1041                         l = index[h] - 1;
1042                         isl_int_set_si(eq.data[1+total_var+k], -1);
1043                         isl_int_set_si(eq.data[1+total_var+l], 1);
1044                         eliminate_div(bmap, eq.data, l);
1045                         isl_int_set_si(eq.data[1+total_var+k], 0);
1046                         isl_int_set_si(eq.data[1+total_var+l], 0);
1047                 }
1048                 index[h] = k+1;
1049         }
1050
1051         isl_blk_free(ctx, eq);
1052 out:
1053         free(index);
1054         return bmap;
1055 }
1056
1057 /* Elimininate divs based on equalities
1058  */
1059 static struct isl_basic_map *eliminate_divs_eq(
1060                 struct isl_basic_map *bmap, int *progress)
1061 {
1062         int d;
1063         int i;
1064         int modified = 0;
1065         unsigned off;
1066
1067         if (!bmap)
1068                 return NULL;
1069
1070         off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1071
1072         for (d = bmap->n_div - 1; d >= 0 ; --d) {
1073                 for (i = 0; i < bmap->n_eq; ++i) {
1074                         if (!isl_int_is_one(bmap->eq[i][off + d]) &&
1075                             !isl_int_is_negone(bmap->eq[i][off + d]))
1076                                 continue;
1077                         modified = 1;
1078                         *progress = 1;
1079                         eliminate_div(bmap, bmap->eq[i], d);
1080                         isl_basic_map_drop_equality(bmap, i);
1081                         break;
1082                 }
1083         }
1084         if (modified)
1085                 return eliminate_divs_eq(bmap, progress);
1086         return bmap;
1087 }
1088
1089 static struct isl_basic_map *normalize_constraints(struct isl_basic_map *bmap)
1090 {
1091         int i;
1092         isl_int gcd;
1093         unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1094
1095         isl_int_init(gcd);
1096         for (i = bmap->n_eq - 1; i >= 0; --i) {
1097                 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
1098                 if (isl_int_is_zero(gcd)) {
1099                         if (!isl_int_is_zero(bmap->eq[i][0])) {
1100                                 bmap = isl_basic_map_set_to_empty(bmap);
1101                                 break;
1102                         }
1103                         isl_basic_map_drop_equality(bmap, i);
1104                         continue;
1105                 }
1106                 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1107                         isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
1108                 if (isl_int_is_one(gcd))
1109                         continue;
1110                 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
1111                         bmap = isl_basic_map_set_to_empty(bmap);
1112                         break;
1113                 }
1114                 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
1115         }
1116
1117         for (i = bmap->n_ineq - 1; i >= 0; --i) {
1118                 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
1119                 if (isl_int_is_zero(gcd)) {
1120                         if (isl_int_is_neg(bmap->ineq[i][0])) {
1121                                 bmap = isl_basic_map_set_to_empty(bmap);
1122                                 break;
1123                         }
1124                         isl_basic_map_drop_inequality(bmap, i);
1125                         continue;
1126                 }
1127                 if (F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
1128                         isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
1129                 if (isl_int_is_one(gcd))
1130                         continue;
1131                 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
1132                 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
1133         }
1134         isl_int_clear(gcd);
1135
1136         return bmap;
1137 }
1138
1139
1140 /* Eliminate the specified variables from the constraints using
1141  * Fourier-Motzkin.  The variables themselves are not removed.
1142  */
1143 struct isl_basic_map *isl_basic_map_eliminate_vars(
1144         struct isl_basic_map *bmap, int pos, unsigned n)
1145 {
1146         int d;
1147         int i, j, k;
1148         unsigned total;
1149         unsigned extra;
1150
1151         if (!bmap)
1152                 return NULL;
1153         total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1154         extra = bmap->extra - bmap->n_div;
1155
1156         bmap = isl_basic_map_cow(bmap);
1157         bmap = isl_basic_map_gauss(bmap, NULL);
1158         for (d = pos + n - 1; d >= pos; --d) {
1159                 int n_lower, n_upper;
1160                 if (!bmap)
1161                         return NULL;
1162                 for (i = 0; i < bmap->n_eq; ++i) {
1163                         if (isl_int_is_zero(bmap->eq[i][1+d]))
1164                                 continue;
1165                         isl_basic_map_drop_equality(bmap, i);
1166                         break;
1167                 }
1168                 if (i < bmap->n_eq)
1169                         continue;
1170                 n_lower = 0;
1171                 n_upper = 0;
1172                 for (i = 0; i < bmap->n_ineq; ++i) {
1173                         if (isl_int_is_pos(bmap->ineq[i][1+d]))
1174                                 n_lower++;
1175                         else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1176                                 n_upper++;
1177                 }
1178                 bmap = isl_basic_map_extend(bmap,
1179                                 bmap->nparam, bmap->n_in, bmap->n_out, 0,
1180                                 0, n_lower * n_upper);
1181                 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1182                         int last;
1183                         if (isl_int_is_zero(bmap->ineq[i][1+d]))
1184                                 continue;
1185                         last = -1;
1186                         for (j = 0; j < i; ++j) {
1187                                 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1188                                         continue;
1189                                 last = j;
1190                                 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1191                                     isl_int_sgn(bmap->ineq[j][1+d]))
1192                                         continue;
1193                                 k = isl_basic_map_alloc_inequality(bmap);
1194                                 if (k < 0)
1195                                         goto error;
1196                                 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1197                                                 1+total);
1198                                 isl_seq_clr(bmap->ineq[k]+1+total, extra);
1199                                 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1200                                                 1+d, 1+total, NULL);
1201                         }
1202                         isl_basic_map_drop_inequality(bmap, i);
1203                         i = last + 1;
1204                 }
1205                 if (n_lower > 0 && n_upper > 0) {
1206                         bmap = normalize_constraints(bmap);
1207                         bmap = isl_basic_map_gauss(bmap, NULL);
1208                         if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1209                                 break;
1210                 }
1211         }
1212         return bmap;
1213 error:
1214         isl_basic_map_free(bmap);
1215         return NULL;
1216 }
1217
1218 struct isl_basic_set *isl_basic_set_eliminate_vars(
1219         struct isl_basic_set *bset, unsigned pos, unsigned n)
1220 {
1221         return (struct isl_basic_set *)isl_basic_map_eliminate_vars(
1222                         (struct isl_basic_map *)bset, pos, n);
1223 }
1224
1225 /* Elimininate divs based on inequalities
1226  */
1227 static struct isl_basic_map *eliminate_divs_ineq(
1228                 struct isl_basic_map *bmap, int *progress)
1229 {
1230         int d;
1231         int i;
1232         unsigned off;
1233         struct isl_ctx *ctx;
1234
1235         if (!bmap)
1236                 return NULL;
1237
1238         ctx = bmap->ctx;
1239         off = 1 + bmap->nparam + bmap->n_in + bmap->n_out;
1240
1241         for (d = bmap->n_div - 1; d >= 0 ; --d) {
1242                 for (i = 0; i < bmap->n_eq; ++i)
1243                         if (!isl_int_is_zero(bmap->eq[i][off + d]))
1244                                 break;
1245                 if (i < bmap->n_eq)
1246                         continue;
1247                 for (i = 0; i < bmap->n_ineq; ++i)
1248                         if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
1249                                 break;
1250                 if (i < bmap->n_ineq)
1251                         continue;
1252                 *progress = 1;
1253                 bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1);
1254                 if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1255                         break;
1256                 bmap = isl_basic_map_drop_div(bmap, d);
1257                 if (!bmap)
1258                         break;
1259         }
1260         return bmap;
1261 }
1262
1263 struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap)
1264 {
1265         int progress = 1;
1266         if (!bmap)
1267                 return NULL;
1268         while (progress) {
1269                 progress = 0;
1270                 bmap = normalize_constraints(bmap);
1271                 bmap = eliminate_divs_eq(bmap, &progress);
1272                 bmap = eliminate_divs_ineq(bmap, &progress);
1273                 bmap = isl_basic_map_gauss(bmap, &progress);
1274                 bmap = remove_duplicate_divs(bmap, &progress);
1275                 bmap = remove_duplicate_constraints(bmap, &progress);
1276         }
1277         return bmap;
1278 }
1279
1280 struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset)
1281 {
1282         return (struct isl_basic_set *)
1283                 isl_basic_map_simplify((struct isl_basic_map *)bset);
1284 }
1285
1286 static void dump_term(struct isl_basic_map *bmap,
1287                         isl_int c, int pos, FILE *out)
1288 {
1289         unsigned in = bmap->n_in;
1290         unsigned dim = bmap->n_in + bmap->n_out;
1291         if (!pos)
1292                 isl_int_print(out, c);
1293         else {
1294                 if (!isl_int_is_one(c))
1295                         isl_int_print(out, c);
1296                 if (pos < 1 + bmap->nparam)
1297                         fprintf(out, "p%d", pos - 1);
1298                 else if (pos < 1 + bmap->nparam + in)
1299                         fprintf(out, "i%d", pos - 1 - bmap->nparam);
1300                 else if (pos < 1 + bmap->nparam + dim)
1301                         fprintf(out, "o%d", pos - 1 - bmap->nparam - in);
1302                 else
1303                         fprintf(out, "e%d", pos - 1 - bmap->nparam - dim);
1304         }
1305 }
1306
1307 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1308                                 int sign, FILE *out)
1309 {
1310         int i;
1311         int first;
1312         unsigned len = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1313         isl_int v;
1314
1315         isl_int_init(v);
1316         for (i = 0, first = 1; i < len; ++i) {
1317                 if (isl_int_sgn(c[i]) * sign <= 0)
1318                         continue;
1319                 if (!first)
1320                         fprintf(out, " + ");
1321                 first = 0;
1322                 isl_int_abs(v, c[i]);
1323                 dump_term(bmap, v, i, out);
1324         }
1325         isl_int_clear(v);
1326         if (first)
1327                 fprintf(out, "0");
1328 }
1329
1330 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1331                                 const char *op, FILE *out, int indent)
1332 {
1333         int i;
1334
1335         fprintf(out, "%*s", indent, "");
1336
1337         dump_constraint_sign(bmap, c, 1, out);
1338         fprintf(out, " %s ", op);
1339         dump_constraint_sign(bmap, c, -1, out);
1340
1341         fprintf(out, "\n");
1342
1343         for (i = bmap->n_div; i < bmap->extra; ++i) {
1344                 if (isl_int_is_zero(c[1+bmap->nparam+bmap->n_in+bmap->n_out+i]))
1345                         continue;
1346                 fprintf(out, "%*s", indent, "");
1347                 fprintf(out, "ERROR: unused div coefficient not zero\n");
1348         }
1349 }
1350
1351 static void dump_constraints(struct isl_basic_map *bmap,
1352                                 isl_int **c, unsigned n,
1353                                 const char *op, FILE *out, int indent)
1354 {
1355         int i;
1356
1357         for (i = 0; i < n; ++i)
1358                 dump_constraint(bmap, c[i], op, out, indent);
1359 }
1360
1361 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1362 {
1363         int j;
1364         int first = 1;
1365         unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1366
1367         for (j = 0; j < 1 + total; ++j) {
1368                 if (isl_int_is_zero(exp[j]))
1369                         continue;
1370                 if (!first && isl_int_is_pos(exp[j]))
1371                         fprintf(out, "+");
1372                 dump_term(bmap, exp[j], j, out);
1373                 first = 0;
1374         }
1375 }
1376
1377 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1378 {
1379         int i;
1380
1381         dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1382         dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1383
1384         for (i = 0; i < bmap->n_div; ++i) {
1385                 fprintf(out, "%*s", indent, "");
1386                 fprintf(out, "e%d = [(", i);
1387                 dump_affine(bmap, bmap->div[i]+1, out);
1388                 fprintf(out, ")/");
1389                 isl_int_print(out, bmap->div[i][0]);
1390                 fprintf(out, "]\n");
1391         }
1392 }
1393
1394 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1395 {
1396         if (!bset) {
1397                 fprintf(out, "null basic set\n");
1398                 return;
1399         }
1400
1401         fprintf(out, "%*s", indent, "");
1402         fprintf(out, "nparam: %d, dim: %d, extra: %d\n",
1403                         bset->nparam, bset->dim, bset->extra);
1404         dump((struct isl_basic_map *)bset, out, indent);
1405 }
1406
1407 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1408 {
1409         if (!bmap) {
1410                 fprintf(out, "null basic map\n");
1411                 return;
1412         }
1413
1414         fprintf(out, "%*s", indent, "");
1415         fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, flags: %x\n",
1416                 bmap->ref,
1417                 bmap->nparam, bmap->n_in, bmap->n_out, bmap->extra, bmap->flags);
1418         dump(bmap, out, indent);
1419 }
1420
1421 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1422 {
1423         unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
1424         if (!bmap)
1425                 return -1;
1426         isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1427         isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1428         isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1429         return 0;
1430 }
1431
1432 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1433                 unsigned nparam, unsigned dim, int n, unsigned flags)
1434 {
1435         struct isl_set *set;
1436
1437         set = isl_alloc(ctx, struct isl_set,
1438                         sizeof(struct isl_set) +
1439                         n * sizeof(struct isl_basic_set *));
1440         if (!set)
1441                 return NULL;
1442
1443         set->ctx = ctx;
1444         isl_ctx_ref(ctx);
1445         set->ref = 1;
1446         set->size = n;
1447         set->n = 0;
1448         set->nparam = nparam;
1449         set->zero = 0;
1450         set->dim = dim;
1451         set->flags = flags;
1452         return set;
1453 }
1454
1455 struct isl_set *isl_set_dup(struct isl_set *set)
1456 {
1457         int i;
1458         struct isl_set *dup;
1459
1460         if (!set)
1461                 return NULL;
1462
1463         dup = isl_set_alloc(set->ctx, set->nparam, set->dim, set->n, set->flags);
1464         if (!dup)
1465                 return NULL;
1466         for (i = 0; i < set->n; ++i)
1467                 dup = isl_set_add(dup,
1468                                   isl_basic_set_dup(set->p[i]));
1469         return dup;
1470 }
1471
1472 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1473 {
1474         struct isl_set *set;
1475
1476         if (!bset)
1477                 return NULL;
1478
1479         set = isl_set_alloc(bset->ctx, bset->nparam, bset->dim, 1, ISL_MAP_DISJOINT);
1480         if (!set) {
1481                 isl_basic_set_free(bset);
1482                 return NULL;
1483         }
1484         return isl_set_add(set, bset);
1485 }
1486
1487 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1488 {
1489         struct isl_map *map;
1490
1491         if (!bmap)
1492                 return NULL;
1493
1494         map = isl_map_alloc(bmap->ctx, bmap->nparam, bmap->n_in, bmap->n_out, 1,
1495                                 ISL_MAP_DISJOINT);
1496         if (!map) {
1497                 isl_basic_map_free(bmap);
1498                 return NULL;
1499         }
1500         return isl_map_add(map, bmap);
1501 }
1502
1503 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1504 {
1505         if (!bset || !set)
1506                 goto error;
1507         isl_assert(set->ctx, set->nparam == bset->nparam, goto error);
1508         isl_assert(set->ctx, set->dim == bset->dim, goto error);
1509         isl_assert(set->ctx, set->n < set->size, goto error);
1510         set->p[set->n] = bset;
1511         set->n++;
1512         return set;
1513 error:
1514         if (set)
1515                 isl_set_free(set);
1516         if (bset)
1517                 isl_basic_set_free(bset);
1518         return NULL;
1519 }
1520
1521 void isl_set_free(struct isl_set *set)
1522 {
1523         int i;
1524
1525         if (!set)
1526                 return;
1527
1528         if (--set->ref > 0)
1529                 return;
1530
1531         isl_ctx_deref(set->ctx);
1532         for (i = 0; i < set->n; ++i)
1533                 isl_basic_set_free(set->p[i]);
1534         free(set);
1535 }
1536
1537 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1538 {
1539         int i;
1540
1541         if (!set) {
1542                 fprintf(out, "null set\n");
1543                 return;
1544         }
1545
1546         fprintf(out, "%*s", indent, "");
1547         fprintf(out, "ref: %d, n: %d\n", set->ref, set->n);
1548         for (i = 0; i < set->n; ++i) {
1549                 fprintf(out, "%*s", indent, "");
1550                 fprintf(out, "basic set %d:\n", i);
1551                 isl_basic_set_dump(set->p[i], out, indent+4);
1552         }
1553 }
1554
1555 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1556 {
1557         int i;
1558
1559         if (!map) {
1560                 fprintf(out, "null map\n");
1561                 return;
1562         }
1563
1564         fprintf(out, "%*s", indent, "");
1565         fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, flags: %x\n",
1566                         map->ref, map->n, map->nparam, map->n_in, map->n_out,
1567                         map->flags);
1568         for (i = 0; i < map->n; ++i) {
1569                 fprintf(out, "%*s", indent, "");
1570                 fprintf(out, "basic map %d:\n", i);
1571                 isl_basic_map_dump(map->p[i], out, indent+4);
1572         }
1573 }
1574
1575 struct isl_basic_map *isl_basic_map_intersect_domain(
1576                 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1577 {
1578         struct isl_basic_map *bmap_domain;
1579
1580         if (!bmap || !bset)
1581                 goto error;
1582
1583         isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
1584         isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1585
1586         bmap = isl_basic_map_extend(bmap,
1587                         bset->nparam, bmap->n_in, bmap->n_out,
1588                         bset->n_div, bset->n_eq, bset->n_ineq);
1589         if (!bmap)
1590                 goto error;
1591         bmap_domain = isl_basic_map_from_basic_set(bset,
1592                                                 bset->dim, 0);
1593         bmap = add_constraints(bmap, bmap_domain, 0, 0);
1594
1595         bmap = isl_basic_map_simplify(bmap);
1596         return isl_basic_map_finalize(bmap);
1597 error:
1598         isl_basic_map_free(bmap);
1599         isl_basic_set_free(bset);
1600         return NULL;
1601 }
1602
1603 struct isl_basic_map *isl_basic_map_intersect_range(
1604                 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1605 {
1606         struct isl_basic_map *bmap_range;
1607
1608         if (!bmap || !bset)
1609                 goto error;
1610
1611         isl_assert(bset->ctx, bset->dim == bmap->n_out, goto error);
1612         isl_assert(bset->ctx, bset->nparam == bmap->nparam, goto error);
1613
1614         bmap = isl_basic_map_extend(bmap,
1615                         bset->nparam, bmap->n_in, bmap->n_out,
1616                         bset->n_div, bset->n_eq, bset->n_ineq);
1617         if (!bmap)
1618                 goto error;
1619         bmap_range = isl_basic_map_from_basic_set(bset,
1620                                                 0, bset->dim);
1621         bmap = add_constraints(bmap, bmap_range, 0, 0);
1622
1623         bmap = isl_basic_map_simplify(bmap);
1624         return isl_basic_map_finalize(bmap);
1625 error:
1626         isl_basic_map_free(bmap);
1627         isl_basic_set_free(bset);
1628         return NULL;
1629 }
1630
1631 struct isl_basic_map *isl_basic_map_intersect(
1632                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1633 {
1634         if (!bmap1 || !bmap2)
1635                 goto error;
1636
1637         isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
1638         isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
1639         isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
1640
1641         bmap1 = isl_basic_map_extend(bmap1,
1642                         bmap1->nparam, bmap1->n_in, bmap1->n_out,
1643                         bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1644         if (!bmap1)
1645                 goto error;
1646         bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1647
1648         bmap1 = isl_basic_map_simplify(bmap1);
1649         return isl_basic_map_finalize(bmap1);
1650 error:
1651         isl_basic_map_free(bmap1);
1652         isl_basic_map_free(bmap2);
1653         return NULL;
1654 }
1655
1656 struct isl_basic_set *isl_basic_set_intersect(
1657                 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1658 {
1659         return (struct isl_basic_set *)
1660                 isl_basic_map_intersect(
1661                         (struct isl_basic_map *)bset1,
1662                         (struct isl_basic_map *)bset2);
1663 }
1664
1665 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1666 {
1667         unsigned flags = 0;
1668         struct isl_map *result;
1669         int i, j;
1670
1671         if (!map1 || !map2)
1672                 goto error;
1673
1674         if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
1675             F_ISSET(map2, ISL_MAP_DISJOINT))
1676                 FL_SET(flags, ISL_MAP_DISJOINT);
1677
1678         result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
1679                                 map1->n * map2->n, flags);
1680         if (!result)
1681                 goto error;
1682         for (i = 0; i < map1->n; ++i)
1683                 for (j = 0; j < map2->n; ++j) {
1684                         struct isl_basic_map *part;
1685                         part = isl_basic_map_intersect(
1686                                     isl_basic_map_copy(map1->p[i]),
1687                                     isl_basic_map_copy(map2->p[j]));
1688                         if (isl_basic_map_is_empty(part))
1689                                 isl_basic_map_free(part);
1690                         else
1691                                 result = isl_map_add(result, part);
1692                         if (!result)
1693                                 goto error;
1694                 }
1695         isl_map_free(map1);
1696         isl_map_free(map2);
1697         return result;
1698 error:
1699         isl_map_free(map1);
1700         isl_map_free(map2);
1701         return NULL;
1702 }
1703
1704 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1705 {
1706         struct isl_basic_set *bset;
1707         unsigned in;
1708
1709         if (!bmap)
1710                 return NULL;
1711         bmap = isl_basic_map_cow(bmap);
1712         if (!bmap)
1713                 return NULL;
1714         in = bmap->n_in;
1715         bset = isl_basic_set_from_basic_map(bmap);
1716         bset = isl_basic_set_swap_vars(bset, in);
1717         return isl_basic_map_from_basic_set(bset, bset->dim-in, in);
1718 }
1719
1720 /* Turn final n dimensions into existentially quantified variables.
1721  */
1722 struct isl_basic_set *isl_basic_set_project_out(
1723                 struct isl_basic_set *bset, unsigned n, unsigned flags)
1724 {
1725         int i;
1726         size_t row_size;
1727         isl_int **new_div;
1728         isl_int *old;
1729
1730         if (!bset)
1731                 return NULL;
1732
1733         isl_assert(bset->ctx, n <= bset->dim, goto error);
1734
1735         if (n == 0)
1736                 return bset;
1737
1738         bset = isl_basic_set_cow(bset);
1739
1740         row_size = 1 + bset->nparam + bset->dim + bset->extra;
1741         old = bset->block2.data;
1742         bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1743                                         (bset->extra + n) * (1 + row_size));
1744         if (!bset->block2.data)
1745                 goto error;
1746         new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1747         if (!new_div)
1748                 goto error;
1749         for (i = 0; i < n; ++i) {
1750                 new_div[i] = bset->block2.data +
1751                                 (bset->extra + i) * (1 + row_size);
1752                 isl_seq_clr(new_div[i], 1 + row_size);
1753         }
1754         for (i = 0; i < bset->extra; ++i)
1755                 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1756         free(bset->div);
1757         bset->div = new_div;
1758         bset->n_div += n;
1759         bset->extra += n;
1760         bset->dim -= n;
1761         bset = isl_basic_set_simplify(bset);
1762         return isl_basic_set_finalize(bset);
1763 error:
1764         isl_basic_set_free(bset);
1765         return NULL;
1766 }
1767
1768 struct isl_basic_map *isl_basic_map_apply_range(
1769                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1770 {
1771         struct isl_basic_set *bset;
1772         unsigned n_in, n_out;
1773
1774         if (!bmap1 || !bmap2)
1775                 goto error;
1776
1777         isl_assert(bmap->ctx, bmap1->n_out == bmap2->n_in, goto error);
1778         isl_assert(bmap->ctx, bmap1->nparam == bmap2->nparam, goto error);
1779
1780         n_in = bmap1->n_in;
1781         n_out = bmap2->n_out;
1782
1783         bmap2 = isl_basic_map_reverse(bmap2);
1784         if (!bmap2)
1785                 goto error;
1786         bmap1 = isl_basic_map_extend(bmap1, bmap1->nparam,
1787                         bmap1->n_in + bmap2->n_in, bmap1->n_out,
1788                         bmap2->extra, bmap2->n_eq, bmap2->n_ineq);
1789         if (!bmap1)
1790                 goto error;
1791         bmap1 = add_constraints(bmap1, bmap2, bmap1->n_in - bmap2->n_in, 0);
1792         bmap1 = isl_basic_map_simplify(bmap1);
1793         bset = isl_basic_set_from_basic_map(bmap1);
1794         bset = isl_basic_set_project_out(bset,
1795                                                 bset->dim - (n_in + n_out), 0);
1796         return isl_basic_map_from_basic_set(bset, n_in, n_out);
1797 error:
1798         isl_basic_map_free(bmap1);
1799         isl_basic_map_free(bmap2);
1800         return NULL;
1801 }
1802
1803 struct isl_basic_set *isl_basic_set_apply(
1804                 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1805 {
1806         if (!bset || !bmap)
1807                 goto error;
1808
1809         isl_assert(bset->ctx, bset->dim == bmap->n_in, goto error);
1810
1811         return (struct isl_basic_set *)
1812                 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1813 error:
1814         isl_basic_set_free(bset);
1815         isl_basic_map_free(bmap);
1816         return NULL;
1817 }
1818
1819 struct isl_basic_map *isl_basic_map_apply_domain(
1820                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1821 {
1822         if (!bmap1 || !bmap2)
1823                 goto error;
1824
1825         isl_assert(ctx, bmap1->n_in == bmap2->n_in, goto error);
1826         isl_assert(ctx, bmap1->nparam == bmap2->nparam, goto error);
1827
1828         bmap1 = isl_basic_map_reverse(bmap1);
1829         bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1830         return isl_basic_map_reverse(bmap1);
1831 error:
1832         isl_basic_map_free(bmap1);
1833         isl_basic_map_free(bmap2);
1834         return NULL;
1835 }
1836
1837 static struct isl_basic_map *var_equal(struct isl_ctx *ctx,
1838                 struct isl_basic_map *bmap, unsigned pos)
1839 {
1840         int i;
1841         i = isl_basic_map_alloc_equality(bmap);
1842         if (i < 0)
1843                 goto error;
1844         isl_seq_clr(bmap->eq[i],
1845                     1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1846         isl_int_set_si(bmap->eq[i][1+bmap->nparam+pos], -1);
1847         isl_int_set_si(bmap->eq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1848         return isl_basic_map_finalize(bmap);
1849 error:
1850         isl_basic_map_free(bmap);
1851         return NULL;
1852 }
1853
1854 static struct isl_basic_map *var_more(struct isl_ctx *ctx,
1855                 struct isl_basic_map *bmap, unsigned pos)
1856 {
1857         int i;
1858         i = isl_basic_map_alloc_inequality(bmap);
1859         if (i < 0)
1860                 goto error;
1861         isl_seq_clr(bmap->ineq[i],
1862                     1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1863         isl_int_set_si(bmap->ineq[i][0], -1);
1864         isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], -1);
1865         isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], 1);
1866         return isl_basic_map_finalize(bmap);
1867 error:
1868         isl_basic_map_free(bmap);
1869         return NULL;
1870 }
1871
1872 static struct isl_basic_map *var_less(struct isl_ctx *ctx,
1873                 struct isl_basic_map *bmap, unsigned pos)
1874 {
1875         int i;
1876         i = isl_basic_map_alloc_inequality(bmap);
1877         if (i < 0)
1878                 goto error;
1879         isl_seq_clr(bmap->ineq[i],
1880                     1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
1881         isl_int_set_si(bmap->ineq[i][0], -1);
1882         isl_int_set_si(bmap->ineq[i][1+bmap->nparam+pos], 1);
1883         isl_int_set_si(bmap->ineq[i][1+bmap->nparam+bmap->n_in+pos], -1);
1884         return isl_basic_map_finalize(bmap);
1885 error:
1886         isl_basic_map_free(bmap);
1887         return NULL;
1888 }
1889
1890 struct isl_basic_map *isl_basic_map_equal(struct isl_ctx *ctx,
1891                 unsigned nparam, unsigned in, unsigned out, unsigned n_equal)
1892 {
1893         int i;
1894         struct isl_basic_map *bmap;
1895         bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, n_equal, 0);
1896         if (!bmap)
1897                 return NULL;
1898         for (i = 0; i < n_equal && bmap; ++i)
1899                 bmap = var_equal(ctx, bmap, i);
1900         return isl_basic_map_finalize(bmap);
1901 }
1902
1903 struct isl_basic_map *isl_basic_map_less_at(struct isl_ctx *ctx,
1904                 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1905 {
1906         int i;
1907         struct isl_basic_map *bmap;
1908         bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1909         if (!bmap)
1910                 return NULL;
1911         for (i = 0; i < pos && bmap; ++i)
1912                 bmap = var_equal(ctx, bmap, i);
1913         if (bmap)
1914                 bmap = var_less(ctx, bmap, pos);
1915         return isl_basic_map_finalize(bmap);
1916 }
1917
1918 struct isl_basic_map *isl_basic_map_more_at(struct isl_ctx *ctx,
1919                 unsigned nparam, unsigned in, unsigned out, unsigned pos)
1920 {
1921         int i;
1922         struct isl_basic_map *bmap;
1923         bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, pos, 1);
1924         if (!bmap)
1925                 return NULL;
1926         for (i = 0; i < pos && bmap; ++i)
1927                 bmap = var_equal(ctx, bmap, i);
1928         if (bmap)
1929                 bmap = var_more(ctx, bmap, pos);
1930         return isl_basic_map_finalize(bmap);
1931 }
1932
1933 struct isl_basic_map *isl_basic_map_from_basic_set(
1934                 struct isl_basic_set *bset, unsigned n_in, unsigned n_out)
1935 {
1936         struct isl_basic_map *bmap;
1937
1938         bset = isl_basic_set_cow(bset);
1939         if (!bset)
1940                 return NULL;
1941
1942         isl_assert(ctx, bset->dim == n_in + n_out, goto error);
1943         bmap = (struct isl_basic_map *) bset;
1944         bmap->n_in = n_in;
1945         bmap->n_out = n_out;
1946         return isl_basic_map_finalize(bmap);
1947 error:
1948         isl_basic_set_free(bset);
1949         return NULL;
1950 }
1951
1952 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
1953 {
1954         if (!bmap)
1955                 goto error;
1956         if (bmap->n_in == 0)
1957                 return (struct isl_basic_set *)bmap;
1958         bmap = isl_basic_map_cow(bmap);
1959         if (!bmap)
1960                 goto error;
1961         bmap->n_out += bmap->n_in;
1962         bmap->n_in = 0;
1963         bmap = isl_basic_map_finalize(bmap);
1964         return (struct isl_basic_set *)bmap;
1965 error:
1966         return NULL;
1967 }
1968
1969 /* For a div d = floor(f/m), add the constraints
1970  *
1971  *              f - m d >= 0
1972  *              -(f-(n-1)) + m d >= 0
1973  *
1974  * Note that the second constraint is the negation of
1975  *
1976  *              f - m d >= n
1977  */
1978 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
1979 {
1980         int i, j;
1981         unsigned div_pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
1982         unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra;
1983
1984         i = isl_basic_map_alloc_inequality(bmap);
1985         if (i < 0)
1986                 return -1;
1987         isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
1988         isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
1989
1990         j = isl_basic_map_alloc_inequality(bmap);
1991         if (j < 0)
1992                 return -1;
1993         isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
1994         isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
1995         isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
1996         return j;
1997 }
1998
1999 struct isl_basic_set *isl_basic_map_underlying_set(
2000                 struct isl_basic_map *bmap)
2001 {
2002         if (!bmap)
2003                 goto error;
2004         if (bmap->nparam == 0 && bmap->n_in == 0 && bmap->n_div == 0)
2005                 return (struct isl_basic_set *)bmap;
2006         bmap = isl_basic_map_cow(bmap);
2007         if (!bmap)
2008                 goto error;
2009         bmap->n_out += bmap->nparam + bmap->n_in + bmap->n_div;
2010         bmap->nparam = 0;
2011         bmap->n_in = 0;
2012         bmap->extra -= bmap->n_div;
2013         bmap->n_div = 0;
2014         bmap = isl_basic_map_finalize(bmap);
2015         return (struct isl_basic_set *)bmap;
2016 error:
2017         return NULL;
2018 }
2019
2020 struct isl_basic_map *isl_basic_map_overlying_set(
2021         struct isl_basic_set *bset, struct isl_basic_map *like)
2022 {
2023         struct isl_basic_map *bmap;
2024         struct isl_ctx *ctx;
2025         unsigned total;
2026         int i, k;
2027
2028         if (!bset || !like)
2029                 goto error;
2030         ctx = bset->ctx;
2031         isl_assert(ctx, bset->dim ==
2032                         like->nparam + like->n_in + like->n_out + like->n_div,
2033                         goto error);
2034         if (like->nparam == 0 && like->n_in == 0 && like->n_div == 0) {
2035                 isl_basic_map_free(like);
2036                 return (struct isl_basic_map *)bset;
2037         }
2038         bset = isl_basic_set_cow(bset);
2039         total = bset->dim + bset->extra;
2040         if (!bset)
2041                 goto error;
2042         bmap = (struct isl_basic_map *)bset;
2043         bmap->nparam = like->nparam;
2044         bmap->n_in = like->n_in;
2045         bmap->n_out = like->n_out;
2046         bmap->extra += like->n_div;
2047         if (bmap->extra) {
2048                 unsigned ltotal;
2049                 ltotal = total - bmap->extra + like->extra;
2050                 if (ltotal > total)
2051                         ltotal = total;
2052                 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2053                                         bmap->extra * (1 + 1 + total));
2054                 if (isl_blk_is_error(bmap->block2))
2055                         goto error;
2056                 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2057                                                 bmap->extra);
2058                 if (!bmap->div)
2059                         goto error;
2060                 bmap = isl_basic_map_extend(bmap, bmap->nparam,
2061                         bmap->n_in, bmap->n_out, 0, 0, 2 * like->n_div);
2062                 for (i = 0; i < like->n_div; ++i) {
2063                         k = isl_basic_map_alloc_div(bmap);
2064                         if (k < 0)
2065                                 goto error;
2066                         isl_seq_cpy(bmap->div[k], like->div[i], 1 + 1 + ltotal);
2067                         isl_seq_clr(bmap->div[k]+1+1+ltotal, total - ltotal);
2068                         if (add_div_constraints(bmap, k) < 0)
2069                                 goto error;
2070                 }
2071         }
2072         isl_basic_map_free(like);
2073         bmap = isl_basic_map_finalize(bmap);
2074         return bmap;
2075 error:
2076         isl_basic_map_free(like);
2077         isl_basic_set_free(bset);
2078         return NULL;
2079 }
2080
2081 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2082 {
2083         int i;
2084
2085         map = isl_map_align_divs(map);
2086         map = isl_map_cow(map);
2087         if (!map)
2088                 return NULL;
2089
2090         for (i = 0; i < map->n; ++i) {
2091                 map->p[i] = (struct isl_basic_map *)
2092                                 isl_basic_map_underlying_set(map->p[i]);
2093                 if (!map->p[i])
2094                         goto error;
2095         }
2096         if (map->n == 0)
2097                 map->n_out += map->nparam + map->n_in;
2098         else
2099                 map->n_out = map->p[0]->n_out;
2100         map->nparam = 0;
2101         map->n_in = 0;
2102         return (struct isl_set *)map;
2103 error:
2104         isl_map_free(map);
2105         return NULL;
2106 }
2107
2108 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2109 {
2110         struct isl_basic_set *domain;
2111         unsigned n_out;
2112         if (!bmap)
2113                 return NULL;
2114         n_out = bmap->n_out;
2115         domain = isl_basic_set_from_basic_map(bmap);
2116         return isl_basic_set_project_out(domain, n_out, 0);
2117 }
2118
2119 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2120 {
2121         return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2122 }
2123
2124 struct isl_set *isl_map_range(struct isl_map *map)
2125 {
2126         int i;
2127         struct isl_set *set;
2128
2129         if (!map)
2130                 goto error;
2131         map = isl_map_cow(map);
2132         if (!map)
2133                 goto error;
2134
2135         set = (struct isl_set *) map;
2136         set->zero = 0;
2137         for (i = 0; i < map->n; ++i) {
2138                 set->p[i] = isl_basic_map_range(map->p[i]);
2139                 if (!set->p[i])
2140                         goto error;
2141         }
2142         F_CLR(set, ISL_MAP_DISJOINT);
2143         return set;
2144 error:
2145         isl_map_free(map);
2146         return NULL;
2147 }
2148
2149 struct isl_map *isl_map_from_set(struct isl_set *set,
2150                 unsigned n_in, unsigned n_out)
2151 {
2152         int i;
2153         struct isl_map *map = NULL;
2154
2155         if (!set)
2156                 return NULL;
2157         isl_assert(set->ctx, set->dim == n_in + n_out, goto error);
2158         set = isl_set_cow(set);
2159         if (!set)
2160                 return NULL;
2161         map = (struct isl_map *)set;
2162         for (i = 0; i < set->n; ++i) {
2163                 map->p[i] = isl_basic_map_from_basic_set(
2164                                 set->p[i], n_in, n_out);
2165                 if (!map->p[i])
2166                         goto error;
2167         }
2168         map->n_in = n_in;
2169         map->n_out = n_out;
2170         return map;
2171 error:
2172         isl_set_free(set);
2173         return NULL;
2174 }
2175
2176 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2177                 unsigned nparam, unsigned in, unsigned out, int n,
2178                 unsigned flags)
2179 {
2180         struct isl_map *map;
2181
2182         map = isl_alloc(ctx, struct isl_map,
2183                         sizeof(struct isl_map) +
2184                         n * sizeof(struct isl_basic_map *));
2185         if (!map)
2186                 return NULL;
2187
2188         map->ctx = ctx;
2189         isl_ctx_ref(ctx);
2190         map->ref = 1;
2191         map->size = n;
2192         map->n = 0;
2193         map->nparam = nparam;
2194         map->n_in = in;
2195         map->n_out = out;
2196         map->flags = flags;
2197         return map;
2198 }
2199
2200 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2201                 unsigned nparam, unsigned in, unsigned out)
2202 {
2203         struct isl_basic_map *bmap;
2204         bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2205         bmap = isl_basic_map_set_to_empty(bmap);
2206         return bmap;
2207 }
2208
2209 struct isl_basic_set *isl_basic_set_empty(struct isl_ctx *ctx,
2210                 unsigned nparam, unsigned dim)
2211 {
2212         struct isl_basic_set *bset;
2213         bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 1, 0);
2214         bset = isl_basic_set_set_to_empty(bset);
2215         return bset;
2216 }
2217
2218 struct isl_basic_map *isl_basic_map_universe(struct isl_ctx *ctx,
2219                 unsigned nparam, unsigned in, unsigned out)
2220 {
2221         struct isl_basic_map *bmap;
2222         bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 0, 0);
2223         return bmap;
2224 }
2225
2226 struct isl_basic_set *isl_basic_set_universe(struct isl_ctx *ctx,
2227                 unsigned nparam, unsigned dim)
2228 {
2229         struct isl_basic_set *bset;
2230         bset = isl_basic_set_alloc(ctx, nparam, dim, 0, 0, 0);
2231         return bset;
2232 }
2233
2234 struct isl_map *isl_map_empty(struct isl_ctx *ctx,
2235                 unsigned nparam, unsigned in, unsigned out)
2236 {
2237         return isl_map_alloc(ctx, nparam, in, out, 0, ISL_MAP_DISJOINT);
2238 }
2239
2240 struct isl_set *isl_set_empty(struct isl_ctx *ctx,
2241                 unsigned nparam, unsigned dim)
2242 {
2243         return isl_set_alloc(ctx, nparam, dim, 0, ISL_MAP_DISJOINT);
2244 }
2245
2246 struct isl_map *isl_map_dup(struct isl_map *map)
2247 {
2248         int i;
2249         struct isl_map *dup;
2250
2251         if (!map)
2252                 return NULL;
2253         dup = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out, map->n,
2254                                 map->flags);
2255         for (i = 0; i < map->n; ++i)
2256                 dup = isl_map_add(dup,
2257                                   isl_basic_map_dup(map->p[i]));
2258         return dup;
2259 }
2260
2261 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2262 {
2263         if (!bmap || !map)
2264                 goto error;
2265         isl_assert(map->ctx, map->nparam == bmap->nparam, goto error);
2266         isl_assert(map->ctx, map->n_in == bmap->n_in, goto error);
2267         isl_assert(map->ctx, map->n_out == bmap->n_out, goto error);
2268         isl_assert(map->ctx, map->n < map->size, goto error);
2269         map->p[map->n] = bmap;
2270         map->n++;
2271         return map;
2272 error:
2273         if (map)
2274                 isl_map_free(map);
2275         if (bmap)
2276                 isl_basic_map_free(bmap);
2277         return NULL;
2278 }
2279
2280 void isl_map_free(struct isl_map *map)
2281 {
2282         int i;
2283
2284         if (!map)
2285                 return;
2286
2287         if (--map->ref > 0)
2288                 return;
2289
2290         isl_ctx_deref(map->ctx);
2291         for (i = 0; i < map->n; ++i)
2292                 isl_basic_map_free(map->p[i]);
2293         free(map);
2294 }
2295
2296 struct isl_map *isl_map_extend(struct isl_map *base,
2297                 unsigned nparam, unsigned n_in, unsigned n_out)
2298 {
2299         int i;
2300
2301         base = isl_map_cow(base);
2302         if (!base)
2303                 return NULL;
2304
2305         isl_assert(base->ctx, base->nparam <= nparam, goto error);
2306         isl_assert(base->ctx, base->n_in <= n_in, goto error);
2307         isl_assert(base->ctx, base->n_out <= n_out, goto error);
2308         base->nparam = nparam;
2309         base->n_in = n_in;
2310         base->n_out = n_out;
2311         for (i = 0; i < base->n; ++i) {
2312                 base->p[i] = isl_basic_map_extend(base->p[i],
2313                                 nparam, n_in, n_out, 0, 0, 0);
2314                 if (!base->p[i])
2315                         goto error;
2316         }
2317         return base;
2318 error:
2319         isl_map_free(base);
2320         return NULL;
2321 }
2322
2323 static struct isl_basic_map *isl_basic_map_fix_var(struct isl_basic_map *bmap,
2324                 unsigned var, int value)
2325 {
2326         int j;
2327
2328         bmap = isl_basic_map_cow(bmap);
2329         bmap = isl_basic_map_extend(bmap,
2330                         bmap->nparam, bmap->n_in, bmap->n_out, 0, 1, 0);
2331         j = isl_basic_map_alloc_equality(bmap);
2332         if (j < 0)
2333                 goto error;
2334         isl_seq_clr(bmap->eq[j],
2335                     1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2336         isl_int_set_si(bmap->eq[j][1 + var], -1);
2337         isl_int_set_si(bmap->eq[j][0], value);
2338         bmap = isl_basic_map_simplify(bmap);
2339         return isl_basic_map_finalize(bmap);
2340 error:
2341         isl_basic_map_free(bmap);
2342         return NULL;
2343 }
2344
2345 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2346                 unsigned input, int value)
2347 {
2348         if (!bmap)
2349                 return NULL;
2350         isl_assert(bmap->ctx, input < bmap->n_in, goto error);
2351         return isl_basic_map_fix_var(bmap, bmap->nparam + input, value);
2352 error:
2353         isl_basic_map_free(bmap);
2354         return NULL;
2355 }
2356
2357 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2358                 unsigned dim, int value)
2359 {
2360         if (!bset)
2361                 return NULL;
2362         isl_assert(bset->ctx, dim < bset->dim, goto error);
2363         return (struct isl_basic_set *)
2364                 isl_basic_map_fix_var((struct isl_basic_map *)bset,
2365                                                 bset->nparam + dim, value);
2366 error:
2367         isl_basic_set_free(bset);
2368         return NULL;
2369 }
2370
2371 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2372                 unsigned input, int value)
2373 {
2374         int i;
2375
2376         map = isl_map_cow(map);
2377         if (!map)
2378                 return NULL;
2379
2380         isl_assert(ctx, input < map->n_in, goto error);
2381         for (i = 0; i < map->n; ++i) {
2382                 map->p[i] = isl_basic_map_fix_input_si(map->p[i], input, value);
2383                 if (!map->p[i])
2384                         goto error;
2385         }
2386         return map;
2387 error:
2388         isl_map_free(map);
2389         return NULL;
2390 }
2391
2392 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2393 {
2394         int i;
2395
2396         set = isl_set_cow(set);
2397         if (!set)
2398                 return NULL;
2399
2400         isl_assert(set->ctx, dim < set->dim, goto error);
2401         for (i = 0; i < set->n; ++i) {
2402                 set->p[i] = isl_basic_set_fix_dim_si(set->p[i], dim, value);
2403                 if (!set->p[i])
2404                         goto error;
2405         }
2406         return set;
2407 error:
2408         isl_set_free(set);
2409         return NULL;
2410 }
2411
2412 struct isl_map *isl_map_reverse(struct isl_map *map)
2413 {
2414         int i;
2415         unsigned t;
2416
2417         map = isl_map_cow(map);
2418         if (!map)
2419                 return NULL;
2420
2421         t = map->n_in;
2422         map->n_in = map->n_out;
2423         map->n_out = t;
2424         for (i = 0; i < map->n; ++i) {
2425                 map->p[i] = isl_basic_map_reverse(map->p[i]);
2426                 if (!map->p[i])
2427                         goto error;
2428         }
2429         return map;
2430 error:
2431         isl_map_free(map);
2432         return NULL;
2433 }
2434
2435 struct isl_map *isl_basic_map_lexmax(
2436                 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2437                 struct isl_set **empty)
2438 {
2439         return isl_pip_basic_map_lexmax(bmap, dom, empty);
2440 }
2441
2442 struct isl_map *isl_basic_map_lexmin(
2443                 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2444                 struct isl_set **empty)
2445 {
2446         return isl_pip_basic_map_lexmin(bmap, dom, empty);
2447 }
2448
2449 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2450 {
2451         struct isl_basic_map *bmap = NULL;
2452         struct isl_basic_set *dom = NULL;
2453         struct isl_map *min;
2454
2455         if (!bset)
2456                 goto error;
2457         bmap = isl_basic_map_from_basic_set(bset, 0, bset->dim);
2458         if (!bmap)
2459                 goto error;
2460         dom = isl_basic_set_alloc(bmap->ctx, bmap->nparam, 0, 0, 0, 0);
2461         if (!dom)
2462                 goto error;
2463         min = isl_basic_map_lexmin(bmap, dom, NULL);
2464         return isl_map_range(min);
2465 error:
2466         isl_basic_map_free(bmap);
2467         return NULL;
2468 }
2469
2470 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
2471 {
2472         if (!bmap)
2473                 return NULL;
2474         if (bmap->n_div == 0)
2475                 return isl_map_from_basic_map(bmap);
2476         return isl_pip_basic_map_compute_divs(bmap);
2477 }
2478
2479 struct isl_map *isl_map_compute_divs(struct isl_map *map)
2480 {
2481         int i;
2482         struct isl_map *res;
2483
2484         if (!map)
2485                 return NULL;
2486         if (map->n == 0)
2487                 return map;
2488         res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
2489         for (i = 1 ; i < map->n; ++i) {
2490                 struct isl_map *r2;
2491                 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
2492                 if (F_ISSET(map, ISL_MAP_DISJOINT))
2493                         res = isl_map_union_disjoint(res, r2);
2494                 else
2495                         res = isl_map_union(res, r2);
2496         }
2497         isl_map_free(map);
2498
2499         return res;
2500 }
2501
2502 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
2503 {
2504         return (struct isl_set *)
2505                 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
2506 }
2507
2508 struct isl_set *isl_set_compute_divs(struct isl_set *set)
2509 {
2510         return (struct isl_set *)
2511                 isl_map_compute_divs((struct isl_map *)set);
2512 }
2513
2514 struct isl_set *isl_map_domain(struct isl_map *map)
2515 {
2516         int i;
2517         struct isl_set *set;
2518
2519         if (!map)
2520                 goto error;
2521
2522         map = isl_map_cow(map);
2523         if (!map)
2524                 return NULL;
2525
2526         set = (struct isl_set *)map;
2527         set->dim = map->n_in;
2528         set->zero = 0;
2529         for (i = 0; i < map->n; ++i) {
2530                 set->p[i] = isl_basic_map_domain(map->p[i]);
2531                 if (!set->p[i])
2532                         goto error;
2533         }
2534         F_CLR(set, ISL_MAP_DISJOINT);
2535         return set;
2536 error:
2537         isl_map_free(map);
2538         return NULL;
2539 }
2540
2541 struct isl_map *isl_map_union_disjoint(
2542                         struct isl_map *map1, struct isl_map *map2)
2543 {
2544         int i;
2545         unsigned flags = 0;
2546         struct isl_map *map = NULL;
2547
2548         if (!map1 || !map2)
2549                 goto error;
2550
2551         if (map1->n == 0) {
2552                 isl_map_free(map1);
2553                 return map2;
2554         }
2555         if (map2->n == 0) {
2556                 isl_map_free(map2);
2557                 return map1;
2558         }
2559
2560         isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
2561         isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
2562         isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
2563
2564         if (F_ISSET(map1, ISL_MAP_DISJOINT) &&
2565             F_ISSET(map2, ISL_MAP_DISJOINT))
2566                 FL_SET(flags, ISL_MAP_DISJOINT);
2567
2568         map = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map1->n_out,
2569                                 map1->n + map2->n, flags);
2570         if (!map)
2571                 goto error;
2572         for (i = 0; i < map1->n; ++i) {
2573                 map = isl_map_add(map,
2574                                   isl_basic_map_copy(map1->p[i]));
2575                 if (!map)
2576                         goto error;
2577         }
2578         for (i = 0; i < map2->n; ++i) {
2579                 map = isl_map_add(map,
2580                                   isl_basic_map_copy(map2->p[i]));
2581                 if (!map)
2582                         goto error;
2583         }
2584         isl_map_free(map1);
2585         isl_map_free(map2);
2586         return map;
2587 error:
2588         isl_map_free(map);
2589         isl_map_free(map1);
2590         isl_map_free(map2);
2591         return NULL;
2592 }
2593
2594 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
2595 {
2596         map1 = isl_map_union_disjoint(map1, map2);
2597         if (!map1)
2598                 return NULL;
2599         if (map1->n > 1)
2600                 F_CLR(map1, ISL_MAP_DISJOINT);
2601         return map1;
2602 }
2603
2604 struct isl_set *isl_set_union_disjoint(
2605                         struct isl_set *set1, struct isl_set *set2)
2606 {
2607         return (struct isl_set *)
2608                 isl_map_union_disjoint(
2609                         (struct isl_map *)set1, (struct isl_map *)set2);
2610 }
2611
2612 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
2613 {
2614         return (struct isl_set *)
2615                 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
2616 }
2617
2618 struct isl_map *isl_map_intersect_range(
2619                 struct isl_map *map, struct isl_set *set)
2620 {
2621         unsigned flags = 0;
2622         struct isl_map *result;
2623         int i, j;
2624
2625         if (!map || !set)
2626                 goto error;
2627
2628         if (F_ISSET(map, ISL_MAP_DISJOINT) &&
2629             F_ISSET(set, ISL_MAP_DISJOINT))
2630                 FL_SET(flags, ISL_MAP_DISJOINT);
2631
2632         result = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
2633                                 map->n * set->n, flags);
2634         if (!result)
2635                 goto error;
2636         for (i = 0; i < map->n; ++i)
2637                 for (j = 0; j < set->n; ++j) {
2638                         result = isl_map_add(result,
2639                             isl_basic_map_intersect_range(
2640                                 isl_basic_map_copy(map->p[i]),
2641                                 isl_basic_set_copy(set->p[j])));
2642                         if (!result)
2643                                 goto error;
2644                 }
2645         isl_map_free(map);
2646         isl_set_free(set);
2647         return result;
2648 error:
2649         isl_map_free(map);
2650         isl_set_free(set);
2651         return NULL;
2652 }
2653
2654 struct isl_map *isl_map_intersect_domain(
2655                 struct isl_map *map, struct isl_set *set)
2656 {
2657         return isl_map_reverse(
2658                 isl_map_intersect_range(isl_map_reverse(map), set));
2659 }
2660
2661 struct isl_map *isl_map_apply_domain(
2662                 struct isl_map *map1, struct isl_map *map2)
2663 {
2664         if (!map1 || !map2)
2665                 goto error;
2666         map1 = isl_map_reverse(map1);
2667         map1 = isl_map_apply_range(map1, map2);
2668         return isl_map_reverse(map1);
2669 error:
2670         isl_map_free(map1);
2671         isl_map_free(map2);
2672         return NULL;
2673 }
2674
2675 struct isl_map *isl_map_apply_range(
2676                 struct isl_map *map1, struct isl_map *map2)
2677 {
2678         struct isl_map *result;
2679         int i, j;
2680
2681         if (!map1 || !map2)
2682                 goto error;
2683
2684         isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
2685         isl_assert(map1->ctx, map1->n_out == map2->n_in, goto error);
2686
2687         result = isl_map_alloc(map1->ctx, map1->nparam, map1->n_in, map2->n_out,
2688                                 map1->n * map2->n, 0);
2689         if (!result)
2690                 goto error;
2691         for (i = 0; i < map1->n; ++i)
2692                 for (j = 0; j < map2->n; ++j) {
2693                         result = isl_map_add(result,
2694                             isl_basic_map_apply_range(
2695                                 isl_basic_map_copy(map1->p[i]),
2696                                 isl_basic_map_copy(map2->p[j])));
2697                         if (!result)
2698                                 goto error;
2699                 }
2700         isl_map_free(map1);
2701         isl_map_free(map2);
2702         if (result && result->n <= 1)
2703                 F_SET(result, ISL_MAP_DISJOINT);
2704         return result;
2705 error:
2706         isl_map_free(map1);
2707         isl_map_free(map2);
2708         return NULL;
2709 }
2710
2711 /*
2712  * returns range - domain
2713  */
2714 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
2715 {
2716         struct isl_basic_set *bset;
2717         unsigned dim;
2718         int i;
2719
2720         if (!bmap)
2721                 goto error;
2722         isl_assert(bmap->ctx, bmap->n_in == bmap->n_out, goto error);
2723         dim = bmap->n_in;
2724         bset = isl_basic_set_from_basic_map(bmap);
2725         bset = isl_basic_set_extend(bset, bset->nparam, 3*dim, 0,
2726                                         dim, 0);
2727         bset = isl_basic_set_swap_vars(bset, 2*dim);
2728         for (i = 0; i < dim; ++i) {
2729                 int j = isl_basic_map_alloc_equality(
2730                                             (struct isl_basic_map *)bset);
2731                 if (j < 0)
2732                         goto error;
2733                 isl_seq_clr(bset->eq[j],
2734                             1 + bset->nparam + bset->dim + bset->extra);
2735                 isl_int_set_si(bset->eq[j][1+bset->nparam+i], 1);
2736                 isl_int_set_si(bset->eq[j][1+bset->nparam+dim+i], 1);
2737                 isl_int_set_si(bset->eq[j][1+bset->nparam+2*dim+i], -1);
2738         }
2739         return isl_basic_set_project_out(bset, 2*dim, 0);
2740 error:
2741         isl_basic_map_free(bmap);
2742         return NULL;
2743 }
2744
2745 /* If the only constraints a div d=floor(f/m)
2746  * appears in are its two defining constraints
2747  *
2748  *      f - m d >=0
2749  *      -(f - (m - 1)) + m d >= 0
2750  *
2751  * then it can safely be removed.
2752  */
2753 static int div_is_redundant(struct isl_basic_map *bmap, int div)
2754 {
2755         int i;
2756         unsigned pos = 1 + bmap->nparam + bmap->n_in + bmap->n_out + div;
2757
2758         for (i = 0; i < bmap->n_eq; ++i)
2759                 if (!isl_int_is_zero(bmap->eq[i][pos]))
2760                         return 0;
2761
2762         for (i = 0; i < bmap->n_ineq; ++i) {
2763                 if (isl_int_is_zero(bmap->ineq[i][pos]))
2764                         continue;
2765                 if (isl_int_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2766                         int neg;
2767                         isl_int_sub(bmap->div[div][1],
2768                                         bmap->div[div][1], bmap->div[div][0]);
2769                         isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
2770                         neg = isl_seq_is_neg(bmap->ineq[i], bmap->div[div]+1, pos);
2771                         isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
2772                         isl_int_add(bmap->div[div][1],
2773                                         bmap->div[div][1], bmap->div[div][0]);
2774                         if (!neg)
2775                                 return 0;
2776                         if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2777                                                     bmap->n_div-div-1) != -1)
2778                                 return 0;
2779                 } else if (isl_int_abs_eq(bmap->ineq[i][pos], bmap->div[div][0])) {
2780                         if (!isl_seq_eq(bmap->ineq[i], bmap->div[div]+1, pos))
2781                                 return 0;
2782                         if (isl_seq_first_non_zero(bmap->ineq[i]+pos+1,
2783                                                     bmap->n_div-div-1) != -1)
2784                                 return 0;
2785                 } else
2786                         return 0;
2787         }
2788
2789         for (i = 0; i < bmap->n_div; ++i)
2790                 if (!isl_int_is_zero(bmap->div[i][1+pos]))
2791                         return 0;
2792
2793         return 1;
2794 }
2795
2796 /*
2797  * Remove divs that don't occur in any of the constraints or other divs.
2798  * These can arise when dropping some of the variables in a quast
2799  * returned by piplib.
2800  */
2801 static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap)
2802 {
2803         int i;
2804
2805         if (!bmap)
2806                 return NULL;
2807
2808         for (i = bmap->n_div-1; i >= 0; --i) {
2809                 if (!div_is_redundant(bmap, i))
2810                         continue;
2811                 bmap = isl_basic_map_drop_div(bmap, i);
2812         }
2813         return bmap;
2814 }
2815
2816 struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap)
2817 {
2818         bmap = remove_redundant_divs(bmap);
2819         if (!bmap)
2820                 return NULL;
2821         F_SET(bmap, ISL_BASIC_SET_FINAL);
2822         return bmap;
2823 }
2824
2825 struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset)
2826 {
2827         return (struct isl_basic_set *)
2828                 isl_basic_map_finalize((struct isl_basic_map *)bset);
2829 }
2830
2831 struct isl_set *isl_set_finalize(struct isl_set *set)
2832 {
2833         int i;
2834
2835         if (!set)
2836                 return NULL;
2837         for (i = 0; i < set->n; ++i) {
2838                 set->p[i] = isl_basic_set_finalize(set->p[i]);
2839                 if (!set->p[i])
2840                         goto error;
2841         }
2842         return set;
2843 error:
2844         isl_set_free(set);
2845         return NULL;
2846 }
2847
2848 struct isl_map *isl_map_finalize(struct isl_map *map)
2849 {
2850         int i;
2851
2852         if (!map)
2853                 return NULL;
2854         for (i = 0; i < map->n; ++i) {
2855                 map->p[i] = isl_basic_map_finalize(map->p[i]);
2856                 if (!map->p[i])
2857                         goto error;
2858         }
2859         return map;
2860 error:
2861         isl_map_free(map);
2862         return NULL;
2863 }
2864
2865 struct isl_basic_map *isl_basic_map_identity(struct isl_ctx *ctx,
2866                 unsigned nparam, unsigned dim)
2867 {
2868         struct isl_basic_map *bmap;
2869         int i;
2870
2871         bmap = isl_basic_map_alloc(ctx, nparam, dim, dim, 0, dim, 0);
2872         if (!bmap)
2873                 goto error;
2874
2875         for (i = 0; i < dim; ++i) {
2876                 int j = isl_basic_map_alloc_equality(bmap);
2877                 if (j < 0)
2878                         goto error;
2879                 isl_seq_clr(bmap->eq[j],
2880                     1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->extra);
2881                 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
2882                 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
2883         }
2884         return isl_basic_map_finalize(bmap);
2885 error:
2886         isl_basic_map_free(bmap);
2887         return NULL;
2888 }
2889
2890 struct isl_map *isl_map_identity(struct isl_ctx *ctx,
2891                 unsigned nparam, unsigned dim)
2892 {
2893         struct isl_map *map = isl_map_alloc(ctx, nparam, dim, dim, 1,
2894                                                 ISL_MAP_DISJOINT);
2895         if (!map)
2896                 goto error;
2897         map = isl_map_add(map,
2898                 isl_basic_map_identity(ctx, nparam, dim));
2899         return map;
2900 error:
2901         isl_map_free(map);
2902         return NULL;
2903 }
2904
2905 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
2906 {
2907         return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
2908 }
2909
2910 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
2911 {
2912         return isl_map_is_subset(
2913                         (struct isl_map *)set1, (struct isl_map *)set2);
2914 }
2915
2916 int isl_basic_map_is_subset(
2917                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2918 {
2919         int is_subset;
2920         struct isl_map *map1;
2921         struct isl_map *map2;
2922
2923         if (!bmap1 || !bmap2)
2924                 return -1;
2925
2926         map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
2927         map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
2928
2929         is_subset = isl_map_is_subset(map1, map2);
2930
2931         isl_map_free(map1);
2932         isl_map_free(map2);
2933
2934         return is_subset;
2935 }
2936
2937 int isl_basic_map_is_equal(
2938                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2939 {
2940         int is_subset;
2941
2942         if (!bmap1 || !bmap2)
2943                 return -1;
2944         is_subset = isl_basic_map_is_subset(bmap1, bmap2);
2945         if (is_subset != 1)
2946                 return is_subset;
2947         is_subset = isl_basic_map_is_subset(bmap2, bmap1);
2948         return is_subset;
2949 }
2950
2951 int isl_basic_set_is_equal(
2952                 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2953 {
2954         return isl_basic_map_is_equal(
2955                 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
2956 }
2957
2958 int isl_map_is_empty(struct isl_map *map)
2959 {
2960         int i;
2961         int is_empty;
2962
2963         if (!map)
2964                 return -1;
2965         for (i = 0; i < map->n; ++i) {
2966                 is_empty = isl_basic_map_is_empty(map->p[i]);
2967                 if (is_empty < 0)
2968                         return -1;
2969                 if (!is_empty)
2970                         return 0;
2971         }
2972         return 1;
2973 }
2974
2975 int isl_set_is_empty(struct isl_set *set)
2976 {
2977         return isl_map_is_empty((struct isl_map *)set);
2978 }
2979
2980 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
2981 {
2982         int i;
2983         int is_subset = 0;
2984         struct isl_map *diff;
2985
2986         if (!map1 || !map2)
2987                 return -1;
2988
2989         if (isl_map_is_empty(map1))
2990                 return 1;
2991
2992         if (isl_map_is_empty(map2))
2993                 return 0;
2994
2995         diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
2996         if (!diff)
2997                 return -1;
2998
2999         is_subset = isl_map_is_empty(diff);
3000         isl_map_free(diff);
3001
3002         return is_subset;
3003 }
3004
3005 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3006 {
3007         int is_subset;
3008
3009         if (!map1 || !map2)
3010                 return -1;
3011         is_subset = isl_map_is_subset(map1, map2);
3012         if (is_subset != 1)
3013                 return is_subset;
3014         is_subset = isl_map_is_subset(map2, map1);
3015         return is_subset;
3016 }
3017
3018 int isl_basic_map_is_strict_subset(
3019                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3020 {
3021         int is_subset;
3022
3023         if (!bmap1 || !bmap2)
3024                 return -1;
3025         is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3026         if (is_subset != 1)
3027                 return is_subset;
3028         is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3029         if (is_subset == -1)
3030                 return is_subset;
3031         return !is_subset;
3032 }
3033
3034 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
3035 {
3036         int i;
3037         unsigned total;
3038         isl_int s;
3039
3040         total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3041         if (total != vec->size)
3042                 return -1;
3043
3044         isl_int_init(s);
3045
3046         for (i = 0; i < bmap->n_eq; ++i) {
3047                 isl_seq_inner_product(vec->block.data, bmap->eq[i], total, &s);
3048                 if (!isl_int_is_zero(s)) {
3049                         isl_int_clear(s);
3050                         return 0;
3051                 }
3052         }
3053
3054         for (i = 0; i < bmap->n_ineq; ++i) {
3055                 isl_seq_inner_product(vec->block.data, bmap->ineq[i], total, &s);
3056                 if (isl_int_is_neg(s)) {
3057                         isl_int_clear(s);
3058                         return 0;
3059                 }
3060         }
3061
3062         isl_int_clear(s);
3063
3064         return 1;
3065 }
3066
3067 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3068 {
3069         if (!bmap)
3070                 return -1;
3071         return bmap->n_eq == 0 && bmap->n_ineq == 0;
3072 }
3073
3074 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3075 {
3076         struct isl_basic_set *bset = NULL;
3077         struct isl_vec *sample = NULL;
3078         int empty;
3079         unsigned total;
3080
3081         if (!bmap)
3082                 return -1;
3083
3084         if (F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3085                 return 1;
3086
3087         total = 1 + bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3088         if (bmap->sample && bmap->sample->size == total) {
3089                 int contains = basic_map_contains(bmap, bmap->sample);
3090                 if (contains < 0)
3091                         return -1;
3092                 if (contains)
3093                         return 0;
3094         }
3095         bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3096         if (!bset)
3097                 return -1;
3098         sample = isl_basic_set_sample(bset);
3099         if (!sample)
3100                 return -1;
3101         empty = sample->size == 0;
3102         if (bmap->sample)
3103                 isl_vec_free(bmap->ctx, bmap->sample);
3104         bmap->sample = sample;
3105
3106         return empty;
3107 }
3108
3109 struct isl_map *isl_basic_map_union(
3110         struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3111 {
3112         struct isl_map *map;
3113         if (!bmap1 || !bmap2)
3114                 return NULL;
3115
3116         isl_assert(bmap1->ctx, bmap1->nparam == bmap2->nparam, goto error);
3117         isl_assert(bmap1->ctx, bmap1->n_in == bmap2->n_in, goto error);
3118         isl_assert(bmap1->ctx, bmap1->n_out == bmap2->n_out, goto error);
3119
3120         map = isl_map_alloc(bmap1->ctx, bmap1->nparam,
3121                                 bmap1->n_in, bmap1->n_out, 2, 0);
3122         if (!map)
3123                 goto error;
3124         map = isl_map_add(map, bmap1);
3125         map = isl_map_add(map, bmap2);
3126         return map;
3127 error:
3128         isl_basic_map_free(bmap1);
3129         isl_basic_map_free(bmap2);
3130         return NULL;
3131 }
3132
3133 struct isl_set *isl_basic_set_union(
3134                 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3135 {
3136         return (struct isl_set *)isl_basic_map_union(
3137                                             (struct isl_basic_map *)bset1,
3138                                             (struct isl_basic_map *)bset2);
3139 }
3140
3141 /* Order divs such that any div only depends on previous divs */
3142 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3143 {
3144         int i;
3145         unsigned off = bmap->nparam + bmap->n_in + bmap->n_out;
3146
3147         for (i = 0; i < bmap->n_div; ++i) {
3148                 int pos;
3149                 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3150                                                             bmap->n_div-i);
3151                 if (pos == -1)
3152                         continue;
3153                 swap_div(bmap, i, pos);
3154                 --i;
3155         }
3156         return bmap;
3157 }
3158
3159 static int find_div(struct isl_basic_map *dst,
3160                         struct isl_basic_map *src, unsigned div)
3161 {
3162         int i;
3163
3164         unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3165
3166         for (i = 0; i < dst->n_div; ++i)
3167                 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total) &&
3168                     isl_seq_first_non_zero(dst->div[i]+1+1+total,
3169                                                 dst->n_div - src->n_div) == -1)
3170                         return i;
3171         return -1;
3172 }
3173
3174 struct isl_basic_map *isl_basic_map_align_divs(
3175                 struct isl_basic_map *dst, struct isl_basic_map *src)
3176 {
3177         int i;
3178         unsigned total = src->nparam + src->n_in + src->n_out + src->n_div;
3179
3180         if (src->n_div == 0)
3181                 return dst;
3182
3183         src = order_divs(src);
3184         dst = isl_basic_map_extend(dst, dst->nparam, dst->n_in,
3185                         dst->n_out, src->n_div, 0, 2 * src->n_div);
3186         if (!dst)
3187                 return NULL;
3188         for (i = 0; i < src->n_div; ++i) {
3189                 int j = find_div(dst, src, i);
3190                 if (j < 0) {
3191                         j = isl_basic_map_alloc_div(dst);
3192                         if (j < 0)
3193                                 goto error;
3194                         isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
3195                         isl_seq_clr(dst->div[j]+1+1+total,
3196                                                     dst->extra - src->n_div);
3197                         if (add_div_constraints(dst, j) < 0)
3198                                 goto error;
3199                 }
3200                 if (j != i)
3201                         swap_div(dst, i, j);
3202         }
3203         return dst;
3204 error:
3205         isl_basic_map_free(dst);
3206         return NULL;
3207 }
3208
3209 struct isl_map *isl_map_align_divs(struct isl_map *map)
3210 {
3211         int i;
3212
3213         map = isl_map_compute_divs(map);
3214         map = isl_map_cow(map);
3215         if (!map)
3216                 return NULL;
3217
3218         for (i = 1; i < map->n; ++i)
3219                 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3220         for (i = 1; i < map->n; ++i)
3221                 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3222
3223         return map;
3224 }
3225
3226 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3227                 struct isl_basic_map *src, isl_int *c,
3228                 unsigned len, int oppose)
3229 {
3230         struct isl_basic_map *copy = NULL;
3231         int is_empty;
3232         int k;
3233         unsigned total;
3234
3235         copy = isl_basic_map_copy(src);
3236         copy = isl_basic_map_cow(copy);
3237         if (!copy)
3238                 goto error;
3239         copy = isl_basic_map_extend(copy,
3240                 copy->nparam, copy->n_in, copy->n_out, 0, 0, 1);
3241         k = isl_basic_map_alloc_inequality(copy);
3242         if (k < 0)
3243                 goto error;
3244         if (oppose)
3245                 isl_seq_neg(copy->ineq[k], c, len);
3246         else
3247                 isl_seq_cpy(copy->ineq[k], c, len);
3248         total = 1 + copy->nparam + copy->n_in + copy->n_out + copy->extra;
3249         isl_seq_clr(copy->ineq[k]+len, total - len);
3250         isl_inequality_negate(copy, k);
3251         copy = isl_basic_map_simplify(copy);
3252         copy = isl_basic_map_finalize(copy);
3253         is_empty = isl_basic_map_is_empty(copy);
3254         if (is_empty < 0)
3255                 goto error;
3256         if (!is_empty)
3257                 dst = isl_map_add(dst, copy);
3258         else
3259                 isl_basic_map_free(copy);
3260         return dst;
3261 error:
3262         isl_basic_map_free(copy);
3263         isl_map_free(dst);
3264         return NULL;
3265 }
3266
3267 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3268 {
3269         int i, j, k;
3270         unsigned flags = 0;
3271         struct isl_map *rest = NULL;
3272         unsigned max;
3273         unsigned total = bmap->nparam + bmap->n_in + bmap->n_out + bmap->n_div;
3274
3275         assert(bmap);
3276
3277         if (!map)
3278                 goto error;
3279
3280         if (F_ISSET(map, ISL_MAP_DISJOINT))
3281                 FL_SET(flags, ISL_MAP_DISJOINT);
3282
3283         max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3284         rest = isl_map_alloc(map->ctx, map->nparam, map->n_in, map->n_out,
3285                                 max, flags);
3286         if (!rest)
3287                 goto error;
3288
3289         for (i = 0; i < map->n; ++i) {
3290                 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3291                 if (!map->p[i])
3292                         goto error;
3293         }
3294
3295         for (j = 0; j < map->n; ++j)
3296                 map->p[j] = isl_basic_map_cow(map->p[j]);
3297
3298         for (i = 0; i < bmap->n_eq; ++i) {
3299                 for (j = 0; j < map->n; ++j) {
3300                         rest = add_cut_constraint(rest,
3301                                 map->p[j], bmap->eq[i], 1+total, 0);
3302                         if (!rest)
3303                                 goto error;
3304
3305                         rest = add_cut_constraint(rest,
3306                                 map->p[j], bmap->eq[i], 1+total, 1);
3307                         if (!rest)
3308                                 goto error;
3309
3310                         map->p[j] = isl_basic_map_extend(map->p[j],
3311                                 map->p[j]->nparam, map->p[j]->n_in,
3312                                 map->p[j]->n_out, 0, 1, 0);
3313                         if (!map->p[j])
3314                                 goto error;
3315                         k = isl_basic_map_alloc_equality(map->p[j]);
3316                         if (k < 0)
3317                                 goto error;
3318                         isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3319                         isl_seq_clr(map->p[j]->eq[k]+1+total,
3320                                         map->p[j]->extra - bmap->n_div);
3321                 }
3322         }
3323
3324         for (i = 0; i < bmap->n_ineq; ++i) {
3325                 for (j = 0; j < map->n; ++j) {
3326                         rest = add_cut_constraint(rest,
3327                                 map->p[j], bmap->ineq[i], 1+total, 0);
3328                         if (!rest)
3329                                 goto error;
3330
3331                         map->p[j] = isl_basic_map_extend(map->p[j],
3332                                 map->p[j]->nparam, map->p[j]->n_in,
3333                                 map->p[j]->n_out, 0, 0, 1);
3334                         if (!map->p[j])
3335                                 goto error;
3336                         k = isl_basic_map_alloc_inequality(map->p[j]);
3337                         if (k < 0)
3338                                 goto error;
3339                         isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3340                         isl_seq_clr(map->p[j]->ineq[k]+1+total,
3341                                         map->p[j]->extra - bmap->n_div);
3342                 }
3343         }
3344
3345         isl_map_free(map);
3346         return rest;
3347 error:
3348         isl_map_free(map);
3349         isl_map_free(rest);
3350         return NULL;
3351 }
3352
3353 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3354 {
3355         int i;
3356         if (!map1 || !map2)
3357                 goto error;
3358
3359         isl_assert(map1->ctx, map1->nparam == map2->nparam, goto error);
3360         isl_assert(map1->ctx, map1->n_in == map2->n_in, goto error);
3361         isl_assert(map1->ctx, map1->n_out == map2->n_out, goto error);
3362
3363         if (isl_map_is_empty(map2)) {
3364                 isl_map_free(map2);
3365                 return map1;
3366         }
3367
3368         map1 = isl_map_compute_divs(map1);
3369         map2 = isl_map_compute_divs(map2);
3370         if (!map1 || !map2)
3371                 goto error;
3372
3373         for (i = 0; map1 && i < map2->n; ++i)
3374                 map1 = subtract(map1, map2->p[i]);
3375
3376         isl_map_free(map2);
3377         return map1;
3378 error:
3379         isl_map_free(map1);
3380         isl_map_free(map2);
3381         return NULL;
3382 }
3383
3384 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3385 {
3386         return (struct isl_set *)
3387                 isl_map_subtract(
3388                         (struct isl_map *)set1, (struct isl_map *)set2);
3389 }
3390
3391 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3392 {
3393         if (!set || !map)
3394                 goto error;
3395         isl_assert(set->ctx, set->dim == map->n_in, goto error);
3396         map = isl_map_intersect_domain(map, set);
3397         set = isl_map_range(map);
3398         return set;
3399 error:
3400         isl_set_free(set);
3401         isl_map_free(map);
3402         return NULL;
3403 }
3404
3405 /* There is no need to cow as removing empty parts doesn't change
3406  * the meaning of the set.
3407  */
3408 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3409 {
3410         int i;
3411
3412         if (!map)
3413                 return NULL;
3414
3415         for (i = map->n-1; i >= 0; --i) {
3416                 if (!F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3417                         continue;
3418                 isl_basic_map_free(map->p[i]);
3419                 if (i != map->n-1)
3420                         map->p[i] = map->p[map->n-1];
3421                 map->n--;
3422         }
3423
3424         return map;
3425 }
3426
3427 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
3428 {
3429         return (struct isl_set *)
3430                 isl_map_remove_empty_parts((struct isl_map *)set);
3431 }