48 int i, RetValue1, RetValue2;
51 Aig_ManConst1(
p->pAig)->fMarkB = 1;
53 pObj->
fMarkB = Abc_InfoHasBit(
p->pPatWords, i );
56 pObj->
fMarkB = ( Aig_ObjFanin0(pObj)->fMarkB ^ Aig_ObjFaninC0(pObj) )
57 & ( Aig_ObjFanin1(pObj)->fMarkB ^ Aig_ObjFaninC1(pObj) );
65 if ( Aig_ObjIsConst1(pRepr) )
69 Abc_Print( 1,
"\nSsw_ManResimulateBit() Error: RetValue1 does not hold.\n" );
75 Abc_Print( 1,
"\nSsw_ManResimulateBit() Error: RetValue2 does not hold.\n" );
78p->timeSimSat += Abc_Clock() - clk;
94 int RetValue1, RetValue2;
104 if ( Aig_ObjIsConst1(pRepr) )
107 if ( RetValue1 == 0 )
108 Abc_Print( 1,
"\nSsw_ManResimulateWord() Error: RetValue1 does not hold.\n" );
113 if ( RetValue2 == 0 )
114 Abc_Print( 1,
"\nSsw_ManResimulateWord() Error: RetValue2 does not hold.\n" );
116p->timeSimSat += Abc_Clock() - clk;
#define ABC_NAMESPACE_IMPL_START
#define ABC_NAMESPACE_IMPL_END
#define Aig_ManForEachCi(p, pObj, i)
ITERATORS ///.
struct Aig_Obj_t_ Aig_Obj_t
#define Aig_ManForEachNode(p, pObj, i)
int Ssw_ClassesRefineConst1(Ssw_Cla_t *p, int fRecursive)
int Ssw_ClassesRefine(Ssw_Cla_t *p, int fRecursive)
typedefABC_NAMESPACE_HEADER_START struct Ssw_Man_t_ Ssw_Man_t
INCLUDES ///.
void Ssw_SmlSimulateOne(Ssw_Sml_t *p)
void Ssw_SmlAssignDist1Plus(Ssw_Sml_t *p, unsigned *pPat)
ABC_NAMESPACE_IMPL_START void Ssw_ManResimulateBit(Ssw_Man_t *p, Aig_Obj_t *pCand, Aig_Obj_t *pRepr)
DECLARATIONS ///.
void Ssw_ManResimulateWord(Ssw_Man_t *p, Aig_Obj_t *pCand, Aig_Obj_t *pRepr, int f)