diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2016-04-23 15:13:22 +0300 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2016-04-23 15:13:22 +0300 |
| commit | 67bfb4ba09aa02870140290f669360c302d55eb7 (patch) | |
| tree | 122b1fa7f821c275687bf2fe036fcc48a5bb447c /src/base | |
| parent | 1b550cb87be41af5e0f2c0ce7805b9ab645d87cc (diff) | |
| download | abc-67bfb4ba09aa02870140290f669360c302d55eb7.tar.gz abc-67bfb4ba09aa02870140290f669360c302d55eb7.tar.bz2 abc-67bfb4ba09aa02870140290f669360c302d55eb7.zip | |
Improved algo for edge computation.
Diffstat (limited to 'src/base')
| -rw-r--r-- | src/base/abci/abc.c | 8 |
1 files changed, 2 insertions, 6 deletions
diff --git a/src/base/abci/abc.c b/src/base/abci/abc.c index 1676385a..96becd9d 100644 --- a/src/base/abci/abc.c +++ b/src/base/abci/abc.c @@ -34923,11 +34923,6 @@ int Abc_CommandAbc9Edge( Abc_Frame_t * pAbc, int argc, char ** argv ) Gia_ManConvertPackingToEdges( pAbc->pGia ); return 0; } - if ( DelayMax ) - { - Seg_ManComputeDelay( pAbc->pGia, DelayMax, nEdges==2, fVerbose ); - return 0; - } if ( !fUseOld ) { if ( pAbc->pGia->pManTime != NULL && Tim_ManBoxNum((Tim_Man_t*)pAbc->pGia->pManTime) ) @@ -34935,7 +34930,8 @@ int Abc_CommandAbc9Edge( Abc_Frame_t * pAbc, int argc, char ** argv ) printf( "Currently this version of the algorithm does not work for designs with boxes.\n" ); return 0; } - Edg_ManAssignEdgeNew( pAbc->pGia, nEdges, fVerbose ); + //Edg_ManAssignEdgeNew( pAbc->pGia, nEdges, fVerbose ); + Seg_ManComputeDelay( pAbc->pGia, DelayMax, nEdges==2, fVerbose ); return 0; } if ( pAbc->pGia->pManTime && fReverse ) |