?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
short_rat::print: correctly print out terms with a zero coefficient
[barvinok.git] / test_approx.c
blob4cdf20f46850009e384461863c19b40bd70593df
1 #include <assert.h>
2 #include <limits.h>
3 #include <sys/times.h>
4 #include <barvinok/barvinok.h>
5 #include "verify.h"
6 #include "argp.h"
7 #include "progname.h"
8
9 struct {
10 int sign;
11 int method;
12 int flags;
13 } methods[] = {
14 { BV_APPROX_SIGN_NONE, BV_APPROX_NONE, 0 },
15 { BV_APPROX_SIGN_APPROX, BV_APPROX_BERNOULLI, 0 },
16 { BV_APPROX_SIGN_APPROX, BV_APPROX_DROP, 0 },
17 { BV_APPROX_SIGN_APPROX, BV_APPROX_VOLUME, BV_VOL_LIFT },
18 { BV_APPROX_SIGN_APPROX, BV_APPROX_VOLUME, BV_VOL_VERTEX },
19 { BV_APPROX_SIGN_APPROX, BV_APPROX_VOLUME, BV_VOL_BARYCENTER },
20 { BV_APPROX_SIGN_APPROX, BV_APPROX_SCALE, 0 },
21 { BV_APPROX_SIGN_APPROX, BV_APPROX_SCALE, BV_APPROX_SCALE_CHAMBER },
22 { BV_APPROX_SIGN_APPROX, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST },
23 { BV_APPROX_SIGN_APPROX, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST | BV_APPROX_SCALE_CHAMBER },
24 { BV_APPROX_SIGN_LOWER, BV_APPROX_DROP, 0 },
25 { BV_APPROX_SIGN_LOWER, BV_APPROX_VOLUME, BV_VOL_LIFT },
26 { BV_APPROX_SIGN_LOWER, BV_APPROX_VOLUME, BV_VOL_VERTEX },
27 { BV_APPROX_SIGN_LOWER, BV_APPROX_VOLUME, BV_VOL_BARYCENTER },
28 { BV_APPROX_SIGN_LOWER, BV_APPROX_SCALE, 0 },
29 { BV_APPROX_SIGN_LOWER, BV_APPROX_SCALE, BV_APPROX_SCALE_CHAMBER },
30 { BV_APPROX_SIGN_LOWER, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST },
31 { BV_APPROX_SIGN_LOWER, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST | BV_APPROX_SCALE_CHAMBER },
32 { BV_APPROX_SIGN_LOWER, BV_APPROX_SCALE, BV_APPROX_SCALE_NARROW },
33 { BV_APPROX_SIGN_LOWER, BV_APPROX_SCALE, BV_APPROX_SCALE_NARROW | BV_APPROX_SCALE_CHAMBER},
34 { BV_APPROX_SIGN_LOWER, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST | BV_APPROX_SCALE_NARROW },
35 { BV_APPROX_SIGN_LOWER, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST | BV_APPROX_SCALE_NARROW | BV_APPROX_SCALE_CHAMBER },
36 { BV_APPROX_SIGN_LOWER, BV_APPROX_SCALE, BV_APPROX_SCALE_NARROW2 },
37 { BV_APPROX_SIGN_LOWER, BV_APPROX_SCALE, BV_APPROX_SCALE_NARROW2 | BV_APPROX_SCALE_CHAMBER },
38 { BV_APPROX_SIGN_LOWER, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST | BV_APPROX_SCALE_NARROW2 },
39 { BV_APPROX_SIGN_LOWER, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST | BV_APPROX_SCALE_NARROW2 | BV_APPROX_SCALE_CHAMBER },
40 { BV_APPROX_SIGN_UPPER, BV_APPROX_DROP, 0 },
41 { BV_APPROX_SIGN_UPPER, BV_APPROX_VOLUME, BV_VOL_LIFT },
42 { BV_APPROX_SIGN_UPPER, BV_APPROX_VOLUME, BV_VOL_VERTEX },
43 { BV_APPROX_SIGN_UPPER, BV_APPROX_VOLUME, BV_VOL_BARYCENTER },
44 { BV_APPROX_SIGN_UPPER, BV_APPROX_SCALE, 0 },
45 { BV_APPROX_SIGN_UPPER, BV_APPROX_SCALE, BV_APPROX_SCALE_CHAMBER },
46 { BV_APPROX_SIGN_UPPER, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST },
47 { BV_APPROX_SIGN_UPPER, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST | BV_APPROX_SCALE_CHAMBER },
48 { BV_APPROX_SIGN_UPPER, BV_APPROX_SCALE, BV_APPROX_SCALE_NARROW },
49 { BV_APPROX_SIGN_UPPER, BV_APPROX_SCALE, BV_APPROX_SCALE_NARROW | BV_APPROX_SCALE_CHAMBER },
50 { BV_APPROX_SIGN_UPPER, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST | BV_APPROX_SCALE_NARROW },
51 { BV_APPROX_SIGN_UPPER, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST | BV_APPROX_SCALE_NARROW | BV_APPROX_SCALE_CHAMBER },
52 { BV_APPROX_SIGN_UPPER, BV_APPROX_SCALE, BV_APPROX_SCALE_NARROW2 },
53 { BV_APPROX_SIGN_UPPER, BV_APPROX_SCALE, BV_APPROX_SCALE_NARROW2 | BV_APPROX_SCALE_CHAMBER },
54 { BV_APPROX_SIGN_UPPER, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST | BV_APPROX_SCALE_NARROW2 },
55 { BV_APPROX_SIGN_UPPER, BV_APPROX_SCALE, BV_APPROX_SCALE_FAST | BV_APPROX_SCALE_NARROW2 | BV_APPROX_SCALE_CHAMBER },
56 };
57
58 #define nr_methods (sizeof(methods)/sizeof(*methods))
59
60 struct argp_option argp_options[] = {
61 { "quiet", 'q' },
62 { 0 }
63 };
64
65 struct options {
66 int quiet;
67 struct verify_options verify;
68 };
69
70 static error_t parse_opt(int key, char *arg, struct argp_state *state)
71 {
72 struct options *options = (struct options*) state->input;
73
74 switch (key) {
75 case ARGP_KEY_INIT:
76 state->child_inputs[0] = options->verify.barvinok;
77 state->child_inputs[1] = &options->verify;
78 options->quiet = 0;
79 break;
80 case 'q':
81 options->quiet = 1;
82 break;
83 default:
84 return ARGP_ERR_UNKNOWN;
85 }
86 return 0;
87 }
88
89 struct result_data {
90 Value n;
91 double RE_sum[nr_methods];
92
93 clock_t ticks[nr_methods];
94 size_t size[nr_methods];
95 };
96
97 void result_data_init(struct result_data *result)
98 {
99 int i;
100 for (i = 0; i < nr_methods; ++i) {
101 result->RE_sum[i] = 0;
102 result->ticks[i] = 0;
103 result->size[i] = 0;
104 }
105 value_init(result->n);
106 }
107
108 void result_data_clear(struct result_data *result)
109 {
110 int i;
111 value_clear(result->n);
112 }
113
114 void result_data_print(struct result_data *result, int n)
115 {
116 int i;
117
118 fprintf(stderr, "%d", result->ticks[0]/n);
119 for (i = 1; i < nr_methods; ++i)
120 fprintf(stderr, ", %d", result->ticks[i]/n);
121 fprintf(stderr, "\n");
122
123 fprintf(stderr, "%d", result->size[0]/n);
124 for (i = 1; i < nr_methods; ++i)
125 fprintf(stderr, ", %d", result->size[i]/n);
126 fprintf(stderr, "\n");
127
128 fprintf(stderr, "%g\n", VALUE_TO_DOUBLE(result->n));
129 fprintf(stderr, "%g", result->RE_sum[0]/VALUE_TO_DOUBLE(result->n));
130 for (i = 1; i < nr_methods; ++i)
131 fprintf(stderr, ", %g", result->RE_sum[i]/VALUE_TO_DOUBLE(result->n));
132 fprintf(stderr, "\n");
133 }
134
135 struct test_approx_data {
136 struct check_poly_data cp;
137 evalue **EP;
138 struct result_data *result;
139 };
140
141 static void eval(const evalue *EP, Value *z, int sign, Value *v)
142 {
143 evalue *res;
144
145 res = evalue_eval(EP, z);
146 if (sign == BV_APPROX_SIGN_LOWER)
147 mpz_cdiv_q(*v, res->x.n, res->d);
148 else if (sign == BV_APPROX_SIGN_UPPER)
149 mpz_fdiv_q(*v, res->x.n, res->d);
150 else if (sign == BV_APPROX_SIGN_APPROX)
151 mpz_tdiv_q(*v, res->x.n, res->d);
152 else {
153 assert(value_one_p(res->d));
154 value_assign(*v, res->x.n);
155 }
156 evalue_free(res);
157 }
158
159 static int test_approx(const struct check_poly_data *data, int nparam, Value *z,
160 const struct verify_options *options)
161 {
162 struct test_approx_data* ta_data = (struct test_approx_data*) data;
163 Value exact, approx;
164 int i;
165
166 value_init(exact);
167 value_init(approx);
168
169 eval(ta_data->EP[0], z, BV_APPROX_SIGN_NONE, &exact);
170
171 /*
172 value_print(stderr, VALUE_FMT, exact);
173 */
174
175 value_increment(ta_data->result->n, ta_data->result->n);
176 for (i = 1; i < nr_methods; ++i) {
177 double error;
178 eval(ta_data->EP[i], z, methods[i].sign, &approx);
179 /*
180 fprintf(stderr, ", ");
181 value_print(stderr, VALUE_FMT, approx);
182 */
183 if (methods[i].sign == BV_APPROX_SIGN_LOWER)
184 assert(value_le(approx, exact));
185 if (methods[i].sign == BV_APPROX_SIGN_UPPER)
186 assert(value_ge(approx, exact));
187 value_subtract(approx, approx, exact);
188 if (value_zero_p(exact))
189 error = abs(VALUE_TO_DOUBLE(approx));
190 else
191 error = abs(VALUE_TO_DOUBLE(approx)) / VALUE_TO_DOUBLE(exact);
192 ta_data->result->RE_sum[i] += error;
193 }
194
195 /*
196 fprintf(stderr, "\n");
197 */
198
199 value_clear(exact);
200 value_clear(approx);
201 return 1;
202 }
203
204 static void test(Polyhedron *P, Polyhedron *C, evalue **EP,
205 struct result_data *result,
206 struct verify_options *options)
207 {
208 Polyhedron *CS;
209 Vector *p;
210 unsigned nparam = C->Dimension;
211 struct test_approx_data data;
212
213 CS = check_poly_context_scan(P, &C, C->Dimension, options);
214
215 p = Vector_Alloc(P->Dimension+2);
216 value_set_si(p->p[P->Dimension+1], 1);
217
218 check_poly_init(C, options);
219
220 data.cp.z = p->p;
221 data.cp.check = test_approx;
222 data.EP = EP;
223 data.result = result;
224 check_poly(CS, &data.cp, nparam, 0, p->p+P->Dimension-nparam+1,
225 options);
226 if (!options->print_all)
227 printf("\n");
228
229 Vector_Free(p);
230 if (CS) {
231 Domain_Free(CS);
232 Domain_Free(C);
233 }
234 }
235
236 void Matrix_File_Read_Input(FILE *in, Matrix *Mat)
237 {
238 Value *p;
239 int i,j,n;
240 char *c, s[1024],str[1024];
241
242 p = Mat->p_Init;
243 for (i=0;i<Mat->NbRows;i++) {
244 do {
245 c = fgets(s, 1024, in);
246 while(isspace(*c) && *c!='\n')
247 ++c;
248 } while(c && (*c =='#' || *c== '\n'));
249
250 if (!c) {
251 errormsg1( "Matrix_Read", "baddim", "not enough rows" );
252 break;
253 }
254 for (j=0;j<Mat->NbColumns;j++) {
255 if(!c || *c=='\n' || *c=='#') {
256 errormsg1("Matrix_Read", "baddim", "not enough columns");
257 break;
258 }
259 if (sscanf(c,"%s%n",str,&n) == 0) {
260 errormsg1( "Matrix_Read", "baddim", "not enough columns" );
261 break;
262 }
263 value_read(*(p++),str);
264 c += n;
265 }
266 }
267 } /* Matrix_Read_Input */
268
269 /*
270 * Read the contents of the matrix 'Mat' from standard input.
271 * A '#' in the first column is a comment line
272 */
273 Matrix *Matrix_File_Read(FILE *in)
274 {
275 Matrix *Mat;
276 unsigned NbRows, NbColumns;
277 char s[1024];
278
279 fgets(s, 1024, in);
280 while ((*s=='#' || *s=='\n') ||
281 (sscanf(s, "%d %d", &NbRows, &NbColumns)<2))
282 fgets(s, 1024, in);
283 Mat = Matrix_Alloc(NbRows,NbColumns);
284 if(!Mat) {
285 errormsg1("Matrix_Read", "outofmem", "out of memory space");
286 return(NULL);
287 }
288 Matrix_File_Read_Input(in, Mat);
289 return Mat;
290 } /* Matrix_Read */
291
292 void handle(FILE *in, struct result_data *result, struct verify_options *options)
293 {
294 int i;
295 Polyhedron *A, *C;
296 Matrix *M;
297 char **param_name;
298 evalue *EP[nr_methods];
299
300 M = Matrix_File_Read(in);
301 A = Constraints2Polyhedron(M, options->barvinok->MaxRays);
302 Matrix_Free(M);
303 M = Matrix_File_Read(in);
304 C = Constraints2Polyhedron(M, options->barvinok->MaxRays);
305 Matrix_Free(M);
306 param_name = Read_ParamNames(in, C->Dimension);
307
308 for (i = 0; i < nr_methods; ++i) {
309 struct tms st_cpu;
310 struct tms en_cpu;
311 options->barvinok->polynomial_approximation = methods[i].sign;
312 options->barvinok->approximation_method = methods[i].method;
313 if (methods[i].method == BV_APPROX_SCALE)
314 options->barvinok->scale_flags = methods[i].flags;
315 else if (methods[i].method == BV_APPROX_VOLUME)
316 options->barvinok->volume_triangulate = methods[i].flags;
317
318 times(&st_cpu);
319 EP[i] = barvinok_enumerate_with_options(A, C, options->barvinok);
320 times(&en_cpu);
321 result->ticks[i] = en_cpu.tms_utime - st_cpu.tms_utime;
322 /*
323 print_evalue(stdout, EP[i], param_name);
324 */
325 }
326 for (i = 0; i < nr_methods; ++i)
327 result->size[i] = evalue_size(EP[i])/4;
328 test(A, C, EP, result, options);
329 for (i = 0; i < nr_methods; ++i)
330 evalue_free(EP[i]);
331
332 Free_ParamNames(param_name, C->Dimension);
333 Polyhedron_Free(A);
334 Polyhedron_Free(C);
335 }
336
337 int main(int argc, char **argv)
338 {
339 struct barvinok_options *bv_options = barvinok_options_new_with_defaults();
340 char path[PATH_MAX+1];
341 struct result_data all_result;
342 int n = 0;
343 static struct argp_child argp_children[] = {
344 { &barvinok_argp, 0, 0, 0 },
345 { &verify_argp, 0, "verification", BV_GRP_LAST+1 },
346 { 0 }
347 };
348 static struct argp argp = { argp_options, parse_opt, 0, 0, argp_children };
349 struct options options;
350
351 options.verify.barvinok = bv_options;
352 set_program_name(argv[0]);
353 argp_parse(&argp, argc, argv, 0, 0, &options);
354
355 if (options.verify.M == INT_MIN)
356 options.verify.M = 100;
357 if (options.verify.m == INT_MAX)
358 options.verify.m = -100;
359
360 result_data_init(&all_result);
361
362 while (fgets(path, sizeof(path), stdin)) {
363 struct result_data result;
364 FILE *in;
365 int i;
366
367 ++n;
368 result_data_init(&result);
369 fprintf(stderr, "%s", path);
370 *strchr(path, '\n') = '\0';
371 in = fopen(path, "r");
372 assert(in);
373 handle(in, &result, &options.verify);
374 fclose(in);
375
376 if (!options.quiet)
377 result_data_print(&result, 1);
378
379 value_addto(all_result.n, all_result.n, result.n);
380 for (i = 0; i < nr_methods; ++i) {
381 all_result.RE_sum[i] += result.RE_sum[i];
382 all_result.ticks[i] += result.ticks[i];
383 all_result.size[i] += result.size[i];
384 }
385
386 result_data_clear(&result);
387
388 if (!options.quiet) {
389 fprintf(stderr, "average\n");
390 result_data_print(&all_result, n);
391 }
392 }
393
394 result_data_clear(&all_result);
395
396 barvinok_options_free(bv_options);
397
398 return 0;
399 }
lattice point enumeration library