diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2005-12-03 08:01:00 -0800 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2005-12-03 08:01:00 -0800 |
| commit | a6086f088105786ac8425b065fefd0aed4eb3e87 (patch) | |
| tree | 0157c687a38a0e0729bf5ffa0ddcfcdfabf8a30a /src/base/seq/seqAigIter.c | |
| parent | 53c4fffa04d471827119bdebd7ab0426f1c4555a (diff) | |
| download | abc-a6086f088105786ac8425b065fefd0aed4eb3e87.tar.gz abc-a6086f088105786ac8425b065fefd0aed4eb3e87.tar.bz2 abc-a6086f088105786ac8425b065fefd0aed4eb3e87.zip | |
Version abc51203
Diffstat (limited to 'src/base/seq/seqAigIter.c')
| -rw-r--r-- | src/base/seq/seqAigIter.c | 11 |
1 files changed, 6 insertions, 5 deletions
diff --git a/src/base/seq/seqAigIter.c b/src/base/seq/seqAigIter.c index 683c0093..392638b8 100644 --- a/src/base/seq/seqAigIter.c +++ b/src/base/seq/seqAigIter.c @@ -48,7 +48,7 @@ int Seq_AigRetimeDelayLags( Abc_Ntk_t * pNtk, int fVerbose ) { Abc_Seq_t * p = pNtk->pManFunc; Abc_Obj_t * pNode; - int i, FiMax, FiBest, RetValue, clk, clkIter; + int i, FiMax, RetValue, clk, clkIter; char NodeLag; assert( Abc_NtkIsSeq( pNtk ) ); @@ -68,11 +68,11 @@ int Seq_AigRetimeDelayLags( Abc_Ntk_t * pNtk, int fVerbose ) // search for the optimal clock period between 0 and nLevelMax clk = clock(); - FiBest = Seq_RetimeSearch_rec( pNtk, 0, FiMax, fVerbose ); + p->FiBestInt = Seq_RetimeSearch_rec( pNtk, 0, FiMax, fVerbose ); clkIter = clock() - clk; // recompute the best l-values - RetValue = Seq_RetimeForPeriod( pNtk, FiBest, fVerbose ); + RetValue = Seq_RetimeForPeriod( pNtk, p->FiBestInt, fVerbose ); assert( RetValue ); // fix the problem with non-converged delays @@ -84,13 +84,14 @@ clkIter = clock() - clk; Vec_StrFill( p->vLags, p->nSize, 0 ); Abc_AigForEachAnd( pNtk, pNode, i ) { - NodeLag = Seq_NodeComputeLag( Seq_NodeGetLValue(pNode), FiBest ); + NodeLag = Seq_NodeComputeLag( Seq_NodeGetLValue(pNode), p->FiBestInt ); Seq_NodeSetLag( pNode, NodeLag ); } // print the result if ( fVerbose ) - printf( "The best clock period is %3d.\n", FiBest ); + printf( "The best clock period is %3d.\n", p->FiBestInt ); + /* printf( "lvalues and lags : " ); Abc_AigForEachAnd( pNtk, pNode, i ) |