add isl_basic_set_positive_orthant
[platform/upstream/isl.git] / isl_map.c
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_list.h"
7 #include "isl_lp.h"
8 #include "isl_seq.h"
9 #include "isl_set.h"
10 #include "isl_map.h"
11 #include "isl_map_private.h"
12 #include "isl_map_piplib.h"
13 #include "isl_sample.h"
14 #include "isl_vec.h"
15
16 /* Maps dst positions to src positions */
17 struct isl_dim_map {
18         unsigned len;
19         int pos[1];
20 };
21
22 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
23 {
24         int i;
25         struct isl_dim_map *dim_map;
26         dim_map = isl_alloc(ctx, struct isl_dim_map,
27                                 sizeof(struct isl_dim_map) + len * sizeof(int));
28         if (!dim_map)
29                 return NULL;
30         dim_map->len = 1 + len;
31         dim_map->pos[0] = 0;
32         for (i = 0; i < len; ++i)
33                 dim_map->pos[1 + i] = -1;
34         return dim_map;
35 }
36
37 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
38 {
39         switch (type) {
40         case isl_dim_param:     return dim->nparam;
41         case isl_dim_in:        return dim->n_in;
42         case isl_dim_out:       return dim->n_out;
43         case isl_dim_all:       return dim->nparam + dim->n_in + dim->n_out;
44         }
45 }
46
47 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
48 {
49         switch (type) {
50         case isl_dim_param:     return 1;
51         case isl_dim_in:        return 1 + dim->nparam;
52         case isl_dim_out:       return 1 + dim->nparam + dim->n_in;
53         }
54 }
55
56 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
57                 enum isl_dim_type type, unsigned dst_pos)
58 {
59         int i;
60         unsigned src_pos;
61
62         if (!dim_map || !dim)
63                 return;
64         
65         src_pos = pos(dim, type);
66         for (i = 0; i < n(dim, type); ++i)
67                 dim_map->pos[1 + dst_pos + i] = src_pos + i;
68 }
69
70 static void isl_dim_map_div(struct isl_dim_map *dim_map,
71                 struct isl_basic_map *bmap, unsigned dst_pos)
72 {
73         int i;
74         unsigned src_pos;
75
76         if (!dim_map || !bmap)
77                 return;
78         
79         src_pos = 1 + isl_dim_total(bmap->dim);
80         for (i = 0; i < bmap->n_div; ++i)
81                 dim_map->pos[1 + dst_pos + i] = src_pos + i;
82 }
83
84 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
85 {
86         int i;
87
88         for (i = 0; i < dim_map->len; ++i)
89                 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
90         fprintf(stderr, "\n");
91 }
92
93 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
94                                 enum isl_dim_type type)
95 {
96         struct isl_dim *dim = bmap->dim;
97         switch (type) {
98         case isl_dim_param:
99         case isl_dim_in:
100         case isl_dim_out:       return isl_dim_size(bmap->dim, type);
101         case isl_dim_div:       return bmap->n_div;
102         case isl_dim_all:       return isl_basic_map_total_dim(bmap);
103         }
104 }
105
106 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
107 {
108         return n(map->dim, type);
109 }
110
111 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
112 {
113         return n(set->dim, type);
114 }
115
116 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
117                                         enum isl_dim_type type)
118 {
119         struct isl_dim *dim = bmap->dim;
120         switch (type) {
121         case isl_dim_param:     return 1;
122         case isl_dim_in:        return 1 + dim->nparam;
123         case isl_dim_out:       return 1 + dim->nparam + dim->n_in;
124         case isl_dim_div:       return 1 + dim->nparam + dim->n_in + dim->n_out;
125         }
126 }
127
128 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
129 {
130         return pos(map->dim, type);
131 }
132
133 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
134                                 enum isl_dim_type type)
135 {
136         return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
137 }
138
139 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
140 {
141         return bset->dim->n_out;
142 }
143
144 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
145 {
146         return bset->dim->nparam;
147 }
148
149 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
150 {
151         return isl_dim_total(bset->dim) + bset->n_div;
152 }
153
154 unsigned isl_set_n_dim(const struct isl_set *set)
155 {
156         return set->dim->n_out;
157 }
158
159 unsigned isl_set_n_param(const struct isl_set *set)
160 {
161         return set->dim->nparam;
162 }
163
164 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
165 {
166         return bmap->dim->n_in;
167 }
168
169 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
170 {
171         return bmap->dim->n_out;
172 }
173
174 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
175 {
176         return bmap->dim->nparam;
177 }
178
179 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
180 {
181         return bmap->n_div;
182 }
183
184 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
185 {
186         return isl_dim_total(bmap->dim) + bmap->n_div;
187 }
188
189 unsigned isl_map_n_in(const struct isl_map *map)
190 {
191         return map->dim->n_in;
192 }
193
194 unsigned isl_map_n_out(const struct isl_map *map)
195 {
196         return map->dim->n_out;
197 }
198
199 unsigned isl_map_n_param(const struct isl_map *map)
200 {
201         return map->dim->nparam;
202 }
203
204 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
205 {
206         return map->dim->n_in == set->dim->n_out &&
207                map->dim->nparam == set->dim->nparam;
208 }
209
210 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
211                 struct isl_basic_set *bset)
212 {
213         return bmap->dim->n_in == bset->dim->n_out &&
214                bmap->dim->nparam == bset->dim->nparam;
215 }
216
217 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
218                 struct isl_basic_set *bset)
219 {
220         return bmap->dim->n_out == bset->dim->n_out &&
221                bmap->dim->nparam == bset->dim->nparam;
222 }
223
224 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
225 {
226         if (!bmap)
227                 return NULL;
228         return isl_dim_copy(bmap->dim);
229 }
230
231 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
232 {
233         if (!bset)
234                 return NULL;
235         return isl_dim_copy(bset->dim);
236 }
237
238 struct isl_dim *isl_map_get_dim(struct isl_map *map)
239 {
240         if (!map)
241                 return NULL;
242         return isl_dim_copy(map->dim);
243 }
244
245 struct isl_dim *isl_set_get_dim(struct isl_set *set)
246 {
247         if (!set)
248                 return NULL;
249         return isl_dim_copy(set->dim);
250 }
251
252 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
253                 struct isl_basic_map *bmap, unsigned extra,
254                 unsigned n_eq, unsigned n_ineq)
255 {
256         int i;
257         size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
258
259         bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
260         if (isl_blk_is_error(bmap->block)) {
261                 free(bmap);
262                 return NULL;
263         }
264
265         bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
266         if (!bmap->ineq) {
267                 isl_blk_free(ctx, bmap->block);
268                 free(bmap);
269                 return NULL;
270         }
271
272         if (extra == 0) {
273                 bmap->block2 = isl_blk_empty();
274                 bmap->div = NULL;
275         } else {
276                 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
277                 if (isl_blk_is_error(bmap->block2)) {
278                         free(bmap->ineq);
279                         isl_blk_free(ctx, bmap->block);
280                         free(bmap);
281                         return NULL;
282                 }
283
284                 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
285                 if (!bmap->div) {
286                         isl_blk_free(ctx, bmap->block2);
287                         free(bmap->ineq);
288                         isl_blk_free(ctx, bmap->block);
289                         free(bmap);
290                         return NULL;
291                 }
292         }
293
294         for (i = 0; i < n_ineq + n_eq; ++i)
295                 bmap->ineq[i] = bmap->block.data + i * row_size;
296
297         for (i = 0; i < extra; ++i)
298                 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
299
300         bmap->ctx = ctx;
301         isl_ctx_ref(ctx);
302         bmap->ref = 1;
303         bmap->flags = 0;
304         bmap->c_size = n_eq + n_ineq;
305         bmap->eq = bmap->ineq + n_ineq;
306         bmap->extra = extra;
307         bmap->n_eq = 0;
308         bmap->n_ineq = 0;
309         bmap->n_div = 0;
310         bmap->sample = NULL;
311
312         return bmap;
313 error:
314         isl_basic_map_free(bmap);
315         return NULL;
316 }
317
318 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
319                 unsigned nparam, unsigned dim, unsigned extra,
320                 unsigned n_eq, unsigned n_ineq)
321 {
322         struct isl_basic_map *bmap;
323         bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
324         return (struct isl_basic_set *)bmap;
325 }
326
327 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
328                 unsigned extra, unsigned n_eq, unsigned n_ineq)
329 {
330         struct isl_basic_map *bmap;
331         if (!dim)
332                 return NULL;
333         isl_assert(dim->ctx, dim->n_in == 0, return NULL);
334         bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
335         return (struct isl_basic_set *)bmap;
336 }
337
338 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
339                 unsigned extra, unsigned n_eq, unsigned n_ineq)
340 {
341         struct isl_basic_map *bmap;
342
343         if (!dim)
344                 return NULL;
345         bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
346         if (!bmap)
347                 goto error;
348         bmap->dim = dim;
349
350         return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
351 error:
352         isl_dim_free(dim);
353         return NULL;
354 }
355
356 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
357                 unsigned nparam, unsigned in, unsigned out, unsigned extra,
358                 unsigned n_eq, unsigned n_ineq)
359 {
360         struct isl_basic_map *bmap;
361         struct isl_dim *dim;
362
363         dim = isl_dim_alloc(ctx, nparam, in, out);
364         if (!dim)
365                 return NULL;
366
367         bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
368         return bmap;
369 }
370
371 static void dup_constraints(
372                 struct isl_basic_map *dst, struct isl_basic_map *src)
373 {
374         int i;
375         unsigned total = isl_basic_map_total_dim(src);
376
377         for (i = 0; i < src->n_eq; ++i) {
378                 int j = isl_basic_map_alloc_equality(dst);
379                 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
380         }
381
382         for (i = 0; i < src->n_ineq; ++i) {
383                 int j = isl_basic_map_alloc_inequality(dst);
384                 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
385         }
386
387         for (i = 0; i < src->n_div; ++i) {
388                 int j = isl_basic_map_alloc_div(dst);
389                 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
390         }
391         ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
392 }
393
394 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
395 {
396         struct isl_basic_map *dup;
397
398         if (!bmap)
399                 return NULL;
400         dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
401                         bmap->n_div, bmap->n_eq, bmap->n_ineq);
402         if (!dup)
403                 return NULL;
404         dup_constraints(dup, bmap);
405         dup->flags = bmap->flags;
406         dup->sample = isl_vec_copy(bmap->sample);
407         return dup;
408 }
409
410 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
411 {
412         struct isl_basic_map *dup;
413
414         dup = isl_basic_map_dup((struct isl_basic_map *)bset);
415         return (struct isl_basic_set *)dup;
416 }
417
418 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
419 {
420         if (!bset)
421                 return NULL;
422
423         if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
424                 bset->ref++;
425                 return bset;
426         }
427         return isl_basic_set_dup(bset);
428 }
429
430 struct isl_set *isl_set_copy(struct isl_set *set)
431 {
432         if (!set)
433                 return NULL;
434
435         set->ref++;
436         return set;
437 }
438
439 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
440 {
441         if (!bmap)
442                 return NULL;
443
444         if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
445                 bmap->ref++;
446                 return bmap;
447         }
448         return isl_basic_map_dup(bmap);
449 }
450
451 struct isl_map *isl_map_copy(struct isl_map *map)
452 {
453         if (!map)
454                 return NULL;
455
456         map->ref++;
457         return map;
458 }
459
460 void isl_basic_map_free(struct isl_basic_map *bmap)
461 {
462         if (!bmap)
463                 return;
464
465         if (--bmap->ref > 0)
466                 return;
467
468         isl_ctx_deref(bmap->ctx);
469         free(bmap->div);
470         isl_blk_free(bmap->ctx, bmap->block2);
471         free(bmap->ineq);
472         isl_blk_free(bmap->ctx, bmap->block);
473         isl_vec_free(bmap->sample);
474         isl_dim_free(bmap->dim);
475         free(bmap);
476 }
477
478 void isl_basic_set_free(struct isl_basic_set *bset)
479 {
480         isl_basic_map_free((struct isl_basic_map *)bset);
481 }
482
483 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
484 {
485         return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
486 }
487
488 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
489 {
490         struct isl_ctx *ctx;
491         if (!bmap)
492                 return -1;
493         ctx = bmap->ctx;
494         isl_assert(ctx, room_for_con(bmap, 1), return -1);
495         isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
496                         return -1);
497         ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
498         ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
499         ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
500         ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
501         ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
502         if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
503                 isl_int *t;
504                 int j = isl_basic_map_alloc_inequality(bmap);
505                 if (j < 0)
506                         return -1;
507                 t = bmap->ineq[j];
508                 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
509                 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
510                 bmap->eq[-1] = t;
511                 bmap->n_eq++;
512                 bmap->n_ineq--;
513                 bmap->eq--;
514                 return 0;
515         }
516         isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
517                       bmap->extra - bmap->n_div);
518         return bmap->n_eq++;
519 }
520
521 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
522 {
523         return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
524 }
525
526 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
527 {
528         if (!bmap)
529                 return -1;
530         isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
531         bmap->n_eq -= n;
532         return 0;
533 }
534
535 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
536 {
537         return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
538 }
539
540 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
541 {
542         isl_int *t;
543         if (!bmap)
544                 return -1;
545         isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
546
547         if (pos != bmap->n_eq - 1) {
548                 t = bmap->eq[pos];
549                 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
550                 bmap->eq[bmap->n_eq - 1] = t;
551         }
552         bmap->n_eq--;
553         return 0;
554 }
555
556 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
557 {
558         return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
559 }
560
561 void isl_basic_map_inequality_to_equality(
562                 struct isl_basic_map *bmap, unsigned pos)
563 {
564         isl_int *t;
565
566         t = bmap->ineq[pos];
567         bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
568         bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
569         bmap->eq[-1] = t;
570         bmap->n_eq++;
571         bmap->n_ineq--;
572         bmap->eq--;
573         ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
574         ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
575         ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
576         ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
577 }
578
579 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
580 {
581         return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
582 }
583
584 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
585 {
586         struct isl_ctx *ctx;
587         if (!bmap)
588                 return -1;
589         ctx = bmap->ctx;
590         isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
591         ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
592         ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
593         ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
594         ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
595         isl_seq_clr(bmap->ineq[bmap->n_ineq] +
596                       1 + isl_basic_map_total_dim(bmap),
597                       bmap->extra - bmap->n_div);
598         return bmap->n_ineq++;
599 }
600
601 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
602 {
603         return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
604 }
605
606 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
607 {
608         if (!bmap)
609                 return -1;
610         isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
611         bmap->n_ineq -= n;
612         return 0;
613 }
614
615 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
616 {
617         return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
618 }
619
620 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
621 {
622         isl_int *t;
623         if (!bmap)
624                 return -1;
625         isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
626
627         if (pos != bmap->n_ineq - 1) {
628                 t = bmap->ineq[pos];
629                 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
630                 bmap->ineq[bmap->n_ineq - 1] = t;
631                 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
632         }
633         bmap->n_ineq--;
634         return 0;
635 }
636
637 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
638 {
639         return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
640 }
641
642 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
643 {
644         if (!bmap)
645                 return -1;
646         isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
647         isl_seq_clr(bmap->div[bmap->n_div] +
648                       1 + 1 + isl_basic_map_total_dim(bmap),
649                       bmap->extra - bmap->n_div);
650         ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
651         return bmap->n_div++;
652 }
653
654 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
655 {
656         return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
657 }
658
659 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
660 {
661         if (!bmap)
662                 return -1;
663         isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
664         bmap->n_div -= n;
665         return 0;
666 }
667
668 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
669 {
670         return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
671 }
672
673 /* Copy constraint from src to dst, putting the vars of src at offset
674  * dim_off in dst and the divs of src at offset div_off in dst.
675  * If both sets are actually map, then dim_off applies to the input
676  * variables.
677  */
678 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
679                             struct isl_basic_map *src_map, isl_int *src,
680                             unsigned in_off, unsigned out_off, unsigned div_off)
681 {
682         unsigned src_nparam = isl_basic_map_n_param(src_map);
683         unsigned dst_nparam = isl_basic_map_n_param(dst_map);
684         unsigned src_in = isl_basic_map_n_in(src_map);
685         unsigned dst_in = isl_basic_map_n_in(dst_map);
686         unsigned src_out = isl_basic_map_n_out(src_map);
687         unsigned dst_out = isl_basic_map_n_out(dst_map);
688         isl_int_set(dst[0], src[0]);
689         isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
690         if (dst_nparam > src_nparam)
691                 isl_seq_clr(dst+1+src_nparam,
692                                 dst_nparam - src_nparam);
693         isl_seq_clr(dst+1+dst_nparam, in_off);
694         isl_seq_cpy(dst+1+dst_nparam+in_off,
695                     src+1+src_nparam,
696                     isl_min(dst_in-in_off, src_in));
697         if (dst_in-in_off > src_in)
698                 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
699                                 dst_in - in_off - src_in);
700         isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
701         isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
702                     src+1+src_nparam+src_in,
703                     isl_min(dst_out-out_off, src_out));
704         if (dst_out-out_off > src_out)
705                 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
706                                 dst_out - out_off - src_out);
707         isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
708         isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
709                     src+1+src_nparam+src_in+src_out,
710                     isl_min(dst_map->extra-div_off, src_map->n_div));
711         if (dst_map->n_div-div_off > src_map->n_div)
712                 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
713                                 div_off+src_map->n_div,
714                                 dst_map->n_div - div_off - src_map->n_div);
715 }
716
717 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
718                      struct isl_basic_map *src_map, isl_int *src,
719                      unsigned in_off, unsigned out_off, unsigned div_off)
720 {
721         isl_int_set(dst[0], src[0]);
722         copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
723 }
724
725 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
726                 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
727 {
728         int i;
729         unsigned div_off;
730
731         if (!bmap1 || !bmap2)
732                 goto error;
733
734         div_off = bmap1->n_div;
735
736         for (i = 0; i < bmap2->n_eq; ++i) {
737                 int i1 = isl_basic_map_alloc_equality(bmap1);
738                 if (i1 < 0)
739                         goto error;
740                 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
741                                 i_pos, o_pos, div_off);
742         }
743
744         for (i = 0; i < bmap2->n_ineq; ++i) {
745                 int i1 = isl_basic_map_alloc_inequality(bmap1);
746                 if (i1 < 0)
747                         goto error;
748                 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
749                                 i_pos, o_pos, div_off);
750         }
751
752         for (i = 0; i < bmap2->n_div; ++i) {
753                 int i1 = isl_basic_map_alloc_div(bmap1);
754                 if (i1 < 0)
755                         goto error;
756                 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
757                          i_pos, o_pos, div_off);
758         }
759
760         isl_basic_map_free(bmap2);
761
762         return bmap1;
763
764 error:
765         isl_basic_map_free(bmap1);
766         isl_basic_map_free(bmap2);
767         return NULL;
768 }
769
770 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
771                                         struct isl_dim_map *dim_map)
772 {
773         int i;
774
775         for (i = 0; i < dim_map->len; ++i) {
776                 if (dim_map->pos[i] < 0)
777                         isl_int_set_si(dst[i], 0);
778                 else
779                         isl_int_set(dst[i], src[dim_map->pos[i]]);
780         }
781 }
782
783 static void copy_div_dim_map(isl_int *dst, isl_int *src,
784                                         struct isl_dim_map *dim_map)
785 {
786         isl_int_set(dst[0], src[0]);
787         copy_constraint_dim_map(dst+1, src+1, dim_map);
788 }
789
790 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
791                 struct isl_basic_map *src, struct isl_dim_map *dim_map)
792 {
793         int i;
794
795         if (!src || !dst || !dim_map)
796                 goto error;
797
798         for (i = 0; i < src->n_eq; ++i) {
799                 int i1 = isl_basic_map_alloc_equality(dst);
800                 if (i1 < 0)
801                         goto error;
802                 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
803         }
804
805         for (i = 0; i < src->n_ineq; ++i) {
806                 int i1 = isl_basic_map_alloc_inequality(dst);
807                 if (i1 < 0)
808                         goto error;
809                 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
810         }
811
812         for (i = 0; i < src->n_div; ++i) {
813                 int i1 = isl_basic_map_alloc_div(dst);
814                 if (i1 < 0)
815                         goto error;
816                 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
817         }
818
819         free(dim_map);
820         isl_basic_map_free(src);
821
822         return dst;
823 error:
824         free(dim_map);
825         isl_basic_map_free(src);
826         isl_basic_map_free(dst);
827         return NULL;
828 }
829
830 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
831                 struct isl_basic_set *bset2, unsigned pos)
832 {
833         return (struct isl_basic_set *)
834                 add_constraints((struct isl_basic_map *)bset1,
835                                 (struct isl_basic_map *)bset2, 0, pos);
836 }
837
838 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
839                 struct isl_dim *dim, unsigned extra,
840                 unsigned n_eq, unsigned n_ineq)
841 {
842         struct isl_basic_map *ext;
843         unsigned flags;
844         int dims_ok;
845
846         if (!dim)
847                 goto error;
848
849         if (!base)
850                 goto error;
851
852         dims_ok = isl_dim_equal(base->dim, dim) &&
853                   base->extra >= base->n_div + extra;
854
855         if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
856                        room_for_ineq(base, n_ineq)) {
857                 isl_dim_free(dim);
858                 return base;
859         }
860
861         isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
862         isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
863         isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
864         extra += base->extra;
865         n_eq += base->n_eq;
866         n_ineq += base->n_ineq;
867
868         ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
869         dim = NULL;
870         if (!ext)
871                 goto error;
872
873         flags = base->flags;
874         ext = add_constraints(ext, base, 0, 0);
875         if (ext) {
876                 ext->flags = flags;
877                 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
878         }
879
880         return ext;
881
882 error:
883         isl_dim_free(dim);
884         isl_basic_map_free(base);
885         return NULL;
886 }
887
888 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
889                 struct isl_dim *dim, unsigned extra,
890                 unsigned n_eq, unsigned n_ineq)
891 {
892         return (struct isl_basic_set *)
893                 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
894                                                         extra, n_eq, n_ineq);
895 }
896
897 struct isl_basic_map *isl_basic_map_extend_constraints(
898                 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
899 {
900         if (!base)
901                 return NULL;
902         return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
903                                         0, n_eq, n_ineq);
904 }
905
906 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
907                 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
908                 unsigned n_eq, unsigned n_ineq)
909 {
910         struct isl_basic_map *bmap;
911         struct isl_dim *dim;
912
913         if (!base)
914                 return NULL;
915         dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
916         if (!dim)
917                 return NULL;
918
919         bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
920         return bmap;
921 }
922
923 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
924                 unsigned nparam, unsigned dim, unsigned extra,
925                 unsigned n_eq, unsigned n_ineq)
926 {
927         return (struct isl_basic_set *)
928                 isl_basic_map_extend((struct isl_basic_map *)base,
929                                         nparam, 0, dim, extra, n_eq, n_ineq);
930 }
931
932 struct isl_basic_set *isl_basic_set_extend_constraints(
933                 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
934 {
935         return (struct isl_basic_set *)
936                 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
937                                                     n_eq, n_ineq);
938 }
939
940 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
941 {
942         return (struct isl_basic_set *)
943                 isl_basic_map_cow((struct isl_basic_map *)bset);
944 }
945
946 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
947 {
948         if (!bmap)
949                 return NULL;
950
951         if (bmap->ref > 1) {
952                 bmap->ref--;
953                 bmap = isl_basic_map_dup(bmap);
954         }
955         ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
956         return bmap;
957 }
958
959 struct isl_set *isl_set_cow(struct isl_set *set)
960 {
961         if (!set)
962                 return NULL;
963
964         if (set->ref == 1)
965                 return set;
966         set->ref--;
967         return isl_set_dup(set);
968 }
969
970 struct isl_map *isl_map_cow(struct isl_map *map)
971 {
972         if (!map)
973                 return NULL;
974
975         if (map->ref == 1)
976                 return map;
977         map->ref--;
978         return isl_map_dup(map);
979 }
980
981 static void swap_vars(struct isl_blk blk, isl_int *a,
982                         unsigned a_len, unsigned b_len)
983 {
984         isl_seq_cpy(blk.data, a+a_len, b_len);
985         isl_seq_cpy(blk.data+b_len, a, a_len);
986         isl_seq_cpy(a, blk.data, b_len+a_len);
987 }
988
989 struct isl_basic_set *isl_basic_set_swap_vars(
990                 struct isl_basic_set *bset, unsigned n)
991 {
992         int i;
993         struct isl_blk blk;
994         unsigned dim;
995         unsigned nparam;
996
997         if (!bset)
998                 goto error;
999
1000         nparam = isl_basic_set_n_param(bset);
1001         dim = isl_basic_set_n_dim(bset);
1002         isl_assert(bset->ctx, n <= dim, goto error);
1003
1004         if (n == dim)
1005                 return bset;
1006
1007         bset = isl_basic_set_cow(bset);
1008         if (!bset)
1009                 return NULL;
1010
1011         blk = isl_blk_alloc(bset->ctx, dim);
1012         if (isl_blk_is_error(blk))
1013                 goto error;
1014
1015         for (i = 0; i < bset->n_eq; ++i)
1016                 swap_vars(blk,
1017                           bset->eq[i]+1+nparam, n, dim - n);
1018
1019         for (i = 0; i < bset->n_ineq; ++i)
1020                 swap_vars(blk,
1021                           bset->ineq[i]+1+nparam, n, dim - n);
1022
1023         for (i = 0; i < bset->n_div; ++i)
1024                 swap_vars(blk,
1025                           bset->div[i]+1+1+nparam, n, dim - n);
1026
1027         isl_blk_free(bset->ctx, blk);
1028
1029         ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1030         return bset;
1031
1032 error:
1033         isl_basic_set_free(bset);
1034         return NULL;
1035 }
1036
1037 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1038 {
1039         int i;
1040         set = isl_set_cow(set);
1041         if (!set)
1042                 return NULL;
1043
1044         for (i = 0; i < set->n; ++i) {
1045                 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1046                 if (!set->p[i]) {
1047                         isl_set_free(set);
1048                         return NULL;
1049                 }
1050         }
1051         ISL_F_CLR(set, ISL_SET_NORMALIZED);
1052         return set;
1053 }
1054
1055 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1056 {
1057         int i = 0;
1058         unsigned total;
1059         if (!bmap)
1060                 goto error;
1061         total = isl_basic_map_total_dim(bmap);
1062         isl_basic_map_free_div(bmap, bmap->n_div);
1063         isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1064         if (bmap->n_eq > 0)
1065                 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1066         else {
1067                 isl_basic_map_alloc_equality(bmap);
1068                 if (i < 0)
1069                         goto error;
1070         }
1071         isl_int_set_si(bmap->eq[i][0], 1);
1072         isl_seq_clr(bmap->eq[i]+1, total);
1073         ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1074         return isl_basic_map_finalize(bmap);
1075 error:
1076         isl_basic_map_free(bmap);
1077         return NULL;
1078 }
1079
1080 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1081 {
1082         return (struct isl_basic_set *)
1083                 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1084 }
1085
1086 static void swap_div(struct isl_basic_map *bmap, int a, int b)
1087 {
1088         int i;
1089         unsigned off = isl_dim_total(bmap->dim);
1090         isl_int *t = bmap->div[a];
1091         bmap->div[a] = bmap->div[b];
1092         bmap->div[b] = t;
1093
1094         for (i = 0; i < bmap->n_eq; ++i)
1095                 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1096
1097         for (i = 0; i < bmap->n_ineq; ++i)
1098                 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1099
1100         for (i = 0; i < bmap->n_div; ++i)
1101                 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1102         ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1103 }
1104
1105 /* Eliminate the specified n dimensions starting at first from the
1106  * constraints using Fourier-Motzkin, The dimensions themselves
1107  * are not removed.
1108  */
1109 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1110         unsigned first, unsigned n)
1111 {
1112         int i;
1113         unsigned nparam;
1114
1115         if (!set)
1116                 return NULL;
1117         if (n == 0)
1118                 return set;
1119
1120         set = isl_set_cow(set);
1121         if (!set)
1122                 return NULL;
1123         isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1124         nparam = isl_set_n_param(set);
1125         
1126         for (i = 0; i < set->n; ++i) {
1127                 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1128                                                             nparam + first, n);
1129                 if (!set->p[i])
1130                         goto error;
1131         }
1132         return set;
1133 error:
1134         isl_set_free(set);
1135         return NULL;
1136 }
1137
1138 /* Project out n dimensions starting at first using Fourier-Motzkin */
1139 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1140         unsigned first, unsigned n)
1141 {
1142         set = isl_set_eliminate_dims(set, first, n);
1143         set = isl_set_drop_dims(set, first, n);
1144         return set;
1145 }
1146
1147 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1148 {
1149         bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1150                                                 bset->n_div);
1151         if (!bset)
1152                 return NULL;
1153         bset->n_div = 0;
1154         return bset;
1155 }
1156
1157 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1158 {
1159         int i;
1160
1161         if (!set)
1162                 return NULL;
1163         if (set->n == 0)
1164                 return set;
1165
1166         set = isl_set_cow(set);
1167         if (!set)
1168                 return NULL;
1169         
1170         for (i = 0; i < set->n; ++i) {
1171                 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1172                 if (!set->p[i])
1173                         goto error;
1174         }
1175         return set;
1176 error:
1177         isl_set_free(set);
1178         return NULL;
1179 }
1180
1181 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1182         enum isl_dim_type type, unsigned first, unsigned n)
1183 {
1184         if (!bmap)
1185                 return NULL;
1186         isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1187                         goto error);
1188         if (n == 0)
1189                 return bmap;
1190         bmap = isl_basic_map_eliminate_vars(bmap,
1191                         isl_basic_map_offset(bmap, type) - 1 + first, n);
1192         bmap = isl_basic_map_drop(bmap, type, first, n);
1193         return bmap;
1194 error:
1195         isl_basic_map_free(bmap);
1196         return NULL;
1197 }
1198
1199 struct isl_map *isl_map_remove(struct isl_map *map,
1200         enum isl_dim_type type, unsigned first, unsigned n)
1201 {
1202         int i;
1203         unsigned nparam;
1204
1205         if (n == 0)
1206                 return map;
1207
1208         map = isl_map_cow(map);
1209         if (!map)
1210                 return NULL;
1211         isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1212         
1213         for (i = 0; i < map->n; ++i) {
1214                 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1215                         isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1216                 if (!map->p[i])
1217                         goto error;
1218         }
1219         map = isl_map_drop(map, type, first, n);
1220         return map;
1221 error:
1222         isl_map_free(map);
1223         return NULL;
1224 }
1225
1226 /* Project out n inputs starting at first using Fourier-Motzkin */
1227 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1228         unsigned first, unsigned n)
1229 {
1230         return isl_map_remove(map, isl_dim_in, first, n);
1231 }
1232
1233 /* Project out n dimensions starting at first using Fourier-Motzkin */
1234 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1235         unsigned first, unsigned n)
1236 {
1237         unsigned nparam = isl_basic_set_n_param(bset);
1238         bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1239         bset = isl_basic_set_drop_dims(bset, first, n);
1240         return bset;
1241 }
1242
1243 static void dump_term(struct isl_basic_map *bmap,
1244                         isl_int c, int pos, FILE *out)
1245 {
1246         const char *name;
1247         unsigned in = isl_basic_map_n_in(bmap);
1248         unsigned dim = in + isl_basic_map_n_out(bmap);
1249         unsigned nparam = isl_basic_map_n_param(bmap);
1250         if (!pos)
1251                 isl_int_print(out, c, 0);
1252         else {
1253                 if (!isl_int_is_one(c))
1254                         isl_int_print(out, c, 0);
1255                 if (pos < 1 + nparam) {
1256                         name = isl_dim_get_name(bmap->dim,
1257                                                 isl_dim_param, pos - 1);
1258                         if (name)
1259                                 fprintf(out, "%s", name);
1260                         else
1261                                 fprintf(out, "p%d", pos - 1);
1262                 } else if (pos < 1 + nparam + in)
1263                         fprintf(out, "i%d", pos - 1 - nparam);
1264                 else if (pos < 1 + nparam + dim)
1265                         fprintf(out, "o%d", pos - 1 - nparam - in);
1266                 else
1267                         fprintf(out, "e%d", pos - 1 - nparam - dim);
1268         }
1269 }
1270
1271 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1272                                 int sign, FILE *out)
1273 {
1274         int i;
1275         int first;
1276         unsigned len = 1 + isl_basic_map_total_dim(bmap);
1277         isl_int v;
1278
1279         isl_int_init(v);
1280         for (i = 0, first = 1; i < len; ++i) {
1281                 if (isl_int_sgn(c[i]) * sign <= 0)
1282                         continue;
1283                 if (!first)
1284                         fprintf(out, " + ");
1285                 first = 0;
1286                 isl_int_abs(v, c[i]);
1287                 dump_term(bmap, v, i, out);
1288         }
1289         isl_int_clear(v);
1290         if (first)
1291                 fprintf(out, "0");
1292 }
1293
1294 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1295                                 const char *op, FILE *out, int indent)
1296 {
1297         int i;
1298
1299         fprintf(out, "%*s", indent, "");
1300
1301         dump_constraint_sign(bmap, c, 1, out);
1302         fprintf(out, " %s ", op);
1303         dump_constraint_sign(bmap, c, -1, out);
1304
1305         fprintf(out, "\n");
1306
1307         for (i = bmap->n_div; i < bmap->extra; ++i) {
1308                 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1309                         continue;
1310                 fprintf(out, "%*s", indent, "");
1311                 fprintf(out, "ERROR: unused div coefficient not zero\n");
1312                 abort();
1313         }
1314 }
1315
1316 static void dump_constraints(struct isl_basic_map *bmap,
1317                                 isl_int **c, unsigned n,
1318                                 const char *op, FILE *out, int indent)
1319 {
1320         int i;
1321
1322         for (i = 0; i < n; ++i)
1323                 dump_constraint(bmap, c[i], op, out, indent);
1324 }
1325
1326 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1327 {
1328         int j;
1329         int first = 1;
1330         unsigned total = isl_basic_map_total_dim(bmap);
1331
1332         for (j = 0; j < 1 + total; ++j) {
1333                 if (isl_int_is_zero(exp[j]))
1334                         continue;
1335                 if (!first && isl_int_is_pos(exp[j]))
1336                         fprintf(out, "+");
1337                 dump_term(bmap, exp[j], j, out);
1338                 first = 0;
1339         }
1340 }
1341
1342 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1343 {
1344         int i;
1345
1346         dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1347         dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1348
1349         for (i = 0; i < bmap->n_div; ++i) {
1350                 fprintf(out, "%*s", indent, "");
1351                 fprintf(out, "e%d = [(", i);
1352                 dump_affine(bmap, bmap->div[i]+1, out);
1353                 fprintf(out, ")/");
1354                 isl_int_print(out, bmap->div[i][0], 0);
1355                 fprintf(out, "]\n");
1356         }
1357 }
1358
1359 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1360 {
1361         if (!bset) {
1362                 fprintf(out, "null basic set\n");
1363                 return;
1364         }
1365
1366         fprintf(out, "%*s", indent, "");
1367         fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1368                         bset->ref, bset->dim->nparam, bset->dim->n_out,
1369                         bset->extra, bset->flags);
1370         dump((struct isl_basic_map *)bset, out, indent);
1371 }
1372
1373 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1374 {
1375         if (!bmap) {
1376                 fprintf(out, "null basic map\n");
1377                 return;
1378         }
1379
1380         fprintf(out, "%*s", indent, "");
1381         fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1382                         "flags: %x, n_name: %d\n",
1383                 bmap->ref,
1384                 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1385                 bmap->extra, bmap->flags, bmap->dim->n_name);
1386         dump(bmap, out, indent);
1387 }
1388
1389 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1390 {
1391         unsigned total;
1392         if (!bmap)
1393                 return -1;
1394         total = isl_basic_map_total_dim(bmap);
1395         isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1396         isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1397         isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1398         ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1399         return 0;
1400 }
1401
1402 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1403 {
1404         struct isl_set *set;
1405
1406         if (!dim)
1407                 return NULL;
1408         isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1409         isl_assert(dim->ctx, n >= 0, return NULL);
1410         set = isl_alloc(dim->ctx, struct isl_set,
1411                         sizeof(struct isl_set) +
1412                         n * sizeof(struct isl_basic_set *));
1413         if (!set)
1414                 goto error;
1415
1416         set->ctx = dim->ctx;
1417         isl_ctx_ref(set->ctx);
1418         set->ref = 1;
1419         set->size = n;
1420         set->n = 0;
1421         set->dim = dim;
1422         set->flags = flags;
1423         return set;
1424 error:
1425         isl_dim_free(dim);
1426         return NULL;
1427 }
1428
1429 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1430                 unsigned nparam, unsigned dim, int n, unsigned flags)
1431 {
1432         struct isl_set *set;
1433         struct isl_dim *dims;
1434
1435         dims = isl_dim_alloc(ctx, nparam, 0, dim);
1436         if (!dims)
1437                 return NULL;
1438
1439         set = isl_set_alloc_dim(dims, n, flags);
1440         return set;
1441 }
1442
1443 /* Make sure "map" has room for at least "n" more basic maps.
1444  */
1445 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1446 {
1447         int i;
1448         struct isl_map *grown = NULL;
1449
1450         if (!map)
1451                 return NULL;
1452         isl_assert(map->ctx, n >= 0, goto error);
1453         if (map->n + n <= map->size)
1454                 return map;
1455         grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1456         if (!grown)
1457                 goto error;
1458         for (i = 0; i < map->n; ++i) {
1459                 grown->p[i] = isl_basic_map_copy(map->p[i]);
1460                 if (!grown->p[i])
1461                         goto error;
1462                 grown->n++;
1463         }
1464         isl_map_free(map);
1465         return grown;
1466 error:
1467         isl_map_free(grown);
1468         isl_map_free(map);
1469         return NULL;
1470 }
1471
1472 /* Make sure "set" has room for at least "n" more basic sets.
1473  */
1474 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1475 {
1476         return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1477 }
1478
1479 struct isl_set *isl_set_dup(struct isl_set *set)
1480 {
1481         int i;
1482         struct isl_set *dup;
1483
1484         if (!set)
1485                 return NULL;
1486
1487         dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1488         if (!dup)
1489                 return NULL;
1490         for (i = 0; i < set->n; ++i)
1491                 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1492         return dup;
1493 }
1494
1495 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1496 {
1497         struct isl_set *set;
1498
1499         if (!bset)
1500                 return NULL;
1501
1502         set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1503         if (!set) {
1504                 isl_basic_set_free(bset);
1505                 return NULL;
1506         }
1507         return isl_set_add(set, bset);
1508 }
1509
1510 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1511 {
1512         struct isl_map *map;
1513
1514         if (!bmap)
1515                 return NULL;
1516
1517         map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1518         if (!map) {
1519                 isl_basic_map_free(bmap);
1520                 return NULL;
1521         }
1522         return isl_map_add(map, bmap);
1523 }
1524
1525 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1526 {
1527         if (!bset || !set)
1528                 goto error;
1529         isl_assert(set->ctx, isl_dim_equal(set->dim, bset->dim), goto error);
1530         isl_assert(set->ctx, set->n < set->size, goto error);
1531         set->p[set->n] = bset;
1532         set->n++;
1533         return set;
1534 error:
1535         if (set)
1536                 isl_set_free(set);
1537         if (bset)
1538                 isl_basic_set_free(bset);
1539         return NULL;
1540 }
1541
1542 void isl_set_free(struct isl_set *set)
1543 {
1544         int i;
1545
1546         if (!set)
1547                 return;
1548
1549         if (--set->ref > 0)
1550                 return;
1551
1552         isl_ctx_deref(set->ctx);
1553         for (i = 0; i < set->n; ++i)
1554                 isl_basic_set_free(set->p[i]);
1555         isl_dim_free(set->dim);
1556         free(set);
1557 }
1558
1559 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1560 {
1561         int i;
1562
1563         if (!set) {
1564                 fprintf(out, "null set\n");
1565                 return;
1566         }
1567
1568         fprintf(out, "%*s", indent, "");
1569         fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1570                         set->ref, set->n, set->dim->nparam, set->dim->n_out,
1571                         set->flags);
1572         for (i = 0; i < set->n; ++i) {
1573                 fprintf(out, "%*s", indent, "");
1574                 fprintf(out, "basic set %d:\n", i);
1575                 isl_basic_set_dump(set->p[i], out, indent+4);
1576         }
1577 }
1578
1579 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1580 {
1581         int i;
1582
1583         if (!map) {
1584                 fprintf(out, "null map\n");
1585                 return;
1586         }
1587
1588         fprintf(out, "%*s", indent, "");
1589         fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1590                      "flags: %x, n_name: %d\n",
1591                         map->ref, map->n, map->dim->nparam, map->dim->n_in,
1592                         map->dim->n_out, map->flags, map->dim->n_name);
1593         for (i = 0; i < map->n; ++i) {
1594                 fprintf(out, "%*s", indent, "");
1595                 fprintf(out, "basic map %d:\n", i);
1596                 isl_basic_map_dump(map->p[i], out, indent+4);
1597         }
1598 }
1599
1600 struct isl_basic_map *isl_basic_map_intersect_domain(
1601                 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1602 {
1603         struct isl_basic_map *bmap_domain;
1604         struct isl_dim *dim;
1605
1606         if (!bmap || !bset)
1607                 goto error;
1608
1609         isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1610                                         bset->dim, isl_dim_param), goto error);
1611
1612         if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1613                 isl_assert(bset->ctx,
1614                     isl_basic_map_compatible_domain(bmap, bset), goto error);
1615
1616         bmap = isl_basic_map_cow(bmap);
1617         bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1618                         bset->n_div, bset->n_eq, bset->n_ineq);
1619         if (!bmap)
1620                 goto error;
1621         dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1622         bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1623         bmap = add_constraints(bmap, bmap_domain, 0, 0);
1624
1625         bmap = isl_basic_map_simplify(bmap);
1626         return isl_basic_map_finalize(bmap);
1627 error:
1628         isl_basic_map_free(bmap);
1629         isl_basic_set_free(bset);
1630         return NULL;
1631 }
1632
1633 struct isl_basic_map *isl_basic_map_intersect_range(
1634                 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1635 {
1636         struct isl_basic_map *bmap_range;
1637
1638         if (!bmap || !bset)
1639                 goto error;
1640
1641         isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1642                                         bset->dim, isl_dim_param), goto error);
1643
1644         if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1645                 isl_assert(bset->ctx,
1646                     isl_basic_map_compatible_range(bmap, bset), goto error);
1647
1648         bmap = isl_basic_map_cow(bmap);
1649         bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1650                         bset->n_div, bset->n_eq, bset->n_ineq);
1651         if (!bmap)
1652                 goto error;
1653         bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1654         bmap = add_constraints(bmap, bmap_range, 0, 0);
1655
1656         bmap = isl_basic_map_simplify(bmap);
1657         return isl_basic_map_finalize(bmap);
1658 error:
1659         isl_basic_map_free(bmap);
1660         isl_basic_set_free(bset);
1661         return NULL;
1662 }
1663
1664 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1665 {
1666         int i;
1667         unsigned total;
1668         isl_int s;
1669
1670         total = 1 + isl_basic_map_total_dim(bmap);
1671         if (total != vec->size)
1672                 return -1;
1673
1674         isl_int_init(s);
1675
1676         for (i = 0; i < bmap->n_eq; ++i) {
1677                 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1678                 if (!isl_int_is_zero(s)) {
1679                         isl_int_clear(s);
1680                         return 0;
1681                 }
1682         }
1683
1684         for (i = 0; i < bmap->n_ineq; ++i) {
1685                 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1686                 if (isl_int_is_neg(s)) {
1687                         isl_int_clear(s);
1688                         return 0;
1689                 }
1690         }
1691
1692         isl_int_clear(s);
1693
1694         return 1;
1695 }
1696
1697 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1698 {
1699         return basic_map_contains((struct isl_basic_map *)bset, vec);
1700 }
1701
1702 struct isl_basic_map *isl_basic_map_intersect(
1703                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1704 {
1705         struct isl_vec *sample = NULL;
1706
1707         if (!bmap1 || !bmap2)
1708                 goto error;
1709
1710         isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1711                                      bmap2->dim, isl_dim_param), goto error);
1712         if (isl_dim_total(bmap1->dim) ==
1713                                 isl_dim_size(bmap1->dim, isl_dim_param) &&
1714             isl_dim_total(bmap2->dim) !=
1715                                 isl_dim_size(bmap2->dim, isl_dim_param))
1716                 return isl_basic_map_intersect(bmap2, bmap1);
1717
1718         if (isl_dim_total(bmap2->dim) !=
1719                                         isl_dim_size(bmap2->dim, isl_dim_param))
1720                 isl_assert(bmap1->ctx,
1721                             isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1722
1723         if (bmap1->sample &&
1724             basic_map_contains(bmap1, bmap1->sample) > 0 &&
1725             basic_map_contains(bmap2, bmap1->sample) > 0)
1726                 sample = isl_vec_copy(bmap1->sample);
1727         else if (bmap2->sample &&
1728             basic_map_contains(bmap1, bmap2->sample) > 0 &&
1729             basic_map_contains(bmap2, bmap2->sample) > 0)
1730                 sample = isl_vec_copy(bmap2->sample);
1731
1732         bmap1 = isl_basic_map_cow(bmap1);
1733         bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1734                         bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1735         if (!bmap1)
1736                 goto error;
1737         bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1738
1739         if (sample) {
1740                 isl_vec_free(bmap1->sample);
1741                 bmap1->sample = sample;
1742         }
1743
1744         bmap1 = isl_basic_map_simplify(bmap1);
1745         return isl_basic_map_finalize(bmap1);
1746 error:
1747         if (sample)
1748                 isl_vec_free(sample);
1749         isl_basic_map_free(bmap1);
1750         isl_basic_map_free(bmap2);
1751         return NULL;
1752 }
1753
1754 struct isl_basic_set *isl_basic_set_intersect(
1755                 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1756 {
1757         return (struct isl_basic_set *)
1758                 isl_basic_map_intersect(
1759                         (struct isl_basic_map *)bset1,
1760                         (struct isl_basic_map *)bset2);
1761 }
1762
1763 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1764 {
1765         unsigned flags = 0;
1766         struct isl_map *result;
1767         int i, j;
1768
1769         if (!map1 || !map2)
1770                 goto error;
1771
1772         isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1773                                          map2->dim, isl_dim_param), goto error);
1774         if (isl_dim_total(map1->dim) ==
1775                                 isl_dim_size(map1->dim, isl_dim_param) &&
1776             isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1777                 return isl_map_intersect(map2, map1);
1778
1779         if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1780                 isl_assert(map1->ctx,
1781                             isl_dim_equal(map1->dim, map2->dim), goto error);
1782
1783         if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1784             ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1785                 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1786
1787         result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1788                                 map1->n * map2->n, flags);
1789         if (!result)
1790                 goto error;
1791         for (i = 0; i < map1->n; ++i)
1792                 for (j = 0; j < map2->n; ++j) {
1793                         struct isl_basic_map *part;
1794                         part = isl_basic_map_intersect(
1795                                     isl_basic_map_copy(map1->p[i]),
1796                                     isl_basic_map_copy(map2->p[j]));
1797                         if (isl_basic_map_is_empty(part))
1798                                 isl_basic_map_free(part);
1799                         else
1800                                 result = isl_map_add(result, part);
1801                         if (!result)
1802                                 goto error;
1803                 }
1804         isl_map_free(map1);
1805         isl_map_free(map2);
1806         return result;
1807 error:
1808         isl_map_free(map1);
1809         isl_map_free(map2);
1810         return NULL;
1811 }
1812
1813 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1814 {
1815         return (struct isl_set *)
1816                 isl_map_intersect((struct isl_map *)set1,
1817                                   (struct isl_map *)set2);
1818 }
1819
1820 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1821 {
1822         struct isl_dim *dim;
1823         struct isl_basic_set *bset;
1824         unsigned in;
1825
1826         if (!bmap)
1827                 return NULL;
1828         bmap = isl_basic_map_cow(bmap);
1829         if (!bmap)
1830                 return NULL;
1831         dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1832         in = isl_basic_map_n_in(bmap);
1833         bset = isl_basic_set_from_basic_map(bmap);
1834         bset = isl_basic_set_swap_vars(bset, in);
1835         return isl_basic_map_from_basic_set(bset, dim);
1836 }
1837
1838 /* Turn final n dimensions into existentially quantified variables.
1839  */
1840 struct isl_basic_set *isl_basic_set_project_out(
1841                 struct isl_basic_set *bset, unsigned n, unsigned flags)
1842 {
1843         int i;
1844         size_t row_size;
1845         isl_int **new_div;
1846         isl_int *old;
1847
1848         if (!bset)
1849                 return NULL;
1850
1851         isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
1852
1853         if (n == 0)
1854                 return bset;
1855
1856         bset = isl_basic_set_cow(bset);
1857
1858         row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1859         old = bset->block2.data;
1860         bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1861                                         (bset->extra + n) * (1 + row_size));
1862         if (!bset->block2.data)
1863                 goto error;
1864         new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1865         if (!new_div)
1866                 goto error;
1867         for (i = 0; i < n; ++i) {
1868                 new_div[i] = bset->block2.data +
1869                                 (bset->extra + i) * (1 + row_size);
1870                 isl_seq_clr(new_div[i], 1 + row_size);
1871         }
1872         for (i = 0; i < bset->extra; ++i)
1873                 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1874         free(bset->div);
1875         bset->div = new_div;
1876         bset->n_div += n;
1877         bset->extra += n;
1878         bset->dim = isl_dim_drop_outputs(bset->dim,
1879                                             isl_basic_set_n_dim(bset) - n, n);
1880         if (!bset->dim)
1881                 goto error;
1882         bset = isl_basic_set_simplify(bset);
1883         return isl_basic_set_finalize(bset);
1884 error:
1885         isl_basic_set_free(bset);
1886         return NULL;
1887 }
1888
1889 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1890 {
1891         int i, j;
1892
1893         for (i = 0; i < n; ++i) {
1894                 j = isl_basic_map_alloc_div(bmap);
1895                 if (j < 0)
1896                         goto error;
1897                 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1898         }
1899         return bmap;
1900 error:
1901         isl_basic_map_free(bmap);
1902         return NULL;
1903 }
1904
1905 struct isl_basic_map *isl_basic_map_apply_range(
1906                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1907 {
1908         struct isl_dim *dim_result = NULL;
1909         struct isl_basic_map *bmap;
1910         unsigned n_in, n_out, n, nparam, total, pos;
1911         struct isl_dim_map *dim_map1, *dim_map2;
1912
1913         if (!bmap1 || !bmap2)
1914                 goto error;
1915
1916         dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1917                                   isl_dim_copy(bmap2->dim));
1918
1919         n_in = isl_basic_map_n_in(bmap1);
1920         n_out = isl_basic_map_n_out(bmap2);
1921         n = isl_basic_map_n_out(bmap1);
1922         nparam = isl_basic_map_n_param(bmap1);
1923
1924         total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1925         dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1926         dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
1927         isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1928         isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
1929         isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1930         isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
1931         isl_dim_map_div(dim_map1, bmap1, pos += n_out);
1932         isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1933         isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1934         isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1935
1936         bmap = isl_basic_map_alloc_dim(dim_result,
1937                         bmap1->n_div + bmap2->n_div + n,
1938                         bmap1->n_eq + bmap2->n_eq,
1939                         bmap1->n_ineq + bmap2->n_ineq);
1940         bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1941         bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1942         bmap = add_divs(bmap, n);
1943         bmap = isl_basic_map_simplify(bmap);
1944         return isl_basic_map_finalize(bmap);
1945 error:
1946         isl_basic_map_free(bmap1);
1947         isl_basic_map_free(bmap2);
1948         return NULL;
1949 }
1950
1951 struct isl_basic_set *isl_basic_set_apply(
1952                 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1953 {
1954         if (!bset || !bmap)
1955                 goto error;
1956
1957         isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
1958                     goto error);
1959
1960         return (struct isl_basic_set *)
1961                 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1962 error:
1963         isl_basic_set_free(bset);
1964         isl_basic_map_free(bmap);
1965         return NULL;
1966 }
1967
1968 struct isl_basic_map *isl_basic_map_apply_domain(
1969                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1970 {
1971         if (!bmap1 || !bmap2)
1972                 goto error;
1973
1974         isl_assert(ctx,
1975             isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
1976         isl_assert(ctx,
1977             isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
1978             goto error);
1979
1980         bmap1 = isl_basic_map_reverse(bmap1);
1981         bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1982         return isl_basic_map_reverse(bmap1);
1983 error:
1984         isl_basic_map_free(bmap1);
1985         isl_basic_map_free(bmap2);
1986         return NULL;
1987 }
1988
1989 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1990  * A \cap B -> f(A) + f(B)
1991  */
1992 struct isl_basic_map *isl_basic_map_sum(
1993                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1994 {
1995         unsigned n_in, n_out, nparam, total, pos;
1996         struct isl_basic_map *bmap = NULL;
1997         struct isl_dim_map *dim_map1, *dim_map2;
1998         int i;
1999
2000         if (!bmap1 || !bmap2)
2001                 goto error;
2002
2003         isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2004                 goto error);
2005
2006         nparam = isl_basic_map_n_param(bmap1);
2007         n_in = isl_basic_map_n_in(bmap1);
2008         n_out = isl_basic_map_n_out(bmap1);
2009
2010         total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2011         dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2012         dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2013         isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2014         isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2015         isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2016         isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2017         isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2018         isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2019         isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2020         isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2021
2022         bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2023                         bmap1->n_div + bmap2->n_div + 2 * n_out,
2024                         bmap1->n_eq + bmap2->n_eq + n_out,
2025                         bmap1->n_ineq + bmap2->n_ineq);
2026         for (i = 0; i < n_out; ++i) {
2027                 int j = isl_basic_map_alloc_equality(bmap);
2028                 if (j < 0)
2029                         goto error;
2030                 isl_seq_clr(bmap->eq[j], 1+total);
2031                 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2032                 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2033                 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2034         }
2035         bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2036         bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2037         bmap = add_divs(bmap, 2 * n_out);
2038
2039         bmap = isl_basic_map_simplify(bmap);
2040         return isl_basic_map_finalize(bmap);
2041 error:
2042         isl_basic_map_free(bmap);
2043         isl_basic_map_free(bmap1);
2044         isl_basic_map_free(bmap2);
2045         return NULL;
2046 }
2047
2048 /* Given a basic map A -> f(A), construct A -> -f(A).
2049  */
2050 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2051 {
2052         int i, j;
2053         unsigned off, n;
2054
2055         bmap = isl_basic_map_cow(bmap);
2056         if (!bmap)
2057                 return NULL;
2058
2059         n = isl_basic_map_dim(bmap, isl_dim_out);
2060         off = isl_basic_map_offset(bmap, isl_dim_out);
2061         for (i = 0; i < bmap->n_eq; ++i)
2062                 for (j = 0; j < n; ++j)
2063                         isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2064         for (i = 0; i < bmap->n_ineq; ++i)
2065                 for (j = 0; j < n; ++j)
2066                         isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2067         for (i = 0; i < bmap->n_div; ++i)
2068                 for (j = 0; j < n; ++j)
2069                         isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2070         return isl_basic_map_finalize(bmap);
2071 }
2072
2073 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2074  * A -> floor(f(A)/d).
2075  */
2076 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2077                 isl_int d)
2078 {
2079         unsigned n_in, n_out, nparam, total, pos;
2080         struct isl_basic_map *result = NULL;
2081         struct isl_dim_map *dim_map;
2082         int i;
2083
2084         if (!bmap)
2085                 return NULL;
2086
2087         nparam = isl_basic_map_n_param(bmap);
2088         n_in = isl_basic_map_n_in(bmap);
2089         n_out = isl_basic_map_n_out(bmap);
2090
2091         total = nparam + n_in + n_out + bmap->n_div + n_out;
2092         dim_map = isl_dim_map_alloc(bmap->ctx, total);
2093         isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2094         isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2095         isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2096         isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2097
2098         result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2099                         bmap->n_div + n_out,
2100                         bmap->n_eq, bmap->n_ineq + 2 * n_out);
2101         result = add_constraints_dim_map(result, bmap, dim_map);
2102         result = add_divs(result, n_out);
2103         for (i = 0; i < n_out; ++i) {
2104                 int j;
2105                 j = isl_basic_map_alloc_inequality(result);
2106                 if (j < 0)
2107                         goto error;
2108                 isl_seq_clr(result->ineq[j], 1+total);
2109                 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2110                 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2111                 j = isl_basic_map_alloc_inequality(result);
2112                 if (j < 0)
2113                         goto error;
2114                 isl_seq_clr(result->ineq[j], 1+total);
2115                 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2116                 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2117                 isl_int_sub_ui(result->ineq[j][0], d, 1);
2118         }
2119
2120         result = isl_basic_map_simplify(result);
2121         return isl_basic_map_finalize(result);
2122 error:
2123         isl_basic_map_free(result);
2124         return NULL;
2125 }
2126
2127 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2128 {
2129         int i;
2130         unsigned nparam;
2131         unsigned n_in;
2132
2133         i = isl_basic_map_alloc_equality(bmap);
2134         if (i < 0)
2135                 goto error;
2136         nparam = isl_basic_map_n_param(bmap);
2137         n_in = isl_basic_map_n_in(bmap);
2138         isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2139         isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2140         isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2141         return isl_basic_map_finalize(bmap);
2142 error:
2143         isl_basic_map_free(bmap);
2144         return NULL;
2145 }
2146
2147 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2148 {
2149         int i;
2150         unsigned nparam;
2151         unsigned n_in;
2152
2153         i = isl_basic_map_alloc_inequality(bmap);
2154         if (i < 0)
2155                 goto error;
2156         nparam = isl_basic_map_n_param(bmap);
2157         n_in = isl_basic_map_n_in(bmap);
2158         isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2159         isl_int_set_si(bmap->ineq[i][0], -1);
2160         isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2161         isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2162         return isl_basic_map_finalize(bmap);
2163 error:
2164         isl_basic_map_free(bmap);
2165         return NULL;
2166 }
2167
2168 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2169 {
2170         int i;
2171         unsigned nparam;
2172         unsigned n_in;
2173
2174         i = isl_basic_map_alloc_inequality(bmap);
2175         if (i < 0)
2176                 goto error;
2177         nparam = isl_basic_map_n_param(bmap);
2178         n_in = isl_basic_map_n_in(bmap);
2179         isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2180         isl_int_set_si(bmap->ineq[i][0], -1);
2181         isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2182         isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2183         return isl_basic_map_finalize(bmap);
2184 error:
2185         isl_basic_map_free(bmap);
2186         return NULL;
2187 }
2188
2189 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2190 {
2191         int i;
2192         struct isl_basic_map *bmap;
2193         bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2194         if (!bmap)
2195                 return NULL;
2196         for (i = 0; i < n_equal && bmap; ++i)
2197                 bmap = var_equal(bmap, i);
2198         return isl_basic_map_finalize(bmap);
2199 }
2200
2201 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2202 {
2203         int i;
2204         struct isl_basic_map *bmap;
2205         bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2206         if (!bmap)
2207                 return NULL;
2208         for (i = 0; i < pos && bmap; ++i)
2209                 bmap = var_equal(bmap, i);
2210         if (bmap)
2211                 bmap = var_less(bmap, pos);
2212         return isl_basic_map_finalize(bmap);
2213 }
2214
2215 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2216 {
2217         int i;
2218         struct isl_basic_map *bmap;
2219         bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2220         if (!bmap)
2221                 return NULL;
2222         for (i = 0; i < pos && bmap; ++i)
2223                 bmap = var_equal(bmap, i);
2224         if (bmap)
2225                 bmap = var_more(bmap, pos);
2226         return isl_basic_map_finalize(bmap);
2227 }
2228
2229 struct isl_basic_map *isl_basic_map_from_basic_set(
2230                 struct isl_basic_set *bset, struct isl_dim *dim)
2231 {
2232         struct isl_basic_map *bmap;
2233
2234         bset = isl_basic_set_cow(bset);
2235         if (!bset || !dim)
2236                 goto error;
2237
2238         isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2239         isl_dim_free(bset->dim);
2240         bmap = (struct isl_basic_map *) bset;
2241         bmap->dim = dim;
2242         return isl_basic_map_finalize(bmap);
2243 error:
2244         isl_basic_set_free(bset);
2245         isl_dim_free(dim);
2246         return NULL;
2247 }
2248
2249 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2250 {
2251         if (!bmap)
2252                 goto error;
2253         if (bmap->dim->n_in == 0)
2254                 return (struct isl_basic_set *)bmap;
2255         bmap = isl_basic_map_cow(bmap);
2256         if (!bmap)
2257                 goto error;
2258         bmap->dim = isl_dim_cow(bmap->dim);
2259         if (!bmap->dim)
2260                 goto error;
2261         bmap->dim->n_out += bmap->dim->n_in;
2262         bmap->dim->n_in = 0;
2263         bmap = isl_basic_map_finalize(bmap);
2264         return (struct isl_basic_set *)bmap;
2265 error:
2266         isl_basic_map_free(bmap);
2267         return NULL;
2268 }
2269
2270 /* For a div d = floor(f/m), add the constraints
2271  *
2272  *              f - m d >= 0
2273  *              -(f-(n-1)) + m d >= 0
2274  *
2275  * Note that the second constraint is the negation of
2276  *
2277  *              f - m d >= n
2278  */
2279 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2280 {
2281         int i, j;
2282         unsigned total = isl_basic_map_total_dim(bmap);
2283         unsigned div_pos = 1 + total - bmap->n_div + div;
2284
2285         i = isl_basic_map_alloc_inequality(bmap);
2286         if (i < 0)
2287                 return -1;
2288         isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2289         isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2290
2291         j = isl_basic_map_alloc_inequality(bmap);
2292         if (j < 0)
2293                 return -1;
2294         isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2295         isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2296         isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2297         return j;
2298 }
2299
2300 struct isl_basic_set *isl_basic_map_underlying_set(
2301                 struct isl_basic_map *bmap)
2302 {
2303         if (!bmap)
2304                 goto error;
2305         if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2306                 return (struct isl_basic_set *)bmap;
2307         bmap = isl_basic_map_cow(bmap);
2308         if (!bmap)
2309                 goto error;
2310         bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2311         if (!bmap->dim)
2312                 goto error;
2313         bmap->extra -= bmap->n_div;
2314         bmap->n_div = 0;
2315         bmap = isl_basic_map_finalize(bmap);
2316         return (struct isl_basic_set *)bmap;
2317 error:
2318         return NULL;
2319 }
2320
2321 struct isl_basic_map *isl_basic_map_overlying_set(
2322         struct isl_basic_set *bset, struct isl_basic_map *like)
2323 {
2324         struct isl_basic_map *bmap;
2325         struct isl_ctx *ctx;
2326         unsigned total;
2327         int i;
2328
2329         if (!bset || !like)
2330                 goto error;
2331         ctx = bset->ctx;
2332         isl_assert(ctx, bset->n_div == 0, goto error);
2333         isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2334         isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2335                         goto error);
2336         if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2337                 isl_basic_map_free(like);
2338                 return (struct isl_basic_map *)bset;
2339         }
2340         bset = isl_basic_set_cow(bset);
2341         if (!bset)
2342                 goto error;
2343         total = bset->dim->n_out + bset->extra;
2344         bmap = (struct isl_basic_map *)bset;
2345         isl_dim_free(bmap->dim);
2346         bmap->dim = isl_dim_copy(like->dim);
2347         if (!bmap->dim)
2348                 goto error;
2349         bmap->n_div = like->n_div;
2350         bmap->extra += like->n_div;
2351         if (bmap->extra) {
2352                 unsigned ltotal;
2353                 ltotal = total - bmap->extra + like->extra;
2354                 if (ltotal > total)
2355                         ltotal = total;
2356                 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2357                                         bmap->extra * (1 + 1 + total));
2358                 if (isl_blk_is_error(bmap->block2))
2359                         goto error;
2360                 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2361                                                 bmap->extra);
2362                 if (!bmap->div)
2363                         goto error;
2364                 for (i = 0; i < bmap->extra; ++i)
2365                         bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2366                 for (i = 0; i < like->n_div; ++i) {
2367                         isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2368                         isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2369                 }
2370                 bmap = isl_basic_map_extend_constraints(bmap, 
2371                                                         0, 2 * like->n_div);
2372                 for (i = 0; i < like->n_div; ++i) {
2373                         if (isl_int_is_zero(bmap->div[i][0]))
2374                                 continue;
2375                         if (add_div_constraints(bmap, i) < 0)
2376                                 goto error;
2377                 }
2378         }
2379         isl_basic_map_free(like);
2380         bmap = isl_basic_map_simplify(bmap);
2381         bmap = isl_basic_map_finalize(bmap);
2382         return bmap;
2383 error:
2384         isl_basic_map_free(like);
2385         isl_basic_set_free(bset);
2386         return NULL;
2387 }
2388
2389 struct isl_basic_set *isl_basic_set_from_underlying_set(
2390         struct isl_basic_set *bset, struct isl_basic_set *like)
2391 {
2392         return (struct isl_basic_set *)
2393                 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2394 }
2395
2396 struct isl_set *isl_set_from_underlying_set(
2397         struct isl_set *set, struct isl_basic_set *like)
2398 {
2399         int i;
2400
2401         if (!set || !like)
2402                 goto error;
2403         isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2404                     goto error);
2405         if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2406                 isl_basic_set_free(like);
2407                 return set;
2408         }
2409         set = isl_set_cow(set);
2410         if (!set)
2411                 goto error;
2412         for (i = 0; i < set->n; ++i) {
2413                 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2414                                                       isl_basic_set_copy(like));
2415                 if (!set->p[i])
2416                         goto error;
2417         }
2418         isl_dim_free(set->dim);
2419         set->dim = isl_dim_copy(like->dim);
2420         if (!set->dim)
2421                 goto error;
2422         isl_basic_set_free(like);
2423         return set;
2424 error:
2425         isl_basic_set_free(like);
2426         isl_set_free(set);
2427         return NULL;
2428 }
2429
2430 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2431 {
2432         int i;
2433
2434         map = isl_map_cow(map);
2435         if (!map)
2436                 return NULL;
2437         map->dim = isl_dim_cow(map->dim);
2438         if (!map->dim)
2439                 goto error;
2440
2441         for (i = 1; i < map->n; ++i)
2442                 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2443                                 goto error);
2444         for (i = 0; i < map->n; ++i) {
2445                 map->p[i] = (struct isl_basic_map *)
2446                                 isl_basic_map_underlying_set(map->p[i]);
2447                 if (!map->p[i])
2448                         goto error;
2449         }
2450         if (map->n == 0)
2451                 map->dim = isl_dim_underlying(map->dim, 0);
2452         else {
2453                 isl_dim_free(map->dim);
2454                 map->dim = isl_dim_copy(map->p[0]->dim);
2455         }
2456         if (!map->dim)
2457                 goto error;
2458         return (struct isl_set *)map;
2459 error:
2460         isl_map_free(map);
2461         return NULL;
2462 }
2463
2464 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2465 {
2466         return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2467 }
2468
2469 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2470 {
2471         struct isl_basic_set *domain;
2472         unsigned n_out;
2473         if (!bmap)
2474                 return NULL;
2475         n_out = isl_basic_map_n_out(bmap);
2476         domain = isl_basic_set_from_basic_map(bmap);
2477         return isl_basic_set_project_out(domain, n_out, 0);
2478 }
2479
2480 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2481 {
2482         return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2483 }
2484
2485 struct isl_set *isl_map_range(struct isl_map *map)
2486 {
2487         int i;
2488         struct isl_set *set;
2489
2490         if (!map)
2491                 goto error;
2492         map = isl_map_cow(map);
2493         if (!map)
2494                 goto error;
2495
2496         set = (struct isl_set *) map;
2497         if (set->dim->n_in != 0) {
2498                 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2499                 if (!set->dim)
2500                         goto error;
2501         }
2502         for (i = 0; i < map->n; ++i) {
2503                 set->p[i] = isl_basic_map_range(map->p[i]);
2504                 if (!set->p[i])
2505                         goto error;
2506         }
2507         ISL_F_CLR(set, ISL_MAP_DISJOINT);
2508         ISL_F_CLR(set, ISL_SET_NORMALIZED);
2509         return set;
2510 error:
2511         isl_map_free(map);
2512         return NULL;
2513 }
2514
2515 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2516 {
2517         int i;
2518         struct isl_map *map = NULL;
2519
2520         set = isl_set_cow(set);
2521         if (!set || !dim)
2522                 goto error;
2523         isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2524         map = (struct isl_map *)set;
2525         for (i = 0; i < set->n; ++i) {
2526                 map->p[i] = isl_basic_map_from_basic_set(
2527                                 set->p[i], isl_dim_copy(dim));
2528                 if (!map->p[i])
2529                         goto error;
2530         }
2531         isl_dim_free(map->dim);
2532         map->dim = dim;
2533         return map;
2534 error:
2535         isl_dim_free(dim);
2536         isl_set_free(set);
2537         return NULL;
2538 }
2539
2540 struct isl_map *isl_map_from_range(struct isl_set *set)
2541 {
2542         return (struct isl_map *)set;
2543 }
2544
2545 struct isl_set *isl_set_from_map(struct isl_map *map)
2546 {
2547         int i;
2548         struct isl_set *set = NULL;
2549
2550         if (!map)
2551                 return NULL;
2552         map = isl_map_cow(map);
2553         if (!map)
2554                 return NULL;
2555         map->dim = isl_dim_cow(map->dim);
2556         if (!map->dim)
2557                 goto error;
2558         map->dim->n_out += map->dim->n_in;
2559         map->dim->n_in = 0;
2560         set = (struct isl_set *)map;
2561         for (i = 0; i < map->n; ++i) {
2562                 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2563                 if (!set->p[i])
2564                         goto error;
2565         }
2566         return set;
2567 error:
2568         isl_map_free(map);
2569         return NULL;
2570 }
2571
2572 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2573 {
2574         struct isl_map *map;
2575
2576         if (!dim)
2577                 return NULL;
2578         isl_assert(dim->ctx, n >= 0, return NULL);
2579         map = isl_alloc(dim->ctx, struct isl_map,
2580                         sizeof(struct isl_map) +
2581                         n * sizeof(struct isl_basic_map *));
2582         if (!map)
2583                 goto error;
2584
2585         map->ctx = dim->ctx;
2586         isl_ctx_ref(map->ctx);
2587         map->ref = 1;
2588         map->size = n;
2589         map->n = 0;
2590         map->dim = dim;
2591         map->flags = flags;
2592         return map;
2593 error:
2594         isl_dim_free(dim);
2595         return NULL;
2596 }
2597
2598 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2599                 unsigned nparam, unsigned in, unsigned out, int n,
2600                 unsigned flags)
2601 {
2602         struct isl_map *map;
2603         struct isl_dim *dims;
2604
2605         dims = isl_dim_alloc(ctx, nparam, in, out);
2606         if (!dims)
2607                 return NULL;
2608
2609         map = isl_map_alloc_dim(dims, n, flags);
2610         return map;
2611 }
2612
2613 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2614                 unsigned nparam, unsigned in, unsigned out)
2615 {
2616         struct isl_basic_map *bmap;
2617         bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2618         bmap = isl_basic_map_set_to_empty(bmap);
2619         return bmap;
2620 }
2621
2622 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2623 {
2624         struct isl_basic_set *bset;
2625         bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2626         bset = isl_basic_set_set_to_empty(bset);
2627         return bset;
2628 }
2629
2630 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2631 {
2632         struct isl_basic_map *bmap;
2633         if (!model)
2634                 return NULL;
2635         bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2636         bmap = isl_basic_map_set_to_empty(bmap);
2637         return bmap;
2638 }
2639
2640 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2641 {
2642         struct isl_basic_map *bmap;
2643         if (!model)
2644                 return NULL;
2645         bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2646         bmap = isl_basic_map_set_to_empty(bmap);
2647         return bmap;
2648 }
2649
2650 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2651 {
2652         struct isl_basic_set *bset;
2653         if (!model)
2654                 return NULL;
2655         bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2656         bset = isl_basic_set_set_to_empty(bset);
2657         return bset;
2658 }
2659
2660 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2661 {
2662         struct isl_basic_map *bmap;
2663         bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2664         return bmap;
2665 }
2666
2667 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2668 {
2669         struct isl_basic_set *bset;
2670         bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2671         return bset;
2672 }
2673
2674 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2675 {
2676         if (!model)
2677                 return NULL;
2678         return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2679 }
2680
2681 struct isl_map *isl_map_empty(struct isl_dim *dim)
2682 {
2683         return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2684 }
2685
2686 struct isl_map *isl_map_empty_like(struct isl_map *model)
2687 {
2688         if (!model)
2689                 return NULL;
2690         return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2691 }
2692
2693 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2694 {
2695         if (!model)
2696                 return NULL;
2697         return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2698 }
2699
2700 struct isl_set *isl_set_empty(struct isl_dim *dim)
2701 {
2702         return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2703 }
2704
2705 struct isl_set *isl_set_empty_like(struct isl_set *model)
2706 {
2707         if (!model)
2708                 return NULL;
2709         return isl_set_empty(isl_dim_copy(model->dim));
2710 }
2711
2712 struct isl_map *isl_map_universe(struct isl_dim *dim)
2713 {
2714         struct isl_map *map;
2715         if (!dim)
2716                 return NULL;
2717         map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2718         map = isl_map_add(map, isl_basic_map_universe(dim));
2719         return map;
2720 }
2721
2722 struct isl_set *isl_set_universe(struct isl_dim *dim)
2723 {
2724         struct isl_set *set;
2725         if (!dim)
2726                 return NULL;
2727         set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2728         set = isl_set_add(set, isl_basic_set_universe(dim));
2729         return set;
2730 }
2731
2732 struct isl_map *isl_map_dup(struct isl_map *map)
2733 {
2734         int i;
2735         struct isl_map *dup;
2736
2737         if (!map)
2738                 return NULL;
2739         dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
2740         for (i = 0; i < map->n; ++i)
2741                 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2742         return dup;
2743 }
2744
2745 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2746 {
2747         if (!bmap || !map)
2748                 goto error;
2749         isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
2750         isl_assert(map->ctx, map->n < map->size, goto error);
2751         map->p[map->n] = bmap;
2752         map->n++;
2753         ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2754         return map;
2755 error:
2756         if (map)
2757                 isl_map_free(map);
2758         if (bmap)
2759                 isl_basic_map_free(bmap);
2760         return NULL;
2761 }
2762
2763 void isl_map_free(struct isl_map *map)
2764 {
2765         int i;
2766
2767         if (!map)
2768                 return;
2769
2770         if (--map->ref > 0)
2771                 return;
2772
2773         isl_ctx_deref(map->ctx);
2774         for (i = 0; i < map->n; ++i)
2775                 isl_basic_map_free(map->p[i]);
2776         isl_dim_free(map->dim);
2777         free(map);
2778 }
2779
2780 struct isl_map *isl_map_extend(struct isl_map *base,
2781                 unsigned nparam, unsigned n_in, unsigned n_out)
2782 {
2783         int i;
2784
2785         base = isl_map_cow(base);
2786         if (!base)
2787                 return NULL;
2788
2789         base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
2790         if (!base->dim)
2791                 goto error;
2792         for (i = 0; i < base->n; ++i) {
2793                 base->p[i] = isl_basic_map_extend_dim(base->p[i],
2794                                 isl_dim_copy(base->dim), 0, 0, 0);
2795                 if (!base->p[i])
2796                         goto error;
2797         }
2798         return base;
2799 error:
2800         isl_map_free(base);
2801         return NULL;
2802 }
2803
2804 struct isl_set *isl_set_extend(struct isl_set *base,
2805                 unsigned nparam, unsigned dim)
2806 {
2807         return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2808                                                         nparam, 0, dim);
2809 }
2810
2811 static struct isl_basic_map *isl_basic_map_fix_pos(struct isl_basic_map *bmap,
2812                 unsigned pos, int value)
2813 {
2814         int j;
2815
2816         bmap = isl_basic_map_cow(bmap);
2817         bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
2818         j = isl_basic_map_alloc_equality(bmap);
2819         if (j < 0)
2820                 goto error;
2821         isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
2822         isl_int_set_si(bmap->eq[j][pos], -1);
2823         isl_int_set_si(bmap->eq[j][0], value);
2824         bmap = isl_basic_map_simplify(bmap);
2825         return isl_basic_map_finalize(bmap);
2826 error:
2827         isl_basic_map_free(bmap);
2828         return NULL;
2829 }
2830
2831 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
2832                 enum isl_dim_type type, unsigned pos, int value)
2833 {
2834         if (!bmap)
2835                 return NULL;
2836         isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
2837         return isl_basic_map_fix_pos(bmap, isl_basic_map_offset(bmap, type) + pos,
2838                                         value);
2839 error:
2840         isl_basic_map_free(bmap);
2841         return NULL;
2842 }
2843
2844 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
2845                 enum isl_dim_type type, unsigned pos, int value)
2846 {
2847         return (struct isl_basic_set *)
2848                 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2849                                         type, pos, value);
2850 }
2851
2852 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2853                 unsigned input, int value)
2854 {
2855         return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
2856 }
2857
2858 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2859                 unsigned dim, int value)
2860 {
2861         return (struct isl_basic_set *)
2862                 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2863                                         isl_dim_set, dim, value);
2864 }
2865
2866 struct isl_map *isl_map_fix_si(struct isl_map *map,
2867                 enum isl_dim_type type, unsigned pos, int value)
2868 {
2869         int i;
2870
2871         map = isl_map_cow(map);
2872         if (!map)
2873                 return NULL;
2874
2875         isl_assert(ctx, pos < isl_map_dim(map, type), goto error);
2876         for (i = 0; i < map->n; ++i) {
2877                 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
2878                 if (!map->p[i])
2879                         goto error;
2880         }
2881         ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2882         return map;
2883 error:
2884         isl_map_free(map);
2885         return NULL;
2886 }
2887
2888 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2889                 unsigned input, int value)
2890 {
2891         return isl_map_fix_si(map, isl_dim_in, input, value);
2892 }
2893
2894 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2895 {
2896         return (struct isl_set *)
2897                 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
2898 }
2899
2900 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2901         unsigned dim, isl_int value)
2902 {
2903         int j;
2904         unsigned nparam;
2905
2906         bset = isl_basic_set_cow(bset);
2907         bset = isl_basic_set_extend_constraints(bset, 0, 1);
2908         j = isl_basic_set_alloc_inequality(bset);
2909         if (j < 0)
2910                 goto error;
2911         isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
2912         isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
2913         isl_int_neg(bset->ineq[j][0], value);
2914         bset = isl_basic_set_simplify(bset);
2915         return isl_basic_set_finalize(bset);
2916 error:
2917         isl_basic_set_free(bset);
2918         return NULL;
2919 }
2920
2921 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2922                                         isl_int value)
2923 {
2924         int i;
2925
2926         set = isl_set_cow(set);
2927         if (!set)
2928                 return NULL;
2929
2930         isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
2931         for (i = 0; i < set->n; ++i) {
2932                 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2933                 if (!set->p[i])
2934                         goto error;
2935         }
2936         return set;
2937 error:
2938         isl_set_free(set);
2939         return NULL;
2940 }
2941
2942 struct isl_map *isl_map_reverse(struct isl_map *map)
2943 {
2944         int i;
2945         unsigned t;
2946
2947         map = isl_map_cow(map);
2948         if (!map)
2949                 return NULL;
2950
2951         map->dim = isl_dim_reverse(map->dim);
2952         if (!map->dim)
2953                 goto error;
2954         for (i = 0; i < map->n; ++i) {
2955                 map->p[i] = isl_basic_map_reverse(map->p[i]);
2956                 if (!map->p[i])
2957                         goto error;
2958         }
2959         ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2960         return map;
2961 error:
2962         isl_map_free(map);
2963         return NULL;
2964 }
2965
2966 struct isl_map *isl_basic_map_partial_lexmax(
2967                 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2968                 struct isl_set **empty)
2969 {
2970         return isl_pip_basic_map_lexmax(bmap, dom, empty);
2971 }
2972
2973 struct isl_map *isl_basic_map_partial_lexmin(
2974                 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2975                 struct isl_set **empty)
2976 {
2977         return isl_pip_basic_map_lexmin(bmap, dom, empty);
2978 }
2979
2980 struct isl_set *isl_basic_set_partial_lexmin(
2981                 struct isl_basic_set *bset, struct isl_basic_set *dom,
2982                 struct isl_set **empty)
2983 {
2984         return (struct isl_set *)
2985                 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
2986                         dom, empty);
2987 }
2988
2989 struct isl_set *isl_basic_set_partial_lexmax(
2990                 struct isl_basic_set *bset, struct isl_basic_set *dom,
2991                 struct isl_set **empty)
2992 {
2993         return (struct isl_set *)
2994                 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
2995                         dom, empty);
2996 }
2997
2998 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
2999 {
3000         struct isl_basic_map *bmap = NULL;
3001         struct isl_basic_set *dom = NULL;
3002         struct isl_map *min;
3003         struct isl_dim *param_dim;
3004
3005         if (!bset)
3006                 goto error;
3007         bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
3008         if (!bmap)
3009                 goto error;
3010         param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3011         dom = isl_basic_set_universe(param_dim);
3012         if (!dom)
3013                 goto error;
3014         min = isl_basic_map_partial_lexmin(bmap, dom, NULL);
3015         return isl_map_range(min);
3016 error:
3017         isl_basic_map_free(bmap);
3018         return NULL;
3019 }
3020
3021 /* If bmap contains any unknown divs, then compute explicit
3022  * expressions for them.  However, this computation may be
3023  * quite expensive, so first try to remove divs that aren't
3024  * strictly needed.
3025  */
3026 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3027 {
3028         int i;
3029         unsigned off;
3030
3031         if (!bmap)
3032                 return NULL;
3033         off = isl_dim_total(bmap->dim);
3034         for (i = 0; i < bmap->n_div; ++i) {
3035                 if (isl_int_is_zero(bmap->div[i][0]))
3036                         break;
3037                 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
3038                                 goto error);
3039         }
3040         if (i == bmap->n_div)
3041                 return isl_map_from_basic_map(bmap);
3042         bmap = isl_basic_map_drop_redundant_divs(bmap);
3043         if (!bmap)
3044                 goto error;
3045         for (i = 0; i < bmap->n_div; ++i)
3046                 if (isl_int_is_zero(bmap->div[i][0]))
3047                         break;
3048         if (i == bmap->n_div)
3049                 return isl_map_from_basic_map(bmap);
3050         struct isl_map *map = isl_pip_basic_map_compute_divs(bmap);
3051         return map;
3052 error:
3053         isl_basic_map_free(bmap);
3054         return NULL;
3055 }
3056
3057 struct isl_map *isl_map_compute_divs(struct isl_map *map)
3058 {
3059         int i;
3060         struct isl_map *res;
3061
3062         if (!map)
3063                 return NULL;
3064         if (map->n == 0)
3065                 return map;
3066         res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
3067         for (i = 1 ; i < map->n; ++i) {
3068                 struct isl_map *r2;
3069                 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
3070                 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3071                         res = isl_map_union_disjoint(res, r2);
3072                 else
3073                         res = isl_map_union(res, r2);
3074         }
3075         isl_map_free(map);
3076
3077         return res;
3078 }
3079
3080 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
3081 {
3082         return (struct isl_set *)
3083                 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
3084 }
3085
3086 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3087 {
3088         return (struct isl_set *)
3089                 isl_map_compute_divs((struct isl_map *)set);
3090 }
3091
3092 struct isl_set *isl_map_domain(struct isl_map *map)
3093 {
3094         int i;
3095         struct isl_set *set;
3096
3097         if (!map)
3098                 goto error;
3099
3100         map = isl_map_cow(map);
3101         if (!map)
3102                 return NULL;
3103
3104         set = (struct isl_set *)map;
3105         set->dim = isl_dim_domain(set->dim);
3106         if (!set->dim)
3107                 goto error;
3108         for (i = 0; i < map->n; ++i) {
3109                 set->p[i] = isl_basic_map_domain(map->p[i]);
3110                 if (!set->p[i])
3111                         goto error;
3112         }
3113         ISL_F_CLR(set, ISL_MAP_DISJOINT);
3114         ISL_F_CLR(set, ISL_SET_NORMALIZED);
3115         return set;
3116 error:
3117         isl_map_free(map);
3118         return NULL;
3119 }
3120
3121 struct isl_map *isl_map_union_disjoint(
3122                         struct isl_map *map1, struct isl_map *map2)
3123 {
3124         int i;
3125         unsigned flags = 0;
3126         struct isl_map *map = NULL;
3127
3128         if (!map1 || !map2)
3129                 goto error;
3130
3131         if (map1->n == 0) {
3132                 isl_map_free(map1);
3133                 return map2;
3134         }
3135         if (map2->n == 0) {
3136                 isl_map_free(map2);
3137                 return map1;
3138         }
3139
3140         isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3141
3142         if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
3143             ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
3144                 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3145
3146         map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3147                                 map1->n + map2->n, flags);
3148         if (!map)
3149                 goto error;
3150         for (i = 0; i < map1->n; ++i) {
3151                 map = isl_map_add(map,
3152                                   isl_basic_map_copy(map1->p[i]));
3153                 if (!map)
3154                         goto error;
3155         }
3156         for (i = 0; i < map2->n; ++i) {
3157                 map = isl_map_add(map,
3158                                   isl_basic_map_copy(map2->p[i]));
3159                 if (!map)
3160                         goto error;
3161         }
3162         isl_map_free(map1);
3163         isl_map_free(map2);
3164         return map;
3165 error:
3166         isl_map_free(map);
3167         isl_map_free(map1);
3168         isl_map_free(map2);
3169         return NULL;
3170 }
3171
3172 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3173 {
3174         map1 = isl_map_union_disjoint(map1, map2);
3175         if (!map1)
3176                 return NULL;
3177         if (map1->n > 1)
3178                 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
3179         return map1;
3180 }
3181
3182 struct isl_set *isl_set_union_disjoint(
3183                         struct isl_set *set1, struct isl_set *set2)
3184 {
3185         return (struct isl_set *)
3186                 isl_map_union_disjoint(
3187                         (struct isl_map *)set1, (struct isl_map *)set2);
3188 }
3189
3190 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3191 {
3192         return (struct isl_set *)
3193                 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3194 }
3195
3196 struct isl_map *isl_map_intersect_range(
3197                 struct isl_map *map, struct isl_set *set)
3198 {
3199         unsigned flags = 0;
3200         struct isl_map *result;
3201         int i, j;
3202
3203         if (!map || !set)
3204                 goto error;
3205
3206         if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
3207             ISL_F_ISSET(set, ISL_MAP_DISJOINT))
3208                 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3209
3210         result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3211                                         map->n * set->n, flags);
3212         if (!result)
3213                 goto error;
3214         for (i = 0; i < map->n; ++i)
3215                 for (j = 0; j < set->n; ++j) {
3216                         result = isl_map_add(result,
3217                             isl_basic_map_intersect_range(
3218                                 isl_basic_map_copy(map->p[i]),
3219                                 isl_basic_set_copy(set->p[j])));
3220                         if (!result)
3221                                 goto error;
3222                 }
3223         isl_map_free(map);
3224         isl_set_free(set);
3225         return result;
3226 error:
3227         isl_map_free(map);
3228         isl_set_free(set);
3229         return NULL;
3230 }
3231
3232 struct isl_map *isl_map_intersect_domain(
3233                 struct isl_map *map, struct isl_set *set)
3234 {
3235         return isl_map_reverse(
3236                 isl_map_intersect_range(isl_map_reverse(map), set));
3237 }
3238
3239 struct isl_map *isl_map_apply_domain(
3240                 struct isl_map *map1, struct isl_map *map2)
3241 {
3242         if (!map1 || !map2)
3243                 goto error;
3244         map1 = isl_map_reverse(map1);
3245         map1 = isl_map_apply_range(map1, map2);
3246         return isl_map_reverse(map1);
3247 error:
3248         isl_map_free(map1);
3249         isl_map_free(map2);
3250         return NULL;
3251 }
3252
3253 struct isl_map *isl_map_apply_range(
3254                 struct isl_map *map1, struct isl_map *map2)
3255 {
3256         struct isl_dim *dim_result;
3257         struct isl_map *result;
3258         int i, j;
3259         unsigned nparam;
3260         unsigned n_in;
3261         unsigned n_out;
3262
3263         if (!map1 || !map2)
3264                 goto error;
3265
3266         dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3267                                   isl_dim_copy(map2->dim));
3268
3269         result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3270         if (!result)
3271                 goto error;
3272         for (i = 0; i < map1->n; ++i)
3273                 for (j = 0; j < map2->n; ++j) {
3274                         result = isl_map_add(result,
3275                             isl_basic_map_apply_range(
3276                                 isl_basic_map_copy(map1->p[i]),
3277                                 isl_basic_map_copy(map2->p[j])));
3278                         if (!result)
3279                                 goto error;
3280                 }
3281         isl_map_free(map1);
3282         isl_map_free(map2);
3283         if (result && result->n <= 1)
3284                 ISL_F_SET(result, ISL_MAP_DISJOINT);
3285         return result;
3286 error:
3287         isl_map_free(map1);
3288         isl_map_free(map2);
3289         return NULL;
3290 }
3291
3292 /*
3293  * returns range - domain
3294  */
3295 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3296 {
3297         struct isl_basic_set *bset;
3298         unsigned dim;
3299         unsigned nparam;
3300         int i;
3301
3302         if (!bmap)
3303                 goto error;
3304         dim = isl_basic_map_n_in(bmap);
3305         nparam = isl_basic_map_n_param(bmap);
3306         isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3307         bset = isl_basic_set_from_basic_map(bmap);
3308         bset = isl_basic_set_cow(bset);
3309         bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3310         bset = isl_basic_set_swap_vars(bset, 2*dim);
3311         for (i = 0; i < dim; ++i) {
3312                 int j = isl_basic_map_alloc_equality(
3313                                             (struct isl_basic_map *)bset);
3314                 if (j < 0)
3315                         goto error;
3316                 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3317                 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3318                 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3319                 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3320         }
3321         return isl_basic_set_project_out(bset, 2*dim, 0);
3322 error:
3323         isl_basic_map_free(bmap);
3324         return NULL;
3325 }
3326
3327 /*
3328  * returns range - domain
3329  */
3330 struct isl_set *isl_map_deltas(struct isl_map *map)
3331 {
3332         int i;
3333         struct isl_set *result;
3334
3335         if (!map)
3336                 return NULL;
3337
3338         isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3339         result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3340                                         isl_map_n_in(map), map->n, map->flags);
3341         if (!result)
3342                 goto error;
3343         for (i = 0; i < map->n; ++i)
3344                 result = isl_set_add(result,
3345                           isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3346         isl_map_free(map);
3347         return result;
3348 error:
3349         isl_map_free(map);
3350         return NULL;
3351 }
3352
3353 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3354 {
3355         struct isl_basic_map *bmap;
3356         unsigned nparam;
3357         unsigned dim;
3358         int i;
3359
3360         if (!dims)
3361                 return NULL;
3362
3363         nparam = dims->nparam;
3364         dim = dims->n_out;
3365         bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3366         if (!bmap)
3367                 goto error;
3368
3369         for (i = 0; i < dim; ++i) {
3370                 int j = isl_basic_map_alloc_equality(bmap);
3371                 if (j < 0)
3372                         goto error;
3373                 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3374                 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3375                 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3376         }
3377         return isl_basic_map_finalize(bmap);
3378 error:
3379         isl_basic_map_free(bmap);
3380         return NULL;
3381 }
3382
3383 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3384 {
3385         struct isl_dim *dim = isl_dim_map(set_dim);
3386         if (!dim)
3387                 return NULL;
3388         return basic_map_identity(dim);
3389 }
3390
3391 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3392 {
3393         if (!model || !model->dim)
3394                 return NULL;
3395         isl_assert(model->ctx,
3396                         model->dim->n_in == model->dim->n_out, return NULL);
3397         return basic_map_identity(isl_dim_copy(model->dim));
3398 }
3399
3400 static struct isl_map *map_identity(struct isl_dim *dim)
3401 {
3402         struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3403         return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3404 }
3405
3406 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3407 {
3408         struct isl_dim *dim = isl_dim_map(set_dim);
3409         if (!dim)
3410                 return NULL;
3411         return map_identity(dim);
3412 }
3413
3414 struct isl_map *isl_map_identity_like(struct isl_basic_map *model)
3415 {
3416         if (!model || !model->dim)
3417                 return NULL;
3418         isl_assert(model->ctx,
3419                         model->dim->n_in == model->dim->n_out, return NULL);
3420         return map_identity(isl_dim_copy(model->dim));
3421 }
3422
3423 /* Construct a basic set with all set dimensions having only non-negative
3424  * values.
3425  */
3426 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
3427 {
3428         int i;
3429         unsigned nparam;
3430         unsigned dim;
3431         struct isl_basic_set *bset;
3432
3433         if (!dims)
3434                 return NULL;
3435         nparam = dims->nparam;
3436         dim = dims->n_out;
3437         bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
3438         if (!bset)
3439                 return NULL;
3440         for (i = 0; i < dim; ++i) {
3441                 int k = isl_basic_set_alloc_inequality(bset);
3442                 if (k < 0)
3443                         goto error;
3444                 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
3445                 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
3446         }
3447         return bset;
3448 error:
3449         isl_basic_set_free(bset);
3450         return NULL;
3451 }
3452
3453 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3454 {
3455         return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3456 }
3457
3458 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3459 {
3460         return isl_map_is_subset(
3461                         (struct isl_map *)set1, (struct isl_map *)set2);
3462 }
3463
3464 int isl_basic_map_is_subset(
3465                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3466 {
3467         int is_subset;
3468         struct isl_map *map1;
3469         struct isl_map *map2;
3470
3471         if (!bmap1 || !bmap2)
3472                 return -1;
3473
3474         map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3475         map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3476
3477         is_subset = isl_map_is_subset(map1, map2);
3478
3479         isl_map_free(map1);
3480         isl_map_free(map2);
3481
3482         return is_subset;
3483 }
3484
3485 int isl_basic_map_is_equal(
3486                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3487 {
3488         int is_subset;
3489
3490         if (!bmap1 || !bmap2)
3491                 return -1;
3492         is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3493         if (is_subset != 1)
3494                 return is_subset;
3495         is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3496         return is_subset;
3497 }
3498
3499 int isl_basic_set_is_equal(
3500                 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3501 {
3502         return isl_basic_map_is_equal(
3503                 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3504 }
3505
3506 int isl_map_is_empty(struct isl_map *map)
3507 {
3508         int i;
3509         int is_empty;
3510
3511         if (!map)
3512                 return -1;
3513         for (i = 0; i < map->n; ++i) {
3514                 is_empty = isl_basic_map_is_empty(map->p[i]);
3515                 if (is_empty < 0)
3516                         return -1;
3517                 if (!is_empty)
3518                         return 0;
3519         }
3520         return 1;
3521 }
3522
3523 int isl_map_fast_is_empty(struct isl_map *map)
3524 {
3525         return map->n == 0;
3526 }
3527
3528 int isl_set_is_empty(struct isl_set *set)
3529 {
3530         return isl_map_is_empty((struct isl_map *)set);
3531 }
3532
3533 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3534 {
3535         int i;
3536         int is_subset = 0;
3537         struct isl_map *diff;
3538
3539         if (!map1 || !map2)
3540                 return -1;
3541
3542         if (isl_map_is_empty(map1))
3543                 return 1;
3544
3545         if (isl_map_is_empty(map2))
3546                 return 0;
3547
3548         diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3549         if (!diff)
3550                 return -1;
3551
3552         is_subset = isl_map_is_empty(diff);
3553         isl_map_free(diff);
3554
3555         return is_subset;
3556 }
3557
3558 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3559 {
3560         int is_subset;
3561
3562         if (!map1 || !map2)
3563                 return -1;
3564         is_subset = isl_map_is_subset(map1, map2);
3565         if (is_subset != 1)
3566                 return is_subset;
3567         is_subset = isl_map_is_subset(map2, map1);
3568         return is_subset;
3569 }
3570
3571 int isl_basic_map_is_strict_subset(
3572                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3573 {
3574         int is_subset;
3575
3576         if (!bmap1 || !bmap2)
3577                 return -1;
3578         is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3579         if (is_subset != 1)
3580                 return is_subset;
3581         is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3582         if (is_subset == -1)
3583                 return is_subset;
3584         return !is_subset;
3585 }
3586
3587 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3588 {
3589         if (!bmap)
3590                 return -1;
3591         return bmap->n_eq == 0 && bmap->n_ineq == 0;
3592 }
3593
3594 int isl_basic_set_is_universe(struct isl_basic_set *bset)
3595 {
3596         if (!bset)
3597                 return -1;
3598         return bset->n_eq == 0 && bset->n_ineq == 0;
3599 }
3600
3601 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3602 {
3603         struct isl_basic_set *bset = NULL;
3604         struct isl_vec *sample = NULL;
3605         int empty;
3606         unsigned total;
3607
3608         if (!bmap)
3609                 return -1;
3610
3611         if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3612                 return 1;
3613
3614         if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3615                 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3616                 copy = isl_basic_map_convex_hull(copy);
3617                 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3618                 isl_basic_map_free(copy);
3619                 return empty;
3620         }
3621
3622         total = 1 + isl_basic_map_total_dim(bmap);
3623         if (bmap->sample && bmap->sample->size == total) {
3624                 int contains = basic_map_contains(bmap, bmap->sample);
3625                 if (contains < 0)
3626                         return -1;
3627                 if (contains)
3628                         return 0;
3629         }
3630         isl_vec_free(bmap->sample);
3631         bmap->sample = NULL;
3632         bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3633         if (!bset)
3634                 return -1;
3635         sample = isl_basic_set_sample(bset);
3636         if (!sample)
3637                 return -1;
3638         empty = sample->size == 0;
3639         isl_vec_free(bmap->sample);
3640         bmap->sample = sample;
3641         if (empty)
3642                 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
3643
3644         return empty;
3645 }
3646
3647 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
3648 {
3649         if (!bmap)
3650                 return -1;
3651         return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
3652 }
3653
3654 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
3655 {
3656         if (!bset)
3657                 return -1;
3658         return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
3659 }
3660
3661 int isl_basic_set_is_empty(struct isl_basic_set *bset)
3662 {
3663         return isl_basic_map_is_empty((struct isl_basic_map *)bset);
3664 }
3665
3666 struct isl_map *isl_basic_map_union(
3667         struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3668 {
3669         struct isl_map *map;
3670         if (!bmap1 || !bmap2)
3671                 return NULL;
3672
3673         isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
3674
3675         map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
3676         if (!map)
3677                 goto error;
3678         map = isl_map_add(map, bmap1);
3679         map = isl_map_add(map, bmap2);
3680         return map;
3681 error:
3682         isl_basic_map_free(bmap1);
3683         isl_basic_map_free(bmap2);
3684         return NULL;
3685 }
3686
3687 struct isl_set *isl_basic_set_union(
3688                 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3689 {
3690         return (struct isl_set *)isl_basic_map_union(
3691                                             (struct isl_basic_map *)bset1,
3692                                             (struct isl_basic_map *)bset2);
3693 }
3694
3695 /* Order divs such that any div only depends on previous divs */
3696 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
3697 {
3698         int i;
3699         unsigned off = isl_dim_total(bmap->dim);
3700
3701         for (i = 0; i < bmap->n_div; ++i) {
3702                 int pos;
3703                 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
3704                                                             bmap->n_div-i);
3705                 if (pos == -1)
3706                         continue;
3707                 swap_div(bmap, i, i + pos);
3708                 --i;
3709         }
3710         return bmap;
3711 }
3712
3713 /* Look for a div in dst that corresponds to the div "div" in src.
3714  * The divs before "div" in src and dst are assumed to be the same.
3715  * 
3716  * Returns -1 if no corresponding div was found and the position
3717  * of the corresponding div in dst otherwise.
3718  */
3719 static int find_div(struct isl_basic_map *dst,
3720                         struct isl_basic_map *src, unsigned div)
3721 {
3722         int i;
3723
3724         unsigned total = isl_dim_total(src->dim);
3725
3726         isl_assert(dst->ctx, div <= dst->n_div, return -1);
3727         for (i = div; i < dst->n_div; ++i)
3728                 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
3729                     isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
3730                                                 dst->n_div - div) == -1)
3731                         return i;
3732         return -1;
3733 }
3734
3735 struct isl_basic_map *isl_basic_map_align_divs(
3736                 struct isl_basic_map *dst, struct isl_basic_map *src)
3737 {
3738         int i;
3739         unsigned total = isl_dim_total(src->dim);
3740
3741         if (!dst || !src)
3742                 goto error;
3743
3744         if (src->n_div == 0)
3745                 return dst;
3746
3747         for (i = 0; i < src->n_div; ++i)
3748                 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
3749
3750         src = order_divs(src);
3751         dst = isl_basic_map_cow(dst);
3752         dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
3753                         src->n_div, 0, 2 * src->n_div);
3754         if (!dst)
3755                 return NULL;
3756         for (i = 0; i < src->n_div; ++i) {
3757                 int j = find_div(dst, src, i);
3758                 if (j < 0) {
3759                         j = isl_basic_map_alloc_div(dst);
3760                         if (j < 0)
3761                                 goto error;
3762                         isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
3763                         isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
3764                         if (add_div_constraints(dst, j) < 0)
3765                                 goto error;
3766                 }
3767                 if (j != i)
3768                         swap_div(dst, i, j);
3769         }
3770         return dst;
3771 error:
3772         isl_basic_map_free(dst);
3773         return NULL;
3774 }
3775
3776 struct isl_basic_set *isl_basic_set_align_divs(
3777                 struct isl_basic_set *dst, struct isl_basic_set *src)
3778 {
3779         return (struct isl_basic_set *)isl_basic_map_align_divs(
3780                 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
3781 }
3782
3783 struct isl_map *isl_map_align_divs(struct isl_map *map)
3784 {
3785         int i;
3786
3787         map = isl_map_compute_divs(map);
3788         map = isl_map_cow(map);
3789         if (!map)
3790                 return NULL;
3791
3792         for (i = 1; i < map->n; ++i)
3793                 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
3794         for (i = 1; i < map->n; ++i)
3795                 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
3796
3797         ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3798         return map;
3799 }
3800
3801 struct isl_set *isl_set_align_divs(struct isl_set *set)
3802 {
3803         return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
3804 }
3805
3806 static struct isl_map *add_cut_constraint(struct isl_map *dst,
3807                 struct isl_basic_map *src, isl_int *c,
3808                 unsigned len, int oppose)
3809 {
3810         struct isl_basic_map *copy = NULL;
3811         int is_empty;
3812         int k;
3813         unsigned total;
3814
3815         copy = isl_basic_map_copy(src);
3816         copy = isl_basic_map_cow(copy);
3817         if (!copy)
3818                 goto error;
3819         copy = isl_basic_map_extend_constraints(copy, 0, 1);
3820         k = isl_basic_map_alloc_inequality(copy);
3821         if (k < 0)
3822                 goto error;
3823         if (oppose)
3824                 isl_seq_neg(copy->ineq[k], c, len);
3825         else
3826                 isl_seq_cpy(copy->ineq[k], c, len);
3827         total = 1 + isl_basic_map_total_dim(copy);
3828         isl_seq_clr(copy->ineq[k]+len, total - len);
3829         isl_inequality_negate(copy, k);
3830         copy = isl_basic_map_simplify(copy);
3831         copy = isl_basic_map_finalize(copy);
3832         is_empty = isl_basic_map_is_empty(copy);
3833         if (is_empty < 0)
3834                 goto error;
3835         if (!is_empty)
3836                 dst = isl_map_add(dst, copy);
3837         else
3838                 isl_basic_map_free(copy);
3839         return dst;
3840 error:
3841         isl_basic_map_free(copy);
3842         isl_map_free(dst);
3843         return NULL;
3844 }
3845
3846 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
3847 {
3848         int i, j, k;
3849         unsigned flags = 0;
3850         struct isl_map *rest = NULL;
3851         unsigned max;
3852         unsigned total = isl_basic_map_total_dim(bmap);
3853
3854         assert(bmap);
3855
3856         if (!map)
3857                 goto error;
3858
3859         if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3860                 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3861
3862         max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
3863         rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
3864         if (!rest)
3865                 goto error;
3866
3867         for (i = 0; i < map->n; ++i) {
3868                 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
3869                 if (!map->p[i])
3870                         goto error;
3871         }
3872
3873         for (j = 0; j < map->n; ++j)
3874                 map->p[j] = isl_basic_map_cow(map->p[j]);
3875
3876         for (i = 0; i < bmap->n_eq; ++i) {
3877                 for (j = 0; j < map->n; ++j) {
3878                         rest = add_cut_constraint(rest,
3879                                 map->p[j], bmap->eq[i], 1+total, 0);
3880                         if (!rest)
3881                                 goto error;
3882
3883                         rest = add_cut_constraint(rest,
3884                                 map->p[j], bmap->eq[i], 1+total, 1);
3885                         if (!rest)
3886                                 goto error;
3887
3888                         map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3889                                 1, 0);
3890                         if (!map->p[j])
3891                                 goto error;
3892                         k = isl_basic_map_alloc_equality(map->p[j]);
3893                         if (k < 0)
3894                                 goto error;
3895                         isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
3896                         isl_seq_clr(map->p[j]->eq[k]+1+total,
3897                                         map->p[j]->n_div - bmap->n_div);
3898                 }
3899         }
3900
3901         for (i = 0; i < bmap->n_ineq; ++i) {
3902                 for (j = 0; j < map->n; ++j) {
3903                         rest = add_cut_constraint(rest,
3904                                 map->p[j], bmap->ineq[i], 1+total, 0);
3905                         if (!rest)
3906                                 goto error;
3907
3908                         map->p[j] = isl_basic_map_extend_constraints(map->p[j],
3909                                 0, 1);
3910                         if (!map->p[j])
3911                                 goto error;
3912                         k = isl_basic_map_alloc_inequality(map->p[j]);
3913                         if (k < 0)
3914                                 goto error;
3915                         isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
3916                         isl_seq_clr(map->p[j]->ineq[k]+1+total,
3917                                         map->p[j]->n_div - bmap->n_div);
3918                 }
3919         }
3920
3921         isl_map_free(map);
3922         return rest;
3923 error:
3924         isl_map_free(map);
3925         isl_map_free(rest);
3926         return NULL;
3927 }
3928
3929 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
3930 {
3931         int i;
3932         if (!map1 || !map2)
3933                 goto error;
3934
3935         isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3936
3937         if (isl_map_is_empty(map2)) {
3938                 isl_map_free(map2);
3939                 return map1;
3940         }
3941
3942         map1 = isl_map_compute_divs(map1);
3943         map2 = isl_map_compute_divs(map2);
3944         if (!map1 || !map2)
3945                 goto error;
3946
3947         for (i = 0; map1 && i < map2->n; ++i)
3948                 map1 = subtract(map1, map2->p[i]);
3949
3950         isl_map_free(map2);
3951         return map1;
3952 error:
3953         isl_map_free(map1);
3954         isl_map_free(map2);
3955         return NULL;
3956 }
3957
3958 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
3959 {
3960         return (struct isl_set *)
3961                 isl_map_subtract(
3962                         (struct isl_map *)set1, (struct isl_map *)set2);
3963 }
3964
3965 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
3966 {
3967         if (!set || !map)
3968                 goto error;
3969         isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
3970         map = isl_map_intersect_domain(map, set);
3971         set = isl_map_range(map);
3972         return set;
3973 error:
3974         isl_set_free(set);
3975         isl_map_free(map);
3976         return NULL;
3977 }
3978
3979 /* There is no need to cow as removing empty parts doesn't change
3980  * the meaning of the set.
3981  */
3982 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
3983 {
3984         int i;
3985
3986         if (!map)
3987                 return NULL;
3988
3989         for (i = map->n-1; i >= 0; --i) {
3990                 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
3991                         continue;
3992                 isl_basic_map_free(map->p[i]);
3993                 if (i != map->n-1) {
3994                         ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3995                         map->p[i] = map->p[map->n-1];
3996                 }
3997                 map->n--;
3998         }
3999
4000         return map;
4001 }
4002
4003 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4004 {
4005         return (struct isl_set *)
4006                 isl_map_remove_empty_parts((struct isl_map *)set);
4007 }
4008
4009 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
4010 {
4011         struct isl_basic_map *bmap;
4012         if (!map || map->n == 0)
4013                 return NULL;
4014         bmap = map->p[map->n-1];
4015         isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
4016         return isl_basic_map_copy(bmap);
4017 }
4018
4019 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4020 {
4021         (struct isl_basic_set *)isl_map_copy_basic_map((struct isl_map *)set);
4022 }
4023
4024 struct isl_map *isl_map_drop_basic_map(struct isl_map *map,
4025                                                 struct isl_basic_map *bmap)
4026 {
4027         int i;
4028
4029         if (!map || !bmap)
4030                 goto error;
4031         for (i = map->n-1; i >= 0; --i) {
4032                 if (map->p[i] != bmap)
4033                         continue;
4034                 map = isl_map_cow(map);
4035                 if (!map)
4036                         goto error;
4037                 isl_basic_map_free(map->p[i]);
4038                 if (i != map->n-1) {
4039                         ISL_F_CLR(map, ISL_SET_NORMALIZED);
4040                         map->p[i] = map->p[map->n-1];
4041                 }
4042                 map->n--;
4043                 return map;
4044         }
4045         isl_basic_map_free(bmap);
4046         return map;
4047 error:
4048         isl_map_free(map);
4049         isl_basic_map_free(bmap);
4050         return NULL;
4051 }
4052
4053 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4054                                                 struct isl_basic_set *bset)
4055 {
4056         (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
4057                                                 (struct isl_basic_map *)bset);
4058 }
4059
4060 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4061  * for any common value of the parameters and dimensions preceding dim
4062  * in both basic sets, the values of dimension pos in bset1 are
4063  * smaller or larger than those in bset2.
4064  *
4065  * Returns
4066  *       1 if bset1 follows bset2
4067  *      -1 if bset1 precedes bset2
4068  *       0 if bset1 and bset2 are incomparable
4069  *      -2 if some error occurred.
4070  */
4071 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4072         struct isl_basic_set *bset2, int pos)
4073 {
4074         struct isl_dim *dims;
4075         struct isl_basic_map *bmap1 = NULL;
4076         struct isl_basic_map *bmap2 = NULL;
4077         struct isl_ctx *ctx;
4078         struct isl_vec *obj;
4079         unsigned total;
4080         unsigned nparam;
4081         unsigned dim1, dim2;
4082         isl_int num, den;
4083         enum isl_lp_result res;
4084         int cmp;
4085
4086         if (!bset1 || !bset2)
4087                 return -2;
4088
4089         nparam = isl_basic_set_n_param(bset1);
4090         dim1 = isl_basic_set_n_dim(bset1);
4091         dim2 = isl_basic_set_n_dim(bset2);
4092         dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4093         bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4094         dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4095         bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4096         if (!bmap1 || !bmap2)
4097                 goto error;
4098         bmap1 = isl_basic_map_cow(bmap1);
4099         bmap1 = isl_basic_map_extend(bmap1, nparam,
4100                         pos, (dim1 - pos) + (dim2 - pos),
4101                         bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4102         bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4103         if (!bmap1)
4104                 goto error;
4105         total = isl_basic_map_total_dim(bmap1);
4106         ctx = bmap1->ctx;
4107         obj = isl_vec_alloc(ctx, 1 + total);
4108         isl_seq_clr(obj->block.data, 1 + total);
4109         isl_int_set_si(obj->block.data[1+nparam+pos], 1);
4110         isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
4111         if (!obj)
4112                 goto error;
4113         isl_int_init(num);
4114         isl_int_init(den);
4115         res = isl_solve_lp(bmap1, 0, obj->block.data, ctx->one, &num, &den);
4116         if (res == isl_lp_empty)
4117                 cmp = 0;
4118         else if (res == isl_lp_ok && isl_int_is_pos(num))
4119                 cmp = 1;
4120         else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4121                   res == isl_lp_unbounded)
4122                 cmp = -1;
4123         else
4124                 cmp = -2;
4125         isl_int_clear(num);
4126         isl_int_clear(den);
4127         isl_basic_map_free(bmap1);
4128         isl_vec_free(obj);
4129         return cmp;
4130 error:
4131         isl_basic_map_free(bmap1);
4132         isl_basic_map_free(bmap2);
4133         return -2;
4134 }
4135
4136 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4137         unsigned pos, isl_int *val)
4138 {
4139         int i;
4140         int d;
4141         unsigned total;
4142
4143         if (!bmap)
4144                 return -1;
4145         total = isl_basic_map_total_dim(bmap);
4146         for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4147                 for (; d+1 > pos; --d)
4148                         if (!isl_int_is_zero(bmap->eq[i][1+d]))
4149                                 break;
4150                 if (d != pos)
4151                         continue;
4152                 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4153                         return 0;
4154                 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4155                         return 0;
4156                 if (!isl_int_is_one(bmap->eq[i][1+d]))
4157                         return 0;
4158                 if (val)
4159                         isl_int_neg(*val, bmap->eq[i][0]);
4160                 return 1;
4161         }
4162         return 0;
4163 }
4164
4165 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4166         unsigned pos, isl_int *val)
4167 {
4168         int i;
4169         isl_int v;
4170         isl_int tmp;
4171         int fixed;
4172
4173         if (!map)
4174                 return -1;
4175         if (map->n == 0)
4176                 return 0;
4177         if (map->n == 1)
4178                 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val); 
4179         isl_int_init(v);
4180         isl_int_init(tmp);
4181         fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v); 
4182         for (i = 1; fixed == 1 && i < map->n; ++i) {
4183                 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp); 
4184                 if (fixed == 1 && isl_int_ne(tmp, v))
4185                         fixed = 0;
4186         }
4187         if (val)
4188                 isl_int_set(*val, v);
4189         isl_int_clear(tmp);
4190         isl_int_clear(v);
4191         return fixed;
4192 }
4193
4194 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
4195         unsigned pos, isl_int *val)
4196 {
4197         return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
4198                                                 pos, val);
4199 }
4200
4201 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4202         isl_int *val)
4203 {
4204         return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4205 }
4206
4207 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
4208         enum isl_dim_type type, unsigned pos, isl_int *val)
4209 {
4210         if (pos >= isl_basic_map_dim(bmap, type))
4211                 return -1;
4212         return isl_basic_map_fast_has_fixed_var(bmap,
4213                 isl_basic_map_offset(bmap, type) - 1 + pos, val);
4214 }
4215
4216 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4217  * then return this fixed value in *val.
4218  */
4219 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
4220         isl_int *val)
4221 {
4222         return isl_basic_set_fast_has_fixed_var(bset,
4223                                         isl_basic_set_n_param(bset) + dim, val);
4224 }
4225
4226 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4227  * then return this fixed value in *val.
4228  */
4229 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4230 {
4231         return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
4232 }
4233
4234 /* Check if input variable in has fixed value and if so and if val is not NULL,
4235  * then return this fixed value in *val.
4236  */
4237 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4238 {
4239         return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
4240 }
4241
4242 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4243  * and if val is not NULL, then return this lower bound in *val.
4244  */
4245 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4246         unsigned dim, isl_int *val)
4247 {
4248         int i, i_eq = -1, i_ineq = -1;
4249         isl_int *c;
4250         unsigned total;
4251         unsigned nparam;
4252
4253         if (!bset)
4254                 return -1;
4255         total = isl_basic_set_total_dim(bset);
4256         nparam = isl_basic_set_n_param(bset);
4257         for (i = 0; i < bset->n_eq; ++i) {
4258                 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4259                         continue;
4260                 if (i_eq != -1)
4261                         return 0;
4262                 i_eq = i;
4263         }
4264         for (i = 0; i < bset->n_ineq; ++i) {
4265                 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4266                         continue;
4267                 if (i_eq != -1 || i_ineq != -1)
4268                         return 0;
4269                 i_ineq = i;
4270         }
4271         if (i_eq == -1 && i_ineq == -1)
4272                 return 0;
4273         c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4274         /* The coefficient should always be one due to normalization. */
4275         if (!isl_int_is_one(c[1+nparam+dim]))
4276                 return 0;
4277         if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4278                 return 0;
4279         if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4280                                         total - nparam - dim - 1) != -1)
4281                 return 0;
4282         if (val)
4283                 isl_int_neg(*val, c[0]);
4284         return 1;
4285 }
4286
4287 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4288         unsigned dim, isl_int *val)
4289 {
4290         int i;
4291         isl_int v;
4292         isl_int tmp;
4293         int fixed;
4294
4295         if (!set)
4296                 return -1;
4297         if (set->n == 0)
4298                 return 0;
4299         if (set->n == 1)
4300                 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4301                                                                 dim, val);
4302         isl_int_init(v);
4303         isl_int_init(tmp);
4304         fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4305                                                                 dim, &v);
4306         for (i = 1; fixed == 1 && i < set->n; ++i) {
4307                 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4308                                                                 dim, &tmp);
4309                 if (fixed == 1 && isl_int_ne(tmp, v))
4310                         fixed = 0;
4311         }
4312         if (val)
4313                 isl_int_set(*val, v);
4314         isl_int_clear(tmp);
4315         isl_int_clear(v);
4316         return fixed;
4317 }
4318
4319 struct constraint {
4320         unsigned        size;
4321         isl_int         *c;
4322 };
4323
4324 static int qsort_constraint_cmp(const void *p1, const void *p2)
4325 {
4326         const struct constraint *c1 = (const struct constraint *)p1;
4327         const struct constraint *c2 = (const struct constraint *)p2;
4328         unsigned size = isl_min(c1->size, c2->size);
4329         return isl_seq_cmp(c1->c, c2->c, size);
4330 }
4331
4332 static struct isl_basic_map *isl_basic_map_sort_constraints(
4333         struct isl_basic_map *bmap)
4334 {
4335         int i;
4336         struct constraint *c;
4337         unsigned total;
4338
4339         if (!bmap)
4340                 return NULL;
4341         total = isl_basic_map_total_dim(bmap);
4342         c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4343         if (!c)
4344                 goto error;
4345         for (i = 0; i < bmap->n_ineq; ++i) {
4346                 c[i].size = total;
4347                 c[i].c = bmap->ineq[i];
4348         }
4349         qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4350         for (i = 0; i < bmap->n_ineq; ++i)
4351                 bmap->ineq[i] = c[i].c;
4352         free(c);
4353         return bmap;
4354 error:
4355         isl_basic_map_free(bmap);
4356         return NULL;
4357 }
4358
4359 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4360 {
4361         if (!bmap)
4362                 return NULL;
4363         if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4364                 return bmap;
4365         bmap = isl_basic_map_convex_hull(bmap);
4366         bmap = isl_basic_map_sort_constraints(bmap);
4367         ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4368         return bmap;
4369 }
4370
4371 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
4372 {
4373         return (struct isl_basic_set *)isl_basic_map_normalize(
4374                                                 (struct isl_basic_map *)bset);
4375 }
4376
4377 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4378         const struct isl_basic_map *bmap2)
4379 {
4380         int i, cmp;
4381         unsigned total;
4382
4383         if (bmap1 == bmap2)
4384                 return 0;
4385         if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
4386                 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
4387         if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
4388                 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4389         if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
4390                 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4391         if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4392             ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4393                 return 0;
4394         if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4395                 return 1;
4396         if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4397                 return -1;
4398         if (bmap1->n_eq != bmap2->n_eq)
4399                 return bmap1->n_eq - bmap2->n_eq;
4400         if (bmap1->n_ineq != bmap2->n_ineq)
4401                 return bmap1->n_ineq - bmap2->n_ineq;
4402         if (bmap1->n_div != bmap2->n_div)
4403                 return bmap1->n_div - bmap2->n_div;
4404         total = isl_basic_map_total_dim(bmap1);
4405         for (i = 0; i < bmap1->n_eq; ++i) {
4406                 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4407                 if (cmp)
4408                         return cmp;
4409         }
4410         for (i = 0; i < bmap1->n_ineq; ++i) {
4411                 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4412                 if (cmp)
4413                         return cmp;
4414         }
4415         for (i = 0; i < bmap1->n_div; ++i) {
4416                 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4417                 if (cmp)
4418                         return cmp;
4419         }
4420         return 0;
4421 }
4422
4423 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4424         struct isl_basic_map *bmap2)
4425 {
4426         return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4427 }
4428
4429 static int qsort_bmap_cmp(const void *p1, const void *p2)
4430 {
4431         const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4432         const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4433
4434         return isl_basic_map_fast_cmp(bmap1, bmap2);
4435 }
4436
4437 /* We normalize in place, but if anything goes wrong we need
4438  * to return NULL, so we need to make sure we don't change the
4439  * meaning of any possible other copies of map.
4440  */
4441 struct isl_map *isl_map_normalize(struct isl_map *map)
4442 {
4443         int i, j;
4444         struct isl_basic_map *bmap;
4445
4446         if (!map)
4447                 return NULL;
4448         if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
4449                 return map;
4450         for (i = 0; i < map->n; ++i) {
4451                 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4452                 if (!bmap)
4453                         goto error;
4454                 isl_basic_map_free(map->p[i]);
4455                 map->p[i] = bmap;
4456         }
4457         qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4458         ISL_F_SET(map, ISL_MAP_NORMALIZED);
4459         map = isl_map_remove_empty_parts(map);
4460         if (!map)
4461                 return NULL;
4462         for (i = map->n - 1; i >= 1; --i) {
4463                 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4464                         continue;
4465                 isl_basic_map_free(map->p[i-1]);
4466                 for (j = i; j < map->n; ++j)
4467                         map->p[j-1] = map->p[j];
4468                 map->n--;
4469         }
4470         return map;
4471 error:
4472         isl_map_free(map);
4473         return NULL;
4474
4475 }
4476
4477 struct isl_set *isl_set_normalize(struct isl_set *set)
4478 {
4479         return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4480 }
4481
4482 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4483 {
4484         int i;
4485         int equal;
4486
4487         if (!map1 || !map2)
4488                 return -1;
4489
4490         if (map1 == map2)
4491                 return 1;
4492         if (!isl_dim_equal(map1->dim, map2->dim))
4493                 return 0;
4494
4495         map1 = isl_map_copy(map1);
4496         map2 = isl_map_copy(map2);
4497         map1 = isl_map_normalize(map1);
4498         map2 = isl_map_normalize(map2);
4499         if (!map1 || !map2)
4500                 goto error;
4501         equal = map1->n == map2->n;
4502         for (i = 0; equal && i < map1->n; ++i) {
4503                 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4504                 if (equal < 0)
4505                         goto error;
4506         }
4507         isl_map_free(map1);
4508         isl_map_free(map2);
4509         return equal;
4510 error:
4511         isl_map_free(map1);
4512         isl_map_free(map2);
4513         return -1;
4514 }
4515
4516 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4517 {
4518         return isl_map_fast_is_equal((struct isl_map *)set1,
4519                                                 (struct isl_map *)set2);
4520 }
4521
4522 /* Return an interval that ranges from min to max (inclusive)
4523  */
4524 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4525         isl_int min, isl_int max)
4526 {
4527         int k;
4528         struct isl_basic_set *bset = NULL;
4529
4530         bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4531         if (!bset)
4532                 goto error;
4533
4534         k = isl_basic_set_alloc_inequality(bset);
4535         if (k < 0)
4536                 goto error;
4537         isl_int_set_si(bset->ineq[k][1], 1);
4538         isl_int_neg(bset->ineq[k][0], min);
4539
4540         k = isl_basic_set_alloc_inequality(bset);
4541         if (k < 0)
4542                 goto error;
4543         isl_int_set_si(bset->ineq[k][1], -1);
4544         isl_int_set(bset->ineq[k][0], max);
4545
4546         return bset;
4547 error:
4548         isl_basic_set_free(bset);
4549         return NULL;
4550 }
4551
4552 /* Return the Cartesian product of the basic sets in list (in the given order).
4553  */
4554 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4555 {
4556         int i;
4557         unsigned dim;
4558         unsigned nparam;
4559         unsigned extra;
4560         unsigned n_eq;
4561         unsigned n_ineq;
4562         struct isl_basic_set *product = NULL;
4563
4564         if (!list)
4565                 goto error;
4566         isl_assert(list->ctx, list->n > 0, goto error);
4567         isl_assert(list->ctx, list->p[0], goto error);
4568         nparam = isl_basic_set_n_param(list->p[0]);
4569         dim = isl_basic_set_n_dim(list->p[0]);
4570         extra = list->p[0]->n_div;
4571         n_eq = list->p[0]->n_eq;
4572         n_ineq = list->p[0]->n_ineq;
4573         for (i = 1; i < list->n; ++i) {
4574                 isl_assert(list->ctx, list->p[i], goto error);
4575                 isl_assert(list->ctx,
4576                     nparam == isl_basic_set_n_param(list->p[i]), goto error);
4577                 dim += isl_basic_set_n_dim(list->p[i]);
4578                 extra += list->p[i]->n_div;
4579                 n_eq += list->p[i]->n_eq;
4580                 n_ineq += list->p[i]->n_ineq;
4581         }
4582         product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4583                                         n_eq, n_ineq);
4584         if (!product)
4585                 goto error;
4586         dim = 0;
4587         for (i = 0; i < list->n; ++i) {
4588                 isl_basic_set_add_constraints(product,
4589                                         isl_basic_set_copy(list->p[i]), dim);
4590                 dim += isl_basic_set_n_dim(list->p[i]);
4591         }
4592         isl_basic_set_list_free(list);
4593         return product;
4594 error:
4595         isl_basic_set_free(product);
4596         isl_basic_set_list_free(list);
4597         return NULL;
4598 }
4599
4600 struct isl_basic_map *isl_basic_map_product(
4601                 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4602 {
4603         struct isl_dim *dim_result = NULL;
4604         struct isl_basic_map *bmap;
4605         unsigned in1, in2, out1, out2, nparam, total, pos;
4606         struct isl_dim_map *dim_map1, *dim_map2;
4607
4608         if (!bmap1 || !bmap2)
4609                 goto error;
4610
4611         isl_assert(map1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
4612                                      bmap2->dim, isl_dim_param), goto error);
4613         dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
4614                                                    isl_dim_copy(bmap2->dim));
4615
4616         in1 = isl_basic_map_n_in(bmap1);
4617         in2 = isl_basic_map_n_in(bmap2);
4618         out1 = isl_basic_map_n_out(bmap1);
4619         out2 = isl_basic_map_n_out(bmap2);
4620         nparam = isl_basic_map_n_param(bmap1);
4621
4622         total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
4623         dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
4624         dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
4625         isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
4626         isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
4627         isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
4628         isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
4629         isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
4630         isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
4631         isl_dim_map_div(dim_map1, bmap1, pos += out2);
4632         isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
4633
4634         bmap = isl_basic_map_alloc_dim(dim_result,
4635                         bmap1->n_div + bmap2->n_div,
4636                         bmap1->n_eq + bmap2->n_eq,
4637                         bmap1->n_ineq + bmap2->n_ineq);
4638         bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
4639         bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
4640         bmap = isl_basic_map_simplify(bmap);
4641         return isl_basic_map_finalize(bmap);
4642 error:
4643         isl_basic_map_free(bmap1);
4644         isl_basic_map_free(bmap2);
4645         return NULL;
4646 }
4647
4648 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
4649  */
4650 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
4651 {
4652         unsigned flags = 0;
4653         struct isl_map *result;
4654         int i, j;
4655
4656         if (!map1 || !map2)
4657                 goto error;
4658
4659         isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
4660                                          map2->dim, isl_dim_param), goto error);
4661
4662         if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4663             ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4664                 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4665
4666         result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
4667                                                    isl_dim_copy(map2->dim)),
4668                                 map1->n * map2->n, flags);
4669         if (!result)
4670                 goto error;
4671         for (i = 0; i < map1->n; ++i)
4672                 for (j = 0; j < map2->n; ++j) {
4673                         struct isl_basic_map *part;
4674                         part = isl_basic_map_product(
4675                                     isl_basic_map_copy(map1->p[i]),
4676                                     isl_basic_map_copy(map2->p[j]));
4677                         if (isl_basic_map_is_empty(part))
4678                                 isl_basic_map_free(part);
4679                         else
4680                                 result = isl_map_add(result, part);
4681                         if (!result)
4682                                 goto error;
4683                 }
4684         isl_map_free(map1);
4685         isl_map_free(map2);
4686         return result;
4687 error:
4688         isl_map_free(map1);
4689         isl_map_free(map2);
4690         return NULL;
4691 }
4692
4693 /* Given two set A and B, construct its Cartesian product A x B.
4694  */
4695 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
4696 {
4697         return (struct isl_set *)isl_map_product((struct isl_map *)set1,
4698                                                  (struct isl_map *)set2);
4699 }
4700
4701 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
4702 {
4703         int i;
4704         uint32_t hash;
4705         unsigned total;
4706
4707         if (!bset)
4708                 return 0;
4709         bset = isl_basic_set_copy(bset);
4710         bset = isl_basic_set_normalize(bset);
4711         if (!bset)
4712                 return 0;
4713         total = isl_basic_set_total_dim(bset);
4714         isl_hash_byte(hash, bset->n_eq & 0xFF);
4715         for (i = 0; i < bset->n_eq; ++i) {
4716                 uint32_t c_hash;
4717                 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
4718                 isl_hash_hash(hash, c_hash);
4719         }
4720         isl_hash_byte(hash, bset->n_ineq & 0xFF);
4721         for (i = 0; i < bset->n_ineq; ++i) {
4722                 uint32_t c_hash;
4723                 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
4724                 isl_hash_hash(hash, c_hash);
4725         }
4726         isl_hash_byte(hash, bset->n_div & 0xFF);
4727         for (i = 0; i < bset->n_div; ++i) {
4728                 uint32_t c_hash;
4729                 if (isl_int_is_zero(bset->div[i][0]))
4730                         continue;
4731                 isl_hash_byte(hash, i & 0xFF);
4732                 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
4733                 isl_hash_hash(hash, c_hash);
4734         }
4735         isl_basic_set_free(bset);
4736         return hash;
4737 }
4738
4739 uint32_t isl_set_get_hash(struct isl_set *set)
4740 {
4741         int i;
4742         uint32_t hash;
4743
4744         if (!set)
4745                 return 0;
4746         set = isl_set_copy(set);
4747         set = isl_set_normalize(set);
4748         if (!set)
4749                 return 0;
4750
4751         hash = isl_hash_init();
4752         for (i = 0; i < set->n; ++i) {
4753                 uint32_t bset_hash;
4754                 bset_hash = isl_basic_set_get_hash(set->p[i]);
4755                 isl_hash_hash(hash, bset_hash);
4756         }
4757                 
4758         isl_set_free(set);
4759
4760         return hash;
4761 }
4762
4763 /* Check if the value for dimension dim is completely determined
4764  * by the values of the other parameters and variables.
4765  * That is, check if dimension dim is involved in an equality.
4766  */
4767 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
4768 {
4769         int i;
4770         unsigned nparam;
4771
4772         if (!bset)
4773                 return -1;
4774         nparam = isl_basic_set_n_param(bset);
4775         for (i = 0; i < bset->n_eq; ++i)
4776                 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
4777                         return 1;
4778         return 0;
4779 }
4780
4781 /* Check if the value for dimension dim is completely determined
4782  * by the values of the other parameters and variables.
4783  * That is, check if dimension dim is involved in an equality
4784  * for each of the subsets.
4785  */
4786 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
4787 {
4788         int i;
4789
4790         if (!set)
4791                 return -1;
4792         for (i = 0; i < set->n; ++i) {
4793                 int unique;
4794                 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
4795                 if (unique != 1)
4796                         return unique;
4797         }
4798         return 1;
4799 }