3 #include <polylib/polylibgmp.h>
4 #include "ev_operations.h"
9 /* The input of this example program is a polytope in combined
10 * data and parameter space followed by two lines indicating
11 * the number of existential variables and parameters respectively.
12 * The first lines starts with "E ", followed by a number.
13 * The second lines starts with "P ", followed by a number.
14 * These two lines are (optionally) followed by the names of the parameters.
15 * The polytope is in PolyLib notation.
18 #ifdef HAVE_GROWING_CHERNIKOVA
25 #define getopt_long(a,b,c,d,e) getopt(a,b,c)
28 struct option options
[] = {
29 { "pip", no_argument
, 0, 'p' },
30 { "convert", no_argument
, 0, 'c' },
31 { "range", no_argument
, 0, 'r' },
36 int main(int argc
, char **argv
)
49 while ((c
= getopt_long(argc
, argv
, "pcr", options
, &ind
)) != -1) {
64 A
= Constraints2Polyhedron(M
, MAXRAYS
);
68 while ((*s
=='#') || (sscanf(s
, "E %d", &exist
)<1))
72 while ((*s
=='#') || (sscanf(s
, "P %d", &nparam
)<1))
75 Polyhedron_Print(stdout
, P_VALUE_FMT
, A
);
76 printf("exist: %d, nparam: %d\n", exist
, nparam
);
77 param_name
= Read_ParamNames(stdin
, nparam
);
79 EP
= barvinok_enumerate_pip(A
, exist
, nparam
, MAXRAYS
);
81 EP
= barvinok_enumerate_e(A
, exist
, nparam
, MAXRAYS
);
85 evalue_range_reduction(EP
);
86 print_evalue(stdout
, EP
, param_name
);
88 evalue_mod2table(EP
, nparam
);
89 print_evalue(stdout
, EP
, param_name
);
93 Free_ParamNames(param_name
, nparam
);