summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorAlan Mishchenko <alanmi@berkeley.edu>2016-11-21 11:52:50 -0800
committerAlan Mishchenko <alanmi@berkeley.edu>2016-11-21 11:52:50 -0800
commitb483c97fdd6e1fe6d52158d1b0231678073ace5e (patch)
tree5bec181d2f913f386021ef26c5808e2909f0dbcd
parenta703052bc535280de6f7ce01b796a5982e22f5a1 (diff)
downloadabc-b483c97fdd6e1fe6d52158d1b0231678073ace5e.tar.gz
abc-b483c97fdd6e1fe6d52158d1b0231678073ace5e.tar.bz2
abc-b483c97fdd6e1fe6d52158d1b0231678073ace5e.zip
Minor bug fixes.
-rw-r--r--src/aig/gia/giaSatMap.c2
-rw-r--r--src/base/abci/abc.c2
2 files changed, 2 insertions, 2 deletions
diff --git a/src/aig/gia/giaSatMap.c b/src/aig/gia/giaSatMap.c
index 0ddd4a39..5c17b74e 100644
--- a/src/aig/gia/giaSatMap.c
+++ b/src/aig/gia/giaSatMap.c
@@ -489,7 +489,7 @@ int Sbm_ManTestSat( void * pMan )
StartSol = Vec_IntSize(p->vSolCuts);
// StartSol = 30;
- while ( fKeepTrying )
+ while ( fKeepTrying && StartSol-fKeepTrying > 0 )
{
printf( "Trying to find mapping with %d gates.\n", StartSol-fKeepTrying );
// for ( i = Vec_IntSize(p->vSolCuts)-5; i < nVars; i++ )
diff --git a/src/base/abci/abc.c b/src/base/abci/abc.c
index 689c21b5..3efc41c9 100644
--- a/src/base/abci/abc.c
+++ b/src/base/abci/abc.c
@@ -7463,7 +7463,7 @@ usage:
Abc_Print( -2, "\t finds optimum networks using SAT-based exact synthesis for hex truth tables <truth1> <truth2> ...\n" );
Abc_Print( -2, "\t-D <num> : constrain maximum depth (if too low, algorithm may not terminate)\n" );
Abc_Print( -2, "\t-A <list> : input arrival times (comma separated list)\n" );
- Abc_Print( -2, "\t-S <num> : number of start gates in search [default = %s]\n", nStartGates );
+ Abc_Print( -2, "\t-S <num> : number of start gates in search [default = %d]\n", nStartGates );
Abc_Print( -2, "\t-C <num> : the limit on the number of conflicts; turn off with 0 [default = %d]\n", nBTLimit );
Abc_Print( -2, "\t-a : toggle create AIG [default = %s]\n", fMakeAIG ? "yes" : "no" );
Abc_Print( -2, "\t-t : run test suite\n" );