forked from ibex-team/ibex-lib
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathibex_NodeType.cpp
More file actions
310 lines (292 loc) · 5.76 KB
/
Copy pathibex_NodeType.cpp
File metadata and controls
310 lines (292 loc) · 5.76 KB
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
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
//============================================================================
// I B E X
// File : ibex_NodeType.cpp
// Author : Gilles Chabert
// Copyright : Ecole des Mines de Nantes (France)
// License : See the LICENSE file
// Created : 18 Aug 2014
//============================================================================
#include "ibex_NodeType.h"
// =========== shortcuts ==================
#define IN __IBEX_IN__
#define OUT __IBEX_OUT__
#define UNK __IBEX_UNK__
#define UNK_IN __IBEX_UNK_IN__
#define UNK_OUT __IBEX_UNK_OUT__
#define UNK_IN_OUT __IBEX_UNK_IN_OUT__
#define IN_TMP __IBEX_IN_TMP__
// ========================================
namespace ibex {
// relic from irregular set, need for SetBisect constructor
NodeType operator|(NodeType x, NodeType y) {
switch (x) {
case IN : {
switch(y) {
case IN : return IN;
case OUT :
case UNK_OUT:
case UNK_IN_OUT: return UNK_IN_OUT;
default : return UNK_IN;
}
}
break;
case OUT : {
switch(y) {
case OUT : return OUT;
case IN :
case UNK_IN:
case UNK_IN_OUT: return UNK_IN_OUT;
default : return UNK_OUT;
}
}
break;
case UNK : {
switch(y) {
case IN :
case UNK_IN: return UNK_IN;
case OUT :
case UNK_OUT: return UNK_OUT;
case UNK: return UNK;
default: return UNK_IN_OUT;
}
}
break;
case UNK_IN : {
switch(y) {
case IN :
case UNK_IN:
case UNK : return UNK_IN;
default: return UNK_IN_OUT;
}
}
break;
case UNK_OUT : {
switch(y) {
case OUT :
case UNK_OUT:
case UNK : return UNK_OUT;
default: return UNK_IN_OUT;
}
}
break;
default :
//Warning: IN_TMP not considered here.
return UNK_IN_OUT;
}
}
// define operator or between two nodetype, assuming the two boxes associated are equal
NodeType uni(NodeType x,NodeType y) {
switch (x) {
case IN : {
return IN;
}
break;
case OUT : {
return y;
}
break;
case UNK : {
switch(y) {
case IN : return IN;
case UNK_IN: return UNK_IN;
case OUT : return UNK;
case UNK : return UNK;
case UNK_OUT: return UNK_OUT;
default: return UNK_IN_OUT;
}
}
break;
case UNK_IN : {
switch(y) {
case IN :
case UNK_IN:
case UNK : return UNK_IN;
default: return UNK_IN_OUT;
}
}
break;
case UNK_OUT : {
switch(y) {
case OUT :
case UNK_OUT:
case UNK : return UNK_OUT;
default: return UNK_IN_OUT;
}
}
break;
default :
//Warning: IN_TMP not considered here.
return UNK_IN_OUT;
}
}
// define operator or between two nodetype, assuming box of nodetype y is subset of box of nodetype x;
NodeType uni_in(NodeType x, NodeType y) {
switch (x) {
case IN : {
switch(y) {
case IN : return IN;
case OUT : return IN;
case UNK : return IN;
case UNK_OUT:
case UNK_IN_OUT: return UNK_IN_OUT;
default : return UNK_IN;
}
}
break;
case OUT : {
switch(y) {
case OUT : return OUT;
case IN : return UNK;
case UNK : return UNK;
case UNK_IN:
case UNK_IN_OUT: return UNK_IN_OUT;
default : return UNK_OUT;
}
}
break;
case UNK : {
switch(y) {
return UNK;
}
}
break;
/*case UNK_IN : {
switch(y) {
case IN :
case UNK_IN:
case UNK : return UNK_IN;
default: return UNK_IN_OUT;
}
}
break;
case UNK_OUT : {
switch(y) {
case OUT :
case UNK_OUT:
case UNK : return UNK_OUT;
default: return UNK_IN_OUT;
}
}
break;*/
default :
//Warning: IN_TMP not considered here.
return UNK_IN_OUT;
}
}
// define operator and between two nodetype, assuming the two boxes associated are equal
NodeType inte(NodeType x, NodeType y) {
switch (x) {
case IN : {
return y;
}
break;
case OUT : {
return OUT;
}
break;
case UNK : {
switch(y) {
case IN : return UNK;
case UNK_IN: return UNK_IN;
case OUT : return OUT;
case UNK : return UNK;
case UNK_OUT: return UNK_OUT;
default: return UNK_IN_OUT;
}
}
break;
case UNK_IN : {
switch(y) {
case IN :
case UNK_IN:
case UNK : return UNK_IN;
default: return UNK_IN_OUT;
}
}
break;
case UNK_OUT : {
switch(y) {
case OUT :
case UNK_OUT:
case UNK : return UNK_OUT;
default: return UNK_IN_OUT;
}
}
break;
default :
//Warning: IN_TMP not considered here.
return UNK_IN_OUT;
}
}
// define operator and between two nodetype, assuming box of nodetype y is subset of box of nodetype x;
NodeType inte_in(NodeType x, NodeType y) {
switch (x) {
case IN : {
switch(y) {
case IN : return IN;
case OUT : return UNK;
case UNK : return UNK;
case UNK_OUT:
case UNK_IN_OUT: return UNK_IN_OUT;
default : return UNK_IN;
}
}
break;
case OUT : {
switch(y) {
case OUT : return OUT;
case IN : return OUT;
case UNK : return OUT;
case UNK_IN:
case UNK_IN_OUT: return UNK_IN_OUT;
default : return UNK_OUT;
}
}
break;
case UNK : {
switch(y) {
case IN : return UNK;
case UNK_IN: return UNK_IN;
case OUT : return UNK;
case UNK_OUT: return UNK_OUT;
case UNK: return UNK;
default: return UNK_IN_OUT;
}
}
break;
case UNK_IN : {
switch(y) {
case IN :
case UNK_IN:
case UNK : return UNK_IN;
default: return UNK_IN_OUT;
}
}
break;
case UNK_OUT : {
switch(y) {
case OUT :
case UNK_OUT:
case UNK : return UNK_OUT;
default: return UNK_IN_OUT;
}
}
break;
default :
//Warning: IN_TMP not considered here.
return UNK_IN_OUT;
}
}
bool certainly_contains_in(NodeType x) {
return x==IN || x==UNK_IN || x==UNK_IN_OUT;
}
bool certainly_contains_out(NodeType x) {
return x==OUT || x==UNK_OUT || x==UNK_IN_OUT;
}
bool possibly_contains_in(NodeType x) {
return x!=OUT;
}
bool possibly_contains_out(NodeType x) {
return x!=IN;
}
} // namespace ibex