diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2007-02-25 08:01:00 -0800 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2007-02-25 08:01:00 -0800 |
commit | 81fae91a95b8b51d7a10d3884df92dc89eb266bf (patch) | |
tree | 504f7581908335369a15d97653ba2bb3fec31d08 /src/map/if/ifReduce.c | |
parent | fb51057e4a36d2e5737bba8739b88140b55db7c7 (diff) | |
download | abc-81fae91a95b8b51d7a10d3884df92dc89eb266bf.tar.gz abc-81fae91a95b8b51d7a10d3884df92dc89eb266bf.tar.bz2 abc-81fae91a95b8b51d7a10d3884df92dc89eb266bf.zip |
Version abc70225
Diffstat (limited to 'src/map/if/ifReduce.c')
-rw-r--r-- | src/map/if/ifReduce.c | 16 |
1 files changed, 6 insertions, 10 deletions
diff --git a/src/map/if/ifReduce.c b/src/map/if/ifReduce.c index 26989b8c..1b23b883 100644 --- a/src/map/if/ifReduce.c +++ b/src/map/if/ifReduce.c @@ -52,11 +52,11 @@ void If_ManImproveMapping( If_Man_t * p ) clk = clock(); If_ManImproveExpand( p, p->pPars->nLutSize ); - If_ManComputeRequired( p, 0 ); + If_ManComputeRequired( p ); if ( p->pPars->fVerbose ) { - printf( "E: Del = %6.2f. Area = %8.2f. Nets = %6d. Cuts = %8d. Lim = %2d. Ave = %5.2f. ", - p->RequiredGlo, p->AreaGlo, p->nNets, p->nCutsMerged, p->nCutsUsed, 1.0 * p->nCutsMerged / If_ManAndNum(p) ); + printf( "E: Del = %6.2f. Ar = %8.2f. Net = %6d. Cut = %8d. ", + p->RequiredGlo, p->AreaGlo, p->nNets, p->nCutsMerged ); PRT( "T", clock() - clk ); } @@ -488,6 +488,7 @@ void If_ManImproveNodeFaninCompact( If_Man_t * p, If_Obj_t * pObj, int nLimit, V ***********************************************************************/ void If_ManImproveNodeReduce( If_Man_t * p, If_Obj_t * pObj, int nLimit ) { +/* If_Cut_t * pCut, * pCut0, * pCut1, * pCutR; If_Obj_t * pFanin0, * pFanin1; float AreaBef, AreaAft; @@ -537,13 +538,14 @@ void If_ManImproveNodeReduce( If_Man_t * p, If_Obj_t * pObj, int nLimit ) AreaAft = If_CutAreaDerefed( p, pCutR, IF_INFINITY ); // update the best cut if ( AreaAft < AreaBef - p->fEpsilon && pCutR->Delay < pObj->Required + p->fEpsilon ) - If_CutCopy( pCut, pCutR ); + If_CutCopy( p, pCut, pCutR ); } // recompute the delay of the best cut pCut->Delay = If_CutDelay( p, pCut ); // ref the cut if the node is refed if ( pObj->nRefs > 0 ) If_CutRef( p, pCut, IF_INFINITY ); +*/ } /**Function************************************************************* @@ -562,13 +564,7 @@ void If_ManImproveReduce( If_Man_t * p, int nLimit ) If_Obj_t * pObj; int i; If_ManForEachNode( p, pObj, i ) - { - if ( 278 == i ) - { - int s = 0; - } If_ManImproveNodeReduce( p, pObj, nLimit ); - } } //////////////////////////////////////////////////////////////////////// |