cts: fix dummy load count reported by each builder

Signed-off-by: arthurjolo <[email protected]>

Author: arthurjolo

src/cts/include/cts/TritonCTS.h

@@ -188,7 +188,7 @@ class TritonCTS
   double computeInsertionDelay(const std::string& name,
                                odb::dbInst* inst,
                                odb::dbMTerm* mterm);
-  void writeDummyLoadsToDb(Clock& clockNet,
+  int writeDummyLoadsToDb(Clock& clockNet,
                            std::unordered_set<odb::dbInst*>& dummies);
   bool computeIdealOutputCaps(Clock& clockNet);
   void findCandidateDummyCells(std::vector<sta::LibertyCell*>& dummyCandidates);

src/cts/src/TreeBuilder.h

@@ -221,6 +221,8 @@ class TreeBuilder
 
   float getAveSinkArrival() const { return aveArrival_; }
   void setAveSinkArrival(float arrival) { aveArrival_ = arrival; }
+  float getNDummies() const { return nDummies_; }
+  void setNDummies(float nDummies) { nDummies_ = nDummies; }
   odb::dbInst* getTopBuffer() const { return topBuffer_; }
   void setTopBuffer(odb::dbInst* inst) { topBuffer_ = inst; }
   std::string getTopBufferName() const { return topBufferName_; }
@@ -256,6 +258,7 @@ class TreeBuilder
       insertionDelays_;
   TreeType type_ = TreeType::RegularTree;
   float aveArrival_ = 0.0;
+  int nDummies_ = 0;
   odb::dbInst* topBuffer_ = nullptr;
   std::string topBufferName_;
   odb::dbNet* drivingNet_ = nullptr;

src/cts/src/TritonCTS.cpp

@@ -494,7 +494,8 @@ void TritonCTS::writeDataToDb()
       writeClockNDRsToDb(builder.get());
     }
     if (options_->dummyLoadEnabled()) {
-      writeDummyLoadsToDb(builder->getClock(), clkDummies);
+      int nDummies = writeDummyLoadsToDb(builder->getClock(), clkDummies);
+      builder->setNDummies(nDummies);
     }
   }
 
@@ -538,7 +539,7 @@ void TritonCTS::writeDataToDb()
       }
       logger_->info(CTS, 102, " Path depth {} - {}", minDepth, maxDepth);
       if (options_->dummyLoadEnabled()) {
-        logger_->info(CTS, 207, " Leaf load cells {}", dummyLoadIndex_);
+        logger_->info(CTS, 207, " Dummy loads inserted {}", builder->getNDummies());
       }
     }
   }
@@ -2122,20 +2123,21 @@ sta::LibertyCell* findBestDummyCell(
   return bestCell;
 }
 
-void TritonCTS::writeDummyLoadsToDb(Clock& clockNet,
+int TritonCTS::writeDummyLoadsToDb(Clock& clockNet,
                                     std::unordered_set<odb::dbInst*>& dummies)
 {
   // Traverse clock tree and compute ideal output caps for clock
   // buffers in the same level
   if (!computeIdealOutputCaps(clockNet)) {
     // No cap adjustment is needed
-    return;
+    return 0;
   }
 
   // Find suitable candidate cells for dummy loads
   std::vector<sta::LibertyCell*> dummyCandidates;
   findCandidateDummyCells(dummyCandidates);
 
+  int nDummies = 0;
   clockNet.forEachSubNet([&](ClockSubNet& subNet) {
     subNet.forEachSink([&](ClockInst* inst) {
       if (inst->isClockBuffer()
@@ -2145,6 +2147,7 @@ void TritonCTS::writeDummyLoadsToDb(Clock& clockNet,
             = insertDummyCell(clockNet, inst, dummyCandidates);
         if (dummyInst != nullptr) {
           dummies.insert(dummyInst);
+          nDummies++;
         }
       }
     });
@@ -2153,6 +2156,7 @@ void TritonCTS::writeDummyLoadsToDb(Clock& clockNet,
   if (logger_->debugCheck(utl::CTS, "dummy load", 1)) {
     printClockNetwork(clockNet);
   }
+  return nDummies;
 }
 
 // Return true if any clock buffers need cap adjustment; false otherwise