giaDecs.c File Reference

#include "aig/gia/gia.h"
#include "misc/util/utilTruth.h"
#include "misc/extra/extra.h"
#include "bool/bdc/bdc.h"
#include "bool/kit/kit.h"

Include dependency graph for giaDecs.c:

Go to the source code of this file.

Functions
ABC_NAMESPACE_IMPL_START void	Extra_BitMatrixTransposeP (Vec_Wrd_t *vSimsIn, int nWordsIn, Vec_Wrd_t *vSimsOut, int nWordsOut)
	DECLARATIONS ///.
Vec_Int_t *	Gia_ManResubOne (Vec_Ptr_t *vDivs, int nWords, int nLimit, int nDivsMax, int iChoice, int fUseXor, int fDebug, int fVerbose, word *pFunc, int Depth)
int	Gia_ResubVarNum (Vec_Int_t *vResub)
	FUNCTION DEFINITIONS ///.
word	Gia_ResubToTruth6_rec (Vec_Int_t *vResub, int iNode, int nVars)
word	Gia_ResubToTruth6 (Vec_Int_t *vResub)
Vec_Wrd_t *	Gia_ManDeriveTruths (Gia_Man_t *p, Vec_Wrd_t *vSims, Vec_Wrd_t *vIsfs, Vec_Int_t *vCands, Vec_Int_t *vSet, int nWords)
int	Gia_ManCountResub (Vec_Wrd_t *vTruths, int nVars, int fVerbose)
Vec_Int_t *	Gia_ManDeriveResub (Vec_Wrd_t *vTruths, int nVars)
int	Gia_ManCountBidec (Vec_Wrd_t *vTruths, int nVars, int fVerbose)
Vec_Int_t *	Gia_ManDeriveBidec (Vec_Wrd_t *vTruths, int nVars)
int	Gia_ManCountIsop (Vec_Wrd_t *vTruths, int nVars, int fVerbose)
Vec_Int_t *	Gia_ManDeriveIsop (Vec_Wrd_t *vTruths, int nVars)
int	Gia_ManCountBdd (Vec_Wrd_t *vTruths, int nVars, int fVerbose)
Vec_Int_t *	Gia_ManDeriveBdd (Vec_Wrd_t *vTruths, int nVars)
int	Gia_ManEvalSolutionOne (Gia_Man_t *p, Vec_Wrd_t *vSims, Vec_Wrd_t *vIsfs, Vec_Int_t *vCands, Vec_Int_t *vSet, int nWords, int fVerbose)
Vec_Int_t *	Gia_ManDeriveSolutionOne (Gia_Man_t *p, Vec_Wrd_t *vSims, Vec_Wrd_t *vIsfs, Vec_Int_t *vCands, Vec_Int_t *vSet, int nWords, int Type)

Function Documentation

Extra_BitMatrixTransposeP()

ABC_NAMESPACE_IMPL_START void Extra_BitMatrixTransposeP ( Vec_Wrd_t * vSimsIn, int nWordsIn, Vec_Wrd_t * vSimsOut, int nWordsOut )

extern

DECLARATIONS ///.

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

FileName [giaDecs.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Scalable AIG package.]

