42 for (col = 1; col < P->
Dimension + 1; col++) {
91 for (i = p->
size - 1; i > 0; i--) {
93 res *= VALUE_TO_DOUBLE(param);
122 res = VALUE_TO_DOUBLE(e->
x.n) / VALUE_TO_DOUBLE(e->
d);
124 res = VALUE_TO_DOUBLE(e->
x.n);
142 tmp = (Value *)malloc(
sizeof(Value));
159#ifdef EVAL_EHRHART_DEBUG
#define value_set_double(val, d)
#define value_notzero_p(val)
#define value_notone_p(val)
#define value_pmodulus(ref, val1, val2)
#define value_assign(v1, v2)
#define value_set_si(val, i)
#define value_addmul(ref, val1, val2)
void print_evalue(FILE *DST, evalue *e, const char **pname)
Value * compute_poly(Enumeration *en, Value *list_args)
double compute_evalue(evalue *e, Value *list_args)
int in_domain(Polyhedron *P, Value *list_args)
static double compute_enode(enode *p, Value *list_args)
#define POL_ENSURE_INEQUALITIES(P)
void Print_Domain(FILE *DST, Polyhedron *D, const char **pname)
Polyhedron * ValidityDomain
struct _enumeration * next