Handle non-unimodular cones with a specified maximal index.
[barvinok.git] / options.c
blob3ceecbe020debd953884c5bfa9d8b5dacb01cabe
1 #include <unistd.h>
2 #include <barvinok/options.h>
3 #include <barvinok/util.h>
4 #include "argp.h"
5 #include "config.h"
7 #ifdef HAVE_GROWING_CHERNIKOVA
8 #define MAXRAYS (POL_NO_DUAL | POL_INTEGER)
9 #else
10 #define MAXRAYS 600
11 #endif
13 #ifndef HAVE_LIBGLPK
14 Vector *Polyhedron_Sample(Polyhedron *P, struct barvinok_options *options)
16 assert(0);
18 #endif
20 #define ALLOC(type) (type*)malloc(sizeof(type))
22 void barvinok_stats_clear(struct barvinok_stats *stats)
24 stats->unimodular_cones = 0;
27 void barvinok_stats_print(struct barvinok_stats *stats, FILE *out)
29 fprintf(out, "Unimodular cones: %d\n", stats->unimodular_cones);
32 struct barvinok_options *barvinok_options_new_with_defaults()
34 struct barvinok_options *options = ALLOC(struct barvinok_options);
35 if (!options)
36 return NULL;
38 options->stats = ALLOC(struct barvinok_stats);
39 if (!options->stats) {
40 free(options);
41 return NULL;
44 barvinok_stats_clear(options->stats);
46 options->LLL_a = 1;
47 options->LLL_b = 1;
49 options->MaxRays = MAXRAYS;
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
71 #ifdef HAVE_LIBGLPK
72 options->gbr_lp_solver = BV_GBR_GLPK;
73 #elif defined HAVE_LIBCDDGMP
74 options->gbr_lp_solver = BV_GBR_CDD;
75 #else
76 options->gbr_lp_solver = BV_GBR_NONE;
77 #endif
79 return options;
82 void barvinok_options_free(struct barvinok_options *options)
84 free(options->stats);
85 free(options);
88 struct argp_option barvinok_argp_options[] = {
89 { "index", BV_OPT_MAXINDEX, "int", 0,
90 "maximal index of simple cones in decomposition" },
91 { "primal", BV_OPT_PRIMAL, 0, 0 },
92 { "table", BV_OPT_TABLE, 0, 0 },
93 { "specialization", BV_OPT_SPECIALIZATION, "[bf|df|random]", 0 },
94 { "gbr", BV_OPT_GBR, "[cdd]", 0,
95 "solver to use for basis reduction" },
96 { "version", 'V', 0, 0 },
97 { 0 }
100 error_t barvinok_parse_opt(int key, char *arg, struct argp_state *state)
102 struct barvinok_options *options = state->input;
104 switch (key) {
105 case 'V':
106 printf(barvinok_version());
107 exit(0);
108 case BV_OPT_SPECIALIZATION:
109 if (!strcmp(arg, "bf"))
110 options->incremental_specialization = BV_SPECIALIZATION_BF;
111 else if (!strcmp(arg, "df"))
112 options->incremental_specialization = BV_SPECIALIZATION_DF;
113 else if (!strcmp(arg, "random"))
114 options->incremental_specialization = BV_SPECIALIZATION_RANDOM;
115 break;
116 case BV_OPT_PRIMAL:
117 options->primal = 1;
118 break;
119 case BV_OPT_TABLE:
120 options->lookup_table = 1;
121 break;
122 case BV_OPT_GBR:
123 if (!strcmp(arg, "cdd"))
124 options->gbr_lp_solver = BV_GBR_CDD;
125 break;
126 case BV_OPT_MAXINDEX:
127 options->max_index = strtoul(arg, NULL, 0);
128 break;
129 default:
130 return ARGP_ERR_UNKNOWN;
132 return 0;
135 struct argp barvinok_argp = {
136 barvinok_argp_options, barvinok_parse_opt, 0, 0