diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2014-04-03 00:39:48 -0700 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2014-04-03 00:39:48 -0700 |
commit | ffea3a2c849bc774396f3c8c191c12fb16b744d1 (patch) | |
tree | f417a97c21ceba23e37f41aaf6884f40a365a631 /src/map/if/ifCut.c | |
parent | 9291ab9f50a38717827a30f90418b3ecfa5110df (diff) | |
download | abc-ffea3a2c849bc774396f3c8c191c12fb16b744d1.tar.gz abc-ffea3a2c849bc774396f3c8c191c12fb16b744d1.tar.bz2 abc-ffea3a2c849bc774396f3c8c191c12fb16b744d1.zip |
Improvements to technology mapping.
Diffstat (limited to 'src/map/if/ifCut.c')
-rw-r--r-- | src/map/if/ifCut.c | 10 |
1 files changed, 3 insertions, 7 deletions
diff --git a/src/map/if/ifCut.c b/src/map/if/ifCut.c index 9f239707..d7166baf 100644 --- a/src/map/if/ifCut.c +++ b/src/map/if/ifCut.c @@ -215,7 +215,6 @@ int If_CutMergeOrdered_( If_Man_t * p, If_Cut_t * pC0, If_Cut_t * pC1, If_Cut_t p->pPerm[0][i] = p->pPerm[1][i] = p->pPerm[2][i] = i; pC->pLeaves[i] = pC0->pLeaves[i]; } - p->nShared = nLimit; pC->nLeaves = nLimit; pC->uSign = pC0->uSign | pC1->uSign; p->uSharedMask = Abc_InfoMask( nLimit ); @@ -259,7 +258,6 @@ FlushCut0: p->pPerm[0][i] = c; pC->pLeaves[c++] = pC0->pLeaves[i++]; } - p->nShared = s; pC->nLeaves = c; pC->uSign = pC0->uSign | pC1->uSign; assert( c > 0 ); @@ -272,7 +270,6 @@ FlushCut1: p->pPerm[1][k] = c; pC->pLeaves[c++] = pC1->pLeaves[k++]; } - p->nShared = s; pC->nLeaves = c; pC->uSign = pC0->uSign | pC1->uSign; assert( c > 0 ); @@ -312,7 +309,7 @@ int If_CutMergeOrdered( If_Man_t * p, If_Cut_t * pC0, If_Cut_t * pC1, If_Cut_t * } // compare two cuts with different numbers - i = k = c = s = 0; p->nShared = 0; + i = k = c = s = 0; if ( nSizeC0 == 0 ) goto FlushCut1; if ( nSizeC1 == 0 ) goto FlushCut0; while ( 1 ) @@ -330,7 +327,7 @@ int If_CutMergeOrdered( If_Man_t * p, If_Cut_t * pC0, If_Cut_t * pC1, If_Cut_t * } else { - pC->pLeaves[c++] = pC0->pLeaves[i++]; k++; p->nShared++; + pC->pLeaves[c++] = pC0->pLeaves[i++]; k++; if ( i == nSizeC0 ) goto FlushCut1; if ( k == nSizeC1 ) goto FlushCut0; } @@ -374,7 +371,7 @@ int If_CutMerge( If_Man_t * p, If_Cut_t * pCut0, If_Cut_t * pCut1, If_Cut_t * pC int * pC = pCut->pLeaves; int i, k, c; // compare two cuts with different numbers - c = nSize0; p->nShared = 0; + c = nSize0; for ( i = 0; i < nSize1; i++ ) { for ( k = 0; k < nSize0; k++ ) @@ -383,7 +380,6 @@ int If_CutMerge( If_Man_t * p, If_Cut_t * pCut0, If_Cut_t * pCut1, If_Cut_t * pC if ( k < nSize0 ) { p->pPerm[1][i] = k; - p->nShared++; continue; } if ( c == nLutSize ) |