luke
/
abc
mirror of https://github.com/YosysHQ/abc.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Improvements to the truth table computations.

This commit is contained in:
Alan Mishchenko 2012-10-30 22:33:30 -07:00
parent 3dfa92f288
commit 32b09a1e7b
2 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/misc/util/utilTruth.h
View File

@ -642,7 +642,7 @@ static inline void Abc_TtPrintDigit( int Digit )
static inline void Abc_TtPrintHex( word * pTruth, int nVars ) static inline void Abc_TtPrintHex( word * pTruth, int nVars )
{ {
word * pThis, * pLimit = pTruth + Abc_TtWordNum(nVars); word * pThis, * pLimit = pTruth + Abc_TtWordNum(nVars);
int k, nDigits = 1 << (nVars-2); int k;
assert( nVars >= 2 ); assert( nVars >= 2 );
for ( pThis = pTruth; pThis < pLimit; pThis++ ) for ( pThis = pTruth; pThis < pLimit; pThis++ )
for ( k = 0; k < 16; k++ ) 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 ) static inline void Abc_TtPrintHexRev( word * pTruth, int nVars )
{ {
word * pThis; word * pThis;
int k, nDigits = 1 << (nVars-2); int k;
assert( nVars >= 2 ); assert( nVars >= 2 );
for ( pThis = pTruth + Abc_TtWordNum(nVars) - 1; pThis >= pTruth; pThis-- ) for ( pThis = pTruth + Abc_TtWordNum(nVars) - 1; pThis >= pTruth; pThis-- )
for ( k = 15; k >= 0; k-- ) 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 ) static inline void Abc_TtPrintHexSpecial( word * pTruth, int nVars )
{ {
word * pThis; word * pThis;
int k, nDigits = 1 << (nVars-2); int k;
assert( nVars >= 2 ); assert( nVars >= 2 );
for ( pThis = pTruth + Abc_TtWordNum(nVars) - 1; pThis >= pTruth; pThis-- ) for ( pThis = pTruth + Abc_TtWordNum(nVars) - 1; pThis >= pTruth; pThis-- )
for ( k = 0; k < 16; k++ ) 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 ) static inline void Abc_TtPrintBinary( word * pTruth, int nVars )
{ {
word * pThis, * pLimit = pTruth + Abc_TtWordNum(nVars); word * pThis, * pLimit = pTruth + Abc_TtWordNum(nVars);
int k, nDigits = 1 << (nVars-2); int k;
assert( nVars >= 2 ); assert( nVars >= 2 );
for ( pThis = pTruth; pThis < pLimit; pThis++ ) for ( pThis = pTruth; pThis < pLimit; pThis++ )
for ( k = 0; k < 64; k++ ) for ( k = 0; k < 64; k++ )

6
src/opt/dau/dauCanon.c
View File

@ -74,7 +74,7 @@ void Abc_TtConfactorTest7( word * pTruth, int nVars, int N )
{ {
word Cof[4][1024]; word Cof[4][1024];
int i, nWords = Abc_TtWordNum( nVars ); int i, nWords = Abc_TtWordNum( nVars );
int Counter = 0; // int Counter = 0;
for ( i = 0; i < nVars-1; i++ ) for ( i = 0; i < nVars-1; i++ )
{ {
Abc_TtCopy( Cof[0], pTruth, nWords, 0 ); Abc_TtCopy( Cof[0], pTruth, nWords, 0 );
@ -221,7 +221,7 @@ void Abc_TtConfactorTest4( word * pTruth, int nVars, int N )
{ {
word Cof[4][1024]; word Cof[4][1024];
int i, j, nWords = Abc_TtWordNum( nVars ); int i, j, nWords = Abc_TtWordNum( nVars );
int Counter = 0, Sum = 0; int Sum = 0;
for ( i = 0; i < nVars-1; i++ ) for ( i = 0; i < nVars-1; i++ )
for ( j = i+1; j < nVars; j++ ) for ( j = i+1; j < nVars; j++ )
{ {
@ -508,7 +508,7 @@ void Abc_TtConfactorTest10( word * pTruth, int nVars, int N )
void Abc_TtConfactorTest( word * pTruth, int nVars, int N ) void Abc_TtConfactorTest( word * pTruth, int nVars, int N )
{ {
char pCanonPerm[32]; char pCanonPerm[32];
static word pCopy1[1024]; // static word pCopy1[1024];
static word pCopy2[1024]; static word pCopy2[1024];
int nWords = Abc_TtWordNum( nVars ); int nWords = Abc_TtWordNum( nVars );