verbose

gezalore · Mar 24, 2024 · 8c65e3a · 8c65e3a
1 parent 1d3b3f8
commit 8c65e3a
Show file tree

Hide file tree

Showing 5 changed files with 140 additions and 26 deletions.
diff --git a/examples/cmake_tracing_c/CMakeLists.txt b/examples/cmake_tracing_c/CMakeLists.txt
@@ -35,5 +35,5 @@ target_compile_features(example PUBLIC cxx_std_14)
 # Add the Verilated circuit to the target
 verilate(example COVERAGE TRACE
   INCLUDE_DIRS "../make_tracing_c"
-  VERILATOR_ARGS -f ../make_tracing_c/input.vc -x-assign fast
+  VERILATOR_ARGS -f ../make_tracing_c/input.vc -x-assign fast --debug --debugi 9
   SOURCES ../make_tracing_c/top.v)
diff --git a/examples/cmake_tracing_c/Makefile b/examples/cmake_tracing_c/Makefile
@@ -54,7 +54,7 @@ run:
 
 	@echo
 	@echo "-- BUILD -------------------"
-	cmake --build build -j
+	cmake --build build -j -v
 
 	@echo
 	@echo "-- RUN ---------------------"

diff --git a/src/V3Graph.cpp b/src/V3Graph.cpp
@@ -41,15 +41,19 @@ V3GraphVertex::V3GraphVertex(V3Graph* graphp, const V3GraphVertex& old)
     , m_color{old.m_color}
     , m_rank{old.m_rank} {
     m_userp = nullptr;
+    UINFO(0, "A" << std::endl);
     graphp->vertices().linkBack(this);
+    UINFO(0, "B" << std::endl);
 }
 
 V3GraphVertex::V3GraphVertex(V3Graph* graphp)
     : m_fanout{0}
     , m_color{0}
     , m_rank{0} {
+    UINFO(0, "C" << std::endl);
     m_userp = nullptr;
     graphp->vertices().linkBack(this);
+    UINFO(0, "D" << std::endl);
 }
 
 void V3GraphVertex::unlinkEdges(V3Graph*) {
@@ -147,8 +151,11 @@ void V3GraphEdge::init(V3Graph* /*graphp*/, V3GraphVertex* fromp, V3GraphVertex*
     m_cutable = cutable;
     m_userp = nullptr;
     // Link vertices to this edge
+    UINFO(0, "E" << std::endl);
     m_fromp->outEdges().linkBack(this);
+    UINFO(0, "F" << std::endl);
     m_top->inEdges().linkBack(this);
+    UINFO(0, "G" << std::endl);
 }
 
 void V3GraphEdge::relinkFromp(V3GraphVertex* newFromp) {

diff --git a/src/V3LinkCells.cpp b/src/V3LinkCells.cpp
@@ -165,13 +165,15 @@ class LinkCellsVisitor final : public VNVisitor {
         m_graph.removeRedundantEdgesMax(&V3GraphEdge::followAlwaysTrue);
         if (dumpGraphLevel()) m_graph.dumpDotFilePrefixed("linkcells");
         m_graph.rank();
+        UINFO(0, "EEEEEEEEEEEEE??????????????????????" << std::endl);
         for (V3GraphVertex& vtx : m_graph.vertices()) {
             if (const LinkCellsVertex* const vvertexp = vtx.cast<LinkCellsVertex>()) {
                 // +1 so we leave level 1  for the new wrapper we'll make in a moment
                 AstNodeModule* const modp = vvertexp->modp();
                 modp->level(vvertexp->rank() + 1);
             }
         }
+        UINFO(0, "!!!!!!!!!!!!!!!EEEEEEEEEEEEE??????????????????????" << std::endl);
         if (v3Global.opt.topModule() != "" && !m_topVertexp) {
             v3error("Specified --top-module '" << v3Global.opt.topModule()
                                                << "' was not found in design.");