47 if (
p->nTravIds >= (1<<30)-1 )
50 for ( i = 0; i <
p->nCis; i++ )
51 p->pCis[i].TravId = 0;
52 for ( i = 0; i <
p->nCos; i++ )
53 p->pCos[i].TravId = 0;
55 assert(
p->nTravIds < (1<<30)-1 );
75 pBox = Tim_ManBox(
p, iBox );
96 pBox = Tim_ManBox(
p, iBox );
117 pBox = Tim_ManBox(
p, iBox );
119 pObj->
TravId =
p->nTravIds - 1;
138 pBox = Tim_ManBox(
p, iBox );
140 pObj->
TravId =
p->nTravIds - 1;
158 return p->pCis[iCi].TravId ==
p->nTravIds;
176 return p->pCos[iCo].TravId ==
p->nTravIds;
#define ABC_NAMESPACE_IMPL_START
#define ABC_NAMESPACE_IMPL_END
#define Tim_ManBoxForEachInput(p, pBox, pObj, i)
struct Tim_Obj_t_ Tim_Obj_t
typedefABC_NAMESPACE_HEADER_START struct Tim_Box_t_ Tim_Box_t
INCLUDES ///.
#define Tim_ManBoxForEachOutput(p, pBox, pObj, i)
void Tim_ManSetPreviousTravIdBoxInputs(Tim_Man_t *p, int iBox)
void Tim_ManSetPreviousTravIdBoxOutputs(Tim_Man_t *p, int iBox)
int Tim_ManIsCoTravIdCurrent(Tim_Man_t *p, int iCo)
ABC_NAMESPACE_IMPL_START void Tim_ManIncrementTravId(Tim_Man_t *p)
DECLARATIONS ///.
void Tim_ManSetCurrentTravIdBoxInputs(Tim_Man_t *p, int iBox)
void Tim_ManSetCurrentTravIdBoxOutputs(Tim_Man_t *p, int iBox)
int Tim_ManIsCiTravIdCurrent(Tim_Man_t *p, int iCi)
typedefABC_NAMESPACE_HEADER_START struct Tim_Man_t_ Tim_Man_t
INCLUDES ///.