diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2012-10-28 19:42:20 -0700 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2012-10-28 19:42:20 -0700 |
commit | 68d360c2d0b696b27250973613e187fea0b7c9c1 (patch) | |
tree | e129782663b81b539396e59083897b59d56fc1ee /src/base/abci/abcRec3.c | |
parent | f5a8cf99c0f0b89297833018256f4efa4dac6cb0 (diff) | |
download | abc-68d360c2d0b696b27250973613e187fea0b7c9c1.tar.gz abc-68d360c2d0b696b27250973613e187fea0b7c9c1.tar.bz2 abc-68d360c2d0b696b27250973613e187fea0b7c9c1.zip |
Move truth table code into a separte file.
Diffstat (limited to 'src/base/abci/abcRec3.c')
-rw-r--r-- | src/base/abci/abcRec3.c | 43 |
1 files changed, 1 insertions, 42 deletions
diff --git a/src/base/abci/abcRec3.c b/src/base/abci/abcRec3.c index 5f9b6b4f..ed6148ab 100644 --- a/src/base/abci/abcRec3.c +++ b/src/base/abci/abcRec3.c @@ -24,6 +24,7 @@ #include "aig/gia/giaAig.h" #include "misc/vec/vecMem.h" #include "bool/lucky/lucky.h" +#include "misc/util/utilTruth.h" ABC_NAMESPACE_IMPL_START @@ -407,48 +408,6 @@ void Lms_GiaProfilesPrint( Gia_Man_t * p ) /**Function************************************************************* - Synopsis [Stretch truthtable to have more input variables.] - - Description [] - - SideEffects [] - - SeeAlso [] - -***********************************************************************/ -static void Abc_TtStretch5( unsigned * pInOut, int nVarS, int nVarB ) -{ - int w, i, step, nWords; - if ( nVarS == nVarB ) - return; - assert( nVarS < nVarB ); - step = Abc_TruthWordNum(nVarS); - nWords = Abc_TruthWordNum(nVarB); - if ( step == nWords ) - return; - assert( step < nWords ); - for ( w = 0; w < nWords; w += step ) - for ( i = 0; i < step; i++ ) - pInOut[w + i] = pInOut[i]; -} -static void Abc_TtStretch6( word * pInOut, int nVarS, int nVarB ) -{ - int w, i, step, nWords; - if ( nVarS == nVarB ) - return; - assert( nVarS < nVarB ); - step = Abc_Truth6WordNum(nVarS); - nWords = Abc_Truth6WordNum(nVarB); - if ( step == nWords ) - return; - assert( step < nWords ); - for ( w = 0; w < nWords; w += step ) - for ( i = 0; i < step; i++ ) - pInOut[w + i] = pInOut[i]; -} - -/**Function************************************************************* - Synopsis [Compute support sizes for each CO.] Description [] |