-
Notifications
You must be signed in to change notification settings - Fork 5
/
bool_op.cpp
402 lines (381 loc) · 16.2 KB
/
bool_op.cpp
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
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
/**
* Optimizing Implementations of Lightweight Building Blocks
*
* Copyright 2017 by
* Jade Tourteaux <Jade[dot]Tourteaux[at]gmail.com>
* Jérémy Jean <Jean[dot]Jeremy[at]gmail.com>
*
* This file is part of some open source application.
*
* Some open source application 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.
*
* Some open source application 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 Foobar. If not, see <http://www.gnu.org/licenses/>.
*
* @license GPL-3.0+ <http://spdx.org/licenses/GPL-3.0+>
*/
#include "mitm.h"
void bool_op_simple_gates(function_t f, vector<function_t> *v, int operation)
{
function_t fun_tmp = f;
if(operation == RNOT1)
{
for(int i = 0; i < N; i++)
{
fun_tmp.bit_slice[i] = ~(f.bit_slice[i]);
fun_tmp.info_line = (uint8_t)i;
fun_tmp.info_op = (uint8_t)operation;
fun_tmp.prev = f.bit_slice[i];
fun_tmp.sort();
v->push_back(fun_tmp);
fun_tmp = f;
}
}
else if(operation == NOT1)
{
for (int i = 0; i < N; i++)
{
fun_tmp.bit_slice[i] = ~(f.bit_slice[i]);
fun_tmp.info_line = (uint8_t)i;
fun_tmp.info_op = (uint8_t)operation;
fun_tmp.prev = f.bit_slice[i];
fun_tmp.sort();
v->push_back(fun_tmp);
fun_tmp = f;
}
}
else
{
for(int i = 0; i < N; i++)
{
for(int j = 0; j < N; j++)
{
if(i != j)
{
switch (operation)
{
case MAOI1 :
case XOR2 : fun_tmp.bit_slice[i] = (f.bit_slice[i])^(f.bit_slice[j]); break;
case MOAI1 :
case XNOR2 : fun_tmp.bit_slice[i] = ~((f.bit_slice[i])^(f.bit_slice[j])); break;
case CNOT1 : fun_tmp.bit_slice[i] = (f.bit_slice[i])^(f.bit_slice[j]);
int _ = f.bit_slice[i];
break;
}
fun_tmp.prev = f.bit_slice[i];
fun_tmp.info_line = (uint8_t)i;
fun_tmp.info_op = (uint8_t)operation;
fun_tmp.sort();
v->push_back(fun_tmp);
fun_tmp = f;
}
}
fun_tmp = f;
}
}
}
void bool_op_double_gates(function_t f, vector<function_t> *v, int operation)
{
auto two_inputs = [](const function_t f, int i, int a, int b, int operation)
{
auto fun_tmp = f;
switch (operation)
{
case MAOI1_NAND2 :
case MOAI1_AND2 : fun_tmp.bit_slice[i] = ~(f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N])^f.bit_slice[i];break;
case MAOI1_NOR2 :
case MOAI1_OR2 : fun_tmp.bit_slice[i] = ~(f.bit_slice[(i+a)%N]|f.bit_slice[(i+b)%N])^f.bit_slice[i];break;
case XOR2_AND2 :
case MAOI1_AND2 :
case MOAI1_NAND2 : fun_tmp.bit_slice[i] = (f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N])^f.bit_slice[i];break;
case CCNOT2 : {
fun_tmp.bit_slice[i] = (f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N])^f.bit_slice[i];
int _ = f.bit_slice[(i+a)%N];
int __ = f.bit_slice[(i+b)%N];
break;
}
case FREDKIN2_31 : {
fun_tmp.bit_slice[i] = (~f.bit_slice[(i+a)%N]&f.bit_slice[i])|(f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N]);
int _ = f.bit_slice[(i+a)%N];
int __ = (~f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N])|(f.bit_slice[(i+a)%N]&f.bit_slice[i]);
break;
}
case FREDKIN2_32 : {
fun_tmp.bit_slice[i] = (~f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N])|(f.bit_slice[(i+a)%N]&f.bit_slice[i]);
int _ = f.bit_slice[(i+a)%N];
int __ = (~f.bit_slice[(i+a)%N]&f.bit_slice[i])|(f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N]);
break;
}
case XOR2_OR2 :
case MAOI1_OR2 :
case MOAI1_NOR2 : fun_tmp.bit_slice[i] = (f.bit_slice[(i+a)%N]|f.bit_slice[(i+b)%N])^f.bit_slice[i];break;
case XOR2_ANDN2 : fun_tmp.bit_slice[i] = (~f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N])^f.bit_slice[i];break;
case XOR2_ORN2 : fun_tmp.bit_slice[i] = (~f.bit_slice[(i+a)%N]|f.bit_slice[(i+b)%N])^f.bit_slice[i];break;
}
fun_tmp.prev = f.bit_slice[i];
fun_tmp.info_line = i;
fun_tmp.info_op = operation;
fun_tmp.sort();
return fun_tmp;
};
auto three_inputs = [](const function_t f, int i, int a, int b, int c, int operation)
{
auto fun_tmp = f;
switch (operation)
{
case XOR2_AND2_AND2 :
case MAOI1_AND3 :
case MOAI1_NAND2_AND2 :
case MAOI1_AND2_AND2 :
case MOAI1_NAND3 : fun_tmp.bit_slice[i] = (f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N])^f.bit_slice[i];break;
case XOR2_OR2_OR2 :
case MAOI1_OR3 :
case MOAI1_NOR2_OR2 :
case MAOI1_OR2_OR2 :
case MOAI1_NOR3 : fun_tmp.bit_slice[i] = (f.bit_slice[(i+a)%N]|f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N])^f.bit_slice[i];break;
case MOAI1_AND3 :
case MAOI1_NAND2_AND2 :
case MOAI1_AND2_AND2 :
case MAOI1_NAND3 : fun_tmp.bit_slice[i] = ~(f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N])^f.bit_slice[i];break;
case MOAI1_OR3 :
case MAOI1_NOR2_OR2 :
case MOAI1_OR2_OR2 :
case MAOI1_NOR3 : fun_tmp.bit_slice[i] = ~(f.bit_slice[(i+a)%N]|f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N])^f.bit_slice[i];break;
case CCCNOT2 : {
fun_tmp.bit_slice[i] = (f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N])^f.bit_slice[i];
int _ = f.bit_slice[(i+a)%N];
int __ = f.bit_slice[(i+b)%N];
int ___ = f.bit_slice[(i+c)%N];
break;
}
case FREDKIN2_41 : {
fun_tmp.bit_slice[i] = (~(f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N])&f.bit_slice[(i+c)%N]) |
(f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N]&f.bit_slice[i]);
int _ = f.bit_slice[(i+a)%N];
int __ = f.bit_slice[(i+b)%N];
int ___ = (~(f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N])&f.bit_slice[i]) |
(f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N]);
break;
}
case FREDKIN2_42 : {
fun_tmp.bit_slice[i] = (~(f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N])&f.bit_slice[i]) |
(f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N]);
int _ = f.bit_slice[(i+a)%N];
int __ = f.bit_slice[(i+b)%N];
int ___ = (~(f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N])&f.bit_slice[(i+c)%N]) |
(f.bit_slice[(i+a)%N]&f.bit_slice[(i+b)%N]&f.bit_slice[i]);
break;
}
}
fun_tmp.prev = f.bit_slice[i];
fun_tmp.info_line = (uint8_t)i;
fun_tmp.info_op = (uint8_t)operation;
fun_tmp.sort();
return fun_tmp;
};
switch (operation)
{
case MAOI1_AND3 :
case MOAI1_NAND2_AND2 :
case MAOI1_AND2_AND2 :
case MAOI1_OR3 :
case MOAI1_NOR2_OR2 :
case MAOI1_OR2_OR2 :
case MOAI1_AND3 :
case MAOI1_NAND2_AND2 :
case MOAI1_AND2_AND2 :
case MOAI1_OR3 :
case MAOI1_NOR2_OR2 :
case MOAI1_OR2_OR2 :
case MOAI1_NAND3 :
case MOAI1_NOR3 :
case MAOI1_NAND3 :
case MAOI1_NOR3 :
case XOR2_AND2_AND2 :
case XOR2_OR2_OR2 :
case CCCNOT2 :
case FREDKIN2_41 :
case FREDKIN2_42 :
for (int i = 0; i < N; i++)
{
v->push_back(three_inputs(f, i, 1, 2, 3, operation));
}
break;
case MAOI1_NAND2 :
case MAOI1_NOR2 :
case MAOI1_AND2 :
case MAOI1_OR2 :
case MOAI1_NAND2 :
case MOAI1_NOR2 :
case MOAI1_AND2 :
case MOAI1_OR2 :
case XOR2_AND2 :
case XOR2_OR2 :
case XOR2_ANDN2 :
case XOR2_ORN2 :
case CCNOT2 :
case FREDKIN2_31 :
case FREDKIN2_32 :
for (int i = 0; i < N; i++)
{
v->push_back(two_inputs(f, i, 1, 2, operation));
v->push_back(two_inputs(f, i, 2, 3, operation));
v->push_back(two_inputs(f, i, 1, 3, operation));
}
break;
}
}
void bool_op_triple_gates(function_t f, vector<function_t> *v, int operation)
{
auto double_gates = [](const function_t f, int i, int a, int b, int c, int operation)
{
auto fun_tmp = f;
switch (operation)
{
case MAOI1_NAND2_NAND2 :
case MOAI1_AND2_NAND2 : fun_tmp.bit_slice[i] = ~(~(f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N])&f.bit_slice[(i+a)%N])^f.bit_slice[i];break;
case MAOI1_NOR2_NOR2 :
case MOAI1_OR2_NOR2 : fun_tmp.bit_slice[i] = ~(~(f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N])|f.bit_slice[(i+a)%N])^f.bit_slice[i];break;
case MAOI1_AND2_NAND2 :
case MOAI1_NAND2_NAND2 : fun_tmp.bit_slice[i] = (~(f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N])&f.bit_slice[(i+a)%N])^f.bit_slice[i];break;
case MAOI1_OR2_NOR2 :
case MOAI1_NOR2_NOR2 : fun_tmp.bit_slice[i] = (~(f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N])|f.bit_slice[(i+a)%N])^f.bit_slice[i];break;
case XOR2_AND2_OR2 :
case MAOI1_AND2_OR2 :
case MOAI1_NAND2_OR2 : fun_tmp.bit_slice[i] = ((f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N])&f.bit_slice[(i+a)%N])^f.bit_slice[i];break;
case XOR2_OR2_AND2 :
case MAOI1_OR2_AND2 :
case MOAI1_NOR2_AND2 : fun_tmp.bit_slice[i] = ((f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N])|f.bit_slice[(i+a)%N])^f.bit_slice[i];break;
case MAOI1_AND2_NOR2 :
case MOAI1_NAND2_NOR2 : fun_tmp.bit_slice[i] = (~(f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N])&f.bit_slice[(i+a)%N])^f.bit_slice[i];break;
case MAOI1_OR2_NAND2 :
case MOAI1_NOR2_NAND2 : fun_tmp.bit_slice[i] = (~(f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N])|f.bit_slice[(i+a)%N])^f.bit_slice[i];break;
case MAOI1_NAND2_OR2 :
case MOAI1_AND2_OR2 : fun_tmp.bit_slice[i] = ~((f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N])&f.bit_slice[(i+a)%N])^f.bit_slice[i];break;
case MAOI1_NOR2_AND2 :
case MOAI1_OR2_AND2 : fun_tmp.bit_slice[i] = ~((f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N])|f.bit_slice[(i+a)%N])^f.bit_slice[i];break;
case MAOI1_NAND2_NOR2 :
case MOAI1_AND2_NOR2 : fun_tmp.bit_slice[i] = ~(~(f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N])&f.bit_slice[(i+a)%N])^f.bit_slice[i];break;
case MAOI1_NOR2_NAND2 :
case MOAI1_OR2_NAND2 : fun_tmp.bit_slice[i] = ~(~(f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N])|f.bit_slice[(i+a)%N])^f.bit_slice[i];break;
case XOR2_OR2_ANDN2 : fun_tmp.bit_slice[i] = ( f.bit_slice[(i+a)%N] | (~f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N]) )^f.bit_slice[i];break;
case XOR2_OR2_ORN2 : fun_tmp.bit_slice[i] = ( f.bit_slice[(i+a)%N] | (~f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N]) )^f.bit_slice[i];break;
case XOR2_AND2_ANDN2 : fun_tmp.bit_slice[i] = ( f.bit_slice[(i+a)%N] & (~f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N]) )^f.bit_slice[i];break;
case XOR2_AND2_ORN2 : fun_tmp.bit_slice[i] = ( f.bit_slice[(i+a)%N] & (~f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N]) )^f.bit_slice[i];break;
case XOR2_ANDN2_AND2 : fun_tmp.bit_slice[i] = ( ~f.bit_slice[(i+a)%N] & (f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N]) )^f.bit_slice[i];break;
case XOR2_ANDN2_OR2 : fun_tmp.bit_slice[i] = ( ~f.bit_slice[(i+a)%N] & (f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N]) )^f.bit_slice[i];break;
case XOR2_ANDN2_ANDN2 : fun_tmp.bit_slice[i] = ( ~f.bit_slice[(i+a)%N] & (~f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N]) )^f.bit_slice[i];break;
case XOR2_ANDN2_ORN2 : fun_tmp.bit_slice[i] = ( ~f.bit_slice[(i+a)%N] & (~f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N]) )^f.bit_slice[i];break;
case XOR2_ORN2_AND2 : fun_tmp.bit_slice[i] = ( ~f.bit_slice[(i+a)%N] | (f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N]) )^f.bit_slice[i];break;
case XOR2_ORN2_OR2 : fun_tmp.bit_slice[i] = ( ~f.bit_slice[(i+a)%N] | (f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N]) )^f.bit_slice[i];break;
case XOR2_ORN2_ANDN2 : fun_tmp.bit_slice[i] = ( ~f.bit_slice[(i+a)%N] | (~f.bit_slice[(i+b)%N]&f.bit_slice[(i+c)%N]) )^f.bit_slice[i];break;
case XOR2_ORN2_ORN2 : fun_tmp.bit_slice[i] = ( ~f.bit_slice[(i+a)%N] | (~f.bit_slice[(i+b)%N]|f.bit_slice[(i+c)%N]) )^f.bit_slice[i];break;
}
fun_tmp.prev = f.bit_slice[i];
fun_tmp.info_line = (uint8_t)i;
fun_tmp.info_op = (uint8_t)operation;
fun_tmp.sort();
return fun_tmp;
};
for (int i = 0; i < N; i++)
{
v->push_back(double_gates(f, i, 1, 2, 3, operation));
v->push_back(double_gates(f, i, 2, 3, 1, operation));
v->push_back(double_gates(f, i, 3, 1, 2, operation));
}
}
void bool_op_fun( int op_id, function_t f, vector<function_t> *v)
{
switch (op_id)
{
case NOT1 :
case XOR2 :
case XNOR2 :
case MAOI1 :
case MOAI1 :
case RNOT1 :
case CNOT1 : bool_op_simple_gates(f, v, op_id); break;
case MOAI1_NAND2 :
case MOAI1_NOR2 :
case MOAI1_AND2 :
case MOAI1_OR2 :
case MAOI1_NAND3 :
case MAOI1_NOR3 :
case MOAI1_NAND3 :
case MOAI1_NOR3 :
case XOR2_AND2 :
case XOR2_OR2 :
case XOR2_ANDN2 :
case XOR2_ORN2 :
case XOR2_OR2_OR2 :
case XOR2_AND2_AND2 :
case MAOI1_NAND2 :
case MAOI1_NOR2 :
case MAOI1_AND2 :
case MAOI1_OR2 :
case MAOI1_AND3 :
case MOAI1_NAND2_AND2 :
case MAOI1_AND2_AND2 :
case MAOI1_OR3 :
case MOAI1_NOR2_OR2 :
case MAOI1_OR2_OR2 :
case MOAI1_AND3 :
case MAOI1_NAND2_AND2 :
case MOAI1_AND2_AND2 :
case MOAI1_OR3 :
case MAOI1_NOR2_OR2 :
case MOAI1_OR2_OR2 :
case CCNOT2 :
case CCCNOT2 :
case FREDKIN2_31 :
case FREDKIN2_32 :
case FREDKIN2_41 :
case FREDKIN2_42 : bool_op_double_gates(f, v, op_id); break;
case MOAI1_AND2_NAND2 :
case MOAI1_OR2_NOR2 :
case MOAI1_NAND2_NAND2 :
case MOAI1_NOR2_NOR2 :
case MOAI1_NAND2_OR2 :
case MOAI1_NOR2_AND2 :
case MOAI1_NAND2_NOR2 :
case MOAI1_NOR2_NAND2 :
case MOAI1_AND2_OR2 :
case MOAI1_OR2_AND2 :
case MOAI1_AND2_NOR2 :
case MOAI1_OR2_NAND2 :
case XOR2_OR2_AND2 :
case XOR2_OR2_ANDN2 :
case XOR2_OR2_ORN2 :
case XOR2_AND2_OR2 :
case XOR2_AND2_ANDN2 :
case XOR2_AND2_ORN2 :
case XOR2_ANDN2_AND2 :
case XOR2_ANDN2_OR2 :
case XOR2_ANDN2_ANDN2 :
case XOR2_ANDN2_ORN2 :
case XOR2_ORN2_AND2 :
case XOR2_ORN2_OR2 :
case XOR2_ORN2_ANDN2 :
case XOR2_ORN2_ORN2 :
case MAOI1_NAND2_NAND2 :
case MAOI1_NOR2_NOR2 :
case MAOI1_AND2_NAND2 :
case MAOI1_OR2_NOR2 :
case MAOI1_AND2_OR2 :
case MAOI1_OR2_AND2 :
case MAOI1_AND2_NOR2 :
case MAOI1_OR2_NAND2 :
case MAOI1_NAND2_OR2 :
case MAOI1_NOR2_AND2 :
case MAOI1_NAND2_NOR2 :
case MAOI1_NOR2_NAND2 : bool_op_triple_gates(f, v, op_id); break;
}
}