acec2Mult.c File Reference

#include "acecInt.h"
#include "misc/vec/vecMem.h"
#include "misc/util/utilTruth.h"

Include dependency graph for acec2Mult.c:

Go to the source code of this file.

Classes
struct	Sdb_Cut_t_
struct	Sdb_Sto_t_

Macros
#define	SDB_MAX_CUTSIZE   6
	DECLARATIONS ///.
#define	SDB_MAX_CUTNUM   51
#define	SDB_MAX_TT_WORDS   ((SDB_MAX_CUTSIZE > 6) ? 1 << (SDB_MAX_CUTSIZE-6) : 1)
#define	SDB_CUT_NO_LEAF   0xF
#define	Sdb_ForEachCut(pList, pCut, i)

Typedefs
typedef struct Sdb_Cut_t_	Sdb_Cut_t
typedef struct Sdb_Sto_t_	Sdb_Sto_t

Functions
void	Sdb_StoMergeCuts (Sdb_Sto_t *p, int iObj)
int	Sdb_StoDiffExactlyOne (Vec_Wec_t *vCuts, int Limit, int *pCut)
int	Sdb_StoDiffExactlyOne3 (Vec_Wec_t *vCuts, int Limit, int *pCut, int *pCount)
Vec_Int_t *	Sdb_StoFindAll (Vec_Wec_t *vCuts)
int	Sdb_StoDiffExactlyOne2 (Vec_Int_t *vAll, int *pCut)
Vec_Int_t *	Sdb_StoFindInputs (Vec_Wec_t *vCuts, int Front)
int	Sdb_StoIterCutsOne (Sdb_Sto_t *p, int iObj, int CutSize, int **ppCut)
Vec_Int_t *	Sdb_StoIterCuts (Sdb_Sto_t *p)
Sdb_Sto_t *	Sdb_StoAlloc (Gia_Man_t *pGia, int nCutSize, int nCutNum, int fCutMin, int fTruthMin, int fVerbose)
void	Sdb_StoFree (Sdb_Sto_t *p)
void	Sdb_StoComputeCutsConst0 (Sdb_Sto_t *p, int iObj)
void	Sdb_StoComputeCutsCi (Sdb_Sto_t *p, int iObj)
void	Sdb_StoComputeCutsNode (Sdb_Sto_t *p, int iObj)
void	Sdb_StoRefObj (Sdb_Sto_t *p, int iObj)
Vec_Int_t *	Sdb_StoComputeCutsDetect (Gia_Man_t *pGia)
void	Sdb_StoComputeCutsTest (Gia_Man_t *pGia)

Macro Definition Documentation

SDB_CUT_NO_LEAF

#define SDB_CUT_NO_LEAF   0xF

Definition at line 279 of file acec2Mult.c.

Sdb_ForEachCut

#define Sdb_ForEachCut	(		pList,
			pCut,
			i )

Value:

for ( i = 0, pCut = pList + 1; i < pList[0]; i++, pCut += pCut[0] + 2 )

Definition at line 317 of file acec2Mult.c.

SDB_MAX_CUTNUM

#define SDB_MAX_CUTNUM   51

Definition at line 276 of file acec2Mult.c.

SDB_MAX_CUTSIZE

#define SDB_MAX_CUTSIZE   6

DECLARATIONS ///.

Definition at line 275 of file acec2Mult.c.

SDB_MAX_TT_WORDS

#define SDB_MAX_TT_WORDS   ((SDB_MAX_CUTSIZE > 6) ? 1 << (SDB_MAX_CUTSIZE-6) : 1)

Definition at line 277 of file acec2Mult.c.

Typedef Documentation

Sdb_Cut_t

typedef struct Sdb_Cut_t_ Sdb_Cut_t

Definition at line 281 of file acec2Mult.c.

Sdb_Sto_t

typedef struct Sdb_Sto_t_ Sdb_Sto_t

Definition at line 293 of file acec2Mult.c.

Function Documentation

Sdb_StoAlloc()

Sdb_Sto_t * Sdb_StoAlloc	(	Gia_Man_t *	pGia,
		int	nCutSize,
		int	nCutNum,
		int	fCutMin,
		int	fTruthMin,
		int	fVerbose )

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

Synopsis [Incremental cut computation.]

Description []

SideEffects []

SeeAlso []

Definition at line 1114 of file acec2Mult.c.

{
    Sdb_Sto_t * p;
    assert( nCutSize < SDB_CUT_NO_LEAF );
    assert( nCutSize > 1 && nCutSize <= SDB_MAX_CUTSIZE );
    assert( nCutNum > 1 && nCutNum < SDB_MAX_CUTNUM );
    p = ABC_CALLOC( Sdb_Sto_t, 1 );
    p->clkStart  = Abc_Clock();
    p->nCutSize  = nCutSize;
    p->nCutNum   = nCutNum;
    p->fCutMin   = fCutMin;
    p->fTruthMin = fTruthMin;
    p->fVerbose  = fVerbose;
    p->pGia      = pGia;
    p->vRefs     = Vec_IntAlloc( Gia_ManObjNum(pGia) );
    p->vCuts     = Vec_WecStart( Gia_ManObjNum(pGia) );
    p->vTtMem    = fCutMin ? Vec_MemAllocForTT( nCutSize, 0 ) : NULL;
    return p;
}

Here is the caller graph for this function:

Sdb_StoComputeCutsCi()

void Sdb_StoComputeCutsCi	(	Sdb_Sto_t *	p,
		int	iObj )

Definition at line 1147 of file acec2Mult.c.

{
    Sdb_CutAddUnit( p, iObj );
}

Here is the caller graph for this function:

Sdb_StoComputeCutsConst0()

void Sdb_StoComputeCutsConst0	(	Sdb_Sto_t *	p,
		int	iObj )

Definition at line 1143 of file acec2Mult.c.

{
    Sdb_CutAddZero( p, iObj );
}

Here is the caller graph for this function:

Sdb_StoComputeCutsDetect()

Vec_Int_t * Sdb_StoComputeCutsDetect

(

Gia_Man_t *

pGia

)

Definition at line 1168 of file acec2Mult.c.

{
    Vec_Int_t * vRes = NULL;
    Sdb_Sto_t * p = Sdb_StoAlloc( pGia, 5, 20, 1, 0, 1 );
    Gia_Obj_t * pObj;   
    int i, iObj;
    // prepare references
    Gia_ManForEachObj( p->pGia, pObj, iObj )
        Sdb_StoRefObj( p, iObj );
    // compute cuts
    Sdb_StoComputeCutsConst0( p, 0 );
    Gia_ManForEachCiId( p->pGia, iObj, i )
        Sdb_StoComputeCutsCi( p, iObj );
    Gia_ManForEachAnd( p->pGia, pObj, iObj )
        Sdb_StoComputeCutsNode( p, iObj );
    if ( p->fVerbose )
    {
        printf( "Running cut computation with CutSize = %d  CutNum = %d:\n", p->nCutSize, p->nCutNum );
        printf( "CutPair = %.0f  ",         p->CutCount[0] );
        printf( "Merge = %.0f (%.2f %%)  ", p->CutCount[1], 100.0*p->CutCount[1]/p->CutCount[0] );
        printf( "Eval = %.0f (%.2f %%)  ",  p->CutCount[2], 100.0*p->CutCount[2]/p->CutCount[0] );
        printf( "Cut = %.0f (%.2f %%)  ",   p->CutCount[3], 100.0*p->CutCount[3]/p->CutCount[0] );
        printf( "Cut/Node = %.2f  ",        p->CutCount[3] / Gia_ManAndNum(p->pGia) );
        printf( "\n" );
        printf( "Over = %4d  ",             p->nCutsOver );
        Abc_PrintTime( 0, "Time", Abc_Clock() - p->clkStart );
    }
    vRes = Sdb_StoIterCuts( p );
    Sdb_StoFree( p );
    return vRes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Sdb_StoComputeCutsNode()

void Sdb_StoComputeCutsNode	(	Sdb_Sto_t *	p,
		int	iObj )

Definition at line 1151 of file acec2Mult.c.

{
    Sdb_StoMergeCuts( p, iObj );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Sdb_StoComputeCutsTest()

void Sdb_StoComputeCutsTest

(

Gia_Man_t *

pGia

)

Definition at line 1199 of file acec2Mult.c.

{
    Vec_Int_t * vRes = Sdb_StoComputeCutsDetect( pGia );
    Vec_IntFree( vRes );
}

Here is the call graph for this function:

Sdb_StoDiffExactlyOne()

int Sdb_StoDiffExactlyOne	(	Vec_Wec_t *	vCuts,
		int	Limit,
		int *	pCut )

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

Synopsis [Cut comparison.]

Description [Find out if there is a cut in vCuts such that pCut has only one extra input. If so, return this input.]

SideEffects []

SeeAlso []

Definition at line 795 of file acec2Mult.c.

{
    Vec_Int_t * vCut;  
    int i, k, iNew;
    // check if it is fully contained in any one
    Vec_WecForEachLevel( vCuts, vCut, i )
    {
        for ( k = 1; k <= pCut[0]; k++ )
            if ( Vec_IntFind(vCut, pCut[k]) == -1 )
                break;
        if ( k == pCut[0] + 1 )
            return -1;
    }
    // check if there is one different
    Vec_WecForEachLevel( vCuts, vCut, i )
    {
        if ( i == Limit )
            break;
        for ( iNew = -1, k = 1; k <= pCut[0]; k++ )
        {
            if ( Vec_IntFind(vCut, pCut[k]) >= 0 )
                continue;
            if ( iNew == -1 )
                iNew = pCut[k];
            else 
                break;
        }
        if ( k == pCut[0] + 1 && iNew != -1 )
            return iNew;
    }
    return -1;
}

Here is the caller graph for this function:

Sdb_StoDiffExactlyOne2()

int Sdb_StoDiffExactlyOne2	(	Vec_Int_t *	vAll,
		int *	pCut )

Definition at line 865 of file acec2Mult.c.

{
    int k, iNew = -1;
    for ( k = 1; k <= pCut[0]; k++ )
    {
        if ( Vec_IntFind(vAll, pCut[k]) >= 0 )
            continue;
        if ( iNew == -1 )
            iNew = pCut[k];
        else 
            break;
    }
    if ( k == pCut[0] + 1 && iNew != -1 )
        return iNew;
    return -1;
}

Sdb_StoDiffExactlyOne3()

int Sdb_StoDiffExactlyOne3	(	Vec_Wec_t *	vCuts,
		int	Limit,
		int *	pCut,
		int *	pCount )

Definition at line 827 of file acec2Mult.c.

{
    Vec_Int_t * vCut;  
    int i, iNewAll = -1, Count = 0;
    Vec_WecForEachLevel( vCuts, vCut, i )
    {
        int k, iNew = -1;
        if ( i == Limit )
            break;
        for ( k = 1; k <= pCut[0]; k++ )
        {
            if ( Vec_IntFind(vCut, pCut[k]) >= 0 )
                continue;
            if ( iNew == -1 )
                iNew = pCut[k];
            else 
                break;
        }
        if ( k == pCut[0] + 1 && iNew != -1 )
        {
            if ( iNewAll == -1 )
                iNewAll = iNew;
            if ( iNewAll == iNew )
                Count++;
        }
    }
    *pCount = Count;
    return iNewAll;
}

Sdb_StoFindAll()

Vec_Int_t * Sdb_StoFindAll

(

Vec_Wec_t *

vCuts

)

Definition at line 856 of file acec2Mult.c.

{
    int i, k, Entry;
    Vec_Int_t * vCut, * vAll = Vec_IntAlloc( 100 );  
    Vec_WecForEachLevel( vCuts, vCut, i )
        Vec_IntForEachEntry( vCut, Entry, k )
            Vec_IntPushUnique( vAll, Entry );
    return vAll;
}

Here is the caller graph for this function:

Sdb_StoFindInputs()

Vec_Int_t * Sdb_StoFindInputs	(	Vec_Wec_t *	vCuts,
		int	Front )

Definition at line 881 of file acec2Mult.c.

{
    int fVerbose = 0;
    Vec_Int_t * vCut, * vCounts;
    Vec_Int_t * vRes = Vec_IntAlloc( 100 );
    Vec_Int_t * vResA = Vec_IntAlloc( 100 );
    Vec_Int_t * vResB = Vec_IntAlloc( 100 );
    int i, k, Entry, Max = 0, Min, MinValue;
    // find MAX value
    Vec_WecForEachLevel( vCuts, vCut, i )
        Vec_IntForEachEntry( vCut, Entry, k )
            Max = Abc_MaxInt( Max, Entry );
    // count how many times each value appears
    vCounts = Vec_IntStart( Max + 1 );
    Vec_WecForEachLevel( vCuts, vCut, i )
        Vec_IntForEachEntry( vCut, Entry, k )
            Vec_IntAddToEntry( vCounts, Entry, 1 );
    Vec_IntWriteEntry( vCounts, 0, 0 );
    // print out
    if ( fVerbose )
    Vec_IntForEachEntry( vCounts, Entry, k )
        if ( Entry )
            printf( "%5d %5d\n", k, Entry );
    // collect first part
    MinValue = ABC_INFINITY;
    Vec_IntForEachEntry( vCounts, Entry, k )
        if ( Entry )
            MinValue = Abc_MinInt( MinValue, Entry );
    if ( MinValue == ABC_INFINITY )
        return vRes;
    Min = Vec_IntFind( vCounts, MinValue );
    Vec_IntPush( vResA, Min );
    Vec_IntWriteEntry( vCounts, Min, 0 );
    Vec_IntForEachEntry( vCounts, Entry, k )
        if ( Entry == MinValue || Entry == 2*MinValue )
        {
            Vec_IntPush( vResA, k );
            Vec_IntWriteEntry( vCounts, k, 0 );
        }
    // collect second parts
    MinValue = Vec_IntEntry( vCounts, Front );
    Min = Front;
    Vec_IntPush( vResB, Min );
    Vec_IntWriteEntry( vCounts, Min, 0 );
    Vec_IntForEachEntry( vCounts, Entry, k )
        if ( Entry == MinValue || Entry == 2*MinValue )
        {
            Vec_IntPush( vResB, k );
            Vec_IntWriteEntry( vCounts, k, 0 );
        }
    Vec_IntFree( vCounts );
    Vec_IntPrint( vResA );
    Vec_IntPrint( vResB );
    // here we need to order the inputs
 
    // append
    Vec_IntAppend( vRes, vResA );
    Vec_IntAppend( vRes, vResB );
    Vec_IntFree( vResA );
    Vec_IntFree( vResB );
    return vRes;
}

Here is the caller graph for this function:

Sdb_StoFree()

void Sdb_StoFree

(

Sdb_Sto_t *

p

)

Definition at line 1133 of file acec2Mult.c.

{
    Vec_IntFree( p->vRefs );
    Vec_WecFree( p->vCuts );
    if ( p->fCutMin )
        Vec_MemHashFree( p->vTtMem );
    if ( p->fCutMin )
        Vec_MemFree( p->vTtMem );
    ABC_FREE( p );
}

Here is the caller graph for this function:

Sdb_StoIterCuts()

Vec_Int_t * Sdb_StoIterCuts

(

Sdb_Sto_t *

p

)

Definition at line 1044 of file acec2Mult.c.

{
    Vec_Wec_t * v5Cuts = Vec_WecAlloc( 100 );
    Vec_Int_t * v5Cut, * vAll, * vRes;
    Gia_Obj_t * pObj;   
    int k, iObj, * pCut, Limit, iNew, iNewFront = -1, iNewBack = -1, iSigned = 0;
    Gia_ManForEachAnd( p->pGia, pObj, iObj )
    {
        int RetValue = Sdb_StoIterCutsOne( p, iObj, 5, &pCut );
        if ( RetValue == 0 )
            continue;
        assert( RetValue == 1 );
        assert( pCut[0] == 5 );
        v5Cut = Vec_WecPushLevel( v5Cuts );
        for ( k = 1; k <= pCut[0]; k++ )
            Vec_IntPush( v5Cut, pCut[k] );
    }
    Limit = Vec_WecSize( v5Cuts );
    printf( "Detected %d  5-cuts.\n", Vec_WecSize(v5Cuts) );
    vAll = Sdb_StoFindAll( v5Cuts );
    Gia_ManForEachAnd( p->pGia, pObj, iObj )
    {
        int RetValue = Sdb_StoIterCutsOne( p, iObj, 4, &pCut );
        if ( RetValue == 0 )
            continue;
        assert( RetValue >= 2 && RetValue <= 4 );
        assert( pCut[0] == 4 );
        // find cut, which differs in exactly one input
        iNew = Sdb_StoDiffExactlyOne( v5Cuts, Limit, pCut );
        if ( iNew == -1 )
            continue;
        if ( RetValue == 2 )
            iNewFront = iNew;
        else 
            iNewBack = iNew;
        if ( RetValue == 4 )
            iSigned = 1;
        // save in the second cut
        v5Cut = Vec_WecPushLevel( v5Cuts );
        Vec_IntPush( v5Cut, 0 );
        for ( k = 1; k <= pCut[0]; k++ )
            Vec_IntPush( v5Cut, pCut[k] );
    }
    Vec_IntFree( vAll );
    Vec_WecPrint( v5Cuts, 0 );
 
    if ( iNewFront )
        printf( "Front  = %d\n", iNewFront );
    if ( iNewBack )
        printf( "Back   = %d\n", iNewBack );
    if ( iSigned )
        printf( "Sign   = %d\n", iSigned );
 
    vRes = Sdb_StoFindInputs( v5Cuts, iNewFront );
 
    Vec_WecFree( v5Cuts );
    return vRes;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Sdb_StoIterCutsOne()

int Sdb_StoIterCutsOne	(	Sdb_Sto_t *	p,
		int	iObj,
		int	CutSize,
		int **	ppCut )

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

Synopsis [Iterate through the cuts.]

Description []

SideEffects []

SeeAlso []

Definition at line 955 of file acec2Mult.c.

{
    int fVerbose = 0;
    Vec_Int_t * vThis = Vec_WecEntry( p->vCuts, iObj );
    int i, k, * pCut, * pList = Vec_IntArray( vThis );
    word * pTruth;
    Sdb_ForEachCut( pList, pCut, i )
    {
        if ( pCut[0] != CutSize )
            continue;
        if ( pCut[0] == 5 )
        {
            pTruth = Vec_MemReadEntry(p->vTtMem, Abc_Lit2Var(pCut[pCut[0]+1]));
            for ( k = 0; k < s_nFuncTruths5; k++ )
                if ( s_FuncTruths5[k] == (unsigned)*pTruth )
                    break;
            if ( k < s_nFuncTruths5 )
            {
                if ( fVerbose )
                {
                    printf( "Object %d has %d-input cut:  ", iObj, pCut[0] );
                    for ( k = 1; k <= pCut[0]; k++ )
                        printf( "%d ", pCut[k] );
                    printf( "\n" );
                }
                *ppCut = pCut;
                return 1; // five-input
            }
        }
        if ( pCut[0] == 4 )
        {
            pTruth = Vec_MemReadEntry(p->vTtMem, Abc_Lit2Var(pCut[pCut[0]+1]));
            for ( k = 0; k < s_nFuncTruths4; k++ )
                if ( s_FuncTruths4[k] == (0xFFFF & (unsigned)*pTruth) )
                    break;
            if ( k < s_nFuncTruths4 )
            {
                if ( fVerbose )
                {
                    printf( "Object %d has %d-input cut:  ", iObj, pCut[0] );
                    for ( k = 1; k <= pCut[0]; k++ )
                        printf( "%d ", pCut[k] );
                    printf( "\n" );
                }
                *ppCut = pCut;
                return 2; // front
            }
        }
        if ( pCut[0] == 4 )
        {
            pTruth = Vec_MemReadEntry(p->vTtMem, Abc_Lit2Var(pCut[pCut[0]+1]));
            for ( k = 0; k < s_nFuncTruths4a; k++ )
                if ( s_FuncTruths4a[k] == (0xFFFF & (unsigned)*pTruth) )
                    break;
            if ( k < s_nFuncTruths4a )
            {
                if ( fVerbose )
                {
                    printf( "Object %d has %d-input cut:  ", iObj, pCut[0] );
                    for ( k = 1; k <= pCut[0]; k++ )
                        printf( "%d ", pCut[k] );
                    printf( "\n" );
                }
                *ppCut = pCut;
                return 3; // back unsigned
            }
        }
        if ( pCut[0] == 4 )
        {
            pTruth = Vec_MemReadEntry(p->vTtMem, Abc_Lit2Var(pCut[pCut[0]+1]));
            for ( k = 0; k < s_nFuncTruths4b; k++ )
                if ( s_FuncTruths4b[k] == (0xFFFF & (unsigned)*pTruth) )
                    break;
            if ( k < s_nFuncTruths4b )
            {
                if ( fVerbose )
                {
                    printf( "Object %d has %d-input cut:  ", iObj, pCut[0] );
                    for ( k = 1; k <= pCut[0]; k++ )
                        printf( "%d ", pCut[k] );
                    printf( "\n" );
                }
                *ppCut = pCut;
                return 4; // back signed
            }
        }
    }
    return 0;
}

Here is the caller graph for this function:

Sdb_StoMergeCuts()

void Sdb_StoMergeCuts	(	Sdb_Sto_t *	p,
		int	iObj )

Definition at line 726 of file acec2Mult.c.

{
    Gia_Obj_t * pObj = Gia_ManObj(p->pGia, iObj);
    int fIsXor       = Gia_ObjIsXor(pObj);
    int nCutSize     = p->nCutSize;
    int nCutNum      = p->nCutNum;
    int fComp0       = Gia_ObjFaninC0(pObj);
    int fComp1       = Gia_ObjFaninC1(pObj);
    int Fan0         = Gia_ObjFaninId0(pObj, iObj);
    int Fan1         = Gia_ObjFaninId1(pObj, iObj);
    int nCuts0       = Sdb_StoPrepareSet( p, Fan0, 0 );
    int nCuts1       = Sdb_StoPrepareSet( p, Fan1, 1 );
    int i, k, nCutsR = 0;
    Sdb_Cut_t * pCut0, * pCut1, ** pCutsR = p->ppCuts;
    assert( !Gia_ObjIsBuf(pObj) );
    assert( !Gia_ObjIsMux(p->pGia, pObj) );
    Sdb_StoInitResult( p );
    p->CutCount[0] += nCuts0 * nCuts1;
    for ( i = 0, pCut0 = p->pCuts[0]; i < nCuts0; i++, pCut0++ )
    for ( k = 0, pCut1 = p->pCuts[1]; k < nCuts1; k++, pCut1++ )
    {
        if ( (int)(pCut0->nLeaves + pCut1->nLeaves) > nCutSize && Sdb_CutCountBits(pCut0->Sign | pCut1->Sign) > nCutSize )
            continue;
        p->CutCount[1]++; 
        if ( !Sdb_CutMergeOrder(pCut0, pCut1, pCutsR[nCutsR], nCutSize) )
            continue;
        if ( Sdb_CutSetLastCutIsContained(pCutsR, nCutsR) )
            continue;
        p->CutCount[2]++;
        if ( p->fCutMin && Sdb_CutComputeTruth(p, pCut0, pCut1, fComp0, fComp1, pCutsR[nCutsR], fIsXor) )
            pCutsR[nCutsR]->Sign = Sdb_CutGetSign(pCutsR[nCutsR]);
        pCutsR[nCutsR]->nTreeLeaves = Sdb_CutTreeLeaves( p, pCutsR[nCutsR] );
        nCutsR = Sdb_CutSetAddCut( pCutsR, nCutsR, nCutNum );
    }
    p->CutCount[3] += nCutsR;
    p->nCutsOver += nCutsR == nCutNum-1;
    p->nCutsR = nCutsR;
    p->Pivot = iObj;
    // debug printout
    if ( 0 )
    {
        printf( "*** Obj = %4d  NumCuts = %4d\n", iObj, nCutsR );
        for ( i = 0; i < nCutsR; i++ )
            Sdb_CutPrint( p, iObj, pCutsR[i] );
        printf( "\n" );
    }
    // verify
    assert( nCutsR > 0 && nCutsR < nCutNum );
    assert( Sdb_CutSetCheckArray(pCutsR, nCutsR) );
    // store the cutset
    Sdb_StoStoreResult( p, iObj, pCutsR, nCutsR );
    if ( nCutsR > 1 || pCutsR[0]->nLeaves > 1 )
        Sdb_CutAddUnit( p, iObj );
}

Here is the caller graph for this function:

Sdb_StoRefObj()

void Sdb_StoRefObj	(	Sdb_Sto_t *	p,
		int	iObj )

Definition at line 1155 of file acec2Mult.c.

{
    Gia_Obj_t * pObj = Gia_ManObj(p->pGia, iObj);
    assert( iObj == Vec_IntSize(p->vRefs) );
    Vec_IntPush( p->vRefs, 0 );
    if ( Gia_ObjIsAnd(pObj) )
    {
        Vec_IntAddToEntry( p->vRefs, Gia_ObjFaninId0(pObj, iObj), 1 );
        Vec_IntAddToEntry( p->vRefs, Gia_ObjFaninId1(pObj, iObj), 1 );
    }
    else if ( Gia_ObjIsCo(pObj) )
        Vec_IntAddToEntry( p->vRefs, Gia_ObjFaninId0(pObj, iObj), 1 );
}

Here is the caller graph for this function: