diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2014-04-11 09:17:34 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2014-04-11 09:17:34 -0700 |
| commit | b50894ab6469081cfc4684d19c02be74c248d2ca (patch) | |
| tree | 627600ab9b82fc61f23a0ac96bac94a81e9b093e /src/map/if/ifMap.c | |
| parent | b9274a07deec99f6b9e23d3bf481b2e5213c5e8f (diff) | |
| download | abc-b50894ab6469081cfc4684d19c02be74c248d2ca.tar.gz abc-b50894ab6469081cfc4684d19c02be74c248d2ca.tar.bz2 abc-b50894ab6469081cfc4684d19c02be74c248d2ca.zip | |
Removed obsolete code for sequential mapping.
Diffstat (limited to 'src/map/if/ifMap.c')
| -rw-r--r-- | src/map/if/ifMap.c | 17 |
1 files changed, 6 insertions, 11 deletions
diff --git a/src/map/if/ifMap.c b/src/map/if/ifMap.c index 95e9fccf..9452feb3 100644 --- a/src/map/if/ifMap.c +++ b/src/map/if/ifMap.c @@ -100,17 +100,14 @@ void If_ObjPerformMappingAnd( If_Man_t * p, If_Obj_t * pObj, int Mode, int fPrep int fFunc0R, fFunc1R; int i, k, v, fChange; int fSave0 = p->pPars->fDelayOpt || p->pPars->fDsdBalance || p->pPars->fUserRecLib; - assert( p->pPars->fSeqMap || !If_ObjIsAnd(pObj->pFanin0) || pObj->pFanin0->pCutSet->nCuts > 0 ); - assert( p->pPars->fSeqMap || !If_ObjIsAnd(pObj->pFanin1) || pObj->pFanin1->pCutSet->nCuts > 0 ); + assert( !If_ObjIsAnd(pObj->pFanin0) || pObj->pFanin0->pCutSet->nCuts > 0 ); + assert( !If_ObjIsAnd(pObj->pFanin1) || pObj->pFanin1->pCutSet->nCuts > 0 ); // prepare - if ( !p->pPars->fSeqMap ) - { - if ( Mode == 0 ) - pObj->EstRefs = (float)pObj->nRefs; - else if ( Mode == 1 ) - pObj->EstRefs = (float)((2.0 * pObj->EstRefs + pObj->nRefs) / 3.0); - } + if ( Mode == 0 ) + pObj->EstRefs = (float)pObj->nRefs; + else if ( Mode == 1 ) + pObj->EstRefs = (float)((2.0 * pObj->EstRefs + pObj->nRefs) / 3.0); // deref the selected cut if ( Mode && pObj->nRefs > 0 ) If_CutAreaDeref( p, If_ObjCutBest(pObj) ); @@ -376,7 +373,6 @@ void If_ObjPerformMappingChoice( If_Man_t * p, If_Obj_t * pObj, int Mode, int fP // go through the cuts of this node If_ObjForEachCut( pTemp, pCutTemp, i ) { - assert( p->pPars->fSeqMap || pCutTemp->nLeaves > 1 ); if ( pCutTemp->fUseless ) continue; // get the next free cut @@ -409,7 +405,6 @@ void If_ObjPerformMappingChoice( If_Man_t * p, If_Obj_t * pObj, int Mode, int fP // update the best cut if ( !fPreprocess || pCutSet->ppCuts[0]->Delay <= pObj->Required + p->fEpsilon ) If_CutCopy( p, If_ObjCutBest(pObj), pCutSet->ppCuts[0] ); - assert( p->pPars->fSeqMap || If_ObjCutBest(pObj)->nLeaves > 1 ); // add the trivial cut to the set if ( !pObj->fSkipCut && If_ObjCutBest(pObj)->nLeaves > 1 ) { |