54 printf(
"Aig_ManCheck: The PI node \"%p\" has fanins.\n", pObj );
63 printf(
"Aig_ManCheck: The PO node \"%p\" has NULL fanin.\n", pObj );
68 printf(
"Aig_ManCheck: The PO node \"%p\" has second fanin.\n", pObj );
79 printf(
"Aig_ManCheck: The AIG has internal node \"%p\" with a NULL fanin.\n", pObj );
84 printf(
"Aig_ManCheck: The AIG has node \"%p\" with a wrong ordering of fanins.\n", pObj );
90 printf(
"Aig_ManCheck: Node \"%p\" is not in the structural hashing table.\n", pObj );
98 printf(
"Aig_ManCheck: The number of created nodes is wrong.\n" );
99 printf(
"C1 = %d. Pi = %d. Po = %d. Buf = %d. And = %d. Xor = %d. Total = %d.\n",
102 printf(
"Created = %d. Deleted = %d. Existing = %d.\n",
109 printf(
"Aig_ManCheck: The number of nodes in the structural hashing table is wrong.\n" );
110 printf(
"Entries = %d. And = %d. Xor = %d. Total = %d.\n",
typedefABC_NAMESPACE_HEADER_START struct Aig_Man_t_ Aig_Man_t
INCLUDES ///.
static Aig_Obj_t * Aig_ObjChild0(Aig_Obj_t *pObj)
Aig_Obj_t * Aig_TableLookup(Aig_Man_t *p, Aig_Obj_t *pGhost)
static int Aig_ManObjNum(Aig_Man_t *p)
static Aig_Obj_t * Aig_ObjFanin0(Aig_Obj_t *pObj)
#define Aig_ManForEachCi(p, pObj, i)
ITERATORS ///.
#define Aig_ManForEachCo(p, pObj, i)
ABC_NAMESPACE_IMPL_START int Aig_ManCheck(Aig_Man_t *p)
DECLARATIONS ///.
static Aig_Obj_t * Aig_ObjFanin1(Aig_Obj_t *pObj)
void Aig_ManCheckMarkA(Aig_Man_t *p)
static int Aig_ManBufNum(Aig_Man_t *p)
static int Aig_ObjIsNode(Aig_Obj_t *pObj)
static int Aig_ManCoNum(Aig_Man_t *p)
static int Aig_ManCiNum(Aig_Man_t *p)
#define ABC_NAMESPACE_IMPL_END
static Aig_Obj_t * Aig_ObjChild1(Aig_Obj_t *pObj)
static int Aig_ObjPhaseReal(Aig_Obj_t *pObj)
void Aig_ManCheckPhase(Aig_Man_t *p)
int Aig_TableCountEntries(Aig_Man_t *p)
static int Aig_ManObjNumMax(Aig_Man_t *p)
#define ABC_NAMESPACE_IMPL_START
#define Aig_ManForEachObj(p, pObj, i)
static int Aig_ManAndNum(Aig_Man_t *p)
static int Aig_ManExorNum(Aig_Man_t *p)
static int Aig_ObjIsCi(Aig_Obj_t *pObj)