plaHash.c File Reference

#include "pla.h"

Include dependency graph for plaHash.c:

Go to the source code of this file.

Classes
struct	Tab_Obj_t_
struct	Tab_Man_t_

Macros
#define	PLA_HASH_VALUE_NUM   256
	DECLARATIONS ///.
#define	PLA_LIT_UNUSED   0xFFFF

Typedefs
typedef struct Tab_Obj_t_	Tab_Obj_t
typedef struct Tab_Man_t_	Tab_Man_t

Functions
void	Pla_ManHashCubes (Pla_Man_t *p, Tab_Man_t *pTab)
int	Pla_ManHashDistance1 (Pla_Man_t *p)
int	Pla_ManHashDist1NumTest (Pla_Man_t *p)
void	Pla_PrintCube (Vec_Int_t *vLits, int nVars, int iVar)
void	Pla_ManHashCubes2 (Pla_Man_t *p, Tab_Man_t *pTab)
void	Vec_IntCopySkip (Vec_Int_t *vCube, int iVar, Vec_Int_t *vRes)
Vec_Int_t *	Pla_ManComputeDistance1Int (Pla_Man_t *p)
Vec_Int_t *	Pla_ManComputeDistance1 (Pla_Man_t *p)
void	Pla_ManComputeDist1Test (Pla_Man_t *p)

Macro Definition Documentation

PLA_HASH_VALUE_NUM

#define PLA_HASH_VALUE_NUM   256

DECLARATIONS ///.

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

FileName [plaHash.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

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

]

Definition at line 29 of file plaHash.c.

PLA_LIT_UNUSED

#define PLA_LIT_UNUSED   0xFFFF

Definition at line 69 of file plaHash.c.

Typedef Documentation

Tab_Man_t

typedef struct Tab_Man_t_ Tab_Man_t

Definition at line 80 of file plaHash.c.

Tab_Obj_t

typedef struct Tab_Obj_t_ Tab_Obj_t

Definition at line 71 of file plaHash.c.

Function Documentation

Pla_ManComputeDist1Test()

void Pla_ManComputeDist1Test

(

Pla_Man_t *

p

)

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_ManComputeDistance1()

Vec_Int_t * Pla_ManComputeDistance1

(

Pla_Man_t *

p

)

Definition at line 325 of file plaHash.c.

{
    abctime clk = Abc_Clock();
    Vec_Int_t * vPairs = Pla_ManComputeDistance1Int( p );
    printf( "Found %d pairs among %d cubes using cube hashing.  ", Vec_IntSize(vPairs)/4, Pla_ManCubeNum(p) );
    Abc_PrintTime( 1, "Time", Abc_Clock() - clk );
    return vPairs;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Pla_ManComputeDistance1Int()

Vec_Int_t * Pla_ManComputeDistance1Int

(

Pla_Man_t *

p

)

Definition at line 265 of file plaHash.c.

{
    Tab_Man_t * pTab;
    Vec_Int_t * vCube1, * vCube2;
    Vec_Int_t * vTemp1 = Vec_IntAlloc( 100 );
    Vec_Int_t * vTemp2 = Vec_IntAlloc( 100 );
    Vec_Int_t * vPairs = Vec_IntAlloc( 1000 );
    Vec_Int_t * vCounts = Vec_IntStart( Vec_WecSize(&p->vCubeLits) );
    Vec_Int_t * vEntries = Vec_IntAlloc( p->nIns );
    int nBits = Abc_Base2Log( Vec_WecSizeSize(&p->vCubeLits) ) + 2;
    int v, i, k;//, Count = 0;
    int iCube1, iCube2, iVar1, iVar2;
    assert( nBits <= 26 );
    pTab = Tab_ManAlloc( nBits, p );
    //Pla_ManConvertFromBits( p );
    Pla_ManHashCubes2( p, pTab );
    // iterate through the hash bins
    for ( v = 0; v <= pTab->SizeMask; v++ )
    {
        Tab_ManHashCollect( pTab, v, vEntries );
        for ( i = 0; i < Vec_IntSize(vEntries)/2; i++ )
        for ( k = i+1; k < Vec_IntSize(vEntries)/2; k++ )
        {
            iCube1 = Vec_IntEntry(vEntries, 2*i);
            iCube2 = Vec_IntEntry(vEntries, 2*k);
            iVar1 = Vec_IntEntry(vEntries, 2*i+1);
            iVar2 = Vec_IntEntry(vEntries, 2*k+1);
 
            vCube1 = Vec_WecEntry(&p->vCubeLits, iCube1);
            vCube2 = Vec_WecEntry(&p->vCubeLits, iCube2);
/*
            Pla_PrintCube( vCube1, p->nIns, iVar1 );
            Pla_PrintCube( vCube2, p->nIns, iVar2 );
            printf( "\n" );
*/
            if ( Vec_IntSize(vCube1) != Vec_IntSize(vCube2) )
                continue;
            Vec_IntCopySkip( vCube1, iVar1, vTemp1 );
            Vec_IntCopySkip( vCube2, iVar2, vTemp2 );
            if ( !Vec_IntEqual( vTemp1, vTemp2 ) )
                continue;
 
            printf( "%d %d  ", iCube1, iCube2 );
 
            Vec_IntPushTwo( vPairs, iCube1, iVar1 );
            Vec_IntPushTwo( vPairs, iCube2, iVar2 );
 
            Vec_IntAddToEntry( vCounts, iCube1, 1 );
            Vec_IntAddToEntry( vCounts, iCube2, 1 );
        }
    }
    Vec_IntPrint( vCounts );
 
    Vec_IntFree( vCounts );
    Vec_IntFree( vTemp1 );
    Vec_IntFree( vTemp2 );
    Vec_IntFree( vEntries );
    Tab_ManFree( pTab );
    return vPairs;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Pla_ManHashCubes()

void Pla_ManHashCubes	(	Pla_Man_t *	p,
		Tab_Man_t *	pTab )

Definition at line 166 of file plaHash.c.

{
    Vec_Int_t * vCube; int i, Value;
    Vec_IntClear( &p->vHashes );
    Vec_IntGrow( &p->vHashes, Pla_ManCubeNum(p) );
    Vec_WecForEachLevel( &p->vCubeLits, vCube, i )
    {
        Value = Pla_CubeHashValue(vCube);
        Vec_IntPush( &p->vHashes, Value );
        Tab_ManHashInsert( pTab, Value, i, PLA_LIT_UNUSED );
    }
}

Here is the caller graph for this function:

Pla_ManHashCubes2()

void Pla_ManHashCubes2	(	Pla_Man_t *	p,
		Tab_Man_t *	pTab )

Definition at line 242 of file plaHash.c.

{
    Vec_Int_t * vCube; 
    int i, v, Lit, Value;
    Vec_WecForEachLevel( &p->vCubeLits, vCube, i )
    {
        Value = Pla_CubeHashValue(vCube);
        Vec_IntForEachEntry( vCube, Lit, v )
        {
            Value -= Pla_HashValue(Lit);
            Tab_ManHashInsert( pTab, Value, i, v );
            Value += Pla_HashValue(Lit);
        }
    }
}

Here is the caller graph for this function:

Pla_ManHashDist1NumTest()

int Pla_ManHashDist1NumTest

(

Pla_Man_t *

p

)

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_ManHashDistance1()

int Pla_ManHashDistance1

(

Pla_Man_t *

p

)

Definition at line 178 of file plaHash.c.

{
    Tab_Man_t * pTab;
    Vec_Int_t * vCube;
    Vec_Int_t * vCubeCopy = Vec_IntAlloc( p->nIns );
    int nBits = Abc_Base2Log( Pla_ManCubeNum(p) ) + 2;
    int i, k, Lit, Value, ValueCopy, Count = 0;
    assert( nBits <= 26 );
    pTab = Tab_ManAlloc( nBits, p );
    Pla_ManConvertFromBits( p );
    Pla_ManHashCubes( p, pTab );
    Vec_WecForEachLevel( &p->vCubeLits, vCube, i )
    {
        Vec_IntClear( vCubeCopy );
        Vec_IntAppend( vCubeCopy, vCube );
        Value = ValueCopy = Vec_IntEntry( &p->vHashes, i );
        Vec_IntForEachEntry( vCubeCopy, Lit, k )
        {
            // create new
            Value += Pla_HashValue(Abc_LitNot(Lit)) - Pla_HashValue(Lit);
            Vec_IntWriteEntry( vCubeCopy, k, Abc_LitNot(Lit) );
            // check the cube
            Count += Tab_ManHashLookup( pTab, Value, vCubeCopy );
            // create old
            Value -= Pla_HashValue(Abc_LitNot(Lit)) - Pla_HashValue(Lit);
            Vec_IntWriteEntry( vCubeCopy, k, Lit );
        }
        assert( Value == ValueCopy );
    }
    Vec_IntFree( vCubeCopy );
    Tab_ManFree( pTab );
    assert( !(Count & 1) );
    return Count/2;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Pla_PrintCube()

void Pla_PrintCube	(	Vec_Int_t *	vLits,
		int	nVars,
		int	iVar )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 232 of file plaHash.c.

{
    int v, Lit;
    Vec_Str_t * vStr = Vec_StrStart( nVars + 1 );
    Vec_StrFill( vStr, nVars, '-' );
    Vec_IntForEachEntry( vLits, Lit, v )
        Vec_StrWriteEntry( vStr, Abc_Lit2Var(Lit), (char)(Abc_LitIsCompl(Lit) ? '0' : '1') );
    fprintf( stdout, "%s %d\n", Vec_StrArray(vStr), iVar );
    Vec_StrFree( vStr );
}

Vec_IntCopySkip()

void Vec_IntCopySkip	(	Vec_Int_t *	vCube,
		int	iVar,
		Vec_Int_t *	vRes )

Definition at line 257 of file plaHash.c.

{
    int i;
    Vec_IntClear( vRes );
    for ( i = 0; i < Vec_IntSize(vCube); i++ )
        if ( i != iVar )
            Vec_IntPush( vRes, Vec_IntEntry(vCube, i) );
}

Here is the caller graph for this function: