2 #include <isl/stream.h>
3 #include <barvinok/barvinok.h>
4 #include <barvinok/options.h>
5 #include <barvinok/util.h>
9 struct verify_options
*verify
;
12 ISL_ARGS_START(struct options
, options_args
)
13 ISL_ARG_CHILD(struct options
, verify
, NULL
,
14 &verify_options_args
, "verification")
17 ISL_ARG_DEF(options
, struct options
, options_args
)
19 struct verify_point_sum
{
20 struct verify_point_data vpd
;
21 isl_pw_qpolynomial
*pwqp
;
22 isl_pw_qpolynomial
*sum
;
24 isl_pw_qpolynomial
*fixed
;
25 isl_qpolynomial
*manual
;
28 static int manual_sum(__isl_take isl_point
*pnt
, void *user
)
30 struct verify_point_sum
*vps
= (struct verify_point_sum
*) user
;
33 qp
= isl_pw_qpolynomial_eval(isl_pw_qpolynomial_copy(vps
->fixed
), pnt
);
34 vps
->manual
= isl_qpolynomial_add(vps
->manual
, qp
);
39 static int verify_point(__isl_take isl_point
*pnt
, void *user
)
41 struct verify_point_sum
*vps
= (struct verify_point_sum
*) user
;
49 isl_qpolynomial
*eval
;
51 FILE *out
= vps
->vpd
.options
->print_all
? stdout
: stderr
;
56 vps
->fixed
= isl_pw_qpolynomial_copy(vps
->pwqp
);
57 nparam
= isl_pw_qpolynomial_dim(vps
->sum
, isl_dim_param
);
58 for (i
= 0; i
< nparam
; ++i
) {
59 isl_point_get_coordinate(pnt
, isl_dim_param
, i
, &v
);
60 vps
->fixed
= isl_pw_qpolynomial_fix_dim(vps
->fixed
,
64 eval
= isl_pw_qpolynomial_eval(isl_pw_qpolynomial_copy(vps
->sum
),
67 space
= isl_pw_qpolynomial_get_domain_space(vps
->pwqp
);
68 vps
->manual
= isl_qpolynomial_zero_on_domain(space
);
69 dom
= isl_pw_qpolynomial_domain(isl_pw_qpolynomial_copy(vps
->fixed
));
70 r
= isl_set_foreach_point(dom
, &manual_sum
, user
);
75 nvar
= isl_set_dim(dom
, isl_dim_set
);
76 vps
->manual
= isl_qpolynomial_project_domain_on_params(vps
->manual
);
78 ok
= isl_qpolynomial_plain_is_equal(eval
, vps
->manual
);
80 if (vps
->vpd
.options
->print_all
|| !ok
) {
81 isl_ctx
*ctx
= isl_pw_qpolynomial_get_ctx(vps
->pwqp
);
82 isl_printer
*p
= isl_printer_to_file(ctx
, out
);
84 for (i
= 0; i
< nparam
; ++i
) {
87 isl_point_get_coordinate(pnt
, isl_dim_param
, i
, &v
);
88 isl_int_print(out
, v
, 0);
91 p
= isl_printer_print_qpolynomial(p
, eval
);
92 fprintf(out
, ", sum(EP) = ");
93 p
= isl_printer_print_qpolynomial(p
, vps
->manual
);
95 fprintf(out
, ". OK\n");
97 fprintf(out
, ". NOT OK\n");
99 } else if ((vps
->vpd
.n
% vps
->vpd
.s
) == 0) {
108 isl_qpolynomial_free(vps
->manual
);
109 isl_pw_qpolynomial_free(vps
->fixed
);
110 isl_qpolynomial_free(eval
);
117 if (vps
->vpd
.options
->continue_on_error
)
120 return (vps
->vpd
.n
>= 1 && ok
) ? 0 : -1;
123 static int verify(__isl_keep isl_pw_qpolynomial
*pwqp
,
124 __isl_take isl_pw_qpolynomial
*sum
, struct verify_options
*options
)
126 struct verify_point_sum vps
= { { options
} };
133 context
= isl_pw_qpolynomial_domain(isl_pw_qpolynomial_copy(sum
));
134 context
= verify_context_set_bounds(context
, options
);
136 r
= verify_point_data_init(&vps
.vpd
, context
);
139 isl_set_foreach_point(context
, verify_point
, &vps
);
143 isl_set_free(context
);
145 verify_point_data_fini(&vps
.vpd
);
150 int main(int argc
, char **argv
)
156 isl_pw_qpolynomial
*pwqp
;
157 isl_pw_qpolynomial
*sum
;
158 struct isl_stream
*s
;
159 struct options
*options
= options_new_with_defaults();
161 argc
= options_parse(options
, argc
, argv
, ISL_ARG_ALL
);
162 ctx
= isl_ctx_alloc_with_options(&options_args
, options
);
164 s
= isl_stream_new_file(ctx
, stdin
);
165 pwqp
= isl_stream_read_pw_qpolynomial(s
);
167 if (options
->verify
->verify
) {
168 isl_space
*dim
= isl_pw_qpolynomial_get_space(pwqp
);
169 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
171 verify_options_set_range(options
->verify
, total
);
174 sum
= isl_pw_qpolynomial_sum(isl_pw_qpolynomial_copy(pwqp
));
175 if (options
->verify
->verify
)
176 result
= verify(pwqp
, sum
, options
->verify
);
178 isl_printer
*p
= isl_printer_to_file(ctx
, stdout
);
179 p
= isl_printer_print_pw_qpolynomial(p
, sum
);
180 p
= isl_printer_end_line(p
);
183 isl_pw_qpolynomial_free(sum
);
184 isl_pw_qpolynomial_free(pwqp
);