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