diff options
Diffstat (limited to 'src/map/fpga/fpgaMatch.c')
-rw-r--r-- | src/map/fpga/fpgaMatch.c | 53 |
1 files changed, 0 insertions, 53 deletions
diff --git a/src/map/fpga/fpgaMatch.c b/src/map/fpga/fpgaMatch.c index 599662f7..63ee682d 100644 --- a/src/map/fpga/fpgaMatch.c +++ b/src/map/fpga/fpgaMatch.c @@ -777,59 +777,6 @@ float Fpga_FindBestNode( Fpga_Man_t * p, Fpga_NodeVec_t * vNodes, Fpga_Node_t ** return Gain; } -/**function************************************************************* - - synopsis [Performs area minimization using a heuristic algorithm.] - - description [] - - sideeffects [] - - seealso [] - -***********************************************************************/ -void Fpga_MappingExplore( Fpga_Man_t * p ) -{ - Fpga_Cut_t * pCutBest; - Fpga_Node_t * pNodeBest; - Fpga_NodeVec_t * vNodes; - float Area, Gain, CutArea1, CutArea2; - int i; - - // compute the arrival times - Fpga_TimePropagateArrival( p ); - p->fRequiredGlo = Fpga_TimeComputeArrivalMax( p ); - Fpga_TimeComputeRequired( p, p->fRequiredGlo ); - - // assign the refs - Area = Fpga_MappingSetRefsAndArea( p ); - // collect the nodes - vNodes = Fpga_MappingCollectRefed( p ); - // find the best node to update - for ( i = 0; Gain = Fpga_FindBestNode(p, vNodes, &pNodeBest, &pCutBest); i++ ) - { - // update the node - assert( pNodeBest->pCutBest != pCutBest ); - // deref the current cut - CutArea1 = Fpga_CutDeref( p, pNodeBest, pNodeBest->pCutBest, 0 ); - // ref the new cut - CutArea2 = Fpga_CutRef( p, pNodeBest, pCutBest, 0 ); - assert( CutArea1 - CutArea2 == Gain ); - printf( "Iteration %2d: Gain = %5.2f.\n", i, Gain ); - // update the node - pNodeBest->pCutBest = pCutBest; - // collect new nodes - Fpga_NodeVecFree( vNodes ); - vNodes = Fpga_MappingCollectRefed( p ); - // compute the arrival and required times - Fpga_TimePropagateArrival( p ); - Fpga_TimeComputeRequired( p, p->fRequiredGlo ); - } - - -} - - //////////////////////////////////////////////////////////////////////// /// END OF FILE /// //////////////////////////////////////////////////////////////////////// |