fsimInt.h File Reference

#include "aig/saig/saig.h"
#include "fsim.h"

Include dependency graph for fsimInt.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	Fsim_Obj_t_
struct	Fsim_Man_t_

Macros
#define	Fsim_ManForEachObj(p, pObj, i)

Typedefs
typedef typedefABC_NAMESPACE_HEADER_START struct Fsim_Obj_t_	Fsim_Obj_t
	INCLUDES ///.

Functions
void	Fsim_ManFront (Fsim_Man_t *p, int fCompressAig)
	FUNCTION DECLARATIONS ///.
Fsim_Man_t *	Fsim_ManCreate (Aig_Man_t *pAig)
void	Fsim_ManDelete (Fsim_Man_t *p)
void	Fsim_ManTest (Aig_Man_t *pAig)

Macro Definition Documentation

Fsim_ManForEachObj

#define Fsim_ManForEachObj	(		p,
			pObj,
			i )

Value:

    for ( i = 2, p->pDataCur = p->pDataAig, p->iNodePrev = 0, pObj = &p->Obj;\
        i < p->nObjs && Fsim_ManRestoreObj( p, pObj ); i++ )

Definition at line 112 of file fsimInt.h.

#define Fsim_ManForEachObj( p, pObj, i )\
    for ( i = 2, p->pDataCur = p->pDataAig, p->iNodePrev = 0, pObj = &p->Obj;\
        i < p->nObjs && Fsim_ManRestoreObj( p, pObj ); i++ )

Typedef Documentation

Fsim_Obj_t

typedef typedefABC_NAMESPACE_HEADER_START struct Fsim_Obj_t_ Fsim_Obj_t

INCLUDES ///.

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

FileName [fsimInt.h]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Fast sequential AIG simulator.]

Synopsis [Internal declarations.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - June 20, 2005.]

Revision [

Id

fsimInt.h,v 1.00 2005/06/20 00:00:00 alanmi Exp

] PARAMETERS /// BASIC TYPES ///

Definition at line 46 of file fsimInt.h.

Function Documentation

Fsim_ManCreate()

Fsim_Man_t * Fsim_ManCreate ( Aig_Man_t * pAig )

extern

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

Synopsis [Creates fast simulation manager.]

Description []

SideEffects []

SeeAlso []

Definition at line 102 of file fsimMan.c.

{
    Fsim_Man_t * p;
    Aig_Obj_t * pObj;
    int i, nObjs;
    Aig_ManCleanData( pAig );
    p = (Fsim_Man_t *)ABC_ALLOC( Fsim_Man_t, 1 );
    memset( p, 0, sizeof(Fsim_Man_t) );
    p->pAig = pAig;
    p->nPis = Saig_ManPiNum(pAig);
    p->nPos = Saig_ManPoNum(pAig);
    p->nCis = Aig_ManPiNum(pAig);
    p->nCos = Aig_ManPoNum(pAig);
    p->nNodes = Aig_ManNodeNum(pAig);
    nObjs = p->nCis + p->nCos + p->nNodes + 2;
    p->pFans0 = ABC_ALLOC( int, nObjs );
    p->pFans1 = ABC_ALLOC( int, nObjs );
    p->pRefs  = ABC_ALLOC( int, nObjs );
    p->vCis2Ids = Vec_IntAlloc( Aig_ManPiNum(pAig) );
    // add objects (0=unused; 1=const1)
    p->pFans0[0] = p->pFans1[0] = 0;
    p->pFans0[1] = p->pFans1[1] = 0;
    p->pRefs[0] = 0;
    p->nObjs = 2;
    pObj = Aig_ManConst1( pAig );
    pObj->iData = 1;
    p->pRefs[1] = Aig_ObjRefs(pObj);
    if ( p->pRefs[1] )
        p->nCrossCut = 1;
    Aig_ManForEachPi( pAig, pObj, i )
        if ( Aig_ObjRefs(pObj) == 0 )
            Fsim_ManCreate_rec( p, pObj );
    Aig_ManForEachPo( pAig, pObj, i )
        Fsim_ManCreate_rec( p, pObj );
    assert( Vec_IntSize(p->vCis2Ids) == Aig_ManPiNum(pAig) );
    assert( p->nObjs == nObjs );
    // check references
    assert( p->nCrossCut == 0 );
    Aig_ManForEachObj( pAig, pObj, i )
    {
        assert( p->pRefs[pObj->iData] == 0 );
        p->pRefs[pObj->iData] = Aig_ObjRefs(pObj);
    }
    // collect flop outputs
    p->vLos = Vec_IntAlloc( Aig_ManRegNum(pAig) );
    Saig_ManForEachLo( pAig, pObj, i )
        Vec_IntPush( p->vLos, pObj->iData );
    // collect flop inputs
    p->vLis = Vec_IntAlloc( Aig_ManRegNum(pAig) );
    Saig_ManForEachLi( pAig, pObj, i )
        Vec_IntPush( p->vLis, pObj->iData );
    // determine the frontier size
    p->nFront = 1 + (int)(1.1 * p->nCrossCutMax); 
    return p;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Fsim_ManDelete()

void Fsim_ManDelete ( Fsim_Man_t * p )

extern

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

Synopsis [Deletes fast simulation manager.]

Description []

SideEffects []

SeeAlso []

Definition at line 169 of file fsimMan.c.

{
    Vec_IntFree( p->vCis2Ids );
    Vec_IntFree( p->vLos );
    Vec_IntFree( p->vLis );
    ABC_FREE( p->pDataAig2 );
    ABC_FREE( p->pDataAig );
    ABC_FREE( p->pFans0 );
    ABC_FREE( p->pFans1 );
    ABC_FREE( p->pRefs );
    ABC_FREE( p->pDataSim );
    ABC_FREE( p->pDataSimCis );
    ABC_FREE( p->pDataSimCos );
    ABC_FREE( p->pData1 );
    ABC_FREE( p->pData2 );
    ABC_FREE( p );
}

Here is the caller graph for this function:

Fsim_ManFront()

void Fsim_ManFront ( Fsim_Man_t * p, int fCompressAig )

extern

FUNCTION DECLARATIONS ///.

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

Synopsis [Determine the frontier.]

Description []

SideEffects []

SeeAlso []

Definition at line 245 of file fsimFront.c.

{
    Fsim_Obj_t Obj, * pObj = &Obj;
    char * pFront;    // places used for the frontier
    int * pIdToFront; // mapping of nodes into frontier places
    int i, iVar0, iVar1, nCrossCut = 0, nCrossCutMax = 0;
    // start the frontier
    pFront = ABC_CALLOC( char, p->nFront );
    pIdToFront = ABC_ALLOC( int, p->nObjs );
    pIdToFront[0] = -1;
    pIdToFront[1] = -1;
    // add constant node
    p->iNumber = 1;
    if ( p->pRefs[1] )
    {
        pIdToFront[1] = Fsim_ManFrontFindNext( p, pFront );
        nCrossCut = 1;
    }
    // allocate room for data
    if ( fCompressAig )
    {
        p->nDataAig = p->nObjs * 6;
        p->pDataAig = ABC_ALLOC( unsigned char, p->nDataAig );
        p->pDataCur = p->pDataAig;
        p->iNodePrev = 0;
    }
    else
    {
        p->pDataAig2 = ABC_ALLOC( int, 3 * p->nObjs );
        p->pDataCur2 = p->pDataAig2 + 6;
    }
    // iterate through the objects
    for ( i = 2; i < p->nObjs; i++ )
    {
        if ( p->pFans0[i] == 0 ) // ci
        {
            // store node
            pIdToFront[i] = Fsim_ManFrontFindNext( p, pFront );
            pObj->iNode = pIdToFront[i];
            pObj->iFan0 = 0;
            pObj->iFan1 = 0;
            Fsim_ManStoreObj( p, pObj );
            // handle CIs without fanout
            if ( p->pRefs[i] == 0 )
            {
                pFront[pIdToFront[i] % p->nFront] = 0;
                pIdToFront[i] = -1;
            }
        }
        else if ( p->pFans1[i] == 0 ) // co
        {
            assert( p->pRefs[i] == 0 );
            // get the fanin
            iVar0 = Fsim_Lit2Var(p->pFans0[i]);
            assert( pIdToFront[iVar0] > 0 );
            // store node
            pObj->iNode = 0;
            pObj->iFan0 = Fsim_Var2Lit(pIdToFront[iVar0], Fsim_LitIsCompl(p->pFans0[i]));
            pObj->iFan1 = 0;
            Fsim_ManStoreObj( p, pObj );
            // deref the fanin
            if ( --p->pRefs[iVar0] == 0 )
            {
                pFront[pIdToFront[iVar0] % p->nFront] = 0;
                pIdToFront[iVar0] = -1;
                nCrossCut--;
            }
        }
        else
        {
            // get the fanins
            iVar0 = Fsim_Lit2Var(p->pFans0[i]);
            assert( pIdToFront[iVar0] > 0 );
            iVar1 = Fsim_Lit2Var(p->pFans1[i]);
            assert( pIdToFront[iVar1] > 0 );
            // store node
            pIdToFront[i] = Fsim_ManFrontFindNext( p, pFront );
            pObj->iNode = pIdToFront[i];
            pObj->iFan0 = Fsim_Var2Lit(pIdToFront[iVar0], Fsim_LitIsCompl(p->pFans0[i]));
            pObj->iFan1 = Fsim_Var2Lit(pIdToFront[iVar1], Fsim_LitIsCompl(p->pFans1[i]));
            Fsim_ManStoreObj( p, pObj );
            // deref the fanins
            if ( --p->pRefs[iVar0] == 0 )
            {
                pFront[pIdToFront[iVar0] % p->nFront] = 0;
                pIdToFront[iVar0] = -1;
                nCrossCut--;
            }
            if ( --p->pRefs[iVar1] == 0 )
            {
                pFront[pIdToFront[iVar1] % p->nFront] = 0;
                pIdToFront[iVar1] = -1;
                nCrossCut--;
            }
            // handle nodes without fanout (choice nodes)
            if ( p->pRefs[i] == 0 )
            {
                pFront[pIdToFront[i] % p->nFront] = 0;
                pIdToFront[i] = -1;
            }
        }
        if ( p->pRefs[i] )
            if ( nCrossCutMax < ++nCrossCut )
                nCrossCutMax = nCrossCut;
    }
    assert( p->pDataAig2 == NULL || p->pDataCur2 - p->pDataAig2 == (3 * p->nObjs) );
    assert( nCrossCut == 0 );
    assert( nCrossCutMax == p->nCrossCutMax );
    for ( i = 0; i < p->nFront; i++ )
        assert( pFront[i] == 0 );
    ABC_FREE( pFront );
    ABC_FREE( pIdToFront );
//    Fsim_ManVerifyFront( p );
    ABC_FREE( p->pFans0 );
    ABC_FREE( p->pFans1 );
    ABC_FREE( p->pRefs );
}

Here is the caller graph for this function:

Fsim_ManTest()

void Fsim_ManTest ( Aig_Man_t * pAig )

extern

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

Synopsis [Testing procedure.]

Description []

SideEffects []

SeeAlso []

Definition at line 198 of file fsimMan.c.

{
    Fsim_Man_t * p;
    p = Fsim_ManCreate( pAig );
    Fsim_ManFront( p, 0 );
    Fsim_ManDelete( p );
}

Here is the call graph for this function: