diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2013-07-22 19:44:31 -0700 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2013-07-22 19:44:31 -0700 |
commit | 054caacb3c196efb1a76ce6aa1b9eb894e3eef53 (patch) | |
tree | 30c0b8beadf8e9c50302abcb0862966721d40c05 | |
parent | f392645daf3aa5615daf6121072e25941194d446 (diff) | |
download | abc-054caacb3c196efb1a76ce6aa1b9eb894e3eef53.tar.gz abc-054caacb3c196efb1a76ce6aa1b9eb894e3eef53.tar.bz2 abc-054caacb3c196efb1a76ce6aa1b9eb894e3eef53.zip |
Enabling pin sorting in &if.
-rw-r--r-- | src/aig/gia/giaIf.c | 3 |
1 files changed, 3 insertions, 0 deletions
diff --git a/src/aig/gia/giaIf.c b/src/aig/gia/giaIf.c index f3820ab4..278381cb 100644 --- a/src/aig/gia/giaIf.c +++ b/src/aig/gia/giaIf.c @@ -981,6 +981,9 @@ Gia_Man_t * Gia_ManFromIfLogic( If_Man_t * pIfMan ) if ( If_ObjIsAnd(pIfObj) ) { pCutBest = If_ObjCutBest( pIfObj ); + // perform sorting of cut leaves by delay, so that the slowest pin drives the fastest input of the LUT + if ( !pIfMan->pPars->fDelayOpt && !pIfMan->pPars->pLutStruct && !pIfMan->pPars->fUserRecLib && !pIfMan->pPars->nGateSize ) + If_CutRotatePins( pIfMan, pCutBest ); // collect leaves of the best cut Vec_IntClear( vLeaves ); If_CutForEachLeaf( pIfMan, pCutBest, pIfLeaf, k ) |