pla.h File Reference

#include "aig/gia/gia.h"
#include "misc/extra/extra.h"
#include "base/main/mainInt.h"

Include dependency graph for pla.h:

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

Go to the source code of this file.

Classes
struct	Pla_Man_t_

Macros
#define	MASK55   ABC_CONST(0x5555555555555555)
	INCLUDES ///.
#define	Pla_ForEachCubeIn(p, pCube, i)
	MACRO DEFINITIONS ///.
#define	Pla_ForEachCubeInStart(p, pCube, i, Start)
#define	Pla_ForEachCubeOut(p, pCube, i)
#define	Pla_ForEachCubeInOut(p, pCubeIn, pCubeOut, i)
#define	Pla_CubeForEachLit(nVars, pCube, Lit, i)
#define	Pla_CubeForEachLitIn(p, pCube, Lit, i)
#define	Pla_CubeForEachLitOut(p, pCube, Lit, i)

Typedefs
typedef struct Pla_Man_t_	Pla_Man_t

Enumerations
enum	Pla_File_t {   PLA_FILE_FD = 0 , PLA_FILE_F , PLA_FILE_FR , PLA_FILE_FDR ,   PLA_FILE_NONE }
	BASIC TYPES ///. More...
enum	Pla_Lit_t { PLA_LIT_DASH = 0 , PLA_LIT_ZERO , PLA_LIT_ONE , PLA_LIT_FULL }

Functions
int	Pla_ManHashDist1NumTest (Pla_Man_t *p)
void	Pla_ManComputeDist1Test (Pla_Man_t *p)
Vec_Bit_t *	Pla_ManPrimesTable (int nVars)
Pla_Man_t *	Pla_ManPrimesDetector (int nVars)
Pla_Man_t *	Pla_ManGenerate (int nIns, int nOuts, int nCubes, int fVerbose)
void	Pla_ManConvertFromBits (Pla_Man_t *p)
void	Pla_ManConvertToBits (Pla_Man_t *p)
int	Pla_ManDist1NumTest (Pla_Man_t *p)
int	Pla_ManDist1Merge (Pla_Man_t *p)
	DECLARATIONS ///.
int	Pla_ManFxPerformSimple (int nVars)
Pla_Man_t *	Pla_ReadPla (char *pFileName)
void	Pla_WritePla (Pla_Man_t *p, char *pFileName)

Macro Definition Documentation

MASK55

#define MASK55   ABC_CONST(0x5555555555555555)

INCLUDES ///.

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

FileName [pla.h]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [SOP manager.]

Synopsis [Scalable SOP transformations.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - March 18, 2015.]

Revision [

Id

pla.h,v 1.00 2014/09/12 00:00:00 alanmi Exp

] PARAMETERS ///

Definition at line 39 of file pla.h.

Pla_CubeForEachLit

#define Pla_CubeForEachLit	(		nVars,
			pCube,
			Lit,
			i )

Value:

    for ( i = 0; (i < nVars)  && (((Lit) = Pla_CubeGetLit(pCube, i)), 1); i++ )

Definition at line 124 of file pla.h.

#define Pla_CubeForEachLit( nVars, pCube, Lit, i )                  \
    for ( i = 0; (i < nVars)  && (((Lit) = Pla_CubeGetLit(pCube, i)), 1); i++ )

Pla_CubeForEachLitIn

#define Pla_CubeForEachLitIn	(		p,
			pCube,
			Lit,
			i )

Value:

    Pla_CubeForEachLit( Pla_ManInNum(p), pCube, Lit, i )

Definition at line 126 of file pla.h.

#define Pla_CubeForEachLitIn( p, pCube, Lit, i )                    \
    Pla_CubeForEachLit( Pla_ManInNum(p), pCube, Lit, i )

Pla_CubeForEachLitOut

#define Pla_CubeForEachLitOut	(		p,
			pCube,
			Lit,
			i )

Value:

    Pla_CubeForEachLit( Pla_ManOutNum(p), pCube, Lit, i )

Definition at line 128 of file pla.h.

#define Pla_CubeForEachLitOut( p, pCube, Lit, i )                   \
    Pla_CubeForEachLit( Pla_ManOutNum(p), pCube, Lit, i )

Pla_ForEachCubeIn

#define Pla_ForEachCubeIn	(		p,
			pCube,
			i )

Value:

    for ( i = 0; (i < Pla_ManCubeNum(p))  && (((pCube) = Pla_CubeIn(p, i)), 1); i++ )

MACRO DEFINITIONS ///.

ITERATORS ///

Definition at line 114 of file pla.h.

#define Pla_ForEachCubeIn( p, pCube, i )                            \
    for ( i = 0; (i < Pla_ManCubeNum(p))  && (((pCube) = Pla_CubeIn(p, i)), 1); i++ )

Pla_ForEachCubeInOut

#define Pla_ForEachCubeInOut	(		p,
			pCubeIn,
			pCubeOut,
			i )

Value:

    for ( i = 0; (i < Pla_ManCubeNum(p))  && (((pCubeIn) = Pla_CubeIn(p, i)), 1)  && (((pCubeOut) = Pla_CubeOut(p, i)), 1); i++ )

Definition at line 121 of file pla.h.

#define Pla_ForEachCubeInOut( p, pCubeIn, pCubeOut, i )             \
    for ( i = 0; (i < Pla_ManCubeNum(p))  && (((pCubeIn) = Pla_CubeIn(p, i)), 1)  && (((pCubeOut) = Pla_CubeOut(p, i)), 1); i++ )

Pla_ForEachCubeInStart

#define Pla_ForEachCubeInStart	(		p,
			pCube,
			i,
			Start )

Value:

    for ( i = Start; (i < Pla_ManCubeNum(p))  && (((pCube) = Pla_CubeIn(p, i)), 1); i++ )

Definition at line 116 of file pla.h.

#define Pla_ForEachCubeInStart( p, pCube, i, Start )                \
    for ( i = Start; (i < Pla_ManCubeNum(p))  && (((pCube) = Pla_CubeIn(p, i)), 1); i++ )

Pla_ForEachCubeOut

#define Pla_ForEachCubeOut	(		p,
			pCube,
			i )

Value:

    for ( i = 0; (i < Pla_ManCubeNum(p))  && (((pCube) = Pla_CubeOut(p, i)), 1); i++ )

Definition at line 119 of file pla.h.

#define Pla_ForEachCubeOut( p, pCube, i )                           \
    for ( i = 0; (i < Pla_ManCubeNum(p))  && (((pCube) = Pla_CubeOut(p, i)), 1); i++ )

Typedef Documentation

Pla_Man_t

typedef struct Pla_Man_t_ Pla_Man_t

Definition at line 63 of file pla.h.

Enumeration Type Documentation

Pla_File_t

enum Pla_File_t

BASIC TYPES ///.

Enumerator
PLA_FILE_FD
PLA_FILE_F
PLA_FILE_FR
PLA_FILE_FDR
PLA_FILE_NONE

Definition at line 46 of file pla.h.

             {
    PLA_FILE_FD = 0,
    PLA_FILE_F,
    PLA_FILE_FR,
    PLA_FILE_FDR,
    PLA_FILE_NONE
} Pla_File_t;

Pla_Lit_t

enum Pla_Lit_t

Enumerator
PLA_LIT_DASH
PLA_LIT_ZERO
PLA_LIT_ONE
PLA_LIT_FULL

Definition at line 55 of file pla.h.

             {
    PLA_LIT_DASH = 0,
    PLA_LIT_ZERO,
    PLA_LIT_ONE,
    PLA_LIT_FULL
} Pla_Lit_t;

Function Documentation

Pla_ManComputeDist1Test()

void Pla_ManComputeDist1Test ( Pla_Man_t * p )

extern

Definition at line 333 of file plaHash.c.

{
    Vec_Int_t * vPairs;
    Pla_ManConvertFromBits( p );
    vPairs = Pla_ManComputeDistance1( p );
    Vec_IntFree( vPairs );
}

Here is the call graph for this function:

Pla_ManConvertFromBits()

void Pla_ManConvertFromBits ( Pla_Man_t * p )

extern

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 221 of file plaMan.c.

{
    Vec_Int_t * vCube;
    word * pCube; int i, k, Lit, Count;
    Vec_WecClear( &p->vCubeLits );
    Vec_WecClear( &p->vOccurs );
    Vec_WecInit( &p->vCubeLits, Pla_ManCubeNum(p) );
    Vec_WecInit( &p->vOccurs, 2*Pla_ManInNum(p) );
    Pla_ForEachCubeIn( p, pCube, i )
    {
        vCube = Vec_WecEntry( &p->vCubeLits, i );
 
        Count = 0;
        Pla_CubeForEachLitIn( p, pCube, Lit, k )
            if ( Lit != PLA_LIT_DASH )
                Count++;
        Vec_IntGrow( vCube, Count );
 
        Count = 0;
        Pla_CubeForEachLitIn( p, pCube, Lit, k )
            if ( Lit != PLA_LIT_DASH )
            {
                Lit = Abc_Var2Lit( k, Lit == PLA_LIT_ZERO );
                Vec_WecPush( &p->vCubeLits, i, Lit );
//                Vec_WecPush( &p->vOccurs, Lit, Pla_CubeHandle(i, Count++) );
                Vec_WecPush( &p->vOccurs, Lit, i );
            }
        assert( Vec_IntSize(vCube) == Vec_IntCap(vCube) );
    }
}

Here is the caller graph for this function:

Pla_ManConvertToBits()

void Pla_ManConvertToBits ( Pla_Man_t * p )

extern

Definition at line 251 of file plaMan.c.

{
    Vec_Int_t * vCube; int i, k, Lit;
    Vec_IntFillNatural( &p->vCubes, Vec_WecSize(&p->vCubeLits) );
    Vec_WrdFill( &p->vInBits,  Pla_ManCubeNum(p) * p->nInWords,  0 );
    Vec_WecForEachLevel( &p->vCubeLits, vCube, i )
        Vec_IntForEachEntry( vCube, Lit, k )
            Pla_CubeSetLit( Pla_CubeIn(p, i), Abc_Lit2Var(Lit), Abc_LitIsCompl(Lit) ? PLA_LIT_ZERO : PLA_LIT_ONE );
}

Pla_ManDist1Merge()

int Pla_ManDist1Merge ( Pla_Man_t * p )

extern

DECLARATIONS ///.

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

FileName [plaMerge.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [SOP manager.]

Synopsis [Scalable SOP transformations.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - March 18, 2015.]

Revision [

Id

plaMerge.c,v 1.00 2014/09/12 00:00:00 alanmi Exp

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 44 of file plaMerge.c.

{
    return 0;
}

Pla_ManDist1NumTest()

int Pla_ManDist1NumTest ( Pla_Man_t * p )

extern

Definition at line 285 of file plaMan.c.

{
    abctime clk = Abc_Clock();
    int Count = Pla_ManDist1Num( p );
    printf( "Found %d pairs among %d cubes using cube pair enumeration.  ", Count, Pla_ManCubeNum(p) );
    Abc_PrintTime( 1, "Time", Abc_Clock() - clk );
    return 1;
}

Here is the call graph for this function:

Pla_ManFxPerformSimple()

int Pla_ManFxPerformSimple ( int nVars )

extern

Definition at line 323 of file plaSimple.c.

{
    char Buffer[100];
    Pla_Man_t * p = Pla_ManFxPrepare( nVars );
    sprintf( Buffer, "primesmin%02d.pla", nVars );
    Pla_ManDumpPla( p, Buffer );
    Pla_ManFree( p );
    return 1;
}

Here is the call graph for this function:

Pla_ManGenerate()

Pla_Man_t * Pla_ManGenerate ( int nIns, int nOuts, int nCubes, int fVerbose )

extern

Definition at line 168 of file plaMan.c.

{
    Pla_Man_t * p;
    Vec_Bit_t * vBits;
    int i, k, Count;
    word * pCube;
    char Buffer[1000];
    sprintf( Buffer, "%s_%d_%d_%d", "rand", nInputs, nOutputs, nCubes );
    p = Pla_ManAlloc( Buffer, nInputs, nOutputs, nCubes );
    // generate nCube random input minterms
    vBits = Pla_GenRandom( nInputs, nCubes, 0 );
    for ( i = Count = 0; i < Vec_BitSize(vBits); i++ )
        if ( Vec_BitEntry(vBits, i) )
        {
            pCube = Pla_CubeIn( p, Count++ );
            for ( k = 0; k < nInputs; k++ )
                Pla_CubeSetLit( pCube, k, ((i >> k) & 1) ? PLA_LIT_ONE : PLA_LIT_ZERO );
        }
    assert( Count == nCubes );
    Vec_BitFree( vBits );
    // generate nCube random output minterms
    if ( nOutputs > 1 )
    {
        vBits = Pla_GenRandom( nOutputs, nCubes, 1 );
        for ( i = Count = 0; i < Vec_BitSize(vBits); i++ )
            if ( Vec_BitEntry(vBits, i) )
            {
                pCube = Pla_CubeOut( p, Count++ );
                for ( k = 0; k < nOutputs; k++ )
                    Pla_CubeSetLit( pCube, k, ((i >> k) & 1) ? PLA_LIT_ONE : PLA_LIT_ZERO );
            }
        assert( Count == nCubes );
        Vec_BitFree( vBits );
    }
    else
    {
        Pla_ForEachCubeOut( p, pCube, i )
            Pla_CubeSetLit( pCube, 0, PLA_LIT_ONE );
    }
    return p;
}

Here is the call graph for this function:

Pla_ManHashDist1NumTest()

int Pla_ManHashDist1NumTest ( Pla_Man_t * p )

extern

Definition at line 212 of file plaHash.c.

{
    abctime clk = Abc_Clock();
    int Count = Pla_ManHashDistance1( p );
    printf( "Found %d pairs among %d cubes using cube hashing.  ", Count, Pla_ManCubeNum(p) );
    Abc_PrintTime( 1, "Time", Abc_Clock() - clk );
    return 1;
}

Here is the call graph for this function:

Pla_ManPrimesDetector()

Pla_Man_t * Pla_ManPrimesDetector ( int nVars )

extern

Definition at line 128 of file plaMan.c.

{
    char pName[1000];
    Pla_Man_t * p;
    Vec_Int_t * vMints = Pla_GenPrimes( nVars );
    sprintf( pName, "primes%02d", nVars );
    p = Pla_GenFromMinterms( pName, vMints, nVars );
    Vec_IntFree( vMints );
    return p;
}

Here is the call graph for this function:

Pla_ManPrimesTable()

Vec_Bit_t * Pla_ManPrimesTable ( int nVars )

extern

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

Synopsis [Generates prime detector for the given bit-widths.]

Description []

SideEffects []

SeeAlso []

Definition at line 85 of file plaMan.c.

{
    int i, n, nBits = 1 << nVars;
    Vec_Bit_t * vMap = Vec_BitStartFull( Abc_MaxInt(64, nBits) );
    for ( i = nBits; i < 64; i++ )
        Vec_BitWriteEntry( vMap, i, 0 );
    Vec_BitShrink( vMap, nBits );
    Vec_BitWriteEntry( vMap, 0, 0 );
    Vec_BitWriteEntry( vMap, 1, 0 );
    for ( n = 2; n < nBits; n++ )
        if ( Vec_BitEntry(vMap, n) )
            for ( i = 2*n; i < nBits; i += n )
                Vec_BitWriteEntry( vMap, i, 0 );
    return vMap;
}

Here is the caller graph for this function:

Pla_ReadPla()

Pla_Man_t * Pla_ReadPla ( char * pFileName )

extern

Definition at line 186 of file plaRead.c.

{   
    Pla_Man_t * p;
    Vec_Str_t * vLits;
    int nIns, nOuts, nCubes, Type;
    char * pBuffer, * pLimit;   
    pBuffer = Pla_ReadFile( pFileName, &pLimit );
    if ( pBuffer == NULL )
        return NULL;
    Pla_ReadPlaRemoveComments( pBuffer, pLimit );
    if ( Pla_ReadPlaHeader( pBuffer, pLimit, &nIns, &nOuts, &nCubes, &Type ) )
    {
        vLits = Pla_ReadPlaBody( pBuffer, pLimit, (Pla_File_t)Type );
        if ( Vec_StrSize(vLits) % (nIns + nOuts) == 0 )
        {
            if ( nCubes == -1 )
                nCubes = Vec_StrSize(vLits) / (nIns + nOuts);
            p = Pla_ManAlloc( pFileName, nIns, nOuts, nCubes );
            p->Type = (Pla_File_t)Type;
            Pla_ReadAddBody( p, vLits );
            Vec_StrFree( vLits );
            ABC_FREE( pBuffer );
            return p;
        }
        printf( "Literal count is incorrect (in = %d; out = %d; lit = %d).\n", nIns, nOuts, Vec_StrSize(vLits) );
        Vec_StrFree( vLits );
    }
    ABC_FREE( pBuffer );
    return NULL;
}

Here is the call graph for this function:

Pla_WritePla()

void Pla_WritePla ( Pla_Man_t * p, char * pFileName )

extern

Definition at line 88 of file plaWrite.c.

{
    Vec_Str_t * vOut = Pla_WritePlaInt( p );
    if ( Vec_StrSize(vOut) > 0 )
    {
        FILE * pFile = fopen( pFileName, "wb" );
        if ( pFile == NULL )
            printf( "Cannot open file \"%s\" for writing.\n", pFileName );
        else
        {
            fwrite( Vec_StrArray(vOut), 1, Vec_StrSize(vOut), pFile );
            fclose( pFile );
        }
    }
    Vec_StrFreeP( &vOut );
}

Here is the call graph for this function: