1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
|
/*
This file is part of PolyLib.
PolyLib is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
PolyLib is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with PolyLib. If not, see <http://www.gnu.org/licenses/>.
*/
/************************************************/
/* eval_ehrhart.c */
/* functions to evaluate an Ehrhart polynomial. */
/* written by Emmanuel Jeannot (c) 1997. */
/* Emmanuel.Jeannot@ens-lyon.fr */
/* http://www.ens-lyon.fr/~ejeannot */
/* */
/* modified 1998, 2000, Vincent Loechner */
/* (ArithmetiqueLib, Param_Names) */
/************************************************/
#include <stdio.h>
#include <math.h>
#include <assert.h>
#include <stdlib.h>
#include <polylib/polylib.h>
/* #define EVAL_EHRHART_DEBUG */
/********************************************************/
/* function in domain */
/* check if the parameters in list_args */
/* verifies the constraints of Domain P */
/********************************************************/
int in_domain(Polyhedron *P, Value *list_args) {
int col,row;
Value v; /* value of the constraint of a row when
parameters are instanciated*/
if( !P )
return( 0 );
POL_ENSURE_INEQUALITIES(P);
value_init(v);
/* P->Constraint constraint matrice of polyhedron P */
for(row=0;row<P->NbConstraints;row++) {
value_assign(v,P->Constraint[row][P->Dimension+1]); /*constant part*/
for(col=1;col<P->Dimension+1;col++) {
value_addmul(v, P->Constraint[row][col], list_args[col-1]);
}
if (value_notzero_p(P->Constraint[row][0])) {
/*if v is not >=0 then this constraint is not respected */
if (value_neg_p(v)) {
value_clear(v);
return( in_domain(P->next, list_args) );
}
}
else {
/*if v is not = 0 then this constraint is not respected */
if (value_notzero_p(v)) {
value_clear(v);
return( in_domain(P->next, list_args) );
}
}
}
/* if not return before this point => all the constraints are respected */
value_clear(v);
return 1;
} /* in_domain */
/****************************************************/
/* function compute enode */
/* compute the value of enode p with parameters */
/* list "list_args */
/* compute the polynomial or the periodic */
/****************************************************/
static double compute_enode(enode *p, Value *list_args) {
int i;
Value m, param;
double res=0.0;
if (!p)
return(0.);
value_init(m);
value_init(param);
if (p->type == polynomial) {
if (p->size > 1)
value_assign(param,list_args[p->pos-1]);
/* Compute the polynomial using Horner's rule */
for (i=p->size-1;i>0;i--) {
res +=compute_evalue(&p->arr[i],list_args);
res *=VALUE_TO_DOUBLE(param);
}
res +=compute_evalue(&p->arr[0],list_args);
}
else if (p->type == periodic) {
value_assign(m,list_args[p->pos-1]);
/* Choose the right element of the periodic */
value_set_si(param,p->size);
value_pmodulus(m,m,param);
res = compute_evalue(&p->arr[VALUE_TO_INT(m)],list_args);
}
value_clear(m);
value_clear(param);
return res;
} /* compute_enode */
/*************************************************/
/* return the value of Ehrhart Polynomial */
/* It returns a double, because since it is */
/* a recursive function, some intermediate value */
/* might not be integral */
/*************************************************/
double compute_evalue(evalue *e,Value *list_args) {
double res;
if (value_notzero_p(e->d)) {
if (value_notone_p(e->d))
res = VALUE_TO_DOUBLE(e->x.n) / VALUE_TO_DOUBLE(e->d);
else
res = VALUE_TO_DOUBLE(e->x.n);
}
else
res = compute_enode(e->x.p,list_args);
return res;
} /* compute_evalue */
/****************************************************/
/* function compute_poly : */
/* Check for the good validity domain */
/* return the number of point in the Polyhedron */
/* in allocated memory */
/* Using the Ehrhart pseudo-polynomial */
/****************************************************/
Value *compute_poly(Enumeration *en,Value *list_args) {
Value *tmp;
/* double d; int i; */
tmp = (Value *) malloc (sizeof(Value));
assert(tmp != NULL);
value_init(*tmp);
value_set_si(*tmp,0);
if(!en)
return(tmp); /* no ehrhart polynomial */
if(en->ValidityDomain) {
if(!en->ValidityDomain->Dimension) { /* no parameters */
value_set_double(*tmp,compute_evalue(&en->EP,list_args)+.25);
return(tmp);
}
}
else
return(tmp); /* no Validity Domain */
while(en) {
if(in_domain(en->ValidityDomain,list_args)) {
#ifdef EVAL_EHRHART_DEBUG
Print_Domain(stdout,en->ValidityDomain,NULL);
print_evalue(stdout,&en->EP,NULL);
#endif
/* d = compute_evalue(&en->EP,list_args);
i = d;
printf("(double)%lf = %d\n", d, i ); */
value_set_double(*tmp,compute_evalue(&en->EP,list_args)+.25);
return(tmp);
}
else
en=en->next;
}
value_set_si(*tmp,0);
return(tmp); /* no compatible domain with the arguments */
} /* compute_poly */
|
