timBox.c File Reference

#include "timInt.h"

Include dependency graph for timBox.c:

Go to the source code of this file.

Functions
ABC_NAMESPACE_IMPL_START void	Tim_ManCreateBox (Tim_Man_t *p, int firstIn, int nIns, int firstOut, int nOuts, int iDelayTable, int fBlack)
	DECLARATIONS ///.
int	Tim_ManBoxForCi (Tim_Man_t *p, int iCi)
int	Tim_ManBoxForCo (Tim_Man_t *p, int iCo)
int	Tim_ManBoxInputFirst (Tim_Man_t *p, int iBox)
int	Tim_ManBoxInputLast (Tim_Man_t *p, int iBox)
int	Tim_ManBoxOutputFirst (Tim_Man_t *p, int iBox)
int	Tim_ManBoxOutputLast (Tim_Man_t *p, int iBox)
int	Tim_ManBoxInputNum (Tim_Man_t *p, int iBox)
int	Tim_ManBoxOutputNum (Tim_Man_t *p, int iBox)
int	Tim_ManBoxDelayTableId (Tim_Man_t *p, int iBox)
float *	Tim_ManBoxDelayTable (Tim_Man_t *p, int iBox)
int	Tim_ManBoxIsBlack (Tim_Man_t *p, int iBox)
int	Tim_ManBoxCopy (Tim_Man_t *p, int iBox)
void	Tim_ManBoxSetCopy (Tim_Man_t *p, int iBox, int iCopy)
int	Tim_ManBoxFindFromCiNum (Tim_Man_t *p, int iCiNum)

Function Documentation

Tim_ManBoxCopy()

int Tim_ManBoxCopy	(	Tim_Man_t *	p,
		int	iBox )

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

Synopsis [Returns the copy of the box.]

Description []

SideEffects []

SeeAlso []

Definition at line 275 of file timBox.c.

{
    return Tim_ManBox(p, iBox)->iCopy;
}

Here is the caller graph for this function:

Tim_ManBoxDelayTable()

float * Tim_ManBoxDelayTable	(	Tim_Man_t *	p,
		int	iBox )

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

Synopsis [Return the delay table.]

Description []

SideEffects []

SeeAlso []

Definition at line 235 of file timBox.c.

{
    float * pTable;
    Tim_Box_t * pBox = Tim_ManBox(p, iBox);
    if ( pBox->iDelayTable < 0 )
        return NULL;
    pTable = (float *)Vec_PtrEntry( p->vDelayTables, pBox->iDelayTable );
    assert( (int)pTable[1] == pBox->nInputs );
    assert( (int)pTable[2] == pBox->nOutputs );
    return pTable;
}

Here is the caller graph for this function:

Tim_ManBoxDelayTableId()

int Tim_ManBoxDelayTableId	(	Tim_Man_t *	p,
		int	iBox )

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

Synopsis [Return the delay table id.]

Description []

SideEffects []

SeeAlso []

Definition at line 219 of file timBox.c.

{
    return Tim_ManBox(p, iBox)->iDelayTable;
}

Here is the caller graph for this function:

Tim_ManBoxFindFromCiNum()

int Tim_ManBoxFindFromCiNum	(	Tim_Man_t *	p,
		int	iCiNum )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 307 of file timBox.c.

