giaGen.c File Reference

#include "gia.h"
#include "misc/util/utilTruth.h"
#include "misc/extra/extra.h"

Include dependency graph for giaGen.c:

Go to the source code of this file.

Functions
ABC_NAMESPACE_IMPL_START Gia_Man_t *	Gia_DeriveAig (Vec_Wrd_t *vSims, Vec_Str_t *vSimsOut)
	DECLARATIONS ///.
void	Gia_DeriveAigTest ()
int	Gia_ManSimulateWords (Gia_Man_t *p, int nWords)
int	Gia_ManSimulateWordsInit (Gia_Man_t *p, Vec_Wrd_t *vSimsIn)
Vec_Wrd_t *	Gia_ManSimulateWordsOut (Gia_Man_t *p, Vec_Wrd_t *vSimsIn)
void	Gia_ManDumpFiles (Gia_Man_t *p, int nCexesT, int nCexesV, int Seed, char *pFileName)
void	Gia_ManDumpPlaFiles (Gia_Man_t *p, int nCexesT, int nCexesV, int Seed, char *pFileName)
void	Gia_ManSimLogStats (Gia_Man_t *p, char *pDumpFile, int Total, int Correct, int Guess)
int	Gia_ManSimParamRead (char *pFileName, int *pnIns, int *pnWords)
void	Gia_ManSimFileRead (char *pFileName, int nIns, int nWords, Vec_Wrd_t *vSimsIn, Vec_Int_t *vValues)
void	Gia_ManCompareValues (Gia_Man_t *p, Vec_Wrd_t *vSimsIn, Vec_Int_t *vValues, char *pDumpFile)
void	Gia_ManReadSimFile (char *pFileName, int *pnIns, int *pnOuts, int *pnPats, Vec_Wrd_t **pvSimsIn, Vec_Wrd_t **pvSimsOut)
int	Gia_ManReadBinaryFile (char *pFileName, Vec_Wrd_t **pvSimsIn, Vec_Str_t **pvSimsOut)
void	Gia_ManSimLogStats2 (Gia_Man_t *p, char *pDumpFile, int Total, int nPositives, float ErrorTotal, float GuessTotal)
int	Gia_ManGetExampleValue (word **ppSims, int nSims, int iExample)
void	Gia_ManCompareValues2 (int nInputs, Gia_Man_t *p, Vec_Wrd_t *vSimsIn, Vec_Str_t *vValues, char *pDumpFile)
void	Gia_ManTestWordFileUnused (Gia_Man_t *p, char *pFileName, char *pDumpFile)
void	Gia_ManTestOneFile (Gia_Man_t *p, char *pFileName, char *pDumpFile)
int	Gia_ManReadCifar10File (char *pFileName, Vec_Wrd_t **pvSimsIn, Vec_Str_t **pvSimsOut, int *pnExamples)
int	Gia_ManSimulateBatch (Gia_Man_t *p, Vec_Wrd_t *vSimsIn, Vec_Str_t *vSimsOut, Vec_Str_t *vSimsOut2, int b, int Limit)
Vec_Str_t *	Gia_ManSimulateAll (Gia_Man_t *p, Vec_Wrd_t *vSimsIn, Vec_Str_t *vSimsOut, int nExamples, int fVerbose)
void	Gia_ManCompareCifar10Values (Gia_Man_t *p, Vec_Str_t *vRes, Vec_Str_t *vSimsOut, char *pDumpFile, int nExamples)
void	Gia_ManTestWordFile (Gia_Man_t *p, char *pFileName, char *pDumpFile, int fVerbose)
int	Gia_ManSumCount (char *p, Vec_Int_t *vDec, int b)
Vec_Str_t *	Gia_ManSumEnum_rec (int Num)
void	Gia_ManSumEnum (int n, Vec_Int_t *vDec)
Vec_Int_t *	Gia_ManSumGenDec (int n)
void	Gia_ManSumEnumTest ()
void	Gia_ManGenNeuronDumpVerilog (Vec_Wrd_t *vData, int nIBits, int nOBits)
void	Gia_ManGenNeuronAdder (Gia_Man_t *p, int nLits, int *pLitsA, int *pLitsB, int Carry, Vec_Int_t *vRes)
void	Gia_ManGenCompact (Gia_Man_t *p, Vec_Int_t *vIn0, Vec_Int_t *vIn1, Vec_Int_t *vIn2, Vec_Int_t *vOut0, Vec_Int_t *vOut1)
Vec_Wec_t *	Gia_ManGenNeuronCreateArgs (Vec_Wrd_t *vData, int nIBits, int nOBits)
Vec_Wec_t *	Gia_ManGenNeuronTransformArgs (Gia_Man_t *pNew, Vec_Wec_t *vArgs, int nLutSize, int nOBits)
Vec_Wec_t *	Gia_ManGenNeuronCompactArgs (Gia_Man_t *pNew, Vec_Wec_t *vArgs, int nLutSize, int nOBits)
Vec_Int_t *	Gia_ManGenNeuronFinal (Gia_Man_t *pNew, Vec_Wec_t *vArgs, int nOBits)
int	Gia_ManGenNeuronBitWidth (Vec_Wrd_t *vData, int nIBits)
Gia_Man_t *	Gia_ManGenNeuron (char *pFileName, int nIBits, int nLutSize, int fDump, int fVerbose)
Gia_Man_t *	Gia_ManDupGenComp (int nBits, int fInterleave)
Vec_Int_t *	Gia_GenDecoder (Gia_Man_t *p, int *pLits, int nLits)
Gia_Man_t *	Gia_ManGenMux (int nIns, char *pNums)
Gia_Man_t *	Gia_ManGenSorter (int LogN)
void	Gia_ManGenPrep (int nVars, int **p)
void	Gia_ManGenSK (int nVars, int **p)
void	Gia_ManGenBK (int nVars, int **p)
void	Gia_ManGenHC (int nVars, int **p)
void	Gia_ManGenRca (int nVars, int **p)
void	Gia_ManGenPrint (int nVars, int **p)
void	Gia_ManGenPrefix (Gia_Man_t *pNew, int *p, int *g, int p2, int g2)
Gia_Man_t *	Gia_ManGenAdder (int nVars, int fSK, int fBK, int fHC, int fCarries, int fVerbose)

Function Documentation

Gia_DeriveAig()

ABC_NAMESPACE_IMPL_START Gia_Man_t * Gia_DeriveAig	(	Vec_Wrd_t *	vSims,
		Vec_Str_t *	vSimsOut )

DECLARATIONS ///.

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

FileName [giaGen.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Scalable AIG package.]

Synopsis []

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

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

Revision [

Id

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

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 48 of file giaGen.c.

{
    int nInputs = 32*32*24;
    int nWords  = nInputs/64;
    int nExamps = 64;
    int i, e, iLitOut[10] = {0};
    Gia_Man_t * pNew;
    assert( Vec_WrdSize(vSims) % nInputs == 0 );
    pNew = Gia_ManStart( nInputs * nExamps + 10000 );
    for ( i = 0; i < nInputs; i++ )
        Gia_ManAppendCi( pNew );
    Gia_ManHashStart( pNew );
    for ( e = 0; e < nExamps; e++ )
    {
        int Class = Vec_StrEntry( vSimsOut, e );
        int This = 1;
        word * pSim = Vec_WrdEntryP( vSims, e*nWords );
        for ( i = 0; i < nInputs; i++ )
            This = Gia_ManHashAnd( pNew, This, Abc_Var2Lit(i+1, !Abc_TtGetBit(pSim, i)) );
        assert( Class >= 0 && Class <= 9 );
        iLitOut[Class] = Gia_ManHashOr( pNew, iLitOut[Class], This );
        //printf( "Finished example %d\n", e );
    }
    for ( i = 0; i < 10; i++ )
        Gia_ManAppendCo( pNew, iLitOut[i] );
    //pNew = Gia_ManCleanup( pTemp = pNew );
    //Gia_ManStop( pTemp );
    return pNew;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_DeriveAigTest()

void Gia_DeriveAigTest

(

)

Definition at line 77 of file giaGen.c.

{
    extern int Gia_ManReadCifar10File( char * pFileName, Vec_Wrd_t ** pvSimsIn, Vec_Str_t ** pvSimsOut, int * pnExamples );
    char pFileName[100] = "test";
    Vec_Wrd_t * vSimsIn;
    Vec_Str_t * vSimsOut;
    int nExamples = 0;
    int nInputs = Gia_ManReadCifar10File( pFileName, &vSimsIn, &vSimsOut, &nExamples );
    Gia_Man_t * pThis = Gia_DeriveAig( vSimsIn, vSimsOut );
    Gia_AigerWrite( pThis, "examples64.aig", 0, 0, 0 );
    printf( "Dumped file \"%s\".\n", "examples64.aig" );
    Gia_ManStop( pThis );
    Vec_WrdFree( vSimsIn );
    Vec_StrFree( vSimsOut );
    nInputs = 0;
}

Here is the call graph for this function:

Gia_GenDecoder()

Vec_Int_t * Gia_GenDecoder	(	Gia_Man_t *	p,
		int *	pLits,
		int	nLits )

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

Synopsis [Generates optimized AIG for the decoder and the multiplexer.]

Description []

SideEffects []

SeeAlso []

Definition at line 1249 of file giaGen.c.

{
    if ( nLits == 1 )
    {
        Vec_Int_t * vRes = Vec_IntAlloc( 2 );
        Vec_IntPush( vRes, Abc_LitNot(pLits[0]) );
        Vec_IntPush( vRes, pLits[0] );
        return vRes;
    }
    assert( nLits > 1 );
    int nPart1 = nLits / 2;
    int nPart2 = nLits - nPart1;
    Vec_Int_t * vRes1 = Gia_GenDecoder( p, pLits, nPart1 );
    Vec_Int_t * vRes2 = Gia_GenDecoder( p, pLits+nPart1, nPart2 );
    Vec_Int_t * vRes = Vec_IntAlloc( Vec_IntSize(vRes1) * Vec_IntSize(vRes2) );
    int i, k, Lit1, Lit2;
    Vec_IntForEachEntry( vRes2, Lit2, k )
    Vec_IntForEachEntry( vRes1, Lit1, i )
        Vec_IntPush( vRes, Gia_ManHashAnd(p, Lit1, Lit2) );
    Vec_IntFree( vRes1 );
    Vec_IntFree( vRes2 );
    return vRes;   
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManCompareCifar10Values()

void Gia_ManCompareCifar10Values	(	Gia_Man_t *	p,
		Vec_Str_t *	vRes,
		Vec_Str_t *	vSimsOut,
		char *	pDumpFile,
		int	nExamples )

Definition at line 883 of file giaGen.c.

{
    int i, Guess = (nExamples+9)/10, Count = 0;
    for ( i = 0; i < nExamples; i++ )
    {
        char ValueReal = Vec_StrEntry(vRes,     i);
        char ValueGold = Vec_StrEntry(vSimsOut, i);
        if ( ValueReal == ValueGold )
            Count++;
    }
    printf( "Summary: Total = %6d.  Errors = %6d.  Correct = %6d. (%6.2f %%)   Naive guess = %6d. (%6.2f %%)\n", 
        nExamples, nExamples - Count, 
        Count, 100.0*Count/nExamples,
        Guess, 100.0*Guess/nExamples);
    if ( pDumpFile == NULL )
        return;
    Gia_ManSimLogStats( p, pDumpFile, nExamples, Count, Guess );
    printf( "Finished dumping statistics into file \"%s\".\n", pDumpFile );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManCompareValues()

void Gia_ManCompareValues	(	Gia_Man_t *	p,
		Vec_Wrd_t *	vSimsIn,
		Vec_Int_t *	vValues,
		char *	pDumpFile )

Definition at line 504 of file giaGen.c.

{
    int i, Value, Guess, Count = 0, nWords = Vec_WrdSize(vSimsIn) / Gia_ManCiNum(p);
    word * pSims;
    assert( Vec_IntSize(vValues) == nWords * 64 );
    Gia_ManSimulateWordsInit( p, vSimsIn );
    assert( p->nSimWords == nWords );
    pSims = Gia_ManObjSim( p, Gia_ObjId(p, Gia_ManCo(p, 0)) );
    Vec_IntForEachEntry( vValues, Value, i )
        if ( Abc_TtGetBit(pSims, i) == Value )
            Count++;
    Guess = (Vec_IntSum(vValues) > nWords * 32) ? Vec_IntSum(vValues) : nWords * 64 - Vec_IntSum(vValues);
    printf( "Total = %6d.  Errors = %6d.  Correct = %6d.  (%6.2f %%)   Naive guess = %6d.  (%6.2f %%)\n", 
        Vec_IntSize(vValues), Vec_IntSize(vValues) - Count, 
        Count, 100.0*Count/Vec_IntSize(vValues),
        Guess, 100.0*Guess/Vec_IntSize(vValues));
    if ( pDumpFile == NULL )
        return;
    Gia_ManSimLogStats( p, pDumpFile, Vec_IntSize(vValues), Count, Guess );
    printf( "Finished dumping statistics into file \"%s\".\n", pDumpFile );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManCompareValues2()

void Gia_ManCompareValues2	(	int	nInputs,
		Gia_Man_t *	p,
		Vec_Wrd_t *	vSimsIn,
		Vec_Str_t *	vValues,
		char *	pDumpFile )

Definition at line 680 of file giaGen.c.

{
    float Error1, ErrorTotal = 0, Guess1, GuessTotal = 0;
    int i, o, nPositives = 0, nWords = Vec_WrdSize(vSimsIn) / Gia_ManCiNum(p);
    word ** ppSims = ABC_CALLOC( word *, Gia_ManCoNum(p) );
    Gia_Obj_t * pObj;
    assert( nWords == (1<<10) );
    assert( Vec_WrdSize(vSimsIn) % Gia_ManCiNum(p) == 0 );
    assert( Vec_StrSize(vValues) == (1 << 16) );
    assert( nWords*64 == (1 << 16) );
    // simulate examples given in vSimsIn
    Gia_ManSimulateWordsInit( p, vSimsIn );
    // collect simulation info for the outputs
    assert( p->nSimWords == nWords );
    Gia_ManForEachCo( p, pObj, o )
        ppSims[o] = Gia_ManObjSim( p, Gia_ObjId(p, pObj) );
    // compare the output for each example
    for ( i = 0; i < nWords*64; i++ )
    {
        int ValueGold = (int)Vec_StrEntry( vValues, i );
        int ValueImpl = Gia_ManGetExampleValue( ppSims, Gia_ManCoNum(p), i );
        // compute error for this example
        Error1      = (float)(ValueGold - ValueImpl)/256;
        ErrorTotal += Error1 * Error1;
        // compute error of zero-output
        Guess1      = ValueGold > 0 ? Abc_AbsInt(ValueImpl) : 0;
        GuessTotal += Guess1 * Guess1;
        // count positive values (disregard negative values due to Leaky ReLU)
        nPositives += (int)(ValueGold > 0);
    }
    ABC_FREE( ppSims );
    printf( "Total = %6d.  Positive = %6d.  (%6.2f %%)     Errors = %e.  Guess = %e.  (%6.2f %%)\n", 
        Vec_StrSize(vValues), nPositives, 100.0*nPositives/Vec_StrSize(vValues),
        ErrorTotal,           GuessTotal, 100.0*ErrorTotal/GuessTotal   );
    if ( pDumpFile == NULL )
        return;
    Gia_ManSimLogStats2( p, pDumpFile, Vec_StrSize(vValues), nPositives, ErrorTotal, GuessTotal );
    printf( "Finished dumping statistics into file \"%s\".\n", pDumpFile );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManDumpFiles()

void Gia_ManDumpFiles	(	Gia_Man_t *	p,
		int	nCexesT,
		int	nCexesV,
		int	Seed,
		char *	pFileName )

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

Synopsis [Dump data files.]

Description []

SideEffects []

SeeAlso []

Definition at line 241 of file giaGen.c.

{
    int n, nSize[2] = {nCexesT*64, nCexesV*64};
 
    char pFileNameOutTX[100];
    char pFileNameOutTY[100];
    char pFileNameOutVX[100];
    char pFileNameOutVY[100];
    char pFileNameOut[100];
    
    //sprintf( pFileNameOutTX, "train_%s_%d_%d.data", pFileName ? pFileName : Gia_ManName(p), nSize[0], Gia_ManCiNum(p) );
    //sprintf( pFileNameOutTY, "train_%s_%d_%d.data", pFileName ? pFileName : Gia_ManName(p), nSize[0], Gia_ManCoNum(p) );
    //sprintf( pFileNameOutVX, "test_%s_%d_%d.data",  pFileName ? pFileName : Gia_ManName(p), nSize[1], Gia_ManCiNum(p) );
    //sprintf( pFileNameOutVY, "test_%s_%d_%d.data",  pFileName ? pFileName : Gia_ManName(p), nSize[1], Gia_ManCoNum(p) );
    
    sprintf( pFileNameOutTX, "%s_x.train.data", pFileName ? pFileName : Gia_ManName(p) );
    sprintf( pFileNameOutTY, "%s_y.train.data", pFileName ? pFileName : Gia_ManName(p) );
    sprintf( pFileNameOutVX, "%s_x.test.data",  pFileName ? pFileName : Gia_ManName(p) );
    sprintf( pFileNameOutVY, "%s_y.test.data",  pFileName ? pFileName : Gia_ManName(p) );
 
    Gia_ManRandomW( 1 );
    for ( n = 0; n < Seed; n++ )
        Gia_ManRandomW( 0 );
    for ( n = 0; n < 2; n++ )
    {
        int Res = Gia_ManSimulateWords( p, nSize[n] );
 
        Vec_Bit_t * vBitX = Vec_BitAlloc( nSize[n] * Gia_ManCiNum(p) );
        Vec_Bit_t * vBitY = Vec_BitAlloc( nSize[n] * Gia_ManCoNum(p) );
 
        FILE * pFileOutX  = fopen( n ? pFileNameOutVX : pFileNameOutTX, "wb" );
        FILE * pFileOutY  = fopen( n ? pFileNameOutVY : pFileNameOutTY, "wb" );
 
        int i, k, Id, Num, Value, nBytes;
        for ( k = 0; k < nSize[n]; k++ )
        {
            Gia_ManForEachCiId( p, Id, i )
            {
                Vec_BitPush( vBitX, Abc_TtGetBit(Gia_ManObjSim(p, Id), k) );
                //printf( "%d", Abc_TtGetBit(Gia_ManObjSim(p, Id), k) );
            }
            //printf( " " );
            Gia_ManForEachCoId( p, Id, i )
            {
                Vec_BitPush( vBitY, Abc_TtGetBit(Gia_ManObjSim(p, Id), k) );
                //printf( "%d", Abc_TtGetBit(Gia_ManObjSim(p, Id), k) );
            }
            //printf( "\n" );
        }
        assert( Vec_BitSize(vBitX) <= Vec_BitCap(vBitX) );
        assert( Vec_BitSize(vBitY) <= Vec_BitCap(vBitY) );
 
        Num = 2;               Value = fwrite( &Num, 1, 4, pFileOutX ); assert( Value == 4 );
        Num = nSize[n];        Value = fwrite( &Num, 1, 4, pFileOutX ); assert( Value == 4 );
        Num = Gia_ManCiNum(p); Value = fwrite( &Num, 1, 4, pFileOutX ); assert( Value == 4 );
 
        nBytes = nSize[n] * Gia_ManCiNum(p) / 8;
        assert( nSize[n] * Gia_ManCiNum(p) % 8 == 0 );
        Value = fwrite( Vec_BitArray(vBitX), 1, nBytes, pFileOutX );
        assert( Value == nBytes );
 
        Num = 2;               Value = fwrite( &Num, 1, 4, pFileOutY ); assert( Value == 4 );
        Num = nSize[n];        Value = fwrite( &Num, 1, 4, pFileOutY ); assert( Value == 4 );
        Num = Gia_ManCoNum(p); Value = fwrite( &Num, 1, 4, pFileOutY ); assert( Value == 4 );
 
        nBytes = nSize[n] * Gia_ManCoNum(p) / 8;
        assert( nSize[n] * Gia_ManCoNum(p) % 8 == 0 );
        Value = fwrite( Vec_BitArray(vBitY), 1, nBytes, pFileOutY );
        assert( Value == nBytes );
 
        fclose( pFileOutX );
        fclose( pFileOutY );
 
        Vec_BitFree( vBitX );
        Vec_BitFree( vBitY );
 
        Res = 0;
    }
    printf( "Finished dumping files \"%s\" and \"%s\".\n", pFileNameOutTX, pFileNameOutTY );
    printf( "Finished dumping files \"%s\" and \"%s\".\n", pFileNameOutVX, pFileNameOutVY );
 
    sprintf( pFileNameOut, "%s.flist", pFileName ? pFileName : Gia_ManName(p) );
    {
        FILE * pFile = fopen( pFileNameOut, "wb" );
        fprintf( pFile, "%s\n", pFileNameOutTX );
        fprintf( pFile, "%s\n", pFileNameOutTY );
        fprintf( pFile, "%s\n", pFileNameOutVX );
        fprintf( pFile, "%s\n", pFileNameOutVY );
        fclose( pFile );
        printf( "Finished dumping file list \"%s\".\n", pFileNameOut );
    }
}

Here is the call graph for this function:

Gia_ManDumpPlaFiles()

void Gia_ManDumpPlaFiles	(	Gia_Man_t *	p,
		int	nCexesT,
		int	nCexesV,
		int	Seed,
		char *	pFileName )

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

Synopsis [Dump data files.]

Description []

SideEffects []

SeeAlso []

Definition at line 345 of file giaGen.c.

{
    int n, nSize[3] = {nCexesT, nCexesV, nCexesV};
 
    char pFileNameOut[3][100];
    
    sprintf( pFileNameOut[0], "%s.train.pla", pFileName ? pFileName : Gia_ManName(p) );
    sprintf( pFileNameOut[1], "%s.valid.pla", pFileName ? pFileName : Gia_ManName(p) );
    sprintf( pFileNameOut[2], "%s.test.pla",  pFileName ? pFileName : Gia_ManName(p) );
 
    Gia_ManRandomW( 1 );
    for ( n = 0; n < Seed; n++ )
        Gia_ManRandomW( 0 );
    for ( n = 0; n < 3; n++ )
    {
        int Res = Gia_ManSimulateWords( p, nSize[n] );
        int i, k, Id;
 
        FILE * pFileOut  = fopen( pFileNameOut[n], "wb" );
 
        fprintf( pFileOut, ".i %d\n", Gia_ManCiNum(p) );
        fprintf( pFileOut, ".o %d\n", Gia_ManCoNum(p) );
        fprintf( pFileOut, ".p %d\n", nSize[n]*64 );
        fprintf( pFileOut, ".type fr\n" );
        for ( k = 0; k < nSize[n]*64; k++ )
        {
            Gia_ManForEachCiId( p, Id, i )
            {
                //Vec_BitPush( vBitX, Abc_TtGetBit(Gia_ManObjSim(p, Id), k) );
                fprintf( pFileOut, "%d", Abc_TtGetBit(Gia_ManObjSim(p, Id), k) );
            }
            fprintf( pFileOut, " " );
            Gia_ManForEachCoId( p, Id, i )
            {
                //Vec_BitPush( vBitY, Abc_TtGetBit(Gia_ManObjSim(p, Id), k) );
                fprintf( pFileOut, "%d", Abc_TtGetBit(Gia_ManObjSim(p, Id), k) );
            }
            fprintf( pFileOut, "\n" );
        }
        fprintf( pFileOut, ".e\n" );
 
        fclose( pFileOut );
 
        Res = 0;
    }
    printf( "Finished dumping files: \"%s.{train, valid, test}.pla\".\n", pFileName ? pFileName : Gia_ManName(p) );
}

Here is the call graph for this function:

Gia_ManDupGenComp()

Gia_Man_t * Gia_ManDupGenComp	(	int	nBits,
		int	fInterleave )

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

Synopsis [Generates minimum-node AIG for n-bit comparator (a > b).]

Description []

SideEffects []

SeeAlso []

Definition at line 1195 of file giaGen.c.

{
    Gia_Man_t * pNew, * pTemp; int i, iLit = 1;
    Vec_Int_t * vBitsA = Vec_IntAlloc( nBits + 1 );
    Vec_Int_t * vBitsB = Vec_IntAlloc( nBits + 1 );
    pNew = Gia_ManStart( 6*nBits+10 );
    pNew->pName = Abc_UtilStrsav( "comp" );
    Gia_ManHashAlloc( pNew );
    if ( fInterleave ) {
        for ( i = 0; i < nBits; i++ )
            Vec_IntPush( vBitsA, Gia_ManAppendCi(pNew) ),
            Vec_IntPush( vBitsB, Gia_ManAppendCi(pNew) );
    }
    else {
        for ( i = 0; i < nBits; i++ )
            Vec_IntPush( vBitsA, Gia_ManAppendCi(pNew) );
        for ( i = 0; i < nBits; i++ )
            Vec_IntPush( vBitsB, Gia_ManAppendCi(pNew) );
    }
    Vec_IntPush( vBitsA, 0 );
    Vec_IntPush( vBitsB, 0 );
    for ( i = 0; i < nBits; i++ ) {
        int iLitA0  = Vec_IntEntry(vBitsA, i);
        int iLitA1  = Vec_IntEntry(vBitsA, i+1);
        int iLitB0  = Vec_IntEntry(vBitsB, i);
        int iLitB1  = Vec_IntEntry(vBitsB, i+1);
        int iOrLit0;
        if ( i == 0 )
            iOrLit0 = Gia_ManHashOr(pNew, Abc_LitNotCond(iLitA0, !(i&1)), Abc_LitNotCond(iLitB0, i&1));
        else
            iOrLit0 = Gia_ManHashAnd(pNew, Abc_LitNotCond(iLitA0, !(i&1)), Abc_LitNotCond(iLitB0, i&1));
        int iOrLit1 = Gia_ManHashAnd(pNew, Abc_LitNotCond(iLitA1, !(i&1)), Abc_LitNotCond(iLitB1, i&1));
        int iOrLit  = Gia_ManHashOr(pNew, iOrLit0, iOrLit1 );
        iLit = Gia_ManHashOr(pNew, Abc_LitNot(iLit), iOrLit );
    }
    Gia_ManAppendCo( pNew, Abc_LitNotCond(iLit, nBits&1) );
    pNew = Gia_ManCleanup( pTemp = pNew );
    Gia_ManStop( pTemp );
    Vec_IntFree( vBitsA );
    Vec_IntFree( vBitsB );
    return pNew;        
}

Here is the call graph for this function:

Gia_ManGenAdder()

Gia_Man_t * Gia_ManGenAdder	(	int	nVars,
		int	fSK,
		int	fBK,
		int	fHC,
		int	fCarries,
		int	fVerbose )

Definition at line 1442 of file giaGen.c.

{
    extern void Wlc_BlastFullAdder( Gia_Man_t * pNew, int a, int b, int c, int * pc, int * ps );
    int i, k, nBits = Abc_Base2Log(nVars), nVarsAlloc = (1 << nBits) + 2;
    int ** pStore = (int **)Extra_ArrayAlloc( nVarsAlloc, nVarsAlloc, 4 );
    printf( "Generating %d-bit ", nVars );
    Gia_ManGenPrep( nVars+2, pStore );
    if ( fSK )
        Gia_ManGenSK( nVars, pStore ), printf("Sklansky ");
    else if ( fBK )
        Gia_ManGenBK( nVars, pStore ), printf("Brent-Kung ");
    else if ( fHC )
        Gia_ManGenHC( nVars, pStore ), printf("Huan-Carlsson ");
    else
        Gia_ManGenRca( nVars, pStore ), printf("ripple-carry ");
    printf( "adder with%s carry-in and carry-out\n", fCarries ? "":"out" );
    if ( fVerbose ) Gia_ManGenPrint( nVars, pStore );
    Gia_Man_t * p = Gia_ManStart( 1000 ), * pTemp;
    p->pName = Abc_UtilStrsav( "adder" );    
    int * pLitsI = ABC_CALLOC( int, 2*nVars+10 );
    for ( k = 0; k < nVars; k++ )
        pLitsI[2*k] = Gia_ManAppendCi(p);
    for ( k = 0; k < nVars; k++ )
        pLitsI[2*k+1] = Gia_ManAppendCi(p);
    int Carry = fCarries ? Gia_ManAppendCi(p) : 0;
    Gia_ManHashStart( p );
    for ( k = 0; k < nVars; k++ )
        Wlc_BlastFullAdder( p, pLitsI[2*k], pLitsI[2*k+1], k ? 0 : Carry, &pLitsI[2*k+1], &pLitsI[2*k] );
    int * pLits = ABC_CALLOC( int, 2*nVars+10 );
    memcpy( pLits, pLitsI, sizeof(int)*2*nVars );
    for ( i = 1; i < nVars; i++ )
    for ( k = 1; k < nVars; k++ )
        if ( pStore[i][k] >= 0 )
            Gia_ManGenPrefix( p, &pLits[2*k], &pLits[2*k+1], pLits[2*pStore[i][k]], pLits[2*pStore[i][k]+1] );
    for ( k = 0; k < nVars; k++ ) 
        Gia_ManAppendCo( p, k ? Gia_ManHashXor(p, pLitsI[2*k], pLits[2*(k-1)+1]) : pLitsI[2*k] );
    if ( fCarries )
        Gia_ManAppendCo( p, pLits[2*(k-1)+1] );
    ABC_FREE( pStore );
    ABC_FREE( pLitsI );
    ABC_FREE( pLits );    
    p = Gia_ManCleanup( pTemp = p );
    Gia_ManStop( pTemp );
    return p;
}

Here is the call graph for this function:

Gia_ManGenBK()

void Gia_ManGenBK	(	int	nVars,
		int **	p )

Definition at line 1389 of file giaGen.c.

{
    int i, k, nBits = Abc_Base2Log(nVars);
    nVars = 1 << nBits;
    for ( i = 1; i < nBits; i++ )
        for ( k = (1 << i) - 1; k < nVars; k += (1 << i) )
            p[i][k] = k - (1 << (i-1));
    p[nBits][nVars-1] = (1<<(nBits-1))-1;
    for ( i = 1; i < nBits; i++ )
        for ( k = (1 << i) - 1; k < nVars-(1 << i); k += (1 << i) )
            p[2*nBits-1-i][nVars-1-k+((1<<(i-1))-1)] = nVars-1-k+((1<<(i-1))-1) - (1 << (i-1));
}

Here is the caller graph for this function:

Gia_ManGenCompact()

void Gia_ManGenCompact	(	Gia_Man_t *	p,
		Vec_Int_t *	vIn0,
		Vec_Int_t *	vIn1,
		Vec_Int_t *	vIn2,
		Vec_Int_t *	vOut0,
		Vec_Int_t *	vOut1 )

Definition at line 1055 of file giaGen.c.

{
    extern void Wlc_BlastFullAdder( Gia_Man_t * pNew, int a, int b, int c, int * pc, int * ps );
    assert( Vec_IntSize(vIn0) == Vec_IntSize(vIn1) );
    assert( Vec_IntSize(vIn0) == Vec_IntSize(vIn2) ); 
    Vec_IntPush( vOut1, 0 );
    int i, Lit0, Lit1, Lit2, Out0, Out1;
    Vec_IntForEachEntryThree( vIn0, vIn1, vIn2, Lit0, Lit1, Lit2, i ) {
        Wlc_BlastFullAdder( p, Lit0, Lit1, Lit2, &Out1, &Out0 );
        Vec_IntPush( vOut0, Out0 );
        Vec_IntPush( vOut1, Out1 );        
    }
    Vec_IntPop( vOut1 );
    assert( Vec_IntSize(vIn0) == Vec_IntSize(vOut0) );
    assert( Vec_IntSize(vIn0) == Vec_IntSize(vOut1) ); 
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManGenHC()

void Gia_ManGenHC	(	int	nVars,
		int **	p )

Definition at line 1401 of file giaGen.c.

{
    int i, k, nBits = Abc_Base2Log(nVars);
    nVars = 1 << nBits;
    for ( k = 1; k < nVars; k += 2 )
        p[1][k] = k - 1;      
    for ( i = 2; i <= nBits; i++ )
        for ( k = 1 + (1 << (i-1)); k < nVars; k += 2 )
            p[i][k] = k - (1 << (i-1));
    for ( k = 2; k < nVars; k += 2 )
        p[nBits+1][k] = k - 1;      
}

Here is the caller graph for this function:

Gia_ManGenMux()

Gia_Man_t * Gia_ManGenMux	(	int	nIns,
		char *	pNums )

Definition at line 1272 of file giaGen.c.

{
    Vec_Int_t * vIns  = Vec_IntAlloc( nIns );
    Vec_Int_t * vData = Vec_IntAlloc( 1 << nIns );    
    Gia_Man_t * p = Gia_ManStart( 4*(1 << nIns) + nIns ), * pTemp; 
    int i, iStart = 0, nSize = 1 << nIns;
    p->pName = Abc_UtilStrsav( "mux" );
    for ( i = 0; i < nIns; i++ )
        Vec_IntPush( vIns, Gia_ManAppendCi(p) );
    for ( i = 0; i < nSize; i++ )
        Vec_IntPush( vData, Gia_ManAppendCi(p) );
    Gia_ManHashAlloc( p );
    for ( i = (int)strlen(pNums)-1; i >= 0; i-- )
    {
        int k, b, nBits = (int)(pNums[i] - '0');
        Vec_Int_t * vDec = Gia_GenDecoder( p, Vec_IntEntryP(vIns, iStart), nBits );
        for ( k = 0; k < nSize; k++ )
            Vec_IntWriteEntry( vData, k, Gia_ManHashAnd(p, Vec_IntEntry(vData, k), Vec_IntEntry(vDec, k%Vec_IntSize(vDec))) );
        for ( b = 0; b < nBits; b++, nSize /= 2 )
            for ( k = 0; k < nSize/2; k++ )
                Vec_IntWriteEntry( vData, k, Gia_ManHashOr(p, Vec_IntEntry(vData, 2*k), Vec_IntEntry(vData, 2*k+1)) );
        Vec_IntFree( vDec );
        iStart += nBits;
    }
    assert( nSize == 1 );
    Gia_ManAppendCo( p, Vec_IntEntry(vData, 0) );
    Vec_IntFree( vIns );
    Vec_IntFree( vData );    
    p = Gia_ManCleanup( pTemp = p );
    Gia_ManStop( pTemp );
    return p;
}

Here is the call graph for this function:

Gia_ManGenNeuron()

Gia_Man_t * Gia_ManGenNeuron	(	char *	pFileName,
		int	nIBits,
		int	nLutSize,
		int	fDump,
		int	fVerbose )

Definition at line 1143 of file giaGen.c.

{
    int nWords = -1;
    Vec_Wrd_t * vData = Vec_WrdReadHex( pFileName, &nWords, 0 );
    if ( vData == NULL ) 
        return NULL;
 
    assert( nWords == 1 );
    assert( 0 < nIBits && nIBits < 32 );
    int i, Lit, nOBits = Gia_ManGenNeuronBitWidth( vData, nIBits );
    if ( fDump ) Gia_ManGenNeuronDumpVerilog( vData, nIBits, nOBits );
 
    Gia_Man_t * pTemp, * pNew = Gia_ManStart( 10000 );
    pNew->pName = Abc_UtilStrsav( "neuron" );
    for ( i = 0; i < nIBits * (Vec_WrdSize(vData)-1); i++ )
        Gia_ManAppendCi( pNew );
    Gia_ManHashAlloc( pNew );
 
    Vec_Wec_t * vTemp, * vArgs = Gia_ManGenNeuronCreateArgs( vData, nIBits, nOBits );
    Vec_WrdFree( vData );
 
    if ( nLutSize ) {
        vArgs = Gia_ManGenNeuronTransformArgs( pNew, vTemp = vArgs, nLutSize, nOBits );
        Vec_WecFree( vTemp );
        while ( Vec_WecSize(vArgs) > 2 ) {
            vArgs = Gia_ManGenNeuronCompactArgs( pNew, vTemp = vArgs, nLutSize, nOBits );
            Vec_WecFree( vTemp );
        }
    }
 
    Vec_Int_t * vRes = Gia_ManGenNeuronFinal( pNew, vArgs, nOBits );    
    Vec_IntForEachEntry( vRes, Lit, i )
        Gia_ManAppendCo( pNew, Lit );
    Vec_IntFree( vRes );
    Vec_WecFree( vArgs );
 
    pNew = Gia_ManCleanup( pTemp = pNew );
    Gia_ManStop( pTemp );
    return pNew;    
}

Here is the call graph for this function:

Gia_ManGenNeuronAdder()

void Gia_ManGenNeuronAdder	(	Gia_Man_t *	p,
		int	nLits,
		int *	pLitsA,
		int *	pLitsB,
		int	Carry,
		Vec_Int_t *	vRes )

Definition at line 1045 of file giaGen.c.

{
    extern void Wlc_BlastFullAdder( Gia_Man_t * pNew, int a, int b, int c, int * pc, int * ps );
    int i, Res = -1;
    Vec_IntClear( vRes );
    for ( i = 0; i < nLits; i++ ) {
        Wlc_BlastFullAdder( p, pLitsA[i], pLitsB[i], Carry, &Carry, &Res );
        Vec_IntPush( vRes, Res );
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManGenNeuronBitWidth()

int Gia_ManGenNeuronBitWidth	(	Vec_Wrd_t *	vData,
		int	nIBits )

Definition at line 1135 of file giaGen.c.

{   
    int i, InMask = (1<<nIBits)-1; 
    word Data, DataMax = Vec_WrdEntryLast(vData);
    Vec_WrdForEachEntryStop( vData, Data, i, Vec_WrdSize(vData)-1 )
        DataMax += InMask * Data;
    return Abc_Base2LogW(DataMax);
}

Here is the caller graph for this function:

Gia_ManGenNeuronCompactArgs()

Vec_Wec_t * Gia_ManGenNeuronCompactArgs	(	Gia_Man_t *	pNew,
		Vec_Wec_t *	vArgs,
		int	nLutSize,
		int	nOBits )

Definition at line 1110 of file giaGen.c.

{
    int i, nParts = Vec_WecSize(vArgs) / 3;
    Vec_Wec_t * vNew = Vec_WecAlloc( 2 * nParts + Vec_WecSize(vArgs) % 3 );
    for ( i = 0; i < nParts; i++ ) {
        Vec_Int_t * vIn0 = Vec_WecEntry(vArgs, 3*i+0);
        Vec_Int_t * vIn1 = Vec_WecEntry(vArgs, 3*i+1);
        Vec_Int_t * vIn2 = Vec_WecEntry(vArgs, 3*i+2);
        Vec_Int_t * vOut0 = Vec_WecPushLevel(vNew);
        Vec_Int_t * vOut1 = Vec_WecPushLevel(vNew);
        Gia_ManGenCompact( pNew, vIn0, vIn1, vIn2, vOut0, vOut1 );
    }
    for ( i = 3*nParts; i < Vec_WecSize(vArgs); i++ )
        Vec_IntAppend( Vec_WecPushLevel(vNew), Vec_WecEntry(vArgs, i) );
    assert( Vec_WecSize(vNew) == 2 * nParts + Vec_WecSize(vArgs) % 3 );
    return vNew;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManGenNeuronCreateArgs()

Vec_Wec_t * Gia_ManGenNeuronCreateArgs	(	Vec_Wrd_t *	vData,
		int	nIBits,
		int	nOBits )

Definition at line 1071 of file giaGen.c.

{
    word Data = Vec_WrdEntryLast(vData); int i, b, n, nLits = 2;
    Vec_Wec_t * vArgs = Vec_WecAlloc( Vec_WrdSize(vData) * nIBits ); 
    Vec_Int_t * vLev  = Vec_WecPushLevel( vArgs );
    Vec_IntFill( vLev, nOBits, 0 );
    for ( b = 0; b < nOBits; b++ )
        if ( (Data >> b) & 1 )
            Vec_IntWriteEntry( vLev, b, 1 );
    Vec_WrdForEachEntryStop( vData, Data, i, Vec_WrdSize(vData)-1 ) {
        for ( n = 0; n < nIBits; n++, nLits += 2 ) {
            Vec_Int_t * vLev = Vec_WecPushLevel( vArgs );
            Vec_IntFill( vLev, nOBits, 0 );
            for ( b = 0; b < nOBits; b++ )
                if ( ((Data >> b) & 1) && b+n < nOBits )
                    Vec_IntWriteEntry( vLev, b+n, nLits );
        }
    }
    return vArgs;
}

Here is the caller graph for this function:

Gia_ManGenNeuronDumpVerilog()

void Gia_ManGenNeuronDumpVerilog	(	Vec_Wrd_t *	vData,
		int	nIBits,
		int	nOBits )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 1028 of file giaGen.c.

{
    FILE * pFile = fopen( "temp.v", "wb" );
    if ( pFile == NULL ) {
        printf( "Cannot open output file.\n" );
        return;
    }
    fprintf( pFile, "module neuron_%d_%d_%d ( input [%d:0] i, output [%d:0] o );\n", 
        Vec_WrdSize(vData)-1, nIBits, nOBits, (Vec_WrdSize(vData)-1)*nIBits-1, nOBits-1 );
    fprintf( pFile, "assign o = %d'h%lX", nOBits, Vec_WrdEntryLast(vData) );
    word Data; int i;
    Vec_WrdForEachEntryStop( vData, Data, i, Vec_WrdSize(vData)-1 )
        fprintf( pFile, "\n         + %d'h%lX * i[%d:%d]", nOBits, Data, nIBits*(i+1)-1, nIBits*i );
    fprintf( pFile, ";\nendmodule\n\n" );
    fclose( pFile );
    printf( "Dumped the neuron specification into file \"temp.v\".\n" );
}

Here is the caller graph for this function:

Gia_ManGenNeuronFinal()

Vec_Int_t * Gia_ManGenNeuronFinal	(	Gia_Man_t *	pNew,
		Vec_Wec_t *	vArgs,
		int	nOBits )

Definition at line 1127 of file giaGen.c.

{
    Vec_Int_t * vRes = Vec_IntAlloc( nOBits ), * vArg; int i;
    Vec_IntAppend( vRes, Vec_WecEntry(vArgs, 0) );
    Vec_WecForEachLevelStart( vArgs, vArg, i, 1 )
        Gia_ManGenNeuronAdder( pNew, nOBits, Vec_IntArray(vArg), Vec_IntArray(vRes), 0, vRes );
    return vRes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManGenNeuronTransformArgs()

Vec_Wec_t * Gia_ManGenNeuronTransformArgs	(	Gia_Man_t *	pNew,
		Vec_Wec_t *	vArgs,
		int	nLutSize,
		int	nOBits )

Definition at line 1091 of file giaGen.c.

{
    int i, nParts = (Vec_WecSize(vArgs) + nLutSize - 2) / nLutSize;
    while ( Vec_WecSize(vArgs) < nLutSize*nParts+1 )
        Vec_IntFill( Vec_WecPushLevel(vArgs), nOBits, 0 );
    assert( Vec_WecSize(vArgs) == nLutSize*nParts+1 );
    Vec_Wec_t * vNew = Vec_WecAlloc( nParts );
    Vec_Int_t * vRes = Vec_WecPushLevel( vNew ), * vArg;
    Vec_IntAppend( vRes, Vec_WecEntry(vArgs, 0) );
    Vec_WecForEachLevelStart( vArgs, vArg, i, 1 ) {
        Gia_ManGenNeuronAdder( pNew, nOBits, Vec_IntArray(vArg), Vec_IntArray(vRes), 0, vRes );
        if ( (i-1) % nLutSize == nLutSize-1 && i < Vec_WecSize(vArgs)-1 ) {
            vRes = Vec_WecPushLevel( vNew );
            Vec_IntFill( vRes, nOBits, 0 );
        }            
    }
    assert( Vec_WecSize(vNew) == nParts );
    return vNew;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManGenPrefix()

void Gia_ManGenPrefix	(	Gia_Man_t *	pNew,
		int *	p,
		int *	g,
		int	p2,
		int	g2 )

Definition at line 1437 of file giaGen.c.

{
    *g = Gia_ManHashOr(pNew, *g, Gia_ManHashAnd(pNew, *p, g2));
    *p = Gia_ManHashAnd(pNew, *p, p2);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManGenPrep()

void Gia_ManGenPrep	(	int	nVars,
		int **	p )

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

Synopsis [Generates brand-name adders.]

Description []

SideEffects []

SeeAlso []

Definition at line 1374 of file giaGen.c.

{
    int i, k;
    for ( i = 0; i < nVars; i++ )
    for ( k = 0; k < nVars; k++ )
        p[i][k] = -1;
}

Here is the caller graph for this function:

Gia_ManGenPrint()

void Gia_ManGenPrint	(	int	nVars,
		int **	p )

Definition at line 1419 of file giaGen.c.

{
  int i, k;
  for ( i = nVars-1; i >= 0; i-- )
    printf( "%2d ", i );
  printf( "\n" );
  for ( i = 0; i < nVars; i++ ) {
    for ( k = nVars-1; k >= 0; k-- )
        if ( p[i][k] >= 0 )
            break;
    for ( k = nVars-1; k >= 0; k-- )
      if ( p[i][k] == -1 )
        printf( " - " );
      else
        printf( "%2d ", p[i][k] );
    printf("\n");
  }
}

Here is the caller graph for this function:

Gia_ManGenRca()

void Gia_ManGenRca	(	int	nVars,
		int **	p )

Definition at line 1413 of file giaGen.c.

{
    int i;
    for ( i = 1; i < nVars; i++ )
        p[i][i] = i-1;
}

Here is the caller graph for this function:

Gia_ManGenSK()

void Gia_ManGenSK	(	int	nVars,
		int **	p )

Definition at line 1381 of file giaGen.c.

{
    int i, k, nBits = Abc_Base2Log(nVars);
    for ( i = 0; i < nBits; i++ )
        for ( k = 0; k < nVars; k++ )
            if ( (k >> i) & 1 )
                p[i+1][k] = ((1 << i) - 1) | ((k >> (i+1)) << (i+1));
}

Here is the caller graph for this function:

Gia_ManGenSorter()

Gia_Man_t * Gia_ManGenSorter

(

int

LogN

)

Definition at line 1347 of file giaGen.c.

{
    int i, nVars = 1 << LogN;
    int nVarsAlloc = nVars + 2 * (nVars * LogN * (LogN-1) / 4 + nVars - 1);
    Vec_Int_t * vLits = Vec_IntAlloc( nVars );
    Gia_Man_t * p = Gia_ManStart( 1 + 2*nVars + nVarsAlloc ); 
    p->pName = Abc_UtilStrsav( "sorter" );
    for ( i = 0; i < nVars; i++ )
        Vec_IntPush( vLits, Gia_ManAppendCi(p) );
    Gia_ManGenSorterConstrRange( p, Vec_IntArray(vLits), 0, nVars - 1 );
    for ( i = 0; i < nVars; i++ )
        Gia_ManAppendCo( p, Vec_IntEntry(vLits, i) );
    Vec_IntFree( vLits );
    return p;
}

Here is the call graph for this function:

Gia_ManGetExampleValue()

int Gia_ManGetExampleValue	(	word **	ppSims,
		int	nSims,
		int	iExample )

Definition at line 670 of file giaGen.c.

{
    int o, Sign = 0, ValueSim = 0;
    for ( o = 0; o < nSims; o++ )
        if ( (Sign = Abc_TtGetBit(ppSims[o], iExample)) )
            ValueSim |= (1 << o);
    if ( Sign )
        ValueSim |= ~0 << nSims;
    return ValueSim;
}

Here is the caller graph for this function:

Gia_ManReadBinaryFile()

int Gia_ManReadBinaryFile	(	char *	pFileName,
		Vec_Wrd_t **	pvSimsIn,
		Vec_Str_t **	pvSimsOut )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 617 of file giaGen.c.

{
    extern void Extra_BitMatrixTransposeP( Vec_Wrd_t * vSimsIn, int nWordsIn, Vec_Wrd_t * vSimsOut, int nWordsOut );
    int nFileSize = Extra_FileSize( pFileName );
    int nExamples = 1 << 16;
    int nInputs   = nFileSize / nExamples - 1;
    int nWords    = (8*nInputs + 63)/64, i;
    char * pContents = Extra_FileReadContents( pFileName );
    Vec_Wrd_t * vSimsIn  = Vec_WrdStart( nExamples * nWords );
    Vec_Wrd_t * vSimsIn2 = Vec_WrdStart( nExamples * nWords );
    Vec_Str_t * vSimsOut = Vec_StrAlloc( nExamples );
    assert( nFileSize % nExamples == 0 );
    for ( i = 0; i < nExamples; i++ )
    {
        memcpy( (void *)Vec_WrdEntryP(vSimsIn,  i*nWords), (void *)(pContents + i*(nInputs+1)), nInputs );
        Vec_StrPush( vSimsOut, pContents[i*(nInputs+1) + nInputs] );
    }
    Extra_BitMatrixTransposeP( vSimsIn, nWords, vSimsIn2, nExamples/64 );
    Vec_WrdShrink( vSimsIn2, 8*nInputs * nExamples/64 );
    Vec_WrdFree( vSimsIn );
    *pvSimsIn  = vSimsIn2;
    *pvSimsOut = vSimsOut;
    ABC_FREE( pContents );
    return nInputs;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManReadCifar10File()

int Gia_ManReadCifar10File	(	char *	pFileName,
		Vec_Wrd_t **	pvSimsIn,
		Vec_Str_t **	pvSimsOut,
		int *	pnExamples )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 787 of file giaGen.c.

{
    int nPixels   = 32*32*3;
    int nFileSize = Extra_FileSize( pFileName );
    int nExamples = nFileSize / (nPixels + 1);
    int nWordsIn  = nPixels / 8;
    int nWordsOut = (nExamples + 63) / 64; int e;
    if ( nFileSize % (nPixels + 1) )
    {
        printf( "The input file \"%s\" with image data does not appear to be in CIFAR10 format.\n", pFileName );
        return 0;
    }
    else
    {
        Vec_Wrd_t * vSimsIn  = Vec_WrdStart( 64 * nWordsOut * nWordsIn );
        Vec_Str_t * vSimsOut = Vec_StrAlloc( 64 * nWordsOut );
        unsigned char * pBuffer = ABC_ALLOC( unsigned char, nFileSize );
        FILE * pFile = fopen( pFileName, "rb" );
        int Value = fread( pBuffer, 1, nFileSize, pFile );
        fclose( pFile );
        assert( Value == nFileSize );
        printf( "Successfully read %5.2f MB (%d images) from file \"%s\".\n", (float)nFileSize/(1<<20), nExamples, pFileName );
        for ( e = 0; e < nExamples; e++ )
        {
            Vec_StrPush( vSimsOut, (char)pBuffer[e*(nPixels + 1)] );
            memcpy( Vec_WrdEntryP(vSimsIn, e*nWordsIn), pBuffer + e*(nPixels + 1) + 1, nPixels );
        }
        ABC_FREE( pBuffer );
        for ( ; e < 64 * nWordsOut; e++ )
            Vec_StrPush( vSimsOut, (char)0 );
        memset( Vec_WrdEntryP(vSimsIn, nExamples*nWordsIn), 0, (64*nWordsOut - nExamples)*nWordsIn );
        *pvSimsIn   = vSimsIn;
        *pvSimsOut  = vSimsOut;
        *pnExamples = nExamples;
        return 8*nPixels;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManReadSimFile()

void Gia_ManReadSimFile	(	char *	pFileName,
		int *	pnIns,
		int *	pnOuts,
		int *	pnPats,
		Vec_Wrd_t **	pvSimsIn,
		Vec_Wrd_t **	pvSimsOut )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 537 of file giaGen.c.

{
    char * pTemp, pBuffer[1000];
    Vec_Wrd_t * vSimsIn = NULL, * vSimsOut = NULL;
    int i, iPat = 0, nWordsI, nWordsO, nIns = -1, nOuts = -1, nPats = -1;
    FILE * pFile = fopen( pFileName, "rb" );
    if ( pFile == NULL )
    {
        printf( "Cannot open file \"%s\" for reading.\n", pFileName );
        return;
    }
    while ( fgets( pBuffer, 1000, pFile ) != NULL )
    {
        pTemp = pBuffer;
        if ( pTemp[0] == '\0' || pTemp[0] == '#' || pTemp[0] == ' ' )
            continue;
        if ( pTemp[0] != '.' )
            break;
        if ( pTemp[1] == 'i' )
            nIns = atoi(pTemp+2);
        else if ( pTemp[1] == 'o' )
            nOuts = atoi(pTemp+2);
        else if ( pTemp[1] == 'p' )
        {
            if ( atoi(pTemp+2) % 64 == 0 )
                printf( "Expecting the number of patterns divisible by 64.\n" );
            nPats = atoi(pTemp+2) / 64;
        }
    }
    if ( nIns == -1 || nOuts == -1 || nPats == -1 )
    {
        printf( "Some of the parameters (inputs, outputs, patterns) is not specified.\n" );
        fclose( pFile );
        return;
    }
    nWordsI = (nIns  + 63) / 64;
    nWordsO = (nOuts + 63) / 64;
 
    vSimsIn  = Vec_WrdStart( nPats * nWordsI );
    vSimsOut = Vec_WrdStart( nPats * nWordsO );
    rewind(pFile);
    while ( fgets( pBuffer, 1000, pFile ) != NULL )
    {
        if ( pTemp[0] == '\0' || pTemp[0] == '.' )
            continue;
        for ( i = 0, pTemp = pBuffer; *pTemp != '\n'; pTemp++ )
            if ( *pTemp == '0' || *pTemp == '1' )
            {
                if ( *pTemp == '1' )
                {
                    if ( i < nIns )
                        Abc_TtSetBit( Vec_WrdEntryP(vSimsIn,  nWordsI*iPat), i );
                    else
                        Abc_TtSetBit( Vec_WrdEntryP(vSimsOut, nWordsO*iPat), i-nIns );
                }
                i++;
            }
        iPat++;
    }
    if ( iPat != nPats )
        printf( "The number of patterns does not match.\n" );
    fclose( pFile );
    *pnIns = nIns;
    *pnOuts = nOuts;
    *pnPats  = nPats;
    *pvSimsIn = vSimsIn;
    *pvSimsOut = vSimsOut;
}

Here is the call graph for this function:

Gia_ManSimFileRead()

void Gia_ManSimFileRead	(	char *	pFileName,
		int	nIns,
		int	nWords,
		Vec_Wrd_t *	vSimsIn,
		Vec_Int_t *	vValues )

Definition at line 467 of file giaGen.c.

{
    int c, nPats = 0, Count = 0, fReadDot = 0;
    FILE * pFile = fopen( pFileName, "rb" );
    if ( pFile == NULL )
    {
        printf( "Cannot open file \"%s\" for reading.\n", pFileName );
        return;
    }
    assert( Vec_WrdSize(vSimsIn) % nWords == 0 );
    while ( (c = fgetc(pFile)) != EOF )
    {
        if ( c == '.' )
            fReadDot = 1;
        if ( c == '\n' )
            fReadDot = 0;
        if ( fReadDot )
            continue;
        if ( c != '0' && c != '1' )
            continue;
        if ( Count == nIns )
        {
            Vec_IntPush( vValues, c - '0' );
            Count = 0;
            nPats++;
        }
        else
        {
            if ( c == '1' )
                Abc_TtSetBit( Vec_WrdEntryP(vSimsIn, Count * nWords), nPats );
            Count++;
        }
    }
    assert( nPats == 64*nWords );
    fclose( pFile );
    printf( "Finished reading %d simulation patterns for %d inputs. Probability of 1 at the output is %6.2f %%.\n", 64*nWords, nIns, 100.0*Vec_IntSum(vValues)/nPats );
}

Here is the caller graph for this function:

Gia_ManSimLogStats()

void Gia_ManSimLogStats	(	Gia_Man_t *	p,
		char *	pDumpFile,
		int	Total,
		int	Correct,
		int	Guess )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 404 of file giaGen.c.

{
    FILE * pTable = fopen( pDumpFile, "wb" );
    fprintf( pTable, "{\n" );
    fprintf( pTable, "    \"name\" : \"%s\",\n", p->pName );
    fprintf( pTable, "    \"input\" : %d,\n",    Gia_ManCiNum(p) );
    fprintf( pTable, "    \"output\" : %d,\n",   Gia_ManCoNum(p) );
    fprintf( pTable, "    \"and\" : %d,\n",      Gia_ManAndNum(p) );
    fprintf( pTable, "    \"level\" : %d,\n",    Gia_ManLevelNum(p) );
    fprintf( pTable, "    \"total\" : %d,\n",    Total );
    fprintf( pTable, "    \"correct\" : %d,\n",  Correct );
    fprintf( pTable, "    \"guess\" : %d\n",     Guess );
    fprintf( pTable, "}\n" );
    fclose( pTable );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManSimLogStats2()

void Gia_ManSimLogStats2	(	Gia_Man_t *	p,
		char *	pDumpFile,
		int	Total,
		int	nPositives,
		float	ErrorTotal,
		float	GuessTotal )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 654 of file giaGen.c.

{
    FILE * pTable = fopen( pDumpFile, "wb" );
    fprintf( pTable, "{\n" );
    fprintf( pTable, "    \"name\" : \"%s\",\n", p->pName );
    fprintf( pTable, "    \"input\" : %d,\n",    Gia_ManCiNum(p) );
    fprintf( pTable, "    \"output\" : %d,\n",   Gia_ManCoNum(p) );
    fprintf( pTable, "    \"and\" : %d,\n",      Gia_ManAndNum(p) );
    fprintf( pTable, "    \"level\" : %d,\n",    Gia_ManLevelNum(p) );
    fprintf( pTable, "    \"total\" : %d,\n",    Total );
    fprintf( pTable, "    \"positive\" : %d,\n", nPositives );
    fprintf( pTable, "    \"error\" : %e,\n",    ErrorTotal );
    fprintf( pTable, "    \"guess\" : %e\n",     GuessTotal );
    fprintf( pTable, "}\n" );
    fclose( pTable );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManSimParamRead()

int Gia_ManSimParamRead	(	char *	pFileName,
		int *	pnIns,
		int *	pnWords )

Definition at line 419 of file giaGen.c.

{
    int c, nIns = -1, nLines = 0, Count = 0, fReadDot = 0;
    FILE * pFile = fopen( pFileName, "rb" );
    if ( pFile == NULL )
    {
        printf( "Cannot open file \"%s\" for reading.\n", pFileName );
        return 0;
    }
    while ( (c = fgetc(pFile)) != EOF )
    {
        if ( c == '.' )
            fReadDot = 1;
        if ( c == '\n' )
        {
            if ( !fReadDot )
            {
                if ( nIns == -1 )
                    nIns = Count;
                else if ( nIns != Count )
                {
                    printf( "The number of symbols (%d) does not match other lines (%d).\n", Count, nIns );
                    fclose( pFile );
                    return 0;
                }
                Count = 0;
                nLines++;
            }
            fReadDot = 0;
        }
        if ( fReadDot )
            continue;
        if ( c != '0' && c != '1' )
            continue;
        Count++;
    }
    if ( nLines % 64 > 0 )
    {
        printf( "The number of lines (%d) is not divisible by 64.\n", nLines );
        fclose( pFile );
        return 0;
    }
    *pnIns = nIns - 1;
    *pnWords = nLines / 64;
    //printf( "Expecting %d inputs and %d words of simulation data.\n", *pnIns, *pnWords );
    fclose( pFile );
    return 1;
}

Here is the caller graph for this function:

Gia_ManSimulateAll()

Vec_Str_t * Gia_ManSimulateAll	(	Gia_Man_t *	p,
		Vec_Wrd_t *	vSimsIn,
		Vec_Str_t *	vSimsOut,
		int	nExamples,
		int	fVerbose )

Definition at line 860 of file giaGen.c.

{
    extern void Extra_BitMatrixTransposeP( Vec_Wrd_t * vSimsIn, int nWordsIn, Vec_Wrd_t * vSimsOut, int nWordsOut );
    Vec_Str_t * vRes = Vec_StrAlloc( 100 ); int b, Count;
    int nWordsIn  = 32*32*24/64; // one image
    int nWordsOut = Vec_WrdSize(vSimsIn)/(nWordsIn*64); 
    assert( Vec_WrdSize(vSimsIn) % nWordsIn == 0 );
    for ( b = 0; b < nWordsOut; b++ )
    {
        int Limit = b == nWordsOut-1 ? nExamples-b*64 : 64;
        Vec_Wrd_t * vSimsIn1 = Vec_WrdStart( nWordsIn*64 );
        Vec_Wrd_t * vSimsIn2 = Vec_WrdStart( nWordsIn*64 );
        memcpy( Vec_WrdArray(vSimsIn1), Vec_WrdEntryP(vSimsIn, b*nWordsIn*64), sizeof(word)*nWordsIn*64 );
        Extra_BitMatrixTransposeP( vSimsIn1, nWordsIn, vSimsIn2, 1 );
        Vec_WrdFree( vSimsIn1 );
        Count = Gia_ManSimulateBatch( p, vSimsIn2, vRes, vSimsOut, b, Limit );
        Vec_WrdFree( vSimsIn2 );
        if ( fVerbose )
        printf( "Finished simulating word %4d (out of %4d). Correct = %2d. (Limit = %2d.)\n", b, nWordsOut, Count, Limit );
    }
    assert( Vec_StrSize(vRes) == nExamples );
    return vRes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManSimulateBatch()

int Gia_ManSimulateBatch	(	Gia_Man_t *	p,
		Vec_Wrd_t *	vSimsIn,
		Vec_Str_t *	vSimsOut,
		Vec_Str_t *	vSimsOut2,
		int	b,
		int	Limit )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 836 of file giaGen.c.

{
    Gia_Obj_t * pObj; 
    word * ppSims[10];
    int i, o, Count = 0;
    assert( Gia_ManCiNum(p) == Vec_WrdSize(vSimsIn) );
    assert( Gia_ManCoNum(p) == 10 );
    Gia_ManSimulateWordsInit( p, vSimsIn );
    Gia_ManForEachCo( p, pObj, o )
        ppSims[o] = Gia_ManObjSim( p, Gia_ObjId(p, pObj) );
    for ( i = 0; i < Limit; i++ )
    {
        int Value = 0;
        for ( o = 0; o < 10; o++ )
            if ( Abc_TtGetBit(ppSims[o], i) )
            {
                Value = o;
                break;
            }
        Vec_StrPush( vSimsOut, (char)Value );
        Count += Value == (int)Vec_StrEntry( vSimsOut2, 64*b+i );
    }
    return Count;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManSimulateWords()

int Gia_ManSimulateWords	(	Gia_Man_t *	p,
		int	nWords )

Definition at line 151 of file giaGen.c.

{
    Gia_Obj_t * pObj; int i;
    // allocate simulation info for one timeframe
    Vec_WrdFreeP( &p->vSims );
    p->vSims = Vec_WrdStart( Gia_ManObjNum(p) * nWords );
    p->nSimWords = nWords;
    // perform simulation
    Gia_ManForEachObj1( p, pObj, i )
    {
        if ( Gia_ObjIsAnd(pObj) )
            Gia_ManObjSimAnd( p, i );
        else if ( Gia_ObjIsCi(pObj) )
            Gia_ManObjSimPi( p, i );
        else if ( Gia_ObjIsCo(pObj) )
            Gia_ManObjSimPo( p, i );
        else assert( 0 );
    }
    return 1;
}

Here is the caller graph for this function:

Gia_ManSimulateWordsInit()

int Gia_ManSimulateWordsInit	(	Gia_Man_t *	p,
		Vec_Wrd_t *	vSimsIn )

Definition at line 172 of file giaGen.c.

{
    Gia_Obj_t * pObj; int i, Id;
    int nWords = Vec_WrdSize(vSimsIn) / Gia_ManCiNum(p);
    assert( Vec_WrdSize(vSimsIn) == nWords * Gia_ManCiNum(p) );
    // allocate simulation info for one timeframe
    Vec_WrdFreeP( &p->vSims );
    p->vSims = Vec_WrdStart( Gia_ManObjNum(p) * nWords );
    p->nSimWords = nWords;
    // set input sim info
    Gia_ManForEachCiId( p, Id, i )
        memcpy( Vec_WrdEntryP(p->vSims, Id*nWords), Vec_WrdEntryP(vSimsIn, i*nWords), sizeof(word)*nWords );
    // perform simulation
    Gia_ManForEachObj1( p, pObj, i )
    {
        if ( Gia_ObjIsAnd(pObj) )
            Gia_ManObjSimAnd( p, i );
        else if ( Gia_ObjIsCi(pObj) )
            continue;
        else if ( Gia_ObjIsCo(pObj) )
            Gia_ManObjSimPo( p, i );
        else assert( 0 );
    }
    return 1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManSimulateWordsOut()

Vec_Wrd_t * Gia_ManSimulateWordsOut	(	Gia_Man_t *	p,
		Vec_Wrd_t *	vSimsIn )

Definition at line 198 of file giaGen.c.

{
    Gia_Obj_t * pObj; int i, Id;
    int nWords = Vec_WrdSize(vSimsIn) / Gia_ManCiNum(p);
    Vec_Wrd_t * vSimsOut = Vec_WrdStart( nWords * Gia_ManCoNum(p) );
    assert( Vec_WrdSize(vSimsIn) == nWords * Gia_ManCiNum(p) );
    // allocate simulation info for one timeframe
    Vec_WrdFreeP( &p->vSims );
    p->vSims = Vec_WrdStart( Gia_ManObjNum(p) * nWords );
    p->nSimWords = nWords;
    // set input sim info
    Gia_ManForEachCiId( p, Id, i )
        memcpy( Vec_WrdEntryP(p->vSims, Id*nWords), Vec_WrdEntryP(vSimsIn, i*nWords), sizeof(word)*nWords );
    // perform simulation
    Gia_ManForEachObj1( p, pObj, i )
    {
        if ( Gia_ObjIsAnd(pObj) )
            Gia_ManObjSimAnd( p, i );
        else if ( Gia_ObjIsCi(pObj) )
            continue;
        else if ( Gia_ObjIsCo(pObj) )
            Gia_ManObjSimPo( p, i );
        else assert( 0 );
    }
    // set output sim info
    Gia_ManForEachCoId( p, Id, i )
        memcpy( Vec_WrdEntryP(vSimsOut, i*nWords), Vec_WrdEntryP(p->vSims, Id*nWords), sizeof(word)*nWords );
    Vec_WrdFreeP( &p->vSims );
    p->nSimWords = -1;
    return vSimsOut;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManSumCount()

int Gia_ManSumCount	(	char *	p,
		Vec_Int_t *	vDec,
		int	b )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 939 of file giaGen.c.

{
    int i, Ent, Count = 0, Sum = 0;
    for ( i = 0; p[i]; i++ ) {
        Ent = (p[i] >= '0' && p[i] <= '9') ? p[i]-'0' : p[i]-'A'+10;
        Count += Vec_IntEntry(vDec, Ent) + b * (1 << (Sum += Ent));
    }
    return Count + b * ((1 << Sum) - 1);
}

Here is the caller graph for this function:

Gia_ManSumEnum()

void Gia_ManSumEnum	(	int	n,
		Vec_Int_t *	vDec )

Definition at line 969 of file giaGen.c.

{
    Vec_Str_t * vRes = Gia_ManSumEnum_rec( n );
    for ( int b = 1; b <= 256; b <<= 1 ) {
        int iBest = -1, CountCur, CountBest = ABC_INFINITY;
        for ( int c0 = 0; c0 < Vec_StrSize(vRes); c0 += strlen(Vec_StrEntryP(vRes,c0))+1 ) {
            CountCur = Gia_ManSumCount( Vec_StrEntryP(vRes,c0), vDec, b );
            if ( CountBest > CountCur )
                CountBest = CountCur, iBest = c0;
        }
        printf( " %8d", CountBest );
        //printf( " %8s", Vec_StrEntryP(vRes,iBest) );
        //printf( " %.3f", (float)CountBest/(3*b*((1<<n)-1)) );
    }
//    Vec_StrPrint( vRes, 0 );
    Vec_StrFree( vRes );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManSumEnum_rec()

Vec_Str_t * Gia_ManSumEnum_rec

(

int

Num

)

Definition at line 948 of file giaGen.c.

{
    if ( Num == 1 ) {
        Vec_Str_t * vRes = Vec_StrAlloc(2);
        Vec_StrPush( vRes, '1' );
        Vec_StrPush( vRes, '\0' );        
        return vRes;
    }
    Vec_Str_t * vRes = Vec_StrAlloc( 16 );
    for ( int i = 1; i < Num; i++ ) {
        Vec_Str_t * vRes0 = Gia_ManSumEnum_rec(i);
        Vec_Str_t * vRes1 = Gia_ManSumEnum_rec(Num-i);
        for ( int c0 = 0; c0 < Vec_StrSize(vRes0); c0 += strlen(Vec_StrEntryP(vRes0,c0))+1 )
        for ( int c1 = 0; c1 < Vec_StrSize(vRes1); c1 += strlen(Vec_StrEntryP(vRes1,c1))+1 )
            Vec_StrPrintF( vRes, "%s%s%c", Vec_StrEntryP(vRes0,c0), Vec_StrEntryP(vRes1,c1), '\0' );
        Vec_StrPrintF( vRes, "%c%c", Num < 10 ? '0'+Num : 'A'+Num-10, '\0' );
        Vec_StrFree( vRes0 );
        Vec_StrFree( vRes1 );       
    }
    return vRes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManSumEnumTest()

void Gia_ManSumEnumTest

(

)

Definition at line 1001 of file giaGen.c.

{
    Vec_Int_t * vDec = Gia_ManSumGenDec( 16 );
    printf( "    " );
    for ( int b = 1; b <= 256; b <<= 1 )
        printf( " %8d", b );
    printf( "\n" );
    for ( int i = 1; i <= 15; i++ ) {
        printf( "%2d :", i );
        Gia_ManSumEnum( i, vDec );        
        printf( "\n" );
    }
    Vec_IntFree( vDec );
}

Here is the call graph for this function:

Gia_ManSumGenDec()

Vec_Int_t * Gia_ManSumGenDec

(

int

n

)

Definition at line 986 of file giaGen.c.

{
    Vec_Int_t * vDec = Vec_IntAlloc( n + 1 );
    Vec_IntPush( vDec, 0 );
    Vec_IntPush( vDec, 0 );
    Vec_IntPush( vDec, 4 );
    Vec_IntPush( vDec, 12 );    
    for ( int i = 4; i <= n; i++ ) {
        int Ent0 = Vec_IntEntry( vDec, i / 2 );
        int Ent1 = Vec_IntEntry( vDec, i - i / 2 );        
        assert( Vec_IntSize(vDec) == i );
        Vec_IntPush( vDec, Ent0 + Ent1 + (1 << i / 2) * (1 << (i - i / 2)) );
    }
    return vDec;
}

Here is the caller graph for this function:

Gia_ManTestOneFile()

void Gia_ManTestOneFile	(	Gia_Man_t *	p,
		char *	pFileName,
		char *	pDumpFile )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 755 of file giaGen.c.

{
    Vec_Wrd_t * vSimsIn;
    Vec_Int_t * vValues;
    int nIns, nWords;
    if ( !Gia_ManSimParamRead( pFileName, &nIns, &nWords ) )
        return;
    if ( nIns != Gia_ManCiNum(p) )
    {
        printf( "The number of inputs in the file \"%s\" (%d) does not match the AIG (%d).\n", pFileName, nIns, Gia_ManCiNum(p) );
        return;
    }
    vSimsIn = Vec_WrdStart( nIns * nWords );
    vValues = Vec_IntAlloc( nWords * 64 );
    Gia_ManSimFileRead( pFileName, nIns, nWords, vSimsIn, vValues );
    Gia_ManCompareValues( p, vSimsIn, vValues, pDumpFile );
    Vec_WrdFree( vSimsIn );
    Vec_IntFree( vValues );
}

Here is the call graph for this function:

Gia_ManTestWordFile()

void Gia_ManTestWordFile	(	Gia_Man_t *	p,
		char *	pFileName,
		char *	pDumpFile,
		int	fVerbose )

Definition at line 902 of file giaGen.c.

{
    abctime clk = Abc_Clock();
    Vec_Wrd_t * vSimsIn;
    Vec_Str_t * vSimsOut;
    int i, nExamples = 0;
    int nInputs = Gia_ManReadCifar10File( pFileName, &vSimsIn, &vSimsOut, &nExamples );
    char * pKnownFileNames[3] = {"small.aig", "medium.aig", "large.aig"};
    int pLimitFileSizes[3] = {10000, 100000, 1000000};
    for ( i = 0; i < 3; i++ )
        if ( p->pSpec && !strncmp(p->pSpec, pKnownFileNames[i], 5) && Gia_ManAndNum(p) > pLimitFileSizes[i] )
            printf( "Warning: The input file \"%s\" contains more than %d internal and-nodes.\n", pKnownFileNames[i], pLimitFileSizes[i] );
    if ( nInputs == Gia_ManCiNum(p) )
    {
        Vec_Str_t * vRes = Gia_ManSimulateAll( p, vSimsIn, vSimsOut, nExamples, fVerbose );
        Gia_ManCompareCifar10Values( p, vRes, vSimsOut, pDumpFile, nExamples );
        Vec_StrFree( vRes );
    }
    else
        printf( "The primary input counts in the AIG (%d) and in the image data (%d) do not match.\n", Gia_ManCiNum(p), nInputs );
    Vec_WrdFree( vSimsIn );
    Vec_StrFree( vSimsOut );
    Abc_PrintTime( 1, "Total checking time", Abc_Clock() - clk );
}

Here is the call graph for this function:

Gia_ManTestWordFileUnused()

void Gia_ManTestWordFileUnused	(	Gia_Man_t *	p,
		char *	pFileName,
		char *	pDumpFile )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 731 of file giaGen.c.

{
    Vec_Wrd_t * vSimsIn;
    Vec_Str_t * vSimsOut;
    int nInputs = Gia_ManReadBinaryFile( pFileName, &vSimsIn, &vSimsOut );
    if ( Gia_ManCiNum(p) == 8*nInputs )
        Gia_ManCompareValues2( nInputs, p, vSimsIn, vSimsOut, pDumpFile );
    else
        printf( "The number of inputs in the AIG (%d) and in the file (%d) does not match.\n", Gia_ManCiNum(p), 8*nInputs );
    Vec_WrdFree( vSimsIn );
    Vec_StrFree( vSimsOut );
}

Here is the call graph for this function: