giaPf.c File Reference

#include <float.h>
#include "gia.h"
#include "misc/st/st.h"
#include "map/mio/mio.h"
#include "misc/util/utilTruth.h"
#include "misc/extra/extra.h"
#include "base/main/main.h"
#include "misc/vec/vecMem.h"
#include "misc/vec/vecWec.h"
#include "opt/dau/dau.h"

Include dependency graph for giaPf.c:

Go to the source code of this file.

Classes
struct	Pf_Cut_t_
struct	Pf_Mat_t_
struct	Pf_Obj_t_
struct	Pf_Man_t_

Macros
#define	PF_LEAF_MAX   6
	DECLARATIONS ///.
#define	PF_CUT_MAX   32
#define	PF_NO_LEAF   31
#define	PF_NO_FUNC   0x3FFFFFF
#define	PF_INFINITY   FLT_MAX
#define	Pf_SetForEachCut(pList, pCut, i)
#define	Pf_ObjForEachCut(pCuts, i, nCuts)
#define	Pf_CutForEachLit(pCut, Conf, iLit, i)
#define	Pf_CutForEachVar(pCut, Conf, iVar, c, i)

Typedefs
typedef struct Pf_Cut_t_	Pf_Cut_t
typedef struct Pf_Mat_t_	Pf_Mat_t
typedef struct Pf_Obj_t_	Pf_Obj_t
typedef struct Pf_Man_t_	Pf_Man_t

Functions
void	Pf_StoCreateGateAdd (Pf_Man_t *pMan, word uTruth, int *pFans, int nFans, int CellId)
	FUNCTION DEFINITIONS ///.
void	Pf_StoCreateGate (Pf_Man_t *pMan, Mio_Cell_t *pCell, int **pComp, int **pPerm, int *pnPerms)
void	Pf_StoDeriveMatches (Pf_Man_t *p, int fVerbose)
void	Pf_StoPrintOne (Pf_Man_t *p, int Count, int t, int i, int GateId, Pf_Mat_t Mat)
void	Pf_StoPrint (Pf_Man_t *p, int fVerbose)
Pf_Man_t *	Pf_StoCreate (Gia_Man_t *pGia, Jf_Par_t *pPars)
void	Pf_StoDelete (Pf_Man_t *p)
void	Pf_ObjMergeOrder (Pf_Man_t *p, int iObj)
void	Pf_ManComputeCuts (Pf_Man_t *p)
void	Pf_ManPrintStats (Pf_Man_t *p, char *pTitle)
void	Pf_ManPrintInit (Pf_Man_t *p)
void	Pf_ManPrintQuit (Pf_Man_t *p)
void	Pf_ManComputeMapping (Pf_Man_t *p)
void	Pf_ManSetDefaultPars (Jf_Par_t *pPars)
Gia_Man_t *	Pf_ManPerformMapping (Gia_Man_t *pGia, Jf_Par_t *pPars)

Macro Definition Documentation

PF_CUT_MAX

#define PF_CUT_MAX   32

Definition at line 39 of file giaPf.c.

Pf_CutForEachLit

#define Pf_CutForEachLit	(		pCut,
			Conf,
			iLit,
			i )

Value:

for ( i = 0; i < Pf_CutSize(pCut) && (iLit = Abc_Lit2LitV(Pf_CutLeaves(pCut), Pf_CutConfLit(Conf, i))); i++ )

Definition at line 129 of file giaPf.c.

Pf_CutForEachVar

#define Pf_CutForEachVar	(		pCut,
			Conf,
			iVar,
			c,
			i )

Value:

for ( i = 0; i < Pf_CutSize(pCut) && (iVar = Pf_CutLeaves(pCut)[Pf_CutConfVar(Conf, i)]) && ((c = Pf_CutConfC(Conf, i)), 1); i++ )

Definition at line 130 of file giaPf.c.

PF_INFINITY

#define PF_INFINITY   FLT_MAX

Definition at line 42 of file giaPf.c.

PF_LEAF_MAX

#define PF_LEAF_MAX   6

DECLARATIONS ///.

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

FileName [giaNf.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Scalable AIG package.]

Synopsis [Standard-cell mapper.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

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

Revision [

Id

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

]

Definition at line 38 of file giaPf.c.

PF_NO_FUNC

#define PF_NO_FUNC   0x3FFFFFF

Definition at line 41 of file giaPf.c.

PF_NO_LEAF

#define PF_NO_LEAF   31

Definition at line 40 of file giaPf.c.

Pf_ObjForEachCut

#define Pf_ObjForEachCut	(		pCuts,
			i,
			nCuts )

Value:

for ( i = 0, i < nCuts; i++ )

Definition at line 128 of file giaPf.c.

Pf_SetForEachCut

#define Pf_SetForEachCut	(		pList,
			pCut,
			i )

Value:

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

Definition at line 127 of file giaPf.c.

Typedef Documentation

Pf_Cut_t

typedef struct Pf_Cut_t_ Pf_Cut_t

Definition at line 44 of file giaPf.c.

Pf_Man_t

typedef struct Pf_Man_t_ Pf_Man_t

Definition at line 71 of file giaPf.c.

Pf_Mat_t

typedef struct Pf_Mat_t_ Pf_Mat_t

Definition at line 55 of file giaPf.c.

Pf_Obj_t

typedef struct Pf_Obj_t_ Pf_Obj_t

Definition at line 62 of file giaPf.c.

Function Documentation

Pf_ManComputeCuts()

void Pf_ManComputeCuts

(

Pf_Man_t *

p

)

Definition at line 878 of file giaPf.c.

