luke/verilator
1
0
Fork 0
mirror of https://github.com/verilator/verilator.git synced 2026-09-04 00:30:34 +02:00
Code Issues Packages Projects Releases Wiki Activity

Internals: Favor std::array. No functional change intended.

Browse Source
This commit is contained in:
Wilson Snyder
2025-07-24 02:39:03 -04:00
parent 2287d420ee
commit e995646898
4 changed files with 7 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/V3OrderParallel.cpp
+1 -2
View File
@@ -332,7 +332,7 @@ private:
// Cost of critical paths going FORWARD from graph-start to the start
// of this vertex, and also going REVERSE from the end of the graph to
// the end of the vertex. Same units as m_cost.
std::array<uint64_t, GraphWay::NUM_WAYS> m_critPathCost;
std::array<uint64_t, GraphWay::NUM_WAYS> m_critPathCost = {};
const uint32_t m_id; // Unique LogicMTask ID number
static uint32_t s_nextId; // Next ID number to use
@@ -361,7 +361,6 @@ public:
: V3GraphVertex{graphp}
, m_id{s_nextId++} {
UASSERT(s_nextId < 0xFFFFFFFFUL, "Too many mTaskGraphp");
for (uint64_t& item : m_critPathCost) item = 0;
if (mVtxp) {
m_mVertices.linkBack(mVtxp);
if (const OrderLogicVertex* const olvp = mVtxp->logicp()) {