From 2f926f2fafba8dc2ec073c51b5ac9fdabd9ad201 Mon Sep 17 00:00:00 2001 From: Alan Mishchenko Date: Sun, 30 Mar 2014 12:07:49 -0700 Subject: Improving cut computation. --- src/aig/gia/giaKf.c | 20 +------------------- 1 file changed, 1 insertion(+), 19 deletions(-) (limited to 'src/aig/gia/giaKf.c') diff --git a/src/aig/gia/giaKf.c b/src/aig/gia/giaKf.c index ad3aca53..d7941732 100644 --- a/src/aig/gia/giaKf.c +++ b/src/aig/gia/giaKf.c @@ -534,14 +534,7 @@ static inline int Kf_SetCutIsContainedSimple( Kf_Cut_t * pBase, Kf_Cut_t * pCut int * pB = pBase->pLeaves; int * pC = pCut->pLeaves; int i, k; - if ( nSizeB == nSizeC ) - { - for ( i = 0; i < nSizeB; i++ ) - if ( pBase->pLeaves[i] != pCut->pLeaves[i] ) - return 0; - return 1; - } - assert( nSizeB > nSizeC ); + assert( nSizeB >= nSizeC ); for ( i = 0; i < nSizeC; i++ ) { for ( k = 0; k < nSizeB; k++ ) @@ -560,17 +553,6 @@ static inline int Kf_SetMergeSimpleOne( Kf_Cut_t * pCut0, Kf_Cut_t * pCut1, Kf_C int * pC1 = pCut1->pLeaves; int * pC = pCut->pLeaves; int i, k, c; - // the case of the largest cut sizes - if ( nSize0 == nLutSize && nSize1 == nLutSize ) - { - for ( i = 0; i < nSize0; i++ ) - { - if ( pC0[i] != pC1[i] ) return 0; - pC[i] = pC0[i]; - } - pCut->nLeaves = nLutSize; - return 1; - } // compare two cuts with different numbers c = nSize0; for ( i = 0; i < nSize1; i++ ) -- cgit v1.2.3