luke
/
verilator
mirror of https://github.com/verilator/verilator.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Internals: Compact stage statistics table

This commit is contained in:
Geza Lore 2026-06-21 23:23:52 +01:00
parent eafe9636cf
commit fed922a538
2 changed files with 9 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
src/V3Stats.cpp
View File

@ -41,6 +41,7 @@ class StatsVisitor final : public VNVisitorConst {
// STATE // STATE
const bool m_fastOnly; // When true, consider only fast functions const bool m_fastOnly; // When true, consider only fast functions
bool m_empty = true; // Netlist is empty
Counters m_counters; // The actual counts we will display Counters m_counters; // The actual counts we will display
Counters m_dumpster; // Alternate buffer to make discarding parts of the tree easier Counters m_dumpster; // Alternate buffer to make discarding parts of the tree easier
Counters* m_accump; // The currently active accumulator Counters* m_accump; // The currently active accumulator
@ -51,6 +52,7 @@ class StatsVisitor final : public VNVisitorConst {
// METHODS // METHODS
void countThenIterateChildren(AstNode* nodep) { void countThenIterateChildren(AstNode* nodep) {
++m_accump->m_statTypeCount[nodep->type()]; ++m_accump->m_statTypeCount[nodep->type()];
if (nodep->type() != VNType::Netlist) m_empty = false;
iterateChildrenConst(nodep); iterateChildrenConst(nodep);
} }
@ -93,6 +95,7 @@ public:
, m_accump{fastOnly ? &m_dumpster : &m_counters} { , m_accump{fastOnly ? &m_dumpster : &m_counters} {
UINFO(9, "Starting stats, fastOnly=" << fastOnly); UINFO(9, "Starting stats, fastOnly=" << fastOnly);
iterateConst(nodep); iterateConst(nodep);
if (m_empty) return;
// Shorthand // Shorthand
const auto addStat = [&](const std::string& name, double count, unsigned precision = 0) { const auto addStat = [&](const std::string& name, double count, unsigned precision = 0) {
@ -127,13 +130,13 @@ public:
addStat("Node count, " + typeName(t), count); addStat("Node count, " + typeName(t), count);
} }
} }
addStat("Node memory TOTAL (MiB)", totalNodeMemoryUsage >> 20); addStat("Node mem TOTAL (MiB)", totalNodeMemoryUsage >> 20);
// Node Memory usage // Node Memory usage
for (size_t t = 0; t < VNType::NUM_TYPES(); ++t) { for (size_t t = 0; t < VNType::NUM_TYPES(); ++t) {
if (const uint64_t count = m_counters.m_statTypeCount[t]) { if (const uint64_t count = m_counters.m_statTypeCount[t]) {
const double share = 100.0 * count * typeSize(t) / totalNodeMemoryUsage; const double share = 100.0 * count * typeSize(t) / totalNodeMemoryUsage;
addStat("Node memory share (%), " + typeName(t), share, 2); addStat("Node mem %, " + typeName(t), share, 2);
} }
} }

2
src/V3StatsReport.cpp
View File

@ -149,7 +149,7 @@ class StatsReport final {
os << " " << std::left << std::setw(maxWidth) << repp->name(); os << " " << std::left << std::setw(maxWidth) << repp->name();
} }
while (col < stages.size() && stages.at(col) != repp->stage()) { while (col < stages.size() && stages.at(col) != repp->stage()) {
os << std::setw(11) << ""; os << std::setw(10) << "";
col++; col++;
} }
repp->dump(os); repp->dump(os);