diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2014-04-03 13:52:13 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2014-04-03 13:52:13 -0700 |
| commit | c1670d7444f040984fc0f4cca5d0c8c3bc5bb2e2 (patch) | |
| tree | cccac0b9df6fead718c85fde289c02ee853a7c0f /src/aig/gia/giaIf.c | |
| parent | 71e11a3eec43738aef8c06e625882db57d29f4c3 (diff) | |
| download | abc-c1670d7444f040984fc0f4cca5d0c8c3bc5bb2e2.tar.gz abc-c1670d7444f040984fc0f4cca5d0c8c3bc5bb2e2.tar.bz2 abc-c1670d7444f040984fc0f4cca5d0c8c3bc5bb2e2.zip | |
Improvements to technology mapping.
Diffstat (limited to 'src/aig/gia/giaIf.c')
| -rw-r--r-- | src/aig/gia/giaIf.c | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/src/aig/gia/giaIf.c b/src/aig/gia/giaIf.c index 1c9ecca5..2ca98785 100644 --- a/src/aig/gia/giaIf.c +++ b/src/aig/gia/giaIf.c @@ -1192,6 +1192,7 @@ int Gia_ManFromIfLogicFindLut( If_Man_t * pIfMan, Gia_Man_t * pNew, If_Cut_t * p } return RetValue; } + assert( If_DsdManSuppSize(pIfMan->pIfDsdMan, pCutBest->iCutDsd) == (int)pCutBest->nLeaves ); // find the bound set uSetOld = If_DsdManCheckXY( pIfMan->pIfDsdMan, pCutBest->iCutDsd, nLutSize, 1, 1, 0 ); // remap bound set @@ -1313,7 +1314,7 @@ Gia_Man_t * Gia_ManFromIfLogic( If_Man_t * pIfMan ) word * pTruth = If_CutTruthW(pIfMan, pCutBest); if ( pIfMan->pPars->fUseTtPerm ) for ( k = 0; k < (int)pCutBest->nLeaves; k++ ) - if ( (pCutBest->iCutDsd >> k) & 1 ) + if ( If_CutLeafBit(pCutBest, k) ) Abc_TtFlip( pTruth, Abc_TtWordNum(pCutBest->nLimit), k ); // perform decomposition of the cut pIfObj->iCopy = Gia_ManFromIfLogicNode( pIfMan, pNew, i, vLeaves, vLeaves2, pTruth, pIfMan->pPars->pLutStruct, vCover, vMapping, vMapping2, vPacking, (pIfMan->pPars->fEnableCheck75 || pIfMan->pPars->fEnableCheck75u), pIfMan->pPars->fEnableCheck07 ); |