{
    Gia_Obj_t * pObj; int i, iFanin;
    Gia_ManForEachAnd( p->pGia, pObj, i )
        if ( Gia_ObjIsBuf(pObj) )
        {
            iFanin = Gia_ObjFaninId0(pObj, i);
            Pf_ObjSetCutFlow( p, i,  Pf_ObjCutFlow(p, iFanin) );
            Pf_ObjSetCutDelay( p, i, Pf_ObjCutDelay(p, iFanin) );
        }
        else
            Pf_ObjMergeOrder( p, i );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Pf_ManComputeMapping()

void Pf_ManComputeMapping

(

Pf_Man_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso [] Function*************************************************************

Synopsis [Technology mappping.]

Description []

SideEffects []

SeeAlso []

Definition at line 1262 of file giaPf.c.

{
}

Pf_ManPerformMapping()

Gia_Man_t * Pf_ManPerformMapping	(	Gia_Man_t *	pGia,
		Jf_Par_t *	pPars )

Definition at line 1303 of file giaPf.c.

{
    Gia_Man_t * pNew = NULL, * pCls;
    Pf_Man_t * p; 
    if ( Gia_ManHasChoices(pGia) )
        pPars->fCoarsen = 0; 
    pCls = pPars->fCoarsen ? Gia_ManDupMuxes(pGia, pPars->nCoarseLimit) : pGia;
    p = Pf_StoCreate( pCls, pPars );
//    if ( pPars->fVeryVerbose )
        Pf_StoPrint( p, 1 );
    if ( pPars->fVerbose && pPars->fCoarsen )
    {
        printf( "Initial " );  Gia_ManPrintMuxStats( pGia );  printf( "\n" );
        printf( "Derived " );  Gia_ManPrintMuxStats( pCls );  printf( "\n" );
    }
    Pf_ManPrintInit( p );
    Pf_ManComputeCuts( p );
    Pf_ManPrintQuit( p );
/*
    Gia_ManForEachCiId( p->pGia, Id, i )
        Pf_ObjPrepareCi( p, Id );
    for ( p->Iter = 0; p->Iter < p->pPars->nRounds; p->Iter++ )
    {
        Pf_ManComputeMapping( p );
        //Pf_ManSetMapRefs( p );
        Pf_ManPrintStats( p, p->Iter ? "Area " : "Delay" );
    }
    p->fUseEla = 1;
    for ( ; p->Iter < p->pPars->nRounds + pPars->nRoundsEla; p->Iter++ )
    {
        Pf_ManComputeMapping( p );
        //Pf_ManUpdateStats( p );
        Pf_ManPrintStats( p, "Ela  " );
    }
*/
    pNew = NULL; //Pf_ManDeriveMapping( p );
//    Gia_ManMappingVerify( pNew );
    Pf_StoDelete( p );
    if ( pCls != pGia )
        Gia_ManStop( pCls );
    if ( pNew == NULL )
        return Gia_ManDup( pGia );
    return pNew;
}

Here is the call graph for this function:

Pf_ManPrintInit()

void Pf_ManPrintInit

(

Pf_Man_t *

p

)

Definition at line 919 of file giaPf.c.

{
    int nChoices;
    if ( !p->pPars->fVerbose )
        return;
    printf( "LutSize = %d  ", p->pPars->nLutSize );
    printf( "CutNum = %d  ",  p->pPars->nCutNum );
    printf( "Iter = %d  ",    p->pPars->nRounds + p->pPars->nRoundsEla );
    printf( "Coarse = %d   ", p->pPars->fCoarsen );
    printf( "Cells = %d  ",   p->nCells );
    printf( "Funcs = %d  ",   Vec_MemEntryNum(p->vTtMem) );
    printf( "Matches = %d  ", Vec_WecSizeSize(p->vTt2Match)/2 );
    nChoices = Gia_ManChoiceNum( p->pGia );
    if ( nChoices )
    printf( "Choices = %d  ", nChoices );
    printf( "\n" );
    printf( "Computing cuts...\r" );
    fflush( stdout );
}

Here is the caller graph for this function:

Pf_ManPrintQuit()

void Pf_ManPrintQuit

(

Pf_Man_t *

p

)

Definition at line 938 of file giaPf.c.

{
    float MemGia   = Gia_ManMemory(p->pGia) / (1<<20);
    float MemMan   =(1.0 * sizeof(Pf_Obj_t) + 3.0 * sizeof(int)) * Gia_ManObjNum(p->pGia) / (1<<20);
    float MemCuts  = 1.0 * sizeof(int) * (1 << 16) * Vec_PtrSize(&p->vPages) / (1<<20);
    float MemTt    = p->vTtMem ? Vec_MemMemory(p->vTtMem) / (1<<20) : 0;
    if ( p->CutCount[0] == 0 )
        p->CutCount[0] = 1;
    if ( !p->pPars->fVerbose )
        return;
    printf( "CutPair = %.0f  ",         p->CutCount[0] );
    printf( "Merge = %.0f (%.1f)  ",    p->CutCount[1], 1.0*p->CutCount[1]/Gia_ManAndNum(p->pGia) );
    printf( "Eval = %.0f (%.1f)  ",     p->CutCount[2], 1.0*p->CutCount[2]/Gia_ManAndNum(p->pGia) );
    printf( "Cut = %.0f (%.1f)  ",      p->CutCount[3], 1.0*p->CutCount[3]/Gia_ManAndNum(p->pGia) );
    printf( "Use = %.0f (%.1f)  ",      p->CutCount[4], 1.0*p->CutCount[4]/Gia_ManAndNum(p->pGia) );
    printf( "Mat = %.0f (%.1f)  ",      p->CutCount[5], 1.0*p->CutCount[5]/Gia_ManAndNum(p->pGia) );
//    printf( "Equ = %d (%.2f %%)  ",     p->nCutUseAll,  100.0*p->nCutUseAll /p->CutCount[0] );
    printf( "\n" );
    printf( "Gia = %.2f MB  ",          MemGia );
    printf( "Man = %.2f MB  ",          MemMan ); 
    printf( "Cut = %.2f MB   ",         MemCuts );
    printf( "TT = %.2f MB  ",           MemTt ); 
    printf( "Total = %.2f MB   ",       MemGia + MemMan + MemCuts + MemTt ); 
//    printf( "\n" );
    Abc_PrintTime( 1, "Time", Abc_Clock() - p->clkStart );
    fflush( stdout );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Pf_ManPrintStats()

void Pf_ManPrintStats	(	Pf_Man_t *	p,
		char *	pTitle )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 906 of file giaPf.c.

{
    if ( !p->pPars->fVerbose )
        return;
    printf( "%s :  ", pTitle );
    printf( "Delay =%8.2f  ",  (float)p->pPars->MapDelay );
    printf( "Area =%12.2f  ",  p->pPars->MapArea );
    printf( "Gate =%6d  ",    (int)p->pPars->Area );
    printf( "Inv =%6d  ",     (int)p->nInvs );
    printf( "Edge =%7d  ",    (int)p->pPars->Edge );
    Abc_PrintTime( 1, "Time", Abc_Clock() - p->clkStart );
    fflush( stdout );
}

Pf_ManSetDefaultPars()

void Pf_ManSetDefaultPars

(

Jf_Par_t *

pPars

)

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

Synopsis [Technology mappping.]

Description []

SideEffects []

SeeAlso []

Definition at line 1277 of file giaPf.c.

{
    memset( pPars, 0, sizeof(Jf_Par_t) );
    pPars->nLutSize     =  6;
    pPars->nCutNum      = 16;
    pPars->nProcNum     =  0;
    pPars->nRounds      =  3;
    pPars->nRoundsEla   =  0;
    pPars->nRelaxRatio  =  0;
    pPars->nCoarseLimit =  3;
    pPars->nAreaTuner   =  1;
    pPars->nVerbLimit   =  5;
    pPars->DelayTarget  = -1;
    pPars->fAreaOnly    =  0;
    pPars->fOptEdge     =  1; 
    pPars->fCoarsen     =  0;
    pPars->fCutMin      =  1;
    pPars->fGenCnf      =  0;
    pPars->fPureAig     =  0;
    pPars->fVerbose     =  0;
    pPars->fVeryVerbose =  0;
    pPars->nLutSizeMax  =  PF_LEAF_MAX;
    pPars->nCutNumMax   =  PF_CUT_MAX;
    pPars->MapDelayTarget = -1;
    pPars->Epsilon      = (float)0.01;
}

Here is the call graph for this function:

Pf_ObjMergeOrder()

void Pf_ObjMergeOrder	(	Pf_Man_t *	p,
		int	iObj )

Definition at line 777 of file giaPf.c.

{
    Pf_Cut_t pCuts0[PF_CUT_MAX], pCuts1[PF_CUT_MAX], pCuts[PF_CUT_MAX], * pCutsR[PF_CUT_MAX];
    Gia_Obj_t * pObj = Gia_ManObj(p->pGia, iObj);
    int nGiaRefs = 2*Gia_ObjRefNumId(p->pGia, iObj);
    int nLutSize = p->pPars->nLutSize;
    int nCutNum  = p->pPars->nCutNum;
    int nCuts0   = Pf_ManPrepareCuts(pCuts0, p, Gia_ObjFaninId0(pObj, iObj), 1);
    int nCuts1   = Pf_ManPrepareCuts(pCuts1, p, Gia_ObjFaninId1(pObj, iObj), 1);
    int fComp0   = Gia_ObjFaninC0(pObj);
    int fComp1   = Gia_ObjFaninC1(pObj);
    int iSibl    = Gia_ObjSibl(p->pGia, iObj);
    Pf_Cut_t * pCut0, * pCut1, * pCut0Lim = pCuts0 + nCuts0, * pCut1Lim = pCuts1 + nCuts1;
    int i, nCutsUse, nCutsR = 0;
    assert( !Gia_ObjIsBuf(pObj) );
    for ( i = 0; i < nCutNum; i++ )
        pCutsR[i] = pCuts + i;
    if ( iSibl )
    {
        Pf_Cut_t pCuts2[PF_CUT_MAX];
        Gia_Obj_t * pObjE = Gia_ObjSiblObj(p->pGia, iObj);
        int fCompE = Gia_ObjPhase(pObj) ^ Gia_ObjPhase(pObjE);
        int nCuts2 = Pf_ManPrepareCuts(pCuts2, p, iSibl, 0);
        Pf_Cut_t * pCut2, * pCut2Lim = pCuts2 + nCuts2;
        for ( pCut2 = pCuts2; pCut2 < pCut2Lim; pCut2++ )
        {
            *pCutsR[nCutsR] = *pCut2;
            pCutsR[nCutsR]->iFunc = Abc_LitNotCond( pCutsR[nCutsR]->iFunc, fCompE );
            Pf_CutParams( p, pCutsR[nCutsR], nGiaRefs );
            nCutsR = Pf_SetAddCut( pCutsR, nCutsR, nCutNum );
        }
    }
    if ( Gia_ObjIsMuxId(p->pGia, iObj) )
    {
        Pf_Cut_t pCuts2[PF_CUT_MAX];
        int nCuts2  = Pf_ManPrepareCuts(pCuts2, p, Gia_ObjFaninId2(p->pGia, iObj), 1);
        int fComp2  = Gia_ObjFaninC2(p->pGia, pObj);
        Pf_Cut_t * pCut2, * pCut2Lim = pCuts2 + nCuts2;
        p->CutCount[0] += nCuts0 * nCuts1 * nCuts2;
        for ( pCut0 = pCuts0; pCut0 < pCut0Lim; pCut0++ )
        for ( pCut1 = pCuts1; pCut1 < pCut1Lim; pCut1++ )
        for ( pCut2 = pCuts2; pCut2 < pCut2Lim; pCut2++ )
        {
            if ( Pf_CutCountBits(pCut0->Sign | pCut1->Sign | pCut2->Sign) > nLutSize )
                continue;
            p->CutCount[1]++; 
            if ( !Pf_CutMergeOrderMux(pCut0, pCut1, pCut2, pCutsR[nCutsR], nLutSize) )
                continue;
            if ( Pf_SetLastCutIsContained(pCutsR, nCutsR) )
                continue;
            p->CutCount[2]++;
            if ( Pf_CutComputeTruthMux6(p, pCut0, pCut1, pCut2, fComp0, fComp1, fComp2, pCutsR[nCutsR]) )
                pCutsR[nCutsR]->Sign = Pf_CutGetSign(pCutsR[nCutsR]->pLeaves, pCutsR[nCutsR]->nLeaves);
            Pf_CutParams( p, pCutsR[nCutsR], nGiaRefs );
            nCutsR = Pf_SetAddCut( pCutsR, nCutsR, nCutNum );
        }
    }
    else
    {
        int fIsXor = Gia_ObjIsXor(pObj);
        p->CutCount[0] += nCuts0 * nCuts1;
        for ( pCut0 = pCuts0; pCut0 < pCut0Lim; pCut0++ )
        for ( pCut1 = pCuts1; pCut1 < pCut1Lim; pCut1++ )
        {
            if ( (int)(pCut0->nLeaves + pCut1->nLeaves) > nLutSize && Pf_CutCountBits(pCut0->Sign | pCut1->Sign) > nLutSize )
                continue;
            p->CutCount[1]++; 
            if ( !Pf_CutMergeOrder(pCut0, pCut1, pCutsR[nCutsR], nLutSize) )
                continue;
            if ( Pf_SetLastCutIsContained(pCutsR, nCutsR) )
                continue;
            p->CutCount[2]++;
            if ( Pf_CutComputeTruth6(p, pCut0, pCut1, fComp0, fComp1, pCutsR[nCutsR], fIsXor) )
                pCutsR[nCutsR]->Sign = Pf_CutGetSign(pCutsR[nCutsR]->pLeaves, pCutsR[nCutsR]->nLeaves);
            Pf_CutParams( p, pCutsR[nCutsR], nGiaRefs );
            nCutsR = Pf_SetAddCut( pCutsR, nCutsR, nCutNum );
        }
    }
    // debug printout
    if ( 0 )
//    if ( iObj % 10000 == 0 )
//    if ( iObj == 1090 )
    {
        printf( "*** Obj = %d  Useful = %d\n", iObj, Pf_ManCountUseful(pCutsR, nCutsR) );
        for ( i = 0; i < nCutsR; i++ )
            Pf_Cutprintf( p, pCutsR[i] );
        printf( "\n" );
    } 
    // verify
    assert( nCutsR > 0 && nCutsR < nCutNum );
//    assert( Pf_SetCheckArray(pCutsR, nCutsR) );
    // store the cutset
    Pf_ObjSetCutFlow( p, iObj, pCutsR[0]->Flow );
    Pf_ObjSetCutDelay( p, iObj, pCutsR[0]->Delay );
    *Vec_IntEntryP(&p->vCutSets, iObj) = Pf_ManSaveCuts(p, pCutsR, nCutsR, 0);
    p->CutCount[3] += nCutsR;
    nCutsUse = Pf_ManCountUseful(pCutsR, nCutsR);
    p->CutCount[4] += nCutsUse;
    p->nCutUseAll  += nCutsUse == nCutsR;
    p->CutCount[5] += Pf_ManCountMatches(p, pCutsR, nCutsR);
}

Here is the caller graph for this function:

Pf_StoCreate()

Pf_Man_t * Pf_StoCreate	(	Gia_Man_t *	pGia,
		Jf_Par_t *	pPars )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 293 of file giaPf.c.

{
    extern void Mf_ManSetFlowRefs( Gia_Man_t * p, Vec_Int_t * vRefs );
    Pf_Man_t * p;
    Vec_Int_t * vFlowRefs;
    assert( pPars->nCutNum > 1  && pPars->nCutNum <= PF_CUT_MAX );
    assert( pPars->nLutSize > 1 && pPars->nLutSize <= PF_LEAF_MAX );
    ABC_FREE( pGia->pRefs );
    Vec_IntFreeP( &pGia->vCellMapping );
    if ( Gia_ManHasChoices(pGia) )
        Gia_ManSetPhase(pGia);
    // create references
    ABC_FREE( pGia->pRefs );
    vFlowRefs = Vec_IntAlloc(0);
    Mf_ManSetFlowRefs( pGia, vFlowRefs );
    pGia->pRefs= Vec_IntReleaseArray(vFlowRefs);
    Vec_IntFree(vFlowRefs);
    // create
    p = ABC_CALLOC( Pf_Man_t, 1 );
    p->clkStart = Abc_Clock();
    p->pGia     = pGia;
    p->pPars    = pPars;
    p->pPfObjs  = ABC_CALLOC( Pf_Obj_t, Gia_ManObjNum(pGia) );
    p->iCur     = 2;
    // other
    Vec_PtrGrow( &p->vPages, 256 );                                    // cut memory
    Vec_IntFill( &p->vCutSets,  Gia_ManObjNum(pGia), 0 );              // cut offsets
    Vec_FltFill( &p->vCutFlows, Gia_ManObjNum(pGia), 0 );              // cut area
    Vec_IntFill( &p->vCutDelays,Gia_ManObjNum(pGia), 0 );              // cut delay
    // matching
    p->vTtMem    = Vec_MemAllocForTT( 6, 0 );          
    p->vTt2Match = Vec_WecAlloc( 1000 ); 
    Vec_WecPushLevel( p->vTt2Match );
    Vec_WecPushLevel( p->vTt2Match );
    assert( Vec_WecSize(p->vTt2Match) == Vec_MemEntryNum(p->vTtMem) );
    Pf_StoDeriveMatches( p, 0 );//pPars->fVerbose );
    p->InvDelay = p->pCells[3].Delays[0];
    p->InvArea  = p->pCells[3].Area;
    //Pf_ObjMatchD(p, 0, 0)->Gate = 0;
    //Pf_ObjMatchD(p, 0, 1)->Gate = 1;
    // prepare cuts
    return p;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Pf_StoCreateGate()

void Pf_StoCreateGate	(	Pf_Man_t *	pMan,
		Mio_Cell_t *	pCell,
		int **	pComp,
		int **	pPerm,
		int *	pnPerms )

Definition at line 174 of file giaPf.c.

{
    int Perm[PF_LEAF_MAX], * Perm1, * Perm2;
    int nPerms = pnPerms[pCell->nFanins];
    int nMints = (1 << pCell->nFanins);
    word tCur, tTemp1, tTemp2;
    int i, p, c;
    for ( i = 0; i < (int)pCell->nFanins; i++ )
        Perm[i] = Abc_Var2Lit( i, 0 );
    tCur = tTemp1 = pCell->uTruth;
    for ( p = 0; p < nPerms; p++ )
    {
        tTemp2 = tCur;
        for ( c = 0; c < nMints; c++ )
        {
            Pf_StoCreateGateAdd( pMan, tCur, Perm, pCell->nFanins, pCell->Id );
            // update
            tCur  = Abc_Tt6Flip( tCur, pComp[pCell->nFanins][c] );
            Perm1 = Perm + pComp[pCell->nFanins][c];
            *Perm1 = Abc_LitNot( *Perm1 );
        }
        assert( tTemp2 == tCur );
        // update
        tCur = Abc_Tt6SwapAdjacent( tCur, pPerm[pCell->nFanins][p] );
        Perm1 = Perm + pPerm[pCell->nFanins][p];
        Perm2 = Perm1 + 1;
        ABC_SWAP( int, *Perm1, *Perm2 );
    }
    assert( tTemp1 == tCur );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Pf_StoCreateGateAdd()

void Pf_StoCreateGateAdd	(	Pf_Man_t *	pMan,
		word	uTruth,
		int *	pFans,
		int	nFans,
		int	CellId )

FUNCTION DEFINITIONS ///.

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 147 of file giaPf.c.

{
    Vec_Int_t * vArray;
    Pf_Mat_t Mat = Pf_Int2Mat(0);
    int i, GateId, Entry, fCompl = (int)(uTruth & 1);
    word uFunc = fCompl ? ~uTruth : uTruth;
    int iFunc = Vec_MemHashInsert( pMan->vTtMem, &uFunc );
    if ( iFunc == Vec_WecSize(pMan->vTt2Match) )
        Vec_WecPushLevel( pMan->vTt2Match );
    vArray = Vec_WecEntry( pMan->vTt2Match, iFunc );
    Mat.fCompl = fCompl;
    assert( nFans < 7 );
    for ( i = 0; i < nFans; i++ )
    {
        Mat.Perm  |= (unsigned)(Abc_Lit2Var(pFans[i]) << (3*i));
        Mat.Phase |= (unsigned)(Abc_LitIsCompl(pFans[i]) << i);
    }
    // check if the same one exists
    Vec_IntForEachEntryDouble( vArray, GateId, Entry, i )
        if ( GateId == CellId && Pf_Int2Mat(Entry).Phase == Mat.Phase )
            break;
    if ( i == Vec_IntSize(vArray) )
    {
        Vec_IntPush( vArray, CellId );
        Vec_IntPush( vArray, Pf_Mat2Int(Mat) );
    }
}

Here is the caller graph for this function:

Pf_StoDelete()

void Pf_StoDelete

(

Pf_Man_t *

p

)

Definition at line 336 of file giaPf.c.

{
    Vec_PtrFreeData( &p->vPages );
    ABC_FREE( p->vPages.pArray );
    ABC_FREE( p->vCutSets.pArray );
    ABC_FREE( p->vCutFlows.pArray );
    ABC_FREE( p->vCutDelays.pArray );
    ABC_FREE( p->pPfObjs );
    // matching
    Vec_WecFree( p->vTt2Match );
    Vec_MemHashFree( p->vTtMem );
    Vec_MemFree( p->vTtMem );
    ABC_FREE( p->pCells );
    ABC_FREE( p );
}

Here is the caller graph for this function:

Pf_StoDeriveMatches()

void Pf_StoDeriveMatches	(	Pf_Man_t *	p,
		int	fVerbose )

Definition at line 204 of file giaPf.c.

{
//    abctime clk = Abc_Clock();
    int * pComp[7];
    int * pPerm[7];
    int nPerms[7], i;
    for ( i = 2; i <= 6; i++ )
        pComp[i] = Extra_GreyCodeSchedule( i );
    for ( i = 2; i <= 6; i++ )
        pPerm[i] = Extra_PermSchedule( i );
    for ( i = 2; i <= 6; i++ )
        nPerms[i] = Extra_Factorial( i );
    p->pCells = Mio_CollectRootsNewDefault( 6, &p->nCells, fVerbose );
    for ( i = 4; i < p->nCells; i++ )
        Pf_StoCreateGate( p, p->pCells + i, pComp, pPerm, nPerms );
    for ( i = 2; i <= 6; i++ )
        ABC_FREE( pComp[i] );
    for ( i = 2; i <= 6; i++ )
        ABC_FREE( pPerm[i] );
//    Abc_PrintTime( 1, "Time", Abc_Clock() - clk );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Pf_StoPrint()

void Pf_StoPrint	(	Pf_Man_t *	p,
		int	fVerbose )

Definition at line 249 of file giaPf.c.

{
    int t, i, GateId, Entry, Count = 0;
    for ( t = 2; t < Vec_WecSize(p->vTt2Match); t++ )
    {
        Vec_Int_t * vArr = Vec_WecEntry( p->vTt2Match, t );
        Vec_IntForEachEntryDouble( vArr, GateId, Entry, i )
        {
            Count++;
            if ( !fVerbose )
                continue;
            if ( t < 10 )
                Pf_StoPrintOne( p, Count, t, i/2, GateId, Pf_Int2Mat(Entry) );
        }
    }
    printf( "Gates = %d.  Truths = %d.  Matches = %d.\n", 
        p->nCells, Vec_MemEntryNum(p->vTtMem), Count );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Pf_StoPrintOne()

void Pf_StoPrintOne	(	Pf_Man_t *	p,
		int	Count,
		int	t,
		int	i,
		int	GateId,
		Pf_Mat_t	Mat )

Definition at line 225 of file giaPf.c.

{
    Mio_Cell_t * pC = p->pCells + GateId;
    word * pTruth = Vec_MemReadEntry(p->vTtMem, t);
    int k, nSuppSize = Abc_TtSupportSize(pTruth, 6);
    printf( "%6d : ", Count );
    printf( "%6d : ", t );
    printf( "%6d : ", i );
    printf( "Gate %16s  ",   pC->pName );
    printf( "Area =%8.2f  ", pC->Area );
    printf( "In = %d   ",    pC->nFanins );
    if ( Mat.fCompl )
        printf( " compl " );
    else
        printf( "       " );
    for ( k = 0; k < (int)pC->nFanins; k++ )
    {
        int fComplF = (Mat.Phase >> k) & 1;
        int iFanin  = (Mat.Perm >> (3*k)) & 7;
        printf( "%c", 'a' + iFanin - fComplF * ('a' - 'A') );
    }
    printf( "  " );
    Dau_DsdPrintFromTruth( pTruth, nSuppSize );
}

Here is the call graph for this function:

Here is the caller graph for this function: