diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2013-09-02 22:10:27 -0700 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2013-09-02 22:10:27 -0700 |
commit | e16e3edae8f6f73f4e32776423b784e78a1d042e (patch) | |
tree | b67420832d874f704ec36e6b49d360fa74a6ae8a /src/map/if | |
parent | fabc84d15b5aabb28f3f7670369b005f4cec57a6 (diff) | |
download | abc-e16e3edae8f6f73f4e32776423b784e78a1d042e.tar.gz abc-e16e3edae8f6f73f4e32776423b784e78a1d042e.tar.bz2 abc-e16e3edae8f6f73f4e32776423b784e78a1d042e.zip |
Removing some old useless code.
Diffstat (limited to 'src/map/if')
-rw-r--r-- | src/map/if/if.h | 3 | ||||
-rw-r--r-- | src/map/if/ifTime.c | 28 |
2 files changed, 15 insertions, 16 deletions
diff --git a/src/map/if/if.h b/src/map/if/if.h index be6232ec..6525a4d6 100644 --- a/src/map/if/if.h +++ b/src/map/if/if.h @@ -119,7 +119,6 @@ struct If_Par_t_ int fEnableCheck10;// enable additional checking int fEnableCheck75;// enable additional checking int fEnableCheck75u;// enable additional checking - int fEnableRealPos;// enable additional feature int fUseDsd; // compute DSD of the cut functions int fDeriveLuts; // enables deriving LUT structures int fVerbose; // the verbosity flag @@ -193,7 +192,7 @@ struct If_Man_t_ int fNextRound; // set to 1 after the first round int nChoices; // the number of choice nodes Vec_Int_t * vSwitching; // switching activity of each node - Vec_Int_t ** pDriverCuts; // temporary driver cuts +// Vec_Int_t ** pDriverCuts; // temporary driver cuts int pPerm[3][IF_MAX_LUTSIZE]; // permutations unsigned uSharedMask; // mask of shared variables int nShared; // the number of shared variables diff --git a/src/map/if/ifTime.c b/src/map/if/ifTime.c index ca11b6fc..ff7c377d 100644 --- a/src/map/if/ifTime.c +++ b/src/map/if/ifTime.c @@ -630,7 +630,7 @@ float If_CutDelay( If_Man_t * p, If_Obj_t * pObj, If_Cut_t * pCut ) If_Obj_t * pLeaf; float Delay, DelayCur; float * pLutDelays; - int i, Shift, Pin2PinDelay, iLeaf; + int i, Shift, Pin2PinDelay;//, iLeaf; assert( p->pPars->fSeqMap || pCut->nLeaves > 1 ); Delay = -IF_FLOAT_LARGE; if ( p->pPars->pLutLib ) @@ -651,9 +651,9 @@ float If_CutDelay( If_Man_t * p, If_Obj_t * pObj, If_Cut_t * pCut ) { If_CutForEachLeaf( p, pCut, pLeaf, i ) { - if ( p->pDriverCuts && p->pDriverCuts[pObj->Id] && (iLeaf = Vec_IntFind(p->pDriverCuts[pObj->Id], pLeaf->Id)) >= 0 ) - DelayCur = If_ObjCutBest(pLeaf)->Delay + s_ExtraDel[pObj->fDriver][iLeaf]; - else +// if ( p->pDriverCuts && p->pDriverCuts[pObj->Id] && (iLeaf = Vec_IntFind(p->pDriverCuts[pObj->Id], pLeaf->Id)) >= 0 ) +// DelayCur = If_ObjCutBest(pLeaf)->Delay + s_ExtraDel[pObj->fDriver][iLeaf]; +// else DelayCur = If_ObjCutBest(pLeaf)->Delay + pLutDelays[0]; Delay = IF_MAX( Delay, DelayCur ); } @@ -685,9 +685,9 @@ float If_CutDelay( If_Man_t * p, If_Obj_t * pObj, If_Cut_t * pCut ) { If_CutForEachLeaf( p, pCut, pLeaf, i ) { - if ( p->pDriverCuts && p->pDriverCuts[pObj->Id] && (iLeaf = Vec_IntFind(p->pDriverCuts[pObj->Id], pLeaf->Id)) >= 0 ) - DelayCur = If_ObjCutBest(pLeaf)->Delay + ((pObj->fDriver && iLeaf == 2) ? 0.0 : 1.0); - else +// if ( p->pDriverCuts && p->pDriverCuts[pObj->Id] && (iLeaf = Vec_IntFind(p->pDriverCuts[pObj->Id], pLeaf->Id)) >= 0 ) +// DelayCur = If_ObjCutBest(pLeaf)->Delay + ((pObj->fDriver && iLeaf == 2) ? 0.0 : 1.0); +// else DelayCur = If_ObjCutBest(pLeaf)->Delay + 1.0; Delay = IF_MAX( Delay, DelayCur ); } @@ -715,7 +715,7 @@ void If_CutPropagateRequired( If_Man_t * p, If_Obj_t * pObj, If_Cut_t * pCut, fl If_Obj_t * pLeaf; float * pLutDelays; float Required; - int i, Pin2PinDelay, iLeaf; + int i, Pin2PinDelay;//, iLeaf; assert( !p->pPars->fLiftLeaves ); // compute the pins if ( p->pPars->pLutLib ) @@ -737,9 +737,9 @@ void If_CutPropagateRequired( If_Man_t * p, If_Obj_t * pObj, If_Cut_t * pCut, fl Required = ObjRequired; If_CutForEachLeaf( p, pCut, pLeaf, i ) { - if ( p->pDriverCuts && p->pDriverCuts[pObj->Id] && (iLeaf = Vec_IntFind(p->pDriverCuts[pObj->Id], pLeaf->Id)) >= 0 ) - pLeaf->Required = IF_MIN( pLeaf->Required, Required - s_ExtraDel[pObj->fDriver][iLeaf] ); - else +// if ( p->pDriverCuts && p->pDriverCuts[pObj->Id] && (iLeaf = Vec_IntFind(p->pDriverCuts[pObj->Id], pLeaf->Id)) >= 0 ) +// pLeaf->Required = IF_MIN( pLeaf->Required, Required - s_ExtraDel[pObj->fDriver][iLeaf] ); +// else pLeaf->Required = IF_MIN( pLeaf->Required, Required - pLutDelays[0] ); } } @@ -760,9 +760,9 @@ void If_CutPropagateRequired( If_Man_t * p, If_Obj_t * pObj, If_Cut_t * pCut, fl Required = ObjRequired; If_CutForEachLeaf( p, pCut, pLeaf, i ) { - if ( p->pDriverCuts && p->pDriverCuts[pObj->Id] && (iLeaf = Vec_IntFind(p->pDriverCuts[pObj->Id], pLeaf->Id)) >= 0 ) - pLeaf->Required = IF_MIN( pLeaf->Required, Required - (float)((pObj->fDriver && iLeaf == 2) ? 0.0 : 1.0) ); - else +// if ( p->pDriverCuts && p->pDriverCuts[pObj->Id] && (iLeaf = Vec_IntFind(p->pDriverCuts[pObj->Id], pLeaf->Id)) >= 0 ) +// pLeaf->Required = IF_MIN( pLeaf->Required, Required - (float)((pObj->fDriver && iLeaf == 2) ? 0.0 : 1.0) ); +// else pLeaf->Required = IF_MIN( pLeaf->Required, Required - (float)1.0 ); } } |