Mario1159/verilator
1
0
Fork 0
forked from github/verilator
Code Pull Requests Releases 1 Activity

Minor optimization of PartContraction

Browse Source 
Remove rarely used debug code from initialization loop.
This commit is contained in:
Geza Lore 2022-08-26 16:52:28 +01:00
parent 546aeab9f2
commit 881c3f6e40
1 changed files with 13 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
src/V3Partition.cpp
View File

@ -1270,6 +1270,18 @@ public:
// METHODS
void go() {
if (m_slowAsserts) {
// Check there are no redundant edges
for (V3GraphVertex* itp = m_mtasksp->verticesBeginp(); itp;
itp = itp->verticesNextp()) {
std::unordered_set<const V3GraphVertex*> neighbors;
for (V3GraphEdge* edgep = itp->outBeginp(); edgep; edgep = edgep->outNextp()) {
const bool first = neighbors.insert(edgep->top()).second;
UASSERT_OBJ(first, itp, "Redundant edge found in input to PartContraction()");
}
}
}
unsigned maxMTasks = v3Global.opt.threadsMaxMTasks();
if (maxMTasks == 0) { // Unspecified so estimate
if (v3Global.opt.threads() > 1) {
@ -1290,15 +1302,9 @@ public:
// - Incrementally recompute critical paths near the merged mtask.
for (V3GraphVertex* itp = m_mtasksp->verticesBeginp(); itp; itp = itp->verticesNextp()) {
itp->userp(nullptr); // Reset user value. Used by PartPropagateCp.
std::unordered_set<const V3GraphVertex*> neighbors;
itp->userp(nullptr); // Reset user value while we are here. Used by PartPropagateCp.
for (V3GraphEdge* edgep = itp->outBeginp(); edgep; edgep = edgep->outNextp()) {
m_sb.add(static_cast<MTaskEdge*>(edgep));
if (m_slowAsserts) {
UASSERT_OBJ(neighbors.find(edgep->top()) == neighbors.end(), itp,
"Redundant edge found in input to PartContraction()");
}
neighbors.insert(edgep->top());
}
siblingPairFromRelatives<GraphWay::REVERSE, true>(itp);
siblingPairFromRelatives<GraphWay::FORWARD, true>(itp);