diff options
Diffstat (limited to 'src/map')
-rw-r--r-- | src/map/scl/module.make | 2 | ||||
-rw-r--r-- | src/map/scl/scl.c | 4 | ||||
-rw-r--r-- | src/map/scl/sclGsize.c | 54 | ||||
-rw-r--r-- | src/map/scl/sclSize.c | 466 |
4 files changed, 2 insertions, 524 deletions
diff --git a/src/map/scl/module.make b/src/map/scl/module.make index dbf63a99..355d29f6 100644 --- a/src/map/scl/module.make +++ b/src/map/scl/module.make @@ -1,9 +1,7 @@ SRC += src/map/scl/scl.c \ src/map/scl/sclBuff.c \ src/map/scl/sclFile.c \ - src/map/scl/sclGsize.c \ src/map/scl/sclLoad.c \ - src/map/scl/sclSize.c \ src/map/scl/sclTime.c \ src/map/scl/sclUpsize.c \ src/map/scl/sclUtil.c diff --git a/src/map/scl/scl.c b/src/map/scl/scl.c index f9d88c45..49a7dcc3 100644 --- a/src/map/scl/scl.c +++ b/src/map/scl/scl.c @@ -64,8 +64,8 @@ void Scl_Init( Abc_Frame_t * pAbc ) Cmd_CommandAdd( pAbc, "SCL mapping", "topo", Scl_CommandTopo, 1 ); Cmd_CommandAdd( pAbc, "SCL mapping", "buffer", Scl_CommandBuffer, 1 ); Cmd_CommandAdd( pAbc, "SCL mapping", "minsize", Scl_CommandMinsize, 1 ); - Cmd_CommandAdd( pAbc, "SCL mapping", "gsize", Scl_CommandGsize, 1 ); Cmd_CommandAdd( pAbc, "SCL mapping", "upsize", Scl_CommandUpsize, 1 ); +// Cmd_CommandAdd( pAbc, "SCL mapping", "gsize", Scl_CommandGsize, 1 ); } void Scl_End( Abc_Frame_t * pAbc ) { @@ -679,7 +679,7 @@ int Scl_CommandGsize( Abc_Frame_t * pAbc, int argc, char **argv ) return 1; } - Abc_SclSizingPerform( (SC_Lib *)pAbc->pLibScl, Abc_FrameReadNtk(pAbc), pPars ); +// Abc_SclSizingPerform( (SC_Lib *)pAbc->pLibScl, Abc_FrameReadNtk(pAbc), pPars ); return 0; usage: diff --git a/src/map/scl/sclGsize.c b/src/map/scl/sclGsize.c deleted file mode 100644 index 0e840f8b..00000000 --- a/src/map/scl/sclGsize.c +++ /dev/null @@ -1,54 +0,0 @@ -/**CFile**************************************************************** - - FileName [sclGsize.c] - - SystemName [ABC: Logic synthesis and verification system.] - - PackageName [Standard-cell library representation.] - - Synopsis [Selective increase of gate sizes.] - - Author [Alan Mishchenko, Niklas Een] - - Affiliation [UC Berkeley] - - Date [Ver. 1.0. Started - August 24, 2012.] - - Revision [$Id: sclGsize.c,v 1.0 2012/08/24 00:00:00 alanmi Exp $] - -***********************************************************************/ - -#include "sclInt.h" -#include "sclMan.h" - -ABC_NAMESPACE_IMPL_START - - -//////////////////////////////////////////////////////////////////////// -/// DECLARATIONS /// -//////////////////////////////////////////////////////////////////////// - -//////////////////////////////////////////////////////////////////////// -/// FUNCTION DEFINITIONS /// -//////////////////////////////////////////////////////////////////////// - -/**Function************************************************************* - - Synopsis [] - - Description [] - - SideEffects [] - - SeeAlso [] - -***********************************************************************/ - - -//////////////////////////////////////////////////////////////////////// -/// END OF FILE /// -//////////////////////////////////////////////////////////////////////// - - -ABC_NAMESPACE_IMPL_END - diff --git a/src/map/scl/sclSize.c b/src/map/scl/sclSize.c deleted file mode 100644 index 59c76754..00000000 --- a/src/map/scl/sclSize.c +++ /dev/null @@ -1,466 +0,0 @@ -/**CFile**************************************************************** - - FileName [sclSize.c] - - SystemName [ABC: Logic synthesis and verification system.] - - PackageName [Standard-cell library representation.] - - Synopsis [Gate sizing algorithms.] - - Author [Alan Mishchenko, Niklas Een] - - Affiliation [UC Berkeley] - - Date [Ver. 1.0. Started - August 24, 2012.] - - Revision [$Id: sclSize.c,v 1.0 2012/08/24 00:00:00 alanmi Exp $] - -***********************************************************************/ - -#include "sclInt.h" -#include "sclMan.h" - -ABC_NAMESPACE_IMPL_START - - -//////////////////////////////////////////////////////////////////////// -/// DECLARATIONS /// -//////////////////////////////////////////////////////////////////////// - -//////////////////////////////////////////////////////////////////////// -/// FUNCTION DEFINITIONS /// -//////////////////////////////////////////////////////////////////////// - -/**Function************************************************************* - - Synopsis [Collect nodes in network.] - - Description [] - - SideEffects [] - - SeeAlso [] - -***********************************************************************/ -Vec_Int_t * Abc_SclCollectNodes( Abc_Ntk_t * p ) -{ - Vec_Int_t * vRes; - Abc_Obj_t * pObj; - int i; - vRes = Vec_IntAlloc( Abc_NtkNodeNum(p) ); - Abc_NtkForEachNode1( p, pObj, i ) - Vec_IntPush( vRes, i ); - return vRes; -} - -/**Function************************************************************* - - Synopsis [Collect near-critical CO nodes.] - - Description [] - - SideEffects [] - - SeeAlso [] - -***********************************************************************/ -Vec_Int_t * Abc_SclFindCriticalCoRange( SC_Man * p, int Range ) -{ -// float fMaxArr = Abc_SclGetMaxDelay( p ) * (100.0 - Range) / 100.0; - float fMaxArr = Abc_SclReadMaxDelay( p ) * (100.0 - Range) / 100.0; - Vec_Int_t * vPivots; - Abc_Obj_t * pObj; - int i; - vPivots = Vec_IntAlloc( 100 ); - Abc_NtkForEachCo( p->pNtk, pObj, i ) - if ( Abc_SclObjTimeMax(p, pObj) >= fMaxArr ) - Vec_IntPush( vPivots, Abc_ObjId(pObj) ); - assert( Vec_IntSize(vPivots) > 0 ); - return vPivots; -} - - -/**Function************************************************************* - - Synopsis [Collect nodes in cone.] - - Description [] - - SideEffects [] - - SeeAlso [] - -***********************************************************************/ -void Abc_SclFindCriticalCone_rec( SC_Man * p, Abc_Obj_t * pObj, Vec_Int_t * vVisited, int RangeF ) -{ - Abc_Obj_t * pNext; - float fArrMax; - int i; - if ( Abc_ObjIsCi(pObj) ) - return; - if ( Abc_NodeIsTravIdCurrent( pObj ) ) - return; - Abc_NodeSetTravIdCurrent( pObj ); - assert( Abc_ObjIsNode(pObj) ); - // compute timing critical fanin - fArrMax = Abc_SclGetMaxDelayNodeFanins( p, pObj ) * (100.0 - RangeF) / 100.0; - // traverse all fanins whose arrival times are within a window - Abc_ObjForEachFanin( pObj, pNext, i ) - if ( Abc_SclObjTimeMax(p, pNext) >= fArrMax ) - Abc_SclFindCriticalCone_rec( p, pNext, vVisited, RangeF ); - Vec_IntPush( vVisited, Abc_ObjId(pObj) ); -} -Vec_Int_t * Abc_SclFindCriticalCone( SC_Man * p, int Range, int RangeF, Vec_Int_t ** pvPivots ) -{ - Vec_Int_t * vPivots = Abc_SclFindCriticalCoRange( p, Range ); - Vec_Int_t * vPath = Vec_IntAlloc( 100 ); - Abc_Obj_t * pObj; - int i; - Abc_NtkIncrementTravId( p->pNtk ); - Abc_NtkForEachObjVec( vPivots, p->pNtk, pObj, i ) - Abc_SclFindCriticalCone_rec( p, Abc_ObjFanin0(pObj), vPath, RangeF ); - if ( pvPivots ) - *pvPivots = vPivots; - else - Vec_IntFree( vPivots ); - return vPath; -} - -/**Function************************************************************* - - Synopsis [Collect nodes in critical path.] - - Description [] - - SideEffects [] - - SeeAlso [] - -***********************************************************************/ -Vec_Int_t * Abc_SclFindCriticalPath( SC_Man * p, int Range, Vec_Int_t ** pvPivots ) -{ - return Abc_SclFindCriticalCone( p, Range, 1, pvPivots ); -} - -/**Function************************************************************* - - Synopsis [Collect TFO of the fanins of the object.] - - Description [] - - SideEffects [] - - SeeAlso [] - -***********************************************************************/ -void Abc_SclCollectTfo_rec( Abc_Obj_t * pObj, Vec_Int_t * vVisited ) -{ - Abc_Obj_t * pNext; - int i; -// if ( Abc_ObjIsCo(pObj) ) -// return; - if ( Abc_NodeIsTravIdCurrent( pObj ) ) - return; - Abc_NodeSetTravIdCurrent( pObj ); - Abc_ObjForEachFanout( pObj, pNext, i ) - Abc_SclCollectTfo_rec( pNext, vVisited ); - Vec_IntPush( vVisited, Abc_ObjId(pObj) ); -} -void Abc_SclMarkTfi_rec( Abc_Obj_t * pObj ) -{ - Abc_Obj_t * pNext; - int i; - if ( Abc_ObjIsCi(pObj) ) - return; - if ( !Abc_NodeIsTravIdPrevious( pObj ) ) - return; - if ( Abc_NodeIsTravIdCurrent( pObj ) ) - return; - Abc_NodeSetTravIdCurrent( pObj ); - assert( Abc_ObjIsNode(pObj) || Abc_ObjIsCo(pObj) ); - Abc_ObjForEachFanin( pObj, pNext, i ) - Abc_SclMarkTfi_rec( pNext ); -} -Vec_Int_t * Abc_SclCollectTfo( Abc_Ntk_t * p, Abc_Obj_t * pObj, Vec_Int_t * vPivots ) -{ - Vec_Int_t * vVisited; - Abc_Obj_t * pFanin; - int i, k; - assert( Abc_ObjIsNode(pObj) ); - vVisited = Vec_IntAlloc( 100 ); - // collect nodes in the TFO - Abc_NtkIncrementTravId( p ); - Abc_SclCollectTfo_rec( pObj, vVisited ); - Abc_ObjForEachFanin( pObj, pFanin, i ) - if ( Abc_ObjIsNode(pFanin) ) - Abc_SclCollectTfo_rec( pFanin, vVisited ); - if ( vPivots ) - { - // mark nodes in the TFI - Abc_NtkIncrementTravId( p ); - Abc_NtkForEachObjVec( vPivots, p, pObj, i ) - Abc_SclMarkTfi_rec( pObj ); - // remove unmarked nodes - k = 0; - Abc_NtkForEachObjVec( vVisited, p, pObj, i ) - if ( Abc_NodeIsTravIdCurrent( pObj ) ) - Vec_IntWriteEntry( vVisited, k++, Abc_ObjId(pObj) ); - Vec_IntShrink( vVisited, k ); - } - // reverse order - Vec_IntReverseOrder( vVisited ); - return vVisited; -} - -/**Function************************************************************* - - Synopsis [] - - Description [] - - SideEffects [] - - SeeAlso [] - -***********************************************************************/ -float Abc_SclSizingGain( SC_Man * p, Abc_Obj_t * pPivot, Vec_Int_t * vPivots, int fUpsize ) -{ - double dGain = 0; - Vec_Int_t * vCone; - Abc_Obj_t * pObj; - int i; - assert( Abc_ObjIsNode(pPivot) ); - vCone = Abc_SclCollectTfo( p->pNtk, pPivot, vPivots ); - Abc_SclConeStore( p, vCone ); - Abc_SclTimeCone( p, vCone ); - if ( vPivots ) - { - Abc_NtkForEachObjVec( vPivots, p->pNtk, pObj, i ) - if ( Abc_ObjIsCo(pObj) ) - { - Abc_SclObjDupFanin( p, pObj ); - dGain += Abc_SclObjGain( p, pObj ); - } - } - else - { - Abc_NtkForEachObjVec( vCone, p->pNtk, pObj, i ) - if ( Abc_ObjIsCo(pObj) ) - { - Abc_SclObjDupFanin( p, pObj ); - dGain += Abc_SclObjGain( p, pObj ); - } - } - Abc_SclConeRestore( p, vCone ); - Vec_IntFree( vCone ); - return dGain; -} -Abc_Obj_t * Abc_SclChooseBiggestGain( SC_Man * p, Vec_Int_t * vPath, Vec_Int_t * vPivots, int fUpsize, float GainThresh ) -{ - SC_Cell * pOld, * pNew; - Abc_Obj_t * pPivot = NULL, * pObj; - double dGain, dGainBest = GainThresh; //0.00001; - int i, gateId; - Abc_NtkForEachObjVec( vPath, p->pNtk, pObj, i ) - { - if ( Abc_ObjIsCo(pObj) ) - continue; - pOld = Abc_SclObjCell( p, pObj ); - pNew = Abc_SclObjResiable( p, pObj, fUpsize ); - if ( pNew == NULL ) - continue; - gateId = Vec_IntEntry(p->vGates, Abc_ObjId(pObj)); - Vec_IntWriteEntry( p->vGates, Abc_ObjId(pObj), Abc_SclCellFind(p->pLib, pNew->pName) ); -//printf( "changing %s for %s at node %d ", pOld->pName, pNew->pName, Abc_ObjId(pObj) ); - Abc_SclUpdateLoad( p, pObj, pOld, pNew ); - dGain = Abc_SclSizingGain( p, pObj, vPivots, fUpsize ); - Abc_SclUpdateLoad( p, pObj, pNew, pOld ); -//printf( "gain is %f\n", dGain ); - Vec_IntWriteEntry( p->vGates, Abc_ObjId(pObj), Abc_SclCellFind(p->pLib, pOld->pName) ); - assert( gateId == Vec_IntEntry(p->vGates, Abc_ObjId(pObj)) ); - if ( dGainBest < dGain ) - { - dGainBest = dGain; - pPivot = pObj; - } - } -//printf( "thresh = %8.2f ps best gain = %8.2f ps \n", SC_LibTimePs(p->pLib, GainThresh), SC_LibTimePs(p->pLib, dGainBest) ); - return pPivot; -} -void Abc_SclUpdateNetwork( SC_Man * p, Abc_Obj_t * pObj, int nCone, int fUpsize, int iStep, int fVerbose, int fVeryVerbose ) -{ - Vec_Int_t * vCone; - SC_Cell * pOld, * pNew; - // find new gate - pOld = Abc_SclObjCell( p, pObj ); - pNew = Abc_SclObjResiable( p, pObj, fUpsize ); - assert( pNew != NULL ); - // update gate - Abc_SclUpdateLoad( p, pObj, pOld, pNew ); - p->SumArea += pNew->area - pOld->area; - Vec_IntWriteEntry( p->vGates, Abc_ObjId(pObj), Abc_SclCellFind(p->pLib, pNew->pName) ); - // update info - vCone = Abc_SclCollectTfo( p->pNtk, pObj, NULL ); - Abc_SclConeStore( p, vCone ); - Abc_SclTimeCone( p, vCone ); - Vec_IntFree( vCone ); - // print output - if ( fVerbose ) - { - printf( "%5d :", iStep ); - printf( "%7d ", Abc_ObjId(pObj) ); - printf( "%-12s-> %-12s ", pOld->pName, pNew->pName ); - printf( "d =%8.2f ps ", SC_LibTimePs(p->pLib, Abc_SclReadMaxDelay(p)) ); - printf( "a =%10.2f ", p->SumArea ); - printf( "n =%5d ", nCone ); -// Abc_PrintTime( 1, "Time", clock() - p->timeTotal ); -// ABC_PRTr( "Time", clock() - p->timeTotal ); - if ( fVeryVerbose ) - ABC_PRT( "Time", clock() - p->timeTotal ); - else - ABC_PRTr( "Time", clock() - p->timeTotal ); - } -} - - -/**Function************************************************************* - - Synopsis [] - - Description [] - - SideEffects [] - - SeeAlso [] - -***********************************************************************/ -void Abc_SclSizingPerform( SC_Lib * pLib, Abc_Ntk_t * pNtk, SC_SizePars * pPars ) -{ - int nIters = 1; - SC_Man * p; - Vec_Int_t * vPath, * vPivots; - Abc_Obj_t * pBest; - clock_t nRuntimeLimit = pPars->nTimeOut ? pPars->nTimeOut * CLOCKS_PER_SEC + clock() : 0; - int r, i, nNodes, nCones = 0, nDownSize = 0; - p = Abc_SclManStart( pLib, pNtk, pPars->fUseWireLoads, 0 ); - p->timeTotal = clock(); - if ( pPars->fPrintCP ) - Abc_SclTimeNtkPrint( p, 0, 0 ); - if ( pPars->fVerbose ) - printf( "Iterative gate-sizing of network \"%s\" with library \"%s\":\n", Abc_NtkName(pNtk), pLib->pName ); - if ( pPars->fVerbose ) - { -// printf( "%5d : ", 0 ); - printf( "Starting parameters of current mapping: " ); - printf( "d =%8.2f ps ", SC_LibTimePs(p->pLib, Abc_SclReadMaxDelay(p)) ); - printf( "a =%10.2f ", p->SumArea ); - printf( " " ); - Abc_PrintTime( 1, "Time", clock() - p->timeTotal ); - } - for ( r = i = 0; r < nIters; r++ ) - { - float nThresh1 = p->MaxDelay0/100000; - float nThresh2 = p->MaxDelay0/1000; - // try upsizing - for ( ; i < pPars->nSteps; i++ ) - { - vPath = Abc_SclFindCriticalPath( p, pPars->nRange, &vPivots ); - pBest = Abc_SclChooseBiggestGain( p, vPath, vPivots, 1, nThresh1 ); - nNodes = Vec_IntSize(vPath); - Vec_IntFree( vPath ); - Vec_IntFree( vPivots ); - if ( pBest == NULL ) - { - if ( pPars->fTryAll ) - { - vPath = Abc_SclFindCriticalCone( p, pPars->nRange, pPars->nRangeF, &vPivots ); - pBest = Abc_SclChooseBiggestGain( p, vPath, vPivots, 1, nThresh1 ); - nNodes = Vec_IntSize(vPath); - Vec_IntFree( vPath ); - Vec_IntFree( vPivots ); - nCones++; - } - if ( pBest == NULL ) - break; - } - Abc_SclUpdateNetwork( p, pBest, nNodes, 1, i+1, pPars->fVerbose, pPars->fVeryVerbose ); - // recompute loads every 100 steps - if ( i && i % 100 == 0 ) - Abc_SclComputeLoad( p ); - if ( (i & 15) == 0 && nRuntimeLimit && clock() > nRuntimeLimit ) // timeout - break; - } - if ( r == nIters - 1 ) - break; - if ( nRuntimeLimit && clock() > nRuntimeLimit ) // timeout - break; - if ( pPars->fVeryVerbose ) - printf( "\n" ); - // try downsizing - for ( ; i < pPars->nSteps; i++ ) - { - vPath = Abc_SclFindCriticalPath( p, pPars->nRange, &vPivots ); -// pBest = Abc_SclChooseBiggestGain( p, vPath, vPivots, 0, -p->MaxDelay0/100000 ); - pBest = Abc_SclChooseBiggestGain( p, vPath, NULL, 0, nThresh2 ); - nNodes = Vec_IntSize(vPath); - Vec_IntFree( vPath ); - Vec_IntFree( vPivots ); - if ( pBest == NULL ) - { - - if ( pPars->fTryAll ) - { - vPath = Abc_SclFindCriticalCone( p, pPars->nRange, pPars->nRangeF, &vPivots ); -// pBest = Abc_SclChooseBiggestGain( p, vPath, vPivots, 0, -p->MaxDelay0/100000 ); - pBest = Abc_SclChooseBiggestGain( p, vPath, NULL, 0, nThresh2 ); - nNodes = Vec_IntSize(vPath); - Vec_IntFree( vPath ); - Vec_IntFree( vPivots ); - nCones++; - } - if ( pBest == NULL ) - break; - } - Abc_SclUpdateNetwork( p, pBest, nNodes, 0, i+1, pPars->fVerbose, pPars->fVeryVerbose ); - // recompute loads every 100 steps - if ( i && i % 100 == 0 ) - Abc_SclComputeLoad( p ); - if ( (i & 15) == 0 && nRuntimeLimit && clock() > nRuntimeLimit ) // timeout - break; - nDownSize++; - } - if ( nRuntimeLimit && clock() > nRuntimeLimit ) // timeout - break; - if ( pPars->fVeryVerbose ) - printf( "\n" ); - } - - p->MaxDelay = Abc_SclReadMaxDelay(p); - if ( pPars->fPrintCP ) - Abc_SclTimeNtkPrint( p, 0, 0 ); - if ( nRuntimeLimit && clock() > nRuntimeLimit ) - printf( "Timeout was reached after %d seconds.\n", pPars->nTimeOut ); - // print cumulative statistics - printf( "Cones: %d. ", nCones ); - printf( "Resized: %d(%d). ", i, nDownSize ); - printf( "Delay: " ); - printf( "%.2f -> %.2f ps ", SC_LibTimePs(p->pLib, p->MaxDelay0), SC_LibTimePs(p->pLib, p->MaxDelay) ); - printf( "(%+.1f %%). ", 100.0 * (p->MaxDelay - p->MaxDelay0)/ p->MaxDelay0 ); - printf( "Area: " ); - printf( "%.2f -> %.2f ", p->SumArea0, p->SumArea ); - printf( "(%+.1f %%). ", 100.0 * (p->SumArea - p->SumArea0)/ p->SumArea0 ); - Abc_PrintTime( 1, "Time", clock() - p->timeTotal ); - // save the result and quit - Abc_SclManSetGates( pLib, pNtk, p->vGates ); // updates gate pointers - Abc_SclManFree( p ); -} - - -//////////////////////////////////////////////////////////////////////// -/// END OF FILE /// -//////////////////////////////////////////////////////////////////////// - - -ABC_NAMESPACE_IMPL_END - |