aigPack.c File Reference

#include "aig.h"

Include dependency graph for aigPack.c:

Go to the source code of this file.

Classes
struct	Aig_ManPack_t_

Typedefs
typedef typedefABC_NAMESPACE_IMPL_START struct Aig_ManPack_t_	Aig_ManPack_t
	DECLARATIONS ///.

Functions
Aig_ManPack_t *	Aig_ManPackAlloc (Aig_Man_t *pAig)
	FUNCTION DEFINITIONS ///.
int	Aig_ManPackCountCares (Aig_ManPack_t *p)
void	Aig_ManPackPrintCare (Aig_ManPack_t *p)
void	Aig_ManPackFree (Aig_ManPack_t *p)
void	Aig_ManPackSetRandom (Aig_ManPack_t *p)
void	Aig_ManPackSimulate (Aig_ManPack_t *p)
void	Aig_ManPackPrintStats (Aig_ManPack_t *p)
Vec_Int_t *	Aig_ManPackConstNodes (Aig_ManPack_t *p)
int	Aig_ManPackAddPatternTry (Aig_ManPack_t *p, int iBit, Vec_Int_t *vLits)
void	Aig_ManPackAddPattern (Aig_ManPack_t *p, Vec_Int_t *vLits)
Aig_ManPack_t *	Aig_ManPackStart (Aig_Man_t *pAig)
void	Aig_ManPackStop (Aig_ManPack_t *p)

Typedef Documentation

Aig_ManPack_t

typedef typedefABC_NAMESPACE_IMPL_START struct Aig_ManPack_t_ Aig_ManPack_t

DECLARATIONS ///.

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

