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 }
  26
  27 void barvinok_stats_print(struct barvinok_stats *stats, FILE *out)
  28 {
  29     fprintf(out, "Base cones: %d\n", stats->base_cones);
  30 }
  31
  32 struct barvinok_options *barvinok_options_new_with_defaults()
  33 {
  34     struct barvinok_options *options = ALLOC(struct barvinok_options);
  35     if (!options)
  36         return NULL;
  37
  38     options->stats = ALLOC(struct barvinok_stats);
  39     if (!options->stats) {
  40         free(options);
  41         return NULL;
  42     }
  43
  44     barvinok_stats_clear(options->stats);
  45
  46     options->LLL_a = 1;
  47     options->LLL_b = 1;
  48
  49     options->MaxRays = MAXRAYS;
  50
  51 #ifdef USE_INCREMENTAL_BF
  52     options->incremental_specialization = 2;
  53 #elif defined USE_INCREMENTAL_DF
  54     options->incremental_specialization = 1;
  55 #else
  56     options->incremental_specialization = 0;
  57 #endif
  58     options->max_index = 1;
  59     options->primal = 0;
  60 #ifdef USE_MODULO
  61     options->lookup_table = 0;
  62 #else
  63     options->lookup_table = 1;
  64 #endif
  65 #ifdef HAVE_LIBGLPK
  66     options->count_sample_infinite = 1;
  67 #else
  68     options->count_sample_infinite = 0;
  69 #endif
  70
  71     options->polynomial_approximation = BV_POLAPPROX_NONE;
  72
  73 #ifdef HAVE_LIBGLPK
  74     options->gbr_lp_solver = BV_GBR_GLPK;
  75 #elif defined HAVE_LIBCDDGMP
  76     options->gbr_lp_solver = BV_GBR_CDD;
  77 #else
  78     options->gbr_lp_solver = BV_GBR_NONE;
  79 #endif
  80
  81     return options;
  82 }
  83
  84 void barvinok_options_free(struct barvinok_options *options)
  85 {
  86     free(options->stats);
  87     free(options);
  88 }
  89
  90 struct argp_option barvinok_argp_options[] = {
  91     { "index",              BV_OPT_MAXINDEX,        "int",              0,
  92        "maximal index of simple cones in decomposition" },
  93     { "primal",             BV_OPT_PRIMAL,          0,                  0 },
  94     { "table",              BV_OPT_TABLE,           0,                  0 },
  95     { "specialization",     BV_OPT_SPECIALIZATION,  "[bf|df|random]",   0 },
  96     { "polynomial-approximation",
  97                             BV_OPT_POLAPPROX,
  98                             "lower|upper|pre-lower|pre-upper|pre-approx",       0 },
  99     { "gbr",                BV_OPT_GBR,             "[cdd]",            0,
 100       "solver to use for basis reduction" },
 101     { "version",            'V',                    0,                  0 },
 102     { 0 }
 103 };
 104
 105 error_t barvinok_parse_opt(int key, char *arg, struct argp_state *state)
 106 {
 107     struct barvinok_options *options = state->input;
 108
 109     switch (key) {
 110     case 'V':
 111         printf(barvinok_version());
 112         exit(0);
 113     case BV_OPT_SPECIALIZATION:
 114         if (!strcmp(arg, "bf"))
 115             options->incremental_specialization = BV_SPECIALIZATION_BF;
 116         else if (!strcmp(arg, "df"))
 117             options->incremental_specialization = BV_SPECIALIZATION_DF;
 118         else if (!strcmp(arg, "random"))
 119             options->incremental_specialization = BV_SPECIALIZATION_RANDOM;
 120         break;
 121     case BV_OPT_PRIMAL:
 122         options->primal = 1;
 123         break;
 124     case BV_OPT_TABLE:
 125         options->lookup_table = 1;
 126         break;
 127     case BV_OPT_GBR:
 128         if (!strcmp(arg, "cdd"))
 129             options->gbr_lp_solver = BV_GBR_CDD;
 130         break;
 131     case BV_OPT_MAXINDEX:
 132         options->max_index = strtoul(arg, NULL, 0);
 133         break;
 134     case BV_OPT_POLAPPROX:
 135         if (!strcmp(arg, "pre-lower"))
 136             options->polynomial_approximation = BV_POLAPPROX_PRE_LOWER;
 137         else if (!strcmp(arg, "pre-upper"))
 138             options->polynomial_approximation = BV_POLAPPROX_PRE_UPPER;
 139         else if (!strcmp(arg, "pre-approx"))
 140             options->polynomial_approximation = BV_POLAPPROX_PRE_APPROX;
 141         else if (!strcmp(arg, "lower"))
 142             options->polynomial_approximation = BV_POLAPPROX_LOWER;
 143         else if (!strcmp(arg, "upper"))
 144             options->polynomial_approximation = BV_POLAPPROX_UPPER;
 145         break;
 146     default:
 147         return ARGP_ERR_UNKNOWN;
 148     }
 149     return 0;
 150 }
 151
 152 struct argp barvinok_argp = {
 153     barvinok_argp_options, barvinok_parse_opt, 0, 0
 154 };