extraUtilMult.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include "misc/vec/vec.h"
#include "aig/gia/gia.h"

Include dependency graph for extraUtilMult.c:

Go to the source code of this file.

Classes
struct	Abc_BddMan_

Typedefs
typedef typedefABC_NAMESPACE_IMPL_START struct Abc_BddMan_	Abc_BddMan
	DECLARATIONS ///.

Functions
Abc_BddMan *	Abc_BddManAlloc (int nVars, int nObjs)
void	Abc_BddManFree (Abc_BddMan *p)
int	Abc_BddAnd (Abc_BddMan *p, int a, int b)
int	Abc_BddOr (Abc_BddMan *p, int a, int b)
int	Abc_BddCount_rec (Abc_BddMan *p, int i)
void	Abc_BddUnmark_rec (Abc_BddMan *p, int i)
int	Abc_BddCountNodes (Abc_BddMan *p, int i)
int	Abc_BddCountNodesArray (Abc_BddMan *p, Vec_Int_t *vNodes)
int	Abc_BddCountNodesArray2 (Abc_BddMan *p, Vec_Int_t *vNodes)
void	Abc_BddPrint_rec (Abc_BddMan *p, int a, int *pPath)
void	Abc_BddPrint (Abc_BddMan *p, int a)
void	Abc_BddPrintTest (Abc_BddMan *p)
void	Abc_BddGiaTest2 (Gia_Man_t *pGia, int fVerbose)
void	Abc_BddGiaTest (Gia_Man_t *pGia, int fVerbose)

Typedef Documentation

Abc_BddMan

typedef typedefABC_NAMESPACE_IMPL_START struct Abc_BddMan_ Abc_BddMan

DECLARATIONS ///.

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

FileName [extraUtilMult.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [extra]

Synopsis [Simple BDD package.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - May 23, 2018.]

Revision [

Id

extraUtilMult.c,v 1.0 2018/05/23 00:00:00 alanmi Exp

]

Definition at line 34 of file extraUtilMult.c.

Function Documentation

Abc_BddAnd()

int Abc_BddAnd	(	Abc_BddMan *	p,
		int	a,
		int	b )

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

Synopsis [Boolean AND.]

Description []

SideEffects []

SeeAlso []

Definition at line 194 of file extraUtilMult.c.

{
    int r0, r1, r;
    if ( a == 0 ) return 0;
    if ( b == 0 ) return 0;
    if ( a == 1 ) return b;
    if ( b == 1 ) return a;
    if ( a == b ) return a;
    if ( a > b )  return Abc_BddAnd( p, b, a );
    if ( (r = Abc_BddCacheLookup(p, a, b)) >= 0 )
        return r;
    if ( Abc_BddVar(p, a) < Abc_BddVar(p, b) )
        r0 = Abc_BddAnd( p, Abc_BddElse(p, a), b ), 
        r1 = Abc_BddAnd( p, Abc_BddThen(p, a), b );
    else if ( Abc_BddVar(p, a) > Abc_BddVar(p, b) )
        r0 = Abc_BddAnd( p, a, Abc_BddElse(p, b) ), 
        r1 = Abc_BddAnd( p, a, Abc_BddThen(p, b) );
    else // if ( Abc_BddVar(p, a) == Abc_BddVar(p, b) )
        r0 = Abc_BddAnd( p, Abc_BddElse(p, a), Abc_BddElse(p, b) ), 
        r1 = Abc_BddAnd( p, Abc_BddThen(p, a), Abc_BddThen(p, b) );
    r = Abc_BddUniqueCreate( p, Abc_MinInt(Abc_BddVar(p, a), Abc_BddVar(p, b)), r1, r0 );
    return Abc_BddCacheInsert( p, a, b, r );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_BddCount_rec()

int Abc_BddCount_rec	(	Abc_BddMan *	p,
		int	i )

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

Synopsis [Counting nodes.]

Description []

SideEffects []

SeeAlso []

Definition at line 233 of file extraUtilMult.c.

{
    if ( i < 2 )
        return 0;
    if ( Abc_BddMark(p, i) )
        return 0;
    Abc_BddSetMark( p, i, 1 );
    return 1 + Abc_BddCount_rec(p, Abc_BddElse(p, i)) + Abc_BddCount_rec(p, Abc_BddThen(p, i));
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_BddCountNodes()

int Abc_BddCountNodes	(	Abc_BddMan *	p,
		int	i )

Definition at line 252 of file extraUtilMult.c.

{
    int Count = Abc_BddCount_rec( p, i );
    Abc_BddUnmark_rec( p, i );
    return Count;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_BddCountNodesArray()

int Abc_BddCountNodesArray	(	Abc_BddMan *	p,
		Vec_Int_t *	vNodes )

Definition at line 258 of file extraUtilMult.c.

{
    int i, a, Count = 0;
    Vec_IntForEachEntry( vNodes, a, i )
        Count += Abc_BddCount_rec( p, a );
    Vec_IntForEachEntry( vNodes, a, i )
        Abc_BddUnmark_rec( p, a );
    return Count;
}

Here is the call graph for this function:

Abc_BddCountNodesArray2()

int Abc_BddCountNodesArray2	(	Abc_BddMan *	p,
		Vec_Int_t *	vNodes )

Definition at line 267 of file extraUtilMult.c.

{
    int i, a, Count = 0;
    Vec_IntForEachEntry( vNodes, a, i )
    {
        Count += Abc_BddCount_rec( p, a );
        Abc_BddUnmark_rec( p, a );
    }
    return Count;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_BddGiaTest()

void Abc_BddGiaTest	(	Gia_Man_t *	pGia,
		int	fVerbose )

Definition at line 350 of file extraUtilMult.c.

{
    Abc_BddMan * p;
    Vec_Int_t * vNodes;
    Gia_Obj_t * pObj; int i;
    p = Abc_BddManAlloc( Gia_ManCiNum(pGia), 1 << 20 ); // 30 B/node
    Gia_ManFillValue( pGia );
    Gia_ManConst0(pGia)->Value = 0;
    Gia_ManForEachCi( pGia, pObj, i )
        pObj->Value = Abc_BddIthVar( i );
    vNodes = Vec_IntAlloc( Gia_ManAndNum(pGia) );
    Gia_ManForEachAnd( pGia, pObj, i )
    {
        int Cof0 = Abc_LitNotCond(Gia_ObjFanin0(pObj)->Value, Gia_ObjFaninC0(pObj));
        int Cof1 = Abc_LitNotCond(Gia_ObjFanin1(pObj)->Value, Gia_ObjFaninC1(pObj));
        pObj->Value = Abc_BddAnd( p, Cof0, Cof1 );
    }
    Gia_ManForEachCo( pGia, pObj, i )
        pObj->Value = Abc_LitNotCond(Gia_ObjFanin0(pObj)->Value, Gia_ObjFaninC0(pObj));
    Gia_ManForEachCo( pGia, pObj, i )
    {
        if ( fVerbose )
            Abc_BddPrint( p, pObj->Value );
        Vec_IntPush( vNodes, pObj->Value );
    }
    printf( "Shared nodes = %d.\n", Abc_BddCountNodesArray2(p, vNodes) );
    Vec_IntFree( vNodes );
    Abc_BddManFree( p );
}

Here is the call graph for this function:

Abc_BddGiaTest2()

void Abc_BddGiaTest2	(	Gia_Man_t *	pGia,
		int	fVerbose )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 343 of file extraUtilMult.c.

{
    Abc_BddMan * p = Abc_BddManAlloc( 10, 100 );
    Abc_BddPrintTest( p );
    Abc_BddManFree( p );
}

Here is the call graph for this function:

Abc_BddManAlloc()

Abc_BddMan * Abc_BddManAlloc	(	int	nVars,
		int	nObjs )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 145 of file extraUtilMult.c.

{
    Abc_BddMan * p; int i;
    p = ABC_CALLOC( Abc_BddMan, 1 );
    p->nVars       = nVars;
    p->nObjsAlloc  = nObjs;
    p->nUniqueMask = (1 << Abc_Base2Log(nObjs)) - 1;
    p->nCacheMask  = (1 << Abc_Base2Log(nObjs)) - 1;
    p->pUnique     = ABC_CALLOC( int, p->nUniqueMask + 1 );
    p->pNexts      = ABC_CALLOC( int, p->nObjsAlloc );
    p->pCache      = ABC_CALLOC( int, 3*(p->nCacheMask + 1) );
    p->pObjs       = ABC_CALLOC( int, 2*p->nObjsAlloc );
    p->pMark       = ABC_CALLOC( unsigned char, p->nObjsAlloc );
    p->pVars       = ABC_CALLOC( unsigned char, p->nObjsAlloc );
    p->pVars[0]    = 0xff;
    p->nObjs       = 1;
    for ( i = 0; i < nVars; i++ )
        Abc_BddUniqueCreate( p, i, 1, 0 );
    assert( p->nObjs == nVars + 1 );
    p->nMemory = sizeof(Abc_BddMan)/4 + 
        p->nUniqueMask + 1 + p->nObjsAlloc + 
        (p->nCacheMask + 1) * 3 * sizeof(int)/4 + 
        p->nObjsAlloc * 2 * sizeof(int)/4;
    return p;
}

Here is the caller graph for this function:

Abc_BddManFree()

void Abc_BddManFree

(

Abc_BddMan *

p

)

Definition at line 170 of file extraUtilMult.c.

{
    printf( "BDD stats: Var = %d  Obj = %d  Alloc = %d  Hit = %d  Miss = %d  ", 
        p->nVars, p->nObjs, p->nObjsAlloc, p->nCacheLookups-p->nCacheMisses, p->nCacheMisses );
    printf( "Mem = %.2f MB\n", 4.0*(int)(p->nMemory/(1<<20)) );
    ABC_FREE( p->pUnique );
    ABC_FREE( p->pNexts );
    ABC_FREE( p->pCache );
    ABC_FREE( p->pObjs );
    ABC_FREE( p->pVars );
    ABC_FREE( p );
}

Here is the caller graph for this function:

Abc_BddOr()

int Abc_BddOr	(	Abc_BddMan *	p,
		int	a,
		int	b )

Definition at line 217 of file extraUtilMult.c.

{
    return Abc_LitNot( Abc_BddAnd(p, Abc_LitNot(a), Abc_LitNot(b)) );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_BddPrint()

void Abc_BddPrint	(	Abc_BddMan *	p,
		int	a )

Definition at line 310 of file extraUtilMult.c.

{
    int * pPath = ABC_FALLOC( int, p->nVars );
    printf( "BDD %d = ", a );
    Abc_BddPrint_rec( p, a, pPath );
    ABC_FREE( pPath );
    printf( "\n" );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_BddPrint_rec()

void Abc_BddPrint_rec	(	Abc_BddMan *	p,
		int	a,
		int *	pPath )

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

Synopsis [Printing BDD.]

Description []

SideEffects []

SeeAlso []

Definition at line 291 of file extraUtilMult.c.

{
    if ( a == 0 ) 
        return;
    if ( a == 1 )
    { 
        int i;
        for ( i = 0; i < p->nVars; i++ )
            if ( pPath[i] == 0 || pPath[i] == 1 )
                printf( "%c%d", pPath[i] ? '+' : '-', i );
        printf( " " );
        return; 
    }
    pPath[Abc_BddVar(p, a)] =  0;
    Abc_BddPrint_rec( p, Abc_BddElse(p, a), pPath );
    pPath[Abc_BddVar(p, a)] =  1;
    Abc_BddPrint_rec( p, Abc_BddThen(p, a), pPath );
    pPath[Abc_BddVar(p, a)] = -1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_BddPrintTest()

void Abc_BddPrintTest

(

Abc_BddMan *

p

)

Definition at line 318 of file extraUtilMult.c.

{
    int bVarA = Abc_BddIthVar(0);
    int bVarB = Abc_BddIthVar(1);
    int bVarC = Abc_BddIthVar(2);
    int bVarD = Abc_BddIthVar(3);
    int bAndAB = Abc_BddAnd( p, bVarA, bVarB );
    int bAndCD = Abc_BddAnd( p, bVarC, bVarD );
    int bFunc  = Abc_BddOr( p, bAndAB, bAndCD );
    Abc_BddPrint( p, bFunc );
    printf( "Nodes = %d\n", Abc_BddCountNodes(p, bFunc) );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_BddUnmark_rec()

void Abc_BddUnmark_rec	(	Abc_BddMan *	p,
		int	i )

Definition at line 242 of file extraUtilMult.c.

{
    if ( i < 2 )
        return;
    if ( !Abc_BddMark(p, i) )
        return;
    Abc_BddSetMark( p, i, 0 );
    Abc_BddUnmark_rec( p, Abc_BddElse(p, i) );
    Abc_BddUnmark_rec( p, Abc_BddThen(p, i) );
}

Here is the call graph for this function:

Here is the caller graph for this function: