diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2013-05-05 01:54:11 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2013-05-05 01:54:11 -0700 |
| commit | a762c695d7c0d953d644c0c77a2948d378d0d624 (patch) | |
| tree | cd4fc1dc5462af045e0a87ba472de15fb7e00f1f /src/opt | |
| parent | 7f700af6e2fff06e2cf855b4a3845eadcf66086b (diff) | |
| download | abc-a762c695d7c0d953d644c0c77a2948d378d0d624.tar.gz abc-a762c695d7c0d953d644c0c77a2948d378d0d624.tar.bz2 abc-a762c695d7c0d953d644c0c77a2948d378d0d624.zip | |
New fast extract.
Diffstat (limited to 'src/opt')
| -rw-r--r-- | src/opt/fxu/fxu.c | 2 | ||||
| -rw-r--r-- | src/opt/fxu/fxuPair.c | 6 | ||||
| -rw-r--r-- | src/opt/fxu/fxuSelect.c | 2 |
3 files changed, 5 insertions, 5 deletions
diff --git a/src/opt/fxu/fxu.c b/src/opt/fxu/fxu.c index c6fb5796..0095abf9 100644 --- a/src/opt/fxu/fxu.c +++ b/src/opt/fxu/fxu.c @@ -47,7 +47,7 @@ static int s_MemoryPeak; The entries corresponding to the PI and objects with trivial covers are NULL. The number of extracted covers (not exceeding p->nNodesExt) is returned. Two other things are important for the correct operation of this procedure: - (1) The input covers do not have duplicated fanins and are SCC-ABC_FREE. + (1) The input covers do not have duplicated fanins and are SCC-free. (2) The fanins array contains the numbers of the fanin objects.] SideEffects [] diff --git a/src/opt/fxu/fxuPair.c b/src/opt/fxu/fxuPair.c index d040abe9..32822592 100644 --- a/src/opt/fxu/fxuPair.c +++ b/src/opt/fxu/fxuPair.c @@ -89,7 +89,7 @@ void Fxu_PairCanonicize( Fxu_Cube ** ppCube1, Fxu_Cube ** ppCube2 ) pLit2 = pLit2->pHNext; continue; } - assert( pLit1 && pLit2 ); // this is true if the covers are SCC-ABC_FREE + assert( pLit1 && pLit2 ); // this is true if the covers are SCC-free if ( pLit1->iVar > pLit2->iVar ) { // swap the cubes pCubeTemp = *ppCube1; @@ -152,7 +152,7 @@ unsigned Fxu_PairHashKeyArray( Fxu_Matrix * p, int piVarsC1[], int piVarsC2[], i Synopsis [Computes the hash key of the divisor represented by the pair of cubes.] Description [Goes through the variables in both cubes. Skips the identical - ones (this corresponds to making the cubes cube-ABC_FREE). Computes the hash + ones (this corresponds to making the cubes cube-free). Computes the hash value of the cubes. Assigns the number of literals in the base and in the cubes without base.] @@ -181,7 +181,7 @@ unsigned Fxu_PairHashKey( Fxu_Matrix * p, Fxu_Cube * pCube1, Fxu_Cube * pCube2, if ( pLit1 && pLit2 ) { if ( pLit1->iVar == pLit2->iVar ) - { // ensure cube-ABC_FREE + { // ensure cube-free pLit1 = pLit1->pHNext; pLit2 = pLit2->pHNext; // add this literal to the base diff --git a/src/opt/fxu/fxuSelect.c b/src/opt/fxu/fxuSelect.c index c9945926..da55eb82 100644 --- a/src/opt/fxu/fxuSelect.c +++ b/src/opt/fxu/fxuSelect.c @@ -419,7 +419,7 @@ void Fxu_MatrixGetDoubleVars( Fxu_Matrix * p, Fxu_Double * pDouble, if ( pLit1 && pLit2 ) { if ( pLit1->iVar == pLit2->iVar ) - { // ensure cube-ABC_FREE + { // ensure cube-free pLit1 = pLit1->pHNext; pLit2 = pLit2->pHNext; } |