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