isl_union_map.c

   1 /*
   2  * Copyright 2010-2011 INRIA Saclay
   3  *
   4  * Use of this software is governed by the MIT license
   5  *
   6  * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
   7  * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
   8  * 91893 Orsay, France
   9  */
  10
  11 #define ISL_DIM_H
  12 #include <isl_map_private.h>
  13 #include <isl/ctx.h>
  14 #include <isl/hash.h>
  15 #include <isl/map.h>
  16 #include <isl/set.h>
  17 #include <isl_space_private.h>
  18 #include <isl_union_map_private.h>
  19 #include <isl/union_set.h>
  20
  21 /* Is this union set a parameter domain?
  22  */
  23 int isl_union_set_is_params(__isl_keep isl_union_set *uset)
  24 {
  25         isl_set *set;
  26         int params;
  27
  28         if (!uset)
  29                 return -1;
  30         if (uset->table.n != 1)
  31                 return 0;
  32
  33         set = isl_set_from_union_set(isl_union_set_copy(uset));
  34         params = isl_set_is_params(set);
  35         isl_set_free(set);
  36         return params;
  37 }
  38
  39 static __isl_give isl_union_map *isl_union_map_alloc(__isl_take isl_space *dim,
  40         int size)
  41 {
  42         isl_union_map *umap;
  43
  44         if (!dim)
  45                 return NULL;
  46
  47         umap = isl_calloc_type(dim->ctx, isl_union_map);
  48         if (!umap)
  49                 return NULL;
  50
  51         umap->ref = 1;
  52         umap->dim = dim;
  53         if (isl_hash_table_init(dim->ctx, &umap->table, size) < 0)
  54                 goto error;
  55
  56         return umap;
  57 error:
  58         isl_space_free(dim);
  59         isl_union_map_free(umap);
  60         return NULL;
  61 }
  62
  63 __isl_give isl_union_map *isl_union_map_empty(__isl_take isl_space *dim)
  64 {
  65         return isl_union_map_alloc(dim, 16);
  66 }
  67
  68 __isl_give isl_union_set *isl_union_set_empty(__isl_take isl_space *dim)
  69 {
  70         return isl_union_map_empty(dim);
  71 }
  72
  73 isl_ctx *isl_union_map_get_ctx(__isl_keep isl_union_map *umap)
  74 {
  75         return umap ? umap->dim->ctx : NULL;
  76 }
  77
  78 isl_ctx *isl_union_set_get_ctx(__isl_keep isl_union_set *uset)
  79 {
  80         return uset ? uset->dim->ctx : NULL;
  81 }
  82
  83 __isl_give isl_space *isl_union_map_get_space(__isl_keep isl_union_map *umap)
  84 {
  85         if (!umap)
  86                 return NULL;
  87         return isl_space_copy(umap->dim);
  88 }
  89
  90 __isl_give isl_space *isl_union_set_get_space(__isl_keep isl_union_set *uset)
  91 {
  92         return isl_union_map_get_space(uset);
  93 }
  94
  95 static int free_umap_entry(void **entry, void *user)
  96 {
  97         isl_map *map = *entry;
  98         isl_map_free(map);
  99         return 0;
 100 }
 101
 102 static int add_map(__isl_take isl_map *map, void *user)
 103 {
 104         isl_union_map **umap = (isl_union_map **)user;
 105
 106         *umap = isl_union_map_add_map(*umap, map);
 107
 108         return 0;
 109 }
 110
 111 __isl_give isl_union_map *isl_union_map_dup(__isl_keep isl_union_map *umap)
 112 {
 113         isl_union_map *dup;
 114
 115         if (!umap)
 116                 return NULL;
 117
 118         dup = isl_union_map_empty(isl_space_copy(umap->dim));
 119         if (isl_union_map_foreach_map(umap, &add_map, &dup) < 0)
 120                 goto error;
 121         return dup;
 122 error:
 123         isl_union_map_free(dup);
 124         return NULL;
 125 }
 126
 127 __isl_give isl_union_map *isl_union_map_cow(__isl_take isl_union_map *umap)
 128 {
 129         if (!umap)
 130                 return NULL;
 131
 132         if (umap->ref == 1)
 133                 return umap;
 134         umap->ref--;
 135         return isl_union_map_dup(umap);
 136 }
 137
 138 struct isl_union_align {
 139         isl_reordering *exp;
 140         isl_union_map *res;
 141 };
 142
 143 static int align_entry(void **entry, void *user)
 144 {
 145         isl_map *map = *entry;
 146         isl_reordering *exp;
 147         struct isl_union_align *data = user;
 148
 149         exp = isl_reordering_extend_space(isl_reordering_copy(data->exp),
 150                                     isl_map_get_space(map));
 151
 152         data->res = isl_union_map_add_map(data->res,
 153                                         isl_map_realign(isl_map_copy(map), exp));
 154
 155         return 0;
 156 }
 157
 158 /* Align the parameters of umap along those of model.
 159  * The result has the parameters of model first, in the same order
 160  * as they appear in model, followed by any remaining parameters of
 161  * umap that do not appear in model.
 162  */
 163 __isl_give isl_union_map *isl_union_map_align_params(
 164         __isl_take isl_union_map *umap, __isl_take isl_space *model)
 165 {
 166         struct isl_union_align data = { NULL, NULL };
 167
 168         if (!umap || !model)
 169                 goto error;
 170
 171         if (isl_space_match(umap->dim, isl_dim_param, model, isl_dim_param)) {
 172                 isl_space_free(model);
 173                 return umap;
 174         }
 175
 176         model = isl_space_params(model);
 177         data.exp = isl_parameter_alignment_reordering(umap->dim, model);
 178         if (!data.exp)
 179                 goto error;
 180
 181         data.res = isl_union_map_alloc(isl_space_copy(data.exp->dim),
 182                                         umap->table.n);
 183         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
 184                                         &align_entry, &data) < 0)
 185                 goto error;
 186
 187         isl_reordering_free(data.exp);
 188         isl_union_map_free(umap);
 189         isl_space_free(model);
 190         return data.res;
 191 error:
 192         isl_reordering_free(data.exp);
 193         isl_union_map_free(umap);
 194         isl_union_map_free(data.res);
 195         isl_space_free(model);
 196         return NULL;
 197 }
 198
 199 __isl_give isl_union_set *isl_union_set_align_params(
 200         __isl_take isl_union_set *uset, __isl_take isl_space *model)
 201 {
 202         return isl_union_map_align_params(uset, model);
 203 }
 204
 205 __isl_give isl_union_map *isl_union_map_union(__isl_take isl_union_map *umap1,
 206         __isl_take isl_union_map *umap2)
 207 {
 208         umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2));
 209         umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1));
 210
 211         umap1 = isl_union_map_cow(umap1);
 212
 213         if (!umap1 || !umap2)
 214                 goto error;
 215
 216         if (isl_union_map_foreach_map(umap2, &add_map, &umap1) < 0)
 217                 goto error;
 218
 219         isl_union_map_free(umap2);
 220
 221         return umap1;
 222 error:
 223         isl_union_map_free(umap1);
 224         isl_union_map_free(umap2);
 225         return NULL;
 226 }
 227
 228 __isl_give isl_union_set *isl_union_set_union(__isl_take isl_union_set *uset1,
 229         __isl_take isl_union_set *uset2)
 230 {
 231         return isl_union_map_union(uset1, uset2);
 232 }
 233
 234 __isl_give isl_union_map *isl_union_map_copy(__isl_keep isl_union_map *umap)
 235 {
 236         if (!umap)
 237                 return NULL;
 238
 239         umap->ref++;
 240         return umap;
 241 }
 242
 243 __isl_give isl_union_set *isl_union_set_copy(__isl_keep isl_union_set *uset)
 244 {
 245         return isl_union_map_copy(uset);
 246 }
 247
 248 void *isl_union_map_free(__isl_take isl_union_map *umap)
 249 {
 250         if (!umap)
 251                 return NULL;
 252
 253         if (--umap->ref > 0)
 254                 return NULL;
 255
 256         isl_hash_table_foreach(umap->dim->ctx, &umap->table,
 257                                &free_umap_entry, NULL);
 258         isl_hash_table_clear(&umap->table);
 259         isl_space_free(umap->dim);
 260         free(umap);
 261         return NULL;
 262 }
 263
 264 void *isl_union_set_free(__isl_take isl_union_set *uset)
 265 {
 266         return isl_union_map_free(uset);
 267 }
 268
 269 static int has_dim(const void *entry, const void *val)
 270 {
 271         isl_map *map = (isl_map *)entry;
 272         isl_space *dim = (isl_space *)val;
 273
 274         return isl_space_is_equal(map->dim, dim);
 275 }
 276
 277 __isl_give isl_union_map *isl_union_map_add_map(__isl_take isl_union_map *umap,
 278         __isl_take isl_map *map)
 279 {
 280         uint32_t hash;
 281         struct isl_hash_table_entry *entry;
 282
 283         if (!map || !umap)
 284                 goto error;
 285
 286         if (isl_map_plain_is_empty(map)) {
 287                 isl_map_free(map);
 288                 return umap;
 289         }
 290
 291         if (!isl_space_match(map->dim, isl_dim_param, umap->dim, isl_dim_param)) {
 292                 umap = isl_union_map_align_params(umap, isl_map_get_space(map));
 293                 map = isl_map_align_params(map, isl_union_map_get_space(umap));
 294         }
 295
 296         umap = isl_union_map_cow(umap);
 297
 298         if (!map || !umap)
 299                 goto error;
 300
 301         hash = isl_space_get_hash(map->dim);
 302         entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
 303                                     &has_dim, map->dim, 1);
 304         if (!entry)
 305                 goto error;
 306
 307         if (!entry->data)
 308                 entry->data = map;
 309         else {
 310                 entry->data = isl_map_union(entry->data, isl_map_copy(map));
 311                 if (!entry->data)
 312                         goto error;
 313                 isl_map_free(map);
 314         }
 315
 316         return umap;
 317 error:
 318         isl_map_free(map);
 319         isl_union_map_free(umap);
 320         return NULL;
 321 }
 322
 323 __isl_give isl_union_set *isl_union_set_add_set(__isl_take isl_union_set *uset,
 324         __isl_take isl_set *set)
 325 {
 326         return isl_union_map_add_map(uset, (isl_map *)set);
 327 }
 328
 329 __isl_give isl_union_map *isl_union_map_from_map(__isl_take isl_map *map)
 330 {
 331         isl_space *dim;
 332         isl_union_map *umap;
 333
 334         if (!map)
 335                 return NULL;
 336
 337         dim = isl_map_get_space(map);
 338         dim = isl_space_params(dim);
 339         umap = isl_union_map_empty(dim);
 340         umap = isl_union_map_add_map(umap, map);
 341
 342         return umap;
 343 }
 344
 345 __isl_give isl_union_set *isl_union_set_from_set(__isl_take isl_set *set)
 346 {
 347         return isl_union_map_from_map((isl_map *)set);
 348 }
 349
 350 __isl_give isl_union_map *isl_union_map_from_basic_map(
 351         __isl_take isl_basic_map *bmap)
 352 {
 353         return isl_union_map_from_map(isl_map_from_basic_map(bmap));
 354 }
 355
 356 __isl_give isl_union_set *isl_union_set_from_basic_set(
 357         __isl_take isl_basic_set *bset)
 358 {
 359         return isl_union_map_from_basic_map(bset);
 360 }
 361
 362 struct isl_union_map_foreach_data
 363 {
 364         int (*fn)(__isl_take isl_map *map, void *user);
 365         void *user;
 366 };
 367
 368 static int call_on_copy(void **entry, void *user)
 369 {
 370         isl_map *map = *entry;
 371         struct isl_union_map_foreach_data *data;
 372         data = (struct isl_union_map_foreach_data *)user;
 373
 374         return data->fn(isl_map_copy(map), data->user);
 375 }
 376
 377 int isl_union_map_n_map(__isl_keep isl_union_map *umap)
 378 {
 379         return umap ? umap->table.n : 0;
 380 }
 381
 382 int isl_union_set_n_set(__isl_keep isl_union_set *uset)
 383 {
 384         return uset ? uset->table.n : 0;
 385 }
 386
 387 int isl_union_map_foreach_map(__isl_keep isl_union_map *umap,
 388         int (*fn)(__isl_take isl_map *map, void *user), void *user)
 389 {
 390         struct isl_union_map_foreach_data data = { fn, user };
 391
 392         if (!umap)
 393                 return -1;
 394
 395         return isl_hash_table_foreach(umap->dim->ctx, &umap->table,
 396                                       &call_on_copy, &data);
 397 }
 398
 399 static int copy_map(void **entry, void *user)
 400 {
 401         isl_map *map = *entry;
 402         isl_map **map_p = user;
 403
 404         *map_p = isl_map_copy(map);
 405
 406         return -1;
 407 }
 408
 409 __isl_give isl_map *isl_map_from_union_map(__isl_take isl_union_map *umap)
 410 {
 411         isl_ctx *ctx;
 412         isl_map *map = NULL;
 413
 414         if (!umap)
 415                 return NULL;
 416         ctx = isl_union_map_get_ctx(umap);
 417         if (umap->table.n != 1)
 418                 isl_die(ctx, isl_error_invalid,
 419                         "union map needs to contain elements in exactly "
 420                         "one space", return isl_union_map_free(umap));
 421
 422         isl_hash_table_foreach(ctx, &umap->table, &copy_map, &map);
 423
 424         isl_union_map_free(umap);
 425
 426         return map;
 427 }
 428
 429 __isl_give isl_set *isl_set_from_union_set(__isl_take isl_union_set *uset)
 430 {
 431         return isl_map_from_union_map(uset);
 432 }
 433
 434 /* Extract the map in "umap" that lives in the given space (ignoring
 435  * parameters).
 436  */
 437 __isl_give isl_map *isl_union_map_extract_map(__isl_keep isl_union_map *umap,
 438         __isl_take isl_space *space)
 439 {
 440         uint32_t hash;
 441         struct isl_hash_table_entry *entry;
 442
 443         space = isl_space_drop_dims(space, isl_dim_param,
 444                                         0, isl_space_dim(space, isl_dim_param));
 445         space = isl_space_align_params(space, isl_union_map_get_space(umap));
 446         if (!umap || !space)
 447                 goto error;
 448
 449         hash = isl_space_get_hash(space);
 450         entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
 451                                     &has_dim, space, 0);
 452         if (!entry)
 453                 return isl_map_empty(space);
 454         isl_space_free(space);
 455         return isl_map_copy(entry->data);
 456 error:
 457         isl_space_free(space);
 458         return NULL;
 459 }
 460
 461 __isl_give isl_set *isl_union_set_extract_set(__isl_keep isl_union_set *uset,
 462         __isl_take isl_space *dim)
 463 {
 464         return (isl_set *)isl_union_map_extract_map(uset, dim);
 465 }
 466
 467 /* Check if umap contains a map in the given space.
 468  */
 469 __isl_give int isl_union_map_contains(__isl_keep isl_union_map *umap,
 470         __isl_keep isl_space *dim)
 471 {
 472         uint32_t hash;
 473         struct isl_hash_table_entry *entry;
 474
 475         if (!umap || !dim)
 476                 return -1;
 477
 478         hash = isl_space_get_hash(dim);
 479         entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
 480                                     &has_dim, dim, 0);
 481         return !!entry;
 482 }
 483
 484 __isl_give int isl_union_set_contains(__isl_keep isl_union_set *uset,
 485         __isl_keep isl_space *dim)
 486 {
 487         return isl_union_map_contains(uset, dim);
 488 }
 489
 490 int isl_union_set_foreach_set(__isl_keep isl_union_set *uset,
 491         int (*fn)(__isl_take isl_set *set, void *user), void *user)
 492 {
 493         return isl_union_map_foreach_map(uset,
 494                 (int(*)(__isl_take isl_map *, void*))fn, user);
 495 }
 496
 497 struct isl_union_set_foreach_point_data {
 498         int (*fn)(__isl_take isl_point *pnt, void *user);
 499         void *user;
 500 };
 501
 502 static int foreach_point(__isl_take isl_set *set, void *user)
 503 {
 504         struct isl_union_set_foreach_point_data *data = user;
 505         int r;
 506
 507         r = isl_set_foreach_point(set, data->fn, data->user);
 508         isl_set_free(set);
 509
 510         return r;
 511 }
 512
 513 int isl_union_set_foreach_point(__isl_keep isl_union_set *uset,
 514         int (*fn)(__isl_take isl_point *pnt, void *user), void *user)
 515 {
 516         struct isl_union_set_foreach_point_data data = { fn, user };
 517         return isl_union_set_foreach_set(uset, &foreach_point, &data);
 518 }
 519
 520 struct isl_union_map_gen_bin_data {
 521         isl_union_map *umap2;
 522         isl_union_map *res;
 523 };
 524
 525 static int subtract_entry(void **entry, void *user)
 526 {
 527         struct isl_union_map_gen_bin_data *data = user;
 528         uint32_t hash;
 529         struct isl_hash_table_entry *entry2;
 530         isl_map *map = *entry;
 531
 532         hash = isl_space_get_hash(map->dim);
 533         entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
 534                                      hash, &has_dim, map->dim, 0);
 535         map = isl_map_copy(map);
 536         if (entry2) {
 537                 int empty;
 538                 map = isl_map_subtract(map, isl_map_copy(entry2->data));
 539
 540                 empty = isl_map_is_empty(map);
 541                 if (empty < 0) {
 542                         isl_map_free(map);
 543                         return -1;
 544                 }
 545                 if (empty) {
 546                         isl_map_free(map);
 547                         return 0;
 548                 }
 549         }
 550         data->res = isl_union_map_add_map(data->res, map);
 551
 552         return 0;
 553 }
 554
 555 static __isl_give isl_union_map *gen_bin_op(__isl_take isl_union_map *umap1,
 556         __isl_take isl_union_map *umap2, int (*fn)(void **, void *))
 557 {
 558         struct isl_union_map_gen_bin_data data = { NULL, NULL };
 559
 560         umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2));
 561         umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1));
 562
 563         if (!umap1 || !umap2)
 564                 goto error;
 565
 566         data.umap2 = umap2;
 567         data.res = isl_union_map_alloc(isl_space_copy(umap1->dim),
 568                                        umap1->table.n);
 569         if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
 570                                    fn, &data) < 0)
 571                 goto error;
 572
 573         isl_union_map_free(umap1);
 574         isl_union_map_free(umap2);
 575         return data.res;
 576 error:
 577         isl_union_map_free(umap1);
 578         isl_union_map_free(umap2);
 579         isl_union_map_free(data.res);
 580         return NULL;
 581 }
 582
 583 __isl_give isl_union_map *isl_union_map_subtract(
 584         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
 585 {
 586         return gen_bin_op(umap1, umap2, &subtract_entry);
 587 }
 588
 589 __isl_give isl_union_set *isl_union_set_subtract(
 590         __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
 591 {
 592         return isl_union_map_subtract(uset1, uset2);
 593 }
 594
 595 struct isl_union_map_gen_bin_set_data {
 596         isl_set *set;
 597         isl_union_map *res;
 598 };
 599
 600 static int intersect_params_entry(void **entry, void *user)
 601 {
 602         struct isl_union_map_gen_bin_set_data *data = user;
 603         isl_map *map = *entry;
 604         int empty;
 605
 606         map = isl_map_copy(map);
 607         map = isl_map_intersect_params(map, isl_set_copy(data->set));
 608
 609         empty = isl_map_is_empty(map);
 610         if (empty < 0) {
 611                 isl_map_free(map);
 612                 return -1;
 613         }
 614
 615         data->res = isl_union_map_add_map(data->res, map);
 616
 617         return 0;
 618 }
 619
 620 static __isl_give isl_union_map *gen_bin_set_op(__isl_take isl_union_map *umap,
 621         __isl_take isl_set *set, int (*fn)(void **, void *))
 622 {
 623         struct isl_union_map_gen_bin_set_data data = { NULL, NULL };
 624
 625         umap = isl_union_map_align_params(umap, isl_set_get_space(set));
 626         set = isl_set_align_params(set, isl_union_map_get_space(umap));
 627
 628         if (!umap || !set)
 629                 goto error;
 630
 631         data.set = set;
 632         data.res = isl_union_map_alloc(isl_space_copy(umap->dim),
 633                                        umap->table.n);
 634         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
 635                                    fn, &data) < 0)
 636                 goto error;
 637
 638         isl_union_map_free(umap);
 639         isl_set_free(set);
 640         return data.res;
 641 error:
 642         isl_union_map_free(umap);
 643         isl_set_free(set);
 644         isl_union_map_free(data.res);
 645         return NULL;
 646 }
 647
 648 __isl_give isl_union_map *isl_union_map_intersect_params(
 649         __isl_take isl_union_map *umap, __isl_take isl_set *set)
 650 {
 651         return gen_bin_set_op(umap, set, &intersect_params_entry);
 652 }
 653
 654 __isl_give isl_union_set *isl_union_set_intersect_params(
 655         __isl_take isl_union_set *uset, __isl_take isl_set *set)
 656 {
 657         return isl_union_map_intersect_params(uset, set);
 658 }
 659
 660 static __isl_give isl_union_map *union_map_intersect_params(
 661         __isl_take isl_union_map *umap, __isl_take isl_union_set *uset)
 662 {
 663         return isl_union_map_intersect_params(umap,
 664                                                 isl_set_from_union_set(uset));
 665 }
 666
 667 static __isl_give isl_union_map *union_map_gist_params(
 668         __isl_take isl_union_map *umap, __isl_take isl_union_set *uset)
 669 {
 670         return isl_union_map_gist_params(umap, isl_set_from_union_set(uset));
 671 }
 672
 673 struct isl_union_map_match_bin_data {
 674         isl_union_map *umap2;
 675         isl_union_map *res;
 676         __isl_give isl_map *(*fn)(__isl_take isl_map*, __isl_take isl_map*);
 677 };
 678
 679 static int match_bin_entry(void **entry, void *user)
 680 {
 681         struct isl_union_map_match_bin_data *data = user;
 682         uint32_t hash;
 683         struct isl_hash_table_entry *entry2;
 684         isl_map *map = *entry;
 685         int empty;
 686
 687         hash = isl_space_get_hash(map->dim);
 688         entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
 689                                      hash, &has_dim, map->dim, 0);
 690         if (!entry2)
 691                 return 0;
 692
 693         map = isl_map_copy(map);
 694         map = data->fn(map, isl_map_copy(entry2->data));
 695
 696         empty = isl_map_is_empty(map);
 697         if (empty < 0) {
 698                 isl_map_free(map);
 699                 return -1;
 700         }
 701         if (empty) {
 702                 isl_map_free(map);
 703                 return 0;
 704         }
 705
 706         data->res = isl_union_map_add_map(data->res, map);
 707
 708         return 0;
 709 }
 710
 711 static __isl_give isl_union_map *match_bin_op(__isl_take isl_union_map *umap1,
 712         __isl_take isl_union_map *umap2,
 713         __isl_give isl_map *(*fn)(__isl_take isl_map*, __isl_take isl_map*))
 714 {
 715         struct isl_union_map_match_bin_data data = { NULL, NULL, fn };
 716
 717         umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2));
 718         umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1));
 719
 720         if (!umap1 || !umap2)
 721                 goto error;
 722
 723         data.umap2 = umap2;
 724         data.res = isl_union_map_alloc(isl_space_copy(umap1->dim),
 725                                        umap1->table.n);
 726         if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
 727                                    &match_bin_entry, &data) < 0)
 728                 goto error;
 729
 730         isl_union_map_free(umap1);
 731         isl_union_map_free(umap2);
 732         return data.res;
 733 error:
 734         isl_union_map_free(umap1);
 735         isl_union_map_free(umap2);
 736         isl_union_map_free(data.res);
 737         return NULL;
 738 }
 739
 740 __isl_give isl_union_map *isl_union_map_intersect(
 741         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
 742 {
 743         return match_bin_op(umap1, umap2, &isl_map_intersect);
 744 }
 745
 746 /* Compute the intersection of the two union_sets.
 747  * As a special case, if exactly one of the two union_sets
 748  * is a parameter domain, then intersect the parameter domain
 749  * of the other one with this set.
 750  */
 751 __isl_give isl_union_set *isl_union_set_intersect(
 752         __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
 753 {
 754         int p1, p2;
 755
 756         p1 = isl_union_set_is_params(uset1);
 757         p2 = isl_union_set_is_params(uset2);
 758         if (p1 < 0 || p2 < 0)
 759                 goto error;
 760         if (!p1 && p2)
 761                 return union_map_intersect_params(uset1, uset2);
 762         if (p1 && !p2)
 763                 return union_map_intersect_params(uset2, uset1);
 764         return isl_union_map_intersect(uset1, uset2);
 765 error:
 766         isl_union_set_free(uset1);
 767         isl_union_set_free(uset2);
 768         return NULL;
 769 }
 770
 771 static int gist_params_entry(void **entry, void *user)
 772 {
 773         struct isl_union_map_gen_bin_set_data *data = user;
 774         isl_map *map = *entry;
 775         int empty;
 776
 777         map = isl_map_copy(map);
 778         map = isl_map_gist_params(map, isl_set_copy(data->set));
 779
 780         empty = isl_map_is_empty(map);
 781         if (empty < 0) {
 782                 isl_map_free(map);
 783                 return -1;
 784         }
 785
 786         data->res = isl_union_map_add_map(data->res, map);
 787
 788         return 0;
 789 }
 790
 791 __isl_give isl_union_map *isl_union_map_gist_params(
 792         __isl_take isl_union_map *umap, __isl_take isl_set *set)
 793 {
 794         return gen_bin_set_op(umap, set, &gist_params_entry);
 795 }
 796
 797 __isl_give isl_union_set *isl_union_set_gist_params(
 798         __isl_take isl_union_set *uset, __isl_take isl_set *set)
 799 {
 800         return isl_union_map_gist_params(uset, set);
 801 }
 802
 803 __isl_give isl_union_map *isl_union_map_gist(__isl_take isl_union_map *umap,
 804         __isl_take isl_union_map *context)
 805 {
 806         return match_bin_op(umap, context, &isl_map_gist);
 807 }
 808
 809 __isl_give isl_union_set *isl_union_set_gist(__isl_take isl_union_set *uset,
 810         __isl_take isl_union_set *context)
 811 {
 812         if (isl_union_set_is_params(context))
 813                 return union_map_gist_params(uset, context);
 814         return isl_union_map_gist(uset, context);
 815 }
 816
 817 static __isl_give isl_map *lex_le_set(__isl_take isl_map *set1,
 818         __isl_take isl_map *set2)
 819 {
 820         return isl_set_lex_le_set((isl_set *)set1, (isl_set *)set2);
 821 }
 822
 823 static __isl_give isl_map *lex_lt_set(__isl_take isl_map *set1,
 824         __isl_take isl_map *set2)
 825 {
 826         return isl_set_lex_lt_set((isl_set *)set1, (isl_set *)set2);
 827 }
 828
 829 __isl_give isl_union_map *isl_union_set_lex_lt_union_set(
 830         __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
 831 {
 832         return match_bin_op(uset1, uset2, &lex_lt_set);
 833 }
 834
 835 __isl_give isl_union_map *isl_union_set_lex_le_union_set(
 836         __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
 837 {
 838         return match_bin_op(uset1, uset2, &lex_le_set);
 839 }
 840
 841 __isl_give isl_union_map *isl_union_set_lex_gt_union_set(
 842         __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
 843 {
 844         return isl_union_map_reverse(isl_union_set_lex_lt_union_set(uset2, uset1));
 845 }
 846
 847 __isl_give isl_union_map *isl_union_set_lex_ge_union_set(
 848         __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
 849 {
 850         return isl_union_map_reverse(isl_union_set_lex_le_union_set(uset2, uset1));
 851 }
 852
 853 __isl_give isl_union_map *isl_union_map_lex_gt_union_map(
 854         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
 855 {
 856         return isl_union_map_reverse(isl_union_map_lex_lt_union_map(umap2, umap1));
 857 }
 858
 859 __isl_give isl_union_map *isl_union_map_lex_ge_union_map(
 860         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
 861 {
 862         return isl_union_map_reverse(isl_union_map_lex_le_union_map(umap2, umap1));
 863 }
 864
 865 static int intersect_domain_entry(void **entry, void *user)
 866 {
 867         struct isl_union_map_gen_bin_data *data = user;
 868         uint32_t hash;
 869         struct isl_hash_table_entry *entry2;
 870         isl_space *dim;
 871         isl_map *map = *entry;
 872         int empty;
 873
 874         dim = isl_map_get_space(map);
 875         dim = isl_space_domain(dim);
 876         hash = isl_space_get_hash(dim);
 877         entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
 878                                      hash, &has_dim, dim, 0);
 879         isl_space_free(dim);
 880         if (!entry2)
 881                 return 0;
 882
 883         map = isl_map_copy(map);
 884         map = isl_map_intersect_domain(map, isl_set_copy(entry2->data));
 885
 886         empty = isl_map_is_empty(map);
 887         if (empty < 0) {
 888                 isl_map_free(map);
 889                 return -1;
 890         }
 891         if (empty) {
 892                 isl_map_free(map);
 893                 return 0;
 894         }
 895
 896         data->res = isl_union_map_add_map(data->res, map);
 897
 898         return 0;
 899 }
 900
 901 /* Intersect the domain of "umap" with "uset".
 902  * If "uset" is a parameters domain, then intersect the parameter
 903  * domain of "umap" with this set.
 904  */
 905 __isl_give isl_union_map *isl_union_map_intersect_domain(
 906         __isl_take isl_union_map *umap, __isl_take isl_union_set *uset)
 907 {
 908         if (isl_union_set_is_params(uset))
 909                 return union_map_intersect_params(umap, uset);
 910         return gen_bin_op(umap, uset, &intersect_domain_entry);
 911 }
 912
 913 /* Remove the elements of data->umap2 from the domain of *entry
 914  * and add the result to data->res.
 915  */
 916 static int subtract_domain_entry(void **entry, void *user)
 917 {
 918         struct isl_union_map_gen_bin_data *data = user;
 919         uint32_t hash;
 920         struct isl_hash_table_entry *entry2;
 921         isl_space *dim;
 922         isl_map *map = *entry;
 923         int empty;
 924
 925         dim = isl_map_get_space(map);
 926         dim = isl_space_domain(dim);
 927         hash = isl_space_get_hash(dim);
 928         entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
 929                                      hash, &has_dim, dim, 0);
 930         isl_space_free(dim);
 931
 932         map = isl_map_copy(map);
 933
 934         if (!entry2) {
 935                 data->res = isl_union_map_add_map(data->res, map);
 936                 return 0;
 937         }
 938
 939         map = isl_map_subtract_domain(map, isl_set_copy(entry2->data));
 940
 941         empty = isl_map_is_empty(map);
 942         if (empty < 0) {
 943                 isl_map_free(map);
 944                 return -1;
 945         }
 946         if (empty) {
 947                 isl_map_free(map);
 948                 return 0;
 949         }
 950
 951         data->res = isl_union_map_add_map(data->res, map);
 952
 953         return 0;
 954 }
 955
 956 /* Remove the elements of "uset" from the domain of "umap".
 957  */
 958 __isl_give isl_union_map *isl_union_map_subtract_domain(
 959         __isl_take isl_union_map *umap, __isl_take isl_union_set *dom)
 960 {
 961         return gen_bin_op(umap, dom, &subtract_domain_entry);
 962 }
 963
 964 static int gist_domain_entry(void **entry, void *user)
 965 {
 966         struct isl_union_map_gen_bin_data *data = user;
 967         uint32_t hash;
 968         struct isl_hash_table_entry *entry2;
 969         isl_space *dim;
 970         isl_map *map = *entry;
 971         int empty;
 972
 973         dim = isl_map_get_space(map);
 974         dim = isl_space_domain(dim);
 975         hash = isl_space_get_hash(dim);
 976         entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
 977                                      hash, &has_dim, dim, 0);
 978         isl_space_free(dim);
 979         if (!entry2)
 980                 return 0;
 981
 982         map = isl_map_copy(map);
 983         map = isl_map_gist_domain(map, isl_set_copy(entry2->data));
 984
 985         empty = isl_map_is_empty(map);
 986         if (empty < 0) {
 987                 isl_map_free(map);
 988                 return -1;
 989         }
 990
 991         data->res = isl_union_map_add_map(data->res, map);
 992
 993         return 0;
 994 }
 995
 996 /* Compute the gist of "umap" with respect to the domain "uset".
 997  * If "uset" is a parameters domain, then compute the gist
 998  * with respect to this parameter domain.
 999  */
1000 __isl_give isl_union_map *isl_union_map_gist_domain(
1001         __isl_take isl_union_map *umap, __isl_take isl_union_set *uset)
1002 {
1003         if (isl_union_set_is_params(uset))
1004                 return union_map_gist_params(umap, uset);
1005         return gen_bin_op(umap, uset, &gist_domain_entry);
1006 }
1007
1008 static int gist_range_entry(void **entry, void *user)
1009 {
1010         struct isl_union_map_gen_bin_data *data = user;
1011         uint32_t hash;
1012         struct isl_hash_table_entry *entry2;
1013         isl_space *space;
1014         isl_map *map = *entry;
1015         int empty;
1016
1017         space = isl_map_get_space(map);
1018         space = isl_space_range(space);
1019         hash = isl_space_get_hash(space);
1020         entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
1021                                      hash, &has_dim, space, 0);
1022         isl_space_free(space);
1023         if (!entry2)
1024                 return 0;
1025
1026         map = isl_map_copy(map);
1027         map = isl_map_gist_range(map, isl_set_copy(entry2->data));
1028
1029         empty = isl_map_is_empty(map);
1030         if (empty < 0) {
1031                 isl_map_free(map);
1032                 return -1;
1033         }
1034
1035         data->res = isl_union_map_add_map(data->res, map);
1036
1037         return 0;
1038 }
1039
1040 /* Compute the gist of "umap" with respect to the range "uset".
1041  */
1042 __isl_give isl_union_map *isl_union_map_gist_range(
1043         __isl_take isl_union_map *umap, __isl_take isl_union_set *uset)
1044 {
1045         return gen_bin_op(umap, uset, &gist_range_entry);
1046 }
1047
1048 static int intersect_range_entry(void **entry, void *user)
1049 {
1050         struct isl_union_map_gen_bin_data *data = user;
1051         uint32_t hash;
1052         struct isl_hash_table_entry *entry2;
1053         isl_space *dim;
1054         isl_map *map = *entry;
1055         int empty;
1056
1057         dim = isl_map_get_space(map);
1058         dim = isl_space_range(dim);
1059         hash = isl_space_get_hash(dim);
1060         entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
1061                                      hash, &has_dim, dim, 0);
1062         isl_space_free(dim);
1063         if (!entry2)
1064                 return 0;
1065
1066         map = isl_map_copy(map);
1067         map = isl_map_intersect_range(map, isl_set_copy(entry2->data));
1068
1069         empty = isl_map_is_empty(map);
1070         if (empty < 0) {
1071                 isl_map_free(map);
1072                 return -1;
1073         }
1074         if (empty) {
1075                 isl_map_free(map);
1076                 return 0;
1077         }
1078
1079         data->res = isl_union_map_add_map(data->res, map);
1080
1081         return 0;
1082 }
1083
1084 __isl_give isl_union_map *isl_union_map_intersect_range(
1085         __isl_take isl_union_map *umap, __isl_take isl_union_set *uset)
1086 {
1087         return gen_bin_op(umap, uset, &intersect_range_entry);
1088 }
1089
1090 struct isl_union_map_bin_data {
1091         isl_union_map *umap2;
1092         isl_union_map *res;
1093         isl_map *map;
1094         int (*fn)(void **entry, void *user);
1095 };
1096
1097 static int apply_range_entry(void **entry, void *user)
1098 {
1099         struct isl_union_map_bin_data *data = user;
1100         isl_map *map2 = *entry;
1101         int empty;
1102
1103         if (!isl_space_tuple_match(data->map->dim, isl_dim_out,
1104                                  map2->dim, isl_dim_in))
1105                 return 0;
1106
1107         map2 = isl_map_apply_range(isl_map_copy(data->map), isl_map_copy(map2));
1108
1109         empty = isl_map_is_empty(map2);
1110         if (empty < 0) {
1111                 isl_map_free(map2);
1112                 return -1;
1113         }
1114         if (empty) {
1115                 isl_map_free(map2);
1116                 return 0;
1117         }
1118
1119         data->res = isl_union_map_add_map(data->res, map2);
1120
1121         return 0;
1122 }
1123
1124 static int bin_entry(void **entry, void *user)
1125 {
1126         struct isl_union_map_bin_data *data = user;
1127         isl_map *map = *entry;
1128
1129         data->map = map;
1130         if (isl_hash_table_foreach(data->umap2->dim->ctx, &data->umap2->table,
1131                                    data->fn, data) < 0)
1132                 return -1;
1133
1134         return 0;
1135 }
1136
1137 static __isl_give isl_union_map *bin_op(__isl_take isl_union_map *umap1,
1138         __isl_take isl_union_map *umap2, int (*fn)(void **entry, void *user))
1139 {
1140         struct isl_union_map_bin_data data = { NULL, NULL, NULL, fn };
1141
1142         umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2));
1143         umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1));
1144
1145         if (!umap1 || !umap2)
1146                 goto error;
1147
1148         data.umap2 = umap2;
1149         data.res = isl_union_map_alloc(isl_space_copy(umap1->dim),
1150                                        umap1->table.n);
1151         if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
1152                                    &bin_entry, &data) < 0)
1153                 goto error;
1154
1155         isl_union_map_free(umap1);
1156         isl_union_map_free(umap2);
1157         return data.res;
1158 error:
1159         isl_union_map_free(umap1);
1160         isl_union_map_free(umap2);
1161         isl_union_map_free(data.res);
1162         return NULL;
1163 }
1164
1165 __isl_give isl_union_map *isl_union_map_apply_range(
1166         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1167 {
1168         return bin_op(umap1, umap2, &apply_range_entry);
1169 }
1170
1171 __isl_give isl_union_map *isl_union_map_apply_domain(
1172         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1173 {
1174         umap1 = isl_union_map_reverse(umap1);
1175         umap1 = isl_union_map_apply_range(umap1, umap2);
1176         return isl_union_map_reverse(umap1);
1177 }
1178
1179 __isl_give isl_union_set *isl_union_set_apply(
1180         __isl_take isl_union_set *uset, __isl_take isl_union_map *umap)
1181 {
1182         return isl_union_map_apply_range(uset, umap);
1183 }
1184
1185 static int map_lex_lt_entry(void **entry, void *user)
1186 {
1187         struct isl_union_map_bin_data *data = user;
1188         isl_map *map2 = *entry;
1189
1190         if (!isl_space_tuple_match(data->map->dim, isl_dim_out,
1191                                  map2->dim, isl_dim_out))
1192                 return 0;
1193
1194         map2 = isl_map_lex_lt_map(isl_map_copy(data->map), isl_map_copy(map2));
1195
1196         data->res = isl_union_map_add_map(data->res, map2);
1197
1198         return 0;
1199 }
1200
1201 __isl_give isl_union_map *isl_union_map_lex_lt_union_map(
1202         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1203 {
1204         return bin_op(umap1, umap2, &map_lex_lt_entry);
1205 }
1206
1207 static int map_lex_le_entry(void **entry, void *user)
1208 {
1209         struct isl_union_map_bin_data *data = user;
1210         isl_map *map2 = *entry;
1211
1212         if (!isl_space_tuple_match(data->map->dim, isl_dim_out,
1213                                  map2->dim, isl_dim_out))
1214                 return 0;
1215
1216         map2 = isl_map_lex_le_map(isl_map_copy(data->map), isl_map_copy(map2));
1217
1218         data->res = isl_union_map_add_map(data->res, map2);
1219
1220         return 0;
1221 }
1222
1223 __isl_give isl_union_map *isl_union_map_lex_le_union_map(
1224         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1225 {
1226         return bin_op(umap1, umap2, &map_lex_le_entry);
1227 }
1228
1229 static int product_entry(void **entry, void *user)
1230 {
1231         struct isl_union_map_bin_data *data = user;
1232         isl_map *map2 = *entry;
1233
1234         map2 = isl_map_product(isl_map_copy(data->map), isl_map_copy(map2));
1235
1236         data->res = isl_union_map_add_map(data->res, map2);
1237
1238         return 0;
1239 }
1240
1241 __isl_give isl_union_map *isl_union_map_product(__isl_take isl_union_map *umap1,
1242         __isl_take isl_union_map *umap2)
1243 {
1244         return bin_op(umap1, umap2, &product_entry);
1245 }
1246
1247 static int set_product_entry(void **entry, void *user)
1248 {
1249         struct isl_union_map_bin_data *data = user;
1250         isl_set *set2 = *entry;
1251
1252         set2 = isl_set_product(isl_set_copy(data->map), isl_set_copy(set2));
1253
1254         data->res = isl_union_set_add_set(data->res, set2);
1255
1256         return 0;
1257 }
1258
1259 __isl_give isl_union_set *isl_union_set_product(__isl_take isl_union_set *uset1,
1260         __isl_take isl_union_set *uset2)
1261 {
1262         return bin_op(uset1, uset2, &set_product_entry);
1263 }
1264
1265 static int domain_product_entry(void **entry, void *user)
1266 {
1267         struct isl_union_map_bin_data *data = user;
1268         isl_map *map2 = *entry;
1269
1270         if (!isl_space_tuple_match(data->map->dim, isl_dim_out,
1271                                  map2->dim, isl_dim_out))
1272                 return 0;
1273
1274         map2 = isl_map_domain_product(isl_map_copy(data->map),
1275                                      isl_map_copy(map2));
1276
1277         data->res = isl_union_map_add_map(data->res, map2);
1278
1279         return 0;
1280 }
1281
1282 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
1283  */
1284 __isl_give isl_union_map *isl_union_map_domain_product(
1285         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1286 {
1287         return bin_op(umap1, umap2, &domain_product_entry);
1288 }
1289
1290 static int range_product_entry(void **entry, void *user)
1291 {
1292         struct isl_union_map_bin_data *data = user;
1293         isl_map *map2 = *entry;
1294
1295         if (!isl_space_tuple_match(data->map->dim, isl_dim_in,
1296                                  map2->dim, isl_dim_in))
1297                 return 0;
1298
1299         map2 = isl_map_range_product(isl_map_copy(data->map),
1300                                      isl_map_copy(map2));
1301
1302         data->res = isl_union_map_add_map(data->res, map2);
1303
1304         return 0;
1305 }
1306
1307 __isl_give isl_union_map *isl_union_map_range_product(
1308         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1309 {
1310         return bin_op(umap1, umap2, &range_product_entry);
1311 }
1312
1313 static int flat_range_product_entry(void **entry, void *user)
1314 {
1315         struct isl_union_map_bin_data *data = user;
1316         isl_map *map2 = *entry;
1317
1318         if (!isl_space_tuple_match(data->map->dim, isl_dim_in,
1319                                  map2->dim, isl_dim_in))
1320                 return 0;
1321
1322         map2 = isl_map_flat_range_product(isl_map_copy(data->map),
1323                                           isl_map_copy(map2));
1324
1325         data->res = isl_union_map_add_map(data->res, map2);
1326
1327         return 0;
1328 }
1329
1330 __isl_give isl_union_map *isl_union_map_flat_range_product(
1331         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1332 {
1333         return bin_op(umap1, umap2, &flat_range_product_entry);
1334 }
1335
1336 static __isl_give isl_union_set *cond_un_op(__isl_take isl_union_map *umap,
1337         int (*fn)(void **, void *))
1338 {
1339         isl_union_set *res;
1340
1341         if (!umap)
1342                 return NULL;
1343
1344         res = isl_union_map_alloc(isl_space_copy(umap->dim), umap->table.n);
1345         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, fn, &res) < 0)
1346                 goto error;
1347
1348         isl_union_map_free(umap);
1349         return res;
1350 error:
1351         isl_union_map_free(umap);
1352         isl_union_set_free(res);
1353         return NULL;
1354 }
1355
1356 static int from_range_entry(void **entry, void *user)
1357 {
1358         isl_map *set = *entry;
1359         isl_union_set **res = user;
1360
1361         *res = isl_union_map_add_map(*res,
1362                                         isl_map_from_range(isl_set_copy(set)));
1363
1364         return 0;
1365 }
1366
1367 __isl_give isl_union_map *isl_union_map_from_range(
1368         __isl_take isl_union_set *uset)
1369 {
1370         return cond_un_op(uset, &from_range_entry);
1371 }
1372
1373 __isl_give isl_union_map *isl_union_map_from_domain(
1374         __isl_take isl_union_set *uset)
1375 {
1376         return isl_union_map_reverse(isl_union_map_from_range(uset));
1377 }
1378
1379 __isl_give isl_union_map *isl_union_map_from_domain_and_range(
1380         __isl_take isl_union_set *domain, __isl_take isl_union_set *range)
1381 {
1382         return isl_union_map_apply_range(isl_union_map_from_domain(domain),
1383                                          isl_union_map_from_range(range));
1384 }
1385
1386 static __isl_give isl_union_map *un_op(__isl_take isl_union_map *umap,
1387         int (*fn)(void **, void *))
1388 {
1389         umap = isl_union_map_cow(umap);
1390         if (!umap)
1391                 return NULL;
1392
1393         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, fn, NULL) < 0)
1394                 goto error;
1395
1396         return umap;
1397 error:
1398         isl_union_map_free(umap);
1399         return NULL;
1400 }
1401
1402 static int affine_entry(void **entry, void *user)
1403 {
1404         isl_map **map = (isl_map **)entry;
1405
1406         *map = isl_map_from_basic_map(isl_map_affine_hull(*map));
1407
1408         return *map ? 0 : -1;
1409 }
1410
1411 __isl_give isl_union_map *isl_union_map_affine_hull(
1412         __isl_take isl_union_map *umap)
1413 {
1414         return un_op(umap, &affine_entry);
1415 }
1416
1417 __isl_give isl_union_set *isl_union_set_affine_hull(
1418         __isl_take isl_union_set *uset)
1419 {
1420         return isl_union_map_affine_hull(uset);
1421 }
1422
1423 static int polyhedral_entry(void **entry, void *user)
1424 {
1425         isl_map **map = (isl_map **)entry;
1426
1427         *map = isl_map_from_basic_map(isl_map_polyhedral_hull(*map));
1428
1429         return *map ? 0 : -1;
1430 }
1431
1432 __isl_give isl_union_map *isl_union_map_polyhedral_hull(
1433         __isl_take isl_union_map *umap)
1434 {
1435         return un_op(umap, &polyhedral_entry);
1436 }
1437
1438 __isl_give isl_union_set *isl_union_set_polyhedral_hull(
1439         __isl_take isl_union_set *uset)
1440 {
1441         return isl_union_map_polyhedral_hull(uset);
1442 }
1443
1444 static int simple_entry(void **entry, void *user)
1445 {
1446         isl_map **map = (isl_map **)entry;
1447
1448         *map = isl_map_from_basic_map(isl_map_simple_hull(*map));
1449
1450         return *map ? 0 : -1;
1451 }
1452
1453 __isl_give isl_union_map *isl_union_map_simple_hull(
1454         __isl_take isl_union_map *umap)
1455 {
1456         return un_op(umap, &simple_entry);
1457 }
1458
1459 __isl_give isl_union_set *isl_union_set_simple_hull(
1460         __isl_take isl_union_set *uset)
1461 {
1462         return isl_union_map_simple_hull(uset);
1463 }
1464
1465 static int inplace_entry(void **entry, void *user)
1466 {
1467         __isl_give isl_map *(*fn)(__isl_take isl_map *);
1468         isl_map **map = (isl_map **)entry;
1469         isl_map *copy;
1470
1471         fn = *(__isl_give isl_map *(**)(__isl_take isl_map *)) user;
1472         copy = fn(isl_map_copy(*map));
1473         if (!copy)
1474                 return -1;
1475
1476         isl_map_free(*map);
1477         *map = copy;
1478
1479         return 0;
1480 }
1481
1482 static __isl_give isl_union_map *inplace(__isl_take isl_union_map *umap,
1483         __isl_give isl_map *(*fn)(__isl_take isl_map *))
1484 {
1485         if (!umap)
1486                 return NULL;
1487
1488         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
1489                                     &inplace_entry, &fn) < 0)
1490                 goto error;
1491
1492         return umap;
1493 error:
1494         isl_union_map_free(umap);
1495         return NULL;
1496 }
1497
1498 __isl_give isl_union_map *isl_union_map_coalesce(
1499         __isl_take isl_union_map *umap)
1500 {
1501         return inplace(umap, &isl_map_coalesce);
1502 }
1503
1504 __isl_give isl_union_set *isl_union_set_coalesce(
1505         __isl_take isl_union_set *uset)
1506 {
1507         return isl_union_map_coalesce(uset);
1508 }
1509
1510 __isl_give isl_union_map *isl_union_map_detect_equalities(
1511         __isl_take isl_union_map *umap)
1512 {
1513         return inplace(umap, &isl_map_detect_equalities);
1514 }
1515
1516 __isl_give isl_union_set *isl_union_set_detect_equalities(
1517         __isl_take isl_union_set *uset)
1518 {
1519         return isl_union_map_detect_equalities(uset);
1520 }
1521
1522 __isl_give isl_union_map *isl_union_map_compute_divs(
1523         __isl_take isl_union_map *umap)
1524 {
1525         return inplace(umap, &isl_map_compute_divs);
1526 }
1527
1528 __isl_give isl_union_set *isl_union_set_compute_divs(
1529         __isl_take isl_union_set *uset)
1530 {
1531         return isl_union_map_compute_divs(uset);
1532 }
1533
1534 static int lexmin_entry(void **entry, void *user)
1535 {
1536         isl_map **map = (isl_map **)entry;
1537
1538         *map = isl_map_lexmin(*map);
1539
1540         return *map ? 0 : -1;
1541 }
1542
1543 __isl_give isl_union_map *isl_union_map_lexmin(
1544         __isl_take isl_union_map *umap)
1545 {
1546         return un_op(umap, &lexmin_entry);
1547 }
1548
1549 __isl_give isl_union_set *isl_union_set_lexmin(
1550         __isl_take isl_union_set *uset)
1551 {
1552         return isl_union_map_lexmin(uset);
1553 }
1554
1555 static int lexmax_entry(void **entry, void *user)
1556 {
1557         isl_map **map = (isl_map **)entry;
1558
1559         *map = isl_map_lexmax(*map);
1560
1561         return *map ? 0 : -1;
1562 }
1563
1564 __isl_give isl_union_map *isl_union_map_lexmax(
1565         __isl_take isl_union_map *umap)
1566 {
1567         return un_op(umap, &lexmax_entry);
1568 }
1569
1570 __isl_give isl_union_set *isl_union_set_lexmax(
1571         __isl_take isl_union_set *uset)
1572 {
1573         return isl_union_map_lexmax(uset);
1574 }
1575
1576 static int universe_entry(void **entry, void *user)
1577 {
1578         isl_map *map = *entry;
1579         isl_union_map **res = user;
1580
1581         map = isl_map_universe(isl_map_get_space(map));
1582         *res = isl_union_map_add_map(*res, map);
1583
1584         return 0;
1585 }
1586
1587 __isl_give isl_union_map *isl_union_map_universe(__isl_take isl_union_map *umap)
1588 {
1589         return cond_un_op(umap, &universe_entry);
1590 }
1591
1592 __isl_give isl_union_set *isl_union_set_universe(__isl_take isl_union_set *uset)
1593 {
1594         return isl_union_map_universe(uset);
1595 }
1596
1597 static int reverse_entry(void **entry, void *user)
1598 {
1599         isl_map *map = *entry;
1600         isl_union_map **res = user;
1601
1602         *res = isl_union_map_add_map(*res, isl_map_reverse(isl_map_copy(map)));
1603
1604         return 0;
1605 }
1606
1607 __isl_give isl_union_map *isl_union_map_reverse(__isl_take isl_union_map *umap)
1608 {
1609         return cond_un_op(umap, &reverse_entry);
1610 }
1611
1612 static int params_entry(void **entry, void *user)
1613 {
1614         isl_map *map = *entry;
1615         isl_union_set **res = user;
1616
1617         *res = isl_union_set_add_set(*res, isl_map_params(isl_map_copy(map)));
1618
1619         return 0;
1620 }
1621
1622 /* Compute the parameter domain of the given union map.
1623  */
1624 __isl_give isl_set *isl_union_map_params(__isl_take isl_union_map *umap)
1625 {
1626         int empty;
1627
1628         empty = isl_union_map_is_empty(umap);
1629         if (empty < 0)
1630                 return isl_union_map_free(umap);
1631         if (empty)
1632                 return isl_set_empty(isl_union_map_get_space(umap));
1633         return isl_set_from_union_set(cond_un_op(umap, &params_entry));
1634 }
1635
1636 /* Compute the parameter domain of the given union set.
1637  */
1638 __isl_give isl_set *isl_union_set_params(__isl_take isl_union_set *uset)
1639 {
1640         return isl_union_map_params(uset);
1641 }
1642
1643 static int domain_entry(void **entry, void *user)
1644 {
1645         isl_map *map = *entry;
1646         isl_union_set **res = user;
1647
1648         *res = isl_union_set_add_set(*res, isl_map_domain(isl_map_copy(map)));
1649
1650         return 0;
1651 }
1652
1653 __isl_give isl_union_set *isl_union_map_domain(__isl_take isl_union_map *umap)
1654 {
1655         return cond_un_op(umap, &domain_entry);
1656 }
1657
1658 static int range_entry(void **entry, void *user)
1659 {
1660         isl_map *map = *entry;
1661         isl_union_set **res = user;
1662
1663         *res = isl_union_set_add_set(*res, isl_map_range(isl_map_copy(map)));
1664
1665         return 0;
1666 }
1667
1668 __isl_give isl_union_set *isl_union_map_range(__isl_take isl_union_map *umap)
1669 {
1670         return cond_un_op(umap, &range_entry);
1671 }
1672
1673 static int domain_map_entry(void **entry, void *user)
1674 {
1675         isl_map *map = *entry;
1676         isl_union_set **res = user;
1677
1678         *res = isl_union_map_add_map(*res,
1679                                         isl_map_domain_map(isl_map_copy(map)));
1680
1681         return 0;
1682 }
1683
1684 __isl_give isl_union_map *isl_union_map_domain_map(
1685         __isl_take isl_union_map *umap)
1686 {
1687         return cond_un_op(umap, &domain_map_entry);
1688 }
1689
1690 static int range_map_entry(void **entry, void *user)
1691 {
1692         isl_map *map = *entry;
1693         isl_union_set **res = user;
1694
1695         *res = isl_union_map_add_map(*res,
1696                                         isl_map_range_map(isl_map_copy(map)));
1697
1698         return 0;
1699 }
1700
1701 __isl_give isl_union_map *isl_union_map_range_map(
1702         __isl_take isl_union_map *umap)
1703 {
1704         return cond_un_op(umap, &range_map_entry);
1705 }
1706
1707 static int deltas_entry(void **entry, void *user)
1708 {
1709         isl_map *map = *entry;
1710         isl_union_set **res = user;
1711
1712         if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
1713                 return 0;
1714
1715         *res = isl_union_set_add_set(*res, isl_map_deltas(isl_map_copy(map)));
1716
1717         return 0;
1718 }
1719
1720 __isl_give isl_union_set *isl_union_map_deltas(__isl_take isl_union_map *umap)
1721 {
1722         return cond_un_op(umap, &deltas_entry);
1723 }
1724
1725 static int deltas_map_entry(void **entry, void *user)
1726 {
1727         isl_map *map = *entry;
1728         isl_union_map **res = user;
1729
1730         if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
1731                 return 0;
1732
1733         *res = isl_union_map_add_map(*res,
1734                                      isl_map_deltas_map(isl_map_copy(map)));
1735
1736         return 0;
1737 }
1738
1739 __isl_give isl_union_map *isl_union_map_deltas_map(
1740         __isl_take isl_union_map *umap)
1741 {
1742         return cond_un_op(umap, &deltas_map_entry);
1743 }
1744
1745 static int identity_entry(void **entry, void *user)
1746 {
1747         isl_set *set = *entry;
1748         isl_union_map **res = user;
1749
1750         *res = isl_union_map_add_map(*res, isl_set_identity(isl_set_copy(set)));
1751
1752         return 0;
1753 }
1754
1755 __isl_give isl_union_map *isl_union_set_identity(__isl_take isl_union_set *uset)
1756 {
1757         return cond_un_op(uset, &identity_entry);
1758 }
1759
1760 static int unwrap_entry(void **entry, void *user)
1761 {
1762         isl_set *set = *entry;
1763         isl_union_set **res = user;
1764
1765         if (!isl_set_is_wrapping(set))
1766                 return 0;
1767
1768         *res = isl_union_map_add_map(*res, isl_set_unwrap(isl_set_copy(set)));
1769
1770         return 0;
1771 }
1772
1773 __isl_give isl_union_map *isl_union_set_unwrap(__isl_take isl_union_set *uset)
1774 {
1775         return cond_un_op(uset, &unwrap_entry);
1776 }
1777
1778 static int wrap_entry(void **entry, void *user)
1779 {
1780         isl_map *map = *entry;
1781         isl_union_set **res = user;
1782
1783         *res = isl_union_set_add_set(*res, isl_map_wrap(isl_map_copy(map)));
1784
1785         return 0;
1786 }
1787
1788 __isl_give isl_union_set *isl_union_map_wrap(__isl_take isl_union_map *umap)
1789 {
1790         return cond_un_op(umap, &wrap_entry);
1791 }
1792
1793 struct isl_union_map_is_subset_data {
1794         isl_union_map *umap2;
1795         int is_subset;
1796 };
1797
1798 static int is_subset_entry(void **entry, void *user)
1799 {
1800         struct isl_union_map_is_subset_data *data = user;
1801         uint32_t hash;
1802         struct isl_hash_table_entry *entry2;
1803         isl_map *map = *entry;
1804
1805         hash = isl_space_get_hash(map->dim);
1806         entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
1807                                      hash, &has_dim, map->dim, 0);
1808         if (!entry2) {
1809                 int empty = isl_map_is_empty(map);
1810                 if (empty < 0)
1811                         return -1;
1812                 if (empty)
1813                         return 0;
1814                 data->is_subset = 0;
1815                 return -1;
1816         }
1817
1818         data->is_subset = isl_map_is_subset(map, entry2->data);
1819         if (data->is_subset < 0 || !data->is_subset)
1820                 return -1;
1821
1822         return 0;
1823 }
1824
1825 int isl_union_map_is_subset(__isl_keep isl_union_map *umap1,
1826         __isl_keep isl_union_map *umap2)
1827 {
1828         struct isl_union_map_is_subset_data data = { NULL, 1 };
1829
1830         umap1 = isl_union_map_copy(umap1);
1831         umap2 = isl_union_map_copy(umap2);
1832         umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2));
1833         umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1));
1834
1835         if (!umap1 || !umap2)
1836                 goto error;
1837
1838         data.umap2 = umap2;
1839         if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
1840                                    &is_subset_entry, &data) < 0 &&
1841             data.is_subset)
1842                 goto error;
1843
1844         isl_union_map_free(umap1);
1845         isl_union_map_free(umap2);
1846
1847         return data.is_subset;
1848 error:
1849         isl_union_map_free(umap1);
1850         isl_union_map_free(umap2);
1851         return -1;
1852 }
1853
1854 int isl_union_set_is_subset(__isl_keep isl_union_set *uset1,
1855         __isl_keep isl_union_set *uset2)
1856 {
1857         return isl_union_map_is_subset(uset1, uset2);
1858 }
1859
1860 int isl_union_map_is_equal(__isl_keep isl_union_map *umap1,
1861         __isl_keep isl_union_map *umap2)
1862 {
1863         int is_subset;
1864
1865         if (!umap1 || !umap2)
1866                 return -1;
1867         is_subset = isl_union_map_is_subset(umap1, umap2);
1868         if (is_subset != 1)
1869                 return is_subset;
1870         is_subset = isl_union_map_is_subset(umap2, umap1);
1871         return is_subset;
1872 }
1873
1874 int isl_union_set_is_equal(__isl_keep isl_union_set *uset1,
1875         __isl_keep isl_union_set *uset2)
1876 {
1877         return isl_union_map_is_equal(uset1, uset2);
1878 }
1879
1880 int isl_union_map_is_strict_subset(__isl_keep isl_union_map *umap1,
1881         __isl_keep isl_union_map *umap2)
1882 {
1883         int is_subset;
1884
1885         if (!umap1 || !umap2)
1886                 return -1;
1887         is_subset = isl_union_map_is_subset(umap1, umap2);
1888         if (is_subset != 1)
1889                 return is_subset;
1890         is_subset = isl_union_map_is_subset(umap2, umap1);
1891         if (is_subset == -1)
1892                 return is_subset;
1893         return !is_subset;
1894 }
1895
1896 int isl_union_set_is_strict_subset(__isl_keep isl_union_set *uset1,
1897         __isl_keep isl_union_set *uset2)
1898 {
1899         return isl_union_map_is_strict_subset(uset1, uset2);
1900 }
1901
1902 static int sample_entry(void **entry, void *user)
1903 {
1904         isl_basic_map **sample = (isl_basic_map **)user;
1905         isl_map *map = *entry;
1906
1907         *sample = isl_map_sample(isl_map_copy(map));
1908         if (!*sample)
1909                 return -1;
1910         if (!isl_basic_map_plain_is_empty(*sample))
1911                 return -1;
1912         return 0;
1913 }
1914
1915 __isl_give isl_basic_map *isl_union_map_sample(__isl_take isl_union_map *umap)
1916 {
1917         isl_basic_map *sample = NULL;
1918
1919         if (!umap)
1920                 return NULL;
1921
1922         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
1923                                    &sample_entry, &sample) < 0 &&
1924             !sample)
1925                 goto error;
1926
1927         if (!sample)
1928                 sample = isl_basic_map_empty(isl_union_map_get_space(umap));
1929
1930         isl_union_map_free(umap);
1931
1932         return sample;
1933 error:
1934         isl_union_map_free(umap);
1935         return NULL;
1936 }
1937
1938 __isl_give isl_basic_set *isl_union_set_sample(__isl_take isl_union_set *uset)
1939 {
1940         return (isl_basic_set *)isl_union_map_sample(uset);
1941 }
1942
1943 struct isl_forall_data {
1944         int res;
1945         int (*fn)(__isl_keep isl_map *map);
1946 };
1947
1948 static int forall_entry(void **entry, void *user)
1949 {
1950         struct isl_forall_data *data = user;
1951         isl_map *map = *entry;
1952
1953         data->res = data->fn(map);
1954         if (data->res < 0)
1955                 return -1;
1956
1957         if (!data->res)
1958                 return -1;
1959
1960         return 0;
1961 }
1962
1963 static int union_map_forall(__isl_keep isl_union_map *umap,
1964         int (*fn)(__isl_keep isl_map *map))
1965 {
1966         struct isl_forall_data data = { 1, fn };
1967
1968         if (!umap)
1969                 return -1;
1970
1971         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
1972                                    &forall_entry, &data) < 0 && data.res)
1973                 return -1;
1974
1975         return data.res;
1976 }
1977
1978 struct isl_forall_user_data {
1979         int res;
1980         int (*fn)(__isl_keep isl_map *map, void *user);
1981         void *user;
1982 };
1983
1984 static int forall_user_entry(void **entry, void *user)
1985 {
1986         struct isl_forall_user_data *data = user;
1987         isl_map *map = *entry;
1988
1989         data->res = data->fn(map, data->user);
1990         if (data->res < 0)
1991                 return -1;
1992
1993         if (!data->res)
1994                 return -1;
1995
1996         return 0;
1997 }
1998
1999 /* Check if fn(map, user) returns true for all maps "map" in umap.
2000  */
2001 static int union_map_forall_user(__isl_keep isl_union_map *umap,
2002         int (*fn)(__isl_keep isl_map *map, void *user), void *user)
2003 {
2004         struct isl_forall_user_data data = { 1, fn, user };
2005
2006         if (!umap)
2007                 return -1;
2008
2009         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
2010                                    &forall_user_entry, &data) < 0 && data.res)
2011                 return -1;
2012
2013         return data.res;
2014 }
2015
2016 int isl_union_map_is_empty(__isl_keep isl_union_map *umap)
2017 {
2018         return union_map_forall(umap, &isl_map_is_empty);
2019 }
2020
2021 int isl_union_set_is_empty(__isl_keep isl_union_set *uset)
2022 {
2023         return isl_union_map_is_empty(uset);
2024 }
2025
2026 static int is_subset_of_identity(__isl_keep isl_map *map)
2027 {
2028         int is_subset;
2029         isl_space *dim;
2030         isl_map *id;
2031
2032         if (!map)
2033                 return -1;
2034
2035         if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
2036                 return 0;
2037
2038         dim = isl_map_get_space(map);
2039         id = isl_map_identity(dim);
2040
2041         is_subset = isl_map_is_subset(map, id);
2042
2043         isl_map_free(id);
2044
2045         return is_subset;
2046 }
2047
2048 /* Check if the given map is single-valued.
2049  * We simply compute
2050  *
2051  *      M \circ M^-1
2052  *
2053  * and check if the result is a subset of the identity mapping.
2054  */
2055 int isl_union_map_is_single_valued(__isl_keep isl_union_map *umap)
2056 {
2057         isl_union_map *test;
2058         int sv;
2059
2060         if (isl_union_map_n_map(umap) == 1) {
2061                 isl_map *map;
2062                 umap = isl_union_map_copy(umap);
2063                 map = isl_map_from_union_map(umap);
2064                 sv = isl_map_is_single_valued(map);
2065                 isl_map_free(map);
2066                 return sv;
2067         }
2068
2069         test = isl_union_map_reverse(isl_union_map_copy(umap));
2070         test = isl_union_map_apply_range(test, isl_union_map_copy(umap));
2071
2072         sv = union_map_forall(test, &is_subset_of_identity);
2073
2074         isl_union_map_free(test);
2075
2076         return sv;
2077 }
2078
2079 int isl_union_map_is_injective(__isl_keep isl_union_map *umap)
2080 {
2081         int in;
2082
2083         umap = isl_union_map_copy(umap);
2084         umap = isl_union_map_reverse(umap);
2085         in = isl_union_map_is_single_valued(umap);
2086         isl_union_map_free(umap);
2087
2088         return in;
2089 }
2090
2091 /* Represents a map that has a fixed value (v) for one of its
2092  * range dimensions.
2093  * The map in this structure is not reference counted, so it
2094  * is only valid while the isl_union_map from which it was
2095  * obtained is still alive.
2096  */
2097 struct isl_fixed_map {
2098         isl_int v;
2099         isl_map *map;
2100 };
2101
2102 static struct isl_fixed_map *alloc_isl_fixed_map_array(isl_ctx *ctx,
2103         int n)
2104 {
2105         int i;
2106         struct isl_fixed_map *v;
2107
2108         v = isl_calloc_array(ctx, struct isl_fixed_map, n);
2109         if (!v)
2110                 return NULL;
2111         for (i = 0; i < n; ++i)
2112                 isl_int_init(v[i].v);
2113         return v;
2114 }
2115
2116 static void free_isl_fixed_map_array(struct isl_fixed_map *v, int n)
2117 {
2118         int i;
2119
2120         if (!v)
2121                 return;
2122         for (i = 0; i < n; ++i)
2123                 isl_int_clear(v[i].v);
2124         free(v);
2125 }
2126
2127 /* Compare the "v" field of two isl_fixed_map structs.
2128  */
2129 static int qsort_fixed_map_cmp(const void *p1, const void *p2)
2130 {
2131         const struct isl_fixed_map *e1 = (const struct isl_fixed_map *) p1;
2132         const struct isl_fixed_map *e2 = (const struct isl_fixed_map *) p2;
2133
2134         return isl_int_cmp(e1->v, e2->v);
2135 }
2136
2137 /* Internal data structure used while checking whether all maps
2138  * in a union_map have a fixed value for a given output dimension.
2139  * v is the list of maps, with the fixed value for the dimension
2140  * n is the number of maps considered so far
2141  * pos is the output dimension under investigation
2142  */
2143 struct isl_fixed_dim_data {
2144         struct isl_fixed_map *v;
2145         int n;
2146         int pos;
2147 };
2148
2149 static int fixed_at_pos(__isl_keep isl_map *map, void *user)
2150 {
2151         struct isl_fixed_dim_data *data = user;
2152
2153         data->v[data->n].map = map;
2154         return isl_map_plain_is_fixed(map, isl_dim_out, data->pos,
2155                                       &data->v[data->n++].v);
2156 }
2157
2158 static int plain_injective_on_range(__isl_take isl_union_map *umap,
2159         int first, int n_range);
2160
2161 /* Given a list of the maps, with their fixed values at output dimension "pos",
2162  * check whether the ranges of the maps form an obvious partition.
2163  *
2164  * We first sort the maps according to their fixed values.
2165  * If all maps have a different value, then we know the ranges form
2166  * a partition.
2167  * Otherwise, we collect the maps with the same fixed value and
2168  * check whether each such collection is obviously injective
2169  * based on later dimensions.
2170  */
2171 static int separates(struct isl_fixed_map *v, int n,
2172         __isl_take isl_space *dim, int pos, int n_range)
2173 {
2174         int i;
2175
2176         if (!v)
2177                 goto error;
2178
2179         qsort(v, n, sizeof(*v), &qsort_fixed_map_cmp);
2180
2181         for (i = 0; i + 1 < n; ++i) {
2182                 int j, k;
2183                 isl_union_map *part;
2184                 int injective;
2185
2186                 for (j = i + 1; j < n; ++j)
2187                         if (isl_int_ne(v[i].v, v[j].v))
2188                                 break;
2189
2190                 if (j == i + 1)
2191                         continue;
2192
2193                 part = isl_union_map_alloc(isl_space_copy(dim), j - i);
2194                 for (k = i; k < j; ++k)
2195                         part = isl_union_map_add_map(part,
2196                                                      isl_map_copy(v[k].map));
2197
2198                 injective = plain_injective_on_range(part, pos + 1, n_range);
2199                 if (injective < 0)
2200                         goto error;
2201                 if (!injective)
2202                         break;
2203
2204                 i = j - 1;
2205         }
2206
2207         isl_space_free(dim);
2208         free_isl_fixed_map_array(v, n);
2209         return i + 1 >= n;
2210 error:
2211         isl_space_free(dim);
2212         free_isl_fixed_map_array(v, n);
2213         return -1;
2214 }
2215
2216 /* Check whether the maps in umap have obviously distinct ranges.
2217  * In particular, check for an output dimension in the range
2218  * [first,n_range) for which all maps have a fixed value
2219  * and then check if these values, possibly along with fixed values
2220  * at later dimensions, entail distinct ranges.
2221  */
2222 static int plain_injective_on_range(__isl_take isl_union_map *umap,
2223         int first, int n_range)
2224 {
2225         isl_ctx *ctx;
2226         int n;
2227         struct isl_fixed_dim_data data = { NULL };
2228
2229         ctx = isl_union_map_get_ctx(umap);
2230
2231         if (!umap)
2232                 goto error;
2233
2234         n = isl_union_map_n_map(umap);
2235         if (n <= 1) {
2236                 isl_union_map_free(umap);
2237                 return 1;
2238         }
2239
2240         if (first >= n_range) {
2241                 isl_union_map_free(umap);
2242                 return 0;
2243         }
2244
2245         data.v = alloc_isl_fixed_map_array(ctx, n);
2246         if (!data.v)
2247                 goto error;
2248
2249         for (data.pos = first; data.pos < n_range; ++data.pos) {
2250                 int fixed;
2251                 int injective;
2252                 isl_space *dim;
2253
2254                 data.n = 0;
2255                 fixed = union_map_forall_user(umap, &fixed_at_pos, &data);
2256                 if (fixed < 0)
2257                         goto error;
2258                 if (!fixed)
2259                         continue;
2260                 dim = isl_union_map_get_space(umap);
2261                 injective = separates(data.v, n, dim, data.pos, n_range);
2262                 isl_union_map_free(umap);
2263                 return injective;
2264         }
2265
2266         free_isl_fixed_map_array(data.v, n);
2267         isl_union_map_free(umap);
2268
2269         return 0;
2270 error:
2271         free_isl_fixed_map_array(data.v, n);
2272         isl_union_map_free(umap);
2273         return -1;
2274 }
2275
2276 /* Check whether the maps in umap that map to subsets of "ran"
2277  * have obviously distinct ranges.
2278  */
2279 static int plain_injective_on_range_wrap(__isl_keep isl_set *ran, void *user)
2280 {
2281         isl_union_map *umap = user;
2282
2283         umap = isl_union_map_copy(umap);
2284         umap = isl_union_map_intersect_range(umap,
2285                         isl_union_set_from_set(isl_set_copy(ran)));
2286         return plain_injective_on_range(umap, 0, isl_set_dim(ran, isl_dim_set));
2287 }
2288
2289 /* Check if the given union_map is obviously injective.
2290  *
2291  * In particular, we first check if all individual maps are obviously
2292  * injective and then check if all the ranges of these maps are
2293  * obviously disjoint.
2294  */
2295 int isl_union_map_plain_is_injective(__isl_keep isl_union_map *umap)
2296 {
2297         int in;
2298         isl_union_map *univ;
2299         isl_union_set *ran;
2300
2301         in = union_map_forall(umap, &isl_map_plain_is_injective);
2302         if (in < 0)
2303                 return -1;
2304         if (!in)
2305                 return 0;
2306
2307         univ = isl_union_map_universe(isl_union_map_copy(umap));
2308         ran = isl_union_map_range(univ);
2309
2310         in = union_map_forall_user(ran, &plain_injective_on_range_wrap, umap);
2311
2312         isl_union_set_free(ran);
2313
2314         return in;
2315 }
2316
2317 int isl_union_map_is_bijective(__isl_keep isl_union_map *umap)
2318 {
2319         int sv;
2320
2321         sv = isl_union_map_is_single_valued(umap);
2322         if (sv < 0 || !sv)
2323                 return sv;
2324
2325         return isl_union_map_is_injective(umap);
2326 }
2327
2328 static int zip_entry(void **entry, void *user)
2329 {
2330         isl_map *map = *entry;
2331         isl_union_map **res = user;
2332
2333         if (!isl_map_can_zip(map))
2334                 return 0;
2335
2336         *res = isl_union_map_add_map(*res, isl_map_zip(isl_map_copy(map)));
2337
2338         return 0;
2339 }
2340
2341 __isl_give isl_union_map *isl_union_map_zip(__isl_take isl_union_map *umap)
2342 {
2343         return cond_un_op(umap, &zip_entry);
2344 }
2345
2346 static int curry_entry(void **entry, void *user)
2347 {
2348         isl_map *map = *entry;
2349         isl_union_map **res = user;
2350
2351         if (!isl_map_can_curry(map))
2352                 return 0;
2353
2354         *res = isl_union_map_add_map(*res, isl_map_curry(isl_map_copy(map)));
2355
2356         return 0;
2357 }
2358
2359 /* Given a union map, take the maps of the form (A -> B) -> C and
2360  * return the union of the corresponding maps A -> (B -> C).
2361  */
2362 __isl_give isl_union_map *isl_union_map_curry(__isl_take isl_union_map *umap)
2363 {
2364         return cond_un_op(umap, &curry_entry);
2365 }
2366
2367 static int lift_entry(void **entry, void *user)
2368 {
2369         isl_set *set = *entry;
2370         isl_union_set **res = user;
2371
2372         *res = isl_union_set_add_set(*res, isl_set_lift(isl_set_copy(set)));
2373
2374         return 0;
2375 }
2376
2377 __isl_give isl_union_set *isl_union_set_lift(__isl_take isl_union_set *uset)
2378 {
2379         return cond_un_op(uset, &lift_entry);
2380 }
2381
2382 static int coefficients_entry(void **entry, void *user)
2383 {
2384         isl_set *set = *entry;
2385         isl_union_set **res = user;
2386
2387         set = isl_set_copy(set);
2388         set = isl_set_from_basic_set(isl_set_coefficients(set));
2389         *res = isl_union_set_add_set(*res, set);
2390
2391         return 0;
2392 }
2393
2394 __isl_give isl_union_set *isl_union_set_coefficients(
2395         __isl_take isl_union_set *uset)
2396 {
2397         isl_ctx *ctx;
2398         isl_space *dim;
2399         isl_union_set *res;
2400
2401         if (!uset)
2402                 return NULL;
2403
2404         ctx = isl_union_set_get_ctx(uset);
2405         dim = isl_space_set_alloc(ctx, 0, 0);
2406         res = isl_union_map_alloc(dim, uset->table.n);
2407         if (isl_hash_table_foreach(uset->dim->ctx, &uset->table,
2408                                    &coefficients_entry, &res) < 0)
2409                 goto error;
2410
2411         isl_union_set_free(uset);
2412         return res;
2413 error:
2414         isl_union_set_free(uset);
2415         isl_union_set_free(res);
2416         return NULL;
2417 }
2418
2419 static int solutions_entry(void **entry, void *user)
2420 {
2421         isl_set *set = *entry;
2422         isl_union_set **res = user;
2423
2424         set = isl_set_copy(set);
2425         set = isl_set_from_basic_set(isl_set_solutions(set));
2426         if (!*res)
2427                 *res = isl_union_set_from_set(set);
2428         else
2429                 *res = isl_union_set_add_set(*res, set);
2430
2431         if (!*res)
2432                 return -1;
2433
2434         return 0;
2435 }
2436
2437 __isl_give isl_union_set *isl_union_set_solutions(
2438         __isl_take isl_union_set *uset)
2439 {
2440         isl_union_set *res = NULL;
2441
2442         if (!uset)
2443                 return NULL;
2444
2445         if (uset->table.n == 0) {
2446                 res = isl_union_set_empty(isl_union_set_get_space(uset));
2447                 isl_union_set_free(uset);
2448                 return res;
2449         }
2450
2451         if (isl_hash_table_foreach(uset->dim->ctx, &uset->table,
2452                                    &solutions_entry, &res) < 0)
2453                 goto error;
2454
2455         isl_union_set_free(uset);
2456         return res;
2457 error:
2458         isl_union_set_free(uset);
2459         isl_union_set_free(res);
2460         return NULL;
2461 }