FileName [aigPack.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [AIG package.]

Synopsis [Bit-packing code.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

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

Revision [

Id

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

]

Definition at line 31 of file aigPack.c.

Function Documentation

Aig_ManPackAddPattern()

void Aig_ManPackAddPattern	(	Aig_ManPack_t *	p,
		Vec_Int_t *	vLits )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 326 of file aigPack.c.

{
    int k;
    for ( k = 1; k < 64; k++ )
        if ( Aig_ManPackAddPatternTry( p, k, vLits ) )
            break;
    if ( k == 64 )
    {
/*
        word * pInfo, * pPres;
        int i, Lit;
        Vec_IntForEachEntry( vLits, Lit, i )
            printf( "%d", Abc_LitIsCompl(Lit) );
        printf( "\n\n" );
        for ( k = 1; k < 64; k++ )
        {
            Vec_IntForEachEntry( vLits, Lit, i )
            {
                pInfo = Vec_WrdEntryP( p->vPiPats, Abc_Lit2Var(Lit) );
                pPres = Vec_WrdEntryP( p->vPiCare, Abc_Lit2Var(Lit) );
                if ( Abc_InfoHasBit( (unsigned *)pPres, k ) )
                    printf( "%d", Abc_InfoHasBit( (unsigned *)pInfo, k ) );
                else
                    printf( "-" );
            }
            printf( "\n" );
        }
*/
        p->nPatSkip++;
    }
    p->nPatTotal++;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Aig_ManPackAddPatternTry()

int Aig_ManPackAddPatternTry	(	Aig_ManPack_t *	p,
		int	iBit,
		Vec_Int_t *	vLits )

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

Synopsis [Packs patterns into array of simulation info.]

Description []

SideEffects []

SeeAlso []

                               `

Definition at line 292 of file aigPack.c.

{
    word * pInfo, * pPres;
    int i, Lit;
    Vec_IntForEachEntry( vLits, Lit, i )
    {
        pInfo = Vec_WrdEntryP( p->vPiPats, Abc_Lit2Var(Lit) );
        pPres = Vec_WrdEntryP( p->vPiCare, Abc_Lit2Var(Lit) );
        if ( Abc_InfoHasBit( (unsigned *)pPres, iBit ) && 
             Abc_InfoHasBit( (unsigned *)pInfo, iBit ) == Abc_LitIsCompl(Lit) )
             return 0;
    }
    Vec_IntForEachEntry( vLits, Lit, i )
    {
        pInfo = Vec_WrdEntryP( p->vPiPats, Abc_Lit2Var(Lit) );
        pPres = Vec_WrdEntryP( p->vPiCare, Abc_Lit2Var(Lit) );
        Abc_InfoSetBit( (unsigned *)pPres, iBit );
        if ( Abc_InfoHasBit( (unsigned *)pInfo, iBit ) == Abc_LitIsCompl(Lit) )
             Abc_InfoXorBit( (unsigned *)pInfo, iBit );
    }
    return 1;
}

Here is the caller graph for this function:

Aig_ManPackAlloc()

Aig_ManPack_t * Aig_ManPackAlloc

(

Aig_Man_t *

pAig

)

FUNCTION DEFINITIONS ///.

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 65 of file aigPack.c.

{
    Aig_ManPack_t * p;
    p = ABC_CALLOC( Aig_ManPack_t, 1 );
    p->pAig    = pAig;
    p->vSigns  = Vec_WrdStart( Aig_ManObjNumMax(pAig) );
    p->vPiPats = Vec_WrdStart( Aig_ManCiNum(pAig) );
    p->vPiCare = Vec_WrdStart( Aig_ManCiNum(pAig) );
    p->iPatCur = 1;
    return p;
}

Here is the caller graph for this function:

Aig_ManPackConstNodes()

Vec_Int_t * Aig_ManPackConstNodes

(

Aig_ManPack_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 264 of file aigPack.c.

{
    Vec_Int_t * vNodes;
    Aig_Obj_t * pObj;
    word Sign;
    int i;
    vNodes = Vec_IntAlloc( 1000 );
    Aig_ManForEachNode( p->pAig, pObj, i )
    {
        Sign  = Vec_WrdEntry( p->vSigns, Aig_ObjId(pObj) );
        if ( Sign == 0 || ~Sign == 0 || Aig_Word6HasOneBit(Sign) || Aig_Word6HasOneBit(~Sign) )
            Vec_IntPush( vNodes, Aig_ObjId(pObj) );
    }
    return vNodes;
}

Here is the caller graph for this function:

Aig_ManPackCountCares()

int Aig_ManPackCountCares

(

Aig_ManPack_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 88 of file aigPack.c.

{
    Aig_Obj_t * pObj;
    int i, Total = 0;
    Aig_ManForEachCi( p->pAig, pObj, i )
        Total += Aig_Word6CountOnes( Vec_WrdEntry(p->vPiCare, i) );
    return Total;
}

Here is the caller graph for this function:

Aig_ManPackFree()

void Aig_ManPackFree

(

Aig_ManPack_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 134 of file aigPack.c.

{
//    Aig_ManPackPrintCare( p );
    printf( "Patterns: " );
    printf( "Total = %6d. ",   p->nPatTotal );
    printf( "Skipped = %6d. ", p->nPatSkip );
    printf( "Cares = %6.2f %%  ", 100.0*Aig_ManPackCountCares(p)/Aig_ManCiNum(p->pAig)/64 );
    printf( "\n" );
    Vec_WrdFree( p->vSigns );
    Vec_WrdFree( p->vPiPats );
    Vec_WrdFree( p->vPiCare );
    ABC_FREE( p );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Aig_ManPackPrintCare()

void Aig_ManPackPrintCare

(

Aig_ManPack_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 108 of file aigPack.c.

{
    Aig_Obj_t * pObj;
    word Sign;
    int i;
    Aig_ManForEachCi( p->pAig, pObj, i )
    {
        Sign = Vec_WrdEntry( p->vPiCare, i );
//        Extra_PrintBinary( stdout, (unsigned *)&Sign, 64 );
//        printf( "\n" );
    }
//    printf( "\n" );
}

Aig_ManPackPrintStats()

void Aig_ManPackPrintStats

(

Aig_ManPack_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 227 of file aigPack.c.

{
    word Sign;
    Aig_Obj_t * pObj;
    int i, Total, Count, Counts[33] = {0}; // the number of nodes having that many patterns
    Aig_ManForEachNode( p->pAig, pObj, i )
    {
        Sign  = Vec_WrdEntry( p->vSigns, Aig_ObjId(pObj) );
        Count = Aig_Word6CountOnes( Sign );
        if ( Count > 32 )
            Count = 64 - Count;
        Counts[Count]++;        
    }
    // print statistics
    Total = 0;
    for ( i = 0; i <= 32; i++ )
    {
        Total += Counts[i];
        printf( "%2d : ", i );
        printf( "%6d  ", Counts[i] );
        printf( "%6.1f %%", 100.0*Counts[i]/Aig_ManNodeNum(p->pAig) );
        printf( "%6.1f %%", 100.0*Total/Aig_ManNodeNum(p->pAig) );
        printf( "\n" );
    }
}

Here is the caller graph for this function:

Aig_ManPackSetRandom()

void Aig_ManPackSetRandom

(

Aig_ManPack_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 159 of file aigPack.c.

{
    Aig_Obj_t * pObj;
    word Sign;
    int i;
    Aig_ManForEachCi( p->pAig, pObj, i )
    {
        Sign = (((word)Aig_ManRandom(0)) << 32) | ((word)Aig_ManRandom(0));
        Vec_WrdWriteEntry( p->vPiPats, i, Sign << 1 );
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Aig_ManPackSimulate()

void Aig_ManPackSimulate

(

Aig_ManPack_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 182 of file aigPack.c.

{
    Aig_Obj_t * pObj;
    word Sign, Sign0, Sign1;
    int i;
    // set the constant
    Vec_WrdWriteEntry( p->vSigns, 0, ~(word)0 );
    // transfer into the array
    Aig_ManForEachCi( p->pAig, pObj, i )
        Vec_WrdWriteEntry( p->vSigns, Aig_ObjId(pObj), Vec_WrdEntry(p->vPiPats, i) );
    // simulate internal nodes
    Aig_ManForEachNode( p->pAig, pObj, i )
    {
        Sign0 = Vec_WrdEntry( p->vSigns, Aig_ObjFaninId0(pObj) );
        Sign1 = Vec_WrdEntry( p->vSigns, Aig_ObjFaninId1(pObj) );
        if ( Aig_ObjFaninC0(pObj) && Aig_ObjFaninC1(pObj) )
            Sign = ~(Sign0 | Sign1);
        else if ( Aig_ObjFaninC0(pObj) )
            Sign = ~Sign0 &  Sign1;
        else if ( Aig_ObjFaninC1(pObj) )
            Sign =  Sign0 & ~Sign1;
        else
            Sign =  Sign0 &  Sign1;
        Vec_WrdWriteEntry( p->vSigns, Aig_ObjId(pObj), Sign );
    }
    // set the outputs
    Aig_ManForEachCo( p->pAig, pObj, i )
    {
        Sign0 = Vec_WrdEntry( p->vSigns, Aig_ObjFaninId0(pObj) );
        Sign  = Aig_ObjFaninC0(pObj) ? ~Sign0 : Sign0;
        Vec_WrdWriteEntry( p->vSigns, Aig_ObjId(pObj), Sign );
    }
}

Here is the caller graph for this function:

Aig_ManPackStart()

Aig_ManPack_t * Aig_ManPackStart

(

Aig_Man_t *

pAig

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 370 of file aigPack.c.

{
    Aig_ManPack_t * p;
    p = Aig_ManPackAlloc( pAig );
    Aig_ManPackSetRandom( p );
    Aig_ManPackSimulate( p );
    Aig_ManPackPrintStats( p );
    return p;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Aig_ManPackStop()

void Aig_ManPackStop

(

Aig_ManPack_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 391 of file aigPack.c.

{
    Aig_ManPackSimulate( p );
    Aig_ManPackPrintStats( p );
    Aig_ManPackFree( p );
}

Here is the call graph for this function:

Here is the caller graph for this function: