luke/verilator
1
0
Fork 0
mirror of https://github.com/verilator/verilator.git synced 2026-10-06 10:03:44 +02:00
Code Issues Packages Projects Releases Wiki Activity

Internals: Redo post-error additional information to be part of error calls.

Browse Source
This commit is contained in:
Wilson Snyder
2025-05-10 16:20:12 -04:00
parent 0f528d136d
commit 680236b03e
17 changed files with 128 additions and 117 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/V3GraphAlg.cpp
+10 -7
View File
@@ -29,6 +29,7 @@
#include <algorithm>
#include <list>
#include <map>
#include <numeric>
#include <vector>
VL_DEFINE_DEBUG_FUNCTIONS;
@@ -281,8 +282,7 @@ class GraphAlgRank final : GraphAlg<> {
// If larger rank is found, assign it and loop back through
// If we hit a back node make a list of all loops
if (vertexp->user() == 1) {
m_graphp->reportLoops(m_edgeFuncp, vertexp);
m_graphp->loopsMessageCb(vertexp);
m_graphp->loopsMessageCb(vertexp, m_edgeFuncp);
return; // LCOV_EXCL_LINE // gcc gprof bug misses this return
}
if (vertexp->rank() >= currentRank) return; // Already processed it
@@ -313,6 +313,7 @@ void V3Graph::rank(V3EdgeFuncP edgeFuncp) { GraphAlgRank{this, edgeFuncp}; }
class GraphAlgRLoops final : GraphAlg<> {
std::vector<V3GraphVertex*> m_callTrace; // List of everything we hit processing so far
std::vector<string> m_msgs; // Output messages
bool m_done = false; // Exit algorithm
void main(V3GraphVertex* vertexp) {
@@ -333,9 +334,8 @@ class GraphAlgRLoops final : GraphAlg<> {
m_callTrace[currentRank++] = vertexp;
if (vertexp->user() == 1) {
for (unsigned i = 0; i < currentRank; i++) { //
m_graphp->loopsVertexCb(m_callTrace[i]);
}
for (unsigned i = 0; i < currentRank; i++)
m_msgs.emplace_back(m_graphp->loopsVertexCb(m_callTrace[i]));
m_done = true;
return;
}
@@ -353,10 +353,13 @@ public:
main(vertexp);
}
~GraphAlgRLoops() = default;
string message() const {
return std::accumulate(m_msgs.begin(), m_msgs.end(), std::string{""});
}
};
void V3Graph::reportLoops(V3EdgeFuncP edgeFuncp, V3GraphVertex* vertexp) {
GraphAlgRLoops{this, edgeFuncp, vertexp};
string V3Graph::reportLoops(V3EdgeFuncP edgeFuncp, V3GraphVertex* vertexp) {
return GraphAlgRLoops{this, edgeFuncp, vertexp}.message();
}
//######################################################################