clean up isl_basic_set_variable_compression_with_id
[isl.git] / isl_reordering.c
blob5ce9cab0284725297e655bb626febfb22b4b9a86
1 /*
2 * Copyright 2010 INRIA Saclay
4 * Use of this software is governed by the MIT license
6 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
7 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
8 * 91893 Orsay, France
9 */
11 #include <isl_ctx_private.h>
12 #include <isl/id.h>
13 #include <isl_space_private.h>
14 #include <isl_reordering.h>
16 __isl_give isl_reordering *isl_reordering_alloc(isl_ctx *ctx, int len)
18 isl_reordering *exp;
20 exp = isl_alloc(ctx, struct isl_reordering,
21 sizeof(struct isl_reordering) + (len - 1) * sizeof(int));
22 if (!exp)
23 return NULL;
25 exp->ref = 1;
26 exp->len = len;
27 exp->space = NULL;
29 return exp;
32 __isl_give isl_reordering *isl_reordering_copy(__isl_keep isl_reordering *exp)
34 if (!exp)
35 return NULL;
37 exp->ref++;
38 return exp;
41 __isl_give isl_reordering *isl_reordering_dup(__isl_keep isl_reordering *r)
43 int i;
44 isl_reordering *dup;
46 if (!r)
47 return NULL;
49 dup = isl_reordering_alloc(isl_reordering_get_ctx(r), r->len);
50 if (!dup)
51 return NULL;
53 dup->space = isl_reordering_get_space(r);
54 if (!dup->space)
55 return isl_reordering_free(dup);
56 for (i = 0; i < dup->len; ++i)
57 dup->pos[i] = r->pos[i];
59 return dup;
62 __isl_give isl_reordering *isl_reordering_cow(__isl_take isl_reordering *r)
64 if (!r)
65 return NULL;
67 if (r->ref == 1)
68 return r;
69 r->ref--;
70 return isl_reordering_dup(r);
73 __isl_null isl_reordering *isl_reordering_free(__isl_take isl_reordering *exp)
75 if (!exp)
76 return NULL;
78 if (--exp->ref > 0)
79 return NULL;
81 isl_space_free(exp->space);
82 free(exp);
83 return NULL;
86 /* Return the isl_ctx to which "r" belongs.
88 isl_ctx *isl_reordering_get_ctx(__isl_keep isl_reordering *r)
90 return isl_space_get_ctx(isl_reordering_peek_space(r));
93 /* Return the space of "r".
95 __isl_keep isl_space *isl_reordering_peek_space(__isl_keep isl_reordering *r)
97 if (!r)
98 return NULL;
99 return r->space;
102 /* Return a copy of the space of "r".
104 __isl_give isl_space *isl_reordering_get_space(__isl_keep isl_reordering *r)
106 return isl_space_copy(isl_reordering_peek_space(r));
109 /* Construct a reordering that maps the parameters of "alignee"
110 * to the corresponding parameters in a new dimension specification
111 * that has the parameters of "aligner" first, followed by
112 * any remaining parameters of "alignee" that do not occur in "aligner".
114 __isl_give isl_reordering *isl_parameter_alignment_reordering(
115 __isl_keep isl_space *alignee, __isl_keep isl_space *aligner)
117 int i, j;
118 isl_reordering *exp;
120 if (!alignee || !aligner)
121 return NULL;
123 exp = isl_reordering_alloc(alignee->ctx, alignee->nparam);
124 if (!exp)
125 return NULL;
127 exp->space = isl_space_params(isl_space_copy(aligner));
129 for (i = 0; i < alignee->nparam; ++i) {
130 isl_id *id_i;
131 id_i = isl_space_get_dim_id(alignee, isl_dim_param, i);
132 if (!id_i)
133 isl_die(alignee->ctx, isl_error_invalid,
134 "cannot align unnamed parameters", goto error);
135 for (j = 0; j < aligner->nparam; ++j) {
136 isl_id *id_j;
137 id_j = isl_space_get_dim_id(aligner, isl_dim_param, j);
138 isl_id_free(id_j);
139 if (id_i == id_j)
140 break;
142 if (j < aligner->nparam) {
143 exp->pos[i] = j;
144 isl_id_free(id_i);
145 } else {
146 isl_size pos;
147 pos = isl_space_dim(exp->space, isl_dim_param);
148 if (pos < 0)
149 exp->space = isl_space_free(exp->space);
150 exp->space = isl_space_add_dims(exp->space,
151 isl_dim_param, 1);
152 exp->space = isl_space_set_dim_id(exp->space,
153 isl_dim_param, pos, id_i);
154 exp->pos[i] = pos;
158 if (!exp->space)
159 return isl_reordering_free(exp);
160 return exp;
161 error:
162 isl_reordering_free(exp);
163 return NULL;
166 __isl_give isl_reordering *isl_reordering_extend(__isl_take isl_reordering *exp,
167 unsigned extra)
169 int i;
170 isl_ctx *ctx;
171 isl_space *space;
172 isl_reordering *res;
173 int offset;
174 isl_size dim;
176 if (!exp)
177 return NULL;
178 if (extra == 0)
179 return exp;
181 ctx = isl_reordering_get_ctx(exp);
182 space = isl_reordering_peek_space(exp);
183 dim = isl_space_dim(space, isl_dim_all);
184 if (dim < 0)
185 return isl_reordering_free(exp);
186 offset = dim - exp->len;
187 res = isl_reordering_alloc(ctx, exp->len + extra);
188 if (!res)
189 goto error;
190 res->space = isl_reordering_get_space(exp);
191 for (i = 0; i < exp->len; ++i)
192 res->pos[i] = exp->pos[i];
193 for (i = exp->len; i < res->len; ++i)
194 res->pos[i] = offset + i;
196 isl_reordering_free(exp);
198 return res;
199 error:
200 isl_reordering_free(exp);
201 return NULL;
204 __isl_give isl_reordering *isl_reordering_extend_space(
205 __isl_take isl_reordering *exp, __isl_take isl_space *space)
207 isl_space *exp_space;
208 isl_reordering *res;
209 isl_size dim;
211 dim = isl_space_dim(space, isl_dim_all);
212 if (!exp || dim < 0)
213 goto error;
215 res = isl_reordering_extend(isl_reordering_copy(exp), dim - exp->len);
216 res = isl_reordering_cow(res);
217 if (!res)
218 goto error;
219 isl_space_free(res->space);
220 exp_space = isl_reordering_peek_space(exp);
221 res->space = isl_space_replace_params(space, exp_space);
223 isl_reordering_free(exp);
225 if (!res->space)
226 return isl_reordering_free(res);
228 return res;
229 error:
230 isl_reordering_free(exp);
231 isl_space_free(space);
232 return NULL;
235 void isl_reordering_dump(__isl_keep isl_reordering *exp)
237 int i;
239 isl_space_dump(exp->space);
240 for (i = 0; i < exp->len; ++i)
241 fprintf(stderr, "%d -> %d; ", i, exp->pos[i]);
242 fprintf(stderr, "\n");