diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2006-05-08 08:01:00 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2006-05-08 08:01:00 -0700 |
| commit | 7d0921330b1f4e789901b4c2450920e7c412f95f (patch) | |
| tree | bbbb9b1a6d92a989cd395e17945dda22503acccf /src/opt | |
| parent | 73b8d1dd79f4cca7821b78df0da999d6ea6872e6 (diff) | |
| download | abc-7d0921330b1f4e789901b4c2450920e7c412f95f.tar.gz abc-7d0921330b1f4e789901b4c2450920e7c412f95f.tar.bz2 abc-7d0921330b1f4e789901b4c2450920e7c412f95f.zip | |
Version abc60508
Diffstat (limited to 'src/opt')
| -rw-r--r-- | src/opt/cut/cutTruth.c | 11 |
1 files changed, 7 insertions, 4 deletions
diff --git a/src/opt/cut/cutTruth.c b/src/opt/cut/cutTruth.c index 54b3aac0..2e36c9e1 100644 --- a/src/opt/cut/cutTruth.c +++ b/src/opt/cut/cutTruth.c @@ -193,22 +193,25 @@ void Cut_TruthCompute( Cut_Man_t * p, Cut_Cut_t * pCut, Cut_Cut_t * pCut0, Cut_C if ( !p->pParams->fFancy ) return; + if ( pCut->nLeaves != 7 ) + return; + // count the total number of truth tables computed nTotal++; // MAPPING INTO ALTERA 6-2 LOGIC BLOCKS // call this procedure to find the minimum number of common variables in the cofactors // if this number is less or equal than 3, the cut can be implemented using the 6-2 logic block -// if ( Extra_TruthMinCofSuppOverlap( Cut_CutReadTruth(pCut), pCut->nVarsMax, NULL ) <= 3 ) -// nGood++; + if ( Extra_TruthMinCofSuppOverlap( Cut_CutReadTruth(pCut), pCut->nVarsMax, NULL ) <= 4 ) + nGood++; // MAPPING INTO ACTEL 2x2 CELLS // call this procedure to see if a semi-canonical form can be found in the lookup table // (if it exists, then a two-level 3-input LUT implementation of the cut exists) // Before this procedure is called, cell manager should be defined by calling // Cut_CellLoad (make sure file "cells22_daomap_iwls.txt" is available in the working dir) - if ( Cut_CellIsRunning() && pCut->nVarsMax <= 9 ) - nGood += Cut_CellTruthLookup( Cut_CutReadTruth(pCut), pCut->nVarsMax ); +// if ( Cut_CellIsRunning() && pCut->nVarsMax <= 9 ) +// nGood += Cut_CellTruthLookup( Cut_CutReadTruth(pCut), pCut->nVarsMax ); } |