isl_map_simplify.c

   1 /*
   2  * Copyright 2008-2009 Katholieke Universiteit Leuven
   3  * Copyright 2012      Ecole Normale Superieure
   4  *
   5  * Use of this software is governed by the MIT license
   6  *
   7  * Written by Sven Verdoolaege, K.U.Leuven, Departement
   8  * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
   9  * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
  10  */
  11
  12 #include <strings.h>
  13 #include <isl_ctx_private.h>
  14 #include <isl_map_private.h>
  15 #include "isl_equalities.h"
  16 #include <isl/map.h>
  17 #include <isl/seq.h>
  18 #include "isl_tab.h"
  19 #include <isl_space_private.h>
  20 #include <isl_mat_private.h>
  21
  22 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
  23 {
  24         isl_int *t = bmap->eq[a];
  25         bmap->eq[a] = bmap->eq[b];
  26         bmap->eq[b] = t;
  27 }
  28
  29 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
  30 {
  31         if (a != b) {
  32                 isl_int *t = bmap->ineq[a];
  33                 bmap->ineq[a] = bmap->ineq[b];
  34                 bmap->ineq[b] = t;
  35         }
  36 }
  37
  38 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
  39 {
  40         isl_seq_cpy(c, c + n, rem);
  41         isl_seq_clr(c + rem, n);
  42 }
  43
  44 /* Drop n dimensions starting at first.
  45  *
  46  * In principle, this frees up some extra variables as the number
  47  * of columns remains constant, but we would have to extend
  48  * the div array too as the number of rows in this array is assumed
  49  * to be equal to extra.
  50  */
  51 struct isl_basic_set *isl_basic_set_drop_dims(
  52                 struct isl_basic_set *bset, unsigned first, unsigned n)
  53 {
  54         int i;
  55
  56         if (!bset)
  57                 goto error;
  58
  59         isl_assert(bset->ctx, first + n <= bset->dim->n_out, goto error);
  60
  61         if (n == 0 && !isl_space_get_tuple_name(bset->dim, isl_dim_set))
  62                 return bset;
  63
  64         bset = isl_basic_set_cow(bset);
  65         if (!bset)
  66                 return NULL;
  67
  68         for (i = 0; i < bset->n_eq; ++i)
  69                 constraint_drop_vars(bset->eq[i]+1+bset->dim->nparam+first, n,
  70                                      (bset->dim->n_out-first-n)+bset->extra);
  71
  72         for (i = 0; i < bset->n_ineq; ++i)
  73                 constraint_drop_vars(bset->ineq[i]+1+bset->dim->nparam+first, n,
  74                                      (bset->dim->n_out-first-n)+bset->extra);
  75
  76         for (i = 0; i < bset->n_div; ++i)
  77                 constraint_drop_vars(bset->div[i]+1+1+bset->dim->nparam+first, n,
  78                                      (bset->dim->n_out-first-n)+bset->extra);
  79
  80         bset->dim = isl_space_drop_outputs(bset->dim, first, n);
  81         if (!bset->dim)
  82                 goto error;
  83
  84         ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
  85         bset = isl_basic_set_simplify(bset);
  86         return isl_basic_set_finalize(bset);
  87 error:
  88         isl_basic_set_free(bset);
  89         return NULL;
  90 }
  91
  92 struct isl_set *isl_set_drop_dims(
  93                 struct isl_set *set, unsigned first, unsigned n)
  94 {
  95         int i;
  96
  97         if (!set)
  98                 goto error;
  99
 100         isl_assert(set->ctx, first + n <= set->dim->n_out, goto error);
 101
 102         if (n == 0 && !isl_space_get_tuple_name(set->dim, isl_dim_set))
 103                 return set;
 104         set = isl_set_cow(set);
 105         if (!set)
 106                 goto error;
 107         set->dim = isl_space_drop_outputs(set->dim, first, n);
 108         if (!set->dim)
 109                 goto error;
 110
 111         for (i = 0; i < set->n; ++i) {
 112                 set->p[i] = isl_basic_set_drop_dims(set->p[i], first, n);
 113                 if (!set->p[i])
 114                         goto error;
 115         }
 116
 117         ISL_F_CLR(set, ISL_SET_NORMALIZED);
 118         return set;
 119 error:
 120         isl_set_free(set);
 121         return NULL;
 122 }
 123
 124 /* Move "n" divs starting at "first" to the end of the list of divs.
 125  */
 126 static struct isl_basic_map *move_divs_last(struct isl_basic_map *bmap,
 127         unsigned first, unsigned n)
 128 {
 129         isl_int **div;
 130         int i;
 131
 132         if (first + n == bmap->n_div)
 133                 return bmap;
 134
 135         div = isl_alloc_array(bmap->ctx, isl_int *, n);
 136         if (!div)
 137                 goto error;
 138         for (i = 0; i < n; ++i)
 139                 div[i] = bmap->div[first + i];
 140         for (i = 0; i < bmap->n_div - first - n; ++i)
 141                 bmap->div[first + i] = bmap->div[first + n + i];
 142         for (i = 0; i < n; ++i)
 143                 bmap->div[bmap->n_div - n + i] = div[i];
 144         free(div);
 145         return bmap;
 146 error:
 147         isl_basic_map_free(bmap);
 148         return NULL;
 149 }
 150
 151 /* Drop "n" dimensions of type "type" starting at "first".
 152  *
 153  * In principle, this frees up some extra variables as the number
 154  * of columns remains constant, but we would have to extend
 155  * the div array too as the number of rows in this array is assumed
 156  * to be equal to extra.
 157  */
 158 struct isl_basic_map *isl_basic_map_drop(struct isl_basic_map *bmap,
 159         enum isl_dim_type type, unsigned first, unsigned n)
 160 {
 161         int i;
 162         unsigned dim;
 163         unsigned offset;
 164         unsigned left;
 165
 166         if (!bmap)
 167                 goto error;
 168
 169         dim = isl_basic_map_dim(bmap, type);
 170         isl_assert(bmap->ctx, first + n <= dim, goto error);
 171
 172         if (n == 0 && !isl_space_is_named_or_nested(bmap->dim, type))
 173                 return bmap;
 174
 175         bmap = isl_basic_map_cow(bmap);
 176         if (!bmap)
 177                 return NULL;
 178
 179         offset = isl_basic_map_offset(bmap, type) + first;
 180         left = isl_basic_map_total_dim(bmap) - (offset - 1) - n;
 181         for (i = 0; i < bmap->n_eq; ++i)
 182                 constraint_drop_vars(bmap->eq[i]+offset, n, left);
 183
 184         for (i = 0; i < bmap->n_ineq; ++i)
 185                 constraint_drop_vars(bmap->ineq[i]+offset, n, left);
 186
 187         for (i = 0; i < bmap->n_div; ++i)
 188                 constraint_drop_vars(bmap->div[i]+1+offset, n, left);
 189
 190         if (type == isl_dim_div) {
 191                 bmap = move_divs_last(bmap, first, n);
 192                 if (!bmap)
 193                         goto error;
 194                 isl_basic_map_free_div(bmap, n);
 195         } else
 196                 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
 197         if (!bmap->dim)
 198                 goto error;
 199
 200         ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
 201         bmap = isl_basic_map_simplify(bmap);
 202         return isl_basic_map_finalize(bmap);
 203 error:
 204         isl_basic_map_free(bmap);
 205         return NULL;
 206 }
 207
 208 __isl_give isl_basic_set *isl_basic_set_drop(__isl_take isl_basic_set *bset,
 209         enum isl_dim_type type, unsigned first, unsigned n)
 210 {
 211         return (isl_basic_set *)isl_basic_map_drop((isl_basic_map *)bset,
 212                                                         type, first, n);
 213 }
 214
 215 struct isl_basic_map *isl_basic_map_drop_inputs(
 216                 struct isl_basic_map *bmap, unsigned first, unsigned n)
 217 {
 218         return isl_basic_map_drop(bmap, isl_dim_in, first, n);
 219 }
 220
 221 struct isl_map *isl_map_drop(struct isl_map *map,
 222         enum isl_dim_type type, unsigned first, unsigned n)
 223 {
 224         int i;
 225
 226         if (!map)
 227                 goto error;
 228
 229         isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
 230
 231         if (n == 0 && !isl_space_get_tuple_name(map->dim, type))
 232                 return map;
 233         map = isl_map_cow(map);
 234         if (!map)
 235                 goto error;
 236         map->dim = isl_space_drop_dims(map->dim, type, first, n);
 237         if (!map->dim)
 238                 goto error;
 239
 240         for (i = 0; i < map->n; ++i) {
 241                 map->p[i] = isl_basic_map_drop(map->p[i], type, first, n);
 242                 if (!map->p[i])
 243                         goto error;
 244         }
 245         ISL_F_CLR(map, ISL_MAP_NORMALIZED);
 246
 247         return map;
 248 error:
 249         isl_map_free(map);
 250         return NULL;
 251 }
 252
 253 struct isl_set *isl_set_drop(struct isl_set *set,
 254         enum isl_dim_type type, unsigned first, unsigned n)
 255 {
 256         return (isl_set *)isl_map_drop((isl_map *)set, type, first, n);
 257 }
 258
 259 struct isl_map *isl_map_drop_inputs(
 260                 struct isl_map *map, unsigned first, unsigned n)
 261 {
 262         return isl_map_drop(map, isl_dim_in, first, n);
 263 }
 264
 265 /*
 266  * We don't cow, as the div is assumed to be redundant.
 267  */
 268 static struct isl_basic_map *isl_basic_map_drop_div(
 269                 struct isl_basic_map *bmap, unsigned div)
 270 {
 271         int i;
 272         unsigned pos;
 273
 274         if (!bmap)
 275                 goto error;
 276
 277         pos = 1 + isl_space_dim(bmap->dim, isl_dim_all) + div;
 278
 279         isl_assert(bmap->ctx, div < bmap->n_div, goto error);
 280
 281         for (i = 0; i < bmap->n_eq; ++i)
 282                 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
 283
 284         for (i = 0; i < bmap->n_ineq; ++i) {
 285                 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
 286                         isl_basic_map_drop_inequality(bmap, i);
 287                         --i;
 288                         continue;
 289                 }
 290                 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
 291         }
 292
 293         for (i = 0; i < bmap->n_div; ++i)
 294                 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
 295
 296         if (div != bmap->n_div - 1) {
 297                 int j;
 298                 isl_int *t = bmap->div[div];
 299
 300                 for (j = div; j < bmap->n_div - 1; ++j)
 301                         bmap->div[j] = bmap->div[j+1];
 302
 303                 bmap->div[bmap->n_div - 1] = t;
 304         }
 305         ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
 306         isl_basic_map_free_div(bmap, 1);
 307
 308         return bmap;
 309 error:
 310         isl_basic_map_free(bmap);
 311         return NULL;
 312 }
 313
 314 struct isl_basic_map *isl_basic_map_normalize_constraints(
 315         struct isl_basic_map *bmap)
 316 {
 317         int i;
 318         isl_int gcd;
 319         unsigned total = isl_basic_map_total_dim(bmap);
 320
 321         if (!bmap)
 322                 return NULL;
 323
 324         isl_int_init(gcd);
 325         for (i = bmap->n_eq - 1; i >= 0; --i) {
 326                 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
 327                 if (isl_int_is_zero(gcd)) {
 328                         if (!isl_int_is_zero(bmap->eq[i][0])) {
 329                                 bmap = isl_basic_map_set_to_empty(bmap);
 330                                 break;
 331                         }
 332                         isl_basic_map_drop_equality(bmap, i);
 333                         continue;
 334                 }
 335                 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
 336                         isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
 337                 if (isl_int_is_one(gcd))
 338                         continue;
 339                 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
 340                         bmap = isl_basic_map_set_to_empty(bmap);
 341                         break;
 342                 }
 343                 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
 344         }
 345
 346         for (i = bmap->n_ineq - 1; i >= 0; --i) {
 347                 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
 348                 if (isl_int_is_zero(gcd)) {
 349                         if (isl_int_is_neg(bmap->ineq[i][0])) {
 350                                 bmap = isl_basic_map_set_to_empty(bmap);
 351                                 break;
 352                         }
 353                         isl_basic_map_drop_inequality(bmap, i);
 354                         continue;
 355                 }
 356                 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
 357                         isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
 358                 if (isl_int_is_one(gcd))
 359                         continue;
 360                 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
 361                 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
 362         }
 363         isl_int_clear(gcd);
 364
 365         return bmap;
 366 }
 367
 368 struct isl_basic_set *isl_basic_set_normalize_constraints(
 369         struct isl_basic_set *bset)
 370 {
 371         return (struct isl_basic_set *)isl_basic_map_normalize_constraints(
 372                 (struct isl_basic_map *)bset);
 373 }
 374
 375 /* Remove any common factor in numerator and denominator of the div expression,
 376  * not taking into account the constant term.
 377  * That is, if the div is of the form
 378  *
 379  *      floor((a + m f(x))/(m d))
 380  *
 381  * then replace it by
 382  *
 383  *      floor((floor(a/m) + f(x))/d)
 384  *
 385  * The difference {a/m}/d in the argument satisfies 0 <= {a/m}/d < 1/d
 386  * and can therefore not influence the result of the floor.
 387  */
 388 static void normalize_div_expression(__isl_keep isl_basic_map *bmap, int div)
 389 {
 390         unsigned total = isl_basic_map_total_dim(bmap);
 391         isl_ctx *ctx = bmap->ctx;
 392
 393         if (isl_int_is_zero(bmap->div[div][0]))
 394                 return;
 395         isl_seq_gcd(bmap->div[div] + 2, total, &ctx->normalize_gcd);
 396         isl_int_gcd(ctx->normalize_gcd, ctx->normalize_gcd, bmap->div[div][0]);
 397         if (isl_int_is_one(ctx->normalize_gcd))
 398                 return;
 399         isl_int_fdiv_q(bmap->div[div][1], bmap->div[div][1],
 400                         ctx->normalize_gcd);
 401         isl_int_divexact(bmap->div[div][0], bmap->div[div][0],
 402                         ctx->normalize_gcd);
 403         isl_seq_scale_down(bmap->div[div] + 2, bmap->div[div] + 2,
 404                         ctx->normalize_gcd, total);
 405 }
 406
 407 /* Remove any common factor in numerator and denominator of a div expression,
 408  * not taking into account the constant term.
 409  * That is, look for any div of the form
 410  *
 411  *      floor((a + m f(x))/(m d))
 412  *
 413  * and replace it by
 414  *
 415  *      floor((floor(a/m) + f(x))/d)
 416  *
 417  * The difference {a/m}/d in the argument satisfies 0 <= {a/m}/d < 1/d
 418  * and can therefore not influence the result of the floor.
 419  */
 420 static __isl_give isl_basic_map *normalize_div_expressions(
 421         __isl_take isl_basic_map *bmap)
 422 {
 423         int i;
 424
 425         if (!bmap)
 426                 return NULL;
 427         if (bmap->n_div == 0)
 428                 return bmap;
 429
 430         for (i = 0; i < bmap->n_div; ++i)
 431                 normalize_div_expression(bmap, i);
 432
 433         return bmap;
 434 }
 435
 436 /* Assumes divs have been ordered if keep_divs is set.
 437  */
 438 static void eliminate_var_using_equality(struct isl_basic_map *bmap,
 439         unsigned pos, isl_int *eq, int keep_divs, int *progress)
 440 {
 441         unsigned total;
 442         unsigned space_total;
 443         int k;
 444         int last_div;
 445
 446         total = isl_basic_map_total_dim(bmap);
 447         space_total = isl_space_dim(bmap->dim, isl_dim_all);
 448         last_div = isl_seq_last_non_zero(eq + 1 + space_total, bmap->n_div);
 449         for (k = 0; k < bmap->n_eq; ++k) {
 450                 if (bmap->eq[k] == eq)
 451                         continue;
 452                 if (isl_int_is_zero(bmap->eq[k][1+pos]))
 453                         continue;
 454                 if (progress)
 455                         *progress = 1;
 456                 isl_seq_elim(bmap->eq[k], eq, 1+pos, 1+total, NULL);
 457                 isl_seq_normalize(bmap->ctx, bmap->eq[k], 1 + total);
 458         }
 459
 460         for (k = 0; k < bmap->n_ineq; ++k) {
 461                 if (isl_int_is_zero(bmap->ineq[k][1+pos]))
 462                         continue;
 463                 if (progress)
 464                         *progress = 1;
 465                 isl_seq_elim(bmap->ineq[k], eq, 1+pos, 1+total, NULL);
 466                 isl_seq_normalize(bmap->ctx, bmap->ineq[k], 1 + total);
 467                 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
 468         }
 469
 470         for (k = 0; k < bmap->n_div; ++k) {
 471                 if (isl_int_is_zero(bmap->div[k][0]))
 472                         continue;
 473                 if (isl_int_is_zero(bmap->div[k][1+1+pos]))
 474                         continue;
 475                 if (progress)
 476                         *progress = 1;
 477                 /* We need to be careful about circular definitions,
 478                  * so for now we just remove the definition of div k
 479                  * if the equality contains any divs.
 480                  * If keep_divs is set, then the divs have been ordered
 481                  * and we can keep the definition as long as the result
 482                  * is still ordered.
 483                  */
 484                 if (last_div == -1 || (keep_divs && last_div < k)) {
 485                         isl_seq_elim(bmap->div[k]+1, eq,
 486                                         1+pos, 1+total, &bmap->div[k][0]);
 487                         normalize_div_expression(bmap, k);
 488                 } else
 489                         isl_seq_clr(bmap->div[k], 1 + total);
 490                 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
 491         }
 492 }
 493
 494 /* Assumes divs have been ordered if keep_divs is set.
 495  */
 496 static void eliminate_div(struct isl_basic_map *bmap, isl_int *eq,
 497         unsigned div, int keep_divs)
 498 {
 499         unsigned pos = isl_space_dim(bmap->dim, isl_dim_all) + div;
 500
 501         eliminate_var_using_equality(bmap, pos, eq, keep_divs, NULL);
 502
 503         isl_basic_map_drop_div(bmap, div);
 504 }
 505
 506 /* Check if elimination of div "div" using equality "eq" would not
 507  * result in a div depending on a later div.
 508  */
 509 static int ok_to_eliminate_div(struct isl_basic_map *bmap, isl_int *eq,
 510         unsigned div)
 511 {
 512         int k;
 513         int last_div;
 514         unsigned space_total = isl_space_dim(bmap->dim, isl_dim_all);
 515         unsigned pos = space_total + div;
 516
 517         last_div = isl_seq_last_non_zero(eq + 1 + space_total, bmap->n_div);
 518         if (last_div < 0 || last_div <= div)
 519                 return 1;
 520
 521         for (k = 0; k <= last_div; ++k) {
 522                 if (isl_int_is_zero(bmap->div[k][0]))
 523                         return 1;
 524                 if (!isl_int_is_zero(bmap->div[k][1 + 1 + pos]))
 525                         return 0;
 526         }
 527
 528         return 1;
 529 }
 530
 531 /* Elimininate divs based on equalities
 532  */
 533 static struct isl_basic_map *eliminate_divs_eq(
 534                 struct isl_basic_map *bmap, int *progress)
 535 {
 536         int d;
 537         int i;
 538         int modified = 0;
 539         unsigned off;
 540
 541         bmap = isl_basic_map_order_divs(bmap);
 542
 543         if (!bmap)
 544                 return NULL;
 545
 546         off = 1 + isl_space_dim(bmap->dim, isl_dim_all);
 547
 548         for (d = bmap->n_div - 1; d >= 0 ; --d) {
 549                 for (i = 0; i < bmap->n_eq; ++i) {
 550                         if (!isl_int_is_one(bmap->eq[i][off + d]) &&
 551                             !isl_int_is_negone(bmap->eq[i][off + d]))
 552                                 continue;
 553                         if (!ok_to_eliminate_div(bmap, bmap->eq[i], d))
 554                                 continue;
 555                         modified = 1;
 556                         *progress = 1;
 557                         eliminate_div(bmap, bmap->eq[i], d, 1);
 558                         isl_basic_map_drop_equality(bmap, i);
 559                         break;
 560                 }
 561         }
 562         if (modified)
 563                 return eliminate_divs_eq(bmap, progress);
 564         return bmap;
 565 }
 566
 567 /* Elimininate divs based on inequalities
 568  */
 569 static struct isl_basic_map *eliminate_divs_ineq(
 570                 struct isl_basic_map *bmap, int *progress)
 571 {
 572         int d;
 573         int i;
 574         unsigned off;
 575         struct isl_ctx *ctx;
 576
 577         if (!bmap)
 578                 return NULL;
 579
 580         ctx = bmap->ctx;
 581         off = 1 + isl_space_dim(bmap->dim, isl_dim_all);
 582
 583         for (d = bmap->n_div - 1; d >= 0 ; --d) {
 584                 for (i = 0; i < bmap->n_eq; ++i)
 585                         if (!isl_int_is_zero(bmap->eq[i][off + d]))
 586                                 break;
 587                 if (i < bmap->n_eq)
 588                         continue;
 589                 for (i = 0; i < bmap->n_ineq; ++i)
 590                         if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
 591                                 break;
 592                 if (i < bmap->n_ineq)
 593                         continue;
 594                 *progress = 1;
 595                 bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1);
 596                 if (!bmap || ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
 597                         break;
 598                 bmap = isl_basic_map_drop_div(bmap, d);
 599                 if (!bmap)
 600                         break;
 601         }
 602         return bmap;
 603 }
 604
 605 struct isl_basic_map *isl_basic_map_gauss(
 606         struct isl_basic_map *bmap, int *progress)
 607 {
 608         int k;
 609         int done;
 610         int last_var;
 611         unsigned total_var;
 612         unsigned total;
 613
 614         bmap = isl_basic_map_order_divs(bmap);
 615
 616         if (!bmap)
 617                 return NULL;
 618
 619         total = isl_basic_map_total_dim(bmap);
 620         total_var = total - bmap->n_div;
 621
 622         last_var = total - 1;
 623         for (done = 0; done < bmap->n_eq; ++done) {
 624                 for (; last_var >= 0; --last_var) {
 625                         for (k = done; k < bmap->n_eq; ++k)
 626                                 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
 627                                         break;
 628                         if (k < bmap->n_eq)
 629                                 break;
 630                 }
 631                 if (last_var < 0)
 632                         break;
 633                 if (k != done)
 634                         swap_equality(bmap, k, done);
 635                 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
 636                         isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
 637
 638                 eliminate_var_using_equality(bmap, last_var, bmap->eq[done], 1,
 639                                                 progress);
 640
 641                 if (last_var >= total_var &&
 642                     isl_int_is_zero(bmap->div[last_var - total_var][0])) {
 643                         unsigned div = last_var - total_var;
 644                         isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
 645                         isl_int_set_si(bmap->div[div][1+1+last_var], 0);
 646                         isl_int_set(bmap->div[div][0],
 647                                     bmap->eq[done][1+last_var]);
 648                         if (progress)
 649                                 *progress = 1;
 650                         ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
 651                 }
 652         }
 653         if (done == bmap->n_eq)
 654                 return bmap;
 655         for (k = done; k < bmap->n_eq; ++k) {
 656                 if (isl_int_is_zero(bmap->eq[k][0]))
 657                         continue;
 658                 return isl_basic_map_set_to_empty(bmap);
 659         }
 660         isl_basic_map_free_equality(bmap, bmap->n_eq-done);
 661         return bmap;
 662 }
 663
 664 struct isl_basic_set *isl_basic_set_gauss(
 665         struct isl_basic_set *bset, int *progress)
 666 {
 667         return (struct isl_basic_set*)isl_basic_map_gauss(
 668                         (struct isl_basic_map *)bset, progress);
 669 }
 670
 671
 672 static unsigned int round_up(unsigned int v)
 673 {
 674         int old_v = v;
 675
 676         while (v) {
 677                 old_v = v;
 678                 v ^= v & -v;
 679         }
 680         return old_v << 1;
 681 }
 682
 683 static int hash_index(isl_int ***index, unsigned int size, int bits,
 684                         struct isl_basic_map *bmap, int k)
 685 {
 686         int h;
 687         unsigned total = isl_basic_map_total_dim(bmap);
 688         uint32_t hash = isl_seq_get_hash_bits(bmap->ineq[k]+1, total, bits);
 689         for (h = hash; index[h]; h = (h+1) % size)
 690                 if (&bmap->ineq[k] != index[h] &&
 691                     isl_seq_eq(bmap->ineq[k]+1, index[h][0]+1, total))
 692                         break;
 693         return h;
 694 }
 695
 696 static int set_hash_index(isl_int ***index, unsigned int size, int bits,
 697                           struct isl_basic_set *bset, int k)
 698 {
 699         return hash_index(index, size, bits, (struct isl_basic_map *)bset, k);
 700 }
 701
 702 /* If we can eliminate more than one div, then we need to make
 703  * sure we do it from last div to first div, in order not to
 704  * change the position of the other divs that still need to
 705  * be removed.
 706  */
 707 static struct isl_basic_map *remove_duplicate_divs(
 708         struct isl_basic_map *bmap, int *progress)
 709 {
 710         unsigned int size;
 711         int *index;
 712         int *elim_for;
 713         int k, l, h;
 714         int bits;
 715         struct isl_blk eq;
 716         unsigned total_var;
 717         unsigned total;
 718         struct isl_ctx *ctx;
 719
 720         bmap = isl_basic_map_order_divs(bmap);
 721         if (!bmap || bmap->n_div <= 1)
 722                 return bmap;
 723
 724         total_var = isl_space_dim(bmap->dim, isl_dim_all);
 725         total = total_var + bmap->n_div;
 726
 727         ctx = bmap->ctx;
 728         for (k = bmap->n_div - 1; k >= 0; --k)
 729                 if (!isl_int_is_zero(bmap->div[k][0]))
 730                         break;
 731         if (k <= 0)
 732                 return bmap;
 733
 734         elim_for = isl_calloc_array(ctx, int, bmap->n_div);
 735         size = round_up(4 * bmap->n_div / 3 - 1);
 736         bits = ffs(size) - 1;
 737         index = isl_calloc_array(ctx, int, size);
 738         if (!index)
 739                 return bmap;
 740         eq = isl_blk_alloc(ctx, 1+total);
 741         if (isl_blk_is_error(eq))
 742                 goto out;
 743
 744         isl_seq_clr(eq.data, 1+total);
 745         index[isl_seq_get_hash_bits(bmap->div[k], 2+total, bits)] = k + 1;
 746         for (--k; k >= 0; --k) {
 747                 uint32_t hash;
 748
 749                 if (isl_int_is_zero(bmap->div[k][0]))
 750                         continue;
 751
 752                 hash = isl_seq_get_hash_bits(bmap->div[k], 2+total, bits);
 753                 for (h = hash; index[h]; h = (h+1) % size)
 754                         if (isl_seq_eq(bmap->div[k],
 755                                        bmap->div[index[h]-1], 2+total))
 756                                 break;
 757                 if (index[h]) {
 758                         *progress = 1;
 759                         l = index[h] - 1;
 760                         elim_for[l] = k + 1;
 761                 }
 762                 index[h] = k+1;
 763         }
 764         for (l = bmap->n_div - 1; l >= 0; --l) {
 765                 if (!elim_for[l])
 766                         continue;
 767                 k = elim_for[l] - 1;
 768                 isl_int_set_si(eq.data[1+total_var+k], -1);
 769                 isl_int_set_si(eq.data[1+total_var+l], 1);
 770                 eliminate_div(bmap, eq.data, l, 1);
 771                 isl_int_set_si(eq.data[1+total_var+k], 0);
 772                 isl_int_set_si(eq.data[1+total_var+l], 0);
 773         }
 774
 775         isl_blk_free(ctx, eq);
 776 out:
 777         free(index);
 778         free(elim_for);
 779         return bmap;
 780 }
 781
 782 static int n_pure_div_eq(struct isl_basic_map *bmap)
 783 {
 784         int i, j;
 785         unsigned total;
 786
 787         total = isl_space_dim(bmap->dim, isl_dim_all);
 788         for (i = 0, j = bmap->n_div-1; i < bmap->n_eq; ++i) {
 789                 while (j >= 0 && isl_int_is_zero(bmap->eq[i][1 + total + j]))
 790                         --j;
 791                 if (j < 0)
 792                         break;
 793                 if (isl_seq_first_non_zero(bmap->eq[i] + 1 + total, j) != -1)
 794                         return 0;
 795         }
 796         return i;
 797 }
 798
 799 /* Normalize divs that appear in equalities.
 800  *
 801  * In particular, we assume that bmap contains some equalities
 802  * of the form
 803  *
 804  *      a x = m * e_i
 805  *
 806  * and we want to replace the set of e_i by a minimal set and
 807  * such that the new e_i have a canonical representation in terms
 808  * of the vector x.
 809  * If any of the equalities involves more than one divs, then
 810  * we currently simply bail out.
 811  *
 812  * Let us first additionally assume that all equalities involve
 813  * a div.  The equalities then express modulo constraints on the
 814  * remaining variables and we can use "parameter compression"
 815  * to find a minimal set of constraints.  The result is a transformation
 816  *
 817  *      x = T(x') = x_0 + G x'
 818  *
 819  * with G a lower-triangular matrix with all elements below the diagonal
 820  * non-negative and smaller than the diagonal element on the same row.
 821  * We first normalize x_0 by making the same property hold in the affine
 822  * T matrix.
 823  * The rows i of G with a 1 on the diagonal do not impose any modulo
 824  * constraint and simply express x_i = x'_i.
 825  * For each of the remaining rows i, we introduce a div and a corresponding
 826  * equality.  In particular
 827  *
 828  *      g_ii e_j = x_i - g_i(x')
 829  *
 830  * where each x'_k is replaced either by x_k (if g_kk = 1) or the
 831  * corresponding div (if g_kk != 1).
 832  *
 833  * If there are any equalities not involving any div, then we
 834  * first apply a variable compression on the variables x:
 835  *
 836  *      x = C x''       x'' = C_2 x
 837  *
 838  * and perform the above parameter compression on A C instead of on A.
 839  * The resulting compression is then of the form
 840  *
 841  *      x'' = T(x') = x_0 + G x'
 842  *
 843  * and in constructing the new divs and the corresponding equalities,
 844  * we have to replace each x'', i.e., the x'_k with (g_kk = 1),
 845  * by the corresponding row from C_2.
 846  */
 847 static struct isl_basic_map *normalize_divs(
 848         struct isl_basic_map *bmap, int *progress)
 849 {
 850         int i, j, k;
 851         int total;
 852         int div_eq;
 853         struct isl_mat *B;
 854         struct isl_vec *d;
 855         struct isl_mat *T = NULL;
 856         struct isl_mat *C = NULL;
 857         struct isl_mat *C2 = NULL;
 858         isl_int v;
 859         int *pos;
 860         int dropped, needed;
 861
 862         if (!bmap)
 863                 return NULL;
 864
 865         if (bmap->n_div == 0)
 866                 return bmap;
 867
 868         if (bmap->n_eq == 0)
 869                 return bmap;
 870
 871         if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS))
 872                 return bmap;
 873
 874         total = isl_space_dim(bmap->dim, isl_dim_all);
 875         div_eq = n_pure_div_eq(bmap);
 876         if (div_eq == 0)
 877                 return bmap;
 878
 879         if (div_eq < bmap->n_eq) {
 880                 B = isl_mat_sub_alloc6(bmap->ctx, bmap->eq, div_eq,
 881                                         bmap->n_eq - div_eq, 0, 1 + total);
 882                 C = isl_mat_variable_compression(B, &C2);
 883                 if (!C || !C2)
 884                         goto error;
 885                 if (C->n_col == 0) {
 886                         bmap = isl_basic_map_set_to_empty(bmap);
 887                         isl_mat_free(C);
 888                         isl_mat_free(C2);
 889                         goto done;
 890                 }
 891         }
 892
 893         d = isl_vec_alloc(bmap->ctx, div_eq);
 894         if (!d)
 895                 goto error;
 896         for (i = 0, j = bmap->n_div-1; i < div_eq; ++i) {
 897                 while (j >= 0 && isl_int_is_zero(bmap->eq[i][1 + total + j]))
 898                         --j;
 899                 isl_int_set(d->block.data[i], bmap->eq[i][1 + total + j]);
 900         }
 901         B = isl_mat_sub_alloc6(bmap->ctx, bmap->eq, 0, div_eq, 0, 1 + total);
 902
 903         if (C) {
 904                 B = isl_mat_product(B, C);
 905                 C = NULL;
 906         }
 907
 908         T = isl_mat_parameter_compression(B, d);
 909         if (!T)
 910                 goto error;
 911         if (T->n_col == 0) {
 912                 bmap = isl_basic_map_set_to_empty(bmap);
 913                 isl_mat_free(C2);
 914                 isl_mat_free(T);
 915                 goto done;
 916         }
 917         isl_int_init(v);
 918         for (i = 0; i < T->n_row - 1; ++i) {
 919                 isl_int_fdiv_q(v, T->row[1 + i][0], T->row[1 + i][1 + i]);
 920                 if (isl_int_is_zero(v))
 921                         continue;
 922                 isl_mat_col_submul(T, 0, v, 1 + i);
 923         }
 924         isl_int_clear(v);
 925         pos = isl_alloc_array(bmap->ctx, int, T->n_row);
 926         if (!pos)
 927                 goto error;
 928         /* We have to be careful because dropping equalities may reorder them */
 929         dropped = 0;
 930         for (j = bmap->n_div - 1; j >= 0; --j) {
 931                 for (i = 0; i < bmap->n_eq; ++i)
 932                         if (!isl_int_is_zero(bmap->eq[i][1 + total + j]))
 933                                 break;
 934                 if (i < bmap->n_eq) {
 935                         bmap = isl_basic_map_drop_div(bmap, j);
 936                         isl_basic_map_drop_equality(bmap, i);
 937                         ++dropped;
 938                 }
 939         }
 940         pos[0] = 0;
 941         needed = 0;
 942         for (i = 1; i < T->n_row; ++i) {
 943                 if (isl_int_is_one(T->row[i][i]))
 944                         pos[i] = i;
 945                 else
 946                         needed++;
 947         }
 948         if (needed > dropped) {
 949                 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
 950                                 needed, needed, 0);
 951                 if (!bmap)
 952                         goto error;
 953         }
 954         for (i = 1; i < T->n_row; ++i) {
 955                 if (isl_int_is_one(T->row[i][i]))
 956                         continue;
 957                 k = isl_basic_map_alloc_div(bmap);
 958                 pos[i] = 1 + total + k;
 959                 isl_seq_clr(bmap->div[k] + 1, 1 + total + bmap->n_div);
 960                 isl_int_set(bmap->div[k][0], T->row[i][i]);
 961                 if (C2)
 962                         isl_seq_cpy(bmap->div[k] + 1, C2->row[i], 1 + total);
 963                 else
 964                         isl_int_set_si(bmap->div[k][1 + i], 1);
 965                 for (j = 0; j < i; ++j) {
 966                         if (isl_int_is_zero(T->row[i][j]))
 967                                 continue;
 968                         if (pos[j] < T->n_row && C2)
 969                                 isl_seq_submul(bmap->div[k] + 1, T->row[i][j],
 970                                                 C2->row[pos[j]], 1 + total);
 971                         else
 972                                 isl_int_neg(bmap->div[k][1 + pos[j]],
 973                                                                 T->row[i][j]);
 974                 }
 975                 j = isl_basic_map_alloc_equality(bmap);
 976                 isl_seq_neg(bmap->eq[j], bmap->div[k]+1, 1+total+bmap->n_div);
 977                 isl_int_set(bmap->eq[j][pos[i]], bmap->div[k][0]);
 978         }
 979         free(pos);
 980         isl_mat_free(C2);
 981         isl_mat_free(T);
 982
 983         if (progress)
 984                 *progress = 1;
 985 done:
 986         ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
 987
 988         return bmap;
 989 error:
 990         isl_mat_free(C);
 991         isl_mat_free(C2);
 992         isl_mat_free(T);
 993         return bmap;
 994 }
 995
 996 static struct isl_basic_map *set_div_from_lower_bound(
 997         struct isl_basic_map *bmap, int div, int ineq)
 998 {
 999         unsigned total = 1 + isl_space_dim(bmap->dim, isl_dim_all);
1000
1001         isl_seq_neg(bmap->div[div] + 1, bmap->ineq[ineq], total + bmap->n_div);
1002         isl_int_set(bmap->div[div][0], bmap->ineq[ineq][total + div]);
1003         isl_int_add(bmap->div[div][1], bmap->div[div][1], bmap->div[div][0]);
1004         isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
1005         isl_int_set_si(bmap->div[div][1 + total + div], 0);
1006
1007         return bmap;
1008 }
1009
1010 /* Check whether it is ok to define a div based on an inequality.
1011  * To avoid the introduction of circular definitions of divs, we
1012  * do not allow such a definition if the resulting expression would refer to
1013  * any other undefined divs or if any known div is defined in
1014  * terms of the unknown div.
1015  */
1016 static int ok_to_set_div_from_bound(struct isl_basic_map *bmap,
1017         int div, int ineq)
1018 {
1019         int j;
1020         unsigned total = 1 + isl_space_dim(bmap->dim, isl_dim_all);
1021
1022         /* Not defined in terms of unknown divs */
1023         for (j = 0; j < bmap->n_div; ++j) {
1024                 if (div == j)
1025                         continue;
1026                 if (isl_int_is_zero(bmap->ineq[ineq][total + j]))
1027                         continue;
1028                 if (isl_int_is_zero(bmap->div[j][0]))
1029                         return 0;
1030         }
1031
1032         /* No other div defined in terms of this one => avoid loops */
1033         for (j = 0; j < bmap->n_div; ++j) {
1034                 if (div == j)
1035                         continue;
1036                 if (isl_int_is_zero(bmap->div[j][0]))
1037                         continue;
1038                 if (!isl_int_is_zero(bmap->div[j][1 + total + div]))
1039                         return 0;
1040         }
1041
1042         return 1;
1043 }
1044
1045 /* Given two constraints "k" and "l" that are opposite to each other,
1046  * except for the constant term, check if we can use them
1047  * to obtain an expression for one of the hitherto unknown divs.
1048  * "sum" is the sum of the constant terms of the constraints.
1049  * If this sum is strictly smaller than the coefficient of one
1050  * of the divs, then this pair can be used define the div.
1051  * To avoid the introduction of circular definitions of divs, we
1052  * do not use the pair if the resulting expression would refer to
1053  * any other undefined divs or if any known div is defined in
1054  * terms of the unknown div.
1055  */
1056 static struct isl_basic_map *check_for_div_constraints(
1057         struct isl_basic_map *bmap, int k, int l, isl_int sum, int *progress)
1058 {
1059         int i;
1060         unsigned total = 1 + isl_space_dim(bmap->dim, isl_dim_all);
1061
1062         for (i = 0; i < bmap->n_div; ++i) {
1063                 if (!isl_int_is_zero(bmap->div[i][0]))
1064                         continue;
1065                 if (isl_int_is_zero(bmap->ineq[k][total + i]))
1066                         continue;
1067                 if (isl_int_abs_ge(sum, bmap->ineq[k][total + i]))
1068                         continue;
1069                 if (!ok_to_set_div_from_bound(bmap, i, k))
1070                         break;
1071                 if (isl_int_is_pos(bmap->ineq[k][total + i]))
1072                         bmap = set_div_from_lower_bound(bmap, i, k);
1073                 else
1074                         bmap = set_div_from_lower_bound(bmap, i, l);
1075                 if (progress)
1076                         *progress = 1;
1077                 break;
1078         }
1079         return bmap;
1080 }
1081
1082 static struct isl_basic_map *remove_duplicate_constraints(
1083         struct isl_basic_map *bmap, int *progress, int detect_divs)
1084 {
1085         unsigned int size;
1086         isl_int ***index;
1087         int k, l, h;
1088         int bits;
1089         unsigned total = isl_basic_map_total_dim(bmap);
1090         isl_int sum;
1091         isl_ctx *ctx;
1092
1093         if (!bmap || bmap->n_ineq <= 1)
1094                 return bmap;
1095
1096         size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
1097         bits = ffs(size) - 1;
1098         ctx = isl_basic_map_get_ctx(bmap);
1099         index = isl_calloc_array(ctx, isl_int **, size);
1100         if (!index)
1101                 return bmap;
1102
1103         index[isl_seq_get_hash_bits(bmap->ineq[0]+1, total, bits)] = &bmap->ineq[0];
1104         for (k = 1; k < bmap->n_ineq; ++k) {
1105                 h = hash_index(index, size, bits, bmap, k);
1106                 if (!index[h]) {
1107                         index[h] = &bmap->ineq[k];
1108                         continue;
1109                 }
1110                 if (progress)
1111                         *progress = 1;
1112                 l = index[h] - &bmap->ineq[0];
1113                 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
1114                         swap_inequality(bmap, k, l);
1115                 isl_basic_map_drop_inequality(bmap, k);
1116                 --k;
1117         }
1118         isl_int_init(sum);
1119         for (k = 0; k < bmap->n_ineq-1; ++k) {
1120                 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1121                 h = hash_index(index, size, bits, bmap, k);
1122                 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1123                 if (!index[h])
1124                         continue;
1125                 l = index[h] - &bmap->ineq[0];
1126                 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
1127                 if (isl_int_is_pos(sum)) {
1128                         if (detect_divs)
1129                                 bmap = check_for_div_constraints(bmap, k, l,
1130                                                                  sum, progress);
1131                         continue;
1132                 }
1133                 if (isl_int_is_zero(sum)) {
1134                         /* We need to break out of the loop after these
1135                          * changes since the contents of the hash
1136                          * will no longer be valid.
1137                          * Plus, we probably we want to regauss first.
1138                          */
1139                         if (progress)
1140                                 *progress = 1;
1141                         isl_basic_map_drop_inequality(bmap, l);
1142                         isl_basic_map_inequality_to_equality(bmap, k);
1143                 } else
1144                         bmap = isl_basic_map_set_to_empty(bmap);
1145                 break;
1146         }
1147         isl_int_clear(sum);
1148
1149         free(index);
1150         return bmap;
1151 }
1152
1153
1154 /* Eliminate knowns divs from constraints where they appear with
1155  * a (positive or negative) unit coefficient.
1156  *
1157  * That is, replace
1158  *
1159  *      floor(e/m) + f >= 0
1160  *
1161  * by
1162  *
1163  *      e + m f >= 0
1164  *
1165  * and
1166  *
1167  *      -floor(e/m) + f >= 0
1168  *
1169  * by
1170  *
1171  *      -e + m f + m - 1 >= 0
1172  *
1173  * The first conversion is valid because floor(e/m) >= -f is equivalent
1174  * to e/m >= -f because -f is an integral expression.
1175  * The second conversion follows from the fact that
1176  *
1177  *      -floor(e/m) = ceil(-e/m) = floor((-e + m - 1)/m)
1178  *
1179  *
1180  * We skip integral divs, i.e., those with denominator 1, as we would
1181  * risk eliminating the div from the div constraints.  We do not need
1182  * to handle those divs here anyway since the div constraints will turn
1183  * out to form an equality and this equality can then be use to eliminate
1184  * the div from all constraints.
1185  */
1186 static __isl_give isl_basic_map *eliminate_unit_divs(
1187         __isl_take isl_basic_map *bmap, int *progress)
1188 {
1189         int i, j;
1190         isl_ctx *ctx;
1191         unsigned total;
1192
1193         if (!bmap)
1194                 return NULL;
1195
1196         ctx = isl_basic_map_get_ctx(bmap);
1197         total = 1 + isl_space_dim(bmap->dim, isl_dim_all);
1198
1199         for (i = 0; i < bmap->n_div; ++i) {
1200                 if (isl_int_is_zero(bmap->div[i][0]))
1201                         continue;
1202                 if (isl_int_is_one(bmap->div[i][0]))
1203                         continue;
1204                 for (j = 0; j < bmap->n_ineq; ++j) {
1205                         int s;
1206
1207                         if (!isl_int_is_one(bmap->ineq[j][total + i]) &&
1208                             !isl_int_is_negone(bmap->ineq[j][total + i]))
1209                                 continue;
1210
1211                         *progress = 1;
1212
1213                         s = isl_int_sgn(bmap->ineq[j][total + i]);
1214                         isl_int_set_si(bmap->ineq[j][total + i], 0);
1215                         if (s < 0)
1216                                 isl_seq_combine(bmap->ineq[j],
1217                                         ctx->negone, bmap->div[i] + 1,
1218                                         bmap->div[i][0], bmap->ineq[j],
1219                                         total + bmap->n_div);
1220                         else
1221                                 isl_seq_combine(bmap->ineq[j],
1222                                         ctx->one, bmap->div[i] + 1,
1223                                         bmap->div[i][0], bmap->ineq[j],
1224                                         total + bmap->n_div);
1225                         if (s < 0) {
1226                                 isl_int_add(bmap->ineq[j][0],
1227                                         bmap->ineq[j][0], bmap->div[i][0]);
1228                                 isl_int_sub_ui(bmap->ineq[j][0],
1229                                         bmap->ineq[j][0], 1);
1230                         }
1231                 }
1232         }
1233
1234         return bmap;
1235 }
1236
1237 struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap)
1238 {
1239         int progress = 1;
1240         if (!bmap)
1241                 return NULL;
1242         while (progress) {
1243                 progress = 0;
1244                 bmap = isl_basic_map_normalize_constraints(bmap);
1245                 bmap = normalize_div_expressions(bmap);
1246                 bmap = remove_duplicate_divs(bmap, &progress);
1247                 bmap = eliminate_unit_divs(bmap, &progress);
1248                 bmap = eliminate_divs_eq(bmap, &progress);
1249                 bmap = eliminate_divs_ineq(bmap, &progress);
1250                 bmap = isl_basic_map_gauss(bmap, &progress);
1251                 /* requires equalities in normal form */
1252                 bmap = normalize_divs(bmap, &progress);
1253                 bmap = remove_duplicate_constraints(bmap, &progress, 1);
1254         }
1255         return bmap;
1256 }
1257
1258 struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset)
1259 {
1260         return (struct isl_basic_set *)
1261                 isl_basic_map_simplify((struct isl_basic_map *)bset);
1262 }
1263
1264
1265 int isl_basic_map_is_div_constraint(__isl_keep isl_basic_map *bmap,
1266         isl_int *constraint, unsigned div)
1267 {
1268         unsigned pos;
1269
1270         if (!bmap)
1271                 return -1;
1272
1273         pos = 1 + isl_space_dim(bmap->dim, isl_dim_all) + div;
1274
1275         if (isl_int_eq(constraint[pos], bmap->div[div][0])) {
1276                 int neg;
1277                 isl_int_sub(bmap->div[div][1],
1278                                 bmap->div[div][1], bmap->div[div][0]);
1279                 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
1280                 neg = isl_seq_is_neg(constraint, bmap->div[div]+1, pos);
1281                 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
1282                 isl_int_add(bmap->div[div][1],
1283                                 bmap->div[div][1], bmap->div[div][0]);
1284                 if (!neg)
1285                         return 0;
1286                 if (isl_seq_first_non_zero(constraint+pos+1,
1287                                             bmap->n_div-div-1) != -1)
1288                         return 0;
1289         } else if (isl_int_abs_eq(constraint[pos], bmap->div[div][0])) {
1290                 if (!isl_seq_eq(constraint, bmap->div[div]+1, pos))
1291                         return 0;
1292                 if (isl_seq_first_non_zero(constraint+pos+1,
1293                                             bmap->n_div-div-1) != -1)
1294                         return 0;
1295         } else
1296                 return 0;
1297
1298         return 1;
1299 }
1300
1301 int isl_basic_set_is_div_constraint(__isl_keep isl_basic_set *bset,
1302         isl_int *constraint, unsigned div)
1303 {
1304         return isl_basic_map_is_div_constraint(bset, constraint, div);
1305 }
1306
1307
1308 /* If the only constraints a div d=floor(f/m)
1309  * appears in are its two defining constraints
1310  *
1311  *      f - m d >=0
1312  *      -(f - (m - 1)) + m d >= 0
1313  *
1314  * then it can safely be removed.
1315  */
1316 static int div_is_redundant(struct isl_basic_map *bmap, int div)
1317 {
1318         int i;
1319         unsigned pos = 1 + isl_space_dim(bmap->dim, isl_dim_all) + div;
1320
1321         for (i = 0; i < bmap->n_eq; ++i)
1322                 if (!isl_int_is_zero(bmap->eq[i][pos]))
1323                         return 0;
1324
1325         for (i = 0; i < bmap->n_ineq; ++i) {
1326                 if (isl_int_is_zero(bmap->ineq[i][pos]))
1327                         continue;
1328                 if (!isl_basic_map_is_div_constraint(bmap, bmap->ineq[i], div))
1329                         return 0;
1330         }
1331
1332         for (i = 0; i < bmap->n_div; ++i)
1333                 if (!isl_int_is_zero(bmap->div[i][1+pos]))
1334                         return 0;
1335
1336         return 1;
1337 }
1338
1339 /*
1340  * Remove divs that don't occur in any of the constraints or other divs.
1341  * These can arise when dropping some of the variables in a quast
1342  * returned by piplib.
1343  */
1344 static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap)
1345 {
1346         int i;
1347
1348         if (!bmap)
1349                 return NULL;
1350
1351         for (i = bmap->n_div-1; i >= 0; --i) {
1352                 if (!div_is_redundant(bmap, i))
1353                         continue;
1354                 bmap = isl_basic_map_drop_div(bmap, i);
1355         }
1356         return bmap;
1357 }
1358
1359 struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap)
1360 {
1361         bmap = remove_redundant_divs(bmap);
1362         if (!bmap)
1363                 return NULL;
1364         ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
1365         return bmap;
1366 }
1367
1368 struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset)
1369 {
1370         return (struct isl_basic_set *)
1371                 isl_basic_map_finalize((struct isl_basic_map *)bset);
1372 }
1373
1374 struct isl_set *isl_set_finalize(struct isl_set *set)
1375 {
1376         int i;
1377
1378         if (!set)
1379                 return NULL;
1380         for (i = 0; i < set->n; ++i) {
1381                 set->p[i] = isl_basic_set_finalize(set->p[i]);
1382                 if (!set->p[i])
1383                         goto error;
1384         }
1385         return set;
1386 error:
1387         isl_set_free(set);
1388         return NULL;
1389 }
1390
1391 struct isl_map *isl_map_finalize(struct isl_map *map)
1392 {
1393         int i;
1394
1395         if (!map)
1396                 return NULL;
1397         for (i = 0; i < map->n; ++i) {
1398                 map->p[i] = isl_basic_map_finalize(map->p[i]);
1399                 if (!map->p[i])
1400                         goto error;
1401         }
1402         ISL_F_CLR(map, ISL_MAP_NORMALIZED);
1403         return map;
1404 error:
1405         isl_map_free(map);
1406         return NULL;
1407 }
1408
1409
1410 /* Remove definition of any div that is defined in terms of the given variable.
1411  * The div itself is not removed.  Functions such as
1412  * eliminate_divs_ineq depend on the other divs remaining in place.
1413  */
1414 static struct isl_basic_map *remove_dependent_vars(struct isl_basic_map *bmap,
1415                                                                         int pos)
1416 {
1417         int i;
1418
1419         if (!bmap)
1420                 return NULL;
1421
1422         for (i = 0; i < bmap->n_div; ++i) {
1423                 if (isl_int_is_zero(bmap->div[i][0]))
1424                         continue;
1425                 if (isl_int_is_zero(bmap->div[i][1+1+pos]))
1426                         continue;
1427                 isl_int_set_si(bmap->div[i][0], 0);
1428         }
1429         return bmap;
1430 }
1431
1432 /* Eliminate the specified variables from the constraints using
1433  * Fourier-Motzkin.  The variables themselves are not removed.
1434  */
1435 struct isl_basic_map *isl_basic_map_eliminate_vars(
1436         struct isl_basic_map *bmap, unsigned pos, unsigned n)
1437 {
1438         int d;
1439         int i, j, k;
1440         unsigned total;
1441         int need_gauss = 0;
1442
1443         if (n == 0)
1444                 return bmap;
1445         if (!bmap)
1446                 return NULL;
1447         total = isl_basic_map_total_dim(bmap);
1448
1449         bmap = isl_basic_map_cow(bmap);
1450         for (d = pos + n - 1; d >= 0 && d >= pos; --d)
1451                 bmap = remove_dependent_vars(bmap, d);
1452
1453         for (d = pos + n - 1;
1454              d >= 0 && d >= total - bmap->n_div && d >= pos; --d)
1455                 isl_seq_clr(bmap->div[d-(total-bmap->n_div)], 2+total);
1456         for (d = pos + n - 1; d >= 0 && d >= pos; --d) {
1457                 int n_lower, n_upper;
1458                 if (!bmap)
1459                         return NULL;
1460                 for (i = 0; i < bmap->n_eq; ++i) {
1461                         if (isl_int_is_zero(bmap->eq[i][1+d]))
1462                                 continue;
1463                         eliminate_var_using_equality(bmap, d, bmap->eq[i], 0, NULL);
1464                         isl_basic_map_drop_equality(bmap, i);
1465                         need_gauss = 1;
1466                         break;
1467                 }
1468                 if (i < bmap->n_eq)
1469                         continue;
1470                 n_lower = 0;
1471                 n_upper = 0;
1472                 for (i = 0; i < bmap->n_ineq; ++i) {
1473                         if (isl_int_is_pos(bmap->ineq[i][1+d]))
1474                                 n_lower++;
1475                         else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1476                                 n_upper++;
1477                 }
1478                 bmap = isl_basic_map_extend_constraints(bmap,
1479                                 0, n_lower * n_upper);
1480                 if (!bmap)
1481                         goto error;
1482                 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1483                         int last;
1484                         if (isl_int_is_zero(bmap->ineq[i][1+d]))
1485                                 continue;
1486                         last = -1;
1487                         for (j = 0; j < i; ++j) {
1488                                 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1489                                         continue;
1490                                 last = j;
1491                                 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1492                                     isl_int_sgn(bmap->ineq[j][1+d]))
1493                                         continue;
1494                                 k = isl_basic_map_alloc_inequality(bmap);
1495                                 if (k < 0)
1496                                         goto error;
1497                                 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1498                                                 1+total);
1499                                 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1500                                                 1+d, 1+total, NULL);
1501                         }
1502                         isl_basic_map_drop_inequality(bmap, i);
1503                         i = last + 1;
1504                 }
1505                 if (n_lower > 0 && n_upper > 0) {
1506                         bmap = isl_basic_map_normalize_constraints(bmap);
1507                         bmap = remove_duplicate_constraints(bmap, NULL, 0);
1508                         bmap = isl_basic_map_gauss(bmap, NULL);
1509                         bmap = isl_basic_map_remove_redundancies(bmap);
1510                         need_gauss = 0;
1511                         if (!bmap)
1512                                 goto error;
1513                         if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1514                                 break;
1515                 }
1516         }
1517         ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1518         if (need_gauss)
1519                 bmap = isl_basic_map_gauss(bmap, NULL);
1520         return bmap;
1521 error:
1522         isl_basic_map_free(bmap);
1523         return NULL;
1524 }
1525
1526 struct isl_basic_set *isl_basic_set_eliminate_vars(
1527         struct isl_basic_set *bset, unsigned pos, unsigned n)
1528 {
1529         return (struct isl_basic_set *)isl_basic_map_eliminate_vars(
1530                         (struct isl_basic_map *)bset, pos, n);
1531 }
1532
1533 /* Eliminate the specified n dimensions starting at first from the
1534  * constraints, without removing the dimensions from the space.
1535  * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1536  * Otherwise, they are projected out and the original space is restored.
1537  */
1538 __isl_give isl_basic_map *isl_basic_map_eliminate(
1539         __isl_take isl_basic_map *bmap,
1540         enum isl_dim_type type, unsigned first, unsigned n)
1541 {
1542         isl_space *space;
1543
1544         if (!bmap)
1545                 return NULL;
1546         if (n == 0)
1547                 return bmap;
1548
1549         if (first + n > isl_basic_map_dim(bmap, type) || first + n < first)
1550                 isl_die(bmap->ctx, isl_error_invalid,
1551                         "index out of bounds", goto error);
1552
1553         if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
1554                 first += isl_basic_map_offset(bmap, type) - 1;
1555                 bmap = isl_basic_map_eliminate_vars(bmap, first, n);
1556                 return isl_basic_map_finalize(bmap);
1557         }
1558
1559         space = isl_basic_map_get_space(bmap);
1560         bmap = isl_basic_map_project_out(bmap, type, first, n);
1561         bmap = isl_basic_map_insert_dims(bmap, type, first, n);
1562         bmap = isl_basic_map_reset_space(bmap, space);
1563         return bmap;
1564 error:
1565         isl_basic_map_free(bmap);
1566         return NULL;
1567 }
1568
1569 __isl_give isl_basic_set *isl_basic_set_eliminate(
1570         __isl_take isl_basic_set *bset,
1571         enum isl_dim_type type, unsigned first, unsigned n)
1572 {
1573         return isl_basic_map_eliminate(bset, type, first, n);
1574 }
1575
1576 /* Don't assume equalities are in order, because align_divs
1577  * may have changed the order of the divs.
1578  */
1579 static void compute_elimination_index(struct isl_basic_map *bmap, int *elim)
1580 {
1581         int d, i;
1582         unsigned total;
1583
1584         total = isl_space_dim(bmap->dim, isl_dim_all);
1585         for (d = 0; d < total; ++d)
1586                 elim[d] = -1;
1587         for (i = 0; i < bmap->n_eq; ++i) {
1588                 for (d = total - 1; d >= 0; --d) {
1589                         if (isl_int_is_zero(bmap->eq[i][1+d]))
1590                                 continue;
1591                         elim[d] = i;
1592                         break;
1593                 }
1594         }
1595 }
1596
1597 static void set_compute_elimination_index(struct isl_basic_set *bset, int *elim)
1598 {
1599         compute_elimination_index((struct isl_basic_map *)bset, elim);
1600 }
1601
1602 static int reduced_using_equalities(isl_int *dst, isl_int *src,
1603         struct isl_basic_map *bmap, int *elim)
1604 {
1605         int d;
1606         int copied = 0;
1607         unsigned total;
1608
1609         total = isl_space_dim(bmap->dim, isl_dim_all);
1610         for (d = total - 1; d >= 0; --d) {
1611                 if (isl_int_is_zero(src[1+d]))
1612                         continue;
1613                 if (elim[d] == -1)
1614                         continue;
1615                 if (!copied) {
1616                         isl_seq_cpy(dst, src, 1 + total);
1617                         copied = 1;
1618                 }
1619                 isl_seq_elim(dst, bmap->eq[elim[d]], 1 + d, 1 + total, NULL);
1620         }
1621         return copied;
1622 }
1623
1624 static int set_reduced_using_equalities(isl_int *dst, isl_int *src,
1625         struct isl_basic_set *bset, int *elim)
1626 {
1627         return reduced_using_equalities(dst, src,
1628                                         (struct isl_basic_map *)bset, elim);
1629 }
1630
1631 static struct isl_basic_set *isl_basic_set_reduce_using_equalities(
1632         struct isl_basic_set *bset, struct isl_basic_set *context)
1633 {
1634         int i;
1635         int *elim;
1636
1637         if (!bset || !context)
1638                 goto error;
1639
1640         if (context->n_eq == 0) {
1641                 isl_basic_set_free(context);
1642                 return bset;
1643         }
1644
1645         bset = isl_basic_set_cow(bset);
1646         if (!bset)
1647                 goto error;
1648
1649         elim = isl_alloc_array(bset->ctx, int, isl_basic_set_n_dim(bset));
1650         if (!elim)
1651                 goto error;
1652         set_compute_elimination_index(context, elim);
1653         for (i = 0; i < bset->n_eq; ++i)
1654                 set_reduced_using_equalities(bset->eq[i], bset->eq[i],
1655                                                         context, elim);
1656         for (i = 0; i < bset->n_ineq; ++i)
1657                 set_reduced_using_equalities(bset->ineq[i], bset->ineq[i],
1658                                                         context, elim);
1659         isl_basic_set_free(context);
1660         free(elim);
1661         bset = isl_basic_set_simplify(bset);
1662         bset = isl_basic_set_finalize(bset);
1663         return bset;
1664 error:
1665         isl_basic_set_free(bset);
1666         isl_basic_set_free(context);
1667         return NULL;
1668 }
1669
1670 static struct isl_basic_set *remove_shifted_constraints(
1671         struct isl_basic_set *bset, struct isl_basic_set *context)
1672 {
1673         unsigned int size;
1674         isl_int ***index;
1675         int bits;
1676         int k, h, l;
1677         isl_ctx *ctx;
1678
1679         if (!bset)
1680                 return NULL;
1681
1682         size = round_up(4 * (context->n_ineq+1) / 3 - 1);
1683         bits = ffs(size) - 1;
1684         ctx = isl_basic_set_get_ctx(bset);
1685         index = isl_calloc_array(ctx, isl_int **, size);
1686         if (!index)
1687                 return bset;
1688
1689         for (k = 0; k < context->n_ineq; ++k) {
1690                 h = set_hash_index(index, size, bits, context, k);
1691                 index[h] = &context->ineq[k];
1692         }
1693         for (k = 0; k < bset->n_ineq; ++k) {
1694                 h = set_hash_index(index, size, bits, bset, k);
1695                 if (!index[h])
1696                         continue;
1697                 l = index[h] - &context->ineq[0];
1698                 if (isl_int_lt(bset->ineq[k][0], context->ineq[l][0]))
1699                         continue;
1700                 bset = isl_basic_set_cow(bset);
1701                 if (!bset)
1702                         goto error;
1703                 isl_basic_set_drop_inequality(bset, k);
1704                 --k;
1705         }
1706         free(index);
1707         return bset;
1708 error:
1709         free(index);
1710         return bset;
1711 }
1712
1713 /* Does the (linear part of a) constraint "c" involve any of the "len"
1714  * "relevant" dimensions?
1715  */
1716 static int is_related(isl_int *c, int len, int *relevant)
1717 {
1718         int i;
1719
1720         for (i = 0; i < len; ++i) {
1721                 if (!relevant[i])
1722                         continue;
1723                 if (!isl_int_is_zero(c[i]))
1724                         return 1;
1725         }
1726
1727         return 0;
1728 }
1729
1730 /* Drop constraints from "bset" that do not involve any of
1731  * the dimensions marked "relevant".
1732  */
1733 static __isl_give isl_basic_set *drop_unrelated_constraints(
1734         __isl_take isl_basic_set *bset, int *relevant)
1735 {
1736         int i, dim;
1737
1738         dim = isl_basic_set_dim(bset, isl_dim_set);
1739         for (i = 0; i < dim; ++i)
1740                 if (!relevant[i])
1741                         break;
1742         if (i >= dim)
1743                 return bset;
1744
1745         for (i = bset->n_eq - 1; i >= 0; --i)
1746                 if (!is_related(bset->eq[i] + 1, dim, relevant))
1747                         isl_basic_set_drop_equality(bset, i);
1748
1749         for (i = bset->n_ineq - 1; i >= 0; --i)
1750                 if (!is_related(bset->ineq[i] + 1, dim, relevant))
1751                         isl_basic_set_drop_inequality(bset, i);
1752
1753         return bset;
1754 }
1755
1756 /* Update the groups in "group" based on the (linear part of a) constraint "c".
1757  *
1758  * In particular, for any variable involved in the constraint,
1759  * find the actual group id from before and replace the group
1760  * of the corresponding variable by the minimal group of all
1761  * the variables involved in the constraint considered so far
1762  * (if this minimum is smaller) or replace the minimum by this group
1763  * (if the minimum is larger).
1764  *
1765  * At the end, all the variables in "c" will (indirectly) point
1766  * to the minimal of the groups that they referred to originally.
1767  */
1768 static void update_groups(int dim, int *group, isl_int *c)
1769 {
1770         int j;
1771         int min = dim;
1772
1773         for (j = 0; j < dim; ++j) {
1774                 if (isl_int_is_zero(c[j]))
1775                         continue;
1776                 while (group[j] >= 0 && group[group[j]] != group[j])
1777                         group[j] = group[group[j]];
1778                 if (group[j] == min)
1779                         continue;
1780                 if (group[j] < min) {
1781                         if (min >= 0 && min < dim)
1782                                 group[min] = group[j];
1783                         min = group[j];
1784                 } else
1785                         group[group[j]] = min;
1786         }
1787 }
1788
1789 /* Drop constraints from "context" that are irrelevant for computing
1790  * the gist of "bset".
1791  *
1792  * In particular, drop constraints in variables that are not related
1793  * to any of the variables involved in the constraints of "bset"
1794  * in the sense that there is no sequence of constraints that connects them.
1795  *
1796  * We construct groups of variables that collect variables that
1797  * (indirectly) appear in some common constraint of "context".
1798  * Each group is identified by the first variable in the group,
1799  * except for the special group of variables that appear in "bset"
1800  * (or are related to those variables), which is identified by -1.
1801  * If group[i] is equal to i (or -1), then the group of i is i (or -1),
1802  * otherwise the group of i is the group of group[i].
1803  *
1804  * We first initialize the -1 group with the variables that appear in "bset".
1805  * Then we initialize groups for the remaining variables.
1806  * Then we iterate over the constraints of "context" and update the
1807  * group of the variables in the constraint by the smallest group.
1808  * Finally, we resolve indirect references to groups by running over
1809  * the variables.
1810  *
1811  * After computing the groups, we drop constraints that do not involve
1812  * any variables in the -1 group.
1813  */
1814 static __isl_give isl_basic_set *drop_irrelevant_constraints(
1815         __isl_take isl_basic_set *context, __isl_keep isl_basic_set *bset)
1816 {
1817         isl_ctx *ctx;
1818         int *group;
1819         int dim;
1820         int i, j;
1821         int last;
1822
1823         if (!context || !bset)
1824                 return isl_basic_set_free(context);
1825
1826         dim = isl_basic_set_dim(bset, isl_dim_set);
1827         ctx = isl_basic_set_get_ctx(bset);
1828         group = isl_calloc_array(ctx, int, dim);
1829
1830         if (!group)
1831                 goto error;
1832
1833         for (i = 0; i < dim; ++i) {
1834                 for (j = 0; j < bset->n_eq; ++j)
1835                         if (!isl_int_is_zero(bset->eq[j][1 + i]))
1836                                 break;
1837                 if (j < bset->n_eq) {
1838                         group[i] = -1;
1839                         continue;
1840                 }
1841                 for (j = 0; j < bset->n_ineq; ++j)
1842                         if (!isl_int_is_zero(bset->ineq[j][1 + i]))
1843                                 break;
1844                 if (j < bset->n_ineq)
1845                         group[i] = -1;
1846         }
1847
1848         last = -1;
1849         for (i = 0; i < dim; ++i)
1850                 if (group[i] >= 0)
1851                         last = group[i] = i;
1852         if (last < 0) {
1853                 free(group);
1854                 return context;
1855         }
1856
1857         for (i = 0; i < context->n_eq; ++i)
1858                 update_groups(dim, group, context->eq[i] + 1);
1859         for (i = 0; i < context->n_ineq; ++i)
1860                 update_groups(dim, group, context->ineq[i] + 1);
1861
1862         for (i = 0; i < dim; ++i)
1863                 if (group[i] >= 0)
1864                         group[i] = group[group[i]];
1865
1866         for (i = 0; i < dim; ++i)
1867                 group[i] = group[i] == -1;
1868
1869         context = drop_unrelated_constraints(context, group);
1870
1871         free(group);
1872         return context;
1873 error:
1874         free(group);
1875         return isl_basic_set_free(context);
1876 }
1877
1878 /* Remove all information from bset that is redundant in the context
1879  * of context.  Both bset and context are assumed to be full-dimensional.
1880  *
1881  * We first remove the inequalities from "bset"
1882  * that are obviously redundant with respect to some inequality in "context".
1883  * Then we remove those constraints from "context" that have become
1884  * irrelevant for computing the gist of "bset".
1885  * Note that this removal of constraints cannot be replaced by
1886  * a factorization because factors in "bset" may still be connected
1887  * to each other through constraints in "context".
1888  *
1889  * If there are any inequalities left, we construct a tableau for
1890  * the context and then add the inequalities of "bset".
1891  * Before adding these inequalities, we freeze all constraints such that
1892  * they won't be considered redundant in terms of the constraints of "bset".
1893  * Then we detect all redundant constraints (among the
1894  * constraints that weren't frozen), first by checking for redundancy in the
1895  * the tableau and then by checking if replacing a constraint by its negation
1896  * would lead to an empty set.  This last step is fairly expensive
1897  * and could be optimized by more reuse of the tableau.
1898  * Finally, we update bset according to the results.
1899  */
1900 static __isl_give isl_basic_set *uset_gist_full(__isl_take isl_basic_set *bset,
1901         __isl_take isl_basic_set *context)
1902 {
1903         int i, k;
1904         isl_basic_set *combined = NULL;
1905         struct isl_tab *tab = NULL;
1906         unsigned context_ineq;
1907         unsigned total;
1908
1909         if (!bset || !context)
1910                 goto error;
1911
1912         if (isl_basic_set_is_universe(bset)) {
1913                 isl_basic_set_free(context);
1914                 return bset;
1915         }
1916
1917         if (isl_basic_set_is_universe(context)) {
1918                 isl_basic_set_free(context);
1919                 return bset;
1920         }
1921
1922         bset = remove_shifted_constraints(bset, context);
1923         if (!bset)
1924                 goto error;
1925         if (bset->n_ineq == 0)
1926                 goto done;
1927
1928         context = drop_irrelevant_constraints(context, bset);
1929         if (!context)
1930                 goto error;
1931         if (isl_basic_set_is_universe(context)) {
1932                 isl_basic_set_free(context);
1933                 return bset;
1934         }
1935
1936         context_ineq = context->n_ineq;
1937         combined = isl_basic_set_cow(isl_basic_set_copy(context));
1938         combined = isl_basic_set_extend_constraints(combined, 0, bset->n_ineq);
1939         tab = isl_tab_from_basic_set(combined, 0);
1940         for (i = 0; i < context_ineq; ++i)
1941                 if (isl_tab_freeze_constraint(tab, i) < 0)
1942                         goto error;
1943         tab = isl_tab_extend(tab, bset->n_ineq);
1944         for (i = 0; i < bset->n_ineq; ++i)
1945                 if (isl_tab_add_ineq(tab, bset->ineq[i]) < 0)
1946                         goto error;
1947         bset = isl_basic_set_add_constraints(combined, bset, 0);
1948         combined = NULL;
1949         if (!bset)
1950                 goto error;
1951         if (isl_tab_detect_redundant(tab) < 0)
1952                 goto error;
1953         total = isl_basic_set_total_dim(bset);
1954         for (i = context_ineq; i < bset->n_ineq; ++i) {
1955                 int is_empty;
1956                 if (tab->con[i].is_redundant)
1957                         continue;
1958                 tab->con[i].is_redundant = 1;
1959                 combined = isl_basic_set_dup(bset);
1960                 combined = isl_basic_set_update_from_tab(combined, tab);
1961                 combined = isl_basic_set_extend_constraints(combined, 0, 1);
1962                 k = isl_basic_set_alloc_inequality(combined);
1963                 if (k < 0)
1964                         goto error;
1965                 isl_seq_neg(combined->ineq[k], bset->ineq[i], 1 + total);
1966                 isl_int_sub_ui(combined->ineq[k][0], combined->ineq[k][0], 1);
1967                 is_empty = isl_basic_set_is_empty(combined);
1968                 if (is_empty < 0)
1969                         goto error;
1970                 isl_basic_set_free(combined);
1971                 combined = NULL;
1972                 if (!is_empty)
1973                         tab->con[i].is_redundant = 0;
1974         }
1975         for (i = 0; i < context_ineq; ++i)
1976                 tab->con[i].is_redundant = 1;
1977         bset = isl_basic_set_update_from_tab(bset, tab);
1978         if (bset) {
1979                 ISL_F_SET(bset, ISL_BASIC_SET_NO_IMPLICIT);
1980                 ISL_F_SET(bset, ISL_BASIC_SET_NO_REDUNDANT);
1981         }
1982
1983         isl_tab_free(tab);
1984 done:
1985         bset = isl_basic_set_simplify(bset);
1986         bset = isl_basic_set_finalize(bset);
1987         isl_basic_set_free(context);
1988         return bset;
1989 error:
1990         isl_tab_free(tab);
1991         isl_basic_set_free(combined);
1992         isl_basic_set_free(context);
1993         isl_basic_set_free(bset);
1994         return NULL;
1995 }
1996
1997 /* Remove all information from bset that is redundant in the context
1998  * of context.  In particular, equalities that are linear combinations
1999  * of those in context are removed.  Then the inequalities that are
2000  * redundant in the context of the equalities and inequalities of
2001  * context are removed.
2002  *
2003  * First of all, we drop those constraints from "context"
2004  * that are irrelevant for computing the gist of "bset".
2005  * Alternatively, we could factorize the intersection of "context" and "bset".
2006  *
2007  * We first compute the integer affine hull of the intersection,
2008  * compute the gist inside this affine hull and then add back
2009  * those equalities that are not implied by the context.
2010  *
2011  * If two constraints are mutually redundant, then uset_gist_full
2012  * will remove the second of those constraints.  We therefore first
2013  * sort the constraints so that constraints not involving existentially
2014  * quantified variables are given precedence over those that do.
2015  * We have to perform this sorting before the variable compression,
2016  * because that may effect the order of the variables.
2017  */
2018 static __isl_give isl_basic_set *uset_gist(__isl_take isl_basic_set *bset,
2019         __isl_take isl_basic_set *context)
2020 {
2021         isl_mat *eq;
2022         isl_mat *T, *T2;
2023         isl_basic_set *aff;
2024         isl_basic_set *aff_context;
2025         unsigned total;
2026
2027         if (!bset || !context)
2028                 goto error;
2029
2030         context = drop_irrelevant_constraints(context, bset);
2031
2032         bset = isl_basic_set_intersect(bset, isl_basic_set_copy(context));
2033         if (isl_basic_set_plain_is_empty(bset)) {
2034                 isl_basic_set_free(context);
2035                 return bset;
2036         }
2037         bset = isl_basic_set_sort_constraints(bset);
2038         aff = isl_basic_set_affine_hull(isl_basic_set_copy(bset));
2039         if (!aff)
2040                 goto error;
2041         if (isl_basic_set_plain_is_empty(aff)) {
2042                 isl_basic_set_free(aff);
2043                 isl_basic_set_free(context);
2044                 return bset;
2045         }
2046         if (aff->n_eq == 0) {
2047                 isl_basic_set_free(aff);
2048                 return uset_gist_full(bset, context);
2049         }
2050         total = isl_basic_set_total_dim(bset);
2051         eq = isl_mat_sub_alloc6(bset->ctx, aff->eq, 0, aff->n_eq, 0, 1 + total);
2052         eq = isl_mat_cow(eq);
2053         T = isl_mat_variable_compression(eq, &T2);
2054         if (T && T->n_col == 0) {
2055                 isl_mat_free(T);
2056                 isl_mat_free(T2);
2057                 isl_basic_set_free(context);
2058                 isl_basic_set_free(aff);
2059                 return isl_basic_set_set_to_empty(bset);
2060         }
2061
2062         aff_context = isl_basic_set_affine_hull(isl_basic_set_copy(context));
2063
2064         bset = isl_basic_set_preimage(bset, isl_mat_copy(T));
2065         context = isl_basic_set_preimage(context, T);
2066
2067         bset = uset_gist_full(bset, context);
2068         bset = isl_basic_set_preimage(bset, T2);
2069         bset = isl_basic_set_intersect(bset, aff);
2070         bset = isl_basic_set_reduce_using_equalities(bset, aff_context);
2071
2072         if (bset) {
2073                 ISL_F_SET(bset, ISL_BASIC_SET_NO_IMPLICIT);
2074                 ISL_F_SET(bset, ISL_BASIC_SET_NO_REDUNDANT);
2075         }
2076
2077         return bset;
2078 error:
2079         isl_basic_set_free(bset);
2080         isl_basic_set_free(context);
2081         return NULL;
2082 }
2083
2084 /* Normalize the divs in "bmap" in the context of the equalities in "context".
2085  * We simply add the equalities in context to bmap and then do a regular
2086  * div normalizations.  Better results can be obtained by normalizing
2087  * only the divs in bmap than do not also appear in context.
2088  * We need to be careful to reduce the divs using the equalities
2089  * so that later calls to isl_basic_map_overlying_set wouldn't introduce
2090  * spurious constraints.
2091  */
2092 static struct isl_basic_map *normalize_divs_in_context(
2093         struct isl_basic_map *bmap, struct isl_basic_map *context)
2094 {
2095         int i;
2096         unsigned total_context;
2097         int div_eq;
2098
2099         div_eq = n_pure_div_eq(bmap);
2100         if (div_eq == 0)
2101                 return bmap;
2102
2103         if (context->n_div > 0)
2104                 bmap = isl_basic_map_align_divs(bmap, context);
2105
2106         total_context = isl_basic_map_total_dim(context);
2107         bmap = isl_basic_map_extend_constraints(bmap, context->n_eq, 0);
2108         for (i = 0; i < context->n_eq; ++i) {
2109                 int k;
2110                 k = isl_basic_map_alloc_equality(bmap);
2111                 isl_seq_cpy(bmap->eq[k], context->eq[i], 1 + total_context);
2112                 isl_seq_clr(bmap->eq[k] + 1 + total_context,
2113                                 isl_basic_map_total_dim(bmap) - total_context);
2114         }
2115         bmap = isl_basic_map_gauss(bmap, NULL);
2116         bmap = normalize_divs(bmap, NULL);
2117         bmap = isl_basic_map_gauss(bmap, NULL);
2118         return bmap;
2119 }
2120
2121 struct isl_basic_map *isl_basic_map_gist(struct isl_basic_map *bmap,
2122         struct isl_basic_map *context)
2123 {
2124         struct isl_basic_set *bset;
2125
2126         if (!bmap || !context)
2127                 goto error;
2128
2129         if (isl_basic_map_is_universe(bmap)) {
2130                 isl_basic_map_free(context);
2131                 return bmap;
2132         }
2133         if (isl_basic_map_plain_is_empty(context)) {
2134                 isl_basic_map_free(bmap);
2135                 return context;
2136         }
2137         if (isl_basic_map_plain_is_empty(bmap)) {
2138                 isl_basic_map_free(context);
2139                 return bmap;
2140         }
2141
2142         bmap = isl_basic_map_remove_redundancies(bmap);
2143         context = isl_basic_map_remove_redundancies(context);
2144
2145         if (context->n_eq)
2146                 bmap = normalize_divs_in_context(bmap, context);
2147
2148         context = isl_basic_map_align_divs(context, bmap);
2149         bmap = isl_basic_map_align_divs(bmap, context);
2150
2151         bset = uset_gist(isl_basic_map_underlying_set(isl_basic_map_copy(bmap)),
2152                          isl_basic_map_underlying_set(context));
2153
2154         return isl_basic_map_overlying_set(bset, bmap);
2155 error:
2156         isl_basic_map_free(bmap);
2157         isl_basic_map_free(context);
2158         return NULL;
2159 }
2160
2161 /*
2162  * Assumes context has no implicit divs.
2163  */
2164 __isl_give isl_map *isl_map_gist_basic_map(__isl_take isl_map *map,
2165         __isl_take isl_basic_map *context)
2166 {
2167         int i;
2168
2169         if (!map || !context)
2170                 goto error;;
2171
2172         if (isl_basic_map_plain_is_empty(context)) {
2173                 isl_map_free(map);
2174                 return isl_map_from_basic_map(context);
2175         }
2176
2177         context = isl_basic_map_remove_redundancies(context);
2178         map = isl_map_cow(map);
2179         if (!map || !context)
2180                 goto error;;
2181         isl_assert(map->ctx, isl_space_is_equal(map->dim, context->dim), goto error);
2182         map = isl_map_compute_divs(map);
2183         for (i = 0; i < map->n; ++i)
2184                 context = isl_basic_map_align_divs(context, map->p[i]);
2185         for (i = map->n - 1; i >= 0; --i) {
2186                 map->p[i] = isl_basic_map_gist(map->p[i],
2187                                                 isl_basic_map_copy(context));
2188                 if (!map->p[i])
2189                         goto error;
2190                 if (isl_basic_map_plain_is_empty(map->p[i])) {
2191                         isl_basic_map_free(map->p[i]);
2192                         if (i != map->n - 1)
2193                                 map->p[i] = map->p[map->n - 1];
2194                         map->n--;
2195                 }
2196         }
2197         isl_basic_map_free(context);
2198         ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2199         return map;
2200 error:
2201         isl_map_free(map);
2202         isl_basic_map_free(context);
2203         return NULL;
2204 }
2205
2206 /* Return a map that has the same intersection with "context" as "map"
2207  * and that as "simple" as possible.
2208  *
2209  * If "map" is already the universe, then we cannot make it any simpler.
2210  * Similarly, if "context" is the universe, then we cannot exploit it
2211  * to simplify "map"
2212  * If "map" and "context" are identical to each other, then we can
2213  * return the corresponding universe.
2214  *
2215  * If none of these cases apply, we have to work a bit harder.
2216  */
2217 static __isl_give isl_map *map_gist(__isl_take isl_map *map,
2218         __isl_take isl_map *context)
2219 {
2220         int equal;
2221         int is_universe;
2222
2223         is_universe = isl_map_plain_is_universe(map);
2224         if (is_universe >= 0 && !is_universe)
2225                 is_universe = isl_map_plain_is_universe(context);
2226         if (is_universe < 0)
2227                 goto error;
2228         if (is_universe) {
2229                 isl_map_free(context);
2230                 return map;
2231         }
2232
2233         equal = isl_map_plain_is_equal(map, context);
2234         if (equal < 0)
2235                 goto error;
2236         if (equal) {
2237                 isl_map *res = isl_map_universe(isl_map_get_space(map));
2238                 isl_map_free(map);
2239                 isl_map_free(context);
2240                 return res;
2241         }
2242
2243         context = isl_map_compute_divs(context);
2244         return isl_map_gist_basic_map(map, isl_map_simple_hull(context));
2245 error:
2246         isl_map_free(map);
2247         isl_map_free(context);
2248         return NULL;
2249 }
2250
2251 __isl_give isl_map *isl_map_gist(__isl_take isl_map *map,
2252         __isl_take isl_map *context)
2253 {
2254         return isl_map_align_params_map_map_and(map, context, &map_gist);
2255 }
2256
2257 struct isl_basic_set *isl_basic_set_gist(struct isl_basic_set *bset,
2258                                                 struct isl_basic_set *context)
2259 {
2260         return (struct isl_basic_set *)isl_basic_map_gist(
2261                 (struct isl_basic_map *)bset, (struct isl_basic_map *)context);
2262 }
2263
2264 __isl_give isl_set *isl_set_gist_basic_set(__isl_take isl_set *set,
2265         __isl_take isl_basic_set *context)
2266 {
2267         return (struct isl_set *)isl_map_gist_basic_map((struct isl_map *)set,
2268                                         (struct isl_basic_map *)context);
2269 }
2270
2271 __isl_give isl_set *isl_set_gist_params_basic_set(__isl_take isl_set *set,
2272         __isl_take isl_basic_set *context)
2273 {
2274         isl_space *space = isl_set_get_space(set);
2275         isl_basic_set *dom_context = isl_basic_set_universe(space);
2276         dom_context = isl_basic_set_intersect_params(dom_context, context);
2277         return isl_set_gist_basic_set(set, dom_context);
2278 }
2279
2280 __isl_give isl_set *isl_set_gist(__isl_take isl_set *set,
2281         __isl_take isl_set *context)
2282 {
2283         return (struct isl_set *)isl_map_gist((struct isl_map *)set,
2284                                         (struct isl_map *)context);
2285 }
2286
2287 __isl_give isl_map *isl_map_gist_domain(__isl_take isl_map *map,
2288         __isl_take isl_set *context)
2289 {
2290         isl_map *map_context = isl_map_universe(isl_map_get_space(map));
2291         map_context = isl_map_intersect_domain(map_context, context);
2292         return isl_map_gist(map, map_context);
2293 }
2294
2295 __isl_give isl_map *isl_map_gist_range(__isl_take isl_map *map,
2296         __isl_take isl_set *context)
2297 {
2298         isl_map *map_context = isl_map_universe(isl_map_get_space(map));
2299         map_context = isl_map_intersect_range(map_context, context);
2300         return isl_map_gist(map, map_context);
2301 }
2302
2303 __isl_give isl_map *isl_map_gist_params(__isl_take isl_map *map,
2304         __isl_take isl_set *context)
2305 {
2306         isl_map *map_context = isl_map_universe(isl_map_get_space(map));
2307         map_context = isl_map_intersect_params(map_context, context);
2308         return isl_map_gist(map, map_context);
2309 }
2310
2311 __isl_give isl_set *isl_set_gist_params(__isl_take isl_set *set,
2312         __isl_take isl_set *context)
2313 {
2314         return isl_map_gist_params(set, context);
2315 }
2316
2317 /* Quick check to see if two basic maps are disjoint.
2318  * In particular, we reduce the equalities and inequalities of
2319  * one basic map in the context of the equalities of the other
2320  * basic map and check if we get a contradiction.
2321  */
2322 int isl_basic_map_plain_is_disjoint(__isl_keep isl_basic_map *bmap1,
2323         __isl_keep isl_basic_map *bmap2)
2324 {
2325         struct isl_vec *v = NULL;
2326         int *elim = NULL;
2327         unsigned total;
2328         int i;
2329
2330         if (!bmap1 || !bmap2)
2331                 return -1;
2332         isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
2333                         return -1);
2334         if (bmap1->n_div || bmap2->n_div)
2335                 return 0;
2336         if (!bmap1->n_eq && !bmap2->n_eq)
2337                 return 0;
2338
2339         total = isl_space_dim(bmap1->dim, isl_dim_all);
2340         if (total == 0)
2341                 return 0;
2342         v = isl_vec_alloc(bmap1->ctx, 1 + total);
2343         if (!v)
2344                 goto error;
2345         elim = isl_alloc_array(bmap1->ctx, int, total);
2346         if (!elim)
2347                 goto error;
2348         compute_elimination_index(bmap1, elim);
2349         for (i = 0; i < bmap2->n_eq; ++i) {
2350                 int reduced;
2351                 reduced = reduced_using_equalities(v->block.data, bmap2->eq[i],
2352                                                         bmap1, elim);
2353                 if (reduced && !isl_int_is_zero(v->block.data[0]) &&
2354                     isl_seq_first_non_zero(v->block.data + 1, total) == -1)
2355                         goto disjoint;
2356         }
2357         for (i = 0; i < bmap2->n_ineq; ++i) {
2358                 int reduced;
2359                 reduced = reduced_using_equalities(v->block.data,
2360                                                 bmap2->ineq[i], bmap1, elim);
2361                 if (reduced && isl_int_is_neg(v->block.data[0]) &&
2362                     isl_seq_first_non_zero(v->block.data + 1, total) == -1)
2363                         goto disjoint;
2364         }
2365         compute_elimination_index(bmap2, elim);
2366         for (i = 0; i < bmap1->n_ineq; ++i) {
2367                 int reduced;
2368                 reduced = reduced_using_equalities(v->block.data,
2369                                                 bmap1->ineq[i], bmap2, elim);
2370                 if (reduced && isl_int_is_neg(v->block.data[0]) &&
2371                     isl_seq_first_non_zero(v->block.data + 1, total) == -1)
2372                         goto disjoint;
2373         }
2374         isl_vec_free(v);
2375         free(elim);
2376         return 0;
2377 disjoint:
2378         isl_vec_free(v);
2379         free(elim);
2380         return 1;
2381 error:
2382         isl_vec_free(v);
2383         free(elim);
2384         return -1;
2385 }
2386
2387 int isl_basic_set_plain_is_disjoint(__isl_keep isl_basic_set *bset1,
2388         __isl_keep isl_basic_set *bset2)
2389 {
2390         return isl_basic_map_plain_is_disjoint((struct isl_basic_map *)bset1,
2391                                               (struct isl_basic_map *)bset2);
2392 }
2393
2394 /* Are "map1" and "map2" obviously disjoint?
2395  *
2396  * If one of them is empty or if they live in different spaces (ignoring
2397  * parameters), then they are clearly disjoint.
2398  *
2399  * If they have different parameters, then we skip any further tests.
2400  *
2401  * If they are obviously equal, but not obviously empty, then we will
2402  * not be able to detect if they are disjoint.
2403  *
2404  * Otherwise we check if each basic map in "map1" is obviously disjoint
2405  * from each basic map in "map2".
2406  */
2407 int isl_map_plain_is_disjoint(__isl_keep isl_map *map1,
2408         __isl_keep isl_map *map2)
2409 {
2410         int i, j;
2411         int disjoint;
2412         int intersect;
2413         int match;
2414
2415         if (!map1 || !map2)
2416                 return -1;
2417
2418         disjoint = isl_map_plain_is_empty(map1);
2419         if (disjoint < 0 || disjoint)
2420                 return disjoint;
2421
2422         disjoint = isl_map_plain_is_empty(map2);
2423         if (disjoint < 0 || disjoint)
2424                 return disjoint;
2425
2426         match = isl_space_tuple_match(map1->dim, isl_dim_in,
2427                                 map2->dim, isl_dim_in);
2428         if (match < 0 || !match)
2429                 return match < 0 ? -1 : 1;
2430
2431         match = isl_space_tuple_match(map1->dim, isl_dim_out,
2432                                 map2->dim, isl_dim_out);
2433         if (match < 0 || !match)
2434                 return match < 0 ? -1 : 1;
2435
2436         match = isl_space_match(map1->dim, isl_dim_param,
2437                                 map2->dim, isl_dim_param);
2438         if (match < 0 || !match)
2439                 return match < 0 ? -1 : 0;
2440
2441         intersect = isl_map_plain_is_equal(map1, map2);
2442         if (intersect < 0 || intersect)
2443                 return intersect < 0 ? -1 : 0;
2444
2445         for (i = 0; i < map1->n; ++i) {
2446                 for (j = 0; j < map2->n; ++j) {
2447                         int d = isl_basic_map_plain_is_disjoint(map1->p[i],
2448                                                                map2->p[j]);
2449                         if (d != 1)
2450                                 return d;
2451                 }
2452         }
2453         return 1;
2454 }
2455
2456 /* Are "map1" and "map2" disjoint?
2457  *
2458  * They are disjoint if they are "obviously disjoint" or if one of them
2459  * is empty.  Otherwise, they are not disjoint if one of them is universal.
2460  * If none of these cases apply, we compute the intersection and see if
2461  * the result is empty.
2462  */
2463 int isl_map_is_disjoint(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
2464 {
2465         int disjoint;
2466         int intersect;
2467         isl_map *test;
2468
2469         disjoint = isl_map_plain_is_disjoint(map1, map2);
2470         if (disjoint < 0 || disjoint)
2471                 return disjoint;
2472
2473         disjoint = isl_map_is_empty(map1);
2474         if (disjoint < 0 || disjoint)
2475                 return disjoint;
2476
2477         disjoint = isl_map_is_empty(map2);
2478         if (disjoint < 0 || disjoint)
2479                 return disjoint;
2480
2481         intersect = isl_map_plain_is_universe(map1);
2482         if (intersect < 0 || intersect)
2483                 return intersect < 0 ? -1 : 0;
2484
2485         intersect = isl_map_plain_is_universe(map2);
2486         if (intersect < 0 || intersect)
2487                 return intersect < 0 ? -1 : 0;
2488
2489         test = isl_map_intersect(isl_map_copy(map1), isl_map_copy(map2));
2490         disjoint = isl_map_is_empty(test);
2491         isl_map_free(test);
2492
2493         return disjoint;
2494 }
2495
2496 int isl_set_plain_is_disjoint(__isl_keep isl_set *set1,
2497         __isl_keep isl_set *set2)
2498 {
2499         return isl_map_plain_is_disjoint((struct isl_map *)set1,
2500                                         (struct isl_map *)set2);
2501 }
2502
2503 /* Are "set1" and "set2" disjoint?
2504  */
2505 int isl_set_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
2506 {
2507         return isl_map_is_disjoint(set1, set2);
2508 }
2509
2510 int isl_set_fast_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
2511 {
2512         return isl_set_plain_is_disjoint(set1, set2);
2513 }
2514
2515 /* Check if we can combine a given div with lower bound l and upper
2516  * bound u with some other div and if so return that other div.
2517  * Otherwise return -1.
2518  *
2519  * We first check that
2520  *      - the bounds are opposites of each other (except for the constant
2521  *        term)
2522  *      - the bounds do not reference any other div
2523  *      - no div is defined in terms of this div
2524  *
2525  * Let m be the size of the range allowed on the div by the bounds.
2526  * That is, the bounds are of the form
2527  *
2528  *      e <= a <= e + m - 1
2529  *
2530  * with e some expression in the other variables.
2531  * We look for another div b such that no third div is defined in terms
2532  * of this second div b and such that in any constraint that contains
2533  * a (except for the given lower and upper bound), also contains b
2534  * with a coefficient that is m times that of b.
2535  * That is, all constraints (execpt for the lower and upper bound)
2536  * are of the form
2537  *
2538  *      e + f (a + m b) >= 0
2539  *
2540  * If so, we return b so that "a + m b" can be replaced by
2541  * a single div "c = a + m b".
2542  */
2543 static int div_find_coalesce(struct isl_basic_map *bmap, int *pairs,
2544         unsigned div, unsigned l, unsigned u)
2545 {
2546         int i, j;
2547         unsigned dim;
2548         int coalesce = -1;
2549
2550         if (bmap->n_div <= 1)
2551                 return -1;
2552         dim = isl_space_dim(bmap->dim, isl_dim_all);
2553         if (isl_seq_first_non_zero(bmap->ineq[l] + 1 + dim, div) != -1)
2554                 return -1;
2555         if (isl_seq_first_non_zero(bmap->ineq[l] + 1 + dim + div + 1,
2556                                    bmap->n_div - div - 1) != -1)
2557                 return -1;
2558         if (!isl_seq_is_neg(bmap->ineq[l] + 1, bmap->ineq[u] + 1,
2559                             dim + bmap->n_div))
2560                 return -1;
2561
2562         for (i = 0; i < bmap->n_div; ++i) {
2563                 if (isl_int_is_zero(bmap->div[i][0]))
2564                         continue;
2565                 if (!isl_int_is_zero(bmap->div[i][1 + 1 + dim + div]))
2566                         return -1;
2567         }
2568
2569         isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0], bmap->ineq[u][0]);
2570         if (isl_int_is_neg(bmap->ineq[l][0])) {
2571                 isl_int_sub(bmap->ineq[l][0],
2572                             bmap->ineq[l][0], bmap->ineq[u][0]);
2573                 bmap = isl_basic_map_copy(bmap);
2574                 bmap = isl_basic_map_set_to_empty(bmap);
2575                 isl_basic_map_free(bmap);
2576                 return -1;
2577         }
2578         isl_int_add_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
2579         for (i = 0; i < bmap->n_div; ++i) {
2580                 if (i == div)
2581                         continue;
2582                 if (!pairs[i])
2583                         continue;
2584                 for (j = 0; j < bmap->n_div; ++j) {
2585                         if (isl_int_is_zero(bmap->div[j][0]))
2586                                 continue;
2587                         if (!isl_int_is_zero(bmap->div[j][1 + 1 + dim + i]))
2588                                 break;
2589                 }
2590                 if (j < bmap->n_div)
2591                         continue;
2592                 for (j = 0; j < bmap->n_ineq; ++j) {
2593                         int valid;
2594                         if (j == l || j == u)
2595                                 continue;
2596                         if (isl_int_is_zero(bmap->ineq[j][1 + dim + div]))
2597                                 continue;
2598                         if (isl_int_is_zero(bmap->ineq[j][1 + dim + i]))
2599                                 break;
2600                         isl_int_mul(bmap->ineq[j][1 + dim + div],
2601                                     bmap->ineq[j][1 + dim + div],
2602                                     bmap->ineq[l][0]);
2603                         valid = isl_int_eq(bmap->ineq[j][1 + dim + div],
2604                                            bmap->ineq[j][1 + dim + i]);
2605                         isl_int_divexact(bmap->ineq[j][1 + dim + div],
2606                                          bmap->ineq[j][1 + dim + div],
2607                                          bmap->ineq[l][0]);
2608                         if (!valid)
2609                                 break;
2610                 }
2611                 if (j < bmap->n_ineq)
2612                         continue;
2613                 coalesce = i;
2614                 break;
2615         }
2616         isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
2617         isl_int_sub(bmap->ineq[l][0], bmap->ineq[l][0], bmap->ineq[u][0]);
2618         return coalesce;
2619 }
2620
2621 /* Given a lower and an upper bound on div i, construct an inequality
2622  * that when nonnegative ensures that this pair of bounds always allows
2623  * for an integer value of the given div.
2624  * The lower bound is inequality l, while the upper bound is inequality u.
2625  * The constructed inequality is stored in ineq.
2626  * g, fl, fu are temporary scalars.
2627  *
2628  * Let the upper bound be
2629  *
2630  *      -n_u a + e_u >= 0
2631  *
2632  * and the lower bound
2633  *
2634  *      n_l a + e_l >= 0
2635  *
2636  * Let n_u = f_u g and n_l = f_l g, with g = gcd(n_u, n_l).
2637  * We have
2638  *
2639  *      - f_u e_l <= f_u f_l g a <= f_l e_u
2640  *
2641  * Since all variables are integer valued, this is equivalent to
2642  *
2643  *      - f_u e_l - (f_u - 1) <= f_u f_l g a <= f_l e_u + (f_l - 1)
2644  *
2645  * If this interval is at least f_u f_l g, then it contains at least
2646  * one integer value for a.
2647  * That is, the test constraint is
2648  *
2649  *      f_l e_u + f_u e_l + f_l - 1 + f_u - 1 + 1 >= f_u f_l g
2650  */
2651 static void construct_test_ineq(struct isl_basic_map *bmap, int i,
2652         int l, int u, isl_int *ineq, isl_int g, isl_int fl, isl_int fu)
2653 {
2654         unsigned dim;
2655         dim = isl_space_dim(bmap->dim, isl_dim_all);
2656
2657         isl_int_gcd(g, bmap->ineq[l][1 + dim + i], bmap->ineq[u][1 + dim + i]);
2658         isl_int_divexact(fl, bmap->ineq[l][1 + dim + i], g);
2659         isl_int_divexact(fu, bmap->ineq[u][1 + dim + i], g);
2660         isl_int_neg(fu, fu);
2661         isl_seq_combine(ineq, fl, bmap->ineq[u], fu, bmap->ineq[l],
2662                         1 + dim + bmap->n_div);
2663         isl_int_add(ineq[0], ineq[0], fl);
2664         isl_int_add(ineq[0], ineq[0], fu);
2665         isl_int_sub_ui(ineq[0], ineq[0], 1);
2666         isl_int_mul(g, g, fl);
2667         isl_int_mul(g, g, fu);
2668         isl_int_sub(ineq[0], ineq[0], g);
2669 }
2670
2671 /* Remove more kinds of divs that are not strictly needed.
2672  * In particular, if all pairs of lower and upper bounds on a div
2673  * are such that they allow at least one integer value of the div,
2674  * the we can eliminate the div using Fourier-Motzkin without
2675  * introducing any spurious solutions.
2676  */
2677 static struct isl_basic_map *drop_more_redundant_divs(
2678         struct isl_basic_map *bmap, int *pairs, int n)
2679 {
2680         struct isl_tab *tab = NULL;
2681         struct isl_vec *vec = NULL;
2682         unsigned dim;
2683         int remove = -1;
2684         isl_int g, fl, fu;
2685
2686         isl_int_init(g);
2687         isl_int_init(fl);
2688         isl_int_init(fu);
2689
2690         if (!bmap)
2691                 goto error;
2692
2693         dim = isl_space_dim(bmap->dim, isl_dim_all);
2694         vec = isl_vec_alloc(bmap->ctx, 1 + dim + bmap->n_div);
2695         if (!vec)
2696                 goto error;
2697
2698         tab = isl_tab_from_basic_map(bmap, 0);
2699
2700         while (n > 0) {
2701                 int i, l, u;
2702                 int best = -1;
2703                 enum isl_lp_result res;
2704
2705                 for (i = 0; i < bmap->n_div; ++i) {
2706                         if (!pairs[i])
2707                                 continue;
2708                         if (best >= 0 && pairs[best] <= pairs[i])
2709                                 continue;
2710                         best = i;
2711                 }
2712
2713                 i = best;
2714                 for (l = 0; l < bmap->n_ineq; ++l) {
2715                         if (!isl_int_is_pos(bmap->ineq[l][1 + dim + i]))
2716                                 continue;
2717                         for (u = 0; u < bmap->n_ineq; ++u) {
2718                                 if (!isl_int_is_neg(bmap->ineq[u][1 + dim + i]))
2719                                         continue;
2720                                 construct_test_ineq(bmap, i, l, u,
2721                                                     vec->el, g, fl, fu);
2722                                 res = isl_tab_min(tab, vec->el,
2723                                                   bmap->ctx->one, &g, NULL, 0);
2724                                 if (res == isl_lp_error)
2725                                         goto error;
2726                                 if (res == isl_lp_empty) {
2727                                         bmap = isl_basic_map_set_to_empty(bmap);
2728                                         break;
2729                                 }
2730                                 if (res != isl_lp_ok || isl_int_is_neg(g))
2731                                         break;
2732                         }
2733                         if (u < bmap->n_ineq)
2734                                 break;
2735                 }
2736                 if (l == bmap->n_ineq) {
2737                         remove = i;
2738                         break;
2739                 }
2740                 pairs[i] = 0;
2741                 --n;
2742         }
2743
2744         isl_tab_free(tab);
2745         isl_vec_free(vec);
2746
2747         isl_int_clear(g);
2748         isl_int_clear(fl);
2749         isl_int_clear(fu);
2750
2751         free(pairs);
2752
2753         if (remove < 0)
2754                 return bmap;
2755
2756         bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, remove, 1);
2757         return isl_basic_map_drop_redundant_divs(bmap);
2758 error:
2759         free(pairs);
2760         isl_basic_map_free(bmap);
2761         isl_tab_free(tab);
2762         isl_vec_free(vec);
2763         isl_int_clear(g);
2764         isl_int_clear(fl);
2765         isl_int_clear(fu);
2766         return NULL;
2767 }
2768
2769 /* Given a pair of divs div1 and div2 such that, expect for the lower bound l
2770  * and the upper bound u, div1 always occurs together with div2 in the form
2771  * (div1 + m div2), where m is the constant range on the variable div1
2772  * allowed by l and u, replace the pair div1 and div2 by a single
2773  * div that is equal to div1 + m div2.
2774  *
2775  * The new div will appear in the location that contains div2.
2776  * We need to modify all constraints that contain
2777  * div2 = (div - div1) / m
2778  * (If a constraint does not contain div2, it will also not contain div1.)
2779  * If the constraint also contains div1, then we know they appear
2780  * as f (div1 + m div2) and we can simply replace (div1 + m div2) by div,
2781  * i.e., the coefficient of div is f.
2782  *
2783  * Otherwise, we first need to introduce div1 into the constraint.
2784  * Let the l be
2785  *
2786  *      div1 + f >=0
2787  *
2788  * and u
2789  *
2790  *      -div1 + f' >= 0
2791  *
2792  * A lower bound on div2
2793  *
2794  *      n div2 + t >= 0
2795  *
2796  * can be replaced by
2797  *
2798  *      (n * (m div 2 + div1) + m t + n f)/g >= 0
2799  *
2800  * with g = gcd(m,n).
2801  * An upper bound
2802  *
2803  *      -n div2 + t >= 0
2804  *
2805  * can be replaced by
2806  *
2807  *      (-n * (m div2 + div1) + m t + n f')/g >= 0
2808  *
2809  * These constraint are those that we would obtain from eliminating
2810  * div1 using Fourier-Motzkin.
2811  *
2812  * After all constraints have been modified, we drop the lower and upper
2813  * bound and then drop div1.
2814  */
2815 static struct isl_basic_map *coalesce_divs(struct isl_basic_map *bmap,
2816         unsigned div1, unsigned div2, unsigned l, unsigned u)
2817 {
2818         isl_int a;
2819         isl_int b;
2820         isl_int m;
2821         unsigned dim, total;
2822         int i;
2823
2824         dim = isl_space_dim(bmap->dim, isl_dim_all);
2825         total = 1 + dim + bmap->n_div;
2826
2827         isl_int_init(a);
2828         isl_int_init(b);
2829         isl_int_init(m);
2830         isl_int_add(m, bmap->ineq[l][0], bmap->ineq[u][0]);
2831         isl_int_add_ui(m, m, 1);
2832
2833         for (i = 0; i < bmap->n_ineq; ++i) {
2834                 if (i == l || i == u)
2835                         continue;
2836                 if (isl_int_is_zero(bmap->ineq[i][1 + dim + div2]))
2837                         continue;
2838                 if (isl_int_is_zero(bmap->ineq[i][1 + dim + div1])) {
2839                         isl_int_gcd(b, m, bmap->ineq[i][1 + dim + div2]);
2840                         isl_int_divexact(a, m, b);
2841                         isl_int_divexact(b, bmap->ineq[i][1 + dim + div2], b);
2842                         if (isl_int_is_pos(b)) {
2843                                 isl_seq_combine(bmap->ineq[i], a, bmap->ineq[i],
2844                                                 b, bmap->ineq[l], total);
2845                         } else {
2846                                 isl_int_neg(b, b);
2847                                 isl_seq_combine(bmap->ineq[i], a, bmap->ineq[i],
2848                                                 b, bmap->ineq[u], total);
2849                         }
2850                 }
2851                 isl_int_set(bmap->ineq[i][1 + dim + div2],
2852                             bmap->ineq[i][1 + dim + div1]);
2853                 isl_int_set_si(bmap->ineq[i][1 + dim + div1], 0);
2854         }
2855
2856         isl_int_clear(a);
2857         isl_int_clear(b);
2858         isl_int_clear(m);
2859         if (l > u) {
2860                 isl_basic_map_drop_inequality(bmap, l);
2861                 isl_basic_map_drop_inequality(bmap, u);
2862         } else {
2863                 isl_basic_map_drop_inequality(bmap, u);
2864                 isl_basic_map_drop_inequality(bmap, l);
2865         }
2866         bmap = isl_basic_map_drop_div(bmap, div1);
2867         return bmap;
2868 }
2869
2870 /* First check if we can coalesce any pair of divs and
2871  * then continue with dropping more redundant divs.
2872  *
2873  * We loop over all pairs of lower and upper bounds on a div
2874  * with coefficient 1 and -1, respectively, check if there
2875  * is any other div "c" with which we can coalesce the div
2876  * and if so, perform the coalescing.
2877  */
2878 static struct isl_basic_map *coalesce_or_drop_more_redundant_divs(
2879         struct isl_basic_map *bmap, int *pairs, int n)
2880 {
2881         int i, l, u;
2882         unsigned dim;
2883
2884         dim = isl_space_dim(bmap->dim, isl_dim_all);
2885
2886         for (i = 0; i < bmap->n_div; ++i) {
2887                 if (!pairs[i])
2888                         continue;
2889                 for (l = 0; l < bmap->n_ineq; ++l) {
2890                         if (!isl_int_is_one(bmap->ineq[l][1 + dim + i]))
2891                                 continue;
2892                         for (u = 0; u < bmap->n_ineq; ++u) {
2893                                 int c;
2894
2895                                 if (!isl_int_is_negone(bmap->ineq[u][1+dim+i]))
2896                                         continue;
2897                                 c = div_find_coalesce(bmap, pairs, i, l, u);
2898                                 if (c < 0)
2899                                         continue;
2900                                 free(pairs);
2901                                 bmap = coalesce_divs(bmap, i, c, l, u);
2902                                 return isl_basic_map_drop_redundant_divs(bmap);
2903                         }
2904                 }
2905         }
2906
2907         if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2908                 return bmap;
2909
2910         return drop_more_redundant_divs(bmap, pairs, n);
2911 }
2912
2913 /* Remove divs that are not strictly needed.
2914  * In particular, if a div only occurs positively (or negatively)
2915  * in constraints, then it can simply be dropped.
2916  * Also, if a div occurs in only two constraints and if moreover
2917  * those two constraints are opposite to each other, except for the constant
2918  * term and if the sum of the constant terms is such that for any value
2919  * of the other values, there is always at least one integer value of the
2920  * div, i.e., if one plus this sum is greater than or equal to
2921  * the (absolute value) of the coefficent of the div in the constraints,
2922  * then we can also simply drop the div.
2923  *
2924  * We skip divs that appear in equalities or in the definition of other divs.
2925  * Divs that appear in the definition of other divs usually occur in at least
2926  * 4 constraints, but the constraints may have been simplified.
2927  *
2928  * If any divs are left after these simple checks then we move on
2929  * to more complicated cases in drop_more_redundant_divs.
2930  */
2931 struct isl_basic_map *isl_basic_map_drop_redundant_divs(
2932         struct isl_basic_map *bmap)
2933 {
2934         int i, j;
2935         unsigned off;
2936         int *pairs = NULL;
2937         int n = 0;
2938
2939         if (!bmap)
2940                 goto error;
2941
2942         off = isl_space_dim(bmap->dim, isl_dim_all);
2943         pairs = isl_calloc_array(bmap->ctx, int, bmap->n_div);
2944         if (!pairs)
2945                 goto error;
2946
2947         for (i = 0; i < bmap->n_div; ++i) {
2948                 int pos, neg;
2949                 int last_pos, last_neg;
2950                 int redundant;
2951                 int defined;
2952
2953                 defined = !isl_int_is_zero(bmap->div[i][0]);
2954                 for (j = i; j < bmap->n_div; ++j)
2955                         if (!isl_int_is_zero(bmap->div[j][1 + 1 + off + i]))
2956                                 break;
2957                 if (j < bmap->n_div)
2958                         continue;
2959                 for (j = 0; j < bmap->n_eq; ++j)
2960                         if (!isl_int_is_zero(bmap->eq[j][1 + off + i]))
2961                                 break;
2962                 if (j < bmap->n_eq)
2963                         continue;
2964                 ++n;
2965                 pos = neg = 0;
2966                 for (j = 0; j < bmap->n_ineq; ++j) {
2967                         if (isl_int_is_pos(bmap->ineq[j][1 + off + i])) {
2968                                 last_pos = j;
2969                                 ++pos;
2970                         }
2971                         if (isl_int_is_neg(bmap->ineq[j][1 + off + i])) {
2972                                 last_neg = j;
2973                                 ++neg;
2974                         }
2975                 }
2976                 pairs[i] = pos * neg;
2977                 if (pairs[i] == 0) {
2978                         for (j = bmap->n_ineq - 1; j >= 0; --j)
2979                                 if (!isl_int_is_zero(bmap->ineq[j][1+off+i]))
2980                                         isl_basic_map_drop_inequality(bmap, j);
2981                         bmap = isl_basic_map_drop_div(bmap, i);
2982                         free(pairs);
2983                         return isl_basic_map_drop_redundant_divs(bmap);
2984                 }
2985                 if (pairs[i] != 1)
2986                         continue;
2987                 if (!isl_seq_is_neg(bmap->ineq[last_pos] + 1,
2988                                     bmap->ineq[last_neg] + 1,
2989                                     off + bmap->n_div))
2990                         continue;
2991
2992                 isl_int_add(bmap->ineq[last_pos][0],
2993                             bmap->ineq[last_pos][0], bmap->ineq[last_neg][0]);
2994                 isl_int_add_ui(bmap->ineq[last_pos][0],
2995                                bmap->ineq[last_pos][0], 1);
2996                 redundant = isl_int_ge(bmap->ineq[last_pos][0],
2997                                 bmap->ineq[last_pos][1+off+i]);
2998                 isl_int_sub_ui(bmap->ineq[last_pos][0],
2999                                bmap->ineq[last_pos][0], 1);
3000                 isl_int_sub(bmap->ineq[last_pos][0],
3001                             bmap->ineq[last_pos][0], bmap->ineq[last_neg][0]);
3002                 if (!redundant) {
3003                         if (defined ||
3004                             !ok_to_set_div_from_bound(bmap, i, last_pos)) {
3005                                 pairs[i] = 0;
3006                                 --n;
3007                                 continue;
3008                         }
3009                         bmap = set_div_from_lower_bound(bmap, i, last_pos);
3010                         bmap = isl_basic_map_simplify(bmap);
3011                         free(pairs);
3012                         return isl_basic_map_drop_redundant_divs(bmap);
3013                 }
3014                 if (last_pos > last_neg) {
3015                         isl_basic_map_drop_inequality(bmap, last_pos);
3016                         isl_basic_map_drop_inequality(bmap, last_neg);
3017                 } else {
3018                         isl_basic_map_drop_inequality(bmap, last_neg);
3019                         isl_basic_map_drop_inequality(bmap, last_pos);
3020                 }
3021                 bmap = isl_basic_map_drop_div(bmap, i);
3022                 free(pairs);
3023                 return isl_basic_map_drop_redundant_divs(bmap);
3024         }
3025
3026         if (n > 0)
3027                 return coalesce_or_drop_more_redundant_divs(bmap, pairs, n);
3028
3029         free(pairs);
3030         return bmap;
3031 error:
3032         free(pairs);
3033         isl_basic_map_free(bmap);
3034         return NULL;
3035 }
3036
3037 struct isl_basic_set *isl_basic_set_drop_redundant_divs(
3038         struct isl_basic_set *bset)
3039 {
3040         return (struct isl_basic_set *)
3041             isl_basic_map_drop_redundant_divs((struct isl_basic_map *)bset);
3042 }
3043
3044 struct isl_map *isl_map_drop_redundant_divs(struct isl_map *map)
3045 {
3046         int i;
3047
3048         if (!map)
3049                 return NULL;
3050         for (i = 0; i < map->n; ++i) {
3051                 map->p[i] = isl_basic_map_drop_redundant_divs(map->p[i]);
3052                 if (!map->p[i])
3053                         goto error;
3054         }
3055         ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3056         return map;
3057 error:
3058         isl_map_free(map);
3059         return NULL;
3060 }
3061
3062 struct isl_set *isl_set_drop_redundant_divs(struct isl_set *set)
3063 {
3064         return (struct isl_set *)
3065             isl_map_drop_redundant_divs((struct isl_map *)set);
3066 }