diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2005-12-22 08:01:00 -0800 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2005-12-22 08:01:00 -0800 |
| commit | 457e243e588e7ed5f39251784335e254a0c9e711 (patch) | |
| tree | 751d7b416e66e416983760d0b95d79bb24371309 /src/map/fpga | |
| parent | 37f19d8dfb17605abab38110beec5fc17413e635 (diff) | |
| download | abc-457e243e588e7ed5f39251784335e254a0c9e711.tar.gz abc-457e243e588e7ed5f39251784335e254a0c9e711.tar.bz2 abc-457e243e588e7ed5f39251784335e254a0c9e711.zip | |
Version abc51222
Diffstat (limited to 'src/map/fpga')
| -rw-r--r-- | src/map/fpga/fpgaUtils.c | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/src/map/fpga/fpgaUtils.c b/src/map/fpga/fpgaUtils.c index f4eefa8c..b951fd8f 100644 --- a/src/map/fpga/fpgaUtils.c +++ b/src/map/fpga/fpgaUtils.c @@ -51,11 +51,11 @@ static Fpga_Man_t * s_pMan = NULL; ***********************************************************************/ Fpga_NodeVec_t * Fpga_MappingDfs( Fpga_Man_t * pMan, int fCollectEquiv ) { - Fpga_NodeVec_t * vNodes, * vNodesCo; + Fpga_NodeVec_t * vNodes;//, * vNodesCo; Fpga_Node_t * pNode; int i; // collect the CO nodes by level - vNodesCo = Fpga_MappingOrderCosByLevel( pMan ); +// vNodesCo = Fpga_MappingOrderCosByLevel( pMan ); // start the array vNodes = Fpga_NodeVecAlloc( 100 ); // collect the PIs @@ -66,17 +66,17 @@ Fpga_NodeVec_t * Fpga_MappingDfs( Fpga_Man_t * pMan, int fCollectEquiv ) pNode->fMark0 = 1; } // perform the traversal -// for ( i = 0; i < pMan->nOutputs; i++ ) -// Fpga_MappingDfs_rec( Fpga_Regular(pMan->pOutputs[i]), vNodes, fCollectEquiv ); - for ( i = 0; i < vNodesCo->nSize; i++ ) - for ( pNode = vNodesCo->pArray[i]; pNode; pNode = (Fpga_Node_t *)pNode->pData0 ) - Fpga_MappingDfs_rec( pNode, vNodes, fCollectEquiv ); + for ( i = 0; i < pMan->nOutputs; i++ ) + Fpga_MappingDfs_rec( Fpga_Regular(pMan->pOutputs[i]), vNodes, fCollectEquiv ); +// for ( i = vNodesCo->nSize - 1; i >= 0 ; i-- ) +// for ( pNode = vNodesCo->pArray[i]; pNode; pNode = (Fpga_Node_t *)pNode->pData0 ) +// Fpga_MappingDfs_rec( pNode, vNodes, fCollectEquiv ); // clean the node marks for ( i = 0; i < vNodes->nSize; i++ ) vNodes->pArray[i]->fMark0 = 0; // for ( i = 0; i < pMan->nOutputs; i++ ) // Fpga_MappingUnmark_rec( Fpga_Regular(pMan->pOutputs[i]) ); - Fpga_NodeVecFree( vNodesCo ); +// Fpga_NodeVecFree( vNodesCo ); return vNodes; } @@ -954,7 +954,7 @@ Fpga_NodeVec_t * Fpga_MappingOrderCosByLevel( Fpga_Man_t * pMan ) Fpga_Node_t * pNode; Fpga_NodeVec_t * vNodes; int i, nLevels; - // get the largest node + // get the largest level of a CO nLevels = Fpga_MappingMaxLevel( pMan ); // allocate the array of nodes vNodes = Fpga_NodeVecAlloc( nLevels + 1 ); |