diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2012-10-30 22:33:30 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2012-10-30 22:33:30 -0700 |
| commit | 32b09a1e7bfe61f34fe362c3f6c2e645feeb38cf (patch) | |
| tree | d23e3618da5bc9ffd71d3aef0ef847f1b0326551 /src/misc | |
| parent | 3dfa92f288e41982d8243c4d103f28bd4ff440d9 (diff) | |
| download | abc-32b09a1e7bfe61f34fe362c3f6c2e645feeb38cf.tar.gz abc-32b09a1e7bfe61f34fe362c3f6c2e645feeb38cf.tar.bz2 abc-32b09a1e7bfe61f34fe362c3f6c2e645feeb38cf.zip | |
Improvements to the truth table computations.
Diffstat (limited to 'src/misc')
| -rw-r--r-- | src/misc/util/utilTruth.h | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/misc/util/utilTruth.h b/src/misc/util/utilTruth.h index 30508498..476fd66b 100644 --- a/src/misc/util/utilTruth.h +++ b/src/misc/util/utilTruth.h @@ -642,7 +642,7 @@ static inline void Abc_TtPrintDigit( int Digit ) static inline void Abc_TtPrintHex( word * pTruth, int nVars ) { word * pThis, * pLimit = pTruth + Abc_TtWordNum(nVars); - int k, nDigits = 1 << (nVars-2); + int k; assert( nVars >= 2 ); for ( pThis = pTruth; pThis < pLimit; pThis++ ) for ( k = 0; k < 16; k++ ) @@ -652,7 +652,7 @@ static inline void Abc_TtPrintHex( word * pTruth, int nVars ) static inline void Abc_TtPrintHexRev( word * pTruth, int nVars ) { word * pThis; - int k, nDigits = 1 << (nVars-2); + int k; assert( nVars >= 2 ); for ( pThis = pTruth + Abc_TtWordNum(nVars) - 1; pThis >= pTruth; pThis-- ) for ( k = 15; k >= 0; k-- ) @@ -662,7 +662,7 @@ static inline void Abc_TtPrintHexRev( word * pTruth, int nVars ) static inline void Abc_TtPrintHexSpecial( word * pTruth, int nVars ) { word * pThis; - int k, nDigits = 1 << (nVars-2); + int k; assert( nVars >= 2 ); for ( pThis = pTruth + Abc_TtWordNum(nVars) - 1; pThis >= pTruth; pThis-- ) for ( k = 0; k < 16; k++ ) @@ -685,7 +685,7 @@ static inline void Abc_TtPrintHexSpecial( word * pTruth, int nVars ) static inline void Abc_TtPrintBinary( word * pTruth, int nVars ) { word * pThis, * pLimit = pTruth + Abc_TtWordNum(nVars); - int k, nDigits = 1 << (nVars-2); + int k; assert( nVars >= 2 ); for ( pThis = pTruth; pThis < pLimit; pThis++ ) for ( k = 0; k < 64; k++ ) |