Commit 2f1f0ac9 by Alan Mishchenko

Minor change to prevent assertion failure when verifying required times.

parent 082d27ed
...@@ -350,14 +350,14 @@ void Map_TimePropagateRequired( Map_Man_t * p, Map_NodeVec_t * vNodes ) ...@@ -350,14 +350,14 @@ void Map_TimePropagateRequired( Map_Man_t * p, Map_NodeVec_t * vNodes )
continue; continue;
// verify that the required times are propagated correctly // verify that the required times are propagated correctly
// if ( pNode->pCutBest[0] && (pNode->nRefAct[0] > 0 || pNode->pCutBest[1] == NULL) ) // if ( pNode->pCutBest[0] && (pNode->nRefAct[0] > 0 || pNode->pCutBest[1] == NULL) )
if ( pNode->pCutBest[0] && pNode->tRequired[0].Worst < MAP_FLOAT_LARGE ) if ( pNode->pCutBest[0] && pNode->tRequired[0].Worst < MAP_FLOAT_LARGE/2 )
{ {
Map_MatchComputeReqTimes( pNode->pCutBest[0], 0, ptReqOutTest ); Map_MatchComputeReqTimes( pNode->pCutBest[0], 0, ptReqOutTest );
assert( ptReqOutTest->Rise < pNode->tRequired[0].Rise + p->fEpsilon ); assert( ptReqOutTest->Rise < pNode->tRequired[0].Rise + p->fEpsilon );
assert( ptReqOutTest->Fall < pNode->tRequired[0].Fall + p->fEpsilon ); assert( ptReqOutTest->Fall < pNode->tRequired[0].Fall + p->fEpsilon );
} }
// if ( pNode->pCutBest[1] && (pNode->nRefAct[1] > 0 || pNode->pCutBest[0] == NULL) ) // if ( pNode->pCutBest[1] && (pNode->nRefAct[1] > 0 || pNode->pCutBest[0] == NULL) )
if ( pNode->pCutBest[1] && pNode->tRequired[1].Worst < MAP_FLOAT_LARGE ) if ( pNode->pCutBest[1] && pNode->tRequired[1].Worst < MAP_FLOAT_LARGE/2 )
{ {
Map_MatchComputeReqTimes( pNode->pCutBest[1], 1, ptReqOutTest ); Map_MatchComputeReqTimes( pNode->pCutBest[1], 1, ptReqOutTest );
assert( ptReqOutTest->Rise < pNode->tRequired[1].Rise + p->fEpsilon ); assert( ptReqOutTest->Rise < pNode->tRequired[1].Rise + p->fEpsilon );
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment