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
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
#ifndef BM3VL__H__INCLUDED__
#define BM3VL__H__INCLUDED__
/*
Copyright(c) 2021 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
For more information please visit: http://bitmagic.io
*/
/*! \file bm3vl.h
\brief Three-valued logic (3VL) operations
*/
#include "bm.h"
namespace bm
{
/** @defgroup bm3VL three-valued logic
Functions for three-valued logic (Kleene)
https://en.wikipedia.org/wiki/Three-valued_logic
@ingroup bvector
*/
/**
@brief Initialized the value bit-vector so that it always returns 0 (false)
for the unknown.
3-value logics in BitMagic is built on two bit-vectors:
value-bit-vector and NULL bit-vector. Value vector contains '1s' for the
true known elements. bm::init_3vl makes sure this is true by running
bv_value = bv_value AND bv_null logical operation.
NULL bit-vector represents NOT NULL (known) values as 1s
@param bv_value - [in, out] values bit-vector
@param bv_null - [in] not NULL (known) bit-vector
@ingroup bm3VL
*/
template<class BV>
void init_kleene(BV& bv_value, const BV& bv_null)
{
bv_value.bit_and(bv_null);
}
/**
@brief Return Kleene logic value based on value and known vectors
@param bv_value - [in] values bit-vector
@param bv_null - [in] knowns bit-vector
@param idx - [in] index of value to extract and return
@return (−1: false; 0: unknown; +1: true)
@ingroup bm3VL
*/
template<class BV>
int get_value_kleene(const BV& bv_value, const BV& bv_null,
typename BV::size_type idx) BMNOEXCEPT
{
bool b_notnull = bv_null.test(idx);
if (b_notnull)
{
// TODO: optimization may be needed to test 2 bvs in the same coord
bool b_val = bv_value.test(idx);
if (b_val)
return 1;
return -1;
}
return 0; // unknown
}
/**
@brief Set Kleene logic value based on value and known vectors
@param bv_value - [out] values bit-vector
@param bv_null - [out] knowns bit-vector
@param idx - [in] index of value to extract and return
@param val - [in] value which can be: (−1: false; 0: unknown; +1: true)
@ingroup bm3VL
*/
template<class BV>
void set_value_kleene(BV& bv_value, BV& bv_null,
typename BV::size_type idx, int val)
{
bool is_set;
switch (val)
{
case -1:
bv_value.clear_bit(idx);
bv_null.set(idx);
break;
case 0:
is_set = bv_null.set_bit_and(idx, false);
if (is_set)
bv_value.clear_bit(idx);
break;
case 1:
// TODO: optimization may be needed to set 2 bvs in the same coords
bv_value.set(idx);
bv_null.set(idx);
break;
default:
BM_ASSERT(0); // unknown 3-value logic constant
} // switch
}
/**
@brief Kleene NEG operation
True becomes false and vice verse, but unknowns remain unknown false
if we look directly into bv_value vector. This oprtaion does NOT produce
unknown true values.
@param bv_value - [in, out] values bit-vector
@param bv_null - [in] not NULL (known) bit-vector
@ingroup bm3VL
*/
template<class BV>
void invert_kleene(BV& bv_value, const BV& bv_null)
{
bv_value.bit_xor(bv_null);
}
/**
@brief Kleene OR(vect1, vect2) (vect1 |= vect2)
1 OR Unk = 1 (known)
@param bv_value1 - [in, out] values bit-vector
@param bv_null1 - [in, out] not NULL (known) bit-vector
@param bv_value2 - [in] values bit-vector
@param bv_null2 - [in] not NULL (known) bit-vector
@ingroup bm3VL
*/
template<class BV>
void or_kleene(BV& bv_value1, BV& bv_null1,
const BV& bv_value2, const BV& bv_null2)
{
BV bv_known_false1, bv_known_false2; // known but false
bv_known_false1.bit_xor(bv_value1, bv_null1, BV::opt_none);
bv_known_false2.bit_xor(bv_value2, bv_null2, BV::opt_none);
bv_known_false1.bit_sub(bv_null2); // known false but unknown in 2
bv_known_false2.bit_sub(bv_null1); // known false but unknown in 1
bv_value1.bit_or(bv_value2);
bv_null1.bit_or(bv_null2);
bv_null1.bit_sub(bv_known_false1); // exclude FALSE-unknown combinations
bv_null1.bit_sub(bv_known_false2);
}
/**
@brief 3-way Kleene OR: target := OR(vect1, vect2) (target := vect1 | vect2)
1 OR Unk = 1 (known)
@param bv_value_target - [out] target values bit-vector
@param bv_null_target - [out] target not NULL (known) bit-vector
@param bv_value1 - [in] values bit-vector
@param bv_null1 - [in] not NULL (known) bit-vector
@param bv_value2 - [in] values bit-vector
@param bv_null2 - [in] not NULL (known) bit-vector
@ingroup bm3VL
*/
template<class BV>
void or_kleene(BV& bv_value_target, BV& bv_null_target,
const BV& bv_value1, const BV& bv_null1,
const BV& bv_value2, const BV& bv_null2)
{
BV bv_known_false1, bv_known_false2; // known but false
bv_known_false1.bit_xor(bv_value1, bv_null1, BV::opt_none);
bv_known_false2.bit_xor(bv_value2, bv_null2, BV::opt_none);
bv_known_false1.bit_sub(bv_null2); // known false but unknown in 2
bv_known_false2.bit_sub(bv_null1); // known false but unknown in 1
bv_value_target.bit_or(bv_value1, bv_value2, BV::opt_none);
bv_null_target.bit_or(bv_null1, bv_null2, BV::opt_none);
// exclude FALSE-unknown combinations
bv_null_target.bit_sub(bv_known_false1);
bv_null_target.bit_sub(bv_known_false2);
}
/**
@brief Kleene AND(vect1, vect2) (vect1 &= vect2)
0 AND Unk = 0 (known)
@param bv_value1 - [in, out] values bit-vector
@param bv_null1 - [in, out] not NULL (known) bit-vector
@param bv_value2 - [in] values bit-vector
@param bv_null2 - [in] not NULL (known) bit-vector
@ingroup bm3VL
*/
template<class BV>
void and_kleene(BV& bv_value1, BV& bv_null1,
const BV& bv_value2, const BV& bv_null2)
{
BV bv_ambig_null1; // unknowns on just one of the two args
bv_ambig_null1.bit_xor(bv_null1, bv_null2, BV::opt_none);
BV bv_ambig_null2(bv_ambig_null1); // just a copy
bv_ambig_null1.bit_and(bv_value1); // "unknowns 1"
bv_ambig_null2.bit_and(bv_value2); // "unknowns 2"
bv_value1.bit_and(bv_value2);
bv_null1.bit_or(bv_null2); // merge all null2 knowns
// minus all single-end TRUE unk
bv_null1.bit_sub(bv_ambig_null1);
bv_null1.bit_sub(bv_ambig_null2);
}
/**
@brief 3-way Kleene target:=AND(vect1, vect2) (target:= vect1 & vect2)
0 AND Unk = 0 (known)
@param bv_value_target - [out] values bit-vector
@param bv_null_target - [out] not NULL (known) bit-vector
@param bv_value1 - [in] values bit-vector
@param bv_null1 - [in] not NULL (known) bit-vector
@param bv_value2 - [in] values bit-vector
@param bv_null2 - [in] not NULL (known) bit-vector
@ingroup bm3VL
*/
template<class BV>
void and_kleene(BV& bv_value_target, BV& bv_null_target,
const BV& bv_value1, const BV& bv_null1,
const BV& bv_value2, const BV& bv_null2)
{
BV bv_ambig_null1; // unknowns on just one of the two args
bv_ambig_null1.bit_xor(bv_null1, bv_null2, BV::opt_none);
BV bv_ambig_null2(bv_ambig_null1); // just a copy
bv_ambig_null1.bit_and(bv_value1); // "unknowns 1"
bv_ambig_null2.bit_and(bv_value2); // "unknowns 2"
bv_value_target.bit_and(bv_value1, bv_value2, BV::opt_none);
bv_null_target.bit_or(bv_null1, bv_null2, BV::opt_none);
bv_null_target.bit_sub(bv_ambig_null1);
bv_null_target.bit_sub(bv_ambig_null2);
}
/**
Reference function for Kleene logic AND (for verification and testing)
@ingroup bm3VL
@internal
*/
inline
int and_values_kleene(int a, int b) BMNOEXCEPT
{
switch (a)
{
case -1:
return -1; // always false
case 0:
switch (b)
{
case -1: return -1;
case 0: return 0;
case 1: return 0;
default:
BM_ASSERT(0);
}
break;
case 1:
switch (b)
{
case -1: return -1;
case 0: return 0;
case 1: return 1;
default:
BM_ASSERT(0);
}
break;
default:
BM_ASSERT(0);
}
BM_ASSERT(0);
return 0;
}
/**
Reference function for Kleene logic OR (for verification and testing)
@ingroup bm3VL
@internal
*/
inline
int or_values_kleene(int a, int b) BMNOEXCEPT
{
switch (a)
{
case -1:
switch (b)
{
case -1: return -1;
case 0: return 0;
case 1: return 1;
default:
BM_ASSERT(0);
}
break;
case 0:
switch (b)
{
case -1: return 0;
case 0: return 0;
case 1: return 1;
default:
BM_ASSERT(0);
}
break;
case 1:
return 1;
default:
BM_ASSERT(0);
}
BM_ASSERT(0);
return 0;
}
} // namespace bm
#endif