#include "aig/gia/gia.h"
#include "sat/bsat/satSolver.h"
#include "ssc.h"

Data Structures
struct	Ssc_Man_t_

Typedefs
typedef typedefABC_NAMESPACE_HEADER_START struct Ssc_Man_t_	Ssc_Man_t
	INCLUDES ///. More...

Functions
static int	Ssc_ObjSatVar (Ssc_Man_t *p, int iObj)
	MACRO DEFINITIONS ///. More...

static void	Ssc_ObjSetSatVar (Ssc_Man_t *p, int iObj, int Num)

static void	Ssc_ObjCleanSatVar (Ssc_Man_t *p, int Num)

static int	Ssc_ObjFraig (Ssc_Man_t p, Gia_Obj_t pObj)

static void	Ssc_ObjSetFraig (Gia_Obj_t *pObj, int iNode)

void	Ssc_GiaClassesInit (Gia_Man_t *p)
	FUNCTION DECLARATIONS ///. More...

int	Ssc_GiaClassesRefine (Gia_Man_t *p)

void	Ssc_GiaClassesCheckPairs (Gia_Man_t p, Vec_Int_t vDisPairs)

int	Ssc_GiaSimClassRefineOneBit (Gia_Man_t *p, int i)

void	Ssc_CnfNodeAddToSolver (Ssc_Man_t p, Gia_Obj_t pObj)

void	Ssc_ManSatSolverRecycle (Ssc_Man_t *p)

void	Ssc_ManStartSolver (Ssc_Man_t *p)

Vec_Int_t *	Ssc_ManFindPivotSat (Ssc_Man_t *p)

int	Ssc_ManCheckEquivalence (Ssc_Man_t *p, int iRepr, int iObj, int fCompl)

void	Ssc_GiaResetPiPattern (Gia_Man_t *p, int nWords)

void	Ssc_GiaRandomPiPattern (Gia_Man_t p, int nWords, Vec_Int_t vPivot)

int	Ssc_GiaTransferPiPattern (Gia_Man_t pAig, Gia_Man_t pCare, Vec_Int_t *vPivot)

void	Ssc_GiaSavePiPattern (Gia_Man_t p, Vec_Int_t vPat)

void	Ssc_GiaSimRound (Gia_Man_t *p)

Vec_Int_t *	Ssc_GiaFindPivotSim (Gia_Man_t *p)

int	Ssc_GiaEstimateCare (Gia_Man_t *p, int nWords)

Gia_Man_t *	Ssc_GenerateOneHot (int nVars)

Typedef Documentation

typedef typedefABC_NAMESPACE_HEADER_START struct Ssc_Man_t_ Ssc_Man_t

INCLUDES ///.

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

FileName [sscInt.h]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Choice computation for tech-mapping.]

Synopsis [Internal declarations.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - June 29, 2008.]

Revision [

Id:: sscInt.h,v 1.00 2008/07/29 00:00:00 alanmi Exp

]PARAMETERS ///BASIC TYPES ///

Definition at line 46 of file sscInt.h.

Function Documentation

void Ssc_CnfNodeAddToSolver	(	Ssc_Man_t *	p,
		Gia_Obj_t *	pObj
	)

Gia_Man_t* Ssc_GenerateOneHot ( int nVars )

void Ssc_GiaClassesCheckPairs	(	Gia_Man_t *	p,
		Vec_Int_t *	vDisPairs
	)

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

Synopsis [Check if the pairs have been disproved.]

Description []

SideEffects []

SeeAlso []

Definition at line 309 of file sscClass.c.

 {
     int i, iRepr, iObj, Result = 1;
     Vec_IntForEachEntryDouble( vDisPairs, iRepr, iObj, i )
         if ( iRepr == Gia_ObjRepr(p, iObj) )
             printf( "Pair (%d, %d) are still equivalent.\n", iRepr, iObj ), Result = 0;
 //    if ( Result )
 //        printf( "Classes are refined correctly.\n" );
 }

void Ssc_GiaClassesInit ( Gia_Man_t * p )

FUNCTION DECLARATIONS ///.

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

Synopsis [Refines equivalence classes.]

Description []

SideEffects []

SeeAlso []

Definition at line 265 of file sscClass.c.

 {
     Gia_Obj_t * pObj;
     int i;
     assert( p->pReprs == NULL );
     p->pReprs = ABC_CALLOC( Gia_Rpr_t, Gia_ManObjNum(p) );
     p->pNexts = ABC_CALLOC( int, Gia_ManObjNum(p) );
     Gia_ManForEachObj( p, pObj, i )
         Gia_ObjSetRepr( p, i, Gia_ObjIsCand(pObj) ? 0 : GIA_VOID );
     if ( p->vClassOld == NULL )
         p->vClassOld = Vec_IntAlloc( 100 );
     if ( p->vClassNew == NULL )
         p->vClassNew = Vec_IntAlloc( 100 );
 }

int Ssc_GiaClassesRefine ( Gia_Man_t * p )

Definition at line 279 of file sscClass.c.

 {
     Vec_Int_t * vRefinedC;
     Gia_Obj_t * pObj;
     int i, Counter = 0;
     if ( p->pReprs != NULL );
     vRefinedC = Vec_IntAlloc( 100 );
     Gia_ManForEachCand( p, pObj, i )
         if ( Gia_ObjIsTail(p, i) )
             Counter += Ssc_GiaSimClassRefineOne( p, Gia_ObjRepr(p, i) );
         else if ( Gia_ObjIsConst(p, i) && !Ssc_GiaSimIsConst0(p, i) )
             Vec_IntPush( vRefinedC, i );
     Ssc_GiaSimProcessRefined( p, vRefinedC );
     Counter += Vec_IntSize( vRefinedC );
     Vec_IntFree( vRefinedC );
     return Counter;
 }

int Ssc_GiaEstimateCare	(	Gia_Man_t *	p,
		int	nWords
	)

Definition at line 351 of file sscSim.c.

 {
     Ssc_GiaRandomPiPattern( p, nWords, NULL );
     Ssc_GiaSimRound( p );
     return Ssc_GiaCountCaresSim( p );
 }

Vec_Int_t* Ssc_GiaFindPivotSim ( Gia_Man_t * p )

Definition at line 323 of file sscSim.c.

 {
     Vec_Int_t * vInit;
     Ssc_GiaRandomPiPattern( p, 1, NULL );
     Ssc_GiaSimRound( p );
     vInit = Ssc_GiaGetOneSim( p );
     return vInit;
 }

void Ssc_GiaRandomPiPattern	(	Gia_Man_t *	p,
		int	nWords,
		Vec_Int_t *	vPivot
	)

Definition at line 163 of file sscSim.c.

 {
     word * pSimPi;
     int i, w;
     Ssc_GiaResetPiPattern( p, nWords );
     pSimPi = Gia_ObjSimPi( p, 0 );
     for ( i = 0; i < Gia_ManPiNum(p); i++, pSimPi += nWords )
     {
         pSimPi[0] = vPivot ? Ssc_Random1(Vec_IntEntry(vPivot, i)) : Ssc_Random2();
         for ( w = 1; w < nWords; w++ )
             pSimPi[w] = Ssc_Random();
 //        if ( i < 10 )
 //            Extra_PrintBinary( stdout, (unsigned *)pSimPi, 64 ), printf( "\n" );
     }
 }

void Ssc_GiaResetPiPattern	(	Gia_Man_t *	p,
		int	nWords
	)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 141 of file sscSim.c.

 {
     p->iPatsPi = 0;
     if ( p->vSimsPi == NULL )
         p->vSimsPi = Vec_WrdStart(0);
     Vec_WrdFill( p->vSimsPi, nWords * Gia_ManCiNum(p), 0 );
     assert( nWords == Gia_ObjSimWords( p ) );
 }

void Ssc_GiaSavePiPattern	(	Gia_Man_t *	p,
		Vec_Int_t *	vPat
	)

