options.c

   1 #include <unistd.h>
   2 #include <barvinok/options.h>
   3 #include <barvinok/util.h>
   4 #include "argp.h"
   5 #include "config.h"
   6
   7 #ifdef HAVE_GROWING_CHERNIKOVA
   8 #define MAXRAYS    (POL_NO_DUAL | POL_INTEGER)
   9 #else
  10 #define MAXRAYS  600
  11 #endif
  12
  13 #ifndef HAVE_LIBGLPK
  14 Vector *Polyhedron_Sample(Polyhedron *P, struct barvinok_options *options)
  15 {
  16     assert(0);
  17 }
  18 #endif
  19
  20 #define ALLOC(type) (type*)malloc(sizeof(type))
  21
  22 void barvinok_stats_clear(struct barvinok_stats *stats)
  23 {
  24     stats->base_cones = 0;
  25     stats->volume_simplices = 0;
  26 }
  27
  28 void barvinok_stats_print(struct barvinok_stats *stats, FILE *out)
  29 {
  30     fprintf(out, "Base cones: %d\n", stats->base_cones);
  31     if (stats->volume_simplices)
  32         fprintf(out, "Volume simplices: %d\n", stats->volume_simplices);
  33 }
  34
  35 struct barvinok_options *barvinok_options_new_with_defaults()
  36 {
  37     struct barvinok_options *options = ALLOC(struct barvinok_options);
  38     if (!options)
  39         return NULL;
  40
  41     options->stats = ALLOC(struct barvinok_stats);
  42     if (!options->stats) {
  43         free(options);
  44         return NULL;
  45     }
  46
  47     barvinok_stats_clear(options->stats);
  48
  49     options->LLL_a = 1;
  50     options->LLL_b = 1;
  51
  52     options->MaxRays = MAXRAYS;
  53
  54 #ifdef USE_INCREMENTAL_BF
  55     options->incremental_specialization = 2;
  56 #elif defined USE_INCREMENTAL_DF
  57     options->incremental_specialization = 1;
  58 #else
  59     options->incremental_specialization = 0;
  60 #endif
  61     options->max_index = 1;
  62     options->primal = 0;
  63 #ifdef USE_MODULO
  64     options->lookup_table = 0;
  65 #else
  66     options->lookup_table = 1;
  67 #endif
  68 #ifdef HAVE_LIBGLPK
  69     options->count_sample_infinite = 1;
  70 #else
  71     options->count_sample_infinite = 0;
  72 #endif
  73     options->try_Delaunay_triangulation = 0;
  74
  75     options->polynomial_approximation = BV_APPROX_SIGN_NONE;
  76     options->approximation_method = BV_APPROX_NONE;
  77     options->scale_flags = 0;
  78     options->volume_triangulate = BV_VOL_VERTEX;
  79
  80 #ifdef HAVE_LIBGLPK
  81     options->gbr_lp_solver = BV_GBR_GLPK;
  82 #elif defined HAVE_LIBCDDGMP
  83     options->gbr_lp_solver = BV_GBR_CDD;
  84 #else
  85     options->gbr_lp_solver = BV_GBR_NONE;
  86 #endif
  87
  88     options->bernstein_optimize = BV_BERNSTEIN_NONE;
  89
  90     options->bernstein_recurse = BV_BERNSTEIN_FACTORS;
  91
  92     return options;
  93 }
  94
  95 void barvinok_options_free(struct barvinok_options *options)
  96 {
  97     free(options->stats);
  98     free(options);
  99 }
 100
 101 enum {
 102     SCALE_FAST,
 103     SCALE_SLOW,
 104     SCALE_NARROW,
 105     SCALE_NARROW2,
 106     SCALE_CHAMBER,
 107 };
 108
 109 const char *scale_opts[] = {
 110     "fast",
 111     "slow",
 112     "narrow",
 113     "narrow2",
 114     "chamber",
 115     NULL
 116 };
 117
 118 static struct argp_option approx_argp_options[] = {
 119     { "polynomial-approximation", BV_OPT_POLAPPROX, "lower|upper",      1 },
 120     { "approximation-method", BV_OPT_APPROX,        "scale|drop|volume|bernouilli",     0,
 121         "method to use in polynomial approximation [default: drop]" },
 122     { "scale-options",      BV_OPT_SCALE,
 123         "fast|slow,narrow|narrow2,chamber",     0 },
 124     { "volume-triangulation",       BV_OPT_VOL,     "lift|vertex|barycenter",    0,
 125         "type of triangulation to perform in volume computation [default: vertex]" },
 126     { 0 }
 127 };
 128
 129 static struct argp_option barvinok_argp_options[] = {
 130     { "index",              BV_OPT_MAXINDEX,        "int",              0,
 131        "maximal index of simple cones in decomposition" },
 132     { "primal",             BV_OPT_PRIMAL,          0,                  0 },
 133     { "table",              BV_OPT_TABLE,           0,                  0 },
 134     { "specialization",     BV_OPT_SPECIALIZATION,  "[bf|df|random|todd]" },
 135 #if defined(HAVE_LIBGLPK) || defined(HAVE_LIBCDDGMP)
 136     { "gbr",                BV_OPT_GBR,
 137 #if defined(HAVE_LIBGLPK) && defined(HAVE_LIBCDDGMP)
 138         "cdd|glpk",
 139 #elif defined(HAVE_LIBGLPK)
 140         "glpk",
 141 #elif defined(HAVE_LIBCDDGMP)
 142         "cdd",
 143 #endif
 144         0,      "solver to use for basis reduction "
 145 #ifdef HAVE_LIBGLPK
 146                 "[default: glpk]"
 147 #elif defined HAVE_LIBCDDGMP
 148                 "[default: cdd]"
 149 #endif
 150         },
 151 #endif
 152     { "bernstein-recurse",  BV_OPT_RECURSE,    "none|factors|intervals|full",    0,
 153         "[default: factors]" },
 154     { "recurse",            BV_OPT_RECURSE,         "",
 155         OPTION_ALIAS | OPTION_HIDDEN },
 156     { "version",            'V',                    0,                  0 },
 157     { 0 }
 158 };
 159
 160 static error_t approx_parse_opt(int key, char *arg, struct argp_state *state)
 161 {
 162     struct barvinok_options *options = state->input;
 163     char *subopt;
 164
 165     switch (key) {
 166     case BV_OPT_POLAPPROX:
 167         if (!arg) {
 168             options->polynomial_approximation = BV_APPROX_SIGN_APPROX;
 169             if (options->approximation_method == BV_APPROX_NONE)
 170                 options->approximation_method = BV_APPROX_SCALE;
 171         } else {
 172             if (!strcmp(arg, "lower"))
 173                 options->polynomial_approximation = BV_APPROX_SIGN_LOWER;
 174             else if (!strcmp(arg, "upper"))
 175                 options->polynomial_approximation = BV_APPROX_SIGN_UPPER;
 176             if (options->approximation_method == BV_APPROX_NONE)
 177                 options->approximation_method = BV_APPROX_DROP;
 178         }
 179         break;
 180     case BV_OPT_APPROX:
 181         if (!strcmp(arg, "scale"))
 182             options->approximation_method = BV_APPROX_SCALE;
 183         else if (!strcmp(arg, "drop"))
 184             options->approximation_method = BV_APPROX_DROP;
 185         else if (!strcmp(arg, "volume"))
 186             options->approximation_method = BV_APPROX_VOLUME;
 187         else if (!strcmp(arg, "bernoulli"))
 188             options->approximation_method = BV_APPROX_BERNOULLI;
 189         else
 190             argp_error(state, "unknown value for --approximation-method option");
 191         break;
 192     case BV_OPT_SCALE:
 193         options->approximation_method = BV_APPROX_SCALE;
 194         while (*arg != '\0')
 195             switch (getsubopt(&arg, scale_opts, &subopt)) {
 196             case SCALE_FAST:
 197                 options->scale_flags |= BV_APPROX_SCALE_FAST;
 198                 break;
 199             case SCALE_SLOW:
 200                 options->scale_flags &= ~BV_APPROX_SCALE_FAST;
 201                 break;
 202             case SCALE_NARROW:
 203                 options->scale_flags |= BV_APPROX_SCALE_NARROW;
 204                 options->scale_flags &= ~BV_APPROX_SCALE_NARROW2;
 205                 break;
 206             case SCALE_NARROW2:
 207                 options->scale_flags |= BV_APPROX_SCALE_NARROW2;
 208                 options->scale_flags &= ~BV_APPROX_SCALE_NARROW;
 209                 break;
 210             case SCALE_CHAMBER:
 211                 options->scale_flags |= BV_APPROX_SCALE_CHAMBER;
 212                 break;
 213             default:
 214                 argp_error(state, "unknown suboption '%s'\n", subopt);
 215             }
 216         break;
 217     case BV_OPT_VOL:
 218         if (!strcmp(arg, "lift"))
 219             options->volume_triangulate = BV_VOL_LIFT;
 220         else if (!strcmp(arg, "vertex"))
 221             options->volume_triangulate = BV_VOL_VERTEX;
 222         else if (!strcmp(arg, "barycenter"))
 223             options->volume_triangulate = BV_VOL_BARYCENTER;
 224         break;
 225     case ARGP_KEY_END:
 226         if (options->polynomial_approximation == BV_APPROX_SIGN_NONE &&
 227             options->approximation_method != BV_APPROX_NONE) {
 228             fprintf(stderr,
 229         "no polynomial approximation selected; reseting approximation method\n");
 230             options->approximation_method = BV_APPROX_NONE;
 231         }
 232         break;
 233     default:
 234         return ARGP_ERR_UNKNOWN;
 235     }
 236     return 0;
 237 }
 238
 239 static error_t barvinok_parse_opt(int key, char *arg, struct argp_state *state)
 240 {
 241     struct barvinok_options *options = state->input;
 242     char *subopt;
 243
 244     switch (key) {
 245     case ARGP_KEY_INIT:
 246         state->child_inputs[0] = options;
 247         break;
 248     case 'V':
 249         printf(barvinok_version());
 250         exit(0);
 251     case BV_OPT_SPECIALIZATION:
 252         if (!strcmp(arg, "bf"))
 253             options->incremental_specialization = BV_SPECIALIZATION_BF;
 254         else if (!strcmp(arg, "df"))
 255             options->incremental_specialization = BV_SPECIALIZATION_DF;
 256         else if (!strcmp(arg, "random"))
 257             options->incremental_specialization = BV_SPECIALIZATION_RANDOM;
 258         else if (!strcmp(arg, "todd"))
 259             options->incremental_specialization = BV_SPECIALIZATION_TODD;
 260         break;
 261     case BV_OPT_PRIMAL:
 262         options->primal = 1;
 263         break;
 264     case BV_OPT_TABLE:
 265         options->lookup_table = 1;
 266         break;
 267     case BV_OPT_GBR:
 268         if (!strcmp(arg, "cdd"))
 269             options->gbr_lp_solver = BV_GBR_CDD;
 270         if (!strcmp(arg, "glpk"))
 271             options->gbr_lp_solver = BV_GBR_GLPK;
 272         break;
 273     case BV_OPT_MAXINDEX:
 274         options->max_index = strtoul(arg, NULL, 0);
 275         break;
 276     case BV_OPT_RECURSE:
 277         if (!strcmp(arg, "none"))
 278             options->bernstein_recurse = 0;
 279         else if (!strcmp(arg, "factors"))
 280             options->bernstein_recurse = BV_BERNSTEIN_FACTORS;
 281         else if (!strcmp(arg, "intervals"))
 282             options->bernstein_recurse = BV_BERNSTEIN_INTERVALS;
 283         else if (!strcmp(arg, "full"))
 284             options->bernstein_recurse =
 285                     BV_BERNSTEIN_FACTORS | BV_BERNSTEIN_INTERVALS;
 286         break;
 287     default:
 288         return ARGP_ERR_UNKNOWN;
 289     }
 290     return 0;
 291 }
 292
 293 static struct argp approx_argp = {
 294     approx_argp_options, approx_parse_opt, 0, 0
 295 };
 296
 297 static struct argp_child barvinok_children[] = {
 298     { &approx_argp,     0,      "polynomial approximation",     BV_GRP_APPROX },
 299     { 0 }
 300 };
 301
 302 struct argp barvinok_argp = {
 303     barvinok_argp_options, barvinok_parse_opt, 0, 0, barvinok_children
 304 };