1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
| /*
* Copyright 2010 INRIA Saclay
*
* Use of this software is governed by the MIT license
*
* Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
* Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
* 91893 Orsay, France
*/
#include <isl_ctx_private.h>
#include <isl/id.h>
#include <isl_space_private.h>
#include <isl_reordering.h>
__isl_give isl_reordering *isl_reordering_alloc(isl_ctx *ctx, int len)
{
isl_reordering *exp;
exp = isl_alloc(ctx, struct isl_reordering,
sizeof(struct isl_reordering) + (len - 1) * sizeof(int));
if (!exp)
return NULL;
exp->ref = 1;
exp->len = len;
exp->space = NULL;
return exp;
}
__isl_give isl_reordering *isl_reordering_copy(__isl_keep isl_reordering *exp)
{
if (!exp)
return NULL;
exp->ref++;
return exp;
}
__isl_give isl_reordering *isl_reordering_dup(__isl_keep isl_reordering *r)
{
int i;
isl_reordering *dup;
if (!r)
return NULL;
dup = isl_reordering_alloc(isl_reordering_get_ctx(r), r->len);
if (!dup)
return NULL;
dup->space = isl_reordering_get_space(r);
if (!dup->space)
return isl_reordering_free(dup);
for (i = 0; i < dup->len; ++i)
dup->pos[i] = r->pos[i];
return dup;
}
__isl_give isl_reordering *isl_reordering_cow(__isl_take isl_reordering *r)
{
if (!r)
return NULL;
if (r->ref == 1)
return r;
r->ref--;
return isl_reordering_dup(r);
}
__isl_null isl_reordering *isl_reordering_free(__isl_take isl_reordering *exp)
{
if (!exp)
return NULL;
if (--exp->ref > 0)
return NULL;
isl_space_free(exp->space);
free(exp);
return NULL;
}
/* Return the isl_ctx to which "r" belongs.
*/
isl_ctx *isl_reordering_get_ctx(__isl_keep isl_reordering *r)
{
return isl_space_get_ctx(isl_reordering_peek_space(r));
}
/* Return the space of "r".
*/
__isl_keep isl_space *isl_reordering_peek_space(__isl_keep isl_reordering *r)
{
if (!r)
return NULL;
return r->space;
}
/* Return a copy of the space of "r".
*/
__isl_give isl_space *isl_reordering_get_space(__isl_keep isl_reordering *r)
{
return isl_space_copy(isl_reordering_peek_space(r));
}
/* Construct a reordering that maps the parameters of "alignee"
* to the corresponding parameters in a new dimension specification
* that has the parameters of "aligner" first, followed by
* any remaining parameters of "alignee" that do not occur in "aligner".
*/
__isl_give isl_reordering *isl_parameter_alignment_reordering(
__isl_keep isl_space *alignee, __isl_keep isl_space *aligner)
{
int i, j;
isl_reordering *exp;
if (!alignee || !aligner)
return NULL;
exp = isl_reordering_alloc(alignee->ctx, alignee->nparam);
if (!exp)
return NULL;
exp->space = isl_space_params(isl_space_copy(aligner));
for (i = 0; i < alignee->nparam; ++i) {
isl_id *id_i;
id_i = isl_space_get_dim_id(alignee, isl_dim_param, i);
if (!id_i)
isl_die(alignee->ctx, isl_error_invalid,
"cannot align unnamed parameters", goto error);
for (j = 0; j < aligner->nparam; ++j) {
isl_id *id_j;
id_j = isl_space_get_dim_id(aligner, isl_dim_param, j);
isl_id_free(id_j);
if (id_i == id_j)
break;
}
if (j < aligner->nparam) {
exp->pos[i] = j;
isl_id_free(id_i);
} else {
int pos;
pos = isl_space_dim(exp->space, isl_dim_param);
exp->space = isl_space_add_dims(exp->space,
isl_dim_param, 1);
exp->space = isl_space_set_dim_id(exp->space,
isl_dim_param, pos, id_i);
exp->pos[i] = pos;
}
}
if (!exp->space)
return isl_reordering_free(exp);
return exp;
error:
isl_reordering_free(exp);
return NULL;
}
__isl_give isl_reordering *isl_reordering_extend(__isl_take isl_reordering *exp,
unsigned extra)
{
int i;
isl_ctx *ctx;
isl_space *space;
isl_reordering *res;
int offset;
if (!exp)
return NULL;
if (extra == 0)
return exp;
ctx = isl_reordering_get_ctx(exp);
space = isl_reordering_peek_space(exp);
offset = isl_space_dim(space, isl_dim_all) - exp->len;
res = isl_reordering_alloc(ctx, exp->len + extra);
if (!res)
goto error;
res->space = isl_reordering_get_space(exp);
for (i = 0; i < exp->len; ++i)
res->pos[i] = exp->pos[i];
for (i = exp->len; i < res->len; ++i)
res->pos[i] = offset + i;
isl_reordering_free(exp);
return res;
error:
isl_reordering_free(exp);
return NULL;
}
__isl_give isl_reordering *isl_reordering_extend_space(
__isl_take isl_reordering *exp, __isl_take isl_space *space)
{
isl_space *exp_space;
isl_reordering *res;
if (!exp || !space)
goto error;
res = isl_reordering_extend(isl_reordering_copy(exp),
isl_space_dim(space, isl_dim_all) - exp->len);
res = isl_reordering_cow(res);
if (!res)
goto error;
isl_space_free(res->space);
exp_space = isl_reordering_peek_space(exp);
res->space = isl_space_replace_params(space, exp_space);
isl_reordering_free(exp);
if (!res->space)
return isl_reordering_free(res);
return res;
error:
isl_reordering_free(exp);
isl_space_free(space);
return NULL;
}
void isl_reordering_dump(__isl_keep isl_reordering *exp)
{
int i;
isl_space_dump(exp->space);
for (i = 0; i < exp->len; ++i)
fprintf(stderr, "%d -> %d; ", i, exp->pos[i]);
fprintf(stderr, "\n");
}
|