add isl_union_access_info_read_from_file
[isl.git] / isl_dim_map.c
blobcc104c65e06a351e31d6bb2a191f07d5fdc294fa
1 /*
2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010-2011 INRIA Saclay
5 * Use of this software is governed by the MIT license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
13 #include <isl_map_private.h>
14 #include <isl_space_private.h>
15 #include <isl_dim_map.h>
16 #include <isl_reordering.h>
18 struct isl_dim_map_entry {
19 int pos;
20 int sgn;
23 /* Maps dst positions to src positions */
24 struct isl_dim_map {
25 unsigned len;
26 struct isl_dim_map_entry m[1];
29 __isl_give isl_dim_map *isl_dim_map_alloc(isl_ctx *ctx, unsigned len)
31 int i;
32 struct isl_dim_map *dim_map;
33 dim_map = isl_alloc(ctx, struct isl_dim_map,
34 sizeof(struct isl_dim_map) + len * sizeof(struct isl_dim_map_entry));
35 if (!dim_map)
36 return NULL;
37 dim_map->len = 1 + len;
38 dim_map->m[0].pos = 0;
39 dim_map->m[0].sgn = 1;
40 for (i = 0; i < len; ++i)
41 dim_map->m[1 + i].sgn = 0;
42 return dim_map;
45 void isl_dim_map_range(__isl_keep isl_dim_map *dim_map,
46 unsigned dst_pos, int dst_stride, unsigned src_pos, int src_stride,
47 unsigned n, int sign)
49 int i;
51 if (!dim_map)
52 return;
54 for (i = 0; i < n; ++i) {
55 unsigned d = 1 + dst_pos + dst_stride * i;
56 unsigned s = 1 + src_pos + src_stride * i;
57 dim_map->m[d].pos = s;
58 dim_map->m[d].sgn = sign;
62 void isl_dim_map_dim_range(__isl_keep isl_dim_map *dim_map,
63 __isl_keep isl_space *dim, enum isl_dim_type type,
64 unsigned first, unsigned n, unsigned dst_pos)
66 int i;
67 unsigned src_pos;
69 if (!dim_map || !dim)
70 return;
72 src_pos = 1 + isl_space_offset(dim, type);
73 for (i = 0; i < n; ++i) {
74 dim_map->m[1 + dst_pos + i].pos = src_pos + first + i;
75 dim_map->m[1 + dst_pos + i].sgn = 1;
79 void isl_dim_map_dim(__isl_keep isl_dim_map *dim_map, __isl_keep isl_space *dim,
80 enum isl_dim_type type, unsigned dst_pos)
82 isl_dim_map_dim_range(dim_map, dim, type,
83 0, isl_space_dim(dim, type), dst_pos);
86 void isl_dim_map_div(__isl_keep isl_dim_map *dim_map,
87 __isl_keep isl_basic_map *bmap, unsigned dst_pos)
89 int i;
90 unsigned src_pos;
92 if (!dim_map || !bmap)
93 return;
95 src_pos = 1 + isl_space_dim(bmap->dim, isl_dim_all);
96 for (i = 0; i < bmap->n_div; ++i) {
97 dim_map->m[1 + dst_pos + i].pos = src_pos + i;
98 dim_map->m[1 + dst_pos + i].sgn = 1;
102 void isl_dim_map_dump(struct isl_dim_map *dim_map)
104 int i;
106 for (i = 0; i < dim_map->len; ++i)
107 fprintf(stderr, "%d -> %d * %d; ", i,
108 dim_map->m[i].sgn, dim_map->m[i].pos);
109 fprintf(stderr, "\n");
112 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
113 struct isl_dim_map *dim_map)
115 int i;
117 for (i = 0; i < dim_map->len; ++i) {
118 if (dim_map->m[i].sgn == 0)
119 isl_int_set_si(dst[i], 0);
120 else if (dim_map->m[i].sgn > 0)
121 isl_int_set(dst[i], src[dim_map->m[i].pos]);
122 else
123 isl_int_neg(dst[i], src[dim_map->m[i].pos]);
127 static void copy_div_dim_map(isl_int *dst, isl_int *src,
128 struct isl_dim_map *dim_map)
130 isl_int_set(dst[0], src[0]);
131 copy_constraint_dim_map(dst+1, src+1, dim_map);
134 __isl_give isl_basic_map *isl_basic_map_add_constraints_dim_map(
135 __isl_take isl_basic_map *dst, __isl_take isl_basic_map *src,
136 __isl_take isl_dim_map *dim_map)
138 int i;
140 if (!src || !dst || !dim_map)
141 goto error;
143 for (i = 0; i < src->n_eq; ++i) {
144 int i1 = isl_basic_map_alloc_equality(dst);
145 if (i1 < 0)
146 goto error;
147 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
150 for (i = 0; i < src->n_ineq; ++i) {
151 int i1 = isl_basic_map_alloc_inequality(dst);
152 if (i1 < 0)
153 goto error;
154 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
157 for (i = 0; i < src->n_div; ++i) {
158 int i1 = isl_basic_map_alloc_div(dst);
159 if (i1 < 0)
160 goto error;
161 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
164 free(dim_map);
165 isl_basic_map_free(src);
167 return dst;
168 error:
169 free(dim_map);
170 isl_basic_map_free(src);
171 isl_basic_map_free(dst);
172 return NULL;
175 __isl_give isl_basic_set *isl_basic_set_add_constraints_dim_map(
176 __isl_take isl_basic_set *dst, __isl_take isl_basic_set *src,
177 __isl_take isl_dim_map *dim_map)
179 return isl_basic_map_add_constraints_dim_map(dst, src, dim_map);
182 /* Extend the given dim_map with mappings for the divs in bmap.
184 __isl_give isl_dim_map *isl_dim_map_extend(__isl_keep isl_dim_map *dim_map,
185 __isl_keep isl_basic_map *bmap)
187 int i;
188 struct isl_dim_map *res;
189 int offset;
191 if (!dim_map)
192 return NULL;
194 offset = isl_basic_map_offset(bmap, isl_dim_div);
196 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
197 if (!res)
198 return NULL;
200 for (i = 0; i < dim_map->len; ++i)
201 res->m[i] = dim_map->m[i];
202 for (i = 0; i < bmap->n_div; ++i) {
203 res->m[dim_map->len + i].pos = offset + i;
204 res->m[dim_map->len + i].sgn = 1;
207 return res;
210 /* Extract a dim_map from a reordering.
211 * We essentially need to reverse the mapping, and add an offset
212 * of 1 for the constant term.
214 __isl_give isl_dim_map *isl_dim_map_from_reordering(
215 __isl_keep isl_reordering *exp)
217 int i;
218 isl_ctx *ctx;
219 struct isl_dim_map *dim_map;
221 if (!exp)
222 return NULL;
224 ctx = isl_space_get_ctx(exp->dim);
225 dim_map = isl_dim_map_alloc(ctx, isl_space_dim(exp->dim, isl_dim_all));
226 if (!dim_map)
227 return NULL;
229 for (i = 0; i < exp->len; ++i) {
230 dim_map->m[1 + exp->pos[i]].pos = 1 + i;
231 dim_map->m[1 + exp->pos[i]].sgn = 1;
234 return dim_map;