51 Vec_IntGrow( &
p->vCis, 1024 );
52 Vec_IntGrow( &
p->vCos, 1024 );
53 Mig_ManAppendObj(
p );
59 printf(
"Subject graph uses %d pages of %d objects with %d entries. Total memory = %.2f MB.\n",
60 Vec_PtrSize(&
p->vPages),
MIG_MASK + 1,
p->nObjs,
61 1.0 * Vec_PtrSize(&
p->vPages) * (
MIG_MASK + 1) * 16 / (1 << 20) );
95 Counter += (Mig_ObjNodeType(pObj) == Type);
128 Vec_IntFill( &
p->vRefs, Mig_ManObjNum(
p), 0 );
132 Vec_IntAddToEntry( &
p->vRefs, iFanin, 1 );
133 if ( Mig_ObjSiblId(pObj) )
134 Vec_IntAddToEntry( &
p->vRefs, Mig_ObjSiblId(pObj), 1 );
153 if ( Mig_ObjIsTravIdCurrent(pObj) )
155 Mig_ObjSetTravIdCurrent(pObj);
156 if ( Mig_ObjIsCi(pObj) )
158 assert( Mig_ObjIsNode(pObj) );
168 if ( Mig_ObjIsTravIdCurrentId(
p, iObj) )
170 Mig_ObjSetTravIdCurrentId(
p, iObj);
171 pObj = Mig_ManObj(
p, iObj );
172 if ( Mig_ObjIsCi(pObj) )
174 assert( Mig_ObjIsNode(pObj) );
181 Mig_ObjIncrementTravId( pObj );
191 if ( Mig_ObjIsNode(pObj) )
193 printf(
"Nodes with small support %d (out of %d)\n", Counter, Mig_ManNodeNum(
p) );
194 Abc_PrintTime( 1,
"Time", Abc_Clock() - clk );
#define ABC_CALLOC(type, num)
#define ABC_NAMESPACE_IMPL_START
#define ABC_NAMESPACE_IMPL_END
int Mig_ManTypeNum(Mig_Man_t *p, int Type)
int Mig_ManSuppSize2_rec(Mig_Man_t *p, int iObj)
void Mig_ManSetRefs(Mig_Man_t *p)
int Mig_ManMuxNum(Mig_Man_t *p)
void Mig_ManStop(Mig_Man_t *p)
int Mig_ManAndNum(Mig_Man_t *p)
ABC_NAMESPACE_IMPL_START Mig_Man_t * Mig_ManStart()
DECLARATIONS ///.
int Mig_ManSuppSizeOne(Mig_Obj_t *pObj)
int Mig_ManSuppSizeTest(Mig_Man_t *p)
int Mig_ManSuppSize_rec(Mig_Obj_t *pObj)
int Mig_ManXorNum(Mig_Man_t *p)
struct Mig_Obj_t_ Mig_Obj_t
#define Mig_ManForEachNode(p, pObj)
#define Mig_ManForEachObj(p, pObj)
MACRO DEFINITIONS ///.
#define Mig_ObjForEachFaninId(p, iFanin, i)
#define MIG_NONE
INCLUDES ///.
struct Mig_Man_t_ Mig_Man_t
#define Vec_PtrForEachEntry(Type, vVec, pEntry, i)
MACRO DEFINITIONS ///.