Definition at line 149 of file sscSim.c.

 {
     word * pSimPi;
     int i;
     assert( Vec_IntSize(vPat) == Gia_ManCiNum(p) );
     if ( p->iPatsPi == 64 * Gia_ObjSimWords(p) )
         Vec_WrdDoubleSimInfo( p->vSimsPi, Gia_ManCiNum(p) );
     assert( p->iPatsPi < 64 * Gia_ObjSimWords(p) );
     pSimPi = Gia_ObjSimPi( p, 0 );
     for ( i = 0; i < Gia_ManCiNum(p); i++, pSimPi += Gia_ObjSimWords(p) )
         if ( Vec_IntEntry(vPat, i) )
             Abc_InfoSetBit( (unsigned *)pSimPi, p->iPatsPi );
     p->iPatsPi++;
 }

int Ssc_GiaSimClassRefineOneBit	(	Gia_Man_t *	p,
		int	i
	)

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

Synopsis [Refines one equivalence class using individual bit-pattern.]

Description []

SideEffects []

SeeAlso []

Definition at line 162 of file sscClass.c.

 {
     Gia_Obj_t * pObj;
     int Ent;
     assert( Gia_ObjIsHead( p, i ) );
     Vec_IntClear( p->vClassOld );
     Vec_IntClear( p->vClassNew );
     Vec_IntPush( p->vClassOld, i );
     pObj = Gia_ManObj(p, i);
     Gia_ClassForEachObj1( p, i, Ent )
     {
         if ( Ssc_GiaSimAreEqualBit( p, i, Ent ) )
             Vec_IntPush( p->vClassOld, Ent );
         else
             Vec_IntPush( p->vClassNew, Ent );
     }
     if ( Vec_IntSize( p->vClassNew ) == 0 )
         return 0;
     Ssc_GiaSimClassCreate( p, p->vClassOld );
     Ssc_GiaSimClassCreate( p, p->vClassNew );
     return 1;
 }

void Ssc_GiaSimRound ( Gia_Man_t * p )

Definition at line 247 of file sscSim.c.

 {
     Gia_Obj_t * pObj;
     word * pSim, * pSim0, * pSim1;
     int i, nWords = Gia_ObjSimWords(p);
     Ssc_GiaResetSimInfo( p );
     assert( nWords == Vec_WrdSize(p->vSims) / Gia_ManObjNum(p) );
     // constant node
     Ssc_SimConst( Gia_ObjSim(p, 0), nWords, 0 );
     // primary inputs
     pSim = Gia_ObjSim( p, 1 );
     pSim0 = Gia_ObjSimPi( p, 0 );
     Gia_ManForEachCi( p, pObj, i )
     {
         assert( pSim == Gia_ObjSimObj( p, pObj ) );
         Ssc_SimDup( pSim, pSim0, nWords, 0 );
         pSim += nWords;
         pSim0 += nWords;
     }
     // intermediate nodes
     pSim = Gia_ObjSim( p, 1+Gia_ManCiNum(p) );
     Gia_ManForEachAnd( p, pObj, i )
     {
         assert( pSim == Gia_ObjSim( p, i ) );
         pSim0 = pSim - pObj->iDiff0 * nWords;
         pSim1 = pSim - pObj->iDiff1 * nWords;
         Ssc_SimAnd( pSim, pSim0, pSim1, nWords, Gia_ObjFaninC0(pObj), Gia_ObjFaninC1(pObj) );
         pSim += nWords;
     }
     // primary outputs
     pSim = Gia_ObjSim( p, Gia_ManObjNum(p) - Gia_ManPoNum(p) );
     Gia_ManForEachPo( p, pObj, i )
     {
         assert( pSim == Gia_ObjSimObj( p, pObj ) );
         pSim0 = pSim - pObj->iDiff0 * nWords;
         Ssc_SimDup( pSim, pSim0, nWords, Gia_ObjFaninC0(pObj) );
 //        Extra_PrintBinary( stdout, pSim, 64 ), printf( "\n" );
         pSim += nWords;
     }
 }

int Ssc_GiaTransferPiPattern	(	Gia_Man_t *	pAig,
		Gia_Man_t *	pCare,
		Vec_Int_t *	vPivot
	)

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

Synopsis [Transfer the simulation pattern from pCare to pAig.]

Description []

SideEffects []

SeeAlso []

Definition at line 201 of file sscSim.c.

 {
     extern word * Ssc_GiaGetCareMask( Gia_Man_t * p );
     Gia_Obj_t * pObj;
     int i, w, nWords = Gia_ObjSimWords( pCare );
     word * pCareMask = Ssc_GiaGetCareMask( pCare );
     int Count = Ssc_SimCountBits( pCareMask, nWords );
     word * pSimPiCare, * pSimPiAig;
     if ( Count == 0 )
     {
         ABC_FREE( pCareMask );
         return 0;
     }
     Ssc_GiaResetPiPattern( pAig, nWords );
     Gia_ManForEachCi( pCare, pObj, i )
     {
         pSimPiAig  = Gia_ObjSimPi( pAig, i );
         pSimPiCare = Gia_ObjSimObj( pCare, pObj );
         for ( w = 0; w < nWords; w++ )
             if ( Vec_IntEntry(vPivot, i) )
                 pSimPiAig[w] = pSimPiCare[w] | ~pCareMask[w];
             else
                 pSimPiAig[w] = pSimPiCare[w] & pCareMask[w];
     }
     ABC_FREE( pCareMask );
     return Count;
 }

int Ssc_ManCheckEquivalence	(	Ssc_Man_t *	p,
		int	iRepr,
		int	iNode,
		int	fCompl
	)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 348 of file sscSat.c.

 {
     int pLitsSat[2], RetValue;
     abctime clk;
     assert( iRepr != iNode );
     if ( iRepr > iNode )
         return l_Undef;
     assert( iRepr < iNode );
 //    if ( p->nTimeOut )
 //        sat_solver_set_runtime_limit( p->pSat, p->nTimeOut * CLOCKS_PER_SEC + Abc_Clock() );
 
     // create CNF
     if ( iRepr )
     Ssc_ManCnfNodeAddToSolver( p, iRepr );
     Ssc_ManCnfNodeAddToSolver( p, iNode );
     sat_solver_compress( p->pSat );
 
     // order the literals
     pLitsSat[0] = Abc_Var2Lit( Ssc_ObjSatVar(p, iRepr), 0 );
     pLitsSat[1] = Abc_Var2Lit( Ssc_ObjSatVar(p, iNode), fCompl ^ (int)(iRepr > 0) );
 
     // solve under assumptions
     // A = 1; B = 0
     clk = Abc_Clock();
     RetValue = sat_solver_solve( p->pSat, pLitsSat, pLitsSat + 2, (ABC_INT64_T)p->pPars->nBTLimit, (ABC_INT64_T)0, (ABC_INT64_T)0, (ABC_INT64_T)0 );
     if ( RetValue == l_False )
     {
         pLitsSat[0] = Abc_LitNot( pLitsSat[0] ); // compl
         pLitsSat[1] = Abc_LitNot( pLitsSat[1] ); // compl
         RetValue = sat_solver_addclause( p->pSat, pLitsSat, pLitsSat + 2 );
         assert( RetValue );
         p->timeSatUnsat += Abc_Clock() - clk;
     }
     else if ( RetValue == l_True )
     {
         Ssc_ManCollectSatPattern( p, p->vPattern );
         p->timeSatSat += Abc_Clock() - clk;
         return l_True;
     }
     else // if ( RetValue1 == l_Undef )
     {
         p->timeSatUndec += Abc_Clock() - clk;
         return l_Undef;
     }
 
     // if the old node was constant 0, we already know the answer
     if ( iRepr == 0 )
         return l_False;
 
     // solve under assumptions
     // A = 0; B = 1
     clk = Abc_Clock();
     RetValue = sat_solver_solve( p->pSat, pLitsSat, pLitsSat + 2, (ABC_INT64_T)p->pPars->nBTLimit, (ABC_INT64_T)0, (ABC_INT64_T)0, (ABC_INT64_T)0 );
     if ( RetValue == l_False )
     {
         pLitsSat[0] = Abc_LitNot( pLitsSat[0] );
         pLitsSat[1] = Abc_LitNot( pLitsSat[1] );
         RetValue = sat_solver_addclause( p->pSat, pLitsSat, pLitsSat + 2 );
         assert( RetValue );
         p->timeSatUnsat += Abc_Clock() - clk;
     }
     else if ( RetValue == l_True )
     {
         Ssc_ManCollectSatPattern( p, p->vPattern );
         p->timeSatSat += Abc_Clock() - clk;
         return l_True;
     }
     else // if ( RetValue1 == l_Undef )
     {
         p->timeSatUndec += Abc_Clock() - clk;
         return l_Undef;
     }
     return l_False;
 }

Vec_Int_t* Ssc_ManFindPivotSat ( Ssc_Man_t * p )

Definition at line 323 of file sscSat.c.

 {
     Vec_Int_t * vInit;
     int status = sat_solver_solve( p->pSat, NULL, NULL, p->pPars->nBTLimit, 0, 0, 0 );
     if ( status == l_False )
         return (Vec_Int_t *)(ABC_PTRINT_T)1;
     if ( status == l_Undef )
         return NULL;
     assert( status == l_True );
     vInit = Vec_IntAlloc( Gia_ManCiNum(p->pFraig) );
     Ssc_ManCollectSatPattern( p, vInit );
     return vInit;
 }

void Ssc_ManSatSolverRecycle ( Ssc_Man_t * p )

void Ssc_ManStartSolver ( Ssc_Man_t * p )

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

Synopsis [Starts the SAT solver for constraints.]

Description []

SideEffects []

SeeAlso []

Definition at line 261 of file sscSat.c.

 {
     Aig_Man_t * pMan = Gia_ManToAigSimple( p->pFraig );
     Cnf_Dat_t * pDat = Cnf_Derive( pMan, 0 );
     Gia_Obj_t * pObj;
     sat_solver * pSat;
     int i, status;
     assert( p->pSat == NULL && p->vId2Var == NULL );
     assert( Aig_ManObjNumMax(pMan) == Gia_ManObjNum(p->pFraig) );
     Aig_ManStop( pMan );
     // save variable mapping
     p->nSatVarsPivot = p->nSatVars = pDat->nVars;
     p->vId2Var = Vec_IntStart( Gia_ManCandNum(p->pAig) + Gia_ManCandNum(p->pCare) + 10 ); // mapping of each node into its SAT var
     p->vVar2Id = Vec_IntStart( Gia_ManCandNum(p->pAig) + Gia_ManCandNum(p->pCare) + 10 ); // mapping of each SAT var into its node
     Ssc_ObjSetSatVar( p, 0, pDat->pVarNums[0] );
     Gia_ManForEachCi( p->pFraig, pObj, i )
     {
         int iObj = Gia_ObjId( p->pFraig, pObj );
         Ssc_ObjSetSatVar( p, iObj, pDat->pVarNums[iObj] );
     }
 //Cnf_DataWriteIntoFile( pDat, "dump.cnf", 1, NULL, NULL );
     // start the SAT solver
     pSat = sat_solver_new();
     sat_solver_setnvars( pSat, pDat->nVars + 1000 );
     for ( i = 0; i < pDat->nClauses; i++ )
     {
         if ( !sat_solver_addclause( pSat, pDat->pClauses[i], pDat->pClauses[i+1] ) )
         {
             Cnf_DataFree( pDat );
             sat_solver_delete( pSat );
             return;
         }
     }
     Cnf_DataFree( pDat );
     status = sat_solver_simplify( pSat );
     if ( status == 0 )
     {
         sat_solver_delete( pSat );
         return;
     }
     p->pSat = pSat;
 }