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 );
77 pObj->
TravId = p->nTravIds;
98 pObj->
TravId = p->nTravIds;
119 pObj->
TravId = p->nTravIds - 1;
140 pObj->
TravId = p->nTravIds - 1;
158 return p->pCis[iCi].TravId == p->nTravIds;
176 return p->pCos[iCo].TravId == p->nTravIds;
#define Tim_ManBoxForEachOutput(p, pBox, pObj, i)
ABC_NAMESPACE_IMPL_START void Tim_ManIncrementTravId(Tim_Man_t *p)
DECLARATIONS ///.
void Tim_ManSetPreviousTravIdBoxOutputs(Tim_Man_t *p, int iBox)
int Tim_ManIsCiTravIdCurrent(Tim_Man_t *p, int iCi)
for(p=first;p->value< newval;p=p->next)
void Tim_ManSetPreviousTravIdBoxInputs(Tim_Man_t *p, int iBox)
#define ABC_NAMESPACE_IMPL_END
#define Tim_ManBoxForEachInput(p, pBox, pObj, i)
void Tim_ManSetCurrentTravIdBoxInputs(Tim_Man_t *p, int iBox)
void Tim_ManSetCurrentTravIdBoxOutputs(Tim_Man_t *p, int iBox)
static Tim_Box_t * Tim_ManBox(Tim_Man_t *p, int i)
#define ABC_NAMESPACE_IMPL_START
typedefABC_NAMESPACE_HEADER_START struct Tim_Man_t_ Tim_Man_t
INCLUDES ///.
int Tim_ManIsCoTravIdCurrent(Tim_Man_t *p, int iCo)
typedefABC_NAMESPACE_HEADER_START struct Tim_Box_t_ Tim_Box_t
INCLUDES ///.