56 pMan->nFaninMax = nFaninMax;
57 pMan->nCubesMax = 2 * pMan->nFaninMax;
96 for ( i = 0; i < p->vObjStrs->nSize; i++ )
98 vSupp = ((
Cov_Obj_t *)p->vObjStrs->pArray[i])->vSupp;
132 if ( --nFanouts == 0 )
ABC_NAMESPACE_IMPL_START Cov_Man_t * Cov_ManAlloc(Abc_Ntk_t *pNtk, int nFaninMax)
DECLARATIONS ///.
static Vec_Int_t * Abc_ObjGetSupp(Abc_Obj_t *pObj)
static int Abc_NtkObjNumMax(Abc_Ntk_t *pNtk)
typedefABC_NAMESPACE_IMPL_START struct Vec_Int_t_ Vec_Int_t
DECLARATIONS ///.
static void Vec_PtrFill(Vec_Ptr_t *p, int nSize, void *Entry)
#define ABC_ALLOC(type, num)
Min_Man_t * Min_ManAlloc(int nVars)
DECLARATIONS ///.
static Min_Cube_t * Abc_ObjGetCover2(Abc_Obj_t *pObj)
static void Vec_IntWriteEntry(Vec_Int_t *p, int i, int Entry)
static Vec_Int_t * Vec_IntAlloc(int nCap)
FUNCTION DEFINITIONS ///.
void Cov_ManFree(Cov_Man_t *p)
static int Vec_IntEntry(Vec_Int_t *p, int i)
static void Abc_ObjSetCover2(Abc_Obj_t *pObj, Min_Cube_t *pCov)
#define ABC_NAMESPACE_IMPL_END
static void Vec_IntPush(Vec_Int_t *p, int Entry)
void Abc_NodeCovDropData(Cov_Man_t *p, Abc_Obj_t *pObj)
static void Vec_PtrWriteEntry(Vec_Ptr_t *p, int i, void *Entry)
#define ABC_NAMESPACE_IMPL_START
static Vec_Ptr_t * Vec_PtrAlloc(int nCap)
FUNCTION DEFINITIONS ///.
typedefABC_NAMESPACE_HEADER_START struct Cov_Man_t_ Cov_Man_t
DECLARATIONS ///.
static int Abc_BitWordNum(int nBits)
static void Min_CoverRecycle(Min_Man_t *p, Min_Cube_t *pCover)
static void Vec_IntFree(Vec_Int_t *p)
static void Abc_ObjSetSupp(Abc_Obj_t *pObj, Vec_Int_t *vVec)
#define Abc_NtkForEachObj(pNtk, pObj, i)
ITERATORS ///.
static void Vec_PtrFree(Vec_Ptr_t *p)
void Min_ManFree(Min_Man_t *p)