mirror of
https://github.com/verilator/verilator.git
synced 2026-10-06 10:03:44 +02:00
Merge branch 'master' into develop-v5
This commit is contained in:
+6
-14
@@ -41,6 +41,8 @@
|
||||
#include <unordered_set>
|
||||
#include <vector>
|
||||
|
||||
VL_DEFINE_DEBUG_FUNCTIONS;
|
||||
|
||||
class LogicMTask;
|
||||
class MTaskEdge;
|
||||
class MergeCandidate;
|
||||
@@ -390,7 +392,6 @@ public:
|
||||
static void dumpCpFilePrefixed(const V3Graph* graphp, const string& nameComment);
|
||||
|
||||
private:
|
||||
VL_DEBUG_FUNC; // Declare debug()
|
||||
VL_UNCOPYABLE(LogicMTask);
|
||||
};
|
||||
|
||||
@@ -809,7 +810,6 @@ public:
|
||||
}
|
||||
|
||||
private:
|
||||
VL_DEBUG_FUNC; // Declare debug()
|
||||
VL_UNCOPYABLE(PartParallelismEst);
|
||||
};
|
||||
|
||||
@@ -1053,7 +1053,6 @@ public:
|
||||
}
|
||||
|
||||
private:
|
||||
VL_DEBUG_FUNC;
|
||||
VL_UNCOPYABLE(PartPropagateCp);
|
||||
};
|
||||
|
||||
@@ -1823,7 +1822,6 @@ public:
|
||||
}
|
||||
|
||||
private:
|
||||
VL_DEBUG_FUNC; // Declare debug()
|
||||
VL_UNCOPYABLE(PartContraction);
|
||||
};
|
||||
|
||||
@@ -1837,8 +1835,6 @@ private:
|
||||
bool m_hasDpiHazard = false; // Found a DPI import call.
|
||||
bool m_tracingCall = false; // Iterating into a CCall to a CFunc
|
||||
// METHODS
|
||||
VL_DEBUG_FUNC;
|
||||
|
||||
void visit(AstCFunc* nodep) override {
|
||||
if (!m_tracingCall) return;
|
||||
m_tracingCall = false;
|
||||
@@ -2150,7 +2146,6 @@ public:
|
||||
|
||||
private:
|
||||
VL_UNCOPYABLE(PartFixDataHazards);
|
||||
VL_DEBUG_FUNC;
|
||||
};
|
||||
|
||||
//######################################################################
|
||||
@@ -2472,7 +2467,7 @@ public:
|
||||
}
|
||||
}
|
||||
|
||||
if (debug() >= 4) schedule.dumpDotFilePrefixedAlways(mtaskGraph, "schedule");
|
||||
if (dumpGraph() >= 4) schedule.dumpDotFilePrefixedAlways(mtaskGraph, "schedule");
|
||||
|
||||
return schedule;
|
||||
}
|
||||
@@ -2530,7 +2525,6 @@ public:
|
||||
}
|
||||
|
||||
private:
|
||||
VL_DEBUG_FUNC; // Declare debug()
|
||||
VL_UNCOPYABLE(PartPackMTasks);
|
||||
};
|
||||
|
||||
@@ -2538,7 +2532,7 @@ private:
|
||||
// V3Partition implementation
|
||||
|
||||
void V3Partition::debugMTaskGraphStats(const V3Graph* graphp, const string& stage) {
|
||||
if (!debug()) return;
|
||||
if (!debug() && !dump() && !dumpGraph()) return;
|
||||
|
||||
UINFO(4, "\n");
|
||||
UINFO(4, " Stats for " << stage << endl);
|
||||
@@ -2575,7 +2569,7 @@ void V3Partition::debugMTaskGraphStats(const V3Graph* graphp, const string& stag
|
||||
if (mtaskCount < 1000) {
|
||||
string filePrefix("ordermv_");
|
||||
filePrefix += stage;
|
||||
if (debug() >= 4) graphp->dumpDotFilePrefixedAlways(filePrefix);
|
||||
if (dumpGraph() >= 4) graphp->dumpDotFilePrefixedAlways(filePrefix);
|
||||
}
|
||||
|
||||
// Look only at the cost of each mtask, neglect communication cost.
|
||||
@@ -2750,9 +2744,7 @@ void V3Partition::go(V3Graph* mtasksp) {
|
||||
// For debug: print out the longest critical path. This allows us to
|
||||
// verify that the costs look reasonable, that we aren't combining
|
||||
// nodes that should probably be split, etc.
|
||||
if (v3Global.opt.dumpTreeLevel(__FILE__) >= 3) {
|
||||
LogicMTask::dumpCpFilePrefixed(mtasksp, "cp");
|
||||
}
|
||||
if (dump() >= 3) LogicMTask::dumpCpFilePrefixed(mtasksp, "cp");
|
||||
|
||||
// Merge nodes that could present data hazards; see comment within.
|
||||
{
|
||||
|
||||
Reference in New Issue
Block a user