export isl_set_sample
[isl.git] / isl_map.c
blobc022b316b375be2927815e4af37e3590c1e11f9c
1 #include <string.h>
2 #include <strings.h>
3 #include "isl_ctx.h"
4 #include "isl_blk.h"
5 #include "isl_dim.h"
6 #include "isl_equalities.h"
7 #include "isl_list.h"
8 #include "isl_lp.h"
9 #include "isl_seq.h"
10 #include "isl_set.h"
11 #include "isl_map.h"
12 #include "isl_map_private.h"
13 #include "isl_map_piplib.h"
14 #include "isl_sample.h"
15 #include "isl_tab.h"
16 #include "isl_vec.h"
18 /* Maps dst positions to src positions */
19 struct isl_dim_map {
20 unsigned len;
21 int pos[1];
24 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
26 int i;
27 struct isl_dim_map *dim_map;
28 dim_map = isl_alloc(ctx, struct isl_dim_map,
29 sizeof(struct isl_dim_map) + len * sizeof(int));
30 if (!dim_map)
31 return NULL;
32 dim_map->len = 1 + len;
33 dim_map->pos[0] = 0;
34 for (i = 0; i < len; ++i)
35 dim_map->pos[1 + i] = -1;
36 return dim_map;
39 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
41 switch (type) {
42 case isl_dim_param: return dim->nparam;
43 case isl_dim_in: return dim->n_in;
44 case isl_dim_out: return dim->n_out;
45 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
49 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
51 switch (type) {
52 case isl_dim_param: return 1;
53 case isl_dim_in: return 1 + dim->nparam;
54 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
58 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
59 enum isl_dim_type type, unsigned dst_pos)
61 int i;
62 unsigned src_pos;
64 if (!dim_map || !dim)
65 return;
67 src_pos = pos(dim, type);
68 for (i = 0; i < n(dim, type); ++i)
69 dim_map->pos[1 + dst_pos + i] = src_pos + i;
72 static void isl_dim_map_div(struct isl_dim_map *dim_map,
73 struct isl_basic_map *bmap, unsigned dst_pos)
75 int i;
76 unsigned src_pos;
78 if (!dim_map || !bmap)
79 return;
81 src_pos = 1 + isl_dim_total(bmap->dim);
82 for (i = 0; i < bmap->n_div; ++i)
83 dim_map->pos[1 + dst_pos + i] = src_pos + i;
86 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
88 int i;
90 for (i = 0; i < dim_map->len; ++i)
91 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
92 fprintf(stderr, "\n");
95 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
96 enum isl_dim_type type)
98 switch (type) {
99 case isl_dim_param:
100 case isl_dim_in:
101 case isl_dim_out: return isl_dim_size(bmap->dim, type);
102 case isl_dim_div: return bmap->n_div;
103 case isl_dim_all: return isl_basic_map_total_dim(bmap);
107 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
109 return n(map->dim, type);
112 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
114 return n(set->dim, type);
117 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
118 enum isl_dim_type type)
120 struct isl_dim *dim = bmap->dim;
121 switch (type) {
122 case isl_dim_param: return 1;
123 case isl_dim_in: return 1 + dim->nparam;
124 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
125 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
129 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
131 return pos(map->dim, type);
134 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
135 enum isl_dim_type type)
137 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
140 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
142 return bset->dim->n_out;
145 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
147 return bset->dim->nparam;
150 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
152 return isl_dim_total(bset->dim) + bset->n_div;
155 unsigned isl_set_n_dim(const struct isl_set *set)
157 return set->dim->n_out;
160 unsigned isl_set_n_param(const struct isl_set *set)
162 return set->dim->nparam;
165 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
167 return bmap->dim->n_in;
170 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
172 return bmap->dim->n_out;
175 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
177 return bmap->dim->nparam;
180 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
182 return bmap->n_div;
185 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
187 return isl_dim_total(bmap->dim) + bmap->n_div;
190 unsigned isl_map_n_in(const struct isl_map *map)
192 return map->dim->n_in;
195 unsigned isl_map_n_out(const struct isl_map *map)
197 return map->dim->n_out;
200 unsigned isl_map_n_param(const struct isl_map *map)
202 return map->dim->nparam;
205 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
207 return map->dim->n_in == set->dim->n_out &&
208 map->dim->nparam == set->dim->nparam;
211 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
212 struct isl_basic_set *bset)
214 return bmap->dim->n_in == bset->dim->n_out &&
215 bmap->dim->nparam == bset->dim->nparam;
218 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
219 struct isl_basic_set *bset)
221 return bmap->dim->n_out == bset->dim->n_out &&
222 bmap->dim->nparam == bset->dim->nparam;
225 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
227 if (!bmap)
228 return NULL;
229 return isl_dim_copy(bmap->dim);
232 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
234 if (!bset)
235 return NULL;
236 return isl_dim_copy(bset->dim);
239 struct isl_dim *isl_map_get_dim(struct isl_map *map)
241 if (!map)
242 return NULL;
243 return isl_dim_copy(map->dim);
246 struct isl_dim *isl_set_get_dim(struct isl_set *set)
248 if (!set)
249 return NULL;
250 return isl_dim_copy(set->dim);
253 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
254 struct isl_basic_map *bmap, unsigned extra,
255 unsigned n_eq, unsigned n_ineq)
257 int i;
258 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
260 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
261 if (isl_blk_is_error(bmap->block)) {
262 free(bmap);
263 return NULL;
266 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
267 if (!bmap->ineq) {
268 isl_blk_free(ctx, bmap->block);
269 free(bmap);
270 return NULL;
273 if (extra == 0) {
274 bmap->block2 = isl_blk_empty();
275 bmap->div = NULL;
276 } else {
277 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
278 if (isl_blk_is_error(bmap->block2)) {
279 free(bmap->ineq);
280 isl_blk_free(ctx, bmap->block);
281 free(bmap);
282 return NULL;
285 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
286 if (!bmap->div) {
287 isl_blk_free(ctx, bmap->block2);
288 free(bmap->ineq);
289 isl_blk_free(ctx, bmap->block);
290 free(bmap);
291 return NULL;
295 for (i = 0; i < n_ineq + n_eq; ++i)
296 bmap->ineq[i] = bmap->block.data + i * row_size;
298 for (i = 0; i < extra; ++i)
299 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
301 bmap->ctx = ctx;
302 isl_ctx_ref(ctx);
303 bmap->ref = 1;
304 bmap->flags = 0;
305 bmap->c_size = n_eq + n_ineq;
306 bmap->eq = bmap->ineq + n_ineq;
307 bmap->extra = extra;
308 bmap->n_eq = 0;
309 bmap->n_ineq = 0;
310 bmap->n_div = 0;
311 bmap->sample = NULL;
313 return bmap;
314 error:
315 isl_basic_map_free(bmap);
316 return NULL;
319 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
320 unsigned nparam, unsigned dim, unsigned extra,
321 unsigned n_eq, unsigned n_ineq)
323 struct isl_basic_map *bmap;
324 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
325 return (struct isl_basic_set *)bmap;
328 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
329 unsigned extra, unsigned n_eq, unsigned n_ineq)
331 struct isl_basic_map *bmap;
332 if (!dim)
333 return NULL;
334 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
335 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
336 return (struct isl_basic_set *)bmap;
339 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
340 unsigned extra, unsigned n_eq, unsigned n_ineq)
342 struct isl_basic_map *bmap;
344 if (!dim)
345 return NULL;
346 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
347 if (!bmap)
348 goto error;
349 bmap->dim = dim;
351 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
352 error:
353 isl_dim_free(dim);
354 return NULL;
357 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
358 unsigned nparam, unsigned in, unsigned out, unsigned extra,
359 unsigned n_eq, unsigned n_ineq)
361 struct isl_basic_map *bmap;
362 struct isl_dim *dim;
364 dim = isl_dim_alloc(ctx, nparam, in, out);
365 if (!dim)
366 return NULL;
368 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
369 return bmap;
372 static void dup_constraints(
373 struct isl_basic_map *dst, struct isl_basic_map *src)
375 int i;
376 unsigned total = isl_basic_map_total_dim(src);
378 for (i = 0; i < src->n_eq; ++i) {
379 int j = isl_basic_map_alloc_equality(dst);
380 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
383 for (i = 0; i < src->n_ineq; ++i) {
384 int j = isl_basic_map_alloc_inequality(dst);
385 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
388 for (i = 0; i < src->n_div; ++i) {
389 int j = isl_basic_map_alloc_div(dst);
390 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
392 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
395 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
397 struct isl_basic_map *dup;
399 if (!bmap)
400 return NULL;
401 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
402 bmap->n_div, bmap->n_eq, bmap->n_ineq);
403 if (!dup)
404 return NULL;
405 dup_constraints(dup, bmap);
406 dup->flags = bmap->flags;
407 dup->sample = isl_vec_copy(bmap->sample);
408 return dup;
411 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
413 struct isl_basic_map *dup;
415 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
416 return (struct isl_basic_set *)dup;
419 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
421 if (!bset)
422 return NULL;
424 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
425 bset->ref++;
426 return bset;
428 return isl_basic_set_dup(bset);
431 struct isl_set *isl_set_copy(struct isl_set *set)
433 if (!set)
434 return NULL;
436 set->ref++;
437 return set;
440 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
442 if (!bmap)
443 return NULL;
445 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
446 bmap->ref++;
447 return bmap;
449 return isl_basic_map_dup(bmap);
452 struct isl_map *isl_map_copy(struct isl_map *map)
454 if (!map)
455 return NULL;
457 map->ref++;
458 return map;
461 void isl_basic_map_free(struct isl_basic_map *bmap)
463 if (!bmap)
464 return;
466 if (--bmap->ref > 0)
467 return;
469 isl_ctx_deref(bmap->ctx);
470 free(bmap->div);
471 isl_blk_free(bmap->ctx, bmap->block2);
472 free(bmap->ineq);
473 isl_blk_free(bmap->ctx, bmap->block);
474 isl_vec_free(bmap->sample);
475 isl_dim_free(bmap->dim);
476 free(bmap);
479 void isl_basic_set_free(struct isl_basic_set *bset)
481 isl_basic_map_free((struct isl_basic_map *)bset);
484 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
486 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
489 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
491 struct isl_ctx *ctx;
492 if (!bmap)
493 return -1;
494 ctx = bmap->ctx;
495 isl_assert(ctx, room_for_con(bmap, 1), return -1);
496 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
497 return -1);
498 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
499 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
500 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
501 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
502 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
503 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
504 isl_int *t;
505 int j = isl_basic_map_alloc_inequality(bmap);
506 if (j < 0)
507 return -1;
508 t = bmap->ineq[j];
509 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
510 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
511 bmap->eq[-1] = t;
512 bmap->n_eq++;
513 bmap->n_ineq--;
514 bmap->eq--;
515 return 0;
517 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
518 bmap->extra - bmap->n_div);
519 return bmap->n_eq++;
522 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
524 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
527 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
529 if (!bmap)
530 return -1;
531 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
532 bmap->n_eq -= n;
533 return 0;
536 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
538 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
541 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
543 isl_int *t;
544 if (!bmap)
545 return -1;
546 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
548 if (pos != bmap->n_eq - 1) {
549 t = bmap->eq[pos];
550 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
551 bmap->eq[bmap->n_eq - 1] = t;
553 bmap->n_eq--;
554 return 0;
557 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
559 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
562 void isl_basic_map_inequality_to_equality(
563 struct isl_basic_map *bmap, unsigned pos)
565 isl_int *t;
567 t = bmap->ineq[pos];
568 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
569 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
570 bmap->eq[-1] = t;
571 bmap->n_eq++;
572 bmap->n_ineq--;
573 bmap->eq--;
574 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
575 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
576 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
577 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
580 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
582 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
585 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
587 struct isl_ctx *ctx;
588 if (!bmap)
589 return -1;
590 ctx = bmap->ctx;
591 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
592 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
593 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
594 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
595 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
596 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
597 1 + isl_basic_map_total_dim(bmap),
598 bmap->extra - bmap->n_div);
599 return bmap->n_ineq++;
602 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
604 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
607 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
609 if (!bmap)
610 return -1;
611 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
612 bmap->n_ineq -= n;
613 return 0;
616 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
618 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
621 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
623 isl_int *t;
624 if (!bmap)
625 return -1;
626 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
628 if (pos != bmap->n_ineq - 1) {
629 t = bmap->ineq[pos];
630 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
631 bmap->ineq[bmap->n_ineq - 1] = t;
632 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
634 bmap->n_ineq--;
635 return 0;
638 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
640 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
643 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
645 if (!bmap)
646 return -1;
647 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
648 isl_seq_clr(bmap->div[bmap->n_div] +
649 1 + 1 + isl_basic_map_total_dim(bmap),
650 bmap->extra - bmap->n_div);
651 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
652 return bmap->n_div++;
655 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
657 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
660 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
662 if (!bmap)
663 return -1;
664 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
665 bmap->n_div -= n;
666 return 0;
669 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
671 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
674 /* Copy constraint from src to dst, putting the vars of src at offset
675 * dim_off in dst and the divs of src at offset div_off in dst.
676 * If both sets are actually map, then dim_off applies to the input
677 * variables.
679 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
680 struct isl_basic_map *src_map, isl_int *src,
681 unsigned in_off, unsigned out_off, unsigned div_off)
683 unsigned src_nparam = isl_basic_map_n_param(src_map);
684 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
685 unsigned src_in = isl_basic_map_n_in(src_map);
686 unsigned dst_in = isl_basic_map_n_in(dst_map);
687 unsigned src_out = isl_basic_map_n_out(src_map);
688 unsigned dst_out = isl_basic_map_n_out(dst_map);
689 isl_int_set(dst[0], src[0]);
690 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
691 if (dst_nparam > src_nparam)
692 isl_seq_clr(dst+1+src_nparam,
693 dst_nparam - src_nparam);
694 isl_seq_clr(dst+1+dst_nparam, in_off);
695 isl_seq_cpy(dst+1+dst_nparam+in_off,
696 src+1+src_nparam,
697 isl_min(dst_in-in_off, src_in));
698 if (dst_in-in_off > src_in)
699 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
700 dst_in - in_off - src_in);
701 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
702 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
703 src+1+src_nparam+src_in,
704 isl_min(dst_out-out_off, src_out));
705 if (dst_out-out_off > src_out)
706 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
707 dst_out - out_off - src_out);
708 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
709 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
710 src+1+src_nparam+src_in+src_out,
711 isl_min(dst_map->extra-div_off, src_map->n_div));
712 if (dst_map->n_div-div_off > src_map->n_div)
713 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
714 div_off+src_map->n_div,
715 dst_map->n_div - div_off - src_map->n_div);
718 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
719 struct isl_basic_map *src_map, isl_int *src,
720 unsigned in_off, unsigned out_off, unsigned div_off)
722 isl_int_set(dst[0], src[0]);
723 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
726 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
727 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
729 int i;
730 unsigned div_off;
732 if (!bmap1 || !bmap2)
733 goto error;
735 div_off = bmap1->n_div;
737 for (i = 0; i < bmap2->n_eq; ++i) {
738 int i1 = isl_basic_map_alloc_equality(bmap1);
739 if (i1 < 0)
740 goto error;
741 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
742 i_pos, o_pos, div_off);
745 for (i = 0; i < bmap2->n_ineq; ++i) {
746 int i1 = isl_basic_map_alloc_inequality(bmap1);
747 if (i1 < 0)
748 goto error;
749 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
750 i_pos, o_pos, div_off);
753 for (i = 0; i < bmap2->n_div; ++i) {
754 int i1 = isl_basic_map_alloc_div(bmap1);
755 if (i1 < 0)
756 goto error;
757 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
758 i_pos, o_pos, div_off);
761 isl_basic_map_free(bmap2);
763 return bmap1;
765 error:
766 isl_basic_map_free(bmap1);
767 isl_basic_map_free(bmap2);
768 return NULL;
771 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
772 struct isl_dim_map *dim_map)
774 int i;
776 for (i = 0; i < dim_map->len; ++i) {
777 if (dim_map->pos[i] < 0)
778 isl_int_set_si(dst[i], 0);
779 else
780 isl_int_set(dst[i], src[dim_map->pos[i]]);
784 static void copy_div_dim_map(isl_int *dst, isl_int *src,
785 struct isl_dim_map *dim_map)
787 isl_int_set(dst[0], src[0]);
788 copy_constraint_dim_map(dst+1, src+1, dim_map);
791 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
792 struct isl_basic_map *src, struct isl_dim_map *dim_map)
794 int i;
796 if (!src || !dst || !dim_map)
797 goto error;
799 for (i = 0; i < src->n_eq; ++i) {
800 int i1 = isl_basic_map_alloc_equality(dst);
801 if (i1 < 0)
802 goto error;
803 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
806 for (i = 0; i < src->n_ineq; ++i) {
807 int i1 = isl_basic_map_alloc_inequality(dst);
808 if (i1 < 0)
809 goto error;
810 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
813 for (i = 0; i < src->n_div; ++i) {
814 int i1 = isl_basic_map_alloc_div(dst);
815 if (i1 < 0)
816 goto error;
817 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
820 free(dim_map);
821 isl_basic_map_free(src);
823 return dst;
824 error:
825 free(dim_map);
826 isl_basic_map_free(src);
827 isl_basic_map_free(dst);
828 return NULL;
831 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
832 struct isl_basic_set *bset2, unsigned pos)
834 return (struct isl_basic_set *)
835 add_constraints((struct isl_basic_map *)bset1,
836 (struct isl_basic_map *)bset2, 0, pos);
839 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
840 struct isl_dim *dim, unsigned extra,
841 unsigned n_eq, unsigned n_ineq)
843 struct isl_basic_map *ext;
844 unsigned flags;
845 int dims_ok;
847 if (!dim)
848 goto error;
850 if (!base)
851 goto error;
853 dims_ok = isl_dim_equal(base->dim, dim) &&
854 base->extra >= base->n_div + extra;
856 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
857 room_for_ineq(base, n_ineq)) {
858 isl_dim_free(dim);
859 return base;
862 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
863 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
864 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
865 extra += base->extra;
866 n_eq += base->n_eq;
867 n_ineq += base->n_ineq;
869 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
870 dim = NULL;
871 if (!ext)
872 goto error;
874 if (dims_ok)
875 ext->sample = isl_vec_copy(base->sample);
876 flags = base->flags;
877 ext = add_constraints(ext, base, 0, 0);
878 if (ext) {
879 ext->flags = flags;
880 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
883 return ext;
885 error:
886 isl_dim_free(dim);
887 isl_basic_map_free(base);
888 return NULL;
891 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
892 struct isl_dim *dim, unsigned extra,
893 unsigned n_eq, unsigned n_ineq)
895 return (struct isl_basic_set *)
896 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
897 extra, n_eq, n_ineq);
900 struct isl_basic_map *isl_basic_map_extend_constraints(
901 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
903 if (!base)
904 return NULL;
905 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
906 0, n_eq, n_ineq);
909 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
910 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
911 unsigned n_eq, unsigned n_ineq)
913 struct isl_basic_map *bmap;
914 struct isl_dim *dim;
916 if (!base)
917 return NULL;
918 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
919 if (!dim)
920 return NULL;
922 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
923 return bmap;
926 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
927 unsigned nparam, unsigned dim, unsigned extra,
928 unsigned n_eq, unsigned n_ineq)
930 return (struct isl_basic_set *)
931 isl_basic_map_extend((struct isl_basic_map *)base,
932 nparam, 0, dim, extra, n_eq, n_ineq);
935 struct isl_basic_set *isl_basic_set_extend_constraints(
936 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
938 return (struct isl_basic_set *)
939 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
940 n_eq, n_ineq);
943 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
945 return (struct isl_basic_set *)
946 isl_basic_map_cow((struct isl_basic_map *)bset);
949 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
951 if (!bmap)
952 return NULL;
954 if (bmap->ref > 1) {
955 bmap->ref--;
956 bmap = isl_basic_map_dup(bmap);
958 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
959 return bmap;
962 struct isl_set *isl_set_cow(struct isl_set *set)
964 if (!set)
965 return NULL;
967 if (set->ref == 1)
968 return set;
969 set->ref--;
970 return isl_set_dup(set);
973 struct isl_map *isl_map_cow(struct isl_map *map)
975 if (!map)
976 return NULL;
978 if (map->ref == 1)
979 return map;
980 map->ref--;
981 return isl_map_dup(map);
984 static void swap_vars(struct isl_blk blk, isl_int *a,
985 unsigned a_len, unsigned b_len)
987 isl_seq_cpy(blk.data, a+a_len, b_len);
988 isl_seq_cpy(blk.data+b_len, a, a_len);
989 isl_seq_cpy(a, blk.data, b_len+a_len);
992 struct isl_basic_set *isl_basic_set_swap_vars(
993 struct isl_basic_set *bset, unsigned n)
995 int i;
996 struct isl_blk blk;
997 unsigned dim;
998 unsigned nparam;
1000 if (!bset)
1001 goto error;
1003 nparam = isl_basic_set_n_param(bset);
1004 dim = isl_basic_set_n_dim(bset);
1005 isl_assert(bset->ctx, n <= dim, goto error);
1007 if (n == dim)
1008 return bset;
1010 bset = isl_basic_set_cow(bset);
1011 if (!bset)
1012 return NULL;
1014 blk = isl_blk_alloc(bset->ctx, dim);
1015 if (isl_blk_is_error(blk))
1016 goto error;
1018 for (i = 0; i < bset->n_eq; ++i)
1019 swap_vars(blk,
1020 bset->eq[i]+1+nparam, n, dim - n);
1022 for (i = 0; i < bset->n_ineq; ++i)
1023 swap_vars(blk,
1024 bset->ineq[i]+1+nparam, n, dim - n);
1026 for (i = 0; i < bset->n_div; ++i)
1027 swap_vars(blk,
1028 bset->div[i]+1+1+nparam, n, dim - n);
1030 isl_blk_free(bset->ctx, blk);
1032 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1033 return bset;
1035 error:
1036 isl_basic_set_free(bset);
1037 return NULL;
1040 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1042 int i;
1043 set = isl_set_cow(set);
1044 if (!set)
1045 return NULL;
1047 for (i = 0; i < set->n; ++i) {
1048 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1049 if (!set->p[i]) {
1050 isl_set_free(set);
1051 return NULL;
1054 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1055 return set;
1058 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1060 int i = 0;
1061 unsigned total;
1062 if (!bmap)
1063 goto error;
1064 total = isl_basic_map_total_dim(bmap);
1065 isl_basic_map_free_div(bmap, bmap->n_div);
1066 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1067 if (bmap->n_eq > 0)
1068 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1069 else {
1070 isl_basic_map_alloc_equality(bmap);
1071 if (i < 0)
1072 goto error;
1074 isl_int_set_si(bmap->eq[i][0], 1);
1075 isl_seq_clr(bmap->eq[i]+1, total);
1076 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1077 return isl_basic_map_finalize(bmap);
1078 error:
1079 isl_basic_map_free(bmap);
1080 return NULL;
1083 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1085 return (struct isl_basic_set *)
1086 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1089 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1091 int i;
1092 unsigned off = isl_dim_total(bmap->dim);
1093 isl_int *t = bmap->div[a];
1094 bmap->div[a] = bmap->div[b];
1095 bmap->div[b] = t;
1097 for (i = 0; i < bmap->n_eq; ++i)
1098 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1100 for (i = 0; i < bmap->n_ineq; ++i)
1101 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1103 for (i = 0; i < bmap->n_div; ++i)
1104 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1105 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1108 /* Eliminate the specified n dimensions starting at first from the
1109 * constraints using Fourier-Motzkin, The dimensions themselves
1110 * are not removed.
1112 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1113 unsigned first, unsigned n)
1115 int i;
1116 unsigned nparam;
1118 if (!set)
1119 return NULL;
1120 if (n == 0)
1121 return set;
1123 set = isl_set_cow(set);
1124 if (!set)
1125 return NULL;
1126 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1127 nparam = isl_set_n_param(set);
1129 for (i = 0; i < set->n; ++i) {
1130 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1131 nparam + first, n);
1132 if (!set->p[i])
1133 goto error;
1135 return set;
1136 error:
1137 isl_set_free(set);
1138 return NULL;
1141 /* Project out n dimensions starting at first using Fourier-Motzkin */
1142 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1143 unsigned first, unsigned n)
1145 set = isl_set_eliminate_dims(set, first, n);
1146 set = isl_set_drop_dims(set, first, n);
1147 return set;
1150 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1152 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1153 bset->n_div);
1154 if (!bset)
1155 return NULL;
1156 bset->n_div = 0;
1157 return bset;
1160 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1162 int i;
1164 if (!set)
1165 return NULL;
1166 if (set->n == 0)
1167 return set;
1169 set = isl_set_cow(set);
1170 if (!set)
1171 return NULL;
1173 for (i = 0; i < set->n; ++i) {
1174 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1175 if (!set->p[i])
1176 goto error;
1178 return set;
1179 error:
1180 isl_set_free(set);
1181 return NULL;
1184 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1185 enum isl_dim_type type, unsigned first, unsigned n)
1187 if (!bmap)
1188 return NULL;
1189 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1190 goto error);
1191 if (n == 0)
1192 return bmap;
1193 bmap = isl_basic_map_eliminate_vars(bmap,
1194 isl_basic_map_offset(bmap, type) - 1 + first, n);
1195 if (!bmap)
1196 return bmap;
1197 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1198 return bmap;
1199 bmap = isl_basic_map_drop(bmap, type, first, n);
1200 return bmap;
1201 error:
1202 isl_basic_map_free(bmap);
1203 return NULL;
1206 struct isl_map *isl_map_remove(struct isl_map *map,
1207 enum isl_dim_type type, unsigned first, unsigned n)
1209 int i;
1211 if (n == 0)
1212 return map;
1214 map = isl_map_cow(map);
1215 if (!map)
1216 return NULL;
1217 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1219 for (i = 0; i < map->n; ++i) {
1220 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1221 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1222 if (!map->p[i])
1223 goto error;
1225 map = isl_map_drop(map, type, first, n);
1226 return map;
1227 error:
1228 isl_map_free(map);
1229 return NULL;
1232 /* Project out n inputs starting at first using Fourier-Motzkin */
1233 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1234 unsigned first, unsigned n)
1236 return isl_map_remove(map, isl_dim_in, first, n);
1239 /* Project out n dimensions starting at first using Fourier-Motzkin */
1240 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1241 unsigned first, unsigned n)
1243 unsigned nparam = isl_basic_set_n_param(bset);
1244 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1245 bset = isl_basic_set_drop_dims(bset, first, n);
1246 return bset;
1249 static void dump_term(struct isl_basic_map *bmap,
1250 isl_int c, int pos, FILE *out)
1252 const char *name;
1253 unsigned in = isl_basic_map_n_in(bmap);
1254 unsigned dim = in + isl_basic_map_n_out(bmap);
1255 unsigned nparam = isl_basic_map_n_param(bmap);
1256 if (!pos)
1257 isl_int_print(out, c, 0);
1258 else {
1259 if (!isl_int_is_one(c))
1260 isl_int_print(out, c, 0);
1261 if (pos < 1 + nparam) {
1262 name = isl_dim_get_name(bmap->dim,
1263 isl_dim_param, pos - 1);
1264 if (name)
1265 fprintf(out, "%s", name);
1266 else
1267 fprintf(out, "p%d", pos - 1);
1268 } else if (pos < 1 + nparam + in)
1269 fprintf(out, "i%d", pos - 1 - nparam);
1270 else if (pos < 1 + nparam + dim)
1271 fprintf(out, "o%d", pos - 1 - nparam - in);
1272 else
1273 fprintf(out, "e%d", pos - 1 - nparam - dim);
1277 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1278 int sign, FILE *out)
1280 int i;
1281 int first;
1282 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1283 isl_int v;
1285 isl_int_init(v);
1286 for (i = 0, first = 1; i < len; ++i) {
1287 if (isl_int_sgn(c[i]) * sign <= 0)
1288 continue;
1289 if (!first)
1290 fprintf(out, " + ");
1291 first = 0;
1292 isl_int_abs(v, c[i]);
1293 dump_term(bmap, v, i, out);
1295 isl_int_clear(v);
1296 if (first)
1297 fprintf(out, "0");
1300 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1301 const char *op, FILE *out, int indent)
1303 int i;
1305 fprintf(out, "%*s", indent, "");
1307 dump_constraint_sign(bmap, c, 1, out);
1308 fprintf(out, " %s ", op);
1309 dump_constraint_sign(bmap, c, -1, out);
1311 fprintf(out, "\n");
1313 for (i = bmap->n_div; i < bmap->extra; ++i) {
1314 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1315 continue;
1316 fprintf(out, "%*s", indent, "");
1317 fprintf(out, "ERROR: unused div coefficient not zero\n");
1318 abort();
1322 static void dump_constraints(struct isl_basic_map *bmap,
1323 isl_int **c, unsigned n,
1324 const char *op, FILE *out, int indent)
1326 int i;
1328 for (i = 0; i < n; ++i)
1329 dump_constraint(bmap, c[i], op, out, indent);
1332 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1334 int j;
1335 int first = 1;
1336 unsigned total = isl_basic_map_total_dim(bmap);
1338 for (j = 0; j < 1 + total; ++j) {
1339 if (isl_int_is_zero(exp[j]))
1340 continue;
1341 if (!first && isl_int_is_pos(exp[j]))
1342 fprintf(out, "+");
1343 dump_term(bmap, exp[j], j, out);
1344 first = 0;
1348 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1350 int i;
1352 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1353 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1355 for (i = 0; i < bmap->n_div; ++i) {
1356 fprintf(out, "%*s", indent, "");
1357 fprintf(out, "e%d = [(", i);
1358 dump_affine(bmap, bmap->div[i]+1, out);
1359 fprintf(out, ")/");
1360 isl_int_print(out, bmap->div[i][0], 0);
1361 fprintf(out, "]\n");
1365 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1367 if (!bset) {
1368 fprintf(out, "null basic set\n");
1369 return;
1372 fprintf(out, "%*s", indent, "");
1373 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1374 bset->ref, bset->dim->nparam, bset->dim->n_out,
1375 bset->extra, bset->flags);
1376 dump((struct isl_basic_map *)bset, out, indent);
1379 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1381 if (!bmap) {
1382 fprintf(out, "null basic map\n");
1383 return;
1386 fprintf(out, "%*s", indent, "");
1387 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1388 "flags: %x, n_name: %d\n",
1389 bmap->ref,
1390 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1391 bmap->extra, bmap->flags, bmap->dim->n_name);
1392 dump(bmap, out, indent);
1395 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1397 unsigned total;
1398 if (!bmap)
1399 return -1;
1400 total = isl_basic_map_total_dim(bmap);
1401 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1402 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1403 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1404 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1405 return 0;
1408 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1410 struct isl_set *set;
1412 if (!dim)
1413 return NULL;
1414 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1415 isl_assert(dim->ctx, n >= 0, return NULL);
1416 set = isl_alloc(dim->ctx, struct isl_set,
1417 sizeof(struct isl_set) +
1418 (n - 1) * sizeof(struct isl_basic_set *));
1419 if (!set)
1420 goto error;
1422 set->ctx = dim->ctx;
1423 isl_ctx_ref(set->ctx);
1424 set->ref = 1;
1425 set->size = n;
1426 set->n = 0;
1427 set->dim = dim;
1428 set->flags = flags;
1429 return set;
1430 error:
1431 isl_dim_free(dim);
1432 return NULL;
1435 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1436 unsigned nparam, unsigned dim, int n, unsigned flags)
1438 struct isl_set *set;
1439 struct isl_dim *dims;
1441 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1442 if (!dims)
1443 return NULL;
1445 set = isl_set_alloc_dim(dims, n, flags);
1446 return set;
1449 /* Make sure "map" has room for at least "n" more basic maps.
1451 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1453 int i;
1454 struct isl_map *grown = NULL;
1456 if (!map)
1457 return NULL;
1458 isl_assert(map->ctx, n >= 0, goto error);
1459 if (map->n + n <= map->size)
1460 return map;
1461 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1462 if (!grown)
1463 goto error;
1464 for (i = 0; i < map->n; ++i) {
1465 grown->p[i] = isl_basic_map_copy(map->p[i]);
1466 if (!grown->p[i])
1467 goto error;
1468 grown->n++;
1470 isl_map_free(map);
1471 return grown;
1472 error:
1473 isl_map_free(grown);
1474 isl_map_free(map);
1475 return NULL;
1478 /* Make sure "set" has room for at least "n" more basic sets.
1480 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1482 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1485 struct isl_set *isl_set_dup(struct isl_set *set)
1487 int i;
1488 struct isl_set *dup;
1490 if (!set)
1491 return NULL;
1493 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1494 if (!dup)
1495 return NULL;
1496 for (i = 0; i < set->n; ++i)
1497 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1498 return dup;
1501 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1503 struct isl_set *set;
1505 if (!bset)
1506 return NULL;
1508 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1509 if (!set) {
1510 isl_basic_set_free(bset);
1511 return NULL;
1513 return isl_set_add(set, bset);
1516 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1518 struct isl_map *map;
1520 if (!bmap)
1521 return NULL;
1523 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1524 if (!map) {
1525 isl_basic_map_free(bmap);
1526 return NULL;
1528 return isl_map_add(map, bmap);
1531 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1533 return (struct isl_set *)isl_map_add((struct isl_map *)set,
1534 (struct isl_basic_map *)bset);
1537 void isl_set_free(struct isl_set *set)
1539 int i;
1541 if (!set)
1542 return;
1544 if (--set->ref > 0)
1545 return;
1547 isl_ctx_deref(set->ctx);
1548 for (i = 0; i < set->n; ++i)
1549 isl_basic_set_free(set->p[i]);
1550 isl_dim_free(set->dim);
1551 free(set);
1554 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1556 int i;
1558 if (!set) {
1559 fprintf(out, "null set\n");
1560 return;
1563 fprintf(out, "%*s", indent, "");
1564 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1565 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1566 set->flags);
1567 for (i = 0; i < set->n; ++i) {
1568 fprintf(out, "%*s", indent, "");
1569 fprintf(out, "basic set %d:\n", i);
1570 isl_basic_set_dump(set->p[i], out, indent+4);
1574 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1576 int i;
1578 if (!map) {
1579 fprintf(out, "null map\n");
1580 return;
1583 fprintf(out, "%*s", indent, "");
1584 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1585 "flags: %x, n_name: %d\n",
1586 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1587 map->dim->n_out, map->flags, map->dim->n_name);
1588 for (i = 0; i < map->n; ++i) {
1589 fprintf(out, "%*s", indent, "");
1590 fprintf(out, "basic map %d:\n", i);
1591 isl_basic_map_dump(map->p[i], out, indent+4);
1595 struct isl_basic_map *isl_basic_map_intersect_domain(
1596 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1598 struct isl_basic_map *bmap_domain;
1599 struct isl_dim *dim;
1601 if (!bmap || !bset)
1602 goto error;
1604 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1605 bset->dim, isl_dim_param), goto error);
1607 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1608 isl_assert(bset->ctx,
1609 isl_basic_map_compatible_domain(bmap, bset), goto error);
1611 bmap = isl_basic_map_cow(bmap);
1612 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1613 bset->n_div, bset->n_eq, bset->n_ineq);
1614 if (!bmap)
1615 goto error;
1616 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1617 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1618 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1620 bmap = isl_basic_map_simplify(bmap);
1621 return isl_basic_map_finalize(bmap);
1622 error:
1623 isl_basic_map_free(bmap);
1624 isl_basic_set_free(bset);
1625 return NULL;
1628 struct isl_basic_map *isl_basic_map_intersect_range(
1629 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1631 struct isl_basic_map *bmap_range;
1633 if (!bmap || !bset)
1634 goto error;
1636 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1637 bset->dim, isl_dim_param), goto error);
1639 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1640 isl_assert(bset->ctx,
1641 isl_basic_map_compatible_range(bmap, bset), goto error);
1643 bmap = isl_basic_map_cow(bmap);
1644 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1645 bset->n_div, bset->n_eq, bset->n_ineq);
1646 if (!bmap)
1647 goto error;
1648 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1649 bmap = add_constraints(bmap, bmap_range, 0, 0);
1651 bmap = isl_basic_map_simplify(bmap);
1652 return isl_basic_map_finalize(bmap);
1653 error:
1654 isl_basic_map_free(bmap);
1655 isl_basic_set_free(bset);
1656 return NULL;
1659 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1661 int i;
1662 unsigned total;
1663 isl_int s;
1665 total = 1 + isl_basic_map_total_dim(bmap);
1666 if (total != vec->size)
1667 return -1;
1669 isl_int_init(s);
1671 for (i = 0; i < bmap->n_eq; ++i) {
1672 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1673 if (!isl_int_is_zero(s)) {
1674 isl_int_clear(s);
1675 return 0;
1679 for (i = 0; i < bmap->n_ineq; ++i) {
1680 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1681 if (isl_int_is_neg(s)) {
1682 isl_int_clear(s);
1683 return 0;
1687 isl_int_clear(s);
1689 return 1;
1692 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1694 return basic_map_contains((struct isl_basic_map *)bset, vec);
1697 struct isl_basic_map *isl_basic_map_intersect(
1698 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1700 struct isl_vec *sample = NULL;
1702 if (!bmap1 || !bmap2)
1703 goto error;
1705 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1706 bmap2->dim, isl_dim_param), goto error);
1707 if (isl_dim_total(bmap1->dim) ==
1708 isl_dim_size(bmap1->dim, isl_dim_param) &&
1709 isl_dim_total(bmap2->dim) !=
1710 isl_dim_size(bmap2->dim, isl_dim_param))
1711 return isl_basic_map_intersect(bmap2, bmap1);
1713 if (isl_dim_total(bmap2->dim) !=
1714 isl_dim_size(bmap2->dim, isl_dim_param))
1715 isl_assert(bmap1->ctx,
1716 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1718 if (bmap1->sample &&
1719 basic_map_contains(bmap1, bmap1->sample) > 0 &&
1720 basic_map_contains(bmap2, bmap1->sample) > 0)
1721 sample = isl_vec_copy(bmap1->sample);
1722 else if (bmap2->sample &&
1723 basic_map_contains(bmap1, bmap2->sample) > 0 &&
1724 basic_map_contains(bmap2, bmap2->sample) > 0)
1725 sample = isl_vec_copy(bmap2->sample);
1727 bmap1 = isl_basic_map_cow(bmap1);
1728 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1729 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1730 if (!bmap1)
1731 goto error;
1732 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1734 if (sample) {
1735 isl_vec_free(bmap1->sample);
1736 bmap1->sample = sample;
1739 bmap1 = isl_basic_map_simplify(bmap1);
1740 return isl_basic_map_finalize(bmap1);
1741 error:
1742 if (sample)
1743 isl_vec_free(sample);
1744 isl_basic_map_free(bmap1);
1745 isl_basic_map_free(bmap2);
1746 return NULL;
1749 struct isl_basic_set *isl_basic_set_intersect(
1750 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1752 return (struct isl_basic_set *)
1753 isl_basic_map_intersect(
1754 (struct isl_basic_map *)bset1,
1755 (struct isl_basic_map *)bset2);
1758 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1760 unsigned flags = 0;
1761 struct isl_map *result;
1762 int i, j;
1764 if (!map1 || !map2)
1765 goto error;
1767 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1768 map2->dim, isl_dim_param), goto error);
1769 if (isl_dim_total(map1->dim) ==
1770 isl_dim_size(map1->dim, isl_dim_param) &&
1771 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1772 return isl_map_intersect(map2, map1);
1774 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1775 isl_assert(map1->ctx,
1776 isl_dim_equal(map1->dim, map2->dim), goto error);
1778 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1779 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1780 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1782 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1783 map1->n * map2->n, flags);
1784 if (!result)
1785 goto error;
1786 for (i = 0; i < map1->n; ++i)
1787 for (j = 0; j < map2->n; ++j) {
1788 struct isl_basic_map *part;
1789 part = isl_basic_map_intersect(
1790 isl_basic_map_copy(map1->p[i]),
1791 isl_basic_map_copy(map2->p[j]));
1792 if (isl_basic_map_is_empty(part))
1793 isl_basic_map_free(part);
1794 else
1795 result = isl_map_add(result, part);
1796 if (!result)
1797 goto error;
1799 isl_map_free(map1);
1800 isl_map_free(map2);
1801 return result;
1802 error:
1803 isl_map_free(map1);
1804 isl_map_free(map2);
1805 return NULL;
1808 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1810 return (struct isl_set *)
1811 isl_map_intersect((struct isl_map *)set1,
1812 (struct isl_map *)set2);
1815 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1817 struct isl_dim *dim;
1818 struct isl_basic_set *bset;
1819 unsigned in;
1821 if (!bmap)
1822 return NULL;
1823 bmap = isl_basic_map_cow(bmap);
1824 if (!bmap)
1825 return NULL;
1826 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1827 in = isl_basic_map_n_in(bmap);
1828 bset = isl_basic_set_from_basic_map(bmap);
1829 bset = isl_basic_set_swap_vars(bset, in);
1830 return isl_basic_map_from_basic_set(bset, dim);
1833 /* Turn final n dimensions into existentially quantified variables.
1835 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
1836 enum isl_dim_type type, unsigned first, unsigned n)
1838 int i;
1839 size_t row_size;
1840 isl_int **new_div;
1841 isl_int *old;
1843 if (!bset)
1844 return NULL;
1846 isl_assert(bset->ctx, type == isl_dim_set, goto error);
1847 isl_assert(bset->ctx, first + n == isl_basic_set_n_dim(bset), goto error);
1849 if (n == 0)
1850 return bset;
1852 bset = isl_basic_set_cow(bset);
1854 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1855 old = bset->block2.data;
1856 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1857 (bset->extra + n) * (1 + row_size));
1858 if (!bset->block2.data)
1859 goto error;
1860 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1861 if (!new_div)
1862 goto error;
1863 for (i = 0; i < n; ++i) {
1864 new_div[i] = bset->block2.data +
1865 (bset->extra + i) * (1 + row_size);
1866 isl_seq_clr(new_div[i], 1 + row_size);
1868 for (i = 0; i < bset->extra; ++i)
1869 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1870 free(bset->div);
1871 bset->div = new_div;
1872 bset->n_div += n;
1873 bset->extra += n;
1874 bset->dim = isl_dim_drop_outputs(bset->dim,
1875 isl_basic_set_n_dim(bset) - n, n);
1876 if (!bset->dim)
1877 goto error;
1878 bset = isl_basic_set_simplify(bset);
1879 bset = isl_basic_set_drop_redundant_divs(bset);
1880 return isl_basic_set_finalize(bset);
1881 error:
1882 isl_basic_set_free(bset);
1883 return NULL;
1886 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1888 int i, j;
1890 for (i = 0; i < n; ++i) {
1891 j = isl_basic_map_alloc_div(bmap);
1892 if (j < 0)
1893 goto error;
1894 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1896 return bmap;
1897 error:
1898 isl_basic_map_free(bmap);
1899 return NULL;
1902 struct isl_basic_map *isl_basic_map_apply_range(
1903 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1905 struct isl_dim *dim_result = NULL;
1906 struct isl_basic_map *bmap;
1907 unsigned n_in, n_out, n, nparam, total, pos;
1908 struct isl_dim_map *dim_map1, *dim_map2;
1910 if (!bmap1 || !bmap2)
1911 goto error;
1913 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1914 isl_dim_copy(bmap2->dim));
1916 n_in = isl_basic_map_n_in(bmap1);
1917 n_out = isl_basic_map_n_out(bmap2);
1918 n = isl_basic_map_n_out(bmap1);
1919 nparam = isl_basic_map_n_param(bmap1);
1921 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1922 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1923 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
1924 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1925 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
1926 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1927 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
1928 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
1929 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1930 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1931 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1933 bmap = isl_basic_map_alloc_dim(dim_result,
1934 bmap1->n_div + bmap2->n_div + n,
1935 bmap1->n_eq + bmap2->n_eq,
1936 bmap1->n_ineq + bmap2->n_ineq);
1937 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1938 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1939 bmap = add_divs(bmap, n);
1940 bmap = isl_basic_map_simplify(bmap);
1941 bmap = isl_basic_map_drop_redundant_divs(bmap);
1942 return isl_basic_map_finalize(bmap);
1943 error:
1944 isl_basic_map_free(bmap1);
1945 isl_basic_map_free(bmap2);
1946 return NULL;
1949 struct isl_basic_set *isl_basic_set_apply(
1950 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1952 if (!bset || !bmap)
1953 goto error;
1955 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
1956 goto error);
1958 return (struct isl_basic_set *)
1959 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1960 error:
1961 isl_basic_set_free(bset);
1962 isl_basic_map_free(bmap);
1963 return NULL;
1966 struct isl_basic_map *isl_basic_map_apply_domain(
1967 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1969 if (!bmap1 || !bmap2)
1970 goto error;
1972 isl_assert(bmap1->ctx,
1973 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
1974 isl_assert(bmap1->ctx,
1975 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
1976 goto error);
1978 bmap1 = isl_basic_map_reverse(bmap1);
1979 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1980 return isl_basic_map_reverse(bmap1);
1981 error:
1982 isl_basic_map_free(bmap1);
1983 isl_basic_map_free(bmap2);
1984 return NULL;
1987 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1988 * A \cap B -> f(A) + f(B)
1990 struct isl_basic_map *isl_basic_map_sum(
1991 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1993 unsigned n_in, n_out, nparam, total, pos;
1994 struct isl_basic_map *bmap = NULL;
1995 struct isl_dim_map *dim_map1, *dim_map2;
1996 int i;
1998 if (!bmap1 || !bmap2)
1999 goto error;
2001 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2002 goto error);
2004 nparam = isl_basic_map_n_param(bmap1);
2005 n_in = isl_basic_map_n_in(bmap1);
2006 n_out = isl_basic_map_n_out(bmap1);
2008 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2009 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2010 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2011 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2012 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2013 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2014 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2015 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2016 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2017 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2018 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2020 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2021 bmap1->n_div + bmap2->n_div + 2 * n_out,
2022 bmap1->n_eq + bmap2->n_eq + n_out,
2023 bmap1->n_ineq + bmap2->n_ineq);
2024 for (i = 0; i < n_out; ++i) {
2025 int j = isl_basic_map_alloc_equality(bmap);
2026 if (j < 0)
2027 goto error;
2028 isl_seq_clr(bmap->eq[j], 1+total);
2029 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2030 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2031 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2033 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2034 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2035 bmap = add_divs(bmap, 2 * n_out);
2037 bmap = isl_basic_map_simplify(bmap);
2038 return isl_basic_map_finalize(bmap);
2039 error:
2040 isl_basic_map_free(bmap);
2041 isl_basic_map_free(bmap1);
2042 isl_basic_map_free(bmap2);
2043 return NULL;
2046 /* Given two maps A -> f(A) and B -> g(B), construct a map
2047 * A \cap B -> f(A) + f(B)
2049 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2051 struct isl_map *result;
2052 int i, j;
2054 if (!map1 || !map2)
2055 goto error;
2057 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2059 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2060 map1->n * map2->n, 0);
2061 if (!result)
2062 goto error;
2063 for (i = 0; i < map1->n; ++i)
2064 for (j = 0; j < map2->n; ++j) {
2065 struct isl_basic_map *part;
2066 part = isl_basic_map_sum(
2067 isl_basic_map_copy(map1->p[i]),
2068 isl_basic_map_copy(map2->p[j]));
2069 if (isl_basic_map_is_empty(part))
2070 isl_basic_map_free(part);
2071 else
2072 result = isl_map_add(result, part);
2073 if (!result)
2074 goto error;
2076 isl_map_free(map1);
2077 isl_map_free(map2);
2078 return result;
2079 error:
2080 isl_map_free(map1);
2081 isl_map_free(map2);
2082 return NULL;
2085 /* Given a basic map A -> f(A), construct A -> -f(A).
2087 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2089 int i, j;
2090 unsigned off, n;
2092 bmap = isl_basic_map_cow(bmap);
2093 if (!bmap)
2094 return NULL;
2096 n = isl_basic_map_dim(bmap, isl_dim_out);
2097 off = isl_basic_map_offset(bmap, isl_dim_out);
2098 for (i = 0; i < bmap->n_eq; ++i)
2099 for (j = 0; j < n; ++j)
2100 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2101 for (i = 0; i < bmap->n_ineq; ++i)
2102 for (j = 0; j < n; ++j)
2103 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2104 for (i = 0; i < bmap->n_div; ++i)
2105 for (j = 0; j < n; ++j)
2106 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2107 return isl_basic_map_finalize(bmap);
2110 /* Given a map A -> f(A), construct A -> -f(A).
2112 struct isl_map *isl_map_neg(struct isl_map *map)
2114 int i;
2116 map = isl_map_cow(map);
2117 if (!map)
2118 return NULL;
2120 for (i = 0; i < map->n; ++i) {
2121 map->p[i] = isl_basic_map_neg(map->p[i]);
2122 if (!map->p[i])
2123 goto error;
2126 return map;
2127 error:
2128 isl_map_free(map);
2129 return NULL;
2132 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2133 * A -> floor(f(A)/d).
2135 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2136 isl_int d)
2138 unsigned n_in, n_out, nparam, total, pos;
2139 struct isl_basic_map *result = NULL;
2140 struct isl_dim_map *dim_map;
2141 int i;
2143 if (!bmap)
2144 return NULL;
2146 nparam = isl_basic_map_n_param(bmap);
2147 n_in = isl_basic_map_n_in(bmap);
2148 n_out = isl_basic_map_n_out(bmap);
2150 total = nparam + n_in + n_out + bmap->n_div + n_out;
2151 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2152 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2153 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2154 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2155 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2157 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2158 bmap->n_div + n_out,
2159 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2160 result = add_constraints_dim_map(result, bmap, dim_map);
2161 result = add_divs(result, n_out);
2162 for (i = 0; i < n_out; ++i) {
2163 int j;
2164 j = isl_basic_map_alloc_inequality(result);
2165 if (j < 0)
2166 goto error;
2167 isl_seq_clr(result->ineq[j], 1+total);
2168 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2169 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2170 j = isl_basic_map_alloc_inequality(result);
2171 if (j < 0)
2172 goto error;
2173 isl_seq_clr(result->ineq[j], 1+total);
2174 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2175 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2176 isl_int_sub_ui(result->ineq[j][0], d, 1);
2179 result = isl_basic_map_simplify(result);
2180 return isl_basic_map_finalize(result);
2181 error:
2182 isl_basic_map_free(result);
2183 return NULL;
2186 /* Given a map A -> f(A) and an integer d, construct a map
2187 * A -> floor(f(A)/d).
2189 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2191 int i;
2193 map = isl_map_cow(map);
2194 if (!map)
2195 return NULL;
2197 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2198 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2199 for (i = 0; i < map->n; ++i) {
2200 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2201 if (!map->p[i])
2202 goto error;
2205 return map;
2206 error:
2207 isl_map_free(map);
2208 return NULL;
2211 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2213 int i;
2214 unsigned nparam;
2215 unsigned n_in;
2217 i = isl_basic_map_alloc_equality(bmap);
2218 if (i < 0)
2219 goto error;
2220 nparam = isl_basic_map_n_param(bmap);
2221 n_in = isl_basic_map_n_in(bmap);
2222 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2223 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2224 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2225 return isl_basic_map_finalize(bmap);
2226 error:
2227 isl_basic_map_free(bmap);
2228 return NULL;
2231 /* Add a constraints to "bmap" expressing i_pos < o_pos
2233 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2235 int i;
2236 unsigned nparam;
2237 unsigned n_in;
2239 i = isl_basic_map_alloc_inequality(bmap);
2240 if (i < 0)
2241 goto error;
2242 nparam = isl_basic_map_n_param(bmap);
2243 n_in = isl_basic_map_n_in(bmap);
2244 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2245 isl_int_set_si(bmap->ineq[i][0], -1);
2246 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2247 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2248 return isl_basic_map_finalize(bmap);
2249 error:
2250 isl_basic_map_free(bmap);
2251 return NULL;
2254 /* Add a constraints to "bmap" expressing i_pos > o_pos
2256 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2258 int i;
2259 unsigned nparam;
2260 unsigned n_in;
2262 i = isl_basic_map_alloc_inequality(bmap);
2263 if (i < 0)
2264 goto error;
2265 nparam = isl_basic_map_n_param(bmap);
2266 n_in = isl_basic_map_n_in(bmap);
2267 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2268 isl_int_set_si(bmap->ineq[i][0], -1);
2269 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2270 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2271 return isl_basic_map_finalize(bmap);
2272 error:
2273 isl_basic_map_free(bmap);
2274 return NULL;
2277 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2279 int i;
2280 struct isl_basic_map *bmap;
2281 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2282 if (!bmap)
2283 return NULL;
2284 for (i = 0; i < n_equal && bmap; ++i)
2285 bmap = var_equal(bmap, i);
2286 return isl_basic_map_finalize(bmap);
2289 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2291 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2293 int i;
2294 struct isl_basic_map *bmap;
2295 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2296 if (!bmap)
2297 return NULL;
2298 for (i = 0; i < pos && bmap; ++i)
2299 bmap = var_equal(bmap, i);
2300 if (bmap)
2301 bmap = var_less(bmap, pos);
2302 return isl_basic_map_finalize(bmap);
2305 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2307 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2309 int i;
2310 struct isl_basic_map *bmap;
2311 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2312 if (!bmap)
2313 return NULL;
2314 for (i = 0; i < pos && bmap; ++i)
2315 bmap = var_equal(bmap, i);
2316 if (bmap)
2317 bmap = var_more(bmap, pos);
2318 return isl_basic_map_finalize(bmap);
2321 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2323 struct isl_map *map;
2324 unsigned dim;
2325 int i;
2327 if (!dims)
2328 return NULL;
2329 dim = dims->n_out;
2330 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2332 for (i = 0; i < dim; ++i)
2333 map = isl_map_add(map,
2334 isl_basic_map_less_at(isl_dim_copy(dims), i));
2335 if (equal)
2336 map = isl_map_add(map,
2337 isl_basic_map_equal(isl_dim_copy(dims), dim));
2339 isl_dim_free(dims);
2340 return map;
2343 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2345 return map_lex_lte(isl_dim_map(set_dim), 0);
2348 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2350 return map_lex_lte(isl_dim_map(set_dim), 1);
2353 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2355 struct isl_map *map;
2356 unsigned dim;
2357 int i;
2359 if (!dims)
2360 return NULL;
2361 dim = dims->n_out;
2362 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2364 for (i = 0; i < dim; ++i)
2365 map = isl_map_add(map,
2366 isl_basic_map_more_at(isl_dim_copy(dims), i));
2367 if (equal)
2368 map = isl_map_add(map,
2369 isl_basic_map_equal(isl_dim_copy(dims), dim));
2371 isl_dim_free(dims);
2372 return map;
2375 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2377 return map_lex_gte(isl_dim_map(set_dim), 0);
2380 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2382 return map_lex_gte(isl_dim_map(set_dim), 1);
2385 struct isl_basic_map *isl_basic_map_from_basic_set(
2386 struct isl_basic_set *bset, struct isl_dim *dim)
2388 struct isl_basic_map *bmap;
2390 bset = isl_basic_set_cow(bset);
2391 if (!bset || !dim)
2392 goto error;
2394 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2395 isl_dim_free(bset->dim);
2396 bmap = (struct isl_basic_map *) bset;
2397 bmap->dim = dim;
2398 return isl_basic_map_finalize(bmap);
2399 error:
2400 isl_basic_set_free(bset);
2401 isl_dim_free(dim);
2402 return NULL;
2405 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2407 if (!bmap)
2408 goto error;
2409 if (bmap->dim->n_in == 0)
2410 return (struct isl_basic_set *)bmap;
2411 bmap = isl_basic_map_cow(bmap);
2412 if (!bmap)
2413 goto error;
2414 bmap->dim = isl_dim_cow(bmap->dim);
2415 if (!bmap->dim)
2416 goto error;
2417 bmap->dim->n_out += bmap->dim->n_in;
2418 bmap->dim->n_in = 0;
2419 bmap = isl_basic_map_finalize(bmap);
2420 return (struct isl_basic_set *)bmap;
2421 error:
2422 isl_basic_map_free(bmap);
2423 return NULL;
2426 /* For a div d = floor(f/m), add the constraints
2428 * f - m d >= 0
2429 * -(f-(n-1)) + m d >= 0
2431 * Note that the second constraint is the negation of
2433 * f - m d >= n
2435 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2437 int i, j;
2438 unsigned total = isl_basic_map_total_dim(bmap);
2439 unsigned div_pos = 1 + total - bmap->n_div + div;
2441 i = isl_basic_map_alloc_inequality(bmap);
2442 if (i < 0)
2443 return -1;
2444 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2445 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2447 j = isl_basic_map_alloc_inequality(bmap);
2448 if (j < 0)
2449 return -1;
2450 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2451 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2452 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2453 return j;
2456 struct isl_basic_set *isl_basic_map_underlying_set(
2457 struct isl_basic_map *bmap)
2459 if (!bmap)
2460 goto error;
2461 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2462 return (struct isl_basic_set *)bmap;
2463 bmap = isl_basic_map_cow(bmap);
2464 if (!bmap)
2465 goto error;
2466 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2467 if (!bmap->dim)
2468 goto error;
2469 bmap->extra -= bmap->n_div;
2470 bmap->n_div = 0;
2471 bmap = isl_basic_map_finalize(bmap);
2472 return (struct isl_basic_set *)bmap;
2473 error:
2474 return NULL;
2477 struct isl_basic_map *isl_basic_map_overlying_set(
2478 struct isl_basic_set *bset, struct isl_basic_map *like)
2480 struct isl_basic_map *bmap;
2481 struct isl_ctx *ctx;
2482 unsigned total;
2483 int i;
2485 if (!bset || !like)
2486 goto error;
2487 ctx = bset->ctx;
2488 isl_assert(ctx, bset->n_div == 0, goto error);
2489 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2490 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2491 goto error);
2492 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2493 isl_basic_map_free(like);
2494 return (struct isl_basic_map *)bset;
2496 bset = isl_basic_set_cow(bset);
2497 if (!bset)
2498 goto error;
2499 total = bset->dim->n_out + bset->extra;
2500 bmap = (struct isl_basic_map *)bset;
2501 isl_dim_free(bmap->dim);
2502 bmap->dim = isl_dim_copy(like->dim);
2503 if (!bmap->dim)
2504 goto error;
2505 bmap->n_div = like->n_div;
2506 bmap->extra += like->n_div;
2507 if (bmap->extra) {
2508 unsigned ltotal;
2509 ltotal = total - bmap->extra + like->extra;
2510 if (ltotal > total)
2511 ltotal = total;
2512 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2513 bmap->extra * (1 + 1 + total));
2514 if (isl_blk_is_error(bmap->block2))
2515 goto error;
2516 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2517 bmap->extra);
2518 if (!bmap->div)
2519 goto error;
2520 for (i = 0; i < bmap->extra; ++i)
2521 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2522 for (i = 0; i < like->n_div; ++i) {
2523 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2524 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2526 bmap = isl_basic_map_extend_constraints(bmap,
2527 0, 2 * like->n_div);
2528 for (i = 0; i < like->n_div; ++i) {
2529 if (isl_int_is_zero(bmap->div[i][0]))
2530 continue;
2531 if (add_div_constraints(bmap, i) < 0)
2532 goto error;
2535 isl_basic_map_free(like);
2536 bmap = isl_basic_map_simplify(bmap);
2537 bmap = isl_basic_map_finalize(bmap);
2538 return bmap;
2539 error:
2540 isl_basic_map_free(like);
2541 isl_basic_set_free(bset);
2542 return NULL;
2545 struct isl_basic_set *isl_basic_set_from_underlying_set(
2546 struct isl_basic_set *bset, struct isl_basic_set *like)
2548 return (struct isl_basic_set *)
2549 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2552 struct isl_set *isl_set_from_underlying_set(
2553 struct isl_set *set, struct isl_basic_set *like)
2555 int i;
2557 if (!set || !like)
2558 goto error;
2559 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2560 goto error);
2561 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2562 isl_basic_set_free(like);
2563 return set;
2565 set = isl_set_cow(set);
2566 if (!set)
2567 goto error;
2568 for (i = 0; i < set->n; ++i) {
2569 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2570 isl_basic_set_copy(like));
2571 if (!set->p[i])
2572 goto error;
2574 isl_dim_free(set->dim);
2575 set->dim = isl_dim_copy(like->dim);
2576 if (!set->dim)
2577 goto error;
2578 isl_basic_set_free(like);
2579 return set;
2580 error:
2581 isl_basic_set_free(like);
2582 isl_set_free(set);
2583 return NULL;
2586 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2588 int i;
2590 map = isl_map_cow(map);
2591 if (!map)
2592 return NULL;
2593 map->dim = isl_dim_cow(map->dim);
2594 if (!map->dim)
2595 goto error;
2597 for (i = 1; i < map->n; ++i)
2598 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2599 goto error);
2600 for (i = 0; i < map->n; ++i) {
2601 map->p[i] = (struct isl_basic_map *)
2602 isl_basic_map_underlying_set(map->p[i]);
2603 if (!map->p[i])
2604 goto error;
2606 if (map->n == 0)
2607 map->dim = isl_dim_underlying(map->dim, 0);
2608 else {
2609 isl_dim_free(map->dim);
2610 map->dim = isl_dim_copy(map->p[0]->dim);
2612 if (!map->dim)
2613 goto error;
2614 return (struct isl_set *)map;
2615 error:
2616 isl_map_free(map);
2617 return NULL;
2620 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2622 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2625 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2627 struct isl_basic_set *domain;
2628 unsigned n_in;
2629 unsigned n_out;
2630 if (!bmap)
2631 return NULL;
2632 n_in = isl_basic_map_n_in(bmap);
2633 n_out = isl_basic_map_n_out(bmap);
2634 domain = isl_basic_set_from_basic_map(bmap);
2635 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
2638 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2640 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2643 struct isl_set *isl_map_range(struct isl_map *map)
2645 int i;
2646 struct isl_set *set;
2648 if (!map)
2649 goto error;
2650 map = isl_map_cow(map);
2651 if (!map)
2652 goto error;
2654 set = (struct isl_set *) map;
2655 if (set->dim->n_in != 0) {
2656 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2657 if (!set->dim)
2658 goto error;
2660 for (i = 0; i < map->n; ++i) {
2661 set->p[i] = isl_basic_map_range(map->p[i]);
2662 if (!set->p[i])
2663 goto error;
2665 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2666 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2667 return set;
2668 error:
2669 isl_map_free(map);
2670 return NULL;
2673 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2675 int i;
2676 struct isl_map *map = NULL;
2678 set = isl_set_cow(set);
2679 if (!set || !dim)
2680 goto error;
2681 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2682 map = (struct isl_map *)set;
2683 for (i = 0; i < set->n; ++i) {
2684 map->p[i] = isl_basic_map_from_basic_set(
2685 set->p[i], isl_dim_copy(dim));
2686 if (!map->p[i])
2687 goto error;
2689 isl_dim_free(map->dim);
2690 map->dim = dim;
2691 return map;
2692 error:
2693 isl_dim_free(dim);
2694 isl_set_free(set);
2695 return NULL;
2698 struct isl_map *isl_map_from_range(struct isl_set *set)
2700 return (struct isl_map *)set;
2703 struct isl_set *isl_set_from_map(struct isl_map *map)
2705 int i;
2706 struct isl_set *set = NULL;
2708 if (!map)
2709 return NULL;
2710 map = isl_map_cow(map);
2711 if (!map)
2712 return NULL;
2713 map->dim = isl_dim_cow(map->dim);
2714 if (!map->dim)
2715 goto error;
2716 map->dim->n_out += map->dim->n_in;
2717 map->dim->n_in = 0;
2718 set = (struct isl_set *)map;
2719 for (i = 0; i < map->n; ++i) {
2720 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2721 if (!set->p[i])
2722 goto error;
2724 return set;
2725 error:
2726 isl_map_free(map);
2727 return NULL;
2730 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2732 struct isl_map *map;
2734 if (!dim)
2735 return NULL;
2736 isl_assert(dim->ctx, n >= 0, return NULL);
2737 map = isl_alloc(dim->ctx, struct isl_map,
2738 sizeof(struct isl_map) +
2739 (n - 1) * sizeof(struct isl_basic_map *));
2740 if (!map)
2741 goto error;
2743 map->ctx = dim->ctx;
2744 isl_ctx_ref(map->ctx);
2745 map->ref = 1;
2746 map->size = n;
2747 map->n = 0;
2748 map->dim = dim;
2749 map->flags = flags;
2750 return map;
2751 error:
2752 isl_dim_free(dim);
2753 return NULL;
2756 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2757 unsigned nparam, unsigned in, unsigned out, int n,
2758 unsigned flags)
2760 struct isl_map *map;
2761 struct isl_dim *dims;
2763 dims = isl_dim_alloc(ctx, nparam, in, out);
2764 if (!dims)
2765 return NULL;
2767 map = isl_map_alloc_dim(dims, n, flags);
2768 return map;
2771 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
2773 struct isl_basic_map *bmap;
2774 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
2775 bmap = isl_basic_map_set_to_empty(bmap);
2776 return bmap;
2779 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2781 struct isl_basic_set *bset;
2782 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2783 bset = isl_basic_set_set_to_empty(bset);
2784 return bset;
2787 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2789 struct isl_basic_map *bmap;
2790 if (!model)
2791 return NULL;
2792 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2793 bmap = isl_basic_map_set_to_empty(bmap);
2794 return bmap;
2797 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2799 struct isl_basic_map *bmap;
2800 if (!model)
2801 return NULL;
2802 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2803 bmap = isl_basic_map_set_to_empty(bmap);
2804 return bmap;
2807 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2809 struct isl_basic_set *bset;
2810 if (!model)
2811 return NULL;
2812 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2813 bset = isl_basic_set_set_to_empty(bset);
2814 return bset;
2817 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2819 struct isl_basic_map *bmap;
2820 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2821 return bmap;
2824 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2826 struct isl_basic_set *bset;
2827 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2828 return bset;
2831 __isl_give isl_basic_map *isl_basic_map_universe_like(
2832 __isl_keep isl_basic_map *model)
2834 if (!model)
2835 return NULL;
2836 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2839 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2841 if (!model)
2842 return NULL;
2843 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2846 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
2847 __isl_keep isl_set *model)
2849 if (!model)
2850 return NULL;
2851 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2854 struct isl_map *isl_map_empty(struct isl_dim *dim)
2856 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2859 struct isl_map *isl_map_empty_like(struct isl_map *model)
2861 if (!model)
2862 return NULL;
2863 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2866 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2868 if (!model)
2869 return NULL;
2870 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2873 struct isl_set *isl_set_empty(struct isl_dim *dim)
2875 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2878 struct isl_set *isl_set_empty_like(struct isl_set *model)
2880 if (!model)
2881 return NULL;
2882 return isl_set_empty(isl_dim_copy(model->dim));
2885 struct isl_map *isl_map_universe(struct isl_dim *dim)
2887 struct isl_map *map;
2888 if (!dim)
2889 return NULL;
2890 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2891 map = isl_map_add(map, isl_basic_map_universe(dim));
2892 return map;
2895 struct isl_set *isl_set_universe(struct isl_dim *dim)
2897 struct isl_set *set;
2898 if (!dim)
2899 return NULL;
2900 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2901 set = isl_set_add(set, isl_basic_set_universe(dim));
2902 return set;
2905 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
2907 if (!model)
2908 return NULL;
2909 return isl_set_universe(isl_dim_copy(model->dim));
2912 struct isl_map *isl_map_dup(struct isl_map *map)
2914 int i;
2915 struct isl_map *dup;
2917 if (!map)
2918 return NULL;
2919 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
2920 for (i = 0; i < map->n; ++i)
2921 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2922 return dup;
2925 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2927 if (!bmap || !map)
2928 goto error;
2929 if (isl_basic_map_fast_is_empty(bmap)) {
2930 isl_basic_map_free(bmap);
2931 return map;
2933 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
2934 isl_assert(map->ctx, map->n < map->size, goto error);
2935 map->p[map->n] = bmap;
2936 map->n++;
2937 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2938 return map;
2939 error:
2940 if (map)
2941 isl_map_free(map);
2942 if (bmap)
2943 isl_basic_map_free(bmap);
2944 return NULL;
2947 void isl_map_free(struct isl_map *map)
2949 int i;
2951 if (!map)
2952 return;
2954 if (--map->ref > 0)
2955 return;
2957 isl_ctx_deref(map->ctx);
2958 for (i = 0; i < map->n; ++i)
2959 isl_basic_map_free(map->p[i]);
2960 isl_dim_free(map->dim);
2961 free(map);
2964 struct isl_map *isl_map_extend(struct isl_map *base,
2965 unsigned nparam, unsigned n_in, unsigned n_out)
2967 int i;
2969 base = isl_map_cow(base);
2970 if (!base)
2971 return NULL;
2973 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
2974 if (!base->dim)
2975 goto error;
2976 for (i = 0; i < base->n; ++i) {
2977 base->p[i] = isl_basic_map_extend_dim(base->p[i],
2978 isl_dim_copy(base->dim), 0, 0, 0);
2979 if (!base->p[i])
2980 goto error;
2982 return base;
2983 error:
2984 isl_map_free(base);
2985 return NULL;
2988 struct isl_set *isl_set_extend(struct isl_set *base,
2989 unsigned nparam, unsigned dim)
2991 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2992 nparam, 0, dim);
2995 static struct isl_basic_map *isl_basic_map_fix_pos(struct isl_basic_map *bmap,
2996 unsigned pos, int value)
2998 int j;
3000 bmap = isl_basic_map_cow(bmap);
3001 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3002 j = isl_basic_map_alloc_equality(bmap);
3003 if (j < 0)
3004 goto error;
3005 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3006 isl_int_set_si(bmap->eq[j][pos], -1);
3007 isl_int_set_si(bmap->eq[j][0], value);
3008 bmap = isl_basic_map_simplify(bmap);
3009 return isl_basic_map_finalize(bmap);
3010 error:
3011 isl_basic_map_free(bmap);
3012 return NULL;
3015 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3016 enum isl_dim_type type, unsigned pos, int value)
3018 if (!bmap)
3019 return NULL;
3020 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3021 return isl_basic_map_fix_pos(bmap, isl_basic_map_offset(bmap, type) + pos,
3022 value);
3023 error:
3024 isl_basic_map_free(bmap);
3025 return NULL;
3028 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3029 enum isl_dim_type type, unsigned pos, int value)
3031 return (struct isl_basic_set *)
3032 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3033 type, pos, value);
3036 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3037 unsigned input, int value)
3039 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3042 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3043 unsigned dim, int value)
3045 return (struct isl_basic_set *)
3046 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3047 isl_dim_set, dim, value);
3050 struct isl_map *isl_map_fix_si(struct isl_map *map,
3051 enum isl_dim_type type, unsigned pos, int value)
3053 int i;
3055 map = isl_map_cow(map);
3056 if (!map)
3057 return NULL;
3059 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3060 for (i = 0; i < map->n; ++i) {
3061 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3062 if (!map->p[i])
3063 goto error;
3065 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3066 return map;
3067 error:
3068 isl_map_free(map);
3069 return NULL;
3072 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3073 unsigned input, int value)
3075 return isl_map_fix_si(map, isl_dim_in, input, value);
3078 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3080 return (struct isl_set *)
3081 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3084 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3085 unsigned dim, isl_int value)
3087 int j;
3089 bset = isl_basic_set_cow(bset);
3090 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3091 j = isl_basic_set_alloc_inequality(bset);
3092 if (j < 0)
3093 goto error;
3094 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3095 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3096 isl_int_neg(bset->ineq[j][0], value);
3097 bset = isl_basic_set_simplify(bset);
3098 return isl_basic_set_finalize(bset);
3099 error:
3100 isl_basic_set_free(bset);
3101 return NULL;
3104 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3105 isl_int value)
3107 int i;
3109 set = isl_set_cow(set);
3110 if (!set)
3111 return NULL;
3113 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3114 for (i = 0; i < set->n; ++i) {
3115 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3116 if (!set->p[i])
3117 goto error;
3119 return set;
3120 error:
3121 isl_set_free(set);
3122 return NULL;
3125 struct isl_map *isl_map_reverse(struct isl_map *map)
3127 int i;
3129 map = isl_map_cow(map);
3130 if (!map)
3131 return NULL;
3133 map->dim = isl_dim_reverse(map->dim);
3134 if (!map->dim)
3135 goto error;
3136 for (i = 0; i < map->n; ++i) {
3137 map->p[i] = isl_basic_map_reverse(map->p[i]);
3138 if (!map->p[i])
3139 goto error;
3141 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3142 return map;
3143 error:
3144 isl_map_free(map);
3145 return NULL;
3148 static struct isl_map *isl_basic_map_partial_lexopt(
3149 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3150 struct isl_set **empty, int max)
3152 if (!bmap)
3153 goto error;
3154 if (bmap->ctx->pip == ISL_PIP_PIP)
3155 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3156 else
3157 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3158 error:
3159 isl_basic_map_free(bmap);
3160 isl_basic_set_free(dom);
3161 if (empty)
3162 *empty = NULL;
3163 return NULL;
3166 struct isl_map *isl_basic_map_partial_lexmax(
3167 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3168 struct isl_set **empty)
3170 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3173 struct isl_map *isl_basic_map_partial_lexmin(
3174 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3175 struct isl_set **empty)
3177 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3180 struct isl_set *isl_basic_set_partial_lexmin(
3181 struct isl_basic_set *bset, struct isl_basic_set *dom,
3182 struct isl_set **empty)
3184 return (struct isl_set *)
3185 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3186 dom, empty);
3189 struct isl_set *isl_basic_set_partial_lexmax(
3190 struct isl_basic_set *bset, struct isl_basic_set *dom,
3191 struct isl_set **empty)
3193 return (struct isl_set *)
3194 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3195 dom, empty);
3198 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
3200 struct isl_basic_map *bmap = NULL;
3201 struct isl_basic_set *dom = NULL;
3202 struct isl_map *min;
3203 struct isl_dim *param_dim;
3205 if (!bset)
3206 goto error;
3207 bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
3208 if (!bmap)
3209 goto error;
3210 param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3211 dom = isl_basic_set_universe(param_dim);
3212 if (!dom)
3213 goto error;
3214 min = isl_basic_map_partial_lexmin(bmap, dom, NULL);
3215 return isl_map_range(min);
3216 error:
3217 isl_basic_map_free(bmap);
3218 return NULL;
3221 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
3222 struct isl_dim *dim)
3224 int i;
3226 if (!map || !dim)
3227 goto error;
3229 for (i = 0; i < map->n; ++i) {
3230 isl_dim_free(map->p[i]->dim);
3231 map->p[i]->dim = isl_dim_copy(dim);
3233 isl_dim_free(map->dim);
3234 map->dim = dim;
3236 return map;
3237 error:
3238 isl_map_free(map);
3239 isl_dim_free(dim);
3240 return NULL;
3243 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
3244 struct isl_dim *dim)
3246 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3249 /* Apply a preimage specified by "mat" on the parameters of "bset".
3250 * bset is assumed to have only parameters and divs.
3252 static struct isl_basic_set *basic_set_parameter_preimage(
3253 struct isl_basic_set *bset, struct isl_mat *mat)
3255 unsigned nparam;
3257 if (!bset || !mat)
3258 goto error;
3260 bset->dim = isl_dim_cow(bset->dim);
3261 if (!bset->dim)
3262 goto error;
3264 nparam = isl_basic_set_dim(bset, isl_dim_param);
3266 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
3268 bset->dim->nparam = 0;
3269 bset->dim->n_out = nparam;
3270 bset = isl_basic_set_preimage(bset, mat);
3271 if (bset) {
3272 bset->dim->nparam = bset->dim->n_out;
3273 bset->dim->n_out = 0;
3275 return bset;
3276 error:
3277 isl_mat_free(mat);
3278 isl_basic_set_free(bset);
3279 return NULL;
3282 /* Apply a preimage specified by "mat" on the parameters of "set".
3283 * set is assumed to have only parameters and divs.
3285 static struct isl_set *set_parameter_preimage(
3286 struct isl_set *set, struct isl_mat *mat)
3288 struct isl_dim *dim = NULL;
3289 unsigned nparam;
3291 if (!set || !mat)
3292 goto error;
3294 dim = isl_dim_copy(set->dim);
3295 dim = isl_dim_cow(dim);
3296 if (!dim)
3297 goto error;
3299 nparam = isl_set_dim(set, isl_dim_param);
3301 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
3303 dim->nparam = 0;
3304 dim->n_out = nparam;
3305 isl_set_reset_dim(set, dim);
3306 set = isl_set_preimage(set, mat);
3307 if (!set)
3308 goto error2;
3309 dim = isl_dim_copy(set->dim);
3310 dim = isl_dim_cow(dim);
3311 if (!dim)
3312 goto error2;
3313 dim->nparam = dim->n_out;
3314 dim->n_out = 0;
3315 isl_set_reset_dim(set, dim);
3316 return set;
3317 error:
3318 isl_dim_free(dim);
3319 isl_mat_free(mat);
3320 error2:
3321 isl_set_free(set);
3322 return NULL;
3325 /* Intersect the basic set "bset" with the affine space specified by the
3326 * equalities in "eq".
3328 static struct isl_basic_set *basic_set_append_equalities(
3329 struct isl_basic_set *bset, struct isl_mat *eq)
3331 int i, k;
3332 unsigned len;
3334 if (!bset || !eq)
3335 goto error;
3337 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
3338 eq->n_row, 0);
3339 if (!bset)
3340 goto error;
3342 len = 1 + isl_dim_total(bset->dim) + bset->extra;
3343 for (i = 0; i < eq->n_row; ++i) {
3344 k = isl_basic_set_alloc_equality(bset);
3345 if (k < 0)
3346 goto error;
3347 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
3348 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
3350 isl_mat_free(eq);
3352 return bset;
3353 error:
3354 isl_mat_free(eq);
3355 isl_basic_set_free(bset);
3356 return NULL;
3359 /* Intersect the set "set" with the affine space specified by the
3360 * equalities in "eq".
3362 static struct isl_set *set_append_equalities(struct isl_set *set,
3363 struct isl_mat *eq)
3365 int i;
3367 if (!set || !eq)
3368 goto error;
3370 for (i = 0; i < set->n; ++i) {
3371 set->p[i] = basic_set_append_equalities(set->p[i],
3372 isl_mat_copy(eq));
3373 if (!set->p[i])
3374 goto error;
3376 isl_mat_free(eq);
3377 return set;
3378 error:
3379 isl_mat_free(eq);
3380 isl_set_free(set);
3381 return NULL;
3384 /* Project the given basic set onto its parameter domain, possibly introducing
3385 * new, explicit, existential variables in the constraints.
3386 * The input has parameters and (possibly implicit) existential variables.
3387 * The output has the same parameters, but only
3388 * explicit existentially quantified variables.
3390 * The actual projection is performed by pip, but pip doesn't seem
3391 * to like equalities very much, so we first remove the equalities
3392 * among the parameters by performing a variable compression on
3393 * the parameters. Afterward, an inverse transformation is performed
3394 * and the equalities among the parameters are inserted back in.
3396 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
3398 int i, j;
3399 struct isl_mat *eq;
3400 struct isl_mat *T, *T2;
3401 struct isl_set *set;
3402 unsigned nparam, n_div;
3404 bset = isl_basic_set_cow(bset);
3405 if (!bset)
3406 return NULL;
3408 if (bset->n_eq == 0)
3409 return isl_basic_set_lexmin(bset);
3411 isl_basic_set_gauss(bset, NULL);
3413 nparam = isl_basic_set_dim(bset, isl_dim_param);
3414 n_div = isl_basic_set_dim(bset, isl_dim_div);
3416 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
3417 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
3418 ++i;
3420 if (i == bset->n_eq)
3421 return isl_basic_set_lexmin(bset);
3423 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
3424 0, 1 + nparam);
3425 eq = isl_mat_cow(eq);
3426 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
3427 bset = basic_set_parameter_preimage(bset, T);
3429 set = isl_basic_set_lexmin(bset);
3430 set = set_parameter_preimage(set, T2);
3431 set = set_append_equalities(set, eq);
3432 return set;
3435 /* Compute an explicit representation for all the existentially
3436 * quantified variables.
3437 * The input and output dimensions are first turned into parameters.
3438 * compute_divs then returns a map with the same parameters and
3439 * no input or output dimensions and the dimension specification
3440 * is reset to that of the input.
3442 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
3444 struct isl_basic_set *bset;
3445 struct isl_set *set;
3446 struct isl_map *map;
3447 struct isl_dim *dim, *orig_dim = NULL;
3448 unsigned nparam;
3449 unsigned n_in;
3450 unsigned n_out;
3452 bmap = isl_basic_map_cow(bmap);
3453 if (!bmap)
3454 return NULL;
3456 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3457 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3458 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3459 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
3460 if (!dim)
3461 goto error;
3463 orig_dim = bmap->dim;
3464 bmap->dim = dim;
3465 bset = (struct isl_basic_set *)bmap;
3467 set = parameter_compute_divs(bset);
3468 map = (struct isl_map *)set;
3469 map = isl_map_reset_dim(map, orig_dim);
3471 return map;
3472 error:
3473 isl_basic_map_free(bmap);
3474 return NULL;
3477 /* If bmap contains any unknown divs, then compute explicit
3478 * expressions for them. However, this computation may be
3479 * quite expensive, so first try to remove divs that aren't
3480 * strictly needed.
3482 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3484 int i;
3485 unsigned off;
3487 if (!bmap)
3488 return NULL;
3489 off = isl_dim_total(bmap->dim);
3490 for (i = 0; i < bmap->n_div; ++i) {
3491 if (isl_int_is_zero(bmap->div[i][0]))
3492 break;
3493 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
3494 goto error);
3496 if (i == bmap->n_div)
3497 return isl_map_from_basic_map(bmap);
3498 bmap = isl_basic_map_drop_redundant_divs(bmap);
3499 if (!bmap)
3500 goto error;
3501 for (i = 0; i < bmap->n_div; ++i)
3502 if (isl_int_is_zero(bmap->div[i][0]))
3503 break;
3504 if (i == bmap->n_div)
3505 return isl_map_from_basic_map(bmap);
3506 struct isl_map *map = compute_divs(bmap);
3507 return map;
3508 error:
3509 isl_basic_map_free(bmap);
3510 return NULL;
3513 struct isl_map *isl_map_compute_divs(struct isl_map *map)
3515 int i;
3516 struct isl_map *res;
3518 if (!map)
3519 return NULL;
3520 if (map->n == 0)
3521 return map;
3522 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
3523 for (i = 1 ; i < map->n; ++i) {
3524 struct isl_map *r2;
3525 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
3526 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3527 res = isl_map_union_disjoint(res, r2);
3528 else
3529 res = isl_map_union(res, r2);
3531 isl_map_free(map);
3533 return res;
3536 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
3538 return (struct isl_set *)
3539 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
3542 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3544 return (struct isl_set *)
3545 isl_map_compute_divs((struct isl_map *)set);
3548 struct isl_set *isl_map_domain(struct isl_map *map)
3550 int i;
3551 struct isl_set *set;
3553 if (!map)
3554 goto error;
3556 map = isl_map_cow(map);
3557 if (!map)
3558 return NULL;
3560 set = (struct isl_set *)map;
3561 set->dim = isl_dim_domain(set->dim);
3562 if (!set->dim)
3563 goto error;
3564 for (i = 0; i < map->n; ++i) {
3565 set->p[i] = isl_basic_map_domain(map->p[i]);
3566 if (!set->p[i])
3567 goto error;
3569 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3570 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3571 return set;
3572 error:
3573 isl_map_free(map);
3574 return NULL;
3577 struct isl_map *isl_map_union_disjoint(
3578 struct isl_map *map1, struct isl_map *map2)
3580 int i;
3581 unsigned flags = 0;
3582 struct isl_map *map = NULL;
3584 if (!map1 || !map2)
3585 goto error;
3587 if (map1->n == 0) {
3588 isl_map_free(map1);
3589 return map2;
3591 if (map2->n == 0) {
3592 isl_map_free(map2);
3593 return map1;
3596 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3598 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
3599 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
3600 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3602 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3603 map1->n + map2->n, flags);
3604 if (!map)
3605 goto error;
3606 for (i = 0; i < map1->n; ++i) {
3607 map = isl_map_add(map,
3608 isl_basic_map_copy(map1->p[i]));
3609 if (!map)
3610 goto error;
3612 for (i = 0; i < map2->n; ++i) {
3613 map = isl_map_add(map,
3614 isl_basic_map_copy(map2->p[i]));
3615 if (!map)
3616 goto error;
3618 isl_map_free(map1);
3619 isl_map_free(map2);
3620 return map;
3621 error:
3622 isl_map_free(map);
3623 isl_map_free(map1);
3624 isl_map_free(map2);
3625 return NULL;
3628 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3630 map1 = isl_map_union_disjoint(map1, map2);
3631 if (!map1)
3632 return NULL;
3633 if (map1->n > 1)
3634 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
3635 return map1;
3638 struct isl_set *isl_set_union_disjoint(
3639 struct isl_set *set1, struct isl_set *set2)
3641 return (struct isl_set *)
3642 isl_map_union_disjoint(
3643 (struct isl_map *)set1, (struct isl_map *)set2);
3646 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3648 return (struct isl_set *)
3649 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3652 struct isl_map *isl_map_intersect_range(
3653 struct isl_map *map, struct isl_set *set)
3655 unsigned flags = 0;
3656 struct isl_map *result;
3657 int i, j;
3659 if (!map || !set)
3660 goto error;
3662 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
3663 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
3664 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3666 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3667 map->n * set->n, flags);
3668 if (!result)
3669 goto error;
3670 for (i = 0; i < map->n; ++i)
3671 for (j = 0; j < set->n; ++j) {
3672 result = isl_map_add(result,
3673 isl_basic_map_intersect_range(
3674 isl_basic_map_copy(map->p[i]),
3675 isl_basic_set_copy(set->p[j])));
3676 if (!result)
3677 goto error;
3679 isl_map_free(map);
3680 isl_set_free(set);
3681 return result;
3682 error:
3683 isl_map_free(map);
3684 isl_set_free(set);
3685 return NULL;
3688 struct isl_map *isl_map_intersect_domain(
3689 struct isl_map *map, struct isl_set *set)
3691 return isl_map_reverse(
3692 isl_map_intersect_range(isl_map_reverse(map), set));
3695 struct isl_map *isl_map_apply_domain(
3696 struct isl_map *map1, struct isl_map *map2)
3698 if (!map1 || !map2)
3699 goto error;
3700 map1 = isl_map_reverse(map1);
3701 map1 = isl_map_apply_range(map1, map2);
3702 return isl_map_reverse(map1);
3703 error:
3704 isl_map_free(map1);
3705 isl_map_free(map2);
3706 return NULL;
3709 struct isl_map *isl_map_apply_range(
3710 struct isl_map *map1, struct isl_map *map2)
3712 struct isl_dim *dim_result;
3713 struct isl_map *result;
3714 int i, j;
3716 if (!map1 || !map2)
3717 goto error;
3719 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3720 isl_dim_copy(map2->dim));
3722 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3723 if (!result)
3724 goto error;
3725 for (i = 0; i < map1->n; ++i)
3726 for (j = 0; j < map2->n; ++j) {
3727 result = isl_map_add(result,
3728 isl_basic_map_apply_range(
3729 isl_basic_map_copy(map1->p[i]),
3730 isl_basic_map_copy(map2->p[j])));
3731 if (!result)
3732 goto error;
3734 isl_map_free(map1);
3735 isl_map_free(map2);
3736 if (result && result->n <= 1)
3737 ISL_F_SET(result, ISL_MAP_DISJOINT);
3738 return result;
3739 error:
3740 isl_map_free(map1);
3741 isl_map_free(map2);
3742 return NULL;
3746 * returns range - domain
3748 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3750 struct isl_basic_set *bset;
3751 unsigned dim;
3752 unsigned nparam;
3753 int i;
3755 if (!bmap)
3756 goto error;
3757 dim = isl_basic_map_n_in(bmap);
3758 nparam = isl_basic_map_n_param(bmap);
3759 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3760 bset = isl_basic_set_from_basic_map(bmap);
3761 bset = isl_basic_set_cow(bset);
3762 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3763 bset = isl_basic_set_swap_vars(bset, 2*dim);
3764 for (i = 0; i < dim; ++i) {
3765 int j = isl_basic_map_alloc_equality(
3766 (struct isl_basic_map *)bset);
3767 if (j < 0)
3768 goto error;
3769 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3770 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3771 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3772 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3774 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
3775 error:
3776 isl_basic_map_free(bmap);
3777 return NULL;
3781 * returns range - domain
3783 struct isl_set *isl_map_deltas(struct isl_map *map)
3785 int i;
3786 struct isl_set *result;
3788 if (!map)
3789 return NULL;
3791 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3792 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3793 isl_map_n_in(map), map->n, map->flags);
3794 if (!result)
3795 goto error;
3796 for (i = 0; i < map->n; ++i)
3797 result = isl_set_add(result,
3798 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3799 isl_map_free(map);
3800 return result;
3801 error:
3802 isl_map_free(map);
3803 return NULL;
3806 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3808 struct isl_basic_map *bmap;
3809 unsigned nparam;
3810 unsigned dim;
3811 int i;
3813 if (!dims)
3814 return NULL;
3816 nparam = dims->nparam;
3817 dim = dims->n_out;
3818 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3819 if (!bmap)
3820 goto error;
3822 for (i = 0; i < dim; ++i) {
3823 int j = isl_basic_map_alloc_equality(bmap);
3824 if (j < 0)
3825 goto error;
3826 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3827 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3828 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3830 return isl_basic_map_finalize(bmap);
3831 error:
3832 isl_basic_map_free(bmap);
3833 return NULL;
3836 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3838 struct isl_dim *dim = isl_dim_map(set_dim);
3839 if (!dim)
3840 return NULL;
3841 return basic_map_identity(dim);
3844 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3846 if (!model || !model->dim)
3847 return NULL;
3848 isl_assert(model->ctx,
3849 model->dim->n_in == model->dim->n_out, return NULL);
3850 return basic_map_identity(isl_dim_copy(model->dim));
3853 static struct isl_map *map_identity(struct isl_dim *dim)
3855 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3856 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3859 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3861 struct isl_dim *dim = isl_dim_map(set_dim);
3862 if (!dim)
3863 return NULL;
3864 return map_identity(dim);
3867 struct isl_map *isl_map_identity_like(struct isl_map *model)
3869 if (!model || !model->dim)
3870 return NULL;
3871 isl_assert(model->ctx,
3872 model->dim->n_in == model->dim->n_out, return NULL);
3873 return map_identity(isl_dim_copy(model->dim));
3876 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
3878 if (!model || !model->dim)
3879 return NULL;
3880 isl_assert(model->ctx,
3881 model->dim->n_in == model->dim->n_out, return NULL);
3882 return map_identity(isl_dim_copy(model->dim));
3885 /* Construct a basic set with all set dimensions having only non-negative
3886 * values.
3888 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
3890 int i;
3891 unsigned nparam;
3892 unsigned dim;
3893 struct isl_basic_set *bset;
3895 if (!dims)
3896 return NULL;
3897 nparam = dims->nparam;
3898 dim = dims->n_out;
3899 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
3900 if (!bset)
3901 return NULL;
3902 for (i = 0; i < dim; ++i) {
3903 int k = isl_basic_set_alloc_inequality(bset);
3904 if (k < 0)
3905 goto error;
3906 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
3907 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
3909 return bset;
3910 error:
3911 isl_basic_set_free(bset);
3912 return NULL;
3915 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3917 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3920 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3922 return isl_map_is_subset(
3923 (struct isl_map *)set1, (struct isl_map *)set2);
3926 int isl_basic_map_is_subset(
3927 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3929 int is_subset;
3930 struct isl_map *map1;
3931 struct isl_map *map2;
3933 if (!bmap1 || !bmap2)
3934 return -1;
3936 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3937 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3939 is_subset = isl_map_is_subset(map1, map2);
3941 isl_map_free(map1);
3942 isl_map_free(map2);
3944 return is_subset;
3947 int isl_basic_map_is_equal(
3948 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3950 int is_subset;
3952 if (!bmap1 || !bmap2)
3953 return -1;
3954 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3955 if (is_subset != 1)
3956 return is_subset;
3957 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3958 return is_subset;
3961 int isl_basic_set_is_equal(
3962 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3964 return isl_basic_map_is_equal(
3965 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3968 int isl_map_is_empty(struct isl_map *map)
3970 int i;
3971 int is_empty;
3973 if (!map)
3974 return -1;
3975 for (i = 0; i < map->n; ++i) {
3976 is_empty = isl_basic_map_is_empty(map->p[i]);
3977 if (is_empty < 0)
3978 return -1;
3979 if (!is_empty)
3980 return 0;
3982 return 1;
3985 int isl_map_fast_is_empty(struct isl_map *map)
3987 return map->n == 0;
3990 int isl_set_is_empty(struct isl_set *set)
3992 return isl_map_is_empty((struct isl_map *)set);
3995 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3997 int is_subset = 0;
3998 struct isl_map *diff;
4000 if (!map1 || !map2)
4001 return -1;
4003 if (isl_map_is_empty(map1))
4004 return 1;
4006 if (isl_map_is_empty(map2))
4007 return 0;
4009 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
4010 if (!diff)
4011 return -1;
4013 is_subset = isl_map_is_empty(diff);
4014 isl_map_free(diff);
4016 return is_subset;
4019 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4021 int is_subset;
4023 if (!map1 || !map2)
4024 return -1;
4025 is_subset = isl_map_is_subset(map1, map2);
4026 if (is_subset != 1)
4027 return is_subset;
4028 is_subset = isl_map_is_subset(map2, map1);
4029 return is_subset;
4032 int isl_basic_map_is_strict_subset(
4033 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4035 int is_subset;
4037 if (!bmap1 || !bmap2)
4038 return -1;
4039 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4040 if (is_subset != 1)
4041 return is_subset;
4042 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4043 if (is_subset == -1)
4044 return is_subset;
4045 return !is_subset;
4048 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
4050 int is_subset;
4052 if (!map1 || !map2)
4053 return -1;
4054 is_subset = isl_map_is_subset(map1, map2);
4055 if (is_subset != 1)
4056 return is_subset;
4057 is_subset = isl_map_is_subset(map2, map1);
4058 if (is_subset == -1)
4059 return is_subset;
4060 return !is_subset;
4063 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
4065 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
4068 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4070 if (!bmap)
4071 return -1;
4072 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4075 int isl_basic_set_is_universe(struct isl_basic_set *bset)
4077 if (!bset)
4078 return -1;
4079 return bset->n_eq == 0 && bset->n_ineq == 0;
4082 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4084 struct isl_basic_set *bset = NULL;
4085 struct isl_vec *sample = NULL;
4086 int empty;
4087 unsigned total;
4089 if (!bmap)
4090 return -1;
4092 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4093 return 1;
4095 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4096 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4097 copy = isl_basic_map_convex_hull(copy);
4098 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4099 isl_basic_map_free(copy);
4100 return empty;
4103 total = 1 + isl_basic_map_total_dim(bmap);
4104 if (bmap->sample && bmap->sample->size == total) {
4105 int contains = basic_map_contains(bmap, bmap->sample);
4106 if (contains < 0)
4107 return -1;
4108 if (contains)
4109 return 0;
4111 isl_vec_free(bmap->sample);
4112 bmap->sample = NULL;
4113 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4114 if (!bset)
4115 return -1;
4116 sample = isl_basic_set_sample_vec(bset);
4117 if (!sample)
4118 return -1;
4119 empty = sample->size == 0;
4120 isl_vec_free(bmap->sample);
4121 bmap->sample = sample;
4122 if (empty)
4123 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
4125 return empty;
4128 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
4130 if (!bmap)
4131 return -1;
4132 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
4135 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
4137 if (!bset)
4138 return -1;
4139 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
4142 int isl_basic_set_is_empty(struct isl_basic_set *bset)
4144 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
4147 struct isl_map *isl_basic_map_union(
4148 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4150 struct isl_map *map;
4151 if (!bmap1 || !bmap2)
4152 return NULL;
4154 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4156 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4157 if (!map)
4158 goto error;
4159 map = isl_map_add(map, bmap1);
4160 map = isl_map_add(map, bmap2);
4161 return map;
4162 error:
4163 isl_basic_map_free(bmap1);
4164 isl_basic_map_free(bmap2);
4165 return NULL;
4168 struct isl_set *isl_basic_set_union(
4169 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4171 return (struct isl_set *)isl_basic_map_union(
4172 (struct isl_basic_map *)bset1,
4173 (struct isl_basic_map *)bset2);
4176 /* Order divs such that any div only depends on previous divs */
4177 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
4179 int i;
4180 unsigned off = isl_dim_total(bmap->dim);
4182 for (i = 0; i < bmap->n_div; ++i) {
4183 int pos;
4184 if (isl_int_is_zero(bmap->div[i][0]))
4185 continue;
4186 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4187 bmap->n_div-i);
4188 if (pos == -1)
4189 continue;
4190 isl_basic_map_swap_div(bmap, i, i + pos);
4191 --i;
4193 return bmap;
4196 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
4198 return (struct isl_basic_set *)
4199 isl_basic_map_order_divs((struct isl_basic_map *)bset);
4202 /* Look for a div in dst that corresponds to the div "div" in src.
4203 * The divs before "div" in src and dst are assumed to be the same.
4205 * Returns -1 if no corresponding div was found and the position
4206 * of the corresponding div in dst otherwise.
4208 static int find_div(struct isl_basic_map *dst,
4209 struct isl_basic_map *src, unsigned div)
4211 int i;
4213 unsigned total = isl_dim_total(src->dim);
4215 isl_assert(dst->ctx, div <= dst->n_div, return -1);
4216 for (i = div; i < dst->n_div; ++i)
4217 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
4218 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
4219 dst->n_div - div) == -1)
4220 return i;
4221 return -1;
4224 struct isl_basic_map *isl_basic_map_align_divs(
4225 struct isl_basic_map *dst, struct isl_basic_map *src)
4227 int i;
4228 unsigned total = isl_dim_total(src->dim);
4230 if (!dst || !src)
4231 goto error;
4233 if (src->n_div == 0)
4234 return dst;
4236 for (i = 0; i < src->n_div; ++i)
4237 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
4239 src = isl_basic_map_order_divs(src);
4240 dst = isl_basic_map_cow(dst);
4241 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4242 src->n_div, 0, 2 * src->n_div);
4243 if (!dst)
4244 return NULL;
4245 for (i = 0; i < src->n_div; ++i) {
4246 int j = find_div(dst, src, i);
4247 if (j < 0) {
4248 j = isl_basic_map_alloc_div(dst);
4249 if (j < 0)
4250 goto error;
4251 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
4252 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
4253 if (add_div_constraints(dst, j) < 0)
4254 goto error;
4256 if (j != i)
4257 isl_basic_map_swap_div(dst, i, j);
4259 return dst;
4260 error:
4261 isl_basic_map_free(dst);
4262 return NULL;
4265 struct isl_basic_set *isl_basic_set_align_divs(
4266 struct isl_basic_set *dst, struct isl_basic_set *src)
4268 return (struct isl_basic_set *)isl_basic_map_align_divs(
4269 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4272 struct isl_map *isl_map_align_divs(struct isl_map *map)
4274 int i;
4276 map = isl_map_compute_divs(map);
4277 map = isl_map_cow(map);
4278 if (!map)
4279 return NULL;
4281 for (i = 1; i < map->n; ++i)
4282 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
4283 for (i = 1; i < map->n; ++i)
4284 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
4286 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4287 return map;
4290 struct isl_set *isl_set_align_divs(struct isl_set *set)
4292 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
4295 static struct isl_map *add_cut_constraint(struct isl_map *dst,
4296 struct isl_basic_map *src, isl_int *c,
4297 unsigned len, int oppose)
4299 struct isl_basic_map *copy = NULL;
4300 int is_empty;
4301 int k;
4302 unsigned total;
4304 copy = isl_basic_map_copy(src);
4305 copy = isl_basic_map_cow(copy);
4306 if (!copy)
4307 goto error;
4308 copy = isl_basic_map_extend_constraints(copy, 0, 1);
4309 k = isl_basic_map_alloc_inequality(copy);
4310 if (k < 0)
4311 goto error;
4312 if (oppose)
4313 isl_seq_neg(copy->ineq[k], c, len);
4314 else
4315 isl_seq_cpy(copy->ineq[k], c, len);
4316 total = 1 + isl_basic_map_total_dim(copy);
4317 isl_seq_clr(copy->ineq[k]+len, total - len);
4318 isl_inequality_negate(copy, k);
4319 copy = isl_basic_map_simplify(copy);
4320 copy = isl_basic_map_finalize(copy);
4321 is_empty = isl_basic_map_is_empty(copy);
4322 if (is_empty < 0)
4323 goto error;
4324 if (!is_empty)
4325 dst = isl_map_add(dst, copy);
4326 else
4327 isl_basic_map_free(copy);
4328 return dst;
4329 error:
4330 isl_basic_map_free(copy);
4331 isl_map_free(dst);
4332 return NULL;
4335 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
4337 int i, j, k;
4338 unsigned flags = 0;
4339 struct isl_map *rest = NULL;
4340 unsigned max;
4341 unsigned total = isl_basic_map_total_dim(bmap);
4343 assert(bmap);
4345 if (!map)
4346 goto error;
4348 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4349 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4351 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
4352 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
4353 if (!rest)
4354 goto error;
4356 for (i = 0; i < map->n; ++i) {
4357 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
4358 if (!map->p[i])
4359 goto error;
4362 for (j = 0; j < map->n; ++j)
4363 map->p[j] = isl_basic_map_cow(map->p[j]);
4365 for (i = 0; i < bmap->n_eq; ++i) {
4366 for (j = 0; j < map->n; ++j) {
4367 rest = add_cut_constraint(rest,
4368 map->p[j], bmap->eq[i], 1+total, 0);
4369 if (!rest)
4370 goto error;
4372 rest = add_cut_constraint(rest,
4373 map->p[j], bmap->eq[i], 1+total, 1);
4374 if (!rest)
4375 goto error;
4377 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4378 1, 0);
4379 if (!map->p[j])
4380 goto error;
4381 k = isl_basic_map_alloc_equality(map->p[j]);
4382 if (k < 0)
4383 goto error;
4384 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
4385 isl_seq_clr(map->p[j]->eq[k]+1+total,
4386 map->p[j]->n_div - bmap->n_div);
4390 for (i = 0; i < bmap->n_ineq; ++i) {
4391 for (j = 0; j < map->n; ++j) {
4392 rest = add_cut_constraint(rest,
4393 map->p[j], bmap->ineq[i], 1+total, 0);
4394 if (!rest)
4395 goto error;
4397 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4398 0, 1);
4399 if (!map->p[j])
4400 goto error;
4401 k = isl_basic_map_alloc_inequality(map->p[j]);
4402 if (k < 0)
4403 goto error;
4404 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
4405 isl_seq_clr(map->p[j]->ineq[k]+1+total,
4406 map->p[j]->n_div - bmap->n_div);
4410 isl_map_free(map);
4411 return rest;
4412 error:
4413 isl_map_free(map);
4414 isl_map_free(rest);
4415 return NULL;
4418 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
4420 int i;
4421 if (!map1 || !map2)
4422 goto error;
4424 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4426 if (isl_map_is_empty(map2)) {
4427 isl_map_free(map2);
4428 return map1;
4431 map1 = isl_map_compute_divs(map1);
4432 map2 = isl_map_compute_divs(map2);
4433 if (!map1 || !map2)
4434 goto error;
4436 for (i = 0; map1 && i < map2->n; ++i)
4437 map1 = subtract(map1, map2->p[i]);
4439 isl_map_free(map2);
4440 return map1;
4441 error:
4442 isl_map_free(map1);
4443 isl_map_free(map2);
4444 return NULL;
4447 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
4449 return (struct isl_set *)
4450 isl_map_subtract(
4451 (struct isl_map *)set1, (struct isl_map *)set2);
4454 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
4456 if (!set || !map)
4457 goto error;
4458 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
4459 map = isl_map_intersect_domain(map, set);
4460 set = isl_map_range(map);
4461 return set;
4462 error:
4463 isl_set_free(set);
4464 isl_map_free(map);
4465 return NULL;
4468 /* There is no need to cow as removing empty parts doesn't change
4469 * the meaning of the set.
4471 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
4473 int i;
4475 if (!map)
4476 return NULL;
4478 for (i = map->n-1; i >= 0; --i) {
4479 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
4480 continue;
4481 isl_basic_map_free(map->p[i]);
4482 if (i != map->n-1) {
4483 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4484 map->p[i] = map->p[map->n-1];
4486 map->n--;
4489 return map;
4492 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4494 return (struct isl_set *)
4495 isl_map_remove_empty_parts((struct isl_map *)set);
4498 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
4500 struct isl_basic_map *bmap;
4501 if (!map || map->n == 0)
4502 return NULL;
4503 bmap = map->p[map->n-1];
4504 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
4505 return isl_basic_map_copy(bmap);
4508 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4510 return (struct isl_basic_set *)
4511 isl_map_copy_basic_map((struct isl_map *)set);
4514 struct isl_map *isl_map_drop_basic_map(struct isl_map *map,
4515 struct isl_basic_map *bmap)
4517 int i;
4519 if (!map || !bmap)
4520 goto error;
4521 for (i = map->n-1; i >= 0; --i) {
4522 if (map->p[i] != bmap)
4523 continue;
4524 map = isl_map_cow(map);
4525 if (!map)
4526 goto error;
4527 isl_basic_map_free(map->p[i]);
4528 if (i != map->n-1) {
4529 ISL_F_CLR(map, ISL_SET_NORMALIZED);
4530 map->p[i] = map->p[map->n-1];
4532 map->n--;
4533 return map;
4535 isl_basic_map_free(bmap);
4536 return map;
4537 error:
4538 isl_map_free(map);
4539 isl_basic_map_free(bmap);
4540 return NULL;
4543 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4544 struct isl_basic_set *bset)
4546 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
4547 (struct isl_basic_map *)bset);
4550 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4551 * for any common value of the parameters and dimensions preceding dim
4552 * in both basic sets, the values of dimension pos in bset1 are
4553 * smaller or larger than those in bset2.
4555 * Returns
4556 * 1 if bset1 follows bset2
4557 * -1 if bset1 precedes bset2
4558 * 0 if bset1 and bset2 are incomparable
4559 * -2 if some error occurred.
4561 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4562 struct isl_basic_set *bset2, int pos)
4564 struct isl_dim *dims;
4565 struct isl_basic_map *bmap1 = NULL;
4566 struct isl_basic_map *bmap2 = NULL;
4567 struct isl_ctx *ctx;
4568 struct isl_vec *obj;
4569 unsigned total;
4570 unsigned nparam;
4571 unsigned dim1, dim2;
4572 isl_int num, den;
4573 enum isl_lp_result res;
4574 int cmp;
4576 if (!bset1 || !bset2)
4577 return -2;
4579 nparam = isl_basic_set_n_param(bset1);
4580 dim1 = isl_basic_set_n_dim(bset1);
4581 dim2 = isl_basic_set_n_dim(bset2);
4582 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4583 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4584 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4585 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4586 if (!bmap1 || !bmap2)
4587 goto error;
4588 bmap1 = isl_basic_map_cow(bmap1);
4589 bmap1 = isl_basic_map_extend(bmap1, nparam,
4590 pos, (dim1 - pos) + (dim2 - pos),
4591 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4592 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4593 if (!bmap1)
4594 goto error;
4595 total = isl_basic_map_total_dim(bmap1);
4596 ctx = bmap1->ctx;
4597 obj = isl_vec_alloc(ctx, 1 + total);
4598 isl_seq_clr(obj->block.data, 1 + total);
4599 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
4600 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
4601 if (!obj)
4602 goto error;
4603 isl_int_init(num);
4604 isl_int_init(den);
4605 res = isl_basic_map_solve_lp(bmap1, 0, obj->block.data, ctx->one,
4606 &num, &den, NULL);
4607 if (res == isl_lp_empty)
4608 cmp = 0;
4609 else if (res == isl_lp_ok && isl_int_is_pos(num))
4610 cmp = 1;
4611 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4612 res == isl_lp_unbounded)
4613 cmp = -1;
4614 else
4615 cmp = -2;
4616 isl_int_clear(num);
4617 isl_int_clear(den);
4618 isl_basic_map_free(bmap1);
4619 isl_vec_free(obj);
4620 return cmp;
4621 error:
4622 isl_basic_map_free(bmap1);
4623 isl_basic_map_free(bmap2);
4624 return -2;
4627 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4628 unsigned pos, isl_int *val)
4630 int i;
4631 int d;
4632 unsigned total;
4634 if (!bmap)
4635 return -1;
4636 total = isl_basic_map_total_dim(bmap);
4637 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4638 for (; d+1 > pos; --d)
4639 if (!isl_int_is_zero(bmap->eq[i][1+d]))
4640 break;
4641 if (d != pos)
4642 continue;
4643 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4644 return 0;
4645 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4646 return 0;
4647 if (!isl_int_is_one(bmap->eq[i][1+d]))
4648 return 0;
4649 if (val)
4650 isl_int_neg(*val, bmap->eq[i][0]);
4651 return 1;
4653 return 0;
4656 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4657 unsigned pos, isl_int *val)
4659 int i;
4660 isl_int v;
4661 isl_int tmp;
4662 int fixed;
4664 if (!map)
4665 return -1;
4666 if (map->n == 0)
4667 return 0;
4668 if (map->n == 1)
4669 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
4670 isl_int_init(v);
4671 isl_int_init(tmp);
4672 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
4673 for (i = 1; fixed == 1 && i < map->n; ++i) {
4674 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
4675 if (fixed == 1 && isl_int_ne(tmp, v))
4676 fixed = 0;
4678 if (val)
4679 isl_int_set(*val, v);
4680 isl_int_clear(tmp);
4681 isl_int_clear(v);
4682 return fixed;
4685 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
4686 unsigned pos, isl_int *val)
4688 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
4689 pos, val);
4692 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4693 isl_int *val)
4695 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4698 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
4699 enum isl_dim_type type, unsigned pos, isl_int *val)
4701 if (pos >= isl_basic_map_dim(bmap, type))
4702 return -1;
4703 return isl_basic_map_fast_has_fixed_var(bmap,
4704 isl_basic_map_offset(bmap, type) - 1 + pos, val);
4707 int isl_map_fast_is_fixed(struct isl_map *map,
4708 enum isl_dim_type type, unsigned pos, isl_int *val)
4710 if (pos >= isl_map_dim(map, type))
4711 return -1;
4712 return isl_map_fast_has_fixed_var(map,
4713 map_offset(map, type) - 1 + pos, val);
4716 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4717 * then return this fixed value in *val.
4719 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
4720 isl_int *val)
4722 return isl_basic_set_fast_has_fixed_var(bset,
4723 isl_basic_set_n_param(bset) + dim, val);
4726 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4727 * then return this fixed value in *val.
4729 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4731 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
4734 /* Check if input variable in has fixed value and if so and if val is not NULL,
4735 * then return this fixed value in *val.
4737 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4739 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
4742 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4743 * and if val is not NULL, then return this lower bound in *val.
4745 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4746 unsigned dim, isl_int *val)
4748 int i, i_eq = -1, i_ineq = -1;
4749 isl_int *c;
4750 unsigned total;
4751 unsigned nparam;
4753 if (!bset)
4754 return -1;
4755 total = isl_basic_set_total_dim(bset);
4756 nparam = isl_basic_set_n_param(bset);
4757 for (i = 0; i < bset->n_eq; ++i) {
4758 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4759 continue;
4760 if (i_eq != -1)
4761 return 0;
4762 i_eq = i;
4764 for (i = 0; i < bset->n_ineq; ++i) {
4765 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4766 continue;
4767 if (i_eq != -1 || i_ineq != -1)
4768 return 0;
4769 i_ineq = i;
4771 if (i_eq == -1 && i_ineq == -1)
4772 return 0;
4773 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4774 /* The coefficient should always be one due to normalization. */
4775 if (!isl_int_is_one(c[1+nparam+dim]))
4776 return 0;
4777 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4778 return 0;
4779 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4780 total - nparam - dim - 1) != -1)
4781 return 0;
4782 if (val)
4783 isl_int_neg(*val, c[0]);
4784 return 1;
4787 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4788 unsigned dim, isl_int *val)
4790 int i;
4791 isl_int v;
4792 isl_int tmp;
4793 int fixed;
4795 if (!set)
4796 return -1;
4797 if (set->n == 0)
4798 return 0;
4799 if (set->n == 1)
4800 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4801 dim, val);
4802 isl_int_init(v);
4803 isl_int_init(tmp);
4804 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4805 dim, &v);
4806 for (i = 1; fixed == 1 && i < set->n; ++i) {
4807 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4808 dim, &tmp);
4809 if (fixed == 1 && isl_int_ne(tmp, v))
4810 fixed = 0;
4812 if (val)
4813 isl_int_set(*val, v);
4814 isl_int_clear(tmp);
4815 isl_int_clear(v);
4816 return fixed;
4819 struct constraint {
4820 unsigned size;
4821 isl_int *c;
4824 static int qsort_constraint_cmp(const void *p1, const void *p2)
4826 const struct constraint *c1 = (const struct constraint *)p1;
4827 const struct constraint *c2 = (const struct constraint *)p2;
4828 unsigned size = isl_min(c1->size, c2->size);
4829 return isl_seq_cmp(c1->c, c2->c, size);
4832 static struct isl_basic_map *isl_basic_map_sort_constraints(
4833 struct isl_basic_map *bmap)
4835 int i;
4836 struct constraint *c;
4837 unsigned total;
4839 if (!bmap)
4840 return NULL;
4841 total = isl_basic_map_total_dim(bmap);
4842 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4843 if (!c)
4844 goto error;
4845 for (i = 0; i < bmap->n_ineq; ++i) {
4846 c[i].size = total;
4847 c[i].c = bmap->ineq[i];
4849 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4850 for (i = 0; i < bmap->n_ineq; ++i)
4851 bmap->ineq[i] = c[i].c;
4852 free(c);
4853 return bmap;
4854 error:
4855 isl_basic_map_free(bmap);
4856 return NULL;
4859 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4861 if (!bmap)
4862 return NULL;
4863 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4864 return bmap;
4865 bmap = isl_basic_map_convex_hull(bmap);
4866 bmap = isl_basic_map_sort_constraints(bmap);
4867 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4868 return bmap;
4871 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
4873 return (struct isl_basic_set *)isl_basic_map_normalize(
4874 (struct isl_basic_map *)bset);
4877 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4878 const struct isl_basic_map *bmap2)
4880 int i, cmp;
4881 unsigned total;
4883 if (bmap1 == bmap2)
4884 return 0;
4885 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
4886 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
4887 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
4888 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4889 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
4890 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4891 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4892 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4893 return 0;
4894 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4895 return 1;
4896 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4897 return -1;
4898 if (bmap1->n_eq != bmap2->n_eq)
4899 return bmap1->n_eq - bmap2->n_eq;
4900 if (bmap1->n_ineq != bmap2->n_ineq)
4901 return bmap1->n_ineq - bmap2->n_ineq;
4902 if (bmap1->n_div != bmap2->n_div)
4903 return bmap1->n_div - bmap2->n_div;
4904 total = isl_basic_map_total_dim(bmap1);
4905 for (i = 0; i < bmap1->n_eq; ++i) {
4906 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4907 if (cmp)
4908 return cmp;
4910 for (i = 0; i < bmap1->n_ineq; ++i) {
4911 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4912 if (cmp)
4913 return cmp;
4915 for (i = 0; i < bmap1->n_div; ++i) {
4916 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4917 if (cmp)
4918 return cmp;
4920 return 0;
4923 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4924 struct isl_basic_map *bmap2)
4926 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4929 static int qsort_bmap_cmp(const void *p1, const void *p2)
4931 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4932 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4934 return isl_basic_map_fast_cmp(bmap1, bmap2);
4937 /* We normalize in place, but if anything goes wrong we need
4938 * to return NULL, so we need to make sure we don't change the
4939 * meaning of any possible other copies of map.
4941 struct isl_map *isl_map_normalize(struct isl_map *map)
4943 int i, j;
4944 struct isl_basic_map *bmap;
4946 if (!map)
4947 return NULL;
4948 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
4949 return map;
4950 for (i = 0; i < map->n; ++i) {
4951 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4952 if (!bmap)
4953 goto error;
4954 isl_basic_map_free(map->p[i]);
4955 map->p[i] = bmap;
4957 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4958 ISL_F_SET(map, ISL_MAP_NORMALIZED);
4959 map = isl_map_remove_empty_parts(map);
4960 if (!map)
4961 return NULL;
4962 for (i = map->n - 1; i >= 1; --i) {
4963 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4964 continue;
4965 isl_basic_map_free(map->p[i-1]);
4966 for (j = i; j < map->n; ++j)
4967 map->p[j-1] = map->p[j];
4968 map->n--;
4970 return map;
4971 error:
4972 isl_map_free(map);
4973 return NULL;
4977 struct isl_set *isl_set_normalize(struct isl_set *set)
4979 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4982 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4984 int i;
4985 int equal;
4987 if (!map1 || !map2)
4988 return -1;
4990 if (map1 == map2)
4991 return 1;
4992 if (!isl_dim_equal(map1->dim, map2->dim))
4993 return 0;
4995 map1 = isl_map_copy(map1);
4996 map2 = isl_map_copy(map2);
4997 map1 = isl_map_normalize(map1);
4998 map2 = isl_map_normalize(map2);
4999 if (!map1 || !map2)
5000 goto error;
5001 equal = map1->n == map2->n;
5002 for (i = 0; equal && i < map1->n; ++i) {
5003 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5004 if (equal < 0)
5005 goto error;
5007 isl_map_free(map1);
5008 isl_map_free(map2);
5009 return equal;
5010 error:
5011 isl_map_free(map1);
5012 isl_map_free(map2);
5013 return -1;
5016 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5018 return isl_map_fast_is_equal((struct isl_map *)set1,
5019 (struct isl_map *)set2);
5022 /* Return an interval that ranges from min to max (inclusive)
5024 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5025 isl_int min, isl_int max)
5027 int k;
5028 struct isl_basic_set *bset = NULL;
5030 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5031 if (!bset)
5032 goto error;
5034 k = isl_basic_set_alloc_inequality(bset);
5035 if (k < 0)
5036 goto error;
5037 isl_int_set_si(bset->ineq[k][1], 1);
5038 isl_int_neg(bset->ineq[k][0], min);
5040 k = isl_basic_set_alloc_inequality(bset);
5041 if (k < 0)
5042 goto error;
5043 isl_int_set_si(bset->ineq[k][1], -1);
5044 isl_int_set(bset->ineq[k][0], max);
5046 return bset;
5047 error:
5048 isl_basic_set_free(bset);
5049 return NULL;
5052 /* Return the Cartesian product of the basic sets in list (in the given order).
5054 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5056 int i;
5057 unsigned dim;
5058 unsigned nparam;
5059 unsigned extra;
5060 unsigned n_eq;
5061 unsigned n_ineq;
5062 struct isl_basic_set *product = NULL;
5064 if (!list)
5065 goto error;
5066 isl_assert(list->ctx, list->n > 0, goto error);
5067 isl_assert(list->ctx, list->p[0], goto error);
5068 nparam = isl_basic_set_n_param(list->p[0]);
5069 dim = isl_basic_set_n_dim(list->p[0]);
5070 extra = list->p[0]->n_div;
5071 n_eq = list->p[0]->n_eq;
5072 n_ineq = list->p[0]->n_ineq;
5073 for (i = 1; i < list->n; ++i) {
5074 isl_assert(list->ctx, list->p[i], goto error);
5075 isl_assert(list->ctx,
5076 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5077 dim += isl_basic_set_n_dim(list->p[i]);
5078 extra += list->p[i]->n_div;
5079 n_eq += list->p[i]->n_eq;
5080 n_ineq += list->p[i]->n_ineq;
5082 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5083 n_eq, n_ineq);
5084 if (!product)
5085 goto error;
5086 dim = 0;
5087 for (i = 0; i < list->n; ++i) {
5088 isl_basic_set_add_constraints(product,
5089 isl_basic_set_copy(list->p[i]), dim);
5090 dim += isl_basic_set_n_dim(list->p[i]);
5092 isl_basic_set_list_free(list);
5093 return product;
5094 error:
5095 isl_basic_set_free(product);
5096 isl_basic_set_list_free(list);
5097 return NULL;
5100 struct isl_basic_map *isl_basic_map_product(
5101 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5103 struct isl_dim *dim_result = NULL;
5104 struct isl_basic_map *bmap;
5105 unsigned in1, in2, out1, out2, nparam, total, pos;
5106 struct isl_dim_map *dim_map1, *dim_map2;
5108 if (!bmap1 || !bmap2)
5109 goto error;
5111 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5112 bmap2->dim, isl_dim_param), goto error);
5113 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5114 isl_dim_copy(bmap2->dim));
5116 in1 = isl_basic_map_n_in(bmap1);
5117 in2 = isl_basic_map_n_in(bmap2);
5118 out1 = isl_basic_map_n_out(bmap1);
5119 out2 = isl_basic_map_n_out(bmap2);
5120 nparam = isl_basic_map_n_param(bmap1);
5122 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5123 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5124 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5125 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5126 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5127 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5128 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5129 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5130 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5131 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5132 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5134 bmap = isl_basic_map_alloc_dim(dim_result,
5135 bmap1->n_div + bmap2->n_div,
5136 bmap1->n_eq + bmap2->n_eq,
5137 bmap1->n_ineq + bmap2->n_ineq);
5138 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
5139 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
5140 bmap = isl_basic_map_simplify(bmap);
5141 return isl_basic_map_finalize(bmap);
5142 error:
5143 isl_basic_map_free(bmap1);
5144 isl_basic_map_free(bmap2);
5145 return NULL;
5148 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5150 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
5152 unsigned flags = 0;
5153 struct isl_map *result;
5154 int i, j;
5156 if (!map1 || !map2)
5157 goto error;
5159 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5160 map2->dim, isl_dim_param), goto error);
5162 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5163 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5164 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5166 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5167 isl_dim_copy(map2->dim)),
5168 map1->n * map2->n, flags);
5169 if (!result)
5170 goto error;
5171 for (i = 0; i < map1->n; ++i)
5172 for (j = 0; j < map2->n; ++j) {
5173 struct isl_basic_map *part;
5174 part = isl_basic_map_product(
5175 isl_basic_map_copy(map1->p[i]),
5176 isl_basic_map_copy(map2->p[j]));
5177 if (isl_basic_map_is_empty(part))
5178 isl_basic_map_free(part);
5179 else
5180 result = isl_map_add(result, part);
5181 if (!result)
5182 goto error;
5184 isl_map_free(map1);
5185 isl_map_free(map2);
5186 return result;
5187 error:
5188 isl_map_free(map1);
5189 isl_map_free(map2);
5190 return NULL;
5193 /* Given two set A and B, construct its Cartesian product A x B.
5195 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
5197 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
5198 (struct isl_map *)set2);
5201 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5203 int i;
5204 uint32_t hash = isl_hash_init();
5205 unsigned total;
5207 if (!bset)
5208 return 0;
5209 bset = isl_basic_set_copy(bset);
5210 bset = isl_basic_set_normalize(bset);
5211 if (!bset)
5212 return 0;
5213 total = isl_basic_set_total_dim(bset);
5214 isl_hash_byte(hash, bset->n_eq & 0xFF);
5215 for (i = 0; i < bset->n_eq; ++i) {
5216 uint32_t c_hash;
5217 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5218 isl_hash_hash(hash, c_hash);
5220 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5221 for (i = 0; i < bset->n_ineq; ++i) {
5222 uint32_t c_hash;
5223 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5224 isl_hash_hash(hash, c_hash);
5226 isl_hash_byte(hash, bset->n_div & 0xFF);
5227 for (i = 0; i < bset->n_div; ++i) {
5228 uint32_t c_hash;
5229 if (isl_int_is_zero(bset->div[i][0]))
5230 continue;
5231 isl_hash_byte(hash, i & 0xFF);
5232 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5233 isl_hash_hash(hash, c_hash);
5235 isl_basic_set_free(bset);
5236 return hash;
5239 uint32_t isl_set_get_hash(struct isl_set *set)
5241 int i;
5242 uint32_t hash;
5244 if (!set)
5245 return 0;
5246 set = isl_set_copy(set);
5247 set = isl_set_normalize(set);
5248 if (!set)
5249 return 0;
5251 hash = isl_hash_init();
5252 for (i = 0; i < set->n; ++i) {
5253 uint32_t bset_hash;
5254 bset_hash = isl_basic_set_get_hash(set->p[i]);
5255 isl_hash_hash(hash, bset_hash);
5258 isl_set_free(set);
5260 return hash;
5263 /* Check if the value for dimension dim is completely determined
5264 * by the values of the other parameters and variables.
5265 * That is, check if dimension dim is involved in an equality.
5267 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5269 int i;
5270 unsigned nparam;
5272 if (!bset)
5273 return -1;
5274 nparam = isl_basic_set_n_param(bset);
5275 for (i = 0; i < bset->n_eq; ++i)
5276 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5277 return 1;
5278 return 0;
5281 /* Check if the value for dimension dim is completely determined
5282 * by the values of the other parameters and variables.
5283 * That is, check if dimension dim is involved in an equality
5284 * for each of the subsets.
5286 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5288 int i;
5290 if (!set)
5291 return -1;
5292 for (i = 0; i < set->n; ++i) {
5293 int unique;
5294 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
5295 if (unique != 1)
5296 return unique;
5298 return 1;