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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
|
/***********************************************************************/
/* Ehrhart V4.20 */
/* copyright 1997, Doran Wilde */
/* copyright 1997-2000, Vincent Loechner */
/* Permission is granted to copy, use, and distribute */
/* for any commercial or noncommercial purpose under the terms */
/* of the GNU General Public license, version 2, June 1991 */
/* (see file : LICENSING). */
/***********************************************************************/
/*
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/>.
*/
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
#include <unistd.h>
#include <assert.h>
#include <polylib/polylib.h>
#include <polylib/homogenization.h>
#include "config.h"
#define EP_EVALUATION
#ifndef HAVE_GETOPT_H
#define getopt_long(a,b,c,d,e) getopt(a,b,c)
#else
#include <getopt.h>
struct option options[] = {
{ "homogenized", no_argument, 0, 'h' },
{ 0, 0, 0, 0 }
};
#endif
#define WS 0
/**
define this to print all constraints on the validity domains if not
defined, only new constraints (not in validity domain given by the
user) are printed
*/
#define EPRINT_ALL_VALIDITY_CONSTRAINTS
/**
The following are mainly for debug purposes. You shouldn't need to
change anything for daily usage...
*/
/** you may define each macro independently
<ol>
<li> #define EDEBUG minimal debug
<li> #define EDEBUG1 prints enumeration points
<li> #define EDEBUG11 prints number of points
<li> #define EDEBUG2 prints domains
<li> #define EDEBUG21 prints more domains
<li> #define EDEBUG3 prints systems of equations that are solved
<li> #define EDEBUG4 prints message for degree reduction
<li> #define EDEBUG5 prints result before simplification
<li> #define EDEBUG6 prints domains in Preprocess
<li> #define EDEBUG61 prints even more in Preprocess
<li> #define EDEBUG62 prints domains in Preprocess2
</ol>
*/
/* #define EDEBUG */ /* minimal debug */
/* #define EDEBUG1 */ /* prints enumeration points */
/* #define EDEBUG11 */ /* prints number of points */
/* #define EDEBUG2 */ /* prints domains */
/* #define EDEBUG21 */ /* prints more domains */
/* #define EDEBUG3 */ /* prints systems of equations that are solved */
/* #define EDEBUG4 */ /* prints message for degree reduction */
/* #define EDEBUG5 */ /* prints result before simplification */
/* #define EDEBUG6 */ /* prints domains in Preprocess */
/* #define EDEBUG61 */ /* prints even more in Preprocess */
/* #define EDEBUG62 */ /* prints domains in Preprocess2 */
/**
Reduce the degree of resulting polynomials
*/
#define REDUCE_DEGREE
/**
define this to print one warning message per domain overflow these
overflows should no longer happen since version 4.20
*/
#define ALL_OVERFLOW_WARNINGS
/**
EPRINT : print results while computing the ehrhart polynomial. this
is done by default if you build the executable ehrhart. (If EMAIN is
defined). Don't define EMAIN here, it is defined when necessary in
the makefile.
<p>
Notice: you may however define EPRINT without defining EMAIN, but in
this case, you have to initialize the global variable param_name by
calling Read_ParamNames before any call to ehrhart. This is NOT
recommanded, unless you know what you do. EPRINT causes more debug
messages to be printed.
*/
/* #define EPRINT */
int main(int argc, char **argv)
{
int i;
char str[1024];
Matrix *C1, *P1;
Polyhedron *C, *P;
Enumeration *en;
const char **param_name;
int c, ind = 0;
int hom = 0;
#ifdef EP_EVALUATION
Value *p, *tmp;
int k;
#endif
while ((c = getopt_long(argc, argv, "h", options, &ind)) != -1) {
switch (c) {
case 'h':
hom = 1;
break;
}
}
P1 = Matrix_Read();
C1 = Matrix_Read();
if(C1->NbColumns < 2) {
fprintf( stderr, "Not enough parameters !\n" );
exit(0);
}
if (hom) {
Matrix *C2, *P2;
P2 = AddANullColumn(P1);
Matrix_Free(P1);
P1 = P2;
C2 = AddANullColumn(C1);
Matrix_Free(C1);
C1 = C2;
}
P = Constraints2Polyhedron(P1,WS);
C = Constraints2Polyhedron(C1,WS);
Matrix_Free(P1);
Matrix_Free(C1);
/* Read the name of the parameters */
param_name = Read_ParamNames(stdin,C->Dimension - hom);
if (hom) {
const char **param_name2;
param_name2 = (const char**)malloc(sizeof(char*) * (C->Dimension));
for (i = 0; i < C->Dimension - 1; i++)
param_name2[i] = param_name[i];
param_name2[C->Dimension-1] = "_H";
free(param_name);
param_name=param_name2;
}
en = Polyhedron_Enumerate(P,C,WS,param_name);
if (hom) {
Enumeration *en2;
printf("inhomogeneous form:\n");
dehomogenize_enumeration(en, C->Dimension, WS);
for (en2 = en; en2; en2 = en2->next) {
Print_Domain(stdout, en2->ValidityDomain, param_name);
print_evalue(stdout, &en2->EP, param_name);
}
}
#ifdef EP_EVALUATION
if( isatty(0) && C->Dimension != 0)
{ /* no tty input or no polyhedron -> no evaluation. */
printf("Evaluation of the Ehrhart polynomial :\n");
p = (Value *)malloc(sizeof(Value) * (C->Dimension));
for(i=0;i<C->Dimension;i++)
value_init(p[i]);
FOREVER {
fflush(stdin);
printf("Enter %d parameters : ",C->Dimension);
for(k=0;k<C->Dimension;++k) {
scanf("%s",str);
value_read(p[k],str);
}
fprintf(stdout,"EP( ");
value_print(stdout,VALUE_FMT,p[0]);
for(k=1;k<C->Dimension;++k) {
fprintf(stdout,",");
value_print(stdout,VALUE_FMT,p[k]);
}
fprintf(stdout," ) = ");
value_print(stdout,VALUE_FMT,*(tmp=compute_poly(en,p)));
free(tmp);
fprintf(stdout,"\n");
}
}
#endif /* EP_EVALUATION */
Enumeration_Free(en);
Free_ParamNames(param_name, C->Dimension-hom);
Polyhedron_Free( P );
Polyhedron_Free( C );
return 0;
}
|
