2 #include <barvinok/options.h>
3 #include <barvinok/util.h>
7 #ifdef HAVE_GROWING_CHERNIKOVA
8 #define MAXRAYS (POL_NO_DUAL | POL_INTEGER)
14 Vector
*Polyhedron_Sample(Polyhedron
*P
, struct barvinok_options
*options
)
20 #define ALLOC(type) (type*)malloc(sizeof(type))
22 void barvinok_stats_clear(struct barvinok_stats
*stats
)
24 stats
->base_cones
= 0;
27 void barvinok_stats_print(struct barvinok_stats
*stats
, FILE *out
)
29 fprintf(out
, "Base cones: %d\n", stats
->base_cones
);
32 struct barvinok_options
*barvinok_options_new_with_defaults()
34 struct barvinok_options
*options
= ALLOC(struct barvinok_options
);
38 options
->stats
= ALLOC(struct barvinok_stats
);
39 if (!options
->stats
) {
44 barvinok_stats_clear(options
->stats
);
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;
56 options
->incremental_specialization
= 0;
58 options
->max_index
= 1;
61 options
->lookup_table
= 0;
63 options
->lookup_table
= 1;
66 options
->count_sample_infinite
= 1;
68 options
->count_sample_infinite
= 0;
70 options
->try_Delaunay_triangulation
= 0;
72 options
->polynomial_approximation
= BV_APPROX_SIGN_NONE
;
73 options
->approximation_method
= BV_APPROX_NONE
;
74 options
->scale_flags
= 0;
77 options
->gbr_lp_solver
= BV_GBR_GLPK
;
78 #elif defined HAVE_LIBCDDGMP
79 options
->gbr_lp_solver
= BV_GBR_CDD
;
81 options
->gbr_lp_solver
= BV_GBR_NONE
;
84 options
->bernstein_optimize
= BV_BERNSTEIN_NONE
;
86 options
->bernstein_recurse
= BV_BERNSTEIN_FACTORS
;
91 void barvinok_options_free(struct barvinok_options
*options
)
104 const char *scale_opts
[] = {
112 static struct argp_option approx_argp_options
[] = {
113 { "polynomial-approximation", BV_OPT_POLAPPROX
, "lower|upper", 1 },
114 { "approximation-method", BV_OPT_APPROX
, "scale|drop|volume", 0,
115 "method to use in polynomial approximation [default: drop]" },
116 { "scale-options", BV_OPT_SCALE
, "fast|slow,narrow|narrow2", 0 },
120 static struct argp_option barvinok_argp_options
[] = {
121 { "index", BV_OPT_MAXINDEX
, "int", 0,
122 "maximal index of simple cones in decomposition" },
123 { "primal", BV_OPT_PRIMAL
, 0, 0 },
124 { "table", BV_OPT_TABLE
, 0, 0 },
125 { "specialization", BV_OPT_SPECIALIZATION
, "[bf|df|random]", 0 },
126 { "gbr", BV_OPT_GBR
, "[cdd]", 0,
127 "solver to use for basis reduction" },
128 { "version", 'V', 0, 0 },
132 static error_t
approx_parse_opt(int key
, char *arg
, struct argp_state
*state
)
134 struct barvinok_options
*options
= state
->input
;
138 case BV_OPT_POLAPPROX
:
140 options
->polynomial_approximation
= BV_APPROX_SIGN_APPROX
;
141 if (options
->approximation_method
== BV_APPROX_NONE
)
142 options
->approximation_method
= BV_APPROX_SCALE
;
144 if (!strcmp(arg
, "lower"))
145 options
->polynomial_approximation
= BV_APPROX_SIGN_LOWER
;
146 else if (!strcmp(arg
, "upper"))
147 options
->polynomial_approximation
= BV_APPROX_SIGN_UPPER
;
148 if (options
->approximation_method
== BV_APPROX_NONE
)
149 options
->approximation_method
= BV_APPROX_DROP
;
153 if (!strcmp(arg
, "scale"))
154 options
->approximation_method
= BV_APPROX_SCALE
;
155 else if (!strcmp(arg
, "drop"))
156 options
->approximation_method
= BV_APPROX_DROP
;
157 else if (!strcmp(arg
, "volume"))
158 options
->approximation_method
= BV_APPROX_VOLUME
;
160 argp_error(state
, "unknown value for --approximation-method option");
163 options
->approximation_method
= BV_APPROX_SCALE
;
165 switch (getsubopt(&arg
, scale_opts
, &subopt
)) {
167 options
->scale_flags
|= BV_APPROX_SCALE_FAST
;
170 options
->scale_flags
&= ~BV_APPROX_SCALE_FAST
;
173 options
->scale_flags
|= BV_APPROX_SCALE_NARROW
;
174 options
->scale_flags
&= ~BV_APPROX_SCALE_NARROW2
;
177 options
->scale_flags
|= BV_APPROX_SCALE_NARROW2
;
178 options
->scale_flags
&= ~BV_APPROX_SCALE_NARROW
;
181 argp_error(state
, "unknown suboption '%s'\n", subopt
);
185 if (options
->polynomial_approximation
== BV_APPROX_SIGN_NONE
&&
186 options
->approximation_method
!= BV_APPROX_NONE
) {
188 "no polynomial approximation selected; reseting approximation method\n");
189 options
->approximation_method
= BV_APPROX_NONE
;
193 return ARGP_ERR_UNKNOWN
;
198 static error_t
barvinok_parse_opt(int key
, char *arg
, struct argp_state
*state
)
200 struct barvinok_options
*options
= state
->input
;
205 state
->child_inputs
[0] = options
;
208 printf(barvinok_version());
210 case BV_OPT_SPECIALIZATION
:
211 if (!strcmp(arg
, "bf"))
212 options
->incremental_specialization
= BV_SPECIALIZATION_BF
;
213 else if (!strcmp(arg
, "df"))
214 options
->incremental_specialization
= BV_SPECIALIZATION_DF
;
215 else if (!strcmp(arg
, "random"))
216 options
->incremental_specialization
= BV_SPECIALIZATION_RANDOM
;
222 options
->lookup_table
= 1;
225 if (!strcmp(arg
, "cdd"))
226 options
->gbr_lp_solver
= BV_GBR_CDD
;
228 case BV_OPT_MAXINDEX
:
229 options
->max_index
= strtoul(arg
, NULL
, 0);
232 return ARGP_ERR_UNKNOWN
;
237 static struct argp approx_argp
= {
238 approx_argp_options
, approx_parse_opt
, 0, 0
241 static struct argp_child barvinok_children
[] = {
242 { &approx_argp
, 0, "polynomial approximation", BV_GRP_APPROX
},
246 struct argp barvinok_argp
= {
247 barvinok_argp_options
, barvinok_parse_opt
, 0, 0, barvinok_children