isl_ast_build_set_loop_bounds: extract out update of pending and generated
[isl.git] / isl_map.c
blob6dbb57593ea9efca43d63cf0feed858bb30eae0b
1 /*
2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2014 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
7 * Use of this software is governed by the MIT license
9 * Written by Sven Verdoolaege, K.U.Leuven, Departement
10 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
11 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
12 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
13 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
14 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
15 * B.P. 105 - 78153 Le Chesnay, France
18 #include <string.h>
19 #include <isl_ctx_private.h>
20 #include <isl_map_private.h>
21 #include <isl_blk.h>
22 #include <isl/constraint.h>
23 #include "isl_space_private.h"
24 #include "isl_equalities.h"
25 #include <isl_lp_private.h>
26 #include <isl_seq.h>
27 #include <isl/set.h>
28 #include <isl/map.h>
29 #include <isl_reordering.h>
30 #include "isl_sample.h"
31 #include <isl_sort.h>
32 #include "isl_tab.h"
33 #include <isl/vec.h>
34 #include <isl_mat_private.h>
35 #include <isl_vec_private.h>
36 #include <isl_dim_map.h>
37 #include <isl_local_space_private.h>
38 #include <isl_aff_private.h>
39 #include <isl_options_private.h>
40 #include <isl_morph.h>
41 #include <isl_val_private.h>
42 #include <isl/deprecated/map_int.h>
43 #include <isl/deprecated/set_int.h>
45 static unsigned n(__isl_keep isl_space *dim, enum isl_dim_type type)
47 switch (type) {
48 case isl_dim_param: return dim->nparam;
49 case isl_dim_in: return dim->n_in;
50 case isl_dim_out: return dim->n_out;
51 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
52 default: return 0;
56 static unsigned pos(__isl_keep isl_space *dim, enum isl_dim_type type)
58 switch (type) {
59 case isl_dim_param: return 1;
60 case isl_dim_in: return 1 + dim->nparam;
61 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
62 default: return 0;
66 unsigned isl_basic_map_dim(__isl_keep isl_basic_map *bmap,
67 enum isl_dim_type type)
69 if (!bmap)
70 return 0;
71 switch (type) {
72 case isl_dim_cst: return 1;
73 case isl_dim_param:
74 case isl_dim_in:
75 case isl_dim_out: return isl_space_dim(bmap->dim, type);
76 case isl_dim_div: return bmap->n_div;
77 case isl_dim_all: return isl_basic_map_total_dim(bmap);
78 default: return 0;
82 unsigned isl_map_dim(__isl_keep isl_map *map, enum isl_dim_type type)
84 return map ? n(map->dim, type) : 0;
87 unsigned isl_set_dim(__isl_keep isl_set *set, enum isl_dim_type type)
89 return set ? n(set->dim, type) : 0;
92 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
93 enum isl_dim_type type)
95 isl_space *dim = bmap->dim;
96 switch (type) {
97 case isl_dim_cst: return 0;
98 case isl_dim_param: return 1;
99 case isl_dim_in: return 1 + dim->nparam;
100 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
101 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
102 default: return 0;
106 unsigned isl_basic_set_offset(struct isl_basic_set *bset,
107 enum isl_dim_type type)
109 return isl_basic_map_offset(bset, type);
112 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
114 return pos(map->dim, type);
117 unsigned isl_basic_set_dim(__isl_keep isl_basic_set *bset,
118 enum isl_dim_type type)
120 return isl_basic_map_dim(bset, type);
123 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set *bset)
125 return isl_basic_set_dim(bset, isl_dim_set);
128 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set *bset)
130 return isl_basic_set_dim(bset, isl_dim_param);
133 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
135 if (!bset)
136 return 0;
137 return isl_space_dim(bset->dim, isl_dim_all) + bset->n_div;
140 unsigned isl_set_n_dim(__isl_keep isl_set *set)
142 return isl_set_dim(set, isl_dim_set);
145 unsigned isl_set_n_param(__isl_keep isl_set *set)
147 return isl_set_dim(set, isl_dim_param);
150 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
152 return bmap ? bmap->dim->n_in : 0;
155 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
157 return bmap ? bmap->dim->n_out : 0;
160 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
162 return bmap ? bmap->dim->nparam : 0;
165 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
167 return bmap ? bmap->n_div : 0;
170 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
172 return bmap ? isl_space_dim(bmap->dim, isl_dim_all) + bmap->n_div : 0;
175 unsigned isl_map_n_in(const struct isl_map *map)
177 return map ? map->dim->n_in : 0;
180 unsigned isl_map_n_out(const struct isl_map *map)
182 return map ? map->dim->n_out : 0;
185 unsigned isl_map_n_param(const struct isl_map *map)
187 return map ? map->dim->nparam : 0;
190 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
192 int m;
193 if (!map || !set)
194 return -1;
195 m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
196 if (m < 0 || !m)
197 return m;
198 return isl_space_tuple_is_equal(map->dim, isl_dim_in,
199 set->dim, isl_dim_set);
202 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
203 struct isl_basic_set *bset)
205 int m;
206 if (!bmap || !bset)
207 return -1;
208 m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
209 if (m < 0 || !m)
210 return m;
211 return isl_space_tuple_is_equal(bmap->dim, isl_dim_in,
212 bset->dim, isl_dim_set);
215 int isl_map_compatible_range(__isl_keep isl_map *map, __isl_keep isl_set *set)
217 int m;
218 if (!map || !set)
219 return -1;
220 m = isl_space_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
221 if (m < 0 || !m)
222 return m;
223 return isl_space_tuple_is_equal(map->dim, isl_dim_out,
224 set->dim, isl_dim_set);
227 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
228 struct isl_basic_set *bset)
230 int m;
231 if (!bmap || !bset)
232 return -1;
233 m = isl_space_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
234 if (m < 0 || !m)
235 return m;
236 return isl_space_tuple_is_equal(bmap->dim, isl_dim_out,
237 bset->dim, isl_dim_set);
240 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
242 return bmap ? bmap->ctx : NULL;
245 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
247 return bset ? bset->ctx : NULL;
250 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
252 return map ? map->ctx : NULL;
255 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
257 return set ? set->ctx : NULL;
260 __isl_give isl_space *isl_basic_map_get_space(__isl_keep isl_basic_map *bmap)
262 if (!bmap)
263 return NULL;
264 return isl_space_copy(bmap->dim);
267 __isl_give isl_space *isl_basic_set_get_space(__isl_keep isl_basic_set *bset)
269 if (!bset)
270 return NULL;
271 return isl_space_copy(bset->dim);
274 /* Extract the divs in "bmap" as a matrix.
276 __isl_give isl_mat *isl_basic_map_get_divs(__isl_keep isl_basic_map *bmap)
278 int i;
279 isl_ctx *ctx;
280 isl_mat *div;
281 unsigned total;
282 unsigned cols;
284 if (!bmap)
285 return NULL;
287 ctx = isl_basic_map_get_ctx(bmap);
288 total = isl_space_dim(bmap->dim, isl_dim_all);
289 cols = 1 + 1 + total + bmap->n_div;
290 div = isl_mat_alloc(ctx, bmap->n_div, cols);
291 if (!div)
292 return NULL;
294 for (i = 0; i < bmap->n_div; ++i)
295 isl_seq_cpy(div->row[i], bmap->div[i], cols);
297 return div;
300 /* Extract the divs in "bset" as a matrix.
302 __isl_give isl_mat *isl_basic_set_get_divs(__isl_keep isl_basic_set *bset)
304 return isl_basic_map_get_divs(bset);
307 __isl_give isl_local_space *isl_basic_map_get_local_space(
308 __isl_keep isl_basic_map *bmap)
310 isl_mat *div;
312 if (!bmap)
313 return NULL;
315 div = isl_basic_map_get_divs(bmap);
316 return isl_local_space_alloc_div(isl_space_copy(bmap->dim), div);
319 __isl_give isl_local_space *isl_basic_set_get_local_space(
320 __isl_keep isl_basic_set *bset)
322 return isl_basic_map_get_local_space(bset);
325 __isl_give isl_basic_map *isl_basic_map_from_local_space(
326 __isl_take isl_local_space *ls)
328 int i;
329 int n_div;
330 isl_basic_map *bmap;
332 if (!ls)
333 return NULL;
335 n_div = isl_local_space_dim(ls, isl_dim_div);
336 bmap = isl_basic_map_alloc_space(isl_local_space_get_space(ls),
337 n_div, 0, 2 * n_div);
339 for (i = 0; i < n_div; ++i)
340 if (isl_basic_map_alloc_div(bmap) < 0)
341 goto error;
343 for (i = 0; i < n_div; ++i) {
344 isl_seq_cpy(bmap->div[i], ls->div->row[i], ls->div->n_col);
345 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
346 goto error;
349 isl_local_space_free(ls);
350 return bmap;
351 error:
352 isl_local_space_free(ls);
353 isl_basic_map_free(bmap);
354 return NULL;
357 __isl_give isl_basic_set *isl_basic_set_from_local_space(
358 __isl_take isl_local_space *ls)
360 return isl_basic_map_from_local_space(ls);
363 __isl_give isl_space *isl_map_get_space(__isl_keep isl_map *map)
365 if (!map)
366 return NULL;
367 return isl_space_copy(map->dim);
370 __isl_give isl_space *isl_set_get_space(__isl_keep isl_set *set)
372 if (!set)
373 return NULL;
374 return isl_space_copy(set->dim);
377 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
378 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
380 bmap = isl_basic_map_cow(bmap);
381 if (!bmap)
382 return NULL;
383 bmap->dim = isl_space_set_tuple_name(bmap->dim, type, s);
384 if (!bmap->dim)
385 goto error;
386 bmap = isl_basic_map_finalize(bmap);
387 return bmap;
388 error:
389 isl_basic_map_free(bmap);
390 return NULL;
393 __isl_give isl_basic_set *isl_basic_set_set_tuple_name(
394 __isl_take isl_basic_set *bset, const char *s)
396 return isl_basic_map_set_tuple_name(bset, isl_dim_set, s);
399 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
400 enum isl_dim_type type)
402 return bmap ? isl_space_get_tuple_name(bmap->dim, type) : NULL;
405 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
406 enum isl_dim_type type, const char *s)
408 int i;
410 map = isl_map_cow(map);
411 if (!map)
412 return NULL;
414 map->dim = isl_space_set_tuple_name(map->dim, type, s);
415 if (!map->dim)
416 goto error;
418 for (i = 0; i < map->n; ++i) {
419 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
420 if (!map->p[i])
421 goto error;
424 return map;
425 error:
426 isl_map_free(map);
427 return NULL;
430 /* Replace the identifier of the tuple of type "type" by "id".
432 __isl_give isl_basic_map *isl_basic_map_set_tuple_id(
433 __isl_take isl_basic_map *bmap,
434 enum isl_dim_type type, __isl_take isl_id *id)
436 bmap = isl_basic_map_cow(bmap);
437 if (!bmap)
438 goto error;
439 bmap->dim = isl_space_set_tuple_id(bmap->dim, type, id);
440 if (!bmap->dim)
441 return isl_basic_map_free(bmap);
442 bmap = isl_basic_map_finalize(bmap);
443 return bmap;
444 error:
445 isl_id_free(id);
446 return NULL;
449 /* Replace the identifier of the tuple by "id".
451 __isl_give isl_basic_set *isl_basic_set_set_tuple_id(
452 __isl_take isl_basic_set *bset, __isl_take isl_id *id)
454 return isl_basic_map_set_tuple_id(bset, isl_dim_set, id);
457 /* Does the input or output tuple have a name?
459 isl_bool isl_map_has_tuple_name(__isl_keep isl_map *map, enum isl_dim_type type)
461 return map ? isl_space_has_tuple_name(map->dim, type) : isl_bool_error;
464 const char *isl_map_get_tuple_name(__isl_keep isl_map *map,
465 enum isl_dim_type type)
467 return map ? isl_space_get_tuple_name(map->dim, type) : NULL;
470 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
471 const char *s)
473 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
476 __isl_give isl_map *isl_map_set_tuple_id(__isl_take isl_map *map,
477 enum isl_dim_type type, __isl_take isl_id *id)
479 map = isl_map_cow(map);
480 if (!map)
481 goto error;
483 map->dim = isl_space_set_tuple_id(map->dim, type, id);
485 return isl_map_reset_space(map, isl_space_copy(map->dim));
486 error:
487 isl_id_free(id);
488 return NULL;
491 __isl_give isl_set *isl_set_set_tuple_id(__isl_take isl_set *set,
492 __isl_take isl_id *id)
494 return isl_map_set_tuple_id(set, isl_dim_set, id);
497 __isl_give isl_map *isl_map_reset_tuple_id(__isl_take isl_map *map,
498 enum isl_dim_type type)
500 map = isl_map_cow(map);
501 if (!map)
502 return NULL;
504 map->dim = isl_space_reset_tuple_id(map->dim, type);
506 return isl_map_reset_space(map, isl_space_copy(map->dim));
509 __isl_give isl_set *isl_set_reset_tuple_id(__isl_take isl_set *set)
511 return isl_map_reset_tuple_id(set, isl_dim_set);
514 isl_bool isl_map_has_tuple_id(__isl_keep isl_map *map, enum isl_dim_type type)
516 return map ? isl_space_has_tuple_id(map->dim, type) : isl_bool_error;
519 __isl_give isl_id *isl_map_get_tuple_id(__isl_keep isl_map *map,
520 enum isl_dim_type type)
522 return map ? isl_space_get_tuple_id(map->dim, type) : NULL;
525 isl_bool isl_set_has_tuple_id(__isl_keep isl_set *set)
527 return isl_map_has_tuple_id(set, isl_dim_set);
530 __isl_give isl_id *isl_set_get_tuple_id(__isl_keep isl_set *set)
532 return isl_map_get_tuple_id(set, isl_dim_set);
535 /* Does the set tuple have a name?
537 isl_bool isl_set_has_tuple_name(__isl_keep isl_set *set)
539 if (!set)
540 return isl_bool_error;
541 return isl_space_has_tuple_name(set->dim, isl_dim_set);
545 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
547 return bset ? isl_space_get_tuple_name(bset->dim, isl_dim_set) : NULL;
550 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
552 return set ? isl_space_get_tuple_name(set->dim, isl_dim_set) : NULL;
555 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
556 enum isl_dim_type type, unsigned pos)
558 return bmap ? isl_space_get_dim_name(bmap->dim, type, pos) : NULL;
561 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
562 enum isl_dim_type type, unsigned pos)
564 return bset ? isl_space_get_dim_name(bset->dim, type, pos) : NULL;
567 /* Does the given dimension have a name?
569 isl_bool isl_map_has_dim_name(__isl_keep isl_map *map,
570 enum isl_dim_type type, unsigned pos)
572 if (!map)
573 return isl_bool_error;
574 return isl_space_has_dim_name(map->dim, type, pos);
577 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
578 enum isl_dim_type type, unsigned pos)
580 return map ? isl_space_get_dim_name(map->dim, type, pos) : NULL;
583 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
584 enum isl_dim_type type, unsigned pos)
586 return set ? isl_space_get_dim_name(set->dim, type, pos) : NULL;
589 /* Does the given dimension have a name?
591 isl_bool isl_set_has_dim_name(__isl_keep isl_set *set,
592 enum isl_dim_type type, unsigned pos)
594 if (!set)
595 return isl_bool_error;
596 return isl_space_has_dim_name(set->dim, type, pos);
599 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
600 __isl_take isl_basic_map *bmap,
601 enum isl_dim_type type, unsigned pos, const char *s)
603 bmap = isl_basic_map_cow(bmap);
604 if (!bmap)
605 return NULL;
606 bmap->dim = isl_space_set_dim_name(bmap->dim, type, pos, s);
607 if (!bmap->dim)
608 goto error;
609 return isl_basic_map_finalize(bmap);
610 error:
611 isl_basic_map_free(bmap);
612 return NULL;
615 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
616 enum isl_dim_type type, unsigned pos, const char *s)
618 int i;
620 map = isl_map_cow(map);
621 if (!map)
622 return NULL;
624 map->dim = isl_space_set_dim_name(map->dim, type, pos, s);
625 if (!map->dim)
626 goto error;
628 for (i = 0; i < map->n; ++i) {
629 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
630 if (!map->p[i])
631 goto error;
634 return map;
635 error:
636 isl_map_free(map);
637 return NULL;
640 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
641 __isl_take isl_basic_set *bset,
642 enum isl_dim_type type, unsigned pos, const char *s)
644 return (isl_basic_set *)isl_basic_map_set_dim_name(
645 (isl_basic_map *)bset, type, pos, s);
648 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
649 enum isl_dim_type type, unsigned pos, const char *s)
651 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
654 isl_bool isl_basic_map_has_dim_id(__isl_keep isl_basic_map *bmap,
655 enum isl_dim_type type, unsigned pos)
657 if (!bmap)
658 return isl_bool_error;
659 return isl_space_has_dim_id(bmap->dim, type, pos);
662 __isl_give isl_id *isl_basic_set_get_dim_id(__isl_keep isl_basic_set *bset,
663 enum isl_dim_type type, unsigned pos)
665 return bset ? isl_space_get_dim_id(bset->dim, type, pos) : NULL;
668 isl_bool isl_map_has_dim_id(__isl_keep isl_map *map,
669 enum isl_dim_type type, unsigned pos)
671 return map ? isl_space_has_dim_id(map->dim, type, pos) : isl_bool_error;
674 __isl_give isl_id *isl_map_get_dim_id(__isl_keep isl_map *map,
675 enum isl_dim_type type, unsigned pos)
677 return map ? isl_space_get_dim_id(map->dim, type, pos) : NULL;
680 isl_bool isl_set_has_dim_id(__isl_keep isl_set *set,
681 enum isl_dim_type type, unsigned pos)
683 return isl_map_has_dim_id(set, type, pos);
686 __isl_give isl_id *isl_set_get_dim_id(__isl_keep isl_set *set,
687 enum isl_dim_type type, unsigned pos)
689 return isl_map_get_dim_id(set, type, pos);
692 __isl_give isl_map *isl_map_set_dim_id(__isl_take isl_map *map,
693 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
695 map = isl_map_cow(map);
696 if (!map)
697 goto error;
699 map->dim = isl_space_set_dim_id(map->dim, type, pos, id);
701 return isl_map_reset_space(map, isl_space_copy(map->dim));
702 error:
703 isl_id_free(id);
704 return NULL;
707 __isl_give isl_set *isl_set_set_dim_id(__isl_take isl_set *set,
708 enum isl_dim_type type, unsigned pos, __isl_take isl_id *id)
710 return isl_map_set_dim_id(set, type, pos, id);
713 int isl_map_find_dim_by_id(__isl_keep isl_map *map, enum isl_dim_type type,
714 __isl_keep isl_id *id)
716 if (!map)
717 return -1;
718 return isl_space_find_dim_by_id(map->dim, type, id);
721 int isl_set_find_dim_by_id(__isl_keep isl_set *set, enum isl_dim_type type,
722 __isl_keep isl_id *id)
724 return isl_map_find_dim_by_id(set, type, id);
727 /* Return the position of the dimension of the given type and name
728 * in "bmap".
729 * Return -1 if no such dimension can be found.
731 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map *bmap,
732 enum isl_dim_type type, const char *name)
734 if (!bmap)
735 return -1;
736 return isl_space_find_dim_by_name(bmap->dim, type, name);
739 int isl_map_find_dim_by_name(__isl_keep isl_map *map, enum isl_dim_type type,
740 const char *name)
742 if (!map)
743 return -1;
744 return isl_space_find_dim_by_name(map->dim, type, name);
747 int isl_set_find_dim_by_name(__isl_keep isl_set *set, enum isl_dim_type type,
748 const char *name)
750 return isl_map_find_dim_by_name(set, type, name);
753 /* Reset the user pointer on all identifiers of parameters and tuples
754 * of the space of "map".
756 __isl_give isl_map *isl_map_reset_user(__isl_take isl_map *map)
758 isl_space *space;
760 space = isl_map_get_space(map);
761 space = isl_space_reset_user(space);
762 map = isl_map_reset_space(map, space);
764 return map;
767 /* Reset the user pointer on all identifiers of parameters and tuples
768 * of the space of "set".
770 __isl_give isl_set *isl_set_reset_user(__isl_take isl_set *set)
772 return isl_map_reset_user(set);
775 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
777 if (!bmap)
778 return -1;
779 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
782 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
784 return isl_basic_map_is_rational(bset);
787 /* Does "bmap" contain any rational points?
789 * If "bmap" has an equality for each dimension, equating the dimension
790 * to an integer constant, then it has no rational points, even if it
791 * is marked as rational.
793 int isl_basic_map_has_rational(__isl_keep isl_basic_map *bmap)
795 int has_rational = 1;
796 unsigned total;
798 if (!bmap)
799 return -1;
800 if (isl_basic_map_plain_is_empty(bmap))
801 return 0;
802 if (!isl_basic_map_is_rational(bmap))
803 return 0;
804 bmap = isl_basic_map_copy(bmap);
805 bmap = isl_basic_map_implicit_equalities(bmap);
806 if (!bmap)
807 return -1;
808 total = isl_basic_map_total_dim(bmap);
809 if (bmap->n_eq == total) {
810 int i, j;
811 for (i = 0; i < bmap->n_eq; ++i) {
812 j = isl_seq_first_non_zero(bmap->eq[i] + 1, total);
813 if (j < 0)
814 break;
815 if (!isl_int_is_one(bmap->eq[i][1 + j]) &&
816 !isl_int_is_negone(bmap->eq[i][1 + j]))
817 break;
818 j = isl_seq_first_non_zero(bmap->eq[i] + 1 + j + 1,
819 total - j - 1);
820 if (j >= 0)
821 break;
823 if (i == bmap->n_eq)
824 has_rational = 0;
826 isl_basic_map_free(bmap);
828 return has_rational;
831 /* Does "map" contain any rational points?
833 int isl_map_has_rational(__isl_keep isl_map *map)
835 int i;
836 int has_rational;
838 if (!map)
839 return -1;
840 for (i = 0; i < map->n; ++i) {
841 has_rational = isl_basic_map_has_rational(map->p[i]);
842 if (has_rational < 0)
843 return -1;
844 if (has_rational)
845 return 1;
847 return 0;
850 /* Does "set" contain any rational points?
852 int isl_set_has_rational(__isl_keep isl_set *set)
854 return isl_map_has_rational(set);
857 /* Is this basic set a parameter domain?
859 int isl_basic_set_is_params(__isl_keep isl_basic_set *bset)
861 if (!bset)
862 return -1;
863 return isl_space_is_params(bset->dim);
866 /* Is this set a parameter domain?
868 isl_bool isl_set_is_params(__isl_keep isl_set *set)
870 if (!set)
871 return isl_bool_error;
872 return isl_space_is_params(set->dim);
875 /* Is this map actually a parameter domain?
876 * Users should never call this function. Outside of isl,
877 * a map can never be a parameter domain.
879 int isl_map_is_params(__isl_keep isl_map *map)
881 if (!map)
882 return -1;
883 return isl_space_is_params(map->dim);
886 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
887 struct isl_basic_map *bmap, unsigned extra,
888 unsigned n_eq, unsigned n_ineq)
890 int i;
891 size_t row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + extra;
893 bmap->ctx = ctx;
894 isl_ctx_ref(ctx);
896 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
897 if (isl_blk_is_error(bmap->block))
898 goto error;
900 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
901 if ((n_ineq + n_eq) && !bmap->ineq)
902 goto error;
904 if (extra == 0) {
905 bmap->block2 = isl_blk_empty();
906 bmap->div = NULL;
907 } else {
908 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
909 if (isl_blk_is_error(bmap->block2))
910 goto error;
912 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
913 if (!bmap->div)
914 goto error;
917 for (i = 0; i < n_ineq + n_eq; ++i)
918 bmap->ineq[i] = bmap->block.data + i * row_size;
920 for (i = 0; i < extra; ++i)
921 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
923 bmap->ref = 1;
924 bmap->flags = 0;
925 bmap->c_size = n_eq + n_ineq;
926 bmap->eq = bmap->ineq + n_ineq;
927 bmap->extra = extra;
928 bmap->n_eq = 0;
929 bmap->n_ineq = 0;
930 bmap->n_div = 0;
931 bmap->sample = NULL;
933 return bmap;
934 error:
935 isl_basic_map_free(bmap);
936 return NULL;
939 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
940 unsigned nparam, unsigned dim, unsigned extra,
941 unsigned n_eq, unsigned n_ineq)
943 struct isl_basic_map *bmap;
944 isl_space *space;
946 space = isl_space_set_alloc(ctx, nparam, dim);
947 if (!space)
948 return NULL;
950 bmap = isl_basic_map_alloc_space(space, extra, n_eq, n_ineq);
951 return (struct isl_basic_set *)bmap;
954 struct isl_basic_set *isl_basic_set_alloc_space(__isl_take isl_space *dim,
955 unsigned extra, unsigned n_eq, unsigned n_ineq)
957 struct isl_basic_map *bmap;
958 if (!dim)
959 return NULL;
960 isl_assert(dim->ctx, dim->n_in == 0, goto error);
961 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
962 return (struct isl_basic_set *)bmap;
963 error:
964 isl_space_free(dim);
965 return NULL;
968 struct isl_basic_map *isl_basic_map_alloc_space(__isl_take isl_space *dim,
969 unsigned extra, unsigned n_eq, unsigned n_ineq)
971 struct isl_basic_map *bmap;
973 if (!dim)
974 return NULL;
975 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
976 if (!bmap)
977 goto error;
978 bmap->dim = dim;
980 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
981 error:
982 isl_space_free(dim);
983 return NULL;
986 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
987 unsigned nparam, unsigned in, unsigned out, unsigned extra,
988 unsigned n_eq, unsigned n_ineq)
990 struct isl_basic_map *bmap;
991 isl_space *dim;
993 dim = isl_space_alloc(ctx, nparam, in, out);
994 if (!dim)
995 return NULL;
997 bmap = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
998 return bmap;
1001 static void dup_constraints(
1002 struct isl_basic_map *dst, struct isl_basic_map *src)
1004 int i;
1005 unsigned total = isl_basic_map_total_dim(src);
1007 for (i = 0; i < src->n_eq; ++i) {
1008 int j = isl_basic_map_alloc_equality(dst);
1009 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
1012 for (i = 0; i < src->n_ineq; ++i) {
1013 int j = isl_basic_map_alloc_inequality(dst);
1014 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
1017 for (i = 0; i < src->n_div; ++i) {
1018 int j = isl_basic_map_alloc_div(dst);
1019 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
1021 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
1024 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
1026 struct isl_basic_map *dup;
1028 if (!bmap)
1029 return NULL;
1030 dup = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
1031 bmap->n_div, bmap->n_eq, bmap->n_ineq);
1032 if (!dup)
1033 return NULL;
1034 dup_constraints(dup, bmap);
1035 dup->flags = bmap->flags;
1036 dup->sample = isl_vec_copy(bmap->sample);
1037 return dup;
1040 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
1042 struct isl_basic_map *dup;
1044 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
1045 return (struct isl_basic_set *)dup;
1048 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
1050 if (!bset)
1051 return NULL;
1053 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
1054 bset->ref++;
1055 return bset;
1057 return isl_basic_set_dup(bset);
1060 struct isl_set *isl_set_copy(struct isl_set *set)
1062 if (!set)
1063 return NULL;
1065 set->ref++;
1066 return set;
1069 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
1071 if (!bmap)
1072 return NULL;
1074 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
1075 bmap->ref++;
1076 return bmap;
1078 bmap = isl_basic_map_dup(bmap);
1079 if (bmap)
1080 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
1081 return bmap;
1084 struct isl_map *isl_map_copy(struct isl_map *map)
1086 if (!map)
1087 return NULL;
1089 map->ref++;
1090 return map;
1093 __isl_null isl_basic_map *isl_basic_map_free(__isl_take isl_basic_map *bmap)
1095 if (!bmap)
1096 return NULL;
1098 if (--bmap->ref > 0)
1099 return NULL;
1101 isl_ctx_deref(bmap->ctx);
1102 free(bmap->div);
1103 isl_blk_free(bmap->ctx, bmap->block2);
1104 free(bmap->ineq);
1105 isl_blk_free(bmap->ctx, bmap->block);
1106 isl_vec_free(bmap->sample);
1107 isl_space_free(bmap->dim);
1108 free(bmap);
1110 return NULL;
1113 __isl_null isl_basic_set *isl_basic_set_free(__isl_take isl_basic_set *bset)
1115 return isl_basic_map_free((struct isl_basic_map *)bset);
1118 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
1120 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
1123 __isl_give isl_map *isl_map_align_params_map_map_and(
1124 __isl_take isl_map *map1, __isl_take isl_map *map2,
1125 __isl_give isl_map *(*fn)(__isl_take isl_map *map1,
1126 __isl_take isl_map *map2))
1128 if (!map1 || !map2)
1129 goto error;
1130 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
1131 return fn(map1, map2);
1132 if (!isl_space_has_named_params(map1->dim) ||
1133 !isl_space_has_named_params(map2->dim))
1134 isl_die(map1->ctx, isl_error_invalid,
1135 "unaligned unnamed parameters", goto error);
1136 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
1137 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
1138 return fn(map1, map2);
1139 error:
1140 isl_map_free(map1);
1141 isl_map_free(map2);
1142 return NULL;
1145 isl_bool isl_map_align_params_map_map_and_test(__isl_keep isl_map *map1,
1146 __isl_keep isl_map *map2,
1147 isl_bool (*fn)(__isl_keep isl_map *map1, __isl_keep isl_map *map2))
1149 isl_bool r;
1151 if (!map1 || !map2)
1152 return isl_bool_error;
1153 if (isl_space_match(map1->dim, isl_dim_param, map2->dim, isl_dim_param))
1154 return fn(map1, map2);
1155 if (!isl_space_has_named_params(map1->dim) ||
1156 !isl_space_has_named_params(map2->dim))
1157 isl_die(map1->ctx, isl_error_invalid,
1158 "unaligned unnamed parameters", return isl_bool_error);
1159 map1 = isl_map_copy(map1);
1160 map2 = isl_map_copy(map2);
1161 map1 = isl_map_align_params(map1, isl_map_get_space(map2));
1162 map2 = isl_map_align_params(map2, isl_map_get_space(map1));
1163 r = fn(map1, map2);
1164 isl_map_free(map1);
1165 isl_map_free(map2);
1166 return r;
1169 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
1171 struct isl_ctx *ctx;
1172 if (!bmap)
1173 return -1;
1174 ctx = bmap->ctx;
1175 isl_assert(ctx, room_for_con(bmap, 1), return -1);
1176 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
1177 return -1);
1178 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1179 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1180 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
1181 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1182 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1183 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
1184 isl_int *t;
1185 int j = isl_basic_map_alloc_inequality(bmap);
1186 if (j < 0)
1187 return -1;
1188 t = bmap->ineq[j];
1189 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
1190 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1191 bmap->eq[-1] = t;
1192 bmap->n_eq++;
1193 bmap->n_ineq--;
1194 bmap->eq--;
1195 return 0;
1197 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
1198 bmap->extra - bmap->n_div);
1199 return bmap->n_eq++;
1202 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
1204 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
1207 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
1209 if (!bmap)
1210 return -1;
1211 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
1212 bmap->n_eq -= n;
1213 return 0;
1216 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
1218 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
1221 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
1223 isl_int *t;
1224 if (!bmap)
1225 return -1;
1226 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
1228 if (pos != bmap->n_eq - 1) {
1229 t = bmap->eq[pos];
1230 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
1231 bmap->eq[bmap->n_eq - 1] = t;
1233 bmap->n_eq--;
1234 return 0;
1237 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
1239 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
1242 /* Turn inequality "pos" of "bmap" into an equality.
1244 * In particular, we move the inequality in front of the equalities
1245 * and move the last inequality in the position of the moved inequality.
1246 * Note that isl_tab_make_equalities_explicit depends on this particular
1247 * change in the ordering of the constraints.
1249 void isl_basic_map_inequality_to_equality(
1250 struct isl_basic_map *bmap, unsigned pos)
1252 isl_int *t;
1254 t = bmap->ineq[pos];
1255 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1256 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1257 bmap->eq[-1] = t;
1258 bmap->n_eq++;
1259 bmap->n_ineq--;
1260 bmap->eq--;
1261 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1262 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1263 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1264 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1267 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
1269 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
1272 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
1274 struct isl_ctx *ctx;
1275 if (!bmap)
1276 return -1;
1277 ctx = bmap->ctx;
1278 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
1279 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
1280 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
1281 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1282 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
1283 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
1284 1 + isl_basic_map_total_dim(bmap),
1285 bmap->extra - bmap->n_div);
1286 return bmap->n_ineq++;
1289 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
1291 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
1294 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
1296 if (!bmap)
1297 return -1;
1298 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
1299 bmap->n_ineq -= n;
1300 return 0;
1303 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
1305 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
1308 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
1310 isl_int *t;
1311 if (!bmap)
1312 return -1;
1313 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1315 if (pos != bmap->n_ineq - 1) {
1316 t = bmap->ineq[pos];
1317 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1318 bmap->ineq[bmap->n_ineq - 1] = t;
1319 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1321 bmap->n_ineq--;
1322 return 0;
1325 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
1327 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
1330 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
1331 isl_int *eq)
1333 int k;
1335 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
1336 if (!bmap)
1337 return NULL;
1338 k = isl_basic_map_alloc_equality(bmap);
1339 if (k < 0)
1340 goto error;
1341 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
1342 return bmap;
1343 error:
1344 isl_basic_map_free(bmap);
1345 return NULL;
1348 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
1349 isl_int *eq)
1351 return (isl_basic_set *)
1352 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
1355 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
1356 isl_int *ineq)
1358 int k;
1360 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
1361 if (!bmap)
1362 return NULL;
1363 k = isl_basic_map_alloc_inequality(bmap);
1364 if (k < 0)
1365 goto error;
1366 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
1367 return bmap;
1368 error:
1369 isl_basic_map_free(bmap);
1370 return NULL;
1373 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
1374 isl_int *ineq)
1376 return (isl_basic_set *)
1377 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
1380 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
1382 if (!bmap)
1383 return -1;
1384 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
1385 isl_seq_clr(bmap->div[bmap->n_div] +
1386 1 + 1 + isl_basic_map_total_dim(bmap),
1387 bmap->extra - bmap->n_div);
1388 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
1389 return bmap->n_div++;
1392 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
1394 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
1397 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
1399 if (!bmap)
1400 return -1;
1401 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
1402 bmap->n_div -= n;
1403 return 0;
1406 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
1408 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
1411 /* Copy constraint from src to dst, putting the vars of src at offset
1412 * dim_off in dst and the divs of src at offset div_off in dst.
1413 * If both sets are actually map, then dim_off applies to the input
1414 * variables.
1416 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
1417 struct isl_basic_map *src_map, isl_int *src,
1418 unsigned in_off, unsigned out_off, unsigned div_off)
1420 unsigned src_nparam = isl_basic_map_n_param(src_map);
1421 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
1422 unsigned src_in = isl_basic_map_n_in(src_map);
1423 unsigned dst_in = isl_basic_map_n_in(dst_map);
1424 unsigned src_out = isl_basic_map_n_out(src_map);
1425 unsigned dst_out = isl_basic_map_n_out(dst_map);
1426 isl_int_set(dst[0], src[0]);
1427 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
1428 if (dst_nparam > src_nparam)
1429 isl_seq_clr(dst+1+src_nparam,
1430 dst_nparam - src_nparam);
1431 isl_seq_clr(dst+1+dst_nparam, in_off);
1432 isl_seq_cpy(dst+1+dst_nparam+in_off,
1433 src+1+src_nparam,
1434 isl_min(dst_in-in_off, src_in));
1435 if (dst_in-in_off > src_in)
1436 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
1437 dst_in - in_off - src_in);
1438 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
1439 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
1440 src+1+src_nparam+src_in,
1441 isl_min(dst_out-out_off, src_out));
1442 if (dst_out-out_off > src_out)
1443 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
1444 dst_out - out_off - src_out);
1445 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
1446 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1447 src+1+src_nparam+src_in+src_out,
1448 isl_min(dst_map->extra-div_off, src_map->n_div));
1449 if (dst_map->n_div-div_off > src_map->n_div)
1450 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1451 div_off+src_map->n_div,
1452 dst_map->n_div - div_off - src_map->n_div);
1455 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1456 struct isl_basic_map *src_map, isl_int *src,
1457 unsigned in_off, unsigned out_off, unsigned div_off)
1459 isl_int_set(dst[0], src[0]);
1460 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1463 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1464 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1466 int i;
1467 unsigned div_off;
1469 if (!bmap1 || !bmap2)
1470 goto error;
1472 div_off = bmap1->n_div;
1474 for (i = 0; i < bmap2->n_eq; ++i) {
1475 int i1 = isl_basic_map_alloc_equality(bmap1);
1476 if (i1 < 0)
1477 goto error;
1478 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1479 i_pos, o_pos, div_off);
1482 for (i = 0; i < bmap2->n_ineq; ++i) {
1483 int i1 = isl_basic_map_alloc_inequality(bmap1);
1484 if (i1 < 0)
1485 goto error;
1486 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1487 i_pos, o_pos, div_off);
1490 for (i = 0; i < bmap2->n_div; ++i) {
1491 int i1 = isl_basic_map_alloc_div(bmap1);
1492 if (i1 < 0)
1493 goto error;
1494 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1495 i_pos, o_pos, div_off);
1498 isl_basic_map_free(bmap2);
1500 return bmap1;
1502 error:
1503 isl_basic_map_free(bmap1);
1504 isl_basic_map_free(bmap2);
1505 return NULL;
1508 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1509 struct isl_basic_set *bset2, unsigned pos)
1511 return (struct isl_basic_set *)
1512 add_constraints((struct isl_basic_map *)bset1,
1513 (struct isl_basic_map *)bset2, 0, pos);
1516 struct isl_basic_map *isl_basic_map_extend_space(struct isl_basic_map *base,
1517 __isl_take isl_space *dim, unsigned extra,
1518 unsigned n_eq, unsigned n_ineq)
1520 struct isl_basic_map *ext;
1521 unsigned flags;
1522 int dims_ok;
1524 if (!dim)
1525 goto error;
1527 if (!base)
1528 goto error;
1530 dims_ok = isl_space_is_equal(base->dim, dim) &&
1531 base->extra >= base->n_div + extra;
1533 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1534 room_for_ineq(base, n_ineq)) {
1535 isl_space_free(dim);
1536 return base;
1539 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1540 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1541 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1542 extra += base->extra;
1543 n_eq += base->n_eq;
1544 n_ineq += base->n_ineq;
1546 ext = isl_basic_map_alloc_space(dim, extra, n_eq, n_ineq);
1547 dim = NULL;
1548 if (!ext)
1549 goto error;
1551 if (dims_ok)
1552 ext->sample = isl_vec_copy(base->sample);
1553 flags = base->flags;
1554 ext = add_constraints(ext, base, 0, 0);
1555 if (ext) {
1556 ext->flags = flags;
1557 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1560 return ext;
1562 error:
1563 isl_space_free(dim);
1564 isl_basic_map_free(base);
1565 return NULL;
1568 struct isl_basic_set *isl_basic_set_extend_space(struct isl_basic_set *base,
1569 __isl_take isl_space *dim, unsigned extra,
1570 unsigned n_eq, unsigned n_ineq)
1572 return (struct isl_basic_set *)
1573 isl_basic_map_extend_space((struct isl_basic_map *)base, dim,
1574 extra, n_eq, n_ineq);
1577 struct isl_basic_map *isl_basic_map_extend_constraints(
1578 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1580 if (!base)
1581 return NULL;
1582 return isl_basic_map_extend_space(base, isl_space_copy(base->dim),
1583 0, n_eq, n_ineq);
1586 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1587 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1588 unsigned n_eq, unsigned n_ineq)
1590 struct isl_basic_map *bmap;
1591 isl_space *dim;
1593 if (!base)
1594 return NULL;
1595 dim = isl_space_alloc(base->ctx, nparam, n_in, n_out);
1596 if (!dim)
1597 goto error;
1599 bmap = isl_basic_map_extend_space(base, dim, extra, n_eq, n_ineq);
1600 return bmap;
1601 error:
1602 isl_basic_map_free(base);
1603 return NULL;
1606 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1607 unsigned nparam, unsigned dim, unsigned extra,
1608 unsigned n_eq, unsigned n_ineq)
1610 return (struct isl_basic_set *)
1611 isl_basic_map_extend((struct isl_basic_map *)base,
1612 nparam, 0, dim, extra, n_eq, n_ineq);
1615 struct isl_basic_set *isl_basic_set_extend_constraints(
1616 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1618 return (struct isl_basic_set *)
1619 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1620 n_eq, n_ineq);
1623 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1625 return (struct isl_basic_set *)
1626 isl_basic_map_cow((struct isl_basic_map *)bset);
1629 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1631 if (!bmap)
1632 return NULL;
1634 if (bmap->ref > 1) {
1635 bmap->ref--;
1636 bmap = isl_basic_map_dup(bmap);
1638 if (bmap) {
1639 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1640 ISL_F_CLR(bmap, ISL_BASIC_MAP_REDUCED_COEFFICIENTS);
1642 return bmap;
1645 struct isl_set *isl_set_cow(struct isl_set *set)
1647 if (!set)
1648 return NULL;
1650 if (set->ref == 1)
1651 return set;
1652 set->ref--;
1653 return isl_set_dup(set);
1656 struct isl_map *isl_map_cow(struct isl_map *map)
1658 if (!map)
1659 return NULL;
1661 if (map->ref == 1)
1662 return map;
1663 map->ref--;
1664 return isl_map_dup(map);
1667 static void swap_vars(struct isl_blk blk, isl_int *a,
1668 unsigned a_len, unsigned b_len)
1670 isl_seq_cpy(blk.data, a+a_len, b_len);
1671 isl_seq_cpy(blk.data+b_len, a, a_len);
1672 isl_seq_cpy(a, blk.data, b_len+a_len);
1675 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1676 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1678 int i;
1679 struct isl_blk blk;
1681 if (!bmap)
1682 goto error;
1684 isl_assert(bmap->ctx,
1685 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1687 if (n1 == 0 || n2 == 0)
1688 return bmap;
1690 bmap = isl_basic_map_cow(bmap);
1691 if (!bmap)
1692 return NULL;
1694 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1695 if (isl_blk_is_error(blk))
1696 goto error;
1698 for (i = 0; i < bmap->n_eq; ++i)
1699 swap_vars(blk,
1700 bmap->eq[i] + pos, n1, n2);
1702 for (i = 0; i < bmap->n_ineq; ++i)
1703 swap_vars(blk,
1704 bmap->ineq[i] + pos, n1, n2);
1706 for (i = 0; i < bmap->n_div; ++i)
1707 swap_vars(blk,
1708 bmap->div[i]+1 + pos, n1, n2);
1710 isl_blk_free(bmap->ctx, blk);
1712 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1713 bmap = isl_basic_map_gauss(bmap, NULL);
1714 return isl_basic_map_finalize(bmap);
1715 error:
1716 isl_basic_map_free(bmap);
1717 return NULL;
1720 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1722 int i = 0;
1723 unsigned total;
1724 if (!bmap)
1725 goto error;
1726 total = isl_basic_map_total_dim(bmap);
1727 isl_basic_map_free_div(bmap, bmap->n_div);
1728 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1729 if (bmap->n_eq > 0)
1730 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1731 else {
1732 i = isl_basic_map_alloc_equality(bmap);
1733 if (i < 0)
1734 goto error;
1736 isl_int_set_si(bmap->eq[i][0], 1);
1737 isl_seq_clr(bmap->eq[i]+1, total);
1738 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1739 isl_vec_free(bmap->sample);
1740 bmap->sample = NULL;
1741 return isl_basic_map_finalize(bmap);
1742 error:
1743 isl_basic_map_free(bmap);
1744 return NULL;
1747 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1749 return (struct isl_basic_set *)
1750 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1753 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
1754 * of "bmap").
1756 static void swap_div(__isl_keep isl_basic_map *bmap, int a, int b)
1758 isl_int *t = bmap->div[a];
1759 bmap->div[a] = bmap->div[b];
1760 bmap->div[b] = t;
1763 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
1764 * div definitions accordingly.
1766 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1768 int i;
1769 unsigned off = isl_space_dim(bmap->dim, isl_dim_all);
1771 swap_div(bmap, a, b);
1773 for (i = 0; i < bmap->n_eq; ++i)
1774 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1776 for (i = 0; i < bmap->n_ineq; ++i)
1777 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1779 for (i = 0; i < bmap->n_div; ++i)
1780 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1781 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1784 /* Eliminate the specified n dimensions starting at first from the
1785 * constraints, without removing the dimensions from the space.
1786 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1788 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1789 enum isl_dim_type type, unsigned first, unsigned n)
1791 int i;
1793 if (!map)
1794 return NULL;
1795 if (n == 0)
1796 return map;
1798 if (first + n > isl_map_dim(map, type) || first + n < first)
1799 isl_die(map->ctx, isl_error_invalid,
1800 "index out of bounds", goto error);
1802 map = isl_map_cow(map);
1803 if (!map)
1804 return NULL;
1806 for (i = 0; i < map->n; ++i) {
1807 map->p[i] = isl_basic_map_eliminate(map->p[i], type, first, n);
1808 if (!map->p[i])
1809 goto error;
1811 return map;
1812 error:
1813 isl_map_free(map);
1814 return NULL;
1817 /* Eliminate the specified n dimensions starting at first from the
1818 * constraints, without removing the dimensions from the space.
1819 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1821 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1822 enum isl_dim_type type, unsigned first, unsigned n)
1824 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1827 /* Eliminate the specified n dimensions starting at first from the
1828 * constraints, without removing the dimensions from the space.
1829 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1831 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1832 unsigned first, unsigned n)
1834 return isl_set_eliminate(set, isl_dim_set, first, n);
1837 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1838 __isl_take isl_basic_map *bmap)
1840 if (!bmap)
1841 return NULL;
1842 bmap = isl_basic_map_eliminate_vars(bmap,
1843 isl_space_dim(bmap->dim, isl_dim_all), bmap->n_div);
1844 if (!bmap)
1845 return NULL;
1846 bmap->n_div = 0;
1847 return isl_basic_map_finalize(bmap);
1850 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1851 __isl_take isl_basic_set *bset)
1853 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1854 (struct isl_basic_map *)bset);
1857 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1859 int i;
1861 if (!map)
1862 return NULL;
1863 if (map->n == 0)
1864 return map;
1866 map = isl_map_cow(map);
1867 if (!map)
1868 return NULL;
1870 for (i = 0; i < map->n; ++i) {
1871 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1872 if (!map->p[i])
1873 goto error;
1875 return map;
1876 error:
1877 isl_map_free(map);
1878 return NULL;
1881 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1883 return isl_map_remove_divs(set);
1886 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1887 enum isl_dim_type type, unsigned first, unsigned n)
1889 if (!bmap)
1890 return NULL;
1891 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1892 goto error);
1893 if (n == 0 && !isl_space_is_named_or_nested(bmap->dim, type))
1894 return bmap;
1895 bmap = isl_basic_map_eliminate_vars(bmap,
1896 isl_basic_map_offset(bmap, type) - 1 + first, n);
1897 if (!bmap)
1898 return bmap;
1899 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1900 return bmap;
1901 bmap = isl_basic_map_drop(bmap, type, first, n);
1902 return bmap;
1903 error:
1904 isl_basic_map_free(bmap);
1905 return NULL;
1908 /* Return true if the definition of the given div (recursively) involves
1909 * any of the given variables.
1911 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1912 unsigned first, unsigned n)
1914 int i;
1915 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1917 if (isl_int_is_zero(bmap->div[div][0]))
1918 return 0;
1919 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1920 return 1;
1922 for (i = bmap->n_div - 1; i >= 0; --i) {
1923 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1924 continue;
1925 if (div_involves_vars(bmap, i, first, n))
1926 return 1;
1929 return 0;
1932 /* Try and add a lower and/or upper bound on "div" to "bmap"
1933 * based on inequality "i".
1934 * "total" is the total number of variables (excluding the divs).
1935 * "v" is a temporary object that can be used during the calculations.
1936 * If "lb" is set, then a lower bound should be constructed.
1937 * If "ub" is set, then an upper bound should be constructed.
1939 * The calling function has already checked that the inequality does not
1940 * reference "div", but we still need to check that the inequality is
1941 * of the right form. We'll consider the case where we want to construct
1942 * a lower bound. The construction of upper bounds is similar.
1944 * Let "div" be of the form
1946 * q = floor((a + f(x))/d)
1948 * We essentially check if constraint "i" is of the form
1950 * b + f(x) >= 0
1952 * so that we can use it to derive a lower bound on "div".
1953 * However, we allow a slightly more general form
1955 * b + g(x) >= 0
1957 * with the condition that the coefficients of g(x) - f(x) are all
1958 * divisible by d.
1959 * Rewriting this constraint as
1961 * 0 >= -b - g(x)
1963 * adding a + f(x) to both sides and dividing by d, we obtain
1965 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1967 * Taking the floor on both sides, we obtain
1969 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1971 * or
1973 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1975 * In the case of an upper bound, we construct the constraint
1977 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1980 static __isl_give isl_basic_map *insert_bounds_on_div_from_ineq(
1981 __isl_take isl_basic_map *bmap, int div, int i,
1982 unsigned total, isl_int v, int lb, int ub)
1984 int j;
1986 for (j = 0; (lb || ub) && j < total + bmap->n_div; ++j) {
1987 if (lb) {
1988 isl_int_sub(v, bmap->ineq[i][1 + j],
1989 bmap->div[div][1 + 1 + j]);
1990 lb = isl_int_is_divisible_by(v, bmap->div[div][0]);
1992 if (ub) {
1993 isl_int_add(v, bmap->ineq[i][1 + j],
1994 bmap->div[div][1 + 1 + j]);
1995 ub = isl_int_is_divisible_by(v, bmap->div[div][0]);
1998 if (!lb && !ub)
1999 return bmap;
2001 bmap = isl_basic_map_cow(bmap);
2002 bmap = isl_basic_map_extend_constraints(bmap, 0, lb + ub);
2003 if (lb) {
2004 int k = isl_basic_map_alloc_inequality(bmap);
2005 if (k < 0)
2006 goto error;
2007 for (j = 0; j < 1 + total + bmap->n_div; ++j) {
2008 isl_int_sub(bmap->ineq[k][j], bmap->ineq[i][j],
2009 bmap->div[div][1 + j]);
2010 isl_int_cdiv_q(bmap->ineq[k][j],
2011 bmap->ineq[k][j], bmap->div[div][0]);
2013 isl_int_set_si(bmap->ineq[k][1 + total + div], 1);
2015 if (ub) {
2016 int k = isl_basic_map_alloc_inequality(bmap);
2017 if (k < 0)
2018 goto error;
2019 for (j = 0; j < 1 + total + bmap->n_div; ++j) {
2020 isl_int_add(bmap->ineq[k][j], bmap->ineq[i][j],
2021 bmap->div[div][1 + j]);
2022 isl_int_fdiv_q(bmap->ineq[k][j],
2023 bmap->ineq[k][j], bmap->div[div][0]);
2025 isl_int_set_si(bmap->ineq[k][1 + total + div], -1);
2028 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2029 return bmap;
2030 error:
2031 isl_basic_map_free(bmap);
2032 return NULL;
2035 /* This function is called right before "div" is eliminated from "bmap"
2036 * using Fourier-Motzkin.
2037 * Look through the constraints of "bmap" for constraints on the argument
2038 * of the integer division and use them to construct constraints on the
2039 * integer division itself. These constraints can then be combined
2040 * during the Fourier-Motzkin elimination.
2041 * Note that it is only useful to introduce lower bounds on "div"
2042 * if "bmap" already contains upper bounds on "div" as the newly
2043 * introduce lower bounds can then be combined with the pre-existing
2044 * upper bounds. Similarly for upper bounds.
2045 * We therefore first check if "bmap" contains any lower and/or upper bounds
2046 * on "div".
2048 * It is interesting to note that the introduction of these constraints
2049 * can indeed lead to more accurate results, even when compared to
2050 * deriving constraints on the argument of "div" from constraints on "div".
2051 * Consider, for example, the set
2053 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2055 * The second constraint can be rewritten as
2057 * 2 * [(-i-2j+3)/4] + k >= 0
2059 * from which we can derive
2061 * -i - 2j + 3 >= -2k
2063 * or
2065 * i + 2j <= 3 + 2k
2067 * Combined with the first constraint, we obtain
2069 * -3 <= 3 + 2k or k >= -3
2071 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2072 * the first constraint, we obtain
2074 * [(i + 2j)/4] >= [-3/4] = -1
2076 * Combining this constraint with the second constraint, we obtain
2078 * k >= -2
2080 static __isl_give isl_basic_map *insert_bounds_on_div(
2081 __isl_take isl_basic_map *bmap, int div)
2083 int i;
2084 int check_lb, check_ub;
2085 isl_int v;
2086 unsigned total;
2088 if (!bmap)
2089 return NULL;
2091 if (isl_int_is_zero(bmap->div[div][0]))
2092 return bmap;
2094 total = isl_space_dim(bmap->dim, isl_dim_all);
2096 check_lb = 0;
2097 check_ub = 0;
2098 for (i = 0; (!check_lb || !check_ub) && i < bmap->n_ineq; ++i) {
2099 int s = isl_int_sgn(bmap->ineq[i][1 + total + div]);
2100 if (s > 0)
2101 check_ub = 1;
2102 if (s < 0)
2103 check_lb = 1;
2106 if (!check_lb && !check_ub)
2107 return bmap;
2109 isl_int_init(v);
2111 for (i = 0; bmap && i < bmap->n_ineq; ++i) {
2112 if (!isl_int_is_zero(bmap->ineq[i][1 + total + div]))
2113 continue;
2115 bmap = insert_bounds_on_div_from_ineq(bmap, div, i, total, v,
2116 check_lb, check_ub);
2119 isl_int_clear(v);
2121 return bmap;
2124 /* Remove all divs (recursively) involving any of the given dimensions
2125 * in their definitions.
2127 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
2128 __isl_take isl_basic_map *bmap,
2129 enum isl_dim_type type, unsigned first, unsigned n)
2131 int i;
2133 if (!bmap)
2134 return NULL;
2135 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2136 goto error);
2137 first += isl_basic_map_offset(bmap, type);
2139 for (i = bmap->n_div - 1; i >= 0; --i) {
2140 if (!div_involves_vars(bmap, i, first, n))
2141 continue;
2142 bmap = insert_bounds_on_div(bmap, i);
2143 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
2144 if (!bmap)
2145 return NULL;
2146 i = bmap->n_div;
2149 return bmap;
2150 error:
2151 isl_basic_map_free(bmap);
2152 return NULL;
2155 __isl_give isl_basic_set *isl_basic_set_remove_divs_involving_dims(
2156 __isl_take isl_basic_set *bset,
2157 enum isl_dim_type type, unsigned first, unsigned n)
2159 return isl_basic_map_remove_divs_involving_dims(bset, type, first, n);
2162 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
2163 enum isl_dim_type type, unsigned first, unsigned n)
2165 int i;
2167 if (!map)
2168 return NULL;
2169 if (map->n == 0)
2170 return map;
2172 map = isl_map_cow(map);
2173 if (!map)
2174 return NULL;
2176 for (i = 0; i < map->n; ++i) {
2177 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
2178 type, first, n);
2179 if (!map->p[i])
2180 goto error;
2182 return map;
2183 error:
2184 isl_map_free(map);
2185 return NULL;
2188 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
2189 enum isl_dim_type type, unsigned first, unsigned n)
2191 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
2192 type, first, n);
2195 /* Does the desciption of "bmap" depend on the specified dimensions?
2196 * We also check whether the dimensions appear in any of the div definitions.
2197 * In principle there is no need for this check. If the dimensions appear
2198 * in a div definition, they also appear in the defining constraints of that
2199 * div.
2201 isl_bool isl_basic_map_involves_dims(__isl_keep isl_basic_map *bmap,
2202 enum isl_dim_type type, unsigned first, unsigned n)
2204 int i;
2206 if (!bmap)
2207 return isl_bool_error;
2209 if (first + n > isl_basic_map_dim(bmap, type))
2210 isl_die(bmap->ctx, isl_error_invalid,
2211 "index out of bounds", return isl_bool_error);
2213 first += isl_basic_map_offset(bmap, type);
2214 for (i = 0; i < bmap->n_eq; ++i)
2215 if (isl_seq_first_non_zero(bmap->eq[i] + first, n) >= 0)
2216 return isl_bool_true;
2217 for (i = 0; i < bmap->n_ineq; ++i)
2218 if (isl_seq_first_non_zero(bmap->ineq[i] + first, n) >= 0)
2219 return isl_bool_true;
2220 for (i = 0; i < bmap->n_div; ++i) {
2221 if (isl_int_is_zero(bmap->div[i][0]))
2222 continue;
2223 if (isl_seq_first_non_zero(bmap->div[i] + 1 + first, n) >= 0)
2224 return isl_bool_true;
2227 return isl_bool_false;
2230 isl_bool isl_map_involves_dims(__isl_keep isl_map *map,
2231 enum isl_dim_type type, unsigned first, unsigned n)
2233 int i;
2235 if (!map)
2236 return isl_bool_error;
2238 if (first + n > isl_map_dim(map, type))
2239 isl_die(map->ctx, isl_error_invalid,
2240 "index out of bounds", return isl_bool_error);
2242 for (i = 0; i < map->n; ++i) {
2243 isl_bool involves = isl_basic_map_involves_dims(map->p[i],
2244 type, first, n);
2245 if (involves < 0 || involves)
2246 return involves;
2249 return isl_bool_false;
2252 isl_bool isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
2253 enum isl_dim_type type, unsigned first, unsigned n)
2255 return isl_basic_map_involves_dims(bset, type, first, n);
2258 isl_bool isl_set_involves_dims(__isl_keep isl_set *set,
2259 enum isl_dim_type type, unsigned first, unsigned n)
2261 return isl_map_involves_dims(set, type, first, n);
2264 /* Return true if the definition of the given div is unknown or depends
2265 * on unknown divs.
2267 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
2269 int i;
2270 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
2272 if (isl_int_is_zero(bmap->div[div][0]))
2273 return 1;
2275 for (i = bmap->n_div - 1; i >= 0; --i) {
2276 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
2277 continue;
2278 if (div_is_unknown(bmap, i))
2279 return 1;
2282 return 0;
2285 /* Remove all divs that are unknown or defined in terms of unknown divs.
2287 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
2288 __isl_take isl_basic_map *bmap)
2290 int i;
2292 if (!bmap)
2293 return NULL;
2295 for (i = bmap->n_div - 1; i >= 0; --i) {
2296 if (!div_is_unknown(bmap, i))
2297 continue;
2298 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
2299 if (!bmap)
2300 return NULL;
2301 i = bmap->n_div;
2304 return bmap;
2307 /* Remove all divs that are unknown or defined in terms of unknown divs.
2309 __isl_give isl_basic_set *isl_basic_set_remove_unknown_divs(
2310 __isl_take isl_basic_set *bset)
2312 return isl_basic_map_remove_unknown_divs(bset);
2315 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
2317 int i;
2319 if (!map)
2320 return NULL;
2321 if (map->n == 0)
2322 return map;
2324 map = isl_map_cow(map);
2325 if (!map)
2326 return NULL;
2328 for (i = 0; i < map->n; ++i) {
2329 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
2330 if (!map->p[i])
2331 goto error;
2333 return map;
2334 error:
2335 isl_map_free(map);
2336 return NULL;
2339 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
2341 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
2344 __isl_give isl_basic_set *isl_basic_set_remove_dims(
2345 __isl_take isl_basic_set *bset,
2346 enum isl_dim_type type, unsigned first, unsigned n)
2348 return (isl_basic_set *)
2349 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
2352 struct isl_map *isl_map_remove_dims(struct isl_map *map,
2353 enum isl_dim_type type, unsigned first, unsigned n)
2355 int i;
2357 if (n == 0)
2358 return map;
2360 map = isl_map_cow(map);
2361 if (!map)
2362 return NULL;
2363 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2365 for (i = 0; i < map->n; ++i) {
2366 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
2367 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
2368 if (!map->p[i])
2369 goto error;
2371 map = isl_map_drop(map, type, first, n);
2372 return map;
2373 error:
2374 isl_map_free(map);
2375 return NULL;
2378 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
2379 enum isl_dim_type type, unsigned first, unsigned n)
2381 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
2384 /* Project out n inputs starting at first using Fourier-Motzkin */
2385 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
2386 unsigned first, unsigned n)
2388 return isl_map_remove_dims(map, isl_dim_in, first, n);
2391 static void dump_term(struct isl_basic_map *bmap,
2392 isl_int c, int pos, FILE *out)
2394 const char *name;
2395 unsigned in = isl_basic_map_n_in(bmap);
2396 unsigned dim = in + isl_basic_map_n_out(bmap);
2397 unsigned nparam = isl_basic_map_n_param(bmap);
2398 if (!pos)
2399 isl_int_print(out, c, 0);
2400 else {
2401 if (!isl_int_is_one(c))
2402 isl_int_print(out, c, 0);
2403 if (pos < 1 + nparam) {
2404 name = isl_space_get_dim_name(bmap->dim,
2405 isl_dim_param, pos - 1);
2406 if (name)
2407 fprintf(out, "%s", name);
2408 else
2409 fprintf(out, "p%d", pos - 1);
2410 } else if (pos < 1 + nparam + in)
2411 fprintf(out, "i%d", pos - 1 - nparam);
2412 else if (pos < 1 + nparam + dim)
2413 fprintf(out, "o%d", pos - 1 - nparam - in);
2414 else
2415 fprintf(out, "e%d", pos - 1 - nparam - dim);
2419 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
2420 int sign, FILE *out)
2422 int i;
2423 int first;
2424 unsigned len = 1 + isl_basic_map_total_dim(bmap);
2425 isl_int v;
2427 isl_int_init(v);
2428 for (i = 0, first = 1; i < len; ++i) {
2429 if (isl_int_sgn(c[i]) * sign <= 0)
2430 continue;
2431 if (!first)
2432 fprintf(out, " + ");
2433 first = 0;
2434 isl_int_abs(v, c[i]);
2435 dump_term(bmap, v, i, out);
2437 isl_int_clear(v);
2438 if (first)
2439 fprintf(out, "0");
2442 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
2443 const char *op, FILE *out, int indent)
2445 int i;
2447 fprintf(out, "%*s", indent, "");
2449 dump_constraint_sign(bmap, c, 1, out);
2450 fprintf(out, " %s ", op);
2451 dump_constraint_sign(bmap, c, -1, out);
2453 fprintf(out, "\n");
2455 for (i = bmap->n_div; i < bmap->extra; ++i) {
2456 if (isl_int_is_zero(c[1+isl_space_dim(bmap->dim, isl_dim_all)+i]))
2457 continue;
2458 fprintf(out, "%*s", indent, "");
2459 fprintf(out, "ERROR: unused div coefficient not zero\n");
2460 abort();
2464 static void dump_constraints(struct isl_basic_map *bmap,
2465 isl_int **c, unsigned n,
2466 const char *op, FILE *out, int indent)
2468 int i;
2470 for (i = 0; i < n; ++i)
2471 dump_constraint(bmap, c[i], op, out, indent);
2474 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
2476 int j;
2477 int first = 1;
2478 unsigned total = isl_basic_map_total_dim(bmap);
2480 for (j = 0; j < 1 + total; ++j) {
2481 if (isl_int_is_zero(exp[j]))
2482 continue;
2483 if (!first && isl_int_is_pos(exp[j]))
2484 fprintf(out, "+");
2485 dump_term(bmap, exp[j], j, out);
2486 first = 0;
2490 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
2492 int i;
2494 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
2495 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
2497 for (i = 0; i < bmap->n_div; ++i) {
2498 fprintf(out, "%*s", indent, "");
2499 fprintf(out, "e%d = [(", i);
2500 dump_affine(bmap, bmap->div[i]+1, out);
2501 fprintf(out, ")/");
2502 isl_int_print(out, bmap->div[i][0], 0);
2503 fprintf(out, "]\n");
2507 void isl_basic_set_print_internal(struct isl_basic_set *bset,
2508 FILE *out, int indent)
2510 if (!bset) {
2511 fprintf(out, "null basic set\n");
2512 return;
2515 fprintf(out, "%*s", indent, "");
2516 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2517 bset->ref, bset->dim->nparam, bset->dim->n_out,
2518 bset->extra, bset->flags);
2519 dump((struct isl_basic_map *)bset, out, indent);
2522 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
2523 FILE *out, int indent)
2525 if (!bmap) {
2526 fprintf(out, "null basic map\n");
2527 return;
2530 fprintf(out, "%*s", indent, "");
2531 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2532 "flags: %x, n_name: %d\n",
2533 bmap->ref,
2534 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
2535 bmap->extra, bmap->flags, bmap->dim->n_id);
2536 dump(bmap, out, indent);
2539 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
2541 unsigned total;
2542 if (!bmap)
2543 return -1;
2544 total = isl_basic_map_total_dim(bmap);
2545 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
2546 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
2547 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
2548 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2549 return 0;
2552 __isl_give isl_set *isl_set_alloc_space(__isl_take isl_space *dim, int n,
2553 unsigned flags)
2555 struct isl_set *set;
2557 if (!dim)
2558 return NULL;
2559 isl_assert(dim->ctx, dim->n_in == 0, goto error);
2560 isl_assert(dim->ctx, n >= 0, goto error);
2561 set = isl_alloc(dim->ctx, struct isl_set,
2562 sizeof(struct isl_set) +
2563 (n - 1) * sizeof(struct isl_basic_set *));
2564 if (!set)
2565 goto error;
2567 set->ctx = dim->ctx;
2568 isl_ctx_ref(set->ctx);
2569 set->ref = 1;
2570 set->size = n;
2571 set->n = 0;
2572 set->dim = dim;
2573 set->flags = flags;
2574 return set;
2575 error:
2576 isl_space_free(dim);
2577 return NULL;
2580 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
2581 unsigned nparam, unsigned dim, int n, unsigned flags)
2583 struct isl_set *set;
2584 isl_space *dims;
2586 dims = isl_space_alloc(ctx, nparam, 0, dim);
2587 if (!dims)
2588 return NULL;
2590 set = isl_set_alloc_space(dims, n, flags);
2591 return set;
2594 /* Make sure "map" has room for at least "n" more basic maps.
2596 struct isl_map *isl_map_grow(struct isl_map *map, int n)
2598 int i;
2599 struct isl_map *grown = NULL;
2601 if (!map)
2602 return NULL;
2603 isl_assert(map->ctx, n >= 0, goto error);
2604 if (map->n + n <= map->size)
2605 return map;
2606 grown = isl_map_alloc_space(isl_map_get_space(map), map->n + n, map->flags);
2607 if (!grown)
2608 goto error;
2609 for (i = 0; i < map->n; ++i) {
2610 grown->p[i] = isl_basic_map_copy(map->p[i]);
2611 if (!grown->p[i])
2612 goto error;
2613 grown->n++;
2615 isl_map_free(map);
2616 return grown;
2617 error:
2618 isl_map_free(grown);
2619 isl_map_free(map);
2620 return NULL;
2623 /* Make sure "set" has room for at least "n" more basic sets.
2625 struct isl_set *isl_set_grow(struct isl_set *set, int n)
2627 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
2630 struct isl_set *isl_set_dup(struct isl_set *set)
2632 int i;
2633 struct isl_set *dup;
2635 if (!set)
2636 return NULL;
2638 dup = isl_set_alloc_space(isl_space_copy(set->dim), set->n, set->flags);
2639 if (!dup)
2640 return NULL;
2641 for (i = 0; i < set->n; ++i)
2642 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
2643 return dup;
2646 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
2648 return isl_map_from_basic_map(bset);
2651 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
2653 struct isl_map *map;
2655 if (!bmap)
2656 return NULL;
2658 map = isl_map_alloc_space(isl_space_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
2659 return isl_map_add_basic_map(map, bmap);
2662 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
2663 __isl_take isl_basic_set *bset)
2665 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
2666 (struct isl_basic_map *)bset);
2669 __isl_null isl_set *isl_set_free(__isl_take isl_set *set)
2671 int i;
2673 if (!set)
2674 return NULL;
2676 if (--set->ref > 0)
2677 return NULL;
2679 isl_ctx_deref(set->ctx);
2680 for (i = 0; i < set->n; ++i)
2681 isl_basic_set_free(set->p[i]);
2682 isl_space_free(set->dim);
2683 free(set);
2685 return NULL;
2688 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2690 int i;
2692 if (!set) {
2693 fprintf(out, "null set\n");
2694 return;
2697 fprintf(out, "%*s", indent, "");
2698 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2699 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2700 set->flags);
2701 for (i = 0; i < set->n; ++i) {
2702 fprintf(out, "%*s", indent, "");
2703 fprintf(out, "basic set %d:\n", i);
2704 isl_basic_set_print_internal(set->p[i], out, indent+4);
2708 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2710 int i;
2712 if (!map) {
2713 fprintf(out, "null map\n");
2714 return;
2717 fprintf(out, "%*s", indent, "");
2718 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2719 "flags: %x, n_name: %d\n",
2720 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2721 map->dim->n_out, map->flags, map->dim->n_id);
2722 for (i = 0; i < map->n; ++i) {
2723 fprintf(out, "%*s", indent, "");
2724 fprintf(out, "basic map %d:\n", i);
2725 isl_basic_map_print_internal(map->p[i], out, indent+4);
2729 struct isl_basic_map *isl_basic_map_intersect_domain(
2730 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2732 struct isl_basic_map *bmap_domain;
2734 if (!bmap || !bset)
2735 goto error;
2737 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2738 bset->dim, isl_dim_param), goto error);
2740 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2741 isl_assert(bset->ctx,
2742 isl_basic_map_compatible_domain(bmap, bset), goto error);
2744 bmap = isl_basic_map_cow(bmap);
2745 if (!bmap)
2746 goto error;
2747 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2748 bset->n_div, bset->n_eq, bset->n_ineq);
2749 bmap_domain = isl_basic_map_from_domain(bset);
2750 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2752 bmap = isl_basic_map_simplify(bmap);
2753 return isl_basic_map_finalize(bmap);
2754 error:
2755 isl_basic_map_free(bmap);
2756 isl_basic_set_free(bset);
2757 return NULL;
2760 struct isl_basic_map *isl_basic_map_intersect_range(
2761 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2763 struct isl_basic_map *bmap_range;
2765 if (!bmap || !bset)
2766 goto error;
2768 isl_assert(bset->ctx, isl_space_match(bmap->dim, isl_dim_param,
2769 bset->dim, isl_dim_param), goto error);
2771 if (isl_space_dim(bset->dim, isl_dim_set) != 0)
2772 isl_assert(bset->ctx,
2773 isl_basic_map_compatible_range(bmap, bset), goto error);
2775 if (isl_basic_set_is_universe(bset)) {
2776 isl_basic_set_free(bset);
2777 return bmap;
2780 bmap = isl_basic_map_cow(bmap);
2781 if (!bmap)
2782 goto error;
2783 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
2784 bset->n_div, bset->n_eq, bset->n_ineq);
2785 bmap_range = isl_basic_map_from_basic_set(bset, isl_space_copy(bset->dim));
2786 bmap = add_constraints(bmap, bmap_range, 0, 0);
2788 bmap = isl_basic_map_simplify(bmap);
2789 return isl_basic_map_finalize(bmap);
2790 error:
2791 isl_basic_map_free(bmap);
2792 isl_basic_set_free(bset);
2793 return NULL;
2796 isl_bool isl_basic_map_contains(__isl_keep isl_basic_map *bmap,
2797 __isl_keep isl_vec *vec)
2799 int i;
2800 unsigned total;
2801 isl_int s;
2803 if (!bmap || !vec)
2804 return isl_bool_error;
2806 total = 1 + isl_basic_map_total_dim(bmap);
2807 if (total != vec->size)
2808 return isl_bool_error;
2810 isl_int_init(s);
2812 for (i = 0; i < bmap->n_eq; ++i) {
2813 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2814 if (!isl_int_is_zero(s)) {
2815 isl_int_clear(s);
2816 return isl_bool_false;
2820 for (i = 0; i < bmap->n_ineq; ++i) {
2821 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2822 if (isl_int_is_neg(s)) {
2823 isl_int_clear(s);
2824 return isl_bool_false;
2828 isl_int_clear(s);
2830 return isl_bool_true;
2833 isl_bool isl_basic_set_contains(__isl_keep isl_basic_set *bset,
2834 __isl_keep isl_vec *vec)
2836 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2839 struct isl_basic_map *isl_basic_map_intersect(
2840 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2842 struct isl_vec *sample = NULL;
2844 if (!bmap1 || !bmap2)
2845 goto error;
2847 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
2848 bmap2->dim, isl_dim_param), goto error);
2849 if (isl_space_dim(bmap1->dim, isl_dim_all) ==
2850 isl_space_dim(bmap1->dim, isl_dim_param) &&
2851 isl_space_dim(bmap2->dim, isl_dim_all) !=
2852 isl_space_dim(bmap2->dim, isl_dim_param))
2853 return isl_basic_map_intersect(bmap2, bmap1);
2855 if (isl_space_dim(bmap2->dim, isl_dim_all) !=
2856 isl_space_dim(bmap2->dim, isl_dim_param))
2857 isl_assert(bmap1->ctx,
2858 isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
2860 if (bmap1->sample &&
2861 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2862 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2863 sample = isl_vec_copy(bmap1->sample);
2864 else if (bmap2->sample &&
2865 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2866 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2867 sample = isl_vec_copy(bmap2->sample);
2869 bmap1 = isl_basic_map_cow(bmap1);
2870 if (!bmap1)
2871 goto error;
2872 bmap1 = isl_basic_map_extend_space(bmap1, isl_space_copy(bmap1->dim),
2873 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2874 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2876 if (!bmap1)
2877 isl_vec_free(sample);
2878 else if (sample) {
2879 isl_vec_free(bmap1->sample);
2880 bmap1->sample = sample;
2883 bmap1 = isl_basic_map_simplify(bmap1);
2884 return isl_basic_map_finalize(bmap1);
2885 error:
2886 if (sample)
2887 isl_vec_free(sample);
2888 isl_basic_map_free(bmap1);
2889 isl_basic_map_free(bmap2);
2890 return NULL;
2893 struct isl_basic_set *isl_basic_set_intersect(
2894 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2896 return (struct isl_basic_set *)
2897 isl_basic_map_intersect(
2898 (struct isl_basic_map *)bset1,
2899 (struct isl_basic_map *)bset2);
2902 __isl_give isl_basic_set *isl_basic_set_intersect_params(
2903 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
2905 return isl_basic_set_intersect(bset1, bset2);
2908 /* Special case of isl_map_intersect, where both map1 and map2
2909 * are convex, without any divs and such that either map1 or map2
2910 * contains a single constraint. This constraint is then simply
2911 * added to the other map.
2913 static __isl_give isl_map *map_intersect_add_constraint(
2914 __isl_take isl_map *map1, __isl_take isl_map *map2)
2916 isl_assert(map1->ctx, map1->n == 1, goto error);
2917 isl_assert(map2->ctx, map1->n == 1, goto error);
2918 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2919 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2921 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2922 return isl_map_intersect(map2, map1);
2924 isl_assert(map2->ctx,
2925 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2927 map1 = isl_map_cow(map1);
2928 if (!map1)
2929 goto error;
2930 if (isl_map_plain_is_empty(map1)) {
2931 isl_map_free(map2);
2932 return map1;
2934 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2935 if (map2->p[0]->n_eq == 1)
2936 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2937 else
2938 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2939 map2->p[0]->ineq[0]);
2941 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2942 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2943 if (!map1->p[0])
2944 goto error;
2946 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2947 isl_basic_map_free(map1->p[0]);
2948 map1->n = 0;
2951 isl_map_free(map2);
2953 return map1;
2954 error:
2955 isl_map_free(map1);
2956 isl_map_free(map2);
2957 return NULL;
2960 /* map2 may be either a parameter domain or a map living in the same
2961 * space as map1.
2963 static __isl_give isl_map *map_intersect_internal(__isl_take isl_map *map1,
2964 __isl_take isl_map *map2)
2966 unsigned flags = 0;
2967 isl_map *result;
2968 int i, j;
2970 if (!map1 || !map2)
2971 goto error;
2973 if ((isl_map_plain_is_empty(map1) ||
2974 isl_map_plain_is_universe(map2)) &&
2975 isl_space_is_equal(map1->dim, map2->dim)) {
2976 isl_map_free(map2);
2977 return map1;
2979 if ((isl_map_plain_is_empty(map2) ||
2980 isl_map_plain_is_universe(map1)) &&
2981 isl_space_is_equal(map1->dim, map2->dim)) {
2982 isl_map_free(map1);
2983 return map2;
2986 if (map1->n == 1 && map2->n == 1 &&
2987 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2988 isl_space_is_equal(map1->dim, map2->dim) &&
2989 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2990 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2991 return map_intersect_add_constraint(map1, map2);
2993 if (isl_space_dim(map2->dim, isl_dim_all) !=
2994 isl_space_dim(map2->dim, isl_dim_param))
2995 isl_assert(map1->ctx,
2996 isl_space_is_equal(map1->dim, map2->dim), goto error);
2998 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2999 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
3000 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3002 result = isl_map_alloc_space(isl_space_copy(map1->dim),
3003 map1->n * map2->n, flags);
3004 if (!result)
3005 goto error;
3006 for (i = 0; i < map1->n; ++i)
3007 for (j = 0; j < map2->n; ++j) {
3008 struct isl_basic_map *part;
3009 part = isl_basic_map_intersect(
3010 isl_basic_map_copy(map1->p[i]),
3011 isl_basic_map_copy(map2->p[j]));
3012 if (isl_basic_map_is_empty(part) < 0)
3013 part = isl_basic_map_free(part);
3014 result = isl_map_add_basic_map(result, part);
3015 if (!result)
3016 goto error;
3018 isl_map_free(map1);
3019 isl_map_free(map2);
3020 return result;
3021 error:
3022 isl_map_free(map1);
3023 isl_map_free(map2);
3024 return NULL;
3027 static __isl_give isl_map *map_intersect(__isl_take isl_map *map1,
3028 __isl_take isl_map *map2)
3030 if (!map1 || !map2)
3031 goto error;
3032 if (!isl_space_is_equal(map1->dim, map2->dim))
3033 isl_die(isl_map_get_ctx(map1), isl_error_invalid,
3034 "spaces don't match", goto error);
3035 return map_intersect_internal(map1, map2);
3036 error:
3037 isl_map_free(map1);
3038 isl_map_free(map2);
3039 return NULL;
3042 __isl_give isl_map *isl_map_intersect(__isl_take isl_map *map1,
3043 __isl_take isl_map *map2)
3045 return isl_map_align_params_map_map_and(map1, map2, &map_intersect);
3048 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
3050 return (struct isl_set *)
3051 isl_map_intersect((struct isl_map *)set1,
3052 (struct isl_map *)set2);
3055 /* map_intersect_internal accepts intersections
3056 * with parameter domains, so we can just call that function.
3058 static __isl_give isl_map *map_intersect_params(__isl_take isl_map *map,
3059 __isl_take isl_set *params)
3061 return map_intersect_internal(map, params);
3064 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map1,
3065 __isl_take isl_map *map2)
3067 return isl_map_align_params_map_map_and(map1, map2, &map_intersect_params);
3070 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
3071 __isl_take isl_set *params)
3073 return isl_map_intersect_params(set, params);
3076 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
3078 isl_space *space;
3079 unsigned pos, n1, n2;
3081 if (!bmap)
3082 return NULL;
3083 bmap = isl_basic_map_cow(bmap);
3084 if (!bmap)
3085 return NULL;
3086 space = isl_space_reverse(isl_space_copy(bmap->dim));
3087 pos = isl_basic_map_offset(bmap, isl_dim_in);
3088 n1 = isl_basic_map_dim(bmap, isl_dim_in);
3089 n2 = isl_basic_map_dim(bmap, isl_dim_out);
3090 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
3091 return isl_basic_map_reset_space(bmap, space);
3094 static __isl_give isl_basic_map *basic_map_space_reset(
3095 __isl_take isl_basic_map *bmap, enum isl_dim_type type)
3097 isl_space *space;
3099 if (!bmap)
3100 return NULL;
3101 if (!isl_space_is_named_or_nested(bmap->dim, type))
3102 return bmap;
3104 space = isl_basic_map_get_space(bmap);
3105 space = isl_space_reset(space, type);
3106 bmap = isl_basic_map_reset_space(bmap, space);
3107 return bmap;
3110 __isl_give isl_basic_map *isl_basic_map_insert_dims(
3111 __isl_take isl_basic_map *bmap, enum isl_dim_type type,
3112 unsigned pos, unsigned n)
3114 isl_space *res_dim;
3115 struct isl_basic_map *res;
3116 struct isl_dim_map *dim_map;
3117 unsigned total, off;
3118 enum isl_dim_type t;
3120 if (n == 0)
3121 return basic_map_space_reset(bmap, type);
3123 if (!bmap)
3124 return NULL;
3126 res_dim = isl_space_insert_dims(isl_basic_map_get_space(bmap), type, pos, n);
3128 total = isl_basic_map_total_dim(bmap) + n;
3129 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3130 off = 0;
3131 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3132 if (t != type) {
3133 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3134 } else {
3135 unsigned size = isl_basic_map_dim(bmap, t);
3136 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3137 0, pos, off);
3138 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3139 pos, size - pos, off + pos + n);
3141 off += isl_space_dim(res_dim, t);
3143 isl_dim_map_div(dim_map, bmap, off);
3145 res = isl_basic_map_alloc_space(res_dim,
3146 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3147 if (isl_basic_map_is_rational(bmap))
3148 res = isl_basic_map_set_rational(res);
3149 if (isl_basic_map_plain_is_empty(bmap)) {
3150 isl_basic_map_free(bmap);
3151 free(dim_map);
3152 return isl_basic_map_set_to_empty(res);
3154 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3155 return isl_basic_map_finalize(res);
3158 __isl_give isl_basic_set *isl_basic_set_insert_dims(
3159 __isl_take isl_basic_set *bset,
3160 enum isl_dim_type type, unsigned pos, unsigned n)
3162 return isl_basic_map_insert_dims(bset, type, pos, n);
3165 __isl_give isl_basic_map *isl_basic_map_add_dims(__isl_take isl_basic_map *bmap,
3166 enum isl_dim_type type, unsigned n)
3168 if (!bmap)
3169 return NULL;
3170 return isl_basic_map_insert_dims(bmap, type,
3171 isl_basic_map_dim(bmap, type), n);
3174 __isl_give isl_basic_set *isl_basic_set_add_dims(__isl_take isl_basic_set *bset,
3175 enum isl_dim_type type, unsigned n)
3177 if (!bset)
3178 return NULL;
3179 isl_assert(bset->ctx, type != isl_dim_in, goto error);
3180 return isl_basic_map_add_dims(bset, type, n);
3181 error:
3182 isl_basic_set_free(bset);
3183 return NULL;
3186 static __isl_give isl_map *map_space_reset(__isl_take isl_map *map,
3187 enum isl_dim_type type)
3189 isl_space *space;
3191 if (!map || !isl_space_is_named_or_nested(map->dim, type))
3192 return map;
3194 space = isl_map_get_space(map);
3195 space = isl_space_reset(space, type);
3196 map = isl_map_reset_space(map, space);
3197 return map;
3200 __isl_give isl_map *isl_map_insert_dims(__isl_take isl_map *map,
3201 enum isl_dim_type type, unsigned pos, unsigned n)
3203 int i;
3205 if (n == 0)
3206 return map_space_reset(map, type);
3208 map = isl_map_cow(map);
3209 if (!map)
3210 return NULL;
3212 map->dim = isl_space_insert_dims(map->dim, type, pos, n);
3213 if (!map->dim)
3214 goto error;
3216 for (i = 0; i < map->n; ++i) {
3217 map->p[i] = isl_basic_map_insert_dims(map->p[i], type, pos, n);
3218 if (!map->p[i])
3219 goto error;
3222 return map;
3223 error:
3224 isl_map_free(map);
3225 return NULL;
3228 __isl_give isl_set *isl_set_insert_dims(__isl_take isl_set *set,
3229 enum isl_dim_type type, unsigned pos, unsigned n)
3231 return isl_map_insert_dims(set, type, pos, n);
3234 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
3235 enum isl_dim_type type, unsigned n)
3237 if (!map)
3238 return NULL;
3239 return isl_map_insert_dims(map, type, isl_map_dim(map, type), n);
3242 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
3243 enum isl_dim_type type, unsigned n)
3245 if (!set)
3246 return NULL;
3247 isl_assert(set->ctx, type != isl_dim_in, goto error);
3248 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
3249 error:
3250 isl_set_free(set);
3251 return NULL;
3254 __isl_give isl_basic_map *isl_basic_map_move_dims(
3255 __isl_take isl_basic_map *bmap,
3256 enum isl_dim_type dst_type, unsigned dst_pos,
3257 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3259 struct isl_dim_map *dim_map;
3260 struct isl_basic_map *res;
3261 enum isl_dim_type t;
3262 unsigned total, off;
3264 if (!bmap)
3265 return NULL;
3266 if (n == 0)
3267 return bmap;
3269 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
3270 goto error);
3272 if (dst_type == src_type && dst_pos == src_pos)
3273 return bmap;
3275 isl_assert(bmap->ctx, dst_type != src_type, goto error);
3277 if (pos(bmap->dim, dst_type) + dst_pos ==
3278 pos(bmap->dim, src_type) + src_pos +
3279 ((src_type < dst_type) ? n : 0)) {
3280 bmap = isl_basic_map_cow(bmap);
3281 if (!bmap)
3282 return NULL;
3284 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
3285 src_type, src_pos, n);
3286 if (!bmap->dim)
3287 goto error;
3289 bmap = isl_basic_map_finalize(bmap);
3291 return bmap;
3294 total = isl_basic_map_total_dim(bmap);
3295 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3297 off = 0;
3298 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3299 unsigned size = isl_space_dim(bmap->dim, t);
3300 if (t == dst_type) {
3301 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3302 0, dst_pos, off);
3303 off += dst_pos;
3304 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
3305 src_pos, n, off);
3306 off += n;
3307 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3308 dst_pos, size - dst_pos, off);
3309 off += size - dst_pos;
3310 } else if (t == src_type) {
3311 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3312 0, src_pos, off);
3313 off += src_pos;
3314 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3315 src_pos + n, size - src_pos - n, off);
3316 off += size - src_pos - n;
3317 } else {
3318 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3319 off += size;
3322 isl_dim_map_div(dim_map, bmap, off);
3324 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
3325 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3326 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3327 if (!bmap)
3328 goto error;
3330 bmap->dim = isl_space_move_dims(bmap->dim, dst_type, dst_pos,
3331 src_type, src_pos, n);
3332 if (!bmap->dim)
3333 goto error;
3335 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
3336 bmap = isl_basic_map_gauss(bmap, NULL);
3337 bmap = isl_basic_map_finalize(bmap);
3339 return bmap;
3340 error:
3341 isl_basic_map_free(bmap);
3342 return NULL;
3345 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
3346 enum isl_dim_type dst_type, unsigned dst_pos,
3347 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3349 return (isl_basic_set *)isl_basic_map_move_dims(
3350 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
3353 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
3354 enum isl_dim_type dst_type, unsigned dst_pos,
3355 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3357 if (!set)
3358 return NULL;
3359 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
3360 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
3361 src_type, src_pos, n);
3362 error:
3363 isl_set_free(set);
3364 return NULL;
3367 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
3368 enum isl_dim_type dst_type, unsigned dst_pos,
3369 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
3371 int i;
3373 if (!map)
3374 return NULL;
3375 if (n == 0)
3376 return map;
3378 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
3379 goto error);
3381 if (dst_type == src_type && dst_pos == src_pos)
3382 return map;
3384 isl_assert(map->ctx, dst_type != src_type, goto error);
3386 map = isl_map_cow(map);
3387 if (!map)
3388 return NULL;
3390 map->dim = isl_space_move_dims(map->dim, dst_type, dst_pos, src_type, src_pos, n);
3391 if (!map->dim)
3392 goto error;
3394 for (i = 0; i < map->n; ++i) {
3395 map->p[i] = isl_basic_map_move_dims(map->p[i],
3396 dst_type, dst_pos,
3397 src_type, src_pos, n);
3398 if (!map->p[i])
3399 goto error;
3402 return map;
3403 error:
3404 isl_map_free(map);
3405 return NULL;
3408 /* Move the specified dimensions to the last columns right before
3409 * the divs. Don't change the dimension specification of bmap.
3410 * That's the responsibility of the caller.
3412 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
3413 enum isl_dim_type type, unsigned first, unsigned n)
3415 struct isl_dim_map *dim_map;
3416 struct isl_basic_map *res;
3417 enum isl_dim_type t;
3418 unsigned total, off;
3420 if (!bmap)
3421 return NULL;
3422 if (pos(bmap->dim, type) + first + n ==
3423 1 + isl_space_dim(bmap->dim, isl_dim_all))
3424 return bmap;
3426 total = isl_basic_map_total_dim(bmap);
3427 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3429 off = 0;
3430 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
3431 unsigned size = isl_space_dim(bmap->dim, t);
3432 if (t == type) {
3433 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3434 0, first, off);
3435 off += first;
3436 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3437 first, n, total - bmap->n_div - n);
3438 isl_dim_map_dim_range(dim_map, bmap->dim, t,
3439 first + n, size - (first + n), off);
3440 off += size - (first + n);
3441 } else {
3442 isl_dim_map_dim(dim_map, bmap->dim, t, off);
3443 off += size;
3446 isl_dim_map_div(dim_map, bmap, off + n);
3448 res = isl_basic_map_alloc_space(isl_basic_map_get_space(bmap),
3449 bmap->n_div, bmap->n_eq, bmap->n_ineq);
3450 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
3451 return res;
3454 /* Insert "n" rows in the divs of "bmap".
3456 * The number of columns is not changed, which means that the last
3457 * dimensions of "bmap" are being reintepreted as the new divs.
3458 * The space of "bmap" is not adjusted, however, which means
3459 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
3460 * from the space of "bmap" is the responsibility of the caller.
3462 static __isl_give isl_basic_map *insert_div_rows(__isl_take isl_basic_map *bmap,
3463 int n)
3465 int i;
3466 size_t row_size;
3467 isl_int **new_div;
3468 isl_int *old;
3470 bmap = isl_basic_map_cow(bmap);
3471 if (!bmap)
3472 return NULL;
3474 row_size = 1 + isl_space_dim(bmap->dim, isl_dim_all) + bmap->extra;
3475 old = bmap->block2.data;
3476 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
3477 (bmap->extra + n) * (1 + row_size));
3478 if (!bmap->block2.data)
3479 return isl_basic_map_free(bmap);
3480 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
3481 if (!new_div)
3482 return isl_basic_map_free(bmap);
3483 for (i = 0; i < n; ++i) {
3484 new_div[i] = bmap->block2.data +
3485 (bmap->extra + i) * (1 + row_size);
3486 isl_seq_clr(new_div[i], 1 + row_size);
3488 for (i = 0; i < bmap->extra; ++i)
3489 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
3490 free(bmap->div);
3491 bmap->div = new_div;
3492 bmap->n_div += n;
3493 bmap->extra += n;
3495 return bmap;
3498 /* Turn the n dimensions of type type, starting at first
3499 * into existentially quantified variables.
3501 __isl_give isl_basic_map *isl_basic_map_project_out(
3502 __isl_take isl_basic_map *bmap,
3503 enum isl_dim_type type, unsigned first, unsigned n)
3505 if (n == 0)
3506 return basic_map_space_reset(bmap, type);
3508 if (!bmap)
3509 return NULL;
3511 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
3512 return isl_basic_map_remove_dims(bmap, type, first, n);
3514 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
3515 goto error);
3517 bmap = move_last(bmap, type, first, n);
3518 bmap = isl_basic_map_cow(bmap);
3519 bmap = insert_div_rows(bmap, n);
3520 if (!bmap)
3521 return NULL;
3523 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
3524 if (!bmap->dim)
3525 goto error;
3526 bmap = isl_basic_map_simplify(bmap);
3527 bmap = isl_basic_map_drop_redundant_divs(bmap);
3528 return isl_basic_map_finalize(bmap);
3529 error:
3530 isl_basic_map_free(bmap);
3531 return NULL;
3534 /* Turn the n dimensions of type type, starting at first
3535 * into existentially quantified variables.
3537 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
3538 enum isl_dim_type type, unsigned first, unsigned n)
3540 return (isl_basic_set *)isl_basic_map_project_out(
3541 (isl_basic_map *)bset, type, first, n);
3544 /* Turn the n dimensions of type type, starting at first
3545 * into existentially quantified variables.
3547 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
3548 enum isl_dim_type type, unsigned first, unsigned n)
3550 int i;
3552 if (!map)
3553 return NULL;
3555 if (n == 0)
3556 return map_space_reset(map, type);
3558 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
3560 map = isl_map_cow(map);
3561 if (!map)
3562 return NULL;
3564 map->dim = isl_space_drop_dims(map->dim, type, first, n);
3565 if (!map->dim)
3566 goto error;
3568 for (i = 0; i < map->n; ++i) {
3569 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
3570 if (!map->p[i])
3571 goto error;
3574 return map;
3575 error:
3576 isl_map_free(map);
3577 return NULL;
3580 /* Turn the n dimensions of type type, starting at first
3581 * into existentially quantified variables.
3583 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
3584 enum isl_dim_type type, unsigned first, unsigned n)
3586 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
3589 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
3591 int i, j;
3593 for (i = 0; i < n; ++i) {
3594 j = isl_basic_map_alloc_div(bmap);
3595 if (j < 0)
3596 goto error;
3597 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
3599 return bmap;
3600 error:
3601 isl_basic_map_free(bmap);
3602 return NULL;
3605 struct isl_basic_map *isl_basic_map_apply_range(
3606 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3608 isl_space *dim_result = NULL;
3609 struct isl_basic_map *bmap;
3610 unsigned n_in, n_out, n, nparam, total, pos;
3611 struct isl_dim_map *dim_map1, *dim_map2;
3613 if (!bmap1 || !bmap2)
3614 goto error;
3615 if (!isl_space_match(bmap1->dim, isl_dim_param,
3616 bmap2->dim, isl_dim_param))
3617 isl_die(isl_basic_map_get_ctx(bmap1), isl_error_invalid,
3618 "parameters don't match", goto error);
3619 if (!isl_space_tuple_is_equal(bmap1->dim, isl_dim_out,
3620 bmap2->dim, isl_dim_in))
3621 isl_die(isl_basic_map_get_ctx(bmap1), isl_error_invalid,
3622 "spaces don't match", goto error);
3624 dim_result = isl_space_join(isl_space_copy(bmap1->dim),
3625 isl_space_copy(bmap2->dim));
3627 n_in = isl_basic_map_n_in(bmap1);
3628 n_out = isl_basic_map_n_out(bmap2);
3629 n = isl_basic_map_n_out(bmap1);
3630 nparam = isl_basic_map_n_param(bmap1);
3632 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
3633 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3634 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
3635 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3636 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
3637 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3638 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
3639 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
3640 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3641 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3642 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3644 bmap = isl_basic_map_alloc_space(dim_result,
3645 bmap1->n_div + bmap2->n_div + n,
3646 bmap1->n_eq + bmap2->n_eq,
3647 bmap1->n_ineq + bmap2->n_ineq);
3648 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3649 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3650 bmap = add_divs(bmap, n);
3651 bmap = isl_basic_map_simplify(bmap);
3652 bmap = isl_basic_map_drop_redundant_divs(bmap);
3653 return isl_basic_map_finalize(bmap);
3654 error:
3655 isl_basic_map_free(bmap1);
3656 isl_basic_map_free(bmap2);
3657 return NULL;
3660 struct isl_basic_set *isl_basic_set_apply(
3661 struct isl_basic_set *bset, struct isl_basic_map *bmap)
3663 if (!bset || !bmap)
3664 goto error;
3666 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
3667 goto error);
3669 return (struct isl_basic_set *)
3670 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
3671 error:
3672 isl_basic_set_free(bset);
3673 isl_basic_map_free(bmap);
3674 return NULL;
3677 struct isl_basic_map *isl_basic_map_apply_domain(
3678 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3680 if (!bmap1 || !bmap2)
3681 goto error;
3683 isl_assert(bmap1->ctx,
3684 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
3685 isl_assert(bmap1->ctx,
3686 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
3687 goto error);
3689 bmap1 = isl_basic_map_reverse(bmap1);
3690 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
3691 return isl_basic_map_reverse(bmap1);
3692 error:
3693 isl_basic_map_free(bmap1);
3694 isl_basic_map_free(bmap2);
3695 return NULL;
3698 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3699 * A \cap B -> f(A) + f(B)
3701 struct isl_basic_map *isl_basic_map_sum(
3702 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3704 unsigned n_in, n_out, nparam, total, pos;
3705 struct isl_basic_map *bmap = NULL;
3706 struct isl_dim_map *dim_map1, *dim_map2;
3707 int i;
3709 if (!bmap1 || !bmap2)
3710 goto error;
3712 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
3713 goto error);
3715 nparam = isl_basic_map_n_param(bmap1);
3716 n_in = isl_basic_map_n_in(bmap1);
3717 n_out = isl_basic_map_n_out(bmap1);
3719 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
3720 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
3721 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
3722 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
3723 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
3724 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
3725 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
3726 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
3727 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
3728 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
3729 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
3731 bmap = isl_basic_map_alloc_space(isl_space_copy(bmap1->dim),
3732 bmap1->n_div + bmap2->n_div + 2 * n_out,
3733 bmap1->n_eq + bmap2->n_eq + n_out,
3734 bmap1->n_ineq + bmap2->n_ineq);
3735 for (i = 0; i < n_out; ++i) {
3736 int j = isl_basic_map_alloc_equality(bmap);
3737 if (j < 0)
3738 goto error;
3739 isl_seq_clr(bmap->eq[j], 1+total);
3740 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
3741 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
3742 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
3744 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
3745 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
3746 bmap = add_divs(bmap, 2 * n_out);
3748 bmap = isl_basic_map_simplify(bmap);
3749 return isl_basic_map_finalize(bmap);
3750 error:
3751 isl_basic_map_free(bmap);
3752 isl_basic_map_free(bmap1);
3753 isl_basic_map_free(bmap2);
3754 return NULL;
3757 /* Given two maps A -> f(A) and B -> g(B), construct a map
3758 * A \cap B -> f(A) + f(B)
3760 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
3762 struct isl_map *result;
3763 int i, j;
3765 if (!map1 || !map2)
3766 goto error;
3768 isl_assert(map1->ctx, isl_space_is_equal(map1->dim, map2->dim), goto error);
3770 result = isl_map_alloc_space(isl_space_copy(map1->dim),
3771 map1->n * map2->n, 0);
3772 if (!result)
3773 goto error;
3774 for (i = 0; i < map1->n; ++i)
3775 for (j = 0; j < map2->n; ++j) {
3776 struct isl_basic_map *part;
3777 part = isl_basic_map_sum(
3778 isl_basic_map_copy(map1->p[i]),
3779 isl_basic_map_copy(map2->p[j]));
3780 if (isl_basic_map_is_empty(part))
3781 isl_basic_map_free(part);
3782 else
3783 result = isl_map_add_basic_map(result, part);
3784 if (!result)
3785 goto error;
3787 isl_map_free(map1);
3788 isl_map_free(map2);
3789 return result;
3790 error:
3791 isl_map_free(map1);
3792 isl_map_free(map2);
3793 return NULL;
3796 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3797 __isl_take isl_set *set2)
3799 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3802 /* Given a basic map A -> f(A), construct A -> -f(A).
3804 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3806 int i, j;
3807 unsigned off, n;
3809 bmap = isl_basic_map_cow(bmap);
3810 if (!bmap)
3811 return NULL;
3813 n = isl_basic_map_dim(bmap, isl_dim_out);
3814 off = isl_basic_map_offset(bmap, isl_dim_out);
3815 for (i = 0; i < bmap->n_eq; ++i)
3816 for (j = 0; j < n; ++j)
3817 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3818 for (i = 0; i < bmap->n_ineq; ++i)
3819 for (j = 0; j < n; ++j)
3820 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3821 for (i = 0; i < bmap->n_div; ++i)
3822 for (j = 0; j < n; ++j)
3823 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3824 bmap = isl_basic_map_gauss(bmap, NULL);
3825 return isl_basic_map_finalize(bmap);
3828 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3830 return isl_basic_map_neg(bset);
3833 /* Given a map A -> f(A), construct A -> -f(A).
3835 struct isl_map *isl_map_neg(struct isl_map *map)
3837 int i;
3839 map = isl_map_cow(map);
3840 if (!map)
3841 return NULL;
3843 for (i = 0; i < map->n; ++i) {
3844 map->p[i] = isl_basic_map_neg(map->p[i]);
3845 if (!map->p[i])
3846 goto error;
3849 return map;
3850 error:
3851 isl_map_free(map);
3852 return NULL;
3855 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3857 return (isl_set *)isl_map_neg((isl_map *)set);
3860 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3861 * A -> floor(f(A)/d).
3863 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3864 isl_int d)
3866 unsigned n_in, n_out, nparam, total, pos;
3867 struct isl_basic_map *result = NULL;
3868 struct isl_dim_map *dim_map;
3869 int i;
3871 if (!bmap)
3872 return NULL;
3874 nparam = isl_basic_map_n_param(bmap);
3875 n_in = isl_basic_map_n_in(bmap);
3876 n_out = isl_basic_map_n_out(bmap);
3878 total = nparam + n_in + n_out + bmap->n_div + n_out;
3879 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3880 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3881 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3882 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3883 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3885 result = isl_basic_map_alloc_space(isl_space_copy(bmap->dim),
3886 bmap->n_div + n_out,
3887 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3888 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3889 result = add_divs(result, n_out);
3890 for (i = 0; i < n_out; ++i) {
3891 int j;
3892 j = isl_basic_map_alloc_inequality(result);
3893 if (j < 0)
3894 goto error;
3895 isl_seq_clr(result->ineq[j], 1+total);
3896 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3897 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3898 j = isl_basic_map_alloc_inequality(result);
3899 if (j < 0)
3900 goto error;
3901 isl_seq_clr(result->ineq[j], 1+total);
3902 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3903 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3904 isl_int_sub_ui(result->ineq[j][0], d, 1);
3907 result = isl_basic_map_simplify(result);
3908 return isl_basic_map_finalize(result);
3909 error:
3910 isl_basic_map_free(result);
3911 return NULL;
3914 /* Given a map A -> f(A) and an integer d, construct a map
3915 * A -> floor(f(A)/d).
3917 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3919 int i;
3921 map = isl_map_cow(map);
3922 if (!map)
3923 return NULL;
3925 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3926 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3927 for (i = 0; i < map->n; ++i) {
3928 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3929 if (!map->p[i])
3930 goto error;
3933 return map;
3934 error:
3935 isl_map_free(map);
3936 return NULL;
3939 /* Given a map A -> f(A) and an integer d, construct a map
3940 * A -> floor(f(A)/d).
3942 __isl_give isl_map *isl_map_floordiv_val(__isl_take isl_map *map,
3943 __isl_take isl_val *d)
3945 if (!map || !d)
3946 goto error;
3947 if (!isl_val_is_int(d))
3948 isl_die(isl_val_get_ctx(d), isl_error_invalid,
3949 "expecting integer denominator", goto error);
3950 map = isl_map_floordiv(map, d->n);
3951 isl_val_free(d);
3952 return map;
3953 error:
3954 isl_map_free(map);
3955 isl_val_free(d);
3956 return NULL;
3959 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3961 int i;
3962 unsigned nparam;
3963 unsigned n_in;
3965 i = isl_basic_map_alloc_equality(bmap);
3966 if (i < 0)
3967 goto error;
3968 nparam = isl_basic_map_n_param(bmap);
3969 n_in = isl_basic_map_n_in(bmap);
3970 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3971 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3972 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3973 return isl_basic_map_finalize(bmap);
3974 error:
3975 isl_basic_map_free(bmap);
3976 return NULL;
3979 /* Add a constraints to "bmap" expressing i_pos < o_pos
3981 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3983 int i;
3984 unsigned nparam;
3985 unsigned n_in;
3987 i = isl_basic_map_alloc_inequality(bmap);
3988 if (i < 0)
3989 goto error;
3990 nparam = isl_basic_map_n_param(bmap);
3991 n_in = isl_basic_map_n_in(bmap);
3992 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3993 isl_int_set_si(bmap->ineq[i][0], -1);
3994 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3995 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3996 return isl_basic_map_finalize(bmap);
3997 error:
3998 isl_basic_map_free(bmap);
3999 return NULL;
4002 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4004 static __isl_give isl_basic_map *var_less_or_equal(
4005 __isl_take isl_basic_map *bmap, unsigned pos)
4007 int i;
4008 unsigned nparam;
4009 unsigned n_in;
4011 i = isl_basic_map_alloc_inequality(bmap);
4012 if (i < 0)
4013 goto error;
4014 nparam = isl_basic_map_n_param(bmap);
4015 n_in = isl_basic_map_n_in(bmap);
4016 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
4017 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
4018 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
4019 return isl_basic_map_finalize(bmap);
4020 error:
4021 isl_basic_map_free(bmap);
4022 return NULL;
4025 /* Add a constraints to "bmap" expressing i_pos > o_pos
4027 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
4029 int i;
4030 unsigned nparam;
4031 unsigned n_in;
4033 i = isl_basic_map_alloc_inequality(bmap);
4034 if (i < 0)
4035 goto error;
4036 nparam = isl_basic_map_n_param(bmap);
4037 n_in = isl_basic_map_n_in(bmap);
4038 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
4039 isl_int_set_si(bmap->ineq[i][0], -1);
4040 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
4041 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
4042 return isl_basic_map_finalize(bmap);
4043 error:
4044 isl_basic_map_free(bmap);
4045 return NULL;
4048 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4050 static __isl_give isl_basic_map *var_more_or_equal(
4051 __isl_take isl_basic_map *bmap, unsigned pos)
4053 int i;
4054 unsigned nparam;
4055 unsigned n_in;
4057 i = isl_basic_map_alloc_inequality(bmap);
4058 if (i < 0)
4059 goto error;
4060 nparam = isl_basic_map_n_param(bmap);
4061 n_in = isl_basic_map_n_in(bmap);
4062 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
4063 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
4064 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
4065 return isl_basic_map_finalize(bmap);
4066 error:
4067 isl_basic_map_free(bmap);
4068 return NULL;
4071 __isl_give isl_basic_map *isl_basic_map_equal(
4072 __isl_take isl_space *dim, unsigned n_equal)
4074 int i;
4075 struct isl_basic_map *bmap;
4076 bmap = isl_basic_map_alloc_space(dim, 0, n_equal, 0);
4077 if (!bmap)
4078 return NULL;
4079 for (i = 0; i < n_equal && bmap; ++i)
4080 bmap = var_equal(bmap, i);
4081 return isl_basic_map_finalize(bmap);
4084 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4086 __isl_give isl_basic_map *isl_basic_map_less_at(__isl_take isl_space *dim,
4087 unsigned pos)
4089 int i;
4090 struct isl_basic_map *bmap;
4091 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
4092 if (!bmap)
4093 return NULL;
4094 for (i = 0; i < pos && bmap; ++i)
4095 bmap = var_equal(bmap, i);
4096 if (bmap)
4097 bmap = var_less(bmap, pos);
4098 return isl_basic_map_finalize(bmap);
4101 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
4103 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
4104 __isl_take isl_space *dim, unsigned pos)
4106 int i;
4107 isl_basic_map *bmap;
4109 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
4110 for (i = 0; i < pos; ++i)
4111 bmap = var_equal(bmap, i);
4112 bmap = var_less_or_equal(bmap, pos);
4113 return isl_basic_map_finalize(bmap);
4116 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
4118 __isl_give isl_basic_map *isl_basic_map_more_at(__isl_take isl_space *dim,
4119 unsigned pos)
4121 int i;
4122 struct isl_basic_map *bmap;
4123 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
4124 if (!bmap)
4125 return NULL;
4126 for (i = 0; i < pos && bmap; ++i)
4127 bmap = var_equal(bmap, i);
4128 if (bmap)
4129 bmap = var_more(bmap, pos);
4130 return isl_basic_map_finalize(bmap);
4133 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
4135 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
4136 __isl_take isl_space *dim, unsigned pos)
4138 int i;
4139 isl_basic_map *bmap;
4141 bmap = isl_basic_map_alloc_space(dim, 0, pos, 1);
4142 for (i = 0; i < pos; ++i)
4143 bmap = var_equal(bmap, i);
4144 bmap = var_more_or_equal(bmap, pos);
4145 return isl_basic_map_finalize(bmap);
4148 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_space *dims,
4149 unsigned n, int equal)
4151 struct isl_map *map;
4152 int i;
4154 if (n == 0 && equal)
4155 return isl_map_universe(dims);
4157 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
4159 for (i = 0; i + 1 < n; ++i)
4160 map = isl_map_add_basic_map(map,
4161 isl_basic_map_less_at(isl_space_copy(dims), i));
4162 if (n > 0) {
4163 if (equal)
4164 map = isl_map_add_basic_map(map,
4165 isl_basic_map_less_or_equal_at(dims, n - 1));
4166 else
4167 map = isl_map_add_basic_map(map,
4168 isl_basic_map_less_at(dims, n - 1));
4169 } else
4170 isl_space_free(dims);
4172 return map;
4175 static __isl_give isl_map *map_lex_lte(__isl_take isl_space *dims, int equal)
4177 if (!dims)
4178 return NULL;
4179 return map_lex_lte_first(dims, dims->n_out, equal);
4182 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_space *dim, unsigned n)
4184 return map_lex_lte_first(dim, n, 0);
4187 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_space *dim, unsigned n)
4189 return map_lex_lte_first(dim, n, 1);
4192 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_space *set_dim)
4194 return map_lex_lte(isl_space_map_from_set(set_dim), 0);
4197 __isl_give isl_map *isl_map_lex_le(__isl_take isl_space *set_dim)
4199 return map_lex_lte(isl_space_map_from_set(set_dim), 1);
4202 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_space *dims,
4203 unsigned n, int equal)
4205 struct isl_map *map;
4206 int i;
4208 if (n == 0 && equal)
4209 return isl_map_universe(dims);
4211 map = isl_map_alloc_space(isl_space_copy(dims), n, ISL_MAP_DISJOINT);
4213 for (i = 0; i + 1 < n; ++i)
4214 map = isl_map_add_basic_map(map,
4215 isl_basic_map_more_at(isl_space_copy(dims), i));
4216 if (n > 0) {
4217 if (equal)
4218 map = isl_map_add_basic_map(map,
4219 isl_basic_map_more_or_equal_at(dims, n - 1));
4220 else
4221 map = isl_map_add_basic_map(map,
4222 isl_basic_map_more_at(dims, n - 1));
4223 } else
4224 isl_space_free(dims);
4226 return map;
4229 static __isl_give isl_map *map_lex_gte(__isl_take isl_space *dims, int equal)
4231 if (!dims)
4232 return NULL;
4233 return map_lex_gte_first(dims, dims->n_out, equal);
4236 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_space *dim, unsigned n)
4238 return map_lex_gte_first(dim, n, 0);
4241 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_space *dim, unsigned n)
4243 return map_lex_gte_first(dim, n, 1);
4246 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_space *set_dim)
4248 return map_lex_gte(isl_space_map_from_set(set_dim), 0);
4251 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_space *set_dim)
4253 return map_lex_gte(isl_space_map_from_set(set_dim), 1);
4256 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
4257 __isl_take isl_set *set2)
4259 isl_map *map;
4260 map = isl_map_lex_le(isl_set_get_space(set1));
4261 map = isl_map_intersect_domain(map, set1);
4262 map = isl_map_intersect_range(map, set2);
4263 return map;
4266 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
4267 __isl_take isl_set *set2)
4269 isl_map *map;
4270 map = isl_map_lex_lt(isl_set_get_space(set1));
4271 map = isl_map_intersect_domain(map, set1);
4272 map = isl_map_intersect_range(map, set2);
4273 return map;
4276 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
4277 __isl_take isl_set *set2)
4279 isl_map *map;
4280 map = isl_map_lex_ge(isl_set_get_space(set1));
4281 map = isl_map_intersect_domain(map, set1);
4282 map = isl_map_intersect_range(map, set2);
4283 return map;
4286 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
4287 __isl_take isl_set *set2)
4289 isl_map *map;
4290 map = isl_map_lex_gt(isl_set_get_space(set1));
4291 map = isl_map_intersect_domain(map, set1);
4292 map = isl_map_intersect_range(map, set2);
4293 return map;
4296 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
4297 __isl_take isl_map *map2)
4299 isl_map *map;
4300 map = isl_map_lex_le(isl_space_range(isl_map_get_space(map1)));
4301 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4302 map = isl_map_apply_range(map, isl_map_reverse(map2));
4303 return map;
4306 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
4307 __isl_take isl_map *map2)
4309 isl_map *map;
4310 map = isl_map_lex_lt(isl_space_range(isl_map_get_space(map1)));
4311 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4312 map = isl_map_apply_range(map, isl_map_reverse(map2));
4313 return map;
4316 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
4317 __isl_take isl_map *map2)
4319 isl_map *map;
4320 map = isl_map_lex_ge(isl_space_range(isl_map_get_space(map1)));
4321 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4322 map = isl_map_apply_range(map, isl_map_reverse(map2));
4323 return map;
4326 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
4327 __isl_take isl_map *map2)
4329 isl_map *map;
4330 map = isl_map_lex_gt(isl_space_range(isl_map_get_space(map1)));
4331 map = isl_map_apply_domain(map, isl_map_reverse(map1));
4332 map = isl_map_apply_range(map, isl_map_reverse(map2));
4333 return map;
4336 __isl_give isl_basic_map *isl_basic_map_from_basic_set(
4337 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4339 struct isl_basic_map *bmap;
4341 bset = isl_basic_set_cow(bset);
4342 if (!bset || !dim)
4343 goto error;
4345 isl_assert(bset->ctx, isl_space_compatible(bset->dim, dim), goto error);
4346 isl_space_free(bset->dim);
4347 bmap = (struct isl_basic_map *) bset;
4348 bmap->dim = dim;
4349 return isl_basic_map_finalize(bmap);
4350 error:
4351 isl_basic_set_free(bset);
4352 isl_space_free(dim);
4353 return NULL;
4356 /* For a div d = floor(f/m), add the constraint
4358 * f - m d >= 0
4360 static int add_upper_div_constraint(__isl_keep isl_basic_map *bmap,
4361 unsigned pos, isl_int *div)
4363 int i;
4364 unsigned total = isl_basic_map_total_dim(bmap);
4366 i = isl_basic_map_alloc_inequality(bmap);
4367 if (i < 0)
4368 return -1;
4369 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
4370 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
4372 return 0;
4375 /* For a div d = floor(f/m), add the constraint
4377 * -(f-(n-1)) + m d >= 0
4379 static int add_lower_div_constraint(__isl_keep isl_basic_map *bmap,
4380 unsigned pos, isl_int *div)
4382 int i;
4383 unsigned total = isl_basic_map_total_dim(bmap);
4385 i = isl_basic_map_alloc_inequality(bmap);
4386 if (i < 0)
4387 return -1;
4388 isl_seq_neg(bmap->ineq[i], div + 1, 1 + total);
4389 isl_int_set(bmap->ineq[i][1 + pos], div[0]);
4390 isl_int_add(bmap->ineq[i][0], bmap->ineq[i][0], bmap->ineq[i][1 + pos]);
4391 isl_int_sub_ui(bmap->ineq[i][0], bmap->ineq[i][0], 1);
4393 return 0;
4396 /* For a div d = floor(f/m), add the constraints
4398 * f - m d >= 0
4399 * -(f-(n-1)) + m d >= 0
4401 * Note that the second constraint is the negation of
4403 * f - m d >= n
4405 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
4406 unsigned pos, isl_int *div)
4408 if (add_upper_div_constraint(bmap, pos, div) < 0)
4409 return -1;
4410 if (add_lower_div_constraint(bmap, pos, div) < 0)
4411 return -1;
4412 return 0;
4415 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
4416 unsigned pos, isl_int *div)
4418 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
4419 pos, div);
4422 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
4424 unsigned total = isl_basic_map_total_dim(bmap);
4425 unsigned div_pos = total - bmap->n_div + div;
4427 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
4428 bmap->div[div]);
4431 /* For each known div d = floor(f/m), add the constraints
4433 * f - m d >= 0
4434 * -(f-(n-1)) + m d >= 0
4436 __isl_give isl_basic_map *isl_basic_map_add_known_div_constraints(
4437 __isl_take isl_basic_map *bmap)
4439 int i;
4440 unsigned n_div;
4442 if (!bmap)
4443 return NULL;
4444 n_div = isl_basic_map_dim(bmap, isl_dim_div);
4445 if (n_div == 0)
4446 return bmap;
4447 bmap = isl_basic_map_cow(bmap);
4448 bmap = isl_basic_map_extend_constraints(bmap, 0, 2 * n_div);
4449 if (!bmap)
4450 return NULL;
4451 for (i = 0; i < n_div; ++i) {
4452 if (isl_int_is_zero(bmap->div[i][0]))
4453 continue;
4454 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
4455 return isl_basic_map_free(bmap);
4458 bmap = isl_basic_map_remove_duplicate_constraints(bmap, NULL, 0);
4459 bmap = isl_basic_map_finalize(bmap);
4460 return bmap;
4463 /* Add the div constraint of sign "sign" for div "div" of "bmap".
4465 * In particular, if this div is of the form d = floor(f/m),
4466 * then add the constraint
4468 * f - m d >= 0
4470 * if sign < 0 or the constraint
4472 * -(f-(n-1)) + m d >= 0
4474 * if sign > 0.
4476 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map *bmap,
4477 unsigned div, int sign)
4479 unsigned total;
4480 unsigned div_pos;
4482 if (!bmap)
4483 return -1;
4485 total = isl_basic_map_total_dim(bmap);
4486 div_pos = total - bmap->n_div + div;
4488 if (sign < 0)
4489 return add_upper_div_constraint(bmap, div_pos, bmap->div[div]);
4490 else
4491 return add_lower_div_constraint(bmap, div_pos, bmap->div[div]);
4494 int isl_basic_set_add_div_constraints(struct isl_basic_set *bset, unsigned div)
4496 return isl_basic_map_add_div_constraints(bset, div);
4499 struct isl_basic_set *isl_basic_map_underlying_set(
4500 struct isl_basic_map *bmap)
4502 if (!bmap)
4503 goto error;
4504 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
4505 bmap->n_div == 0 &&
4506 !isl_space_is_named_or_nested(bmap->dim, isl_dim_in) &&
4507 !isl_space_is_named_or_nested(bmap->dim, isl_dim_out))
4508 return (struct isl_basic_set *)bmap;
4509 bmap = isl_basic_map_cow(bmap);
4510 if (!bmap)
4511 goto error;
4512 bmap->dim = isl_space_underlying(bmap->dim, bmap->n_div);
4513 if (!bmap->dim)
4514 goto error;
4515 bmap->extra -= bmap->n_div;
4516 bmap->n_div = 0;
4517 bmap = isl_basic_map_finalize(bmap);
4518 return (struct isl_basic_set *)bmap;
4519 error:
4520 isl_basic_map_free(bmap);
4521 return NULL;
4524 __isl_give isl_basic_set *isl_basic_set_underlying_set(
4525 __isl_take isl_basic_set *bset)
4527 return isl_basic_map_underlying_set((isl_basic_map *)bset);
4530 /* Replace each element in "list" by the result of applying
4531 * isl_basic_map_underlying_set to the element.
4533 __isl_give isl_basic_set_list *isl_basic_map_list_underlying_set(
4534 __isl_take isl_basic_map_list *list)
4536 int i, n;
4538 if (!list)
4539 return NULL;
4541 n = isl_basic_map_list_n_basic_map(list);
4542 for (i = 0; i < n; ++i) {
4543 isl_basic_map *bmap;
4544 isl_basic_set *bset;
4546 bmap = isl_basic_map_list_get_basic_map(list, i);
4547 bset = isl_basic_set_underlying_set(bmap);
4548 list = isl_basic_set_list_set_basic_set(list, i, bset);
4551 return list;
4554 struct isl_basic_map *isl_basic_map_overlying_set(
4555 struct isl_basic_set *bset, struct isl_basic_map *like)
4557 struct isl_basic_map *bmap;
4558 struct isl_ctx *ctx;
4559 unsigned total;
4560 int i;
4562 if (!bset || !like)
4563 goto error;
4564 ctx = bset->ctx;
4565 isl_assert(ctx, bset->n_div == 0, goto error);
4566 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
4567 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
4568 goto error);
4569 if (isl_space_is_equal(bset->dim, like->dim) && like->n_div == 0) {
4570 isl_basic_map_free(like);
4571 return (struct isl_basic_map *)bset;
4573 bset = isl_basic_set_cow(bset);
4574 if (!bset)
4575 goto error;
4576 total = bset->dim->n_out + bset->extra;
4577 bmap = (struct isl_basic_map *)bset;
4578 isl_space_free(bmap->dim);
4579 bmap->dim = isl_space_copy(like->dim);
4580 if (!bmap->dim)
4581 goto error;
4582 bmap->n_div = like->n_div;
4583 bmap->extra += like->n_div;
4584 if (bmap->extra) {
4585 unsigned ltotal;
4586 isl_int **div;
4587 ltotal = total - bmap->extra + like->extra;
4588 if (ltotal > total)
4589 ltotal = total;
4590 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
4591 bmap->extra * (1 + 1 + total));
4592 if (isl_blk_is_error(bmap->block2))
4593 goto error;
4594 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
4595 if (!div)
4596 goto error;
4597 bmap->div = div;
4598 for (i = 0; i < bmap->extra; ++i)
4599 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
4600 for (i = 0; i < like->n_div; ++i) {
4601 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
4602 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
4604 bmap = isl_basic_map_add_known_div_constraints(bmap);
4606 isl_basic_map_free(like);
4607 bmap = isl_basic_map_simplify(bmap);
4608 bmap = isl_basic_map_finalize(bmap);
4609 return bmap;
4610 error:
4611 isl_basic_map_free(like);
4612 isl_basic_set_free(bset);
4613 return NULL;
4616 struct isl_basic_set *isl_basic_set_from_underlying_set(
4617 struct isl_basic_set *bset, struct isl_basic_set *like)
4619 return (struct isl_basic_set *)
4620 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
4623 struct isl_set *isl_set_from_underlying_set(
4624 struct isl_set *set, struct isl_basic_set *like)
4626 int i;
4628 if (!set || !like)
4629 goto error;
4630 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
4631 goto error);
4632 if (isl_space_is_equal(set->dim, like->dim) && like->n_div == 0) {
4633 isl_basic_set_free(like);
4634 return set;
4636 set = isl_set_cow(set);
4637 if (!set)
4638 goto error;
4639 for (i = 0; i < set->n; ++i) {
4640 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
4641 isl_basic_set_copy(like));
4642 if (!set->p[i])
4643 goto error;
4645 isl_space_free(set->dim);
4646 set->dim = isl_space_copy(like->dim);
4647 if (!set->dim)
4648 goto error;
4649 isl_basic_set_free(like);
4650 return set;
4651 error:
4652 isl_basic_set_free(like);
4653 isl_set_free(set);
4654 return NULL;
4657 struct isl_set *isl_map_underlying_set(struct isl_map *map)
4659 int i;
4661 map = isl_map_cow(map);
4662 if (!map)
4663 return NULL;
4664 map->dim = isl_space_cow(map->dim);
4665 if (!map->dim)
4666 goto error;
4668 for (i = 1; i < map->n; ++i)
4669 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
4670 goto error);
4671 for (i = 0; i < map->n; ++i) {
4672 map->p[i] = (struct isl_basic_map *)
4673 isl_basic_map_underlying_set(map->p[i]);
4674 if (!map->p[i])
4675 goto error;
4677 if (map->n == 0)
4678 map->dim = isl_space_underlying(map->dim, 0);
4679 else {
4680 isl_space_free(map->dim);
4681 map->dim = isl_space_copy(map->p[0]->dim);
4683 if (!map->dim)
4684 goto error;
4685 return (struct isl_set *)map;
4686 error:
4687 isl_map_free(map);
4688 return NULL;
4691 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
4693 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
4696 __isl_give isl_basic_map *isl_basic_map_reset_space(
4697 __isl_take isl_basic_map *bmap, __isl_take isl_space *dim)
4699 bmap = isl_basic_map_cow(bmap);
4700 if (!bmap || !dim)
4701 goto error;
4703 isl_space_free(bmap->dim);
4704 bmap->dim = dim;
4706 bmap = isl_basic_map_finalize(bmap);
4708 return bmap;
4709 error:
4710 isl_basic_map_free(bmap);
4711 isl_space_free(dim);
4712 return NULL;
4715 __isl_give isl_basic_set *isl_basic_set_reset_space(
4716 __isl_take isl_basic_set *bset, __isl_take isl_space *dim)
4718 return (isl_basic_set *)isl_basic_map_reset_space((isl_basic_map *)bset,
4719 dim);
4722 __isl_give isl_map *isl_map_reset_space(__isl_take isl_map *map,
4723 __isl_take isl_space *dim)
4725 int i;
4727 map = isl_map_cow(map);
4728 if (!map || !dim)
4729 goto error;
4731 for (i = 0; i < map->n; ++i) {
4732 map->p[i] = isl_basic_map_reset_space(map->p[i],
4733 isl_space_copy(dim));
4734 if (!map->p[i])
4735 goto error;
4737 isl_space_free(map->dim);
4738 map->dim = dim;
4740 return map;
4741 error:
4742 isl_map_free(map);
4743 isl_space_free(dim);
4744 return NULL;
4747 __isl_give isl_set *isl_set_reset_space(__isl_take isl_set *set,
4748 __isl_take isl_space *dim)
4750 return (struct isl_set *) isl_map_reset_space((struct isl_map *)set, dim);
4753 /* Compute the parameter domain of the given basic set.
4755 __isl_give isl_basic_set *isl_basic_set_params(__isl_take isl_basic_set *bset)
4757 isl_space *space;
4758 unsigned n;
4760 if (isl_basic_set_is_params(bset))
4761 return bset;
4763 n = isl_basic_set_dim(bset, isl_dim_set);
4764 bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n);
4765 space = isl_basic_set_get_space(bset);
4766 space = isl_space_params(space);
4767 bset = isl_basic_set_reset_space(bset, space);
4768 return bset;
4771 /* Construct a zero-dimensional basic set with the given parameter domain.
4773 __isl_give isl_basic_set *isl_basic_set_from_params(
4774 __isl_take isl_basic_set *bset)
4776 isl_space *space;
4777 space = isl_basic_set_get_space(bset);
4778 space = isl_space_set_from_params(space);
4779 bset = isl_basic_set_reset_space(bset, space);
4780 return bset;
4783 /* Compute the parameter domain of the given set.
4785 __isl_give isl_set *isl_set_params(__isl_take isl_set *set)
4787 isl_space *space;
4788 unsigned n;
4790 if (isl_set_is_params(set))
4791 return set;
4793 n = isl_set_dim(set, isl_dim_set);
4794 set = isl_set_project_out(set, isl_dim_set, 0, n);
4795 space = isl_set_get_space(set);
4796 space = isl_space_params(space);
4797 set = isl_set_reset_space(set, space);
4798 return set;
4801 /* Construct a zero-dimensional set with the given parameter domain.
4803 __isl_give isl_set *isl_set_from_params(__isl_take isl_set *set)
4805 isl_space *space;
4806 space = isl_set_get_space(set);
4807 space = isl_space_set_from_params(space);
4808 set = isl_set_reset_space(set, space);
4809 return set;
4812 /* Compute the parameter domain of the given map.
4814 __isl_give isl_set *isl_map_params(__isl_take isl_map *map)
4816 isl_space *space;
4817 unsigned n;
4819 n = isl_map_dim(map, isl_dim_in);
4820 map = isl_map_project_out(map, isl_dim_in, 0, n);
4821 n = isl_map_dim(map, isl_dim_out);
4822 map = isl_map_project_out(map, isl_dim_out, 0, n);
4823 space = isl_map_get_space(map);
4824 space = isl_space_params(space);
4825 map = isl_map_reset_space(map, space);
4826 return map;
4829 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
4831 isl_space *space;
4832 unsigned n_out;
4834 if (!bmap)
4835 return NULL;
4836 space = isl_space_domain(isl_basic_map_get_space(bmap));
4838 n_out = isl_basic_map_n_out(bmap);
4839 bmap = isl_basic_map_project_out(bmap, isl_dim_out, 0, n_out);
4841 return isl_basic_map_reset_space(bmap, space);
4844 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
4846 if (!bmap)
4847 return -1;
4848 return isl_space_may_be_set(bmap->dim);
4851 /* Is this basic map actually a set?
4852 * Users should never call this function. Outside of isl,
4853 * the type should indicate whether something is a set or a map.
4855 int isl_basic_map_is_set(__isl_keep isl_basic_map *bmap)
4857 if (!bmap)
4858 return -1;
4859 return isl_space_is_set(bmap->dim);
4862 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
4864 if (!bmap)
4865 return NULL;
4866 if (isl_basic_map_is_set(bmap))
4867 return bmap;
4868 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
4871 __isl_give isl_basic_map *isl_basic_map_domain_map(
4872 __isl_take isl_basic_map *bmap)
4874 int i, k;
4875 isl_space *dim;
4876 isl_basic_map *domain;
4877 int nparam, n_in, n_out;
4878 unsigned total;
4880 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4881 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4882 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4884 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
4885 domain = isl_basic_map_universe(dim);
4887 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4888 bmap = isl_basic_map_apply_range(bmap, domain);
4889 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
4891 total = isl_basic_map_total_dim(bmap);
4893 for (i = 0; i < n_in; ++i) {
4894 k = isl_basic_map_alloc_equality(bmap);
4895 if (k < 0)
4896 goto error;
4897 isl_seq_clr(bmap->eq[k], 1 + total);
4898 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
4899 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4902 bmap = isl_basic_map_gauss(bmap, NULL);
4903 return isl_basic_map_finalize(bmap);
4904 error:
4905 isl_basic_map_free(bmap);
4906 return NULL;
4909 __isl_give isl_basic_map *isl_basic_map_range_map(
4910 __isl_take isl_basic_map *bmap)
4912 int i, k;
4913 isl_space *dim;
4914 isl_basic_map *range;
4915 int nparam, n_in, n_out;
4916 unsigned total;
4918 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4919 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4920 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4922 dim = isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap)));
4923 range = isl_basic_map_universe(dim);
4925 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
4926 bmap = isl_basic_map_apply_range(bmap, range);
4927 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
4929 total = isl_basic_map_total_dim(bmap);
4931 for (i = 0; i < n_out; ++i) {
4932 k = isl_basic_map_alloc_equality(bmap);
4933 if (k < 0)
4934 goto error;
4935 isl_seq_clr(bmap->eq[k], 1 + total);
4936 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
4937 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
4940 bmap = isl_basic_map_gauss(bmap, NULL);
4941 return isl_basic_map_finalize(bmap);
4942 error:
4943 isl_basic_map_free(bmap);
4944 return NULL;
4947 int isl_map_may_be_set(__isl_keep isl_map *map)
4949 if (!map)
4950 return -1;
4951 return isl_space_may_be_set(map->dim);
4954 /* Is this map actually a set?
4955 * Users should never call this function. Outside of isl,
4956 * the type should indicate whether something is a set or a map.
4958 int isl_map_is_set(__isl_keep isl_map *map)
4960 if (!map)
4961 return -1;
4962 return isl_space_is_set(map->dim);
4965 struct isl_set *isl_map_range(struct isl_map *map)
4967 int i;
4968 struct isl_set *set;
4970 if (!map)
4971 goto error;
4972 if (isl_map_is_set(map))
4973 return (isl_set *)map;
4975 map = isl_map_cow(map);
4976 if (!map)
4977 goto error;
4979 set = (struct isl_set *) map;
4980 set->dim = isl_space_range(set->dim);
4981 if (!set->dim)
4982 goto error;
4983 for (i = 0; i < map->n; ++i) {
4984 set->p[i] = isl_basic_map_range(map->p[i]);
4985 if (!set->p[i])
4986 goto error;
4988 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4989 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4990 return set;
4991 error:
4992 isl_map_free(map);
4993 return NULL;
4996 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
4998 int i;
5000 map = isl_map_cow(map);
5001 if (!map)
5002 return NULL;
5004 map->dim = isl_space_domain_map(map->dim);
5005 if (!map->dim)
5006 goto error;
5007 for (i = 0; i < map->n; ++i) {
5008 map->p[i] = isl_basic_map_domain_map(map->p[i]);
5009 if (!map->p[i])
5010 goto error;
5012 ISL_F_CLR(map, ISL_MAP_DISJOINT);
5013 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5014 return map;
5015 error:
5016 isl_map_free(map);
5017 return NULL;
5020 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
5022 int i;
5023 isl_space *range_dim;
5025 map = isl_map_cow(map);
5026 if (!map)
5027 return NULL;
5029 range_dim = isl_space_range(isl_map_get_space(map));
5030 range_dim = isl_space_from_range(range_dim);
5031 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
5032 map->dim = isl_space_join(map->dim, range_dim);
5033 if (!map->dim)
5034 goto error;
5035 for (i = 0; i < map->n; ++i) {
5036 map->p[i] = isl_basic_map_range_map(map->p[i]);
5037 if (!map->p[i])
5038 goto error;
5040 ISL_F_CLR(map, ISL_MAP_DISJOINT);
5041 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5042 return map;
5043 error:
5044 isl_map_free(map);
5045 return NULL;
5048 /* Given a wrapped map of the form A[B -> C],
5049 * return the map A[B -> C] -> B.
5051 __isl_give isl_map *isl_set_wrapped_domain_map(__isl_take isl_set *set)
5053 isl_id *id;
5054 isl_map *map;
5056 if (!set)
5057 return NULL;
5058 if (!isl_set_has_tuple_id(set))
5059 return isl_map_domain_map(isl_set_unwrap(set));
5061 id = isl_set_get_tuple_id(set);
5062 map = isl_map_domain_map(isl_set_unwrap(set));
5063 map = isl_map_set_tuple_id(map, isl_dim_in, id);
5065 return map;
5068 __isl_give isl_map *isl_map_from_set(__isl_take isl_set *set,
5069 __isl_take isl_space *dim)
5071 int i;
5072 struct isl_map *map = NULL;
5074 set = isl_set_cow(set);
5075 if (!set || !dim)
5076 goto error;
5077 isl_assert(set->ctx, isl_space_compatible(set->dim, dim), goto error);
5078 map = (struct isl_map *)set;
5079 for (i = 0; i < set->n; ++i) {
5080 map->p[i] = isl_basic_map_from_basic_set(
5081 set->p[i], isl_space_copy(dim));
5082 if (!map->p[i])
5083 goto error;
5085 isl_space_free(map->dim);
5086 map->dim = dim;
5087 return map;
5088 error:
5089 isl_space_free(dim);
5090 isl_set_free(set);
5091 return NULL;
5094 __isl_give isl_basic_map *isl_basic_map_from_domain(
5095 __isl_take isl_basic_set *bset)
5097 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
5100 __isl_give isl_basic_map *isl_basic_map_from_range(
5101 __isl_take isl_basic_set *bset)
5103 isl_space *space;
5104 space = isl_basic_set_get_space(bset);
5105 space = isl_space_from_range(space);
5106 bset = isl_basic_set_reset_space(bset, space);
5107 return (isl_basic_map *)bset;
5110 /* Create a relation with the given set as range.
5111 * The domain of the created relation is a zero-dimensional
5112 * flat anonymous space.
5114 __isl_give isl_map *isl_map_from_range(__isl_take isl_set *set)
5116 isl_space *space;
5117 space = isl_set_get_space(set);
5118 space = isl_space_from_range(space);
5119 set = isl_set_reset_space(set, space);
5120 return (struct isl_map *)set;
5123 /* Create a relation with the given set as domain.
5124 * The range of the created relation is a zero-dimensional
5125 * flat anonymous space.
5127 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
5129 return isl_map_reverse(isl_map_from_range(set));
5132 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
5133 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
5135 return isl_basic_map_apply_range(isl_basic_map_reverse(domain), range);
5138 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
5139 __isl_take isl_set *range)
5141 return isl_map_apply_range(isl_map_reverse(domain), range);
5144 __isl_give isl_map *isl_map_alloc_space(__isl_take isl_space *dim, int n,
5145 unsigned flags)
5147 struct isl_map *map;
5149 if (!dim)
5150 return NULL;
5151 if (n < 0)
5152 isl_die(dim->ctx, isl_error_internal,
5153 "negative number of basic maps", goto error);
5154 map = isl_alloc(dim->ctx, struct isl_map,
5155 sizeof(struct isl_map) +
5156 (n - 1) * sizeof(struct isl_basic_map *));
5157 if (!map)
5158 goto error;
5160 map->ctx = dim->ctx;
5161 isl_ctx_ref(map->ctx);
5162 map->ref = 1;
5163 map->size = n;
5164 map->n = 0;
5165 map->dim = dim;
5166 map->flags = flags;
5167 return map;
5168 error:
5169 isl_space_free(dim);
5170 return NULL;
5173 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
5174 unsigned nparam, unsigned in, unsigned out, int n,
5175 unsigned flags)
5177 struct isl_map *map;
5178 isl_space *dims;
5180 dims = isl_space_alloc(ctx, nparam, in, out);
5181 if (!dims)
5182 return NULL;
5184 map = isl_map_alloc_space(dims, n, flags);
5185 return map;
5188 __isl_give isl_basic_map *isl_basic_map_empty(__isl_take isl_space *dim)
5190 struct isl_basic_map *bmap;
5191 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
5192 bmap = isl_basic_map_set_to_empty(bmap);
5193 return bmap;
5196 __isl_give isl_basic_set *isl_basic_set_empty(__isl_take isl_space *dim)
5198 struct isl_basic_set *bset;
5199 bset = isl_basic_set_alloc_space(dim, 0, 1, 0);
5200 bset = isl_basic_set_set_to_empty(bset);
5201 return bset;
5204 __isl_give isl_basic_map *isl_basic_map_universe(__isl_take isl_space *dim)
5206 struct isl_basic_map *bmap;
5207 bmap = isl_basic_map_alloc_space(dim, 0, 0, 0);
5208 bmap = isl_basic_map_finalize(bmap);
5209 return bmap;
5212 __isl_give isl_basic_set *isl_basic_set_universe(__isl_take isl_space *dim)
5214 struct isl_basic_set *bset;
5215 bset = isl_basic_set_alloc_space(dim, 0, 0, 0);
5216 bset = isl_basic_set_finalize(bset);
5217 return bset;
5220 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_space *dim)
5222 int i;
5223 unsigned total = isl_space_dim(dim, isl_dim_all);
5224 isl_basic_map *bmap;
5226 bmap= isl_basic_map_alloc_space(dim, 0, 0, total);
5227 for (i = 0; i < total; ++i) {
5228 int k = isl_basic_map_alloc_inequality(bmap);
5229 if (k < 0)
5230 goto error;
5231 isl_seq_clr(bmap->ineq[k], 1 + total);
5232 isl_int_set_si(bmap->ineq[k][1 + i], 1);
5234 return bmap;
5235 error:
5236 isl_basic_map_free(bmap);
5237 return NULL;
5240 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_space *dim)
5242 return isl_basic_map_nat_universe(dim);
5245 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_space *dim)
5247 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
5250 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_space *dim)
5252 return isl_map_nat_universe(dim);
5255 __isl_give isl_map *isl_map_empty(__isl_take isl_space *dim)
5257 return isl_map_alloc_space(dim, 0, ISL_MAP_DISJOINT);
5260 __isl_give isl_set *isl_set_empty(__isl_take isl_space *dim)
5262 return isl_set_alloc_space(dim, 0, ISL_MAP_DISJOINT);
5265 __isl_give isl_map *isl_map_universe(__isl_take isl_space *dim)
5267 struct isl_map *map;
5268 if (!dim)
5269 return NULL;
5270 map = isl_map_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
5271 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
5272 return map;
5275 __isl_give isl_set *isl_set_universe(__isl_take isl_space *dim)
5277 struct isl_set *set;
5278 if (!dim)
5279 return NULL;
5280 set = isl_set_alloc_space(isl_space_copy(dim), 1, ISL_MAP_DISJOINT);
5281 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
5282 return set;
5285 struct isl_map *isl_map_dup(struct isl_map *map)
5287 int i;
5288 struct isl_map *dup;
5290 if (!map)
5291 return NULL;
5292 dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags);
5293 for (i = 0; i < map->n; ++i)
5294 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
5295 return dup;
5298 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
5299 __isl_take isl_basic_map *bmap)
5301 if (!bmap || !map)
5302 goto error;
5303 if (isl_basic_map_plain_is_empty(bmap)) {
5304 isl_basic_map_free(bmap);
5305 return map;
5307 isl_assert(map->ctx, isl_space_is_equal(map->dim, bmap->dim), goto error);
5308 isl_assert(map->ctx, map->n < map->size, goto error);
5309 map->p[map->n] = bmap;
5310 map->n++;
5311 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5312 return map;
5313 error:
5314 if (map)
5315 isl_map_free(map);
5316 if (bmap)
5317 isl_basic_map_free(bmap);
5318 return NULL;
5321 __isl_null isl_map *isl_map_free(__isl_take isl_map *map)
5323 int i;
5325 if (!map)
5326 return NULL;
5328 if (--map->ref > 0)
5329 return NULL;
5331 isl_ctx_deref(map->ctx);
5332 for (i = 0; i < map->n; ++i)
5333 isl_basic_map_free(map->p[i]);
5334 isl_space_free(map->dim);
5335 free(map);
5337 return NULL;
5340 static struct isl_basic_map *isl_basic_map_fix_pos_si(
5341 struct isl_basic_map *bmap, unsigned pos, int value)
5343 int j;
5345 bmap = isl_basic_map_cow(bmap);
5346 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
5347 j = isl_basic_map_alloc_equality(bmap);
5348 if (j < 0)
5349 goto error;
5350 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
5351 isl_int_set_si(bmap->eq[j][pos], -1);
5352 isl_int_set_si(bmap->eq[j][0], value);
5353 bmap = isl_basic_map_simplify(bmap);
5354 return isl_basic_map_finalize(bmap);
5355 error:
5356 isl_basic_map_free(bmap);
5357 return NULL;
5360 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
5361 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
5363 int j;
5365 bmap = isl_basic_map_cow(bmap);
5366 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
5367 j = isl_basic_map_alloc_equality(bmap);
5368 if (j < 0)
5369 goto error;
5370 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
5371 isl_int_set_si(bmap->eq[j][pos], -1);
5372 isl_int_set(bmap->eq[j][0], value);
5373 bmap = isl_basic_map_simplify(bmap);
5374 return isl_basic_map_finalize(bmap);
5375 error:
5376 isl_basic_map_free(bmap);
5377 return NULL;
5380 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
5381 enum isl_dim_type type, unsigned pos, int value)
5383 if (!bmap)
5384 return NULL;
5385 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5386 return isl_basic_map_fix_pos_si(bmap,
5387 isl_basic_map_offset(bmap, type) + pos, value);
5388 error:
5389 isl_basic_map_free(bmap);
5390 return NULL;
5393 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
5394 enum isl_dim_type type, unsigned pos, isl_int value)
5396 if (!bmap)
5397 return NULL;
5398 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5399 return isl_basic_map_fix_pos(bmap,
5400 isl_basic_map_offset(bmap, type) + pos, value);
5401 error:
5402 isl_basic_map_free(bmap);
5403 return NULL;
5406 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
5407 * to be equal to "v".
5409 __isl_give isl_basic_map *isl_basic_map_fix_val(__isl_take isl_basic_map *bmap,
5410 enum isl_dim_type type, unsigned pos, __isl_take isl_val *v)
5412 if (!bmap || !v)
5413 goto error;
5414 if (!isl_val_is_int(v))
5415 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
5416 "expecting integer value", goto error);
5417 if (pos >= isl_basic_map_dim(bmap, type))
5418 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
5419 "index out of bounds", goto error);
5420 pos += isl_basic_map_offset(bmap, type);
5421 bmap = isl_basic_map_fix_pos(bmap, pos, v->n);
5422 isl_val_free(v);
5423 return bmap;
5424 error:
5425 isl_basic_map_free(bmap);
5426 isl_val_free(v);
5427 return NULL;
5430 /* Fix the value of the variable at position "pos" of type "type" of "bset"
5431 * to be equal to "v".
5433 __isl_give isl_basic_set *isl_basic_set_fix_val(__isl_take isl_basic_set *bset,
5434 enum isl_dim_type type, unsigned pos, __isl_take isl_val *v)
5436 return isl_basic_map_fix_val(bset, type, pos, v);
5439 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
5440 enum isl_dim_type type, unsigned pos, int value)
5442 return (struct isl_basic_set *)
5443 isl_basic_map_fix_si((struct isl_basic_map *)bset,
5444 type, pos, value);
5447 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
5448 enum isl_dim_type type, unsigned pos, isl_int value)
5450 return (struct isl_basic_set *)
5451 isl_basic_map_fix((struct isl_basic_map *)bset,
5452 type, pos, value);
5455 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
5456 unsigned input, int value)
5458 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
5461 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
5462 unsigned dim, int value)
5464 return (struct isl_basic_set *)
5465 isl_basic_map_fix_si((struct isl_basic_map *)bset,
5466 isl_dim_set, dim, value);
5469 static int remove_if_empty(__isl_keep isl_map *map, int i)
5471 int empty = isl_basic_map_plain_is_empty(map->p[i]);
5473 if (empty < 0)
5474 return -1;
5475 if (!empty)
5476 return 0;
5478 isl_basic_map_free(map->p[i]);
5479 if (i != map->n - 1) {
5480 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5481 map->p[i] = map->p[map->n - 1];
5483 map->n--;
5485 return 0;
5488 /* Perform "fn" on each basic map of "map", where we may not be holding
5489 * the only reference to "map".
5490 * In particular, "fn" should be a semantics preserving operation
5491 * that we want to apply to all copies of "map". We therefore need
5492 * to be careful not to modify "map" in a way that breaks "map"
5493 * in case anything goes wrong.
5495 __isl_give isl_map *isl_map_inline_foreach_basic_map(__isl_take isl_map *map,
5496 __isl_give isl_basic_map *(*fn)(__isl_take isl_basic_map *bmap))
5498 struct isl_basic_map *bmap;
5499 int i;
5501 if (!map)
5502 return NULL;
5504 for (i = map->n - 1; i >= 0; --i) {
5505 bmap = isl_basic_map_copy(map->p[i]);
5506 bmap = fn(bmap);
5507 if (!bmap)
5508 goto error;
5509 isl_basic_map_free(map->p[i]);
5510 map->p[i] = bmap;
5511 if (remove_if_empty(map, i) < 0)
5512 goto error;
5515 return map;
5516 error:
5517 isl_map_free(map);
5518 return NULL;
5521 struct isl_map *isl_map_fix_si(struct isl_map *map,
5522 enum isl_dim_type type, unsigned pos, int value)
5524 int i;
5526 map = isl_map_cow(map);
5527 if (!map)
5528 return NULL;
5530 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5531 for (i = map->n - 1; i >= 0; --i) {
5532 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
5533 if (remove_if_empty(map, i) < 0)
5534 goto error;
5536 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5537 return map;
5538 error:
5539 isl_map_free(map);
5540 return NULL;
5543 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
5544 enum isl_dim_type type, unsigned pos, int value)
5546 return (struct isl_set *)
5547 isl_map_fix_si((struct isl_map *)set, type, pos, value);
5550 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
5551 enum isl_dim_type type, unsigned pos, isl_int value)
5553 int i;
5555 map = isl_map_cow(map);
5556 if (!map)
5557 return NULL;
5559 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5560 for (i = 0; i < map->n; ++i) {
5561 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
5562 if (!map->p[i])
5563 goto error;
5565 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5566 return map;
5567 error:
5568 isl_map_free(map);
5569 return NULL;
5572 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
5573 enum isl_dim_type type, unsigned pos, isl_int value)
5575 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
5578 /* Fix the value of the variable at position "pos" of type "type" of "map"
5579 * to be equal to "v".
5581 __isl_give isl_map *isl_map_fix_val(__isl_take isl_map *map,
5582 enum isl_dim_type type, unsigned pos, __isl_take isl_val *v)
5584 int i;
5586 map = isl_map_cow(map);
5587 if (!map || !v)
5588 goto error;
5590 if (!isl_val_is_int(v))
5591 isl_die(isl_map_get_ctx(map), isl_error_invalid,
5592 "expecting integer value", goto error);
5593 if (pos >= isl_map_dim(map, type))
5594 isl_die(isl_map_get_ctx(map), isl_error_invalid,
5595 "index out of bounds", goto error);
5596 for (i = map->n - 1; i >= 0; --i) {
5597 map->p[i] = isl_basic_map_fix_val(map->p[i], type, pos,
5598 isl_val_copy(v));
5599 if (remove_if_empty(map, i) < 0)
5600 goto error;
5602 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5603 isl_val_free(v);
5604 return map;
5605 error:
5606 isl_map_free(map);
5607 isl_val_free(v);
5608 return NULL;
5611 /* Fix the value of the variable at position "pos" of type "type" of "set"
5612 * to be equal to "v".
5614 __isl_give isl_set *isl_set_fix_val(__isl_take isl_set *set,
5615 enum isl_dim_type type, unsigned pos, __isl_take isl_val *v)
5617 return isl_map_fix_val(set, type, pos, v);
5620 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
5621 unsigned input, int value)
5623 return isl_map_fix_si(map, isl_dim_in, input, value);
5626 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
5628 return (struct isl_set *)
5629 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
5632 static __isl_give isl_basic_map *basic_map_bound_si(
5633 __isl_take isl_basic_map *bmap,
5634 enum isl_dim_type type, unsigned pos, int value, int upper)
5636 int j;
5638 if (!bmap)
5639 return NULL;
5640 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
5641 pos += isl_basic_map_offset(bmap, type);
5642 bmap = isl_basic_map_cow(bmap);
5643 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5644 j = isl_basic_map_alloc_inequality(bmap);
5645 if (j < 0)
5646 goto error;
5647 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5648 if (upper) {
5649 isl_int_set_si(bmap->ineq[j][pos], -1);
5650 isl_int_set_si(bmap->ineq[j][0], value);
5651 } else {
5652 isl_int_set_si(bmap->ineq[j][pos], 1);
5653 isl_int_set_si(bmap->ineq[j][0], -value);
5655 bmap = isl_basic_map_simplify(bmap);
5656 return isl_basic_map_finalize(bmap);
5657 error:
5658 isl_basic_map_free(bmap);
5659 return NULL;
5662 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
5663 __isl_take isl_basic_map *bmap,
5664 enum isl_dim_type type, unsigned pos, int value)
5666 return basic_map_bound_si(bmap, type, pos, value, 0);
5669 /* Constrain the values of the given dimension to be no greater than "value".
5671 __isl_give isl_basic_map *isl_basic_map_upper_bound_si(
5672 __isl_take isl_basic_map *bmap,
5673 enum isl_dim_type type, unsigned pos, int value)
5675 return basic_map_bound_si(bmap, type, pos, value, 1);
5678 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
5679 unsigned dim, isl_int value)
5681 int j;
5683 bset = isl_basic_set_cow(bset);
5684 bset = isl_basic_set_extend_constraints(bset, 0, 1);
5685 j = isl_basic_set_alloc_inequality(bset);
5686 if (j < 0)
5687 goto error;
5688 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
5689 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
5690 isl_int_neg(bset->ineq[j][0], value);
5691 bset = isl_basic_set_simplify(bset);
5692 return isl_basic_set_finalize(bset);
5693 error:
5694 isl_basic_set_free(bset);
5695 return NULL;
5698 static __isl_give isl_map *map_bound_si(__isl_take isl_map *map,
5699 enum isl_dim_type type, unsigned pos, int value, int upper)
5701 int i;
5703 map = isl_map_cow(map);
5704 if (!map)
5705 return NULL;
5707 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
5708 for (i = 0; i < map->n; ++i) {
5709 map->p[i] = basic_map_bound_si(map->p[i],
5710 type, pos, value, upper);
5711 if (!map->p[i])
5712 goto error;
5714 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5715 return map;
5716 error:
5717 isl_map_free(map);
5718 return NULL;
5721 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
5722 enum isl_dim_type type, unsigned pos, int value)
5724 return map_bound_si(map, type, pos, value, 0);
5727 __isl_give isl_map *isl_map_upper_bound_si(__isl_take isl_map *map,
5728 enum isl_dim_type type, unsigned pos, int value)
5730 return map_bound_si(map, type, pos, value, 1);
5733 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
5734 enum isl_dim_type type, unsigned pos, int value)
5736 return (struct isl_set *)
5737 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
5740 __isl_give isl_set *isl_set_upper_bound_si(__isl_take isl_set *set,
5741 enum isl_dim_type type, unsigned pos, int value)
5743 return isl_map_upper_bound_si(set, type, pos, value);
5746 /* Bound the given variable of "bmap" from below (or above is "upper"
5747 * is set) to "value".
5749 static __isl_give isl_basic_map *basic_map_bound(
5750 __isl_take isl_basic_map *bmap,
5751 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5753 int j;
5755 if (!bmap)
5756 return NULL;
5757 if (pos >= isl_basic_map_dim(bmap, type))
5758 isl_die(bmap->ctx, isl_error_invalid,
5759 "index out of bounds", goto error);
5760 pos += isl_basic_map_offset(bmap, type);
5761 bmap = isl_basic_map_cow(bmap);
5762 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
5763 j = isl_basic_map_alloc_inequality(bmap);
5764 if (j < 0)
5765 goto error;
5766 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
5767 if (upper) {
5768 isl_int_set_si(bmap->ineq[j][pos], -1);
5769 isl_int_set(bmap->ineq[j][0], value);
5770 } else {
5771 isl_int_set_si(bmap->ineq[j][pos], 1);
5772 isl_int_neg(bmap->ineq[j][0], value);
5774 bmap = isl_basic_map_simplify(bmap);
5775 return isl_basic_map_finalize(bmap);
5776 error:
5777 isl_basic_map_free(bmap);
5778 return NULL;
5781 /* Bound the given variable of "map" from below (or above is "upper"
5782 * is set) to "value".
5784 static __isl_give isl_map *map_bound(__isl_take isl_map *map,
5785 enum isl_dim_type type, unsigned pos, isl_int value, int upper)
5787 int i;
5789 map = isl_map_cow(map);
5790 if (!map)
5791 return NULL;
5793 if (pos >= isl_map_dim(map, type))
5794 isl_die(map->ctx, isl_error_invalid,
5795 "index out of bounds", goto error);
5796 for (i = map->n - 1; i >= 0; --i) {
5797 map->p[i] = basic_map_bound(map->p[i], type, pos, value, upper);
5798 if (remove_if_empty(map, i) < 0)
5799 goto error;
5801 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5802 return map;
5803 error:
5804 isl_map_free(map);
5805 return NULL;
5808 __isl_give isl_map *isl_map_lower_bound(__isl_take isl_map *map,
5809 enum isl_dim_type type, unsigned pos, isl_int value)
5811 return map_bound(map, type, pos, value, 0);
5814 __isl_give isl_map *isl_map_upper_bound(__isl_take isl_map *map,
5815 enum isl_dim_type type, unsigned pos, isl_int value)
5817 return map_bound(map, type, pos, value, 1);
5820 __isl_give isl_set *isl_set_lower_bound(__isl_take isl_set *set,
5821 enum isl_dim_type type, unsigned pos, isl_int value)
5823 return isl_map_lower_bound(set, type, pos, value);
5826 __isl_give isl_set *isl_set_upper_bound(__isl_take isl_set *set,
5827 enum isl_dim_type type, unsigned pos, isl_int value)
5829 return isl_map_upper_bound(set, type, pos, value);
5832 /* Force the values of the variable at position "pos" of type "type" of "set"
5833 * to be no smaller than "value".
5835 __isl_give isl_set *isl_set_lower_bound_val(__isl_take isl_set *set,
5836 enum isl_dim_type type, unsigned pos, __isl_take isl_val *value)
5838 if (!value)
5839 goto error;
5840 if (!isl_val_is_int(value))
5841 isl_die(isl_set_get_ctx(set), isl_error_invalid,
5842 "expecting integer value", goto error);
5843 set = isl_set_lower_bound(set, type, pos, value->n);
5844 isl_val_free(value);
5845 return set;
5846 error:
5847 isl_val_free(value);
5848 isl_set_free(set);
5849 return NULL;
5852 /* Force the values of the variable at position "pos" of type "type" of "set"
5853 * to be no greater than "value".
5855 __isl_give isl_set *isl_set_upper_bound_val(__isl_take isl_set *set,
5856 enum isl_dim_type type, unsigned pos, __isl_take isl_val *value)
5858 if (!value)
5859 goto error;
5860 if (!isl_val_is_int(value))
5861 isl_die(isl_set_get_ctx(set), isl_error_invalid,
5862 "expecting integer value", goto error);
5863 set = isl_set_upper_bound(set, type, pos, value->n);
5864 isl_val_free(value);
5865 return set;
5866 error:
5867 isl_val_free(value);
5868 isl_set_free(set);
5869 return NULL;
5872 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
5873 isl_int value)
5875 int i;
5877 set = isl_set_cow(set);
5878 if (!set)
5879 return NULL;
5881 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
5882 for (i = 0; i < set->n; ++i) {
5883 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
5884 if (!set->p[i])
5885 goto error;
5887 return set;
5888 error:
5889 isl_set_free(set);
5890 return NULL;
5893 struct isl_map *isl_map_reverse(struct isl_map *map)
5895 int i;
5897 map = isl_map_cow(map);
5898 if (!map)
5899 return NULL;
5901 map->dim = isl_space_reverse(map->dim);
5902 if (!map->dim)
5903 goto error;
5904 for (i = 0; i < map->n; ++i) {
5905 map->p[i] = isl_basic_map_reverse(map->p[i]);
5906 if (!map->p[i])
5907 goto error;
5909 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5910 return map;
5911 error:
5912 isl_map_free(map);
5913 return NULL;
5916 static struct isl_map *isl_basic_map_partial_lexopt(
5917 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5918 struct isl_set **empty, int max)
5920 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
5923 struct isl_map *isl_basic_map_partial_lexmax(
5924 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5925 struct isl_set **empty)
5927 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
5930 struct isl_map *isl_basic_map_partial_lexmin(
5931 struct isl_basic_map *bmap, struct isl_basic_set *dom,
5932 struct isl_set **empty)
5934 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
5937 struct isl_set *isl_basic_set_partial_lexmin(
5938 struct isl_basic_set *bset, struct isl_basic_set *dom,
5939 struct isl_set **empty)
5941 return (struct isl_set *)
5942 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
5943 dom, empty);
5946 struct isl_set *isl_basic_set_partial_lexmax(
5947 struct isl_basic_set *bset, struct isl_basic_set *dom,
5948 struct isl_set **empty)
5950 return (struct isl_set *)
5951 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
5952 dom, empty);
5955 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmin_pw_multi_aff(
5956 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5957 __isl_give isl_set **empty)
5959 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 0);
5962 __isl_give isl_pw_multi_aff *isl_basic_map_partial_lexmax_pw_multi_aff(
5963 __isl_take isl_basic_map *bmap, __isl_take isl_basic_set *dom,
5964 __isl_give isl_set **empty)
5966 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, empty, 1);
5969 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmin_pw_multi_aff(
5970 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5971 __isl_give isl_set **empty)
5973 return isl_basic_map_partial_lexmin_pw_multi_aff(bset, dom, empty);
5976 __isl_give isl_pw_multi_aff *isl_basic_set_partial_lexmax_pw_multi_aff(
5977 __isl_take isl_basic_set *bset, __isl_take isl_basic_set *dom,
5978 __isl_give isl_set **empty)
5980 return isl_basic_map_partial_lexmax_pw_multi_aff(bset, dom, empty);
5983 __isl_give isl_pw_multi_aff *isl_basic_map_lexopt_pw_multi_aff(
5984 __isl_take isl_basic_map *bmap, int max)
5986 isl_basic_set *dom = NULL;
5987 isl_space *dom_space;
5989 if (!bmap)
5990 goto error;
5991 dom_space = isl_space_domain(isl_space_copy(bmap->dim));
5992 dom = isl_basic_set_universe(dom_space);
5993 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap, dom, NULL, max);
5994 error:
5995 isl_basic_map_free(bmap);
5996 return NULL;
5999 __isl_give isl_pw_multi_aff *isl_basic_map_lexmin_pw_multi_aff(
6000 __isl_take isl_basic_map *bmap)
6002 return isl_basic_map_lexopt_pw_multi_aff(bmap, 0);
6005 #undef TYPE
6006 #define TYPE isl_pw_multi_aff
6007 #undef SUFFIX
6008 #define SUFFIX _pw_multi_aff
6009 #undef EMPTY
6010 #define EMPTY isl_pw_multi_aff_empty
6011 #undef ADD
6012 #define ADD isl_pw_multi_aff_union_add
6013 #include "isl_map_lexopt_templ.c"
6015 /* Given a map "map", compute the lexicographically minimal
6016 * (or maximal) image element for each domain element in dom,
6017 * in the form of an isl_pw_multi_aff.
6018 * Set *empty to those elements in dom that do not have an image element.
6020 * We first compute the lexicographically minimal or maximal element
6021 * in the first basic map. This results in a partial solution "res"
6022 * and a subset "todo" of dom that still need to be handled.
6023 * We then consider each of the remaining maps in "map" and successively
6024 * update both "res" and "todo".
6026 static __isl_give isl_pw_multi_aff *isl_map_partial_lexopt_aligned_pw_multi_aff(
6027 __isl_take isl_map *map, __isl_take isl_set *dom,
6028 __isl_give isl_set **empty, int max)
6030 int i;
6031 isl_pw_multi_aff *res;
6032 isl_set *todo;
6034 if (!map || !dom)
6035 goto error;
6037 if (isl_map_plain_is_empty(map)) {
6038 if (empty)
6039 *empty = dom;
6040 else
6041 isl_set_free(dom);
6042 return isl_pw_multi_aff_from_map(map);
6045 res = basic_map_partial_lexopt_pw_multi_aff(
6046 isl_basic_map_copy(map->p[0]),
6047 isl_set_copy(dom), &todo, max);
6049 for (i = 1; i < map->n; ++i) {
6050 isl_pw_multi_aff *res_i;
6051 isl_set *todo_i;
6053 res_i = basic_map_partial_lexopt_pw_multi_aff(
6054 isl_basic_map_copy(map->p[i]),
6055 isl_set_copy(dom), &todo_i, max);
6057 if (max)
6058 res = isl_pw_multi_aff_union_lexmax(res, res_i);
6059 else
6060 res = isl_pw_multi_aff_union_lexmin(res, res_i);
6062 todo = isl_set_intersect(todo, todo_i);
6065 isl_set_free(dom);
6066 isl_map_free(map);
6068 if (empty)
6069 *empty = todo;
6070 else
6071 isl_set_free(todo);
6073 return res;
6074 error:
6075 if (empty)
6076 *empty = NULL;
6077 isl_set_free(dom);
6078 isl_map_free(map);
6079 return NULL;
6082 #undef TYPE
6083 #define TYPE isl_map
6084 #undef SUFFIX
6085 #define SUFFIX
6086 #undef EMPTY
6087 #define EMPTY isl_map_empty
6088 #undef ADD
6089 #define ADD isl_map_union_disjoint
6090 #include "isl_map_lexopt_templ.c"
6092 /* Given a map "map", compute the lexicographically minimal
6093 * (or maximal) image element for each domain element in dom.
6094 * Set *empty to those elements in dom that do not have an image element.
6096 * We first compute the lexicographically minimal or maximal element
6097 * in the first basic map. This results in a partial solution "res"
6098 * and a subset "todo" of dom that still need to be handled.
6099 * We then consider each of the remaining maps in "map" and successively
6100 * update both "res" and "todo".
6102 * Let res^k and todo^k be the results after k steps and let i = k + 1.
6103 * Assume we are computing the lexicographical maximum.
6104 * We first compute the lexicographically maximal element in basic map i.
6105 * This results in a partial solution res_i and a subset todo_i.
6106 * Then we combine these results with those obtain for the first k basic maps
6107 * to obtain a result that is valid for the first k+1 basic maps.
6108 * In particular, the set where there is no solution is the set where
6109 * there is no solution for the first k basic maps and also no solution
6110 * for the ith basic map, i.e.,
6112 * todo^i = todo^k * todo_i
6114 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
6115 * solutions, arbitrarily breaking ties in favor of res^k.
6116 * That is, when res^k(a) >= res_i(a), we pick res^k and
6117 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
6118 * the lexicographic order.)
6119 * In practice, we compute
6121 * res^k * (res_i . "<=")
6123 * and
6125 * res_i * (res^k . "<")
6127 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
6128 * where only one of res^k and res_i provides a solution and we simply pick
6129 * that one, i.e.,
6131 * res^k * todo_i
6132 * and
6133 * res_i * todo^k
6135 * Note that we only compute these intersections when dom(res^k) intersects
6136 * dom(res_i). Otherwise, the only effect of these intersections is to
6137 * potentially break up res^k and res_i into smaller pieces.
6138 * We want to avoid such splintering as much as possible.
6139 * In fact, an earlier implementation of this function would look for
6140 * better results in the domain of res^k and for extra results in todo^k,
6141 * but this would always result in a splintering according to todo^k,
6142 * even when the domain of basic map i is disjoint from the domains of
6143 * the previous basic maps.
6145 static __isl_give isl_map *isl_map_partial_lexopt_aligned(
6146 __isl_take isl_map *map, __isl_take isl_set *dom,
6147 __isl_give isl_set **empty, int max)
6149 int i;
6150 struct isl_map *res;
6151 struct isl_set *todo;
6153 if (!map || !dom)
6154 goto error;
6156 if (isl_map_plain_is_empty(map)) {
6157 if (empty)
6158 *empty = dom;
6159 else
6160 isl_set_free(dom);
6161 return map;
6164 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
6165 isl_set_copy(dom), &todo, max);
6167 for (i = 1; i < map->n; ++i) {
6168 isl_map *lt, *le;
6169 isl_map *res_i;
6170 isl_set *todo_i;
6171 isl_space *dim = isl_space_range(isl_map_get_space(res));
6173 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
6174 isl_set_copy(dom), &todo_i, max);
6176 if (max) {
6177 lt = isl_map_lex_lt(isl_space_copy(dim));
6178 le = isl_map_lex_le(dim);
6179 } else {
6180 lt = isl_map_lex_gt(isl_space_copy(dim));
6181 le = isl_map_lex_ge(dim);
6183 lt = isl_map_apply_range(isl_map_copy(res), lt);
6184 lt = isl_map_intersect(lt, isl_map_copy(res_i));
6185 le = isl_map_apply_range(isl_map_copy(res_i), le);
6186 le = isl_map_intersect(le, isl_map_copy(res));
6188 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
6189 res = isl_map_intersect_domain(res,
6190 isl_set_copy(todo_i));
6191 res_i = isl_map_intersect_domain(res_i,
6192 isl_set_copy(todo));
6195 res = isl_map_union_disjoint(res, res_i);
6196 res = isl_map_union_disjoint(res, lt);
6197 res = isl_map_union_disjoint(res, le);
6199 todo = isl_set_intersect(todo, todo_i);
6202 isl_set_free(dom);
6203 isl_map_free(map);
6205 if (empty)
6206 *empty = todo;
6207 else
6208 isl_set_free(todo);
6210 return res;
6211 error:
6212 if (empty)
6213 *empty = NULL;
6214 isl_set_free(dom);
6215 isl_map_free(map);
6216 return NULL;
6219 __isl_give isl_map *isl_map_partial_lexmax(
6220 __isl_take isl_map *map, __isl_take isl_set *dom,
6221 __isl_give isl_set **empty)
6223 return isl_map_partial_lexopt(map, dom, empty, 1);
6226 __isl_give isl_map *isl_map_partial_lexmin(
6227 __isl_take isl_map *map, __isl_take isl_set *dom,
6228 __isl_give isl_set **empty)
6230 return isl_map_partial_lexopt(map, dom, empty, 0);
6233 __isl_give isl_set *isl_set_partial_lexmin(
6234 __isl_take isl_set *set, __isl_take isl_set *dom,
6235 __isl_give isl_set **empty)
6237 return (struct isl_set *)
6238 isl_map_partial_lexmin((struct isl_map *)set,
6239 dom, empty);
6242 __isl_give isl_set *isl_set_partial_lexmax(
6243 __isl_take isl_set *set, __isl_take isl_set *dom,
6244 __isl_give isl_set **empty)
6246 return (struct isl_set *)
6247 isl_map_partial_lexmax((struct isl_map *)set,
6248 dom, empty);
6251 /* Compute the lexicographic minimum (or maximum if "max" is set)
6252 * of "bmap" over its domain.
6254 * Since we are not interested in the part of the domain space where
6255 * there is no solution, we initialize the domain to those constraints
6256 * of "bmap" that only involve the parameters and the input dimensions.
6257 * This relieves the parametric programming engine from detecting those
6258 * inequalities and transferring them to the context. More importantly,
6259 * it ensures that those inequalities are transferred first and not
6260 * intermixed with inequalities that actually split the domain.
6262 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
6264 int n_div;
6265 int n_out;
6266 isl_basic_map *copy;
6267 isl_basic_set *dom;
6269 n_div = isl_basic_map_dim(bmap, isl_dim_div);
6270 n_out = isl_basic_map_dim(bmap, isl_dim_out);
6271 copy = isl_basic_map_copy(bmap);
6272 copy = isl_basic_map_drop_constraints_involving_dims(copy,
6273 isl_dim_div, 0, n_div);
6274 copy = isl_basic_map_drop_constraints_involving_dims(copy,
6275 isl_dim_out, 0, n_out);
6276 dom = isl_basic_map_domain(copy);
6277 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
6280 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
6282 return isl_basic_map_lexopt(bmap, 0);
6285 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
6287 return isl_basic_map_lexopt(bmap, 1);
6290 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
6292 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
6295 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
6297 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
6300 /* Extract the first and only affine expression from list
6301 * and then add it to *pwaff with the given dom.
6302 * This domain is known to be disjoint from other domains
6303 * because of the way isl_basic_map_foreach_lexmax works.
6305 static int update_dim_opt(__isl_take isl_basic_set *dom,
6306 __isl_take isl_aff_list *list, void *user)
6308 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
6309 isl_aff *aff;
6310 isl_pw_aff **pwaff = user;
6311 isl_pw_aff *pwaff_i;
6313 if (!list)
6314 goto error;
6315 if (isl_aff_list_n_aff(list) != 1)
6316 isl_die(ctx, isl_error_internal,
6317 "expecting single element list", goto error);
6319 aff = isl_aff_list_get_aff(list, 0);
6320 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
6322 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
6324 isl_aff_list_free(list);
6326 return 0;
6327 error:
6328 isl_basic_set_free(dom);
6329 isl_aff_list_free(list);
6330 return -1;
6333 /* Given a basic map with one output dimension, compute the minimum or
6334 * maximum of that dimension as an isl_pw_aff.
6336 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6337 * call update_dim_opt on each leaf of the result.
6339 static __isl_give isl_pw_aff *basic_map_dim_opt(__isl_keep isl_basic_map *bmap,
6340 int max)
6342 isl_space *dim = isl_basic_map_get_space(bmap);
6343 isl_pw_aff *pwaff;
6344 int r;
6346 dim = isl_space_from_domain(isl_space_domain(dim));
6347 dim = isl_space_add_dims(dim, isl_dim_out, 1);
6348 pwaff = isl_pw_aff_empty(dim);
6350 r = isl_basic_map_foreach_lexopt(bmap, max, &update_dim_opt, &pwaff);
6351 if (r < 0)
6352 return isl_pw_aff_free(pwaff);
6354 return pwaff;
6357 /* Compute the minimum or maximum of the given output dimension
6358 * as a function of the parameters and the input dimensions,
6359 * but independently of the other output dimensions.
6361 * We first project out the other output dimension and then compute
6362 * the "lexicographic" maximum in each basic map, combining the results
6363 * using isl_pw_aff_union_max.
6365 static __isl_give isl_pw_aff *map_dim_opt(__isl_take isl_map *map, int pos,
6366 int max)
6368 int i;
6369 isl_pw_aff *pwaff;
6370 unsigned n_out;
6372 n_out = isl_map_dim(map, isl_dim_out);
6373 map = isl_map_project_out(map, isl_dim_out, pos + 1, n_out - (pos + 1));
6374 map = isl_map_project_out(map, isl_dim_out, 0, pos);
6375 if (!map)
6376 return NULL;
6378 if (map->n == 0) {
6379 isl_space *dim = isl_map_get_space(map);
6380 isl_map_free(map);
6381 return isl_pw_aff_empty(dim);
6384 pwaff = basic_map_dim_opt(map->p[0], max);
6385 for (i = 1; i < map->n; ++i) {
6386 isl_pw_aff *pwaff_i;
6388 pwaff_i = basic_map_dim_opt(map->p[i], max);
6389 pwaff = isl_pw_aff_union_opt(pwaff, pwaff_i, max);
6392 isl_map_free(map);
6394 return pwaff;
6397 /* Compute the maximum of the given output dimension as a function of the
6398 * parameters and input dimensions, but independently of
6399 * the other output dimensions.
6401 __isl_give isl_pw_aff *isl_map_dim_max(__isl_take isl_map *map, int pos)
6403 return map_dim_opt(map, pos, 1);
6406 /* Compute the minimum or maximum of the given set dimension
6407 * as a function of the parameters,
6408 * but independently of the other set dimensions.
6410 static __isl_give isl_pw_aff *set_dim_opt(__isl_take isl_set *set, int pos,
6411 int max)
6413 return map_dim_opt(set, pos, max);
6416 /* Compute the maximum of the given set dimension as a function of the
6417 * parameters, but independently of the other set dimensions.
6419 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
6421 return set_dim_opt(set, pos, 1);
6424 /* Compute the minimum of the given set dimension as a function of the
6425 * parameters, but independently of the other set dimensions.
6427 __isl_give isl_pw_aff *isl_set_dim_min(__isl_take isl_set *set, int pos)
6429 return set_dim_opt(set, pos, 0);
6432 /* Apply a preimage specified by "mat" on the parameters of "bset".
6433 * bset is assumed to have only parameters and divs.
6435 static struct isl_basic_set *basic_set_parameter_preimage(
6436 struct isl_basic_set *bset, struct isl_mat *mat)
6438 unsigned nparam;
6440 if (!bset || !mat)
6441 goto error;
6443 bset->dim = isl_space_cow(bset->dim);
6444 if (!bset->dim)
6445 goto error;
6447 nparam = isl_basic_set_dim(bset, isl_dim_param);
6449 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
6451 bset->dim->nparam = 0;
6452 bset->dim->n_out = nparam;
6453 bset = isl_basic_set_preimage(bset, mat);
6454 if (bset) {
6455 bset->dim->nparam = bset->dim->n_out;
6456 bset->dim->n_out = 0;
6458 return bset;
6459 error:
6460 isl_mat_free(mat);
6461 isl_basic_set_free(bset);
6462 return NULL;
6465 /* Apply a preimage specified by "mat" on the parameters of "set".
6466 * set is assumed to have only parameters and divs.
6468 static struct isl_set *set_parameter_preimage(
6469 struct isl_set *set, struct isl_mat *mat)
6471 isl_space *dim = NULL;
6472 unsigned nparam;
6474 if (!set || !mat)
6475 goto error;
6477 dim = isl_space_copy(set->dim);
6478 dim = isl_space_cow(dim);
6479 if (!dim)
6480 goto error;
6482 nparam = isl_set_dim(set, isl_dim_param);
6484 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
6486 dim->nparam = 0;
6487 dim->n_out = nparam;
6488 isl_set_reset_space(set, dim);
6489 set = isl_set_preimage(set, mat);
6490 if (!set)
6491 goto error2;
6492 dim = isl_space_copy(set->dim);
6493 dim = isl_space_cow(dim);
6494 if (!dim)
6495 goto error2;
6496 dim->nparam = dim->n_out;
6497 dim->n_out = 0;
6498 isl_set_reset_space(set, dim);
6499 return set;
6500 error:
6501 isl_space_free(dim);
6502 isl_mat_free(mat);
6503 error2:
6504 isl_set_free(set);
6505 return NULL;
6508 /* Intersect the basic set "bset" with the affine space specified by the
6509 * equalities in "eq".
6511 static struct isl_basic_set *basic_set_append_equalities(
6512 struct isl_basic_set *bset, struct isl_mat *eq)
6514 int i, k;
6515 unsigned len;
6517 if (!bset || !eq)
6518 goto error;
6520 bset = isl_basic_set_extend_space(bset, isl_space_copy(bset->dim), 0,
6521 eq->n_row, 0);
6522 if (!bset)
6523 goto error;
6525 len = 1 + isl_space_dim(bset->dim, isl_dim_all) + bset->extra;
6526 for (i = 0; i < eq->n_row; ++i) {
6527 k = isl_basic_set_alloc_equality(bset);
6528 if (k < 0)
6529 goto error;
6530 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
6531 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
6533 isl_mat_free(eq);
6535 bset = isl_basic_set_gauss(bset, NULL);
6536 bset = isl_basic_set_finalize(bset);
6538 return bset;
6539 error:
6540 isl_mat_free(eq);
6541 isl_basic_set_free(bset);
6542 return NULL;
6545 /* Intersect the set "set" with the affine space specified by the
6546 * equalities in "eq".
6548 static struct isl_set *set_append_equalities(struct isl_set *set,
6549 struct isl_mat *eq)
6551 int i;
6553 if (!set || !eq)
6554 goto error;
6556 for (i = 0; i < set->n; ++i) {
6557 set->p[i] = basic_set_append_equalities(set->p[i],
6558 isl_mat_copy(eq));
6559 if (!set->p[i])
6560 goto error;
6562 isl_mat_free(eq);
6563 return set;
6564 error:
6565 isl_mat_free(eq);
6566 isl_set_free(set);
6567 return NULL;
6570 /* Given a basic set "bset" that only involves parameters and existentially
6571 * quantified variables, return the index of the first equality
6572 * that only involves parameters. If there is no such equality then
6573 * return bset->n_eq.
6575 * This function assumes that isl_basic_set_gauss has been called on "bset".
6577 static int first_parameter_equality(__isl_keep isl_basic_set *bset)
6579 int i, j;
6580 unsigned nparam, n_div;
6582 if (!bset)
6583 return -1;
6585 nparam = isl_basic_set_dim(bset, isl_dim_param);
6586 n_div = isl_basic_set_dim(bset, isl_dim_div);
6588 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
6589 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
6590 ++i;
6593 return i;
6596 /* Compute an explicit representation for the existentially quantified
6597 * variables in "bset" by computing the "minimal value" of the set
6598 * variables. Since there are no set variables, the computation of
6599 * the minimal value essentially computes an explicit representation
6600 * of the non-empty part(s) of "bset".
6602 * The input only involves parameters and existentially quantified variables.
6603 * All equalities among parameters have been removed.
6605 * Since the existentially quantified variables in the result are in general
6606 * going to be different from those in the input, we first replace
6607 * them by the minimal number of variables based on their equalities.
6608 * This should simplify the parametric integer programming.
6610 static __isl_give isl_set *base_compute_divs(__isl_take isl_basic_set *bset)
6612 isl_morph *morph1, *morph2;
6613 isl_set *set;
6614 unsigned n;
6616 if (!bset)
6617 return NULL;
6618 if (bset->n_eq == 0)
6619 return isl_basic_set_lexmin(bset);
6621 morph1 = isl_basic_set_parameter_compression(bset);
6622 bset = isl_morph_basic_set(isl_morph_copy(morph1), bset);
6623 bset = isl_basic_set_lift(bset);
6624 morph2 = isl_basic_set_variable_compression(bset, isl_dim_set);
6625 bset = isl_morph_basic_set(morph2, bset);
6626 n = isl_basic_set_dim(bset, isl_dim_set);
6627 bset = isl_basic_set_project_out(bset, isl_dim_set, 0, n);
6629 set = isl_basic_set_lexmin(bset);
6631 set = isl_morph_set(isl_morph_inverse(morph1), set);
6633 return set;
6636 /* Project the given basic set onto its parameter domain, possibly introducing
6637 * new, explicit, existential variables in the constraints.
6638 * The input has parameters and (possibly implicit) existential variables.
6639 * The output has the same parameters, but only
6640 * explicit existentially quantified variables.
6642 * The actual projection is performed by pip, but pip doesn't seem
6643 * to like equalities very much, so we first remove the equalities
6644 * among the parameters by performing a variable compression on
6645 * the parameters. Afterward, an inverse transformation is performed
6646 * and the equalities among the parameters are inserted back in.
6648 * The variable compression on the parameters may uncover additional
6649 * equalities that were only implicit before. We therefore check
6650 * if there are any new parameter equalities in the result and
6651 * if so recurse. The removal of parameter equalities is required
6652 * for the parameter compression performed by base_compute_divs.
6654 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
6656 int i;
6657 struct isl_mat *eq;
6658 struct isl_mat *T, *T2;
6659 struct isl_set *set;
6660 unsigned nparam;
6662 bset = isl_basic_set_cow(bset);
6663 if (!bset)
6664 return NULL;
6666 if (bset->n_eq == 0)
6667 return base_compute_divs(bset);
6669 bset = isl_basic_set_gauss(bset, NULL);
6670 if (!bset)
6671 return NULL;
6672 if (isl_basic_set_plain_is_empty(bset))
6673 return isl_set_from_basic_set(bset);
6675 i = first_parameter_equality(bset);
6676 if (i == bset->n_eq)
6677 return base_compute_divs(bset);
6679 nparam = isl_basic_set_dim(bset, isl_dim_param);
6680 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
6681 0, 1 + nparam);
6682 eq = isl_mat_cow(eq);
6683 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
6684 if (T && T->n_col == 0) {
6685 isl_mat_free(T);
6686 isl_mat_free(T2);
6687 isl_mat_free(eq);
6688 bset = isl_basic_set_set_to_empty(bset);
6689 return isl_set_from_basic_set(bset);
6691 bset = basic_set_parameter_preimage(bset, T);
6693 i = first_parameter_equality(bset);
6694 if (!bset)
6695 set = NULL;
6696 else if (i == bset->n_eq)
6697 set = base_compute_divs(bset);
6698 else
6699 set = parameter_compute_divs(bset);
6700 set = set_parameter_preimage(set, T2);
6701 set = set_append_equalities(set, eq);
6702 return set;
6705 /* Insert the divs from "ls" before those of "bmap".
6707 * The number of columns is not changed, which means that the last
6708 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6709 * The caller is responsible for removing the same number of dimensions
6710 * from the space of "bmap".
6712 static __isl_give isl_basic_map *insert_divs_from_local_space(
6713 __isl_take isl_basic_map *bmap, __isl_keep isl_local_space *ls)
6715 int i;
6716 int n_div;
6717 int old_n_div;
6719 n_div = isl_local_space_dim(ls, isl_dim_div);
6720 if (n_div == 0)
6721 return bmap;
6723 old_n_div = bmap->n_div;
6724 bmap = insert_div_rows(bmap, n_div);
6725 if (!bmap)
6726 return NULL;
6728 for (i = 0; i < n_div; ++i) {
6729 isl_seq_cpy(bmap->div[i], ls->div->row[i], ls->div->n_col);
6730 isl_seq_clr(bmap->div[i] + ls->div->n_col, old_n_div);
6733 return bmap;
6736 /* Replace the space of "bmap" by the space and divs of "ls".
6738 * If "ls" has any divs, then we simplify the result since we may
6739 * have discovered some additional equalities that could simplify
6740 * the div expressions.
6742 static __isl_give isl_basic_map *basic_replace_space_by_local_space(
6743 __isl_take isl_basic_map *bmap, __isl_take isl_local_space *ls)
6745 int n_div;
6747 bmap = isl_basic_map_cow(bmap);
6748 if (!bmap || !ls)
6749 goto error;
6751 n_div = isl_local_space_dim(ls, isl_dim_div);
6752 bmap = insert_divs_from_local_space(bmap, ls);
6753 if (!bmap)
6754 goto error;
6756 isl_space_free(bmap->dim);
6757 bmap->dim = isl_local_space_get_space(ls);
6758 if (!bmap->dim)
6759 goto error;
6761 isl_local_space_free(ls);
6762 if (n_div > 0)
6763 bmap = isl_basic_map_simplify(bmap);
6764 bmap = isl_basic_map_finalize(bmap);
6765 return bmap;
6766 error:
6767 isl_basic_map_free(bmap);
6768 isl_local_space_free(ls);
6769 return NULL;
6772 /* Replace the space of "map" by the space and divs of "ls".
6774 static __isl_give isl_map *replace_space_by_local_space(__isl_take isl_map *map,
6775 __isl_take isl_local_space *ls)
6777 int i;
6779 map = isl_map_cow(map);
6780 if (!map || !ls)
6781 goto error;
6783 for (i = 0; i < map->n; ++i) {
6784 map->p[i] = basic_replace_space_by_local_space(map->p[i],
6785 isl_local_space_copy(ls));
6786 if (!map->p[i])
6787 goto error;
6789 isl_space_free(map->dim);
6790 map->dim = isl_local_space_get_space(ls);
6791 if (!map->dim)
6792 goto error;
6794 isl_local_space_free(ls);
6795 return map;
6796 error:
6797 isl_local_space_free(ls);
6798 isl_map_free(map);
6799 return NULL;
6802 /* Compute an explicit representation for the existentially
6803 * quantified variables for which do not know any explicit representation yet.
6805 * We first sort the existentially quantified variables so that the
6806 * existentially quantified variables for which we already have an explicit
6807 * representation are placed before those for which we do not.
6808 * The input dimensions, the output dimensions and the existentially
6809 * quantified variables for which we already have an explicit
6810 * representation are then turned into parameters.
6811 * compute_divs returns a map with the same parameters and
6812 * no input or output dimensions and the dimension specification
6813 * is reset to that of the input, including the existentially quantified
6814 * variables for which we already had an explicit representation.
6816 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
6818 struct isl_basic_set *bset;
6819 struct isl_set *set;
6820 struct isl_map *map;
6821 isl_space *dim;
6822 isl_local_space *ls;
6823 unsigned nparam;
6824 unsigned n_in;
6825 unsigned n_out;
6826 unsigned n_known;
6827 int i;
6829 bmap = isl_basic_map_sort_divs(bmap);
6830 bmap = isl_basic_map_cow(bmap);
6831 if (!bmap)
6832 return NULL;
6834 for (n_known = 0; n_known < bmap->n_div; ++n_known)
6835 if (isl_int_is_zero(bmap->div[n_known][0]))
6836 break;
6838 nparam = isl_basic_map_dim(bmap, isl_dim_param);
6839 n_in = isl_basic_map_dim(bmap, isl_dim_in);
6840 n_out = isl_basic_map_dim(bmap, isl_dim_out);
6841 dim = isl_space_set_alloc(bmap->ctx,
6842 nparam + n_in + n_out + n_known, 0);
6843 if (!dim)
6844 goto error;
6846 ls = isl_basic_map_get_local_space(bmap);
6847 ls = isl_local_space_drop_dims(ls, isl_dim_div,
6848 n_known, bmap->n_div - n_known);
6849 if (n_known > 0) {
6850 for (i = n_known; i < bmap->n_div; ++i)
6851 swap_div(bmap, i - n_known, i);
6852 bmap->n_div -= n_known;
6853 bmap->extra -= n_known;
6855 bmap = isl_basic_map_reset_space(bmap, dim);
6856 bset = (struct isl_basic_set *)bmap;
6858 set = parameter_compute_divs(bset);
6859 map = (struct isl_map *)set;
6860 map = replace_space_by_local_space(map, ls);
6862 return map;
6863 error:
6864 isl_basic_map_free(bmap);
6865 return NULL;
6868 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
6870 int i;
6871 unsigned off;
6873 if (!bmap)
6874 return -1;
6876 off = isl_space_dim(bmap->dim, isl_dim_all);
6877 for (i = 0; i < bmap->n_div; ++i) {
6878 if (isl_int_is_zero(bmap->div[i][0]))
6879 return 0;
6880 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
6881 return -1);
6883 return 1;
6886 static int map_divs_known(__isl_keep isl_map *map)
6888 int i;
6890 if (!map)
6891 return -1;
6893 for (i = 0; i < map->n; ++i) {
6894 int known = isl_basic_map_divs_known(map->p[i]);
6895 if (known <= 0)
6896 return known;
6899 return 1;
6902 /* If bmap contains any unknown divs, then compute explicit
6903 * expressions for them. However, this computation may be
6904 * quite expensive, so first try to remove divs that aren't
6905 * strictly needed.
6907 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
6909 int known;
6910 struct isl_map *map;
6912 known = isl_basic_map_divs_known(bmap);
6913 if (known < 0)
6914 goto error;
6915 if (known)
6916 return isl_map_from_basic_map(bmap);
6918 bmap = isl_basic_map_drop_redundant_divs(bmap);
6920 known = isl_basic_map_divs_known(bmap);
6921 if (known < 0)
6922 goto error;
6923 if (known)
6924 return isl_map_from_basic_map(bmap);
6926 map = compute_divs(bmap);
6927 return map;
6928 error:
6929 isl_basic_map_free(bmap);
6930 return NULL;
6933 struct isl_map *isl_map_compute_divs(struct isl_map *map)
6935 int i;
6936 int known;
6937 struct isl_map *res;
6939 if (!map)
6940 return NULL;
6941 if (map->n == 0)
6942 return map;
6944 known = map_divs_known(map);
6945 if (known < 0) {
6946 isl_map_free(map);
6947 return NULL;
6949 if (known)
6950 return map;
6952 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
6953 for (i = 1 ; i < map->n; ++i) {
6954 struct isl_map *r2;
6955 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
6956 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
6957 res = isl_map_union_disjoint(res, r2);
6958 else
6959 res = isl_map_union(res, r2);
6961 isl_map_free(map);
6963 return res;
6966 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
6968 return (struct isl_set *)
6969 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
6972 struct isl_set *isl_set_compute_divs(struct isl_set *set)
6974 return (struct isl_set *)
6975 isl_map_compute_divs((struct isl_map *)set);
6978 struct isl_set *isl_map_domain(struct isl_map *map)
6980 int i;
6981 struct isl_set *set;
6983 if (!map)
6984 goto error;
6986 map = isl_map_cow(map);
6987 if (!map)
6988 return NULL;
6990 set = (struct isl_set *)map;
6991 set->dim = isl_space_domain(set->dim);
6992 if (!set->dim)
6993 goto error;
6994 for (i = 0; i < map->n; ++i) {
6995 set->p[i] = isl_basic_map_domain(map->p[i]);
6996 if (!set->p[i])
6997 goto error;
6999 ISL_F_CLR(set, ISL_MAP_DISJOINT);
7000 ISL_F_CLR(set, ISL_SET_NORMALIZED);
7001 return set;
7002 error:
7003 isl_map_free(map);
7004 return NULL;
7007 /* Return the union of "map1" and "map2", where we assume for now that
7008 * "map1" and "map2" are disjoint. Note that the basic maps inside
7009 * "map1" or "map2" may not be disjoint from each other.
7010 * Also note that this function is also called from isl_map_union,
7011 * which takes care of handling the situation where "map1" and "map2"
7012 * may not be disjoint.
7014 * If one of the inputs is empty, we can simply return the other input.
7015 * Similarly, if one of the inputs is universal, then it is equal to the union.
7017 static __isl_give isl_map *map_union_disjoint(__isl_take isl_map *map1,
7018 __isl_take isl_map *map2)
7020 int i;
7021 unsigned flags = 0;
7022 struct isl_map *map = NULL;
7023 int is_universe;
7025 if (!map1 || !map2)
7026 goto error;
7028 if (!isl_space_is_equal(map1->dim, map2->dim))
7029 isl_die(isl_map_get_ctx(map1), isl_error_invalid,
7030 "spaces don't match", goto error);
7032 if (map1->n == 0) {
7033 isl_map_free(map1);
7034 return map2;
7036 if (map2->n == 0) {
7037 isl_map_free(map2);
7038 return map1;
7041 is_universe = isl_map_plain_is_universe(map1);
7042 if (is_universe < 0)
7043 goto error;
7044 if (is_universe) {
7045 isl_map_free(map2);
7046 return map1;
7049 is_universe = isl_map_plain_is_universe(map2);
7050 if (is_universe < 0)
7051 goto error;
7052 if (is_universe) {
7053 isl_map_free(map1);
7054 return map2;
7057 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7058 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7059 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7061 map = isl_map_alloc_space(isl_space_copy(map1->dim),
7062 map1->n + map2->n, flags);
7063 if (!map)
7064 goto error;
7065 for (i = 0; i < map1->n; ++i) {
7066 map = isl_map_add_basic_map(map,
7067 isl_basic_map_copy(map1->p[i]));
7068 if (!map)
7069 goto error;
7071 for (i = 0; i < map2->n; ++i) {
7072 map = isl_map_add_basic_map(map,
7073 isl_basic_map_copy(map2->p[i]));
7074 if (!map)
7075 goto error;
7077 isl_map_free(map1);
7078 isl_map_free(map2);
7079 return map;
7080 error:
7081 isl_map_free(map);
7082 isl_map_free(map1);
7083 isl_map_free(map2);
7084 return NULL;
7087 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7088 * guaranteed to be disjoint by the caller.
7090 * Note that this functions is called from within isl_map_make_disjoint,
7091 * so we have to be careful not to touch the constraints of the inputs
7092 * in any way.
7094 __isl_give isl_map *isl_map_union_disjoint(__isl_take isl_map *map1,
7095 __isl_take isl_map *map2)
7097 return isl_map_align_params_map_map_and(map1, map2, &map_union_disjoint);
7100 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7101 * not be disjoint. The parameters are assumed to have been aligned.
7103 * We currently simply call map_union_disjoint, the internal operation
7104 * of which does not really depend on the inputs being disjoint.
7105 * If the result contains more than one basic map, then we clear
7106 * the disjoint flag since the result may contain basic maps from
7107 * both inputs and these are not guaranteed to be disjoint.
7109 * As a special case, if "map1" and "map2" are obviously equal,
7110 * then we simply return "map1".
7112 static __isl_give isl_map *map_union_aligned(__isl_take isl_map *map1,
7113 __isl_take isl_map *map2)
7115 int equal;
7117 if (!map1 || !map2)
7118 goto error;
7120 equal = isl_map_plain_is_equal(map1, map2);
7121 if (equal < 0)
7122 goto error;
7123 if (equal) {
7124 isl_map_free(map2);
7125 return map1;
7128 map1 = map_union_disjoint(map1, map2);
7129 if (!map1)
7130 return NULL;
7131 if (map1->n > 1)
7132 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
7133 return map1;
7134 error:
7135 isl_map_free(map1);
7136 isl_map_free(map2);
7137 return NULL;
7140 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7141 * not be disjoint.
7143 __isl_give isl_map *isl_map_union(__isl_take isl_map *map1,
7144 __isl_take isl_map *map2)
7146 return isl_map_align_params_map_map_and(map1, map2, &map_union_aligned);
7149 struct isl_set *isl_set_union_disjoint(
7150 struct isl_set *set1, struct isl_set *set2)
7152 return (struct isl_set *)
7153 isl_map_union_disjoint(
7154 (struct isl_map *)set1, (struct isl_map *)set2);
7157 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
7159 return (struct isl_set *)
7160 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
7163 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7164 * the results.
7166 * "map" and "set" are assumed to be compatible and non-NULL.
7168 static __isl_give isl_map *map_intersect_set(__isl_take isl_map *map,
7169 __isl_take isl_set *set,
7170 __isl_give isl_basic_map *fn(__isl_take isl_basic_map *bmap,
7171 __isl_take isl_basic_set *bset))
7173 unsigned flags = 0;
7174 struct isl_map *result;
7175 int i, j;
7177 if (isl_set_plain_is_universe(set)) {
7178 isl_set_free(set);
7179 return map;
7182 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
7183 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
7184 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7186 result = isl_map_alloc_space(isl_space_copy(map->dim),
7187 map->n * set->n, flags);
7188 for (i = 0; result && i < map->n; ++i)
7189 for (j = 0; j < set->n; ++j) {
7190 result = isl_map_add_basic_map(result,
7191 fn(isl_basic_map_copy(map->p[i]),
7192 isl_basic_set_copy(set->p[j])));
7193 if (!result)
7194 break;
7197 isl_map_free(map);
7198 isl_set_free(set);
7199 return result;
7202 static __isl_give isl_map *map_intersect_range(__isl_take isl_map *map,
7203 __isl_take isl_set *set)
7205 if (!map || !set)
7206 goto error;
7208 if (!isl_map_compatible_range(map, set))
7209 isl_die(set->ctx, isl_error_invalid,
7210 "incompatible spaces", goto error);
7212 return map_intersect_set(map, set, &isl_basic_map_intersect_range);
7213 error:
7214 isl_map_free(map);
7215 isl_set_free(set);
7216 return NULL;
7219 __isl_give isl_map *isl_map_intersect_range(__isl_take isl_map *map,
7220 __isl_take isl_set *set)
7222 return isl_map_align_params_map_map_and(map, set, &map_intersect_range);
7225 static __isl_give isl_map *map_intersect_domain(__isl_take isl_map *map,
7226 __isl_take isl_set *set)
7228 if (!map || !set)
7229 goto error;
7231 if (!isl_map_compatible_domain(map, set))
7232 isl_die(set->ctx, isl_error_invalid,
7233 "incompatible spaces", goto error);
7235 return map_intersect_set(map, set, &isl_basic_map_intersect_domain);
7236 error:
7237 isl_map_free(map);
7238 isl_set_free(set);
7239 return NULL;
7242 __isl_give isl_map *isl_map_intersect_domain(__isl_take isl_map *map,
7243 __isl_take isl_set *set)
7245 return isl_map_align_params_map_map_and(map, set,
7246 &map_intersect_domain);
7249 static __isl_give isl_map *map_apply_domain(__isl_take isl_map *map1,
7250 __isl_take isl_map *map2)
7252 if (!map1 || !map2)
7253 goto error;
7254 map1 = isl_map_reverse(map1);
7255 map1 = isl_map_apply_range(map1, map2);
7256 return isl_map_reverse(map1);
7257 error:
7258 isl_map_free(map1);
7259 isl_map_free(map2);
7260 return NULL;
7263 __isl_give isl_map *isl_map_apply_domain(__isl_take isl_map *map1,
7264 __isl_take isl_map *map2)
7266 return isl_map_align_params_map_map_and(map1, map2, &map_apply_domain);
7269 static __isl_give isl_map *map_apply_range(__isl_take isl_map *map1,
7270 __isl_take isl_map *map2)
7272 isl_space *dim_result;
7273 struct isl_map *result;
7274 int i, j;
7276 if (!map1 || !map2)
7277 goto error;
7279 dim_result = isl_space_join(isl_space_copy(map1->dim),
7280 isl_space_copy(map2->dim));
7282 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
7283 if (!result)
7284 goto error;
7285 for (i = 0; i < map1->n; ++i)
7286 for (j = 0; j < map2->n; ++j) {
7287 result = isl_map_add_basic_map(result,
7288 isl_basic_map_apply_range(
7289 isl_basic_map_copy(map1->p[i]),
7290 isl_basic_map_copy(map2->p[j])));
7291 if (!result)
7292 goto error;
7294 isl_map_free(map1);
7295 isl_map_free(map2);
7296 if (result && result->n <= 1)
7297 ISL_F_SET(result, ISL_MAP_DISJOINT);
7298 return result;
7299 error:
7300 isl_map_free(map1);
7301 isl_map_free(map2);
7302 return NULL;
7305 __isl_give isl_map *isl_map_apply_range(__isl_take isl_map *map1,
7306 __isl_take isl_map *map2)
7308 return isl_map_align_params_map_map_and(map1, map2, &map_apply_range);
7312 * returns range - domain
7314 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
7316 isl_space *target_space;
7317 struct isl_basic_set *bset;
7318 unsigned dim;
7319 unsigned nparam;
7320 int i;
7322 if (!bmap)
7323 goto error;
7324 isl_assert(bmap->ctx, isl_space_tuple_is_equal(bmap->dim, isl_dim_in,
7325 bmap->dim, isl_dim_out),
7326 goto error);
7327 target_space = isl_space_domain(isl_basic_map_get_space(bmap));
7328 dim = isl_basic_map_n_in(bmap);
7329 nparam = isl_basic_map_n_param(bmap);
7330 bmap = isl_basic_map_from_range(isl_basic_map_wrap(bmap));
7331 bmap = isl_basic_map_add_dims(bmap, isl_dim_in, dim);
7332 bmap = isl_basic_map_extend_constraints(bmap, dim, 0);
7333 for (i = 0; i < dim; ++i) {
7334 int j = isl_basic_map_alloc_equality(bmap);
7335 if (j < 0) {
7336 bmap = isl_basic_map_free(bmap);
7337 break;
7339 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
7340 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
7341 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], 1);
7342 isl_int_set_si(bmap->eq[j][1+nparam+2*dim+i], -1);
7344 bset = isl_basic_map_domain(bmap);
7345 bset = isl_basic_set_reset_space(bset, target_space);
7346 return bset;
7347 error:
7348 isl_basic_map_free(bmap);
7349 return NULL;
7353 * returns range - domain
7355 __isl_give isl_set *isl_map_deltas(__isl_take isl_map *map)
7357 int i;
7358 isl_space *dim;
7359 struct isl_set *result;
7361 if (!map)
7362 return NULL;
7364 isl_assert(map->ctx, isl_space_tuple_is_equal(map->dim, isl_dim_in,
7365 map->dim, isl_dim_out),
7366 goto error);
7367 dim = isl_map_get_space(map);
7368 dim = isl_space_domain(dim);
7369 result = isl_set_alloc_space(dim, map->n, 0);
7370 if (!result)
7371 goto error;
7372 for (i = 0; i < map->n; ++i)
7373 result = isl_set_add_basic_set(result,
7374 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
7375 isl_map_free(map);
7376 return result;
7377 error:
7378 isl_map_free(map);
7379 return NULL;
7383 * returns [domain -> range] -> range - domain
7385 __isl_give isl_basic_map *isl_basic_map_deltas_map(
7386 __isl_take isl_basic_map *bmap)
7388 int i, k;
7389 isl_space *dim;
7390 isl_basic_map *domain;
7391 int nparam, n;
7392 unsigned total;
7394 if (!isl_space_tuple_is_equal(bmap->dim, isl_dim_in,
7395 bmap->dim, isl_dim_out))
7396 isl_die(bmap->ctx, isl_error_invalid,
7397 "domain and range don't match", goto error);
7399 nparam = isl_basic_map_dim(bmap, isl_dim_param);
7400 n = isl_basic_map_dim(bmap, isl_dim_in);
7402 dim = isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap)));
7403 domain = isl_basic_map_universe(dim);
7405 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
7406 bmap = isl_basic_map_apply_range(bmap, domain);
7407 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
7409 total = isl_basic_map_total_dim(bmap);
7411 for (i = 0; i < n; ++i) {
7412 k = isl_basic_map_alloc_equality(bmap);
7413 if (k < 0)
7414 goto error;
7415 isl_seq_clr(bmap->eq[k], 1 + total);
7416 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
7417 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
7418 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
7421 bmap = isl_basic_map_gauss(bmap, NULL);
7422 return isl_basic_map_finalize(bmap);
7423 error:
7424 isl_basic_map_free(bmap);
7425 return NULL;
7429 * returns [domain -> range] -> range - domain
7431 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
7433 int i;
7434 isl_space *domain_dim;
7436 if (!map)
7437 return NULL;
7439 if (!isl_space_tuple_is_equal(map->dim, isl_dim_in,
7440 map->dim, isl_dim_out))
7441 isl_die(map->ctx, isl_error_invalid,
7442 "domain and range don't match", goto error);
7444 map = isl_map_cow(map);
7445 if (!map)
7446 return NULL;
7448 domain_dim = isl_space_from_range(isl_space_domain(isl_map_get_space(map)));
7449 map->dim = isl_space_from_domain(isl_space_wrap(map->dim));
7450 map->dim = isl_space_join(map->dim, domain_dim);
7451 if (!map->dim)
7452 goto error;
7453 for (i = 0; i < map->n; ++i) {
7454 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
7455 if (!map->p[i])
7456 goto error;
7458 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
7459 return map;
7460 error:
7461 isl_map_free(map);
7462 return NULL;
7465 static __isl_give isl_basic_map *basic_map_identity(__isl_take isl_space *dims)
7467 struct isl_basic_map *bmap;
7468 unsigned nparam;
7469 unsigned dim;
7470 int i;
7472 if (!dims)
7473 return NULL;
7475 nparam = dims->nparam;
7476 dim = dims->n_out;
7477 bmap = isl_basic_map_alloc_space(dims, 0, dim, 0);
7478 if (!bmap)
7479 goto error;
7481 for (i = 0; i < dim; ++i) {
7482 int j = isl_basic_map_alloc_equality(bmap);
7483 if (j < 0)
7484 goto error;
7485 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
7486 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
7487 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
7489 return isl_basic_map_finalize(bmap);
7490 error:
7491 isl_basic_map_free(bmap);
7492 return NULL;
7495 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_space *dim)
7497 if (!dim)
7498 return NULL;
7499 if (dim->n_in != dim->n_out)
7500 isl_die(dim->ctx, isl_error_invalid,
7501 "number of input and output dimensions needs to be "
7502 "the same", goto error);
7503 return basic_map_identity(dim);
7504 error:
7505 isl_space_free(dim);
7506 return NULL;
7509 __isl_give isl_map *isl_map_identity(__isl_take isl_space *dim)
7511 return isl_map_from_basic_map(isl_basic_map_identity(dim));
7514 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
7516 isl_space *dim = isl_set_get_space(set);
7517 isl_map *id;
7518 id = isl_map_identity(isl_space_map_from_set(dim));
7519 return isl_map_intersect_range(id, set);
7522 /* Construct a basic set with all set dimensions having only non-negative
7523 * values.
7525 __isl_give isl_basic_set *isl_basic_set_positive_orthant(
7526 __isl_take isl_space *space)
7528 int i;
7529 unsigned nparam;
7530 unsigned dim;
7531 struct isl_basic_set *bset;
7533 if (!space)
7534 return NULL;
7535 nparam = space->nparam;
7536 dim = space->n_out;
7537 bset = isl_basic_set_alloc_space(space, 0, 0, dim);
7538 if (!bset)
7539 return NULL;
7540 for (i = 0; i < dim; ++i) {
7541 int k = isl_basic_set_alloc_inequality(bset);
7542 if (k < 0)
7543 goto error;
7544 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
7545 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
7547 return bset;
7548 error:
7549 isl_basic_set_free(bset);
7550 return NULL;
7553 /* Construct the half-space x_pos >= 0.
7555 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_space *dim,
7556 int pos)
7558 int k;
7559 isl_basic_set *nonneg;
7561 nonneg = isl_basic_set_alloc_space(dim, 0, 0, 1);
7562 k = isl_basic_set_alloc_inequality(nonneg);
7563 if (k < 0)
7564 goto error;
7565 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
7566 isl_int_set_si(nonneg->ineq[k][pos], 1);
7568 return isl_basic_set_finalize(nonneg);
7569 error:
7570 isl_basic_set_free(nonneg);
7571 return NULL;
7574 /* Construct the half-space x_pos <= -1.
7576 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_space *dim, int pos)
7578 int k;
7579 isl_basic_set *neg;
7581 neg = isl_basic_set_alloc_space(dim, 0, 0, 1);
7582 k = isl_basic_set_alloc_inequality(neg);
7583 if (k < 0)
7584 goto error;
7585 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
7586 isl_int_set_si(neg->ineq[k][0], -1);
7587 isl_int_set_si(neg->ineq[k][pos], -1);
7589 return isl_basic_set_finalize(neg);
7590 error:
7591 isl_basic_set_free(neg);
7592 return NULL;
7595 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
7596 enum isl_dim_type type, unsigned first, unsigned n)
7598 int i;
7599 unsigned offset;
7600 isl_basic_set *nonneg;
7601 isl_basic_set *neg;
7603 if (!set)
7604 return NULL;
7605 if (n == 0)
7606 return set;
7608 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
7610 offset = pos(set->dim, type);
7611 for (i = 0; i < n; ++i) {
7612 nonneg = nonneg_halfspace(isl_set_get_space(set),
7613 offset + first + i);
7614 neg = neg_halfspace(isl_set_get_space(set), offset + first + i);
7616 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
7619 return set;
7620 error:
7621 isl_set_free(set);
7622 return NULL;
7625 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
7626 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
7627 void *user)
7629 isl_set *half;
7631 if (!set)
7632 return -1;
7633 if (isl_set_plain_is_empty(set)) {
7634 isl_set_free(set);
7635 return 0;
7637 if (first == len)
7638 return fn(set, signs, user);
7640 signs[first] = 1;
7641 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set),
7642 1 + first));
7643 half = isl_set_intersect(half, isl_set_copy(set));
7644 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
7645 goto error;
7647 signs[first] = -1;
7648 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set),
7649 1 + first));
7650 half = isl_set_intersect(half, set);
7651 return foreach_orthant(half, signs, first + 1, len, fn, user);
7652 error:
7653 isl_set_free(set);
7654 return -1;
7657 /* Call "fn" on the intersections of "set" with each of the orthants
7658 * (except for obviously empty intersections). The orthant is identified
7659 * by the signs array, with each entry having value 1 or -1 according
7660 * to the sign of the corresponding variable.
7662 int isl_set_foreach_orthant(__isl_keep isl_set *set,
7663 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
7664 void *user)
7666 unsigned nparam;
7667 unsigned nvar;
7668 int *signs;
7669 int r;
7671 if (!set)
7672 return -1;
7673 if (isl_set_plain_is_empty(set))
7674 return 0;
7676 nparam = isl_set_dim(set, isl_dim_param);
7677 nvar = isl_set_dim(set, isl_dim_set);
7679 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
7681 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
7682 fn, user);
7684 free(signs);
7686 return r;
7689 isl_bool isl_set_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7691 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
7694 isl_bool isl_basic_map_is_subset(__isl_keep isl_basic_map *bmap1,
7695 __isl_keep isl_basic_map *bmap2)
7697 int is_subset;
7698 struct isl_map *map1;
7699 struct isl_map *map2;
7701 if (!bmap1 || !bmap2)
7702 return isl_bool_error;
7704 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
7705 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
7707 is_subset = isl_map_is_subset(map1, map2);
7709 isl_map_free(map1);
7710 isl_map_free(map2);
7712 return is_subset;
7715 isl_bool isl_basic_set_is_subset(__isl_keep isl_basic_set *bset1,
7716 __isl_keep isl_basic_set *bset2)
7718 return isl_basic_map_is_subset(bset1, bset2);
7721 isl_bool isl_basic_map_is_equal(__isl_keep isl_basic_map *bmap1,
7722 __isl_keep isl_basic_map *bmap2)
7724 isl_bool is_subset;
7726 if (!bmap1 || !bmap2)
7727 return isl_bool_error;
7728 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
7729 if (is_subset != isl_bool_true)
7730 return is_subset;
7731 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
7732 return is_subset;
7735 isl_bool isl_basic_set_is_equal(__isl_keep isl_basic_set *bset1,
7736 __isl_keep isl_basic_set *bset2)
7738 return isl_basic_map_is_equal(
7739 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
7742 isl_bool isl_map_is_empty(__isl_keep isl_map *map)
7744 int i;
7745 int is_empty;
7747 if (!map)
7748 return isl_bool_error;
7749 for (i = 0; i < map->n; ++i) {
7750 is_empty = isl_basic_map_is_empty(map->p[i]);
7751 if (is_empty < 0)
7752 return isl_bool_error;
7753 if (!is_empty)
7754 return isl_bool_false;
7756 return isl_bool_true;
7759 isl_bool isl_map_plain_is_empty(__isl_keep isl_map *map)
7761 return map ? map->n == 0 : isl_bool_error;
7764 isl_bool isl_set_plain_is_empty(__isl_keep isl_set *set)
7766 return set ? set->n == 0 : isl_bool_error;
7769 isl_bool isl_set_is_empty(__isl_keep isl_set *set)
7771 return isl_map_is_empty((struct isl_map *)set);
7774 int isl_map_has_equal_space(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7776 if (!map1 || !map2)
7777 return -1;
7779 return isl_space_is_equal(map1->dim, map2->dim);
7782 int isl_set_has_equal_space(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7784 if (!set1 || !set2)
7785 return -1;
7787 return isl_space_is_equal(set1->dim, set2->dim);
7790 static isl_bool map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7792 isl_bool is_subset;
7794 if (!map1 || !map2)
7795 return isl_bool_error;
7796 is_subset = isl_map_is_subset(map1, map2);
7797 if (is_subset != isl_bool_true)
7798 return is_subset;
7799 is_subset = isl_map_is_subset(map2, map1);
7800 return is_subset;
7803 isl_bool isl_map_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7805 return isl_map_align_params_map_map_and_test(map1, map2, &map_is_equal);
7808 isl_bool isl_basic_map_is_strict_subset(
7809 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7811 isl_bool is_subset;
7813 if (!bmap1 || !bmap2)
7814 return isl_bool_error;
7815 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
7816 if (is_subset != isl_bool_true)
7817 return is_subset;
7818 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
7819 if (is_subset == isl_bool_error)
7820 return is_subset;
7821 return !is_subset;
7824 isl_bool isl_map_is_strict_subset(__isl_keep isl_map *map1,
7825 __isl_keep isl_map *map2)
7827 isl_bool is_subset;
7829 if (!map1 || !map2)
7830 return isl_bool_error;
7831 is_subset = isl_map_is_subset(map1, map2);
7832 if (is_subset != isl_bool_true)
7833 return is_subset;
7834 is_subset = isl_map_is_subset(map2, map1);
7835 if (is_subset == isl_bool_error)
7836 return is_subset;
7837 return !is_subset;
7840 isl_bool isl_set_is_strict_subset(__isl_keep isl_set *set1,
7841 __isl_keep isl_set *set2)
7843 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
7846 isl_bool isl_basic_map_is_universe(__isl_keep isl_basic_map *bmap)
7848 if (!bmap)
7849 return isl_bool_error;
7850 return bmap->n_eq == 0 && bmap->n_ineq == 0;
7853 isl_bool isl_basic_set_is_universe(__isl_keep isl_basic_set *bset)
7855 if (!bset)
7856 return isl_bool_error;
7857 return bset->n_eq == 0 && bset->n_ineq == 0;
7860 isl_bool isl_map_plain_is_universe(__isl_keep isl_map *map)
7862 int i;
7864 if (!map)
7865 return isl_bool_error;
7867 for (i = 0; i < map->n; ++i) {
7868 isl_bool r = isl_basic_map_is_universe(map->p[i]);
7869 if (r < 0 || r)
7870 return r;
7873 return isl_bool_false;
7876 isl_bool isl_set_plain_is_universe(__isl_keep isl_set *set)
7878 return isl_map_plain_is_universe((isl_map *) set);
7881 isl_bool isl_basic_map_is_empty(__isl_keep isl_basic_map *bmap)
7883 struct isl_basic_set *bset = NULL;
7884 struct isl_vec *sample = NULL;
7885 isl_bool empty;
7886 unsigned total;
7888 if (!bmap)
7889 return isl_bool_error;
7891 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
7892 return isl_bool_true;
7894 if (isl_basic_map_is_universe(bmap))
7895 return isl_bool_false;
7897 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
7898 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
7899 copy = isl_basic_map_remove_redundancies(copy);
7900 empty = isl_basic_map_plain_is_empty(copy);
7901 isl_basic_map_free(copy);
7902 return empty;
7905 total = 1 + isl_basic_map_total_dim(bmap);
7906 if (bmap->sample && bmap->sample->size == total) {
7907 int contains = isl_basic_map_contains(bmap, bmap->sample);
7908 if (contains < 0)
7909 return isl_bool_error;
7910 if (contains)
7911 return isl_bool_false;
7913 isl_vec_free(bmap->sample);
7914 bmap->sample = NULL;
7915 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
7916 if (!bset)
7917 return isl_bool_error;
7918 sample = isl_basic_set_sample_vec(bset);
7919 if (!sample)
7920 return isl_bool_error;
7921 empty = sample->size == 0;
7922 isl_vec_free(bmap->sample);
7923 bmap->sample = sample;
7924 if (empty)
7925 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
7927 return empty;
7930 isl_bool isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
7932 if (!bmap)
7933 return isl_bool_error;
7934 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
7937 isl_bool isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
7939 if (!bset)
7940 return isl_bool_error;
7941 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
7944 isl_bool isl_basic_set_is_empty(__isl_keep isl_basic_set *bset)
7946 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
7949 struct isl_map *isl_basic_map_union(
7950 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7952 struct isl_map *map;
7953 if (!bmap1 || !bmap2)
7954 goto error;
7956 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim), goto error);
7958 map = isl_map_alloc_space(isl_space_copy(bmap1->dim), 2, 0);
7959 if (!map)
7960 goto error;
7961 map = isl_map_add_basic_map(map, bmap1);
7962 map = isl_map_add_basic_map(map, bmap2);
7963 return map;
7964 error:
7965 isl_basic_map_free(bmap1);
7966 isl_basic_map_free(bmap2);
7967 return NULL;
7970 struct isl_set *isl_basic_set_union(
7971 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
7973 return (struct isl_set *)isl_basic_map_union(
7974 (struct isl_basic_map *)bset1,
7975 (struct isl_basic_map *)bset2);
7978 /* Order divs such that any div only depends on previous divs */
7979 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
7981 int i;
7982 unsigned off;
7984 if (!bmap)
7985 return NULL;
7987 off = isl_space_dim(bmap->dim, isl_dim_all);
7989 for (i = 0; i < bmap->n_div; ++i) {
7990 int pos;
7991 if (isl_int_is_zero(bmap->div[i][0]))
7992 continue;
7993 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
7994 bmap->n_div-i);
7995 if (pos == -1)
7996 continue;
7997 isl_basic_map_swap_div(bmap, i, i + pos);
7998 --i;
8000 return bmap;
8003 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
8005 return (struct isl_basic_set *)
8006 isl_basic_map_order_divs((struct isl_basic_map *)bset);
8009 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
8011 int i;
8013 if (!map)
8014 return 0;
8016 for (i = 0; i < map->n; ++i) {
8017 map->p[i] = isl_basic_map_order_divs(map->p[i]);
8018 if (!map->p[i])
8019 goto error;
8022 return map;
8023 error:
8024 isl_map_free(map);
8025 return NULL;
8028 /* Apply the expansion computed by isl_merge_divs.
8029 * The expansion itself is given by "exp" while the resulting
8030 * list of divs is given by "div".
8032 __isl_give isl_basic_set *isl_basic_set_expand_divs(
8033 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
8035 int i, j;
8036 int n_div;
8038 bset = isl_basic_set_cow(bset);
8039 if (!bset || !div)
8040 goto error;
8042 if (div->n_row < bset->n_div)
8043 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
8044 "not an expansion", goto error);
8046 n_div = bset->n_div;
8047 bset = isl_basic_map_extend_space(bset, isl_space_copy(bset->dim),
8048 div->n_row - n_div, 0,
8049 2 * (div->n_row - n_div));
8051 for (i = n_div; i < div->n_row; ++i)
8052 if (isl_basic_set_alloc_div(bset) < 0)
8053 goto error;
8055 j = n_div - 1;
8056 for (i = div->n_row - 1; i >= 0; --i) {
8057 if (j >= 0 && exp[j] == i) {
8058 if (i != j)
8059 isl_basic_map_swap_div(bset, i, j);
8060 j--;
8061 } else {
8062 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
8063 if (isl_basic_map_add_div_constraints(bset, i) < 0)
8064 goto error;
8068 isl_mat_free(div);
8069 return bset;
8070 error:
8071 isl_basic_set_free(bset);
8072 isl_mat_free(div);
8073 return NULL;
8076 /* Look for a div in dst that corresponds to the div "div" in src.
8077 * The divs before "div" in src and dst are assumed to be the same.
8079 * Returns -1 if no corresponding div was found and the position
8080 * of the corresponding div in dst otherwise.
8082 static int find_div(struct isl_basic_map *dst,
8083 struct isl_basic_map *src, unsigned div)
8085 int i;
8087 unsigned total = isl_space_dim(src->dim, isl_dim_all);
8089 isl_assert(dst->ctx, div <= dst->n_div, return -1);
8090 for (i = div; i < dst->n_div; ++i)
8091 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
8092 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
8093 dst->n_div - div) == -1)
8094 return i;
8095 return -1;
8098 /* Align the divs of "dst" to those of "src", adding divs from "src"
8099 * if needed. That is, make sure that the first src->n_div divs
8100 * of the result are equal to those of src.
8102 * The result is not finalized as by design it will have redundant
8103 * divs if any divs from "src" were copied.
8105 __isl_give isl_basic_map *isl_basic_map_align_divs(
8106 __isl_take isl_basic_map *dst, __isl_keep isl_basic_map *src)
8108 int i;
8109 int known, extended;
8110 unsigned total;
8112 if (!dst || !src)
8113 return isl_basic_map_free(dst);
8115 if (src->n_div == 0)
8116 return dst;
8118 known = isl_basic_map_divs_known(src);
8119 if (known < 0)
8120 return isl_basic_map_free(dst);
8121 if (!known)
8122 isl_die(isl_basic_map_get_ctx(src), isl_error_invalid,
8123 "some src divs are unknown",
8124 return isl_basic_map_free(dst));
8126 src = isl_basic_map_order_divs(src);
8128 extended = 0;
8129 total = isl_space_dim(src->dim, isl_dim_all);
8130 for (i = 0; i < src->n_div; ++i) {
8131 int j = find_div(dst, src, i);
8132 if (j < 0) {
8133 if (!extended) {
8134 int extra = src->n_div - i;
8135 dst = isl_basic_map_cow(dst);
8136 if (!dst)
8137 return NULL;
8138 dst = isl_basic_map_extend_space(dst,
8139 isl_space_copy(dst->dim),
8140 extra, 0, 2 * extra);
8141 extended = 1;
8143 j = isl_basic_map_alloc_div(dst);
8144 if (j < 0)
8145 return isl_basic_map_free(dst);
8146 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
8147 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
8148 if (isl_basic_map_add_div_constraints(dst, j) < 0)
8149 return isl_basic_map_free(dst);
8151 if (j != i)
8152 isl_basic_map_swap_div(dst, i, j);
8154 return dst;
8157 struct isl_basic_set *isl_basic_set_align_divs(
8158 struct isl_basic_set *dst, struct isl_basic_set *src)
8160 return (struct isl_basic_set *)isl_basic_map_align_divs(
8161 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
8164 struct isl_map *isl_map_align_divs(struct isl_map *map)
8166 int i;
8168 if (!map)
8169 return NULL;
8170 if (map->n == 0)
8171 return map;
8172 map = isl_map_compute_divs(map);
8173 map = isl_map_cow(map);
8174 if (!map)
8175 return NULL;
8177 for (i = 1; i < map->n; ++i)
8178 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
8179 for (i = 1; i < map->n; ++i) {
8180 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
8181 if (!map->p[i])
8182 return isl_map_free(map);
8185 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
8186 return map;
8189 struct isl_set *isl_set_align_divs(struct isl_set *set)
8191 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
8194 /* Align the divs of the basic maps in "map" to those
8195 * of the basic maps in "list", as well as to the other basic maps in "map".
8196 * The elements in "list" are assumed to have known divs.
8198 __isl_give isl_map *isl_map_align_divs_to_basic_map_list(
8199 __isl_take isl_map *map, __isl_keep isl_basic_map_list *list)
8201 int i, n;
8203 map = isl_map_compute_divs(map);
8204 map = isl_map_cow(map);
8205 if (!map || !list)
8206 return isl_map_free(map);
8207 if (map->n == 0)
8208 return map;
8210 n = isl_basic_map_list_n_basic_map(list);
8211 for (i = 0; i < n; ++i) {
8212 isl_basic_map *bmap;
8214 bmap = isl_basic_map_list_get_basic_map(list, i);
8215 map->p[0] = isl_basic_map_align_divs(map->p[0], bmap);
8216 isl_basic_map_free(bmap);
8218 if (!map->p[0])
8219 return isl_map_free(map);
8221 return isl_map_align_divs(map);
8224 /* Align the divs of each element of "list" to those of "bmap".
8225 * Both "bmap" and the elements of "list" are assumed to have known divs.
8227 __isl_give isl_basic_map_list *isl_basic_map_list_align_divs_to_basic_map(
8228 __isl_take isl_basic_map_list *list, __isl_keep isl_basic_map *bmap)
8230 int i, n;
8232 if (!list || !bmap)
8233 return isl_basic_map_list_free(list);
8235 n = isl_basic_map_list_n_basic_map(list);
8236 for (i = 0; i < n; ++i) {
8237 isl_basic_map *bmap_i;
8239 bmap_i = isl_basic_map_list_get_basic_map(list, i);
8240 bmap_i = isl_basic_map_align_divs(bmap_i, bmap);
8241 list = isl_basic_map_list_set_basic_map(list, i, bmap_i);
8244 return list;
8247 static __isl_give isl_set *set_apply( __isl_take isl_set *set,
8248 __isl_take isl_map *map)
8250 if (!set || !map)
8251 goto error;
8252 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
8253 map = isl_map_intersect_domain(map, set);
8254 set = isl_map_range(map);
8255 return set;
8256 error:
8257 isl_set_free(set);
8258 isl_map_free(map);
8259 return NULL;
8262 __isl_give isl_set *isl_set_apply( __isl_take isl_set *set,
8263 __isl_take isl_map *map)
8265 return isl_map_align_params_map_map_and(set, map, &set_apply);
8268 /* There is no need to cow as removing empty parts doesn't change
8269 * the meaning of the set.
8271 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
8273 int i;
8275 if (!map)
8276 return NULL;
8278 for (i = map->n - 1; i >= 0; --i)
8279 remove_if_empty(map, i);
8281 return map;
8284 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
8286 return (struct isl_set *)
8287 isl_map_remove_empty_parts((struct isl_map *)set);
8290 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
8292 struct isl_basic_map *bmap;
8293 if (!map || map->n == 0)
8294 return NULL;
8295 bmap = map->p[map->n-1];
8296 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
8297 return isl_basic_map_copy(bmap);
8300 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
8302 return (struct isl_basic_set *)
8303 isl_map_copy_basic_map((struct isl_map *)set);
8306 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
8307 __isl_keep isl_basic_map *bmap)
8309 int i;
8311 if (!map || !bmap)
8312 goto error;
8313 for (i = map->n-1; i >= 0; --i) {
8314 if (map->p[i] != bmap)
8315 continue;
8316 map = isl_map_cow(map);
8317 if (!map)
8318 goto error;
8319 isl_basic_map_free(map->p[i]);
8320 if (i != map->n-1) {
8321 ISL_F_CLR(map, ISL_SET_NORMALIZED);
8322 map->p[i] = map->p[map->n-1];
8324 map->n--;
8325 return map;
8327 return map;
8328 error:
8329 isl_map_free(map);
8330 return NULL;
8333 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
8334 struct isl_basic_set *bset)
8336 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
8337 (struct isl_basic_map *)bset);
8340 /* Given two basic sets bset1 and bset2, compute the maximal difference
8341 * between the values of dimension pos in bset1 and those in bset2
8342 * for any common value of the parameters and dimensions preceding pos.
8344 static enum isl_lp_result basic_set_maximal_difference_at(
8345 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
8346 int pos, isl_int *opt)
8348 isl_space *dims;
8349 struct isl_basic_map *bmap1 = NULL;
8350 struct isl_basic_map *bmap2 = NULL;
8351 struct isl_ctx *ctx;
8352 struct isl_vec *obj;
8353 unsigned total;
8354 unsigned nparam;
8355 unsigned dim1, dim2;
8356 enum isl_lp_result res;
8358 if (!bset1 || !bset2)
8359 return isl_lp_error;
8361 nparam = isl_basic_set_n_param(bset1);
8362 dim1 = isl_basic_set_n_dim(bset1);
8363 dim2 = isl_basic_set_n_dim(bset2);
8364 dims = isl_space_alloc(bset1->ctx, nparam, pos, dim1 - pos);
8365 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
8366 dims = isl_space_alloc(bset2->ctx, nparam, pos, dim2 - pos);
8367 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
8368 if (!bmap1 || !bmap2)
8369 goto error;
8370 bmap1 = isl_basic_map_cow(bmap1);
8371 bmap1 = isl_basic_map_extend(bmap1, nparam,
8372 pos, (dim1 - pos) + (dim2 - pos),
8373 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
8374 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
8375 if (!bmap1)
8376 goto error2;
8377 total = isl_basic_map_total_dim(bmap1);
8378 ctx = bmap1->ctx;
8379 obj = isl_vec_alloc(ctx, 1 + total);
8380 if (!obj)
8381 goto error2;
8382 isl_seq_clr(obj->block.data, 1 + total);
8383 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
8384 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
8385 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
8386 opt, NULL, NULL);
8387 isl_basic_map_free(bmap1);
8388 isl_vec_free(obj);
8389 return res;
8390 error:
8391 isl_basic_map_free(bmap2);
8392 error2:
8393 isl_basic_map_free(bmap1);
8394 return isl_lp_error;
8397 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8398 * for any common value of the parameters and dimensions preceding pos
8399 * in both basic sets, the values of dimension pos in bset1 are
8400 * smaller or larger than those in bset2.
8402 * Returns
8403 * 1 if bset1 follows bset2
8404 * -1 if bset1 precedes bset2
8405 * 0 if bset1 and bset2 are incomparable
8406 * -2 if some error occurred.
8408 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
8409 struct isl_basic_set *bset2, int pos)
8411 isl_int opt;
8412 enum isl_lp_result res;
8413 int cmp;
8415 isl_int_init(opt);
8417 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
8419 if (res == isl_lp_empty)
8420 cmp = 0;
8421 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
8422 res == isl_lp_unbounded)
8423 cmp = 1;
8424 else if (res == isl_lp_ok && isl_int_is_neg(opt))
8425 cmp = -1;
8426 else
8427 cmp = -2;
8429 isl_int_clear(opt);
8430 return cmp;
8433 /* Given two basic sets bset1 and bset2, check whether
8434 * for any common value of the parameters and dimensions preceding pos
8435 * there is a value of dimension pos in bset1 that is larger
8436 * than a value of the same dimension in bset2.
8438 * Return
8439 * 1 if there exists such a pair
8440 * 0 if there is no such pair, but there is a pair of equal values
8441 * -1 otherwise
8442 * -2 if some error occurred.
8444 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
8445 __isl_keep isl_basic_set *bset2, int pos)
8447 isl_int opt;
8448 enum isl_lp_result res;
8449 int cmp;
8451 isl_int_init(opt);
8453 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
8455 if (res == isl_lp_empty)
8456 cmp = -1;
8457 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
8458 res == isl_lp_unbounded)
8459 cmp = 1;
8460 else if (res == isl_lp_ok && isl_int_is_neg(opt))
8461 cmp = -1;
8462 else if (res == isl_lp_ok)
8463 cmp = 0;
8464 else
8465 cmp = -2;
8467 isl_int_clear(opt);
8468 return cmp;
8471 /* Given two sets set1 and set2, check whether
8472 * for any common value of the parameters and dimensions preceding pos
8473 * there is a value of dimension pos in set1 that is larger
8474 * than a value of the same dimension in set2.
8476 * Return
8477 * 1 if there exists such a pair
8478 * 0 if there is no such pair, but there is a pair of equal values
8479 * -1 otherwise
8480 * -2 if some error occurred.
8482 int isl_set_follows_at(__isl_keep isl_set *set1,
8483 __isl_keep isl_set *set2, int pos)
8485 int i, j;
8486 int follows = -1;
8488 if (!set1 || !set2)
8489 return -2;
8491 for (i = 0; i < set1->n; ++i)
8492 for (j = 0; j < set2->n; ++j) {
8493 int f;
8494 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
8495 if (f == 1 || f == -2)
8496 return f;
8497 if (f > follows)
8498 follows = f;
8501 return follows;
8504 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
8505 unsigned pos, isl_int *val)
8507 int i;
8508 int d;
8509 unsigned total;
8511 if (!bmap)
8512 return -1;
8513 total = isl_basic_map_total_dim(bmap);
8514 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
8515 for (; d+1 > pos; --d)
8516 if (!isl_int_is_zero(bmap->eq[i][1+d]))
8517 break;
8518 if (d != pos)
8519 continue;
8520 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
8521 return 0;
8522 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
8523 return 0;
8524 if (!isl_int_is_one(bmap->eq[i][1+d]))
8525 return 0;
8526 if (val)
8527 isl_int_neg(*val, bmap->eq[i][0]);
8528 return 1;
8530 return 0;
8533 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
8534 unsigned pos, isl_int *val)
8536 int i;
8537 isl_int v;
8538 isl_int tmp;
8539 int fixed;
8541 if (!map)
8542 return -1;
8543 if (map->n == 0)
8544 return 0;
8545 if (map->n == 1)
8546 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
8547 isl_int_init(v);
8548 isl_int_init(tmp);
8549 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
8550 for (i = 1; fixed == 1 && i < map->n; ++i) {
8551 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
8552 if (fixed == 1 && isl_int_ne(tmp, v))
8553 fixed = 0;
8555 if (val)
8556 isl_int_set(*val, v);
8557 isl_int_clear(tmp);
8558 isl_int_clear(v);
8559 return fixed;
8562 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
8563 unsigned pos, isl_int *val)
8565 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
8566 pos, val);
8569 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
8570 isl_int *val)
8572 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
8575 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
8576 enum isl_dim_type type, unsigned pos, isl_int *val)
8578 if (pos >= isl_basic_map_dim(bmap, type))
8579 return -1;
8580 return isl_basic_map_plain_has_fixed_var(bmap,
8581 isl_basic_map_offset(bmap, type) - 1 + pos, val);
8584 /* If "bmap" obviously lies on a hyperplane where the given dimension
8585 * has a fixed value, then return that value.
8586 * Otherwise return NaN.
8588 __isl_give isl_val *isl_basic_map_plain_get_val_if_fixed(
8589 __isl_keep isl_basic_map *bmap,
8590 enum isl_dim_type type, unsigned pos)
8592 isl_ctx *ctx;
8593 isl_val *v;
8594 int fixed;
8596 if (!bmap)
8597 return NULL;
8598 ctx = isl_basic_map_get_ctx(bmap);
8599 v = isl_val_alloc(ctx);
8600 if (!v)
8601 return NULL;
8602 fixed = isl_basic_map_plain_is_fixed(bmap, type, pos, &v->n);
8603 if (fixed < 0)
8604 return isl_val_free(v);
8605 if (fixed) {
8606 isl_int_set_si(v->d, 1);
8607 return v;
8609 isl_val_free(v);
8610 return isl_val_nan(ctx);
8613 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
8614 enum isl_dim_type type, unsigned pos, isl_int *val)
8616 if (pos >= isl_map_dim(map, type))
8617 return -1;
8618 return isl_map_plain_has_fixed_var(map,
8619 map_offset(map, type) - 1 + pos, val);
8622 /* If "map" obviously lies on a hyperplane where the given dimension
8623 * has a fixed value, then return that value.
8624 * Otherwise return NaN.
8626 __isl_give isl_val *isl_map_plain_get_val_if_fixed(__isl_keep isl_map *map,
8627 enum isl_dim_type type, unsigned pos)
8629 isl_ctx *ctx;
8630 isl_val *v;
8631 int fixed;
8633 if (!map)
8634 return NULL;
8635 ctx = isl_map_get_ctx(map);
8636 v = isl_val_alloc(ctx);
8637 if (!v)
8638 return NULL;
8639 fixed = isl_map_plain_is_fixed(map, type, pos, &v->n);
8640 if (fixed < 0)
8641 return isl_val_free(v);
8642 if (fixed) {
8643 isl_int_set_si(v->d, 1);
8644 return v;
8646 isl_val_free(v);
8647 return isl_val_nan(ctx);
8650 /* If "set" obviously lies on a hyperplane where the given dimension
8651 * has a fixed value, then return that value.
8652 * Otherwise return NaN.
8654 __isl_give isl_val *isl_set_plain_get_val_if_fixed(__isl_keep isl_set *set,
8655 enum isl_dim_type type, unsigned pos)
8657 return isl_map_plain_get_val_if_fixed(set, type, pos);
8660 int isl_set_plain_is_fixed(__isl_keep isl_set *set,
8661 enum isl_dim_type type, unsigned pos, isl_int *val)
8663 return isl_map_plain_is_fixed(set, type, pos, val);
8666 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8667 * then return this fixed value in *val.
8669 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
8670 unsigned dim, isl_int *val)
8672 return isl_basic_set_plain_has_fixed_var(bset,
8673 isl_basic_set_n_param(bset) + dim, val);
8676 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8677 * then return this fixed value in *val.
8679 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
8680 unsigned dim, isl_int *val)
8682 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
8685 /* Check if input variable in has fixed value and if so and if val is not NULL,
8686 * then return this fixed value in *val.
8688 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
8689 unsigned in, isl_int *val)
8691 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
8694 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8695 * and if val is not NULL, then return this lower bound in *val.
8697 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8698 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
8700 int i, i_eq = -1, i_ineq = -1;
8701 isl_int *c;
8702 unsigned total;
8703 unsigned nparam;
8705 if (!bset)
8706 return -1;
8707 total = isl_basic_set_total_dim(bset);
8708 nparam = isl_basic_set_n_param(bset);
8709 for (i = 0; i < bset->n_eq; ++i) {
8710 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
8711 continue;
8712 if (i_eq != -1)
8713 return 0;
8714 i_eq = i;
8716 for (i = 0; i < bset->n_ineq; ++i) {
8717 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
8718 continue;
8719 if (i_eq != -1 || i_ineq != -1)
8720 return 0;
8721 i_ineq = i;
8723 if (i_eq == -1 && i_ineq == -1)
8724 return 0;
8725 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
8726 /* The coefficient should always be one due to normalization. */
8727 if (!isl_int_is_one(c[1+nparam+dim]))
8728 return 0;
8729 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
8730 return 0;
8731 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
8732 total - nparam - dim - 1) != -1)
8733 return 0;
8734 if (val)
8735 isl_int_neg(*val, c[0]);
8736 return 1;
8739 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
8740 unsigned dim, isl_int *val)
8742 int i;
8743 isl_int v;
8744 isl_int tmp;
8745 int fixed;
8747 if (!set)
8748 return -1;
8749 if (set->n == 0)
8750 return 0;
8751 if (set->n == 1)
8752 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
8753 dim, val);
8754 isl_int_init(v);
8755 isl_int_init(tmp);
8756 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
8757 dim, &v);
8758 for (i = 1; fixed == 1 && i < set->n; ++i) {
8759 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
8760 dim, &tmp);
8761 if (fixed == 1 && isl_int_ne(tmp, v))
8762 fixed = 0;
8764 if (val)
8765 isl_int_set(*val, v);
8766 isl_int_clear(tmp);
8767 isl_int_clear(v);
8768 return fixed;
8771 /* uset_gist depends on constraints without existentially quantified
8772 * variables sorting first.
8774 static int sort_constraint_cmp(const void *p1, const void *p2, void *arg)
8776 isl_int **c1 = (isl_int **) p1;
8777 isl_int **c2 = (isl_int **) p2;
8778 int l1, l2;
8779 unsigned size = *(unsigned *) arg;
8781 l1 = isl_seq_last_non_zero(*c1 + 1, size);
8782 l2 = isl_seq_last_non_zero(*c2 + 1, size);
8784 if (l1 != l2)
8785 return l1 - l2;
8787 return isl_seq_cmp(*c1 + 1, *c2 + 1, size);
8790 static struct isl_basic_map *isl_basic_map_sort_constraints(
8791 struct isl_basic_map *bmap)
8793 unsigned total;
8795 if (!bmap)
8796 return NULL;
8797 if (bmap->n_ineq == 0)
8798 return bmap;
8799 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
8800 return bmap;
8801 total = isl_basic_map_total_dim(bmap);
8802 if (isl_sort(bmap->ineq, bmap->n_ineq, sizeof(isl_int *),
8803 &sort_constraint_cmp, &total) < 0)
8804 return isl_basic_map_free(bmap);
8805 return bmap;
8808 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
8809 __isl_take isl_basic_set *bset)
8811 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
8812 (struct isl_basic_map *)bset);
8815 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
8817 if (!bmap)
8818 return NULL;
8819 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
8820 return bmap;
8821 bmap = isl_basic_map_remove_redundancies(bmap);
8822 bmap = isl_basic_map_sort_constraints(bmap);
8823 if (bmap)
8824 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
8825 return bmap;
8828 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
8830 return (struct isl_basic_set *)isl_basic_map_normalize(
8831 (struct isl_basic_map *)bset);
8834 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
8835 const __isl_keep isl_basic_map *bmap2)
8837 int i, cmp;
8838 unsigned total;
8840 if (!bmap1 || !bmap2)
8841 return -1;
8843 if (bmap1 == bmap2)
8844 return 0;
8845 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
8846 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
8847 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
8848 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
8849 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
8850 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
8851 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
8852 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
8853 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
8854 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
8855 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
8856 return 0;
8857 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
8858 return 1;
8859 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
8860 return -1;
8861 if (bmap1->n_eq != bmap2->n_eq)
8862 return bmap1->n_eq - bmap2->n_eq;
8863 if (bmap1->n_ineq != bmap2->n_ineq)
8864 return bmap1->n_ineq - bmap2->n_ineq;
8865 if (bmap1->n_div != bmap2->n_div)
8866 return bmap1->n_div - bmap2->n_div;
8867 total = isl_basic_map_total_dim(bmap1);
8868 for (i = 0; i < bmap1->n_eq; ++i) {
8869 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
8870 if (cmp)
8871 return cmp;
8873 for (i = 0; i < bmap1->n_ineq; ++i) {
8874 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
8875 if (cmp)
8876 return cmp;
8878 for (i = 0; i < bmap1->n_div; ++i) {
8879 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
8880 if (cmp)
8881 return cmp;
8883 return 0;
8886 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set *bset1,
8887 const __isl_keep isl_basic_set *bset2)
8889 return isl_basic_map_plain_cmp(bset1, bset2);
8892 int isl_set_plain_cmp(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
8894 int i, cmp;
8896 if (set1 == set2)
8897 return 0;
8898 if (set1->n != set2->n)
8899 return set1->n - set2->n;
8901 for (i = 0; i < set1->n; ++i) {
8902 cmp = isl_basic_set_plain_cmp(set1->p[i], set2->p[i]);
8903 if (cmp)
8904 return cmp;
8907 return 0;
8910 isl_bool isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
8911 __isl_keep isl_basic_map *bmap2)
8913 if (!bmap1 || !bmap2)
8914 return isl_bool_error;
8915 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
8918 isl_bool isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
8919 __isl_keep isl_basic_set *bset2)
8921 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
8922 (isl_basic_map *)bset2);
8925 static int qsort_bmap_cmp(const void *p1, const void *p2)
8927 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
8928 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
8930 return isl_basic_map_plain_cmp(bmap1, bmap2);
8933 /* Sort the basic maps of "map" and remove duplicate basic maps.
8935 * While removing basic maps, we make sure that the basic maps remain
8936 * sorted because isl_map_normalize expects the basic maps of the result
8937 * to be sorted.
8939 static __isl_give isl_map *sort_and_remove_duplicates(__isl_take isl_map *map)
8941 int i, j;
8943 map = isl_map_remove_empty_parts(map);
8944 if (!map)
8945 return NULL;
8946 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
8947 for (i = map->n - 1; i >= 1; --i) {
8948 if (!isl_basic_map_plain_is_equal(map->p[i - 1], map->p[i]))
8949 continue;
8950 isl_basic_map_free(map->p[i-1]);
8951 for (j = i; j < map->n; ++j)
8952 map->p[j - 1] = map->p[j];
8953 map->n--;
8956 return map;
8959 /* Remove obvious duplicates among the basic maps of "map".
8961 * Unlike isl_map_normalize, this function does not remove redundant
8962 * constraints and only removes duplicates that have exactly the same
8963 * constraints in the input. It does sort the constraints and
8964 * the basic maps to ease the detection of duplicates.
8966 * If "map" has already been normalized or if the basic maps are
8967 * disjoint, then there can be no duplicates.
8969 __isl_give isl_map *isl_map_remove_obvious_duplicates(__isl_take isl_map *map)
8971 int i;
8972 isl_basic_map *bmap;
8974 if (!map)
8975 return NULL;
8976 if (map->n <= 1)
8977 return map;
8978 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED | ISL_MAP_DISJOINT))
8979 return map;
8980 for (i = 0; i < map->n; ++i) {
8981 bmap = isl_basic_map_copy(map->p[i]);
8982 bmap = isl_basic_map_sort_constraints(bmap);
8983 if (!bmap)
8984 return isl_map_free(map);
8985 isl_basic_map_free(map->p[i]);
8986 map->p[i] = bmap;
8989 map = sort_and_remove_duplicates(map);
8990 return map;
8993 /* We normalize in place, but if anything goes wrong we need
8994 * to return NULL, so we need to make sure we don't change the
8995 * meaning of any possible other copies of map.
8997 __isl_give isl_map *isl_map_normalize(__isl_take isl_map *map)
8999 int i;
9000 struct isl_basic_map *bmap;
9002 if (!map)
9003 return NULL;
9004 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
9005 return map;
9006 for (i = 0; i < map->n; ++i) {
9007 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
9008 if (!bmap)
9009 goto error;
9010 isl_basic_map_free(map->p[i]);
9011 map->p[i] = bmap;
9014 map = sort_and_remove_duplicates(map);
9015 if (map)
9016 ISL_F_SET(map, ISL_MAP_NORMALIZED);
9017 return map;
9018 error:
9019 isl_map_free(map);
9020 return NULL;
9023 struct isl_set *isl_set_normalize(struct isl_set *set)
9025 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
9028 isl_bool isl_map_plain_is_equal(__isl_keep isl_map *map1,
9029 __isl_keep isl_map *map2)
9031 int i;
9032 isl_bool equal;
9034 if (!map1 || !map2)
9035 return isl_bool_error;
9037 if (map1 == map2)
9038 return isl_bool_true;
9039 if (!isl_space_is_equal(map1->dim, map2->dim))
9040 return isl_bool_false;
9042 map1 = isl_map_copy(map1);
9043 map2 = isl_map_copy(map2);
9044 map1 = isl_map_normalize(map1);
9045 map2 = isl_map_normalize(map2);
9046 if (!map1 || !map2)
9047 goto error;
9048 equal = map1->n == map2->n;
9049 for (i = 0; equal && i < map1->n; ++i) {
9050 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
9051 if (equal < 0)
9052 goto error;
9054 isl_map_free(map1);
9055 isl_map_free(map2);
9056 return equal;
9057 error:
9058 isl_map_free(map1);
9059 isl_map_free(map2);
9060 return isl_bool_error;
9063 isl_bool isl_set_plain_is_equal(__isl_keep isl_set *set1,
9064 __isl_keep isl_set *set2)
9066 return isl_map_plain_is_equal((struct isl_map *)set1,
9067 (struct isl_map *)set2);
9070 /* Return an interval that ranges from min to max (inclusive)
9072 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
9073 isl_int min, isl_int max)
9075 int k;
9076 struct isl_basic_set *bset = NULL;
9078 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
9079 if (!bset)
9080 goto error;
9082 k = isl_basic_set_alloc_inequality(bset);
9083 if (k < 0)
9084 goto error;
9085 isl_int_set_si(bset->ineq[k][1], 1);
9086 isl_int_neg(bset->ineq[k][0], min);
9088 k = isl_basic_set_alloc_inequality(bset);
9089 if (k < 0)
9090 goto error;
9091 isl_int_set_si(bset->ineq[k][1], -1);
9092 isl_int_set(bset->ineq[k][0], max);
9094 return bset;
9095 error:
9096 isl_basic_set_free(bset);
9097 return NULL;
9100 /* Return the basic maps in "map" as a list.
9102 __isl_give isl_basic_map_list *isl_map_get_basic_map_list(
9103 __isl_keep isl_map *map)
9105 int i;
9106 isl_ctx *ctx;
9107 isl_basic_map_list *list;
9109 if (!map)
9110 return NULL;
9111 ctx = isl_map_get_ctx(map);
9112 list = isl_basic_map_list_alloc(ctx, map->n);
9114 for (i = 0; i < map->n; ++i) {
9115 isl_basic_map *bmap;
9117 bmap = isl_basic_map_copy(map->p[i]);
9118 list = isl_basic_map_list_add(list, bmap);
9121 return list;
9124 /* Return the intersection of the elements in the non-empty list "list".
9125 * All elements are assumed to live in the same space.
9127 __isl_give isl_basic_map *isl_basic_map_list_intersect(
9128 __isl_take isl_basic_map_list *list)
9130 int i, n;
9131 isl_basic_map *bmap;
9133 if (!list)
9134 return NULL;
9135 n = isl_basic_map_list_n_basic_map(list);
9136 if (n < 1)
9137 isl_die(isl_basic_map_list_get_ctx(list), isl_error_invalid,
9138 "expecting non-empty list", goto error);
9140 bmap = isl_basic_map_list_get_basic_map(list, 0);
9141 for (i = 1; i < n; ++i) {
9142 isl_basic_map *bmap_i;
9144 bmap_i = isl_basic_map_list_get_basic_map(list, i);
9145 bmap = isl_basic_map_intersect(bmap, bmap_i);
9148 isl_basic_map_list_free(list);
9149 return bmap;
9150 error:
9151 isl_basic_map_list_free(list);
9152 return NULL;
9155 /* Return the intersection of the elements in the non-empty list "list".
9156 * All elements are assumed to live in the same space.
9158 __isl_give isl_basic_set *isl_basic_set_list_intersect(
9159 __isl_take isl_basic_set_list *list)
9161 return isl_basic_map_list_intersect(list);
9164 /* Return the Cartesian product of the basic sets in list (in the given order).
9166 __isl_give isl_basic_set *isl_basic_set_list_product(
9167 __isl_take struct isl_basic_set_list *list)
9169 int i;
9170 unsigned dim;
9171 unsigned nparam;
9172 unsigned extra;
9173 unsigned n_eq;
9174 unsigned n_ineq;
9175 struct isl_basic_set *product = NULL;
9177 if (!list)
9178 goto error;
9179 isl_assert(list->ctx, list->n > 0, goto error);
9180 isl_assert(list->ctx, list->p[0], goto error);
9181 nparam = isl_basic_set_n_param(list->p[0]);
9182 dim = isl_basic_set_n_dim(list->p[0]);
9183 extra = list->p[0]->n_div;
9184 n_eq = list->p[0]->n_eq;
9185 n_ineq = list->p[0]->n_ineq;
9186 for (i = 1; i < list->n; ++i) {
9187 isl_assert(list->ctx, list->p[i], goto error);
9188 isl_assert(list->ctx,
9189 nparam == isl_basic_set_n_param(list->p[i]), goto error);
9190 dim += isl_basic_set_n_dim(list->p[i]);
9191 extra += list->p[i]->n_div;
9192 n_eq += list->p[i]->n_eq;
9193 n_ineq += list->p[i]->n_ineq;
9195 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
9196 n_eq, n_ineq);
9197 if (!product)
9198 goto error;
9199 dim = 0;
9200 for (i = 0; i < list->n; ++i) {
9201 isl_basic_set_add_constraints(product,
9202 isl_basic_set_copy(list->p[i]), dim);
9203 dim += isl_basic_set_n_dim(list->p[i]);
9205 isl_basic_set_list_free(list);
9206 return product;
9207 error:
9208 isl_basic_set_free(product);
9209 isl_basic_set_list_free(list);
9210 return NULL;
9213 struct isl_basic_map *isl_basic_map_product(
9214 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
9216 isl_space *dim_result = NULL;
9217 struct isl_basic_map *bmap;
9218 unsigned in1, in2, out1, out2, nparam, total, pos;
9219 struct isl_dim_map *dim_map1, *dim_map2;
9221 if (!bmap1 || !bmap2)
9222 goto error;
9224 isl_assert(bmap1->ctx, isl_space_match(bmap1->dim, isl_dim_param,
9225 bmap2->dim, isl_dim_param), goto error);
9226 dim_result = isl_space_product(isl_space_copy(bmap1->dim),
9227 isl_space_copy(bmap2->dim));
9229 in1 = isl_basic_map_n_in(bmap1);
9230 in2 = isl_basic_map_n_in(bmap2);
9231 out1 = isl_basic_map_n_out(bmap1);
9232 out2 = isl_basic_map_n_out(bmap2);
9233 nparam = isl_basic_map_n_param(bmap1);
9235 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
9236 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
9237 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
9238 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
9239 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
9240 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
9241 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
9242 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
9243 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
9244 isl_dim_map_div(dim_map1, bmap1, pos += out2);
9245 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
9247 bmap = isl_basic_map_alloc_space(dim_result,
9248 bmap1->n_div + bmap2->n_div,
9249 bmap1->n_eq + bmap2->n_eq,
9250 bmap1->n_ineq + bmap2->n_ineq);
9251 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
9252 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
9253 bmap = isl_basic_map_simplify(bmap);
9254 return isl_basic_map_finalize(bmap);
9255 error:
9256 isl_basic_map_free(bmap1);
9257 isl_basic_map_free(bmap2);
9258 return NULL;
9261 __isl_give isl_basic_map *isl_basic_map_flat_product(
9262 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
9264 isl_basic_map *prod;
9266 prod = isl_basic_map_product(bmap1, bmap2);
9267 prod = isl_basic_map_flatten(prod);
9268 return prod;
9271 __isl_give isl_basic_set *isl_basic_set_flat_product(
9272 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
9274 return isl_basic_map_flat_range_product(bset1, bset2);
9277 __isl_give isl_basic_map *isl_basic_map_domain_product(
9278 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
9280 isl_space *space_result = NULL;
9281 isl_basic_map *bmap;
9282 unsigned in1, in2, out, nparam, total, pos;
9283 struct isl_dim_map *dim_map1, *dim_map2;
9285 if (!bmap1 || !bmap2)
9286 goto error;
9288 space_result = isl_space_domain_product(isl_space_copy(bmap1->dim),
9289 isl_space_copy(bmap2->dim));
9291 in1 = isl_basic_map_dim(bmap1, isl_dim_in);
9292 in2 = isl_basic_map_dim(bmap2, isl_dim_in);
9293 out = isl_basic_map_dim(bmap1, isl_dim_out);
9294 nparam = isl_basic_map_dim(bmap1, isl_dim_param);
9296 total = nparam + in1 + in2 + out + bmap1->n_div + bmap2->n_div;
9297 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
9298 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
9299 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
9300 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
9301 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
9302 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
9303 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
9304 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos);
9305 isl_dim_map_div(dim_map1, bmap1, pos += out);
9306 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
9308 bmap = isl_basic_map_alloc_space(space_result,
9309 bmap1->n_div + bmap2->n_div,
9310 bmap1->n_eq + bmap2->n_eq,
9311 bmap1->n_ineq + bmap2->n_ineq);
9312 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
9313 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
9314 bmap = isl_basic_map_simplify(bmap);
9315 return isl_basic_map_finalize(bmap);
9316 error:
9317 isl_basic_map_free(bmap1);
9318 isl_basic_map_free(bmap2);
9319 return NULL;
9322 __isl_give isl_basic_map *isl_basic_map_range_product(
9323 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
9325 isl_space *dim_result = NULL;
9326 isl_basic_map *bmap;
9327 unsigned in, out1, out2, nparam, total, pos;
9328 struct isl_dim_map *dim_map1, *dim_map2;
9330 if (!bmap1 || !bmap2)
9331 goto error;
9333 if (!isl_space_match(bmap1->dim, isl_dim_param,
9334 bmap2->dim, isl_dim_param))
9335 isl_die(isl_basic_map_get_ctx(bmap1), isl_error_invalid,
9336 "parameters don't match", goto error);
9338 dim_result = isl_space_range_product(isl_space_copy(bmap1->dim),
9339 isl_space_copy(bmap2->dim));
9341 in = isl_basic_map_dim(bmap1, isl_dim_in);
9342 out1 = isl_basic_map_n_out(bmap1);
9343 out2 = isl_basic_map_n_out(bmap2);
9344 nparam = isl_basic_map_n_param(bmap1);
9346 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
9347 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
9348 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
9349 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
9350 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
9351 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
9352 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
9353 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
9354 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
9355 isl_dim_map_div(dim_map1, bmap1, pos += out2);
9356 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
9358 bmap = isl_basic_map_alloc_space(dim_result,
9359 bmap1->n_div + bmap2->n_div,
9360 bmap1->n_eq + bmap2->n_eq,
9361 bmap1->n_ineq + bmap2->n_ineq);
9362 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
9363 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
9364 bmap = isl_basic_map_simplify(bmap);
9365 return isl_basic_map_finalize(bmap);
9366 error:
9367 isl_basic_map_free(bmap1);
9368 isl_basic_map_free(bmap2);
9369 return NULL;
9372 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
9373 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
9375 isl_basic_map *prod;
9377 prod = isl_basic_map_range_product(bmap1, bmap2);
9378 prod = isl_basic_map_flatten_range(prod);
9379 return prod;
9382 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
9383 * and collect the results.
9384 * The result live in the space obtained by calling "space_product"
9385 * on the spaces of "map1" and "map2".
9386 * If "remove_duplicates" is set then the result may contain duplicates
9387 * (even if the inputs do not) and so we try and remove the obvious
9388 * duplicates.
9390 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
9391 __isl_take isl_map *map2,
9392 __isl_give isl_space *(*space_product)(__isl_take isl_space *left,
9393 __isl_take isl_space *right),
9394 __isl_give isl_basic_map *(*basic_map_product)(
9395 __isl_take isl_basic_map *left,
9396 __isl_take isl_basic_map *right),
9397 int remove_duplicates)
9399 unsigned flags = 0;
9400 struct isl_map *result;
9401 int i, j;
9403 if (!map1 || !map2)
9404 goto error;
9406 isl_assert(map1->ctx, isl_space_match(map1->dim, isl_dim_param,
9407 map2->dim, isl_dim_param), goto error);
9409 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
9410 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
9411 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
9413 result = isl_map_alloc_space(space_product(isl_space_copy(map1->dim),
9414 isl_space_copy(map2->dim)),
9415 map1->n * map2->n, flags);
9416 if (!result)
9417 goto error;
9418 for (i = 0; i < map1->n; ++i)
9419 for (j = 0; j < map2->n; ++j) {
9420 struct isl_basic_map *part;
9421 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
9422 isl_basic_map_copy(map2->p[j]));
9423 if (isl_basic_map_is_empty(part))
9424 isl_basic_map_free(part);
9425 else
9426 result = isl_map_add_basic_map(result, part);
9427 if (!result)
9428 goto error;
9430 if (remove_duplicates)
9431 result = isl_map_remove_obvious_duplicates(result);
9432 isl_map_free(map1);
9433 isl_map_free(map2);
9434 return result;
9435 error:
9436 isl_map_free(map1);
9437 isl_map_free(map2);
9438 return NULL;
9441 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9443 static __isl_give isl_map *map_product_aligned(__isl_take isl_map *map1,
9444 __isl_take isl_map *map2)
9446 return map_product(map1, map2, &isl_space_product,
9447 &isl_basic_map_product, 0);
9450 __isl_give isl_map *isl_map_product(__isl_take isl_map *map1,
9451 __isl_take isl_map *map2)
9453 return isl_map_align_params_map_map_and(map1, map2, &map_product_aligned);
9456 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9458 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
9459 __isl_take isl_map *map2)
9461 isl_map *prod;
9463 prod = isl_map_product(map1, map2);
9464 prod = isl_map_flatten(prod);
9465 return prod;
9468 /* Given two set A and B, construct its Cartesian product A x B.
9470 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
9472 return isl_map_range_product(set1, set2);
9475 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
9476 __isl_take isl_set *set2)
9478 return isl_map_flat_range_product(set1, set2);
9481 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9483 static __isl_give isl_map *map_domain_product_aligned(__isl_take isl_map *map1,
9484 __isl_take isl_map *map2)
9486 return map_product(map1, map2, &isl_space_domain_product,
9487 &isl_basic_map_domain_product, 1);
9490 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9492 static __isl_give isl_map *map_range_product_aligned(__isl_take isl_map *map1,
9493 __isl_take isl_map *map2)
9495 return map_product(map1, map2, &isl_space_range_product,
9496 &isl_basic_map_range_product, 1);
9499 __isl_give isl_map *isl_map_domain_product(__isl_take isl_map *map1,
9500 __isl_take isl_map *map2)
9502 return isl_map_align_params_map_map_and(map1, map2,
9503 &map_domain_product_aligned);
9506 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
9507 __isl_take isl_map *map2)
9509 return isl_map_align_params_map_map_and(map1, map2,
9510 &map_range_product_aligned);
9513 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
9515 __isl_give isl_map *isl_map_factor_domain(__isl_take isl_map *map)
9517 isl_space *space;
9518 int total1, keep1, total2, keep2;
9520 if (!map)
9521 return NULL;
9522 if (!isl_space_domain_is_wrapping(map->dim) ||
9523 !isl_space_range_is_wrapping(map->dim))
9524 isl_die(isl_map_get_ctx(map), isl_error_invalid,
9525 "not a product", return isl_map_free(map));
9527 space = isl_map_get_space(map);
9528 total1 = isl_space_dim(space, isl_dim_in);
9529 total2 = isl_space_dim(space, isl_dim_out);
9530 space = isl_space_factor_domain(space);
9531 keep1 = isl_space_dim(space, isl_dim_in);
9532 keep2 = isl_space_dim(space, isl_dim_out);
9533 map = isl_map_project_out(map, isl_dim_in, keep1, total1 - keep1);
9534 map = isl_map_project_out(map, isl_dim_out, keep2, total2 - keep2);
9535 map = isl_map_reset_space(map, space);
9537 return map;
9540 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
9542 __isl_give isl_map *isl_map_factor_range(__isl_take isl_map *map)
9544 isl_space *space;
9545 int total1, keep1, total2, keep2;
9547 if (!map)
9548 return NULL;
9549 if (!isl_space_domain_is_wrapping(map->dim) ||
9550 !isl_space_range_is_wrapping(map->dim))
9551 isl_die(isl_map_get_ctx(map), isl_error_invalid,
9552 "not a product", return isl_map_free(map));
9554 space = isl_map_get_space(map);
9555 total1 = isl_space_dim(space, isl_dim_in);
9556 total2 = isl_space_dim(space, isl_dim_out);
9557 space = isl_space_factor_range(space);
9558 keep1 = isl_space_dim(space, isl_dim_in);
9559 keep2 = isl_space_dim(space, isl_dim_out);
9560 map = isl_map_project_out(map, isl_dim_in, 0, total1 - keep1);
9561 map = isl_map_project_out(map, isl_dim_out, 0, total2 - keep2);
9562 map = isl_map_reset_space(map, space);
9564 return map;
9567 /* Given a map of the form [A -> B] -> C, return the map A -> C.
9569 __isl_give isl_map *isl_map_domain_factor_domain(__isl_take isl_map *map)
9571 isl_space *space;
9572 int total, keep;
9574 if (!map)
9575 return NULL;
9576 if (!isl_space_domain_is_wrapping(map->dim))
9577 isl_die(isl_map_get_ctx(map), isl_error_invalid,
9578 "domain is not a product", return isl_map_free(map));
9580 space = isl_map_get_space(map);
9581 total = isl_space_dim(space, isl_dim_in);
9582 space = isl_space_domain_factor_domain(space);
9583 keep = isl_space_dim(space, isl_dim_in);
9584 map = isl_map_project_out(map, isl_dim_in, keep, total - keep);
9585 map = isl_map_reset_space(map, space);
9587 return map;
9590 /* Given a map of the form [A -> B] -> C, return the map B -> C.
9592 __isl_give isl_map *isl_map_domain_factor_range(__isl_take isl_map *map)
9594 isl_space *space;
9595 int total, keep;
9597 if (!map)
9598 return NULL;
9599 if (!isl_space_domain_is_wrapping(map->dim))
9600 isl_die(isl_map_get_ctx(map), isl_error_invalid,
9601 "domain is not a product", return isl_map_free(map));
9603 space = isl_map_get_space(map);
9604 total = isl_space_dim(space, isl_dim_in);
9605 space = isl_space_domain_factor_range(space);
9606 keep = isl_space_dim(space, isl_dim_in);
9607 map = isl_map_project_out(map, isl_dim_in, 0, total - keep);
9608 map = isl_map_reset_space(map, space);
9610 return map;
9613 /* Given a map A -> [B -> C], extract the map A -> B.
9615 __isl_give isl_map *isl_map_range_factor_domain(__isl_take isl_map *map)
9617 isl_space *space;
9618 int total, keep;
9620 if (!map)
9621 return NULL;
9622 if (!isl_space_range_is_wrapping(map->dim))
9623 isl_die(isl_map_get_ctx(map), isl_error_invalid,
9624 "range is not a product", return isl_map_free(map));
9626 space = isl_map_get_space(map);
9627 total = isl_space_dim(space, isl_dim_out);
9628 space = isl_space_range_factor_domain(space);
9629 keep = isl_space_dim(space, isl_dim_out);
9630 map = isl_map_project_out(map, isl_dim_out, keep, total - keep);
9631 map = isl_map_reset_space(map, space);
9633 return map;
9636 /* Given a map A -> [B -> C], extract the map A -> C.
9638 __isl_give isl_map *isl_map_range_factor_range(__isl_take isl_map *map)
9640 isl_space *space;
9641 int total, keep;
9643 if (!map)
9644 return NULL;
9645 if (!isl_space_range_is_wrapping(map->dim))
9646 isl_die(isl_map_get_ctx(map), isl_error_invalid,
9647 "range is not a product", return isl_map_free(map));
9649 space = isl_map_get_space(map);
9650 total = isl_space_dim(space, isl_dim_out);
9651 space = isl_space_range_factor_range(space);
9652 keep = isl_space_dim(space, isl_dim_out);
9653 map = isl_map_project_out(map, isl_dim_out, 0, total - keep);
9654 map = isl_map_reset_space(map, space);
9656 return map;
9659 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
9661 __isl_give isl_map *isl_map_flat_domain_product(__isl_take isl_map *map1,
9662 __isl_take isl_map *map2)
9664 isl_map *prod;
9666 prod = isl_map_domain_product(map1, map2);
9667 prod = isl_map_flatten_domain(prod);
9668 return prod;
9671 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
9673 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
9674 __isl_take isl_map *map2)
9676 isl_map *prod;
9678 prod = isl_map_range_product(map1, map2);
9679 prod = isl_map_flatten_range(prod);
9680 return prod;
9683 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
9685 int i;
9686 uint32_t hash = isl_hash_init();
9687 unsigned total;
9689 if (!bmap)
9690 return 0;
9691 bmap = isl_basic_map_copy(bmap);
9692 bmap = isl_basic_map_normalize(bmap);
9693 if (!bmap)
9694 return 0;
9695 total = isl_basic_map_total_dim(bmap);
9696 isl_hash_byte(hash, bmap->n_eq & 0xFF);
9697 for (i = 0; i < bmap->n_eq; ++i) {
9698 uint32_t c_hash;
9699 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
9700 isl_hash_hash(hash, c_hash);
9702 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
9703 for (i = 0; i < bmap->n_ineq; ++i) {
9704 uint32_t c_hash;
9705 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
9706 isl_hash_hash(hash, c_hash);
9708 isl_hash_byte(hash, bmap->n_div & 0xFF);
9709 for (i = 0; i < bmap->n_div; ++i) {
9710 uint32_t c_hash;
9711 if (isl_int_is_zero(bmap->div[i][0]))
9712 continue;
9713 isl_hash_byte(hash, i & 0xFF);
9714 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
9715 isl_hash_hash(hash, c_hash);
9717 isl_basic_map_free(bmap);
9718 return hash;
9721 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
9723 return isl_basic_map_get_hash((isl_basic_map *)bset);
9726 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
9728 int i;
9729 uint32_t hash;
9731 if (!map)
9732 return 0;
9733 map = isl_map_copy(map);
9734 map = isl_map_normalize(map);
9735 if (!map)
9736 return 0;
9738 hash = isl_hash_init();
9739 for (i = 0; i < map->n; ++i) {
9740 uint32_t bmap_hash;
9741 bmap_hash = isl_basic_map_get_hash(map->p[i]);
9742 isl_hash_hash(hash, bmap_hash);
9745 isl_map_free(map);
9747 return hash;
9750 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
9752 return isl_map_get_hash((isl_map *)set);
9755 /* Check if the value for dimension dim is completely determined
9756 * by the values of the other parameters and variables.
9757 * That is, check if dimension dim is involved in an equality.
9759 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
9761 int i;
9762 unsigned nparam;
9764 if (!bset)
9765 return -1;
9766 nparam = isl_basic_set_n_param(bset);
9767 for (i = 0; i < bset->n_eq; ++i)
9768 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
9769 return 1;
9770 return 0;
9773 /* Check if the value for dimension dim is completely determined
9774 * by the values of the other parameters and variables.
9775 * That is, check if dimension dim is involved in an equality
9776 * for each of the subsets.
9778 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
9780 int i;
9782 if (!set)
9783 return -1;
9784 for (i = 0; i < set->n; ++i) {
9785 int unique;
9786 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
9787 if (unique != 1)
9788 return unique;
9790 return 1;
9793 /* Return the number of basic maps in the (current) representation of "map".
9795 int isl_map_n_basic_map(__isl_keep isl_map *map)
9797 return map ? map->n : 0;
9800 int isl_set_n_basic_set(__isl_keep isl_set *set)
9802 return set ? set->n : 0;
9805 isl_stat isl_map_foreach_basic_map(__isl_keep isl_map *map,
9806 isl_stat (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
9808 int i;
9810 if (!map)
9811 return isl_stat_error;
9813 for (i = 0; i < map->n; ++i)
9814 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
9815 return isl_stat_error;
9817 return isl_stat_ok;
9820 isl_stat isl_set_foreach_basic_set(__isl_keep isl_set *set,
9821 isl_stat (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
9823 int i;
9825 if (!set)
9826 return isl_stat_error;
9828 for (i = 0; i < set->n; ++i)
9829 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
9830 return isl_stat_error;
9832 return isl_stat_ok;
9835 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
9837 isl_space *dim;
9839 if (!bset)
9840 return NULL;
9842 bset = isl_basic_set_cow(bset);
9843 if (!bset)
9844 return NULL;
9846 dim = isl_basic_set_get_space(bset);
9847 dim = isl_space_lift(dim, bset->n_div);
9848 if (!dim)
9849 goto error;
9850 isl_space_free(bset->dim);
9851 bset->dim = dim;
9852 bset->extra -= bset->n_div;
9853 bset->n_div = 0;
9855 bset = isl_basic_set_finalize(bset);
9857 return bset;
9858 error:
9859 isl_basic_set_free(bset);
9860 return NULL;
9863 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
9865 int i;
9866 isl_space *dim;
9867 unsigned n_div;
9869 set = isl_set_align_divs(set);
9871 if (!set)
9872 return NULL;
9874 set = isl_set_cow(set);
9875 if (!set)
9876 return NULL;
9878 n_div = set->p[0]->n_div;
9879 dim = isl_set_get_space(set);
9880 dim = isl_space_lift(dim, n_div);
9881 if (!dim)
9882 goto error;
9883 isl_space_free(set->dim);
9884 set->dim = dim;
9886 for (i = 0; i < set->n; ++i) {
9887 set->p[i] = isl_basic_set_lift(set->p[i]);
9888 if (!set->p[i])
9889 goto error;
9892 return set;
9893 error:
9894 isl_set_free(set);
9895 return NULL;
9898 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
9900 isl_space *dim;
9901 struct isl_basic_map *bmap;
9902 unsigned n_set;
9903 unsigned n_div;
9904 unsigned n_param;
9905 unsigned total;
9906 int i, k, l;
9908 set = isl_set_align_divs(set);
9910 if (!set)
9911 return NULL;
9913 dim = isl_set_get_space(set);
9914 if (set->n == 0 || set->p[0]->n_div == 0) {
9915 isl_set_free(set);
9916 return isl_map_identity(isl_space_map_from_set(dim));
9919 n_div = set->p[0]->n_div;
9920 dim = isl_space_map_from_set(dim);
9921 n_param = isl_space_dim(dim, isl_dim_param);
9922 n_set = isl_space_dim(dim, isl_dim_in);
9923 dim = isl_space_extend(dim, n_param, n_set, n_set + n_div);
9924 bmap = isl_basic_map_alloc_space(dim, 0, n_set, 2 * n_div);
9925 for (i = 0; i < n_set; ++i)
9926 bmap = var_equal(bmap, i);
9928 total = n_param + n_set + n_set + n_div;
9929 for (i = 0; i < n_div; ++i) {
9930 k = isl_basic_map_alloc_inequality(bmap);
9931 if (k < 0)
9932 goto error;
9933 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
9934 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
9935 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
9936 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
9937 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
9938 set->p[0]->div[i][0]);
9940 l = isl_basic_map_alloc_inequality(bmap);
9941 if (l < 0)
9942 goto error;
9943 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
9944 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
9945 set->p[0]->div[i][0]);
9946 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
9949 isl_set_free(set);
9950 bmap = isl_basic_map_simplify(bmap);
9951 bmap = isl_basic_map_finalize(bmap);
9952 return isl_map_from_basic_map(bmap);
9953 error:
9954 isl_set_free(set);
9955 isl_basic_map_free(bmap);
9956 return NULL;
9959 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
9961 unsigned dim;
9962 int size = 0;
9964 if (!bset)
9965 return -1;
9967 dim = isl_basic_set_total_dim(bset);
9968 size += bset->n_eq * (1 + dim);
9969 size += bset->n_ineq * (1 + dim);
9970 size += bset->n_div * (2 + dim);
9972 return size;
9975 int isl_set_size(__isl_keep isl_set *set)
9977 int i;
9978 int size = 0;
9980 if (!set)
9981 return -1;
9983 for (i = 0; i < set->n; ++i)
9984 size += isl_basic_set_size(set->p[i]);
9986 return size;
9989 /* Check if there is any lower bound (if lower == 0) and/or upper
9990 * bound (if upper == 0) on the specified dim.
9992 static isl_bool basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
9993 enum isl_dim_type type, unsigned pos, int lower, int upper)
9995 int i;
9997 if (!bmap)
9998 return isl_bool_error;
10000 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type),
10001 return isl_bool_error);
10003 pos += isl_basic_map_offset(bmap, type);
10005 for (i = 0; i < bmap->n_div; ++i) {
10006 if (isl_int_is_zero(bmap->div[i][0]))
10007 continue;
10008 if (!isl_int_is_zero(bmap->div[i][1 + pos]))
10009 return isl_bool_true;
10012 for (i = 0; i < bmap->n_eq; ++i)
10013 if (!isl_int_is_zero(bmap->eq[i][pos]))
10014 return isl_bool_true;
10016 for (i = 0; i < bmap->n_ineq; ++i) {
10017 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
10018 if (sgn > 0)
10019 lower = 1;
10020 if (sgn < 0)
10021 upper = 1;
10024 return lower && upper;
10027 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
10028 enum isl_dim_type type, unsigned pos)
10030 return basic_map_dim_is_bounded(bmap, type, pos, 0, 0);
10033 isl_bool isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map *bmap,
10034 enum isl_dim_type type, unsigned pos)
10036 return basic_map_dim_is_bounded(bmap, type, pos, 0, 1);
10039 isl_bool isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map *bmap,
10040 enum isl_dim_type type, unsigned pos)
10042 return basic_map_dim_is_bounded(bmap, type, pos, 1, 0);
10045 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
10046 enum isl_dim_type type, unsigned pos)
10048 int i;
10050 if (!map)
10051 return -1;
10053 for (i = 0; i < map->n; ++i) {
10054 int bounded;
10055 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
10056 if (bounded < 0 || !bounded)
10057 return bounded;
10060 return 1;
10063 /* Return 1 if the specified dim is involved in both an upper bound
10064 * and a lower bound.
10066 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
10067 enum isl_dim_type type, unsigned pos)
10069 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
10072 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10074 static isl_bool has_any_bound(__isl_keep isl_map *map,
10075 enum isl_dim_type type, unsigned pos,
10076 isl_bool (*fn)(__isl_keep isl_basic_map *bmap,
10077 enum isl_dim_type type, unsigned pos))
10079 int i;
10081 if (!map)
10082 return isl_bool_error;
10084 for (i = 0; i < map->n; ++i) {
10085 isl_bool bounded;
10086 bounded = fn(map->p[i], type, pos);
10087 if (bounded < 0 || bounded)
10088 return bounded;
10091 return isl_bool_false;
10094 /* Return 1 if the specified dim is involved in any lower bound.
10096 isl_bool isl_set_dim_has_any_lower_bound(__isl_keep isl_set *set,
10097 enum isl_dim_type type, unsigned pos)
10099 return has_any_bound(set, type, pos,
10100 &isl_basic_map_dim_has_lower_bound);
10103 /* Return 1 if the specified dim is involved in any upper bound.
10105 isl_bool isl_set_dim_has_any_upper_bound(__isl_keep isl_set *set,
10106 enum isl_dim_type type, unsigned pos)
10108 return has_any_bound(set, type, pos,
10109 &isl_basic_map_dim_has_upper_bound);
10112 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10114 static isl_bool has_bound(__isl_keep isl_map *map,
10115 enum isl_dim_type type, unsigned pos,
10116 isl_bool (*fn)(__isl_keep isl_basic_map *bmap,
10117 enum isl_dim_type type, unsigned pos))
10119 int i;
10121 if (!map)
10122 return isl_bool_error;
10124 for (i = 0; i < map->n; ++i) {
10125 isl_bool bounded;
10126 bounded = fn(map->p[i], type, pos);
10127 if (bounded < 0 || !bounded)
10128 return bounded;
10131 return isl_bool_true;
10134 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10136 isl_bool isl_set_dim_has_lower_bound(__isl_keep isl_set *set,
10137 enum isl_dim_type type, unsigned pos)
10139 return has_bound(set, type, pos, &isl_basic_map_dim_has_lower_bound);
10142 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10144 isl_bool isl_set_dim_has_upper_bound(__isl_keep isl_set *set,
10145 enum isl_dim_type type, unsigned pos)
10147 return has_bound(set, type, pos, &isl_basic_map_dim_has_upper_bound);
10150 /* For each of the "n" variables starting at "first", determine
10151 * the sign of the variable and put the results in the first "n"
10152 * elements of the array "signs".
10153 * Sign
10154 * 1 means that the variable is non-negative
10155 * -1 means that the variable is non-positive
10156 * 0 means the variable attains both positive and negative values.
10158 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
10159 unsigned first, unsigned n, int *signs)
10161 isl_vec *bound = NULL;
10162 struct isl_tab *tab = NULL;
10163 struct isl_tab_undo *snap;
10164 int i;
10166 if (!bset || !signs)
10167 return -1;
10169 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
10170 tab = isl_tab_from_basic_set(bset, 0);
10171 if (!bound || !tab)
10172 goto error;
10174 isl_seq_clr(bound->el, bound->size);
10175 isl_int_set_si(bound->el[0], -1);
10177 snap = isl_tab_snap(tab);
10178 for (i = 0; i < n; ++i) {
10179 int empty;
10181 isl_int_set_si(bound->el[1 + first + i], -1);
10182 if (isl_tab_add_ineq(tab, bound->el) < 0)
10183 goto error;
10184 empty = tab->empty;
10185 isl_int_set_si(bound->el[1 + first + i], 0);
10186 if (isl_tab_rollback(tab, snap) < 0)
10187 goto error;
10189 if (empty) {
10190 signs[i] = 1;
10191 continue;
10194 isl_int_set_si(bound->el[1 + first + i], 1);
10195 if (isl_tab_add_ineq(tab, bound->el) < 0)
10196 goto error;
10197 empty = tab->empty;
10198 isl_int_set_si(bound->el[1 + first + i], 0);
10199 if (isl_tab_rollback(tab, snap) < 0)
10200 goto error;
10202 signs[i] = empty ? -1 : 0;
10205 isl_tab_free(tab);
10206 isl_vec_free(bound);
10207 return 0;
10208 error:
10209 isl_tab_free(tab);
10210 isl_vec_free(bound);
10211 return -1;
10214 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
10215 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
10217 if (!bset || !signs)
10218 return -1;
10219 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
10220 return -1);
10222 first += pos(bset->dim, type) - 1;
10223 return isl_basic_set_vars_get_sign(bset, first, n, signs);
10226 /* Is it possible for the integer division "div" to depend (possibly
10227 * indirectly) on any output dimensions?
10229 * If the div is undefined, then we conservatively assume that it
10230 * may depend on them.
10231 * Otherwise, we check if it actually depends on them or on any integer
10232 * divisions that may depend on them.
10234 static int div_may_involve_output(__isl_keep isl_basic_map *bmap, int div)
10236 int i;
10237 unsigned n_out, o_out;
10238 unsigned n_div, o_div;
10240 if (isl_int_is_zero(bmap->div[div][0]))
10241 return 1;
10243 n_out = isl_basic_map_dim(bmap, isl_dim_out);
10244 o_out = isl_basic_map_offset(bmap, isl_dim_out);
10246 if (isl_seq_first_non_zero(bmap->div[div] + 1 + o_out, n_out) != -1)
10247 return 1;
10249 n_div = isl_basic_map_dim(bmap, isl_dim_div);
10250 o_div = isl_basic_map_offset(bmap, isl_dim_div);
10252 for (i = 0; i < n_div; ++i) {
10253 if (isl_int_is_zero(bmap->div[div][1 + o_div + i]))
10254 continue;
10255 if (div_may_involve_output(bmap, i))
10256 return 1;
10259 return 0;
10262 /* Return the index of the equality of "bmap" that defines
10263 * the output dimension "pos" in terms of earlier dimensions.
10264 * The equality may also involve integer divisions, as long
10265 * as those integer divisions are defined in terms of
10266 * parameters or input dimensions.
10267 * Return bmap->n_eq if there is no such equality.
10268 * Return -1 on error.
10270 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map *bmap,
10271 int pos)
10273 int j, k;
10274 unsigned n_out, o_out;
10275 unsigned n_div, o_div;
10277 if (!bmap)
10278 return -1;
10280 n_out = isl_basic_map_dim(bmap, isl_dim_out);
10281 o_out = isl_basic_map_offset(bmap, isl_dim_out);
10282 n_div = isl_basic_map_dim(bmap, isl_dim_div);
10283 o_div = isl_basic_map_offset(bmap, isl_dim_div);
10285 for (j = 0; j < bmap->n_eq; ++j) {
10286 if (isl_int_is_zero(bmap->eq[j][o_out + pos]))
10287 continue;
10288 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + pos + 1,
10289 n_out - (pos + 1)) != -1)
10290 continue;
10291 for (k = 0; k < n_div; ++k) {
10292 if (isl_int_is_zero(bmap->eq[j][o_div + k]))
10293 continue;
10294 if (div_may_involve_output(bmap, k))
10295 break;
10297 if (k >= n_div)
10298 return j;
10301 return bmap->n_eq;
10304 /* Check if the given basic map is obviously single-valued.
10305 * In particular, for each output dimension, check that there is
10306 * an equality that defines the output dimension in terms of
10307 * earlier dimensions.
10309 isl_bool isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
10311 int i;
10312 unsigned n_out;
10314 if (!bmap)
10315 return isl_bool_error;
10317 n_out = isl_basic_map_dim(bmap, isl_dim_out);
10319 for (i = 0; i < n_out; ++i) {
10320 int eq;
10322 eq = isl_basic_map_output_defining_equality(bmap, i);
10323 if (eq < 0)
10324 return isl_bool_error;
10325 if (eq >= bmap->n_eq)
10326 return isl_bool_false;
10329 return isl_bool_true;
10332 /* Check if the given basic map is single-valued.
10333 * We simply compute
10335 * M \circ M^-1
10337 * and check if the result is a subset of the identity mapping.
10339 isl_bool isl_basic_map_is_single_valued(__isl_keep isl_basic_map *bmap)
10341 isl_space *space;
10342 isl_basic_map *test;
10343 isl_basic_map *id;
10344 isl_bool sv;
10346 sv = isl_basic_map_plain_is_single_valued(bmap);
10347 if (sv < 0 || sv)
10348 return sv;
10350 test = isl_basic_map_reverse(isl_basic_map_copy(bmap));
10351 test = isl_basic_map_apply_range(test, isl_basic_map_copy(bmap));
10353 space = isl_basic_map_get_space(bmap);
10354 space = isl_space_map_from_set(isl_space_range(space));
10355 id = isl_basic_map_identity(space);
10357 sv = isl_basic_map_is_subset(test, id);
10359 isl_basic_map_free(test);
10360 isl_basic_map_free(id);
10362 return sv;
10365 /* Check if the given map is obviously single-valued.
10367 isl_bool isl_map_plain_is_single_valued(__isl_keep isl_map *map)
10369 if (!map)
10370 return isl_bool_error;
10371 if (map->n == 0)
10372 return isl_bool_true;
10373 if (map->n >= 2)
10374 return isl_bool_false;
10376 return isl_basic_map_plain_is_single_valued(map->p[0]);
10379 /* Check if the given map is single-valued.
10380 * We simply compute
10382 * M \circ M^-1
10384 * and check if the result is a subset of the identity mapping.
10386 isl_bool isl_map_is_single_valued(__isl_keep isl_map *map)
10388 isl_space *dim;
10389 isl_map *test;
10390 isl_map *id;
10391 isl_bool sv;
10393 sv = isl_map_plain_is_single_valued(map);
10394 if (sv < 0 || sv)
10395 return sv;
10397 test = isl_map_reverse(isl_map_copy(map));
10398 test = isl_map_apply_range(test, isl_map_copy(map));
10400 dim = isl_space_map_from_set(isl_space_range(isl_map_get_space(map)));
10401 id = isl_map_identity(dim);
10403 sv = isl_map_is_subset(test, id);
10405 isl_map_free(test);
10406 isl_map_free(id);
10408 return sv;
10411 isl_bool isl_map_is_injective(__isl_keep isl_map *map)
10413 isl_bool in;
10415 map = isl_map_copy(map);
10416 map = isl_map_reverse(map);
10417 in = isl_map_is_single_valued(map);
10418 isl_map_free(map);
10420 return in;
10423 /* Check if the given map is obviously injective.
10425 isl_bool isl_map_plain_is_injective(__isl_keep isl_map *map)
10427 isl_bool in;
10429 map = isl_map_copy(map);
10430 map = isl_map_reverse(map);
10431 in = isl_map_plain_is_single_valued(map);
10432 isl_map_free(map);
10434 return in;
10437 isl_bool isl_map_is_bijective(__isl_keep isl_map *map)
10439 isl_bool sv;
10441 sv = isl_map_is_single_valued(map);
10442 if (sv < 0 || !sv)
10443 return sv;
10445 return isl_map_is_injective(map);
10448 isl_bool isl_set_is_singleton(__isl_keep isl_set *set)
10450 return isl_map_is_single_valued((isl_map *)set);
10453 int isl_map_is_translation(__isl_keep isl_map *map)
10455 int ok;
10456 isl_set *delta;
10458 delta = isl_map_deltas(isl_map_copy(map));
10459 ok = isl_set_is_singleton(delta);
10460 isl_set_free(delta);
10462 return ok;
10465 static int unique(isl_int *p, unsigned pos, unsigned len)
10467 if (isl_seq_first_non_zero(p, pos) != -1)
10468 return 0;
10469 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
10470 return 0;
10471 return 1;
10474 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
10476 int i, j;
10477 unsigned nvar;
10478 unsigned ovar;
10480 if (!bset)
10481 return -1;
10483 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
10484 return 0;
10486 nvar = isl_basic_set_dim(bset, isl_dim_set);
10487 ovar = isl_space_offset(bset->dim, isl_dim_set);
10488 for (j = 0; j < nvar; ++j) {
10489 int lower = 0, upper = 0;
10490 for (i = 0; i < bset->n_eq; ++i) {
10491 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
10492 continue;
10493 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
10494 return 0;
10495 break;
10497 if (i < bset->n_eq)
10498 continue;
10499 for (i = 0; i < bset->n_ineq; ++i) {
10500 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
10501 continue;
10502 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
10503 return 0;
10504 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
10505 lower = 1;
10506 else
10507 upper = 1;
10509 if (!lower || !upper)
10510 return 0;
10513 return 1;
10516 int isl_set_is_box(__isl_keep isl_set *set)
10518 if (!set)
10519 return -1;
10520 if (set->n != 1)
10521 return 0;
10523 return isl_basic_set_is_box(set->p[0]);
10526 isl_bool isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
10528 if (!bset)
10529 return isl_bool_error;
10531 return isl_space_is_wrapping(bset->dim);
10534 isl_bool isl_set_is_wrapping(__isl_keep isl_set *set)
10536 if (!set)
10537 return isl_bool_error;
10539 return isl_space_is_wrapping(set->dim);
10542 /* Is the domain of "map" a wrapped relation?
10544 isl_bool isl_map_domain_is_wrapping(__isl_keep isl_map *map)
10546 if (!map)
10547 return isl_bool_error;
10549 return isl_space_domain_is_wrapping(map->dim);
10552 /* Is the range of "map" a wrapped relation?
10554 isl_bool isl_map_range_is_wrapping(__isl_keep isl_map *map)
10556 if (!map)
10557 return isl_bool_error;
10559 return isl_space_range_is_wrapping(map->dim);
10562 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
10564 bmap = isl_basic_map_cow(bmap);
10565 if (!bmap)
10566 return NULL;
10568 bmap->dim = isl_space_wrap(bmap->dim);
10569 if (!bmap->dim)
10570 goto error;
10572 bmap = isl_basic_map_finalize(bmap);
10574 return (isl_basic_set *)bmap;
10575 error:
10576 isl_basic_map_free(bmap);
10577 return NULL;
10580 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
10582 int i;
10584 map = isl_map_cow(map);
10585 if (!map)
10586 return NULL;
10588 for (i = 0; i < map->n; ++i) {
10589 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
10590 if (!map->p[i])
10591 goto error;
10593 map->dim = isl_space_wrap(map->dim);
10594 if (!map->dim)
10595 goto error;
10597 return (isl_set *)map;
10598 error:
10599 isl_map_free(map);
10600 return NULL;
10603 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
10605 bset = isl_basic_set_cow(bset);
10606 if (!bset)
10607 return NULL;
10609 bset->dim = isl_space_unwrap(bset->dim);
10610 if (!bset->dim)
10611 goto error;
10613 bset = isl_basic_set_finalize(bset);
10615 return (isl_basic_map *)bset;
10616 error:
10617 isl_basic_set_free(bset);
10618 return NULL;
10621 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
10623 int i;
10625 if (!set)
10626 return NULL;
10628 if (!isl_set_is_wrapping(set))
10629 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
10630 goto error);
10632 set = isl_set_cow(set);
10633 if (!set)
10634 return NULL;
10636 for (i = 0; i < set->n; ++i) {
10637 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
10638 if (!set->p[i])
10639 goto error;
10642 set->dim = isl_space_unwrap(set->dim);
10643 if (!set->dim)
10644 goto error;
10646 return (isl_map *)set;
10647 error:
10648 isl_set_free(set);
10649 return NULL;
10652 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
10653 enum isl_dim_type type)
10655 if (!bmap)
10656 return NULL;
10658 if (!isl_space_is_named_or_nested(bmap->dim, type))
10659 return bmap;
10661 bmap = isl_basic_map_cow(bmap);
10662 if (!bmap)
10663 return NULL;
10665 bmap->dim = isl_space_reset(bmap->dim, type);
10666 if (!bmap->dim)
10667 goto error;
10669 bmap = isl_basic_map_finalize(bmap);
10671 return bmap;
10672 error:
10673 isl_basic_map_free(bmap);
10674 return NULL;
10677 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
10678 enum isl_dim_type type)
10680 int i;
10682 if (!map)
10683 return NULL;
10685 if (!isl_space_is_named_or_nested(map->dim, type))
10686 return map;
10688 map = isl_map_cow(map);
10689 if (!map)
10690 return NULL;
10692 for (i = 0; i < map->n; ++i) {
10693 map->p[i] = isl_basic_map_reset(map->p[i], type);
10694 if (!map->p[i])
10695 goto error;
10697 map->dim = isl_space_reset(map->dim, type);
10698 if (!map->dim)
10699 goto error;
10701 return map;
10702 error:
10703 isl_map_free(map);
10704 return NULL;
10707 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
10709 if (!bmap)
10710 return NULL;
10712 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
10713 return bmap;
10715 bmap = isl_basic_map_cow(bmap);
10716 if (!bmap)
10717 return NULL;
10719 bmap->dim = isl_space_flatten(bmap->dim);
10720 if (!bmap->dim)
10721 goto error;
10723 bmap = isl_basic_map_finalize(bmap);
10725 return bmap;
10726 error:
10727 isl_basic_map_free(bmap);
10728 return NULL;
10731 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
10733 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
10736 __isl_give isl_basic_map *isl_basic_map_flatten_domain(
10737 __isl_take isl_basic_map *bmap)
10739 if (!bmap)
10740 return NULL;
10742 if (!bmap->dim->nested[0])
10743 return bmap;
10745 bmap = isl_basic_map_cow(bmap);
10746 if (!bmap)
10747 return NULL;
10749 bmap->dim = isl_space_flatten_domain(bmap->dim);
10750 if (!bmap->dim)
10751 goto error;
10753 bmap = isl_basic_map_finalize(bmap);
10755 return bmap;
10756 error:
10757 isl_basic_map_free(bmap);
10758 return NULL;
10761 __isl_give isl_basic_map *isl_basic_map_flatten_range(
10762 __isl_take isl_basic_map *bmap)
10764 if (!bmap)
10765 return NULL;
10767 if (!bmap->dim->nested[1])
10768 return bmap;
10770 bmap = isl_basic_map_cow(bmap);
10771 if (!bmap)
10772 return NULL;
10774 bmap->dim = isl_space_flatten_range(bmap->dim);
10775 if (!bmap->dim)
10776 goto error;
10778 bmap = isl_basic_map_finalize(bmap);
10780 return bmap;
10781 error:
10782 isl_basic_map_free(bmap);
10783 return NULL;
10786 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
10788 int i;
10790 if (!map)
10791 return NULL;
10793 if (!map->dim->nested[0] && !map->dim->nested[1])
10794 return map;
10796 map = isl_map_cow(map);
10797 if (!map)
10798 return NULL;
10800 for (i = 0; i < map->n; ++i) {
10801 map->p[i] = isl_basic_map_flatten(map->p[i]);
10802 if (!map->p[i])
10803 goto error;
10805 map->dim = isl_space_flatten(map->dim);
10806 if (!map->dim)
10807 goto error;
10809 return map;
10810 error:
10811 isl_map_free(map);
10812 return NULL;
10815 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
10817 return (isl_set *)isl_map_flatten((isl_map *)set);
10820 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
10822 isl_space *dim, *flat_dim;
10823 isl_map *map;
10825 dim = isl_set_get_space(set);
10826 flat_dim = isl_space_flatten(isl_space_copy(dim));
10827 map = isl_map_identity(isl_space_join(isl_space_reverse(dim), flat_dim));
10828 map = isl_map_intersect_domain(map, set);
10830 return map;
10833 __isl_give isl_map *isl_map_flatten_domain(__isl_take isl_map *map)
10835 int i;
10837 if (!map)
10838 return NULL;
10840 if (!map->dim->nested[0])
10841 return map;
10843 map = isl_map_cow(map);
10844 if (!map)
10845 return NULL;
10847 for (i = 0; i < map->n; ++i) {
10848 map->p[i] = isl_basic_map_flatten_domain(map->p[i]);
10849 if (!map->p[i])
10850 goto error;
10852 map->dim = isl_space_flatten_domain(map->dim);
10853 if (!map->dim)
10854 goto error;
10856 return map;
10857 error:
10858 isl_map_free(map);
10859 return NULL;
10862 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
10864 int i;
10866 if (!map)
10867 return NULL;
10869 if (!map->dim->nested[1])
10870 return map;
10872 map = isl_map_cow(map);
10873 if (!map)
10874 return NULL;
10876 for (i = 0; i < map->n; ++i) {
10877 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
10878 if (!map->p[i])
10879 goto error;
10881 map->dim = isl_space_flatten_range(map->dim);
10882 if (!map->dim)
10883 goto error;
10885 return map;
10886 error:
10887 isl_map_free(map);
10888 return NULL;
10891 /* Reorder the dimensions of "bmap" according to the given dim_map
10892 * and set the dimension specification to "dim".
10894 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
10895 __isl_take isl_space *dim, __isl_take struct isl_dim_map *dim_map)
10897 isl_basic_map *res;
10898 unsigned flags;
10900 bmap = isl_basic_map_cow(bmap);
10901 if (!bmap || !dim || !dim_map)
10902 goto error;
10904 flags = bmap->flags;
10905 ISL_FL_CLR(flags, ISL_BASIC_MAP_FINAL);
10906 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED);
10907 ISL_FL_CLR(flags, ISL_BASIC_MAP_NORMALIZED_DIVS);
10908 res = isl_basic_map_alloc_space(dim,
10909 bmap->n_div, bmap->n_eq, bmap->n_ineq);
10910 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
10911 if (res)
10912 res->flags = flags;
10913 res = isl_basic_map_finalize(res);
10914 return res;
10915 error:
10916 free(dim_map);
10917 isl_basic_map_free(bmap);
10918 isl_space_free(dim);
10919 return NULL;
10922 /* Reorder the dimensions of "map" according to given reordering.
10924 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
10925 __isl_take isl_reordering *r)
10927 int i;
10928 struct isl_dim_map *dim_map;
10930 map = isl_map_cow(map);
10931 dim_map = isl_dim_map_from_reordering(r);
10932 if (!map || !r || !dim_map)
10933 goto error;
10935 for (i = 0; i < map->n; ++i) {
10936 struct isl_dim_map *dim_map_i;
10938 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
10940 map->p[i] = isl_basic_map_realign(map->p[i],
10941 isl_space_copy(r->dim), dim_map_i);
10943 if (!map->p[i])
10944 goto error;
10947 map = isl_map_reset_space(map, isl_space_copy(r->dim));
10949 isl_reordering_free(r);
10950 free(dim_map);
10951 return map;
10952 error:
10953 free(dim_map);
10954 isl_map_free(map);
10955 isl_reordering_free(r);
10956 return NULL;
10959 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
10960 __isl_take isl_reordering *r)
10962 return (isl_set *)isl_map_realign((isl_map *)set, r);
10965 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
10966 __isl_take isl_space *model)
10968 isl_ctx *ctx;
10970 if (!map || !model)
10971 goto error;
10973 ctx = isl_space_get_ctx(model);
10974 if (!isl_space_has_named_params(model))
10975 isl_die(ctx, isl_error_invalid,
10976 "model has unnamed parameters", goto error);
10977 if (!isl_space_has_named_params(map->dim))
10978 isl_die(ctx, isl_error_invalid,
10979 "relation has unnamed parameters", goto error);
10980 if (!isl_space_match(map->dim, isl_dim_param, model, isl_dim_param)) {
10981 isl_reordering *exp;
10983 model = isl_space_drop_dims(model, isl_dim_in,
10984 0, isl_space_dim(model, isl_dim_in));
10985 model = isl_space_drop_dims(model, isl_dim_out,
10986 0, isl_space_dim(model, isl_dim_out));
10987 exp = isl_parameter_alignment_reordering(map->dim, model);
10988 exp = isl_reordering_extend_space(exp, isl_map_get_space(map));
10989 map = isl_map_realign(map, exp);
10992 isl_space_free(model);
10993 return map;
10994 error:
10995 isl_space_free(model);
10996 isl_map_free(map);
10997 return NULL;
11000 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
11001 __isl_take isl_space *model)
11003 return isl_map_align_params(set, model);
11006 /* Align the parameters of "bmap" to those of "model", introducing
11007 * additional parameters if needed.
11009 __isl_give isl_basic_map *isl_basic_map_align_params(
11010 __isl_take isl_basic_map *bmap, __isl_take isl_space *model)
11012 isl_ctx *ctx;
11014 if (!bmap || !model)
11015 goto error;
11017 ctx = isl_space_get_ctx(model);
11018 if (!isl_space_has_named_params(model))
11019 isl_die(ctx, isl_error_invalid,
11020 "model has unnamed parameters", goto error);
11021 if (!isl_space_has_named_params(bmap->dim))
11022 isl_die(ctx, isl_error_invalid,
11023 "relation has unnamed parameters", goto error);
11024 if (!isl_space_match(bmap->dim, isl_dim_param, model, isl_dim_param)) {
11025 isl_reordering *exp;
11026 struct isl_dim_map *dim_map;
11028 model = isl_space_drop_dims(model, isl_dim_in,
11029 0, isl_space_dim(model, isl_dim_in));
11030 model = isl_space_drop_dims(model, isl_dim_out,
11031 0, isl_space_dim(model, isl_dim_out));
11032 exp = isl_parameter_alignment_reordering(bmap->dim, model);
11033 exp = isl_reordering_extend_space(exp,
11034 isl_basic_map_get_space(bmap));
11035 dim_map = isl_dim_map_from_reordering(exp);
11036 bmap = isl_basic_map_realign(bmap,
11037 exp ? isl_space_copy(exp->dim) : NULL,
11038 isl_dim_map_extend(dim_map, bmap));
11039 isl_reordering_free(exp);
11040 free(dim_map);
11043 isl_space_free(model);
11044 return bmap;
11045 error:
11046 isl_space_free(model);
11047 isl_basic_map_free(bmap);
11048 return NULL;
11051 /* Align the parameters of "bset" to those of "model", introducing
11052 * additional parameters if needed.
11054 __isl_give isl_basic_set *isl_basic_set_align_params(
11055 __isl_take isl_basic_set *bset, __isl_take isl_space *model)
11057 return isl_basic_map_align_params(bset, model);
11060 __isl_give isl_mat *isl_basic_map_equalities_matrix(
11061 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
11062 enum isl_dim_type c2, enum isl_dim_type c3,
11063 enum isl_dim_type c4, enum isl_dim_type c5)
11065 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
11066 struct isl_mat *mat;
11067 int i, j, k;
11068 int pos;
11070 if (!bmap)
11071 return NULL;
11072 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
11073 isl_basic_map_total_dim(bmap) + 1);
11074 if (!mat)
11075 return NULL;
11076 for (i = 0; i < bmap->n_eq; ++i)
11077 for (j = 0, pos = 0; j < 5; ++j) {
11078 int off = isl_basic_map_offset(bmap, c[j]);
11079 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
11080 isl_int_set(mat->row[i][pos],
11081 bmap->eq[i][off + k]);
11082 ++pos;
11086 return mat;
11089 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
11090 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
11091 enum isl_dim_type c2, enum isl_dim_type c3,
11092 enum isl_dim_type c4, enum isl_dim_type c5)
11094 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
11095 struct isl_mat *mat;
11096 int i, j, k;
11097 int pos;
11099 if (!bmap)
11100 return NULL;
11101 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
11102 isl_basic_map_total_dim(bmap) + 1);
11103 if (!mat)
11104 return NULL;
11105 for (i = 0; i < bmap->n_ineq; ++i)
11106 for (j = 0, pos = 0; j < 5; ++j) {
11107 int off = isl_basic_map_offset(bmap, c[j]);
11108 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
11109 isl_int_set(mat->row[i][pos],
11110 bmap->ineq[i][off + k]);
11111 ++pos;
11115 return mat;
11118 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
11119 __isl_take isl_space *dim,
11120 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
11121 enum isl_dim_type c2, enum isl_dim_type c3,
11122 enum isl_dim_type c4, enum isl_dim_type c5)
11124 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
11125 isl_basic_map *bmap;
11126 unsigned total;
11127 unsigned extra;
11128 int i, j, k, l;
11129 int pos;
11131 if (!dim || !eq || !ineq)
11132 goto error;
11134 if (eq->n_col != ineq->n_col)
11135 isl_die(dim->ctx, isl_error_invalid,
11136 "equalities and inequalities matrices should have "
11137 "same number of columns", goto error);
11139 total = 1 + isl_space_dim(dim, isl_dim_all);
11141 if (eq->n_col < total)
11142 isl_die(dim->ctx, isl_error_invalid,
11143 "number of columns too small", goto error);
11145 extra = eq->n_col - total;
11147 bmap = isl_basic_map_alloc_space(isl_space_copy(dim), extra,
11148 eq->n_row, ineq->n_row);
11149 if (!bmap)
11150 goto error;
11151 for (i = 0; i < extra; ++i) {
11152 k = isl_basic_map_alloc_div(bmap);
11153 if (k < 0)
11154 goto error;
11155 isl_int_set_si(bmap->div[k][0], 0);
11157 for (i = 0; i < eq->n_row; ++i) {
11158 l = isl_basic_map_alloc_equality(bmap);
11159 if (l < 0)
11160 goto error;
11161 for (j = 0, pos = 0; j < 5; ++j) {
11162 int off = isl_basic_map_offset(bmap, c[j]);
11163 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
11164 isl_int_set(bmap->eq[l][off + k],
11165 eq->row[i][pos]);
11166 ++pos;
11170 for (i = 0; i < ineq->n_row; ++i) {
11171 l = isl_basic_map_alloc_inequality(bmap);
11172 if (l < 0)
11173 goto error;
11174 for (j = 0, pos = 0; j < 5; ++j) {
11175 int off = isl_basic_map_offset(bmap, c[j]);
11176 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
11177 isl_int_set(bmap->ineq[l][off + k],
11178 ineq->row[i][pos]);
11179 ++pos;
11184 isl_space_free(dim);
11185 isl_mat_free(eq);
11186 isl_mat_free(ineq);
11188 bmap = isl_basic_map_simplify(bmap);
11189 return isl_basic_map_finalize(bmap);
11190 error:
11191 isl_space_free(dim);
11192 isl_mat_free(eq);
11193 isl_mat_free(ineq);
11194 return NULL;
11197 __isl_give isl_mat *isl_basic_set_equalities_matrix(
11198 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
11199 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
11201 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
11202 c1, c2, c3, c4, isl_dim_in);
11205 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
11206 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
11207 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
11209 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
11210 c1, c2, c3, c4, isl_dim_in);
11213 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
11214 __isl_take isl_space *dim,
11215 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
11216 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
11218 return (isl_basic_set*)
11219 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
11220 c1, c2, c3, c4, isl_dim_in);
11223 isl_bool isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
11225 if (!bmap)
11226 return isl_bool_error;
11228 return isl_space_can_zip(bmap->dim);
11231 isl_bool isl_map_can_zip(__isl_keep isl_map *map)
11233 if (!map)
11234 return isl_bool_error;
11236 return isl_space_can_zip(map->dim);
11239 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
11240 * (A -> C) -> (B -> D).
11242 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
11244 unsigned pos;
11245 unsigned n1;
11246 unsigned n2;
11248 if (!bmap)
11249 return NULL;
11251 if (!isl_basic_map_can_zip(bmap))
11252 isl_die(bmap->ctx, isl_error_invalid,
11253 "basic map cannot be zipped", goto error);
11254 pos = isl_basic_map_offset(bmap, isl_dim_in) +
11255 isl_space_dim(bmap->dim->nested[0], isl_dim_in);
11256 n1 = isl_space_dim(bmap->dim->nested[0], isl_dim_out);
11257 n2 = isl_space_dim(bmap->dim->nested[1], isl_dim_in);
11258 bmap = isl_basic_map_cow(bmap);
11259 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
11260 if (!bmap)
11261 return NULL;
11262 bmap->dim = isl_space_zip(bmap->dim);
11263 if (!bmap->dim)
11264 goto error;
11265 return bmap;
11266 error:
11267 isl_basic_map_free(bmap);
11268 return NULL;
11271 /* Given a map (A -> B) -> (C -> D), return the corresponding map
11272 * (A -> C) -> (B -> D).
11274 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
11276 int i;
11278 if (!map)
11279 return NULL;
11281 if (!isl_map_can_zip(map))
11282 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
11283 goto error);
11285 map = isl_map_cow(map);
11286 if (!map)
11287 return NULL;
11289 for (i = 0; i < map->n; ++i) {
11290 map->p[i] = isl_basic_map_zip(map->p[i]);
11291 if (!map->p[i])
11292 goto error;
11295 map->dim = isl_space_zip(map->dim);
11296 if (!map->dim)
11297 goto error;
11299 return map;
11300 error:
11301 isl_map_free(map);
11302 return NULL;
11305 /* Can we apply isl_basic_map_curry to "bmap"?
11306 * That is, does it have a nested relation in its domain?
11308 isl_bool isl_basic_map_can_curry(__isl_keep isl_basic_map *bmap)
11310 if (!bmap)
11311 return isl_bool_error;
11313 return isl_space_can_curry(bmap->dim);
11316 /* Can we apply isl_map_curry to "map"?
11317 * That is, does it have a nested relation in its domain?
11319 isl_bool isl_map_can_curry(__isl_keep isl_map *map)
11321 if (!map)
11322 return isl_bool_error;
11324 return isl_space_can_curry(map->dim);
11327 /* Given a basic map (A -> B) -> C, return the corresponding basic map
11328 * A -> (B -> C).
11330 __isl_give isl_basic_map *isl_basic_map_curry(__isl_take isl_basic_map *bmap)
11333 if (!bmap)
11334 return NULL;
11336 if (!isl_basic_map_can_curry(bmap))
11337 isl_die(bmap->ctx, isl_error_invalid,
11338 "basic map cannot be curried", goto error);
11339 bmap = isl_basic_map_cow(bmap);
11340 if (!bmap)
11341 return NULL;
11342 bmap->dim = isl_space_curry(bmap->dim);
11343 if (!bmap->dim)
11344 goto error;
11345 return bmap;
11346 error:
11347 isl_basic_map_free(bmap);
11348 return NULL;
11351 /* Given a map (A -> B) -> C, return the corresponding map
11352 * A -> (B -> C).
11354 __isl_give isl_map *isl_map_curry(__isl_take isl_map *map)
11356 int i;
11358 if (!map)
11359 return NULL;
11361 if (!isl_map_can_curry(map))
11362 isl_die(map->ctx, isl_error_invalid, "map cannot be curried",
11363 goto error);
11365 map = isl_map_cow(map);
11366 if (!map)
11367 return NULL;
11369 for (i = 0; i < map->n; ++i) {
11370 map->p[i] = isl_basic_map_curry(map->p[i]);
11371 if (!map->p[i])
11372 goto error;
11375 map->dim = isl_space_curry(map->dim);
11376 if (!map->dim)
11377 goto error;
11379 return map;
11380 error:
11381 isl_map_free(map);
11382 return NULL;
11385 /* Can we apply isl_basic_map_uncurry to "bmap"?
11386 * That is, does it have a nested relation in its domain?
11388 isl_bool isl_basic_map_can_uncurry(__isl_keep isl_basic_map *bmap)
11390 if (!bmap)
11391 return isl_bool_error;
11393 return isl_space_can_uncurry(bmap->dim);
11396 /* Can we apply isl_map_uncurry to "map"?
11397 * That is, does it have a nested relation in its domain?
11399 isl_bool isl_map_can_uncurry(__isl_keep isl_map *map)
11401 if (!map)
11402 return isl_bool_error;
11404 return isl_space_can_uncurry(map->dim);
11407 /* Given a basic map A -> (B -> C), return the corresponding basic map
11408 * (A -> B) -> C.
11410 __isl_give isl_basic_map *isl_basic_map_uncurry(__isl_take isl_basic_map *bmap)
11413 if (!bmap)
11414 return NULL;
11416 if (!isl_basic_map_can_uncurry(bmap))
11417 isl_die(bmap->ctx, isl_error_invalid,
11418 "basic map cannot be uncurried",
11419 return isl_basic_map_free(bmap));
11420 bmap = isl_basic_map_cow(bmap);
11421 if (!bmap)
11422 return NULL;
11423 bmap->dim = isl_space_uncurry(bmap->dim);
11424 if (!bmap->dim)
11425 return isl_basic_map_free(bmap);
11426 return bmap;
11429 /* Given a map A -> (B -> C), return the corresponding map
11430 * (A -> B) -> C.
11432 __isl_give isl_map *isl_map_uncurry(__isl_take isl_map *map)
11434 int i;
11436 if (!map)
11437 return NULL;
11439 if (!isl_map_can_uncurry(map))
11440 isl_die(map->ctx, isl_error_invalid, "map cannot be uncurried",
11441 return isl_map_free(map));
11443 map = isl_map_cow(map);
11444 if (!map)
11445 return NULL;
11447 for (i = 0; i < map->n; ++i) {
11448 map->p[i] = isl_basic_map_uncurry(map->p[i]);
11449 if (!map->p[i])
11450 return isl_map_free(map);
11453 map->dim = isl_space_uncurry(map->dim);
11454 if (!map->dim)
11455 return isl_map_free(map);
11457 return map;
11460 /* Construct a basic map mapping the domain of the affine expression
11461 * to a one-dimensional range prescribed by the affine expression.
11463 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
11465 int k;
11466 int pos;
11467 isl_local_space *ls;
11468 isl_basic_map *bmap;
11470 if (!aff)
11471 return NULL;
11473 ls = isl_aff_get_local_space(aff);
11474 bmap = isl_basic_map_from_local_space(ls);
11475 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
11476 k = isl_basic_map_alloc_equality(bmap);
11477 if (k < 0)
11478 goto error;
11480 pos = isl_basic_map_offset(bmap, isl_dim_out);
11481 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
11482 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
11483 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
11484 aff->v->size - (pos + 1));
11486 isl_aff_free(aff);
11487 bmap = isl_basic_map_finalize(bmap);
11488 return bmap;
11489 error:
11490 isl_aff_free(aff);
11491 isl_basic_map_free(bmap);
11492 return NULL;
11495 /* Construct a map mapping the domain of the affine expression
11496 * to a one-dimensional range prescribed by the affine expression.
11498 __isl_give isl_map *isl_map_from_aff(__isl_take isl_aff *aff)
11500 isl_basic_map *bmap;
11502 bmap = isl_basic_map_from_aff(aff);
11503 return isl_map_from_basic_map(bmap);
11506 /* Construct a basic map mapping the domain the multi-affine expression
11507 * to its range, with each dimension in the range equated to the
11508 * corresponding affine expression.
11510 __isl_give isl_basic_map *isl_basic_map_from_multi_aff(
11511 __isl_take isl_multi_aff *maff)
11513 int i;
11514 isl_space *space;
11515 isl_basic_map *bmap;
11517 if (!maff)
11518 return NULL;
11520 if (isl_space_dim(maff->space, isl_dim_out) != maff->n)
11521 isl_die(isl_multi_aff_get_ctx(maff), isl_error_internal,
11522 "invalid space", goto error);
11524 space = isl_space_domain(isl_multi_aff_get_space(maff));
11525 bmap = isl_basic_map_universe(isl_space_from_domain(space));
11527 for (i = 0; i < maff->n; ++i) {
11528 isl_aff *aff;
11529 isl_basic_map *bmap_i;
11531 aff = isl_aff_copy(maff->p[i]);
11532 bmap_i = isl_basic_map_from_aff(aff);
11534 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
11537 bmap = isl_basic_map_reset_space(bmap, isl_multi_aff_get_space(maff));
11539 isl_multi_aff_free(maff);
11540 return bmap;
11541 error:
11542 isl_multi_aff_free(maff);
11543 return NULL;
11546 /* Construct a map mapping the domain the multi-affine expression
11547 * to its range, with each dimension in the range equated to the
11548 * corresponding affine expression.
11550 __isl_give isl_map *isl_map_from_multi_aff(__isl_take isl_multi_aff *maff)
11552 isl_basic_map *bmap;
11554 bmap = isl_basic_map_from_multi_aff(maff);
11555 return isl_map_from_basic_map(bmap);
11558 /* Construct a basic map mapping a domain in the given space to
11559 * to an n-dimensional range, with n the number of elements in the list,
11560 * where each coordinate in the range is prescribed by the
11561 * corresponding affine expression.
11562 * The domains of all affine expressions in the list are assumed to match
11563 * domain_dim.
11565 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
11566 __isl_take isl_space *domain_dim, __isl_take isl_aff_list *list)
11568 int i;
11569 isl_space *dim;
11570 isl_basic_map *bmap;
11572 if (!list)
11573 return NULL;
11575 dim = isl_space_from_domain(domain_dim);
11576 bmap = isl_basic_map_universe(dim);
11578 for (i = 0; i < list->n; ++i) {
11579 isl_aff *aff;
11580 isl_basic_map *bmap_i;
11582 aff = isl_aff_copy(list->p[i]);
11583 bmap_i = isl_basic_map_from_aff(aff);
11585 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
11588 isl_aff_list_free(list);
11589 return bmap;
11592 __isl_give isl_set *isl_set_equate(__isl_take isl_set *set,
11593 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
11595 return isl_map_equate(set, type1, pos1, type2, pos2);
11598 /* Construct a basic map where the given dimensions are equal to each other.
11600 static __isl_give isl_basic_map *equator(__isl_take isl_space *space,
11601 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
11603 isl_basic_map *bmap = NULL;
11604 int i;
11606 if (!space)
11607 return NULL;
11609 if (pos1 >= isl_space_dim(space, type1))
11610 isl_die(isl_space_get_ctx(space), isl_error_invalid,
11611 "index out of bounds", goto error);
11612 if (pos2 >= isl_space_dim(space, type2))
11613 isl_die(isl_space_get_ctx(space), isl_error_invalid,
11614 "index out of bounds", goto error);
11616 if (type1 == type2 && pos1 == pos2)
11617 return isl_basic_map_universe(space);
11619 bmap = isl_basic_map_alloc_space(isl_space_copy(space), 0, 1, 0);
11620 i = isl_basic_map_alloc_equality(bmap);
11621 if (i < 0)
11622 goto error;
11623 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
11624 pos1 += isl_basic_map_offset(bmap, type1);
11625 pos2 += isl_basic_map_offset(bmap, type2);
11626 isl_int_set_si(bmap->eq[i][pos1], -1);
11627 isl_int_set_si(bmap->eq[i][pos2], 1);
11628 bmap = isl_basic_map_finalize(bmap);
11629 isl_space_free(space);
11630 return bmap;
11631 error:
11632 isl_space_free(space);
11633 isl_basic_map_free(bmap);
11634 return NULL;
11637 /* Add a constraint imposing that the given two dimensions are equal.
11639 __isl_give isl_basic_map *isl_basic_map_equate(__isl_take isl_basic_map *bmap,
11640 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
11642 isl_basic_map *eq;
11644 eq = equator(isl_basic_map_get_space(bmap), type1, pos1, type2, pos2);
11646 bmap = isl_basic_map_intersect(bmap, eq);
11648 return bmap;
11651 /* Add a constraint imposing that the given two dimensions are equal.
11653 __isl_give isl_map *isl_map_equate(__isl_take isl_map *map,
11654 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
11656 isl_basic_map *bmap;
11658 bmap = equator(isl_map_get_space(map), type1, pos1, type2, pos2);
11660 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
11662 return map;
11665 /* Add a constraint imposing that the given two dimensions have opposite values.
11667 __isl_give isl_map *isl_map_oppose(__isl_take isl_map *map,
11668 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
11670 isl_basic_map *bmap = NULL;
11671 int i;
11673 if (!map)
11674 return NULL;
11676 if (pos1 >= isl_map_dim(map, type1))
11677 isl_die(map->ctx, isl_error_invalid,
11678 "index out of bounds", goto error);
11679 if (pos2 >= isl_map_dim(map, type2))
11680 isl_die(map->ctx, isl_error_invalid,
11681 "index out of bounds", goto error);
11683 bmap = isl_basic_map_alloc_space(isl_map_get_space(map), 0, 1, 0);
11684 i = isl_basic_map_alloc_equality(bmap);
11685 if (i < 0)
11686 goto error;
11687 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
11688 pos1 += isl_basic_map_offset(bmap, type1);
11689 pos2 += isl_basic_map_offset(bmap, type2);
11690 isl_int_set_si(bmap->eq[i][pos1], 1);
11691 isl_int_set_si(bmap->eq[i][pos2], 1);
11692 bmap = isl_basic_map_finalize(bmap);
11694 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
11696 return map;
11697 error:
11698 isl_basic_map_free(bmap);
11699 isl_map_free(map);
11700 return NULL;
11703 /* Construct a constraint imposing that the value of the first dimension is
11704 * greater than or equal to that of the second.
11706 static __isl_give isl_constraint *constraint_order_ge(
11707 __isl_take isl_space *space, enum isl_dim_type type1, int pos1,
11708 enum isl_dim_type type2, int pos2)
11710 isl_constraint *c;
11712 if (!space)
11713 return NULL;
11715 c = isl_constraint_alloc_inequality(isl_local_space_from_space(space));
11717 if (pos1 >= isl_constraint_dim(c, type1))
11718 isl_die(isl_constraint_get_ctx(c), isl_error_invalid,
11719 "index out of bounds", return isl_constraint_free(c));
11720 if (pos2 >= isl_constraint_dim(c, type2))
11721 isl_die(isl_constraint_get_ctx(c), isl_error_invalid,
11722 "index out of bounds", return isl_constraint_free(c));
11724 if (type1 == type2 && pos1 == pos2)
11725 return c;
11727 c = isl_constraint_set_coefficient_si(c, type1, pos1, 1);
11728 c = isl_constraint_set_coefficient_si(c, type2, pos2, -1);
11730 return c;
11733 /* Add a constraint imposing that the value of the first dimension is
11734 * greater than or equal to that of the second.
11736 __isl_give isl_basic_map *isl_basic_map_order_ge(__isl_take isl_basic_map *bmap,
11737 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
11739 isl_constraint *c;
11740 isl_space *space;
11742 if (type1 == type2 && pos1 == pos2)
11743 return bmap;
11744 space = isl_basic_map_get_space(bmap);
11745 c = constraint_order_ge(space, type1, pos1, type2, pos2);
11746 bmap = isl_basic_map_add_constraint(bmap, c);
11748 return bmap;
11751 /* Add a constraint imposing that the value of the first dimension is
11752 * greater than or equal to that of the second.
11754 __isl_give isl_map *isl_map_order_ge(__isl_take isl_map *map,
11755 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
11757 isl_constraint *c;
11758 isl_space *space;
11760 if (type1 == type2 && pos1 == pos2)
11761 return map;
11762 space = isl_map_get_space(map);
11763 c = constraint_order_ge(space, type1, pos1, type2, pos2);
11764 map = isl_map_add_constraint(map, c);
11766 return map;
11769 /* Add a constraint imposing that the value of the first dimension is
11770 * less than or equal to that of the second.
11772 __isl_give isl_map *isl_map_order_le(__isl_take isl_map *map,
11773 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
11775 return isl_map_order_ge(map, type2, pos2, type1, pos1);
11778 /* Construct a basic map where the value of the first dimension is
11779 * greater than that of the second.
11781 static __isl_give isl_basic_map *greator(__isl_take isl_space *space,
11782 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
11784 isl_basic_map *bmap = NULL;
11785 int i;
11787 if (!space)
11788 return NULL;
11790 if (pos1 >= isl_space_dim(space, type1))
11791 isl_die(isl_space_get_ctx(space), isl_error_invalid,
11792 "index out of bounds", goto error);
11793 if (pos2 >= isl_space_dim(space, type2))
11794 isl_die(isl_space_get_ctx(space), isl_error_invalid,
11795 "index out of bounds", goto error);
11797 if (type1 == type2 && pos1 == pos2)
11798 return isl_basic_map_empty(space);
11800 bmap = isl_basic_map_alloc_space(space, 0, 0, 1);
11801 i = isl_basic_map_alloc_inequality(bmap);
11802 if (i < 0)
11803 return isl_basic_map_free(bmap);
11804 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
11805 pos1 += isl_basic_map_offset(bmap, type1);
11806 pos2 += isl_basic_map_offset(bmap, type2);
11807 isl_int_set_si(bmap->ineq[i][pos1], 1);
11808 isl_int_set_si(bmap->ineq[i][pos2], -1);
11809 isl_int_set_si(bmap->ineq[i][0], -1);
11810 bmap = isl_basic_map_finalize(bmap);
11812 return bmap;
11813 error:
11814 isl_space_free(space);
11815 isl_basic_map_free(bmap);
11816 return NULL;
11819 /* Add a constraint imposing that the value of the first dimension is
11820 * greater than that of the second.
11822 __isl_give isl_basic_map *isl_basic_map_order_gt(__isl_take isl_basic_map *bmap,
11823 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
11825 isl_basic_map *gt;
11827 gt = greator(isl_basic_map_get_space(bmap), type1, pos1, type2, pos2);
11829 bmap = isl_basic_map_intersect(bmap, gt);
11831 return bmap;
11834 /* Add a constraint imposing that the value of the first dimension is
11835 * greater than that of the second.
11837 __isl_give isl_map *isl_map_order_gt(__isl_take isl_map *map,
11838 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
11840 isl_basic_map *bmap;
11842 bmap = greator(isl_map_get_space(map), type1, pos1, type2, pos2);
11844 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
11846 return map;
11849 /* Add a constraint imposing that the value of the first dimension is
11850 * smaller than that of the second.
11852 __isl_give isl_map *isl_map_order_lt(__isl_take isl_map *map,
11853 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
11855 return isl_map_order_gt(map, type2, pos2, type1, pos1);
11858 __isl_give isl_aff *isl_basic_map_get_div(__isl_keep isl_basic_map *bmap,
11859 int pos)
11861 isl_aff *div;
11862 isl_local_space *ls;
11864 if (!bmap)
11865 return NULL;
11867 if (!isl_basic_map_divs_known(bmap))
11868 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
11869 "some divs are unknown", return NULL);
11871 ls = isl_basic_map_get_local_space(bmap);
11872 div = isl_local_space_get_div(ls, pos);
11873 isl_local_space_free(ls);
11875 return div;
11878 __isl_give isl_aff *isl_basic_set_get_div(__isl_keep isl_basic_set *bset,
11879 int pos)
11881 return isl_basic_map_get_div(bset, pos);
11884 /* Plug in "subs" for dimension "type", "pos" of "bset".
11886 * Let i be the dimension to replace and let "subs" be of the form
11888 * f/d
11890 * Any integer division with a non-zero coefficient for i,
11892 * floor((a i + g)/m)
11894 * is replaced by
11896 * floor((a f + d g)/(m d))
11898 * Constraints of the form
11900 * a i + g
11902 * are replaced by
11904 * a f + d g
11906 * We currently require that "subs" is an integral expression.
11907 * Handling rational expressions may require us to add stride constraints
11908 * as we do in isl_basic_set_preimage_multi_aff.
11910 __isl_give isl_basic_set *isl_basic_set_substitute(
11911 __isl_take isl_basic_set *bset,
11912 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
11914 int i;
11915 isl_int v;
11916 isl_ctx *ctx;
11918 if (bset && isl_basic_set_plain_is_empty(bset))
11919 return bset;
11921 bset = isl_basic_set_cow(bset);
11922 if (!bset || !subs)
11923 goto error;
11925 ctx = isl_basic_set_get_ctx(bset);
11926 if (!isl_space_is_equal(bset->dim, subs->ls->dim))
11927 isl_die(ctx, isl_error_invalid,
11928 "spaces don't match", goto error);
11929 if (isl_local_space_dim(subs->ls, isl_dim_div) != 0)
11930 isl_die(ctx, isl_error_unsupported,
11931 "cannot handle divs yet", goto error);
11932 if (!isl_int_is_one(subs->v->el[0]))
11933 isl_die(ctx, isl_error_invalid,
11934 "can only substitute integer expressions", goto error);
11936 pos += isl_basic_set_offset(bset, type);
11938 isl_int_init(v);
11940 for (i = 0; i < bset->n_eq; ++i) {
11941 if (isl_int_is_zero(bset->eq[i][pos]))
11942 continue;
11943 isl_int_set(v, bset->eq[i][pos]);
11944 isl_int_set_si(bset->eq[i][pos], 0);
11945 isl_seq_combine(bset->eq[i], subs->v->el[0], bset->eq[i],
11946 v, subs->v->el + 1, subs->v->size - 1);
11949 for (i = 0; i < bset->n_ineq; ++i) {
11950 if (isl_int_is_zero(bset->ineq[i][pos]))
11951 continue;
11952 isl_int_set(v, bset->ineq[i][pos]);
11953 isl_int_set_si(bset->ineq[i][pos], 0);
11954 isl_seq_combine(bset->ineq[i], subs->v->el[0], bset->ineq[i],
11955 v, subs->v->el + 1, subs->v->size - 1);
11958 for (i = 0; i < bset->n_div; ++i) {
11959 if (isl_int_is_zero(bset->div[i][1 + pos]))
11960 continue;
11961 isl_int_set(v, bset->div[i][1 + pos]);
11962 isl_int_set_si(bset->div[i][1 + pos], 0);
11963 isl_seq_combine(bset->div[i] + 1,
11964 subs->v->el[0], bset->div[i] + 1,
11965 v, subs->v->el + 1, subs->v->size - 1);
11966 isl_int_mul(bset->div[i][0], bset->div[i][0], subs->v->el[0]);
11969 isl_int_clear(v);
11971 bset = isl_basic_set_simplify(bset);
11972 return isl_basic_set_finalize(bset);
11973 error:
11974 isl_basic_set_free(bset);
11975 return NULL;
11978 /* Plug in "subs" for dimension "type", "pos" of "set".
11980 __isl_give isl_set *isl_set_substitute(__isl_take isl_set *set,
11981 enum isl_dim_type type, unsigned pos, __isl_keep isl_aff *subs)
11983 int i;
11985 if (set && isl_set_plain_is_empty(set))
11986 return set;
11988 set = isl_set_cow(set);
11989 if (!set || !subs)
11990 goto error;
11992 for (i = set->n - 1; i >= 0; --i) {
11993 set->p[i] = isl_basic_set_substitute(set->p[i], type, pos, subs);
11994 if (remove_if_empty(set, i) < 0)
11995 goto error;
11998 return set;
11999 error:
12000 isl_set_free(set);
12001 return NULL;
12004 /* Check if the range of "ma" is compatible with the domain or range
12005 * (depending on "type") of "bmap".
12006 * Return -1 if anything is wrong.
12008 static int check_basic_map_compatible_range_multi_aff(
12009 __isl_keep isl_basic_map *bmap, enum isl_dim_type type,
12010 __isl_keep isl_multi_aff *ma)
12012 int m;
12013 isl_space *ma_space;
12015 ma_space = isl_multi_aff_get_space(ma);
12017 m = isl_space_match(bmap->dim, isl_dim_param, ma_space, isl_dim_param);
12018 if (m < 0)
12019 goto error;
12020 if (!m)
12021 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
12022 "parameters don't match", goto error);
12023 m = isl_space_tuple_is_equal(bmap->dim, type, ma_space, isl_dim_out);
12024 if (m < 0)
12025 goto error;
12026 if (!m)
12027 isl_die(isl_basic_map_get_ctx(bmap), isl_error_invalid,
12028 "spaces don't match", goto error);
12030 isl_space_free(ma_space);
12031 return m;
12032 error:
12033 isl_space_free(ma_space);
12034 return -1;
12037 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12038 * coefficients before the transformed range of dimensions,
12039 * the "n_after" coefficients after the transformed range of dimensions
12040 * and the coefficients of the other divs in "bmap".
12042 static int set_ma_divs(__isl_keep isl_basic_map *bmap,
12043 __isl_keep isl_multi_aff *ma, int n_before, int n_after, int n_div)
12045 int i;
12046 int n_param;
12047 int n_set;
12048 isl_local_space *ls;
12050 if (n_div == 0)
12051 return 0;
12053 ls = isl_aff_get_domain_local_space(ma->p[0]);
12054 if (!ls)
12055 return -1;
12057 n_param = isl_local_space_dim(ls, isl_dim_param);
12058 n_set = isl_local_space_dim(ls, isl_dim_set);
12059 for (i = 0; i < n_div; ++i) {
12060 int o_bmap = 0, o_ls = 0;
12062 isl_seq_cpy(bmap->div[i], ls->div->row[i], 1 + 1 + n_param);
12063 o_bmap += 1 + 1 + n_param;
12064 o_ls += 1 + 1 + n_param;
12065 isl_seq_clr(bmap->div[i] + o_bmap, n_before);
12066 o_bmap += n_before;
12067 isl_seq_cpy(bmap->div[i] + o_bmap,
12068 ls->div->row[i] + o_ls, n_set);
12069 o_bmap += n_set;
12070 o_ls += n_set;
12071 isl_seq_clr(bmap->div[i] + o_bmap, n_after);
12072 o_bmap += n_after;
12073 isl_seq_cpy(bmap->div[i] + o_bmap,
12074 ls->div->row[i] + o_ls, n_div);
12075 o_bmap += n_div;
12076 o_ls += n_div;
12077 isl_seq_clr(bmap->div[i] + o_bmap, bmap->n_div - n_div);
12078 if (isl_basic_set_add_div_constraints(bmap, i) < 0)
12079 goto error;
12082 isl_local_space_free(ls);
12083 return 0;
12084 error:
12085 isl_local_space_free(ls);
12086 return -1;
12089 /* How many stride constraints does "ma" enforce?
12090 * That is, how many of the affine expressions have a denominator
12091 * different from one?
12093 static int multi_aff_strides(__isl_keep isl_multi_aff *ma)
12095 int i;
12096 int strides = 0;
12098 for (i = 0; i < ma->n; ++i)
12099 if (!isl_int_is_one(ma->p[i]->v->el[0]))
12100 strides++;
12102 return strides;
12105 /* For each affine expression in ma of the form
12107 * x_i = (f_i y + h_i)/m_i
12109 * with m_i different from one, add a constraint to "bmap"
12110 * of the form
12112 * f_i y + h_i = m_i alpha_i
12114 * with alpha_i an additional existentially quantified variable.
12116 static __isl_give isl_basic_map *add_ma_strides(
12117 __isl_take isl_basic_map *bmap, __isl_keep isl_multi_aff *ma,
12118 int n_before, int n_after)
12120 int i, k;
12121 int div;
12122 int total;
12123 int n_param;
12124 int n_in;
12125 int n_div;
12127 total = isl_basic_map_total_dim(bmap);
12128 n_param = isl_multi_aff_dim(ma, isl_dim_param);
12129 n_in = isl_multi_aff_dim(ma, isl_dim_in);
12130 n_div = isl_multi_aff_dim(ma, isl_dim_div);
12131 for (i = 0; i < ma->n; ++i) {
12132 int o_bmap = 0, o_ma = 1;
12134 if (isl_int_is_one(ma->p[i]->v->el[0]))
12135 continue;
12136 div = isl_basic_map_alloc_div(bmap);
12137 k = isl_basic_map_alloc_equality(bmap);
12138 if (div < 0 || k < 0)
12139 goto error;
12140 isl_int_set_si(bmap->div[div][0], 0);
12141 isl_seq_cpy(bmap->eq[k] + o_bmap,
12142 ma->p[i]->v->el + o_ma, 1 + n_param);
12143 o_bmap += 1 + n_param;
12144 o_ma += 1 + n_param;
12145 isl_seq_clr(bmap->eq[k] + o_bmap, n_before);
12146 o_bmap += n_before;
12147 isl_seq_cpy(bmap->eq[k] + o_bmap,
12148 ma->p[i]->v->el + o_ma, n_in);
12149 o_bmap += n_in;
12150 o_ma += n_in;
12151 isl_seq_clr(bmap->eq[k] + o_bmap, n_after);
12152 o_bmap += n_after;
12153 isl_seq_cpy(bmap->eq[k] + o_bmap,
12154 ma->p[i]->v->el + o_ma, n_div);
12155 o_bmap += n_div;
12156 o_ma += n_div;
12157 isl_seq_clr(bmap->eq[k] + o_bmap, 1 + total - o_bmap);
12158 isl_int_neg(bmap->eq[k][1 + total], ma->p[i]->v->el[0]);
12159 total++;
12162 return bmap;
12163 error:
12164 isl_basic_map_free(bmap);
12165 return NULL;
12168 /* Replace the domain or range space (depending on "type) of "space" by "set".
12170 static __isl_give isl_space *isl_space_set(__isl_take isl_space *space,
12171 enum isl_dim_type type, __isl_take isl_space *set)
12173 if (type == isl_dim_in) {
12174 space = isl_space_range(space);
12175 space = isl_space_map_from_domain_and_range(set, space);
12176 } else {
12177 space = isl_space_domain(space);
12178 space = isl_space_map_from_domain_and_range(space, set);
12181 return space;
12184 /* Compute the preimage of the domain or range (depending on "type")
12185 * of "bmap" under the function represented by "ma".
12186 * In other words, plug in "ma" in the domain or range of "bmap".
12187 * The result is a basic map that lives in the same space as "bmap"
12188 * except that the domain or range has been replaced by
12189 * the domain space of "ma".
12191 * If bmap is represented by
12193 * A(p) + S u + B x + T v + C(divs) >= 0,
12195 * where u and x are input and output dimensions if type == isl_dim_out
12196 * while x and v are input and output dimensions if type == isl_dim_in,
12197 * and ma is represented by
12199 * x = D(p) + F(y) + G(divs')
12201 * then the result is
12203 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12205 * The divs in the input set are similarly adjusted.
12206 * In particular
12208 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12210 * becomes
12212 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12213 * B_i G(divs') + c_i(divs))/n_i)
12215 * If bmap is not a rational map and if F(y) involves any denominators
12217 * x_i = (f_i y + h_i)/m_i
12219 * then additional constraints are added to ensure that we only
12220 * map back integer points. That is we enforce
12222 * f_i y + h_i = m_i alpha_i
12224 * with alpha_i an additional existentially quantified variable.
12226 * We first copy over the divs from "ma".
12227 * Then we add the modified constraints and divs from "bmap".
12228 * Finally, we add the stride constraints, if needed.
12230 __isl_give isl_basic_map *isl_basic_map_preimage_multi_aff(
12231 __isl_take isl_basic_map *bmap, enum isl_dim_type type,
12232 __isl_take isl_multi_aff *ma)
12234 int i, k;
12235 isl_space *space;
12236 isl_basic_map *res = NULL;
12237 int n_before, n_after, n_div_bmap, n_div_ma;
12238 isl_int f, c1, c2, g;
12239 int rational, strides;
12241 isl_int_init(f);
12242 isl_int_init(c1);
12243 isl_int_init(c2);
12244 isl_int_init(g);
12246 ma = isl_multi_aff_align_divs(ma);
12247 if (!bmap || !ma)
12248 goto error;
12249 if (check_basic_map_compatible_range_multi_aff(bmap, type, ma) < 0)
12250 goto error;
12252 if (type == isl_dim_in) {
12253 n_before = 0;
12254 n_after = isl_basic_map_dim(bmap, isl_dim_out);
12255 } else {
12256 n_before = isl_basic_map_dim(bmap, isl_dim_in);
12257 n_after = 0;
12259 n_div_bmap = isl_basic_map_dim(bmap, isl_dim_div);
12260 n_div_ma = ma->n ? isl_aff_dim(ma->p[0], isl_dim_div) : 0;
12262 space = isl_multi_aff_get_domain_space(ma);
12263 space = isl_space_set(isl_basic_map_get_space(bmap), type, space);
12264 rational = isl_basic_map_is_rational(bmap);
12265 strides = rational ? 0 : multi_aff_strides(ma);
12266 res = isl_basic_map_alloc_space(space, n_div_ma + n_div_bmap + strides,
12267 bmap->n_eq + strides, bmap->n_ineq + 2 * n_div_ma);
12268 if (rational)
12269 res = isl_basic_map_set_rational(res);
12271 for (i = 0; i < n_div_ma + n_div_bmap; ++i)
12272 if (isl_basic_map_alloc_div(res) < 0)
12273 goto error;
12275 if (set_ma_divs(res, ma, n_before, n_after, n_div_ma) < 0)
12276 goto error;
12278 for (i = 0; i < bmap->n_eq; ++i) {
12279 k = isl_basic_map_alloc_equality(res);
12280 if (k < 0)
12281 goto error;
12282 isl_seq_preimage(res->eq[k], bmap->eq[i], ma, n_before,
12283 n_after, n_div_ma, n_div_bmap, f, c1, c2, g, 0);
12286 for (i = 0; i < bmap->n_ineq; ++i) {
12287 k = isl_basic_map_alloc_inequality(res);
12288 if (k < 0)
12289 goto error;
12290 isl_seq_preimage(res->ineq[k], bmap->ineq[i], ma, n_before,
12291 n_after, n_div_ma, n_div_bmap, f, c1, c2, g, 0);
12294 for (i = 0; i < bmap->n_div; ++i) {
12295 if (isl_int_is_zero(bmap->div[i][0])) {
12296 isl_int_set_si(res->div[n_div_ma + i][0], 0);
12297 continue;
12299 isl_seq_preimage(res->div[n_div_ma + i], bmap->div[i], ma,
12300 n_before, n_after, n_div_ma, n_div_bmap,
12301 f, c1, c2, g, 1);
12304 if (strides)
12305 res = add_ma_strides(res, ma, n_before, n_after);
12307 isl_int_clear(f);
12308 isl_int_clear(c1);
12309 isl_int_clear(c2);
12310 isl_int_clear(g);
12311 isl_basic_map_free(bmap);
12312 isl_multi_aff_free(ma);
12313 res = isl_basic_set_simplify(res);
12314 return isl_basic_map_finalize(res);
12315 error:
12316 isl_int_clear(f);
12317 isl_int_clear(c1);
12318 isl_int_clear(c2);
12319 isl_int_clear(g);
12320 isl_basic_map_free(bmap);
12321 isl_multi_aff_free(ma);
12322 isl_basic_map_free(res);
12323 return NULL;
12326 /* Compute the preimage of "bset" under the function represented by "ma".
12327 * In other words, plug in "ma" in "bset". The result is a basic set
12328 * that lives in the domain space of "ma".
12330 __isl_give isl_basic_set *isl_basic_set_preimage_multi_aff(
12331 __isl_take isl_basic_set *bset, __isl_take isl_multi_aff *ma)
12333 return isl_basic_map_preimage_multi_aff(bset, isl_dim_set, ma);
12336 /* Compute the preimage of the domain of "bmap" under the function
12337 * represented by "ma".
12338 * In other words, plug in "ma" in the domain of "bmap".
12339 * The result is a basic map that lives in the same space as "bmap"
12340 * except that the domain has been replaced by the domain space of "ma".
12342 __isl_give isl_basic_map *isl_basic_map_preimage_domain_multi_aff(
12343 __isl_take isl_basic_map *bmap, __isl_take isl_multi_aff *ma)
12345 return isl_basic_map_preimage_multi_aff(bmap, isl_dim_in, ma);
12348 /* Compute the preimage of the range of "bmap" under the function
12349 * represented by "ma".
12350 * In other words, plug in "ma" in the range of "bmap".
12351 * The result is a basic map that lives in the same space as "bmap"
12352 * except that the range has been replaced by the domain space of "ma".
12354 __isl_give isl_basic_map *isl_basic_map_preimage_range_multi_aff(
12355 __isl_take isl_basic_map *bmap, __isl_take isl_multi_aff *ma)
12357 return isl_basic_map_preimage_multi_aff(bmap, isl_dim_out, ma);
12360 /* Check if the range of "ma" is compatible with the domain or range
12361 * (depending on "type") of "map".
12362 * Return -1 if anything is wrong.
12364 static int check_map_compatible_range_multi_aff(
12365 __isl_keep isl_map *map, enum isl_dim_type type,
12366 __isl_keep isl_multi_aff *ma)
12368 int m;
12369 isl_space *ma_space;
12371 ma_space = isl_multi_aff_get_space(ma);
12372 m = isl_space_tuple_is_equal(map->dim, type, ma_space, isl_dim_out);
12373 isl_space_free(ma_space);
12374 if (m >= 0 && !m)
12375 isl_die(isl_map_get_ctx(map), isl_error_invalid,
12376 "spaces don't match", return -1);
12377 return m;
12380 /* Compute the preimage of the domain or range (depending on "type")
12381 * of "map" under the function represented by "ma".
12382 * In other words, plug in "ma" in the domain or range of "map".
12383 * The result is a map that lives in the same space as "map"
12384 * except that the domain or range has been replaced by
12385 * the domain space of "ma".
12387 * The parameters are assumed to have been aligned.
12389 static __isl_give isl_map *map_preimage_multi_aff(__isl_take isl_map *map,
12390 enum isl_dim_type type, __isl_take isl_multi_aff *ma)
12392 int i;
12393 isl_space *space;
12395 map = isl_map_cow(map);
12396 ma = isl_multi_aff_align_divs(ma);
12397 if (!map || !ma)
12398 goto error;
12399 if (check_map_compatible_range_multi_aff(map, type, ma) < 0)
12400 goto error;
12402 for (i = 0; i < map->n; ++i) {
12403 map->p[i] = isl_basic_map_preimage_multi_aff(map->p[i], type,
12404 isl_multi_aff_copy(ma));
12405 if (!map->p[i])
12406 goto error;
12409 space = isl_multi_aff_get_domain_space(ma);
12410 space = isl_space_set(isl_map_get_space(map), type, space);
12412 isl_space_free(map->dim);
12413 map->dim = space;
12414 if (!map->dim)
12415 goto error;
12417 isl_multi_aff_free(ma);
12418 if (map->n > 1)
12419 ISL_F_CLR(map, ISL_MAP_DISJOINT);
12420 ISL_F_CLR(map, ISL_SET_NORMALIZED);
12421 return map;
12422 error:
12423 isl_multi_aff_free(ma);
12424 isl_map_free(map);
12425 return NULL;
12428 /* Compute the preimage of the domain or range (depending on "type")
12429 * of "map" under the function represented by "ma".
12430 * In other words, plug in "ma" in the domain or range of "map".
12431 * The result is a map that lives in the same space as "map"
12432 * except that the domain or range has been replaced by
12433 * the domain space of "ma".
12435 __isl_give isl_map *isl_map_preimage_multi_aff(__isl_take isl_map *map,
12436 enum isl_dim_type type, __isl_take isl_multi_aff *ma)
12438 if (!map || !ma)
12439 goto error;
12441 if (isl_space_match(map->dim, isl_dim_param, ma->space, isl_dim_param))
12442 return map_preimage_multi_aff(map, type, ma);
12444 if (!isl_space_has_named_params(map->dim) ||
12445 !isl_space_has_named_params(ma->space))
12446 isl_die(map->ctx, isl_error_invalid,
12447 "unaligned unnamed parameters", goto error);
12448 map = isl_map_align_params(map, isl_multi_aff_get_space(ma));
12449 ma = isl_multi_aff_align_params(ma, isl_map_get_space(map));
12451 return map_preimage_multi_aff(map, type, ma);
12452 error:
12453 isl_multi_aff_free(ma);
12454 return isl_map_free(map);
12457 /* Compute the preimage of "set" under the function represented by "ma".
12458 * In other words, plug in "ma" in "set". The result is a set
12459 * that lives in the domain space of "ma".
12461 __isl_give isl_set *isl_set_preimage_multi_aff(__isl_take isl_set *set,
12462 __isl_take isl_multi_aff *ma)
12464 return isl_map_preimage_multi_aff(set, isl_dim_set, ma);
12467 /* Compute the preimage of the domain of "map" under the function
12468 * represented by "ma".
12469 * In other words, plug in "ma" in the domain of "map".
12470 * The result is a map that lives in the same space as "map"
12471 * except that the domain has been replaced by the domain space of "ma".
12473 __isl_give isl_map *isl_map_preimage_domain_multi_aff(__isl_take isl_map *map,
12474 __isl_take isl_multi_aff *ma)
12476 return isl_map_preimage_multi_aff(map, isl_dim_in, ma);
12479 /* Compute the preimage of the range of "map" under the function
12480 * represented by "ma".
12481 * In other words, plug in "ma" in the range of "map".
12482 * The result is a map that lives in the same space as "map"
12483 * except that the range has been replaced by the domain space of "ma".
12485 __isl_give isl_map *isl_map_preimage_range_multi_aff(__isl_take isl_map *map,
12486 __isl_take isl_multi_aff *ma)
12488 return isl_map_preimage_multi_aff(map, isl_dim_out, ma);
12491 /* Compute the preimage of "map" under the function represented by "pma".
12492 * In other words, plug in "pma" in the domain or range of "map".
12493 * The result is a map that lives in the same space as "map",
12494 * except that the space of type "type" has been replaced by
12495 * the domain space of "pma".
12497 * The parameters of "map" and "pma" are assumed to have been aligned.
12499 static __isl_give isl_map *isl_map_preimage_pw_multi_aff_aligned(
12500 __isl_take isl_map *map, enum isl_dim_type type,
12501 __isl_take isl_pw_multi_aff *pma)
12503 int i;
12504 isl_map *res;
12506 if (!pma)
12507 goto error;
12509 if (pma->n == 0) {
12510 isl_pw_multi_aff_free(pma);
12511 res = isl_map_empty(isl_map_get_space(map));
12512 isl_map_free(map);
12513 return res;
12516 res = isl_map_preimage_multi_aff(isl_map_copy(map), type,
12517 isl_multi_aff_copy(pma->p[0].maff));
12518 if (type == isl_dim_in)
12519 res = isl_map_intersect_domain(res,
12520 isl_map_copy(pma->p[0].set));
12521 else
12522 res = isl_map_intersect_range(res,
12523 isl_map_copy(pma->p[0].set));
12525 for (i = 1; i < pma->n; ++i) {
12526 isl_map *res_i;
12528 res_i = isl_map_preimage_multi_aff(isl_map_copy(map), type,
12529 isl_multi_aff_copy(pma->p[i].maff));
12530 if (type == isl_dim_in)
12531 res_i = isl_map_intersect_domain(res_i,
12532 isl_map_copy(pma->p[i].set));
12533 else
12534 res_i = isl_map_intersect_range(res_i,
12535 isl_map_copy(pma->p[i].set));
12536 res = isl_map_union(res, res_i);
12539 isl_pw_multi_aff_free(pma);
12540 isl_map_free(map);
12541 return res;
12542 error:
12543 isl_pw_multi_aff_free(pma);
12544 isl_map_free(map);
12545 return NULL;
12548 /* Compute the preimage of "map" under the function represented by "pma".
12549 * In other words, plug in "pma" in the domain or range of "map".
12550 * The result is a map that lives in the same space as "map",
12551 * except that the space of type "type" has been replaced by
12552 * the domain space of "pma".
12554 __isl_give isl_map *isl_map_preimage_pw_multi_aff(__isl_take isl_map *map,
12555 enum isl_dim_type type, __isl_take isl_pw_multi_aff *pma)
12557 if (!map || !pma)
12558 goto error;
12560 if (isl_space_match(map->dim, isl_dim_param, pma->dim, isl_dim_param))
12561 return isl_map_preimage_pw_multi_aff_aligned(map, type, pma);
12563 if (!isl_space_has_named_params(map->dim) ||
12564 !isl_space_has_named_params(pma->dim))
12565 isl_die(map->ctx, isl_error_invalid,
12566 "unaligned unnamed parameters", goto error);
12567 map = isl_map_align_params(map, isl_pw_multi_aff_get_space(pma));
12568 pma = isl_pw_multi_aff_align_params(pma, isl_map_get_space(map));
12570 return isl_map_preimage_pw_multi_aff_aligned(map, type, pma);
12571 error:
12572 isl_pw_multi_aff_free(pma);
12573 return isl_map_free(map);
12576 /* Compute the preimage of "set" under the function represented by "pma".
12577 * In other words, plug in "pma" in "set". The result is a set
12578 * that lives in the domain space of "pma".
12580 __isl_give isl_set *isl_set_preimage_pw_multi_aff(__isl_take isl_set *set,
12581 __isl_take isl_pw_multi_aff *pma)
12583 return isl_map_preimage_pw_multi_aff(set, isl_dim_set, pma);
12586 /* Compute the preimage of the domain of "map" under the function
12587 * represented by "pma".
12588 * In other words, plug in "pma" in the domain of "map".
12589 * The result is a map that lives in the same space as "map",
12590 * except that domain space has been replaced by the domain space of "pma".
12592 __isl_give isl_map *isl_map_preimage_domain_pw_multi_aff(
12593 __isl_take isl_map *map, __isl_take isl_pw_multi_aff *pma)
12595 return isl_map_preimage_pw_multi_aff(map, isl_dim_in, pma);
12598 /* Compute the preimage of the range of "map" under the function
12599 * represented by "pma".
12600 * In other words, plug in "pma" in the range of "map".
12601 * The result is a map that lives in the same space as "map",
12602 * except that range space has been replaced by the domain space of "pma".
12604 __isl_give isl_map *isl_map_preimage_range_pw_multi_aff(
12605 __isl_take isl_map *map, __isl_take isl_pw_multi_aff *pma)
12607 return isl_map_preimage_pw_multi_aff(map, isl_dim_out, pma);
12610 /* Compute the preimage of "map" under the function represented by "mpa".
12611 * In other words, plug in "mpa" in the domain or range of "map".
12612 * The result is a map that lives in the same space as "map",
12613 * except that the space of type "type" has been replaced by
12614 * the domain space of "mpa".
12616 * If the map does not involve any constraints that refer to the
12617 * dimensions of the substituted space, then the only possible
12618 * effect of "mpa" on the map is to map the space to a different space.
12619 * We create a separate isl_multi_aff to effectuate this change
12620 * in order to avoid spurious splitting of the map along the pieces
12621 * of "mpa".
12623 __isl_give isl_map *isl_map_preimage_multi_pw_aff(__isl_take isl_map *map,
12624 enum isl_dim_type type, __isl_take isl_multi_pw_aff *mpa)
12626 int n;
12627 isl_pw_multi_aff *pma;
12629 if (!map || !mpa)
12630 goto error;
12632 n = isl_map_dim(map, type);
12633 if (!isl_map_involves_dims(map, type, 0, n)) {
12634 isl_space *space;
12635 isl_multi_aff *ma;
12637 space = isl_multi_pw_aff_get_space(mpa);
12638 isl_multi_pw_aff_free(mpa);
12639 ma = isl_multi_aff_zero(space);
12640 return isl_map_preimage_multi_aff(map, type, ma);
12643 pma = isl_pw_multi_aff_from_multi_pw_aff(mpa);
12644 return isl_map_preimage_pw_multi_aff(map, type, pma);
12645 error:
12646 isl_map_free(map);
12647 isl_multi_pw_aff_free(mpa);
12648 return NULL;
12651 /* Compute the preimage of "map" under the function represented by "mpa".
12652 * In other words, plug in "mpa" in the domain "map".
12653 * The result is a map that lives in the same space as "map",
12654 * except that domain space has been replaced by the domain space of "mpa".
12656 __isl_give isl_map *isl_map_preimage_domain_multi_pw_aff(
12657 __isl_take isl_map *map, __isl_take isl_multi_pw_aff *mpa)
12659 return isl_map_preimage_multi_pw_aff(map, isl_dim_in, mpa);
12662 /* Compute the preimage of "set" by the function represented by "mpa".
12663 * In other words, plug in "mpa" in "set".
12665 __isl_give isl_set *isl_set_preimage_multi_pw_aff(__isl_take isl_set *set,
12666 __isl_take isl_multi_pw_aff *mpa)
12668 return isl_map_preimage_multi_pw_aff(set, isl_dim_set, mpa);