isl_union_map.c

   1 /*
   2  * Copyright 2010-2011 INRIA Saclay
   3  *
   4  * Use of this software is governed by the GNU LGPLv2.1 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 struct isl_union_map_foreach_data
 351 {
 352         int (*fn)(__isl_take isl_map *map, void *user);
 353         void *user;
 354 };
 355
 356 static int call_on_copy(void **entry, void *user)
 357 {
 358         isl_map *map = *entry;
 359         struct isl_union_map_foreach_data *data;
 360         data = (struct isl_union_map_foreach_data *)user;
 361
 362         return data->fn(isl_map_copy(map), data->user);
 363 }
 364
 365 int isl_union_map_n_map(__isl_keep isl_union_map *umap)
 366 {
 367         return umap ? umap->table.n : 0;
 368 }
 369
 370 int isl_union_set_n_set(__isl_keep isl_union_set *uset)
 371 {
 372         return uset ? uset->table.n : 0;
 373 }
 374
 375 int isl_union_map_foreach_map(__isl_keep isl_union_map *umap,
 376         int (*fn)(__isl_take isl_map *map, void *user), void *user)
 377 {
 378         struct isl_union_map_foreach_data data = { fn, user };
 379
 380         if (!umap)
 381                 return -1;
 382
 383         return isl_hash_table_foreach(umap->dim->ctx, &umap->table,
 384                                       &call_on_copy, &data);
 385 }
 386
 387 static int copy_map(void **entry, void *user)
 388 {
 389         isl_map *map = *entry;
 390         isl_map **map_p = user;
 391
 392         *map_p = isl_map_copy(map);
 393
 394         return -1;
 395 }
 396
 397 __isl_give isl_map *isl_map_from_union_map(__isl_take isl_union_map *umap)
 398 {
 399         isl_ctx *ctx;
 400         isl_map *map = NULL;
 401
 402         if (!umap)
 403                 return NULL;
 404         ctx = isl_union_map_get_ctx(umap);
 405         if (umap->table.n != 1)
 406                 isl_die(ctx, isl_error_invalid,
 407                         "union map needs to contain elements in exactly "
 408                         "one space", return isl_union_map_free(umap));
 409
 410         isl_hash_table_foreach(ctx, &umap->table, &copy_map, &map);
 411
 412         isl_union_map_free(umap);
 413
 414         return map;
 415 }
 416
 417 __isl_give isl_set *isl_set_from_union_set(__isl_take isl_union_set *uset)
 418 {
 419         return isl_map_from_union_map(uset);
 420 }
 421
 422 __isl_give isl_map *isl_union_map_extract_map(__isl_keep isl_union_map *umap,
 423         __isl_take isl_space *dim)
 424 {
 425         uint32_t hash;
 426         struct isl_hash_table_entry *entry;
 427
 428         if (!umap || !dim)
 429                 goto error;
 430
 431         hash = isl_space_get_hash(dim);
 432         entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
 433                                     &has_dim, dim, 0);
 434         if (!entry)
 435                 return isl_map_empty(dim);
 436         isl_space_free(dim);
 437         return isl_map_copy(entry->data);
 438 error:
 439         isl_space_free(dim);
 440         return NULL;
 441 }
 442
 443 __isl_give isl_set *isl_union_set_extract_set(__isl_keep isl_union_set *uset,
 444         __isl_take isl_space *dim)
 445 {
 446         return (isl_set *)isl_union_map_extract_map(uset, dim);
 447 }
 448
 449 /* Check if umap contains a map in the given space.
 450  */
 451 __isl_give int isl_union_map_contains(__isl_keep isl_union_map *umap,
 452         __isl_keep isl_space *dim)
 453 {
 454         uint32_t hash;
 455         struct isl_hash_table_entry *entry;
 456
 457         if (!umap || !dim)
 458                 return -1;
 459
 460         hash = isl_space_get_hash(dim);
 461         entry = isl_hash_table_find(umap->dim->ctx, &umap->table, hash,
 462                                     &has_dim, dim, 0);
 463         return !!entry;
 464 }
 465
 466 __isl_give int isl_union_set_contains(__isl_keep isl_union_set *uset,
 467         __isl_keep isl_space *dim)
 468 {
 469         return isl_union_map_contains(uset, dim);
 470 }
 471
 472 int isl_union_set_foreach_set(__isl_keep isl_union_set *uset,
 473         int (*fn)(__isl_take isl_set *set, void *user), void *user)
 474 {
 475         return isl_union_map_foreach_map(uset,
 476                 (int(*)(__isl_take isl_map *, void*))fn, user);
 477 }
 478
 479 struct isl_union_set_foreach_point_data {
 480         int (*fn)(__isl_take isl_point *pnt, void *user);
 481         void *user;
 482 };
 483
 484 static int foreach_point(__isl_take isl_set *set, void *user)
 485 {
 486         struct isl_union_set_foreach_point_data *data = user;
 487         int r;
 488
 489         r = isl_set_foreach_point(set, data->fn, data->user);
 490         isl_set_free(set);
 491
 492         return r;
 493 }
 494
 495 int isl_union_set_foreach_point(__isl_keep isl_union_set *uset,
 496         int (*fn)(__isl_take isl_point *pnt, void *user), void *user)
 497 {
 498         struct isl_union_set_foreach_point_data data = { fn, user };
 499         return isl_union_set_foreach_set(uset, &foreach_point, &data);
 500 }
 501
 502 struct isl_union_map_gen_bin_data {
 503         isl_union_map *umap2;
 504         isl_union_map *res;
 505 };
 506
 507 static int subtract_entry(void **entry, void *user)
 508 {
 509         struct isl_union_map_gen_bin_data *data = user;
 510         uint32_t hash;
 511         struct isl_hash_table_entry *entry2;
 512         isl_map *map = *entry;
 513
 514         hash = isl_space_get_hash(map->dim);
 515         entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
 516                                      hash, &has_dim, map->dim, 0);
 517         map = isl_map_copy(map);
 518         if (entry2) {
 519                 int empty;
 520                 map = isl_map_subtract(map, isl_map_copy(entry2->data));
 521
 522                 empty = isl_map_is_empty(map);
 523                 if (empty < 0) {
 524                         isl_map_free(map);
 525                         return -1;
 526                 }
 527                 if (empty) {
 528                         isl_map_free(map);
 529                         return 0;
 530                 }
 531         }
 532         data->res = isl_union_map_add_map(data->res, map);
 533
 534         return 0;
 535 }
 536
 537 static __isl_give isl_union_map *gen_bin_op(__isl_take isl_union_map *umap1,
 538         __isl_take isl_union_map *umap2, int (*fn)(void **, void *))
 539 {
 540         struct isl_union_map_gen_bin_data data = { NULL, NULL };
 541
 542         umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2));
 543         umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1));
 544
 545         if (!umap1 || !umap2)
 546                 goto error;
 547
 548         data.umap2 = umap2;
 549         data.res = isl_union_map_alloc(isl_space_copy(umap1->dim),
 550                                        umap1->table.n);
 551         if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
 552                                    fn, &data) < 0)
 553                 goto error;
 554
 555         isl_union_map_free(umap1);
 556         isl_union_map_free(umap2);
 557         return data.res;
 558 error:
 559         isl_union_map_free(umap1);
 560         isl_union_map_free(umap2);
 561         isl_union_map_free(data.res);
 562         return NULL;
 563 }
 564
 565 __isl_give isl_union_map *isl_union_map_subtract(
 566         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
 567 {
 568         return gen_bin_op(umap1, umap2, &subtract_entry);
 569 }
 570
 571 __isl_give isl_union_set *isl_union_set_subtract(
 572         __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
 573 {
 574         return isl_union_map_subtract(uset1, uset2);
 575 }
 576
 577 struct isl_union_map_gen_bin_set_data {
 578         isl_set *set;
 579         isl_union_map *res;
 580 };
 581
 582 static int intersect_params_entry(void **entry, void *user)
 583 {
 584         struct isl_union_map_gen_bin_set_data *data = user;
 585         isl_map *map = *entry;
 586         int empty;
 587
 588         map = isl_map_copy(map);
 589         map = isl_map_intersect_params(map, isl_set_copy(data->set));
 590
 591         empty = isl_map_is_empty(map);
 592         if (empty < 0) {
 593                 isl_map_free(map);
 594                 return -1;
 595         }
 596
 597         data->res = isl_union_map_add_map(data->res, map);
 598
 599         return 0;
 600 }
 601
 602 static __isl_give isl_union_map *gen_bin_set_op(__isl_take isl_union_map *umap,
 603         __isl_take isl_set *set, int (*fn)(void **, void *))
 604 {
 605         struct isl_union_map_gen_bin_set_data data = { NULL, NULL };
 606
 607         umap = isl_union_map_align_params(umap, isl_set_get_space(set));
 608         set = isl_set_align_params(set, isl_union_map_get_space(umap));
 609
 610         if (!umap || !set)
 611                 goto error;
 612
 613         data.set = set;
 614         data.res = isl_union_map_alloc(isl_space_copy(umap->dim),
 615                                        umap->table.n);
 616         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
 617                                    fn, &data) < 0)
 618                 goto error;
 619
 620         isl_union_map_free(umap);
 621         isl_set_free(set);
 622         return data.res;
 623 error:
 624         isl_union_map_free(umap);
 625         isl_set_free(set);
 626         isl_union_map_free(data.res);
 627         return NULL;
 628 }
 629
 630 __isl_give isl_union_map *isl_union_map_intersect_params(
 631         __isl_take isl_union_map *umap, __isl_take isl_set *set)
 632 {
 633         return gen_bin_set_op(umap, set, &intersect_params_entry);
 634 }
 635
 636 __isl_give isl_union_set *isl_union_set_intersect_params(
 637         __isl_take isl_union_set *uset, __isl_take isl_set *set)
 638 {
 639         return isl_union_map_intersect_params(uset, set);
 640 }
 641
 642 static __isl_give isl_union_map *union_map_intersect_params(
 643         __isl_take isl_union_map *umap, __isl_take isl_union_set *uset)
 644 {
 645         return isl_union_map_intersect_params(umap,
 646                                                 isl_set_from_union_set(uset));
 647 }
 648
 649 struct isl_union_map_match_bin_data {
 650         isl_union_map *umap2;
 651         isl_union_map *res;
 652         __isl_give isl_map *(*fn)(__isl_take isl_map*, __isl_take isl_map*);
 653 };
 654
 655 static int match_bin_entry(void **entry, void *user)
 656 {
 657         struct isl_union_map_match_bin_data *data = user;
 658         uint32_t hash;
 659         struct isl_hash_table_entry *entry2;
 660         isl_map *map = *entry;
 661         int empty;
 662
 663         hash = isl_space_get_hash(map->dim);
 664         entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
 665                                      hash, &has_dim, map->dim, 0);
 666         if (!entry2)
 667                 return 0;
 668
 669         map = isl_map_copy(map);
 670         map = data->fn(map, isl_map_copy(entry2->data));
 671
 672         empty = isl_map_is_empty(map);
 673         if (empty < 0) {
 674                 isl_map_free(map);
 675                 return -1;
 676         }
 677         if (empty) {
 678                 isl_map_free(map);
 679                 return 0;
 680         }
 681
 682         data->res = isl_union_map_add_map(data->res, map);
 683
 684         return 0;
 685 }
 686
 687 static __isl_give isl_union_map *match_bin_op(__isl_take isl_union_map *umap1,
 688         __isl_take isl_union_map *umap2,
 689         __isl_give isl_map *(*fn)(__isl_take isl_map*, __isl_take isl_map*))
 690 {
 691         struct isl_union_map_match_bin_data data = { NULL, NULL, fn };
 692
 693         umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2));
 694         umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1));
 695
 696         if (!umap1 || !umap2)
 697                 goto error;
 698
 699         data.umap2 = umap2;
 700         data.res = isl_union_map_alloc(isl_space_copy(umap1->dim),
 701                                        umap1->table.n);
 702         if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
 703                                    &match_bin_entry, &data) < 0)
 704                 goto error;
 705
 706         isl_union_map_free(umap1);
 707         isl_union_map_free(umap2);
 708         return data.res;
 709 error:
 710         isl_union_map_free(umap1);
 711         isl_union_map_free(umap2);
 712         isl_union_map_free(data.res);
 713         return NULL;
 714 }
 715
 716 __isl_give isl_union_map *isl_union_map_intersect(
 717         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
 718 {
 719         return match_bin_op(umap1, umap2, &isl_map_intersect);
 720 }
 721
 722 /* Compute the intersection of the two union_sets.
 723  * As a special case, if exactly one of the two union_sets
 724  * is a parameter domain, then intersect the parameter domain
 725  * of the other one with this set.
 726  */
 727 __isl_give isl_union_set *isl_union_set_intersect(
 728         __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
 729 {
 730         int p1, p2;
 731
 732         p1 = isl_union_set_is_params(uset1);
 733         p2 = isl_union_set_is_params(uset2);
 734         if (p1 < 0 || p2 < 0)
 735                 goto error;
 736         if (!p1 && p2)
 737                 return union_map_intersect_params(uset1, uset2);
 738         if (p1 && !p2)
 739                 return union_map_intersect_params(uset2, uset1);
 740         return isl_union_map_intersect(uset1, uset2);
 741 error:
 742         isl_union_set_free(uset1);
 743         isl_union_set_free(uset2);
 744         return NULL;
 745 }
 746
 747 __isl_give isl_union_map *isl_union_map_gist(__isl_take isl_union_map *umap,
 748         __isl_take isl_union_map *context)
 749 {
 750         return match_bin_op(umap, context, &isl_map_gist);
 751 }
 752
 753 __isl_give isl_union_set *isl_union_set_gist(__isl_take isl_union_set *uset,
 754         __isl_take isl_union_set *context)
 755 {
 756         return isl_union_map_gist(uset, context);
 757 }
 758
 759 static __isl_give isl_map *lex_le_set(__isl_take isl_map *set1,
 760         __isl_take isl_map *set2)
 761 {
 762         return isl_set_lex_le_set((isl_set *)set1, (isl_set *)set2);
 763 }
 764
 765 static __isl_give isl_map *lex_lt_set(__isl_take isl_map *set1,
 766         __isl_take isl_map *set2)
 767 {
 768         return isl_set_lex_lt_set((isl_set *)set1, (isl_set *)set2);
 769 }
 770
 771 __isl_give isl_union_map *isl_union_set_lex_lt_union_set(
 772         __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
 773 {
 774         return match_bin_op(uset1, uset2, &lex_lt_set);
 775 }
 776
 777 __isl_give isl_union_map *isl_union_set_lex_le_union_set(
 778         __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
 779 {
 780         return match_bin_op(uset1, uset2, &lex_le_set);
 781 }
 782
 783 __isl_give isl_union_map *isl_union_set_lex_gt_union_set(
 784         __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
 785 {
 786         return isl_union_map_reverse(isl_union_set_lex_lt_union_set(uset2, uset1));
 787 }
 788
 789 __isl_give isl_union_map *isl_union_set_lex_ge_union_set(
 790         __isl_take isl_union_set *uset1, __isl_take isl_union_set *uset2)
 791 {
 792         return isl_union_map_reverse(isl_union_set_lex_le_union_set(uset2, uset1));
 793 }
 794
 795 __isl_give isl_union_map *isl_union_map_lex_gt_union_map(
 796         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
 797 {
 798         return isl_union_map_reverse(isl_union_map_lex_lt_union_map(umap2, umap1));
 799 }
 800
 801 __isl_give isl_union_map *isl_union_map_lex_ge_union_map(
 802         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
 803 {
 804         return isl_union_map_reverse(isl_union_map_lex_le_union_map(umap2, umap1));
 805 }
 806
 807 static int intersect_domain_entry(void **entry, void *user)
 808 {
 809         struct isl_union_map_gen_bin_data *data = user;
 810         uint32_t hash;
 811         struct isl_hash_table_entry *entry2;
 812         isl_space *dim;
 813         isl_map *map = *entry;
 814         int empty;
 815
 816         dim = isl_map_get_space(map);
 817         dim = isl_space_domain(dim);
 818         hash = isl_space_get_hash(dim);
 819         entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
 820                                      hash, &has_dim, dim, 0);
 821         isl_space_free(dim);
 822         if (!entry2)
 823                 return 0;
 824
 825         map = isl_map_copy(map);
 826         map = isl_map_intersect_domain(map, isl_set_copy(entry2->data));
 827
 828         empty = isl_map_is_empty(map);
 829         if (empty < 0) {
 830                 isl_map_free(map);
 831                 return -1;
 832         }
 833         if (empty) {
 834                 isl_map_free(map);
 835                 return 0;
 836         }
 837
 838         data->res = isl_union_map_add_map(data->res, map);
 839
 840         return 0;
 841 }
 842
 843 __isl_give isl_union_map *isl_union_map_intersect_domain(
 844         __isl_take isl_union_map *umap, __isl_take isl_union_set *uset)
 845 {
 846         return gen_bin_op(umap, uset, &intersect_domain_entry);
 847 }
 848
 849 static int intersect_range_entry(void **entry, void *user)
 850 {
 851         struct isl_union_map_gen_bin_data *data = user;
 852         uint32_t hash;
 853         struct isl_hash_table_entry *entry2;
 854         isl_space *dim;
 855         isl_map *map = *entry;
 856         int empty;
 857
 858         dim = isl_map_get_space(map);
 859         dim = isl_space_range(dim);
 860         hash = isl_space_get_hash(dim);
 861         entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
 862                                      hash, &has_dim, dim, 0);
 863         isl_space_free(dim);
 864         if (!entry2)
 865                 return 0;
 866
 867         map = isl_map_copy(map);
 868         map = isl_map_intersect_range(map, isl_set_copy(entry2->data));
 869
 870         empty = isl_map_is_empty(map);
 871         if (empty < 0) {
 872                 isl_map_free(map);
 873                 return -1;
 874         }
 875         if (empty) {
 876                 isl_map_free(map);
 877                 return 0;
 878         }
 879
 880         data->res = isl_union_map_add_map(data->res, map);
 881
 882         return 0;
 883 }
 884
 885 __isl_give isl_union_map *isl_union_map_intersect_range(
 886         __isl_take isl_union_map *umap, __isl_take isl_union_set *uset)
 887 {
 888         return gen_bin_op(umap, uset, &intersect_range_entry);
 889 }
 890
 891 struct isl_union_map_bin_data {
 892         isl_union_map *umap2;
 893         isl_union_map *res;
 894         isl_map *map;
 895         int (*fn)(void **entry, void *user);
 896 };
 897
 898 static int apply_range_entry(void **entry, void *user)
 899 {
 900         struct isl_union_map_bin_data *data = user;
 901         isl_map *map2 = *entry;
 902         int empty;
 903
 904         if (!isl_space_tuple_match(data->map->dim, isl_dim_out,
 905                                  map2->dim, isl_dim_in))
 906                 return 0;
 907
 908         map2 = isl_map_apply_range(isl_map_copy(data->map), isl_map_copy(map2));
 909
 910         empty = isl_map_is_empty(map2);
 911         if (empty < 0) {
 912                 isl_map_free(map2);
 913                 return -1;
 914         }
 915         if (empty) {
 916                 isl_map_free(map2);
 917                 return 0;
 918         }
 919
 920         data->res = isl_union_map_add_map(data->res, map2);
 921
 922         return 0;
 923 }
 924
 925 static int bin_entry(void **entry, void *user)
 926 {
 927         struct isl_union_map_bin_data *data = user;
 928         isl_map *map = *entry;
 929
 930         data->map = map;
 931         if (isl_hash_table_foreach(data->umap2->dim->ctx, &data->umap2->table,
 932                                    data->fn, data) < 0)
 933                 return -1;
 934
 935         return 0;
 936 }
 937
 938 static __isl_give isl_union_map *bin_op(__isl_take isl_union_map *umap1,
 939         __isl_take isl_union_map *umap2, int (*fn)(void **entry, void *user))
 940 {
 941         struct isl_union_map_bin_data data = { NULL, NULL, NULL, fn };
 942
 943         umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2));
 944         umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1));
 945
 946         if (!umap1 || !umap2)
 947                 goto error;
 948
 949         data.umap2 = umap2;
 950         data.res = isl_union_map_alloc(isl_space_copy(umap1->dim),
 951                                        umap1->table.n);
 952         if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
 953                                    &bin_entry, &data) < 0)
 954                 goto error;
 955
 956         isl_union_map_free(umap1);
 957         isl_union_map_free(umap2);
 958         return data.res;
 959 error:
 960         isl_union_map_free(umap1);
 961         isl_union_map_free(umap2);
 962         isl_union_map_free(data.res);
 963         return NULL;
 964 }
 965
 966 __isl_give isl_union_map *isl_union_map_apply_range(
 967         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
 968 {
 969         return bin_op(umap1, umap2, &apply_range_entry);
 970 }
 971
 972 __isl_give isl_union_map *isl_union_map_apply_domain(
 973         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
 974 {
 975         umap1 = isl_union_map_reverse(umap1);
 976         umap1 = isl_union_map_apply_range(umap1, umap2);
 977         return isl_union_map_reverse(umap1);
 978 }
 979
 980 __isl_give isl_union_set *isl_union_set_apply(
 981         __isl_take isl_union_set *uset, __isl_take isl_union_map *umap)
 982 {
 983         return isl_union_map_apply_range(uset, umap);
 984 }
 985
 986 static int map_lex_lt_entry(void **entry, void *user)
 987 {
 988         struct isl_union_map_bin_data *data = user;
 989         isl_map *map2 = *entry;
 990
 991         if (!isl_space_tuple_match(data->map->dim, isl_dim_out,
 992                                  map2->dim, isl_dim_out))
 993                 return 0;
 994
 995         map2 = isl_map_lex_lt_map(isl_map_copy(data->map), isl_map_copy(map2));
 996
 997         data->res = isl_union_map_add_map(data->res, map2);
 998
 999         return 0;
1000 }
1001
1002 __isl_give isl_union_map *isl_union_map_lex_lt_union_map(
1003         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1004 {
1005         return bin_op(umap1, umap2, &map_lex_lt_entry);
1006 }
1007
1008 static int map_lex_le_entry(void **entry, void *user)
1009 {
1010         struct isl_union_map_bin_data *data = user;
1011         isl_map *map2 = *entry;
1012
1013         if (!isl_space_tuple_match(data->map->dim, isl_dim_out,
1014                                  map2->dim, isl_dim_out))
1015                 return 0;
1016
1017         map2 = isl_map_lex_le_map(isl_map_copy(data->map), isl_map_copy(map2));
1018
1019         data->res = isl_union_map_add_map(data->res, map2);
1020
1021         return 0;
1022 }
1023
1024 __isl_give isl_union_map *isl_union_map_lex_le_union_map(
1025         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1026 {
1027         return bin_op(umap1, umap2, &map_lex_le_entry);
1028 }
1029
1030 static int product_entry(void **entry, void *user)
1031 {
1032         struct isl_union_map_bin_data *data = user;
1033         isl_map *map2 = *entry;
1034
1035         map2 = isl_map_product(isl_map_copy(data->map), isl_map_copy(map2));
1036
1037         data->res = isl_union_map_add_map(data->res, map2);
1038
1039         return 0;
1040 }
1041
1042 __isl_give isl_union_map *isl_union_map_product(__isl_take isl_union_map *umap1,
1043         __isl_take isl_union_map *umap2)
1044 {
1045         return bin_op(umap1, umap2, &product_entry);
1046 }
1047
1048 __isl_give isl_union_set *isl_union_set_product(__isl_take isl_union_set *uset1,
1049         __isl_take isl_union_set *uset2)
1050 {
1051         return isl_union_map_product(uset1, uset2);
1052 }
1053
1054 static int range_product_entry(void **entry, void *user)
1055 {
1056         struct isl_union_map_bin_data *data = user;
1057         isl_map *map2 = *entry;
1058
1059         if (!isl_space_tuple_match(data->map->dim, isl_dim_in,
1060                                  map2->dim, isl_dim_in))
1061                 return 0;
1062
1063         map2 = isl_map_range_product(isl_map_copy(data->map),
1064                                      isl_map_copy(map2));
1065
1066         data->res = isl_union_map_add_map(data->res, map2);
1067
1068         return 0;
1069 }
1070
1071 __isl_give isl_union_map *isl_union_map_range_product(
1072         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1073 {
1074         return bin_op(umap1, umap2, &range_product_entry);
1075 }
1076
1077 static int flat_range_product_entry(void **entry, void *user)
1078 {
1079         struct isl_union_map_bin_data *data = user;
1080         isl_map *map2 = *entry;
1081
1082         if (!isl_space_tuple_match(data->map->dim, isl_dim_in,
1083                                  map2->dim, isl_dim_in))
1084                 return 0;
1085
1086         map2 = isl_map_flat_range_product(isl_map_copy(data->map),
1087                                           isl_map_copy(map2));
1088
1089         data->res = isl_union_map_add_map(data->res, map2);
1090
1091         return 0;
1092 }
1093
1094 __isl_give isl_union_map *isl_union_map_flat_range_product(
1095         __isl_take isl_union_map *umap1, __isl_take isl_union_map *umap2)
1096 {
1097         return bin_op(umap1, umap2, &flat_range_product_entry);
1098 }
1099
1100 static __isl_give isl_union_set *cond_un_op(__isl_take isl_union_map *umap,
1101         int (*fn)(void **, void *))
1102 {
1103         isl_union_set *res;
1104
1105         if (!umap)
1106                 return NULL;
1107
1108         res = isl_union_map_alloc(isl_space_copy(umap->dim), umap->table.n);
1109         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, fn, &res) < 0)
1110                 goto error;
1111
1112         isl_union_map_free(umap);
1113         return res;
1114 error:
1115         isl_union_map_free(umap);
1116         isl_union_set_free(res);
1117         return NULL;
1118 }
1119
1120 static int from_range_entry(void **entry, void *user)
1121 {
1122         isl_map *set = *entry;
1123         isl_union_set **res = user;
1124
1125         *res = isl_union_map_add_map(*res,
1126                                         isl_map_from_range(isl_set_copy(set)));
1127
1128         return 0;
1129 }
1130
1131 __isl_give isl_union_map *isl_union_map_from_range(
1132         __isl_take isl_union_set *uset)
1133 {
1134         return cond_un_op(uset, &from_range_entry);
1135 }
1136
1137 __isl_give isl_union_map *isl_union_map_from_domain(
1138         __isl_take isl_union_set *uset)
1139 {
1140         return isl_union_map_reverse(isl_union_map_from_range(uset));
1141 }
1142
1143 __isl_give isl_union_map *isl_union_map_from_domain_and_range(
1144         __isl_take isl_union_set *domain, __isl_take isl_union_set *range)
1145 {
1146         return isl_union_map_apply_range(isl_union_map_from_domain(domain),
1147                                          isl_union_map_from_range(range));
1148 }
1149
1150 static __isl_give isl_union_map *un_op(__isl_take isl_union_map *umap,
1151         int (*fn)(void **, void *))
1152 {
1153         umap = isl_union_map_cow(umap);
1154         if (!umap)
1155                 return NULL;
1156
1157         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table, fn, NULL) < 0)
1158                 goto error;
1159
1160         return umap;
1161 error:
1162         isl_union_map_free(umap);
1163         return NULL;
1164 }
1165
1166 static int affine_entry(void **entry, void *user)
1167 {
1168         isl_map **map = (isl_map **)entry;
1169
1170         *map = isl_map_from_basic_map(isl_map_affine_hull(*map));
1171
1172         return *map ? 0 : -1;
1173 }
1174
1175 __isl_give isl_union_map *isl_union_map_affine_hull(
1176         __isl_take isl_union_map *umap)
1177 {
1178         return un_op(umap, &affine_entry);
1179 }
1180
1181 __isl_give isl_union_set *isl_union_set_affine_hull(
1182         __isl_take isl_union_set *uset)
1183 {
1184         return isl_union_map_affine_hull(uset);
1185 }
1186
1187 static int polyhedral_entry(void **entry, void *user)
1188 {
1189         isl_map **map = (isl_map **)entry;
1190
1191         *map = isl_map_from_basic_map(isl_map_polyhedral_hull(*map));
1192
1193         return *map ? 0 : -1;
1194 }
1195
1196 __isl_give isl_union_map *isl_union_map_polyhedral_hull(
1197         __isl_take isl_union_map *umap)
1198 {
1199         return un_op(umap, &polyhedral_entry);
1200 }
1201
1202 __isl_give isl_union_set *isl_union_set_polyhedral_hull(
1203         __isl_take isl_union_set *uset)
1204 {
1205         return isl_union_map_polyhedral_hull(uset);
1206 }
1207
1208 static int simple_entry(void **entry, void *user)
1209 {
1210         isl_map **map = (isl_map **)entry;
1211
1212         *map = isl_map_from_basic_map(isl_map_simple_hull(*map));
1213
1214         return *map ? 0 : -1;
1215 }
1216
1217 __isl_give isl_union_map *isl_union_map_simple_hull(
1218         __isl_take isl_union_map *umap)
1219 {
1220         return un_op(umap, &simple_entry);
1221 }
1222
1223 __isl_give isl_union_set *isl_union_set_simple_hull(
1224         __isl_take isl_union_set *uset)
1225 {
1226         return isl_union_map_simple_hull(uset);
1227 }
1228
1229 static int inplace_entry(void **entry, void *user)
1230 {
1231         __isl_give isl_map *(*fn)(__isl_take isl_map *);
1232         isl_map **map = (isl_map **)entry;
1233         isl_map *copy;
1234
1235         fn = *(__isl_give isl_map *(**)(__isl_take isl_map *)) user;
1236         copy = fn(isl_map_copy(*map));
1237         if (!copy)
1238                 return -1;
1239
1240         isl_map_free(*map);
1241         *map = copy;
1242
1243         return 0;
1244 }
1245
1246 static __isl_give isl_union_map *inplace(__isl_take isl_union_map *umap,
1247         __isl_give isl_map *(*fn)(__isl_take isl_map *))
1248 {
1249         if (!umap)
1250                 return NULL;
1251
1252         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
1253                                     &inplace_entry, &fn) < 0)
1254                 goto error;
1255
1256         return umap;
1257 error:
1258         isl_union_map_free(umap);
1259         return NULL;
1260 }
1261
1262 __isl_give isl_union_map *isl_union_map_coalesce(
1263         __isl_take isl_union_map *umap)
1264 {
1265         return inplace(umap, &isl_map_coalesce);
1266 }
1267
1268 __isl_give isl_union_set *isl_union_set_coalesce(
1269         __isl_take isl_union_set *uset)
1270 {
1271         return isl_union_map_coalesce(uset);
1272 }
1273
1274 __isl_give isl_union_map *isl_union_map_detect_equalities(
1275         __isl_take isl_union_map *umap)
1276 {
1277         return inplace(umap, &isl_map_detect_equalities);
1278 }
1279
1280 __isl_give isl_union_set *isl_union_set_detect_equalities(
1281         __isl_take isl_union_set *uset)
1282 {
1283         return isl_union_map_detect_equalities(uset);
1284 }
1285
1286 __isl_give isl_union_map *isl_union_map_compute_divs(
1287         __isl_take isl_union_map *umap)
1288 {
1289         return inplace(umap, &isl_map_compute_divs);
1290 }
1291
1292 __isl_give isl_union_set *isl_union_set_compute_divs(
1293         __isl_take isl_union_set *uset)
1294 {
1295         return isl_union_map_compute_divs(uset);
1296 }
1297
1298 static int lexmin_entry(void **entry, void *user)
1299 {
1300         isl_map **map = (isl_map **)entry;
1301
1302         *map = isl_map_lexmin(*map);
1303
1304         return *map ? 0 : -1;
1305 }
1306
1307 __isl_give isl_union_map *isl_union_map_lexmin(
1308         __isl_take isl_union_map *umap)
1309 {
1310         return un_op(umap, &lexmin_entry);
1311 }
1312
1313 __isl_give isl_union_set *isl_union_set_lexmin(
1314         __isl_take isl_union_set *uset)
1315 {
1316         return isl_union_map_lexmin(uset);
1317 }
1318
1319 static int lexmax_entry(void **entry, void *user)
1320 {
1321         isl_map **map = (isl_map **)entry;
1322
1323         *map = isl_map_lexmax(*map);
1324
1325         return *map ? 0 : -1;
1326 }
1327
1328 __isl_give isl_union_map *isl_union_map_lexmax(
1329         __isl_take isl_union_map *umap)
1330 {
1331         return un_op(umap, &lexmax_entry);
1332 }
1333
1334 __isl_give isl_union_set *isl_union_set_lexmax(
1335         __isl_take isl_union_set *uset)
1336 {
1337         return isl_union_map_lexmax(uset);
1338 }
1339
1340 static int universe_entry(void **entry, void *user)
1341 {
1342         isl_map *map = *entry;
1343         isl_union_map **res = user;
1344
1345         map = isl_map_universe(isl_map_get_space(map));
1346         *res = isl_union_map_add_map(*res, map);
1347
1348         return 0;
1349 }
1350
1351 __isl_give isl_union_map *isl_union_map_universe(__isl_take isl_union_map *umap)
1352 {
1353         return cond_un_op(umap, &universe_entry);
1354 }
1355
1356 __isl_give isl_union_set *isl_union_set_universe(__isl_take isl_union_set *uset)
1357 {
1358         return isl_union_map_universe(uset);
1359 }
1360
1361 static int reverse_entry(void **entry, void *user)
1362 {
1363         isl_map *map = *entry;
1364         isl_union_map **res = user;
1365
1366         *res = isl_union_map_add_map(*res, isl_map_reverse(isl_map_copy(map)));
1367
1368         return 0;
1369 }
1370
1371 __isl_give isl_union_map *isl_union_map_reverse(__isl_take isl_union_map *umap)
1372 {
1373         return cond_un_op(umap, &reverse_entry);
1374 }
1375
1376 static int domain_entry(void **entry, void *user)
1377 {
1378         isl_map *map = *entry;
1379         isl_union_set **res = user;
1380
1381         *res = isl_union_set_add_set(*res, isl_map_domain(isl_map_copy(map)));
1382
1383         return 0;
1384 }
1385
1386 __isl_give isl_union_set *isl_union_map_domain(__isl_take isl_union_map *umap)
1387 {
1388         return cond_un_op(umap, &domain_entry);
1389 }
1390
1391 static int range_entry(void **entry, void *user)
1392 {
1393         isl_map *map = *entry;
1394         isl_union_set **res = user;
1395
1396         *res = isl_union_set_add_set(*res, isl_map_range(isl_map_copy(map)));
1397
1398         return 0;
1399 }
1400
1401 __isl_give isl_union_set *isl_union_map_range(__isl_take isl_union_map *umap)
1402 {
1403         return cond_un_op(umap, &range_entry);
1404 }
1405
1406 static int domain_map_entry(void **entry, void *user)
1407 {
1408         isl_map *map = *entry;
1409         isl_union_set **res = user;
1410
1411         *res = isl_union_map_add_map(*res,
1412                                         isl_map_domain_map(isl_map_copy(map)));
1413
1414         return 0;
1415 }
1416
1417 __isl_give isl_union_map *isl_union_map_domain_map(
1418         __isl_take isl_union_map *umap)
1419 {
1420         return cond_un_op(umap, &domain_map_entry);
1421 }
1422
1423 static int range_map_entry(void **entry, void *user)
1424 {
1425         isl_map *map = *entry;
1426         isl_union_set **res = user;
1427
1428         *res = isl_union_map_add_map(*res,
1429                                         isl_map_range_map(isl_map_copy(map)));
1430
1431         return 0;
1432 }
1433
1434 __isl_give isl_union_map *isl_union_map_range_map(
1435         __isl_take isl_union_map *umap)
1436 {
1437         return cond_un_op(umap, &range_map_entry);
1438 }
1439
1440 static int deltas_entry(void **entry, void *user)
1441 {
1442         isl_map *map = *entry;
1443         isl_union_set **res = user;
1444
1445         if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
1446                 return 0;
1447
1448         *res = isl_union_set_add_set(*res, isl_map_deltas(isl_map_copy(map)));
1449
1450         return 0;
1451 }
1452
1453 __isl_give isl_union_set *isl_union_map_deltas(__isl_take isl_union_map *umap)
1454 {
1455         return cond_un_op(umap, &deltas_entry);
1456 }
1457
1458 static int deltas_map_entry(void **entry, void *user)
1459 {
1460         isl_map *map = *entry;
1461         isl_union_map **res = user;
1462
1463         if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
1464                 return 0;
1465
1466         *res = isl_union_map_add_map(*res,
1467                                      isl_map_deltas_map(isl_map_copy(map)));
1468
1469         return 0;
1470 }
1471
1472 __isl_give isl_union_map *isl_union_map_deltas_map(
1473         __isl_take isl_union_map *umap)
1474 {
1475         return cond_un_op(umap, &deltas_map_entry);
1476 }
1477
1478 static int identity_entry(void **entry, void *user)
1479 {
1480         isl_set *set = *entry;
1481         isl_union_map **res = user;
1482
1483         *res = isl_union_map_add_map(*res, isl_set_identity(isl_set_copy(set)));
1484
1485         return 0;
1486 }
1487
1488 __isl_give isl_union_map *isl_union_set_identity(__isl_take isl_union_set *uset)
1489 {
1490         return cond_un_op(uset, &identity_entry);
1491 }
1492
1493 static int unwrap_entry(void **entry, void *user)
1494 {
1495         isl_set *set = *entry;
1496         isl_union_set **res = user;
1497
1498         if (!isl_set_is_wrapping(set))
1499                 return 0;
1500
1501         *res = isl_union_map_add_map(*res, isl_set_unwrap(isl_set_copy(set)));
1502
1503         return 0;
1504 }
1505
1506 __isl_give isl_union_map *isl_union_set_unwrap(__isl_take isl_union_set *uset)
1507 {
1508         return cond_un_op(uset, &unwrap_entry);
1509 }
1510
1511 static int wrap_entry(void **entry, void *user)
1512 {
1513         isl_map *map = *entry;
1514         isl_union_set **res = user;
1515
1516         *res = isl_union_set_add_set(*res, isl_map_wrap(isl_map_copy(map)));
1517
1518         return 0;
1519 }
1520
1521 __isl_give isl_union_set *isl_union_map_wrap(__isl_take isl_union_map *umap)
1522 {
1523         return cond_un_op(umap, &wrap_entry);
1524 }
1525
1526 struct isl_union_map_is_subset_data {
1527         isl_union_map *umap2;
1528         int is_subset;
1529 };
1530
1531 static int is_subset_entry(void **entry, void *user)
1532 {
1533         struct isl_union_map_is_subset_data *data = user;
1534         uint32_t hash;
1535         struct isl_hash_table_entry *entry2;
1536         isl_map *map = *entry;
1537
1538         hash = isl_space_get_hash(map->dim);
1539         entry2 = isl_hash_table_find(data->umap2->dim->ctx, &data->umap2->table,
1540                                      hash, &has_dim, map->dim, 0);
1541         if (!entry2) {
1542                 data->is_subset = 0;
1543                 return -1;
1544         }
1545
1546         data->is_subset = isl_map_is_subset(map, entry2->data);
1547         if (data->is_subset < 0 || !data->is_subset)
1548                 return -1;
1549
1550         return 0;
1551 }
1552
1553 int isl_union_map_is_subset(__isl_keep isl_union_map *umap1,
1554         __isl_keep isl_union_map *umap2)
1555 {
1556         struct isl_union_map_is_subset_data data = { NULL, 1 };
1557
1558         umap1 = isl_union_map_copy(umap1);
1559         umap2 = isl_union_map_copy(umap2);
1560         umap1 = isl_union_map_align_params(umap1, isl_union_map_get_space(umap2));
1561         umap2 = isl_union_map_align_params(umap2, isl_union_map_get_space(umap1));
1562
1563         if (!umap1 || !umap2)
1564                 goto error;
1565
1566         data.umap2 = umap2;
1567         if (isl_hash_table_foreach(umap1->dim->ctx, &umap1->table,
1568                                    &is_subset_entry, &data) < 0 &&
1569             data.is_subset)
1570                 goto error;
1571
1572         isl_union_map_free(umap1);
1573         isl_union_map_free(umap2);
1574
1575         return data.is_subset;
1576 error:
1577         isl_union_map_free(umap1);
1578         isl_union_map_free(umap2);
1579         return -1;
1580 }
1581
1582 int isl_union_set_is_subset(__isl_keep isl_union_set *uset1,
1583         __isl_keep isl_union_set *uset2)
1584 {
1585         return isl_union_map_is_subset(uset1, uset2);
1586 }
1587
1588 int isl_union_map_is_equal(__isl_keep isl_union_map *umap1,
1589         __isl_keep isl_union_map *umap2)
1590 {
1591         int is_subset;
1592
1593         if (!umap1 || !umap2)
1594                 return -1;
1595         is_subset = isl_union_map_is_subset(umap1, umap2);
1596         if (is_subset != 1)
1597                 return is_subset;
1598         is_subset = isl_union_map_is_subset(umap2, umap1);
1599         return is_subset;
1600 }
1601
1602 int isl_union_set_is_equal(__isl_keep isl_union_set *uset1,
1603         __isl_keep isl_union_set *uset2)
1604 {
1605         return isl_union_map_is_equal(uset1, uset2);
1606 }
1607
1608 int isl_union_map_is_strict_subset(__isl_keep isl_union_map *umap1,
1609         __isl_keep isl_union_map *umap2)
1610 {
1611         int is_subset;
1612
1613         if (!umap1 || !umap2)
1614                 return -1;
1615         is_subset = isl_union_map_is_subset(umap1, umap2);
1616         if (is_subset != 1)
1617                 return is_subset;
1618         is_subset = isl_union_map_is_subset(umap2, umap1);
1619         if (is_subset == -1)
1620                 return is_subset;
1621         return !is_subset;
1622 }
1623
1624 int isl_union_set_is_strict_subset(__isl_keep isl_union_set *uset1,
1625         __isl_keep isl_union_set *uset2)
1626 {
1627         return isl_union_map_is_strict_subset(uset1, uset2);
1628 }
1629
1630 static int sample_entry(void **entry, void *user)
1631 {
1632         isl_basic_map **sample = (isl_basic_map **)user;
1633         isl_map *map = *entry;
1634
1635         *sample = isl_map_sample(isl_map_copy(map));
1636         if (!*sample)
1637                 return -1;
1638         if (!isl_basic_map_plain_is_empty(*sample))
1639                 return -1;
1640         return 0;
1641 }
1642
1643 __isl_give isl_basic_map *isl_union_map_sample(__isl_take isl_union_map *umap)
1644 {
1645         isl_basic_map *sample = NULL;
1646
1647         if (!umap)
1648                 return NULL;
1649
1650         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
1651                                    &sample_entry, &sample) < 0 &&
1652             !sample)
1653                 goto error;
1654
1655         if (!sample)
1656                 sample = isl_basic_map_empty(isl_union_map_get_space(umap));
1657
1658         isl_union_map_free(umap);
1659
1660         return sample;
1661 error:
1662         isl_union_map_free(umap);
1663         return NULL;
1664 }
1665
1666 __isl_give isl_basic_set *isl_union_set_sample(__isl_take isl_union_set *uset)
1667 {
1668         return (isl_basic_set *)isl_union_map_sample(uset);
1669 }
1670
1671 struct isl_forall_data {
1672         int res;
1673         int (*fn)(__isl_keep isl_map *map);
1674 };
1675
1676 static int forall_entry(void **entry, void *user)
1677 {
1678         struct isl_forall_data *data = user;
1679         isl_map *map = *entry;
1680
1681         data->res = data->fn(map);
1682         if (data->res < 0)
1683                 return -1;
1684
1685         if (!data->res)
1686                 return -1;
1687
1688         return 0;
1689 }
1690
1691 static int union_map_forall(__isl_keep isl_union_map *umap,
1692         int (*fn)(__isl_keep isl_map *map))
1693 {
1694         struct isl_forall_data data = { 1, fn };
1695
1696         if (!umap)
1697                 return -1;
1698
1699         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
1700                                    &forall_entry, &data) < 0 && data.res)
1701                 return -1;
1702
1703         return data.res;
1704 }
1705
1706 struct isl_forall_user_data {
1707         int res;
1708         int (*fn)(__isl_keep isl_map *map, void *user);
1709         void *user;
1710 };
1711
1712 static int forall_user_entry(void **entry, void *user)
1713 {
1714         struct isl_forall_user_data *data = user;
1715         isl_map *map = *entry;
1716
1717         data->res = data->fn(map, data->user);
1718         if (data->res < 0)
1719                 return -1;
1720
1721         if (!data->res)
1722                 return -1;
1723
1724         return 0;
1725 }
1726
1727 /* Check if fn(map, user) returns true for all maps "map" in umap.
1728  */
1729 static int union_map_forall_user(__isl_keep isl_union_map *umap,
1730         int (*fn)(__isl_keep isl_map *map, void *user), void *user)
1731 {
1732         struct isl_forall_user_data data = { 1, fn, user };
1733
1734         if (!umap)
1735                 return -1;
1736
1737         if (isl_hash_table_foreach(umap->dim->ctx, &umap->table,
1738                                    &forall_user_entry, &data) < 0 && data.res)
1739                 return -1;
1740
1741         return data.res;
1742 }
1743
1744 int isl_union_map_is_empty(__isl_keep isl_union_map *umap)
1745 {
1746         return union_map_forall(umap, &isl_map_is_empty);
1747 }
1748
1749 int isl_union_set_is_empty(__isl_keep isl_union_set *uset)
1750 {
1751         return isl_union_map_is_empty(uset);
1752 }
1753
1754 static int is_subset_of_identity(__isl_keep isl_map *map)
1755 {
1756         int is_subset;
1757         isl_space *dim;
1758         isl_map *id;
1759
1760         if (!map)
1761                 return -1;
1762
1763         if (!isl_space_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
1764                 return 0;
1765
1766         dim = isl_map_get_space(map);
1767         id = isl_map_identity(dim);
1768
1769         is_subset = isl_map_is_subset(map, id);
1770
1771         isl_map_free(id);
1772
1773         return is_subset;
1774 }
1775
1776 /* Check if the given map is single-valued.
1777  * We simply compute
1778  *
1779  *      M \circ M^-1
1780  *
1781  * and check if the result is a subset of the identity mapping.
1782  */
1783 int isl_union_map_is_single_valued(__isl_keep isl_union_map *umap)
1784 {
1785         isl_union_map *test;
1786         int sv;
1787
1788         if (isl_union_map_n_map(umap) == 1) {
1789                 isl_map *map;
1790                 umap = isl_union_map_copy(umap);
1791                 map = isl_map_from_union_map(umap);
1792                 sv = isl_map_is_single_valued(map);
1793                 isl_map_free(map);
1794                 return sv;
1795         }
1796
1797         test = isl_union_map_reverse(isl_union_map_copy(umap));
1798         test = isl_union_map_apply_range(test, isl_union_map_copy(umap));
1799
1800         sv = union_map_forall(test, &is_subset_of_identity);
1801
1802         isl_union_map_free(test);
1803
1804         return sv;
1805 }
1806
1807 int isl_union_map_is_injective(__isl_keep isl_union_map *umap)
1808 {
1809         int in;
1810
1811         umap = isl_union_map_copy(umap);
1812         umap = isl_union_map_reverse(umap);
1813         in = isl_union_map_is_single_valued(umap);
1814         isl_union_map_free(umap);
1815
1816         return in;
1817 }
1818
1819 /* Represents a map that has a fixed value (v) for one of its
1820  * range dimensions.
1821  * The map in this structure is not reference counted, so it
1822  * is only valid while the isl_union_map from which it was
1823  * obtained is still alive.
1824  */
1825 struct isl_fixed_map {
1826         isl_int v;
1827         isl_map *map;
1828 };
1829
1830 static struct isl_fixed_map *alloc_isl_fixed_map_array(isl_ctx *ctx,
1831         int n)
1832 {
1833         int i;
1834         struct isl_fixed_map *v;
1835
1836         v = isl_calloc_array(ctx, struct isl_fixed_map, n);
1837         if (!v)
1838                 return NULL;
1839         for (i = 0; i < n; ++i)
1840                 isl_int_init(v[i].v);
1841         return v;
1842 }
1843
1844 static void free_isl_fixed_map_array(struct isl_fixed_map *v, int n)
1845 {
1846         int i;
1847
1848         if (!v)
1849                 return;
1850         for (i = 0; i < n; ++i)
1851                 isl_int_clear(v[i].v);
1852         free(v);
1853 }
1854
1855 /* Compare the "v" field of two isl_fixed_map structs.
1856  */
1857 static int qsort_fixed_map_cmp(const void *p1, const void *p2)
1858 {
1859         const struct isl_fixed_map *e1 = (const struct isl_fixed_map *) p1;
1860         const struct isl_fixed_map *e2 = (const struct isl_fixed_map *) p2;
1861
1862         return isl_int_cmp(e1->v, e2->v);
1863 }
1864
1865 /* Internal data structure used while checking whether all maps
1866  * in a union_map have a fixed value for a given output dimension.
1867  * v is the list of maps, with the fixed value for the dimension
1868  * n is the number of maps considered so far
1869  * pos is the output dimension under investigation
1870  */
1871 struct isl_fixed_dim_data {
1872         struct isl_fixed_map *v;
1873         int n;
1874         int pos;
1875 };
1876
1877 static int fixed_at_pos(__isl_keep isl_map *map, void *user)
1878 {
1879         struct isl_fixed_dim_data *data = user;
1880
1881         data->v[data->n].map = map;
1882         return isl_map_plain_is_fixed(map, isl_dim_out, data->pos,
1883                                       &data->v[data->n++].v);
1884 }
1885
1886 static int plain_injective_on_range(__isl_take isl_union_map *umap,
1887         int first, int n_range);
1888
1889 /* Given a list of the maps, with their fixed values at output dimension "pos",
1890  * check whether the ranges of the maps form an obvious partition.
1891  *
1892  * We first sort the maps according to their fixed values.
1893  * If all maps have a different value, then we know the ranges form
1894  * a partition.
1895  * Otherwise, we collect the maps with the same fixed value and
1896  * check whether each such collection is obviously injective
1897  * based on later dimensions.
1898  */
1899 static int separates(struct isl_fixed_map *v, int n,
1900         __isl_take isl_space *dim, int pos, int n_range)
1901 {
1902         int i;
1903
1904         if (!v)
1905                 goto error;
1906
1907         qsort(v, n, sizeof(*v), &qsort_fixed_map_cmp);
1908
1909         for (i = 0; i + 1 < n; ++i) {
1910                 int j, k;
1911                 isl_union_map *part;
1912                 int injective;
1913
1914                 for (j = i + 1; j < n; ++j)
1915                         if (isl_int_ne(v[i].v, v[j].v))
1916                                 break;
1917
1918                 if (j == i + 1)
1919                         continue;
1920
1921                 part = isl_union_map_alloc(isl_space_copy(dim), j - i);
1922                 for (k = i; k < j; ++k)
1923                         part = isl_union_map_add_map(part,
1924                                                      isl_map_copy(v[k].map));
1925
1926                 injective = plain_injective_on_range(part, pos + 1, n_range);
1927                 if (injective < 0)
1928                         goto error;
1929                 if (!injective)
1930                         break;
1931
1932                 i = j - 1;
1933         }
1934
1935         isl_space_free(dim);
1936         free_isl_fixed_map_array(v, n);
1937         return i + 1 >= n;
1938 error:
1939         isl_space_free(dim);
1940         free_isl_fixed_map_array(v, n);
1941         return -1;
1942 }
1943
1944 /* Check whether the maps in umap have obviously distinct ranges.
1945  * In particular, check for an output dimension in the range
1946  * [first,n_range) for which all maps have a fixed value
1947  * and then check if these values, possibly along with fixed values
1948  * at later dimensions, entail distinct ranges.
1949  */
1950 static int plain_injective_on_range(__isl_take isl_union_map *umap,
1951         int first, int n_range)
1952 {
1953         isl_ctx *ctx;
1954         int n;
1955         struct isl_fixed_dim_data data = { NULL };
1956
1957         ctx = isl_union_map_get_ctx(umap);
1958
1959         if (!umap)
1960                 goto error;
1961
1962         n = isl_union_map_n_map(umap);
1963         if (n <= 1) {
1964                 isl_union_map_free(umap);
1965                 return 1;
1966         }
1967
1968         if (first >= n_range) {
1969                 isl_union_map_free(umap);
1970                 return 0;
1971         }
1972
1973         data.v = alloc_isl_fixed_map_array(ctx, n);
1974         if (!data.v)
1975                 goto error;
1976
1977         for (data.pos = first; data.pos < n_range; ++data.pos) {
1978                 int fixed;
1979                 int injective;
1980                 isl_space *dim;
1981
1982                 data.n = 0;
1983                 fixed = union_map_forall_user(umap, &fixed_at_pos, &data);
1984                 if (fixed < 0)
1985                         goto error;
1986                 if (!fixed)
1987                         continue;
1988                 dim = isl_union_map_get_space(umap);
1989                 injective = separates(data.v, n, dim, data.pos, n_range);
1990                 isl_union_map_free(umap);
1991                 return injective;
1992         }
1993
1994         free_isl_fixed_map_array(data.v, n);
1995         isl_union_map_free(umap);
1996
1997         return 0;
1998 error:
1999         free_isl_fixed_map_array(data.v, n);
2000         isl_union_map_free(umap);
2001         return -1;
2002 }
2003
2004 /* Check whether the maps in umap that map to subsets of "ran"
2005  * have obviously distinct ranges.
2006  */
2007 static int plain_injective_on_range_wrap(__isl_keep isl_set *ran, void *user)
2008 {
2009         isl_union_map *umap = user;
2010
2011         umap = isl_union_map_copy(umap);
2012         umap = isl_union_map_intersect_range(umap,
2013                         isl_union_set_from_set(isl_set_copy(ran)));
2014         return plain_injective_on_range(umap, 0, isl_set_dim(ran, isl_dim_set));
2015 }
2016
2017 /* Check if the given union_map is obviously injective.
2018  *
2019  * In particular, we first check if all individual maps are obviously
2020  * injective and then check if all the ranges of these maps are
2021  * obviously disjoint.
2022  */
2023 int isl_union_map_plain_is_injective(__isl_keep isl_union_map *umap)
2024 {
2025         int in;
2026         isl_union_map *univ;
2027         isl_union_set *ran;
2028
2029         in = union_map_forall(umap, &isl_map_plain_is_injective);
2030         if (in < 0)
2031                 return -1;
2032         if (!in)
2033                 return 0;
2034
2035         univ = isl_union_map_universe(isl_union_map_copy(umap));
2036         ran = isl_union_map_range(univ);
2037
2038         in = union_map_forall_user(ran, &plain_injective_on_range_wrap, umap);
2039
2040         isl_union_set_free(ran);
2041
2042         return in;
2043 }
2044
2045 int isl_union_map_is_bijective(__isl_keep isl_union_map *umap)
2046 {
2047         int sv;
2048
2049         sv = isl_union_map_is_single_valued(umap);
2050         if (sv < 0 || !sv)
2051                 return sv;
2052
2053         return isl_union_map_is_injective(umap);
2054 }
2055
2056 static int zip_entry(void **entry, void *user)
2057 {
2058         isl_map *map = *entry;
2059         isl_union_map **res = user;
2060
2061         if (!isl_map_can_zip(map))
2062                 return 0;
2063
2064         *res = isl_union_map_add_map(*res, isl_map_zip(isl_map_copy(map)));
2065
2066         return 0;
2067 }
2068
2069 __isl_give isl_union_map *isl_union_map_zip(__isl_take isl_union_map *umap)
2070 {
2071         return cond_un_op(umap, &zip_entry);
2072 }
2073
2074 static int lift_entry(void **entry, void *user)
2075 {
2076         isl_set *set = *entry;
2077         isl_union_set **res = user;
2078
2079         *res = isl_union_set_add_set(*res, isl_set_lift(isl_set_copy(set)));
2080
2081         return 0;
2082 }
2083
2084 __isl_give isl_union_set *isl_union_set_lift(__isl_take isl_union_set *uset)
2085 {
2086         return cond_un_op(uset, &lift_entry);
2087 }
2088
2089 static int coefficients_entry(void **entry, void *user)
2090 {
2091         isl_set *set = *entry;
2092         isl_union_set **res = user;
2093
2094         set = isl_set_copy(set);
2095         set = isl_set_from_basic_set(isl_set_coefficients(set));
2096         *res = isl_union_set_add_set(*res, set);
2097
2098         return 0;
2099 }
2100
2101 __isl_give isl_union_set *isl_union_set_coefficients(
2102         __isl_take isl_union_set *uset)
2103 {
2104         isl_ctx *ctx;
2105         isl_space *dim;
2106         isl_union_set *res;
2107
2108         if (!uset)
2109                 return NULL;
2110
2111         ctx = isl_union_set_get_ctx(uset);
2112         dim = isl_space_set_alloc(ctx, 0, 0);
2113         res = isl_union_map_alloc(dim, uset->table.n);
2114         if (isl_hash_table_foreach(uset->dim->ctx, &uset->table,
2115                                    &coefficients_entry, &res) < 0)
2116                 goto error;
2117
2118         isl_union_set_free(uset);
2119         return res;
2120 error:
2121         isl_union_set_free(uset);
2122         isl_union_set_free(res);
2123         return NULL;
2124 }
2125
2126 static int solutions_entry(void **entry, void *user)
2127 {
2128         isl_set *set = *entry;
2129         isl_union_set **res = user;
2130
2131         set = isl_set_copy(set);
2132         set = isl_set_from_basic_set(isl_set_solutions(set));
2133         if (!*res)
2134                 *res = isl_union_set_from_set(set);
2135         else
2136                 *res = isl_union_set_add_set(*res, set);
2137
2138         if (!*res)
2139                 return -1;
2140
2141         return 0;
2142 }
2143
2144 __isl_give isl_union_set *isl_union_set_solutions(
2145         __isl_take isl_union_set *uset)
2146 {
2147         isl_union_set *res = NULL;
2148
2149         if (!uset)
2150                 return NULL;
2151
2152         if (uset->table.n == 0) {
2153                 res = isl_union_set_empty(isl_union_set_get_space(uset));
2154                 isl_union_set_free(uset);
2155                 return res;
2156         }
2157
2158         if (isl_hash_table_foreach(uset->dim->ctx, &uset->table,
2159                                    &solutions_entry, &res) < 0)
2160                 goto error;
2161
2162         isl_union_set_free(uset);
2163         return res;
2164 error:
2165         isl_union_set_free(uset);
2166         isl_union_set_free(res);
2167         return NULL;
2168 }