Synopsis [Calling various decomposition engines.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

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

Revision [

Id

giaDecs.c,v 1.00 2005/06/20 00:00:00 alanmi Exp

]

Definition at line 2652 of file extraUtilMisc.c.

{    
    word * pM[64];  int i, y, x;
    assert( Vec_WrdSize(vSimsIn) == Vec_WrdSize(vSimsOut) );
    assert( Vec_WrdSize(vSimsIn) == 64 * nWordsIn * nWordsOut );
    for ( x = 0; x < nWordsOut; x++ )
    for ( y = 0; y < nWordsIn;  y++ )
    {
        for ( i = 0; i < 64; i++ )
        {
            pM[i]    = Vec_WrdEntryP( vSimsOut, (64*y+63-i)*nWordsOut + x );
            pM[i][0] = Vec_WrdEntry ( vSimsIn,  (64*x+63-i)*nWordsIn  + y );
        }
        Extra_Transpose64p( pM );
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManCountBdd()

int Gia_ManCountBdd	(	Vec_Wrd_t *	vTruths,
		int	nVars,
		int	fVerbose )

Definition at line 227 of file giaDecs.c.

{
    extern Gia_Man_t * Gia_TryPermOptNew( word * pTruths, int nIns, int nOuts, int nWords, int nRounds, int fVerbose );
    int nTtWords = Abc_Truth6WordNum(nVars);
    word * pTruth[2] = { Vec_WrdEntryP(vTruths, 0*nTtWords), 
                         Vec_WrdEntryP(vTruths, 1*nTtWords) };
    Gia_Man_t * pGia; int nNodes;
 
    Abc_TtOr( pTruth[1], pTruth[1], pTruth[0], nTtWords );
    Abc_TtNot( pTruth[0], nTtWords );
    pGia = Gia_TryPermOptNew( pTruth[0], nVars, 1, nTtWords, 50, 0 );
    Abc_TtNot( pTruth[0], nTtWords );
    Abc_TtSharp( pTruth[1], pTruth[1], pTruth[0], nTtWords );
 
    nNodes = Gia_ManAndNum(pGia);
    Gia_ManStop( pGia );
    return nNodes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManCountBidec()

int Gia_ManCountBidec	(	Vec_Wrd_t *	vTruths,
		int	nVars,
		int	fVerbose )

Definition at line 187 of file giaDecs.c.

{
    int nNodes, nTtWords = Abc_Truth6WordNum(nVars);
    word * pTruth[2] = { Vec_WrdEntryP(vTruths, 0*nTtWords), 
                         Vec_WrdEntryP(vTruths, 1*nTtWords) };
    Abc_TtOr( pTruth[0], pTruth[0], pTruth[1], nTtWords );
    nNodes = Bdc_ManBidecNodeNum( pTruth[1], pTruth[0], nVars, fVerbose );
    Abc_TtSharp( pTruth[0], pTruth[0], pTruth[1], nTtWords );
    return nNodes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManCountIsop()

int Gia_ManCountIsop	(	Vec_Wrd_t *	vTruths,
		int	nVars,
		int	fVerbose )

Definition at line 209 of file giaDecs.c.

{
    int nTtWords = Abc_Truth6WordNum(nVars);
    word * pTruth[2] = { Vec_WrdEntryP(vTruths, 0*nTtWords), 
                         Vec_WrdEntryP(vTruths, 1*nTtWords) };
    int nNodes = Kit_IsopNodeNum( (unsigned *)pTruth[0], (unsigned *)pTruth[1], nVars, NULL );
    return nNodes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManCountResub()

int Gia_ManCountResub	(	Vec_Wrd_t *	vTruths,
		int	nVars,
		int	fVerbose )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 148 of file giaDecs.c.

{
    Vec_Int_t * vResub; int nNodes;
    int nTtWords = Abc_Truth6WordNum(nVars);
    int v, nFuncs = Vec_WrdSize(vTruths) / 2 / nTtWords;
    Vec_Wrd_t * vElems = Vec_WrdStartTruthTables( nVars );
    Vec_Ptr_t * vDivs = Vec_PtrAlloc( 2 + nVars );
    assert( Vec_WrdSize(vElems) == nTtWords * nVars );
    assert( nFuncs == 1 );
    Vec_PtrPush( vDivs, Vec_WrdEntryP(vTruths, (2*0+0)*nTtWords) );
    Vec_PtrPush( vDivs, Vec_WrdEntryP(vTruths, (2*0+1)*nTtWords) );
    for ( v = 0; v < nVars; v++ )
        Vec_PtrPush( vDivs, Vec_WrdEntryP(vElems, v*nTtWords) );
    vResub = Gia_ManResubOne( vDivs, nTtWords, 30, 100, 0, 0, 0, fVerbose, NULL, 0 );
    Vec_PtrFree( vDivs );
    Vec_WrdFree( vElems );
    nNodes = Vec_IntSize(vResub) ? Vec_IntSize(vResub)/2 : 999;
    Vec_IntFree( vResub );
    return nNodes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManDeriveBdd()

Vec_Int_t * Gia_ManDeriveBdd	(	Vec_Wrd_t *	vTruths,
		int	nVars )

Definition at line 245 of file giaDecs.c.

{
    extern Vec_Int_t * Gia_ManToGates( Gia_Man_t * p );
    Vec_Int_t * vRes = NULL;
    extern Gia_Man_t * Gia_TryPermOptNew( word * pTruths, int nIns, int nOuts, int nWords, int nRounds, int fVerbose );
    int nTtWords = Abc_Truth6WordNum(nVars);
    word * pTruth[2] = { Vec_WrdEntryP(vTruths, 0*nTtWords), 
                         Vec_WrdEntryP(vTruths, 1*nTtWords) };
    Gia_Man_t * pGia;
 
    Abc_TtOr( pTruth[1], pTruth[1], pTruth[0], nTtWords );
    Abc_TtNot( pTruth[0], nTtWords );
    pGia = Gia_TryPermOptNew( pTruth[0], nVars, 1, nTtWords, 50, 0 );
    Abc_TtNot( pTruth[0], nTtWords );
    Abc_TtSharp( pTruth[1], pTruth[1], pTruth[0], nTtWords );
 
    vRes = Gia_ManToGates( pGia );
    Gia_ManStop( pGia );
    return vRes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManDeriveBidec()

Vec_Int_t * Gia_ManDeriveBidec	(	Vec_Wrd_t *	vTruths,
		int	nVars )

Definition at line 197 of file giaDecs.c.

{
    Vec_Int_t * vRes = NULL;
    int nTtWords = Abc_Truth6WordNum(nVars);
    word * pTruth[2] = { Vec_WrdEntryP(vTruths, 0*nTtWords), 
                         Vec_WrdEntryP(vTruths, 1*nTtWords) };
    Abc_TtOr( pTruth[0], pTruth[0], pTruth[1], nTtWords );
    vRes = Bdc_ManBidecResub( pTruth[1], pTruth[0], nVars );
    Abc_TtSharp( pTruth[0], pTruth[0], pTruth[1], nTtWords );
    return vRes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManDeriveIsop()

Vec_Int_t * Gia_ManDeriveIsop	(	Vec_Wrd_t *	vTruths,
		int	nVars )

Definition at line 217 of file giaDecs.c.

{
    Vec_Int_t * vRes = NULL;
    int nTtWords = Abc_Truth6WordNum(nVars);
    word * pTruth[2] = { Vec_WrdEntryP(vTruths, 0*nTtWords), 
                         Vec_WrdEntryP(vTruths, 1*nTtWords) };
    vRes = Kit_IsopResub( (unsigned *)pTruth[0], (unsigned *)pTruth[1], nVars, NULL );
    return vRes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManDeriveResub()

Vec_Int_t * Gia_ManDeriveResub	(	Vec_Wrd_t *	vTruths,
		int	nVars )

Definition at line 168 of file giaDecs.c.

{
    Vec_Int_t * vResub;  
    int nTtWords = Abc_Truth6WordNum(nVars);
    int v, nFuncs = Vec_WrdSize(vTruths) / 2 / nTtWords;
    Vec_Wrd_t * vElems = Vec_WrdStartTruthTables( nVars );
    Vec_Ptr_t * vDivs = Vec_PtrAlloc( 2 + nVars );
    assert( Vec_WrdSize(vElems) == nTtWords * nVars );
    assert( nFuncs == 1 );
    Vec_PtrPush( vDivs, Vec_WrdEntryP(vTruths, (2*0+0)*nTtWords) );
    Vec_PtrPush( vDivs, Vec_WrdEntryP(vTruths, (2*0+1)*nTtWords) );
    for ( v = 0; v < nVars; v++ )
        Vec_PtrPush( vDivs, Vec_WrdEntryP(vElems, v*nTtWords) );
    vResub = Gia_ManResubOne( vDivs, nTtWords, 30, 100, 0, 0, 0, 0, NULL, 0 );
    Vec_PtrFree( vDivs );
    Vec_WrdFree( vElems );
    return vResub;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManDeriveSolutionOne()

Vec_Int_t * Gia_ManDeriveSolutionOne	(	Gia_Man_t *	p,
		Vec_Wrd_t *	vSims,
		Vec_Wrd_t *	vIsfs,
		Vec_Int_t *	vCands,
		Vec_Int_t *	vSet,
		int	nWords,
		int	Type )

Definition at line 318 of file giaDecs.c.

{
    Vec_Int_t * vRes = NULL;
    Vec_Wrd_t * vTruths = Gia_ManDeriveTruths( p, vSims, vIsfs, vCands, vSet, nWords );
    int nTtWords = Vec_WrdSize(vTruths)/2, nVars = Vec_IntSize(vSet);
    word * pTruth[2] = { Vec_WrdEntryP(vTruths, 0*nTtWords), 
                         Vec_WrdEntryP(vTruths, 1*nTtWords) };
    if ( Type == 0 )
        vRes = Gia_ManDeriveResub( vTruths, nVars );
    else if ( Type == 1 )
        vRes = Gia_ManDeriveBidec( vTruths, nVars );
    else if ( Type == 2 )
        vRes = Gia_ManDeriveIsop( vTruths, nVars );
    else if ( Type == 3 )
        vRes = Gia_ManDeriveBdd( vTruths, nVars );
    if ( vRes && Gia_ResubVarNum(vRes) <= 6 )
    {
        word Func = Gia_ResubToTruth6( vRes );
        assert( !(Func &  pTruth[0][0]) );
        assert( !(pTruth[1][0] & ~Func) );   
    }
    Vec_WrdFree( vTruths );
    return vRes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManDeriveTruths()

Vec_Wrd_t * Gia_ManDeriveTruths	(	Gia_Man_t *	p,
		Vec_Wrd_t *	vSims,
		Vec_Wrd_t *	vIsfs,
		Vec_Int_t *	vCands,
		Vec_Int_t *	vSet,
		int	nWords )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 95 of file giaDecs.c.

{
    int nTtWords = Abc_Truth6WordNum(Vec_IntSize(vSet));
    int nFuncs = Vec_WrdSize(vIsfs) / 2 / nWords;
    Vec_Wrd_t * vRes = Vec_WrdStart( 2 * nFuncs * nTtWords );
    Vec_Wrd_t * vIn = Vec_WrdStart( 64*nWords ), * vOut;
    int i, f, m, iObj; word Func;
    assert( Vec_IntSize(vSet) <= 64 );
    Vec_IntForEachEntry( vSet, iObj, i )
        Abc_TtCopy( Vec_WrdEntryP(vIn, i*nWords), Vec_WrdEntryP(vSims, Vec_IntEntry(vCands, iObj)*nWords), nWords, 0 );
    vOut = Vec_WrdStart( Vec_WrdSize(vIn) );
    Extra_BitMatrixTransposeP( vIn, nWords, vOut, 1 );
    for ( f = 0; f < nFuncs; f++ )
    {
        word * pIsf[2]   = { Vec_WrdEntryP(vIsfs, (2*f+0)*nWords), 
                             Vec_WrdEntryP(vIsfs, (2*f+1)*nWords) };
        word * pTruth[2] = { Vec_WrdEntryP(vRes, (2*f+0)*nTtWords), 
                             Vec_WrdEntryP(vRes, (2*f+1)*nTtWords) };
        for ( m = 0; m < 64*nWords; m++ )
        {
            int iMint = (int)Vec_WrdEntry(vOut, m);
            int Value0 = Abc_TtGetBit( pIsf[0], m );
            int Value1 = Abc_TtGetBit( pIsf[1], m );
            if ( !Value0 && !Value1 )
                continue;
            if ( Value0 && Value1 )
                printf( "Internal error: Onset and Offset overlap.\n" );
            assert( !Value0 || !Value1 );
            Abc_TtSetBit( pTruth[Value1], iMint );
        }
        if ( Abc_TtCountOnesVecMask(pTruth[0], pTruth[1], nTtWords, 0) )
            printf( "Verification for function %d failed for %d minterm pairs.\n", f,
                Abc_TtCountOnesVecMask(pTruth[0], pTruth[1], nTtWords, 0) );
    }
    if ( Vec_IntSize(vSet) < 6 )
        Vec_WrdForEachEntry( vRes, Func, i )
            Vec_WrdWriteEntry( vRes, i, Abc_Tt6Stretch(Func, Vec_IntSize(vSet)) );
    Vec_WrdFree( vIn );
    Vec_WrdFree( vOut );
    return vRes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManEvalSolutionOne()

int Gia_ManEvalSolutionOne	(	Gia_Man_t *	p,
		Vec_Wrd_t *	vSims,
		Vec_Wrd_t *	vIsfs,
		Vec_Int_t *	vCands,
		Vec_Int_t *	vSet,
		int	nWords,
		int	fVerbose )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 277 of file giaDecs.c.

{
    Vec_Wrd_t * vTruths = Gia_ManDeriveTruths( p, vSims, vIsfs, vCands, vSet, nWords );
    int nTtWords = Vec_WrdSize(vTruths)/2, nVars = Vec_IntSize(vSet);
    word * pTruth[2] = { Vec_WrdEntryP(vTruths, 0*nTtWords), 
                         Vec_WrdEntryP(vTruths, 1*nTtWords) };
    int nNodesResub = Gia_ManCountResub( vTruths, nVars, 0 );
    int nNodesBidec = nVars > 2 ? Gia_ManCountBidec( vTruths, nVars, 0 ) : 999;
    int nNodesIsop  = nVars > 2 ? Gia_ManCountIsop( vTruths, nVars, 0 ) : 999;
    int nNodesBdd   = nVars > 2 ? Gia_ManCountBdd( vTruths, nVars, 0 ) : 999;
    int nNodesMin   = Abc_MinInt( Abc_MinInt(nNodesResub, nNodesBidec), Abc_MinInt(nNodesIsop, nNodesBdd) );
    if ( fVerbose )
    {
        printf( "Size = %2d  ", nVars );
        printf( "Resub =%3d  ", nNodesResub );
        printf( "Bidec =%3d  ", nNodesBidec );
        printf( "Isop =%3d  ",  nNodesIsop );
        printf( "Bdd =%3d  ",   nNodesBdd );
        Abc_TtIsfPrint( pTruth[0], pTruth[1], nTtWords ); 
        if ( nVars <= 6 )
        {
            printf( "  " );
            Extra_PrintHex( stdout, (unsigned*)pTruth[0], nVars );
            printf( "  " );
            Extra_PrintHex( stdout, (unsigned*)pTruth[1], nVars );
        }
        printf( "\n" );
    }
    Vec_WrdFree( vTruths );
    if ( nNodesMin > 500 )
        return -1;
    if ( nNodesMin == nNodesResub )
        return (nNodesMin << 2) | 0;
    if ( nNodesMin == nNodesBidec )
        return (nNodesMin << 2) | 1;
    if ( nNodesMin == nNodesIsop )
        return (nNodesMin << 2) | 2;
    if ( nNodesMin == nNodesBdd )
        return (nNodesMin << 2) | 3;
    return -1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManResubOne()

Vec_Int_t * Gia_ManResubOne ( Vec_Ptr_t * vDivs, int nWords, int nLimit, int nDivsMax, int iChoice, int fUseXor, int fDebug, int fVerbose, word * pFunc, int Depth )

extern

Definition at line 1503 of file giaResub.c.

{
    Vec_Int_t * vRes;
    Gia_ResbMan_t * p = Gia_ResbAlloc( nWords );
    Gia_ManResubPerform( p, vDivs, nWords, nLimit, nDivsMax, iChoice, fUseXor, fDebug, fVerbose, Depth );
    if ( fVerbose )
        Gia_ManResubPrint( p->vGates, Vec_PtrSize(vDivs) );
    //if ( fVerbose )
    //    printf( "\n" );
    if ( !Gia_ManResubVerify(p, pFunc) )
    {
        Gia_ManResubPrint( p->vGates, Vec_PtrSize(vDivs) );
        printf( "Verification FAILED.\n" );
    }
    else if ( fDebug && fVerbose )
        printf( "Verification succeeded." );
    if ( fVerbose )
        printf( "\n" );
    vRes = Vec_IntDup( p->vGates );
    Gia_ResbFree( p );
    return vRes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ResubToTruth6()

word Gia_ResubToTruth6

(

Vec_Int_t *

vResub

)

Definition at line 73 of file giaDecs.c.

{
    word Res;
    int iRoot = Vec_IntEntryLast(vResub);
    if ( iRoot < 2 )
        return iRoot ? ~(word)0 : 0;
    assert( iRoot != 2 && iRoot != 3 );
    Res = Gia_ResubToTruth6_rec( vResub, Abc_Lit2Var(iRoot)-2, Gia_ResubVarNum(vResub) );
    return Abc_LitIsCompl(iRoot) ? ~Res : Res;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ResubToTruth6_rec()

word Gia_ResubToTruth6_rec	(	Vec_Int_t *	vResub,
		int	iNode,
		int	nVars )

Definition at line 57 of file giaDecs.c.

{
    assert( iNode >= 0 && nVars <= 6 );
    if ( iNode < nVars )
        return s_Truths6[iNode];
    else
    {
        int iLit0 = Vec_IntEntry( vResub, Abc_Var2Lit(iNode-nVars, 0) );
        int iLit1 = Vec_IntEntry( vResub, Abc_Var2Lit(iNode-nVars, 1) );
        word Res0 = Gia_ResubToTruth6_rec( vResub, Abc_Lit2Var(iLit0)-2, nVars );
        word Res1 = Gia_ResubToTruth6_rec( vResub, Abc_Lit2Var(iLit1)-2, nVars );
        Res0 = Abc_LitIsCompl(iLit0) ? ~Res0 : Res0;
        Res1 = Abc_LitIsCompl(iLit1) ? ~Res1 : Res1;
        return iLit0 > iLit1 ? Res0 ^ Res1 : Res0 & Res1;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ResubVarNum()

int Gia_ResubVarNum

(

Vec_Int_t *

vResub

)

FUNCTION DEFINITIONS ///.

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 51 of file giaDecs.c.

{
    if ( Vec_IntSize(vResub) == 1 )
        return Vec_IntEntryLast(vResub) >= 2;
    return Vec_IntEntryLast(vResub)/2 - Vec_IntSize(vResub)/2 - 1;
}

Here is the caller graph for this function: