*/
#include <string.h>
-#include <strings.h>
-#include "isl_ctx.h"
-#include "isl_blk.h"
+#include <isl_ctx_private.h>
+#include <isl_map_private.h>
+#include <isl/blk.h>
#include "isl_dim_private.h"
#include "isl_equalities.h"
-#include "isl_list.h"
-#include "isl_lp.h"
-#include "isl_seq.h"
-#include "isl_set.h"
-#include "isl_map.h"
-#include "isl_map_private.h"
+#include <isl_list_private.h>
+#include <isl/lp.h>
+#include <isl/seq.h>
+#include <isl/set.h>
+#include <isl/map.h>
#include "isl_map_piplib.h"
#include <isl_reordering.h>
#include "isl_sample.h"
#include "isl_tab.h"
-#include "isl_vec.h"
+#include <isl/vec.h>
#include <isl_mat_private.h>
-
-/* Maps dst positions to src positions */
-struct isl_dim_map {
- unsigned len;
- int pos[1];
-};
-
-static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
-{
- int i;
- struct isl_dim_map *dim_map;
- dim_map = isl_alloc(ctx, struct isl_dim_map,
- sizeof(struct isl_dim_map) + len * sizeof(int));
- if (!dim_map)
- return NULL;
- dim_map->len = 1 + len;
- dim_map->pos[0] = 0;
- for (i = 0; i < len; ++i)
- dim_map->pos[1 + i] = -1;
- return dim_map;
-}
+#include <isl_dim_map.h>
+#include <isl_local_space_private.h>
+#include <isl_aff_private.h>
static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
{
}
}
-static void isl_dim_map_dim_range(struct isl_dim_map *dim_map,
- struct isl_dim *dim, enum isl_dim_type type,
- unsigned first, unsigned n, unsigned dst_pos)
-{
- int i;
- unsigned src_pos;
-
- if (!dim_map || !dim)
- return;
-
- src_pos = pos(dim, type);
- for (i = 0; i < n; ++i)
- dim_map->pos[1 + dst_pos + i] = src_pos + first + i;
-}
-
-static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
- enum isl_dim_type type, unsigned dst_pos)
-{
- isl_dim_map_dim_range(dim_map, dim, type, 0, n(dim, type), dst_pos);
-}
-
-static void isl_dim_map_div(struct isl_dim_map *dim_map,
- struct isl_basic_map *bmap, unsigned dst_pos)
-{
- int i;
- unsigned src_pos;
-
- if (!dim_map || !bmap)
- return;
-
- src_pos = 1 + isl_dim_total(bmap->dim);
- for (i = 0; i < bmap->n_div; ++i)
- dim_map->pos[1 + dst_pos + i] = src_pos + i;
-}
-
-static void isl_dim_map_dump(struct isl_dim_map *dim_map)
-{
- int i;
-
- for (i = 0; i < dim_map->len; ++i)
- fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
- fprintf(stderr, "\n");
-}
-
unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
enum isl_dim_type type)
{
}
}
+unsigned isl_basic_set_offset(struct isl_basic_set *bset,
+ enum isl_dim_type type)
+{
+ return isl_basic_map_offset(bset, type);
+}
+
static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
{
return pos(map->dim, type);
unsigned isl_map_n_in(const struct isl_map *map)
{
- return map->dim->n_in;
+ return map ? map->dim->n_in : 0;
}
unsigned isl_map_n_out(const struct isl_map *map)
{
- return map->dim->n_out;
+ return map ? map->dim->n_out : 0;
}
unsigned isl_map_n_param(const struct isl_map *map)
{
- return map->dim->nparam;
+ return map ? map->dim->nparam : 0;
}
int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
return isl_dim_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
}
+int isl_map_compatible_range(__isl_keep isl_map *map, __isl_keep isl_set *set)
+{
+ int m;
+ if (!map || !set)
+ return -1;
+ m = isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
+ if (m < 0 || !m)
+ return m;
+ return isl_dim_tuple_match(map->dim, isl_dim_out, set->dim, isl_dim_set);
+}
+
int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
struct isl_basic_set *bset)
{
return isl_dim_copy(bset->dim);
}
+__isl_give isl_local_space *isl_basic_map_get_local_space(
+ __isl_keep isl_basic_map *bmap)
+{
+ int i;
+ isl_local_space *ls;
+ unsigned total;
+
+ if (!bmap)
+ return NULL;
+
+ total = isl_basic_map_total_dim(bmap);
+ ls = isl_local_space_alloc(isl_dim_copy(bmap->dim), bmap->n_div);
+ if (!ls)
+ return NULL;
+
+ for (i = 0; i < bmap->n_div; ++i)
+ isl_seq_cpy(ls->div->row[i], bmap->div[i], 2 + total);
+
+ return ls;
+}
+
+__isl_give isl_local_space *isl_basic_set_get_local_space(
+ __isl_keep isl_basic_set *bset)
+{
+ return isl_basic_map_get_local_space(bset);
+}
+
+__isl_give isl_basic_map *isl_basic_map_from_local_space(
+ __isl_take isl_local_space *ls)
+{
+ int i;
+ int n_div;
+ isl_basic_map *bmap;
+
+ if (!ls)
+ return NULL;
+
+ n_div = isl_local_space_dim(ls, isl_dim_div);
+ bmap = isl_basic_map_alloc_dim(isl_local_space_get_dim(ls),
+ n_div, 0, 2 * n_div);
+
+ for (i = 0; i < n_div; ++i)
+ if (isl_basic_map_alloc_div(bmap) < 0)
+ goto error;
+
+ for (i = 0; i < n_div; ++i) {
+ isl_seq_cpy(bmap->div[i], ls->div->row[i], ls->div->n_col);
+ if (isl_basic_map_add_div_constraints(bmap, i) < 0)
+ goto error;
+ }
+
+ isl_local_space_free(ls);
+ return bmap;
+error:
+ isl_local_space_free(ls);
+ isl_basic_map_free(bmap);
+ return NULL;
+}
+
+__isl_give isl_basic_set *isl_basic_set_from_local_space(
+ __isl_take isl_local_space *ls)
+{
+ return isl_basic_map_from_local_space(ls);
+}
+
struct isl_dim *isl_map_get_dim(struct isl_map *map)
{
if (!map)
bmap->dim = isl_dim_set_tuple_name(bmap->dim, type, s);
if (!bmap->dim)
goto error;
+ bmap = isl_basic_map_finalize(bmap);
return bmap;
error:
isl_basic_map_free(bmap);
return NULL;
}
+__isl_give isl_basic_set *isl_basic_set_set_tuple_name(
+ __isl_take isl_basic_set *bset, const char *s)
+{
+ return isl_basic_map_set_tuple_name(bset, isl_dim_set, s);
+}
+
const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
enum isl_dim_type type)
{
return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
}
+const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
+{
+ return bset ? isl_dim_get_tuple_name(bset->dim, isl_dim_set) : NULL;
+}
+
const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
{
return set ? isl_dim_get_tuple_name(set->dim, isl_dim_set) : NULL;
return bmap ? isl_dim_get_name(bmap->dim, type, pos) : NULL;
}
+const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
+ enum isl_dim_type type, unsigned pos)
+{
+ return bset ? isl_dim_get_name(bset->dim, type, pos) : NULL;
+}
+
const char *isl_map_get_dim_name(__isl_keep isl_map *map,
enum isl_dim_type type, unsigned pos)
{
return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
}
+int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
+{
+ return isl_basic_map_is_rational(bset);
+}
+
static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
struct isl_basic_map *bmap, unsigned extra,
unsigned n_eq, unsigned n_ineq)
struct isl_basic_map *bmap;
if (!dim)
return NULL;
- isl_assert(dim->ctx, dim->n_in == 0, return NULL);
+ isl_assert(dim->ctx, dim->n_in == 0, goto error);
bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
return (struct isl_basic_set *)bmap;
+error:
+ isl_dim_free(dim);
+ return NULL;
}
struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
return NULL;
}
-static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
- struct isl_dim_map *dim_map)
-{
- int i;
-
- for (i = 0; i < dim_map->len; ++i) {
- if (dim_map->pos[i] < 0)
- isl_int_set_si(dst[i], 0);
- else
- isl_int_set(dst[i], src[dim_map->pos[i]]);
- }
-}
-
-static void copy_div_dim_map(isl_int *dst, isl_int *src,
- struct isl_dim_map *dim_map)
-{
- isl_int_set(dst[0], src[0]);
- copy_constraint_dim_map(dst+1, src+1, dim_map);
-}
-
-static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
- struct isl_basic_map *src, struct isl_dim_map *dim_map)
-{
- int i;
-
- if (!src || !dst || !dim_map)
- goto error;
-
- for (i = 0; i < src->n_eq; ++i) {
- int i1 = isl_basic_map_alloc_equality(dst);
- if (i1 < 0)
- goto error;
- copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
- }
-
- for (i = 0; i < src->n_ineq; ++i) {
- int i1 = isl_basic_map_alloc_inequality(dst);
- if (i1 < 0)
- goto error;
- copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
- }
-
- for (i = 0; i < src->n_div; ++i) {
- int i1 = isl_basic_map_alloc_div(dst);
- if (i1 < 0)
- goto error;
- copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
- }
-
- free(dim_map);
- isl_basic_map_free(src);
-
- return dst;
-error:
- free(dim_map);
- isl_basic_map_free(src);
- isl_basic_map_free(dst);
- return NULL;
-}
-
struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
struct isl_basic_set *bset2, unsigned pos)
{
isl_seq_cpy(a, blk.data, b_len+a_len);
}
-struct isl_basic_set *isl_basic_set_swap_vars(
- struct isl_basic_set *bset, unsigned n)
+static __isl_give isl_basic_map *isl_basic_map_swap_vars(
+ __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
{
int i;
struct isl_blk blk;
- unsigned dim;
- unsigned nparam;
- if (!bset)
+ if (!bmap)
goto error;
- nparam = isl_basic_set_n_param(bset);
- dim = isl_basic_set_n_dim(bset);
- isl_assert(bset->ctx, n <= dim, goto error);
+ isl_assert(bmap->ctx,
+ pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
- if (n == dim)
- return bset;
+ if (n1 == 0 || n2 == 0)
+ return bmap;
- bset = isl_basic_set_cow(bset);
- if (!bset)
+ bmap = isl_basic_map_cow(bmap);
+ if (!bmap)
return NULL;
- blk = isl_blk_alloc(bset->ctx, dim);
+ blk = isl_blk_alloc(bmap->ctx, n1 + n2);
if (isl_blk_is_error(blk))
goto error;
- for (i = 0; i < bset->n_eq; ++i)
+ for (i = 0; i < bmap->n_eq; ++i)
swap_vars(blk,
- bset->eq[i]+1+nparam, n, dim - n);
+ bmap->eq[i] + pos, n1, n2);
- for (i = 0; i < bset->n_ineq; ++i)
+ for (i = 0; i < bmap->n_ineq; ++i)
swap_vars(blk,
- bset->ineq[i]+1+nparam, n, dim - n);
+ bmap->ineq[i] + pos, n1, n2);
- for (i = 0; i < bset->n_div; ++i)
+ for (i = 0; i < bmap->n_div; ++i)
swap_vars(blk,
- bset->div[i]+1+1+nparam, n, dim - n);
+ bmap->div[i]+1 + pos, n1, n2);
- isl_blk_free(bset->ctx, blk);
+ isl_blk_free(bmap->ctx, blk);
- ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
- bset = isl_basic_set_gauss(bset, NULL);
- return isl_basic_set_finalize(bset);
+ ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
+ bmap = isl_basic_map_gauss(bmap, NULL);
+ return isl_basic_map_finalize(bmap);
error:
- isl_basic_set_free(bset);
+ isl_basic_map_free(bmap);
return NULL;
}
-struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
+static __isl_give isl_basic_set *isl_basic_set_swap_vars(
+ __isl_take isl_basic_set *bset, unsigned n)
{
- int i;
- set = isl_set_cow(set);
- if (!set)
- return NULL;
+ unsigned dim;
+ unsigned nparam;
- for (i = 0; i < set->n; ++i) {
- set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
- if (!set->p[i]) {
- isl_set_free(set);
- return NULL;
- }
- }
- ISL_F_CLR(set, ISL_SET_NORMALIZED);
- return set;
+ nparam = isl_basic_set_n_param(bset);
+ dim = isl_basic_set_n_dim(bset);
+ isl_assert(bset->ctx, n <= dim, goto error);
+
+ return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
+error:
+ isl_basic_set_free(bset);
+ return NULL;
}
struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
return isl_set_eliminate(set, isl_dim_set, first, n);
}
-/* Project out n dimensions starting at first using Fourier-Motzkin */
-struct isl_set *isl_set_remove_dims(struct isl_set *set,
- unsigned first, unsigned n)
-{
- set = isl_set_eliminate_dims(set, first, n);
- set = isl_set_drop_dims(set, first, n);
- return set;
-}
-
__isl_give isl_basic_map *isl_basic_map_remove_divs(
__isl_take isl_basic_map *bmap)
{
+ if (!bmap)
+ return NULL;
bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
bmap->n_div);
if (!bmap)
return NULL;
bmap->n_div = 0;
- return bmap;
+ return isl_basic_map_finalize(bmap);
}
__isl_give isl_basic_set *isl_basic_set_remove_divs(
(struct isl_basic_map *)bset);
}
-struct isl_set *isl_set_remove_divs(struct isl_set *set)
+__isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
{
int i;
- if (!set)
+ if (!map)
return NULL;
- if (set->n == 0)
- return set;
+ if (map->n == 0)
+ return map;
- set = isl_set_cow(set);
- if (!set)
+ map = isl_map_cow(map);
+ if (!map)
return NULL;
- for (i = 0; i < set->n; ++i) {
- set->p[i] = isl_basic_set_remove_divs(set->p[i]);
- if (!set->p[i])
+ for (i = 0; i < map->n; ++i) {
+ map->p[i] = isl_basic_map_remove_divs(map->p[i]);
+ if (!map->p[i])
goto error;
}
- return set;
+ return map;
error:
- isl_set_free(set);
+ isl_map_free(map);
return NULL;
}
-struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
+__isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
+{
+ return isl_map_remove_divs(set);
+}
+
+struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
enum isl_dim_type type, unsigned first, unsigned n)
{
if (!bmap)
return NULL;
isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
goto error);
- if (n == 0)
+ if (n == 0 && !isl_dim_is_named_or_nested(bmap->dim, type))
return bmap;
bmap = isl_basic_map_eliminate_vars(bmap,
isl_basic_map_offset(bmap, type) - 1 + first, n);
return NULL;
}
-__isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
+/* Return true if the definition of the given div (recursively) involves
+ * any of the given variables.
+ */
+static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
+ unsigned first, unsigned n)
+{
+ int i;
+ unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
+
+ if (isl_int_is_zero(bmap->div[div][0]))
+ return 0;
+ if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
+ return 1;
+
+ for (i = bmap->n_div - 1; i >= 0; --i) {
+ if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
+ continue;
+ if (div_involves_vars(bmap, i, first, n))
+ return 1;
+ }
+
+ return 0;
+}
+
+/* Remove all divs (recursively) involving any of the given dimensions
+ * in their definitions.
+ */
+__isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
+ __isl_take isl_basic_map *bmap,
enum isl_dim_type type, unsigned first, unsigned n)
{
- return (isl_basic_set *)
- isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
+ int i;
+
+ if (!bmap)
+ return NULL;
+ isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
+ goto error);
+ first += isl_basic_map_offset(bmap, type);
+
+ for (i = bmap->n_div - 1; i >= 0; --i) {
+ if (!div_involves_vars(bmap, i, first, n))
+ continue;
+ bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
+ if (!bmap)
+ return NULL;
+ i = bmap->n_div;
+ }
+
+ return bmap;
+error:
+ isl_basic_map_free(bmap);
+ return NULL;
}
-struct isl_map *isl_map_remove(struct isl_map *map,
+__isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
enum isl_dim_type type, unsigned first, unsigned n)
{
int i;
- if (n == 0)
+ if (!map)
+ return NULL;
+ if (map->n == 0)
return map;
map = isl_map_cow(map);
if (!map)
return NULL;
- isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
+
+ for (i = 0; i < map->n; ++i) {
+ map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
+ type, first, n);
+ if (!map->p[i])
+ goto error;
+ }
+ return map;
+error:
+ isl_map_free(map);
+ return NULL;
+}
+
+__isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
+ enum isl_dim_type type, unsigned first, unsigned n)
+{
+ return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
+ type, first, n);
+}
+
+int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
+ enum isl_dim_type type, unsigned first, unsigned n)
+{
+ int i;
+
+ if (!bset)
+ return -1;
+
+ if (first + n > isl_basic_set_dim(bset, type))
+ isl_die(bset->ctx, isl_error_invalid,
+ "index out of bounds", return -1);
+
+ first += isl_basic_set_offset(bset, type);
+ for (i = 0; i < bset->n_eq; ++i)
+ if (isl_seq_first_non_zero(bset->eq[i] + first, n) >= 0)
+ return 1;
+ for (i = 0; i < bset->n_ineq; ++i)
+ if (isl_seq_first_non_zero(bset->ineq[i] + first, n) >= 0)
+ return 1;
+
+ return 0;
+}
+
+int isl_set_involves_dims(__isl_keep isl_set *set,
+ enum isl_dim_type type, unsigned first, unsigned n)
+{
+ int i;
+
+ if (!set)
+ return -1;
+
+ if (first + n > isl_set_dim(set, type))
+ isl_die(set->ctx, isl_error_invalid,
+ "index out of bounds", return -1);
+
+ for (i = 0; i < set->n; ++i) {
+ int involves = isl_basic_set_involves_dims(set->p[i],
+ type, first, n);
+ if (involves < 0 || !involves)
+ return involves;
+ }
+
+ return 1;
+}
+
+/* Return true if the definition of the given div is unknown or depends
+ * on unknown divs.
+ */
+static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
+{
+ int i;
+ unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
+
+ if (isl_int_is_zero(bmap->div[div][0]))
+ return 1;
+
+ for (i = bmap->n_div - 1; i >= 0; --i) {
+ if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
+ continue;
+ if (div_is_unknown(bmap, i))
+ return 1;
+ }
+
+ return 0;
+}
+
+/* Remove all divs that are unknown or defined in terms of unknown divs.
+ */
+__isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
+ __isl_take isl_basic_map *bmap)
+{
+ int i;
+
+ if (!bmap)
+ return NULL;
+
+ for (i = bmap->n_div - 1; i >= 0; --i) {
+ if (!div_is_unknown(bmap, i))
+ continue;
+ bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
+ }
+
+ return bmap;
+}
+
+__isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
+{
+ int i;
+
+ if (!map)
+ return NULL;
+ if (map->n == 0)
+ return map;
+
+ map = isl_map_cow(map);
+ if (!map)
+ return NULL;
+
+ for (i = 0; i < map->n; ++i) {
+ map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
+ if (!map->p[i])
+ goto error;
+ }
+ return map;
+error:
+ isl_map_free(map);
+ return NULL;
+}
+
+__isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
+{
+ return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
+}
+
+__isl_give isl_basic_set *isl_basic_set_remove_dims(
+ __isl_take isl_basic_set *bset,
+ enum isl_dim_type type, unsigned first, unsigned n)
+{
+ return (isl_basic_set *)
+ isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
+}
+
+struct isl_map *isl_map_remove_dims(struct isl_map *map,
+ enum isl_dim_type type, unsigned first, unsigned n)
+{
+ int i;
+
+ if (n == 0)
+ return map;
+
+ map = isl_map_cow(map);
+ if (!map)
+ return NULL;
+ isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
for (i = 0; i < map->n; ++i) {
map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
return NULL;
}
-__isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
+__isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
enum isl_dim_type type, unsigned first, unsigned n)
{
- return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
+ return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
}
/* Project out n inputs starting at first using Fourier-Motzkin */
struct isl_map *isl_map_remove_inputs(struct isl_map *map,
unsigned first, unsigned n)
{
- return isl_map_remove(map, isl_dim_in, first, n);
-}
-
-/* Project out n dimensions starting at first using Fourier-Motzkin */
-struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
- unsigned first, unsigned n)
-{
- unsigned nparam = isl_basic_set_n_param(bset);
- bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
- bset = isl_basic_set_drop_dims(bset, first, n);
- return bset;
+ return isl_map_remove_dims(map, isl_dim_in, first, n);
}
static void dump_term(struct isl_basic_map *bmap,
}
}
-void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
+void isl_basic_set_print_internal(struct isl_basic_set *bset,
+ FILE *out, int indent)
{
if (!bset) {
fprintf(out, "null basic set\n");
dump((struct isl_basic_map *)bset, out, indent);
}
-void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
+void isl_basic_map_print_internal(struct isl_basic_map *bmap,
+ FILE *out, int indent)
{
if (!bmap) {
fprintf(out, "null basic map\n");
if (!dim)
return NULL;
- isl_assert(dim->ctx, dim->n_in == 0, return NULL);
- isl_assert(dim->ctx, n >= 0, return NULL);
+ isl_assert(dim->ctx, dim->n_in == 0, goto error);
+ isl_assert(dim->ctx, n >= 0, goto error);
set = isl_alloc(dim->ctx, struct isl_set,
sizeof(struct isl_set) +
(n - 1) * sizeof(struct isl_basic_set *));
struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
{
- struct isl_set *set;
-
- if (!bset)
- return NULL;
-
- set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
- if (!set) {
- isl_basic_set_free(bset);
- return NULL;
- }
- return isl_set_add_basic_set(set, bset);
+ return isl_map_from_basic_map(bset);
}
struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
return NULL;
map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
- if (!map) {
- isl_basic_map_free(bmap);
- return NULL;
- }
return isl_map_add_basic_map(map, bmap);
}
free(set);
}
-void isl_set_dump(struct isl_set *set, FILE *out, int indent)
+void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
{
int i;
for (i = 0; i < set->n; ++i) {
fprintf(out, "%*s", indent, "");
fprintf(out, "basic set %d:\n", i);
- isl_basic_set_dump(set->p[i], out, indent+4);
+ isl_basic_set_print_internal(set->p[i], out, indent+4);
}
}
-void isl_map_dump(struct isl_map *map, FILE *out, int indent)
+void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
{
int i;
for (i = 0; i < map->n; ++i) {
fprintf(out, "%*s", indent, "");
fprintf(out, "basic map %d:\n", i);
- isl_basic_map_dump(map->p[i], out, indent+4);
+ isl_basic_map_print_internal(map->p[i], out, indent+4);
}
}
struct isl_basic_map *bmap, struct isl_basic_set *bset)
{
struct isl_basic_map *bmap_domain;
- struct isl_dim *dim;
if (!bmap || !bset)
goto error;
goto error;
bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
bset->n_div, bset->n_eq, bset->n_ineq);
- dim = isl_dim_reverse(isl_dim_copy(bset->dim));
- bmap_domain = isl_basic_map_from_basic_set(bset, dim);
+ bmap_domain = isl_basic_map_from_domain(bset);
bmap = add_constraints(bmap, bmap_domain, 0, 0);
bmap = isl_basic_map_simplify(bmap);
isl_assert(bset->ctx,
isl_basic_map_compatible_range(bmap, bset), goto error);
+ if (isl_basic_set_is_universe(bset)) {
+ isl_basic_set_free(bset);
+ return bmap;
+ }
+
bmap = isl_basic_map_cow(bmap);
if (!bmap)
goto error;
static __isl_give isl_map *map_intersect_add_constraint(
__isl_take isl_map *map1, __isl_take isl_map *map2)
{
- struct isl_basic_map *bmap1;
- struct isl_basic_map *bmap2;
-
isl_assert(map1->ctx, map1->n == 1, goto error);
isl_assert(map2->ctx, map1->n == 1, goto error);
isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
map1 = isl_map_cow(map1);
if (!map1)
goto error;
- if (isl_map_fast_is_empty(map1)) {
+ if (isl_map_plain_is_empty(map1)) {
isl_map_free(map2);
return map1;
}
if (!map1->p[0])
goto error;
- if (isl_basic_map_fast_is_empty(map1->p[0])) {
+ if (isl_basic_map_plain_is_empty(map1->p[0])) {
isl_basic_map_free(map1->p[0]);
map1->n = 0;
}
if (!map1 || !map2)
goto error;
- if (isl_map_fast_is_empty(map1)) {
+ if (isl_map_plain_is_empty(map1) &&
+ isl_dim_equal(map1->dim, map2->dim)) {
isl_map_free(map2);
return map1;
}
- if (isl_map_fast_is_empty(map2)) {
+ if (isl_map_plain_is_empty(map2) &&
+ isl_dim_equal(map1->dim, map2->dim)) {
isl_map_free(map1);
return map2;
}
(struct isl_map *)set2);
}
+/* The current implementation of isl_map_intersect accepts intersections
+ * with parameter domains, so we can just call that for now.
+ */
+__isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map,
+ __isl_take isl_set *params)
+{
+ return isl_map_intersect(map, params);
+}
+
+__isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
+ __isl_take isl_set *params)
+{
+ return isl_map_intersect_params(set, params);
+}
+
struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
{
struct isl_dim *dim;
res = isl_basic_map_alloc_dim(res_dim,
bmap->n_div, bmap->n_eq, bmap->n_ineq);
- res = add_constraints_dim_map(res, bmap, dim_map);
- res = isl_basic_map_simplify(res);
+ if (isl_basic_map_is_rational(bmap))
+ res = isl_basic_map_set_rational(res);
+ res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
return isl_basic_map_finalize(res);
}
enum isl_dim_type dst_type, unsigned dst_pos,
enum isl_dim_type src_type, unsigned src_pos, unsigned n)
{
- int i;
struct isl_dim_map *dim_map;
struct isl_basic_map *res;
enum isl_dim_type t;
res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
bmap->n_div, bmap->n_eq, bmap->n_ineq);
- bmap = add_constraints_dim_map(res, bmap, dim_map);
+ bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
src_type, src_pos, n);
res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
bmap->n_div, bmap->n_eq, bmap->n_ineq);
- res = add_constraints_dim_map(res, bmap, dim_map);
+ res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
return res;
}
return NULL;
if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
- return isl_basic_map_remove(bmap, type, first, n);
+ return isl_basic_map_remove_dims(bmap, type, first, n);
isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
goto error);
bmap1->n_div + bmap2->n_div + n,
bmap1->n_eq + bmap2->n_eq,
bmap1->n_ineq + bmap2->n_ineq);
- bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
- bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
+ bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
+ bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
bmap = add_divs(bmap, n);
bmap = isl_basic_map_simplify(bmap);
bmap = isl_basic_map_drop_redundant_divs(bmap);
isl_int_set_si(bmap->eq[j][1+pos+i], 1);
isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
}
- bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
- bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
+ bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
+ bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
bmap = add_divs(bmap, 2 * n_out);
bmap = isl_basic_map_simplify(bmap);
return isl_basic_map_finalize(bmap);
}
+__isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
+{
+ return isl_basic_map_neg(bset);
+}
+
/* Given a map A -> f(A), construct A -> -f(A).
*/
struct isl_map *isl_map_neg(struct isl_map *map)
result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
bmap->n_div + n_out,
bmap->n_eq, bmap->n_ineq + 2 * n_out);
- result = add_constraints_dim_map(result, bmap, dim_map);
+ result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
result = add_divs(result, n_out);
for (i = 0; i < n_out; ++i) {
int j;
__isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
{
- return map_lex_lte(isl_dim_map(set_dim), 0);
+ return map_lex_lte(isl_dim_map_from_set(set_dim), 0);
}
__isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
{
- return map_lex_lte(isl_dim_map(set_dim), 1);
+ return map_lex_lte(isl_dim_map_from_set(set_dim), 1);
}
static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
__isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
{
- return map_lex_gte(isl_dim_map(set_dim), 0);
+ return map_lex_gte(isl_dim_map_from_set(set_dim), 0);
}
__isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
{
- return map_lex_gte(isl_dim_map(set_dim), 1);
+ return map_lex_gte(isl_dim_map_from_set(set_dim), 1);
}
__isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
if (!bmap)
goto error;
if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
- bmap->n_div == 0 && !isl_dim_get_tuple_name(bmap->dim, isl_dim_out))
+ bmap->n_div == 0 &&
+ !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
+ !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
return (struct isl_basic_set *)bmap;
bmap = isl_basic_map_cow(bmap);
if (!bmap)
bmap->extra += like->n_div;
if (bmap->extra) {
unsigned ltotal;
+ isl_int **div;
ltotal = total - bmap->extra + like->extra;
if (ltotal > total)
ltotal = total;
bmap->extra * (1 + 1 + total));
if (isl_blk_is_error(bmap->block2))
goto error;
- bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
- bmap->extra);
- if (!bmap->div)
+ div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
+ if (!div)
goto error;
+ bmap->div = div;
for (i = 0; i < bmap->extra; ++i)
bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
for (i = 0; i < like->n_div; ++i) {
return NULL;
}
-static __isl_give isl_basic_set *isl_basic_set_reset_dim(
+__isl_give isl_basic_set *isl_basic_set_reset_dim(
__isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
{
return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
return domain;
}
+int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
+{
+ if (!bmap)
+ return -1;
+ return isl_dim_may_be_set(bmap->dim);
+}
+
struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
{
+ if (!bmap)
+ return NULL;
+ if (isl_basic_map_may_be_set(bmap))
+ return bmap;
return isl_basic_map_domain(isl_basic_map_reverse(bmap));
}
int i, k;
isl_dim *dim;
isl_basic_map *domain;
- isl_basic_set *bset;
int nparam, n_in, n_out;
unsigned total;
int i, k;
isl_dim *dim;
isl_basic_map *range;
- isl_basic_set *bset;
int nparam, n_in, n_out;
unsigned total;
return NULL;
}
+int isl_map_may_be_set(__isl_keep isl_map *map)
+{
+ if (!map)
+ return -1;
+ return isl_dim_may_be_set(map->dim);
+}
+
struct isl_set *isl_map_range(struct isl_map *map)
{
int i;
if (!map)
goto error;
- if (isl_map_dim(map, isl_dim_in) == 0)
+ if (isl_map_may_be_set(map))
return (isl_set *)map;
map = isl_map_cow(map);
return isl_map_reverse(isl_map_from_range(set));
}
+__isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
+ __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
+{
+ return isl_basic_map_apply_range(isl_basic_map_from_domain(domain),
+ isl_basic_map_from_range(range));
+}
+
__isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
__isl_take isl_set *range)
{
{
struct isl_basic_map *bmap;
bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
+ bmap = isl_basic_map_finalize(bmap);
return bmap;
}
{
struct isl_basic_set *bset;
bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
+ bset = isl_basic_set_finalize(bset);
return bset;
}
+__isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_dim *dim)
+{
+ int i;
+ unsigned total = isl_dim_total(dim);
+ isl_basic_map *bmap;
+
+ bmap= isl_basic_map_alloc_dim(dim, 0, 0, total);
+ for (i = 0; i < total; ++i) {
+ int k = isl_basic_map_alloc_inequality(bmap);
+ if (k < 0)
+ goto error;
+ isl_seq_clr(bmap->ineq[k], 1 + total);
+ isl_int_set_si(bmap->ineq[k][1 + i], 1);
+ }
+ return bmap;
+error:
+ isl_basic_map_free(bmap);
+ return NULL;
+}
+
+__isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_dim *dim)
+{
+ return isl_basic_map_nat_universe(dim);
+}
+
+__isl_give isl_map *isl_map_nat_universe(__isl_take isl_dim *dim)
+{
+ return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
+}
+
+__isl_give isl_set *isl_set_nat_universe(__isl_take isl_dim *dim)
+{
+ return isl_map_nat_universe(dim);
+}
+
__isl_give isl_basic_map *isl_basic_map_universe_like(
__isl_keep isl_basic_map *model)
{
{
if (!bmap || !map)
goto error;
- if (isl_basic_map_fast_is_empty(bmap)) {
+ if (isl_basic_map_plain_is_empty(bmap)) {
isl_basic_map_free(bmap);
return map;
}
dom, empty);
}
-/* Given a basic map "bmap", compute the lexicograhically minimal
+/* Given a basic map "bmap", compute the lexicographically minimal
* (or maximal) image element for each domain element in dom.
* Set *empty to those elements in dom that do not have an image element.
*
if (!dom)
goto error;
- if (isl_set_fast_is_empty(dom)) {
+ if (isl_set_plain_is_empty(dom)) {
res = isl_map_empty_like_basic_map(bmap);
*empty = isl_set_empty_like(dom);
isl_set_free(dom);
return NULL;
}
-/* Given a map "map", compute the lexicograhically minimal
+/* Given a map "map", compute the lexicographically minimal
* (or maximal) image element for each domain element in dom.
* Set *empty to those elements in dom that do not have an image element.
*
*
* Let res^k and todo^k be the results after k steps and let i = k + 1.
* Assume we are computing the lexicographical maximum.
- * We first intersect basic map i with a relation that maps elements
- * to elements that are lexicographically larger than the image elements
- * in res^k and the compute the maximum image element of this intersection.
- * The result ("better") corresponds to those image elements in basic map i
- * that are better than what we had before. The remainder ("keep") are the
- * domain elements for which the image element in res_k was better.
- * We also compute the lexicographical maximum of basic map i in todo^k.
- * res^i is the result of the operation + better + those elements in
- * res^k that we should keep
- * todo^i is the remainder of the maximum operation on todo^k.
+ * We first compute the lexicographically maximal element in basic map i.
+ * This results in a partial solution res_i and a subset todo_i.
+ * Then we combine these results with those obtain for the first k basic maps
+ * to obtain a result that is valid for the first k+1 basic maps.
+ * In particular, the set where there is no solution is the set where
+ * there is no solution for the first k basic maps and also no solution
+ * for the ith basic map, i.e.,
+ *
+ * todo^i = todo^k * todo_i
+ *
+ * On dom(res^k) * dom(res_i), we need to pick the larger of the two
+ * solutions, arbitrarily breaking ties in favor of res^k.
+ * That is, when res^k(a) >= res_i(a), we pick res^k and
+ * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
+ * the lexicographic order.)
+ * In practice, we compute
+ *
+ * res^k * (res_i . "<=")
+ *
+ * and
+ *
+ * res_i * (res^k . "<")
+ *
+ * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
+ * where only one of res^k and res_i provides a solution and we simply pick
+ * that one, i.e.,
+ *
+ * res^k * todo_i
+ * and
+ * res_i * todo^k
+ *
+ * Note that we only compute these intersections when dom(res^k) intersects
+ * dom(res_i). Otherwise, the only effect of these intersections is to
+ * potentially break up res^k and res_i into smaller pieces.
+ * We want to avoid such splintering as much as possible.
+ * In fact, an earlier implementation of this function would look for
+ * better results in the domain of res^k and for extra results in todo^k,
+ * but this would always result in a splintering according to todo^k,
+ * even when the domain of basic map i is disjoint from the domains of
+ * the previous basic maps.
*/
static __isl_give isl_map *isl_map_partial_lexopt(
__isl_take isl_map *map, __isl_take isl_set *dom,
if (!map || !dom)
goto error;
- if (isl_map_fast_is_empty(map)) {
+ if (isl_map_plain_is_empty(map)) {
if (empty)
*empty = dom;
else
isl_set_copy(dom), &todo, max);
for (i = 1; i < map->n; ++i) {
- struct isl_map *lt;
- struct isl_map *better;
- struct isl_set *keep;
- struct isl_map *res_i;
- struct isl_set *todo_i;
- struct isl_dim *dim = isl_map_get_dim(res);
-
- dim = isl_dim_range(dim);
- if (max)
- lt = isl_map_lex_lt(dim);
- else
- lt = isl_map_lex_gt(dim);
- lt = isl_map_apply_range(isl_map_copy(res), lt);
- lt = isl_map_intersect(lt,
- isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
- better = isl_map_partial_lexopt(lt,
- isl_map_domain(isl_map_copy(res)),
- &keep, max);
+ isl_map *lt, *le;
+ isl_map *res_i;
+ isl_set *todo_i;
+ isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
- todo, &todo_i, max);
+ isl_set_copy(dom), &todo_i, max);
+
+ if (max) {
+ lt = isl_map_lex_lt(isl_dim_copy(dim));
+ le = isl_map_lex_le(dim);
+ } else {
+ lt = isl_map_lex_gt(isl_dim_copy(dim));
+ le = isl_map_lex_ge(dim);
+ }
+ lt = isl_map_apply_range(isl_map_copy(res), lt);
+ lt = isl_map_intersect(lt, isl_map_copy(res_i));
+ le = isl_map_apply_range(isl_map_copy(res_i), le);
+ le = isl_map_intersect(le, isl_map_copy(res));
+
+ if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
+ res = isl_map_intersect_domain(res,
+ isl_set_copy(todo_i));
+ res_i = isl_map_intersect_domain(res_i,
+ isl_set_copy(todo));
+ }
- res = isl_map_intersect_domain(res, keep);
res = isl_map_union_disjoint(res, res_i);
- res = isl_map_union_disjoint(res, better);
- todo = todo_i;
+ res = isl_map_union_disjoint(res, lt);
+ res = isl_map_union_disjoint(res, le);
+
+ todo = isl_set_intersect(todo, todo_i);
}
isl_set_free(dom);
return (isl_set *)isl_map_lexmax((isl_map *)set);
}
-/* Apply a preimage specified by "mat" on the parameters of "bset".
- * bset is assumed to have only parameters and divs.
+/* Construct a map that equates the two given dimensions in the given space.
*/
-static struct isl_basic_set *basic_set_parameter_preimage(
- struct isl_basic_set *bset, struct isl_mat *mat)
+static __isl_give isl_map *equate(__isl_take isl_dim *dim,
+ enum isl_dim_type src_type, int src_pos,
+ enum isl_dim_type dst_type, int dst_pos)
{
- unsigned nparam;
-
- if (!bset || !mat)
- goto error;
+ isl_basic_map *bmap;
+ int k;
- bset->dim = isl_dim_cow(bset->dim);
- if (!bset->dim)
+ bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
+ k = isl_basic_map_alloc_equality(bmap);
+ if (k < 0)
goto error;
+ isl_seq_clr(bmap->eq[k], 1 + isl_basic_map_total_dim(bmap));
+ src_pos += isl_basic_map_offset(bmap, src_type);
+ dst_pos += isl_basic_map_offset(bmap, dst_type);
+ isl_int_set_si(bmap->eq[k][src_pos], 1);
+ isl_int_set_si(bmap->eq[k][dst_pos], -1);
- nparam = isl_basic_set_dim(bset, isl_dim_param);
-
- isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
-
- bset->dim->nparam = 0;
- bset->dim->n_out = nparam;
- bset = isl_basic_set_preimage(bset, mat);
- if (bset) {
- bset->dim->nparam = bset->dim->n_out;
- bset->dim->n_out = 0;
- }
- return bset;
+ return isl_map_from_basic_map(bmap);
error:
- isl_mat_free(mat);
- isl_basic_set_free(bset);
+ isl_basic_map_free(bmap);
return NULL;
}
-/* Apply a preimage specified by "mat" on the parameters of "set".
- * set is assumed to have only parameters and divs.
+/* Extract the first and only affine expression from list
+ * and then add it to *pwaff with the given dom.
+ * This domain is known to be disjoint from other domains
+ * because of the way isl_basic_set_foreach_lexmax works.
*/
-static struct isl_set *set_parameter_preimage(
- struct isl_set *set, struct isl_mat *mat)
+static int update_dim_max(__isl_take isl_basic_set *dom,
+ __isl_take isl_aff_list *list, void *user)
{
- struct isl_dim *dim = NULL;
- unsigned nparam;
+ isl_ctx *ctx = isl_basic_set_get_ctx(dom);
+ isl_aff *aff;
+ isl_pw_aff **pwaff = user;
+ isl_pw_aff *pwaff_i;
- if (!set || !mat)
- goto error;
+ if (isl_aff_list_n_aff(list) != 1)
+ isl_die(ctx, isl_error_internal,
+ "expecting single element list", goto error);
- dim = isl_dim_copy(set->dim);
- dim = isl_dim_cow(dim);
- if (!dim)
- goto error;
+ aff = isl_aff_list_get_aff(list, 0);
+ pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
- nparam = isl_set_dim(set, isl_dim_param);
+ *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
- isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
+ isl_aff_list_free(list);
- dim->nparam = 0;
- dim->n_out = nparam;
+ return 0;
+error:
+ isl_basic_set_free(dom);
+ isl_aff_list_free(list);
+ return -1;
+}
+
+/* Given a one-dimensional basic set, compute the maximum of that
+ * dimension as an isl_pw_aff.
+ *
+ * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexmax
+ * call update_dim_max on each leaf of the result.
+ */
+static __isl_give isl_pw_aff *basic_set_dim_max(__isl_keep isl_basic_set *bset)
+{
+ isl_dim *dim = isl_basic_set_get_dim(bset);
+ isl_pw_aff *pwaff;
+ int r;
+
+ dim = isl_dim_domain(isl_dim_from_range(dim));
+ pwaff = isl_pw_aff_empty(dim);
+
+ r = isl_basic_set_foreach_lexmax(bset, &update_dim_max, &pwaff);
+ if (r < 0)
+ return isl_pw_aff_free(pwaff);
+
+ return pwaff;
+}
+
+/* Compute the maximum of the given set dimension as a function of the
+ * parameters, but independently of the other set dimensions.
+ *
+ * We first project the set onto the given dimension and then compute
+ * the "lexicographic" maximum in each basic set, combining the results
+ * using isl_pw_aff_max.
+ */
+__isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
+{
+ int i;
+ isl_map *map;
+ isl_pw_aff *pwaff;
+
+ map = isl_map_from_domain(set);
+ map = isl_map_add_dims(map, isl_dim_out, 1);
+ map = isl_map_intersect(map,
+ equate(isl_map_get_dim(map), isl_dim_in, pos,
+ isl_dim_out, 0));
+ set = isl_map_range(map);
+ if (!set)
+ return NULL;
+
+ if (set->n == 0) {
+ isl_dim *dim = isl_set_get_dim(set);
+ dim = isl_dim_domain(isl_dim_from_range(dim));
+ isl_set_free(set);
+ return isl_pw_aff_empty(dim);
+ }
+
+ pwaff = basic_set_dim_max(set->p[0]);
+ for (i = 1; i < set->n; ++i) {
+ isl_pw_aff *pwaff_i;
+
+ pwaff_i = basic_set_dim_max(set->p[i]);
+ pwaff = isl_pw_aff_max(pwaff, pwaff_i);
+ }
+
+ isl_set_free(set);
+
+ return pwaff;
+}
+
+/* Apply a preimage specified by "mat" on the parameters of "bset".
+ * bset is assumed to have only parameters and divs.
+ */
+static struct isl_basic_set *basic_set_parameter_preimage(
+ struct isl_basic_set *bset, struct isl_mat *mat)
+{
+ unsigned nparam;
+
+ if (!bset || !mat)
+ goto error;
+
+ bset->dim = isl_dim_cow(bset->dim);
+ if (!bset->dim)
+ goto error;
+
+ nparam = isl_basic_set_dim(bset, isl_dim_param);
+
+ isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
+
+ bset->dim->nparam = 0;
+ bset->dim->n_out = nparam;
+ bset = isl_basic_set_preimage(bset, mat);
+ if (bset) {
+ bset->dim->nparam = bset->dim->n_out;
+ bset->dim->n_out = 0;
+ }
+ return bset;
+error:
+ isl_mat_free(mat);
+ isl_basic_set_free(bset);
+ return NULL;
+}
+
+/* Apply a preimage specified by "mat" on the parameters of "set".
+ * set is assumed to have only parameters and divs.
+ */
+static struct isl_set *set_parameter_preimage(
+ struct isl_set *set, struct isl_mat *mat)
+{
+ struct isl_dim *dim = NULL;
+ unsigned nparam;
+
+ if (!set || !mat)
+ goto error;
+
+ dim = isl_dim_copy(set->dim);
+ dim = isl_dim_cow(dim);
+ if (!dim)
+ goto error;
+
+ nparam = isl_set_dim(set, isl_dim_param);
+
+ isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
+
+ dim->nparam = 0;
+ dim->n_out = nparam;
isl_set_reset_dim(set, dim);
set = isl_set_preimage(set, mat);
if (!set)
if (i == bset->n_eq)
return isl_basic_set_lexmin(bset);
- eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
+ eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
0, 1 + nparam);
eq = isl_mat_cow(eq);
T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
return NULL;
}
-static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
+int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
{
int i;
unsigned off;
return -1;
for (i = 0; i < map->n; ++i) {
- int known = basic_map_divs_known(map->p[i]);
+ int known = isl_basic_map_divs_known(map->p[i]);
if (known <= 0)
return known;
}
*/
struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
{
- int i;
int known;
struct isl_map *map;
- known = basic_map_divs_known(bmap);
+ known = isl_basic_map_divs_known(bmap);
if (known < 0)
goto error;
if (known)
bmap = isl_basic_map_drop_redundant_divs(bmap);
- known = basic_map_divs_known(bmap);
+ known = isl_basic_map_divs_known(bmap);
if (known < 0)
goto error;
if (known)
if (!map || !set)
goto error;
+ if (!isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
+ isl_die(set->ctx, isl_error_invalid,
+ "parameters don't match", goto error);
+
+ if (isl_dim_size(set->dim, isl_dim_set) != 0 &&
+ !isl_map_compatible_range(map, set))
+ isl_die(set->ctx, isl_error_invalid,
+ "incompatible spaces", goto error);
+
+ if (isl_set_plain_is_universe(set)) {
+ isl_set_free(set);
+ return map;
+ }
+
if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
ISL_F_ISSET(set, ISL_MAP_DISJOINT))
ISL_FL_SET(flags, ISL_MAP_DISJOINT);
goto error);
dim = isl_map_get_dim(map);
dim = isl_dim_domain(dim);
- result = isl_set_alloc_dim(dim, map->n, map->flags);
+ result = isl_set_alloc_dim(dim, map->n, 0);
if (!result)
goto error;
for (i = 0; i < map->n; ++i)
return NULL;
}
+/*
+ * returns [domain -> range] -> range - domain
+ */
+__isl_give isl_basic_map *isl_basic_map_deltas_map(
+ __isl_take isl_basic_map *bmap)
+{
+ int i, k;
+ isl_dim *dim;
+ isl_basic_map *domain;
+ int nparam, n;
+ unsigned total;
+
+ if (!isl_dim_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
+ isl_die(bmap->ctx, isl_error_invalid,
+ "domain and range don't match", goto error);
+
+ nparam = isl_basic_map_dim(bmap, isl_dim_param);
+ n = isl_basic_map_dim(bmap, isl_dim_in);
+
+ dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
+ domain = isl_basic_map_universe(dim);
+
+ bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
+ bmap = isl_basic_map_apply_range(bmap, domain);
+ bmap = isl_basic_map_extend_constraints(bmap, n, 0);
+
+ total = isl_basic_map_total_dim(bmap);
+
+ for (i = 0; i < n; ++i) {
+ k = isl_basic_map_alloc_equality(bmap);
+ if (k < 0)
+ goto error;
+ isl_seq_clr(bmap->eq[k], 1 + total);
+ isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
+ isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
+ isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
+ }
+
+ bmap = isl_basic_map_gauss(bmap, NULL);
+ return isl_basic_map_finalize(bmap);
+error:
+ isl_basic_map_free(bmap);
+ return NULL;
+}
+
+/*
+ * returns [domain -> range] -> range - domain
+ */
+__isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
+{
+ int i;
+ isl_dim *domain_dim;
+
+ if (!map)
+ return NULL;
+
+ if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
+ isl_die(map->ctx, isl_error_invalid,
+ "domain and range don't match", goto error);
+
+ map = isl_map_cow(map);
+ if (!map)
+ return NULL;
+
+ domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
+ map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
+ map->dim = isl_dim_join(map->dim, domain_dim);
+ if (!map->dim)
+ goto error;
+ for (i = 0; i < map->n; ++i) {
+ map->p[i] = isl_basic_map_deltas_map(map->p[i]);
+ if (!map->p[i])
+ goto error;
+ }
+ ISL_F_CLR(map, ISL_MAP_NORMALIZED);
+ return map;
+error:
+ isl_map_free(map);
+ return NULL;
+}
+
static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
{
struct isl_basic_map *bmap;
return NULL;
}
-struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
+__isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_dim *dim)
{
- struct isl_dim *dim = isl_dim_map(set_dim);
if (!dim)
return NULL;
+ if (dim->n_in != dim->n_out)
+ isl_die(dim->ctx, isl_error_invalid,
+ "number of input and output dimensions needs to be "
+ "the same", goto error);
return basic_map_identity(dim);
+error:
+ isl_dim_free(dim);
+ return NULL;
}
struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
{
if (!model || !model->dim)
return NULL;
- isl_assert(model->ctx,
- model->dim->n_in == model->dim->n_out, return NULL);
- return basic_map_identity(isl_dim_copy(model->dim));
-}
-
-static struct isl_map *map_identity(struct isl_dim *dim)
-{
- struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
- return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
+ return isl_basic_map_identity(isl_dim_copy(model->dim));
}
-struct isl_map *isl_map_identity(struct isl_dim *set_dim)
+__isl_give isl_map *isl_map_identity(__isl_take isl_dim *dim)
{
- struct isl_dim *dim = isl_dim_map(set_dim);
- if (!dim)
- return NULL;
- return map_identity(dim);
+ return isl_map_from_basic_map(isl_basic_map_identity(dim));
}
struct isl_map *isl_map_identity_like(struct isl_map *model)
{
if (!model || !model->dim)
return NULL;
- isl_assert(model->ctx,
- model->dim->n_in == model->dim->n_out, return NULL);
- return map_identity(isl_dim_copy(model->dim));
+ return isl_map_identity(isl_dim_copy(model->dim));
}
struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
{
if (!model || !model->dim)
return NULL;
- isl_assert(model->ctx,
- model->dim->n_in == model->dim->n_out, return NULL);
- return map_identity(isl_dim_copy(model->dim));
+ return isl_map_identity(isl_dim_copy(model->dim));
+}
+
+__isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
+{
+ isl_dim *dim = isl_set_get_dim(set);
+ isl_map *id;
+ id = isl_map_identity(isl_dim_map_from_set(dim));
+ return isl_map_intersect_range(id, set);
}
/* Construct a basic set with all set dimensions having only non-negative
return NULL;
}
+/* Construct the half-space x_pos >= 0.
+ */
+static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
+ int pos)
+{
+ int k;
+ isl_basic_set *nonneg;
+
+ nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
+ k = isl_basic_set_alloc_inequality(nonneg);
+ if (k < 0)
+ goto error;
+ isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
+ isl_int_set_si(nonneg->ineq[k][pos], 1);
+
+ return isl_basic_set_finalize(nonneg);
+error:
+ isl_basic_set_free(nonneg);
+ return NULL;
+}
+
+/* Construct the half-space x_pos <= -1.
+ */
+static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
+{
+ int k;
+ isl_basic_set *neg;
+
+ neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
+ k = isl_basic_set_alloc_inequality(neg);
+ if (k < 0)
+ goto error;
+ isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
+ isl_int_set_si(neg->ineq[k][0], -1);
+ isl_int_set_si(neg->ineq[k][pos], -1);
+
+ return isl_basic_set_finalize(neg);
+error:
+ isl_basic_set_free(neg);
+ return NULL;
+}
+
__isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
enum isl_dim_type type, unsigned first, unsigned n)
{
int i;
- isl_basic_set *nonneg = NULL;
- isl_basic_set *neg = NULL;
+ isl_basic_set *nonneg;
+ isl_basic_set *neg;
if (!set)
return NULL;
isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
for (i = 0; i < n; ++i) {
- int k;
-
- neg = NULL;
- nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
- k = isl_basic_set_alloc_inequality(nonneg);
- if (k < 0)
- goto error;
- isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
- isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
-
- neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
- k = isl_basic_set_alloc_inequality(neg);
- if (k < 0)
- goto error;
- isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
- isl_int_set_si(neg->ineq[k][0], -1);
- isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
+ nonneg = nonneg_halfspace(isl_set_get_dim(set),
+ pos(set->dim, type) + first + i);
+ neg = neg_halfspace(isl_set_get_dim(set),
+ pos(set->dim, type) + first + i);
set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
}
return set;
error:
- isl_basic_set_free(nonneg);
- isl_basic_set_free(neg);
isl_set_free(set);
return NULL;
}
+static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
+ int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
+ void *user)
+{
+ isl_set *half;
+
+ if (!set)
+ return -1;
+ if (isl_set_plain_is_empty(set)) {
+ isl_set_free(set);
+ return 0;
+ }
+ if (first == len)
+ return fn(set, signs, user);
+
+ signs[first] = 1;
+ half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
+ 1 + first));
+ half = isl_set_intersect(half, isl_set_copy(set));
+ if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
+ goto error;
+
+ signs[first] = -1;
+ half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
+ 1 + first));
+ half = isl_set_intersect(half, set);
+ return foreach_orthant(half, signs, first + 1, len, fn, user);
+error:
+ isl_set_free(set);
+ return -1;
+}
+
+/* Call "fn" on the intersections of "set" with each of the orthants
+ * (except for obviously empty intersections). The orthant is identified
+ * by the signs array, with each entry having value 1 or -1 according
+ * to the sign of the corresponding variable.
+ */
+int isl_set_foreach_orthant(__isl_keep isl_set *set,
+ int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
+ void *user)
+{
+ unsigned nparam;
+ unsigned nvar;
+ int *signs;
+ int r;
+
+ if (!set)
+ return -1;
+ if (isl_set_plain_is_empty(set))
+ return 0;
+
+ nparam = isl_set_dim(set, isl_dim_param);
+ nvar = isl_set_dim(set, isl_dim_set);
+
+ signs = isl_alloc_array(set->ctx, int, nparam + nvar);
+
+ r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
+ fn, user);
+
+ free(signs);
+
+ return r;
+}
+
int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
{
return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
return 1;
}
-int isl_map_fast_is_empty(struct isl_map *map)
+int isl_map_plain_is_empty(__isl_keep isl_map *map)
{
return map ? map->n == 0 : -1;
}
-int isl_set_fast_is_empty(struct isl_set *set)
+int isl_map_fast_is_empty(__isl_keep isl_map *map)
+{
+ return isl_map_plain_is_empty(map);
+}
+
+int isl_set_plain_is_empty(struct isl_set *set)
{
return set ? set->n == 0 : -1;
}
+int isl_set_fast_is_empty(__isl_keep isl_set *set)
+{
+ return isl_set_plain_is_empty(set);
+}
+
int isl_set_is_empty(struct isl_set *set)
{
return isl_map_is_empty((struct isl_map *)set);
return bset->n_eq == 0 && bset->n_ineq == 0;
}
-int isl_map_fast_is_universe(__isl_keep isl_map *map)
+int isl_map_plain_is_universe(__isl_keep isl_map *map)
{
int i;
return 0;
}
+int isl_set_plain_is_universe(__isl_keep isl_set *set)
+{
+ return isl_map_plain_is_universe((isl_map *) set);
+}
+
int isl_set_fast_is_universe(__isl_keep isl_set *set)
{
- return isl_map_fast_is_universe((isl_map *) set);
+ return isl_set_plain_is_universe(set);
}
int isl_basic_map_is_empty(struct isl_basic_map *bmap)
return empty;
}
-int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
+int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
{
if (!bmap)
return -1;
return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
}
-int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
+int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
+{
+ return isl_basic_map_plain_is_empty(bmap);
+}
+
+int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
{
if (!bset)
return -1;
return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
}
+int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
+{
+ return isl_basic_set_plain_is_empty(bset);
+}
+
int isl_basic_set_is_empty(struct isl_basic_set *bset)
{
return isl_basic_map_is_empty((struct isl_basic_map *)bset);
return NULL;
}
-/* Look for a div in dst that corresponds to the div "div" in src.
- * The divs before "div" in src and dst are assumed to be the same.
- *
- * Returns -1 if no corresponding div was found and the position
+/* Apply the expansion computed by isl_merge_divs.
+ * The expansion itself is given by "exp" while the resulting
+ * list of divs is given by "div".
+ */
+__isl_give isl_basic_set *isl_basic_set_expand_divs(
+ __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
+{
+ int i, j;
+ int n_div;
+
+ bset = isl_basic_set_cow(bset);
+ if (!bset || !div)
+ goto error;
+
+ if (div->n_row < bset->n_div)
+ isl_die(isl_mat_get_ctx(div), isl_error_invalid,
+ "not an expansion", goto error);
+
+ bset = isl_basic_map_extend_dim(bset, isl_dim_copy(bset->dim),
+ div->n_row - bset->n_div, 0,
+ 2 * (div->n_row - bset->n_div));
+
+ n_div = bset->n_div;
+ for (i = n_div; i < div->n_row; ++i)
+ if (isl_basic_set_alloc_div(bset) < 0)
+ goto error;
+
+ j = n_div - 1;
+ for (i = div->n_row - 1; i >= 0; --i) {
+ if (j >= 0 && exp[j] == i) {
+ if (i != j)
+ isl_basic_map_swap_div(bset, i, j);
+ j--;
+ } else {
+ isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
+ if (isl_basic_map_add_div_constraints(bset, i) < 0)
+ goto error;
+ }
+ }
+
+ isl_mat_free(div);
+ return bset;
+error:
+ isl_basic_set_free(bset);
+ isl_mat_free(div);
+ return NULL;
+}
+
+/* Look for a div in dst that corresponds to the div "div" in src.
+ * The divs before "div" in src and dst are assumed to be the same.
+ *
+ * Returns -1 if no corresponding div was found and the position
* of the corresponding div in dst otherwise.
*/
static int find_div(struct isl_basic_map *dst,
return follows;
}
-static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
+static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
unsigned pos, isl_int *val)
{
int i;
return 0;
}
-static int isl_map_fast_has_fixed_var(struct isl_map *map,
+static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
unsigned pos, isl_int *val)
{
int i;
if (map->n == 0)
return 0;
if (map->n == 1)
- return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
+ return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
isl_int_init(v);
isl_int_init(tmp);
- fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
+ fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
for (i = 1; fixed == 1 && i < map->n; ++i) {
- fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
+ fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
if (fixed == 1 && isl_int_ne(tmp, v))
fixed = 0;
}
return fixed;
}
-static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
+static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
unsigned pos, isl_int *val)
{
- return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
+ return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
pos, val);
}
-static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
+static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
isl_int *val)
{
- return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
+ return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
}
-int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
+int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
enum isl_dim_type type, unsigned pos, isl_int *val)
{
if (pos >= isl_basic_map_dim(bmap, type))
return -1;
- return isl_basic_map_fast_has_fixed_var(bmap,
+ return isl_basic_map_plain_has_fixed_var(bmap,
isl_basic_map_offset(bmap, type) - 1 + pos, val);
}
-int isl_map_fast_is_fixed(struct isl_map *map,
+int isl_map_plain_is_fixed(__isl_keep isl_map *map,
enum isl_dim_type type, unsigned pos, isl_int *val)
{
if (pos >= isl_map_dim(map, type))
return -1;
- return isl_map_fast_has_fixed_var(map,
+ return isl_map_plain_has_fixed_var(map,
map_offset(map, type) - 1 + pos, val);
}
+int isl_map_fast_is_fixed(__isl_keep isl_map *map,
+ enum isl_dim_type type, unsigned pos, isl_int *val)
+{
+ return isl_map_plain_is_fixed(map, type, pos, val);
+}
+
/* Check if dimension dim has fixed value and if so and if val is not NULL,
* then return this fixed value in *val.
*/
-int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
- isl_int *val)
+int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
+ unsigned dim, isl_int *val)
{
- return isl_basic_set_fast_has_fixed_var(bset,
+ return isl_basic_set_plain_has_fixed_var(bset,
isl_basic_set_n_param(bset) + dim, val);
}
/* Check if dimension dim has fixed value and if so and if val is not NULL,
* then return this fixed value in *val.
*/
-int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
+int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
+ unsigned dim, isl_int *val)
+{
+ return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
+}
+
+int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
+ unsigned dim, isl_int *val)
{
- return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
+ return isl_set_plain_dim_is_fixed(set, dim, val);
}
/* Check if input variable in has fixed value and if so and if val is not NULL,
* then return this fixed value in *val.
*/
-int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
+int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
+ unsigned in, isl_int *val)
{
- return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
+ return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
}
/* Check if dimension dim has an (obvious) fixed lower bound and if so
* and if val is not NULL, then return this lower bound in *val.
*/
-int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
- unsigned dim, isl_int *val)
+int isl_basic_set_plain_dim_has_fixed_lower_bound(
+ __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
{
int i, i_eq = -1, i_ineq = -1;
isl_int *c;
return 1;
}
-int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
+int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
unsigned dim, isl_int *val)
{
int i;
if (set->n == 0)
return 0;
if (set->n == 1)
- return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
+ return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
dim, val);
isl_int_init(v);
isl_int_init(tmp);
- fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
+ fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
dim, &v);
for (i = 1; fixed == 1 && i < set->n; ++i) {
- fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
+ fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
dim, &tmp);
if (fixed == 1 && isl_int_ne(tmp, v))
fixed = 0;
isl_int *c;
};
+/* uset_gist depends on constraints without existentially quantified
+ * variables sorting first.
+ */
static int qsort_constraint_cmp(const void *p1, const void *p2)
{
const struct constraint *c1 = (const struct constraint *)p1;
const struct constraint *c2 = (const struct constraint *)p2;
+ int l1, l2;
unsigned size = isl_min(c1->size, c2->size);
+
+ l1 = isl_seq_last_non_zero(c1->c, size);
+ l2 = isl_seq_last_non_zero(c2->c, size);
+
+ if (l1 != l2)
+ return l1 - l2;
+
return isl_seq_cmp(c1->c, c2->c, size);
}
(struct isl_basic_map *)bset);
}
-int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
+int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
const __isl_keep isl_basic_map *bmap2)
{
int i, cmp;
if (bmap1 == bmap2)
return 0;
+ if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
+ ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
+ return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
return 0;
}
-int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
+int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
__isl_keep isl_basic_map *bmap2)
{
- return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
+ return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
}
-int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
+int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
__isl_keep isl_basic_set *bset2)
{
- return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
+ return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
(isl_basic_map *)bset2);
}
const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
- return isl_basic_map_fast_cmp(bmap1, bmap2);
+ return isl_basic_map_plain_cmp(bmap1, bmap2);
}
/* We normalize in place, but if anything goes wrong we need
if (!map)
return NULL;
for (i = map->n - 1; i >= 1; --i) {
- if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
+ if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
continue;
isl_basic_map_free(map->p[i-1]);
for (j = i; j < map->n; ++j)
return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
}
-int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
+int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
{
int i;
int equal;
goto error;
equal = map1->n == map2->n;
for (i = 0; equal && i < map1->n; ++i) {
- equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
+ equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
if (equal < 0)
goto error;
}
return -1;
}
-int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
+int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
+{
+ return isl_map_plain_is_equal(map1, map2);
+}
+
+int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
{
- return isl_map_fast_is_equal((struct isl_map *)set1,
+ return isl_map_plain_is_equal((struct isl_map *)set1,
(struct isl_map *)set2);
}
+int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
+{
+ return isl_set_plain_is_equal(set1, set2);
+}
+
/* Return an interval that ranges from min to max (inclusive)
*/
struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
/* Return the Cartesian product of the basic sets in list (in the given order).
*/
-struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
+__isl_give isl_basic_set *isl_basic_set_list_product(
+ __isl_take struct isl_basic_set_list *list)
{
int i;
unsigned dim;
bmap1->n_div + bmap2->n_div,
bmap1->n_eq + bmap2->n_eq,
bmap1->n_ineq + bmap2->n_ineq);
- bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
- bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
+ bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
+ bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
bmap = isl_basic_map_simplify(bmap);
return isl_basic_map_finalize(bmap);
error:
return NULL;
}
-/* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
- */
-struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
+__isl_give isl_basic_map *isl_basic_map_flat_product(
+ __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
+{
+ isl_basic_map *prod;
+
+ prod = isl_basic_map_product(bmap1, bmap2);
+ prod = isl_basic_map_flatten(prod);
+ return prod;
+}
+
+__isl_give isl_basic_set *isl_basic_set_flat_product(
+ __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
+{
+ return isl_basic_map_flat_product(bset1, bset2);
+}
+
+__isl_give isl_basic_map *isl_basic_map_range_product(
+ __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
+{
+ isl_dim *dim_result = NULL;
+ isl_basic_map *bmap;
+ unsigned in, out1, out2, nparam, total, pos;
+ struct isl_dim_map *dim_map1, *dim_map2;
+
+ if (!bmap1 || !bmap2)
+ goto error;
+
+ dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
+ isl_dim_copy(bmap2->dim));
+
+ in = isl_basic_map_dim(bmap1, isl_dim_in);
+ out1 = isl_basic_map_n_out(bmap1);
+ out2 = isl_basic_map_n_out(bmap2);
+ nparam = isl_basic_map_n_param(bmap1);
+
+ total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
+ dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
+ dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
+ isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
+ isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
+ isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
+ isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
+ isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
+ isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
+ isl_dim_map_div(dim_map1, bmap1, pos += out2);
+ isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
+
+ bmap = isl_basic_map_alloc_dim(dim_result,
+ bmap1->n_div + bmap2->n_div,
+ bmap1->n_eq + bmap2->n_eq,
+ bmap1->n_ineq + bmap2->n_ineq);
+ bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
+ bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
+ bmap = isl_basic_map_simplify(bmap);
+ return isl_basic_map_finalize(bmap);
+error:
+ isl_basic_map_free(bmap1);
+ isl_basic_map_free(bmap2);
+ return NULL;
+}
+
+__isl_give isl_basic_map *isl_basic_map_flat_range_product(
+ __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
+{
+ isl_basic_map *prod;
+
+ prod = isl_basic_map_range_product(bmap1, bmap2);
+ prod = isl_basic_map_flatten_range(prod);
+ return prod;
+}
+
+static __isl_give isl_map *map_product(__isl_take isl_map *map1,
+ __isl_take isl_map *map2,
+ __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
+ __isl_take isl_dim *right),
+ __isl_give isl_basic_map *(*basic_map_product)(
+ __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
{
unsigned flags = 0;
struct isl_map *result;
ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
ISL_FL_SET(flags, ISL_MAP_DISJOINT);
- result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
- isl_dim_copy(map2->dim)),
+ result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
+ isl_dim_copy(map2->dim)),
map1->n * map2->n, flags);
if (!result)
goto error;
for (i = 0; i < map1->n; ++i)
for (j = 0; j < map2->n; ++j) {
struct isl_basic_map *part;
- part = isl_basic_map_product(
- isl_basic_map_copy(map1->p[i]),
- isl_basic_map_copy(map2->p[j]));
+ part = basic_map_product(isl_basic_map_copy(map1->p[i]),
+ isl_basic_map_copy(map2->p[j]));
if (isl_basic_map_is_empty(part))
isl_basic_map_free(part);
else
return NULL;
}
+/* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
+ */
+struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
+{
+ return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
+}
+
/* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
*/
__isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
*/
struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
{
- return (struct isl_set *)isl_map_product((struct isl_map *)set1,
- (struct isl_map *)set2);
+ return isl_map_range_product(set1, set2);
}
__isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
}
-uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
+/* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
+ */
+__isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
+ __isl_take isl_map *map2)
+{
+ return map_product(map1, map2, &isl_dim_range_product,
+ &isl_basic_map_range_product);
+}
+
+/* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
+ */
+__isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
+ __isl_take isl_map *map2)
+{
+ isl_map *prod;
+
+ prod = isl_map_range_product(map1, map2);
+ prod = isl_map_flatten_range(prod);
+ return prod;
+}
+
+uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
{
int i;
uint32_t hash = isl_hash_init();
unsigned total;
- if (!bset)
+ if (!bmap)
return 0;
- bset = isl_basic_set_copy(bset);
- bset = isl_basic_set_normalize(bset);
- if (!bset)
+ bmap = isl_basic_map_copy(bmap);
+ bmap = isl_basic_map_normalize(bmap);
+ if (!bmap)
return 0;
- total = isl_basic_set_total_dim(bset);
- isl_hash_byte(hash, bset->n_eq & 0xFF);
- for (i = 0; i < bset->n_eq; ++i) {
+ total = isl_basic_map_total_dim(bmap);
+ isl_hash_byte(hash, bmap->n_eq & 0xFF);
+ for (i = 0; i < bmap->n_eq; ++i) {
uint32_t c_hash;
- c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
+ c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
isl_hash_hash(hash, c_hash);
}
- isl_hash_byte(hash, bset->n_ineq & 0xFF);
- for (i = 0; i < bset->n_ineq; ++i) {
+ isl_hash_byte(hash, bmap->n_ineq & 0xFF);
+ for (i = 0; i < bmap->n_ineq; ++i) {
uint32_t c_hash;
- c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
+ c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
isl_hash_hash(hash, c_hash);
}
- isl_hash_byte(hash, bset->n_div & 0xFF);
- for (i = 0; i < bset->n_div; ++i) {
+ isl_hash_byte(hash, bmap->n_div & 0xFF);
+ for (i = 0; i < bmap->n_div; ++i) {
uint32_t c_hash;
- if (isl_int_is_zero(bset->div[i][0]))
+ if (isl_int_is_zero(bmap->div[i][0]))
continue;
isl_hash_byte(hash, i & 0xFF);
- c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
+ c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
isl_hash_hash(hash, c_hash);
}
- isl_basic_set_free(bset);
+ isl_basic_map_free(bmap);
return hash;
}
-uint32_t isl_set_get_hash(struct isl_set *set)
+uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
+{
+ return isl_basic_map_get_hash((isl_basic_map *)bset);
+}
+
+uint32_t isl_map_get_hash(__isl_keep isl_map *map)
{
int i;
uint32_t hash;
- if (!set)
+ if (!map)
return 0;
- set = isl_set_copy(set);
- set = isl_set_normalize(set);
- if (!set)
+ map = isl_map_copy(map);
+ map = isl_map_normalize(map);
+ if (!map)
return 0;
hash = isl_hash_init();
- for (i = 0; i < set->n; ++i) {
- uint32_t bset_hash;
- bset_hash = isl_basic_set_get_hash(set->p[i]);
- isl_hash_hash(hash, bset_hash);
+ for (i = 0; i < map->n; ++i) {
+ uint32_t bmap_hash;
+ bmap_hash = isl_basic_map_get_hash(map->p[i]);
+ isl_hash_hash(hash, bmap_hash);
}
- isl_set_free(set);
+ isl_map_free(map);
return hash;
}
+uint32_t isl_set_get_hash(__isl_keep isl_set *set)
+{
+ return isl_map_get_hash((isl_map *)set);
+}
+
/* Check if the value for dimension dim is completely determined
* by the values of the other parameters and variables.
* That is, check if dimension dim is involved in an equality.
if (!bset)
return NULL;
- if (bset->n_div == 0)
- return bset;
-
bset = isl_basic_set_cow(bset);
if (!bset)
return NULL;
dim = isl_basic_set_get_dim(bset);
- dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
+ dim = isl_dim_lift(dim, bset->n_div);
if (!dim)
goto error;
isl_dim_free(bset->dim);
bset->dim = dim;
+ bset->extra -= bset->n_div;
bset->n_div = 0;
bset = isl_basic_set_finalize(bset);
if (!set)
return NULL;
- if (set->n == 0 || set->p[0]->n_div == 0)
- return set;
set = isl_set_cow(set);
if (!set)
n_div = set->p[0]->n_div;
dim = isl_set_get_dim(set);
- dim = isl_dim_add(dim, isl_dim_set, n_div);
+ dim = isl_dim_lift(dim, n_div);
if (!dim)
goto error;
isl_dim_free(set->dim);
dim = isl_set_get_dim(set);
if (set->n == 0 || set->p[0]->n_div == 0) {
isl_set_free(set);
- return isl_map_identity(dim);
+ return isl_map_identity(isl_dim_map_from_set(dim));
}
n_div = set->p[0]->n_div;
- dim = isl_dim_map(dim);
+ dim = isl_dim_map_from_set(dim);
n_param = isl_dim_size(dim, isl_dim_param);
n_set = isl_dim_size(dim, isl_dim_in);
dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
}
isl_set_free(set);
+ bmap = isl_basic_map_simplify(bmap);
+ bmap = isl_basic_map_finalize(bmap);
return isl_map_from_basic_map(bmap);
error:
isl_set_free(set);
return isl_basic_set_vars_get_sign(bset, first, n, signs);
}
+/* Check if the given basic map is obviously single-valued.
+ * In particular, for each output dimension, check that there is
+ * an equality that defines the output dimension in terms of
+ * earlier dimensions.
+ */
+int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
+{
+ int i, j;
+ unsigned total;
+ unsigned n_out;
+ unsigned o_out;
+
+ if (!bmap)
+ return -1;
+
+ total = 1 + isl_basic_map_total_dim(bmap);
+ n_out = isl_basic_map_dim(bmap, isl_dim_out);
+ o_out = isl_basic_map_offset(bmap, isl_dim_out);
+
+ for (i = 0; i < n_out; ++i) {
+ for (j = 0; j < bmap->n_eq; ++j) {
+ if (isl_int_is_zero(bmap->eq[j][o_out + i]))
+ continue;
+ if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
+ total - (o_out + i + 1)) == -1)
+ break;
+ }
+ if (j >= bmap->n_eq)
+ return 0;
+ }
+
+ return 1;
+}
+
+/* Check if the given map is obviously single-valued.
+ */
+int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
+{
+ if (!map)
+ return -1;
+ if (map->n == 0)
+ return 1;
+ if (map->n >= 2)
+ return 0;
+
+ return isl_basic_map_plain_is_single_valued(map->p[0]);
+}
+
/* Check if the given map is single-valued.
* We simply compute
*
*/
int isl_map_is_single_valued(__isl_keep isl_map *map)
{
+ isl_dim *dim;
isl_map *test;
isl_map *id;
int sv;
+ sv = isl_map_plain_is_single_valued(map);
+ if (sv < 0 || sv)
+ return sv;
+
test = isl_map_reverse(isl_map_copy(map));
test = isl_map_apply_range(test, isl_map_copy(map));
- id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
+ dim = isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map)));
+ id = isl_map_identity(dim);
sv = isl_map_is_subset(test, id);
return sv;
}
+int isl_map_is_injective(__isl_keep isl_map *map)
+{
+ int in;
+
+ map = isl_map_copy(map);
+ map = isl_map_reverse(map);
+ in = isl_map_is_single_valued(map);
+ isl_map_free(map);
+
+ return in;
+}
+
+/* Check if the given map is obviously injective.
+ */
+int isl_map_plain_is_injective(__isl_keep isl_map *map)
+{
+ int in;
+
+ map = isl_map_copy(map);
+ map = isl_map_reverse(map);
+ in = isl_map_plain_is_single_valued(map);
+ isl_map_free(map);
+
+ return in;
+}
+
int isl_map_is_bijective(__isl_keep isl_map *map)
{
int sv;
if (sv < 0 || !sv)
return sv;
- map = isl_map_copy(map);
- map = isl_map_reverse(map);
- sv = isl_map_is_single_valued(map);
- isl_map_free(map);
-
- return sv;
+ return isl_map_is_injective(map);
}
int isl_set_is_singleton(__isl_keep isl_set *set)
return NULL;
}
+__isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
+{
+ return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
+}
+
+__isl_give isl_basic_map *isl_basic_map_flatten_range(
+ __isl_take isl_basic_map *bmap)
+{
+ if (!bmap)
+ return NULL;
+
+ if (!bmap->dim->nested[1])
+ return bmap;
+
+ bmap = isl_basic_map_cow(bmap);
+ if (!bmap)
+ return NULL;
+
+ bmap->dim = isl_dim_flatten_range(bmap->dim);
+ if (!bmap->dim)
+ goto error;
+
+ bmap = isl_basic_map_finalize(bmap);
+
+ return bmap;
+error:
+ isl_basic_map_free(bmap);
+ return NULL;
+}
+
__isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
{
int i;
return (isl_set *)isl_map_flatten((isl_map *)set);
}
-/* Extend the given dim_map with mappings for the divs in bmap.
- */
-static __isl_give struct isl_dim_map *extend_dim_map(
- __isl_keep struct isl_dim_map *dim_map,
- __isl_keep isl_basic_map *bmap)
+__isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
{
- int i;
- struct isl_dim_map *res;
- int offset;
-
- offset = isl_basic_map_offset(bmap, isl_dim_div);
-
- res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
- if (!res)
- return NULL;
+ isl_dim *dim, *flat_dim;
+ isl_map *map;
- for (i = 0; i < dim_map->len; ++i)
- res->pos[i] = dim_map->pos[i];
- for (i = 0; i < bmap->n_div; ++i)
- res->pos[dim_map->len + i] = offset + i;
+ dim = isl_set_get_dim(set);
+ flat_dim = isl_dim_flatten(isl_dim_copy(dim));
+ map = isl_map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
+ map = isl_map_intersect_domain(map, set);
- return res;
+ return map;
}
-/* Extract a dim_map from a reordering.
- * We essentially need to reverse the mapping, and add an offset
- * of 1 for the constant term.
- */
-__isl_give struct isl_dim_map *isl_dim_map_from_reordering(
- __isl_keep isl_reordering *exp)
+__isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
{
int i;
- struct isl_dim_map *dim_map;
- if (!exp)
+ if (!map)
return NULL;
- dim_map = isl_dim_map_alloc(exp->dim->ctx, isl_dim_total(exp->dim));
- if (!dim_map)
+ if (!map->dim->nested[1])
+ return map;
+
+ map = isl_map_cow(map);
+ if (!map)
return NULL;
- for (i = 0; i < exp->len; ++i)
- dim_map->pos[1 + exp->pos[i]] = 1 + i;
+ for (i = 0; i < map->n; ++i) {
+ map->p[i] = isl_basic_map_flatten_range(map->p[i]);
+ if (!map->p[i])
+ goto error;
+ }
+ map->dim = isl_dim_flatten_range(map->dim);
+ if (!map->dim)
+ goto error;
- return dim_map;
+ return map;
+error:
+ isl_map_free(map);
+ return NULL;
}
/* Reorder the dimensions of "bmap" according to the given dim_map
res = isl_basic_map_alloc_dim(dim,
bmap->n_div, bmap->n_eq, bmap->n_ineq);
- res = add_constraints_dim_map(res, bmap, dim_map);
+ res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
res = isl_basic_map_finalize(res);
return res;
error:
for (i = 0; i < map->n; ++i) {
struct isl_dim_map *dim_map_i;
- dim_map_i = extend_dim_map(dim_map, map->p[i]);
+ dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
map->p[i] = isl_basic_map_realign(map->p[i],
isl_dim_copy(r->dim), dim_map_i);
return (isl_set *)isl_map_realign((isl_map *)set, r);
}
+__isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
+ __isl_take isl_dim *model)
+{
+ isl_ctx *ctx;
+
+ if (!map || !model)
+ goto error;
+
+ ctx = isl_dim_get_ctx(model);
+ if (!isl_dim_has_named_params(model))
+ isl_die(ctx, isl_error_invalid,
+ "model has unnamed parameters", goto error);
+ if (!isl_dim_has_named_params(map->dim))
+ isl_die(ctx, isl_error_invalid,
+ "relation has unnamed parameters", goto error);
+ if (!isl_dim_match(map->dim, isl_dim_param, model, isl_dim_param)) {
+ isl_reordering *exp;
+
+ model = isl_dim_drop(model, isl_dim_in,
+ 0, isl_dim_size(model, isl_dim_in));
+ model = isl_dim_drop(model, isl_dim_out,
+ 0, isl_dim_size(model, isl_dim_out));
+ exp = isl_parameter_alignment_reordering(map->dim, model);
+ exp = isl_reordering_extend_dim(exp, isl_map_get_dim(map));
+ map = isl_map_realign(map, exp);
+ }
+
+ isl_dim_free(model);
+ return map;
+error:
+ isl_dim_free(model);
+ isl_map_free(map);
+ return NULL;
+}
+
+__isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
+ __isl_take isl_dim *model)
+{
+ return isl_map_align_params(set, model);
+}
+
__isl_give isl_mat *isl_basic_map_equalities_matrix(
__isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
enum isl_dim_type c2, enum isl_dim_type c3,
eq->n_row, ineq->n_row);
if (!bmap)
goto error;
- for (i = 0; i < extra; ++i)
- if (isl_basic_map_alloc_div(bmap) < 0)
+ for (i = 0; i < extra; ++i) {
+ k = isl_basic_map_alloc_div(bmap);
+ if (k < 0)
goto error;
+ isl_int_set_si(bmap->div[k][0], 0);
+ }
for (i = 0; i < eq->n_row; ++i) {
l = isl_basic_map_alloc_equality(bmap);
if (l < 0)
return NULL;
}
+__isl_give isl_mat *isl_basic_set_equalities_matrix(
+ __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
+ enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
+{
+ return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
+ c1, c2, c3, c4, isl_dim_in);
+}
+
+__isl_give isl_mat *isl_basic_set_inequalities_matrix(
+ __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
+ enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
+{
+ return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
+ c1, c2, c3, c4, isl_dim_in);
+}
+
__isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
__isl_take isl_dim *dim,
__isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
isl_basic_map_from_constraint_matrices(dim, eq, ineq,
c1, c2, c3, c4, isl_dim_in);
}
+
+int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
+{
+ if (!bmap)
+ return -1;
+
+ return isl_dim_can_zip(bmap->dim);
+}
+
+int isl_map_can_zip(__isl_keep isl_map *map)
+{
+ if (!map)
+ return -1;
+
+ return isl_dim_can_zip(map->dim);
+}
+
+/* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
+ * (A -> C) -> (B -> D).
+ */
+__isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
+{
+ unsigned pos;
+ unsigned n1;
+ unsigned n2;
+
+ if (!bmap)
+ return NULL;
+
+ if (!isl_basic_map_can_zip(bmap))
+ isl_die(bmap->ctx, isl_error_invalid,
+ "basic map cannot be zipped", goto error);
+ pos = isl_basic_map_offset(bmap, isl_dim_in) +
+ isl_dim_size(bmap->dim->nested[0], isl_dim_in);
+ n1 = isl_dim_size(bmap->dim->nested[0], isl_dim_out);
+ n2 = isl_dim_size(bmap->dim->nested[1], isl_dim_in);
+ bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
+ if (!bmap)
+ return NULL;
+ bmap->dim = isl_dim_zip(bmap->dim);
+ if (!bmap->dim)
+ goto error;
+ return bmap;
+error:
+ isl_basic_map_free(bmap);
+ return NULL;
+}
+
+/* Given a map (A -> B) -> (C -> D), return the corresponding map
+ * (A -> C) -> (B -> D).
+ */
+__isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
+{
+ int i;
+
+ if (!map)
+ return NULL;
+
+ if (!isl_map_can_zip(map))
+ isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
+ goto error);
+
+ map = isl_map_cow(map);
+ if (!map)
+ return NULL;
+
+ for (i = 0; i < map->n; ++i) {
+ map->p[i] = isl_basic_map_zip(map->p[i]);
+ if (!map->p[i])
+ goto error;
+ }
+
+ map->dim = isl_dim_zip(map->dim);
+ if (!map->dim)
+ goto error;
+
+ return map;
+error:
+ isl_map_free(map);
+ return NULL;
+}
+
+/* Construct a basic map mapping the domain of the affine expression
+ * to a one-dimensional range prescribed by the affine expression.
+ */
+__isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
+{
+ int k;
+ int pos;
+ isl_local_space *ls;
+ isl_basic_map *bmap;
+
+ if (!aff)
+ return NULL;
+
+ ls = isl_aff_get_local_space(aff);
+ ls = isl_local_space_from_domain(ls);
+ ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
+ bmap = isl_basic_map_from_local_space(ls);
+ bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
+ k = isl_basic_map_alloc_equality(bmap);
+ if (k < 0)
+ goto error;
+
+ pos = isl_basic_map_offset(bmap, isl_dim_out);
+ isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
+ isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
+ isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
+ aff->v->size - (pos + 1));
+
+ isl_aff_free(aff);
+ bmap = isl_basic_map_finalize(bmap);
+ return bmap;
+error:
+ isl_aff_free(aff);
+ isl_basic_map_free(bmap);
+ return NULL;
+}
+
+/* Construct a basic map mapping a domain in the given space to
+ * to an n-dimensional range, with n the number of elements in the list,
+ * where each coordinate in the range is prescribed by the
+ * corresponding affine expression.
+ * The domains of all affine expressions in the list are assumed to match
+ * domain_dim.
+ */
+__isl_give isl_basic_map *isl_basic_map_from_aff_list(
+ __isl_take isl_dim *domain_dim, __isl_take isl_aff_list *list)
+{
+ int i;
+ isl_dim *dim;
+ isl_basic_map *bmap;
+
+ if (!list)
+ return NULL;
+
+ dim = isl_dim_from_domain(domain_dim);
+ bmap = isl_basic_map_universe(dim);
+
+ for (i = 0; i < list->n; ++i) {
+ isl_aff *aff;
+ isl_basic_map *bmap_i;
+
+ aff = isl_aff_copy(list->p[i]);
+ bmap_i = isl_basic_map_from_aff(aff);
+
+ bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
+ }
+
+ isl_aff_list_free(list);
+ return bmap;
+}
projects / platform / upstream / isl.git / blobdiff