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
|
/* Test Grid::total_memory_in_bytes() and
Grid::external_memory_in_bytes().
Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it>
Copyright (C) 2010-2016 BUGSENG srl (http://bugseng.com)
This file is part of the Parma Polyhedra Library (PPL).
The PPL is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
The PPL is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
For the most up-to-date information see the Parma Polyhedra Library
site: http://bugseng.com/products/ppl/ . */
#include "ppl_test.hh"
namespace {
void
add_congruence(Grid& gr, const Congruence& cg) {
const memory_size_type gr_memory_before = gr.total_memory_in_bytes();
const memory_size_type cg_memory = cg.total_memory_in_bytes();
gr.add_congruence(cg);
const memory_size_type gr_memory_after = gr.total_memory_in_bytes();
nout << gr_memory_before
<< " + " << cg_memory
<< " -> " << gr_memory_after
<< endl;
}
void
add_grid_generator(Grid& gr, const Grid_Generator& g) {
const memory_size_type gr_memory_before = gr.total_memory_in_bytes();
const memory_size_type g_memory = g.total_memory_in_bytes();
gr.add_grid_generator(g);
const memory_size_type gr_memory_after = gr.total_memory_in_bytes();
nout << gr_memory_before
<< " + " << g_memory
<< " -> " << gr_memory_after
<< endl;
}
void
minimize(Grid& gr) {
const memory_size_type gr_memory_before = gr.total_memory_in_bytes();
(void) gr.minimized_grid_generators();
const memory_size_type gr_memory_after = gr.total_memory_in_bytes();
nout << gr_memory_before
<< " -m-> " << gr_memory_after
<< endl;
}
bool
test01() {
Variable x(0);
Variable y(1);
Variable z(2);
const memory_size_type x_total_size = x.total_memory_in_bytes();
const memory_size_type x_external_size = x.external_memory_in_bytes();
nout << "*** Size of variables ***"
<< endl
<< "x.total_memory_in_bytes() = " << x_total_size
<< endl
<< "x.external_memory_in_bytes() = " << x_external_size
<< endl << endl;
nout << "*** Size of linear expressions ***"
<< endl;
Linear_Expression le(0);
memory_size_type le_total_size = le.total_memory_in_bytes();
memory_size_type le_external_size = le.external_memory_in_bytes();
using namespace IO_Operators;
nout << "(" << le << ").total_memory_in_bytes() = " << le_total_size
<< endl
<< "(" << le << ").external_memory_in_bytes() = " << le_external_size
<< endl;
le += x;
le_total_size = le.total_memory_in_bytes();
le_external_size = le.external_memory_in_bytes();
nout << "(" << le << ").total_memory_in_bytes() = " << le_total_size
<< endl
<< "(" << le << ").external_memory_in_bytes() = " << le_external_size
<< endl;
le += 2*y;
le_total_size = le.total_memory_in_bytes();
le_external_size = le.external_memory_in_bytes();
nout << "(" << le << ").total_memory_in_bytes() = " << le_total_size
<< endl
<< "(" << le << ").external_memory_in_bytes() = " << le_external_size
<< endl;
le += 4*z;
le_total_size = le.total_memory_in_bytes();
le_external_size = le.external_memory_in_bytes();
nout << "(" << le << ").total_memory_in_bytes() = " << le_total_size
<< endl
<< "(" << le << ").external_memory_in_bytes() = " << le_external_size
<< endl << endl;
nout << "*** Adding congruences to a grid ***" << endl;
Grid gr1(3);
add_congruence(gr1, 4*x - 2*y - z + 14 %= 0);
add_congruence(gr1, 4*x + 2*y - z + 2 %= 0);
add_congruence(gr1, x + y - 1 %= 0);
add_congruence(gr1, x + y + 2*z - 5 %= 0);
minimize(gr1);
add_congruence(gr1, x + 1 %= 0);
add_congruence(gr1, x + z - 1 %= 0);
add_congruence(gr1, 2*x + y -2*z + 7 %= 0);
add_congruence(gr1, x - y + 2*z + 1 %= 0);
minimize(gr1);
add_congruence(gr1, x - y + 5 %= 0);
add_congruence(gr1, 2*x - y - 2*z + 13 %= 0);
add_congruence(gr1, -2*x - y + 2*z + 1 %= 0);
add_congruence(gr1, -x + y - 1 %= 0);
minimize(gr1);
add_congruence(gr1, -x + y -2*z + 7 %= 0);
add_congruence(gr1, -4*x + 2*y + z - 4 %= 0);
add_congruence(gr1, -2*x + y + 2*z - 5 %= 0);
add_congruence(gr1, -x + 1 %= 0);
minimize(gr1);
add_congruence(gr1, -x - z + 5 %= 0);
add_congruence(gr1, -4*x - 2*y + z + 8 %= 0);
add_congruence(gr1, -x - y + 5 %= 0);
add_congruence(gr1, -x - y -2*z +13 %= 0);
minimize(gr1);
const memory_size_type gr1_total_size = gr1.total_memory_in_bytes();
const memory_size_type gr1_external_size = gr1.external_memory_in_bytes();
const Congruence_System& cgs = gr1.congruences();
const memory_size_type cgs_total_size = cgs.total_memory_in_bytes();
const memory_size_type cgs_external_size = cgs.external_memory_in_bytes();
const Grid_Generator_System& gs = gr1.grid_generators();
const memory_size_type gs_total_size = gs.total_memory_in_bytes();
const memory_size_type gs_external_size = gs.external_memory_in_bytes();
nout << endl
<< "*** Size of the user-visible grid components ***"
<< endl
<< "gr1.total_memory_in_bytes() = " << gr1_total_size
<< endl
<< "cgs.total_memory_in_bytes() = " << cgs_total_size
<< endl
<< "gs.total_memory_in_bytes() = " << gs_total_size
<< endl
<< "gr1.external_memory_in_bytes() = " << gr1_external_size
<< endl
<< "cgs.external_memory_in_bytes() = " << cgs_external_size
<< endl
<< "gs.external_memory_in_bytes() = " << gs_external_size
<< endl << endl;
nout << "*** Adding generators to a grid ***" << endl;
Grid gr2(3, EMPTY);
unsigned n = 0;
for (Grid_Generator_System::const_iterator i = gs.begin(),
gs_end = gs.end(); i != gs_end; ++i) {
add_grid_generator(gr2, *i);
if (++n % 4 == 0)
minimize(gr2);
}
nout << endl
<< "*** Size of a congruence system vs size of contained congruences"
<< endl
<< "cgs.total_memory_in_bytes() = " << cgs_total_size
<< endl;
memory_size_type cgs_elements_size = 0;
for (Congruence_System::const_iterator i = cgs.begin(),
cgs_end = cgs.end(); i != cgs_end; ++i)
cgs_elements_size += i->total_memory_in_bytes();
nout << "Sum of sizes of contained congruences = " << cgs_elements_size
<< endl << endl
<< "*** Size of a generator system vs size of contained generators"
<< endl
<< "gs.total_memory_in_bytes() = " << gs_total_size
<< endl;
memory_size_type gs_elements_size = 0;
for (Grid_Generator_System::const_iterator i = gs.begin(),
gs_end = gs.end(); i != gs_end; ++i)
gs_elements_size += i->total_memory_in_bytes();
nout << "Sum of sizes of contained generators = " << gs_elements_size
<< endl << endl;
return true;
}
bool
test02() {
Variable x(0);
Variable y(1);
Variable z(2);
Grid gr1(3);
gr1.refine_with_constraint(4*x - 2*y - z + 14 >= 0);
gr1.refine_with_constraint(4*x + 2*y - z + 2 >= 0);
gr1.refine_with_constraint(x + y - 1 >= 0);
gr1.refine_with_constraint(x + y + 2*z - 5 >= 0);
const memory_size_type gr1_total_size = gr1.total_memory_in_bytes();
const memory_size_type gr1_external_size = gr1.external_memory_in_bytes();
Determinate<Grid> dgr(gr1);
const memory_size_type dgr_total_size = dgr.total_memory_in_bytes();
const memory_size_type dgr_external_size = dgr.external_memory_in_bytes();
nout << "gr1.total_memory_in_bytes() = " << gr1_total_size
<< endl
<< "gr1.external_memory_in_bytes() = " << gr1_external_size
<< endl
<< "dgr.total_memory_in_bytes() = " << dgr_total_size
<< endl
<< "dgr.external_memory_in_bytes() = " << dgr_external_size
<< endl;
Pointset_Powerset<Grid> pgr1(gr1);
Grid gr2(3);
gr2.refine_with_constraint(x >= 0);
gr2.refine_with_constraint(y >= 0);
gr2.refine_with_constraint(z >= 0);
gr2.refine_with_constraint(x <= 1);
gr2.refine_with_constraint(y <= 1);
gr2.refine_with_constraint(z <= 1);
Pointset_Powerset<Grid> pgr2(gr2);
Pointset_Powerset<Grid> p2gr2 = pgr2;
p2gr2.difference_assign(pgr1);
const memory_size_type pgr1_total_size = pgr1.total_memory_in_bytes();
const memory_size_type pgr1_external_size = pgr1.external_memory_in_bytes();
const memory_size_type pgr2_total_size = pgr2.total_memory_in_bytes();
const memory_size_type pgr2_external_size = pgr2.external_memory_in_bytes();
const memory_size_type p2gr2_total_size = p2gr2.total_memory_in_bytes();
const memory_size_type p2gr2_external_size = p2gr2.external_memory_in_bytes();
nout << "pgr1.total_memory_in_bytes() = " << pgr1_total_size
<< endl
<< "pgr1.external_memory_in_bytes() = " << pgr1_external_size
<< endl
<< "pgr2.total_memory_in_bytes() = " << pgr2_total_size
<< endl
<< "pgr2.external_memory_in_bytes() = " << pgr2_external_size
<< endl
<< "p2gr2.total_memory_in_bytes() = " << p2gr2_total_size
<< endl
<< "p2gr2.external_memory_in_bytes() = " << p2gr2_external_size
<< endl;
return true;
}
} // namespace
BEGIN_MAIN
DO_TEST(test01);
DO_TEST(test02);
END_MAIN
|
