This repository has been archived by the owner on Dec 10, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2
/
isl_bound.c
331 lines (264 loc) · 8.69 KB
/
isl_bound.c
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
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
/*
* 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_map_private.h>
#include <isl_bound.h>
#include <isl_bernstein.h>
#include <isl_range.h>
#include <isl_polynomial_private.h>
#include <isl_options_private.h>
/* Compute a bound on the polynomial defined over the parametric polytope
* using either range propagation or bernstein expansion and
* store the result in bound->pwf and bound->pwf_tight.
* Since bernstein expansion requires bounded domains, we apply
* range propagation on unbounded domains. Otherwise, we respect the choice
* of the user.
*/
static isl_stat compressed_guarded_poly_bound(__isl_take isl_basic_set *bset,
__isl_take isl_qpolynomial *poly, void *user)
{
struct isl_bound *bound = (struct isl_bound *)user;
int bounded;
if (!bset || !poly)
goto error;
if (bset->ctx->opt->bound == ISL_BOUND_RANGE)
return isl_qpolynomial_bound_on_domain_range(bset, poly, bound);
bounded = isl_basic_set_is_bounded(bset);
if (bounded < 0)
goto error;
if (bounded)
return isl_qpolynomial_bound_on_domain_bernstein(bset, poly, bound);
else
return isl_qpolynomial_bound_on_domain_range(bset, poly, bound);
error:
isl_basic_set_free(bset);
isl_qpolynomial_free(poly);
return -1;
}
static isl_stat unwrapped_guarded_poly_bound(__isl_take isl_basic_set *bset,
__isl_take isl_qpolynomial *poly, void *user)
{
struct isl_bound *bound = (struct isl_bound *)user;
isl_pw_qpolynomial_fold *top_pwf;
isl_pw_qpolynomial_fold *top_pwf_tight;
isl_space *dim;
isl_morph *morph;
isl_stat r;
bset = isl_basic_set_detect_equalities(bset);
if (!bset)
goto error;
if (bset->n_eq == 0)
return compressed_guarded_poly_bound(bset, poly, user);
morph = isl_basic_set_full_compression(bset);
bset = isl_morph_basic_set(isl_morph_copy(morph), bset);
poly = isl_qpolynomial_morph_domain(poly, isl_morph_copy(morph));
dim = isl_morph_get_ran_space(morph);
dim = isl_space_params(dim);
top_pwf = bound->pwf;
top_pwf_tight = bound->pwf_tight;
dim = isl_space_from_domain(dim);
dim = isl_space_add_dims(dim, isl_dim_out, 1);
bound->pwf = isl_pw_qpolynomial_fold_zero(isl_space_copy(dim),
bound->type);
bound->pwf_tight = isl_pw_qpolynomial_fold_zero(dim, bound->type);
r = compressed_guarded_poly_bound(bset, poly, user);
morph = isl_morph_dom_params(morph);
morph = isl_morph_ran_params(morph);
morph = isl_morph_inverse(morph);
bound->pwf = isl_pw_qpolynomial_fold_morph_domain(bound->pwf,
isl_morph_copy(morph));
bound->pwf_tight = isl_pw_qpolynomial_fold_morph_domain(
bound->pwf_tight, morph);
bound->pwf = isl_pw_qpolynomial_fold_fold(top_pwf, bound->pwf);
bound->pwf_tight = isl_pw_qpolynomial_fold_fold(top_pwf_tight,
bound->pwf_tight);
return r;
error:
isl_basic_set_free(bset);
isl_qpolynomial_free(poly);
return isl_stat_error;
}
static isl_stat guarded_poly_bound(__isl_take isl_basic_set *bset,
__isl_take isl_qpolynomial *poly, void *user)
{
struct isl_bound *bound = (struct isl_bound *)user;
isl_space *dim;
isl_pw_qpolynomial_fold *top_pwf;
isl_pw_qpolynomial_fold *top_pwf_tight;
int nparam;
int n_in;
isl_stat r;
if (!bound->wrapping)
return unwrapped_guarded_poly_bound(bset, poly, user);
nparam = isl_space_dim(bound->dim, isl_dim_param);
n_in = isl_space_dim(bound->dim, isl_dim_in);
bset = isl_basic_set_move_dims(bset, isl_dim_param, nparam,
isl_dim_set, 0, n_in);
poly = isl_qpolynomial_move_dims(poly, isl_dim_param, nparam,
isl_dim_in, 0, n_in);
dim = isl_basic_set_get_space(bset);
dim = isl_space_params(dim);
top_pwf = bound->pwf;
top_pwf_tight = bound->pwf_tight;
dim = isl_space_from_domain(dim);
dim = isl_space_add_dims(dim, isl_dim_out, 1);
bound->pwf = isl_pw_qpolynomial_fold_zero(isl_space_copy(dim),
bound->type);
bound->pwf_tight = isl_pw_qpolynomial_fold_zero(dim, bound->type);
r = unwrapped_guarded_poly_bound(bset, poly, user);
bound->pwf = isl_pw_qpolynomial_fold_reset_space(bound->pwf,
isl_space_copy(bound->dim));
bound->pwf_tight = isl_pw_qpolynomial_fold_reset_space(bound->pwf_tight,
isl_space_copy(bound->dim));
bound->pwf = isl_pw_qpolynomial_fold_fold(top_pwf, bound->pwf);
bound->pwf_tight = isl_pw_qpolynomial_fold_fold(top_pwf_tight,
bound->pwf_tight);
return r;
}
static isl_stat guarded_qp(__isl_take isl_qpolynomial *qp, void *user)
{
struct isl_bound *bound = (struct isl_bound *)user;
isl_stat r;
r = isl_qpolynomial_as_polynomial_on_domain(qp, bound->bset,
&guarded_poly_bound, user);
isl_qpolynomial_free(qp);
return r;
}
static isl_stat basic_guarded_fold(__isl_take isl_basic_set *bset, void *user)
{
struct isl_bound *bound = (struct isl_bound *)user;
isl_stat r;
bound->bset = bset;
r = isl_qpolynomial_fold_foreach_qpolynomial(bound->fold,
&guarded_qp, user);
isl_basic_set_free(bset);
return r;
}
static isl_stat guarded_fold(__isl_take isl_set *set,
__isl_take isl_qpolynomial_fold *fold, void *user)
{
struct isl_bound *bound = (struct isl_bound *)user;
if (!set || !fold)
goto error;
set = isl_set_make_disjoint(set);
bound->fold = fold;
bound->type = isl_qpolynomial_fold_get_type(fold);
if (isl_set_foreach_basic_set(set, &basic_guarded_fold, bound) < 0)
goto error;
isl_set_free(set);
isl_qpolynomial_fold_free(fold);
return isl_stat_ok;
error:
isl_set_free(set);
isl_qpolynomial_fold_free(fold);
return isl_stat_error;
}
__isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_bound(
__isl_take isl_pw_qpolynomial_fold *pwf, int *tight)
{
unsigned nvar;
struct isl_bound bound;
int covers;
if (!pwf)
return NULL;
bound.dim = isl_pw_qpolynomial_fold_get_domain_space(pwf);
bound.wrapping = isl_space_is_wrapping(bound.dim);
if (bound.wrapping)
bound.dim = isl_space_unwrap(bound.dim);
nvar = isl_space_dim(bound.dim, isl_dim_out);
bound.dim = isl_space_domain(bound.dim);
bound.dim = isl_space_from_domain(bound.dim);
bound.dim = isl_space_add_dims(bound.dim, isl_dim_out, 1);
if (nvar == 0) {
if (tight)
*tight = 1;
return isl_pw_qpolynomial_fold_reset_space(pwf, bound.dim);
}
if (isl_pw_qpolynomial_fold_is_zero(pwf)) {
enum isl_fold type = pwf->type;
isl_pw_qpolynomial_fold_free(pwf);
if (tight)
*tight = 1;
return isl_pw_qpolynomial_fold_zero(bound.dim, type);
}
bound.pwf = isl_pw_qpolynomial_fold_zero(isl_space_copy(bound.dim),
pwf->type);
bound.pwf_tight = isl_pw_qpolynomial_fold_zero(isl_space_copy(bound.dim),
pwf->type);
bound.check_tight = !!tight;
if (isl_pw_qpolynomial_fold_foreach_lifted_piece(pwf,
guarded_fold, &bound) < 0)
goto error;
covers = isl_pw_qpolynomial_fold_covers(bound.pwf_tight, bound.pwf);
if (covers < 0)
goto error;
if (tight)
*tight = covers;
isl_space_free(bound.dim);
isl_pw_qpolynomial_fold_free(pwf);
if (covers) {
isl_pw_qpolynomial_fold_free(bound.pwf);
return bound.pwf_tight;
}
bound.pwf = isl_pw_qpolynomial_fold_fold(bound.pwf, bound.pwf_tight);
return bound.pwf;
error:
isl_pw_qpolynomial_fold_free(bound.pwf_tight);
isl_pw_qpolynomial_fold_free(bound.pwf);
isl_pw_qpolynomial_fold_free(pwf);
isl_space_free(bound.dim);
return NULL;
}
__isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_bound(
__isl_take isl_pw_qpolynomial *pwqp, enum isl_fold type, int *tight)
{
isl_pw_qpolynomial_fold *pwf;
pwf = isl_pw_qpolynomial_fold_from_pw_qpolynomial(type, pwqp);
return isl_pw_qpolynomial_fold_bound(pwf, tight);
}
struct isl_union_bound_data {
enum isl_fold type;
int tight;
isl_union_pw_qpolynomial_fold *res;
};
static isl_stat bound_pw(__isl_take isl_pw_qpolynomial *pwqp, void *user)
{
struct isl_union_bound_data *data = user;
isl_pw_qpolynomial_fold *pwf;
pwf = isl_pw_qpolynomial_bound(pwqp, data->type,
data->tight ? &data->tight : NULL);
data->res = isl_union_pw_qpolynomial_fold_fold_pw_qpolynomial_fold(
data->res, pwf);
return isl_stat_ok;
}
__isl_give isl_union_pw_qpolynomial_fold *isl_union_pw_qpolynomial_bound(
__isl_take isl_union_pw_qpolynomial *upwqp,
enum isl_fold type, int *tight)
{
isl_space *dim;
struct isl_union_bound_data data = { type, 1, NULL };
if (!upwqp)
return NULL;
if (!tight)
data.tight = 0;
dim = isl_union_pw_qpolynomial_get_space(upwqp);
data.res = isl_union_pw_qpolynomial_fold_zero(dim, type);
if (isl_union_pw_qpolynomial_foreach_pw_qpolynomial(upwqp,
&bound_pw, &data) < 0)
goto error;
isl_union_pw_qpolynomial_free(upwqp);
if (tight)
*tight = data.tight;
return data.res;
error:
isl_union_pw_qpolynomial_free(upwqp);
isl_union_pw_qpolynomial_fold_free(data.res);
return NULL;
}