Skip to content

A
abc
Commit cd0102f6 by Alan Mishchenko
Options

Improvements to the retiming algorithm.

parent 6fdfefaa
Showing with 7 additions and 1 deletions
src/base/wln/wlnRetime.c
...@@ -554,7 +554,7 @@ Vec_Int_t * Wln_NtkRetime( Wln_Ntk_t * pNtk, int fVerbose ) ...@@ -554,7 +554,7 @@ Vec_Int_t * Wln_NtkRetime( Wln_Ntk_t * pNtk, int fVerbose )
Vec_Int_t * vFront = &p->vFront; Vec_Int_t * vFront = &p->vFront;
Vec_Int_t * vMoves = Vec_IntAlloc(0); Vec_Int_t * vMoves = Vec_IntAlloc(0);
int nMoves = 0, fPrevFwd = 0, fPrevBwd = 0, nCountIncrease = 0; int nMoves = 0, fPrevFwd = 0, fPrevBwd = 0, nCountIncrease = 0;
int DelayInit = 0, DelayBest = 0; int DelayInit = 0, DelayBest = 0, nChange = 0;
Wln_RetPrint( p, fVerbose ); Wln_RetPrint( p, fVerbose );
Wln_RetMarkChanges( p, NULL ); Wln_RetMarkChanges( p, NULL );
p->DelayMax = DelayInit = DelayBest = Wln_RetPropDelay( p ); p->DelayMax = DelayInit = DelayBest = Wln_RetPropDelay( p );
...@@ -613,9 +613,15 @@ Vec_Int_t * Wln_NtkRetime( Wln_Ntk_t * pNtk, int fVerbose ) ...@@ -613,9 +613,15 @@ Vec_Int_t * Wln_NtkRetime( Wln_Ntk_t * pNtk, int fVerbose )
if ( p->DelayMax >= DelayMaxPrev ) if ( p->DelayMax >= DelayMaxPrev )
nCountIncrease++; nCountIncrease++;
else else
{
if ( nCountIncrease > 0 )
nChange++;
nCountIncrease = 0; nCountIncrease = 0;
}
if ( nCountIncrease > 3 ) if ( nCountIncrease > 3 )
break; break;
if ( nChange > 5 )
break;
Wln_RetFindSources( p ); Wln_RetFindSources( p );
if ( 2*Vec_IntSize(&p->vEdgeLinks) > Vec_IntCap(&p->vEdgeLinks) ) if ( 2*Vec_IntSize(&p->vEdgeLinks) > Vec_IntCap(&p->vEdgeLinks) )
Vec_IntGrow( &p->vEdgeLinks, 4*Vec_IntSize(&p->vEdgeLinks) ); Vec_IntGrow( &p->vEdgeLinks, 4*Vec_IntSize(&p->vEdgeLinks) );
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment