giaCSat3.c File Reference

#include "gia.h"

Include dependency graph for giaCSat3.c:

Go to the source code of this file.

Classes
struct	Cbs3_Par_t_
struct	Cbs3_Que_t_
struct	Cbs3_Man_t_

Macros
#define	Cbs3_QueForEachEntry(Que, iObj, i)
#define	Cbs3_ClauseForEachEntry(p, hClause, iObj, i)
#define	Cbs3_ClauseForEachEntry1(p, hClause, iObj, i)

Typedefs
typedef typedefABC_NAMESPACE_IMPL_START struct Cbs3_Par_t_	Cbs3_Par_t
	DECLARATIONS ///.
typedef struct Cbs3_Que_t_	Cbs3_Que_t
typedef struct Cbs3_Man_t_	Cbs3_Man_t

Functions
void	Cbs3_SetDefaultParams (Cbs3_Par_t *pPars)
	FUNCTION DEFINITIONS ///.
void	Cbs3_ManSetConflictNum (Cbs3_Man_t *p, int Num)
Cbs3_Man_t *	Cbs3_ManAlloc (Gia_Man_t *pGia)
void	Cbs3_ManStop (Cbs3_Man_t *p)
int	Cbs3_ManMemory (Cbs3_Man_t *p)
Vec_Int_t *	Cbs3_ReadModel (Cbs3_Man_t *p)
void	Cbs3_ManUpdateJFrontier (Cbs3_Man_t *p)
int	Cbs3_ManPropagateNew (Cbs3_Man_t *p, int Level)
int	Cbs3_ManSolve2_rec (Cbs3_Man_t *p, int Level)
int	Cbs3_ManSolve (Cbs3_Man_t *p, int iLit, int nRestarts)
void	Cbs3_ManSatPrintStats (Cbs3_Man_t *p)
Vec_Int_t *	Cbs3_ManSolveMiterNc (Gia_Man_t *pAig, int nConfs, int nRestarts, Vec_Str_t **pvStatus, int fVerbose)

Macro Definition Documentation

Cbs3_ClauseForEachEntry

#define Cbs3_ClauseForEachEntry	(		p,
			hClause,
			iObj,
			i )

Value:

    for ( i = 1; i <= Cbs3_ClauseSize(p, hClause) && (iObj = (p)->pClauses.pData[hClause+i]); i++ )

Definition at line 139 of file giaCSat3.c.

#define Cbs3_ClauseForEachEntry( p, hClause, iObj, i )               \
    for ( i = 1; i <= Cbs3_ClauseSize(p, hClause) && (iObj = (p)->pClauses.pData[hClause+i]); i++ )

Cbs3_ClauseForEachEntry1

#define Cbs3_ClauseForEachEntry1	(		p,
			hClause,
			iObj,
			i )

Value:

    for ( i = 2; i <= Cbs3_ClauseSize(p, hClause) && (iObj = (p)->pClauses.pData[hClause+i]); i++ )

Definition at line 141 of file giaCSat3.c.

#define Cbs3_ClauseForEachEntry1( p, hClause, iObj, i )              \
    for ( i = 2; i <= Cbs3_ClauseSize(p, hClause) && (iObj = (p)->pClauses.pData[hClause+i]); i++ )

Cbs3_QueForEachEntry

#define Cbs3_QueForEachEntry	(		Que,
			iObj,
			i )

Value:

    for ( i = (Que).iHead; (i < (Que).iTail) && ((iObj) = (Que).pData[i]); i++ )

Definition at line 136 of file giaCSat3.c.

#define Cbs3_QueForEachEntry( Que, iObj, i )                         \
    for ( i = (Que).iHead; (i < (Que).iTail) && ((iObj) = (Que).pData[i]); i++ )

Typedef Documentation

Cbs3_Man_t

typedef struct Cbs3_Man_t_ Cbs3_Man_t

Definition at line 55 of file giaCSat3.c.

Cbs3_Par_t

