48 DdNode * bBdd0, * bBdd1, * bTemp, * bResult;
68 if ( pObj->
pData == NULL )
111 DdNode * bVar, * bCube, * bTemp;
typedefABC_NAMESPACE_HEADER_START struct Vec_Ptr_t_ Vec_Ptr_t
INCLUDES ///.
void Cudd_RecursiveDeref(DdManager *table, DdNode *n)
static int Saig_ManPoNum(Aig_Man_t *p)
typedefABC_NAMESPACE_HEADER_START struct Aig_Man_t_ Aig_Man_t
INCLUDES ///.
void Cudd_Deref(DdNode *node)
DdNode * Cudd_ReadLogicZero(DdManager *dd)
DdNode * Cudd_bddExistAbstract(DdManager *manager, DdNode *f, DdNode *cube)
static Aig_Obj_t * Aig_ObjFanin0(Aig_Obj_t *pObj)
ABC_NAMESPACE_IMPL_START DdNode * Llb_BddComputeBad(Aig_Man_t *pInit, DdManager *dd, abctime TimeOut)
DECLARATIONS ///.
static Aig_Obj_t * Aig_ObjFanin1(Aig_Obj_t *pObj)
int Cudd_ReadSize(DdManager *dd)
DdNode * Llb_BddQuantifyPis(Aig_Man_t *pInit, DdManager *dd, DdNode *bFunc)
static int Aig_ObjIsNode(Aig_Obj_t *pObj)
Vec_Ptr_t * Aig_ManDfsNodes(Aig_Man_t *p, Aig_Obj_t **ppNodes, int nNodes)
static int Aig_ManCiNum(Aig_Man_t *p)
#define ABC_NAMESPACE_IMPL_END
#define Saig_ManForEachLo(p, pObj, i)
DdNode * Cudd_bddOr(DdManager *dd, DdNode *f, DdNode *g)
static int Aig_ObjFaninC0(Aig_Obj_t *pObj)
static Aig_Obj_t * Aig_ManConst1(Aig_Man_t *p)
#define ABC_NAMESPACE_IMPL_START
static int Aig_ManRegNum(Aig_Man_t *p)
DdNode * Cudd_ReadOne(DdManager *dd)
#define Vec_PtrForEachEntryStop(Type, vVec, pEntry, i, Stop)
DdNode * Cudd_bddIthVar(DdManager *dd, int i)
static int Aig_ObjFaninC1(Aig_Obj_t *pObj)
#define Cudd_NotCond(node, c)
DdNode * Cudd_bddAnd(DdManager *dd, DdNode *f, DdNode *g)
#define Saig_ManForEachPo(p, pObj, i)
#define Vec_PtrForEachEntry(Type, vVec, pEntry, i)
MACRO DEFINITIONS ///.
static void ** Vec_PtrArray(Vec_Ptr_t *p)
static void Vec_PtrFree(Vec_Ptr_t *p)
#define Saig_ManForEachPi(p, pObj, i)