Merge pull request The-OpenROAD-Project#4484 from AcKoucher/mpl2_logger

mpl2 & par: clear logger

src/mpl2/src/hier_rtlmp.cpp

@@ -2165,7 +2165,6 @@ void HierRTLMP::breakLargeFlatCluster(Cluster* parent)
   const int num_parts = 2;  // We use two-way partitioning here
   const int num_vertices = static_cast<int>(vertex_weight.size());
   std::vector<float> hyperedge_weights(hyperedges.size(), 1.0f);
-  logger_->info(MPL, 23, "Calling Partitioner.");
   std::vector<int> part
       = tritonpart_->PartitionKWaySimpleMode(num_parts,
                                              balance_constraint,

src/par/src/TritonPart.cpp

@@ -1750,7 +1750,12 @@ void TritonPart::BuildTimingPaths()
 // the return value is the partitioning solution
 void TritonPart::MultiLevelPartition()
 {
-  logger_->info(PAR, 16, "Partitioning using multilevel methodology.");
+  debugPrint(logger_,
+             PAR,
+             "multilevel_partitioning",
+             1,
+             "Starting multilevel partitioning.");
+
   auto start_time_stamp_global = std::chrono::high_resolution_clock::now();
 
   // check the base balance constraint

src/par/test/partition_gcd.ok

@@ -21,7 +21,6 @@ Netlist Partitioning Parameters
 [INFO PAR-0037] Extracting timing paths.
 [WARNING PAR-0019] The traversed timing graph has 1 unconstrained hyperedges!
 [INFO PAR-0018] Read netlist has 469 vertices, 451 hyperedges and 52 timing paths.
-[INFO PAR-0016] Partitioning using multilevel methodology.
 Display Timing Path Cuts Statistics
 	Total number of timing paths = 52
 	Total number of timing-critical paths = 1