diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2017-09-18 08:27:05 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2017-09-18 08:27:05 -0700 |
| commit | 3a1032c151360c99334c559d93b0068bf4b2a3f5 (patch) | |
| tree | a7581775285b0fbc6f37b0f9538e7c9d91a8f7d2 /src/opt | |
| parent | 7e7ba1562e1c868bd9ece855fb309ea9a409e38d (diff) | |
| download | abc-3a1032c151360c99334c559d93b0068bf4b2a3f5.tar.gz abc-3a1032c151360c99334c559d93b0068bf4b2a3f5.tar.bz2 abc-3a1032c151360c99334c559d93b0068bf4b2a3f5.zip | |
Maintenance and updates.
Diffstat (limited to 'src/opt')
| -rw-r--r-- | src/opt/dau/dauCanon.c | 82 |
1 files changed, 0 insertions, 82 deletions
diff --git a/src/opt/dau/dauCanon.c b/src/opt/dau/dauCanon.c index 011f972a..4bc0f9c5 100644 --- a/src/opt/dau/dauCanon.c +++ b/src/opt/dau/dauCanon.c @@ -40,88 +40,6 @@ static word s_CMasks6[5] = { //////////////////////////////////////////////////////////////////////// /// FUNCTION DEFINITIONS /// //////////////////////////////////////////////////////////////////////// - -/**Function************************************************************* - - Synopsis [Compares Cof0 and Cof1.] - - Description [] - - SideEffects [] - - SeeAlso [] - -***********************************************************************/ -static inline int Abc_TtCompare1VarCofs( word * pTruth, int nWords, int iVar ) -{ - if ( nWords == 1 ) - { - word Cof0 = pTruth[0] & s_Truths6Neg[iVar]; - word Cof1 = (pTruth[0] >> (1 << iVar)) & s_Truths6Neg[iVar]; - if ( Cof0 != Cof1 ) - return Cof0 < Cof1 ? -1 : 1; - return 0; - } - if ( iVar <= 5 ) - { - word Cof0, Cof1; - int w, shift = (1 << iVar); - for ( w = 0; w < nWords; w++ ) - { - Cof0 = pTruth[w] & s_Truths6Neg[iVar]; - Cof1 = (pTruth[w] >> shift) & s_Truths6Neg[iVar]; - if ( Cof0 != Cof1 ) - return Cof0 < Cof1 ? -1 : 1; - } - return 0; - } - // if ( iVar > 5 ) - { - word * pLimit = pTruth + nWords; - int i, iStep = Abc_TtWordNum(iVar); - assert( nWords >= 2 ); - for ( ; pTruth < pLimit; pTruth += 2*iStep ) - for ( i = 0; i < iStep; i++ ) - if ( pTruth[i] != pTruth[i + iStep] ) - return pTruth[i] < pTruth[i + iStep] ? -1 : 1; - return 0; - } -} -static inline int Abc_TtCompare1VarCofsRev( word * pTruth, int nWords, int iVar ) -{ - if ( nWords == 1 ) - { - word Cof0 = pTruth[0] & s_Truths6Neg[iVar]; - word Cof1 = (pTruth[0] >> (1 << iVar)) & s_Truths6Neg[iVar]; - if ( Cof0 != Cof1 ) - return Cof0 < Cof1 ? -1 : 1; - return 0; - } - if ( iVar <= 5 ) - { - word Cof0, Cof1; - int w, shift = (1 << iVar); - for ( w = nWords - 1; w >= 0; w-- ) - { - Cof0 = pTruth[w] & s_Truths6Neg[iVar]; - Cof1 = (pTruth[w] >> shift) & s_Truths6Neg[iVar]; - if ( Cof0 != Cof1 ) - return Cof0 < Cof1 ? -1 : 1; - } - return 0; - } - // if ( iVar > 5 ) - { - word * pLimit = pTruth + nWords; - int i, iStep = Abc_TtWordNum(iVar); - assert( nWords >= 2 ); - for ( pLimit -= 2*iStep; pLimit >= pTruth; pLimit -= 2*iStep ) - for ( i = iStep - 1; i >= 0; i-- ) - if ( pLimit[i] != pLimit[i + iStep] ) - return pLimit[i] < pLimit[i + iStep] ? -1 : 1; - return 0; - } -} /**Function************************************************************* |