-
Notifications
You must be signed in to change notification settings - Fork 8
Expand file tree
/
Copy pathSNLLogicCloud.cpp
More file actions
472 lines (424 loc) · 16.6 KB
/
Copy pathSNLLogicCloud.cpp
File metadata and controls
472 lines (424 loc) · 16.6 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
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
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
// Copyright 2024-2026 keplertech.io
// SPDX-License-Identifier: GPL-3.0-only
#include "SNLLogicCloud.h"
#include <tbb/tbb_allocator.h>
#include <cassert>
#include "SNLDesignModeling.h"
#include "tbb/concurrent_vector.h"
#include "tbb/enumerable_thread_specific.h"
#include "SNLPath.h"
#include "Tree2BoolExpr.h"
// #define DEBUG_CHECKS
// #define DEBUG_PRINTS
#ifdef DEBUG_PRINTS
#define DEBUG_LOG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
#define DEBUG_LOG(fmt, ...)
#endif
using namespace KEPLER_FORMAL;
using namespace naja::DNL;
typedef std::pair<
std::vector<naja::DNL::DNLID, tbb::tbb_allocator<naja::DNL::DNLID>>,
size_t>
IterationInputsPair;
thread_local IterationInputsPair currentIterationInputs;
IterationInputsPair& getCurrentIterationInputs() {
return currentIterationInputs;
}
thread_local IterationInputsPair newIterationInputs;
IterationInputsPair& getNewIterationInputs() {
return newIterationInputs;
}
void clearCurrentIterationInputs() {
auto& currentIterationInputs = getCurrentIterationInputs();
currentIterationInputs.first.clear();
}
void pushBackCurrentIterationInputs(naja::DNL::DNLID input) {
auto& currentIterationInputs = getCurrentIterationInputs();
currentIterationInputs.first.emplace_back(input);
}
size_t sizeOfCurrentIterationInputs() {
return getCurrentIterationInputs().first.size();
}
void copyCurrentIterationInputs(std::vector<naja::DNL::DNLID, tbb::tbb_allocator<naja::DNL::DNLID>>& res) {
res.clear();
auto& current = getCurrentIterationInputs();
res = std::move(current.first);
}
void clearNewIterationInputs() {
auto& newIterationInputs = getNewIterationInputs();
newIterationInputs.first.clear();
}
void pushBackNewIterationInputs(naja::DNL::DNLID input) {
getNewIterationInputs().first.emplace_back(input);
}
bool emptyNewIterationInputs() {
return getNewIterationInputs().first.empty();
}
size_t sizeOfNewIterationInputs() {
return getNewIterationInputs().first.size();
}
void copyNewIterationInputstoCurrent() {
auto& newIterationInputs = getNewIterationInputs();
auto& currentIterationInputs = getCurrentIterationInputs();
#ifdef DEBUG_CHECKS
size_t newSize = newIterationInputs.first.size();
#endif
currentIterationInputs = std::move(newIterationInputs);
#ifdef DEBUG_CHECKS
assert(currentIterationInputs.first.size() == newSize &&
"copyNewIterationInputstoCurrent: size mismatch after copy");
#endif
}
thread_local std::pair<
std::vector<std::pair<naja::DNL::DNLID, naja::DNL::DNLID>,
tbb::tbb_allocator<std::pair<naja::DNL::DNLID,
naja::DNL::DNLID>>>,
size_t>
inputsToMerge;
std::pair<std::vector<std::pair<naja::DNL::DNLID, naja::DNL::DNLID>,
tbb::tbb_allocator<std::pair<naja::DNL::DNLID,
naja::DNL::DNLID>>>, size_t>&
getInputsToMerge() {
return inputsToMerge;
}
void clearInputsToMerge() {
auto& inputsToMerge = getInputsToMerge();
inputsToMerge.first.clear();
}
void pushBackInputsToMerge(
const std::pair<naja::DNL::DNLID, naja::DNL::DNLID>& input) {
getInputsToMerge().first.emplace_back(input);
}
size_t sizeOfInputsToMerge() {
return getInputsToMerge().first.size();
}
// 2 level vector visited terms pair - 1st: termID, 2nd: termID
typedef std::vector<
std::unordered_set<naja::DNL::DNLID,
std::hash<naja::DNL::DNLID>,
std::equal_to<naja::DNL::DNLID>,
tbb::tbb_allocator<naja::DNL::DNLID>>,
tbb::tbb_allocator<std::unordered_set<naja::DNL::DNLID,
std::hash<naja::DNL::DNLID>,
std::equal_to<naja::DNL::DNLID>,
tbb::tbb_allocator<naja::DNL::DNLID>>>>
VisitedTermsPairsVec;
thread_local VisitedTermsPairsVec visitedTermsPairs;
struct PairHash {
size_t operator()(const std::pair<naja::DNL::DNLID,naja::DNL::DNLID>& p) const noexcept {
// 64-bit combine; tweak for your DNLID type
uint64_t a = static_cast<uint64_t>(p.first);
uint64_t b = static_cast<uint64_t>(p.second);
return (a * 11400714819323198485ull) ^ (b + 0x9e3779b97f4a7c15ull + (a<<6) + (a>>2));
}
};
struct PairEq {
bool operator()(const std::pair<naja::DNL::DNLID,naja::DNL::DNLID>& x, const std::pair<naja::DNL::DNLID,naja::DNL::DNLID>& y) const noexcept {
return x.first == y.first && x.second == y.second;
}
};
using HandledSet = std::unordered_set<
std::pair<naja::DNL::DNLID,naja::DNL::DNLID>,
PairHash, PairEq,
tbb::tbb_allocator<std::pair<naja::DNL::DNLID, naja::DNL::DNLID>>>;
thread_local HandledSet visitedTermsPairsSet;
void clearVisitedTermsPairs() {
visitedTermsPairsSet.clear();
}
thread_local std::pair<naja::DNL::DNLID, naja::DNL::DNLID> tempPair;
bool isPairVisited(naja::DNL::DNLID termA,
naja::DNL::DNLID termB) {
tempPair.first = termA;
tempPair.second = termB;
if (!(visitedTermsPairsSet.insert(tempPair)).second) {
return true;
}
return false;
}
bool SNLLogicCloud::isInput(naja::DNL::DNLID termID) {
return PIs_[termID];
}
bool SNLLogicCloud::isOutput(naja::DNL::DNLID termID) {
return POs_[termID];
}
void SNLLogicCloud::compute() {
clearNewIterationInputs();
clearCurrentIterationInputs();
DEBUG_LOG("---- Begin!!\n");
if (dnl_.getDNLTerminalFromID(seedOutputTerm_).isTopPort() ||
isOutput(seedOutputTerm_)) {
const auto& iso = dnl_.getDNLIsoDB().getIsoFromIsoIDconst(
dnl_.getDNLTerminalFromID(seedOutputTerm_).getIsoID());
// LCOV_EXCL_START
if (iso.getDrivers().size() > 1) {
for (const auto& driver : iso.getDrivers()) {
DEBUG_LOG("Driver: %s\n", dnl_.getDNLTerminalFromID(driver)
.getSnlBitTerm()
->getName()
.getString()
.c_str());
}
throw std::runtime_error("Seed output term is not a single driver");
} else if (iso.getDrivers().empty()) {
std::string termName = dnl_.getDNLTerminalFromID(seedOutputTerm_)
.getSnlBitTerm()
->getName()
.getString();
std::string error =
"Seed output term '" + termName + "' has no drivers";
throw std::runtime_error(error);
}
// LCOV_EXCL_STOP
const auto& driver = iso.getDrivers().front();
auto& inst = dnl_.getDNLTerminalFromID(driver).getDNLInstance();
if (isInput(driver)) {
pushBackCurrentIterationInputs(driver);
table_ = SNLTruthTableTree(inst.getID(), driver,
SNLTruthTableTree::Node::Type::P);
return;
}
DEBUG_LOG("Instance name: %s\n",
inst.getSNLInstance()->getName().getString().c_str());
for (DNLID termID = inst.getTermIndexes().first;
termID <= inst.getTermIndexes().second; termID++) {
const DNLTerminalFull& term = dnl_.getDNLTerminalFromID(termID);
if (term.getSnlBitTerm()->getDirection() !=
SNLBitTerm::Direction::Output) {
pushBackNewIterationInputs(termID);
DEBUG_LOG("Add input with id: %zu\n", termID);
}
}
DEBUG_LOG("model name: %s\n",
inst.getSNLModel()->getName().getString().c_str());
table_ = SNLTruthTableTree(inst.getID(), driver);
auto* model = inst.getSNLModel();
assert(SNLDesignModeling::getTruthTable(model,
dnl_.getDNLTerminalFromID(driver).getSnlBitTerm()->getOrderID())
.isInitialized() &&
"Truth table is not initialized");
assert(table_.isInitialized() &&
"Truth table for seed output term is not initialized");
} else {
const auto& inst = dnl_.getDNLInstanceFromID(seedOutputTerm_);
for (DNLID termID = inst.getTermIndexes().first;
termID <= inst.getTermIndexes().second; termID++) {
const DNLTerminalFull& term = dnl_.getDNLTerminalFromID(termID);
if (term.getSnlBitTerm()->getDirection() !=
SNLBitTerm::Direction::Output) {
// newIterationInputs.emplace_back(termID);
pushBackNewIterationInputs(termID);
DEBUG_LOG("Add input with id: %zu\n", termID);
}
}
DEBUG_LOG("model name: %s\n",
inst.getSNLModel()->getName().getString().c_str());
table_ = SNLTruthTableTree(inst.getID(), seedOutputTerm_);
assert(table_.isInitialized() &&
"Truth table for seed output term is not initialized");
}
if (emptyNewIterationInputs()) {
DEBUG_LOG("No inputs found for seed output term %zu\n", seedOutputTerm_);
return;
}
bool reachedPIs = true;
size_t size = sizeOfNewIterationInputs();
for (size_t i = 0; i < size; i++) {
if (!isInput(
getNewIterationInputs().first
[i]) /* && !isOutput(getNewIterationInputs().first[i])*/) {
reachedPIs = false;
break;
}
} // allocator for buckets
// HandledSet handledTerms;
// handledTerms.reserve(naja::DNL::get()->getDNLTerms().size() / 4);
clearVisitedTermsPairs();
size_t iter = 0;
while (!reachedPIs) {
DEBUG_LOG("---iter %lu---\n", iter);
DEBUG_LOG("Current iteration inputs size: %zu\n",
sizeOfNewIterationInputs());
copyNewIterationInputstoCurrent();
clearNewIterationInputs();
DEBUG_LOG("table size: %zu, currentIterationInputs_ size: %zu\n",
table_.size(), sizeOfCurrentIterationInputs());
clearInputsToMerge();
size_t sizeOfCurrentInputs = sizeOfCurrentIterationInputs();
for (size_t i = 0; i < sizeOfCurrentInputs; i++) {
const auto& input = getCurrentIterationInputs().first[i];
if (isInput(input) /*|| isOutput(input)*/) {
pushBackNewIterationInputs(input);
DEBUG_LOG("Adding input id: %zu %s\n", input,
dnl_.getDNLTerminalFromID(input)
.getSnlBitTerm()
->getName()
.getString()
.c_str());
pushBackInputsToMerge(
{naja::DNL::DNLID_MAX, input}); // Placeholder for PI/PO
continue;
}
const auto& iso = dnl_.getDNLIsoDB().getIsoFromIsoIDconst(
dnl_.getDNLTerminalFromID(input).getIsoID());
DEBUG_LOG("number of drivers: %zu\n", iso.getDrivers().size());
for (const auto& driver : iso.getDrivers()) {
DEBUG_LOG("Driver: %s\n", dnl_.getDNLTerminalFromID(driver)
.getSnlBitTerm()
->getName()
.getString()
.c_str());
}
if (iso.getDrivers().size() >= 1) {
// proper error with names of all the drivers
// throw an error and separate names by comma
if (iso.getDrivers().size() > 1) {
std::vector<std::string> namesOfDrivers;
for (auto dnlid : iso.getDrivers()) {
auto driver = dnl_.getDNLTerminalFromID(dnlid);
auto path = driver.getDNLInstance().getPath().getPathNames();
std::string fullName;
for (size_t i = 0; i < path.size(); i++) {
fullName += path[i].getString();
if (i != path.size() - 1) {
// LCOV_EXCL_START
fullName += ".";
// LCOV_EXCL_STOP
}
}
// add terminal name and bit
std::string termName =
driver.getSnlBitTerm()->getName().getString();
fullName += "." + termName;
// add bit
fullName += std::to_string(driver.getSnlBitTerm()->getBit());
namesOfDrivers.push_back(fullName);
}
std::string error = "Iso has multiple drivers: ";
for (size_t i = 0; i < namesOfDrivers.size(); i++) {
error += namesOfDrivers[i];
if (i != namesOfDrivers.size() - 1) {
error += ", ";
}
}
throw std::runtime_error(error);
}
} else if (iso.getDrivers().empty()) {
assert(iso.getDrivers().size() == 1 &&
"Iso have no drivers and more than one reader, not supported");
}
const auto& driver = iso.getDrivers().front();
if (isInput(driver) /* || isOutput(driver)*/
|| (Tree2BoolExpr::iso2boolExpr_.find(iso.getIsoID()) !=
Tree2BoolExpr::iso2boolExpr_.end() && iter > 0)) {
pushBackNewIterationInputs(driver);
DEBUG_LOG(
"- %lu After analyzing input %s(%lu), addings driver %s(%lu) is a "
"primary input\n",
iter,
dnl_.getDNLTerminalFromID(input)
.getSnlBitTerm()
->getName()
.getString()
.c_str(),
input,
dnl_.getDNLTerminalFromID(driver)
.getSnlBitTerm()
->getName()
.getString()
.c_str(),
driver);
pushBackInputsToMerge(
{naja::DNL::DNLID_MAX, driver}); // Placeholder for PI/PO
continue;
}
const auto& inst = dnl_.getDNLInstanceFromID(
dnl_.getDNLTerminalFromID(driver).getDNLInstance().getID());
DEBUG_LOG("Adding driver id: %zu %s(%s)\n", driver,
dnl_.getDNLTerminalFromID(driver)
.getSnlBitTerm()
->getName()
.getString()
.c_str(),
dnl_.getDNLTerminalFromID(driver)
.getSnlBitTerm()
->getDesign()
->getName()
.getString()
.c_str());
pushBackInputsToMerge({inst.getID(), driver});
for (DNLID termID = inst.getTermIndexes().first;
termID <= inst.getTermIndexes().second; termID++) {
const DNLTerminalFull& term = dnl_.getDNLTerminalFromID(termID);
if (term.getSnlBitTerm()->getDirection() !=
SNLBitTerm::Direction::Output) {
if (isPairVisited(driver, termID)) {
DEBUG_LOG(
"#### iter %lu 1 Term (%zu) %s of inst %s already handled, "
"skipping\n",
iter, input,
naja::DNL::get()
->getDNLTerminalFromID(input)
.getSnlBitTerm()
->getName()
.getString()
.c_str(),
naja::DNL::get()
->getDNLTerminalFromID(input)
.getDNLInstance()
->getSNLModel()
->getName()
.getString()
.c_str());
continue;
}
pushBackNewIterationInputs(termID);
}
}
}
if (sizeOfInputsToMerge() == 0) {
break;
}
DEBUG_LOG("--- Merging truth tables with %zu inputs\n",
sizeOfInputsToMerge());
table_.concatFull(getInputsToMerge().first,
sizeOfInputsToMerge());
reachedPIs = true;
size_t sizeOfNewInputs = sizeOfNewIterationInputs();
for (size_t i = 0; i < sizeOfNewInputs; i++) {
auto iso = dnl_.getDNLIsoDB().getIsoFromIsoIDconst(
dnl_.getDNLTerminalFromID(
getNewIterationInputs().first[i])
.getIsoID());
if (!isInput(getNewIterationInputs().first[i]) &&
(Tree2BoolExpr::iso2boolExpr_.find(
dnl_.getDNLTerminalFromID(
getNewIterationInputs().first[i])
.getIsoID()) == Tree2BoolExpr::iso2boolExpr_.end() ||
iso.getDrivers().front() != getNewIterationInputs().first[i])) {
reachedPIs = false;
break;
}
}
DEBUG_LOG("--- End of iteration %zu\n", iter);
iter++;
}
copyNewIterationInputstoCurrent();
#ifdef DEBUG_CHECKS
size_t finalSize = sizeOfCurrentIterationInputs();
#endif
copyCurrentIterationInputs(currentIterationInputs_);
#ifdef DEBUG_CHECKS
assert(finalSize == currentIterationInputs_.size() &&
"compute: size mismatch after final copy");
//assert(currentIterationInputs_.size() == sizeOfCurrentIterationInputs());
for (const auto& input : currentIterationInputs_) {
auto iso = dnl_.getDNLIsoDB().getIsoFromIsoIDconst(
dnl_.getDNLTerminalFromID(input).getIsoID());
assert(isInput(input) || (Tree2BoolExpr::iso2boolExpr_.find(
dnl_.getDNLTerminalFromID(input)
.getIsoID()) != Tree2BoolExpr::iso2boolExpr_.end() &&
iso.getDrivers().front() == input));
}
#endif
}