diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2014-03-16 23:38:50 -0700 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2014-03-16 23:38:50 -0700 |
commit | 2a219cf184c8f59f305b311e4b4041395587d816 (patch) | |
tree | 51148c3bd7ecf218fff7b5a0656a993a8e8eea88 | |
parent | 12c8a54cfff5ecd6a407651fdab37d2a81d00bb4 (diff) | |
download | abc-2a219cf184c8f59f305b311e4b4041395587d816.tar.gz abc-2a219cf184c8f59f305b311e4b4041395587d816.tar.bz2 abc-2a219cf184c8f59f305b311e4b4041395587d816.zip |
Synchronizing with the recent version.
-rw-r--r-- | src/opt/cgt/cgtCore.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/opt/cgt/cgtCore.c b/src/opt/cgt/cgtCore.c index d87801a3..4c98427b 100644 --- a/src/opt/cgt/cgtCore.c +++ b/src/opt/cgt/cgtCore.c @@ -51,7 +51,7 @@ void Cgt_SetDefaultParams( Cgt_Par_t * p ) p->nOdcMax = 0; // the max number of ODC levels to consider p->nConfMax = 10; // the max number of conflicts at a node p->nVarsMin = 1000; // the min number of vars to recycle the SAT solver - p->nFlopsMin = 5; // the min number of flops to recycle the SAT solver + p->nFlopsMin = 10; // the min number of flops to recycle the SAT solver p->fAreaOnly = 0; // derive clock-gating to minimize area p->fVerbose = 0; // verbosity flag } |