giaCSatP.c File Reference

#include "gia.h"
#include "giaCSatP.h"

Include dependency graph for giaCSatP.c:

Go to the source code of this file.

Macros
#define	CbsP_QueForEachEntry(Que, pObj, i)
#define	CbsP_ClauseForEachVar(p, hClause, pObj)
#define	CbsP_ClauseForEachVar1(p, hClause, pObj)

Functions
void	CbsP_SetDefaultParams (CbsP_Par_t *pPars)
	FUNCTION DEFINITIONS ///.
void	CbsP_ManSetConflictNum (CbsP_Man_t *p, int Num)
void	CbsP_PrintRecord (CbsP_Par_t *pPars)
CbsP_Man_t *	CbsP_ManAlloc (Gia_Man_t *pGia)
void	CbsP_ManStop (CbsP_Man_t *p)
Vec_Int_t *	CbsP_ReadModel (CbsP_Man_t *p)
int	CbsP_ManPropagate (CbsP_Man_t *p, int Level)
int	CbsP_ManSolve_rec (CbsP_Man_t *p, int Level)
int	CbsP_ManSolve (CbsP_Man_t *p, Gia_Obj_t *pObj)
int	CbsP_ManSolve2 (CbsP_Man_t *p, Gia_Obj_t *pObj, Gia_Obj_t *pObj2)
void	CbsP_ManSatPrintStats (CbsP_Man_t *p)
Vec_Int_t *	CbsP_ManSolveMiterNc (Gia_Man_t *pAig, int nConfs, Vec_Str_t **pvStatus, int f0Proved, int fVerbose)

Macro Definition Documentation

CbsP_ClauseForEachVar

#define CbsP_ClauseForEachVar	(		p,
			hClause,
			pObj )

Value:

    for ( (p)->pIter = (p)->pClauses.pData + hClause; (pObj = *pIter); (p)->pIter++ )

Definition at line 52 of file giaCSatP.c.

#define CbsP_ClauseForEachVar( p, hClause, pObj )                    \
    for ( (p)->pIter = (p)->pClauses.pData + hClause; (pObj = *pIter); (p)->pIter++ )

CbsP_ClauseForEachVar1

#define CbsP_ClauseForEachVar1	(		p,
			hClause,
			pObj )

Value:

    for ( (p)->pIter = (p)->pClauses.pData+hClause+1; (pObj = *pIter); (p)->pIter++ )

Definition at line 54 of file giaCSatP.c.

#define CbsP_ClauseForEachVar1( p, hClause, pObj )                   \
    for ( (p)->pIter = (p)->pClauses.pData+hClause+1; (pObj = *pIter); (p)->pIter++ )

CbsP_QueForEachEntry

#define CbsP_QueForEachEntry	(		Que,
			pObj,
			i )

Value:

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

Definition at line 49 of file giaCSatP.c.

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

Function Documentation

CbsP_ManAlloc()

CbsP_Man_t * CbsP_ManAlloc

(

Gia_Man_t *

pGia

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 173 of file giaCSatP.c.

{
    CbsP_Man_t * p;
    p = ABC_CALLOC( CbsP_Man_t, 1 );
    p->pProp.nSize = p->pJust.nSize = p->pClauses.nSize = 10000;
    p->pProp.pData = ABC_ALLOC( Gia_Obj_t *, p->pProp.nSize );
    p->pJust.pData = ABC_ALLOC( Gia_Obj_t *, p->pJust.nSize );
    p->pClauses.pData = ABC_ALLOC( Gia_Obj_t *, p->pClauses.nSize );
    p->pClauses.iHead = p->pClauses.iTail = 1;
    p->vModel   = Vec_IntAlloc( 1000 );
    p->vLevReas = Vec_IntAlloc( 1000 );
    p->vTemp    = Vec_PtrAlloc( 1000 );
    p->pAig     = pGia;
    p->vValue   = Vec_IntAlloc( Gia_ManObjNum(pGia) );
    Vec_IntFill( p->vValue, Gia_ManObjNum(pGia), ~0 );
    //memset( p->vValue->pArray, (unsigned) ~0, sizeof(int) * Gia_ManObjNum(pGia) );
    CbsP_SetDefaultParams( &p->Pars );
    return p;
}

Here is the call graph for this function:

Here is the caller graph for this function:

CbsP_ManPropagate()

int CbsP_ManPropagate	(	CbsP_Man_t *	p,
		int	Level )

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

Synopsis [Propagates all variables.]

Description [Returns 1 if conflict; 0 if no conflict.]

SideEffects []

SeeAlso []

Definition at line 869 of file giaCSatP.c.

{
    int hClause;
    Gia_Obj_t * pVar;
    int i, k;
    while ( 1 )
    {
        CbsP_QueForEachEntry( p->pProp, pVar, i )
        {
            if ( (hClause = CbsP_ManPropagateOne( p, pVar, Level )) )
                return hClause;
            if( CbsP_ManCheckPropLimits(p) )
                return 0;
        }
        p->pProp.iHead = p->pProp.iTail;
        k = p->pJust.iHead;
        CbsP_QueForEachEntry( p->pJust, pVar, i )
        {
            if ( CbsP_VarIsJust( pVar ) )
                p->pJust.pData[k++] = pVar;
            else if ( (hClause = CbsP_ManPropagateTwo( p, pVar, Level )) )
                return hClause;
            if( CbsP_ManCheckPropLimits(p) )
                return 0;
        }
        if ( k == p->pJust.iTail )
            break;
        p->pJust.iTail = k;
    }
    return 0;
}

Here is the caller graph for this function:

CbsP_ManSatPrintStats()

void CbsP_ManSatPrintStats

(

CbsP_Man_t *

p

)

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

Synopsis [Prints statistics of the manager.]

Description []

SideEffects []

SeeAlso []

Definition at line 1073 of file giaCSatP.c.

{
    printf( "CO = %8d  ", Gia_ManCoNum(p->pAig) );
    printf( "AND = %8d  ", Gia_ManAndNum(p->pAig) );
    printf( "Conf = %6d  ", p->Pars.nBTLimit );
    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:

CbsP_ManSetConflictNum()

void CbsP_ManSetConflictNum	(	CbsP_Man_t *	p,
		int	Num )

Definition at line 107 of file giaCSatP.c.

{
    p->Pars.nBTLimit = Num;
}

CbsP_ManSolve()

int CbsP_ManSolve	(	CbsP_Man_t *	p,
		Gia_Obj_t *	pObj )

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

Synopsis [Looking for a satisfying assignment of the node.]

Description [Assumes that each node has flag pObj->fMark0 set to 0. Returns 1 if unsatisfiable, 0 if satisfiable, and -1 if undecided. The node may be complemented. ]

SideEffects [The two procedures differ in the CEX format.]

SeeAlso []

Definition at line 994 of file giaCSatP.c.

{
    int RetValue = 0;
//    s_Counter = 0;
    assert( !p->pProp.iHead && !p->pProp.iTail );
    assert( !p->pJust.iHead && !p->pJust.iTail );
    assert( p->pClauses.iHead == 1 && p->pClauses.iTail == 1 );
    p->Pars.nBTThis = p->Pars.nJustThis = p->Pars.nBTThisNc = 0;
    CbsP_ManAssign( p, pObj, 0, NULL, NULL );
    if ( !CbsP_ManSolve_rec(p, 0) && !CbsP_ManCheckLimits(p) )
        CbsP_ManSaveModel( p, p->vModel );
    else
        RetValue = 1;
    CbsP_ManCancelUntil( p, 0 );
    p->pJust.iHead = p->pJust.iTail = 0;
    p->pClauses.iHead = p->pClauses.iTail = 1;
    p->Pars.nBTTotal += p->Pars.nBTThis;
    p->Pars.nJustTotal = Abc_MaxInt( p->Pars.nJustTotal, p->Pars.nJustThis );
    if ( CbsP_ManCheckLimits( p ) )
        RetValue = -1;
//    printf( "%d ", s_Counter );
    return RetValue;
}

Here is the call graph for this function:

Here is the caller graph for this function:

CbsP_ManSolve2()

int CbsP_ManSolve2	(	CbsP_Man_t *	p,
		Gia_Obj_t *	pObj,
		Gia_Obj_t *	pObj2 )

Definition at line 1017 of file giaCSatP.c.

{
    abctime clk = Abc_Clock();
    int RetValue = 0;
//    s_Counter = 0;
    assert( !p->pProp.iHead && !p->pProp.iTail );
    assert( !p->pJust.iHead && !p->pJust.iTail );
    assert( p->pClauses.iHead == 1 && p->pClauses.iTail == 1 );
    p->Pars.nBTThis = p->Pars.nJustThis = p->Pars.nBTThisNc = 0;
    p->Pars.nJscanThis = p->Pars.nRscanThis = p->Pars.nPropThis = 0;
    CbsP_ManAssign( p, pObj, 0, NULL, NULL );
    if ( pObj2 ) 
    CbsP_ManAssign( p, pObj2, 0, NULL, NULL );
    if ( !CbsP_ManSolve_rec(p, 0) && !CbsP_ManCheckLimits(p) )
        CbsP_ManSaveModel( p, p->vModel );
    else 
        RetValue = 1;
    CbsP_ManCancelUntil( p, 0 );
 
    p->pJust.iHead = p->pJust.iTail = 0;
    p->pClauses.iHead = p->pClauses.iTail = 1;
    p->Pars.nBTTotal += p->Pars.nBTThis;
    p->Pars.nJustTotal = Abc_MaxInt( p->Pars.nJustTotal, p->Pars.nJustThis );
    if ( CbsP_ManCheckLimits( p ) )
        RetValue = -1;
 
    if( CBS_SAT == RetValue ){
        p->nSatSat ++;
        p->timeSatSat   += Abc_Clock() - clk;
        p->nConfSat     += p->Pars.nBTThis;
    } else
    if( CBS_UNSAT == RetValue ){
        p->nSatUnsat ++;
        p->timeSatUnsat += Abc_Clock() - clk;
        p->nConfUnsat   += p->Pars.nBTThis;
    } else {
        p->nSatUndec ++;
        p->timeSatUndec += Abc_Clock() - clk;
        p->nConfUndec   += p->Pars.nBTThis;
    }
//    printf( "%d ", s_Counter );
    CbsP_UpdateRecord(&p->Pars,RetValue);
    return RetValue;
}

Here is the call graph for this function:

Here is the caller graph for this function:

CbsP_ManSolve_rec()

int CbsP_ManSolve_rec	(	CbsP_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 912 of file giaCSatP.c.

{ 
    CbsP_Que_t * pQue = &(p->pClauses);
    Gia_Obj_t * pVar = NULL, * pDecVar;
    int hClause, hLearn0, hLearn1;
    int iPropHead, iJustHead, iJustTail;
    // propagate assignments
    assert( !CbsP_QueIsEmpty(&p->pProp) );
    if ( (hClause = CbsP_ManPropagate( p, Level )) )
        return hClause;
    
    // quit using resource limits
    if ( CbsP_ManCheckLimits( p ) )
        return 0;
    // check for satisfying assignment
    assert( CbsP_QueIsEmpty(&p->pProp) );
    if ( CbsP_QueIsEmpty(&p->pJust) )
        return 0;
    p->Pars.nJustThis = Abc_MaxInt( p->Pars.nJustThis, p->pJust.iTail - p->pJust.iHead );
    // remember the state before branching
    iPropHead = p->pProp.iHead;
    CbsP_QueStore( &p->pJust, &iJustHead, &iJustTail );
    p->Pars.nJscanThis += iJustTail - iJustHead;
    if ( CbsP_ManCheckLimits( p ) )
        return 0;
    // find the decision variable
    if ( p->Pars.fUseHighest )
        pVar = CbsP_ManDecideHighest( p );
    else if ( p->Pars.fUseLowest )
        pVar = CbsP_ManDecideLowest( p );
    else if ( p->Pars.fUseMaxFF )
        pVar = CbsP_ManDecideMaxFF( p );
    else assert( 0 );
    assert( CbsP_VarIsJust( pVar ) );
    // chose decision variable using fanout count
 
    if ( Gia_ObjRefNum(p->pAig, Gia_ObjFanin0(pVar)) > Gia_ObjRefNum(p->pAig, Gia_ObjFanin1(pVar)) )
        pDecVar = Gia_Not(Gia_ObjChild0(pVar));
    else
        pDecVar = Gia_Not(Gia_ObjChild1(pVar));
    
//    pDecVar = Gia_NotCond( Gia_Regular(pDecVar), Gia_Regular(pDecVar)->fPhase );
//    pDecVar = Gia_Not(pDecVar);
    // decide on first fanin
    CbsP_ManAssign( p, pDecVar, Level+1, NULL, NULL );
    if ( !(hLearn0 = CbsP_ManSolve_rec( p, Level+1 )) )
        return 0;
    if ( CbsP_ManCheckLimits( p ) )
        return 0;
    if ( pQue->pData[hLearn0] != Gia_Regular(pDecVar) )
        return hLearn0;
    CbsP_ManCancelUntil( p, iPropHead );
    CbsP_QueRestore( &p->pJust, iJustHead, iJustTail );
    // decide on second fanin
    CbsP_ManAssign( p, Gia_Not(pDecVar), Level+1, NULL, NULL );
    if ( !(hLearn1 = CbsP_ManSolve_rec( p, Level+1 )) )
        return 0;
    if ( CbsP_ManCheckLimits( p ) )
        return 0;
    if ( pQue->pData[hLearn1] != Gia_Regular(pDecVar) )
        return hLearn1;
    hClause = CbsP_ManResolve( p, Level, hLearn0, hLearn1 );
//    CbsP_ManPrintClauseNew( p, Level, hClause );
//    if ( Level > CbsP_ClauseDecLevel(p, hClause) )
//        p->Pars.nBTThisNc++;
    p->Pars.nBTThis++;
    return hClause;
}

Here is the call graph for this function:

Here is the caller graph for this function:

CbsP_ManSolveMiterNc()

Vec_Int_t * CbsP_ManSolveMiterNc	(	Gia_Man_t *	pAig,
		int	nConfs,
		Vec_Str_t **	pvStatus,
		int	f0Proved,
		int	fVerbose )

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

Synopsis [Procedure to test the new SAT solver.]

Description []

SideEffects []

SeeAlso []

Definition at line 1103 of file giaCSatP.c.

{
    extern void Gia_ManCollectTest( Gia_Man_t * pAig );
    extern void Cec_ManSatAddToStore( Vec_Int_t * vCexStore, Vec_Int_t * vCex, int Out );
    CbsP_Man_t * p; 
    Vec_Int_t * vCex, * vVisit, * vCexStore;
    Vec_Str_t * vStatus;
    Gia_Obj_t * pRoot; 
    int i, status;
    abctime clk, clkTotal = Abc_Clock();
    assert( Gia_ManRegNum(pAig) == 0 );
//    Gia_ManCollectTest( pAig );
    // prepare AIG
    Gia_ManCreateRefs( pAig );
    Gia_ManCleanMark0( pAig );
    Gia_ManCleanMark1( pAig );
    Gia_ManFillValue( pAig ); // maps nodes into trail ids
    Gia_ManSetPhase( pAig ); // maps nodes into trail ids
    // create logic network
    p = CbsP_ManAlloc( pAig );
    p->Pars.nBTLimit = nConfs;
    // create resulting data-structures
    vStatus   = Vec_StrAlloc( Gia_ManPoNum(pAig) );
    vCexStore = Vec_IntAlloc( 10000 );
    vVisit    = Vec_IntAlloc( 100 );
    vCex      = CbsP_ReadModel( p );
    // solve for each output
    Gia_ManForEachCo( pAig, pRoot, i )
    {
//        printf( "\n" );
 
        Vec_IntClear( vCex );
        if ( Gia_ObjIsConst0(Gia_ObjFanin0(pRoot)) )
        {
            if ( Gia_ObjFaninC0(pRoot) )
            {
//                printf( "Constant 1 output of SRM!!!\n" );
                Cec_ManSatAddToStore( vCexStore, vCex, i ); // trivial counter-example
                Vec_StrPush( vStatus, 0 );
            }
            else
            {
//                printf( "Constant 0 output of SRM!!!\n" );
                Vec_StrPush( vStatus, 1 );
            }
            continue;
        }
        clk = Abc_Clock();
        p->Pars.fUseHighest = 1;
        p->Pars.fUseLowest  = 0;
        status = CbsP_ManSolve( p, Gia_ObjChild0(pRoot) );
//        printf( "\n" );
/*
        if ( status == -1 )
        {
            p->Pars.fUseHighest = 0;
            p->Pars.fUseLowest  = 1;
            status = CbsP_ManSolve( p, Gia_ObjChild0(pRoot) );
        }
*/
        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 )
        {
            if ( f0Proved )
                Gia_ManPatchCoDriver( pAig, i, 0 );
            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 )
        CbsP_ManSatPrintStats( p );
//    printf( "RecCalls = %8d.  RecClause = %8d.  RecNonChro = %8d.\n", p->nRecCall, p->nRecClause, p->nRecNonChro );
    CbsP_ManStop( p );
    *pvStatus = vStatus;
 
//    printf( "Total number of cex literals = %d. (Ave = %d)\n", 
//         Vec_IntSize(vCexStore)-2*p->nSatUndec-2*p->nSatSat, 
//        (Vec_IntSize(vCexStore)-2*p->nSatUndec-2*p->nSatSat)/p->nSatSat );
    return vCexStore;
}

Here is the call graph for this function:

CbsP_ManStop()

void CbsP_ManStop

(

CbsP_Man_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 204 of file giaCSatP.c.

{
    Vec_IntFree( p->vLevReas );
    Vec_IntFree( p->vModel );
    Vec_PtrFree( p->vTemp );
    Vec_IntFree( p->vValue );
    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:

CbsP_PrintRecord()

void CbsP_PrintRecord

(

CbsP_Par_t *

pPars

)

Definition at line 148 of file giaCSatP.c.

                                           {
    printf("max of solved: jscan# %13d rscan %13d prop %13d\n"   , pPars->maxJscanSolved, pPars->maxRscanSolved , pPars->maxPropSolved );
    printf("max of  undec: jscan# %13d rscan %13d prop %13d\n"   , pPars->maxJscanUndec , pPars->maxRscanUndec  , pPars->maxPropUndec  );
    printf("acc of    sat: jscan# %13ld rscan %13ld prop %13ld\n", pPars->accJscanSat   , pPars->accRscanSat    , pPars->accPropSat    );
    printf("acc of  unsat: jscan# %13ld rscan %13ld prop %13ld\n", pPars->accJscanUnsat , pPars->accRscanUnsat  , pPars->accPropUnsat  );
    printf("acc of  undec: jscan# %13ld rscan %13ld prop %13ld\n", pPars->accJscanUndec , pPars->accRscanUndec  , pPars->accPropUndec  );
    if( pPars->nSat )
        printf("avg of    sat: jscan# %13ld rscan %13ld prop %13ld\n", pPars->accJscanSat   / pPars->nSat   , pPars->accRscanSat   / pPars->nSat   , pPars->accPropSat   / pPars->nSat   );
    if( pPars->nUnsat )
        printf("avg of  unsat: jscan# %13ld rscan %13ld prop %13ld\n", pPars->accJscanUnsat / pPars->nUnsat , pPars->accRscanUnsat / pPars->nUnsat , pPars->accPropUnsat / pPars->nUnsat );
    if( pPars->nUndec )
        printf("avg of  undec: jscan# %13ld rscan %13ld prop %13ld\n", pPars->accJscanUndec / pPars->nUndec , pPars->accRscanUndec / pPars->nUndec , pPars->accPropUndec / pPars->nUndec );
}

Here is the caller graph for this function:

CbsP_ReadModel()

Vec_Int_t * CbsP_ReadModel

(

CbsP_Man_t *

p

)

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

Synopsis [Returns satisfying assignment.]

Description []

SideEffects []

SeeAlso []

Definition at line 227 of file giaCSatP.c.

{
    return p->vModel;
}

Here is the caller graph for this function:

CbsP_SetDefaultParams()

void CbsP_SetDefaultParams

(

CbsP_Par_t *

pPars

)

FUNCTION DEFINITIONS ///.

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

Synopsis [Sets default values of the parameters.]

Description []

SideEffects []

SeeAlso []

Definition at line 72 of file giaCSatP.c.

{
    memset( pPars, 0, sizeof(CbsP_Par_t) );
    pPars->nBTLimit    =  1000;   // limit on the number of conflicts
    pPars->nJustLimit  =   100;   // limit on the size of justification queue
    pPars->fUseHighest =     1;   // use node with the highest ID
    pPars->fUseLowest  =     0;   // use node with the highest ID
    pPars->fUseMaxFF   =     0;   // use node with the largest fanin fanout
    pPars->fVerbose    =     1;   // print detailed statistics
 
    pPars->fUseProved  =     1;
 
 
    pPars->nJscanThis     = 0;
    pPars->nRscanThis     = 0;
    pPars->maxJscanUndec  = 0;
    pPars->maxRscanUndec  = 0;
    pPars->maxJscanSolved = 0;
    pPars->maxRscanSolved = 0;
 
 
    pPars->accJscanSat    = 0;
    pPars->accJscanUnsat  = 0;
    pPars->accJscanUndec  = 0;
    pPars->accRscanSat    = 0;
    pPars->accRscanUnsat  = 0;
    pPars->accRscanUndec  = 0;
    pPars->nSat    = 0;
    pPars->nUnsat  = 0;
    pPars->nUndec  = 0;
 
    pPars->nJscanLimit    = 100;
    pPars->nRscanLimit    = 100;
    pPars->nPropLimit     = 500;
}

Here is the call graph for this function:

Here is the caller graph for this function: