Refactor(Best gain): Init best gain out of cuts loop

lsils · Dec 19, 2024 · d337a5f · d337a5f
1 parent f2396ec
commit d337a5f
Showing 1 changed file with 2 additions and 1 deletion.
diff --git a/include/mockturtle/algorithms/cut_rewriting.hpp b/include/mockturtle/algorithms/cut_rewriting.hpp
@@ -433,6 +433,8 @@ class cut_rewriting_with_compatibility_graph_impl
       if ( mffc_size( ntk, n ) == 1 )
         return true;
 
+      int32_t best_gain{ -1 };
+
       /* foreach cut */
       for ( auto& cut : cuts.cuts( ntk.node_to_index( n ) ) )
       {
@@ -454,7 +456,6 @@ class cut_rewriting_with_compatibility_graph_impl
         int32_t value = recursive_deref<Ntk, NodeCostFn>( ntk, n );
         {
           stopwatch t( st.time_rewriting );
-          int32_t best_gain{ -1 };
 
           const auto on_signal = [&]( auto const& f_new ) {
             auto [v, contains] = recursive_ref_contains( ntk.get_node( f_new ), n );