sfmTim.c File Reference

#include "sfmInt.h"

Include dependency graph for sfmTim.c:

Go to the source code of this file.

Classes
struct	Sfm_Tim_t_
	DECLARATIONS ///. More...

Functions
void	Sfm_TimNodeRequired (Sfm_Tim_t *p, Abc_Obj_t *pNode)
void	Sfm_TimCriticalPath_int (Sfm_Tim_t *p, Abc_Obj_t *pObj, Vec_Int_t *vPath, int SlackMax)
int	Sfm_TimCriticalPath (Sfm_Tim_t *p, int Window)
int	Sfm_TimTrace (Sfm_Tim_t *p)
Sfm_Tim_t *	Sfm_TimStart (Mio_Library_t *pLib, Scl_Con_t *pExt, Abc_Ntk_t *pNtk, int DeltaCrit)
void	Sfm_TimStop (Sfm_Tim_t *p)
int	Sfm_TimReadNtkDelay (Sfm_Tim_t *p)
int	Sfm_TimReadObjDelay (Sfm_Tim_t *p, int iObj)
void	Sfm_TimTest (Abc_Ntk_t *pNtk)
void	Sfm_TimUpdateTiming (Sfm_Tim_t *p, Vec_Int_t *vTimeNodes)
int	Sfm_TimSortArrayByArrival (Sfm_Tim_t *p, Vec_Int_t *vNodes, int iPivot)
int	Sfm_TimPriorityNodes (Sfm_Tim_t *p, Vec_Int_t *vCands, int Window)
int	Sfm_TimNodeIsNonCritical (Sfm_Tim_t *p, Abc_Obj_t *pPivot, Abc_Obj_t *pNode)
int	Sfm_TimEvalRemapping (Sfm_Tim_t *p, Vec_Int_t *vFanins, Vec_Int_t *vMap, Mio_Gate_t *pGate1, char *pFans1, Mio_Gate_t *pGate2, char *pFans2)

Function Documentation

Sfm_TimCriticalPath()

int Sfm_TimCriticalPath	(	Sfm_Tim_t *	p,
		int	Window )

Definition at line 172 of file sfmTim.c.