{
    Tim_Box_t * pBox;
    int i;
    assert( iCiNum >= 0 && iCiNum < Tim_ManCiNum(p) );
    if ( iCiNum < Tim_ManPiNum(p) )
        return -1;
    Tim_ManForEachBox( p, pBox, i )
        if ( iCiNum < Tim_ManBoxOutputFirst(p, i) )
            return i - 1;
    return -2;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Tim_ManBoxForCi()

int Tim_ManBoxForCi	(	Tim_Man_t *	p,
		int	iCi )

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

Synopsis [Returns the box number for the given input.]

Description []

SideEffects []

SeeAlso []

Definition at line 87 of file timBox.c.

{
    if ( iCi >= p->nCis )
        return -1;
    return p->pCis[iCi].iObj2Box;
}

Here is the caller graph for this function:

Tim_ManBoxForCo()

int Tim_ManBoxForCo	(	Tim_Man_t *	p,
		int	iCo )

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

Synopsis [Returns the box number for the given output.]

Description []

SideEffects []

SeeAlso []

Definition at line 105 of file timBox.c.

{
    if ( iCo >= p->nCos )
        return -1;
    return p->pCos[iCo].iObj2Box;
}

Here is the caller graph for this function:

Tim_ManBoxInputFirst()

int Tim_ManBoxInputFirst	(	Tim_Man_t *	p,
		int	iBox )

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

Synopsis [Returns the first input of the box.]

Description []

SideEffects []

SeeAlso []

Definition at line 123 of file timBox.c.

{
    return Tim_ManBox(p, iBox)->Inouts[0];
}

Here is the caller graph for this function:

Tim_ManBoxInputLast()

int Tim_ManBoxInputLast	(	Tim_Man_t *	p,
		int	iBox )

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

Synopsis [Returns the last input of the box.]

Description []

SideEffects []

SeeAlso []

Definition at line 139 of file timBox.c.

{
    return Tim_ManBox(p, iBox)->Inouts[0] + Tim_ManBoxInputNum(p, iBox) - 1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Tim_ManBoxInputNum()

int Tim_ManBoxInputNum	(	Tim_Man_t *	p,
		int	iBox )

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

Synopsis [Returns the number of box inputs.]

Description []

SideEffects []

SeeAlso []

Definition at line 187 of file timBox.c.

{
    return Tim_ManBox(p, iBox)->nInputs;
}

Here is the caller graph for this function:

Tim_ManBoxIsBlack()

int Tim_ManBoxIsBlack	(	Tim_Man_t *	p,
		int	iBox )

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

Synopsis [Return 1 if the box is black.]

Description []

SideEffects []

SeeAlso []

Definition at line 258 of file timBox.c.

{
    return Tim_ManBox(p, iBox)->fBlack;
}

Here is the caller graph for this function:

Tim_ManBoxOutputFirst()

int Tim_ManBoxOutputFirst	(	Tim_Man_t *	p,
		int	iBox )

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

Synopsis [Returns the first output of the box.]

Description []

SideEffects []

SeeAlso []

Definition at line 155 of file timBox.c.

{
    return Tim_ManBox(p, iBox)->Inouts[Tim_ManBox(p, iBox)->nInputs];
}

Here is the caller graph for this function:

Tim_ManBoxOutputLast()

int Tim_ManBoxOutputLast	(	Tim_Man_t *	p,
		int	iBox )

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

Synopsis [Returns the last output of the box.]

Description []

SideEffects []

SeeAlso []

Definition at line 171 of file timBox.c.

{
    return Tim_ManBox(p, iBox)->Inouts[Tim_ManBox(p, iBox)->nInputs] + Tim_ManBoxOutputNum(p, iBox) - 1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Tim_ManBoxOutputNum()

int Tim_ManBoxOutputNum	(	Tim_Man_t *	p,
		int	iBox )

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

Synopsis [Returns the number of box outputs.]

Description []

SideEffects []

SeeAlso []

Definition at line 203 of file timBox.c.

{
    return Tim_ManBox(p, iBox)->nOutputs;
}

Here is the caller graph for this function:

Tim_ManBoxSetCopy()

void Tim_ManBoxSetCopy	(	Tim_Man_t *	p,
		int	iBox,
		int	iCopy )

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

Synopsis [Sets the copy of the box.]

Description []

SideEffects []

SeeAlso []

Definition at line 291 of file timBox.c.

{
    Tim_ManBox(p, iBox)->iCopy = iCopy;
}

Here is the caller graph for this function:

Tim_ManCreateBox()

ABC_NAMESPACE_IMPL_START void Tim_ManCreateBox	(	Tim_Man_t *	p,
		int	firstIn,
		int	nIns,
		int	firstOut,
		int	nOuts,
		int	iDelayTable,
		int	fBlack )

DECLARATIONS ///.

ITERATORS ///.

CFile****************************************************************

FileName [timBox.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Hierarchy/timing manager.]

Synopsis [Manipulation of timing boxes.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - April 28, 2007.]

Revision [

Id

timBox.c,v 1.00 2007/04/28 00:00:00 alanmi Exp

] FUNCTION DEFINITIONS /// Function*************************************************************

Synopsis [Creates the new timing box.]

Description []

SideEffects []

SeeAlso []

Definition at line 44 of file timBox.c.

{
    Tim_Box_t * pBox;
    int i;
    if ( p->vBoxes == NULL )
        p->vBoxes = Vec_PtrAlloc( 100 );
    pBox = (Tim_Box_t *)Mem_FlexEntryFetch( p->pMemObj, sizeof(Tim_Box_t) + sizeof(int) * (nIns+nOuts) );
    memset( pBox, 0, sizeof(Tim_Box_t) );
    pBox->iBox = Vec_PtrSize( p->vBoxes );
    Vec_PtrPush( p->vBoxes, pBox );
    pBox->iDelayTable = iDelayTable;
    pBox->nInputs  = nIns;
    pBox->nOutputs = nOuts;
    pBox->fBlack = fBlack;
    for ( i = 0; i < nIns; i++ )
    {
        assert( firstIn+i < p->nCos );
        pBox->Inouts[i] = firstIn+i;
        p->pCos[firstIn+i].iObj2Box = pBox->iBox;
        p->pCos[firstIn+i].iObj2Num = i;
    }
    for ( i = 0; i < nOuts; i++ )
    {
        assert( firstOut+i < p->nCis );
        pBox->Inouts[nIns+i] = firstOut+i;
        p->pCis[firstOut+i].iObj2Box = pBox->iBox;
        p->pCis[firstOut+i].iObj2Num = i;
    }
//    if ( pBox->iBox < 20 )
//        printf( "%4d  %4d  %4d  %4d  \n", firstIn, nIns, firstOut, nOuts );
}

Here is the call graph for this function:

Here is the caller graph for this function: