2 #include <isl/stream.h>
3 #include <isl_polynomial_private.h>
7 struct isl_options *isl;
10 int continue_on_error;
13 struct isl_arg bound_options_arg[] = {
14 ISL_ARG_CHILD(struct bound_options, isl, "isl", isl_options_arg, "isl options")
15 ISL_ARG_BOOL(struct bound_options, verify, 'T', "verify", 0, NULL)
16 ISL_ARG_BOOL(struct bound_options, print_all, 'A', "print-all", 0, NULL)
17 ISL_ARG_BOOL(struct bound_options, continue_on_error, '\0', "continue-on-error", 0, NULL)
21 ISL_ARG_DEF(bound_options, struct bound_options, bound_options_arg)
23 static __isl_give isl_set *set_bounds(__isl_take isl_set *set)
30 nparam = isl_set_dim(set, isl_dim_param);
31 r = nparam >= 8 ? 5 : nparam >= 5 ? 15 : 50;
33 pt = isl_set_sample_point(isl_set_copy(set));
34 pt2 = isl_point_copy(pt);
36 for (i = 0; i < nparam; ++i) {
37 pt = isl_point_add_ui(pt, isl_dim_param, i, r);
38 pt2 = isl_point_sub_ui(pt2, isl_dim_param, i, r);
41 box = isl_set_box_from_points(pt, pt2);
43 return isl_set_intersect(set, box);
46 struct verify_point_bound {
47 struct bound_options *options;
53 isl_pw_qpolynomial_fold *pwf;
54 isl_pw_qpolynomial_fold *bound;
57 static int verify_point(__isl_take isl_point *pnt, void *user)
62 struct verify_point_bound *vpb = (struct verify_point_bound *) user;
64 isl_pw_qpolynomial_fold *pwf;
65 isl_qpolynomial *bound = NULL;
66 isl_qpolynomial *opt = NULL;
72 FILE *out = vpb->options->print_all ? stdout : stderr;
86 pwf = isl_pw_qpolynomial_fold_copy(vpb->pwf);
88 nparam = isl_pw_qpolynomial_fold_dim(pwf, isl_dim_param);
89 for (i = 0; i < nparam; ++i) {
90 isl_point_get_coordinate(pnt, isl_dim_param, i, &t);
91 pwf = isl_pw_qpolynomial_fold_fix_dim(pwf, isl_dim_param, i, t);
94 bound = isl_pw_qpolynomial_fold_eval(
95 isl_pw_qpolynomial_fold_copy(vpb->bound),
98 dom = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf));
99 bounded = isl_set_is_bounded(dom);
105 opt = isl_pw_qpolynomial_fold_eval(
106 isl_pw_qpolynomial_fold_copy(pwf),
107 isl_set_sample_point(isl_set_copy(dom)));
109 opt = isl_pw_qpolynomial_fold_max(isl_pw_qpolynomial_fold_copy(pwf));
111 opt = isl_pw_qpolynomial_fold_min(isl_pw_qpolynomial_fold_copy(pwf));
113 nvar = isl_set_dim(dom, isl_dim_set);
114 opt = isl_qpolynomial_project_domain_on_params(opt);
115 if (vpb->exact && bounded)
116 ok = isl_qpolynomial_plain_is_equal(opt, bound);
118 ok = isl_qpolynomial_le_cst(opt, bound);
120 ok = isl_qpolynomial_le_cst(bound, opt);
124 if (vpb->options->print_all || !ok) {
125 fprintf(out, "%s(", minmax);
126 for (i = 0; i < nparam; ++i) {
129 isl_point_get_coordinate(pnt, isl_dim_param, i, &t);
130 isl_int_print(out, t, 0);
132 fprintf(out, ") = ");
133 isl_qpolynomial_print(bound, out, ISL_FORMAT_ISL);
134 fprintf(out, ", %s = ", bounded ? "opt" : "sample");
135 isl_qpolynomial_print(opt, out, ISL_FORMAT_ISL);
137 fprintf(out, ". OK\n");
139 fprintf(out, ". NOT OK\n");
140 } else if ((vpb->n % vpb->stride) == 0) {
150 isl_pw_qpolynomial_fold_free(pwf);
151 isl_qpolynomial_free(bound);
152 isl_qpolynomial_free(opt);
161 if (vpb->options->continue_on_error)
164 return (vpb->n >= 1 && ok) ? 0 : -1;
167 static int check_solution(__isl_take isl_pw_qpolynomial_fold *pwf,
168 __isl_take isl_pw_qpolynomial_fold *bound, int exact,
169 struct bound_options *options)
171 struct verify_point_bound vpb;
177 dom = isl_pw_qpolynomial_fold_domain(isl_pw_qpolynomial_fold_copy(pwf));
178 context = isl_set_params(isl_set_copy(dom));
179 context = isl_set_remove_divs(context);
180 context = set_bounds(context);
185 isl_int_set_si(max, 200);
186 r = isl_set_count_upto(context, max, &count);
188 n = isl_int_get_si(count);
191 isl_int_clear(count);
193 vpb.options = options;
197 vpb.stride = n > 70 ? 1 + (n + 1)/70 : 1;
201 if (!options->print_all) {
202 for (i = 0; i < vpb.n; i += vpb.stride)
208 isl_set_foreach_point(context, verify_point, &vpb);
210 isl_set_free(context);
212 isl_pw_qpolynomial_fold_free(pwf);
213 isl_pw_qpolynomial_fold_free(bound);
215 if (!options->print_all)
219 fprintf(stderr, "Check failed !\n");
226 int main(int argc, char **argv)
229 isl_pw_qpolynomial_fold *copy;
230 isl_pw_qpolynomial_fold *pwf;
231 struct isl_stream *s;
233 struct bound_options *options;
237 options = bound_options_new_with_defaults();
239 argc = bound_options_parse(options, argc, argv, ISL_ARG_ALL);
241 ctx = isl_ctx_alloc_with_options(bound_options_arg, options);
243 s = isl_stream_new_file(ctx, stdin);
244 obj = isl_stream_read_obj(s);
245 if (obj.type == isl_obj_pw_qpolynomial)
246 pwf = isl_pw_qpolynomial_fold_from_pw_qpolynomial(isl_fold_max,
248 else if (obj.type == isl_obj_pw_qpolynomial_fold)
251 obj.type->free(obj.v);
252 isl_die(ctx, isl_error_invalid, "invalid input", goto error);
256 copy = isl_pw_qpolynomial_fold_copy(pwf);
258 pwf = isl_pw_qpolynomial_fold_bound(pwf, &exact);
259 pwf = isl_pw_qpolynomial_fold_coalesce(pwf);
261 if (options->verify) {
262 r = check_solution(copy, pwf, exact, options);
265 printf("# NOT exact\n");
266 isl_pw_qpolynomial_fold_print(pwf, stdout, 0);
267 fprintf(stdout, "\n");
268 isl_pw_qpolynomial_fold_free(pwf);