Version abc70906

1 files changed, 9 insertions, 3 deletions

diff --git a/src/base/abci/abcFraig.c b/src/base/abci/abcFraig.c
index 64cb2b38..be8a25f1 100644
--- a/src/base/abci/abcFraig.c
+++ b/src/base/abci/abcFraig.c
@@ -673,7 +673,7 @@ int Abc_NtkFraigStore( Abc_Ntk_t * pNtkAdd )
         }
     }
     Vec_PtrPush( vStore, pNtk );
-    printf( "The number of AIG nodes added to storage = %5d.\n", Abc_NtkNodeNum(pNtk) );
+//    printf( "The number of AIG nodes added to storage = %5d.\n", Abc_NtkNodeNum(pNtk) );
     return 1;
 }
 
@@ -704,9 +704,15 @@ Abc_Ntk_t * Abc_NtkFraigRestore()
         printf( "There are no network currently in storage.\n" );
         return NULL;
     }
-    printf( "Currently stored %d networks will be fraiged.\n", Vec_PtrSize(vStore) );
+//    printf( "Currently stored %d networks will be fraiged.\n", Vec_PtrSize(vStore) );
     pNtk = Vec_PtrEntry( vStore, 0 );
 
+    // swap the first and last network
+    // this should lead to the primary choice being "better" because of synthesis
+    pNtk = Vec_PtrPop( vStore );
+    Vec_PtrPush( vStore, Vec_PtrEntry(vStore,0) );
+    Vec_PtrWriteEntry( vStore, 0, pNtk );
+
     // to determine the number of simulation patterns
     // use the following strategy
     // at least 64 words (32 words random and 32 words dynamic)
@@ -731,7 +737,7 @@ Abc_Ntk_t * Abc_NtkFraigRestore()
     // perform partitioned computation of structural choices
     pFraig = Abc_NtkFraigPartitioned( vStore, &Params );
     Abc_NtkFraigStoreClean();
-PRT( "Total choicing time", clock() - clk );
+//PRT( "Total choicing time", clock() - clk );
     return pFraig;
 }