4 #include <barvinok/options.h>
5 #include <barvinok/util.h>
6 #include "evalue_read.h"
9 #ifdef HAVE_SYS_TIMES_H
11 #include <sys/times.h>
13 typedef clock_t my_clock_t
;
15 static my_clock_t
time_diff(struct tms
*before
, struct tms
*after
)
17 return after
->tms_utime
- before
->tms_utime
;
22 typedef int my_clock_t
;
25 static void times(struct tms
* time
)
28 static my_clock_t
time_diff(struct tms
*before
, struct tms
*after
)
38 { ISL_BOUND_BERNSTEIN
},
42 #define nr_methods (sizeof(methods)/sizeof(*methods))
45 struct verify_options
*verify
;
49 struct isl_arg options_arg
[] = {
50 ISL_ARG_CHILD(struct options
, verify
, NULL
, verify_options_arg
, NULL
)
51 ISL_ARG_BOOL(struct options
, quiet
, 'q', "quiet", 0, NULL
)
55 ISL_ARG_DEF(options
, struct options
, options_arg
)
59 double RE_sum
[nr_methods
];
61 my_clock_t ticks
[nr_methods
];
62 size_t size
[nr_methods
];
65 void result_data_init(struct result_data
*result
)
68 for (i
= 0; i
< nr_methods
; ++i
) {
69 result
->RE_sum
[i
] = 0;
73 isl_int_init(result
->n
);
76 void result_data_clear(struct result_data
*result
)
79 isl_int_clear(result
->n
);
82 void result_data_print(struct result_data
*result
, int n
)
86 fprintf(stderr
, "%d", result
->ticks
[0]/n
);
87 for (i
= 1; i
< nr_methods
; ++i
)
88 fprintf(stderr
, ", %d", result
->ticks
[i
]/n
);
89 fprintf(stderr
, "\n");
91 fprintf(stderr
, "%zd/%d", result
->size
[0], n
);
92 for (i
= 1; i
< nr_methods
; ++i
)
93 fprintf(stderr
, ", %zd/%d", result
->size
[i
], n
);
94 fprintf(stderr
, "\n");
96 fprintf(stderr
, "%g\n", isl_int_get_d(result
->n
));
97 fprintf(stderr
, "%g", result
->RE_sum
[0]/isl_int_get_d(result
->n
));
98 for (i
= 1; i
< nr_methods
; ++i
)
99 fprintf(stderr
, ", %g", result
->RE_sum
[i
]/isl_int_get_d(result
->n
));
100 fprintf(stderr
, "\n");
103 struct verify_point_bound
{
104 struct verify_point_data vpd
;
105 struct result_data
*result
;
106 isl_pw_qpolynomial
*pwqp
;
107 isl_pw_qpolynomial_fold
**pwf
;
110 static int verify_point(__isl_take isl_point
*pnt
, void *user
)
112 struct verify_point_bound
*vpb
= (struct verify_point_bound
*) user
;
113 const struct verify_options
*options
= vpb
->vpd
.options
;
116 isl_int max
, min
, exact
, approx
;
118 isl_qpolynomial
*opt
;
119 isl_pw_qpolynomial
*pwqp
;
127 isl_int_init(approx
);
131 pwqp
= isl_pw_qpolynomial_copy(vpb
->pwqp
);
133 nparam
= isl_pw_qpolynomial_dim(pwqp
, isl_dim_param
);
134 for (i
= 0; i
< nparam
; ++i
) {
135 isl_point_get_coordinate(pnt
, isl_dim_param
, i
, &n
);
136 pwqp
= isl_pw_qpolynomial_fix_dim(pwqp
, isl_dim_param
, i
, n
);
139 opt
= isl_pw_qpolynomial_max(isl_pw_qpolynomial_copy(pwqp
));
140 cst
= isl_qpolynomial_is_cst(opt
, &n
, &d
);
141 isl_qpolynomial_free(opt
);
143 isl_int_fdiv_q(max
, n
, d
);
145 opt
= isl_pw_qpolynomial_min(pwqp
);
146 cst
= isl_qpolynomial_is_cst(opt
, &n
, &d
);
147 isl_qpolynomial_free(opt
);
149 isl_int_cdiv_q(min
, n
, d
);
151 isl_int_sub(exact
, max
, min
);
152 isl_int_add_ui(exact
, exact
, 1);
154 if (options
->print_all
) {
155 fprintf(stderr
, "max: "); isl_int_print(stderr
, max
, 0);
156 fprintf(stderr
, ", min: "); isl_int_print(stderr
, min
, 0);
157 fprintf(stderr
, ", range: "); isl_int_print(stderr
, exact
, 0);
160 for (i
= 0; i
< nr_methods
; ++i
) {
163 opt
= isl_pw_qpolynomial_fold_eval(
164 isl_pw_qpolynomial_fold_copy(vpb
->pwf
[2 * i
]),
165 isl_point_copy(pnt
));
166 cst
= isl_qpolynomial_is_cst(opt
, &n
, &d
);
167 isl_qpolynomial_free(opt
);
169 isl_int_fdiv_q(max
, n
, d
);
171 opt
= isl_pw_qpolynomial_fold_eval(
172 isl_pw_qpolynomial_fold_copy(vpb
->pwf
[2 * i
+ 1]),
173 isl_point_copy(pnt
));
174 cst
= isl_qpolynomial_is_cst(opt
, &n
, &d
);
175 isl_qpolynomial_free(opt
);
177 isl_int_cdiv_q(min
, n
, d
);
179 isl_int_sub(approx
, max
, min
);
180 isl_int_add_ui(approx
, approx
, 1);
181 if (options
->print_all
) {
182 fprintf(stderr
, ", "); isl_int_print(stderr
, approx
, 0);
185 assert(isl_int_ge(approx
, exact
));
186 isl_int_sub(approx
, approx
, exact
);
188 error
= fabs(isl_int_get_d(approx
)) / isl_int_get_d(exact
);
189 if (options
->print_all
)
190 fprintf(stderr
, " (%g)", error
);
191 vpb
->result
->RE_sum
[i
] += error
;
194 if (options
->print_all
) {
195 fprintf(stderr
, "\n");
196 } else if ((vpb
->vpd
.n
% vpb
->vpd
.s
) == 0) {
203 isl_int_clear(exact
);
204 isl_int_clear(approx
);
213 static void test(evalue
*EP
, unsigned nvar
,
214 __isl_keep isl_pw_qpolynomial_fold
**pwf
, struct result_data
*result
,
215 struct verify_options
*options
)
217 struct verify_point_bound vpb
= { { options
}, result
};
226 ctx
= isl_pw_qpolynomial_fold_get_ctx(pwf
[0]);
227 nparam
= isl_pw_qpolynomial_fold_dim(pwf
[0], isl_dim_param
);
228 dim
= isl_dim_set_alloc(ctx
, nvar
+ nparam
, 0);
229 vpb
.pwqp
= isl_pw_qpolynomial_from_evalue(dim
, EP
);
230 vpb
.pwqp
= isl_pw_qpolynomial_move_dims(vpb
.pwqp
, isl_dim_set
, 0,
231 isl_dim_param
, 0, nvar
);
232 context
= isl_pw_qpolynomial_domain(isl_pw_qpolynomial_copy(vpb
.pwqp
));
233 context
= isl_set_remove(context
, isl_dim_set
, 0, nvar
);
234 context
= verify_context_set_bounds(context
, options
);
236 r
= verify_point_data_init(&vpb
.vpd
, context
);
238 isl_int_set_si(result
->n
, vpb
.vpd
.n
);
240 isl_set_foreach_point(context
, verify_point
, &vpb
);
241 assert(!vpb
.vpd
.error
);
243 isl_set_free(context
);
244 isl_pw_qpolynomial_free(vpb
.pwqp
);
246 verify_point_data_fini(&vpb
.vpd
);
249 void handle(FILE *in
, struct result_data
*result
, struct verify_options
*options
)
252 evalue
*EP
, *upper
, *lower
;
253 const char **all_vars
= NULL
;
256 isl_ctx
*ctx
= isl_ctx_alloc();
258 isl_pw_qpolynomial_fold
*pwf
[2*nr_methods
];
260 EP
= evalue_read_from_file(in
, NULL
, &all_vars
,
261 &nvar
, &nparam
, options
->barvinok
->MaxRays
);
263 if (EVALUE_IS_ZERO(*EP
)) {
265 Free_ParamNames(all_vars
, nvar
+nparam
);
269 upper
= evalue_dup(EP
);
270 lower
= evalue_dup(EP
);
271 evalue_frac2polynomial(upper
, 1, options
->barvinok
->MaxRays
);
272 evalue_frac2polynomial(lower
, -1, options
->barvinok
->MaxRays
);
274 dim
= isl_dim_set_alloc(ctx
, nparam
, 0);
275 for (i
= 0; i
< nr_methods
; ++i
) {
281 for (j
= 0; j
< 2; ++j
) {
282 evalue
*poly
= j
== 0 ? upper
: lower
;
283 enum isl_fold type
= j
== 0 ? isl_fold_max
: isl_fold_min
;
285 isl_pw_qpolynomial
*pwqp
;
286 dim_poly
= isl_dim_insert(isl_dim_copy(dim
), isl_dim_param
, 0, nvar
);
287 pwqp
= isl_pw_qpolynomial_from_evalue(dim_poly
, poly
);
288 pwqp
= isl_pw_qpolynomial_move_dims(pwqp
, isl_dim_set
, 0,
289 isl_dim_param
, 0, nvar
);
290 options
->barvinok
->isl
->bound
= methods
[i
].method
;
291 pwf
[2*i
+j
] = isl_pw_qpolynomial_bound(pwqp
, type
, NULL
);
294 result
->ticks
[i
] = time_diff(&en_cpu
, &st_cpu
);
295 result
->size
[i
] = isl_pw_qpolynomial_fold_size(pwf
[2*i
]);
296 result
->size
[i
] = isl_pw_qpolynomial_fold_size(pwf
[2*i
+1]);
297 if (options
->barvinok
->verbose
) {
298 isl_printer
*p
= isl_printer_to_file(ctx
, stdout
);
299 for (j
= 0; j
< 2; ++j
) {
300 p
= isl_printer_print_pw_qpolynomial_fold(p
, pwf
[2*i
+j
]);
301 p
= isl_printer_end_line(p
);
307 test(EP
, nvar
, pwf
, result
, options
);
309 for (i
= 0; i
< 2*nr_methods
; ++i
)
310 isl_pw_qpolynomial_fold_free(pwf
[i
]);
314 Free_ParamNames(all_vars
, nvar
+nparam
);
319 int main(int argc
, char **argv
)
321 char path
[PATH_MAX
+1];
322 struct result_data all_result
;
324 struct options
*options
= options_new_with_defaults();
326 argc
= options_parse(options
, argc
, argv
, ISL_ARG_ALL
);
328 if (options
->verify
->M
== INT_MIN
)
329 options
->verify
->M
= 100;
330 if (options
->verify
->m
== INT_MAX
)
331 options
->verify
->m
= -100;
333 result_data_init(&all_result
);
335 while (fgets(path
, sizeof(path
), stdin
)) {
336 struct result_data result
;
341 result_data_init(&result
);
342 fprintf(stderr
, "%s", path
);
343 *strchr(path
, '\n') = '\0';
344 in
= fopen(path
, "r");
346 handle(in
, &result
, options
->verify
);
350 result_data_print(&result
, 1);
352 isl_int_add(all_result
.n
, all_result
.n
, result
.n
);
353 for (i
= 0; i
< nr_methods
; ++i
) {
354 all_result
.RE_sum
[i
] += result
.RE_sum
[i
];
355 all_result
.ticks
[i
] += result
.ticks
[i
];
356 all_result
.size
[i
] += result
.size
[i
];
359 result_data_clear(&result
);
361 if (!options
->quiet
) {
362 fprintf(stderr
, "average\n");
363 result_data_print(&all_result
, n
);
367 result_data_clear(&all_result
);
369 options_free(options
);