typedef typedefABC_NAMESPACE_IMPL_START struct Cbs3_Par_t_ Cbs3_Par_t

DECLARATIONS ///.

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

FileName [giaCSat.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Scalable AIG package.]

Synopsis [A simple circuit-based solver.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

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

Revision [

Id

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

]

Definition at line 30 of file giaCSat3.c.

Cbs3_Que_t

typedef struct Cbs3_Que_t_ Cbs3_Que_t

Definition at line 46 of file giaCSat3.c.

Function Documentation

Cbs3_ManAlloc()

Cbs3_Man_t * Cbs3_ManAlloc

(

Gia_Man_t *

pGia

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 183 of file giaCSat3.c.

{
    Cbs3_Man_t * p;
    p = ABC_CALLOC( Cbs3_Man_t, 1 );
    p->pProp.nSize = p->pJust.nSize = p->pClauses.nSize = 10000;
    p->pProp.pData = ABC_ALLOC( int, p->pProp.nSize );
    p->pJust.pData = ABC_ALLOC( int, p->pJust.nSize );
    p->pClauses.pData = ABC_ALLOC( int, p->pClauses.nSize );
    p->pClauses.iHead = p->pClauses.iTail = 1;
    p->vModel   = Vec_IntAlloc( 1000 );
    p->vTemp    = Vec_IntAlloc( 1000 );
    p->pAig     = pGia;
    Cbs3_SetDefaultParams( &p->Pars );
    // circuit structure
    Vec_IntPush( &p->vMap, -1 );
    Vec_IntPush( &p->vRef, -1 );
    Vec_IntPushTwo( &p->vFans, -1, -1 );
    Vec_WecPushLevel( &p->vImps );
    Vec_WecPushLevel( &p->vImps );
    p->nVars = 1;
    // internal data
    p->nVarsAlloc = 1000;
    Vec_StrFill( &p->vAssign,      p->nVarsAlloc, 2 );
    Vec_StrFill( &p->vMark,        p->nVarsAlloc, 0 );
    Vec_IntFill( &p->vLevReason, 3*p->nVarsAlloc, -1 );
    Vec_IntFill( &p->vActs,        p->nVarsAlloc, 0 );
    Vec_IntFill( &p->vWatches,   2*p->nVarsAlloc, 0 );
    Vec_IntGrow( &p->vWatchUpds, 1000 );
    return p;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Cbs3_ManMemory()

int Cbs3_ManMemory

(

Cbs3_Man_t *

p

)

Definition at line 267 of file giaCSat3.c.

{
    int nMem = sizeof(Cbs3_Man_t);
    nMem += (int)Vec_IntMemory( &p->vMap );
    nMem += (int)Vec_IntMemory( &p->vRef );
    nMem += (int)Vec_IntMemory( &p->vFans );
    nMem += (int)Vec_WecMemory( &p->vImps );
    nMem += (int)Vec_StrMemory( &p->vAssign );
    nMem += (int)Vec_StrMemory( &p->vMark );
    nMem += (int)Vec_IntMemory( &p->vActs );
    nMem += (int)Vec_IntMemory( &p->vWatches );
    nMem += (int)Vec_IntMemory( &p->vWatchUpds );
    nMem += (int)Vec_IntMemory( p->vModel );
    nMem += (int)Vec_IntMemory( p->vTemp );
    nMem += 4*p->pClauses.nSize;
    nMem += 4*p->pProp.nSize;
    nMem += 4*p->pJust.nSize;
    return nMem;
}

Here is the caller graph for this function:

Cbs3_ManPropagateNew()

int Cbs3_ManPropagateNew	(	Cbs3_Man_t *	p,
		int	Level )

Definition at line 978 of file giaCSat3.c.

{
    int i, k, iLit, hClause, nLits, * pLits;
    p->nPropCalls[0]++;
    Cbs3_QueForEachEntry( p->pProp, iLit, i )
    {
        if ( (hClause = Cbs3_ManPropagateClauses(p, Level, iLit)) )
            return hClause;
        p->nPropCalls[2]++;
        nLits = Vec_IntSize(Vec_WecEntry(&p->vImps, iLit));
        pLits = Vec_IntArray(Vec_WecEntry(&p->vImps, iLit)); 
        for ( k = 0; k < nLits; k += 2 )
        {
            int Value0 = Cbs3_VarValue(p, Abc_Lit2Var(pLits[k]));
            int Value1 = pLits[k+1] ? Cbs3_VarValue(p, Abc_Lit2Var(pLits[k+1])) : -1;
            if ( Value1 == -1 || Value1 == Abc_LitIsCompl(pLits[k+1]) ) // pLits[k+1] is false
            {
                if ( Value0 >= 2 ) // pLits[k] is unassigned
                    Cbs3_ManAssign( p, pLits[k], Level, Abc_Lit2Var(iLit), Abc_Lit2Var(pLits[k+1]) );
                else if ( Value0 == Abc_LitIsCompl(pLits[k]) ) // pLits[k] is false
                    return Cbs3_ManAnalyze( p, Level, Abc_Lit2Var(iLit), Abc_Lit2Var(pLits[k]), Abc_Lit2Var(pLits[k+1]) );
            }
            if ( Value1 != -1 && Value0 == Abc_LitIsCompl(pLits[k]) ) // pLits[k] is false
            {
                if ( Value1 >= 2 ) // pLits[k+1] is unassigned
                    Cbs3_ManAssign( p, pLits[k+1], Level, Abc_Lit2Var(iLit), Abc_Lit2Var(pLits[k]) );
                else if ( Value1 == Abc_LitIsCompl(pLits[k+1]) ) // pLits[k+1] is false
                    return Cbs3_ManAnalyze( p, Level, Abc_Lit2Var(iLit), Abc_Lit2Var(pLits[k]), Abc_Lit2Var(pLits[k+1]) );
            }
        }
    }
    Cbs3_ManUpdateJFrontier( p );
    // finalize propagation queue
    p->pProp.iHead = p->pProp.iTail;
    return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Cbs3_ManSatPrintStats()

void Cbs3_ManSatPrintStats

(

Cbs3_Man_t *

p

)

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

Synopsis [Prints statistics of the manager.]

Description []

SideEffects []

SeeAlso []

Definition at line 1134 of file giaCSat3.c.

{
    printf( "CO = %8d  ", Gia_ManCoNum(p->pAig) );
    printf( "AND = %8d  ", Gia_ManAndNum(p->pAig) );
    printf( "Conf = %6d  ", p->Pars.nBTLimit );
    printf( "Restart = %2d  ", p->Pars.nRestLimit );
    printf( "JustMax = %5d  ", p->Pars.nJustLimit );
    printf( "\n" );
    printf( "Unsat calls %6d  (%6.2f %%)   Ave conf = %8.1f   ", 
        p->nSatUnsat, p->nSatTotal? 100.0*p->nSatUnsat/p->nSatTotal :0.0, p->nSatUnsat? 1.0*p->nConfUnsat/p->nSatUnsat :0.0 );
    ABC_PRTP( "Time", p->timeSatUnsat, p->timeTotal );
    printf( "Sat   calls %6d  (%6.2f %%)   Ave conf = %8.1f   ", 
        p->nSatSat,   p->nSatTotal? 100.0*p->nSatSat/p->nSatTotal :0.0, p->nSatSat? 1.0*p->nConfSat/p->nSatSat : 0.0 );
    ABC_PRTP( "Time", p->timeSatSat,   p->timeTotal );
    printf( "Undef calls %6d  (%6.2f %%)   Ave conf = %8.1f   ", 
        p->nSatUndec, p->nSatTotal? 100.0*p->nSatUndec/p->nSatTotal :0.0, p->nSatUndec? 1.0*p->nConfUndec/p->nSatUndec : 0.0 );
    ABC_PRTP( "Time", p->timeSatUndec, p->timeTotal );
    ABC_PRT( "Total time", p->timeTotal );
}

Here is the caller graph for this function:

Cbs3_ManSetConflictNum()

void Cbs3_ManSetConflictNum	(	Cbs3_Man_t *	p,
		int	Num )

Definition at line 167 of file giaCSat3.c.

{
    p->Pars.nBTLimit = Num;
}

Cbs3_ManSolve()

int Cbs3_ManSolve	(	Cbs3_Man_t *	p,
		int	iLit,
		int	nRestarts )

Definition at line 1111 of file giaCSat3.c.

{
    int i, RetValue = -1;
    assert( p->pClauses.iHead == 1 && p->pClauses.iTail == 1 );
    for ( i = 0; i < nRestarts; i++ )
        if ( (RetValue = Cbs3_ManSolveInt(p, iLit)) != -1 )
            break;
    Cbs3_ManCleanWatch( p );
    p->pClauses.iHead = p->pClauses.iTail = 1;
    return RetValue;
}

Cbs3_ManSolve2_rec()

int Cbs3_ManSolve2_rec	(	Cbs3_Man_t *	p,
		int	Level )

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

Synopsis [Solve the problem recursively.]

Description [Returns learnt clause if unsat, NULL if sat or undecided.]

SideEffects []

SeeAlso []

Definition at line 1026 of file giaCSat3.c.

{ 
    Cbs3_Que_t * pQue = &(p->pClauses);
    int iPropHead, iJustHead, iJustTail;
    int hClause, hLearn0, hLearn1, iVar, iDecLit;
    int nRef0, nRef1;
    // propagate assignments
    assert( !Cbs3_QueIsEmpty(&p->pProp) );
    //if ( (hClause = Cbs3_ManPropagate( p, Level )) )
    if ( (hClause = Cbs3_ManPropagateNew( p, Level )) )
        return hClause;
    // check for satisfying assignment
    assert( Cbs3_QueIsEmpty(&p->pProp) );
    if ( Cbs3_QueIsEmpty(&p->pJust) )
        return 0;
    // quit using resource limits
    p->Pars.nJustThis = Abc_MaxInt( p->Pars.nJustThis, p->pJust.iTail - p->pJust.iHead );
    if ( Cbs3_ManCheckLimits( p ) )
        return 0;
    // remember the state before branching
    iPropHead = p->pProp.iHead;
    iJustHead = p->pJust.iHead;
    iJustTail = p->pJust.iTail;
    // find the decision variable
    p->nDecs++;
    iVar = Cbs3_ManDecide( p );
    assert( !Cbs3_VarIsPi(p, iVar) );
    assert( Cbs3_VarIsJust(p, iVar) );
    // chose decision variable using fanout count
    nRef0 = Vec_IntEntry(&p->vRef, Abc_Lit2Var(Cbs3_VarLit0(p, iVar)));
    nRef1 = Vec_IntEntry(&p->vRef, Abc_Lit2Var(Cbs3_VarLit1(p, iVar)));
//    if ( nRef0 >= nRef1 || (nRef0 == nRef1) && (Abc_Random(0) & 1) )
    if ( nRef0 >= nRef1 )
        iDecLit = Abc_LitNot(Cbs3_VarLit0(p, iVar));
    else
        iDecLit = Abc_LitNot(Cbs3_VarLit1(p, iVar));
    // decide on first fanin
    Cbs3_ManAssign( p, iDecLit, Level+1, 0, 0 );
    if ( !(hLearn0 = Cbs3_ManSolve2_rec( p, Level+1 )) )
        return 0;
    if ( pQue->pData[hLearn0+1] != Abc_Lit2Var(iDecLit) )
        return hLearn0;
    Cbs3_ManCancelUntil( p, iPropHead );
    Cbs3_QueRestore( &p->pJust, iJustHead, iJustTail );
    // decide on second fanin
    Cbs3_ManAssign( p, Abc_LitNot(iDecLit), Level+1, 0, 0 );
    if ( !(hLearn1 = Cbs3_ManSolve2_rec( p, Level+1 )) )
        return 0;
    if ( pQue->pData[hLearn1+1] != Abc_Lit2Var(iDecLit) )
        return hLearn1;
    hClause = Cbs3_ManResolve( p, Level, hLearn0, hLearn1 );
    p->Pars.nBTThis++;
    return hClause;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Cbs3_ManSolveMiterNc()

Vec_Int_t * Cbs3_ManSolveMiterNc	(	Gia_Man_t *	pAig,
		int	nConfs,
		int	nRestarts,
		Vec_Str_t **	pvStatus,
		int	fVerbose )

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

Synopsis [Procedure to test the new SAT solver.]

Description []

SideEffects []

SeeAlso []

Definition at line 1284 of file giaCSat3.c.

{
    extern void Cec_ManSatAddToStore( Vec_Int_t * vCexStore, Vec_Int_t * vCex, int Out );
    Cbs3_Man_t * p; 
    Vec_Int_t * vCex, * vVisit, * vCexStore;
    Vec_Str_t * vStatus;
    Gia_Obj_t * pRoot; 
    int i, status; // 1 = unsat, 0 = sat, -1 = undec
    abctime clk, clkTotal = Abc_Clock();
    //assert( Gia_ManRegNum(pAig) == 0 );
    Gia_ManCreateRefs( pAig );
    //Gia_ManLevelNum( pAig );
    // create logic network
    p = Cbs3_ManAlloc( pAig );
    p->Pars.nBTLimit = nConfs;
    p->Pars.nRestLimit = nRestarts;
    // create resulting data-structures
    vStatus   = Vec_StrAlloc( Gia_ManPoNum(pAig) );
    vCexStore = Vec_IntAlloc( 10000 );
    vVisit    = Vec_IntAlloc( 100 );
    vCex      = Cbs3_ReadModel( p );
    // solve for each output
    Gia_ManForEachCo( pAig, pRoot, i )
    {
        if ( Gia_ObjIsConst0(Gia_ObjFanin0(pRoot)) )
        {
            Vec_IntClear( vCex );
            Vec_StrPush( vStatus, (char)(!Gia_ObjFaninC0(pRoot)) );
            if ( Gia_ObjFaninC0(pRoot) ) // const1
                Cec_ManSatAddToStore( vCexStore, vCex, i ); // trivial counter-example
            continue;
        }
        clk = Abc_Clock();
        status = Cbs3_ManToSolver2( p, pAig, pRoot, p->Pars.nRestLimit, 10000 );
        Vec_StrPush( vStatus, (char)status );
        if ( status == -1 )
        {
            p->nSatUndec++;
            p->nConfUndec += p->Pars.nBTThis;
            Cec_ManSatAddToStore( vCexStore, NULL, i ); // timeout
            p->timeSatUndec += Abc_Clock() - clk;
            continue;
        }
        if ( status == 1 )
        {
            p->nSatUnsat++;
            p->nConfUnsat += p->Pars.nBTThis;
            p->timeSatUnsat += Abc_Clock() - clk;
            continue;
        }
        p->nSatSat++;
        p->nConfSat += p->Pars.nBTThis;
        //Gia_SatVerifyPattern( pAig, pRoot, vCex, vVisit );
        Cec_ManSatAddToStore( vCexStore, vCex, i );
        p->timeSatSat += Abc_Clock() - clk;
    }
    Vec_IntFree( vVisit );
    p->nSatTotal = Gia_ManPoNum(pAig);
    p->timeTotal = Abc_Clock() - clkTotal;
    if ( fVerbose )
        Cbs3_ManSatPrintStats( p );
    if ( fVerbose )
    {
        printf( "Prop1 = %d.  Prop2 = %d.  Prop3 = %d.  ClaConf = %d.   FailJ = %d.  FailC = %d.   ", p->nPropCalls[0], p->nPropCalls[1], p->nPropCalls[2], p->nClauseConf, p->nFails[0], p->nFails[1] );
        printf( "Mem usage %.2f MB.\n", 1.0*Cbs3_ManMemory(p)/(1<<20) );
        //Abc_PrintTime( 1, "JFront", p->timeJFront );
        //Abc_PrintTime( 1, "Loading", p->timeSatLoad );
        //printf( "Decisions = %d.\n", p->nDecs );
    }
    Cbs3_ManStop( p );
    *pvStatus = vStatus;
    return vCexStore;
}

Here is the call graph for this function:

Cbs3_ManStop()

void Cbs3_ManStop

(

Cbs3_Man_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 246 of file giaCSat3.c.

{
    // circuit structure
    Vec_IntErase( &p->vMap );
    Vec_IntErase( &p->vRef );
    Vec_IntErase( &p->vFans );
    Vec_WecErase( &p->vImps );
    // internal data
    Vec_StrErase( &p->vAssign );
    Vec_StrErase( &p->vMark );
    Vec_IntErase( &p->vLevReason );
    Vec_IntErase( &p->vActs );
    Vec_IntErase( &p->vWatches );
    Vec_IntErase( &p->vWatchUpds );
    Vec_IntFree( p->vModel );
    Vec_IntFree( p->vTemp );
    ABC_FREE( p->pClauses.pData );
    ABC_FREE( p->pProp.pData );
    ABC_FREE( p->pJust.pData );
    ABC_FREE( p );
}

Here is the caller graph for this function:

Cbs3_ManUpdateJFrontier()

void Cbs3_ManUpdateJFrontier

(

Cbs3_Man_t *

p

)

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

Synopsis [Propagates a variable.]

Description [Returns clause handle if conflict; 0 if no conflict.]

SideEffects []

SeeAlso []

Definition at line 963 of file giaCSat3.c.

{
    //abctime clk = Abc_Clock();
    int iVar, iLit, i, k = p->pJust.iTail;
    Cbs3_QueGrow( &p->pJust, Cbs3_QueSize(&p->pJust) + Cbs3_QueSize(&p->pProp) );
    Cbs3_QueForEachEntry( p->pJust, iVar, i )
        if ( Cbs3_VarIsJust(p, iVar) )
            p->pJust.pData[k++] = iVar;
    Cbs3_QueForEachEntry( p->pProp, iLit, i )
        if ( Cbs3_VarIsJust(p, Abc_Lit2Var(iLit)) )
            p->pJust.pData[k++] = Abc_Lit2Var(iLit);
    p->pJust.iHead = p->pJust.iTail;
    p->pJust.iTail = k;
    //p->timeJFront += Abc_Clock() - clk;
}

Here is the caller graph for this function:

Cbs3_ReadModel()

Vec_Int_t * Cbs3_ReadModel

(

Cbs3_Man_t *

p

)

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

Synopsis [Returns satisfying assignment.]

Description []

SideEffects []

SeeAlso []

Definition at line 298 of file giaCSat3.c.

{
    return p->vModel;
}

Here is the caller graph for this function:

Cbs3_SetDefaultParams()

void Cbs3_SetDefaultParams

(

Cbs3_Par_t *

pPars

)

FUNCTION DEFINITIONS ///.

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

Synopsis [Sets default values of the parameters.]

Description []

SideEffects []

SeeAlso []

Definition at line 159 of file giaCSat3.c.

{
    memset( pPars, 0, sizeof(Cbs3_Par_t) );
    pPars->nBTLimit    =  1000;   // limit on the number of conflicts
    pPars->nJustLimit  =   500;   // limit on the size of justification queue
    pPars->nRestLimit  =    10;   // limit on the number of restarts
    pPars->fVerbose    =     1;   // print detailed statistics
}

Here is the call graph for this function:

Here is the caller graph for this function: