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
|
#include <omega/omega_core/oc_i.h>
#include <basic/omega_error.h>
namespace omega {
Problem::~Problem() {
delete[] EQs;
delete[] GEQs;
}
void check_number_EQs(int n) {
if (n < 0) {
fprintf(stderr,"ERROR: nEQs < 0??\n");
exit(1);
}
if (n > maxmaxEQs) {
// clear global variables
inApproximateMode = 0;
outerColor = 0;
throw presburger_error("\nERROR:\n"
"An attempt was made to set the number of available equality constraints to " + to_string(n) + ".\n"
"The maximum number of equality constraints in a conjunction is " + to_string(maxmaxEQs) + ".\n"
"This limit can be changed by redefining maxmaxEQs in oc.h and recompiling.\n\n");
// fprintf(stderr, "\nERROR:\n");
// fprintf(stderr, "An attempt was made to set the number of available equality constraints to %d.\n", n);
// fprintf(stderr, "The maximum number of equality constraints in a conjunction is %d.\n", maxmaxEQs);
// fprintf(stderr, "This limit can be changed by redefining maxmaxEQs in oc.h and recompiling.\n\n");
// exit(2);
}
}
void check_number_GEQs(int n) {
if (n < 0) {
fprintf(stderr,"ERROR: nGEQs < 0??\n");
exit(1);
}
if (n > maxmaxGEQs) {
// clear global variables
inApproximateMode = 0;
outerColor = 0;
throw presburger_error("\nERROR:\n"
"An attempt was made to set the number of available inequality constraints to " + to_string(n) +".\n"
"The maximum number of inequality constraints in a conjunction is " + to_string(maxmaxGEQs) +".\n"
"This limit can be changed by redefining maxmaxGEQs in oc.h and recompiling.\n\n");
// fprintf(stderr, "\nERROR:\n");
// fprintf(stderr, "An attempt was made to set the number of available inequality constraints to %d.\n", n);
// fprintf(stderr, "The maximum number of inequality constraints in a conjunction is %d.\n", maxmaxGEQs);
// fprintf(stderr, "This limit can be changed by redefining maxmaxGEQs in oc.h and recompiling.\n\n");
// exit(2);
}
}
void check_number_EQs_GEQs(int e, int g) {
check_number_EQs(e);
check_number_GEQs(g);
}
Problem::Problem(int in_eqs, int in_geqs) {
check_number_EQs_GEQs(in_eqs, in_geqs);
allocEQs = padEQs(in_eqs);
allocGEQs = padGEQs(in_geqs);
assert(allocEQs > 0 && allocGEQs > 0);
EQs = new eqn[allocEQs];
GEQs = new eqn[allocGEQs];
nVars = 0;
hashVersion = omega::hashVersion;
variablesInitialized = 0;
variablesFreed = 0;
varsOfInterest = 0;
safeVars = 0;
nEQs = 0;
nGEQs = 0;
nSUBs = 0;
nMemories = 0;
isTemporary = false;
}
Problem::Problem(const Problem & p2) {
allocEQs = padEQs(p2.nEQs); // Don't over-allocate; p2 might have too many!
allocGEQs = padGEQs(p2.nGEQs);
assert(allocEQs > 0 && allocGEQs > 0);
EQs = new eqn[allocEQs];
GEQs = new eqn[allocGEQs];
int e, i;
nVars = p2.nVars;
hashVersion = p2.hashVersion;
variablesInitialized = p2.variablesInitialized;
variablesFreed = p2.variablesFreed;
varsOfInterest = p2.varsOfInterest;
safeVars = p2.safeVars;
nEQs = p2.nEQs;
isTemporary = p2.isTemporary;
//nSUBs = 0;
for (e = p2.nEQs - 1; e >= 0; e--)
eqnncpy(&(EQs[e]), &(p2.EQs[e]), p2.nVars);
nGEQs = p2.nGEQs;
for (e = p2.nGEQs - 1; e >= 0; e--)
eqnncpy(&(GEQs[e]), &(p2.GEQs[e]), p2.nVars);
for (i = 0; i <= p2.nVars; i++)
var[i] = p2.var[i];
for (i = 0; i <= maxVars; i++)
forwardingAddress[i] = p2.forwardingAddress[i];
//nMemories = 0;
get_var_name = p2.get_var_name;
getVarNameArgs = p2.getVarNameArgs;
}
Problem & Problem::operator=(const Problem & p2) {
if (this != &p2) {
if(allocEQs < p2.nEQs) {
delete[] EQs;
allocEQs = padEQs(p2.nEQs);
EQs = new eqn[allocEQs];
}
if(allocGEQs < p2.nGEQs) {
delete[] GEQs;
allocGEQs = padGEQs(p2.nGEQs);
GEQs = new eqn[allocGEQs];
}
int e, i;
nVars = p2.nVars;
hashVersion = p2.hashVersion;
variablesInitialized = p2.variablesInitialized;
variablesFreed = p2.variablesFreed;
varsOfInterest = p2.varsOfInterest;
safeVars = p2.safeVars;
nEQs = p2.nEQs;
isTemporary = p2.isTemporary;
//nSUBs = 0;
for (e = p2.nEQs - 1; e >= 0; e--)
eqnncpy(&(EQs[e]), &(p2.EQs[e]), p2.nVars);
nGEQs = p2.nGEQs;
for (e = p2.nGEQs - 1; e >= 0; e--)
eqnncpy(&(GEQs[e]), &(p2.GEQs[e]), p2.nVars);
for (i = 0; i <= p2.nVars; i++)
var[i] = p2.var[i];
for (i = 0; i <= maxVars; i++)
forwardingAddress[i] = p2.forwardingAddress[i];
//nMemories = 0;
get_var_name = p2.get_var_name;
getVarNameArgs = p2.getVarNameArgs;
}
return *this;
}
void Problem::zeroVariable(int i) {
int e;
for (e = nGEQs - 1; e >= 0; e--) GEQs[e].coef[i] = 0;
for (e = nEQs - 1; e >= 0; e--) EQs[e].coef[i] = 0;
for (e = nSUBs - 1; e >= 0; e--) SUBs[e].coef[i] = 0;
}
/* Functions for allocating EQ's and GEQ's */
int Problem::newGEQ() {
if (++nGEQs > allocGEQs) {
check_number_GEQs(nGEQs);
allocGEQs = padGEQs(allocGEQs, nGEQs);
assert(allocGEQs >= nGEQs);
eqn *new_geqs = new eqn[allocGEQs];
for (int e = nGEQs - 2; e >= 0; e--)
eqnncpy(&(new_geqs[e]), &(GEQs[e]), nVars);
delete[] GEQs;
GEQs = new_geqs;
}
// problem->GEQs[nGEQs-1].color = black;
// eqnnzero(&problem->GEQs[nGEQs-1],problem->nVars);
return nGEQs-1;
}
int Problem::newEQ() {
if (++nEQs > allocEQs) {
check_number_EQs(nEQs);
allocEQs = padEQs(allocEQs, nEQs);
assert(allocEQs >= nEQs);
eqn *new_eqs = new eqn[allocEQs];
for (int e = nEQs - 2; e >= 0; e--)
eqnncpy(&(new_eqs[e]), &(EQs[e]), nVars);
delete[] EQs;
EQs = new_eqs;
}
// Could do this here, but some calls to newEQ do a copy instead of a zero;
// problem->EQs[nEQs-1].color = black;
// eqnnzero(&problem->EQs[nEQs-1],problem->nVars);
return nEQs-1;
}
} // namespace
|
