bound.c

   1 #include <assert.h>
   2 #include <isl_stream.h>
   3 #include <isl_polynomial_private.h>
   4 #include <isl_scan.h>
   5
   6 struct bound_options {
   7         struct isl_options      *isl;
   8         unsigned                 verify;
   9         int                      print_all;
  10         int                      continue_on_error;
  11 };
  12
  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)
  18 ISL_ARG_END
  19 };
  20
  21 ISL_ARG_DEF(bound_options, struct bound_options, bound_options_arg)
  22
  23 static __isl_give isl_set *set_bounds(__isl_take isl_set *set)
  24 {
  25         unsigned nparam;
  26         int i, r;
  27         isl_point *pt, *pt2;
  28         isl_set *box;
  29
  30         nparam = isl_set_dim(set, isl_dim_param);
  31         r = nparam >= 8 ? 5 : nparam >= 5 ? 15 : 50;
  32
  33         pt = isl_set_sample_point(isl_set_copy(set));
  34         pt2 = isl_point_copy(pt);
  35
  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);
  39         }
  40
  41         box = isl_set_box_from_points(pt, pt2);
  42
  43         return isl_set_intersect(set, box);
  44 }
  45
  46 struct verify_point_bound {
  47         struct bound_options *options;
  48         int stride;
  49         int n;
  50         int exact;
  51         int error;
  52
  53         isl_pw_qpolynomial *pwqp;
  54         isl_pw_qpolynomial_fold *pwf;
  55 };
  56
  57 static int verify_point(__isl_take isl_point *pnt, void *user)
  58 {
  59         int i;
  60         unsigned nparam;
  61         struct verify_point_bound *vpb = (struct verify_point_bound *) user;
  62         isl_int t;
  63         isl_pw_qpolynomial *pwqp;
  64         isl_qpolynomial *bound = NULL;
  65         isl_qpolynomial *opt = NULL;
  66         isl_set *dom = NULL;
  67         const char *minmax;
  68         int bounded;
  69         int sign;
  70         int ok;
  71         int cst;
  72         FILE *out = vpb->options->print_all ? stdout : stderr;
  73
  74         vpb->n--;
  75
  76         if (1) {
  77                 minmax = "ub";
  78                 sign = 1;
  79         } else {
  80                 minmax = "lb";
  81                 sign = -1;
  82         }
  83
  84         isl_int_init(t);
  85
  86         pwqp = isl_pw_qpolynomial_copy(vpb->pwqp);
  87
  88         nparam = isl_pw_qpolynomial_dim(pwqp, isl_dim_param);
  89         for (i = 0; i < nparam; ++i) {
  90                 isl_point_get_coordinate(pnt, isl_dim_param, i, &t);
  91                 pwqp = isl_pw_qpolynomial_fix_dim(pwqp, isl_dim_param, i, t);
  92         }
  93
  94         bound = isl_pw_qpolynomial_fold_eval(isl_pw_qpolynomial_fold_copy(vpb->pwf),
  95                                                 isl_point_copy(pnt));
  96
  97         dom = isl_pw_qpolynomial_domain(isl_pw_qpolynomial_copy(pwqp));
  98         bounded = isl_set_is_bounded(dom);
  99
 100         if (bounded < 0)
 101                 goto error;
 102
 103         if (!bounded)
 104                 opt = isl_pw_qpolynomial_eval(isl_pw_qpolynomial_copy(pwqp),
 105                                     isl_set_sample_point(isl_set_copy(dom)));
 106         else if (sign > 0)
 107                 opt = isl_pw_qpolynomial_max(isl_pw_qpolynomial_copy(pwqp));
 108         else
 109                 opt = isl_pw_qpolynomial_min(isl_pw_qpolynomial_copy(pwqp));
 110
 111         if (vpb->exact && bounded)
 112                 ok = isl_qpolynomial_is_equal(opt, bound);
 113         else if (sign > 0)
 114                 ok = isl_qpolynomial_le_cst(opt, bound);
 115         else
 116                 ok = isl_qpolynomial_le_cst(bound, opt);
 117         if (ok < 0)
 118                 goto error;
 119
 120         if (vpb->options->print_all || !ok) {
 121                 fprintf(out, "%s(", minmax);
 122                 for (i = 0; i < nparam; ++i) {
 123                         if (i)
 124                                 fprintf(out, ", ");
 125                         isl_point_get_coordinate(pnt, isl_dim_param, i, &t);
 126                         isl_int_print(out, t, 0);
 127                 }
 128                 fprintf(out, ") = ");
 129                 isl_qpolynomial_print(bound, out, ISL_FORMAT_ISL);
 130                 fprintf(out, ", %s = ", bounded ? "opt" : "sample");
 131                 isl_qpolynomial_print(opt, out, ISL_FORMAT_ISL);
 132                 if (ok)
 133                         fprintf(out, ". OK\n");
 134                 else
 135                         fprintf(out, ". NOT OK\n");
 136         } else if ((vpb->n % vpb->stride) == 0) {
 137                 printf("o");
 138                 fflush(stdout);
 139         }
 140
 141         if (0) {
 142 error:
 143                 ok = 0;
 144         }
 145
 146         isl_pw_qpolynomial_free(pwqp);
 147         isl_qpolynomial_free(bound);
 148         isl_qpolynomial_free(opt);
 149         isl_point_free(pnt);
 150         isl_set_free(dom);
 151
 152         isl_int_clear(t);
 153
 154         if (!ok)
 155                 vpb->error = 1;
 156
 157         if (vpb->options->continue_on_error)
 158                 ok = 1;
 159
 160         return (vpb->n >= 1 && ok) ? 0 : -1;
 161 }
 162
 163 static int check_solution(__isl_take isl_pw_qpolynomial *pwqp,
 164         __isl_take isl_pw_qpolynomial_fold *pwf, int exact,
 165         struct bound_options *options)
 166 {
 167         struct verify_point_bound vpb;
 168         isl_int count, max;
 169         isl_set *dom;
 170         isl_set *context;
 171         int i, r, n;
 172
 173         dom = isl_pw_qpolynomial_domain(isl_pw_qpolynomial_copy(pwqp));
 174         context = isl_set_remove(isl_set_copy(dom), isl_dim_set,
 175                                         0, isl_set_dim(dom, isl_dim_set));
 176         context = isl_set_remove_divs(context);
 177         context = set_bounds(context);
 178
 179         isl_int_init(count);
 180         isl_int_init(max);
 181
 182         isl_int_set_si(max, 200);
 183         r = isl_set_count_upto(context, max, &count);
 184         assert(r >= 0);
 185         n = isl_int_get_si(count);
 186
 187         isl_int_clear(max);
 188         isl_int_clear(count);
 189
 190         vpb.options = options;
 191         vpb.pwqp = pwqp;
 192         vpb.pwf = pwf;
 193         vpb.n = n;
 194         vpb.stride = n > 70 ? 1 + (n + 1)/70 : 1;
 195         vpb.error = 0;
 196         vpb.exact = exact;
 197
 198         if (!options->print_all) {
 199                 for (i = 0; i < vpb.n; i += vpb.stride)
 200                         printf(".");
 201                 printf("\r");
 202                 fflush(stdout);
 203         }
 204
 205         isl_set_foreach_point(context, verify_point, &vpb);
 206
 207         isl_set_free(context);
 208         isl_set_free(dom);
 209         isl_pw_qpolynomial_free(pwqp);
 210         isl_pw_qpolynomial_fold_free(pwf);
 211
 212         if (!options->print_all)
 213                 printf("\n");
 214
 215         if (vpb.error) {
 216                 fprintf(stderr, "Check failed !\n");
 217                 return -1;
 218         }
 219
 220         return 0;
 221 }
 222
 223 int main(int argc, char **argv)
 224 {
 225         isl_ctx *ctx;
 226         isl_pw_qpolynomial *pwqp;
 227         isl_pw_qpolynomial *copy;
 228         isl_pw_qpolynomial_fold *pwf;
 229         struct isl_stream *s;
 230         struct bound_options *options;
 231         int exact;
 232         int r = 0;
 233
 234         options = bound_options_new_with_defaults();
 235         assert(options);
 236         argc = bound_options_parse(options, argc, argv, ISL_ARG_ALL);
 237
 238         ctx = isl_ctx_alloc_with_options(bound_options_arg, options);
 239
 240         s = isl_stream_new_file(ctx, stdin);
 241         pwqp = isl_stream_read_pw_qpolynomial(s);
 242
 243         if (options->verify)
 244                 copy = isl_pw_qpolynomial_copy(pwqp);
 245
 246         pwf = isl_pw_qpolynomial_bound_range(pwqp, isl_fold_max, &exact);
 247         pwf = isl_pw_qpolynomial_fold_coalesce(pwf);
 248
 249         if (options->verify) {
 250                 r = check_solution(copy, pwf, exact, options);
 251         } else {
 252                 if (!exact)
 253                         printf("# NOT exact\n");
 254                 isl_pw_qpolynomial_fold_print(pwf, stdout, 0);
 255                 fprintf(stdout, "\n");
 256                 isl_pw_qpolynomial_fold_free(pwf);
 257         }
 258
 259         isl_stream_free(s);
 260
 261         isl_ctx_free(ctx);
 262
 263         return r;
 264 }