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
|
/*
* Copyright 2010 INRIA Saclay
*
* Use of this software is governed by the GNU LGPLv2.1 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_bound.h>
#include <isl_bernstein.h>
#include <isl_range.h>
#include <isl_polynomial_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 int 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 int 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_dim *dim;
isl_morph *morph;
unsigned orig_nvar, final_nvar;
int 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);
orig_nvar = isl_basic_set_dim(bset, isl_dim_set);
morph = isl_basic_set_full_compression(bset);
bset = isl_morph_basic_set(isl_morph_copy(morph), bset);
poly = isl_qpolynomial_morph(poly, isl_morph_copy(morph));
final_nvar = isl_basic_set_dim(bset, isl_dim_set);
dim = isl_morph_get_ran_dim(morph);
dim = isl_dim_drop(dim, isl_dim_set, 0, isl_dim_size(dim, isl_dim_set));
top_pwf = bound->pwf;
top_pwf_tight = bound->pwf_tight;
bound->pwf = isl_pw_qpolynomial_fold_zero(isl_dim_copy(dim));
bound->pwf_tight = isl_pw_qpolynomial_fold_zero(dim);
r = compressed_guarded_poly_bound(bset, poly, user);
morph = isl_morph_remove_dom_dims(morph, isl_dim_set, 0, orig_nvar);
morph = isl_morph_remove_ran_dims(morph, isl_dim_set, 0, final_nvar);
morph = isl_morph_inverse(morph);
bound->pwf = isl_pw_qpolynomial_fold_morph(bound->pwf,
isl_morph_copy(morph));
bound->pwf_tight = isl_pw_qpolynomial_fold_morph(bound->pwf_tight, morph);
bound->pwf = isl_pw_qpolynomial_fold_add(top_pwf, bound->pwf);
bound->pwf_tight = isl_pw_qpolynomial_fold_add(top_pwf_tight,
bound->pwf_tight);
return r;
error:
isl_basic_set_free(bset);
isl_qpolynomial_free(poly);
return -1;
}
static int guarded_qp(__isl_take isl_qpolynomial *qp, void *user)
{
struct isl_bound *bound = (struct isl_bound *)user;
int r;
r = isl_qpolynomial_as_polynomial_on_domain(qp, bound->bset,
&guarded_poly_bound, user);
isl_qpolynomial_free(qp);
return r;
}
static int basic_guarded_fold(__isl_take isl_basic_set *bset, void *user)
{
struct isl_bound *bound = (struct isl_bound *)user;
int r;
bound->bset = bset;
r = isl_qpolynomial_fold_foreach_qpolynomial(bound->fold,
&guarded_qp, user);
isl_basic_set_free(bset);
return r;
}
static int 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 0;
error:
isl_set_free(set);
isl_qpolynomial_fold_free(fold);
return -1;
}
__isl_give isl_pw_qpolynomial_fold *isl_pw_qpolynomial_fold_bound(
__isl_take isl_pw_qpolynomial_fold *pwf, int *tight)
{
isl_dim *dim;
unsigned nvar;
struct isl_bound bound;
int covers;
if (!pwf)
return NULL;
dim = isl_pw_qpolynomial_fold_get_dim(pwf);
nvar = isl_dim_size(dim, isl_dim_set);
if (isl_pw_qpolynomial_fold_is_zero(pwf)) {
isl_pw_qpolynomial_fold_free(pwf);
dim = isl_dim_drop(dim, isl_dim_set, 0, nvar);
if (tight)
*tight = 1;
return isl_pw_qpolynomial_fold_zero(dim);
}
if (nvar == 0) {
isl_dim_free(dim);
if (tight)
*tight = 1;
return pwf;
}
dim = isl_dim_drop(dim, isl_dim_set, 0, nvar);
bound.pwf = isl_pw_qpolynomial_fold_zero(isl_dim_copy(dim));
bound.pwf_tight = isl_pw_qpolynomial_fold_zero(isl_dim_copy(dim));
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_dim_free(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_add(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_dim_free(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);
}
|
