test_bound.c

   1 #include <assert.h>
   2 #include <limits.h>
   3 #include <math.h>
   4 #include <barvinok/options.h>
   5 #include <barvinok/bernstein.h>
   6 #include <barvinok/util.h>
   7 #include <bound_common.h>
   8 #include "argp.h"
   9 #include "progname.h"
  10 #include "evalue_read.h"
  11 #include "verify.h"
  12
  13 #ifdef HAVE_SYS_TIMES_H
  14
  15 #include <sys/times.h>
  16
  17 typedef clock_t         my_clock_t;
  18
  19 static my_clock_t time_diff(struct tms *before, struct tms *after)
  20 {
  21         return after->tms_utime - before->tms_utime;
  22 }
  23
  24 #else
  25
  26 typedef int             my_clock_t;
  27
  28 struct tms {};
  29 static void times(struct tms* time)
  30 {
  31 }
  32 static my_clock_t time_diff(struct tms *before, struct tms *after)
  33 {
  34         return 0;
  35 }
  36
  37 #endif
  38
  39 static struct {
  40     int     method;
  41 } methods[] = {
  42     { BV_BOUND_BERNSTEIN },
  43     { BV_BOUND_RANGE },
  44 };
  45
  46 #define nr_methods (sizeof(methods)/sizeof(*methods))
  47
  48 struct argp_option argp_options[] = {
  49     { "quiet",      'q' },
  50     { 0 }
  51 };
  52
  53 struct options {
  54     struct verify_options    verify;
  55     int quiet;
  56 };
  57
  58 static error_t parse_opt(int key, char *arg, struct argp_state *state)
  59 {
  60     struct options *options = (struct options*) state->input;
  61
  62     switch (key) {
  63     case ARGP_KEY_INIT:
  64         state->child_inputs[0] = options->verify.barvinok;
  65         state->child_inputs[1] = &options->verify;
  66         options->quiet = 0;
  67         break;
  68     case 'q':
  69         options->quiet = 1;
  70         break;
  71     default:
  72         return ARGP_ERR_UNKNOWN;
  73     }
  74     return 0;
  75 }
  76
  77 struct result_data {
  78     isl_int                 n;
  79     double                  RE_sum[nr_methods];
  80
  81     my_clock_t              ticks[nr_methods];
  82     size_t                  size[nr_methods];
  83 };
  84
  85 void result_data_init(struct result_data *result)
  86 {
  87     int i;
  88     for (i = 0; i < nr_methods; ++i) {
  89         result->RE_sum[i] = 0;
  90         result->ticks[i] = 0;
  91         result->size[i] = 0;
  92     }
  93     isl_int_init(result->n);
  94 }
  95
  96 void result_data_clear(struct result_data *result)
  97 {
  98     int i;
  99     isl_int_clear(result->n);
 100 }
 101
 102 void result_data_print(struct result_data *result, int n)
 103 {
 104     int i;
 105
 106     fprintf(stderr, "%d", result->ticks[0]/n);
 107     for (i = 1; i < nr_methods; ++i)
 108         fprintf(stderr, ", %d", result->ticks[i]/n);
 109     fprintf(stderr, "\n");
 110
 111     fprintf(stderr, "%zd/%d", result->size[0], n);
 112     for (i = 1; i < nr_methods; ++i)
 113         fprintf(stderr, ", %zd/%d", result->size[i], n);
 114     fprintf(stderr, "\n");
 115
 116     fprintf(stderr, "%g\n", isl_int_get_d(result->n));
 117     fprintf(stderr, "%g", result->RE_sum[0]/isl_int_get_d(result->n));
 118     for (i = 1; i < nr_methods; ++i)
 119         fprintf(stderr, ", %g", result->RE_sum[i]/isl_int_get_d(result->n));
 120     fprintf(stderr, "\n");
 121 }
 122
 123 struct verify_point_bound {
 124         struct verify_point_data vpd;
 125         struct result_data *result;
 126         isl_pw_qpolynomial *pwqp;
 127         isl_pw_qpolynomial_fold **pwf;
 128 };
 129
 130 static int verify_point(__isl_take isl_point *pnt, void *user)
 131 {
 132         struct verify_point_bound *vpb = (struct verify_point_bound *) user;
 133         const struct verify_options *options = vpb->vpd.options;
 134         int i;
 135         unsigned nparam;
 136         isl_int max, min, exact, approx;
 137         isl_int n, d;
 138         isl_qpolynomial *opt;
 139         isl_pw_qpolynomial *pwqp;
 140         int cst;
 141
 142         vpb->vpd.n--;
 143
 144         isl_int_init(max);
 145         isl_int_init(min);
 146         isl_int_init(exact);
 147         isl_int_init(approx);
 148         isl_int_init(n);
 149         isl_int_init(d);
 150
 151         pwqp = isl_pw_qpolynomial_copy(vpb->pwqp);
 152
 153         nparam = isl_pw_qpolynomial_dim(pwqp, isl_dim_param);
 154         for (i = 0; i < nparam; ++i) {
 155                 isl_point_get_coordinate(pnt, isl_dim_param, i, &n);
 156                 pwqp = isl_pw_qpolynomial_fix_dim(pwqp, isl_dim_param, i, n);
 157         }
 158
 159         opt = isl_pw_qpolynomial_max(isl_pw_qpolynomial_copy(pwqp));
 160         cst = isl_qpolynomial_is_cst(opt, &n, &d);
 161         isl_qpolynomial_free(opt);
 162         assert(cst == 1);
 163         isl_int_fdiv_q(max, n, d);
 164
 165         opt = isl_pw_qpolynomial_min(pwqp);
 166         cst = isl_qpolynomial_is_cst(opt, &n, &d);
 167         isl_qpolynomial_free(opt);
 168         assert(cst == 1);
 169         isl_int_cdiv_q(min, n, d);
 170
 171         isl_int_sub(exact, max, min);
 172         isl_int_add_ui(exact, exact, 1);
 173
 174         if (options->print_all) {
 175                 fprintf(stderr, "max: "); isl_int_print(stderr, max, 0);
 176                 fprintf(stderr, ", min: "); isl_int_print(stderr, min, 0);
 177                 fprintf(stderr, ", range: "); isl_int_print(stderr, exact, 0);
 178         }
 179
 180         for (i = 0; i < nr_methods; ++i) {
 181                 double error;
 182
 183                 opt = isl_pw_qpolynomial_fold_eval(
 184                                 isl_pw_qpolynomial_fold_copy(vpb->pwf[2 * i]),
 185                                 isl_point_copy(pnt));
 186                 cst = isl_qpolynomial_is_cst(opt, &n, &d);
 187                 isl_qpolynomial_free(opt);
 188                 assert(cst == 1);
 189                 isl_int_fdiv_q(max, n, d);
 190
 191                 opt = isl_pw_qpolynomial_fold_eval(
 192                                 isl_pw_qpolynomial_fold_copy(vpb->pwf[2 * i + 1]),
 193                                 isl_point_copy(pnt));
 194                 cst = isl_qpolynomial_is_cst(opt, &n, &d);
 195                 isl_qpolynomial_free(opt);
 196                 assert(cst == 1);
 197                 isl_int_cdiv_q(min, n, d);
 198
 199                 isl_int_sub(approx, max, min);
 200                 isl_int_add_ui(approx, approx, 1);
 201                 if (options->print_all) {
 202                         fprintf(stderr, ", "); isl_int_print(stderr, approx, 0);
 203                 }
 204
 205                 assert(isl_int_ge(approx, exact));
 206                 isl_int_sub(approx, approx, exact);
 207
 208                 error = fabs(isl_int_get_d(approx)) / isl_int_get_d(exact);
 209                 if (options->print_all)
 210                         fprintf(stderr, " (%g)", error);
 211                 vpb->result->RE_sum[i] += error;
 212         }
 213
 214         if (options->print_all) {
 215                 fprintf(stderr, "\n");
 216         } else if ((vpb->vpd.n % vpb->vpd.s) == 0) {
 217                 printf("o");
 218                 fflush(stdout);
 219         }
 220
 221         isl_int_clear(max);
 222         isl_int_clear(min);
 223         isl_int_clear(exact);
 224         isl_int_clear(approx);
 225         isl_int_clear(n);
 226         isl_int_clear(d);
 227
 228         isl_point_free(pnt);
 229
 230         return 0;
 231 }
 232
 233 static void test(evalue *EP, unsigned nvar,
 234         __isl_keep isl_pw_qpolynomial_fold **pwf, struct result_data *result,
 235         struct verify_options *options)
 236 {
 237         struct verify_point_bound vpb = { { options }, result };
 238         isl_ctx *ctx;
 239         isl_dim *dim;
 240         isl_set *context;
 241         int r;
 242         int i;
 243         unsigned nparam;
 244
 245         vpb.pwf = pwf;
 246         ctx = isl_pw_qpolynomial_fold_get_ctx(pwf[0]);
 247         nparam = isl_pw_qpolynomial_fold_dim(pwf[0], isl_dim_param);
 248         dim = isl_dim_set_alloc(ctx, nvar + nparam, 0);
 249         vpb.pwqp = isl_pw_qpolynomial_from_evalue(dim, EP);
 250         vpb.pwqp = isl_pw_qpolynomial_move(vpb.pwqp, isl_dim_set, 0,
 251                                                 isl_dim_param, 0, nvar);
 252         context = isl_pw_qpolynomial_domain(isl_pw_qpolynomial_copy(vpb.pwqp));
 253         context = isl_set_remove(context, isl_dim_set, 0, nvar);
 254         context = verify_context_set_bounds(context, options);
 255
 256         r = verify_point_data_init(&vpb.vpd, context);
 257         assert(r == 0);
 258         isl_int_set_si(result->n, vpb.vpd.n);
 259
 260         isl_set_foreach_point(context, verify_point, &vpb);
 261         assert(!vpb.vpd.error);
 262
 263         isl_set_free(context);
 264         isl_pw_qpolynomial_free(vpb.pwqp);
 265
 266         verify_point_data_fini(&vpb.vpd);
 267 }
 268
 269 void handle(FILE *in, struct result_data *result, struct verify_options *options)
 270 {
 271     int i;
 272     evalue *EP, *upper, *lower;
 273     const char **all_vars = NULL;
 274     unsigned nvar;
 275     unsigned nparam;
 276     isl_ctx *ctx = isl_ctx_alloc();
 277     isl_dim *dim;
 278     isl_pw_qpolynomial_fold *pwf[2*nr_methods];
 279
 280     EP = evalue_read_from_file(in, NULL, &all_vars,
 281                                &nvar, &nparam, options->barvinok->MaxRays);
 282     assert(EP);
 283     if (EVALUE_IS_ZERO(*EP)) {
 284         evalue_free(EP);
 285         Free_ParamNames(all_vars, nvar+nparam);
 286         return;
 287     }
 288
 289     upper = evalue_dup(EP);
 290     lower = evalue_dup(EP);
 291     evalue_frac2polynomial(upper, 1, options->barvinok->MaxRays);
 292     evalue_frac2polynomial(lower, -1, options->barvinok->MaxRays);
 293
 294     dim = isl_dim_set_alloc(ctx, nparam, 0);
 295     for (i = 0; i < nr_methods; ++i) {
 296         int j;
 297         struct tms st_cpu;
 298         struct tms en_cpu;
 299
 300         times(&st_cpu);
 301         for (j = 0; j < 2; ++j) {
 302             evalue *poly = j == 0 ? upper : lower;
 303             int sign = j == 0 ? BV_BERNSTEIN_MAX : BV_BERNSTEIN_MIN;
 304             enum isl_fold type = j == 0 ? isl_fold_max : isl_fold_min;
 305             isl_dim *dim_poly;
 306             isl_pw_qpolynomial *pwqp;
 307             options->barvinok->bernstein_optimize = sign;
 308             dim_poly = isl_dim_insert(isl_dim_copy(dim), isl_dim_param, 0, nvar);
 309             pwqp = isl_pw_qpolynomial_from_evalue(dim_poly, poly);
 310             pwqp = isl_pw_qpolynomial_move(pwqp, isl_dim_set, 0,
 311                                             isl_dim_param, 0, nvar);
 312             pwf[2*i+j] = isl_pw_qpolynomial_bound(pwqp, type, methods[i].method);
 313         }
 314         times(&en_cpu);
 315         result->ticks[i] = time_diff(&en_cpu, &st_cpu);
 316         result->size[i] = isl_pw_qpolynomial_fold_size(pwf[2*i]);
 317         result->size[i] = isl_pw_qpolynomial_fold_size(pwf[2*i+1]);
 318         if (options->barvinok->verbose) {
 319             isl_printer *p = isl_printer_to_file(ctx, stdout);
 320             for (j = 0; j < 2; ++j) {
 321                 p = isl_printer_print_pw_qpolynomial_fold(p, pwf[2*i+j]);
 322                 p = isl_printer_end_line(p);
 323             }
 324             isl_printer_free(p);
 325         }
 326     }
 327     isl_dim_free(dim);
 328     test(EP, nvar, pwf, result, options);
 329
 330     for (i = 0; i < 2*nr_methods; ++i)
 331         isl_pw_qpolynomial_fold_free(pwf[i]);
 332     evalue_free(EP);
 333     evalue_free(lower);
 334     evalue_free(upper);
 335     Free_ParamNames(all_vars, nvar+nparam);
 336
 337     isl_ctx_free(ctx);
 338 }
 339
 340 int main(int argc, char **argv)
 341 {
 342     struct barvinok_options *bv_options = barvinok_options_new_with_defaults();
 343     char path[PATH_MAX+1];
 344     struct result_data all_result;
 345     int n = 0;
 346     static struct argp_child argp_children[] = {
 347         { &barvinok_argp,       0,      0,              0 },
 348         { &verify_argp,         0,      "verification",         BV_GRP_LAST+1 },
 349         { 0 }
 350     };
 351     static struct argp argp = { argp_options, parse_opt, 0, 0, argp_children };
 352     struct options options;
 353
 354     options.verify.barvinok = bv_options;
 355     set_program_name(argv[0]);
 356     argp_parse(&argp, argc, argv, 0, 0, &options);
 357
 358     if (options.verify.M == INT_MIN)
 359         options.verify.M = 100;
 360     if (options.verify.m == INT_MAX)
 361         options.verify.m = -100;
 362
 363     result_data_init(&all_result);
 364
 365     while (fgets(path, sizeof(path), stdin)) {
 366         struct result_data result;
 367         FILE *in;
 368         int i;
 369
 370         ++n;
 371         result_data_init(&result);
 372         fprintf(stderr, "%s", path);
 373         *strchr(path, '\n') = '\0';
 374         in = fopen(path, "r");
 375         assert(in);
 376         handle(in, &result, &options.verify);
 377         fclose(in);
 378
 379         if (!options.quiet)
 380             result_data_print(&result, 1);
 381
 382         isl_int_add(all_result.n, all_result.n, result.n);
 383         for (i = 0; i < nr_methods; ++i) {
 384             all_result.RE_sum[i] += result.RE_sum[i];
 385             all_result.ticks[i] += result.ticks[i];
 386             all_result.size[i] += result.size[i];
 387         }
 388
 389         result_data_clear(&result);
 390
 391         if (!options.quiet) {
 392             fprintf(stderr, "average\n");
 393             result_data_print(&all_result, n);
 394         }
 395     }
 396
 397     result_data_clear(&all_result);
 398
 399     barvinok_options_free(bv_options);
 400
 401     return 0;
 402 }