Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

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

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

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

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion include/mockturtle/algorithms/cut_rewriting.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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 ) ) )
{
Expand All @@ -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 );
Expand Down
Loading