2012-08-25 06:31:46 +02:00
|
|
|
/**CFile****************************************************************
|
|
|
|
|
|
2012-08-30 01:20:39 +02:00
|
|
|
FileName [sclTime.c]
|
2012-08-25 06:31:46 +02:00
|
|
|
|
|
|
|
|
SystemName [ABC: Logic synthesis and verification system.]
|
|
|
|
|
|
2012-08-30 01:20:39 +02:00
|
|
|
PackageName [Standard-cell library representation.]
|
|
|
|
|
|
|
|
|
|
Synopsis [Static timing analysis using Liberty delay model.]
|
2012-08-25 06:31:46 +02:00
|
|
|
|
|
|
|
|
Author [Alan Mishchenko, Niklas Een]
|
|
|
|
|
|
|
|
|
|
Affiliation [UC Berkeley]
|
|
|
|
|
|
|
|
|
|
Date [Ver. 1.0. Started - August 24, 2012.]
|
|
|
|
|
|
2012-08-30 01:20:39 +02:00
|
|
|
Revision [$Id: sclTime.c,v 1.0 2012/08/24 00:00:00 alanmi Exp $]
|
2012-08-25 06:31:46 +02:00
|
|
|
|
|
|
|
|
***********************************************************************/
|
|
|
|
|
|
|
|
|
|
#include "sclInt.h"
|
2012-08-29 09:48:36 +02:00
|
|
|
#include "sclMan.h"
|
2012-08-25 06:31:46 +02:00
|
|
|
|
|
|
|
|
ABC_NAMESPACE_IMPL_START
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
////////////////////////////////////////////////////////////////////////
|
|
|
|
|
/// DECLARATIONS ///
|
|
|
|
|
////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
|
|
////////////////////////////////////////////////////////////////////////
|
|
|
|
|
/// FUNCTION DEFINITIONS ///
|
|
|
|
|
////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
2012-08-26 04:00:26 +02:00
|
|
|
/**Function*************************************************************
|
|
|
|
|
|
2012-08-30 01:20:39 +02:00
|
|
|
Synopsis [Finding most critical nodes/fanins/path.]
|
2012-08-29 09:48:36 +02:00
|
|
|
|
|
|
|
|
Description []
|
|
|
|
|
|
|
|
|
|
SideEffects []
|
|
|
|
|
|
|
|
|
|
SeeAlso []
|
|
|
|
|
|
|
|
|
|
***********************************************************************/
|
2012-08-30 01:20:39 +02:00
|
|
|
Abc_Obj_t * Abc_SclFindCriticalCo( SC_Man * p, int * pfRise )
|
2012-08-26 04:00:26 +02:00
|
|
|
{
|
2012-08-29 09:48:36 +02:00
|
|
|
Abc_Obj_t * pObj, * pPivot = NULL;
|
|
|
|
|
float fMaxArr = 0;
|
|
|
|
|
int i;
|
|
|
|
|
Abc_NtkForEachCo( p->pNtk, pObj, i )
|
|
|
|
|
{
|
|
|
|
|
SC_Pair * pArr = Abc_SclObjTime( p, pObj );
|
|
|
|
|
if ( fMaxArr < pArr->rise ) fMaxArr = pArr->rise, *pfRise = 1, pPivot = pObj;
|
|
|
|
|
if ( fMaxArr < pArr->fall ) fMaxArr = pArr->fall, *pfRise = 0, pPivot = pObj;
|
|
|
|
|
}
|
|
|
|
|
assert( pPivot != NULL );
|
|
|
|
|
return pPivot;
|
2012-08-26 04:00:26 +02:00
|
|
|
}
|
2012-08-29 09:48:36 +02:00
|
|
|
Abc_Obj_t * Abc_SclFindMostCriticalFanin( SC_Man * p, int * pfRise, Abc_Obj_t * pNode )
|
2012-08-26 04:00:26 +02:00
|
|
|
{
|
2012-08-29 09:48:36 +02:00
|
|
|
Abc_Obj_t * pObj, * pPivot = NULL;
|
|
|
|
|
float fMaxArr = 0;
|
|
|
|
|
int i;
|
|
|
|
|
Abc_ObjForEachFanin( pNode, pObj, i )
|
|
|
|
|
{
|
|
|
|
|
SC_Pair * pArr = Abc_SclObjTime( p, pObj );
|
|
|
|
|
if ( fMaxArr < pArr->rise ) fMaxArr = pArr->rise, *pfRise = 1, pPivot = pObj;
|
|
|
|
|
if ( fMaxArr < pArr->fall ) fMaxArr = pArr->fall, *pfRise = 0, pPivot = pObj;
|
|
|
|
|
}
|
|
|
|
|
return pPivot;
|
2012-08-26 04:00:26 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**Function*************************************************************
|
|
|
|
|
|
2012-08-30 01:20:39 +02:00
|
|
|
Synopsis [Printing timing information for the node/network.]
|
2012-08-26 04:00:26 +02:00
|
|
|
|
|
|
|
|
Description []
|
|
|
|
|
|
|
|
|
|
SideEffects []
|
|
|
|
|
|
|
|
|
|
SeeAlso []
|
|
|
|
|
|
|
|
|
|
***********************************************************************/
|
2012-09-20 23:13:59 +02:00
|
|
|
static inline void Abc_SclTimeGatePrint( SC_Man * p, Abc_Obj_t * pObj, int fRise, int Length, float maxDelay )
|
2012-08-26 04:00:26 +02:00
|
|
|
{
|
2012-08-30 23:32:36 +02:00
|
|
|
printf( "%7d : ", Abc_ObjId(pObj) );
|
|
|
|
|
printf( "%d ", Abc_ObjFaninNum(pObj) );
|
2012-09-04 21:22:59 +02:00
|
|
|
printf( "%-*s ", Length, Abc_SclObjCell(p, pObj)->pName );
|
2012-08-30 01:20:39 +02:00
|
|
|
if ( fRise >= 0 )
|
|
|
|
|
printf( "(%s) ", fRise ? "rise" : "fall" );
|
|
|
|
|
printf( "delay = (" );
|
|
|
|
|
printf( "%7.1f ps ", Abc_SclObjTimePs(p, pObj, 1) );
|
|
|
|
|
printf( "%7.1f ps ) ", Abc_SclObjTimePs(p, pObj, 0) );
|
|
|
|
|
printf( "load =%6.2f ff ", Abc_SclObjLoadFf(p, pObj, fRise >= 0 ? fRise : 0 ) );
|
|
|
|
|
printf( "slew =%6.1f ps ", Abc_SclObjSlewPs(p, pObj, fRise >= 0 ? fRise : 0 ) );
|
2012-09-20 23:13:59 +02:00
|
|
|
printf( "slack =%6.1f ps", Abc_SclObjSlack(p, pObj, maxDelay) );
|
2012-08-30 01:20:39 +02:00
|
|
|
printf( "\n" );
|
2012-08-26 04:00:26 +02:00
|
|
|
}
|
2012-09-17 06:40:20 +02:00
|
|
|
void Abc_SclTimeNtkPrint( SC_Man * p, int fShowAll, int fShort )
|
2012-08-27 02:32:22 +02:00
|
|
|
{
|
2012-09-04 21:22:59 +02:00
|
|
|
int i, nLength = 0, fRise = 0;
|
2012-09-20 23:13:59 +02:00
|
|
|
Abc_Obj_t * pObj, * pPivot = Abc_SclFindCriticalCo( p, &fRise );
|
|
|
|
|
float maxDelay = Abc_SclObjTimePs(p, pPivot, fRise);
|
2012-08-30 01:20:39 +02:00
|
|
|
|
2012-09-04 21:22:59 +02:00
|
|
|
printf( "WireLoad model = \"%s\". ", p->pWLoadUsed ? p->pWLoadUsed : "none" );
|
|
|
|
|
printf( "Gates = %d. ", Abc_NtkNodeNum(p->pNtk) );
|
|
|
|
|
printf( "Area = %.2f. ", Abc_SclGetTotalArea( p ) );
|
2012-09-20 23:13:59 +02:00
|
|
|
printf( "Critical delay = %.1f ps\n", maxDelay );
|
2012-09-17 06:40:20 +02:00
|
|
|
if ( fShort )
|
|
|
|
|
return;
|
2012-08-30 01:20:39 +02:00
|
|
|
|
|
|
|
|
if ( fShowAll )
|
2012-08-27 02:32:22 +02:00
|
|
|
{
|
2012-08-30 01:20:39 +02:00
|
|
|
// printf( "Timing information for all nodes: \n" );
|
2012-09-04 21:22:59 +02:00
|
|
|
// find the longest cell name
|
2012-08-30 01:20:39 +02:00
|
|
|
Abc_NtkForEachNodeReverse( p->pNtk, pObj, i )
|
2012-08-30 22:58:26 +02:00
|
|
|
if ( Abc_ObjFaninNum(pObj) > 0 )
|
2012-09-04 21:22:59 +02:00
|
|
|
nLength = Abc_MaxInt( nLength, strlen(Abc_SclObjCell(p, pObj)->pName) );
|
|
|
|
|
// print timing
|
|
|
|
|
Abc_NtkForEachNodeReverse( p->pNtk, pObj, i )
|
|
|
|
|
if ( Abc_ObjFaninNum(pObj) > 0 )
|
2012-09-20 23:13:59 +02:00
|
|
|
Abc_SclTimeGatePrint( p, pObj, -1, nLength, maxDelay );
|
2012-08-27 02:32:22 +02:00
|
|
|
}
|
2012-08-30 01:20:39 +02:00
|
|
|
else
|
2012-08-27 02:32:22 +02:00
|
|
|
{
|
2012-08-30 01:20:39 +02:00
|
|
|
// printf( "Critical path: \n" );
|
2012-09-04 21:22:59 +02:00
|
|
|
// find the longest cell name
|
|
|
|
|
pObj = Abc_ObjFanin0(pPivot);
|
|
|
|
|
while ( pObj && Abc_ObjIsNode(pObj) )
|
|
|
|
|
{
|
|
|
|
|
nLength = Abc_MaxInt( nLength, strlen(Abc_SclObjCell(p, pObj)->pName) );
|
|
|
|
|
pObj = Abc_SclFindMostCriticalFanin( p, &fRise, pObj );
|
|
|
|
|
}
|
|
|
|
|
// print timing
|
|
|
|
|
pObj = Abc_ObjFanin0(pPivot);
|
2012-08-30 01:20:39 +02:00
|
|
|
while ( pObj && Abc_ObjIsNode(pObj) )
|
2012-08-27 02:32:22 +02:00
|
|
|
{
|
2012-08-30 01:20:39 +02:00
|
|
|
printf( "Critical path -- " );
|
2012-09-20 23:13:59 +02:00
|
|
|
Abc_SclTimeGatePrint( p, pObj, fRise, nLength, maxDelay );
|
2012-08-30 01:20:39 +02:00
|
|
|
pObj = Abc_SclFindMostCriticalFanin( p, &fRise, pObj );
|
2012-08-27 02:32:22 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2012-08-26 04:00:26 +02:00
|
|
|
/**Function*************************************************************
|
|
|
|
|
|
2012-08-30 01:20:39 +02:00
|
|
|
Synopsis [Timing computation for pin/gate/cone/network.]
|
2012-08-26 04:00:26 +02:00
|
|
|
|
|
|
|
|
Description []
|
|
|
|
|
|
|
|
|
|
SideEffects []
|
|
|
|
|
|
|
|
|
|
SeeAlso []
|
|
|
|
|
|
|
|
|
|
***********************************************************************/
|
|
|
|
|
static inline float Abc_SclLookup( SC_Surface * p, float slew, float load )
|
|
|
|
|
{
|
|
|
|
|
float * pIndex0, * pIndex1, * pDataS, * pDataS1;
|
|
|
|
|
float sfrac, lfrac, p0, p1;
|
|
|
|
|
int s, l;
|
|
|
|
|
|
|
|
|
|
// Find closest sample points in surface:
|
|
|
|
|
pIndex0 = Vec_FltArray(p->vIndex0);
|
|
|
|
|
for ( s = 1; s < Vec_FltSize(p->vIndex0)-1; s++ )
|
|
|
|
|
if ( pIndex0[s] > slew )
|
|
|
|
|
break;
|
|
|
|
|
s--;
|
|
|
|
|
|
|
|
|
|
pIndex1 = Vec_FltArray(p->vIndex1);
|
|
|
|
|
for ( l = 1; l < Vec_FltSize(p->vIndex1)-1; l++ )
|
|
|
|
|
if ( pIndex1[l] > load )
|
|
|
|
|
break;
|
|
|
|
|
l--;
|
|
|
|
|
|
|
|
|
|
// Interpolate (or extrapolate) function value from sample points:
|
|
|
|
|
sfrac = (slew - pIndex0[s]) / (pIndex0[s+1] - pIndex0[s]);
|
|
|
|
|
lfrac = (load - pIndex1[l]) / (pIndex1[l+1] - pIndex1[l]);
|
|
|
|
|
|
|
|
|
|
pDataS = Vec_FltArray( (Vec_Flt_t *)Vec_PtrEntry(p->vData, s) );
|
|
|
|
|
pDataS1 = Vec_FltArray( (Vec_Flt_t *)Vec_PtrEntry(p->vData, s+1) );
|
|
|
|
|
|
|
|
|
|
p0 = pDataS [l] + lfrac * (pDataS [l+1] - pDataS [l]);
|
|
|
|
|
p1 = pDataS1[l] + lfrac * (pDataS1[l+1] - pDataS1[l]);
|
|
|
|
|
|
|
|
|
|
return p0 + sfrac * (p1 - p0); // <<== multiply result with K factor here
|
|
|
|
|
}
|
2012-08-30 01:20:39 +02:00
|
|
|
void Abc_SclTimePin( SC_Man * p, SC_Timing * pTime, Abc_Obj_t * pObj, Abc_Obj_t * pFanin )
|
2012-08-26 04:00:26 +02:00
|
|
|
{
|
2012-08-30 01:20:39 +02:00
|
|
|
SC_Pair * pArrIn = Abc_SclObjTime( p, pFanin );
|
2012-08-27 02:32:22 +02:00
|
|
|
SC_Pair * pSlewIn = Abc_SclObjSlew( p, pFanin );
|
2012-08-26 04:00:26 +02:00
|
|
|
SC_Pair * pLoad = Abc_SclObjLoad( p, pObj );
|
2012-08-30 01:20:39 +02:00
|
|
|
SC_Pair * pArrOut = Abc_SclObjTime( p, pObj ); // modified
|
|
|
|
|
SC_Pair * pSlewOut = Abc_SclObjSlew( p, pObj ); // modified
|
2012-08-26 04:00:26 +02:00
|
|
|
|
|
|
|
|
if (pTime->tsense == sc_ts_Pos || pTime->tsense == sc_ts_Non)
|
|
|
|
|
{
|
2012-08-30 01:20:39 +02:00
|
|
|
pArrOut->rise = Abc_MaxFloat( pArrOut->rise, pArrIn->rise + Abc_SclLookup(pTime->pCellRise, pSlewIn->rise, pLoad->rise) );
|
|
|
|
|
pArrOut->fall = Abc_MaxFloat( pArrOut->fall, pArrIn->fall + Abc_SclLookup(pTime->pCellFall, pSlewIn->fall, pLoad->fall) );
|
|
|
|
|
pSlewOut->rise = Abc_MaxFloat( pSlewOut->rise, Abc_SclLookup(pTime->pRiseTrans, pSlewIn->rise, pLoad->rise) );
|
|
|
|
|
pSlewOut->fall = Abc_MaxFloat( pSlewOut->fall, Abc_SclLookup(pTime->pFallTrans, pSlewIn->fall, pLoad->fall) );
|
2012-08-26 04:00:26 +02:00
|
|
|
}
|
|
|
|
|
if (pTime->tsense == sc_ts_Neg || pTime->tsense == sc_ts_Non)
|
|
|
|
|
{
|
2012-08-30 01:20:39 +02:00
|
|
|
pArrOut->rise = Abc_MaxFloat( pArrOut->rise, pArrIn->fall + Abc_SclLookup(pTime->pCellRise, pSlewIn->fall, pLoad->rise) );
|
|
|
|
|
pArrOut->fall = Abc_MaxFloat( pArrOut->fall, pArrIn->rise + Abc_SclLookup(pTime->pCellFall, pSlewIn->rise, pLoad->fall) );
|
|
|
|
|
pSlewOut->rise = Abc_MaxFloat( pSlewOut->rise, Abc_SclLookup(pTime->pRiseTrans, pSlewIn->fall, pLoad->rise) );
|
|
|
|
|
pSlewOut->fall = Abc_MaxFloat( pSlewOut->fall, Abc_SclLookup(pTime->pFallTrans, pSlewIn->rise, pLoad->fall) );
|
2012-08-26 04:00:26 +02:00
|
|
|
}
|
|
|
|
|
}
|
2012-09-20 23:13:59 +02:00
|
|
|
void Abc_SclDeptPin( SC_Man * p, SC_Timing * pTime, Abc_Obj_t * pObj, Abc_Obj_t * pFanin )
|
|
|
|
|
{
|
|
|
|
|
SC_Pair * pDepIn = Abc_SclObjDept( p, pFanin ); // modified
|
|
|
|
|
SC_Pair * pSlewIn = Abc_SclObjSlew( p, pFanin );
|
|
|
|
|
SC_Pair * pLoad = Abc_SclObjLoad( p, pObj );
|
|
|
|
|
SC_Pair * pDepOut = Abc_SclObjDept( p, pObj );
|
|
|
|
|
|
|
|
|
|
if (pTime->tsense == sc_ts_Pos || pTime->tsense == sc_ts_Non)
|
|
|
|
|
{
|
|
|
|
|
pDepIn->rise = Abc_MaxFloat( pDepIn->rise, pDepOut->rise + Abc_SclLookup(pTime->pCellRise, pSlewIn->rise, pLoad->rise) );
|
|
|
|
|
pDepIn->fall = Abc_MaxFloat( pDepIn->fall, pDepOut->fall + Abc_SclLookup(pTime->pCellFall, pSlewIn->fall, pLoad->fall) );
|
|
|
|
|
}
|
|
|
|
|
if (pTime->tsense == sc_ts_Neg || pTime->tsense == sc_ts_Non)
|
|
|
|
|
{
|
|
|
|
|
pDepIn->fall = Abc_MaxFloat( pDepIn->fall, pDepOut->rise + Abc_SclLookup(pTime->pCellRise, pSlewIn->fall, pLoad->rise) );
|
|
|
|
|
pDepIn->rise = Abc_MaxFloat( pDepIn->rise, pDepOut->fall + Abc_SclLookup(pTime->pCellFall, pSlewIn->rise, pLoad->fall) );
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
void Abc_SclTimeGate( SC_Man * p, Abc_Obj_t * pObj, int fDept )
|
2012-08-29 09:48:36 +02:00
|
|
|
{
|
|
|
|
|
SC_Timings * pRTime;
|
|
|
|
|
SC_Timing * pTime;
|
|
|
|
|
SC_Pin * pPin;
|
|
|
|
|
SC_Cell * pCell;
|
|
|
|
|
int k;
|
|
|
|
|
if ( Abc_ObjIsCo(pObj) )
|
|
|
|
|
{
|
2012-09-20 23:13:59 +02:00
|
|
|
if ( !fDept )
|
|
|
|
|
Abc_SclObjDupFanin( p, pObj );
|
2012-08-29 09:48:36 +02:00
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
assert( Abc_ObjIsNode(pObj) );
|
|
|
|
|
// get the library cell
|
|
|
|
|
pCell = Abc_SclObjCell( p, pObj );
|
|
|
|
|
// get the output pin
|
2012-09-25 07:57:01 +02:00
|
|
|
// assert( pCell->n_outputs == 1 );
|
2012-08-29 09:48:36 +02:00
|
|
|
pPin = SC_CellPin( pCell, pCell->n_inputs );
|
|
|
|
|
// compute timing using each fanin
|
|
|
|
|
assert( Vec_PtrSize(pPin->vRTimings) == pCell->n_inputs );
|
2012-09-01 22:47:41 +02:00
|
|
|
SC_PinForEachRTiming( pPin, pRTime, k )
|
2012-08-29 09:48:36 +02:00
|
|
|
{
|
|
|
|
|
assert( Vec_PtrSize(pRTime->vTimings) == 1 );
|
|
|
|
|
pTime = (SC_Timing *)Vec_PtrEntry( pRTime->vTimings, 0 );
|
2012-09-20 23:13:59 +02:00
|
|
|
if ( fDept )
|
|
|
|
|
Abc_SclDeptPin( p, pTime, pObj, Abc_ObjFanin(pObj, k) );
|
|
|
|
|
else
|
|
|
|
|
Abc_SclTimePin( p, pTime, pObj, Abc_ObjFanin(pObj, k) );
|
2012-08-29 09:48:36 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
void Abc_SclTimeCone( SC_Man * p, Vec_Int_t * vCone )
|
|
|
|
|
{
|
2012-08-30 01:20:39 +02:00
|
|
|
int fVerbose = 0;
|
2012-08-29 09:48:36 +02:00
|
|
|
Abc_Obj_t * pObj;
|
|
|
|
|
int i;
|
|
|
|
|
Abc_NtkForEachObjVec( vCone, p->pNtk, pObj, i )
|
2012-08-26 04:00:26 +02:00
|
|
|
{
|
2012-08-30 01:20:39 +02:00
|
|
|
if ( fVerbose && Abc_ObjIsNode(pObj) )
|
|
|
|
|
printf( " Updating node %d with gate %s\n", Abc_ObjId(pObj), Abc_SclObjCell(p, pObj)->pName );
|
|
|
|
|
|
|
|
|
|
if ( fVerbose && Abc_ObjIsNode(pObj) )
|
|
|
|
|
printf( " before (%6.1f ps %6.1f ps) ", Abc_SclObjTimePs(p, pObj, 1), Abc_SclObjTimePs(p, pObj, 0) );
|
2012-08-29 09:48:36 +02:00
|
|
|
|
2012-09-20 23:13:59 +02:00
|
|
|
Abc_SclTimeGate( p, pObj, 0 );
|
2012-08-30 01:20:39 +02:00
|
|
|
|
|
|
|
|
if ( fVerbose && Abc_ObjIsNode(pObj) )
|
|
|
|
|
printf( "after (%6.1f ps %6.1f ps)\n", Abc_SclObjTimePs(p, pObj, 1), Abc_SclObjTimePs(p, pObj, 0) );
|
2012-08-26 04:00:26 +02:00
|
|
|
}
|
|
|
|
|
}
|
2012-09-12 23:39:50 +02:00
|
|
|
void Abc_SclTimeNtkRecompute( SC_Man * p, float * pArea, float * pDelay )
|
2012-08-30 01:20:39 +02:00
|
|
|
{
|
|
|
|
|
Abc_Obj_t * pObj;
|
|
|
|
|
int i;
|
2012-09-12 23:39:50 +02:00
|
|
|
Abc_SclComputeLoad( p );
|
|
|
|
|
Abc_SclManCleanTime( p );
|
2012-08-30 22:58:26 +02:00
|
|
|
Abc_NtkForEachNode1( p->pNtk, pObj, i )
|
2012-09-20 23:13:59 +02:00
|
|
|
Abc_SclTimeGate( p, pObj, 0 );
|
|
|
|
|
Abc_NtkForEachNodeReverse1( p->pNtk, pObj, i )
|
|
|
|
|
Abc_SclTimeGate( p, pObj, 1 );
|
2012-08-30 01:20:39 +02:00
|
|
|
Abc_NtkForEachCo( p->pNtk, pObj, i )
|
|
|
|
|
Abc_SclObjDupFanin( p, pObj );
|
2012-09-12 23:39:50 +02:00
|
|
|
if ( pArea )
|
|
|
|
|
*pArea = Abc_SclGetTotalArea( p );
|
|
|
|
|
if ( pDelay )
|
|
|
|
|
*pDelay = Abc_SclGetMaxDelay( p );
|
2012-08-30 01:20:39 +02:00
|
|
|
}
|
2012-08-26 04:00:26 +02:00
|
|
|
|
2012-08-29 09:48:36 +02:00
|
|
|
/**Function*************************************************************
|
|
|
|
|
|
2012-08-30 01:20:39 +02:00
|
|
|
Synopsis [Prepare timing manager.]
|
2012-08-29 09:48:36 +02:00
|
|
|
|
|
|
|
|
Description []
|
|
|
|
|
|
|
|
|
|
SideEffects []
|
|
|
|
|
|
|
|
|
|
SeeAlso []
|
|
|
|
|
|
|
|
|
|
***********************************************************************/
|
2012-09-04 21:22:59 +02:00
|
|
|
SC_Man * Abc_SclManStart( SC_Lib * pLib, Abc_Ntk_t * pNtk, int fUseWireLoads )
|
2012-08-29 09:48:36 +02:00
|
|
|
{
|
|
|
|
|
SC_Man * p = Abc_SclManAlloc( pLib, pNtk );
|
2012-09-04 21:22:59 +02:00
|
|
|
p->fUseWireLoads = fUseWireLoads;
|
2012-08-29 09:48:36 +02:00
|
|
|
assert( p->vGates == NULL );
|
|
|
|
|
p->vGates = Abc_SclManFindGates( pLib, pNtk );
|
2012-09-12 23:39:50 +02:00
|
|
|
Abc_SclTimeNtkRecompute( p, &p->SumArea0, &p->MaxDelay0 );
|
|
|
|
|
p->SumArea = p->SumArea0;
|
2012-08-29 09:48:36 +02:00
|
|
|
return p;
|
|
|
|
|
}
|
2012-08-29 04:24:13 +02:00
|
|
|
|
2012-08-26 04:00:26 +02:00
|
|
|
/**Function*************************************************************
|
|
|
|
|
|
2012-08-30 01:20:39 +02:00
|
|
|
Synopsis [Printing out timing information for the network.]
|
2012-08-26 04:00:26 +02:00
|
|
|
|
|
|
|
|
Description []
|
|
|
|
|
|
|
|
|
|
SideEffects []
|
|
|
|
|
|
|
|
|
|
SeeAlso []
|
|
|
|
|
|
|
|
|
|
***********************************************************************/
|
2012-09-17 06:40:20 +02:00
|
|
|
void Abc_SclTimePerform( SC_Lib * pLib, Abc_Ntk_t * pNtk, int fUseWireLoads, int fShowAll, int fShort )
|
2012-08-26 04:00:26 +02:00
|
|
|
{
|
|
|
|
|
SC_Man * p;
|
2012-09-04 21:22:59 +02:00
|
|
|
p = Abc_SclManStart( pLib, pNtk, fUseWireLoads );
|
2012-09-17 06:40:20 +02:00
|
|
|
Abc_SclTimeNtkPrint( p, fShowAll, fShort );
|
2012-08-26 04:00:26 +02:00
|
|
|
Abc_SclManFree( p );
|
|
|
|
|
}
|
|
|
|
|
|
2012-08-25 06:31:46 +02:00
|
|
|
|
|
|
|
|
////////////////////////////////////////////////////////////////////////
|
|
|
|
|
/// END OF FILE ///
|
|
|
|
|
////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ABC_NAMESPACE_IMPL_END
|
|
|
|
|
|