diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2015-11-11 23:12:05 -0800 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2015-11-11 23:12:05 -0800 |
commit | f7c969ca66649627281510b8c63d867288faafd7 (patch) | |
tree | a0a1d8ae7f60272378cf9c83b4c7b2c46cac7530 /src | |
parent | 71847b9d17c5b64ddc7abd4ff85f5637e2fe4a15 (diff) | |
download | abc-f7c969ca66649627281510b8c63d867288faafd7.tar.gz abc-f7c969ca66649627281510b8c63d867288faafd7.tar.bz2 abc-f7c969ca66649627281510b8c63d867288faafd7.zip |
Improvements to timing optimization.
Diffstat (limited to 'src')
-rw-r--r-- | src/base/abc/abc.h | 1 | ||||
-rw-r--r-- | src/base/abc/abcFanio.c | 28 | ||||
-rw-r--r-- | src/map/scl/scl.c | 2 | ||||
-rw-r--r-- | src/map/scl/sclCon.h | 8 | ||||
-rw-r--r-- | src/map/scl/sclLib.h | 8 | ||||
-rw-r--r-- | src/map/scl/sclLibScl.c | 4 | ||||
-rw-r--r-- | src/opt/sfm/sfmDec.c | 88 | ||||
-rw-r--r-- | src/opt/sfm/sfmInt.h | 2 | ||||
-rw-r--r-- | src/opt/sfm/sfmMit.c | 2 |
9 files changed, 104 insertions, 39 deletions
diff --git a/src/base/abc/abc.h b/src/base/abc/abc.h index 09d12e0b..23da283d 100644 --- a/src/base/abc/abc.h +++ b/src/base/abc/abc.h @@ -646,6 +646,7 @@ extern ABC_DLL void Abc_ObjAddFanin( Abc_Obj_t * pObj, Abc_Obj_t * extern ABC_DLL void Abc_ObjDeleteFanin( Abc_Obj_t * pObj, Abc_Obj_t * pFanin ); extern ABC_DLL void Abc_ObjRemoveFanins( Abc_Obj_t * pObj ); extern ABC_DLL void Abc_ObjPatchFanin( Abc_Obj_t * pObj, Abc_Obj_t * pFaninOld, Abc_Obj_t * pFaninNew ); +extern ABC_DLL void Abc_ObjPatchFanoutFanin( Abc_Obj_t * pObj, int iObjNew ); extern ABC_DLL Abc_Obj_t * Abc_ObjInsertBetween( Abc_Obj_t * pNodeIn, Abc_Obj_t * pNodeOut, Abc_ObjType_t Type ); extern ABC_DLL void Abc_ObjTransferFanout( Abc_Obj_t * pObjOld, Abc_Obj_t * pObjNew ); extern ABC_DLL void Abc_ObjReplace( Abc_Obj_t * pObjOld, Abc_Obj_t * pObjNew ); diff --git a/src/base/abc/abcFanio.c b/src/base/abc/abcFanio.c index d7998780..caa57a4e 100644 --- a/src/base/abc/abcFanio.c +++ b/src/base/abc/abcFanio.c @@ -211,6 +211,34 @@ void Abc_ObjPatchFanin( Abc_Obj_t * pObj, Abc_Obj_t * pFaninOld, Abc_Obj_t * pFa /**Function************************************************************* + Synopsis [Replaces pObj by iObjNew in the fanin arrays of the fanouts.] + + Description [] + + SideEffects [] + + SeeAlso [] + +***********************************************************************/ +void Abc_ObjPatchFanoutFanin( Abc_Obj_t * pObj, int iObjNew ) +{ + Abc_Obj_t * pFanout; + int i, k, Entry; + // update fanouts of the node to point to this one + Abc_ObjForEachFanout( pObj, pFanout, i ) + { + Vec_IntForEachEntry( &pFanout->vFanins, Entry, k ) + if ( Entry == (int)Abc_ObjId(pObj) ) + { + Vec_IntWriteEntry( &pFanout->vFanins, k, iObjNew ); + break; + } + assert( k < Vec_IntSize(&pFanout->vFanins) ); + } +} + +/**Function************************************************************* + Synopsis [Inserts one-input node of the type specified between the nodes.] Description [] diff --git a/src/map/scl/scl.c b/src/map/scl/scl.c index 24c45b6e..83eaa9f4 100644 --- a/src/map/scl/scl.c +++ b/src/map/scl/scl.c @@ -753,7 +753,7 @@ int Scl_CommandStime( Abc_Frame_t * pAbc, int argc, char **argv ) { int c; int fShowAll = 0; - int fUseWireLoads = 1; + int fUseWireLoads = 0; int fPrintPath = 0; int fDumpStats = 0; int nTreeCRatio = 0; diff --git a/src/map/scl/sclCon.h b/src/map/scl/sclCon.h index fd6ae273..ec911963 100644 --- a/src/map/scl/sclCon.h +++ b/src/map/scl/sclCon.h @@ -38,7 +38,8 @@ struct Scl_Con_t_ word tInLoadDef; // default input load word tOutReqDef; // default output required time word tOutLoadDef; // default output load - Vec_Ptr_t vInCells; // input driving gates + Vec_Ptr_t vInCells; // input driving gate names + Vec_Ptr_t vInCellsPtr; // input driving gates Vec_Wrd_t vInArrs; // input arrival times Vec_Wrd_t vInSlews; // input slews Vec_Wrd_t vInLoads; // input loads @@ -58,8 +59,8 @@ struct Scl_Con_t_ #define SCL_DIRECTIVE(ITEM) "."ITEM #define SCL_DEF_DIRECTIVE(ITEM) ".default_"ITEM -#define SCL_NUM 1000000 -#define SCL_NUMINV 0.000001 +#define SCL_NUM 1000 +#define SCL_NUMINV 0.001 #define SCL_INFINITY (~(word)0) static inline word Scl_Flt2Wrd( float w ) { return SCL_NUM*w; } @@ -103,6 +104,7 @@ static inline Scl_Con_t * Scl_ConAlloc( char * pFileName, Abc_Nam_t * pNamI, Abc } static inline void Scl_ConFree( Scl_Con_t * p ) { + Vec_PtrErase( &p->vInCellsPtr ); Vec_PtrFreeData( &p->vInCells ); Vec_PtrErase( &p->vInCells ); Vec_WrdErase( &p->vInArrs ); diff --git a/src/map/scl/sclLib.h b/src/map/scl/sclLib.h index 25e60a41..b54a726c 100644 --- a/src/map/scl/sclLib.h +++ b/src/map/scl/sclLib.h @@ -180,8 +180,8 @@ struct SC_Pin_ float cap; // -- this value is used if 'rise_cap' and 'fall_cap' is missing (copied by 'postProcess()'). (not used) float rise_cap; // }- used for input pins ('cap' too). float fall_cap; // } - float rise_capI; // }- used for input pins ('cap' too). - float fall_capI; // } + int rise_capI; // }- used for input pins ('cap' too). + int fall_capI; // } float max_out_cap; // } (not used) float max_out_slew; // }- used only for output pins (max values must not be exceeded or else mapping is illegal) (not used) char * func_text; // } @@ -199,8 +199,8 @@ struct SC_Cell_ int unsupp; // -- set to TRUE by parser if cell contains information we cannot handle float area; float leakage; - float areaI; - float leakageI; + int areaI; + int leakageI; int drive_strength; // -- some library files provide this field (currently unused, but may be a good hint for sizing) (not used) Vec_Ptr_t vPins; // NamedSet<SC_Pin> int n_inputs; // -- 'pins[0 .. n_inputs-1]' are input pins diff --git a/src/map/scl/sclLibScl.c b/src/map/scl/sclLibScl.c index 59f8cbc6..f3a1b0ed 100644 --- a/src/map/scl/sclLibScl.c +++ b/src/map/scl/sclLibScl.c @@ -173,8 +173,8 @@ static int Abc_SclReadLibrary( Vec_Str_t * vOut, int * pPos, SC_Lib * p ) pPin->rise_cap = Vec_StrGetF(vOut, pPos); pPin->fall_cap = Vec_StrGetF(vOut, pPos); - pPin->rise_capI = (int)(MIO_NUM*pPin->rise_capI); - pPin->fall_capI = (int)(MIO_NUM*pPin->fall_capI); + pPin->rise_capI = (int)(MIO_NUM*pPin->rise_cap); + pPin->fall_capI = (int)(MIO_NUM*pPin->fall_cap); } for ( j = 0; j < pCell->n_outputs; j++ ) diff --git a/src/opt/sfm/sfmDec.c b/src/opt/sfm/sfmDec.c index c6da5429..f228222e 100644 --- a/src/opt/sfm/sfmDec.c +++ b/src/opt/sfm/sfmDec.c @@ -93,6 +93,7 @@ struct Sfm_Dec_t_ // temporary Vec_Int_t vTemp; Vec_Int_t vTemp2; + Vec_Int_t vTemp3; Vec_Int_t vCands; word Copy[4]; int nSuppVars; @@ -103,6 +104,7 @@ struct Sfm_Dec_t_ abctime timeSat; abctime timeSatSat; abctime timeSatUnsat; + abctime timeEval; abctime timeTime; abctime timeOther; abctime timeStart; @@ -146,6 +148,9 @@ static inline word Sfm_DecObjSim2( Sfm_Dec_t * p, Abc_Obj_t * pObj ) { r static inline word * Sfm_DecDivPats( Sfm_Dec_t * p, int d, int c ) { return Vec_WrdEntryP(&p->vSets[c], d*SFM_SIM_WORDS); } static inline int Sfm_ManReadObjDelay( Sfm_Dec_t * p, int Id ) { return p->pMit ? Sfm_MitReadObjDelay(p->pMit, Id) : Sfm_TimReadObjDelay(p->pTim, Id); } +static inline int Sfm_ManReadNtkDelay( Sfm_Dec_t * p ) { return p->pMit ? Sfm_MitReadNtkDelay(p->pMit) : Sfm_TimReadNtkDelay(p->pTim); } + + //////////////////////////////////////////////////////////////////////// /// FUNCTION DEFINITIONS /// @@ -216,7 +221,7 @@ p->timeLib = Abc_Clock() - p->timeLib; { if ( Abc_FrameReadLibScl() ) p->pMit = Sfm_MitStart( pLib, (SC_Lib *)Abc_FrameReadLibScl(), Scl_ConReadMan(), pNtk, p->DeltaCrit ); - else + if ( p->pMit == NULL ) p->pTim = Sfm_TimStart( pLib, Scl_ConReadMan(), pNtk, p->DeltaCrit ); } if ( pPars->fVeryVerbose ) @@ -277,6 +282,7 @@ void Sfm_DecStop( Sfm_Dec_t * p ) // temporary Vec_IntErase( &p->vTemp ); Vec_IntErase( &p->vTemp2 ); + Vec_IntErase( &p->vTemp3 ); Vec_IntErase( &p->vCands ); ABC_FREE( p ); pNtk->pData = NULL; @@ -704,6 +710,8 @@ int Sfm_DecMffcAreaReal( Abc_Obj_t * pPivot, Vec_Int_t * vCut, Vec_Int_t * vMffc Abc_Obj_t * pObj; int i, Area1, Area2; assert( Abc_ObjIsNode(pPivot) ); + if ( vMffc ) + Vec_IntClear( vMffc ); Abc_NtkForEachObjVec( vCut, pNtk, pObj, i ) pObj->vFanouts.nSize++; Area1 = Sfm_MffcDeref_rec( pPivot ); @@ -1194,7 +1202,7 @@ int Sfm_DecPeformDec3( Sfm_Dec_t * p, Abc_Obj_t * pObj ) int nSupp[SFM_DEC_MAX], pAssump[SFM_WIN_MAX]; int fVeryVerbose = p->pPars->fPrintDecs || p->pPars->fVeryVerbose; int nDecs = Abc_MaxInt(p->pPars->nDecMax, 1); - int i, k, DelayOrig = 0, DelayMin, nMatches, iBest = -1, RetValue, Prev = 0; + int i, k, DelayOrig = 0, DelayMin, GainMax, nMatches, iBest = -1, RetValue, Prev = 0; Mio_Gate_t * pGate1Best = NULL, * pGate2Best = NULL; char * pFans1Best = NULL, * pFans2Best = NULL; assert( p->pPars->fArea == 0 ); @@ -1208,6 +1216,7 @@ int Sfm_DecPeformDec3( Sfm_Dec_t * p, Abc_Obj_t * pObj ) Vec_IntClear( &p->vObjDec ); for ( i = 0; i < nDecs; i++ ) { + GainMax = 0; DelayMin = DelayOrig = Sfm_ManReadObjDelay( p, Abc_ObjId(pObj) ); // reduce the variable array if ( Vec_IntSize(&p->vObjDec) > Prev ) @@ -1227,7 +1236,13 @@ int Sfm_DecPeformDec3( Sfm_Dec_t * p, Abc_Obj_t * pObj ) printf( "Dec %d: Pat0 = %2d Pat1 = %2d Supp = %d ", i, p->nPats[0], p->nPats[1], nSupp[i] ); if ( fVeryVerbose ) Dau_DsdPrintFromTruth( uTruth[i], nSupp[i] ); - if ( nSupp[i] == 1 && uTruth[i][0] == ABC_CONST(0x5555555555555555) && DelayMin <= p->DelayInv + Sfm_ManReadObjDelay(p, Vec_IntEntry(&p->vObjMap, pSupp[i][0])) ) + if ( p->pTim && nSupp[i] == 1 && uTruth[i][0] == ABC_CONST(0x5555555555555555) && DelayMin <= p->DelayInv + Sfm_ManReadObjDelay(p, Vec_IntEntry(&p->vObjMap, pSupp[i][0])) ) + { + if ( fVeryVerbose ) + printf( "Dec %d: Pat0 = %2d Pat1 = %2d NO DEC.\n", i, p->nPats[0], p->nPats[1] ); + continue; + } + if ( p->pMit && nSupp[i] == 1 && uTruth[i][0] == ABC_CONST(0x5555555555555555) ) { if ( fVeryVerbose ) printf( "Dec %d: Pat0 = %2d Pat1 = %2d NO DEC.\n", i, p->nPats[0], p->nPats[1] ); @@ -1248,8 +1263,8 @@ int Sfm_DecPeformDec3( Sfm_Dec_t * p, Abc_Obj_t * pObj ) // get MFFC if ( p->pMit ) { - Sfm_DecPrepareVec( &p->vObjMap, pSupp[i], nSupp[i], &p->vTemp ); - Sfm_DecMffcAreaReal(pObj, &p->vTemp, &p->vTemp2 ); + Sfm_DecPrepareVec( &p->vObjMap, pSupp[i], nSupp[i], &p->vTemp ); // returns cut in p->vTemp + Sfm_DecMffcAreaReal(pObj, &p->vTemp, &p->vTemp3 ); // returns MFFC in p->vTemp3 } // try the delay @@ -1258,19 +1273,21 @@ int Sfm_DecPeformDec3( Sfm_Dec_t * p, Abc_Obj_t * pObj ) nMatches = Sfm_LibFindDelayMatches( p->pLib, uTruth[i], pSupp[i], nSupp[i], &p->vMatchGates, &p->vMatchFans ); for ( k = 0; k < nMatches; k++ ) { + abctime clk = Abc_Clock(); Mio_Gate_t * pGate1 = (Mio_Gate_t *)Vec_PtrEntry( &p->vMatchGates, 2*k+0 ); Mio_Gate_t * pGate2 = (Mio_Gate_t *)Vec_PtrEntry( &p->vMatchGates, 2*k+1 ); char * pFans1 = (char *)Vec_PtrEntry( &p->vMatchFans, 2*k+0 ); char * pFans2 = (char *)Vec_PtrEntry( &p->vMatchFans, 2*k+1 ); Vec_Int_t vFanins = { nSupp[i], nSupp[i], pSupp[i] }; - int Delay; + // skip identical gate + //if ( pGate2 == NULL && pGate1 == (Mio_Gate_t *)pObj->pData ) + // continue; if ( p->pMit ) { - DelayMin = 0; - Delay = Sfm_MitEvalRemapping( p->pMit, &p->vTemp2, pObj, &vFanins, &p->vObjMap, pGate1, pFans1, pGate2, pFans2 ); - if ( DelayMin < Delay ) + int Gain = Sfm_MitEvalRemapping( p->pMit, &p->vTemp3, pObj, &vFanins, &p->vObjMap, pGate1, pFans1, pGate2, pFans2 ); + if ( GainMax < Gain ) { - DelayMin = Delay; + GainMax = Gain; pGate1Best = pGate1; pGate2Best = pGate2; pFans1Best = pFans1; @@ -1280,7 +1297,7 @@ int Sfm_DecPeformDec3( Sfm_Dec_t * p, Abc_Obj_t * pObj ) } else { - Delay = Sfm_TimEvalRemapping( p->pTim, &vFanins, &p->vObjMap, pGate1, pFans1, pGate2, pFans2 ); + int Delay = Sfm_TimEvalRemapping( p->pTim, &vFanins, &p->vObjMap, pGate1, pFans1, pGate2, pFans2 ); if ( DelayMin > Delay ) { DelayMin = Delay; @@ -1291,8 +1308,10 @@ int Sfm_DecPeformDec3( Sfm_Dec_t * p, Abc_Obj_t * pObj ) iBest = i; } } + p->timeEval += Abc_Clock() - clk; } } +//printf( "Gain max = %d.\n", GainMax ); Sfm_ObjSetdownSimInfo( pObj ); if ( iBest == -1 ) { @@ -1670,7 +1689,7 @@ printf( "\n" ); */ return nDivs; } -Abc_Obj_t * Sfm_DecInsert( Abc_Ntk_t * pNtk, Abc_Obj_t * pPivot, int Limit, Vec_Int_t * vGates, Vec_Wec_t * vFanins, Vec_Int_t * vMap, Vec_Ptr_t * vGateHandles, int GateBuf, int GateInv, Vec_Wrd_t * vFuncs, Vec_Int_t * vTimeNodes ) +Abc_Obj_t * Sfm_DecInsert( Abc_Ntk_t * pNtk, Abc_Obj_t * pPivot, int Limit, Vec_Int_t * vGates, Vec_Wec_t * vFanins, Vec_Int_t * vMap, Vec_Ptr_t * vGateHandles, int GateBuf, int GateInv, Vec_Wrd_t * vFuncs, Vec_Int_t * vTimeNodes, Sfm_Mit_t * pMit ) { Abc_Obj_t * pObjNew = NULL; Vec_Int_t * vLevel; @@ -1687,6 +1706,10 @@ Abc_Obj_t * Sfm_DecInsert( Abc_Ntk_t * pNtk, Abc_Obj_t * pPivot, int Limit, Vec_ { iObj = Vec_WecEntryEntry( vFanins, Limit, 0 ); pObjNew = Abc_NtkObj( pNtk, Vec_IntEntry(vMap, iObj) ); + // transfer load + if ( pMit ) + Sfm_MitTransferLoad( pMit, pObjNew, pPivot ); + // replace logic cone Abc_ObjReplace( pPivot, pObjNew ); // update level pObjNew->Level = 0; @@ -1743,6 +1766,13 @@ Abc_Obj_t * Sfm_DecInsert( Abc_Ntk_t * pNtk, Abc_Obj_t * pPivot, int Limit, Vec_ if ( vTimeNodes ) Vec_IntPush( vTimeNodes, Abc_ObjId(pObjNew) ); } + // transfer load + if ( pMit ) + { + Sfm_MitTimingGrow( pMit ); + Sfm_MitTransferLoad( pMit, pObjNew, pPivot ); + } + // replace logic cone Abc_ObjReplace( pPivot, pObjNew ); // update level Abc_NtkForEachObjVecStart( vMap, pNtk, pObjNew, i, Limit ) @@ -1760,15 +1790,16 @@ void Sfm_DecPrintStats( Sfm_Dec_t * p ) p->timeTotal = Abc_Clock() - p->timeStart; p->timeOther = p->timeTotal - p->timeLib - p->timeWin - p->timeCnf - p->timeSat - p->timeTime; - ABC_PRTP( "Lib ", p->timeLib , p->timeTotal ); - ABC_PRTP( "Win ", p->timeWin , p->timeTotal ); - ABC_PRTP( "Cnf ", p->timeCnf , p->timeTotal ); - ABC_PRTP( "Sat ", p->timeSat , p->timeTotal ); - ABC_PRTP( " Sat ", p->timeSatSat, p->timeTotal ); - ABC_PRTP( " Unsat", p->timeSatUnsat, p->timeTotal ); - ABC_PRTP( "Timing", p->timeTime , p->timeTotal ); - ABC_PRTP( "Other ", p->timeOther, p->timeTotal ); - ABC_PRTP( "ALL ", p->timeTotal, p->timeTotal ); + ABC_PRTP( "Lib ", p->timeLib , p->timeTotal ); + ABC_PRTP( "Win ", p->timeWin , p->timeTotal ); + ABC_PRTP( "Cnf ", p->timeCnf , p->timeTotal ); + ABC_PRTP( "Sat ", p->timeSat-p->timeEval, p->timeTotal ); + ABC_PRTP( " Sat ", p->timeSatSat, p->timeTotal ); + ABC_PRTP( " Unsat", p->timeSatUnsat, p->timeTotal ); + ABC_PRTP( "Eval ", p->timeEval , p->timeTotal ); + ABC_PRTP( "Timing", p->timeTime , p->timeTotal ); + ABC_PRTP( "Other ", p->timeOther, p->timeTotal ); + ABC_PRTP( "ALL ", p->timeTotal, p->timeTotal ); printf( "Cone sizes: " ); for ( i = 0; i <= SFM_SUPP_MAX; i++ ) @@ -1883,7 +1914,7 @@ p->timeSat += Abc_Clock() - clk; return NULL; p->nNodesChanged++; Abc_NtkCountStats( p, Limit ); - return Sfm_DecInsert( pNtk, pObj, Limit, &p->vObjGates, &p->vObjFanins, &p->vObjMap, &p->vGateHands, p->GateBuffer, p->GateInvert, &p->vGateFuncs, NULL ); + return Sfm_DecInsert( pNtk, pObj, Limit, &p->vObjGates, &p->vObjFanins, &p->vObjMap, &p->vGateHands, p->GateBuffer, p->GateInvert, &p->vGateFuncs, NULL, p->pMit ); } void Abc_NtkAreaOpt( Sfm_Dec_t * p ) { @@ -1963,7 +1994,6 @@ void Abc_NtkDelayOpt( Sfm_Dec_t * p ) int OldId = Abc_ObjId(pObj); int DelayOld = Sfm_ManReadObjDelay(p, OldId); assert( pObj->fMarkA == 0 ); - p->nNodesTried++; clk = Abc_Clock(); p->nDivs = Sfm_DecExtract( pNtk, pPars, pObj, &p->vObjRoots, &p->vObjGates, &p->vObjFanins, &p->vObjMap, &p->vTemp, &p->vTemp2, &p->vObjMffc, &p->vObjInMffc, p->pTim, p->pMit ); @@ -2028,8 +2058,8 @@ p->timeSat += Abc_Clock() - clk; p->nNodesChanged++; Abc_NtkCountStats( p, Limit ); // reduce load due to removed MFFC - if ( p->pMit ) Sfm_MitUpdateLoad( p->pMit, &p->vTemp2, 0 ); // assuming &p->vTemp2 contains MFFC - Sfm_DecInsert( pNtk, pObj, Limit, &p->vObjGates, &p->vObjFanins, &p->vObjMap, &p->vGateHands, p->GateBuffer, p->GateInvert, &p->vGateFuncs, &p->vTemp ); + if ( p->pMit ) Sfm_MitUpdateLoad( p->pMit, &p->vTemp3, 0 ); // assuming &p->vTemp3 contains MFFC + Sfm_DecInsert( pNtk, pObj, Limit, &p->vObjGates, &p->vObjFanins, &p->vObjMap, &p->vGateHands, p->GateBuffer, p->GateInvert, &p->vGateFuncs, &p->vTemp, p->pMit ); // increase load due to added new nodes if ( p->pMit ) Sfm_MitUpdateLoad( p->pMit, &p->vTemp, 1 ); // assuming &p->vTemp contains new nodes clk = Abc_Clock(); @@ -2039,13 +2069,13 @@ clk = Abc_Clock(); Sfm_TimUpdateTiming( p->pTim, &p->vTemp ); p->timeTime += Abc_Clock() - clk; pObjNew = Abc_NtkObj( pNtk, Abc_NtkObjNumMax(pNtk)-1 ); - assert( p->DelayMin == 0 || p->DelayMin == Sfm_ManReadObjDelay(p, Abc_ObjId(pObjNew)) ); + assert( p->pMit || p->DelayMin == 0 || p->DelayMin == Sfm_ManReadObjDelay(p, Abc_ObjId(pObjNew)) ); // report if ( pPars->fDelayVerbose ) - printf( "Node %5d : I =%3d. Cand = %5d (%6.2f %%) Old =%8.2f. New =%8.2f. Final =%8.2f\n", - OldId, i, Vec_IntSize(&p->vCands), 100.0 * Vec_IntSize(&p->vCands) / Abc_NtkNodeNum(p->pNtk), + printf( "Node %5d %5d : I =%3d. Cand = %5d (%6.2f %%) Old =%8.2f. New =%8.2f. Final =%8.2f\n", + OldId, Abc_NtkObjNumMax(p->pNtk), i, Vec_IntSize(&p->vCands), 100.0 * Vec_IntSize(&p->vCands) / Abc_NtkNodeNum(p->pNtk), MIO_NUMINV*DelayOld, MIO_NUMINV*Sfm_ManReadObjDelay(p, Abc_ObjId(pObjNew)), - MIO_NUMINV*Sfm_TimReadNtkDelay(p->pTim) ); + MIO_NUMINV*Sfm_ManReadNtkDelay(p) ); break; } if ( pPars->iNodeOne ) diff --git a/src/opt/sfm/sfmInt.h b/src/opt/sfm/sfmInt.h index 3d78d557..a08979ab 100644 --- a/src/opt/sfm/sfmInt.h +++ b/src/opt/sfm/sfmInt.h @@ -231,6 +231,8 @@ extern Sfm_Mit_t * Sfm_MitStart( Mio_Library_t * pLib, SC_Lib * pScl, Scl_Con_t extern void Sfm_MitStop( Sfm_Mit_t * p ); extern int Sfm_MitReadNtkDelay( Sfm_Mit_t * p ); extern int Sfm_MitReadObjDelay( Sfm_Mit_t * p, int iObj ); +extern void Sfm_MitTransferLoad( Sfm_Mit_t * p, Abc_Obj_t * pNew, Abc_Obj_t * pOld ); +extern void Sfm_MitTimingGrow( Sfm_Mit_t * p ); extern void Sfm_MitUpdateLoad( Sfm_Mit_t * p, Vec_Int_t * vTimeNodes, int fAdd ); extern void Sfm_MitUpdateTiming( Sfm_Mit_t * p, Vec_Int_t * vTimeNodes ); extern int Sfm_MitSortArrayByArrival( Sfm_Mit_t * p, Vec_Int_t * vNodes, int iPivot ); diff --git a/src/opt/sfm/sfmMit.c b/src/opt/sfm/sfmMit.c index d37aad98..09fcf34c 100644 --- a/src/opt/sfm/sfmMit.c +++ b/src/opt/sfm/sfmMit.c @@ -53,6 +53,8 @@ Sfm_Mit_t * Sfm_MitStart( Mio_Library_t * pLib, SC_Lib * pScl, Scl_Con_t * pExt void Sfm_MitStop( Sfm_Mit_t * p ) {} int Sfm_MitReadNtkDelay( Sfm_Mit_t * p ) { return 0;} int Sfm_MitReadObjDelay( Sfm_Mit_t * p, int iObj ) { return 0;} +void Sfm_MitTransferLoad( Sfm_Mit_t * p, Abc_Obj_t * pNew, Abc_Obj_t * pOld ) {}; +void Sfm_MitTimingGrow( Sfm_Mit_t * p ) {}; void Sfm_MitUpdateLoad( Sfm_Mit_t * p, Vec_Int_t * vTimeNodes, int fAdd ) {} void Sfm_MitUpdateTiming( Sfm_Mit_t * p, Vec_Int_t * vTimeNodes ) {} int Sfm_MitSortArrayByArrival( Sfm_Mit_t * p, Vec_Int_t * vNodes, int iPivot ) { return 0;} |