bound.c

   1 #include <assert.h>
   2 #include <isl/stream.h>
   3 #include <barvinok/options.h>
   4 #include <barvinok/util.h>
   5 #include <barvinok/barvinok.h>
   6 #include "verify.h"
   7
   8 struct options {
   9         struct verify_options    *verify;
  10         long split;
  11         int lower;
  12         long iterate;
  13 };
  14
  15 ISL_ARGS_START(struct options, options_args)
  16 ISL_ARG_CHILD(struct options, verify, NULL,
  17         &verify_options_args, "verification")
  18 ISL_ARG_LONG(struct options, split, 0, "split", 0, NULL)
  19 ISL_ARG_OPT_LONG(struct options, iterate, 0, "iterate", 0, -1,
  20         "exact result by iterating over domain (of specified maximal size)")
  21 ISL_ARG_BOOL(struct options, lower, 0, "lower", 0,
  22         "compute lower bound instead of upper bound")
  23 ISL_ARGS_END
  24
  25 ISL_ARG_DEF(options, struct options, options_args)
  26
  27 struct verify_point_bound {
  28         struct verify_point_data vpd;
  29         isl_pw_qpolynomial *pwqp;
  30         isl_pw_qpolynomial_fold *pwf;
  31         enum isl_fold type;
  32 };
  33
  34 static int verify_point(__isl_take isl_point *pnt, void *user)
  35 {
  36         int i;
  37         unsigned nparam;
  38         struct verify_point_bound *vpb = (struct verify_point_bound *) user;
  39         isl_val *v, *b, *q, *t;
  40         isl_pw_qpolynomial *pwqp;
  41         isl_qpolynomial *bound;
  42         isl_qpolynomial *opt;
  43         const char *minmax;
  44         int sign;
  45         int ok;
  46         int cst;
  47         FILE *out = vpb->vpd.options->print_all ? stdout : stderr;
  48
  49         vpb->vpd.n--;
  50
  51         if (vpb->type == isl_fold_max) {
  52                 minmax = "max";
  53                 sign = 1;
  54         } else {
  55                 minmax = "min";
  56                 sign = -1;
  57         }
  58
  59         pwqp = isl_pw_qpolynomial_copy(vpb->pwqp);
  60
  61         nparam = isl_pw_qpolynomial_dim(pwqp, isl_dim_param);
  62         for (i = 0; i < nparam; ++i) {
  63                 t = isl_point_get_coordinate_val(pnt, isl_dim_param, i);
  64                 pwqp = isl_pw_qpolynomial_fix_val(pwqp, isl_dim_param, i, t);
  65         }
  66
  67         bound = isl_pw_qpolynomial_fold_eval(isl_pw_qpolynomial_fold_copy(vpb->pwf),
  68                                                 isl_point_copy(pnt));
  69         b = isl_qpolynomial_get_constant_val(bound);
  70         isl_qpolynomial_free(bound);
  71
  72         if (sign > 0)
  73                 opt = isl_pw_qpolynomial_max(pwqp);
  74         else
  75                 opt = isl_pw_qpolynomial_min(pwqp);
  76         v = isl_qpolynomial_get_constant_val(opt);
  77         isl_qpolynomial_free(opt);
  78
  79         if (sign > 0)
  80                 v = isl_val_floor(v);
  81         else
  82                 v = isl_val_ceil(v);
  83
  84         q = isl_val_copy(b);
  85         if (sign > 0)
  86                 b = isl_val_floor(b);
  87         else
  88                 b = isl_val_ceil(b);
  89
  90         if (sign > 0)
  91                 ok = isl_val_ge(b, v);
  92         else
  93                 ok = isl_val_le(b, v);
  94
  95         if (vpb->vpd.options->print_all || !ok) {
  96                 isl_ctx *ctx = isl_point_get_ctx(pnt);
  97                 isl_printer *p;
  98                 p = isl_printer_to_file(ctx, out);
  99                 p = isl_printer_print_str(p, minmax);
 100                 p = isl_printer_print_str(p, "(");
 101                 for (i = 0; i < nparam; ++i) {
 102                         if (i)
 103                                 p = isl_printer_print_str(p, ", ");
 104                         t = isl_point_get_coordinate_val(pnt, isl_dim_param, i);
 105                         p = isl_printer_print_val(p, t);
 106                         isl_val_free(t);
 107                 }
 108                 p = isl_printer_print_str(p, ") = ");
 109                 p = isl_printer_print_val(p, q);
 110                 if (!isl_val_is_int(q)) {
 111                         p = isl_printer_print_str(p, " (");
 112                         p = isl_printer_print_val(p, b);
 113                         p = isl_printer_print_str(p, ")");
 114                 }
 115                 p = isl_printer_print_str(p, ", ");
 116                 p = isl_printer_print_str(p, minmax);
 117                 p = isl_printer_print_str(p, "(EP) = ");
 118                 p = isl_printer_print_val(p, v);
 119                 if (ok)
 120                         p = isl_printer_print_str(p, ". OK");
 121                 else
 122                         p = isl_printer_print_str(p, ". NOT OK");
 123                 p = isl_printer_end_line(p);
 124                 isl_printer_free(p);
 125         } else if ((vpb->vpd.n % vpb->vpd.s) == 0) {
 126                 printf("o");
 127                 fflush(stdout);
 128         }
 129
 130         if (0) {
 131 error:
 132                 ok = 0;
 133         }
 134
 135         isl_point_free(pnt);
 136
 137         isl_val_free(b);
 138         isl_val_free(q);
 139         isl_val_free(v);
 140
 141         if (!ok)
 142                 vpb->vpd.error = 1;
 143
 144         if (vpb->vpd.options->continue_on_error)
 145                 ok = 1;
 146
 147         return (vpb->vpd.n >= 1 && ok) ? 0 : -1;
 148 }
 149
 150 static int verify(__isl_keep isl_pw_qpolynomial_fold *pwf,
 151         __isl_take isl_pw_qpolynomial *pwqp, enum isl_fold type,
 152         struct verify_options *options)
 153 {
 154         struct verify_point_bound vpb = { { options } };
 155         isl_set *context;
 156         int r;
 157
 158         vpb.pwf = pwf;
 159         vpb.type = type;
 160         vpb.pwqp = pwqp;
 161         context = isl_pw_qpolynomial_fold_domain(
 162                                         isl_pw_qpolynomial_fold_copy(vpb.pwf));
 163         context = verify_context_set_bounds(context, options);
 164
 165         r = verify_point_data_init(&vpb.vpd, context);
 166
 167         if (r == 0)
 168                 isl_set_foreach_point(context, verify_point, &vpb);
 169         if (vpb.vpd.error)
 170                 r = -1;
 171
 172         isl_set_free(context);
 173         isl_pw_qpolynomial_free(pwqp);
 174
 175         verify_point_data_fini(&vpb.vpd);
 176
 177         return r;
 178 }
 179
 180 static __isl_give isl_pw_qpolynomial_fold *iterate(
 181         __isl_take isl_pw_qpolynomial *pwqp, enum isl_fold type)
 182 {
 183         isl_space *dim = isl_pw_qpolynomial_get_space(pwqp);
 184         isl_set *set;
 185         isl_qpolynomial *qp;
 186         isl_qpolynomial_fold *fold;
 187         unsigned nvar;
 188
 189         assert(isl_space_dim(dim, isl_dim_param) == 0);
 190         nvar = isl_space_dim(dim, isl_dim_set);
 191
 192         if (type == isl_fold_min)
 193                 qp = isl_pw_qpolynomial_min(pwqp);
 194         else
 195                 qp = isl_pw_qpolynomial_max(pwqp);
 196
 197         qp = isl_qpolynomial_drop_dims(qp, isl_dim_set, 0, nvar);
 198         fold = isl_qpolynomial_fold_alloc(type, qp);
 199         dim = isl_space_drop_dims(dim, isl_dim_set, 0, nvar);
 200         set = isl_set_universe(dim);
 201
 202         return isl_pw_qpolynomial_fold_alloc(type, set, fold);
 203 }
 204
 205 struct bv_split_data {
 206         int size;
 207         __isl_give isl_pw_qpolynomial *pwqp_less;
 208         __isl_give isl_pw_qpolynomial *pwqp_more;
 209 };
 210
 211 static int split_on_size(__isl_take isl_set *set,
 212         __isl_take isl_qpolynomial *qp, void *user)
 213 {
 214         struct bv_split_data *data = (struct bv_split_data *)user;
 215         int bounded;
 216         isl_set *set_np;
 217         isl_pw_qpolynomial *pwqp;
 218         int nparam;
 219
 220         nparam = isl_set_dim(set, isl_dim_param);
 221         set_np = isl_set_move_dims(isl_set_copy(set), isl_dim_set, 0,
 222                                         isl_dim_param, 0, nparam);
 223         bounded = isl_set_is_bounded(set_np);
 224         assert(bounded >= 0);
 225         if (bounded) {
 226                 isl_pw_qpolynomial *pwqp;
 227                 isl_qpolynomial *cst;
 228                 isl_val *m;
 229
 230                 pwqp = isl_set_card(set_np);
 231                 cst = isl_pw_qpolynomial_max(pwqp);
 232                 m = isl_qpolynomial_get_constant_val(cst);
 233                 isl_qpolynomial_free(cst);
 234                 bounded = isl_val_cmp_si(m, data->size) <= 0;
 235                 isl_val_free(m);
 236         } else
 237                 isl_set_free(set_np);
 238
 239         pwqp = isl_pw_qpolynomial_alloc(set, qp);
 240         if (bounded)
 241                 data->pwqp_less = isl_pw_qpolynomial_add_disjoint(
 242                                                 data->pwqp_less, pwqp);
 243         else
 244                 data->pwqp_more = isl_pw_qpolynomial_add_disjoint(
 245                                                 data->pwqp_more, pwqp);
 246
 247         return 0;
 248 }
 249
 250 /*
 251  * Split (partition) pwpq into a partition with (sub)domains containing
 252  * size integer points or less and a partition with (sub)domains
 253  * containing more integer points.
 254  */
 255 static int split_on_domain_size(__isl_take isl_pw_qpolynomial *pwqp,
 256         __isl_give isl_pw_qpolynomial **pwqp_less,
 257         __isl_give isl_pw_qpolynomial **pwqp_more,
 258         int size)
 259 {
 260         isl_space *dim;
 261         struct bv_split_data data = { size };
 262         int r;
 263
 264         dim = isl_pw_qpolynomial_get_space(pwqp);
 265         data.pwqp_less = isl_pw_qpolynomial_zero(isl_space_copy(dim));
 266         data.pwqp_more = isl_pw_qpolynomial_zero(dim);
 267         r = isl_pw_qpolynomial_foreach_piece(pwqp, &split_on_size, &data);
 268         *pwqp_less = data.pwqp_less;
 269         *pwqp_more = data.pwqp_more;
 270         isl_pw_qpolynomial_free(pwqp);
 271
 272         return r;
 273 }
 274
 275 static __isl_give isl_pw_qpolynomial_fold *optimize(
 276         __isl_take isl_pw_qpolynomial *pwqp, enum isl_fold type,
 277         struct options *options)
 278 {
 279     isl_pw_qpolynomial_fold *pwf;
 280
 281     if (options->iterate > 0) {
 282         isl_pw_qpolynomial *pwqp_less, *pwqp_more;
 283         isl_pw_qpolynomial_fold *pwf_less, *pwf_more;
 284         split_on_domain_size(pwqp, &pwqp_less, &pwqp_more, options->iterate);
 285         pwf_less = iterate(pwqp_less, type);
 286         pwf_more = isl_pw_qpolynomial_bound(pwqp_more, type, NULL);
 287         pwf = isl_pw_qpolynomial_fold_fold(pwf_less, pwf_more);
 288     } else if (options->iterate)
 289         pwf = iterate(pwqp, type);
 290     else
 291         pwf = isl_pw_qpolynomial_bound(pwqp, type, NULL);
 292     return pwf;
 293 }
 294
 295 static int optimize_and_print(__isl_take isl_pw_qpolynomial *pwqp,
 296         struct options *options)
 297 {
 298     int print_solution = 1;
 299     int result = 0;
 300     isl_pw_qpolynomial_fold *pwf;
 301     enum isl_fold type = options->lower ? isl_fold_min : isl_fold_max;
 302
 303     if (options->verify->verify) {
 304         isl_space *dim = isl_pw_qpolynomial_get_space(pwqp);
 305         unsigned total = isl_space_dim(dim, isl_dim_all);
 306         isl_space_free(dim);
 307         verify_options_set_range(options->verify, total);
 308         if (!options->verify->barvinok->verbose)
 309             print_solution = 0;
 310     }
 311
 312     pwf = optimize(isl_pw_qpolynomial_copy(pwqp), type, options);
 313     assert(pwf);
 314     if (print_solution) {
 315         isl_ctx *ctx = isl_pw_qpolynomial_get_ctx(pwqp);
 316         isl_printer *p = isl_printer_to_file(ctx, stdout);
 317         p = isl_printer_print_pw_qpolynomial_fold(p, pwf);
 318         p = isl_printer_end_line(p);
 319         isl_printer_free(p);
 320     }
 321     if (options->verify->verify) {
 322         enum isl_fold type = options->lower ? isl_fold_min : isl_fold_max;
 323         result = verify(pwf, pwqp, type, options->verify);
 324     } else
 325         isl_pw_qpolynomial_free(pwqp);
 326     isl_pw_qpolynomial_fold_free(pwf);
 327
 328     return result;
 329 }
 330
 331 int main(int argc, char **argv)
 332 {
 333     struct options *options = options_new_with_defaults();
 334     isl_ctx *ctx;
 335     isl_pw_qpolynomial *pwqp;
 336     struct isl_stream *s;
 337     int result = 0;
 338
 339     argc = options_parse(options, argc, argv, ISL_ARG_ALL);
 340     ctx = isl_ctx_alloc_with_options(&options_args, options);
 341
 342     s = isl_stream_new_file(ctx, stdin);
 343     pwqp = isl_stream_read_pw_qpolynomial(s);
 344
 345     if (options->split)
 346         pwqp = isl_pw_qpolynomial_split_periods(pwqp, options->split);
 347
 348     result = optimize_and_print(pwqp, options);
 349
 350     isl_stream_free(s);
 351     isl_ctx_free(ctx);
 352     return result;
 353 }