diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2020-09-21 09:00:30 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2020-09-21 09:00:30 -0700 |
| commit | 55a67a115cb3d008594377cacec478fe33db4aee (patch) | |
| tree | 71217d790e0ddcebb1a7f8b8eb8e55e4c49110f2 /src/aig | |
| parent | d9534252754a86a6bd79d4cf31600c38593bd2a2 (diff) | |
| download | abc-55a67a115cb3d008594377cacec478fe33db4aee.tar.gz abc-55a67a115cb3d008594377cacec478fe33db4aee.tar.bz2 abc-55a67a115cb3d008594377cacec478fe33db4aee.zip | |
Improvement to reconv-driven windowing.
Diffstat (limited to 'src/aig')
| -rw-r--r-- | src/aig/gia/giaResub2.c | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/src/aig/gia/giaResub2.c b/src/aig/gia/giaResub2.c index 468730fe..2c55e0cb 100644 --- a/src/aig/gia/giaResub2.c +++ b/src/aig/gia/giaResub2.c @@ -1099,7 +1099,8 @@ int Gia_RsbFindFaninToAddToCut( Gia_Man_t * p, Vec_Int_t * vIns ) } // find fanin with the highest count for ( i = 0; i < nFanins; i++ ) - if ( CountMax < pFaninCounts[i] ) +// if ( CountMax < pFaninCounts[i] ) + if ( CountMax < pFaninCounts[i] || (CountMax == pFaninCounts[i] && (Gia_ObjFanoutNumId(p, iFanMax) < Gia_ObjFanoutNumId(p, pFanins[i]))) ) { CountMax = pFaninCounts[i]; iFanMax = pFanins[i]; @@ -1322,7 +1323,7 @@ int Gia_ManVerifyTwoTruths( Gia_Man_t * p1, Gia_Man_t * p2 ) void Gia_RsbEnumerateWindows( Gia_Man_t * p, int nInputsMax, int nLevelsMax ) { int fVerbose = 0; - int fUseHash = 1; + int fUseHash = 0; int i, nWins = 0, nWinSize = 0, nInsSize = 0, nOutSize = 0, nNodeGain = 0; Vec_Wec_t * vLevels = Vec_WecStart( Gia_ManLevelNum(p)+1 ); Vec_Int_t * vPaths = Vec_IntStart( Gia_ManObjNum(p) ); |