Home
last modified time | relevance | path

Searched refs:vRequired (Results 1 – 10 of 10) sorted by relevance

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/ivy/
H A DivyObj.c123 if ( p->vRequired && Vec_IntSize(p->vRequired) <= pObj->Id ) in Ivy_ObjCreate()
124 Vec_IntFillExtra( p->vRequired, 2 * Vec_IntSize(p->vRequired), 1000000 ); in Ivy_ObjCreate()
368 if ( p->vRequired ) in Ivy_ObjReplace()
370 int ReqNew = Vec_IntEntry(p->vRequired, pObjOld->Id); in Ivy_ObjReplace()
371 if ( ReqNew < Vec_IntEntry(p->vRequired, pObjNew->Id) ) in Ivy_ObjReplace()
373 Vec_IntWriteEntry( p->vRequired, pObjNew->Id, ReqNew ); in Ivy_ObjReplace()
H A DivyRwrAlg.c51 Vec_Int_t * vRequired; in Ivy_ManRewriteAlg() local
56 vRequired = fUpdateLevel? Ivy_ManRequiredLevels( p ) : NULL; in Ivy_ManRewriteAlg()
91 LevelR = vRequired? Vec_IntEntry(vRequired, pObj->Id) : 1000000; in Ivy_ManRewriteAlg()
106 if ( vRequired ) Vec_IntFree( vRequired ); in Ivy_ManRewriteAlg()
H A DivyUtil.c422 assert( p->fFanout && p->vRequired ); in Ivy_ObjLevelRNew()
426 Required = Vec_IntEntry(p->vRequired, pFanout->Id); in Ivy_ObjLevelRNew()
452 if ( Vec_IntEntry(p->vRequired, pFanin->Id) > ReqNew - 1 ) in Ivy_ObjUpdateLevelR_rec()
454 Vec_IntWriteEntry( p->vRequired, pFanin->Id, ReqNew - 1 ); in Ivy_ObjUpdateLevelR_rec()
461 if ( Vec_IntEntry(p->vRequired, pFanin->Id) > ReqNew - 1 ) in Ivy_ObjUpdateLevelR_rec()
463 Vec_IntWriteEntry( p->vRequired, pFanin->Id, ReqNew - 1 ); in Ivy_ObjUpdateLevelR_rec()
H A DivyRwr.c124 Vec_IntFree( p->vRequired ), p->vRequired = NULL; in Ivy_ManRewritePre()
171 Required = fUpdateLevel? Vec_IntEntry( pMan->vRequired, pNode->Id ) : 1000000; in Ivy_NodeRewrite()
522 Required = fUpdateLevel? Vec_IntEntry( p->vRequired, pRoot->Id ) : 1000000; in Ivy_GraphUpdateNetwork()
H A DivyDfs.c256 assert( p->vRequired == NULL ); in Ivy_ManRequiredLevels()
279 p->vRequired = vLevelsR; in Ivy_ManRequiredLevels()
H A DivyMan.c245 if ( p->vRequired ) Vec_IntFree( p->vRequired ); in Ivy_ManStop()
H A Divy.h117 Vec_Int_t * vRequired; // required times member
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/gia/
H A DgiaUtil.c641 Vec_Int_t * vRequired; in Gia_ManRequiredLevel() local
644 vRequired = Gia_ManReverseLevel( p ); in Gia_ManRequiredLevel()
646 LevelMax = Abc_MaxInt( LevelMax, Vec_IntEntry(vRequired, Gia_ObjId(p, pObj)) ); in Gia_ManRequiredLevel()
648 Vec_IntWriteEntry( vRequired, i, LevelMax - Vec_IntEntry(vRequired, i) ); in Gia_ManRequiredLevel()
649 return vRequired; in Gia_ManRequiredLevel()
H A DgiaLf.c95 Vec_Int_t vRequired; // required times member
121 …_ObjRequired( Lf_Man_t * p, int i ) { return Vec_IntEntry(&p->vRequired, i); … in Lf_ObjRequired()
122 …ObjSetRequired( Lf_Man_t * p, int i, int t ) { Vec_IntDowndateEntry(&p->vRequired, i, t); … in Lf_ObjSetRequired()
1544 Vec_IntFill( &p->vRequired, Gia_ManObjNum(p->pGia), ABC_INFINITY ); in Lf_ManSetMapRefs()
1653 Vec_IntFill( &p->vRequired, Gia_ManObjNum(p->pGia), ABC_INFINITY ); in Lf_ManCountMapRefs()
1966 Vec_IntFill( &p->vRequired, Gia_ManObjNum(pGia), ABC_INFINITY ); in Lf_ManAlloc()
2000 ABC_FREE( p->vRequired.pArray ); in Lf_ManFree()
H A DgiaNf.c97 Vec_Int_t vRequired; // required times (2x) member
135 …ed( Nf_Man_t * p, int i, int c ) { return Vec_IntEntry(&p->vRequired, Abc_Var2Lit(i,c… in Nf_ObjRequired()
136 …equired( Nf_Man_t * p,int i, int c, int f ) { Vec_IntWriteEntry(&p->vRequired, Abc_Var2Lit(i,c… in Nf_ObjSetRequired()
389 Vec_IntFill( &p->vRequired, 2*Gia_ManObjNum(pGia), SCL_INFINITY ); // required times (2x) in Nf_StoCreate()
421 ABC_FREE( p->vRequired.pArray ); in Nf_StoDelete()
1425 Vec_IntFill( &p->vRequired, nLits, SCL_INFINITY ); in Nf_ManSetOutputRequireds()