grt: removing unused code and cleaning

Signed-off-by: Jonas Gava <jfgava@precisioninno.com>

Author: jfgava

src/grt/src/fastroute/include/FastRoute.h

@@ -545,8 +545,6 @@ class FastRouteCore
   void StTreeVisualization(const StTree& stree,
                            FrNet* net,
                            bool is3DVisualization);
-  bool congestionAnalysis(int netID);
-  void updateNetUsage(int netID, int adjustment);
   int netCount() const { return nets_.size(); }
 
   using Tile = std::tuple<int, int, int>;

src/grt/src/fastroute/include/Graph2D.h

@@ -91,14 +91,6 @@ class Graph2D
   void updateUsageH(int x, int y, FrNet* net, int usage);
   void updateUsageV(int x, const Interval& yi, FrNet* net, int usage);
   void updateUsageV(int x, int y, FrNet* net, int usage);
-  bool hasNDRCapacity(FrNet* net, int x, int y, EdgeDirection direction);
-  bool hasNDRCapacity(FrNet* net,
-                      int x,
-                      int y,
-                      EdgeDirection direction,
-                      double edge_cost);
-  void printNDRCap(int x, int y);
-  void printEdgeCapPerLayer();
   void initCap3D();
   void updateCap3D(int x,
                    int y,
@@ -124,12 +116,9 @@ class Graph2D
                          FrNet* net,
                          EdgeDirection dir,
                          double edge_cost);
-  void fixFractionEdgeUsage(int min_layer,
-                            int max_layer,
-                            int x,
-                            int y,
-                            double edge_cost,
-                            EdgeDirection dir);
+  bool hasNDRCapacity(FrNet* net, int x, int y, EdgeDirection direction);
+  void printNDRCap(int x, int y);
+  void printEdgeCapPerLayer();
   void initNDRnets();
 
   void foreachEdge(const std::function<void(Edge&)>& func);

src/grt/src/fastroute/src/FastRoute.cpp

@@ -1441,15 +1441,6 @@ NetRouteMap FastRouteCore::run()
           max_overflow_increases);
     }
 
-    // debug mode Rectilinear Steiner Tree during overflow iterations
-    if (debug_->isOn() && debug_->rectilinearSTree) {
-      for (const int& netID : net_ids_) {
-        if (nets_[netID]->getDbNet() == debug_->net) {
-          StTreeVisualization(sttrees_[netID], nets_[netID], false);
-        }
-      }
-    }
-
     // generate DRC report each interval
     if (congestion_report_iter_step_ && i % congestion_report_iter_step_ == 0) {
       saveCongestion(i);
@@ -1629,8 +1620,6 @@ void FastRouteCore::computeCongestionInformation()
         if (overflow > 0) {
           overflow_per_layer_[l] += overflow;
           max_h_overflow_[l] = std::max(max_h_overflow_[l], overflow);
-          logger_->info(
-              GRT, 117, "Overflow H: x: {} y: {} layer: {}", j, i, l + 1);
         }
       }
     }
@@ -1644,8 +1633,6 @@ void FastRouteCore::computeCongestionInformation()
         if (overflow > 0) {
           overflow_per_layer_[l] += overflow;
           max_v_overflow_[l] = std::max(max_v_overflow_[l], overflow);
-          logger_->info(
-              GRT, 118, "Overflow V: x: {} y: {} layer: {}", j, i, l + 1);
         }
       }
     }

src/grt/src/fastroute/src/RipUp.cpp

@@ -336,13 +336,6 @@ bool FastRouteCore::newRipup3DType3(const int netID, const int edgeID)
     if (grids[i].layer == grids[i + 1].layer) {
       if (grids[i].x == grids[i + 1].x) {  // a vertical edge
         const int ymin = std::min(grids[i].y, grids[i + 1].y);
-        if (net->getDbNet() == debug_->net) {
-          logger_->report("--- Ripping up {} x{} y{} l{}",
-                          net->getName(),
-                          grids[i].x,
-                          ymin,
-                          grids[i].layer + 1);
-        }
         graph2d_.updateUsageV(grids[i].x, ymin, net, -net->getEdgeCost());
         v_edges_3D_[grids[i].layer][ymin][grids[i].x].usage
             -= net->getLayerEdgeCost(grids[i].layer);
@@ -406,13 +399,6 @@ void FastRouteCore::newRipupNet(const int netID)
   const int num_edges = sttrees_[netID].num_edges();
 
   FrNet* net = nets_[netID];
-  if (net->getDbNet() == debug_->net) {
-    logger_->report(
-        "=== Starting newRipupNet for {} - NumEdges: {}  - EdgeCost: {} ===",
-        net->getName(),
-        num_edges,
-        edgeCost);
-  }
 
   for (int edgeID = 0; edgeID < num_edges; edgeID++) {
     const TreeEdge* treeedge = &(treeedges[edgeID]);

src/grt/src/fastroute/src/graph2d.cpp

@@ -367,7 +367,7 @@ void Graph2D::updateUsageH(const int x,
   }
 }
 
-// Updates usage for a horizontal edge segment, considering NDRs.
+// Updates usage for a horizontal edge segment.
 void Graph2D::updateUsageH(const Interval& xi,
                            const int y,
                            FrNet* net,
@@ -401,7 +401,7 @@ void Graph2D::updateUsageV(const int x,
   }
 }
 
-// Updates usage for a vertical edge segment, considering NDRs.
+// Updates usage for a vertical edge segment.
 void Graph2D::updateUsageV(const int x,
                            const Interval& yi,
                            FrNet* net,

src/grt/src/fastroute/src/route.cpp

@@ -1316,11 +1316,6 @@ void FastRouteCore::routeMonotonic(const int netID,
   treeedge->route.routelen = cnt - 1;
 
   grids.resize(cnt);
-
-  if (is_ndr && net->getDbNet() == debug_->net) {
-    logger_->report("After reroute monotonic");
-    printEdge(netID, edgeID);
-  }
 }
 
 void FastRouteCore::routeMonotonicAll(const int threshold,