10int main(
int argc,
char **argv)
13 const char **param_name = NULL;
41 printf(
"============ Ranking function ============\n");
49 for (en=e; en; en=en->
next) {
52 printf(
"\n-----------------------------------\n" );
57 if( isatty(0) && nb_parms != 0)
59 printf(
"Evaluation of the Ehrhart polynomial :\n");
60 p = (Value *)malloc(
sizeof(Value) * (nb_parms));
61 for(i=0;i<nb_parms;i++)
65 printf(
"Enter %d parameters : ",nb_parms);
66 for(k=0;k<nb_parms;++k) {
70 fprintf(stdout,
"EP( ");
72 for(k=1;k<nb_parms;++k) {
76 fprintf(stdout,
" ) = ");
#define value_read(val, str)
#define value_print(Dst, fmt, val)
void free_evalue_refs(evalue *e)
releases all memory referenced by e.
void print_evalue(FILE *DST, evalue *e, const char **pname)
int main(int argc, char **argv)
Value * compute_poly(Enumeration *en, Value *list_args)
Matrix * Matrix_Read(void)
void Matrix_Free(Matrix *Mat)
const char ** Read_ParamNames(FILE *in, int m)
void Free_ParamNames(const char **params, int m)
void Polyhedron_Free(Polyhedron *Pol)
Polyhedron * Constraints2Polyhedron(Matrix *Constraints, unsigned NbMaxRays)
Given a matrix of constraints ('Constraints'), construct and return a polyhedron.
void Print_Domain(FILE *DST, Polyhedron *D, const char **pname)
Enumeration * Polyhedron_LexSmallerEnumerate(Polyhedron *P, Polyhedron *D, unsigned dim, Polyhedron *C, unsigned MAXRAYS)
Returns the number of points in P that are lexicographically smaller than a given point in D.
Polyhedron * ValidityDomain
struct _enumeration * next