luke
/
abc
mirror of https://github.com/YosysHQ/abc.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Small changes to sort for timing.

This commit is contained in:
Alan Mishchenko 2016-01-24 15:32:12 -08:00
parent 9ef447658e
commit 951ca48b9c
2 changed files with 11 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
abclib.dsp
View File

@ -747,6 +747,10 @@ SOURCE=.\src\base\wlc\wlc.h
# End Source File
# Begin Source File
SOURCE=.\src\base\wlc\wlcAbc.c
# End Source File
# Begin Source File
SOURCE=.\src\base\wlc\wlcAbs.c
# End Source File
# Begin Source File

10
src/opt/sfm/sfmTim.c
View File

@ -336,13 +336,17 @@ void Sfm_TimUpdateTiming( Sfm_Tim_t * p, Vec_Int_t * vTimeNodes )
int Sfm_TimSortArrayByArrival( Sfm_Tim_t * p, Vec_Int_t * vNodes, int iPivot )
{
word Entry;
int i, Id, nDivNew = -1;
int MaxDelay = Sfm_TimArrMaxId(p, iPivot);
int i, Id, Time, nDivNew = -1;
int MaxDelay = ABC_INFINITY/2+Sfm_TimArrMaxId(p, iPivot);
assert( p->DeltaCrit > 0 );
// collect nodes
Vec_WrdClear( &p->vSortData );
Vec_IntForEachEntry( vNodes, Id, i )
Vec_WrdPush( &p->vSortData, ((word)Id << 32) | Sfm_TimArrMaxId(p, Id) );
{
Time = Sfm_TimArrMaxId( p, Id );
assert( -ABC_INFINITY/2 < Time && Time < ABC_INFINITY/2 );
Vec_WrdPush( &p->vSortData, ((word)Id << 32) | (ABC_INFINITY/2+Time) );
}
// sort nodes by delay
Abc_QuickSort3( Vec_WrdArray(&p->vSortData), Vec_WrdSize(&p->vSortData), 0 );
// collect sorted nodes and find place where divisors end