{
    int i, SlackMax = p->Delay * Window / 100;
    Abc_Obj_t * pObj, * pNext; 
    Vec_IntClear( &p->vPath );
    Abc_NtkIncrementTravId( p->pNtk ); 
    Abc_NtkForEachCo( p->pNtk, pObj, i )
    {
        pNext = Abc_ObjFanin0(pObj);
        if ( Abc_ObjIsCi(pNext) || Abc_ObjFaninNum(pNext) == 0 )
            continue;
        assert( Abc_ObjIsNode(pNext) );
        if ( Sfm_TimSlack(p, pNext) <= SlackMax )
            Sfm_TimCriticalPath_int( p, pNext, &p->vPath, SlackMax );
    }
    return Vec_IntSize(&p->vPath);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Sfm_TimCriticalPath_int()

void Sfm_TimCriticalPath_int	(	Sfm_Tim_t *	p,
		Abc_Obj_t *	pObj,
		Vec_Int_t *	vPath,
		int	SlackMax )

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 154 of file sfmTim.c.

{
    Abc_Obj_t * pNext; int i;
    if ( Abc_NodeIsTravIdCurrent( pObj ) )
        return;
    Abc_NodeSetTravIdCurrent( pObj );
    assert( Abc_ObjIsNode(pObj) );
    Abc_ObjForEachFanin( pObj, pNext, i )
    {
        if ( Abc_ObjIsCi(pNext) || Abc_ObjFaninNum(pNext) == 0 )
            continue;
        assert( Abc_ObjIsNode(pNext) );
        if ( Sfm_TimSlack(p, pNext) <= SlackMax )
            Sfm_TimCriticalPath_int( p, pNext, vPath, SlackMax );
    }
    if ( Abc_ObjFaninNum(pObj) > 0 )
        Vec_IntPush( vPath, Abc_ObjId(pObj) );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Sfm_TimEvalRemapping()

int Sfm_TimEvalRemapping	(	Sfm_Tim_t *	p,
		Vec_Int_t *	vFanins,
		Vec_Int_t *	vMap,
		Mio_Gate_t *	pGate1,
		char *	pFans1,
		Mio_Gate_t *	pGate2,
		char *	pFans2 )

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 428 of file sfmTim.c.

{
    int TimeOut[2][2];
    int * pTimesIn1[6], * pTimesIn2[6];
    int i, nFanins1, nFanins2;
    // process the first gate
    nFanins1 = Mio_GateReadPinNum( pGate1 );
    for ( i = 0; i < nFanins1; i++ )
        pTimesIn1[i] = Sfm_TimArrId( p, Vec_IntEntry(vMap, Vec_IntEntry(vFanins, (int)pFans1[i])) );
    Sfm_TimGateArrival( p, pGate1, pTimesIn1, TimeOut[0] );
    if ( pGate2 == NULL )
        return Abc_MaxInt(TimeOut[0][0], TimeOut[0][1]);
    // process the second gate
    nFanins2 = Mio_GateReadPinNum( pGate2 );
    for ( i = 0; i < nFanins2; i++ )
        if ( (int)pFans2[i] == 16 )
            pTimesIn2[i] = TimeOut[0];
        else
            pTimesIn2[i] = Sfm_TimArrId( p, Vec_IntEntry(vMap, Vec_IntEntry(vFanins, (int)pFans2[i])) );
    Sfm_TimGateArrival( p, pGate2, pTimesIn2, TimeOut[1] );
    return Abc_MaxInt(TimeOut[1][0], TimeOut[1][1]);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Sfm_TimNodeIsNonCritical()

int Sfm_TimNodeIsNonCritical	(	Sfm_Tim_t *	p,
		Abc_Obj_t *	pPivot,
		Abc_Obj_t *	pNode )

Function*************************************************************

Synopsis [Returns 1 if node is relatively non-critical compared to the pivot.]

Description []

SideEffects []

SeeAlso []

Definition at line 412 of file sfmTim.c.

{
    return Sfm_TimArrMax(p, pNode) + p->DeltaCrit <= Sfm_TimArrMax(p, pPivot);
}

Sfm_TimNodeRequired()

void Sfm_TimNodeRequired	(	Sfm_Tim_t *	p,
		Abc_Obj_t *	pNode )

Definition at line 132 of file sfmTim.c.

{
    int i, iFanin, * pTimesIn[6];
    int * pTimeOut = Sfm_TimReq(p, pNode);
    assert( Abc_ObjFaninNum(pNode) <= 6 );
    Abc_ObjForEachFaninId( pNode, iFanin, i )
        pTimesIn[i] = Sfm_TimReqId( p, iFanin );
    Sfm_TimGateRequired( p, (Mio_Gate_t *)pNode->pData, pTimesIn, pTimeOut );
}

Here is the caller graph for this function:

Sfm_TimPriorityNodes()

int Sfm_TimPriorityNodes	(	Sfm_Tim_t *	p,
		Vec_Int_t *	vCands,
		int	Window )

Function*************************************************************

Synopsis [Priority of nodes to try remapping for delay.]

Description []

SideEffects []

SeeAlso []

Definition at line 374 of file sfmTim.c.

{
    Vec_Int_t * vLevel;
    Abc_Obj_t * pObj;
    int i, k;
    assert( Window >= 0 && Window <= 100 );
    // collect critical path
    Sfm_TimCriticalPath( p, Window );
    // add nodes to the levelized structure
    Sfm_TimUpdateClean( p );
    Abc_NtkForEachObjVec( &p->vPath, p->pNtk, pObj, i )
    {
        assert( pObj->fMarkC == 0 );
        pObj->fMarkC = 1;
        Vec_WecPush( &p->vLevels, Abc_ObjLevel(pObj), Abc_ObjId(pObj) );
    }
    // prioritize nodes by expected gain
    Vec_WecSort( &p->vLevels, 0 );
    Vec_IntClear( vCands );
    Vec_WecForEachLevel( &p->vLevels, vLevel, i )
        Abc_NtkForEachObjVec( vLevel, p->pNtk, pObj, k )
            if ( !pObj->fMarkA )
                Vec_IntPush( vCands, Abc_ObjId(pObj) );
//    printf( "Path = %5d   Cand = %5d\n", Vec_IntSize(&p->vPath) );
    return Vec_IntSize(vCands) > 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Sfm_TimReadNtkDelay()

int Sfm_TimReadNtkDelay

(

Sfm_Tim_t *

p

)

Definition at line 251 of file sfmTim.c.

{
    return p->Delay;
}

Sfm_TimReadObjDelay()

int Sfm_TimReadObjDelay	(	Sfm_Tim_t *	p,
		int	iObj )

Definition at line 255 of file sfmTim.c.

{
    return Sfm_TimArrMaxId(p, iObj);
}

Sfm_TimSortArrayByArrival()

int Sfm_TimSortArrayByArrival	(	Sfm_Tim_t *	p,
		Vec_Int_t *	vNodes,
		int	iPivot )

Function*************************************************************

Synopsis [Sort an array of nodes using their max arrival times.]

Description [Returns the number of new divisor nodes.]

SideEffects []

SeeAlso []

Definition at line 336 of file sfmTim.c.

{
    word Entry; 
    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 )
    {
        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
    Vec_IntClear( vNodes );
    Vec_WrdForEachEntry( &p->vSortData, Entry, i )
    {
        Vec_IntPush( vNodes, (int)(Entry >> 32) );
        if ( nDivNew == -1 && ((int)Entry) + p->DeltaCrit > MaxDelay )
            nDivNew = i;
    }
    return nDivNew;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Sfm_TimStart()

Sfm_Tim_t * Sfm_TimStart	(	Mio_Library_t *	pLib,
		Scl_Con_t *	pExt,
		Abc_Ntk_t *	pNtk,
		int	DeltaCrit )

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 229 of file sfmTim.c.

{
    Sfm_Tim_t * p = ABC_CALLOC( Sfm_Tim_t, 1 );
    p->pLib = pLib;
    p->pExt = pExt;
    p->pNtk = pNtk;
    Vec_IntFill( &p->vTimArrs,  3*Abc_NtkObjNumMax(pNtk), 0 );
    Vec_IntFill( &p->vTimReqs,  3*Abc_NtkObjNumMax(pNtk), 0 );
    p->Delay = Sfm_TimTrace( p );
    assert( DeltaCrit > 0 && DeltaCrit < Scl_Flt2Int(1000.0) );
    p->DeltaCrit = DeltaCrit;
    return p;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Sfm_TimStop()

void Sfm_TimStop

(

Sfm_Tim_t *

p

)

Definition at line 242 of file sfmTim.c.

{
    Vec_IntErase( &p->vTimArrs );
    Vec_IntErase( &p->vTimReqs );
    Vec_WecErase( &p->vLevels );
    Vec_IntErase( &p->vPath );
    Vec_WrdErase( &p->vSortData );
    ABC_FREE( p );
}

Here is the caller graph for this function:

Sfm_TimTest()

void Sfm_TimTest

(

Abc_Ntk_t *

pNtk

)

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 271 of file sfmTim.c.

{
    Mio_Library_t * pLib = (Mio_Library_t *)pNtk->pManFunc;
    Sfm_Tim_t * p = Sfm_TimStart( pLib, NULL, pNtk, 100 );
    printf( "Max delay = %.2f.  Path = %d (%d).\n", Scl_Int2Flt(p->Delay), Sfm_TimCriticalPath(p, 1), Abc_NtkNodeNum(p->pNtk) );
    Sfm_TimStop( p );
}

Here is the call graph for this function:

Sfm_TimTrace()

int Sfm_TimTrace

(

Sfm_Tim_t *

p

)

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 201 of file sfmTim.c.

{
    Abc_Obj_t * pObj; int i, Delay = 0;
    Vec_Ptr_t * vNodes = Abc_NtkDfs( p->pNtk, 1 );
    Vec_PtrForEachEntry( Abc_Obj_t *, vNodes, pObj, i )
        Sfm_TimNodeArrival( p, pObj );
    Abc_NtkForEachCo( p->pNtk, pObj, i )
        Delay = Abc_MaxInt( Delay, Sfm_TimArrMax(p, Abc_ObjFanin0(pObj)) );
    Vec_IntFill( &p->vTimReqs, 2*Abc_NtkObjNumMax(p->pNtk), ABC_INFINITY );
    Abc_NtkForEachCo( p->pNtk, pObj, i )
        Sfm_TimSetReq( p, Abc_ObjFanin0(pObj), Delay );
    Vec_PtrForEachEntryReverse( Abc_Obj_t *, vNodes, pObj, i )
        Sfm_TimNodeRequired( p, pObj );
    Vec_PtrFree( vNodes );
    return Delay;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Sfm_TimUpdateTiming()

void Sfm_TimUpdateTiming	(	Sfm_Tim_t *	p,
		Vec_Int_t *	vTimeNodes )

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 317 of file sfmTim.c.

{
    assert( Vec_IntSize(vTimeNodes) > 0 && Vec_IntSize(vTimeNodes) <= 2 );
    Vec_IntFillExtra( &p->vTimArrs, 2*Abc_NtkObjNumMax(p->pNtk), 0 );
    Vec_IntFillExtra( &p->vTimReqs, 2*Abc_NtkObjNumMax(p->pNtk), 0 );
    p->Delay = Sfm_TimTrace( p );
}

Here is the call graph for this function:

Here is the caller graph for this function: