New APIs of the truth table package.

This commit is contained in:
Alan Mishchenko 2018-09-21 18:20:46 -07:00
parent a9815b75ab
commit 53ba28772e
2 changed files with 31 additions and 2 deletions

View File

@ -13214,8 +13214,8 @@ int Abc_CommandTest( Abc_Frame_t * pAbc, int argc, char ** argv )
}
*/
{
extern void Abc_EnumerateFuncs( int nDecMax, int nDivMax, int fVerbose );
Abc_EnumerateFuncs( 4, 7, 0 );
// extern void Abc_EnumerateFuncs( int nDecMax, int nDivMax, int fVerbose );
// Abc_EnumerateFuncs( 4, 7, 0 );
}
/*
if ( fNewAlgo )
@ -13267,6 +13267,7 @@ int Abc_CommandTest( Abc_Frame_t * pAbc, int argc, char ** argv )
}
// Abc_NtkComputePaths( Abc_FrameReadNtk(pAbc) );
//Dau_NetworkEnumTest();
//Ext_TruthDiagnoseTest();
return 0;
usage:
Abc_Print( -2, "usage: test [-CKDNM] [-aovwh] <file_name>\n" );

View File

@ -1154,6 +1154,10 @@ static inline int Abc_Tt6HasVar( word t, int iVar )
{
return ((t >> (1<<iVar)) & s_Truths6Neg[iVar]) != (t & s_Truths6Neg[iVar]);
}
static inline int Abc_Tt6XorVar( word t, int iVar )
{
return ((t >> (1<<iVar)) & s_Truths6Neg[iVar]) == ~(t & s_Truths6Neg[iVar]);
}
static inline int Abc_TtHasVar( word * t, int nVars, int iVar )
{
assert( iVar < nVars );
@ -3106,6 +3110,20 @@ static inline int Abc_Tt4Check( int t )
SeeAlso []
***********************************************************************/
static inline int Abc_Tt6VarsAreSymmetric( word t, int iVar, int jVar )
{
word * s_PMasks = s_PPMasks[iVar][jVar];
int shift = (1 << jVar) - (1 << iVar);
assert( iVar < jVar );
return ((t & s_PMasks[1]) << shift) == (t & s_PMasks[2]);
}
static inline int Abc_Tt6VarsAreAntiSymmetric( word t, int iVar, int jVar )
{
word * s_PMasks = s_PPMasks[iVar][jVar];
int shift = (1 << jVar) + (1 << iVar);
assert( iVar < jVar );
return ((t & (s_PMasks[1] >> (1 << iVar))) << shift) == (t & (s_PMasks[2] << (1 << iVar)));
}
static inline int Abc_TtVarsAreSymmetric( word * pTruth, int nVars, int i, int j, word * pCof0, word * pCof1 )
{
int nWords = Abc_TtWordNum( nVars );
@ -3116,6 +3134,16 @@ static inline int Abc_TtVarsAreSymmetric( word * pTruth, int nVars, int i, int j
Abc_TtCofactor0( pCof1, nWords, j );
return Abc_TtEqual( pCof0, pCof1, nWords );
}
static inline int Abc_TtVarsAreAntiSymmetric( word * pTruth, int nVars, int i, int j, word * pCof0, word * pCof1 )
{
int nWords = Abc_TtWordNum( nVars );
assert( i < nVars && j < nVars );
Abc_TtCofactor0p( pCof0, pTruth, nWords, i );
Abc_TtCofactor1p( pCof1, pTruth, nWords, i );
Abc_TtCofactor0( pCof0, nWords, j );
Abc_TtCofactor1( pCof1, nWords, j );
return Abc_TtEqual( pCof0, pCof1, nWords );
}
static inline int Abc_TtIsFullySymmetric( word * pTruth, int nVars )
{
int m, v, Polar = 0, Seen = 0;