69 p->nVarsMax = nVarsMax;
70 p->nWordsMax = Kit_TruthWordNum(
p->nVarsMax );
71 p->vTruthVars = Vec_PtrAllocTruthTables(
p->nVarsMax );
72 p->vTruthNodes = Vec_PtrAllocSimInfo( 512,
p->nWordsMax );
73 p->vConeCare = Vec_IntAlloc( 512 );
74 p->vConeData = Vec_IntAlloc( 512 );
95 Vec_IntFreeP( &
p->vConeCare );
96 Vec_IntFreeP( &
p->vConeData );
97 Vec_PtrFreeP( &
p->vTruthVars );
98 Vec_PtrFreeP( &
p->vTruthNodes );
115 int iData = Gia_ObjId(
p->pGia, Gia_Regular(pData) );
116 int iCare = Gia_ObjId(
p->pGia, Gia_Regular(pCare) );
117 if ( !Gia_ObjIsAnd(Gia_Regular(pCare)) )
119 Abc_Print( 1,
"Enable is not an AND.\n" );
122 Abc_Print( 1,
"DataSupp = %6d. DataCone = %6d. CareSupp = %6d. CareCone = %6d.",
127 Abc_Print( 1,
"\n" );
148 assert( Vec_IntSize(vPairs) % 2 == 0 );
149 for ( i = 0; i < Vec_IntSize(vPairs)/2; i++ )
151 Abc_Print( 1,
"%6d : ", i );
152 pData = Gia_ManPo( pGia, Vec_IntEntry(vPairs, 2*i+0) );
153 pCare = Gia_ManPo( pGia, Vec_IntEntry(vPairs, 2*i+1) );
#define ABC_ALLOC(type, num)
#define ABC_CALLOC(type, num)
#define ABC_NAMESPACE_IMPL_START
#define ABC_NAMESPACE_IMPL_END
typedefABC_NAMESPACE_IMPL_START struct Vec_Int_t_ Vec_Int_t
DECLARATIONS ///.
void Gia_ManSupExperiment(Gia_Man_t *pGia, Vec_Int_t *vPairs)
Gia_ManSup_t * Gia_ManSupStart(int nVarsMax)
FUNCTION DEFINITIONS ///.
void Gia_ManSupStop(Gia_ManSup_t *p)
typedefABC_NAMESPACE_IMPL_START struct Gia_ManSup_t_ Gia_ManSup_t
DECLARATIONS ///.
void Gia_ManSupExperimentOne(Gia_ManSup_t *p, Gia_Obj_t *pData, Gia_Obj_t *pCare)
int Gia_ManSuppSize(Gia_Man_t *p, int *pNodes, int nNodes)
struct Gia_Obj_t_ Gia_Obj_t
struct Gia_Man_t_ Gia_Man_t
int Gia_ManConeSize(Gia_Man_t *p, int *pNodes, int nNodes)
typedefABC_NAMESPACE_HEADER_START struct Vec_Ptr_t_ Vec_Ptr_t
INCLUDES ///.